diff -Nru igraph-0.6.5~quantal1/INSTALL igraph-0.6.5/INSTALL
--- igraph-0.6.5~quantal1/INSTALL	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/INSTALL	2013-03-03 01:29:39.000000000 +0000
@@ -0,0 +1,370 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994-1996, 1999-2002, 2004-2011 Free Software Foundation,
+Inc.
+
+   Copying and distribution of this file, with or without modification,
+are permitted in any medium without royalty provided the copyright
+notice and this notice are preserved.  This file is offered as-is,
+without warranty of any kind.
+
+Basic Installation
+==================
+
+   Briefly, the shell commands `./configure; make; make install' should
+configure, build, and install this package.  The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.  Some packages provide this
+`INSTALL' file but do not implement all of the features documented
+below.  The lack of an optional feature in a given package is not
+necessarily a bug.  More recommendations for GNU packages can be found
+in *note Makefile Conventions: (standards)Makefile Conventions.
+
+   The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation.  It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions.  Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+   It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring.  Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+   If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release.  If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+   The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'.  You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+   The simplest way to compile this package is:
+
+  1. `cd' to the directory containing the package's source code and type
+     `./configure' to configure the package for your system.
+
+     Running `configure' might take a while.  While running, it prints
+     some messages telling which features it is checking for.
+
+  2. Type `make' to compile the package.
+
+  3. Optionally, type `make check' to run any self-tests that come with
+     the package, generally using the just-built uninstalled binaries.
+
+  4. Type `make install' to install the programs and any data files and
+     documentation.  When installing into a prefix owned by root, it is
+     recommended that the package be configured and built as a regular
+     user, and only the `make install' phase executed with root
+     privileges.
+
+  5. Optionally, type `make installcheck' to repeat any self-tests, but
+     this time using the binaries in their final installed location.
+     This target does not install anything.  Running this target as a
+     regular user, particularly if the prior `make install' required
+     root privileges, verifies that the installation completed
+     correctly.
+
+  6. You can remove the program binaries and object files from the
+     source code directory by typing `make clean'.  To also remove the
+     files that `configure' created (so you can compile the package for
+     a different kind of computer), type `make distclean'.  There is
+     also a `make maintainer-clean' target, but that is intended mainly
+     for the package's developers.  If you use it, you may have to get
+     all sorts of other programs in order to regenerate files that came
+     with the distribution.
+
+  7. Often, you can also type `make uninstall' to remove the installed
+     files again.  In practice, not all packages have tested that
+     uninstallation works correctly, even though it is required by the
+     GNU Coding Standards.
+
+  8. Some packages, particularly those that use Automake, provide `make
+     distcheck', which can by used by developers to test that all other
+     targets like `make install' and `make uninstall' work correctly.
+     This target is generally not run by end users.
+
+Compilers and Options
+=====================
+
+   Some systems require unusual options for compilation or linking that
+the `configure' script does not know about.  Run `./configure --help'
+for details on some of the pertinent environment variables.
+
+   You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment.  Here
+is an example:
+
+     ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+   *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+   You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory.  To do this, you can use GNU `make'.  `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script.  `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.  This
+is known as a "VPATH" build.
+
+   With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory.  After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+   On MacOS X 10.5 and later systems, you can create libraries and
+executables that work on multiple system types--known as "fat" or
+"universal" binaries--by specifying multiple `-arch' options to the
+compiler but only a single `-arch' option to the preprocessor.  Like
+this:
+
+     ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CPP="gcc -E" CXXCPP="g++ -E"
+
+   This is not guaranteed to produce working output in all cases, you
+may have to build one architecture at a time and combine the results
+using the `lipo' tool if you have problems.
+
+Installation Names
+==================
+
+   By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc.  You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX', where PREFIX must be an
+absolute file name.
+
+   You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files.  If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+   In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files.  Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.  In general, the
+default for these options is expressed in terms of `${prefix}', so that
+specifying just `--prefix' will affect all of the other directory
+specifications that were not explicitly provided.
+
+   The most portable way to affect installation locations is to pass the
+correct locations to `configure'; however, many packages provide one or
+both of the following shortcuts of passing variable assignments to the
+`make install' command line to change installation locations without
+having to reconfigure or recompile.
+
+   The first method involves providing an override variable for each
+affected directory.  For example, `make install
+prefix=/alternate/directory' will choose an alternate location for all
+directory configuration variables that were expressed in terms of
+`${prefix}'.  Any directories that were specified during `configure',
+but not in terms of `${prefix}', must each be overridden at install
+time for the entire installation to be relocated.  The approach of
+makefile variable overrides for each directory variable is required by
+the GNU Coding Standards, and ideally causes no recompilation.
+However, some platforms have known limitations with the semantics of
+shared libraries that end up requiring recompilation when using this
+method, particularly noticeable in packages that use GNU Libtool.
+
+   The second method involves providing the `DESTDIR' variable.  For
+example, `make install DESTDIR=/alternate/directory' will prepend
+`/alternate/directory' before all installation names.  The approach of
+`DESTDIR' overrides is not required by the GNU Coding Standards, and
+does not work on platforms that have drive letters.  On the other hand,
+it does better at avoiding recompilation issues, and works well even
+when some directory options were not specified in terms of `${prefix}'
+at `configure' time.
+
+Optional Features
+=================
+
+   If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+   Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System).  The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+   For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+   Some packages offer the ability to configure how verbose the
+execution of `make' will be.  For these packages, running `./configure
+--enable-silent-rules' sets the default to minimal output, which can be
+overridden with `make V=1'; while running `./configure
+--disable-silent-rules' sets the default to verbose, which can be
+overridden with `make V=0'.
+
+Particular systems
+==================
+
+   On HP-UX, the default C compiler is not ANSI C compatible.  If GNU
+CC is not installed, it is recommended to use the following options in
+order to use an ANSI C compiler:
+
+     ./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
+
+and if that doesn't work, install pre-built binaries of GCC for HP-UX.
+
+   HP-UX `make' updates targets which have the same time stamps as
+their prerequisites, which makes it generally unusable when shipped
+generated files such as `configure' are involved.  Use GNU `make'
+instead.
+
+   On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
+parse its `<wchar.h>' header file.  The option `-nodtk' can be used as
+a workaround.  If GNU CC is not installed, it is therefore recommended
+to try
+
+     ./configure CC="cc"
+
+and if that doesn't work, try
+
+     ./configure CC="cc -nodtk"
+
+   On Solaris, don't put `/usr/ucb' early in your `PATH'.  This
+directory contains several dysfunctional programs; working variants of
+these programs are available in `/usr/bin'.  So, if you need `/usr/ucb'
+in your `PATH', put it _after_ `/usr/bin'.
+
+   On Haiku, software installed for all users goes in `/boot/common',
+not `/usr/local'.  It is recommended to use the following options:
+
+     ./configure --prefix=/boot/common
+
+Specifying the System Type
+==========================
+
+   There may be some features `configure' cannot figure out
+automatically, but needs to determine by the type of machine the package
+will run on.  Usually, assuming the package is built to be run on the
+_same_ architectures, `configure' can figure that out, but if it prints
+a message saying it cannot guess the machine type, give it the
+`--build=TYPE' option.  TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+     CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+     OS
+     KERNEL-OS
+
+   See the file `config.sub' for the possible values of each field.  If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+   If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+   If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+   If you want to set default values for `configure' scripts to share,
+you can create a site shell script called `config.site' that gives
+default values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists.  Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+   Variables not defined in a site shell script can be set in the
+environment passed to `configure'.  However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost.  In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'.  For example:
+
+     ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf bug.  Until the bug is fixed you can use this workaround:
+
+     CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+   `configure' recognizes the following options to control how it
+operates.
+
+`--help'
+`-h'
+     Print a summary of all of the options to `configure', and exit.
+
+`--help=short'
+`--help=recursive'
+     Print a summary of the options unique to this package's
+     `configure', and exit.  The `short' variant lists options used
+     only in the top level, while the `recursive' variant lists options
+     also present in any nested packages.
+
+`--version'
+`-V'
+     Print the version of Autoconf used to generate the `configure'
+     script, and exit.
+
+`--cache-file=FILE'
+     Enable the cache: use and save the results of the tests in FILE,
+     traditionally `config.cache'.  FILE defaults to `/dev/null' to
+     disable caching.
+
+`--config-cache'
+`-C'
+     Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+     Do not print messages saying which checks are being made.  To
+     suppress all normal output, redirect it to `/dev/null' (any error
+     messages will still be shown).
+
+`--srcdir=DIR'
+     Look for the package's source code in directory DIR.  Usually
+     `configure' can determine that directory automatically.
+
+`--prefix=DIR'
+     Use DIR as the installation prefix.  *note Installation Names::
+     for more details, including other options available for fine-tuning
+     the installation locations.
+
+`--no-create'
+`-n'
+     Run the configure checks, but stop before creating any output
+     files.
+
+`configure' also accepts some other, not widely useful, options.  Run
+`configure --help' for more details.
+
diff -Nru igraph-0.6.5~quantal1/Makefile.in igraph-0.6.5/Makefile.in
--- igraph-0.6.5~quantal1/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/Makefile.in	2013-03-03 01:30:06.000000000 +0000
@@ -0,0 +1,908 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = .
+DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \
+	$(srcdir)/Makefile.in $(srcdir)/config.h.in \
+	$(srcdir)/igraph.pc.in $(srcdir)/igraph_Info.plist.in \
+	$(top_srcdir)/configure \
+	$(top_srcdir)/include/igraph_threading.h.in \
+	$(top_srcdir)/include/igraph_version.h.in \
+	$(top_srcdir)/interfaces/R/src/Makevars.win.in AUTHORS COPYING \
+	ChangeLog INSTALL NEWS TODO config.guess config.sub depcomp \
+	install-sh ltmain.sh missing ylwrap
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = config.h
+CONFIG_CLEAN_FILES = igraph.pc igraph_Info.plist \
+	interfaces/R/src/Makevars.win include/igraph_version.h \
+	include/igraph_threading.h
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
+	html-recursive info-recursive install-data-recursive \
+	install-dvi-recursive install-exec-recursive \
+	install-html-recursive install-info-recursive \
+	install-pdf-recursive install-ps-recursive install-recursive \
+	installcheck-recursive installdirs-recursive pdf-recursive \
+	ps-recursive uninstall-recursive
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(pkgconfigdir)"
+DATA = $(pkgconfig_DATA)
+RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive	\
+  distclean-recursive maintainer-clean-recursive
+AM_RECURSIVE_TARGETS = $(RECURSIVE_TARGETS:-recursive=) \
+	$(RECURSIVE_CLEAN_TARGETS:-recursive=) tags TAGS ctags CTAGS \
+	distdir dist dist-all distcheck
+ETAGS = etags
+CTAGS = ctags
+DIST_SUBDIRS = $(SUBDIRS)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__relativize = \
+  dir0=`pwd`; \
+  sed_first='s,^\([^/]*\)/.*$$,\1,'; \
+  sed_rest='s,^[^/]*/*,,'; \
+  sed_last='s,^.*/\([^/]*\)$$,\1,'; \
+  sed_butlast='s,/*[^/]*$$,,'; \
+  while test -n "$$dir1"; do \
+    first=`echo "$$dir1" | sed -e "$$sed_first"`; \
+    if test "$$first" != "."; then \
+      if test "$$first" = ".."; then \
+        dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \
+        dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \
+      else \
+        first2=`echo "$$dir2" | sed -e "$$sed_first"`; \
+        if test "$$first2" = "$$first"; then \
+          dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \
+        else \
+          dir2="../$$dir2"; \
+        fi; \
+        dir0="$$dir0"/"$$first"; \
+      fi; \
+    fi; \
+    dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \
+  done; \
+  reldir="$$dir2"
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+SUBDIRS = src tests interfaces
+DOC_FILES = $(top_builddir)/doc/book/Makefile.in \
+	$(top_srcdir)/doc/Makefile.in \
+	$(top_srcdir)/doc/igraph.3
+
+pkgconfigdir = @libdir@/pkgconfig
+pkgconfig_DATA = igraph.pc
+EXTRA_DIST = igraph.pc $(top_srcdir)/include/* $(DOC_FILES) \
+	examples $(top_srcdir)/interfaces/R/Makefile.in \
+	$(top_srcdir)/interfaces/R/DESCRIPTION.in \
+	$(top_srcdir)/interfaces/R/configure.in.in \
+	optional
+
+MAINTAINERCLEANFILES = Makefile.in
+CLEANFILES = 
+all: config.h
+	$(MAKE) $(AM_MAKEFLAGS) all-recursive
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+
+config.h: stamp-h1
+	@if test ! -f $@; then rm -f stamp-h1; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) stamp-h1; else :; fi
+
+stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status
+	@rm -f stamp-h1
+	cd $(top_builddir) && $(SHELL) ./config.status config.h
+$(srcdir)/config.h.in:  $(am__configure_deps) 
+	($(am__cd) $(top_srcdir) && $(AUTOHEADER))
+	rm -f stamp-h1
+	touch $@
+
+distclean-hdr:
+	-rm -f config.h stamp-h1
+igraph.pc: $(top_builddir)/config.status $(srcdir)/igraph.pc.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+igraph_Info.plist: $(top_builddir)/config.status $(srcdir)/igraph_Info.plist.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+interfaces/R/src/Makevars.win: $(top_builddir)/config.status $(top_srcdir)/interfaces/R/src/Makevars.win.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+include/igraph_version.h: $(top_builddir)/config.status $(top_srcdir)/include/igraph_version.h.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+include/igraph_threading.h: $(top_builddir)/config.status $(top_srcdir)/include/igraph_threading.h.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+
+distclean-libtool:
+	-rm -f libtool config.lt
+install-pkgconfigDATA: $(pkgconfig_DATA)
+	@$(NORMAL_INSTALL)
+	test -z "$(pkgconfigdir)" || $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)"
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \
+	done
+
+uninstall-pkgconfigDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir)
+
+# This directory's subdirectories are mostly independent; you can cd
+# into them and run `make' without going through this Makefile.
+# To change the values of `make' variables: instead of editing Makefiles,
+# (1) if the variable is set in `config.status', edit `config.status'
+#     (which will cause the Makefiles to be regenerated when you run `make');
+# (2) otherwise, pass the desired values on the `make' command line.
+$(RECURSIVE_TARGETS):
+	@fail= failcom='exit 1'; \
+	for f in x $$MAKEFLAGS; do \
+	  case $$f in \
+	    *=* | --[!k]*);; \
+	    *k*) failcom='fail=yes';; \
+	  esac; \
+	done; \
+	dot_seen=no; \
+	target=`echo $@ | sed s/-recursive//`; \
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  echo "Making $$target in $$subdir"; \
+	  if test "$$subdir" = "."; then \
+	    dot_seen=yes; \
+	    local_target="$$target-am"; \
+	  else \
+	    local_target="$$target"; \
+	  fi; \
+	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
+	  || eval $$failcom; \
+	done; \
+	if test "$$dot_seen" = "no"; then \
+	  $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
+	fi; test -z "$$fail"
+
+$(RECURSIVE_CLEAN_TARGETS):
+	@fail= failcom='exit 1'; \
+	for f in x $$MAKEFLAGS; do \
+	  case $$f in \
+	    *=* | --[!k]*);; \
+	    *k*) failcom='fail=yes';; \
+	  esac; \
+	done; \
+	dot_seen=no; \
+	case "$@" in \
+	  distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+	  *) list='$(SUBDIRS)' ;; \
+	esac; \
+	rev=''; for subdir in $$list; do \
+	  if test "$$subdir" = "."; then :; else \
+	    rev="$$subdir $$rev"; \
+	  fi; \
+	done; \
+	rev="$$rev ."; \
+	target=`echo $@ | sed s/-recursive//`; \
+	for subdir in $$rev; do \
+	  echo "Making $$target in $$subdir"; \
+	  if test "$$subdir" = "."; then \
+	    local_target="$$target-am"; \
+	  else \
+	    local_target="$$target"; \
+	  fi; \
+	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
+	  || eval $$failcom; \
+	done && test -z "$$fail"
+tags-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
+	done
+ctags-recursive:
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  test "$$subdir" = . || ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
+	done
+
+ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
+	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	mkid -fID $$unique
+tags: TAGS
+
+TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	set x; \
+	here=`pwd`; \
+	if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
+	  include_option=--etags-include; \
+	  empty_fix=.; \
+	else \
+	  include_option=--include; \
+	  empty_fix=; \
+	fi; \
+	list='$(SUBDIRS)'; for subdir in $$list; do \
+	  if test "$$subdir" = .; then :; else \
+	    test ! -f $$subdir/TAGS || \
+	      set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \
+	  fi; \
+	done; \
+	list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	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
+CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	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"
+
+distclean-tags:
+	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@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
+	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
+	  if test "$$subdir" = .; then :; else \
+	    test -d "$(distdir)/$$subdir" \
+	    || $(MKDIR_P) "$(distdir)/$$subdir" \
+	    || exit 1; \
+	  fi; \
+	done
+	@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
+	  if test "$$subdir" = .; then :; else \
+	    dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
+	    $(am__relativize); \
+	    new_distdir=$$reldir; \
+	    dir1=$$subdir; dir2="$(top_distdir)"; \
+	    $(am__relativize); \
+	    new_top_distdir=$$reldir; \
+	    echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \
+	    echo "     am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \
+	    ($(am__cd) $$subdir && \
+	      $(MAKE) $(AM_MAKEFLAGS) \
+	        top_distdir="$$new_top_distdir" \
+	        distdir="$$new_distdir" \
+		am__remove_distdir=: \
+		am__skip_length_check=: \
+		am__skip_mode_fix=: \
+	        distdir) \
+	      || exit 1; \
+	  fi; \
+	done
+	$(MAKE) $(AM_MAKEFLAGS) \
+	  top_distdir="$(top_distdir)" distdir="$(distdir)" \
+	  dist-hook
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__remove_distdir)
+
+dist-lzma: distdir
+	tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma
+	$(am__remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__remove_distdir)
+
+dist-tarZ: distdir
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__remove_distdir)
+
+dist-shar: distdir
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__remove_distdir)
+
+dist dist-all: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lzma*) \
+	  lzma -dc $(distdir).tar.lzma | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir); chmod a+w $(distdir)
+	mkdir $(distdir)/_build
+	mkdir $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure --srcdir=.. --prefix="$$dc_install_base" \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-recursive
+all-am: Makefile $(DATA) config.h
+installdirs: installdirs-recursive
+installdirs-am:
+	for dir in "$(DESTDIR)$(pkgconfigdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-recursive
+install-exec: install-exec-recursive
+install-data: install-data-recursive
+uninstall: uninstall-recursive
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-recursive
+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:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+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)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+	-test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES)
+clean: clean-recursive
+
+clean-am: clean-generic clean-libtool mostlyclean-am
+
+distclean: distclean-recursive
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic distclean-hdr \
+	distclean-libtool distclean-tags
+
+dvi: dvi-recursive
+
+dvi-am:
+
+html: html-recursive
+
+html-am:
+
+info: info-recursive
+
+info-am:
+
+install-data-am: install-pkgconfigDATA
+
+install-dvi: install-dvi-recursive
+
+install-dvi-am:
+
+install-exec-am:
+	@$(NORMAL_INSTALL)
+	$(MAKE) $(AM_MAKEFLAGS) install-exec-hook
+install-html: install-html-recursive
+
+install-html-am:
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-recursive
+
+install-pdf-am:
+
+install-ps: install-ps-recursive
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-recursive
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-recursive
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf: pdf-recursive
+
+pdf-am:
+
+ps: ps-recursive
+
+ps-am:
+
+uninstall-am: uninstall-pkgconfigDATA
+
+.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) all \
+	ctags-recursive install-am install-exec-am install-strip \
+	tags-recursive
+
+.PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
+	all all-am am--refresh check check-am clean clean-generic \
+	clean-libtool ctags ctags-recursive dist dist-all dist-bzip2 \
+	dist-gzip dist-hook dist-lzip dist-lzma dist-shar dist-tarZ \
+	dist-xz dist-zip distcheck distclean distclean-generic \
+	distclean-hdr distclean-libtool distclean-tags distcleancheck \
+	distdir distuninstallcheck dvi dvi-am html html-am info \
+	info-am install install-am install-data install-data-am \
+	install-dvi install-dvi-am install-exec install-exec-am \
+	install-exec-hook install-html install-html-am install-info \
+	install-info-am install-man install-pdf install-pdf-am \
+	install-pkgconfigDATA install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs installdirs-am \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags tags-recursive uninstall uninstall-am \
+	uninstall-pkgconfigDATA
+
+
+install-exec-hook:
+	if test -f $(top_builddir)/src/.libs/cygigraph-0.dll ; \
+		then cp $(top_builddir)/src/.libs/cygigraph-0.dll \
+		$(DESTDIR)$(libdir) ; fi
+
+install-info:
+	if test -f doc/igraph.info; then d="doc"; \
+         else d=$(srcdir); fi; \
+        $(INSTALL_DATA) $$d/igraph.info $(infodir); \
+        if $(SHELL) -c 'install-info --version' \
+           >/dev/null 2>&1; then \
+          install-info --infodir=$(infodir) $$d/igraph.info; \
+        else true; fi
+
+dist-hook:
+	rm -rf `find $(distdir)/examples -type d -name .arch-ids`
+
+.PHONY: framework msvc
+
+framework: all
+	rm -rf $(top_builddir)/igraph.framework
+	mkdir -p $(top_builddir)/igraph.framework/Versions/$(VERSION)/Headers
+	mkdir -p $(top_builddir)/igraph.framework/Versions/$(VERSION)/Resources
+	ln -s $(VERSION) $(top_builddir)/igraph.framework/Versions/Current
+	ln -s Versions/Current/Headers $(top_builddir)/igraph.framework/Headers
+	ln -s Versions/Current/Resources $(top_builddir)/igraph.framework/Resources
+	cp $(top_srcdir)/include/* $(top_builddir)/igraph.framework/Headers/
+	if [ $(top_builddir) != $(top_srcdir) ]; then cp $(top_builddir)/include/* $(top_builddir)/igraph.framework/Headers/; fi
+	cp $(top_builddir)/src/.libs/libigraph.dylib $(top_builddir)/igraph.framework/Versions/Current/igraph
+	ln -s Versions/Current/igraph $(top_builddir)/igraph.framework/igraph
+	cp $(top_builddir)/igraph_Info.plist $(top_builddir)/igraph.framework/Versions/Current/Resources/Info.plist
+
+test: all
+	for i in interfaces/*; do \
+		if [ -x $$i/test.sh ]; then \
+		  $$i/test.sh; \
+	 	fi; \
+	done
+
+msvc: all
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc
+	mkdir $(top_builddir)/igraph-$(VERSION)-msvc
+	mkdir $(top_builddir)/igraph-$(VERSION)-msvc/include
+	cp -r $(top_srcdir)/src $(top_builddir)/igraph-$(VERSION)-msvc/
+	cp -r $(top_srcdir)/include/*.h $(top_builddir)/igraph-$(VERSION)-msvc/include
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp -r $(top_builddir)/include $(top_builddir)/src $(top_builddir)/igraph-$(VERSION)-msvc; fi
+	cp -r $(top_srcdir)/msvc/include $(top_builddir)/igraph-$(VERSION)-msvc/winclude
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc/src/{.deps,.libs}
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc/src/config.h
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc/src/*.{o,lo,la}
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc/src/*~
+	rm -rf $(top_builddir)/igraph-$(VERSION)-msvc/include/*~
+	mkdir $(top_builddir)/igraph-$(VERSION)-msvc/winlib
+	$(top_srcdir)/tools/create-msvc-projectfile.py		\
+		$(top_builddir)/igraph-$(VERSION)-msvc 	\
+		$(top_srcdir)/msvc/igraph.vcproj        \
+		$(top_builddir)/src/Makefile
+	cp $(top_srcdir)/msvc/igraph.sln $(top_builddir)/igraph-$(VERSION)-msvc
+	cp -r $(top_srcdir)/msvc/igraphtest .
+	rm -rf igraph-$(VERSION)-msvc.zip
+	zip -r igraph-$(VERSION)-msvc.zip igraph-$(VERSION)-msvc igraphtest
+
+# 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 -Nru igraph-0.6.5~quantal1/NEWS-0.3 igraph-0.6.5/NEWS-0.3
--- igraph-0.6.5~quantal1/NEWS-0.3	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/NEWS-0.3	1970-01-01 00:00:00.000000000 +0000
@@ -1,95 +0,0 @@
-
-Changes in the C library
-------------------------
-
-* igraph_maxdegree added, calculates the maximum degree in the graph
-* igraph_grg_game, geometric random graphs
-* igraph_density, graph density calculation
-* push-relabel maximum flow algorithm added, igraph_maxflow_value
-* minimum cut functions added based on maximum flow:
-  igraph_st_mincut_value, igraph_mincut_value, the Stoer-Wagner
-  algorithm is implemented for undirected graphs
-* vertex connectivity functions, usually based on maximum flow:
-  igraph_st_vertex_connectivity, igraph_vertex_connectivity
-* edge connectivity functions, usually based on maximum flow:
-  igraph_st_edge_connectivity, igraph_edge_connectivity
-* other functions based on maximum flow: igraph_edge_disjoint_paths,
-  igraph_vertex_disjoint_paths, igraph_adhesion, igraph_cohesion
-* dimacs file format added
-* igraph_to_directed handles attributes
-* igraph_constraint calculation corrected, it handles weighted graphs
-* spinglass-based community structure detection, the Joerg Reichardt --
-  Stefan Bornholdt algorithm added: igraph_spinglass_community,
-  igraph_spinglass_my_community
-* igraph_extended_chordal_rings, it creates extended chordal rings
-* 'no' argument added to igraph_clusters, it is possible to calculate
-  the number of clusters without calculating the clusters themselves
-* minimum spanning tree functions keep attributes now and also the 
-  direction of the edges is kept in directed graphs
-* there are separate functions to calculate different types of
-  transitivity now
-* igraph_delete_vertices rewritten to allocate less memory for the new
-  graph 
-* neighborhood related functions added: igraph_neighborhood,
-  igraph_neighborhood_size, igraph_neighborhood_graphs
-* two new games added based on different node types:
-  igraph_preference_game and igraph_asymmetric_preference_game
-* Laplacian of a graph can be calculated by the igraph_laplacian function
-
-Changes in the R interface
---------------------------
-
-* bonpow function ported from SNA to calculate Bonacich power centrality
-* get.adjacency supports attributes now, this means that it sets the
-  colnames  and rownames attributes and can return attribute values in
-  the matrix instead of 0/1
-* grg.game, geometric random graphs
-* graph.density, graph density calculation
-* edge and vertex attributes can be added easily now when added new
-  edges with add.edges or new vertices with add.vertices
-* graph.data.frame creates graph from data frames, this can be used to 
-  create graphs with edge attributes easily
-* plot.igraph and tkplot can plot self-loop edges now
-* graph.edgelist to create a graph from an edge list, can also handle 
-  edge lists with symbolic names
-* get.edgelist has now a 'names' argument and can return symbolic
-  vertex names instead of vertex ids, by default id uses the 'name'
-  vertex attribute is returned 
-* printing graphs on screen also prints symbolic symbolic names
-  (the 'name' attribute if present)
-* maximum flow and minimum cut functions: graph.maxflow, graph.mincut
-* vertex and edge connectivity: edge.connectivity, vertex.connectivity
-* edge and vertex disjoint paths: edge.disjoint.paths, 
-  vertex.disjoint.paths
-* White's cohesion and adhesion measure: graph.adhesion, graph.cohesion
-* dimacs file format added
-* as.directed handles attributes now
-* constraint corrected, it handles weighted graphs as well now
-* weighted attribute to graph.adjacency
-* spinglass-based community structure detection, the Joerg Reichardt --
-  Stefan Bornholdt algorithm added: spinglass.community
-* graph.extended.chordal.ring, extended chordal ring generation
-* no.clusters calculates the number of clusters without calculating
-  the clusters themselves
-* minimum spanning tree functions updated to keep attributes
-* transitivity can calculate local transitivity as well
-* neighborhood related functions added: neighborhood,
-  neighborhood.size, graph.neighborhood
-* new graph generators based on vertex types: preference.game and
-  asymmetric.preference.game
-
-Bugs corrected
---------------
-
-* attribute handling bug when deleting edges corrected
-* GraphML escaping and NaN handling corrected
-* bug corrected to make it possible compile the R package without the 
-  libxml2 library
-* a bug in Erdos-Renyi graph generation corrected: it had problems 
-  with generating large directed graphs
-* bug in constraint calculation corrected, it works well now
-* fixed memory leaks in igraph_read_graph_graphml
-* error handling bug corrected in igraph_read_graph_graphml
-* bug corrected in R version of graph.laplacian when normalized
-  Laplacian is requested
-* memory leak corrected in get.all.shortest.paths in the R package
diff -Nru igraph-0.6.5~quantal1/NEWS-0.3.3 igraph-0.6.5/NEWS-0.3.3
--- igraph-0.6.5~quantal1/NEWS-0.3.3	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/NEWS-0.3.3	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-
-New in the C library
---------------------
-
-* igraph_connect_neighborhood, nomen est omen
-* igraph_watts_strogatz_game and igraph_rewire_edges
-* K-core decomposition: igraph_coreness
-* Clique and independent vertex set related functions:
-  igraph_cliques, igraph_independent_vertex_sets,
-  igraph_maximal_cliques, igraph_maximal_independent_vertex_sets,
-  igraph_independence_number, igraph_clique_number,
-  Some of these function were ported from the very_nauty library
-  of Keith Briggs, thanks Keith!
-* The GraphML file format now supports graph attributes
-* Transitivity calculation speeded up
-* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
-
-New in the R interface
-----------------------
-
-* connect.neighborhood
-* watts.strogatz.game and rewire.edges
-* K-core decomposition: graph.coreness
-* added the 'innei' and 'outnei' shorthands for vertex sequence indexing
-  see help(iterators)
-* Clique and independent vertex set related functions:
-  cliques, largest.cliques, maximal.cliques, clique.number,
-  independent.vertex.sets, largest.independent.vertex.sets,
-  maximal.independent.vertex.sets, independence.number
-* The GraphML file format now supports graph attributes
-* edge.lty argument added to plot.igraph and tkplot
-* Transitivity calculation speeded up
-* Correct transitivity calculation for multigraphs (ie. non-simple graphs)
-* alpha.centrality added, calculates Bonacich alpha centrality, see docs.
-
-Bugs corrected
---------------
-
-* 'make install' installs the library correctly on Cygwin now
-* Pajek parser corrected to read files with MacOS newline characters correctly
-* overflow bug in transitivity calculation for large graphs corrected 
-* an internal memcpy/memmove bug causing some segfaults removed 
-* R interface: tkplot bug with graphs containing a 'name' attribute
-* R interface: attribute handling bug when adding vertices
-* R interface: color selection bug corrected
-* R interface: plot.igraph when plotting loops
diff -Nru igraph-0.6.5~quantal1/NEWS-0.4 igraph-0.6.5/NEWS-0.4
--- igraph-0.6.5~quantal1/NEWS-0.4	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/NEWS-0.4	1970-01-01 00:00:00.000000000 +0000
@@ -1,80 +0,0 @@
-
-New in the C library
---------------------
-
-* internal representation changed
-* neighbors always returns an ordered list
-* igraph_is_loop and igraph_is_multiple added
-
-* topological sorting
-* VF2 isomorphism algorithm
-* support for reading the file format of the Graph Database for isomorphism
-* igraph_mincut cat calculate the actual minimum cut
-* girth calculation added, thanks to Keith Briggs
-* support for reading and writing GML files
-
-* Walktrap community detection algorithm added, thanks to Matthieu Latapy 
-  and Pascal Pons
-* edge betweenness based community detection algorithm added
-* fast greedy algorithm for community detection by Clauset et al. added
-  thanks to Aaron Clauset for sharing his code
-* leading eigenvector community detection algorithm by Mark Newman added
-* igraph_community_to_membership supporting function added, creates 
-  a membership vector from a community structure merge tree
-* modularity calculation added
-
-New in the R interface
-----------------------
-
-* as the internal representation changed, graphs stored with 'save' 
-  with an older igraph version cannot be read back with the new
-  version reliably.
-* neighbors returns ordered lists
-
-* topological sorting
-* VF2 isomorphism algorithm
-* support for reading graphs from the Graph Database for isomorphism
-* girth calculation added, thanks to Keith Briggs
-* support for reading and writing GML files
-
-* Walktrap community detection algorithm added, thanks to Matthieu Latapy 
-  and Pascal Pons
-* edge betweenness based community detection algorithm added
-* fast greedy algorithm for community detection by Clauset et al. added
-  thanks to Aaron Clauset for sharing his code  
-* leading eigenvector community detection algorithm by Mark Newman added
-* functions for creating denrdograms from the output of the 
-  community detection algorithms added
-* community.membership supporting function added, creates 
-  a membership vector from a community structure merge tree
-* modularity calculation added
-
-* graphics parameter handling is completely rewritten, uniform handling 
-  of colors and fonts, make sure you read ?igraph.plotting
-* new plotting parameter for edges: arrow.mode
-* a bug corrected when playing a nonlinear barabasi.game
-* better looking plotting in 3d using rglplot: edges are 3d too
-* rglplot layout is allowed to be two dimensional now
-* rglplot suspends updates while drawing, this makes it faster
-* loop edges are correctly plotted by all three plotting functions
-
-* better printing of attributes when printing graphs
-* summary of a graph prints attribute names
-* is.igraph rewritten to make it possible to inherit from the 'igraph' class
-* somewhat better looking progress meter for functions which support it
-
-Others
-------
-
-* proper support for Debian packages (re)added
-* many functions benefit from the new internal representation and are 
-  faster now: transitivity, reciprocity, graph operator functions like 
-  intersection and union, etc.
-* igraph compiles with Microsoft Visual C++ now
-* there were some internal changes to make igraph a real graph algorithm
-  platform in the near future, but these are undocumented now
-
-Bugs corrected
---------------
-
-* corrected a bug when reading Pajek files: directed graphs were read as undirected
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/NEWS-0.5 igraph-0.6.5/NEWS-0.5
--- igraph-0.6.5~quantal1/NEWS-0.5	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/NEWS-0.5	1970-01-01 00:00:00.000000000 +0000
@@ -1,171 +0,0 @@
-
-New in the R interface
-----------------------
-
-- The 'rescale', 'asp' and 'frame' graphical parameters were added
-- Create graphs from a formula notation (graph.formula)
-- Handle graph attributes properly
-- Calculate the actual minimum cut for undirected graphs
-- Adjacency lists, get.adjlist and get.adjedgelist added
-- Eigenvector centrality computation is much faster now
-- Proper R warnings, instead of writing the warning to the terminal
-- R checks graphical parameters now, the unknown ones are not just
-  ignored, but an error message is given  
-- plot.igraph has an 'add' argument now to compose plots with multiple
-  graphs
-- plot.igraph supports the 'main' and 'sub' arguments
-- layout.norm is public now, it can normalize a layout
-- It is possible to supply startup positions to layout generators
-- Always free memory when CTRL+C/ESC is pressed, in all operating
-  systems
-- plot.igraph can plot square vertices now, see the 'shape' parameter
-- graph.adjacency rewritten when creating weighted graphs
-- We use match.arg whenever possible. This means that character scalar 
-  options can be abbreviated and they are always case insensitive
-
-- VF2 graph isomorphism routines can check subgraph isomorphism now,
-  and they are able to return matching(s)
-- The BLISS graph isomorphism algorithm is included in igraph now. See
-  canonical.permutation, graph.isomorphic.bliss
-- We use ARPACK for eigenvalue/eigenvector calculation. This means that the
-  following functions were rewritten: page.rank,
-  leading.eigenvector.community.*, evcent. New functions based on
-  ARPACK: hub.score, authority.score, arpack.
-- Edge weights for Fruchterman-Reingold layout (layout.fruchterman.reingold).
-- Line graph calculation (line.graph)
-- Kautz and de Bruijn graph generators (graph.kautz, graph.de.bruijn)
-- Support for writing graphs in DOT format
-- Jaccard and Dice similarity coefficients added (similarity.jaccard,
-  similarity.dice)
-- Counting the multiplicity of edges (count.multiple)
-- The graphopt layout algorithm was added, layout.graphopt
-- Generation of "famous" graphs (graph.famous).
-- Create graphs from LCF notation (graph.cf).
-- Dyad census and triad cencus functions (dyad.census, triad.census)
-- Cheking for simple graphs (is.simple)
-- Create full citation networks (graph.full.citation)
-- Create a histogram of path lengths (path.length.hist)
-- Forest fire model added (forest.fire.game)
-- DIMACS reader can handle different file types now
-- Biconnected components and articulation points (biconnected.components,
-  articulation.points)
-- Kleinberg's hub and authority scores (hub.score, authority.score)
-- as.undirected handles attributes now
-- Geometric random graph generator (grg.game) can return the
-  coordinates of the vertices
-- Function added to convert leading eigenvector community structure result to
-  a membership vector (community.le.to.membership)
-- Weighted fast greedy community detection
-- Weighted page rank calculation
-- Functions for estimating closeness, betweenness, edge betweenness by 
-  introducing a cutoff for path lengths (closeness.estimate,
-  betweenness.estimate, edge.betweenness.estimate)
-- Weighted modularity calculation
-- Function for permuting vertices (permute.vertices)
-- Betweenness ans closeness calculations are speeded up
-- read.graph can handle all possible line terminators now (\r, \n, \r\n, \n\r)
-- Error handling was rewritten for walktrap community detection,
-  the calculation can be interrupted now
-- The maxflow/mincut functions allow to supply NULL pointer for edge
-  capacities, implying unit capacities for all edges
-
-Bugs corrected in the R interface
----------------------------------
-
-- Fixed a bug in cohesive.blocks, cohesive blocks were sometimes not
-  calculated correctly
-
-New in the Python interface
----------------------------
-
-- Added shell interface: igraph can now be invoked by calling the script called
-  igraph from the command line. The script launches the Python interpreter and
-  automatically imports igraph functions into the main namespace
-- Pickling (serialization) support for Graph objects
-- Plotting functionality based on the Cairo graphics library (so you need to
-  install python-cairo if you want to use it). Currently the following
-  objects can be plotted: graphs, adjacency matrices and dendrograms. Some
-  crude support for plotting histograms is also implemented. Plots can be
-  saved in PNG, SVG and PDF formats.
-- Unified Graph.layout method for accessing layout algorithms
-- Added interfaces to walktrap community detection and the BLISS isomorphism
-  algorithm
-- Added dyad and triad census functionality and motif counting
-- VertexSeq and EdgeSeq objects can now be restricted to subsets of the
-  whole network (e.g., you can select vertices/edges based on attributes,
-  degree, centrality and so on)
-
-New in the C library
---------------------
-
-- Many types (stack, matrix, dqueue, etc.) are templates now
-  They were also rewritten to provide a better organized interface
-- VF2 graph isomorphism routines can check subgraph isomorphism now,
-  and they are able to return matching(s)
-- The BLISS graph isomorphism algorithm is included in igraph now. See
-  igraph_canonical_permutation, igraph_isomorphic_bliss
-- We use ARPACK for eigenvalue/eigenvector calculation. This means that the
-  following functions were rewritten: igraph_pagerank,
-  igraph_community_leading_eigenvector_*. New functions based on
-  ARPACK: igraph_eigenvector_centrality, igraph_hub_score,
-  igraph_authority_score, igraph_arpack_rssolve, igraph_arpack_rnsolve  
-- Experimental C attribute interface added. I.e. it is possible to use
-  graph/vertex/edge attributes from C code now.
-
-- Edge weights for Fruchterman-Reingold layout.
-- Line graph calculation.
-- Kautz and de Bruijn graph generators
-- Support for writing graphs in DOT format
-- Jaccard and Dice similarity coefficients added
-- igraph_count_multiple added
-- igraph_is_loop and igraph_is_multiple "return" boolean vectors
-- The graphopt layout algorithm was added, igraph_layout_graphopt
-- Generation of "famous" graphs, igraph_famous
-- Create graphs from LCF notation, igraph_lcf, igraph_lcf_vector
-- igraph_add_edge adds a single edge to the graph
-- Dyad census and triad cencus functions added
-- igraph_is_simple added
-- progress handlers are allowed to stop calculation
-- igraph_full_citation to create full citation networks
-- igraph_path_length_hist, create a histogram of path lengths
-- forest fire model added
-- DIMACS reader can handle different file types now
-- Adjacency list types made public now (igraph_adjlist_t, igraph_adjedgelist_t)
-- Biconnected components and articulation points can be computed
-- Eigenvector centrality computation
-- Kleinberg's hub and authority scores
-- igraph_to_undirected handles attributes now
-- Geometric random graph generator can return the coordinates of the vertices
-- Function added to convert leading eigenvector community structure result to
-  a membership vector (igraph_le_community_to_membership)
-- Weighted fast greedy community detection
-- Weighted page rank calculation
-- Functions for estimating closeness, betweenness, edge betweenness by 
-  introducing a cutoff for path lengths
-- Weighted modularity calculation
-- igraph_permute_vertices added
-- Betweenness ans closeness calculations are speeded up
-- Startup positions can be supplied to the Kamada-Kawai layout
-  algorithms
-- igraph_read_graph_* functions can handle all possible line
-  terminators now (\r, \n, \r\n, \n\r)
-- Error handling was rewritten for walktrap community detection,
-  the calculation can be interrupted now
-- The maxflow/mincut functions allow to supply a null pointer for edge
-  capacities, implying unit capacities for all edges
-
-Bugs corrected in the C library
--------------------------------
-
-- Memory leak fixed in adjacency list handling
-- Memory leak fixed in maximal independent vertex set calculation
-- Fixed a bug when rewiring undirected graphs with igraph_rewire
-- Fixed edge betweenness community structure detection for unconnected graphs
-- Make igraph compile with Sun Studio
-- Betweenness bug fixed, when not computing for all vertices
-- memory usage of clique finding reduced
-- Corrected bugs for motif counts when not all motifs were counted,
-  but a 'cut' vector was used
-- Bugs fixed in trait games and cited type game
-- Accept underscore as letter in GML files
-- GML file directedness notation reversed, more logical this way
diff -Nru igraph-0.6.5~quantal1/aclocal.m4 igraph-0.6.5/aclocal.m4
--- igraph-0.6.5~quantal1/aclocal.m4	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/aclocal.m4	2013-03-03 01:29:37.000000000 +0000
@@ -0,0 +1,9598 @@
+# generated automatically by aclocal 1.11.3 -*- Autoconf -*-
+
+# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
+# 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation,
+# Inc.
+# This file 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.
+
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.68],,
+[m4_warning([this file was generated for autoconf 2.68.
+You have another version of autoconf.  It may work, but is not guaranteed to.
+If you have problems, you may need to regenerate the build system entirely.
+To do so, use the procedure documented by the package, typically `autoreconf'.])])
+
+# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*-
+#
+#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,
+#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software
+#                 Foundation, Inc.
+#   Written by Gordon Matzigkeit, 1996
+#
+# This file 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.
+
+m4_define([_LT_COPYING], [dnl
+#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,
+#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software
+#                 Foundation, Inc.
+#   Written by Gordon Matzigkeit, 1996
+#
+#   This file is part of GNU Libtool.
+#
+# GNU Libtool 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 2 of
+# the License, or (at your option) any later version.
+#
+# As a special exception to the GNU General Public License,
+# if you distribute this file as part of a program or library that
+# is built using GNU Libtool, you may include this file under the
+# same distribution terms that you use for the rest of that program.
+#
+# GNU Libtool 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 GNU Libtool; see the file COPYING.  If not, a copy
+# can be downloaded from http://www.gnu.org/licenses/gpl.html, or
+# obtained by writing to the Free Software Foundation, Inc.,
+# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
+])
+
+# serial 57 LT_INIT
+
+
+# LT_PREREQ(VERSION)
+# ------------------
+# Complain and exit if this libtool version is less that VERSION.
+m4_defun([LT_PREREQ],
+[m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1,
+       [m4_default([$3],
+		   [m4_fatal([Libtool version $1 or higher is required],
+		             63)])],
+       [$2])])
+
+
+# _LT_CHECK_BUILDDIR
+# ------------------
+# Complain if the absolute build directory name contains unusual characters
+m4_defun([_LT_CHECK_BUILDDIR],
+[case `pwd` in
+  *\ * | *\	*)
+    AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;;
+esac
+])
+
+
+# LT_INIT([OPTIONS])
+# ------------------
+AC_DEFUN([LT_INIT],
+[AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT
+AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl
+AC_BEFORE([$0], [LT_LANG])dnl
+AC_BEFORE([$0], [LT_OUTPUT])dnl
+AC_BEFORE([$0], [LTDL_INIT])dnl
+m4_require([_LT_CHECK_BUILDDIR])dnl
+
+dnl Autoconf doesn't catch unexpanded LT_ macros by default:
+m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl
+m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl
+dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4
+dnl unless we require an AC_DEFUNed macro:
+AC_REQUIRE([LTOPTIONS_VERSION])dnl
+AC_REQUIRE([LTSUGAR_VERSION])dnl
+AC_REQUIRE([LTVERSION_VERSION])dnl
+AC_REQUIRE([LTOBSOLETE_VERSION])dnl
+m4_require([_LT_PROG_LTMAIN])dnl
+
+_LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}])
+
+dnl Parse OPTIONS
+_LT_SET_OPTIONS([$0], [$1])
+
+# This can be used to rebuild libtool when needed
+LIBTOOL_DEPS="$ltmain"
+
+# Always use our own libtool.
+LIBTOOL='$(SHELL) $(top_builddir)/libtool'
+AC_SUBST(LIBTOOL)dnl
+
+_LT_SETUP
+
+# Only expand once:
+m4_define([LT_INIT])
+])# LT_INIT
+
+# Old names:
+AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT])
+AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_PROG_LIBTOOL], [])
+dnl AC_DEFUN([AM_PROG_LIBTOOL], [])
+
+
+# _LT_CC_BASENAME(CC)
+# -------------------
+# Calculate cc_basename.  Skip known compiler wrappers and cross-prefix.
+m4_defun([_LT_CC_BASENAME],
+[for cc_temp in $1""; do
+  case $cc_temp in
+    compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;;
+    distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;;
+    \-*) ;;
+    *) break;;
+  esac
+done
+cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"`
+])
+
+
+# _LT_FILEUTILS_DEFAULTS
+# ----------------------
+# It is okay to use these file commands and assume they have been set
+# sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'.
+m4_defun([_LT_FILEUTILS_DEFAULTS],
+[: ${CP="cp -f"}
+: ${MV="mv -f"}
+: ${RM="rm -f"}
+])# _LT_FILEUTILS_DEFAULTS
+
+
+# _LT_SETUP
+# ---------
+m4_defun([_LT_SETUP],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_CANONICAL_BUILD])dnl
+AC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl
+AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl
+
+_LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl
+dnl
+_LT_DECL([], [host_alias], [0], [The host system])dnl
+_LT_DECL([], [host], [0])dnl
+_LT_DECL([], [host_os], [0])dnl
+dnl
+_LT_DECL([], [build_alias], [0], [The build system])dnl
+_LT_DECL([], [build], [0])dnl
+_LT_DECL([], [build_os], [0])dnl
+dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([LT_PATH_LD])dnl
+AC_REQUIRE([LT_PATH_NM])dnl
+dnl
+AC_REQUIRE([AC_PROG_LN_S])dnl
+test -z "$LN_S" && LN_S="ln -s"
+_LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl
+dnl
+AC_REQUIRE([LT_CMD_MAX_LEN])dnl
+_LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl
+_LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl
+dnl
+m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_CHECK_SHELL_FEATURES])dnl
+m4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl
+m4_require([_LT_CMD_RELOAD])dnl
+m4_require([_LT_CHECK_MAGIC_METHOD])dnl
+m4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl
+m4_require([_LT_CMD_OLD_ARCHIVE])dnl
+m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl
+m4_require([_LT_WITH_SYSROOT])dnl
+
+_LT_CONFIG_LIBTOOL_INIT([
+# See if we are running on zsh, and set the options which allow our
+# commands through without removal of \ escapes INIT.
+if test -n "\${ZSH_VERSION+set}" ; then
+   setopt NO_GLOB_SUBST
+fi
+])
+if test -n "${ZSH_VERSION+set}" ; then
+   setopt NO_GLOB_SUBST
+fi
+
+_LT_CHECK_OBJDIR
+
+m4_require([_LT_TAG_COMPILER])dnl
+
+case $host_os in
+aix3*)
+  # AIX sometimes has problems with the GCC collect2 program.  For some
+  # reason, if we set the COLLECT_NAMES environment variable, the problems
+  # vanish in a puff of smoke.
+  if test "X${COLLECT_NAMES+set}" != Xset; then
+    COLLECT_NAMES=
+    export COLLECT_NAMES
+  fi
+  ;;
+esac
+
+# Global variables:
+ofile=libtool
+can_build_shared=yes
+
+# All known linkers require a `.a' archive for static linking (except MSVC,
+# which needs '.lib').
+libext=a
+
+with_gnu_ld="$lt_cv_prog_gnu_ld"
+
+old_CC="$CC"
+old_CFLAGS="$CFLAGS"
+
+# Set sane defaults for various variables
+test -z "$CC" && CC=cc
+test -z "$LTCC" && LTCC=$CC
+test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS
+test -z "$LD" && LD=ld
+test -z "$ac_objext" && ac_objext=o
+
+_LT_CC_BASENAME([$compiler])
+
+# Only perform the check for file, if the check method requires it
+test -z "$MAGIC_CMD" && MAGIC_CMD=file
+case $deplibs_check_method in
+file_magic*)
+  if test "$file_magic_cmd" = '$MAGIC_CMD'; then
+    _LT_PATH_MAGIC
+  fi
+  ;;
+esac
+
+# Use C for the default configuration in the libtool script
+LT_SUPPORTED_TAG([CC])
+_LT_LANG_C_CONFIG
+_LT_LANG_DEFAULT_CONFIG
+_LT_CONFIG_COMMANDS
+])# _LT_SETUP
+
+
+# _LT_PREPARE_SED_QUOTE_VARS
+# --------------------------
+# Define a few sed substitution that help us do robust quoting.
+m4_defun([_LT_PREPARE_SED_QUOTE_VARS],
+[# Backslashify metacharacters that are still active within
+# double-quoted strings.
+sed_quote_subst='s/\([["`$\\]]\)/\\\1/g'
+
+# Same as above, but do not quote variable references.
+double_quote_subst='s/\([["`\\]]\)/\\\1/g'
+
+# Sed substitution to delay expansion of an escaped shell variable in a
+# double_quote_subst'ed string.
+delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g'
+
+# Sed substitution to delay expansion of an escaped single quote.
+delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g'
+
+# Sed substitution to avoid accidental globbing in evaled expressions
+no_glob_subst='s/\*/\\\*/g'
+])
+
+# _LT_PROG_LTMAIN
+# ---------------
+# Note that this code is called both from `configure', and `config.status'
+# now that we use AC_CONFIG_COMMANDS to generate libtool.  Notably,
+# `config.status' has no value for ac_aux_dir unless we are using Automake,
+# so we pass a copy along to make sure it has a sensible value anyway.
+m4_defun([_LT_PROG_LTMAIN],
+[m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl
+_LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir'])
+ltmain="$ac_aux_dir/ltmain.sh"
+])# _LT_PROG_LTMAIN
+
+
+
+# So that we can recreate a full libtool script including additional
+# tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS
+# in macros and then make a single call at the end using the `libtool'
+# label.
+
+
+# _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS])
+# ----------------------------------------
+# Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later.
+m4_define([_LT_CONFIG_LIBTOOL_INIT],
+[m4_ifval([$1],
+          [m4_append([_LT_OUTPUT_LIBTOOL_INIT],
+                     [$1
+])])])
+
+# Initialize.
+m4_define([_LT_OUTPUT_LIBTOOL_INIT])
+
+
+# _LT_CONFIG_LIBTOOL([COMMANDS])
+# ------------------------------
+# Register COMMANDS to be passed to AC_CONFIG_COMMANDS later.
+m4_define([_LT_CONFIG_LIBTOOL],
+[m4_ifval([$1],
+          [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS],
+                     [$1
+])])])
+
+# Initialize.
+m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS])
+
+
+# _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS])
+# -----------------------------------------------------
+m4_defun([_LT_CONFIG_SAVE_COMMANDS],
+[_LT_CONFIG_LIBTOOL([$1])
+_LT_CONFIG_LIBTOOL_INIT([$2])
+])
+
+
+# _LT_FORMAT_COMMENT([COMMENT])
+# -----------------------------
+# Add leading comment marks to the start of each line, and a trailing
+# full-stop to the whole comment if one is not present already.
+m4_define([_LT_FORMAT_COMMENT],
+[m4_ifval([$1], [
+m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])],
+              [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.])
+)])
+
+
+
+
+
+# _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?])
+# -------------------------------------------------------------------
+# CONFIGNAME is the name given to the value in the libtool script.
+# VARNAME is the (base) name used in the configure script.
+# VALUE may be 0, 1 or 2 for a computed quote escaped value based on
+# VARNAME.  Any other value will be used directly.
+m4_define([_LT_DECL],
+[lt_if_append_uniq([lt_decl_varnames], [$2], [, ],
+    [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name],
+	[m4_ifval([$1], [$1], [$2])])
+    lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3])
+    m4_ifval([$4],
+	[lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])])
+    lt_dict_add_subkey([lt_decl_dict], [$2],
+	[tagged?], [m4_ifval([$5], [yes], [no])])])
+])
+
+
+# _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION])
+# --------------------------------------------------------
+m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])])
+
+
+# lt_decl_tag_varnames([SEPARATOR], [VARNAME1...])
+# ------------------------------------------------
+m4_define([lt_decl_tag_varnames],
+[_lt_decl_filter([tagged?], [yes], $@)])
+
+
+# _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..])
+# ---------------------------------------------------------
+m4_define([_lt_decl_filter],
+[m4_case([$#],
+  [0], [m4_fatal([$0: too few arguments: $#])],
+  [1], [m4_fatal([$0: too few arguments: $#: $1])],
+  [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)],
+  [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)],
+  [lt_dict_filter([lt_decl_dict], $@)])[]dnl
+])
+
+
+# lt_decl_quote_varnames([SEPARATOR], [VARNAME1...])
+# --------------------------------------------------
+m4_define([lt_decl_quote_varnames],
+[_lt_decl_filter([value], [1], $@)])
+
+
+# lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...])
+# ---------------------------------------------------
+m4_define([lt_decl_dquote_varnames],
+[_lt_decl_filter([value], [2], $@)])
+
+
+# lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...])
+# ---------------------------------------------------
+m4_define([lt_decl_varnames_tagged],
+[m4_assert([$# <= 2])dnl
+_$0(m4_quote(m4_default([$1], [[, ]])),
+    m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]),
+    m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))])
+m4_define([_lt_decl_varnames_tagged],
+[m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])])
+
+
+# lt_decl_all_varnames([SEPARATOR], [VARNAME1...])
+# ------------------------------------------------
+m4_define([lt_decl_all_varnames],
+[_$0(m4_quote(m4_default([$1], [[, ]])),
+     m4_if([$2], [],
+	   m4_quote(lt_decl_varnames),
+	m4_quote(m4_shift($@))))[]dnl
+])
+m4_define([_lt_decl_all_varnames],
+[lt_join($@, lt_decl_varnames_tagged([$1],
+			lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl
+])
+
+
+# _LT_CONFIG_STATUS_DECLARE([VARNAME])
+# ------------------------------------
+# Quote a variable value, and forward it to `config.status' so that its
+# declaration there will have the same value as in `configure'.  VARNAME
+# must have a single quote delimited value for this to work.
+m4_define([_LT_CONFIG_STATUS_DECLARE],
+[$1='`$ECHO "$][$1" | $SED "$delay_single_quote_subst"`'])
+
+
+# _LT_CONFIG_STATUS_DECLARATIONS
+# ------------------------------
+# We delimit libtool config variables with single quotes, so when
+# we write them to config.status, we have to be sure to quote all
+# embedded single quotes properly.  In configure, this macro expands
+# each variable declared with _LT_DECL (and _LT_TAGDECL) into:
+#
+#    <var>='`$ECHO "$<var>" | $SED "$delay_single_quote_subst"`'
+m4_defun([_LT_CONFIG_STATUS_DECLARATIONS],
+[m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames),
+    [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])])
+
+
+# _LT_LIBTOOL_TAGS
+# ----------------
+# Output comment and list of tags supported by the script
+m4_defun([_LT_LIBTOOL_TAGS],
+[_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl
+available_tags="_LT_TAGS"dnl
+])
+
+
+# _LT_LIBTOOL_DECLARE(VARNAME, [TAG])
+# -----------------------------------
+# Extract the dictionary values for VARNAME (optionally with TAG) and
+# expand to a commented shell variable setting:
+#
+#    # Some comment about what VAR is for.
+#    visible_name=$lt_internal_name
+m4_define([_LT_LIBTOOL_DECLARE],
+[_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1],
+					   [description])))[]dnl
+m4_pushdef([_libtool_name],
+    m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl
+m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])),
+    [0], [_libtool_name=[$]$1],
+    [1], [_libtool_name=$lt_[]$1],
+    [2], [_libtool_name=$lt_[]$1],
+    [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl
+m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl
+])
+
+
+# _LT_LIBTOOL_CONFIG_VARS
+# -----------------------
+# Produce commented declarations of non-tagged libtool config variables
+# suitable for insertion in the LIBTOOL CONFIG section of the `libtool'
+# script.  Tagged libtool config variables (even for the LIBTOOL CONFIG
+# section) are produced by _LT_LIBTOOL_TAG_VARS.
+m4_defun([_LT_LIBTOOL_CONFIG_VARS],
+[m4_foreach([_lt_var],
+    m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)),
+    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])])
+
+
+# _LT_LIBTOOL_TAG_VARS(TAG)
+# -------------------------
+m4_define([_LT_LIBTOOL_TAG_VARS],
+[m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames),
+    [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])])
+
+
+# _LT_TAGVAR(VARNAME, [TAGNAME])
+# ------------------------------
+m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])])
+
+
+# _LT_CONFIG_COMMANDS
+# -------------------
+# Send accumulated output to $CONFIG_STATUS.  Thanks to the lists of
+# variables for single and double quote escaping we saved from calls
+# to _LT_DECL, we can put quote escaped variables declarations
+# into `config.status', and then the shell code to quote escape them in
+# for loops in `config.status'.  Finally, any additional code accumulated
+# from calls to _LT_CONFIG_LIBTOOL_INIT is expanded.
+m4_defun([_LT_CONFIG_COMMANDS],
+[AC_PROVIDE_IFELSE([LT_OUTPUT],
+	dnl If the libtool generation code has been placed in $CONFIG_LT,
+	dnl instead of duplicating it all over again into config.status,
+	dnl then we will have config.status run $CONFIG_LT later, so it
+	dnl needs to know what name is stored there:
+        [AC_CONFIG_COMMANDS([libtool],
+            [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])],
+    dnl If the libtool generation code is destined for config.status,
+    dnl expand the accumulated commands and init code now:
+    [AC_CONFIG_COMMANDS([libtool],
+        [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])])
+])#_LT_CONFIG_COMMANDS
+
+
+# Initialize.
+m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT],
+[
+
+# The HP-UX ksh and POSIX shell print the target directory to stdout
+# if CDPATH is set.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+sed_quote_subst='$sed_quote_subst'
+double_quote_subst='$double_quote_subst'
+delay_variable_subst='$delay_variable_subst'
+_LT_CONFIG_STATUS_DECLARATIONS
+LTCC='$LTCC'
+LTCFLAGS='$LTCFLAGS'
+compiler='$compiler_DEFAULT'
+
+# A function that is used when there is no print builtin or printf.
+func_fallback_echo ()
+{
+  eval 'cat <<_LTECHO_EOF
+\$[]1
+_LTECHO_EOF'
+}
+
+# Quote evaled strings.
+for var in lt_decl_all_varnames([[ \
+]], lt_decl_quote_varnames); do
+    case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in
+    *[[\\\\\\\`\\"\\\$]]*)
+      eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\""
+      ;;
+    *)
+      eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\""
+      ;;
+    esac
+done
+
+# Double-quote double-evaled strings.
+for var in lt_decl_all_varnames([[ \
+]], lt_decl_dquote_varnames); do
+    case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in
+    *[[\\\\\\\`\\"\\\$]]*)
+      eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\""
+      ;;
+    *)
+      eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\""
+      ;;
+    esac
+done
+
+_LT_OUTPUT_LIBTOOL_INIT
+])
+
+# _LT_GENERATED_FILE_INIT(FILE, [COMMENT])
+# ------------------------------------
+# Generate a child script FILE with all initialization necessary to
+# reuse the environment learned by the parent script, and make the
+# file executable.  If COMMENT is supplied, it is inserted after the
+# `#!' sequence but before initialization text begins.  After this
+# macro, additional text can be appended to FILE to form the body of
+# the child script.  The macro ends with non-zero status if the
+# file could not be fully written (such as if the disk is full).
+m4_ifdef([AS_INIT_GENERATED],
+[m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])],
+[m4_defun([_LT_GENERATED_FILE_INIT],
+[m4_require([AS_PREPARE])]dnl
+[m4_pushdef([AS_MESSAGE_LOG_FD])]dnl
+[lt_write_fail=0
+cat >$1 <<_ASEOF || lt_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+$2
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$1 <<\_ASEOF || lt_write_fail=1
+AS_SHELL_SANITIZE
+_AS_PREPARE
+exec AS_MESSAGE_FD>&1
+_ASEOF
+test $lt_write_fail = 0 && chmod +x $1[]dnl
+m4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT
+
+# LT_OUTPUT
+# ---------
+# This macro allows early generation of the libtool script (before
+# AC_OUTPUT is called), incase it is used in configure for compilation
+# tests.
+AC_DEFUN([LT_OUTPUT],
+[: ${CONFIG_LT=./config.lt}
+AC_MSG_NOTICE([creating $CONFIG_LT])
+_LT_GENERATED_FILE_INIT(["$CONFIG_LT"],
+[# Run this file to recreate a libtool stub with the current configuration.])
+
+cat >>"$CONFIG_LT" <<\_LTEOF
+lt_cl_silent=false
+exec AS_MESSAGE_LOG_FD>>config.log
+{
+  echo
+  AS_BOX([Running $as_me.])
+} >&AS_MESSAGE_LOG_FD
+
+lt_cl_help="\
+\`$as_me' creates a local libtool stub from the current configuration,
+for use in further configure time tests before the real libtool is
+generated.
+
+Usage: $[0] [[OPTIONS]]
+
+  -h, --help      print this help, then exit
+  -V, --version   print version number, then exit
+  -q, --quiet     do not print progress messages
+  -d, --debug     don't remove temporary files
+
+Report bugs to <bug-libtool@gnu.org>."
+
+lt_cl_version="\
+m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl
+m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION])
+configured by $[0], generated by m4_PACKAGE_STRING.
+
+Copyright (C) 2011 Free Software Foundation, Inc.
+This config.lt script is free software; the Free Software Foundation
+gives unlimited permision to copy, distribute and modify it."
+
+while test $[#] != 0
+do
+  case $[1] in
+    --version | --v* | -V )
+      echo "$lt_cl_version"; exit 0 ;;
+    --help | --h* | -h )
+      echo "$lt_cl_help"; exit 0 ;;
+    --debug | --d* | -d )
+      debug=: ;;
+    --quiet | --q* | --silent | --s* | -q )
+      lt_cl_silent=: ;;
+
+    -*) AC_MSG_ERROR([unrecognized option: $[1]
+Try \`$[0] --help' for more information.]) ;;
+
+    *) AC_MSG_ERROR([unrecognized argument: $[1]
+Try \`$[0] --help' for more information.]) ;;
+  esac
+  shift
+done
+
+if $lt_cl_silent; then
+  exec AS_MESSAGE_FD>/dev/null
+fi
+_LTEOF
+
+cat >>"$CONFIG_LT" <<_LTEOF
+_LT_OUTPUT_LIBTOOL_COMMANDS_INIT
+_LTEOF
+
+cat >>"$CONFIG_LT" <<\_LTEOF
+AC_MSG_NOTICE([creating $ofile])
+_LT_OUTPUT_LIBTOOL_COMMANDS
+AS_EXIT(0)
+_LTEOF
+chmod +x "$CONFIG_LT"
+
+# configure is writing to config.log, but config.lt does its own redirection,
+# appending to config.log, which fails on DOS, as config.log is still kept
+# open by configure.  Here we exec the FD to /dev/null, effectively closing
+# config.log, so it can be properly (re)opened and appended to by config.lt.
+lt_cl_success=:
+test "$silent" = yes &&
+  lt_config_lt_args="$lt_config_lt_args --quiet"
+exec AS_MESSAGE_LOG_FD>/dev/null
+$SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false
+exec AS_MESSAGE_LOG_FD>>config.log
+$lt_cl_success || AS_EXIT(1)
+])# LT_OUTPUT
+
+
+# _LT_CONFIG(TAG)
+# ---------------
+# If TAG is the built-in tag, create an initial libtool script with a
+# default configuration from the untagged config vars.  Otherwise add code
+# to config.status for appending the configuration named by TAG from the
+# matching tagged config vars.
+m4_defun([_LT_CONFIG],
+[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+_LT_CONFIG_SAVE_COMMANDS([
+  m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl
+  m4_if(_LT_TAG, [C], [
+    # See if we are running on zsh, and set the options which allow our
+    # commands through without removal of \ escapes.
+    if test -n "${ZSH_VERSION+set}" ; then
+      setopt NO_GLOB_SUBST
+    fi
+
+    cfgfile="${ofile}T"
+    trap "$RM \"$cfgfile\"; exit 1" 1 2 15
+    $RM "$cfgfile"
+
+    cat <<_LT_EOF >> "$cfgfile"
+#! $SHELL
+
+# `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services.
+# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION
+# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:
+# NOTE: Changes made to this file will be lost: look at ltmain.sh.
+#
+_LT_COPYING
+_LT_LIBTOOL_TAGS
+
+# ### BEGIN LIBTOOL CONFIG
+_LT_LIBTOOL_CONFIG_VARS
+_LT_LIBTOOL_TAG_VARS
+# ### END LIBTOOL CONFIG
+
+_LT_EOF
+
+  case $host_os in
+  aix3*)
+    cat <<\_LT_EOF >> "$cfgfile"
+# AIX sometimes has problems with the GCC collect2 program.  For some
+# reason, if we set the COLLECT_NAMES environment variable, the problems
+# vanish in a puff of smoke.
+if test "X${COLLECT_NAMES+set}" != Xset; then
+  COLLECT_NAMES=
+  export COLLECT_NAMES
+fi
+_LT_EOF
+    ;;
+  esac
+
+  _LT_PROG_LTMAIN
+
+  # We use sed instead of cat because bash on DJGPP gets confused if
+  # if finds mixed CR/LF and LF-only lines.  Since sed operates in
+  # text mode, it properly converts lines to CR/LF.  This bash problem
+  # is reportedly fixed, but why not run on old versions too?
+  sed '$q' "$ltmain" >> "$cfgfile" \
+     || (rm -f "$cfgfile"; exit 1)
+
+  _LT_PROG_REPLACE_SHELLFNS
+
+   mv -f "$cfgfile" "$ofile" ||
+    (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile")
+  chmod +x "$ofile"
+],
+[cat <<_LT_EOF >> "$ofile"
+
+dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded
+dnl in a comment (ie after a #).
+# ### BEGIN LIBTOOL TAG CONFIG: $1
+_LT_LIBTOOL_TAG_VARS(_LT_TAG)
+# ### END LIBTOOL TAG CONFIG: $1
+_LT_EOF
+])dnl /m4_if
+],
+[m4_if([$1], [], [
+    PACKAGE='$PACKAGE'
+    VERSION='$VERSION'
+    TIMESTAMP='$TIMESTAMP'
+    RM='$RM'
+    ofile='$ofile'], [])
+])dnl /_LT_CONFIG_SAVE_COMMANDS
+])# _LT_CONFIG
+
+
+# LT_SUPPORTED_TAG(TAG)
+# ---------------------
+# Trace this macro to discover what tags are supported by the libtool
+# --tag option, using:
+#    autoconf --trace 'LT_SUPPORTED_TAG:$1'
+AC_DEFUN([LT_SUPPORTED_TAG], [])
+
+
+# C support is built-in for now
+m4_define([_LT_LANG_C_enabled], [])
+m4_define([_LT_TAGS], [])
+
+
+# LT_LANG(LANG)
+# -------------
+# Enable libtool support for the given language if not already enabled.
+AC_DEFUN([LT_LANG],
+[AC_BEFORE([$0], [LT_OUTPUT])dnl
+m4_case([$1],
+  [C],			[_LT_LANG(C)],
+  [C++],		[_LT_LANG(CXX)],
+  [Go],			[_LT_LANG(GO)],
+  [Java],		[_LT_LANG(GCJ)],
+  [Fortran 77],		[_LT_LANG(F77)],
+  [Fortran],		[_LT_LANG(FC)],
+  [Windows Resource],	[_LT_LANG(RC)],
+  [m4_ifdef([_LT_LANG_]$1[_CONFIG],
+    [_LT_LANG($1)],
+    [m4_fatal([$0: unsupported language: "$1"])])])dnl
+])# LT_LANG
+
+
+# _LT_LANG(LANGNAME)
+# ------------------
+m4_defun([_LT_LANG],
+[m4_ifdef([_LT_LANG_]$1[_enabled], [],
+  [LT_SUPPORTED_TAG([$1])dnl
+  m4_append([_LT_TAGS], [$1 ])dnl
+  m4_define([_LT_LANG_]$1[_enabled], [])dnl
+  _LT_LANG_$1_CONFIG($1)])dnl
+])# _LT_LANG
+
+
+m4_ifndef([AC_PROG_GO], [
+# NOTE: This macro has been submitted for inclusion into   #
+#  GNU Autoconf as AC_PROG_GO.  When it is available in    #
+#  a released version of Autoconf we should remove this    #
+#  macro and use it instead.                               #
+m4_defun([AC_PROG_GO],
+[AC_LANG_PUSH(Go)dnl
+AC_ARG_VAR([GOC],     [Go compiler command])dnl
+AC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl
+_AC_ARG_VAR_LDFLAGS()dnl
+AC_CHECK_TOOL(GOC, gccgo)
+if test -z "$GOC"; then
+  if test -n "$ac_tool_prefix"; then
+    AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo])
+  fi
+fi
+if test -z "$GOC"; then
+  AC_CHECK_PROG(GOC, gccgo, gccgo, false)
+fi
+])#m4_defun
+])#m4_ifndef
+
+
+# _LT_LANG_DEFAULT_CONFIG
+# -----------------------
+m4_defun([_LT_LANG_DEFAULT_CONFIG],
+[AC_PROVIDE_IFELSE([AC_PROG_CXX],
+  [LT_LANG(CXX)],
+  [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])])
+
+AC_PROVIDE_IFELSE([AC_PROG_F77],
+  [LT_LANG(F77)],
+  [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])])
+
+AC_PROVIDE_IFELSE([AC_PROG_FC],
+  [LT_LANG(FC)],
+  [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])])
+
+dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal
+dnl pulling things in needlessly.
+AC_PROVIDE_IFELSE([AC_PROG_GCJ],
+  [LT_LANG(GCJ)],
+  [AC_PROVIDE_IFELSE([A][M_PROG_GCJ],
+    [LT_LANG(GCJ)],
+    [AC_PROVIDE_IFELSE([LT_PROG_GCJ],
+      [LT_LANG(GCJ)],
+      [m4_ifdef([AC_PROG_GCJ],
+	[m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])])
+       m4_ifdef([A][M_PROG_GCJ],
+	[m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])])
+       m4_ifdef([LT_PROG_GCJ],
+	[m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])])
+
+AC_PROVIDE_IFELSE([AC_PROG_GO],
+  [LT_LANG(GO)],
+  [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])])
+
+AC_PROVIDE_IFELSE([LT_PROG_RC],
+  [LT_LANG(RC)],
+  [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])])
+])# _LT_LANG_DEFAULT_CONFIG
+
+# Obsolete macros:
+AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)])
+AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)])
+AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)])
+AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)])
+AU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_CXX], [])
+dnl AC_DEFUN([AC_LIBTOOL_F77], [])
+dnl AC_DEFUN([AC_LIBTOOL_FC], [])
+dnl AC_DEFUN([AC_LIBTOOL_GCJ], [])
+dnl AC_DEFUN([AC_LIBTOOL_RC], [])
+
+
+# _LT_TAG_COMPILER
+# ----------------
+m4_defun([_LT_TAG_COMPILER],
+[AC_REQUIRE([AC_PROG_CC])dnl
+
+_LT_DECL([LTCC], [CC], [1], [A C compiler])dnl
+_LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl
+_LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl
+_LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl
+
+# If no C compiler was specified, use CC.
+LTCC=${LTCC-"$CC"}
+
+# If no C compiler flags were specified, use CFLAGS.
+LTCFLAGS=${LTCFLAGS-"$CFLAGS"}
+
+# Allow CC to be a program name with arguments.
+compiler=$CC
+])# _LT_TAG_COMPILER
+
+
+# _LT_COMPILER_BOILERPLATE
+# ------------------------
+# Check for compiler boilerplate output or warnings with
+# the simple compiler test code.
+m4_defun([_LT_COMPILER_BOILERPLATE],
+[m4_require([_LT_DECL_SED])dnl
+ac_outfile=conftest.$ac_objext
+echo "$lt_simple_compile_test_code" >conftest.$ac_ext
+eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_compiler_boilerplate=`cat conftest.err`
+$RM conftest*
+])# _LT_COMPILER_BOILERPLATE
+
+
+# _LT_LINKER_BOILERPLATE
+# ----------------------
+# Check for linker boilerplate output or warnings with
+# the simple link test code.
+m4_defun([_LT_LINKER_BOILERPLATE],
+[m4_require([_LT_DECL_SED])dnl
+ac_outfile=conftest.$ac_objext
+echo "$lt_simple_link_test_code" >conftest.$ac_ext
+eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_linker_boilerplate=`cat conftest.err`
+$RM -r conftest*
+])# _LT_LINKER_BOILERPLATE
+
+# _LT_REQUIRED_DARWIN_CHECKS
+# -------------------------
+m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[
+  case $host_os in
+    rhapsody* | darwin*)
+    AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:])
+    AC_CHECK_TOOL([NMEDIT], [nmedit], [:])
+    AC_CHECK_TOOL([LIPO], [lipo], [:])
+    AC_CHECK_TOOL([OTOOL], [otool], [:])
+    AC_CHECK_TOOL([OTOOL64], [otool64], [:])
+    _LT_DECL([], [DSYMUTIL], [1],
+      [Tool to manipulate archived DWARF debug symbol files on Mac OS X])
+    _LT_DECL([], [NMEDIT], [1],
+      [Tool to change global to local symbols on Mac OS X])
+    _LT_DECL([], [LIPO], [1],
+      [Tool to manipulate fat objects and archives on Mac OS X])
+    _LT_DECL([], [OTOOL], [1],
+      [ldd/readelf like tool for Mach-O binaries on Mac OS X])
+    _LT_DECL([], [OTOOL64], [1],
+      [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4])
+
+    AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod],
+      [lt_cv_apple_cc_single_mod=no
+      if test -z "${LT_MULTI_MODULE}"; then
+	# By default we will add the -single_module flag. You can override
+	# by either setting the environment variable LT_MULTI_MODULE
+	# non-empty at configure time, or by adding -multi_module to the
+	# link flags.
+	rm -rf libconftest.dylib*
+	echo "int foo(void){return 1;}" > conftest.c
+	echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
+-dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD
+	$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
+	  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err
+        _lt_result=$?
+	# If there is a non-empty error log, and "single_module"
+	# appears in it, assume the flag caused a linker warning
+        if test -s conftest.err && $GREP single_module conftest.err; then
+	  cat conftest.err >&AS_MESSAGE_LOG_FD
+	# Otherwise, if the output was created with a 0 exit code from
+	# the compiler, it worked.
+	elif test -f libconftest.dylib && test $_lt_result -eq 0; then
+	  lt_cv_apple_cc_single_mod=yes
+	else
+	  cat conftest.err >&AS_MESSAGE_LOG_FD
+	fi
+	rm -rf libconftest.dylib*
+	rm -f conftest.*
+      fi])
+
+    AC_CACHE_CHECK([for -exported_symbols_list linker flag],
+      [lt_cv_ld_exported_symbols_list],
+      [lt_cv_ld_exported_symbols_list=no
+      save_LDFLAGS=$LDFLAGS
+      echo "_main" > conftest.sym
+      LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym"
+      AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],
+	[lt_cv_ld_exported_symbols_list=yes],
+	[lt_cv_ld_exported_symbols_list=no])
+	LDFLAGS="$save_LDFLAGS"
+    ])
+
+    AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load],
+      [lt_cv_ld_force_load=no
+      cat > conftest.c << _LT_EOF
+int forced_loaded() { return 2;}
+_LT_EOF
+      echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&AS_MESSAGE_LOG_FD
+      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD
+      echo "$AR cru libconftest.a conftest.o" >&AS_MESSAGE_LOG_FD
+      $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD
+      echo "$RANLIB libconftest.a" >&AS_MESSAGE_LOG_FD
+      $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD
+      cat > conftest.c << _LT_EOF
+int main() { return 0;}
+_LT_EOF
+      echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&AS_MESSAGE_LOG_FD
+      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err
+      _lt_result=$?
+      if test -s conftest.err && $GREP force_load conftest.err; then
+	cat conftest.err >&AS_MESSAGE_LOG_FD
+      elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then
+	lt_cv_ld_force_load=yes
+      else
+	cat conftest.err >&AS_MESSAGE_LOG_FD
+      fi
+        rm -f conftest.err libconftest.a conftest conftest.c
+        rm -rf conftest.dSYM
+    ])
+    case $host_os in
+    rhapsody* | darwin1.[[012]])
+      _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;;
+    darwin1.*)
+      _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;
+    darwin*) # darwin 5.x on
+      # if running on 10.5 or later, the deployment target defaults
+      # to the OS version, if on x86, and 10.4, the deployment
+      # target defaults to 10.4. Don't you love it?
+      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in
+	10.0,*86*-darwin8*|10.0,*-darwin[[91]]*)
+	  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;
+	10.[[012]]*)
+	  _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;
+	10.*)
+	  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;
+      esac
+    ;;
+  esac
+    if test "$lt_cv_apple_cc_single_mod" = "yes"; then
+      _lt_dar_single_mod='$single_module'
+    fi
+    if test "$lt_cv_ld_exported_symbols_list" = "yes"; then
+      _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym'
+    else
+      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}'
+    fi
+    if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then
+      _lt_dsymutil='~$DSYMUTIL $lib || :'
+    else
+      _lt_dsymutil=
+    fi
+    ;;
+  esac
+])
+
+
+# _LT_DARWIN_LINKER_FEATURES([TAG])
+# ---------------------------------
+# Checks for linker and compiler features on darwin
+m4_defun([_LT_DARWIN_LINKER_FEATURES],
+[
+  m4_require([_LT_REQUIRED_DARWIN_CHECKS])
+  _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+  _LT_TAGVAR(hardcode_direct, $1)=no
+  _LT_TAGVAR(hardcode_automatic, $1)=yes
+  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+  if test "$lt_cv_ld_force_load" = "yes"; then
+    _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`'
+    m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes],
+                  [FC],  [_LT_TAGVAR(compiler_needs_object, $1)=yes])
+  else
+    _LT_TAGVAR(whole_archive_flag_spec, $1)=''
+  fi
+  _LT_TAGVAR(link_all_deplibs, $1)=yes
+  _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined"
+  case $cc_basename in
+     ifort*) _lt_dar_can_shared=yes ;;
+     *) _lt_dar_can_shared=$GCC ;;
+  esac
+  if test "$_lt_dar_can_shared" = "yes"; then
+    output_verbose_link_cmd=func_echo_all
+    _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}"
+    _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}"
+    _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}"
+    _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}"
+    m4_if([$1], [CXX],
+[   if test "$lt_cv_apple_cc_single_mod" != "yes"; then
+      _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}"
+      _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}"
+    fi
+],[])
+  else
+  _LT_TAGVAR(ld_shlibs, $1)=no
+  fi
+])
+
+# _LT_SYS_MODULE_PATH_AIX([TAGNAME])
+# ----------------------------------
+# Links a minimal program and checks the executable
+# for the system default hardcoded library path. In most cases,
+# this is /usr/lib:/lib, but when the MPI compilers are used
+# the location of the communication and MPI libs are included too.
+# If we don't find anything, use the default library path according
+# to the aix ld manual.
+# Store the results from the different compilers for each TAGNAME.
+# Allow to override them for all tags through lt_cv_aix_libpath.
+m4_defun([_LT_SYS_MODULE_PATH_AIX],
+[m4_require([_LT_DECL_SED])dnl
+if test "${lt_cv_aix_libpath+set}" = set; then
+  aix_libpath=$lt_cv_aix_libpath
+else
+  AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])],
+  [AC_LINK_IFELSE([AC_LANG_PROGRAM],[
+  lt_aix_libpath_sed='[
+      /Import File Strings/,/^$/ {
+	  /^0/ {
+	      s/^0  *\([^ ]*\) *$/\1/
+	      p
+	  }
+      }]'
+  _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  # Check for a 64-bit object if we didn't find anything.
+  if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then
+    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  fi],[])
+  if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then
+    _LT_TAGVAR([lt_cv_aix_libpath_], [$1])="/usr/lib:/lib"
+  fi
+  ])
+  aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])
+fi
+])# _LT_SYS_MODULE_PATH_AIX
+
+
+# _LT_SHELL_INIT(ARG)
+# -------------------
+m4_define([_LT_SHELL_INIT],
+[m4_divert_text([M4SH-INIT], [$1
+])])# _LT_SHELL_INIT
+
+
+
+# _LT_PROG_ECHO_BACKSLASH
+# -----------------------
+# Find how we can fake an echo command that does not interpret backslash.
+# In particular, with Autoconf 2.60 or later we add some code to the start
+# of the generated configure script which will find a shell with a builtin
+# printf (which we can use as an echo command).
+m4_defun([_LT_PROG_ECHO_BACKSLASH],
+[ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO
+ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO
+
+AC_MSG_CHECKING([how to print strings])
+# Test print first, because it will be a builtin if present.
+if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \
+   test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then
+  ECHO='print -r --'
+elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then
+  ECHO='printf %s\n'
+else
+  # Use this function as a fallback that always works.
+  func_fallback_echo ()
+  {
+    eval 'cat <<_LTECHO_EOF
+$[]1
+_LTECHO_EOF'
+  }
+  ECHO='func_fallback_echo'
+fi
+
+# func_echo_all arg...
+# Invoke $ECHO with all args, space-separated.
+func_echo_all ()
+{
+    $ECHO "$*" 
+}
+
+case "$ECHO" in
+  printf*) AC_MSG_RESULT([printf]) ;;
+  print*) AC_MSG_RESULT([print -r]) ;;
+  *) AC_MSG_RESULT([cat]) ;;
+esac
+
+m4_ifdef([_AS_DETECT_SUGGESTED],
+[_AS_DETECT_SUGGESTED([
+  test -n "${ZSH_VERSION+set}${BASH_VERSION+set}" || (
+    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO
+    ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO
+    PATH=/empty FPATH=/empty; export PATH FPATH
+    test "X`printf %s $ECHO`" = "X$ECHO" \
+      || test "X`print -r -- $ECHO`" = "X$ECHO" )])])
+
+_LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts])
+_LT_DECL([], [ECHO], [1], [An echo program that protects backslashes])
+])# _LT_PROG_ECHO_BACKSLASH
+
+
+# _LT_WITH_SYSROOT
+# ----------------
+AC_DEFUN([_LT_WITH_SYSROOT],
+[AC_MSG_CHECKING([for sysroot])
+AC_ARG_WITH([sysroot],
+[  --with-sysroot[=DIR] Search for dependent libraries within DIR
+                        (or the compiler's sysroot if not specified).],
+[], [with_sysroot=no])
+
+dnl lt_sysroot will always be passed unquoted.  We quote it here
+dnl in case the user passed a directory name.
+lt_sysroot=
+case ${with_sysroot} in #(
+ yes)
+   if test "$GCC" = yes; then
+     lt_sysroot=`$CC --print-sysroot 2>/dev/null`
+   fi
+   ;; #(
+ /*)
+   lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"`
+   ;; #(
+ no|'')
+   ;; #(
+ *)
+   AC_MSG_RESULT([${with_sysroot}])
+   AC_MSG_ERROR([The sysroot must be an absolute path.])
+   ;;
+esac
+
+ AC_MSG_RESULT([${lt_sysroot:-no}])
+_LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl
+[dependent libraries, and in which our libraries should be installed.])])
+
+# _LT_ENABLE_LOCK
+# ---------------
+m4_defun([_LT_ENABLE_LOCK],
+[AC_ARG_ENABLE([libtool-lock],
+  [AS_HELP_STRING([--disable-libtool-lock],
+    [avoid locking (might break parallel builds)])])
+test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes
+
+# Some flags need to be propagated to the compiler or linker for good
+# libtool support.
+case $host in
+ia64-*-hpux*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if AC_TRY_EVAL(ac_compile); then
+    case `/usr/bin/file conftest.$ac_objext` in
+      *ELF-32*)
+	HPUX_IA64_MODE="32"
+	;;
+      *ELF-64*)
+	HPUX_IA64_MODE="64"
+	;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+*-*-irix6*)
+  # Find out which ABI we are using.
+  echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext
+  if AC_TRY_EVAL(ac_compile); then
+    if test "$lt_cv_prog_gnu_ld" = yes; then
+      case `/usr/bin/file conftest.$ac_objext` in
+	*32-bit*)
+	  LD="${LD-ld} -melf32bsmip"
+	  ;;
+	*N32*)
+	  LD="${LD-ld} -melf32bmipn32"
+	  ;;
+	*64-bit*)
+	  LD="${LD-ld} -melf64bmip"
+	;;
+      esac
+    else
+      case `/usr/bin/file conftest.$ac_objext` in
+	*32-bit*)
+	  LD="${LD-ld} -32"
+	  ;;
+	*N32*)
+	  LD="${LD-ld} -n32"
+	  ;;
+	*64-bit*)
+	  LD="${LD-ld} -64"
+	  ;;
+      esac
+    fi
+  fi
+  rm -rf conftest*
+  ;;
+
+x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \
+s390*-*linux*|s390*-*tpf*|sparc*-*linux*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if AC_TRY_EVAL(ac_compile); then
+    case `/usr/bin/file conftest.o` in
+      *32-bit*)
+	case $host in
+	  x86_64-*kfreebsd*-gnu)
+	    LD="${LD-ld} -m elf_i386_fbsd"
+	    ;;
+	  x86_64-*linux*)
+	    LD="${LD-ld} -m elf_i386"
+	    ;;
+	  ppc64-*linux*|powerpc64-*linux*)
+	    LD="${LD-ld} -m elf32ppclinux"
+	    ;;
+	  s390x-*linux*)
+	    LD="${LD-ld} -m elf_s390"
+	    ;;
+	  sparc64-*linux*)
+	    LD="${LD-ld} -m elf32_sparc"
+	    ;;
+	esac
+	;;
+      *64-bit*)
+	case $host in
+	  x86_64-*kfreebsd*-gnu)
+	    LD="${LD-ld} -m elf_x86_64_fbsd"
+	    ;;
+	  x86_64-*linux*)
+	    LD="${LD-ld} -m elf_x86_64"
+	    ;;
+	  ppc*-*linux*|powerpc*-*linux*)
+	    LD="${LD-ld} -m elf64ppc"
+	    ;;
+	  s390*-*linux*|s390*-*tpf*)
+	    LD="${LD-ld} -m elf64_s390"
+	    ;;
+	  sparc*-*linux*)
+	    LD="${LD-ld} -m elf64_sparc"
+	    ;;
+	esac
+	;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+
+*-*-sco3.2v5*)
+  # On SCO OpenServer 5, we need -belf to get full-featured binaries.
+  SAVE_CFLAGS="$CFLAGS"
+  CFLAGS="$CFLAGS -belf"
+  AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf,
+    [AC_LANG_PUSH(C)
+     AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no])
+     AC_LANG_POP])
+  if test x"$lt_cv_cc_needs_belf" != x"yes"; then
+    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf
+    CFLAGS="$SAVE_CFLAGS"
+  fi
+  ;;
+*-*solaris*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if AC_TRY_EVAL(ac_compile); then
+    case `/usr/bin/file conftest.o` in
+    *64-bit*)
+      case $lt_cv_prog_gnu_ld in
+      yes*)
+        case $host in
+        i?86-*-solaris*)
+          LD="${LD-ld} -m elf_x86_64"
+          ;;
+        sparc*-*-solaris*)
+          LD="${LD-ld} -m elf64_sparc"
+          ;;
+        esac
+        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.
+        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then
+          LD="${LD-ld}_sol2"
+        fi
+        ;;
+      *)
+	if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then
+	  LD="${LD-ld} -64"
+	fi
+	;;
+      esac
+      ;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+esac
+
+need_locks="$enable_libtool_lock"
+])# _LT_ENABLE_LOCK
+
+
+# _LT_PROG_AR
+# -----------
+m4_defun([_LT_PROG_AR],
+[AC_CHECK_TOOLS(AR, [ar], false)
+: ${AR=ar}
+: ${AR_FLAGS=cru}
+_LT_DECL([], [AR], [1], [The archiver])
+_LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive])
+
+AC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file],
+  [lt_cv_ar_at_file=no
+   AC_COMPILE_IFELSE([AC_LANG_PROGRAM],
+     [echo conftest.$ac_objext > conftest.lst
+      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD'
+      AC_TRY_EVAL([lt_ar_try])
+      if test "$ac_status" -eq 0; then
+	# Ensure the archiver fails upon bogus file names.
+	rm -f conftest.$ac_objext libconftest.a
+	AC_TRY_EVAL([lt_ar_try])
+	if test "$ac_status" -ne 0; then
+          lt_cv_ar_at_file=@
+        fi
+      fi
+      rm -f conftest.* libconftest.a
+     ])
+  ])
+
+if test "x$lt_cv_ar_at_file" = xno; then
+  archiver_list_spec=
+else
+  archiver_list_spec=$lt_cv_ar_at_file
+fi
+_LT_DECL([], [archiver_list_spec], [1],
+  [How to feed a file listing to the archiver])
+])# _LT_PROG_AR
+
+
+# _LT_CMD_OLD_ARCHIVE
+# -------------------
+m4_defun([_LT_CMD_OLD_ARCHIVE],
+[_LT_PROG_AR
+
+AC_CHECK_TOOL(STRIP, strip, :)
+test -z "$STRIP" && STRIP=:
+_LT_DECL([], [STRIP], [1], [A symbol stripping program])
+
+AC_CHECK_TOOL(RANLIB, ranlib, :)
+test -z "$RANLIB" && RANLIB=:
+_LT_DECL([], [RANLIB], [1],
+    [Commands used to install an old-style archive])
+
+# Determine commands to create old-style static archives.
+old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'
+old_postinstall_cmds='chmod 644 $oldlib'
+old_postuninstall_cmds=
+
+if test -n "$RANLIB"; then
+  case $host_os in
+  openbsd*)
+    old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib"
+    ;;
+  *)
+    old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib"
+    ;;
+  esac
+  old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib"
+fi
+
+case $host_os in
+  darwin*)
+    lock_old_archive_extraction=yes ;;
+  *)
+    lock_old_archive_extraction=no ;;
+esac
+_LT_DECL([], [old_postinstall_cmds], [2])
+_LT_DECL([], [old_postuninstall_cmds], [2])
+_LT_TAGDECL([], [old_archive_cmds], [2],
+    [Commands used to build an old-style archive])
+_LT_DECL([], [lock_old_archive_extraction], [0],
+    [Whether to use a lock for old archive extraction])
+])# _LT_CMD_OLD_ARCHIVE
+
+
+# _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,
+#		[OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE])
+# ----------------------------------------------------------------
+# Check whether the given compiler option works
+AC_DEFUN([_LT_COMPILER_OPTION],
+[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_DECL_SED])dnl
+AC_CACHE_CHECK([$1], [$2],
+  [$2=no
+   m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4])
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+   lt_compiler_flag="$3"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   # The option is referenced via a variable to avoid confusing sed.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD)
+   (eval "$lt_compile" 2>conftest.err)
+   ac_status=$?
+   cat conftest.err >&AS_MESSAGE_LOG_FD
+   echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+   if (exit $ac_status) && test -s "$ac_outfile"; then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings other than the usual output.
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp
+     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then
+       $2=yes
+     fi
+   fi
+   $RM conftest*
+])
+
+if test x"[$]$2" = xyes; then
+    m4_if([$5], , :, [$5])
+else
+    m4_if([$6], , :, [$6])
+fi
+])# _LT_COMPILER_OPTION
+
+# Old name:
+AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], [])
+
+
+# _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS,
+#                  [ACTION-SUCCESS], [ACTION-FAILURE])
+# ----------------------------------------------------
+# Check whether the given linker option works
+AC_DEFUN([_LT_LINKER_OPTION],
+[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_DECL_SED])dnl
+AC_CACHE_CHECK([$1], [$2],
+  [$2=no
+   save_LDFLAGS="$LDFLAGS"
+   LDFLAGS="$LDFLAGS $3"
+   echo "$lt_simple_link_test_code" > conftest.$ac_ext
+   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then
+     # The linker can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     if test -s conftest.err; then
+       # Append any errors to the config.log.
+       cat conftest.err 1>&AS_MESSAGE_LOG_FD
+       $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp
+       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+       if diff conftest.exp conftest.er2 >/dev/null; then
+         $2=yes
+       fi
+     else
+       $2=yes
+     fi
+   fi
+   $RM -r conftest*
+   LDFLAGS="$save_LDFLAGS"
+])
+
+if test x"[$]$2" = xyes; then
+    m4_if([$4], , :, [$4])
+else
+    m4_if([$5], , :, [$5])
+fi
+])# _LT_LINKER_OPTION
+
+# Old name:
+AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], [])
+
+
+# LT_CMD_MAX_LEN
+#---------------
+AC_DEFUN([LT_CMD_MAX_LEN],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+# find the maximum length of command line arguments
+AC_MSG_CHECKING([the maximum length of command line arguments])
+AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl
+  i=0
+  teststring="ABCD"
+
+  case $build_os in
+  msdosdjgpp*)
+    # On DJGPP, this test can blow up pretty badly due to problems in libc
+    # (any single argument exceeding 2000 bytes causes a buffer overrun
+    # during glob expansion).  Even if it were fixed, the result of this
+    # check would be larger than it should be.
+    lt_cv_sys_max_cmd_len=12288;    # 12K is about right
+    ;;
+
+  gnu*)
+    # Under GNU Hurd, this test is not required because there is
+    # no limit to the length of command line arguments.
+    # Libtool will interpret -1 as no limit whatsoever
+    lt_cv_sys_max_cmd_len=-1;
+    ;;
+
+  cygwin* | mingw* | cegcc*)
+    # On Win9x/ME, this test blows up -- it succeeds, but takes
+    # about 5 minutes as the teststring grows exponentially.
+    # Worse, since 9x/ME are not pre-emptively multitasking,
+    # you end up with a "frozen" computer, even though with patience
+    # the test eventually succeeds (with a max line length of 256k).
+    # Instead, let's just punt: use the minimum linelength reported by
+    # all of the supported platforms: 8192 (on NT/2K/XP).
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  mint*)
+    # On MiNT this can take a long time and run out of memory.
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  amigaos*)
+    # On AmigaOS with pdksh, this test takes hours, literally.
+    # So we just punt and use a minimum line length of 8192.
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  netbsd* | freebsd* | openbsd* | darwin* | dragonfly*)
+    # This has been around since 386BSD, at least.  Likely further.
+    if test -x /sbin/sysctl; then
+      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`
+    elif test -x /usr/sbin/sysctl; then
+      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`
+    else
+      lt_cv_sys_max_cmd_len=65536	# usable default for all BSDs
+    fi
+    # And add a safety zone
+    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4`
+    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3`
+    ;;
+
+  interix*)
+    # We know the value 262144 and hardcode it with a safety zone (like BSD)
+    lt_cv_sys_max_cmd_len=196608
+    ;;
+
+  os2*)
+    # The test takes a long time on OS/2.
+    lt_cv_sys_max_cmd_len=8192
+    ;;
+
+  osf*)
+    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure
+    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not
+    # nice to cause kernel panics so lets avoid the loop below.
+    # First set a reasonable default.
+    lt_cv_sys_max_cmd_len=16384
+    #
+    if test -x /sbin/sysconfig; then
+      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in
+        *1*) lt_cv_sys_max_cmd_len=-1 ;;
+      esac
+    fi
+    ;;
+  sco3.2v5*)
+    lt_cv_sys_max_cmd_len=102400
+    ;;
+  sysv5* | sco5v6* | sysv4.2uw2*)
+    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`
+    if test -n "$kargmax"; then
+      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[	 ]]//'`
+    else
+      lt_cv_sys_max_cmd_len=32768
+    fi
+    ;;
+  *)
+    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`
+    if test -n "$lt_cv_sys_max_cmd_len"; then
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4`
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3`
+    else
+      # Make teststring a little bigger before we do anything with it.
+      # a 1K string should be a reasonable start.
+      for i in 1 2 3 4 5 6 7 8 ; do
+        teststring=$teststring$teststring
+      done
+      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}
+      # If test is not a shell built-in, we'll probably end up computing a
+      # maximum length that is only half of the actual maximum length, but
+      # we can't tell.
+      while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \
+	         = "X$teststring$teststring"; } >/dev/null 2>&1 &&
+	      test $i != 17 # 1/2 MB should be enough
+      do
+        i=`expr $i + 1`
+        teststring=$teststring$teststring
+      done
+      # Only check the string length outside the loop.
+      lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1`
+      teststring=
+      # Add a significant safety factor because C++ compilers can tack on
+      # massive amounts of additional arguments before passing them to the
+      # linker.  It appears as though 1/2 is a usable value.
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2`
+    fi
+    ;;
+  esac
+])
+if test -n $lt_cv_sys_max_cmd_len ; then
+  AC_MSG_RESULT($lt_cv_sys_max_cmd_len)
+else
+  AC_MSG_RESULT(none)
+fi
+max_cmd_len=$lt_cv_sys_max_cmd_len
+_LT_DECL([], [max_cmd_len], [0],
+    [What is the maximum length of a command?])
+])# LT_CMD_MAX_LEN
+
+# Old name:
+AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], [])
+
+
+# _LT_HEADER_DLFCN
+# ----------------
+m4_defun([_LT_HEADER_DLFCN],
+[AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl
+])# _LT_HEADER_DLFCN
+
+
+# _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE,
+#                      ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING)
+# ----------------------------------------------------------------
+m4_defun([_LT_TRY_DLOPEN_SELF],
+[m4_require([_LT_HEADER_DLFCN])dnl
+if test "$cross_compiling" = yes; then :
+  [$4]
+else
+  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
+  lt_status=$lt_dlunknown
+  cat > conftest.$ac_ext <<_LT_EOF
+[#line $LINENO "configure"
+#include "confdefs.h"
+
+#if HAVE_DLFCN_H
+#include <dlfcn.h>
+#endif
+
+#include <stdio.h>
+
+#ifdef RTLD_GLOBAL
+#  define LT_DLGLOBAL		RTLD_GLOBAL
+#else
+#  ifdef DL_GLOBAL
+#    define LT_DLGLOBAL		DL_GLOBAL
+#  else
+#    define LT_DLGLOBAL		0
+#  endif
+#endif
+
+/* We may have to define LT_DLLAZY_OR_NOW in the command line if we
+   find out it does not work in some platform. */
+#ifndef LT_DLLAZY_OR_NOW
+#  ifdef RTLD_LAZY
+#    define LT_DLLAZY_OR_NOW		RTLD_LAZY
+#  else
+#    ifdef DL_LAZY
+#      define LT_DLLAZY_OR_NOW		DL_LAZY
+#    else
+#      ifdef RTLD_NOW
+#        define LT_DLLAZY_OR_NOW	RTLD_NOW
+#      else
+#        ifdef DL_NOW
+#          define LT_DLLAZY_OR_NOW	DL_NOW
+#        else
+#          define LT_DLLAZY_OR_NOW	0
+#        endif
+#      endif
+#    endif
+#  endif
+#endif
+
+/* When -fvisbility=hidden is used, assume the code has been annotated
+   correspondingly for the symbols needed.  */
+#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))
+int fnord () __attribute__((visibility("default")));
+#endif
+
+int fnord () { return 42; }
+int main ()
+{
+  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);
+  int status = $lt_dlunknown;
+
+  if (self)
+    {
+      if (dlsym (self,"fnord"))       status = $lt_dlno_uscore;
+      else
+        {
+	  if (dlsym( self,"_fnord"))  status = $lt_dlneed_uscore;
+          else puts (dlerror ());
+	}
+      /* dlclose (self); */
+    }
+  else
+    puts (dlerror ());
+
+  return status;
+}]
+_LT_EOF
+  if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then
+    (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null
+    lt_status=$?
+    case x$lt_status in
+      x$lt_dlno_uscore) $1 ;;
+      x$lt_dlneed_uscore) $2 ;;
+      x$lt_dlunknown|x*) $3 ;;
+    esac
+  else :
+    # compilation failed
+    $3
+  fi
+fi
+rm -fr conftest*
+])# _LT_TRY_DLOPEN_SELF
+
+
+# LT_SYS_DLOPEN_SELF
+# ------------------
+AC_DEFUN([LT_SYS_DLOPEN_SELF],
+[m4_require([_LT_HEADER_DLFCN])dnl
+if test "x$enable_dlopen" != xyes; then
+  enable_dlopen=unknown
+  enable_dlopen_self=unknown
+  enable_dlopen_self_static=unknown
+else
+  lt_cv_dlopen=no
+  lt_cv_dlopen_libs=
+
+  case $host_os in
+  beos*)
+    lt_cv_dlopen="load_add_on"
+    lt_cv_dlopen_libs=
+    lt_cv_dlopen_self=yes
+    ;;
+
+  mingw* | pw32* | cegcc*)
+    lt_cv_dlopen="LoadLibrary"
+    lt_cv_dlopen_libs=
+    ;;
+
+  cygwin*)
+    lt_cv_dlopen="dlopen"
+    lt_cv_dlopen_libs=
+    ;;
+
+  darwin*)
+  # if libdl is installed we need to link against it
+    AC_CHECK_LIB([dl], [dlopen],
+		[lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[
+    lt_cv_dlopen="dyld"
+    lt_cv_dlopen_libs=
+    lt_cv_dlopen_self=yes
+    ])
+    ;;
+
+  *)
+    AC_CHECK_FUNC([shl_load],
+	  [lt_cv_dlopen="shl_load"],
+      [AC_CHECK_LIB([dld], [shl_load],
+	    [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"],
+	[AC_CHECK_FUNC([dlopen],
+	      [lt_cv_dlopen="dlopen"],
+	  [AC_CHECK_LIB([dl], [dlopen],
+		[lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],
+	    [AC_CHECK_LIB([svld], [dlopen],
+		  [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"],
+	      [AC_CHECK_LIB([dld], [dld_link],
+		    [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"])
+	      ])
+	    ])
+	  ])
+	])
+      ])
+    ;;
+  esac
+
+  if test "x$lt_cv_dlopen" != xno; then
+    enable_dlopen=yes
+  else
+    enable_dlopen=no
+  fi
+
+  case $lt_cv_dlopen in
+  dlopen)
+    save_CPPFLAGS="$CPPFLAGS"
+    test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H"
+
+    save_LDFLAGS="$LDFLAGS"
+    wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\"
+
+    save_LIBS="$LIBS"
+    LIBS="$lt_cv_dlopen_libs $LIBS"
+
+    AC_CACHE_CHECK([whether a program can dlopen itself],
+	  lt_cv_dlopen_self, [dnl
+	  _LT_TRY_DLOPEN_SELF(
+	    lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes,
+	    lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross)
+    ])
+
+    if test "x$lt_cv_dlopen_self" = xyes; then
+      wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\"
+      AC_CACHE_CHECK([whether a statically linked program can dlopen itself],
+	  lt_cv_dlopen_self_static, [dnl
+	  _LT_TRY_DLOPEN_SELF(
+	    lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes,
+	    lt_cv_dlopen_self_static=no,  lt_cv_dlopen_self_static=cross)
+      ])
+    fi
+
+    CPPFLAGS="$save_CPPFLAGS"
+    LDFLAGS="$save_LDFLAGS"
+    LIBS="$save_LIBS"
+    ;;
+  esac
+
+  case $lt_cv_dlopen_self in
+  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;
+  *) enable_dlopen_self=unknown ;;
+  esac
+
+  case $lt_cv_dlopen_self_static in
+  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;
+  *) enable_dlopen_self_static=unknown ;;
+  esac
+fi
+_LT_DECL([dlopen_support], [enable_dlopen], [0],
+	 [Whether dlopen is supported])
+_LT_DECL([dlopen_self], [enable_dlopen_self], [0],
+	 [Whether dlopen of programs is supported])
+_LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0],
+	 [Whether dlopen of statically linked programs is supported])
+])# LT_SYS_DLOPEN_SELF
+
+# Old name:
+AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], [])
+
+
+# _LT_COMPILER_C_O([TAGNAME])
+# ---------------------------
+# Check to see if options -c and -o are simultaneously supported by compiler.
+# This macro does not hard code the compiler like AC_PROG_CC_C_O.
+m4_defun([_LT_COMPILER_C_O],
+[m4_require([_LT_DECL_SED])dnl
+m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_TAG_COMPILER])dnl
+AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],
+  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)],
+  [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no
+   $RM -r conftest 2>/dev/null
+   mkdir conftest
+   cd conftest
+   mkdir out
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+   lt_compiler_flag="-o out/conftest2.$ac_objext"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD)
+   (eval "$lt_compile" 2>out/conftest.err)
+   ac_status=$?
+   cat out/conftest.err >&AS_MESSAGE_LOG_FD
+   echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+   if (exit $ac_status) && test -s out/conftest2.$ac_objext
+   then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp
+     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2
+     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then
+       _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes
+     fi
+   fi
+   chmod u+w . 2>&AS_MESSAGE_LOG_FD
+   $RM conftest*
+   # SGI C++ compiler will create directory out/ii_files/ for
+   # template instantiation
+   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files
+   $RM out/* && rmdir out
+   cd ..
+   $RM -r conftest
+   $RM conftest*
+])
+_LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1],
+	[Does compiler simultaneously support -c and -o options?])
+])# _LT_COMPILER_C_O
+
+
+# _LT_COMPILER_FILE_LOCKS([TAGNAME])
+# ----------------------------------
+# Check to see if we can do hard links to lock some files if needed
+m4_defun([_LT_COMPILER_FILE_LOCKS],
+[m4_require([_LT_ENABLE_LOCK])dnl
+m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+_LT_COMPILER_C_O([$1])
+
+hard_links="nottested"
+if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then
+  # do not overwrite the value of need_locks provided by the user
+  AC_MSG_CHECKING([if we can lock with hard links])
+  hard_links=yes
+  $RM conftest*
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  touch conftest.a
+  ln conftest.a conftest.b 2>&5 || hard_links=no
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  AC_MSG_RESULT([$hard_links])
+  if test "$hard_links" = no; then
+    AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe])
+    need_locks=warn
+  fi
+else
+  need_locks=no
+fi
+_LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?])
+])# _LT_COMPILER_FILE_LOCKS
+
+
+# _LT_CHECK_OBJDIR
+# ----------------
+m4_defun([_LT_CHECK_OBJDIR],
+[AC_CACHE_CHECK([for objdir], [lt_cv_objdir],
+[rm -f .libs 2>/dev/null
+mkdir .libs 2>/dev/null
+if test -d .libs; then
+  lt_cv_objdir=.libs
+else
+  # MS-DOS does not allow filenames that begin with a dot.
+  lt_cv_objdir=_libs
+fi
+rmdir .libs 2>/dev/null])
+objdir=$lt_cv_objdir
+_LT_DECL([], [objdir], [0],
+         [The name of the directory that contains temporary libtool files])dnl
+m4_pattern_allow([LT_OBJDIR])dnl
+AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/",
+  [Define to the sub-directory in which libtool stores uninstalled libraries.])
+])# _LT_CHECK_OBJDIR
+
+
+# _LT_LINKER_HARDCODE_LIBPATH([TAGNAME])
+# --------------------------------------
+# Check hardcoding attributes.
+m4_defun([_LT_LINKER_HARDCODE_LIBPATH],
+[AC_MSG_CHECKING([how to hardcode library paths into programs])
+_LT_TAGVAR(hardcode_action, $1)=
+if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" ||
+   test -n "$_LT_TAGVAR(runpath_var, $1)" ||
+   test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then
+
+  # We can hardcode non-existent directories.
+  if test "$_LT_TAGVAR(hardcode_direct, $1)" != no &&
+     # If the only mechanism to avoid hardcoding is shlibpath_var, we
+     # have to relink, otherwise we might link with an installed library
+     # when we should be linking with a yet-to-be-installed one
+     ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no &&
+     test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then
+    # Linking always hardcodes the temporary library directory.
+    _LT_TAGVAR(hardcode_action, $1)=relink
+  else
+    # We can link without hardcoding, and we can hardcode nonexisting dirs.
+    _LT_TAGVAR(hardcode_action, $1)=immediate
+  fi
+else
+  # We cannot hardcode anything, or else we can only hardcode existing
+  # directories.
+  _LT_TAGVAR(hardcode_action, $1)=unsupported
+fi
+AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)])
+
+if test "$_LT_TAGVAR(hardcode_action, $1)" = relink ||
+   test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then
+  # Fast installation is not supported
+  enable_fast_install=no
+elif test "$shlibpath_overrides_runpath" = yes ||
+     test "$enable_shared" = no; then
+  # Fast installation is not necessary
+  enable_fast_install=needless
+fi
+_LT_TAGDECL([], [hardcode_action], [0],
+    [How to hardcode a shared library path into an executable])
+])# _LT_LINKER_HARDCODE_LIBPATH
+
+
+# _LT_CMD_STRIPLIB
+# ----------------
+m4_defun([_LT_CMD_STRIPLIB],
+[m4_require([_LT_DECL_EGREP])
+striplib=
+old_striplib=
+AC_MSG_CHECKING([whether stripping libraries is possible])
+if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then
+  test -z "$old_striplib" && old_striplib="$STRIP --strip-debug"
+  test -z "$striplib" && striplib="$STRIP --strip-unneeded"
+  AC_MSG_RESULT([yes])
+else
+# FIXME - insert some real tests, host_os isn't really good enough
+  case $host_os in
+  darwin*)
+    if test -n "$STRIP" ; then
+      striplib="$STRIP -x"
+      old_striplib="$STRIP -S"
+      AC_MSG_RESULT([yes])
+    else
+      AC_MSG_RESULT([no])
+    fi
+    ;;
+  *)
+    AC_MSG_RESULT([no])
+    ;;
+  esac
+fi
+_LT_DECL([], [old_striplib], [1], [Commands to strip libraries])
+_LT_DECL([], [striplib], [1])
+])# _LT_CMD_STRIPLIB
+
+
+# _LT_SYS_DYNAMIC_LINKER([TAG])
+# -----------------------------
+# PORTME Fill in your ld.so characteristics
+m4_defun([_LT_SYS_DYNAMIC_LINKER],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+m4_require([_LT_DECL_EGREP])dnl
+m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_DECL_OBJDUMP])dnl
+m4_require([_LT_DECL_SED])dnl
+m4_require([_LT_CHECK_SHELL_FEATURES])dnl
+AC_MSG_CHECKING([dynamic linker characteristics])
+m4_if([$1],
+	[], [
+if test "$GCC" = yes; then
+  case $host_os in
+    darwin*) lt_awk_arg="/^libraries:/,/LR/" ;;
+    *) lt_awk_arg="/^libraries:/" ;;
+  esac
+  case $host_os in
+    mingw* | cegcc*) lt_sed_strip_eq="s,=\([[A-Za-z]]:\),\1,g" ;;
+    *) lt_sed_strip_eq="s,=/,/,g" ;;
+  esac
+  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq`
+  case $lt_search_path_spec in
+  *\;*)
+    # if the path contains ";" then we assume it to be the separator
+    # otherwise default to the standard path separator (i.e. ":") - it is
+    # assumed that no part of a normal pathname contains ";" but that should
+    # okay in the real world where ";" in dirpaths is itself problematic.
+    lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'`
+    ;;
+  *)
+    lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"`
+    ;;
+  esac
+  # Ok, now we have the path, separated by spaces, we can step through it
+  # and add multilib dir if necessary.
+  lt_tmp_lt_search_path_spec=
+  lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`
+  for lt_sys_path in $lt_search_path_spec; do
+    if test -d "$lt_sys_path/$lt_multi_os_dir"; then
+      lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir"
+    else
+      test -d "$lt_sys_path" && \
+	lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path"
+    fi
+  done
+  lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk '
+BEGIN {RS=" "; FS="/|\n";} {
+  lt_foo="";
+  lt_count=0;
+  for (lt_i = NF; lt_i > 0; lt_i--) {
+    if ($lt_i != "" && $lt_i != ".") {
+      if ($lt_i == "..") {
+        lt_count++;
+      } else {
+        if (lt_count == 0) {
+          lt_foo="/" $lt_i lt_foo;
+        } else {
+          lt_count--;
+        }
+      }
+    }
+  }
+  if (lt_foo != "") { lt_freq[[lt_foo]]++; }
+  if (lt_freq[[lt_foo]] == 1) { print lt_foo; }
+}'`
+  # AWK program above erroneously prepends '/' to C:/dos/paths
+  # for these hosts.
+  case $host_os in
+    mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\
+      $SED 's,/\([[A-Za-z]]:\),\1,g'` ;;
+  esac
+  sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP`
+else
+  sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib"
+fi])
+library_names_spec=
+libname_spec='lib$name'
+soname_spec=
+shrext_cmds=".so"
+postinstall_cmds=
+postuninstall_cmds=
+finish_cmds=
+finish_eval=
+shlibpath_var=
+shlibpath_overrides_runpath=unknown
+version_type=none
+dynamic_linker="$host_os ld.so"
+sys_lib_dlsearch_path_spec="/lib /usr/lib"
+need_lib_prefix=unknown
+hardcode_into_libs=no
+
+# when you set need_version to no, make sure it does not cause -set_version
+# flags to be left without arguments
+need_version=unknown
+
+case $host_os in
+aix3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'
+  shlibpath_var=LIBPATH
+
+  # AIX 3 has no versioning support, so we append a major version to the name.
+  soname_spec='${libname}${release}${shared_ext}$major'
+  ;;
+
+aix[[4-9]]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  hardcode_into_libs=yes
+  if test "$host_cpu" = ia64; then
+    # AIX 5 supports IA64
+    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'
+    shlibpath_var=LD_LIBRARY_PATH
+  else
+    # With GCC up to 2.95.x, collect2 would create an import file
+    # for dependence libraries.  The import file would start with
+    # the line `#! .'.  This would cause the generated library to
+    # depend on `.', always an invalid library.  This was fixed in
+    # development snapshots of GCC prior to 3.0.
+    case $host_os in
+      aix4 | aix4.[[01]] | aix4.[[01]].*)
+      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'
+	   echo ' yes '
+	   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then
+	:
+      else
+	can_build_shared=no
+      fi
+      ;;
+    esac
+    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct
+    # soname into executable. Probably we can add versioning support to
+    # collect2, so additional links can be useful in future.
+    if test "$aix_use_runtimelinking" = yes; then
+      # If using run time linking (on AIX 4.2 or later) use lib<name>.so
+      # instead of lib<name>.a to let people know that these are not
+      # typical AIX shared libraries.
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    else
+      # We preserve .a as extension for shared libraries through AIX4.2
+      # and later when we are not doing run time linking.
+      library_names_spec='${libname}${release}.a $libname.a'
+      soname_spec='${libname}${release}${shared_ext}$major'
+    fi
+    shlibpath_var=LIBPATH
+  fi
+  ;;
+
+amigaos*)
+  case $host_cpu in
+  powerpc)
+    # Since July 2007 AmigaOS4 officially supports .so libraries.
+    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    ;;
+  m68k)
+    library_names_spec='$libname.ixlibrary $libname.a'
+    # Create ${libname}_ixlibrary.a entries in /sys/libs.
+    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'
+    ;;
+  esac
+  ;;
+
+beos*)
+  library_names_spec='${libname}${shared_ext}'
+  dynamic_linker="$host_os ld.so"
+  shlibpath_var=LIBRARY_PATH
+  ;;
+
+bsdi[[45]]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib"
+  sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib"
+  # the default ld.so.conf also contains /usr/contrib/lib and
+  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow
+  # libtool to hard-code these into programs
+  ;;
+
+cygwin* | mingw* | pw32* | cegcc*)
+  version_type=windows
+  shrext_cmds=".dll"
+  need_version=no
+  need_lib_prefix=no
+
+  case $GCC,$cc_basename in
+  yes,*)
+    # gcc
+    library_names_spec='$libname.dll.a'
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname~
+      chmod a+x \$dldir/$dlname~
+      if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then
+        eval '\''$striplib \$dldir/$dlname'\'' || exit \$?;
+      fi'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+
+    case $host_os in
+    cygwin*)
+      # Cygwin DLLs use 'cyg' prefix rather than 'lib'
+      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+m4_if([$1], [],[
+      sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"])
+      ;;
+    mingw* | cegcc*)
+      # MinGW DLLs use traditional 'lib' prefix
+      soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    pw32*)
+      # pw32 DLLs use 'pw' prefix rather than 'lib'
+      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    esac
+    dynamic_linker='Win32 ld.exe'
+    ;;
+
+  *,cl*)
+    # Native MSVC
+    libname_spec='$name'
+    soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
+    library_names_spec='${libname}.dll.lib'
+
+    case $build_os in
+    mingw*)
+      sys_lib_search_path_spec=
+      lt_save_ifs=$IFS
+      IFS=';'
+      for lt_path in $LIB
+      do
+        IFS=$lt_save_ifs
+        # Let DOS variable expansion print the short 8.3 style file name.
+        lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"`
+        sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path"
+      done
+      IFS=$lt_save_ifs
+      # Convert to MSYS style.
+      sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([[a-zA-Z]]\\):| /\\1|g' -e 's|^ ||'`
+      ;;
+    cygwin*)
+      # Convert to unix form, then to dos form, then back to unix form
+      # but this time dos style (no spaces!) so that the unix form looks
+      # like /cygdrive/c/PROGRA~1:/cygdr...
+      sys_lib_search_path_spec=`cygpath --path --unix "$LIB"`
+      sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null`
+      sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      ;;
+    *)
+      sys_lib_search_path_spec="$LIB"
+      if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then
+        # It is most probably a Windows format PATH.
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`
+      else
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      fi
+      # FIXME: find the short name or the path components, as spaces are
+      # common. (e.g. "Program Files" -> "PROGRA~1")
+      ;;
+    esac
+
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+    dynamic_linker='Win32 link.exe'
+    ;;
+
+  *)
+    # Assume MSVC wrapper
+    library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib'
+    dynamic_linker='Win32 ld.exe'
+    ;;
+  esac
+  # FIXME: first we should search . and the directory the executable is in
+  shlibpath_var=PATH
+  ;;
+
+darwin* | rhapsody*)
+  dynamic_linker="$host_os dyld"
+  version_type=darwin
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'
+  soname_spec='${libname}${release}${major}$shared_ext'
+  shlibpath_overrides_runpath=yes
+  shlibpath_var=DYLD_LIBRARY_PATH
+  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'
+m4_if([$1], [],[
+  sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"])
+  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'
+  ;;
+
+dgux*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+freebsd* | dragonfly*)
+  # DragonFly does not have aout.  When/if they implement a new
+  # versioning mechanism, adjust this.
+  if test -x /usr/bin/objformat; then
+    objformat=`/usr/bin/objformat`
+  else
+    case $host_os in
+    freebsd[[23]].*) objformat=aout ;;
+    *) objformat=elf ;;
+    esac
+  fi
+  version_type=freebsd-$objformat
+  case $version_type in
+    freebsd-elf*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+      need_version=no
+      need_lib_prefix=no
+      ;;
+    freebsd-*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'
+      need_version=yes
+      ;;
+  esac
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_os in
+  freebsd2.*)
+    shlibpath_overrides_runpath=yes
+    ;;
+  freebsd3.[[01]]* | freebsdelf3.[[01]]*)
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \
+  freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1)
+    shlibpath_overrides_runpath=no
+    hardcode_into_libs=yes
+    ;;
+  *) # from 4.6 on, and DragonFly
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  esac
+  ;;
+
+gnu*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+haiku*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  dynamic_linker="$host_os runtime_loader"
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'
+  hardcode_into_libs=yes
+  ;;
+
+hpux9* | hpux10* | hpux11*)
+  # Give a soname corresponding to the major version so that dld.sl refuses to
+  # link against other versions.
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  case $host_cpu in
+  ia64*)
+    shrext_cmds='.so'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.so"
+    shlibpath_var=LD_LIBRARY_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    if test "X$HPUX_IA64_MODE" = X32; then
+      sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib"
+    else
+      sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64"
+    fi
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  hppa*64*)
+    shrext_cmds='.sl'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64"
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  *)
+    shrext_cmds='.sl'
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=SHLIB_PATH
+    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    ;;
+  esac
+  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...
+  postinstall_cmds='chmod 555 $lib'
+  # or fails outright, so override atomically:
+  install_override_mode=555
+  ;;
+
+interix[[3-9]]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+irix5* | irix6* | nonstopux*)
+  case $host_os in
+    nonstopux*) version_type=nonstopux ;;
+    *)
+	if test "$lt_cv_prog_gnu_ld" = yes; then
+		version_type=linux # correct to gnu/linux during the next big refactor
+	else
+		version_type=irix
+	fi ;;
+  esac
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'
+  case $host_os in
+  irix5* | nonstopux*)
+    libsuff= shlibsuff=
+    ;;
+  *)
+    case $LD in # libtool.m4 will add one of these switches to LD
+    *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ")
+      libsuff= shlibsuff= libmagic=32-bit;;
+    *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ")
+      libsuff=32 shlibsuff=N32 libmagic=N32;;
+    *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ")
+      libsuff=64 shlibsuff=64 libmagic=64-bit;;
+    *) libsuff= shlibsuff= libmagic=never-match;;
+    esac
+    ;;
+  esac
+  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH
+  shlibpath_overrides_runpath=no
+  sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}"
+  sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}"
+  hardcode_into_libs=yes
+  ;;
+
+# No shared lib support for Linux oldld, aout, or coff.
+linux*oldld* | linux*aout* | linux*coff*)
+  dynamic_linker=no
+  ;;
+
+# This must be glibc/ELF.
+linux* | k*bsd*-gnu | kopensolaris*-gnu)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+
+  # Some binutils ld are patched to set DT_RUNPATH
+  AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath],
+    [lt_cv_shlibpath_overrides_runpath=no
+    save_LDFLAGS=$LDFLAGS
+    save_libdir=$libdir
+    eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \
+	 LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\""
+    AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])],
+      [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null],
+	 [lt_cv_shlibpath_overrides_runpath=yes])])
+    LDFLAGS=$save_LDFLAGS
+    libdir=$save_libdir
+    ])
+  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath
+
+  # This implies no fast_install, which is unacceptable.
+  # Some rework will be needed to allow for fast_install
+  # before this can be enabled.
+  hardcode_into_libs=yes
+
+  # Append ld.so.conf contents to the search path
+  if test -f /etc/ld.so.conf; then
+    lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[	 ]*hwcap[	 ]/d;s/[:,	]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '`
+    sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra"
+  fi
+
+  # We used to test for /lib/ld.so.1 and disable shared libraries on
+  # powerpc, because MkLinux only supported shared libraries with the
+  # GNU dynamic linker.  Since this was broken with cross compilers,
+  # most powerpc-linux boxes support dynamic linking these days and
+  # people can always --disable-shared, the test was removed, and we
+  # assume the GNU/Linux dynamic linker is in use.
+  dynamic_linker='GNU/Linux ld.so'
+  ;;
+
+netbsdelf*-gnu)
+  version_type=linux
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='NetBSD ld.elf_so'
+  ;;
+
+netbsd*)
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+    finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+    dynamic_linker='NetBSD (a.out) ld.so'
+  else
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    dynamic_linker='NetBSD ld.elf_so'
+  fi
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  ;;
+
+newsos6)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  ;;
+
+*nto* | *qnx*)
+  version_type=qnx
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='ldqnx.so'
+  ;;
+
+openbsd*)
+  version_type=sunos
+  sys_lib_dlsearch_path_spec="/usr/lib"
+  need_lib_prefix=no
+  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.
+  case $host_os in
+    openbsd3.3 | openbsd3.3.*)	need_version=yes ;;
+    *)				need_version=no  ;;
+  esac
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+    case $host_os in
+      openbsd2.[[89]] | openbsd2.[[89]].*)
+	shlibpath_overrides_runpath=no
+	;;
+      *)
+	shlibpath_overrides_runpath=yes
+	;;
+      esac
+  else
+    shlibpath_overrides_runpath=yes
+  fi
+  ;;
+
+os2*)
+  libname_spec='$name'
+  shrext_cmds=".dll"
+  need_lib_prefix=no
+  library_names_spec='$libname${shared_ext} $libname.a'
+  dynamic_linker='OS/2 ld.exe'
+  shlibpath_var=LIBPATH
+  ;;
+
+osf3* | osf4* | osf5*)
+  version_type=osf
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib"
+  sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec"
+  ;;
+
+rdos*)
+  dynamic_linker=no
+  ;;
+
+solaris*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  # ldd complains unless libraries are executable
+  postinstall_cmds='chmod +x $lib'
+  ;;
+
+sunos4*)
+  version_type=sunos
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  if test "$with_gnu_ld" = yes; then
+    need_lib_prefix=no
+  fi
+  need_version=yes
+  ;;
+
+sysv4 | sysv4.3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_vendor in
+    sni)
+      shlibpath_overrides_runpath=no
+      need_lib_prefix=no
+      runpath_var=LD_RUN_PATH
+      ;;
+    siemens)
+      need_lib_prefix=no
+      ;;
+    motorola)
+      need_lib_prefix=no
+      need_version=no
+      shlibpath_overrides_runpath=no
+      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'
+      ;;
+  esac
+  ;;
+
+sysv4*MP*)
+  if test -d /usr/nec ;then
+    version_type=linux # correct to gnu/linux during the next big refactor
+    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'
+    soname_spec='$libname${shared_ext}.$major'
+    shlibpath_var=LD_LIBRARY_PATH
+  fi
+  ;;
+
+sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
+  version_type=freebsd-elf
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  if test "$with_gnu_ld" = yes; then
+    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'
+  else
+    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'
+    case $host_os in
+      sco3.2v5*)
+        sys_lib_search_path_spec="$sys_lib_search_path_spec /lib"
+	;;
+    esac
+  fi
+  sys_lib_dlsearch_path_spec='/usr/lib'
+  ;;
+
+tpf*)
+  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+uts4*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+*)
+  dynamic_linker=no
+  ;;
+esac
+AC_MSG_RESULT([$dynamic_linker])
+test "$dynamic_linker" = no && can_build_shared=no
+
+variables_saved_for_relink="PATH $shlibpath_var $runpath_var"
+if test "$GCC" = yes; then
+  variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"
+fi
+
+if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then
+  sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec"
+fi
+if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then
+  sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec"
+fi
+
+_LT_DECL([], [variables_saved_for_relink], [1],
+    [Variables whose values should be saved in libtool wrapper scripts and
+    restored at link time])
+_LT_DECL([], [need_lib_prefix], [0],
+    [Do we need the "lib" prefix for modules?])
+_LT_DECL([], [need_version], [0], [Do we need a version for libraries?])
+_LT_DECL([], [version_type], [0], [Library versioning type])
+_LT_DECL([], [runpath_var], [0],  [Shared library runtime path variable])
+_LT_DECL([], [shlibpath_var], [0],[Shared library path variable])
+_LT_DECL([], [shlibpath_overrides_runpath], [0],
+    [Is shlibpath searched before the hard-coded library search path?])
+_LT_DECL([], [libname_spec], [1], [Format of library name prefix])
+_LT_DECL([], [library_names_spec], [1],
+    [[List of archive names.  First name is the real one, the rest are links.
+    The last name is the one that the linker finds with -lNAME]])
+_LT_DECL([], [soname_spec], [1],
+    [[The coded name of the library, if different from the real name]])
+_LT_DECL([], [install_override_mode], [1],
+    [Permission mode override for installation of shared libraries])
+_LT_DECL([], [postinstall_cmds], [2],
+    [Command to use after installation of a shared archive])
+_LT_DECL([], [postuninstall_cmds], [2],
+    [Command to use after uninstallation of a shared archive])
+_LT_DECL([], [finish_cmds], [2],
+    [Commands used to finish a libtool library installation in a directory])
+_LT_DECL([], [finish_eval], [1],
+    [[As "finish_cmds", except a single script fragment to be evaled but
+    not shown]])
+_LT_DECL([], [hardcode_into_libs], [0],
+    [Whether we should hardcode library paths into libraries])
+_LT_DECL([], [sys_lib_search_path_spec], [2],
+    [Compile-time system search path for libraries])
+_LT_DECL([], [sys_lib_dlsearch_path_spec], [2],
+    [Run-time system search path for libraries])
+])# _LT_SYS_DYNAMIC_LINKER
+
+
+# _LT_PATH_TOOL_PREFIX(TOOL)
+# --------------------------
+# find a file program which can recognize shared library
+AC_DEFUN([_LT_PATH_TOOL_PREFIX],
+[m4_require([_LT_DECL_EGREP])dnl
+AC_MSG_CHECKING([for $1])
+AC_CACHE_VAL(lt_cv_path_MAGIC_CMD,
+[case $MAGIC_CMD in
+[[\\/*] |  ?:[\\/]*])
+  lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path.
+  ;;
+*)
+  lt_save_MAGIC_CMD="$MAGIC_CMD"
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+dnl $ac_dummy forces splitting on constant user-supplied paths.
+dnl POSIX.2 word splitting is done only on the output of word expansions,
+dnl not every word.  This closes a longstanding sh security hole.
+  ac_dummy="m4_if([$2], , $PATH, [$2])"
+  for ac_dir in $ac_dummy; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f $ac_dir/$1; then
+      lt_cv_path_MAGIC_CMD="$ac_dir/$1"
+      if test -n "$file_magic_test_file"; then
+	case $deplibs_check_method in
+	"file_magic "*)
+	  file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"`
+	  MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+	  if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null |
+	    $EGREP "$file_magic_regex" > /dev/null; then
+	    :
+	  else
+	    cat <<_LT_EOF 1>&2
+
+*** Warning: the command libtool uses to detect shared libraries,
+*** $file_magic_cmd, produces output that libtool cannot recognize.
+*** The result is that libtool may fail to recognize shared libraries
+*** as such.  This will affect the creation of libtool libraries that
+*** depend on shared libraries, but programs linked with such libtool
+*** libraries will work regardless of this problem.  Nevertheless, you
+*** may want to report the problem to your system manager and/or to
+*** bug-libtool@gnu.org
+
+_LT_EOF
+	  fi ;;
+	esac
+      fi
+      break
+    fi
+  done
+  IFS="$lt_save_ifs"
+  MAGIC_CMD="$lt_save_MAGIC_CMD"
+  ;;
+esac])
+MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+if test -n "$MAGIC_CMD"; then
+  AC_MSG_RESULT($MAGIC_CMD)
+else
+  AC_MSG_RESULT(no)
+fi
+_LT_DECL([], [MAGIC_CMD], [0],
+	 [Used to examine libraries when file_magic_cmd begins with "file"])dnl
+])# _LT_PATH_TOOL_PREFIX
+
+# Old name:
+AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], [])
+
+
+# _LT_PATH_MAGIC
+# --------------
+# find a file program which can recognize a shared library
+m4_defun([_LT_PATH_MAGIC],
+[_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH)
+if test -z "$lt_cv_path_MAGIC_CMD"; then
+  if test -n "$ac_tool_prefix"; then
+    _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH)
+  else
+    MAGIC_CMD=:
+  fi
+fi
+])# _LT_PATH_MAGIC
+
+
+# LT_PATH_LD
+# ----------
+# find the pathname to the GNU or non-GNU linker
+AC_DEFUN([LT_PATH_LD],
+[AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_CANONICAL_BUILD])dnl
+m4_require([_LT_DECL_SED])dnl
+m4_require([_LT_DECL_EGREP])dnl
+m4_require([_LT_PROG_ECHO_BACKSLASH])dnl
+
+AC_ARG_WITH([gnu-ld],
+    [AS_HELP_STRING([--with-gnu-ld],
+	[assume the C compiler uses GNU ld @<:@default=no@:>@])],
+    [test "$withval" = no || with_gnu_ld=yes],
+    [with_gnu_ld=no])dnl
+
+ac_prog=ld
+if test "$GCC" = yes; then
+  # Check if gcc -print-prog-name=ld gives a path.
+  AC_MSG_CHECKING([for ld used by $CC])
+  case $host in
+  *-*-mingw*)
+    # gcc leaves a trailing carriage return which upsets mingw
+    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;;
+  *)
+    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;
+  esac
+  case $ac_prog in
+    # Accept absolute paths.
+    [[\\/]]* | ?:[[\\/]]*)
+      re_direlt='/[[^/]][[^/]]*/\.\./'
+      # Canonicalize the pathname of ld
+      ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'`
+      while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do
+	ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"`
+      done
+      test -z "$LD" && LD="$ac_prog"
+      ;;
+  "")
+    # If it fails, then pretend we aren't using GCC.
+    ac_prog=ld
+    ;;
+  *)
+    # If it is relative, then search for the first ld in PATH.
+    with_gnu_ld=unknown
+    ;;
+  esac
+elif test "$with_gnu_ld" = yes; then
+  AC_MSG_CHECKING([for GNU ld])
+else
+  AC_MSG_CHECKING([for non-GNU ld])
+fi
+AC_CACHE_VAL(lt_cv_path_LD,
+[if test -z "$LD"; then
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+  for ac_dir in $PATH; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then
+      lt_cv_path_LD="$ac_dir/$ac_prog"
+      # Check to see if the program is GNU ld.  I'd rather use --version,
+      # but apparently some variants of GNU ld only accept -v.
+      # Break only if it was the GNU/non-GNU ld that we prefer.
+      case `"$lt_cv_path_LD" -v 2>&1 </dev/null` in
+      *GNU* | *'with BFD'*)
+	test "$with_gnu_ld" != no && break
+	;;
+      *)
+	test "$with_gnu_ld" != yes && break
+	;;
+      esac
+    fi
+  done
+  IFS="$lt_save_ifs"
+else
+  lt_cv_path_LD="$LD" # Let the user override the test with a path.
+fi])
+LD="$lt_cv_path_LD"
+if test -n "$LD"; then
+  AC_MSG_RESULT($LD)
+else
+  AC_MSG_RESULT(no)
+fi
+test -z "$LD" && AC_MSG_ERROR([no acceptable ld found in \$PATH])
+_LT_PATH_LD_GNU
+AC_SUBST([LD])
+
+_LT_TAGDECL([], [LD], [1], [The linker used to build libraries])
+])# LT_PATH_LD
+
+# Old names:
+AU_ALIAS([AM_PROG_LD], [LT_PATH_LD])
+AU_ALIAS([AC_PROG_LD], [LT_PATH_LD])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AM_PROG_LD], [])
+dnl AC_DEFUN([AC_PROG_LD], [])
+
+
+# _LT_PATH_LD_GNU
+#- --------------
+m4_defun([_LT_PATH_LD_GNU],
+[AC_CACHE_CHECK([if the linker ($LD) is GNU ld], lt_cv_prog_gnu_ld,
+[# I'd rather use --version here, but apparently some GNU lds only accept -v.
+case `$LD -v 2>&1 </dev/null` in
+*GNU* | *'with BFD'*)
+  lt_cv_prog_gnu_ld=yes
+  ;;
+*)
+  lt_cv_prog_gnu_ld=no
+  ;;
+esac])
+with_gnu_ld=$lt_cv_prog_gnu_ld
+])# _LT_PATH_LD_GNU
+
+
+# _LT_CMD_RELOAD
+# --------------
+# find reload flag for linker
+#   -- PORTME Some linkers may need a different reload flag.
+m4_defun([_LT_CMD_RELOAD],
+[AC_CACHE_CHECK([for $LD option to reload object files],
+  lt_cv_ld_reload_flag,
+  [lt_cv_ld_reload_flag='-r'])
+reload_flag=$lt_cv_ld_reload_flag
+case $reload_flag in
+"" | " "*) ;;
+*) reload_flag=" $reload_flag" ;;
+esac
+reload_cmds='$LD$reload_flag -o $output$reload_objs'
+case $host_os in
+  cygwin* | mingw* | pw32* | cegcc*)
+    if test "$GCC" != yes; then
+      reload_cmds=false
+    fi
+    ;;
+  darwin*)
+    if test "$GCC" = yes; then
+      reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs'
+    else
+      reload_cmds='$LD$reload_flag -o $output$reload_objs'
+    fi
+    ;;
+esac
+_LT_TAGDECL([], [reload_flag], [1], [How to create reloadable object files])dnl
+_LT_TAGDECL([], [reload_cmds], [2])dnl
+])# _LT_CMD_RELOAD
+
+
+# _LT_CHECK_MAGIC_METHOD
+# ----------------------
+# how to check for library dependencies
+#  -- PORTME fill in with the dynamic library characteristics
+m4_defun([_LT_CHECK_MAGIC_METHOD],
+[m4_require([_LT_DECL_EGREP])
+m4_require([_LT_DECL_OBJDUMP])
+AC_CACHE_CHECK([how to recognize dependent libraries],
+lt_cv_deplibs_check_method,
+[lt_cv_file_magic_cmd='$MAGIC_CMD'
+lt_cv_file_magic_test_file=
+lt_cv_deplibs_check_method='unknown'
+# Need to set the preceding variable on all platforms that support
+# interlibrary dependencies.
+# 'none' -- dependencies not supported.
+# `unknown' -- same as none, but documents that we really don't know.
+# 'pass_all' -- all dependencies passed with no checks.
+# 'test_compile' -- check by making test program.
+# 'file_magic [[regex]]' -- check by looking for files in library path
+# which responds to the $file_magic_cmd with a given extended regex.
+# If you have `file' or equivalent on your system and you're not sure
+# whether `pass_all' will *always* work, you probably want this one.
+
+case $host_os in
+aix[[4-9]]*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+beos*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+bsdi[[45]]*)
+  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib)'
+  lt_cv_file_magic_cmd='/usr/bin/file -L'
+  lt_cv_file_magic_test_file=/shlib/libc.so
+  ;;
+
+cygwin*)
+  # func_win32_libid is a shell function defined in ltmain.sh
+  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'
+  lt_cv_file_magic_cmd='func_win32_libid'
+  ;;
+
+mingw* | pw32*)
+  # Base MSYS/MinGW do not provide the 'file' command needed by
+  # func_win32_libid shell function, so use a weaker test based on 'objdump',
+  # unless we find 'file', for example because we are cross-compiling.
+  # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin.
+  if ( test "$lt_cv_nm_interface" = "BSD nm" && file / ) >/dev/null 2>&1; then
+    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'
+    lt_cv_file_magic_cmd='func_win32_libid'
+  else
+    # Keep this pattern in sync with the one in func_win32_libid.
+    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'
+    lt_cv_file_magic_cmd='$OBJDUMP -f'
+  fi
+  ;;
+
+cegcc*)
+  # use the weaker test based on 'objdump'. See mingw*.
+  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'
+  lt_cv_file_magic_cmd='$OBJDUMP -f'
+  ;;
+
+darwin* | rhapsody*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+freebsd* | dragonfly*)
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then
+    case $host_cpu in
+    i*86 )
+      # Not sure whether the presence of OpenBSD here was a mistake.
+      # Let's accept both of them until this is cleared up.
+      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library'
+      lt_cv_file_magic_cmd=/usr/bin/file
+      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`
+      ;;
+    esac
+  else
+    lt_cv_deplibs_check_method=pass_all
+  fi
+  ;;
+
+gnu*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+haiku*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+hpux10.20* | hpux11*)
+  lt_cv_file_magic_cmd=/usr/bin/file
+  case $host_cpu in
+  ia64*)
+    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64'
+    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so
+    ;;
+  hppa*64*)
+    [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]']
+    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl
+    ;;
+  *)
+    lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\.[[0-9]]) shared library'
+    lt_cv_file_magic_test_file=/usr/lib/libc.sl
+    ;;
+  esac
+  ;;
+
+interix[[3-9]]*)
+  # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here
+  lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$'
+  ;;
+
+irix5* | irix6* | nonstopux*)
+  case $LD in
+  *-32|*"-32 ") libmagic=32-bit;;
+  *-n32|*"-n32 ") libmagic=N32;;
+  *-64|*"-64 ") libmagic=64-bit;;
+  *) libmagic=never-match;;
+  esac
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+# This must be glibc/ELF.
+linux* | k*bsd*-gnu | kopensolaris*-gnu)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+netbsd* | netbsdelf*-gnu)
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then
+    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$'
+  else
+    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$'
+  fi
+  ;;
+
+newos6*)
+  lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)'
+  lt_cv_file_magic_cmd=/usr/bin/file
+  lt_cv_file_magic_test_file=/usr/lib/libnls.so
+  ;;
+
+*nto* | *qnx*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+openbsd*)
+  if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$'
+  else
+    lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$'
+  fi
+  ;;
+
+osf3* | osf4* | osf5*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+rdos*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+solaris*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+sysv4 | sysv4.3*)
+  case $host_vendor in
+  motorola)
+    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]'
+    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`
+    ;;
+  ncr)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  sequent)
+    lt_cv_file_magic_cmd='/bin/file'
+    lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )'
+    ;;
+  sni)
+    lt_cv_file_magic_cmd='/bin/file'
+    lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib"
+    lt_cv_file_magic_test_file=/lib/libc.so
+    ;;
+  siemens)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  pc)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  esac
+  ;;
+
+tpf*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+esac
+])
+
+file_magic_glob=
+want_nocaseglob=no
+if test "$build" = "$host"; then
+  case $host_os in
+  mingw* | pw32*)
+    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then
+      want_nocaseglob=yes
+    else
+      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[[\1]]\/[[\1]]\/g;/g"`
+    fi
+    ;;
+  esac
+fi
+
+file_magic_cmd=$lt_cv_file_magic_cmd
+deplibs_check_method=$lt_cv_deplibs_check_method
+test -z "$deplibs_check_method" && deplibs_check_method=unknown
+
+_LT_DECL([], [deplibs_check_method], [1],
+    [Method to check whether dependent libraries are shared objects])
+_LT_DECL([], [file_magic_cmd], [1],
+    [Command to use when deplibs_check_method = "file_magic"])
+_LT_DECL([], [file_magic_glob], [1],
+    [How to find potential files when deplibs_check_method = "file_magic"])
+_LT_DECL([], [want_nocaseglob], [1],
+    [Find potential files using nocaseglob when deplibs_check_method = "file_magic"])
+])# _LT_CHECK_MAGIC_METHOD
+
+
+# LT_PATH_NM
+# ----------
+# find the pathname to a BSD- or MS-compatible name lister
+AC_DEFUN([LT_PATH_NM],
+[AC_REQUIRE([AC_PROG_CC])dnl
+AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM,
+[if test -n "$NM"; then
+  # Let the user override the test.
+  lt_cv_path_NM="$NM"
+else
+  lt_nm_to_check="${ac_tool_prefix}nm"
+  if test -n "$ac_tool_prefix" && test "$build" = "$host"; then
+    lt_nm_to_check="$lt_nm_to_check nm"
+  fi
+  for lt_tmp_nm in $lt_nm_to_check; do
+    lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do
+      IFS="$lt_save_ifs"
+      test -z "$ac_dir" && ac_dir=.
+      tmp_nm="$ac_dir/$lt_tmp_nm"
+      if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then
+	# Check to see if the nm accepts a BSD-compat flag.
+	# Adding the `sed 1q' prevents false positives on HP-UX, which says:
+	#   nm: unknown option "B" ignored
+	# Tru64's nm complains that /dev/null is an invalid object file
+	case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in
+	*/dev/null* | *'Invalid file or object type'*)
+	  lt_cv_path_NM="$tmp_nm -B"
+	  break
+	  ;;
+	*)
+	  case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in
+	  */dev/null*)
+	    lt_cv_path_NM="$tmp_nm -p"
+	    break
+	    ;;
+	  *)
+	    lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but
+	    continue # so that we can try to find one that supports BSD flags
+	    ;;
+	  esac
+	  ;;
+	esac
+      fi
+    done
+    IFS="$lt_save_ifs"
+  done
+  : ${lt_cv_path_NM=no}
+fi])
+if test "$lt_cv_path_NM" != "no"; then
+  NM="$lt_cv_path_NM"
+else
+  # Didn't find any BSD compatible name lister, look for dumpbin.
+  if test -n "$DUMPBIN"; then :
+    # Let the user override the test.
+  else
+    AC_CHECK_TOOLS(DUMPBIN, [dumpbin "link -dump"], :)
+    case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in
+    *COFF*)
+      DUMPBIN="$DUMPBIN -symbols"
+      ;;
+    *)
+      DUMPBIN=:
+      ;;
+    esac
+  fi
+  AC_SUBST([DUMPBIN])
+  if test "$DUMPBIN" != ":"; then
+    NM="$DUMPBIN"
+  fi
+fi
+test -z "$NM" && NM=nm
+AC_SUBST([NM])
+_LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl
+
+AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface],
+  [lt_cv_nm_interface="BSD nm"
+  echo "int some_variable = 0;" > conftest.$ac_ext
+  (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&AS_MESSAGE_LOG_FD)
+  (eval "$ac_compile" 2>conftest.err)
+  cat conftest.err >&AS_MESSAGE_LOG_FD
+  (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD)
+  (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out)
+  cat conftest.err >&AS_MESSAGE_LOG_FD
+  (eval echo "\"\$as_me:$LINENO: output\"" >&AS_MESSAGE_LOG_FD)
+  cat conftest.out >&AS_MESSAGE_LOG_FD
+  if $GREP 'External.*some_variable' conftest.out > /dev/null; then
+    lt_cv_nm_interface="MS dumpbin"
+  fi
+  rm -f conftest*])
+])# LT_PATH_NM
+
+# Old names:
+AU_ALIAS([AM_PROG_NM], [LT_PATH_NM])
+AU_ALIAS([AC_PROG_NM], [LT_PATH_NM])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AM_PROG_NM], [])
+dnl AC_DEFUN([AC_PROG_NM], [])
+
+# _LT_CHECK_SHAREDLIB_FROM_LINKLIB
+# --------------------------------
+# how to determine the name of the shared library
+# associated with a specific link library.
+#  -- PORTME fill in with the dynamic library characteristics
+m4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB],
+[m4_require([_LT_DECL_EGREP])
+m4_require([_LT_DECL_OBJDUMP])
+m4_require([_LT_DECL_DLLTOOL])
+AC_CACHE_CHECK([how to associate runtime and link libraries],
+lt_cv_sharedlib_from_linklib_cmd,
+[lt_cv_sharedlib_from_linklib_cmd='unknown'
+
+case $host_os in
+cygwin* | mingw* | pw32* | cegcc*)
+  # two different shell functions defined in ltmain.sh
+  # decide which to use based on capabilities of $DLLTOOL
+  case `$DLLTOOL --help 2>&1` in
+  *--identify-strict*)
+    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib
+    ;;
+  *)
+    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback
+    ;;
+  esac
+  ;;
+*)
+  # fallback: assume linklib IS sharedlib
+  lt_cv_sharedlib_from_linklib_cmd="$ECHO"
+  ;;
+esac
+])
+sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd
+test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO
+
+_LT_DECL([], [sharedlib_from_linklib_cmd], [1],
+    [Command to associate shared and link libraries])
+])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB
+
+
+# _LT_PATH_MANIFEST_TOOL
+# ----------------------
+# locate the manifest tool
+m4_defun([_LT_PATH_MANIFEST_TOOL],
+[AC_CHECK_TOOL(MANIFEST_TOOL, mt, :)
+test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt
+AC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool],
+  [lt_cv_path_mainfest_tool=no
+  echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&AS_MESSAGE_LOG_FD
+  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out
+  cat conftest.err >&AS_MESSAGE_LOG_FD
+  if $GREP 'Manifest Tool' conftest.out > /dev/null; then
+    lt_cv_path_mainfest_tool=yes
+  fi
+  rm -f conftest*])
+if test "x$lt_cv_path_mainfest_tool" != xyes; then
+  MANIFEST_TOOL=:
+fi
+_LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl
+])# _LT_PATH_MANIFEST_TOOL
+
+
+# LT_LIB_M
+# --------
+# check for math library
+AC_DEFUN([LT_LIB_M],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+LIBM=
+case $host in
+*-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*)
+  # These system don't have libm, or don't need it
+  ;;
+*-ncr-sysv4.3*)
+  AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw")
+  AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm")
+  ;;
+*)
+  AC_CHECK_LIB(m, cos, LIBM="-lm")
+  ;;
+esac
+AC_SUBST([LIBM])
+])# LT_LIB_M
+
+# Old name:
+AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_CHECK_LIBM], [])
+
+
+# _LT_COMPILER_NO_RTTI([TAGNAME])
+# -------------------------------
+m4_defun([_LT_COMPILER_NO_RTTI],
+[m4_require([_LT_TAG_COMPILER])dnl
+
+_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=
+
+if test "$GCC" = yes; then
+  case $cc_basename in
+  nvcc*)
+    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;;
+  *)
+    _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;;
+  esac
+
+  _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions],
+    lt_cv_prog_compiler_rtti_exceptions,
+    [-fno-rtti -fno-exceptions], [],
+    [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"])
+fi
+_LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1],
+	[Compiler flag to turn off builtin functions])
+])# _LT_COMPILER_NO_RTTI
+
+
+# _LT_CMD_GLOBAL_SYMBOLS
+# ----------------------
+m4_defun([_LT_CMD_GLOBAL_SYMBOLS],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([LT_PATH_NM])dnl
+AC_REQUIRE([LT_PATH_LD])dnl
+m4_require([_LT_DECL_SED])dnl
+m4_require([_LT_DECL_EGREP])dnl
+m4_require([_LT_TAG_COMPILER])dnl
+
+# Check for command to grab the raw symbol name followed by C symbol from nm.
+AC_MSG_CHECKING([command to parse $NM output from $compiler object])
+AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe],
+[
+# These are sane defaults that work on at least a few old systems.
+# [They come from Ultrix.  What could be older than Ultrix?!! ;)]
+
+# Character class describing NM global symbol codes.
+symcode='[[BCDEGRST]]'
+
+# Regexp to match symbols that can be accessed directly from C.
+sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)'
+
+# Define system-specific variables.
+case $host_os in
+aix*)
+  symcode='[[BCDT]]'
+  ;;
+cygwin* | mingw* | pw32* | cegcc*)
+  symcode='[[ABCDGISTW]]'
+  ;;
+hpux*)
+  if test "$host_cpu" = ia64; then
+    symcode='[[ABCDEGRST]]'
+  fi
+  ;;
+irix* | nonstopux*)
+  symcode='[[BCDEGRST]]'
+  ;;
+osf*)
+  symcode='[[BCDEGQRST]]'
+  ;;
+solaris*)
+  symcode='[[BDRT]]'
+  ;;
+sco3.2v5*)
+  symcode='[[DT]]'
+  ;;
+sysv4.2uw2*)
+  symcode='[[DT]]'
+  ;;
+sysv5* | sco5v6* | unixware* | OpenUNIX*)
+  symcode='[[ABDT]]'
+  ;;
+sysv4)
+  symcode='[[DFNSTU]]'
+  ;;
+esac
+
+# If we're using GNU nm, then use its standard symbol codes.
+case `$NM -V 2>&1` in
+*GNU* | *'with BFD'*)
+  symcode='[[ABCDGIRSTW]]' ;;
+esac
+
+# Transform an extracted symbol line into a proper C declaration.
+# Some systems (esp. on ia64) link data and code symbols differently,
+# so use this general approach.
+lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'"
+
+# Transform an extracted symbol line into symbol name and symbol address
+lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/  {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/  {\"\2\", (void *) \&\2},/p'"
+lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/  {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/  {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/  {\"lib\2\", (void *) \&\2},/p'"
+
+# Handle CRLF in mingw tool chain
+opt_cr=
+case $build_os in
+mingw*)
+  opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp
+  ;;
+esac
+
+# Try without a prefix underscore, then with it.
+for ac_symprfx in "" "_"; do
+
+  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.
+  symxfrm="\\1 $ac_symprfx\\2 \\2"
+
+  # Write the raw and C identifiers.
+  if test "$lt_cv_nm_interface" = "MS dumpbin"; then
+    # Fake it for dumpbin and say T for any non-static function
+    # and D for any global variable.
+    # Also find C++ and __fastcall symbols from MSVC++,
+    # which start with @ or ?.
+    lt_cv_sys_global_symbol_pipe="$AWK ['"\
+"     {last_section=section; section=\$ 3};"\
+"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\
+"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\
+"     \$ 0!~/External *\|/{next};"\
+"     / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\
+"     {if(hide[section]) next};"\
+"     {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\
+"     {split(\$ 0, a, /\||\r/); split(a[2], s)};"\
+"     s[1]~/^[@?]/{print s[1], s[1]; next};"\
+"     s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\
+"     ' prfx=^$ac_symprfx]"
+  else
+    lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[	 ]]\($symcode$symcode*\)[[	 ]][[	 ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'"
+  fi
+  lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'"
+
+  # Check to see that the pipe works correctly.
+  pipe_works=no
+
+  rm -f conftest*
+  cat > conftest.$ac_ext <<_LT_EOF
+#ifdef __cplusplus
+extern "C" {
+#endif
+char nm_test_var;
+void nm_test_func(void);
+void nm_test_func(void){}
+#ifdef __cplusplus
+}
+#endif
+int main(){nm_test_var='a';nm_test_func();return(0);}
+_LT_EOF
+
+  if AC_TRY_EVAL(ac_compile); then
+    # Now try to grab the symbols.
+    nlist=conftest.nm
+    if AC_TRY_EVAL(NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) && test -s "$nlist"; then
+      # Try sorting and uniquifying the output.
+      if sort "$nlist" | uniq > "$nlist"T; then
+	mv -f "$nlist"T "$nlist"
+      else
+	rm -f "$nlist"T
+      fi
+
+      # Make sure that we snagged all the symbols we need.
+      if $GREP ' nm_test_var$' "$nlist" >/dev/null; then
+	if $GREP ' nm_test_func$' "$nlist" >/dev/null; then
+	  cat <<_LT_EOF > conftest.$ac_ext
+/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */
+#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)
+/* DATA imports from DLLs on WIN32 con't be const, because runtime
+   relocations are performed -- see ld's documentation on pseudo-relocs.  */
+# define LT@&t@_DLSYM_CONST
+#elif defined(__osf__)
+/* This system does not cope well with relocations in const data.  */
+# define LT@&t@_DLSYM_CONST
+#else
+# define LT@&t@_DLSYM_CONST const
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+_LT_EOF
+	  # Now generate the symbol file.
+	  eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext'
+
+	  cat <<_LT_EOF >> conftest.$ac_ext
+
+/* The mapping between symbol names and symbols.  */
+LT@&t@_DLSYM_CONST struct {
+  const char *name;
+  void       *address;
+}
+lt__PROGRAM__LTX_preloaded_symbols[[]] =
+{
+  { "@PROGRAM@", (void *) 0 },
+_LT_EOF
+	  $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/  {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext
+	  cat <<\_LT_EOF >> conftest.$ac_ext
+  {0, (void *) 0}
+};
+
+/* This works around a problem in FreeBSD linker */
+#ifdef FREEBSD_WORKAROUND
+static const void *lt_preloaded_setup() {
+  return lt__PROGRAM__LTX_preloaded_symbols;
+}
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+_LT_EOF
+	  # Now try linking the two files.
+	  mv conftest.$ac_objext conftstm.$ac_objext
+	  lt_globsym_save_LIBS=$LIBS
+	  lt_globsym_save_CFLAGS=$CFLAGS
+	  LIBS="conftstm.$ac_objext"
+	  CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)"
+	  if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then
+	    pipe_works=yes
+	  fi
+	  LIBS=$lt_globsym_save_LIBS
+	  CFLAGS=$lt_globsym_save_CFLAGS
+	else
+	  echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD
+	fi
+      else
+	echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD
+      fi
+    else
+      echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD
+    fi
+  else
+    echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD
+    cat conftest.$ac_ext >&5
+  fi
+  rm -rf conftest* conftst*
+
+  # Do not use the global_symbol_pipe unless it works.
+  if test "$pipe_works" = yes; then
+    break
+  else
+    lt_cv_sys_global_symbol_pipe=
+  fi
+done
+])
+if test -z "$lt_cv_sys_global_symbol_pipe"; then
+  lt_cv_sys_global_symbol_to_cdecl=
+fi
+if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then
+  AC_MSG_RESULT(failed)
+else
+  AC_MSG_RESULT(ok)
+fi
+
+# Response file support.
+if test "$lt_cv_nm_interface" = "MS dumpbin"; then
+  nm_file_list_spec='@'
+elif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then
+  nm_file_list_spec='@'
+fi
+
+_LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1],
+    [Take the output of nm and produce a listing of raw symbols and C names])
+_LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1],
+    [Transform the output of nm in a proper C declaration])
+_LT_DECL([global_symbol_to_c_name_address],
+    [lt_cv_sys_global_symbol_to_c_name_address], [1],
+    [Transform the output of nm in a C name address pair])
+_LT_DECL([global_symbol_to_c_name_address_lib_prefix],
+    [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1],
+    [Transform the output of nm in a C name address pair when lib prefix is needed])
+_LT_DECL([], [nm_file_list_spec], [1],
+    [Specify filename containing input files for $NM])
+]) # _LT_CMD_GLOBAL_SYMBOLS
+
+
+# _LT_COMPILER_PIC([TAGNAME])
+# ---------------------------
+m4_defun([_LT_COMPILER_PIC],
+[m4_require([_LT_TAG_COMPILER])dnl
+_LT_TAGVAR(lt_prog_compiler_wl, $1)=
+_LT_TAGVAR(lt_prog_compiler_pic, $1)=
+_LT_TAGVAR(lt_prog_compiler_static, $1)=
+
+m4_if([$1], [CXX], [
+  # C++ specific cases for pic, static, wl, etc.
+  if test "$GXX" = yes; then
+    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+
+    case $host_os in
+    aix*)
+      # All AIX code is PIC.
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+        ;;
+      m68k)
+            # FIXME: we need at least 68020 code to build shared libraries, but
+            # adding the `-m68020' flag to GCC prevents building anything better,
+            # like `-m68040'.
+            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
+        ;;
+      esac
+      ;;
+
+    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+      # PIC is the default for these OSes.
+      ;;
+    mingw* | cygwin* | os2* | pw32* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      # Although the cygwin gcc ignores -fPIC, still need this for old-style
+      # (--disable-auto-import) libraries
+      m4_if([$1], [GCJ], [],
+	[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])
+      ;;
+    darwin* | rhapsody*)
+      # PIC is the default on this platform
+      # Common symbols not allowed in MH_DYLIB files
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'
+      ;;
+    *djgpp*)
+      # DJGPP does not support shared libraries at all
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)=
+      ;;
+    haiku*)
+      # PIC is the default for Haiku.
+      # The "-static" flag exists, but is broken.
+      _LT_TAGVAR(lt_prog_compiler_static, $1)=
+      ;;
+    interix[[3-9]]*)
+      # Interix 3.x gcc -fpic/-fPIC options generate broken code.
+      # Instead, we relocate shared libraries at runtime.
+      ;;
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic
+      fi
+      ;;
+    hpux*)
+      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit
+      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag
+      # sets the default TLS model and affects inlining.
+      case $host_cpu in
+      hppa*64*)
+	;;
+      *)
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	;;
+      esac
+      ;;
+    *qnx* | *nto*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'
+      ;;
+    *)
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+      ;;
+    esac
+  else
+    case $host_os in
+      aix[[4-9]]*)
+	# All AIX code is PIC.
+	if test "$host_cpu" = ia64; then
+	  # AIX 5 now supports IA64 processor
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	else
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'
+	fi
+	;;
+      chorus*)
+	case $cc_basename in
+	cxch68*)
+	  # Green Hills C++ Compiler
+	  # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a"
+	  ;;
+	esac
+	;;
+      mingw* | cygwin* | os2* | pw32* | cegcc*)
+	# This hack is so that the source file can tell whether it is being
+	# built for inclusion in a dll (and should export symbols for example).
+	m4_if([$1], [GCJ], [],
+	  [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])
+	;;
+      dgux*)
+	case $cc_basename in
+	  ec++*)
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	    ;;
+	  ghcx*)
+	    # Green Hills C++ Compiler
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      freebsd* | dragonfly*)
+	# FreeBSD uses GNU C++
+	;;
+      hpux9* | hpux10* | hpux11*)
+	case $cc_basename in
+	  CC*)
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'
+	    if test "$host_cpu" != ia64; then
+	      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+	    fi
+	    ;;
+	  aCC*)
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'
+	    case $host_cpu in
+	    hppa*64*|ia64*)
+	      # +Z the default
+	      ;;
+	    *)
+	      _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+	      ;;
+	    esac
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      interix*)
+	# This is c89, which is MS Visual C++ (no shared libs)
+	# Anyone wants to do a port?
+	;;
+      irix5* | irix6* | nonstopux*)
+	case $cc_basename in
+	  CC*)
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+	    # CC pic flag -KPIC is the default.
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      linux* | k*bsd*-gnu | kopensolaris*-gnu)
+	case $cc_basename in
+	  KCC*)
+	    # KAI C++ Compiler
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	    ;;
+	  ecpc* )
+	    # old Intel C++ for x86_64 which still supported -KPIC.
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+	    ;;
+	  icpc* )
+	    # Intel C++, used to be incompatible with GCC.
+	    # ICC 10 doesn't accept -KPIC any more.
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+	    ;;
+	  pgCC* | pgcpp*)
+	    # Portland Group C++ compiler
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	    ;;
+	  cxx*)
+	    # Compaq C++
+	    # Make sure the PIC flag is empty.  It appears that all Alpha
+	    # Linux and Compaq Tru64 Unix objects are PIC.
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)=
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+	    ;;
+	  xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*)
+	    # IBM XL 8.0, 9.0 on PPC and BlueGene
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'
+	    ;;
+	  *)
+	    case `$CC -V 2>&1 | sed 5q` in
+	    *Sun\ C*)
+	      # Sun C++ 5.9
+	      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+	      ;;
+	    esac
+	    ;;
+	esac
+	;;
+      lynxos*)
+	;;
+      m88k*)
+	;;
+      mvs*)
+	case $cc_basename in
+	  cxx*)
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      netbsd* | netbsdelf*-gnu)
+	;;
+      *qnx* | *nto*)
+        # QNX uses GNU C++, but need to define -shared option too, otherwise
+        # it will coredump.
+        _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'
+        ;;
+      osf3* | osf4* | osf5*)
+	case $cc_basename in
+	  KCC*)
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'
+	    ;;
+	  RCC*)
+	    # Rational C++ 2.4.1
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+	    ;;
+	  cxx*)
+	    # Digital/Compaq C++
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    # Make sure the PIC flag is empty.  It appears that all Alpha
+	    # Linux and Compaq Tru64 Unix objects are PIC.
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)=
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      psos*)
+	;;
+      solaris*)
+	case $cc_basename in
+	  CC* | sunCC*)
+	    # Sun C++ 4.2, 5.x and Centerline C++
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+	    ;;
+	  gcx*)
+	    # Green Hills C++ Compiler
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      sunos4*)
+	case $cc_basename in
+	  CC*)
+	    # Sun C++ 4.x
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	    ;;
+	  lcc*)
+	    # Lucid
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)
+	case $cc_basename in
+	  CC*)
+	    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	    _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	    ;;
+	esac
+	;;
+      tandem*)
+	case $cc_basename in
+	  NCC*)
+	    # NonStop-UX NCC 3.20
+	    _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      vxworks*)
+	;;
+      *)
+	_LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+	;;
+    esac
+  fi
+],
+[
+  if test "$GCC" = yes; then
+    _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+    _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+
+    case $host_os in
+      aix*)
+      # All AIX code is PIC.
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+        ;;
+      m68k)
+            # FIXME: we need at least 68020 code to build shared libraries, but
+            # adding the `-m68020' flag to GCC prevents building anything better,
+            # like `-m68040'.
+            _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
+        ;;
+      esac
+      ;;
+
+    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+      # PIC is the default for these OSes.
+      ;;
+
+    mingw* | cygwin* | pw32* | os2* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      # Although the cygwin gcc ignores -fPIC, still need this for old-style
+      # (--disable-auto-import) libraries
+      m4_if([$1], [GCJ], [],
+	[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])
+      ;;
+
+    darwin* | rhapsody*)
+      # PIC is the default on this platform
+      # Common symbols not allowed in MH_DYLIB files
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common'
+      ;;
+
+    haiku*)
+      # PIC is the default for Haiku.
+      # The "-static" flag exists, but is broken.
+      _LT_TAGVAR(lt_prog_compiler_static, $1)=
+      ;;
+
+    hpux*)
+      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit
+      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag
+      # sets the default TLS model and affects inlining.
+      case $host_cpu in
+      hppa*64*)
+	# +Z the default
+	;;
+      *)
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	;;
+      esac
+      ;;
+
+    interix[[3-9]]*)
+      # Interix 3.x gcc -fpic/-fPIC options generate broken code.
+      # Instead, we relocate shared libraries at runtime.
+      ;;
+
+    msdosdjgpp*)
+      # Just because we use GCC doesn't mean we suddenly get shared libraries
+      # on systems that don't support them.
+      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+      enable_shared=no
+      ;;
+
+    *nto* | *qnx*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic
+      fi
+      ;;
+
+    *)
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+      ;;
+    esac
+
+    case $cc_basename in
+    nvcc*) # Cuda Compiler Driver 2.2
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker '
+      if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then
+        _LT_TAGVAR(lt_prog_compiler_pic, $1)="-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)"
+      fi
+      ;;
+    esac
+  else
+    # PORTME Check for flag to pass linker flags through the system compiler.
+    case $host_os in
+    aix*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      else
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp'
+      fi
+      ;;
+
+    mingw* | cygwin* | pw32* | os2* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      m4_if([$1], [GCJ], [],
+	[_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT'])
+      ;;
+
+    hpux9* | hpux10* | hpux11*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
+      # not for PA HP-UX.
+      case $host_cpu in
+      hppa*64*|ia64*)
+	# +Z the default
+	;;
+      *)
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z'
+	;;
+      esac
+      # Is there a better lt_prog_compiler_static that works with the bundled CC?
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive'
+      ;;
+
+    irix5* | irix6* | nonstopux*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      # PIC (with -KPIC) is the default.
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+      ;;
+
+    linux* | k*bsd*-gnu | kopensolaris*-gnu)
+      case $cc_basename in
+      # old Intel for x86_64 which still supported -KPIC.
+      ecc*)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+        ;;
+      # icc used to be incompatible with GCC.
+      # ICC 10 doesn't accept -KPIC any more.
+      icc* | ifort*)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+        ;;
+      # Lahey Fortran 8.1.
+      lf95*)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='--static'
+	;;
+      nagfor*)
+	# NAG Fortran compiler
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	;;
+      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)
+        # Portland Group compilers (*not* the Pentium gcc compiler,
+	# which looks to be a dead project)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+        ;;
+      ccc*)
+        _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+        # All Alpha code is PIC.
+        _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+        ;;
+      xl* | bgxl* | bgf* | mpixl*)
+	# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink'
+	;;
+      *)
+	case `$CC -V 2>&1 | sed 5q` in
+	*Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [[1-7]].* | *Sun*Fortran*\ 8.[[0-3]]*)
+	  # Sun Fortran 8.3 passes all unrecognized flags to the linker
+	  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	  _LT_TAGVAR(lt_prog_compiler_wl, $1)=''
+	  ;;
+	*Sun\ F* | *Sun*Fortran*)
+	  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+	  ;;
+	*Sun\ C*)
+	  # Sun C 5.9
+	  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	  ;;
+        *Intel*\ [[CF]]*Compiler*)
+	  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
+	  ;;
+	*Portland\ Group*)
+	  _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+	  _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic'
+	  _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+	  ;;
+	esac
+	;;
+      esac
+      ;;
+
+    newsos6)
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      ;;
+
+    *nto* | *qnx*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared'
+      ;;
+
+    osf3* | osf4* | osf5*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      # All OSF/1 code is PIC.
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+      ;;
+
+    rdos*)
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared'
+      ;;
+
+    solaris*)
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      case $cc_basename in
+      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';;
+      *)
+	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';;
+      esac
+      ;;
+
+    sunos4*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld '
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      ;;
+
+    sysv4 | sysv4.2uw2* | sysv4.3*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec ;then
+	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic'
+	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      fi
+      ;;
+
+    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      ;;
+
+    unicos*)
+      _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
+      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+      ;;
+
+    uts4*)
+      _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic'
+      _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
+      ;;
+
+    *)
+      _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no
+      ;;
+    esac
+  fi
+])
+case $host_os in
+  # For platforms which do not support PIC, -DPIC is meaningless:
+  *djgpp*)
+    _LT_TAGVAR(lt_prog_compiler_pic, $1)=
+    ;;
+  *)
+    _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])"
+    ;;
+esac
+
+AC_CACHE_CHECK([for $compiler option to produce PIC],
+  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)],
+  [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)])
+_LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)
+
+#
+# Check to make sure the PIC flag actually works.
+#
+if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then
+  _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works],
+    [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)],
+    [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [],
+    [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in
+     "" | " "*) ;;
+     *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;;
+     esac],
+    [_LT_TAGVAR(lt_prog_compiler_pic, $1)=
+     _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no])
+fi
+_LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1],
+	[Additional compiler flags for building library objects])
+
+_LT_TAGDECL([wl], [lt_prog_compiler_wl], [1],
+	[How to pass a linker flag through the compiler])
+#
+# Check to make sure the static flag actually works.
+#
+wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\"
+_LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works],
+  _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1),
+  $lt_tmp_static_flag,
+  [],
+  [_LT_TAGVAR(lt_prog_compiler_static, $1)=])
+_LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1],
+	[Compiler flag to prevent dynamic linking])
+])# _LT_COMPILER_PIC
+
+
+# _LT_LINKER_SHLIBS([TAGNAME])
+# ----------------------------
+# See if the linker supports building shared libraries.
+m4_defun([_LT_LINKER_SHLIBS],
+[AC_REQUIRE([LT_PATH_LD])dnl
+AC_REQUIRE([LT_PATH_NM])dnl
+m4_require([_LT_PATH_MANIFEST_TOOL])dnl
+m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_DECL_EGREP])dnl
+m4_require([_LT_DECL_SED])dnl
+m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl
+m4_require([_LT_TAG_COMPILER])dnl
+AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])
+m4_if([$1], [CXX], [
+  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']
+  case $host_os in
+  aix[[4-9]]*)
+    # If we're using GNU nm, then we don't want the "-C" option.
+    # -C means demangle to AIX nm, but means don't demangle with GNU nm
+    # Also, AIX nm treats weak defined symbols like other global defined
+    # symbols, whereas GNU nm marks them as "W".
+    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then
+      _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+    else
+      _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+    fi
+    ;;
+  pw32*)
+    _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds"
+    ;;
+  cygwin* | mingw* | cegcc*)
+    case $cc_basename in
+    cl*)
+      _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'
+      ;;
+    *)
+      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols'
+      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']
+      ;;
+    esac
+    ;;
+  linux* | k*bsd*-gnu | gnu*)
+    _LT_TAGVAR(link_all_deplibs, $1)=no
+    ;;
+  *)
+    _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+    ;;
+  esac
+], [
+  runpath_var=
+  _LT_TAGVAR(allow_undefined_flag, $1)=
+  _LT_TAGVAR(always_export_symbols, $1)=no
+  _LT_TAGVAR(archive_cmds, $1)=
+  _LT_TAGVAR(archive_expsym_cmds, $1)=
+  _LT_TAGVAR(compiler_needs_object, $1)=no
+  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+  _LT_TAGVAR(export_dynamic_flag_spec, $1)=
+  _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+  _LT_TAGVAR(hardcode_automatic, $1)=no
+  _LT_TAGVAR(hardcode_direct, $1)=no
+  _LT_TAGVAR(hardcode_direct_absolute, $1)=no
+  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=
+  _LT_TAGVAR(hardcode_libdir_separator, $1)=
+  _LT_TAGVAR(hardcode_minus_L, $1)=no
+  _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+  _LT_TAGVAR(inherit_rpath, $1)=no
+  _LT_TAGVAR(link_all_deplibs, $1)=unknown
+  _LT_TAGVAR(module_cmds, $1)=
+  _LT_TAGVAR(module_expsym_cmds, $1)=
+  _LT_TAGVAR(old_archive_from_new_cmds, $1)=
+  _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)=
+  _LT_TAGVAR(thread_safe_flag_spec, $1)=
+  _LT_TAGVAR(whole_archive_flag_spec, $1)=
+  # include_expsyms should be a list of space-separated symbols to be *always*
+  # included in the symbol list
+  _LT_TAGVAR(include_expsyms, $1)=
+  # exclude_expsyms can be an extended regexp of symbols to exclude
+  # it will be wrapped by ` (' and `)$', so one must not match beginning or
+  # end of line.  Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',
+  # as well as any symbol that contains `d'.
+  _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*']
+  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out
+  # platforms (ab)use it in PIC code, but their linkers get confused if
+  # the symbol is explicitly referenced.  Since portable code cannot
+  # rely on this symbol name, it's probably fine to never include it in
+  # preloaded symbol tables.
+  # Exclude shared library initialization/finalization symbols.
+dnl Note also adjust exclude_expsyms for C++ above.
+  extract_expsyms_cmds=
+
+  case $host_os in
+  cygwin* | mingw* | pw32* | cegcc*)
+    # FIXME: the MSVC++ port hasn't been tested in a loooong time
+    # When not using gcc, we currently assume that we are using
+    # Microsoft Visual C++.
+    if test "$GCC" != yes; then
+      with_gnu_ld=no
+    fi
+    ;;
+  interix*)
+    # we just hope/assume this is gcc and not c89 (= MSVC++)
+    with_gnu_ld=yes
+    ;;
+  openbsd*)
+    with_gnu_ld=no
+    ;;
+  linux* | k*bsd*-gnu | gnu*)
+    _LT_TAGVAR(link_all_deplibs, $1)=no
+    ;;
+  esac
+
+  _LT_TAGVAR(ld_shlibs, $1)=yes
+
+  # On some targets, GNU ld is compatible enough with the native linker
+  # that we're better off using the native interface for both.
+  lt_use_gnu_ld_interface=no
+  if test "$with_gnu_ld" = yes; then
+    case $host_os in
+      aix*)
+	# The AIX port of GNU ld has always aspired to compatibility
+	# with the native linker.  However, as the warning in the GNU ld
+	# block says, versions before 2.19.5* couldn't really create working
+	# shared libraries, regardless of the interface used.
+	case `$LD -v 2>&1` in
+	  *\ \(GNU\ Binutils\)\ 2.19.5*) ;;
+	  *\ \(GNU\ Binutils\)\ 2.[[2-9]]*) ;;
+	  *\ \(GNU\ Binutils\)\ [[3-9]]*) ;;
+	  *)
+	    lt_use_gnu_ld_interface=yes
+	    ;;
+	esac
+	;;
+      *)
+	lt_use_gnu_ld_interface=yes
+	;;
+    esac
+  fi
+
+  if test "$lt_use_gnu_ld_interface" = yes; then
+    # If archive_cmds runs LD, not CC, wlarc should be empty
+    wlarc='${wl}'
+
+    # Set some defaults for GNU ld with shared library support. These
+    # are reset later if shared libraries are not supported. Putting them
+    # here allows them to be overridden if necessary.
+    runpath_var=LD_RUN_PATH
+    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+    # ancient GNU ld didn't support --whole-archive et. al.
+    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then
+      _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+    else
+      _LT_TAGVAR(whole_archive_flag_spec, $1)=
+    fi
+    supports_anon_versioning=no
+    case `$LD -v 2>&1` in
+      *GNU\ gold*) supports_anon_versioning=yes ;;
+      *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11
+      *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ...
+      *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...
+      *\ 2.11.*) ;; # other 2.11 versions
+      *) supports_anon_versioning=yes ;;
+    esac
+
+    # See if GNU ld supports shared libraries.
+    case $host_os in
+    aix[[3-9]]*)
+      # On AIX/PPC, the GNU linker is very broken
+      if test "$host_cpu" != ia64; then
+	_LT_TAGVAR(ld_shlibs, $1)=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: the GNU linker, at least up to release 2.19, is reported
+*** to be unable to reliably create shared libraries on AIX.
+*** Therefore, libtool is disabling shared libraries support.  If you
+*** really care for shared libraries, you may want to install binutils
+*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.
+*** You will then need to restart the configuration process.
+
+_LT_EOF
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+            _LT_TAGVAR(archive_expsym_cmds, $1)=''
+        ;;
+      m68k)
+            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+            _LT_TAGVAR(hardcode_minus_L, $1)=yes
+        ;;
+      esac
+      ;;
+
+    beos*)
+      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	_LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	# Joseph Beckenbach <jrb3@best.com> says some releases of gcc
+	# support --undefined.  This deserves some investigation.  FIXME
+	_LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+      else
+	_LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+
+    cygwin* | mingw* | pw32* | cegcc*)
+      # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
+      # as there is no search path for DLLs.
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols'
+      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+      _LT_TAGVAR(always_export_symbols, $1)=no
+      _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+      _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols'
+      _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname']
+
+      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then
+        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	# If the export-symbols file already is a .def file (1st line
+	# is EXPORTS), use it as is; otherwise, prepend...
+	_LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	  cp $export_symbols $output_objdir/$soname.def;
+	else
+	  echo EXPORTS > $output_objdir/$soname.def;
+	  cat $export_symbols >> $output_objdir/$soname.def;
+	fi~
+	$CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+      else
+	_LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+
+    haiku*)
+      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+      _LT_TAGVAR(link_all_deplibs, $1)=yes
+      ;;
+
+    interix[[3-9]]*)
+      _LT_TAGVAR(hardcode_direct, $1)=no
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.
+      # Instead, shared libraries are loaded at an image base (0x10000000 by
+      # default) and relocated if they conflict, which is a slow very memory
+      # consuming and fragmenting process.  To avoid this, we pick a random,
+      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link
+      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.
+      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+      _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+      ;;
+
+    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)
+      tmp_diet=no
+      if test "$host_os" = linux-dietlibc; then
+	case $cc_basename in
+	  diet\ *) tmp_diet=yes;;	# linux-dietlibc with static linking (!diet-dyn)
+	esac
+      fi
+      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \
+	 && test "$tmp_diet" = no
+      then
+	tmp_addflag=' $pic_flag'
+	tmp_sharedflag='-shared'
+	case $cc_basename,$host_cpu in
+        pgcc*)				# Portland Group C compiler
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  tmp_addflag=' $pic_flag'
+	  ;;
+	pgf77* | pgf90* | pgf95* | pgfortran*)
+					# Portland Group f77 and f90 compilers
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  tmp_addflag=' $pic_flag -Mnomain' ;;
+	ecc*,ia64* | icc*,ia64*)	# Intel C compiler on ia64
+	  tmp_addflag=' -i_dynamic' ;;
+	efc*,ia64* | ifort*,ia64*)	# Intel Fortran compiler on ia64
+	  tmp_addflag=' -i_dynamic -nofor_main' ;;
+	ifc* | ifort*)			# Intel Fortran compiler
+	  tmp_addflag=' -nofor_main' ;;
+	lf95*)				# Lahey Fortran 8.1
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)=
+	  tmp_sharedflag='--shared' ;;
+	xl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below)
+	  tmp_sharedflag='-qmkshrobj'
+	  tmp_addflag= ;;
+	nvcc*)	# Cuda Compiler Driver 2.2
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  _LT_TAGVAR(compiler_needs_object, $1)=yes
+	  ;;
+	esac
+	case `$CC -V 2>&1 | sed 5q` in
+	*Sun\ C*)			# Sun C 5.9
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  _LT_TAGVAR(compiler_needs_object, $1)=yes
+	  tmp_sharedflag='-G' ;;
+	*Sun\ F*)			# Sun Fortran 8.3
+	  tmp_sharedflag='-G' ;;
+	esac
+	_LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+
+        if test "x$supports_anon_versioning" = xyes; then
+          _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~
+	    cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+	    echo "local: *; };" >> $output_objdir/$libname.ver~
+	    $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'
+        fi
+
+	case $cc_basename in
+	xlf* | bgf* | bgxlf* | mpixlf*)
+	  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive'
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'
+	  if test "x$supports_anon_versioning" = xyes; then
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~
+	      cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+	      echo "local: *; };" >> $output_objdir/$libname.ver~
+	      $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'
+	  fi
+	  ;;
+	esac
+      else
+        _LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+
+    netbsd* | netbsdelf*-gnu)
+      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'
+	wlarc=
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      fi
+      ;;
+
+    solaris*)
+      if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then
+	_LT_TAGVAR(ld_shlibs, $1)=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: The releases 2.8.* of the GNU linker cannot reliably
+*** create shared libraries on Solaris systems.  Therefore, libtool
+*** is disabling shared libraries support.  We urge you to upgrade GNU
+*** binutils to release 2.9.1 or newer.  Another option is to modify
+*** your PATH or compiler configuration so that the native linker is
+*** used, and then restart.
+
+_LT_EOF
+      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      else
+	_LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+
+    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)
+      case `$LD -v 2>&1` in
+        *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*)
+	_LT_TAGVAR(ld_shlibs, $1)=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not
+*** reliably create shared libraries on SCO systems.  Therefore, libtool
+*** is disabling shared libraries support.  We urge you to upgrade GNU
+*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify
+*** your PATH or compiler configuration so that the native linker is
+*** used, and then restart.
+
+_LT_EOF
+	;;
+	*)
+	  # For security reasons, it is highly recommended that you always
+	  # use absolute paths for naming shared libraries, and exclude the
+	  # DT_RUNPATH tag from executables and libraries.  But doing so
+	  # requires that you compile everything twice, which is a pain.
+	  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+	  else
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	  fi
+	;;
+      esac
+      ;;
+
+    sunos4*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+      wlarc=
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    *)
+      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      else
+	_LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+    esac
+
+    if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then
+      runpath_var=
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)=
+      _LT_TAGVAR(whole_archive_flag_spec, $1)=
+    fi
+  else
+    # PORTME fill in a description of your system's linker (not GNU ld)
+    case $host_os in
+    aix3*)
+      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+      _LT_TAGVAR(always_export_symbols, $1)=yes
+      _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'
+      # Note: this linker hardcodes the directories in LIBPATH if there
+      # are no directories specified by -L.
+      _LT_TAGVAR(hardcode_minus_L, $1)=yes
+      if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then
+	# Neither direct hardcoding nor static linking is supported with a
+	# broken collect2.
+	_LT_TAGVAR(hardcode_direct, $1)=unsupported
+      fi
+      ;;
+
+    aix[[4-9]]*)
+      if test "$host_cpu" = ia64; then
+	# On IA64, the linker does run time linking by default, so we don't
+	# have to do anything special.
+	aix_use_runtimelinking=no
+	exp_sym_flag='-Bexport'
+	no_entry_flag=""
+      else
+	# If we're using GNU nm, then we don't want the "-C" option.
+	# -C means demangle to AIX nm, but means don't demangle with GNU nm
+	# Also, AIX nm treats weak defined symbols like other global
+	# defined symbols, whereas GNU nm marks them as "W".
+	if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then
+	  _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+	else
+	  _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+	fi
+	aix_use_runtimelinking=no
+
+	# Test if we are trying to use run time linking or normal
+	# AIX style linking. If -brtl is somewhere in LDFLAGS, we
+	# need to do runtime linking.
+	case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)
+	  for ld_flag in $LDFLAGS; do
+	  if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then
+	    aix_use_runtimelinking=yes
+	    break
+	  fi
+	  done
+	  ;;
+	esac
+
+	exp_sym_flag='-bexport'
+	no_entry_flag='-bnoentry'
+      fi
+
+      # When large executables or shared objects are built, AIX ld can
+      # have problems creating the table of contents.  If linking a library
+      # or program results in "error TOC overflow" add -mminimal-toc to
+      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not
+      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+      _LT_TAGVAR(archive_cmds, $1)=''
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'
+      _LT_TAGVAR(link_all_deplibs, $1)=yes
+      _LT_TAGVAR(file_list_spec, $1)='${wl}-f,'
+
+      if test "$GCC" = yes; then
+	case $host_os in aix4.[[012]]|aix4.[[012]].*)
+	# We only want to do this on AIX 4.2 and lower, the check
+	# below for broken collect2 doesn't work under 4.3+
+	  collect2name=`${CC} -print-prog-name=collect2`
+	  if test -f "$collect2name" &&
+	   strings "$collect2name" | $GREP resolve_lib_name >/dev/null
+	  then
+	  # We have reworked collect2
+	  :
+	  else
+	  # We have old collect2
+	  _LT_TAGVAR(hardcode_direct, $1)=unsupported
+	  # It fails to find uninstalled libraries when the uninstalled
+	  # path is not listed in the libpath.  Setting hardcode_minus_L
+	  # to unsupported forces relinking
+	  _LT_TAGVAR(hardcode_minus_L, $1)=yes
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+	  _LT_TAGVAR(hardcode_libdir_separator, $1)=
+	  fi
+	  ;;
+	esac
+	shared_flag='-shared'
+	if test "$aix_use_runtimelinking" = yes; then
+	  shared_flag="$shared_flag "'${wl}-G'
+	fi
+	_LT_TAGVAR(link_all_deplibs, $1)=no
+      else
+	# not using gcc
+	if test "$host_cpu" = ia64; then
+	# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+	# chokes on -Wl,-G. The following line is correct:
+	  shared_flag='-G'
+	else
+	  if test "$aix_use_runtimelinking" = yes; then
+	    shared_flag='${wl}-G'
+	  else
+	    shared_flag='${wl}-bM:SRE'
+	  fi
+	fi
+      fi
+
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'
+      # It seems that -bexpall does not export symbols beginning with
+      # underscore (_), so it is better to generate a list of symbols to export.
+      _LT_TAGVAR(always_export_symbols, $1)=yes
+      if test "$aix_use_runtimelinking" = yes; then
+	# Warning - without using the other runtime loading flags (-brtl),
+	# -berok will link without error, but may produce a broken library.
+	_LT_TAGVAR(allow_undefined_flag, $1)='-berok'
+        # Determine the default libpath from the value encoded in an
+        # empty executable.
+        _LT_SYS_MODULE_PATH_AIX([$1])
+        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+      else
+	if test "$host_cpu" = ia64; then
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'
+	  _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs"
+	  _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols"
+	else
+	 # Determine the default libpath from the value encoded in an
+	 # empty executable.
+	 _LT_SYS_MODULE_PATH_AIX([$1])
+	 _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+	  # Warning - without using the other run time loading flags,
+	  # -berok will link without error, but may produce a broken library.
+	  _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'
+	  _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'
+	  if test "$with_gnu_ld" = yes; then
+	    # We only use this code for GNU lds that support --whole-archive.
+	    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	  else
+	    # Exported symbols can be pulled into shared objects from archives
+	    _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'
+	  fi
+	  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes
+	  # This is similar to how AIX traditionally builds its shared libraries.
+	  _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+	fi
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+            _LT_TAGVAR(archive_expsym_cmds, $1)=''
+        ;;
+      m68k)
+            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+            _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+            _LT_TAGVAR(hardcode_minus_L, $1)=yes
+        ;;
+      esac
+      ;;
+
+    bsdi[[45]]*)
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic
+      ;;
+
+    cygwin* | mingw* | pw32* | cegcc*)
+      # When not using gcc, we currently assume that we are using
+      # Microsoft Visual C++.
+      # hardcode_libdir_flag_spec is actually meaningless, as there is
+      # no search path for DLLs.
+      case $cc_basename in
+      cl*)
+	# Native MSVC
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '
+	_LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	_LT_TAGVAR(always_export_symbols, $1)=yes
+	_LT_TAGVAR(file_list_spec, $1)='@'
+	# Tell ltmain to make .lib files, not .a files.
+	libext=lib
+	# Tell ltmain to make .dll files, not .so files.
+	shrext_cmds=".dll"
+	# FIXME: Setting linknames here is a bad hack.
+	_LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='
+	_LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	    sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp;
+	  else
+	    sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;
+	  fi~
+	  $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~
+	  linknames='
+	# The linker will not automatically build a static lib if we build a DLL.
+	# _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'
+	_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+	_LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'
+	_LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1,DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols'
+	# Don't use ranlib
+	_LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'
+	_LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~
+	  lt_tool_outputfile="@TOOL_OUTPUT@"~
+	  case $lt_outputfile in
+	    *.exe|*.EXE) ;;
+	    *)
+	      lt_outputfile="$lt_outputfile.exe"
+	      lt_tool_outputfile="$lt_tool_outputfile.exe"
+	      ;;
+	  esac~
+	  if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then
+	    $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1;
+	    $RM "$lt_outputfile.manifest";
+	  fi'
+	;;
+      *)
+	# Assume MSVC wrapper
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '
+	_LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	# Tell ltmain to make .lib files, not .a files.
+	libext=lib
+	# Tell ltmain to make .dll files, not .so files.
+	shrext_cmds=".dll"
+	# FIXME: Setting linknames here is a bad hack.
+	_LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames='
+	# The linker will automatically build a .lib file if we build a DLL.
+	_LT_TAGVAR(old_archive_from_new_cmds, $1)='true'
+	# FIXME: Should let the user specify the lib program.
+	_LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs'
+	_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+	;;
+      esac
+      ;;
+
+    darwin* | rhapsody*)
+      _LT_DARWIN_LINKER_FEATURES($1)
+      ;;
+
+    dgux*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor
+    # support.  Future versions do this automatically, but an explicit c++rt0.o
+    # does not break anything, and helps significantly (at the cost of a little
+    # extra space).
+    freebsd2.2*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    # Unfortunately, older versions of FreeBSD 2 do not have this feature.
+    freebsd2.*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_minus_L, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.
+    freebsd* | dragonfly*)
+      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    hpux9*)
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+      fi
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+
+      # hardcode_minus_L: Not really in the search PATH,
+      # but as the default location of the library.
+      _LT_TAGVAR(hardcode_minus_L, $1)=yes
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+      ;;
+
+    hpux10*)
+      if test "$GCC" = yes && test "$with_gnu_ld" = no; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'
+      fi
+      if test "$with_gnu_ld" = no; then
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+	_LT_TAGVAR(hardcode_libdir_separator, $1)=:
+	_LT_TAGVAR(hardcode_direct, $1)=yes
+	_LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+	# hardcode_minus_L: Not really in the search PATH,
+	# but as the default location of the library.
+	_LT_TAGVAR(hardcode_minus_L, $1)=yes
+      fi
+      ;;
+
+    hpux11*)
+      if test "$GCC" = yes && test "$with_gnu_ld" = no; then
+	case $host_cpu in
+	hppa*64*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	ia64*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	esac
+      else
+	case $host_cpu in
+	hppa*64*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	ia64*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+	m4_if($1, [], [
+	  # Older versions of the 11.00 compiler do not understand -b yet
+	  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)
+	  _LT_LINKER_OPTION([if $CC understands -b],
+	    _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b],
+	    [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'],
+	    [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])],
+	  [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'])
+	  ;;
+	esac
+      fi
+      if test "$with_gnu_ld" = no; then
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+	_LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+	case $host_cpu in
+	hppa*64*|ia64*)
+	  _LT_TAGVAR(hardcode_direct, $1)=no
+	  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	  ;;
+	*)
+	  _LT_TAGVAR(hardcode_direct, $1)=yes
+	  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+	  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+
+	  # hardcode_minus_L: Not really in the search PATH,
+	  # but as the default location of the library.
+	  _LT_TAGVAR(hardcode_minus_L, $1)=yes
+	  ;;
+	esac
+      fi
+      ;;
+
+    irix5* | irix6* | nonstopux*)
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	# Try to use the -exported_symbol ld option, if it does not
+	# work, assume that -exports_file does not work either and
+	# implicitly export all symbols.
+	# This should be the same for all languages, so no per-tag cache variable.
+	AC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol],
+	  [lt_cv_irix_exported_symbol],
+	  [save_LDFLAGS="$LDFLAGS"
+	   LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null"
+	   AC_LINK_IFELSE(
+	     [AC_LANG_SOURCE(
+	        [AC_LANG_CASE([C], [[int foo (void) { return 0; }]],
+			      [C++], [[int foo (void) { return 0; }]],
+			      [Fortran 77], [[
+      subroutine foo
+      end]],
+			      [Fortran], [[
+      subroutine foo
+      end]])])],
+	      [lt_cv_irix_exported_symbol=yes],
+	      [lt_cv_irix_exported_symbol=no])
+           LDFLAGS="$save_LDFLAGS"])
+	if test "$lt_cv_irix_exported_symbol" = yes; then
+          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib'
+	fi
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib'
+      fi
+      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+      _LT_TAGVAR(inherit_rpath, $1)=yes
+      _LT_TAGVAR(link_all_deplibs, $1)=yes
+      ;;
+
+    netbsd* | netbsdelf*-gnu)
+      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	_LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF
+      fi
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    newsos6)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    *nto* | *qnx*)
+      ;;
+
+    openbsd*)
+      if test -f /usr/libexec/ld.so; then
+	_LT_TAGVAR(hardcode_direct, $1)=yes
+	_LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	_LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+	if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols'
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+	else
+	  case $host_os in
+	   openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*)
+	     _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+	     _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+	     ;;
+	   *)
+	     _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+	     _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	     ;;
+	  esac
+	fi
+      else
+	_LT_TAGVAR(ld_shlibs, $1)=no
+      fi
+      ;;
+
+    os2*)
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+      _LT_TAGVAR(hardcode_minus_L, $1)=yes
+      _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+      _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'
+      _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'
+      ;;
+
+    osf3*)
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+      else
+	_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+      fi
+      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+      ;;
+
+    osf4* | osf5*)	# as osf3* with the addition of -msym flag
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+      else
+	_LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~
+	$CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp'
+
+	# Both c and cxx compiler support -rpath directly
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+      fi
+      _LT_TAGVAR(archive_cmds_need_lc, $1)='no'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+      ;;
+
+    solaris*)
+      _LT_TAGVAR(no_undefined_flag, $1)=' -z defs'
+      if test "$GCC" = yes; then
+	wlarc='${wl}'
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'
+      else
+	case `$CC -V 2>&1` in
+	*"Compilers 5.0"*)
+	  wlarc=''
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'
+	  ;;
+	*)
+	  wlarc='${wl}'
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags'
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'
+	  ;;
+	esac
+      fi
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      case $host_os in
+      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;
+      *)
+	# The compiler driver will combine and reorder linker options,
+	# but understands `-z linker_flag'.  GCC discards it without `$wl',
+	# but is careful enough not to reorder.
+	# Supported since Solaris 2.6 (maybe 2.5.1?)
+	if test "$GCC" = yes; then
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'
+	else
+	  _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'
+	fi
+	;;
+      esac
+      _LT_TAGVAR(link_all_deplibs, $1)=yes
+      ;;
+
+    sunos4*)
+      if test "x$host_vendor" = xsequent; then
+	# Use $CC to link under sequent, because it throws in some extra .o
+	# files that make .init and .fini sections work.
+	_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'
+      fi
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+      _LT_TAGVAR(hardcode_direct, $1)=yes
+      _LT_TAGVAR(hardcode_minus_L, $1)=yes
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    sysv4)
+      case $host_vendor in
+	sni)
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true???
+	;;
+	siemens)
+	  ## LD is ld it makes a PLAMLIB
+	  ## CC just makes a GrossModule.
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags'
+	  _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs'
+	  _LT_TAGVAR(hardcode_direct, $1)=no
+        ;;
+	motorola)
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie
+	;;
+      esac
+      runpath_var='LD_RUN_PATH'
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    sysv4.3*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	_LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	_LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	runpath_var=LD_RUN_PATH
+	hardcode_runpath_var=yes
+	_LT_TAGVAR(ld_shlibs, $1)=yes
+      fi
+      ;;
+
+    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)
+      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'
+      _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      runpath_var='LD_RUN_PATH'
+
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      fi
+      ;;
+
+    sysv5* | sco3.2v5* | sco5v6*)
+      # Note: We can NOT use -z defs as we might desire, because we do not
+      # link with -lc, and that would cause any symbols used from libc to
+      # always be unresolved, which means just about no library would
+      # ever link correctly.  If we're not using GNU ld we use -z text
+      # though, which does catch some bad symbols but isn't as heavy-handed
+      # as -z defs.
+      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'
+      _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs'
+      _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir'
+      _LT_TAGVAR(hardcode_libdir_separator, $1)=':'
+      _LT_TAGVAR(link_all_deplibs, $1)=yes
+      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'
+      runpath_var='LD_RUN_PATH'
+
+      if test "$GCC" = yes; then
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	_LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      fi
+      ;;
+
+    uts4*)
+      _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      ;;
+
+    *)
+      _LT_TAGVAR(ld_shlibs, $1)=no
+      ;;
+    esac
+
+    if test x$host_vendor = xsni; then
+      case $host in
+      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)
+	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym'
+	;;
+      esac
+    fi
+  fi
+])
+AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])
+test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no
+
+_LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld
+
+_LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl
+_LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl
+_LT_DECL([], [extract_expsyms_cmds], [2],
+    [The commands to extract the exported symbol list from a shared archive])
+
+#
+# Do we need to explicitly link libc?
+#
+case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in
+x|xyes)
+  # Assume -lc should be added
+  _LT_TAGVAR(archive_cmds_need_lc, $1)=yes
+
+  if test "$enable_shared" = yes && test "$GCC" = yes; then
+    case $_LT_TAGVAR(archive_cmds, $1) in
+    *'~'*)
+      # FIXME: we may have to deal with multi-command sequences.
+      ;;
+    '$CC '*)
+      # Test whether the compiler implicitly links with -lc since on some
+      # systems, -lgcc has to come before -lc. If gcc already passes -lc
+      # to ld, don't add -lc before -lgcc.
+      AC_CACHE_CHECK([whether -lc should be explicitly linked in],
+	[lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1),
+	[$RM conftest*
+	echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+	if AC_TRY_EVAL(ac_compile) 2>conftest.err; then
+	  soname=conftest
+	  lib=conftest
+	  libobjs=conftest.$ac_objext
+	  deplibs=
+	  wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1)
+	  pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1)
+	  compiler_flags=-v
+	  linker_flags=-v
+	  verstring=
+	  output_objdir=.
+	  libname=conftest
+	  lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1)
+	  _LT_TAGVAR(allow_undefined_flag, $1)=
+	  if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1)
+	  then
+	    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+	  else
+	    lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes
+	  fi
+	  _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag
+	else
+	  cat conftest.err 1>&5
+	fi
+	$RM conftest*
+	])
+      _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)
+      ;;
+    esac
+  fi
+  ;;
+esac
+
+_LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0],
+    [Whether or not to add -lc for building shared libraries])
+_LT_TAGDECL([allow_libtool_libs_with_static_runtimes],
+    [enable_shared_with_static_runtimes], [0],
+    [Whether or not to disallow shared libs when runtime libs are static])
+_LT_TAGDECL([], [export_dynamic_flag_spec], [1],
+    [Compiler flag to allow reflexive dlopens])
+_LT_TAGDECL([], [whole_archive_flag_spec], [1],
+    [Compiler flag to generate shared objects directly from archives])
+_LT_TAGDECL([], [compiler_needs_object], [1],
+    [Whether the compiler copes with passing no objects directly])
+_LT_TAGDECL([], [old_archive_from_new_cmds], [2],
+    [Create an old-style archive from a shared archive])
+_LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2],
+    [Create a temporary old-style archive to link instead of a shared archive])
+_LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive])
+_LT_TAGDECL([], [archive_expsym_cmds], [2])
+_LT_TAGDECL([], [module_cmds], [2],
+    [Commands used to build a loadable module if different from building
+    a shared archive.])
+_LT_TAGDECL([], [module_expsym_cmds], [2])
+_LT_TAGDECL([], [with_gnu_ld], [1],
+    [Whether we are building with GNU ld or not])
+_LT_TAGDECL([], [allow_undefined_flag], [1],
+    [Flag that allows shared libraries with undefined symbols to be built])
+_LT_TAGDECL([], [no_undefined_flag], [1],
+    [Flag that enforces no undefined symbols])
+_LT_TAGDECL([], [hardcode_libdir_flag_spec], [1],
+    [Flag to hardcode $libdir into a binary during linking.
+    This must work even if $libdir does not exist])
+_LT_TAGDECL([], [hardcode_libdir_separator], [1],
+    [Whether we need a single "-rpath" flag with a separated argument])
+_LT_TAGDECL([], [hardcode_direct], [0],
+    [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes
+    DIR into the resulting binary])
+_LT_TAGDECL([], [hardcode_direct_absolute], [0],
+    [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes
+    DIR into the resulting binary and the resulting library dependency is
+    "absolute", i.e impossible to change by setting ${shlibpath_var} if the
+    library is relocated])
+_LT_TAGDECL([], [hardcode_minus_L], [0],
+    [Set to "yes" if using the -LDIR flag during linking hardcodes DIR
+    into the resulting binary])
+_LT_TAGDECL([], [hardcode_shlibpath_var], [0],
+    [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR
+    into the resulting binary])
+_LT_TAGDECL([], [hardcode_automatic], [0],
+    [Set to "yes" if building a shared library automatically hardcodes DIR
+    into the library and all subsequent libraries and executables linked
+    against it])
+_LT_TAGDECL([], [inherit_rpath], [0],
+    [Set to yes if linker adds runtime paths of dependent libraries
+    to runtime path list])
+_LT_TAGDECL([], [link_all_deplibs], [0],
+    [Whether libtool must link a program against all its dependency libraries])
+_LT_TAGDECL([], [always_export_symbols], [0],
+    [Set to "yes" if exported symbols are required])
+_LT_TAGDECL([], [export_symbols_cmds], [2],
+    [The commands to list exported symbols])
+_LT_TAGDECL([], [exclude_expsyms], [1],
+    [Symbols that should not be listed in the preloaded symbols])
+_LT_TAGDECL([], [include_expsyms], [1],
+    [Symbols that must always be exported])
+_LT_TAGDECL([], [prelink_cmds], [2],
+    [Commands necessary for linking programs (against libraries) with templates])
+_LT_TAGDECL([], [postlink_cmds], [2],
+    [Commands necessary for finishing linking programs])
+_LT_TAGDECL([], [file_list_spec], [1],
+    [Specify filename containing input files])
+dnl FIXME: Not yet implemented
+dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1],
+dnl    [Compiler flag to generate thread safe objects])
+])# _LT_LINKER_SHLIBS
+
+
+# _LT_LANG_C_CONFIG([TAG])
+# ------------------------
+# Ensure that the configuration variables for a C compiler are suitably
+# defined.  These variables are subsequently used by _LT_CONFIG to write
+# the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_C_CONFIG],
+[m4_require([_LT_DECL_EGREP])dnl
+lt_save_CC="$CC"
+AC_LANG_PUSH(C)
+
+# Source file extension for C test sources.
+ac_ext=c
+
+# Object file extension for compiled C test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="int some_variable = 0;"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='int main(){return(0);}'
+
+_LT_TAG_COMPILER
+# Save the default compiler, since it gets overwritten when the other
+# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.
+compiler_DEFAULT=$CC
+
+# save warnings/boilerplate of simple test code
+_LT_COMPILER_BOILERPLATE
+_LT_LINKER_BOILERPLATE
+
+if test -n "$compiler"; then
+  _LT_COMPILER_NO_RTTI($1)
+  _LT_COMPILER_PIC($1)
+  _LT_COMPILER_C_O($1)
+  _LT_COMPILER_FILE_LOCKS($1)
+  _LT_LINKER_SHLIBS($1)
+  _LT_SYS_DYNAMIC_LINKER($1)
+  _LT_LINKER_HARDCODE_LIBPATH($1)
+  LT_SYS_DLOPEN_SELF
+  _LT_CMD_STRIPLIB
+
+  # Report which library types will actually be built
+  AC_MSG_CHECKING([if libtool supports shared libraries])
+  AC_MSG_RESULT([$can_build_shared])
+
+  AC_MSG_CHECKING([whether to build shared libraries])
+  test "$can_build_shared" = "no" && enable_shared=no
+
+  # On AIX, shared libraries and static libraries use the same namespace, and
+  # are all built from PIC.
+  case $host_os in
+  aix3*)
+    test "$enable_shared" = yes && enable_static=no
+    if test -n "$RANLIB"; then
+      archive_cmds="$archive_cmds~\$RANLIB \$lib"
+      postinstall_cmds='$RANLIB $lib'
+    fi
+    ;;
+
+  aix[[4-9]]*)
+    if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then
+      test "$enable_shared" = yes && enable_static=no
+    fi
+    ;;
+  esac
+  AC_MSG_RESULT([$enable_shared])
+
+  AC_MSG_CHECKING([whether to build static libraries])
+  # Make sure either enable_shared or enable_static is yes.
+  test "$enable_shared" = yes || enable_static=yes
+  AC_MSG_RESULT([$enable_static])
+
+  _LT_CONFIG($1)
+fi
+AC_LANG_POP
+CC="$lt_save_CC"
+])# _LT_LANG_C_CONFIG
+
+
+# _LT_LANG_CXX_CONFIG([TAG])
+# --------------------------
+# Ensure that the configuration variables for a C++ compiler are suitably
+# defined.  These variables are subsequently used by _LT_CONFIG to write
+# the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_CXX_CONFIG],
+[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+m4_require([_LT_DECL_EGREP])dnl
+m4_require([_LT_PATH_MANIFEST_TOOL])dnl
+if test -n "$CXX" && ( test "X$CXX" != "Xno" &&
+    ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) ||
+    (test "X$CXX" != "Xg++"))) ; then
+  AC_PROG_CXXCPP
+else
+  _lt_caught_CXX_error=yes
+fi
+
+AC_LANG_PUSH(C++)
+_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+_LT_TAGVAR(allow_undefined_flag, $1)=
+_LT_TAGVAR(always_export_symbols, $1)=no
+_LT_TAGVAR(archive_expsym_cmds, $1)=
+_LT_TAGVAR(compiler_needs_object, $1)=no
+_LT_TAGVAR(export_dynamic_flag_spec, $1)=
+_LT_TAGVAR(hardcode_direct, $1)=no
+_LT_TAGVAR(hardcode_direct_absolute, $1)=no
+_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=
+_LT_TAGVAR(hardcode_libdir_separator, $1)=
+_LT_TAGVAR(hardcode_minus_L, $1)=no
+_LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported
+_LT_TAGVAR(hardcode_automatic, $1)=no
+_LT_TAGVAR(inherit_rpath, $1)=no
+_LT_TAGVAR(module_cmds, $1)=
+_LT_TAGVAR(module_expsym_cmds, $1)=
+_LT_TAGVAR(link_all_deplibs, $1)=unknown
+_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_TAGVAR(reload_flag, $1)=$reload_flag
+_LT_TAGVAR(reload_cmds, $1)=$reload_cmds
+_LT_TAGVAR(no_undefined_flag, $1)=
+_LT_TAGVAR(whole_archive_flag_spec, $1)=
+_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+
+# Source file extension for C++ test sources.
+ac_ext=cpp
+
+# Object file extension for compiled C++ test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# No sense in running all these tests if we already determined that
+# the CXX compiler isn't working.  Some variables (like enable_shared)
+# are currently assumed to apply to all compilers on this platform,
+# and will be corrupted by setting them based on a non-working compiler.
+if test "$_lt_caught_CXX_error" != yes; then
+  # Code to be used in simple compile tests
+  lt_simple_compile_test_code="int some_variable = 0;"
+
+  # Code to be used in simple link tests
+  lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }'
+
+  # ltmain only uses $CC for tagged configurations so make sure $CC is set.
+  _LT_TAG_COMPILER
+
+  # save warnings/boilerplate of simple test code
+  _LT_COMPILER_BOILERPLATE
+  _LT_LINKER_BOILERPLATE
+
+  # Allow CC to be a program name with arguments.
+  lt_save_CC=$CC
+  lt_save_CFLAGS=$CFLAGS
+  lt_save_LD=$LD
+  lt_save_GCC=$GCC
+  GCC=$GXX
+  lt_save_with_gnu_ld=$with_gnu_ld
+  lt_save_path_LD=$lt_cv_path_LD
+  if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then
+    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx
+  else
+    $as_unset lt_cv_prog_gnu_ld
+  fi
+  if test -n "${lt_cv_path_LDCXX+set}"; then
+    lt_cv_path_LD=$lt_cv_path_LDCXX
+  else
+    $as_unset lt_cv_path_LD
+  fi
+  test -z "${LDCXX+set}" || LD=$LDCXX
+  CC=${CXX-"c++"}
+  CFLAGS=$CXXFLAGS
+  compiler=$CC
+  _LT_TAGVAR(compiler, $1)=$CC
+  _LT_CC_BASENAME([$compiler])
+
+  if test -n "$compiler"; then
+    # We don't want -fno-exception when compiling C++ code, so set the
+    # no_builtin_flag separately
+    if test "$GXX" = yes; then
+      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin'
+    else
+      _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=
+    fi
+
+    if test "$GXX" = yes; then
+      # Set up default GNU C++ configuration
+
+      LT_PATH_LD
+
+      # Check if GNU C++ uses GNU ld as the underlying linker, since the
+      # archiving commands below assume that GNU ld is being used.
+      if test "$with_gnu_ld" = yes; then
+        _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+        _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+
+        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+
+        # If archive_cmds runs LD, not CC, wlarc should be empty
+        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to
+        #     investigate it a little bit more. (MM)
+        wlarc='${wl}'
+
+        # ancient GNU ld didn't support --whole-archive et. al.
+        if eval "`$CC -print-prog-name=ld` --help 2>&1" |
+	  $GREP 'no-whole-archive' > /dev/null; then
+          _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+        else
+          _LT_TAGVAR(whole_archive_flag_spec, $1)=
+        fi
+      else
+        with_gnu_ld=no
+        wlarc=
+
+        # A generic and very simple default shared library creation
+        # command for GNU C++ for the case where it uses the native
+        # linker, instead of GNU ld.  If possible, this setting should
+        # overridden to take advantage of the native linker features on
+        # the platform it is being used on.
+        _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'
+      fi
+
+      # Commands to make compiler produce verbose output that lists
+      # what "hidden" libraries, object files and flags are used when
+      # linking a shared library.
+      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+
+    else
+      GXX=no
+      with_gnu_ld=no
+      wlarc=
+    fi
+
+    # PORTME: fill in a description of your system's C++ link characteristics
+    AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries])
+    _LT_TAGVAR(ld_shlibs, $1)=yes
+    case $host_os in
+      aix3*)
+        # FIXME: insert proper C++ library support
+        _LT_TAGVAR(ld_shlibs, $1)=no
+        ;;
+      aix[[4-9]]*)
+        if test "$host_cpu" = ia64; then
+          # On IA64, the linker does run time linking by default, so we don't
+          # have to do anything special.
+          aix_use_runtimelinking=no
+          exp_sym_flag='-Bexport'
+          no_entry_flag=""
+        else
+          aix_use_runtimelinking=no
+
+          # Test if we are trying to use run time linking or normal
+          # AIX style linking. If -brtl is somewhere in LDFLAGS, we
+          # need to do runtime linking.
+          case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*)
+	    for ld_flag in $LDFLAGS; do
+	      case $ld_flag in
+	      *-brtl*)
+	        aix_use_runtimelinking=yes
+	        break
+	        ;;
+	      esac
+	    done
+	    ;;
+          esac
+
+          exp_sym_flag='-bexport'
+          no_entry_flag='-bnoentry'
+        fi
+
+        # When large executables or shared objects are built, AIX ld can
+        # have problems creating the table of contents.  If linking a library
+        # or program results in "error TOC overflow" add -mminimal-toc to
+        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not
+        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+        _LT_TAGVAR(archive_cmds, $1)=''
+        _LT_TAGVAR(hardcode_direct, $1)=yes
+        _LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+        _LT_TAGVAR(hardcode_libdir_separator, $1)=':'
+        _LT_TAGVAR(link_all_deplibs, $1)=yes
+        _LT_TAGVAR(file_list_spec, $1)='${wl}-f,'
+
+        if test "$GXX" = yes; then
+          case $host_os in aix4.[[012]]|aix4.[[012]].*)
+          # We only want to do this on AIX 4.2 and lower, the check
+          # below for broken collect2 doesn't work under 4.3+
+	  collect2name=`${CC} -print-prog-name=collect2`
+	  if test -f "$collect2name" &&
+	     strings "$collect2name" | $GREP resolve_lib_name >/dev/null
+	  then
+	    # We have reworked collect2
+	    :
+	  else
+	    # We have old collect2
+	    _LT_TAGVAR(hardcode_direct, $1)=unsupported
+	    # It fails to find uninstalled libraries when the uninstalled
+	    # path is not listed in the libpath.  Setting hardcode_minus_L
+	    # to unsupported forces relinking
+	    _LT_TAGVAR(hardcode_minus_L, $1)=yes
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+	    _LT_TAGVAR(hardcode_libdir_separator, $1)=
+	  fi
+          esac
+          shared_flag='-shared'
+	  if test "$aix_use_runtimelinking" = yes; then
+	    shared_flag="$shared_flag "'${wl}-G'
+	  fi
+        else
+          # not using gcc
+          if test "$host_cpu" = ia64; then
+	  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+	  # chokes on -Wl,-G. The following line is correct:
+	  shared_flag='-G'
+          else
+	    if test "$aix_use_runtimelinking" = yes; then
+	      shared_flag='${wl}-G'
+	    else
+	      shared_flag='${wl}-bM:SRE'
+	    fi
+          fi
+        fi
+
+        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'
+        # It seems that -bexpall does not export symbols beginning with
+        # underscore (_), so it is better to generate a list of symbols to
+	# export.
+        _LT_TAGVAR(always_export_symbols, $1)=yes
+        if test "$aix_use_runtimelinking" = yes; then
+          # Warning - without using the other runtime loading flags (-brtl),
+          # -berok will link without error, but may produce a broken library.
+          _LT_TAGVAR(allow_undefined_flag, $1)='-berok'
+          # Determine the default libpath from the value encoded in an empty
+          # executable.
+          _LT_SYS_MODULE_PATH_AIX([$1])
+          _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+
+          _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+        else
+          if test "$host_cpu" = ia64; then
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib'
+	    _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs"
+	    _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols"
+          else
+	    # Determine the default libpath from the value encoded in an
+	    # empty executable.
+	    _LT_SYS_MODULE_PATH_AIX([$1])
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath"
+	    # Warning - without using the other run time loading flags,
+	    # -berok will link without error, but may produce a broken library.
+	    _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok'
+	    _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok'
+	    if test "$with_gnu_ld" = yes; then
+	      # We only use this code for GNU lds that support --whole-archive.
+	      _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	    else
+	      # Exported symbols can be pulled into shared objects from archives
+	      _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience'
+	    fi
+	    _LT_TAGVAR(archive_cmds_need_lc, $1)=yes
+	    # This is similar to how AIX traditionally builds its shared
+	    # libraries.
+	    _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+          fi
+        fi
+        ;;
+
+      beos*)
+	if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc
+	  # support --undefined.  This deserves some investigation.  FIXME
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	else
+	  _LT_TAGVAR(ld_shlibs, $1)=no
+	fi
+	;;
+
+      chorus*)
+        case $cc_basename in
+          *)
+	  # FIXME: insert proper C++ library support
+	  _LT_TAGVAR(ld_shlibs, $1)=no
+	  ;;
+        esac
+        ;;
+
+      cygwin* | mingw* | pw32* | cegcc*)
+	case $GXX,$cc_basename in
+	,cl* | no,cl*)
+	  # Native MSVC
+	  # hardcode_libdir_flag_spec is actually meaningless, as there is
+	  # no search path for DLLs.
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' '
+	  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	  _LT_TAGVAR(always_export_symbols, $1)=yes
+	  _LT_TAGVAR(file_list_spec, $1)='@'
+	  # Tell ltmain to make .lib files, not .a files.
+	  libext=lib
+	  # Tell ltmain to make .dll files, not .so files.
+	  shrext_cmds=".dll"
+	  # FIXME: Setting linknames here is a bad hack.
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	      $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp;
+	    else
+	      $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;
+	    fi~
+	    $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~
+	    linknames='
+	  # The linker will not automatically build a static lib if we build a DLL.
+	  # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true'
+	  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+	  # Don't use ranlib
+	  _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib'
+	  _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~
+	    lt_tool_outputfile="@TOOL_OUTPUT@"~
+	    case $lt_outputfile in
+	      *.exe|*.EXE) ;;
+	      *)
+		lt_outputfile="$lt_outputfile.exe"
+		lt_tool_outputfile="$lt_tool_outputfile.exe"
+		;;
+	    esac~
+	    func_to_tool_file "$lt_outputfile"~
+	    if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then
+	      $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1;
+	      $RM "$lt_outputfile.manifest";
+	    fi'
+	  ;;
+	*)
+	  # g++
+	  # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
+	  # as there is no search path for DLLs.
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
+	  _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols'
+	  _LT_TAGVAR(allow_undefined_flag, $1)=unsupported
+	  _LT_TAGVAR(always_export_symbols, $1)=no
+	  _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes
+
+	  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	    # If the export-symbols file already is a .def file (1st line
+	    # is EXPORTS), use it as is; otherwise, prepend...
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	      cp $export_symbols $output_objdir/$soname.def;
+	    else
+	      echo EXPORTS > $output_objdir/$soname.def;
+	      cat $export_symbols >> $output_objdir/$soname.def;
+	    fi~
+	    $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	  else
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	  fi
+	  ;;
+	esac
+	;;
+      darwin* | rhapsody*)
+        _LT_DARWIN_LINKER_FEATURES($1)
+	;;
+
+      dgux*)
+        case $cc_basename in
+          ec++*)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          ghcx*)
+	    # Green Hills C++ Compiler
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+        esac
+        ;;
+
+      freebsd2.*)
+        # C++ shared libraries reported to be fairly broken before
+	# switch to ELF
+        _LT_TAGVAR(ld_shlibs, $1)=no
+        ;;
+
+      freebsd-elf*)
+        _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+        ;;
+
+      freebsd* | dragonfly*)
+        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF
+        # conventions
+        _LT_TAGVAR(ld_shlibs, $1)=yes
+        ;;
+
+      gnu*)
+        ;;
+
+      haiku*)
+        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+        _LT_TAGVAR(link_all_deplibs, $1)=yes
+        ;;
+
+      hpux9*)
+        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+        _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+        _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+        _LT_TAGVAR(hardcode_direct, $1)=yes
+        _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,
+				             # but as the default
+				             # location of the library.
+
+        case $cc_basename in
+          CC*)
+            # FIXME: insert proper C++ library support
+            _LT_TAGVAR(ld_shlibs, $1)=no
+            ;;
+          aCC*)
+            _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+            # Commands to make compiler produce verbose output that lists
+            # what "hidden" libraries, object files and flags are used when
+            # linking a shared library.
+            #
+            # There doesn't appear to be a way to prevent this compiler from
+            # explicitly linking system object files so we need to strip them
+            # from the output so that they don't get included in the library
+            # dependencies.
+            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+            ;;
+          *)
+            if test "$GXX" = yes; then
+              _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+            else
+              # FIXME: insert proper C++ library support
+              _LT_TAGVAR(ld_shlibs, $1)=no
+            fi
+            ;;
+        esac
+        ;;
+
+      hpux10*|hpux11*)
+        if test $with_gnu_ld = no; then
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir'
+	  _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+          case $host_cpu in
+            hppa*64*|ia64*)
+              ;;
+            *)
+	      _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+              ;;
+          esac
+        fi
+        case $host_cpu in
+          hppa*64*|ia64*)
+            _LT_TAGVAR(hardcode_direct, $1)=no
+            _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+            ;;
+          *)
+            _LT_TAGVAR(hardcode_direct, $1)=yes
+            _LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+            _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH,
+					         # but as the default
+					         # location of the library.
+            ;;
+        esac
+
+        case $cc_basename in
+          CC*)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          aCC*)
+	    case $host_cpu in
+	      hppa*64*)
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	      ia64*)
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	      *)
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	    esac
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+	    ;;
+          *)
+	    if test "$GXX" = yes; then
+	      if test $with_gnu_ld = no; then
+	        case $host_cpu in
+	          hppa*64*)
+	            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	          ia64*)
+	            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	          *)
+	            _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	        esac
+	      fi
+	    else
+	      # FIXME: insert proper C++ library support
+	      _LT_TAGVAR(ld_shlibs, $1)=no
+	    fi
+	    ;;
+        esac
+        ;;
+
+      interix[[3-9]]*)
+	_LT_TAGVAR(hardcode_direct, $1)=no
+	_LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+	# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.
+	# Instead, shared libraries are loaded at an image base (0x10000000 by
+	# default) and relocated if they conflict, which is a slow very memory
+	# consuming and fragmenting process.  To avoid this, we pick a random,
+	# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link
+	# time.  Moving up from 0x10000000 also allows more sbrk(2) space.
+	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+	_LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+	;;
+      irix5* | irix6*)
+        case $cc_basename in
+          CC*)
+	    # SGI C++
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -ar", where "CC" is the IRIX C++ compiler.  This is
+	    # necessary to make sure instantiated templates are included
+	    # in the archive.
+	    _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs'
+	    ;;
+          *)
+	    if test "$GXX" = yes; then
+	      if test "$with_gnu_ld" = no; then
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	      else
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib'
+	      fi
+	    fi
+	    _LT_TAGVAR(link_all_deplibs, $1)=yes
+	    ;;
+        esac
+        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+        _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+        _LT_TAGVAR(inherit_rpath, $1)=yes
+        ;;
+
+      linux* | k*bsd*-gnu | kopensolaris*-gnu)
+        case $cc_basename in
+          KCC*)
+	    # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+	    # KCC will only create a shared library if the output file
+	    # ends with ".so" (or ".sl" for HP-UX), so rename the library
+	    # to its proper name (with version) after linking.
+	    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib'
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -Bstatic", where "CC" is the KAI C++ compiler.
+	    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs'
+	    ;;
+	  icpc* | ecpc* )
+	    # Intel C++
+	    with_gnu_ld=yes
+	    # version 8.0 and above of icpc choke on multiply defined symbols
+	    # if we add $predep_objects and $postdep_objects, however 7.1 and
+	    # earlier do not add the objects themselves.
+	    case `$CC -V 2>&1` in
+	      *"Version 7."*)
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+		_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+		;;
+	      *)  # Version 8.0 or newer
+	        tmp_idyn=
+	        case $host_cpu in
+		  ia64*) tmp_idyn=' -i_dynamic';;
+		esac
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+		_LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+		;;
+	    esac
+	    _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+	    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	    ;;
+          pgCC* | pgcpp*)
+            # Portland Group C++ compiler
+	    case `$CC -V` in
+	    *pgCC\ [[1-5]].* | *pgcpp\ [[1-5]].*)
+	      _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~
+		compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"'
+	      _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~
+		$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~
+		$RANLIB $oldlib'
+	      _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~
+		$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'
+	      _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~
+		$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'
+	      ;;
+	    *) # Version 6 and above use weak symbols
+	      _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'
+	      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'
+	      ;;
+	    esac
+
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir'
+	    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+	    _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+            ;;
+	  cxx*)
+	    # Compaq C++
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname  -o $lib ${wl}-retain-symbols-file $wl$export_symbols'
+
+	    runpath_var=LD_RUN_PATH
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+	    _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed'
+	    ;;
+	  xl* | mpixl* | bgxl*)
+	    # IBM XL 8.0 on PPC, with GNU ld
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+	    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic'
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    if test "x$supports_anon_versioning" = xyes; then
+	      _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~
+		cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+		echo "local: *; };" >> $output_objdir/$libname.ver~
+		$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'
+	    fi
+	    ;;
+	  *)
+	    case `$CC -V 2>&1 | sed 5q` in
+	    *Sun\ C*)
+	      # Sun C++ 5.9
+	      _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'
+	      _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	      _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols'
+	      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+	      _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	      _LT_TAGVAR(compiler_needs_object, $1)=yes
+
+	      # Not sure whether something based on
+	      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1
+	      # would be better.
+	      output_verbose_link_cmd='func_echo_all'
+
+	      # Archives containing C++ object files must be created using
+	      # "CC -xar", where "CC" is the Sun C++ compiler.  This is
+	      # necessary to make sure instantiated templates are included
+	      # in the archive.
+	      _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'
+	      ;;
+	    esac
+	    ;;
+	esac
+	;;
+
+      lynxos*)
+        # FIXME: insert proper C++ library support
+	_LT_TAGVAR(ld_shlibs, $1)=no
+	;;
+
+      m88k*)
+        # FIXME: insert proper C++ library support
+        _LT_TAGVAR(ld_shlibs, $1)=no
+	;;
+
+      mvs*)
+        case $cc_basename in
+          cxx*)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+	  *)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+	esac
+	;;
+
+      netbsd*)
+        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	  _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'
+	  wlarc=
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+	  _LT_TAGVAR(hardcode_direct, $1)=yes
+	  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	fi
+	# Workaround some broken pre-1.5 toolchains
+	output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"'
+	;;
+
+      *nto* | *qnx*)
+        _LT_TAGVAR(ld_shlibs, $1)=yes
+	;;
+
+      openbsd2*)
+        # C++ shared libraries are fairly broken
+	_LT_TAGVAR(ld_shlibs, $1)=no
+	;;
+
+      openbsd*)
+	if test -f /usr/libexec/ld.so; then
+	  _LT_TAGVAR(hardcode_direct, $1)=yes
+	  _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	  _LT_TAGVAR(hardcode_direct_absolute, $1)=yes
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'
+	  _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	  if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib'
+	    _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E'
+	    _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+	  fi
+	  output_verbose_link_cmd=func_echo_all
+	else
+	  _LT_TAGVAR(ld_shlibs, $1)=no
+	fi
+	;;
+
+      osf3* | osf4* | osf5*)
+        case $cc_basename in
+          KCC*)
+	    # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+	    # KCC will only create a shared library if the output file
+	    # ends with ".so" (or ".sl" for HP-UX), so rename the library
+	    # to its proper name (with version) after linking.
+	    _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir'
+	    _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+	    # Archives containing C++ object files must be created using
+	    # the KAI C++ compiler.
+	    case $host in
+	      osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;;
+	      *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;;
+	    esac
+	    ;;
+          RCC*)
+	    # Rational C++ 2.4.1
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          cxx*)
+	    case $host in
+	      osf3*)
+	        _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+		;;
+	      *)
+	        _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*'
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	        _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~
+	          echo "-hidden">> $lib.exp~
+	          $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp  `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~
+	          $RM $lib.exp'
+	        _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir'
+		;;
+	    esac
+
+	    _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+	    ;;
+	  *)
+	    if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+	      _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*'
+	      case $host in
+	        osf3*)
+	          _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+		  ;;
+	        *)
+	          _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+		  ;;
+	      esac
+
+	      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir'
+	      _LT_TAGVAR(hardcode_libdir_separator, $1)=:
+
+	      # Commands to make compiler produce verbose output that lists
+	      # what "hidden" libraries, object files and flags are used when
+	      # linking a shared library.
+	      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+
+	    else
+	      # FIXME: insert proper C++ library support
+	      _LT_TAGVAR(ld_shlibs, $1)=no
+	    fi
+	    ;;
+        esac
+        ;;
+
+      psos*)
+        # FIXME: insert proper C++ library support
+        _LT_TAGVAR(ld_shlibs, $1)=no
+        ;;
+
+      sunos4*)
+        case $cc_basename in
+          CC*)
+	    # Sun C++ 4.x
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          lcc*)
+	    # Lucid
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+        esac
+        ;;
+
+      solaris*)
+        case $cc_basename in
+          CC* | sunCC*)
+	    # Sun C++ 4.2, 5.x and Centerline C++
+            _LT_TAGVAR(archive_cmds_need_lc,$1)=yes
+	    _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs'
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag}  -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	      $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	    _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir'
+	    _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	    case $host_os in
+	      solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;
+	      *)
+		# The compiler driver will combine and reorder linker options,
+		# but understands `-z linker_flag'.
+	        # Supported since Solaris 2.6 (maybe 2.5.1?)
+		_LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract'
+	        ;;
+	    esac
+	    _LT_TAGVAR(link_all_deplibs, $1)=yes
+
+	    output_verbose_link_cmd='func_echo_all'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -xar", where "CC" is the Sun C++ compiler.  This is
+	    # necessary to make sure instantiated templates are included
+	    # in the archive.
+	    _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs'
+	    ;;
+          gcx*)
+	    # Green Hills C++ Compiler
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+
+	    # The C++ compiler must be used to create the archive.
+	    _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs'
+	    ;;
+          *)
+	    # GNU C++ compiler with Solaris linker
+	    if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+	      _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs'
+	      if $CC --version | $GREP -v '^2\.7' > /dev/null; then
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+	        _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+		  $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	        # Commands to make compiler produce verbose output that lists
+	        # what "hidden" libraries, object files and flags are used when
+	        # linking a shared library.
+	        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+	      else
+	        # g++ 2.7 appears to require `-G' NOT `-shared' on this
+	        # platform.
+	        _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+	        _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+		  $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	        # Commands to make compiler produce verbose output that lists
+	        # what "hidden" libraries, object files and flags are used when
+	        # linking a shared library.
+	        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+	      fi
+
+	      _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir'
+	      case $host_os in
+		solaris2.[[0-5]] | solaris2.[[0-5]].*) ;;
+		*)
+		  _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'
+		  ;;
+	      esac
+	    fi
+	    ;;
+        esac
+        ;;
+
+    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*)
+      _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'
+      _LT_TAGVAR(archive_cmds_need_lc, $1)=no
+      _LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+      runpath_var='LD_RUN_PATH'
+
+      case $cc_basename in
+        CC*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+	  _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+      esac
+      ;;
+
+      sysv5* | sco3.2v5* | sco5v6*)
+	# Note: We can NOT use -z defs as we might desire, because we do not
+	# link with -lc, and that would cause any symbols used from libc to
+	# always be unresolved, which means just about no library would
+	# ever link correctly.  If we're not using GNU ld we use -z text
+	# though, which does catch some bad symbols but isn't as heavy-handed
+	# as -z defs.
+	_LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text'
+	_LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs'
+	_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+	_LT_TAGVAR(hardcode_shlibpath_var, $1)=no
+	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir'
+	_LT_TAGVAR(hardcode_libdir_separator, $1)=':'
+	_LT_TAGVAR(link_all_deplibs, $1)=yes
+	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport'
+	runpath_var='LD_RUN_PATH'
+
+	case $cc_basename in
+          CC*)
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~
+	      '"$_LT_TAGVAR(old_archive_cmds, $1)"
+	    _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~
+	      '"$_LT_TAGVAR(reload_cmds, $1)"
+	    ;;
+	  *)
+	    _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    ;;
+	esac
+      ;;
+
+      tandem*)
+        case $cc_basename in
+          NCC*)
+	    # NonStop-UX NCC 3.20
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    _LT_TAGVAR(ld_shlibs, $1)=no
+	    ;;
+        esac
+        ;;
+
+      vxworks*)
+        # FIXME: insert proper C++ library support
+        _LT_TAGVAR(ld_shlibs, $1)=no
+        ;;
+
+      *)
+        # FIXME: insert proper C++ library support
+        _LT_TAGVAR(ld_shlibs, $1)=no
+        ;;
+    esac
+
+    AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)])
+    test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no
+
+    _LT_TAGVAR(GCC, $1)="$GXX"
+    _LT_TAGVAR(LD, $1)="$LD"
+
+    ## CAVEAT EMPTOR:
+    ## There is no encapsulation within the following macros, do not change
+    ## the running order or otherwise move them around unless you know exactly
+    ## what you are doing...
+    _LT_SYS_HIDDEN_LIBDEPS($1)
+    _LT_COMPILER_PIC($1)
+    _LT_COMPILER_C_O($1)
+    _LT_COMPILER_FILE_LOCKS($1)
+    _LT_LINKER_SHLIBS($1)
+    _LT_SYS_DYNAMIC_LINKER($1)
+    _LT_LINKER_HARDCODE_LIBPATH($1)
+
+    _LT_CONFIG($1)
+  fi # test -n "$compiler"
+
+  CC=$lt_save_CC
+  CFLAGS=$lt_save_CFLAGS
+  LDCXX=$LD
+  LD=$lt_save_LD
+  GCC=$lt_save_GCC
+  with_gnu_ld=$lt_save_with_gnu_ld
+  lt_cv_path_LDCXX=$lt_cv_path_LD
+  lt_cv_path_LD=$lt_save_path_LD
+  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld
+  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld
+fi # test "$_lt_caught_CXX_error" != yes
+
+AC_LANG_POP
+])# _LT_LANG_CXX_CONFIG
+
+
+# _LT_FUNC_STRIPNAME_CNF
+# ----------------------
+# func_stripname_cnf prefix suffix name
+# strip PREFIX and SUFFIX off of NAME.
+# PREFIX and SUFFIX must not contain globbing or regex special
+# characters, hashes, percent signs, but SUFFIX may contain a leading
+# dot (in which case that matches only a dot).
+#
+# This function is identical to the (non-XSI) version of func_stripname,
+# except this one can be used by m4 code that may be executed by configure,
+# rather than the libtool script.
+m4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl
+AC_REQUIRE([_LT_DECL_SED])
+AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])
+func_stripname_cnf ()
+{
+  case ${2} in
+  .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;;
+  *)  func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;;
+  esac
+} # func_stripname_cnf
+])# _LT_FUNC_STRIPNAME_CNF
+
+# _LT_SYS_HIDDEN_LIBDEPS([TAGNAME])
+# ---------------------------------
+# Figure out "hidden" library dependencies from verbose
+# compiler output when linking a shared library.
+# Parse the compiler output and extract the necessary
+# objects, libraries and library flags.
+m4_defun([_LT_SYS_HIDDEN_LIBDEPS],
+[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
+AC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl
+# Dependencies to place before and after the object being linked:
+_LT_TAGVAR(predep_objects, $1)=
+_LT_TAGVAR(postdep_objects, $1)=
+_LT_TAGVAR(predeps, $1)=
+_LT_TAGVAR(postdeps, $1)=
+_LT_TAGVAR(compiler_lib_search_path, $1)=
+
+dnl we can't use the lt_simple_compile_test_code here,
+dnl because it contains code intended for an executable,
+dnl not a library.  It's possible we should let each
+dnl tag define a new lt_????_link_test_code variable,
+dnl but it's only used here...
+m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF
+int a;
+void foo (void) { a = 0; }
+_LT_EOF
+], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF
+class Foo
+{
+public:
+  Foo (void) { a = 0; }
+private:
+  int a;
+};
+_LT_EOF
+], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF
+      subroutine foo
+      implicit none
+      integer*4 a
+      a=0
+      return
+      end
+_LT_EOF
+], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF
+      subroutine foo
+      implicit none
+      integer a
+      a=0
+      return
+      end
+_LT_EOF
+], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF
+public class foo {
+  private int a;
+  public void bar (void) {
+    a = 0;
+  }
+};
+_LT_EOF
+], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF
+package foo
+func foo() {
+}
+_LT_EOF
+])
+
+_lt_libdeps_save_CFLAGS=$CFLAGS
+case "$CC $CFLAGS " in #(
+*\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;;
+*\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;;
+*\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;;
+esac
+
+dnl Parse the compiler output and extract the necessary
+dnl objects, libraries and library flags.
+if AC_TRY_EVAL(ac_compile); then
+  # Parse the compiler output and extract the necessary
+  # objects, libraries and library flags.
+
+  # Sentinel used to keep track of whether or not we are before
+  # the conftest object file.
+  pre_test_object_deps_done=no
+
+  for p in `eval "$output_verbose_link_cmd"`; do
+    case ${prev}${p} in
+
+    -L* | -R* | -l*)
+       # Some compilers place space between "-{L,R}" and the path.
+       # Remove the space.
+       if test $p = "-L" ||
+          test $p = "-R"; then
+	 prev=$p
+	 continue
+       fi
+
+       # Expand the sysroot to ease extracting the directories later.
+       if test -z "$prev"; then
+         case $p in
+         -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;;
+         -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;;
+         -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;;
+         esac
+       fi
+       case $p in
+       =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;;
+       esac
+       if test "$pre_test_object_deps_done" = no; then
+	 case ${prev} in
+	 -L | -R)
+	   # Internal compiler library paths should come after those
+	   # provided the user.  The postdeps already come after the
+	   # user supplied libs so there is no need to process them.
+	   if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then
+	     _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}"
+	   else
+	     _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}"
+	   fi
+	   ;;
+	 # The "-l" case would never come before the object being
+	 # linked, so don't bother handling this case.
+	 esac
+       else
+	 if test -z "$_LT_TAGVAR(postdeps, $1)"; then
+	   _LT_TAGVAR(postdeps, $1)="${prev}${p}"
+	 else
+	   _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}"
+	 fi
+       fi
+       prev=
+       ;;
+
+    *.lto.$objext) ;; # Ignore GCC LTO objects
+    *.$objext)
+       # This assumes that the test object file only shows up
+       # once in the compiler output.
+       if test "$p" = "conftest.$objext"; then
+	 pre_test_object_deps_done=yes
+	 continue
+       fi
+
+       if test "$pre_test_object_deps_done" = no; then
+	 if test -z "$_LT_TAGVAR(predep_objects, $1)"; then
+	   _LT_TAGVAR(predep_objects, $1)="$p"
+	 else
+	   _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p"
+	 fi
+       else
+	 if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then
+	   _LT_TAGVAR(postdep_objects, $1)="$p"
+	 else
+	   _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p"
+	 fi
+       fi
+       ;;
+
+    *) ;; # Ignore the rest.
+
+    esac
+  done
+
+  # Clean up.
+  rm -f a.out a.exe
+else
+  echo "libtool.m4: error: problem compiling $1 test program"
+fi
+
+$RM -f confest.$objext
+CFLAGS=$_lt_libdeps_save_CFLAGS
+
+# PORTME: override above test on systems where it is broken
+m4_if([$1], [CXX],
+[case $host_os in
+interix[[3-9]]*)
+  # Interix 3.5 installs completely hosed .la files for C++, so rather than
+  # hack all around it, let's just trust "g++" to DTRT.
+  _LT_TAGVAR(predep_objects,$1)=
+  _LT_TAGVAR(postdep_objects,$1)=
+  _LT_TAGVAR(postdeps,$1)=
+  ;;
+
+linux*)
+  case `$CC -V 2>&1 | sed 5q` in
+  *Sun\ C*)
+    # Sun C++ 5.9
+
+    # The more standards-conforming stlport4 library is
+    # incompatible with the Cstd library. Avoid specifying
+    # it if it's in CXXFLAGS. Ignore libCrun as
+    # -library=stlport4 depends on it.
+    case " $CXX $CXXFLAGS " in
+    *" -library=stlport4 "*)
+      solaris_use_stlport4=yes
+      ;;
+    esac
+
+    if test "$solaris_use_stlport4" != yes; then
+      _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun'
+    fi
+    ;;
+  esac
+  ;;
+
+solaris*)
+  case $cc_basename in
+  CC* | sunCC*)
+    # The more standards-conforming stlport4 library is
+    # incompatible with the Cstd library. Avoid specifying
+    # it if it's in CXXFLAGS. Ignore libCrun as
+    # -library=stlport4 depends on it.
+    case " $CXX $CXXFLAGS " in
+    *" -library=stlport4 "*)
+      solaris_use_stlport4=yes
+      ;;
+    esac
+
+    # Adding this requires a known-good setup of shared libraries for
+    # Sun compiler versions before 5.6, else PIC objects from an old
+    # archive will be linked into the output, leading to subtle bugs.
+    if test "$solaris_use_stlport4" != yes; then
+      _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun'
+    fi
+    ;;
+  esac
+  ;;
+esac
+])
+
+case " $_LT_TAGVAR(postdeps, $1) " in
+*" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;;
+esac
+ _LT_TAGVAR(compiler_lib_search_dirs, $1)=
+if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then
+ _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'`
+fi
+_LT_TAGDECL([], [compiler_lib_search_dirs], [1],
+    [The directories searched by this compiler when creating a shared library])
+_LT_TAGDECL([], [predep_objects], [1],
+    [Dependencies to place before and after the objects being linked to
+    create a shared library])
+_LT_TAGDECL([], [postdep_objects], [1])
+_LT_TAGDECL([], [predeps], [1])
+_LT_TAGDECL([], [postdeps], [1])
+_LT_TAGDECL([], [compiler_lib_search_path], [1],
+    [The library search path used internally by the compiler when linking
+    a shared library])
+])# _LT_SYS_HIDDEN_LIBDEPS
+
+
+# _LT_LANG_F77_CONFIG([TAG])
+# --------------------------
+# Ensure that the configuration variables for a Fortran 77 compiler are
+# suitably defined.  These variables are subsequently used by _LT_CONFIG
+# to write the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_F77_CONFIG],
+[AC_LANG_PUSH(Fortran 77)
+if test -z "$F77" || test "X$F77" = "Xno"; then
+  _lt_disable_F77=yes
+fi
+
+_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+_LT_TAGVAR(allow_undefined_flag, $1)=
+_LT_TAGVAR(always_export_symbols, $1)=no
+_LT_TAGVAR(archive_expsym_cmds, $1)=
+_LT_TAGVAR(export_dynamic_flag_spec, $1)=
+_LT_TAGVAR(hardcode_direct, $1)=no
+_LT_TAGVAR(hardcode_direct_absolute, $1)=no
+_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=
+_LT_TAGVAR(hardcode_libdir_separator, $1)=
+_LT_TAGVAR(hardcode_minus_L, $1)=no
+_LT_TAGVAR(hardcode_automatic, $1)=no
+_LT_TAGVAR(inherit_rpath, $1)=no
+_LT_TAGVAR(module_cmds, $1)=
+_LT_TAGVAR(module_expsym_cmds, $1)=
+_LT_TAGVAR(link_all_deplibs, $1)=unknown
+_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_TAGVAR(reload_flag, $1)=$reload_flag
+_LT_TAGVAR(reload_cmds, $1)=$reload_cmds
+_LT_TAGVAR(no_undefined_flag, $1)=
+_LT_TAGVAR(whole_archive_flag_spec, $1)=
+_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+
+# Source file extension for f77 test sources.
+ac_ext=f
+
+# Object file extension for compiled f77 test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# No sense in running all these tests if we already determined that
+# the F77 compiler isn't working.  Some variables (like enable_shared)
+# are currently assumed to apply to all compilers on this platform,
+# and will be corrupted by setting them based on a non-working compiler.
+if test "$_lt_disable_F77" != yes; then
+  # Code to be used in simple compile tests
+  lt_simple_compile_test_code="\
+      subroutine t
+      return
+      end
+"
+
+  # Code to be used in simple link tests
+  lt_simple_link_test_code="\
+      program t
+      end
+"
+
+  # ltmain only uses $CC for tagged configurations so make sure $CC is set.
+  _LT_TAG_COMPILER
+
+  # save warnings/boilerplate of simple test code
+  _LT_COMPILER_BOILERPLATE
+  _LT_LINKER_BOILERPLATE
+
+  # Allow CC to be a program name with arguments.
+  lt_save_CC="$CC"
+  lt_save_GCC=$GCC
+  lt_save_CFLAGS=$CFLAGS
+  CC=${F77-"f77"}
+  CFLAGS=$FFLAGS
+  compiler=$CC
+  _LT_TAGVAR(compiler, $1)=$CC
+  _LT_CC_BASENAME([$compiler])
+  GCC=$G77
+  if test -n "$compiler"; then
+    AC_MSG_CHECKING([if libtool supports shared libraries])
+    AC_MSG_RESULT([$can_build_shared])
+
+    AC_MSG_CHECKING([whether to build shared libraries])
+    test "$can_build_shared" = "no" && enable_shared=no
+
+    # On AIX, shared libraries and static libraries use the same namespace, and
+    # are all built from PIC.
+    case $host_os in
+      aix3*)
+        test "$enable_shared" = yes && enable_static=no
+        if test -n "$RANLIB"; then
+          archive_cmds="$archive_cmds~\$RANLIB \$lib"
+          postinstall_cmds='$RANLIB $lib'
+        fi
+        ;;
+      aix[[4-9]]*)
+	if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then
+	  test "$enable_shared" = yes && enable_static=no
+	fi
+        ;;
+    esac
+    AC_MSG_RESULT([$enable_shared])
+
+    AC_MSG_CHECKING([whether to build static libraries])
+    # Make sure either enable_shared or enable_static is yes.
+    test "$enable_shared" = yes || enable_static=yes
+    AC_MSG_RESULT([$enable_static])
+
+    _LT_TAGVAR(GCC, $1)="$G77"
+    _LT_TAGVAR(LD, $1)="$LD"
+
+    ## CAVEAT EMPTOR:
+    ## There is no encapsulation within the following macros, do not change
+    ## the running order or otherwise move them around unless you know exactly
+    ## what you are doing...
+    _LT_COMPILER_PIC($1)
+    _LT_COMPILER_C_O($1)
+    _LT_COMPILER_FILE_LOCKS($1)
+    _LT_LINKER_SHLIBS($1)
+    _LT_SYS_DYNAMIC_LINKER($1)
+    _LT_LINKER_HARDCODE_LIBPATH($1)
+
+    _LT_CONFIG($1)
+  fi # test -n "$compiler"
+
+  GCC=$lt_save_GCC
+  CC="$lt_save_CC"
+  CFLAGS="$lt_save_CFLAGS"
+fi # test "$_lt_disable_F77" != yes
+
+AC_LANG_POP
+])# _LT_LANG_F77_CONFIG
+
+
+# _LT_LANG_FC_CONFIG([TAG])
+# -------------------------
+# Ensure that the configuration variables for a Fortran compiler are
+# suitably defined.  These variables are subsequently used by _LT_CONFIG
+# to write the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_FC_CONFIG],
+[AC_LANG_PUSH(Fortran)
+
+if test -z "$FC" || test "X$FC" = "Xno"; then
+  _lt_disable_FC=yes
+fi
+
+_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+_LT_TAGVAR(allow_undefined_flag, $1)=
+_LT_TAGVAR(always_export_symbols, $1)=no
+_LT_TAGVAR(archive_expsym_cmds, $1)=
+_LT_TAGVAR(export_dynamic_flag_spec, $1)=
+_LT_TAGVAR(hardcode_direct, $1)=no
+_LT_TAGVAR(hardcode_direct_absolute, $1)=no
+_LT_TAGVAR(hardcode_libdir_flag_spec, $1)=
+_LT_TAGVAR(hardcode_libdir_separator, $1)=
+_LT_TAGVAR(hardcode_minus_L, $1)=no
+_LT_TAGVAR(hardcode_automatic, $1)=no
+_LT_TAGVAR(inherit_rpath, $1)=no
+_LT_TAGVAR(module_cmds, $1)=
+_LT_TAGVAR(module_expsym_cmds, $1)=
+_LT_TAGVAR(link_all_deplibs, $1)=unknown
+_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_TAGVAR(reload_flag, $1)=$reload_flag
+_LT_TAGVAR(reload_cmds, $1)=$reload_cmds
+_LT_TAGVAR(no_undefined_flag, $1)=
+_LT_TAGVAR(whole_archive_flag_spec, $1)=
+_LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no
+
+# Source file extension for fc test sources.
+ac_ext=${ac_fc_srcext-f}
+
+# Object file extension for compiled fc test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# No sense in running all these tests if we already determined that
+# the FC compiler isn't working.  Some variables (like enable_shared)
+# are currently assumed to apply to all compilers on this platform,
+# and will be corrupted by setting them based on a non-working compiler.
+if test "$_lt_disable_FC" != yes; then
+  # Code to be used in simple compile tests
+  lt_simple_compile_test_code="\
+      subroutine t
+      return
+      end
+"
+
+  # Code to be used in simple link tests
+  lt_simple_link_test_code="\
+      program t
+      end
+"
+
+  # ltmain only uses $CC for tagged configurations so make sure $CC is set.
+  _LT_TAG_COMPILER
+
+  # save warnings/boilerplate of simple test code
+  _LT_COMPILER_BOILERPLATE
+  _LT_LINKER_BOILERPLATE
+
+  # Allow CC to be a program name with arguments.
+  lt_save_CC="$CC"
+  lt_save_GCC=$GCC
+  lt_save_CFLAGS=$CFLAGS
+  CC=${FC-"f95"}
+  CFLAGS=$FCFLAGS
+  compiler=$CC
+  GCC=$ac_cv_fc_compiler_gnu
+
+  _LT_TAGVAR(compiler, $1)=$CC
+  _LT_CC_BASENAME([$compiler])
+
+  if test -n "$compiler"; then
+    AC_MSG_CHECKING([if libtool supports shared libraries])
+    AC_MSG_RESULT([$can_build_shared])
+
+    AC_MSG_CHECKING([whether to build shared libraries])
+    test "$can_build_shared" = "no" && enable_shared=no
+
+    # On AIX, shared libraries and static libraries use the same namespace, and
+    # are all built from PIC.
+    case $host_os in
+      aix3*)
+        test "$enable_shared" = yes && enable_static=no
+        if test -n "$RANLIB"; then
+          archive_cmds="$archive_cmds~\$RANLIB \$lib"
+          postinstall_cmds='$RANLIB $lib'
+        fi
+        ;;
+      aix[[4-9]]*)
+	if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then
+	  test "$enable_shared" = yes && enable_static=no
+	fi
+        ;;
+    esac
+    AC_MSG_RESULT([$enable_shared])
+
+    AC_MSG_CHECKING([whether to build static libraries])
+    # Make sure either enable_shared or enable_static is yes.
+    test "$enable_shared" = yes || enable_static=yes
+    AC_MSG_RESULT([$enable_static])
+
+    _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu"
+    _LT_TAGVAR(LD, $1)="$LD"
+
+    ## CAVEAT EMPTOR:
+    ## There is no encapsulation within the following macros, do not change
+    ## the running order or otherwise move them around unless you know exactly
+    ## what you are doing...
+    _LT_SYS_HIDDEN_LIBDEPS($1)
+    _LT_COMPILER_PIC($1)
+    _LT_COMPILER_C_O($1)
+    _LT_COMPILER_FILE_LOCKS($1)
+    _LT_LINKER_SHLIBS($1)
+    _LT_SYS_DYNAMIC_LINKER($1)
+    _LT_LINKER_HARDCODE_LIBPATH($1)
+
+    _LT_CONFIG($1)
+  fi # test -n "$compiler"
+
+  GCC=$lt_save_GCC
+  CC=$lt_save_CC
+  CFLAGS=$lt_save_CFLAGS
+fi # test "$_lt_disable_FC" != yes
+
+AC_LANG_POP
+])# _LT_LANG_FC_CONFIG
+
+
+# _LT_LANG_GCJ_CONFIG([TAG])
+# --------------------------
+# Ensure that the configuration variables for the GNU Java Compiler compiler
+# are suitably defined.  These variables are subsequently used by _LT_CONFIG
+# to write the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_GCJ_CONFIG],
+[AC_REQUIRE([LT_PROG_GCJ])dnl
+AC_LANG_SAVE
+
+# Source file extension for Java test sources.
+ac_ext=java
+
+# Object file extension for compiled Java test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="class foo {}"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }'
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_TAG_COMPILER
+
+# save warnings/boilerplate of simple test code
+_LT_COMPILER_BOILERPLATE
+_LT_LINKER_BOILERPLATE
+
+# Allow CC to be a program name with arguments.
+lt_save_CC=$CC
+lt_save_CFLAGS=$CFLAGS
+lt_save_GCC=$GCC
+GCC=yes
+CC=${GCJ-"gcj"}
+CFLAGS=$GCJFLAGS
+compiler=$CC
+_LT_TAGVAR(compiler, $1)=$CC
+_LT_TAGVAR(LD, $1)="$LD"
+_LT_CC_BASENAME([$compiler])
+
+# GCJ did not exist at the time GCC didn't implicitly link libc in.
+_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+
+_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_TAGVAR(reload_flag, $1)=$reload_flag
+_LT_TAGVAR(reload_cmds, $1)=$reload_cmds
+
+if test -n "$compiler"; then
+  _LT_COMPILER_NO_RTTI($1)
+  _LT_COMPILER_PIC($1)
+  _LT_COMPILER_C_O($1)
+  _LT_COMPILER_FILE_LOCKS($1)
+  _LT_LINKER_SHLIBS($1)
+  _LT_LINKER_HARDCODE_LIBPATH($1)
+
+  _LT_CONFIG($1)
+fi
+
+AC_LANG_RESTORE
+
+GCC=$lt_save_GCC
+CC=$lt_save_CC
+CFLAGS=$lt_save_CFLAGS
+])# _LT_LANG_GCJ_CONFIG
+
+
+# _LT_LANG_GO_CONFIG([TAG])
+# --------------------------
+# Ensure that the configuration variables for the GNU Go compiler
+# are suitably defined.  These variables are subsequently used by _LT_CONFIG
+# to write the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_GO_CONFIG],
+[AC_REQUIRE([LT_PROG_GO])dnl
+AC_LANG_SAVE
+
+# Source file extension for Go test sources.
+ac_ext=go
+
+# Object file extension for compiled Go test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="package main; func main() { }"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='package main; func main() { }'
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_TAG_COMPILER
+
+# save warnings/boilerplate of simple test code
+_LT_COMPILER_BOILERPLATE
+_LT_LINKER_BOILERPLATE
+
+# Allow CC to be a program name with arguments.
+lt_save_CC=$CC
+lt_save_CFLAGS=$CFLAGS
+lt_save_GCC=$GCC
+GCC=yes
+CC=${GOC-"gccgo"}
+CFLAGS=$GOFLAGS
+compiler=$CC
+_LT_TAGVAR(compiler, $1)=$CC
+_LT_TAGVAR(LD, $1)="$LD"
+_LT_CC_BASENAME([$compiler])
+
+# Go did not exist at the time GCC didn't implicitly link libc in.
+_LT_TAGVAR(archive_cmds_need_lc, $1)=no
+
+_LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds
+_LT_TAGVAR(reload_flag, $1)=$reload_flag
+_LT_TAGVAR(reload_cmds, $1)=$reload_cmds
+
+if test -n "$compiler"; then
+  _LT_COMPILER_NO_RTTI($1)
+  _LT_COMPILER_PIC($1)
+  _LT_COMPILER_C_O($1)
+  _LT_COMPILER_FILE_LOCKS($1)
+  _LT_LINKER_SHLIBS($1)
+  _LT_LINKER_HARDCODE_LIBPATH($1)
+
+  _LT_CONFIG($1)
+fi
+
+AC_LANG_RESTORE
+
+GCC=$lt_save_GCC
+CC=$lt_save_CC
+CFLAGS=$lt_save_CFLAGS
+])# _LT_LANG_GO_CONFIG
+
+
+# _LT_LANG_RC_CONFIG([TAG])
+# -------------------------
+# Ensure that the configuration variables for the Windows resource compiler
+# are suitably defined.  These variables are subsequently used by _LT_CONFIG
+# to write the compiler configuration to `libtool'.
+m4_defun([_LT_LANG_RC_CONFIG],
+[AC_REQUIRE([LT_PROG_RC])dnl
+AC_LANG_SAVE
+
+# Source file extension for RC test sources.
+ac_ext=rc
+
+# Object file extension for compiled RC test sources.
+objext=o
+_LT_TAGVAR(objext, $1)=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }'
+
+# Code to be used in simple link tests
+lt_simple_link_test_code="$lt_simple_compile_test_code"
+
+# ltmain only uses $CC for tagged configurations so make sure $CC is set.
+_LT_TAG_COMPILER
+
+# save warnings/boilerplate of simple test code
+_LT_COMPILER_BOILERPLATE
+_LT_LINKER_BOILERPLATE
+
+# Allow CC to be a program name with arguments.
+lt_save_CC="$CC"
+lt_save_CFLAGS=$CFLAGS
+lt_save_GCC=$GCC
+GCC=
+CC=${RC-"windres"}
+CFLAGS=
+compiler=$CC
+_LT_TAGVAR(compiler, $1)=$CC
+_LT_CC_BASENAME([$compiler])
+_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes
+
+if test -n "$compiler"; then
+  :
+  _LT_CONFIG($1)
+fi
+
+GCC=$lt_save_GCC
+AC_LANG_RESTORE
+CC=$lt_save_CC
+CFLAGS=$lt_save_CFLAGS
+])# _LT_LANG_RC_CONFIG
+
+
+# LT_PROG_GCJ
+# -----------
+AC_DEFUN([LT_PROG_GCJ],
+[m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ],
+  [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ],
+    [AC_CHECK_TOOL(GCJ, gcj,)
+      test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2"
+      AC_SUBST(GCJFLAGS)])])[]dnl
+])
+
+# Old name:
+AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([LT_AC_PROG_GCJ], [])
+
+
+# LT_PROG_GO
+# ----------
+AC_DEFUN([LT_PROG_GO],
+[AC_CHECK_TOOL(GOC, gccgo,)
+])
+
+
+# LT_PROG_RC
+# ----------
+AC_DEFUN([LT_PROG_RC],
+[AC_CHECK_TOOL(RC, windres,)
+])
+
+# Old name:
+AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([LT_AC_PROG_RC], [])
+
+
+# _LT_DECL_EGREP
+# --------------
+# If we don't have a new enough Autoconf to choose the best grep
+# available, choose the one first in the user's PATH.
+m4_defun([_LT_DECL_EGREP],
+[AC_REQUIRE([AC_PROG_EGREP])dnl
+AC_REQUIRE([AC_PROG_FGREP])dnl
+test -z "$GREP" && GREP=grep
+_LT_DECL([], [GREP], [1], [A grep program that handles long lines])
+_LT_DECL([], [EGREP], [1], [An ERE matcher])
+_LT_DECL([], [FGREP], [1], [A literal string matcher])
+dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too
+AC_SUBST([GREP])
+])
+
+
+# _LT_DECL_OBJDUMP
+# --------------
+# If we don't have a new enough Autoconf to choose the best objdump
+# available, choose the one first in the user's PATH.
+m4_defun([_LT_DECL_OBJDUMP],
+[AC_CHECK_TOOL(OBJDUMP, objdump, false)
+test -z "$OBJDUMP" && OBJDUMP=objdump
+_LT_DECL([], [OBJDUMP], [1], [An object symbol dumper])
+AC_SUBST([OBJDUMP])
+])
+
+# _LT_DECL_DLLTOOL
+# ----------------
+# Ensure DLLTOOL variable is set.
+m4_defun([_LT_DECL_DLLTOOL],
+[AC_CHECK_TOOL(DLLTOOL, dlltool, false)
+test -z "$DLLTOOL" && DLLTOOL=dlltool
+_LT_DECL([], [DLLTOOL], [1], [DLL creation program])
+AC_SUBST([DLLTOOL])
+])
+
+# _LT_DECL_SED
+# ------------
+# Check for a fully-functional sed program, that truncates
+# as few characters as possible.  Prefer GNU sed if found.
+m4_defun([_LT_DECL_SED],
+[AC_PROG_SED
+test -z "$SED" && SED=sed
+Xsed="$SED -e 1s/^X//"
+_LT_DECL([], [SED], [1], [A sed program that does not truncate output])
+_LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"],
+    [Sed that helps us avoid accidentally triggering echo(1) options like -n])
+])# _LT_DECL_SED
+
+m4_ifndef([AC_PROG_SED], [
+# NOTE: This macro has been submitted for inclusion into   #
+#  GNU Autoconf as AC_PROG_SED.  When it is available in   #
+#  a released version of Autoconf we should remove this    #
+#  macro and use it instead.                               #
+
+m4_defun([AC_PROG_SED],
+[AC_MSG_CHECKING([for a sed that does not truncate output])
+AC_CACHE_VAL(lt_cv_path_SED,
+[# Loop through the user's path and test for sed and gsed.
+# Then use that list of sed's as ones to test for truncation.
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  for lt_ac_prog in sed gsed; do
+    for ac_exec_ext in '' $ac_executable_extensions; do
+      if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then
+        lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext"
+      fi
+    done
+  done
+done
+IFS=$as_save_IFS
+lt_ac_max=0
+lt_ac_count=0
+# Add /usr/xpg4/bin/sed as it is typically found on Solaris
+# along with /bin/sed that truncates output.
+for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do
+  test ! -f $lt_ac_sed && continue
+  cat /dev/null > conftest.in
+  lt_ac_count=0
+  echo $ECHO_N "0123456789$ECHO_C" >conftest.in
+  # Check for GNU sed and select it if it is found.
+  if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then
+    lt_cv_path_SED=$lt_ac_sed
+    break
+  fi
+  while true; do
+    cat conftest.in conftest.in >conftest.tmp
+    mv conftest.tmp conftest.in
+    cp conftest.in conftest.nl
+    echo >>conftest.nl
+    $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break
+    cmp -s conftest.out conftest.nl || break
+    # 10000 chars as input seems more than enough
+    test $lt_ac_count -gt 10 && break
+    lt_ac_count=`expr $lt_ac_count + 1`
+    if test $lt_ac_count -gt $lt_ac_max; then
+      lt_ac_max=$lt_ac_count
+      lt_cv_path_SED=$lt_ac_sed
+    fi
+  done
+done
+])
+SED=$lt_cv_path_SED
+AC_SUBST([SED])
+AC_MSG_RESULT([$SED])
+])#AC_PROG_SED
+])#m4_ifndef
+
+# Old name:
+AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED])
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([LT_AC_PROG_SED], [])
+
+
+# _LT_CHECK_SHELL_FEATURES
+# ------------------------
+# Find out whether the shell is Bourne or XSI compatible,
+# or has some other useful features.
+m4_defun([_LT_CHECK_SHELL_FEATURES],
+[AC_MSG_CHECKING([whether the shell understands some XSI constructs])
+# Try some XSI features
+xsi_shell=no
+( _lt_dummy="a/b/c"
+  test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \
+      = c,a/b,b/c, \
+    && eval 'test $(( 1 + 1 )) -eq 2 \
+    && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \
+  && xsi_shell=yes
+AC_MSG_RESULT([$xsi_shell])
+_LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell'])
+
+AC_MSG_CHECKING([whether the shell understands "+="])
+lt_shell_append=no
+( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \
+    >/dev/null 2>&1 \
+  && lt_shell_append=yes
+AC_MSG_RESULT([$lt_shell_append])
+_LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append'])
+
+if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
+  lt_unset=unset
+else
+  lt_unset=false
+fi
+_LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl
+
+# test EBCDIC or ASCII
+case `echo X|tr X '\101'` in
+ A) # ASCII based system
+    # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr
+  lt_SP2NL='tr \040 \012'
+  lt_NL2SP='tr \015\012 \040\040'
+  ;;
+ *) # EBCDIC based system
+  lt_SP2NL='tr \100 \n'
+  lt_NL2SP='tr \r\n \100\100'
+  ;;
+esac
+_LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl
+_LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl
+])# _LT_CHECK_SHELL_FEATURES
+
+
+# _LT_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY)
+# ------------------------------------------------------
+# In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and
+# '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY.
+m4_defun([_LT_PROG_FUNCTION_REPLACE],
+[dnl {
+sed -e '/^$1 ()$/,/^} # $1 /c\
+$1 ()\
+{\
+m4_bpatsubsts([$2], [$], [\\], [^\([	 ]\)], [\\\1])
+} # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+])
+
+
+# _LT_PROG_REPLACE_SHELLFNS
+# -------------------------
+# Replace existing portable implementations of several shell functions with
+# equivalent extended shell implementations where those features are available..
+m4_defun([_LT_PROG_REPLACE_SHELLFNS],
+[if test x"$xsi_shell" = xyes; then
+  _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl
+    case ${1} in
+      */*) func_dirname_result="${1%/*}${2}" ;;
+      *  ) func_dirname_result="${3}" ;;
+    esac])
+
+  _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl
+    func_basename_result="${1##*/}"])
+
+  _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl
+    case ${1} in
+      */*) func_dirname_result="${1%/*}${2}" ;;
+      *  ) func_dirname_result="${3}" ;;
+    esac
+    func_basename_result="${1##*/}"])
+
+  _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl
+    # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are
+    # positional parameters, so assign one to ordinary parameter first.
+    func_stripname_result=${3}
+    func_stripname_result=${func_stripname_result#"${1}"}
+    func_stripname_result=${func_stripname_result%"${2}"}])
+
+  _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl
+    func_split_long_opt_name=${1%%=*}
+    func_split_long_opt_arg=${1#*=}])
+
+  _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl
+    func_split_short_opt_arg=${1#??}
+    func_split_short_opt_name=${1%"$func_split_short_opt_arg"}])
+
+  _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl
+    case ${1} in
+      *.lo) func_lo2o_result=${1%.lo}.${objext} ;;
+      *)    func_lo2o_result=${1} ;;
+    esac])
+
+  _LT_PROG_FUNCTION_REPLACE([func_xform], [    func_xform_result=${1%.*}.lo])
+
+  _LT_PROG_FUNCTION_REPLACE([func_arith], [    func_arith_result=$(( $[*] ))])
+
+  _LT_PROG_FUNCTION_REPLACE([func_len], [    func_len_result=${#1}])
+fi
+
+if test x"$lt_shell_append" = xyes; then
+  _LT_PROG_FUNCTION_REPLACE([func_append], [    eval "${1}+=\\${2}"])
+
+  _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl
+    func_quote_for_eval "${2}"
+dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \
+    eval "${1}+=\\\\ \\$func_quote_for_eval_result"])
+
+  # Save a `func_append' function call where possible by direct use of '+='
+  sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \
+    && mv -f "$cfgfile.tmp" "$cfgfile" \
+      || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+  test 0 -eq $? || _lt_function_replace_fail=:
+else
+  # Save a `func_append' function call even when '+=' is not available
+  sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \
+    && mv -f "$cfgfile.tmp" "$cfgfile" \
+      || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+  test 0 -eq $? || _lt_function_replace_fail=:
+fi
+
+if test x"$_lt_function_replace_fail" = x":"; then
+  AC_MSG_WARN([Unable to substitute extended shell functions in $ofile])
+fi
+])
+
+# _LT_PATH_CONVERSION_FUNCTIONS
+# -----------------------------
+# Determine which file name conversion functions should be used by
+# func_to_host_file (and, implicitly, by func_to_host_path).  These are needed
+# for certain cross-compile configurations and native mingw.
+m4_defun([_LT_PATH_CONVERSION_FUNCTIONS],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+AC_REQUIRE([AC_CANONICAL_BUILD])dnl
+AC_MSG_CHECKING([how to convert $build file names to $host format])
+AC_CACHE_VAL(lt_cv_to_host_file_cmd,
+[case $host in
+  *-*-mingw* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32
+        ;;
+      *-*-cygwin* )
+        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32
+        ;;
+      * ) # otherwise, assume *nix
+        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32
+        ;;
+    esac
+    ;;
+  *-*-cygwin* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin
+        ;;
+      *-*-cygwin* )
+        lt_cv_to_host_file_cmd=func_convert_file_noop
+        ;;
+      * ) # otherwise, assume *nix
+        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin
+        ;;
+    esac
+    ;;
+  * ) # unhandled hosts (and "normal" native builds)
+    lt_cv_to_host_file_cmd=func_convert_file_noop
+    ;;
+esac
+])
+to_host_file_cmd=$lt_cv_to_host_file_cmd
+AC_MSG_RESULT([$lt_cv_to_host_file_cmd])
+_LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd],
+         [0], [convert $build file names to $host format])dnl
+
+AC_MSG_CHECKING([how to convert $build file names to toolchain format])
+AC_CACHE_VAL(lt_cv_to_tool_file_cmd,
+[#assume ordinary cross tools, or native build.
+lt_cv_to_tool_file_cmd=func_convert_file_noop
+case $host in
+  *-*-mingw* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32
+        ;;
+    esac
+    ;;
+esac
+])
+to_tool_file_cmd=$lt_cv_to_tool_file_cmd
+AC_MSG_RESULT([$lt_cv_to_tool_file_cmd])
+_LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd],
+         [0], [convert $build files to toolchain format])dnl
+])# _LT_PATH_CONVERSION_FUNCTIONS
+
+# Helper functions for option handling.                    -*- Autoconf -*-
+#
+#   Copyright (C) 2004, 2005, 2007, 2008, 2009 Free Software Foundation,
+#   Inc.
+#   Written by Gary V. Vaughan, 2004
+#
+# This file 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.
+
+# serial 7 ltoptions.m4
+
+# This is to help aclocal find these macros, as it can't see m4_define.
+AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])])
+
+
+# _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME)
+# ------------------------------------------
+m4_define([_LT_MANGLE_OPTION],
+[[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])])
+
+
+# _LT_SET_OPTION(MACRO-NAME, OPTION-NAME)
+# ---------------------------------------
+# Set option OPTION-NAME for macro MACRO-NAME, and if there is a
+# matching handler defined, dispatch to it.  Other OPTION-NAMEs are
+# saved as a flag.
+m4_define([_LT_SET_OPTION],
+[m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl
+m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]),
+        _LT_MANGLE_DEFUN([$1], [$2]),
+    [m4_warning([Unknown $1 option `$2'])])[]dnl
+])
+
+
+# _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET])
+# ------------------------------------------------------------
+# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
+m4_define([_LT_IF_OPTION],
+[m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])])
+
+
+# _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET)
+# -------------------------------------------------------
+# Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME
+# are set.
+m4_define([_LT_UNLESS_OPTIONS],
+[m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),
+	    [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option),
+		      [m4_define([$0_found])])])[]dnl
+m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3
+])[]dnl
+])
+
+
+# _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST)
+# ----------------------------------------
+# OPTION-LIST is a space-separated list of Libtool options associated
+# with MACRO-NAME.  If any OPTION has a matching handler declared with
+# LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about
+# the unknown option and exit.
+m4_defun([_LT_SET_OPTIONS],
+[# Set options
+m4_foreach([_LT_Option], m4_split(m4_normalize([$2])),
+    [_LT_SET_OPTION([$1], _LT_Option)])
+
+m4_if([$1],[LT_INIT],[
+  dnl
+  dnl Simply set some default values (i.e off) if boolean options were not
+  dnl specified:
+  _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no
+  ])
+  _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no
+  ])
+  dnl
+  dnl If no reference was made to various pairs of opposing options, then
+  dnl we run the default mode handler for the pair.  For example, if neither
+  dnl `shared' nor `disable-shared' was passed, we enable building of shared
+  dnl archives by default:
+  _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED])
+  _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC])
+  _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC])
+  _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install],
+  		   [_LT_ENABLE_FAST_INSTALL])
+  ])
+])# _LT_SET_OPTIONS
+
+
+
+# _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME)
+# -----------------------------------------
+m4_define([_LT_MANGLE_DEFUN],
+[[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])])
+
+
+# LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE)
+# -----------------------------------------------
+m4_define([LT_OPTION_DEFINE],
+[m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl
+])# LT_OPTION_DEFINE
+
+
+# dlopen
+# ------
+LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes
+])
+
+AU_DEFUN([AC_LIBTOOL_DLOPEN],
+[_LT_SET_OPTION([LT_INIT], [dlopen])
+AC_DIAGNOSE([obsolete],
+[$0: Remove this warning and the call to _LT_SET_OPTION when you
+put the `dlopen' option into LT_INIT's first parameter.])
+])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], [])
+
+
+# win32-dll
+# ---------
+# Declare package support for building win32 dll's.
+LT_OPTION_DEFINE([LT_INIT], [win32-dll],
+[enable_win32_dll=yes
+
+case $host in
+*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*)
+  AC_CHECK_TOOL(AS, as, false)
+  AC_CHECK_TOOL(DLLTOOL, dlltool, false)
+  AC_CHECK_TOOL(OBJDUMP, objdump, false)
+  ;;
+esac
+
+test -z "$AS" && AS=as
+_LT_DECL([], [AS],      [1], [Assembler program])dnl
+
+test -z "$DLLTOOL" && DLLTOOL=dlltool
+_LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl
+
+test -z "$OBJDUMP" && OBJDUMP=objdump
+_LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl
+])# win32-dll
+
+AU_DEFUN([AC_LIBTOOL_WIN32_DLL],
+[AC_REQUIRE([AC_CANONICAL_HOST])dnl
+_LT_SET_OPTION([LT_INIT], [win32-dll])
+AC_DIAGNOSE([obsolete],
+[$0: Remove this warning and the call to _LT_SET_OPTION when you
+put the `win32-dll' option into LT_INIT's first parameter.])
+])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], [])
+
+
+# _LT_ENABLE_SHARED([DEFAULT])
+# ----------------------------
+# implement the --enable-shared flag, and supports the `shared' and
+# `disable-shared' LT_INIT options.
+# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.
+m4_define([_LT_ENABLE_SHARED],
+[m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl
+AC_ARG_ENABLE([shared],
+    [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@],
+	[build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])],
+    [p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_shared=yes ;;
+    no) enable_shared=no ;;
+    *)
+      enable_shared=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_shared=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac],
+    [enable_shared=]_LT_ENABLE_SHARED_DEFAULT)
+
+    _LT_DECL([build_libtool_libs], [enable_shared], [0],
+	[Whether or not to build shared libraries])
+])# _LT_ENABLE_SHARED
+
+LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])])
+LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])])
+
+# Old names:
+AC_DEFUN([AC_ENABLE_SHARED],
+[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared])
+])
+
+AC_DEFUN([AC_DISABLE_SHARED],
+[_LT_SET_OPTION([LT_INIT], [disable-shared])
+])
+
+AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)])
+AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AM_ENABLE_SHARED], [])
+dnl AC_DEFUN([AM_DISABLE_SHARED], [])
+
+
+
+# _LT_ENABLE_STATIC([DEFAULT])
+# ----------------------------
+# implement the --enable-static flag, and support the `static' and
+# `disable-static' LT_INIT options.
+# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.
+m4_define([_LT_ENABLE_STATIC],
+[m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl
+AC_ARG_ENABLE([static],
+    [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@],
+	[build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])],
+    [p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_static=yes ;;
+    no) enable_static=no ;;
+    *)
+     enable_static=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_static=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac],
+    [enable_static=]_LT_ENABLE_STATIC_DEFAULT)
+
+    _LT_DECL([build_old_libs], [enable_static], [0],
+	[Whether or not to build static libraries])
+])# _LT_ENABLE_STATIC
+
+LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])])
+LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])])
+
+# Old names:
+AC_DEFUN([AC_ENABLE_STATIC],
+[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static])
+])
+
+AC_DEFUN([AC_DISABLE_STATIC],
+[_LT_SET_OPTION([LT_INIT], [disable-static])
+])
+
+AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)])
+AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AM_ENABLE_STATIC], [])
+dnl AC_DEFUN([AM_DISABLE_STATIC], [])
+
+
+
+# _LT_ENABLE_FAST_INSTALL([DEFAULT])
+# ----------------------------------
+# implement the --enable-fast-install flag, and support the `fast-install'
+# and `disable-fast-install' LT_INIT options.
+# DEFAULT is either `yes' or `no'.  If omitted, it defaults to `yes'.
+m4_define([_LT_ENABLE_FAST_INSTALL],
+[m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl
+AC_ARG_ENABLE([fast-install],
+    [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@],
+    [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])],
+    [p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_fast_install=yes ;;
+    no) enable_fast_install=no ;;
+    *)
+      enable_fast_install=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_fast_install=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac],
+    [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT)
+
+_LT_DECL([fast_install], [enable_fast_install], [0],
+	 [Whether or not to optimize for fast installation])dnl
+])# _LT_ENABLE_FAST_INSTALL
+
+LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])])
+LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])])
+
+# Old names:
+AU_DEFUN([AC_ENABLE_FAST_INSTALL],
+[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install])
+AC_DIAGNOSE([obsolete],
+[$0: Remove this warning and the call to _LT_SET_OPTION when you put
+the `fast-install' option into LT_INIT's first parameter.])
+])
+
+AU_DEFUN([AC_DISABLE_FAST_INSTALL],
+[_LT_SET_OPTION([LT_INIT], [disable-fast-install])
+AC_DIAGNOSE([obsolete],
+[$0: Remove this warning and the call to _LT_SET_OPTION when you put
+the `disable-fast-install' option into LT_INIT's first parameter.])
+])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], [])
+dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], [])
+
+
+# _LT_WITH_PIC([MODE])
+# --------------------
+# implement the --with-pic flag, and support the `pic-only' and `no-pic'
+# LT_INIT options.
+# MODE is either `yes' or `no'.  If omitted, it defaults to `both'.
+m4_define([_LT_WITH_PIC],
+[AC_ARG_WITH([pic],
+    [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@],
+	[try to use only PIC/non-PIC objects @<:@default=use both@:>@])],
+    [lt_p=${PACKAGE-default}
+    case $withval in
+    yes|no) pic_mode=$withval ;;
+    *)
+      pic_mode=default
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for lt_pkg in $withval; do
+	IFS="$lt_save_ifs"
+	if test "X$lt_pkg" = "X$lt_p"; then
+	  pic_mode=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac],
+    [pic_mode=default])
+
+test -z "$pic_mode" && pic_mode=m4_default([$1], [default])
+
+_LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl
+])# _LT_WITH_PIC
+
+LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])])
+LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])])
+
+# Old name:
+AU_DEFUN([AC_LIBTOOL_PICMODE],
+[_LT_SET_OPTION([LT_INIT], [pic-only])
+AC_DIAGNOSE([obsolete],
+[$0: Remove this warning and the call to _LT_SET_OPTION when you
+put the `pic-only' option into LT_INIT's first parameter.])
+])
+
+dnl aclocal-1.4 backwards compatibility:
+dnl AC_DEFUN([AC_LIBTOOL_PICMODE], [])
+
+
+m4_define([_LTDL_MODE], [])
+LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive],
+		 [m4_define([_LTDL_MODE], [nonrecursive])])
+LT_OPTION_DEFINE([LTDL_INIT], [recursive],
+		 [m4_define([_LTDL_MODE], [recursive])])
+LT_OPTION_DEFINE([LTDL_INIT], [subproject],
+		 [m4_define([_LTDL_MODE], [subproject])])
+
+m4_define([_LTDL_TYPE], [])
+LT_OPTION_DEFINE([LTDL_INIT], [installable],
+		 [m4_define([_LTDL_TYPE], [installable])])
+LT_OPTION_DEFINE([LTDL_INIT], [convenience],
+		 [m4_define([_LTDL_TYPE], [convenience])])
+
+# ltsugar.m4 -- libtool m4 base layer.                         -*-Autoconf-*-
+#
+# Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc.
+# Written by Gary V. Vaughan, 2004
+#
+# This file 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.
+
+# serial 6 ltsugar.m4
+
+# This is to help aclocal find these macros, as it can't see m4_define.
+AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])])
+
+
+# lt_join(SEP, ARG1, [ARG2...])
+# -----------------------------
+# Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their
+# associated separator.
+# Needed until we can rely on m4_join from Autoconf 2.62, since all earlier
+# versions in m4sugar had bugs.
+m4_define([lt_join],
+[m4_if([$#], [1], [],
+       [$#], [2], [[$2]],
+       [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])])
+m4_define([_lt_join],
+[m4_if([$#$2], [2], [],
+       [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])])
+
+
+# lt_car(LIST)
+# lt_cdr(LIST)
+# ------------
+# Manipulate m4 lists.
+# These macros are necessary as long as will still need to support
+# Autoconf-2.59 which quotes differently.
+m4_define([lt_car], [[$1]])
+m4_define([lt_cdr],
+[m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])],
+       [$#], 1, [],
+       [m4_dquote(m4_shift($@))])])
+m4_define([lt_unquote], $1)
+
+
+# lt_append(MACRO-NAME, STRING, [SEPARATOR])
+# ------------------------------------------
+# Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'.
+# Note that neither SEPARATOR nor STRING are expanded; they are appended
+# to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked).
+# No SEPARATOR is output if MACRO-NAME was previously undefined (different
+# than defined and empty).
+#
+# This macro is needed until we can rely on Autoconf 2.62, since earlier
+# versions of m4sugar mistakenly expanded SEPARATOR but not STRING.
+m4_define([lt_append],
+[m4_define([$1],
+	   m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])])
+
+
+
+# lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...])
+# ----------------------------------------------------------
+# Produce a SEP delimited list of all paired combinations of elements of
+# PREFIX-LIST with SUFFIX1 through SUFFIXn.  Each element of the list
+# has the form PREFIXmINFIXSUFFIXn.
+# Needed until we can rely on m4_combine added in Autoconf 2.62.
+m4_define([lt_combine],
+[m4_if(m4_eval([$# > 3]), [1],
+       [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl
+[[m4_foreach([_Lt_prefix], [$2],
+	     [m4_foreach([_Lt_suffix],
+		]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[,
+	[_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])])
+
+
+# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ])
+# -----------------------------------------------------------------------
+# Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited
+# by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ.
+m4_define([lt_if_append_uniq],
+[m4_ifdef([$1],
+	  [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1],
+		 [lt_append([$1], [$2], [$3])$4],
+		 [$5])],
+	  [lt_append([$1], [$2], [$3])$4])])
+
+
+# lt_dict_add(DICT, KEY, VALUE)
+# -----------------------------
+m4_define([lt_dict_add],
+[m4_define([$1($2)], [$3])])
+
+
+# lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE)
+# --------------------------------------------
+m4_define([lt_dict_add_subkey],
+[m4_define([$1($2:$3)], [$4])])
+
+
+# lt_dict_fetch(DICT, KEY, [SUBKEY])
+# ----------------------------------
+m4_define([lt_dict_fetch],
+[m4_ifval([$3],
+	m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]),
+    m4_ifdef([$1($2)], [m4_defn([$1($2)])]))])
+
+
+# lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE])
+# -----------------------------------------------------------------
+m4_define([lt_if_dict_fetch],
+[m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4],
+	[$5],
+    [$6])])
+
+
+# lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...])
+# --------------------------------------------------------------
+m4_define([lt_dict_filter],
+[m4_if([$5], [], [],
+  [lt_join(m4_quote(m4_default([$4], [[, ]])),
+           lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]),
+		      [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl
+])
+
+# ltversion.m4 -- version numbers			-*- Autoconf -*-
+#
+#   Copyright (C) 2004 Free Software Foundation, Inc.
+#   Written by Scott James Remnant, 2004
+#
+# This file 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.
+
+# @configure_input@
+
+# serial 3337 ltversion.m4
+# This file is part of GNU Libtool
+
+m4_define([LT_PACKAGE_VERSION], [2.4.2])
+m4_define([LT_PACKAGE_REVISION], [1.3337])
+
+AC_DEFUN([LTVERSION_VERSION],
+[macro_version='2.4.2'
+macro_revision='1.3337'
+_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?])
+_LT_DECL(, macro_revision, 0)
+])
+
+# lt~obsolete.m4 -- aclocal satisfying obsolete definitions.    -*-Autoconf-*-
+#
+#   Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation, Inc.
+#   Written by Scott James Remnant, 2004.
+#
+# This file 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.
+
+# serial 5 lt~obsolete.m4
+
+# These exist entirely to fool aclocal when bootstrapping libtool.
+#
+# In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN)
+# which have later been changed to m4_define as they aren't part of the
+# exported API, or moved to Autoconf or Automake where they belong.
+#
+# The trouble is, aclocal is a bit thick.  It'll see the old AC_DEFUN
+# in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us
+# using a macro with the same name in our local m4/libtool.m4 it'll
+# pull the old libtool.m4 in (it doesn't see our shiny new m4_define
+# and doesn't know about Autoconf macros at all.)
+#
+# So we provide this file, which has a silly filename so it's always
+# included after everything else.  This provides aclocal with the
+# AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything
+# because those macros already exist, or will be overwritten later.
+# We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. 
+#
+# Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here.
+# Yes, that means every name once taken will need to remain here until
+# we give up compatibility with versions before 1.7, at which point
+# we need to keep only those names which we still refer to.
+
+# This is to help aclocal find these macros, as it can't see m4_define.
+AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])])
+
+m4_ifndef([AC_LIBTOOL_LINKER_OPTION],	[AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])])
+m4_ifndef([AC_PROG_EGREP],		[AC_DEFUN([AC_PROG_EGREP])])
+m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH],	[AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])])
+m4_ifndef([_LT_AC_SHELL_INIT],		[AC_DEFUN([_LT_AC_SHELL_INIT])])
+m4_ifndef([_LT_AC_SYS_LIBPATH_AIX],	[AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])])
+m4_ifndef([_LT_PROG_LTMAIN],		[AC_DEFUN([_LT_PROG_LTMAIN])])
+m4_ifndef([_LT_AC_TAGVAR],		[AC_DEFUN([_LT_AC_TAGVAR])])
+m4_ifndef([AC_LTDL_ENABLE_INSTALL],	[AC_DEFUN([AC_LTDL_ENABLE_INSTALL])])
+m4_ifndef([AC_LTDL_PREOPEN],		[AC_DEFUN([AC_LTDL_PREOPEN])])
+m4_ifndef([_LT_AC_SYS_COMPILER],	[AC_DEFUN([_LT_AC_SYS_COMPILER])])
+m4_ifndef([_LT_AC_LOCK],		[AC_DEFUN([_LT_AC_LOCK])])
+m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE],	[AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])])
+m4_ifndef([_LT_AC_TRY_DLOPEN_SELF],	[AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])])
+m4_ifndef([AC_LIBTOOL_PROG_CC_C_O],	[AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])])
+m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])])
+m4_ifndef([AC_LIBTOOL_OBJDIR],		[AC_DEFUN([AC_LIBTOOL_OBJDIR])])
+m4_ifndef([AC_LTDL_OBJDIR],		[AC_DEFUN([AC_LTDL_OBJDIR])])
+m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])])
+m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP],	[AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])])
+m4_ifndef([AC_PATH_MAGIC],		[AC_DEFUN([AC_PATH_MAGIC])])
+m4_ifndef([AC_PROG_LD_GNU],		[AC_DEFUN([AC_PROG_LD_GNU])])
+m4_ifndef([AC_PROG_LD_RELOAD_FLAG],	[AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])])
+m4_ifndef([AC_DEPLIBS_CHECK_METHOD],	[AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])])
+m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])])
+m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])])
+m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])])
+m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS],	[AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])])
+m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP],	[AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])])
+m4_ifndef([LT_AC_PROG_EGREP],		[AC_DEFUN([LT_AC_PROG_EGREP])])
+m4_ifndef([LT_AC_PROG_SED],		[AC_DEFUN([LT_AC_PROG_SED])])
+m4_ifndef([_LT_CC_BASENAME],		[AC_DEFUN([_LT_CC_BASENAME])])
+m4_ifndef([_LT_COMPILER_BOILERPLATE],	[AC_DEFUN([_LT_COMPILER_BOILERPLATE])])
+m4_ifndef([_LT_LINKER_BOILERPLATE],	[AC_DEFUN([_LT_LINKER_BOILERPLATE])])
+m4_ifndef([_AC_PROG_LIBTOOL],		[AC_DEFUN([_AC_PROG_LIBTOOL])])
+m4_ifndef([AC_LIBTOOL_SETUP],		[AC_DEFUN([AC_LIBTOOL_SETUP])])
+m4_ifndef([_LT_AC_CHECK_DLFCN],		[AC_DEFUN([_LT_AC_CHECK_DLFCN])])
+m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER],	[AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])])
+m4_ifndef([_LT_AC_TAGCONFIG],		[AC_DEFUN([_LT_AC_TAGCONFIG])])
+m4_ifndef([AC_DISABLE_FAST_INSTALL],	[AC_DEFUN([AC_DISABLE_FAST_INSTALL])])
+m4_ifndef([_LT_AC_LANG_CXX],		[AC_DEFUN([_LT_AC_LANG_CXX])])
+m4_ifndef([_LT_AC_LANG_F77],		[AC_DEFUN([_LT_AC_LANG_F77])])
+m4_ifndef([_LT_AC_LANG_GCJ],		[AC_DEFUN([_LT_AC_LANG_GCJ])])
+m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG],	[AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])])
+m4_ifndef([_LT_AC_LANG_C_CONFIG],	[AC_DEFUN([_LT_AC_LANG_C_CONFIG])])
+m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG],	[AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])])
+m4_ifndef([_LT_AC_LANG_CXX_CONFIG],	[AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])])
+m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG],	[AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])])
+m4_ifndef([_LT_AC_LANG_F77_CONFIG],	[AC_DEFUN([_LT_AC_LANG_F77_CONFIG])])
+m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG],	[AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])])
+m4_ifndef([_LT_AC_LANG_GCJ_CONFIG],	[AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])])
+m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG],	[AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])])
+m4_ifndef([_LT_AC_LANG_RC_CONFIG],	[AC_DEFUN([_LT_AC_LANG_RC_CONFIG])])
+m4_ifndef([AC_LIBTOOL_CONFIG],		[AC_DEFUN([AC_LIBTOOL_CONFIG])])
+m4_ifndef([_LT_AC_FILE_LTDLL_C],	[AC_DEFUN([_LT_AC_FILE_LTDLL_C])])
+m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS],	[AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])])
+m4_ifndef([_LT_AC_PROG_CXXCPP],		[AC_DEFUN([_LT_AC_PROG_CXXCPP])])
+m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS],	[AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])])
+m4_ifndef([_LT_PROG_ECHO_BACKSLASH],	[AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])])
+m4_ifndef([_LT_PROG_F77],		[AC_DEFUN([_LT_PROG_F77])])
+m4_ifndef([_LT_PROG_FC],		[AC_DEFUN([_LT_PROG_FC])])
+m4_ifndef([_LT_PROG_CXX],		[AC_DEFUN([_LT_PROG_CXX])])
+
+# Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software
+# Foundation, Inc.
+#
+# This file 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.
+
+# serial 1
+
+# AM_AUTOMAKE_VERSION(VERSION)
+# ----------------------------
+# Automake X.Y traces this macro to ensure aclocal.m4 has been
+# generated from the m4 files accompanying Automake X.Y.
+# (This private macro should not be called outside this file.)
+AC_DEFUN([AM_AUTOMAKE_VERSION],
+[am__api_version='1.11'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.11.3], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+
+# _AM_AUTOCONF_VERSION(VERSION)
+# -----------------------------
+# aclocal traces this macro to find the Autoconf version.
+# This is a private macro too.  Using m4_define simplifies
+# the logic in aclocal, which can simply ignore this definition.
+m4_define([_AM_AUTOCONF_VERSION], [])
+
+# AM_SET_CURRENT_AUTOMAKE_VERSION
+# -------------------------------
+# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
+# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
+AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
+[AM_AUTOMAKE_VERSION([1.11.3])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+
+# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
+
+# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 1
+
+# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
+# $ac_aux_dir to `$srcdir/foo'.  In other projects, it is set to
+# `$srcdir', `$srcdir/..', or `$srcdir/../..'.
+#
+# Of course, Automake must honor this variable whenever it calls a
+# tool from the auxiliary directory.  The problem is that $srcdir (and
+# therefore $ac_aux_dir as well) can be either absolute or relative,
+# depending on how configure is run.  This is pretty annoying, since
+# it makes $ac_aux_dir quite unusable in subdirectories: in the top
+# source directory, any form will work fine, but in subdirectories a
+# relative path needs to be adjusted first.
+#
+# $ac_aux_dir/missing
+#    fails when called from a subdirectory if $ac_aux_dir is relative
+# $top_srcdir/$ac_aux_dir/missing
+#    fails if $ac_aux_dir is absolute,
+#    fails when called from a subdirectory in a VPATH build with
+#          a relative $ac_aux_dir
+#
+# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
+# are both prefixed by $srcdir.  In an in-source build this is usually
+# harmless because $srcdir is `.', but things will broke when you
+# start a VPATH build or use an absolute $srcdir.
+#
+# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
+# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:
+#   am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
+# and then we would define $MISSING as
+#   MISSING="\${SHELL} $am_aux_dir/missing"
+# This will work as long as MISSING is not called from configure, because
+# unfortunately $(top_srcdir) has no meaning in configure.
+# However there are other variables, like CC, which are often used in
+# configure, and could therefore not use this "fixed" $ac_aux_dir.
+#
+# Another solution, used here, is to always expand $ac_aux_dir to an
+# absolute PATH.  The drawback is that using absolute paths prevent a
+# configured tree to be moved without reconfiguration.
+
+AC_DEFUN([AM_AUX_DIR_EXPAND],
+[dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+
+# AM_CONDITIONAL                                            -*- Autoconf -*-
+
+# Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008
+# Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 9
+
+# AM_CONDITIONAL(NAME, SHELL-CONDITION)
+# -------------------------------------
+# Define a conditional.
+AC_DEFUN([AM_CONDITIONAL],
+[AC_PREREQ(2.52)dnl
+ ifelse([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
+	[$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
+AC_SUBST([$1_TRUE])dnl
+AC_SUBST([$1_FALSE])dnl
+_AM_SUBST_NOTMAKE([$1_TRUE])dnl
+_AM_SUBST_NOTMAKE([$1_FALSE])dnl
+m4_define([_AM_COND_VALUE_$1], [$2])dnl
+if $2; then
+  $1_TRUE=
+  $1_FALSE='#'
+else
+  $1_TRUE='#'
+  $1_FALSE=
+fi
+AC_CONFIG_COMMANDS_PRE(
+[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
+  AC_MSG_ERROR([[conditional "$1" was never defined.
+Usually this means the macro was only invoked conditionally.]])
+fi])])
+
+# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2009,
+# 2010, 2011 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 12
+
+# There are a few dirty hacks below to avoid letting `AC_PROG_CC' be
+# written in clear, in which case automake, when reading aclocal.m4,
+# will think it sees a *use*, and therefore will trigger all it's
+# C support machinery.  Also note that it means that autoscan, seeing
+# CC etc. in the Makefile, will ask for an AC_PROG_CC use...
+
+
+# _AM_DEPENDENCIES(NAME)
+# ----------------------
+# See how the compiler implements dependency checking.
+# NAME is "CC", "CXX", "GCJ", or "OBJC".
+# We try a few techniques and use that to set a single cache variable.
+#
+# We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was
+# modified to invoke _AM_DEPENDENCIES(CC); we would have a circular
+# dependency, and given that the user is not expected to run this macro,
+# just rely on AC_PROG_CC.
+AC_DEFUN([_AM_DEPENDENCIES],
+[AC_REQUIRE([AM_SET_DEPDIR])dnl
+AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
+AC_REQUIRE([AM_MAKE_INCLUDE])dnl
+AC_REQUIRE([AM_DEP_TRACK])dnl
+
+ifelse([$1], CC,   [depcc="$CC"   am_compiler_list=],
+       [$1], CXX,  [depcc="$CXX"  am_compiler_list=],
+       [$1], OBJC, [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
+       [$1], UPC,  [depcc="$UPC"  am_compiler_list=],
+       [$1], GCJ,  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
+                   [depcc="$$1"   am_compiler_list=])
+
+AC_CACHE_CHECK([dependency style of $depcc],
+               [am_cv_$1_dependencies_compiler_type],
+[if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named `D' -- because `-MD' means `put the output
+  # in D'.
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_$1_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp`
+  fi
+  am__universal=false
+  m4_case([$1], [CC],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac],
+    [CXX],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac])
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
+      # Solaris 8's {/usr,}/bin/sh.
+      touch sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle `-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # after this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok `-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_$1_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_$1_dependencies_compiler_type=none
+fi
+])
+AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])
+AM_CONDITIONAL([am__fastdep$1], [
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_$1_dependencies_compiler_type" = gcc3])
+])
+
+
+# AM_SET_DEPDIR
+# -------------
+# Choose a directory name for dependency files.
+# This macro is AC_REQUIREd in _AM_DEPENDENCIES
+AC_DEFUN([AM_SET_DEPDIR],
+[AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
+])
+
+
+# AM_DEP_TRACK
+# ------------
+AC_DEFUN([AM_DEP_TRACK],
+[AC_ARG_ENABLE(dependency-tracking,
+[  --disable-dependency-tracking  speeds up one-time build
+  --enable-dependency-tracking   do not reject slow dependency extractors])
+if test "x$enable_dependency_tracking" != xno; then
+  am_depcomp="$ac_aux_dir/depcomp"
+  AMDEPBACKSLASH='\'
+  am__nodep='_no'
+fi
+AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno])
+AC_SUBST([AMDEPBACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl
+AC_SUBST([am__nodep])dnl
+_AM_SUBST_NOTMAKE([am__nodep])dnl
+])
+
+# Generate code to set up dependency tracking.              -*- Autoconf -*-
+
+# Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2008
+# Free Software Foundation, Inc.
+#
+# This file 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.
+
+#serial 5
+
+# _AM_OUTPUT_DEPENDENCY_COMMANDS
+# ------------------------------
+AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS],
+[{
+  # Autoconf 2.62 quotes --file arguments for eval, but not when files
+  # are listed without --file.  Let's play safe and only enable the eval
+  # if we detect the quoting.
+  case $CONFIG_FILES in
+  *\'*) eval set x "$CONFIG_FILES" ;;
+  *)   set x $CONFIG_FILES ;;
+  esac
+  shift
+  for mf
+  do
+    # Strip MF so we end up with the name of the file.
+    mf=`echo "$mf" | sed -e 's/:.*$//'`
+    # Check whether this is an Automake generated Makefile or not.
+    # We used to match only the files named `Makefile.in', but
+    # some people rename them; so instead we look at the file content.
+    # Grep'ing the first line is not enough: some people post-process
+    # each Makefile.in and add a new line on top of each file to say so.
+    # Grep'ing the whole file is not good either: AIX grep has a line
+    # limit of 2048, but all sed's we know have understand at least 4000.
+    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
+      dirpart=`AS_DIRNAME("$mf")`
+    else
+      continue
+    fi
+    # Extract the definition of DEPDIR, am__include, and am__quote
+    # from the Makefile without running `make'.
+    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
+    test -z "$DEPDIR" && continue
+    am__include=`sed -n 's/^am__include = //p' < "$mf"`
+    test -z "am__include" && continue
+    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
+    # When using ansi2knr, U may be empty or an underscore; expand it
+    U=`sed -n 's/^U = //p' < "$mf"`
+    # Find all dependency output files, they are included files with
+    # $(DEPDIR) in their names.  We invoke sed twice because it is the
+    # simplest approach to changing $(DEPDIR) to its actual value in the
+    # expansion.
+    for file in `sed -n "
+      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
+      # Make sure the directory exists.
+      test -f "$dirpart/$file" && continue
+      fdir=`AS_DIRNAME(["$file"])`
+      AS_MKDIR_P([$dirpart/$fdir])
+      # echo "creating $dirpart/$file"
+      echo '# dummy' > "$dirpart/$file"
+    done
+  done
+}
+])# _AM_OUTPUT_DEPENDENCY_COMMANDS
+
+
+# AM_OUTPUT_DEPENDENCY_COMMANDS
+# -----------------------------
+# This macro should only be invoked once -- use via AC_REQUIRE.
+#
+# This code is only required when automatic dependency tracking
+# is enabled.  FIXME.  This creates each `.P' file that we will
+# need in order to bootstrap the dependency handling code.
+AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS],
+[AC_CONFIG_COMMANDS([depfiles],
+     [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS],
+     [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"])
+])
+
+# Do all the work for Automake.                             -*- Autoconf -*-
+
+# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
+# 2005, 2006, 2008, 2009 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 16
+
+# This macro actually does too much.  Some checks are only needed if
+# your package does certain things.  But this isn't really a big deal.
+
+# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
+# AM_INIT_AUTOMAKE([OPTIONS])
+# -----------------------------------------------
+# The call with PACKAGE and VERSION arguments is the old style
+# call (pre autoconf-2.50), which is being phased out.  PACKAGE
+# and VERSION should now be passed to AC_INIT and removed from
+# the call to AM_INIT_AUTOMAKE.
+# We support both call styles for the transition.  After
+# the next Automake release, Autoconf can make the AC_INIT
+# arguments mandatory, and then we can depend on a new Autoconf
+# release and drop the old call support.
+AC_DEFUN([AM_INIT_AUTOMAKE],
+[AC_PREREQ([2.62])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package])
+ AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version})
+AM_MISSING_PROG(AUTOCONF, autoconf)
+AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version})
+AM_MISSING_PROG(AUTOHEADER, autoheader)
+AM_MISSING_PROG(MAKEINFO, makeinfo)
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AM_PROG_MKDIR_P])dnl
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES(CC)],
+		  [define([AC_PROG_CC],
+			  defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES(CXX)],
+		  [define([AC_PROG_CXX],
+			  defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES(OBJC)],
+		  [define([AC_PROG_OBJC],
+			  defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl
+])
+_AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl
+dnl The `parallel-tests' driver may need to know about EXEEXT, so add the
+dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This macro
+dnl is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+])
+
+dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
+dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
+dnl mangled by Autoconf and run in a shell conditional statement.
+m4_define([_AC_COMPILER_EXEEXT],
+m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
+
+
+# When config.status generates a header, we must update the stamp-h file.
+# This file resides in the same directory as the config header
+# that is generated.  The stamp files are numbered to have different names.
+
+# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
+# loop where config.status creates the headers, so we can generate
+# our stamp files there.
+AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
+[# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+
+# Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation,
+# Inc.
+#
+# This file 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.
+
+# serial 1
+
+# AM_PROG_INSTALL_SH
+# ------------------
+# Define $install_sh.
+AC_DEFUN([AM_PROG_INSTALL_SH],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST(install_sh)])
+
+# Copyright (C) 2003, 2005  Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 2
+
+# Check whether the underlying file-system supports filenames
+# with a leading dot.  For instance MS-DOS doesn't.
+AC_DEFUN([AM_SET_LEADING_DOT],
+[rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+
+# Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2005
+# Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 5
+
+# AM_PROG_LEX
+# -----------
+# Autoconf leaves LEX=: if lex or flex can't be found.  Change that to a
+# "missing" invocation, for better error output.
+AC_DEFUN([AM_PROG_LEX],
+[AC_PREREQ(2.50)dnl
+AC_REQUIRE([AM_MISSING_HAS_RUN])dnl
+AC_REQUIRE([AC_PROG_LEX])dnl
+if test "$LEX" = :; then
+  LEX=${am_missing_run}flex
+fi])
+
+# Check to see how 'make' treats includes.	            -*- Autoconf -*-
+
+# Copyright (C) 2001, 2002, 2003, 2005, 2009  Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 4
+
+# AM_MAKE_INCLUDE()
+# -----------------
+# Check to see how make treats includes.
+AC_DEFUN([AM_MAKE_INCLUDE],
+[am_make=${MAKE-make}
+cat > confinc << 'END'
+am__doit:
+	@echo this is the am__doit target
+.PHONY: am__doit
+END
+# If we don't find an include directive, just comment out the code.
+AC_MSG_CHECKING([for style of include used by $am_make])
+am__include="#"
+am__quote=
+_am_result=none
+# First try GNU make style include.
+echo "include confinc" > confmf
+# Ignore all kinds of additional output from `make'.
+case `$am_make -s -f confmf 2> /dev/null` in #(
+*the\ am__doit\ target*)
+  am__include=include
+  am__quote=
+  _am_result=GNU
+  ;;
+esac
+# Now try BSD make style include.
+if test "$am__include" = "#"; then
+   echo '.include "confinc"' > confmf
+   case `$am_make -s -f confmf 2> /dev/null` in #(
+   *the\ am__doit\ target*)
+     am__include=.include
+     am__quote="\""
+     _am_result=BSD
+     ;;
+   esac
+fi
+AC_SUBST([am__include])
+AC_SUBST([am__quote])
+AC_MSG_RESULT([$_am_result])
+rm -f confinc confmf
+])
+
+# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
+
+# Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008
+# Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 6
+
+# AM_MISSING_PROG(NAME, PROGRAM)
+# ------------------------------
+AC_DEFUN([AM_MISSING_PROG],
+[AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+
+
+# AM_MISSING_HAS_RUN
+# ------------------
+# Define MISSING if not defined so far and test if it supports --run.
+# If it does, set am_missing_run to use it, otherwise, to nothing.
+AC_DEFUN([AM_MISSING_HAS_RUN],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --run true"; then
+  am_missing_run="$MISSING --run "
+else
+  am_missing_run=
+  AC_MSG_WARN([`missing' script is too old or missing])
+fi
+])
+
+# Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation,
+# Inc.
+#
+# This file 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.
+
+# serial 1
+
+# AM_PROG_MKDIR_P
+# ---------------
+# Check for `mkdir -p'.
+AC_DEFUN([AM_PROG_MKDIR_P],
+[AC_PREREQ([2.60])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+dnl Automake 1.8 to 1.9.6 used to define mkdir_p.  We now use MKDIR_P,
+dnl while keeping a definition of mkdir_p for backward compatibility.
+dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile.
+dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of
+dnl Makefile.ins that do not define MKDIR_P, so we do our own
+dnl adjustment using top_builddir (which is defined more often than
+dnl MKDIR_P).
+AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl
+case $mkdir_p in
+  [[\\/$]]* | ?:[[\\/]]*) ;;
+  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
+esac
+])
+
+# Helper functions for option handling.                     -*- Autoconf -*-
+
+# Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software
+# Foundation, Inc.
+#
+# This file 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.
+
+# serial 5
+
+# _AM_MANGLE_OPTION(NAME)
+# -----------------------
+AC_DEFUN([_AM_MANGLE_OPTION],
+[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+
+# _AM_SET_OPTION(NAME)
+# --------------------
+# Set option NAME.  Presently that only means defining a flag for this option.
+AC_DEFUN([_AM_SET_OPTION],
+[m4_define(_AM_MANGLE_OPTION([$1]), 1)])
+
+# _AM_SET_OPTIONS(OPTIONS)
+# ------------------------
+# OPTIONS is a space-separated list of Automake options.
+AC_DEFUN([_AM_SET_OPTIONS],
+[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+
+# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
+# -------------------------------------------
+# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
+AC_DEFUN([_AM_IF_OPTION],
+[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+
+# Check to make sure that the build environment is sane.    -*- Autoconf -*-
+
+# Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008
+# Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 5
+
+# AM_SANITY_CHECK
+# ---------------
+AC_DEFUN([AM_SANITY_CHECK],
+[AC_MSG_CHECKING([whether build environment is sane])
+# Just in case
+sleep 1
+echo timestamp > conftest.file
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);;
+esac
+
+# Do `set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+   if test "$[*]" = "X"; then
+      # -L didn't work.
+      set X `ls -t "$srcdir/configure" conftest.file`
+   fi
+   rm -f conftest.file
+   if test "$[*]" != "X $srcdir/configure conftest.file" \
+      && test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+      # If neither matched, then we have a broken ls.  This can happen
+      # if, for instance, CONFIG_SHELL is bash and it inherits a
+      # broken ls alias from the environment.  This has actually
+      # happened.  Such a system could not be considered "sane".
+      AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+alias in your environment])
+   fi
+
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT(yes)])
+
+# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 1
+
+# AM_PROG_INSTALL_STRIP
+# ---------------------
+# One issue with vendor `install' (even GNU) is that you can't
+# specify the program used to strip binaries.  This is especially
+# annoying in cross-compiling environments, where the build's strip
+# is unlikely to handle the host's binaries.
+# Fortunately install-sh will honor a STRIPPROG variable, so we
+# always use install-sh in `make install-strip', and initialize
+# STRIPPROG with the value of the STRIP variable (set by the user).
+AC_DEFUN([AM_PROG_INSTALL_STRIP],
+[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using `strip' when the user
+# run `make install-strip'.  However `strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the `STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be `maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+
+# Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 3
+
+# _AM_SUBST_NOTMAKE(VARIABLE)
+# ---------------------------
+# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
+# This macro is traced by Automake.
+AC_DEFUN([_AM_SUBST_NOTMAKE])
+
+# AM_SUBST_NOTMAKE(VARIABLE)
+# --------------------------
+# Public sister of _AM_SUBST_NOTMAKE.
+AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+
+# Check how to create a tarball.                            -*- Autoconf -*-
+
+# Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc.
+#
+# This file 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.
+
+# serial 2
+
+# _AM_PROG_TAR(FORMAT)
+# --------------------
+# Check how to create a tarball in format FORMAT.
+# FORMAT should be one of `v7', `ustar', or `pax'.
+#
+# Substitute a variable $(am__tar) that is a command
+# writing to stdout a FORMAT-tarball containing the directory
+# $tardir.
+#     tardir=directory && $(am__tar) > result.tar
+#
+# Substitute a variable $(am__untar) that extract such
+# a tarball read from stdin.
+#     $(am__untar) < result.tar
+AC_DEFUN([_AM_PROG_TAR],
+[# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+m4_if([$1], [v7],
+     [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+     [m4_case([$1], [ustar],, [pax],,
+              [m4_fatal([Unknown tar format])])
+AC_MSG_CHECKING([how to create a $1 tar archive])
+# Loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+_am_tools=${am_cv_prog_tar_$1-$_am_tools}
+# Do not fold the above two line into one, because Tru64 sh and
+# Solaris sh will not grok spaces in the rhs of `-'.
+for _am_tool in $_am_tools
+do
+  case $_am_tool in
+  gnutar)
+    for _am_tar in tar gnutar gtar;
+    do
+      AM_RUN_LOG([$_am_tar --version]) && break
+    done
+    am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+    am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+    am__untar="$_am_tar -xf -"
+    ;;
+  plaintar)
+    # Must skip GNU tar: if it does not support --format= it doesn't create
+    # ustar tarball either.
+    (tar --version) >/dev/null 2>&1 && continue
+    am__tar='tar chf - "$$tardir"'
+    am__tar_='tar chf - "$tardir"'
+    am__untar='tar xf -'
+    ;;
+  pax)
+    am__tar='pax -L -x $1 -w "$$tardir"'
+    am__tar_='pax -L -x $1 -w "$tardir"'
+    am__untar='pax -r'
+    ;;
+  cpio)
+    am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+    am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+    am__untar='cpio -i -H $1 -d'
+    ;;
+  none)
+    am__tar=false
+    am__tar_=false
+    am__untar=false
+    ;;
+  esac
+
+  # If the value was cached, stop now.  We just wanted to have am__tar
+  # and am__untar set.
+  test -n "${am_cv_prog_tar_$1}" && break
+
+  # tar/untar a dummy directory, and stop if the command works
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  echo GrepMe > conftest.dir/file
+  AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+  rm -rf conftest.dir
+  if test -s conftest.tar; then
+    AM_RUN_LOG([$am__untar <conftest.tar])
+    grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+  fi
+done
+rm -rf conftest.dir
+
+AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+]) # _AM_PROG_TAR
+
diff -Nru igraph-0.6.5~quantal1/bootstrap.sh igraph-0.6.5/bootstrap.sh
--- igraph-0.6.5~quantal1/bootstrap.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/bootstrap.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-#! /bin/sh
-for i in glibtoolize libtoolize; do
-  LIBTOOLIZE=`which $i` && break
-done
-if [ -z "$LIBTOOLIZE" ]; then
-  echo libtoolize or glibtoolize not found or not in the path!
-  exit 1
-fi
-
-set -x
-aclocal
-$LIBTOOLIZE --force --copy
-autoheader
-automake --add-missing --copy
-autoconf
-cd interfaces/R && autoheader && autoconf
-cd -
diff -Nru igraph-0.6.5~quantal1/config.guess igraph-0.6.5/config.guess
--- igraph-0.6.5~quantal1/config.guess	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/config.guess	2013-03-03 01:29:38.000000000 +0000
@@ -0,0 +1,1530 @@
+#! /bin/sh
+# Attempt to guess a canonical system name.
+#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
+#   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
+#   2011, 2012 Free Software Foundation, Inc.
+
+timestamp='2012-02-10'
+
+# This file 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 2 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/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+
+# Originally written by Per Bothner.  Please send patches (context
+# diff format) to <config-patches@gnu.org> and include a ChangeLog
+# entry.
+#
+# This script attempts to guess a canonical system name similar to
+# config.sub.  If it succeeds, it prints the system name on stdout, and
+# exits with 0.  Otherwise, it exits with 1.
+#
+# You can get the latest version of this script from:
+# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION]
+
+Output the configuration name of the system \`$me' is run on.
+
+Operation modes:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.guess ($timestamp)
+
+Originally written by Per Bothner.
+Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
+2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
+Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help" >&2
+       exit 1 ;;
+    * )
+       break ;;
+  esac
+done
+
+if test $# != 0; then
+  echo "$me: too many arguments$help" >&2
+  exit 1
+fi
+
+trap 'exit 1' 1 2 15
+
+# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
+# compiler to aid in system detection is discouraged as it requires
+# temporary files to be created and, as you can see below, it is a
+# headache to deal with in a portable fashion.
+
+# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
+# use `HOST_CC' if defined, but it is deprecated.
+
+# Portable tmp directory creation inspired by the Autoconf team.
+
+set_cc_for_build='
+trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
+trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
+: ${TMPDIR=/tmp} ;
+ { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
+ { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||
+ { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } ||
+ { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
+dummy=$tmp/dummy ;
+tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
+case $CC_FOR_BUILD,$HOST_CC,$CC in
+ ,,)    echo "int x;" > $dummy.c ;
+	for c in cc gcc c89 c99 ; do
+	  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
+	     CC_FOR_BUILD="$c"; break ;
+	  fi ;
+	done ;
+	if test x"$CC_FOR_BUILD" = x ; then
+	  CC_FOR_BUILD=no_compiler_found ;
+	fi
+	;;
+ ,,*)   CC_FOR_BUILD=$CC ;;
+ ,*,*)  CC_FOR_BUILD=$HOST_CC ;;
+esac ; set_cc_for_build= ;'
+
+# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
+# (ghazi@noc.rutgers.edu 1994-08-24)
+if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
+	PATH=$PATH:/.attbin ; export PATH
+fi
+
+UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
+UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
+UNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown
+UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown
+
+# Note: order is significant - the case branches are not exclusive.
+
+case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
+    *:NetBSD:*:*)
+	# NetBSD (nbsd) targets should (where applicable) match one or
+	# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,
+	# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently
+	# switched to ELF, *-*-netbsd* would select the old
+	# object file format.  This provides both forward
+	# compatibility and a consistent mechanism for selecting the
+	# object file format.
+	#
+	# Note: NetBSD doesn't particularly care about the vendor
+	# portion of the name.  We always set it to "unknown".
+	sysctl="sysctl -n hw.machine_arch"
+	UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \
+	    /usr/sbin/$sysctl 2>/dev/null || echo unknown)`
+	case "${UNAME_MACHINE_ARCH}" in
+	    armeb) machine=armeb-unknown ;;
+	    arm*) machine=arm-unknown ;;
+	    sh3el) machine=shl-unknown ;;
+	    sh3eb) machine=sh-unknown ;;
+	    sh5el) machine=sh5le-unknown ;;
+	    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
+	esac
+	# The Operating System including object format, if it has switched
+	# to ELF recently, or will in the future.
+	case "${UNAME_MACHINE_ARCH}" in
+	    arm*|i386|m68k|ns32k|sh3*|sparc|vax)
+		eval $set_cc_for_build
+		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
+			| grep -q __ELF__
+		then
+		    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
+		    # Return netbsd for either.  FIX?
+		    os=netbsd
+		else
+		    os=netbsdelf
+		fi
+		;;
+	    *)
+		os=netbsd
+		;;
+	esac
+	# The OS release
+	# Debian GNU/NetBSD machines have a different userland, and
+	# thus, need a distinct triplet. However, they do not need
+	# kernel version information, so it can be replaced with a
+	# suitable tag, in the style of linux-gnu.
+	case "${UNAME_VERSION}" in
+	    Debian*)
+		release='-gnu'
+		;;
+	    *)
+		release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'`
+		;;
+	esac
+	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
+	# contains redundant information, the shorter form:
+	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
+	echo "${machine}-${os}${release}"
+	exit ;;
+    *:OpenBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
+	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
+	exit ;;
+    *:ekkoBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
+	exit ;;
+    *:SolidBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
+	exit ;;
+    macppc:MirBSD:*:*)
+	echo powerpc-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+    *:MirBSD:*:*)
+	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
+	exit ;;
+    alpha:OSF1:*:*)
+	case $UNAME_RELEASE in
+	*4.0)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
+		;;
+	*5.*)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
+		;;
+	esac
+	# According to Compaq, /usr/sbin/psrinfo has been available on
+	# OSF/1 and Tru64 systems produced since 1995.  I hope that
+	# covers most systems running today.  This code pipes the CPU
+	# types through head -n 1, so we only detect the type of CPU 0.
+	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \(.*\) processor.*$/\1/p' | head -n 1`
+	case "$ALPHA_CPU_TYPE" in
+	    "EV4 (21064)")
+		UNAME_MACHINE="alpha" ;;
+	    "EV4.5 (21064)")
+		UNAME_MACHINE="alpha" ;;
+	    "LCA4 (21066/21068)")
+		UNAME_MACHINE="alpha" ;;
+	    "EV5 (21164)")
+		UNAME_MACHINE="alphaev5" ;;
+	    "EV5.6 (21164A)")
+		UNAME_MACHINE="alphaev56" ;;
+	    "EV5.6 (21164PC)")
+		UNAME_MACHINE="alphapca56" ;;
+	    "EV5.7 (21164PC)")
+		UNAME_MACHINE="alphapca57" ;;
+	    "EV6 (21264)")
+		UNAME_MACHINE="alphaev6" ;;
+	    "EV6.7 (21264A)")
+		UNAME_MACHINE="alphaev67" ;;
+	    "EV6.8CB (21264C)")
+		UNAME_MACHINE="alphaev68" ;;
+	    "EV6.8AL (21264B)")
+		UNAME_MACHINE="alphaev68" ;;
+	    "EV6.8CX (21264D)")
+		UNAME_MACHINE="alphaev68" ;;
+	    "EV6.9A (21264/EV69A)")
+		UNAME_MACHINE="alphaev69" ;;
+	    "EV7 (21364)")
+		UNAME_MACHINE="alphaev7" ;;
+	    "EV7.9 (21364A)")
+		UNAME_MACHINE="alphaev79" ;;
+	esac
+	# A Pn.n version is a patched version.
+	# A Vn.n version is a released version.
+	# A Tn.n version is a released field test version.
+	# A Xn.n version is an unreleased experimental baselevel.
+	# 1.2 uses "1.2" for uname -r.
+	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
+	# Reset EXIT trap before exiting to avoid spurious non-zero exit code.
+	exitcode=$?
+	trap '' 0
+	exit $exitcode ;;
+    Alpha\ *:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# Should we change UNAME_MACHINE based on the output of uname instead
+	# of the specific Alpha model?
+	echo alpha-pc-interix
+	exit ;;
+    21064:Windows_NT:50:3)
+	echo alpha-dec-winnt3.5
+	exit ;;
+    Amiga*:UNIX_System_V:4.0:*)
+	echo m68k-unknown-sysv4
+	exit ;;
+    *:[Aa]miga[Oo][Ss]:*:*)
+	echo ${UNAME_MACHINE}-unknown-amigaos
+	exit ;;
+    *:[Mm]orph[Oo][Ss]:*:*)
+	echo ${UNAME_MACHINE}-unknown-morphos
+	exit ;;
+    *:OS/390:*:*)
+	echo i370-ibm-openedition
+	exit ;;
+    *:z/VM:*:*)
+	echo s390-ibm-zvmoe
+	exit ;;
+    *:OS400:*:*)
+	echo powerpc-ibm-os400
+	exit ;;
+    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
+	echo arm-acorn-riscix${UNAME_RELEASE}
+	exit ;;
+    arm:riscos:*:*|arm:RISCOS:*:*)
+	echo arm-unknown-riscos
+	exit ;;
+    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
+	echo hppa1.1-hitachi-hiuxmpp
+	exit ;;
+    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
+	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
+	if test "`(/bin/universe) 2>/dev/null`" = att ; then
+		echo pyramid-pyramid-sysv3
+	else
+		echo pyramid-pyramid-bsd
+	fi
+	exit ;;
+    NILE*:*:*:dcosx)
+	echo pyramid-pyramid-svr4
+	exit ;;
+    DRS?6000:unix:4.0:6*)
+	echo sparc-icl-nx6
+	exit ;;
+    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
+	case `/usr/bin/uname -p` in
+	    sparc) echo sparc-icl-nx7; exit ;;
+	esac ;;
+    s390x:SunOS:*:*)
+	echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4H:SunOS:5.*:*)
+	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
+	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)
+	echo i386-pc-auroraux${UNAME_RELEASE}
+	exit ;;
+    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)
+	eval $set_cc_for_build
+	SUN_ARCH="i386"
+	# If there is a compiler, see if it is configured for 64-bit objects.
+	# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.
+	# This test works for both compilers.
+	if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then
+	    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \
+		(CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \
+		grep IS_64BIT_ARCH >/dev/null
+	    then
+		SUN_ARCH="x86_64"
+	    fi
+	fi
+	echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:6*:*)
+	# According to config.sub, this is the proper way to canonicalize
+	# SunOS6.  Hard to guess exactly what SunOS6 will be like, but
+	# it's likely to be more like Solaris than SunOS4.
+	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    sun4*:SunOS:*:*)
+	case "`/usr/bin/arch -k`" in
+	    Series*|S4*)
+		UNAME_RELEASE=`uname -v`
+		;;
+	esac
+	# Japanese Language versions have a version number like `4.1.3-JL'.
+	echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`
+	exit ;;
+    sun3*:SunOS:*:*)
+	echo m68k-sun-sunos${UNAME_RELEASE}
+	exit ;;
+    sun*:*:4.2BSD:*)
+	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
+	test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3
+	case "`/bin/arch`" in
+	    sun3)
+		echo m68k-sun-sunos${UNAME_RELEASE}
+		;;
+	    sun4)
+		echo sparc-sun-sunos${UNAME_RELEASE}
+		;;
+	esac
+	exit ;;
+    aushp:SunOS:*:*)
+	echo sparc-auspex-sunos${UNAME_RELEASE}
+	exit ;;
+    # The situation for MiNT is a little confusing.  The machine name
+    # can be virtually everything (everything which is not
+    # "atarist" or "atariste" at least should have a processor
+    # > m68000).  The system name ranges from "MiNT" over "FreeMiNT"
+    # to the lowercase version "mint" (or "freemint").  Finally
+    # the system name "TOS" denotes a system which is actually not
+    # MiNT.  But MiNT is downward compatible to TOS, so this should
+    # be no problem.
+    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
+	echo m68k-atari-mint${UNAME_RELEASE}
+	exit ;;
+    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
+	echo m68k-milan-mint${UNAME_RELEASE}
+	exit ;;
+    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
+	echo m68k-hades-mint${UNAME_RELEASE}
+	exit ;;
+    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
+	echo m68k-unknown-mint${UNAME_RELEASE}
+	exit ;;
+    m68k:machten:*:*)
+	echo m68k-apple-machten${UNAME_RELEASE}
+	exit ;;
+    powerpc:machten:*:*)
+	echo powerpc-apple-machten${UNAME_RELEASE}
+	exit ;;
+    RISC*:Mach:*:*)
+	echo mips-dec-mach_bsd4.3
+	exit ;;
+    RISC*:ULTRIX:*:*)
+	echo mips-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+    VAX*:ULTRIX*:*:*)
+	echo vax-dec-ultrix${UNAME_RELEASE}
+	exit ;;
+    2020:CLIX:*:* | 2430:CLIX:*:*)
+	echo clipper-intergraph-clix${UNAME_RELEASE}
+	exit ;;
+    mips:*:*:UMIPS | mips:*:*:RISCos)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+#ifdef __cplusplus
+#include <stdio.h>  /* for printf() prototype */
+	int main (int argc, char *argv[]) {
+#else
+	int main (argc, argv) int argc; char *argv[]; {
+#endif
+	#if defined (host_mips) && defined (MIPSEB)
+	#if defined (SYSTYPE_SYSV)
+	  printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_SVR4)
+	  printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
+	  printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0);
+	#endif
+	#endif
+	  exit (-1);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c &&
+	  dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` &&
+	  SYSTEM_NAME=`$dummy $dummyarg` &&
+	    { echo "$SYSTEM_NAME"; exit; }
+	echo mips-mips-riscos${UNAME_RELEASE}
+	exit ;;
+    Motorola:PowerMAX_OS:*:*)
+	echo powerpc-motorola-powermax
+	exit ;;
+    Motorola:*:4.3:PL8-*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:Power_UNIX:*:*)
+	echo powerpc-harris-powerunix
+	exit ;;
+    m88k:CX/UX:7*:*)
+	echo m88k-harris-cxux7
+	exit ;;
+    m88k:*:4*:R4*)
+	echo m88k-motorola-sysv4
+	exit ;;
+    m88k:*:3*:R3*)
+	echo m88k-motorola-sysv3
+	exit ;;
+    AViiON:dgux:*:*)
+	# DG/UX returns AViiON for all architectures
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]
+	then
+	    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \
+	       [ ${TARGET_BINARY_INTERFACE}x = x ]
+	    then
+		echo m88k-dg-dgux${UNAME_RELEASE}
+	    else
+		echo m88k-dg-dguxbcs${UNAME_RELEASE}
+	    fi
+	else
+	    echo i586-dg-dgux${UNAME_RELEASE}
+	fi
+	exit ;;
+    M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
+	echo m88k-dolphin-sysv3
+	exit ;;
+    M88*:*:R3*:*)
+	# Delta 88k system running SVR3
+	echo m88k-motorola-sysv3
+	exit ;;
+    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
+	echo m88k-tektronix-sysv3
+	exit ;;
+    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
+	echo m68k-tektronix-bsd
+	exit ;;
+    *:IRIX*:*:*)
+	echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`
+	exit ;;
+    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
+	echo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id
+	exit ;;               # Note that: echo "'`uname -s`'" gives 'AIX '
+    i*86:AIX:*:*)
+	echo i386-ibm-aix
+	exit ;;
+    ia64:AIX:*:*)
+	if [ -x /usr/bin/oslevel ] ; then
+		IBM_REV=`/usr/bin/oslevel`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
+	exit ;;
+    *:AIX:2:3)
+	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
+		eval $set_cc_for_build
+		sed 's/^		//' << EOF >$dummy.c
+		#include <sys/systemcfg.h>
+
+		main()
+			{
+			if (!__power_pc())
+				exit(1);
+			puts("powerpc-ibm-aix3.2.5");
+			exit(0);
+			}
+EOF
+		if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
+		then
+			echo "$SYSTEM_NAME"
+		else
+			echo rs6000-ibm-aix3.2.5
+		fi
+	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
+		echo rs6000-ibm-aix3.2.4
+	else
+		echo rs6000-ibm-aix3.2
+	fi
+	exit ;;
+    *:AIX:*:[4567])
+	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
+	if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then
+		IBM_ARCH=rs6000
+	else
+		IBM_ARCH=powerpc
+	fi
+	if [ -x /usr/bin/oslevel ] ; then
+		IBM_REV=`/usr/bin/oslevel`
+	else
+		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
+	fi
+	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
+	exit ;;
+    *:AIX:*:*)
+	echo rs6000-ibm-aix
+	exit ;;
+    ibmrt:4.4BSD:*|romp-ibm:BSD:*)
+	echo romp-ibm-bsd4.4
+	exit ;;
+    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and
+	echo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to
+	exit ;;                             # report: romp-ibm BSD 4.3
+    *:BOSX:*:*)
+	echo rs6000-bull-bosx
+	exit ;;
+    DPX/2?00:B.O.S.:*:*)
+	echo m68k-bull-sysv3
+	exit ;;
+    9000/[34]??:4.3bsd:1.*:*)
+	echo m68k-hp-bsd
+	exit ;;
+    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)
+	echo m68k-hp-bsd4.4
+	exit ;;
+    9000/[34678]??:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
+	case "${UNAME_MACHINE}" in
+	    9000/31? )            HP_ARCH=m68000 ;;
+	    9000/[34]?? )         HP_ARCH=m68k ;;
+	    9000/[678][0-9][0-9])
+		if [ -x /usr/bin/getconf ]; then
+		    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
+		    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
+		    case "${sc_cpu_version}" in
+		      523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0
+		      528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1
+		      532)                      # CPU_PA_RISC2_0
+			case "${sc_kernel_bits}" in
+			  32) HP_ARCH="hppa2.0n" ;;
+			  64) HP_ARCH="hppa2.0w" ;;
+			  '') HP_ARCH="hppa2.0" ;;   # HP-UX 10.20
+			esac ;;
+		    esac
+		fi
+		if [ "${HP_ARCH}" = "" ]; then
+		    eval $set_cc_for_build
+		    sed 's/^		//' << EOF >$dummy.c
+
+		#define _HPUX_SOURCE
+		#include <stdlib.h>
+		#include <unistd.h>
+
+		int main ()
+		{
+		#if defined(_SC_KERNEL_BITS)
+		    long bits = sysconf(_SC_KERNEL_BITS);
+		#endif
+		    long cpu  = sysconf (_SC_CPU_VERSION);
+
+		    switch (cpu)
+			{
+			case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
+			case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
+			case CPU_PA_RISC2_0:
+		#if defined(_SC_KERNEL_BITS)
+			    switch (bits)
+				{
+				case 64: puts ("hppa2.0w"); break;
+				case 32: puts ("hppa2.0n"); break;
+				default: puts ("hppa2.0"); break;
+				} break;
+		#else  /* !defined(_SC_KERNEL_BITS) */
+			    puts ("hppa2.0"); break;
+		#endif
+			default: puts ("hppa1.0"); break;
+			}
+		    exit (0);
+		}
+EOF
+		    (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
+		    test -z "$HP_ARCH" && HP_ARCH=hppa
+		fi ;;
+	esac
+	if [ ${HP_ARCH} = "hppa2.0w" ]
+	then
+	    eval $set_cc_for_build
+
+	    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
+	    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler
+	    # generating 64-bit code.  GNU and HP use different nomenclature:
+	    #
+	    # $ CC_FOR_BUILD=cc ./config.guess
+	    # => hppa2.0w-hp-hpux11.23
+	    # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
+	    # => hppa64-hp-hpux11.23
+
+	    if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) |
+		grep -q __LP64__
+	    then
+		HP_ARCH="hppa2.0w"
+	    else
+		HP_ARCH="hppa64"
+	    fi
+	fi
+	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
+	exit ;;
+    ia64:HP-UX:*:*)
+	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
+	echo ia64-hp-hpux${HPUX_REV}
+	exit ;;
+    3050*:HI-UX:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#include <unistd.h>
+	int
+	main ()
+	{
+	  long cpu = sysconf (_SC_CPU_VERSION);
+	  /* The order matters, because CPU_IS_HP_MC68K erroneously returns
+	     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct
+	     results, however.  */
+	  if (CPU_IS_PA_RISC (cpu))
+	    {
+	      switch (cpu)
+		{
+		  case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
+		  default: puts ("hppa-hitachi-hiuxwe2"); break;
+		}
+	    }
+	  else if (CPU_IS_HP_MC68K (cpu))
+	    puts ("m68k-hitachi-hiuxwe2");
+	  else puts ("unknown-hitachi-hiuxwe2");
+	  exit (0);
+	}
+EOF
+	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
+		{ echo "$SYSTEM_NAME"; exit; }
+	echo unknown-hitachi-hiuxwe2
+	exit ;;
+    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* )
+	echo hppa1.1-hp-bsd
+	exit ;;
+    9000/8??:4.3bsd:*:*)
+	echo hppa1.0-hp-bsd
+	exit ;;
+    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
+	echo hppa1.0-hp-mpeix
+	exit ;;
+    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* )
+	echo hppa1.1-hp-osf
+	exit ;;
+    hp8??:OSF1:*:*)
+	echo hppa1.0-hp-osf
+	exit ;;
+    i*86:OSF1:*:*)
+	if [ -x /usr/sbin/sysversion ] ; then
+	    echo ${UNAME_MACHINE}-unknown-osf1mk
+	else
+	    echo ${UNAME_MACHINE}-unknown-osf1
+	fi
+	exit ;;
+    parisc*:Lites*:*:*)
+	echo hppa1.1-hp-lites
+	exit ;;
+    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
+	echo c1-convex-bsd
+	exit ;;
+    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
+	if getsysinfo -f scalar_acc
+	then echo c32-convex-bsd
+	else echo c2-convex-bsd
+	fi
+	exit ;;
+    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
+	echo c34-convex-bsd
+	exit ;;
+    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
+	echo c38-convex-bsd
+	exit ;;
+    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
+	echo c4-convex-bsd
+	exit ;;
+    CRAY*Y-MP:*:*:*)
+	echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*[A-Z]90:*:*:*)
+	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
+	| sed -e 's/CRAY.*\([A-Z]90\)/\1/' \
+	      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
+	      -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*TS:*:*:*)
+	echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*T3E:*:*:*)
+	echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*SV1:*:*:*)
+	echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    *:UNICOS/mp:*:*)
+	echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
+	FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
+	FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`
+	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    5000:UNIX_System_V:4.*:*)
+	FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'`
+	FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'`
+	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
+	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
+	exit ;;
+    sparc*:BSD/OS:*:*)
+	echo sparc-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+    *:BSD/OS:*:*)
+	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
+	exit ;;
+    *:FreeBSD:*:*)
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	case ${UNAME_PROCESSOR} in
+	    amd64)
+		echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
+	    *)
+		echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
+	esac
+	exit ;;
+    i*:CYGWIN*:*)
+	echo ${UNAME_MACHINE}-pc-cygwin
+	exit ;;
+    *:MINGW*:*)
+	echo ${UNAME_MACHINE}-pc-mingw32
+	exit ;;
+    i*:MSYS*:*)
+	echo ${UNAME_MACHINE}-pc-msys
+	exit ;;
+    i*:windows32*:*)
+	# uname -m includes "-pc" on this system.
+	echo ${UNAME_MACHINE}-mingw32
+	exit ;;
+    i*:PW*:*)
+	echo ${UNAME_MACHINE}-pc-pw32
+	exit ;;
+    *:Interix*:*)
+	case ${UNAME_MACHINE} in
+	    x86)
+		echo i586-pc-interix${UNAME_RELEASE}
+		exit ;;
+	    authenticamd | genuineintel | EM64T)
+		echo x86_64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	    IA64)
+		echo ia64-unknown-interix${UNAME_RELEASE}
+		exit ;;
+	esac ;;
+    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)
+	echo i${UNAME_MACHINE}-pc-mks
+	exit ;;
+    8664:Windows_NT:*)
+	echo x86_64-pc-mks
+	exit ;;
+    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
+	# How do we know it's Interix rather than the generic POSIX subsystem?
+	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
+	# UNAME_MACHINE based on the output of uname instead of i386?
+	echo i586-pc-interix
+	exit ;;
+    i*:UWIN*:*)
+	echo ${UNAME_MACHINE}-pc-uwin
+	exit ;;
+    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
+	echo x86_64-unknown-cygwin
+	exit ;;
+    p*:CYGWIN*:*)
+	echo powerpcle-unknown-cygwin
+	exit ;;
+    prep*:SunOS:5.*:*)
+	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
+	exit ;;
+    *:GNU:*:*)
+	# the GNU system
+	echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`
+	exit ;;
+    *:GNU/*:*:*)
+	# other systems with GNU libc and userland
+	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu
+	exit ;;
+    i*86:Minix:*:*)
+	echo ${UNAME_MACHINE}-pc-minix
+	exit ;;
+    aarch64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    aarch64_be:Linux:*:*)
+	UNAME_MACHINE=aarch64_be
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    alpha:Linux:*:*)
+	case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in
+	  EV5)   UNAME_MACHINE=alphaev5 ;;
+	  EV56)  UNAME_MACHINE=alphaev56 ;;
+	  PCA56) UNAME_MACHINE=alphapca56 ;;
+	  PCA57) UNAME_MACHINE=alphapca56 ;;
+	  EV6)   UNAME_MACHINE=alphaev6 ;;
+	  EV67)  UNAME_MACHINE=alphaev67 ;;
+	  EV68*) UNAME_MACHINE=alphaev68 ;;
+	esac
+	objdump --private-headers /bin/sh | grep -q ld.so.1
+	if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi
+	echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC}
+	exit ;;
+    arm*:Linux:*:*)
+	eval $set_cc_for_build
+	if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \
+	    | grep -q __ARM_EABI__
+	then
+	    echo ${UNAME_MACHINE}-unknown-linux-gnu
+	else
+	    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
+		| grep -q __ARM_PCS_VFP
+	    then
+		echo ${UNAME_MACHINE}-unknown-linux-gnueabi
+	    else
+		echo ${UNAME_MACHINE}-unknown-linux-gnueabihf
+	    fi
+	fi
+	exit ;;
+    avr32*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    cris:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-gnu
+	exit ;;
+    crisv32:Linux:*:*)
+	echo ${UNAME_MACHINE}-axis-linux-gnu
+	exit ;;
+    frv:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    hexagon:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    i*86:Linux:*:*)
+	LIBC=gnu
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#ifdef __dietlibc__
+	LIBC=dietlibc
+	#endif
+EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'`
+	echo "${UNAME_MACHINE}-pc-linux-${LIBC}"
+	exit ;;
+    ia64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    m32r*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    m68*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    mips:Linux:*:* | mips64:Linux:*:*)
+	eval $set_cc_for_build
+	sed 's/^	//' << EOF >$dummy.c
+	#undef CPU
+	#undef ${UNAME_MACHINE}
+	#undef ${UNAME_MACHINE}el
+	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
+	CPU=${UNAME_MACHINE}el
+	#else
+	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
+	CPU=${UNAME_MACHINE}
+	#else
+	CPU=
+	#endif
+	#endif
+EOF
+	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'`
+	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; }
+	;;
+    or32:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    padre:Linux:*:*)
+	echo sparc-unknown-linux-gnu
+	exit ;;
+    parisc64:Linux:*:* | hppa64:Linux:*:*)
+	echo hppa64-unknown-linux-gnu
+	exit ;;
+    parisc:Linux:*:* | hppa:Linux:*:*)
+	# Look for CPU level
+	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
+	  PA7*) echo hppa1.1-unknown-linux-gnu ;;
+	  PA8*) echo hppa2.0-unknown-linux-gnu ;;
+	  *)    echo hppa-unknown-linux-gnu ;;
+	esac
+	exit ;;
+    ppc64:Linux:*:*)
+	echo powerpc64-unknown-linux-gnu
+	exit ;;
+    ppc:Linux:*:*)
+	echo powerpc-unknown-linux-gnu
+	exit ;;
+    s390:Linux:*:* | s390x:Linux:*:*)
+	echo ${UNAME_MACHINE}-ibm-linux
+	exit ;;
+    sh64*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    sh*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    sparc:Linux:*:* | sparc64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    tile*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    vax:Linux:*:*)
+	echo ${UNAME_MACHINE}-dec-linux-gnu
+	exit ;;
+    x86_64:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    xtensa*:Linux:*:*)
+	echo ${UNAME_MACHINE}-unknown-linux-gnu
+	exit ;;
+    i*86:DYNIX/ptx:4*:*)
+	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
+	# earlier versions are messed up and put the nodename in both
+	# sysname and nodename.
+	echo i386-sequent-sysv4
+	exit ;;
+    i*86:UNIX_SV:4.2MP:2.*)
+	# Unixware is an offshoot of SVR4, but it has its own version
+	# number series starting with 2...
+	# I am not positive that other SVR4 systems won't match this,
+	# I just have to hope.  -- rms.
+	# Use sysv4.2uw... so that sysv4* matches it.
+	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
+	exit ;;
+    i*86:OS/2:*:*)
+	# If we were able to find `uname', then EMX Unix compatibility
+	# is probably installed.
+	echo ${UNAME_MACHINE}-pc-os2-emx
+	exit ;;
+    i*86:XTS-300:*:STOP)
+	echo ${UNAME_MACHINE}-unknown-stop
+	exit ;;
+    i*86:atheos:*:*)
+	echo ${UNAME_MACHINE}-unknown-atheos
+	exit ;;
+    i*86:syllable:*:*)
+	echo ${UNAME_MACHINE}-pc-syllable
+	exit ;;
+    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)
+	echo i386-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    i*86:*DOS:*:*)
+	echo ${UNAME_MACHINE}-pc-msdosdjgpp
+	exit ;;
+    i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)
+	UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'`
+	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
+		echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
+	else
+		echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
+	fi
+	exit ;;
+    i*86:*:5:[678]*)
+	# UnixWare 7.x, OpenUNIX and OpenServer 6.
+	case `/bin/uname -X | grep "^Machine"` in
+	    *486*)	     UNAME_MACHINE=i486 ;;
+	    *Pentium)	     UNAME_MACHINE=i586 ;;
+	    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
+	esac
+	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
+	exit ;;
+    i*86:*:3.2:*)
+	if test -f /usr/options/cb.name; then
+		UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
+		echo ${UNAME_MACHINE}-pc-isc$UNAME_REL
+	elif /bin/uname -X 2>/dev/null >/dev/null ; then
+		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
+		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
+		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
+			&& UNAME_MACHINE=i586
+		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
+	else
+		echo ${UNAME_MACHINE}-pc-sysv32
+	fi
+	exit ;;
+    pc:*:*:*)
+	# Left here for compatibility:
+	# uname -m prints for DJGPP always 'pc', but it prints nothing about
+	# the processor, so we play safe by assuming i586.
+	# Note: whatever this is, it MUST be the same as what config.sub
+	# prints for the "djgpp" host, or else GDB configury will decide that
+	# this is a cross-build.
+	echo i586-pc-msdosdjgpp
+	exit ;;
+    Intel:Mach:3*:*)
+	echo i386-pc-mach3
+	exit ;;
+    paragon:*:*:*)
+	echo i860-intel-osf1
+	exit ;;
+    i860:*:4.*:*) # i860-SVR4
+	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
+	  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
+	else # Add other i860-SVR4 vendors below as they are discovered.
+	  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4
+	fi
+	exit ;;
+    mini*:CTIX:SYS*5:*)
+	# "miniframe"
+	echo m68010-convergent-sysv
+	exit ;;
+    mc68k:UNIX:SYSTEM5:3.51m)
+	echo m68k-convergent-sysv
+	exit ;;
+    M680?0:D-NIX:5.3:*)
+	echo m68k-diab-dnix
+	exit ;;
+    M68*:*:R3V[5678]*:*)
+	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
+    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
+	OS_REL=''
+	test -r /etc/.relid \
+	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4; exit; } ;;
+    NCR*:*:4.2:* | MPRAS*:*:4.2:*)
+	OS_REL='.3'
+	test -r /etc/.relid \
+	    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	    && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \
+	    && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
+    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
+	echo m68k-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    mc68030:UNIX_System_V:4.*:*)
+	echo m68k-atari-sysv4
+	exit ;;
+    TSUNAMI:LynxOS:2.*:*)
+	echo sparc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    rs6000:LynxOS:2.*:*)
+	echo rs6000-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)
+	echo powerpc-unknown-lynxos${UNAME_RELEASE}
+	exit ;;
+    SM[BE]S:UNIX_SV:*:*)
+	echo mips-dde-sysv${UNAME_RELEASE}
+	exit ;;
+    RM*:ReliantUNIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    RM*:SINIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    *:SINIX-*:*:*)
+	if uname -p 2>/dev/null >/dev/null ; then
+		UNAME_MACHINE=`(uname -p) 2>/dev/null`
+		echo ${UNAME_MACHINE}-sni-sysv4
+	else
+		echo ns32k-sni-sysv
+	fi
+	exit ;;
+    PENTIUM:*:4.0*:*)	# Unisys `ClearPath HMP IX 4000' SVR4/MP effort
+			# says <Richard.M.Bartel@ccMail.Census.GOV>
+	echo i586-unisys-sysv4
+	exit ;;
+    *:UNIX_System_V:4*:FTX*)
+	# From Gerald Hewes <hewes@openmarket.com>.
+	# How about differentiating between stratus architectures? -djm
+	echo hppa1.1-stratus-sysv4
+	exit ;;
+    *:*:*:FTX*)
+	# From seanf@swdc.stratus.com.
+	echo i860-stratus-sysv4
+	exit ;;
+    i*86:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo ${UNAME_MACHINE}-stratus-vos
+	exit ;;
+    *:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo hppa1.1-stratus-vos
+	exit ;;
+    mc68*:A/UX:*:*)
+	echo m68k-apple-aux${UNAME_RELEASE}
+	exit ;;
+    news*:NEWS-OS:6*:*)
+	echo mips-sony-newsos6
+	exit ;;
+    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
+	if [ -d /usr/nec ]; then
+		echo mips-nec-sysv${UNAME_RELEASE}
+	else
+		echo mips-unknown-sysv${UNAME_RELEASE}
+	fi
+	exit ;;
+    BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
+	echo powerpc-be-beos
+	exit ;;
+    BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
+	echo powerpc-apple-beos
+	exit ;;
+    BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
+	echo i586-pc-beos
+	exit ;;
+    BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
+	echo i586-pc-haiku
+	exit ;;
+    SX-4:SUPER-UX:*:*)
+	echo sx4-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-5:SUPER-UX:*:*)
+	echo sx5-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-6:SUPER-UX:*:*)
+	echo sx6-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-7:SUPER-UX:*:*)
+	echo sx7-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-8:SUPER-UX:*:*)
+	echo sx8-nec-superux${UNAME_RELEASE}
+	exit ;;
+    SX-8R:SUPER-UX:*:*)
+	echo sx8r-nec-superux${UNAME_RELEASE}
+	exit ;;
+    Power*:Rhapsody:*:*)
+	echo powerpc-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+    *:Rhapsody:*:*)
+	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
+	exit ;;
+    *:Darwin:*:*)
+	UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown
+	case $UNAME_PROCESSOR in
+	    i386)
+		eval $set_cc_for_build
+		if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then
+		  if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \
+		      (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \
+		      grep IS_64BIT_ARCH >/dev/null
+		  then
+		      UNAME_PROCESSOR="x86_64"
+		  fi
+		fi ;;
+	    unknown) UNAME_PROCESSOR=powerpc ;;
+	esac
+	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
+	exit ;;
+    *:procnto*:*:* | *:QNX:[0123456789]*:*)
+	UNAME_PROCESSOR=`uname -p`
+	if test "$UNAME_PROCESSOR" = "x86"; then
+		UNAME_PROCESSOR=i386
+		UNAME_MACHINE=pc
+	fi
+	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
+	exit ;;
+    *:QNX:*:4*)
+	echo i386-pc-qnx
+	exit ;;
+    NEO-?:NONSTOP_KERNEL:*:*)
+	echo neo-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    NSE-?:NONSTOP_KERNEL:*:*)
+	echo nse-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    NSR-?:NONSTOP_KERNEL:*:*)
+	echo nsr-tandem-nsk${UNAME_RELEASE}
+	exit ;;
+    *:NonStop-UX:*:*)
+	echo mips-compaq-nonstopux
+	exit ;;
+    BS2000:POSIX*:*:*)
+	echo bs2000-siemens-sysv
+	exit ;;
+    DS/*:UNIX_System_V:*:*)
+	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
+	exit ;;
+    *:Plan9:*:*)
+	# "uname -m" is not consistent, so use $cputype instead. 386
+	# is converted to i386 for consistency with other x86
+	# operating systems.
+	if test "$cputype" = "386"; then
+	    UNAME_MACHINE=i386
+	else
+	    UNAME_MACHINE="$cputype"
+	fi
+	echo ${UNAME_MACHINE}-unknown-plan9
+	exit ;;
+    *:TOPS-10:*:*)
+	echo pdp10-unknown-tops10
+	exit ;;
+    *:TENEX:*:*)
+	echo pdp10-unknown-tenex
+	exit ;;
+    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
+	echo pdp10-dec-tops20
+	exit ;;
+    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
+	echo pdp10-xkl-tops20
+	exit ;;
+    *:TOPS-20:*:*)
+	echo pdp10-unknown-tops20
+	exit ;;
+    *:ITS:*:*)
+	echo pdp10-unknown-its
+	exit ;;
+    SEI:*:*:SEIUX)
+	echo mips-sei-seiux${UNAME_RELEASE}
+	exit ;;
+    *:DragonFly:*:*)
+	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`
+	exit ;;
+    *:*VMS:*:*)
+	UNAME_MACHINE=`(uname -p) 2>/dev/null`
+	case "${UNAME_MACHINE}" in
+	    A*) echo alpha-dec-vms ; exit ;;
+	    I*) echo ia64-dec-vms ; exit ;;
+	    V*) echo vax-dec-vms ; exit ;;
+	esac ;;
+    *:XENIX:*:SysV)
+	echo i386-pc-xenix
+	exit ;;
+    i*86:skyos:*:*)
+	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//'
+	exit ;;
+    i*86:rdos:*:*)
+	echo ${UNAME_MACHINE}-pc-rdos
+	exit ;;
+    i*86:AROS:*:*)
+	echo ${UNAME_MACHINE}-pc-aros
+	exit ;;
+    x86_64:VMkernel:*:*)
+	echo ${UNAME_MACHINE}-unknown-esx
+	exit ;;
+esac
+
+#echo '(No uname command or uname output not recognized.)' 1>&2
+#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2
+
+eval $set_cc_for_build
+cat >$dummy.c <<EOF
+#ifdef _SEQUENT_
+# include <sys/types.h>
+# include <sys/utsname.h>
+#endif
+main ()
+{
+#if defined (sony)
+#if defined (MIPSEB)
+  /* BFD wants "bsd" instead of "newsos".  Perhaps BFD should be changed,
+     I don't know....  */
+  printf ("mips-sony-bsd\n"); exit (0);
+#else
+#include <sys/param.h>
+  printf ("m68k-sony-newsos%s\n",
+#ifdef NEWSOS4
+	"4"
+#else
+	""
+#endif
+	); exit (0);
+#endif
+#endif
+
+#if defined (__arm) && defined (__acorn) && defined (__unix)
+  printf ("arm-acorn-riscix\n"); exit (0);
+#endif
+
+#if defined (hp300) && !defined (hpux)
+  printf ("m68k-hp-bsd\n"); exit (0);
+#endif
+
+#if defined (NeXT)
+#if !defined (__ARCHITECTURE__)
+#define __ARCHITECTURE__ "m68k"
+#endif
+  int version;
+  version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`;
+  if (version < 4)
+    printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version);
+  else
+    printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version);
+  exit (0);
+#endif
+
+#if defined (MULTIMAX) || defined (n16)
+#if defined (UMAXV)
+  printf ("ns32k-encore-sysv\n"); exit (0);
+#else
+#if defined (CMU)
+  printf ("ns32k-encore-mach\n"); exit (0);
+#else
+  printf ("ns32k-encore-bsd\n"); exit (0);
+#endif
+#endif
+#endif
+
+#if defined (__386BSD__)
+  printf ("i386-pc-bsd\n"); exit (0);
+#endif
+
+#if defined (sequent)
+#if defined (i386)
+  printf ("i386-sequent-dynix\n"); exit (0);
+#endif
+#if defined (ns32000)
+  printf ("ns32k-sequent-dynix\n"); exit (0);
+#endif
+#endif
+
+#if defined (_SEQUENT_)
+    struct utsname un;
+
+    uname(&un);
+
+    if (strncmp(un.version, "V2", 2) == 0) {
+	printf ("i386-sequent-ptx2\n"); exit (0);
+    }
+    if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */
+	printf ("i386-sequent-ptx1\n"); exit (0);
+    }
+    printf ("i386-sequent-ptx\n"); exit (0);
+
+#endif
+
+#if defined (vax)
+# if !defined (ultrix)
+#  include <sys/param.h>
+#  if defined (BSD)
+#   if BSD == 43
+      printf ("vax-dec-bsd4.3\n"); exit (0);
+#   else
+#    if BSD == 199006
+      printf ("vax-dec-bsd4.3reno\n"); exit (0);
+#    else
+      printf ("vax-dec-bsd\n"); exit (0);
+#    endif
+#   endif
+#  else
+    printf ("vax-dec-bsd\n"); exit (0);
+#  endif
+# else
+    printf ("vax-dec-ultrix\n"); exit (0);
+# endif
+#endif
+
+#if defined (alliant) && defined (i860)
+  printf ("i860-alliant-bsd\n"); exit (0);
+#endif
+
+  exit (1);
+}
+EOF
+
+$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` &&
+	{ echo "$SYSTEM_NAME"; exit; }
+
+# Apollos put the system type in the environment.
+
+test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; }
+
+# Convex versions that predate uname can use getsysinfo(1)
+
+if [ -x /usr/convex/getsysinfo ]
+then
+    case `getsysinfo -f cpu_type` in
+    c1*)
+	echo c1-convex-bsd
+	exit ;;
+    c2*)
+	if getsysinfo -f scalar_acc
+	then echo c32-convex-bsd
+	else echo c2-convex-bsd
+	fi
+	exit ;;
+    c34*)
+	echo c34-convex-bsd
+	exit ;;
+    c38*)
+	echo c38-convex-bsd
+	exit ;;
+    c4*)
+	echo c4-convex-bsd
+	exit ;;
+    esac
+fi
+
+cat >&2 <<EOF
+$0: unable to guess system type
+
+This script, last modified $timestamp, has failed to recognize
+the operating system you are using. It is advised that you
+download the most up to date version of the config scripts from
+
+  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD
+and
+  http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD
+
+If the version you run ($0) is already up to date, please
+send the following data and any information you think might be
+pertinent to <config-patches@gnu.org> in order to provide the needed
+information to handle your system.
+
+config.guess timestamp = $timestamp
+
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`
+
+hostinfo               = `(hostinfo) 2>/dev/null`
+/bin/universe          = `(/bin/universe) 2>/dev/null`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`
+/bin/arch              = `(/bin/arch) 2>/dev/null`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
+
+UNAME_MACHINE = ${UNAME_MACHINE}
+UNAME_RELEASE = ${UNAME_RELEASE}
+UNAME_SYSTEM  = ${UNAME_SYSTEM}
+UNAME_VERSION = ${UNAME_VERSION}
+EOF
+
+exit 1
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff -Nru igraph-0.6.5~quantal1/config.h.in igraph-0.6.5/config.h.in
--- igraph-0.6.5~quantal1/config.h.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/config.h.in	2013-03-03 01:29:38.000000000 +0000
@@ -0,0 +1,178 @@
+/* config.h.in.  Generated from configure.ac by autoheader.  */
+
+/* Define to 1 if you have the <dlfcn.h> header file. */
+#undef HAVE_DLFCN_H
+
+/* Define to 1 if you have the `expm1' function. */
+#undef HAVE_EXPM1
+
+/* Define to 1 if you have the `fabsl' function. */
+#undef HAVE_FABSL
+
+/* Define to 1 if you have the `finite' function. */
+#undef HAVE_FINITE
+
+/* Define to 1 if you have the `fmin' function. */
+#undef HAVE_FMIN
+
+/* Define to 1 if you have the `ftruncate' function. */
+#undef HAVE_FTRUNCATE
+
+/* Define to 1 if you have the GLPK library */
+#undef HAVE_GLPK
+
+/* Define to 1 if you have the GMP library */
+#undef HAVE_GMP
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+#undef HAVE_INTTYPES_H
+
+/* Define to 1 if you have the `isnan' function. */
+#undef HAVE_ISNAN
+
+/* Define to 1 if you have the `arpack' library (-larpack). */
+#undef HAVE_LIBARPACK
+
+/* Define to 1 if you have the `blas' library (-lblas). */
+#undef HAVE_LIBBLAS
+
+/* Define to 1 if you have the `f2c' library (-lf2c). */
+#undef HAVE_LIBF2C
+
+/* Define to 1 if you have the `lapack' library (-llapack). */
+#undef HAVE_LIBLAPACK
+
+/* Define to 1 if you have the libxml2 libraries installed */
+#undef HAVE_LIBXML
+
+/* Define to 1 if you have the `log1p' function. */
+#undef HAVE_LOG1P
+
+/* Define to 1 if you have the `log2' function. */
+#undef HAVE_LOG2
+
+/* Define to 1 if you have the `logbl' function. */
+#undef HAVE_LOGBL
+
+/* Define to 1 if you have the <memory.h> header file. */
+#undef HAVE_MEMORY_H
+
+/* Define to 1 if you have the `rint' function. */
+#undef HAVE_RINT
+
+/* Define to 1 if you have the `rintf' function. */
+#undef HAVE_RINTF
+
+/* Define to 1 if you have the `round' function. */
+#undef HAVE_ROUND
+
+/* Define to 1 if you have the `snprintf' function. */
+#undef HAVE_SNPRINTF
+
+/* Define to 1 if you have the <stdarg.h> header file. */
+#undef HAVE_STDARG_H
+
+/* Define to 1 if you have the <stdint.h> header file. */
+#undef HAVE_STDINT_H
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+#undef HAVE_STDLIB_H
+
+/* Define to 1 if you have the `stpcpy' function. */
+#undef HAVE_STPCPY
+
+/* Define to 1 if you have the `strcasecmp' function. */
+#undef HAVE_STRCASECMP
+
+/* Define to 1 if you have the `strdup' function. */
+#undef HAVE_STRDUP
+
+/* Define to 1 if you have the <strings.h> header file. */
+#undef HAVE_STRINGS_H
+
+/* Define to 1 if you have the <string.h> header file. */
+#undef HAVE_STRING_H
+
+/* Define to 1 if you have the <sys/int_types.h> header file. */
+#undef HAVE_SYS_INT_TYPES_H
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+#undef HAVE_SYS_STAT_H
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+#undef HAVE_SYS_TYPES_H
+
+/* Define to 1 if you have the sys/times.h header */
+#undef HAVE_TIMES_H
+
+/* Define to 1 if you have the <time.h> header file. */
+#undef HAVE_TIME_H
+
+/* Define to 1 if you want to use thread-local storage for global igraph
+   structures */
+#undef HAVE_TLS
+
+/* Define to 1 if you have the <unistd.h> header file. */
+#undef HAVE_UNISTD_H
+
+/* Define to 1 if you have the `_strdup' function. */
+#undef HAVE__STRDUP
+
+/* Keyword for thread local storage, or just static if not available */
+#undef IGRAPH_F77_SAVE
+
+/* Keyword for thread local storage, or empty if not available */
+#undef IGRAPH_THREAD_LOCAL
+
+/* Define to 1 if you use the internal ARPACK library */
+#undef INTERNAL_ARPACK
+
+/* Define to 1 if you use the internal BLAS library */
+#undef INTERNAL_BLAS
+
+/* Define to 1 if you use the internal F2C library */
+#undef INTERNAL_F2C
+
+/* Define to 1 if you use the internal GLPK library */
+#undef INTERNAL_GLPK
+
+/* Define to 1 if you use the internal LAPACK library */
+#undef INTERNAL_LAPACK
+
+/* Define to the sub-directory in which libtool stores uninstalled libraries.
+   */
+#undef LT_OBJDIR
+
+/* Name of package */
+#undef PACKAGE
+
+/* Define to the address where bug reports for this package should be sent. */
+#undef PACKAGE_BUGREPORT
+
+/* Define to the full name of this package. */
+#undef PACKAGE_NAME
+
+/* Define to the full name and version of this package. */
+#undef PACKAGE_STRING
+
+/* Define to the one symbol short name of this package. */
+#undef PACKAGE_TARNAME
+
+/* Define to the home page for this package. */
+#undef PACKAGE_URL
+
+/* Define to the version of this package. */
+#undef PACKAGE_VERSION
+
+/* Define to 1 if you have the ANSI C header files. */
+#undef STDC_HEADERS
+
+/* If the compiler supports a TLS storage class define it to that here */
+#undef TLS
+
+/* Version number of package */
+#undef VERSION
+
+/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
+   `char[]'. */
+#undef YYTEXT_POINTER
diff -Nru igraph-0.6.5~quantal1/config.sub igraph-0.6.5/config.sub
--- igraph-0.6.5~quantal1/config.sub	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/config.sub	2013-03-03 01:29:38.000000000 +0000
@@ -0,0 +1,1773 @@
+#! /bin/sh
+# Configuration validation subroutine script.
+#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
+#   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
+#   2011, 2012 Free Software Foundation, Inc.
+
+timestamp='2012-02-10'
+
+# This file is (in principle) common to ALL GNU software.
+# The presence of a machine in this file suggests that SOME GNU software
+# can handle that machine.  It does not imply ALL GNU software can.
+#
+# This file 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 2 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/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+
+# Please send patches to <config-patches@gnu.org>.  Submit a context
+# diff and a properly formatted GNU ChangeLog entry.
+#
+# Configuration subroutine to validate and canonicalize a configuration type.
+# Supply the specified configuration type as an argument.
+# If it is invalid, we print an error message on stderr and exit with code 1.
+# Otherwise, we print the canonical config type on stdout and succeed.
+
+# You can get the latest version of this script from:
+# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD
+
+# This file is supposed to be the same for all GNU packages
+# and recognize all the CPU types, system types and aliases
+# that are meaningful with *any* GNU software.
+# Each package is responsible for reporting which valid configurations
+# it does not support.  The user should be able to distinguish
+# a failure to support a valid configuration from a meaningless
+# configuration.
+
+# The goal of this file is to map all the various variations of a given
+# machine specification into a single specification in the form:
+#	CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
+# or in some cases, the newer four-part form:
+#	CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
+# It is wrong to echo any other type of specification.
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION] CPU-MFR-OPSYS
+       $0 [OPTION] ALIAS
+
+Canonicalize a configuration name.
+
+Operation modes:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.sub ($timestamp)
+
+Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
+2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
+Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help"
+       exit 1 ;;
+
+    *local*)
+       # First pass through any local machine types.
+       echo $1
+       exit ;;
+
+    * )
+       break ;;
+  esac
+done
+
+case $# in
+ 0) echo "$me: missing argument$help" >&2
+    exit 1;;
+ 1) ;;
+ *) echo "$me: too many arguments$help" >&2
+    exit 1;;
+esac
+
+# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).
+# Here we must recognize all the valid KERNEL-OS combinations.
+maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'`
+case $maybe_os in
+  nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \
+  linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
+  knetbsd*-gnu* | netbsd*-gnu* | \
+  kopensolaris*-gnu* | \
+  storm-chaos* | os2-emx* | rtmk-nova*)
+    os=-$maybe_os
+    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`
+    ;;
+  android-linux)
+    os=-linux-android
+    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown
+    ;;
+  *)
+    basic_machine=`echo $1 | sed 's/-[^-]*$//'`
+    if [ $basic_machine != $1 ]
+    then os=`echo $1 | sed 's/.*-/-/'`
+    else os=; fi
+    ;;
+esac
+
+### Let's recognize common machines as not being operating systems so
+### that things like config.sub decstation-3100 work.  We also
+### recognize some manufacturers as not being operating systems, so we
+### can provide default operating systems below.
+case $os in
+	-sun*os*)
+		# Prevent following clause from handling this invalid input.
+		;;
+	-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \
+	-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \
+	-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \
+	-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\
+	-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \
+	-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \
+	-apple | -axis | -knuth | -cray | -microblaze)
+		os=
+		basic_machine=$1
+		;;
+	-bluegene*)
+		os=-cnk
+		;;
+	-sim | -cisco | -oki | -wec | -winbond)
+		os=
+		basic_machine=$1
+		;;
+	-scout)
+		;;
+	-wrs)
+		os=-vxworks
+		basic_machine=$1
+		;;
+	-chorusos*)
+		os=-chorusos
+		basic_machine=$1
+		;;
+	-chorusrdb)
+		os=-chorusrdb
+		basic_machine=$1
+		;;
+	-hiux*)
+		os=-hiuxwe2
+		;;
+	-sco6)
+		os=-sco5v6
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco5)
+		os=-sco3.2v5
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco4)
+		os=-sco3.2v4
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco3.2.[4-9]*)
+		os=`echo $os | sed -e 's/sco3.2./sco3.2v/'`
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco3.2v[4-9]*)
+		# Don't forget version if it is 3.2v4 or newer.
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco5v6*)
+		# Don't forget version if it is 3.2v4 or newer.
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-sco*)
+		os=-sco3.2v2
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-udk*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-isc)
+		os=-isc2.2
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-clix*)
+		basic_machine=clipper-intergraph
+		;;
+	-isc*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
+		;;
+	-lynx*)
+		os=-lynxos
+		;;
+	-ptx*)
+		basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`
+		;;
+	-windowsnt*)
+		os=`echo $os | sed -e 's/windowsnt/winnt/'`
+		;;
+	-psos*)
+		os=-psos
+		;;
+	-mint | -mint[0-9]*)
+		basic_machine=m68k-atari
+		os=-mint
+		;;
+esac
+
+# Decode aliases for certain CPU-COMPANY combinations.
+case $basic_machine in
+	# Recognize the basic CPU types without company name.
+	# Some are omitted here because they have special meanings below.
+	1750a | 580 \
+	| a29k \
+	| aarch64 | aarch64_be \
+	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
+	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
+	| am33_2.0 \
+	| arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \
+        | be32 | be64 \
+	| bfin \
+	| c4x | clipper \
+	| d10v | d30v | dlx | dsp16xx \
+	| epiphany \
+	| fido | fr30 | frv \
+	| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
+	| hexagon \
+	| i370 | i860 | i960 | ia64 \
+	| ip2k | iq2000 \
+	| le32 | le64 \
+	| lm32 \
+	| m32c | m32r | m32rle | m68000 | m68k | m88k \
+	| maxq | mb | microblaze | mcore | mep | metag \
+	| mips | mipsbe | mipseb | mipsel | mipsle \
+	| mips16 \
+	| mips64 | mips64el \
+	| mips64octeon | mips64octeonel \
+	| mips64orion | mips64orionel \
+	| mips64r5900 | mips64r5900el \
+	| mips64vr | mips64vrel \
+	| mips64vr4100 | mips64vr4100el \
+	| mips64vr4300 | mips64vr4300el \
+	| mips64vr5000 | mips64vr5000el \
+	| mips64vr5900 | mips64vr5900el \
+	| mipsisa32 | mipsisa32el \
+	| mipsisa32r2 | mipsisa32r2el \
+	| mipsisa64 | mipsisa64el \
+	| mipsisa64r2 | mipsisa64r2el \
+	| mipsisa64sb1 | mipsisa64sb1el \
+	| mipsisa64sr71k | mipsisa64sr71kel \
+	| mipstx39 | mipstx39el \
+	| mn10200 | mn10300 \
+	| moxie \
+	| mt \
+	| msp430 \
+	| nds32 | nds32le | nds32be \
+	| nios | nios2 \
+	| ns16k | ns32k \
+	| open8 \
+	| or32 \
+	| pdp10 | pdp11 | pj | pjl \
+	| powerpc | powerpc64 | powerpc64le | powerpcle \
+	| pyramid \
+	| rl78 | rx \
+	| score \
+	| sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \
+	| sh64 | sh64le \
+	| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \
+	| sparcv8 | sparcv9 | sparcv9b | sparcv9v \
+	| spu \
+	| tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \
+	| ubicom32 \
+	| v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \
+	| we32k \
+	| x86 | xc16x | xstormy16 | xtensa \
+	| z8k | z80)
+		basic_machine=$basic_machine-unknown
+		;;
+	c54x)
+		basic_machine=tic54x-unknown
+		;;
+	c55x)
+		basic_machine=tic55x-unknown
+		;;
+	c6x)
+		basic_machine=tic6x-unknown
+		;;
+	m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | picochip)
+		basic_machine=$basic_machine-unknown
+		os=-none
+		;;
+	m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)
+		;;
+	ms1)
+		basic_machine=mt-unknown
+		;;
+
+	strongarm | thumb | xscale)
+		basic_machine=arm-unknown
+		;;
+	xgate)
+		basic_machine=$basic_machine-unknown
+		os=-none
+		;;
+	xscaleeb)
+		basic_machine=armeb-unknown
+		;;
+
+	xscaleel)
+		basic_machine=armel-unknown
+		;;
+
+	# We use `pc' rather than `unknown'
+	# because (1) that's what they normally are, and
+	# (2) the word "unknown" tends to confuse beginning users.
+	i*86 | x86_64)
+	  basic_machine=$basic_machine-pc
+	  ;;
+	# Object if more than one company name word.
+	*-*-*)
+		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
+		exit 1
+		;;
+	# Recognize the basic CPU types with company name.
+	580-* \
+	| a29k-* \
+	| aarch64-* | aarch64_be-* \
+	| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \
+	| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \
+	| alphapca5[67]-* | alpha64pca5[67]-* | arc-* \
+	| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \
+	| avr-* | avr32-* \
+	| be32-* | be64-* \
+	| bfin-* | bs2000-* \
+	| c[123]* | c30-* | [cjt]90-* | c4x-* \
+	| clipper-* | craynv-* | cydra-* \
+	| d10v-* | d30v-* | dlx-* \
+	| elxsi-* \
+	| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \
+	| h8300-* | h8500-* \
+	| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \
+	| hexagon-* \
+	| i*86-* | i860-* | i960-* | ia64-* \
+	| ip2k-* | iq2000-* \
+	| le32-* | le64-* \
+	| lm32-* \
+	| m32c-* | m32r-* | m32rle-* \
+	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
+	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* | microblaze-* \
+	| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \
+	| mips16-* \
+	| mips64-* | mips64el-* \
+	| mips64octeon-* | mips64octeonel-* \
+	| mips64orion-* | mips64orionel-* \
+	| mips64r5900-* | mips64r5900el-* \
+	| mips64vr-* | mips64vrel-* \
+	| mips64vr4100-* | mips64vr4100el-* \
+	| mips64vr4300-* | mips64vr4300el-* \
+	| mips64vr5000-* | mips64vr5000el-* \
+	| mips64vr5900-* | mips64vr5900el-* \
+	| mipsisa32-* | mipsisa32el-* \
+	| mipsisa32r2-* | mipsisa32r2el-* \
+	| mipsisa64-* | mipsisa64el-* \
+	| mipsisa64r2-* | mipsisa64r2el-* \
+	| mipsisa64sb1-* | mipsisa64sb1el-* \
+	| mipsisa64sr71k-* | mipsisa64sr71kel-* \
+	| mipstx39-* | mipstx39el-* \
+	| mmix-* \
+	| mt-* \
+	| msp430-* \
+	| nds32-* | nds32le-* | nds32be-* \
+	| nios-* | nios2-* \
+	| none-* | np1-* | ns16k-* | ns32k-* \
+	| open8-* \
+	| orion-* \
+	| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \
+	| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \
+	| pyramid-* \
+	| rl78-* | romp-* | rs6000-* | rx-* \
+	| sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \
+	| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \
+	| sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \
+	| sparclite-* \
+	| sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \
+	| tahoe-* \
+	| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \
+	| tile*-* \
+	| tron-* \
+	| ubicom32-* \
+	| v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \
+	| vax-* \
+	| we32k-* \
+	| x86-* | x86_64-* | xc16x-* | xps100-* \
+	| xstormy16-* | xtensa*-* \
+	| ymp-* \
+	| z8k-* | z80-*)
+		;;
+	# Recognize the basic CPU types without company name, with glob match.
+	xtensa*)
+		basic_machine=$basic_machine-unknown
+		;;
+	# Recognize the various machine names and aliases which stand
+	# for a CPU type and a company and sometimes even an OS.
+	386bsd)
+		basic_machine=i386-unknown
+		os=-bsd
+		;;
+	3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)
+		basic_machine=m68000-att
+		;;
+	3b*)
+		basic_machine=we32k-att
+		;;
+	a29khif)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	abacus)
+		basic_machine=abacus-unknown
+		;;
+	adobe68k)
+		basic_machine=m68010-adobe
+		os=-scout
+		;;
+	alliant | fx80)
+		basic_machine=fx80-alliant
+		;;
+	altos | altos3068)
+		basic_machine=m68k-altos
+		;;
+	am29k)
+		basic_machine=a29k-none
+		os=-bsd
+		;;
+	amd64)
+		basic_machine=x86_64-pc
+		;;
+	amd64-*)
+		basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	amdahl)
+		basic_machine=580-amdahl
+		os=-sysv
+		;;
+	amiga | amiga-*)
+		basic_machine=m68k-unknown
+		;;
+	amigaos | amigados)
+		basic_machine=m68k-unknown
+		os=-amigaos
+		;;
+	amigaunix | amix)
+		basic_machine=m68k-unknown
+		os=-sysv4
+		;;
+	apollo68)
+		basic_machine=m68k-apollo
+		os=-sysv
+		;;
+	apollo68bsd)
+		basic_machine=m68k-apollo
+		os=-bsd
+		;;
+	aros)
+		basic_machine=i386-pc
+		os=-aros
+		;;
+	aux)
+		basic_machine=m68k-apple
+		os=-aux
+		;;
+	balance)
+		basic_machine=ns32k-sequent
+		os=-dynix
+		;;
+	blackfin)
+		basic_machine=bfin-unknown
+		os=-linux
+		;;
+	blackfin-*)
+		basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	bluegene*)
+		basic_machine=powerpc-ibm
+		os=-cnk
+		;;
+	c54x-*)
+		basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c55x-*)
+		basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c6x-*)
+		basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	c90)
+		basic_machine=c90-cray
+		os=-unicos
+		;;
+	cegcc)
+		basic_machine=arm-unknown
+		os=-cegcc
+		;;
+	convex-c1)
+		basic_machine=c1-convex
+		os=-bsd
+		;;
+	convex-c2)
+		basic_machine=c2-convex
+		os=-bsd
+		;;
+	convex-c32)
+		basic_machine=c32-convex
+		os=-bsd
+		;;
+	convex-c34)
+		basic_machine=c34-convex
+		os=-bsd
+		;;
+	convex-c38)
+		basic_machine=c38-convex
+		os=-bsd
+		;;
+	cray | j90)
+		basic_machine=j90-cray
+		os=-unicos
+		;;
+	craynv)
+		basic_machine=craynv-cray
+		os=-unicosmp
+		;;
+	cr16 | cr16-*)
+		basic_machine=cr16-unknown
+		os=-elf
+		;;
+	crds | unos)
+		basic_machine=m68k-crds
+		;;
+	crisv32 | crisv32-* | etraxfs*)
+		basic_machine=crisv32-axis
+		;;
+	cris | cris-* | etrax*)
+		basic_machine=cris-axis
+		;;
+	crx)
+		basic_machine=crx-unknown
+		os=-elf
+		;;
+	da30 | da30-*)
+		basic_machine=m68k-da30
+		;;
+	decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)
+		basic_machine=mips-dec
+		;;
+	decsystem10* | dec10*)
+		basic_machine=pdp10-dec
+		os=-tops10
+		;;
+	decsystem20* | dec20*)
+		basic_machine=pdp10-dec
+		os=-tops20
+		;;
+	delta | 3300 | motorola-3300 | motorola-delta \
+	      | 3300-motorola | delta-motorola)
+		basic_machine=m68k-motorola
+		;;
+	delta88)
+		basic_machine=m88k-motorola
+		os=-sysv3
+		;;
+	dicos)
+		basic_machine=i686-pc
+		os=-dicos
+		;;
+	djgpp)
+		basic_machine=i586-pc
+		os=-msdosdjgpp
+		;;
+	dpx20 | dpx20-*)
+		basic_machine=rs6000-bull
+		os=-bosx
+		;;
+	dpx2* | dpx2*-bull)
+		basic_machine=m68k-bull
+		os=-sysv3
+		;;
+	ebmon29k)
+		basic_machine=a29k-amd
+		os=-ebmon
+		;;
+	elxsi)
+		basic_machine=elxsi-elxsi
+		os=-bsd
+		;;
+	encore | umax | mmax)
+		basic_machine=ns32k-encore
+		;;
+	es1800 | OSE68k | ose68k | ose | OSE)
+		basic_machine=m68k-ericsson
+		os=-ose
+		;;
+	fx2800)
+		basic_machine=i860-alliant
+		;;
+	genix)
+		basic_machine=ns32k-ns
+		;;
+	gmicro)
+		basic_machine=tron-gmicro
+		os=-sysv
+		;;
+	go32)
+		basic_machine=i386-pc
+		os=-go32
+		;;
+	h3050r* | hiux*)
+		basic_machine=hppa1.1-hitachi
+		os=-hiuxwe2
+		;;
+	h8300hms)
+		basic_machine=h8300-hitachi
+		os=-hms
+		;;
+	h8300xray)
+		basic_machine=h8300-hitachi
+		os=-xray
+		;;
+	h8500hms)
+		basic_machine=h8500-hitachi
+		os=-hms
+		;;
+	harris)
+		basic_machine=m88k-harris
+		os=-sysv3
+		;;
+	hp300-*)
+		basic_machine=m68k-hp
+		;;
+	hp300bsd)
+		basic_machine=m68k-hp
+		os=-bsd
+		;;
+	hp300hpux)
+		basic_machine=m68k-hp
+		os=-hpux
+		;;
+	hp3k9[0-9][0-9] | hp9[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hp9k2[0-9][0-9] | hp9k31[0-9])
+		basic_machine=m68000-hp
+		;;
+	hp9k3[2-9][0-9])
+		basic_machine=m68k-hp
+		;;
+	hp9k6[0-9][0-9] | hp6[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hp9k7[0-79][0-9] | hp7[0-79][0-9])
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k78[0-9] | hp78[0-9])
+		# FIXME: really hppa2.0-hp
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)
+		# FIXME: really hppa2.0-hp
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[0-9][13679] | hp8[0-9][13679])
+		basic_machine=hppa1.1-hp
+		;;
+	hp9k8[0-9][0-9] | hp8[0-9][0-9])
+		basic_machine=hppa1.0-hp
+		;;
+	hppa-next)
+		os=-nextstep3
+		;;
+	hppaosf)
+		basic_machine=hppa1.1-hp
+		os=-osf
+		;;
+	hppro)
+		basic_machine=hppa1.1-hp
+		os=-proelf
+		;;
+	i370-ibm* | ibm*)
+		basic_machine=i370-ibm
+		;;
+	i*86v32)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv32
+		;;
+	i*86v4*)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv4
+		;;
+	i*86v)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-sysv
+		;;
+	i*86sol2)
+		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
+		os=-solaris2
+		;;
+	i386mach)
+		basic_machine=i386-mach
+		os=-mach
+		;;
+	i386-vsta | vsta)
+		basic_machine=i386-unknown
+		os=-vsta
+		;;
+	iris | iris4d)
+		basic_machine=mips-sgi
+		case $os in
+		    -irix*)
+			;;
+		    *)
+			os=-irix4
+			;;
+		esac
+		;;
+	isi68 | isi)
+		basic_machine=m68k-isi
+		os=-sysv
+		;;
+	m68knommu)
+		basic_machine=m68k-unknown
+		os=-linux
+		;;
+	m68knommu-*)
+		basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	m88k-omron*)
+		basic_machine=m88k-omron
+		;;
+	magnum | m3230)
+		basic_machine=mips-mips
+		os=-sysv
+		;;
+	merlin)
+		basic_machine=ns32k-utek
+		os=-sysv
+		;;
+	microblaze)
+		basic_machine=microblaze-xilinx
+		;;
+	mingw32)
+		basic_machine=i386-pc
+		os=-mingw32
+		;;
+	mingw32ce)
+		basic_machine=arm-unknown
+		os=-mingw32ce
+		;;
+	miniframe)
+		basic_machine=m68000-convergent
+		;;
+	*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)
+		basic_machine=m68k-atari
+		os=-mint
+		;;
+	mips3*-*)
+		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`
+		;;
+	mips3*)
+		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown
+		;;
+	monitor)
+		basic_machine=m68k-rom68k
+		os=-coff
+		;;
+	morphos)
+		basic_machine=powerpc-unknown
+		os=-morphos
+		;;
+	msdos)
+		basic_machine=i386-pc
+		os=-msdos
+		;;
+	ms1-*)
+		basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`
+		;;
+	msys)
+		basic_machine=i386-pc
+		os=-msys
+		;;
+	mvs)
+		basic_machine=i370-ibm
+		os=-mvs
+		;;
+	nacl)
+		basic_machine=le32-unknown
+		os=-nacl
+		;;
+	ncr3000)
+		basic_machine=i486-ncr
+		os=-sysv4
+		;;
+	netbsd386)
+		basic_machine=i386-unknown
+		os=-netbsd
+		;;
+	netwinder)
+		basic_machine=armv4l-rebel
+		os=-linux
+		;;
+	news | news700 | news800 | news900)
+		basic_machine=m68k-sony
+		os=-newsos
+		;;
+	news1000)
+		basic_machine=m68030-sony
+		os=-newsos
+		;;
+	news-3600 | risc-news)
+		basic_machine=mips-sony
+		os=-newsos
+		;;
+	necv70)
+		basic_machine=v70-nec
+		os=-sysv
+		;;
+	next | m*-next )
+		basic_machine=m68k-next
+		case $os in
+		    -nextstep* )
+			;;
+		    -ns2*)
+		      os=-nextstep2
+			;;
+		    *)
+		      os=-nextstep3
+			;;
+		esac
+		;;
+	nh3000)
+		basic_machine=m68k-harris
+		os=-cxux
+		;;
+	nh[45]000)
+		basic_machine=m88k-harris
+		os=-cxux
+		;;
+	nindy960)
+		basic_machine=i960-intel
+		os=-nindy
+		;;
+	mon960)
+		basic_machine=i960-intel
+		os=-mon960
+		;;
+	nonstopux)
+		basic_machine=mips-compaq
+		os=-nonstopux
+		;;
+	np1)
+		basic_machine=np1-gould
+		;;
+	neo-tandem)
+		basic_machine=neo-tandem
+		;;
+	nse-tandem)
+		basic_machine=nse-tandem
+		;;
+	nsr-tandem)
+		basic_machine=nsr-tandem
+		;;
+	op50n-* | op60c-*)
+		basic_machine=hppa1.1-oki
+		os=-proelf
+		;;
+	openrisc | openrisc-*)
+		basic_machine=or32-unknown
+		;;
+	os400)
+		basic_machine=powerpc-ibm
+		os=-os400
+		;;
+	OSE68000 | ose68000)
+		basic_machine=m68000-ericsson
+		os=-ose
+		;;
+	os68k)
+		basic_machine=m68k-none
+		os=-os68k
+		;;
+	pa-hitachi)
+		basic_machine=hppa1.1-hitachi
+		os=-hiuxwe2
+		;;
+	paragon)
+		basic_machine=i860-intel
+		os=-osf
+		;;
+	parisc)
+		basic_machine=hppa-unknown
+		os=-linux
+		;;
+	parisc-*)
+		basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'`
+		os=-linux
+		;;
+	pbd)
+		basic_machine=sparc-tti
+		;;
+	pbb)
+		basic_machine=m68k-tti
+		;;
+	pc532 | pc532-*)
+		basic_machine=ns32k-pc532
+		;;
+	pc98)
+		basic_machine=i386-pc
+		;;
+	pc98-*)
+		basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentium | p5 | k5 | k6 | nexgen | viac3)
+		basic_machine=i586-pc
+		;;
+	pentiumpro | p6 | 6x86 | athlon | athlon_*)
+		basic_machine=i686-pc
+		;;
+	pentiumii | pentium2 | pentiumiii | pentium3)
+		basic_machine=i686-pc
+		;;
+	pentium4)
+		basic_machine=i786-pc
+		;;
+	pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)
+		basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentiumpro-* | p6-* | 6x86-* | athlon-*)
+		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)
+		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pentium4-*)
+		basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	pn)
+		basic_machine=pn-gould
+		;;
+	power)	basic_machine=power-ibm
+		;;
+	ppc | ppcbe)	basic_machine=powerpc-unknown
+		;;
+	ppc-* | ppcbe-*)
+		basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppcle | powerpclittle | ppc-le | powerpc-little)
+		basic_machine=powerpcle-unknown
+		;;
+	ppcle-* | powerpclittle-*)
+		basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppc64)	basic_machine=powerpc64-unknown
+		;;
+	ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ppc64le | powerpc64little | ppc64-le | powerpc64-little)
+		basic_machine=powerpc64le-unknown
+		;;
+	ppc64le-* | powerpc64little-*)
+		basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	ps2)
+		basic_machine=i386-ibm
+		;;
+	pw32)
+		basic_machine=i586-unknown
+		os=-pw32
+		;;
+	rdos)
+		basic_machine=i386-pc
+		os=-rdos
+		;;
+	rom68k)
+		basic_machine=m68k-rom68k
+		os=-coff
+		;;
+	rm[46]00)
+		basic_machine=mips-siemens
+		;;
+	rtpc | rtpc-*)
+		basic_machine=romp-ibm
+		;;
+	s390 | s390-*)
+		basic_machine=s390-ibm
+		;;
+	s390x | s390x-*)
+		basic_machine=s390x-ibm
+		;;
+	sa29200)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	sb1)
+		basic_machine=mipsisa64sb1-unknown
+		;;
+	sb1el)
+		basic_machine=mipsisa64sb1el-unknown
+		;;
+	sde)
+		basic_machine=mipsisa32-sde
+		os=-elf
+		;;
+	sei)
+		basic_machine=mips-sei
+		os=-seiux
+		;;
+	sequent)
+		basic_machine=i386-sequent
+		;;
+	sh)
+		basic_machine=sh-hitachi
+		os=-hms
+		;;
+	sh5el)
+		basic_machine=sh5le-unknown
+		;;
+	sh64)
+		basic_machine=sh64-unknown
+		;;
+	sparclite-wrs | simso-wrs)
+		basic_machine=sparclite-wrs
+		os=-vxworks
+		;;
+	sps7)
+		basic_machine=m68k-bull
+		os=-sysv2
+		;;
+	spur)
+		basic_machine=spur-unknown
+		;;
+	st2000)
+		basic_machine=m68k-tandem
+		;;
+	stratus)
+		basic_machine=i860-stratus
+		os=-sysv4
+		;;
+	strongarm-* | thumb-*)
+		basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'`
+		;;
+	sun2)
+		basic_machine=m68000-sun
+		;;
+	sun2os3)
+		basic_machine=m68000-sun
+		os=-sunos3
+		;;
+	sun2os4)
+		basic_machine=m68000-sun
+		os=-sunos4
+		;;
+	sun3os3)
+		basic_machine=m68k-sun
+		os=-sunos3
+		;;
+	sun3os4)
+		basic_machine=m68k-sun
+		os=-sunos4
+		;;
+	sun4os3)
+		basic_machine=sparc-sun
+		os=-sunos3
+		;;
+	sun4os4)
+		basic_machine=sparc-sun
+		os=-sunos4
+		;;
+	sun4sol2)
+		basic_machine=sparc-sun
+		os=-solaris2
+		;;
+	sun3 | sun3-*)
+		basic_machine=m68k-sun
+		;;
+	sun4)
+		basic_machine=sparc-sun
+		;;
+	sun386 | sun386i | roadrunner)
+		basic_machine=i386-sun
+		;;
+	sv1)
+		basic_machine=sv1-cray
+		os=-unicos
+		;;
+	symmetry)
+		basic_machine=i386-sequent
+		os=-dynix
+		;;
+	t3e)
+		basic_machine=alphaev5-cray
+		os=-unicos
+		;;
+	t90)
+		basic_machine=t90-cray
+		os=-unicos
+		;;
+	tile*)
+		basic_machine=$basic_machine-unknown
+		os=-linux-gnu
+		;;
+	tx39)
+		basic_machine=mipstx39-unknown
+		;;
+	tx39el)
+		basic_machine=mipstx39el-unknown
+		;;
+	toad1)
+		basic_machine=pdp10-xkl
+		os=-tops20
+		;;
+	tower | tower-32)
+		basic_machine=m68k-ncr
+		;;
+	tpf)
+		basic_machine=s390x-ibm
+		os=-tpf
+		;;
+	udi29k)
+		basic_machine=a29k-amd
+		os=-udi
+		;;
+	ultra3)
+		basic_machine=a29k-nyu
+		os=-sym1
+		;;
+	v810 | necv810)
+		basic_machine=v810-nec
+		os=-none
+		;;
+	vaxv)
+		basic_machine=vax-dec
+		os=-sysv
+		;;
+	vms)
+		basic_machine=vax-dec
+		os=-vms
+		;;
+	vpp*|vx|vx-*)
+		basic_machine=f301-fujitsu
+		;;
+	vxworks960)
+		basic_machine=i960-wrs
+		os=-vxworks
+		;;
+	vxworks68)
+		basic_machine=m68k-wrs
+		os=-vxworks
+		;;
+	vxworks29k)
+		basic_machine=a29k-wrs
+		os=-vxworks
+		;;
+	w65*)
+		basic_machine=w65-wdc
+		os=-none
+		;;
+	w89k-*)
+		basic_machine=hppa1.1-winbond
+		os=-proelf
+		;;
+	xbox)
+		basic_machine=i686-pc
+		os=-mingw32
+		;;
+	xps | xps100)
+		basic_machine=xps100-honeywell
+		;;
+	xscale-* | xscalee[bl]-*)
+		basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'`
+		;;
+	ymp)
+		basic_machine=ymp-cray
+		os=-unicos
+		;;
+	z8k-*-coff)
+		basic_machine=z8k-unknown
+		os=-sim
+		;;
+	z80-*-coff)
+		basic_machine=z80-unknown
+		os=-sim
+		;;
+	none)
+		basic_machine=none-none
+		os=-none
+		;;
+
+# Here we handle the default manufacturer of certain CPU types.  It is in
+# some cases the only manufacturer, in others, it is the most popular.
+	w89k)
+		basic_machine=hppa1.1-winbond
+		;;
+	op50n)
+		basic_machine=hppa1.1-oki
+		;;
+	op60c)
+		basic_machine=hppa1.1-oki
+		;;
+	romp)
+		basic_machine=romp-ibm
+		;;
+	mmix)
+		basic_machine=mmix-knuth
+		;;
+	rs6000)
+		basic_machine=rs6000-ibm
+		;;
+	vax)
+		basic_machine=vax-dec
+		;;
+	pdp10)
+		# there are many clones, so DEC is not a safe bet
+		basic_machine=pdp10-unknown
+		;;
+	pdp11)
+		basic_machine=pdp11-dec
+		;;
+	we32k)
+		basic_machine=we32k-att
+		;;
+	sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele)
+		basic_machine=sh-unknown
+		;;
+	sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)
+		basic_machine=sparc-sun
+		;;
+	cydra)
+		basic_machine=cydra-cydrome
+		;;
+	orion)
+		basic_machine=orion-highlevel
+		;;
+	orion105)
+		basic_machine=clipper-highlevel
+		;;
+	mac | mpw | mac-mpw)
+		basic_machine=m68k-apple
+		;;
+	pmac | pmac-mpw)
+		basic_machine=powerpc-apple
+		;;
+	*-unknown)
+		# Make sure to match an already-canonicalized machine name.
+		;;
+	*)
+		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
+		exit 1
+		;;
+esac
+
+# Here we canonicalize certain aliases for manufacturers.
+case $basic_machine in
+	*-digital*)
+		basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`
+		;;
+	*-commodore*)
+		basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`
+		;;
+	*)
+		;;
+esac
+
+# Decode manufacturer-specific aliases for certain operating systems.
+
+if [ x"$os" != x"" ]
+then
+case $os in
+	# First match some system type aliases
+	# that might get confused with valid system types.
+	# -solaris* is a basic system type, with this one exception.
+	-auroraux)
+		os=-auroraux
+		;;
+	-solaris1 | -solaris1.*)
+		os=`echo $os | sed -e 's|solaris1|sunos4|'`
+		;;
+	-solaris)
+		os=-solaris2
+		;;
+	-svr4*)
+		os=-sysv4
+		;;
+	-unixware*)
+		os=-sysv4.2uw
+		;;
+	-gnu/linux*)
+		os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`
+		;;
+	# First accept the basic system types.
+	# The portable systems comes first.
+	# Each alternative MUST END IN A *, to match a version number.
+	# -sysv* is not here because it comes later, after sysvr4.
+	-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \
+	      | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\
+	      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \
+	      | -sym* | -kopensolaris* \
+	      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \
+	      | -aos* | -aros* \
+	      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \
+	      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \
+	      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \
+	      | -openbsd* | -solidbsd* \
+	      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \
+	      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \
+	      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \
+	      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \
+	      | -chorusos* | -chorusrdb* | -cegcc* \
+	      | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
+	      | -mingw32* | -linux-gnu* | -linux-android* \
+	      | -linux-newlib* | -linux-uclibc* \
+	      | -uxpv* | -beos* | -mpeix* | -udk* \
+	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
+	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
+	      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \
+	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
+	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
+	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
+	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*)
+	# Remember, each alternative MUST END IN *, to match a version number.
+		;;
+	-qnx*)
+		case $basic_machine in
+		    x86-* | i*86-*)
+			;;
+		    *)
+			os=-nto$os
+			;;
+		esac
+		;;
+	-nto-qnx*)
+		;;
+	-nto*)
+		os=`echo $os | sed -e 's|nto|nto-qnx|'`
+		;;
+	-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \
+	      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \
+	      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)
+		;;
+	-mac*)
+		os=`echo $os | sed -e 's|mac|macos|'`
+		;;
+	-linux-dietlibc)
+		os=-linux-dietlibc
+		;;
+	-linux*)
+		os=`echo $os | sed -e 's|linux|linux-gnu|'`
+		;;
+	-sunos5*)
+		os=`echo $os | sed -e 's|sunos5|solaris2|'`
+		;;
+	-sunos6*)
+		os=`echo $os | sed -e 's|sunos6|solaris3|'`
+		;;
+	-opened*)
+		os=-openedition
+		;;
+	-os400*)
+		os=-os400
+		;;
+	-wince*)
+		os=-wince
+		;;
+	-osfrose*)
+		os=-osfrose
+		;;
+	-osf*)
+		os=-osf
+		;;
+	-utek*)
+		os=-bsd
+		;;
+	-dynix*)
+		os=-bsd
+		;;
+	-acis*)
+		os=-aos
+		;;
+	-atheos*)
+		os=-atheos
+		;;
+	-syllable*)
+		os=-syllable
+		;;
+	-386bsd)
+		os=-bsd
+		;;
+	-ctix* | -uts*)
+		os=-sysv
+		;;
+	-nova*)
+		os=-rtmk-nova
+		;;
+	-ns2 )
+		os=-nextstep2
+		;;
+	-nsk*)
+		os=-nsk
+		;;
+	# Preserve the version number of sinix5.
+	-sinix5.*)
+		os=`echo $os | sed -e 's|sinix|sysv|'`
+		;;
+	-sinix*)
+		os=-sysv4
+		;;
+	-tpf*)
+		os=-tpf
+		;;
+	-triton*)
+		os=-sysv3
+		;;
+	-oss*)
+		os=-sysv3
+		;;
+	-svr4)
+		os=-sysv4
+		;;
+	-svr3)
+		os=-sysv3
+		;;
+	-sysvr4)
+		os=-sysv4
+		;;
+	# This must come after -sysvr4.
+	-sysv*)
+		;;
+	-ose*)
+		os=-ose
+		;;
+	-es1800*)
+		os=-ose
+		;;
+	-xenix)
+		os=-xenix
+		;;
+	-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
+		os=-mint
+		;;
+	-aros*)
+		os=-aros
+		;;
+	-kaos*)
+		os=-kaos
+		;;
+	-zvmoe)
+		os=-zvmoe
+		;;
+	-dicos*)
+		os=-dicos
+		;;
+	-nacl*)
+		;;
+	-none)
+		;;
+	*)
+		# Get rid of the `-' at the beginning of $os.
+		os=`echo $os | sed 's/[^-]*-//'`
+		echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2
+		exit 1
+		;;
+esac
+else
+
+# Here we handle the default operating systems that come with various machines.
+# The value should be what the vendor currently ships out the door with their
+# machine or put another way, the most popular os provided with the machine.
+
+# Note that if you're going to try to match "-MANUFACTURER" here (say,
+# "-sun"), then you have to tell the case statement up towards the top
+# that MANUFACTURER isn't an operating system.  Otherwise, code above
+# will signal an error saying that MANUFACTURER isn't an operating
+# system, and we'll never get to this point.
+
+case $basic_machine in
+	score-*)
+		os=-elf
+		;;
+	spu-*)
+		os=-elf
+		;;
+	*-acorn)
+		os=-riscix1.2
+		;;
+	arm*-rebel)
+		os=-linux
+		;;
+	arm*-semi)
+		os=-aout
+		;;
+	c4x-* | tic4x-*)
+		os=-coff
+		;;
+	tic54x-*)
+		os=-coff
+		;;
+	tic55x-*)
+		os=-coff
+		;;
+	tic6x-*)
+		os=-coff
+		;;
+	# This must come before the *-dec entry.
+	pdp10-*)
+		os=-tops20
+		;;
+	pdp11-*)
+		os=-none
+		;;
+	*-dec | vax-*)
+		os=-ultrix4.2
+		;;
+	m68*-apollo)
+		os=-domain
+		;;
+	i386-sun)
+		os=-sunos4.0.2
+		;;
+	m68000-sun)
+		os=-sunos3
+		;;
+	m68*-cisco)
+		os=-aout
+		;;
+	mep-*)
+		os=-elf
+		;;
+	mips*-cisco)
+		os=-elf
+		;;
+	mips*-*)
+		os=-elf
+		;;
+	or32-*)
+		os=-coff
+		;;
+	*-tti)	# must be before sparc entry or we get the wrong os.
+		os=-sysv3
+		;;
+	sparc-* | *-sun)
+		os=-sunos4.1.1
+		;;
+	*-be)
+		os=-beos
+		;;
+	*-haiku)
+		os=-haiku
+		;;
+	*-ibm)
+		os=-aix
+		;;
+	*-knuth)
+		os=-mmixware
+		;;
+	*-wec)
+		os=-proelf
+		;;
+	*-winbond)
+		os=-proelf
+		;;
+	*-oki)
+		os=-proelf
+		;;
+	*-hp)
+		os=-hpux
+		;;
+	*-hitachi)
+		os=-hiux
+		;;
+	i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)
+		os=-sysv
+		;;
+	*-cbm)
+		os=-amigaos
+		;;
+	*-dg)
+		os=-dgux
+		;;
+	*-dolphin)
+		os=-sysv3
+		;;
+	m68k-ccur)
+		os=-rtu
+		;;
+	m88k-omron*)
+		os=-luna
+		;;
+	*-next )
+		os=-nextstep
+		;;
+	*-sequent)
+		os=-ptx
+		;;
+	*-crds)
+		os=-unos
+		;;
+	*-ns)
+		os=-genix
+		;;
+	i370-*)
+		os=-mvs
+		;;
+	*-next)
+		os=-nextstep3
+		;;
+	*-gould)
+		os=-sysv
+		;;
+	*-highlevel)
+		os=-bsd
+		;;
+	*-encore)
+		os=-bsd
+		;;
+	*-sgi)
+		os=-irix
+		;;
+	*-siemens)
+		os=-sysv4
+		;;
+	*-masscomp)
+		os=-rtu
+		;;
+	f30[01]-fujitsu | f700-fujitsu)
+		os=-uxpv
+		;;
+	*-rom68k)
+		os=-coff
+		;;
+	*-*bug)
+		os=-coff
+		;;
+	*-apple)
+		os=-macos
+		;;
+	*-atari*)
+		os=-mint
+		;;
+	*)
+		os=-none
+		;;
+esac
+fi
+
+# Here we handle the case where we know the os, and the CPU type, but not the
+# manufacturer.  We pick the logical manufacturer.
+vendor=unknown
+case $basic_machine in
+	*-unknown)
+		case $os in
+			-riscix*)
+				vendor=acorn
+				;;
+			-sunos*)
+				vendor=sun
+				;;
+			-cnk*|-aix*)
+				vendor=ibm
+				;;
+			-beos*)
+				vendor=be
+				;;
+			-hpux*)
+				vendor=hp
+				;;
+			-mpeix*)
+				vendor=hp
+				;;
+			-hiux*)
+				vendor=hitachi
+				;;
+			-unos*)
+				vendor=crds
+				;;
+			-dgux*)
+				vendor=dg
+				;;
+			-luna*)
+				vendor=omron
+				;;
+			-genix*)
+				vendor=ns
+				;;
+			-mvs* | -opened*)
+				vendor=ibm
+				;;
+			-os400*)
+				vendor=ibm
+				;;
+			-ptx*)
+				vendor=sequent
+				;;
+			-tpf*)
+				vendor=ibm
+				;;
+			-vxsim* | -vxworks* | -windiss*)
+				vendor=wrs
+				;;
+			-aux*)
+				vendor=apple
+				;;
+			-hms*)
+				vendor=hitachi
+				;;
+			-mpw* | -macos*)
+				vendor=apple
+				;;
+			-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
+				vendor=atari
+				;;
+			-vos*)
+				vendor=stratus
+				;;
+		esac
+		basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"`
+		;;
+esac
+
+echo $basic_machine$os
+exit
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff -Nru igraph-0.6.5~quantal1/configure igraph-0.6.5/configure
--- igraph-0.6.5~quantal1/configure	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/configure	2013-03-03 01:29:40.000000000 +0000
@@ -0,0 +1,20469 @@
+#! /bin/sh
+# Guess values for system-dependent variables and create Makefiles.
+# Generated by GNU Autoconf 2.68 for igraph 0.6.5.
+#
+# Report bugs to <csardi.gabor@gmail.com>.
+#
+#
+# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
+# 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software
+# Foundation, Inc.
+#
+#
+# This configure script is free software; the Free Software Foundation
+# gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1
+test \$(( 1 + 1 )) = 2 || exit 1
+
+  test -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || (
+    ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+    ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO
+    ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO
+    PATH=/empty FPATH=/empty; export PATH FPATH
+    test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\
+      || test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in #(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  # We cannot yet assume a decent shell, so we have to provide a
+	# neutralization value for shells without unset; and this also
+	# works around shells that cannot unset nonexistent variables.
+	# Preserve -v and -x to the replacement shell.
+	BASH_ENV=/dev/null
+	ENV=/dev/null
+	(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+	export CONFIG_SHELL
+	case $- in # ((((
+	  *v*x* | *x*v* ) as_opts=-vx ;;
+	  *v* ) as_opts=-v ;;
+	  *x* ) as_opts=-x ;;
+	  * ) as_opts= ;;
+	esac
+	exec "$CONFIG_SHELL" $as_opts "$as_myself" ${1+"$@"}
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: csardi.gabor@gmail.com about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -p'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -p'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -p'
+  fi
+else
+  as_ln_s='cp -p'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+if test -x / >/dev/null 2>&1; then
+  as_test_x='test -x'
+else
+  if ls -dL / >/dev/null 2>&1; then
+    as_ls_L_option=L
+  else
+    as_ls_L_option=
+  fi
+  as_test_x='
+    eval sh -c '\''
+      if test -d "$1"; then
+	test -d "$1/.";
+      else
+	case $1 in #(
+	-*)set "./$1";;
+	esac;
+	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
+	???[sx]*):;;*)false;;esac;fi
+    '\'' sh
+  '
+fi
+as_executable_p=$as_test_x
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+SHELL=${CONFIG_SHELL-/bin/sh}
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIBOBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='igraph'
+PACKAGE_TARNAME='igraph'
+PACKAGE_VERSION='0.6.5'
+PACKAGE_STRING='igraph 0.6.5'
+PACKAGE_BUGREPORT='csardi.gabor@gmail.com'
+PACKAGE_URL=''
+
+ac_unique_file="src/games.c"
+# Factoring default headers for most tests.
+ac_includes_default="\
+#include <stdio.h>
+#ifdef HAVE_SYS_TYPES_H
+# include <sys/types.h>
+#endif
+#ifdef HAVE_SYS_STAT_H
+# include <sys/stat.h>
+#endif
+#ifdef STDC_HEADERS
+# include <stdlib.h>
+# include <stddef.h>
+#else
+# ifdef HAVE_STDLIB_H
+#  include <stdlib.h>
+# endif
+#endif
+#ifdef HAVE_STRING_H
+# if !defined STDC_HEADERS && defined HAVE_MEMORY_H
+#  include <memory.h>
+# endif
+# include <string.h>
+#endif
+#ifdef HAVE_STRINGS_H
+# include <strings.h>
+#endif
+#ifdef HAVE_INTTYPES_H
+# include <inttypes.h>
+#endif
+#ifdef HAVE_STDINT_H
+# include <stdint.h>
+#endif
+#ifdef HAVE_UNISTD_H
+# include <unistd.h>
+#endif"
+
+ac_subst_vars='am__EXEEXT_FALSE
+am__EXEEXT_TRUE
+LTLIBOBJS
+LIBOBJS
+INTERNAL_F2C_FALSE
+INTERNAL_F2C_TRUE
+INTERNAL_BLAS_FALSE
+INTERNAL_BLAS_TRUE
+INTERNAL_LAPACK_FALSE
+INTERNAL_LAPACK_TRUE
+INTERNAL_ARPACK_FALSE
+INTERNAL_ARPACK_TRUE
+INTERNAL_GLPK_FALSE
+INTERNAL_GLPK_TRUE
+HAVE_TLS
+XML2_CFLAGS
+XML2_LIBS
+XML2CONFIG
+WERROR_CFLAGS
+WARNING_CFLAGS
+FLOATSTORE
+AUTOM4TE
+OTOOL64
+OTOOL
+LIPO
+NMEDIT
+DSYMUTIL
+MANIFEST_TOOL
+RANLIB
+ac_ct_AR
+AR
+LN_S
+NM
+ac_ct_DUMPBIN
+DUMPBIN
+LD
+FGREP
+SED
+LIBTOOL
+OBJDUMP
+DLLTOOL
+AS
+host_os
+host_vendor
+host_cpu
+host
+build_os
+build_vendor
+build_cpu
+build
+EGREP
+GREP
+CPP
+YFLAGS
+YACC
+LEXLIB
+LEX_OUTPUT_ROOT
+LEX
+CXXCPP
+am__fastdepCXX_FALSE
+am__fastdepCXX_TRUE
+CXXDEPMODE
+ac_ct_CXX
+CXXFLAGS
+CXX
+am__fastdepCC_FALSE
+am__fastdepCC_TRUE
+CCDEPMODE
+am__nodep
+AMDEPBACKSLASH
+AMDEP_FALSE
+AMDEP_TRUE
+am__quote
+am__include
+DEPDIR
+OBJEXT
+EXEEXT
+ac_ct_CC
+CPPFLAGS
+LDFLAGS
+CFLAGS
+CC
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files=''
+ac_user_opts='
+enable_option_checking
+enable_dependency_tracking
+enable_shared
+enable_static
+with_pic
+enable_fast_install
+with_gnu_ld
+with_sysroot
+enable_libtool_lock
+enable_gcc_warnings
+enable_profiling
+enable_debug
+enable_graphml
+enable_gmp
+enable_tls
+with_external_f2c
+with_external_blas
+with_external_lapack
+with_external_arpack
+with_external_glpk
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+CC
+CFLAGS
+LDFLAGS
+LIBS
+CPPFLAGS
+CXX
+CXXFLAGS
+CCC
+CXXCPP
+YACC
+YFLAGS
+CPP'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+    $as_echo "$as_me: WARNING: if you wanted to set the --build type, don't use --host.
+    If a cross compiler is detected then cross compile mode will be used" >&2
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures igraph 0.6.5 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          [$ac_default_prefix]
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          [PREFIX]
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root [DATAROOTDIR/doc/igraph]
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+
+System types:
+  --build=BUILD     configure for building on BUILD [guessed]
+  --host=HOST       cross-compile to build programs to run on HOST [BUILD]
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of igraph 0.6.5:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --disable-dependency-tracking  speeds up one-time build
+  --enable-dependency-tracking   do not reject slow dependency extractors
+  --enable-shared[=PKGS]  build shared libraries [default=yes]
+  --enable-static[=PKGS]  build static libraries [default=yes]
+  --enable-fast-install[=PKGS]
+                          optimize for fast installation [default=yes]
+  --disable-libtool-lock  avoid locking (might break parallel builds)
+  --enable-gcc-warnings   turn on lots of GCC warnings (not recommended)
+  --enable-profiling      Enable gprof profiling
+  --enable-debug          Enable debug build
+  --disable-graphml       Disable support for GraphML format
+  --disable-gmp           Compile without the GMP library
+  --enable-tls            Compile with thread-local storage
+
+Optional Packages:
+  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]
+  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)
+  --with-pic[=PKGS]       try to use only PIC/non-PIC objects [default=use
+                          both]
+  --with-gnu-ld           assume the C compiler uses GNU ld [default=no]
+  --with-sysroot=DIR Search for dependent libraries within DIR
+                        (or the compiler's sysroot if not specified).
+  --with-external-f2c     Use external F2C library [default=no]
+  --with-external-blas    Use external BLAS library [default=no]
+  --with-external-lapack  Use external LAPACK library [default=no]
+  --with-external-arpack  Use external ARPACK library [default=no]
+  --with-external-glpk    Use external GLPK library [default=no]
+
+Some influential environment variables:
+  CC          C compiler command
+  CFLAGS      C compiler flags
+  LDFLAGS     linker flags, e.g. -L<lib dir> if you have libraries in a
+              nonstandard directory <lib dir>
+  LIBS        libraries to pass to the linker, e.g. -l<library>
+  CPPFLAGS    (Objective) C/C++ preprocessor flags, e.g. -I<include dir> if
+              you have headers in a nonstandard directory <include dir>
+  CXX         C++ compiler command
+  CXXFLAGS    C++ compiler flags
+  CXXCPP      C++ preprocessor
+  YACC        The `Yet Another Compiler Compiler' implementation to use.
+              Defaults to the first program found out of: `bison -y', `byacc',
+              `yacc'.
+  YFLAGS      The list of arguments that will be passed by default to $YACC.
+              This script will default YFLAGS to the empty string to avoid a
+              default value of `-d' given by some make applications.
+  CPP         C preprocessor
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <csardi.gabor@gmail.com>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+igraph configure 0.6.5
+generated by GNU Autoconf 2.68
+
+Copyright (C) 2010 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+
+# ac_fn_c_try_compile LINENO
+# --------------------------
+# Try to compile conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_compile ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  rm -f conftest.$ac_objext
+  if { { ac_try="$ac_compile"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_compile") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && {
+	 test -z "$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+       } && test -s conftest.$ac_objext; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_compile
+
+# ac_fn_cxx_try_compile LINENO
+# ----------------------------
+# Try to compile conftest.$ac_ext, and return whether this succeeded.
+ac_fn_cxx_try_compile ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  rm -f conftest.$ac_objext
+  if { { ac_try="$ac_compile"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_compile") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && {
+	 test -z "$ac_cxx_werror_flag" ||
+	 test ! -s conftest.err
+       } && test -s conftest.$ac_objext; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_cxx_try_compile
+
+# ac_fn_cxx_try_cpp LINENO
+# ------------------------
+# Try to preprocess conftest.$ac_ext, and return whether this succeeded.
+ac_fn_cxx_try_cpp ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  if { { ac_try="$ac_cpp conftest.$ac_ext"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } > conftest.i && {
+	 test -z "$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag" ||
+	 test ! -s conftest.err
+       }; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+    ac_retval=1
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_cxx_try_cpp
+
+# ac_fn_c_try_link LINENO
+# -----------------------
+# Try to link conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_link ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  rm -f conftest.$ac_objext conftest$ac_exeext
+  if { { ac_try="$ac_link"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && {
+	 test -z "$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+       } && test -s conftest$ac_exeext && {
+	 test "$cross_compiling" = yes ||
+	 $as_test_x conftest$ac_exeext
+       }; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information
+  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would
+  # interfere with the next link command; also delete a directory that is
+  # left behind by Apple's compiler.  We do this before executing the actions.
+  rm -rf conftest.dSYM conftest_ipa8_conftest.oo
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_link
+
+# ac_fn_c_try_cpp LINENO
+# ----------------------
+# Try to preprocess conftest.$ac_ext, and return whether this succeeded.
+ac_fn_c_try_cpp ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  if { { ac_try="$ac_cpp conftest.$ac_ext"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } > conftest.i && {
+	 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
+	 test ! -s conftest.err
+       }; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+    ac_retval=1
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_cpp
+
+# ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES
+# -------------------------------------------------------
+# Tests whether HEADER exists, giving a warning if it cannot be compiled using
+# the include files in INCLUDES and setting the cache variable VAR
+# accordingly.
+ac_fn_c_check_header_mongrel ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  if eval \${$3+:} false; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+else
+  # Is the header compilable?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5
+$as_echo_n "checking $2 usability... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+$4
+#include <$2>
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_header_compiler=yes
+else
+  ac_header_compiler=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5
+$as_echo "$ac_header_compiler" >&6; }
+
+# Is the header present?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5
+$as_echo_n "checking $2 presence... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <$2>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+  ac_header_preproc=yes
+else
+  ac_header_preproc=no
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5
+$as_echo "$ac_header_preproc" >&6; }
+
+# So?  What about this header?
+case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #((
+  yes:no: )
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5
+$as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+    ;;
+  no:yes:* )
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5
+$as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2:     check for missing prerequisite headers?" >&5
+$as_echo "$as_me: WARNING: $2:     check for missing prerequisite headers?" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5
+$as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2:     section \"Present But Cannot Be Compiled\"" >&5
+$as_echo "$as_me: WARNING: $2:     section \"Present But Cannot Be Compiled\"" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+( $as_echo "## ------------------------------------- ##
+## Report this to csardi.gabor@gmail.com ##
+## ------------------------------------- ##"
+     ) | sed "s/^/$as_me: WARNING:     /" >&2
+    ;;
+esac
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  eval "$3=\$ac_header_compiler"
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_header_mongrel
+
+# ac_fn_c_try_run LINENO
+# ----------------------
+# Try to link conftest.$ac_ext, and return whether this succeeded. Assumes
+# that executables *can* be run.
+ac_fn_c_try_run ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  if { { ac_try="$ac_link"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && { ac_try='./conftest$ac_exeext'
+  { { case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_try") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; }; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: program exited with status $ac_status" >&5
+       $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+       ac_retval=$ac_status
+fi
+  rm -rf conftest.dSYM conftest_ipa8_conftest.oo
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_c_try_run
+
+# ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES
+# -------------------------------------------------------
+# Tests whether HEADER exists and can be compiled using the include files in
+# INCLUDES, setting the cache variable VAR accordingly.
+ac_fn_c_check_header_compile ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+$4
+#include <$2>
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  eval "$3=yes"
+else
+  eval "$3=no"
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_header_compile
+
+# ac_fn_c_check_func LINENO FUNC VAR
+# ----------------------------------
+# Tests whether FUNC exists, setting the cache variable VAR accordingly
+ac_fn_c_check_func ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+/* Define $2 to an innocuous variant, in case <limits.h> declares $2.
+   For example, HP-UX 11i <limits.h> declares gettimeofday.  */
+#define $2 innocuous_$2
+
+/* System header to define __stub macros and hopefully few prototypes,
+    which can conflict with char $2 (); below.
+    Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+    <limits.h> exists even on freestanding compilers.  */
+
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+
+#undef $2
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char $2 ();
+/* The GNU C library defines this for functions which it implements
+    to always fail with ENOSYS.  Some functions are actually named
+    something starting with __ and the normal name is an alias.  */
+#if defined __stub_$2 || defined __stub___$2
+choke me
+#endif
+
+int
+main ()
+{
+return $2 ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  eval "$3=yes"
+else
+  eval "$3=no"
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_c_check_func
+
+# ac_fn_cxx_try_link LINENO
+# -------------------------
+# Try to link conftest.$ac_ext, and return whether this succeeded.
+ac_fn_cxx_try_link ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  rm -f conftest.$ac_objext conftest$ac_exeext
+  if { { ac_try="$ac_link"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    grep -v '^ *+' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+    mv -f conftest.er1 conftest.err
+  fi
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && {
+	 test -z "$ac_cxx_werror_flag" ||
+	 test ! -s conftest.err
+       } && test -s conftest$ac_exeext && {
+	 test "$cross_compiling" = yes ||
+	 $as_test_x conftest$ac_exeext
+       }; then :
+  ac_retval=0
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+	ac_retval=1
+fi
+  # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information
+  # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would
+  # interfere with the next link command; also delete a directory that is
+  # left behind by Apple's compiler.  We do this before executing the actions.
+  rm -rf conftest.dSYM conftest_ipa8_conftest.oo
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+  as_fn_set_status $ac_retval
+
+} # ac_fn_cxx_try_link
+
+# ac_fn_cxx_check_header_mongrel LINENO HEADER VAR INCLUDES
+# ---------------------------------------------------------
+# Tests whether HEADER exists, giving a warning if it cannot be compiled using
+# the include files in INCLUDES and setting the cache variable VAR
+# accordingly.
+ac_fn_cxx_check_header_mongrel ()
+{
+  as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+  if eval \${$3+:} false; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+else
+  # Is the header compilable?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5
+$as_echo_n "checking $2 usability... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+$4
+#include <$2>
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_header_compiler=yes
+else
+  ac_header_compiler=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5
+$as_echo "$ac_header_compiler" >&6; }
+
+# Is the header present?
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5
+$as_echo_n "checking $2 presence... " >&6; }
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <$2>
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+  ac_header_preproc=yes
+else
+  ac_header_preproc=no
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5
+$as_echo "$ac_header_preproc" >&6; }
+
+# So?  What about this header?
+case $ac_header_compiler:$ac_header_preproc:$ac_cxx_preproc_warn_flag in #((
+  yes:no: )
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5
+$as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+    ;;
+  no:yes:* )
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5
+$as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2:     check for missing prerequisite headers?" >&5
+$as_echo "$as_me: WARNING: $2:     check for missing prerequisite headers?" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5
+$as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2:     section \"Present But Cannot Be Compiled\"" >&5
+$as_echo "$as_me: WARNING: $2:     section \"Present But Cannot Be Compiled\"" >&2;}
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5
+$as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;}
+( $as_echo "## ------------------------------------- ##
+## Report this to csardi.gabor@gmail.com ##
+## ------------------------------------- ##"
+     ) | sed "s/^/$as_me: WARNING:     /" >&2
+    ;;
+esac
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5
+$as_echo_n "checking for $2... " >&6; }
+if eval \${$3+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  eval "$3=\$ac_header_compiler"
+fi
+eval ac_res=\$$3
+	       { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5
+$as_echo "$ac_res" >&6; }
+fi
+  eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno
+
+} # ac_fn_cxx_check_header_mongrel
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by igraph $as_me 0.6.5, which was
+generated by GNU Autoconf 2.68.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in #((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+
+am__api_version='1.11'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in #((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Just in case
+sleep 1
+echo timestamp > conftest.file
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: \`$srcdir'" "$LINENO" 5;;
+esac
+
+# Do `set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+   if test "$*" = "X"; then
+      # -L didn't work.
+      set X `ls -t "$srcdir/configure" conftest.file`
+   fi
+   rm -f conftest.file
+   if test "$*" != "X $srcdir/configure conftest.file" \
+      && test "$*" != "X conftest.file $srcdir/configure"; then
+
+      # If neither matched, then we have a broken ls.  This can happen
+      # if, for instance, CONFIG_SHELL is bash and it inherits a
+      # broken ls alias from the environment.  This has actually
+      # happened.  Such a system could not be considered "sane".
+      as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+alias in your environment" "$LINENO" 5
+   fi
+
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --run true"; then
+  am_missing_run="$MISSING --run "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using `strip' when the user
+# run `make install-strip'.  However `strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the `STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+mkdir_p="$MKDIR_P"
+case $mkdir_p in
+  [\\/$]* | ?:[\\/]*) ;;
+  */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
+esac
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='igraph'
+ VERSION='0.6.5'
+
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE "$PACKAGE"
+_ACEOF
+
+
+cat >>confdefs.h <<_ACEOF
+#define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+ac_config_headers="$ac_config_headers config.h"
+
+
+# ===========================================================================
+#          http://www.gnu.org/software/autoconf-archive/ax_tls.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_TLS([action-if-found], [action-if-not-found])
+#
+# DESCRIPTION
+#
+#   Provides a test for the compiler support of thread local storage (TLS)
+#   extensions. Defines TLS if it is found. Currently knows about GCC/ICC
+#   and MSVC. I think SunPro uses the same as GCC, and Borland apparently
+#   supports either.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Alan Woodland <ajw05@aber.ac.uk>
+#   Copyright (c) 2010 Diego Elio Petteno` <flameeyes@gmail.com>
+#
+#   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/>.
+#
+#   As a special exception, the respective Autoconf Macro's copyright owner
+#   gives unlimited permission to copy, distribute and modify the configure
+#   scripts that are the output of Autoconf when processing the Macro. You
+#   need not follow the terms of the GNU General Public License when using
+#   or distributing such scripts, even though portions of the text of the
+#   Macro appear in them. The GNU General Public License (GPL) does govern
+#   all other use of the material that constitutes the Autoconf Macro.
+#
+#   This special exception to the GPL applies to versions of the Autoconf
+#   Macro released by the Autoconf Archive. When you make and distribute a
+#   modified version of the Autoconf Macro, you may extend this special
+#   exception to the GPL to apply to your modified version as well.
+
+#serial 10
+
+
+
+
+# Test suite
+ac_config_commands="$ac_config_commands tests/atconfig"
+
+ac_config_files="$ac_config_files tests/Makefile tests/atlocal"
+
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args.
+set dummy ${ac_tool_prefix}gcc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$CC"; then
+  ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_CC="${ac_tool_prefix}gcc"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_CC"; then
+  ac_ct_CC=$CC
+  # Extract the first word of "gcc", so it can be a program name with args.
+set dummy gcc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_CC"; then
+  ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_CC="gcc"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_CC=$ac_cv_prog_ac_ct_CC
+if test -n "$ac_ct_CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
+$as_echo "$ac_ct_CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_CC" = x; then
+    CC=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    CC=$ac_ct_CC
+  fi
+else
+  CC="$ac_cv_prog_CC"
+fi
+
+if test -z "$CC"; then
+          if test -n "$ac_tool_prefix"; then
+    # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args.
+set dummy ${ac_tool_prefix}cc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$CC"; then
+  ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_CC="${ac_tool_prefix}cc"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  fi
+fi
+if test -z "$CC"; then
+  # Extract the first word of "cc", so it can be a program name with args.
+set dummy cc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$CC"; then
+  ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+  ac_prog_rejected=no
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then
+       ac_prog_rejected=yes
+       continue
+     fi
+    ac_cv_prog_CC="cc"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+if test $ac_prog_rejected = yes; then
+  # We found a bogon in the path, so make sure we never use it.
+  set dummy $ac_cv_prog_CC
+  shift
+  if test $# != 0; then
+    # We chose a different compiler from the bogus one.
+    # However, it has the same basename, so the bogon will be chosen
+    # first if we set CC to just the basename; use the full file name.
+    shift
+    ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@"
+  fi
+fi
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$CC"; then
+  if test -n "$ac_tool_prefix"; then
+  for ac_prog in cl.exe
+  do
+    # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
+set dummy $ac_tool_prefix$ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$CC"; then
+  ac_cv_prog_CC="$CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_CC="$ac_tool_prefix$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+CC=$ac_cv_prog_CC
+if test -n "$CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5
+$as_echo "$CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+    test -n "$CC" && break
+  done
+fi
+if test -z "$CC"; then
+  ac_ct_CC=$CC
+  for ac_prog in cl.exe
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_CC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_CC"; then
+  ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_CC="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_CC=$ac_cv_prog_ac_ct_CC
+if test -n "$ac_ct_CC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5
+$as_echo "$ac_ct_CC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ac_ct_CC" && break
+done
+
+  if test "x$ac_ct_CC" = x; then
+    CC=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    CC=$ac_ct_CC
+  fi
+fi
+
+fi
+
+
+test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "no acceptable C compiler found in \$PATH
+See \`config.log' for more details" "$LINENO" 5; }
+
+# Provide some information about the compiler.
+$as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5
+set X $ac_compile
+ac_compiler=$2
+for ac_option in --version -v -V -qversion; do
+  { { ac_try="$ac_compiler $ac_option >&5"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_compiler $ac_option >&5") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    sed '10a\
+... rest of stderr output deleted ...
+         10q' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+  fi
+  rm -f conftest.er1 conftest.err
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+done
+
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out"
+# Try to create an executable without -o first, disregard a.out.
+# It will help us diagnose broken compilers, and finding out an intuition
+# of exeext.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler works" >&5
+$as_echo_n "checking whether the C compiler works... " >&6; }
+ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'`
+
+# The possible output files:
+ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*"
+
+ac_rmfiles=
+for ac_file in $ac_files
+do
+  case $ac_file in
+    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
+    * ) ac_rmfiles="$ac_rmfiles $ac_file";;
+  esac
+done
+rm -f $ac_rmfiles
+
+if { { ac_try="$ac_link_default"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link_default") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then :
+  # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.
+# So ignore a value of `no', otherwise this would lead to `EXEEXT = no'
+# in a Makefile.  We should not override ac_cv_exeext if it was cached,
+# so that the user can short-circuit this test for compilers unknown to
+# Autoconf.
+for ac_file in $ac_files ''
+do
+  test -f "$ac_file" || continue
+  case $ac_file in
+    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj )
+	;;
+    [ab].out )
+	# We found the default executable, but exeext='' is most
+	# certainly right.
+	break;;
+    *.* )
+	if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no;
+	then :; else
+	   ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
+	fi
+	# We set ac_cv_exeext here because the later test for it is not
+	# safe: cross compilers may not add the suffix if given an `-o'
+	# argument, so we may need to know it at that point already.
+	# Even if this section looks crufty: it has the advantage of
+	# actually working.
+	break;;
+    * )
+	break;;
+  esac
+done
+test "$ac_cv_exeext" = no && ac_cv_exeext=
+
+else
+  ac_file=''
+fi
+if test -z "$ac_file"; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+$as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error 77 "C compiler cannot create executables
+See \`config.log' for more details" "$LINENO" 5; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler default output file name" >&5
+$as_echo_n "checking for C compiler default output file name... " >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5
+$as_echo "$ac_file" >&6; }
+ac_exeext=$ac_cv_exeext
+
+rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out
+ac_clean_files=$ac_clean_files_save
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5
+$as_echo_n "checking for suffix of executables... " >&6; }
+if { { ac_try="$ac_link"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then :
+  # If both `conftest.exe' and `conftest' are `present' (well, observable)
+# catch `conftest.exe'.  For instance with Cygwin, `ls conftest' will
+# work properly (i.e., refer to `conftest.exe'), while it won't with
+# `rm'.
+for ac_file in conftest.exe conftest conftest.*; do
+  test -f "$ac_file" || continue
+  case $ac_file in
+    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;;
+    *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
+	  break;;
+    * ) break;;
+  esac
+done
+else
+  { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot compute suffix of executables: cannot compile and link
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+rm -f conftest conftest$ac_cv_exeext
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5
+$as_echo "$ac_cv_exeext" >&6; }
+
+rm -f conftest.$ac_ext
+EXEEXT=$ac_cv_exeext
+ac_exeext=$EXEEXT
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdio.h>
+int
+main ()
+{
+FILE *f = fopen ("conftest.out", "w");
+ return ferror (f) || fclose (f) != 0;
+
+  ;
+  return 0;
+}
+_ACEOF
+ac_clean_files="$ac_clean_files conftest.out"
+# Check that the compiler produces executables we can run.  If not, either
+# the compiler is broken, or we cross compile.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5
+$as_echo_n "checking whether we are cross compiling... " >&6; }
+if test "$cross_compiling" != yes; then
+  { { ac_try="$ac_link"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_link") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+  if { ac_try='./conftest$ac_cv_exeext'
+  { { case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_try") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; }; then
+    cross_compiling=no
+  else
+    if test "$cross_compiling" = maybe; then
+	cross_compiling=yes
+    else
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot run C compiled programs.
+If you meant to cross compile, use \`--host'.
+See \`config.log' for more details" "$LINENO" 5; }
+    fi
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5
+$as_echo "$cross_compiling" >&6; }
+
+rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out
+ac_clean_files=$ac_clean_files_save
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5
+$as_echo_n "checking for suffix of object files... " >&6; }
+if ${ac_cv_objext+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+rm -f conftest.o conftest.obj
+if { { ac_try="$ac_compile"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_compile") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then :
+  for ac_file in conftest.o conftest.obj conftest.*; do
+  test -f "$ac_file" || continue;
+  case $ac_file in
+    *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;;
+    *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'`
+       break;;
+  esac
+done
+else
+  $as_echo "$as_me: failed program was:" >&5
+sed 's/^/| /' conftest.$ac_ext >&5
+
+{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "cannot compute suffix of object files: cannot compile
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+rm -f conftest.$ac_cv_objext conftest.$ac_ext
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5
+$as_echo "$ac_cv_objext" >&6; }
+OBJEXT=$ac_cv_objext
+ac_objext=$OBJEXT
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5
+$as_echo_n "checking whether we are using the GNU C compiler... " >&6; }
+if ${ac_cv_c_compiler_gnu+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+#ifndef __GNUC__
+       choke me
+#endif
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_compiler_gnu=yes
+else
+  ac_compiler_gnu=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ac_cv_c_compiler_gnu=$ac_compiler_gnu
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5
+$as_echo "$ac_cv_c_compiler_gnu" >&6; }
+if test $ac_compiler_gnu = yes; then
+  GCC=yes
+else
+  GCC=
+fi
+ac_test_CFLAGS=${CFLAGS+set}
+ac_save_CFLAGS=$CFLAGS
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5
+$as_echo_n "checking whether $CC accepts -g... " >&6; }
+if ${ac_cv_prog_cc_g+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_save_c_werror_flag=$ac_c_werror_flag
+   ac_c_werror_flag=yes
+   ac_cv_prog_cc_g=no
+   CFLAGS="-g"
+   cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_cv_prog_cc_g=yes
+else
+  CFLAGS=""
+      cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+
+else
+  ac_c_werror_flag=$ac_save_c_werror_flag
+	 CFLAGS="-g"
+	 cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_cv_prog_cc_g=yes
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+   ac_c_werror_flag=$ac_save_c_werror_flag
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5
+$as_echo "$ac_cv_prog_cc_g" >&6; }
+if test "$ac_test_CFLAGS" = set; then
+  CFLAGS=$ac_save_CFLAGS
+elif test $ac_cv_prog_cc_g = yes; then
+  if test "$GCC" = yes; then
+    CFLAGS="-g -O2"
+  else
+    CFLAGS="-g"
+  fi
+else
+  if test "$GCC" = yes; then
+    CFLAGS="-O2"
+  else
+    CFLAGS=
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5
+$as_echo_n "checking for $CC option to accept ISO C89... " >&6; }
+if ${ac_cv_prog_cc_c89+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_cv_prog_cc_c89=no
+ac_save_CC=$CC
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdarg.h>
+#include <stdio.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+/* Most of the following tests are stolen from RCS 5.7's src/conf.sh.  */
+struct buf { int x; };
+FILE * (*rcsopen) (struct buf *, struct stat *, int);
+static char *e (p, i)
+     char **p;
+     int i;
+{
+  return p[i];
+}
+static char *f (char * (*g) (char **, int), char **p, ...)
+{
+  char *s;
+  va_list v;
+  va_start (v,p);
+  s = g (p, va_arg (v,int));
+  va_end (v);
+  return s;
+}
+
+/* OSF 4.0 Compaq cc is some sort of almost-ANSI by default.  It has
+   function prototypes and stuff, but not '\xHH' hex character constants.
+   These don't provoke an error unfortunately, instead are silently treated
+   as 'x'.  The following induces an error, until -std is added to get
+   proper ANSI mode.  Curiously '\x00'!='x' always comes out true, for an
+   array size at least.  It's necessary to write '\x00'==0 to get something
+   that's true only with -std.  */
+int osf4_cc_array ['\x00' == 0 ? 1 : -1];
+
+/* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters
+   inside strings and character constants.  */
+#define FOO(x) 'x'
+int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1];
+
+int test (int i, double x);
+struct s1 {int (*f) (int a);};
+struct s2 {int (*f) (double a);};
+int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int);
+int argc;
+char **argv;
+int
+main ()
+{
+return f (e, argv, 0) != argv[0]  ||  f (e, argv, 1) != argv[1];
+  ;
+  return 0;
+}
+_ACEOF
+for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \
+	-Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__"
+do
+  CC="$ac_save_CC $ac_arg"
+  if ac_fn_c_try_compile "$LINENO"; then :
+  ac_cv_prog_cc_c89=$ac_arg
+fi
+rm -f core conftest.err conftest.$ac_objext
+  test "x$ac_cv_prog_cc_c89" != "xno" && break
+done
+rm -f conftest.$ac_ext
+CC=$ac_save_CC
+
+fi
+# AC_CACHE_VAL
+case "x$ac_cv_prog_cc_c89" in
+  x)
+    { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5
+$as_echo "none needed" >&6; } ;;
+  xno)
+    { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5
+$as_echo "unsupported" >&6; } ;;
+  *)
+    CC="$CC $ac_cv_prog_cc_c89"
+    { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5
+$as_echo "$ac_cv_prog_cc_c89" >&6; } ;;
+esac
+if test "x$ac_cv_prog_cc_c89" != xno; then :
+
+fi
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+DEPDIR="${am__leading_dot}deps"
+
+ac_config_commands="$ac_config_commands depfiles"
+
+
+am_make=${MAKE-make}
+cat > confinc << 'END'
+am__doit:
+	@echo this is the am__doit target
+.PHONY: am__doit
+END
+# If we don't find an include directive, just comment out the code.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5
+$as_echo_n "checking for style of include used by $am_make... " >&6; }
+am__include="#"
+am__quote=
+_am_result=none
+# First try GNU make style include.
+echo "include confinc" > confmf
+# Ignore all kinds of additional output from `make'.
+case `$am_make -s -f confmf 2> /dev/null` in #(
+*the\ am__doit\ target*)
+  am__include=include
+  am__quote=
+  _am_result=GNU
+  ;;
+esac
+# Now try BSD make style include.
+if test "$am__include" = "#"; then
+   echo '.include "confinc"' > confmf
+   case `$am_make -s -f confmf 2> /dev/null` in #(
+   *the\ am__doit\ target*)
+     am__include=.include
+     am__quote="\""
+     _am_result=BSD
+     ;;
+   esac
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5
+$as_echo "$_am_result" >&6; }
+rm -f confinc confmf
+
+# Check whether --enable-dependency-tracking was given.
+if test "${enable_dependency_tracking+set}" = set; then :
+  enableval=$enable_dependency_tracking;
+fi
+
+if test "x$enable_dependency_tracking" != xno; then
+  am_depcomp="$ac_aux_dir/depcomp"
+  AMDEPBACKSLASH='\'
+  am__nodep='_no'
+fi
+ if test "x$enable_dependency_tracking" != xno; then
+  AMDEP_TRUE=
+  AMDEP_FALSE='#'
+else
+  AMDEP_TRUE='#'
+  AMDEP_FALSE=
+fi
+
+
+
+depcc="$CC"   am_compiler_list=
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5
+$as_echo_n "checking dependency style of $depcc... " >&6; }
+if ${am_cv_CC_dependencies_compiler_type+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named `D' -- because `-MD' means `put the output
+  # in D'.
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_CC_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp`
+  fi
+  am__universal=false
+  case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
+      # Solaris 8's {/usr,}/bin/sh.
+      touch sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle `-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # after this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok `-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_CC_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_CC_dependencies_compiler_type=none
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5
+$as_echo "$am_cv_CC_dependencies_compiler_type" >&6; }
+CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type
+
+ if
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then
+  am__fastdepCC_TRUE=
+  am__fastdepCC_FALSE='#'
+else
+  am__fastdepCC_TRUE='#'
+  am__fastdepCC_FALSE=
+fi
+
+
+
+# Tricky check for C++ compiler, because Autoconf has a weird bug:
+# http://lists.gnu.org/archive/html/autoconf/2006-03/msg00067.html
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+if test -z "$CXX"; then
+  if test -n "$CCC"; then
+    CXX=$CCC
+  else
+    if test -n "$ac_tool_prefix"; then
+  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
+  do
+    # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
+set dummy $ac_tool_prefix$ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$CXX"; then
+  ac_cv_prog_CXX="$CXX" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_CXX="$ac_tool_prefix$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+CXX=$ac_cv_prog_CXX
+if test -n "$CXX"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5
+$as_echo "$CXX" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+    test -n "$CXX" && break
+  done
+fi
+if test -z "$CXX"; then
+  ac_ct_CXX=$CXX
+  for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_CXX"; then
+  ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_CXX="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_CXX=$ac_cv_prog_ac_ct_CXX
+if test -n "$ac_ct_CXX"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5
+$as_echo "$ac_ct_CXX" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ac_ct_CXX" && break
+done
+
+  if test "x$ac_ct_CXX" = x; then
+    CXX="g++"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    CXX=$ac_ct_CXX
+  fi
+fi
+
+  fi
+fi
+# Provide some information about the compiler.
+$as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5
+set X $ac_compile
+ac_compiler=$2
+for ac_option in --version -v -V -qversion; do
+  { { ac_try="$ac_compiler $ac_option >&5"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$ac_compiler $ac_option >&5") 2>conftest.err
+  ac_status=$?
+  if test -s conftest.err; then
+    sed '10a\
+... rest of stderr output deleted ...
+         10q' conftest.err >conftest.er1
+    cat conftest.er1 >&5
+  fi
+  rm -f conftest.er1 conftest.err
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5
+$as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; }
+if ${ac_cv_cxx_compiler_gnu+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+#ifndef __GNUC__
+       choke me
+#endif
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_compiler_gnu=yes
+else
+  ac_compiler_gnu=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ac_cv_cxx_compiler_gnu=$ac_compiler_gnu
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5
+$as_echo "$ac_cv_cxx_compiler_gnu" >&6; }
+if test $ac_compiler_gnu = yes; then
+  GXX=yes
+else
+  GXX=
+fi
+ac_test_CXXFLAGS=${CXXFLAGS+set}
+ac_save_CXXFLAGS=$CXXFLAGS
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5
+$as_echo_n "checking whether $CXX accepts -g... " >&6; }
+if ${ac_cv_prog_cxx_g+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_save_cxx_werror_flag=$ac_cxx_werror_flag
+   ac_cxx_werror_flag=yes
+   ac_cv_prog_cxx_g=no
+   CXXFLAGS="-g"
+   cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_cv_prog_cxx_g=yes
+else
+  CXXFLAGS=""
+      cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+
+else
+  ac_cxx_werror_flag=$ac_save_cxx_werror_flag
+	 CXXFLAGS="-g"
+	 cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_cv_prog_cxx_g=yes
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+   ac_cxx_werror_flag=$ac_save_cxx_werror_flag
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5
+$as_echo "$ac_cv_prog_cxx_g" >&6; }
+if test "$ac_test_CXXFLAGS" = set; then
+  CXXFLAGS=$ac_save_CXXFLAGS
+elif test $ac_cv_prog_cxx_g = yes; then
+  if test "$GXX" = yes; then
+    CXXFLAGS="-g -O2"
+  else
+    CXXFLAGS="-g"
+  fi
+else
+  if test "$GXX" = yes; then
+    CXXFLAGS="-O2"
+  else
+    CXXFLAGS=
+  fi
+fi
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+depcc="$CXX"  am_compiler_list=
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5
+$as_echo_n "checking dependency style of $depcc... " >&6; }
+if ${am_cv_CXX_dependencies_compiler_type+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named `D' -- because `-MD' means `put the output
+  # in D'.
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_CXX_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp`
+  fi
+  am__universal=false
+  case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
+      # Solaris 8's {/usr,}/bin/sh.
+      touch sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with `-c' and `-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle `-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # after this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok `-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_CXX_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_CXX_dependencies_compiler_type=none
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5
+$as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; }
+CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type
+
+ if
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then
+  am__fastdepCXX_TRUE=
+  am__fastdepCXX_FALSE='#'
+else
+  am__fastdepCXX_TRUE='#'
+  am__fastdepCXX_FALSE=
+fi
+
+
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+#include <iostream>
+const char hw[] = "Hello, World\n";
+int
+main ()
+{
+std::cout << hw;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5
+$as_echo_n "checking how to run the C++ preprocessor... " >&6; }
+if test -z "$CXXCPP"; then
+  if ${ac_cv_prog_CXXCPP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+      # Double quotes because CXXCPP needs to be expanded
+    for CXXCPP in "$CXX -E" "/lib/cpp"
+    do
+      ac_preproc_ok=false
+for ac_cxx_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+  break
+fi
+
+    done
+    ac_cv_prog_CXXCPP=$CXXCPP
+
+fi
+  CXXCPP=$ac_cv_prog_CXXCPP
+else
+  ac_cv_prog_CXXCPP=$CXXCPP
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5
+$as_echo "$CXXCPP" >&6; }
+ac_preproc_ok=false
+for ac_cxx_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+
+else
+  { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "C++ preprocessor \"$CXXCPP\" fails sanity check
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+        cxx_error=no
+else
+  as_fn_error $? "no C++ compiler found or it cannot create executables" "$LINENO" 5
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+
+for ac_prog in flex lex
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_LEX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$LEX"; then
+  ac_cv_prog_LEX="$LEX" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_LEX="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+LEX=$ac_cv_prog_LEX
+if test -n "$LEX"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LEX" >&5
+$as_echo "$LEX" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$LEX" && break
+done
+test -n "$LEX" || LEX=":"
+
+if test "x$LEX" != "x:"; then
+  cat >conftest.l <<_ACEOF
+%%
+a { ECHO; }
+b { REJECT; }
+c { yymore (); }
+d { yyless (1); }
+e { yyless (input () != 0); }
+f { unput (yytext[0]); }
+. { BEGIN INITIAL; }
+%%
+#ifdef YYTEXT_POINTER
+extern char *yytext;
+#endif
+int
+main (void)
+{
+  return ! yylex () + ! yywrap ();
+}
+_ACEOF
+{ { ac_try="$LEX conftest.l"
+case "(($ac_try" in
+  *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
+  *) ac_try_echo=$ac_try;;
+esac
+eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\""
+$as_echo "$ac_try_echo"; } >&5
+  (eval "$LEX conftest.l") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking lex output file root" >&5
+$as_echo_n "checking lex output file root... " >&6; }
+if ${ac_cv_prog_lex_root+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+
+if test -f lex.yy.c; then
+  ac_cv_prog_lex_root=lex.yy
+elif test -f lexyy.c; then
+  ac_cv_prog_lex_root=lexyy
+else
+  as_fn_error $? "cannot find output from $LEX; giving up" "$LINENO" 5
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_lex_root" >&5
+$as_echo "$ac_cv_prog_lex_root" >&6; }
+LEX_OUTPUT_ROOT=$ac_cv_prog_lex_root
+
+if test -z "${LEXLIB+set}"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking lex library" >&5
+$as_echo_n "checking lex library... " >&6; }
+if ${ac_cv_lib_lex+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+
+    ac_save_LIBS=$LIBS
+    ac_cv_lib_lex='none needed'
+    for ac_lib in '' -lfl -ll; do
+      LIBS="$ac_lib $ac_save_LIBS"
+      cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+`cat $LEX_OUTPUT_ROOT.c`
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_lex=$ac_lib
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+      test "$ac_cv_lib_lex" != 'none needed' && break
+    done
+    LIBS=$ac_save_LIBS
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lex" >&5
+$as_echo "$ac_cv_lib_lex" >&6; }
+  test "$ac_cv_lib_lex" != 'none needed' && LEXLIB=$ac_cv_lib_lex
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether yytext is a pointer" >&5
+$as_echo_n "checking whether yytext is a pointer... " >&6; }
+if ${ac_cv_prog_lex_yytext_pointer+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  # POSIX says lex can declare yytext either as a pointer or an array; the
+# default is implementation-dependent.  Figure out which it is, since
+# not all implementations provide the %pointer and %array declarations.
+ac_cv_prog_lex_yytext_pointer=no
+ac_save_LIBS=$LIBS
+LIBS="$LEXLIB $ac_save_LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+  #define YYTEXT_POINTER 1
+`cat $LEX_OUTPUT_ROOT.c`
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_prog_lex_yytext_pointer=yes
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_save_LIBS
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_lex_yytext_pointer" >&5
+$as_echo "$ac_cv_prog_lex_yytext_pointer" >&6; }
+if test $ac_cv_prog_lex_yytext_pointer = yes; then
+
+$as_echo "#define YYTEXT_POINTER 1" >>confdefs.h
+
+fi
+rm -f conftest.l $LEX_OUTPUT_ROOT.c
+
+fi
+if test "$LEX" = :; then
+  LEX=${am_missing_run}flex
+fi
+for ac_prog in 'bison -y' byacc
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_YACC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$YACC"; then
+  ac_cv_prog_YACC="$YACC" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_YACC="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+YACC=$ac_cv_prog_YACC
+if test -n "$YACC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $YACC" >&5
+$as_echo "$YACC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$YACC" && break
+done
+test -n "$YACC" || YACC="yacc"
+
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5
+$as_echo_n "checking how to run the C preprocessor... " >&6; }
+# On Suns, sometimes $CPP names a directory.
+if test -n "$CPP" && test -d "$CPP"; then
+  CPP=
+fi
+if test -z "$CPP"; then
+  if ${ac_cv_prog_CPP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+      # Double quotes because CPP needs to be expanded
+    for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp"
+    do
+      ac_preproc_ok=false
+for ac_c_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+  break
+fi
+
+    done
+    ac_cv_prog_CPP=$CPP
+
+fi
+  CPP=$ac_cv_prog_CPP
+else
+  ac_cv_prog_CPP=$CPP
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5
+$as_echo "$CPP" >&6; }
+ac_preproc_ok=false
+for ac_c_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_c_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+
+else
+  { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "C preprocessor \"$CPP\" fails sanity check
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5
+$as_echo_n "checking for grep that handles long lines and -e... " >&6; }
+if ${ac_cv_path_GREP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -z "$GREP"; then
+  ac_path_GREP_found=false
+  # Loop through the user's path and test for each of PROGNAME-LIST
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in grep ggrep; do
+    for ac_exec_ext in '' $ac_executable_extensions; do
+      ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext"
+      { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue
+# Check for GNU ac_path_GREP and select it if it is found.
+  # Check for GNU $ac_path_GREP
+case `"$ac_path_GREP" --version 2>&1` in
+*GNU*)
+  ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;;
+*)
+  ac_count=0
+  $as_echo_n 0123456789 >"conftest.in"
+  while :
+  do
+    cat "conftest.in" "conftest.in" >"conftest.tmp"
+    mv "conftest.tmp" "conftest.in"
+    cp "conftest.in" "conftest.nl"
+    $as_echo 'GREP' >> "conftest.nl"
+    "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break
+    diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+    as_fn_arith $ac_count + 1 && ac_count=$as_val
+    if test $ac_count -gt ${ac_path_GREP_max-0}; then
+      # Best one so far, save it but keep looking for a better one
+      ac_cv_path_GREP="$ac_path_GREP"
+      ac_path_GREP_max=$ac_count
+    fi
+    # 10*(2^10) chars as input seems more than enough
+    test $ac_count -gt 10 && break
+  done
+  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+      $ac_path_GREP_found && break 3
+    done
+  done
+  done
+IFS=$as_save_IFS
+  if test -z "$ac_cv_path_GREP"; then
+    as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5
+  fi
+else
+  ac_cv_path_GREP=$GREP
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5
+$as_echo "$ac_cv_path_GREP" >&6; }
+ GREP="$ac_cv_path_GREP"
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5
+$as_echo_n "checking for egrep... " >&6; }
+if ${ac_cv_path_EGREP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if echo a | $GREP -E '(a|b)' >/dev/null 2>&1
+   then ac_cv_path_EGREP="$GREP -E"
+   else
+     if test -z "$EGREP"; then
+  ac_path_EGREP_found=false
+  # Loop through the user's path and test for each of PROGNAME-LIST
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in egrep; do
+    for ac_exec_ext in '' $ac_executable_extensions; do
+      ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext"
+      { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue
+# Check for GNU ac_path_EGREP and select it if it is found.
+  # Check for GNU $ac_path_EGREP
+case `"$ac_path_EGREP" --version 2>&1` in
+*GNU*)
+  ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;;
+*)
+  ac_count=0
+  $as_echo_n 0123456789 >"conftest.in"
+  while :
+  do
+    cat "conftest.in" "conftest.in" >"conftest.tmp"
+    mv "conftest.tmp" "conftest.in"
+    cp "conftest.in" "conftest.nl"
+    $as_echo 'EGREP' >> "conftest.nl"
+    "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break
+    diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+    as_fn_arith $ac_count + 1 && ac_count=$as_val
+    if test $ac_count -gt ${ac_path_EGREP_max-0}; then
+      # Best one so far, save it but keep looking for a better one
+      ac_cv_path_EGREP="$ac_path_EGREP"
+      ac_path_EGREP_max=$ac_count
+    fi
+    # 10*(2^10) chars as input seems more than enough
+    test $ac_count -gt 10 && break
+  done
+  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+      $ac_path_EGREP_found && break 3
+    done
+  done
+  done
+IFS=$as_save_IFS
+  if test -z "$ac_cv_path_EGREP"; then
+    as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5
+  fi
+else
+  ac_cv_path_EGREP=$EGREP
+fi
+
+   fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5
+$as_echo "$ac_cv_path_EGREP" >&6; }
+ EGREP="$ac_cv_path_EGREP"
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5
+$as_echo_n "checking for ANSI C header files... " >&6; }
+if ${ac_cv_header_stdc+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdlib.h>
+#include <stdarg.h>
+#include <string.h>
+#include <float.h>
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_cv_header_stdc=yes
+else
+  ac_cv_header_stdc=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+
+if test $ac_cv_header_stdc = yes; then
+  # SunOS 4.x string.h does not declare mem*, contrary to ANSI.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <string.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+  $EGREP "memchr" >/dev/null 2>&1; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+  # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdlib.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+  $EGREP "free" >/dev/null 2>&1; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+  # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.
+  if test "$cross_compiling" = yes; then :
+  :
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ctype.h>
+#include <stdlib.h>
+#if ((' ' & 0x0FF) == 0x020)
+# define ISLOWER(c) ('a' <= (c) && (c) <= 'z')
+# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))
+#else
+# define ISLOWER(c) \
+		   (('a' <= (c) && (c) <= 'i') \
+		     || ('j' <= (c) && (c) <= 'r') \
+		     || ('s' <= (c) && (c) <= 'z'))
+# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))
+#endif
+
+#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))
+int
+main ()
+{
+  int i;
+  for (i = 0; i < 256; i++)
+    if (XOR (islower (i), ISLOWER (i))
+	|| toupper (i) != TOUPPER (i))
+      return 2;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_run "$LINENO"; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \
+  conftest.$ac_objext conftest.beam conftest.$ac_ext
+fi
+
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5
+$as_echo "$ac_cv_header_stdc" >&6; }
+if test $ac_cv_header_stdc = yes; then
+
+$as_echo "#define STDC_HEADERS 1" >>confdefs.h
+
+fi
+
+# On IRIX 5.3, sys/types and inttypes.h are conflicting.
+for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \
+		  inttypes.h stdint.h unistd.h
+do :
+  as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh`
+ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default
+"
+if eval test \"x\$"$as_ac_Header"\" = x"yes"; then :
+  cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+
+done
+
+
+ac_fn_c_check_header_mongrel "$LINENO" "sys/times.h" "ac_cv_header_sys_times_h" "$ac_includes_default"
+if test "x$ac_cv_header_sys_times_h" = xyes; then :
+
+$as_echo "#define HAVE_TIMES_H 1" >>confdefs.h
+
+fi
+
+
+
+# Make sure we can run config.sub.
+$SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 ||
+  as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5
+$as_echo_n "checking build system type... " >&6; }
+if ${ac_cv_build+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_build_alias=$build_alias
+test "x$ac_build_alias" = x &&
+  ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"`
+test "x$ac_build_alias" = x &&
+  as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5
+ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` ||
+  as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5
+$as_echo "$ac_cv_build" >&6; }
+case $ac_cv_build in
+*-*-*) ;;
+*) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;;
+esac
+build=$ac_cv_build
+ac_save_IFS=$IFS; IFS='-'
+set x $ac_cv_build
+shift
+build_cpu=$1
+build_vendor=$2
+shift; shift
+# Remember, the first character of IFS is used to create $*,
+# except with old shells:
+build_os=$*
+IFS=$ac_save_IFS
+case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5
+$as_echo_n "checking host system type... " >&6; }
+if ${ac_cv_host+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test "x$host_alias" = x; then
+  ac_cv_host=$ac_cv_build
+else
+  ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` ||
+    as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5
+$as_echo "$ac_cv_host" >&6; }
+case $ac_cv_host in
+*-*-*) ;;
+*) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;;
+esac
+host=$ac_cv_host
+ac_save_IFS=$IFS; IFS='-'
+set x $ac_cv_host
+shift
+host_cpu=$1
+host_vendor=$2
+shift; shift
+# Remember, the first character of IFS is used to create $*,
+# except with old shells:
+host_os=$*
+IFS=$ac_save_IFS
+case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac
+
+
+enable_win32_dll=yes
+
+case $host in
+*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*)
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}as", so it can be a program name with args.
+set dummy ${ac_tool_prefix}as; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AS+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AS"; then
+  ac_cv_prog_AS="$AS" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_AS="${ac_tool_prefix}as"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AS=$ac_cv_prog_AS
+if test -n "$AS"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AS" >&5
+$as_echo "$AS" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_AS"; then
+  ac_ct_AS=$AS
+  # Extract the first word of "as", so it can be a program name with args.
+set dummy as; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_AS+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_AS"; then
+  ac_cv_prog_ac_ct_AS="$ac_ct_AS" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_AS="as"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_AS=$ac_cv_prog_ac_ct_AS
+if test -n "$ac_ct_AS"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AS" >&5
+$as_echo "$ac_ct_AS" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_AS" = x; then
+    AS="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    AS=$ac_ct_AS
+  fi
+else
+  AS="$ac_cv_prog_AS"
+fi
+
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args.
+set dummy ${ac_tool_prefix}dlltool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_DLLTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$DLLTOOL"; then
+  ac_cv_prog_DLLTOOL="$DLLTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_DLLTOOL="${ac_tool_prefix}dlltool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+DLLTOOL=$ac_cv_prog_DLLTOOL
+if test -n "$DLLTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5
+$as_echo "$DLLTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_DLLTOOL"; then
+  ac_ct_DLLTOOL=$DLLTOOL
+  # Extract the first word of "dlltool", so it can be a program name with args.
+set dummy dlltool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_DLLTOOL"; then
+  ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_DLLTOOL="dlltool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL
+if test -n "$ac_ct_DLLTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5
+$as_echo "$ac_ct_DLLTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_DLLTOOL" = x; then
+    DLLTOOL="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    DLLTOOL=$ac_ct_DLLTOOL
+  fi
+else
+  DLLTOOL="$ac_cv_prog_DLLTOOL"
+fi
+
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args.
+set dummy ${ac_tool_prefix}objdump; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_OBJDUMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$OBJDUMP"; then
+  ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+OBJDUMP=$ac_cv_prog_OBJDUMP
+if test -n "$OBJDUMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5
+$as_echo "$OBJDUMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_OBJDUMP"; then
+  ac_ct_OBJDUMP=$OBJDUMP
+  # Extract the first word of "objdump", so it can be a program name with args.
+set dummy objdump; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_OBJDUMP"; then
+  ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_OBJDUMP="objdump"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP
+if test -n "$ac_ct_OBJDUMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5
+$as_echo "$ac_ct_OBJDUMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_OBJDUMP" = x; then
+    OBJDUMP="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    OBJDUMP=$ac_ct_OBJDUMP
+  fi
+else
+  OBJDUMP="$ac_cv_prog_OBJDUMP"
+fi
+
+  ;;
+esac
+
+test -z "$AS" && AS=as
+
+
+
+
+
+test -z "$DLLTOOL" && DLLTOOL=dlltool
+
+
+
+
+
+test -z "$OBJDUMP" && OBJDUMP=objdump
+
+
+
+
+
+
+
+enable_dlopen=yes
+
+
+
+case `pwd` in
+  *\ * | *\	*)
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5
+$as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;;
+esac
+
+
+
+macro_version='2.4.2'
+macro_revision='1.3337'
+
+
+
+
+
+
+
+
+
+
+
+
+
+ltmain="$ac_aux_dir/ltmain.sh"
+
+# Backslashify metacharacters that are still active within
+# double-quoted strings.
+sed_quote_subst='s/\(["`$\\]\)/\\\1/g'
+
+# Same as above, but do not quote variable references.
+double_quote_subst='s/\(["`\\]\)/\\\1/g'
+
+# Sed substitution to delay expansion of an escaped shell variable in a
+# double_quote_subst'ed string.
+delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g'
+
+# Sed substitution to delay expansion of an escaped single quote.
+delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g'
+
+# Sed substitution to avoid accidental globbing in evaled expressions
+no_glob_subst='s/\*/\\\*/g'
+
+ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO
+ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to print strings" >&5
+$as_echo_n "checking how to print strings... " >&6; }
+# Test print first, because it will be a builtin if present.
+if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \
+   test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then
+  ECHO='print -r --'
+elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then
+  ECHO='printf %s\n'
+else
+  # Use this function as a fallback that always works.
+  func_fallback_echo ()
+  {
+    eval 'cat <<_LTECHO_EOF
+$1
+_LTECHO_EOF'
+  }
+  ECHO='func_fallback_echo'
+fi
+
+# func_echo_all arg...
+# Invoke $ECHO with all args, space-separated.
+func_echo_all ()
+{
+    $ECHO ""
+}
+
+case "$ECHO" in
+  printf*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: printf" >&5
+$as_echo "printf" >&6; } ;;
+  print*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: print -r" >&5
+$as_echo "print -r" >&6; } ;;
+  *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: cat" >&5
+$as_echo "cat" >&6; } ;;
+esac
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5
+$as_echo_n "checking for a sed that does not truncate output... " >&6; }
+if ${ac_cv_path_SED+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+            ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/
+     for ac_i in 1 2 3 4 5 6 7; do
+       ac_script="$ac_script$as_nl$ac_script"
+     done
+     echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed
+     { ac_script=; unset ac_script;}
+     if test -z "$SED"; then
+  ac_path_SED_found=false
+  # Loop through the user's path and test for each of PROGNAME-LIST
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in sed gsed; do
+    for ac_exec_ext in '' $ac_executable_extensions; do
+      ac_path_SED="$as_dir/$ac_prog$ac_exec_ext"
+      { test -f "$ac_path_SED" && $as_test_x "$ac_path_SED"; } || continue
+# Check for GNU ac_path_SED and select it if it is found.
+  # Check for GNU $ac_path_SED
+case `"$ac_path_SED" --version 2>&1` in
+*GNU*)
+  ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;;
+*)
+  ac_count=0
+  $as_echo_n 0123456789 >"conftest.in"
+  while :
+  do
+    cat "conftest.in" "conftest.in" >"conftest.tmp"
+    mv "conftest.tmp" "conftest.in"
+    cp "conftest.in" "conftest.nl"
+    $as_echo '' >> "conftest.nl"
+    "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break
+    diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+    as_fn_arith $ac_count + 1 && ac_count=$as_val
+    if test $ac_count -gt ${ac_path_SED_max-0}; then
+      # Best one so far, save it but keep looking for a better one
+      ac_cv_path_SED="$ac_path_SED"
+      ac_path_SED_max=$ac_count
+    fi
+    # 10*(2^10) chars as input seems more than enough
+    test $ac_count -gt 10 && break
+  done
+  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+      $ac_path_SED_found && break 3
+    done
+  done
+  done
+IFS=$as_save_IFS
+  if test -z "$ac_cv_path_SED"; then
+    as_fn_error $? "no acceptable sed could be found in \$PATH" "$LINENO" 5
+  fi
+else
+  ac_cv_path_SED=$SED
+fi
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5
+$as_echo "$ac_cv_path_SED" >&6; }
+ SED="$ac_cv_path_SED"
+  rm -f conftest.sed
+
+test -z "$SED" && SED=sed
+Xsed="$SED -e 1s/^X//"
+
+
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5
+$as_echo_n "checking for fgrep... " >&6; }
+if ${ac_cv_path_FGREP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1
+   then ac_cv_path_FGREP="$GREP -F"
+   else
+     if test -z "$FGREP"; then
+  ac_path_FGREP_found=false
+  # Loop through the user's path and test for each of PROGNAME-LIST
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in fgrep; do
+    for ac_exec_ext in '' $ac_executable_extensions; do
+      ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext"
+      { test -f "$ac_path_FGREP" && $as_test_x "$ac_path_FGREP"; } || continue
+# Check for GNU ac_path_FGREP and select it if it is found.
+  # Check for GNU $ac_path_FGREP
+case `"$ac_path_FGREP" --version 2>&1` in
+*GNU*)
+  ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;;
+*)
+  ac_count=0
+  $as_echo_n 0123456789 >"conftest.in"
+  while :
+  do
+    cat "conftest.in" "conftest.in" >"conftest.tmp"
+    mv "conftest.tmp" "conftest.in"
+    cp "conftest.in" "conftest.nl"
+    $as_echo 'FGREP' >> "conftest.nl"
+    "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break
+    diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
+    as_fn_arith $ac_count + 1 && ac_count=$as_val
+    if test $ac_count -gt ${ac_path_FGREP_max-0}; then
+      # Best one so far, save it but keep looking for a better one
+      ac_cv_path_FGREP="$ac_path_FGREP"
+      ac_path_FGREP_max=$ac_count
+    fi
+    # 10*(2^10) chars as input seems more than enough
+    test $ac_count -gt 10 && break
+  done
+  rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
+esac
+
+      $ac_path_FGREP_found && break 3
+    done
+  done
+  done
+IFS=$as_save_IFS
+  if test -z "$ac_cv_path_FGREP"; then
+    as_fn_error $? "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5
+  fi
+else
+  ac_cv_path_FGREP=$FGREP
+fi
+
+   fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5
+$as_echo "$ac_cv_path_FGREP" >&6; }
+ FGREP="$ac_cv_path_FGREP"
+
+
+test -z "$GREP" && GREP=grep
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+# Check whether --with-gnu-ld was given.
+if test "${with_gnu_ld+set}" = set; then :
+  withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes
+else
+  with_gnu_ld=no
+fi
+
+ac_prog=ld
+if test "$GCC" = yes; then
+  # Check if gcc -print-prog-name=ld gives a path.
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5
+$as_echo_n "checking for ld used by $CC... " >&6; }
+  case $host in
+  *-*-mingw*)
+    # gcc leaves a trailing carriage return which upsets mingw
+    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;;
+  *)
+    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;
+  esac
+  case $ac_prog in
+    # Accept absolute paths.
+    [\\/]* | ?:[\\/]*)
+      re_direlt='/[^/][^/]*/\.\./'
+      # Canonicalize the pathname of ld
+      ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'`
+      while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do
+	ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"`
+      done
+      test -z "$LD" && LD="$ac_prog"
+      ;;
+  "")
+    # If it fails, then pretend we aren't using GCC.
+    ac_prog=ld
+    ;;
+  *)
+    # If it is relative, then search for the first ld in PATH.
+    with_gnu_ld=unknown
+    ;;
+  esac
+elif test "$with_gnu_ld" = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5
+$as_echo_n "checking for GNU ld... " >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5
+$as_echo_n "checking for non-GNU ld... " >&6; }
+fi
+if ${lt_cv_path_LD+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -z "$LD"; then
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+  for ac_dir in $PATH; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then
+      lt_cv_path_LD="$ac_dir/$ac_prog"
+      # Check to see if the program is GNU ld.  I'd rather use --version,
+      # but apparently some variants of GNU ld only accept -v.
+      # Break only if it was the GNU/non-GNU ld that we prefer.
+      case `"$lt_cv_path_LD" -v 2>&1 </dev/null` in
+      *GNU* | *'with BFD'*)
+	test "$with_gnu_ld" != no && break
+	;;
+      *)
+	test "$with_gnu_ld" != yes && break
+	;;
+      esac
+    fi
+  done
+  IFS="$lt_save_ifs"
+else
+  lt_cv_path_LD="$LD" # Let the user override the test with a path.
+fi
+fi
+
+LD="$lt_cv_path_LD"
+if test -n "$LD"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LD" >&5
+$as_echo "$LD" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5
+$as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; }
+if ${lt_cv_prog_gnu_ld+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  # I'd rather use --version here, but apparently some GNU lds only accept -v.
+case `$LD -v 2>&1 </dev/null` in
+*GNU* | *'with BFD'*)
+  lt_cv_prog_gnu_ld=yes
+  ;;
+*)
+  lt_cv_prog_gnu_ld=no
+  ;;
+esac
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld" >&5
+$as_echo "$lt_cv_prog_gnu_ld" >&6; }
+with_gnu_ld=$lt_cv_prog_gnu_ld
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5
+$as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; }
+if ${lt_cv_path_NM+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$NM"; then
+  # Let the user override the test.
+  lt_cv_path_NM="$NM"
+else
+  lt_nm_to_check="${ac_tool_prefix}nm"
+  if test -n "$ac_tool_prefix" && test "$build" = "$host"; then
+    lt_nm_to_check="$lt_nm_to_check nm"
+  fi
+  for lt_tmp_nm in $lt_nm_to_check; do
+    lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+    for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do
+      IFS="$lt_save_ifs"
+      test -z "$ac_dir" && ac_dir=.
+      tmp_nm="$ac_dir/$lt_tmp_nm"
+      if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then
+	# Check to see if the nm accepts a BSD-compat flag.
+	# Adding the `sed 1q' prevents false positives on HP-UX, which says:
+	#   nm: unknown option "B" ignored
+	# Tru64's nm complains that /dev/null is an invalid object file
+	case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in
+	*/dev/null* | *'Invalid file or object type'*)
+	  lt_cv_path_NM="$tmp_nm -B"
+	  break
+	  ;;
+	*)
+	  case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in
+	  */dev/null*)
+	    lt_cv_path_NM="$tmp_nm -p"
+	    break
+	    ;;
+	  *)
+	    lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but
+	    continue # so that we can try to find one that supports BSD flags
+	    ;;
+	  esac
+	  ;;
+	esac
+      fi
+    done
+    IFS="$lt_save_ifs"
+  done
+  : ${lt_cv_path_NM=no}
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5
+$as_echo "$lt_cv_path_NM" >&6; }
+if test "$lt_cv_path_NM" != "no"; then
+  NM="$lt_cv_path_NM"
+else
+  # Didn't find any BSD compatible name lister, look for dumpbin.
+  if test -n "$DUMPBIN"; then :
+    # Let the user override the test.
+  else
+    if test -n "$ac_tool_prefix"; then
+  for ac_prog in dumpbin "link -dump"
+  do
+    # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
+set dummy $ac_tool_prefix$ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_DUMPBIN+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$DUMPBIN"; then
+  ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+DUMPBIN=$ac_cv_prog_DUMPBIN
+if test -n "$DUMPBIN"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5
+$as_echo "$DUMPBIN" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+    test -n "$DUMPBIN" && break
+  done
+fi
+if test -z "$DUMPBIN"; then
+  ac_ct_DUMPBIN=$DUMPBIN
+  for ac_prog in dumpbin "link -dump"
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_DUMPBIN"; then
+  ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_DUMPBIN="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN
+if test -n "$ac_ct_DUMPBIN"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5
+$as_echo "$ac_ct_DUMPBIN" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ac_ct_DUMPBIN" && break
+done
+
+  if test "x$ac_ct_DUMPBIN" = x; then
+    DUMPBIN=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    DUMPBIN=$ac_ct_DUMPBIN
+  fi
+fi
+
+    case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in
+    *COFF*)
+      DUMPBIN="$DUMPBIN -symbols"
+      ;;
+    *)
+      DUMPBIN=:
+      ;;
+    esac
+  fi
+
+  if test "$DUMPBIN" != ":"; then
+    NM="$DUMPBIN"
+  fi
+fi
+test -z "$NM" && NM=nm
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5
+$as_echo_n "checking the name lister ($NM) interface... " >&6; }
+if ${lt_cv_nm_interface+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_nm_interface="BSD nm"
+  echo "int some_variable = 0;" > conftest.$ac_ext
+  (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&5)
+  (eval "$ac_compile" 2>conftest.err)
+  cat conftest.err >&5
+  (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&5)
+  (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out)
+  cat conftest.err >&5
+  (eval echo "\"\$as_me:$LINENO: output\"" >&5)
+  cat conftest.out >&5
+  if $GREP 'External.*some_variable' conftest.out > /dev/null; then
+    lt_cv_nm_interface="MS dumpbin"
+  fi
+  rm -f conftest*
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5
+$as_echo "$lt_cv_nm_interface" >&6; }
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+# find the maximum length of command line arguments
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5
+$as_echo_n "checking the maximum length of command line arguments... " >&6; }
+if ${lt_cv_sys_max_cmd_len+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+    i=0
+  teststring="ABCD"
+
+  case $build_os in
+  msdosdjgpp*)
+    # On DJGPP, this test can blow up pretty badly due to problems in libc
+    # (any single argument exceeding 2000 bytes causes a buffer overrun
+    # during glob expansion).  Even if it were fixed, the result of this
+    # check would be larger than it should be.
+    lt_cv_sys_max_cmd_len=12288;    # 12K is about right
+    ;;
+
+  gnu*)
+    # Under GNU Hurd, this test is not required because there is
+    # no limit to the length of command line arguments.
+    # Libtool will interpret -1 as no limit whatsoever
+    lt_cv_sys_max_cmd_len=-1;
+    ;;
+
+  cygwin* | mingw* | cegcc*)
+    # On Win9x/ME, this test blows up -- it succeeds, but takes
+    # about 5 minutes as the teststring grows exponentially.
+    # Worse, since 9x/ME are not pre-emptively multitasking,
+    # you end up with a "frozen" computer, even though with patience
+    # the test eventually succeeds (with a max line length of 256k).
+    # Instead, let's just punt: use the minimum linelength reported by
+    # all of the supported platforms: 8192 (on NT/2K/XP).
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  mint*)
+    # On MiNT this can take a long time and run out of memory.
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  amigaos*)
+    # On AmigaOS with pdksh, this test takes hours, literally.
+    # So we just punt and use a minimum line length of 8192.
+    lt_cv_sys_max_cmd_len=8192;
+    ;;
+
+  netbsd* | freebsd* | openbsd* | darwin* | dragonfly*)
+    # This has been around since 386BSD, at least.  Likely further.
+    if test -x /sbin/sysctl; then
+      lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax`
+    elif test -x /usr/sbin/sysctl; then
+      lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax`
+    else
+      lt_cv_sys_max_cmd_len=65536	# usable default for all BSDs
+    fi
+    # And add a safety zone
+    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4`
+    lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3`
+    ;;
+
+  interix*)
+    # We know the value 262144 and hardcode it with a safety zone (like BSD)
+    lt_cv_sys_max_cmd_len=196608
+    ;;
+
+  os2*)
+    # The test takes a long time on OS/2.
+    lt_cv_sys_max_cmd_len=8192
+    ;;
+
+  osf*)
+    # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure
+    # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not
+    # nice to cause kernel panics so lets avoid the loop below.
+    # First set a reasonable default.
+    lt_cv_sys_max_cmd_len=16384
+    #
+    if test -x /sbin/sysconfig; then
+      case `/sbin/sysconfig -q proc exec_disable_arg_limit` in
+        *1*) lt_cv_sys_max_cmd_len=-1 ;;
+      esac
+    fi
+    ;;
+  sco3.2v5*)
+    lt_cv_sys_max_cmd_len=102400
+    ;;
+  sysv5* | sco5v6* | sysv4.2uw2*)
+    kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null`
+    if test -n "$kargmax"; then
+      lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[	 ]//'`
+    else
+      lt_cv_sys_max_cmd_len=32768
+    fi
+    ;;
+  *)
+    lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null`
+    if test -n "$lt_cv_sys_max_cmd_len"; then
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4`
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3`
+    else
+      # Make teststring a little bigger before we do anything with it.
+      # a 1K string should be a reasonable start.
+      for i in 1 2 3 4 5 6 7 8 ; do
+        teststring=$teststring$teststring
+      done
+      SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}}
+      # If test is not a shell built-in, we'll probably end up computing a
+      # maximum length that is only half of the actual maximum length, but
+      # we can't tell.
+      while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \
+	         = "X$teststring$teststring"; } >/dev/null 2>&1 &&
+	      test $i != 17 # 1/2 MB should be enough
+      do
+        i=`expr $i + 1`
+        teststring=$teststring$teststring
+      done
+      # Only check the string length outside the loop.
+      lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1`
+      teststring=
+      # Add a significant safety factor because C++ compilers can tack on
+      # massive amounts of additional arguments before passing them to the
+      # linker.  It appears as though 1/2 is a usable value.
+      lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2`
+    fi
+    ;;
+  esac
+
+fi
+
+if test -n $lt_cv_sys_max_cmd_len ; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5
+$as_echo "$lt_cv_sys_max_cmd_len" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5
+$as_echo "none" >&6; }
+fi
+max_cmd_len=$lt_cv_sys_max_cmd_len
+
+
+
+
+
+
+: ${CP="cp -f"}
+: ${MV="mv -f"}
+: ${RM="rm -f"}
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5
+$as_echo_n "checking whether the shell understands some XSI constructs... " >&6; }
+# Try some XSI features
+xsi_shell=no
+( _lt_dummy="a/b/c"
+  test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \
+      = c,a/b,b/c, \
+    && eval 'test $(( 1 + 1 )) -eq 2 \
+    && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \
+  && xsi_shell=yes
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5
+$as_echo "$xsi_shell" >&6; }
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5
+$as_echo_n "checking whether the shell understands \"+=\"... " >&6; }
+lt_shell_append=no
+( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \
+    >/dev/null 2>&1 \
+  && lt_shell_append=yes
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5
+$as_echo "$lt_shell_append" >&6; }
+
+
+if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
+  lt_unset=unset
+else
+  lt_unset=false
+fi
+
+
+
+
+
+# test EBCDIC or ASCII
+case `echo X|tr X '\101'` in
+ A) # ASCII based system
+    # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr
+  lt_SP2NL='tr \040 \012'
+  lt_NL2SP='tr \015\012 \040\040'
+  ;;
+ *) # EBCDIC based system
+  lt_SP2NL='tr \100 \n'
+  lt_NL2SP='tr \r\n \100\100'
+  ;;
+esac
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format" >&5
+$as_echo_n "checking how to convert $build file names to $host format... " >&6; }
+if ${lt_cv_to_host_file_cmd+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $host in
+  *-*-mingw* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32
+        ;;
+      *-*-cygwin* )
+        lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32
+        ;;
+      * ) # otherwise, assume *nix
+        lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32
+        ;;
+    esac
+    ;;
+  *-*-cygwin* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin
+        ;;
+      *-*-cygwin* )
+        lt_cv_to_host_file_cmd=func_convert_file_noop
+        ;;
+      * ) # otherwise, assume *nix
+        lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin
+        ;;
+    esac
+    ;;
+  * ) # unhandled hosts (and "normal" native builds)
+    lt_cv_to_host_file_cmd=func_convert_file_noop
+    ;;
+esac
+
+fi
+
+to_host_file_cmd=$lt_cv_to_host_file_cmd
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd" >&5
+$as_echo "$lt_cv_to_host_file_cmd" >&6; }
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format" >&5
+$as_echo_n "checking how to convert $build file names to toolchain format... " >&6; }
+if ${lt_cv_to_tool_file_cmd+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  #assume ordinary cross tools, or native build.
+lt_cv_to_tool_file_cmd=func_convert_file_noop
+case $host in
+  *-*-mingw* )
+    case $build in
+      *-*-mingw* ) # actually msys
+        lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32
+        ;;
+    esac
+    ;;
+esac
+
+fi
+
+to_tool_file_cmd=$lt_cv_to_tool_file_cmd
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd" >&5
+$as_echo "$lt_cv_to_tool_file_cmd" >&6; }
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5
+$as_echo_n "checking for $LD option to reload object files... " >&6; }
+if ${lt_cv_ld_reload_flag+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_ld_reload_flag='-r'
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5
+$as_echo "$lt_cv_ld_reload_flag" >&6; }
+reload_flag=$lt_cv_ld_reload_flag
+case $reload_flag in
+"" | " "*) ;;
+*) reload_flag=" $reload_flag" ;;
+esac
+reload_cmds='$LD$reload_flag -o $output$reload_objs'
+case $host_os in
+  cygwin* | mingw* | pw32* | cegcc*)
+    if test "$GCC" != yes; then
+      reload_cmds=false
+    fi
+    ;;
+  darwin*)
+    if test "$GCC" = yes; then
+      reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs'
+    else
+      reload_cmds='$LD$reload_flag -o $output$reload_objs'
+    fi
+    ;;
+esac
+
+
+
+
+
+
+
+
+
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args.
+set dummy ${ac_tool_prefix}objdump; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_OBJDUMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$OBJDUMP"; then
+  ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+OBJDUMP=$ac_cv_prog_OBJDUMP
+if test -n "$OBJDUMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5
+$as_echo "$OBJDUMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_OBJDUMP"; then
+  ac_ct_OBJDUMP=$OBJDUMP
+  # Extract the first word of "objdump", so it can be a program name with args.
+set dummy objdump; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_OBJDUMP"; then
+  ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_OBJDUMP="objdump"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP
+if test -n "$ac_ct_OBJDUMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5
+$as_echo "$ac_ct_OBJDUMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_OBJDUMP" = x; then
+    OBJDUMP="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    OBJDUMP=$ac_ct_OBJDUMP
+  fi
+else
+  OBJDUMP="$ac_cv_prog_OBJDUMP"
+fi
+
+test -z "$OBJDUMP" && OBJDUMP=objdump
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5
+$as_echo_n "checking how to recognize dependent libraries... " >&6; }
+if ${lt_cv_deplibs_check_method+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_file_magic_cmd='$MAGIC_CMD'
+lt_cv_file_magic_test_file=
+lt_cv_deplibs_check_method='unknown'
+# Need to set the preceding variable on all platforms that support
+# interlibrary dependencies.
+# 'none' -- dependencies not supported.
+# `unknown' -- same as none, but documents that we really don't know.
+# 'pass_all' -- all dependencies passed with no checks.
+# 'test_compile' -- check by making test program.
+# 'file_magic [[regex]]' -- check by looking for files in library path
+# which responds to the $file_magic_cmd with a given extended regex.
+# If you have `file' or equivalent on your system and you're not sure
+# whether `pass_all' will *always* work, you probably want this one.
+
+case $host_os in
+aix[4-9]*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+beos*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+bsdi[45]*)
+  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)'
+  lt_cv_file_magic_cmd='/usr/bin/file -L'
+  lt_cv_file_magic_test_file=/shlib/libc.so
+  ;;
+
+cygwin*)
+  # func_win32_libid is a shell function defined in ltmain.sh
+  lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'
+  lt_cv_file_magic_cmd='func_win32_libid'
+  ;;
+
+mingw* | pw32*)
+  # Base MSYS/MinGW do not provide the 'file' command needed by
+  # func_win32_libid shell function, so use a weaker test based on 'objdump',
+  # unless we find 'file', for example because we are cross-compiling.
+  # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin.
+  if ( test "$lt_cv_nm_interface" = "BSD nm" && file / ) >/dev/null 2>&1; then
+    lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL'
+    lt_cv_file_magic_cmd='func_win32_libid'
+  else
+    # Keep this pattern in sync with the one in func_win32_libid.
+    lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)'
+    lt_cv_file_magic_cmd='$OBJDUMP -f'
+  fi
+  ;;
+
+cegcc*)
+  # use the weaker test based on 'objdump'. See mingw*.
+  lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?'
+  lt_cv_file_magic_cmd='$OBJDUMP -f'
+  ;;
+
+darwin* | rhapsody*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+freebsd* | dragonfly*)
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then
+    case $host_cpu in
+    i*86 )
+      # Not sure whether the presence of OpenBSD here was a mistake.
+      # Let's accept both of them until this is cleared up.
+      lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library'
+      lt_cv_file_magic_cmd=/usr/bin/file
+      lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*`
+      ;;
+    esac
+  else
+    lt_cv_deplibs_check_method=pass_all
+  fi
+  ;;
+
+gnu*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+haiku*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+hpux10.20* | hpux11*)
+  lt_cv_file_magic_cmd=/usr/bin/file
+  case $host_cpu in
+  ia64*)
+    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64'
+    lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so
+    ;;
+  hppa*64*)
+    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]'
+    lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl
+    ;;
+  *)
+    lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\.[0-9]) shared library'
+    lt_cv_file_magic_test_file=/usr/lib/libc.sl
+    ;;
+  esac
+  ;;
+
+interix[3-9]*)
+  # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here
+  lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$'
+  ;;
+
+irix5* | irix6* | nonstopux*)
+  case $LD in
+  *-32|*"-32 ") libmagic=32-bit;;
+  *-n32|*"-n32 ") libmagic=N32;;
+  *-64|*"-64 ") libmagic=64-bit;;
+  *) libmagic=never-match;;
+  esac
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+# This must be glibc/ELF.
+linux* | k*bsd*-gnu | kopensolaris*-gnu)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+netbsd* | netbsdelf*-gnu)
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then
+    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$'
+  else
+    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$'
+  fi
+  ;;
+
+newos6*)
+  lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)'
+  lt_cv_file_magic_cmd=/usr/bin/file
+  lt_cv_file_magic_test_file=/usr/lib/libnls.so
+  ;;
+
+*nto* | *qnx*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+openbsd*)
+  if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$'
+  else
+    lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$'
+  fi
+  ;;
+
+osf3* | osf4* | osf5*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+rdos*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+solaris*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+
+sysv4 | sysv4.3*)
+  case $host_vendor in
+  motorola)
+    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]'
+    lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*`
+    ;;
+  ncr)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  sequent)
+    lt_cv_file_magic_cmd='/bin/file'
+    lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )'
+    ;;
+  sni)
+    lt_cv_file_magic_cmd='/bin/file'
+    lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib"
+    lt_cv_file_magic_test_file=/lib/libc.so
+    ;;
+  siemens)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  pc)
+    lt_cv_deplibs_check_method=pass_all
+    ;;
+  esac
+  ;;
+
+tpf*)
+  lt_cv_deplibs_check_method=pass_all
+  ;;
+esac
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5
+$as_echo "$lt_cv_deplibs_check_method" >&6; }
+
+file_magic_glob=
+want_nocaseglob=no
+if test "$build" = "$host"; then
+  case $host_os in
+  mingw* | pw32*)
+    if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then
+      want_nocaseglob=yes
+    else
+      file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[\1]\/[\1]\/g;/g"`
+    fi
+    ;;
+  esac
+fi
+
+file_magic_cmd=$lt_cv_file_magic_cmd
+deplibs_check_method=$lt_cv_deplibs_check_method
+test -z "$deplibs_check_method" && deplibs_check_method=unknown
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args.
+set dummy ${ac_tool_prefix}dlltool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_DLLTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$DLLTOOL"; then
+  ac_cv_prog_DLLTOOL="$DLLTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_DLLTOOL="${ac_tool_prefix}dlltool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+DLLTOOL=$ac_cv_prog_DLLTOOL
+if test -n "$DLLTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5
+$as_echo "$DLLTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_DLLTOOL"; then
+  ac_ct_DLLTOOL=$DLLTOOL
+  # Extract the first word of "dlltool", so it can be a program name with args.
+set dummy dlltool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_DLLTOOL"; then
+  ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_DLLTOOL="dlltool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL
+if test -n "$ac_ct_DLLTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5
+$as_echo "$ac_ct_DLLTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_DLLTOOL" = x; then
+    DLLTOOL="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    DLLTOOL=$ac_ct_DLLTOOL
+  fi
+else
+  DLLTOOL="$ac_cv_prog_DLLTOOL"
+fi
+
+test -z "$DLLTOOL" && DLLTOOL=dlltool
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries" >&5
+$as_echo_n "checking how to associate runtime and link libraries... " >&6; }
+if ${lt_cv_sharedlib_from_linklib_cmd+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_sharedlib_from_linklib_cmd='unknown'
+
+case $host_os in
+cygwin* | mingw* | pw32* | cegcc*)
+  # two different shell functions defined in ltmain.sh
+  # decide which to use based on capabilities of $DLLTOOL
+  case `$DLLTOOL --help 2>&1` in
+  *--identify-strict*)
+    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib
+    ;;
+  *)
+    lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback
+    ;;
+  esac
+  ;;
+*)
+  # fallback: assume linklib IS sharedlib
+  lt_cv_sharedlib_from_linklib_cmd="$ECHO"
+  ;;
+esac
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd" >&5
+$as_echo "$lt_cv_sharedlib_from_linklib_cmd" >&6; }
+sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd
+test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO
+
+
+
+
+
+
+
+if test -n "$ac_tool_prefix"; then
+  for ac_prog in ar
+  do
+    # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
+set dummy $ac_tool_prefix$ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AR+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AR"; then
+  ac_cv_prog_AR="$AR" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_AR="$ac_tool_prefix$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AR=$ac_cv_prog_AR
+if test -n "$AR"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5
+$as_echo "$AR" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+    test -n "$AR" && break
+  done
+fi
+if test -z "$AR"; then
+  ac_ct_AR=$AR
+  for ac_prog in ar
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_AR+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_AR"; then
+  ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_AR="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_AR=$ac_cv_prog_ac_ct_AR
+if test -n "$ac_ct_AR"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5
+$as_echo "$ac_ct_AR" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ac_ct_AR" && break
+done
+
+  if test "x$ac_ct_AR" = x; then
+    AR="false"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    AR=$ac_ct_AR
+  fi
+fi
+
+: ${AR=ar}
+: ${AR_FLAGS=cru}
+
+
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support" >&5
+$as_echo_n "checking for archiver @FILE support... " >&6; }
+if ${lt_cv_ar_at_file+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_ar_at_file=no
+   cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  echo conftest.$ac_objext > conftest.lst
+      lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5'
+      { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5
+  (eval $lt_ar_try) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+      if test "$ac_status" -eq 0; then
+	# Ensure the archiver fails upon bogus file names.
+	rm -f conftest.$ac_objext libconftest.a
+	{ { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5
+  (eval $lt_ar_try) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+	if test "$ac_status" -ne 0; then
+          lt_cv_ar_at_file=@
+        fi
+      fi
+      rm -f conftest.* libconftest.a
+
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file" >&5
+$as_echo "$lt_cv_ar_at_file" >&6; }
+
+if test "x$lt_cv_ar_at_file" = xno; then
+  archiver_list_spec=
+else
+  archiver_list_spec=$lt_cv_ar_at_file
+fi
+
+
+
+
+
+
+
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+test -z "$STRIP" && STRIP=:
+
+
+
+
+
+
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args.
+set dummy ${ac_tool_prefix}ranlib; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_RANLIB+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$RANLIB"; then
+  ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+RANLIB=$ac_cv_prog_RANLIB
+if test -n "$RANLIB"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5
+$as_echo "$RANLIB" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_RANLIB"; then
+  ac_ct_RANLIB=$RANLIB
+  # Extract the first word of "ranlib", so it can be a program name with args.
+set dummy ranlib; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_RANLIB+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_RANLIB"; then
+  ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_RANLIB="ranlib"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB
+if test -n "$ac_ct_RANLIB"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5
+$as_echo "$ac_ct_RANLIB" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_RANLIB" = x; then
+    RANLIB=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    RANLIB=$ac_ct_RANLIB
+  fi
+else
+  RANLIB="$ac_cv_prog_RANLIB"
+fi
+
+test -z "$RANLIB" && RANLIB=:
+
+
+
+
+
+
+# Determine commands to create old-style static archives.
+old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs'
+old_postinstall_cmds='chmod 644 $oldlib'
+old_postuninstall_cmds=
+
+if test -n "$RANLIB"; then
+  case $host_os in
+  openbsd*)
+    old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib"
+    ;;
+  *)
+    old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib"
+    ;;
+  esac
+  old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib"
+fi
+
+case $host_os in
+  darwin*)
+    lock_old_archive_extraction=yes ;;
+  *)
+    lock_old_archive_extraction=no ;;
+esac
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+# If no C compiler was specified, use CC.
+LTCC=${LTCC-"$CC"}
+
+# If no C compiler flags were specified, use CFLAGS.
+LTCFLAGS=${LTCFLAGS-"$CFLAGS"}
+
+# Allow CC to be a program name with arguments.
+compiler=$CC
+
+
+# Check for command to grab the raw symbol name followed by C symbol from nm.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5
+$as_echo_n "checking command to parse $NM output from $compiler object... " >&6; }
+if ${lt_cv_sys_global_symbol_pipe+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+
+# These are sane defaults that work on at least a few old systems.
+# [They come from Ultrix.  What could be older than Ultrix?!! ;)]
+
+# Character class describing NM global symbol codes.
+symcode='[BCDEGRST]'
+
+# Regexp to match symbols that can be accessed directly from C.
+sympat='\([_A-Za-z][_A-Za-z0-9]*\)'
+
+# Define system-specific variables.
+case $host_os in
+aix*)
+  symcode='[BCDT]'
+  ;;
+cygwin* | mingw* | pw32* | cegcc*)
+  symcode='[ABCDGISTW]'
+  ;;
+hpux*)
+  if test "$host_cpu" = ia64; then
+    symcode='[ABCDEGRST]'
+  fi
+  ;;
+irix* | nonstopux*)
+  symcode='[BCDEGRST]'
+  ;;
+osf*)
+  symcode='[BCDEGQRST]'
+  ;;
+solaris*)
+  symcode='[BDRT]'
+  ;;
+sco3.2v5*)
+  symcode='[DT]'
+  ;;
+sysv4.2uw2*)
+  symcode='[DT]'
+  ;;
+sysv5* | sco5v6* | unixware* | OpenUNIX*)
+  symcode='[ABDT]'
+  ;;
+sysv4)
+  symcode='[DFNSTU]'
+  ;;
+esac
+
+# If we're using GNU nm, then use its standard symbol codes.
+case `$NM -V 2>&1` in
+*GNU* | *'with BFD'*)
+  symcode='[ABCDGIRSTW]' ;;
+esac
+
+# Transform an extracted symbol line into a proper C declaration.
+# Some systems (esp. on ia64) link data and code symbols differently,
+# so use this general approach.
+lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'"
+
+# Transform an extracted symbol line into symbol name and symbol address
+lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\)[ ]*$/  {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/  {\"\2\", (void *) \&\2},/p'"
+lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/  {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/  {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/  {\"lib\2\", (void *) \&\2},/p'"
+
+# Handle CRLF in mingw tool chain
+opt_cr=
+case $build_os in
+mingw*)
+  opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp
+  ;;
+esac
+
+# Try without a prefix underscore, then with it.
+for ac_symprfx in "" "_"; do
+
+  # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol.
+  symxfrm="\\1 $ac_symprfx\\2 \\2"
+
+  # Write the raw and C identifiers.
+  if test "$lt_cv_nm_interface" = "MS dumpbin"; then
+    # Fake it for dumpbin and say T for any non-static function
+    # and D for any global variable.
+    # Also find C++ and __fastcall symbols from MSVC++,
+    # which start with @ or ?.
+    lt_cv_sys_global_symbol_pipe="$AWK '"\
+"     {last_section=section; section=\$ 3};"\
+"     /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\
+"     /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\
+"     \$ 0!~/External *\|/{next};"\
+"     / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\
+"     {if(hide[section]) next};"\
+"     {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\
+"     {split(\$ 0, a, /\||\r/); split(a[2], s)};"\
+"     s[1]~/^[@?]/{print s[1], s[1]; next};"\
+"     s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\
+"     ' prfx=^$ac_symprfx"
+  else
+    lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[	 ]\($symcode$symcode*\)[	 ][	 ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'"
+  fi
+  lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'"
+
+  # Check to see that the pipe works correctly.
+  pipe_works=no
+
+  rm -f conftest*
+  cat > conftest.$ac_ext <<_LT_EOF
+#ifdef __cplusplus
+extern "C" {
+#endif
+char nm_test_var;
+void nm_test_func(void);
+void nm_test_func(void){}
+#ifdef __cplusplus
+}
+#endif
+int main(){nm_test_var='a';nm_test_func();return(0);}
+_LT_EOF
+
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+    # Now try to grab the symbols.
+    nlist=conftest.nm
+    if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist\""; } >&5
+  (eval $NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && test -s "$nlist"; then
+      # Try sorting and uniquifying the output.
+      if sort "$nlist" | uniq > "$nlist"T; then
+	mv -f "$nlist"T "$nlist"
+      else
+	rm -f "$nlist"T
+      fi
+
+      # Make sure that we snagged all the symbols we need.
+      if $GREP ' nm_test_var$' "$nlist" >/dev/null; then
+	if $GREP ' nm_test_func$' "$nlist" >/dev/null; then
+	  cat <<_LT_EOF > conftest.$ac_ext
+/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */
+#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)
+/* DATA imports from DLLs on WIN32 con't be const, because runtime
+   relocations are performed -- see ld's documentation on pseudo-relocs.  */
+# define LT_DLSYM_CONST
+#elif defined(__osf__)
+/* This system does not cope well with relocations in const data.  */
+# define LT_DLSYM_CONST
+#else
+# define LT_DLSYM_CONST const
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+_LT_EOF
+	  # Now generate the symbol file.
+	  eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext'
+
+	  cat <<_LT_EOF >> conftest.$ac_ext
+
+/* The mapping between symbol names and symbols.  */
+LT_DLSYM_CONST struct {
+  const char *name;
+  void       *address;
+}
+lt__PROGRAM__LTX_preloaded_symbols[] =
+{
+  { "@PROGRAM@", (void *) 0 },
+_LT_EOF
+	  $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/  {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext
+	  cat <<\_LT_EOF >> conftest.$ac_ext
+  {0, (void *) 0}
+};
+
+/* This works around a problem in FreeBSD linker */
+#ifdef FREEBSD_WORKAROUND
+static const void *lt_preloaded_setup() {
+  return lt__PROGRAM__LTX_preloaded_symbols;
+}
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+_LT_EOF
+	  # Now try linking the two files.
+	  mv conftest.$ac_objext conftstm.$ac_objext
+	  lt_globsym_save_LIBS=$LIBS
+	  lt_globsym_save_CFLAGS=$CFLAGS
+	  LIBS="conftstm.$ac_objext"
+	  CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag"
+	  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5
+  (eval $ac_link) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && test -s conftest${ac_exeext}; then
+	    pipe_works=yes
+	  fi
+	  LIBS=$lt_globsym_save_LIBS
+	  CFLAGS=$lt_globsym_save_CFLAGS
+	else
+	  echo "cannot find nm_test_func in $nlist" >&5
+	fi
+      else
+	echo "cannot find nm_test_var in $nlist" >&5
+      fi
+    else
+      echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5
+    fi
+  else
+    echo "$progname: failed program was:" >&5
+    cat conftest.$ac_ext >&5
+  fi
+  rm -rf conftest* conftst*
+
+  # Do not use the global_symbol_pipe unless it works.
+  if test "$pipe_works" = yes; then
+    break
+  else
+    lt_cv_sys_global_symbol_pipe=
+  fi
+done
+
+fi
+
+if test -z "$lt_cv_sys_global_symbol_pipe"; then
+  lt_cv_sys_global_symbol_to_cdecl=
+fi
+if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5
+$as_echo "failed" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5
+$as_echo "ok" >&6; }
+fi
+
+# Response file support.
+if test "$lt_cv_nm_interface" = "MS dumpbin"; then
+  nm_file_list_spec='@'
+elif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then
+  nm_file_list_spec='@'
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for sysroot" >&5
+$as_echo_n "checking for sysroot... " >&6; }
+
+# Check whether --with-sysroot was given.
+if test "${with_sysroot+set}" = set; then :
+  withval=$with_sysroot;
+else
+  with_sysroot=no
+fi
+
+
+lt_sysroot=
+case ${with_sysroot} in #(
+ yes)
+   if test "$GCC" = yes; then
+     lt_sysroot=`$CC --print-sysroot 2>/dev/null`
+   fi
+   ;; #(
+ /*)
+   lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"`
+   ;; #(
+ no|'')
+   ;; #(
+ *)
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${with_sysroot}" >&5
+$as_echo "${with_sysroot}" >&6; }
+   as_fn_error $? "The sysroot must be an absolute path." "$LINENO" 5
+   ;;
+esac
+
+ { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}" >&5
+$as_echo "${lt_sysroot:-no}" >&6; }
+
+
+
+
+
+# Check whether --enable-libtool-lock was given.
+if test "${enable_libtool_lock+set}" = set; then :
+  enableval=$enable_libtool_lock;
+fi
+
+test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes
+
+# Some flags need to be propagated to the compiler or linker for good
+# libtool support.
+case $host in
+ia64-*-hpux*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+    case `/usr/bin/file conftest.$ac_objext` in
+      *ELF-32*)
+	HPUX_IA64_MODE="32"
+	;;
+      *ELF-64*)
+	HPUX_IA64_MODE="64"
+	;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+*-*-irix6*)
+  # Find out which ABI we are using.
+  echo '#line '$LINENO' "configure"' > conftest.$ac_ext
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+    if test "$lt_cv_prog_gnu_ld" = yes; then
+      case `/usr/bin/file conftest.$ac_objext` in
+	*32-bit*)
+	  LD="${LD-ld} -melf32bsmip"
+	  ;;
+	*N32*)
+	  LD="${LD-ld} -melf32bmipn32"
+	  ;;
+	*64-bit*)
+	  LD="${LD-ld} -melf64bmip"
+	;;
+      esac
+    else
+      case `/usr/bin/file conftest.$ac_objext` in
+	*32-bit*)
+	  LD="${LD-ld} -32"
+	  ;;
+	*N32*)
+	  LD="${LD-ld} -n32"
+	  ;;
+	*64-bit*)
+	  LD="${LD-ld} -64"
+	  ;;
+      esac
+    fi
+  fi
+  rm -rf conftest*
+  ;;
+
+x86_64-*kfreebsd*-gnu|x86_64-*linux*|ppc*-*linux*|powerpc*-*linux*| \
+s390*-*linux*|s390*-*tpf*|sparc*-*linux*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+    case `/usr/bin/file conftest.o` in
+      *32-bit*)
+	case $host in
+	  x86_64-*kfreebsd*-gnu)
+	    LD="${LD-ld} -m elf_i386_fbsd"
+	    ;;
+	  x86_64-*linux*)
+	    LD="${LD-ld} -m elf_i386"
+	    ;;
+	  ppc64-*linux*|powerpc64-*linux*)
+	    LD="${LD-ld} -m elf32ppclinux"
+	    ;;
+	  s390x-*linux*)
+	    LD="${LD-ld} -m elf_s390"
+	    ;;
+	  sparc64-*linux*)
+	    LD="${LD-ld} -m elf32_sparc"
+	    ;;
+	esac
+	;;
+      *64-bit*)
+	case $host in
+	  x86_64-*kfreebsd*-gnu)
+	    LD="${LD-ld} -m elf_x86_64_fbsd"
+	    ;;
+	  x86_64-*linux*)
+	    LD="${LD-ld} -m elf_x86_64"
+	    ;;
+	  ppc*-*linux*|powerpc*-*linux*)
+	    LD="${LD-ld} -m elf64ppc"
+	    ;;
+	  s390*-*linux*|s390*-*tpf*)
+	    LD="${LD-ld} -m elf64_s390"
+	    ;;
+	  sparc*-*linux*)
+	    LD="${LD-ld} -m elf64_sparc"
+	    ;;
+	esac
+	;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+
+*-*-sco3.2v5*)
+  # On SCO OpenServer 5, we need -belf to get full-featured binaries.
+  SAVE_CFLAGS="$CFLAGS"
+  CFLAGS="$CFLAGS -belf"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5
+$as_echo_n "checking whether the C compiler needs -belf... " >&6; }
+if ${lt_cv_cc_needs_belf+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+     cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  lt_cv_cc_needs_belf=yes
+else
+  lt_cv_cc_needs_belf=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+     ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5
+$as_echo "$lt_cv_cc_needs_belf" >&6; }
+  if test x"$lt_cv_cc_needs_belf" != x"yes"; then
+    # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf
+    CFLAGS="$SAVE_CFLAGS"
+  fi
+  ;;
+*-*solaris*)
+  # Find out which ABI we are using.
+  echo 'int i;' > conftest.$ac_ext
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+    case `/usr/bin/file conftest.o` in
+    *64-bit*)
+      case $lt_cv_prog_gnu_ld in
+      yes*)
+        case $host in
+        i?86-*-solaris*)
+          LD="${LD-ld} -m elf_x86_64"
+          ;;
+        sparc*-*-solaris*)
+          LD="${LD-ld} -m elf64_sparc"
+          ;;
+        esac
+        # GNU ld 2.21 introduced _sol2 emulations.  Use them if available.
+        if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then
+          LD="${LD-ld}_sol2"
+        fi
+        ;;
+      *)
+	if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then
+	  LD="${LD-ld} -64"
+	fi
+	;;
+      esac
+      ;;
+    esac
+  fi
+  rm -rf conftest*
+  ;;
+esac
+
+need_locks="$enable_libtool_lock"
+
+if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}mt", so it can be a program name with args.
+set dummy ${ac_tool_prefix}mt; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_MANIFEST_TOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$MANIFEST_TOOL"; then
+  ac_cv_prog_MANIFEST_TOOL="$MANIFEST_TOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_MANIFEST_TOOL="${ac_tool_prefix}mt"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+MANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL
+if test -n "$MANIFEST_TOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL" >&5
+$as_echo "$MANIFEST_TOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_MANIFEST_TOOL"; then
+  ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL
+  # Extract the first word of "mt", so it can be a program name with args.
+set dummy mt; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_MANIFEST_TOOL"; then
+  ac_cv_prog_ac_ct_MANIFEST_TOOL="$ac_ct_MANIFEST_TOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_MANIFEST_TOOL="mt"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL
+if test -n "$ac_ct_MANIFEST_TOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL" >&5
+$as_echo "$ac_ct_MANIFEST_TOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_MANIFEST_TOOL" = x; then
+    MANIFEST_TOOL=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL
+  fi
+else
+  MANIFEST_TOOL="$ac_cv_prog_MANIFEST_TOOL"
+fi
+
+test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool" >&5
+$as_echo_n "checking if $MANIFEST_TOOL is a manifest tool... " >&6; }
+if ${lt_cv_path_mainfest_tool+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_path_mainfest_tool=no
+  echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&5
+  $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out
+  cat conftest.err >&5
+  if $GREP 'Manifest Tool' conftest.out > /dev/null; then
+    lt_cv_path_mainfest_tool=yes
+  fi
+  rm -f conftest*
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool" >&5
+$as_echo "$lt_cv_path_mainfest_tool" >&6; }
+if test "x$lt_cv_path_mainfest_tool" != xyes; then
+  MANIFEST_TOOL=:
+fi
+
+
+
+
+
+
+  case $host_os in
+    rhapsody* | darwin*)
+    if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args.
+set dummy ${ac_tool_prefix}dsymutil; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_DSYMUTIL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$DSYMUTIL"; then
+  ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+DSYMUTIL=$ac_cv_prog_DSYMUTIL
+if test -n "$DSYMUTIL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5
+$as_echo "$DSYMUTIL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_DSYMUTIL"; then
+  ac_ct_DSYMUTIL=$DSYMUTIL
+  # Extract the first word of "dsymutil", so it can be a program name with args.
+set dummy dsymutil; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_DSYMUTIL"; then
+  ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_DSYMUTIL="dsymutil"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL
+if test -n "$ac_ct_DSYMUTIL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5
+$as_echo "$ac_ct_DSYMUTIL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_DSYMUTIL" = x; then
+    DSYMUTIL=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    DSYMUTIL=$ac_ct_DSYMUTIL
+  fi
+else
+  DSYMUTIL="$ac_cv_prog_DSYMUTIL"
+fi
+
+    if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args.
+set dummy ${ac_tool_prefix}nmedit; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_NMEDIT+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$NMEDIT"; then
+  ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+NMEDIT=$ac_cv_prog_NMEDIT
+if test -n "$NMEDIT"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5
+$as_echo "$NMEDIT" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_NMEDIT"; then
+  ac_ct_NMEDIT=$NMEDIT
+  # Extract the first word of "nmedit", so it can be a program name with args.
+set dummy nmedit; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_NMEDIT+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_NMEDIT"; then
+  ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_NMEDIT="nmedit"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT
+if test -n "$ac_ct_NMEDIT"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5
+$as_echo "$ac_ct_NMEDIT" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_NMEDIT" = x; then
+    NMEDIT=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    NMEDIT=$ac_ct_NMEDIT
+  fi
+else
+  NMEDIT="$ac_cv_prog_NMEDIT"
+fi
+
+    if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args.
+set dummy ${ac_tool_prefix}lipo; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_LIPO+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$LIPO"; then
+  ac_cv_prog_LIPO="$LIPO" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_LIPO="${ac_tool_prefix}lipo"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+LIPO=$ac_cv_prog_LIPO
+if test -n "$LIPO"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5
+$as_echo "$LIPO" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_LIPO"; then
+  ac_ct_LIPO=$LIPO
+  # Extract the first word of "lipo", so it can be a program name with args.
+set dummy lipo; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_LIPO+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_LIPO"; then
+  ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_LIPO="lipo"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO
+if test -n "$ac_ct_LIPO"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5
+$as_echo "$ac_ct_LIPO" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_LIPO" = x; then
+    LIPO=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    LIPO=$ac_ct_LIPO
+  fi
+else
+  LIPO="$ac_cv_prog_LIPO"
+fi
+
+    if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args.
+set dummy ${ac_tool_prefix}otool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_OTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$OTOOL"; then
+  ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_OTOOL="${ac_tool_prefix}otool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+OTOOL=$ac_cv_prog_OTOOL
+if test -n "$OTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5
+$as_echo "$OTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_OTOOL"; then
+  ac_ct_OTOOL=$OTOOL
+  # Extract the first word of "otool", so it can be a program name with args.
+set dummy otool; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_OTOOL+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_OTOOL"; then
+  ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_OTOOL="otool"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL
+if test -n "$ac_ct_OTOOL"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5
+$as_echo "$ac_ct_OTOOL" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_OTOOL" = x; then
+    OTOOL=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    OTOOL=$ac_ct_OTOOL
+  fi
+else
+  OTOOL="$ac_cv_prog_OTOOL"
+fi
+
+    if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args.
+set dummy ${ac_tool_prefix}otool64; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_OTOOL64+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$OTOOL64"; then
+  ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+OTOOL64=$ac_cv_prog_OTOOL64
+if test -n "$OTOOL64"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5
+$as_echo "$OTOOL64" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_OTOOL64"; then
+  ac_ct_OTOOL64=$OTOOL64
+  # Extract the first word of "otool64", so it can be a program name with args.
+set dummy otool64; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_OTOOL64+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_OTOOL64"; then
+  ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_prog_ac_ct_OTOOL64="otool64"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64
+if test -n "$ac_ct_OTOOL64"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5
+$as_echo "$ac_ct_OTOOL64" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_OTOOL64" = x; then
+    OTOOL64=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    OTOOL64=$ac_ct_OTOOL64
+  fi
+else
+  OTOOL64="$ac_cv_prog_OTOOL64"
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5
+$as_echo_n "checking for -single_module linker flag... " >&6; }
+if ${lt_cv_apple_cc_single_mod+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_apple_cc_single_mod=no
+      if test -z "${LT_MULTI_MODULE}"; then
+	# By default we will add the -single_module flag. You can override
+	# by either setting the environment variable LT_MULTI_MODULE
+	# non-empty at configure time, or by adding -multi_module to the
+	# link flags.
+	rm -rf libconftest.dylib*
+	echo "int foo(void){return 1;}" > conftest.c
+	echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
+-dynamiclib -Wl,-single_module conftest.c" >&5
+	$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
+	  -dynamiclib -Wl,-single_module conftest.c 2>conftest.err
+        _lt_result=$?
+	# If there is a non-empty error log, and "single_module"
+	# appears in it, assume the flag caused a linker warning
+        if test -s conftest.err && $GREP single_module conftest.err; then
+	  cat conftest.err >&5
+	# Otherwise, if the output was created with a 0 exit code from
+	# the compiler, it worked.
+	elif test -f libconftest.dylib && test $_lt_result -eq 0; then
+	  lt_cv_apple_cc_single_mod=yes
+	else
+	  cat conftest.err >&5
+	fi
+	rm -rf libconftest.dylib*
+	rm -f conftest.*
+      fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5
+$as_echo "$lt_cv_apple_cc_single_mod" >&6; }
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5
+$as_echo_n "checking for -exported_symbols_list linker flag... " >&6; }
+if ${lt_cv_ld_exported_symbols_list+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_ld_exported_symbols_list=no
+      save_LDFLAGS=$LDFLAGS
+      echo "_main" > conftest.sym
+      LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym"
+      cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  lt_cv_ld_exported_symbols_list=yes
+else
+  lt_cv_ld_exported_symbols_list=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+	LDFLAGS="$save_LDFLAGS"
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5
+$as_echo "$lt_cv_ld_exported_symbols_list" >&6; }
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag" >&5
+$as_echo_n "checking for -force_load linker flag... " >&6; }
+if ${lt_cv_ld_force_load+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_ld_force_load=no
+      cat > conftest.c << _LT_EOF
+int forced_loaded() { return 2;}
+_LT_EOF
+      echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&5
+      $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5
+      echo "$AR cru libconftest.a conftest.o" >&5
+      $AR cru libconftest.a conftest.o 2>&5
+      echo "$RANLIB libconftest.a" >&5
+      $RANLIB libconftest.a 2>&5
+      cat > conftest.c << _LT_EOF
+int main() { return 0;}
+_LT_EOF
+      echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&5
+      $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err
+      _lt_result=$?
+      if test -s conftest.err && $GREP force_load conftest.err; then
+	cat conftest.err >&5
+      elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then
+	lt_cv_ld_force_load=yes
+      else
+	cat conftest.err >&5
+      fi
+        rm -f conftest.err libconftest.a conftest conftest.c
+        rm -rf conftest.dSYM
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load" >&5
+$as_echo "$lt_cv_ld_force_load" >&6; }
+    case $host_os in
+    rhapsody* | darwin1.[012])
+      _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;;
+    darwin1.*)
+      _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;
+    darwin*) # darwin 5.x on
+      # if running on 10.5 or later, the deployment target defaults
+      # to the OS version, if on x86, and 10.4, the deployment
+      # target defaults to 10.4. Don't you love it?
+      case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in
+	10.0,*86*-darwin8*|10.0,*-darwin[91]*)
+	  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;
+	10.[012]*)
+	  _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;
+	10.*)
+	  _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;
+      esac
+    ;;
+  esac
+    if test "$lt_cv_apple_cc_single_mod" = "yes"; then
+      _lt_dar_single_mod='$single_module'
+    fi
+    if test "$lt_cv_ld_exported_symbols_list" = "yes"; then
+      _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym'
+    else
+      _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}'
+    fi
+    if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then
+      _lt_dsymutil='~$DSYMUTIL $lib || :'
+    else
+      _lt_dsymutil=
+    fi
+    ;;
+  esac
+
+for ac_header in dlfcn.h
+do :
+  ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default
+"
+if test "x$ac_cv_header_dlfcn_h" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_DLFCN_H 1
+_ACEOF
+
+fi
+
+done
+
+
+
+func_stripname_cnf ()
+{
+  case ${2} in
+  .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;;
+  *)  func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;;
+  esac
+} # func_stripname_cnf
+
+
+
+
+
+# Set options
+
+
+
+
+
+            # Check whether --enable-shared was given.
+if test "${enable_shared+set}" = set; then :
+  enableval=$enable_shared; p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_shared=yes ;;
+    no) enable_shared=no ;;
+    *)
+      enable_shared=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_shared=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac
+else
+  enable_shared=yes
+fi
+
+
+
+
+
+
+
+
+
+  # Check whether --enable-static was given.
+if test "${enable_static+set}" = set; then :
+  enableval=$enable_static; p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_static=yes ;;
+    no) enable_static=no ;;
+    *)
+     enable_static=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_static=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac
+else
+  enable_static=yes
+fi
+
+
+
+
+
+
+
+
+
+
+# Check whether --with-pic was given.
+if test "${with_pic+set}" = set; then :
+  withval=$with_pic; lt_p=${PACKAGE-default}
+    case $withval in
+    yes|no) pic_mode=$withval ;;
+    *)
+      pic_mode=default
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for lt_pkg in $withval; do
+	IFS="$lt_save_ifs"
+	if test "X$lt_pkg" = "X$lt_p"; then
+	  pic_mode=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac
+else
+  pic_mode=default
+fi
+
+
+test -z "$pic_mode" && pic_mode=default
+
+
+
+
+
+
+
+  # Check whether --enable-fast-install was given.
+if test "${enable_fast_install+set}" = set; then :
+  enableval=$enable_fast_install; p=${PACKAGE-default}
+    case $enableval in
+    yes) enable_fast_install=yes ;;
+    no) enable_fast_install=no ;;
+    *)
+      enable_fast_install=no
+      # Look at the argument we got.  We use all the common list separators.
+      lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR,"
+      for pkg in $enableval; do
+	IFS="$lt_save_ifs"
+	if test "X$pkg" = "X$p"; then
+	  enable_fast_install=yes
+	fi
+      done
+      IFS="$lt_save_ifs"
+      ;;
+    esac
+else
+  enable_fast_install=yes
+fi
+
+
+
+
+
+
+
+
+
+
+
+# This can be used to rebuild libtool when needed
+LIBTOOL_DEPS="$ltmain"
+
+# Always use our own libtool.
+LIBTOOL='$(SHELL) $(top_builddir)/libtool'
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test -z "$LN_S" && LN_S="ln -s"
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+if test -n "${ZSH_VERSION+set}" ; then
+   setopt NO_GLOB_SUBST
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5
+$as_echo_n "checking for objdir... " >&6; }
+if ${lt_cv_objdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  rm -f .libs 2>/dev/null
+mkdir .libs 2>/dev/null
+if test -d .libs; then
+  lt_cv_objdir=.libs
+else
+  # MS-DOS does not allow filenames that begin with a dot.
+  lt_cv_objdir=_libs
+fi
+rmdir .libs 2>/dev/null
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5
+$as_echo "$lt_cv_objdir" >&6; }
+objdir=$lt_cv_objdir
+
+
+
+
+
+cat >>confdefs.h <<_ACEOF
+#define LT_OBJDIR "$lt_cv_objdir/"
+_ACEOF
+
+
+
+
+case $host_os in
+aix3*)
+  # AIX sometimes has problems with the GCC collect2 program.  For some
+  # reason, if we set the COLLECT_NAMES environment variable, the problems
+  # vanish in a puff of smoke.
+  if test "X${COLLECT_NAMES+set}" != Xset; then
+    COLLECT_NAMES=
+    export COLLECT_NAMES
+  fi
+  ;;
+esac
+
+# Global variables:
+ofile=libtool
+can_build_shared=yes
+
+# All known linkers require a `.a' archive for static linking (except MSVC,
+# which needs '.lib').
+libext=a
+
+with_gnu_ld="$lt_cv_prog_gnu_ld"
+
+old_CC="$CC"
+old_CFLAGS="$CFLAGS"
+
+# Set sane defaults for various variables
+test -z "$CC" && CC=cc
+test -z "$LTCC" && LTCC=$CC
+test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS
+test -z "$LD" && LD=ld
+test -z "$ac_objext" && ac_objext=o
+
+for cc_temp in $compiler""; do
+  case $cc_temp in
+    compile | *[\\/]compile | ccache | *[\\/]ccache ) ;;
+    distcc | *[\\/]distcc | purify | *[\\/]purify ) ;;
+    \-*) ;;
+    *) break;;
+  esac
+done
+cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"`
+
+
+# Only perform the check for file, if the check method requires it
+test -z "$MAGIC_CMD" && MAGIC_CMD=file
+case $deplibs_check_method in
+file_magic*)
+  if test "$file_magic_cmd" = '$MAGIC_CMD'; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5
+$as_echo_n "checking for ${ac_tool_prefix}file... " >&6; }
+if ${lt_cv_path_MAGIC_CMD+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $MAGIC_CMD in
+[\\/*] |  ?:[\\/]*)
+  lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path.
+  ;;
+*)
+  lt_save_MAGIC_CMD="$MAGIC_CMD"
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+  ac_dummy="/usr/bin$PATH_SEPARATOR$PATH"
+  for ac_dir in $ac_dummy; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f $ac_dir/${ac_tool_prefix}file; then
+      lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file"
+      if test -n "$file_magic_test_file"; then
+	case $deplibs_check_method in
+	"file_magic "*)
+	  file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"`
+	  MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+	  if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null |
+	    $EGREP "$file_magic_regex" > /dev/null; then
+	    :
+	  else
+	    cat <<_LT_EOF 1>&2
+
+*** Warning: the command libtool uses to detect shared libraries,
+*** $file_magic_cmd, produces output that libtool cannot recognize.
+*** The result is that libtool may fail to recognize shared libraries
+*** as such.  This will affect the creation of libtool libraries that
+*** depend on shared libraries, but programs linked with such libtool
+*** libraries will work regardless of this problem.  Nevertheless, you
+*** may want to report the problem to your system manager and/or to
+*** bug-libtool@gnu.org
+
+_LT_EOF
+	  fi ;;
+	esac
+      fi
+      break
+    fi
+  done
+  IFS="$lt_save_ifs"
+  MAGIC_CMD="$lt_save_MAGIC_CMD"
+  ;;
+esac
+fi
+
+MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+if test -n "$MAGIC_CMD"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5
+$as_echo "$MAGIC_CMD" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+
+
+
+if test -z "$lt_cv_path_MAGIC_CMD"; then
+  if test -n "$ac_tool_prefix"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5
+$as_echo_n "checking for file... " >&6; }
+if ${lt_cv_path_MAGIC_CMD+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $MAGIC_CMD in
+[\\/*] |  ?:[\\/]*)
+  lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path.
+  ;;
+*)
+  lt_save_MAGIC_CMD="$MAGIC_CMD"
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+  ac_dummy="/usr/bin$PATH_SEPARATOR$PATH"
+  for ac_dir in $ac_dummy; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f $ac_dir/file; then
+      lt_cv_path_MAGIC_CMD="$ac_dir/file"
+      if test -n "$file_magic_test_file"; then
+	case $deplibs_check_method in
+	"file_magic "*)
+	  file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"`
+	  MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+	  if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null |
+	    $EGREP "$file_magic_regex" > /dev/null; then
+	    :
+	  else
+	    cat <<_LT_EOF 1>&2
+
+*** Warning: the command libtool uses to detect shared libraries,
+*** $file_magic_cmd, produces output that libtool cannot recognize.
+*** The result is that libtool may fail to recognize shared libraries
+*** as such.  This will affect the creation of libtool libraries that
+*** depend on shared libraries, but programs linked with such libtool
+*** libraries will work regardless of this problem.  Nevertheless, you
+*** may want to report the problem to your system manager and/or to
+*** bug-libtool@gnu.org
+
+_LT_EOF
+	  fi ;;
+	esac
+      fi
+      break
+    fi
+  done
+  IFS="$lt_save_ifs"
+  MAGIC_CMD="$lt_save_MAGIC_CMD"
+  ;;
+esac
+fi
+
+MAGIC_CMD="$lt_cv_path_MAGIC_CMD"
+if test -n "$MAGIC_CMD"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5
+$as_echo "$MAGIC_CMD" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  else
+    MAGIC_CMD=:
+  fi
+fi
+
+  fi
+  ;;
+esac
+
+# Use C for the default configuration in the libtool script
+
+lt_save_CC="$CC"
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+# Source file extension for C test sources.
+ac_ext=c
+
+# Object file extension for compiled C test sources.
+objext=o
+objext=$objext
+
+# Code to be used in simple compile tests
+lt_simple_compile_test_code="int some_variable = 0;"
+
+# Code to be used in simple link tests
+lt_simple_link_test_code='int main(){return(0);}'
+
+
+
+
+
+
+
+# If no C compiler was specified, use CC.
+LTCC=${LTCC-"$CC"}
+
+# If no C compiler flags were specified, use CFLAGS.
+LTCFLAGS=${LTCFLAGS-"$CFLAGS"}
+
+# Allow CC to be a program name with arguments.
+compiler=$CC
+
+# Save the default compiler, since it gets overwritten when the other
+# tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP.
+compiler_DEFAULT=$CC
+
+# save warnings/boilerplate of simple test code
+ac_outfile=conftest.$ac_objext
+echo "$lt_simple_compile_test_code" >conftest.$ac_ext
+eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_compiler_boilerplate=`cat conftest.err`
+$RM conftest*
+
+ac_outfile=conftest.$ac_objext
+echo "$lt_simple_link_test_code" >conftest.$ac_ext
+eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_linker_boilerplate=`cat conftest.err`
+$RM -r conftest*
+
+
+if test -n "$compiler"; then
+
+lt_prog_compiler_no_builtin_flag=
+
+if test "$GCC" = yes; then
+  case $cc_basename in
+  nvcc*)
+    lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;;
+  *)
+    lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;;
+  esac
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5
+$as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; }
+if ${lt_cv_prog_compiler_rtti_exceptions+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_rtti_exceptions=no
+   ac_outfile=conftest.$ac_objext
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+   lt_compiler_flag="-fno-rtti -fno-exceptions"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   # The option is referenced via a variable to avoid confusing sed.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>conftest.err)
+   ac_status=$?
+   cat conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s "$ac_outfile"; then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings other than the usual output.
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp
+     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_rtti_exceptions=yes
+     fi
+   fi
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5
+$as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; }
+
+if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then
+    lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions"
+else
+    :
+fi
+
+fi
+
+
+
+
+
+
+  lt_prog_compiler_wl=
+lt_prog_compiler_pic=
+lt_prog_compiler_static=
+
+
+  if test "$GCC" = yes; then
+    lt_prog_compiler_wl='-Wl,'
+    lt_prog_compiler_static='-static'
+
+    case $host_os in
+      aix*)
+      # All AIX code is PIC.
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	lt_prog_compiler_static='-Bstatic'
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            lt_prog_compiler_pic='-fPIC'
+        ;;
+      m68k)
+            # FIXME: we need at least 68020 code to build shared libraries, but
+            # adding the `-m68020' flag to GCC prevents building anything better,
+            # like `-m68040'.
+            lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4'
+        ;;
+      esac
+      ;;
+
+    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+      # PIC is the default for these OSes.
+      ;;
+
+    mingw* | cygwin* | pw32* | os2* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      # Although the cygwin gcc ignores -fPIC, still need this for old-style
+      # (--disable-auto-import) libraries
+      lt_prog_compiler_pic='-DDLL_EXPORT'
+      ;;
+
+    darwin* | rhapsody*)
+      # PIC is the default on this platform
+      # Common symbols not allowed in MH_DYLIB files
+      lt_prog_compiler_pic='-fno-common'
+      ;;
+
+    haiku*)
+      # PIC is the default for Haiku.
+      # The "-static" flag exists, but is broken.
+      lt_prog_compiler_static=
+      ;;
+
+    hpux*)
+      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit
+      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag
+      # sets the default TLS model and affects inlining.
+      case $host_cpu in
+      hppa*64*)
+	# +Z the default
+	;;
+      *)
+	lt_prog_compiler_pic='-fPIC'
+	;;
+      esac
+      ;;
+
+    interix[3-9]*)
+      # Interix 3.x gcc -fpic/-fPIC options generate broken code.
+      # Instead, we relocate shared libraries at runtime.
+      ;;
+
+    msdosdjgpp*)
+      # Just because we use GCC doesn't mean we suddenly get shared libraries
+      # on systems that don't support them.
+      lt_prog_compiler_can_build_shared=no
+      enable_shared=no
+      ;;
+
+    *nto* | *qnx*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      lt_prog_compiler_pic='-fPIC -shared'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	lt_prog_compiler_pic=-Kconform_pic
+      fi
+      ;;
+
+    *)
+      lt_prog_compiler_pic='-fPIC'
+      ;;
+    esac
+
+    case $cc_basename in
+    nvcc*) # Cuda Compiler Driver 2.2
+      lt_prog_compiler_wl='-Xlinker '
+      if test -n "$lt_prog_compiler_pic"; then
+        lt_prog_compiler_pic="-Xcompiler $lt_prog_compiler_pic"
+      fi
+      ;;
+    esac
+  else
+    # PORTME Check for flag to pass linker flags through the system compiler.
+    case $host_os in
+    aix*)
+      lt_prog_compiler_wl='-Wl,'
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	lt_prog_compiler_static='-Bstatic'
+      else
+	lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp'
+      fi
+      ;;
+
+    mingw* | cygwin* | pw32* | os2* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      lt_prog_compiler_pic='-DDLL_EXPORT'
+      ;;
+
+    hpux9* | hpux10* | hpux11*)
+      lt_prog_compiler_wl='-Wl,'
+      # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
+      # not for PA HP-UX.
+      case $host_cpu in
+      hppa*64*|ia64*)
+	# +Z the default
+	;;
+      *)
+	lt_prog_compiler_pic='+Z'
+	;;
+      esac
+      # Is there a better lt_prog_compiler_static that works with the bundled CC?
+      lt_prog_compiler_static='${wl}-a ${wl}archive'
+      ;;
+
+    irix5* | irix6* | nonstopux*)
+      lt_prog_compiler_wl='-Wl,'
+      # PIC (with -KPIC) is the default.
+      lt_prog_compiler_static='-non_shared'
+      ;;
+
+    linux* | k*bsd*-gnu | kopensolaris*-gnu)
+      case $cc_basename in
+      # old Intel for x86_64 which still supported -KPIC.
+      ecc*)
+	lt_prog_compiler_wl='-Wl,'
+	lt_prog_compiler_pic='-KPIC'
+	lt_prog_compiler_static='-static'
+        ;;
+      # icc used to be incompatible with GCC.
+      # ICC 10 doesn't accept -KPIC any more.
+      icc* | ifort*)
+	lt_prog_compiler_wl='-Wl,'
+	lt_prog_compiler_pic='-fPIC'
+	lt_prog_compiler_static='-static'
+        ;;
+      # Lahey Fortran 8.1.
+      lf95*)
+	lt_prog_compiler_wl='-Wl,'
+	lt_prog_compiler_pic='--shared'
+	lt_prog_compiler_static='--static'
+	;;
+      nagfor*)
+	# NAG Fortran compiler
+	lt_prog_compiler_wl='-Wl,-Wl,,'
+	lt_prog_compiler_pic='-PIC'
+	lt_prog_compiler_static='-Bstatic'
+	;;
+      pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*)
+        # Portland Group compilers (*not* the Pentium gcc compiler,
+	# which looks to be a dead project)
+	lt_prog_compiler_wl='-Wl,'
+	lt_prog_compiler_pic='-fpic'
+	lt_prog_compiler_static='-Bstatic'
+        ;;
+      ccc*)
+        lt_prog_compiler_wl='-Wl,'
+        # All Alpha code is PIC.
+        lt_prog_compiler_static='-non_shared'
+        ;;
+      xl* | bgxl* | bgf* | mpixl*)
+	# IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene
+	lt_prog_compiler_wl='-Wl,'
+	lt_prog_compiler_pic='-qpic'
+	lt_prog_compiler_static='-qstaticlink'
+	;;
+      *)
+	case `$CC -V 2>&1 | sed 5q` in
+	*Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [1-7].* | *Sun*Fortran*\ 8.[0-3]*)
+	  # Sun Fortran 8.3 passes all unrecognized flags to the linker
+	  lt_prog_compiler_pic='-KPIC'
+	  lt_prog_compiler_static='-Bstatic'
+	  lt_prog_compiler_wl=''
+	  ;;
+	*Sun\ F* | *Sun*Fortran*)
+	  lt_prog_compiler_pic='-KPIC'
+	  lt_prog_compiler_static='-Bstatic'
+	  lt_prog_compiler_wl='-Qoption ld '
+	  ;;
+	*Sun\ C*)
+	  # Sun C 5.9
+	  lt_prog_compiler_pic='-KPIC'
+	  lt_prog_compiler_static='-Bstatic'
+	  lt_prog_compiler_wl='-Wl,'
+	  ;;
+        *Intel*\ [CF]*Compiler*)
+	  lt_prog_compiler_wl='-Wl,'
+	  lt_prog_compiler_pic='-fPIC'
+	  lt_prog_compiler_static='-static'
+	  ;;
+	*Portland\ Group*)
+	  lt_prog_compiler_wl='-Wl,'
+	  lt_prog_compiler_pic='-fpic'
+	  lt_prog_compiler_static='-Bstatic'
+	  ;;
+	esac
+	;;
+      esac
+      ;;
+
+    newsos6)
+      lt_prog_compiler_pic='-KPIC'
+      lt_prog_compiler_static='-Bstatic'
+      ;;
+
+    *nto* | *qnx*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      lt_prog_compiler_pic='-fPIC -shared'
+      ;;
+
+    osf3* | osf4* | osf5*)
+      lt_prog_compiler_wl='-Wl,'
+      # All OSF/1 code is PIC.
+      lt_prog_compiler_static='-non_shared'
+      ;;
+
+    rdos*)
+      lt_prog_compiler_static='-non_shared'
+      ;;
+
+    solaris*)
+      lt_prog_compiler_pic='-KPIC'
+      lt_prog_compiler_static='-Bstatic'
+      case $cc_basename in
+      f77* | f90* | f95* | sunf77* | sunf90* | sunf95*)
+	lt_prog_compiler_wl='-Qoption ld ';;
+      *)
+	lt_prog_compiler_wl='-Wl,';;
+      esac
+      ;;
+
+    sunos4*)
+      lt_prog_compiler_wl='-Qoption ld '
+      lt_prog_compiler_pic='-PIC'
+      lt_prog_compiler_static='-Bstatic'
+      ;;
+
+    sysv4 | sysv4.2uw2* | sysv4.3*)
+      lt_prog_compiler_wl='-Wl,'
+      lt_prog_compiler_pic='-KPIC'
+      lt_prog_compiler_static='-Bstatic'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec ;then
+	lt_prog_compiler_pic='-Kconform_pic'
+	lt_prog_compiler_static='-Bstatic'
+      fi
+      ;;
+
+    sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)
+      lt_prog_compiler_wl='-Wl,'
+      lt_prog_compiler_pic='-KPIC'
+      lt_prog_compiler_static='-Bstatic'
+      ;;
+
+    unicos*)
+      lt_prog_compiler_wl='-Wl,'
+      lt_prog_compiler_can_build_shared=no
+      ;;
+
+    uts4*)
+      lt_prog_compiler_pic='-pic'
+      lt_prog_compiler_static='-Bstatic'
+      ;;
+
+    *)
+      lt_prog_compiler_can_build_shared=no
+      ;;
+    esac
+  fi
+
+case $host_os in
+  # For platforms which do not support PIC, -DPIC is meaningless:
+  *djgpp*)
+    lt_prog_compiler_pic=
+    ;;
+  *)
+    lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC"
+    ;;
+esac
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5
+$as_echo_n "checking for $compiler option to produce PIC... " >&6; }
+if ${lt_cv_prog_compiler_pic+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_pic=$lt_prog_compiler_pic
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic" >&5
+$as_echo "$lt_cv_prog_compiler_pic" >&6; }
+lt_prog_compiler_pic=$lt_cv_prog_compiler_pic
+
+#
+# Check to make sure the PIC flag actually works.
+#
+if test -n "$lt_prog_compiler_pic"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5
+$as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; }
+if ${lt_cv_prog_compiler_pic_works+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_pic_works=no
+   ac_outfile=conftest.$ac_objext
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+   lt_compiler_flag="$lt_prog_compiler_pic -DPIC"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   # The option is referenced via a variable to avoid confusing sed.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>conftest.err)
+   ac_status=$?
+   cat conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s "$ac_outfile"; then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings other than the usual output.
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp
+     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_pic_works=yes
+     fi
+   fi
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5
+$as_echo "$lt_cv_prog_compiler_pic_works" >&6; }
+
+if test x"$lt_cv_prog_compiler_pic_works" = xyes; then
+    case $lt_prog_compiler_pic in
+     "" | " "*) ;;
+     *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;;
+     esac
+else
+    lt_prog_compiler_pic=
+     lt_prog_compiler_can_build_shared=no
+fi
+
+fi
+
+
+
+
+
+
+
+
+
+
+
+#
+# Check to make sure the static flag actually works.
+#
+wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5
+$as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; }
+if ${lt_cv_prog_compiler_static_works+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_static_works=no
+   save_LDFLAGS="$LDFLAGS"
+   LDFLAGS="$LDFLAGS $lt_tmp_static_flag"
+   echo "$lt_simple_link_test_code" > conftest.$ac_ext
+   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then
+     # The linker can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     if test -s conftest.err; then
+       # Append any errors to the config.log.
+       cat conftest.err 1>&5
+       $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp
+       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+       if diff conftest.exp conftest.er2 >/dev/null; then
+         lt_cv_prog_compiler_static_works=yes
+       fi
+     else
+       lt_cv_prog_compiler_static_works=yes
+     fi
+   fi
+   $RM -r conftest*
+   LDFLAGS="$save_LDFLAGS"
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5
+$as_echo "$lt_cv_prog_compiler_static_works" >&6; }
+
+if test x"$lt_cv_prog_compiler_static_works" = xyes; then
+    :
+else
+    lt_prog_compiler_static=
+fi
+
+
+
+
+
+
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5
+$as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; }
+if ${lt_cv_prog_compiler_c_o+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_c_o=no
+   $RM -r conftest 2>/dev/null
+   mkdir conftest
+   cd conftest
+   mkdir out
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+   lt_compiler_flag="-o out/conftest2.$ac_objext"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>out/conftest.err)
+   ac_status=$?
+   cat out/conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s out/conftest2.$ac_objext
+   then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp
+     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2
+     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_c_o=yes
+     fi
+   fi
+   chmod u+w . 2>&5
+   $RM conftest*
+   # SGI C++ compiler will create directory out/ii_files/ for
+   # template instantiation
+   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files
+   $RM out/* && rmdir out
+   cd ..
+   $RM -r conftest
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5
+$as_echo "$lt_cv_prog_compiler_c_o" >&6; }
+
+
+
+
+
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5
+$as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; }
+if ${lt_cv_prog_compiler_c_o+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_c_o=no
+   $RM -r conftest 2>/dev/null
+   mkdir conftest
+   cd conftest
+   mkdir out
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+   lt_compiler_flag="-o out/conftest2.$ac_objext"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>out/conftest.err)
+   ac_status=$?
+   cat out/conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s out/conftest2.$ac_objext
+   then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp
+     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2
+     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_c_o=yes
+     fi
+   fi
+   chmod u+w . 2>&5
+   $RM conftest*
+   # SGI C++ compiler will create directory out/ii_files/ for
+   # template instantiation
+   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files
+   $RM out/* && rmdir out
+   cd ..
+   $RM -r conftest
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5
+$as_echo "$lt_cv_prog_compiler_c_o" >&6; }
+
+
+
+
+hard_links="nottested"
+if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then
+  # do not overwrite the value of need_locks provided by the user
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5
+$as_echo_n "checking if we can lock with hard links... " >&6; }
+  hard_links=yes
+  $RM conftest*
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  touch conftest.a
+  ln conftest.a conftest.b 2>&5 || hard_links=no
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5
+$as_echo "$hard_links" >&6; }
+  if test "$hard_links" = no; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5
+$as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;}
+    need_locks=warn
+  fi
+else
+  need_locks=no
+fi
+
+
+
+
+
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5
+$as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; }
+
+  runpath_var=
+  allow_undefined_flag=
+  always_export_symbols=no
+  archive_cmds=
+  archive_expsym_cmds=
+  compiler_needs_object=no
+  enable_shared_with_static_runtimes=no
+  export_dynamic_flag_spec=
+  export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+  hardcode_automatic=no
+  hardcode_direct=no
+  hardcode_direct_absolute=no
+  hardcode_libdir_flag_spec=
+  hardcode_libdir_separator=
+  hardcode_minus_L=no
+  hardcode_shlibpath_var=unsupported
+  inherit_rpath=no
+  link_all_deplibs=unknown
+  module_cmds=
+  module_expsym_cmds=
+  old_archive_from_new_cmds=
+  old_archive_from_expsyms_cmds=
+  thread_safe_flag_spec=
+  whole_archive_flag_spec=
+  # include_expsyms should be a list of space-separated symbols to be *always*
+  # included in the symbol list
+  include_expsyms=
+  # exclude_expsyms can be an extended regexp of symbols to exclude
+  # it will be wrapped by ` (' and `)$', so one must not match beginning or
+  # end of line.  Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc',
+  # as well as any symbol that contains `d'.
+  exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'
+  # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out
+  # platforms (ab)use it in PIC code, but their linkers get confused if
+  # the symbol is explicitly referenced.  Since portable code cannot
+  # rely on this symbol name, it's probably fine to never include it in
+  # preloaded symbol tables.
+  # Exclude shared library initialization/finalization symbols.
+  extract_expsyms_cmds=
+
+  case $host_os in
+  cygwin* | mingw* | pw32* | cegcc*)
+    # FIXME: the MSVC++ port hasn't been tested in a loooong time
+    # When not using gcc, we currently assume that we are using
+    # Microsoft Visual C++.
+    if test "$GCC" != yes; then
+      with_gnu_ld=no
+    fi
+    ;;
+  interix*)
+    # we just hope/assume this is gcc and not c89 (= MSVC++)
+    with_gnu_ld=yes
+    ;;
+  openbsd*)
+    with_gnu_ld=no
+    ;;
+  linux* | k*bsd*-gnu | gnu*)
+    link_all_deplibs=no
+    ;;
+  esac
+
+  ld_shlibs=yes
+
+  # On some targets, GNU ld is compatible enough with the native linker
+  # that we're better off using the native interface for both.
+  lt_use_gnu_ld_interface=no
+  if test "$with_gnu_ld" = yes; then
+    case $host_os in
+      aix*)
+	# The AIX port of GNU ld has always aspired to compatibility
+	# with the native linker.  However, as the warning in the GNU ld
+	# block says, versions before 2.19.5* couldn't really create working
+	# shared libraries, regardless of the interface used.
+	case `$LD -v 2>&1` in
+	  *\ \(GNU\ Binutils\)\ 2.19.5*) ;;
+	  *\ \(GNU\ Binutils\)\ 2.[2-9]*) ;;
+	  *\ \(GNU\ Binutils\)\ [3-9]*) ;;
+	  *)
+	    lt_use_gnu_ld_interface=yes
+	    ;;
+	esac
+	;;
+      *)
+	lt_use_gnu_ld_interface=yes
+	;;
+    esac
+  fi
+
+  if test "$lt_use_gnu_ld_interface" = yes; then
+    # If archive_cmds runs LD, not CC, wlarc should be empty
+    wlarc='${wl}'
+
+    # Set some defaults for GNU ld with shared library support. These
+    # are reset later if shared libraries are not supported. Putting them
+    # here allows them to be overridden if necessary.
+    runpath_var=LD_RUN_PATH
+    hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+    export_dynamic_flag_spec='${wl}--export-dynamic'
+    # ancient GNU ld didn't support --whole-archive et. al.
+    if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then
+      whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+    else
+      whole_archive_flag_spec=
+    fi
+    supports_anon_versioning=no
+    case `$LD -v 2>&1` in
+      *GNU\ gold*) supports_anon_versioning=yes ;;
+      *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11
+      *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ...
+      *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ...
+      *\ 2.11.*) ;; # other 2.11 versions
+      *) supports_anon_versioning=yes ;;
+    esac
+
+    # See if GNU ld supports shared libraries.
+    case $host_os in
+    aix[3-9]*)
+      # On AIX/PPC, the GNU linker is very broken
+      if test "$host_cpu" != ia64; then
+	ld_shlibs=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: the GNU linker, at least up to release 2.19, is reported
+*** to be unable to reliably create shared libraries on AIX.
+*** Therefore, libtool is disabling shared libraries support.  If you
+*** really care for shared libraries, you may want to install binutils
+*** 2.20 or above, or modify your PATH so that a non-GNU linker is found.
+*** You will then need to restart the configuration process.
+
+_LT_EOF
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+            archive_expsym_cmds=''
+        ;;
+      m68k)
+            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+            hardcode_libdir_flag_spec='-L$libdir'
+            hardcode_minus_L=yes
+        ;;
+      esac
+      ;;
+
+    beos*)
+      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	allow_undefined_flag=unsupported
+	# Joseph Beckenbach <jrb3@best.com> says some releases of gcc
+	# support --undefined.  This deserves some investigation.  FIXME
+	archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+      else
+	ld_shlibs=no
+      fi
+      ;;
+
+    cygwin* | mingw* | pw32* | cegcc*)
+      # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless,
+      # as there is no search path for DLLs.
+      hardcode_libdir_flag_spec='-L$libdir'
+      export_dynamic_flag_spec='${wl}--export-all-symbols'
+      allow_undefined_flag=unsupported
+      always_export_symbols=no
+      enable_shared_with_static_runtimes=yes
+      export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols'
+      exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'
+
+      if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then
+        archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	# If the export-symbols file already is a .def file (1st line
+	# is EXPORTS), use it as is; otherwise, prepend...
+	archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	  cp $export_symbols $output_objdir/$soname.def;
+	else
+	  echo EXPORTS > $output_objdir/$soname.def;
+	  cat $export_symbols >> $output_objdir/$soname.def;
+	fi~
+	$CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+      else
+	ld_shlibs=no
+      fi
+      ;;
+
+    haiku*)
+      archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+      link_all_deplibs=yes
+      ;;
+
+    interix[3-9]*)
+      hardcode_direct=no
+      hardcode_shlibpath_var=no
+      hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
+      export_dynamic_flag_spec='${wl}-E'
+      # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.
+      # Instead, shared libraries are loaded at an image base (0x10000000 by
+      # default) and relocated if they conflict, which is a slow very memory
+      # consuming and fragmenting process.  To avoid this, we pick a random,
+      # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link
+      # time.  Moving up from 0x10000000 also allows more sbrk(2) space.
+      archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+      archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+      ;;
+
+    gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu)
+      tmp_diet=no
+      if test "$host_os" = linux-dietlibc; then
+	case $cc_basename in
+	  diet\ *) tmp_diet=yes;;	# linux-dietlibc with static linking (!diet-dyn)
+	esac
+      fi
+      if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \
+	 && test "$tmp_diet" = no
+      then
+	tmp_addflag=' $pic_flag'
+	tmp_sharedflag='-shared'
+	case $cc_basename,$host_cpu in
+        pgcc*)				# Portland Group C compiler
+	  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  tmp_addflag=' $pic_flag'
+	  ;;
+	pgf77* | pgf90* | pgf95* | pgfortran*)
+					# Portland Group f77 and f90 compilers
+	  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  tmp_addflag=' $pic_flag -Mnomain' ;;
+	ecc*,ia64* | icc*,ia64*)	# Intel C compiler on ia64
+	  tmp_addflag=' -i_dynamic' ;;
+	efc*,ia64* | ifort*,ia64*)	# Intel Fortran compiler on ia64
+	  tmp_addflag=' -i_dynamic -nofor_main' ;;
+	ifc* | ifort*)			# Intel Fortran compiler
+	  tmp_addflag=' -nofor_main' ;;
+	lf95*)				# Lahey Fortran 8.1
+	  whole_archive_flag_spec=
+	  tmp_sharedflag='--shared' ;;
+	xl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below)
+	  tmp_sharedflag='-qmkshrobj'
+	  tmp_addflag= ;;
+	nvcc*)	# Cuda Compiler Driver 2.2
+	  whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  compiler_needs_object=yes
+	  ;;
+	esac
+	case `$CC -V 2>&1 | sed 5q` in
+	*Sun\ C*)			# Sun C 5.9
+	  whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	  compiler_needs_object=yes
+	  tmp_sharedflag='-G' ;;
+	*Sun\ F*)			# Sun Fortran 8.3
+	  tmp_sharedflag='-G' ;;
+	esac
+	archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+
+        if test "x$supports_anon_versioning" = xyes; then
+          archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~
+	    cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+	    echo "local: *; };" >> $output_objdir/$libname.ver~
+	    $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'
+        fi
+
+	case $cc_basename in
+	xlf* | bgf* | bgxlf* | mpixlf*)
+	  # IBM XL Fortran 10.1 on PPC cannot create shared libs itself
+	  whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive'
+	  hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+	  archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib'
+	  if test "x$supports_anon_versioning" = xyes; then
+	    archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~
+	      cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+	      echo "local: *; };" >> $output_objdir/$libname.ver~
+	      $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib'
+	  fi
+	  ;;
+	esac
+      else
+        ld_shlibs=no
+      fi
+      ;;
+
+    netbsd* | netbsdelf*-gnu)
+      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib'
+	wlarc=
+      else
+	archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      fi
+      ;;
+
+    solaris*)
+      if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then
+	ld_shlibs=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: The releases 2.8.* of the GNU linker cannot reliably
+*** create shared libraries on Solaris systems.  Therefore, libtool
+*** is disabling shared libraries support.  We urge you to upgrade GNU
+*** binutils to release 2.9.1 or newer.  Another option is to modify
+*** your PATH or compiler configuration so that the native linker is
+*** used, and then restart.
+
+_LT_EOF
+      elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      else
+	ld_shlibs=no
+      fi
+      ;;
+
+    sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*)
+      case `$LD -v 2>&1` in
+        *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*)
+	ld_shlibs=no
+	cat <<_LT_EOF 1>&2
+
+*** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not
+*** reliably create shared libraries on SCO systems.  Therefore, libtool
+*** is disabling shared libraries support.  We urge you to upgrade GNU
+*** binutils to release 2.16.91.0.3 or newer.  Another option is to modify
+*** your PATH or compiler configuration so that the native linker is
+*** used, and then restart.
+
+_LT_EOF
+	;;
+	*)
+	  # For security reasons, it is highly recommended that you always
+	  # use absolute paths for naming shared libraries, and exclude the
+	  # DT_RUNPATH tag from executables and libraries.  But doing so
+	  # requires that you compile everything twice, which is a pain.
+	  if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	    hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+	    archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+	  else
+	    ld_shlibs=no
+	  fi
+	;;
+      esac
+      ;;
+
+    sunos4*)
+      archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+      wlarc=
+      hardcode_direct=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    *)
+      if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+      else
+	ld_shlibs=no
+      fi
+      ;;
+    esac
+
+    if test "$ld_shlibs" = no; then
+      runpath_var=
+      hardcode_libdir_flag_spec=
+      export_dynamic_flag_spec=
+      whole_archive_flag_spec=
+    fi
+  else
+    # PORTME fill in a description of your system's linker (not GNU ld)
+    case $host_os in
+    aix3*)
+      allow_undefined_flag=unsupported
+      always_export_symbols=yes
+      archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname'
+      # Note: this linker hardcodes the directories in LIBPATH if there
+      # are no directories specified by -L.
+      hardcode_minus_L=yes
+      if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then
+	# Neither direct hardcoding nor static linking is supported with a
+	# broken collect2.
+	hardcode_direct=unsupported
+      fi
+      ;;
+
+    aix[4-9]*)
+      if test "$host_cpu" = ia64; then
+	# On IA64, the linker does run time linking by default, so we don't
+	# have to do anything special.
+	aix_use_runtimelinking=no
+	exp_sym_flag='-Bexport'
+	no_entry_flag=""
+      else
+	# If we're using GNU nm, then we don't want the "-C" option.
+	# -C means demangle to AIX nm, but means don't demangle with GNU nm
+	# Also, AIX nm treats weak defined symbols like other global
+	# defined symbols, whereas GNU nm marks them as "W".
+	if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then
+	  export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+	else
+	  export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+	fi
+	aix_use_runtimelinking=no
+
+	# Test if we are trying to use run time linking or normal
+	# AIX style linking. If -brtl is somewhere in LDFLAGS, we
+	# need to do runtime linking.
+	case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)
+	  for ld_flag in $LDFLAGS; do
+	  if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then
+	    aix_use_runtimelinking=yes
+	    break
+	  fi
+	  done
+	  ;;
+	esac
+
+	exp_sym_flag='-bexport'
+	no_entry_flag='-bnoentry'
+      fi
+
+      # When large executables or shared objects are built, AIX ld can
+      # have problems creating the table of contents.  If linking a library
+      # or program results in "error TOC overflow" add -mminimal-toc to
+      # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not
+      # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+      archive_cmds=''
+      hardcode_direct=yes
+      hardcode_direct_absolute=yes
+      hardcode_libdir_separator=':'
+      link_all_deplibs=yes
+      file_list_spec='${wl}-f,'
+
+      if test "$GCC" = yes; then
+	case $host_os in aix4.[012]|aix4.[012].*)
+	# We only want to do this on AIX 4.2 and lower, the check
+	# below for broken collect2 doesn't work under 4.3+
+	  collect2name=`${CC} -print-prog-name=collect2`
+	  if test -f "$collect2name" &&
+	   strings "$collect2name" | $GREP resolve_lib_name >/dev/null
+	  then
+	  # We have reworked collect2
+	  :
+	  else
+	  # We have old collect2
+	  hardcode_direct=unsupported
+	  # It fails to find uninstalled libraries when the uninstalled
+	  # path is not listed in the libpath.  Setting hardcode_minus_L
+	  # to unsupported forces relinking
+	  hardcode_minus_L=yes
+	  hardcode_libdir_flag_spec='-L$libdir'
+	  hardcode_libdir_separator=
+	  fi
+	  ;;
+	esac
+	shared_flag='-shared'
+	if test "$aix_use_runtimelinking" = yes; then
+	  shared_flag="$shared_flag "'${wl}-G'
+	fi
+	link_all_deplibs=no
+      else
+	# not using gcc
+	if test "$host_cpu" = ia64; then
+	# VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+	# chokes on -Wl,-G. The following line is correct:
+	  shared_flag='-G'
+	else
+	  if test "$aix_use_runtimelinking" = yes; then
+	    shared_flag='${wl}-G'
+	  else
+	    shared_flag='${wl}-bM:SRE'
+	  fi
+	fi
+      fi
+
+      export_dynamic_flag_spec='${wl}-bexpall'
+      # It seems that -bexpall does not export symbols beginning with
+      # underscore (_), so it is better to generate a list of symbols to export.
+      always_export_symbols=yes
+      if test "$aix_use_runtimelinking" = yes; then
+	# Warning - without using the other runtime loading flags (-brtl),
+	# -berok will link without error, but may produce a broken library.
+	allow_undefined_flag='-berok'
+        # Determine the default libpath from the value encoded in an
+        # empty executable.
+        if test "${lt_cv_aix_libpath+set}" = set; then
+  aix_libpath=$lt_cv_aix_libpath
+else
+  if ${lt_cv_aix_libpath_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+
+  lt_aix_libpath_sed='
+      /Import File Strings/,/^$/ {
+	  /^0/ {
+	      s/^0  *\([^ ]*\) *$/\1/
+	      p
+	  }
+      }'
+  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  # Check for a 64-bit object if we didn't find anything.
+  if test -z "$lt_cv_aix_libpath_"; then
+    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+  if test -z "$lt_cv_aix_libpath_"; then
+    lt_cv_aix_libpath_="/usr/lib:/lib"
+  fi
+
+fi
+
+  aix_libpath=$lt_cv_aix_libpath_
+fi
+
+        hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath"
+        archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+      else
+	if test "$host_cpu" = ia64; then
+	  hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib'
+	  allow_undefined_flag="-z nodefs"
+	  archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols"
+	else
+	 # Determine the default libpath from the value encoded in an
+	 # empty executable.
+	 if test "${lt_cv_aix_libpath+set}" = set; then
+  aix_libpath=$lt_cv_aix_libpath
+else
+  if ${lt_cv_aix_libpath_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+
+  lt_aix_libpath_sed='
+      /Import File Strings/,/^$/ {
+	  /^0/ {
+	      s/^0  *\([^ ]*\) *$/\1/
+	      p
+	  }
+      }'
+  lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  # Check for a 64-bit object if we didn't find anything.
+  if test -z "$lt_cv_aix_libpath_"; then
+    lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+  if test -z "$lt_cv_aix_libpath_"; then
+    lt_cv_aix_libpath_="/usr/lib:/lib"
+  fi
+
+fi
+
+  aix_libpath=$lt_cv_aix_libpath_
+fi
+
+	 hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath"
+	  # Warning - without using the other run time loading flags,
+	  # -berok will link without error, but may produce a broken library.
+	  no_undefined_flag=' ${wl}-bernotok'
+	  allow_undefined_flag=' ${wl}-berok'
+	  if test "$with_gnu_ld" = yes; then
+	    # We only use this code for GNU lds that support --whole-archive.
+	    whole_archive_flag_spec='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	  else
+	    # Exported symbols can be pulled into shared objects from archives
+	    whole_archive_flag_spec='$convenience'
+	  fi
+	  archive_cmds_need_lc=yes
+	  # This is similar to how AIX traditionally builds its shared libraries.
+	  archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+	fi
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+            archive_expsym_cmds=''
+        ;;
+      m68k)
+            archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
+            hardcode_libdir_flag_spec='-L$libdir'
+            hardcode_minus_L=yes
+        ;;
+      esac
+      ;;
+
+    bsdi[45]*)
+      export_dynamic_flag_spec=-rdynamic
+      ;;
+
+    cygwin* | mingw* | pw32* | cegcc*)
+      # When not using gcc, we currently assume that we are using
+      # Microsoft Visual C++.
+      # hardcode_libdir_flag_spec is actually meaningless, as there is
+      # no search path for DLLs.
+      case $cc_basename in
+      cl*)
+	# Native MSVC
+	hardcode_libdir_flag_spec=' '
+	allow_undefined_flag=unsupported
+	always_export_symbols=yes
+	file_list_spec='@'
+	# Tell ltmain to make .lib files, not .a files.
+	libext=lib
+	# Tell ltmain to make .dll files, not .so files.
+	shrext_cmds=".dll"
+	# FIXME: Setting linknames here is a bad hack.
+	archive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='
+	archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	    sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp;
+	  else
+	    sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;
+	  fi~
+	  $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~
+	  linknames='
+	# The linker will not automatically build a static lib if we build a DLL.
+	# _LT_TAGVAR(old_archive_from_new_cmds, )='true'
+	enable_shared_with_static_runtimes=yes
+	exclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'
+	export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1,DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols'
+	# Don't use ranlib
+	old_postinstall_cmds='chmod 644 $oldlib'
+	postlink_cmds='lt_outputfile="@OUTPUT@"~
+	  lt_tool_outputfile="@TOOL_OUTPUT@"~
+	  case $lt_outputfile in
+	    *.exe|*.EXE) ;;
+	    *)
+	      lt_outputfile="$lt_outputfile.exe"
+	      lt_tool_outputfile="$lt_tool_outputfile.exe"
+	      ;;
+	  esac~
+	  if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then
+	    $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1;
+	    $RM "$lt_outputfile.manifest";
+	  fi'
+	;;
+      *)
+	# Assume MSVC wrapper
+	hardcode_libdir_flag_spec=' '
+	allow_undefined_flag=unsupported
+	# Tell ltmain to make .lib files, not .a files.
+	libext=lib
+	# Tell ltmain to make .dll files, not .so files.
+	shrext_cmds=".dll"
+	# FIXME: Setting linknames here is a bad hack.
+	archive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames='
+	# The linker will automatically build a .lib file if we build a DLL.
+	old_archive_from_new_cmds='true'
+	# FIXME: Should let the user specify the lib program.
+	old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs'
+	enable_shared_with_static_runtimes=yes
+	;;
+      esac
+      ;;
+
+    darwin* | rhapsody*)
+
+
+  archive_cmds_need_lc=no
+  hardcode_direct=no
+  hardcode_automatic=yes
+  hardcode_shlibpath_var=unsupported
+  if test "$lt_cv_ld_force_load" = "yes"; then
+    whole_archive_flag_spec='`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`'
+
+  else
+    whole_archive_flag_spec=''
+  fi
+  link_all_deplibs=yes
+  allow_undefined_flag="$_lt_dar_allow_undefined"
+  case $cc_basename in
+     ifort*) _lt_dar_can_shared=yes ;;
+     *) _lt_dar_can_shared=$GCC ;;
+  esac
+  if test "$_lt_dar_can_shared" = "yes"; then
+    output_verbose_link_cmd=func_echo_all
+    archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}"
+    module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}"
+    archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}"
+    module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}"
+
+  else
+  ld_shlibs=no
+  fi
+
+      ;;
+
+    dgux*)
+      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      hardcode_libdir_flag_spec='-L$libdir'
+      hardcode_shlibpath_var=no
+      ;;
+
+    # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor
+    # support.  Future versions do this automatically, but an explicit c++rt0.o
+    # does not break anything, and helps significantly (at the cost of a little
+    # extra space).
+    freebsd2.2*)
+      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o'
+      hardcode_libdir_flag_spec='-R$libdir'
+      hardcode_direct=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    # Unfortunately, older versions of FreeBSD 2 do not have this feature.
+    freebsd2.*)
+      archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+      hardcode_direct=yes
+      hardcode_minus_L=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    # FreeBSD 3 and greater uses gcc -shared to do shared libraries.
+    freebsd* | dragonfly*)
+      archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+      hardcode_libdir_flag_spec='-R$libdir'
+      hardcode_direct=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    hpux9*)
+      if test "$GCC" = yes; then
+	archive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+      else
+	archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+      fi
+      hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
+      hardcode_libdir_separator=:
+      hardcode_direct=yes
+
+      # hardcode_minus_L: Not really in the search PATH,
+      # but as the default location of the library.
+      hardcode_minus_L=yes
+      export_dynamic_flag_spec='${wl}-E'
+      ;;
+
+    hpux10*)
+      if test "$GCC" = yes && test "$with_gnu_ld" = no; then
+	archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'
+      fi
+      if test "$with_gnu_ld" = no; then
+	hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
+	hardcode_libdir_separator=:
+	hardcode_direct=yes
+	hardcode_direct_absolute=yes
+	export_dynamic_flag_spec='${wl}-E'
+	# hardcode_minus_L: Not really in the search PATH,
+	# but as the default location of the library.
+	hardcode_minus_L=yes
+      fi
+      ;;
+
+    hpux11*)
+      if test "$GCC" = yes && test "$with_gnu_ld" = no; then
+	case $host_cpu in
+	hppa*64*)
+	  archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	ia64*)
+	  archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+	  archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	esac
+      else
+	case $host_cpu in
+	hppa*64*)
+	  archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	ia64*)
+	  archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+
+	  # Older versions of the 11.00 compiler do not understand -b yet
+	  # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does)
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $CC understands -b" >&5
+$as_echo_n "checking if $CC understands -b... " >&6; }
+if ${lt_cv_prog_compiler__b+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler__b=no
+   save_LDFLAGS="$LDFLAGS"
+   LDFLAGS="$LDFLAGS -b"
+   echo "$lt_simple_link_test_code" > conftest.$ac_ext
+   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then
+     # The linker can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     if test -s conftest.err; then
+       # Append any errors to the config.log.
+       cat conftest.err 1>&5
+       $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp
+       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+       if diff conftest.exp conftest.er2 >/dev/null; then
+         lt_cv_prog_compiler__b=yes
+       fi
+     else
+       lt_cv_prog_compiler__b=yes
+     fi
+   fi
+   $RM -r conftest*
+   LDFLAGS="$save_LDFLAGS"
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b" >&5
+$as_echo "$lt_cv_prog_compiler__b" >&6; }
+
+if test x"$lt_cv_prog_compiler__b" = xyes; then
+    archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'
+else
+    archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'
+fi
+
+	  ;;
+	esac
+      fi
+      if test "$with_gnu_ld" = no; then
+	hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir'
+	hardcode_libdir_separator=:
+
+	case $host_cpu in
+	hppa*64*|ia64*)
+	  hardcode_direct=no
+	  hardcode_shlibpath_var=no
+	  ;;
+	*)
+	  hardcode_direct=yes
+	  hardcode_direct_absolute=yes
+	  export_dynamic_flag_spec='${wl}-E'
+
+	  # hardcode_minus_L: Not really in the search PATH,
+	  # but as the default location of the library.
+	  hardcode_minus_L=yes
+	  ;;
+	esac
+      fi
+      ;;
+
+    irix5* | irix6* | nonstopux*)
+      if test "$GCC" = yes; then
+	archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	# Try to use the -exported_symbol ld option, if it does not
+	# work, assume that -exports_file does not work either and
+	# implicitly export all symbols.
+	# This should be the same for all languages, so no per-tag cache variable.
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol" >&5
+$as_echo_n "checking whether the $host_os linker accepts -exported_symbol... " >&6; }
+if ${lt_cv_irix_exported_symbol+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  save_LDFLAGS="$LDFLAGS"
+	   LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null"
+	   cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+int foo (void) { return 0; }
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  lt_cv_irix_exported_symbol=yes
+else
+  lt_cv_irix_exported_symbol=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+           LDFLAGS="$save_LDFLAGS"
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol" >&5
+$as_echo "$lt_cv_irix_exported_symbol" >&6; }
+	if test "$lt_cv_irix_exported_symbol" = yes; then
+          archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib'
+	fi
+      else
+	archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib'
+      fi
+      archive_cmds_need_lc='no'
+      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+      hardcode_libdir_separator=:
+      inherit_rpath=yes
+      link_all_deplibs=yes
+      ;;
+
+    netbsd* | netbsdelf*-gnu)
+      if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'  # a.out
+      else
+	archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags'      # ELF
+      fi
+      hardcode_libdir_flag_spec='-R$libdir'
+      hardcode_direct=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    newsos6)
+      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      hardcode_direct=yes
+      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+      hardcode_libdir_separator=:
+      hardcode_shlibpath_var=no
+      ;;
+
+    *nto* | *qnx*)
+      ;;
+
+    openbsd*)
+      if test -f /usr/libexec/ld.so; then
+	hardcode_direct=yes
+	hardcode_shlibpath_var=no
+	hardcode_direct_absolute=yes
+	if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+	  archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+	  archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols'
+	  hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
+	  export_dynamic_flag_spec='${wl}-E'
+	else
+	  case $host_os in
+	   openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*)
+	     archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags'
+	     hardcode_libdir_flag_spec='-R$libdir'
+	     ;;
+	   *)
+	     archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags'
+	     hardcode_libdir_flag_spec='${wl}-rpath,$libdir'
+	     ;;
+	  esac
+	fi
+      else
+	ld_shlibs=no
+      fi
+      ;;
+
+    os2*)
+      hardcode_libdir_flag_spec='-L$libdir'
+      hardcode_minus_L=yes
+      allow_undefined_flag=unsupported
+      archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def'
+      old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def'
+      ;;
+
+    osf3*)
+      if test "$GCC" = yes; then
+	allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*'
+	archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+      else
+	allow_undefined_flag=' -expect_unresolved \*'
+	archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+      fi
+      archive_cmds_need_lc='no'
+      hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+      hardcode_libdir_separator=:
+      ;;
+
+    osf4* | osf5*)	# as osf3* with the addition of -msym flag
+      if test "$GCC" = yes; then
+	allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*'
+	archive_cmds='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir'
+      else
+	allow_undefined_flag=' -expect_unresolved \*'
+	archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~
+	$CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp'
+
+	# Both c and cxx compiler support -rpath directly
+	hardcode_libdir_flag_spec='-rpath $libdir'
+      fi
+      archive_cmds_need_lc='no'
+      hardcode_libdir_separator=:
+      ;;
+
+    solaris*)
+      no_undefined_flag=' -z defs'
+      if test "$GCC" = yes; then
+	wlarc='${wl}'
+	archive_cmds='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
+	archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'
+      else
+	case `$CC -V 2>&1` in
+	*"Compilers 5.0"*)
+	  wlarc=''
+	  archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp'
+	  ;;
+	*)
+	  wlarc='${wl}'
+	  archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags'
+	  archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	  $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp'
+	  ;;
+	esac
+      fi
+      hardcode_libdir_flag_spec='-R$libdir'
+      hardcode_shlibpath_var=no
+      case $host_os in
+      solaris2.[0-5] | solaris2.[0-5].*) ;;
+      *)
+	# The compiler driver will combine and reorder linker options,
+	# but understands `-z linker_flag'.  GCC discards it without `$wl',
+	# but is careful enough not to reorder.
+	# Supported since Solaris 2.6 (maybe 2.5.1?)
+	if test "$GCC" = yes; then
+	  whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'
+	else
+	  whole_archive_flag_spec='-z allextract$convenience -z defaultextract'
+	fi
+	;;
+      esac
+      link_all_deplibs=yes
+      ;;
+
+    sunos4*)
+      if test "x$host_vendor" = xsequent; then
+	# Use $CC to link under sequent, because it throws in some extra .o
+	# files that make .init and .fini sections work.
+	archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags'
+      fi
+      hardcode_libdir_flag_spec='-L$libdir'
+      hardcode_direct=yes
+      hardcode_minus_L=yes
+      hardcode_shlibpath_var=no
+      ;;
+
+    sysv4)
+      case $host_vendor in
+	sni)
+	  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  hardcode_direct=yes # is this really true???
+	;;
+	siemens)
+	  ## LD is ld it makes a PLAMLIB
+	  ## CC just makes a GrossModule.
+	  archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags'
+	  reload_cmds='$CC -r -o $output$reload_objs'
+	  hardcode_direct=no
+        ;;
+	motorola)
+	  archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	  hardcode_direct=no #Motorola manual says yes, but my tests say they lie
+	;;
+      esac
+      runpath_var='LD_RUN_PATH'
+      hardcode_shlibpath_var=no
+      ;;
+
+    sysv4.3*)
+      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      hardcode_shlibpath_var=no
+      export_dynamic_flag_spec='-Bexport'
+      ;;
+
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+	hardcode_shlibpath_var=no
+	runpath_var=LD_RUN_PATH
+	hardcode_runpath_var=yes
+	ld_shlibs=yes
+      fi
+      ;;
+
+    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)
+      no_undefined_flag='${wl}-z,text'
+      archive_cmds_need_lc=no
+      hardcode_shlibpath_var=no
+      runpath_var='LD_RUN_PATH'
+
+      if test "$GCC" = yes; then
+	archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      fi
+      ;;
+
+    sysv5* | sco3.2v5* | sco5v6*)
+      # Note: We can NOT use -z defs as we might desire, because we do not
+      # link with -lc, and that would cause any symbols used from libc to
+      # always be unresolved, which means just about no library would
+      # ever link correctly.  If we're not using GNU ld we use -z text
+      # though, which does catch some bad symbols but isn't as heavy-handed
+      # as -z defs.
+      no_undefined_flag='${wl}-z,text'
+      allow_undefined_flag='${wl}-z,nodefs'
+      archive_cmds_need_lc=no
+      hardcode_shlibpath_var=no
+      hardcode_libdir_flag_spec='${wl}-R,$libdir'
+      hardcode_libdir_separator=':'
+      link_all_deplibs=yes
+      export_dynamic_flag_spec='${wl}-Bexport'
+      runpath_var='LD_RUN_PATH'
+
+      if test "$GCC" = yes; then
+	archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      else
+	archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+      fi
+      ;;
+
+    uts4*)
+      archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags'
+      hardcode_libdir_flag_spec='-L$libdir'
+      hardcode_shlibpath_var=no
+      ;;
+
+    *)
+      ld_shlibs=no
+      ;;
+    esac
+
+    if test x$host_vendor = xsni; then
+      case $host in
+      sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*)
+	export_dynamic_flag_spec='${wl}-Blargedynsym'
+	;;
+      esac
+    fi
+  fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5
+$as_echo "$ld_shlibs" >&6; }
+test "$ld_shlibs" = no && can_build_shared=no
+
+with_gnu_ld=$with_gnu_ld
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+#
+# Do we need to explicitly link libc?
+#
+case "x$archive_cmds_need_lc" in
+x|xyes)
+  # Assume -lc should be added
+  archive_cmds_need_lc=yes
+
+  if test "$enable_shared" = yes && test "$GCC" = yes; then
+    case $archive_cmds in
+    *'~'*)
+      # FIXME: we may have to deal with multi-command sequences.
+      ;;
+    '$CC '*)
+      # Test whether the compiler implicitly links with -lc since on some
+      # systems, -lgcc has to come before -lc. If gcc already passes -lc
+      # to ld, don't add -lc before -lgcc.
+      { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5
+$as_echo_n "checking whether -lc should be explicitly linked in... " >&6; }
+if ${lt_cv_archive_cmds_need_lc+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  $RM conftest*
+	echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+	if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } 2>conftest.err; then
+	  soname=conftest
+	  lib=conftest
+	  libobjs=conftest.$ac_objext
+	  deplibs=
+	  wl=$lt_prog_compiler_wl
+	  pic_flag=$lt_prog_compiler_pic
+	  compiler_flags=-v
+	  linker_flags=-v
+	  verstring=
+	  output_objdir=.
+	  libname=conftest
+	  lt_save_allow_undefined_flag=$allow_undefined_flag
+	  allow_undefined_flag=
+	  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5
+  (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+	  then
+	    lt_cv_archive_cmds_need_lc=no
+	  else
+	    lt_cv_archive_cmds_need_lc=yes
+	  fi
+	  allow_undefined_flag=$lt_save_allow_undefined_flag
+	else
+	  cat conftest.err 1>&5
+	fi
+	$RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc" >&5
+$as_echo "$lt_cv_archive_cmds_need_lc" >&6; }
+      archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc
+      ;;
+    esac
+  fi
+  ;;
+esac
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5
+$as_echo_n "checking dynamic linker characteristics... " >&6; }
+
+if test "$GCC" = yes; then
+  case $host_os in
+    darwin*) lt_awk_arg="/^libraries:/,/LR/" ;;
+    *) lt_awk_arg="/^libraries:/" ;;
+  esac
+  case $host_os in
+    mingw* | cegcc*) lt_sed_strip_eq="s,=\([A-Za-z]:\),\1,g" ;;
+    *) lt_sed_strip_eq="s,=/,/,g" ;;
+  esac
+  lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq`
+  case $lt_search_path_spec in
+  *\;*)
+    # if the path contains ";" then we assume it to be the separator
+    # otherwise default to the standard path separator (i.e. ":") - it is
+    # assumed that no part of a normal pathname contains ";" but that should
+    # okay in the real world where ";" in dirpaths is itself problematic.
+    lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'`
+    ;;
+  *)
+    lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"`
+    ;;
+  esac
+  # Ok, now we have the path, separated by spaces, we can step through it
+  # and add multilib dir if necessary.
+  lt_tmp_lt_search_path_spec=
+  lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null`
+  for lt_sys_path in $lt_search_path_spec; do
+    if test -d "$lt_sys_path/$lt_multi_os_dir"; then
+      lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir"
+    else
+      test -d "$lt_sys_path" && \
+	lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path"
+    fi
+  done
+  lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk '
+BEGIN {RS=" "; FS="/|\n";} {
+  lt_foo="";
+  lt_count=0;
+  for (lt_i = NF; lt_i > 0; lt_i--) {
+    if ($lt_i != "" && $lt_i != ".") {
+      if ($lt_i == "..") {
+        lt_count++;
+      } else {
+        if (lt_count == 0) {
+          lt_foo="/" $lt_i lt_foo;
+        } else {
+          lt_count--;
+        }
+      }
+    }
+  }
+  if (lt_foo != "") { lt_freq[lt_foo]++; }
+  if (lt_freq[lt_foo] == 1) { print lt_foo; }
+}'`
+  # AWK program above erroneously prepends '/' to C:/dos/paths
+  # for these hosts.
+  case $host_os in
+    mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\
+      $SED 's,/\([A-Za-z]:\),\1,g'` ;;
+  esac
+  sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP`
+else
+  sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib"
+fi
+library_names_spec=
+libname_spec='lib$name'
+soname_spec=
+shrext_cmds=".so"
+postinstall_cmds=
+postuninstall_cmds=
+finish_cmds=
+finish_eval=
+shlibpath_var=
+shlibpath_overrides_runpath=unknown
+version_type=none
+dynamic_linker="$host_os ld.so"
+sys_lib_dlsearch_path_spec="/lib /usr/lib"
+need_lib_prefix=unknown
+hardcode_into_libs=no
+
+# when you set need_version to no, make sure it does not cause -set_version
+# flags to be left without arguments
+need_version=unknown
+
+case $host_os in
+aix3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'
+  shlibpath_var=LIBPATH
+
+  # AIX 3 has no versioning support, so we append a major version to the name.
+  soname_spec='${libname}${release}${shared_ext}$major'
+  ;;
+
+aix[4-9]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  hardcode_into_libs=yes
+  if test "$host_cpu" = ia64; then
+    # AIX 5 supports IA64
+    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'
+    shlibpath_var=LD_LIBRARY_PATH
+  else
+    # With GCC up to 2.95.x, collect2 would create an import file
+    # for dependence libraries.  The import file would start with
+    # the line `#! .'.  This would cause the generated library to
+    # depend on `.', always an invalid library.  This was fixed in
+    # development snapshots of GCC prior to 3.0.
+    case $host_os in
+      aix4 | aix4.[01] | aix4.[01].*)
+      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'
+	   echo ' yes '
+	   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then
+	:
+      else
+	can_build_shared=no
+      fi
+      ;;
+    esac
+    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct
+    # soname into executable. Probably we can add versioning support to
+    # collect2, so additional links can be useful in future.
+    if test "$aix_use_runtimelinking" = yes; then
+      # If using run time linking (on AIX 4.2 or later) use lib<name>.so
+      # instead of lib<name>.a to let people know that these are not
+      # typical AIX shared libraries.
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    else
+      # We preserve .a as extension for shared libraries through AIX4.2
+      # and later when we are not doing run time linking.
+      library_names_spec='${libname}${release}.a $libname.a'
+      soname_spec='${libname}${release}${shared_ext}$major'
+    fi
+    shlibpath_var=LIBPATH
+  fi
+  ;;
+
+amigaos*)
+  case $host_cpu in
+  powerpc)
+    # Since July 2007 AmigaOS4 officially supports .so libraries.
+    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    ;;
+  m68k)
+    library_names_spec='$libname.ixlibrary $libname.a'
+    # Create ${libname}_ixlibrary.a entries in /sys/libs.
+    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'
+    ;;
+  esac
+  ;;
+
+beos*)
+  library_names_spec='${libname}${shared_ext}'
+  dynamic_linker="$host_os ld.so"
+  shlibpath_var=LIBRARY_PATH
+  ;;
+
+bsdi[45]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib"
+  sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib"
+  # the default ld.so.conf also contains /usr/contrib/lib and
+  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow
+  # libtool to hard-code these into programs
+  ;;
+
+cygwin* | mingw* | pw32* | cegcc*)
+  version_type=windows
+  shrext_cmds=".dll"
+  need_version=no
+  need_lib_prefix=no
+
+  case $GCC,$cc_basename in
+  yes,*)
+    # gcc
+    library_names_spec='$libname.dll.a'
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname~
+      chmod a+x \$dldir/$dlname~
+      if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then
+        eval '\''$striplib \$dldir/$dlname'\'' || exit \$?;
+      fi'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+
+    case $host_os in
+    cygwin*)
+      # Cygwin DLLs use 'cyg' prefix rather than 'lib'
+      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+
+      sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"
+      ;;
+    mingw* | cegcc*)
+      # MinGW DLLs use traditional 'lib' prefix
+      soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    pw32*)
+      # pw32 DLLs use 'pw' prefix rather than 'lib'
+      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    esac
+    dynamic_linker='Win32 ld.exe'
+    ;;
+
+  *,cl*)
+    # Native MSVC
+    libname_spec='$name'
+    soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+    library_names_spec='${libname}.dll.lib'
+
+    case $build_os in
+    mingw*)
+      sys_lib_search_path_spec=
+      lt_save_ifs=$IFS
+      IFS=';'
+      for lt_path in $LIB
+      do
+        IFS=$lt_save_ifs
+        # Let DOS variable expansion print the short 8.3 style file name.
+        lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"`
+        sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path"
+      done
+      IFS=$lt_save_ifs
+      # Convert to MSYS style.
+      sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'`
+      ;;
+    cygwin*)
+      # Convert to unix form, then to dos form, then back to unix form
+      # but this time dos style (no spaces!) so that the unix form looks
+      # like /cygdrive/c/PROGRA~1:/cygdr...
+      sys_lib_search_path_spec=`cygpath --path --unix "$LIB"`
+      sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null`
+      sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      ;;
+    *)
+      sys_lib_search_path_spec="$LIB"
+      if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then
+        # It is most probably a Windows format PATH.
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`
+      else
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      fi
+      # FIXME: find the short name or the path components, as spaces are
+      # common. (e.g. "Program Files" -> "PROGRA~1")
+      ;;
+    esac
+
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+    dynamic_linker='Win32 link.exe'
+    ;;
+
+  *)
+    # Assume MSVC wrapper
+    library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib'
+    dynamic_linker='Win32 ld.exe'
+    ;;
+  esac
+  # FIXME: first we should search . and the directory the executable is in
+  shlibpath_var=PATH
+  ;;
+
+darwin* | rhapsody*)
+  dynamic_linker="$host_os dyld"
+  version_type=darwin
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'
+  soname_spec='${libname}${release}${major}$shared_ext'
+  shlibpath_overrides_runpath=yes
+  shlibpath_var=DYLD_LIBRARY_PATH
+  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'
+
+  sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"
+  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'
+  ;;
+
+dgux*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+freebsd* | dragonfly*)
+  # DragonFly does not have aout.  When/if they implement a new
+  # versioning mechanism, adjust this.
+  if test -x /usr/bin/objformat; then
+    objformat=`/usr/bin/objformat`
+  else
+    case $host_os in
+    freebsd[23].*) objformat=aout ;;
+    *) objformat=elf ;;
+    esac
+  fi
+  version_type=freebsd-$objformat
+  case $version_type in
+    freebsd-elf*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+      need_version=no
+      need_lib_prefix=no
+      ;;
+    freebsd-*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'
+      need_version=yes
+      ;;
+  esac
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_os in
+  freebsd2.*)
+    shlibpath_overrides_runpath=yes
+    ;;
+  freebsd3.[01]* | freebsdelf3.[01]*)
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \
+  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)
+    shlibpath_overrides_runpath=no
+    hardcode_into_libs=yes
+    ;;
+  *) # from 4.6 on, and DragonFly
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  esac
+  ;;
+
+gnu*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+haiku*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  dynamic_linker="$host_os runtime_loader"
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'
+  hardcode_into_libs=yes
+  ;;
+
+hpux9* | hpux10* | hpux11*)
+  # Give a soname corresponding to the major version so that dld.sl refuses to
+  # link against other versions.
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  case $host_cpu in
+  ia64*)
+    shrext_cmds='.so'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.so"
+    shlibpath_var=LD_LIBRARY_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    if test "X$HPUX_IA64_MODE" = X32; then
+      sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib"
+    else
+      sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64"
+    fi
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  hppa*64*)
+    shrext_cmds='.sl'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64"
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  *)
+    shrext_cmds='.sl'
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=SHLIB_PATH
+    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    ;;
+  esac
+  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...
+  postinstall_cmds='chmod 555 $lib'
+  # or fails outright, so override atomically:
+  install_override_mode=555
+  ;;
+
+interix[3-9]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+irix5* | irix6* | nonstopux*)
+  case $host_os in
+    nonstopux*) version_type=nonstopux ;;
+    *)
+	if test "$lt_cv_prog_gnu_ld" = yes; then
+		version_type=linux # correct to gnu/linux during the next big refactor
+	else
+		version_type=irix
+	fi ;;
+  esac
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'
+  case $host_os in
+  irix5* | nonstopux*)
+    libsuff= shlibsuff=
+    ;;
+  *)
+    case $LD in # libtool.m4 will add one of these switches to LD
+    *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ")
+      libsuff= shlibsuff= libmagic=32-bit;;
+    *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ")
+      libsuff=32 shlibsuff=N32 libmagic=N32;;
+    *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ")
+      libsuff=64 shlibsuff=64 libmagic=64-bit;;
+    *) libsuff= shlibsuff= libmagic=never-match;;
+    esac
+    ;;
+  esac
+  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH
+  shlibpath_overrides_runpath=no
+  sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}"
+  sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}"
+  hardcode_into_libs=yes
+  ;;
+
+# No shared lib support for Linux oldld, aout, or coff.
+linux*oldld* | linux*aout* | linux*coff*)
+  dynamic_linker=no
+  ;;
+
+# This must be glibc/ELF.
+linux* | k*bsd*-gnu | kopensolaris*-gnu)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+
+  # Some binutils ld are patched to set DT_RUNPATH
+  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_shlibpath_overrides_runpath=no
+    save_LDFLAGS=$LDFLAGS
+    save_libdir=$libdir
+    eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \
+	 LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\""
+    cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then :
+  lt_cv_shlibpath_overrides_runpath=yes
+fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+    LDFLAGS=$save_LDFLAGS
+    libdir=$save_libdir
+
+fi
+
+  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath
+
+  # This implies no fast_install, which is unacceptable.
+  # Some rework will be needed to allow for fast_install
+  # before this can be enabled.
+  hardcode_into_libs=yes
+
+  # Append ld.so.conf contents to the search path
+  if test -f /etc/ld.so.conf; then
+    lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[	 ]*hwcap[	 ]/d;s/[:,	]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '`
+    sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra"
+  fi
+
+  # We used to test for /lib/ld.so.1 and disable shared libraries on
+  # powerpc, because MkLinux only supported shared libraries with the
+  # GNU dynamic linker.  Since this was broken with cross compilers,
+  # most powerpc-linux boxes support dynamic linking these days and
+  # people can always --disable-shared, the test was removed, and we
+  # assume the GNU/Linux dynamic linker is in use.
+  dynamic_linker='GNU/Linux ld.so'
+  ;;
+
+netbsdelf*-gnu)
+  version_type=linux
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='NetBSD ld.elf_so'
+  ;;
+
+netbsd*)
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+    finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+    dynamic_linker='NetBSD (a.out) ld.so'
+  else
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    dynamic_linker='NetBSD ld.elf_so'
+  fi
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  ;;
+
+newsos6)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  ;;
+
+*nto* | *qnx*)
+  version_type=qnx
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='ldqnx.so'
+  ;;
+
+openbsd*)
+  version_type=sunos
+  sys_lib_dlsearch_path_spec="/usr/lib"
+  need_lib_prefix=no
+  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.
+  case $host_os in
+    openbsd3.3 | openbsd3.3.*)	need_version=yes ;;
+    *)				need_version=no  ;;
+  esac
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+    case $host_os in
+      openbsd2.[89] | openbsd2.[89].*)
+	shlibpath_overrides_runpath=no
+	;;
+      *)
+	shlibpath_overrides_runpath=yes
+	;;
+      esac
+  else
+    shlibpath_overrides_runpath=yes
+  fi
+  ;;
+
+os2*)
+  libname_spec='$name'
+  shrext_cmds=".dll"
+  need_lib_prefix=no
+  library_names_spec='$libname${shared_ext} $libname.a'
+  dynamic_linker='OS/2 ld.exe'
+  shlibpath_var=LIBPATH
+  ;;
+
+osf3* | osf4* | osf5*)
+  version_type=osf
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib"
+  sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec"
+  ;;
+
+rdos*)
+  dynamic_linker=no
+  ;;
+
+solaris*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  # ldd complains unless libraries are executable
+  postinstall_cmds='chmod +x $lib'
+  ;;
+
+sunos4*)
+  version_type=sunos
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  if test "$with_gnu_ld" = yes; then
+    need_lib_prefix=no
+  fi
+  need_version=yes
+  ;;
+
+sysv4 | sysv4.3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_vendor in
+    sni)
+      shlibpath_overrides_runpath=no
+      need_lib_prefix=no
+      runpath_var=LD_RUN_PATH
+      ;;
+    siemens)
+      need_lib_prefix=no
+      ;;
+    motorola)
+      need_lib_prefix=no
+      need_version=no
+      shlibpath_overrides_runpath=no
+      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'
+      ;;
+  esac
+  ;;
+
+sysv4*MP*)
+  if test -d /usr/nec ;then
+    version_type=linux # correct to gnu/linux during the next big refactor
+    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'
+    soname_spec='$libname${shared_ext}.$major'
+    shlibpath_var=LD_LIBRARY_PATH
+  fi
+  ;;
+
+sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
+  version_type=freebsd-elf
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  if test "$with_gnu_ld" = yes; then
+    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'
+  else
+    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'
+    case $host_os in
+      sco3.2v5*)
+        sys_lib_search_path_spec="$sys_lib_search_path_spec /lib"
+	;;
+    esac
+  fi
+  sys_lib_dlsearch_path_spec='/usr/lib'
+  ;;
+
+tpf*)
+  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+uts4*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+*)
+  dynamic_linker=no
+  ;;
+esac
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5
+$as_echo "$dynamic_linker" >&6; }
+test "$dynamic_linker" = no && can_build_shared=no
+
+variables_saved_for_relink="PATH $shlibpath_var $runpath_var"
+if test "$GCC" = yes; then
+  variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"
+fi
+
+if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then
+  sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec"
+fi
+if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then
+  sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec"
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5
+$as_echo_n "checking how to hardcode library paths into programs... " >&6; }
+hardcode_action=
+if test -n "$hardcode_libdir_flag_spec" ||
+   test -n "$runpath_var" ||
+   test "X$hardcode_automatic" = "Xyes" ; then
+
+  # We can hardcode non-existent directories.
+  if test "$hardcode_direct" != no &&
+     # If the only mechanism to avoid hardcoding is shlibpath_var, we
+     # have to relink, otherwise we might link with an installed library
+     # when we should be linking with a yet-to-be-installed one
+     ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no &&
+     test "$hardcode_minus_L" != no; then
+    # Linking always hardcodes the temporary library directory.
+    hardcode_action=relink
+  else
+    # We can link without hardcoding, and we can hardcode nonexisting dirs.
+    hardcode_action=immediate
+  fi
+else
+  # We cannot hardcode anything, or else we can only hardcode existing
+  # directories.
+  hardcode_action=unsupported
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5
+$as_echo "$hardcode_action" >&6; }
+
+if test "$hardcode_action" = relink ||
+   test "$inherit_rpath" = yes; then
+  # Fast installation is not supported
+  enable_fast_install=no
+elif test "$shlibpath_overrides_runpath" = yes ||
+     test "$enable_shared" = no; then
+  # Fast installation is not necessary
+  enable_fast_install=needless
+fi
+
+
+
+
+
+
+  if test "x$enable_dlopen" != xyes; then
+  enable_dlopen=unknown
+  enable_dlopen_self=unknown
+  enable_dlopen_self_static=unknown
+else
+  lt_cv_dlopen=no
+  lt_cv_dlopen_libs=
+
+  case $host_os in
+  beos*)
+    lt_cv_dlopen="load_add_on"
+    lt_cv_dlopen_libs=
+    lt_cv_dlopen_self=yes
+    ;;
+
+  mingw* | pw32* | cegcc*)
+    lt_cv_dlopen="LoadLibrary"
+    lt_cv_dlopen_libs=
+    ;;
+
+  cygwin*)
+    lt_cv_dlopen="dlopen"
+    lt_cv_dlopen_libs=
+    ;;
+
+  darwin*)
+  # if libdl is installed we need to link against it
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5
+$as_echo_n "checking for dlopen in -ldl... " >&6; }
+if ${ac_cv_lib_dl_dlopen+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldl  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlopen ();
+int
+main ()
+{
+return dlopen ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_dl_dlopen=yes
+else
+  ac_cv_lib_dl_dlopen=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5
+$as_echo "$ac_cv_lib_dl_dlopen" >&6; }
+if test "x$ac_cv_lib_dl_dlopen" = xyes; then :
+  lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"
+else
+
+    lt_cv_dlopen="dyld"
+    lt_cv_dlopen_libs=
+    lt_cv_dlopen_self=yes
+
+fi
+
+    ;;
+
+  *)
+    ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load"
+if test "x$ac_cv_func_shl_load" = xyes; then :
+  lt_cv_dlopen="shl_load"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5
+$as_echo_n "checking for shl_load in -ldld... " >&6; }
+if ${ac_cv_lib_dld_shl_load+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldld  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char shl_load ();
+int
+main ()
+{
+return shl_load ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_dld_shl_load=yes
+else
+  ac_cv_lib_dld_shl_load=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5
+$as_echo "$ac_cv_lib_dld_shl_load" >&6; }
+if test "x$ac_cv_lib_dld_shl_load" = xyes; then :
+  lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"
+else
+  ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen"
+if test "x$ac_cv_func_dlopen" = xyes; then :
+  lt_cv_dlopen="dlopen"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5
+$as_echo_n "checking for dlopen in -ldl... " >&6; }
+if ${ac_cv_lib_dl_dlopen+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldl  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlopen ();
+int
+main ()
+{
+return dlopen ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_dl_dlopen=yes
+else
+  ac_cv_lib_dl_dlopen=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5
+$as_echo "$ac_cv_lib_dl_dlopen" >&6; }
+if test "x$ac_cv_lib_dl_dlopen" = xyes; then :
+  lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5
+$as_echo_n "checking for dlopen in -lsvld... " >&6; }
+if ${ac_cv_lib_svld_dlopen+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lsvld  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlopen ();
+int
+main ()
+{
+return dlopen ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_svld_dlopen=yes
+else
+  ac_cv_lib_svld_dlopen=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5
+$as_echo "$ac_cv_lib_svld_dlopen" >&6; }
+if test "x$ac_cv_lib_svld_dlopen" = xyes; then :
+  lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5
+$as_echo_n "checking for dld_link in -ldld... " >&6; }
+if ${ac_cv_lib_dld_dld_link+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-ldld  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dld_link ();
+int
+main ()
+{
+return dld_link ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_dld_dld_link=yes
+else
+  ac_cv_lib_dld_dld_link=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5
+$as_echo "$ac_cv_lib_dld_dld_link" >&6; }
+if test "x$ac_cv_lib_dld_dld_link" = xyes; then :
+  lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"
+fi
+
+
+fi
+
+
+fi
+
+
+fi
+
+
+fi
+
+
+fi
+
+    ;;
+  esac
+
+  if test "x$lt_cv_dlopen" != xno; then
+    enable_dlopen=yes
+  else
+    enable_dlopen=no
+  fi
+
+  case $lt_cv_dlopen in
+  dlopen)
+    save_CPPFLAGS="$CPPFLAGS"
+    test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H"
+
+    save_LDFLAGS="$LDFLAGS"
+    wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\"
+
+    save_LIBS="$LIBS"
+    LIBS="$lt_cv_dlopen_libs $LIBS"
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5
+$as_echo_n "checking whether a program can dlopen itself... " >&6; }
+if ${lt_cv_dlopen_self+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  	  if test "$cross_compiling" = yes; then :
+  lt_cv_dlopen_self=cross
+else
+  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
+  lt_status=$lt_dlunknown
+  cat > conftest.$ac_ext <<_LT_EOF
+#line $LINENO "configure"
+#include "confdefs.h"
+
+#if HAVE_DLFCN_H
+#include <dlfcn.h>
+#endif
+
+#include <stdio.h>
+
+#ifdef RTLD_GLOBAL
+#  define LT_DLGLOBAL		RTLD_GLOBAL
+#else
+#  ifdef DL_GLOBAL
+#    define LT_DLGLOBAL		DL_GLOBAL
+#  else
+#    define LT_DLGLOBAL		0
+#  endif
+#endif
+
+/* We may have to define LT_DLLAZY_OR_NOW in the command line if we
+   find out it does not work in some platform. */
+#ifndef LT_DLLAZY_OR_NOW
+#  ifdef RTLD_LAZY
+#    define LT_DLLAZY_OR_NOW		RTLD_LAZY
+#  else
+#    ifdef DL_LAZY
+#      define LT_DLLAZY_OR_NOW		DL_LAZY
+#    else
+#      ifdef RTLD_NOW
+#        define LT_DLLAZY_OR_NOW	RTLD_NOW
+#      else
+#        ifdef DL_NOW
+#          define LT_DLLAZY_OR_NOW	DL_NOW
+#        else
+#          define LT_DLLAZY_OR_NOW	0
+#        endif
+#      endif
+#    endif
+#  endif
+#endif
+
+/* When -fvisbility=hidden is used, assume the code has been annotated
+   correspondingly for the symbols needed.  */
+#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))
+int fnord () __attribute__((visibility("default")));
+#endif
+
+int fnord () { return 42; }
+int main ()
+{
+  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);
+  int status = $lt_dlunknown;
+
+  if (self)
+    {
+      if (dlsym (self,"fnord"))       status = $lt_dlno_uscore;
+      else
+        {
+	  if (dlsym( self,"_fnord"))  status = $lt_dlneed_uscore;
+          else puts (dlerror ());
+	}
+      /* dlclose (self); */
+    }
+  else
+    puts (dlerror ());
+
+  return status;
+}
+_LT_EOF
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5
+  (eval $ac_link) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then
+    (./conftest; exit; ) >&5 2>/dev/null
+    lt_status=$?
+    case x$lt_status in
+      x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;;
+      x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;;
+      x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;;
+    esac
+  else :
+    # compilation failed
+    lt_cv_dlopen_self=no
+  fi
+fi
+rm -fr conftest*
+
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5
+$as_echo "$lt_cv_dlopen_self" >&6; }
+
+    if test "x$lt_cv_dlopen_self" = xyes; then
+      wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5
+$as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; }
+if ${lt_cv_dlopen_self_static+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  	  if test "$cross_compiling" = yes; then :
+  lt_cv_dlopen_self_static=cross
+else
+  lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
+  lt_status=$lt_dlunknown
+  cat > conftest.$ac_ext <<_LT_EOF
+#line $LINENO "configure"
+#include "confdefs.h"
+
+#if HAVE_DLFCN_H
+#include <dlfcn.h>
+#endif
+
+#include <stdio.h>
+
+#ifdef RTLD_GLOBAL
+#  define LT_DLGLOBAL		RTLD_GLOBAL
+#else
+#  ifdef DL_GLOBAL
+#    define LT_DLGLOBAL		DL_GLOBAL
+#  else
+#    define LT_DLGLOBAL		0
+#  endif
+#endif
+
+/* We may have to define LT_DLLAZY_OR_NOW in the command line if we
+   find out it does not work in some platform. */
+#ifndef LT_DLLAZY_OR_NOW
+#  ifdef RTLD_LAZY
+#    define LT_DLLAZY_OR_NOW		RTLD_LAZY
+#  else
+#    ifdef DL_LAZY
+#      define LT_DLLAZY_OR_NOW		DL_LAZY
+#    else
+#      ifdef RTLD_NOW
+#        define LT_DLLAZY_OR_NOW	RTLD_NOW
+#      else
+#        ifdef DL_NOW
+#          define LT_DLLAZY_OR_NOW	DL_NOW
+#        else
+#          define LT_DLLAZY_OR_NOW	0
+#        endif
+#      endif
+#    endif
+#  endif
+#endif
+
+/* When -fvisbility=hidden is used, assume the code has been annotated
+   correspondingly for the symbols needed.  */
+#if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3))
+int fnord () __attribute__((visibility("default")));
+#endif
+
+int fnord () { return 42; }
+int main ()
+{
+  void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW);
+  int status = $lt_dlunknown;
+
+  if (self)
+    {
+      if (dlsym (self,"fnord"))       status = $lt_dlno_uscore;
+      else
+        {
+	  if (dlsym( self,"_fnord"))  status = $lt_dlneed_uscore;
+          else puts (dlerror ());
+	}
+      /* dlclose (self); */
+    }
+  else
+    puts (dlerror ());
+
+  return status;
+}
+_LT_EOF
+  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5
+  (eval $ac_link) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then
+    (./conftest; exit; ) >&5 2>/dev/null
+    lt_status=$?
+    case x$lt_status in
+      x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;;
+      x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;;
+      x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;;
+    esac
+  else :
+    # compilation failed
+    lt_cv_dlopen_self_static=no
+  fi
+fi
+rm -fr conftest*
+
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5
+$as_echo "$lt_cv_dlopen_self_static" >&6; }
+    fi
+
+    CPPFLAGS="$save_CPPFLAGS"
+    LDFLAGS="$save_LDFLAGS"
+    LIBS="$save_LIBS"
+    ;;
+  esac
+
+  case $lt_cv_dlopen_self in
+  yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;;
+  *) enable_dlopen_self=unknown ;;
+  esac
+
+  case $lt_cv_dlopen_self_static in
+  yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;;
+  *) enable_dlopen_self_static=unknown ;;
+  esac
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+striplib=
+old_striplib=
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5
+$as_echo_n "checking whether stripping libraries is possible... " >&6; }
+if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then
+  test -z "$old_striplib" && old_striplib="$STRIP --strip-debug"
+  test -z "$striplib" && striplib="$STRIP --strip-unneeded"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+# FIXME - insert some real tests, host_os isn't really good enough
+  case $host_os in
+  darwin*)
+    if test -n "$STRIP" ; then
+      striplib="$STRIP -x"
+      old_striplib="$STRIP -S"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+    else
+      { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+    fi
+    ;;
+  *)
+    { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+    ;;
+  esac
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+  # Report which library types will actually be built
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5
+$as_echo_n "checking if libtool supports shared libraries... " >&6; }
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5
+$as_echo "$can_build_shared" >&6; }
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5
+$as_echo_n "checking whether to build shared libraries... " >&6; }
+  test "$can_build_shared" = "no" && enable_shared=no
+
+  # On AIX, shared libraries and static libraries use the same namespace, and
+  # are all built from PIC.
+  case $host_os in
+  aix3*)
+    test "$enable_shared" = yes && enable_static=no
+    if test -n "$RANLIB"; then
+      archive_cmds="$archive_cmds~\$RANLIB \$lib"
+      postinstall_cmds='$RANLIB $lib'
+    fi
+    ;;
+
+  aix[4-9]*)
+    if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then
+      test "$enable_shared" = yes && enable_static=no
+    fi
+    ;;
+  esac
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5
+$as_echo "$enable_shared" >&6; }
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5
+$as_echo_n "checking whether to build static libraries... " >&6; }
+  # Make sure either enable_shared or enable_static is yes.
+  test "$enable_shared" = yes || enable_static=yes
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5
+$as_echo "$enable_static" >&6; }
+
+
+
+
+fi
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+CC="$lt_save_CC"
+
+      if test -n "$CXX" && ( test "X$CXX" != "Xno" &&
+    ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) ||
+    (test "X$CXX" != "Xg++"))) ; then
+  ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5
+$as_echo_n "checking how to run the C++ preprocessor... " >&6; }
+if test -z "$CXXCPP"; then
+  if ${ac_cv_prog_CXXCPP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+      # Double quotes because CXXCPP needs to be expanded
+    for CXXCPP in "$CXX -E" "/lib/cpp"
+    do
+      ac_preproc_ok=false
+for ac_cxx_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+  break
+fi
+
+    done
+    ac_cv_prog_CXXCPP=$CXXCPP
+
+fi
+  CXXCPP=$ac_cv_prog_CXXCPP
+else
+  ac_cv_prog_CXXCPP=$CXXCPP
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5
+$as_echo "$CXXCPP" >&6; }
+ac_preproc_ok=false
+for ac_cxx_preproc_warn_flag in '' yes
+do
+  # Use a header file that comes with gcc, so configuring glibc
+  # with a fresh cross-compiler works.
+  # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
+  # <limits.h> exists even on freestanding compilers.
+  # On the NeXT, cc -E runs the code through the compiler's parser,
+  # not just through cpp. "Syntax error" is here to catch this case.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#ifdef __STDC__
+# include <limits.h>
+#else
+# include <assert.h>
+#endif
+		     Syntax error
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+
+else
+  # Broken: fails on valid input.
+continue
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+  # OK, works on sane cases.  Now check whether nonexistent headers
+  # can be detected and how.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ac_nonexistent.h>
+_ACEOF
+if ac_fn_cxx_try_cpp "$LINENO"; then :
+  # Broken: success on invalid input.
+continue
+else
+  # Passes both tests.
+ac_preproc_ok=:
+break
+fi
+rm -f conftest.err conftest.i conftest.$ac_ext
+
+done
+# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
+rm -f conftest.i conftest.err conftest.$ac_ext
+if $ac_preproc_ok; then :
+
+else
+  { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "C++ preprocessor \"$CXXCPP\" fails sanity check
+See \`config.log' for more details" "$LINENO" 5; }
+fi
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+else
+  _lt_caught_CXX_error=yes
+fi
+
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+archive_cmds_need_lc_CXX=no
+allow_undefined_flag_CXX=
+always_export_symbols_CXX=no
+archive_expsym_cmds_CXX=
+compiler_needs_object_CXX=no
+export_dynamic_flag_spec_CXX=
+hardcode_direct_CXX=no
+hardcode_direct_absolute_CXX=no
+hardcode_libdir_flag_spec_CXX=
+hardcode_libdir_separator_CXX=
+hardcode_minus_L_CXX=no
+hardcode_shlibpath_var_CXX=unsupported
+hardcode_automatic_CXX=no
+inherit_rpath_CXX=no
+module_cmds_CXX=
+module_expsym_cmds_CXX=
+link_all_deplibs_CXX=unknown
+old_archive_cmds_CXX=$old_archive_cmds
+reload_flag_CXX=$reload_flag
+reload_cmds_CXX=$reload_cmds
+no_undefined_flag_CXX=
+whole_archive_flag_spec_CXX=
+enable_shared_with_static_runtimes_CXX=no
+
+# Source file extension for C++ test sources.
+ac_ext=cpp
+
+# Object file extension for compiled C++ test sources.
+objext=o
+objext_CXX=$objext
+
+# No sense in running all these tests if we already determined that
+# the CXX compiler isn't working.  Some variables (like enable_shared)
+# are currently assumed to apply to all compilers on this platform,
+# and will be corrupted by setting them based on a non-working compiler.
+if test "$_lt_caught_CXX_error" != yes; then
+  # Code to be used in simple compile tests
+  lt_simple_compile_test_code="int some_variable = 0;"
+
+  # Code to be used in simple link tests
+  lt_simple_link_test_code='int main(int, char *[]) { return(0); }'
+
+  # ltmain only uses $CC for tagged configurations so make sure $CC is set.
+
+
+
+
+
+
+# If no C compiler was specified, use CC.
+LTCC=${LTCC-"$CC"}
+
+# If no C compiler flags were specified, use CFLAGS.
+LTCFLAGS=${LTCFLAGS-"$CFLAGS"}
+
+# Allow CC to be a program name with arguments.
+compiler=$CC
+
+
+  # save warnings/boilerplate of simple test code
+  ac_outfile=conftest.$ac_objext
+echo "$lt_simple_compile_test_code" >conftest.$ac_ext
+eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_compiler_boilerplate=`cat conftest.err`
+$RM conftest*
+
+  ac_outfile=conftest.$ac_objext
+echo "$lt_simple_link_test_code" >conftest.$ac_ext
+eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err
+_lt_linker_boilerplate=`cat conftest.err`
+$RM -r conftest*
+
+
+  # Allow CC to be a program name with arguments.
+  lt_save_CC=$CC
+  lt_save_CFLAGS=$CFLAGS
+  lt_save_LD=$LD
+  lt_save_GCC=$GCC
+  GCC=$GXX
+  lt_save_with_gnu_ld=$with_gnu_ld
+  lt_save_path_LD=$lt_cv_path_LD
+  if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then
+    lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx
+  else
+    $as_unset lt_cv_prog_gnu_ld
+  fi
+  if test -n "${lt_cv_path_LDCXX+set}"; then
+    lt_cv_path_LD=$lt_cv_path_LDCXX
+  else
+    $as_unset lt_cv_path_LD
+  fi
+  test -z "${LDCXX+set}" || LD=$LDCXX
+  CC=${CXX-"c++"}
+  CFLAGS=$CXXFLAGS
+  compiler=$CC
+  compiler_CXX=$CC
+  for cc_temp in $compiler""; do
+  case $cc_temp in
+    compile | *[\\/]compile | ccache | *[\\/]ccache ) ;;
+    distcc | *[\\/]distcc | purify | *[\\/]purify ) ;;
+    \-*) ;;
+    *) break;;
+  esac
+done
+cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"`
+
+
+  if test -n "$compiler"; then
+    # We don't want -fno-exception when compiling C++ code, so set the
+    # no_builtin_flag separately
+    if test "$GXX" = yes; then
+      lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin'
+    else
+      lt_prog_compiler_no_builtin_flag_CXX=
+    fi
+
+    if test "$GXX" = yes; then
+      # Set up default GNU C++ configuration
+
+
+
+# Check whether --with-gnu-ld was given.
+if test "${with_gnu_ld+set}" = set; then :
+  withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes
+else
+  with_gnu_ld=no
+fi
+
+ac_prog=ld
+if test "$GCC" = yes; then
+  # Check if gcc -print-prog-name=ld gives a path.
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5
+$as_echo_n "checking for ld used by $CC... " >&6; }
+  case $host in
+  *-*-mingw*)
+    # gcc leaves a trailing carriage return which upsets mingw
+    ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;;
+  *)
+    ac_prog=`($CC -print-prog-name=ld) 2>&5` ;;
+  esac
+  case $ac_prog in
+    # Accept absolute paths.
+    [\\/]* | ?:[\\/]*)
+      re_direlt='/[^/][^/]*/\.\./'
+      # Canonicalize the pathname of ld
+      ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'`
+      while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do
+	ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"`
+      done
+      test -z "$LD" && LD="$ac_prog"
+      ;;
+  "")
+    # If it fails, then pretend we aren't using GCC.
+    ac_prog=ld
+    ;;
+  *)
+    # If it is relative, then search for the first ld in PATH.
+    with_gnu_ld=unknown
+    ;;
+  esac
+elif test "$with_gnu_ld" = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5
+$as_echo_n "checking for GNU ld... " >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5
+$as_echo_n "checking for non-GNU ld... " >&6; }
+fi
+if ${lt_cv_path_LD+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -z "$LD"; then
+  lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR
+  for ac_dir in $PATH; do
+    IFS="$lt_save_ifs"
+    test -z "$ac_dir" && ac_dir=.
+    if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then
+      lt_cv_path_LD="$ac_dir/$ac_prog"
+      # Check to see if the program is GNU ld.  I'd rather use --version,
+      # but apparently some variants of GNU ld only accept -v.
+      # Break only if it was the GNU/non-GNU ld that we prefer.
+      case `"$lt_cv_path_LD" -v 2>&1 </dev/null` in
+      *GNU* | *'with BFD'*)
+	test "$with_gnu_ld" != no && break
+	;;
+      *)
+	test "$with_gnu_ld" != yes && break
+	;;
+      esac
+    fi
+  done
+  IFS="$lt_save_ifs"
+else
+  lt_cv_path_LD="$LD" # Let the user override the test with a path.
+fi
+fi
+
+LD="$lt_cv_path_LD"
+if test -n "$LD"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LD" >&5
+$as_echo "$LD" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5
+$as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; }
+if ${lt_cv_prog_gnu_ld+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  # I'd rather use --version here, but apparently some GNU lds only accept -v.
+case `$LD -v 2>&1 </dev/null` in
+*GNU* | *'with BFD'*)
+  lt_cv_prog_gnu_ld=yes
+  ;;
+*)
+  lt_cv_prog_gnu_ld=no
+  ;;
+esac
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_gnu_ld" >&5
+$as_echo "$lt_cv_prog_gnu_ld" >&6; }
+with_gnu_ld=$lt_cv_prog_gnu_ld
+
+
+
+
+
+
+
+      # Check if GNU C++ uses GNU ld as the underlying linker, since the
+      # archiving commands below assume that GNU ld is being used.
+      if test "$with_gnu_ld" = yes; then
+        archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+        archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+
+        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'
+        export_dynamic_flag_spec_CXX='${wl}--export-dynamic'
+
+        # If archive_cmds runs LD, not CC, wlarc should be empty
+        # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to
+        #     investigate it a little bit more. (MM)
+        wlarc='${wl}'
+
+        # ancient GNU ld didn't support --whole-archive et. al.
+        if eval "`$CC -print-prog-name=ld` --help 2>&1" |
+	  $GREP 'no-whole-archive' > /dev/null; then
+          whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+        else
+          whole_archive_flag_spec_CXX=
+        fi
+      else
+        with_gnu_ld=no
+        wlarc=
+
+        # A generic and very simple default shared library creation
+        # command for GNU C++ for the case where it uses the native
+        # linker, instead of GNU ld.  If possible, this setting should
+        # overridden to take advantage of the native linker features on
+        # the platform it is being used on.
+        archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'
+      fi
+
+      # Commands to make compiler produce verbose output that lists
+      # what "hidden" libraries, object files and flags are used when
+      # linking a shared library.
+      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+
+    else
+      GXX=no
+      with_gnu_ld=no
+      wlarc=
+    fi
+
+    # PORTME: fill in a description of your system's C++ link characteristics
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5
+$as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; }
+    ld_shlibs_CXX=yes
+    case $host_os in
+      aix3*)
+        # FIXME: insert proper C++ library support
+        ld_shlibs_CXX=no
+        ;;
+      aix[4-9]*)
+        if test "$host_cpu" = ia64; then
+          # On IA64, the linker does run time linking by default, so we don't
+          # have to do anything special.
+          aix_use_runtimelinking=no
+          exp_sym_flag='-Bexport'
+          no_entry_flag=""
+        else
+          aix_use_runtimelinking=no
+
+          # Test if we are trying to use run time linking or normal
+          # AIX style linking. If -brtl is somewhere in LDFLAGS, we
+          # need to do runtime linking.
+          case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*)
+	    for ld_flag in $LDFLAGS; do
+	      case $ld_flag in
+	      *-brtl*)
+	        aix_use_runtimelinking=yes
+	        break
+	        ;;
+	      esac
+	    done
+	    ;;
+          esac
+
+          exp_sym_flag='-bexport'
+          no_entry_flag='-bnoentry'
+        fi
+
+        # When large executables or shared objects are built, AIX ld can
+        # have problems creating the table of contents.  If linking a library
+        # or program results in "error TOC overflow" add -mminimal-toc to
+        # CXXFLAGS/CFLAGS for g++/gcc.  In the cases where that is not
+        # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS.
+
+        archive_cmds_CXX=''
+        hardcode_direct_CXX=yes
+        hardcode_direct_absolute_CXX=yes
+        hardcode_libdir_separator_CXX=':'
+        link_all_deplibs_CXX=yes
+        file_list_spec_CXX='${wl}-f,'
+
+        if test "$GXX" = yes; then
+          case $host_os in aix4.[012]|aix4.[012].*)
+          # We only want to do this on AIX 4.2 and lower, the check
+          # below for broken collect2 doesn't work under 4.3+
+	  collect2name=`${CC} -print-prog-name=collect2`
+	  if test -f "$collect2name" &&
+	     strings "$collect2name" | $GREP resolve_lib_name >/dev/null
+	  then
+	    # We have reworked collect2
+	    :
+	  else
+	    # We have old collect2
+	    hardcode_direct_CXX=unsupported
+	    # It fails to find uninstalled libraries when the uninstalled
+	    # path is not listed in the libpath.  Setting hardcode_minus_L
+	    # to unsupported forces relinking
+	    hardcode_minus_L_CXX=yes
+	    hardcode_libdir_flag_spec_CXX='-L$libdir'
+	    hardcode_libdir_separator_CXX=
+	  fi
+          esac
+          shared_flag='-shared'
+	  if test "$aix_use_runtimelinking" = yes; then
+	    shared_flag="$shared_flag "'${wl}-G'
+	  fi
+        else
+          # not using gcc
+          if test "$host_cpu" = ia64; then
+	  # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release
+	  # chokes on -Wl,-G. The following line is correct:
+	  shared_flag='-G'
+          else
+	    if test "$aix_use_runtimelinking" = yes; then
+	      shared_flag='${wl}-G'
+	    else
+	      shared_flag='${wl}-bM:SRE'
+	    fi
+          fi
+        fi
+
+        export_dynamic_flag_spec_CXX='${wl}-bexpall'
+        # It seems that -bexpall does not export symbols beginning with
+        # underscore (_), so it is better to generate a list of symbols to
+	# export.
+        always_export_symbols_CXX=yes
+        if test "$aix_use_runtimelinking" = yes; then
+          # Warning - without using the other runtime loading flags (-brtl),
+          # -berok will link without error, but may produce a broken library.
+          allow_undefined_flag_CXX='-berok'
+          # Determine the default libpath from the value encoded in an empty
+          # executable.
+          if test "${lt_cv_aix_libpath+set}" = set; then
+  aix_libpath=$lt_cv_aix_libpath
+else
+  if ${lt_cv_aix_libpath__CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+
+  lt_aix_libpath_sed='
+      /Import File Strings/,/^$/ {
+	  /^0/ {
+	      s/^0  *\([^ ]*\) *$/\1/
+	      p
+	  }
+      }'
+  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  # Check for a 64-bit object if we didn't find anything.
+  if test -z "$lt_cv_aix_libpath__CXX"; then
+    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+  if test -z "$lt_cv_aix_libpath__CXX"; then
+    lt_cv_aix_libpath__CXX="/usr/lib:/lib"
+  fi
+
+fi
+
+  aix_libpath=$lt_cv_aix_libpath__CXX
+fi
+
+          hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath"
+
+          archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag"
+        else
+          if test "$host_cpu" = ia64; then
+	    hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib'
+	    allow_undefined_flag_CXX="-z nodefs"
+	    archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols"
+          else
+	    # Determine the default libpath from the value encoded in an
+	    # empty executable.
+	    if test "${lt_cv_aix_libpath+set}" = set; then
+  aix_libpath=$lt_cv_aix_libpath
+else
+  if ${lt_cv_aix_libpath__CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+
+  lt_aix_libpath_sed='
+      /Import File Strings/,/^$/ {
+	  /^0/ {
+	      s/^0  *\([^ ]*\) *$/\1/
+	      p
+	  }
+      }'
+  lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  # Check for a 64-bit object if we didn't find anything.
+  if test -z "$lt_cv_aix_libpath__CXX"; then
+    lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"`
+  fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+  if test -z "$lt_cv_aix_libpath__CXX"; then
+    lt_cv_aix_libpath__CXX="/usr/lib:/lib"
+  fi
+
+fi
+
+  aix_libpath=$lt_cv_aix_libpath__CXX
+fi
+
+	    hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath"
+	    # Warning - without using the other run time loading flags,
+	    # -berok will link without error, but may produce a broken library.
+	    no_undefined_flag_CXX=' ${wl}-bernotok'
+	    allow_undefined_flag_CXX=' ${wl}-berok'
+	    if test "$with_gnu_ld" = yes; then
+	      # We only use this code for GNU lds that support --whole-archive.
+	      whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	    else
+	      # Exported symbols can be pulled into shared objects from archives
+	      whole_archive_flag_spec_CXX='$convenience'
+	    fi
+	    archive_cmds_need_lc_CXX=yes
+	    # This is similar to how AIX traditionally builds its shared
+	    # libraries.
+	    archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname'
+          fi
+        fi
+        ;;
+
+      beos*)
+	if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then
+	  allow_undefined_flag_CXX=unsupported
+	  # Joseph Beckenbach <jrb3@best.com> says some releases of gcc
+	  # support --undefined.  This deserves some investigation.  FIXME
+	  archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	else
+	  ld_shlibs_CXX=no
+	fi
+	;;
+
+      chorus*)
+        case $cc_basename in
+          *)
+	  # FIXME: insert proper C++ library support
+	  ld_shlibs_CXX=no
+	  ;;
+        esac
+        ;;
+
+      cygwin* | mingw* | pw32* | cegcc*)
+	case $GXX,$cc_basename in
+	,cl* | no,cl*)
+	  # Native MSVC
+	  # hardcode_libdir_flag_spec is actually meaningless, as there is
+	  # no search path for DLLs.
+	  hardcode_libdir_flag_spec_CXX=' '
+	  allow_undefined_flag_CXX=unsupported
+	  always_export_symbols_CXX=yes
+	  file_list_spec_CXX='@'
+	  # Tell ltmain to make .lib files, not .a files.
+	  libext=lib
+	  # Tell ltmain to make .dll files, not .so files.
+	  shrext_cmds=".dll"
+	  # FIXME: Setting linknames here is a bad hack.
+	  archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames='
+	  archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	      $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp;
+	    else
+	      $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp;
+	    fi~
+	    $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~
+	    linknames='
+	  # The linker will not automatically build a static lib if we build a DLL.
+	  # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true'
+	  enable_shared_with_static_runtimes_CXX=yes
+	  # Don't use ranlib
+	  old_postinstall_cmds_CXX='chmod 644 $oldlib'
+	  postlink_cmds_CXX='lt_outputfile="@OUTPUT@"~
+	    lt_tool_outputfile="@TOOL_OUTPUT@"~
+	    case $lt_outputfile in
+	      *.exe|*.EXE) ;;
+	      *)
+		lt_outputfile="$lt_outputfile.exe"
+		lt_tool_outputfile="$lt_tool_outputfile.exe"
+		;;
+	    esac~
+	    func_to_tool_file "$lt_outputfile"~
+	    if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then
+	      $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1;
+	      $RM "$lt_outputfile.manifest";
+	    fi'
+	  ;;
+	*)
+	  # g++
+	  # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless,
+	  # as there is no search path for DLLs.
+	  hardcode_libdir_flag_spec_CXX='-L$libdir'
+	  export_dynamic_flag_spec_CXX='${wl}--export-all-symbols'
+	  allow_undefined_flag_CXX=unsupported
+	  always_export_symbols_CXX=no
+	  enable_shared_with_static_runtimes_CXX=yes
+
+	  if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then
+	    archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	    # If the export-symbols file already is a .def file (1st line
+	    # is EXPORTS), use it as is; otherwise, prepend...
+	    archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then
+	      cp $export_symbols $output_objdir/$soname.def;
+	    else
+	      echo EXPORTS > $output_objdir/$soname.def;
+	      cat $export_symbols >> $output_objdir/$soname.def;
+	    fi~
+	    $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib'
+	  else
+	    ld_shlibs_CXX=no
+	  fi
+	  ;;
+	esac
+	;;
+      darwin* | rhapsody*)
+
+
+  archive_cmds_need_lc_CXX=no
+  hardcode_direct_CXX=no
+  hardcode_automatic_CXX=yes
+  hardcode_shlibpath_var_CXX=unsupported
+  if test "$lt_cv_ld_force_load" = "yes"; then
+    whole_archive_flag_spec_CXX='`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`'
+
+  else
+    whole_archive_flag_spec_CXX=''
+  fi
+  link_all_deplibs_CXX=yes
+  allow_undefined_flag_CXX="$_lt_dar_allow_undefined"
+  case $cc_basename in
+     ifort*) _lt_dar_can_shared=yes ;;
+     *) _lt_dar_can_shared=$GCC ;;
+  esac
+  if test "$_lt_dar_can_shared" = "yes"; then
+    output_verbose_link_cmd=func_echo_all
+    archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}"
+    module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}"
+    archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}"
+    module_expsym_cmds_CXX="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}"
+       if test "$lt_cv_apple_cc_single_mod" != "yes"; then
+      archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}"
+      archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}"
+    fi
+
+  else
+  ld_shlibs_CXX=no
+  fi
+
+	;;
+
+      dgux*)
+        case $cc_basename in
+          ec++*)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          ghcx*)
+	    # Green Hills C++ Compiler
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+        esac
+        ;;
+
+      freebsd2.*)
+        # C++ shared libraries reported to be fairly broken before
+	# switch to ELF
+        ld_shlibs_CXX=no
+        ;;
+
+      freebsd-elf*)
+        archive_cmds_need_lc_CXX=no
+        ;;
+
+      freebsd* | dragonfly*)
+        # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF
+        # conventions
+        ld_shlibs_CXX=yes
+        ;;
+
+      gnu*)
+        ;;
+
+      haiku*)
+        archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+        link_all_deplibs_CXX=yes
+        ;;
+
+      hpux9*)
+        hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir'
+        hardcode_libdir_separator_CXX=:
+        export_dynamic_flag_spec_CXX='${wl}-E'
+        hardcode_direct_CXX=yes
+        hardcode_minus_L_CXX=yes # Not in the search PATH,
+				             # but as the default
+				             # location of the library.
+
+        case $cc_basename in
+          CC*)
+            # FIXME: insert proper C++ library support
+            ld_shlibs_CXX=no
+            ;;
+          aCC*)
+            archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+            # Commands to make compiler produce verbose output that lists
+            # what "hidden" libraries, object files and flags are used when
+            # linking a shared library.
+            #
+            # There doesn't appear to be a way to prevent this compiler from
+            # explicitly linking system object files so we need to strip them
+            # from the output so that they don't get included in the library
+            # dependencies.
+            output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+            ;;
+          *)
+            if test "$GXX" = yes; then
+              archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib'
+            else
+              # FIXME: insert proper C++ library support
+              ld_shlibs_CXX=no
+            fi
+            ;;
+        esac
+        ;;
+
+      hpux10*|hpux11*)
+        if test $with_gnu_ld = no; then
+	  hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir'
+	  hardcode_libdir_separator_CXX=:
+
+          case $host_cpu in
+            hppa*64*|ia64*)
+              ;;
+            *)
+	      export_dynamic_flag_spec_CXX='${wl}-E'
+              ;;
+          esac
+        fi
+        case $host_cpu in
+          hppa*64*|ia64*)
+            hardcode_direct_CXX=no
+            hardcode_shlibpath_var_CXX=no
+            ;;
+          *)
+            hardcode_direct_CXX=yes
+            hardcode_direct_absolute_CXX=yes
+            hardcode_minus_L_CXX=yes # Not in the search PATH,
+					         # but as the default
+					         # location of the library.
+            ;;
+        esac
+
+        case $cc_basename in
+          CC*)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          aCC*)
+	    case $host_cpu in
+	      hppa*64*)
+	        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	      ia64*)
+	        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	      *)
+	        archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	        ;;
+	    esac
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+	    ;;
+          *)
+	    if test "$GXX" = yes; then
+	      if test $with_gnu_ld = no; then
+	        case $host_cpu in
+	          hppa*64*)
+	            archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	          ia64*)
+	            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	          *)
+	            archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	            ;;
+	        esac
+	      fi
+	    else
+	      # FIXME: insert proper C++ library support
+	      ld_shlibs_CXX=no
+	    fi
+	    ;;
+        esac
+        ;;
+
+      interix[3-9]*)
+	hardcode_direct_CXX=no
+	hardcode_shlibpath_var_CXX=no
+	hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'
+	export_dynamic_flag_spec_CXX='${wl}-E'
+	# Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc.
+	# Instead, shared libraries are loaded at an image base (0x10000000 by
+	# default) and relocated if they conflict, which is a slow very memory
+	# consuming and fragmenting process.  To avoid this, we pick a random,
+	# 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link
+	# time.  Moving up from 0x10000000 also allows more sbrk(2) space.
+	archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+	archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib'
+	;;
+      irix5* | irix6*)
+        case $cc_basename in
+          CC*)
+	    # SGI C++
+	    archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -ar", where "CC" is the IRIX C++ compiler.  This is
+	    # necessary to make sure instantiated templates are included
+	    # in the archive.
+	    old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs'
+	    ;;
+          *)
+	    if test "$GXX" = yes; then
+	      if test "$with_gnu_ld" = no; then
+	        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+	      else
+	        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib'
+	      fi
+	    fi
+	    link_all_deplibs_CXX=yes
+	    ;;
+        esac
+        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'
+        hardcode_libdir_separator_CXX=:
+        inherit_rpath_CXX=yes
+        ;;
+
+      linux* | k*bsd*-gnu | kopensolaris*-gnu)
+        case $cc_basename in
+          KCC*)
+	    # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+	    # KCC will only create a shared library if the output file
+	    # ends with ".so" (or ".sl" for HP-UX), so rename the library
+	    # to its proper name (with version) after linking.
+	    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+	    archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib'
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+
+	    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'
+	    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -Bstatic", where "CC" is the KAI C++ compiler.
+	    old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs'
+	    ;;
+	  icpc* | ecpc* )
+	    # Intel C++
+	    with_gnu_ld=yes
+	    # version 8.0 and above of icpc choke on multiply defined symbols
+	    # if we add $predep_objects and $postdep_objects, however 7.1 and
+	    # earlier do not add the objects themselves.
+	    case `$CC -V 2>&1` in
+	      *"Version 7."*)
+	        archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+		archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+		;;
+	      *)  # Version 8.0 or newer
+	        tmp_idyn=
+	        case $host_cpu in
+		  ia64*) tmp_idyn=' -i_dynamic';;
+		esac
+	        archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+		archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib'
+		;;
+	    esac
+	    archive_cmds_need_lc_CXX=no
+	    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'
+	    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'
+	    whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive'
+	    ;;
+          pgCC* | pgcpp*)
+            # Portland Group C++ compiler
+	    case `$CC -V` in
+	    *pgCC\ [1-5].* | *pgcpp\ [1-5].*)
+	      prelink_cmds_CXX='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~
+		compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"'
+	      old_archive_cmds_CXX='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~
+		$AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~
+		$RANLIB $oldlib'
+	      archive_cmds_CXX='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~
+		$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'
+	      archive_expsym_cmds_CXX='tpldir=Template.dir~
+		rm -rf $tpldir~
+		$CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~
+		$CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'
+	      ;;
+	    *) # Version 6 and above use weak symbols
+	      archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib'
+	      archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib'
+	      ;;
+	    esac
+
+	    hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir'
+	    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'
+	    whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test  -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+            ;;
+	  cxx*)
+	    # Compaq C++
+	    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname  -o $lib ${wl}-retain-symbols-file $wl$export_symbols'
+
+	    runpath_var=LD_RUN_PATH
+	    hardcode_libdir_flag_spec_CXX='-rpath $libdir'
+	    hardcode_libdir_separator_CXX=:
+
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed'
+	    ;;
+	  xl* | mpixl* | bgxl*)
+	    # IBM XL 8.0 on PPC, with GNU ld
+	    hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'
+	    export_dynamic_flag_spec_CXX='${wl}--export-dynamic'
+	    archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
+	    if test "x$supports_anon_versioning" = xyes; then
+	      archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~
+		cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~
+		echo "local: *; };" >> $output_objdir/$libname.ver~
+		$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib'
+	    fi
+	    ;;
+	  *)
+	    case `$CC -V 2>&1 | sed 5q` in
+	    *Sun\ C*)
+	      # Sun C++ 5.9
+	      no_undefined_flag_CXX=' -zdefs'
+	      archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	      archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols'
+	      hardcode_libdir_flag_spec_CXX='-R$libdir'
+	      whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive'
+	      compiler_needs_object_CXX=yes
+
+	      # Not sure whether something based on
+	      # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1
+	      # would be better.
+	      output_verbose_link_cmd='func_echo_all'
+
+	      # Archives containing C++ object files must be created using
+	      # "CC -xar", where "CC" is the Sun C++ compiler.  This is
+	      # necessary to make sure instantiated templates are included
+	      # in the archive.
+	      old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'
+	      ;;
+	    esac
+	    ;;
+	esac
+	;;
+
+      lynxos*)
+        # FIXME: insert proper C++ library support
+	ld_shlibs_CXX=no
+	;;
+
+      m88k*)
+        # FIXME: insert proper C++ library support
+        ld_shlibs_CXX=no
+	;;
+
+      mvs*)
+        case $cc_basename in
+          cxx*)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+	  *)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+	esac
+	;;
+
+      netbsd*)
+        if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+	  archive_cmds_CXX='$LD -Bshareable  -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags'
+	  wlarc=
+	  hardcode_libdir_flag_spec_CXX='-R$libdir'
+	  hardcode_direct_CXX=yes
+	  hardcode_shlibpath_var_CXX=no
+	fi
+	# Workaround some broken pre-1.5 toolchains
+	output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"'
+	;;
+
+      *nto* | *qnx*)
+        ld_shlibs_CXX=yes
+	;;
+
+      openbsd2*)
+        # C++ shared libraries are fairly broken
+	ld_shlibs_CXX=no
+	;;
+
+      openbsd*)
+	if test -f /usr/libexec/ld.so; then
+	  hardcode_direct_CXX=yes
+	  hardcode_shlibpath_var_CXX=no
+	  hardcode_direct_absolute_CXX=yes
+	  archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib'
+	  hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'
+	  if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+	    archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib'
+	    export_dynamic_flag_spec_CXX='${wl}-E'
+	    whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive'
+	  fi
+	  output_verbose_link_cmd=func_echo_all
+	else
+	  ld_shlibs_CXX=no
+	fi
+	;;
+
+      osf3* | osf4* | osf5*)
+        case $cc_basename in
+          KCC*)
+	    # Kuck and Associates, Inc. (KAI) C++ Compiler
+
+	    # KCC will only create a shared library if the output file
+	    # ends with ".so" (or ".sl" for HP-UX), so rename the library
+	    # to its proper name (with version) after linking.
+	    archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib'
+
+	    hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir'
+	    hardcode_libdir_separator_CXX=:
+
+	    # Archives containing C++ object files must be created using
+	    # the KAI C++ compiler.
+	    case $host in
+	      osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;;
+	      *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;;
+	    esac
+	    ;;
+          RCC*)
+	    # Rational C++ 2.4.1
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          cxx*)
+	    case $host in
+	      osf3*)
+	        allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*'
+	        archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	        hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'
+		;;
+	      *)
+	        allow_undefined_flag_CXX=' -expect_unresolved \*'
+	        archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib'
+	        archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~
+	          echo "-hidden">> $lib.exp~
+	          $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp  `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~
+	          $RM $lib.exp'
+	        hardcode_libdir_flag_spec_CXX='-rpath $libdir'
+		;;
+	    esac
+
+	    hardcode_libdir_separator_CXX=:
+
+	    # Commands to make compiler produce verbose output that lists
+	    # what "hidden" libraries, object files and flags are used when
+	    # linking a shared library.
+	    #
+	    # There doesn't appear to be a way to prevent this compiler from
+	    # explicitly linking system object files so we need to strip them
+	    # from the output so that they don't get included in the library
+	    # dependencies.
+	    output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"'
+	    ;;
+	  *)
+	    if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+	      allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*'
+	      case $host in
+	        osf3*)
+	          archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+		  ;;
+	        *)
+	          archive_cmds_CXX='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib'
+		  ;;
+	      esac
+
+	      hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir'
+	      hardcode_libdir_separator_CXX=:
+
+	      # Commands to make compiler produce verbose output that lists
+	      # what "hidden" libraries, object files and flags are used when
+	      # linking a shared library.
+	      output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+
+	    else
+	      # FIXME: insert proper C++ library support
+	      ld_shlibs_CXX=no
+	    fi
+	    ;;
+        esac
+        ;;
+
+      psos*)
+        # FIXME: insert proper C++ library support
+        ld_shlibs_CXX=no
+        ;;
+
+      sunos4*)
+        case $cc_basename in
+          CC*)
+	    # Sun C++ 4.x
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          lcc*)
+	    # Lucid
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+        esac
+        ;;
+
+      solaris*)
+        case $cc_basename in
+          CC* | sunCC*)
+	    # Sun C++ 4.2, 5.x and Centerline C++
+            archive_cmds_need_lc_CXX=yes
+	    no_undefined_flag_CXX=' -zdefs'
+	    archive_cmds_CXX='$CC -G${allow_undefined_flag}  -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags'
+	    archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+	      $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	    hardcode_libdir_flag_spec_CXX='-R$libdir'
+	    hardcode_shlibpath_var_CXX=no
+	    case $host_os in
+	      solaris2.[0-5] | solaris2.[0-5].*) ;;
+	      *)
+		# The compiler driver will combine and reorder linker options,
+		# but understands `-z linker_flag'.
+	        # Supported since Solaris 2.6 (maybe 2.5.1?)
+		whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract'
+	        ;;
+	    esac
+	    link_all_deplibs_CXX=yes
+
+	    output_verbose_link_cmd='func_echo_all'
+
+	    # Archives containing C++ object files must be created using
+	    # "CC -xar", where "CC" is the Sun C++ compiler.  This is
+	    # necessary to make sure instantiated templates are included
+	    # in the archive.
+	    old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs'
+	    ;;
+          gcx*)
+	    # Green Hills C++ Compiler
+	    archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+
+	    # The C++ compiler must be used to create the archive.
+	    old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs'
+	    ;;
+          *)
+	    # GNU C++ compiler with Solaris linker
+	    if test "$GXX" = yes && test "$with_gnu_ld" = no; then
+	      no_undefined_flag_CXX=' ${wl}-z ${wl}defs'
+	      if $CC --version | $GREP -v '^2\.7' > /dev/null; then
+	        archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+	        archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+		  $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	        # Commands to make compiler produce verbose output that lists
+	        # what "hidden" libraries, object files and flags are used when
+	        # linking a shared library.
+	        output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+	      else
+	        # g++ 2.7 appears to require `-G' NOT `-shared' on this
+	        # platform.
+	        archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib'
+	        archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~
+		  $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp'
+
+	        # Commands to make compiler produce verbose output that lists
+	        # what "hidden" libraries, object files and flags are used when
+	        # linking a shared library.
+	        output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"'
+	      fi
+
+	      hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir'
+	      case $host_os in
+		solaris2.[0-5] | solaris2.[0-5].*) ;;
+		*)
+		  whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract'
+		  ;;
+	      esac
+	    fi
+	    ;;
+        esac
+        ;;
+
+    sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*)
+      no_undefined_flag_CXX='${wl}-z,text'
+      archive_cmds_need_lc_CXX=no
+      hardcode_shlibpath_var_CXX=no
+      runpath_var='LD_RUN_PATH'
+
+      case $cc_basename in
+        CC*)
+	  archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+	*)
+	  archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	  ;;
+      esac
+      ;;
+
+      sysv5* | sco3.2v5* | sco5v6*)
+	# Note: We can NOT use -z defs as we might desire, because we do not
+	# link with -lc, and that would cause any symbols used from libc to
+	# always be unresolved, which means just about no library would
+	# ever link correctly.  If we're not using GNU ld we use -z text
+	# though, which does catch some bad symbols but isn't as heavy-handed
+	# as -z defs.
+	no_undefined_flag_CXX='${wl}-z,text'
+	allow_undefined_flag_CXX='${wl}-z,nodefs'
+	archive_cmds_need_lc_CXX=no
+	hardcode_shlibpath_var_CXX=no
+	hardcode_libdir_flag_spec_CXX='${wl}-R,$libdir'
+	hardcode_libdir_separator_CXX=':'
+	link_all_deplibs_CXX=yes
+	export_dynamic_flag_spec_CXX='${wl}-Bexport'
+	runpath_var='LD_RUN_PATH'
+
+	case $cc_basename in
+          CC*)
+	    archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~
+	      '"$old_archive_cmds_CXX"
+	    reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~
+	      '"$reload_cmds_CXX"
+	    ;;
+	  *)
+	    archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags'
+	    ;;
+	esac
+      ;;
+
+      tandem*)
+        case $cc_basename in
+          NCC*)
+	    # NonStop-UX NCC 3.20
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+          *)
+	    # FIXME: insert proper C++ library support
+	    ld_shlibs_CXX=no
+	    ;;
+        esac
+        ;;
+
+      vxworks*)
+        # FIXME: insert proper C++ library support
+        ld_shlibs_CXX=no
+        ;;
+
+      *)
+        # FIXME: insert proper C++ library support
+        ld_shlibs_CXX=no
+        ;;
+    esac
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5
+$as_echo "$ld_shlibs_CXX" >&6; }
+    test "$ld_shlibs_CXX" = no && can_build_shared=no
+
+    GCC_CXX="$GXX"
+    LD_CXX="$LD"
+
+    ## CAVEAT EMPTOR:
+    ## There is no encapsulation within the following macros, do not change
+    ## the running order or otherwise move them around unless you know exactly
+    ## what you are doing...
+    # Dependencies to place before and after the object being linked:
+predep_objects_CXX=
+postdep_objects_CXX=
+predeps_CXX=
+postdeps_CXX=
+compiler_lib_search_path_CXX=
+
+cat > conftest.$ac_ext <<_LT_EOF
+class Foo
+{
+public:
+  Foo (void) { a = 0; }
+private:
+  int a;
+};
+_LT_EOF
+
+
+_lt_libdeps_save_CFLAGS=$CFLAGS
+case "$CC $CFLAGS " in #(
+*\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;;
+*\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;;
+*\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;;
+esac
+
+if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  # Parse the compiler output and extract the necessary
+  # objects, libraries and library flags.
+
+  # Sentinel used to keep track of whether or not we are before
+  # the conftest object file.
+  pre_test_object_deps_done=no
+
+  for p in `eval "$output_verbose_link_cmd"`; do
+    case ${prev}${p} in
+
+    -L* | -R* | -l*)
+       # Some compilers place space between "-{L,R}" and the path.
+       # Remove the space.
+       if test $p = "-L" ||
+          test $p = "-R"; then
+	 prev=$p
+	 continue
+       fi
+
+       # Expand the sysroot to ease extracting the directories later.
+       if test -z "$prev"; then
+         case $p in
+         -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;;
+         -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;;
+         -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;;
+         esac
+       fi
+       case $p in
+       =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;;
+       esac
+       if test "$pre_test_object_deps_done" = no; then
+	 case ${prev} in
+	 -L | -R)
+	   # Internal compiler library paths should come after those
+	   # provided the user.  The postdeps already come after the
+	   # user supplied libs so there is no need to process them.
+	   if test -z "$compiler_lib_search_path_CXX"; then
+	     compiler_lib_search_path_CXX="${prev}${p}"
+	   else
+	     compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}"
+	   fi
+	   ;;
+	 # The "-l" case would never come before the object being
+	 # linked, so don't bother handling this case.
+	 esac
+       else
+	 if test -z "$postdeps_CXX"; then
+	   postdeps_CXX="${prev}${p}"
+	 else
+	   postdeps_CXX="${postdeps_CXX} ${prev}${p}"
+	 fi
+       fi
+       prev=
+       ;;
+
+    *.lto.$objext) ;; # Ignore GCC LTO objects
+    *.$objext)
+       # This assumes that the test object file only shows up
+       # once in the compiler output.
+       if test "$p" = "conftest.$objext"; then
+	 pre_test_object_deps_done=yes
+	 continue
+       fi
+
+       if test "$pre_test_object_deps_done" = no; then
+	 if test -z "$predep_objects_CXX"; then
+	   predep_objects_CXX="$p"
+	 else
+	   predep_objects_CXX="$predep_objects_CXX $p"
+	 fi
+       else
+	 if test -z "$postdep_objects_CXX"; then
+	   postdep_objects_CXX="$p"
+	 else
+	   postdep_objects_CXX="$postdep_objects_CXX $p"
+	 fi
+       fi
+       ;;
+
+    *) ;; # Ignore the rest.
+
+    esac
+  done
+
+  # Clean up.
+  rm -f a.out a.exe
+else
+  echo "libtool.m4: error: problem compiling CXX test program"
+fi
+
+$RM -f confest.$objext
+CFLAGS=$_lt_libdeps_save_CFLAGS
+
+# PORTME: override above test on systems where it is broken
+case $host_os in
+interix[3-9]*)
+  # Interix 3.5 installs completely hosed .la files for C++, so rather than
+  # hack all around it, let's just trust "g++" to DTRT.
+  predep_objects_CXX=
+  postdep_objects_CXX=
+  postdeps_CXX=
+  ;;
+
+linux*)
+  case `$CC -V 2>&1 | sed 5q` in
+  *Sun\ C*)
+    # Sun C++ 5.9
+
+    # The more standards-conforming stlport4 library is
+    # incompatible with the Cstd library. Avoid specifying
+    # it if it's in CXXFLAGS. Ignore libCrun as
+    # -library=stlport4 depends on it.
+    case " $CXX $CXXFLAGS " in
+    *" -library=stlport4 "*)
+      solaris_use_stlport4=yes
+      ;;
+    esac
+
+    if test "$solaris_use_stlport4" != yes; then
+      postdeps_CXX='-library=Cstd -library=Crun'
+    fi
+    ;;
+  esac
+  ;;
+
+solaris*)
+  case $cc_basename in
+  CC* | sunCC*)
+    # The more standards-conforming stlport4 library is
+    # incompatible with the Cstd library. Avoid specifying
+    # it if it's in CXXFLAGS. Ignore libCrun as
+    # -library=stlport4 depends on it.
+    case " $CXX $CXXFLAGS " in
+    *" -library=stlport4 "*)
+      solaris_use_stlport4=yes
+      ;;
+    esac
+
+    # Adding this requires a known-good setup of shared libraries for
+    # Sun compiler versions before 5.6, else PIC objects from an old
+    # archive will be linked into the output, leading to subtle bugs.
+    if test "$solaris_use_stlport4" != yes; then
+      postdeps_CXX='-library=Cstd -library=Crun'
+    fi
+    ;;
+  esac
+  ;;
+esac
+
+
+case " $postdeps_CXX " in
+*" -lc "*) archive_cmds_need_lc_CXX=no ;;
+esac
+ compiler_lib_search_dirs_CXX=
+if test -n "${compiler_lib_search_path_CXX}"; then
+ compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | ${SED} -e 's! -L! !g' -e 's!^ !!'`
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+    lt_prog_compiler_wl_CXX=
+lt_prog_compiler_pic_CXX=
+lt_prog_compiler_static_CXX=
+
+
+  # C++ specific cases for pic, static, wl, etc.
+  if test "$GXX" = yes; then
+    lt_prog_compiler_wl_CXX='-Wl,'
+    lt_prog_compiler_static_CXX='-static'
+
+    case $host_os in
+    aix*)
+      # All AIX code is PIC.
+      if test "$host_cpu" = ia64; then
+	# AIX 5 now supports IA64 processor
+	lt_prog_compiler_static_CXX='-Bstatic'
+      fi
+      ;;
+
+    amigaos*)
+      case $host_cpu in
+      powerpc)
+            # see comment about AmigaOS4 .so support
+            lt_prog_compiler_pic_CXX='-fPIC'
+        ;;
+      m68k)
+            # FIXME: we need at least 68020 code to build shared libraries, but
+            # adding the `-m68020' flag to GCC prevents building anything better,
+            # like `-m68040'.
+            lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4'
+        ;;
+      esac
+      ;;
+
+    beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*)
+      # PIC is the default for these OSes.
+      ;;
+    mingw* | cygwin* | os2* | pw32* | cegcc*)
+      # This hack is so that the source file can tell whether it is being
+      # built for inclusion in a dll (and should export symbols for example).
+      # Although the cygwin gcc ignores -fPIC, still need this for old-style
+      # (--disable-auto-import) libraries
+      lt_prog_compiler_pic_CXX='-DDLL_EXPORT'
+      ;;
+    darwin* | rhapsody*)
+      # PIC is the default on this platform
+      # Common symbols not allowed in MH_DYLIB files
+      lt_prog_compiler_pic_CXX='-fno-common'
+      ;;
+    *djgpp*)
+      # DJGPP does not support shared libraries at all
+      lt_prog_compiler_pic_CXX=
+      ;;
+    haiku*)
+      # PIC is the default for Haiku.
+      # The "-static" flag exists, but is broken.
+      lt_prog_compiler_static_CXX=
+      ;;
+    interix[3-9]*)
+      # Interix 3.x gcc -fpic/-fPIC options generate broken code.
+      # Instead, we relocate shared libraries at runtime.
+      ;;
+    sysv4*MP*)
+      if test -d /usr/nec; then
+	lt_prog_compiler_pic_CXX=-Kconform_pic
+      fi
+      ;;
+    hpux*)
+      # PIC is the default for 64-bit PA HP-UX, but not for 32-bit
+      # PA HP-UX.  On IA64 HP-UX, PIC is the default but the pic flag
+      # sets the default TLS model and affects inlining.
+      case $host_cpu in
+      hppa*64*)
+	;;
+      *)
+	lt_prog_compiler_pic_CXX='-fPIC'
+	;;
+      esac
+      ;;
+    *qnx* | *nto*)
+      # QNX uses GNU C++, but need to define -shared option too, otherwise
+      # it will coredump.
+      lt_prog_compiler_pic_CXX='-fPIC -shared'
+      ;;
+    *)
+      lt_prog_compiler_pic_CXX='-fPIC'
+      ;;
+    esac
+  else
+    case $host_os in
+      aix[4-9]*)
+	# All AIX code is PIC.
+	if test "$host_cpu" = ia64; then
+	  # AIX 5 now supports IA64 processor
+	  lt_prog_compiler_static_CXX='-Bstatic'
+	else
+	  lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp'
+	fi
+	;;
+      chorus*)
+	case $cc_basename in
+	cxch68*)
+	  # Green Hills C++ Compiler
+	  # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a"
+	  ;;
+	esac
+	;;
+      mingw* | cygwin* | os2* | pw32* | cegcc*)
+	# This hack is so that the source file can tell whether it is being
+	# built for inclusion in a dll (and should export symbols for example).
+	lt_prog_compiler_pic_CXX='-DDLL_EXPORT'
+	;;
+      dgux*)
+	case $cc_basename in
+	  ec++*)
+	    lt_prog_compiler_pic_CXX='-KPIC'
+	    ;;
+	  ghcx*)
+	    # Green Hills C++ Compiler
+	    lt_prog_compiler_pic_CXX='-pic'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      freebsd* | dragonfly*)
+	# FreeBSD uses GNU C++
+	;;
+      hpux9* | hpux10* | hpux11*)
+	case $cc_basename in
+	  CC*)
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_static_CXX='${wl}-a ${wl}archive'
+	    if test "$host_cpu" != ia64; then
+	      lt_prog_compiler_pic_CXX='+Z'
+	    fi
+	    ;;
+	  aCC*)
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_static_CXX='${wl}-a ${wl}archive'
+	    case $host_cpu in
+	    hppa*64*|ia64*)
+	      # +Z the default
+	      ;;
+	    *)
+	      lt_prog_compiler_pic_CXX='+Z'
+	      ;;
+	    esac
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      interix*)
+	# This is c89, which is MS Visual C++ (no shared libs)
+	# Anyone wants to do a port?
+	;;
+      irix5* | irix6* | nonstopux*)
+	case $cc_basename in
+	  CC*)
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_static_CXX='-non_shared'
+	    # CC pic flag -KPIC is the default.
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      linux* | k*bsd*-gnu | kopensolaris*-gnu)
+	case $cc_basename in
+	  KCC*)
+	    # KAI C++ Compiler
+	    lt_prog_compiler_wl_CXX='--backend -Wl,'
+	    lt_prog_compiler_pic_CXX='-fPIC'
+	    ;;
+	  ecpc* )
+	    # old Intel C++ for x86_64 which still supported -KPIC.
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_pic_CXX='-KPIC'
+	    lt_prog_compiler_static_CXX='-static'
+	    ;;
+	  icpc* )
+	    # Intel C++, used to be incompatible with GCC.
+	    # ICC 10 doesn't accept -KPIC any more.
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_pic_CXX='-fPIC'
+	    lt_prog_compiler_static_CXX='-static'
+	    ;;
+	  pgCC* | pgcpp*)
+	    # Portland Group C++ compiler
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_pic_CXX='-fpic'
+	    lt_prog_compiler_static_CXX='-Bstatic'
+	    ;;
+	  cxx*)
+	    # Compaq C++
+	    # Make sure the PIC flag is empty.  It appears that all Alpha
+	    # Linux and Compaq Tru64 Unix objects are PIC.
+	    lt_prog_compiler_pic_CXX=
+	    lt_prog_compiler_static_CXX='-non_shared'
+	    ;;
+	  xlc* | xlC* | bgxl[cC]* | mpixl[cC]*)
+	    # IBM XL 8.0, 9.0 on PPC and BlueGene
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_pic_CXX='-qpic'
+	    lt_prog_compiler_static_CXX='-qstaticlink'
+	    ;;
+	  *)
+	    case `$CC -V 2>&1 | sed 5q` in
+	    *Sun\ C*)
+	      # Sun C++ 5.9
+	      lt_prog_compiler_pic_CXX='-KPIC'
+	      lt_prog_compiler_static_CXX='-Bstatic'
+	      lt_prog_compiler_wl_CXX='-Qoption ld '
+	      ;;
+	    esac
+	    ;;
+	esac
+	;;
+      lynxos*)
+	;;
+      m88k*)
+	;;
+      mvs*)
+	case $cc_basename in
+	  cxx*)
+	    lt_prog_compiler_pic_CXX='-W c,exportall'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      netbsd* | netbsdelf*-gnu)
+	;;
+      *qnx* | *nto*)
+        # QNX uses GNU C++, but need to define -shared option too, otherwise
+        # it will coredump.
+        lt_prog_compiler_pic_CXX='-fPIC -shared'
+        ;;
+      osf3* | osf4* | osf5*)
+	case $cc_basename in
+	  KCC*)
+	    lt_prog_compiler_wl_CXX='--backend -Wl,'
+	    ;;
+	  RCC*)
+	    # Rational C++ 2.4.1
+	    lt_prog_compiler_pic_CXX='-pic'
+	    ;;
+	  cxx*)
+	    # Digital/Compaq C++
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    # Make sure the PIC flag is empty.  It appears that all Alpha
+	    # Linux and Compaq Tru64 Unix objects are PIC.
+	    lt_prog_compiler_pic_CXX=
+	    lt_prog_compiler_static_CXX='-non_shared'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      psos*)
+	;;
+      solaris*)
+	case $cc_basename in
+	  CC* | sunCC*)
+	    # Sun C++ 4.2, 5.x and Centerline C++
+	    lt_prog_compiler_pic_CXX='-KPIC'
+	    lt_prog_compiler_static_CXX='-Bstatic'
+	    lt_prog_compiler_wl_CXX='-Qoption ld '
+	    ;;
+	  gcx*)
+	    # Green Hills C++ Compiler
+	    lt_prog_compiler_pic_CXX='-PIC'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      sunos4*)
+	case $cc_basename in
+	  CC*)
+	    # Sun C++ 4.x
+	    lt_prog_compiler_pic_CXX='-pic'
+	    lt_prog_compiler_static_CXX='-Bstatic'
+	    ;;
+	  lcc*)
+	    # Lucid
+	    lt_prog_compiler_pic_CXX='-pic'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*)
+	case $cc_basename in
+	  CC*)
+	    lt_prog_compiler_wl_CXX='-Wl,'
+	    lt_prog_compiler_pic_CXX='-KPIC'
+	    lt_prog_compiler_static_CXX='-Bstatic'
+	    ;;
+	esac
+	;;
+      tandem*)
+	case $cc_basename in
+	  NCC*)
+	    # NonStop-UX NCC 3.20
+	    lt_prog_compiler_pic_CXX='-KPIC'
+	    ;;
+	  *)
+	    ;;
+	esac
+	;;
+      vxworks*)
+	;;
+      *)
+	lt_prog_compiler_can_build_shared_CXX=no
+	;;
+    esac
+  fi
+
+case $host_os in
+  # For platforms which do not support PIC, -DPIC is meaningless:
+  *djgpp*)
+    lt_prog_compiler_pic_CXX=
+    ;;
+  *)
+    lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC"
+    ;;
+esac
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5
+$as_echo_n "checking for $compiler option to produce PIC... " >&6; }
+if ${lt_cv_prog_compiler_pic_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX" >&5
+$as_echo "$lt_cv_prog_compiler_pic_CXX" >&6; }
+lt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX
+
+#
+# Check to make sure the PIC flag actually works.
+#
+if test -n "$lt_prog_compiler_pic_CXX"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5
+$as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; }
+if ${lt_cv_prog_compiler_pic_works_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_pic_works_CXX=no
+   ac_outfile=conftest.$ac_objext
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+   lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   # The option is referenced via a variable to avoid confusing sed.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>conftest.err)
+   ac_status=$?
+   cat conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s "$ac_outfile"; then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings other than the usual output.
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp
+     $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+     if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_pic_works_CXX=yes
+     fi
+   fi
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5
+$as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; }
+
+if test x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; then
+    case $lt_prog_compiler_pic_CXX in
+     "" | " "*) ;;
+     *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;;
+     esac
+else
+    lt_prog_compiler_pic_CXX=
+     lt_prog_compiler_can_build_shared_CXX=no
+fi
+
+fi
+
+
+
+
+
+#
+# Check to make sure the static flag actually works.
+#
+wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5
+$as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; }
+if ${lt_cv_prog_compiler_static_works_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_static_works_CXX=no
+   save_LDFLAGS="$LDFLAGS"
+   LDFLAGS="$LDFLAGS $lt_tmp_static_flag"
+   echo "$lt_simple_link_test_code" > conftest.$ac_ext
+   if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then
+     # The linker can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     if test -s conftest.err; then
+       # Append any errors to the config.log.
+       cat conftest.err 1>&5
+       $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp
+       $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2
+       if diff conftest.exp conftest.er2 >/dev/null; then
+         lt_cv_prog_compiler_static_works_CXX=yes
+       fi
+     else
+       lt_cv_prog_compiler_static_works_CXX=yes
+     fi
+   fi
+   $RM -r conftest*
+   LDFLAGS="$save_LDFLAGS"
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5
+$as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; }
+
+if test x"$lt_cv_prog_compiler_static_works_CXX" = xyes; then
+    :
+else
+    lt_prog_compiler_static_CXX=
+fi
+
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5
+$as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; }
+if ${lt_cv_prog_compiler_c_o_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_c_o_CXX=no
+   $RM -r conftest 2>/dev/null
+   mkdir conftest
+   cd conftest
+   mkdir out
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+   lt_compiler_flag="-o out/conftest2.$ac_objext"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>out/conftest.err)
+   ac_status=$?
+   cat out/conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s out/conftest2.$ac_objext
+   then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp
+     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2
+     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_c_o_CXX=yes
+     fi
+   fi
+   chmod u+w . 2>&5
+   $RM conftest*
+   # SGI C++ compiler will create directory out/ii_files/ for
+   # template instantiation
+   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files
+   $RM out/* && rmdir out
+   cd ..
+   $RM -r conftest
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5
+$as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; }
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5
+$as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; }
+if ${lt_cv_prog_compiler_c_o_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_prog_compiler_c_o_CXX=no
+   $RM -r conftest 2>/dev/null
+   mkdir conftest
+   cd conftest
+   mkdir out
+   echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+   lt_compiler_flag="-o out/conftest2.$ac_objext"
+   # Insert the option either (1) after the last *FLAGS variable, or
+   # (2) before a word containing "conftest.", or (3) at the end.
+   # Note that $ac_compile itself does not contain backslashes and begins
+   # with a dollar sign (not a hyphen), so the echo should work correctly.
+   lt_compile=`echo "$ac_compile" | $SED \
+   -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
+   -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
+   -e 's:$: $lt_compiler_flag:'`
+   (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5)
+   (eval "$lt_compile" 2>out/conftest.err)
+   ac_status=$?
+   cat out/conftest.err >&5
+   echo "$as_me:$LINENO: \$? = $ac_status" >&5
+   if (exit $ac_status) && test -s out/conftest2.$ac_objext
+   then
+     # The compiler can only warn and ignore the option if not recognized
+     # So say no if there are warnings
+     $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp
+     $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2
+     if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then
+       lt_cv_prog_compiler_c_o_CXX=yes
+     fi
+   fi
+   chmod u+w . 2>&5
+   $RM conftest*
+   # SGI C++ compiler will create directory out/ii_files/ for
+   # template instantiation
+   test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files
+   $RM out/* && rmdir out
+   cd ..
+   $RM -r conftest
+   $RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5
+$as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; }
+
+
+
+
+hard_links="nottested"
+if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then
+  # do not overwrite the value of need_locks provided by the user
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5
+$as_echo_n "checking if we can lock with hard links... " >&6; }
+  hard_links=yes
+  $RM conftest*
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  touch conftest.a
+  ln conftest.a conftest.b 2>&5 || hard_links=no
+  ln conftest.a conftest.b 2>/dev/null && hard_links=no
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5
+$as_echo "$hard_links" >&6; }
+  if test "$hard_links" = no; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5
+$as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;}
+    need_locks=warn
+  fi
+else
+  need_locks=no
+fi
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5
+$as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; }
+
+  export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+  exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'
+  case $host_os in
+  aix[4-9]*)
+    # If we're using GNU nm, then we don't want the "-C" option.
+    # -C means demangle to AIX nm, but means don't demangle with GNU nm
+    # Also, AIX nm treats weak defined symbols like other global defined
+    # symbols, whereas GNU nm marks them as "W".
+    if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then
+      export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+    else
+      export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols'
+    fi
+    ;;
+  pw32*)
+    export_symbols_cmds_CXX="$ltdll_cmds"
+    ;;
+  cygwin* | mingw* | cegcc*)
+    case $cc_basename in
+    cl*)
+      exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*'
+      ;;
+    *)
+      export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols'
+      exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'
+      ;;
+    esac
+    ;;
+  linux* | k*bsd*-gnu | gnu*)
+    link_all_deplibs_CXX=no
+    ;;
+  *)
+    export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols'
+    ;;
+  esac
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5
+$as_echo "$ld_shlibs_CXX" >&6; }
+test "$ld_shlibs_CXX" = no && can_build_shared=no
+
+with_gnu_ld_CXX=$with_gnu_ld
+
+
+
+
+
+
+#
+# Do we need to explicitly link libc?
+#
+case "x$archive_cmds_need_lc_CXX" in
+x|xyes)
+  # Assume -lc should be added
+  archive_cmds_need_lc_CXX=yes
+
+  if test "$enable_shared" = yes && test "$GCC" = yes; then
+    case $archive_cmds_CXX in
+    *'~'*)
+      # FIXME: we may have to deal with multi-command sequences.
+      ;;
+    '$CC '*)
+      # Test whether the compiler implicitly links with -lc since on some
+      # systems, -lgcc has to come before -lc. If gcc already passes -lc
+      # to ld, don't add -lc before -lgcc.
+      { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5
+$as_echo_n "checking whether -lc should be explicitly linked in... " >&6; }
+if ${lt_cv_archive_cmds_need_lc_CXX+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  $RM conftest*
+	echo "$lt_simple_compile_test_code" > conftest.$ac_ext
+
+	if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5
+  (eval $ac_compile) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; } 2>conftest.err; then
+	  soname=conftest
+	  lib=conftest
+	  libobjs=conftest.$ac_objext
+	  deplibs=
+	  wl=$lt_prog_compiler_wl_CXX
+	  pic_flag=$lt_prog_compiler_pic_CXX
+	  compiler_flags=-v
+	  linker_flags=-v
+	  verstring=
+	  output_objdir=.
+	  libname=conftest
+	  lt_save_allow_undefined_flag=$allow_undefined_flag_CXX
+	  allow_undefined_flag_CXX=
+	  if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5
+  (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }
+	  then
+	    lt_cv_archive_cmds_need_lc_CXX=no
+	  else
+	    lt_cv_archive_cmds_need_lc_CXX=yes
+	  fi
+	  allow_undefined_flag_CXX=$lt_save_allow_undefined_flag
+	else
+	  cat conftest.err 1>&5
+	fi
+	$RM conftest*
+
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX" >&5
+$as_echo "$lt_cv_archive_cmds_need_lc_CXX" >&6; }
+      archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX
+      ;;
+    esac
+  fi
+  ;;
+esac
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5
+$as_echo_n "checking dynamic linker characteristics... " >&6; }
+
+library_names_spec=
+libname_spec='lib$name'
+soname_spec=
+shrext_cmds=".so"
+postinstall_cmds=
+postuninstall_cmds=
+finish_cmds=
+finish_eval=
+shlibpath_var=
+shlibpath_overrides_runpath=unknown
+version_type=none
+dynamic_linker="$host_os ld.so"
+sys_lib_dlsearch_path_spec="/lib /usr/lib"
+need_lib_prefix=unknown
+hardcode_into_libs=no
+
+# when you set need_version to no, make sure it does not cause -set_version
+# flags to be left without arguments
+need_version=unknown
+
+case $host_os in
+aix3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a'
+  shlibpath_var=LIBPATH
+
+  # AIX 3 has no versioning support, so we append a major version to the name.
+  soname_spec='${libname}${release}${shared_ext}$major'
+  ;;
+
+aix[4-9]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  hardcode_into_libs=yes
+  if test "$host_cpu" = ia64; then
+    # AIX 5 supports IA64
+    library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}'
+    shlibpath_var=LD_LIBRARY_PATH
+  else
+    # With GCC up to 2.95.x, collect2 would create an import file
+    # for dependence libraries.  The import file would start with
+    # the line `#! .'.  This would cause the generated library to
+    # depend on `.', always an invalid library.  This was fixed in
+    # development snapshots of GCC prior to 3.0.
+    case $host_os in
+      aix4 | aix4.[01] | aix4.[01].*)
+      if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)'
+	   echo ' yes '
+	   echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then
+	:
+      else
+	can_build_shared=no
+      fi
+      ;;
+    esac
+    # AIX (on Power*) has no versioning support, so currently we can not hardcode correct
+    # soname into executable. Probably we can add versioning support to
+    # collect2, so additional links can be useful in future.
+    if test "$aix_use_runtimelinking" = yes; then
+      # If using run time linking (on AIX 4.2 or later) use lib<name>.so
+      # instead of lib<name>.a to let people know that these are not
+      # typical AIX shared libraries.
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    else
+      # We preserve .a as extension for shared libraries through AIX4.2
+      # and later when we are not doing run time linking.
+      library_names_spec='${libname}${release}.a $libname.a'
+      soname_spec='${libname}${release}${shared_ext}$major'
+    fi
+    shlibpath_var=LIBPATH
+  fi
+  ;;
+
+amigaos*)
+  case $host_cpu in
+  powerpc)
+    # Since July 2007 AmigaOS4 officially supports .so libraries.
+    # When compiling the executable, add -use-dynld -Lsobjs: to the compileline.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    ;;
+  m68k)
+    library_names_spec='$libname.ixlibrary $libname.a'
+    # Create ${libname}_ixlibrary.a entries in /sys/libs.
+    finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done'
+    ;;
+  esac
+  ;;
+
+beos*)
+  library_names_spec='${libname}${shared_ext}'
+  dynamic_linker="$host_os ld.so"
+  shlibpath_var=LIBRARY_PATH
+  ;;
+
+bsdi[45]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib"
+  sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib"
+  # the default ld.so.conf also contains /usr/contrib/lib and
+  # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow
+  # libtool to hard-code these into programs
+  ;;
+
+cygwin* | mingw* | pw32* | cegcc*)
+  version_type=windows
+  shrext_cmds=".dll"
+  need_version=no
+  need_lib_prefix=no
+
+  case $GCC,$cc_basename in
+  yes,*)
+    # gcc
+    library_names_spec='$libname.dll.a'
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname~
+      chmod a+x \$dldir/$dlname~
+      if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then
+        eval '\''$striplib \$dldir/$dlname'\'' || exit \$?;
+      fi'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+
+    case $host_os in
+    cygwin*)
+      # Cygwin DLLs use 'cyg' prefix rather than 'lib'
+      soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+
+      ;;
+    mingw* | cegcc*)
+      # MinGW DLLs use traditional 'lib' prefix
+      soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    pw32*)
+      # pw32 DLLs use 'pw' prefix rather than 'lib'
+      library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+      ;;
+    esac
+    dynamic_linker='Win32 ld.exe'
+    ;;
+
+  *,cl*)
+    # Native MSVC
+    libname_spec='$name'
+    soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
+    library_names_spec='${libname}.dll.lib'
+
+    case $build_os in
+    mingw*)
+      sys_lib_search_path_spec=
+      lt_save_ifs=$IFS
+      IFS=';'
+      for lt_path in $LIB
+      do
+        IFS=$lt_save_ifs
+        # Let DOS variable expansion print the short 8.3 style file name.
+        lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"`
+        sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path"
+      done
+      IFS=$lt_save_ifs
+      # Convert to MSYS style.
+      sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'`
+      ;;
+    cygwin*)
+      # Convert to unix form, then to dos form, then back to unix form
+      # but this time dos style (no spaces!) so that the unix form looks
+      # like /cygdrive/c/PROGRA~1:/cygdr...
+      sys_lib_search_path_spec=`cygpath --path --unix "$LIB"`
+      sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null`
+      sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      ;;
+    *)
+      sys_lib_search_path_spec="$LIB"
+      if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then
+        # It is most probably a Windows format PATH.
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'`
+      else
+        sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"`
+      fi
+      # FIXME: find the short name or the path components, as spaces are
+      # common. (e.g. "Program Files" -> "PROGRA~1")
+      ;;
+    esac
+
+    # DLL is installed to $(libdir)/../bin by postinstall_cmds
+    postinstall_cmds='base_file=`basename \${file}`~
+      dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~
+      dldir=$destdir/`dirname \$dlpath`~
+      test -d \$dldir || mkdir -p \$dldir~
+      $install_prog $dir/$dlname \$dldir/$dlname'
+    postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~
+      dlpath=$dir/\$dldll~
+       $RM \$dlpath'
+    shlibpath_overrides_runpath=yes
+    dynamic_linker='Win32 link.exe'
+    ;;
+
+  *)
+    # Assume MSVC wrapper
+    library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib'
+    dynamic_linker='Win32 ld.exe'
+    ;;
+  esac
+  # FIXME: first we should search . and the directory the executable is in
+  shlibpath_var=PATH
+  ;;
+
+darwin* | rhapsody*)
+  dynamic_linker="$host_os dyld"
+  version_type=darwin
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext'
+  soname_spec='${libname}${release}${major}$shared_ext'
+  shlibpath_overrides_runpath=yes
+  shlibpath_var=DYLD_LIBRARY_PATH
+  shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`'
+
+  sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib'
+  ;;
+
+dgux*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+freebsd* | dragonfly*)
+  # DragonFly does not have aout.  When/if they implement a new
+  # versioning mechanism, adjust this.
+  if test -x /usr/bin/objformat; then
+    objformat=`/usr/bin/objformat`
+  else
+    case $host_os in
+    freebsd[23].*) objformat=aout ;;
+    *) objformat=elf ;;
+    esac
+  fi
+  version_type=freebsd-$objformat
+  case $version_type in
+    freebsd-elf*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+      need_version=no
+      need_lib_prefix=no
+      ;;
+    freebsd-*)
+      library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix'
+      need_version=yes
+      ;;
+  esac
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_os in
+  freebsd2.*)
+    shlibpath_overrides_runpath=yes
+    ;;
+  freebsd3.[01]* | freebsdelf3.[01]*)
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  freebsd3.[2-9]* | freebsdelf3.[2-9]* | \
+  freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1)
+    shlibpath_overrides_runpath=no
+    hardcode_into_libs=yes
+    ;;
+  *) # from 4.6 on, and DragonFly
+    shlibpath_overrides_runpath=yes
+    hardcode_into_libs=yes
+    ;;
+  esac
+  ;;
+
+gnu*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+haiku*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  dynamic_linker="$host_os runtime_loader"
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib'
+  hardcode_into_libs=yes
+  ;;
+
+hpux9* | hpux10* | hpux11*)
+  # Give a soname corresponding to the major version so that dld.sl refuses to
+  # link against other versions.
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  case $host_cpu in
+  ia64*)
+    shrext_cmds='.so'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.so"
+    shlibpath_var=LD_LIBRARY_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    if test "X$HPUX_IA64_MODE" = X32; then
+      sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib"
+    else
+      sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64"
+    fi
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  hppa*64*)
+    shrext_cmds='.sl'
+    hardcode_into_libs=yes
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH
+    shlibpath_overrides_runpath=yes # Unless +noenvvar is specified.
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64"
+    sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec
+    ;;
+  *)
+    shrext_cmds='.sl'
+    dynamic_linker="$host_os dld.sl"
+    shlibpath_var=SHLIB_PATH
+    shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    ;;
+  esac
+  # HP-UX runs *really* slowly unless shared libraries are mode 555, ...
+  postinstall_cmds='chmod 555 $lib'
+  # or fails outright, so override atomically:
+  install_override_mode=555
+  ;;
+
+interix[3-9]*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+irix5* | irix6* | nonstopux*)
+  case $host_os in
+    nonstopux*) version_type=nonstopux ;;
+    *)
+	if test "$lt_cv_prog_gnu_ld" = yes; then
+		version_type=linux # correct to gnu/linux during the next big refactor
+	else
+		version_type=irix
+	fi ;;
+  esac
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}'
+  case $host_os in
+  irix5* | nonstopux*)
+    libsuff= shlibsuff=
+    ;;
+  *)
+    case $LD in # libtool.m4 will add one of these switches to LD
+    *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ")
+      libsuff= shlibsuff= libmagic=32-bit;;
+    *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ")
+      libsuff=32 shlibsuff=N32 libmagic=N32;;
+    *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ")
+      libsuff=64 shlibsuff=64 libmagic=64-bit;;
+    *) libsuff= shlibsuff= libmagic=never-match;;
+    esac
+    ;;
+  esac
+  shlibpath_var=LD_LIBRARY${shlibsuff}_PATH
+  shlibpath_overrides_runpath=no
+  sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}"
+  sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}"
+  hardcode_into_libs=yes
+  ;;
+
+# No shared lib support for Linux oldld, aout, or coff.
+linux*oldld* | linux*aout* | linux*coff*)
+  dynamic_linker=no
+  ;;
+
+# This must be glibc/ELF.
+linux* | k*bsd*-gnu | kopensolaris*-gnu)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+
+  # Some binutils ld are patched to set DT_RUNPATH
+  if ${lt_cv_shlibpath_overrides_runpath+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  lt_cv_shlibpath_overrides_runpath=no
+    save_LDFLAGS=$LDFLAGS
+    save_libdir=$libdir
+    eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \
+	 LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\""
+    cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  if  ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then :
+  lt_cv_shlibpath_overrides_runpath=yes
+fi
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+    LDFLAGS=$save_LDFLAGS
+    libdir=$save_libdir
+
+fi
+
+  shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath
+
+  # This implies no fast_install, which is unacceptable.
+  # Some rework will be needed to allow for fast_install
+  # before this can be enabled.
+  hardcode_into_libs=yes
+
+  # Append ld.so.conf contents to the search path
+  if test -f /etc/ld.so.conf; then
+    lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[	 ]*hwcap[	 ]/d;s/[:,	]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '`
+    sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra"
+  fi
+
+  # We used to test for /lib/ld.so.1 and disable shared libraries on
+  # powerpc, because MkLinux only supported shared libraries with the
+  # GNU dynamic linker.  Since this was broken with cross compilers,
+  # most powerpc-linux boxes support dynamic linking these days and
+  # people can always --disable-shared, the test was removed, and we
+  # assume the GNU/Linux dynamic linker is in use.
+  dynamic_linker='GNU/Linux ld.so'
+  ;;
+
+netbsdelf*-gnu)
+  version_type=linux
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='NetBSD ld.elf_so'
+  ;;
+
+netbsd*)
+  version_type=sunos
+  need_lib_prefix=no
+  need_version=no
+  if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+    finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+    dynamic_linker='NetBSD (a.out) ld.so'
+  else
+    library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}'
+    soname_spec='${libname}${release}${shared_ext}$major'
+    dynamic_linker='NetBSD ld.elf_so'
+  fi
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  ;;
+
+newsos6)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  ;;
+
+*nto* | *qnx*)
+  version_type=qnx
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  dynamic_linker='ldqnx.so'
+  ;;
+
+openbsd*)
+  version_type=sunos
+  sys_lib_dlsearch_path_spec="/usr/lib"
+  need_lib_prefix=no
+  # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs.
+  case $host_os in
+    openbsd3.3 | openbsd3.3.*)	need_version=yes ;;
+    *)				need_version=no  ;;
+  esac
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then
+    case $host_os in
+      openbsd2.[89] | openbsd2.[89].*)
+	shlibpath_overrides_runpath=no
+	;;
+      *)
+	shlibpath_overrides_runpath=yes
+	;;
+      esac
+  else
+    shlibpath_overrides_runpath=yes
+  fi
+  ;;
+
+os2*)
+  libname_spec='$name'
+  shrext_cmds=".dll"
+  need_lib_prefix=no
+  library_names_spec='$libname${shared_ext} $libname.a'
+  dynamic_linker='OS/2 ld.exe'
+  shlibpath_var=LIBPATH
+  ;;
+
+osf3* | osf4* | osf5*)
+  version_type=osf
+  need_lib_prefix=no
+  need_version=no
+  soname_spec='${libname}${release}${shared_ext}$major'
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib"
+  sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec"
+  ;;
+
+rdos*)
+  dynamic_linker=no
+  ;;
+
+solaris*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  # ldd complains unless libraries are executable
+  postinstall_cmds='chmod +x $lib'
+  ;;
+
+sunos4*)
+  version_type=sunos
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix'
+  finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  if test "$with_gnu_ld" = yes; then
+    need_lib_prefix=no
+  fi
+  need_version=yes
+  ;;
+
+sysv4 | sysv4.3*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  case $host_vendor in
+    sni)
+      shlibpath_overrides_runpath=no
+      need_lib_prefix=no
+      runpath_var=LD_RUN_PATH
+      ;;
+    siemens)
+      need_lib_prefix=no
+      ;;
+    motorola)
+      need_lib_prefix=no
+      need_version=no
+      shlibpath_overrides_runpath=no
+      sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib'
+      ;;
+  esac
+  ;;
+
+sysv4*MP*)
+  if test -d /usr/nec ;then
+    version_type=linux # correct to gnu/linux during the next big refactor
+    library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}'
+    soname_spec='$libname${shared_ext}.$major'
+    shlibpath_var=LD_LIBRARY_PATH
+  fi
+  ;;
+
+sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*)
+  version_type=freebsd-elf
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=yes
+  hardcode_into_libs=yes
+  if test "$with_gnu_ld" = yes; then
+    sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib'
+  else
+    sys_lib_search_path_spec='/usr/ccs/lib /usr/lib'
+    case $host_os in
+      sco3.2v5*)
+        sys_lib_search_path_spec="$sys_lib_search_path_spec /lib"
+	;;
+    esac
+  fi
+  sys_lib_dlsearch_path_spec='/usr/lib'
+  ;;
+
+tpf*)
+  # TPF is a cross-target only.  Preferred cross-host = GNU/Linux.
+  version_type=linux # correct to gnu/linux during the next big refactor
+  need_lib_prefix=no
+  need_version=no
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  shlibpath_var=LD_LIBRARY_PATH
+  shlibpath_overrides_runpath=no
+  hardcode_into_libs=yes
+  ;;
+
+uts4*)
+  version_type=linux # correct to gnu/linux during the next big refactor
+  library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
+  soname_spec='${libname}${release}${shared_ext}$major'
+  shlibpath_var=LD_LIBRARY_PATH
+  ;;
+
+*)
+  dynamic_linker=no
+  ;;
+esac
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5
+$as_echo "$dynamic_linker" >&6; }
+test "$dynamic_linker" = no && can_build_shared=no
+
+variables_saved_for_relink="PATH $shlibpath_var $runpath_var"
+if test "$GCC" = yes; then
+  variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"
+fi
+
+if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then
+  sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec"
+fi
+if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then
+  sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec"
+fi
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+    { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5
+$as_echo_n "checking how to hardcode library paths into programs... " >&6; }
+hardcode_action_CXX=
+if test -n "$hardcode_libdir_flag_spec_CXX" ||
+   test -n "$runpath_var_CXX" ||
+   test "X$hardcode_automatic_CXX" = "Xyes" ; then
+
+  # We can hardcode non-existent directories.
+  if test "$hardcode_direct_CXX" != no &&
+     # If the only mechanism to avoid hardcoding is shlibpath_var, we
+     # have to relink, otherwise we might link with an installed library
+     # when we should be linking with a yet-to-be-installed one
+     ## test "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no &&
+     test "$hardcode_minus_L_CXX" != no; then
+    # Linking always hardcodes the temporary library directory.
+    hardcode_action_CXX=relink
+  else
+    # We can link without hardcoding, and we can hardcode nonexisting dirs.
+    hardcode_action_CXX=immediate
+  fi
+else
+  # We cannot hardcode anything, or else we can only hardcode existing
+  # directories.
+  hardcode_action_CXX=unsupported
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5
+$as_echo "$hardcode_action_CXX" >&6; }
+
+if test "$hardcode_action_CXX" = relink ||
+   test "$inherit_rpath_CXX" = yes; then
+  # Fast installation is not supported
+  enable_fast_install=no
+elif test "$shlibpath_overrides_runpath" = yes ||
+     test "$enable_shared" = no; then
+  # Fast installation is not necessary
+  enable_fast_install=needless
+fi
+
+
+
+
+
+
+
+  fi # test -n "$compiler"
+
+  CC=$lt_save_CC
+  CFLAGS=$lt_save_CFLAGS
+  LDCXX=$LD
+  LD=$lt_save_LD
+  GCC=$lt_save_GCC
+  with_gnu_ld=$lt_save_with_gnu_ld
+  lt_cv_path_LDCXX=$lt_cv_path_LD
+  lt_cv_path_LD=$lt_save_path_LD
+  lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld
+  lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld
+fi # test "$_lt_caught_CXX_error" != yes
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+        ac_config_commands="$ac_config_commands libtool"
+
+
+
+
+# Only expand once:
+
+
+
+AUTOM4TE=${AUTOM4TE-"${am_missing_run}autom4te"}
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5
+$as_echo_n "checking for ANSI C header files... " >&6; }
+if ${ac_cv_header_stdc+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdlib.h>
+#include <stdarg.h>
+#include <string.h>
+#include <float.h>
+
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  ac_cv_header_stdc=yes
+else
+  ac_cv_header_stdc=no
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+
+if test $ac_cv_header_stdc = yes; then
+  # SunOS 4.x string.h does not declare mem*, contrary to ANSI.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <string.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+  $EGREP "memchr" >/dev/null 2>&1; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+  # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdlib.h>
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+  $EGREP "free" >/dev/null 2>&1; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f conftest*
+
+fi
+
+if test $ac_cv_header_stdc = yes; then
+  # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.
+  if test "$cross_compiling" = yes; then :
+  :
+else
+  cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <ctype.h>
+#include <stdlib.h>
+#if ((' ' & 0x0FF) == 0x020)
+# define ISLOWER(c) ('a' <= (c) && (c) <= 'z')
+# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))
+#else
+# define ISLOWER(c) \
+		   (('a' <= (c) && (c) <= 'i') \
+		     || ('j' <= (c) && (c) <= 'r') \
+		     || ('s' <= (c) && (c) <= 'z'))
+# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))
+#endif
+
+#define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))
+int
+main ()
+{
+  int i;
+  for (i = 0; i < 256; i++)
+    if (XOR (islower (i), ISLOWER (i))
+	|| toupper (i) != TOUPPER (i))
+      return 2;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_run "$LINENO"; then :
+
+else
+  ac_cv_header_stdc=no
+fi
+rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \
+  conftest.$ac_objext conftest.beam conftest.$ac_ext
+fi
+
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5
+$as_echo "$ac_cv_header_stdc" >&6; }
+if test $ac_cv_header_stdc = yes; then
+
+$as_echo "#define STDC_HEADERS 1" >>confdefs.h
+
+fi
+
+for ac_header in stdarg.h stdlib.h string.h time.h unistd.h stdint.h sys/int_types.h
+do :
+  as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh`
+ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default"
+if eval test \"x\$"$as_ac_Header"\" = x"yes"; then :
+  cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+
+done
+
+LIBS_SAVE=$LIBS
+LIBS="$LIBS -lm"
+for ac_func in expm1 rint rintf finite log2 logbl snprintf log1p round fabsl fmin strcasecmp isnan strdup _strdup ftruncate stpcpy
+do :
+  as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh`
+ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var"
+if eval test \"x\$"$as_ac_var"\" = x"yes"; then :
+  cat >>confdefs.h <<_ACEOF
+#define `$as_echo "HAVE_$ac_func" | $as_tr_cpp` 1
+_ACEOF
+
+fi
+done
+
+LIBS=$LIBS_SAVE
+
+
+
+
+
+## Solaris cc does not support -ffloat-store.
+FLOATSTORE=
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler supports -ffloat-store" >&5
+$as_echo_n "checking whether compiler supports -ffloat-store... " >&6; }
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -ffloat-store"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+FLOATSTORE="-ffloat-store"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler supports -fstore" >&5
+$as_echo_n "checking whether compiler supports -fstore... " >&6; }
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -fstore"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+FLOATSTORE="$FLOATSTORE -fstore"
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+
+
+# Check whether --enable-gcc-warnings was given.
+if test "${enable_gcc_warnings+set}" = set; then :
+  enableval=$enable_gcc_warnings; case "${enableval}" in
+   yes|no) ;;
+   *)      as_fn_error $? "bad value ${enableval} for gcc-warnings option" "$LINENO" 5 ;;
+ esac
+else
+  enableval=no
+fi
+
+if test "${enableval}" = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Werror" >&5
+$as_echo_n "checking whether compiler accepts -Werror... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Werror"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Werror"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  WERROR_CFLAGS=$WARNING_CFLAGS
+
+  WARNING_CFLAGS=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wall" >&5
+$as_echo_n "checking whether compiler accepts -Wall... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wall"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wall"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -W" >&5
+$as_echo_n "checking whether compiler accepts -W... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -W"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -W"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wbad-function-cast" >&5
+$as_echo_n "checking whether compiler accepts -Wbad-function-cast... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wbad-function-cast"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wbad-function-cast"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wcast-align" >&5
+$as_echo_n "checking whether compiler accepts -Wcast-align... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wcast-align"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wcast-align"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wcast-qual" >&5
+$as_echo_n "checking whether compiler accepts -Wcast-qual... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wcast-qual"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wcast-qual"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wformat" >&5
+$as_echo_n "checking whether compiler accepts -Wformat... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wformat"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wformat"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wmissing-declarations" >&5
+$as_echo_n "checking whether compiler accepts -Wmissing-declarations... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wmissing-declarations"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wmissing-declarations"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wmissing-prototypes" >&5
+$as_echo_n "checking whether compiler accepts -Wmissing-prototypes... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wmissing-prototypes"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wmissing-prototypes"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wnested-externs" >&5
+$as_echo_n "checking whether compiler accepts -Wnested-externs... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wnested-externs"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wnested-externs"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wshadow" >&5
+$as_echo_n "checking whether compiler accepts -Wshadow... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wshadow"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wshadow"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wstrict-prototypes" >&5
+$as_echo_n "checking whether compiler accepts -Wstrict-prototypes... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wstrict-prototypes"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wstrict-prototypes"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wwrite-strings" >&5
+$as_echo_n "checking whether compiler accepts -Wwrite-strings... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wwrite-strings"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wwrite-strings"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+else
+  WARNING_CFLAGS=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether compiler accepts -Wall" >&5
+$as_echo_n "checking whether compiler accepts -Wall... " >&6; }
+
+ac_save_CFLAGS="$CFLAGS"
+CFLAGS="$CFLAGS -Wall"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+int
+main ()
+{
+int x;
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_compile "$LINENO"; then :
+  WARNING_CFLAGS="$WARNING_CFLAGS -Wall"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
+CFLAGS="$ac_save_CFLAGS"
+fi
+
+use_gprof=no
+# Check whether --enable-profiling was given.
+if test "${enable_profiling+set}" = set; then :
+  enableval=$enable_profiling; use_gprof=$enableval
+else
+  use_gprof=no
+fi
+
+
+debug=no
+# Check whether --enable-debug was given.
+if test "${enable_debug+set}" = set; then :
+  enableval=$enable_debug; debug=$enableval
+fi
+
+
+graphml_support=yes
+# Check whether --enable-graphml was given.
+if test "${enable_graphml+set}" = set; then :
+  enableval=$enable_graphml; graphml_support=$enableval
+else
+  graphml_support=yes
+fi
+
+
+HAVE_LIBXML=0
+XML2_LIBS=
+XML2_CFLAGS=
+if test $graphml_support = yes; then
+  # Extract the first word of "xml2-config", so it can be a program name with args.
+set dummy xml2-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_XML2CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $XML2CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_XML2CONFIG="$XML2CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
+    ac_cv_path_XML2CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_XML2CONFIG" && ac_cv_path_XML2CONFIG="none"
+  ;;
+esac
+fi
+XML2CONFIG=$ac_cv_path_XML2CONFIG
+if test -n "$XML2CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $XML2CONFIG" >&5
+$as_echo "$XML2CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  if test "$XML2CONFIG" = "none"; then
+	# Hmmm, no xml2-config. OS X does not have it while still
+	# having libxml2, so let's try an educated guess
+	XML2_LIBS="-lxml2 -lz -lm"
+	XML2_CFLAGS="-I/usr/include/libxml2"
+  else
+    XML2_LIBS=`$XML2CONFIG --libs`
+    XML2_CFLAGS=`$XML2CONFIG --cflags`
+  fi
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for xmlSAXUserParseFile in -lxml2" >&5
+$as_echo_n "checking for xmlSAXUserParseFile in -lxml2... " >&6; }
+if ${ac_cv_lib_xml2_xmlSAXUserParseFile+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lxml2  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char xmlSAXUserParseFile ();
+int
+main ()
+{
+return xmlSAXUserParseFile ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_c_try_link "$LINENO"; then :
+  ac_cv_lib_xml2_xmlSAXUserParseFile=yes
+else
+  ac_cv_lib_xml2_xmlSAXUserParseFile=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_xml2_xmlSAXUserParseFile" >&5
+$as_echo "$ac_cv_lib_xml2_xmlSAXUserParseFile" >&6; }
+if test "x$ac_cv_lib_xml2_xmlSAXUserParseFile" = xyes; then :
+
+    OLDCFLAGS=${CFLAGS}
+    OLDCPPFLAGS=${CPPFLAGS}
+    CFLAGS=${XML2_CFLAGS}
+    CPPFLAGS=${XML2_CFLAGS}
+    ac_fn_c_check_header_mongrel "$LINENO" "libxml/parser.h" "ac_cv_header_libxml_parser_h" "$ac_includes_default"
+if test "x$ac_cv_header_libxml_parser_h" = xyes; then :
+
+      HAVE_LIBXML=1
+
+$as_echo "#define HAVE_LIBXML 1" >>confdefs.h
+
+	  CFLAGS="${OLDCFLAGS} ${XML2_CFLAGS}"
+      CPPFLAGS="${OLDCFLAGS} ${XML2_CFLAGS}"
+
+else
+
+      graphml_support=no
+      CFLAGS=${OLDCFLAGS}
+	  CPPFLAGS=${OLDCPPFLAGS}
+	  XML2_LIBS=
+	  XML2_CFLAGS=
+
+fi
+
+
+
+else
+
+    graphml_support=no
+    XML2_LIBS=
+    XML2_CFLAGS=
+
+fi
+
+fi
+
+
+
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+gmp_support=no
+# Check whether --enable-gmp was given.
+if test "${enable_gmp+set}" = set; then :
+  enableval=$enable_gmp;
+fi
+
+if test "x$enable_gmp" != "xno"; then
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for __gmpz_add in -lgmp" >&5
+$as_echo_n "checking for __gmpz_add in -lgmp... " >&6; }
+if ${ac_cv_lib_gmp___gmpz_add+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lgmp  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char __gmpz_add ();
+int
+main ()
+{
+return __gmpz_add ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_gmp___gmpz_add=yes
+else
+  ac_cv_lib_gmp___gmpz_add=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_gmp___gmpz_add" >&5
+$as_echo "$ac_cv_lib_gmp___gmpz_add" >&6; }
+if test "x$ac_cv_lib_gmp___gmpz_add" = xyes; then :
+
+    ac_fn_cxx_check_header_mongrel "$LINENO" "gmp.h" "ac_cv_header_gmp_h" "$ac_includes_default"
+if test "x$ac_cv_header_gmp_h" = xyes; then :
+
+
+$as_echo "#define HAVE_GMP 1" >>confdefs.h
+
+      gmp_support=yes
+      LDFLAGS="${LDFLAGS} -lgmp"
+
+fi
+
+
+
+fi
+
+fi
+ac_ext=cpp
+ac_cpp='$CXXCPP $CPPFLAGS'
+ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_cxx_compiler_gnu
+
+
+tls_support=no
+HAVE_TLS=0
+THREAD_LOCAL=
+# Check whether --enable-tls was given.
+if test "${enable_tls+set}" = set; then :
+  enableval=$enable_tls;
+fi
+
+if test "x$enable_tls" != "xno"; then
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for thread local storage (TLS) class" >&5
+$as_echo_n "checking for thread local storage (TLS) class... " >&6; }
+  if ${ac_cv_tls+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+
+    ax_tls_keywords="__thread __declspec(thread) none"
+    for ax_tls_keyword in $ax_tls_keywords; do
+       case $ax_tls_keyword in #(
+  none) :
+    ac_cv_tls=none ; break ;; #(
+  *) :
+    cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+#include <stdlib.h>
+               static void
+               foo(void) {
+               static  $ax_tls_keyword  int bar;
+               exit(1);
+               }
+int
+main ()
+{
+
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_compile "$LINENO"; then :
+  ac_cv_tls=$ax_tls_keyword ; break
+else
+  ac_cv_tls=none
+
+fi
+rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ;;
+esac
+    done
+
+fi
+
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_tls" >&5
+$as_echo "$ac_cv_tls" >&6; }
+
+  if test "$ac_cv_tls" != "none"; then :
+
+cat >>confdefs.h <<_ACEOF
+#define TLS $ac_cv_tls
+_ACEOF
+
+
+
+$as_echo "#define HAVE_TLS 1" >>confdefs.h
+
+    tls_support=yes
+    HAVE_TLS=1
+    THREAD_LOCAL=$ac_cv_tls
+
+else
+  true
+
+fi
+
+fi
+
+
+cat >>confdefs.h <<_ACEOF
+#define IGRAPH_THREAD_LOCAL $THREAD_LOCAL
+_ACEOF
+
+
+cat >>confdefs.h <<_ACEOF
+#define IGRAPH_F77_SAVE static IGRAPH_THREAD_LOCAL
+_ACEOF
+
+
+
+# Check whether --with-external-f2c was given.
+if test "${with_external_f2c+set}" = set; then :
+  withval=$with_external_f2c; internal_f2c=no
+else
+  internal_f2c=yes
+fi
+
+
+# Check whether --with-external-blas was given.
+if test "${with_external_blas+set}" = set; then :
+  withval=$with_external_blas; internal_blas=no
+else
+  internal_blas=yes
+fi
+
+
+# Check whether --with-external-lapack was given.
+if test "${with_external_lapack+set}" = set; then :
+  withval=$with_external_lapack; internal_lapack=no
+else
+  internal_lapack=yes
+fi
+
+
+# Check whether --with-external-arpack was given.
+if test "${with_external_arpack+set}" = set; then :
+  withval=$with_external_arpack; internal_arpack=no
+else
+  internal_arpack=yes
+fi
+
+
+
+# Check whether --with-external-glpk was given.
+if test "${with_external_glpk+set}" = set; then :
+  withval=$with_external_glpk; internal_glpk=no
+else
+  internal_glpk=yes
+fi
+
+
+if test "$internal_f2c" = "no"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for f77_alloc_ in -lf2c" >&5
+$as_echo_n "checking for f77_alloc_ in -lf2c... " >&6; }
+if ${ac_cv_lib_f2c_f77_alloc_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lf2c  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char f77_alloc_ ();
+int
+main ()
+{
+return f77_alloc_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_f2c_f77_alloc_=yes
+else
+  ac_cv_lib_f2c_f77_alloc_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_f2c_f77_alloc_" >&5
+$as_echo "$ac_cv_lib_f2c_f77_alloc_" >&6; }
+if test "x$ac_cv_lib_f2c_f77_alloc_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBF2C 1
+_ACEOF
+
+  LIBS="-lf2c $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for f77_alloc in -lf2c" >&5
+$as_echo_n "checking for f77_alloc in -lf2c... " >&6; }
+if ${ac_cv_lib_f2c_f77_alloc+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lf2c  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char f77_alloc ();
+int
+main ()
+{
+return f77_alloc ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_f2c_f77_alloc=yes
+else
+  ac_cv_lib_f2c_f77_alloc=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_f2c_f77_alloc" >&5
+$as_echo "$ac_cv_lib_f2c_f77_alloc" >&6; }
+if test "x$ac_cv_lib_f2c_f77_alloc" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBF2C 1
+_ACEOF
+
+  LIBS="-lf2c $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for F77_ALLOC_ in -lf2c" >&5
+$as_echo_n "checking for F77_ALLOC_ in -lf2c... " >&6; }
+if ${ac_cv_lib_f2c_F77_ALLOC_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lf2c  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char F77_ALLOC_ ();
+int
+main ()
+{
+return F77_ALLOC_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_f2c_F77_ALLOC_=yes
+else
+  ac_cv_lib_f2c_F77_ALLOC_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_f2c_F77_ALLOC_" >&5
+$as_echo "$ac_cv_lib_f2c_F77_ALLOC_" >&6; }
+if test "x$ac_cv_lib_f2c_F77_ALLOC_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBF2C 1
+_ACEOF
+
+  LIBS="-lf2c $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for F77_ALLOC in -lf2c" >&5
+$as_echo_n "checking for F77_ALLOC in -lf2c... " >&6; }
+if ${ac_cv_lib_f2c_F77_ALLOC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lf2c  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char F77_ALLOC ();
+int
+main ()
+{
+return F77_ALLOC ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_f2c_F77_ALLOC=yes
+else
+  ac_cv_lib_f2c_F77_ALLOC=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_f2c_F77_ALLOC" >&5
+$as_echo "$ac_cv_lib_f2c_F77_ALLOC" >&6; }
+if test "x$ac_cv_lib_f2c_F77_ALLOC" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBF2C 1
+_ACEOF
+
+  LIBS="-lf2c $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: not found" >&5
+$as_echo "not found" >&6; }
+fi
+
+fi
+
+fi
+
+fi
+
+  LDFLAGS="${LDFLAGS}"
+else
+
+$as_echo "#define INTERNAL_F2C 1" >>confdefs.h
+
+fi
+
+if test "$internal_blas" = "no"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for daxpy_ in -lblas" >&5
+$as_echo_n "checking for daxpy_ in -lblas... " >&6; }
+if ${ac_cv_lib_blas_daxpy_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lblas  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char daxpy_ ();
+int
+main ()
+{
+return daxpy_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_blas_daxpy_=yes
+else
+  ac_cv_lib_blas_daxpy_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_blas_daxpy_" >&5
+$as_echo "$ac_cv_lib_blas_daxpy_" >&6; }
+if test "x$ac_cv_lib_blas_daxpy_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBBLAS 1
+_ACEOF
+
+  LIBS="-lblas $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for daxpy in -lblas" >&5
+$as_echo_n "checking for daxpy in -lblas... " >&6; }
+if ${ac_cv_lib_blas_daxpy+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lblas  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char daxpy ();
+int
+main ()
+{
+return daxpy ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_blas_daxpy=yes
+else
+  ac_cv_lib_blas_daxpy=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_blas_daxpy" >&5
+$as_echo "$ac_cv_lib_blas_daxpy" >&6; }
+if test "x$ac_cv_lib_blas_daxpy" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBBLAS 1
+_ACEOF
+
+  LIBS="-lblas $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DAXPY_ in -lblas" >&5
+$as_echo_n "checking for DAXPY_ in -lblas... " >&6; }
+if ${ac_cv_lib_blas_DAXPY_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lblas  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DAXPY_ ();
+int
+main ()
+{
+return DAXPY_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_blas_DAXPY_=yes
+else
+  ac_cv_lib_blas_DAXPY_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_blas_DAXPY_" >&5
+$as_echo "$ac_cv_lib_blas_DAXPY_" >&6; }
+if test "x$ac_cv_lib_blas_DAXPY_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBBLAS 1
+_ACEOF
+
+  LIBS="-lblas $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DAXPY in -lblas" >&5
+$as_echo_n "checking for DAXPY in -lblas... " >&6; }
+if ${ac_cv_lib_blas_DAXPY+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lblas  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DAXPY ();
+int
+main ()
+{
+return DAXPY ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_blas_DAXPY=yes
+else
+  ac_cv_lib_blas_DAXPY=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_blas_DAXPY" >&5
+$as_echo "$ac_cv_lib_blas_DAXPY" >&6; }
+if test "x$ac_cv_lib_blas_DAXPY" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBBLAS 1
+_ACEOF
+
+  LIBS="-lblas $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: not found" >&5
+$as_echo "not found" >&6; }
+fi
+
+fi
+
+fi
+
+fi
+
+  LDFLAGS="${LDFLAGS} -lblas"
+else
+
+$as_echo "#define INTERNAL_BLAS 1" >>confdefs.h
+
+fi
+
+if test "$internal_lapack" = "no"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlarnv_ in -llapack" >&5
+$as_echo_n "checking for dlarnv_ in -llapack... " >&6; }
+if ${ac_cv_lib_lapack_dlarnv_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-llapack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlarnv_ ();
+int
+main ()
+{
+return dlarnv_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_lapack_dlarnv_=yes
+else
+  ac_cv_lib_lapack_dlarnv_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lapack_dlarnv_" >&5
+$as_echo "$ac_cv_lib_lapack_dlarnv_" >&6; }
+if test "x$ac_cv_lib_lapack_dlarnv_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBLAPACK 1
+_ACEOF
+
+  LIBS="-llapack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlarnv in -llapack" >&5
+$as_echo_n "checking for dlarnv in -llapack... " >&6; }
+if ${ac_cv_lib_lapack_dlarnv+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-llapack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dlarnv ();
+int
+main ()
+{
+return dlarnv ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_lapack_dlarnv=yes
+else
+  ac_cv_lib_lapack_dlarnv=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lapack_dlarnv" >&5
+$as_echo "$ac_cv_lib_lapack_dlarnv" >&6; }
+if test "x$ac_cv_lib_lapack_dlarnv" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBLAPACK 1
+_ACEOF
+
+  LIBS="-llapack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DLARNV_ in -llapack" >&5
+$as_echo_n "checking for DLARNV_ in -llapack... " >&6; }
+if ${ac_cv_lib_lapack_DLARNV_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-llapack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DLARNV_ ();
+int
+main ()
+{
+return DLARNV_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_lapack_DLARNV_=yes
+else
+  ac_cv_lib_lapack_DLARNV_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lapack_DLARNV_" >&5
+$as_echo "$ac_cv_lib_lapack_DLARNV_" >&6; }
+if test "x$ac_cv_lib_lapack_DLARNV_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBLAPACK 1
+_ACEOF
+
+  LIBS="-llapack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DLARNV in -llapack" >&5
+$as_echo_n "checking for DLARNV in -llapack... " >&6; }
+if ${ac_cv_lib_lapack_DLARNV+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-llapack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DLARNV ();
+int
+main ()
+{
+return DLARNV ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_lapack_DLARNV=yes
+else
+  ac_cv_lib_lapack_DLARNV=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lapack_DLARNV" >&5
+$as_echo "$ac_cv_lib_lapack_DLARNV" >&6; }
+if test "x$ac_cv_lib_lapack_DLARNV" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBLAPACK 1
+_ACEOF
+
+  LIBS="-llapack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: not found" >&5
+$as_echo "not found" >&6; }
+fi
+
+fi
+
+fi
+
+fi
+
+  LDFLAGS="${LDFLAGS} -llapack"
+else
+
+$as_echo "#define INTERNAL_LAPACK 1" >>confdefs.h
+
+fi
+
+if test "$internal_arpack" = "no"; then
+  if test "$tls_support" = "yes"; then
+    as_fn_error $? "Thread-local storage only supported with internal ARPACK library" "$LINENO" 5
+  fi
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dsaupd_ in -larpack" >&5
+$as_echo_n "checking for dsaupd_ in -larpack... " >&6; }
+if ${ac_cv_lib_arpack_dsaupd_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-larpack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dsaupd_ ();
+int
+main ()
+{
+return dsaupd_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_arpack_dsaupd_=yes
+else
+  ac_cv_lib_arpack_dsaupd_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_arpack_dsaupd_" >&5
+$as_echo "$ac_cv_lib_arpack_dsaupd_" >&6; }
+if test "x$ac_cv_lib_arpack_dsaupd_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBARPACK 1
+_ACEOF
+
+  LIBS="-larpack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dsaupd in -larpack" >&5
+$as_echo_n "checking for dsaupd in -larpack... " >&6; }
+if ${ac_cv_lib_arpack_dsaupd+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-larpack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char dsaupd ();
+int
+main ()
+{
+return dsaupd ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_arpack_dsaupd=yes
+else
+  ac_cv_lib_arpack_dsaupd=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_arpack_dsaupd" >&5
+$as_echo "$ac_cv_lib_arpack_dsaupd" >&6; }
+if test "x$ac_cv_lib_arpack_dsaupd" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBARPACK 1
+_ACEOF
+
+  LIBS="-larpack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DSAUPD_ in -larpack" >&5
+$as_echo_n "checking for DSAUPD_ in -larpack... " >&6; }
+if ${ac_cv_lib_arpack_DSAUPD_+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-larpack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DSAUPD_ ();
+int
+main ()
+{
+return DSAUPD_ ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_arpack_DSAUPD_=yes
+else
+  ac_cv_lib_arpack_DSAUPD_=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_arpack_DSAUPD_" >&5
+$as_echo "$ac_cv_lib_arpack_DSAUPD_" >&6; }
+if test "x$ac_cv_lib_arpack_DSAUPD_" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBARPACK 1
+_ACEOF
+
+  LIBS="-larpack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for DSAUPD in -larpack" >&5
+$as_echo_n "checking for DSAUPD in -larpack... " >&6; }
+if ${ac_cv_lib_arpack_DSAUPD+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-larpack  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char DSAUPD ();
+int
+main ()
+{
+return DSAUPD ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_arpack_DSAUPD=yes
+else
+  ac_cv_lib_arpack_DSAUPD=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_arpack_DSAUPD" >&5
+$as_echo "$ac_cv_lib_arpack_DSAUPD" >&6; }
+if test "x$ac_cv_lib_arpack_DSAUPD" = xyes; then :
+  cat >>confdefs.h <<_ACEOF
+#define HAVE_LIBARPACK 1
+_ACEOF
+
+  LIBS="-larpack $LIBS"
+
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: not found" >&5
+$as_echo "not found" >&6; }
+fi
+
+fi
+
+fi
+
+fi
+
+  LDFLAGS="${LDFLAGS} -larpack"
+else
+
+$as_echo "#define INTERNAL_ARPACK 1" >>confdefs.h
+
+fi
+
+glpk_support=no
+if test "$internal_glpk" = "no"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: checking for glp_read_mps in -lglpk" >&5
+$as_echo_n "checking for glp_read_mps in -lglpk... " >&6; }
+if ${ac_cv_lib_glpk_glp_read_mps+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  ac_check_lib_save_LIBS=$LIBS
+LIBS="-lglpk  $LIBS"
+cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+/* Override any GCC internal prototype to avoid an error.
+   Use char because int might match the return type of a GCC
+   builtin and then its argument prototype would still apply.  */
+#ifdef __cplusplus
+extern "C"
+#endif
+char glp_read_mps ();
+int
+main ()
+{
+return glp_read_mps ();
+  ;
+  return 0;
+}
+_ACEOF
+if ac_fn_cxx_try_link "$LINENO"; then :
+  ac_cv_lib_glpk_glp_read_mps=yes
+else
+  ac_cv_lib_glpk_glp_read_mps=no
+fi
+rm -f core conftest.err conftest.$ac_objext \
+    conftest$ac_exeext conftest.$ac_ext
+LIBS=$ac_check_lib_save_LIBS
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_glpk_glp_read_mps" >&5
+$as_echo "$ac_cv_lib_glpk_glp_read_mps" >&6; }
+if test "x$ac_cv_lib_glpk_glp_read_mps" = xyes; then :
+
+    ac_fn_cxx_check_header_mongrel "$LINENO" "glpk.h" "ac_cv_header_glpk_h" "$ac_includes_default"
+if test "x$ac_cv_header_glpk_h" = xyes; then :
+
+      cat confdefs.h - <<_ACEOF >conftest.$ac_ext
+/* end confdefs.h.  */
+
+        #include <glpk.h>
+        #if GLP_MAJOR_VERSION > 4 || (GLP_MAJOR_VERSION == 4 && GLP_MINOR_VERSION >= 38)
+          yes
+        #endif
+
+_ACEOF
+if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
+  $EGREP "yes" >/dev/null 2>&1; then :
+
+
+$as_echo "#define HAVE_GLPK 1" >>confdefs.h
+
+        glpk_support=yes
+        LDFLAGS="${LDFLAGS} -lglpk"
+
+fi
+rm -f conftest*
+
+
+fi
+
+
+
+fi
+
+else
+
+$as_echo "#define HAVE_GLPK 1" >>confdefs.h
+
+
+$as_echo "#define INTERNAL_GLPK 1" >>confdefs.h
+
+  glpk_support=yes
+fi
+
+ if test x$internal_glpk = xyes; then
+  INTERNAL_GLPK_TRUE=
+  INTERNAL_GLPK_FALSE='#'
+else
+  INTERNAL_GLPK_TRUE='#'
+  INTERNAL_GLPK_FALSE=
+fi
+
+ if test x$internal_arpack = xyes; then
+  INTERNAL_ARPACK_TRUE=
+  INTERNAL_ARPACK_FALSE='#'
+else
+  INTERNAL_ARPACK_TRUE='#'
+  INTERNAL_ARPACK_FALSE=
+fi
+
+ if test x$internal_lapack = xyes; then
+  INTERNAL_LAPACK_TRUE=
+  INTERNAL_LAPACK_FALSE='#'
+else
+  INTERNAL_LAPACK_TRUE='#'
+  INTERNAL_LAPACK_FALSE=
+fi
+
+ if test x$internal_blas = xyes; then
+  INTERNAL_BLAS_TRUE=
+  INTERNAL_BLAS_FALSE='#'
+else
+  INTERNAL_BLAS_TRUE='#'
+  INTERNAL_BLAS_FALSE=
+fi
+
+ if test x$internal_f2c = xyes; then
+  INTERNAL_F2C_TRUE=
+  INTERNAL_F2C_FALSE='#'
+else
+  INTERNAL_F2C_TRUE='#'
+  INTERNAL_F2C_FALSE=
+fi
+
+
+if test "$debug" = "yes"; then
+  CFLAGS="${CFLAGS} -ggdb -DRC_DEBUG -O0"
+  CPPFLAGS="${CFLAGS} -ggdb -DRC_DEBUG"
+  CXXFLAGS="${CFLAGS} -ggdb -DRC_DEBUG -O0"
+fi
+
+if test "$use_gprof" = "yes"; then
+  CFLAGS="${CFLAGS} -pg"
+  CPPFLAGS="${CFLAGS} -pg"
+  CXXFLAGS="${CFLAGS} -pg"
+fi
+
+ac_config_files="$ac_config_files Makefile src/Makefile igraph.pc igraph_Info.plist doc/Makefile doc/book/Makefile interfaces/R/configure.in interfaces/R/Makefile interfaces/R/src/Makevars.win interfaces/R/DESCRIPTION interfaces/Makefile include/igraph_version.h include/igraph_threading.h"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+DEFS=-DHAVE_CONFIG_H
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIBOBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+ if test -n "$EXEEXT"; then
+  am__EXEEXT_TRUE=
+  am__EXEEXT_FALSE='#'
+else
+  am__EXEEXT_TRUE='#'
+  am__EXEEXT_FALSE=
+fi
+
+if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then
+  as_fn_error $? "conditional \"AMDEP\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then
+  as_fn_error $? "conditional \"am__fastdepCC\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then
+  as_fn_error $? "conditional \"am__fastdepCXX\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${INTERNAL_GLPK_TRUE}" && test -z "${INTERNAL_GLPK_FALSE}"; then
+  as_fn_error $? "conditional \"INTERNAL_GLPK\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${INTERNAL_ARPACK_TRUE}" && test -z "${INTERNAL_ARPACK_FALSE}"; then
+  as_fn_error $? "conditional \"INTERNAL_ARPACK\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${INTERNAL_LAPACK_TRUE}" && test -z "${INTERNAL_LAPACK_FALSE}"; then
+  as_fn_error $? "conditional \"INTERNAL_LAPACK\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${INTERNAL_BLAS_TRUE}" && test -z "${INTERNAL_BLAS_FALSE}"; then
+  as_fn_error $? "conditional \"INTERNAL_BLAS\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+if test -z "${INTERNAL_F2C_TRUE}" && test -z "${INTERNAL_F2C_FALSE}"; then
+  as_fn_error $? "conditional \"INTERNAL_F2C\" was never defined.
+Usually this means the macro was only invoked conditionally." "$LINENO" 5
+fi
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -p'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -p'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -p'
+  fi
+else
+  as_ln_s='cp -p'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+if test -x / >/dev/null 2>&1; then
+  as_test_x='test -x'
+else
+  if ls -dL / >/dev/null 2>&1; then
+    as_ls_L_option=L
+  else
+    as_ls_L_option=
+  fi
+  as_test_x='
+    eval sh -c '\''
+      if test -d "$1"; then
+	test -d "$1/.";
+      else
+	case $1 in #(
+	-*)set "./$1";;
+	esac;
+	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
+	???[sx]*):;;*)false;;esac;fi
+    '\'' sh
+  '
+fi
+as_executable_p=$as_test_x
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by igraph $as_me 0.6.5, which was
+generated by GNU Autoconf 2.68.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+case $ac_config_headers in *"
+"*) set x $ac_config_headers; shift; ac_config_headers=$*;;
+esac
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+config_headers="$ac_config_headers"
+config_commands="$ac_config_commands"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+      --header=FILE[:TEMPLATE]
+                   instantiate the configuration header FILE
+
+Configuration files:
+$config_files
+
+Configuration headers:
+$config_headers
+
+Configuration commands:
+$config_commands
+
+Report bugs to <csardi.gabor@gmail.com>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+igraph config.status 0.6.5
+configured by $0, generated by GNU Autoconf 2.68,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2010 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --header | --heade | --head | --hea )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    as_fn_append CONFIG_HEADERS " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h)
+    # Conflict between --help and --header
+    as_fn_error $? "ambiguous option: \`$1'
+Try \`$0 --help' for more information.";;
+  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X '$SHELL' '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+#
+# INIT-COMMANDS
+#
+
+AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"
+
+
+# The HP-UX ksh and POSIX shell print the target directory to stdout
+# if CDPATH is set.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+sed_quote_subst='$sed_quote_subst'
+double_quote_subst='$double_quote_subst'
+delay_variable_subst='$delay_variable_subst'
+AS='`$ECHO "$AS" | $SED "$delay_single_quote_subst"`'
+DLLTOOL='`$ECHO "$DLLTOOL" | $SED "$delay_single_quote_subst"`'
+OBJDUMP='`$ECHO "$OBJDUMP" | $SED "$delay_single_quote_subst"`'
+macro_version='`$ECHO "$macro_version" | $SED "$delay_single_quote_subst"`'
+macro_revision='`$ECHO "$macro_revision" | $SED "$delay_single_quote_subst"`'
+enable_shared='`$ECHO "$enable_shared" | $SED "$delay_single_quote_subst"`'
+enable_static='`$ECHO "$enable_static" | $SED "$delay_single_quote_subst"`'
+pic_mode='`$ECHO "$pic_mode" | $SED "$delay_single_quote_subst"`'
+enable_fast_install='`$ECHO "$enable_fast_install" | $SED "$delay_single_quote_subst"`'
+SHELL='`$ECHO "$SHELL" | $SED "$delay_single_quote_subst"`'
+ECHO='`$ECHO "$ECHO" | $SED "$delay_single_quote_subst"`'
+PATH_SEPARATOR='`$ECHO "$PATH_SEPARATOR" | $SED "$delay_single_quote_subst"`'
+host_alias='`$ECHO "$host_alias" | $SED "$delay_single_quote_subst"`'
+host='`$ECHO "$host" | $SED "$delay_single_quote_subst"`'
+host_os='`$ECHO "$host_os" | $SED "$delay_single_quote_subst"`'
+build_alias='`$ECHO "$build_alias" | $SED "$delay_single_quote_subst"`'
+build='`$ECHO "$build" | $SED "$delay_single_quote_subst"`'
+build_os='`$ECHO "$build_os" | $SED "$delay_single_quote_subst"`'
+SED='`$ECHO "$SED" | $SED "$delay_single_quote_subst"`'
+Xsed='`$ECHO "$Xsed" | $SED "$delay_single_quote_subst"`'
+GREP='`$ECHO "$GREP" | $SED "$delay_single_quote_subst"`'
+EGREP='`$ECHO "$EGREP" | $SED "$delay_single_quote_subst"`'
+FGREP='`$ECHO "$FGREP" | $SED "$delay_single_quote_subst"`'
+LD='`$ECHO "$LD" | $SED "$delay_single_quote_subst"`'
+NM='`$ECHO "$NM" | $SED "$delay_single_quote_subst"`'
+LN_S='`$ECHO "$LN_S" | $SED "$delay_single_quote_subst"`'
+max_cmd_len='`$ECHO "$max_cmd_len" | $SED "$delay_single_quote_subst"`'
+ac_objext='`$ECHO "$ac_objext" | $SED "$delay_single_quote_subst"`'
+exeext='`$ECHO "$exeext" | $SED "$delay_single_quote_subst"`'
+lt_unset='`$ECHO "$lt_unset" | $SED "$delay_single_quote_subst"`'
+lt_SP2NL='`$ECHO "$lt_SP2NL" | $SED "$delay_single_quote_subst"`'
+lt_NL2SP='`$ECHO "$lt_NL2SP" | $SED "$delay_single_quote_subst"`'
+lt_cv_to_host_file_cmd='`$ECHO "$lt_cv_to_host_file_cmd" | $SED "$delay_single_quote_subst"`'
+lt_cv_to_tool_file_cmd='`$ECHO "$lt_cv_to_tool_file_cmd" | $SED "$delay_single_quote_subst"`'
+reload_flag='`$ECHO "$reload_flag" | $SED "$delay_single_quote_subst"`'
+reload_cmds='`$ECHO "$reload_cmds" | $SED "$delay_single_quote_subst"`'
+deplibs_check_method='`$ECHO "$deplibs_check_method" | $SED "$delay_single_quote_subst"`'
+file_magic_cmd='`$ECHO "$file_magic_cmd" | $SED "$delay_single_quote_subst"`'
+file_magic_glob='`$ECHO "$file_magic_glob" | $SED "$delay_single_quote_subst"`'
+want_nocaseglob='`$ECHO "$want_nocaseglob" | $SED "$delay_single_quote_subst"`'
+sharedlib_from_linklib_cmd='`$ECHO "$sharedlib_from_linklib_cmd" | $SED "$delay_single_quote_subst"`'
+AR='`$ECHO "$AR" | $SED "$delay_single_quote_subst"`'
+AR_FLAGS='`$ECHO "$AR_FLAGS" | $SED "$delay_single_quote_subst"`'
+archiver_list_spec='`$ECHO "$archiver_list_spec" | $SED "$delay_single_quote_subst"`'
+STRIP='`$ECHO "$STRIP" | $SED "$delay_single_quote_subst"`'
+RANLIB='`$ECHO "$RANLIB" | $SED "$delay_single_quote_subst"`'
+old_postinstall_cmds='`$ECHO "$old_postinstall_cmds" | $SED "$delay_single_quote_subst"`'
+old_postuninstall_cmds='`$ECHO "$old_postuninstall_cmds" | $SED "$delay_single_quote_subst"`'
+old_archive_cmds='`$ECHO "$old_archive_cmds" | $SED "$delay_single_quote_subst"`'
+lock_old_archive_extraction='`$ECHO "$lock_old_archive_extraction" | $SED "$delay_single_quote_subst"`'
+CC='`$ECHO "$CC" | $SED "$delay_single_quote_subst"`'
+CFLAGS='`$ECHO "$CFLAGS" | $SED "$delay_single_quote_subst"`'
+compiler='`$ECHO "$compiler" | $SED "$delay_single_quote_subst"`'
+GCC='`$ECHO "$GCC" | $SED "$delay_single_quote_subst"`'
+lt_cv_sys_global_symbol_pipe='`$ECHO "$lt_cv_sys_global_symbol_pipe" | $SED "$delay_single_quote_subst"`'
+lt_cv_sys_global_symbol_to_cdecl='`$ECHO "$lt_cv_sys_global_symbol_to_cdecl" | $SED "$delay_single_quote_subst"`'
+lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address" | $SED "$delay_single_quote_subst"`'
+lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $SED "$delay_single_quote_subst"`'
+nm_file_list_spec='`$ECHO "$nm_file_list_spec" | $SED "$delay_single_quote_subst"`'
+lt_sysroot='`$ECHO "$lt_sysroot" | $SED "$delay_single_quote_subst"`'
+objdir='`$ECHO "$objdir" | $SED "$delay_single_quote_subst"`'
+MAGIC_CMD='`$ECHO "$MAGIC_CMD" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_no_builtin_flag='`$ECHO "$lt_prog_compiler_no_builtin_flag" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_pic='`$ECHO "$lt_prog_compiler_pic" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_wl='`$ECHO "$lt_prog_compiler_wl" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_static='`$ECHO "$lt_prog_compiler_static" | $SED "$delay_single_quote_subst"`'
+lt_cv_prog_compiler_c_o='`$ECHO "$lt_cv_prog_compiler_c_o" | $SED "$delay_single_quote_subst"`'
+need_locks='`$ECHO "$need_locks" | $SED "$delay_single_quote_subst"`'
+MANIFEST_TOOL='`$ECHO "$MANIFEST_TOOL" | $SED "$delay_single_quote_subst"`'
+DSYMUTIL='`$ECHO "$DSYMUTIL" | $SED "$delay_single_quote_subst"`'
+NMEDIT='`$ECHO "$NMEDIT" | $SED "$delay_single_quote_subst"`'
+LIPO='`$ECHO "$LIPO" | $SED "$delay_single_quote_subst"`'
+OTOOL='`$ECHO "$OTOOL" | $SED "$delay_single_quote_subst"`'
+OTOOL64='`$ECHO "$OTOOL64" | $SED "$delay_single_quote_subst"`'
+libext='`$ECHO "$libext" | $SED "$delay_single_quote_subst"`'
+shrext_cmds='`$ECHO "$shrext_cmds" | $SED "$delay_single_quote_subst"`'
+extract_expsyms_cmds='`$ECHO "$extract_expsyms_cmds" | $SED "$delay_single_quote_subst"`'
+archive_cmds_need_lc='`$ECHO "$archive_cmds_need_lc" | $SED "$delay_single_quote_subst"`'
+enable_shared_with_static_runtimes='`$ECHO "$enable_shared_with_static_runtimes" | $SED "$delay_single_quote_subst"`'
+export_dynamic_flag_spec='`$ECHO "$export_dynamic_flag_spec" | $SED "$delay_single_quote_subst"`'
+whole_archive_flag_spec='`$ECHO "$whole_archive_flag_spec" | $SED "$delay_single_quote_subst"`'
+compiler_needs_object='`$ECHO "$compiler_needs_object" | $SED "$delay_single_quote_subst"`'
+old_archive_from_new_cmds='`$ECHO "$old_archive_from_new_cmds" | $SED "$delay_single_quote_subst"`'
+old_archive_from_expsyms_cmds='`$ECHO "$old_archive_from_expsyms_cmds" | $SED "$delay_single_quote_subst"`'
+archive_cmds='`$ECHO "$archive_cmds" | $SED "$delay_single_quote_subst"`'
+archive_expsym_cmds='`$ECHO "$archive_expsym_cmds" | $SED "$delay_single_quote_subst"`'
+module_cmds='`$ECHO "$module_cmds" | $SED "$delay_single_quote_subst"`'
+module_expsym_cmds='`$ECHO "$module_expsym_cmds" | $SED "$delay_single_quote_subst"`'
+with_gnu_ld='`$ECHO "$with_gnu_ld" | $SED "$delay_single_quote_subst"`'
+allow_undefined_flag='`$ECHO "$allow_undefined_flag" | $SED "$delay_single_quote_subst"`'
+no_undefined_flag='`$ECHO "$no_undefined_flag" | $SED "$delay_single_quote_subst"`'
+hardcode_libdir_flag_spec='`$ECHO "$hardcode_libdir_flag_spec" | $SED "$delay_single_quote_subst"`'
+hardcode_libdir_separator='`$ECHO "$hardcode_libdir_separator" | $SED "$delay_single_quote_subst"`'
+hardcode_direct='`$ECHO "$hardcode_direct" | $SED "$delay_single_quote_subst"`'
+hardcode_direct_absolute='`$ECHO "$hardcode_direct_absolute" | $SED "$delay_single_quote_subst"`'
+hardcode_minus_L='`$ECHO "$hardcode_minus_L" | $SED "$delay_single_quote_subst"`'
+hardcode_shlibpath_var='`$ECHO "$hardcode_shlibpath_var" | $SED "$delay_single_quote_subst"`'
+hardcode_automatic='`$ECHO "$hardcode_automatic" | $SED "$delay_single_quote_subst"`'
+inherit_rpath='`$ECHO "$inherit_rpath" | $SED "$delay_single_quote_subst"`'
+link_all_deplibs='`$ECHO "$link_all_deplibs" | $SED "$delay_single_quote_subst"`'
+always_export_symbols='`$ECHO "$always_export_symbols" | $SED "$delay_single_quote_subst"`'
+export_symbols_cmds='`$ECHO "$export_symbols_cmds" | $SED "$delay_single_quote_subst"`'
+exclude_expsyms='`$ECHO "$exclude_expsyms" | $SED "$delay_single_quote_subst"`'
+include_expsyms='`$ECHO "$include_expsyms" | $SED "$delay_single_quote_subst"`'
+prelink_cmds='`$ECHO "$prelink_cmds" | $SED "$delay_single_quote_subst"`'
+postlink_cmds='`$ECHO "$postlink_cmds" | $SED "$delay_single_quote_subst"`'
+file_list_spec='`$ECHO "$file_list_spec" | $SED "$delay_single_quote_subst"`'
+variables_saved_for_relink='`$ECHO "$variables_saved_for_relink" | $SED "$delay_single_quote_subst"`'
+need_lib_prefix='`$ECHO "$need_lib_prefix" | $SED "$delay_single_quote_subst"`'
+need_version='`$ECHO "$need_version" | $SED "$delay_single_quote_subst"`'
+version_type='`$ECHO "$version_type" | $SED "$delay_single_quote_subst"`'
+runpath_var='`$ECHO "$runpath_var" | $SED "$delay_single_quote_subst"`'
+shlibpath_var='`$ECHO "$shlibpath_var" | $SED "$delay_single_quote_subst"`'
+shlibpath_overrides_runpath='`$ECHO "$shlibpath_overrides_runpath" | $SED "$delay_single_quote_subst"`'
+libname_spec='`$ECHO "$libname_spec" | $SED "$delay_single_quote_subst"`'
+library_names_spec='`$ECHO "$library_names_spec" | $SED "$delay_single_quote_subst"`'
+soname_spec='`$ECHO "$soname_spec" | $SED "$delay_single_quote_subst"`'
+install_override_mode='`$ECHO "$install_override_mode" | $SED "$delay_single_quote_subst"`'
+postinstall_cmds='`$ECHO "$postinstall_cmds" | $SED "$delay_single_quote_subst"`'
+postuninstall_cmds='`$ECHO "$postuninstall_cmds" | $SED "$delay_single_quote_subst"`'
+finish_cmds='`$ECHO "$finish_cmds" | $SED "$delay_single_quote_subst"`'
+finish_eval='`$ECHO "$finish_eval" | $SED "$delay_single_quote_subst"`'
+hardcode_into_libs='`$ECHO "$hardcode_into_libs" | $SED "$delay_single_quote_subst"`'
+sys_lib_search_path_spec='`$ECHO "$sys_lib_search_path_spec" | $SED "$delay_single_quote_subst"`'
+sys_lib_dlsearch_path_spec='`$ECHO "$sys_lib_dlsearch_path_spec" | $SED "$delay_single_quote_subst"`'
+hardcode_action='`$ECHO "$hardcode_action" | $SED "$delay_single_quote_subst"`'
+enable_dlopen='`$ECHO "$enable_dlopen" | $SED "$delay_single_quote_subst"`'
+enable_dlopen_self='`$ECHO "$enable_dlopen_self" | $SED "$delay_single_quote_subst"`'
+enable_dlopen_self_static='`$ECHO "$enable_dlopen_self_static" | $SED "$delay_single_quote_subst"`'
+old_striplib='`$ECHO "$old_striplib" | $SED "$delay_single_quote_subst"`'
+striplib='`$ECHO "$striplib" | $SED "$delay_single_quote_subst"`'
+compiler_lib_search_dirs='`$ECHO "$compiler_lib_search_dirs" | $SED "$delay_single_quote_subst"`'
+predep_objects='`$ECHO "$predep_objects" | $SED "$delay_single_quote_subst"`'
+postdep_objects='`$ECHO "$postdep_objects" | $SED "$delay_single_quote_subst"`'
+predeps='`$ECHO "$predeps" | $SED "$delay_single_quote_subst"`'
+postdeps='`$ECHO "$postdeps" | $SED "$delay_single_quote_subst"`'
+compiler_lib_search_path='`$ECHO "$compiler_lib_search_path" | $SED "$delay_single_quote_subst"`'
+LD_CXX='`$ECHO "$LD_CXX" | $SED "$delay_single_quote_subst"`'
+reload_flag_CXX='`$ECHO "$reload_flag_CXX" | $SED "$delay_single_quote_subst"`'
+reload_cmds_CXX='`$ECHO "$reload_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+old_archive_cmds_CXX='`$ECHO "$old_archive_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+compiler_CXX='`$ECHO "$compiler_CXX" | $SED "$delay_single_quote_subst"`'
+GCC_CXX='`$ECHO "$GCC_CXX" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "$lt_prog_compiler_no_builtin_flag_CXX" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_pic_CXX='`$ECHO "$lt_prog_compiler_pic_CXX" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_wl_CXX='`$ECHO "$lt_prog_compiler_wl_CXX" | $SED "$delay_single_quote_subst"`'
+lt_prog_compiler_static_CXX='`$ECHO "$lt_prog_compiler_static_CXX" | $SED "$delay_single_quote_subst"`'
+lt_cv_prog_compiler_c_o_CXX='`$ECHO "$lt_cv_prog_compiler_c_o_CXX" | $SED "$delay_single_quote_subst"`'
+archive_cmds_need_lc_CXX='`$ECHO "$archive_cmds_need_lc_CXX" | $SED "$delay_single_quote_subst"`'
+enable_shared_with_static_runtimes_CXX='`$ECHO "$enable_shared_with_static_runtimes_CXX" | $SED "$delay_single_quote_subst"`'
+export_dynamic_flag_spec_CXX='`$ECHO "$export_dynamic_flag_spec_CXX" | $SED "$delay_single_quote_subst"`'
+whole_archive_flag_spec_CXX='`$ECHO "$whole_archive_flag_spec_CXX" | $SED "$delay_single_quote_subst"`'
+compiler_needs_object_CXX='`$ECHO "$compiler_needs_object_CXX" | $SED "$delay_single_quote_subst"`'
+old_archive_from_new_cmds_CXX='`$ECHO "$old_archive_from_new_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+old_archive_from_expsyms_cmds_CXX='`$ECHO "$old_archive_from_expsyms_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+archive_cmds_CXX='`$ECHO "$archive_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+archive_expsym_cmds_CXX='`$ECHO "$archive_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+module_cmds_CXX='`$ECHO "$module_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+module_expsym_cmds_CXX='`$ECHO "$module_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+with_gnu_ld_CXX='`$ECHO "$with_gnu_ld_CXX" | $SED "$delay_single_quote_subst"`'
+allow_undefined_flag_CXX='`$ECHO "$allow_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`'
+no_undefined_flag_CXX='`$ECHO "$no_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_libdir_flag_spec_CXX='`$ECHO "$hardcode_libdir_flag_spec_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_libdir_separator_CXX='`$ECHO "$hardcode_libdir_separator_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_direct_CXX='`$ECHO "$hardcode_direct_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_direct_absolute_CXX='`$ECHO "$hardcode_direct_absolute_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_minus_L_CXX='`$ECHO "$hardcode_minus_L_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_shlibpath_var_CXX='`$ECHO "$hardcode_shlibpath_var_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_automatic_CXX='`$ECHO "$hardcode_automatic_CXX" | $SED "$delay_single_quote_subst"`'
+inherit_rpath_CXX='`$ECHO "$inherit_rpath_CXX" | $SED "$delay_single_quote_subst"`'
+link_all_deplibs_CXX='`$ECHO "$link_all_deplibs_CXX" | $SED "$delay_single_quote_subst"`'
+always_export_symbols_CXX='`$ECHO "$always_export_symbols_CXX" | $SED "$delay_single_quote_subst"`'
+export_symbols_cmds_CXX='`$ECHO "$export_symbols_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+exclude_expsyms_CXX='`$ECHO "$exclude_expsyms_CXX" | $SED "$delay_single_quote_subst"`'
+include_expsyms_CXX='`$ECHO "$include_expsyms_CXX" | $SED "$delay_single_quote_subst"`'
+prelink_cmds_CXX='`$ECHO "$prelink_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+postlink_cmds_CXX='`$ECHO "$postlink_cmds_CXX" | $SED "$delay_single_quote_subst"`'
+file_list_spec_CXX='`$ECHO "$file_list_spec_CXX" | $SED "$delay_single_quote_subst"`'
+hardcode_action_CXX='`$ECHO "$hardcode_action_CXX" | $SED "$delay_single_quote_subst"`'
+compiler_lib_search_dirs_CXX='`$ECHO "$compiler_lib_search_dirs_CXX" | $SED "$delay_single_quote_subst"`'
+predep_objects_CXX='`$ECHO "$predep_objects_CXX" | $SED "$delay_single_quote_subst"`'
+postdep_objects_CXX='`$ECHO "$postdep_objects_CXX" | $SED "$delay_single_quote_subst"`'
+predeps_CXX='`$ECHO "$predeps_CXX" | $SED "$delay_single_quote_subst"`'
+postdeps_CXX='`$ECHO "$postdeps_CXX" | $SED "$delay_single_quote_subst"`'
+compiler_lib_search_path_CXX='`$ECHO "$compiler_lib_search_path_CXX" | $SED "$delay_single_quote_subst"`'
+
+LTCC='$LTCC'
+LTCFLAGS='$LTCFLAGS'
+compiler='$compiler_DEFAULT'
+
+# A function that is used when there is no print builtin or printf.
+func_fallback_echo ()
+{
+  eval 'cat <<_LTECHO_EOF
+\$1
+_LTECHO_EOF'
+}
+
+# Quote evaled strings.
+for var in AS \
+DLLTOOL \
+OBJDUMP \
+SHELL \
+ECHO \
+PATH_SEPARATOR \
+SED \
+GREP \
+EGREP \
+FGREP \
+LD \
+NM \
+LN_S \
+lt_SP2NL \
+lt_NL2SP \
+reload_flag \
+deplibs_check_method \
+file_magic_cmd \
+file_magic_glob \
+want_nocaseglob \
+sharedlib_from_linklib_cmd \
+AR \
+AR_FLAGS \
+archiver_list_spec \
+STRIP \
+RANLIB \
+CC \
+CFLAGS \
+compiler \
+lt_cv_sys_global_symbol_pipe \
+lt_cv_sys_global_symbol_to_cdecl \
+lt_cv_sys_global_symbol_to_c_name_address \
+lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \
+nm_file_list_spec \
+lt_prog_compiler_no_builtin_flag \
+lt_prog_compiler_pic \
+lt_prog_compiler_wl \
+lt_prog_compiler_static \
+lt_cv_prog_compiler_c_o \
+need_locks \
+MANIFEST_TOOL \
+DSYMUTIL \
+NMEDIT \
+LIPO \
+OTOOL \
+OTOOL64 \
+shrext_cmds \
+export_dynamic_flag_spec \
+whole_archive_flag_spec \
+compiler_needs_object \
+with_gnu_ld \
+allow_undefined_flag \
+no_undefined_flag \
+hardcode_libdir_flag_spec \
+hardcode_libdir_separator \
+exclude_expsyms \
+include_expsyms \
+file_list_spec \
+variables_saved_for_relink \
+libname_spec \
+library_names_spec \
+soname_spec \
+install_override_mode \
+finish_eval \
+old_striplib \
+striplib \
+compiler_lib_search_dirs \
+predep_objects \
+postdep_objects \
+predeps \
+postdeps \
+compiler_lib_search_path \
+LD_CXX \
+reload_flag_CXX \
+compiler_CXX \
+lt_prog_compiler_no_builtin_flag_CXX \
+lt_prog_compiler_pic_CXX \
+lt_prog_compiler_wl_CXX \
+lt_prog_compiler_static_CXX \
+lt_cv_prog_compiler_c_o_CXX \
+export_dynamic_flag_spec_CXX \
+whole_archive_flag_spec_CXX \
+compiler_needs_object_CXX \
+with_gnu_ld_CXX \
+allow_undefined_flag_CXX \
+no_undefined_flag_CXX \
+hardcode_libdir_flag_spec_CXX \
+hardcode_libdir_separator_CXX \
+exclude_expsyms_CXX \
+include_expsyms_CXX \
+file_list_spec_CXX \
+compiler_lib_search_dirs_CXX \
+predep_objects_CXX \
+postdep_objects_CXX \
+predeps_CXX \
+postdeps_CXX \
+compiler_lib_search_path_CXX; do
+    case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in
+    *[\\\\\\\`\\"\\\$]*)
+      eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\""
+      ;;
+    *)
+      eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\""
+      ;;
+    esac
+done
+
+# Double-quote double-evaled strings.
+for var in reload_cmds \
+old_postinstall_cmds \
+old_postuninstall_cmds \
+old_archive_cmds \
+extract_expsyms_cmds \
+old_archive_from_new_cmds \
+old_archive_from_expsyms_cmds \
+archive_cmds \
+archive_expsym_cmds \
+module_cmds \
+module_expsym_cmds \
+export_symbols_cmds \
+prelink_cmds \
+postlink_cmds \
+postinstall_cmds \
+postuninstall_cmds \
+finish_cmds \
+sys_lib_search_path_spec \
+sys_lib_dlsearch_path_spec \
+reload_cmds_CXX \
+old_archive_cmds_CXX \
+old_archive_from_new_cmds_CXX \
+old_archive_from_expsyms_cmds_CXX \
+archive_cmds_CXX \
+archive_expsym_cmds_CXX \
+module_cmds_CXX \
+module_expsym_cmds_CXX \
+export_symbols_cmds_CXX \
+prelink_cmds_CXX \
+postlink_cmds_CXX; do
+    case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in
+    *[\\\\\\\`\\"\\\$]*)
+      eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\""
+      ;;
+    *)
+      eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\""
+      ;;
+    esac
+done
+
+ac_aux_dir='$ac_aux_dir'
+xsi_shell='$xsi_shell'
+lt_shell_append='$lt_shell_append'
+
+# See if we are running on zsh, and set the options which allow our
+# commands through without removal of \ escapes INIT.
+if test -n "\${ZSH_VERSION+set}" ; then
+   setopt NO_GLOB_SUBST
+fi
+
+
+    PACKAGE='$PACKAGE'
+    VERSION='$VERSION'
+    TIMESTAMP='$TIMESTAMP'
+    RM='$RM'
+    ofile='$ofile'
+
+
+
+
+
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;;
+    "tests/atconfig") CONFIG_COMMANDS="$CONFIG_COMMANDS tests/atconfig" ;;
+    "tests/Makefile") CONFIG_FILES="$CONFIG_FILES tests/Makefile" ;;
+    "tests/atlocal") CONFIG_FILES="$CONFIG_FILES tests/atlocal" ;;
+    "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;;
+    "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;;
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "src/Makefile") CONFIG_FILES="$CONFIG_FILES src/Makefile" ;;
+    "igraph.pc") CONFIG_FILES="$CONFIG_FILES igraph.pc" ;;
+    "igraph_Info.plist") CONFIG_FILES="$CONFIG_FILES igraph_Info.plist" ;;
+    "doc/Makefile") CONFIG_FILES="$CONFIG_FILES doc/Makefile" ;;
+    "doc/book/Makefile") CONFIG_FILES="$CONFIG_FILES doc/book/Makefile" ;;
+    "interfaces/R/configure.in") CONFIG_FILES="$CONFIG_FILES interfaces/R/configure.in" ;;
+    "interfaces/R/Makefile") CONFIG_FILES="$CONFIG_FILES interfaces/R/Makefile" ;;
+    "interfaces/R/src/Makevars.win") CONFIG_FILES="$CONFIG_FILES interfaces/R/src/Makevars.win" ;;
+    "interfaces/R/DESCRIPTION") CONFIG_FILES="$CONFIG_FILES interfaces/R/DESCRIPTION" ;;
+    "interfaces/Makefile") CONFIG_FILES="$CONFIG_FILES interfaces/Makefile" ;;
+    "include/igraph_version.h") CONFIG_FILES="$CONFIG_FILES include/igraph_version.h" ;;
+    "include/igraph_threading.h") CONFIG_FILES="$CONFIG_FILES include/igraph_threading.h" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+  test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers
+  test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+
+  print line
+}
+
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+# Set up the scripts for CONFIG_HEADERS section.
+# No need to generate them if there are no CONFIG_HEADERS.
+# This happens for instance with `./config.status Makefile'.
+if test -n "$CONFIG_HEADERS"; then
+cat >"$ac_tmp/defines.awk" <<\_ACAWK ||
+BEGIN {
+_ACEOF
+
+# Transform confdefs.h into an awk script `defines.awk', embedded as
+# here-document in config.status, that substitutes the proper values into
+# config.h.in to produce config.h.
+
+# Create a delimiter string that does not exist in confdefs.h, to ease
+# handling of long lines.
+ac_delim='%!_!# '
+for ac_last_try in false false :; do
+  ac_tt=`sed -n "/$ac_delim/p" confdefs.h`
+  if test -z "$ac_tt"; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+
+# For the awk script, D is an array of macro values keyed by name,
+# likewise P contains macro parameters if any.  Preserve backslash
+# newline sequences.
+
+ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]*
+sed -n '
+s/.\{148\}/&'"$ac_delim"'/g
+t rset
+:rset
+s/^[	 ]*#[	 ]*define[	 ][	 ]*/ /
+t def
+d
+:def
+s/\\$//
+t bsnl
+s/["\\]/\\&/g
+s/^ \('"$ac_word_re"'\)\(([^()]*)\)[	 ]*\(.*\)/P["\1"]="\2"\
+D["\1"]=" \3"/p
+s/^ \('"$ac_word_re"'\)[	 ]*\(.*\)/D["\1"]=" \2"/p
+d
+:bsnl
+s/["\\]/\\&/g
+s/^ \('"$ac_word_re"'\)\(([^()]*)\)[	 ]*\(.*\)/P["\1"]="\2"\
+D["\1"]=" \3\\\\\\n"\\/p
+t cont
+s/^ \('"$ac_word_re"'\)[	 ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p
+t cont
+d
+:cont
+n
+s/.\{148\}/&'"$ac_delim"'/g
+t clear
+:clear
+s/\\$//
+t bsnlc
+s/["\\]/\\&/g; s/^/"/; s/$/"/p
+d
+:bsnlc
+s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p
+b cont
+' <confdefs.h | sed '
+s/'"$ac_delim"'/"\\\
+"/g' >>$CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  for (key in D) D_is_set[key] = 1
+  FS = ""
+}
+/^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ {
+  line = \$ 0
+  split(line, arg, " ")
+  if (arg[1] == "#") {
+    defundef = arg[2]
+    mac1 = arg[3]
+  } else {
+    defundef = substr(arg[1], 2)
+    mac1 = arg[2]
+  }
+  split(mac1, mac2, "(") #)
+  macro = mac2[1]
+  prefix = substr(line, 1, index(line, defundef) - 1)
+  if (D_is_set[macro]) {
+    # Preserve the white space surrounding the "#".
+    print prefix "define", macro P[macro] D[macro]
+    next
+  } else {
+    # Replace #undef with comments.  This is necessary, for example,
+    # in the case of _POSIX_SOURCE, which is predefined and required
+    # on some systems where configure will not decide to define it.
+    if (defundef == "undef") {
+      print "/*", prefix defundef, macro, "*/"
+      next
+    }
+  }
+}
+{ print }
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+  as_fn_error $? "could not setup config headers machinery" "$LINENO" 5
+fi # test -n "$CONFIG_HEADERS"
+
+
+eval set X "  :F $CONFIG_FILES  :H $CONFIG_HEADERS    :C $CONFIG_COMMANDS"
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  :H)
+  #
+  # CONFIG_HEADER
+  #
+  if test x"$ac_file" != x-; then
+    {
+      $as_echo "/* $configure_input  */" \
+      && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs"
+    } >"$ac_tmp/config.h" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+    if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5
+$as_echo "$as_me: $ac_file is unchanged" >&6;}
+    else
+      rm -f "$ac_file"
+      mv "$ac_tmp/config.h" "$ac_file" \
+	|| as_fn_error $? "could not create $ac_file" "$LINENO" 5
+    fi
+  else
+    $as_echo "/* $configure_input  */" \
+      && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \
+      || as_fn_error $? "could not create -" "$LINENO" 5
+  fi
+# Compute "$ac_file"'s index in $config_headers.
+_am_arg="$ac_file"
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" ||
+$as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$_am_arg" : 'X\(//\)[^/]' \| \
+	 X"$_am_arg" : 'X\(//\)$' \| \
+	 X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$_am_arg" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`/stamp-h$_am_stamp_count
+ ;;
+
+  :C)  { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5
+$as_echo "$as_me: executing $ac_file commands" >&6;}
+ ;;
+  esac
+
+
+  case $ac_file$ac_mode in
+    "tests/atconfig":C) cat >tests/atconfig <<ATEOF
+# Configurable variable values for building test suites.
+# Generated by $0.
+# Copyright (C) 2010 Free Software Foundation, Inc.
+
+# The test suite will define top_srcdir=$at_top_srcdir/../.. etc.
+at_testdir='tests'
+abs_builddir='$ac_abs_builddir'
+at_srcdir='$ac_srcdir'
+abs_srcdir='$ac_abs_srcdir'
+at_top_srcdir='$ac_top_srcdir'
+abs_top_srcdir='$ac_abs_top_srcdir'
+at_top_build_prefix='$ac_top_build_prefix'
+abs_top_builddir='$ac_abs_top_builddir'
+
+# Backward compatibility with Autotest <= 2.59b:
+at_top_builddir=\$at_top_build_prefix
+
+AUTOTEST_PATH='tests'
+
+SHELL=\${CONFIG_SHELL-'$SHELL'}
+ATEOF
+ ;;
+    "depfiles":C) test x"$AMDEP_TRUE" != x"" || {
+  # Autoconf 2.62 quotes --file arguments for eval, but not when files
+  # are listed without --file.  Let's play safe and only enable the eval
+  # if we detect the quoting.
+  case $CONFIG_FILES in
+  *\'*) eval set x "$CONFIG_FILES" ;;
+  *)   set x $CONFIG_FILES ;;
+  esac
+  shift
+  for mf
+  do
+    # Strip MF so we end up with the name of the file.
+    mf=`echo "$mf" | sed -e 's/:.*$//'`
+    # Check whether this is an Automake generated Makefile or not.
+    # We used to match only the files named `Makefile.in', but
+    # some people rename them; so instead we look at the file content.
+    # Grep'ing the first line is not enough: some people post-process
+    # each Makefile.in and add a new line on top of each file to say so.
+    # Grep'ing the whole file is not good either: AIX grep has a line
+    # limit of 2048, but all sed's we know have understand at least 4000.
+    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
+      dirpart=`$as_dirname -- "$mf" ||
+$as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$mf" : 'X\(//\)[^/]' \| \
+	 X"$mf" : 'X\(//\)$' \| \
+	 X"$mf" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$mf" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+    else
+      continue
+    fi
+    # Extract the definition of DEPDIR, am__include, and am__quote
+    # from the Makefile without running `make'.
+    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
+    test -z "$DEPDIR" && continue
+    am__include=`sed -n 's/^am__include = //p' < "$mf"`
+    test -z "am__include" && continue
+    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
+    # When using ansi2knr, U may be empty or an underscore; expand it
+    U=`sed -n 's/^U = //p' < "$mf"`
+    # Find all dependency output files, they are included files with
+    # $(DEPDIR) in their names.  We invoke sed twice because it is the
+    # simplest approach to changing $(DEPDIR) to its actual value in the
+    # expansion.
+    for file in `sed -n "
+      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g' -e 's/\$U/'"$U"'/g'`; do
+      # Make sure the directory exists.
+      test -f "$dirpart/$file" && continue
+      fdir=`$as_dirname -- "$file" ||
+$as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$file" : 'X\(//\)[^/]' \| \
+	 X"$file" : 'X\(//\)$' \| \
+	 X"$file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      as_dir=$dirpart/$fdir; as_fn_mkdir_p
+      # echo "creating $dirpart/$file"
+      echo '# dummy' > "$dirpart/$file"
+    done
+  done
+}
+ ;;
+    "libtool":C)
+
+    # See if we are running on zsh, and set the options which allow our
+    # commands through without removal of \ escapes.
+    if test -n "${ZSH_VERSION+set}" ; then
+      setopt NO_GLOB_SUBST
+    fi
+
+    cfgfile="${ofile}T"
+    trap "$RM \"$cfgfile\"; exit 1" 1 2 15
+    $RM "$cfgfile"
+
+    cat <<_LT_EOF >> "$cfgfile"
+#! $SHELL
+
+# `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services.
+# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION
+# Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`:
+# NOTE: Changes made to this file will be lost: look at ltmain.sh.
+#
+#   Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,
+#                 2006, 2007, 2008, 2009, 2010, 2011 Free Software
+#                 Foundation, Inc.
+#   Written by Gordon Matzigkeit, 1996
+#
+#   This file is part of GNU Libtool.
+#
+# GNU Libtool 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 2 of
+# the License, or (at your option) any later version.
+#
+# As a special exception to the GNU General Public License,
+# if you distribute this file as part of a program or library that
+# is built using GNU Libtool, you may include this file under the
+# same distribution terms that you use for the rest of that program.
+#
+# GNU Libtool 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 GNU Libtool; see the file COPYING.  If not, a copy
+# can be downloaded from http://www.gnu.org/licenses/gpl.html, or
+# obtained by writing to the Free Software Foundation, Inc.,
+# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
+
+
+# The names of the tagged configurations supported by this script.
+available_tags="CXX "
+
+# ### BEGIN LIBTOOL CONFIG
+
+# Assembler program.
+AS=$lt_AS
+
+# DLL creation program.
+DLLTOOL=$lt_DLLTOOL
+
+# Object dumper program.
+OBJDUMP=$lt_OBJDUMP
+
+# Which release of libtool.m4 was used?
+macro_version=$macro_version
+macro_revision=$macro_revision
+
+# Whether or not to build shared libraries.
+build_libtool_libs=$enable_shared
+
+# Whether or not to build static libraries.
+build_old_libs=$enable_static
+
+# What type of objects to build.
+pic_mode=$pic_mode
+
+# Whether or not to optimize for fast installation.
+fast_install=$enable_fast_install
+
+# Shell to use when invoking shell scripts.
+SHELL=$lt_SHELL
+
+# An echo program that protects backslashes.
+ECHO=$lt_ECHO
+
+# The PATH separator for the build system.
+PATH_SEPARATOR=$lt_PATH_SEPARATOR
+
+# The host system.
+host_alias=$host_alias
+host=$host
+host_os=$host_os
+
+# The build system.
+build_alias=$build_alias
+build=$build
+build_os=$build_os
+
+# A sed program that does not truncate output.
+SED=$lt_SED
+
+# Sed that helps us avoid accidentally triggering echo(1) options like -n.
+Xsed="\$SED -e 1s/^X//"
+
+# A grep program that handles long lines.
+GREP=$lt_GREP
+
+# An ERE matcher.
+EGREP=$lt_EGREP
+
+# A literal string matcher.
+FGREP=$lt_FGREP
+
+# A BSD- or MS-compatible name lister.
+NM=$lt_NM
+
+# Whether we need soft or hard links.
+LN_S=$lt_LN_S
+
+# What is the maximum length of a command?
+max_cmd_len=$max_cmd_len
+
+# Object file suffix (normally "o").
+objext=$ac_objext
+
+# Executable file suffix (normally "").
+exeext=$exeext
+
+# whether the shell understands "unset".
+lt_unset=$lt_unset
+
+# turn spaces into newlines.
+SP2NL=$lt_lt_SP2NL
+
+# turn newlines into spaces.
+NL2SP=$lt_lt_NL2SP
+
+# convert \$build file names to \$host format.
+to_host_file_cmd=$lt_cv_to_host_file_cmd
+
+# convert \$build files to toolchain format.
+to_tool_file_cmd=$lt_cv_to_tool_file_cmd
+
+# Method to check whether dependent libraries are shared objects.
+deplibs_check_method=$lt_deplibs_check_method
+
+# Command to use when deplibs_check_method = "file_magic".
+file_magic_cmd=$lt_file_magic_cmd
+
+# How to find potential files when deplibs_check_method = "file_magic".
+file_magic_glob=$lt_file_magic_glob
+
+# Find potential files using nocaseglob when deplibs_check_method = "file_magic".
+want_nocaseglob=$lt_want_nocaseglob
+
+# Command to associate shared and link libraries.
+sharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd
+
+# The archiver.
+AR=$lt_AR
+
+# Flags to create an archive.
+AR_FLAGS=$lt_AR_FLAGS
+
+# How to feed a file listing to the archiver.
+archiver_list_spec=$lt_archiver_list_spec
+
+# A symbol stripping program.
+STRIP=$lt_STRIP
+
+# Commands used to install an old-style archive.
+RANLIB=$lt_RANLIB
+old_postinstall_cmds=$lt_old_postinstall_cmds
+old_postuninstall_cmds=$lt_old_postuninstall_cmds
+
+# Whether to use a lock for old archive extraction.
+lock_old_archive_extraction=$lock_old_archive_extraction
+
+# A C compiler.
+LTCC=$lt_CC
+
+# LTCC compiler flags.
+LTCFLAGS=$lt_CFLAGS
+
+# Take the output of nm and produce a listing of raw symbols and C names.
+global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe
+
+# Transform the output of nm in a proper C declaration.
+global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl
+
+# Transform the output of nm in a C name address pair.
+global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address
+
+# Transform the output of nm in a C name address pair when lib prefix is needed.
+global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix
+
+# Specify filename containing input files for \$NM.
+nm_file_list_spec=$lt_nm_file_list_spec
+
+# The root where to search for dependent libraries,and in which our libraries should be installed.
+lt_sysroot=$lt_sysroot
+
+# The name of the directory that contains temporary libtool files.
+objdir=$objdir
+
+# Used to examine libraries when file_magic_cmd begins with "file".
+MAGIC_CMD=$MAGIC_CMD
+
+# Must we lock files when doing compilation?
+need_locks=$lt_need_locks
+
+# Manifest tool.
+MANIFEST_TOOL=$lt_MANIFEST_TOOL
+
+# Tool to manipulate archived DWARF debug symbol files on Mac OS X.
+DSYMUTIL=$lt_DSYMUTIL
+
+# Tool to change global to local symbols on Mac OS X.
+NMEDIT=$lt_NMEDIT
+
+# Tool to manipulate fat objects and archives on Mac OS X.
+LIPO=$lt_LIPO
+
+# ldd/readelf like tool for Mach-O binaries on Mac OS X.
+OTOOL=$lt_OTOOL
+
+# ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4.
+OTOOL64=$lt_OTOOL64
+
+# Old archive suffix (normally "a").
+libext=$libext
+
+# Shared library suffix (normally ".so").
+shrext_cmds=$lt_shrext_cmds
+
+# The commands to extract the exported symbol list from a shared archive.
+extract_expsyms_cmds=$lt_extract_expsyms_cmds
+
+# Variables whose values should be saved in libtool wrapper scripts and
+# restored at link time.
+variables_saved_for_relink=$lt_variables_saved_for_relink
+
+# Do we need the "lib" prefix for modules?
+need_lib_prefix=$need_lib_prefix
+
+# Do we need a version for libraries?
+need_version=$need_version
+
+# Library versioning type.
+version_type=$version_type
+
+# Shared library runtime path variable.
+runpath_var=$runpath_var
+
+# Shared library path variable.
+shlibpath_var=$shlibpath_var
+
+# Is shlibpath searched before the hard-coded library search path?
+shlibpath_overrides_runpath=$shlibpath_overrides_runpath
+
+# Format of library name prefix.
+libname_spec=$lt_libname_spec
+
+# List of archive names.  First name is the real one, the rest are links.
+# The last name is the one that the linker finds with -lNAME
+library_names_spec=$lt_library_names_spec
+
+# The coded name of the library, if different from the real name.
+soname_spec=$lt_soname_spec
+
+# Permission mode override for installation of shared libraries.
+install_override_mode=$lt_install_override_mode
+
+# Command to use after installation of a shared archive.
+postinstall_cmds=$lt_postinstall_cmds
+
+# Command to use after uninstallation of a shared archive.
+postuninstall_cmds=$lt_postuninstall_cmds
+
+# Commands used to finish a libtool library installation in a directory.
+finish_cmds=$lt_finish_cmds
+
+# As "finish_cmds", except a single script fragment to be evaled but
+# not shown.
+finish_eval=$lt_finish_eval
+
+# Whether we should hardcode library paths into libraries.
+hardcode_into_libs=$hardcode_into_libs
+
+# Compile-time system search path for libraries.
+sys_lib_search_path_spec=$lt_sys_lib_search_path_spec
+
+# Run-time system search path for libraries.
+sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec
+
+# Whether dlopen is supported.
+dlopen_support=$enable_dlopen
+
+# Whether dlopen of programs is supported.
+dlopen_self=$enable_dlopen_self
+
+# Whether dlopen of statically linked programs is supported.
+dlopen_self_static=$enable_dlopen_self_static
+
+# Commands to strip libraries.
+old_striplib=$lt_old_striplib
+striplib=$lt_striplib
+
+
+# The linker used to build libraries.
+LD=$lt_LD
+
+# How to create reloadable object files.
+reload_flag=$lt_reload_flag
+reload_cmds=$lt_reload_cmds
+
+# Commands used to build an old-style archive.
+old_archive_cmds=$lt_old_archive_cmds
+
+# A language specific compiler.
+CC=$lt_compiler
+
+# Is the compiler the GNU compiler?
+with_gcc=$GCC
+
+# Compiler flag to turn off builtin functions.
+no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag
+
+# Additional compiler flags for building library objects.
+pic_flag=$lt_lt_prog_compiler_pic
+
+# How to pass a linker flag through the compiler.
+wl=$lt_lt_prog_compiler_wl
+
+# Compiler flag to prevent dynamic linking.
+link_static_flag=$lt_lt_prog_compiler_static
+
+# Does compiler simultaneously support -c and -o options?
+compiler_c_o=$lt_lt_cv_prog_compiler_c_o
+
+# Whether or not to add -lc for building shared libraries.
+build_libtool_need_lc=$archive_cmds_need_lc
+
+# Whether or not to disallow shared libs when runtime libs are static.
+allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes
+
+# Compiler flag to allow reflexive dlopens.
+export_dynamic_flag_spec=$lt_export_dynamic_flag_spec
+
+# Compiler flag to generate shared objects directly from archives.
+whole_archive_flag_spec=$lt_whole_archive_flag_spec
+
+# Whether the compiler copes with passing no objects directly.
+compiler_needs_object=$lt_compiler_needs_object
+
+# Create an old-style archive from a shared archive.
+old_archive_from_new_cmds=$lt_old_archive_from_new_cmds
+
+# Create a temporary old-style archive to link instead of a shared archive.
+old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds
+
+# Commands used to build a shared archive.
+archive_cmds=$lt_archive_cmds
+archive_expsym_cmds=$lt_archive_expsym_cmds
+
+# Commands used to build a loadable module if different from building
+# a shared archive.
+module_cmds=$lt_module_cmds
+module_expsym_cmds=$lt_module_expsym_cmds
+
+# Whether we are building with GNU ld or not.
+with_gnu_ld=$lt_with_gnu_ld
+
+# Flag that allows shared libraries with undefined symbols to be built.
+allow_undefined_flag=$lt_allow_undefined_flag
+
+# Flag that enforces no undefined symbols.
+no_undefined_flag=$lt_no_undefined_flag
+
+# Flag to hardcode \$libdir into a binary during linking.
+# This must work even if \$libdir does not exist
+hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec
+
+# Whether we need a single "-rpath" flag with a separated argument.
+hardcode_libdir_separator=$lt_hardcode_libdir_separator
+
+# Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes
+# DIR into the resulting binary.
+hardcode_direct=$hardcode_direct
+
+# Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes
+# DIR into the resulting binary and the resulting library dependency is
+# "absolute",i.e impossible to change by setting \${shlibpath_var} if the
+# library is relocated.
+hardcode_direct_absolute=$hardcode_direct_absolute
+
+# Set to "yes" if using the -LDIR flag during linking hardcodes DIR
+# into the resulting binary.
+hardcode_minus_L=$hardcode_minus_L
+
+# Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR
+# into the resulting binary.
+hardcode_shlibpath_var=$hardcode_shlibpath_var
+
+# Set to "yes" if building a shared library automatically hardcodes DIR
+# into the library and all subsequent libraries and executables linked
+# against it.
+hardcode_automatic=$hardcode_automatic
+
+# Set to yes if linker adds runtime paths of dependent libraries
+# to runtime path list.
+inherit_rpath=$inherit_rpath
+
+# Whether libtool must link a program against all its dependency libraries.
+link_all_deplibs=$link_all_deplibs
+
+# Set to "yes" if exported symbols are required.
+always_export_symbols=$always_export_symbols
+
+# The commands to list exported symbols.
+export_symbols_cmds=$lt_export_symbols_cmds
+
+# Symbols that should not be listed in the preloaded symbols.
+exclude_expsyms=$lt_exclude_expsyms
+
+# Symbols that must always be exported.
+include_expsyms=$lt_include_expsyms
+
+# Commands necessary for linking programs (against libraries) with templates.
+prelink_cmds=$lt_prelink_cmds
+
+# Commands necessary for finishing linking programs.
+postlink_cmds=$lt_postlink_cmds
+
+# Specify filename containing input files.
+file_list_spec=$lt_file_list_spec
+
+# How to hardcode a shared library path into an executable.
+hardcode_action=$hardcode_action
+
+# The directories searched by this compiler when creating a shared library.
+compiler_lib_search_dirs=$lt_compiler_lib_search_dirs
+
+# Dependencies to place before and after the objects being linked to
+# create a shared library.
+predep_objects=$lt_predep_objects
+postdep_objects=$lt_postdep_objects
+predeps=$lt_predeps
+postdeps=$lt_postdeps
+
+# The library search path used internally by the compiler when linking
+# a shared library.
+compiler_lib_search_path=$lt_compiler_lib_search_path
+
+# ### END LIBTOOL CONFIG
+
+_LT_EOF
+
+  case $host_os in
+  aix3*)
+    cat <<\_LT_EOF >> "$cfgfile"
+# AIX sometimes has problems with the GCC collect2 program.  For some
+# reason, if we set the COLLECT_NAMES environment variable, the problems
+# vanish in a puff of smoke.
+if test "X${COLLECT_NAMES+set}" != Xset; then
+  COLLECT_NAMES=
+  export COLLECT_NAMES
+fi
+_LT_EOF
+    ;;
+  esac
+
+
+ltmain="$ac_aux_dir/ltmain.sh"
+
+
+  # We use sed instead of cat because bash on DJGPP gets confused if
+  # if finds mixed CR/LF and LF-only lines.  Since sed operates in
+  # text mode, it properly converts lines to CR/LF.  This bash problem
+  # is reportedly fixed, but why not run on old versions too?
+  sed '$q' "$ltmain" >> "$cfgfile" \
+     || (rm -f "$cfgfile"; exit 1)
+
+  if test x"$xsi_shell" = xyes; then
+  sed -e '/^func_dirname ()$/,/^} # func_dirname /c\
+func_dirname ()\
+{\
+\    case ${1} in\
+\      */*) func_dirname_result="${1%/*}${2}" ;;\
+\      *  ) func_dirname_result="${3}" ;;\
+\    esac\
+} # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_basename ()$/,/^} # func_basename /c\
+func_basename ()\
+{\
+\    func_basename_result="${1##*/}"\
+} # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\
+func_dirname_and_basename ()\
+{\
+\    case ${1} in\
+\      */*) func_dirname_result="${1%/*}${2}" ;;\
+\      *  ) func_dirname_result="${3}" ;;\
+\    esac\
+\    func_basename_result="${1##*/}"\
+} # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_stripname ()$/,/^} # func_stripname /c\
+func_stripname ()\
+{\
+\    # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\
+\    # positional parameters, so assign one to ordinary parameter first.\
+\    func_stripname_result=${3}\
+\    func_stripname_result=${func_stripname_result#"${1}"}\
+\    func_stripname_result=${func_stripname_result%"${2}"}\
+} # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\
+func_split_long_opt ()\
+{\
+\    func_split_long_opt_name=${1%%=*}\
+\    func_split_long_opt_arg=${1#*=}\
+} # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\
+func_split_short_opt ()\
+{\
+\    func_split_short_opt_arg=${1#??}\
+\    func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\
+} # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\
+func_lo2o ()\
+{\
+\    case ${1} in\
+\      *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\
+\      *)    func_lo2o_result=${1} ;;\
+\    esac\
+} # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_xform ()$/,/^} # func_xform /c\
+func_xform ()\
+{\
+    func_xform_result=${1%.*}.lo\
+} # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_arith ()$/,/^} # func_arith /c\
+func_arith ()\
+{\
+    func_arith_result=$(( $* ))\
+} # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_len ()$/,/^} # func_len /c\
+func_len ()\
+{\
+    func_len_result=${#1}\
+} # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+fi
+
+if test x"$lt_shell_append" = xyes; then
+  sed -e '/^func_append ()$/,/^} # func_append /c\
+func_append ()\
+{\
+    eval "${1}+=\\${2}"\
+} # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\
+func_append_quoted ()\
+{\
+\    func_quote_for_eval "${2}"\
+\    eval "${1}+=\\\\ \\$func_quote_for_eval_result"\
+} # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \
+  && mv -f "$cfgfile.tmp" "$cfgfile" \
+    || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+test 0 -eq $? || _lt_function_replace_fail=:
+
+
+  # Save a `func_append' function call where possible by direct use of '+='
+  sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \
+    && mv -f "$cfgfile.tmp" "$cfgfile" \
+      || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+  test 0 -eq $? || _lt_function_replace_fail=:
+else
+  # Save a `func_append' function call even when '+=' is not available
+  sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \
+    && mv -f "$cfgfile.tmp" "$cfgfile" \
+      || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp")
+  test 0 -eq $? || _lt_function_replace_fail=:
+fi
+
+if test x"$_lt_function_replace_fail" = x":"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5
+$as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;}
+fi
+
+
+   mv -f "$cfgfile" "$ofile" ||
+    (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile")
+  chmod +x "$ofile"
+
+
+    cat <<_LT_EOF >> "$ofile"
+
+# ### BEGIN LIBTOOL TAG CONFIG: CXX
+
+# The linker used to build libraries.
+LD=$lt_LD_CXX
+
+# How to create reloadable object files.
+reload_flag=$lt_reload_flag_CXX
+reload_cmds=$lt_reload_cmds_CXX
+
+# Commands used to build an old-style archive.
+old_archive_cmds=$lt_old_archive_cmds_CXX
+
+# A language specific compiler.
+CC=$lt_compiler_CXX
+
+# Is the compiler the GNU compiler?
+with_gcc=$GCC_CXX
+
+# Compiler flag to turn off builtin functions.
+no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX
+
+# Additional compiler flags for building library objects.
+pic_flag=$lt_lt_prog_compiler_pic_CXX
+
+# How to pass a linker flag through the compiler.
+wl=$lt_lt_prog_compiler_wl_CXX
+
+# Compiler flag to prevent dynamic linking.
+link_static_flag=$lt_lt_prog_compiler_static_CXX
+
+# Does compiler simultaneously support -c and -o options?
+compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX
+
+# Whether or not to add -lc for building shared libraries.
+build_libtool_need_lc=$archive_cmds_need_lc_CXX
+
+# Whether or not to disallow shared libs when runtime libs are static.
+allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX
+
+# Compiler flag to allow reflexive dlopens.
+export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX
+
+# Compiler flag to generate shared objects directly from archives.
+whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX
+
+# Whether the compiler copes with passing no objects directly.
+compiler_needs_object=$lt_compiler_needs_object_CXX
+
+# Create an old-style archive from a shared archive.
+old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX
+
+# Create a temporary old-style archive to link instead of a shared archive.
+old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX
+
+# Commands used to build a shared archive.
+archive_cmds=$lt_archive_cmds_CXX
+archive_expsym_cmds=$lt_archive_expsym_cmds_CXX
+
+# Commands used to build a loadable module if different from building
+# a shared archive.
+module_cmds=$lt_module_cmds_CXX
+module_expsym_cmds=$lt_module_expsym_cmds_CXX
+
+# Whether we are building with GNU ld or not.
+with_gnu_ld=$lt_with_gnu_ld_CXX
+
+# Flag that allows shared libraries with undefined symbols to be built.
+allow_undefined_flag=$lt_allow_undefined_flag_CXX
+
+# Flag that enforces no undefined symbols.
+no_undefined_flag=$lt_no_undefined_flag_CXX
+
+# Flag to hardcode \$libdir into a binary during linking.
+# This must work even if \$libdir does not exist
+hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX
+
+# Whether we need a single "-rpath" flag with a separated argument.
+hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX
+
+# Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes
+# DIR into the resulting binary.
+hardcode_direct=$hardcode_direct_CXX
+
+# Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes
+# DIR into the resulting binary and the resulting library dependency is
+# "absolute",i.e impossible to change by setting \${shlibpath_var} if the
+# library is relocated.
+hardcode_direct_absolute=$hardcode_direct_absolute_CXX
+
+# Set to "yes" if using the -LDIR flag during linking hardcodes DIR
+# into the resulting binary.
+hardcode_minus_L=$hardcode_minus_L_CXX
+
+# Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR
+# into the resulting binary.
+hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX
+
+# Set to "yes" if building a shared library automatically hardcodes DIR
+# into the library and all subsequent libraries and executables linked
+# against it.
+hardcode_automatic=$hardcode_automatic_CXX
+
+# Set to yes if linker adds runtime paths of dependent libraries
+# to runtime path list.
+inherit_rpath=$inherit_rpath_CXX
+
+# Whether libtool must link a program against all its dependency libraries.
+link_all_deplibs=$link_all_deplibs_CXX
+
+# Set to "yes" if exported symbols are required.
+always_export_symbols=$always_export_symbols_CXX
+
+# The commands to list exported symbols.
+export_symbols_cmds=$lt_export_symbols_cmds_CXX
+
+# Symbols that should not be listed in the preloaded symbols.
+exclude_expsyms=$lt_exclude_expsyms_CXX
+
+# Symbols that must always be exported.
+include_expsyms=$lt_include_expsyms_CXX
+
+# Commands necessary for linking programs (against libraries) with templates.
+prelink_cmds=$lt_prelink_cmds_CXX
+
+# Commands necessary for finishing linking programs.
+postlink_cmds=$lt_postlink_cmds_CXX
+
+# Specify filename containing input files.
+file_list_spec=$lt_file_list_spec_CXX
+
+# How to hardcode a shared library path into an executable.
+hardcode_action=$hardcode_action_CXX
+
+# The directories searched by this compiler when creating a shared library.
+compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX
+
+# Dependencies to place before and after the objects being linked to
+# create a shared library.
+predep_objects=$lt_predep_objects_CXX
+postdep_objects=$lt_postdep_objects_CXX
+predeps=$lt_predeps_CXX
+postdeps=$lt_postdeps_CXX
+
+# The library search path used internally by the compiler when linking
+# a shared library.
+compiler_lib_search_path=$lt_compiler_lib_search_path_CXX
+
+# ### END LIBTOOL TAG CONFIG: CXX
+_LT_EOF
+
+ ;;
+
+  esac
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: igraph successfully configured." >&5
+$as_echo "igraph successfully configured." >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   GraphML format support -- $graphml_support" >&5
+$as_echo "  GraphML format support -- $graphml_support" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   GMP library support    -- $gmp_support" >&5
+$as_echo "  GMP library support    -- $gmp_support" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   GLPK library support   -- $glpk_support" >&5
+$as_echo "  GLPK library support   -- $glpk_support" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Thread-local storage   -- $tls_support" >&5
+$as_echo "  Thread-local storage   -- $tls_support" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Use internal ARPACK    -- $internal_arpack" >&5
+$as_echo "  Use internal ARPACK    -- $internal_arpack" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Use internal LAPACK    -- $internal_lapack" >&5
+$as_echo "  Use internal LAPACK    -- $internal_lapack" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Use internal BLAS      -- $internal_blas" >&5
+$as_echo "  Use internal BLAS      -- $internal_blas" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Use internal F2C       -- $internal_f2c" >&5
+$as_echo "  Use internal F2C       -- $internal_f2c" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Use internal GLPK      -- $internal_glpk" >&5
+$as_echo "  Use internal GLPK      -- $internal_glpk" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Debug build            -- $debug" >&5
+$as_echo "  Debug build            -- $debug" >&6; }
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result:   Profiling              -- $use_gprof" >&5
+$as_echo "  Profiling              -- $use_gprof" >&6; }
diff -Nru igraph-0.6.5~quantal1/debian/bzr-builder.manifest igraph-0.6.5/debian/bzr-builder.manifest
--- igraph-0.6.5~quantal1/debian/bzr-builder.manifest	2013-02-28 10:02:44.000000000 +0000
+++ igraph-0.6.5/debian/bzr-builder.manifest	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-# bzr-builder format 0.3 deb-version 0.6.5
-lp:igraph/0.6-main revid:csardi.gabor@gmail.com-20130227164532-hxahtsqjmehthfyq
diff -Nru igraph-0.6.5~quantal1/debian/changelog igraph-0.6.5/debian/changelog
--- igraph-0.6.5~quantal1/debian/changelog	2013-02-28 10:02:44.000000000 +0000
+++ igraph-0.6.5/debian/changelog	2013-03-06 09:03:23.000000000 +0000
@@ -1,10 +1,36 @@
-igraph (0.6.5~quantal1) quantal; urgency=low
+igraph (0.6.5-2) lucid; urgency=low
 
-  * Auto build.
+  * Fixing build problems on lucid.
 
- -- Tamás Nepusz <ntamas@gmail.com>  Thu, 28 Feb 2013 10:02:44 +0000
+ -- Tamas Nepusz <ntamas@gmail.com>  Wed, 6 Mar 2013 09:47:44 +0100
 
-igraph (0.6) unstable; urgency=low
+igraph (0.6.5-1) lucid; urgency=low
+
+  * Updated package for igraph 0.6.5.
+
+ -- Tamas Nepusz <ntamas@gmail.com>  Thu, 28 Feb 2013 11:03:20 +0100
+
+igraph (0.6-3) lucid; urgency=low
+
+  * Fixing build problems with dh --with python2.
+
+ -- Tamas Nepusz <ntamas@gmail.com>  Tue, 26 Jun 2012 19:17:00 +0200
+
+igraph (0.6-2) lucid; urgency=low
+
+  * Removed a few unnecessary files from the generated packages.
+  * info document is not created any more.
+  * Using dh instead of the old rules file.
+
+ -- Tamas Nepusz <ntamas@gmail.com>  Tue, 26 Jun 2012 17:34:00 +0200
+
+igraph (0.6-1) lucid; urgency=low
+
+  * Added Debian revision; minor packaging fixes to make Lintian happy.
+
+ -- Tamas Nepusz <ntamas@gmail.com>  Tue, 26 Jun 2012 13:17:00 +0200
+
+igraph (0.6) lucid; urgency=low
 
   * Initial release.
 
diff -Nru igraph-0.6.5~quantal1/debian/control igraph-0.6.5/debian/control
--- igraph-0.6.5~quantal1/debian/control	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/debian/control	2013-03-06 09:03:23.000000000 +0000
@@ -2,10 +2,10 @@
 Section: libs
 Priority: optional
 Maintainer: Tamas Nepusz <ntamas@gmail.com>
-Build-Depends: debhelper (>= 7), libtool, libxml2-dev, libgmp3-dev, libarpack2-dev,
+Build-Depends: debhelper (>= 7.0.50~), libtool, libxml2-dev, libgmp3-dev, libarpack2-dev,
  libblas-dev, liblapack-dev, libglpk-dev, automake, flex, bison,
  source-highlight, docbook2x, libxml2-utils, python (>= 2.5)
-Standards-Version: 3.8.3
+Standards-Version: 3.9.3
 Homepage: http://igraph.sourceforge.net
 
 Package: libigraph
@@ -17,6 +17,7 @@
 
 Package: libigraph-dev
 Architecture: all
+Section: libdevel
 Depends: libigraph0-dev, ${misc:Depends}
 Description: Transitional dummy package for libigraph0-dev
  This is a dummy package to ease the transition from libigraph-dev to
@@ -28,7 +29,7 @@
 Replaces: libigraph (<< 0.5.3-1)
 Conflicts: libigraph (<< 0.5.3-1)
 Provides: libigraph
-Description: A library for creating and manipulating graphs
+Description: Library for creating and manipulating graphs
  igraph is a library for creating and manipulating graphs.
  It is intended to be as powerful (ie. fast) as possible to enable the
  analysis of large graphs.
@@ -39,7 +40,7 @@
 Architecture: any
 Section: libdevel
 Depends: libigraph0 (= ${binary:Version}), ${misc:Depends}
-Description: A library for creating and manipulating graphs - development files
+Description: Library for creating and manipulating graphs - development files
  igraph is a library for creating and manipulating graphs.
  It is intended to be as powerful (ie. fast) as possible to enable the
  analysis of large graphs.
diff -Nru igraph-0.6.5~quantal1/debian/libigraph0-dev.info igraph-0.6.5/debian/libigraph0-dev.info
--- igraph-0.6.5~quantal1/debian/libigraph0-dev.info	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/debian/libigraph0-dev.info	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-doc/igraph.info
diff -Nru igraph-0.6.5~quantal1/debian/libigraph0-dev.install igraph-0.6.5/debian/libigraph0-dev.install
--- igraph-0.6.5~quantal1/debian/libigraph0-dev.install	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/debian/libigraph0-dev.install	2013-03-06 09:03:23.000000000 +0000
@@ -1,5 +1,4 @@
 usr/include/igraph/*.h
 usr/lib/libigraph.so
 usr/lib/libigraph.a
-usr/lib/libigraph.la
 usr/lib/pkgconfig/igraph.pc
diff -Nru igraph-0.6.5~quantal1/debian/rules igraph-0.6.5/debian/rules
--- igraph-0.6.5~quantal1/debian/rules	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/debian/rules	2013-03-06 09:03:23.000000000 +0000
@@ -1,86 +1,16 @@
 #!/usr/bin/make -f
+# -*- makefile -*-
+# Sample debian/rules that uses debhelper.
+# This file was originally written by Joey Hess and Craig Small.
+# As a special exception, when this file is copied by dh-make into a
+# dh-make output file, you may use that output file without restriction.
+# This special exception was added by Craig Small in version 0.37 of dh-make.
 
 # Uncomment this to turn on verbose mode.
 #export DH_VERBOSE=1
 
-# These are used for cross-compiling and for saving the configure script
-# from having to guess our platform (since we know it already)
-DEB_HOST_GNU_TYPE   ?= $(shell dpkg-architecture -qDEB_HOST_GNU_TYPE)
-DEB_BUILD_GNU_TYPE  ?= $(shell dpkg-architecture -qDEB_BUILD_GNU_TYPE)
+%:
+	dh $@
 
-ifneq (,$(findstring noopt,$(DEB_BUILD_OPTIONS)))
-	CFLAGS += -O0
-else
-	CFLAGS += -O2
-endif
-ifeq (,$(findstring nostrip,$(DEB_BUILD_OPTIONS)))
-	INSTALL_PROGRAM += -s
-endif
-
-configure: configure-stamp
-configure-stamp:
-	dh_testdir
-	if [ ! -f configure ]; then ./bootstrap.sh; fi
-	./configure --prefix=/usr --mandir=\$${prefix}/share/man --infodir=\$${prefix}/share/info --host=$(DEB_HOST_GNU_TYPE) --build=$(DEB_BUILD_GNU_TYPE) --sysconfdir=/etc --with-external-blas --with-external-lapack --with-external-arpack --with-external-f2c --disable-tls
-	touch configure-stamp
-
-build: configure-stamp build-stamp
-build-stamp:
-	dh_testdir
-	$(MAKE)
-	[ -f doc/igraph.info ] || ( cd doc && $(MAKE) igraph.info )
-	touch build-stamp
-
-clean:
-	dh_testdir
-	dh_testroot
-	rm -f build-stamp configure-stamp
-	# [ ! -f doc/Makefile ] || ( cd doc && $(MAKE) distclean )
-	[ ! -f Makefile ] || $(MAKE) distclean
-	dh_clean
-
-install: build
-	dh_testdir
-	dh_testroot
-	dh_prep
-	dh_installdirs
-	$(MAKE) install prefix=$(CURDIR)/debian/tmp/usr
-
-# Build architecture-independent files here.
-binary-indep: build install
-# We have nothing to do by default.
-
-# Build architecture-dependent files here.
-binary-arch: build install
-	dh_testdir
-	dh_testroot
-
-	dh_install --fail-missing
-
-#	dh_installdebconf	
-	dh_installdocs
-	dh_installexamples
-#	dh_installmenu
-#	dh_installlogrotate
-#	dh_installemacsen
-#	dh_installpam
-#	dh_installmime
-#	dh_installinit
-#	dh_installcron
-	dh_installman
-	dh_installinfo
-	dh_installchangelogs ChangeLog
-	dh_link
-	dh_strip
-	dh_compress
-	dh_fixperms
-	dh_makeshlibs
-	dh_shlibdeps
-	dh_gencontrol
-#	dh_python
-	dh_installdeb
-	dh_md5sums
-	dh_builddeb
-
-binary: binary-indep binary-arch
-.PHONY: build clean binary-indep binary-arch binary install configure
+override_dh_auto_configure:
+	dh_auto_configure -- --with-external-blas --with-external-lapack --with-external-arpack --with-external-f2c --with-external-glpk --disable-tls
diff -Nru igraph-0.6.5~quantal1/debian/source/format igraph-0.6.5/debian/source/format
--- igraph-0.6.5~quantal1/debian/source/format	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/debian/source/format	2013-03-06 22:24:17.436465971 +0000
@@ -0,0 +1 @@
+3.0 (quilt)
diff -Nru igraph-0.6.5~quantal1/depcomp igraph-0.6.5/depcomp
--- igraph-0.6.5~quantal1/depcomp	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/depcomp	2013-03-03 01:29:39.000000000 +0000
@@ -0,0 +1,688 @@
+#! /bin/sh
+# depcomp - compile a program generating dependencies as side-effects
+
+scriptversion=2011-12-04.11; # UTC
+
+# Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007, 2009, 2010,
+# 2011 Free Software Foundation, Inc.
+
+# 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 2, 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/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.
+
+case $1 in
+  '')
+     echo "$0: No command.  Try \`$0 --help' for more information." 1>&2
+     exit 1;
+     ;;
+  -h | --h*)
+    cat <<\EOF
+Usage: depcomp [--help] [--version] PROGRAM [ARGS]
+
+Run PROGRAMS ARGS to compile a file, generating dependencies
+as side-effects.
+
+Environment variables:
+  depmode     Dependency tracking mode.
+  source      Source file read by `PROGRAMS ARGS'.
+  object      Object file output by `PROGRAMS ARGS'.
+  DEPDIR      directory where to store dependencies.
+  depfile     Dependency file to output.
+  tmpdepfile  Temporary file to use when outputting dependencies.
+  libtool     Whether libtool is used (yes/no).
+
+Report bugs to <bug-automake@gnu.org>.
+EOF
+    exit $?
+    ;;
+  -v | --v*)
+    echo "depcomp $scriptversion"
+    exit $?
+    ;;
+esac
+
+if test -z "$depmode" || test -z "$source" || test -z "$object"; then
+  echo "depcomp: Variables source, object and depmode must be set" 1>&2
+  exit 1
+fi
+
+# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.
+depfile=${depfile-`echo "$object" |
+  sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`}
+tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
+
+rm -f "$tmpdepfile"
+
+# Some modes work just like other modes, but use different flags.  We
+# parameterize here, but still list the modes in the big case below,
+# to make depend.m4 easier to write.  Note that we *cannot* use a case
+# here, because this file can only contain one case statement.
+if test "$depmode" = hp; then
+  # HP compiler uses -M and no extra arg.
+  gccflag=-M
+  depmode=gcc
+fi
+
+if test "$depmode" = dashXmstdout; then
+   # This is just like dashmstdout with a different argument.
+   dashmflag=-xM
+   depmode=dashmstdout
+fi
+
+cygpath_u="cygpath -u -f -"
+if test "$depmode" = msvcmsys; then
+   # This is just like msvisualcpp but w/o cygpath translation.
+   # Just convert the backslash-escaped backslashes to single forward
+   # slashes to satisfy depend.m4
+   cygpath_u='sed s,\\\\,/,g'
+   depmode=msvisualcpp
+fi
+
+if test "$depmode" = msvc7msys; then
+   # This is just like msvc7 but w/o cygpath translation.
+   # Just convert the backslash-escaped backslashes to single forward
+   # slashes to satisfy depend.m4
+   cygpath_u='sed s,\\\\,/,g'
+   depmode=msvc7
+fi
+
+case "$depmode" in
+gcc3)
+## gcc 3 implements dependency tracking that does exactly what
+## we want.  Yay!  Note: for some reason libtool 1.4 doesn't like
+## it if -MD -MP comes after the -MF stuff.  Hmm.
+## Unfortunately, FreeBSD c89 acceptance of flags depends upon
+## the command line argument order; so add the flags where they
+## appear in depend2.am.  Note that the slowdown incurred here
+## affects only configure: in makefiles, %FASTDEP% shortcuts this.
+  for arg
+  do
+    case $arg in
+    -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;;
+    *)  set fnord "$@" "$arg" ;;
+    esac
+    shift # fnord
+    shift # $arg
+  done
+  "$@"
+  stat=$?
+  if test $stat -eq 0; then :
+  else
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  mv "$tmpdepfile" "$depfile"
+  ;;
+
+gcc)
+## There are various ways to get dependency output from gcc.  Here's
+## why we pick this rather obscure method:
+## - Don't want to use -MD because we'd like the dependencies to end
+##   up in a subdir.  Having to rename by hand is ugly.
+##   (We might end up doing this anyway to support other compilers.)
+## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
+##   -MM, not -M (despite what the docs say).
+## - Using -M directly means running the compiler twice (even worse
+##   than renaming).
+  if test -z "$gccflag"; then
+    gccflag=-MD,
+  fi
+  "$@" -Wp,"$gccflag$tmpdepfile"
+  stat=$?
+  if test $stat -eq 0; then :
+  else
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  rm -f "$depfile"
+  echo "$object : \\" > "$depfile"
+  alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
+## The second -e expression handles DOS-style file names with drive letters.
+  sed -e 's/^[^:]*: / /' \
+      -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
+## This next piece of magic avoids the `deleted header file' problem.
+## The problem is that when a header file which appears in a .P file
+## is deleted, the dependency causes make to die (because there is
+## typically no way to rebuild the header).  We avoid this by adding
+## dummy dependencies for each header file.  Too bad gcc doesn't do
+## this for us directly.
+  tr ' ' '
+' < "$tmpdepfile" |
+## Some versions of gcc put a space before the `:'.  On the theory
+## that the space means something, we add a space to the output as
+## well.  hp depmode also adds that space, but also prefixes the VPATH
+## to the object.  Take care to not repeat it in the output.
+## Some versions of the HPUX 10.20 sed can't process this invocation
+## correctly.  Breaking it into two sed invocations is a workaround.
+    sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \
+      | sed -e 's/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+hp)
+  # This case exists only to let depend.m4 do its work.  It works by
+  # looking at the text of this script.  This case will never be run,
+  # since it is checked for above.
+  exit 1
+  ;;
+
+sgi)
+  if test "$libtool" = yes; then
+    "$@" "-Wp,-MDupdate,$tmpdepfile"
+  else
+    "$@" -MDupdate "$tmpdepfile"
+  fi
+  stat=$?
+  if test $stat -eq 0; then :
+  else
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  rm -f "$depfile"
+
+  if test -f "$tmpdepfile"; then  # yes, the sourcefile depend on other files
+    echo "$object : \\" > "$depfile"
+
+    # Clip off the initial element (the dependent).  Don't try to be
+    # clever and replace this with sed code, as IRIX sed won't handle
+    # lines with more than a fixed number of characters (4096 in
+    # IRIX 6.2 sed, 8192 in IRIX 6.5).  We also remove comment lines;
+    # the IRIX cc adds comments like `#:fec' to the end of the
+    # dependency line.
+    tr ' ' '
+' < "$tmpdepfile" \
+    | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \
+    tr '
+' ' ' >> "$depfile"
+    echo >> "$depfile"
+
+    # The second pass generates a dummy entry for each header file.
+    tr ' ' '
+' < "$tmpdepfile" \
+   | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \
+   >> "$depfile"
+  else
+    # The sourcefile does not contain any dependencies, so just
+    # store a dummy comment line, to avoid errors with the Makefile
+    # "include basename.Plo" scheme.
+    echo "#dummy" > "$depfile"
+  fi
+  rm -f "$tmpdepfile"
+  ;;
+
+aix)
+  # The C for AIX Compiler uses -M and outputs the dependencies
+  # in a .u file.  In older versions, this file always lives in the
+  # current directory.  Also, the AIX compiler puts `$object:' at the
+  # start of each line; $object doesn't have directory information.
+  # Version 6 uses the directory in both cases.
+  dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
+  test "x$dir" = "x$object" && dir=
+  base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
+  if test "$libtool" = yes; then
+    tmpdepfile1=$dir$base.u
+    tmpdepfile2=$base.u
+    tmpdepfile3=$dir.libs/$base.u
+    "$@" -Wc,-M
+  else
+    tmpdepfile1=$dir$base.u
+    tmpdepfile2=$dir$base.u
+    tmpdepfile3=$dir$base.u
+    "$@" -M
+  fi
+  stat=$?
+
+  if test $stat -eq 0; then :
+  else
+    rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
+    exit $stat
+  fi
+
+  for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
+  do
+    test -f "$tmpdepfile" && break
+  done
+  if test -f "$tmpdepfile"; then
+    # Each line is of the form `foo.o: dependent.h'.
+    # Do two passes, one to just change these to
+    # `$object: dependent.h' and one to simply `dependent.h:'.
+    sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
+    # That's a tab and a space in the [].
+    sed -e 's,^.*\.[a-z]*:[	 ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
+  else
+    # The sourcefile does not contain any dependencies, so just
+    # store a dummy comment line, to avoid errors with the Makefile
+    # "include basename.Plo" scheme.
+    echo "#dummy" > "$depfile"
+  fi
+  rm -f "$tmpdepfile"
+  ;;
+
+icc)
+  # Intel's C compiler understands `-MD -MF file'.  However on
+  #    icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c
+  # ICC 7.0 will fill foo.d with something like
+  #    foo.o: sub/foo.c
+  #    foo.o: sub/foo.h
+  # which is wrong.  We want:
+  #    sub/foo.o: sub/foo.c
+  #    sub/foo.o: sub/foo.h
+  #    sub/foo.c:
+  #    sub/foo.h:
+  # ICC 7.1 will output
+  #    foo.o: sub/foo.c sub/foo.h
+  # and will wrap long lines using \ :
+  #    foo.o: sub/foo.c ... \
+  #     sub/foo.h ... \
+  #     ...
+
+  "$@" -MD -MF "$tmpdepfile"
+  stat=$?
+  if test $stat -eq 0; then :
+  else
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  rm -f "$depfile"
+  # Each line is of the form `foo.o: dependent.h',
+  # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
+  # Do two passes, one to just change these to
+  # `$object: dependent.h' and one to simply `dependent.h:'.
+  sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
+  # Some versions of the HPUX 10.20 sed can't process this invocation
+  # correctly.  Breaking it into two sed invocations is a workaround.
+  sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" |
+    sed -e 's/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+hp2)
+  # The "hp" stanza above does not work with aCC (C++) and HP's ia64
+  # compilers, which have integrated preprocessors.  The correct option
+  # to use with these is +Maked; it writes dependencies to a file named
+  # 'foo.d', which lands next to the object file, wherever that
+  # happens to be.
+  # Much of this is similar to the tru64 case; see comments there.
+  dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
+  test "x$dir" = "x$object" && dir=
+  base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
+  if test "$libtool" = yes; then
+    tmpdepfile1=$dir$base.d
+    tmpdepfile2=$dir.libs/$base.d
+    "$@" -Wc,+Maked
+  else
+    tmpdepfile1=$dir$base.d
+    tmpdepfile2=$dir$base.d
+    "$@" +Maked
+  fi
+  stat=$?
+  if test $stat -eq 0; then :
+  else
+     rm -f "$tmpdepfile1" "$tmpdepfile2"
+     exit $stat
+  fi
+
+  for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2"
+  do
+    test -f "$tmpdepfile" && break
+  done
+  if test -f "$tmpdepfile"; then
+    sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile"
+    # Add `dependent.h:' lines.
+    sed -ne '2,${
+	       s/^ *//
+	       s/ \\*$//
+	       s/$/:/
+	       p
+	     }' "$tmpdepfile" >> "$depfile"
+  else
+    echo "#dummy" > "$depfile"
+  fi
+  rm -f "$tmpdepfile" "$tmpdepfile2"
+  ;;
+
+tru64)
+   # The Tru64 compiler uses -MD to generate dependencies as a side
+   # effect.  `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'.
+   # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
+   # dependencies in `foo.d' instead, so we check for that too.
+   # Subdirectories are respected.
+   dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
+   test "x$dir" = "x$object" && dir=
+   base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
+
+   if test "$libtool" = yes; then
+      # With Tru64 cc, shared objects can also be used to make a
+      # static library.  This mechanism is used in libtool 1.4 series to
+      # handle both shared and static libraries in a single compilation.
+      # With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d.
+      #
+      # With libtool 1.5 this exception was removed, and libtool now
+      # generates 2 separate objects for the 2 libraries.  These two
+      # compilations output dependencies in $dir.libs/$base.o.d and
+      # in $dir$base.o.d.  We have to check for both files, because
+      # one of the two compilations can be disabled.  We should prefer
+      # $dir$base.o.d over $dir.libs/$base.o.d because the latter is
+      # automatically cleaned when .libs/ is deleted, while ignoring
+      # the former would cause a distcleancheck panic.
+      tmpdepfile1=$dir.libs/$base.lo.d   # libtool 1.4
+      tmpdepfile2=$dir$base.o.d          # libtool 1.5
+      tmpdepfile3=$dir.libs/$base.o.d    # libtool 1.5
+      tmpdepfile4=$dir.libs/$base.d      # Compaq CCC V6.2-504
+      "$@" -Wc,-MD
+   else
+      tmpdepfile1=$dir$base.o.d
+      tmpdepfile2=$dir$base.d
+      tmpdepfile3=$dir$base.d
+      tmpdepfile4=$dir$base.d
+      "$@" -MD
+   fi
+
+   stat=$?
+   if test $stat -eq 0; then :
+   else
+      rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
+      exit $stat
+   fi
+
+   for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
+   do
+     test -f "$tmpdepfile" && break
+   done
+   if test -f "$tmpdepfile"; then
+      sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
+      # That's a tab and a space in the [].
+      sed -e 's,^.*\.[a-z]*:[	 ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
+   else
+      echo "#dummy" > "$depfile"
+   fi
+   rm -f "$tmpdepfile"
+   ;;
+
+msvc7)
+  if test "$libtool" = yes; then
+    showIncludes=-Wc,-showIncludes
+  else
+    showIncludes=-showIncludes
+  fi
+  "$@" $showIncludes > "$tmpdepfile"
+  stat=$?
+  grep -v '^Note: including file: ' "$tmpdepfile"
+  if test "$stat" = 0; then :
+  else
+    rm -f "$tmpdepfile"
+    exit $stat
+  fi
+  rm -f "$depfile"
+  echo "$object : \\" > "$depfile"
+  # The first sed program below extracts the file names and escapes
+  # backslashes for cygpath.  The second sed program outputs the file
+  # name when reading, but also accumulates all include files in the
+  # hold buffer in order to output them again at the end.  This only
+  # works with sed implementations that can handle large buffers.
+  sed < "$tmpdepfile" -n '
+/^Note: including file:  *\(.*\)/ {
+  s//\1/
+  s/\\/\\\\/g
+  p
+}' | $cygpath_u | sort -u | sed -n '
+s/ /\\ /g
+s/\(.*\)/	\1 \\/p
+s/.\(.*\) \\/\1:/
+H
+$ {
+  s/.*/	/
+  G
+  p
+}' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+msvc7msys)
+  # This case exists only to let depend.m4 do its work.  It works by
+  # looking at the text of this script.  This case will never be run,
+  # since it is checked for above.
+  exit 1
+  ;;
+
+#nosideeffect)
+  # This comment above is used by automake to tell side-effect
+  # dependency tracking mechanisms from slower ones.
+
+dashmstdout)
+  # Important note: in order to support this mode, a compiler *must*
+  # always write the preprocessed file to stdout, regardless of -o.
+  "$@" || exit $?
+
+  # Remove the call to Libtool.
+  if test "$libtool" = yes; then
+    while test "X$1" != 'X--mode=compile'; do
+      shift
+    done
+    shift
+  fi
+
+  # Remove `-o $object'.
+  IFS=" "
+  for arg
+  do
+    case $arg in
+    -o)
+      shift
+      ;;
+    $object)
+      shift
+      ;;
+    *)
+      set fnord "$@" "$arg"
+      shift # fnord
+      shift # $arg
+      ;;
+    esac
+  done
+
+  test -z "$dashmflag" && dashmflag=-M
+  # Require at least two characters before searching for `:'
+  # in the target name.  This is to cope with DOS-style filenames:
+  # a dependency such as `c:/foo/bar' could be seen as target `c' otherwise.
+  "$@" $dashmflag |
+    sed 's:^[  ]*[^: ][^:][^:]*\:[    ]*:'"$object"'\: :' > "$tmpdepfile"
+  rm -f "$depfile"
+  cat < "$tmpdepfile" > "$depfile"
+  tr ' ' '
+' < "$tmpdepfile" | \
+## Some versions of the HPUX 10.20 sed can't process this invocation
+## correctly.  Breaking it into two sed invocations is a workaround.
+    sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+dashXmstdout)
+  # This case only exists to satisfy depend.m4.  It is never actually
+  # run, as this mode is specially recognized in the preamble.
+  exit 1
+  ;;
+
+makedepend)
+  "$@" || exit $?
+  # Remove any Libtool call
+  if test "$libtool" = yes; then
+    while test "X$1" != 'X--mode=compile'; do
+      shift
+    done
+    shift
+  fi
+  # X makedepend
+  shift
+  cleared=no eat=no
+  for arg
+  do
+    case $cleared in
+    no)
+      set ""; shift
+      cleared=yes ;;
+    esac
+    if test $eat = yes; then
+      eat=no
+      continue
+    fi
+    case "$arg" in
+    -D*|-I*)
+      set fnord "$@" "$arg"; shift ;;
+    # Strip any option that makedepend may not understand.  Remove
+    # the object too, otherwise makedepend will parse it as a source file.
+    -arch)
+      eat=yes ;;
+    -*|$object)
+      ;;
+    *)
+      set fnord "$@" "$arg"; shift ;;
+    esac
+  done
+  obj_suffix=`echo "$object" | sed 's/^.*\././'`
+  touch "$tmpdepfile"
+  ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@"
+  rm -f "$depfile"
+  # makedepend may prepend the VPATH from the source file name to the object.
+  # No need to regex-escape $object, excess matching of '.' is harmless.
+  sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile"
+  sed '1,2d' "$tmpdepfile" | tr ' ' '
+' | \
+## Some versions of the HPUX 10.20 sed can't process this invocation
+## correctly.  Breaking it into two sed invocations is a workaround.
+    sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile" "$tmpdepfile".bak
+  ;;
+
+cpp)
+  # Important note: in order to support this mode, a compiler *must*
+  # always write the preprocessed file to stdout.
+  "$@" || exit $?
+
+  # Remove the call to Libtool.
+  if test "$libtool" = yes; then
+    while test "X$1" != 'X--mode=compile'; do
+      shift
+    done
+    shift
+  fi
+
+  # Remove `-o $object'.
+  IFS=" "
+  for arg
+  do
+    case $arg in
+    -o)
+      shift
+      ;;
+    $object)
+      shift
+      ;;
+    *)
+      set fnord "$@" "$arg"
+      shift # fnord
+      shift # $arg
+      ;;
+    esac
+  done
+
+  "$@" -E |
+    sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \
+       -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' |
+    sed '$ s: \\$::' > "$tmpdepfile"
+  rm -f "$depfile"
+  echo "$object : \\" > "$depfile"
+  cat < "$tmpdepfile" >> "$depfile"
+  sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+msvisualcpp)
+  # Important note: in order to support this mode, a compiler *must*
+  # always write the preprocessed file to stdout.
+  "$@" || exit $?
+
+  # Remove the call to Libtool.
+  if test "$libtool" = yes; then
+    while test "X$1" != 'X--mode=compile'; do
+      shift
+    done
+    shift
+  fi
+
+  IFS=" "
+  for arg
+  do
+    case "$arg" in
+    -o)
+      shift
+      ;;
+    $object)
+      shift
+      ;;
+    "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI")
+	set fnord "$@"
+	shift
+	shift
+	;;
+    *)
+	set fnord "$@" "$arg"
+	shift
+	shift
+	;;
+    esac
+  done
+  "$@" -E 2>/dev/null |
+  sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile"
+  rm -f "$depfile"
+  echo "$object : \\" > "$depfile"
+  sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::	\1 \\:p' >> "$depfile"
+  echo "	" >> "$depfile"
+  sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile"
+  rm -f "$tmpdepfile"
+  ;;
+
+msvcmsys)
+  # This case exists only to let depend.m4 do its work.  It works by
+  # looking at the text of this script.  This case will never be run,
+  # since it is checked for above.
+  exit 1
+  ;;
+
+none)
+  exec "$@"
+  ;;
+
+*)
+  echo "Unknown depmode $depmode" 1>&2
+  exit 1
+  ;;
+esac
+
+exit 0
+
+# Local Variables:
+# mode: shell-script
+# sh-indentation: 2
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:
diff -Nru igraph-0.6.5~quantal1/doc/Makefile.am igraph-0.6.5/doc/Makefile.am
--- igraph-0.6.5~quantal1/doc/Makefile.am	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/Makefile.am	1970-01-01 00:00:00.000000000 +0000
@@ -1,241 +0,0 @@
-## Process this file with automake to produce Makefile.in
-
-DOXROX=$(top_srcdir)/doc/doxrox.py
-REGEX=$(top_srcdir)/doc/c-docbook.re
-SRCDIR=$(top_srcdir)/src
-INCLUDEDIR=$(top_srcdir)/include
-BUILD_INCLUDEDIR=$(top_builddir)/include
-REMOVEEXAMPLES=$(top_srcdir)/tools/removeexamples.py
-
-DOCINCLUDES = vector.xml error.xml matrix.xml basicigraph.xml generators.xml \
-	      structural.xml iterators.xml attributes.xml layout.xml \
-	      foreign.xml nongraph.xml isomorphism.xml motifs.xml \
-	      operators.xml flows.xml community.xml cliques.xml \
-	      sparsematrix.xml stack.xml dqueue.xml heap.xml strvector.xml \
-	      adjlist.xml arpack.xml bipartite.xml visitors.xml random.xml \
-	      separators.xml memory.xml sparsemat.xml hrg.xml \
-	      scg.xml spatialgames.xml threading.xml progress.xml status.xml
-
-DOCFIX = fdl.xml gpl.xml installation.xml introduction.xml \
-	 tutorial.xml licenses.xml pmt.xml
-
-DOCFIX2 = $(patsubst %,$(top_srcdir)/doc/%,$(DOCFIX))
-
-all: doctemplate
-
-html: html/stamp
-
-info: igraph.info
-
-dvi: igraph-docs.dvi
-
-pdf: igraph-docs.pdf
-
-ps: igraph-docs.ps
-
-doctemplate: $(DOCINCLUDES)
-
-tags: $(DOCINCLUDES) $(DOCFIX)
-	cat $(DOCINCLUDES) $(DOCFIX)| grep 'id="[^-"]*">' | sed 's/.*id="\([^"]*\)">.*/\1@@/' | tr '@' '\t' | sort > tags
-
-EXAMPLES = $(patsubst $(top_srcdir)/%.c,$(top_builddir)/%.c.xml,$(wildcard $(top_srcdir)/examples/simple/*.c))
-
-$(top_builddir)/examples/simple/%.c.xml: $(top_srcdir)/examples/simple/%.c tags
-	if [ ! -d "$(top_builddir)/examples/simple" -a "x$(top_srcdir)" != "x$(top_builddir)" ]; then mkdir -p $(top_builddir)/examples/simple; fi
-	source-highlight --src-lang c --out-format docbook --input $< --output $@ --gen-references=inline --ctags="" --outlang-def=$(top_srcdir)/doc/docbook.outlang
-
-igraph-docs.xml: $(DOCINCLUDES) $(EXAMPLES)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(top_srcdir)/doc/igraph-docs.xml . ; fi
-	touch igraph-docs.xml
-
-vector.xml: vector.xxml $(INCLUDEDIR)/igraph_vector_pmt.h $(SRCDIR)/vector.pmt $(SRCDIR)/vector_ptr.c $(SRCDIR)/vector.c $(INCLUDEDIR)/igraph_vector_ptr.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_vector_pmt.h \
-	$(SRCDIR)/vector.pmt $(SRCDIR)/vector_ptr.c $(SRCDIR)/vector.c \
-	$(INCLUDEDIR)/igraph_vector_ptr.h
-
-error.xml: error.xxml $(INCLUDEDIR)/igraph_error.h $(SRCDIR)/igraph_error.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_error.h $(SRCDIR)/igraph_error.c
-
-matrix.xml: matrix.xxml $(INCLUDEDIR)/igraph_matrix.h $(SRCDIR)/matrix.pmt
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_matrix.h $(SRCDIR)/matrix.pmt
-
-sparsematrix.xml: sparsematrix.xxml $(INCLUDEDIR)/igraph_spmatrix.h $(SRCDIR)/spmatrix.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_spmatrix.h $(SRCDIR)/spmatrix.c
-
-sparsemat.xml: sparsemat.xxml $(SRCDIR)/sparsemat.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/sparsemat.c
-
-hrg.xml: hrg.xxml $(SRCDIR)/igraph_hrg.cc $(INCLUDEDIR)/igraph_hrg.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/igraph_hrg.cc $(INCLUDEDIR)/igraph_hrg.h
-
-scg.xml: scg.xxml $(SRCDIR)/scg.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/scg.c
-
-basicigraph.xml: basicigraph.xxml $(SRCDIR)/type_indexededgelist.c $(SRCDIR)/structural_properties.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/type_indexededgelist.c $(SRCDIR)/structural_properties.c
-
-generators.xml: generators.xxml \
-		$(SRCDIR)/atlas.c \
-		$(SRCDIR)/forestfire.c \
-		$(SRCDIR)/games.c \
-		$(SRCDIR)/structure_generators.c \
-		$(SRCDIR)/structural_properties.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ \
-	$(SRCDIR)/atlas.c \
-	$(SRCDIR)/forestfire.c \
-	$(SRCDIR)/games.c \
-	$(SRCDIR)/structure_generators.c \
-	$(SRCDIR)/structural_properties.c
-
-structural.xml: structural.xxml $(SRCDIR)/structural_properties.c \
-		$(SRCDIR)/spanning_trees.c \
-		$(SRCDIR)/conversion.c $(SRCDIR)/basic_query.c \
-		$(SRCDIR)/cocitation.c $(SRCDIR)/components.c \
-		$(SRCDIR)/spectral_properties.c $(SRCDIR)/cores.c \
-		$(SRCDIR)/centrality.c $(SRCDIR)/decomposition.c \
-		$(SRCDIR)/mixing.c $(INCLUDEDIR)/igraph_arpack.h \
-		$(SRCDIR)/distances.c $(SRCDIR)/feedback_arc_set.c \
-		$(SRCDIR)/matching.c
-
-	$(DOXROX) -t $< -e $(REGEX) -o $@ \
-	$(SRCDIR)/structural_properties.c $(SRCDIR)/spanning_trees.c \
-	$(SRCDIR)/conversion.c $(SRCDIR)/basic_query.c $(SRCDIR)/cocitation.c \
-	$(SRCDIR)/components.c $(SRCDIR)/spectral_properties.c $(SRCDIR)/cores.c \
-	$(SRCDIR)/centrality.c $(SRCDIR)/decomposition.c $(SRCDIR)/mixing.c \
-	$(INCLUDEDIR)/igraph_arpack.h  $(SRCDIR)/distances.c \
-	$(SRCDIR)/feedback_arc_set.c $(SRCDIR)/matching.c
-
-iterators.xml: iterators.xxml $(SRCDIR)/iterators.c $(INCLUDEDIR)/igraph_iterators.h
-	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/iterators.c \
-	$(INCLUDEDIR)/igraph_iterators.h
-
-attributes.xml: attributes.xxml $(SRCDIR)/attributes.c $(INCLUDEDIR)/igraph_attributes.h $(SRCDIR)/cattributes.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/attributes.c \
-	$(INCLUDEDIR)/igraph_attributes.h $(SRCDIR)/cattributes.c
-
-layout.xml: layout.xxml $(SRCDIR)/layout.c $(INCLUDEDIR)/igraph_layout.h $(SRCDIR)/drl_layout.cpp $(SRCDIR)/drl_layout_3d.cpp $(SRCDIR)/sugiyama.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/layout.c $(INCLUDEDIR)/igraph_layout.h $(SRCDIR)/drl_layout.cpp $(SRCDIR)/drl_layout_3d.cpp $(SRCDIR)/sugiyama.c
-
-foreign.xml: foreign.xxml $(SRCDIR)/foreign.c $(SRCDIR)/foreign-graphml.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/foreign.c \
-	$(SRCDIR)/foreign-graphml.c
-
-nongraph.xml: nongraph.xxml $(SRCDIR)/other.c $(SRCDIR)/random.c $(SRCDIR)/version.c $(INCLUDEDIR)/igraph_nongraph.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_nongraph.h $(SRCDIR)/other.c $(SRCDIR)/random.c $(SRCDIR)/version.c
-
-isomorphism.xml: isomorphism.xxml $(SRCDIR)/topology.c $(INCLUDEDIR)/igraph_topology.h $(SRCDIR)/bliss.cc
-	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/topology.c $(INCLUDEDIR)/igraph_topology.h $(SRCDIR)/bliss.cc
-
-motifs.xml: motifs.xxml $(INCLUDEDIR)/igraph_motifs.h $(SRCDIR)/motifs.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_motifs.h $(SRCDIR)/motifs.c
-
-operators.xml: operators.xxml $(SRCDIR)/operators.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/operators.c
-
-flows.xml: flows.xxml $(SRCDIR)/flow.c $(SRCDIR)/st-cuts.c $(SRCDIR)/cohesive_blocks.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/flow.c $(SRCDIR)/st-cuts.c $(SRCDIR)/cohesive_blocks.c
-
-community.xml: community.xxml $(SRCDIR)/community.c $(SRCDIR)/clustertool.cpp $(SRCDIR)/walktrap.cpp $(SRCDIR)/fast_community.c $(SRCDIR)/optimal_modularity.c $(INCLUDEDIR)/igraph_community.h $(SRCDIR)/infomap.cc
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/community.c $(SRCDIR)/clustertool.cpp $(SRCDIR)/walktrap.cpp $(SRCDIR)/fast_community.c $(SRCDIR)/optimal_modularity.c $(INCLUDEDIR)/igraph_community.h $(SRCDIR)/infomap.cc
-
-cliques.xml: cliques.xxml $(SRCDIR)/cliques.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/cliques.c
-
-stack.xml: stack.xxml $(SRCDIR)/stack.pmt
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/stack.pmt
-
-dqueue.xml: dqueue.xxml $(SRCDIR)/dqueue.pmt
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/dqueue.pmt
-
-heap.xml: heap.xxml $(SRCDIR)/heap.pmt
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/heap.pmt
-
-strvector.xml: strvector.xxml $(SRCDIR)/igraph_strvector.c $(INCLUDEDIR)/igraph_strvector.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/igraph_strvector.c $(INCLUDEDIR)/igraph_strvector.h
-
-adjlist.xml: adjlist.xxml $(SRCDIR)/adjlist.c $(INCLUDEDIR)/igraph_adjlist.h
-	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/adjlist.c $(INCLUDEDIR)/igraph_adjlist.h
-
-arpack.xml: arpack.xxml $(INCLUDEDIR)/igraph_arpack.h $(SRCDIR)/arpack.c $(INCLUDEDIR)/igraph_blas.h $(SRCDIR)/blas.c $(INCLUDEDIR)/igraph_lapack.h $(SRCDIR)/lapack.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_arpack.h $(SRCDIR)/arpack.c $(INCLUDEDIR)/igraph_blas.h $(SRCDIR)/blas.c $(INCLUDEDIR)/igraph_lapack.h $(SRCDIR)/lapack.c
-
-bipartite.xml: bipartite.xxml $(SRCDIR)/bipartite.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/bipartite.c
-
-visitors.xml: visitors.xxml $(SRCDIR)/visitors.c  $(INCLUDEDIR)/igraph_visitor.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/visitors.c  $(INCLUDEDIR)/igraph_visitor.h
-
-random.xml: random.xxml $(SRCDIR)/random.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/random.c
-
-separators.xml: separators.xxml $(SRCDIR)/separators.c $(SRCDIR)/st-cuts.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/separators.c \
-		$(SRCDIR)/st-cuts.c
-
-memory.xml: memory.xxml $(SRCDIR)/memory.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/memory.c
-
-spatialgames.xml: spatialgames.xxml \
-		   $(SRCDIR)/microscopic_update.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ \
-	$(SRCDIR)/microscopic_update.c
-
-threading.xml: threading.xxml $(BUILD_INCLUDEDIR)/igraph_threading.h
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(BUILD_INCLUDEDIR)/igraph_threading.h
-
-progress.xml: progress.xxml $(INCLUDEDIR)/igraph_progress.h $(SRCDIR)/progress.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_progress.h $(SRCDIR)/progress.c
-
-status.xml: status.xxml $(INCLUDEDIR)/igraph_statusbar.h $(SRCDIR)/statusbar.c
-	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_statusbar.h $(SRCDIR)/statusbar.c
-
-html/stamp: igraph-docs.xml $(DOCFIX2) gtk-doc.xsl
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmlto -x $(top_srcdir)/doc/gtk-doc.xsl -o html xhtml igraph-docs.xml \
-	&& touch html/stamp
-
-igraph.info: igraph-docs.xml $(DOCFIX2) igraph.info.diff
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	cat tutorial.xml | sed '/<link/{N;s/<link\n*[^>]*>//g;}' | \
-	  sed 's/<\/link>//g' >tutorial-info.xml \
-	&& sed 's/tutorial\.xml/tutorial-info.xml/' igraph-docs.xml > igraph-docs-info.xml \
-	&& xmllint --xinclude -o igraph-docs-info2.xml igraph-docs-info.xml \
-	&& $(REMOVEEXAMPLES) igraph-docs-info2.xml igraph-docs-info3.xml \
-	&& sed '/<book/q' igraph-docs-info2.xml | grep -v '<book' >igraph-docs-info4.xml\
-	&& cat igraph-docs-info3.xml >> igraph-docs-info4.xml \
-	&& db2x_xsltproc --xinclude -s texi igraph-docs-info4.xml -o igraph.txml \
-	&& db2x_texixml igraph.txml \
-	&& mv igraph_reference_manual.texi igraph.texi \
-	&& makeinfo --no-split --number-sections igraph.texi \
-	&& mv igraph_reference_manual.info igraph.info \
-	&& patch <$(top_srcdir)/doc/igraph.info.diff
-
-igraph-docs.dvi: igraph-docs.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
-	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
-	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
-	&& cat igraph-docs3.xml >> igraph-docs4.xml \
-	&& env < /dev/null hash_extra=650000 docbook2dvi igraph-docs4.xml \
-	&& mv igraph-docs4.dvi igraph-docs.dvi
-
-igraph-docs.ps: igraph-docs.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
-	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
-	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
-	&& cat igraph-docs3.xml >> igraph-docs4.xml \
-	&& env < /dev/null hash_extra=65000 docbook2s igraph-docs4.xml \
-	&& mv igraph-docs4.ps igraph-docs.ps
-
-igraph-docs.pdf: igraph-docs.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
-	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
-	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
-	&& cat igraph-docs3.xml >> igraph-docs4.xml \
-	&& env < /dev/null hash_extra=650000 docbook2pdf igraph-docs4.xml \
-	&& mv igraph-docs4.pdf igraph-docs.pdf
-
-CLEANFILES=$(DOCINCLUDES) html/*.html html/stamp \
-	igraph-docs.{dvi,info,pdf,ps,texi,txml} igraph-docs2.xml 
diff -Nru igraph-0.6.5~quantal1/doc/Makefile.in igraph-0.6.5/doc/Makefile.in
--- igraph-0.6.5~quantal1/doc/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/doc/Makefile.in	2013-03-03 01:30:05.000000000 +0000
@@ -0,0 +1,602 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = doc
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+DOXROX = $(top_srcdir)/doc/doxrox.py
+REGEX = $(top_srcdir)/doc/c-docbook.re
+SRCDIR = $(top_srcdir)/src
+INCLUDEDIR = $(top_srcdir)/include
+BUILD_INCLUDEDIR = $(top_builddir)/include
+REMOVEEXAMPLES = $(top_srcdir)/tools/removeexamples.py
+DOCINCLUDES = vector.xml error.xml matrix.xml basicigraph.xml generators.xml \
+	      structural.xml iterators.xml attributes.xml layout.xml \
+	      foreign.xml nongraph.xml isomorphism.xml motifs.xml \
+	      operators.xml flows.xml community.xml cliques.xml \
+	      sparsematrix.xml stack.xml dqueue.xml heap.xml strvector.xml \
+	      adjlist.xml arpack.xml bipartite.xml visitors.xml random.xml \
+	      separators.xml memory.xml sparsemat.xml hrg.xml \
+	      scg.xml spatialgames.xml threading.xml progress.xml status.xml
+
+DOCFIX = fdl.xml gpl.xml installation.xml introduction.xml \
+	 tutorial.xml licenses.xml pmt.xml
+
+DOCFIX2 = $(patsubst %,$(top_srcdir)/doc/%,$(DOCFIX))
+EXAMPLES = $(patsubst $(top_srcdir)/%.c,$(top_builddir)/%.c.xml,$(wildcard $(top_srcdir)/examples/simple/*.c))
+CLEANFILES = $(DOCINCLUDES) html/*.html html/stamp \
+	igraph-docs.{dvi,info,pdf,ps,texi,txml} igraph-docs2.xml 
+
+all: all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(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) --gnu doc/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu doc/Makefile
+.PRECIOUS: 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;
+
+$(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):
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+tags: TAGS
+TAGS:
+
+ctags: CTAGS
+CTAGS:
+
+
+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
+installdirs:
+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:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+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)
+
+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-generic clean-libtool mostlyclean-am
+
+distclean: distclean-am
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi-am:
+
+html-am:
+
+info-am:
+
+install-data-am:
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+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 -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf-am:
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am check check-am clean clean-generic clean-libtool \
+	distclean distclean-generic distclean-libtool distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	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-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am
+
+
+all: doctemplate
+
+html: html/stamp
+
+info: igraph.info
+
+dvi: igraph-docs.dvi
+
+pdf: igraph-docs.pdf
+
+ps: igraph-docs.ps
+
+doctemplate: $(DOCINCLUDES)
+
+tags: $(DOCINCLUDES) $(DOCFIX)
+	cat $(DOCINCLUDES) $(DOCFIX)| grep 'id="[^-"]*">' | sed 's/.*id="\([^"]*\)">.*/\1@@/' | tr '@' '\t' | sort > tags
+
+$(top_builddir)/examples/simple/%.c.xml: $(top_srcdir)/examples/simple/%.c tags
+	if [ ! -d "$(top_builddir)/examples/simple" -a "x$(top_srcdir)" != "x$(top_builddir)" ]; then mkdir -p $(top_builddir)/examples/simple; fi
+	source-highlight --src-lang c --out-format docbook --input $< --output $@ --gen-references=inline --ctags="" --outlang-def=$(top_srcdir)/doc/docbook.outlang
+
+igraph-docs.xml: $(DOCINCLUDES) $(EXAMPLES)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(top_srcdir)/doc/igraph-docs.xml . ; fi
+	touch igraph-docs.xml
+
+vector.xml: vector.xxml $(INCLUDEDIR)/igraph_vector_pmt.h $(SRCDIR)/vector.pmt $(SRCDIR)/vector_ptr.c $(SRCDIR)/vector.c $(INCLUDEDIR)/igraph_vector_ptr.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_vector_pmt.h \
+	$(SRCDIR)/vector.pmt $(SRCDIR)/vector_ptr.c $(SRCDIR)/vector.c \
+	$(INCLUDEDIR)/igraph_vector_ptr.h
+
+error.xml: error.xxml $(INCLUDEDIR)/igraph_error.h $(SRCDIR)/igraph_error.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_error.h $(SRCDIR)/igraph_error.c
+
+matrix.xml: matrix.xxml $(INCLUDEDIR)/igraph_matrix.h $(SRCDIR)/matrix.pmt
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_matrix.h $(SRCDIR)/matrix.pmt
+
+sparsematrix.xml: sparsematrix.xxml $(INCLUDEDIR)/igraph_spmatrix.h $(SRCDIR)/spmatrix.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_spmatrix.h $(SRCDIR)/spmatrix.c
+
+sparsemat.xml: sparsemat.xxml $(SRCDIR)/sparsemat.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/sparsemat.c
+
+hrg.xml: hrg.xxml $(SRCDIR)/igraph_hrg.cc $(INCLUDEDIR)/igraph_hrg.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/igraph_hrg.cc $(INCLUDEDIR)/igraph_hrg.h
+
+scg.xml: scg.xxml $(SRCDIR)/scg.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/scg.c
+
+basicigraph.xml: basicigraph.xxml $(SRCDIR)/type_indexededgelist.c $(SRCDIR)/structural_properties.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/type_indexededgelist.c $(SRCDIR)/structural_properties.c
+
+generators.xml: generators.xxml \
+		$(SRCDIR)/atlas.c \
+		$(SRCDIR)/forestfire.c \
+		$(SRCDIR)/games.c \
+		$(SRCDIR)/structure_generators.c \
+		$(SRCDIR)/structural_properties.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ \
+	$(SRCDIR)/atlas.c \
+	$(SRCDIR)/forestfire.c \
+	$(SRCDIR)/games.c \
+	$(SRCDIR)/structure_generators.c \
+	$(SRCDIR)/structural_properties.c
+
+structural.xml: structural.xxml $(SRCDIR)/structural_properties.c \
+		$(SRCDIR)/spanning_trees.c \
+		$(SRCDIR)/conversion.c $(SRCDIR)/basic_query.c \
+		$(SRCDIR)/cocitation.c $(SRCDIR)/components.c \
+		$(SRCDIR)/spectral_properties.c $(SRCDIR)/cores.c \
+		$(SRCDIR)/centrality.c $(SRCDIR)/decomposition.c \
+		$(SRCDIR)/mixing.c $(INCLUDEDIR)/igraph_arpack.h \
+		$(SRCDIR)/distances.c $(SRCDIR)/feedback_arc_set.c \
+		$(SRCDIR)/matching.c
+
+	$(DOXROX) -t $< -e $(REGEX) -o $@ \
+	$(SRCDIR)/structural_properties.c $(SRCDIR)/spanning_trees.c \
+	$(SRCDIR)/conversion.c $(SRCDIR)/basic_query.c $(SRCDIR)/cocitation.c \
+	$(SRCDIR)/components.c $(SRCDIR)/spectral_properties.c $(SRCDIR)/cores.c \
+	$(SRCDIR)/centrality.c $(SRCDIR)/decomposition.c $(SRCDIR)/mixing.c \
+	$(INCLUDEDIR)/igraph_arpack.h  $(SRCDIR)/distances.c \
+	$(SRCDIR)/feedback_arc_set.c $(SRCDIR)/matching.c
+
+iterators.xml: iterators.xxml $(SRCDIR)/iterators.c $(INCLUDEDIR)/igraph_iterators.h
+	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/iterators.c \
+	$(INCLUDEDIR)/igraph_iterators.h
+
+attributes.xml: attributes.xxml $(SRCDIR)/attributes.c $(INCLUDEDIR)/igraph_attributes.h $(SRCDIR)/cattributes.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/attributes.c \
+	$(INCLUDEDIR)/igraph_attributes.h $(SRCDIR)/cattributes.c
+
+layout.xml: layout.xxml $(SRCDIR)/layout.c $(INCLUDEDIR)/igraph_layout.h $(SRCDIR)/drl_layout.cpp $(SRCDIR)/drl_layout_3d.cpp $(SRCDIR)/sugiyama.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/layout.c $(INCLUDEDIR)/igraph_layout.h $(SRCDIR)/drl_layout.cpp $(SRCDIR)/drl_layout_3d.cpp $(SRCDIR)/sugiyama.c
+
+foreign.xml: foreign.xxml $(SRCDIR)/foreign.c $(SRCDIR)/foreign-graphml.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/foreign.c \
+	$(SRCDIR)/foreign-graphml.c
+
+nongraph.xml: nongraph.xxml $(SRCDIR)/other.c $(SRCDIR)/random.c $(SRCDIR)/version.c $(INCLUDEDIR)/igraph_nongraph.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_nongraph.h $(SRCDIR)/other.c $(SRCDIR)/random.c $(SRCDIR)/version.c
+
+isomorphism.xml: isomorphism.xxml $(SRCDIR)/topology.c $(INCLUDEDIR)/igraph_topology.h $(SRCDIR)/bliss.cc
+	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/topology.c $(INCLUDEDIR)/igraph_topology.h $(SRCDIR)/bliss.cc
+
+motifs.xml: motifs.xxml $(INCLUDEDIR)/igraph_motifs.h $(SRCDIR)/motifs.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_motifs.h $(SRCDIR)/motifs.c
+
+operators.xml: operators.xxml $(SRCDIR)/operators.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/operators.c
+
+flows.xml: flows.xxml $(SRCDIR)/flow.c $(SRCDIR)/st-cuts.c $(SRCDIR)/cohesive_blocks.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/flow.c $(SRCDIR)/st-cuts.c $(SRCDIR)/cohesive_blocks.c
+
+community.xml: community.xxml $(SRCDIR)/community.c $(SRCDIR)/clustertool.cpp $(SRCDIR)/walktrap.cpp $(SRCDIR)/fast_community.c $(SRCDIR)/optimal_modularity.c $(INCLUDEDIR)/igraph_community.h $(SRCDIR)/infomap.cc
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/community.c $(SRCDIR)/clustertool.cpp $(SRCDIR)/walktrap.cpp $(SRCDIR)/fast_community.c $(SRCDIR)/optimal_modularity.c $(INCLUDEDIR)/igraph_community.h $(SRCDIR)/infomap.cc
+
+cliques.xml: cliques.xxml $(SRCDIR)/cliques.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/cliques.c
+
+stack.xml: stack.xxml $(SRCDIR)/stack.pmt
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/stack.pmt
+
+dqueue.xml: dqueue.xxml $(SRCDIR)/dqueue.pmt
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/dqueue.pmt
+
+heap.xml: heap.xxml $(SRCDIR)/heap.pmt
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/heap.pmt
+
+strvector.xml: strvector.xxml $(SRCDIR)/igraph_strvector.c $(INCLUDEDIR)/igraph_strvector.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/igraph_strvector.c $(INCLUDEDIR)/igraph_strvector.h
+
+adjlist.xml: adjlist.xxml $(SRCDIR)/adjlist.c $(INCLUDEDIR)/igraph_adjlist.h
+	$(DOXROX) -c -t $< -e $(REGEX) -o $@ $(SRCDIR)/adjlist.c $(INCLUDEDIR)/igraph_adjlist.h
+
+arpack.xml: arpack.xxml $(INCLUDEDIR)/igraph_arpack.h $(SRCDIR)/arpack.c $(INCLUDEDIR)/igraph_blas.h $(SRCDIR)/blas.c $(INCLUDEDIR)/igraph_lapack.h $(SRCDIR)/lapack.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_arpack.h $(SRCDIR)/arpack.c $(INCLUDEDIR)/igraph_blas.h $(SRCDIR)/blas.c $(INCLUDEDIR)/igraph_lapack.h $(SRCDIR)/lapack.c
+
+bipartite.xml: bipartite.xxml $(SRCDIR)/bipartite.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/bipartite.c
+
+visitors.xml: visitors.xxml $(SRCDIR)/visitors.c  $(INCLUDEDIR)/igraph_visitor.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/visitors.c  $(INCLUDEDIR)/igraph_visitor.h
+
+random.xml: random.xxml $(SRCDIR)/random.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/random.c
+
+separators.xml: separators.xxml $(SRCDIR)/separators.c $(SRCDIR)/st-cuts.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/separators.c \
+		$(SRCDIR)/st-cuts.c
+
+memory.xml: memory.xxml $(SRCDIR)/memory.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(SRCDIR)/memory.c
+
+spatialgames.xml: spatialgames.xxml \
+		   $(SRCDIR)/microscopic_update.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ \
+	$(SRCDIR)/microscopic_update.c
+
+threading.xml: threading.xxml $(BUILD_INCLUDEDIR)/igraph_threading.h
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(BUILD_INCLUDEDIR)/igraph_threading.h
+
+progress.xml: progress.xxml $(INCLUDEDIR)/igraph_progress.h $(SRCDIR)/progress.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_progress.h $(SRCDIR)/progress.c
+
+status.xml: status.xxml $(INCLUDEDIR)/igraph_statusbar.h $(SRCDIR)/statusbar.c
+	$(DOXROX) -t $< -e $(REGEX) -o $@ $(INCLUDEDIR)/igraph_statusbar.h $(SRCDIR)/statusbar.c
+
+html/stamp: igraph-docs.xml $(DOCFIX2) gtk-doc.xsl
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmlto -x $(top_srcdir)/doc/gtk-doc.xsl -o html xhtml igraph-docs.xml \
+	&& touch html/stamp
+
+igraph.info: igraph-docs.xml $(DOCFIX2) igraph.info.diff
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	cat tutorial.xml | sed '/<link/{N;s/<link\n*[^>]*>//g;}' | \
+	  sed 's/<\/link>//g' >tutorial-info.xml \
+	&& sed 's/tutorial\.xml/tutorial-info.xml/' igraph-docs.xml > igraph-docs-info.xml \
+	&& xmllint --xinclude -o igraph-docs-info2.xml igraph-docs-info.xml \
+	&& $(REMOVEEXAMPLES) igraph-docs-info2.xml igraph-docs-info3.xml \
+	&& sed '/<book/q' igraph-docs-info2.xml | grep -v '<book' >igraph-docs-info4.xml\
+	&& cat igraph-docs-info3.xml >> igraph-docs-info4.xml \
+	&& db2x_xsltproc --xinclude -s texi igraph-docs-info4.xml -o igraph.txml \
+	&& db2x_texixml igraph.txml \
+	&& mv igraph_reference_manual.texi igraph.texi \
+	&& makeinfo --no-split --number-sections igraph.texi \
+	&& mv igraph_reference_manual.info igraph.info \
+	&& patch <$(top_srcdir)/doc/igraph.info.diff
+
+igraph-docs.dvi: igraph-docs.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
+	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
+	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
+	&& cat igraph-docs3.xml >> igraph-docs4.xml \
+	&& env < /dev/null hash_extra=650000 docbook2dvi igraph-docs4.xml \
+	&& mv igraph-docs4.dvi igraph-docs.dvi
+
+igraph-docs.ps: igraph-docs.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
+	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
+	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
+	&& cat igraph-docs3.xml >> igraph-docs4.xml \
+	&& env < /dev/null hash_extra=65000 docbook2s igraph-docs4.xml \
+	&& mv igraph-docs4.ps igraph-docs.ps
+
+igraph-docs.pdf: igraph-docs.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph-docs2.xml igraph-docs.xml \
+	&& $(REMOVEEXAMPLES) igraph-docs2.xml igraph-docs3.xml \
+	&& sed '/<book/q' igraph-docs2.xml | grep -v '<book' >igraph-docs4.xml\
+	&& cat igraph-docs3.xml >> igraph-docs4.xml \
+	&& env < /dev/null hash_extra=650000 docbook2pdf igraph-docs4.xml \
+	&& mv igraph-docs4.pdf igraph-docs.pdf
+
+# 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 -Nru igraph-0.6.5~quantal1/doc/abstracts/wien08.txt igraph-0.6.5/doc/abstracts/wien08.txt
--- igraph-0.6.5~quantal1/doc/abstracts/wien08.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/abstracts/wien08.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-
-Practical statistical network analysis
-
-The igraph R package provides a platform for developing
-graph algorithms. As many (classic and recent) algorithms are
-already included in igraph, it is also handy in
-exploratory network analyis. igraph has a very simple and
-fast graph representation, this allows handling of huge
-graphs, with millions of vertices and edges.
-
-In this lecture, I first introduce igraph's data model, together
-with the basic concepts of graph theory. Then, I will show some
-examples for
- - centrality measures,
- - community structure detection algorithms,
- - cohesive blocks,
-and how they can be calculated with igraph.
-Several examples will be shown for
- - creating and importing graphs from collected data or from
-   other formats,
- - graph visualization,
- - rapid prototyping of graph algorithms.
-
-Basic calculus, statistics and R knowledge is expected.
diff -Nru igraph-0.6.5~quantal1/doc/adjlist.xxml igraph-0.6.5/doc/adjlist.xxml
--- igraph-0.6.5~quantal1/doc/adjlist.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/adjlist.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Adjlists">
-<title>Adjacency lists</title>
-
-<!-- doxrox-include about_adjlists -->
-
-<section><title>Adjacent vertices</title>
-<!-- doxrox-include igraph_adjlist_init -->
-<!-- doxrox-include igraph_adjlist_init_empty -->
-<!-- doxrox-include igraph_adjlist_init_complementer -->
-<!-- doxrox-include igraph_adjlist_destroy -->
-<!-- doxrox-include igraph_adjlist_get -->
-<!-- doxrox-include igraph_adjlist_clear -->
-<!-- doxrox-include igraph_adjlist_sort -->
-<!-- doxrox-include igraph_adjlist_simplify -->
-</section>
-
-<section><title>Incident edges</title>
-<!-- doxrox-include igraph_inclist_init -->
-<!-- doxrox-include igraph_inclist_destroy -->
-<!-- doxrox-include igraph_inclist_get -->
-<!-- doxrox-include igraph_inclist_clear -->
-</section>
-
-<section><title>Lazy adjacency list for vertices</title>
-<!-- doxrox-include igraph_lazy_adjlist_init -->
-<!-- doxrox-include igraph_lazy_adjlist_destroy -->
-<!-- doxrox-include igraph_lazy_adjlist_get -->
-<!-- doxrox-include igraph_lazy_adjlist_clear -->
-</section>
-
-<section><title>Lazy incidence list for edges</title>
-<!-- doxrox-include igraph_lazy_inclist_init -->
-<!-- doxrox-include igraph_lazy_inclist_destroy -->
-<!-- doxrox-include igraph_lazy_inclist_get -->
-<!-- doxrox-include igraph_lazy_inclist_clear -->
-</section>
-
-<section><title>Deprecated functions</title>
-<!-- doxrox-include igraph_adjedgelist_init -->
-<!-- doxrox-include igraph_adjedgelist_destroy -->
-<!-- doxrox-include igraph_adjedgelist_get -->
-<!-- doxrox-include igraph_lazy_adjedgelist_init -->
-<!-- doxrox-include igraph_lazy_adjedgelist_destroy -->
-<!-- doxrox-include igraph_lazy_adjedgelist_get -->
-</section>
-
-</section>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/arpack.xxml igraph-0.6.5/doc/arpack.xxml
--- igraph-0.6.5~quantal1/doc/arpack.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/arpack.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-<!ENTITY % local.common.attrib    "xmlns:xi            CDATA       #FIXED       
-'http://www.w3.org/2001/XInclude'" >
-]>
-
-<chapter id="igraph-Arpack">
-<title>Using BLAS, LAPACK and ARPACK for igraph matrices and graphs</title>
-
-<section>
-<!-- doxrox-include about_blas -->
-<!-- doxrox-include igraph_blas_dgemv -->
-<!-- doxrox-include igraph_blas_dgemv_array -->
-</section>
-
-<section>
-  <!-- doxrox-include about_lapack -->
-  <section><title>Matrix factorization, solving linear systems</title>
-  <!-- doxrox-include igraph_lapack_dgetrf -->
-  <!-- doxrox-include igraph_lapack_dgetrs -->
-  <!-- doxrox-include igraph_lapack_dgesv -->
-  </section>
-  <section><title>Eigenvalues and eigenvectors of matrices</title>
-  <!-- doxrox-include igraph_lapack_dsyevr -->
-  <!-- doxrox-include igraph_lapack_dgeev -->
-  <!-- doxrox-include igraph_lapack_dgeevx -->
-  </section>
-</section>
-
-<section>
-<!-- doxrox-include about_arpack -->
-<section><title>Data structures</title>
-<!-- doxrox-include igraph_arpack_options_t -->
-<!-- doxrox-include igraph_arpack_storage_t -->
-<!-- doxrox-include igraph_arpack_function_t -->
-<!-- doxrox-include igraph_arpack_options_init -->
-<!-- doxrox-include igraph_arpack_storage_init -->
-<!-- doxrox-include igraph_arpack_storage_destroy -->
-</section>
-
-<section><title>ARPACK solvers</title>
-<!-- doxrox-include igraph_arpack_rssolve -->
-<!-- doxrox-include igraph_arpack_rnsolve -->
-<!-- doxrox-include igraph_arpack_unpack_complex -->
-</section>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/attributes.xxml igraph-0.6.5/doc/attributes.xxml
--- igraph-0.6.5~quantal1/doc/attributes.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/attributes.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,90 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Attributes">
-<title>Graph, Vertex and Edge Attributes</title>
-
-<!-- doxrox-include about_attributes -->
-
-<section>
-<title>The Attribute Handler Interface</title>
-<!-- doxrox-include about_attribute_table -->
-<!-- doxrox-include igraph_attribute_table_t -->
-<!-- doxrox-include igraph_i_set_attribute_table -->
-<!-- doxrox-include igraph_attribute_type_t -->
-</section>
-
-<section>
-<title>Accessing attributes from C</title>
-
-<!-- doxrox-include cattributes -->
-
-<section><title>Query attributes</title>
-<!-- doxrox-include igraph_cattribute_list -->
-<!-- doxrox-include igraph_cattribute_has_attr -->
-<!-- doxrox-include igraph_cattribute_GAN -->
-<!-- doxrox-include GAN -->
-<!-- doxrox-include igraph_cattribute_GAS -->
-<!-- doxrox-include GAS -->
-<!-- doxrox-include igraph_cattribute_VAN -->
-<!-- doxrox-include VAN -->
-<!-- doxrox-include igraph_cattribute_VANV -->
-<!-- doxrox-include VANV -->
-<!-- doxrox-include igraph_cattribute_VAS -->
-<!-- doxrox-include VAS -->
-<!-- doxrox-include igraph_cattribute_VASV -->
-<!-- doxrox-include VASV -->
-<!-- doxrox-include igraph_cattribute_EAN -->
-<!-- doxrox-include EAN -->
-<!-- doxrox-include igraph_cattribute_EANV -->
-<!-- doxrox-include EANV -->
-<!-- doxrox-include igraph_cattribute_EAS -->
-<!-- doxrox-include EAS -->
-<!-- doxrox-include igraph_cattribute_EASV -->
-<!-- doxrox-include EASV -->
-</section>
-
-<section>
-<title>Set attributes</title>
-<!-- doxrox-include igraph_cattribute_GAN_set -->
-<!-- doxrox-include SETGAN -->
-<!-- doxrox-include igraph_cattribute_GAS_set -->
-<!-- doxrox-include SETGAS -->
-<!-- doxrox-include igraph_cattribute_VAN_set -->
-<!-- doxrox-include SETVAN -->
-<!-- doxrox-include igraph_cattribute_VAS_set -->
-<!-- doxrox-include SETVAS -->
-<!-- doxrox-include igraph_cattribute_EAN_set -->
-<!-- doxrox-include SETEAN -->
-<!-- doxrox-include igraph_cattribute_EAS_set -->
-<!-- doxrox-include SETEAS -->
-<!-- doxrox-include igraph_cattribute_VAN_setv -->
-<!-- doxrox-include SETVANV -->
-<!-- doxrox-include igraph_cattribute_VAS_setv -->
-<!-- doxrox-include SETVASV -->
-<!-- doxrox-include igraph_cattribute_EAN_setv -->
-<!-- doxrox-include SETEANV -->
-<!-- doxrox-include igraph_cattribute_EAS_setv -->
-<!-- doxrox-include SETEASV -->
-</section>
-
-<section><title>Remove attributes</title>
-<!-- doxrox-include igraph_cattribute_remove_g -->
-<!-- doxrox-include DELGA -->
-<!-- doxrox-include igraph_cattribute_remove_v -->
-<!-- doxrox-include DELVA -->
-<!-- doxrox-include igraph_cattribute_remove_e -->
-<!-- doxrox-include DELEA -->
-<!-- doxrox-include igraph_cattribute_remove_all -->
-<!-- doxrox-include DELGAS -->
-<!-- doxrox-include DELVAS -->
-<!-- doxrox-include DELEAS -->
-<!-- doxrox-include DELALL -->
-</section>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/basicigraph.xxml igraph-0.6.5/doc/basicigraph.xxml
--- igraph-0.6.5~quantal1/doc/basicigraph.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/basicigraph.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,125 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Basic">
-<title>About &igraph; graphs, the basic interface</title>
-
-<section><title>The &igraph; data model</title>
-<para>
-The &igraph; library can handle directed and
-undirected graphs. The &igraph; graphs are multisets
-of ordered (if directed) or unordered (if undirected) labeled pairs.
-The labels of the pairs plus the number of vertices always starts with
-zero and ends with the number of edges minus one. In addition to that
-a table of metadata is also attached to every graph, its most
-important entries are the number of vertices in the graph and whether
-the graph is directed or undirected.
-</para>
-
-<para>
-Like the edges, the &igraph; vertices are also
-labeled by number between zero and the number of vertices minus one. 
-So, to summarize, a directed graph can be imagined like this:
-<informalexample>
-<programlisting>
-  ( vertices: 6, 
-    directed: yes,
-    {
-     (0,2),
-     (2,2),
-     (2,3),
-     (3,3),
-     (3,4),
-     (3,4),
-     (4,1)
-    }
-  )
-</programlisting>
-</informalexample>
-Here the edges are ordered pairs or vertex ids, and the graph is a multiset
-of edges plus some meta-data.
-</para>
-
-<para>
-An undirected graph is like this:
-<informalexample>
-<programlisting>
-  ( vertices: 6,
-    directed: no,
-    {
-     {0,2},
-     {2},
-     {2,3},
-     {3},
-     {3,4},
-     {3,4},
-     {4,1}
-    }
-  )
-</programlisting>
-</informalexample>
-Here an edge is a set of one or two vertex ids, two for most of the
-time, except for loop edges. A graph is a multiset of edges plus meta data,
-just like in the directed case.
-</para>
-
-<para>It is possible to convert a directed graph to an undirected one,
-see the <link linkend="igraph_to_directed">
-<function>igraph_to_directed()</function></link> 
-and <link linkend="igraph_to_undirected"> 
-<function>igraph_to_undirected()</function></link> functions.
-</para>
-
-<para>Note that &igraph; has some limited support for
-graphs with multiple edges. The support means that multiple edges can
-be stored in &igraph; graphs, but for most functions
-(like <link linkend="igraph_betweenness">
-<function>igraph_betweenness()</function></link>) it is not checked
-that they work well on graphs with multiple edges.
-To eliminate multiple edges from a graph, you can use 
-<link linkend="igraph_simplify">
-  <function>igraph_simplify()</function></link>. 
-</para>
-</section>
-
-<section><title>The basic interface</title>
-<!-- doxrox-include about_basic_interface -->
-
-<section><title>Graph Constructors and Destructors</title>
-<!-- doxrox-include igraph_empty -->
-<!-- doxrox-include igraph_empty_attrs -->
-<!-- doxrox-include igraph_copy -->
-<!-- doxrox-include igraph_destroy -->
-</section>
-
-<section><title>Basic Query Operations</title>
-<!-- doxrox-include igraph_vcount -->
-<!-- doxrox-include igraph_ecount -->
-<!-- doxrox-include igraph_edge -->
-<!-- doxrox-include igraph_get_eid -->
-<!-- doxrox-include igraph_get_eids -->
-<!-- doxrox-include igraph_get_eids_multi -->
-<!-- doxrox-include igraph_neighbors -->
-<!-- doxrox-include igraph_incident -->
-<!-- doxrox-include igraph_is_directed -->
-<!-- doxrox-include igraph_degree -->
-</section>
-
-<section><title>Adding and Deleting Vertices and Edges</title>
-<!-- doxrox-include igraph_add_edge -->
-<!-- doxrox-include igraph_add_edges -->
-<!-- doxrox-include igraph_add_vertices -->
-<!-- doxrox-include igraph_delete_edges -->
-<!-- doxrox-include igraph_delete_vertices -->
-</section>
-
-<section><title>Deprecated functions</title>
-<!-- doxrox-include igraph_adjacent -->
-</section>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/bibdatabase.xml igraph-0.6.5/doc/bibdatabase.xml
--- igraph-0.6.5~quantal1/doc/bibdatabase.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/bibdatabase.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE bibliography PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-]>
-
-<bibliography>
-
-  <biblioentry id="bib:barabasi99a">
-    <authorgroup>
-      <author><firstname>Albert-László</firstname>
-      <surname>Barabási</surname></author>
-      <author><firstname>Réka</firstname><surname>Albert</surname></author>
-    </authorgroup>
-    <subtitle>Emergence of scaling in random networks</subtitle>
-    <title>Science</title>
-    <pubdate>1999</pubdate>
-    <volumenum>286</volumenum>
-    <pagenums>509-512</pagenums>
-  </biblioentry>
-  
-  <biblioentry id="bib:zalanyi03">
-    <authorgroup>
-      <author><firstname>László</firstname><surname>Zalányi</surname></author>
-      <author><firstname>Gábor</firstname><surname>Csárdi</surname></author>
-      <author><firstname>Tamás</firstname><surname>Kiss</surname></author>
-      <author><firstname>Máté</firstname><surname>Lengyel</surname></author>
-      <author><firstname>Rebecca</firstname><surname>Warner</surname></author>
-      <author><firstname>Jan</firstname><surname>Tobochnik</surname></author>
-      <author><firstname>Péter</firstname><surname>Érdi</surname></author>
-    </authorgroup>
-    <subtitle>Properties of a random attachment growing network</subtitle>
-    <title>Phyisical Review E</title>
-    <pubdate>2003</pubdate>
-    <volumenum>68</volumenum>
-    <pagenums>066104</pagenums>
-  </biblioentry>
-
-  <biblioentry id="bib:ford56">
-    <authorgroup>
-      <author><firstname>L. R.</firstname><surname>Ford Jr.</surname></author>
-      <author><firstname>D. R.</firstname><surname>Fulkerson</surname></author>
-    </authorgroup>
-    <subtitle>Maximal ow through a network</subtitle>
-    <title>Canadian J. Math.</title>
-    <pubdate>1956</pubdate>
-    <volumenum>8</volumenum>
-    <pagenums>399--404</pagenums>
-  </biblioentry>
-
-
-</bibliography>
diff -Nru igraph-0.6.5~quantal1/doc/bipartite.xxml igraph-0.6.5/doc/bipartite.xxml
--- igraph-0.6.5~quantal1/doc/bipartite.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/bipartite.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Bipartite">
-<title>Bipartite, i.e. two-mode graphs</title>
-
-<section>
-<!-- doxrox-include about_bipartite -->
-</section>
-
-<section><title>Create two-mode networks</title>
-<!-- doxrox-include igraph_create_bipartite -->
-<!-- doxrox-include igraph_full_bipartite -->
-</section>
-
-<section><title>Incidence matrices</title>
-<!-- doxrox-include igraph_incidence -->
-<!-- doxrox-include igraph_get_incidence -->
-</section>
-
-<section><title>Project a two-mode graphs</title>
-<!-- doxrox-include igraph_bipartite_projection_size -->
-<!-- doxrox-include igraph_bipartite_projection -->
-</section>
-
-<section><title>Other operations on bipartite graphs</title>
-<!-- doxrox-include igraph_is_bipartite -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/Makefile.am igraph-0.6.5/doc/book/Makefile.am
--- igraph-0.6.5~quantal1/doc/book/Makefile.am	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/Makefile.am	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-## Process this file with automake to produce Makefile.in
-
-DOCFIX = datamodel.xml igraph.xml installation.xml introduction.xml \
-	 short.xml structures.xml ../licenses.xml creating.xml graph.xml \
-	 random.xml bibliography.xml ../bibdatabase.xml foreign.xml \
-	 operators.xml motifs.xml pathlength.xml centrality.xml citation.xml \
-	 components.xml attributes.xml iterators.xml plotting.xml flows.xml
-
-DOCFIX2 = $(patsubst %,$(top_srcdir)/doc/book/%,$(DOCFIX))
-
-all: doctemplate
-
-html: html/stamp
-
-info: igraph.info
-
-dvi: igraph.dvi
-
-pdf: igraph.pdf
-
-ps: igraph.ps
-
-doctemplate: $(DOCINCLUDES)
-
-igraph.xml: $(DOCINCLUDES)
-	touch igraph.xml
-
-html/stamp: igraph.xml $(DOCFIX2) gtk-doc.xsl
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmlto -x $(top_srcdir)/doc/book/gtk-doc.xsl -o html xhtml igraph.xml \
-	&& touch html/stamp
-
-igraph.info: igraph.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	db2x_xsltproc --xinclude -s texi igraph.xml -o igraph.txml \
-	&& db2x_texixml igraph.txml \
-	&& makeinfo --no-split igraph.texi
-
-igraph.dvi: igraph.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph2.xml igraph.xml \
-	&& docbook2dvi igraph2.xml \
-	&& mv igraph2.dvi igraph.dvi
-
-igraph.ps: igraph.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph2.xml igraph.xml \
-	&& docbook2ps igraph2.xml \
-	&& mv igraph2.ps igraph.ps
-
-igraph.pdf: igraph.xml $(DOCFIX2)
-	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
-	xmllint --xinclude -o igraph2.xml igraph.xml \
-	&& docbook2pdf igraph2.xml \
-	&& mv igraph2.pdf igraph.pdf
-
-CLEANFILES=$(DOCINCLUDES) html/*.html html/stamp \
-	igraph.{dvi,info,pdf,ps,texi,txml} igraph2.xml 
diff -Nru igraph-0.6.5~quantal1/doc/book/Makefile.in igraph-0.6.5/doc/book/Makefile.in
--- igraph-0.6.5~quantal1/doc/book/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/doc/book/Makefile.in	2013-03-03 01:30:05.000000000 +0000
@@ -0,0 +1,421 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = doc/book
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+DOCFIX = datamodel.xml igraph.xml installation.xml introduction.xml \
+	 short.xml structures.xml ../licenses.xml creating.xml graph.xml \
+	 random.xml bibliography.xml ../bibdatabase.xml foreign.xml \
+	 operators.xml motifs.xml pathlength.xml centrality.xml citation.xml \
+	 components.xml attributes.xml iterators.xml plotting.xml flows.xml
+
+DOCFIX2 = $(patsubst %,$(top_srcdir)/doc/book/%,$(DOCFIX))
+CLEANFILES = $(DOCINCLUDES) html/*.html html/stamp \
+	igraph.{dvi,info,pdf,ps,texi,txml} igraph2.xml 
+
+all: all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(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) --gnu doc/book/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu doc/book/Makefile
+.PRECIOUS: 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;
+
+$(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):
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+tags: TAGS
+TAGS:
+
+ctags: CTAGS
+CTAGS:
+
+
+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
+installdirs:
+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:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+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)
+
+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-generic clean-libtool mostlyclean-am
+
+distclean: distclean-am
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi-am:
+
+html-am:
+
+info-am:
+
+install-data-am:
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+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 -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf-am:
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am check check-am clean clean-generic clean-libtool \
+	distclean distclean-generic distclean-libtool distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	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-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am
+
+
+all: doctemplate
+
+html: html/stamp
+
+info: igraph.info
+
+dvi: igraph.dvi
+
+pdf: igraph.pdf
+
+ps: igraph.ps
+
+doctemplate: $(DOCINCLUDES)
+
+igraph.xml: $(DOCINCLUDES)
+	touch igraph.xml
+
+html/stamp: igraph.xml $(DOCFIX2) gtk-doc.xsl
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmlto -x $(top_srcdir)/doc/book/gtk-doc.xsl -o html xhtml igraph.xml \
+	&& touch html/stamp
+
+igraph.info: igraph.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	db2x_xsltproc --xinclude -s texi igraph.xml -o igraph.txml \
+	&& db2x_texixml igraph.txml \
+	&& makeinfo --no-split igraph.texi
+
+igraph.dvi: igraph.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph2.xml igraph.xml \
+	&& docbook2dvi igraph2.xml \
+	&& mv igraph2.dvi igraph.dvi
+
+igraph.ps: igraph.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph2.xml igraph.xml \
+	&& docbook2ps igraph2.xml \
+	&& mv igraph2.ps igraph.ps
+
+igraph.pdf: igraph.xml $(DOCFIX2)
+	if [ "x$(top_srcdir)" != "x$(top_builddir)" ]; then cp $(DOCFIX2) . ; fi && \
+	xmllint --xinclude -o igraph2.xml igraph.xml \
+	&& docbook2pdf igraph2.xml \
+	&& mv igraph2.pdf igraph.pdf
+
+# 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:
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/atlas.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/atlas.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/attributes.xml igraph-0.6.5/doc/book/attributes.xml
--- igraph-0.6.5~quantal1/doc/book/attributes.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/attributes.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-attributes">
-<title>Graph, Vertex and Edge Attributes</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/bibliography.xml igraph-0.6.5/doc/book/bibliography.xml
--- igraph-0.6.5~quantal1/doc/book/bibliography.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/bibliography.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE bibliography PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-]>
-
-<bibliography>
-
-<bibliomixed id="bib:barabasi99a"></bibliomixed>
-<bibliomixed id="bib:zalanyi03"></bibliomixed>
-<bibliomixed id="bib:ford56"></bibliomixed>
-
-</bibliography>
diff -Nru igraph-0.6.5~quantal1/doc/book/centrality.xml igraph-0.6.5/doc/book/centrality.xml
--- igraph-0.6.5~quantal1/doc/book/centrality.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/centrality.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-centrality">
-<title>Centrality Measures</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/citation.xml igraph-0.6.5/doc/book/citation.xml
--- igraph-0.6.5~quantal1/doc/book/citation.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/citation.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-citation">
-<title>Analysis of Citation Networks</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/components.xml igraph-0.6.5/doc/book/components.xml
--- igraph-0.6.5~quantal1/doc/book/components.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/components.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-components">
-<title>Connected Components</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/creating.xml igraph-0.6.5/doc/book/creating.xml
--- igraph-0.6.5~quantal1/doc/book/creating.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/creating.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,700 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-creating">
-<title>Creating Graphs</title>
-
-<section><title>Edge lists</title>
-
-<para>
-&igraph; graphs are most often created by giving the list of the edges
-to the <function>graph()</function> function:
-<informalexample><programlisting>
-<prompt>> </prompt> g1 &lt;- graph( c( 0,1, 1,2, 2,2, 2,3 ) )
-<prompt>> </prompt> g1
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 2
-[2] 2 -> 2
-[3] 2 -> 3
-</screen>
-</informalexample>
-</para>
-
-<para>The <parameter>directed</parameter> parameter can be set to
-<constant>FALSE</constant> to create undirected graphs:
-<informalexample><programlisting>
-<prompt>> </prompt> g1 &lt;- graph( c( 0,1, 1,2, 2,2, 2,3 ), directed=FALSE )
-<prompt>> </prompt> g1
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: FALSE
-
-Edges:
-[0] 0 -- 1
-[1] 1 -- 2
-[2] 2 -- 2
-[3] 2 -- 3
-</screen>
-</informalexample>
-</para>
-
-<para>
-By default the number of vertices in the graph are determined
-from the edge list vector, it is the largest vertex id plus one. 
-The <parameter>n</parameter> parameter can be supplied to override
-this. Giving a small number here than the largest vertex id plus one
-in the edge list has no effect at all:
-<informalexample><programlisting>
-<prompt>> </prompt> graph( c( 0,1, 1,2, 2,2, 2,3, ), n=10)
-</programlisting>
-<screen>
-Vertices: 10 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 2
-[2] 2 -> 2
-[3] 2 -> 3
-</screen>
-<programlisting>
-<prompt>> </prompt> graph( c( 0,1, 1,2, 2,2, 2,3, ), n=1)
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 2
-[2] 2 -> 2
-[3] 2 -> 3
-</screen>
-</informalexample>
-</para>
-
-<para>
-If you happen to have the edge list of a graph in a two-column matrix,
-then you can create an &igraph; graph by simply giving the transposed
-matrix to <function>graph()</function>:
-<informalexample><programlisting>
-<prompt>> </prompt> edgelist
-</programlisting>
-<screen>
-     [,1] [,2]
-[1,]    0    1
-[2,]    1    2
-[3,]    2    2
-[4,]    2    3
-</screen>
-<programlisting>
-<prompt>> </prompt> graph( t(edgelist) )
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 2
-[2] 2 -> 2
-[3] 2 -> 3
-</screen>
-</informalexample>
-</para>
-
-<para>
-The <quote>inverse</quote> operation of <function>graph()</function>
-is <function>get.edgelist()</function>; this takes a graph object as
-an argument and returns an edge list in a two-column matrix.
-</para>
-
-</section>
-
-<!-- ################################################################## -->
-
-<section><title>Adjacency matrices</title>
-
-<para>
-An A adjacency matrix is a representation of a directed
-graph, it is a |V|x|V| matrix, |V| being the number of vertices and
-A(i,j) is 1 if there is an edge from vertex i-1 to
-vertex j-1 and zero otherwise. This definition can be generalized to
-represent multiple edges, ie. A(i,j) is the number of edges from
-vertex i-1 to vertex j-1, and can represent undirected graphs as
-well. 
-</para>
-
-<para>
-&igraph; provides the <function>graph.adjacency()</function> to create
-graphs from adjacency matrices. Its only required parameter is the
-adjacency matrix, and it has an optional <parameter>mode</parameter>
-parameter which specifies how to interpret the adjacency matrix. Its
-possible values:
-<glosslist>
-<glossentry>
-<glossterm><constant>directed</constant></glossterm>
-<glossdef><para>A directed graph will be created, A(i,j) gives the number of
-edges from vertex i-1 to vertex j-1.</para></glossdef>
-</glossentry>
-<glossentry>
-<glossterm><constant>undirected</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges added from vertex i-1 to vertex j-1 is the maximum of A(i,j) and
-A(j,i).</para></glossdef>
-</glossentry>
-<glossentry>
-<glossterm><constant>max</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges added from vertex i-1 to vertex j-1 is the maximum of A(i,j) and
-A(j,i). This mode is the same as <constant>undirected</constant>.
-</para></glossdef>
-</glossentry>
-<glossentry>
-<glossterm><constant>min</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges from vertex i-1 to vertex j-1 is the minimum if A(i,j) and
-A(j,i).</para></glossdef>
-</glossentry>
-<glossentry>
-<glossterm><constant>upper</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges between vertices is given by the upper triangle of the 
-adjacency matrix, the lower triangle is ignored. (The diagonal is
-considered to be part of the upper triangle so loop edges might be
-created.)</para></glossdef>
-</glossentry>
-<glossentry>
-<glossterm><constant>lower</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges between vertices is given by the lower triangle of the adjacency
-matrix, the upper triangle is ignored. (The diagonal is considered to
-be part of the lower triangle so loop edges might be
-created.)</para></glossdef> 
-</glossentry>
-<glossentry>
-<glossterm><constant>plus</constant></glossterm>
-<glossdef><para>An undirected graph will be created, the number of
-edges from vertex i-1 to vertex j-1 is given by A(i,j)+A(j,i).
-</para></glossdef>
-</glossentry>
-</glosslist>
-</para>
-
-<para>
-Here are some examples, we use the same adjacency matrix with
-different <parameter>mode</parameter> parameter.
-TODO
-</para>
-
-<para>
-<function>graph.adjacency()</function> also accepts logical matrices,
-the TRUE value corresponds to 1 and FALSE is interpreted as 0. This
-can be used to create graph based on a <emphasis>threshold</emphasis>
-on the A(i,j) values: 
-<informalexample><programlisting>
-<prompt>> </prompt> M &lt;- matrix( runif(100), nr=10 )
-<prompt>> </prompt> graph.adjacency( M >= 0.9 )
-</programlisting>
-<screen>
-Vertices: 10 
-Edges: 13 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 7
-[1] 1 -> 1
-[2] 1 -> 4
-[3] 1 -> 5
-[4] 3 -> 0
-[5] 4 -> 0
-[6] 4 -> 2
-[7] 4 -> 7
-[8] 6 -> 8
-[9] 7 -> 4
-[10] 7 -> 5
-[11] 7 -> 7
-[12] 9 -> 7
-</screen>
-</informalexample>
-</para>
-
-<para>The <quote>inverse</quote> operation of
-<function>graph.adjacency()</function> is
-<function>get.adjacency()</function>, this takes a graph and returns an
-adjacency matrix. For undirected graphs it also takes an optional
-argument called <parameter>type</parameter>. If its value is
-<constant>both</constant> then a symmetric adjacency matrix is
-returned, for <constant>upper</constant> only the upper triangle
-of the adjacency matrix will contain the data (including the
-diagonal), the lower triangle is filled with
-zeros. <constant>lower</constant> is the opposite: the lower triangle
-(including the diagonal) contains data, the upper triangle is filled
-with zeros.
-</para>
-
-</section>
-
-<section><title>Real world examples</title>
-
-<para>
-This section show a detailed example on how to convert your data into
-an igraph graph.
-</para>
-
-<para>Suppose you're just back from your field research or you've
-found some nice piece of data online and you want to turn your data
-into an igraph graph object to play with it. Although we cannot give a
-general receipt which works in all cases, the following example should
-provide you enough guidelines to handle almost any type of data you'll
-find.</para>
-
-<para>
-If your data is not in an electronic format, then you need to type it
-in into one or more files first. This can be done by any basic editor
-you are familiar with, for example notepad or wordpad on Microsoft
-operating systems, emacs or vi on Unix-like systems. You can also use
-a speadsheet program if you like but make sure that it can export CSV
-(comma separated value) files.
-</para>
-
-<para>
-You can also type in your data directly into R, in the first example
-we will show you how this can be done.
-</para>
-
-<section><title>A simple graph</title>
-
-<para>
-If you have a graph with not too many vertices and edges, you can type
-it in directly into R. (This is of course possible for larger graphs
-as well, but we do not recommend it as text editors are generally much
-more comfortable.)
-</para>
-
-<para>
-First we will create a data frame containing a weighted symbolic edge
-list, and then we will transform the data frame into an igraph
-graph. In case you don't know what data frames are, they are tables
-and generally each row in the table corresponds to an individual (or
-something else if you have non-social networks) and each column is a
-variable, a trait or observation of the individuals.
-</para>
-
-<para>
-A data frame can be edited with the <function>edit()</function>
-function in R, we will use this to type in our data.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>data &lt;- edit(data.frame())
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="editform.png" format="PNG"/></imageobject>
-</mediaobject>
-</informalexample>
-</para>
-
-<para>
-Note that the appearence of the edit window may be slightly different
-on different operating systems or GUIs. You can resize the edit window
-to have a third column for the weigths or simply use the tabulator key
-to move to the third column. Now fill the fields with your graph
-data. Click on the header to set the names of the columns, these will
-be the names of the edge attributes. Click on the 'Quit' button if
-you're ready. Here is an example:
-<informalexample>
-<mediaobject>
-<imageobject><imagedata fileref="editform2.png" format="PNG"/></imageobject>
-</mediaobject>
-</informalexample>
-Now the <varname>dat</varname> variable contains a data frame with
-your data. You can create an igraph graph object from these by calling
-the <function>graph.data.frame()</function>:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.data.frame(dat, directed=FALSE)
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 5 
-Edges: 10 
-Directed: FALSE 
-
-Edges:
-[0] 0 -- 1
-[1] 0 -- 2
-[2] 0 -- 3
-[3] 0 -- 4
-[4] 1 -- 2
-[5] 1 -- 3
-[6] 1 -- 4
-[7] 2 -- 3
-[8] 2 -- 4
-[9] 3 -- 4
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g)$name
-</programlisting>
-<screen>
-[1] "Alice"  "Bob"    "Cecil"  "Denis"  "Eszter"
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g)$weight
-</programlisting>
-<screen>
- [1]  1 -1  1  1 -1  1  1  1  1 -1
-</screen>
-</informalexample>
-</para>
-
-
-</section>
-
-<section><title>A graph with attributes</title>
-
-<para> Let us suppose that you've colledted information about the
-social network of a small group, say ten people. You want to store
-various attributes of the people and different types of relations
-(like friendship, business relationship, etc.) among them. You decide
-to store everything in a single graph, for simplicity.
-</para>
-
-<para>
-The following traits are collected about the people in the
-experiment: name, age, gender and R will assign numeric ids to them.
-Here is the complete data set:
-<informaltable frame="all">
-<tgroup cols="3">
-<thead>
-  <row><entry>Name</entry><entry>Age</entry><entry>Gender</entry></row>
-</thead>
-<tbody>
-  <row><entry>Alice Anderson</entry><entry>48</entry><entry>F</entry></row>
-  <row><entry>Bob Bradford</entry>  <entry>33</entry><entry>M</entry></row>
-  <row><entry>Cecil Connor</entry>  <entry>45</entry><entry>F</entry></row>
-  <row><entry>David Daugher</entry> <entry>34</entry><entry>M</entry></row>
-  <row><entry>Esmeralda Escobar</entry><entry>21</entry><entry>F</entry></row>
-  <row><entry>Frank Finley</entry>  <entry>36</entry><entry>M</entry></row>
-  <row><entry>Gabi Garbo</entry>    <entry>44</entry><entry>F</entry></row>
-  <row><entry>Helen Hunt</entry>    <entry>40</entry><entry>F</entry></row>
-  <row><entry>Iris Irving</entry>   <entry>25</entry><entry>F</entry></row>
-  <row><entry>James Jones </entry>  <entry>47</entry><entry>M</entry></row>
-</tbody>
-</tgroup>
-</informaltable>
-</para>
-
-<para>The next table contains all the different relations among these
-people, some relations are binary (YES or NO, eg. the one indicating
-whether or not two people work in the same room), others like
-friendship might have values between zero and five.
-<informaltable>
-<tgroup cols="5">
-<thead>
-<row>
-  <entry>Name 1</entry>
-  <entry>Name 2</entry>
-  <entry>Same department</entry>
-  <entry>Friendship</entry>
-  <entry>Advice</entry>
-</row>
-</thead>
-<tbody>
-<row>
-  <entry>Bob</entry><entry>Alice</entry>
-  <entry>N</entry><entry>4</entry><entry>4</entry>
-</row>
-<row>
-  <entry>Cecil</entry><entry>Bob</entry>
-  <entry>N</entry><entry>5</entry><entry>5</entry>
-</row>
-<row>
-  <entry>Cecil</entry><entry>Alice</entry>
-  <entry>Y</entry><entry>5</entry><entry>5</entry>
-</row>
-<row>
-  <entry>David</entry><entry>Alice</entry>
-  <entry>N</entry><entry>2</entry><entry>4</entry>
-</row>
-<row>
-  <entry>David</entry><entry>Bob</entry>
-  <entry>N</entry><entry>1</entry><entry>2</entry>
-</row>
-<row>
-  <entry>Esmeralda</entry><entry>Alice</entry>
-  <entry>Y</entry><entry>1</entry><entry>3</entry>
-</row>
-<row>
-  <entry>...</entry><entry>...</entry>
-  <entry>...</entry><entry>...</entry><entry>...</entry>
-</row>
-</tbody>
-</tgroup>
-</informaltable>
-</para>
-
-<para>
-Note that we will have a directed graph because the relations are not
-symmetric. Ie. according to line 1 Alice asks Bob very rarely for
-advice, but (line 2) Bob seeks Alice's advice quite often.
-</para>
-
-<para>
-Let us assume that this data is save to a file in CSV format, this
-simply means that the entries in the table are separated by commas.
-The first file (<filename>traits.csv</filename>) contains the traits
-and looks like this:
-<screen>
-Alice Anderson,    48, F
-Bob Bradford,      33, M
-Cecil Connor,      45, F
-David Daugher,     34, M
-Esmeralda Escobar, 21, F
-Frank Finley,      36, M
-Gabi Garbo,        44, F
-Helen Hunt,        40, F
-Iris Irving,       25, F
-James Jones,       47, M
-</screen> and the second file which contains the relations looks like
-this:
-<screen>
-Bob,       Alice,     N, 4, 4
-Cecil,     Bob,       N, 5, 5
-Cecil,     Alice,     Y, 5, 5
-David,     Alice,     N, 2, 4
-David,     Bob,       N, 1, 2
-Esmeralda, Alice,     Y, 1, 3
-...
-</screen>
-</para>
-
-<para>Click here for the full files: <ulink
-url="traits.csv"><filename>traits.csv</filename></ulink> and <ulink
-url="relations.csv"><filename>relations.csv</filename></ulink>.</para> 
-
-<para>
-Let us now import this data into R and create an igraph graph from it. 
-First we will import the data into data frames. (If you don't know
-what data frames are, don't worry you'll still survice this section,
-but it might worth to consult the R tutorial. For now the important
-thing is that a data frame is like a table.) The command
-<function>read.csv()</function> can read a CSV file and stores the
-data in a data frame:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>traits &lt;- read.csv("traits.csv", head=FALSE)
-<prompt>> </prompt>rel &lt;- read.csv("relations.csv", head=FALSE)
-</programlisting>
-</informalexample>
-The <parameter>head</parameter> parameter is set to
-<constant>FALSE</constant>, this instructs R not to interpret the
-first line of the file as a header. Set this to
-<constant>TRUE</constant> (or omit the parameter) if you have a header
-with column names in your file.
-</para>
-
-<para>
-We will first create an empty graph with ten vertices and the traits
-as vertex attributes. This can be done with a single command after
-loading the package:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>library(igraph)
-<prompt>> </prompt>g &lt;- graph.empty()
-<prompt>> </prompt>g &lt;- add.vertices(g, nrow(traits), 
-                     name=as.character(traits[,1]), age=traits[,2],
-                     gender=as.character(traits[,3]))
-</programlisting>
-</informalexample>
-</para>
-
-<para>
-We can check that the graph is created properly:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>V(g)$name
-</programlisting>
-<screen>
- [1] "Alice Anderson"    "Bob Bradford"      "Cecil Connor"     
- [4] "David Daugher"     "Esmeralda Escobar" "Frank Finley"     
- [7] "Gabi Garbo"        "Helen Hunt"        "Iris Irving"      
-[10] "James Jones"
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g)$age
-</programlisting>
-<screen>
- [1] 48 33 45 34 21 36 44 40 25 47
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g)$gender
-</programlisting>
-<screen>
- [1] "F" "M" "F" "M" "F" "M" "F" "F" "F" "M"
-</screen>
-</informalexample>
-</para>
-
-<para>
-Now we continue by adding the edges. First we need to cut the first
-names from the full names, since the edges are given with the first
-names only. If you want to spare this step use the same names in both
-files. 
-<informalexample>
-<programlisting>
-<prompt>> </prompt>names &lt;- sapply(strsplit(V(g)$name, " "), "[",1)
-<prompt>> </prompt>ids &lt;- 1:length(names)-1
-<prompt>> </prompt>names(ids) &lt;- names
-<prompt>> </prompt>ids
-</programlisting>
-<screen>
-    Alice       Bob     Cecil     David Esmeralda     Frank      Gabi     Helen
-        0         1         2         3         4         5         6         7
-     Iris     James 
-        8         9 
-</screen>
-</informalexample>
-</para>
-
-<para>
-Then, we create an edge list with vertex ids instead of symbolic
-names:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>from &lt;- as.character(rel[,1])
-<prompt>> </prompt>to &lt;- as.character(rel[,2])
-<prompt>> </prompt>edges &lt;- matrix(c(ids[from], ids[to]), nc=2)
-<prompt>> </prompt>edges
-</programlisting>
-<screen>
-      [,1] [,2]
- [1,]    1    0
- [2,]    2    1
- [3,]    2    0
- [4,]    3    0
- [5,]    3    1
- [6,]    4    0
- [7,]    5    0
- [8,]    5    4
- [9,]    6    1
-[10,]    6    0
-[11,]    7    0
-[12,]    8    2
-[13,]    8    1
-[14,]    8    4
-[15,]    9    0
-[16,]    9    1
-[17,]    9    6
-[18,]    0    1
-[19,]    1    2
-[20,]    0    2
-[21,]    0    3
-[22,]    1    3
-[23,]    0    4
-[24,]    0    5
-[25,]    4    5
-[26,]    1    6
-[27,]    0    6
-[28,]    0    7
-[29,]    2    8
-[30,]    1    8
-[31,]    4    8
-[32,]    0    9
-[33,]    1    9
-[34,]    6    9
-</screen>
-</informalexample>
-</para>
-
-<para>
-And finally we can add the edges together with their attributes:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- add.edges(g, t(edges), 
-               room=as.character(rel[,3]),
-	       friend=rel[,4], advice=rel[,5])
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 10 
-Edges: 34 
-Directed: TRUE 
-
-Edges:
-[0] 1 -> 0
-[1] 2 -> 1
-[2] 2 -> 0
-[3] 3 -> 0
-[4] 3 -> 1
-[5] 4 -> 0
-[6] 5 -> 0
-[7] 5 -> 4
-[8] 6 -> 1
-[9] 6 -> 0
-[10] 7 -> 0
-[11] 8 -> 2
-[12] 8 -> 1
-[13] 8 -> 4
-[14] 9 -> 0
-[15] 9 -> 1
-[16] 9 -> 6
-[17] 0 -> 1
-[18] 1 -> 2
-[19] 0 -> 2
-[20] 0 -> 3
-[21] 1 -> 3
-[22] 0 -> 4
-[23] 0 -> 5
-[24] 4 -> 5
-[25] 1 -> 6
-[26] 0 -> 6
-[27] 0 -> 7
-[28] 2 -> 8
-[29] 1 -> 8
-[30] 4 -> 8
-[31] 0 -> 9
-[32] 1 -> 9
-[33] 6 -> 9
-</screen>
-</informalexample>
-</para>
-
-<para>
-You can find the whole program creating the graph in file
-<ulink url="import.R"><filename>import.R</filename></ulink>.
-</para>
-
-<para>
-Finally we can create a nice plot of the graph, with the edges
-connecting people working in the same room colored red.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>E(g)$color &lt;- "black"
-<prompt>> </prompt>E(g)[ room=="Y" ]$color &lt;- "red"
-<prompt>> </prompt>tkplot(g, layout=layout.kamada.kawai, edge.color=E(g)$color)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="import.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="import.png" format="PNG"/></imageobject>
-</mediaobject></informalexample>
-</para>
-
-</section>
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/datamodel.xml igraph-0.6.5/doc/book/datamodel.xml
--- igraph-0.6.5~quantal1/doc/book/datamodel.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/datamodel.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,165 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-datamodel">
-<title>The igraph data model</title>
-
-<para>
-This section introduces the &igraph; data model. It is recommended
-that the reader should be familiar with this model of computation to
-understand the semantics of the &igraph; functions better.
-</para>
-
-<para>
-An &igraph; graph is either <glossterm>directed</glossterm> or
-<glossterm>undirected</glossterm>, &igraph; cannot handle mixed graphs
-with both directed and undirected edges.
-</para>
-
-<section><title>Directed graphs</title>
-
-<para>
-The &igraph; data model is slightly different for directed and
-undirected graphs, we start with the directed case. In &igraph;
-vertices are identified by <glossterm>vertex id</glossterm>s: integer
-number between zero and |V|-1, if |V| is the number of vertices in the
-graph. Thus the numbering of vertex ids is always continual, all
-&igraph; operations on graphs keep this important property. 
-</para>
-
-<para>
-Directed &igraph; edges are ordered pairs or vertex ids. A directed
-graph is an ordered multiset of directed edges and some additional
-meta data: the number of vertices in the graph and a boolean tag to
-mark the graph as directed. Here is an example of a directed &igraph;
-graph: 
-<informalexample>
-<programlisting>
-  ( vertices: 6, 
-    directed: yes,
-    (
-     (0,2),
-     (2,2),
-     (2,3),
-     (3,3),
-     (3,4),
-     (3,4),
-     (4,1)
-    )
-  )
-</programlisting>
-</informalexample>
-</para>
-
-<para>
-Just like the vertices have vertex ids, &igraph; edges also have ids:
-edge ids are integer numbers between zero and |E|-1, |E| is the number
-of edges in the graph. 
-</para>
-
-</section>
-
-<section><title>Undirected graphs</title>
-
-<para>
-An undirected &igraph; edge is a two-element or one-element set of
-vertex ids. The two element set is a non-loop edge, ie. the edge
-connects different vertices, while loop edges are represented with a
-single-element set. An undirected graph is an ordered multiset of
-undirected edges, plus the usual meta data: the number of vertices and
-the fact that the graph is undirected. Here is an example for an
-undirected graph:
-<informalexample>
-<programlisting>
-  ( vertices: 6,
-    directed: no,
-    (
-     {0,2},
-     {2},
-     {2,3},
-     {3},
-     {3,4},
-     {3,4},
-     {4,1}
-    )
-  )
-</programlisting>
-</informalexample>
-This graph contains both loop edges ({2} and {3}, ie. (2-2) and (3-3))
-and multiple edges ({3,4} twice). 
-</para>
-
-</section>
-
-<section><title>Examples</title>
-
-<para>
-We give some simple examples on how this data model is used in
-computations. The first example is the
-<function>are.connected()</function> function, this decides whether two
-vertices are connected by an edge. Lets assume that G1 and G2 are the
-graphs from the previous two sections, G1 is the directed, G2 the
-undirected graph. Now if we check with
-<function>are.connected()</function> whether vertices 0 and 2 are
-connectedin G1, the function searches for the (0,2) <emphasis>directed
-pair</emphasis>, and since it finds it it returns positive result. If the
-same search is performed on G2, the function searches for the {0,2}
-set and the result is, again, positive. Now it is perhaps obvious by
-now that if we suppply the vertices in the opposite order, ie. 2 and 0
-then in G1 the (2,0) ordered pair is requested, so the answer is
-negative. For G2 {0,2}={2,0} is searched again, the answer is still
-positive.
-</para>
-
-<para>
-Another simple example is the <function>neighbors()</function> command,
-this can be used to find the neighboring vertices of a
-vertex. <function>neighbors()</function> (like many other functions in
-&igraph;) has a parameter called <parameter>mode</parameter>. This
-parameter defines how the search is performed in directed graphs. Let
-us assume that we are interested in the neighbors of vertex 3. If
-<parameter>mode</parameter> is <constant>out</constant> then the
-graph's edge list (which is a multiset) is searched for elements
-having 3 in the first position of the ordered pair and returns the
-vertex ids in the second position in these elements. So the answer is
-(3,4,4). Now if <parameter>mode</parameter> is <constant>in</constant>
-then the role of the first and second positions is exchanged and 
-(2,3) is returned. The third possible value of
-<parameter>mode</parameter> is <constant>all</constant>, in this case
-pairs having 3 at either at the first or second positions are searched
-and the <emphasis>other</emphasis> vertex id in the pair is returned:
-(2,3,4,4). Note that 3 is returned only once even if it is found both
-ways. This of course corresponds to the normal graph theoretic
-conventions. 
-</para>
-
-<para>
-The <parameter>mode</parameter> argument is always ignored when
-dealing with undirected graphs, as these graphs store an edge as an
-unordered pair (ie. a set). For example running
-<function>neighbors()</function> on graph G2 and vertex 3, the result is 
-(2,3,4,4). 
-</para>
-
-<para>
-Note that if we set <parameter>mode</parameter> to
-<constant>all</constant> on a directed graph that essentially means
-that we use the corresponding undirected graph for calculation. Also
-note that the corresponding undirected graph always have the same
-number of edges as the directed counterpart, eg. if the directed graph
-contains (3,4) and (4,3) these edges make two {3,4} edges in the
-undirected graph.
-</para>
-
-<para>
-Some &igraph; functions have a <parameter>mode</parameter> for other
-purposes: eg. <function>graph.tree()</function> and
-<function>graph.star()</function>. 
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/devhelp.xsl igraph-0.6.5/doc/book/devhelp.xsl
--- igraph-0.6.5~quantal1/doc/book/devhelp.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/devhelp.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,131 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version='1.0'
-                xmlns="http://www.devhelp.net/book"
-                exclude-result-prefixes="#default">
-
-  <xsl:template name="generate.devhelp">
-    <xsl:call-template name="write.chunk">
-      <xsl:with-param name="filename">
-        <xsl:choose>
-          <xsl:when test="$gtkdoc.bookname">
-            <xsl:value-of select="$gtkdoc.bookname"/>
-          </xsl:when>
-          <xsl:otherwise>
-            <xsl:text>book</xsl:text>
-          </xsl:otherwise>
-        </xsl:choose>
-        <xsl:text>.devhelp</xsl:text>
-      </xsl:with-param>
-      <xsl:with-param name="method" select="'xml'"/>
-      <xsl:with-param name="indent" select="'yes'"/>
-      <xsl:with-param name="encoding" select="'utf-8'"/>
-      <xsl:with-param name="content">
-        <xsl:call-template name="devhelp"/>
-      </xsl:with-param>
-    </xsl:call-template>
-  </xsl:template>
-
-  <xsl:template name="devhelp">
-    <xsl:variable name="title">
-      <xsl:apply-templates select="." mode="generate.devhelp.toc.title.mode"/>
-    </xsl:variable>
-    <xsl:variable name="link">
-      <xsl:call-template name="href.target"/>
-    </xsl:variable>
-    <xsl:variable name="author">
-      <xsl:if test="articleinfo|bookinfo">
-        <xsl:apply-templates mode="generate.devhelp.authors"
-                             select="articleinfo|bookinfo"/>
-      </xsl:if>
-    </xsl:variable>
-    <xsl:variable name="toc.nodes" select="part|reference|preface|chapter|
-                                           appendix|article|bibliography|
-                                           glossary|index|refentry|refsection|
-                                           bridgehead|sect1"/>
-
-    <book title="{$title}" link="{$link}" author="{$author}" name="{$gtkdoc.bookname}">
-      <xsl:if test="$toc.nodes">
-        <chapters>
-          <xsl:apply-templates select="$toc.nodes"
-                               mode="generate.devhelp.toc.mode"/>
-        </chapters>
-      </xsl:if>
-      <functions>
-        <xsl:apply-templates select="//refsect2"
-                             mode="generate.devhelp.index.mode"/>
-      </functions>
-    </book>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.devhelp.toc.mode">
-    <xsl:variable name="title">
-      <xsl:apply-templates select="." mode="generate.devhelp.toc.title.mode"/>
-    </xsl:variable>
-    <xsl:variable name="target">
-      <xsl:variable name="anchor" select="title/anchor"/>
-      <xsl:choose>
-        <xsl:when test="$anchor">
-          <xsl:call-template name="href.target">
-            <xsl:with-param name="object" select="$anchor"/>
-          </xsl:call-template>
-        </xsl:when>
-        <xsl:otherwise>
-          <xsl:call-template name="href.target"/>
-        </xsl:otherwise>
-      </xsl:choose>
-    </xsl:variable>
-
-    <sub name="{$title}" link="{$target}">
-      <xsl:apply-templates select="section|sect1|
-                                   refentry|refsect|refsection|
-                                   bridgehead|part|chapter"
-                           mode="generate.devhelp.toc.mode"/>
-    </sub>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.devhelp.index.mode">
-    <xsl:variable name="title" select="title"/>
-    <xsl:variable name="anchor" select="title/anchor"/>
-    <xsl:variable name="target">
-      <xsl:choose>
-        <xsl:when test="$anchor">
-          <xsl:call-template name="href.target">
-            <xsl:with-param name="object" select="$anchor"/>
-          </xsl:call-template>
-        </xsl:when>
-        <xsl:otherwise>
-          <xsl:call-template name="href.target"/>
-        </xsl:otherwise>
-      </xsl:choose>
-    </xsl:variable>
-    <function name="{$title}" link="{$target}"/>
-  </xsl:template>
-
-  <!-- get title -->
-  <xsl:template match="article" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="articleinfo/title"/>
-  </xsl:template>
-  <xsl:template match="book" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="bookinfo/title"/>
-  </xsl:template>
-  <xsl:template match="refentry" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="refmeta/refentrytitle"/>
-  </xsl:template>
-  <xsl:template match="*" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="title"/>
-  </xsl:template>
-
-  <!-- generate list of authors ... -->
-  <xsl:template match="articleinfo|bookinfo" mode="generate.devhelp.authors">
-    <xsl:for-each select="authorgroup/author">
-      <xsl:value-of select="firstname"/>
-      <xsl:text> </xsl:text>
-      <xsl:value-of select="surname"/>
-      <xsl:if test="not(last())">
-        <xsl:text>, </xsl:text>
-      </xsl:if>
-    </xsl:for-each>
-  </xsl:template>
-
-</xsl:stylesheet>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/editform.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/editform.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/editform2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/editform2.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/flows.xml igraph-0.6.5/doc/book/flows.xml
--- igraph-0.6.5~quantal1/doc/book/flows.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/flows.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,505 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-flows">
-<title>Network Flows and Related Concepts</title>
-
-<section><title>Flows in Directed Graphs</title>
-
-<para>
-Imagine that you have a transportation network described by a directed
-graph. Each transportation route has a given capacity, the amount of
-goods that can be carried from a given city to another one in unit
-time. Imagine also that you have a factory (the source vertex) in a
-given city that produces the goods and there is a consumer (the target
-vertex) which consumes the goods produced in the factory. The factory
-can produce arbitrary an large volume of goods, and the consumer can
-comsume an arbitrary large volume of goods as well. The bottleneck of
-the system is the transportation. We want to know the amount of goods
-that can be transported from the source to the target in a time unit.
-This is the maximum flow problem.
-</para>
-
-<para>
-The mathematical definition of this problem is as follows: let G=(V,E)
-be a directed graph with vertices V and edges E, and let c:E->R+, a
-function which assigns non-negative numbers to the edges of the graph,
-this is the capacity of the edge. Let s and t two different vertices
-of the graph, the source and the target vertex respectively. A flow is
-a f:E->R+ function assigning non-negative number to the edges, such
-that: (1) f(e) &lt;= c(e) for every edge, (2) the incoming flow is the
-same as the outgoing flow except for s and t, 
-sum(f(i->j), i) == sum(f(j->k), k) for every j vertex. The value of
-the flow is the incoming flow at the target vertex: sum(f(i->t), i).
-The maximum flow is the flow of maximal value.
-</para>
-
-<para>
-There are many algorithms for determining the maximum flow in a
-directed networks, the classic one was suggested by Ford and Furkelson
-(TODO: cite). A popular algorithm is the push/relabel method of
-Goldberg and Tarjan (TODO: cite) and this is implemented in &igraph;. 
-The current &igraph; implementation does not actually calculate the
-maximum flow itself, only its value. Let us see a small example:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g1 &lt;- graph.ring(9, directed=TRUE)
-<prompt>> </prompt>g2 &lt;- graph.star(10, center=9, mode="out")
-<prompt>> </prompt>g &lt;- graph.union(g1, g2)
-<prompt>> </prompt>g &lt;- add.edges(g, c(3,9))
-<prompt>> </prompt>E(g)$capacity &lt;- sample(1:10, ecount(g), replace=TRUE)
-<prompt>> </prompt>E(g)[ 3 %--% 9 ]$capacity &lt;- 5
-<prompt>> </prompt>id &lt;- tkplot(g, layout=layout.kamada.kawai, edge.labels=E(g)$capacity)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="flow1.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="flow1.png" format="PNG"/></imageobject>
-</mediaobject>
-</informalexample>
-We create a wheel graph, as the union of a star and a ring graph as
-there is no built-in wheel graph constructor in &igraph;. Then we add a
-directed edge (3->9) to make the graph strongly connected. We assign
-random capacities to the edges and make sure that edges 3->9 and 9->3
-have the same capacity, just to make the plot clear. Let us now do
-some maximum flow calculations:
-<informalexample><programlisting>
-<prompt>> </prompt>graph.maxflow(g, 2, 7)
-</programlisting>
-<screen>
-[1] 7
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.maxflow(g, 3, 6)
-</programlisting>
-<screen>
-[1] 7
-</screen>
-</informalexample>
-The maximum flow from 2 to 7 is 7, 5 amounts of flow along 2->3->9->7
-and 2 amounts along 2->3->4->5->6->7. The maximum flow from 3 to 6 is 
-also 7, 4 amounts of flow along 3->9->6, 1 along 3->9->5->6,
-and 2 amounts along 3->4->5->6.
-</para>
-
-<para>
-Let us create a nice plot with the maximum flow from 3 to
-6. Unfortunately we must set the edge labels by hand, as &igraph; cannot
-calculate the flow itself. 
-<informalexample>
-<programlisting>
-<prompt>> </prompt>E(g)$color &lt;- "grey"
-<prompt>> </prompt>E(g, path=c(3,9,6))$color &lt;- "red"
-<prompt>> </prompt>E(g, path=c(3,9,5,6))$color &lt;- "red"
-<prompt>> </prompt>E(g, path=c(3,4,5,6))$color &lt;- "red"
-<prompt>> </prompt>V(g)$color &lt;- "lightblue"
-<prompt>> </prompt>V(g)[3]$color &lt;- "pink"
-<prompt>> </prompt>V(g)[6]$color &lt;- "orange"
-<prompt>> </prompt>E(g)$label &lt;- E(g)$capacity
-<prompt>> </prompt>E(g)[ 3 %->% 9 ]$label &lt;- "5/5"
-<prompt>> </prompt>E(g)[ 3 %->% 4 ]$label &lt;- "2/2"
-<prompt>> </prompt>E(g)[ 9 %->% 6 ]$label &lt;- "4/4"
-<prompt>> </prompt>E(g)[ 9 %->% 5 ]$label &lt;- "1/2"
-<prompt>> </prompt>E(g)[ 4 %->% 5 ]$label &lt;- "2/8"
-<prompt>> </prompt>E(g)[ 5 %->% 6 ]$label &lt;- "3/3"
-<prompt>> </prompt>coords &lt;- tkplot.getcoords(id)
-<prompt>> </prompt>tkplot(g, layout=coords, edge.labels=E(g)$label,
-       edge.color=E(g)$color, vertex.color=V(g)$color)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="flow2.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="flow2.png" format="PNG"/></imageobject>
-</mediaobject>
-</informalexample>
-</para>
-
-</section>
-
-<!--- ################################################################ -->
-
-<section><title>Flows in Undirected Graphs</title>
-<para>
-A maximum flow in an undirected graph is of course similar to the
-directed version. We assume that on an edge e with capacity c(e) it is
-possible to have flows in both directions at the same time, ie. we
-replace the undirected graph with a directed graph by rewriting each
-undirected edge with two directed edges having the same capacities as
-the undirected edge. There is a slight problem with this
-representation: the total flow on the undirected edge can be
-larger than its capacity if there is big enogh flow on both
-corresponding directed edges. This is not a real problem however since
-the flow can be replaced with another flow of the same value and not
-violating the capacity limits. If the flow on the two edges are f(e1)
-and f(e2) then these can be replaced by f(e1)-min(f(e1), f(e2)) and
-f(e2)-min(f(e1), f(e2)).
-</para>
-
-<para>
-Let us see the previous example, but this time with an undirected
-graph:
-<informalexample><programlisting>
-<prompt>> </prompt>el &lt;- cbind(get.edgelist(g), E(g)$capacity)
-<prompt>> </prompt>el &lt;- el[ el[,1] != 3 | el[,2] != 9, ]
-<prompt>> </prompt>g2 &lt;- graph.empty(n=vcount(g), directed=FALSE)
-<prompt>> </prompt>g2 &lt;- add.edges(g2, t(el[,1:2]), attr=list(capacity=el[,3]))
-<prompt>> </prompt>tkplot(g2, layout=coords, edge.labels=E(g2)$capacity)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="flow3.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="flow3.png" format="PNG"/></imageobject>
-</mediaobject>
-<programlisting>
-<prompt>> </prompt>graph.maxflow(g, 2, 7)
-</programlisting>
-<screen>
-[1] 13
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.maxflow(g, 3, 6)
-</programlisting>
-<screen>
-[1] 13
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g2)$label &lt;- E(g2)$capacity
-<prompt>> </prompt>flow.edges &lt;- c(1,2, 2,3, 3,4, 4,5, 5,6, 6,7, 
-        1,9, 2,9, 3,9, 5,9, 6,9, 7,9)
-<prompt>> </prompt>E(g2, P=flow.edges)$label &lt;- c("3/3","6/7","2/2","2/8","3/3","6/7",
-        "3/6","3/3","5/5","1/2","4/4","6/6")
-<prompt>> </prompt>E(g2)$color &lt;- "grey"
-<prompt>> </prompt>E(g2, P=flow.edges)$color &lt;- "red"
-<prompt>> </prompt>V(g2)$color &lt;- V(g)$color
-<prompt>> </prompt>tkplot(g2, layout=coords, edge.color=E(g2)$color, 
-       edge.label=E(g2)$label, vertex.color=V(g2)$color)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="flow4.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="flow4.png" format="PNG"/></imageobject>
-</mediaobject>
-</informalexample>
-This example would be of course much more simpler if &igraph; could
-calculate the actual maximum flow.
-</para>
-
-</section>
-
-<!--- ################################################################ -->
-
-<section><title>Minumum Cuts</title>
-<para>
-Let us first deal with the directed minimum s-t cut problem. Let
-G=(V,E) be a directed graph and s, t two vertices from V. Let w:E->R+ a
-function which assigns non-negative weights to the vertices. What is
-the minimum total weight of the edges needed to remove to eliminate
-all directed paths from s to t?
-</para>
-
-<para>
-If there is no directed path at all from s to t, then the minimum s-t
-cut is zero.
-</para>
-
-<para>
-Note that in the directed case the problem is not symmetric, the edges
-required to remove the paths from s to t are not neccesarily the same
-needed to remove all paths from t to s. Here is an example for a
-simple tree.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.tree(15)
-<prompt>> </prompt>E(g)$capacity &lt;- 1
-<prompt>> </prompt>plot(g, layout=layout.reingold.tilford)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="flow5.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="flow5.png" format="PNG"/></imageobject>
-</mediaobject>
-<programlisting>
-<prompt>> </prompt>graph.mincut(g, 0, 10)
-</programlisting>
-<screen>
-[1] 1
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.mincut(g, 10, 0)
-</programlisting>
-<screen>
-[1] 0
-</screen>
-</informalexample>
-</para>
-
-<para>
-Calculating the minimum s-t cut requires a maximum flow computation
-from vertex s to vertex t, moreover in fact the value of the minimum
-cut is the same as the value of the maximum flow from s to t.
-</para>
-
-<para>
-The minimum cut in a graph is a the minimum cut of all possible s-t
-cuts. <function>graph.mincut()</function> cat calculate this as well,
-but (as usual) it does not give the actual edges in cut, only the
-value of the cut, the total weight (called capacity in the maximum
-flow problem).
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.full(10)
-<prompt>> </prompt>E(g)$capacity &lt;- 1
-<prompt>> </prompt>graph.mincut(g, 0, 5)
-</programlisting>
-<screen>
-[1] 9
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.mincut(g)
-</programlisting>
-<screen>
-[1] 9
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.maxflow(g, 0, 5)
-</programlisting>
-<screen>
-[1] 9
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-<section><title>Edge Connectivity</title>
-<para>
-The edge connectivity of two vertices (say s and t) in a graph is
-simply the number of edges that needed to be removed to eliminate all
-paths from s to d. Note that this is a special case of a minimum s-t
-cut, where all edges have capacity 1. In the following example we use
-the wheel graph, as shown previously at the discussion of undirected
-maximum flows. 
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.union(graph.ring(9), 
-                   graph.star(10, c=9, mode="undirected"))
-<prompt>> </prompt>edge.connectivity(g, 1, 6)
-</programlisting>
-<screen>
-[1] 3
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g)$capacity &lt;- 1
-<prompt>> </prompt>graph.mincut(g, 1, 6)
-</programlisting>
-<screen>
-[1] 3
-</screen>
-</informalexample>
-</para>
-
-<para>
-The edge connectivity of a graph is the minimum number of edges needed
-to remove to disconnect the graph. This happens to be the same as the
-minimum of the edge connectivities of every pairs of vertices,
-although the edge connectivity of a graph is calculated in a different
-way, as the following example demonstrates.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- simplify(ba.game(10,m=4,directed=F))
-<prompt>> </prompt>edge.connectivity(g)
-</programlisting>
-<screen>
-[1] 2
-</screen>
-<programlisting>
-<prompt>> </prompt>sapply(1:9, function(i) edge.connectivity(g,0,i))
-</programlisting>
-<screen>
-[1] 4 2 4 3 2 4 3 3 4
-</screen>
-<programlisting>
-<prompt>> </prompt>min(sapply(1:9, function(i) edge.connectivity(g,0,i)))
-</programlisting>
-<screen>
-[1] 2
-</screen>
-</informalexample>
-It is possible to calculate the edge connectivity of a graph without
-calculating the edge connectivity of all possible pairs of vertices;
-this is done by fixing a vertex (like vertex 0 in the example) and
-calculating the edge connectivity between this vertex and all the
-other vertices in the graph. Note that if the graph is directed then 
-the edge connectivity between the fixed vertex and the other vertices
-has to be calculated both ways.
-</para>
-
-</section>
-
-<section><title>Edge-disjoint Paths</title>
-<para>
-Two paths are edge-disjoint if they do not contain common edges. The
-number of edge-disjoint paths between two vertices can be also
-calculated by maximum flow techniques, moreover this number is simply
-the same the the edge-connectivity of the two vertices. In &igraph;
-the <function>edge.disjoint.paths()</function> function does simply the
-same as <function>edge.connectivity()</function> called with three
-arguments. 
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- simplify(ba.game(10,m=4,directed=F))
-<prompt>> </prompt>sapply(1:9, function(i) edge.disjoint.paths(g,0,i))
-</programlisting>
-<screen>
-[1] 5 6 3 2 2 3 3 2 3
-</screen>
-<programlisting>
-<prompt>> </prompt>sapply(1:9, function(i) edge.connectivity(g,0,i))
-</programlisting>
-<screen>
-[1] 5 6 3 2 2 3 3 2 3
-</screen>
-</informalexample>
-</para>
-</section>
-
-<section><title>Vertex Connectivity</title>
-<para>
-The vertex connectivity (also called connectivity) of two vertices (s
-and t) is the number of vertices needed to remove from the graph to
-eliminate all (possible directed) paths from s to t. Note that this
-quantity is not defined if s and t are adjacent.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- simplify(ba.game(10,m=4,directed=F))
-<prompt>> </prompt>nodes &lt;- V(g)[!nei(9)] ; nodes &lt;- nodes[ nodes != 9 ]
-<prompt>> </prompt>vc &lt;- rep(NA, vcount(g))
-<prompt>> </prompt>vc[nodes] &lt;- sapply(nodes, function(i)
-          vertex.connectivity(g,9,i))
-<prompt>> </prompt>vc
-</programlisting>
-<screen>
- [1] NA  1  2  3 NA  2  2  1 NA NA
-</screen>
-</informalexample>
-Here we first extract those vertices to which it makes sence to
-calculate the vertex connectivity from vertex 9. These are all
-non-adjacent vertices to vertex 9, except for  vertex 9 itself. Then
-we calculate the vertex connectivity to these vertices.
-</para>
-
-<para>
-The vertex connectivity (or simply connectivity) of a graph the
-minimum number of vertices needed to remove from it to disconnect the
-graph. For a full graph, the vertex connectivity is defined to be the
-number of vertices minus one. The vertex connectivity of a graph can
-be obtained if the vertex connectivity of every non-adjacent pairs of
-vertices is calculated and the minimum of these is taken.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.union(graph.ring(9), 
-                   graph.star(10, c=9, mode="undirected"))
-<prompt>> </prompt>vc &lt;- vcount(g)
-<prompt>> </prompt>for (i in 1:vcount(g)) {
-  for (j in 1:vcount(g)) {
-    if (i!=j &amp;&amp; ! (j-1) %in% neighbors(g, i-1)) {
-      vc2 &lt;- vertex.connectivity(g, i-1, j-1)
-      if (vc2 &lt; vc) { vc &lt;- vc2 }
-    }
-  }
-}
-<prompt>> </prompt>vc
-</programlisting>
-<screen>
-[1] 3
-</screen>
-<programlisting>
-<prompt>> </prompt>vertex.connectivity(g)
-</programlisting>
-<screen>
-[1] 3
-</screen>
-</informalexample>
-In this example we calculate the vertex connectivity of the wheel
-graph in two ways, first by taking the minimum of all possible
-pairwise vertex connectivities and then by simply calling
-<function>vertex.connectivity()</function>.
-</para>
-</section>
-
-<section><title>Vertex-disjoint Paths</title>
-
-<para>
-A set of (possibly directed) paths from vertex s to vertex is said to
-be vertex-disjoint is they don't contain common vertices (apart from
-s and t). The maximum number of vertex disjoint paths can be
-calculated with the <function>vertex.disjoint.paths()</function>
-function in &igraph;. Actually in most cases the number of vertex
-disjoint paths is the same as the vertex connectivity of the two
-vertices in question, see the previous section. The only exception is
-when the two vertices are connected by an edge (or more edges). In the
-latter case the vertex connectivity is not defined (it makes no
-sense), but it is meaningful to ask the number of vertex disjoint
-paths between the connected vertices, so this can be calculated by
-<function>vertex.disjoint.paths()</function>.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.union(graph.ring(9), 
-                   graph.star(10, c=9, mode="undirected"))
-<prompt>> </prompt>vertex.connectivity(g, 0, 1)
-</programlisting>
-<screen>
-Error in vertex.connectivity(g, 0, 1) : At flow.c:722 : vertices
-connected, Invalid value
-</screen>
-<programlisting>
-<prompt>> </prompt>vertex.disjoint.paths(g, 0, 1)
-</programlisting>
-<screen>
-[1] 3
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-<section><title>Graph Cohesion and Adhesion</title>
-
-<para>
-Group cohesion and group adhesion was defined in a nice paper by
-Douglas R. White and Frank Harary (TODO: citation). Simply put,
-the cohesion of a group is the vertex connectivity of its subgraph and
-adhesion of a group is the edge connectivity of its subgraph. Thus
-<function>graph.cohesion()</function> and
-<function>graph.adhesion()</function> always give the same results in
-&igraph;.
-<informalexample>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph( c(0,1, 0,2, 1,2, 2,3, 2,4, 3,4), dir=F)
-<prompt>> </prompt>vertex.connectivity(g)
-</programlisting>
-<screen>
-[1] 1
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.cohesion(g)
-</programlisting>
-<screen>
-[1] 1
-</screen>
-<programlisting>
-<prompt>> </prompt>edge.connectivity(g)
-</programlisting>
-<screen>
-[1] 2
-</screen>
-<programlisting>
-<prompt>> </prompt>graph.adhesion(g)
-</programlisting>
-<screen>
-[1] 2
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/foreign.xml igraph-0.6.5/doc/book/foreign.xml
--- igraph-0.6.5~quantal1/doc/book/foreign.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/foreign.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,597 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-foreign">
-<title>Importing and Exporting Graphs</title>
-
-<para>
-The &igraph; library and the &igraph; R package do not introduce a new
-file format to store graphs. Instead if recommends using the GraphML
-format for smaller graphs and some simple edge list format for larger
-graphs, perhaps also complessed.
-</para>
-
-<para>
-&igraph; provides the <function>read.graph()</function> and
-<function>write.graph()</function> functions for reading and writing
-graphs from and to files. Both of these functions can handle a number
-of different file formats, which can be selected by the
-<parameter>format</parameter> argument.
-</para>
-
-<para>
-Note however that you don't neccessarily need special &igraph;
-functions to read and write graphs in various formats, as there is a
-wealth of R functions for importing and exporting data in a variety of
-formats. For example you can use the standard R
-<function>scan()</function> to read an edge list from a file
-and then <function>graph()</function> to create a graph object from
-it. Similarly you can use <function>get.edgelist()</function> to
-create an edge list from a graph object and the standard
-<function>write()</function> to export it to a file.
-</para>
-
-<para>
-As R can also import Excel files via the <filename>.csv</filename>
-file format, Excel files can also easily converted to &igraph; graph
-objects; just like nearly any other format.
-</para>
-
-<para>
-Another possiblity to store graph data in files is to use the
-<function>save()</function> and <function>load()</function> functions
-as provided by R. Graph objects can be safely saved and loaded this
-way. </para>
-
-<section><title>Simple formats</title>
-
-<para>
-Simple formats can tipically store the structure of a graph but no
-or just limited amount of meta-data like edge weights, vertex colors,
-etc.
-</para>
-
-<section><title>Edge List Files</title>
-
-<para>
-Perhaps the simplest file format &igraph; can handle is the edge
-list format. This is nothing more than a simple text file with two
-whitespace separated columns containing vertex ids (ie. non-negative
-numbers). 
-So if the <filename>graph.txt</filename> contains the following
-edge list:
-<screen>
-0 1
-2 3
-3 2
-1 0
-</screen>
-then it can be read by setting the <parameter>format</parameter>
-argument to <constant>edgelist</constant>:
-<informalexample><programlisting>
-<prompt>> </prompt>read.graph("graph.txt", format="edgelist")
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 2 -> 3
-[2] 3 -> 2
-[3] 1 -> 0
-</screen>
-</informalexample>
-<function>read.graph()</function> has an optional
-<parameter>directed</parameter> argument, set this to
-<constant>FALSE</constant> to create an undirected graph, the
-default is directed. There is also an optional
-<parameter>n</parameter> argument, this is the number of vertices in
-the graph. Set this to the desired value if it is bigger than the
-highest vertex id in the edge list file. (If it is set to a smaller
-value then it will be ignored.)
-</para>
-</section>
-
-<section><title>Large Graph Layout Formats</title>
-
-<para>
-These two formats were introduced by the Large Graph Layout
-program, they are abre to store edge weights and symbolic vertex
-names. See also 
-<ulink url="http://bioinformatics.icmb.utexas.edu/lgl">the LGL
-homepage</ulink>.
-</para>
-
-<para>
-The <constant>ncol</constant> format is simply a weighted edge list
-with symbolic vertex names. The vertex names and the weight are
-separaeted by white space, the vertex names themselves cannot contain
-white space. The weights are optional. The vertex names are stored in
-the vertex attribute <constant>name</constant>, the edge weights are
-stored in the edge attribute <constant>weight</constant>. You may set
-the <parameter>names</parameter> and/or <parameter>weights</parameter>
-optional arguments to <constant>FALSE</constant> if you don't want to
-set these attributes.
-</para>
-
-<para>
-If the file <filename>graph.ncol</filename> contains
-the following graph:
-<screen>
-foo    bar 1
-bar    baz -1
-foobar foo 
-foo    baz 2
-</screen>
-then we get the following graph object:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- read.graph("graph.ncol", format="ncol")
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: FALSE 
-
-Edges:
-[0] 0 -- 1
-[1] 1 -- 2
-[2] 0 -- 3
-[3] 0 -- 2
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g)$name
-</programlisting>
-<screen>
-[1] "foo"    "bar"    "baz"    "foobar"
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g)$weight
-</programlisting>
-<screen>
-[1]  1 -1  0  2
-</screen>
-</informalexample>
-</para>
-
-<para>The other LGL format is the <constant>lgl</constant>
-format. This is adjacency list like format, it might contain symbolic
-vertex names and optionally edge weights: 
-<screen>
-# vertex1name
-vertex2name [optionalWeight]
-vertex3name [optionalWeight]
-</screen>
-This is similar to an adjacency list format, the neighboring vertices
-for each vertex are listed. The name of the initial vertex is preceded
-by <quote>#</quote>, then in the following lines the names of its
-neighbors are listed optionally with the weights of the edges.
-</para>
-
-<para>
-The LGL software works with undirected graphs containing no multiple
-edges, this means that if vertex <quote>B</quote> is listed as a
-neighbor of vertex <quote>A</quote> then vertex <quote>A</quote> must
-not be listed as a neighbor of vertex <quote>B</quote>. &igraph; of
-course is happy with multiple edges and is able to read and write
-<constant>lgl</constant> files which break the original LGL software.
-</para>
-
-</section>
-
-</section>
-
-<section><title>The Pajek format</title>
-<para>Pajek it a popular network analysis program for Windows. (See
-the <ulink url="http://vlado.fmf.uni-lj.si/pub/networks/pajek/"> Pajek
-hompage</ulink>.) It has a quite flexible but not very well documented
-file format, see the Pajek manual on the Pajek homepage for some
-information about the file format.
-</para>
-
-<para>
-&igraph; can read and write Pajek files, with some limitations:
-<itemizedlist>
-  <listitem><para>
-    Only <constant>.net</constant> files are supported, Pajek project
-    files (which can contain many graph and also other type of data)
-    are not. Poject files might be supported in a forthcoming &igraph;
-    release if they turned out to be needed.
-  </para></listitem>
-  <listitem><para>
-    Time events networks are not supported.
-  </para></listitem>
-  <listitem><para>
-    Hypergraphs (graphs with non-binary edges) are not supported as
-    &igraph; cannot handle them.
-  </para></listitem>
-  <listitem><para>
-    Graphs containing both directed and undirected edges are not
-    supported as &igraph; cannot represent them.
-  </para></listitem>
-  <listitem><para>
-    Bipartite (also called affiliation) networks are not
-    supported. The surrent &igraph; version imports the network
-    structure correctly but vertex type information is omitted.
-  </para></listitem>
-  <listitem><para>
-    Graph with multiple edge sets are not supported
-  </para></listitem>
-</itemizedlist>
-</para>
-
-<para>
-&igraph; also reads the non-structural information from Pajek files,
-like edge weights and vertex colors and assign these as vertex and
-edge attributes. Note however that the names of the attributes are not
-always the same as in the Pajek file, some of them are renamed to
-be more informative, or other reasons. The following table contains
-the vertex attributes created by &igraph;:
-<informaltable><tgroup cols="2" align="left">
-  <thead><row>
-    <entry>&igraph; attribute name</entry>
-    <entry>description, Pajek attribute</entry>
-  </row></thead>
-  <tbody>
-
-    <row>
-      <entry>id</entry>
-      <entry>Vertex id</entry>
-    </row>
-    
-    <row>
-      <entry>x, y, z</entry>
-      <entry>The <quote>x</quote>, <quote>y</quote> and 
-      <quote>z</quote> coordinate of the vertex</entry>
-    </row>
-    
-    <row>
-      <entry>vertexsize</entry>
-      <entry>The size of the vertex when plotted
-      (<constant>size</constant> in Pajek).</entry>
-    </row>
-    
-    <row>
-      <entry>shape</entry>
-      <entry>The shape of the vertex when plotted.</entry>
-    </row>
-
-    <row>
-      <entry>color</entry>
-      <entry>Vertex color (<constant>ic</constant> in Pajek) if given
-      with symbolic name</entry>
-    </row>
-
-    <row>
-      <entry>color-red, color-green, color-blue</entry>
-      <entry>Vertex color (<constant>ic</constant> in Pajek) if given 
-      in RGB notation</entry>
-    </row>
-
-    <row>
-      <entry>framecolor</entry>
-      <entry>Border color (<constant>bc</constant> in Pajek) if given
-      with symbolic name</entry>
-    </row>
-    
-    <row>
-      <entry>framecolor-red, framecolor-green, framecolor-blue</entry>
-      <entry>Border color (<constant>bc</constant> in Pajek) if given
-      in RGB notation</entry>
-    </row>
-      
-    <row>
-      <entry>labelcolor</entry>
-      <entry>Label color (<constant>lc</constant> in Pajek) if given
-      with symbolic name</entry>
-    </row>
-    
-    <row>
-      <entry>labelcolor-red, labelcolor-green, labelcolor-blue</entry>
-      <entry>Label color (<constant>lc</constant> in Pajek) if given
-      in RGB notation</entry>
-    </row>
-      
-    <row>
-      <entry>xfact, yfact</entry>
-      <entry>The <constant>x_fact</constant> and
-      <constant>y_fact</constant> Pajek attributes.</entry>
-    </row>
-
-    <row>
-      <entry>labeldist</entry>
-      <entry>The distance of the label from the
-      vertex. (<constant>lr</constant> in Pajek.)</entry>
-    </row>
-
-    <row>
-      <entry>labeldegree, labeldegree2</entry>
-      <entry>The <constant>la</constant> and <constant>lphi</constant>
-      Pajek attributes</entry>
-    </row>
-    
-    <row>
-      <entry>framewidth</entry>
-      <entry>The width of the border (<constant>bw</constant> in
-      Pajek).</entry>
-    </row>
-
-    <row>
-      <entry>fontsize</entry>
-      <entry>Size of the label font (<constant>fos</constant> in
-      Pajek.)</entry>
-    </row>
-
-    <row>
-      <entry>rotation</entry>
-      <entry>The rotation of the vertex (<constant>phi</constant> in
-      Pajek). </entry>
-    </row>
-
-    <row>
-      <entry>radius</entry>
-      <entry>Radius, for some vertex shapes (<constant>r</constant> in
-      Pajek). </entry>
-    </row>
-
-    <row>
-      <entry>diamondratio</entry>
-      <entry>For the diamond shape (<constant>q</constant> in
-      Pajek).</entry> 
-    </row>
-        
-  </tbody>
-</tgroup></informaltable>
-</para>
-
-<para>
-These &igraph; attributes are only created if there is at least one
-vertex in the Pajek file which has the corresponding associated
-information. Eg. if there are vertex coordinates for at least one
-vertex then the <quote>x</quote>, <quote>y</quote> and possibly also
-<quote>z</quote> vertex attributes will be created. For those vertices
-for which the attribute is not defined, <constant>NaN</constant> is
-assigned. 
-</para>
-
-<para>
-The following edge attributes might be created:
-<informaltable><tgroup cols="2" align="left">
-  <thead><row>
-    <entry>&igraph; attribute name</entry>
-    <entry>description, Pajek attribute</entry>
-  </row></thead>
-  <tbody>
-    
-    <row>
-      <entry>weight</entry>
-      <entry>Edge weights.</entry>
-    </row>
-
-    <row>
-      <entry>label</entry>
-      <entry><constant>l</constant> in Pajek.</entry>
-    </row>
-    
-    <row>
-      <entry>color</entry>
-      <entry>Edge color, if the color is given with a symbolic name, 
-      <constant>c</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>color-red, color-green, color-blue</entry>
-      <entry>Edge color if it was given in RGB notation,
-      <constant>c</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>edgewidth</entry>
-      <entry><constant>w</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>arrowsize</entry>
-      <entry><constant>s</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>hook1, hook2</entry>
-      <entry><constant>h1</constant> and <constant>h2</constant> in
-      Pajek. </entry>
-    </row>
-
-    <row>
-      <entry>angle1, angle2</entry>
-      <entry><constant>a1</constant> and <constant>a2</constant> in
-      Pajek, Bezier curve parameters.</entry>
-    </row>
-
-    <row>
-      <entry>velocity1, velocity2</entry>
-      <entry><constant>k1</constant> and <constant>k2</constant> in
-      Pajek, Bezier curve parameter.</entry>
-    </row>
-
-    <row>
-      <entry>arrowpos</entry>
-      <entry><constant>ap</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>labelpos</entry>
-      <entry><constant>lp</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>labelangle, labelangle2</entry>
-      <entry><constant>lr</constant> and <constant>lphi</constant> in
-      Pajek. </entry>
-    </row>
-    
-    <row>
-      <entry>labeldegree</entry>
-      <entry><constant>la</constant> in Pajek.</entry>
-    </row>
-    
-    <row>
-      <entry>fontsize</entry>
-      <entry><constant>fos</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>arrowtype</entry>
-      <entry><constant>a</constant> in Pajek.</entry>
-    </row>
-    
-    <row>
-      <entry>linepattern</entry>
-      <entry><constant>p</constant> in Pajek.</entry>
-    </row>
-
-    <row>
-      <entry>labelcolor</entry>
-      <entry><constant>lc</constant> in Pajek.</entry>
-    </row>
-
-  </tbody>
-</tgroup></informaltable>
-</para>
-
-<para>
-Note vertices are numbered starting with one in Pajek, but &igraph;
-numbering starts with zero.
-</para>
-
-<para>
-Here is an example Pajek file, it is part of the Pajek distribution
-under the name <filename>LINKS.NET</filename>:
-<informalexample><screen>
-*Network TRALALA
-*vertices 4
-   1 "1"                                           0.0938 0.0896   ellipse x_fact 1 y_fact 1
-   2 "2"                                           0.8188 0.2458   ellipse x_fact 1 y_fact 1
-   3 "3"                                           0.3688 0.7792   ellipse x_fact 1
-   4 "4"                                           0.9583 0.8563   ellipse x_fact 1
-*arcs
-1 1 1  h2 0 w 3 c Blue s 3 a1 -130 k1 0.6 a2 -130 k2 0.6 ap 0.5 l "Bezier loop" lc BlueViolet fos 20 lr 58 lp 0.3 la 360
-2 1 1  h2 0 a1 120 k1 1.3 a2 -120 k2 0.3 ap 25 l "Bezier arc" lphi 270 la 180 lr 19 lp 0.5
-1 2 1  h2 0 a1 40 k1 2.8 a2 30 k2 0.8 ap 25 l "Bezier arc" lphi 90 la 0 lp 0.65
-4 2 -1  h2 0 w 1 k1 -2 k2 250 ap 25 l "Circular arc" c Red lc OrangeRed
-3 4 1  p Dashed h2 0 w 2 c OliveGreen ap 25 l "Straight arc" lc PineGreen
-1 3 1  p Dashed h2 0 w 5 k1 -1 k2 -20 ap 25 l "Oval arc" c Brown lc Black
-3 3 -1  h1 6 w 1 h2 12 k1 -2 k2 -15 ap 0.5 l "Circular loop" c Red lc OrangeRed lphi 270 la 180
-</screen></informalexample>
-This can be read into &igraph; with
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- read.graph(file="LINKS.NET", format="pajek")
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 7 
-Directed: FALSE 
-
-Edges:
-[0] 0 -- 0
-[1] 0 -- 1
-[2] 0 -- 1
-[3] 1 -- 3
-[4] 2 -- 3
-[5] 0 -- 2
-[6] 2 -- 2
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g)$color
-</programlisting>
-<screen>
-[1] "Blue"       ""           ""           "Red"        "OliveGreen"
-[6] "Brown"      "Red"
-</screen>
-</informalexample>
-</para>
-
-<para>
-When writing a Pajek file with <function>write.graph()</function> the
-vertex and edge attributes in the previous two tables are written to
-the file if they're present in the graph.
-</para>
-
-<para>
-The Pajek file format is included in &igraph; to allow users to
-convert their Pajek files to formats more suitable for &igraph;, like
-GraphML for example. The Pajek format is not intended to be used as a
-standard file format of &igraph; because of the lack of proper
-documentation. 
-</para>
-
-</section>
-
-<section><title>The GraphML format</title>
-
-<para>GraphML is an XML-based file format (an XML application in the
-XML terminology) to describe graphs. It is a modern format, and can
-store graphs with an extensible set of vertex and edge attributes, and
-generalized graphs which &igraph; cannot handle. Thus &igraph;
-supports only a subset of the GraphML language:
-<itemizedlist>
-  <listitem><para>
-    Hypergraphs are not supported.
-  </para></listitem>
-  <listitem><para>
-    Nested graphs are not supported.
-  </para></listitem>
-  <listitem><para>
-    Mixed graphs, ie. graphs with both directed and undirected edges
-    are not supported. <function>read.graph()</function> sets the
-    graph directed if this is the default in the GraphML file, even if
-    all the edges are in fact undirected.
-  </para></listitem>
-</itemizedlist>
-</para>
-
-<para> See the <ulink url="http://graphml.graphdrawing.org/">
-GraphML homepage</ulink> for more information about the GraphML
-format. 
-</para>
-
-</section>
-
-<!-- ############################################################# -->
-
-<section><title>Connection to Other Network Analysis Software</title>
-
-<section><title>The SNA R Package</title>
-<para></para>
-</section>
-
-<section><title>Pajek</title>
-<para>
-As &igraph; can read and write Pajek <constant>.net</constant>
-files, this is quite easy, all you have to do is to save your graph in
-Pajek format and read it into Pajek or the other way: read your
-<constant>.net</constant> file into &igraph;. If you happen to have a
-different file Pajek file, then you can do the following: TODO.
-</para>
-</section>
-
-</section>
-
-<!-- ############################################################# -->
-
-<section><title>Connection to Other Software</title>
-
-<section><title>Microsoft Excel</title>
-<para></para>
-</section>
-
-</section>
-
-<!-- ############################################################ -->
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/full.pdf igraph-0.6.5/doc/book/full.pdf
--- igraph-0.6.5~quantal1/doc/book/full.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/full.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,214 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806101402)
-/ModDate (D:20060806101402)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-226.76 225.63 m 108.08 232.97 l S
-229.89 217.77 m 149.51 131.78 l S
-245.28 220.11 m 346.30 162.67 l S
-245.85 228.74 m 353.43 272.35 l S
-239.37 234.55 m 271.02 345.88 l S
-238.07 215.20 m 254.52 100.79 l S
-230.82 233.03 m 161.71 327.83 l S
-101.93 224.41 m 138.99 133.72 l S
-107.69 230.78 m 345.41 160.58 l S
-107.97 235.16 m 352.83 274.50 l S
-106.32 239.24 m 265.59 349.77 l S
-105.53 226.94 m 248.57 97.63 l S
-103.05 242.22 m 151.00 327.21 l S
-152.53 126.07 m 345.12 156.24 l S
-150.90 130.17 m 354.46 270.44 l S
-147.63 133.16 m 268.84 346.80 l S
-152.24 121.72 m 246.42 93.80 l S
-143.35 134.44 m 155.26 325.95 l S
-355.56 167.67 m 361.98 266.17 l S
-351.15 166.95 m 277.50 346.25 l S
-346.70 152.23 m 264.15 96.52 l S
-347.53 164.38 m 163.26 329.23 l S
-355.22 282.67 m 281.13 348.82 l S
-357.67 267.48 m 260.88 99.57 l S
-353.10 278.82 m 165.40 333.09 l S
-273.07 345.53 m 256.59 100.87 l S
-263.95 353.80 m 165.66 337.47 l S
-252.18 100.16 m 159.62 326.66 l S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 225.78 215.48 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 87.30 224.05 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 131.86 115.01 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 344.04 148.24 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 351.74 266.54 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 262.86 345.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 245.05 81.45 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 144.99 326.31 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.545 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 233.32 220.91 Tm (0) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 94.84 229.37 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 139.40 120.32 Tm (2) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 351.58 153.67 Tm (3) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 359.29 271.85 Tm (4) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 270.40 351.41 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 252.59 86.87 Tm (6) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 152.54 331.71 Tm (7) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-2170
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000002617 00000 n 
-0000002700 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000002597 00000 n 
-0000002837 00000 n 
-0000003094 00000 n 
-0000003191 00000 n 
-0000003293 00000 n 
-0000003398 00000 n 
-0000003507 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-3585
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/full.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/full.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/fulldir.pdf igraph-0.6.5/doc/book/fulldir.pdf
--- igraph-0.6.5~quantal1/doc/book/fulldir.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/fulldir.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,466 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806101424)
-/ModDate (D:20060806101424)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-226.76 225.63 m 108.08 232.97 l S
-121.89 237.05 m
-108.08 232.97 l
-121.28 227.22 l
-S
-229.89 217.77 m 149.51 131.78 l S
-155.15 145.03 m
-149.51 131.78 l
-162.35 138.31 l
-S
-245.28 220.11 m 346.30 162.67 l S
-332.10 165.08 m
-346.30 162.67 l
-336.97 173.64 l
-S
-245.85 228.74 m 353.43 272.35 l S
-342.74 262.70 m
-353.43 272.35 l
-339.04 271.83 l
-S
-239.37 234.55 m 271.02 345.88 l S
-272.06 331.52 m
-271.02 345.88 l
-262.58 334.21 l
-S
-238.07 215.20 m 254.52 100.79 l S
-247.72 113.49 m
-254.52 100.79 l
-257.47 114.89 l
-S
-230.82 233.03 m 161.71 327.83 l S
-173.66 319.80 m
-161.71 327.83 l
-165.70 313.99 l
-S
-108.08 232.97 m 226.76 225.63 l S
-212.95 221.55 m
-226.76 225.63 l
-213.56 231.38 l
-S
-101.93 224.41 m 138.99 133.72 l S
-129.31 144.38 m
-138.99 133.72 l
-138.43 148.11 l
-S
-107.69 230.78 m 345.41 160.58 l S
-331.04 159.69 m
-345.41 160.58 l
-333.83 169.14 l
-S
-107.97 235.16 m 352.83 274.50 l S
-340.25 267.49 m
-352.83 274.50 l
-338.69 277.21 l
-S
-106.32 239.24 m 265.59 349.77 l S
-257.28 338.01 m
-265.59 349.77 l
-251.66 346.10 l
-S
-105.53 226.94 m 248.57 97.63 l S
-235.23 103.05 m
-248.57 97.63 l
-241.84 110.36 l
-S
-103.05 242.22 m 151.00 327.21 l S
-148.64 313.00 m
-151.00 327.21 l
-140.06 317.84 l
-S
-149.51 131.78 m 229.89 217.77 l S
-224.24 204.52 m
-229.89 217.77 l
-217.05 211.25 l
-S
-138.99 133.72 m 101.93 224.41 l S
-111.61 213.74 m
-101.93 224.41 l
-102.49 210.02 l
-S
-152.53 126.07 m 345.12 156.24 l S
-332.52 149.28 m
-345.12 156.24 l
-330.99 159.01 l
-S
-150.90 130.17 m 354.46 270.44 l S
-346.11 258.71 m
-354.46 270.44 l
-340.52 266.82 l
-S
-147.63 133.16 m 268.84 346.80 l S
-266.45 332.60 m
-268.84 346.80 l
-257.88 337.46 l
-S
-152.24 121.72 m 246.42 93.80 l S
-232.05 92.92 m
-246.42 93.80 l
-234.85 102.37 l
-S
-143.35 134.44 m 155.26 325.95 l S
-159.33 312.13 m
-155.26 325.95 l
-149.50 312.75 l
-S
-346.30 162.67 m 245.28 220.11 l S
-259.48 217.71 m
-245.28 220.11 l
-254.61 209.14 l
-S
-345.41 160.58 m 107.69 230.78 l S
-122.06 231.67 m
-107.69 230.78 l
-119.27 222.22 l
-S
-345.12 156.24 m 152.53 126.07 l S
-165.14 133.03 m
-152.53 126.07 l
-166.66 123.30 l
-S
-355.56 167.67 m 361.98 266.17 l S
-366.01 252.35 m
-361.98 266.17 l
-356.18 252.99 l
-S
-351.15 166.95 m 277.50 346.25 l S
-287.20 335.60 m
-277.50 346.25 l
-278.09 331.86 l
-S
-346.70 152.23 m 264.15 96.52 l S
-272.61 108.18 m
-264.15 96.52 l
-278.12 100.01 l
-S
-347.53 164.38 m 163.26 329.23 l S
-176.63 323.88 m
-163.26 329.23 l
-170.06 316.54 l
-S
-353.43 272.35 m 245.85 228.74 l S
-256.54 238.39 m
-245.85 228.74 l
-260.24 229.26 l
-S
-352.83 274.50 m 107.97 235.16 l S
-120.55 242.17 m
-107.97 235.16 l
-122.11 232.44 l
-S
-354.46 270.44 m 150.90 130.17 l S
-159.25 141.90 m
-150.90 130.17 l
-164.84 133.79 l
-S
-361.98 266.17 m 355.56 167.67 l S
-351.53 181.49 m
-355.56 167.67 l
-361.36 180.85 l
-S
-355.22 282.67 m 281.13 348.82 l S
-294.51 343.48 m
-281.13 348.82 l
-287.95 336.13 l
-S
-357.67 267.48 m 260.88 99.57 l S
-263.37 113.75 m
-260.88 99.57 l
-271.90 108.83 l
-S
-353.10 278.82 m 165.40 333.09 l S
-179.77 334.06 m
-165.40 333.09 l
-177.03 324.60 l
-S
-271.02 345.88 m 239.37 234.55 l S
-238.33 248.92 m
-239.37 234.55 l
-247.81 246.22 l
-S
-265.59 349.77 m 106.32 239.24 l S
-114.63 251.00 m
-106.32 239.24 l
-120.25 242.91 l
-S
-268.84 346.80 m 147.63 133.16 l S
-150.02 147.36 m
-147.63 133.16 l
-158.59 142.50 l
-S
-277.50 346.25 m 351.15 166.95 l S
-341.45 177.59 m
-351.15 166.95 l
-350.57 181.33 l
-S
-281.13 348.82 m 355.22 282.67 l S
-341.85 288.01 m
-355.22 282.67 l
-348.41 295.36 l
-S
-273.07 345.53 m 256.59 100.87 l S
-252.59 114.70 m
-256.59 100.87 l
-262.42 114.04 l
-S
-263.95 353.80 m 165.66 337.47 l S
-178.20 344.54 m
-165.66 337.47 l
-179.81 334.83 l
-S
-254.52 100.79 m 238.07 215.20 l S
-244.87 202.51 m
-238.07 215.20 l
-235.12 201.10 l
-S
-248.57 97.63 m 105.53 226.94 l S
-118.87 221.51 m
-105.53 226.94 l
-112.27 214.21 l
-S
-246.42 93.80 m 152.24 121.72 l S
-166.62 122.60 m
-152.24 121.72 l
-163.82 113.15 l
-S
-264.15 96.52 m 346.70 152.23 l S
-338.24 140.57 m
-346.70 152.23 l
-332.73 148.74 l
-S
-260.88 99.57 m 357.67 267.48 l S
-355.18 253.30 m
-357.67 267.48 l
-346.65 258.22 l
-S
-256.59 100.87 m 273.07 345.53 l S
-277.07 331.70 m
-273.07 345.53 l
-267.25 332.36 l
-S
-252.18 100.16 m 159.62 326.66 l S
-169.30 316.00 m
-159.62 326.66 l
-160.18 312.27 l
-S
-161.71 327.83 m 230.82 233.03 l S
-218.87 241.06 m
-230.82 233.03 l
-226.83 246.86 l
-S
-151.00 327.21 m 103.05 242.22 l S
-105.41 256.43 m
-103.05 242.22 l
-113.99 251.59 l
-S
-155.26 325.95 m 143.35 134.44 l S
-139.28 148.25 m
-143.35 134.44 l
-149.11 147.64 l
-S
-163.26 329.23 m 347.53 164.38 l S
-334.16 169.74 m
-347.53 164.38 l
-340.73 177.08 l
-S
-165.40 333.09 m 353.10 278.82 l S
-338.73 277.85 m
-353.10 278.82 l
-341.46 287.31 l
-S
-165.66 337.47 m 263.95 353.80 l S
-251.41 346.72 m
-263.95 353.80 l
-249.80 356.44 l
-S
-159.62 326.66 m 252.18 100.16 l S
-242.50 110.82 m
-252.18 100.16 l
-251.62 114.55 l
-S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 225.78 215.48 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 87.30 224.05 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 131.86 115.01 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 344.04 148.24 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 351.74 266.54 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 262.86 345.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 245.05 81.45 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 27.47 0 0 27.47 144.99 326.31 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.545 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 233.32 220.91 Tm (0) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 94.84 229.37 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 139.40 120.32 Tm (2) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 351.58 153.67 Tm (3) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 359.29 271.85 Tm (4) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 270.40 351.41 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 252.59 86.87 Tm (6) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 152.54 331.71 Tm (7) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-5913
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000006360 00000 n 
-0000006443 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000006340 00000 n 
-0000006580 00000 n 
-0000006837 00000 n 
-0000006934 00000 n 
-0000007036 00000 n 
-0000007141 00000 n 
-0000007250 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-7328
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/fulldir.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/fulldir.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/graph.xml igraph-0.6.5/doc/book/graph.xml
--- igraph-0.6.5~quantal1/doc/book/graph.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/graph.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,76 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-graph">
-<title>Graphs Objects</title>
-
-<para>
-&igraph; uses graph objects to represent graphs, a graph object is an
-opaque type in the sense that users are not expected to manipulate
-graph objects directly. Instead &igraph; provides functions to create
-and manipulate graph objects. This organization has the advantage that
-the internal representation can be changed any time without breaking
-any code, assuming the users keep the rules. To facilitate the proper
-usage of &igraph; graph objects we do not present the internal graph
-representation here.
-</para>
-
-<para>
-There are several functions which create graph objects, here is a
-very incomplete list of them: <function>graph()</function>,
-<function>graph.star()</function>, <function>graph.tree()</function>,
-<function>graph.adjacency()</function>,
-<function>barabasi.game()</function>.
-</para>
-
-<para>
-For example <function>graph()</function> creates a directed graph from
-a list of edges:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- graph( c(0,1, 1,2, 3,4, 5,6) )
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 7 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 2
-[2] 3 -> 4
-[3] 5 -> 6
-</screen>
-</informalexample>
-</para>
-
-<para>
-Graph objects have an R class <constant>igraph</constant> and the
-<function>is.igraph</function> function can be used to check that
-an R object is an &igraph; graph object:
-<informalexample><programlisting>
-<prompt>> </prompt>class( graph( 1:10 ) )
-</programlisting>
-<screen>
-[1] "igraph"
-</screen>
-<programlisting>
-<prompt>> </prompt>is.igraph( graph( 1:10 ) )
-</programlisting>
-<screen>
-[1] TRUE
-</screen>
-<programlisting>
-<prompt>> </prompt>is.igraph( 1:10 )
-</programlisting>
-<screen>
-[1] FALSE
-</screen>
-</informalexample>
-</para>
-
-
-</chapter>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/book/gtk-doc.xsl igraph-0.6.5/doc/book/gtk-doc.xsl
--- igraph-0.6.5~quantal1/doc/book/gtk-doc.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/gtk-doc.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,406 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version="1.0">
-
-  <!-- import the chunked XSL stylesheet -->
-  <xsl:import href="http://docbook.sourceforge.net/release/xsl/current/html/chunk.xsl"/>
-  <xsl:include href="devhelp.xsl"/>
-  <xsl:include href="version-greater-or-equal.xsl"/>
-
-  <!-- change some parameters -->
-  <xsl:param name="bibliography.collection">../bibdatabase.xml</xsl:param>
-  <xsl:param name="bibliography.numbered">1</xsl:param>
-  <xsl:param name="toc.section.depth">0</xsl:param>
-  <xsl:param name="generate.section.toc.level">2</xsl:param>
-  <xsl:param name="generate.toc">
-    book	toc
-    chapter	toc
-    section     toc
-  </xsl:param>
-  
-  <xsl:param name="default.encoding" select="'US-ASCII'"/>
-  <xsl:param name="chunker.output.encoding" select="'US-ASCII'"/>
-  <xsl:param name="chunker.output.indent" select="'yes'"/>
-  <xsl:param name="chunk.section.depth">0</xsl:param>
-  <xsl:param name="chunk.fast" select="1"/> 
-  <xsl:param name="chapter.autolabel" select="0"/>
-  <xsl:param name="use.id.as.filename" select="1"/>
-  <xsl:param name="html.ext" select="'.html'"/>
-  <xsl:param name="refentry.generate.name" select="0"/>
-  <xsl:param name="refentry.generate.title" select="1"/>
-
-  <!-- use index filtering (if available) -->
-  <xsl:param name="index.on.role" select="1"/>
-
-  <!-- display variablelists as tables -->
-  <xsl:param name="variablelist.as.table" select="1"/>
-
-  <!-- this gets set on the command line ... -->
-  <xsl:param name="gtkdoc.version" select="''"/>
-  <xsl:param name="gtkdoc.bookname" select="''"/>
-
-  <!-- ========================================================= -->
-  <!-- template to create the index.sgml anchor index -->
-
-  <xsl:template match="book|article">
-    <xsl:variable name="tooldver">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.36</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="$tooldver = 0">
-      <xsl:message terminate="yes">
-FATAL-ERROR: You need the DocBook XSL Stylesheets version 1.36 or higher
-to build the documentation. 
-Get a newer version at http://docbook.sourceforge.net/projects/xsl/
-      </xsl:message>
-    </xsl:if>
-    <xsl:apply-imports/>
-
-    <!-- generate the index.sgml href index -->
-    <xsl:call-template name="generate.index"/>
-    <xsl:call-template name="generate.devhelp"/>
-  </xsl:template>
-
-  <xsl:template name="generate.index">
-    <xsl:call-template name="write.text.chunk">
-      <xsl:with-param name="filename" select="'index.sgml'"/>
-      <xsl:with-param name="content">
-        <!-- check all anchor and refentry elements -->
-        <xsl:apply-templates select="//anchor|//refentry"
-                             mode="generate.index.mode"/>
-      </xsl:with-param>
-      <xsl:with-param name="encoding" select="'utf-8'"/>
-    </xsl:call-template>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.index.mode">
-    <xsl:if test="not(@href)">
-      <xsl:text>&lt;ANCHOR id=&quot;</xsl:text>
-      <xsl:value-of select="@id"/>
-      <xsl:text>&quot; href=&quot;</xsl:text>
-      <xsl:if test="$gtkdoc.bookname">
-        <xsl:value-of select="$gtkdoc.bookname"/>
-        <xsl:text>/</xsl:text>
-      </xsl:if>
-      <xsl:call-template name="href.target"/>
-      <xsl:text>&quot;&gt;
-</xsl:text>
-    </xsl:if>
-  </xsl:template>
-
-  <!-- ========================================================= -->
-  <!-- template to output gtkdoclink elements for the unknown targets -->
-
-  <xsl:template match="link">
-    <xsl:choose>
-      <xsl:when test="id(@linkend)">
-        <xsl:apply-imports/>
-      </xsl:when>
-      <xsl:otherwise>
-        <GTKDOCLINK HREF="{@linkend}">
-          <xsl:apply-templates/>
-        </GTKDOCLINK>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:template>
-
-  <!-- ========================================================= -->
-  <!-- Below are the visual portions of the stylesheet.  They provide
-       the normal gtk-doc output style. -->
-
-  <xsl:param name="shade.verbatim" select="0"/>
-  <xsl:param name="refentry.separator" select="0"/>
-
-  <xsl:template match="refsection">
-    <xsl:if test="preceding-sibling::refsection">
-      <hr/>
-    </xsl:if>
-    <xsl:apply-imports/>
-  </xsl:template>
-
-  <xsl:template name="user.head.content">
-    <xsl:if test="$gtkdoc.version">
-      <meta name="generator"
-            content="GTK-Doc V{$gtkdoc.version} (XML mode)"/>
-    </xsl:if>
-    <link rel="stylesheet" href="style.css" type="text/css"/>
-
-      <!-- copied from the html.head template in the docbook stylesheets
-           we don't want links for all refentrys, thats just too much
-        -->
-      <xsl:variable name="this" select="."/>
-      <xsl:for-each select="//part
-                            |//reference
-                            |//preface
-                            |//chapter
-                            |//article
-                            |//appendix[not(parent::article)]|appendix
-                            |//glossary[not(parent::article)]|glossary
-                            |//index[not(parent::article)]|index">
-        <link rel="{local-name(.)}">
-          <xsl:attribute name="href">
-            <xsl:call-template name="href.target">
-              <xsl:with-param name="context" select="$this"/>
-              <xsl:with-param name="object" select="."/>
-            </xsl:call-template>
-          </xsl:attribute>
-          <xsl:attribute name="title">
-            <xsl:apply-templates select="." mode="object.title.markup.textonly"/>
-          </xsl:attribute>
-        </link>
-      </xsl:for-each>
-  </xsl:template>
-
-  <xsl:template match="title" mode="book.titlepage.recto.mode">
-    <table class="navigation" width="100%"
-           cellpadding="2" cellspacing="0">
-      <tr>
-        <th valign="middle">
-          <p class="{name(.)}">
-            <xsl:value-of select="."/>
-          </p>
-        </th>
-      </tr>
-    </table>
-  </xsl:template>
-
-  <xsl:template name="header.navigation">
-    <xsl:param name="prev" select="/foo"/>
-    <xsl:param name="next" select="/foo"/>
-    <xsl:variable name="home" select="/*[1]"/>
-    <xsl:variable name="up" select="parent::*"/>
-
-    <xsl:if test="$suppress.navigation = '0' and $home != .">
-      <table class="navigation" width="100%"
-             summary = "Navigation header" cellpadding="2" cellspacing="2">
-        <tr valign="middle">
-          <xsl:if test="count($prev) > 0">
-            <td>
-              <a accesskey="p">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$prev"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="left.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-prev</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <xsl:if test="count($up) > 0 and $up != $home">
-            <td>
-              <a accesskey="u">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$up"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="up.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-up</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <xsl:if test="$home != .">
-            <td>
-              <a accesskey="h">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$home"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="home.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-home</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <th width="100%" align="center">
-            <xsl:apply-templates select="$home"
-                                 mode="object.title.markup"/>
-          </th>
-          <xsl:if test="count($next) > 0">
-            <td>
-              <a accesskey="n">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$next"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="right.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-next</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-        </tr>
-      </table>
-    </xsl:if>
-  </xsl:template>
-
-  <xsl:template name="footer.navigation">
-    <xsl:param name="prev" select="/foo"/>
-    <xsl:param name="next" select="/foo"/>
-
-    <xsl:if test="$suppress.navigation = '0'">
-      <table class="navigation" width="100%"
-             summary="Navigation footer" cellpadding="2" cellspacing="0">
-        <tr valign="middle">
-          <td align="left">
-            <xsl:if test="count($prev) > 0">
-              <a accesskey="p">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$prev"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <b>
-                  <xsl:text>&lt;&lt;&#160;</xsl:text>
-                  <xsl:apply-templates select="$prev"
-                                       mode="object.title.markup"/>
-                </b>
-              </a>
-            </xsl:if>
-          </td>
-          <td align="right">
-            <xsl:if test="count($next) > 0">
-              <a accesskey="n">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$next"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <b>
-                  <xsl:apply-templates select="$next"
-                                       mode="object.title.markup"/>
-                  <xsl:text>&#160;&gt;&gt;</xsl:text>
-                </b>
-              </a>
-            </xsl:if>
-          </td>
-        </tr>
-      </table>
-    </xsl:if>
-  </xsl:template>
-
-  <xsl:template name="user.footer.content">
-    <script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
-    </script>
-    <script type="text/javascript">
-      _uacct = "UA-1392972-1";
-      urchinTracker();
-    </script>
-  </xsl:template>
-
-  <!-- avoid creating multiple identical indices 
-       if the stylesheets don't support filtered indices
-    -->
-  <xsl:template match="index"> 
-    <xsl:variable name="has-filtered-index">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.66</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="($has-filtered-index = 1) or (count(@role) = 0)">
-      <xsl:apply-imports/>
-    </xsl:if> 
-  </xsl:template>
-
-  <xsl:template match="index" mode="toc">
-    <xsl:variable name="has-filtered-index">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.66</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="($has-filtered-index = 1) or (count(@role) = 0)">
-      <xsl:apply-imports/>
-    </xsl:if> 
-  </xsl:template>
- 
-  <xsl:template match="para">
-    <xsl:choose>
-      <xsl:when test="@role = 'gallery'">
-         <div class="container">
-           <div class="gallery-spacer"> </div>
-           <xsl:apply-templates mode="gallery.mode"/>
-         <div class="gallery-spacer"> </div>
-         </div>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:apply-imports/>
-      </xsl:otherwise> 
-    </xsl:choose>
-  </xsl:template>
-
-  <xsl:template match="link" mode="gallery.mode">
-    <div class="gallery-float">
-       <xsl:apply-templates select="."/>
-    </div>
-  </xsl:template>
-
-  <!-- add gallery handling to refnamediv template -->
-  <xsl:template match="refnamediv">
-    <div class="{name(.)}">
-      <table width="100%">
-        <tr><td valign="top">
-         <xsl:call-template name="anchor"/>
-           <xsl:choose>
-             <xsl:when test="$refentry.generate.name != 0">
-               <h2>
-                <xsl:call-template name="gentext">
-                  <xsl:with-param name="key" select="'RefName'"/>
-                </xsl:call-template>
-              </h2>
-            </xsl:when>
-            <xsl:when test="$refentry.generate.title != 0">
-              <h2>
-                <xsl:choose>
-                  <xsl:when test="../refmeta/refentrytitle">
-                    <xsl:apply-templates select="../refmeta/refentrytitle"/>
-                  </xsl:when>
-                  <xsl:otherwise>
-                    <xsl:apply-templates select="refname[1]"/>
-                  </xsl:otherwise>
-                </xsl:choose>
-              </h2>
-            </xsl:when>
-          </xsl:choose>
-          <p>
-            <xsl:apply-templates/>
-          </p>
-        </td>
-        <td valign="top" align="right">
-           <!-- find the gallery image to use here 
-                - determine the id of the enclosing refentry
-                - look for an inlinegraphic inside a link with linkend == refentryid inside a para with role == gallery
-                - use it here
-             -->
-           <xsl:variable name="refentryid" select="../@id"/>
-           <xsl:apply-templates select="//para[@role = 'gallery']/link[@linkend = $refentryid]/inlinegraphic"/>
-        </td></tr>
-       </table>
-     </div>
-  </xsl:template>
-  
-</xsl:stylesheet>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/atlas.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/atlas.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/editform.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/editform.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/editform2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/editform2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/full.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/full.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/fulldir.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/fulldir.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/home.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/home.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/html/import.R igraph-0.6.5/doc/book/html/import.R
--- igraph-0.6.5~quantal1/doc/book/html/import.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/html/import.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-# Read the files first
-traits <- read.csv("traits.csv", head=FALSE)
-rel <- read.csv("relations.csv", head=FALSE)
-
-# Create the graph, add the vertices
-library(igraph)
-g <- graph.empty()
-g <- add.vertices(g, nrow(traits), 
-                     name=as.character(traits[,1]), age=traits[,2],
-                     gender=as.character(traits[,3]))
-
-# Extract first names from the full names
-names <- sapply(strsplit(V(g)$name, " "), "[",1)
-ids <- 1:length(names)-1
-names(ids) <- names
-
-# Create the edges
-from <- as.character(rel[,1])
-to <- as.character(rel[,2])
-edges <- matrix(c(ids[from], ids[to]), nc=2)
-
-# Add the edges
-g <- add.edges(g, t(edges), 
-               room=as.character(rel[,3]),
-	       friend=rel[,4], advice=rel[,5])
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/import.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/import.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/lattice.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/lattice.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/left.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/left.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/nonlinpadeg.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/nonlinpadeg.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/pepcircle.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/pepcircle.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/random.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/random.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/randomdeg.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/randomdeg.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/reddiameter.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/reddiameter.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/html/relations.csv igraph-0.6.5/doc/book/html/relations.csv
--- igraph-0.6.5~quantal1/doc/book/html/relations.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/html/relations.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-Bob,Alice,N,4,4
-Cecil,Bob,N,5,5
-Cecil,Alice,Y,5,5
-David,Alice,N,3,4
-David,Bob,N,4,2
-Esmeralda,Alice,Y,4,3
-Frank,Alice,N,3,2
-Frank,Esmeralda,N,4,4
-Gabi,Bob,Y,5,5
-Gabi,Alice,N,3,0
-Helen,Alice,N,4,1
-Iris,Cecil,N,0,1
-Iris,Bob,Y,4,3
-Iris,Esmeralda,N,5,5
-James,Alice,N,3,2
-James,Bob,Y,4,5
-James,Gabi,Y,5,5
-Alice,Bob,N,4,4
-Bob,Cecil,N,5,5
-Alice,Cecil,Y,5,5
-Alice,David,N,0,3
-Bob,David,N,4,1
-Alice,Esmeralda,Y,3,1
-Alice,Frank,N,3,3
-Esmeralda,Frank,N,5,4
-Bob,Gabi,Y,4,5
-Alice,Gabi,N,0,1
-Alice,Helen,N,4,3
-Cecil,Iris,N,3,2
-Bob,Iris,Y,3,2
-Esmeralda,Iris,N,5,5
-Alice,James,N,0,3
-Bob,James,Y,4,3
-Gabi,James,Y,5,4
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/right.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/right.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/scalefree.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/scalefree.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/seqattr.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/seqattr.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/stars.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/stars.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/html/style.css igraph-0.6.5/doc/book/html/style.css
--- igraph-0.6.5~quantal1/doc/book/html/style.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/html/style.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,236 +0,0 @@
-.author { padding: 0px 30px 0pt; }
-.chapter { padding: 0px 20px 10px; }
-.section { padding: 0px 20px 10px; }
-.index { padding: 0px 20px 10px; }
-.legalnotice { padding: 0px 20px 10px; }
-.programlisting 
-{
-  background: #eeeeff;
-  border: solid 1px #4444ff;
-  padding: 0.5em;
-}
-.variablelist 
-{
-  padding: 4px;
-  margin-left: 3em;
-}
-.variablelist td:first-child
-{
-  vertical-align: top;
-}
-table.navigation 
-{
-    color: #fff;
-    margin: 0;
-    padding: 7px 0 7px 15px;
-    text-shadow: 0px 1px 2px #000;
-    background: #005fd7 url(header_blue.png) repeat-x;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-}
-table.navigation a 
-{
-  color: #fff;
-}
-.navigation .title 
-{
-  font-size: 200%;
-}
-div.refnamediv 
-{
-  margin-top: 2em;
-}
-div.gallery-float 
-{
-  float: left;
-  padding: 10px;
-}
-div.gallery-float img 
-{
-  border-style: none;
-}
-div.gallery-spacer 
-{
-  clear: both;
-}
-
-body {
-    font: medium/150% "Lucida Grande", sans-serif;
-    margin: 0; padding: 0px 0px 10px;
-    color: #333; background: #fff;
-}
-h1 {
-    color: #fff;
-    margin: 0;
-    padding: 7px 0 7px 15px;
-    text-shadow: 0px 1px 2px #000;
-    background: #005fd7 url(images/header_blue.png) repeat-x;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-}
-h2 {
-    font-size: 1.2em;
-}
-h3 {
-    font-size: 1em;
-}
-body.error h1 {
-    background: #d70000;
-    border-bottom: 1px solid #7f0000;
-}
-.main {
-    padding: 7px 15px;
-}
-
-ul.no-bullet {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.no-bullet li {
-  padding: 0; margin: 0;
-}
-li.download {
-  line-height: 1em;
-  padding-bottom: 10px !important;
-}
-li.download .name {
-  font-weight: bold;
-  padding-left: 20px;
-}
-li.download .comment {
-  font-size: 0.8em;
-  color: #888;
-}
-li.download-c {
-  background: url(images/icon_c.png) no-repeat 0px 0px;
-}
-li.download-r {
-  background: url(images/icon_r.png) no-repeat 0px 0px;
-}
-li.download-python {
-  background: url(images/icon_python.png) no-repeat 0px 0px;
-}
-li.download-ruby {
-  background: url(images/icon_ruby.png) no-repeat 0px 0px;
-}
-ul.download-links {
-  list-style-type: none;
-  padding: 2px 0 0 20px; margin: 0;
-  font-size: 0.8em;
-}
-ul.download-links li {
-  padding: 0px 10px 0px 0px; margin: 0;
-  display: inline;
-  padding-bottom: 5px !important;
-}
-ul.download-links li.download-source {
-  background: url(images/icon_source.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-windows {
-  background: url(images/icon_windows.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-debian {
-  background: url(images/icon_debian.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-osx {
-  background: url(images/icon_osx.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-external {
-  background: url(images/icon_links.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-
-a { color: #00f; text-decoration: none }
-a:visited { color: #00c }
-a:hover { color: #00f; text-decoration: underline; cursor: hand; }
-h1 a, h1 a:visited, h1 a:hover { color: #fff; text-decoration: none }
-h2 a, h2 a:visited, h2 a:hover { color: #000; text-decoration: none }
-h3 a, h3 a:visited, h3 a:hover { color: #000; text-decoration: none }
-
-/* Version info */
-#version_info {
-  float: right;
-  font-size: 0.8em;
-  color: #888;
-  padding: 3px 15px 0px 0px;
-}
-
-/* Menu items */
-ul.menu {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.menu-upper {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-}
-
-ul.menu li {
-  padding: 0px 0px 10px 20px;
-  margin: 0px;
-}
-ul.menu-upper li {
-  padding: 3px 10px 10px 20px;
-  font-size: 0.8em;
-  margin: 0px;
-  display: inline;
-}
-ul li.item-introduction {
-  background: url(images/icon_introduction.png) no-repeat 0px 3px;
-}
-ul li.item-download {
-  background: url(images/icon_download.png) no-repeat 0px 3px;
-}
-ul li.item-news {
-  background: url(images/icon_news.png) no-repeat 0px 3px;
-}
-ul li.item-documentation {
-  background: url(images/icon_documentation.png) no-repeat 0px 3px;
-}
-ul li.item-screenshots {
-  background: url(images/icon_screenshots.png) no-repeat 0px 3px;
-}
-ul li.item-community {
-  background: url(images/icon_community.png) no-repeat 0px 3px;
-}
-ul li.item-links {
-  background: url(images/icon_links.png) no-repeat 0px 3px;
-}
-ul li.item-license {
-  background: url(images/icon_license.png) no-repeat 0px 3px;
-}
-
-/* Forms */
-label {
-  display: block;
-  float: left;
-  width: 130px;
-  font-weight: bold;
-}
-label.normal {
-  color: #444;
-}
-div.explanation {
-  border-left: 130px solid white;
-  font-size: 0.8em;
-  color: #888;
-}
-div.example-contents {
-  display: none;
-}
-.example p.title {
-  color: blue;
-  font-size:0.8em;
-}
-.example p.title b:before {
-  content: '\25B6\00a0';
-}
-.example p.title:hover { 
-  color: #00f; 
-  text-decoration: underline;
-  cursor: hand;
-}
diff -Nru igraph-0.6.5~quantal1/doc/book/html/traits.csv igraph-0.6.5/doc/book/html/traits.csv
--- igraph-0.6.5~quantal1/doc/book/html/traits.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/html/traits.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-Alice Anderson,48,F
-Bob Bradford,33,M
-Cecil Connor,45,F
-David Daugher,34,M
-Esmeralda Escobar,21,F
-Frank Finley,36,M
-Gabi Garbo,44,F
-Helen Hunt,40,F
-Iris Irving,25,F
-James Jones,47,M
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/trees.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/trees.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/html/up.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/html/up.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/igraph.xml igraph-0.6.5/doc/book/igraph.xml
--- igraph-0.6.5~quantal1/doc/book/igraph.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/igraph.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY % local.common.attrib    "xmlns:xi            CDATA       #FIXED       
-'http://www.w3.org/2001/XInclude'" >
-]>
-<book xmlns:xi="http://www.w3.org/2001/XInclude">
-  <bookinfo>
-    <title>Network Analysis with igraph</title>
-    <authorgroup>
-      <author><firstname>Gábor</firstname><surname>Csárdi</surname>
-      <affiliation><orgname>Department of Biophysics, Research
-      Institute for Nuclear and Particle Physics of the Hungarian
-      Academy of Sciences</orgname>
-      <address>29-33 Konkoly-Thege Miklós road, Budapest H-1121, Hungary</address>
-      </affiliation>
-      <affiliation><orgname>Center for Complex Systems Studies,
-      Kalamazoo College</orgname>
-      <address>1200 Academy st, Kalamazoo, 49006, MI, USA</address></affiliation>
-      </author>
-    </authorgroup>
-
-    <legalnotice><para>
-      Copyright (C)  2006  Gábor Csárdi
-      Permission is granted to copy, distribute and/or modify this document
-      under the terms of the GNU Free Documentation License, Version 1.2
-      or any later version published by the Free Software Foundation;
-      with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
-      Texts.  A copy of the license is included in the section entitled 
-      <quote>GNU Free Documentation License</quote>.
-    </para></legalnotice>
-  </bookinfo>
-
-<xi:include href="introduction.xml" />
-<xi:include href="short.xml" />
-<xi:include href="installation.xml" />
-<xi:include href="datamodel.xml" />
-<xi:include href="graph.xml" />
-<xi:include href="structures.xml" />
-<xi:include href="creating.xml" />
-<xi:include href="random.xml" />
-<xi:include href="foreign.xml" />
-<xi:include href="plotting.xml" />
-<xi:include href="attributes.xml" />
-<xi:include href="iterators.xml" />
-<xi:include href="components.xml" />
-<xi:include href="citation.xml" />
-<xi:include href="centrality.xml" />
-<xi:include href="pathlength.xml" />
-<xi:include href="motifs.xml" />
-<xi:include href="flows.xml" />
-<xi:include href="operators.xml" />
-
-<xi:include href="../licenses.xml"/>
-
-<xi:include href="bibliography.xml" />
-
-<index/>
-
-</book>
diff -Nru igraph-0.6.5~quantal1/doc/book/import.R igraph-0.6.5/doc/book/import.R
--- igraph-0.6.5~quantal1/doc/book/import.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/import.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-# Read the files first
-traits <- read.csv("traits.csv", head=FALSE)
-rel <- read.csv("relations.csv", head=FALSE)
-
-# Create the graph, add the vertices
-library(igraph)
-g <- graph.empty()
-g <- add.vertices(g, nrow(traits), 
-                     name=as.character(traits[,1]), age=traits[,2],
-                     gender=as.character(traits[,3]))
-
-# Extract first names from the full names
-names <- sapply(strsplit(V(g)$name, " "), "[",1)
-ids <- 1:length(names)-1
-names(ids) <- names
-
-# Create the edges
-from <- as.character(rel[,1])
-to <- as.character(rel[,2])
-edges <- matrix(c(ids[from], ids[to]), nc=2)
-
-# Add the edges
-g <- add.edges(g, t(edges), 
-               room=as.character(rel[,3]),
-	       friend=rel[,4], advice=rel[,5])
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/import.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/import.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/import.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/import.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/installation.xml igraph-0.6.5/doc/book/installation.xml
--- igraph-0.6.5~quantal1/doc/book/installation.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/installation.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-install">
-<title>Installation</title>
-
-<para>
-The &igraph; R package can be installed just like any other R
-packages. Perhaps the easiest way is to use the
-<command>install.packages()</command> command. This downloads either a
-source of binary package appropriate for the running system from CRAN
-and installs it by default to the system directories. The package can
-be loaded by typing 
-<informalexample><programlisting>
-library(igraph)
-</programlisting></informalexample>
-after installation.
-</para>
-
-<para> 
-If the user doesn't have rights to write to system directories the
-<parameter>lib</parameter> argument of the
-<command>install.packages()</command> command can be used to set an
-alternate installation directory. It is good R practice to keep the
-user's privately installed packages in a separate directory (say
-<filename>~/.R/library</filename>), if this is the case &igraph; can
-be installed like this:
-<informalexample><programlisting>
-install.packages("igraph", lib="~/.R/library")
-</programlisting></informalexample>
-The R package search path needs to be modified as well to let R know
-about our private package directory:
-<informalexample><programlisting>
-.libPaths( c("~/.R/library", .libPaths()) )
-</programlisting></informalexample>
-This command can also be added to the <filename>~/.Rprofile</filename>
-file to set the search path automatically every time you start R.
-</para>
-
-<para>
-See <command>?Startup</command> and <command>?.libPaths()</command>
-for more information about R's startup mechanism and the way
-directories are searched for packages and
-<command>?install.packages</command> about installing R packages.
-</para>
-
-</chapter>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/book/introduction.xml igraph-0.6.5/doc/book/introduction.xml
--- igraph-0.6.5~quantal1/doc/book/introduction.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/introduction.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-]>
-
-<chapter id="igraphbook-intro">
-<title>Introduction</title>
-
-<para>
-yet to be written
-</para>
-
-</chapter>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/book/iterators.xml igraph-0.6.5/doc/book/iterators.xml
--- igraph-0.6.5~quantal1/doc/book/iterators.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/iterators.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,391 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-iterators">
-<title>Vertex and Edge Sequences</title>
-
-<!-- ###################################################### -->
-
-<section><title>Introduction</title>
-
-<para>
-  Vertex and edge sequences are basically numeric vectors containing
-  vertex/edge ids. For many functions there is an argument which is a
-  vertex or edge sequence. Eg. <function>degree()</function> calculates
-  vertex degree and it has an optional argument called
-  <parameter>v</parameter> giving the vertices of which the degree will
-  be calculated. (In this particular case the default value is all
-  vertices.) Everywhere in &igraph; if a vertex or edge sequence is
-  expected a simple numeric can also be supplied instead of a
-  vertex/edge sequence object.
-</para>
-
-<para>
-A vertex sequence object can be created with the function
-<function>V()</function> giving a graph object as a parameter, the
-vertex sequence will contain all vertices in the graph in vertex id
-order. (It is thus hardly more than a vector from 0 to
-<code>vcount(g)-1</code>.)  Similarly, the <function>E()</function>
-function creates an edge sequence with all edges
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- graph.ring(10)
-<prompt>> </prompt>V(g)
-</programlisting>
-<screen>
- [1] 0 1 2 3 4 5 6 7 8 9
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g)
-</programlisting>
-<screen>
-Edge sequence:
-[0] 0 -- 1
-[1] 1 -- 2
-[2] 2 -- 3
-[3] 3 -- 4
-[4] 4 -- 5
-[5] 5 -- 6
-[6] 6 -- 7
-[7] 7 -- 8
-[8] 8 -- 9
-[9] 0 -- 9
-</screen></informalexample>
-</para>
-
-<para>
-Note that even if an edge sequence is just a vector of edge ids, it is
-<quote>pretty printed</quote> in R, instead of the edge ids, the end
-points of the edges are listed, in a nice format. If you wish to see
-the edge ids use the <function>as.vector()</function> function on the
-edge sequence:
-<informalexample><programlisting>
-<prompt>> </prompt>as.vector(E(g))
-</programlisting>
-<screen>
- [1] 0 1 2 3 4 5 6 7 8 9
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-<!-- ###################################################### -->
-
-<section><title>Smart Indexing</title>
-
-<para>
-Of course selecting all vertices or all edges in a graph is not always
-what we want; they can be indexed in various flexible ways to create a
-subset of vertices. Vertex sequences can be indexed by numeric or
-logical vectors to select a subset of vertices:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- barabasi.game(100)
-<prompt>> </prompt>V(g) [ degree(g) > 5 ]
-</programlisting>
-<screen>
-Vertex sequence:
-[1]  0  3  6 14
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g) [ degree(g) > 5 ] [ 0:9 ]
-</programlisting>
-<screen>
-Vertex sequence:
-[1] 0 3 6
-</screen></informalexample>
-Here the first example selects vertices with (total) vertex degree
-higher than five by indexing with a logical vector. As the result of
-the indexing is also a vertex sequence, it can indexed again, like in
-the second example, this time with a numeric vector; we get all
-vertices with degree higher than five among the first 10 vertices as a
-final result.
-</para>
-
-<para>
-There are some functions which make vertex sequence indexing easier,
-these cannot be use anywhere else, they are defined only in the
-indexing operation of vertex/edge sequences. For vertex sequences
-these are: <function>nei()</function>, <function>adj()</function>,
-<function>from()</function> and <function>to()</function> and for edge
-sequences: <function>adj()</function>, <function>from()</function> and
-<function>to()</function>.
-</para>
-
-<para>
-<function>nei()</function> takes a vertex sequence as a parameter
-(remember a simple vector of vertex ids is also allowed), and returns
-a logical vector which is <function>TRUE</function> for those vertices
-from the indexed vertex sequence which have at least one neighbor
-in the vertex sequence supplied as a parameter. To select those
-vertices which have vertex degree higher than five and are connected to
-vertex 0 one can write:
-<informalexample><programlisting>
-<prompt>> </prompt>V(g) [ degree(g) > 5 &amp; nei(0) ]
-</programlisting>
-<screen>
-Vertex sequence:
-[1]  3 14
-</screen>
-</informalexample>
-Of course more than one vertex can be supplied as an argument to
-<function>nei()</function>, all neighbors of vertices 0, 1 and 10:
-<informalexample><programlisting>
-<prompt>> </prompt>V(g) [ nei(c(0,1,10)) ]
-</programlisting>
-<screen>
-Vertex sequence:
- [1]  0  1  2  3  5  7 10 12 14 21 22 42 45 53 64 70 73 88 89
-</screen>
-</informalexample>
-</para>
-
-<para>
-For vertex sequences <function>adj()</function> takes an edge sequence
-as its single argument and it returns <constant>TRUE</constant> for
-those vertices which are adjacent to at least one edge in the
-parameter edge sequence. Here are the vertices adjacent to the edges
-with high edge betweenness:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- barabasi.game(1000)
-<prompt>> </prompt>es &lt;- E(g) [ edge.betweenness(g) > 100 ]
-<prompt>> </prompt>es
-</programlisting>
-<screen>
-Edge sequence:
-[0] 1 -> 0
-[1] 2 -> 0
-[2] 3 -> 0
-[3] 4 -> 1
-[14] 15 -> 12
-[26] 27 -> 2
-</screen>
-<programlisting>
-<prompt>> </prompt>V(g) [ adj(es) ]
-</programlisting>
-<screen>
-Vertex sequence:
-[1]  0  1  2  3  4 12 15 27
-</screen>
-</informalexample>
-</para>
-
-<para>
-For edge sequences <function>adj()</function> is similar, is takes a
-vertex sequence as its argument and returns <constant>TRUE</constant>
-for edge which are adjacent to at least one vertex in the parameter.
-</para>
-
-<para>
-The <function>from()</function> and <function>to()</function>
-functions are exactly the same as <function>adj()</function> for
-undirected graphs. For directed graphs they are a bit different,
-<function>from()</function> is only <constant>TRUE</constant> for
-those vertices/edge which are connected at the origin (source) of the
-edge, while <function>to()</function> is <constant>TRUE</constant> at
-the opposite end. For example to get all the outgoing edges of
-some vertices one can write:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- erdos.renyi.game(100, 3/100, directed=TRUE)
-<prompt>> </prompt>E(g) [ from(0:2) ]
-</programlisting>
-<screen>
-Edge sequence:
-[0] 0 -> 4
-[1] 0 -> 15
-[2] 0 -> 46
-[3] 0 -> 97
-[4] 1 -> 5
-[5] 1 -> 79
-[6] 1 -> 84
-[7] 1 -> 86
-[8] 2 -> 10
-[9] 2 -> 12
-[10] 2 -> 22
-[11] 2 -> 52
-[12] 2 -> 61
-[13] 2 -> 91
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-<section><title>Vertex/Edge Sequences and Attributes</title>
-
-<para>
-Vertex and edge attributes can be used in a very powerful way via
-vertex/edge sequences: the <quote><constant>$</constant></quote>
-operator accesses the vertex/edge attributes for the vertices/edges in
-the sequence. This form can be be used for assigning new values as
-well. In the following example we assign uniformly random weights to
-the edges and set the <constant>color</constant> edge attribute to
-<quote>red</quote> for edges with high weight.
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- graph.lattice( c(10,10) )
-<prompt>> </prompt>E(g)$weight &lt;- runif(ecount(g))
-<prompt>> </prompt>E(g)$color &lt;- "grey"
-<prompt>> </prompt>E(g)[ weight > 0.9 ]$color &lt;- "red"
-<prompt>> </prompt>plot(g, layout=layout.kamada.kawai,
-       edge.color=E(g)$color, vertex.size=3, edge.width=2, label.dist=0.6)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="seqattr.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="seqattr.png" format="PNG" /></imageobject>
-</mediaobject></informalexample>
-</para>
-
-<para>
-The previous example also shows that attribute names can be used in
-index expressions, eg. giving <constant>weight</constant> in the index
-of an edge sequence means the <constant>weight</constant> attribute
-for those edges in the sequence.
-</para>
-
-<para>
-Just like for the ordinary attribute assignment functions, if the
-vector (or list) giving the attribute values is shorter than the one
-giving the vertex/edge ids then if will be recycled:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- graph.ring(10)
-<prompt>> </prompt>V(g)$color &lt;- c("red", "blue")
-<prompt>> </prompt>plot(g, layout=layout.circle, vertex.color=V(g)$color)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="pepcircle.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="pepcircle.png" format="PNG" /></imageobject>
-</mediaobject>
-</informalexample>
-</para>
-
-</section>
-
-<section><title>Even Smarter Indexing</title>
-
-<para>
-The <function>E()</function> function has two optional parameters
-which can be used often conveniently.
-</para>
-
-<para>
-If the <parameter>P</parameter> parameter is given then
-<function>E()</function> creates an edge sequence based
-on the end points of the edges. Eg. to select the edge connecting
-vertices 0 and 1 one can write <code>E(g, c(0,1))</code> (as
-<parameter>P</parameter> is the next positional argument after the
-graph, it is not required to write <code>E(g, P=c(0,1))</code>. The
-following example calculates the edge betweenness for a particular
-edge only:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- barabasi.game(100, directed=FALSE)
-<prompt>> </prompt>edge.betweenness(g, E(g, c(0,1)))
-</programlisting>
-<screen>
-[1] 736
-</screen>
-</informalexample>
-</para>
-
-<para>
-If the <parameter>path</parameter> argument is given then
-<function>E()</function> selects edges along the (directed or
-undirected) path in <parameter>path</parameter>. The path is given via
-the vertex ids visited. In the following example we use
-<function>path()</function> to set some edge attributes on edges along
-the longest geodesic (ie. diameter) in a graph:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- barabasi.game(100, directed=FALSE)
-<prompt>> </prompt>d &lt;- get.diameter(g)
-<prompt>> </prompt>E(g)$color &lt;- "SkyBlue2"
-<prompt>> </prompt>E(g)$width &lt;- 1
-<prompt>> </prompt>E(g, path=d)$color &lt;- "red"
-<prompt>> </prompt>E(g, path=d)$width &lt;- 2
-<prompt>> </prompt>V(g)$labelcolor &lt;- V(g)$color  &lt;- "blue"
-<prompt>> </prompt>V(g)[ d ]$labelcolor &lt;- V(g)[ d ]$color &lt;- "red"
-<prompt>> </prompt>plot(g, layout=layout.kamada.kawai, 
-     edge.color=E(g)$color,edge.width=E(g)$width,
-     vertex.color=V(g)$color, label.color=V(g)$labelcolor,
-     label.dist=0.4, vertex.size=3)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="reddiameter.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="reddiameter.png" format="PDF" /></imageobject>
-</mediaobject>
-</informalexample>
-</para>
-
-<para>
-There are other three special operators defined in the index
-expressions of edge sequences only: <function>%->%</function>,
-<function>%&lt;-%</function> and <function>%--%</function>. These
-operators can be used effectively for selecting the edges connecting
-the vertices in two vertex sequences. For undirected graphs they are
-work the same way. For directed graphs <function>%--%</function>
-ignores the direction of the edges while <function>%->%</function>
-selects only edges pointing from the left hand side argument to the
-right hand side and the opposite for <function>%&lt;-%</function>. 
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- graph( c(0,1, 1,1, 1,2, 2,3, 3,1) )
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 4 
-Edges: 4 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 1 -> 1
-[2] 1 -> 2
-[3] 2 -> 3
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g) [ 0:1 %--% 2:3 ]
-</programlisting>
-<screen>
-Edge sequence:
-[2] 1 -> 2
-[4] 3 -> 1
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g) [ 0:1 %->% 2:3 ]
-</programlisting>
-<screen>
-Edge sequence:
-[2] 1 -> 2
-</screen>
-<programlisting>
-<prompt>> </prompt>E(g) [ 0:1 %&lt;-% 2:3 ]
-</programlisting>
-<screen>
-Edge sequence:
-[4] 3 -> 1
-</screen>
-</informalexample>
-</para>
-
-</section>
-
-<!-- ###################################################### -->
-
-<section><title>More Examples</title>
-
-<para>
-TODO
-</para>
-
-</section>
-
-<!-- ###################################################### -->
-
-<section><title>Internal Representation</title>
-
-<para>
-TODO
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/lattice.pdf igraph-0.6.5/doc/book/lattice.pdf
--- igraph-0.6.5~quantal1/doc/book/lattice.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/lattice.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,370 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806121443)
-/ModDate (D:20060806121443)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-91.73 94.93 m 91.73 143.47 l S
-102.13 84.53 m 150.67 84.53 l S
-91.73 164.27 m 91.73 212.80 l S
-102.13 153.87 m 150.67 153.87 l S
-91.73 233.60 m 91.73 282.13 l S
-102.13 223.20 m 150.67 223.20 l S
-91.73 302.93 m 91.73 351.47 l S
-102.13 292.53 m 150.67 292.53 l S
-102.13 361.87 m 150.67 361.87 l S
-161.07 94.93 m 161.07 143.47 l S
-171.47 84.53 m 220.00 84.53 l S
-161.07 164.27 m 161.07 212.80 l S
-171.47 153.87 m 220.00 153.87 l S
-161.07 233.60 m 161.07 282.13 l S
-171.47 223.20 m 220.00 223.20 l S
-161.07 302.93 m 161.07 351.47 l S
-171.47 292.53 m 220.00 292.53 l S
-171.47 361.87 m 220.00 361.87 l S
-230.40 94.93 m 230.40 143.47 l S
-240.80 84.53 m 289.33 84.53 l S
-230.40 164.27 m 230.40 212.80 l S
-240.80 153.87 m 289.33 153.87 l S
-230.40 233.60 m 230.40 282.13 l S
-240.80 223.20 m 289.33 223.20 l S
-230.40 302.93 m 230.40 351.47 l S
-240.80 292.53 m 289.33 292.53 l S
-240.80 361.87 m 289.33 361.87 l S
-299.73 94.93 m 299.73 143.47 l S
-310.13 84.53 m 358.67 84.53 l S
-299.73 164.27 m 299.73 212.80 l S
-310.13 153.87 m 358.67 153.87 l S
-299.73 233.60 m 299.73 282.13 l S
-310.13 223.20 m 358.67 223.20 l S
-299.73 302.93 m 299.73 351.47 l S
-310.13 292.53 m 358.67 292.53 l S
-310.13 361.87 m 358.67 361.87 l S
-369.07 94.93 m 369.07 143.47 l S
-369.07 164.27 m 369.07 212.80 l S
-369.07 233.60 m 369.07 282.13 l S
-369.07 302.93 m 369.07 351.47 l S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-  81.33 84.53 m
-  81.33 90.25 86.01 94.93 91.73 94.93 c
-  97.45 94.93 102.13 90.25 102.13 84.53 c
-  102.13 78.81 97.45 74.13 91.73 74.13 c
-  86.01 74.13 81.33 78.81 81.33 84.53 c
-B
-  81.33 153.87 m
-  81.33 159.59 86.01 164.27 91.73 164.27 c
-  97.45 164.27 102.13 159.59 102.13 153.87 c
-  102.13 148.15 97.45 143.47 91.73 143.47 c
-  86.01 143.47 81.33 148.15 81.33 153.87 c
-B
-  81.33 223.20 m
-  81.33 228.92 86.01 233.60 91.73 233.60 c
-  97.45 233.60 102.13 228.92 102.13 223.20 c
-  102.13 217.48 97.45 212.80 91.73 212.80 c
-  86.01 212.80 81.33 217.48 81.33 223.20 c
-B
-  81.33 292.53 m
-  81.33 298.25 86.01 302.93 91.73 302.93 c
-  97.45 302.93 102.13 298.25 102.13 292.53 c
-  102.13 286.81 97.45 282.13 91.73 282.13 c
-  86.01 282.13 81.33 286.81 81.33 292.53 c
-B
-  81.33 361.87 m
-  81.33 367.59 86.01 372.27 91.73 372.27 c
-  97.45 372.27 102.13 367.59 102.13 361.87 c
-  102.13 356.15 97.45 351.47 91.73 351.47 c
-  86.01 351.47 81.33 356.15 81.33 361.87 c
-B
-  150.67 84.53 m
-  150.67 90.25 155.35 94.93 161.07 94.93 c
-  166.79 94.93 171.47 90.25 171.47 84.53 c
-  171.47 78.81 166.79 74.13 161.07 74.13 c
-  155.35 74.13 150.67 78.81 150.67 84.53 c
-B
-  150.67 153.87 m
-  150.67 159.59 155.35 164.27 161.07 164.27 c
-  166.79 164.27 171.47 159.59 171.47 153.87 c
-  171.47 148.15 166.79 143.47 161.07 143.47 c
-  155.35 143.47 150.67 148.15 150.67 153.87 c
-B
-  150.67 223.20 m
-  150.67 228.92 155.35 233.60 161.07 233.60 c
-  166.79 233.60 171.47 228.92 171.47 223.20 c
-  171.47 217.48 166.79 212.80 161.07 212.80 c
-  155.35 212.80 150.67 217.48 150.67 223.20 c
-B
-  150.67 292.53 m
-  150.67 298.25 155.35 302.93 161.07 302.93 c
-  166.79 302.93 171.47 298.25 171.47 292.53 c
-  171.47 286.81 166.79 282.13 161.07 282.13 c
-  155.35 282.13 150.67 286.81 150.67 292.53 c
-B
-  150.67 361.87 m
-  150.67 367.59 155.35 372.27 161.07 372.27 c
-  166.79 372.27 171.47 367.59 171.47 361.87 c
-  171.47 356.15 166.79 351.47 161.07 351.47 c
-  155.35 351.47 150.67 356.15 150.67 361.87 c
-B
-  220.00 84.53 m
-  220.00 90.25 224.68 94.93 230.40 94.93 c
-  236.12 94.93 240.80 90.25 240.80 84.53 c
-  240.80 78.81 236.12 74.13 230.40 74.13 c
-  224.68 74.13 220.00 78.81 220.00 84.53 c
-B
-  220.00 153.87 m
-  220.00 159.59 224.68 164.27 230.40 164.27 c
-  236.12 164.27 240.80 159.59 240.80 153.87 c
-  240.80 148.15 236.12 143.47 230.40 143.47 c
-  224.68 143.47 220.00 148.15 220.00 153.87 c
-B
-  220.00 223.20 m
-  220.00 228.92 224.68 233.60 230.40 233.60 c
-  236.12 233.60 240.80 228.92 240.80 223.20 c
-  240.80 217.48 236.12 212.80 230.40 212.80 c
-  224.68 212.80 220.00 217.48 220.00 223.20 c
-B
-  220.00 292.53 m
-  220.00 298.25 224.68 302.93 230.40 302.93 c
-  236.12 302.93 240.80 298.25 240.80 292.53 c
-  240.80 286.81 236.12 282.13 230.40 282.13 c
-  224.68 282.13 220.00 286.81 220.00 292.53 c
-B
-  220.00 361.87 m
-  220.00 367.59 224.68 372.27 230.40 372.27 c
-  236.12 372.27 240.80 367.59 240.80 361.87 c
-  240.80 356.15 236.12 351.47 230.40 351.47 c
-  224.68 351.47 220.00 356.15 220.00 361.87 c
-B
-  289.33 84.53 m
-  289.33 90.25 294.01 94.93 299.73 94.93 c
-  305.45 94.93 310.13 90.25 310.13 84.53 c
-  310.13 78.81 305.45 74.13 299.73 74.13 c
-  294.01 74.13 289.33 78.81 289.33 84.53 c
-B
-  289.33 153.87 m
-  289.33 159.59 294.01 164.27 299.73 164.27 c
-  305.45 164.27 310.13 159.59 310.13 153.87 c
-  310.13 148.15 305.45 143.47 299.73 143.47 c
-  294.01 143.47 289.33 148.15 289.33 153.87 c
-B
-  289.33 223.20 m
-  289.33 228.92 294.01 233.60 299.73 233.60 c
-  305.45 233.60 310.13 228.92 310.13 223.20 c
-  310.13 217.48 305.45 212.80 299.73 212.80 c
-  294.01 212.80 289.33 217.48 289.33 223.20 c
-B
-  289.33 292.53 m
-  289.33 298.25 294.01 302.93 299.73 302.93 c
-  305.45 302.93 310.13 298.25 310.13 292.53 c
-  310.13 286.81 305.45 282.13 299.73 282.13 c
-  294.01 282.13 289.33 286.81 289.33 292.53 c
-B
-  289.33 361.87 m
-  289.33 367.59 294.01 372.27 299.73 372.27 c
-  305.45 372.27 310.13 367.59 310.13 361.87 c
-  310.13 356.15 305.45 351.47 299.73 351.47 c
-  294.01 351.47 289.33 356.15 289.33 361.87 c
-B
-  358.67 84.53 m
-  358.67 90.25 363.35 94.93 369.07 94.93 c
-  374.79 94.93 379.47 90.25 379.47 84.53 c
-  379.47 78.81 374.79 74.13 369.07 74.13 c
-  363.35 74.13 358.67 78.81 358.67 84.53 c
-B
-  358.67 153.87 m
-  358.67 159.59 363.35 164.27 369.07 164.27 c
-  374.79 164.27 379.47 159.59 379.47 153.87 c
-  379.47 148.15 374.79 143.47 369.07 143.47 c
-  363.35 143.47 358.67 148.15 358.67 153.87 c
-B
-  358.67 223.20 m
-  358.67 228.92 363.35 233.60 369.07 233.60 c
-  374.79 233.60 379.47 228.92 379.47 223.20 c
-  379.47 217.48 374.79 212.80 369.07 212.80 c
-  363.35 212.80 358.67 217.48 358.67 223.20 c
-B
-  358.67 292.53 m
-  358.67 298.25 363.35 302.93 369.07 302.93 c
-  374.79 302.93 379.47 298.25 379.47 292.53 c
-  379.47 286.81 374.79 282.13 369.07 282.13 c
-  363.35 282.13 358.67 286.81 358.67 292.53 c
-B
-  358.67 361.87 m
-  358.67 367.59 363.35 372.27 369.07 372.27 c
-  374.79 372.27 379.47 367.59 379.47 361.87 c
-  379.47 356.15 374.79 351.47 369.07 351.47 c
-  363.35 351.47 358.67 356.15 358.67 361.87 c
-B
-Q q
-BT
-0.000 0.000 0.545 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 97.75 99.73 Tm (\(1,1\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 97.75 169.06 Tm (\(1,2\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 97.75 238.39 Tm (\(1,3\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 97.75 307.73 Tm (\(1,4\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 97.75 377.06 Tm (\(1,5\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 167.08 99.73 Tm (\(2,1\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 167.08 169.06 Tm (\(2,2\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 167.08 238.39 Tm (\(2,3\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 167.08 307.73 Tm (\(2,4\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 167.08 377.06 Tm (\(2,5\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 236.41 99.73 Tm (\(3,1\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 236.41 169.06 Tm (\(3,2\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 236.41 238.39 Tm (\(3,3\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 236.41 307.73 Tm (\(3,4\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 236.41 377.06 Tm (\(3,5\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.75 99.73 Tm (\(4,1\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.75 169.06 Tm (\(4,2\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.75 238.39 Tm (\(4,3\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.75 307.73 Tm (\(4,4\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.75 377.06 Tm (\(4,5\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 375.08 99.73 Tm (\(5,1\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 375.08 169.06 Tm (\(5,2\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 375.08 238.39 Tm (\(5,3\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 375.08 307.73 Tm (\(5,4\)) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 375.08 377.06 Tm (\(5,5\)) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-8033
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000008480 00000 n 
-0000008563 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000008460 00000 n 
-0000008700 00000 n 
-0000008957 00000 n 
-0000009054 00000 n 
-0000009156 00000 n 
-0000009261 00000 n 
-0000009370 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-9448
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/lattice.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/lattice.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/motifs.xml igraph-0.6.5/doc/book/motifs.xml
--- igraph-0.6.5~quantal1/doc/book/motifs.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/motifs.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-motifs">
-<title>Graph Motifs</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/nonlinpadeg.pdf igraph-0.6.5/doc/book/nonlinpadeg.pdf
--- igraph-0.6.5~quantal1/doc/book/nonlinpadeg.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/nonlinpadeg.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,540 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806093023)
-/ModDate (D:20060806093023)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.000 0.804 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-96.53 354.72 m 108.85 251.00 l S
-110.63 236.71 m 118.70 175.36 l S
-121.18 161.19 m 125.80 140.15 l S
-130.07 126.45 m 130.92 124.36 l S
-134.79 110.59 m 137.83 91.64 l S
-91.87 361.87 m 99.50 361.87 l S
-95.69 358.05 m 95.69 365.69 l S
-105.88 243.85 m 113.51 243.85 l S
-109.70 240.03 m 109.70 247.67 l S
-115.82 168.22 m 123.46 168.22 l S
-119.64 164.41 m 119.64 172.04 l S
-123.53 133.11 m 131.17 133.11 l S
-127.35 129.30 m 127.35 136.93 l S
-129.83 117.69 m 137.47 117.69 l S
-133.65 113.88 m 133.65 121.51 l S
-135.16 84.53 m 142.79 84.53 l S
-138.97 80.71 m 138.97 88.35 l S
-139.77 84.53 m 147.41 84.53 l S
-143.59 80.71 m 143.59 88.35 l S
-385.25 84.53 m 392.89 84.53 l S
-389.07 80.71 m 389.07 88.35 l S
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-71.73 73.44 m 390.00 73.44 l S
-71.73 73.44 m 71.73 66.24 l S
-151.30 73.44 m 151.30 66.24 l S
-230.87 73.44 m 230.87 66.24 l S
-310.43 73.44 m 310.43 66.24 l S
-390.00 73.44 m 390.00 66.24 l S
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 68.40 47.52 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 144.63 47.52 Tm (10) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 220.86 47.52 Tm (100) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 297.09 47.52 Tm (1000) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 373.32 47.52 Tm (10000) Tj
-ET
-59.04 84.53 m 59.04 362.55 l S
-59.04 84.53 m 51.84 84.53 l S
-59.04 154.04 m 51.84 154.04 l S
-59.04 223.54 m 51.84 223.54 l S
-59.04 293.04 m 51.84 293.04 l S
-59.04 362.55 m 51.84 362.55 l S
-BT
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 67.69 Tm (1e-04) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 137.19 Tm (1e-03) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 206.69 Tm (1e-02) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 276.20 Tm (1e-01) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 345.70 Tm (1e+00) Tj
-ET
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 211.72 18.72 Tm (degree) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 12.96 196.85 Tm (frequency) Tj
-ET
-Q q 59.04 73.44 342.72 299.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-98.17 340.96 m 107.21 316.42 l S
-112.61 303.07 m 116.72 293.78 l S
-122.88 280.77 m 124.10 278.37 l S
-129.64 265.11 m 131.36 260.01 l S
-141.14 236.83 m 141.43 235.91 l S
-145.17 222.02 m 146.07 218.02 l S
-155.53 193.61 m 156.66 184.98 l S
-166.18 149.77 m 166.67 145.76 l S
-172.02 131.43 m 173.07 112.64 l S
-BT
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 92.72 345.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 106.73 307.06 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 116.68 284.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 124.39 269.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 130.69 250.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 136.01 241.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 140.63 226.45 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 144.70 208.40 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 148.34 196.16 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 151.63 198.15 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 154.64 175.24 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 157.40 165.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 159.96 156.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 162.35 154.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 164.58 136.02 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 166.67 130.52 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 168.65 136.02 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 170.52 102.86 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 172.29 115.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 175.58 81.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 178.59 81.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 181.36 81.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 191.63 81.94 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 RG
-ET
-97.95 343.54 m 107.43 314.98 l S
-112.12 301.36 m 117.21 287.10 l S
-122.42 273.68 m 124.56 268.59 l S
-129.54 255.10 m 131.45 249.13 l S
-141.22 223.67 m 141.35 223.27 l S
-152.86 194.98 m 153.03 194.23 l S
-155.08 180.02 m 157.11 150.45 l S
-161.30 164.05 m 161.99 169.29 l S
-166.07 157.03 m 166.78 150.43 l S
-172.06 140.12 m 173.03 124.88 l S
-173.86 124.88 m 174.87 143.67 l S
-178.98 136.08 m 179.65 124.88 l S
-180.76 124.86 m 180.87 125.95 l S
-182.21 125.94 m 182.31 124.86 l S
-183.26 110.50 m 184.02 91.73 l S
-189.65 91.72 m 190.01 98.27 l S
-199.50 91.73 m 199.76 98.26 l S
-95.69 354.57 m
-99.32 348.27 l
-92.05 348.27 l
-95.69 354.57 l
-S
-109.70 312.34 m
-113.33 306.04 l
-106.06 306.04 l
-109.70 312.34 l
-S
-119.64 284.52 m
-123.27 278.22 l
-116.00 278.22 l
-119.64 284.52 l
-S
-127.35 266.15 m
-130.98 259.85 l
-123.71 259.85 l
-127.35 266.15 l
-S
-133.65 246.47 m
-137.28 240.17 l
-130.01 240.17 l
-133.65 246.47 l
-S
-138.97 234.72 m
-142.61 228.42 l
-135.34 228.42 l
-138.97 234.72 l
-S
-143.59 220.62 m
-147.23 214.33 l
-139.95 214.33 l
-143.59 220.62 l
-S
-147.66 206.82 m
-151.30 200.52 l
-144.02 200.52 l
-147.66 206.82 l
-S
-151.30 206.21 m
-154.94 199.91 l
-147.66 199.91 l
-151.30 206.21 l
-S
-154.59 191.40 m
-158.23 185.10 l
-150.96 185.10 l
-154.59 191.40 l
-S
-157.60 147.47 m
-161.24 141.17 l
-153.96 141.17 l
-157.60 147.47 l
-S
-160.37 161.11 m
-164.00 154.81 l
-156.73 154.81 l
-160.37 161.11 l
-S
-162.93 180.63 m
-166.56 174.33 l
-159.29 174.33 l
-162.93 180.63 l
-S
-165.31 168.39 m
-168.95 162.09 l
-161.67 162.09 l
-165.31 168.39 l
-S
-167.54 147.47 m
-171.18 141.17 l
-163.90 141.17 l
-167.54 147.47 l
-S
-169.64 142.82 m
-173.27 136.52 l
-166.00 136.52 l
-169.64 142.82 l
-S
-171.61 151.50 m
-175.25 145.20 l
-167.97 145.20 l
-171.61 151.50 l
-S
-173.48 121.89 m
-177.12 115.60 l
-169.84 115.60 l
-173.48 121.89 l
-S
-175.25 155.06 m
-178.89 148.76 l
-171.62 148.76 l
-175.25 155.06 l
-S
-176.94 147.47 m
-180.57 141.17 l
-173.30 141.17 l
-176.94 147.47 l
-S
-178.54 147.47 m
-182.18 141.17 l
-174.91 141.17 l
-178.54 147.47 l
-S
-180.08 121.89 m
-183.72 115.60 l
-176.44 115.60 l
-180.08 121.89 l
-S
-181.55 137.31 m
-185.19 131.01 l
-177.92 131.01 l
-181.55 137.31 l
-S
-182.96 121.89 m
-186.60 115.60 l
-179.33 115.60 l
-182.96 121.89 l
-S
-184.32 88.73 m
-187.95 82.43 l
-180.68 82.43 l
-184.32 88.73 l
-S
-185.62 88.73 m
-189.26 82.43 l
-181.99 82.43 l
-185.62 88.73 l
-S
-188.09 88.73 m
-191.73 82.43 l
-184.45 82.43 l
-188.09 88.73 l
-S
-189.26 88.73 m
-192.90 82.43 l
-185.63 82.43 l
-189.26 88.73 l
-S
-190.40 109.65 m
-194.03 103.36 l
-186.76 103.36 l
-190.40 109.65 l
-S
-192.56 88.73 m
-196.19 82.43 l
-188.92 82.43 l
-192.56 88.73 l
-S
-194.59 88.73 m
-198.23 82.43 l
-190.95 82.43 l
-194.59 88.73 l
-S
-195.56 88.73 m
-199.20 82.43 l
-191.93 82.43 l
-195.56 88.73 l
-S
-196.51 88.73 m
-200.15 82.43 l
-192.87 82.43 l
-196.51 88.73 l
-S
-198.33 88.73 m
-201.96 82.43 l
-194.69 82.43 l
-198.33 88.73 l
-S
-199.20 88.73 m
-202.84 82.43 l
-195.57 82.43 l
-199.20 88.73 l
-S
-200.06 109.65 m
-203.69 103.36 l
-196.42 103.36 l
-200.06 109.65 l
-S
-202.50 88.73 m
-206.13 82.43 l
-198.86 82.43 l
-202.50 88.73 l
-S
-204.03 88.73 m
-207.67 82.43 l
-200.40 82.43 l
-204.03 88.73 l
-S
-205.50 88.73 m
-209.14 82.43 l
-201.87 82.43 l
-205.50 88.73 l
-S
-207.60 88.73 m
-211.23 82.43 l
-203.96 82.43 l
-207.60 88.73 l
-S
-212.04 88.73 m
-215.68 82.43 l
-208.41 82.43 l
-212.04 88.73 l
-S
-219.51 88.73 m
-223.15 82.43 l
-215.88 82.43 l
-219.51 88.73 l
-S
-227.23 88.73 m
-230.86 82.43 l
-223.59 82.43 l
-227.23 88.73 l
-S
-228.36 88.73 m
-231.99 82.43 l
-224.72 82.43 l
-228.36 88.73 l
-S
-229.09 88.73 m
-232.73 82.43 l
-225.46 82.43 l
-229.09 88.73 l
-S
-229.46 88.73 m
-233.09 82.43 l
-225.82 82.43 l
-229.46 88.73 l
-S
-240.46 88.73 m
-244.10 82.43 l
-236.82 82.43 l
-240.46 88.73 l
-S
-252.68 88.73 m
-256.32 82.43 l
-249.04 82.43 l
-252.68 88.73 l
-S
-0.000 0.000 0.000 RG
-331.34 362.55 57.72 -57.60 re S
-334.58 348.15 m 356.18 348.15 l S
-1.000 0.000 0.000 RG
-334.58 333.75 m 356.18 333.75 l S
-0.000 0.804 0.000 RG
-334.58 319.35 m 356.18 319.35 l S
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 342.42 345.55 Tm (l) Tj 0 Tr
-ET
-1.000 0.000 0.000 RG
-345.38 337.95 m
-349.02 331.65 l
-341.75 331.65 l
-345.38 337.95 l
-S
-0.000 0.804 0.000 RG
-341.56 319.35 m 349.20 319.35 l S
-345.38 315.53 m 345.38 323.17 l S
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 366.98 343.84 Tm (0.5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 366.98 329.44 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 366.98 315.04 Tm (1.5) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-8092
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000008539 00000 n 
-0000008622 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000008519 00000 n 
-0000008759 00000 n 
-0000009016 00000 n 
-0000009113 00000 n 
-0000009215 00000 n 
-0000009320 00000 n 
-0000009429 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-9507
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/nonlinpadeg.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/nonlinpadeg.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/operators.xml igraph-0.6.5/doc/book/operators.xml
--- igraph-0.6.5~quantal1/doc/book/operators.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/operators.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-operators">
-<title>Graph Operators</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/pathlength.xml igraph-0.6.5/doc/book/pathlength.xml
--- igraph-0.6.5~quantal1/doc/book/pathlength.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/pathlength.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-pathlength">
-<title>Path Lengths and Similar Measures</title>
-
-<para></para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/pepcircle.pdf igraph-0.6.5/doc/book/pepcircle.pdf
--- igraph-0.6.5~quantal1/doc/book/pepcircle.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/pepcircle.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,244 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060813100307)
-/ModDate (D:20060813100307)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-366.00 233.14 m 345.65 298.96 l S
-334.32 315.21 m 281.51 355.55 l S
-262.85 361.87 m 197.95 361.87 l S
-179.29 355.55 m 126.48 315.21 l S
-115.15 298.96 m 94.80 233.14 l S
-94.80 213.26 m 115.15 147.44 l S
-126.48 131.19 m 179.29 90.85 l S
-197.95 84.53 m 262.85 84.53 l S
-281.51 90.85 m 334.32 131.19 l S
-366.00 213.26 m 345.65 147.44 l S
-1.000 0.000 0.000 rg
-0.000 0.000 0.000 RG
-  358.67 223.20 m
-  358.67 228.92 363.35 233.60 369.07 233.60 c
-  374.79 233.60 379.47 228.92 379.47 223.20 c
-  379.47 217.48 374.79 212.80 369.07 212.80 c
-  363.35 212.80 358.67 217.48 358.67 223.20 c
-B
-0.000 0.000 1.000 rg
-  332.18 308.90 m
-  332.18 314.62 336.86 319.30 342.58 319.30 c
-  348.30 319.30 352.98 314.62 352.98 308.90 c
-  352.98 303.18 348.30 298.50 342.58 298.50 c
-  336.86 298.50 332.18 303.18 332.18 308.90 c
-B
-1.000 0.000 0.000 rg
-  262.85 361.87 m
-  262.85 367.59 267.53 372.27 273.25 372.27 c
-  278.97 372.27 283.65 367.59 283.65 361.87 c
-  283.65 356.15 278.97 351.47 273.25 351.47 c
-  267.53 351.47 262.85 356.15 262.85 361.87 c
-B
-0.000 0.000 1.000 rg
-  177.15 361.87 m
-  177.15 367.59 181.83 372.27 187.55 372.27 c
-  193.27 372.27 197.95 367.59 197.95 361.87 c
-  197.95 356.15 193.27 351.47 187.55 351.47 c
-  181.83 351.47 177.15 356.15 177.15 361.87 c
-B
-1.000 0.000 0.000 rg
-  107.82 308.90 m
-  107.82 314.62 112.50 319.30 118.22 319.30 c
-  123.94 319.30 128.62 314.62 128.62 308.90 c
-  128.62 303.18 123.94 298.50 118.22 298.50 c
-  112.50 298.50 107.82 303.18 107.82 308.90 c
-B
-0.000 0.000 1.000 rg
-  81.33 223.20 m
-  81.33 228.92 86.01 233.60 91.73 233.60 c
-  97.45 233.60 102.13 228.92 102.13 223.20 c
-  102.13 217.48 97.45 212.80 91.73 212.80 c
-  86.01 212.80 81.33 217.48 81.33 223.20 c
-B
-1.000 0.000 0.000 rg
-  107.82 137.50 m
-  107.82 143.22 112.50 147.90 118.22 147.90 c
-  123.94 147.90 128.62 143.22 128.62 137.50 c
-  128.62 131.78 123.94 127.10 118.22 127.10 c
-  112.50 127.10 107.82 131.78 107.82 137.50 c
-B
-0.000 0.000 1.000 rg
-  177.15 84.53 m
-  177.15 90.25 181.83 94.93 187.55 94.93 c
-  193.27 94.93 197.95 90.25 197.95 84.53 c
-  197.95 78.81 193.27 74.13 187.55 74.13 c
-  181.83 74.13 177.15 78.81 177.15 84.53 c
-B
-1.000 0.000 0.000 rg
-  262.85 84.53 m
-  262.85 90.25 267.53 94.93 273.25 94.93 c
-  278.97 94.93 283.65 90.25 283.65 84.53 c
-  283.65 78.81 278.97 74.13 273.25 74.13 c
-  267.53 74.13 262.85 78.81 262.85 84.53 c
-B
-0.000 0.000 1.000 rg
-  332.18 137.50 m
-  332.18 143.22 336.86 147.90 342.58 147.90 c
-  348.30 147.90 352.98 143.22 352.98 137.50 c
-  352.98 131.78 348.30 127.10 342.58 127.10 c
-  336.86 127.10 332.18 131.78 332.18 137.50 c
-B
-Q q
-BT
-0.000 0.000 0.545 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 365.73 219.10 Tm (0) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 339.25 304.68 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 269.91 357.65 Tm (2) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 184.21 357.76 Tm (3) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 114.88 304.68 Tm (4) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 88.40 219.19 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 114.88 133.40 Tm (6) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 184.21 80.41 Tm (7) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 269.91 80.43 Tm (8) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 339.25 133.40 Tm (9) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-3253
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000003700 00000 n 
-0000003783 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000003680 00000 n 
-0000003920 00000 n 
-0000004177 00000 n 
-0000004274 00000 n 
-0000004376 00000 n 
-0000004481 00000 n 
-0000004590 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-4668
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/pepcircle.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/pepcircle.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/plotting.xml igraph-0.6.5/doc/book/plotting.xml
--- igraph-0.6.5~quantal1/doc/book/plotting.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/plotting.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-plotting">
-<title>Graph Visualization</title>
-
-<section><title>Non-interactive Graph Plotting</title>
-<para>TODO</para>
-</section>
-
-<section><title>The <function>tkplot()</function> Interactive Graph
-Drawing Facility</title>
-<para>TODO</para>
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/random.pdf igraph-0.6.5/doc/book/random.pdf
--- igraph-0.6.5~quantal1/doc/book/random.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/random.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,352 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806095747)
-/ModDate (D:20060806095747)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-170.25 110.00 m 168.95 131.42 l S
-154.11 299.95 m 143.35 295.05 l S
-336.02 217.57 m 324.91 226.98 l S
-127.97 253.03 m 141.60 255.14 l S
-240.08 282.71 m 226.05 272.08 l S
-243.54 282.94 m 263.72 271.45 l S
-209.87 289.59 m 222.49 314.29 l S
-338.58 214.39 m 345.02 202.23 l S
-333.72 261.32 m 321.59 267.69 l S
-346.93 198.54 m 352.23 188.04 l S
-242.01 352.74 m 234.70 360.36 l S
-166.99 123.20 m 173.68 150.40 l S
-127.04 196.13 m 140.61 185.17 l S
-170.90 133.62 m 197.32 135.20 l S
-174.97 150.50 m 184.00 128.83 l S
-219.77 243.10 m 206.67 255.52 l S
-208.67 285.67 m 205.42 259.02 l S
-222.70 269.61 m 206.85 258.17 l S
-185.86 227.71 m 204.02 255.22 l S
-309.07 307.87 m 319.44 310.71 l S
-219.27 242.19 m 191.31 249.44 l S
-311.87 188.74 m 299.92 196.79 l S
-295.10 181.57 m 297.81 195.90 l S
-222.81 240.26 m 238.20 226.14 l S
-321.15 270.20 m 329.78 279.70 l S
-122.86 149.26 m 111.19 153.09 l S
-191.65 198.62 m 204.38 204.18 l S
-98.26 240.56 m 108.24 245.65 l S
-123.98 251.97 m 112.03 247.34 l S
-258.05 152.09 m 272.22 147.78 l S
-164.51 120.55 m 146.82 114.98 l S
-143.54 185.47 m 152.16 195.97 l S
-223.34 241.92 m 250.78 245.24 l S
-243.17 349.17 m 241.39 335.62 l S
-224.92 317.60 m 239.64 332.10 l S
-257.69 334.75 m 243.19 333.71 l S
-145.74 255.40 m 162.13 254.98 l S
-187.26 250.36 m 166.25 254.52 l S
-266.71 268.70 m 280.05 249.40 l S
-254.91 245.65 m 279.16 247.53 l S
-178.13 345.27 m 177.85 332.90 l S
-161.64 333.58 m 175.75 331.17 l S
-317.75 268.10 m 301.49 263.56 l S
-282.82 249.03 m 297.89 261.67 l S
-225.38 315.40 m 234.51 311.87 l S
-179.20 329.28 m 191.55 315.66 l S
-241.16 223.22 m 252.14 211.59 l S
-199.21 137.40 m 197.55 155.74 l S
-321.48 229.29 m 305.89 237.41 l S
-283.16 246.90 m 302.12 239.15 l S
-240.15 285.32 m 221.51 301.12 l S
-234.61 310.16 m 221.77 303.43 l S
-194.86 313.29 m 218.01 303.29 l S
-172.39 107.39 m 186.60 103.61 l S
-168.11 119.86 m 187.00 104.40 l S
-199.77 86.48 m 189.77 101.35 l S
-182.87 86.50 m 187.93 101.11 l S
-185.12 124.86 m 188.28 105.13 l S
-254.42 102.23 m 238.95 100.48 l S
-247.07 86.26 m 238.11 98.57 l S
-254.00 152.98 m 231.79 156.03 l S
-240.25 142.57 m 230.99 154.66 l S
-240.19 169.22 m 231.04 157.93 l S
-199.44 157.72 m 227.65 156.41 l S
-143.79 182.49 m 161.20 167.24 l S
-195.34 158.29 m 164.79 165.40 l S
-157.99 301.43 m 171.27 305.55 l S
-191.02 313.34 m 175.18 306.95 l S
-92.20 200.31 m 94.70 189.52 l S
-167.10 134.66 m 148.52 147.21 l S
-126.91 148.59 m 144.72 148.39 l S
-161.36 164.33 m 148.20 149.91 l S
-323.48 310.80 m 333.99 308.44 l S
-124.35 199.22 m 117.63 210.32 l S
-220.67 239.68 m 215.77 223.82 l S
-207.26 206.85 m 214.19 219.99 l S
-201.06 134.08 m 220.04 119.89 l S
-235.56 101.85 m 223.03 117.04 l S
-297.44 199.89 m 289.98 219.09 l S
-281.83 245.70 m 288.63 223.02 l S
-184.10 223.98 m 174.64 193.63 l S
-187.81 197.03 m 175.96 192.40 l S
-174.16 154.50 m 174.03 189.57 l S
-155.48 197.01 m 172.02 192.22 l S
-190.63 102.60 m 213.42 97.14 l S
-234.83 99.90 m 217.50 97.00 l S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 153.72 298.81 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 358.10 265.15 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 201.53 354.77 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 168.10 105.93 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.00 239.67 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 166.54 131.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 123.14 195.44 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 253.78 150.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 241.16 349.23 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 239.45 281.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 239.23 138.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 139.17 292.19 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 280.28 309.86 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 335.32 214.22 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 94.12 237.62 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 311.32 185.58 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 333.27 258.35 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 123.64 250.72 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 206.64 285.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 321.04 226.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 239.22 168.83 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 141.38 253.45 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 124.74 314.81 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 222.11 268.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 321.01 118.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 263.25 268.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 164.21 119.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 198.65 82.76 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 221.16 314.14 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 182.44 223.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 343.71 198.39 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 317.47 266.66 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 350.88 184.19 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 187.46 195.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 254.20 100.46 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 179.91 82.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 230.98 359.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 304.78 305.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 122.55 146.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 175.89 345.35 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 171.89 150.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 157.31 331.93 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 304.55 139.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 139.94 181.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 366.79 209.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 197.11 133.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 338.28 135.35 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 182.51 124.91 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 202.88 254.95 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 319.16 309.26 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 112.78 288.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 292.43 177.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 187.02 247.96 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 295.92 195.95 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 237.45 222.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 328.90 279.24 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 106.93 151.74 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 204.01 203.01 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 351.48 158.88 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 107.81 244.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 271.93 145.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 89.45 200.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 257.49 332.90 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 142.56 112.36 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 151.20 195.58 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 246.01 82.58 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 301.71 333.43 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 325.29 156.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 250.56 243.49 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 238.84 331.56 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 161.92 252.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 278.95 245.69 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 175.52 328.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 297.20 261.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 234.17 309.12 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 287.23 116.75 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 190.67 312.12 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 251.29 208.08 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 195.09 155.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 301.76 236.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 98.30 270.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 281.49 88.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 217.64 300.46 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 186.33 101.08 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 234.60 98.25 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 227.45 154.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 160.48 163.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 170.97 304.17 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 304.87 100.98 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 360.28 236.76 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 92.89 185.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 144.52 146.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 333.74 305.98 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 114.27 210.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 212.88 219.83 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.43 116.64 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 286.94 219.03 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 171.74 189.65 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 213.16 94.65 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 280.80 345.35 Tm (l) Tj 0 Tr
-ET
-Q
-endstream
-endobj
-8 0 obj
-8879
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000009326 00000 n 
-0000009409 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000009306 00000 n 
-0000009546 00000 n 
-0000009803 00000 n 
-0000009900 00000 n 
-0000010002 00000 n 
-0000010107 00000 n 
-0000010216 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-10294
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/random.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/random.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/random.xml igraph-0.6.5/doc/book/random.xml
--- igraph-0.6.5~quantal1/doc/book/random.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/random.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,350 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-random">
-<title>Random Graphs</title>
-
-<section><title>Classic Random Graphs</title>
-
-<para>
-Random graphs were introduced by Erdős and Rényi in the late
-fifties. They defined two ways for generating random graph:
-G<subscript>n,p</subscript> and G<subscript>n,m</subscript>, these
-determine two ensembles of random graphs as well.
-</para>
-
-<para>
-A G<subscript>n,p</subscript> graph is undirected, has n vertices and
-p is the probability that an edge is present in the graph. So
-G<subscript>n,p</subscript> graphs are generated by drawing an
-indicator random variable for each possible edge in the graph.
-</para>
-
-<para>
-A G<subscript>n,m</subscript> random graph is undirected, has n
-vertices and m edges. The m edges are drawn uniformly random from the
-set of all possible edges.
-</para>
-
-<para>
-&igraph; can generate both types of random graphs with the
-<function>erdos.renyi.game()</function> function. (All random graph
-generators are called <emphasis>games</emphasis> in &igraph;.)
-By default this function generates G<subscript>n,p</subscript> graphs,
-but if the <parameter>type</parameter> argument is set to
-<constant>gnm</constant> then G<subscript>n,m</subscript> graph will
-be generated. The first argument of the function is the number of
-vertices and the second is either p or m depending on the type of the
-random graph.
-</para>
-
-<para>
-Here is an example of a small random graph with low edge density:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- erdos.renyi.game(100, 2/100)
-<prompt>> </prompt>plot(g, layout=layout.fruchterman.reingold, 
-         vertex.size=3, labels=NA, frame=TRUE)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="random.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="random.png" format="PNG"/></imageobject>
-</mediaobject></informalexample>
-</para>
-
-<para>
-As an example we generate two random graphs, one of each type and plot
-their degree distribution:
-<informalexample><programlisting>
-<prompt>> </prompt>g1 &lt;- erdos.renyi.game(10000, 8/10000, type="gnp")
-<prompt>> </prompt>g2 &lt;- erdos.renyi.game(10000, 30000, type="gnm")
-<prompt>> </prompt>plot(degree.distribution(g1), xlab="degree", 
-       ylab="frequency", pch=1, col=1, type="b")
-<prompt>> </prompt>points(degree.distribution(g2), pch=2, col=2, type="b")
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="randomdeg.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="randomdeg.png" format="PNG"/></imageobject>
-</mediaobject></informalexample>
-</para>
-
-<para>
-In addition to the standard undirected random graphs,
-<function>erdos.renyi.game</function> is also able to generate
-directed graphs and graphs with loop edges. See the
-<parameter>directed</parameter> and <parameter>loops</parameter>
-arguments.
-</para>
-
-</section>
-
-<!-- ######################################################## -->
-
-<section><title>Preferential Attachment and Variations</title>
-
-<para>
-This is a growing graph model introduced first by Price [TODO] and
-reintroduced later by Barabási and Albert 
-<xref linkend="bib:barabasi99a" />. This is a discrete time step model
-and it creates a directed graph (although &igraph; can create an
-undirected one as well). We start with a single vertex and in each
-time step add another vertex to the graph. This vertex then chooses a
-number of old vertices (this is a parameter called m) randomly based
-on their in-degree and initiates edges to them. In particular the
-probability that a vertex is chosen is proportional to its in-degree
-plus some constant (a). (This constant is need to have zero in-degree
-vertices non-zero connection probability.)
-The same process is repeated in the following time steps.
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- barabasi.game(100)
-<prompt>> </prompt>plot(g, layout=layout.kamada.kawai, vertex.size=3, 
-        labels=NA, frame=TRUE)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="scalefree.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="scalefree.png" format="PNG"/></imageobject>
-</mediaobject></informalexample>
-</para>
-
-<para>
-In the default version of the &igraph;
-<function>barabasi.game()</function> function, the number of edges
-added in each time step is one (m=1) and the constant giving the
-connection <quote>probability</quote> of the zero in-degree vertices
-is also one (a=1). The former can be changes by assigning a different
-value to the <parameter>m</parameter> parameter of the function, while
-the latter is set via the <parameter>zero.appeal</parameter>.
-TODO: examples
-</para>
-
-<para>
-<function>barabasi.game()</function> creates directed graphs by
-default, set the <parameter>directed</parameter> to
-<constant>FALSE</constant> to generate undirected graphs. Note however
-that even if the generated graph is undirected the connection
-probability is still calculated based on the number of adjacent edges
-<emphasis>not</emphasis> initiated by the given vertex as long as the
-<parameter>out.pref</parameter> argument is not set to
-<constant>TRUE</constant>. You can imagine this as first generating a
-directed graph and then converting that to an undirected one.
-</para>
-
-<para>
-If the <parameter>out.pref</parameter> is set to
-<constant>TRUE</constant> then the total degree of the vertices is
-used to generate the connection probabilities independently of whether
-a directed or undirected graph is being created.
-</para>
-
-<para>
-If the <parameter>out.seq</parameter> parameter is not
-<constant>NULL</constant> then it must be a vector of n integer
-numbers, n is the number of vertices in the graph. This vector is used
-as the number of edges to add per time step, it's first element is
-ignored as no edges are added while there is only a single vertex in
-the graph.
-</para>
-
-<para>
-If the <parameter>out.dist</parameter> parameter is not
-<constant>NULL</constant> then it is used as the probabilities for
-creating the number of edges to add in each time step. The first
-element of it gives the probability that no edges will be added in a
-time step, the second is the probability to add one edge, etc.
-Note that you don't need to supply probabilities,
-<parameter>out.dist</parameter> is normalized to create proper
-probabilities. It is an error however to supply meaningless values in
-<parameter>out.dist</parameter>, like negative numbers, or only zero
-elements, or an empty vector.
-</para>
-
-<para> 
-Note that the current version of <function>barabasi.game()</function>
-may create graphs with multiple edges, this might change in the
-future. 
-</para>
-
-<para>
-The original Barabási-Albert model uses linear preferential
-attachment, ie. the connection probability is proportional to the
-degree of the vertices. Nonlinear variations can also be studied with
-&igraph; by supplying the <parameter>power</parameter> parameter:
-<informalexample><programlisting>
-<prompt>> </prompt>g1 &lt;- barabasi.game(10000, power=0.5)
-<prompt>> </prompt>g2 &lt;- barabasi.game(10000, power=1)
-<prompt>> </prompt>g3 &lt;- barabasi.game(10000, poert=1.5)
-<prompt>> </prompt>plot(degree.distribution(g3), xlab="degree", 
-          ylab="frequency", log="xy", pch=3, col=3, type="b")
-<prompt>> </prompt>points(degree.distribution(g2), pch=2, col=2, type="b")
-<prompt>> </prompt>points(degree.distribution(g1), pch=1, col=1, type="b")
-<prompt>> </prompt>legend(max(degree(g3)), 1, xjust=1, yjust=1,
-          c(0.5,1,1.5), pch=1:3, col=1:3, lty=1)
-</programlisting>
-<mediaobject>
-<imageobject><imagedata fileref="nonlinpadeg.pdf" format="PDF"/></imageobject>
-<imageobject><imagedata fileref="nonlinpadeg.png" format="PNG"/></imageobject>
-</mediaobject></informalexample>
-</para>
-
-<para>
-Another generalization is the <parameter>time.window</parameter>
-parameter. If this is not <constant>NULL</constant> then its value is
-used as a time window: only adjacent edges connected in the previous
-<parameter>time.window</parameter> are counted as a basis of the
-preferential attachment. Some plots with different time window
-parameters: TODO.
-</para>
-
-</section>
-
-<!-- ######################################################## -->
-
-<section><title>The Configuration Model</title>
-
-<para>
-The configuration model is a random in which the degree sequence is
-given. Ie. in an undirected graph the degree of each node is given and 
-one should create a random graph with the given degree sequence. Note
-that this is not always possible, eg. if the sum of the degrees is odd
-then there is no such graph which could be the realization of this
-model since in a graph the sum of the degrees is always even. 
-</para>
-
-<para>
-If the sum of the degrees is even in an undirected, then there is
-always a graph which has the given degree sequence, but it may happen
-that no simple graphs fit the model, ie. every graph with the given
-degree sequence has either multiple or loop edges or both.
-</para>
-
-<para>
-For a directed graph, two degree sequences are given, one for the in-
-and one for the out-degree. It is required that the sum of these be
-the same even number. Note that for some degree sequences all the
-possible realizations contain either multiple or loop edges or both,
-ie. there are no simple graphs with the given degree sequences.
-</para>
-
-<para>
-In &igraph; the <function>degree.sequence.game()</function> can
-generate a graph with the given degree sequence(s). If only one
-argument is given then an undirected graph will be created using the
-single argument as a degree sequence. (Obviously the number of vertices
-can be determined from the length of the degree sequence.)
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- degree.sequence.game( rep(2, 10) )
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 10 
-Edges: 10 
-Directed: FALSE 
-
-Edges:
-[0] 4 -- 6
-[1] 0 -- 7
-[2] 0 -- 8
-[3] 2 -- 5
-[4] 1 -- 3
-[5] 1 -- 4
-[6] 5 -- 9
-[7] 2 -- 7
-[8] 3 -- 8
-[9] 6 -- 9
-</screen>
-<programlisting>
-<prompt>> </prompt>degree(g)
-</programlisting>
-<screen>
- [1] 2 2 2 2 2 2 2 2 2 2
-</screen>
-</informalexample>
-</para>
-
-<para>
-If two arguments are given then the first is used as the out-degree
-and the second as the in-degree sequence:
-<informalexample><programlisting>
-<prompt>> </prompt>g &lt;- degree.sequence.game( rep(1,10), rep(1,10) )
-<prompt>> </prompt>g
-</programlisting>
-<screen>
-Vertices: 10 
-Edges: 10 
-Directed: TRUE 
-
-Edges:
-[0] 8 -> 2
-[1] 2 -> 0
-[2] 4 -> 4
-[3] 6 -> 1
-[4] 3 -> 5
-[5] 9 -> 7
-[6] 0 -> 8
-[7] 7 -> 3
-[8] 1 -> 9
-[9] 5 -> 6
-</screen>
-<programlisting>
-<prompt>> </prompt>degree(g, mode="in") ; degree(g, mode="out")
-</programlisting>
-<screen>
- [1] 1 1 1 1 1 1 1 1 1 1
- [1] 1 1 1 1 1 1 1 1 1 1
-</screen>
-</informalexample>
-</para>
-
-<para>
-Function <function>degree.sequence.game()</function> also has an
-argument called <parameter>method</parameter>, which specifies the
-algorithm to use for the graph generation. Right now only the
-<constant>simple</constant> algorithm is implemented so this is the
-default method. 
-</para>
-
-<para>
-The <constant>simple</constant> method first assigns degrees to
-vertices and then creates stubs, uncorrected edge end-points, the
-appropriate number for each vertex. Then it simply connects the stubs
-randomly. This way multiple and loop edges might be generated.
-It is known that this algorithm does not sample uniformly from the
-ensemble of the random graphs with the given degree sequence.
-</para>
-
-</section>
-
-<!-- ######################################################## -->
-
-<section><title>Growing Random Graphs</title>
-
-<para>
-<function>growing.random.game()</function>
-</para>
-
-</section>
-
-<!-- ######################################################## -->
-
-<section><title>Trait Based Random Graphs</title>
-
-<para>
-<function>callaway.traits.game()</function>
-<function>establishment.game()</function>
-</para>
-
-</section>
-
-<!-- ######################################################## -->
-
-<section><title>Preferential Attachment and Aging</title>
-
-<para>
-<function>aging.barabasi.game()</function>
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/randomdeg.pdf igraph-0.6.5/doc/book/randomdeg.pdf
--- igraph-0.6.5~quantal1/doc/book/randomdeg.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/randomdeg.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,343 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060805224553)
-/ModDate (D:20060805224553)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-78.67 86.64 m 79.91 86.99 l S
-92.68 93.16 m 96.12 95.65 l S
-105.25 106.27 m 113.77 122.83 l S
-119.18 136.11 m 130.06 171.46 l S
-134.01 185.30 m 145.45 228.64 l S
-149.24 242.53 m 160.45 282.34 l S
-167.06 294.76 m 172.85 301.57 l S
-183.85 310.47 m 186.29 311.79 l S
-196.08 308.90 m 204.27 293.95 l S
-210.39 280.95 m 220.18 256.32 l S
-224.99 242.75 m 235.81 208.05 l S
-240.64 194.49 m 250.39 170.17 l S
-256.36 157.09 m 264.88 140.53 l S
-271.87 127.95 m 279.60 115.02 l S
-289.24 104.79 m 292.45 102.61 l S
-304.88 95.42 m 307.03 94.37 l S
-320.50 89.49 m 321.63 89.20 l S
-335.80 86.85 m 336.56 86.78 l S
-350.92 85.70 m 351.66 85.65 l S
-366.04 84.95 m 366.76 84.93 l S
-381.16 84.70 m 381.87 84.70 l S
-BT
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 68.77 82.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 83.88 86.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 98.99 97.27 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 114.10 126.64 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 129.22 175.74 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 144.33 233.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 159.44 286.68 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 174.55 304.46 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 189.66 312.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 204.77 285.04 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 219.88 247.03 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 234.99 198.58 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 250.10 160.90 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 265.22 131.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 280.33 106.25 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 295.44 95.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 310.55 88.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 325.66 84.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 340.77 83.57 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 355.88 82.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 370.99 82.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 1 Tr 7.48 0 0 7.48 386.10 82.10 Tm (l) Tj 0 Tr
-ET
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-132.18 73.44 m 358.84 73.44 l S
-132.18 73.44 m 132.18 66.24 l S
-207.73 73.44 m 207.73 66.24 l S
-283.29 73.44 m 283.29 66.24 l S
-358.84 73.44 m 358.84 66.24 l S
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 128.84 47.52 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 201.06 47.52 Tm (10) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 276.62 47.52 Tm (15) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 352.17 47.52 Tm (20) Tj
-ET
-59.04 84.53 m 59.04 329.24 l S
-59.04 84.53 m 51.84 84.53 l S
-59.04 166.10 m 51.84 166.10 l S
-59.04 247.67 m 51.84 247.67 l S
-59.04 329.24 m 51.84 329.24 l S
-BT
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 72.86 Tm (0.00) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 154.43 Tm (0.05) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 235.99 Tm (0.10) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 317.56 Tm (0.15) Tj
-ET
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 211.72 18.72 Tm (degree) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 12.96 196.85 Tm (frequency) Tj
-ET
-Q q 59.04 73.44 342.72 299.52 re W n
-1.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-76.20 94.42 m 82.38 102.22 l S
-88.77 114.80 m 100.03 155.25 l S
-103.52 169.21 m 115.50 222.86 l S
-118.56 236.93 m 130.69 294.30 l S
-134.59 308.13 m 144.88 337.14 l S
-153.36 347.79 m 156.33 349.68 l S
-164.22 346.58 m 175.69 302.76 l S
-180.02 289.05 m 190.11 261.92 l S
-194.47 248.22 m 205.89 205.20 l S
-209.98 191.40 m 220.60 159.08 l S
-226.35 145.95 m 234.45 131.44 l S
-241.76 119.04 m 249.27 106.96 l S
-259.54 97.70 m 261.70 96.65 l S
-275.03 91.29 m 276.44 90.83 l S
-290.42 87.61 m 291.27 87.49 l S
-305.56 85.72 m 306.35 85.63 l S
-71.73 92.97 m
-75.37 86.68 l
-68.10 86.68 l
-71.73 92.97 l
-S
-86.84 112.06 m
-90.48 105.76 l
-83.21 105.76 l
-86.84 112.06 l
-S
-101.96 166.39 m
-105.59 160.09 l
-98.32 160.09 l
-101.96 166.39 l
-S
-117.07 234.09 m
-120.70 227.79 l
-113.43 227.79 l
-117.07 234.09 l
-S
-132.18 305.54 m
-135.81 299.24 l
-128.54 299.24 l
-132.18 305.54 l
-S
-147.29 348.12 m
-150.93 341.82 l
-143.65 341.82 l
-147.29 348.12 l
-S
-162.40 357.75 m
-166.04 351.45 l
-158.76 351.45 l
-162.40 357.75 l
-S
-177.51 299.99 m
-181.15 293.70 l
-173.87 293.70 l
-177.51 299.99 l
-S
-192.62 259.37 m
-196.26 253.08 l
-188.99 253.08 l
-192.62 259.37 l
-S
-207.73 202.44 m
-211.37 196.14 l
-204.10 196.14 l
-207.73 202.44 l
-S
-222.84 156.43 m
-226.48 150.14 l
-219.21 150.14 l
-222.84 156.43 l
-S
-237.96 129.35 m
-241.59 123.06 l
-234.32 123.06 l
-237.96 129.35 l
-S
-253.07 105.05 m
-256.70 98.75 l
-249.43 98.75 l
-253.07 105.05 l
-S
-268.18 97.70 m
-271.81 91.41 l
-264.54 91.41 l
-268.18 97.70 l
-S
-283.29 92.81 m
-286.93 86.51 l
-279.65 86.51 l
-283.29 92.81 l
-S
-298.40 90.69 m
-302.04 84.39 l
-294.76 84.39 l
-298.40 90.69 l
-S
-313.51 89.06 m
-317.15 82.76 l
-309.87 82.76 l
-313.51 89.06 l
-S
-Q
-endstream
-endobj
-8 0 obj
-4833
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000005280 00000 n 
-0000005363 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000005260 00000 n 
-0000005500 00000 n 
-0000005757 00000 n 
-0000005854 00000 n 
-0000005956 00000 n 
-0000006061 00000 n 
-0000006170 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-6248
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/randomdeg.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/randomdeg.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/reddiameter.fig igraph-0.6.5/doc/book/reddiameter.fig
--- igraph-0.6.5~quantal1/doc/book/reddiameter.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/reddiameter.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,412 +0,0 @@
-#FIG 3.2
-Landscape
-Flush Left
-Inches
-Letter
-100.0
-Single
--2
-1200 2
-# End of XFig header
-0 32 #ff0000
-0 33 #7ec0ee
-0 34 #0000ff
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-7368 4902 6548 4940
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-6471 4987 6017 5766
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-6001 5861 6169 6728
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6467 4901 5950 4171
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6036 5836 6341 6007
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5905 4080 5631 3244
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5975 5859 5876 6138
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5873 4109 5500 3951
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5597 3147 5426 2701
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5935 4080 6104 3495
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5945 5832 5351 6101
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-6194 6828 6426 7609
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5958 5849 5509 6376
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5634 3147 5947 2357
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5941 5804 5163 5714
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5275 6165 4814 6826
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-6447 7709 6528 8351
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-7470 4906 8332 5003
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5949 5782 5598 5554
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6027 5848 6469 6322
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5426 6427 4660 6624
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8402 4961 8618 4422
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5633 3147 5820 2657
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5951 2260 5761 1606
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7442 4854 7802 4141
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7437 4948 7715 5688
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5063 5721 4280 5937
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8415 5050 8936 5726
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6149 6821 5727 7421
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6175 6830 6133 7307
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5951 4087 6347 3538
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7466 4921 7752 5049
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5869 4125 5033 4065
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5577 3161 5001 2645
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4931 2570 4545 2077
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7407 4850 7331 4536
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5951 4087 6120 3851
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6507 4892 6571 4580
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5253 6124 4588 6137
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7465 4877 7786 4716
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-8426 4980 9126 4506
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7426 4849 7516 4204
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9176 4426 9276 3717
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8394 5059 8525 5676
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5565 3185 4991 3078
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6477 7695 6957 8187
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5895 4085 5721 3791
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5941 5805 5645 5777
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5877 4156 5500 4385
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4190 5982 3626 6417
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7837 4046 7996 3414
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9220 4472 9813 4413
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6512 4992 6579 5211
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-9196 4434 9600 3795
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9009 5797 9480 6137
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5870 4137 5402 4213
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7540 4104 7792 3371
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8988 5814 9288 6475
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7447 4943 7696 5321
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7423 4951 7460 5478
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5063 5693 4487 5520
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4949 4022 4565 3565
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6598 4481 6846 3803
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4179 5944 3506 5859
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4755 6910 4320 7513
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6137 3398 6419 2660
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7443 4854 7613 4533
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6011 5858 6150 6199
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7409 4950 7354 5240
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5471 6466 5420 7141
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4912 2599 4240 2448
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8433 5022 8853 5132
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7854 4053 8293 3413
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6217 6813 6670 7216
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6450 4920 6235 4814
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9353 6548 9937 6889
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-7757 5781 8110 6444
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6397 3449 6707 2717
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5674 7508 5344 8158
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4934 4043 4305 3806
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6449 4962 6232 5050
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9210 4446 9640 4127
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4213 3763 3604 3409
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5447 6458 5104 6984
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8415 5050 8695 5409
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9018 5767 9686 5770
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4570 6669 3997 7131
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-5988 2263 6285 1638
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6416 7703 6056 8338
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4932 4073 4264 4225
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9208 4510 9774 4994
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8426 4980 8749 4763
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4964 2559 4978 1839
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-9217 4495 9839 4719
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-4164 4224 3467 4063
-2 1 0 2 32 7 100 0 -1 8.00 0 0 -1 0 0 2
-9671 3725 10218 3383
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-6531 6403 6923 7026
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8162 6532 8560 7147
-2 1 0 1 33 7 100 0 -1 4.00 0 0 -1 0 0 2
-8340 3322 8599 2632
-1 3 0 1 0 32 100 0 20 4.00 1 0   7419 4900 51 51 7419 4900 7470 4900 
-1 3 0 1 0 32 100 0 20 4.00 1 0   6497 4943 51 51 6497 4943 6548 4943 
-1 3 0 1 0 32 100 0 20 4.00 1 0   5992 5810 51 51 5992 5810 6043 5810 
-1 3 0 1 0 32 100 0 20 4.00 1 0   6179 6779 51 51 6179 6779 6230 6779 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5921 4129 51 51 5921 4129 5972 4129 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6385 6033 51 51 6385 6033 6436 6033 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5615 3195 51 51 5615 3195 5666 3195 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5859 6186 51 51 5859 6186 5910 6186 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5453 3930 51 51 5453 3930 5504 3930 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5407 2653 51 51 5407 2653 5458 2653 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6118 3445 51 51 6118 3445 6169 3445 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5305 6123 51 51 5305 6123 5356 6123 
-1 3 0 1 0 32 100 0 20 4.00 1 0   6441 7658 51 51 6441 7658 6492 7658 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5475 6415 51 51 5475 6415 5526 6415 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5966 2309 51 51 5966 2309 6017 2309 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5112 5708 51 51 5112 5708 5163 5708 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4785 6868 51 51 4785 6868 4836 6868 
-1 3 0 1 0 32 100 0 20 4.00 1 0   6535 8402 51 51 6535 8402 6586 8402 
-1 3 0 1 0 32 100 0 20 4.00 1 0   8383 5009 51 51 8383 5009 8434 5009 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5555 5526 51 51 5555 5526 5606 5526 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6504 6359 51 51 6504 6359 6555 6359 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4610 6636 51 51 4610 6636 4661 6636 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8637 4374 51 51 8637 4374 8688 4374 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5838 2609 51 51 5838 2609 5889 2609 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5747 1557 51 51 5747 1557 5798 1557 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7825 4095 51 51 7825 4095 7876 4095 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7733 5736 51 51 7733 5736 7784 5736 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4230 5950 51 51 4230 5950 4281 5950 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8967 5767 51 51 8967 5767 9018 5767 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5697 7462 51 51 5697 7462 5748 7462 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6129 7358 51 51 6129 7358 6180 7358 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6377 3496 51 51 6377 3496 6428 3496 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7799 5070 51 51 7799 5070 7850 5070 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4982 4061 51 51 4982 4061 5033 4061 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4963 2611 51 51 4963 2611 5014 2611 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4513 2037 51 51 4513 2037 4564 2037 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7319 4486 51 51 7319 4486 7370 4486 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6150 3809 51 51 6150 3809 6201 3809 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6581 4529 51 51 6581 4529 6632 4529 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4537 6138 51 51 4537 6138 4588 6138 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7832 4693 51 51 7832 4693 7883 4693 
-1 3 0 1 0 32 100 0 20 4.00 1 0   9168 4477 51 51 9168 4477 9219 4477 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7524 4153 51 51 7524 4153 7575 4153 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9283 3666 51 51 9283 3666 9334 3666 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8536 5726 51 51 8536 5726 8587 5726 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4941 3068 51 51 4941 3068 4992 3068 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6993 8224 51 51 6993 8224 7044 8224 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5695 3747 51 51 5695 3747 5746 3747 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5594 5772 51 51 5594 5772 5645 5772 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5456 4411 51 51 5456 4411 5507 4411 
-1 3 0 1 0 34 100 0 20 4.00 1 0   3586 6448 51 51 3586 6448 3637 6448 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8008 3364 51 51 8008 3364 8059 3364 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9864 4408 51 51 9864 4408 9915 4408 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6595 5260 51 51 6595 5260 6646 5260 
-1 3 0 1 0 32 100 0 20 4.00 1 0   9628 3752 51 51 9628 3752 9679 3752 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9522 6167 51 51 9522 6167 9573 6167 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5351 4221 51 51 5351 4221 5402 4221 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7809 3323 51 51 7809 3323 7860 3323 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9309 6522 51 51 9309 6522 9360 6522 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7724 5364 51 51 7724 5364 7775 5364 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7464 5529 51 51 7464 5529 7515 5529 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4438 5505 51 51 4438 5505 4489 5505 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4532 3525 51 51 4532 3525 4583 3525 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6864 3755 51 51 6864 3755 6915 3755 
-1 3 0 1 0 34 100 0 20 4.00 1 0   3455 5852 51 51 3455 5852 3506 5852 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4290 7555 51 51 4290 7555 4341 7555 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6437 2612 51 51 6437 2612 6488 2612 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7637 4487 51 51 7637 4487 7688 4487 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6169 6246 51 51 6169 6246 6220 6246 
-1 3 0 1 0 34 100 0 20 4.00 1 0   7345 5290 51 51 7345 5290 7396 5290 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5416 7193 51 51 5416 7193 5467 7193 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4190 2437 51 51 4190 2437 4241 2437 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8902 5145 51 51 8902 5145 8953 5145 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8322 3370 51 51 8322 3370 8373 3370 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6709 7250 51 51 6709 7250 6760 7250 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6189 4792 51 51 6189 4792 6240 4792 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9982 6915 51 51 9982 6915 10033 6915 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8134 6489 51 51 8134 6489 8185 6489 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6727 2669 51 51 6727 2669 6778 2669 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5320 8203 51 51 5320 8203 5371 8203 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4257 3788 51 51 4257 3788 4308 3788 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6185 5070 51 51 6185 5070 6236 5070 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9681 4096 51 51 9681 4096 9732 4096 
-1 3 0 1 0 34 100 0 20 4.00 1 0   3559 3383 51 51 3559 3383 3610 3383 
-1 3 0 1 0 34 100 0 20 4.00 1 0   5076 7027 51 51 5076 7027 5127 7027 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8727 5449 51 51 8727 5449 8778 5449 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9737 5770 51 51 9737 5770 9788 5770 
-1 3 0 1 0 34 100 0 20 4.00 1 0   3957 7163 51 51 3957 7163 4008 7163 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6307 1592 51 51 6307 1592 6358 1592 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6031 8383 51 51 6031 8383 6082 8383 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4214 4236 51 51 4214 4236 4265 4236 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9813 5027 51 51 9813 5027 9864 5027 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8792 4735 51 51 8792 4735 8843 4735 
-1 3 0 1 0 34 100 0 20 4.00 1 0   4979 1788 51 51 4979 1788 5030 1788 
-1 3 0 1 0 34 100 0 20 4.00 1 0   9887 4736 51 51 9887 4736 9938 4736 
-1 3 0 1 0 34 100 0 20 4.00 1 0   3417 4051 51 51 3417 4051 3468 4051 
-1 3 0 1 0 32 100 0 20 4.00 1 0   10262 3356 51 51 10262 3356 10313 3356 
-1 3 0 1 0 34 100 0 20 4.00 1 0   6950 7070 51 51 6950 7070 7001 7070 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8588 7191 51 51 8588 7191 8639 7191 
-1 3 0 1 0 34 100 0 20 4.00 1 0   8617 2584 51 51 8617 2584 8668 2584 
-4 1 32 100 0 16 12 0.0000 4 144 111 7489 4898 0\001
-4 1 32 100 0 16 12 0.0000 4 144 111 6567 4943 1\001
-4 1 32 100 0 16 12 0.0000 4 144 111 6062 5811 2\001
-4 1 32 100 0 16 12 0.0000 4 144 111 6249 6777 3\001
-4 1 34 100 0 16 12 0.0000 4 144 111 5991 4129 4\001
-4 1 34 100 0 16 12 0.0000 4 144 111 6455 6029 5\001
-4 1 34 100 0 16 12 0.0000 4 144 111 5685 3193 6\001
-4 1 34 100 0 16 12 0.0000 4 144 111 5929 6185 7\001
-4 1 34 100 0 16 12 0.0000 4 144 111 5523 3929 8\001
-4 1 34 100 0 16 12 0.0000 4 144 111 5477 2651 9\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6229 3403 10\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5415 6082 11\001
-4 1 32 100 0 16 12 0.0000 4 144 222 6552 7618 12\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5586 6372 13\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6077 2269 14\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5223 5665 15\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4896 6826 16\001
-4 1 32 100 0 16 12 0.0000 4 144 222 6646 8361 17\001
-4 1 32 100 0 16 12 0.0000 4 144 222 8494 4967 18\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5665 5484 19\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6615 6317 20\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4721 6596 21\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8748 4333 22\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5949 2566 23\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5858 1516 24\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7936 4053 25\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7844 5693 26\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4341 5910 27\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9078 5724 28\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5808 7420 29\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6240 7315 30\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6488 3454 31\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7910 5027 32\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5093 4019 33\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5073 2568 34\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4624 1994 35\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7430 4444 36\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6261 3767 37\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6692 4487 38\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4648 6095 39\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7943 4651 40\001
-4 1 32 100 0 16 12 0.0000 4 144 222 9279 4437 41\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7634 4112 42\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9394 3623 43\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8647 5686 44\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5052 3026 45\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7104 8182 46\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5806 3706 47\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5705 5730 48\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5567 4369 49\001
-4 1 34 100 0 16 12 0.0000 4 144 222 3696 6406 50\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8119 3322 51\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9975 4365 52\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6705 5218 53\001
-4 1 32 100 0 16 12 0.0000 4 144 222 9739 3709 54\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9633 6123 55\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5462 4179 56\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7920 3279 57\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9420 6479 58\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7835 5321 59\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7575 5487 60\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4549 5462 61\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4643 3483 62\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6975 3712 63\001
-4 1 34 100 0 16 12 0.0000 4 144 222 3566 5810 64\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4401 7512 65\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6548 2570 66\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7748 4445 67\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6280 6204 68\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7456 5248 69\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5527 7150 70\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4301 2397 71\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9013 5104 72\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8433 3328 73\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6820 7209 74\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6300 4748 75\001
-4 1 34 100 0 16 12 0.0000 4 144 222 10093 6873 76\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8245 6447 77\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6838 2627 78\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5431 8161 79\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4368 3746 80\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6296 5027 81\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9792 4053 82\001
-4 1 34 100 0 16 12 0.0000 4 144 222 3670 3340 83\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5187 6985 84\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8838 5407 85\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9848 5728 86\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4068 7120 87\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6418 1549 88\001
-4 1 34 100 0 16 12 0.0000 4 144 222 6142 8340 89\001
-4 1 34 100 0 16 12 0.0000 4 144 222 4325 4193 90\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9924 4985 91\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8903 4692 92\001
-4 1 34 100 0 16 12 0.0000 4 144 222 5089 1746 93\001
-4 1 34 100 0 16 12 0.0000 4 144 222 9998 4694 94\001
-4 1 34 100 0 16 12 0.0000 4 144 222 3528 4009 95\001
-4 1 32 100 0 16 12 0.0000 4 144 222 10373 3313 96\001
-4 1 34 100 0 16 12 0.0000 4 144 222 7061 7027 97\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8699 7148 98\001
-4 1 34 100 0 16 12 0.0000 4 144 222 8728 2541 99\001
-# end of XFig file
diff -Nru igraph-0.6.5~quantal1/doc/book/reddiameter.pdf igraph-0.6.5/doc/book/reddiameter.pdf
--- igraph-0.6.5~quantal1/doc/book/reddiameter.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/reddiameter.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,511 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060812144355)
-/ModDate (D:20060812144355)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-211.96 207.85 m 232.82 231.77 l S
-236.27 233.30 m 270.17 232.68 l S
-274.19 231.90 m 304.06 220.47 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-233.31 235.22 m 218.83 266.11 l S
-273.94 233.85 m 282.76 240.16 l S
-218.37 270.03 m 225.07 302.34 l S
-273.30 230.85 m 280.47 218.55 l S
-218.49 270.00 m 221.92 282.88 l S
-225.93 306.41 m 229.47 322.98 l S
-215.87 267.95 m 190.57 267.42 l S
-274.14 233.50 m 297.90 244.30 l S
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-308.08 219.64 m 338.61 218.36 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-273.13 230.76 m 285.94 203.53 l S
-226.77 306.02 m 244.37 328.62 l S
-273.40 234.38 m 290.07 259.51 l S
-301.50 246.35 m 325.48 263.12 l S
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-342.48 219.33 m 365.99 233.16 l S
-209.29 204.66 m 188.75 178.85 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-272.13 234.72 m 271.40 246.91 l S
-272.88 234.63 m 279.45 255.38 l S
-287.99 199.92 m 304.69 175.10 l S
-186.26 175.52 m 177.17 162.51 l S
-227.35 305.32 m 247.88 315.80 l S
-247.08 331.77 m 264.47 350.09 l S
-208.60 206.89 m 178.67 216.10 l S
-211.83 204.61 m 229.25 181.18 l S
-292.87 262.50 m 317.12 280.84 l S
-187.92 175.20 m 195.22 143.74 l S
-307.10 217.96 m 322.10 193.76 l S
-307.72 218.56 m 323.14 208.05 l S
-216.84 269.75 m 205.98 286.91 l S
-208.66 205.49 m 196.65 200.57 l S
-216.04 268.82 m 186.43 281.67 l S
-224.47 306.19 m 209.68 332.19 l S
-207.90 335.94 m 199.50 357.86 l S
-208.52 206.52 m 191.22 208.54 l S
-219.77 269.01 m 232.68 276.21 l S
-235.37 231.63 m 241.83 222.33 l S
-301.87 245.36 m 326.01 247.68 l S
-212.51 205.49 m 223.59 200.90 l S
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-185.46 176.63 m 154.23 167.35 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-211.30 204.33 m 219.24 182.51 l S
-152.24 164.68 m 152.30 136.92 l S
-187.48 175.15 m 187.72 158.19 l S
-223.92 305.74 m 208.58 318.98 l S
-342.75 217.99 m 367.01 214.69 l S
-216.21 269.14 m 206.57 275.48 l S
-272.21 230.56 m 271.94 217.01 l S
-215.92 267.54 m 202.19 264.45 l S
-319.66 283.97 m 330.89 307.77 l S
-174.82 217.63 m 153.65 228.12 l S
-151.49 164.82 m 142.55 141.64 l S
-235.56 234.90 m 241.73 241.95 l S
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-150.17 167.03 m 121.43 170.72 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-196.91 140.03 m 211.67 119.50 l S
-219.49 269.39 m 235.34 283.78 l S
-220.86 178.68 m 233.02 153.59 l S
-195.70 139.63 m 195.74 114.47 l S
-208.90 207.49 m 192.92 218.92 l S
-210.02 204.28 m 206.85 193.05 l S
-291.62 263.29 m 296.38 287.17 l S
-182.69 283.49 m 164.16 293.45 l S
-243.99 218.79 m 257.08 194.18 l S
-320.73 282.80 m 345.95 291.83 l S
-329.18 264.89 m 356.28 272.74 l S
-186.46 267.81 m 158.36 273.87 l S
-211.88 204.65 m 220.62 193.56 l S
-274.22 231.98 m 286.09 228.03 l S
-209.30 207.92 m 202.43 216.65 l S
-288.63 200.61 m 308.62 189.16 l S
-209.37 335.95 m 218.19 359.91 l S
-188.59 175.49 m 200.34 157.54 l S
-174.60 216.82 m 145.63 218.40 l S
-307.84 220.71 m 327.59 231.23 l S
-233.96 235.40 m 232.96 244.32 l S
-195.57 110.31 m 193.56 86.61 l S
-231.36 177.62 m 243.88 150.57 l S
-203.50 290.23 m 185.56 310.75 l S
-324.73 190.59 m 344.92 172.03 l S
-182.45 282.70 m 152.56 285.53 l S
-232.28 234.17 m 223.71 237.91 l S
-150.21 166.29 m 129.97 161.57 l S
-148.66 286.73 m 125.05 299.63 l S
-287.12 199.59 m 290.55 176.06 l S
-185.51 177.98 m 163.56 186.54 l S
-194.39 140.09 m 179.12 120.95 l S
-307.21 171.80 m 324.68 151.47 l S
-245.68 332.34 m 246.06 357.43 l S
-342.12 216.76 m 360.89 196.98 l S
-183.39 284.24 m 168.25 307.51 l S
-150.47 167.86 m 127.33 182.17 l S
-185.37 177.09 m 169.41 176.03 l S
-206.90 335.12 m 183.76 350.01 l S
-150.72 165.33 m 134.13 149.67 l S
-165.51 310.57 m 144.84 327.46 l S
-1.000 0.000 0.000 RG
-1.50 w
-[] 0 d
-117.40 170.31 m 93.70 162.10 l S
-0.494 0.753 0.933 RG
-0.75 w
-[] 0 d
-281.52 258.87 m 301.32 279.47 l S
-245.40 146.70 m 253.79 120.90 l S
-141.53 218.96 m 114.24 225.04 l S
-1.000 0.000 0.000 rg
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 208.31 204.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 231.91 231.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 269.97 230.64 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 303.72 217.73 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 215.67 265.99 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 282.17 239.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 223.21 302.38 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 279.24 214.76 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 220.18 282.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 227.62 323.02 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 186.21 265.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 297.52 243.16 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 338.41 216.27 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 284.54 199.65 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 243.36 328.26 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 288.93 259.25 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 324.90 262.31 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 365.50 232.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 185.17 175.23 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 269.00 246.99 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 277.80 255.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 303.57 171.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 173.70 158.81 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 247.45 314.75 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 263.62 349.60 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 174.40 214.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 228.21 177.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 316.49 280.09 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 193.41 139.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 320.92 190.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 322.58 204.88 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 202.59 286.66 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 192.44 197.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 182.24 280.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 206.37 332.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 196.47 357.80 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 186.87 206.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 232.22 275.23 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 240.73 218.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 325.80 245.88 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 223.23 198.10 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 149.95 164.76 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 217.67 178.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 150.03 132.84 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 185.47 154.11 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 204.72 318.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 366.79 212.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 202.55 274.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 269.61 212.93 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 197.88 261.99 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 329.50 307.66 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 149.50 227.05 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 139.52 137.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 240.82 241.51 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 117.08 168.99 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 210.60 115.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 234.60 283.17 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 231.65 149.72 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 193.46 110.39 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 188.95 218.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 204.00 189.04 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 294.51 287.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 160.04 292.44 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 255.78 190.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 345.62 290.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 356.00 271.31 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 154.05 272.31 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.63 189.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 285.79 225.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 198.86 216.29 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 308.14 186.12 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 216.63 359.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 199.20 153.80 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 141.28 216.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 327.15 230.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 230.45 244.39 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 191.11 82.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 242.47 146.68 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 181.91 310.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 344.17 168.62 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 148.21 283.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.52 236.74 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 125.66 159.09 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 120.94 298.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 288.57 172.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 159.34 185.29 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 175.55 117.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 323.75 147.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 243.80 357.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 360.04 193.47 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 164.84 307.25 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 123.28 181.27 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 165.05 173.89 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 179.73 349.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 130.34 146.24 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 140.95 326.78 Tm (l) Tj 0 Tr
-1.000 0.000 0.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 89.45 159.42 Tm (l) Tj 0 Tr
-0.000 0.000 1.000 rg
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 300.48 278.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 252.15 116.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 109.93 223.49 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 210.09 205.02 Tm (0) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 233.69 231.95 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 271.75 231.26 Tm (2) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.50 218.46 Tm (3) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 217.45 266.61 Tm (4) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 283.95 240.19 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 225.00 303.11 Tm (6) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 281.02 215.47 Tm (7) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 221.96 283.62 Tm (8) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 229.40 323.75 Tm (9) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 186.32 267.76 Tm (10) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 297.62 245.43 Tm (11) Tj
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 338.51 218.55 Tm (12) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 284.65 202.04 Tm (13) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 243.47 330.54 Tm (14) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 289.04 261.64 Tm (15) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 325.01 264.70 Tm (16) Tj
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 365.60 234.49 Tm (17) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 185.27 177.62 Tm (18) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 269.10 249.38 Tm (19) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 277.90 257.76 Tm (20) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 303.68 173.65 Tm (21) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 173.80 161.09 Tm (22) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 247.56 317.14 Tm (23) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 263.72 351.87 Tm (24) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 174.50 217.10 Tm (25) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 228.31 179.90 Tm (26) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 316.60 282.37 Tm (27) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 193.51 142.10 Tm (28) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 321.02 192.39 Tm (29) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 322.68 207.27 Tm (30) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 202.69 289.05 Tm (31) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 192.55 200.18 Tm (32) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 182.34 282.89 Tm (33) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 206.47 334.39 Tm (34) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 196.58 360.19 Tm (35) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 186.98 209.18 Tm (36) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 232.32 277.62 Tm (37) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 240.84 221.01 Tm (38) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 325.91 248.27 Tm (39) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 223.33 200.49 Tm (40) Tj
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 150.06 167.04 Tm (41) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 217.78 180.83 Tm (42) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 150.13 135.23 Tm (43) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 185.58 156.39 Tm (44) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 204.82 320.73 Tm (45) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 366.89 214.80 Tm (46) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 202.65 276.90 Tm (47) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 269.72 215.32 Tm (48) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 197.98 264.38 Tm (49) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 329.60 310.05 Tm (50) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 149.60 229.44 Tm (51) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 139.63 140.09 Tm (52) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 240.92 243.90 Tm (53) Tj
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 117.19 171.38 Tm (54) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 210.71 118.30 Tm (55) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 234.70 285.56 Tm (56) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 231.75 152.20 Tm (57) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 193.56 112.78 Tm (58) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 189.05 220.52 Tm (59) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 204.10 191.43 Tm (60) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 294.61 289.60 Tm (61) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 160.15 294.83 Tm (62) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 255.88 192.73 Tm (63) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 345.73 292.92 Tm (64) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 356.10 273.70 Tm (65) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 154.15 274.70 Tm (66) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 219.73 192.31 Tm (67) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 285.89 227.76 Tm (68) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 198.96 218.68 Tm (69) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 308.24 188.51 Tm (70) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 216.73 362.14 Tm (71) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 199.30 156.07 Tm (72) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 141.38 218.90 Tm (73) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 327.25 232.49 Tm (74) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 230.55 246.87 Tm (75) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 191.21 84.92 Tm (76) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 242.58 149.05 Tm (77) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 182.02 312.71 Tm (78) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 344.27 171.01 Tm (79) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 148.31 286.12 Tm (80) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 219.62 239.13 Tm (81) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 125.77 161.48 Tm (82) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 121.05 301.02 Tm (83) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 288.67 174.39 Tm (84) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 159.44 187.68 Tm (85) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 175.65 119.72 Tm (86) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 323.86 150.28 Tm (87) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 243.91 359.90 Tm (88) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 360.14 195.86 Tm (89) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 164.94 309.64 Tm (90) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 123.39 183.65 Tm (91) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 165.15 176.28 Tm (92) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 179.83 351.52 Tm (93) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 130.44 148.63 Tm (94) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 141.06 329.17 Tm (95) Tj
-1.000 0.000 0.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 89.56 161.81 Tm (96) Tj
-0.000 0.000 1.000 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 300.59 281.36 Tm (97) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 252.26 119.31 Tm (98) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 110.03 225.88 Tm (99) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-15772
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000016220 00000 n 
-0000016303 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000016199 00000 n 
-0000016440 00000 n 
-0000016697 00000 n 
-0000016794 00000 n 
-0000016896 00000 n 
-0000017001 00000 n 
-0000017110 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-17188
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/reddiameter.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/reddiameter.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/relations.csv igraph-0.6.5/doc/book/relations.csv
--- igraph-0.6.5~quantal1/doc/book/relations.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/relations.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-Bob,Alice,N,4,4
-Cecil,Bob,N,5,5
-Cecil,Alice,Y,5,5
-David,Alice,N,3,4
-David,Bob,N,4,2
-Esmeralda,Alice,Y,4,3
-Frank,Alice,N,3,2
-Frank,Esmeralda,N,4,4
-Gabi,Bob,Y,5,5
-Gabi,Alice,N,3,0
-Helen,Alice,N,4,1
-Iris,Cecil,N,0,1
-Iris,Bob,Y,4,3
-Iris,Esmeralda,N,5,5
-James,Alice,N,3,2
-James,Bob,Y,4,5
-James,Gabi,Y,5,5
-Alice,Bob,N,4,4
-Bob,Cecil,N,5,5
-Alice,Cecil,Y,5,5
-Alice,David,N,0,3
-Bob,David,N,4,1
-Alice,Esmeralda,Y,3,1
-Alice,Frank,N,3,3
-Esmeralda,Frank,N,5,4
-Bob,Gabi,Y,4,5
-Alice,Gabi,N,0,1
-Alice,Helen,N,4,3
-Cecil,Iris,N,3,2
-Bob,Iris,Y,3,2
-Esmeralda,Iris,N,5,5
-Alice,James,N,0,3
-Bob,James,Y,4,3
-Gabi,James,Y,5,4
diff -Nru igraph-0.6.5~quantal1/doc/book/scalefree.pdf igraph-0.6.5/doc/book/scalefree.pdf
--- igraph-0.6.5~quantal1/doc/book/scalefree.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/scalefree.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,761 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060806100154)
-/ModDate (D:20060806100154)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-59.04 73.44 m
-401.76 73.44 l
-401.76 372.96 l
-59.04 372.96 l
-59.04 73.44 l
-S
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.663 0.663 0.663 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-215.21 237.60 m 242.12 220.75 l S
-228.04 223.75 m
-242.12 220.75 l
-233.27 232.10 l
-S
-184.64 264.44 m 211.89 240.09 l S
-198.52 245.43 m
-211.89 240.09 l
-205.08 252.78 l
-S
-251.65 184.55 m 244.34 217.61 l S
-252.07 205.46 m
-244.34 217.61 l
-242.45 203.33 l
-S
-201.54 209.53 m 241.86 219.16 l S
-229.85 211.23 m
-241.86 219.16 l
-227.56 220.81 l
-S
-255.02 258.20 m 244.46 221.64 l S
-243.49 236.01 m
-244.46 221.64 l
-252.95 233.27 l
-S
-242.85 282.55 m 254.57 262.01 l S
-243.58 271.32 m
-254.57 262.01 l
-252.14 276.20 l
-S
-281.44 202.03 m 245.77 218.76 l S
-260.11 217.47 m
-245.77 218.76 l
-255.93 208.55 l
-S
-296.11 276.64 m 257.53 260.98 l S
-268.21 270.64 m
-257.53 260.98 l
-271.92 261.51 l
-S
-260.74 225.54 m 245.85 220.33 l S
-256.99 229.45 m
-245.85 220.33 l
-260.25 220.15 l
-S
-228.93 199.44 m 242.65 217.97 l S
-238.56 204.16 m
-242.65 217.97 l
-230.64 210.03 l
-S
-275.30 221.23 m 245.96 219.75 l S
-259.23 225.35 m
-245.96 219.75 l
-259.73 215.51 l
-S
-289.30 262.46 m 257.67 260.34 l S
-270.85 266.16 m
-257.67 260.34 l
-271.50 256.33 l
-S
-224.05 225.14 m 241.88 220.20 l S
-227.53 219.06 m
-241.88 220.20 l
-230.16 228.56 l
-S
-258.98 145.78 m 252.49 180.47 l S
-259.82 168.08 m
-252.49 180.47 l
-250.13 166.26 l
-S
-229.56 232.13 m 242.32 221.01 l S
-228.88 226.19 m
-242.32 221.01 l
-235.35 233.61 l
-S
-164.05 216.29 m 197.48 209.46 l S
-183.24 207.34 m
-197.48 209.46 l
-185.21 217.00 l
-S
-223.52 274.37 m 253.70 261.04 l S
-239.33 262.00 m
-253.70 261.04 l
-243.31 271.01 l
-S
-312.67 175.20 m 284.88 199.77 l S
-298.28 194.49 m
-284.88 199.77 l
-291.75 187.11 l
-S
-175.69 190.40 m 197.88 207.77 l S
-190.26 195.55 m
-197.88 207.77 l
-184.19 203.30 l
-S
-237.02 192.39 m 243.38 217.62 l S
-244.85 203.30 m
-243.38 217.62 l
-235.30 205.71 l
-S
-229.93 266.91 m 253.59 260.73 l S
-239.25 259.38 m
-253.59 260.73 l
-241.74 268.91 l
-S
-254.84 276.25 m 255.50 262.28 l S
-249.94 275.56 m
-255.50 262.28 l
-259.78 276.03 l
-S
-339.62 155.33 m 315.91 172.60 l S
-329.74 168.61 m
-315.91 172.60 l
-323.95 160.65 l
-S
-229.06 292.55 m 254.28 261.81 l S
-241.89 269.15 m
-254.28 261.81 l
-249.50 275.40 l
-S
-184.58 251.50 m 211.54 239.55 l S
-197.18 240.53 m
-211.54 239.55 l
-201.17 249.53 l
-S
-267.61 277.30 m 256.79 261.90 l S
-260.54 275.81 m
-256.79 261.90 l
-268.60 270.15 l
-S
-241.49 268.45 m 253.80 261.25 l S
-239.64 263.83 m
-253.80 261.25 l
-244.61 272.33 l
-S
-183.44 173.87 m 198.65 207.16 l S
-197.51 192.80 m
-198.65 207.16 l
-188.55 196.90 l
-S
-125.47 218.42 m 159.93 216.80 l S
-146.18 212.52 m
-159.93 216.80 l
-146.64 222.35 l
-S
-93.64 205.39 m 121.48 217.68 l S
-111.09 207.71 m
-121.48 217.68 l
-107.12 216.72 l
-S
-318.90 302.99 m 299.35 279.04 l S
-304.09 292.63 m
-299.35 279.04 l
-311.72 286.41 l
-S
-251.02 230.00 m 245.07 221.35 l S
-248.68 235.29 m
-245.07 221.35 l
-256.80 229.71 l
-S
-265.17 159.78 m 253.14 180.71 l S
-264.15 171.43 m
-253.14 180.71 l
-255.61 166.53 l
-S
-215.18 165.64 m 226.93 195.83 l S
-226.61 181.43 m
-226.93 195.83 l
-217.43 185.01 l
-S
-261.38 293.06 m 255.96 262.25 l S
-253.46 276.43 m
-255.96 262.25 l
-263.16 274.72 l
-S
-248.45 114.23 m 258.64 141.78 l S
-258.57 127.38 m
-258.64 141.78 l
-249.33 130.80 l
-S
-94.65 235.27 m 121.59 219.56 l S
-107.42 222.12 m
-121.59 219.56 l
-112.38 230.63 l
-S
-155.63 150.59 m 180.95 170.69 l S
-173.41 158.42 m
-180.95 170.69 l
-167.29 166.13 l
-S
-287.26 171.53 m 283.59 199.08 l S
-290.26 186.32 m
-283.59 199.08 l
-280.49 185.02 l
-S
-353.81 308.48 m 322.28 304.84 l S
-335.16 311.28 m
-322.28 304.84 l
-336.29 301.50 l
-S
-145.62 119.18 m 153.45 147.30 l S
-154.56 132.94 m
-153.45 147.30 l
-145.07 135.58 l
-S
-277.29 284.99 m 256.97 261.77 l S
-262.17 275.19 m
-256.97 261.77 l
-269.59 268.71 l
-S
-271.47 264.71 m 257.60 260.77 l S
-269.27 269.21 m
-257.60 260.77 l
-271.96 259.73 l
-S
-331.06 277.07 m 300.12 277.40 l S
-313.70 282.18 m
-300.12 277.40 l
-313.59 272.33 l
-S
-206.30 319.99 m 226.42 295.75 l S
-213.98 303.02 m
-226.42 295.75 l
-221.56 309.31 l
-S
-123.00 139.42 m 152.02 148.67 l S
-140.63 139.87 m
-152.02 148.67 l
-137.64 149.25 l
-S
-231.97 279.22 m 253.98 261.51 l S
-240.35 266.15 m
-253.98 261.51 l
-246.53 273.83 l
-S
-340.89 325.39 m 321.68 306.08 l S
-327.73 319.14 m
-321.68 306.08 l
-334.72 312.20 l
-S
-277.44 116.60 m 260.51 142.00 l S
-272.12 133.47 m
-260.51 142.00 l
-263.92 128.01 l
-S
-188.04 192.38 m 198.34 207.33 l S
-194.72 193.40 m
-198.34 207.33 l
-186.61 198.98 l
-S
-260.59 208.01 m 245.59 218.45 l S
-259.51 214.76 m
-245.59 218.45 l
-253.88 206.68 l
-S
-243.24 205.82 m 243.79 217.56 l S
-248.08 203.82 m
-243.79 217.56 l
-238.24 204.28 l
-S
-320.75 205.90 m 285.38 201.41 l S
-298.19 208.00 m
-285.38 201.41 l
-299.43 198.23 l
-S
-310.80 214.41 m 285.19 202.05 l S
-295.24 212.37 m
-285.19 202.05 l
-299.52 203.50 l
-S
-170.81 201.99 m 197.50 208.55 l S
-185.53 200.54 m
-197.50 208.55 l
-183.18 210.10 l
-S
-225.16 154.37 m 235.89 188.39 l S
-236.52 174.00 m
-235.89 188.39 l
-227.12 176.97 l
-S
-213.35 354.59 m 205.48 323.61 l S
-204.04 337.94 m
-205.48 323.61 l
-213.59 335.51 l
-S
-233.87 157.87 m 250.87 180.84 l S
-246.78 167.04 m
-250.87 180.84 l
-238.86 172.89 l
-S
-169.09 232.15 m 197.86 210.31 l S
-184.11 214.57 m
-197.86 210.31 l
-190.06 222.41 l
-S
-246.23 156.26 m 251.65 180.49 l S
-253.50 166.21 m
-251.65 180.49 l
-243.89 168.36 l
-S
-231.11 210.74 m 242.18 218.45 l S
-233.89 206.68 m
-242.18 218.45 l
-228.26 214.76 l
-S
-140.30 253.75 m 165.77 234.66 l S
-151.98 238.84 m
-165.77 234.66 l
-157.89 246.72 l
-S
-294.98 178.19 m 284.26 199.29 l S
-294.78 189.46 m
-284.26 199.29 l
-286.00 185.00 l
-S
-281.45 271.45 m 257.51 261.03 l S
-267.95 270.95 m
-257.51 261.03 l
-271.88 261.91 l
-S
-320.38 142.45 m 314.63 171.78 l S
-322.07 159.45 m
-314.63 171.78 l
-312.40 157.55 l
-S
-253.17 203.12 m 244.91 217.83 l S
-255.83 208.44 m
-244.91 217.83 l
-247.24 203.62 l
-S
-288.26 254.34 m 257.65 259.84 l S
-271.84 262.29 m
-257.65 259.84 l
-270.09 252.60 l
-S
-175.73 335.44 m 203.09 322.48 l S
-188.75 323.82 m
-203.09 322.48 l
-192.97 332.72 l
-S
-309.50 199.96 m 285.40 201.05 l S
-299.14 205.36 m
-285.40 201.05 l
-298.69 195.52 l
-S
-227.43 321.75 m 227.72 296.23 l S
-222.64 309.71 m
-227.72 296.23 l
-232.49 309.82 l
-S
-286.08 86.54 m 279.12 112.86 l S
-287.35 101.04 m
-279.12 112.86 l
-277.82 98.52 l
-S
-224.29 216.74 m 241.83 219.34 l S
-229.17 212.48 m
-241.83 219.34 l
-227.72 222.23 l
-S
-317.79 226.02 m 279.45 221.57 l S
-292.32 228.02 m
-279.45 221.57 l
-293.45 218.24 l
-S
-238.99 232.47 m 243.15 221.58 l S
-233.72 232.47 m
-243.15 221.58 l
-242.92 235.98 l
-S
-179.69 213.59 m 197.49 209.51 l S
-183.20 207.74 m
-197.49 209.51 l
-185.40 217.34 l
-S
-192.50 347.72 m 204.07 323.47 l S
-193.80 333.56 m
-204.07 323.47 l
-202.69 337.80 l
-S
-253.27 290.97 m 255.44 262.28 l S
-249.51 275.40 m
-255.44 262.28 l
-259.33 276.14 l
-S
-348.74 175.18 m 316.30 173.90 l S
-329.63 179.36 m
-316.30 173.90 l
-330.02 169.52 l
-S
-134.79 192.48 m 166.78 200.96 l S
-154.96 192.73 m
-166.78 200.96 l
-152.43 202.25 l
-S
-276.95 163.24 m 253.75 181.24 l S
-267.46 176.84 m
-253.75 181.24 l
-261.42 169.06 l
-S
-257.42 328.11 m 261.48 297.17 l S
-254.83 309.94 m
-261.48 297.17 l
-264.60 311.22 l
-S
-177.26 142.39 m 182.21 169.93 l S
-184.66 155.74 m
-182.21 169.93 l
-174.97 157.48 l
-S
-304.66 189.15 m 285.13 200.13 l S
-299.34 197.79 m
-285.13 200.13 l
-294.51 189.20 l
-S
-357.18 202.17 m 324.88 205.92 l S
-338.89 209.25 m
-324.88 205.92 l
-337.76 199.47 l
-S
-195.83 182.62 m 199.23 206.99 l S
-202.24 192.91 m
-199.23 206.99 l
-192.48 194.27 l
-S
-357.24 224.85 m 321.93 226.18 l S
-335.64 230.59 m
-321.93 226.18 l
-335.27 220.75 l
-S
-144.14 172.70 m 172.23 188.11 l S
-162.73 177.29 m
-172.23 188.11 l
-157.99 185.92 l
-S
-277.03 255.09 m 257.62 259.72 l S
-271.93 261.37 m
-257.62 259.72 l
-269.64 251.79 l
-S
-365.95 282.90 m 335.19 277.41 l S
-347.64 284.64 m
-335.19 277.41 l
-349.38 274.94 l
-S
-267.94 323.54 m 254.02 294.91 l S
-255.50 309.24 m
-254.02 294.91 l
-264.36 304.93 l
-S
-152.64 284.70 m 181.32 266.92 l S
-167.22 269.86 m
-181.32 266.92 l
-172.41 278.24 l
-S
-133.76 236.77 m 165.36 233.62 l S
-151.41 230.06 m
-165.36 233.62 l
-152.38 239.86 l
-S
-261.49 216.54 m 245.94 219.28 l S
-260.12 221.78 m
-245.94 219.28 l
-258.41 212.08 l
-S
-181.45 227.05 m 198.04 210.52 l S
-184.98 216.58 m
-198.04 210.52 l
-191.93 223.55 l
-S
-323.00 337.43 m 320.39 306.68 l S
-316.63 320.58 m
-320.39 306.68 l
-326.44 319.74 l
-S
-263.23 359.83 m 257.57 332.21 l S
-255.46 346.46 m
-257.57 332.21 l
-265.11 344.48 l
-S
-367.30 137.95 m 343.06 153.01 l S
-357.16 150.05 m
-343.06 153.01 l
-351.96 141.68 l
-S
-295.32 313.51 m 279.75 288.32 l S
-282.67 302.42 m
-279.75 288.32 l
-291.05 297.24 l
-S
-219.11 118.90 m 224.20 150.33 l S
-226.90 136.18 m
-224.20 150.33 l
-217.18 137.76 l
-S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-BT
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 241.61 217.64 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 211.16 236.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 180.81 263.83 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 249.82 180.52 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 197.24 207.05 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 253.32 258.20 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 239.54 282.36 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 281.04 199.15 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 295.76 275.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 260.42 224.23 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.41 195.76 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 275.10 219.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 289.09 260.60 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.77 223.69 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 257.08 141.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.71 231.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 159.73 214.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.33 273.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 311.94 171.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 171.77 187.12 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 234.23 188.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.63 265.43 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 252.46 276.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 339.02 152.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.46 292.15 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 180.40 250.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 266.52 277.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 237.41 267.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 180.29 169.98 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 121.11 216.52 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 89.45 202.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 317.93 302.60 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 249.91 229.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 263.92 155.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 212.14 161.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 259.46 293.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 245.45 110.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 90.57 234.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 151.72 147.30 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 285.25 167.47 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 353.60 306.72 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 142.78 115.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 276.37 284.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 271.19 263.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 330.86 275.04 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 202.69 319.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 118.73 136.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 228.07 278.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 340.08 324.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 276.31 112.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 184.58 188.66 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 260.01 204.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 240.87 201.74 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 320.53 204.16 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 310.39 213.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 166.50 199.49 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 222.25 150.38 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 211.58 354.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 230.35 154.20 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 165.15 231.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 243.49 152.23 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 227.12 207.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 136.35 253.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 293.64 174.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 281.08 270.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 318.50 138.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 251.91 199.30 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 288.03 251.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 171.57 334.33 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 309.30 197.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.12 321.84 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 284.34 82.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.95 214.44 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 317.57 224.26 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 235.97 232.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 175.38 212.06 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 189.32 347.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 250.83 291.04 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 348.54 173.27 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 130.50 189.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 276.31 159.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 254.87 328.17 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 174.61 138.35 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 304.19 186.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 356.97 199.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 193.26 178.56 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 357.03 222.77 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 140.03 169.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 276.77 252.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 365.71 281.27 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 266.56 323.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 148.59 283.79 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 129.41 234.98 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 261.26 214.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 177.69 226.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 320.89 337.50 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 261.37 359.87 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 366.79 134.86 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 294.13 313.28 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 216.50 114.84 Tm (l) Tj 0 Tr
-ET
-Q
-endstream
-endobj
-8 0 obj
-14284
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000014732 00000 n 
-0000014815 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000014711 00000 n 
-0000014952 00000 n 
-0000015209 00000 n 
-0000015306 00000 n 
-0000015408 00000 n 
-0000015513 00000 n 
-0000015622 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-15700
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/scalefree.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/scalefree.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/seqattr.pdf igraph-0.6.5/doc/book/seqattr.pdf
--- igraph-0.6.5~quantal1/doc/book/seqattr.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/seqattr.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,561 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó
-1 0 obj
-<<
-/CreationDate (D:20060811152612)
-/ModDate (D:20060811152612)
-/Title (R Graphics Output)
-/Producer (R 2.2.1)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-Q q 59.04 73.44 342.72 299.52 re W n
-0.745 0.745 0.745 RG
-1.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-337.17 86.60 m 340.07 108.87 l S
-334.84 84.81 m 312.57 87.77 l S
-340.65 112.99 m 344.10 135.97 l S
-338.28 111.23 m 315.74 114.48 l S
-344.72 140.08 m 348.20 163.42 l S
-342.35 138.33 m 319.70 141.68 l S
-348.80 167.54 m 352.14 191.04 l S
-346.45 165.77 m 323.73 169.04 l S
-352.70 195.16 m 355.79 218.75 l S
-350.37 193.38 m 327.60 196.47 l S
-356.31 222.87 m 359.15 246.44 l S
-353.99 221.07 m 331.20 223.95 l S
-359.63 250.57 m 362.28 274.01 l S
-357.33 248.75 m 334.55 251.46 l S
-362.74 278.14 m 365.34 301.25 l S
-360.44 276.31 m 337.71 278.92 l S
-365.84 305.37 m 368.79 327.64 l S
-363.51 303.56 m 340.90 306.22 l S
-367.00 329.97 m 344.72 332.85 l S
-310.76 90.11 m 313.44 112.71 l S
-308.44 88.27 m 285.35 90.87 l S
-313.98 116.83 m 317.35 139.93 l S
-311.62 115.02 m 288.45 117.73 l S
-317.95 144.04 m 321.37 167.28 l S
-315.58 142.24 m 292.26 145.11 l S
-321.97 171.40 m 325.25 194.69 l S
-319.61 169.60 m 296.19 172.58 l S
-325.81 198.81 m 328.87 222.15 l S
-323.47 197.02 m 299.99 200.07 l S
-329.39 226.28 m 332.23 249.64 l S
-327.08 224.48 m 303.60 227.59 l S
-332.72 253.77 m 335.41 277.09 l S
-330.42 251.98 m 307.01 255.13 l S
-335.89 281.22 m 338.59 304.40 l S
-333.59 279.44 m 310.30 282.69 l S
-1.000 0.000 0.000 RG
-339.13 308.52 m 342.37 331.06 l S
-336.77 306.77 m 313.68 310.13 l S
-0.745 0.745 0.745 RG
-340.60 333.43 m 317.62 336.88 l S
-283.52 93.17 m 286.14 115.91 l S
-281.21 91.33 m 257.77 93.99 l S
-286.67 120.04 m 289.91 143.31 l S
-284.31 118.21 m 260.99 120.90 l S
-290.49 147.42 m 293.83 170.79 l S
-288.13 145.61 m 264.70 148.42 l S
-294.41 174.91 m 297.64 198.28 l S
-292.06 173.10 m 268.50 176.04 l S
-298.19 202.41 m 301.27 225.80 l S
-295.86 200.61 m 272.25 203.65 l S
-301.79 229.92 m 304.70 253.35 l S
-299.48 228.13 m 275.88 231.28 l S
-305.20 257.48 m 307.99 280.91 l S
-302.89 255.70 m 279.38 258.93 l S
-308.50 285.04 m 311.37 308.36 l S
-1.000 0.000 0.000 RG
-306.18 283.27 m 282.82 286.60 l S
-0.745 0.745 0.745 RG
-311.92 312.48 m 315.26 335.13 l S
-309.56 310.73 m 286.33 314.14 l S
-313.51 337.49 m 290.18 340.98 l S
-255.95 96.29 m 258.67 119.07 l S
-253.64 94.47 m 230.07 97.33 l S
-259.20 123.20 m 262.35 146.60 l S
-256.85 121.39 m 233.49 124.24 l S
-262.91 150.73 m 266.15 174.24 l S
-260.57 148.92 m 237.14 151.83 l S
-266.72 178.36 m 269.91 201.86 l S
-264.37 176.56 m 240.85 179.54 l S
-270.46 205.98 m 273.55 229.49 l S
-1.000 0.000 0.000 RG
-268.13 204.19 m 244.52 207.26 l S
-0.745 0.745 0.745 RG
-274.08 233.62 m 277.06 257.15 l S
-271.76 231.83 m 248.16 234.95 l S
-277.58 261.28 m 280.50 284.83 l S
-275.26 259.49 m 251.75 262.67 l S
-281.02 288.96 m 284.01 312.38 l S
-278.70 287.18 m 255.32 290.41 l S
-284.57 316.50 m 287.83 339.23 l S
-282.21 314.73 m 258.91 318.01 l S
-286.07 341.58 m 262.56 344.90 l S
-228.27 99.65 m 231.17 122.43 l S
-225.95 97.85 m 202.36 100.95 l S
-231.70 126.55 m 234.81 150.02 l S
-229.37 124.76 m 206.02 127.83 l S
-235.35 154.15 m 238.51 177.74 l S
-233.02 152.36 m 209.63 155.43 l S
-239.06 181.86 m 242.18 205.46 l S
-236.72 180.07 m 213.22 183.17 l S
-242.73 209.59 m 245.83 233.16 l S
-240.39 207.80 m 216.82 210.89 l S
-246.36 237.29 m 249.42 260.89 l S
-244.03 235.49 m 220.46 238.59 l S
-249.95 265.02 m 252.99 288.63 l S
-247.63 263.23 m 224.12 266.31 l S
-253.53 292.75 m 256.58 316.23 l S
-251.19 290.96 m 227.80 294.03 l S
-257.13 320.36 m 260.22 343.13 l S
-254.79 318.57 m 231.45 321.63 l S
-258.43 345.46 m 234.85 348.55 l S
-200.58 103.28 m 203.67 126.04 l S
-198.24 101.51 m 174.72 104.84 l S
-204.22 130.17 m 207.29 153.64 l S
-201.89 128.39 m 178.60 131.67 l S
-207.83 157.77 m 210.89 181.38 l S
-205.50 155.99 m 182.13 159.23 l S
-211.43 185.50 m 214.49 209.10 l S
-209.10 183.72 m 185.58 186.90 l S
-215.03 213.23 m 218.13 236.80 l S
-212.69 211.44 m 189.09 214.56 l S
-218.67 240.93 m 221.78 264.52 l S
-216.33 239.13 m 192.73 242.20 l S
-222.33 268.65 m 225.47 292.24 l S
-219.99 266.85 m 196.46 269.83 l S
-226.01 296.36 m 229.12 319.84 l S
-1.000 0.000 0.000 RG
-223.68 294.56 m 200.26 297.47 l S
-0.745 0.745 0.745 RG
-229.65 323.97 m 232.53 346.76 l S
-227.33 322.15 m 203.96 325.01 l S
-230.72 349.07 m 207.16 351.93 l S
-172.96 107.19 m 176.24 129.90 l S
-170.61 105.44 m 147.29 108.94 l S
-176.80 134.02 m 179.80 157.45 l S
-1.000 0.000 0.000 RG
-174.48 132.26 m 151.25 135.69 l S
-0.745 0.745 0.745 RG
-180.32 161.58 m 183.26 185.12 l S
-178.01 159.81 m 154.64 163.15 l S
-183.78 189.25 m 186.77 212.77 l S
-181.46 187.47 m 157.94 190.72 l S
-187.30 216.90 m 190.39 240.41 l S
-1.000 0.000 0.000 RG
-184.97 215.11 m 161.38 218.27 l S
-190.94 244.53 m 194.12 268.03 l S
-0.745 0.745 0.745 RG
-188.60 242.74 m 164.98 245.79 l S
-194.68 272.15 m 197.91 295.66 l S
-192.33 270.35 m 168.78 273.30 l S
-198.47 299.79 m 201.62 323.20 l S
-196.13 297.97 m 172.69 300.78 l S
-202.14 327.32 m 204.85 350.11 l S
-199.83 325.50 m 176.51 328.19 l S
-203.03 352.41 m 179.59 355.06 l S
-145.54 111.30 m 148.89 133.94 l S
-143.17 109.56 m 120.19 113.01 l S
-149.45 138.06 m 152.32 161.38 l S
-147.13 136.30 m 124.04 139.66 l S
-1.000 0.000 0.000 RG
-152.83 165.51 m 155.63 188.94 l S
-0.745 0.745 0.745 RG
-150.52 163.73 m 127.24 166.98 l S
-156.14 193.07 m 159.06 216.48 l S
-153.82 191.28 m 130.41 194.45 l S
-159.58 220.61 m 162.65 244.00 l S
-157.25 218.82 m 133.78 221.92 l S
-163.20 248.12 m 166.43 271.49 l S
-1.000 0.000 0.000 RG
-160.86 246.33 m 137.37 249.39 l S
-0.745 0.745 0.745 RG
-167.01 275.61 m 170.33 298.97 l S
-164.65 273.82 m 141.22 276.81 l S
-170.91 303.08 m 174.16 326.36 l S
-168.56 301.28 m 145.24 304.16 l S
-174.68 330.49 m 177.29 353.22 l S
-172.38 328.67 m 149.20 331.38 l S
-175.46 355.52 m 152.36 358.13 l S
-118.43 115.38 m 121.69 137.90 l S
-1.000 0.000 0.000 RG
-116.07 113.59 m 93.80 116.47 l S
-0.745 0.745 0.745 RG
-122.23 142.02 m 124.94 165.20 l S
-119.92 140.20 m 97.30 142.88 l S
-125.42 169.34 m 128.11 192.66 l S
-123.11 167.51 m 100.38 170.12 l S
-128.60 196.79 m 131.46 220.13 l S
-1.000 0.000 0.000 RG
-126.28 194.97 m 103.49 197.68 l S
-131.98 224.26 m 135.04 247.60 l S
-0.745 0.745 0.745 RG
-129.65 222.46 m 106.85 225.35 l S
-135.60 251.72 m 138.87 275.01 l S
-133.25 249.94 m 110.47 253.04 l S
-139.46 279.13 m 142.87 302.36 l S
-137.10 277.37 m 114.38 280.63 l S
-143.47 306.47 m 146.83 329.57 l S
-141.12 304.72 m 118.47 308.07 l S
-147.38 333.69 m 150.05 356.30 l S
-145.07 331.92 m 122.54 335.17 l S
-148.23 358.64 m 125.96 361.59 l S
-1.000 0.000 0.000 RG
-92.01 118.80 m 94.96 141.07 l S
-95.47 145.20 m 98.08 168.29 l S
-0.745 0.745 0.745 RG
-98.54 172.42 m 101.19 195.86 l S
-101.68 199.99 m 104.53 223.55 l S
-105.06 227.67 m 108.14 251.25 l S
-108.70 255.37 m 112.03 278.87 l S
-112.63 282.99 m 116.11 306.31 l S
-116.72 310.43 m 120.17 333.41 l S
-120.75 337.53 m 123.63 359.80 l S
-0.494 0.753 0.933 rg
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-BT
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 334.62 82.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 338.05 108.94 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 342.13 136.03 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 346.23 163.48 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 350.15 191.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 353.77 218.81 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 357.12 246.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 360.23 274.08 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 363.29 301.31 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 366.79 327.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 308.23 86.04 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 311.40 112.78 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 315.36 139.99 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 319.39 167.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 323.25 194.75 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 326.86 222.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 330.20 249.70 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 333.37 277.15 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 336.55 304.47 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 340.38 331.12 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 281.00 89.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 284.10 115.98 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 287.92 143.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 291.84 170.85 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 295.64 198.34 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 299.26 225.86 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 302.67 253.41 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 305.96 280.97 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 309.34 308.43 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 313.28 335.19 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 253.42 92.22 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 256.64 119.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 260.35 146.67 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 264.16 174.30 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 267.91 201.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 271.54 229.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 275.04 257.21 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 278.48 284.90 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 281.99 312.44 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 285.85 339.29 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 225.73 95.58 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 229.15 122.49 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 232.80 150.09 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 236.50 177.80 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 240.17 205.53 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 243.82 233.22 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 247.41 260.95 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 250.97 288.69 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 254.57 316.30 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 258.22 343.19 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 198.01 99.22 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 201.67 126.10 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 205.28 153.71 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 208.88 181.44 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 212.47 209.16 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 216.11 236.86 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 219.77 264.59 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 223.46 292.30 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 227.11 319.90 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 230.50 346.82 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 170.38 103.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 174.26 129.96 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 177.79 157.51 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 181.23 185.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 184.75 212.84 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 188.38 240.47 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 192.11 268.09 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 195.92 295.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 199.61 323.26 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 202.81 350.18 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 142.95 107.25 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 146.91 134.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 150.30 161.45 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 153.60 189.00 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 157.03 216.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 160.64 244.06 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 164.43 271.55 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 168.35 299.03 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 172.16 326.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 175.24 353.29 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 115.85 111.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 119.70 137.96 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 122.90 165.27 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 126.06 192.72 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 129.43 220.20 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 133.03 247.66 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 136.88 275.07 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 140.89 302.42 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 144.85 329.63 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 148.01 356.36 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 89.45 114.73 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 92.96 141.13 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 96.03 168.35 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 99.15 195.92 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 102.50 223.61 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 106.13 251.32 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 110.04 278.93 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 114.13 306.37 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 118.20 333.46 Tm (l) Tj 0 Tr
-/F1 1 Tf 2 Tr 5.76 0 0 5.76 121.62 359.87 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.545 rg
-/F2 1 Tf 12.00 0.00 -0.00 12.00 337.82 84.68 Tm (0) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 341.26 110.97 Tm (1) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 345.33 138.06 Tm (2) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 349.43 165.63 Tm (3) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 353.35 193.14 Tm (4) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 356.97 221.05 Tm (5) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 360.32 248.66 Tm (6) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 363.43 276.20 Tm (7) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 366.49 303.46 Tm (8) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 369.99 329.85 Tm (9) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 310.58 90.68 Tm (10) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 313.75 117.30 Tm (11) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 317.71 144.51 Tm (12) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 321.74 171.98 Tm (13) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 325.61 199.27 Tm (14) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 329.21 226.85 Tm (15) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 332.55 254.34 Tm (16) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 335.72 281.68 Tm (17) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 338.90 309.10 Tm (18) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 342.73 335.76 Tm (19) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 283.35 93.74 Tm (20) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 286.45 120.50 Tm (21) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 290.27 147.89 Tm (22) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 294.19 175.48 Tm (23) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 297.99 202.87 Tm (24) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 301.61 230.50 Tm (25) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 305.02 258.05 Tm (26) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 308.31 285.50 Tm (27) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 311.69 313.06 Tm (28) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 315.63 339.82 Tm (29) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 255.78 96.86 Tm (30) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 258.99 123.77 Tm (31) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 262.70 151.30 Tm (32) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 266.51 178.94 Tm (33) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 270.26 206.55 Tm (34) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 273.89 234.19 Tm (35) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 277.39 261.85 Tm (36) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 280.83 289.53 Tm (37) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 284.34 317.08 Tm (38) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 288.20 343.92 Tm (39) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 228.08 100.22 Tm (40) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 231.50 127.01 Tm (41) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 235.15 154.61 Tm (42) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 238.85 182.44 Tm (43) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 242.53 210.05 Tm (44) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 246.17 237.86 Tm (45) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 249.76 265.59 Tm (46) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 253.33 293.21 Tm (47) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 256.92 320.93 Tm (48) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 260.57 347.83 Tm (49) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 200.37 103.86 Tm (50) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 204.02 130.74 Tm (51) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 207.63 158.34 Tm (52) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 211.23 186.08 Tm (53) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 214.82 213.80 Tm (54) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 218.47 241.59 Tm (55) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 222.12 269.22 Tm (56) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 225.81 297.03 Tm (57) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 229.46 324.54 Tm (58) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 232.85 351.46 Tm (59) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 172.73 107.77 Tm (60) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 176.61 134.60 Tm (61) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 180.14 162.15 Tm (62) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 183.58 189.82 Tm (63) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 187.10 217.47 Tm (64) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 190.73 245.11 Tm (65) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 194.46 272.73 Tm (66) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 198.27 300.36 Tm (67) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 201.96 327.90 Tm (68) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 205.16 354.81 Tm (69) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 145.30 111.88 Tm (70) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 149.26 138.52 Tm (71) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 152.65 165.97 Tm (72) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 155.95 193.64 Tm (73) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 159.38 221.07 Tm (74) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 162.99 248.79 Tm (75) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 166.78 276.19 Tm (76) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 170.70 303.64 Tm (77) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 174.51 331.06 Tm (78) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 177.59 357.93 Tm (79) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 118.20 115.96 Tm (80) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 122.05 142.59 Tm (81) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 125.25 169.91 Tm (82) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 128.42 197.36 Tm (83) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 131.78 224.83 Tm (84) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 135.38 252.30 Tm (85) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 139.23 279.71 Tm (86) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 143.24 307.05 Tm (87) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 147.20 334.26 Tm (88) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 150.36 361.00 Tm (89) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 91.80 119.37 Tm (90) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 95.31 145.77 Tm (91) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 98.38 172.99 Tm (92) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 101.50 200.56 Tm (93) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 104.85 228.25 Tm (94) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 108.48 255.95 Tm (95) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 112.39 283.57 Tm (96) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 116.48 311.01 Tm (97) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 120.55 338.10 Tm (98) Tj
-/F2 1 Tf 12.00 0.00 -0.00 12.00 123.97 364.50 Tm (99) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-18123
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 432 432]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R /F3 11 0 R /F4 12 0 R /F5 13 0 R /F6 14 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->>
-endobj
-11 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F3
-/BaseFont /Helvetica-Bold
-/Encoding 9 0 R
->>
-endobj
-12 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F4
-/BaseFont /Helvetica-Oblique
-/Encoding 9 0 R
->>
-endobj
-13 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F5
-/BaseFont /Helvetica-BoldOblique
-/Encoding 9 0 R
->>
-endobj
-14 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F6
-/BaseFont /Symbol
->>
-endobj
-xref
-0 15
-0000000000 65535 f 
-0000000020 00000 n 
-0000000162 00000 n 
-0000018571 00000 n 
-0000018654 00000 n 
-0000000211 00000 n 
-0000000294 00000 n 
-0000000374 00000 n 
-0000018550 00000 n 
-0000018791 00000 n 
-0000019048 00000 n 
-0000019145 00000 n 
-0000019247 00000 n 
-0000019352 00000 n 
-0000019461 00000 n 
-trailer
-<<
-/Size 15
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-19539
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/seqattr.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/seqattr.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/short.xml igraph-0.6.5/doc/book/short.xml
--- igraph-0.6.5~quantal1/doc/book/short.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/short.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-short">
-<title>A short &igraph; Tour</title>
-
-<para>yet to be written</para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/stars.fig igraph-0.6.5/doc/book/stars.fig
--- igraph-0.6.5~quantal1/doc/book/stars.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/stars.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,200 +0,0 @@
-#FIG 3.2
-Landscape
-Flush Left
-Inches
-Letter
-100.0
-Single
--2
-1200 2
-# End of XFig header
-0 32 #a9a9a9
-0 33 #7ec0ee
-0 34 #00008b
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-1618 4594 2378 4935
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2139 4917
-  2378 4935
-  2206 4768
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-2784 4034 2579 4838
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2555 4599
-  2579 4838
-  2714 4640
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-2640 6002 2554 5178
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2659 5393
-  2554 5178
-  2496 5411
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-3346 4421 2676 4904
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2811 4706
-  2676 4904
-  2907 4839
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-1974 5834 2439 5149
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2380 5381
-  2439 5149
-  2244 5289
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-1570 5284 2370 5053
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2176 5195
-  2370 5053
-  2130 5037
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-3259 5704 2660 5126
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2880 5224
-  2660 5126
-  2766 5342
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-3540 5081 2709 5018
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2940 4953
-  2709 5018
-  2927 5117
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-2099 4107 2460 4850
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  2288 4683
-  2460 4850
-  2436 4611
-1 3 0 1 0 33 100 0 20 4.00 1 0   2536 5006 173 173 2536 5006 2709 5006 
-1 3 0 1 0 33 100 0 20 4.00 1 0   1460 4523 173 173 1460 4523 1633 4523 
-1 3 0 1 0 33 100 0 20 4.00 1 0   2827 3866 173 173 2827 3866 3000 3866 
-1 3 0 1 0 33 100 0 20 4.00 1 0   2658 6175 173 173 2658 6175 2831 6175 
-1 3 0 1 0 33 100 0 20 4.00 1 0   3487 4320 173 173 3487 4320 3660 4320 
-1 3 0 1 0 33 100 0 20 4.00 1 0   1876 5977 173 173 1876 5977 2049 5977 
-1 3 0 1 0 33 100 0 20 4.00 1 0   1404 5332 173 173 1404 5332 1577 5332 
-1 3 0 1 0 33 100 0 20 4.00 1 0   3383 5824 173 173 3383 5824 3556 5824 
-1 3 0 1 0 33 100 0 20 4.00 1 0   3712 5094 173 173 3712 5094 3885 5094 
-1 3 0 1 0 33 100 0 20 4.00 1 0   2024 3951 173 173 2024 3951 2197 3951 
-4 1 34 100 0 16 8 0.0000 4 96 74 2536 5051 0\001
-4 1 34 100 0 16 8 0.0000 4 96 74 1460 4570 1\001
-4 1 34 100 0 16 8 0.0000 4 96 74 2827 3913 2\001
-4 1 34 100 0 16 8 0.0000 4 96 74 2658 6220 3\001
-4 1 34 100 0 16 8 0.0000 4 96 74 3487 4367 4\001
-4 1 34 100 0 16 8 0.0000 4 96 74 1876 6022 5\001
-4 1 34 100 0 16 8 0.0000 4 96 74 1404 5378 6\001
-4 1 34 100 0 16 8 0.0000 4 96 74 3383 5870 7\001
-4 1 34 100 0 16 8 0.0000 4 96 74 3712 5139 8\001
-4 1 34 100 0 16 8 0.0000 4 96 74 2024 3997 9\001
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6578 4935 5818 4594
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  6057 4611
-  5818 4594
-  5990 4761
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6779 4838 6984 4034
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  7008 4272
-  6984 4034
-  6849 4232
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6754 5178 6840 6002
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  6735 5787
-  6840 6002
-  6899 5769
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6876 4904 7546 4421
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  7412 4620
-  7546 4421
-  7315 4486
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6639 5149 6174 5834
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  6233 5601
-  6174 5834
-  6368 5693
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6570 5053 5770 5284
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  5964 5143
-  5770 5284
-  6009 5300
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6861 5126 7459 5704
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  7240 5606
-  7459 5704
-  7354 5488
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6909 5018 7740 5081
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  7509 5146
-  7740 5081
-  7521 4982
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-6660 4850 6299 4107
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 3
-  6472 4274
-  6299 4107
-  6324 4346
-1 3 0 1 0 33 100 0 20 4.00 1 0   6736 5006 173 173 6736 5006 6909 5006 
-1 3 0 1 0 33 100 0 20 4.00 1 0   5660 4523 173 173 5660 4523 5833 4523 
-1 3 0 1 0 33 100 0 20 4.00 1 0   7027 3866 173 173 7027 3866 7200 3866 
-1 3 0 1 0 33 100 0 20 4.00 1 0   6858 6175 173 173 6858 6175 7031 6175 
-1 3 0 1 0 33 100 0 20 4.00 1 0   7687 4320 173 173 7687 4320 7860 4320 
-1 3 0 1 0 33 100 0 20 4.00 1 0   6077 5977 173 173 6077 5977 6250 5977 
-1 3 0 1 0 33 100 0 20 4.00 1 0   5604 5332 173 173 5604 5332 5777 5332 
-1 3 0 1 0 33 100 0 20 4.00 1 0   7583 5824 173 173 7583 5824 7756 5824 
-1 3 0 1 0 33 100 0 20 4.00 1 0   7912 5094 173 173 7912 5094 8085 5094 
-1 3 0 1 0 33 100 0 20 4.00 1 0   6224 3951 173 173 6224 3951 6397 3951 
-4 1 34 100 0 16 8 0.0000 4 96 74 6736 5051 0\001
-4 1 34 100 0 16 8 0.0000 4 96 74 5660 4570 1\001
-4 1 34 100 0 16 8 0.0000 4 96 74 7027 3913 2\001
-4 1 34 100 0 16 8 0.0000 4 96 74 6858 6220 3\001
-4 1 34 100 0 16 8 0.0000 4 96 74 7687 4367 4\001
-4 1 34 100 0 16 8 0.0000 4 96 74 6077 6022 5\001
-4 1 34 100 0 16 8 0.0000 4 96 74 5604 5378 6\001
-4 1 34 100 0 16 8 0.0000 4 96 74 7583 5870 7\001
-4 1 34 100 0 16 8 0.0000 4 96 74 7912 5139 8\001
-4 1 34 100 0 16 8 0.0000 4 96 74 6224 3997 9\001
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10778 4935 10018 4594
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10979 4838 11184 4034
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10954 5178 11041 6002
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-11077 4904 11746 4421
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10839 5149 10374 5834
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10770 5053 9970 5284
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-11061 5126 11659 5704
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-11109 5018 11940 5081
-2 1 0 1 32 7 100 0 -1 4.00 0 0 -1 0 0 2
-10860 4850 10499 4107
-1 3 0 1 0 33 100 0 20 4.00 1 0   10936 5006 173 173 10936 5006 11109 5006 
-1 3 0 1 0 33 100 0 20 4.00 1 0   9860 4523 173 173 9860 4523 10033 4523 
-1 3 0 1 0 33 100 0 20 4.00 1 0   11227 3866 173 173 11227 3866 11400 3866 
-1 3 0 1 0 33 100 0 20 4.00 1 0   11059 6175 173 173 11059 6175 11232 6175 
-1 3 0 1 0 33 100 0 20 4.00 1 0   11887 4320 173 173 11887 4320 12060 4320 
-1 3 0 1 0 33 100 0 20 4.00 1 0   10277 5977 173 173 10277 5977 10450 5977 
-1 3 0 1 0 33 100 0 20 4.00 1 0   9804 5332 173 173 9804 5332 9977 5332 
-1 3 0 1 0 33 100 0 20 4.00 1 0   11783 5824 173 173 11783 5824 11956 5824 
-1 3 0 1 0 33 100 0 20 4.00 1 0   12112 5094 173 173 12112 5094 12285 5094 
-1 3 0 1 0 33 100 0 20 4.00 1 0   10424 3951 173 173 10424 3951 10597 3951 
-4 1 34 100 0 16 8 0.0000 4 96 74 10936 5051 0\001
-4 1 34 100 0 16 8 0.0000 4 96 74 9860 4570 1\001
-4 1 34 100 0 16 8 0.0000 4 96 74 11227 3913 2\001
-4 1 34 100 0 16 8 0.0000 4 96 74 11059 6220 3\001
-4 1 34 100 0 16 8 0.0000 4 96 74 11887 4367 4\001
-4 1 34 100 0 16 8 0.0000 4 96 74 10277 6022 5\001
-4 1 34 100 0 16 8 0.0000 4 96 74 9804 5378 6\001
-4 1 34 100 0 16 8 0.0000 4 96 74 11783 5870 7\001
-4 1 34 100 0 16 8 0.0000 4 96 74 12112 5139 8\001
-4 1 34 100 0 16 8 0.0000 4 96 74 10424 3997 9\001
-# end of XFig file
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/stars.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/stars.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/stars.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/stars.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/structures.xml igraph-0.6.5/doc/book/structures.xml
--- igraph-0.6.5~quantal1/doc/book/structures.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/structures.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,316 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "<application>igraph</application>">
-]>
-
-<chapter id="igraphbook-structures">
-<title>Regular Graphs</title>
-
-<section><title>Empty graphs</title>
-
-<para>&igraph; privides some ways for generating regular graph
-strucures: lattices, trees, etc. Let us begin with the simplest case:
-the empty graph:
-<informalexample><programlisting>
-<prompt>&gt; </prompt>g &lt;- graph.empty()
-</programlisting></informalexample>
-This command creates an empty graph and stores it in a variable named
-<varname>g</varname>. If you type in the name of a variable
-containing a graph object, R prints some information about the graph,
-and its edge list:
-<informalexample><programlisting>
-<prompt>&gt; </prompt>g
-</programlisting>
-<screen>
-Vertices: 0 
-Edges: 0 
-Directed: TRUE
-</screen>
-</informalexample>
-</para>
-
-<para>
-This small example illustrates a number of things: empty graphs can be
-created by the <function>graph.empty()</function> command; by default this
-command creates a graph with no vertices and no edges (well this is
-what the word empty means); by default this command creates directed
-graphs. <function>graph.empty()</function> has an optional parameter:
-<parameter>n</parameter>, the number of vertices in the graph. (A
-graph with non-zero number of vertices and no edges is still called
-and empty graph.)
-<informalexample><programlisting>
-<prompt>&gt; </prompt>g &lt;- graph.empty(n=10)
-<prompt>&gt; </prompt>g
-</programlisting>
-<screen>
-Vertices: 10
-Edges: 0 
-Directed: TRUE
-</screen>
-</informalexample>
-This is a graph with ten vertices and zero edges.
-</para>
-
-</section>
-<section><title>Full graphs</title> 
-
-<para>
-A full graph is completely the opposite of empty graphs: it
-contains (one copy of) all possible edges. A full graph can be created
-by the <function>graph.full()</function> command. By default it creates
-undirected graphs with no loop (ie. self) edges:
-<informalexample><programlisting>
-<prompt>&gt; </prompt>f &lt;- graph.full(3)
-<prompt>&gt; </prompt>f
-</programlisting>
-<screen>
-Vertices: 3 
-Edges: 3 
-Directed: FALSE 
-
-Edges:
-[0] 0 -- 1
-[1] 0 -- 2
-[2] 1 -- 2
-</screen>
-</informalexample>
-The command has a <parameter>directed</parameter> parameter which can
-be set to <constant>TRUE</constant> to generated directed graphs:
-<informalexample><programlisting>
-<prompt>&gt; </prompt>f &lt;- graph.full(3, directed=TRUE)
-<prompt>&gt; </prompt>f
-</programlisting>
-<screen>
-Vertices: 3 
-Edges: 6 
-Directed: TRUE 
-
-Edges:
-[0] 0 -> 1
-[1] 0 -> 2
-[2] 1 -> 0
-[3] 1 -> 2
-[4] 2 -> 0
-[5] 2 -> 1
-</screen>
-</informalexample>
-Note that &igraph; prints undirected edges with <quote>--</quote> and
-directed ones with <quote>-&gt;</quote>, stressing that the order of
-the vertex ids in the edges are important only in directed graphs. 
-</para>
-
-<para>
-Here is an example of an undirected full graph:
-<mediaobject>
-<imageobject><imagedata fileref="full.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="full.png" format="PNG"
-/></imageobject>
-</mediaobject>
-</para>
-
-<para>
-Some &igraph; functions provide information about the structure of a
-graph, <function>is.directed()</function> returns a logical constant,
-<constant>TRUE</constant> is the argument graph is directed and
-<constant>FALSE</constant>
-otherwise. <function>are.connected()</function> gives
-<constant>TRUE</constant> if the given vertices are connected with an
-edge and <constant>FALSE</constant> otherwise. It works slightly
-differently for directed and undirected graphs; for undirected graphs
-the order of the vertex id parameters doesn't matter; for directed
-graph it searches for an edge from the first vertex to the second:
-<informalexample>
-<programlisting>
-<prompt>> </prompt>is.directed(graph.full(10))
-</programlisting>
-<screen>
-[1] FALSE
-</screen>
-<programlisting>
-<prompt>> </prompt>is.directed(graph.full(10, directed=TRUE))
-</programlisting>
-<screen>
-[1] TRUE
-</screen>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.full(10)
-<prompt>> </prompt>are.connected(g, 1,4)
-</programlisting>
-<screen>
-[1] TRUE
-</screen>
-<programlisting>
-<prompt>> </prompt>g &lt;- graph.empty(n=10)
-<prompt>> </prompt>are.connected(g, 1,4)
-</programlisting>
-<screen>
-[1] FALSE
-</screen>
-</informalexample>
-</para>
-
-<para>
-If a graph is very big, then it is probably not a good idea to list
-its edges to the screen. In this case the standard
-<function>summary()</function> function can be used to print some useful
-information about the graph:
-<informalexample><programlisting>
-<prompt>&gt; </prompt>big &lt;- graph.full(1000)
-<prompt>&gt; </prompt>summary(big)
-</programlisting>
-<screen>
-Vertices: 1000 
-Edges: 499500
-Directed: FALSE 
-</screen>
-</informalexample>
-</para>
-
-<para>
-<function>graph.full()</function> also has a <parameter>loops</parameter>
-parameter to include loop edges in graph.
-</para>
-
-<para>
-<function>graph.full()</function> never creates graphs with multiple
-edges.
-</para>
-
-</section>
-<section><title>Stars and Rings</title>
-
-<para>In a star graph, a single distinguished vertex is connected to
-every other vertices and there are no other edges present. In &igraph;
-three types of star graphs can be created, the
-<parameter>mode</parameter> argument decides which one to generate:
-<parameter>in</parameter> creates a directed graph in which every edge
-points to the distinguished vertex, <parameter>out</parameter> creates
-a directed graph with opposite directedness and
-<parameter>undirected</parameter> creates an undirected star.
-<mediaobject>
-<imageobject><imagedata fileref="stars.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="stars.png" format="PNG" width="960" /></imageobject>
-</mediaobject>
-</para>
-
-<para>
-The <function>graph_ring()</function> command can create various ring
-graphs (ie. one-dimensional lattices). The
-<parameter>directed</parameter>, <parameter>mutual</parameter> and
-<parameter>circular</parameter> parameters give the exact shape of the
-graph, see the figure for details.
-</para>
-
-</section>
-<section><title>Lattices</title>
-
-<para>
-An n-dimensional lattice (sometimes also called grid) is a graph in
-which the vertices are placed at the integer coordinate points of the
-n-dimensional Euclidean space and each vertex connects to vertices
-which are exactly one unit away from it. Ie. if the lattice is two
-dimensional and the length of the lattice is 5 along the first and 3
-along the second dimension, then it has 15 vertices and they're placed
-at coordinates (1,1), (1,2), (1,3), (2,1), &hellip; (5,3) and two
-vertices are connected if the difference of one of their coordinates is
-one or minus one and all their other coordinates are exactly the same.
-<mediaobject>
-<imageobject><imagedata fileref="lattice.pdf" format="PDF" /></imageobject>
-<imageobject><imagedata fileref="lattice.png" format="PNG" /></imageobject>
-</mediaobject>
-</para>
-
-<para>
-In &igraph; lattices are generated with
-<function>graph.lattice()</function>. It has two different forms. In the
-first form, the parameter <parameter>length</parameter>, the length of the
-lattice along every dimension  and parameter
-<parameter>dim</parameter>, the dimensionality of the lattice are
-given. In the second form the parameter
-<parameter>dimvector</parameter> is given, this contains the length of
-the lattice along each dimensions separately. The default is the
-second form. The following two are equivalent, they create the same
-graphs: 
-<informalexample><programlisting>
-<prompt>&gt; </prompt>l1 &lt;- graph.lattice(length=5, dim=2)
-<prompt>&gt; </prompt>l2 &lt;- graph.lattice( c(5,5) )
-</programlisting></informalexample>
-The second form is obviously more general.
-</para>
-
-<para>
-<function>graph.lattice()</function> generates non-circular lattices by
-defaults. In a circular lattice the difference of the coordinates of
-the vertices is calculated modulo the size of the lattice along the
-given dimension so for example in the circular 5x3 two dimensional
-lattice vertices (1,1) and (1,3) are also connected just like (1,1)
-and (5,1). The <parameter>circular</parameter> parameter of
-<function>graph.lattice()</function> can be set to
-<constant>TRUE</constant> to generate circular graphs.
-</para>
-
-<para><function>graph.lattice()</function> generates undirected graphs
-by default, but the <parameter>directed</parameter> parameter can be
-set to <constant>TRUE</constant> to generate directed lattices. The
-direction of the edges is such that the edge points from the vertex
-with the smaller vertex id to the vertex with the larger vertex id. 
-If the <parameter>mutual</parameter> parameter is also set to
-<constant>TRUE</constant> then two directed edges are created in both
-direction. 
-</para>
-</section>
-
-<section><title>Trees</title>
-
-<para>
-&igraph; has some limited capabilities for creating trees with the
-<function>graph.tree()</function> function. The only kind of trees this
-function can generate are almost complete regular trees. In a complete
-regular tree every vertex has the same number of children except for
-the leafs which have no children at all. An almost complete regular
-tree is made from a complete regular tree by removing some of the
-leafs from it. 
-</para>
-
-<para>The directedness of the edges of tree is determined by the
-<parameter>mode</parameter> parameter. See the figure for the possible
-values of this parameter.
-<mediaobject>
-<imageobject><imagedata fileref="trees.png" format="PNG" /></imageobject>
-</mediaobject>
-</para>
-
-</section>
-
-<section><title>The Graph Atlas</title>
-
-<para>
-&igraph; can generate graphs from the book <citetitle>An Atlas of
-Graphs</citetitle> by Roland C. Read and Robin J. Wilson. The atlas
-contains all undirected graphs with up to seven vertices, numbered
-from 0 up to 1252. The graphs are listed:
-<orderedlist>
-<listitem><para>
-in increasing order of number of nodes;
-</para></listitem>
-<listitem><para>
-for a fixed number of nodes, in increasing order of the number of
-edges;
-</para></listitem>
-<listitem><para>for fixed numbers of nodes and edges, in increasing
-order of the degree sequence, for example 111223 &lt; 112222;
-</para></listitem>
-<listitem><para>
-for fixed degree sequence, in increasing number of automorphisms.
-</para></listitem>
-</orderedlist>
-Here is a random selection from the graph atlas:
-<mediaobject>
-<imageobject><imagedata fileref="atlas.png" format="PNG" /></imageobject>
-</mediaobject>
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/book/traits.csv igraph-0.6.5/doc/book/traits.csv
--- igraph-0.6.5~quantal1/doc/book/traits.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/traits.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-Alice Anderson,48,F
-Bob Bradford,33,M
-Cecil Connor,45,F
-David Daugher,34,M
-Esmeralda Escobar,21,F
-Frank Finley,36,M
-Gabi Garbo,44,F
-Helen Hunt,40,F
-Iris Irving,25,F
-James Jones,47,M
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/book/trees.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/book/trees.png differ
diff -Nru igraph-0.6.5~quantal1/doc/book/version-greater-or-equal.xsl igraph-0.6.5/doc/book/version-greater-or-equal.xsl
--- igraph-0.6.5~quantal1/doc/book/version-greater-or-equal.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/book/version-greater-or-equal.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version="1.0"
-                xmlns="http://www.w3.org/TR/xhtml1/transitional"
-                exclude-result-prefixes="#default">
- <xsl:template name="version-greater-or-equal">
-  <xsl:param name="ver1"></xsl:param>
-  <xsl:param name="ver2"></xsl:param>
-  <xsl:variable name="vp1">
-    <xsl:choose>
-      <xsl:when test="contains($ver1, '.')">
-        <xsl:value-of select="substring-before($ver1, '.')"/>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:value-of select="$ver1"/>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:variable>
-  <xsl:variable name="vp2">
-    <xsl:choose>
-      <xsl:when test="contains($ver2, '.')">
-        <xsl:value-of select="substring-before($ver2, '.')"/>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:value-of select="$ver2"/>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:variable>
-  <xsl:choose>
-    <xsl:when test="$vp1 &gt; $vp2">
-      1
-    </xsl:when>
-    <xsl:when test="$vp1 &lt; $vp2">
-      0
-    </xsl:when>
-    <xsl:when test="$vp1 = $vp2">
-      <xsl:choose>
-        <xsl:when test="contains($ver1, '.') and contains($ver2, '.')">
-          <xsl:call-template name="version-greater-or-equal">
-            <xsl:with-param name="ver1" select="substring-after($ver1, '.')"/>
-            <xsl:with-param name="ver2" select="substring-after($ver2, '.')"/>
-          </xsl:call-template>
-	</xsl:when>
-        <xsl:when test="contains($ver2, '.')">
-	   0
-	</xsl:when>
-	<xsl:otherwise>
-	   1
-	</xsl:otherwise>
-      </xsl:choose>
-    </xsl:when>
-  </xsl:choose>                                  
-</xsl:template>                                                                 
-</xsl:stylesheet>
diff -Nru igraph-0.6.5~quantal1/doc/c-docbook.re igraph-0.6.5/doc/c-docbook.re
--- igraph-0.6.5~quantal1/doc/c-docbook.re	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/c-docbook.re	1970-01-01 00:00:00.000000000 +0000
@@ -1,654 +0,0 @@
-REPLACE ----- remove the " * " prefix first -----------------*- mode:python -*-
-^[ ]\*[ ]
-WITH --------------------------------------------------------------------------
-REPLACE ----- remove the " *" lines -------------------------------------------
-^[ ]\*\s*\n
-WITH --------------------------------------------------------------------------
-\n
-REPLACE ----- for the template functions --------------------------------------
-
-FUNCTION\(
-(?P<base>[^,\)]*),
-(?P<suffix>[^\)]*)
-\)
-
-WITH
-
-\g<base>_\g<suffix>
-
-REPLACE ----- template type ---------------------------------------------------
-
-TYPE\(
-(?P<type>[^\)]*)
-\)
-
-WITH
-
-\g<type>_t
-
-REPLACE ----- template base type, we cowardly assume real number --------------
-
-BASE
-
-WITH 
-
-igraph_real_t
-
-REPLACE ----- function object, extract its signature --------------------------
-
-(?P<before>\A.*?)                # head of the comment
-\\function\s+                    # \function keyword
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>\w+)) # the keyword, remove igraph_ prefix
-[\s]*(?P<brief>[^\n]*?)\n        # brief description
-(?P<after>.*?)\*\/               # tail of the comment
-\s*
-(?P<def>.*?\))                   # function head
-(?=(\s*;)|(\s*\{))               # prototype ends with ; function head with {
-.*\Z                             # and the remainder
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>">
-<title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para>
-<informalexample><programlisting>
-\g<def>;
-</programlisting></informalexample>
-</para>
-<para>
-\g<before>
-\g<after>
-</para>
-</section>
-
-REPLACE ----- <paramdef> for functions (not used currently) -------------------
-
-<paramdef>(?P<params>[^<]*)</paramdef>\n
-
-RUN ---------------------------------------------------------------------------
-
-if matched != None:
-    dr_params=string.split(matched.group("params"), ',')
-    dr_out=""
-    for dr_i in dr_params:
-        dr_i=string.strip(dr_i)
-        if dr_i=="...":
-            dr_out=dr_out+"<varargs/>"
-        else:
-            dr_words=re.match(r"([\w\*\&\s]+)(\b\w+)$", dr_i).groups()
-            dr_out=dr_out+"<paramdef>"+dr_words[0]+"<parameter>"+dr_words[1]+ \
-                    "</parameter></paramdef>\n"
-    actch=actch[0:matched.start()]+dr_out+actch[matched.end():]
-
-REPLACE ----- function parameter descriptions, head ---------------------------
-
-(?P<before>\A.*?)               # head of the comment
-\\param\b                       # first \param commant
-
-WITH --------------------------------------------------------------------------
-
-\g<before></para>
-<formalpara><title>Arguments:</title><para>
-<variablelist role="params">
-\param
-
-REPLACE ----- function parameter descriptions, tail ---------------------------
-
-# the end of the params is either an empty line after the last \param
-# command or a \return or \sa statement (others might be added later)
-# or the end of the comment
-
-\\param\b                         # the last \param command
-(?P<paramtext>.*?)                # the text of the \param command
-(?P<endmark>                      # this marks the end of the \param text
- (\\return\b)|(\\sa\b)|           # it is either a \return or \sa or
- (\n\s*?\n)|                      # (at least) one empty line or
- (\*\/))                          # the end of the comment
-(?P<after>.*?\Z)                  # remaining part
-
-WITH
-
-\param\g<paramtext></variablelist></para></formalpara><para>
-\g<endmark>\g<after>
-
-REPLACE ----- function parameter descriptions ---------------------------------
-
-\\param\b\s*                      # \param command
-(?P<paramname>(\w+)|(...))\s+     # name of the parameter
-(?P<paramtext>.*?)                # text of the \param command
-(?=(\\param)|(</variablelist>)|
- (\n\s*\n))
-
-
-WITH --------------------------------------------------------------------------
-
-  <varlistentry><term><parameter>\g<paramname></parameter>:</term>
-  <listitem><para>
-  \g<paramtext></para></listitem></varlistentry>  
-
-REPLACE ----- \return command -------------------------------------------------
-
-# a return statement ends with an empty line or the end of the comment
-\\return\b\s*                     # \return command
-(?P<text>.*?)                     # the text
-(?=(\n\s*?\n)|                    # empty line or 
- (\*\/)|                          # the end of the comment or
- (\\sa\b))                        # \sa command
-
-WITH ----------------------------------------------------------------------TODO
-
-</para><formalpara><title>Returns:</title><para><variablelist>
-  <varlistentry><term><parameter></parameter></term>
-  <listitem><para>
-  \g<text>
-  </para></listitem></varlistentry>
-</variablelist></para></formalpara><para>
-
-REPLACE ----- variables -------------------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\var\s+                          # \var keyword + argument
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>\w+))
-[\s]*(?P<brief>[^\n]*?)\n         # brief description
-(?P<after>.*?)\*\/                # tail of the comment
-\s*(?P<def>[^;]*;)                # the definition of the variable
-.*\Z                              # and the remainder
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>"><title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para>
-<programlisting>
-\g<def>
-</programlisting>
-</para><para>
-\g<before>\g<after>
-</para>
-</section>
-
-REPLACE ----- \define ---------------------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\define\s+                       # \define command
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>\w+))
-[\s]*(?P<brief>[^\n]*?)\n         # brief description
-(?P<after>.*?)\*\/                # tail of the comment
-\s*                               # whitespace
-(?P<def>\#define\s+[\w0-9,()]+)           # macro
-.*\Z                              # drop the remainder
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>"><title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para>
-<programlisting>
-\g<def>
-</programlisting>
-</para><para>
-\g<before>\g<after>
-</para>
-</section>
-
-REPLACE ----- \section without title ------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\section\s+(?P<name>\w+)\s*$     # \section + argument
-(?P<after>.*?)\*\/                # tail of the comment
-.*\Z                              # and the remainder, this is dropped
-
-WITH
-
-\g<before>
-\g<after>
-
-REPLACE ----- \section with title ---------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\section\s+(?P<name>\w+)         # \section + argument
-(?P<title>.*?)                    # section title
-\n\s*?\n                          # empty line
-(?P<after>.*?)\*\/                # tail of the comment
-.*\Z                              # and the remainder, this is dropped
-
-WITH
-
-<title>\g<title></title>
-\g<before>
-\g<after>
-
-REPLACE ----- \section with title ---------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\section\s+(?P<name>\w+)         # \section + argument
-(?P<title>.*?)\s*\*\/             # section title
-.*\Z                              # and the remainder, this is dropped
-
-WITH
-
-<title>\g<title></title>
-\g<before>
-
-REPLACE ----- an enumeration typedef ------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\typedef\s+                      # \typedef command
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>\w+))
-[\s]*(?P<brief>[^\n]*?)\n         # brief description
-(?P<after>.*?)                    # tail of the comment
- \*\/\s*                          # closing the comment
-(?P<def>typedef\s*enum\s*\{       # typedef enum
- [^\}]*\}\s*\w+\s*;)                  # rest of the definition
-.*\Z
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>"><title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para>
-<programlisting>
-\g<def>
-</programlisting>
-</para>
-<para>
-\g<before>\g<after>
-</para>
-</section>
-
-REPLACE ----- enumeration value descriptions, head ----------------------------
-
-(?P<before>\A.*?)               # head of the comment
-\\enumval\b                     # first \param commant
-
-WITH --------------------------------------------------------------------------
-
-\g<before></para>
-<formalpara><title>Values:</title><para>
-<variablelist role="params">
-\enumval
-
-REPLACE ----- enumeration value descriptions, tail ----------------------------
-
-\\enumval\b                       # the last \enumval command
-(?P<paramtext>.*?)                # the text of the \enumval command
-(?P<endmark>                      # this marks the end of the \enumval text
- (\\return\b)|(\\sa\b)|           # it is either a \return or \sa or
- (\n\s*?\n)|                      # (at least) one empty line or
- (\*\/))                          # the end of the comment
-(?P<after>.*?\Z)                  # remaining part
-
-WITH
-
-\enumval\g<paramtext></variablelist></para></formalpara><para>
-\g<endmark>\g<after>
-
-REPLACE ----- enumeration value descriptions ----------------------------------
-
-\\enumval\b\s*                    # \enumval command
-(?P<paramname>(\w+)|(...))\s+     # name of the parameter
-(?P<paramtext>.*?)                # text of the \enumval command
-(?=(\\enumval)|(</variablelist>)|
- (\n\s*\n))
-
-WITH --------------------------------------------------------------------------
-
-  <varlistentry><term><constant>\g<paramname></constant>:</term>
-  <listitem><para>
-  \g<paramtext></para></listitem></varlistentry>  
-
-REPLACE ----- \struct ---------------------------------------------------------
-
-(?P<before>\A.*?)                 # head of the comment
-\\struct\s+                       # \struct command
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>[\w_]+))
-[\s]*(?P<brief>[^\n]*?)(?=\n)     # brief description
-(?P<after>.*?)                    # tail of the command
-\*\/\s*                           # closing the comment
-(?P<def>typedef \s*struct\s*\w+\s*\{
- .*\}\s*\w+\s*;)
-.*\Z
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>"><title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para>
-<programlisting>
-\g<def>
-</programlisting>
-</para>
-<para>
-\g<before>\g<after>
-</para>
-</section>
-
-REPLACE ----- structure member descriptions, one block ------------------------
-
-^[\s]*\n
-(?P<before2>.*?)                # empty line+text
-(?P<members>\\member\b.*?)      # member commands
-(?=                             # this marks the end of the \member text
- (\\return\b)|(\\sa\b)|         # it is either a \return or \sa or
- (^[\s]*\n)|                    # (at least) one empty line or
- (\*\/))                        # the end of the comment
-
-WITH --------------------------------------------------------------------------
-
-</para>
-<para>\g<before2></para>
-<formalpara><title>Values:</title>
-<para><variablelist role="params">
-\g<members>
-</variablelist></para></formalpara><para>
-
-REPLACE ----- structure member descriptions -----------------------------------
-
-\\member\b\s*                    # \enumval command
-(?P<paramname>(\w+)|(...))\s+     # name of the parameter
-(?P<paramtext>.*?)                # text of the \enumval command
-(?=(\\member)|(</variablelist>)|
- (\n\s*\n))
-
-WITH --------------------------------------------------------------------------
-
-  <varlistentry><term><constant>\g<paramname></constant>:</term>
-  <listitem><para>
-  \g<paramtext></para></listitem></varlistentry>
-
-REPLACE ----- \typedef function -----------------------------------------------
-
-(?P<before>.*?)                   # comment head
-\\typedef\s+                      # \typedef command
-(?P<name>(?P<pre>(igraph_)|(IGRAPH_)|())(?P<tail>\w+))
-[\s]*(?P<brief>[^\n]*?)\n         # brief description
-(?P<after>.*?)                    # comment tail
-\*\/                              # end of comment block
-\s*
-(?P<src>typedef\s+[^;]*;)        # the typedef definition
-.*\Z
-
-WITH --------------------------------------------------------------------------
-
-<section id="\g<name>"><title><function>\g<name></function> &mdash; \g<brief></title>
-<indexterm><primary>\g<tail></primary></indexterm>
-<para><programlisting>
-\g<src>
-</programlisting></para>
-<para>
-\g<before>\g<after>
-</para>
-</section>
-
-REPLACE ----- ignore doxygen \ingroup command ---------------------------------
-
-\\ingroup\s+\w+
-
-WITH --------------------------------------------------------------------------
-
-REPLACE ----- ignore doxygen \defgroup command --------------------------------
-
-\\defgroup\s+\w+
-
-WITH --------------------------------------------------------------------------
-
-REPLACE ----- add the contents of \brief to the description -------------------
-
-\\brief\b
-
-WITH --------------------------------------------------------------------------
-
-REPLACE ----- \varname command ------------------------------------------------
-
-\\varname\b\s*
-(?P<var>\w+\b)
-
-WITH
-
-<varname>\g<var></varname>
-
-REPLACE ----- references, \ref command ----------------------------------------
-
-\\ref\b\s*
-(?P<what>\w+)(?P<paren>([\(][\)])?)
-
-WITH --------------------------------------------------------------------------
-
-<link linkend="\g<what>"><function>\g<what>\g<paren></function></link>
-
-REPLACE ----- \sa command -----------------------------------------------------
-
-\\sa\b
-\s*
-(?P<text>.*?)
-(?=(\n\s*?\n)|(\*\/))
-
-WITH ----------------------------------------------------------------------TODO
-
-</para><formalpara><title>See also:</title><para><variablelist>
-  <varlistentry><term><parameter></parameter></term>
-  <listitem><para>
-  \g<text>
-  </para></listitem></varlistentry>
-</variablelist></para></formalpara><para>
-
-REPLACE ----- \em command -----------------------------------------------------
-
-\\em\b
-\s*
-(?P<text>[^\s]+)
-
-WITH
-
-<emphasis>\g<text></emphasis>
-
-REPLACE ----- \emb command ----------------------------------------------------
-
-\\emb\b
-
-WITH
-
-<emphasis>
-
-REPLACE ----- \eme command ----------------------------------------------------
-
-\\eme\b
-
-WITH
-
-</emphasis>
-
-REPLACE ----- \verbatim -------------------------------------------------------
-
-\\verbatim\b
-
-WITH
-
-<informalexample><programlisting>
-
-REPLACE ----- \endverbatim ----------------------------------------------------
-
-\\endverbatim\b
-
-WITH
-
-</programlisting></informalexample>
-
-REPLACE ----- \clist ----------------------------------------------------------
-
-\\clist\b
-
-WITH
-
-<variablelist>
-
-REPLACE ----- \cli ------------------------------------------------------------
-
-\\cli\s+(?P<term>.*?)$
-(?P<text>.*?)
-(?=(\\cli)|(\\endclist))
-
-WITH --------------------------------------------------------------------------
-
-<varlistentry><term><constant>\g<term></constant></term>
-<listitem><para>
-\g<text>
-</para></listitem></varlistentry>
-
-REPLACE ----- \endclist -------------------------------------------------------
-
-\\endclist\b
-
-WITH
-
-</variablelist>
-
-REPLACE ----- \olist ----------------------------------------------------------
-
-\\olist\b
-
-WITH
-
-<orderedlist>
-
-REPLACE ----- \oli ------------------------------------------------------------
-
-\\oli\s+(?P<text>.*?)
-(?=(\\oli)|(\\endolist))
-
-WITH
-
-<listitem><para>
-\g<text>
-</para></listitem>
-
-REPLACE ----- \endolist -------------------------------------------------------
-
-\\endolist\b
-
-WITH
-
-</orderedlist>
-
-REPLACE ----- \ilist ----------------------------------------------------------
-
-\\ilist\b
-
-WITH
-
-<itemizedlist>
-
-REPLACE ----- \ili ------------------------------------------------------------
-
-\\ili\s+(?P<text>.*?)
-(?=(\\ili)|(\\endilist))
-
-WITH
-
-<listitem><para>
-\g<text>
-</para></listitem>
-
-REPLACE ----- \endilist -------------------------------------------------------
-
-\\endilist\b
-
-WITH
-
-</itemizedlist>
-
-REPLACE ----- doxygen \c command is for <constant> ----------------------------
-
-\\c\s+(?P<word>[\w\-^\']+)\b
-
-WITH
-
-<constant>\g<word></constant>
-
-REPLACE ----- doxygen \p command is for <parameter> ---------------------------
-
-\\p\s+(?P<word>\w+)\b
-
-WITH
-
-<parameter>\g<word></parameter>
-
-REPLACE ----- doxygen \type command is for <type> -----------------------------
-
-\\type\s+(?P<word>\w+)\b
-
-WITH
-
-<type>\g<word></type>
-
-REPLACE ----- doxygen \a command is for <command> -----------------------------
-
-\\a\s+(?P<word>\w+)\b
-
-WITH
-
-<command>\g<word></command>
-
-REPLACE ----- doxygen \quote command is for <quote> ---------------------------
-
-\\quote\s+
-
-WITH
-
-<quote>
-
-REPLACE ----- doxygen \endquote command is for </quote> -----------------------
-
-\s*\\endquote\b
-
-WITH
-
-</quote>
-
-REPLACE ----- replace <code> with <literal> -----------------------------------
-
-<(?P<c>/?)code>
-
-WITH --------------------------------------------------------------------------
-
-<\g<c>literal> 
-
-REPLACE ----- add http:// links -----------------------------------------------
-
-(?P<link>http:\/\/.*?)
-(?=(\s)|\))
-
-WITH --------------------------------------------------------------------------
-
-<ulink url="\g<link>">\g<link></ulink>
-
-REPLACE ----- blockquote ------------------------------------------------------
-
-\\blockquote
-
-WITH --------------------------------------------------------------------------
-
-<blockquote>
-
-REPLACE ----- blockquote ------------------------------------------------------
-
-\\endblockquote
-
-WITH --------------------------------------------------------------------------
-
-</blockquote>
-
-REPLACE ----- example file  ---------------------------------------------------
-
-\\example\b\s*
-(?P<filename>[^\n]*?)\n
-
-WITH --------------------------------------------------------------------------
-
-<example role="sourcefile">
-  <title> File <code>\g<filename></code></title>
-  <xi:include  href="../\g<filename>.xml"
-      xmlns:xi="http://www.w3.org/2001/XInclude"/>
-  <para></para>
-</example>
diff -Nru igraph-0.6.5~quantal1/doc/cliques.xxml igraph-0.6.5/doc/cliques.xxml
--- igraph-0.6.5~quantal1/doc/cliques.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/cliques.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Cliques">
-<title>Cliques and Independent Vertex Sets</title>
-
-<para>
-These functions calculate various graph properties related
-to cliques and independent vertex sets.
-</para>
-
-<section><title>Cliques</title>
-<!-- doxrox-include igraph_cliques -->
-<!-- doxrox-include igraph_largest_cliques -->
-<!-- doxrox-include igraph_maximal_cliques -->
-<!-- doxrox-include igraph_clique_number -->
-</section>
-
-<section><title>Independent Vertex Sets</title>
-<!-- doxrox-include igraph_independent_vertex_sets -->
-<!-- doxrox-include igraph_largest_independent_vertex_sets -->
-<!-- doxrox-include igraph_maximal_independent_vertex_sets -->
-<!-- doxrox-include igraph_independence_number -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/community.xxml igraph-0.6.5/doc/community.xxml
--- igraph-0.6.5~quantal1/doc/community.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/community.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Community">
-<title>Detecting Community Structure</title>
-
-<section><title>Common functions related to community structure</title>
-<!-- doxrox-include igraph_modularity -->
-<!-- doxrox-include igraph_community_optimal_modularity -->
-<!-- doxrox-include igraph_community_to_membership -->
-<!-- doxrox-include igraph_reindex_membership -->
-<!-- doxrox-include igraph_compare_communities -->
-<!-- doxrox-include igraph_split_join_distance -->
-</section>
-
-<section><title>Community structure based on statistical mechanics</title>
-<!-- doxrox-include igraph_community_spinglass -->
-<!-- doxrox-include igraph_community_spinglass_single -->
-</section>
-
-<section><title>Community structure based on eigenvectors of matrices</title>
-<!-- doxrox-include about_leading_eigenvector_methods -->
-<!-- doxrox-include igraph_community_leading_eigenvector -->
-<!-- doxrox-include igraph_community_leading_eigenvector_callback_t -->
-<!-- doxrox-include igraph_le_community_to_membership -->
-</section>
-
-<section><title>Walktrap: community structure based on random walks</title>
-<!-- doxrox-include igraph_community_walktrap -->
-</section>
-
-<section><title>Edge betweenness based community detection</title>
-<!-- doxrox-include igraph_community_edge_betweenness -->
-<!-- doxrox-include igraph_community_eb_get_merges -->
-</section>
-
-<section><title>Community structure based on the optimization of modularity</title>
-<!-- doxrox-include igraph_community_fastgreedy -->
-<!-- doxrox-include igraph_community_multilevel -->
-</section>
-
-<section><title>Label propagation</title>
-<!-- doxrox-include igraph_community_label_propagation -->
-</section>
-
-<section><title>The InfoMAP algorithm</title>
-<!-- doxrox-include igraph_community_infomap -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/devhelp.xsl igraph-0.6.5/doc/devhelp.xsl
--- igraph-0.6.5~quantal1/doc/devhelp.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/devhelp.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,131 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version='1.0'
-                xmlns="http://www.devhelp.net/book"
-                exclude-result-prefixes="#default">
-
-  <xsl:template name="generate.devhelp">
-    <xsl:call-template name="write.chunk">
-      <xsl:with-param name="filename">
-        <xsl:choose>
-          <xsl:when test="$gtkdoc.bookname">
-            <xsl:value-of select="$gtkdoc.bookname"/>
-          </xsl:when>
-          <xsl:otherwise>
-            <xsl:text>book</xsl:text>
-          </xsl:otherwise>
-        </xsl:choose>
-        <xsl:text>.devhelp</xsl:text>
-      </xsl:with-param>
-      <xsl:with-param name="method" select="'xml'"/>
-      <xsl:with-param name="indent" select="'yes'"/>
-      <xsl:with-param name="encoding" select="'utf-8'"/>
-      <xsl:with-param name="content">
-        <xsl:call-template name="devhelp"/>
-      </xsl:with-param>
-    </xsl:call-template>
-  </xsl:template>
-
-  <xsl:template name="devhelp">
-    <xsl:variable name="title">
-      <xsl:apply-templates select="." mode="generate.devhelp.toc.title.mode"/>
-    </xsl:variable>
-    <xsl:variable name="link">
-      <xsl:call-template name="href.target"/>
-    </xsl:variable>
-    <xsl:variable name="author">
-      <xsl:if test="articleinfo|bookinfo">
-        <xsl:apply-templates mode="generate.devhelp.authors"
-                             select="articleinfo|bookinfo"/>
-      </xsl:if>
-    </xsl:variable>
-    <xsl:variable name="toc.nodes" select="part|reference|preface|chapter|
-                                           appendix|article|bibliography|
-                                           glossary|index|refentry|refsection|
-                                           bridgehead|sect1"/>
-
-    <book title="{$title}" link="{$link}" author="{$author}" name="{$gtkdoc.bookname}">
-      <xsl:if test="$toc.nodes">
-        <chapters>
-          <xsl:apply-templates select="$toc.nodes"
-                               mode="generate.devhelp.toc.mode"/>
-        </chapters>
-      </xsl:if>
-      <functions>
-        <xsl:apply-templates select="//refsect2"
-                             mode="generate.devhelp.index.mode"/>
-      </functions>
-    </book>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.devhelp.toc.mode">
-    <xsl:variable name="title">
-      <xsl:apply-templates select="." mode="generate.devhelp.toc.title.mode"/>
-    </xsl:variable>
-    <xsl:variable name="target">
-      <xsl:variable name="anchor" select="title/anchor"/>
-      <xsl:choose>
-        <xsl:when test="$anchor">
-          <xsl:call-template name="href.target">
-            <xsl:with-param name="object" select="$anchor"/>
-          </xsl:call-template>
-        </xsl:when>
-        <xsl:otherwise>
-          <xsl:call-template name="href.target"/>
-        </xsl:otherwise>
-      </xsl:choose>
-    </xsl:variable>
-
-    <sub name="{$title}" link="{$target}">
-      <xsl:apply-templates select="section|sect1|
-                                   refentry|refsect|refsection|
-                                   bridgehead|part|chapter"
-                           mode="generate.devhelp.toc.mode"/>
-    </sub>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.devhelp.index.mode">
-    <xsl:variable name="title" select="title"/>
-    <xsl:variable name="anchor" select="title/anchor"/>
-    <xsl:variable name="target">
-      <xsl:choose>
-        <xsl:when test="$anchor">
-          <xsl:call-template name="href.target">
-            <xsl:with-param name="object" select="$anchor"/>
-          </xsl:call-template>
-        </xsl:when>
-        <xsl:otherwise>
-          <xsl:call-template name="href.target"/>
-        </xsl:otherwise>
-      </xsl:choose>
-    </xsl:variable>
-    <function name="{$title}" link="{$target}"/>
-  </xsl:template>
-
-  <!-- get title -->
-  <xsl:template match="article" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="articleinfo/title"/>
-  </xsl:template>
-  <xsl:template match="book" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="bookinfo/title"/>
-  </xsl:template>
-  <xsl:template match="refentry" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="refmeta/refentrytitle"/>
-  </xsl:template>
-  <xsl:template match="*" mode="generate.devhelp.toc.title.mode">
-    <xsl:value-of select="title"/>
-  </xsl:template>
-
-  <!-- generate list of authors ... -->
-  <xsl:template match="articleinfo|bookinfo" mode="generate.devhelp.authors">
-    <xsl:for-each select="authorgroup/author">
-      <xsl:value-of select="firstname"/>
-      <xsl:text> </xsl:text>
-      <xsl:value-of select="surname"/>
-      <xsl:if test="not(last())">
-        <xsl:text>, </xsl:text>
-      </xsl:if>
-    </xsl:for-each>
-  </xsl:template>
-
-</xsl:stylesheet>
diff -Nru igraph-0.6.5~quantal1/doc/docbook.outlang igraph-0.6.5/doc/docbook.outlang
--- igraph-0.6.5~quantal1/doc/docbook.outlang	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/docbook.outlang	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-# by Stuart Rackham
-# http://www.methods.co.nz/asciidoc/source-highlight-filter.html
-
-extension "xml"
-
-bold "<emphasis role=\"strong\">$text</emphasis>"
-italics "<emphasis>$text</emphasis>"
-
-anchor "<anchor id=\"line$linenum\"/>$text"
-postline_reference "<link linkend='line$linenum'>$text -> $linenum</link>"
-postdoc_reference "<link linkend='line$linenum'>$text -> $linenum</link>"
-reference "<link linkend='$text'>$text</link>"
-
-doctemplate
-"<!DOCTYPE article PUBLIC \"-//OASIS//DTD DocBook//EN\">
-<article>
-<articleinfo>
-<title>$title</title>
-</articleinfo>
-<programlisting linenumbering=\"numbered\">"
-"</programlisting>
-</article>
-"
-end
-
-nodoctemplate
-"<programlisting linenumbering=\"numbered\">"
-"</programlisting>
-"
-end
-
-translations
-"&" "&amp;"
-"<" "&lt;"
-">" "&gt;"
-end
diff -Nru igraph-0.6.5~quantal1/doc/doxrox.py igraph-0.6.5/doc/doxrox.py
--- igraph-0.6.5~quantal1/doc/doxrox.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/doxrox.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,271 +0,0 @@
-#! /usr/bin/env python
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-import sys
-import getopt
-import re
-import string
-
-#################
-# constants, these might turn to parameters some time
-#################
-doxhead='\/\*\*'
-
-#################
-# global variables
-#################
-verbose=False
-cutit=False
-
-#########################################################################
-# The main function
-#########################################################################
-
-def main():
-
-    global verbose, cutit
-    
-    # get command line arguments
-    try:
-        optlist, args = getopt.getopt(sys.argv[1:], 't:e:o:hvc', ['help'])
-    except getopt.GetoptError:
-        # print help information and exit:
-        usage()
-        sys.exit(2)
-
-    # handle command line arguments
-    templatefile=regexfile=outputfile=""
-    verbose=False
-    
-    for o, a in optlist:
-        if o in ("-h", "--help"):
-            usage()
-            sys.exit()
-        if o == "-t":
-            templatefile = a
-        if o == "-e":
-            regexfile = a
-        if o == "-o":
-            outputfile = a
-        if o == "-v":
-            verbose = True
-        if o == "-c":
-            cutit = True
-        
-    if templatefile == "" or regexfile == "" or outputfile == "":
-        print("Error, some special file is not given")
-        usage()
-        sys.exit(2)
-
-    if templatefile in args or regexfile in args or outputfile in args:
-        print("Error, special file is also used as an input file")
-        usage()
-        sys.exit(2)
-
-    if templatefile == regexfile or templatefile == outputfile or \
-        regexfile == outputfile:
-        print('Error, some special files are the same')
-        usage()
-        sys.exit(2)
-
-    # get all regular expressions
-    if verbose:
-        print 'Reading regular expressions...',
-    regexlist=readregex(regexfile)
-    if verbose:
-        print("done, "+str(len(regexlist))+" rules read.")
-
-    # parse all input files and extract chunks, apply rules
-    docchunks=dict()
-    for ifile in args:
-        if verbose:
-            print 'Parsing input file '+ifile+'...',
-        try:
-            f=open(ifile, 'r')
-            strinput=f.read()
-            f.close()
-        except IOError:
-            print("Error reading input file: "+ifile)
-            sys.exit(3)
-        parsestring(strinput, regexlist, docchunks)
-        if verbose:
-            print('done, '+str(len(docchunks))+" chunks read.")
-
-    # substitute the template file
-    try:
-        if verbose:
-            print "Reading template file...",
-        tfile=open(templatefile, 'r')
-        tstring=tfile.read()
-        tfile.close()
-        if verbose:
-            print('done.')
-    except IOError:
-        print("Error reading the template file: "+templatefile)
-        sys.exit(7)
-    if verbose:
-        print "Substituting template file...",        
-    chunkit=re.finditer(r'<!--\s*doxrox-include\s+(\w+)\s+-->', tstring)
-    outstring=""
-    last=0
-    for chunk in chunkit:
-        outstring=outstring+tstring[last:chunk.start()]+\
-                   docchunks[chunk.group(1)]
-        last=chunk.end()
-    outstring=outstring+tstring[last:]
-    if verbose:
-        print "done."
-
-    # write output file
-    try:
-        if verbose:
-            print "Writing output file...",
-        ofile=open(outputfile, 'w')
-        ofile.write(outstring)
-        ofile.close()
-    except IOError:
-        print("Error writing output file:"+outputfile)
-        sysexit(8)
-    if verbose:
-        print "done."
-    
-#########################################################################
-# End of the main function
-#########################################################################
-
-#################
-# read the regular expressions
-#################
-def readregex(regexfile):
-    lines=[]
-    mode="empty"
-    actreplace=""
-    actwith=""
-    acttype=""
-    lineno=1
-    try:
-        f=open(regexfile, "r")
-        for line in f:
-            # a new pattern block starts
-            if line[0:7]=="REPLACE":
-                if mode not in ("empty","with"):
-                    print("Parse error in regex file ("+regexfile+"), line "+
-                          str(lineno))
-                    sys.exit(4)
-                else:
-                    if (actreplace != ""):
-                        readregexappend(lines, actreplace, actwith, acttype)
-                    actreplace=actwith=""
-                    mode="replace"
-            # the second half of the pattern block starts
-            elif line[0:4]=="WITH" or line[0:3]=="RUN":
-                if mode != "replace":
-                    print("Parse error in regex file ("+regexfile+"), line "+
-                          str(lineno))
-                    sys.exit(4)
-                else:
-                    mode="with"
-                if line[0:4]=="WITH":
-                    acttype="with"
-                else:
-                    acttype="run"
-            # empty line, do nothing
-            elif re.match("^\s*$", line):
-                1==1
-            # normal line, append
-            else:
-                if mode=="replace":
-                    actreplace=actreplace+line
-                elif mode=="with":
-                    actwith=actwith+line
-                else:
-                    print("Parse error in regex file ("+regexfile+"), line "+
-                          str(lineno))
-                    sys.exit(4)
-            lineno=lineno+1
-
-        if actreplace != "":
-            readregexappend(lines, actreplace, actwith, acttype)
-        f.close()
-    except IOError:
-        print("Error reading regex file: "+regexfile)
-        sys.exit(4)
-    return (lines)
-        
-def readregexappend(lines, actreplace, actwith, acttype):
-    compactreplace=re.compile(actreplace,re.VERBOSE|re.MULTILINE|re.DOTALL)
-    actwith=actwith[:(len(actwith)-1)]
-    lines.append( (compactreplace, actwith, acttype) )
-        
-#################
-# parse an input file string
-#################
-def parsestring(strinput, regexlist, docchunks):
-    global cutit
-    # split the file
-    chunks=re.split(doxhead, strinput)
-    chunks=chunks[1:]
-    # apply all rules to the chunks
-    for ch in chunks:
-        if cutit:
-            ch=ch.split("/*")[0]
-        actch=ch
-        name=""
-        for reg in regexlist:
-            matched=reg[0].match(actch)
-            if name=="" and matched != None:
-                try:
-                    name=matched.group('name')
-                except IndexError:
-                    name=""
-            if reg[2]=="with":
-                try:
-                    actch=reg[0].sub(reg[1], actch)
-                except IndexError:
-                    print("Index error:"+ch[0:60]+"...")
-                    print("Pattern:\n"+reg[0].pattern)
-                    print("Current state:"+actch[0:60]+"...")
-                    sys.exit(6)
-            elif reg[2]=="run":
-                exec(reg[1])
-        if name=="":
-            print("Chunk without a name ignored:"+ch[0:60]+"...")
-            continue
-        if docchunks.has_key(name):
-            print("Multiple defined name: "+name)
-            sys.exit(6)
-        if verbose:
-            print name,
-        docchunks[name]=string.strip(actch)
-    return(docchunks)
-
-#################
-# print out some help
-#################
-def usage():
-    print("Usage: " + sys.argv[0] + " [-vh] -t template-file -e regex-file -o output-file\n"+
-          "                   [--help] [inputfile]...")
-
-
-if __name__ == "__main__":
-    main()
diff -Nru igraph-0.6.5~quantal1/doc/dqueue.xxml igraph-0.6.5/doc/dqueue.xxml
--- igraph-0.6.5~quantal1/doc/dqueue.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/dqueue.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Dqueues">
-<title>Double-ended queues</title>
-
-<!-- doxrox-include igraph_dqueue -->
-<!-- doxrox-include igraph_dqueue_init -->
-<!-- doxrox-include igraph_dqueue_destroy -->
-<!-- doxrox-include igraph_dqueue_empty -->
-<!-- doxrox-include igraph_dqueue_full -->
-<!-- doxrox-include igraph_dqueue_clear -->
-<!-- doxrox-include igraph_dqueue_size -->
-<!-- doxrox-include igraph_dqueue_head -->
-<!-- doxrox-include igraph_dqueue_back -->
-<!-- doxrox-include igraph_dqueue_pop -->
-<!-- doxrox-include igraph_dqueue_pop_back -->
-<!-- doxrox-include igraph_dqueue_push -->
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/error.xxml igraph-0.6.5/doc/error.xxml
--- igraph-0.6.5~quantal1/doc/error.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/error.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Error">
-<title>Error Handling</title>
-
-<section id="igraph-errorhandlingbasics">
-<!-- doxrox-include errorhandlingbasics -->
-</section>
-
-<section id="igraph-errorhandlers">
-<!-- doxrox-include errorhandlers -->
-<!-- doxrox-include igraph_error_handler_t -->
-<!-- doxrox-include igraph_error_handler_abort -->
-<!-- doxrox-include igraph_error_handler_ignore -->
-<!-- doxrox-include igraph_error_handler_printignore -->
-</section>
-
-<section id="igraph-errorcodes">
-<!-- doxrox-include errorcodes -->
-<!-- doxrox-include igraph_error_type_t -->
-<!-- doxrox-include igraph_strerror -->
-</section>
-
-<section id="igraph-warnings">
-<!-- doxrox-include about_igraph_warnings -->
-<!-- doxrox-include igraph_warning_handler_t -->
-<!-- doxrox-include igraph_set_warning_handler -->
-<!-- doxrox-include IGRAPH_WARNING -->
-<!-- doxrox-include igraph_warning -->
-<!-- doxrox-include igraph_warningf -->
-<!-- doxrox-include igraph_warning_handler_ignore -->
-<!-- doxrox-include igraph_warning_handler_print -->
-</section>
-
-<section id="igraph-erroradvancedtopics">
-<title>Advanced topics</title>
-
-<section id="igraph-writingerrorhandlers">
-<!-- doxrox-include writing_error_handlers -->
-<!-- doxrox-include igraph_set_error_handler -->
-</section>
-
-<section id="igraph-errorhandlinginternals">
-<!-- doxrox-include error_handling_internals -->
-<!-- doxrox-include IGRAPH_ERROR -->
-<!-- doxrox-include igraph_error -->
-<!-- doxrox-include igraph_errorf -->
-<!-- doxrox-include IGRAPH_CHECK -->
-</section>
-
-<section id="igraph-deallocatingmemory">
-<!-- doxrox-include deallocating_memory -->
-<!-- doxrox-include IGRAPH_FINALLY -->
-<!-- doxrox-include IGRAPH_FINALLY_CLEAN -->
-<!-- doxrox-include IGRAPH_FINALLY_FREE -->
-</section>
-
-<section id="igraph-writingfunctionserrorhandling">
-<!-- doxrox-include writing_functions_error_handling -->
-</section>
-
-<section id="igraph-errorhandlingthreads">
-<!-- doxrox-include error_handling_threads -->
-</section>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/fdl.xml igraph-0.6.5/doc/fdl.xml
--- igraph-0.6.5~quantal1/doc/fdl.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/fdl.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,420 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd">
-<section id="igraph-fdl">
-  <sectioninfo>
-    <edition>Version 1.2, November 2002</edition>
-    <copyright><year>2000</year><year>2001</year><year>2002</year>      
-    <holder>Free Software Foundation, Inc.
-      51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
-    </holder>
-    </copyright>
-    <legalnotice><para>
-     Everyone is permitted to copy and distribute verbatim copies
-     of this license document, but changing it is not allowed.
-    </para>
-    </legalnotice>
-  </sectioninfo>
-
-<title>The GNU Free Documentation License</title>
-
-<section><title>0. PREAMBLE</title>
-<para>
-The purpose of this License is to make a manual, textbook, or other
-functional and useful document "free" in the sense of freedom: to
-assure everyone the effective freedom to copy and redistribute it,
-with or without modifying it, either commercially or noncommercially.
-Secondarily, this License preserves for the author and publisher a way
-to get credit for their work, while not being considered responsible
-for modifications made by others.
-</para><para>
-This License is a kind of "copyleft", which means that derivative
-works of the document must themselves be free in the same sense.  It
-complements the GNU General Public License, which is a copyleft
-license designed for free software.
-</para><para>
-We have designed this License in order to use it for manuals for free
-software, because free software needs free documentation: a free
-program should come with manuals providing the same freedoms that the
-software does.  But this License is not limited to software manuals;
-it can be used for any textual work, regardless of subject matter or
-whether it is published as a printed book.  We recommend this License
-principally for works whose purpose is instruction or reference.
-</para>
-</section><section><title>1. APPLICABILITY AND DEFINITIONS</title>
-<para>
-This License applies to any manual or other work, in any medium, that
-contains a notice placed by the copyright holder saying it can be
-distributed under the terms of this License.  Such a notice grants a
-world-wide, royalty-free license, unlimited in duration, to use that
-work under the conditions stated herein.  The "Document", below,
-refers to any such manual or work.  Any member of the public is a
-licensee, and is addressed as "you".  You accept the license if you
-copy, modify or distribute the work in a way requiring permission
-under copyright law.
-</para><para>
-A "Modified Version" of the Document means any work containing the
-Document or a portion of it, either copied verbatim, or with
-modifications and/or translated into another language.
-</para><para>
-A "Secondary Section" is a named appendix or a front-matter section of
-the Document that deals exclusively with the relationship of the
-publishers or authors of the Document to the Document's overall subject
-(or to related matters) and contains nothing that could fall directly
-within that overall subject.  (Thus, if the Document is in part a
-textbook of mathematics, a Secondary Section may not explain any
-mathematics.)  The relationship could be a matter of historical
-connection with the subject or with related matters, or of legal,
-commercial, philosophical, ethical or political position regarding
-them.
-</para><para>
-The "Invariant Sections" are certain Secondary Sections whose titles
-are designated, as being those of Invariant Sections, in the notice
-that says that the Document is released under this License.  If a
-section does not fit the above definition of Secondary then it is not
-allowed to be designated as Invariant.  The Document may contain zero
-Invariant Sections.  If the Document does not identify any Invariant
-Sections then there are none.
-</para><para>
-The "Cover Texts" are certain short passages of text that are listed,
-as Front-Cover Texts or Back-Cover Texts, in the notice that says that
-the Document is released under this License.  A Front-Cover Text may
-be at most 5 words, and a Back-Cover Text may be at most 25 words.
-</para><para>
-A "Transparent" copy of the Document means a machine-readable copy,
-represented in a format whose specification is available to the
-general public, that is suitable for revising the document
-straightforwardly with generic text editors or (for images composed of
-pixels) generic paint programs or (for drawings) some widely available
-drawing editor, and that is suitable for input to text formatters or
-for automatic translation to a variety of formats suitable for input
-to text formatters.  A copy made in an otherwise Transparent file
-format whose markup, or absence of markup, has been arranged to thwart
-or discourage subsequent modification by readers is not Transparent.
-An image format is not Transparent if used for any substantial amount
-of text.  A copy that is not "Transparent" is called "Opaque".
-</para><para>
-Examples of suitable formats for Transparent copies include plain
-ASCII without markup, Texinfo input format, LaTeX input format, SGML
-or XML using a publicly available DTD, and standard-conforming simple
-HTML, PostScript or PDF designed for human modification.  Examples of
-transparent image formats include PNG, XCF and JPG.  Opaque formats
-include proprietary formats that can be read and edited only by
-proprietary word processors, SGML or XML for which the DTD and/or
-processing tools are not generally available, and the
-machine-generated HTML, PostScript or PDF produced by some word
-processors for output purposes only.
-</para><para>
-The "Title Page" means, for a printed book, the title page itself,
-plus such following pages as are needed to hold, legibly, the material
-this License requires to appear in the title page.  For works in
-formats which do not have any title page as such, "Title Page" means
-the text near the most prominent appearance of the work's title,
-preceding the beginning of the body of the text.
-</para><para>
-A section "Entitled XYZ" means a named subunit of the Document whose
-title either is precisely XYZ or contains XYZ in parentheses following
-text that translates XYZ in another language.  (Here XYZ stands for a
-specific section name mentioned below, such as "Acknowledgements",
-"Dedications", "Endorsements", or "History".)  To "Preserve the Title"
-of such a section when you modify the Document means that it remains a
-section "Entitled XYZ" according to this definition.
-</para><para>
-The Document may include Warranty Disclaimers next to the notice which
-states that this License applies to the Document.  These Warranty
-Disclaimers are considered to be included by reference in this
-License, but only as regards disclaiming warranties: any other
-implication that these Warranty Disclaimers may have is void and has
-no effect on the meaning of this License.
-</para>
-   </section><section><title>2. VERBATIM COPYING</title>
-<para>
-You may copy and distribute the Document in any medium, either
-commercially or noncommercially, provided that this License, the
-copyright notices, and the license notice saying this License applies
-to the Document are reproduced in all copies, and that you add no other
-conditions whatsoever to those of this License.  You may not use
-technical measures to obstruct or control the reading or further
-copying of the copies you make or distribute.  However, you may accept
-compensation in exchange for copies.  If you distribute a large enough
-number of copies you must also follow the conditions in section 3.
-</para><para>
-You may also lend copies, under the same conditions stated above, and
-you may publicly display copies.
-</para>
-   </section><section><title>3. COPYING IN QUANTITY</title>
-<para>
-If you publish printed copies (or copies in media that commonly have
-printed covers) of the Document, numbering more than 100, and the
-Document's license notice requires Cover Texts, you must enclose the
-copies in covers that carry, clearly and legibly, all these Cover
-Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
-the back cover.  Both covers must also clearly and legibly identify
-you as the publisher of these copies.  The front cover must present
-the full title with all words of the title equally prominent and
-visible.  You may add other material on the covers in addition.
-Copying with changes limited to the covers, as long as they preserve
-the title of the Document and satisfy these conditions, can be treated
-as verbatim copying in other respects.
-</para><para>
-If the required texts for either cover are too voluminous to fit
-legibly, you should put the first ones listed (as many as fit
-reasonably) on the actual cover, and continue the rest onto adjacent
-pages.
-</para><para>
-If you publish or distribute Opaque copies of the Document numbering
-more than 100, you must either include a machine-readable Transparent
-copy along with each Opaque copy, or state in or with each Opaque copy
-a computer-network location from which the general network-using
-public has access to download using public-standard network protocols
-a complete Transparent copy of the Document, free of added material.
-If you use the latter option, you must take reasonably prudent steps,
-when you begin distribution of Opaque copies in quantity, to ensure
-that this Transparent copy will remain thus accessible at the stated
-location until at least one year after the last time you distribute an
-Opaque copy (directly or through your agents or retailers) of that
-edition to the public.
-</para><para>
-It is requested, but not required, that you contact the authors of the
-Document well before redistributing any large number of copies, to give
-them a chance to provide you with an updated version of the Document.
-</para>
-   </section><section><title>4. MODIFICATIONS</title>
-<para>
-You may copy and distribute a Modified Version of the Document under
-the conditions of sections 2 and 3 above, provided that you release
-the Modified Version under precisely this License, with the Modified
-Version filling the role of the Document, thus licensing distribution
-and modification of the Modified Version to whoever possesses a copy
-of it.  In addition, you must do these things in the Modified Version:
-</para><para>
-     <orderedlist numeration="upperalpha">
-     <listitem><para>
-   Use in the Title Page (and on the covers, if any) a title distinct
-   from that of the Document, and from those of previous versions
-   (which should, if there were any, be listed in the History section
-   of the Document).  You may use the same title as a previous version
-   if the original publisher of that version gives permission.
-     </para></listitem><listitem><para>
-   List on the Title Page, as authors, one or more persons or entities
-   responsible for authorship of the modifications in the Modified
-   Version, together with at least five of the principal authors of the
-   Document (all of its principal authors, if it has fewer than five),
-   unless they release you from this requirement.
-     </para></listitem><listitem><para>
-   State on the Title page the name of the publisher of the
-   Modified Version, as the publisher.
-     </para></listitem><listitem><para>
-   Preserve all the copyright notices of the Document.
-     </para></listitem><listitem><para>
-   Add an appropriate copyright notice for your modifications
-   adjacent to the other copyright notices.
-     </para></listitem><listitem><para>
-   Include, immediately after the copyright notices, a license notice
-   giving the public permission to use the Modified Version under the
-   terms of this License, in the form shown in the Addendum below.
-     </para></listitem><listitem><para>
-   Preserve in that license notice the full lists of Invariant Sections
-   and required Cover Texts given in the Document's license notice.
-     </para></listitem><listitem><para>
-   Include an unaltered copy of this License.
-     </para></listitem><listitem><para>
-   Preserve the section Entitled "History", Preserve its Title, and add
-   to it an item stating at least the title, year, new authors, and
-   publisher of the Modified Version as given on the Title Page.  If
-   there is no section Entitled "History" in the Document, create one
-   stating the title, year, authors, and publisher of the Document as
-   given on its Title Page, then add an item describing the Modified
-   Version as stated in the previous sentence.
-     </para></listitem><listitem><para>
-   Preserve the network location, if any, given in the Document for
-   public access to a Transparent copy of the Document, and likewise
-   the network locations given in the Document for previous versions
-   it was based on.  These may be placed in the "History" section.
-   You may omit a network location for a work that was published at
-   least four years before the Document itself, or if the original
-   publisher of the version it refers to gives permission.
-     </para></listitem><listitem><para>
-   For any section Entitled "Acknowledgements" or "Dedications",
-   Preserve the Title of the section, and preserve in the section all
-   the substance and tone of each of the contributor acknowledgements
-   and/or dedications given therein.
-     </para></listitem><listitem><para>
-   Preserve all the Invariant Sections of the Document,
-   unaltered in their text and in their titles.  Section numbers
-   or the equivalent are not considered part of the section titles.
-     </para></listitem><listitem><para>
-   Delete any section Entitled "Endorsements".  Such a section
-   may not be included in the Modified Version.
-     </para></listitem><listitem><para>
-   Do not retitle any existing section to be Entitled "Endorsements"
-   or to conflict in title with any Invariant Section.
-     </para></listitem><listitem><para>
-   Preserve any Warranty Disclaimers.
-     </para></listitem></orderedlist>
-</para><para>
-If the Modified Version includes new front-matter sections or
-appendices that qualify as Secondary Sections and contain no material
-copied from the Document, you may at your option designate some or all
-of these sections as invariant.  To do this, add their titles to the
-list of Invariant Sections in the Modified Version's license notice.
-These titles must be distinct from any other section titles.
-</para><para>
-You may add a section Entitled "Endorsements", provided it contains
-nothing but endorsements of your Modified Version by various
-parties--for example, statements of peer review or that the text has
-been approved by an organization as the authoritative definition of a
-standard.
-</para><para>
-You may add a passage of up to five words as a Front-Cover Text, and a
-passage of up to 25 words as a Back-Cover Text, to the end of the list
-of Cover Texts in the Modified Version.  Only one passage of
-Front-Cover Text and one of Back-Cover Text may be added by (or
-through arrangements made by) any one entity.  If the Document already
-includes a cover text for the same cover, previously added by you or
-by arrangement made by the same entity you are acting on behalf of,
-you may not add another; but you may replace the old one, on explicit
-permission from the previous publisher that added the old one.
-</para><para>
-The author(s) and publisher(s) of the Document do not by this License
-give permission to use their names for publicity for or to assert or
-imply endorsement of any Modified Version.
-</para>
-   </section><section><title>5. COMBINING DOCUMENTS</title>
-<para>
-You may combine the Document with other documents released under this
-License, under the terms defined in section 4 above for modified
-versions, provided that you include in the combination all of the
-Invariant Sections of all of the original documents, unmodified, and
-list them all as Invariant Sections of your combined work in its
-license notice, and that you preserve all their Warranty Disclaimers.
-</para><para>
-The combined work need only contain one copy of this License, and
-multiple identical Invariant Sections may be replaced with a single
-copy.  If there are multiple Invariant Sections with the same name but
-different contents, make the title of each such section unique by
-adding at the end of it, in parentheses, the name of the original
-author or publisher of that section if known, or else a unique number.
-Make the same adjustment to the section titles in the list of
-Invariant Sections in the license notice of the combined work.
-</para><para>
-In the combination, you must combine any sections Entitled "History"
-in the various original documents, forming one section Entitled
-"History"; likewise combine any sections Entitled "Acknowledgements",
-and any sections Entitled "Dedications".  You must delete all sections
-Entitled "Endorsements".
-</para>
-   </section><section><title>6. COLLECTIONS OF DOCUMENTS</title>
-<para>
-You may make a collection consisting of the Document and other documents
-released under this License, and replace the individual copies of this
-License in the various documents with a single copy that is included in
-the collection, provided that you follow the rules of this License for
-verbatim copying of each of the documents in all other respects.
-</para><para>
-You may extract a single document from such a collection, and distribute
-it individually under this License, provided you insert a copy of this
-License into the extracted document, and follow this License in all
-other respects regarding verbatim copying of that document.
-</para>
-   </section><section><title>7. AGGREGATION WITH INDEPENDENT WORKS</title>
-<para>
-A compilation of the Document or its derivatives with other separate
-and independent documents or works, in or on a volume of a storage or
-distribution medium, is called an "aggregate" if the copyright
-resulting from the compilation is not used to limit the legal rights
-of the compilation's users beyond what the individual works permit.
-When the Document is included in an aggregate, this License does not
-apply to the other works in the aggregate which are not themselves
-derivative works of the Document.
-</para><para>
-If the Cover Text requirement of section 3 is applicable to these
-copies of the Document, then if the Document is less than one half of
-the entire aggregate, the Document's Cover Texts may be placed on
-covers that bracket the Document within the aggregate, or the
-electronic equivalent of covers if the Document is in electronic form.
-Otherwise they must appear on printed covers that bracket the whole
-aggregate.
-</para>
-   </section><section><title>8. TRANSLATION</title>
-<para>
-Translation is considered a kind of modification, so you may
-distribute translations of the Document under the terms of section 4.
-Replacing Invariant Sections with translations requires special
-permission from their copyright holders, but you may include
-translations of some or all Invariant Sections in addition to the
-original versions of these Invariant Sections.  You may include a
-translation of this License, and all the license notices in the
-Document, and any Warranty Disclaimers, provided that you also include
-the original English version of this License and the original versions
-of those notices and disclaimers.  In case of a disagreement between
-the translation and the original version of this License or a notice
-or disclaimer, the original version will prevail.
-</para><para>
-If a section in the Document is Entitled "Acknowledgements",
-"Dedications", or "History", the requirement (section 4) to Preserve
-its Title (section 1) will typically require changing the actual
-title.
-</para>
-   </section><section><title>9. TERMINATION</title>
-<para>
-You may not copy, modify, sublicense, or distribute the Document except
-as expressly provided for under this License.  Any other attempt to
-copy, modify, sublicense or distribute the Document is void, and will
-automatically terminate your rights under this License.  However,
-parties who have received copies, or rights, from you under this
-License will not have their licenses terminated so long as such
-parties remain in full compliance.
-</para>
-   </section><section><title>10. FUTURE REVISIONS OF THIS LICENSE</title>
-<para>
-The Free Software Foundation may publish new, revised versions
-of the GNU Free Documentation License from time to time.  Such new
-versions will be similar in spirit to the present version, but may
-differ in detail to address new problems or concerns.  See
-http://www.gnu.org/copyleft/.
-</para><para>
-Each version of the License is given a distinguishing version number.
-If the Document specifies that a particular numbered version of this
-License "or any later version" applies to it, you have the option of
-following the terms and conditions either of that specified version or
-of any later version that has been published (not as a draft) by the
-Free Software Foundation.  If the Document does not specify a version
-number of this License, you may choose any version ever published (not
-as a draft) by the Free Software Foundation.
-</para>
-   </section><section><title>G.1.1 ADDENDUM: How to use this License for your documents</title>
-<para>
-To use this License in a document you have written, include a copy of
-the License in the document and put the following copyright and
-license notices just after the title page:
-</para>
-<para><literallayout>
-    Copyright (c)  YEAR  YOUR NAME.
-    Permission is granted to copy, distribute and/or modify this document
-    under the terms of the GNU Free Documentation License, Version 1.2
-    or any later version published by the Free Software Foundation;
-    with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
-    A copy of the license is included in the section entitled "GNU
-    Free Documentation License".
-</literallayout></para>
-<para>
-If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
-replace the "with...Texts." line with this:
-</para>
-<para><literallayout>
-    with the Invariant Sections being LIST THEIR TITLES, with the
-    Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
-</literallayout></para>
-<para>
-If you have Invariant Sections without Cover Texts, or some other
-combination of the three, merge those two alternatives to suit the
-situation.
-</para><para>
-If your document contains nontrivial examples of program code, we
-recommend releasing these examples in parallel under your choice of
-free software license, such as the GNU General Public License,
-to permit their use in free software.
-</para>
-</section>
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/flows.xxml igraph-0.6.5/doc/flows.xxml
--- igraph-0.6.5~quantal1/doc/flows.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/flows.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Flows">
-<title>Maximum Flows, Minimum Cuts and related measures</title>
-
-<section><title>Maximum Flows</title>
-<!-- doxrox-include igraph_maxflow -->
-<!-- doxrox-include igraph_maxflow_value -->
-<!-- doxrox-include igraph_dominator_tree -->
-</section>
-
-<section><title>Cuts and minimum cuts</title>
-<!-- doxrox-include igraph_st_mincut -->
-<!-- doxrox-include igraph_st_mincut_value -->
-<!-- doxrox-include igraph_all_st_cuts -->
-<!-- doxrox-include igraph_all_st_mincuts -->
-<!-- doxrox-include igraph_mincut -->
-<!-- doxrox-include igraph_mincut_value -->
-</section>
-
-<section><title>Connectivity</title>
-<!-- doxrox-include igraph_st_edge_connectivity -->
-<!-- doxrox-include igraph_edge_connectivity -->
-<!-- doxrox-include igraph_st_vertex_connectivity -->
-<!-- doxrox-include igraph_vertex_connectivity -->
-</section>
-
-<section><title>Edge- and Vertex-Disjoint Paths</title>
-<!-- doxrox-include igraph_edge_disjoint_paths -->
-<!-- doxrox-include igraph_vertex_disjoint_paths -->
-</section>
-
-<section><title>Graph Adhesion and Cohesion</title>
-<!-- doxrox-include igraph_adhesion -->
-<!-- doxrox-include igraph_cohesion -->
-</section>
-
-<section><title>Cohesive Blocks</title>
-<!-- doxrox-include igraph_cohesive_blocks -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/foreign.xxml igraph-0.6.5/doc/foreign.xxml
--- igraph-0.6.5~quantal1/doc/foreign.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/foreign.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Foreign">
-<title>Reading and Writing Graphs from and to Files</title>
-
-<!-- doxrox-include about_loadsave -->
-
-<section><title>Simple edge list and similar formats</title>
-<!-- doxrox-include igraph_read_graph_edgelist -->
-<!-- doxrox-include igraph_write_graph_edgelist -->
-<!-- doxrox-include igraph_read_graph_ncol -->
-<!-- doxrox-include igraph_write_graph_ncol -->
-<!-- doxrox-include igraph_read_graph_lgl -->
-<!-- doxrox-include igraph_write_graph_lgl -->
-<!-- doxrox-include igraph_read_graph_dimacs -->
-<!-- doxrox-include igraph_write_graph_dimacs -->
-</section>
-
-<section><title>Binary formats</title>
-<!-- doxrox-include igraph_read_graph_graphdb -->
-</section>
-
-<section><title>GraphML format</title>
-<!-- doxrox-include igraph_read_graph_graphml -->
-<!-- doxrox-include igraph_write_graph_graphml -->
-</section>
-
-<section><title>GML format</title>
-<!-- doxrox-include igraph_read_graph_gml -->
-<!-- doxrox-include igraph_write_graph_gml -->
-</section>
-
-<section><title>Pajek format</title>
-<!-- doxrox-include igraph_read_graph_pajek -->
-<!-- doxrox-include igraph_write_graph_pajek -->
-</section>
-
-<section><title>UCINET's DL file format</title>
-<!-- doxrox-include igraph_read_graph_dl -->
-</section>
-
-<section><title>Graphviz format</title>
-<!-- doxrox-include igraph_write_graph_dot -->
-</section>
-
-</chapter>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/frplots-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/frplots-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/frplots.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/frplots.png differ
diff -Nru igraph-0.6.5~quantal1/doc/generators.xxml igraph-0.6.5/doc/generators.xxml
--- igraph-0.6.5~quantal1/doc/generators.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/generators.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Generators">
-<title>Graph Generators</title>
-
-<!-- doxrox-include about_generators -->
-
-<section><title>Deterministic Graph Generators</title>
-<!-- doxrox-include igraph_create -->
-<!-- doxrox-include igraph_small -->
-<!-- doxrox-include igraph_adjacency -->
-<!-- doxrox-include igraph_weighted_adjacency -->
-<!-- doxrox-include igraph_adjlist -->
-<!-- doxrox-include igraph_star -->
-<!-- doxrox-include igraph_lattice -->
-<!-- doxrox-include igraph_ring -->
-<!-- doxrox-include igraph_tree -->
-<!-- doxrox-include igraph_full -->
-<!-- doxrox-include igraph_full_citation -->
-<!-- doxrox-include igraph_famous -->
-<!-- doxrox-include igraph_lcf -->
-<!-- doxrox-include igraph_lcf_vector -->
-<!-- doxrox-include igraph_atlas -->
-<!-- doxrox-include igraph_de_bruijn -->
-<!-- doxrox-include igraph_kautz -->
-<!-- doxrox-include igraph_extended_chordal_ring -->
-<!-- doxrox-include igraph_connect_neighborhood -->
-</section>
-
-<section><title>Games: Randomized Graph Generators</title>
-<!-- doxrox-include about_games -->
-<!-- doxrox-include igraph_grg_game -->
-<!-- doxrox-include igraph_barabasi_game -->
-<!-- doxrox-include igraph_erdos_renyi_game -->
-<!-- doxrox-include igraph_watts_strogatz_game -->
-<!-- doxrox-include igraph_rewire_edges -->
-<!-- doxrox-include igraph_degree_sequence_game -->
-<!-- doxrox-include igraph_k_regular_game -->
-<!-- doxrox-include igraph_static_fitness_game -->
-<!-- doxrox-include igraph_static_power_law_game -->
-<!-- doxrox-include igraph_forest_fire_game -->
-<!-- doxrox-include igraph_rewire -->
-<!-- doxrox-include igraph_growing_random_game -->
-<!-- doxrox-include igraph_callaway_traits_game -->
-<!-- doxrox-include igraph_establishment_game -->
-<!-- doxrox-include igraph_preference_game -->
-<!-- doxrox-include igraph_asymmetric_preference_game -->
-<!-- doxrox-include igraph_recent_degree_game -->
-<!-- doxrox-include igraph_barabasi_aging_game -->
-<!-- doxrox-include igraph_recent_degree_aging_game -->
-<!---doxrox-include igraph_lastcit_game -->
-<!-- doxrox-include igraph_cited_type_game -->
-<!-- doxrox-include igraph_citing_cited_type_game -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/gpl.xml igraph-0.6.5/doc/gpl.xml
--- igraph-0.6.5~quantal1/doc/gpl.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/gpl.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,444 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd">
-<section id="igraph-gpl">
-  <sectioninfo>
-    <edition>Version 2, June 1991</edition>
-    <copyright><year>1989</year><year>1991</year>
-    <holder> Free Software Foundation, Inc.
-       51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
-    </holder>
-    </copyright>
-    <legalnotice><para>
-    Everyone is permitted to copy and distribute verbatim copies
-    of this license document, but changing it is not allowed.
-    </para></legalnotice>
-  </sectioninfo>
-
-<title>THE GNU GENERAL PUBLIC LICENSE</title>
-<section><title>Preamble</title>
-
-<para>
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-</para>
-
-<para>
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-</para>
-
-<para>
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-</para>
-
-<para>
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-</para>
-
-<para>
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-</para>
-
-<para>
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-</para>
-
-<para>
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-</para>
-
-<para>
-  The precise terms and conditions for copying, distribution and
-modification follow.
-</para>
-
-</section>
-<section id="sectiongpl"><title>GNU GENERAL PUBLIC LICENSE</title>
-<subtitle>TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</subtitle>
-
-<para>
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-</para>
-
-<para>
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-</para>
-
-<para>
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-</para>
-
-<para>
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-</para>
-
-<para>
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-</para>
-<orderedlist numeration="loweralpha"><listitem><para>
-    You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-  </para></listitem><listitem><para>
-    You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-  </para></listitem><listitem><para>
-    If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-  </para></listitem></orderedlist>
-
-<para>
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-</para>
-
-<para>
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-</para>
-
-<para>
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-</para>
-
-<para>
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-</para>
-
-<orderedlist numeration="loweralpha"><listitem><para>
-    Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-</para></listitem><listitem><para>
-    Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-</para></listitem><listitem><para>
-    Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-</para></listitem></orderedlist>
-
-<para>
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-</para>
-
-<para>
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-</para>
-
-<para>
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-</para>
-
-<para>
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-</para>
-
-<para>
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-</para>
-
-<para>
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-</para>
-
-<para>
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-</para>
-
-<para>
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-</para>
-
-<para>
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-</para>
-
-<para>
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-</para>
-
-<para>
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-</para>
-
-<para>
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-</para>
-
-<para>
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-</para>
-<para>
-                            NO WARRANTY
-</para>
-
-<para>
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-</para>
-
-<para>
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-</para>
-
-<para>
-                     END OF TERMS AND CONDITIONS
-</para>
-
-</section>
-<section><title>How to Apply These Terms to Your New Programs</title>
-
-<para>
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-</para>
-
-<para>
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-</para>
-
-<para><literallayout>
-    &lt;one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) &lt;year>  &lt;name of author>
-
-    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 2 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, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-</literallayout></para>
-
-<para>
-Also add information on how to contact you by electronic and paper mail.
-</para>
-
-<para>
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-</para>
-
-<para><literallayout>
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-</literallayout></para>
-
-<para>
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-</para>
-
-<para>
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-</para>
-
-<para><literallayout>
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  &lt;signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-</literallayout></para>
-
-<para>
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
-</para>
-
-</section>
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/gtk-doc.xsl igraph-0.6.5/doc/gtk-doc.xsl
--- igraph-0.6.5~quantal1/doc/gtk-doc.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/gtk-doc.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,416 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version="1.0">
-
-  <!-- import the chunked XSL stylesheet -->
-  <xsl:import href="http://docbook.sourceforge.net/release/xsl/current/html/chunk.xsl"/>
-  <xsl:include href="devhelp.xsl"/>
-  <xsl:include href="version-greater-or-equal.xsl"/>
-
-  <!-- change some parameters -->
-  <xsl:param name="bibliography.collection">bibdatabase.xml</xsl:param>
-  <xsl:param name="bibliography.numbered">1</xsl:param>
-  <xsl:param name="toc.section.depth">0</xsl:param>
-  <xsl:param name="generate.section.toc.level">2</xsl:param>
-  <xsl:param name="generate.toc">
-    book	toc
-    chapter	toc
-    section     toc
-  </xsl:param>
-  
-  <xsl:param name="default.encoding" select="'US-ASCII'"/>
-  <xsl:param name="chunker.output.encoding" select="'US-ASCII'"/>
-  <xsl:param name="chunker.output.indent" select="'yes'"/>
-  <xsl:param name="chunk.fast" select="1"/> 
-  <xsl:param name="chunk.section.depth" select="1"/> 
-  <xsl:param name="chunk.first.sections" select="1"/> 
-  <xsl:param name="chapter.autolabel" select="1"/>
-  <xsl:param name="section.autolabel" select="1"/>
-  <xsl:param name="use.id.as.filename" select="1"/>
-  <xsl:param name="html.ext" select="'.html'"/>
-  <xsl:param name="refentry.generate.name" select="0"/>
-  <xsl:param name="refentry.generate.title" select="1"/>
-
-  <!-- use index filtering (if available) -->
-  <xsl:param name="index.on.role" select="1"/>
-
-  <!-- display variablelists as tables -->
-  <xsl:param name="variablelist.as.table" select="1"/>
-
-  <!-- this gets set on the command line ... -->
-  <xsl:param name="gtkdoc.version" select="''"/>
-  <xsl:param name="gtkdoc.bookname" select="''"/>
-
-  <!-- ========================================================= -->
-  <!-- template to create the index.sgml anchor index -->
-
-  <xsl:template match="book|article">
-    <xsl:variable name="tooldver">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.36</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="$tooldver = 0">
-      <xsl:message terminate="yes">
-FATAL-ERROR: You need the DocBook XSL Stylesheets version 1.36 or higher
-to build the documentation. 
-Get a newer version at http://docbook.sourceforge.net/projects/xsl/
-      </xsl:message>
-    </xsl:if>
-    <xsl:apply-imports/>
-
-    <!-- generate the index.sgml href index -->
-    <xsl:call-template name="generate.index"/>
-    <xsl:call-template name="generate.devhelp"/>
-  </xsl:template>
-
-  <xsl:template name="generate.index">
-    <xsl:call-template name="write.text.chunk">
-      <xsl:with-param name="filename" select="'index.sgml'"/>
-      <xsl:with-param name="content">
-        <!-- check all anchor and refentry elements -->
-        <xsl:apply-templates select="//anchor|//refentry"
-                             mode="generate.index.mode"/>
-      </xsl:with-param>
-      <xsl:with-param name="encoding" select="'utf-8'"/>
-    </xsl:call-template>
-  </xsl:template>
-
-  <xsl:template match="*" mode="generate.index.mode">
-    <xsl:if test="not(@href)">
-      <xsl:text>&lt;ANCHOR id=&quot;</xsl:text>
-      <xsl:value-of select="@id"/>
-      <xsl:text>&quot; href=&quot;</xsl:text>
-      <xsl:if test="$gtkdoc.bookname">
-        <xsl:value-of select="$gtkdoc.bookname"/>
-        <xsl:text>/</xsl:text>
-      </xsl:if>
-      <xsl:call-template name="href.target"/>
-      <xsl:text>&quot;&gt;
-</xsl:text>
-    </xsl:if>
-  </xsl:template>
-
-  <!-- ========================================================= -->
-  <!-- template to output gtkdoclink elements for the unknown targets -->
-
-  <xsl:template match="link">
-    <xsl:choose>
-      <xsl:when test="id(@linkend)">
-        <xsl:apply-imports/>
-      </xsl:when>
-      <xsl:otherwise>
-        <GTKDOCLINK HREF="{@linkend}">
-          <xsl:apply-templates/>
-        </GTKDOCLINK>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:template>
-
-  <!-- ========================================================= -->
-  <!-- Below are the visual portions of the stylesheet.  They provide
-       the normal gtk-doc output style. -->
-
-  <xsl:param name="shade.verbatim" select="0"/>
-  <xsl:param name="refentry.separator" select="0"/>
-
-  <xsl:template match="refsection">
-    <xsl:if test="preceding-sibling::refsection">
-      <hr/>
-    </xsl:if>
-    <xsl:apply-imports/>
-  </xsl:template>
-
-  <xsl:template name="user.head.content">
-    <script type="text/javascript" src="toggle.js"></script>
-    <xsl:if test="$gtkdoc.version">
-      <meta name="generator"
-            content="GTK-Doc V{$gtkdoc.version} (XML mode)"/>
-    </xsl:if>
-    <link rel="stylesheet" href="style.css" type="text/css"/>
-
-      <!-- copied from the html.head template in the docbook stylesheets
-           we don't want links for all refentrys, thats just too much
-        -->
-      <xsl:variable name="this" select="."/>
-      <xsl:for-each select="//part
-                            |//reference
-                            |//preface
-                            |//chapter
-                            |//article
-                            |//appendix[not(parent::article)]|appendix
-                            |//glossary[not(parent::article)]|glossary
-                            |//index[not(parent::article)]|index">
-        <link rel="{local-name(.)}">
-          <xsl:attribute name="href">
-            <xsl:call-template name="href.target">
-              <xsl:with-param name="context" select="$this"/>
-              <xsl:with-param name="object" select="."/>
-            </xsl:call-template>
-          </xsl:attribute>
-          <xsl:attribute name="title">
-            <xsl:apply-templates select="." mode="object.title.markup.textonly"/>
-          </xsl:attribute>
-        </link>
-      </xsl:for-each>
-  </xsl:template>
-
-  <xsl:template match="title" mode="book.titlepage.recto.mode">
-    <table class="navigation" width="100%"
-           cellpadding="2" cellspacing="0">
-      <tr>
-        <th valign="middle">
-          <p class="{name(.)}">
-            <xsl:value-of select="."/>
-          </p>
-        </th>
-      </tr>
-    </table>
-  </xsl:template>
-
-  <xsl:template name="header.navigation">
-    <xsl:param name="prev" select="/foo"/>
-    <xsl:param name="next" select="/foo"/>
-    <xsl:variable name="home" select="/*[1]"/>
-    <xsl:variable name="up" select="parent::*"/>
-
-    <xsl:if test="$suppress.navigation = '0' and $home != .">
-      <table class="navigation" width="100%"
-             summary = "Navigation header" cellpadding="2" cellspacing="2">
-        <tr valign="middle">
-          <xsl:if test="count($prev) > 0">
-            <td>
-              <a accesskey="p">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$prev"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="left.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-prev</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <xsl:if test="count($up) > 0 and $up != $home">
-            <td>
-              <a accesskey="u">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$up"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="up.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-up</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <xsl:if test="$home != .">
-            <td>
-              <a accesskey="h">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$home"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="home.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-home</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-          <th width="100%" align="center">
-            <xsl:apply-templates select="$home"
-                                 mode="object.title.markup"/>
-          </th>
-          <xsl:if test="count($next) > 0">
-            <td>
-              <a accesskey="n">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$next"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <img src="right.png" width="24" height="24" border="0">
-                  <xsl:attribute name="alt">
-                    <xsl:call-template name="gentext">
-                      <xsl:with-param name="key">nav-next</xsl:with-param>
-                    </xsl:call-template>
-                  </xsl:attribute>
-                </img>
-              </a>
-            </td>
-          </xsl:if>
-        </tr>
-      </table>
-    </xsl:if>
-  </xsl:template>
-
-  <xsl:template name="footer.navigation">
-    <xsl:param name="prev" select="/foo"/>
-    <xsl:param name="next" select="/foo"/>
-
-    <xsl:if test="$suppress.navigation = '0'">
-      <table class="navigation" width="100%"
-             summary="Navigation footer" cellpadding="2" cellspacing="0">
-        <tr valign="middle">
-          <td align="left">
-            <xsl:if test="count($prev) > 0">
-              <a accesskey="p">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$prev"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <b>
-                  <xsl:text>&lt;&lt;&#160;</xsl:text>
-                  <xsl:apply-templates select="$prev"
-                                       mode="object.title.markup"/>
-                </b>
-              </a>
-            </xsl:if>
-          </td>
-          <td align="right">
-            <xsl:if test="count($next) > 0">
-              <a accesskey="n">
-                <xsl:attribute name="href">
-                  <xsl:call-template name="href.target">
-                    <xsl:with-param name="object" select="$next"/>
-                  </xsl:call-template>
-                </xsl:attribute>
-                <b>
-                  <xsl:apply-templates select="$next"
-                                       mode="object.title.markup"/>
-                  <xsl:text>&#160;&gt;&gt;</xsl:text>
-                </b>
-              </a>
-            </xsl:if>
-          </td>
-        </tr>
-      </table>
-    </xsl:if>
-  </xsl:template>
-
-  <xsl:template name="user.footer.content">
-    <script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
-    </script>
-    <script type="text/javascript">
-      _uacct = "UA-1392972-1";
-      urchinTracker();
-    </script>
-  </xsl:template>
-
-  <!-- avoid creating multiple identical indices 
-       if the stylesheets don't support filtered indices
-    -->
-  <xsl:template match="index"> 
-    <xsl:variable name="has-filtered-index">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.66</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="($has-filtered-index = 1) or (count(@role) = 0)">
-      <xsl:apply-imports/>
-    </xsl:if> 
-  </xsl:template>
-
-  <xsl:template match="index" mode="toc">
-    <xsl:variable name="has-filtered-index">
-      <xsl:call-template name="version-greater-or-equal">
-        <xsl:with-param name="ver1" select="$VERSION" />
-        <xsl:with-param name="ver2">1.66</xsl:with-param>
-      </xsl:call-template>
-    </xsl:variable>
-    <xsl:if test="($has-filtered-index = 1) or (count(@role) = 0)">
-      <xsl:apply-imports/>
-    </xsl:if> 
-  </xsl:template>
- 
-  <xsl:template match="para">
-    <xsl:choose>
-      <xsl:when test="@role = 'gallery'">
-         <div class="container">
-           <div class="gallery-spacer"> </div>
-           <xsl:apply-templates mode="gallery.mode"/>
-         <div class="gallery-spacer"> </div>
-         </div>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:apply-imports/>
-      </xsl:otherwise> 
-    </xsl:choose>
-  </xsl:template>
-
-  <xsl:template match="link" mode="gallery.mode">
-    <div class="gallery-float">
-       <xsl:apply-templates select="."/>
-    </div>
-  </xsl:template>
-
-  <!-- add gallery handling to refnamediv template -->
-  <xsl:template match="refnamediv">
-    <div class="{name(.)}">
-      <table width="100%">
-        <tr><td valign="top">
-         <xsl:call-template name="anchor"/>
-           <xsl:choose>
-             <xsl:when test="$refentry.generate.name != 0">
-               <h2>
-                <xsl:call-template name="gentext">
-                  <xsl:with-param name="key" select="'RefName'"/>
-                </xsl:call-template>
-              </h2>
-            </xsl:when>
-            <xsl:when test="$refentry.generate.title != 0">
-              <h2>
-                <xsl:choose>
-                  <xsl:when test="../refmeta/refentrytitle">
-                    <xsl:apply-templates select="../refmeta/refentrytitle"/>
-                  </xsl:when>
-                  <xsl:otherwise>
-                    <xsl:apply-templates select="refname[1]"/>
-                  </xsl:otherwise>
-                </xsl:choose>
-              </h2>
-            </xsl:when>
-          </xsl:choose>
-          <p>
-            <xsl:apply-templates/>
-          </p>
-        </td>
-        <td valign="top" align="right">
-           <!-- find the gallery image to use here 
-                - determine the id of the enclosing refentry
-                - look for an inlinegraphic inside a link with linkend == refentryid inside a para with role == gallery
-                - use it here
-             -->
-           <xsl:variable name="refentryid" select="../@id"/>
-           <xsl:apply-templates select="//para[@role = 'gallery']/link[@linkend = $refentryid]/inlinegraphic"/>
-        </td></tr>
-       </table>
-     </div>
-  </xsl:template>
-
-  <xsl:template match="example">
-    <xsl:variable name="id" select="@id"/>
-    <div class="hideshow" onClick="toggle(this)">
-      <xsl:apply-imports />
-    </div>
-  </xsl:template>
-  
-</xsl:stylesheet>
diff -Nru igraph-0.6.5~quantal1/doc/heap.xxml igraph-0.6.5/doc/heap.xxml
--- igraph-0.6.5~quantal1/doc/heap.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/heap.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Heaps">
-<title>Maximum and minimum heaps</title>
-
-<!-- doxrox-include igraph_heap_init -->
-<!-- doxrox-include igraph_heap_init_array -->
-<!-- doxrox-include igraph_heap_destroy -->
-<!-- doxrox-include igraph_heap_empty -->
-<!-- doxrox-include igraph_heap_push -->
-<!-- doxrox-include igraph_heap_top -->
-<!-- doxrox-include igraph_heap_delete_top -->
-<!-- doxrox-include igraph_heap_size -->
-<!-- doxrox-include igraph_heap_reserve -->
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/bugs.html.in igraph-0.6.5/doc/homepage/bugs.html.in
--- igraph-0.6.5~quantal1/doc/homepage/bugs.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/bugs.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-<h2>Bug reports, questions, comments</h2>
-
-<h3>Reporting bugs at Launchpad</h3>
-
-<p>We suggest to report igraph bugs on the Launchpad website by
-  clicking on the first button in the menu on the bottom of the page. This
-  allows you to follow up on your bug report, e.g. get an email
-  notification when it is fixed. Please check the
-  <a href="https://bugs.launchpad.net/igraph/+bugs">list of bugs</a>
-  before clicking on the button below to report a new bug.
-</p>
-
-<h3>Sending bug reports in email</h3>
-
-If you prefer not to use Launchpad, you can report bugs on
-the <code>igraph-help</code> mailing list. You can find more
-information on <code>igraph-help</code> 
-<a href="support.html">here.</a> 
diff -Nru igraph-0.6.5~quantal1/doc/homepage/documentation.html.in igraph-0.6.5/doc/homepage/documentation.html.in
--- igraph-0.6.5~quantal1/doc/homepage/documentation.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/documentation.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,109 +0,0 @@
-<h2>Documentation</h2>
-
-<p>The latest released version of the igraph library is <b>$VERSION</b>.</p>
-
-<ul class="no-bullet download">
-<li class="download download-r">
-  <span class="name">R package</span>
-  <span class="comment">&mdash; for those who use igraph from R.</span>
-  <ul class="download-links">
-    <li class="download-external">
-       <a href="doc/R/00Index.html"
-          onClick="javascript:urchinTracker ('/docs/rhtml'); ">
-      <a href="doc/R/00Index.html">
-	 Browse online</a>
-    </li>
-    <li class="download-pdf">
-       <a href="doc/R/igraph.pdf" 
-          onClick="javascript:urchinTracker ('/docs/rpdf'); "> 
-      <a href="doc/R/igraph.pdf">
-         PDF file</a>
-    </li>
-  </ul>
-  <div class="comment">
-  <div>Note that this documentation is included in the R
-  package. You can use <code>library(help="igraph")</code>
-  as a starting point.</div>
-  <div>Another option is typing <code>help.start()</code>,
-  choosing <i>Packages</i> and then <i>igraph</i>. Both of these
-  methods require that the igraph package is installed on your
-  system.</div>
-  </div>
-</li>
-
-<li class="download download-python">
-  <span class="name">Python interface</span>
-  <span class="comment">&mdash; for those who use the igraph Python
-  module</span>
-  <ul class="download-links">
-    <li class="download-external">
-	  <a href="http://hal.elte.hu/~nepusz/development/igraph/tutorial/tutorial.html"
-		  onClick="javascript:urchinTracker ('/docs/pythontutorial'); ">
-         Tutorial &mdash; Read online</a>
-    </li>
-    <li class="download-external">
-       <a href="doc/python/index.html"
-          onClick="javascript:urchinTracker ('/docs/pythonhtml'); "> 
-         Reference manual &mdash; Browse online</a>
-    </li>
-    <li class="download-pdf">
-       <a href="doc/python/igraph.pdf" 
-          onClick="javascript:urchinTracker ('/docs/pythonpdf'); "> 
-         Reference manual &mdash; PDF file</a>
-    </li>
-  </ul>
-  <div class="comment">Documentation for the Python interface
-  is also included in the Python docstrings, so you can use
-  <code>pydoc</code> or the built-in Python help facility as well.
-  </div>
-</li>
-
-<li class="download download-c">
-  <span class="name">igraph Reference Manual</span>
-  <span class="comment">&mdash; for those who want to use the C library
-  directly</span>
-  <ul class="download-links">
-    <li class="download-external">
-      <a href="doc/html/index.html">Browse online</a>
-    </li>
-    <li class="download-pdf">
-       <a href="doc/igraph-docs.pdf" 
-          onClick="javascript:urchinTracker ('/docs/pdf'); "> 
- 	 PDF file</a>
-    </li>
-    <li class="download-html">
-       <a href="doc/igraph-docs-${VERSION}.tar.gz" 
-          onClick="javascript:urchinTracker ('/docs/htmlbundle'); "> 
- 	 HTML bundle</a> 
-    </li>
-    <li class="download-info">
-       <a href="doc/igraph.info"
-          onClick="javascript:urchinTracker ('/docs/info'); "> 
- 	 GNU info document</a>
-    </li>
-  </ul>
-  <div class="comment">
-  <div>Note that the GNU info document is 
-  included in the source package of the C library.</div>
-  <div>The original XML DocBook format of the
-  manual can be obtained by downloading the latest igraph
-  development version from
- <a href="https://launchpad.net/igraph"
-    onClick="javascript:urchinTracker ('/launchpad'); ">
-  Launchpad</a>.</div>
-  </div>
-</li>
-
-<li class="download download-wiki">
-  <span class="name">igraph wiki at wikidot (external site)</span>
-  <span class="comment">&mdash; a collaborative effort of the community</span>
-  <ul class="download-links">
-    <li class="download-external">
-      <a href="http://igraph.wikidot.com">Browse online</a>
-    </li>
-  </ul>
-  
-</li>
-
-
-</ul>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/download.html.in igraph-0.6.5/doc/homepage/download.html.in
--- igraph-0.6.5~quantal1/doc/homepage/download.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/download.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,132 +0,0 @@
-<h2>Download</h2>
-
-<p>The latest released version of the igraph library is <b>$VERSION</b>.</p>
-
-<ul class="no-bullet download">
-<li class="download download-r">
-  <span class="name">R package</span>
-  <span class="comment">&mdash; Download this if you prefer using the
-  GNU R Statistical Environment</span><br/>
-  <ul class="download-links">
-    <li><span class="comment">The simplest way to install the igraph R package is
-	typing <b><code>install.packages("igraph")</code></b> in your R session, 
-        please try this before downloading from here.</span><br/>
-    </li>
-    <li class="download-windows">
-       <a href="http://sourceforge.net/projects/igraph/files/R%20Windows%20binary%20package/${VERSION}/igraph_${VERSION}.zip/download"
-          onClick="javascript:urchinTracker ('/downloads/rwindowsbinary'); ">
-          Windows binary</a> 
-    </li>
-    <li class="download-osx">
-       <a href="http://sourceforge.net/projects/igraph/files/R%20MacOSX%20binary%20package/${VERSION}/igraph_${VERSION}.tgz/download"
-          onClick="javascript:urchinTracker ('/downloads/rosxbinary'); "> 
-          Mac OSX universal binary</a>
-    </li>
-    <li class="download-source">
-       <a href="http://sourceforge.net/projects/igraph/files/R%20source%20package/${VERSION}/igraph_${VERSION}.tar.gz/download"
-       onClick="javascript:urchinTracker ('/downloads/rsource'); "> 
-        Source package (for Linux and similar)</a>
-    </li>
-  </ul>
-</li>
-
-<li class="download download-python">
-  <span class="name">Python extension module</span>
-  <span class="comment">&mdash; Download this if you would like to use
-  igraph as a Python extension module</span>
-  <ul class="download-links">
-    <li class="download-windows">
-       <a href="http://pypi.python.org/packages/3.2/p/python-igraph/python-igraph-${VERSION}.win32-py3.2.msi" 
-          onClick="javascript:urchinTracker ('/downloads/pywin27'); "> 
-          Windows installer for Python 3.2</a> 
-    </li>
-    <li class="download-windows">
-       <a href="http://pypi.python.org/packages/2.7/p/python-igraph/python-igraph-${VERSION}.win32-py2.7.msi" 
-          onClick="javascript:urchinTracker ('/downloads/pywin27'); "> 
-          Windows installer for Python 2.7</a> 
-    </li>
-    <li class="download-windows">
-       <a href="http://pypi.python.org/packages/2.6/p/python-igraph/python-igraph-${VERSION}.win32-py2.6.msi" 
-          onClick="javascript:urchinTracker ('/downloads/pywin26'); "> 
-          Windows installer for Python 2.6</a> 
-    </li>
-    <li class="download-osx">
-       <a href="http://pypi.python.org/packages/2.7/p/python-igraph/python_igraph-${VERSION}-py2.7-macosx10.7.dmg" 
-          onClick="javascript:urchinTracker ('/downloads/py27macosx107'); "> 
-          OS X Lion installer (Python 2.7)</a> 
-    </li>
-    <li class="download-osx">
-       <a href="http://pypi.python.org/packages/2.6/p/python-igraph/python_igraph-${VERSION}-py2.6-macosx10.7.dmg" 
-          onClick="javascript:urchinTracker ('/downloads/py26macosx107'); "> 
-          OS X Lion installer (Python 2.6)</a> 
-    </li>
-    <li class="download-source">
-       <a href="http://pypi.python.org/packages/source/p/python-igraph/python-igraph-${VERSION}.tar.gz"
-          onClick="javascript:urchinTracker ('/downloads/pysource'); ">
-          Source code</a>  
-    </li>
-    <li class="download-external">
-       <a href="http://python.org/pypi/python-igraph" 
-          onClick="javascript:urchinTracker ('/outgoing/pythoncheeseshop'); "> 
-          Python Package Index page</a>
-    </li>
-  </ul>
-</li>
-
-<li class="download download-c">
-  <span class="name">C library</span>
-  <span class="comment">&mdash; This is what you need if you intend to use
-  igraph in C projects.</span>
-  <ul class="download-links">
-    <li class="download-source">
-       <a onClick="javascript:urchinTracker ('/downloads/library'); " 
- 	 href="http://sourceforge.net/projects/igraph/files/C%20library/${VERSION}/igraph-${VERSION}.tar.gz/download">Source code</a>
-    </li>
-    <li class="download-source">
-      <a onClick="javascript:urchinTracker ('/downloads/msvc'); "
-	 href="http://sourceforge.net/projects/igraph/files/Visual%20studio/${VERSION}/igraph-${VERSION}-msvc.zip/download">Source code for Microsoft Visual Studio</a>
-  </ul>
-</li>
-
-<li class="download download-sf">
-  <span class="name">Browse all igraph releases</span>
-  <span class="comment">&mdash; All file releases at
-  SourceForge</span>
-  <ul class="download-links">
-    <li class="download-external">
-       <a onClick="javascript:urchinTracker ('/downloads/sourceforge'); " 
- 	 href="https://sourceforge.net/projects/igraph/files/">Go to SourceForge</a>
-    </li>
-  </ul>
-</li>
-  
-  
-
-</ul>
-
-<h3>Debian/Ubuntu Linux packages</h3>
-
-<p>
-Debian/Ubuntu packages for igraph and its Python interface are
-available for both i386, amd64 and lpia archtectures from Launchpad.
-See the page of the package archive at
-<a href="https://launchpad.net/~igraph/+archive/ppa">
-https://launchpad.net/~igraph/+archive/ppa</a> for more
-instructions. The old package archive at
-<a href="http://cneurocvs.rmki.kfki.hu/packages">
-http://cneurocvs.rmki.kfki.hu/packages</a> is not updated any
-more.
-
-<a name="dev"></a><h3>Obtaining the development version</h3>
-
-<p>You can download nightly builds from the development version of igraph 
-from the 
-<a href="https://code.google.com/p/igraph/downloads/list"> google
-  code website</a>. You can find the C library, R source  
-packages and Python source packages here.
-</p>
-
-<p>Alternatively you can get the (absolute latest) development version
-  of igraph (including the C core and the wrappers for R and Python)
-  from <a href="https://launchpad.net/igraph">Launchpad</a>.
-</p>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/ERcomps.py igraph-0.6.5/doc/homepage/examples/ERcomps.py
--- igraph-0.6.5~quantal1/doc/homepage/examples/ERcomps.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/ERcomps.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-from igraph import *
-
-g = Graph.Erdos_Renyi(n=300, m=250)
-colors = ["lightgray", "cyan", "magenta", "yellow", "blue", "green", "red"]
-components = g.components()
-for component in components:
-  color = colors[min(6, len(component)-1)]
-  g.vs[component]["color"] = color
-  
-plot(g, layout="fr", vertex_label=None)
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/animation.R igraph-0.6.5/doc/homepage/examples/animation.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/animation.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/animation.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-library(igraph)
-
-g <- read.graph("karate.net", format="pajek")
-l <- layout.kamada.kawai(g, niter=1000)
-ebc <- edge.betweenness.community(g)
-
-colbar <- rainbow(6)
-colbar2 <- c(rainbow(5), rep("black",15))
-
-for (i in 1:20) {
-
-  g2 <- delete.edges(g, ebc$removed.edges[seq(length=i-1)])
-  
-  eb <- edge.betweenness(g2)
-  cl <- clusters(g2)$membership
-  q <- modularity(g, cl)
-
-  E(g2)$color <- "grey"
-  E(g2)[ order(eb, decreasing=TRUE)[1:5] ]$color <- colbar2[1:5]
-
-  E(g2)$width <- 1
-  E(g2)[ color != "grey" ]$width <- 2
-
-  # png(sprintf("eb-community-%04d.png", i))
-  plot(g2, layout=l, vertex.size=6, vertex.label=NA,
-       edge.label.color="red", vertex.color=colbar[cl+2],
-       edge.label.font=2)
-  title(main=paste("Q=", round(q,3)), font=2)
-  ty <- seq(1,by=-strheight("1")*1.5, length=20)
-  text(-1.3, ty, adj=c(0,0.5), round(sort(eb, dec=TRUE)[1:20],2), col=colbar2,
-       font=2)
-
-  # dev.off()
-  if (interactive()) Sys.sleep(1)
-}
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/degreedist.R igraph-0.6.5/doc/homepage/examples/degreedist.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/degreedist.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/degreedist.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-library(igraph)
-
-g <- barabasi.game(100000)
-d <- degree(g, mode="in")
-dd <- degree.distribution(g, mode="in", cumulative=TRUE)
-alpha <- power.law.fit(d, xmin=20)
-plot(dd, log="xy", xlab="degree", ylab="cumulative frequency",
-     col=1, main="Nonlinear preferential attachment")
-lines(10:500, 10*(10:500)^(-coef(alpha)+1))
-
-powers <- c(0.9, 0.8, 0.7, 0.6)
-for (p in seq(powers)) {
-  g <- barabasi.game(100000, power=powers[p])
-  dd <- degree.distribution(g, mode="in", cumulative=TRUE)
-  points(dd, col=p+1, pch=p+1)
-}
-
-legend(1, 1e-5, c(1,powers), col=1:5, pch=1:5, ncol=1, yjust=0, lty=0)
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/dendrogram.R igraph-0.6.5/doc/homepage/examples/dendrogram.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/dendrogram.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/dendrogram.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-library(igraph)
-g <- read.graph("karate.net", format="pajek")
-
-wt <- walktrap.community(g, modularity=TRUE)
-dend <- as.dendrogram(wt, use.modularity=TRUE)
-plot(dend, nodePar=list(pch=c(NA, 20)))
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/diameter.R igraph-0.6.5/doc/homepage/examples/diameter.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/diameter.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/diameter.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-library(igraph)
-
-g <- read.graph("karate.net", format="pajek")
-d <- get.diameter(g)
-
-E(g)$color <- "grey"
-E(g)$width <- 1
-E(g, path=d)$color <- "red"
-E(g, path=d)$width <- 2
-V(g)$label.color <- "blue"
-V(g)$color  <- "SkyBlue2"
-V(g)[ d ]$label.color <- "black"
-V(g)[ d ]$color <- "red"
-
-plot(g, layout=layout.fruchterman.reingold, 
-     vertex.label.dist=0, vertex.size=15)
-title(main="Diameter of the Zachary Karate Club network",
-      xlab=paste("created by igraph", packageVersion("igraph")))
-axis(1, labels=FALSE, tick=TRUE)
-axis(2, labels=FALSE, tick=TRUE)
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/fralgo.R igraph-0.6.5/doc/homepage/examples/fralgo.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/fralgo.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/fralgo.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-library(igraph)
-
-source("frgraphs.R")
-graphs <- frgraphs()
-lay <- lapply(graphs, layout.fruchterman.reingold, niter=3000)
-
-# png(file="frplots.png")
-par(mai=c(0,0,0,0))
-layout(matrix(1:16, nr=4, byrow=TRUE))
-layout.show(16)
-for (i in seq(along=graphs)) {
-  plot(graphs[[i]], layout=lay[[i]],
-       vertex.label=NA, vertex.size=13, edge.color="black",
-       vertex.color="red")
-}
-# dev.off()
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/frgraphs.R igraph-0.6.5/doc/homepage/examples/frgraphs.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/frgraphs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/frgraphs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-
-frgraphs <- function() {
-  graphs <- list()
-  graphs[[1]] <- graph.full(5)
-  graphs[[2]] <- graph.full(4)
-  graphs[[3]] <- graph.full(6)
-  graphs[[4]] <- graph.full(6)
-  graphs[[5]] <- graph.full(8)
-  graphs[[6]] <- graph.full(2)
-  graphs[[7]] <- graph.formula( A-B-C-D-A, A-F, B-G, C-H, D-I )
-  graphs[[8]] <- graph.formula( A-B-C-A, D-E-F-D, A-D )
-  graphs[[9]] <- graph.ring(5)
-  graphs[[10]] <- graph.formula( A-B-C-A, B-D-E-B, C-E-F-C,
-                                D-G-H-D, E-H-I-E, F-I-J-F )
-  graphs[[11]] <- graph.formula( A-B-C-D-A, A-C, B-D,
-                                A-E-F-G-A, A-F, E-G,
-                                B-H-I-J-B, B-I, H-J,
-                                C-K-L-M-C, C-L, K-M,
-                                D-N-O-P-D, D-O, N-P )
-  graphs[[12]] <- graph.formula( A-B-C-D-F-E-A, A-D, E-C, B-F)
-  graphs[[13]] <- graph.formula( A-B:D:H, B-F:G, C-D:E:I, D-F, E-F:L, F-G:I:J:M,
-                                G-N, H-K:L, I-K, J-M:N, K-M, L-N )
-  graphs[[14]] <- simplify(graph.formula( A-B:H:L, B-A:C:K, C-B:D:M, D-C:E:L:M:N,
-                                         E-D:F:G, F-E:I:L, G-E:H:N, H-A:G:J,
-                                         I-F:J:K, J-H:I:M, K-B:I:N, L-A:D:F,
-                                         M-C:D:J, N-D:G:K ))
-  graphs[[15]] <- graph.formula( A-B-C-D-E-F-G-H-I-A,
-                                J-E:A:F, K-A:F:B, L-F:B:G, M-B:G:C, N-G:C:H,
-                                O-C:H:D, P-H:D:I, Q-D:I:E, R-I:E:A )
-  graphs[[16]] <- graph.formula( 0-1:4:8:11:15:19:22, 1-0:2:6:24, 2-1:3:5:23:29:30,
-                                3-2, 4-0:5, 5-2:4:6:9, 6-1:5:8:31:7:30, 7-6:30:31,
-                                8-0:6:9:13, 9-5:8:12:32:10:31, 10-9, 11-0:12,
-                                12-9:11:26:13, 13-8:12:27:33:14:32, 14-13:32:33,
-                                15-0:16, 16-15:20:17:26, 17-16:19:35:18:34:27,
-                                18-17:34:35, 19-0:24:20:17, 20-19:23:36:21:35:16,
-                                21-20, 22-0:23, 23-22:2:24:20, 24-23:1:29:25:36:19,
-                                25-24:29:36, 26-16:12:33:27:34, 27-26:13:28:17,
-                                28-27, 29-2:24:25, 30-2:6:7, 31-6:7:9,
-                                32-9:13:14, 33-13:14:26, 34-26:17:18, 35-17:18:20,
-                                36-20:24:25 )
-  graphs[[16]] <- simplify(graphs[[16]])
-  graphs
-}
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/karate.net igraph-0.6.5/doc/homepage/examples/karate.net
--- igraph-0.6.5~quantal1/doc/homepage/examples/karate.net	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/karate.net	1970-01-01 00:00:00.000000000 +0000
@@ -1,80 +0,0 @@
-*vertices 34
-*edges
-1 32
-1 22
-1 20
-1 18
-1 14
-1 13
-1 12
-1 11
-1 9
-1 8
-1 7
-1 6
-1 5
-1 4
-1 3
-1 2
-2 31
-2 22
-2 20
-2 18
-2 14
-2 8
-2 4
-2 3
-3 14
-3 9
-3 10
-3 33
-3 29
-3 28
-3 8
-3 4
-4 14
-4 13
-4 8
-5 11
-5 7
-6 17
-6 11
-6 7
-7 17
-9 34
-9 33
-9 33
-10 34
-14 34
-15 34
-15 33
-16 34
-16 33
-19 34
-19 33
-20 34
-21 34
-21 33
-23 34
-23 33
-24 30
-24 34
-24 33
-24 28
-24 26
-25 32
-25 28
-25 26
-26 32
-27 34
-27 30
-28 34
-29 34
-29 32
-30 34
-30 33
-31 34
-31 33
-32 34
-32 33
-33 34
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/kautz.py igraph-0.6.5/doc/homepage/examples/kautz.py
--- igraph-0.6.5~quantal1/doc/homepage/examples/kautz.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/kautz.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-from igraph import *
-
-g = Graph.Kautz(m=3, n=2)
-adj = g.get_adjacency()
-fig = Plot(bbox=(480, 480))
-fig.add(g, layout="fr", vertex_label=None)
-fig.add(adj, bbox=(360, 0, 480, 120), grid_width=0, opacity=0.7)
-fig.show()
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/mst.py igraph-0.6.5/doc/homepage/examples/mst.py
--- igraph-0.6.5~quantal1/doc/homepage/examples/mst.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/mst.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-from igraph import *
-
-def distance(p1, p2):
-    return ((p1[0]-p2[0]) ** 2 + (p1[1]-p2[1]) ** 2) ** 0.5
-    
-g = Graph.GRG(100, 0.2)
-layout = Layout(zip(g.vs["x"], g.vs["y"]))
-
-weights = [distance(layout[edge.source], layout[edge.target]) for edge in g.es]
-max_weight = max(weights)
-g.es["width"] = [6 - 5*weight/max_weight for weight in weights]
-mst = g.spanning_tree(weights)
-
-fig = Plot()
-fig.add(g, layout=layout, opacity=0.25, vertex_label=None)
-fig.add(mst, layout=layout, edge_color="red", vertex_label=None)
-fig.show()
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/tkplot.R igraph-0.6.5/doc/homepage/examples/tkplot.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/tkplot.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/tkplot.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-library(igraph)
-g <- read.graph("karate.net", format="pajek")
-
-cs <- leading.eigenvector.community(g, steps=1)
-V(g)$color <- ifelse(cs$membership==1, "lightblue", "green")
-
-scale <- function(v, a, b) {
-  v <- v-min(v) ; v <- v/max(v) ; v <- v * (b-a) ; v+a
-}
-
-V(g)$size <- scale(abs(cs$eigenvectors[[1]]), 10, 20)
-E(g)$color <- "grey"
-E(g)[ V(g)[ color=="lightblue" ] %--% V(g)[ color=="green" ] ]$color <- "red"
-
-tkplot(g, layout=layout.kamada.kawai, vertex.label.font=2)
diff -Nru igraph-0.6.5~quantal1/doc/homepage/examples/transparency.R igraph-0.6.5/doc/homepage/examples/transparency.R
--- igraph-0.6.5~quantal1/doc/homepage/examples/transparency.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/examples/transparency.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-library(igraph)
-
-g <- barabasi.game(100, power=0.6, m=10)
-V(g)$name <- seq(vcount(g))
-g <- simplify(g)
-l <- layout.fruchterman.reingold(g)
-l <- layout.norm(l, -1,1, -1,1) 
-
-fcs <- fastgreedy.community(simplify(as.undirected(g)))
-Q <- round(modularity(fcs), 3)
-
-# png(file="fastgreedy.png")
-
-plot(g, layout=l, vertex.size=3, vertex.label=NA, vertex.color="#ff000033",
-     vertex.frame.color="#ff000033", edge.color="#55555533", edge.arrow.size=0.3,
-     rescale=FALSE, xlim=range(l[,1]), ylim=range(l[,2]),
-     main=paste(sep="", "Fast greedy community detection,\nQ=", Q))
-
-g2 <- induced.subgraph(g, communities(fcs)[[1]])
-l2 <- l[ communities(fcs)[[1]], ]
-
-plot(g2, layout=l2, vertex.size=3, vertex.label=V(g2)$name,
-     vertex.color="#ff0000", vertex.frame.color="#ff0000", edge.color="#555555",
-     vertex.label.dist=0.5, vertex.label.cex=0.8, vertex.label.font=2,
-     edge.arrow.size=0.3, add=TRUE, rescale=FALSE)
-
-nodes <- communities(fcs)[[1]]
-nodes <- paste(collapse=", ", nodes)
-text(0,-1.3, nodes, col="blue")
-
-# dev.off()
diff -Nru igraph-0.6.5~quantal1/doc/homepage/features.html.in igraph-0.6.5/doc/homepage/features.html.in
--- igraph-0.6.5~quantal1/doc/homepage/features.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/features.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-<h2>Features</h2>
-
-<p>Here are some features of <b>igraph</b>, a subset of the functionality,
-see <i>The igraph reference manual</i> under <a
-href="documentation.html">Documentation</a> for more details.</p>
-
-<ul>
-<li><b>igraph</b> contains functions for generating regular and random graphs
-according to many algorithms and models from the network theory
-literature.</li>
-<li><b>igraph</b> provides routines for manipulating graphs, adding and removing
-    edges and vertices.</li>
-<li>You can assign numeric or textual attribute to the vertices or edges 
-    of the graph, like edge weights or textual vertex ids.</li>
-<li>A rich set of functions calculating various structural properties,
-    eg. betweenness, PageRank, k-cores, network motifs, 
-    etc. are also included.</li>
-<li>Force based layout generators for small and large graphs</li>
-<li>The R package and the Python module can visualize graphs many ways, 
-    in 2D and 3D, interactively or non-interactively.</li>
-<li><b>igraph</b> provides data types for implementing your own algorithm in 
-    C, R, Python or Ruby.</li>
-<li>Community structure detection algorithms using many recently developed
-    heuristics.</li>
-<li><b>igraph</b> can read and write many file formats, e.g., GraphML, GML or Pajek.
-    </li>
-<li><b>igraph</b> contains efficient functions for deciding graph isomorphism and
-    subgraph isomorphism</li>
-<li>It also contains an implementation of the push/relabel algorithm
-     for calculating maximum network flow, and this way minimum cuts,
-     vertex and edge connectivity.</li>
-<li><b>igraph</b> is well documented both for users and developers.</li>
-<li><b>igraph</b> is open source and distributed under GNU GPL.</li>
-</ul>
-
-<div class="back"><a href="index.html">&laquo; Back to main page</a></div>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/frgraphs.R igraph-0.6.5/doc/homepage/frgraphs.R
--- igraph-0.6.5~quantal1/doc/homepage/frgraphs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/frgraphs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-
-frgraphs <- function() {
-  graphs <- list()
-  graphs[[1]] <- graph.full(5)
-  graphs[[2]] <- graph.full(4)
-  graphs[[3]] <- graph.full(6)
-  graphs[[4]] <- graph.full(6)
-  graphs[[5]] <- graph.full(8)
-  graphs[[6]] <- graph.full(2)
-  graphs[[7]] <- graph.formula( A-B-C-D-A, A-F, B-G, C-H, D-I )
-  graphs[[8]] <- graph.formula( A-B-C-A, D-E-F-D, A-D )
-  graphs[[9]] <- graph.ring(5)
-  graphs[[10]] <- graph.formula( A-B-C-A, B-D-E-B, C-E-F-C,
-                                D-G-H-D, E-H-I-E, F-I-J-F )
-  graphs[[11]] <- graph.formula( A-B-C-D-A, A-C, B-D,
-                                A-E-F-G-A, A-F, E-G,
-                                B-H-I-J-B, B-I, H-J,
-                                C-K-L-M-C, C-L, K-M,
-                                D-N-O-P-D, D-O, N-P )
-  graphs[[12]] <- graph.formula( A-B-C-D-F-E-A, A-D, E-C, B-F)
-  graphs[[13]] <- graph.formula( A-B:D:H, B-F:G, C-D:E:I, D-F, E-F:L, F-G:I:J:M,
-                                G-N, H-K:L, I-K, J-M:N, K-M, L-N )
-  graphs[[14]] <- simplify(graph.formula( A-B:H:L, B-A:C:K, C-B:D:M, D-C:E:L:M:N,
-                                         E-D:F:G, F-E:I:L, G-E:H:N, H-A:G:J,
-                                         I-F:J:K, J-H:I:M, K-B:I:N, L-A:D:F,
-                                         M-C:D:J, N-D:G:K ))
-  graphs[[15]] <- graph.formula( A-B-C-D-E-F-G-H-I-A,
-                                J-E:A:F, K-A:F:B, L-F:B:G, M-B:G:C, N-G:C:H,
-                                O-C:H:D, P-H:D:I, Q-D:I:E, R-I:E:A )
-  graphs[[16]] <- graph.formula( 0-1:4:8:11:15:19:22, 1-0:2:6:24, 2-1:3:5:23:29:30,
-                                3-2, 4-0:5, 5-2:4:6:9, 6-1:5:8:31:7:30, 7-6:30:31,
-                                8-0:6:9:13, 9-5:8:12:32:10:31, 10-9, 11-0:12,
-                                12-9:11:26:13, 13-8:12:27:33:14:32, 14-13:32:33,
-                                15-0:16, 16-15:20:17:26, 17-16:19:35:18:34:27,
-                                18-17:34:35, 19-0:24:20:17, 20-19:23:36:21:35:16,
-                                21-20, 22-0:23, 23-22:2:24:20, 24-23:1:29:25:36:19,
-                                25-24:29:36, 26-16:12:33:27:34, 27-26:13:28:17,
-                                28-27, 29-2:24:25, 30-2:6:7, 31-6:7:9,
-                                32-9:13:14, 33-13:14:26, 34-26:17:18, 35-17:18:20,
-                                36-20:24:25 )
-  graphs[[16]] <- simplify(graphs[[16]])
-  graphs
-}
diff -Nru igraph-0.6.5~quantal1/doc/homepage/generate.py igraph-0.6.5/doc/homepage/generate.py
--- igraph-0.6.5~quantal1/doc/homepage/generate.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/generate.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,91 +0,0 @@
-#!/usr/bin/env python
-"""
-Homepage generator for igraph.
-
-Usage: ./generate.py version [newsfile]
-"""
-
-import sys
-import string
-import glob
-import os.path
-import re
-import HTMLParser
-
-def detect_newsfile():
-    """Tries to detect the full path of the NEWS file"""
-    dirs = [".", "..", os.path.join("..", "..")]
-    for d in dirs:
-	fname = os.path.join(d, "NEWS")
-	if os.path.exists(fname): return fname
-    raise ValueError, "NEWS file not found"
-
-def process_newsfile(fname):
-    """Processes the NEWS file and formats its content in HTML"""
-    news = open(fname).read()
-    
-    # Add some <code> tags
-    reg = re.compile(r"(?P<func>\w*_\w*)")
-    news = reg.sub("<code>\g<func></code>", news)
-
-    # Titles are wrapped in <h3>
-    reg = re.compile(r"^=====*\n(?P<title>[^\n]*)\n====*\n", re.MULTILINE | re.DOTALL)
-    news = reg.sub("</p><h3>\g<title></h3><p class=\"news\">", news)
-    
-    # Lists are wrapped in <ol>
-    reg = re.compile(r"\n(?P<lines>(^\s*\n|^(- |  )[^\n]*\n)+)[\s]*\n(?P<n>[^-])", re.MULTILINE)
-    news = reg.sub("\n</p><ul class=\"newslist\">\n\g<lines></ul>\n<p class=\"news\">\n\g<n>", news)
-    
-    # List items are wrapped in <li>
-    reg = re.compile(r"^- (?P<entry>.*?)(?=(</ul>)|(^$)|(^-[ ])|(\Z))", re.MULTILINE | re.DOTALL)
-    news = reg.sub("<li>\g<entry></li>", news)
-    
-    # Paragraphs are separated by empty lines
-    reg = re.compile(r"^[\s]*$", re.MULTILINE)
-    news = reg.sub("</p><p class=\"news\">", news)
-    news = "<p>" + news + "</p>"
-    
-    # Replace URLs
-    reg = re.compile(r"(?P<url>https?://[^\n ]+)")
-    news = reg.sub("<a href=\"\g<url>\">\g<url></a>", news)
-    
-    # Add subheadings in <h4> tags
-    reg = re.compile(r"^(?P<text>.*)\n-------*$", re.MULTILINE)
-    news = reg.sub("<h4 class=\"news\">\g<text></h4>", news)
-    
-    return news
-
-def addExamples(text):
-    ex=re.search("<example[^>]*>", text)
-    while ex:
-        exfile=re.search(' file="([^"]*)"', ex.group()).groups()[0]
-        extext=open("examples/" + exfile).read()
-        text = text[0:ex.start()] + extext + text[ex.end():]
-        ex=re.search("<example[^>]*>", text)
-    return text
-
-if len(sys.argv)<2:
-    print __doc__
-    sys.exit(1)
-
-version = sys.argv[1]
-if len(sys.argv)>= 3:
-    newsfile = sys.argv[2]
-else:
-    newsfile = detect_newsfile()
-    
-template = [string.Template(line) for line in open("template.html")]
-tokens = { "VERSION": version, "NEWS": process_newsfile(newsfile) }
-
-files = glob.glob('*.html.in')
-
-for file in files:
-    f = open(file[:-3], "w")
-    content = open(file).read()
-    content = addExamples(content)
-    tokens["CONTENT"] = string.Template(content).safe_substitute(tokens)
-    tokens["PAGENAME"] = file[:-8]
-    for tmpl in template:
-	print >>f, tmpl.safe_substitute(tokens),
-	
-    f.close()
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/header_blue.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/header_blue.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_bug.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_bug.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_c.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_c.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_community.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_community.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_debian.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_debian.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_documentation.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_documentation.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_download.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_download.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_html.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_html.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_info.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_info.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_introduction.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_introduction.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_license.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_license.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_links.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_links.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_linux.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_linux.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_news.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_news.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_osx.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_osx.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_pdf.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_pdf.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_python.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_python.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_r.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_r.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_ruby.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_ruby.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_screenshots.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_screenshots.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_sf.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_sf.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_source.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_source.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_wiki.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_wiki.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/icon_windows.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/icon_windows.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/igraph2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/igraph2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/igraph3.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/igraph3.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/degreedist-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/degreedist-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/degreedist.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/degreedist.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/dendrogram-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/dendrogram-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/dendrogram.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/dendrogram.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/diameter2-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/diameter2-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/diameter2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/diameter2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/eb-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/eb-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/eb.avi and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/eb.avi differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/eb.gif and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/eb.gif differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/eb.mng and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/eb.mng differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/eb.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/eb.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/erdos_renyi_components-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/erdos_renyi_components-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/erdos_renyi_components.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/erdos_renyi_components.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/fastgreedy-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/fastgreedy-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/fastgreedy.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/fastgreedy.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/frplots-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/frplots-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/frplots.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/frplots.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/kautz-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/kautz-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/kautz.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/kautz.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/kkplots.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/kkplots.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/mst-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/mst-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/mst.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/mst.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/tkplot-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/tkplot-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/homepage/images/screenshots/tkplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/homepage/images/screenshots/tkplot.png differ
diff -Nru igraph-0.6.5~quantal1/doc/homepage/index.html.in igraph-0.6.5/doc/homepage/index.html.in
--- igraph-0.6.5~quantal1/doc/homepage/index.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/index.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-<table class="intro"><tr><td>
-<h2 class="th">Introduction</h2>
-
-<hr/>
-
-<p><b>igraph</b> is a free software package for creating and manipulating undirected and 
-directed graphs. It includes implementations for classic graph theory
-problems like minimum spanning trees and network flow, and also
-implements algorithms for some recent network analysis methods, like 
-community structure search.</p>
-<div class="more"><a href="introduction.html">Read more &raquo;</a></div>
-
-</td><td>
-<h2 class="th">Features</h2>
-
-<hr/>
-
-<p><b>igraph</b> contains functions for generating regular and random graphs,
-manipulating graphs, assigning attributes to vertices and edges. It can
-calculate various structural properties, graph isomorphism, 
-includes heuristics for community structure detection, supports many
-  file formats. The R and Python interfaces support visualization.</p> 
-<div class="more"><a href="features.html">Read more &raquo;</a></div>
-
-</td><td>
-<h2 class="th">Requirements</h2>
-
-<hr/>
-
-<p>
-igraph runs on most modern machines and operating systems, and it is
-tested on MS Windows, Mac OSX and various Linux versions.
-</p>
-
-<p>
-The software you need for installing <b>igraph</b> depends on
-whether you want to use the C library, the R package or the Python
-extension; and may vary depending on your platform.</p>
-
-<div class="more"><a href="requirements.html">Read more &raquo;</a></div>
-</td></tr></table>
-
-<hr/>
-
-<div class="feed">
-<script src="http://feeds2.feedburner.com/IgraphAnnouncements?format=sigpro"
-	type="text/javascript" ></script><noscript><p>Subscribe to RSS
-    headline updates
-    from: <a href="http://feeds2.feedburner.com/IgraphAnnouncements"></a><br/>Powered
-    by FeedBurner</p> </noscript> 
-<p class="comment">View <a href="https://launchpad.net/igraph/+announcements">more
-    announcements.</a></p>
-</div>
-
-<div class="feed">
-<script src="http://feeds2.feedburner.com/BugsInIgraph?format=sigpro&nItems=5"
-	type="text/javascript" ></script><noscript><p>Subscribe to RSS
-    headline updates
-    from: <a href="http://feeds2.feedburner.com/BugsInIgraph"></a><br/>Powered
-    by FeedBurner</p> </noscript> 
-<p class="comment">View <a href="https://launchpad.net/igraph/+bugs">more
-    bugs.</a></p>
-</div>
-
-<div class="feed">
-<script src="http://feeds2.feedburner.com/LatestRevisionsForBranchigraph/igraph/07-main?format=sigpro&nItems=5"
-	type="text/javascript" ></script><noscript><p>Subscribe to RSS
-    headline updates
-    from: <a href="http://feeds2.feedburner.com/LatestRevisionsForBranchigraph/igraph/07-main"></a><br/>Powered
-    by FeedBurner</p> </noscript>
-<p class="comment"><a href="https://code.launchpad.net/~igraph/igraph/0.7-main">Browse
-    commits.</a></p>
-</div>
-
-<div class="feed">
-<script src="http://feeds2.feedburner.com/LatestRevisionsForBranchigraph/igraph/06-main?format=sigpro&nItems=5"
-	type="text/javascript" ></script><noscript><p>Subscribe to RSS
-    headline updates
-    from: <a href="http://feeds2.feedburner.com/LatestRevisionsForBranchigraph/igraph/06-main"></a><br/>Powered
-    by FeedBurner</p> </noscript> 
-<p class="comment"><a href="https://code.launchpad.net/~igraph/igraph/0.6-main">Browse
-    commits.</a></p>
-</div>
-
-<div class="feed">
-<script src="http://feeds2.feedburner.com/RecentPageChangesFromSiteigraphaWikidotSite?format=sigpro&nItems=5"
-	type="text/javascript" ></script><noscript><p>Subscribe to RSS
-    headline updates
-    from: <a href="http://feeds2.feedburner.com/RecentPageChangesFromSiteigraphaWikidotSite"></a><br/>Powered
-    by FeedBurner</p> </noscript>
-<p class="comment">See <a href="http://igraph.wikidot.com/system:recent-changes">more changes.</a></p>
-</div>
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/introduction.html.in igraph-0.6.5/doc/homepage/introduction.html.in
--- igraph-0.6.5~quantal1/doc/homepage/introduction.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/introduction.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-<h2>Introduction</h2>
-
-<p><b>igraph</b> is a free software package for creating and manipulating undirected and 
-directed graphs. It includes implementations for classic graph theory
-problems like minimum spanning trees and network flow, and also
-implements algorithms for some recent network analysis methods, like 
-community structure search.</p>
-
-<a name="introduction2"></a>
-<p>The efficient implementation of <b>igraph</b> allows it to handle graphs
-with millions of vertices and edges. The rule of thumb is that if your graph
-fits into the physical memory then <b>igraph</b> can handle it.</p>
-
-<p><b>igraph</b> can be installed in several forms:</p>
-
-<ul>
-<li><b>igraph</b> as a <i>C library</i> is useful if you want to use
-    it in your C/C++ projects, or want to implement your own network analysis
-    or model in C/C++ using the data structures and functions <b>igraph</b> provides.
-    </li>
-<li><b>igraph</b> as an <i>R package</i>. You can use <b>igraph</b> as an extension 
-    package to <a href="http://www.r-project.org">The GNU R project for
-    Statistical Computing.</a> The flexibility of the R language and its 
-    richness in statistical methods add a great deal of productivity to 
-    <b>igraph</b>, with a very small speed penalty.</li>
-<li><b>igraph</b> as a <a href="http://www.python.org">Python</a> extension module.
-    This way you can combine <b>igraph</b> with the huge set of Python functions
-    and modules available, and the ease of the Python language,
-    with a small speed penalty.</li>
-<li><b>igraph</b> as a <a href="http://www.ruby-lang.org">Ruby</a> extension. 
-    If you like the Ruby language, then this might be the right choice for you.
-    </li>
-</ul>
-
-<p>Every form of <b>igraph</b> contain the same code at the very heart, written in ANSI C.</p>
-
-<p>Please note that the ways of installing <b>igraph</b> depends on which its 
-forms you actually want to use. Eg. for using <b>igraph</b> as an R package,
-you don't need to download the C library at all. See the <a
-href="download.html">download page</a> for details.</p>
-
-<div class="back"><a href="index.html">&laquo; Back to main page</a></div>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/karate.net igraph-0.6.5/doc/homepage/karate.net
--- igraph-0.6.5~quantal1/doc/homepage/karate.net	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/karate.net	1970-01-01 00:00:00.000000000 +0000
@@ -1,80 +0,0 @@
-*vertices 34
-*edges
-1 32
-1 22
-1 20
-1 18
-1 14
-1 13
-1 12
-1 11
-1 9
-1 8
-1 7
-1 6
-1 5
-1 4
-1 3
-1 2
-2 31
-2 22
-2 20
-2 18
-2 14
-2 8
-2 4
-2 3
-3 14
-3 9
-3 10
-3 33
-3 29
-3 28
-3 8
-3 4
-4 14
-4 13
-4 8
-5 11
-5 7
-6 17
-6 11
-6 7
-7 17
-9 34
-9 33
-9 33
-10 34
-14 34
-15 34
-15 33
-16 34
-16 33
-19 34
-19 33
-20 34
-21 34
-21 33
-23 34
-23 33
-24 30
-24 34
-24 33
-24 28
-24 26
-25 32
-25 28
-25 26
-26 32
-27 34
-27 30
-28 34
-29 34
-29 32
-30 34
-30 33
-31 34
-31 33
-32 34
-32 33
-33 34
diff -Nru igraph-0.6.5~quantal1/doc/homepage/license.html.in igraph-0.6.5/doc/homepage/license.html.in
--- igraph-0.6.5~quantal1/doc/homepage/license.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/license.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-<h2>License</h2>
-
-<p>igraph library. Copyright (C) 2003-2012 Gábor Csárdi
-  &lt;csardi.gabor@gmail.com&gt; and Tamás Nepusz
-  &lt;ntamas@gmail.com&gt;</p>
-
-<p> 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 2 of the License, or (at your option)
-any later version.</p>
-
-<p>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
-<a href="http://www.gnu.org/copyleft/gpl.html">GNU General Public License</a>
-for more details.</p>
-
-<p>You should have received a copy of the GNU General Public License along
-with this program; if not, write to the Free Software Foundation, Inc., 51
-Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.</p>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/links.html.in igraph-0.6.5/doc/homepage/links.html.in
--- igraph-0.6.5~quantal1/doc/homepage/links.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/links.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-<h2>Links</h2>
-
-<h3><a href="http://vlado.fmf.uni-lj.si/pub/networks/pajek/">Pajek</a></h3>
-
-<p><a href="http://vlado.fmf.uni-lj.si/pub/networks/pajek/">Pajek</a> is
-excellent network analysis and visualization software written for Windows
-(but it runs in Wine under Linux as well). It can handle quite large
-(millions of vertices) graphs smoothly. Its main drawbacks are that
-(1) it is interactive, (2) closed source, (3) hard to extend.</p>
-
-<h3><a href="http://www.analytictech.com/ucinet.htm">UCINet</a></h3>
-
-<p><a href="http://www.analytictech.com/ucinet.htm">UCINet</a> is a
-collection of graph analysis software, it also includes
-Pajek. It's intended audience is social scientists, and cannot handle large
-graphs well. It can be used freely for 30 days and it is closed source.</p>
-
-<h3><a href="http://www.boost.org/libs/graph/doc/index.html">The Boost
-Graph Library</a></h3>
-
-<p><a href="http://www.boost.org/libs/graph/doc/index.html">The Boost
-Graph Library</a> is an impressive library written in C++ for manipulating
-graphs. It is quite fast, and can handle moderately large graphs. A good
-choice for anyone who likes programming in C++, but it also has interfaces
-to some higher level languages.</p>
-
-<h3><a href="http://networkx.lanl.gov">NetworkX</a></h3>
-
-<p><a href="http://networkx.lanl.gov">NetworkX</a> is another nice piece of
-software written in Python.</p>
-
-<h3><a href="http://erzuli.ss.uci.edu/R.stuff/">SNA</a></h3>
-
-<p><a href="http://erzuli.ss.uci.edu/R.stuff/">SNA</a> (Social Network
-Analysis) is an extension package to the GNU R system. It is useful for
-small graphs only, as it uses adjacency matrices.</p>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/news.html.in igraph-0.6.5/doc/homepage/news.html.in
--- igraph-0.6.5~quantal1/doc/homepage/news.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/news.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,3 +0,0 @@
-<h2>News</h2>
-
-${NEWS}
diff -Nru igraph-0.6.5~quantal1/doc/homepage/pngfix.js igraph-0.6.5/doc/homepage/pngfix.js
--- igraph-0.6.5~quantal1/doc/homepage/pngfix.js	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/pngfix.js	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-/*
- 
-Correctly handle PNG transparency in Win IE 5.5 & 6.
-http://homepage.ntlworld.com/bobosola. Updated 18-Jan-2006.
-
-Use in <HEAD> with DEFER keyword wrapped in conditional comments:
-<!--[if lt IE 7]>
-<script defer type="text/javascript" src="pngfix.js"></script>
-<![endif]-->
-
-*/
-
-var arVersion = navigator.appVersion.split("MSIE")
-var version = parseFloat(arVersion[1])
-
-if ((version >= 5.5) && (document.body.filters)) 
-{
-   for(var i=0; i<document.images.length; i++)
-   {
-      var img = document.images[i]
-      var imgName = img.src.toUpperCase()
-      if (imgName.substring(imgName.length-3, imgName.length) == "PNG")
-      {
-         var imgID = (img.id) ? "id='" + img.id + "' " : ""
-         var imgClass = (img.className) ? "class='" + img.className + "' " : ""
-         var imgTitle = (img.title) ? "title='" + img.title + "' " : "title='" + img.alt + "' "
-         var imgStyle = "display:inline-block;" + img.style.cssText 
-         if (img.align == "left") imgStyle = "float:left;" + imgStyle
-         if (img.align == "right") imgStyle = "float:right;" + imgStyle
-         if (img.parentElement.href) imgStyle = "cursor:hand;" + imgStyle
-         var strNewHTML = "<span " + imgID + imgClass + imgTitle
-         + " style=\"" + "width:" + img.width + "px; height:" + img.height + "px;" + imgStyle + ";"
-         + "filter:progid:DXImageTransform.Microsoft.AlphaImageLoader"
-         + "(src=\'" + img.src + "\', sizingMethod='scale');\"></span>" 
-         img.outerHTML = strNewHTML
-         i = i-1
-      }
-   }
-}
diff -Nru igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.1.html.in igraph-0.6.5/doc/homepage/relnotes-0.5.1.html.in
--- igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.1.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/relnotes-0.5.1.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,94 +0,0 @@
-<h2>igraph 0.5.1 Release Notes</h2>
-
-<p class="news">
-igraph 0.5.1 is a bugfix release, but it actually contains many 
-important new things as well. Here is a brief summary about each of 
-them. See the <a href="news.html">news page</a> for the complete
-list of changes.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    The DrL layout generator was added</h3>
-
-<p class="news">
-This is a sophisticated and efficient layout generator written by 
-Shawn Martin and colleagues. See more in the 
-<a href="doc-0.5.1/R/layout.drl.html">R manual</a>, in the 
-<a href="">Python documentation</a>
-or in the <a href="doc-0.5.1/html/ch14s01s04.html">C library reference
-manual.</a>
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Uniform sampling of random graphs with given degree sequence</h3>
-
-<p class="news">
-A nice random graph generator that conditions on the degree of vertices 
-was added. It can generate undirected connected graphs.
-The algorithm and the implementation was done by Fabien Viger and Matthieu Latapy.
-See more in the 
-<a href="doc-0.5.1/R/degree.sequence.game.html">R manual</a>, 
-in the <a href="">Python documentation</a> or in the 
-<a href="doc-0.5.1/html/igraph_degree_sequence_game.html">C library
-reference manual.</a>
-</p>
-
-<h3><img src="images/icon_r.png"/> Conversions</h3>
-
-<p class="news">
-igraph includes some functions to convert graphs to and from 
-<code>graphNEL</code> objects as defined in the graph package
-(<code><a href="doc-0.5.1/R/graphNEL.html">igraph.to.graphNEL</a></code>, 
-<code><a href="doc-0.5.1/R/graphNEL.html">igraph.from.graphNEL</a></code>) and 
-sparse matrices using the Matrix package 
-(<code><a href="doc-0.5.1/R/conversion.html">get.adjacency</a></code>, 
-<code><a href="doc-0.5.1/R/graph.adjacency.html">graph.adjacency</a></code>, 
-see the <code>sparse</code> argument).
-</p>
-
-<h3><img src="images/icon_r.png"/> New graph constructors</h3>
-
-<p class="news">
-A new function was added to create graphs from adjacency lists
-(<code><a href="doc-0.5.1/R/graph.adjlist.html">graph.adjlist</a></code>), 
-and <code><a href="doc-0.5.1/R/graph.data.frame.html">graph.data.frame</a></code>
-has an argument call <code>vertices</code>, this allows easy
-construction of graphs with vertex and edge meta data.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Weighted shortest path algorithms</h3>
-
-<p class="news">
-Both the Dijkstra and the Belmann-Ford algorithms were added. 
-See more in the 
-<a href="doc-0.5.1/R/shortest.paths.html">R documentation</a>, the
-<a href="doc-0.5.1/python/igraph.GraphBase-class.html#shortest_paths">Python manual</a> or in the 
-<a href="doc-0.5.1/html/ch10s02.html">C library reference manual.</a>
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Function to test edge reciprocity</h3>
-
-<p class="news">
-Mutuality can be tested for each edge now. See more in the 
-<a href="doc-0.5.1/R/is.mutual.html">R documentation</a>, in the 
-<a href="">Python manual</a>, or in the 
-<a href="doc-0.5.1/html/igraph_is_mutual.html">C reference manual.</a>
-</p>
-
-<h3><img src="images/icon_r.png"> Vertex shapes</h3>
-
-<p class="news">
-The R interface now supports different vertex shapes when plotting. 
-See more in the <a href="doc-0.5.1/R/igraph.vertex.shapes.html">R documentation.</a>
-<p>
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.2.html.in igraph-0.6.5/doc/homepage/relnotes-0.5.2.html.in
--- igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.2.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/relnotes-0.5.2.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-<h2>igraph 0.5.2 Release Notes</h2>
-
-<p class="news">
-  This is another bug fix release, with a couple of new features. Here
-  are the important ones. See the <a href="news.html">news page</a> for
-  the complete list of changes.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  Bipartite graphs</h3>
-
-<p class="news">
-Bipartite graphs have two kinds of vertices and edges are only allowed
-to connect opposite kinds. Think of the Hollywood movie graph with
-actors and movies. igraph 0.5.2 now contains some functions to deal
-with these kind of networks.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  The label propagation community finding algorithm</h3>
-
-<p class="news">
-This is a simple and intuitive community finding algorithm, published
-by Raghavan et al. in 2007 (see docs for full citation). It works by
-assigning labels to the vertices and then updating the labels based on
-majority voting among the neighbors.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  3D version of the DrL layout generator</h3>
-
-<p class="news">
-The DrL layout generator was extended to generate three dimensional
-layouts. Albeit slower than the regular 2D version, this is a nice
-addition for those who do visualization in 3D.
-</p>
-
-<h3><img src="images/icon_r.png"/>
-  (Limited) R GUI</h3>
-
-<p class="news">
-A minimal, supported GUI is included now in the R package. It contains
-only a small fraction of igraph capabilities, but can be still useful,
-e.g. in teaching. You can start it by typing <code>tkigraph()</code>,
-after loading the igraph package of course.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  Johnson's shortest path algorithm</h3>
-
-<p class="news">
-Johnson's algorithm is a good choice for finding all shortest paths in
-a network that has some negative edge weights, but no negative
-cycles.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  Average nearest neighbor degree</h3>
-
-<p class="news">
-A new function was added to calculate the average degree of the
-neighbors of all or some vertices. It supports the edge weighted
-version of the measure as well.
-</p>
-
-<h3><img src="images/icon_r.png"/>
-  Curved edges in R plots</h3>
-
-<p class="news">
-Both <code>plot()</code> and <code>tkplot()</code> supports curved
-edges. See <code>?igraph.plotting</code> for more details.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  Several bugs and memory leaks corrected</h3>
-
-<p>
-See the <a href="news.html">news page</a> for
-the complete list of changes. Apart from the bug fixes, some functions
-were rewritten to speed them up.
-</p>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.html.in igraph-0.6.5/doc/homepage/relnotes-0.5.html.in
--- igraph-0.6.5~quantal1/doc/homepage/relnotes-0.5.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/relnotes-0.5.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,291 +0,0 @@
-<h2>igraph 0.5 Release Notes</h2>
-
-<p class="news">
-There are a lot of improvements and corrections in this version. 
-We would like to thank all the people who sent comments, bug reports,
-patches, or just questions. Without their contribution igraph would be 
-definitely much less and worse than it is now. Please keep sending your 
-comments and ideas!
-</p>
-
-<p class="news">
-Here is a list of major changes, with links to the relevant sections of the 
-documentation. See the <a href="news.html">news page</a> for the complete
-list.
-</p>
-
-<h3><img src="images/icon_c.png"/> igraph as a platform</h3>
-
-<p class="news">
-We took some step towards turning igraph to an efficient platform for 
-implementing graph algorithms. In particular, we have a set of 
-<a href="doc-0.5/html/ch06.html">utility types</a> that support general
-scientific computing and working with graphs: vectors, matrices,
-stacks, queues, heaps, adjacency lists, etc.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Graph isomorphism</h3>
-
-<p class="news">
-igraph includes the BLISS graph isomorphism algorithm and
-implementation now. This and the improved VF2 implementation, which
-can now calculate subgraph isomorphism, make igraph support the
-bleeding edge of graph isomorphism algorithms. Many thanks to the
-authors of BLISS. See the details in the 
-<a href="doc-0.5/html/igraph-Isomorphism.html">Reference Manual</a>, in
-the <a href="doc-0.5/R/graph.isomorphism.html">R documentation</a> or in the
-<a href="doc-0.5/python/igraph.GraphBase-class.html#isomorphic">Python
-documentation.</a>
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    ARPACK for eigenvalue problems</h3>
-
-<p class="news">
-ARPACK is a library for solving large scale sparse eigenvalue
-problems. In igraph it is very handy, as many centrality problems are
-in fact eigenvalue problems: Kleinberg's hub and authority scores, 
-PageRank, the leading eigenvector community detection algorithm are
-some examples. Many thanks to the authors of ARPACK and James Fowler,
-who suggested to include it in igraph. 
-</p>
-
-<p class="news">
-See the details in the
-<a href="doc-0.5/html/igraph-Arpack.html">Reference Manual</a>, in the
-<a href="doc-0.5/R/arpack.html">R documentation</a> or the 
-<a href="doc-0.5/python/igraph.Graph-class.html#evcent">evcent</a>,
-<a href="doc-0.5/python/igraph.Graph-class.html#pagerank">pagerank</a>,
-<a href="doc-0.5/python/igraph.Graph-class.html#hub_score">hub_score</a>, etc.
-functions in the Python documentation.
-</p>
-
-<h3><img src="images/icon_python.png"/> Plotting from Python</h3>
-
-<p class="news">
-Plotting functionality based on the Cairo graphics library (so you need to
-install python-cairo if you want to use it). Currently the following
-objects can be plotted: graphs, adjacency matrices and dendrograms. Some
-crude support for plotting histograms is also implemented. Plots can be
-saved in PNG, SVG and PDF formats.
-</p>
-
-<p class="news">
-See the details <a href="doc-0.5/python/igraph.drawing-module.html">in the documentation.</a>
-</p>
-
-<h3><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/> Other bits</h3>
-
-<h4><img src="images/icon_python.png"/> Shell interface in Python</h4>
-
-<p class="news">
-igraph can now be invoked by calling the script called
-<code>igraph</code> from the command line. The script launches the
-Python interpreter and automatically imports igraph functions into the
-main namespace.
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Create famous graphs easily</h4>
-
-<p class="news">
-Some classic graphs can be created by giving their name. This is
-very handy if one needs a test graph quickly. See 
-<a href="doc-0.5/html/igraph_famous.html"><code>igraph_famous</code></a> (C), 
-<a href="doc-0.5/R/graph.famous.html"><code>graph.famous()</code></a> (R) or 
-<a href="doc-0.5/python/igraph.GraphBase-class.html#Famous">Famous</a> (Python).
-(The idea is based on Combinatorica, a Mathematica extension.)
-</p>
-
-<h4><img src="images/icon_r.png"/> Create graphs using formulas in R</h4>
-
-<p class="news">
-The new 
-<a href="doc-0.5/R/graph.formula.html"><code>graph.formula()</code></a>
-function provides a simple, concise way to create (small) graphs.
-Numerous examples are included in the 
-<a href="doc-0.5/R/graph.formula.html">manual page.</a>
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Improvements for weighted graphs</h4>
-
-<p class="news">
-Many functions were updated to handle weighted graphs: fast greedy
-community detection (<a href="doc-0.5/html/igraph_community_fastgreedy.html">C</a>, 
-<a href="doc-0.5/R/fastgreedy.community.html">R</a>, <a
-href="doc-0.5/python/igraph.Graph-class.html#community_fastgreedy">Python</a>), 
-Page Rank (<a href="doc-0.5/html/igraph_pagerank.html">C</a>, 
-<a href="doc-0.5/R/page.rank.html">R</a>, <a
-href="doc-0.5/python/igraph.GraphBase-class.html#pagerank">Python</a>), 
-modularity calculation (<a href="doc-0.5/html/igraph_modularity.html">C</a>, 
-<a href="doc-0.5/R/modularity.html">R</a>, <a
-href="doc-0.5/python/igraph.clustering.VertexClustering-class.html#modularity">Python</a>),
-the Fruchterman-Reingold layout algorithm (<a
-href="doc-0.5/html/igraph_layout_fruchterman_reingold.html">C</a>, 
-<a href="doc-0.5/R/layout.html">R</a>,
-<a href="doc-0.5/python/igraph.GraphBase-class.html#layout_fruchterman_reingold">Python</a>). 
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Non-simple graphs</h4>
-
-<p class="news">
-Some functions were added and improved to handle non-simple graphs
-(i.e. graphs with loop and/or multiple edges) better: testing that a
-graph is simple (<a href="doc-0.5/html/igraph_is_simple.html">C</a>, 
-<a href="doc-0.5/R/simplify.html">R</a>, <a
-href="doc-0.5/python/igraph.GraphBase-class.html#is_simple">Python</a>), testing for loop edges (<a
-href="doc-0.5/html/igraph_is_loop.html">C</a>, <a
-href="doc-0.5/R/is.multiple.html">R</a>, 
-<a href="doc-0.5/python/igraph.GraphBase-class.html#is_loop">Python</a>), 
-testing for multiple edges (<a href="doc-0.5/html/igraph_is_multiple.html">C</a>, <a
-href="doc-0.5/R/is.multiple.html">R</a>, <a
-href="doc-0.5/python/igraph.GraphBase-class.html#is_multiple">Python</a>) and counting the multiplicity of 
-edges (<a href="doc-0.5/html/igraph_count_multiple.html">C</a>, 
-<a href="doc-0.5/R/is.multiple.html">R</a>, <a href="doc-0.5/python/igraph.GraphBase-class.html#count_multiple">Python</a>).
-</p>
-
-<h4><img src="images/icon_python.png"/> Pickling support in Python</h4>
-
-<p class="news">
-igraph Graph objects can be serialized (pickled) in Python.
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    The graphopt layout algorithm</h4>
-
-<p class="news">
-This is a nice force-based layout algorithm. See the documentation of
-details (<a href="doc-0.5/html/igraph_layout_graphopt.html">C</a>, 
-<a href="doc-0.5/R/layout.html">R</a>, <a href="doc-0.5/python/igraph.GraphBase-class.html#layout_graphopt">Python</a>).
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Support for the DOT file format</h4>
-
-<p class="news">
-igraph can now write graphs to files in the DOT format, used by
-GraphViz. See documentation: <a
-href="doc-0.5/html/igraph_write_graph_dot.html">C</a>, 
-<a href="doc-0.5/R/write.graph.html">R</a>, <a
-href="doc-0.5/python/igraph.GraphBase-class.html#write_dot">Python</a>.
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Dyad and triad census</h4>
-
-<p class="news">
-Classic social network analysis tools for classifying the dyads (<a
-href="doc-0.5/html/igraph_dyad_census.html">C</a>, 
-<a href="doc-0.5/R/dyad.census.html">R</a>, <a href="doc-0.5/python/igraph.Graph-class.html#dyad_census">Python</a>) and triads (<a
-href="doc-0.5/html/igraph_triad_census.html">C</a>, 
-<a href="doc-0.5/R/triad.census.html">R</a>, <a href="doc-0.5/python/igraph.Graph-class.html#triad_census">Python</a>) of a network.
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Biconnected components and articulation points</h4>
-
-<p class="news">
-igraph is now able to calculate biconnected components (<a
-href="doc-0.5/html/igraph_biconnected_components.html">C</a>, 
-<a href="doc-0.5/R/biconnected.components.html">R</a>, <a href="doc-0.5/python/igraph.Graph-class.html#biconnected_components">Python</a>) 
-and articulation points (<a
-href="doc-0.5/html/igraph_articulation_points.html">C</a>, 
-<a href="doc-0.5/R/articulation.points.html">R</a>, <a
-href="doc-0.5/python/igraph.Graph-class.html#biconnected_components">Python</a>).
-</p>
-
-<h4><img src="images/icon_r.png"/> R graphics improvements</h4>
-
-<p class="news">There were some minor improvements in R graphics. New graphical
-parameters: <code>frame</code>, <code>asp</code>, <code>rescale</code>
-and <code>shape</code> for different vertex shapes, right now only
-circles and squares are supported. 
-<a href="doc-0.5/R/plot.graph.html"><code>plot.igraph</code></a> has as
-argument (<code>add</code>) to plot many graphs on the same plot,
-maybe on top of each other. It also supports the <code>main</code> and
-<code>sub</code> arguments now. <a href="doc-0.5/R/plot.common.html">See more here.</a>
-</p>
-
-<h4><img src="images/icon_r.png"/> Always free memory in R after an interrupted calculation</h4>
-
-<p class="news">
-In previous versions of the igraph R package the allocated memory
-was not freed if the computation was interrupted. This surely affected 
-MS Windows platforms, maybe also OSX. (Not Linux.) igraph 0.5
-correctly deallocates all memory on all platforms after an
-interruption.
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Estimating closeness and betweenness</h4>
-
-<p class="news">
-These measures can be quickly estimated by specifying an upper bound
-for path lengths to be considered. This is useful for larger graphs,
-for which the calculation takes a long time. See documentation for
-closeness (<a href="doc-0.5/html/igraph_closeness_estimate.html">C</a>, 
-<a href="doc-0.5/R/closeness.html">R</a>, <a href="doc-0.5/python/igraph.GraphBase-class.html#closeness">Python</a>),
-betweenness (<a href="doc-0.5/html/igraph_betweenness_estimate.html">C</a>, 
-<a href="doc-0.5/R/betweenness.html">R</a>, <a href="doc-0.5/python/igraph.GraphBase-class.html#betweenness">Python</a>) and edge
-betweenness (<a href="doc-0.5/html/igraph_edge_betweenness_estimate.html">C</a>, 
-<a href="doc-0.5/R/betweenness.html">R</a>, <a href="doc-0.5/python/igraph.GraphBase-class.html#edge_betweenness">Python</a>).
-</p>
-
-<h4><img src="images/icon_c.png"/>
-    <img src="images/icon_r.png"/>
-    <img src="images/icon_python.png"/>
-    Functions for vertex similarity measures</h4>
-
-<p class="news">
-Two vertex similarity measures based on the number of common neighbors
-are introduced, the Jaccard (<a
-href="doc-0.5/html/igraph_similarity_jaccard">C</a>, 
-<a href="doc-0.5/R/similarity.html">R</a>, <a
-href="doc-0.5/python/igraph.GraphBase-class.html#similarity_jaccard">Python</a>) and the Dice (<a
-href="doc-0.5/html/igraph_similarity_dice.html">C</a>, 
-<a href="doc-0.5/R/similarity.html">R</a>,
-<a href="doc-0.5/python/igraph.GraphBase-class.html#similarity_dice">Python</a>) similarities.
-</p>
-
-<h4><img src="images/icon_r.png"/> Proper warnings in R</h4>
-
-<p class="news">
-Up to now igraph warnings were dumped to the console when using the
-igraph R package. In many cases this meant that they were effectively
-lost. In the new version igraph warnings are converted to proper R
-warnings.
-</p>
-
-<h4><img src="images/icon_c.png"/> Handle attributes from C</h4>
-
-<p class="news">
-An experimental C attribute interface was added. This allows using
-graph/vertex/edge attributes when programming from C. <a
-href="doc-0.5/html/ch09s02.html">See
-more here.</a>
-</p>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/relnotes-0.6.html.in igraph-0.6.5/doc/homepage/relnotes-0.6.html.in
--- igraph-0.6.5~quantal1/doc/homepage/relnotes-0.6.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/relnotes-0.6.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,330 +0,0 @@
-<h2>igraph 0.6 Release Notes</h2>
-
-<p class="news">
-igraph 0.6 is a major new release of igraph. It contains many new
-features and major changes, a lot of bug fixes and improvements. 
-As always, we are grateful to the people who sent comments, bug 
-reports, questions, and specially to people who contributed code.
-</p>
-
-<p class="news">
-See below a list of major changes, with links to the relevant sections
-of the documentation. New features in R (look for the
-<img src="images/icon_r.png"/> logo), 
-<img src="images/icon_python.png"/> Python, and
-<img src="images/icon_c.png"/> C are all listed here.
-</p>
-
-<p class="news">
-See the <a href="news.html">news page</a> for a (more) complete list
-of changes.
-</p>
-
-<h3><img src="images/icon_r.png" />
-  <img src="images/icon_python.png" />
-  The Nexus repository</h3>
-
-<p class="news">
-igraph supports the <a href="http://nexus.igraph.org">Nexus network
-    repository</a> from R and from Python. Nexus is an online database
-of network data sets. You can search Nexus and download network from
-it directly from R and Python. See the <a href="doc-0.6/R/nexus.html">R
-    manual</a> or the <a href="doc-0.6/python/igraph.nexus.NexusConnection-class.html">Python documentation</a> for details.
-</p>
-
-<h3><img src="images/icon_r.png" />Numbering from 1 in R</h3>
-
-<p class="news">
-The biggest change in the R interface is that starting from this version
-vertices and edges are numbered from one. This change might be
-painful for many people, because it makes already existing code
-incompatible with igraph 0.6. To make the switch easier, there is now an
-<a href="http://cran.r-project.org/web/packages/igraph0/index.html">
-igraph0</a> package on CRAN; igraph0 uses 0-based vertex and
-edge ids, and it can be used to run old code. Note, however, that
-igraph0 will not be developed in the future. Please use the 
-<a href="http://cran.r-project.org/web/packages/igraph/index.html">
-igraph</a> package for current and future work.
-</p>
-
-<p class="news">
-(Also note that in Python and C vertices and edges are still numbered
-from zero, as these languages traditionally use zero-based indexing.)
-</p>
-
-<h3><img src="images/icon_python.png" />Support for Python 3.x</h3>
-
-<p class="news">
-The Python interface of igraph now supports Python 3. The current release was
-tested with Python 3.2 on Windows, Linux and Mac OS X. Please report any bugs
-you encounter when using igraph in Python 3.x through the
-<a href="bugs.html">usual channels</a>.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>Community detection improvements</h3>
-
-<p class="news">
-Community structure detection via exact modularity optimization. As
-modularity optimization in an NP-complete problem, this works only for
-small graphs. 
-<a href="doc-0.6/html/ch22s01.html#igraph_community_optimal_modularity">C manual</a>, 
-<a href="doc-0.6/R/optimal.community.html">R manual</a>,
-<a href="doc-0.6/python/igraph.Graph-class.html#community_optimal_modularity">Python manual</a>.
-</p>
-
-<p class="news">
-The multi-level modularity optimization algorithm by Blondel et
-al. was added. See
-the <a href="doc-0.6/html/ch22s06.html#igraph_community_multilevel">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/multilevel.community.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html#community_multilevel">Python documentation</a>.
-</p>
-
-<p class="news">
-Hierarchical random graphs and community finding, based on the code
-from Aaron Clauset. In <a href="doc-0.6/html/igraph-HRG.html">C</a>,
-and <a href="doc-0.6/R/hrg.html">R</a>.
-</p>
-
-<p class="news">
-We support now the InfoMAP community finding method, thanks to
-Emmanuel Navarro for the code. In
-<a href="doc-0.6/html/ch22s08.html#igraph_community_infomap">C</a>,
-<a href="doc-0.6/R/infomap.html">R</a> and
-<a href="doc-0.6/python/igraph.Graph-class.html#community_infomap">Python</a>.
-</p>
-
-<p class="news">
-The edge betweenness community detection method of Newman and Girvan now also
-works on weighted graphs. See
-the <a href="doc-0.6/html/ch22s05.html">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/community.edge.betweenness.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html#community_edge_betweenness">Python documentation</a>.
-</p>
-
-<p class="news">
-We have added some functions to compare various community structures.
-See the <a href="doc-0.6/html/ch22s01.html#igraph_compare_communities">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/compare.communities.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.clustering-module.html#compare_communities">Python documentation</a>.
-</p>
-
-<p class="news">
-Igraph now implements the Spectral Coarse Graining method, by David
-Morton, our implementation is based on his code. See the 
-<a href="doc-0.6/html/igraph-SCG.html">C
-    Reference manual</a> or the 
-<a href="doc-0.6/R/scg.html">R documentation</a>.
-</p>
-
-<p class="news">
-The cohesive block finding functions were rewritten from scratch in
-C. They are much faster now, and they have a nicer API, too. See
-the <a href="doc-0.6/html/ch20s06.html#igraph_cohesive_blocks">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/cohesive.blocks.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html#cohesive_blocks">Python documentation</a>.
-</p>
-
-<p class="news">
-In R, all community detection functions return a
-'<code>communities</code>' object now. We have defined various
-operations for these objects, see the
-<a href="doc-0.6/R/communities.html">R manual</a> for more.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>Centrality-related functions</h3>
-
-<p class="news">
-Centralization scores for degree, closeness, betweenness and 
-eigenvector centrality. See
-the <a href="doc-0.6/html/ch13s07.html">C
-    Reference manual</a> or the 
-<a href="doc-0.6/R/centralization.html">R documentation</a>.
-</p>
-
-<p class="news">
-Personalized PageRank scores. See
-the <a href="doc-0.6/html/ch13s05.html#igraph_personalized_pagerank">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/page.rank.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.GraphBase-class.html#personalized_pagerank">Python documentation</a>.
-</p>
-
-<p class="news">
-Authority and hub scores, betweenness and closeness
-calculations all support edge weights now. See
-the <a href="doc-0.6/html/ch13s05.html">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/00Index.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html">Python documentation</a>.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>Sugiyama layout</h3>
-
-<p class="news">
-Igraph now implements the Sugiyama layout algorithm for layered
-directed acyclic graphs. See
-the <a href="doc-0.6/html/ch18s01.html#igraph_layout_sugiyama">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/layout.sugiyama.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html#layout_sugiyama">Python documentation</a>.
-</p>
-
-<h3><img src="images/icon_c.png"/>
-  <img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>Maximum matchings in bipartite graphs</h3>
-
-<p class="news">
-Igraph now implements the push-relabel algorithm and the Kuhn-Munkres algorithm
-(also known as the Hungarian method) to find maximum matchings in unweighted and
-weighted bipartite graphs. See
-the <a href="doc-0.6/html/ch13s18.html">C
-    Reference manual</a>, the 
-<a href="doc-0.6/R/matching.html">R documentation</a>, or
-the <a href="doc-0.6/python/igraph.Graph-class.html#maximum_bipartite_matching">Python documentation</a>.
-</p>
-
-<h3><img src="images/icon_r.png" />Hiding the graph structure by
-  default</h3>
-
-<p class="news">
-In R, if you type in the name of an igraph object, the edges of the 
-graph are not dumped to the screen any more, only a short summary of
-the graph is printed:
-<pre>
-      > karate
-      IGRAPH UNW- 34 78 -- Zachary's karate club network
-      + attr: name (g/c), Citation (g/c), Author (g/c), Faction (v/n), name (v/c), weight (e/n)
-</pre> 
-
-<p class="news">
-To see the graph structure, you can use the '<code>str()</code>' function.
-See more in the <a href="doc-0.6/R/print.graph.html">R
-    documentation</a>.
-</p>
-
-<h3><img src="images/icon_python.png" />Named graph vertices</h3>
-
-<p class="news">
-The Python interface now treats the '<code>name</code>' attributes in a special way.
-The values of the attribute are indexed in the background, allowing the retrieval of
-a vertex with a given name in amortized constant time. Furthermore, most of the
-graph query methods accept vertex names as well as vertex indices.
-See the <a href="doc-0.6/python/igraph.VertexSeq-class.html#find">Python documentation</a>
-for more information.
-</p>
-
-<h3><img src="images/icon_python.png" />Pretty-printed graph summaries</h3>
-
-<p class="news">
-The same graph summary format used by R is now also adopted by Python.
-Printing a graph with the <code>print</code> statement now prints the
-summary and the edge list in a concise format:
-<pre>
-	>>> print karate
-	IGRAPH UNW- 34 78 -- Zachary's karate club network
-	+ attr: Author (g), Citation (g), name (g), Faction (v), id (v), name(v),
-	  weight (e)
-	+ edges (vertex names):
-	    Mr Hi -- Actor 2, Actor 3, Actor 4, Actor 5, ...
-	  Actor 2 -- Mr Hi, Actor 3, Actor 4, ...
-	...
-</pre>
-
-<p class="news"> Printing a graph with the <code>summary()</code> function (in
-the igraph namespace) prints the short summary only, without the edge list:</p>
-<pre>
-    >>> summary(karate)
-	IGRAPH UNW- 34 78 -- Zachary's karate club network
-	+ attr: Author (g), Citation (g), name (g), Faction (v), id (v), name(v),
-	  weight (e)
-</pre>
-
-<p class="news">Printing a graph with <code>summary(graph, full=True)</code> prints
-the summary, the edge list, the vertex and the edge attributes as well.</p>
-
-<h3><img src="images/icon_r.png" /><img src="images/icon_python.png" />Easier manipulation of graphs</h3>
-
-<p class="news">
-In R, there are now new and easier ways to add new vertices/edges to a
-graph, or remove existing ones. See the details in the 
-<a href="doc-0.6/R/graph.structure.html">R documentation</a>. In Python,
-you can treat the graph as a virtual adjacency matrix. See the details in
-the <a href="doc-0.6/python/igraph.Graph-class.html">Python
-	documentation</a>.</p>
-
-<h3><img src="images/icon_r.png" />The '<code>igraphdata</code>' package</h3>
-
-<p class="news">
-The new R package 
-<a href="http://cran.r-project.org/web/packages/igraphdata/index.html">
-igraphdata</a> contains some example graph data sets.
-</p>
-
-<h3><img src="images/icon_r.png"/><img src="images/icon_python.png"/>Mark groups of vertices in R and Python plots</h3>
-
-<p class="news">
-In R and Python, you can mark vertex groups on graph plots, using shaded
-areas. Communities and cohesive blocks are plotted using technique by
-default. See the '<code>mark.groups</code>' argument of
-the <a href="doc-0.6/R/plot.graph.html">'<code>plot.igraph()</code>'</a>
-function in R and the '<code>mark_groups</code>' argument of the
-<a href="doc-0.6/python/igraph.Graph-class.html#__plot__"><code>Graph.__plot__</code></a>
-function in Python.
-</p>
-
-<h3><img src="images/icon_python.png"/>Refactored graph drawers in the Python interface</h3>
-
-<p class="news">
-Graphs in the Python interface are plotted by graph drawer classes now instead
-of a monolithic plotting function. This allows one to replace the
-<a href="doc-0.6/python/igraph.drawing.graph.DefaultGraphDrawer-class.html">default
-	graph drawer</a> with custom graph drawers; for instance, a drawer that
-sends an igraph graph to an
-<a href="doc-0.6/python/igraph.drawing.graph.UbiGraphDrawer-class.html">UbiGraph display</a>
-or to
-<a href="doc-0.6/python/igraph.drawing.graph.CytoscapeGraphDrawer-class.html">Cytoscape</a>.
-The default graph drawer also allows the partial customization of the plot with
-pluggable <a href="doc-0.6/python/igraph.drawing.shapes-module.html">vertex shapes</a>
-and <a href="doc-0.6/python/igraph.drawing.edge-module.html">edge drawers</a>.</p>
-
-<h3><img src="images/icon_r.png"/>igraph demos in the R package</h3>
-
-<p class="news">
-We have included some demos in the igraph R package, to get a list of
-the demos, type this at your R prompt:
-<pre>
-      > demo(package="igraph")
-      Demos in package ‘igraph’:
-
-      centrality              Classic and other vertex centrality indices
-      cohesive                Cohesive blocking, the Moody & White method
-      community               Community structure detection
-      crashR                  A crash-course into R
-      smallworld              Small-world networks
-</pre>
-</p>
-
-<h3><img src="images/icon_r.png"/>
-  <img src="images/icon_python.png"/>
-  Better handling of attributes in R and Python</h3>
-
-<p class="news">
-In R and Python, many igraph functions keep the vertex, edge and graph attributes
-now, when one manipulates the graph. The attributes can also be
-combined using a flexible API. See
-the <a href="doc-0.6/R/attribute.combination.html">R manual</a> and the 
-'<code>combine_edges</code>' and '<code>combine_attrs</code>' arguments
-of many graph methods in the <a href="doc-0.6/python/igraph.Graph-class.html">Python documentation</a> for more.
-</p>
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/requirements.html.in igraph-0.6.5/doc/homepage/requirements.html.in
--- igraph-0.6.5~quantal1/doc/homepage/requirements.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/requirements.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-<h2>Requirements</h2>
-
-<h3>The C library</h3>
-    <p>For using the <i><b>igraph</b> C library</i> only a fairly recent C
-    and C++ library is needed. For supporting the GraphML format
-    you'll need the <a href="http://xmlsoft.org"><code>libxml2</code>
-    library</a>.</p>
-
-    <p>For compiling the <i><b>igraph</b> C library</i> from source you'll
-    need a fairly modern C and C++ compiler and some standard UNIX
-    tools like <code>make</code>, <code>chmod</code>, <code>touch</code>, etc.</p>
-
-    <p>Most often we use the <a href="http://gcc.gnu.org">GNU Compiler
-    Collection</a> for compiling. Theoretically it is possible to compile
-    <b>igraph</b> using the Microsoft Visual C Compiler as well, but we
-    recommend the <a href="http://www.cygwin.com">Cygwin</a> or
-    <a href="http://www.mingw.org">MinGW</a> environments for compiling
-    <b>igraph</b> under Windows.</p>
-
-<h3>The GNU R package</h3>
-    <p>For using the <i><b>igraph</b> R package</i> you obviously need 
-    GNU R, a recent version like 2.6.0 is recommended, since earlier
-    versions contain bugs which affect <b>igraph</b>. If you would like to
-    compile the R package from source (this is the usual way for Linux
-    systems), you'll need a C and C++ compiler and optionally the
-    <a href="http://xmlsoft.org"><code>libxml2</code> library</a>.</p>
-
-    <p>For installing the <i><b>igraph</b> R package</i> on Windows, you 
-    don't need anything else, just GNU R and the binary <b>igraph</b> R
-    package of course</p>
-
-<h3>The Python extension module</h3>
-
-    <p>For installing the <i>Python extension module</i>, you'll
-    need Python version 2.4 or later. Binary versions of the module
-    are available for Python 2.4 and Python 2.5 on the Windows platform,
-    so you don't have to compile anything in this case. OS X Leopard
-	users can download an installer as well. If you are using
-    Linux or Mac OS X Tiger, you'll have to compile the extension by yourself.
-    Compilation requires a recent C compiler (e.g. <code>gcc</code>, which
-    is usually available as a separate package in Linux and as part of
-    <a href="http://developer.apple.com/tools/xcode/">XCode</a> on Mac
-    OS X. You'll also need the compiled form of the <b>igraph</b> C
-	core, as the Python interface will link to that during compilation.</p>
-    <p>If you have the <a href="http://peak.telecommunity.com/DevCenter/EasyInstall">EasyInstall</a>
-    Python script installed, you can simply type <code>easy_install igraph</code>
-    to download, compile and install <b>igraph</b> as a Python Egg. This
-	method assumes that you installed the C core somewhere in the
-	default include and library path of your system.</p>
-
-<h3>The Ruby extension</h3>
-    <p>For installing the <i>Ruby extension</i> please consult 
-    <a href="http://rubyforge.org/projects/igraph/">the homepage of
-    this extension</a>.</p>
-
-<h3>Compiling the development version</h3>
-    <p>For compiling the development version of <b>igraph</b>, you'll need
-    quite a large set of tools: <code>autoconf</code>, <code>automake</code>,
-    GNU <code>bison</code> version 1.35 or newer, GNU <code>make</code>,
-    maybe more. For compiling the documentation you'll need even more tools:
-    Python, Docbook schemas and tools, <code>xmlto</code>, <code>makeinfo</code>,
-    <code>patch</code>, <code>docbook2x</code>, maybe more. We're sure you
-    know how to get these if you want to compile the development version :)</p>
-
-<div class="back"><a href="index.html">&laquo; Back to main page</a></div>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/screenshots.html.in igraph-0.6.5/doc/homepage/screenshots.html.in
--- igraph-0.6.5~quantal1/doc/homepage/screenshots.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/screenshots.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-<h2>Screenshots</h2>
-
-<p>Click on the images to see the source code used for generating them.</p>
-
-<table>
-
-<tr>
-
-<td valign="top">
-  <div class="image_caption">Force based layout</div>
-  <a href="screenshots2.html#1"><img src="images/screenshots/frplots-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption"><code>tkplot</code> in the R package</div>
-  <a href="screenshots2.html#2"><img src="images/screenshots/tkplot-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption">Plotting with transparency</div>
-  <a href="screenshots2.html#3"><img src="images/screenshots/fastgreedy-small.png" alt="Read details"/></a>
-</td>
-
-</tr><tr>
-
-<td valign="top">
-  <div class="image_caption">Components of an Erd&#x0151;s-R&#x00e9;nyi graph</div>
-  <a href="screenshots2.html#4"><img src="images/screenshots/erdos_renyi_components-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption">Kautz graph with adjacency matrix</div>
-  <a href="screenshots2.html#5"><img src="images/screenshots/kautz-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption">Minimum spanning tree</div>
-  <a href="screenshots2.html#6"><img src="images/screenshots/mst-small.png" alt="Read details"/></a>
-</td>
-
-</tr><tr>
-
-<td valign="top">
-  <div class="image_caption">Vertex attributes</div>
-  <a href="screenshots2.html#7"><img src="images/screenshots/diameter2-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption">Degree distributions</div>
-  <a href="screenshots2.html#8"><img src="images/screenshots/degreedist-small.png" alt="Read details"/></a>
-</td>
-<td valign="top">
-  <div class="image_caption">Dendrograms</div>
-  <a href="screenshots2.html#9"><img src="images/screenshots/dendrogram-small.png" alt="Read details"/></a>
-</td>
-
-</tr><tr>
-
-<td valign="top">
-  <div class="image_caption">Creating animations</div>
-  <a href="screenshots2.html#10"><img src="images/screenshots/eb-small.png" border="0"></a>
-  </p>
-</td>
-
-</tr>
-
-</table>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/screenshots2.html.in igraph-0.6.5/doc/homepage/screenshots2.html.in
--- igraph-0.6.5~quantal1/doc/homepage/screenshots2.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/screenshots2.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,198 +0,0 @@
-<h2>Screenshots</h2>
-
-<a name="1"></a>
-
-<h3>The Fruchterman-Reingold layout algorithm</h3>
-
-<img class="float_right" width="480" height="480" alt="Illustration" src="images/screenshots/frplots.png"/>
-
-<div style="border-right: 490px solid white">
-<p>The Fruchterman-Reingold is a robust algorithm to generate 
-visually appealing placements for vertices. It works well on unconnected 
-graphs and can be used up to a couple of thousand vertices.</p>
-
-<p>The <code>frgraphs()</code> function is <a href="frgraphs.R">available
-here</a>.</p>
-
-<pre class="programlisting condensed">
-<example language="R" file="fralgo.R" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="2"></a>
-
-<h3 style="clear:both">The <code>tkplot</code> editor of the R package</h3>
-
-<img class="float_right" width="462" height="507" alt="Illustration" src="images/screenshots/tkplot.png"/>
-<div style="border-right: 472px solid white">
-<p>The igraph R package features an interactive graph layout editor
-for small graphs. It is a little toy only, but can be useful if you
-want to adjust the layout of small graphs. Here is how we generated 
-this picture:</p>
-<pre class="programlisting condensed">
-<example language="R" file="tkplot.R" />
-</pre>
-<p>After hand-tuning the layout, you can obtain the new coordinates
-using the id of the plot, as shown on the window border:</p>
-<pre class="programlisting condensed">
-coords &lt;- tkplot.getcoords(1)
-</pre>
-<p>You can find the <a href="karate.net">karate.net file here</a>.</p>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="3"></a>
-<h3 style="clear:both">Transparency</h3>
-
-<img class="float_right" width="497" height="596" alt="Illustration" src="images/screenshots/fastgreedy.png"/>
-
-<div style="border-right: 507px solid white">
-<p>The R graphics device handles transparency (on most platforms), we
-  use this to plot one graph on top of another.</p> 
-<pre class="programlisting condensed">
-<example language="R" file="transparency.R" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="4"></a>
-
-<h3 style="clear:both">Components of an Erd&#x0151;s-R&#x00e9;nyi random graph</h3>
-
-<img class="float_right" width="480" height="480" src="images/screenshots/erdos_renyi_components.png" alt="Illustration"/>
-<div style="border-right: 490px solid white">
-<p>Erd&#x0151;s-R&#x00e9;nyi random graphs have a fixed number of vertices
-(given by the parameter <i>n</i>) and a fixed number of edges (given by
-<i>m</i>) that are placed between pairs of vertices with equal probability.
-When one increases <i>m</i> gradually, small disconnected tree-like
-components will appear, but there exists a threshold <i>m'</i>
-(depending on <i>n</i>) where a giant component appears suddenly.</p>
-<p>In this visualization, we used the Python interface to show an
-Erd&#x0151;s-R&#x00e9;nyi graph near its threshold <i>m'</i>.
-Components are colored with different colors according to their size,
-isolated vertices are colored with light gray.</p>
-
-<pre class="programlisting condensed">
-<example language="Python" file="ERcomps.py" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="5"></a>
-
-<h3 style="clear:both">Kautz graph and its adjacency matrix</h3>
-
-<img class="float_right" width="480" height="480" src="images/screenshots/kautz.png" alt="Illustration"/>
-<div style="border-right: 490px solid white">
-<p>Kautz graphs are regular graphs used for processor connection patterns
-in high-performance and fault-tolerant computing (see its
-<a href="http://en.wikipedia.org/wiki/Kautz_graph">Wikipedia entry</a>
-for details). <b>igraph</b> is able to generate Kautz graphs (and their
-counterparts, <a href="http://en.wikipedia.org/wiki/De_Bruijn_graph">De
-Bruijn graphs</a>). Here we used the Python interface to visualize a
-Kautz graph with M=3 and N=2 along with its adjacency matrix to decipher
-the inner structure of the graph. The adjacency matrix is shown as an
-inset in the upper right corner with opacity 0.7.</p>
-
-<pre class="programlisting condensed">
-<example language="Python" file="kautz.py" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="6"></a>
-
-<h3 style="clear:both">Minimum spanning tree of a geometric random graph</h3>
-
-<img class="float_right" width="480" height="480" src="images/screenshots/mst.png" alt="Illustration"/>
-<div style="border-right: 490px solid white">
-<p>The image on the right shows a geometric random graph with 100
-vertices dropped randomly onto the unit squre. Two vertices are
-connected if and only if their distance is less than 0.2. The edge
-weights correspond to the distance of the two endpoints, while the
-widths of the edges are proportional to the closeness of the endpoints
-(the closer they are, the thicker the edge is). Red edges show the
-calculated minimum weight spanning tree of the graph.</p>
-
-<pre class="programlisting condensed">
-<example language="Python" file="mst.py" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="7"></a>
-
-<h3>Plotting the diameter</h3>
-
-<img class="float_right" width="503" height="506" alt="Illustration" src="images/screenshots/diameter2.png"/>
-
-<div style="border-right: 513px solid white">
-<p>This example shows how vertices along a path (the diameter in this case)
-can be selected. We use the igraph R package.</p>
-<pre class="programlisting condensed">
-<example language="R" file="diameter.R" />
-</pre>
-<p>You can find the <a href="karate.net">karate.net file here.</a></p>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="8"></a>
-
-<h3>Degree distributions for nonlinear preferential attachment</h3>
-
-<img class="float_right" width="500" height="500" alt="Illustration" src="images/screenshots/degreedist.png"/>
-<div style="border-right: 510px solid white">
-<p>We plot how the (cumulative) in-degree distribution of a graph changes
-if we change the exponent of the preferential attachment process.
-We use the igraph R package.</p>
-<pre class="programlisting condensed">
-<example language="R" file="degreedist.R" />
-</pre>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="9"></a>
-
-<h3>Plotting the dendrogram of a community structure algorithm</h3>
-<img class="float_right" width="500" height="500" alt="Illustration" src="images/screenshots/dendrogram.png"/>
-<div style="border-right: 510px solid white">
-<p>We use the R package and convert the output of the Walktrap
-community finding algorithm to a dendrogram.</p>
-<pre class="programlisting condensed">
-<example language="R" file="dendrogram.R" />
-</pre>
-<p>You can find the <a href="karate.net">karate.net file here.</a></p>
-</div>
-
-<hr style="clear:both"/>
-
-<a name="10"></a>
-
-<h3>Creating simple animations</h3>
-</td>
-<img class="float_right" width="480" height="480" alt="Illustration" src="images/screenshots/eb.gif">
-<div style="border-right: 490px solid white">
-<p>We plot the network after each iteration of the Girvan-Newman edge
-betweenness based community structure finding algorithm.
-The edge betweenness values are shown on the left, the top five values 
-are also shown as edge colors. The components are coded with 
-different vertex colors and the modularity score of the actual division is
-on the top.</p>
-<p>You can get the <a href="karate.net">karate.net file from here.</a>
-Download the animation: 
-<a href="images/screenshots/eb.avi">AVI file</a>, 
-<a href="images/screenshots/eb.mng">MNG file.</a>
-</p>
-<pre class="programlisting condensed">
-<example language="R" file="animation.R" />
-</pre>
-</div>
diff -Nru igraph-0.6.5~quantal1/doc/homepage/style.css igraph-0.6.5/doc/homepage/style.css
--- igraph-0.6.5~quantal1/doc/homepage/style.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/style.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,391 +0,0 @@
-
-body {
-    font: medium/150% "Lucida Grande", sans-serif;
-    margin: 0; padding: 0 0 10px;
-    color: #333; background: #fff;
-}
-a img { border: 0; }
-h1 {
-    color: #fff;
-    margin: 0;
-    height: 40px;
-    line-height: 40px;
-    text-shadow: 0px 1px 2px #000;
-    background: #1872ce url(images/header_blue.png) repeat-x;
-    border-top: 1px solid #1872ce;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-    padding-left: 10px;
-}
-h2 {
-    font-size: 1.5em;
-    text-indent: -40px;
-}
-h2.th {
-    font-size: 1.5em;
-    text-indent: 0px;
-}
-h3 {
-    font-size: 1em;
-    text-indent: -20px;
-}
-h4 {
-    font-size: 0.8em;
-}
-body.error h1 {
-    background: #d70000;
-    border-bottom: 1px solid #7f0000;
-}
-hr {
-  color: #888; background-color: #888;
-  height: 1px; width: 100%;
-  border: 0;
-}
-code { font-size: 1.2em; }
-img.float_right { float: right }
-img.float_left { float: left }
-pre.condensed { font-size: 0.8em; line-height: 1.5em; }
-
-.igraphlogo {
-    float: right;
-    padding-left: 40px;
-    padding-right: 40px;
-    padding-top:30px;
-}
-
-div.main {
-    max-width:900px;
-    padding-left: 50px;
-    padding-bottom: 50px;
-    margin-right: 0;
-}
-.more {
-    text-align: right;
-    margin-top: -1em;
-}
-.back {
-    text-align: left;
-}
-
-ul.no-bullet {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.no-bullet li {
-  padding: 0; margin: 0;
-}
-li.download {
-  line-height: 1em;
-  padding-bottom: 10px !important;
-}
-li.download .name {
-  font-weight: bold;
-  padding-left: 20px;
-}
-li.download span.comment {
-  font-size: 0.8em;
-  color: #888;
-}
-li.download div.comment {
-  font-size: 0.8em;
-  padding: 4px 0px 0px 20px;
-}
-p.comment {
-  font-size: 0.8em;
-  color: #888;
-}
-div.image_caption {
-  font-size: 0.8em;
-  color: #888;
-  text-align: center;
-}
-li.download-c {
-  background: url(images/icon_c.png) no-repeat 0px 0px;
-}
-li.download-sf {
-  background: url(images/icon_sf.png) no-repeat 0px 0px;
-}
-li.download-r {
-  background: url(images/icon_r.png) no-repeat 0px 0px;
-}
-li.download-python {
-  background: url(images/icon_python.png) no-repeat 0px 0px;
-}
-li.download-ruby {
-  background: url(images/icon_ruby.png) no-repeat 0px 0px;
-}
-li.download-doc {
-  background: url(images/icon_documentation.png) no-repeat 0px 0px;
-}
-li.download-wiki {
-  background: url(images/icon_wiki.png) no-repeat 0px 0px;
-}
-ul.download-links {
-  list-style-type: none;
-  padding: 2px 0 0 20px; margin: 0;
-  font-size: 0.8em;
-}
-ul.download-links li {
-  padding: 0px 10px 0px 0px; margin: 0;
-  padding-bottom: 5px !important;
-}
-ul.download-links li.download-source {
-  background: url(images/icon_source.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-sf {
-  background: url(images/icon_sf.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-windows {
-  background: url(images/icon_windows.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-debian {
-  background: url(images/icon_debian.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-osx {
-  background: url(images/icon_osx.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-html {
-  background: url(images/icon_html.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-external {
-  background: url(images/icon_links.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-wiki {
-  background: url(images/icon_wiki.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-pdf {
-  background: url(images/icon_pdf.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-html {
-  background: url(images/icon_html.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-info {
-  background: url(images/icon_info.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-
-a { color: #00f; text-decoration: none }
-a:visited { color: #00c }
-a:hover { color: #00f; text-decoration: underline }
-h1 a, h1 a:visited, h1 a:hover { color: #fff; text-decoration: none }
-h2 a, h2 a:visited, h2 a:hover { color: #000; text-decoration: none }
-h3 a, h3 a:visited, h3 a:hover { color: #000; text-decoration: none }
-
-#sourceforge_logo {
-  float: right;
-  padding: 3px 15px 0px 0px;
-}
-
-/* Menu items */
-ul.menu {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.menu-upper {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-  margin-top: 10px;
-  width: 95%;
-  border-bottom: 1px solid;
-  text-align: left;
-}
-ul.menu li {
-  padding: 0px 10px 10px 20px;
-  margin: 0px;
-}
-ul.menu-upper li {
-  padding: 8px 10px 4px 25px;
-  font-size: 0.8em;
-  border: solid;
-  border-width: 1px 1px 1px 1px;
-  margin: 0px 0px 0px 0px;
-  display: inline;
-}
-ul.menu-upper li:hover {
-  border-top: solid 2px #0000ff;
-  border-left: solid 2px #0000ff;
-  border-right: solid 2px #0000ff;  
-}
-ul li.item-introduction {
-  background: #dadaff url(images/icon_info.png) no-repeat 5px 6px;
-}
-ul li.item-download {
-  background: #dadaff url(images/icon_download.png) no-repeat 5px 6px;
-}
-ul li.item-news {
-  background: #dadaff url(images/icon_news.png) no-repeat 5px 6px;
-}
-ul li.item-documentation {
-  background: #dadaff url(images/icon_documentation.png) no-repeat 5px 6px;
-}
-ul li.item-wiki {
-  background: #dadaff url(images/icon_wiki.png) no-repeat 5px 6px;
-}
-ul li.item-screenshots {
-  background: #dadaff url(images/icon_screenshots.png) no-repeat 5px 6px;
-}
-ul li.item-community {
-  background: #dadaff url(images/icon_community.png) no-repeat 5px 6px;
-}
-ul li.item-bug {
-  background: #dadaff url(images/icon_bug.png) no-repeat 5px 6px;
-}
-ul li.item-links {
-  background: #dadaff url(images/icon_links.png) no-repeat 5px 6px;
-}
-ul li.item-license {
-  background: #dadaff url(images/icon_license.png) no-repeat 5px 6px;
-}
-body#index li#n-index {
-    background: #ffffff url(images/icon_info.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#news li#n-news {
-    background: #ffffff url(images/icon_news.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#download li#n-download{
-    background: #ffffff url(images/icon_download.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#documentation li#n-documentation{
-    background: #ffffff url(images/icon_documentation.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#screenshots li#n-screenshots{
-    background: #ffffff url(images/icon_screenshots.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#support li#n-support{
-    background: #ffffff url(images/icon_community.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#bugs li#n-bugs{
-    background: #ffffff url(images/icon_bug.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#license li#n-license {
-    background: #ffffff url(images/icon_license.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-
-/* Forms */
-label {
-  display: block;
-  float: left;
-  width: 130px;
-  font-weight: bold;
-}
-label.normal {
-  color: #444;
-}
-div.explanation {
-  border-left: 130px solid white;
-  font-size: 0.8em;
-  color: #888;
-}
-.programlisting 
-{
-  background: #eeeeff;
-  border: solid 1px #4444ff;
-  padding: 0.5em;
-}
-p.news
-{
-  padding: 0px 40px 0px;
-}
-h4.news
-{
-  padding: 0px 40px 0px;
-}
-ul.newslist
-{
-  padding: 0px 60px 0px;
-}
-table.intro td {
-  vertical-align: top;
-  width: 33.3%;
-  padding: 20px;
-}
-div.feed {
-  width: 100%;
-  padding: 20px;
-}
-div.feedburnerFeedBlock p.feedTitle { 
-    font-size: 1em;
-}
-div.feedburnerFeedBlock a { 
-    color: black;
-}
-div.feedburnerFeedBlock ul a { 
-    color: #00f; text-decoration: none
-}
-div.feedburnerFeedBlock { 
-    font-size: 1em;
-}
-div.feedburnerFeedBlock ul { 
-  list-style-type: none;
-}
-div.feedburnerFeedBlock ul li { 
-    margin-top: 10px;
-}
-div.feedburnerFeedBlock p.date {
-    font-style: italic;
-    font-size: 0.8em;
-    margin: 5px;    
-}
-div.feedburnerFeedBlock p.date:before {
-    content: "(";
-}
-div.feedburnerFeedBlock p.date:after {
-    content: ")";
-}
-div.feedburnerFeedBlock span, span+p {display:inline}
-div.feed span.headline {
-    font-size: 1.25em;
-}
-#creditfooter {
-    float: right;
-}
-div.feedburnerFeedBlock table {
-    table-layout: fixed;
-    width: 100%;
-}
-div.quick-menu {
-    position:fixed;
-    bottom:0;
-    width: 100%;
-}
-div.quick-menu ul.menu-bottom {
-    padding: 5px;
-    border-top: 1px solid #0000a0;
-    text-align: center;
-    background: #dadaff;
-}
-ul.menu-bottom {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-}
-ul.menu-bottom li {
-  padding: 8px 10px 10px 25px;
-  font-size: 0.8em;
-  margin: 0px;
-  display: inline;
-}
-div.copyright {
-    border-top: 1px solid #8e8e8e;
-    text-align: center;
-    color: #8e8e8e;
-    padding-top: 10px;
-    padding-bottom: 50px;
-}
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/homepage/support.html.in igraph-0.6.5/doc/homepage/support.html.in
--- igraph-0.6.5~quantal1/doc/homepage/support.html.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/support.html.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-<h2>Mailing lists</h2>
-
-<p>There are two <b>igraph</b> mailing lists: <code>igraph-help</code>
-  and <code>igraph-announce</code>.
-</p>
-
-<h3><code>igraph-help</code></h3>
-
-<p><code>igraph-help</code> is for general discussion and questions,
-  help, suggestions, etc. See
-  <a href="http://lists.nongnu.org/mailman/listinfo/igraph-help"
-     onClick="javascript:urchinTracker ('/outgoing/mailinglist-help'); ">
-    its page at Savannah</a> for subscription and archives.
-</p>
-
-<h3><code>igraph-announce</code></h3>
-
-<p><code>igraph-announce</code> is a very low-traffic mailing (about
-  two emails per year) list for important announcements only, such as
-  a new <b>igraph</b> release for example. These announcements are
-  also sent to <code>igraph-help</code>, so you don't need to sign up
-  to both mailing lists.
-</p>
-
-<p><code>igraph-announce</code> is a read-only list, you can 
-  not post any messages to it.
-</p>
-
-<p>See <a href="http://lists.nongnu.org/mailman/listinfo/igraph-announce"
-	  onClick="javascript:urchinTracker
-	  ('/outgoing/mailinglist-announce'); "> 
-    <code>igraph-announce</code> at Savannah</a> for subscription and
-    archives.
-</p>
-
diff -Nru igraph-0.6.5~quantal1/doc/homepage/template.html igraph-0.6.5/doc/homepage/template.html
--- igraph-0.6.5~quantal1/doc/homepage/template.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/homepage/template.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<!DOCTYPE html
-  PUBLIC "-//W3C/DTD XHTML 1.0 Transitional//EN"
-   "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-  <title>The igraph library for complex network research</title>
-  <link rel="stylesheet" type="text/css" href="style.css"></link>
-  <link rel="shortcut icon" href="images/igraph3.png" type="image/x-icon" />
-  <!--[if lt IE 7.]>
-      <script defer type="text/javascript" src="pngfix.js"></script>
-  <![endif]-->
-</head>
-
-<body id="$PAGENAME">
-
-<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
-</script>
-<script type="text/javascript">
-  _uacct = "UA-1392972-1";
-  urchinTracker();
-</script> 
-
-<div id="sourceforge_logo">
-<a href="http://sourceforge.net/projects/igraph"><img src="http://sflogo.sourceforge.net/sflogo.php?group_id=160289&type=12" width="120" height="30" border="0" alt="Get The igraph library at SourceForge.net. Fast, secure and Free Open Source software downloads" /></a>
-</div>
-
-<h1><a href="index.html">The <b>igraph</b> library</a>
-</h1>
-
-<ul class="menu-upper">
-  <li class="item-introduction" id="n-index"><a href="index.html">Home</a></li>
-  <li class="item-news" id="n-news"><a href="news.html">News</a></li>
-  <li class="item-download" id="n-download"><a href="download.html">Download</a></li>
-  <li class="item-documentation" id="n-documentation"><a href="documentation.html">Documentation</a></li>
-  <li class="item-wiki"><a href="http://igraph.wikidot.com">Wiki</a></li>
-  <li class="item-screenshots" id="n-screenshots"><a href="screenshots.html">Screenshots</a></li>
-  <li class="item-community" id="n-support"><a href="support.html">Mailing lists</a></li>
-  <li class="item-bug" id="n-bugs"><a href="bugs.html">Bugs</a></li>
-<!--   <li class="item-links" id="n-links"><a href="links.html">Links</a></li> -->
-  <li class="item-license" id="n-license"><a href="license.html">License</a></li>
-</ul>
-
-<div class="igraphlogo">
-<img src="images/igraph2.png" alt="" /><br/>
-Latest version: <b>$VERSION</b><br/>
-<a href="relnotes-$VERSION.html">Release notes</a>
-</div>
-
-<div class="main">
-$CONTENT
-</div>
-
-<div class="quick-menu">
-<ul class="menu-bottom">
-    <li class="item-bug"><a id="qm-reportbug"
-	 href="https://bugs.launchpad.net/igraph/+filebug">
-      <span>Report a bug</span></a></li>
-<!--   <li><a href="https://bugs.launchpad.net/igraph/+filebug"> -->
-<!--       <span>Request a feature</span></a></li> -->
-  <li class="item-bug"><a id="qm-listbugs"
-	 href="https://bugs.launchpad.net/igraph/+bugs">
-      <span>List open bugs</span></a></li>
-  <li class="item-community"><a id="qm-searcharchive"
-	 href="http://lists.gnu.org/archive/html/igraph-help/">
-      <span>Search mailing list</span></a></li>
-  <li class="item-community"><a id="qm-subscribe"
-	 href="http://lists.nongnu.org/mailman/listinfo/igraph-help">
-      <span>Subscribe to mailing list</span></a></li>
-  <li class="item-license"><a id="qm-browsesource"
-	 href="http://bazaar.launchpad.net/~igraph/igraph/0.5-main/files/1139.1.143">
-      <span>Browse source code</span></a></li>
-  <li class="item-documentation"><a id="qm-searchdocs"
-	 href="http://www.google.com/coop/cse?cx=006731217555358536053:yeszjk2wr6q">
-      <span>Search documentation</span></a></li>
-</ul>
-</div>
-
-<div class="copyright">
-    Copyright &copy;
-    2005-2013 <a href="http://igraph.sourceforge.net/">The igraph
-    Project</a>.<br><a href="http://validator.w3.org/check/referer">Optimised</a>
-    for <a href="http://www.w3.org/">standards</a>. Hosted
-    by <a href="http://www.sourceforge.net/">SourceForge</a>. 
-</div>
-
-</body>
-</html>
diff -Nru igraph-0.6.5~quantal1/doc/hrg.xxml igraph-0.6.5/doc/hrg.xxml
--- igraph-0.6.5~quantal1/doc/hrg.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/hrg.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-HRG">
-<title>Hierarchical random graphs</title>
-
-<section>
-<!-- doxrox-include hrg_intro -->
-</section>
-
-<section><title>Representing HRGs</title>
-<!-- doxrox-include igraph_hrg_t -->
-<!-- doxrox-include igraph_hrg_init -->
-<!-- doxrox-include igraph_hrg_destroy -->
-<!-- doxrox-include igraph_hrg_size -->
-<!-- doxrox-include igraph_hrg_resize -->
-</section>
-
-<section><title>Fitting HRGs</title>
-<!-- doxrox-include igraph_hrg_fit -->
-<!-- doxrox-include igraph_hrg_consensus -->
-</section>
-
-<section><title>HRG sampling</title>
-<!-- doxrox-include igraph_hrg_sample -->
-<!-- doxrox-include igraph_hrg_game -->
-</section>
-
-<section><title>Conversion to and from igraph graphs</title>
-<!-- doxrox-include igraph_hrg_dendrogram -->
-<!-- doxrox-include igraph_hrg_create -->
-</section>
-
-<section><title>Predicting missing edges</title>
-<!-- doxrox-include igraph_hrg_predict -->
-</section>
-
-</chapter>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/html/home.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/html/home.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/html/left.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/html/left.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/html/right.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/html/right.png differ
diff -Nru igraph-0.6.5~quantal1/doc/html/style.css igraph-0.6.5/doc/html/style.css
--- igraph-0.6.5~quantal1/doc/html/style.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/html/style.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,236 +0,0 @@
-.author { padding: 0px 30px 0pt; }
-.chapter { padding: 0px 20px 10px; }
-.section { padding: 0px 20px 10px; }
-.index { padding: 0px 20px 10px; }
-.legalnotice { padding: 0px 20px 10px; }
-.programlisting 
-{
-  background: #eeeeff;
-  border: solid 1px #4444ff;
-  padding: 0.5em;
-}
-.variablelist 
-{
-  padding: 4px;
-  margin-left: 3em;
-}
-.variablelist td:first-child
-{
-  vertical-align: top;
-}
-table.navigation 
-{
-    color: #fff;
-    margin: 0;
-    padding: 7px 0 7px 15px;
-    text-shadow: 0px 1px 2px #000;
-    background: #005fd7 url(header_blue.png) repeat-x;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-}
-table.navigation a 
-{
-  color: #fff;
-}
-.navigation .title 
-{
-  font-size: 200%;
-}
-div.refnamediv 
-{
-  margin-top: 2em;
-}
-div.gallery-float 
-{
-  float: left;
-  padding: 10px;
-}
-div.gallery-float img 
-{
-  border-style: none;
-}
-div.gallery-spacer 
-{
-  clear: both;
-}
-
-body {
-    font: medium/150% "Lucida Grande", sans-serif;
-    margin: 0; padding: 0px 0px 10px;
-    color: #333; background: #fff;
-}
-h1 {
-    color: #fff;
-    margin: 0;
-    padding: 7px 0 7px 15px;
-    text-shadow: 0px 1px 2px #000;
-    background: #005fd7 url(images/header_blue.png) repeat-x;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-}
-h2 {
-    font-size: 1.2em;
-}
-h3 {
-    font-size: 1em;
-}
-body.error h1 {
-    background: #d70000;
-    border-bottom: 1px solid #7f0000;
-}
-.main {
-    padding: 7px 15px;
-}
-
-ul.no-bullet {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.no-bullet li {
-  padding: 0; margin: 0;
-}
-li.download {
-  line-height: 1em;
-  padding-bottom: 10px !important;
-}
-li.download .name {
-  font-weight: bold;
-  padding-left: 20px;
-}
-li.download .comment {
-  font-size: 0.8em;
-  color: #888;
-}
-li.download-c {
-  background: url(images/icon_c.png) no-repeat 0px 0px;
-}
-li.download-r {
-  background: url(images/icon_r.png) no-repeat 0px 0px;
-}
-li.download-python {
-  background: url(images/icon_python.png) no-repeat 0px 0px;
-}
-li.download-ruby {
-  background: url(images/icon_ruby.png) no-repeat 0px 0px;
-}
-ul.download-links {
-  list-style-type: none;
-  padding: 2px 0 0 20px; margin: 0;
-  font-size: 0.8em;
-}
-ul.download-links li {
-  padding: 0px 10px 0px 0px; margin: 0;
-  display: inline;
-  padding-bottom: 5px !important;
-}
-ul.download-links li.download-source {
-  background: url(images/icon_source.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-windows {
-  background: url(images/icon_windows.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-debian {
-  background: url(images/icon_debian.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-osx {
-  background: url(images/icon_osx.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-external {
-  background: url(images/icon_links.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-
-a { color: #00f; text-decoration: none }
-a:visited { color: #00c }
-a:hover { color: #00f; text-decoration: underline; cursor: hand; }
-h1 a, h1 a:visited, h1 a:hover { color: #fff; text-decoration: none }
-h2 a, h2 a:visited, h2 a:hover { color: #000; text-decoration: none }
-h3 a, h3 a:visited, h3 a:hover { color: #000; text-decoration: none }
-
-/* Version info */
-#version_info {
-  float: right;
-  font-size: 0.8em;
-  color: #888;
-  padding: 3px 15px 0px 0px;
-}
-
-/* Menu items */
-ul.menu {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.menu-upper {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-}
-
-ul.menu li {
-  padding: 0px 0px 10px 20px;
-  margin: 0px;
-}
-ul.menu-upper li {
-  padding: 3px 10px 10px 20px;
-  font-size: 0.8em;
-  margin: 0px;
-  display: inline;
-}
-ul li.item-introduction {
-  background: url(images/icon_introduction.png) no-repeat 0px 3px;
-}
-ul li.item-download {
-  background: url(images/icon_download.png) no-repeat 0px 3px;
-}
-ul li.item-news {
-  background: url(images/icon_news.png) no-repeat 0px 3px;
-}
-ul li.item-documentation {
-  background: url(images/icon_documentation.png) no-repeat 0px 3px;
-}
-ul li.item-screenshots {
-  background: url(images/icon_screenshots.png) no-repeat 0px 3px;
-}
-ul li.item-community {
-  background: url(images/icon_community.png) no-repeat 0px 3px;
-}
-ul li.item-links {
-  background: url(images/icon_links.png) no-repeat 0px 3px;
-}
-ul li.item-license {
-  background: url(images/icon_license.png) no-repeat 0px 3px;
-}
-
-/* Forms */
-label {
-  display: block;
-  float: left;
-  width: 130px;
-  font-weight: bold;
-}
-label.normal {
-  color: #444;
-}
-div.explanation {
-  border-left: 130px solid white;
-  font-size: 0.8em;
-  color: #888;
-}
-div.example-contents {
-  display: none;
-}
-.example p.title {
-  color: blue;
-  font-size:0.8em;
-}
-.example p.title b:before {
-  content: '\25B6\00a0';
-}
-.example p.title:hover { 
-  color: #00f; 
-  text-decoration: underline;
-  cursor: hand;
-}
diff -Nru igraph-0.6.5~quantal1/doc/html/toggle.js igraph-0.6.5/doc/html/toggle.js
--- igraph-0.6.5~quantal1/doc/html/toggle.js	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/html/toggle.js	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-function getElementByClass(element, className) {
-    tc=element.childNodes;
-    for (var i=0; i<tc.length; i++) {
-	if (tc[i].className == className) { return tc[i]; }
-    }
-    return null;
-}
-
-function toggle(target, show)
-{
-    exdiv=getElementByClass(target, "example");
-    excdiv=getElementByClass(exdiv, "example-contents");
-
-    if (excdiv.style.display != 'block')
-	excdiv.style.display = 'block';
-    else
-	excdiv.style.display = 'none';
-}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/html/up.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/html/up.png differ
diff -Nru igraph-0.6.5~quantal1/doc/igraph-docs.xml igraph-0.6.5/doc/igraph-docs.xml
--- igraph-0.6.5~quantal1/doc/igraph-docs.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/igraph-docs.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-<!ENTITY mdash "&#8212;">
-<!ENTITY aacute "&#xe1;">
-<!ENTITY % local.common.attrib    "xmlns:xi            CDATA       #FIXED       
-'http://www.w3.org/2001/XInclude'" >
-]>
-
-<book id="index" xmlns:xi="http://www.w3.org/2001/XInclude">
-  <bookinfo>
-    <title>&igraph; Reference Manual</title>
-    <authorgroup>
-      <author><firstname>Gábor</firstname><surname>Csárdi</surname>
-      <affiliation><orgname>Department of Statistics, Harvard University
-      </orgname>
-      <address>1 Oxford street, Cambridge, MA, 02138 USA</address>
-      </affiliation>
-      </author>
-      <author><firstname>Tamás</firstname><surname>Nepusz</surname>
-      <affiliation><orgname>Department of Biological Physics,
-      Eötvös University</orgname>
-      <address>1/a Pázmány Péter sétány, 1117 Budapest, Hungary</address>
-      </affiliation>
-      </author>
-    </authorgroup>
-
-    <legalnotice><para>
-      Copyright (C)  2005, 2006, 2007, 2008, 2009, 2010, 2011, 
-      2012 Gábor Csárdi and Tamás Nepusz.
-      Permission is granted to copy, distribute and/or modify this document
-      under the terms of the GNU Free Documentation License, Version 1.2
-      or any later version published by the Free Software Foundation;
-      with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
-      Texts.  A copy of the license is included in the section entitled 
-      <quote>GNU Free Documentation License</quote>.
-    </para></legalnotice>
-  </bookinfo>
-
-  <xi:include href="introduction.xml"/>
-  
-  <xi:include href="installation.xml"/>
-
-  <xi:include href="tutorial.xml"/>
-
-  <xi:include href="basicigraph.xml"/>
-
-  <xi:include href="error.xml"/>
-
-  <xi:include href="memory.xml" />
-
-  <chapter>
-    <title>Data structure library: vector, matrix, other data types</title>
-    <xi:include href="pmt.xml"/>
-    <xi:include href="vector.xml"/>
-    <xi:include href="matrix.xml"/>
-    <xi:include href="sparsematrix.xml"/>
-    <xi:include href="sparsemat.xml"/>
-    <xi:include href="stack.xml"/>
-    <xi:include href="dqueue.xml"/>
-    <xi:include href="heap.xml"/>
-    <xi:include href="strvector.xml"/>
-    <xi:include href="adjlist.xml"/>
-  </chapter>
-
-  <xi:include href="random.xml"/>
-
-  <xi:include href="generators.xml"/>
-
-  <xi:include href="spatialgames.xml"/>
-
-  <xi:include href="iterators.xml"/>  
-
-  <xi:include href="attributes.xml"/>  
-
-  <xi:include href="structural.xml"/>
-
-  <xi:include href="visitors.xml"/>
-
-  <xi:include href="cliques.xml"/>
-
-  <xi:include href="isomorphism.xml"/>
-
-  <xi:include href="motifs.xml"/>
-  
-  <xi:include href="layout.xml"/>  
-
-  <xi:include href="foreign.xml"/>
-
-  <xi:include href="flows.xml"/>
-
-  <xi:include href="separators.xml"/>
-
-  <xi:include href="community.xml"/>
-
-  <xi:include href="hrg.xml"/>
-
-  <xi:include href="scg.xml"/>
-
-  <xi:include href="operators.xml"/>
-  
-  <xi:include href="arpack.xml"/>
-  
-  <xi:include href="bipartite.xml"/>
-
-  <chapter>
-    <title>Advanced igraph programming</title>
-    <xi:include href="threading.xml" />
-    <xi:include href="progress.xml" />
-    <xi:include href="status.xml" />
-  </chapter>
-
-  <xi:include href="nongraph.xml"/>  
-
-  <xi:include href="licenses.xml"/>
-
-  <index/>
-
-</book>
diff -Nru igraph-0.6.5~quantal1/doc/igraph.info.diff igraph-0.6.5/doc/igraph.info.diff
--- igraph-0.6.5~quantal1/doc/igraph.info.diff	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/igraph.info.diff	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
---- igraph.info	2008-07-11 07:10:31.000000000 -0500
-+++ igraph.info.orig	2008-07-11 07:13:28.000000000 -0500
-@@ -1,8 +1,8 @@
- This is igraph_reference_manual.info, produced by makeinfo version 4.11 from igraph.texi.
- 
-+INFO-DIR-SECTION Development
- START-INFO-DIR-ENTRY
--* igraph Reference Manual: (igraph_reference_manual).
--                                                  [MISSING TEXT]
-+* Igraph Reference Manual: (igraph.info).    A library for graphs
- END-INFO-DIR-ENTRY
- 
- 
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/igraphlogo/igraph-white.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/igraphlogo/igraph-white.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/igraphlogo/igraph.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/igraphlogo/igraph.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/igraphlogo/igraph2.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/igraphlogo/igraph2.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/installation.xml igraph-0.6.5/doc/installation.xml
--- igraph-0.6.5~quantal1/doc/installation.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/installation.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,142 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-installation">
-<title>Installation</title>
-
-<para>
-First download the latest version of the <command>igraph</command> C
-library from
-<ulink
-    url="https://sourceforge.net/projects/igraph/files/">SourceForge</ulink>,
-and uncompress it to a temporary directory:
-<programlisting>
-$ tar xzf igraph-0.2.tar.gz 
-$ cd igraph-0.2
-</programlisting>
-</para>
-
-<para>
-To install the complete C library typing
-<programlisting>
-$ ./configure
-$ make
-$ make install
-</programlisting>
-(the latter as root) should work on most systems. You can try
-<programlisting>
-$ ./configure --help
-</programlisting>
-to see installations options, and reading the <filename>INSTALL</filename> 
-file. 
-</para>
-
-<para>
-Installing the <command>igraph</command> R package is very simple,
-you don't need to download anything by hand, just give the command 
-<programlisting>
-> install.packages("igraph", lib="~/.R/library")
-</programlisting>
-in R and select a mirror site close to you. The
-<parameter>lib</parameter> argument specifies the directory to 
-which the package will be installed. If not specified, this will be
-default system wide R package directory. You must have write permissions
-for this directory.
-</para>
-
-<para>
-Also, consult your R documentation.
-</para>
-
-<para>
-Installing the <command>igraph</command> Python package is a little bit
-more difficult, since chances are that you have to compile it for yourself
-(as long as there is no compile farm at the Python Package Index and we can't
-compile it ourselves to all platforms). First, check if there is a compiled
-version available for your system at <ulink
-url="http://www.python.org/pypi/igraph">igraph's Python Package Index
-page</ulink>. If there is, just use that. (Python eggs should be put anywhere
-in your Python library path, executable installers should be executed of
-course). If there isn't, you'll have to compile it by hand. So, first
-install a recent C compiler.
-</para>
-
-<para>
-We usually compile <command>igraph</command> with the
-<ulink url="http://gcc.gnu.org">GNU C compiler</ulink>. If you are a Windows
-user, you can find it as part of the
-<ulink url="http://www.cygwin.com">Cygwin</ulink> environment or in the
-<ulink url="http://www.mingw.org">MinGW+MSYS</ulink> project. You can also
-try Microsoft's free C compiler suite (or even worse, Visual Studio), but
-there are known issues with the compilation of <command>igraph</command>
-in MSVC, and you'll have to resolve them yourself by tweaking the source
-code. (Patches are welcome! :)). If you use Linux, <command>gcc</command> is
-usually included in your default system, but even if it isn't, there will
-be a package from which you can install it. (In Debian and Ubuntu Linux,
-you'll have to install the package called <command>build-essential</command>).
-If you have a Mac, <command>gcc</command> is part of the
-<application>Xcode</application> developer suite, which is usually included
-in your OS X install DVD, or can be obtained freely from the
-<ulink url="http://developer.apple.com/tools/downloads/">Apple Developer
-Connection</ulink> website.
-</para>
-
-<para>
-After having obtained a C compiler, you'll have to install an XML processing
-library called <command>libxml2</command>. Windows users should get it from
-<ulink url="http://xmlsoft.org">this website</ulink> (there are binary
-versions, no need to compile anything), Linux users should be able to find
-a package again in their respective distribution (Debian and Ubuntu users:
-install the <command>libxml2</command> and <command>libxml2-dev</command> libraries).
-Mac users should not do anything, since <command>libxml2</command> is part of the
-default system installation. However, you should check it anyway, launch
-a terminal and type the following command:
-<programlisting>
-$ xml2-config
-</programlisting>
-If you don't receive any error message, you can go on to the next step.
-</para>
-
-<para>
-Now, get the <command>igraph</command> source from the
-<ulink url="http://www.python.org/pypi/igraph">Python Package Index</ulink>,
-extract it to a directory and start the compilation. On Windows, launch
-the Cygwin or MinGW environment and type:
-<programlisting>
-$ python setup.py build --compiler=cygwin
-</programlisting>
-(Instead of <command>--compiler=cygwin</command>,
-<command>--compiler=mingw32</command> should also work, then you have no
-POSIX emulation available (you don't really need it for
-<command>igraph</command> yet), but you also won't need
-<filename>cygwin1.dll</filename>). If the shell keeps on complaining that
-it does not find the Python
-interpreter, use its full path. For instance, if you have Python installed
-in <filename>C:\Devel\Python24</filename>, use the following command:
-<programlisting>
-$ /cygdrive/c/devel/python24/python setup.py build --compiler=cygwin
-</programlisting>
-If the compilation finished without errors, you can install the library:
-<programlisting>
-$ python setup.py install
-</programlisting>
-(Use the full path again if necessary).
-</para>
-
-<para>
-Linux and Mac users should succeed with the following commands issued from the
-<command>igraph</command> root directory:
-<programlisting>
-$ python setup.py build
-$ python setup.py install
-</programlisting>
-Note that you'll need write permissions to the Python library path, so
-usually you must have root permissions to issue the second command. If
-you want to install it to a different directory, just copy everything
-from the <filename>build/lib.*</filename> subdirectory to wherever you want.
-</para>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/introduction.xml igraph-0.6.5/doc/introduction.xml
--- igraph-0.6.5~quantal1/doc/introduction.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/introduction.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,105 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-introduction">
-<title>Introduction</title>
-
-<para>
-This is another library for creating and manipulating graphs.
-You can look at it two ways: first, igraph contains the implementation
-of quite a lot graph algorithms. These include classic graph
-algorithms like graph isomorphism, graph girth and connectivity and
-also the new wave graph algorithms like transitivity, graph motifs and 
-community structure detection. Skim through the table of contents
-or the index of this book to get an impression.</para>
-
-<para>
-Second, igraph provides a platform for the developing and/or
-implementing graph algorithms. It has a quite efficient data structure
-for representing graphs and a number of other data structures like
-flexible vectors, stacks, heaps, queues, adjacency lists to accomplish
-this. In fact these data structures evolved along the
-implementation of the classic and non-classic graph algorithms which
-make up the major part of the igraph library. This way they were fine tuned
-and checked for correctness several times.
-</para>
-
-<para>
-Our main goal with developing igraph was to create a graph library
-which is efficient on large but not extremely large graphs. More
-precisely, it is assumed that the graph(s) fit into the physical
-memory of the computer. Nowadays this means graphs with
-several million vertices and/or edges. Our definition of efficient is
-that it runs fast, both in theory and (more importantly) in practice.
-</para>
-
-<para>
-We believe that one of the big strengths of igraph is that it can be
-embedded into a higher level language or environment. Two such
-embeddings (or interfaces if you look at them the other way)
-are currently being developed by us: igraph as a GNU R
-package and igraph as a Python extension module. A third embedding,
-being developed by another developer is a Ruby extension. Other are
-likely to come. The high level languages as R or Python make it
-possible to do use graph routines with mush greater comfort, without
-actually writing a single line of C code. They have some, usually very
-small, speed penalty compared to the C version, but add ease and much
-flexibility. This manual however covers only the C library. If you 
-want to use Python or GNU R, please see the documentation written
-specifically for these interfaces and come back here only if you're
-interested in some detail which is not covered in those documents.
-</para>
-
-<para>
-We still consider igraph as a child project. It has much room for
-development and we are sure that it will improve a lot in the near
-future. Any feedback we can get from the users is very important for
-us, as most of the time these questions and comments guide us in what
-to add and what to improve.
-</para>
-
-<para>
-igraph is open source and distributed under the terms of the GNU GPL.
-We strongly believe that all the algorithms used in science, let that
-be graph theory or not, should have an efficient open source
-implementation allowing use and modification for anyone.
-</para>
-
-<section><title>&igraph; is free software</title>
-<para>
-    igraph library
-</para><para>
-    Copyright (C) 2003-2012  Gabor Csardi &lt;csardi.gabor@gmail.com>
-    334 Harvard st, Cambridge MA, 02139, USA
-</para><para>
-    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 2 of the License, or
-    (at your option) any later version.
-</para><para>
-    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.
-</para><para>
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-</para>
-</section>
-
-<section><title>Citing &igraph;</title>
-<para>
-To cite &igraph; in publications, please use the following
-reference:
-</para><para>
-Gábor Csárdi, Tamás Nepusz: The igraph software package for complex network
-research. InterJournal Complex Systems, 1695, 2006.
-</para>
-
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/isomorphism.xxml igraph-0.6.5/doc/isomorphism.xxml
--- igraph-0.6.5~quantal1/doc/isomorphism.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/isomorphism.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Isomorphism">
-<title>Graph Isomorphism</title>
-
-<section><title>The simple interface</title>
-<!-- doxrox-include about_graph_isomorphism -->
-<!-- doxrox-include igraph_permute_vertices -->
-<!-- doxrox-include igraph_isomorphic -->
-<!-- doxrox-include igraph_subisomorphic -->
-</section>
-
-<section><title>The BLISS algorithm</title>
-<!-- doxrox-include about_bliss -->
-<!-- doxrox-include igraph_bliss_sh_t -->
-<!-- doxrox-include igraph_bliss_info_t -->
-<!-- doxrox-include igraph_canonical_permutation -->
-<!-- doxrox-include igraph_isomorphic_bliss -->
-<!-- doxrox-include igraph_automorphisms -->
-</section>
-
-<section><title>The VF2 algorithm</title>
-<!-- doxrox-include igraph_isomorphic_vf2 -->
-<!-- doxrox-include igraph_count_isomorphisms_vf2 -->
-<!-- doxrox-include igraph_get_isomorphisms_vf2 -->
-<!-- doxrox-include igraph_isohandler_t -->
-<!-- doxrox-include igraph_isocompat_t -->
-<!-- doxrox-include igraph_isomorphic_function_vf2 -->
-<!-- doxrox-include igraph_subisomorphic_vf2 -->
-<!-- doxrox-include igraph_count_subisomorphisms_vf2 -->
-<!-- doxrox-include igraph_get_subisomorphisms_vf2 -->
-<!-- doxrox-include igraph_subisomorphic_function_vf2 -->
-</section>
-
-<section><title>Functions for graphs with 3 or 4 vertices</title>
-<!-- doxrox-include igraph_isomorphic_34 -->
-<!-- doxrox-include igraph_isoclass -->
-<!-- doxrox-include igraph_isoclass_subgraph -->
-<!-- doxrox-include igraph_isoclass_create -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/iterators.xxml igraph-0.6.5/doc/iterators.xxml
--- igraph-0.6.5~quantal1/doc/iterators.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/iterators.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,99 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Iterators">
-<title>Vertex and Edge Selectors and Sequences, Iterators</title>
-
-<section>
-<!-- doxrox-include about_iterators -->
-</section>
-
-<section><title>Vertex selector constructors</title>
-<!-- doxrox-include about_vertex_selectors -->
-<!-- doxrox-include igraph_vs_all -->
-<!-- doxrox-include igraph_vs_adj -->
-<!-- doxrox-include igraph_vs_nonadj -->	
-<!-- doxrox-include igraph_vs_none -->
-<!-- doxrox-include igraph_vs_1 -->
-<!-- doxrox-include igraph_vs_vector -->
-<!-- doxrox-include igraph_vs_vector_small -->
-<!-- doxrox-include igraph_vs_vector_copy -->
-<!-- doxrox-include igraph_vs_seq -->
-</section>
-
-<section><title>Generic vertex selector operations</title>
-<!-- doxrox-include igraph_vs_copy -->
-<!-- doxrox-include igraph_vs_destroy -->
-<!-- doxrox-include igraph_vs_is_all -->
-<!-- doxrox-include igraph_vs_size -->
-<!-- doxrox-include igraph_vs_type -->
-</section>
-
-<section><title>Immediate vertex selectors</title>
-<!-- doxrox-include igraph_vss_all -->
-<!-- doxrox-include igraph_vss_none -->
-<!-- doxrox-include igraph_vss_1 -->
-<!-- doxrox-include igraph_vss_vector -->
-<!-- doxrox-include igraph_vss_seq -->
-</section>
-
-<section><title>Vertex iterators</title>
-<!-- doxrox-include igraph_vit_create -->
-<!-- doxrox-include igraph_vit_destroy -->
-<section><!-- doxrox-include IGRAPH_VIT --></section>
-<!-- doxrox-include IGRAPH_VIT_NEXT -->
-<!-- doxrox-include IGRAPH_VIT_END -->
-<!-- doxrox-include IGRAPH_VIT_SIZE -->
-<!-- doxrox-include IGRAPH_VIT_RESET -->
-<!-- doxrox-include IGRAPH_VIT_GET -->
-</section>
-
-<section><title>Edge selector constructors</title>
-<!-- doxrox-include igraph_es_all -->
-<!-- doxrox-include igraph_es_incident -->
-<!-- doxrox-include igraph_es_none -->
-<!-- doxrox-include igraph_es_1 -->
-<!-- doxrox-include igraph_es_vector -->
-<!-- doxrox-include igraph_es_fromto -->
-<!-- doxrox-include igraph_es_seq -->
-<!-- doxrox-include igraph_es_pairs -->
-<!-- doxrox-include igraph_es_pairs_small -->
-<!-- doxrox-include igraph_es_vector_copy -->
-</section>
-
-<section><title>Immediate edge selectors</title>
-<!-- doxrox-include igraph_ess_all -->
-<!-- doxrox-include igraph_ess_none -->
-<!-- doxrox-include igraph_ess_1 -->
-<!-- doxrox-include igraph_ess_vector -->
-<!-- doxrox-include igraph_ess_seq -->
-</section>
-
-<section><title>Generic edge selector operations</title>
-<!-- doxrox-include igraph_es_copy -->
-<!-- doxrox-include igraph_es_destroy -->
-<!-- doxrox-include igraph_es_is_all -->
-<!-- doxrox-include igraph_es_size -->
-<!-- doxrox-include igraph_es_type -->
-</section>
-
-<section><title>Edge iterators</title>
-<!-- doxrox-include igraph_eit_create -->
-<!-- doxrox-include igraph_eit_destroy -->
-<section><!-- doxrox-include IGRAPH_EIT --></section>
-<!-- doxrox-include IGRAPH_EIT_NEXT -->
-<!-- doxrox-include IGRAPH_EIT_END -->
-<!-- doxrox-include IGRAPH_EIT_SIZE -->
-<!-- doxrox-include IGRAPH_EIT_RESET -->
-<!-- doxrox-include IGRAPH_EIT_GET -->
-</section>
-
-
-<!-- <section><title>Examples</title>
-	</section> 
--->
-
-</chapter>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/kkplots-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/kkplots-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/kkplots.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/kkplots.png differ
diff -Nru igraph-0.6.5~quantal1/doc/layout.xxml igraph-0.6.5/doc/layout.xxml
--- igraph-0.6.5~quantal1/doc/layout.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/layout.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Layout">
-<title>Generating Layouts for Graph Drawing</title>
-
-<section><title>2D layout generators</title>
-<!-- doxrox-include about_layouts -->
-<!-- doxrox-include igraph_layout_random -->
-<!-- doxrox-include igraph_layout_circle -->
-<!-- doxrox-include igraph_layout_star -->
-<!-- doxrox-include igraph_layout_grid -->
-<!-- doxrox-include igraph_layout_graphopt -->
-<section><title>The DrL layout generator</title>
-<!-- doxrox-include about_drl -->
-<!-- doxrox-include igraph_layout_drl_options_t -->
-<!-- doxrox-include igraph_layout_drl_default_t -->
-<!-- doxrox-include igraph_layout_drl_options_init -->
-<!-- doxrox-include igraph_layout_drl -->
-<!-- doxrox-include igraph_layout_drl_3d -->
-</section>
-<!-- doxrox-include igraph_layout_fruchterman_reingold -->
-<!-- doxrox-include igraph_layout_kamada_kawai -->
-<!-- doxrox-include igraph_layout_mds -->
-<!-- doxrox-include igraph_layout_grid_fruchterman_reingold -->
-<!-- doxrox-include igraph_layout_lgl -->
-<!-- doxrox-include igraph_layout_reingold_tilford -->
-<!-- doxrox-include igraph_layout_reingold_tilford_circular -->
-<!-- doxrox-include igraph_layout_sugiyama -->
-</section>
-
-<section><title>3D layout generators</title>
-<!-- doxrox-include igraph_layout_random_3d -->
-<!-- doxrox-include igraph_layout_sphere -->
-<!-- doxrox-include igraph_layout_grid_3d -->
-<!-- doxrox-include igraph_layout_fruchterman_reingold_3d -->
-<!-- doxrox-include igraph_layout_kamada_kawai_3d -->
-</section>
-
-<section><title>Merging layouts</title>
-<!-- doxrox-include igraph_layout_merge_dla -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/licenses.xml igraph-0.6.5/doc/licenses.xml
--- igraph-0.6.5~quantal1/doc/licenses.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/licenses.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY % local.common.attrib    "xmlns:xi            CDATA       #FIXED       
-'http://www.w3.org/2001/XInclude'" >
-]>
-
-<chapter id="igraph-Licenses">
-<title>Licenses for igraph and this manual</title>
-
-  <xi:include href="gpl.xml"/>
-  <xi:include href="fdl.xml"/>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/matrix.xxml igraph-0.6.5/doc/matrix.xxml
--- igraph-0.6.5~quantal1/doc/matrix.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/matrix.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,119 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Matrices">
-<title>Matrices</title>
-
-<section>
-<!-- doxrox-include about_igraph_matrix_t_objects -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_matrix_constructor_and_destructor -->
-<!-- doxrox-include igraph_matrix_init -->
-<!-- doxrox-include igraph_matrix_copy -->
-<!-- doxrox-include igraph_matrix_destroy -->
-</section>
-
-<section><title>Initializing elements</title>
-<!-- doxrox-include igraph_matrix_null -->
-<!-- doxrox-include igraph_matrix_fill -->
-</section>
-
-<section><title>Copying matrices</title>
-<!-- doxrox-include igraph_matrix_copy_to -->
-<!-- doxrox-include igraph_matrix_update -->
-<!-- doxrox-include igraph_matrix_swap -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_matrix_accessing_elements -->
-<!-- doxrox-include MATRIX -->
-<!-- doxrox-include igraph_matrix_e -->
-<!-- doxrox-include igraph_matrix_e_ptr -->
-<!-- doxrox-include igraph_matrix_set --> 
-</section>
-
-<section><title>Operations on rows and columns</title>
-<!--doxrox-include igraph_matrix_get_row -->
-<!--doxrox-include igraph_matrix_get_col -->
-<!--doxrox-include igraph_matrix_set_row -->
-<!--doxrox-include igraph_matrix_set_col -->
-<!--doxrox-include igraph_matrix_swap_rows -->
-<!--doxrox-include igraph_matrix_swap_cols -->
-<!--doxrox-include igraph_matrix_select_rows -->
-<!--doxrox-include igraph_matrix_select_cols -->
-<!--doxrox-include igraph_matrix_select_rows_cols -->
-</section>
-
-<section>
-<title>Matrix operations</title>
-<!-- doxrox-include igraph_matrix_add_constant -->
-<!-- doxrox-include igraph_matrix_scale -->
-<!-- doxrox-include igraph_matrix_add -->
-<!-- doxrox-include igraph_matrix_sub -->
-<!-- doxrox-include igraph_matrix_mul_elements -->
-<!-- doxrox-include igraph_matrix_div_elements -->
-<!-- doxrox-include igraph_matrix_sum -->
-<!-- doxrox-include igraph_matrix_prod -->
-<!-- doxrox-include igraph_matrix_rowsum -->
-<!-- doxrox-include igraph_matrix_colsum -->
-<!-- doxrox-include igraph_matrix_transpose -->
-</section>
-
-<section><title>Matrix comparisons</title>
-<!-- doxrox-include igraph_matrix_all_e -->
-<!-- doxrox-include igraph_matrix_all_l -->
-<!-- doxrox-include igraph_matrix_all_g -->
-<!-- doxrox-include igraph_matrix_all_le -->
-<!-- doxrox-include igraph_matrix_all_ge -->
-</section>
-
-<section>
-<title>Combining matrices</title>
-<!-- doxrox-include igraph_matrix_rbind -->
-<!-- doxrox-include igraph_matrix_cbind -->
-</section>
-
-<section>
-<title>Finding minimum and maximum</title>
-<!-- doxrox-include igraph_matrix_min -->
-<!-- doxrox-include igraph_matrix_max -->
-<!-- doxrox-include igraph_matrix_which_min -->
-<!-- doxrox-include igraph_matrix_which_max -->
-<!-- doxrox-include igraph_matrix_minmax -->
-<!-- doxrox-include igraph_matrix_which_minmax -->
-</section>
-
-<section>
-<title>Matrix properties</title>
-<!-- doxrox-include igraph_matrix_empty -->
-<!-- doxrox-include igraph_matrix_isnull -->
-<!-- doxrox-include igraph_matrix_size -->
-<!-- doxrox-include igraph_matrix_capacity -->
-<!-- doxrox-include igraph_matrix_nrow -->
-<!-- doxrox-include igraph_matrix_ncol -->
-<!-- doxrox-include igraph_matrix_is_symmetric -->
-<!-- doxrox-include igraph_matrix_maxdifference -->
-</section>
-
-<section><title>Searching for elements</title>
-<!-- doxrox-include igraph_matrix_contains -->
-<!-- doxrox-include igraph_matrix_search -->
-</section>
-
-<section>
-<title>Resizing operations</title>
-<!-- doxrox-include igraph_matrix_resize -->
-<!-- doxrox-include igraph_matrix_resize_min -->
-<!-- doxrox-include igraph_matrix_add_rows -->
-<!-- doxrox-include igraph_matrix_add_cols -->
-<!-- doxrox-include igraph_matrix_remove_row -->
-<!-- doxrox-include igraph_matrix_remove_col -->
-</section>
-
-</section>
-
diff -Nru igraph-0.6.5~quantal1/doc/memory.xxml igraph-0.6.5/doc/memory.xxml
--- igraph-0.6.5~quantal1/doc/memory.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/memory.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Memory">
-<title>Memory (de)allocation</title>
-
-<!-- doxrox-include igraph_free -->
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/motifs.xxml igraph-0.6.5/doc/motifs.xxml
--- igraph-0.6.5~quantal1/doc/motifs.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/motifs.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Motifs">
-<title>Graph Motifs, Dyad Census and Triad Census</title>
-
-<para>
-This section deals with functions which find small induced subgraphs in a
-graph. These were first defined for subgraphs of two and three vertices 
-by Holland and Leinhardt, and named dyad census and triad census.
-</para>
-
-<!-- doxrox-include igraph_dyad_census -->
-<!-- doxrox-include igraph_triad_census -->
-
-<section><title>Graph motifs</title>
-<!-- doxrox-include igraph_motifs_randesu -->
-<!-- doxrox-include igraph_motifs_randesu_no -->
-<!-- doxrox-include igraph_motifs_randesu_estimate -->
-<!-- doxrox-include igraph_motifs_randesu_callback -->
-<!-- doxrox-include igraph_motifs_handler_t -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/nongraph.xxml igraph-0.6.5/doc/nongraph.xxml
--- igraph-0.6.5~quantal1/doc/nongraph.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/nongraph.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Nongraph">
-<title>Not Graph Related Functions </title>
-
-<section><title>Igraph version number</title>
-<!-- doxrox-include igraph_version -->
-</section>
-
-<section><title>Running Mean of a Time Series</title>
-<!-- doxrox-include igraph_running_mean -->
-</section>
-
-<section><title>Random Sampling from Very Long Sequences</title>
-<!-- doxrox-include igraph_random_sample -->
-</section>
-
-<section><title>Convex hull of a set of points on a plane</title>
-<!-- doxrox-include igraph_convex_hull -->
-</section>
-
-<section><title>Fitting power-law distributions to empirical data</title>
-<!-- doxrox-include igraph_plfit_result_t -->
-<!-- doxrox-include igraph_power_law_fit -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/operators.xxml igraph-0.6.5/doc/operators.xxml
--- igraph-0.6.5~quantal1/doc/operators.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/operators.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Operators">
-<title>Graph Operators</title>
-
-<section><title>Union and intersection</title>
-<!-- doxrox-include igraph_disjoint_union -->
-<!-- doxrox-include igraph_disjoint_union_many -->
-<!-- doxrox-include igraph_union -->
-<!-- doxrox-include igraph_union_many -->
-<!-- doxrox-include igraph_intersection -->
-<!-- doxrox-include igraph_intersection_many -->
-</section>
-
-<section><title>Other set-like operators</title>
-<!-- doxrox-include igraph_difference -->
-<!-- doxrox-include igraph_complementer -->
-<!-- doxrox-include igraph_compose -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/ICCS.bst igraph-0.6.5/doc/papers/iccs06/ICCS.bst
--- igraph-0.6.5~quantal1/doc/papers/iccs06/ICCS.bst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/ICCS.bst	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-% Adapted to the specifications of the 
% Proceedings of the International Conference on Complex Systems
% B. Sendhoff 09/03/97
%
% PLEASE NOTE:
% only the following entries have been tested:
% article, inproceedings, book, inbook, techreport
% the other entries should run without error but might not always 
% stick to the conventions of the ICCS 1997
% 
% ========================================================================
%
% ACM Transactions bibliography style (24-Jan-88 version)
%    A lot like abbrv.bst, but names come out "Last, initials", and in \sc.
%    Some dates are parenthesized.
%
%    History
%     2/ 6/86   (HWT)   Original version, by Howard Trickey.
%     3/ 5/86   (HWT)   Put in pp. everywhere but articles, as per ACM style.
%     1/24/88   (OP&HWT) Updated for BibTeX version 0.99a, Oren Patashnik;
%                       corrected the abbreviations to "Mar." and "Sept.";
%                       THIS `acm' VERSION DOES NOT WORK WITH BIBTEX 0.98i.

ENTRY
  { address
    author
    booktitle
    chapter
    edition
    editor
    howpublished
    institution
    journal
    key
    month
    note
    number
    organization
    pages
    publisher
    school
    series
    title
    type
    volume
    year
  }
  {}
  { label }

INTEGERS { output.state before.all mid.sentence after.sentence after.block }

FUNCTION {init.state.consts}
{ #0 'before.all :=
  #1 'mid.sentence :=
  #2 'after.sentence :=
  #3 'after.block :=
}

STRINGS { s t t1 t2 }

FUNCTION {output.nonnull}
{ 's :=
  output.state mid.sentence =
    { " " * write$ }
    { output.state after.block =
        %% { add.period$ write$
        {  ", " * write$
          newline$
          "\newblock " write$
        }
        { output.state before.all =
            'write$
            { add.period$ " " * write$ }
          if$
        }
      if$
      mid.sentence 'output.state :=
    }
  if$
  s
}

FUNCTION {output}
{ duplicate$ empty$
    'pop$
    'output.nonnull
  if$
}

FUNCTION {output.check}
{ 't :=
  duplicate$ empty$
    { pop$ "empty " t * " in " * cite$ * warning$ }
    'output.nonnull
  if$
}

FUNCTION {output.bibitem}
{ newline$
  "\bibitem{" write$
  cite$ write$
  "}" write$
  newline$
  ""
  before.all 'output.state :=
}

FUNCTION {fin.entry}
{ add.period$
  write$
  newline$
}

FUNCTION {new.block}
{ output.state before.all =
    'skip$
    { after.block 'output.state := }
  if$
}

FUNCTION {new.sentence}
{ output.state after.block =
    'skip$
    { output.state before.all =
        'skip$
        { after.sentence 'output.state := }
      if$
    }
  if$
}

FUNCTION {not}
{   { #0 }
    { #1 }
  if$
}

FUNCTION {and}
{   'skip$
    { pop$ #0 }
  if$
}

FUNCTION {or}
{   { pop$ #1 }
    'skip$
  if$
}

FUNCTION {new.block.checka}
{ empty$
    'skip$
    'new.block
  if$
}

FUNCTION {new.block.checkb}
{ empty$
  swap$ empty$
  and
    'skip$
    'new.block
  if$
}

FUNCTION {field.or.null}
{ duplicate$ empty$
    { pop$ "" }
    'skip$
  if$
}

FUNCTION {emphasize}
{ duplicate$ empty$
    { pop$ "" }
    { "{\em " swap$ * "}" * }
  if$
}

FUNCTION {emphasizeic}
{ duplicate$ empty$
    { pop$ "" }
    { "{\em " swap$ * "\/}" * }
  if$
}

FUNCTION {scapify}
{ duplicate$ empty$
    { pop$ "" }
    { "{\sc " swap$ * "}" * }
  if$
}

INTEGERS { nameptr namesleft numnames }

FUNCTION {format.names}
{ 's :=
  #1 'nameptr :=               % nameptr = 1;
  s num.names$ 'numnames :=    % numnames = num.name$(s);
  numnames 'namesleft :=
  
  { namesleft #0 > }
      { nameptr #1 =
        { s nameptr "{vv~}{ll}"    format.name$ 't1 := 
          s nameptr "{, jj}{, ff}" format.name$ 't2 :=
          t1 "{\rm " * t2 * "}" * 't := }  
        { s nameptr "{ff~}{vv~}" format.name$ 't1 := 
          s nameptr "{ll}{, jj}" format.name$ 't2 := 
          "{\rm " t1 * "}" * t2 * 't := }
      if$
      nameptr #1 >
        { namesleft #1 >
            { ", " * t * }
            { t "others" =
                { ", {\rm et~al.}" * }
                { ", {\rm and} " * t * }
              if$
            }
          if$
        }
        't
      if$
      nameptr #1 + 'nameptr :=
      namesleft #1 - 'namesleft :=
    }
  while$
}

% For names inside entries (e.g., editors of an "In ...");
% this is exactly ABBRV.BST's `format.names' function.
FUNCTION {format.innames}
{ 's :=
  #1 'nameptr :=
  s num.names$ 'numnames :=
  numnames 'namesleft :=
    { namesleft #0 > }
    { s nameptr "{f.~}{vv~}{ll}{, jj}" format.name$ 't :=
      nameptr #1 >
        { namesleft #1 >
            { ", " * t * }
            { numnames #2 >
                { "," * }
                'skip$
              if$
              t "others" =
                { " et~al." * }
                { " and " * t * }
              if$
            }
          if$
        }
        't
      if$
      nameptr #1 + 'nameptr :=
      namesleft #1 - 'namesleft :=
    }
  while$
}

FUNCTION {format.authors}
{ author empty$
    { "" }
    { author format.names scapify }
  if$
}

FUNCTION {format.editors}
{ editor empty$
    { "" }
    { editor format.names scapify
      editor num.names$ #1 >
        { " eds." * }
        { " ed." * }
      if$
    }
  if$
}

FUNCTION {format.ineditors}
{ editor empty$
    { "" }
    { "(" editor format.innames scapify *
      editor num.names$ #1 >
        { " eds.)" * }
        { " ed.)" * }
      if$
    }
  if$
}

FUNCTION {format.title}
{ title empty$
    { "" }
    { "``" title  "''" * "t" change.case$ * }
    
  if$
}

FUNCTION {n.dashify}
{ 't :=
  ""
    { t empty$ not }
    { t #1 #1 substring$ "-" =
        { t #1 #2 substring$ "--" = not
            { "--" *
              t #2 global.max$ substring$ 't :=
            }
            {   { t #1 #1 substring$ "-" = }
                { "-" *
                  t #2 global.max$ substring$ 't :=
                }
              while$
            }
          if$
        }
        { t #1 #1 substring$ *
          t #2 global.max$ substring$ 't :=
        }
      if$
    }
  while$
}

FUNCTION {format.date}
{ year empty$
    { month empty$
        { "" }
        { "there's a month but no year in " cite$ * warning$
          month
        }
      if$
    }
    { month empty$
        %% 'year
        { "(" year * ")" * }
        { "(" month * " " * year * ")" *}
      if$
    }
  if$
}

FUNCTION {format.btitle}
{ title emphasize
}

FUNCTION {tie.or.space.connect}
{ duplicate$ text.length$ #3 <
    { "~" }
    { " " }
  if$
  swap$ * *
}

FUNCTION {either.or.check}
{ empty$
    'pop$
    { "can't use both " swap$ * " fields in " * cite$ * warning$ }
  if$
}

FUNCTION {format.bvolume}
{ volume empty$
    { "" }
    { "vol.~" volume *
      series empty$
        'skip$
        { " of " * series emphasize * }
      if$
      "volume and number" number either.or.check
    }
  if$
}

FUNCTION {format.number.series}
{ volume empty$
    { number empty$
        { series field.or.null }
        { output.state mid.sentence =
            { "no.~" }
            { "No.~" }
          if$
          number *
          series empty$
            { "there's a number but no series in " cite$ * warning$ }
            { " in " * series * }
          if$
        }
      if$
    }
    { "" }
  if$
}

FUNCTION {format.edition}
{ edition empty$
    { "" }
    { output.state mid.sentence =
        { edition "l" change.case$ "~ed." * }
        { edition "t" change.case$ "~ed." * }
      if$
    }
  if$
}

FUNCTION {format.pages}
{ pages empty$
    { "" }
    { pages n.dashify }
  if$
}

INTEGERS { multiresult }

FUNCTION {multi.page.check}
{ 't :=
  #0 'multiresult :=
    { multiresult not
      t empty$ not
      and
    }
    { t #1 #1 substring$
      duplicate$ "-" =
      swap$ duplicate$ "," =
      swap$ "+" =
      or or
        { #1 'multiresult := }
        { t #2 global.max$ substring$ 't := }
      if$
    }
  while$
  multiresult
}

FUNCTION {format.pp.pages}
{ pages empty$
    { "" }
    { pages multi.page.check
        { "pp.~" pages n.dashify * }
        { "p.~" pages * }
      if$
    }
  if$
}

FUNCTION {format.journal.vol.num.date}
{ journal empty$
    { "empty journal in " cite$ * warning$
      ""
    }
    { journal
      volume empty$
        'skip$
        { " {\bf" * volume * "}" * }
      if$
      number empty$
        'emphasizeic
        { emphasize ", " * number * }
      if$
      year empty$
        { "empty year in " cite$ * warning$ }
        %% { " (" * format.date * ")" * }
        { " " * format.date * }
      if$
    }
  if$
}

FUNCTION {format.chapter.pages}
{ chapter empty$
    'format.pp.pages
    { type empty$
        { "ch.~" chapter * }
        { type "l" change.case$ chapter tie.or.space.connect }
      if$
      pages empty$
        'skip$
        { ", " * format.pp.pages * }
      if$
    }
  if$
}

FUNCTION {format.in.ed.booktitle}
{ booktitle empty$
    { "" }
    { booktitle emphasize
      editor empty$
        'skip$
        { ", " * format.ineditors * }
      if$
    }
  if$
}

% The proceedings title (it's on the stack) gets an (address, date) appended
FUNCTION {format.proc.date}
{ duplicate$ empty$
    { pop$ "" }
    { year empty$
        { "empty year in " cite$ * warning$
          address empty$
            'emphasize
            { emphasizeic
              " (" * address * ")" *
            }
          if$
        }
        { emphasizeic
          %% " (" *
          address empty$
            'skip$
            { " (" * address * ", " * ")" *}
          if$
        %%  format.date *
        %%  ")" *
        }
      if$
    }
  if$
}

FUNCTION {format.in.proc.date}
{ booktitle empty$
    { "" }
    { booktitle format.proc.date }
 if$
}

FUNCTION {empty.misc.check}
{ author empty$ title empty$ howpublished empty$
  month empty$ year empty$ note empty$
  and and and and and
  key empty$ not and
    { "all relevant fields are empty in " cite$ * warning$ }
    'skip$
  if$
}

FUNCTION {format.thesis.type}
{ type empty$
    'skip$
    { pop$
      type "t" change.case$
    }
  if$
}

FUNCTION {format.tr.number}
{ type empty$
    { "{\em Tech. Rep. no.}" }
    'type
  if$
  number empty$
    { "t" change.case$ }
    { number emphasize tie.or.space.connect }
  if$
}

FUNCTION {format.article.crossref}
{ key empty$
    { journal empty$
        { "need key or journal for " cite$ * " to crossref " * crossref *
          warning$
          ""
        }
        { "In {\em " journal * "\/}" * }
      if$
    }
    { "In " key * }
  if$
  " \cite{" * crossref * "}" *
}

FUNCTION {format.crossref.editor}
{ editor #1 "{vv~}{ll}" format.name$ scapify
  editor num.names$ duplicate$
  #2 >
    { pop$ " et~al." * }
    { #2 <
        'skip$
        { editor #2 "{ff }{vv }{ll}{ jj}" format.name$ scapify "others" =
            { " et~al." * }
            { " and " * editor #2 "{vv~}{ll}" format.name$ * }
          if$
        }
      if$
    }
  if$
}

FUNCTION {format.book.crossref}
{ volume empty$
    { "empty volume in " cite$ * "'s crossref of " * crossref * warning$
      "In "
    }
    { "Vol.~" volume *
      " of " *
    }
  if$
  editor empty$
  editor field.or.null author field.or.null =
  or
    { key empty$
        { series empty$
            { "need editor, key, or series for " cite$ * " to crossref " *
              crossref * warning$
              "" *
            }
            { "{\em " * series * "\/}" * }
          if$
        }
        { key * }
      if$
    }
    { format.crossref.editor * }
  if$
  " \cite{" * crossref * "}" *
}

FUNCTION {format.incoll.inproc.crossref}
{ editor empty$
  editor field.or.null author field.or.null =
  or
    { key empty$
        { booktitle empty$
            { "need editor, key, or booktitle for " cite$ * " to crossref " *
              crossref * warning$
              ""
            }
            { "In {\em " booktitle * "\/}" * }
          if$
        }
        { "In " key * }
      if$
    }
    { "In " format.crossref.editor * }
  if$
  " \cite{" * crossref * "}" *
}

FUNCTION {article}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.title "title" output.check
  new.block
  crossref missing$
    { format.journal.vol.num.date output
      new.block
      format.pages output
    }
    { format.article.crossref output.nonnull
      new.block
      format.pp.pages output
    }
  if$
  new.block
  note output
  fin.entry
}

FUNCTION {book}
{ output.bibitem
  author empty$
    { format.editors "author and editor" output.check }
    { format.authors output.nonnull
      crossref missing$
        { "author and editor" editor either.or.check }
        'skip$
      if$
    }
  if$
  new.block
  format.btitle "title" output.check
  format.edition output
  crossref missing$
    { format.bvolume output
      new.block
      format.number.series output
      new.block
      publisher "publisher" output.check
      address output
    }
    { new.block
      format.book.crossref output.nonnull
    }
  if$
  format.date "year" output.check
  new.block
  note output
  fin.entry
}

FUNCTION {booklet}
{ output.bibitem
  format.authors output
  new.block
  format.title "title" output.check
  howpublished address new.block.checkb
  howpublished output
  address output
  format.date output
  new.block
  note output
  fin.entry
}

FUNCTION {inbook}
{ output.bibitem
  author empty$
    { format.editors "author and editor" output.check }
    { format.authors output.nonnull
      crossref missing$
        { "author and editor" editor either.or.check }
        'skip$
      if$
    }
  if$
  new.block
  format.btitle "title" output.check
  format.edition output
  new.block
  crossref missing$
    { format.bvolume output
      new.block
      format.number.series output
      new.sentence
      publisher "publisher" output.check
      new.block
      address output
    }
    { new.block
      format.book.crossref output.nonnull
    }
  if$
  format.date "year" output.check
  new.block  
  format.chapter.pages "chapter and pages" output.check
  new.block
  note output
  fin.entry
}

FUNCTION {incollection}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.title "title" output.check
  new.block
  crossref missing$
    { format.in.ed.booktitle "booktitle" output.check
      format.edition output
      format.bvolume output
      format.number.series output
      new.sentence
      publisher "publisher" output.check
      address output
      format.date "year" output.check
    }
    { format.incoll.inproc.crossref output.nonnull }
  if$
  new.block
  format.chapter.pages output
  new.block
  note output
  fin.entry
}

FUNCTION {inproceedings}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.title "title" output.check
  new.block
  crossref missing$
    { format.in.proc.date "booktitle" output.check
      format.ineditors output
      new.block
      format.bvolume output
      format.number.series output
      new.block
      organization output
      new.block
      publisher output
      format.date "year" output.check
    }
    { format.incoll.inproc.crossref output.nonnull }
  if$
  new.block
  format.pages output
  new.block
  note output
  fin.entry
}

FUNCTION {conference} { inproceedings }

FUNCTION {manual}
{ output.bibitem
  author empty$
    { organization scapify output }
    { format.authors output.nonnull }
  if$
  new.block
  format.btitle "title" output.check
  format.edition output
  author empty$
    { address new.block.checka }
    { organization address new.block.checkb
      organization output
    }
  if$
  address output
  format.date output
  new.block
  note output
  fin.entry
}


FUNCTION {misc}
{ output.bibitem
  format.authors output
  title howpublished new.block.checkb
  format.title output
  howpublished new.block.checka
  howpublished output
  format.date output
  new.block
  note output
  fin.entry
  empty.misc.check
}

FUNCTION {phdthesis}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.btitle "title" output.check
  new.block
  "PhD thesis" format.thesis.type output.nonnull
  school "school" output.check
  address output
  format.date "year" output.check
  new.block
  note output
  fin.entry
}

FUNCTION {proceedings}
{ output.bibitem
  editor empty$
    { organization scapify output }
    { format.editors output.nonnull }
  if$
  new.block
  title format.proc.date "title" output.check
  new.block
  format.bvolume output
  format.number.series output
  editor empty$
    'skip$
    { organization output }
  if$
  new.block
  publisher output
  new.block
  note output
  fin.entry
}

FUNCTION {techreport}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.title "title" output.check
  new.block
  format.tr.number output.nonnull
  new.block
  institution "institution" output.check
  new.block
  address output
  format.date "year" output.check
  new.block
  note output
  fin.entry
}

FUNCTION {unpublished}
{ output.bibitem
  format.authors "author" output.check
  new.block
  format.title "title" output.check
  new.block
  note "note" output.check
  format.date output
  fin.entry
}

FUNCTION {default.type} { misc }

MACRO {jan} {"Jan."}

MACRO {feb} {"Feb."}

MACRO {mar} {"Mar."}

MACRO {apr} {"Apr."}

MACRO {may} {"May"}

MACRO {jun} {"June"}

MACRO {jul} {"July"}

MACRO {aug} {"Aug."}

MACRO {sep} {"Sept."}

MACRO {oct} {"Oct."}

MACRO {nov} {"Nov."}

MACRO {dec} {"Dec."}

MACRO {acmcs} {"ACM Comput. Surv."}

MACRO {acta} {"Acta Inf."}

MACRO {cacm} {"Commun. ACM"}

MACRO {ibmjrd} {"IBM J. Res. Dev."}

MACRO {ibmsj} {"IBM Syst.~J."}

MACRO {ieeese} {"IEEE Trans. Softw. Eng."}

MACRO {ieeetc} {"IEEE Trans. Comput."}

MACRO {ieeetcad}
 {"IEEE Trans. Comput.-Aided Design Integrated Circuits"}

MACRO {ipl} {"Inf. Process. Lett."}

MACRO {jacm} {"J.~ACM"}

MACRO {jcss} {"J.~Comput. Syst. Sci."}

MACRO {scp} {"Sci. Comput. Programming"}

MACRO {sicomp} {"SIAM J. Comput."}

MACRO {tocs} {"ACM Trans. Comput. Syst."}

MACRO {tods} {"ACM Trans. Database Syst."}

MACRO {tog} {"ACM Trans. Gr."}

MACRO {toms} {"ACM Trans. Math. Softw."}

MACRO {toois} {"ACM Trans. Office Inf. Syst."}

MACRO {toplas} {"ACM Trans. Program. Lang. Syst."}

MACRO {tcs} {"Theoretical Comput. Sci."}

READ

FUNCTION {sortify}
{ purify$
  "l" change.case$
}

INTEGERS { len }

FUNCTION {chop.word}
{ 's :=
  'len :=
  s #1 len substring$ =
    { s len #1 + global.max$ substring$ }
    's
  if$
}

FUNCTION {sort.format.names}
{ 's :=
  #1 'nameptr :=
  ""
  s num.names$ 'numnames :=
  numnames 'namesleft :=
    { namesleft #0 > }
    { nameptr #1 >
        { "   " * }
        'skip$
      if$
      s nameptr "{vv{ } }{ll{ }}{  f{ }}{  jj{ }}" format.name$ 't :=
      nameptr numnames = t "others" = and
        { "et al" * }
        { t sortify * }
      if$
      nameptr #1 + 'nameptr :=
      namesleft #1 - 'namesleft :=
    }
  while$
}

FUNCTION {sort.format.title}
{ 't :=
  "A " #2
    "An " #3
      "The " #4 t chop.word
    chop.word
  chop.word
  sortify
  #1 global.max$ substring$
}

FUNCTION {author.sort}
{ author empty$
    { key empty$
        { "to sort, need author or key in " cite$ * warning$
          ""
        }
        { key sortify }
      if$
    }
    { author sort.format.names }
  if$
}

FUNCTION {author.editor.sort}
{ author empty$
    { editor empty$
        { key empty$
            { "to sort, need author, editor, or key in " cite$ * warning$
              ""
            }
            { key sortify }
          if$
        }
        { editor sort.format.names }
      if$
    }
    { author sort.format.names }
  if$
}

FUNCTION {author.organization.sort}
{ author empty$
    { organization empty$
        { key empty$
            { "to sort, need author, organization, or key in " cite$ * warning$
              ""
            }
            { key sortify }
          if$
        }
        { "The " #4 organization chop.word sortify }
      if$
    }
    { author sort.format.names }
  if$
}

FUNCTION {editor.organization.sort}
{ editor empty$
    { organization empty$
        { key empty$
            { "to sort, need editor, organization, or key in " cite$ * warning$
              ""
            }
            { key sortify }
          if$
        }
        { "The " #4 organization chop.word sortify }
      if$
    }
    { editor sort.format.names }
  if$
}

FUNCTION {presort}
{ type$ "book" =
  type$ "inbook" =
  or
    'author.editor.sort
    { type$ "proceedings" =
        'editor.organization.sort
        { type$ "manual" =
            'author.organization.sort
            'author.sort
          if$
        }
      if$
    }
  if$
  "    "
  *
  year field.or.null sortify
  *
  "    "
  *
  title field.or.null
  sort.format.title
  *
  #1 entry.max$ substring$
  'sort.key$ :=
}

ITERATE {presort}

SORT

STRINGS { longest.label }

INTEGERS { number.label longest.label.width }

FUNCTION {initialize.longest.label}
{ "" 'longest.label :=
  #1 'number.label :=
  #0 'longest.label.width :=
}

FUNCTION {longest.label.pass}
{ number.label int.to.str$ 'label :=
  number.label #1 + 'number.label :=
  label width$ longest.label.width >
    { label 'longest.label :=
      label width$ 'longest.label.width :=
    }
    'skip$
  if$
}

EXECUTE {initialize.longest.label}

ITERATE {longest.label.pass}

FUNCTION {begin.bib}
{ preamble$ empty$
    'skip$
    { preamble$ write$ newline$ }
  if$
  "\begin{thebibliography}{"  longest.label  * "}" * write$ newline$
}

EXECUTE {begin.bib}

EXECUTE {init.state.consts}

ITERATE {call.type$}

FUNCTION {end.bib}
{ newline$
  "\end{thebibliography}" write$ newline$
}

EXECUTE {end.bib}

\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/ICCSsty.tex igraph-0.6.5/doc/papers/iccs06/ICCSsty.tex
--- igraph-0.6.5~quantal1/doc/papers/iccs06/ICCSsty.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/ICCSsty.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-% tt 4-30-98 -*- Mode:TeX -*-
% ICCSsty.tex (LATEX style for International Conference on Complex Systems); LaTeX2e only!
% revised to fit given Word format
% Copyright (c) Tommaso Toffoli 1998

%---------------- OVERALL GEOMETRY ----------------

 \pagestyle{headings}	%
% \headheight	.15in	%
% \headsep	.28in	%
 \footskip	0in
 \textheight	7.55in
 \footskip	0in
 \textwidth	 4.8in
 \oddsidemargin  .85in
 \evensidemargin .85in
 \sloppy

 \makeatletter
%---------------- TITLE SECTION ----------------
\ifx\UNDEF\mail\def\mail{ }\else\fi
\ifx\UNDEF\prange\def\prange{0 0}\else\fi

\gdef\@empty{}
\def\Mail#1 #2 {\gdef\thecontact{#1}\gdef\theaddr{#2}}
\def\Range#1 #2 {\gdef\thefirstpage{#1}\gdef\thelastpage{#2}}
{\let\'\mail \expandafter\Mail\' }	% do not remove space between ' and }
{\let\'\prange \expandafter\Range\' }	% do not remove space between ' and }
% \setcounter{page}{\thefirstpage}
 \gdef\@shtitle{\relax}
 \long\def\shtitle#1{\gdef\@shtitle{#1}}
% \gdef\@shauthor{\relax}
% \long\def\shauthor#1{\gdef\@shauthor{#1}}
 \long\def\author#1{\gdef\@author{#1}}
 \def\affil#1{\par\noindent{\rm#1\par}}
 \gdef\@abstract{}
 \long\def\abstract#1{\gdef\@abstract{#1}}

 \renewcommand{\@evenhead}{\thepage\qquad\qquad\@shtitle\hfil}
 \renewcommand{\@oddhead}{\hfil\@shtitle\qquad\qquad\thepage}

 \def\maketitle{\thispagestyle{empty}\chapter{\@title}}
 \renewcommand\chapter{\if@openright\cleardoublepage\else\clearpage\fi
                    \thispagestyle{empty}%
                    \global\@topnum\z@
                    \@afterindentfalse
                    \secdef\@chapter\@schapter}
 \def\@makechapterhead#1{%
  \vspace*{50\p@}%
  {\parindent \z@ \raggedleft \normalfont
    \ifnum \c@secnumdepth >\m@ne
      \if@mainmatter
        \huge %\@chapapp{} \thechapter
        \par\nobreak
        \vskip 20\p@
      \fi
    \fi
    \interlinepenalty\@M
    \Huge \bfseries #1\par\nobreak
    \vskip.25in
    \large\bfseries\@author\par\nobreak
    \vskip 40\p@}
    \ifx\@abstract\@empty\else{\small\@abstract\par\vskip20\p@}\fi
  }

 %---------------- EMPHASIS ----------------
 %% Use boldface for terms being defined
 \let\tdf\textbf
 \let\df\bf

 %% Use slanted rather than italic for emphasis
\DeclareRobustCommand\em
        {\@nomath\em \ifdim \fontdimen\@ne\font >\z@
                       \upshape \else \slshape \fi}
\let\tem\emph

 %%	use \sl rather than \it in theorems [to be upgraded]
\def\@begintheorem#1#2{\sl \trivlist \item[\hskip \labelsep{\bf #1\ #2}]}
\def\@opargbegintheorem#1#2#3{\sl \trivlist
     \item[\hskip \labelsep{\bf #1\ #2\ (#3)}]}

 %======================== CROSS-REFERENCING ==================
 \newcommand{\sect}[1]{\S\ref{sect:#1}}      % Ref. to section or subsection
                                        %   to appear as, say, $2.37
 \newcommand{\baresect}[1]{\ref{sect:#1}}      % Ref. to one more section or
                                 %    subsection to appear as, say, 2.37
 \newcommand{\eq}[1]{(\ref{eq:#1})}	% Ref. to equation
                                        %   to appear as, say, (2.37)
 \newcommand{\foot}[1]{footnote \ref{foot:#1}} % Ref. to footnote
                                        %   to appear as, say, `footnote 7'.
 \newcommand{\fig}[1]{Fig.~\ref{fig:#1}}

 \newcommand{\sectlabel}[1]{\label{sect:#1}}
 \newcommand{\eqlabel}[1]{\label{eq:#1}}
 \newcommand{\figlabel}[1]{\label{fig:#1}}

 %======================== SECTIONING ========================
 %% Small sections
% \newcommand{\smallsection}[1]{\par\medskip\noindent{\em#1}\par\smallskip}
 \let\smallsection\subsubsection \setcounter{secnumdepth}{2}
 \newcommand{\parhead}[1]{\tsl{#1}.\quad} % Distinguished paragraph
		% heading; slanted, followed by \quad

 %% allow printing 0 as a section (or subsection, item, etc.) number
% \def\@arabic#1{\ifnum #1>0 \number #1\fi} % original definition
  \def\@arabic#1{\number #1} % my redefinition

 %======================== FIGURES ========================
 %% change captions from \normalsize to \small
\long\def\@makecaption#1#2{
	\vskip\abovecaptionskip
	\sbox\@tempboxa{{\small {\bf #1}: #2}}%
	\ifdim\wd\@tempboxa>\hsize
	    {\small {\bf #1}: #2\par}
	\else
	   \global\@minipagefalse
	   \hbox to\hsize{\hfil\box\@tempboxa\hfil}
	\fi
	\vskip \belowcaptionskip}

\def\figstrut#1{\hbox to\linewidth{\vrule height#1\hfill}}

%%%% Single-column figure
\newcommand{\Fig}[4][!htb]{% [position] label, picture, caption
\begin{figure}[#1]
 \centering\leavevmode#3%
 \caption{#4}
 \figlabel{#2}
\end{figure}                 }
 \let\figonecol\Fig

%%%% Two-column figure
 \newcommand{\Figwide}[4][!t]{% [position] label, picture, caption
 \begin{figure*}[#1]
  \centering\leavevmode#3%
  \caption{#4}
 \figlabel{#2}
 \end{figure*}                 }
 \let\figtwocol\Figwide

%%%% Float-page figure
 \newcommand{\Figpage}[3]{% label, picture, caption
 \begin{figure*}[p] 
  \centering\leavevmode#2%
  \caption{#3}
 \figlabel{#1}
 \end{figure*}                 }
 \let\figpage\Figpage

\renewenvironment{thebibliography}[1]
     {\section*{\bibname
        \@mkboth{\MakeUppercase\bibname}{\MakeUppercase\bibname}}%
      \list{\@biblabel{\@arabic\c@enumiv}}%
           {\settowidth\labelwidth{\@biblabel{#1}}%
            \leftmargin\labelwidth
            \advance\leftmargin\labelsep
            \@openbib@code
            \usecounter{enumiv}%
            \let\p@enumiv\@empty
            \renewcommand\theenumiv{\@arabic\c@enumiv}}%
      \sloppy
      \clubpenalty4000
      \@clubpenalty \clubpenalty
      \widowpenalty4000%
      \sfcode`\.\@m}
     {\def\@noitemerr
       {\@latex@warning{Empty `thebibliography' environment}}%
      \endlist}
\makeatother

\bibliographystyle{ICCS}

\endinput

 \def\maketitle{%
  \thispagestyle{empty}
    \raggedleft
    \noindent\@author\par
    \medskip
    \noindent\hrule
    \smallskip
    \noindent{\Huge\sf\@title\par}
    \vfil\vfil\vfil\vfil
    {\narrower\narrower\noindent\@abstract\par}\newpage}
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/Makefile igraph-0.6.5/doc/papers/iccs06/Makefile
--- igraph-0.6.5~quantal1/doc/papers/iccs06/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,29 +0,0 @@
-SOURCE = csardi2
-
-all: $(SOURCE).pdf 
-
-FIGTEX = ~/bin/figtex
-
-FIG = $(wildcard *.fig)
-EPS = $(patsubst %.fig, %.eps, $(FIG)) 
-EPST = $(patsubst %.fig, %.eps_t, $(FIG))
-ALLEPS = $(EPS) 
-
-$(SOURCE).dvi: $(SOURCE).tex $(ALLEPS) $(EPST) net.bib
-	latex $(SOURCE) && bibtex $(SOURCE) &&  \
-	latex $(SOURCE) && latex $(SOURCE) 
-
-$(SOURCE).pdf: $(SOURCE).dvi
-	dvips -o $(SOURCE).ps -t letter $(SOURCE).dvi && \
-	ps2pdf $(SOURCE).ps
-
-# Figures
-
-%.eps : %.fig
-	$(FIGTEX) $<
-
-clean: 
-	rm -f $(SOURCE){.aux,.bbl,.blg,.dvi,.log,.out,.pdf,.ps,.toc}\
-	$(EPS) $(EPST)
-
-.PHONY: clean
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/arch.fig igraph-0.6.5/doc/papers/iccs06/arch.fig
--- igraph-0.6.5~quantal1/doc/papers/iccs06/arch.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/arch.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-0 32 #eaeaea
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 5310 4755 3015 4755 3015 3300 5310 3300 5310 4755
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 7950 4755 5655 4755 5655 3300 7950 3300 7950 4755
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 9600 4755 8340 4755 8340 3300 9600 3300 9600 4755
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 8550 3015 8550 3015 7065 9630 7065 9630 8550
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 6630 3015 6630 3015 5145 9630 5145 9630 6630
-4 1 0 50 -1 18 28 0.0000 4 60 405 8955 4125 ...\001
-4 1 0 50 -1 18 28 0.0000 4 465 1590 6765 4125 Python\001
-4 1 0 50 -1 18 28 0.0000 4 360 1500 4170 4125 GNU R\001
-4 1 0 50 -1 18 28 0.0000 4 465 6075 6345 6015 Graph operations (C library)\001
-4 1 0 50 -1 18 28 0.0000 4 465 7305 6345 7995 Basic graph operations (C library)\001
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/csardi2.tex igraph-0.6.5/doc/papers/iccs06/csardi2.tex
--- igraph-0.6.5~quantal1/doc/papers/iccs06/csardi2.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/csardi2.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,373 +0,0 @@
-\documentclass[twoside]{book}% Specify document type
-\usepackage{graphicx}           % Load macros for PostScript figures
-\usepackage{url}
-\usepackage{psfrag}
-\usepackage{fancyvrb}
-\input ICCSsty.tex              % Load style for Complex Systems '97
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}
-  \input #2.eps_t
-  \includegraphics[width=#1]{#2.eps}
-  \end{psfrags}
-}
-
-%---------------------------------------------------------
-% Give data to appear in the title section
-
- \shtitle{The igraph software package for complex network research}
- \title{The igraph software package for complex network research}
- \author{%
-   G\'abor Cs\'ardi\affil{Center for Complex Systems Studies,
-     Kalamazoo College, Kalamazoo, MI, USA \\
-     and \\
-     Department of Biophysics, KFKI Research Institute for Particle
-     and Nuclear Physics of the Hungarian Academy of Sciences,
-     Budapest, Hungary\\csardi@kzoo.edu} 
-   
-   Tam\'as Nepusz\affil{Department of Biophysics, KFKI Research
-     Institute for Particle and Nuclear Physics of the Hungarian
-     Academy of Sciences, Budapest, Hungary \\
-     and \\
-     Department of Measurement and Information Systems, Budapest
-     University of Technology and Economics, Budapest, Hungary \\
-     ntamas@rmki.kfki.hu}
- }
-\date{May 10, 2006}
-\abstract{The igraph software package provides handy tools for
-  researchers in network science. It is an open source portable
-  library capable of handling huge graphs with millions of vertices
-  and edges and it is also suitable to grid computing. It contains
-  routines for creating, manipulating and visualizing networks,
-  calculating various structural properties, importing from and
-  exporting to various file formats and many more. Via its interfaces
-  to high-level languages like GNU R and Python it supports rapid
-  development and fast prototyping.
-}
-
-%---------------------------------------------------------
-% Here is the document
-
-\begin{document}           % Matched by \end{document}
-\maketitle                 % Typeset the title section
-                           
-\section{Introduction}
-
-This paper does not present results of scientific research, but
-introduces a software package which gives handy tools into the hands
-of researchers doing network science. The authors strongly believe
-that the tools scientists use are important because they
-can increase productivity by several factors and thereby enhance
-scientific progress. 
-
-\subsection{Why another network analysis package?}
-
-The igraph library was developed because of the lack of network
-analysis software which (1)~can handle large graphs efficiently,
-(2)~can be embedded into a higher level program or programming language
-(like Python, Perl or GNU R) and (3) can be used both interactively
-and non-interactively.
-
-The capability of handling large graphs was important because the
-authors were confronted with graphs with millions of vertices and edges. 
-
-Embedding igraph into Python or GNU R creates a very productive
-research environment, well suited for rapid development. All the
-expressing power of GNU R (or other higher level languange) is readily
-available in a convenient integrated environment for generating,
-manipulating and measuring graphs, and evaluating these measurements.
-
-Interactive means of software usage is nowadays considered as superior
-to non-interactive interfaces, which is very true for most
-cases. Dealing with large graphs can be different though -- if it takes
-three months to calculate the diameter of a graph, nobody wants that to
-be interactive.
-
-\section{Features}
-
-In the addition to the three goal features in the previous section,
-others showed up as a side-effect. Let us discuss these features here.
-
-\paragraph{Open source.} Igraph is open source, it is free for
-non-commercial or commercial use and distributed according to the GNU
-General Public License. Being open source means that in addition to
-the binary format of the program, the user can
-always get the source code format enabling additions and corrections.
-This is a very important feature for the users. With open source
-software, you can add new functionality and correct deficiencies or
-hire somebody to do this for you. With closed source software this is
-impossible. 
-
-\paragraph{Efficient implementation.} Igraph uses space and time
-efficient data structures and implements the current state-of-the-art
-algorithms. All igraph functions are carefully profiled to create the
-fastest implementation possible.
-
-\paragraph{Portability.} The library is written in ANSI~C, it is thus
-portable to most platforms. It is tested on different Linux flavors,
-Mac OS X, MS Windows and Sun OS. The R and Python interfaces are also
-portable to many architectures.
-
-\paragraph{Layered architecture.} The igraph library has a layered
-architecture, the three layers are connected through well defined
-interfaces. Each layer can be replaced with an alternate
-implementation without changing the other components. See the details
-in~\sect{arch}.
-
-\paragraph{Open, embeddable system.} The core igraph library is an
-open system, it can be embedded into higher level languages or
-programs. The current distribution contains interfaces to two high
-level languages: GNU R and Python.
-
-\paragraph{High level operations.} The higher level interfaces provide
-abstract operations and data types. These support rapid
-program development, see~\sect{fast} for an example.
-
-\paragraph{Documentation.} The C library is very well documented, the
-documentation is available in various formats supporting both online
-browsing and printing. For each function its time requirements are
-documented.
-
-\paragraph{Drawbacks.} The library lacks functionality in some areas
-compared to other network analysis packages. One such area is graph
-visualization, another one is various social network analysis methods
-like block-modeling, p$^{*}$ methods, etc. Note that this piece of
-software is heavily under development, so expect much more
-functionality in the near future. Igraph also does not have a
-graphical user interface, but a Python-based GUI is under development
-and will be available for download soon and the R interface also
-provides a facility for visual manipulation of small graphs.
-
-\section{Example applications}
-
-\subsection{Grid computing}
-
-In this section we give an example for using the igraph library
-for large scale computation. The task presented here is to calculate
-the diameter of the US patent citation network. In this network the
-nodes are US patents granted between 1963 and 2000 and two patents are
-connected if one cites the other. The largest component of the network
-contains more than 3~million nodes and 15~million edges. The
-(undirected) diameter of a network is the largest undirected shortest
-path connecting two vertices. 
-
-For calculating the diameter of a graph you need to calculate the
-length of the shortest path between all possible pairs of nodes, so
-this is computationally very expensive. We used the following approach
-with igraph. 
-
-First we wrote a simple program in C which downloads the data set from
-a web server and then starts calculating the shortest paths from a
-given source node to all other nodes in the network by using
-Dijkstra's algorithm \cite{dijkstra59} implemented in the igraph
-library. We will call this program the \emph{worker}. 
-
-The worker downloads the id of the source node from a second web
-server. This web server simply gives a different source node id every
-time one is requested by the workers. As soon as the worker has
-finished with the calculation of the shortest paths to all nodes it
-stores the result on a third web server and asks the second web-server
-for a new source node id, etc. The architecture of the system can be
-seen in 
-\fig{grid}. 
-
-\begin{figure}
-\centering
-\figfigure{0.75\textwidth}{grid2}
-\caption{The architecture of the system used for calculating the
-  diameter of a large graph. A worker node (1) downloads the network
-  data from the data web-server, then (2) it requests a source vertex
-  id from the task web-server, (3) calculates the shortest paths from
-  that source vertex and (4) stores the result on the task
-  web-server. Then a new source vertex id is requested, etc.}
-\figlabel{grid}
-\end{figure}
-
-This system is very robust in the sense that there is no single point
-of failure. The workers can be run in any grid-based environment from
-which they can access the WWW. They can be run on different platforms
-as well.
-
-\subsection{Fast prototyping, rapid development}\sectlabel{fast}
-
-\paragraph{Newman's community finding algorithm}
-The second example we present is very different from the first. Here
-we will use the GNU R interface to the igraph library to implement
-and apply Newman's spectral community finding algorithm
-\cite{newman06}.
-First we load the igraph package into R and download the Zachary
-Karate-club network data \cite{zachary77} from the web.
-\begin{Verbatim}[fontsize=\small,numbers=left]
-library(igraph)
-g <- read.graph("http://geza.kzoo.edu/~csardi/karate.net", format="pajek")
-\end{Verbatim}
-
-Now we implement the community finding algorithm.
-\begin{Verbatim}[fontsize=\small,numbers=left,firstnumber=last]
-community.newman <- function(g) {
-  deg <- degree(g)
-  ec <- ecount(g)
-  B <- get.adjacency(g) - outer(deg, deg, function(x,y) x*y/2/ec)
-  diag(B) <- 0
-  eigen(B)$vectors[,1]
-}
-\end{Verbatim}
-This algorithm creates a modularity matrix which is the difference of
-the adjacency matrix of the graph and the null-model matrix. The
-latter contains the probabilities that two nodes are connected in a
-random graph if the
-degrees of the nodes are given. Then the network is divided into two
-communities based on the eigenvector associated with the largest
-positive eigenvalue of the modularity matrix: all vertices having the
-same sign in this eigenvector belong to the same community.
-
-Now we are ready to apply this algorithm to the Karate-club data and 
-set the color of the vertices based on their communities.
-\begin{Verbatim}[fontsize=\small,numbers=left,firstnumber=last]
-mem <- community.newman(g)
-V(g)$color <- ifelse(mem < 0, "grey", "green")
-\end{Verbatim}
-           
-We also set the size of the vertices based on the first eigenvector,
-the farther this value is from zero the more the given vertex is in
-the \emph{core} of the community. We also set the color of the edges
-across the two communities to red.
-\begin{Verbatim}[fontsize=\small,numbers=left,firstnumber=last]
-scale <- function(v, a, b) {
-  v <- v-min(v) ; v <- v/max(v) ; v <- v * (b-a) ; v+a
-}
-V(g)$size <- scale(abs(mem), 15, 25)
-E(g)$color <- "grey"
-E(g)[ V(g)[color=="grey"] %--% V(g)[color=="green"] ]$color <- "red"
-plot(g, layout=layout.kamada.kawai, vertex.color="a:color",
-       vertex.size="a:size", edge.color="a:color")
-\end{Verbatim}
-See the resulting plot in \fig{karate}.
-
-\begin{figure}[t]
-\centering
-\figfigure{0.65\textwidth}{karate}
-\caption{The two communities identified correctly in the Zachary
-  karate-club network. The size of the vertices is proportional to
-  the absolute value of their coordinate in the first eigenvector and
-  expresses how strongly they belong to a community. All edges across the
-  two communities are painted red.}
-\figlabel{karate}
-\end{figure}
-
-\paragraph{PageRank algorithm in 19 lines} Using the Python interface
-of igraph, one can easily create a prototype of the original PageRank
-algorithm in only 19 lines of code (not counting empty lines):
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-from igraph import *
-from copy import copy
-
-def pagerank(g, damping=0.85, epsilon=0.001, iters=100):
-    pageranks = [1-damping] * g.vcount()
-    outlinks = g.degree(type=OUT)
-    mindiff = epsilon
-    newprs = [0] * g.vcount()
-    
-    while mindiff >= epsilon and iters > 0:
-        iters = iters - 1
-        for n in range(g.vcount()):
-            neis = g.neighbors(n, IN)
-            pr = 0.0
-            if len(neis) > 0:
-                for n2 in neis: pr = pr + pageranks[n2] / outlinks[n2]
-                pr = pr*damping
-            newprs[n] = pr+1-damping
-	    
-        mindiff = min([abs(newprs[n]-pageranks[n]) for n in range(g.vcount())])
-        pageranks = copy(newprs)
-	
-    return pageranks
-\end{Verbatim}
-
-\section{The igraph architecture}\sectlabel{arch}
-
-The igraph system has a layered architecture consisting three
-layers. The lowest layer contains the very basic operations only, and
-is implemented in C. It is only this layer which can manipulate the
-internal igraph data structures directly. This means that this layer
-can be easily replaced with and alternate graph representation if
-needed.
-
-The second layer contains almost all network analysis functions, this
-is also implemented in C. 
-
-The third layer contains the higher level interfaces, so far
-interfaces to GNU R and Python are implemented.
-
-\begin{figure}
-\centering
-\figfigure{0.6\textwidth}{arch}
-\caption{The architecture of the igraph system. See the text for a
-  description. }
-\figlabel{arch}
-\end{figure}
-
-\section{Current functionality}
-
-Please note that new functionality is added to the library every
-week, so check the igraph homepage at
-\url{http://cneurocvs.rmki.kfki.hu/igraph} if you cannot see here the
-algorithms or measures you're looking for. 
-
-\paragraph{Graph generation} Igraph can generate various regular and
-random graphs: $\bullet$ regular structures: star, ring and full
-graphs, circular and non-circular lattices with any number of
-dimensions, regular trees $\bullet$ graphs based on Barab\'asi's
-preferential attachment model \cite{barabasi99a}, also with nonlinear
-attachment exponent and various variations $\bullet$ Random
-(Erd\H{o}s-R\'enyi) graphs, both $G(n,p)$ and $G(n,m)$ types
-\cite{erdos59}, directed and undirected ones $\bullet$ graphs having a
-given degree sequence, directed or undirected ones \cite{newman01}
-$\bullet$ growing random graphs, also for modeling citation networks
-\cite{callaway01} $\bullet$ growing random graphs where the connection
-probability depends on some vertex properties $\bullet$ graphs from
-the Graph Atlas \cite{read98} $\bullet$ all non-isomorphic graphs of a
-given size. 
-
-\paragraph{Centrality measures} The following centrality measures
-\cite{freeman79} can be calculated: $\bullet$ degree $\bullet$
-closeness $\bullet$ vertex and edge betweenness $\bullet$ eigenvector
-centrality $\bullet$ page rank \cite{page98}.
-
-\paragraph{Path length based properties} One or all shortest paths
-between vertices can be calculated, and also based on this the
-diameter and the average path length of the graph.
-
-\paragraph{Graph components} Weakly and strongly connected components
-can be calculated, and also the minimum spanning forest of a graph.
-
-\paragraph{Graph motifs} Graph motifs of three or four components can
-be calculated, both undirected and directed motifs \cite{wernicke06}. 
-
-\paragraph{Random rewiring} Existing graphs can be rewired randomly
-while preserving their degree distribution, allowing the user to
-generate an arbitrary set of graphs with the same degree distribution.
-
-\paragraph{Vertex and edge sets} Igraph provides a simple way to
-manipulate subsets of vertices and/or edges of a graph,
-see~\sect{fast} for an example. 
-
-\paragraph{Vertex and edge attributes} Numeric or non-numeric
-attributes can be assigned to the vertices and edges of a graph, and
-queried and set by using a simple notation, see~\sect{fast}. 
-
-\paragraph{File formats} Igraph can read and write simple edge
-list files and also Pajek \cite{nooy05} and GraphML \cite{brandes01} files.
-
-\paragraph{Graph layouts} The following layout generators are part of
-igraph: $\bullet$ simple circle and sphere layouts, random layouts
-$\bullet$ Fruchterman-Reingold layout, 2D and 3D \cite{fruchterman91} $\bullet$
-Kamada-Kawai layout, 2D and 3D \cite{kamada89} $\bullet$ spring embedder layout
-$\bullet$ LGL layout generator for large graphs \cite{adai04}
-$\bullet$ Grid-based Fruchterman-Reingold layout for large graphs
-$\bullet$ Reingold-Tilford layout \cite{reingold81} for trees.
-
-\bibliography{net}
-
-\end{document}
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/grid2.fig igraph-0.6.5/doc/papers/iccs06/grid2.fig
--- igraph-0.6.5~quantal1/doc/papers/iccs06/grid2.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/grid2.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,100 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-0 32 #a0ffa0
-0 33 #a0a0ff
-6 5940 4680 7830 5535
-2 4 0 1 0 30 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 5535 5940 5535 5940 4680 7830 4680 7830 5535
-4 1 0 50 -1 0 24 0.0000 4 270 1110 6885 5220 worker\001
--6
-6 5940 3510 7830 4365
-2 4 0 1 0 30 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 4365 5940 4365 5940 3510 7830 3510 7830 4365
-4 1 0 50 -1 0 24 0.0000 4 270 1110 6885 4050 worker\001
--6
-6 5940 2250 7830 3105
-2 4 0 1 0 30 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 3105 5940 3105 5940 2250 7830 2250 7830 3105
-4 1 0 50 -1 0 24 0.0000 4 270 1110 6885 2790 worker\001
--6
-6 5940 990 7830 1845
-2 4 0 1 0 30 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 1845 5940 1845 5940 990 7830 990 7830 1845
-4 1 0 50 -1 0 24 0.0000 4 270 1110 6885 1530 worker\001
--6
-6 9975 3645 12585 5490
-2 4 0 1 0 32 51 -1 20 0.000 0 0 7 0 0 5
-	 12585 5490 9975 5490 9975 3645 12585 3645 12585 5490
-4 1 0 50 -1 0 24 0.0000 4 270 795 11242 4245 Task\001
-4 1 0 50 -1 0 24 0.0000 4 270 645 11242 4725 web\001
-4 1 0 50 -1 0 24 0.0000 4 195 975 11242 5205 server\001
--6
-6 1170 3600 3780 5445
-6 1965 3870 2940 5100
-4 1 0 50 -1 0 24 0.0000 4 270 750 2452 4140 Data\001
-4 1 0 50 -1 0 24 0.0000 4 270 645 2452 4620 web\001
-4 1 0 50 -1 0 24 0.0000 4 195 975 2452 5100 server\001
--6
-2 4 0 1 0 33 51 -1 20 0.000 0 0 7 0 0 5
-	 3780 5445 1170 5445 1170 3600 3780 3600 3780 5445
--6
-6 8774 1095 9240 1561
-1 3 0 1 0 33 50 -1 -1 0.000 1 0.0000 9007 1328 233 233 9007 1328 9240 1328
-4 1 0 50 -1 0 24 0.0000 4 270 195 9007 1448 4\001
--6
-6 8159 1095 8625 1561
-1 3 0 1 0 33 50 -1 -1 0.000 1 0.0000 8392 1328 233 233 8392 1328 8625 1328
-4 1 0 50 -1 0 24 0.0000 4 270 195 8392 1448 2\001
--6
-6 4732 1117 5198 1583
-1 3 0 1 0 33 50 -1 -1 0.000 1 0.0000 4965 1350 233 233 4965 1350 5198 1350
-4 1 0 50 -1 0 24 0.0000 4 270 195 4965 1470 1\001
--6
-1 3 0 1 0 7 49 -1 20 0.000 1 0.0000 7687 1177 233 233 7687 1177 7920 1177
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 9975 4230 9375 4230 9375 1620 7815 1620
-2 4 0 1 0 30 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 7920 5940 7920 5940 7065 7830 7065 7830 7920
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 9975 4965 9555 4965 9555 7485 7815 7485
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 9975 4695 9375 4695 9375 5175 7815 5175
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 9975 4545 9225 4545 9225 3990 7815 3990
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 9975 4380 9300 4380 9300 2745 7815 2745
-2 1 1 1 0 7 50 -1 -1 4.000 0 0 -1 1 0 4
-	0 0 1.00 60.00 120.00
-	 3780 4965 4200 4965 4200 7485 5940 7485
-2 1 1 1 0 7 50 -1 -1 4.000 0 0 -1 1 0 4
-	0 0 1.00 60.00 120.00
-	 3780 4695 4380 4695 4380 5175 5940 5175
-2 1 1 1 0 7 50 -1 -1 4.000 0 0 -1 1 0 4
-	0 0 1.00 60.00 120.00
-	 3780 4545 4530 4545 4530 3990 5940 3990
-2 1 1 1 0 7 50 -1 -1 4.000 0 0 -1 1 0 4
-	0 0 1.00 60.00 120.00
-	 3780 4380 4455 4380 4455 2745 5940 2745
-2 1 1 1 0 7 50 -1 -1 4.000 0 0 -1 1 0 4
-	0 0 1.00 60.00 120.00
-	 3780 4230 4380 4230 4380 1620 5940 1620
-4 1 0 50 -1 0 24 0.0000 4 270 1110 6885 7605 worker\001
-4 1 0 50 -1 0 24 0.0000 4 270 885 6885 6405 \\ldots\001
-4 1 0 46 -1 0 24 0.0000 4 270 195 7687 1297 3\001
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/karate.fig igraph-0.6.5/doc/papers/iccs06/karate.fig
--- igraph-0.6.5~quantal1/doc/papers/iccs06/karate.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/karate.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,241 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Flush left
-Inches
-Letter  
-100.00
-Single
--2
-1200 2
-0 32 #ff0000
-0 33 #bebebe
-0 34 #a0ffa0
-0 35 #00008b
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 6208 3453 427 427 6208 3453 6635 3453
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 6296 4365 349 349 6296 4365 6645 4365
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 7593 4880 294 294 7593 4880 7887 4880
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 7021 3119 338 338 7021 3119 7359 3119
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 5258 3079 294 294 5258 3079 5552 3079
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 4312 3066 298 298 4312 3066 4610 3066
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 4751 3891 298 298 4751 3891 5049 3891
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 7910 2417 321 321 7910 2417 8231 2417
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 8542 4979 280 280 8542 4979 8822 4979
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 9525 4067 262 262 9525 4067 9787 4067
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 5552 2154 294 294 5552 2154 5846 2154
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 6285 1868 291 291 6285 1868 6576 1868
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 7792 3966 290 290 7792 3966 8082 3966
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 10228 5267 297 297 10228 5267 10525 5267
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 10262 5975 297 297 10262 5975 10559 5975
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 3417 3409 262 262 3417 3409 3679 3409
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 4927 4997 293 293 4927 4997 5220 4997
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 10055 4616 297 297 10055 4616 10352 4616
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 7114 5477 262 262 7114 5477 7376 5477
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 10122 6689 297 297 10122 6689 10419 6689
-1 3 0 1 0 33 100 0 20 4.000 1 0.0000 6050 5208 293 293 6050 5208 6343 5208
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 9748 7268 297 297 9748 7268 10045 7268
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 8126 8035 321 321 8126 8035 8447 8035
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 6708 8402 256 256 6708 8402 6964 8402
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 6235 7953 262 262 6235 7953 6497 7953
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 9589 8188 285 285 9589 8188 9874 8188
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 7629 7191 279 279 7629 7191 7908 7191
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 7945 6576 268 268 7945 6576 8213 6576
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 8914 7872 318 318 8914 7872 9232 7872
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 9297 4646 278 278 9297 4646 9575 4646
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 7036 6229 275 275 7036 6229 7311 6229
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 8962 5872 386 386 8962 5872 9348 5872
-1 3 0 1 0 34 100 0 20 4.000 1 0.0000 8718 6822 421 421 8718 6822 9139 6822
-# End of XFig header
-2 1 0 1 32 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 6330 3862 6957 5965
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6169 3879 6076 4915
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6383 3843 7007 5237
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5935 3782 5114 4771
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6615 3584 7516 3876
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6229 3025 6271 2159
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6344 3047 6757 1817
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6015 3071 5684 2417
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6566 3687 8307 4826
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6573 3230 7636 2584
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5798 3576 5037 3805
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5789 3367 4605 3126
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5810 3296 5532 3187
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6604 3290 6708 3248
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6506 3760 7388 4669
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6249 3878 6262 4017
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6644 4398 9020 4620
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6198 4701 6132 4926
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6503 4647 6959 5266
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5978 4512 5193 4874
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6634 4275 7511 4041
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6519 4096 7705 2664
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6472 4063 6850 3412
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6621 4494 7319 4772
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7655 4593 7730 4250
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7886 4911 8263 4950
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7864 4766 9282 4169
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7831 5053 8649 5646
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7653 5169 7891 6313
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7598 5175 7625 6912
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7631 4588 7869 2736
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7502 4600 7125 3441
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7248 3369 7596 3751
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6849 2828 6433 2120
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7286 2910 7658 2616
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5347 2799 5463 2435
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 5102 3329 4909 3638
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 4033 3173 3662 3315
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 4553 2889 5315 2329
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 4453 3330 4611 3628
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 4470 3790 3664 3498
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 8569 5259 8678 6402
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8661 5233 8798 5523
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8661 5233 8798 5523
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7881 4242 8588 6421
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 10021 5480 9011 6520
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9960 5395 9310 5706
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 10001 6118 9087 6619
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9966 5952 9347 5903
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 9901 4870 8936 6462
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9860 4840 9215 5581
-2 1 0 1 32 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7316 5646 8394 6551
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9826 6717 9137 6782
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9879 6518 9278 6095
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9475 7150 9105 6990
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9602 7009 9151 6209
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8441 7970 8602 7937
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 8267 7747 8533 7201
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7963 7758 7771 7431
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7805 8021 6498 7965
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6746 8148 6995 6501
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6863 8197 7460 7413
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6522 8225 6426 8134
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 6346 7715 6920 6479
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9436 7947 8944 7178
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9331 8067 9203 8007
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7894 7101 8318 6957
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8201 6658 8316 6694
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7694 6481 7293 6327
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8855 7559 8795 7237
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 8922 7553 8953 6258
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 9225 4915 8826 6415
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 9223 4914 9064 5500
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 7296 6321 8320 6682
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 7307 6179 8582 5943
-2 1 0 1 33 7 100 0 -1 4.000 0 0 -1 0 0 2
-	 8866 6246 8823 6414
-2 3 0 1 0 33 100 0 20 4.000 0 0 -1 0 0 18
-	 6845 1283 6944 1301 7029 1354 7090 1435 7118 1532 7108 1632
-	 7063 1722 6989 1790 6895 1827 6794 1827 6700 1790 6626 1722
-	 6581 1632 6572 1532 6599 1435 6660 1354 6746 1301 6845 1283
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 8242 7736 8823 6232
-2 1 0 1 33 7 101 0 -1 0.000 0 0 -1 0 0 2
-	 9451 4319 8836 6418
-4 1 35 100 0 16 12 0.0000 4 165 120 6208 3521 0\001
-4 1 35 100 0 16 12 0.0000 4 165 120 6296 4435 1\001
-4 1 35 100 0 16 12 0.0000 4 165 120 7593 4951 2\001
-4 1 35 100 0 16 12 0.0000 4 165 120 7021 3188 3\001
-4 1 35 100 0 16 12 0.0000 4 165 120 5258 3149 4\001
-4 1 35 100 0 16 12 0.0000 4 165 120 4312 3133 5\001
-4 1 35 100 0 16 12 0.0000 4 165 120 4751 3960 6\001
-4 1 35 100 0 16 12 0.0000 4 165 120 7910 2486 7\001
-4 1 35 100 0 16 12 0.0000 4 165 120 8542 5048 8\001
-4 1 35 100 0 16 12 0.0000 4 165 120 9525 4135 9\001
-4 1 35 100 0 16 12 0.0000 4 165 240 5552 2222 10\001
-4 1 35 100 0 16 12 0.0000 4 165 240 6845 1627 11\001
-4 1 35 100 0 16 12 0.0000 4 165 240 6285 1939 12\001
-4 1 35 100 0 16 12 0.0000 4 165 240 7792 4034 13\001
-4 1 35 100 0 16 12 0.0000 4 165 240 10228 5337 14\001
-4 1 35 100 0 16 12 0.0000 4 165 240 10262 6044 15\001
-4 1 35 100 0 16 12 0.0000 4 165 240 3417 3478 16\001
-4 1 35 100 0 16 12 0.0000 4 165 240 4927 5067 17\001
-4 1 35 100 0 16 12 0.0000 4 165 240 10055 4685 18\001
-4 1 35 100 0 16 12 0.0000 4 165 240 7114 5546 19\001
-4 1 35 100 0 16 12 0.0000 4 165 240 10122 6758 20\001
-4 1 35 100 0 16 12 0.0000 4 165 240 6050 5278 21\001
-4 1 35 100 0 16 12 0.0000 4 165 240 9748 7338 22\001
-4 1 35 100 0 16 12 0.0000 4 165 240 8126 8104 23\001
-4 1 35 100 0 16 12 0.0000 4 165 240 6708 8472 24\001
-4 1 35 100 0 16 12 0.0000 4 165 240 6235 8022 25\001
-4 1 35 100 0 16 12 0.0000 4 165 240 9589 8256 26\001
-4 1 35 100 0 16 12 0.0000 4 165 240 7629 7261 27\001
-4 1 35 100 0 16 12 0.0000 4 165 240 7945 6645 28\001
-4 1 35 100 0 16 12 0.0000 4 165 240 8914 7940 29\001
-4 1 35 100 0 16 12 0.0000 4 165 240 9297 4714 30\001
-4 1 35 100 0 16 12 0.0000 4 165 240 7036 6297 31\001
-4 1 35 100 0 16 12 0.0000 4 165 240 8962 5941 32\001
-4 1 35 100 0 16 12 0.0000 4 165 240 8718 6891 33\001
diff -Nru igraph-0.6.5~quantal1/doc/papers/iccs06/net.bib igraph-0.6.5/doc/papers/iccs06/net.bib
--- igraph-0.6.5~quantal1/doc/papers/iccs06/net.bib	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/papers/iccs06/net.bib	1970-01-01 00:00:00.000000000 +0000
@@ -1,1559 +0,0 @@
-
-@PhdThesis{clarkson03,
-  author =       { Gavin Clarkson },
-  title =        { Objective Identification of Patent Thickets:
-                   A Network Analytic Approach },
-  school =       { Harvard Business School },
-  year =         { 2003 }
-}
-
-@Misc{vazquez01a,
-  author =       { Alexei Vazquez },
-  title =        { Statistics of Citation Networks },
-  howpublished = { cond-mat/0105031 },
-  month =        { May },
-  year =         { 2001 }
-}
-
-@Article{vazquez01,
-  author =       { Alexei Vazquez },
-  title =        { Knowing a network by walking on it: emergence of scaling },
-  journal =      { Europhys. Lett. },
-  year =         { 2001 },
-  volume =       { 54 },
-  pages =        { 430 },
-  note =         { cond-mat/0006132 }
-}
-
-@TechReport{breschi04,
-  author =       { Stefano Breschi and Francesco Lissoni },
-  title =        { Knowledge networks from patent data: 
-                   Methodological issues and research targets },
-  year =         { 2004 },
-  month =        { Jan },
-  institution =  { CESPRI, Centre for Research on Innovation and 
-                   Internationalisation Processes, 
-                   Universita' Bocconi, Milano, Italy },
-  type =         { CESPRI Working Papers },
-  url =          { http://ideas.repec.org/p/cri/cespri/wp150.html},
-  number =       { 150 }
-}
-
-@Misc{hajra04,
-  author =       { Kamalika Basu Hajra and Parongama Sen },
-  title =        { Aging in citation networks },
-  howpublished = { cond-mat/0409017},
-  year =         { 2004 },
-  month =        { Sep }
-}
-
-@Misc{redner04,
-  author =       { Sidney Redner },
-  title =        { Citation Statistics From More Than a Century of Physical Review },
-  howpublished = { physics/0407137 },
-  year =         { 2004 },
-  url =          { http://arxiv.org/abs/physics/0407137 }
-}
-
-@Article{redner05,
-  author = { Sidney Redner },
-  title = { Citation Statistics from 110 Years of Physical Review },
-  journal = { Physics Today },
-  volume = { 58 },
-  pages = { 49 },
-  year = { 2005 }
-}
-
-@Article{borner04,
-  author =       { Katy B\"orner and Jeegar T. Maru and Robert L. Goldstone },
-  title =        { The simultaneous evolution of author and paper networks },
-  journal =      { Proc. Natl. Acad. Sci. USA },
-  year =         { 2004 },
-  month =        { Apr },
-  volume =       { 101 },
-  pages =        { 5266--5273 }
-}
-
-@Misc{sen04,
-  author =       { Parongama Sen },
-  title =        { Directed Accelerated Growth: Application in 
-                   Citation Network },
-  howpublished = { cond-mat/0409154 },
-  year =         { 2004 },
-  month =        { Sep }
-}
-
-@Article{mitzenmacher04,
-  author =       { Michael Mitzenmacher }, 
-  title =        { A brief history of generative models for power law and
-                   lognormal distributions },
-  journal =      { Internet Mathematics },
-  volume =       { 1 },
-  pages =        { 226--251 },
-  year =         { 2004 },
-}
-
-@Misc{goldstein04,
-  author =       { Michel L. Goldstein and Steven A. Morris and
-                   Gary G. Yen },
-  title =        { A Group-Based Yule Model for Bipartite 
-                   Author-Paper Networks },
-  howpublished = { cond-mat/0409205 },
-  year =         { 2004 },
-  month =        { Sep }
-}
-
-@Book{wasserman94,
-  author =       { Wasserman, S. and Faust, K. },
-  title =        { Social network analysis methods and applications},
-  year =         { 1994 },
-  publisher =    { Cambridge University Press },
-  address =      { New York}
-}
-
-@Article{zhu03,
-  author =       { Han Zhu and Xinran Wang and Jian-Yang Zhu },
-  title =        { Effect of aging on network structure },
-  year =         { 2003 },
-  journal =      { Phys. Rev. E },
-  volume =       { 68 },
-  pages =        { 056121 }
-}
-
-@Article{dorogovtsev00,
-  author =       { S. N. Dorogovtsev and J. F. F. Mendes },
-  title =        { Evolution of networks with aging of sites },
-  year =         { 2000 },
-  journal =      { Phys. Rev. E },
-  volume =       { 62 },
-  number =       { 2 },
-  pages =        { 1842--1845 }
-}
-
-@Article{klemm02,
-  author =       { Konstantin Klemm and V{\'\i{}}ctor M. Egu{\'\i{}}luz },
-  title =        { Highly clustered scale-free networks },
-  year =         { 2002 },
-  journal =      { Phys. Rev. E },
-  volume =       { 65 },
-  pages =        { 036123 }
-}
-
-@Article{amaral00,
-  author =       { L. A. N. Amaral and A. Scala and M. Barh{\'e}l\'emy and 
-                   H. E. Stanley },
-  title =        { Classes of small-world networks },
-  journal =      { Proc. Natl. Acad. Sci. USA },
-  year =         { 2000 },
-  volume =       { 97 },
-  number =       { 21 },
-  pages =        { 11149--11152 },
-  month =        { 10 },
-}
-
-@Article{albert00,
-  author =       { R\'eka Albert and Albert-L\'aszl\'o Barab\'asi },
-  title =        { Topology of evolving networks: Local 
-                   events and universality },
-  journal =      { Phys. Rev. Lett. },
-  volume =       { 85 }, 
-  pages =        { 5234 },
-  year =         { 2000 }
-}
-
-@Article{barabasi99,
-  author =       { Albert-L\'aszl\'o Barab\'asi and R\'eka Albert 
-                   and  Hawoong Jeong},
-  title =        { Mean-field theory for scale-free random networks },
-  journal =      { Physica~A },
-  volume =       { 272 }, 
-  pages =        { 173--187},
-  year =         { 1999 },
-  note =         { cond-mat/9907068 }
-}
-
-@Article{newman04,
-  author =       { Newman, M. E. J. },
-  title =        { Detecting community structure in networks },
-  journal =      { Eur. Phys. J. B },
-  volume =       { 38 },
-  pages =        { 321--330 },
-  year =         { 2004 }
-}
-
-@Article{ravasz03,
-  author =       { Erzs\'ebet Ravasz and Albert-L\'aszl\'o Barab\'asi },
-  title =        { Hierarchical Organization in Complex Networks },
-  journal =      { Phys. Rev. E },
-  volume =       { 67 },
-  pages =        { 026112 },
-  year =         { 2003 }
-}
-
-@Article{newman04a,
-  author =       { M. E. J. Newman },
-  title =        { Power laws, {P}areto distributions and {Z}ipf's law },
-  journal =      { Contemporary Physics }, 
-  year =         { 2005 },
-  volume =       { in press },
-  url =          { http://aps.arxiv.org/abs/cond-mat/0412004/ }
-}
-
-@Article{newman03,
-  author =       { M. E. J. Newman },
-  title =        { The structure and function of complex networks },
-  journal =      { SIAM Review },
-  volume =       { 45 },
-  pages =        { 167--256 },
-  year =         { 2003 }
-}
-
-@Article{brin98,
-  Author =       { Brin, S. and Page, L. },
-  Title =        { The anatomy of a large-scale hypertextual 
-                   Web search engine },
-  Journal =      { Computer Networks },
-  Volume =       { 30 },
-  Pages =        { 107-- 117},
-  Year =         { 1998 }
-}
-
-@techreport{page98,
-  author =       { Lawrence Page and Sergey Brin and Rajeev Motwani and 
-                   Terry Winograd },
-  institution =  { Stanford Digital Library Technologies Project },
-  title =        { The PageRank Citation Ranking: Bringing Order to the Web },
-  year =         { 1998 },
-  url =          { citeseer.ist.psu.edu/page98pagerank.html }
-}
-
-@Article{morris04,
-  author =       { S. A. Morris },
-  title =        { Manifestation of emerging specialities in journal 
-                   literature: a growth model of papers, references, 
-                   exemplars, bibliographic coupling, co-citation and 
-                   clustering coefficient distribution },
-  journal = {J. Am. Soc. Inf. Sci. Technol.},
-   volume =       { in press },
-  year =         { 2005 }
-}
-
-@article{morris02,
- author = {Steven A. Morris and G. Yen and Zheng Wu and Benyam Asnake},
- title = {Time line visualization of research fronts},
- journal = {J. Am. Soc. Inf. Sci. Technol.},
- volume = {54},
- number = {5},
- year = {2003},
- issn = {1532-2882},
- pages = {413--422},
- doi = {http://dx.doi.org/10.1002/asi.10227},
- publisher = {John Wiley \& Sons, Inc.},
- }
-
-@article{singh04,
-  author = 	 { Jasjit Singh },
-  title = 	 { Collaborative Networks as Determinants of Knowledge
-                  Diffusion Patterns },
-  year = 	 { 2004 },
-  volume =       { Forthcoming },
-  journal =      { Management Science } 
-}
-
-@TECHREPORT{duguet03,
-AUTHOR={Duguet Emmanuel and MacGarvie Megan},
-TITLE={How Well Do Patent Citations Measure Flows of Technology?
-                  Evidence from French Innovation Surveys}, 
-YEAR=2004,
-MONTH=Nov,
-INSTITUTION={Economics Working Paper Archive at WUSTL},
-TYPE={Development and Comp Systems},
-URL={http://ideas.repec.org/p/wpa/wuwpdc/0411018.html},
-NUMBER={0411018}
-}
-
-@TECHREPORT{paci03,
-AUTHOR={Raffaele Paci and Ernesto Batteta},
-TITLE={Innovation Networks and Knowledge Flows across the European Regions},
-YEAR=2003,
-INSTITUTION={Centre for North South Economic Research, University of
-                  Cagliari and Sassari, Sardinia}, 
-TYPE={Working Paper CRENoS},
-URL={http://ideas.repec.org/p/cns/cnscwp/200313.html},
-NUMBER={200313}
-}
- 
-@techreport{criscuolo02,
-AUTHOR={Criscuolo,Paola},
-TITLE={Reverse Technology Transfer: A Patent Citation Analysis of the
-                  European Chemical and Pharmaceutical sectors}, 
-YEAR=2002,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research
-                  Institute on Innovation and Technology}, 
-TYPE={Research Memoranda},
-URL={http://ideas.repec.org/p/dgr/umamer/2002036.html},
-NUMBER={036}
-}
-
-@article{leydesdorff05,
-  author = { Loet Leydesdorff },
-  title =  { The university-industry knowledge
-             relationship: Analyzing patents and 
-             the science base of technologies },
- journal = {J. Am. Soc. Inf. Sci. Technol.},
-  valume =  { forthcoming },
-  year = 2005
-}
-
-@inproceedings{cassi04,
-  author = { Lorenzo Cassi and  Lorenzo Zirulia },
-  title =  { Friend and Rivals: modelling the social relations of
-                  inventors. },
-  booktitle = { 4th Congress on Proximity Economics: Proximity, Networks 
-                and Co-ordination }, 
-  year = {2004}
-}
-
-@article{hummon89,
-  author = { Hummon N.P. and Doreian P. },
-  title =  { Connectivity in a Citation Network:
-             The Development of DNA Theory },
-  journal = { Social Networks },
-  volume =  11,
-  year = 1989,
-  pages = { 39--63}
-}
-
-@misc{batagelj03,
-  author = { Vladimir Batagelj }, 
-  title = { Efficient Algorithms for Citation Network Analysis },
-  note = { arXiv:cs.DL/0309023 },
-  year = 2003
-}
-
-@TECHREPORT{breschi03,
-AUTHOR={Stefano Breschi and Francesco Lissoni},
-TITLE={Mobility and Social Networks: Localised Knowledge Spillovers Revisited},
-YEAR=2003,
-MONTH=Mar,
-INSTITUTION={CESPRI, Centre for Research on Innovation and Internationalisation Processes, Universita' Bocconi, Milano, Italy},
-TYPE={CESPRI Working Papers},
-URL={http://ideas.repec.org/p/cri/cespri/wp142.html},
-NUMBER={142}
-}
-
-@ARTICLE{cowan00,
-AUTHOR={Cowan, Robin and David, Paul A and Foray, Dominique},
-TITLE={The Explicit Economics of Knowledge Codification and Tacitness},
-JOURNAL={Industrial and Corporate Change},
-YEAR=2000,
-VOLUME={9},
-NUMBER={2},
-PAGES={211-53},
-MONTH={June},
-URL={http://ideas.repec.org/a/oup/indcch/v9y2000i2p211-53.html}
-}
- 
-@TECHREPORT{cowan02,
-AUTHOR={R. Cowan and N. Jonard and J.-B. Zimmermann},
-TITLE={The Joint Dynamics of Networks and Knowledge},
-YEAR=2002,
-MONTH=Jul,
-INSTITUTION={Society for Computational Economics},
-TYPE={Computing in Economics and Finance 2002},
-URL={http://ideas.repec.org/p/sce/scecf2/354.html},
-NUMBER={354}
-}
-
-@ARTICLE{cowan97,
-AUTHOR={Cowan, Robin and Foray, Dominique},
-TITLE={The Economics of Codification and the Diffusion of Knowledge},
-JOURNAL={Industrial and Corporate Change},
-YEAR=1997,
-VOLUME={6},
-NUMBER={3},
-PAGES={595-622},
-MONTH={September},
-URL={http://ideas.repec.org/a/oup/indcch/v6y1997i3p595-622.html}
-}
-
-@TECHREPORT{cowan00a,
-AUTHOR={Cowan,Robin and Jonard,Nicolas},
-TITLE={The Dynamics of Collective Invention},
-YEAR=2000,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research Institute on Innovation and Technology},
-TYPE={Research Memoranda},
-URL={http://ideas.repec.org/p/dgr/umamer/2000018.html},
-NUMBER={018}
-}
- 
-@TECHREPORT{cowan01,
-AUTHOR={Cowan,Robin and Jonard,Nicolas},
-TITLE={The Workings of Scientific Communities},
-YEAR=2001,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research Institute on Innovation and Technology},
-TYPE={Research Memoranda},
-URL={http://ideas.repec.org/p/dgr/umamer/2001030.html},
-NUMBER={030}
-}
- 
-@TECHREPORT{cowan03,
-AUTHOR={Cowan,Robin and Jonard,Nicolas and Ã\u2013zman,Müge},
-TITLE={Knowledge Dynamics in a Network Industry},
-YEAR=2003,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research Institute on Innovation and Technology},
-TYPE={Research Memoranda},
-URL={http://ideas.repec.org/p/dgr/umamer/2003003.html},
-NUMBER={003}
-}
-
-@TECHREPORT{cowan04,
-AUTHOR={Cowan,Robin and Jonard,Nicolas and Zimmermann,J-B},
-TITLE={On the creation of networks and knowledge},
-YEAR=2004,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research Institute on Innovation and Technology},
-TYPE={Research Memoranda},
-URL={http://ideas.repec.org/p/dgr/umamer/2004010.html},
-NUMBER={010}
-}
-
-@TECHREPORT{cowan04a,
-AUTHOR={Cowan,Robin},
-TITLE={Network models of innovation and knowledge diffusion},
-YEAR=2004,
-INSTITUTION={Maastricht : MERIT, Maastricht Economic Research Institute on Innovation and Technology},
-NOTE={available at http://ideas.repec.org/p/dgr/umamer/2004016.html},
-NUMBER={016}
-}
-
-
-@Article{barabasi99a,
-  author = 	 {Barab\'asi, Albert-L\'aszl\'o and R\'eka Albert},
-  title = 	 {Emergence of scaling in random networks},
-  journal = 	 {Science},
-  year = 	 {1999},
-  volume = 	 {286},
-  number = 	 {5439},
-  pages = 	 {509--512}
-}
-
-@Article{albert02,
-  author =       { R\'eka Albert and Albert-L\'aszl\'o Barab\'asi },
-  title =        { Statistical mechanics of complex networks },
-  journal =      { Reviews of Modern Physics },
-  volume =       { 74 }, 
-  pages =        { 47 },
-  year =         { 2002 }
-}
-
-@Book{nocedal99,
-  author =       { Nocedal, J. and Wright, S. J. }, 
-  year =         { 1999 },
-  title =        { Numerical Optimization },
-  publisher =    { Springer }
-}
-
-@Article{price65,
-  author =       { Price, D. J. de S.},
-  title =        { Networks of scientific papers}, 
-  journal =      { Science },
-  volume =       { 149 }, 
-  pages =        { 510-­515 },
-  year =         { 1965 }
-}
-
-@Article{redner98,
-  author =       { Redner, S. }, 
-  title =        { How popular is your papeer? An empirical
-      study of the citation distribution }, 
-  journal =      { Eur. Phys. J. B }, 
-  volume =       { 4 },
-  pages =        { 131­-134 },
-  year =         { 1998 }
-}
-
-@book{egghe00,
-  author =       { Egghe, L. and Rousseau, R. },
-  title =        { Introduction to Informetrics }, 
-  publisher =    { Elsevier }, 
-  address =      { Amsterdam }, 
-  year =         { 1990 }
-}
-
-@Article{jeong03,
-  title =        { Measuring preferential attachment for evolving networks },
-  author =       { Hawoong Jeong and Zolt\'an N\'eda and
-                   Albert-L\'aszl\'o Barab\'asi },
-  journal =      { Europhys. Lett. }, 
-  volume =       { 61 }, 
-  pages =        { 567--572 },
-  year =         { 2003 }
-}
-
-@Misc{fronczak05,
-  author =       { Agata Fronczak and Piotr Fronczak and Janusz A. Holyst },
-  title =        { How to calculate the main characteristics of random uncorrelated networks},
-  year =         { 2005 },
-  howpublished = { cond-mat/0502663 },
-  url =          { http://arxiv.org/abs/cond-mat/0502663 }
-}
-
-@Article{bollobas04,
-  author =       { B\'ela Bollob\'as and Oliver Riordan },
-  title =        { The diameter of a scale-free random graph },
-  year =         { 2004 },
-  journal =      { Combinatorica },
-  volume =       { 24 },
-  number =       { 1 },
-  pages =        { 5--34 }
-}
-
-@Misc{hall04,
-  author =       { Bronwyn H. Hall },
-  title =        { Exploring the patent explosion },
-  institution =  { National Bureau of Economic Research },
-  year =         { 2004 },
-  number =       { Working Paper 10605 },
-  note =         { Working Paper 10605, National Bureau of Economic Research }
-}
-
-@book{jaffe04, 
-  author =       { Adam B. Jaffe and Josh Lerner },
-  title =        { Innovation and Its Discontents : How Our Broken Patent 
-                   System is Endangering Innovation and Progress, and What 
-                   to Do About It },
-  publisher =    { Princeton University Press },
-  year =         { 2004 }
-}
-
-@article{allison02,
-  author = { Allison, John R. and Mark A. Lemley }, 
-  title = { The Growing Complexity of the United States Patent System }, 
-  volume = { 82 },
-  journal = { Boston University Law Review },
-  pages = { 77 },
-  year = { 2002 }
-}
-
-@article{allison04,
-  author = { Allison, John R. and Mark A. Lemley and Kimberly A. Moore 
-             and R. Derek Trunkey },
-  title = { Valuable Patents },
-  volume = { 92 },
-  journal = { Georgetown Law Journal },
-  pages = { 435 },
-  year = { 2004 }
-}
-
-@article{astebro03,
-  author = { Astebro, Thomas },
-  title = { The Return to Independent Invention:  Evidence of
-                  Unrealistic Optimism, Risk Seeking or Skewness
-                  Loving? },
-  volume = { 113 }, 
-  journal = { The Economic Journal },
-  pages = { 226--239 },
-  year = { 2003 }
-}
-
-@book{bak99,
-  author = { Bak, Per }, 
-  title = { How Nature Works:  The Science of Self-Organized
-                  Criticality }, 
-  publisher = { Springer-Verlag Telos },
-  year = { 1999 }
-}
-
-@book{barabasi02,
-  author = { Barab\'asi, Albert-L\'aszl\'o },
-  title = { Linked:  The New Science of Networks }, 
-  publisher = { Perseus Publishing },
-  year = { 2002 }
-}
-
-@inproceedings{bessen03,
-  author = { Bessen, James and Robert M. Hunt }, 
-  title = { The Software Patent Experiment },
-  booktitle = { Proceedings of OECD Conference on Patents, Innovation
-                  and Economic Performance OECD }, 
-  month = { April },
-  year = { 2003 }
-}
-
-@article{bessen05,
-  author = { Bessen, James and Michael J. Meurer },  
-  title = { Lessons For Patent Policy From Empirical Research On
-                  Patent Litigation }, 
-  volume = { 9 },
-  journal = { Lewis \& Clark Law Review },
-  pages = { 1 },
-  year = { 2005 }
-}
-
-@article{burk03,
-  author = { Burk, Dan L. and Mark A. Lemley }, 
-  title = { Policy Levers in Patent Law }, 
-  volume = { 79 },
-  journal = { Virginia Law Review },
-  pages = { 101 },
-  year = { 2003 }
-}
-
-@incollection{burk05,
-  author = { Burk, Dan L. and Mark A. Lemley }, 
-  title = { Designing Optimal Software Patents }, 
-  booktitle = { Intellectual Property Rights In Frontier Industries:
-                  Software And Biotechnology }, 
-  editor = { Robert Hahn },
-  publisher = { AEI Press },
-  year = { 2005 }
-}
-
-@book{chakrabarti05,
-  editor = { Chakrabarti, Bikas K. and Arnab Chatterjee and Sudhakar
-                  Yarlagadda },
-  title = {  Econophysics of Wealth Distributions (New Economic
-                  Windows) },
-  publisher = { Springer },
-  year = { 2005 }
-}
-
-@book{cohen03,
-  editor = { Cohen, Wesley M. and Stephen A. Merrill }, 
-  title = { Patents in the Knowledge-Based Economy }, 
-  year = { 2003 },
-  publisher = { National Research Council of the National Academies,  
-                The National Academies Press}
-}
-
-@misc{crouch05,
-  author = { Crouch, Dennis },
-  title = { Children Rejoice -- Peanut Butter and Jelly Patent
-                  Rejected on Appeal }, 
-  howpublished = { Patently-O Blog, April 8 },
-  url = { http://patentlaw.typepad.com },
-  year = { 2005 }
-}
-
-@book{dorogovtsev03,
-  author = { Dorogovtsev, S. N. and J. F. F. Mendes },
-  title = { Evolution of Networks. From Biological Nets to the
-                  Internet and WWW }, 
-  publisher = { Oxford University Press },
-  year = { 2003 }
-}
-
-@article{dreyfuss89,
-  author= { Dreyfuss, Rochelle Cooper }, 
-  title = { The Federal Circuit: A Case Study in Specialized Courts }, 
-  volume = { 64 },
-  journal = { New York University Law Review },
-  pages = { 1 },
-  year = { 1989 }
-}
-
-@article{dreyfuss04,
-  author = { Dreyfuss, Rochelle Cooper }, 
-  title = { The Federal Circuit: A Continuing Experiment in
-                  Specialization }, 
-  volume = { 54 },
-  journal = { Case Western Reserve Law Review },
-  pages = { 769 },
-  year = { 2004 }
-}
-
-@article{duguet05,
-  author = { Duguet, Emmanuel and Megan MacGarvie }, 
-  title = { How Well Do Patent Citations Measure Flows of Technology?
-                  Evidence from French Innovation Surveys }, 
-  volume = { 14 },
-  journal = { Economics of Innovation and New Technology }, 
-  pages = { 374--93 },
-  year = { 2005 }
-}
-
-@Misc{ftc03,
-  author = { {Federal Trade Commission} },
-  title =        { To Promote Innovation:
-                   The Proper Balance of Competition and Patent Law
-                   and Policy }, 
-  howpublished = { Report },
-  year =         { 2003 },
-  month =        { October }
-}
-
-@article{frenken05,
-  author = { Frenken, Koen }, 
-  title = { Technological Innovation and Complexity Theory },
-  journal = { Economics of Innovation and New Technology },
-  year = { 2005 },
-  volume = { forthcoming }
-}
-
-@incollection{graham03,
-  author = { Graham, Stuart J. H. and David C. Mowery }, 
-  title = { Intellectual Property Protection in the U.S. Software
-                  Industry }, 
-  editor = { Cohen, Wesley M. and Stephen A. Merrill }, 
-  booktitle = { Patents in the Knowledge-Based Economy }, 
-                  publisher = { National Research Council of the
-                  National Academies, The National Academies Press },
-  year = { 2003 }
-}
-
-@article{griliches90,
-  author = { Griliches, Zvi }, 
-  title = { Patent Statistics as Economic Indicators:  A Survey }, 
-  volume = { 28 },
-  journal = { Journal of Economic Literature },
-  pages = { 1661--1707 },
-  year = { 1990 }
-}
-
-@article{hagedoorn03,
-  author = { Hagedoorn, John and Myriam Cloodt }, 
-  title = { Measuring Innovative Performance:  Is There an Advantage
-                  in Using Multiple Indicators? }, 
-  volume = { 32 },
-  journal = { Research Policy },
-  pages = { 1365-1379 }, 
-  year = { 2003 }
-}
-
-@article{hall01,
-  author = { Hall, Bronwyn and Rosemarie Ziedonis }, 
-  title = { The Patent Paradox Revisited: An Empirical Study of
-                  Patenting in the U.S. Semiconductor Industry
-                  1979-1995 }, 
-  volume = { 32 },
-  journal = { RAND Journal of Economics },
-  pages = { 101 },
-  year = { 2001 }
-}
-
-@InCollection{hall03,
-  author = 	 { Hall, Bronwyn H. and Adam B. Jaffe and Manuel
-                  Trajtenberg },
-  editor = 	 { Adam B. Jaffe and Manuel Trajtenberg},
-  booktitle = 	 {  Patents, Citations, and
-                  Innovations:  A Window on the Knowledge Economy },
-  title = 	 {The NBER Patent Citation Data File: Lessons,
-                  Insights and Methodological Tools},
-  publisher = 	 { MIT Press },
-  year = 	 { 2003 },
-}
-
-@article{hall05,
-  author =       { Hall, Bronwyn H. },
-  title =        { Exploring the Patent Explosion },
-  journal =      { Journal of Technology Transfer },
-  volume =       { 30 },
-  pages =        { 35--48 },
-  year =         { 2005 }
-}
-
-@article{harhoff98,
-  author = { Harhoff, D., F. Narin and  F.M. Scherer and K. Vopel },
-  title = { Citation Frequency and the Value of Patented
-                  Inventions }, 
-  volume = { 81 },
-  journal = { Review of Economics and Statistics },
-  pages = { 511--515 },
-  year = { 1998 }
-}
-
-@article{harhoff03,
-  author = { Harhoff, Dietmar and Scherer, Frederic M. and Vopel,
-                  Katrin }, 
-  title = { Citations, Family Size, Opposition and the Value of Patent
-                  Rights }, 
-  volume = { 32 },
-  journal = { Research Policy }, 
-  pages = { 1343--1363 },
-  year = { 2003 }
-}
-
-@article{heald05,
-  author = { Heald, Paul J. }, 
-  title = { A Transaction Costs Theory of Patent Law }, 
-  volume = { 66 },
-  journal = { Ohio State Law Journal },
-  year = { 2005 }
-}
-
-@article{heller98,
-  author = { Heller, Michael and Rebecca S. Eisenberg }, 
-  title = { Can Patents Deter Innovation?  The Anticommons in
-                  Biomedical Research }, 
-  volume = { 280 },
-  journal = { Science },
-  pages = { 698--701 },
-  month = { May },
-  year = { 1998 }
-}
-
-@article{hohenberg77,
-  author = { Hohenberg, P.C. and B. I. Halperin }, 
-  title = { Theory of Dynamic Critical Phenomena }, 
-  volume = { 49 },
-  journal = { Reviews of Modern Physics },
-  pages = { 435 },
-  year = { 1977 }
-}
-
-@Book{jaffe02,
-  author =       { A. Jaffe and M. Trajtenberg },
-  title =        { Patents, Citations \& Innovations: A Window on the
-                   Knowledge Economy },
-  publisher =    { MIT Press },
-  year =         { 2003 }
-}
-
-@book{jensen98,
-  author = { Jensen, Henrik Jeldtoft }, 
-  title = { Self-Organized Criticality:  Emergent Complex Behavior in
-                  Physical and Biological Systems },
-  publisher = { Cambridge University Press },
-  series = { Cambridge Lecture Notes in Physics }, 
-  number = { 10 },
-  year = { 1998 }
-}
-
-@article{krapivsky00,
-  author = { Krapivsky, P.L. and S. Redner and F. Leyvraz }, 
-  title = { Connectivity of Growing Random Networks }, 
-  volume = { 85 },
-  journal = { Physical Review Letters },
-  pages = { 4629--4632 },
-  year = { 2000 }
-}
-
-@article{landes04,
-  author = { Landes, William M. and Richard A. Posner }, 
-  title = { An Empirical Analysis of the Patent Court }, 
-  volume = { 71 },
-  journal = { University of Chicago Law Review },
-  pages = { 111 },
-  year = { 2004 }
-}
-
-@article{lanjouw04,
-  author = { Lanjouw, Jean O. and Mark Schankerman }, 
-  title = { Patent Quality And Research Productivity: Measuring
-                  Innovation With Multiple Indicators }, 
-  volume = { 114 },
-  journal = { Economic Journal },
-  pages = { 441--465 }, 
-  year = { 2004 }
-}
-
-@article{lemley05,
-  author = { Lemley, Mark A. and Carl Shapiro }, 
-  title = { Probabilistic Patents }, 
-  volume = { 19 },
-  journal = { Journal of Economic Perspectives },
-  pages = { 75--98 },
-  year = { 2005 }
-}
-
-@article{litmann97,
-  author = { Litmann, Allan N. }, 
-  title = { Restoring the Balance of Our Patent System }, 
-  volume = { 37 },
-  journal = { IDEA },
-  pages = { 545 },
-  year = { 1997 }
-}
-
-@article{long02,
-  author = { Long, Clarisa }, 
-  title = { Patent Signals }, 
-  volume = { 69 },
-  journal = { University of Chicago Law Review },
-  pages = { 625 },
-  year = { 2002 }
-}
-
-@article{lunney01,
-  author = { Lunney, Glynn S., Jr. }, 
-  title = { E-Commerce And Equivalence: Definining The Proper Scope Of
-                  Internet Patents Symposium: E-Obviousness }, 
-  volume = { 7 },
-  journal = { Michigan Telecommunications and Technology Law
-                  Review },
-  pages = { 363 },
-  year = { 2000/2001 }
-}
-
-@book{ma00,
-  author = { Ma, Shanggeng and Shang-Keng Ma }, 
-  title = { Modern Theory of Critical Phenomena }, 
-  publisher = { Perseus },
-  year = { 2000 }
-}
-
-@misc{malchup58,
-  author = { Malchup, Fritz }, 
-  title = { An Economic Review of the Patent System }, 
-  howpublished = { Study No. 15 of the Subcomm. On Patents,
-                  Trademarks, and Copyrights of the Committee on the
-                  Judiciary, 85th Cong., 2d sess. },
-  year = { 1958 }
-}
-
-@book{mandelbrot04,
-  author = { Mandelbrot, Benoit and Richard L. Hudson }, 
-  title = { The (Mis)behavior of Markets }, 
-  publisher = { Basic Books },
-  year = { 2004 }
-}
-
-@article{mann05,
-  author = { Mann, Ronald J. }, 
-  title = { The Myth of the Software Patent Thicket:  An Empirical
-                  Investigation of the Relationship Between
-                  Intellectual Property and Innovation in Software
-                  Firms }, 
-  volume = { 83 },
-  journal = { Texas Law Review },
-  pages = { 961 },
-  year = { 2005 }
-}
-
-@book{mantegna99,
-  author = { Mantegna, Rosario N. and H. Eugene Stanley }, 
-  title = { An Introduction to Econophysics: Correlations and
-                  Complexity in Finance }, 
-  publisher = { Cambridge University Press },
-  year = { 1999 }
-}
-
-@article{marco05,
-  author = { Marco, Alan C. }, 
-  title = { The Option Value of Patent Litigation:  Theory and
-                  Evidence }, 
-  journal = { Review of Financial Economics },
-  volume = { forthcoming },
-  year = { 2005 }
-}
-
-@article{marsili05,
-  author = { Marsili, Orietta and Ammon Salter }, 
-  title = { `{I}nequality' of Innovation:  Skewed Distributions and the
-                  Returns to Innovation in Dutch Manufacturing }, 
-  volume = { 14 },
-  journal = { Economics of Innovation and New Technologies },
-  pages = { 83--102 },
-  year = { 2005 }
-}
-
-@article{maurseth05,
-  author = { Maurseth, Per Botolf }, 
-  title = { Lovely but Dangerous:  The Impact of Patent Citations on
-                  Patent Renewal }, 
-  volume = { 14 },
-  journal = { Economics of Innovation and New
-                  Technologies },
-  pages = { 351--374 },
-  year = { 2005 }
-}
-
-@article{merges90,
-  author = { Merges, Robert P. and Richard R. Nelson }, 
-  title = { On the Complex Economics of Patent Scope }, 
-  volume = { 90 },
-  journal = { Columbia Law Review },
-  pages = { 839 },
-  year = { 1990 }
-}
-
-@article{merges00,
-  author = { Merges, Robert P. }, 
-  title = { One Hundred Years of Solicitude: Intellectual Property
-                  Law, 1900-2000 }, 
-  volume = { 88 },
-  journal = { California Law Review },
-  pages = { 2187 },
-  year = { 2000 }
-}
-
-@book{merrill04,
-  editor = { Merrill, Stephen A. and Richard C. Levin and Mark
-                  B. Myers },
-  title = { A Patent System for the 21st Century }, 
-  publisher = { National Research Council of the National Academies,
-                  National Academies Press },
-  year = { 2004 }
-}
-
-@unpublished{meurer05,
-  author = { Meurer, Michael and James Bessen }, 
-  title = { The Patent Litigation Explosion }, 
-  note = { Presentation at the Annual Meeting of the American Law and
-                  Economics Association (May 6-7) },
-  year = { 2005 }
-}
-
-@article{moore05,
-  author = { Moore, Kimberly A. }, 
-  title = { Worthless Patents }, 
-  volume = { 20 },
-  journal = { Berkeley Technology Law Journal },
-  year = { 2005 }
-}
-
-@Article{newman04b,
-  author = { Newman, M. E. J. }, 
-  title = { Fast Algorithm for Detecting Community Structure in
-                  Networks }, 
-  volume = { 69 },
-  journal = { Physical Review E },
-  pages = { 066133 },
-  year = { 2004 }
-}
-
-@article{newman04c,
-  author = { Newman, M. E. J. and M. Girvan }, 
-  title = { Finding and Evaluating Community Structure in Networks }, 
-  volume = { 69 },
-  journal = { Physical Review E }, 
-  pages = { 026113 },
-  year = { 2004 }
-}
-
-@article{palla05,
-  author = { Palla, Gergely and Imre Der\'enyi and Ill\'es Farkas and
-                  Tam\'as Vicsek }, 
-  title = { Uncovering the Overlapping Community
-                  Structure of Complex Networks in Nature and Society },
-  volume = { 435 },
-  journal = { Nature },
-  pages = { 814--818 },
-  year = { 2005 }
-}
-
-@book{pastorsatorras04,
-  author = { Pastor-Satorras, Romualdo and Alessandro Vespignani }, 
-  title = { Evolution and Structure of the Internet : A Statistical
-                  Physics Approach }, 
-  publisher = { Cambridge University Press },
-  year = { 2004 }
-}
-
-@article{rai03,
-  author = { Rai, Arti K. }, 
-  title = { Engaging Facts And Policy: A Multi-Institutional Approach
-                  To Patent System Reform },
-  volume = { 103 },
-  journal = { Columbia Law Review },
-  pages = { 1035 },
-  year = {2003 }
-}
-
-@article{scherer00,
-  author = { Scherer, F.M. and Dietmar Harhoff }, 
-  title = { Technology Policy for a World of Skew-Distributed Outcomes },
-  volume = { 29 },
-  journal = { Research Policy },
-  pages = { 559--566 },
-  year = { 2000 }
-}
-
-@article{scherer00a,
-  author = { Scherer, F. M. and Dietmar Harhoff and Jorg Kukies }, 
-  title = { Uncertainty and the Size Distribution of Rewards from
-                  Innovation }, 
-  volume = { 10 },
-  journal = { Journal of Evolutionary Economics },
-  pages = { 175--200 },
-  year = { 2000 }
-}
-
-@book{shapiro01,
-  author = { Shapiro, Carl }, 
-  title = { Navigating the Patent Thicket:  Cross Licenses, Patent
-                  Pools, and Standard-Setting in Innovation Policy and
-                  the Economy }, 
-  volume = { I }, 
-  note = { Adam Jaffe and Joshua Lerner and Scott Stern, eds. }, 
-  publisher = { MIT Press },
-  year = { 2001 }
-}
-
-@article{silverberg05,
-  author = { Silverberg, Gerald and Bart Verspagen }, 
-  title = { A Percolation Model of Innovation in Complex Technology
-                  Spaces }, 
-  volume = { 29 },
-  journal = { Journal of Economic Dynamics and Control },
-  pages = { 225--244 },
-  year = { 2005 }
-}
-
-@article{song05, 
-  author = { Song, Chaoming and Shlomo Havlin and Hern\'an A. Makse }, 
-  title = { Self-similarity of Complex Networks }, 
-  volume = { 433 },
-  journal = { Nature },
-  pages = { 392--395 },
-  year = { 2005 }
-}
-
-@book{stanley71,
-  author = { Stanley, H. Eugene }, 
-  title = { Introduction to Phase Transitions and Critical Phenomena },
-  publisher = { Oxford University Press },
-  year = { 1971 }
-}
-
-@article{stanley99,
-  author = { Stanley, H. Eugene }, 
-  title = { Scaling, Universality, and Renormalization: Three Pillars
-                  of Modern Critical Phenomena }, 
-  volume = { 71 },
-  journal = { Reviews of Modern Physics },
-  pages = { S358 },
-  year = { 1999 }
-}
-
-@article{ thomas03,
-  author = { Thomas, John R. }, 
-  title = { Formalism At The Federal Circuit }, 
-  volume = { 52 },
-  journal = { American University Law Review },  
-  pages = { 771 },
-  year = { 2003 }
-}
-
-@article{trajtenberg90,
-  author = { Trajtenberg, Manuel }, 
-  title = { A Penny for your Quotes:  Patent Citations and the Value
-                  of Innovations }, 
-  volume = { 21 },
-  journal = { RAND Journal of Economics },
-  pages = { 172--87 },
-  year = { 1990 }
-}
-
-@misc{turner05,
-  author = { Turner, John L. }, 
-  title = { In Defense of the Patent Friendly Court Hypothesis:
-                  Theory and Evidence },
-  url = { http://www.terry.uga.edu/~jlturner/PatentFCH.pdf },
-  year = { 2005 }
-}
-
-@article{varian04,
-  author = { Varian, Hal R. }, 
-  title = { Patent Protection Gone Awry }, 
-  journal = { New York Times, Economic Scene },
-  year = { October 21, 2004 }
-}
-
-@article{wagner05,
-  author = { Wagner, R. Polk and Gideon Parchomovsky }, 
-  title = { Patent Portfolios }, 
-  volume = { 154 },
-  journal = { University of Pennsylvania Law Review },
-  year = { 2005 }
-}
-
-@article{watts98,
-  author = { Watts, Duncan J. and Steven H. Strogatz }, 
-  title = { Collective dynamics of small world networks }, 
-  volume = { 393 },
-  journal = { Nature },
-  pages = { 440--442 },
-  year =  { 1998 }
-}
-
-@book{watts02,
-  author = { Watts, Duncan J. }, 
-  title = { Six Degrees: The Science of a Connected Age }, 
-  publisher = { W.W. Norton \& Co. },
-  year = { 2002 }
-}
-
-@book{wille02,
-  author = { Wille, Luc T. }, 
-  title = { New Directions in Statistical Physics: Econophysics,
-                  Bioinformatics, and Pattern Recognition }, 
-  publisher = { Springer },
-  year = { 2002 }
-}
-
-@article{wu04,
-  author = { Wu, Fang and Bernardo A. Huberman }, 
-  title = { Finding Communities in Linear Time: A Physics Approach },  
-  volume = { 38 },
-  journal = { European Physics Journal B },
-  pages = { 331--338 },
-  year = { 2004 }
-}
-
-@article{zhou03,
-  author = { Zhou, Haijun }, 
-  title = { Distance, Dissimilarity Index, and Network Community
-                  Structure }, 
-  volume = { 67 },
-  journal = { Physical Review E },
-  pages = { 061901 },
-  year = { 2003 }
-}
-
-@incollection{ziedonis04,
-  author = { Ziedonis, Arvids and Bhaven N. Sampat }, 
-  title = { Patent Citations and the Economic Value of Patents: A
-                  Preliminary Assessment },
-  booktitle = { Handbook of Quantitative Science and Technology
-                  Research }, 
-  editor = { Henk Moed and Wolfgang Gl\"anzel and Ulrich Schmoch }, 
-  publisher = { Kluwer Academic Publishers }, 
-  year = { 2004 }
-}
-
-@Article{zalanyi03,
-  author = { Zal\'anyi, L\'aszl\'o and Cs\'ardi, G\'abor and Kiss, Tam\'as 
-             and Lengyel, M\'at\'e and Warner, Rebecca and 
-             Tobochnik, Jan and \'Erdi, P\'eter },
-  title = { Properties of a random attachment growing network },
-  journal = { Physical Review E },
-  volume = { 68 }, 
-  pages = { 066104 },
-  year = { 2003 }
-}
-
-@Article{podolny95,
-  author = { J. M. Podolny and T. E. Stuart },
-  title = {  A Role-Based Ecology of Technological Change },
-  journal = { American Journal of Sociology },
-  volume = { 100 },
-  pages = { 1224 },
-  year = { 1995 }
-}
-
-@Article{wartburg05,
-  author = { I. von Wartburg and T. Teichert and K. Rost },
-  title = { Inventive progress measured by multi-stage patent citation analysis  },
-  journal = { Research Policy },
-  volume = { 34 },
-  pages = { 1591 },
-  year = { 2005 }
-}
-
-@Article{kossinets06,
-  author = { Gueorgi Kossinets and Duncan J. Watts },
-  title = {  Empirical Analysis of an Evolving Social Network },
-  journal = { Science },
-  volume = { 311 },
-  pages = { 88--90 },
-  year = { 2006 }
-}
-
-@Article{krapivsky01,
-  author = { P. L. Krapivsky and S. Redner },
-  title = { Organization of Growing Random Networks },
-  journal = { Phyisical Review E },
-  volume = { 63 },
-  pages = { 066123 },
-  year = { 2001 }
-}
-
-@Article{boccaletti06,
-  author = { S. Boccaletti and V. Latora and Y. Moreno and M. Chavez and
-             D.-U. Hwang },
-  title = { Complex networks: Structure and dynamics },
-  journal = { Physics Reports },
-  volume = { 424 },
-  year = { 2006 },
-  pages = { 175--308 }
-}
-
-@Article{watts04,
-  author = { D. J. Watts },
-  title = { The ``new'' science of networks },
-  journal = { Annual Review of Sociology }, 
-  volume = { 30 }, 
-  pages = { 243--270},
-  year = { 2004 }
-}
-
-@Article{caldarelli02,
-  author = { G. Caldarelli and A. Capocci and P.D.L. Rios and M.A. Mu{\~n}oz },
-  title = { Scale-Free Networks from Varying Vertex Intrinsic Fitness },
-  journal = { Physical Review Letters },
-  volume = { 89 }, 
-  pages = { 258702 },
-  year = { 2002 }
-}
-
-@Misc{roth05,
-  title = { Measuring Generalized Preferential Attachment in 
-            Dynamic Social Networks },
-  author = { Camille Roth },
-  howpublished = { arxiv:nlin.AO/0507021 },
-  year = { 2005 }
-}
-
-@Article{ergun02,
-  title = { Growing Random Networks with Fitness },
-  author = { G. Ergun and  G. J. Rodgers },
-  journal = { Physica A },
-  volume = { 303 },
-  year = { 2002 },
-  pages = { 261--272 }
-}
-
-@Article{bianconi01,
-  author = { Bianconi G. and Barab\'asi, A.-L. },
-  title = { Competition and multiscaling in evolving networks },
-  journal = { Europhysics Letters },
-  volume = { 54 }, 
-  pages = { 436--442 },
-  year = { 2001 }
-}
-
-@Article{barabasi04,
-  author = { Albert-L\'aszl\'o Barab\'asi and Zolt\'an N. Oltvai },
-  title = { Network Biology: Understanding the Cells's Functional 
-            Organization },
-  journal = { Nature Reviews Genetics },
-  volume = { 5 }, 
-  pages = { 101--113 },
-  year = { 2004 }
-}
-
-@InProceedings{kleinberg99,
-  author = { Kleinberg, J. M. and Kumar S. R. and Raghavan, P. 
-             and Rajagopalan, S. and Tomkins, A. },
-  title = { The Web as a graph: Measurements, models and methods },
-  booktitle = { Proceedings of the International Conference on
-                  Combinatorics and Computing, no. 1627 in Lecture
-                  Notes in Computer Science },
-  publisher = { Springer }, 
-  year = { 1999 }
-}
-
-@InProceedings{berger04,
-  title = { Competition-Induced Preferential Attachment },
-  author = { N. Berger and C. Borgs and J. T. Chayes and R. M. D'Souza
-                  and R. D. Kleinberg },
-  booktitle = { Proceedings of the 31st International Colloquium on
-                  Automata, Languages and Programming }, 
-  pages = { 208--221 },
-  year = { 2004 }
-}
-
-@Misc{csardi05,
-  title = { Modeling innovation by a kinetic description of the patent
-            citation system },
-  author = { G\'abor Cs\'ardi and Katherine J Strandburg and
-               L\'aszl\'o Zal\'anyi and Jan Tobochnik and P\'eter
-               \'Erdi },
-  howpublished = { physics/0508132 },
-  url = { http://arxiv.org/abs/physics/0508132 },
-  year = { 2005 }
-}
-
-@Inproceedings{csardi06,
-  title = { Dynamics of citation networks },
-  author = { G\'abor Cs\'ardi },
-  booktitle = { Proceedings of the Artificial Conference on Artificial
-                  Neural Networks },
-  page = { to appear },
-  year = { 2006 }
-}
-
-@Article{belisle92,
-  author = { Belisle, C. J. P. },
-  year = { 1992 },
-  title = { Convergence theorems for a class of
-     simulated annealing algorithms on Rd },
-  journal = { Journal of  Applied Probability },
-  volume = { 29 }, 
-  pages = { 885--895 }
-}
-
-@Article{byrd95,
-  author = { Byrd, R. H. and Lu, P. and Nocedal, J. and Zhu, C. },
-  year = { 1995 },
-  title = { A limited memory algorithm for bound constrained
-                  optimization },
-  journal = { SIAM Journal of Scientific Computing }, 
-  volume = { 16 }, 
-  pages = { 1190--1208 }
-}
-
-@Article{fletcher64,
-  author = { Fletcher, R. and Reeves, C. M. },
-  year = { 1964 },
-  title = { Function minimization by conjugate gradients },
-  journal = { Computer Journal},
-  volume = { 7 }, 
-  pages = { 148--154 }
-}
-
-@Book{nash90,
-  author = { Nash, J. C. },
-  year = { 1990 },
-  title = { Compact Numerical Methods for Computers,
-     Linear Algebra and Function Minimisation },
-  publisher = { Adam Hilger }
-}
-
-@Article{nelder65,
-  author = { Nelder, J. A. and Mead, R. },
-  year = { 1965 },
-  title = { A simplex algorithm for function minimization },
-  journal = { Computer Journal },
-  volume = { 7 }, 
-  pages = { 308--313 }
-}
-
-@Book{read98,
-  author =          { Read, Ronald C. and Wilson, Robin J. },
-  title =           { An Atlas of Graphs },
-  publisher =       { Oxford University Press },
-  year =            { 1998 }
-}
-
-
-@Article{newman06,
-  author = { M. E. J. Newman },
-  title = { Modularity and community structure in networks }, 
-  journal = {Proc. Natl. Acad. Sci. USA },
-  volume = { { in press } },
-  year = { 2006 }
-}
-
-@Article{dijkstra59,
-  author = { E. W. Dijkstra },
-  title = { A note on two problems in connexion with graphs },
-  journal = { Numerische Mathematik },
-  volume = { 1 },
-  year = { 1959 },
-  pages = { 269--271 }
-}
-
-@Article{erdos59,
-  author = { {Erd\H{o}s}, P. and R\'enyi, A. },
-  title = { On random graphs }, 
-  journal = { Publicationes Mathematicae },
-  volume = { 6 }, 
-  pages = { 290--297 },
-  year = { 195 }
-}
-
-@Article{newman01,
-  title = { Random graphs with arbitrary degree distributions and
-                  their applications }, 
-  author = { M. E. J. Newman and S. H. Strogatz 
-                  and D. J. Watts }, 
-  journal = { Phys. Rev. E },
-  volume = { 64 }, 
-  pages = { 026118 },
-  year = { 2001 }
-}
-
-@Article{callaway01,
-  title = { Are randomly grown graphs really random? },
-  author = { D. S. Callaway and J. E. Hopcroft and J. M. Kleinberg,
-                  M. E. J. Newman and S. H. Strogatz }, 
-  journal = { Phys. Rev. E },
-  volume = { 64 }, 
-  pages = { 041902 },
-  year = { 2001 }
-}
-
-@Article{freeman79,
-  author = { Freeman, L.C. },
-  year = { 1979 },
-  title = { Centrality in Social Networks {I}:
-     Conceptual Clarification },
-  journal = { Social Networks }, 
-  volume = { 1 }, 
-  pages = { 215--239 }
-}
-
-@Inproceedings{wernicke05,
-  author = { S. Wernicke },
-  title = {A faster algorithm for detecting network motifs },
-  booktitle = { Proceedings of the 5th Workshop on Algorithms in
-                  Bioinformatics (WABI '05) },
-  publisher = { Springer-Verlag }, 
-  year = { 2005 }
-}
-
-@Article {wernicke06,
-  author = { S. Wernicke and F. Rasche },
-  title = { {FANMOD}: a tool for fast network motif detection },
-  journal = { Bioinformatics }, 
-  volume = { 22 },
-  number = { 9 },
-  pages = { 1152--1153 }, 
-  year = { 2006 }
-}
-
-@book{nooy05,
-  author = { W. de Nooy and A. Mrvar and V. Batagelj },
-  title = { Exploratory Social Network Analysis with Pajek }, 
-  publisher = { Cambridge University Press }, 
-  year = { 2005 }
-}
-
-@Inproceedings{brandes01,
-  author = { U. Brandes and M. Eiglsperger and I. Herman and
-                  M. Himsolt and M.S. Marshall },
-  title = { GraphML Progress Report: Structural Layer Proposal },
-  booktitle = { Proc. 9th Intl. Symp. Graph Drawing (GD '01) }, 
-  pages = { 501--512 }
-}
-
-@Article{fruchterman91,
-  author = { T. M. J. Fruchterman and E. M. Reingold },
-  title = { Graph drawing by force-directed placement },
-  journal = { Software -- Practice and Experience }, 
-  volume = { 21 }, 
-  pages = { 1129--1164 }, 
-  year = { 1991 }
-}
-
-@Article{kamada89,
-  author = { Kamada, T. and Kawai, S.},
-  year = { 1989 },
-  title = { An Algorithm for Drawing General Undirected Graphs },
-  journal = { Information Processing Letters },
-  volume = { 31 },
-  number = { 1 },
-  pages = { 7--15 }
-}
-
-@Article{adai04,
-  author = { Adai A T and Date S V and Wieland S and Marcotte E M },
-  title = { {LGL:} creating a map of protein function with an
-                  algorithm for visualizing very large biological
-                  networks },
-  journal = { J Mol Biol },
-  year = { 2004 },
-  volume = { 340 },
-  pages = { 179--90 }
-}
-
-@Article{reingold81,
-  author = { E. Reingold and J. Tilford },
-  title = { Tidier drawing of trees },
-  journal = { {IEEE} Transactions on Software Engineering }, 
-  volume = { 7 },
-  pages = { 223--228 }, 
-  year = { 1981 }
-}
-
-@Article{zachary77,
-  author = { W. W. Zachary }, 
-  title = { An information flow model for conflict
-     and fission in small groups },
-  journal = { Journal of Anthropological Research },
-  volume = { 33 }, 
-  pages = { 452-­473 },
-  year = { 1977 }
-}
diff -Nru igraph-0.6.5~quantal1/doc/pmt.xml igraph-0.6.5/doc/pmt.xml
--- igraph-0.6.5~quantal1/doc/pmt.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/pmt.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-PMT">
-<title>About template types</title>
-<para>
-Some of the container types listed in this section are defined for
-many base types. This is similar to templates in C++ and generics in
-Ada, but it is implemented via precompiler macros since the C language
-cannot handle it. Here is the list of template types and the all base
-types they currently support:
-<glosslist>
-
-<glossentry><glossterm>vector</glossterm><glossdef><para>
-  Vector is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char),
-  <type>igraph_bool_t</type> (bool). The default is
-  <type>igraph_real_t</type>.
-</para></glossdef></glossentry>
-
-<glossentry><glossterm>matrix</glossterm><glossdef><para>
-  Matrix is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char),
-  <type>igraph_bool_t</type> (bool). The default is
-  <type>igraph_real_t</type>.
-</para></glossdef></glossentry>
-
-<glossentry><glossterm>array3</glossterm><glossdef><para>
-  Array3 is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char),
-  <type>igraph_bool_t</type> (bool). The default is
-  <type>igraph_real_t</type>.
-</para></glossdef></glossentry>
-
-<glossentry><glossterm>stack</glossterm><glossdef><para>
-  Stack is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char),
-  <type>igraph_bool_t</type> (bool). The default is
-  <type>igraph_real_t</type>.
-</para></glossdef></glossentry>
-
-<glossentry><glossterm>double-ended queue</glossterm><glossdef><para>
-  Dqueue is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char),
-  <type>igraph_bool_t</type> (bool). The default is
-  <type>igraph_real_t</type>.
-</para></glossdef></glossentry>
-
-<glossentry><glossterm>heap</glossterm><glossdef><para>
-  Heap is currently defined for <type>igraph_real_t</type>,
-  <type>long int</type> (long), <type>char</type> (char).
-  In addition both maximum and minimum heaps are available.
-  The default is the <type>igraph_real_t</type> maximum heap.
-</para></glossdef></glossentry>
-</glosslist>
-</para>
-
-<para>
-The name of the base element (in parens) is added to the function
-names, except for te default type.
-</para>
-
-<para>
-Some examples: 
-<itemizedlist>
-
-<listitem><para>
-  <type>igraph_vector_t</type> is a vector of
-  <type>igraph_real_t</type> elements. Its functions are
-  <function>igraph_vector_init</function>,
-  <function>igraph_vector_destroy</function>,
-  <function>igraph_vector_sort</function>, etc.
-</para></listitem>
-
-<listitem><para>
-  <type>igraph_vector_bool_t</type> is a vector of
-  <type>igraph_bool_t</type> elements, initialize it with
-  <function>igraph_vector_bool_init</function>, destroy it with
-  <function>igraph_vector_bool_destroy</function>, etc.
-</para></listitem>
-
-<listitem><para>
-  <type>igraph_heap_t</type> is a maximum heap with
-  <type>igraph_real_t</type> elements. The corresponding functions are
-  <function>igraph_heap_init</function>,
-  <function>igraph_heap_pop</function>, etc.
-</para></listitem>
-
-<listitem><para>
-  <type>igraph_heap_min_t</type> is a minimum heap with
-  <type>igraph_real_t</type> elements. The corresponding functions are
-  called <function>igraph_heap_min_init</function>,
-  <function>igraph_heap_min_pop</function>, etc. 
-</para></listitem>
-
-<listitem><para>
-  <type>igraph_heap_long_t</type> is a maximum heap with <type>long
-  int</type> elements. Its function have the
-  <function>igraph_heap_long_</function> prefix.
-</para></listitem>
-
-<listitem><para>
-  <type>igraph_heap_min_long_t</type> is a minimum heap containing
-  <type>long int</type> elements. Its functions have the 
-  <function>igraph_heap_min_long_</function> prefix.
-</para></listitem>
-
-</itemizedlist>
-</para>
-
-<para>
-Note that the <link linkend="VECTOR">VECTOR</link> and the <link
-linkend="MATRIX">MATRIX</link> macros can be used on <emphasis>all</emphasis>
-vector and matrix types. 
-</para>
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/Makefile igraph-0.6.5/doc/presentations/iccs06/Makefile
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-SOURCE = iccs06
-
-all: $(SOURCE).pdf
-
-FIGTEX = ~/bin/figtex
-
-FIG = $(wildcard *.fig images/*.fig)
-EPS = $(patsubst %.fig, %.eps, $(FIG)) 
-EPST = $(patsubst %.fig, %.eps_t, $(FIG))
-ALLEPS = $(EPS) 
-INCLUDES = $(wildcard *.R)
-
-$(SOURCE).pdf: $(SOURCE).tex $(ALLEPS) $(EPST) $(INCLUDES)
-	latex $(SOURCE) && latex $(SOURCE) && \
-	dvips -o $(SOURCE).ps -t landscape $(SOURCE).dvi && \
-	gs -q -dSAFER -dNOPAUSE -dBATCH -sDEVICE=pdfwrite \
-      	-sOutputFile=$(SOURCE).pdf -dCompatibilityLevel=1.3 \
-        -dAutoRotatePages=/None \
-	-dPDFSETTINGS=/screen \
-	$(SOURCE).ps
-
-# Figures
-
-%.eps : %.fig
-	$(FIGTEX) $<
-
-clean: 
-	rm -f $(SOURCE){.aux,.bbl,.blg,.dvi,.log,.out,.pdf,.ps,.toc}\
-	$(EPS) $(EPST)
-
-.PHONY: clean
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/arch.fig igraph-0.6.5/doc/presentations/iccs06/arch.fig
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/arch.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/arch.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-0 32 #eaeaea
-2 4 0 1 0 10 50 -1 20 0.000 0 0 7 0 0 5
-	 9600 4755 8340 4755 8340 3300 9600 3300 9600 4755
-2 4 0 1 0 11 50 -1 20 0.000 0 0 7 0 0 5
-	 5310 4755 3015 4755 3015 3300 5310 3300 5310 4755
-2 4 0 1 0 3 50 -1 20 0.000 0 0 7 0 0 5
-	 7950 4755 5655 4755 5655 3300 7950 3300 7950 4755
-2 4 0 1 0 29 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 6630 3015 6630 3015 5145 9630 5145 9630 6630
-2 4 0 1 0 32 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 8550 3015 8550 3015 7065 9630 7065 9630 8550
-4 1 0 50 -1 18 28 0.0000 4 60 405 8955 4125 ...\001
-4 1 0 50 -1 18 28 0.0000 4 465 1590 6765 4125 Python\001
-4 1 0 50 -1 18 28 0.0000 4 465 6075 6345 6015 Graph operations (C library)\001
-4 1 0 50 -1 18 28 0.0000 4 465 7305 6345 7995 Basic graph operations (C library)\001
-4 1 24 50 -1 18 28 0.0000 4 360 1500 4170 4125 GNU R\001
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/demo1.R igraph-0.6.5/doc/presentations/iccs06/demo1.R
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/demo1.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/demo1.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-library(igraph)
-g <- \emph{read.graph}("http://localhost/~csardi/karate.net", format="pajek")
-
-community.newman <- function(g) \{
-  deg <- \emph{degree}(g) ; ec <- \emph{ecount}(g)
-  B <- \emph{get.adjacency}(g) - outer(deg, deg, function(x,y) x*y / 2 / ec)
-  diag(B) <- 0
-  Re(eigen(B)$vectors[,1])
-\}
-mem <- community.newman(g)
-\emph{V(g)$color} <- ifelse(mem < 0, "grey", "green")
-
-scale <- function(v, a, b) \{ v <- v-min(v) ; v <- v/max(v) ; v <- v * (b-a) ; v+a \}
-\emph{V(g)$size} <- scale(abs(mem), 15, 25)
-\emph{E(g)$color} <- "grey"
-\emph{E(g)[ V(g)[ color=="grey" ] %--% V(g)[ color=="green" ] ]$color} <- "red"
-\emph{tkplot}(g, layout=layout.kamada.kawai, vertex.color="a:color",
-       vertex.size="a:size", edge.color="a:color")
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/demo2.R igraph-0.6.5/doc/presentations/iccs06/demo2.R
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/demo2.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/demo2.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-library(igraph)
-
-exps <- seq(0.5, 1.5, length=16)
-
-par(mar=c(2,2,2,2))
-layout( matrix(1:16, nr=4, byrow=TRUE))
-layout.show(16)
-
-maxdeg <- numeric()
-for (ex in exps) \{
-  g <- \emph{barabasi.game}(100000, power=ex)
-  maxdeg <- c(maxdeg, max(\emph{degree}(g, mode="in")))  
-  plot(\emph{degree.distribution}(g, mode="in"), log="xy", xlab=NA, ylab=NA)
-\}
-
-x11()
-plot(exps, maxdeg, type="b")
-
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/demo3.R igraph-0.6.5/doc/presentations/iccs06/demo3.R
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/demo3.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/demo3.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-library(igraph)
-g <- \emph{erdos.renyi.game}(5000, 0.8/5000)
-
-cl <- \emph{clusters}(g)
-large <- which(cl$csize > 3)-1
-g2 <- \emph{subgraph}(g, which(cl$membership %in% large)-1)
-
-graphs <- \emph{decompose.graph}(g2)
-layouts <- lapply(graphs, \emph{layout.kamada.kawai})
-coords <- \emph{layout.merge}(graphs, layouts)
-g3 <- \emph{graph.disjoint.union}(graphs)
-
-cl3 <- \emph{clusters}(g3)
-cl.no <- length(cl3$csize)
-colorbar <- heat.colors(cl.no)
-\emph{V(g3)$color} <- colorbar[cl3$membership+1]
-
-\emph{plot}(g3, layout=coords, vertex.size=1, labels=NA, vertex.color="a:color")
diff -Nru igraph-0.6.5~quantal1/doc/presentations/iccs06/iccs06.tex igraph-0.6.5/doc/presentations/iccs06/iccs06.tex
--- igraph-0.6.5~quantal1/doc/presentations/iccs06/iccs06.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/iccs06/iccs06.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,182 +0,0 @@
-\documentclass[landscape]{foils}
-
-\usepackage{ae}
-\usepackage{hyperref}
-\usepackage{thumbpdf}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage[left=0cm,right=1cm,top=2cm,bottom=2cm]{geometry}
-\usepackage[display]{texpower}
-\usepackage{psfrag}
-\usepackage{ragged2e}
-\usepackage{amstext}
-\usepackage{xspace}
-\usepackage{fancyvrb}
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}%
-  \input #2.eps_t%
-  \includegraphics[width=#1]{#2.eps}%
-  \end{psfrags}%
-}
-
-\newcommand{\stitle}[1]{{\color{yellow}\centering\Large #1\par\vspace*{10pt}\hrule}}
-
-\setlength{\columnsep}{0.5cm}
-\setlength{\columnseprule}{0.4pt}
-
-\renewcommand{\emph}[1]{\textcolor{yellow}{\bf #1}}
-
-\newcommand{\igraph}{\texttt{\emph{igraph}}\xspace}
-
-\begin{document}
-
-\RaggedRight
-\color{white}
-\pagecolor{black}
-\fvset{fontsize=\small}
-\fvset{commandchars=\\\{\}}
-\definecolor{grey}{gray}{0.75}
-\fvset{frame=single, numbers=left, rulecolor=\color{grey}}
-
-\MyLogo{\color{grey}The \igraph library for complex network research -- NECSI ICCS 2006}
-
-\thispagestyle{empty}
-\vspace*{1cm}
-{\centering
-\hrule
-\Large
-\vspace*{1cm}
-{\bf The \igraph library for complex network research}
-\vspace*{1cm}
-\par
-\hrule
-\par
-\vspace*{2cm}
-\normalsize G\'abor Cs\'ardi\\
-\small \verb+csardi@rmki.kfki.hu+
-\par
-\vspace*{1cm}
-\normalsize Tam\'as Nepusz\\
-\small \verb+ntamas@rmki.kfki.hu+
-\par
-\vspace*{1.5cm}
-Center for Complex Systems Studies, Kalamazoo College, Kalamazoo, MI, and\\
-Department of Biophysics, 
-KFKI Research Institute for Nuclear and Particle Physics of the
-Hungarian Academy of Sciences\\
-}
-
-\newpage
-\stitle{Why???}\pause
-
-\begin{center}
-Because every existing software package lacked something.
-\end{center}\pause
-
-\vfill
-\stitle{Being open}
-
-\begin{center}
-The most important feature.
-\end{center}
-\vfill
-
-\newpage
-\stitle{Design goals}
-
-\begin{itemize}
-\item Handling \emph{large} data sets time- and
-  space-efficiently. Millions of vertices and/or edges. All basic
-  operations are linear in time and space. \pause
-\item Open: (1) open source (2) \emph{extendable} and (3) \emph{embeddable}. \pause
-\item \emph{Interactive} and \emph{non-interactive}. \pause
-\item Supporting \emph{rapid development}. \pause
-\end{itemize}
-
-\stitle{Additional Features (side effects)} 
-
-\begin{itemize}
-\item \emph{Portable} (both the C layer and the and Python
-  layers). \pause
-\item Well \emph{documented}. The time complexity of every operation is
-  defined. See homepage for documentation.
-\end{itemize}
-
-\newpage
-\stitle{The \igraph architecture}
-\begin{center}
-\color{black}
-\figfigure{.7\textwidth}{arch}
-\end{center}
-
-\newpage
-\stitle{Functionality}
-
-\begin{itemize}
-\item Handles directed and undirected graphs with possibly multiple
-  edges and self-loops. No hypergraphs. \pause
-\item Graph generation: various regular and random graphs. Efficient
-  algorithms for large random graphs. \pause
-\item Random graphs with a given degree sequence, rewiring of graphs.\pause
-\item Path length properties, centrality measures. Page-rank
-  algorithm. \pause
-\item Graph components, weakly or strongly connected, minimum spanning
-  tree. \pause
-\item Vertex and edge sets/sequences, high level interfaces support
-  graph, vertex and edge attributes. An attribute can be an arbitrary
-  object. Vertex and edge selection based on attributes. 
-\end{itemize}
-
-\newpage
-\stitle{Functionality (contd.)}
-\begin{itemize}
-\item File formats. Some simple file formats and also Pajek (import
-  only) and GraphML. (Basic support right now.) \pause
-\item Graph layouts, regular and force-based layouts in 2D and 3D. \pause
-\item High level interfaces support graph visualization in 2D. 
-  (interactive and non-interactive, many file formats to export: EPS,
-  PDF, SVG, JPG, PNG, FIG, etc.) or 3D
-  (with R). \pause
-\item Graph operators: graph intersection, union, composition. \pause
-\item Graph motifs: an implementation of the fast RAND-ESU algorithm.
-\end{itemize}
-
-\newpage
-\stitle{Demo 1: Nonlinear Preferential Attachment}
-\VerbatimInput{demo2.R}
-
-\newpage
-\stitle{Demo 2: Community Structure Detection Algorithm}
-\VerbatimInput{demo1.R}
-
-\newpage
-\stitle{Demo 3: Clusters in a Random Graph}
-\VerbatimInput{demo3.R}
-
-\newpage
-\stitle{Where to get it}
-
-\emph{Home page:}\\
-\url{http://cneurocvs.rmki.kfki.hu/igraph}
-\vfill
-
-\emph{Mailing lists:}\\
-\url{http://lists.nongnu.org/mailman/listinfo/igraph-help}\\
-\url{http://lists.nongnu.org/mailman/listinfo/igraph-announce}\\
-\url{http://www.r-project.org/mail.html}
-\vfill
-
-\emph{On SourceForge:}\\
-\url{http://www.sourceforge.net/projects/igraph}
-\vfill
-
-\emph{On Savannah:}\\
-\url{http://savannah.nongnu.org/projects/igraph}
-\vfill
-
-\emph{Source code:}\\
-\url{http://arch.sv.nongnu.org/archives/igraph}
-\vfill
-
-\end{document}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/BME.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/BME.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/CCSS.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/CCSS.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/infovis07/Makefile igraph-0.6.5/doc/presentations/infovis07/Makefile
--- igraph-0.6.5~quantal1/doc/presentations/infovis07/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/infovis07/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-
-all: ps 
-
-ps: infovis07-igraph.ps
-
-pdf: infovis07-igraph.pdf 
-
-infovis07-igraph.ps: infovis07-igraph.dvi
-	dvips -t a3 infovis07-igraph.dvi -o infovis07-igraph.ps
-
-infovis07-igraph.pdf: infovis07-igraph.ps
-	ps2pdf infovis07-igraph.ps
-
-IMAGES=karate3d.eps screenshots.eps arch.eps arch.eps_t RMKI-BME.eps CCSS.eps
-
-karate3d.eps: karate3d.png
-	convert karate3d.png karate3d.eps
-
-screenshots.eps: screenshots.svg.gz degreedist.png clustering.png diameter.png \
-	diameter2.png tkplot.png
-	gzip -dc screenshots.svg.gz >screenshots.svg && \
-	inkscape -E screenshots.eps -B screenshots.svg
-
-arch.eps arch.eps_t: arch.svg.gz
-	gzip -dc arch.svg.gz >arch.svg && \
-	svgtex arch.svg
-
-RMKI-BME.eps: RMKI-BME.svg.gz
-	gzip -dc RMKI-BME.svg.gz >RMKI-BME.svg && \
-	inkscape -E RMKI-BME.eps -B RMKI-BME.svg
-
-CCSS.eps: CCSS.svg.gz
-	gzip -dc CCSS.svg.gz >CCSS.svg && \
-	inkscape -E CCSS.eps -B CCSS.svg
-
-infovis07-igraph.dvi: infovis07-igraph.tex $(IMAGES)
-	latex infovis07-igraph.tex
-
-clean:
-	rm -f karate3d.eps screenshots.eps arch.eps arch.eps_t \
-	RMKI-BME.eps CCSS.eps infovis07-igraph.pdf infovis07-igraph.ps \
-	infovis07-igraph.aux infovis07-igraph.dvi infovis07-igraph.log \
-	screenshots.svg arch.svg RMKI-BME.svg CCSS.svg
-
-
-.PHONY: all ps pdf clean
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/RMKI-BME.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/RMKI-BME.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/RMKI.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/RMKI.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/arch.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/arch.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/clustering.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/clustering.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/degreedist.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/degreedist.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/dendrogram.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/dendrogram.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/diameter.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/diameter.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/diameter2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/diameter2.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/infovis07/infovis07-igraph.tex igraph-0.6.5/doc/presentations/infovis07/infovis07-igraph.tex
--- igraph-0.6.5~quantal1/doc/presentations/infovis07/infovis07-igraph.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/infovis07/infovis07-igraph.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,128 +0,0 @@
-\documentclass[a3]{sciposter}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage{multicol}
-\usepackage{url}
-\usepackage{ragged2e}
-\usepackage{psfrag}
-\usepackage{watermark}
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}
-  \input #2.eps_t
-  \includegraphics[width=#1]{#2}
-  \end{psfrags}
-}
-
-\setlength{\columnsep}{10pt}
-
-\title{\vspace*{-0.7cm}
-  The \textcolor{red}{igraph} library for network analysis}
-\author{\vspace*{-0.5cm}
-  \normalsize G\'abor Cs\'ardi$^{1,2}$ and 
-  Tam\'as Nepusz$^{1,3}$}
-\institute{\small\mbox{}$^1$Department of Biophysics, 
-  Research Institute for Particle and Nuclear Physics \\
-  of the Hungarian Academy of Sciences,
-  Budapest, Hungary. \\
-  \mbox{}$^2$Center for Complex Systems Studies, Kalamazoo College,
-  Kalamazoo, MI, USA. \\
-  \mbox{}$^3$Dept. of Measurement and Information Systems, Budapest
-  University of Technology and Economics, Budapest, Hungary.
-}
-% \email{\small csardi@rmki.kfki.hu \& ntamas@rmki.kfki.hu}
-\leftlogo{RMKI-BME}
-\rightlogo{CCSS}
-
-\setlength{\parskip}{5pt}
-
-\begin{document}
-
-\watermark{\includegraphics[angle=-90,width=\textwidth]{karate3d}}
-
-\vspace*{-0.8cm}
-{\small
-\maketitle
-}
-
-\enlargethispage{1cm}
-
-\vspace*{-0.7cm}
-\vfill
-\hrule
-\vfill
-\vspace*{-0.3cm}
-\begin{multicols}{3}
-
-\RaggedRight
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% \section{Goals}
-%% \begin{itemize}
-%% \item Ability to handle large graphs efficiently.
-%% \item Embeddable into higher level environments like GNU R or Python.
-%% \item Ability to be used for quick prototyping.
-%% \end{itemize}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\section{Features}
-
-\begin{itemize}
-\item Efficient implementation. The current state of the art
-  algorithms are implemented (if not that is considered as a bug).
-\item Portable C (and some C++) code, works on most platforms:
-  Linux flavours, MS Windows variations, Mac OSX, Solaris, etc.
-\item Wide variety of graph algorithms: random and regular graph
-  structures, centrality measures, shortest paths, 2D and 3D graph
-  layouts, graph motifs, cliques, network flows and cuts, community
-  structure detection, etc.
-\item Interfaces from GNU R and Python, other interfaces can be added
-  without too much hassle.
-\item Interactive and non-interactive, 2D and 3D
-  visualization from R and Python.
-\item Graph, vertex and edge attributes, like edge weights, vertex
-  colors and other parameters for plotting.
-\item Various import and export file formats: GraphML, Pajek, simple
-  edge list, etc.
-\item Well documented.
-\item Open source and completely free for non-commercial and
-  commercial use.
-\end{itemize}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\section{Where to get it?}
-\centerline{\bf \url{http://igraph.sf.net}}
-
-You can also find here the source code producing these screenshots.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\vfill\columnbreak
-\section{Architecture}
-
-Simple and flexible layered architecture.
-Modules interact via well-defined interfaces and 
-can be replaced individually without breaking other parts.
-
-\begin{center}
-\figfigure{\columnwidth}{arch}
-\end{center}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-%% \section{Examples and screenshots}
-
-\hrule
-\vfill
-\url{{csardi,ntamas}@rmki.kfki.hu}
-\end{multicols}
-
-\vfill
-\hrule
-\vfill
-
-\centerline{\includegraphics[width=\textwidth]{screenshots}}
-\vspace*{-0.3cm}
-\centerline{\small Information Visualization Software Infrastructures Workshop, Z\"urich, 2007}
-\vfill
-
-\end{document}
-
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/karate3d.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/karate3d.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/infovis07/plots.R igraph-0.6.5/doc/presentations/infovis07/plots.R
--- igraph-0.6.5~quantal1/doc/presentations/infovis07/plots.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/infovis07/plots.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,132 +0,0 @@
-
-R
-
-library(igraph)
-
-# KARATE network, we will need this
-
-karate <- graph( c( 0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
-                   0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
-                   0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
-                   0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
-                   1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
-                   2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
-                   2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
-                   4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
-                   6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
-                   13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
-                   18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
-                   22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
-                   23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
-                   25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
-                   28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
-                   31, 32, 31, 33, 32, 33), directed=FALSE)
-
-# DIAMETER OF THE KARATE CLUB
-
-g <- karate
-d <- get.diameter(g)
-E(g)$color <- "grey"
-E(g)$width <- 1
-E(g, path=d)$color <- "red"
-E(g, path=d)$width <- 2
-V(g)$label.color <- "blue"
-V(g)$color  <- "SkyBlue2"
-V(g)[ d ]$label.color <- "black"
-V(g)[ d ]$color <- "red"
-plot(g, layout=layout.fruchterman.reingold, 
-     vertex.label.dist=0, vertex.size=15)
-title(main="Diameter of the Zachary Karate Club network",
-      xlab="created by igraph 0.4")
-axis(1, labels=FALSE, tick=TRUE)
-axis(2, labels=FALSE, tick=TRUE)
-
-
-# DIAMETER OF A SCALE-FREE GRAPH
-
-g <- barabasi.game(100, directed=FALSE)
-d <- get.diameter(g)
-E(g)$color <- "SkyBlue2"
-E(g)$width <- 1
-E(g, path=d)$color <- "red"
-E(g, path=d)$width <- 2
-V(g)$label.color <- V(g)$color  <- "blue"
-V(g)[ d ]$label.color <- V(g)[ d ]$color <- "red"
-plot(g, layout=layout.fruchterman.reingold, 
-     vertex.label.dist=0.6, vertex.size=3)
-title(main="Diameter of a small scale-free random graph",
-      xlab="created by igraph 0.4")
-axis(1, labels=FALSE, tick=TRUE)
-axis(2, labels=FALSE, tick=TRUE)
-
-# TKPLOT, NEWMAN-CLUSTERED KARATE-CLUB
-
-g <- karate
-
-community.newman <- function(g) {
-  d <- degree(g)
-  B <- get.adjacency(g)-outer(d, d, function(x,y) x*y/2/ecount(g))
-  diag(B) <- 0
-  eigen(B)$vectors[,1]
-}
-
-mem <- community.newman(g)
-V(g)$color <- ifelse(mem < 0, "blue", "green")
-V(g)$size <- abs(mem) * 35
-E(g)$color <- "darkblue"
-E(g) [ V(g)[ color=="green" ] %--% V(g)[ color=="green" ] ]$color <- "darkolivegreen"
-E(g) [ V(g)[ color=="blue" ] %--% V(g)[ color=="green" ] ]$color <- "red"
-tkplot(g, layout=layout.fruchterman.reingold,
-       vertex.label.dist=1)
-
-# A 3D PLOT
-
-g <- karate
-l <- layout.kamada.kawai(g, dim=3)
-wt <- walktrap.community(g)
-mem <- community.to.membership(g, wt$merges, steps=30)$membership
-cb <- heat.colors(4)
-E(g)$color <- "black"
-for (i in 0:3) {
-  V(g)[mem==i]$color <- cb[i+1]
-  E(g)[ V(g)[mem==i] %--% V(g)[mem==i] ]$color <- cb[i+1]
-}
-
-open3d()
-rglplot(g, layout=l, vertex.label.dist=1)
-rgl.postscript("karate3d.eps")
-
-# DENDROGRAM, KARATE NETWORK
-
-g <- karate
-
-wt <- walktrap.community(g, modularity=TRUE)
-dend <- as.dendrogram(wt, use.modularity=TRUE)
-#xfig(file="dendrogram.fig")
-#CairoX11()
-#CairoPNG(file="dendrogram.png", width=500, height=500)
-plot(dend, nodePar=list(pch=c(NA, 20)))
-#dev.off()
-
-# SOME DEGREE DISTRIBUTIONS
-
-g <- barabasi.game(100000)
-d <- degree(g, mode="in")
-dd <- degree.distribution(g, mode="in", cumulative=TRUE)
-alpha <- power.law.fit(d, xmin=20)
-# CairoX11()
-# CairoPNG(file="degreedist.png", width=500, height=500)
-plot(dd, log="xy", xlab="degree", ylab="cumulative frequency",
-     col=1, main="Nonlinear preferential attachment")
-lines(10:500, 10*(10:500)^(-coef(alpha)+1))
-
-powers <- c(0.9, 0.8, 0.7, 0.6)
-for (p in seq(powers)) {
-  g <- barabasi.game(100000, power=powers[p])
-  dd <- degree.distribution(g, mode="in", cumulative=TRUE)
-  points(dd, col=p+1, pch=p+1)
-}
-
-legend(1, 1e-5, c(1,powers), col=1:5, pch=1:5, ncol=1, yjust=0, lty=0)
-
-       
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/python3d.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/python3d.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/screenshots.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/screenshots.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/infovis07/tkplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/infovis07/tkplot.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/largescale06/abstract.tex igraph-0.6.5/doc/presentations/largescale06/abstract.tex
--- igraph-0.6.5~quantal1/doc/presentations/largescale06/abstract.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/largescale06/abstract.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-\documentclass[12pt,letterpaper]{article}
-
-\usepackage{times}
-\usepackage{fullpage}
-
-\setlength{\parindent}{0pt}
-\setlength{\parskip}{10pt}
-
-\begin{document}
-\author{\bf G\'abor Cs\'ardi$^{1,2}$ and Tam\'as Nepusz$^{1,3}$}
-\title{\Large\bf The \texttt{igraph} software package for complex
-  network research} 
-\date{\bf\normalsize\texttt{\{csardi,ntamas\}@rmki.kfki.hu}\\[15pt]
-  $^1$ Department of Biophysics,\\ Research Institute for Nuclear and
-  Particle Phyisics \\ of the Hungarian Academy of Sciences, \\
-  29-33 Konkoly-Thege \'ut, Budapest 1121\\[10pt]
-  $^2$ Center for Complex Systems Studies, Kalamazoo College, \\
-  1200 Academy st, Kalamazoo, MI 49006 \\[10pt]
-  $^3$ Department of Measurement and Information Systems, \\ Budapest
-  University of Technology and Economics, \\
-  3-9 M\H{u}egyetem rkp, Budapest 1111
-}
-\maketitle
-
-\pagestyle{empty}\thispagestyle{empty}
-\enlargethispage{5cm}
-\centerline{\bf\large Abstract}
-
-\noindent 
-This presentation does not cover results of scientific research, but
-introduces a software package which gives handy tools into the hands
-of researchers doing network science. The authors strongly believe
-that the tools scientists use are important because they
-can increase productivity by several factors and thereby enhance
-scientific progress. 
-
-The \texttt{igraph} library was developed because of the lack of network
-analysis software which (1)~can handle large graphs efficiently,
-(2)~can be embedded into a higher level program or programming language
-(like Python, Perl or GNU R) and (3) can be used both interactively
-and non-interactively.
-
-The capability of handling large graphs was important because the
-authors were confronted with graphs with millions of vertices and edges. 
-
-Embedding \texttt{igraph} into Python or GNU R creates a very productive
-research environment, well suited for rapid development. All the
-expressing power of GNU R (or other higher level languange) is readily
-available in a convenient integrated environment for generating,
-manipulating and measuring graphs, and evaluating these measurements.
-
-Interactive means of software usage is nowadays considered as superior
-to non-interactive interfaces, which is very true for most
-cases. Dealing with large graphs can be different though -- if it takes
-three months to calculate the diameter of a graph, nobody wants that to
-be interactive.
-
-In this presentation we will show the key features of the
-\texttt{igraph} software package and various demonstration
-tasks involving generating, analyzing and visualizing large graphs.
-
-\vspace*{10pt}
-\noindent
-\textbf{Key Words:} network analysis software, large networks
-
-\end{document}
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci06/arch.fig igraph-0.6.5/doc/presentations/netsci06/arch.fig
--- igraph-0.6.5~quantal1/doc/presentations/netsci06/arch.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci06/arch.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-2 4 0 1 0 13 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 6630 3015 6630 3015 5145 9630 5145 9630 6630
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 5310 4755 3015 4755 3015 3300 5310 3300 5310 4755
-2 4 0 1 0 22 50 -1 20 0.000 0 0 7 0 0 5
-	 7950 4755 5655 4755 5655 3300 7950 3300 7950 4755
-2 4 0 1 0 21 50 -1 20 0.000 0 0 7 0 0 5
-	 9600 4755 8340 4755 8340 3300 9600 3300 9600 4755
-2 4 0 1 0 1 50 -1 20 0.000 0 0 7 0 0 5
-	 9630 8550 3015 8550 3015 7065 9630 7065 9630 8550
-4 1 6 50 -1 18 28 0.0000 4 465 1590 6765 4125 Python\001
-4 1 6 50 -1 18 28 0.0000 4 60 405 8955 4125 ...\001
-4 1 6 50 -1 18 28 0.0000 4 465 3780 6345 6015 Graph operations\001
-4 1 6 50 -1 18 28 0.0000 4 465 5010 6345 7995 Basic graph operations\001
-4 1 6 50 -1 18 28 0.0000 4 360 1500 4170 4125 GNU R\001
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci06/demo.R igraph-0.6.5/doc/presentations/netsci06/demo.R
--- igraph-0.6.5~quantal1/doc/presentations/netsci06/demo.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci06/demo.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,68 +0,0 @@
-
-########################## Start R
-R
-
-########################## Load igraph package
-library(igraph)
-
-########################## Get the network
-
-g <- graph(directed=FALSE,
-           c(0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8,
-           0,10, 0,11, 0,12, 0,13, 0,17, 0,19, 0,21, 0,31,
-           1, 2, 1, 3, 1, 7, 1,13, 1,17, 1,19, 1,21, 1,30,
-           2, 3, 2, 7, 2,27, 2,28, 2,32, 2, 9, 2, 8, 2,13,
-           3, 7, 3,12, 3,13, 4, 6, 4,10, 5, 6, 5,10, 5,16,
-           6,16, 8,32, 8,32, 8,33, 9,33,13,33,14,32,14,33,
-           15,32,15,33,18,32,18,33,19,33,20,32,20,33,
-           22,32,22,33,23,25,23,27,23,32,23,33,23,29,
-           24,25,24,27,24,31,25,31,26,29,26,33,27,33,
-           28,31,28,33,29,32,29,33,30,32,30,33,31,32,31,33,
-           32,33))
-
-g <- read.graph("http://localhost/~csardi/karate.net", format="pajek")
-
-######################### Implement Newman's algorithm
-
-community.newman <- function(g) {
-  A <- get.adjacency(g)
-  deg <- degree(g)
-  ec <- ecount(g)
-  P <- outer(deg, deg, function(x,y) x*y / 2 /ec )
-  B <- A - P
-  diag(B) <- 0
-
-  eigen(B)$vectors[,1]
-}
-
-######################## Run it on the Karate club data
-
-mem <- community.newman(g)
-
-V(g)$color <- ifelse(mem < 0, "grey", "green")
-
-plot(g, layout=layout.kamada.kawai, vertex.color="a:color")
-
-######################## Vertex sizes
-
-scale <- function(v, a, b) {
-  v <- v-min(v)
-  v <- v/max(v)
-  v <- v * (b-a)
-  v+a
-}
-
-V(g)$size <- scale(abs(mem), 15, 25)
-E(g)$color <- "grey"
-E(g)[ V(g)[color=="grey"] %--% V(g)[color=="green"] ]$color <- "red"
-
-tkplot(g, layout=layout.kamada.kawai, vertex.color="a:color",
-       vertex.size="a:size", edge.color="a:color")
-
-####################### A large graph
-
-g <- barabasi.game(10000, directed=FALSE)
-plot(degree.distribution(g), log="xy", type="b")
-coords <- layout.fruchterman.reingold.grid(g)
-plot(g, layout=coords, vertex.size=0, labels=NA)
-
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci06/grid1.fig igraph-0.6.5/doc/presentations/netsci06/grid1.fig
--- igraph-0.6.5~quantal1/doc/presentations/netsci06/grid1.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci06/grid1.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-6 1935 1260 2970 2520
-4 1 6 50 -1 0 24 0.0000 4 270 750 2452 1530 Data\001
-4 1 6 50 -1 0 24 0.0000 4 270 645 2452 2010 web\001
-4 1 6 50 -1 0 24 0.0000 4 195 975 2452 2490 server\001
--6
-6 5940 990 7830 1845
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 1845 5940 1845 5940 990 7830 990 7830 1845
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 1530 worker\001
--6
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 0 2
-	1 1 1.00 60.00 120.00
-	 5940 1350 3780 1350
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4230 4380 4230 4380 1620 5940 1620
-2 4 0 1 0 14 51 -1 20 0.000 0 0 7 0 0 5
-	 3780 5805 1170 5805 1170 3960 3780 3960 3780 5805
-2 4 0 1 0 1 51 -1 20 0.000 0 0 7 0 0 5
-	 3780 2835 1170 2835 1170 990 3780 990 3780 2835
-4 1 6 50 -1 0 24 0.0000 4 270 795 2437 4560 Task\001
-4 1 6 50 -1 0 24 0.0000 4 270 645 2437 5040 web\001
-4 1 6 50 -1 0 24 0.0000 4 195 975 2437 5520 server\001
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci06/grid2.fig igraph-0.6.5/doc/presentations/netsci06/grid2.fig
--- igraph-0.6.5~quantal1/doc/presentations/netsci06/grid2.fig	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci06/grid2.fig	1970-01-01 00:00:00.000000000 +0000
@@ -1,90 +0,0 @@
-#FIG 3.2  Produced by xfig version 3.2.5-alpha5
-Landscape
-Center
-Metric
-A4      
-100.00
-Single
--2
-1200 2
-6 1935 1260 2970 2520
-4 1 6 50 -1 0 24 0.0000 4 270 750 2452 1530 Data\001
-4 1 6 50 -1 0 24 0.0000 4 270 645 2452 2010 web\001
-4 1 6 50 -1 0 24 0.0000 4 195 975 2452 2490 server\001
--6
-6 5940 990 7830 1845
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 1845 5940 1845 5940 990 7830 990 7830 1845
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 1530 worker\001
--6
-6 3735 2430 5985 7515
-2 1 0 2 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4380 4455 4395 4440 2745 5940 2745
-2 1 0 2 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4545 4530 4545 4530 3990 5940 3990
-2 1 0 2 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4695 4380 4695 4380 5175 5940 5175
-2 1 0 2 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4800 4305 4800 4305 6315 5940 6315
-2 1 0 2 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4965 4200 4965 4200 7485 5940 7485
-2 1 1 2 0 7 50 -1 -1 6.000 0 0 -1 0 0 2
-	 5940 2460 5385 2460
-2 1 1 2 0 7 50 -1 -1 6.000 0 0 -1 0 0 2
-	 5940 3720 5385 3720
-2 1 1 2 0 7 50 -1 -1 6.000 0 0 -1 0 0 2
-	 5940 4905 5385 4905
-2 1 1 2 0 7 50 -1 -1 6.000 0 0 -1 0 0 2
-	 5940 6075 5385 6075
-2 1 1 2 0 7 50 -1 -1 6.000 0 0 -1 0 0 2
-	 5940 7230 5385 7230
--6
-6 5940 2250 7830 3105
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 3105 5940 3105 5940 2250 7830 2250 7830 3105
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 2790 worker\001
--6
-6 5940 3510 7830 4365
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 4365 5940 4365 5940 3510 7830 3510 7830 4365
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 4050 worker\001
--6
-6 5940 4680 7830 5535
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 5535 5940 5535 5940 4680 7830 4680 7830 5535
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 5220 worker\001
--6
-6 5940 5895 7830 6750
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 6750 5940 6750 5940 5895 7830 5895 7830 6750
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 6435 worker\001
--6
-6 5940 7065 7830 7920
-2 4 0 1 0 23 50 -1 20 0.000 0 0 7 0 0 5
-	 7830 7920 5940 7920 5940 7065 7830 7065 7830 7920
-4 1 6 50 -1 0 24 0.0000 4 270 1110 6885 7605 worker\001
--6
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 0 2
-	1 1 1.00 60.00 120.00
-	 5940 1350 3780 1350
-2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 1 1 4
-	1 1 1.00 60.00 120.00
-	1 1 1.00 60.00 120.00
-	 3780 4230 4380 4230 4380 1620 5940 1620
-2 4 0 1 0 14 51 -1 20 0.000 0 0 7 0 0 5
-	 3780 5805 1170 5805 1170 3960 3780 3960 3780 5805
-2 4 0 1 0 1 51 -1 20 0.000 0 0 7 0 0 5
-	 3780 2835 1170 2835 1170 990 3780 990 3780 2835
-4 1 6 50 -1 0 24 0.0000 4 270 795 2437 4560 Task\001
-4 1 6 50 -1 0 24 0.0000 4 270 645 2437 5040 web\001
-4 1 6 50 -1 0 24 0.0000 4 195 975 2437 5520 server\001
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci06/igraph-netsci06.tex igraph-0.6.5/doc/presentations/netsci06/igraph-netsci06.tex
--- igraph-0.6.5~quantal1/doc/presentations/netsci06/igraph-netsci06.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci06/igraph-netsci06.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-\documentclass[landscape,20pt]{foils}
-
-\usepackage{ae}
-\usepackage{hyperref}
-\usepackage{thumbpdf}
-\usepackage[margin=2cm]{geometry}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage{multicol}
-\usepackage[document]{ragged2e}
-\usepackage{pause}
-\usepackage{amstext}
-\usepackage{amsmath}
-
-\newcommand{\tit}[1]{{\centering\Large #1\par\vspace*{10pt}\hrule}}
-\newcommand{\red}[1]{\textcolor{red}{#1}}
-\newcommand{\dd}{\mathrm{d}}
-
-\setlength{\columnsep}{0.5cm}
-\setlength{\columnseprule}{0.4pt}
-
-\newcommand{\pdflaunch}[1] {\pdfpageattr{/AA << /O << /S /Launch /F (#1) >>>>}}
-\newcommand{\pdflaunchlink}[2]{%
-      \pdfstartlink attr{/Border [0 0 0]} user{/Subtype /Link /A << %
-        /S /Launch /F (#1) >>}%
-      \pdfliteral{0 1 0 0 k}%  
-      {#2}\pdfliteral{0 0 0 1 k}\pdfendlink%
-      }
-
-%\renewcommand{\pause}{\relax}
-
-\renewcommand{\emph}[1]{\textcolor{red}{\bf #1}}
-
-\begin{document}
-
-\MyLogo{The \texttt{igraph} library -- NetSci 2006 conference}
-
-%%%%%%%%%%%%%%%%%%%%%% TITLEPAGE
-
-\mbox{}\vfill
-\begin{center}
-\LARGE
-The \texttt{igraph} network analysis library\\[10pt]
-\normalsize
-\url{http://cneurocvs.rmki.kfki.hu/igraph}
-\par
-\large
-G\'abor Cs\'ardi
-\par
-\normalsize 
-Center for Complex Systems Studies, Kalamazoo College,\\
-Department of Biophysics, KFKI Research Institute for Particle and
-Nuclear Physics, Budapest, Hungary
-\end{center}
-\vfill
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{Why another network analysis library/program?}
-
-I needed something
-\begin{itemize}
-\item for \emph{large} data sets. Millions of nodes and vertices.
-\item \emph{fast}.
-\item open, \emph{embeddable} into another program/higher level
-  language for productivity.
-\item non-interactive \emph{and} interactive.
-\end{itemize}
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{Other features}
-
-(I don't really need them but it turned out that we have them.)
-\begin{itemize}
-\item Documentation. 
-\item Portability.
-\item Layered architecture.
-\item Open source.
-\end{itemize}
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{What is \texttt{igraph}?}
-\vfill
-
-\begin{center}
-\includegraphics[width=.6\textwidth]{arch}
-\end{center}
-\vfill
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{Case study one: ``grid'' computation}
-
-\begin{center}
-\includegraphics[width=.6\textwidth]{grid1}
-\end{center}
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{Case study one: ``grid'' computation}
-
-\begin{center}
-\includegraphics[width=.6\textwidth]{grid2}
-\end{center}
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{Case study two: live demo}
-
-\newpage
-%%%%%%%%%%%%%%%%%%%%%% 
-
-\tit{To get it}
-
-\vfill
-\begin{center}
-\Large
-\url{http://cneurocvs.rmki.kfki.hu/igraph}
-\end{center}
-\vfill
-
-\end{document}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/CCSS.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/CCSS.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci07/Makefile igraph-0.6.5/doc/presentations/netsci07/Makefile
--- igraph-0.6.5~quantal1/doc/presentations/netsci07/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci07/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-
-all: ps 
-
-ps: netsci07.ps
-
-pdf: netsci07.pdf 
-
-netsci07.ps: netsci07.dvi
-	dvips -t a0 netsci07.dvi -o netsci07.ps
-
-netsci07.pdf: netsci07.ps
-	ps2pdf netsci07.ps
-
-IMAGES=karate3d.eps arch.eps arch.eps_t RMKI-BME.eps CCSS.eps python3d.eps \
-	sna_screenshot.eps tkplot.eps diameter.eps degreedist.eps python3d-2.eps
-
-karate3d.eps: karate3d.png
-	convert karate3d.png karate3d.eps
-
-arch.eps arch.eps_t: arch.svg.gz
-	gzip -dc arch.svg.gz >arch.svg && \
-	svgtex arch.svg
-
-RMKI-BME.eps: RMKI-BME.svg.gz
-	gzip -dc RMKI-BME.svg.gz >RMKI-BME.svg && \
-	inkscape -E RMKI-BME.eps -B RMKI-BME.svg
-
-CCSS.eps: CCSS.svg.gz
-	gzip -dc CCSS.svg.gz >CCSS.svg && \
-	inkscape -E CCSS.eps -B CCSS.svg
-
-python3d.eps: python3d.png
-	convert python3d.png python3d.eps
-
-python3d-2.eps: python3d-2.png
-	convert python3d-2.png python3d-2.eps
-
-sna_screenshot.eps: sna_screenshot.jpg
-	convert sna_screenshot.jpg sna_screenshot.eps
-
-tkplot.eps: tkplot.png
-	convert tkplot.png tkplot.eps
-
-diameter.eps: diameter.png
-	convert diameter.png diameter.eps
-
-degreedist.eps: degreedist.png
-	convert degreedist.png degreedist.eps
-
-netsci07.dvi: netsci07.tex $(IMAGES)
-	latex netsci07.tex
-
-clean:
-	rm -f karate3d.eps screenshots.eps arch.eps arch.eps_t \
-	RMKI-BME.eps CCSS.eps netsci07.pdf netsci07.ps \
-	python3d-2.eps sna_screenshot.eps \
-	netsci07.aux netsci07.dvi netsci07.log \
-	screenshots.svg arch.svg RMKI-BME.svg CCSS.svg
-
-
-.PHONY: all ps pdf clean
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/RMKI-BME.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/RMKI-BME.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/arch.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/arch.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/clustering.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/clustering.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/degreedist.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/degreedist.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/diameter.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/diameter.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/diameter2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/diameter2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/karate3d.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/karate3d.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/netsci07/netsci07.tex igraph-0.6.5/doc/presentations/netsci07/netsci07.tex
--- igraph-0.6.5~quantal1/doc/presentations/netsci07/netsci07.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/netsci07/netsci07.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,273 +0,0 @@
-\documentclass[a0]{sciposter}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage{multicol}
-\usepackage{url}
-\usepackage{ragged2e}
-\usepackage{psfrag}
-\usepackage{watermark}
-\usepackage{fancyvrb}
-\usepackage{amstext}
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}
-  \input #2.eps_t
-  \includegraphics[width=#1]{#2}
-  \end{psfrags}
-}
-
-\setlength{\columnseprule}{.5pt}
-\setlength{\parskip}{12pt}
-
-\title{
-  The \textcolor{red}{igraph} platform for network science}
-\author{
-  G\'abor Cs\'ardi$^{\scriptscriptstyle 1,2}$ and 
-  Tam\'as Nepusz$^{\scriptscriptstyle 1,3}$}
-\institute{\mbox{}$^1$Department of Biophysics, 
-  Research Institute for Particle and Nuclear Physics \\
-  of the Hungarian Academy of Sciences,
-  Budapest, Hungary. \\
-  \mbox{}$^2$Center for Complex Systems Studies, Kalamazoo College,
-  Kalamazoo, MI, USA. \\
-  \mbox{}$^3$Dept. of Measurement and Information Systems, Budapest
-  University of Technology and Economics, Budapest, Hungary.
-}
-\email{csardi@rmki.kfki.hu \& ntamas@rmki.kfki.hu}
-\leftlogo{RMKI-BME}
-\rightlogo{CCSS}
-
-\begin{document}
-
-\watermark{\includegraphics[angle=-90,width=\textwidth]{karate3d}}
-
-\maketitle
-
-\begin{multicols}{3}
-
-\section{Features}
-
-\begin{itemize}
-\item Efficient and simple graph representation. Storing a graph needs
-  32 bytes per edge and 16 bytes per vertex.
-\item Efficient implementation. The current state of the art
-  algorithms are implemented (if not that is considered as a bug).
-\item Portable C (and some C++) code, works on most platforms:
-  Linux flavours, MS Windows variations, Mac OSX, Solaris, etc.
-\item Wide variety of graph algorithms: random and regular graph
-  structures, centrality measures, shortest paths, 2D and 3D graph
-  layouts, graph motifs, cliques, network flows and cuts, community
-  structure detection, etc.
-\item Interfaces from GNU R and Python, other interfaces can be added
-  without too much hassle.
-\item Interactive and non-interactive, 2D and 3D
-  visualization from R and Python.
-\item Graph, vertex and edge attributes, like edge weights, vertex
-  colors and other parameters for plotting.
-\item Various import and export file formats: GraphML, GML, Pajek,
-  simple edge list, etc.
-\item Well documented.
-\item Open source and completely free for non-commercial and
-  commercial use.
-\end{itemize}
-
-\section{Architecture}
-
-Simple and flexible layered architecture.
-Modules interact via well-defined interfaces and 
-can be replaced individually without breaking other parts.
-
-\begin{center}
-\figfigure{\columnwidth}{arch}
-\end{center}
-
-\section{Examples and Screenshots}
-
-% \vspace{20pt}\hrule\vspace{20pt}
-% \centerline{\bf Python interface screeshot}
-% \vspace{20pt}\hrule\vspace{20pt}
-
-% \begin{center}
-% \includegraphics[width=\columnwidth]{sna_screenshot}
-% \end{center}
-
-% \columnbreak
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Eigenvector based community structure}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-g <- read.graph(
-    "http://www.rmki.kfki.hu/~csardi/karate.gml", 
-    format="GML")
-
-community.newman <- function(g) {
-  d <- degree(g)
-  B <- get.adjacency(g)-outer(d, d, function(x,y) 
-                                    x*y/2/ecount(g))
-  diag(B) <- 0
-  eigen(B)$vectors[,1]
-}
-
-mem <- community.newman(g)
-V(g)$color <- ifelse(mem < 0, "blue", "green")
-V(g)$size <- abs(mem) * 35 ; E(g)$color <- "darkblue"
-E(g) [ V(g)[mem>=0] %--% V(g)[mem>=0] ]$color <- 
-     "darkgreen"
-E(g) [ V(g)[mem< 0] %--% V(g)[mem>=0] ]$color <- "red"
-tkplot(g, layout=layout.fruchterman.reingold,
-       vertex.label.dist=1)
-\end{Verbatim}
-
-\begin{center}
-\includegraphics[width=0.7\columnwidth]{tkplot}
-\end{center}
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Diameter of a scale-free graph}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-g <- barabasi.game(100, directed=FALSE)
-d <- get.diameter(g)
-E(g)$color <- "SkyBlue2"
-E(g)$width <- 1
-E(g, path=d)$color <- "red"
-E(g, path=d)$width <- 2
-V(g)$label.color <- V(g)$color  <- "blue"
-V(g)[ d ]$label.color <- V(g)[ d ]$color <- "red"
-plot(g, layout=layout.fruchterman.reingold, 
-     vertex.label.dist=0.6, vertex.size=3)
-title(main="Diameter of small scale-free graph",
-      xlab="created by igraph 0.4")
-\end{Verbatim}
-
-\begin{center}
-\includegraphics[width=0.7\columnwidth]{diameter}
-\end{center}
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Some degree distributions}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-g <- barabasi.game(100000)
-d <- degree(g, mode="in")
-dd <- degree.distribution(g, mode="in", cumul=TRUE)
-alpha <- power.law.fit(d, xmin=20)
-plot(dd, log="xy", xlab="degree", 
-     ylab="cumulative frequency",
-     col=1, main="Nonlinear preferential attachment")
-lines(10:500, 10*(10:500)^(-coef(alpha)+1))
-
-powers <- c(1.0, 0.9, 0.8, 0.7, 0.6)
-for (p in seq(powers[-1])) {
-  g <- barabasi.game(100000, power=powers[p+1])
-  dd <- degree.distribution(g, mode="in", cumul=TRUE)
-  points(dd, col=p+1, pch=p+1)
-}
-legend(1,1e-5, powers, col=1:5, pch=1:5, yjust=0, lty=0)
-\end{Verbatim}
-
-\begin{center}
-\includegraphics[width=0.7\columnwidth]{degreedist}
-\end{center}
-
-\columnbreak
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Page Rank in Python}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-from igraph import *
-from copy import copy
-
-def pagerank(g, damping=0.85, epsilon=0.001, iters=100):
-  pageranks = [1-damping] * g.vcount()
-  outlinks = g.degree(type=OUT)
-  mindiff = epsilon
-  newprs = [0] * g.vcount()
-    
-  while mindiff >= epsilon and iters > 0:
-    iters = iters - 1
-    for n in range(g.vcount()):
-      neis = g.neighbors(n, IN)
-      pr = 0.0
-      if len(neis) > 0:
-        for n2 in neis: pr = pr+pageranks[n2]/outlinks[n2]
-        pr = pr*damping
-      newprs[n] = pr+1-damping
- 
-    mindiff = min([abs(newprs[n]-pageranks[n]) for n 
-              in range(g.vcount())])
-    pageranks = copy(newprs)
-	
-  return pageranks
-\end{Verbatim}
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf 3D visualization in Python}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{center}
-\includegraphics[width=0.7\columnwidth]{python3d-2}
-\end{center}
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Dijkstra's shortest path algorithm}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-wsp <- function(g, source, weights=E(g)$weight) {
-  vc <- vcount(g)
-  res <- numeric(vc)
-  visited <- logical(vc)
-  visited[source+1] <- TRUE
-  while (any(!visited)) {
-    edges <-  E(g) [ V(g)[visited] %--% V(g)[!visited] ]
-    ft <- get.edges(g, edges)
-    weig <- weights[ edges+1 ] +
-            res[ft[,1]+1] + res[ft[,2]+1]
-    minw <- which.min(weig)
-    ft <- ft[minw,]
-    if (visited[ft[2]+1]) ft <- rev(ft)
-    res[ft[2]+1] <- weig[minw]
-    visited[ ft+1 ] <- TRUE
-  }
-  res
-}
-\end{Verbatim}
-
-\vspace{20pt}\hrule\vspace{20pt}
-\centerline{\bf Weighted transitivity}
-\vspace{20pt}\hrule\vspace{20pt}
-
-\[ 
-  c(i)=\frac{\mathbf{A}^3_{ii}}{(\mathbf{A1A})_{ii}} \qquad
-  c_w(i)=\frac{\mathbf{W}^3_{ii}}{(\mathbf{WW_{\text{max}}W})_{ii}}
-\]
-
-\begin{Verbatim}[fontsize=\small,numbers=left]
-wtrans <- function(g) {
-  W <- get.adjacency(g, attr="weight")
-  WM <- matrix(max(W), nrow(W), ncol(W))
-  diag(WM) <- 0
-  diag( W %*% W %*% W ) / diag( W %*% WM %*% W)
-}
-\end{Verbatim}
-
-\section{Where to get it?}
-\centerline{\bf\LARGE \url{http://igraph.sf.net}}
-
-\end{multicols}
-
-\enlargethispage{2cm}
-\vfill
-\hrule
-\vfill
-\centerline{\small NetSci 2007 International Workshop and Conference
-  on Network Science}
-\vfill
-
-\end{document}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/python3d-2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/python3d-2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/python3d.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/python3d.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/sna_screenshot.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/sna_screenshot.jpg differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci07/tkplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci07/tkplot.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci10/igraph_poster.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci10/igraph_poster.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/netsci10/igraph_poster.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/netsci10/igraph_poster.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/nips08/NIPS2008.R igraph-0.6.5/doc/presentations/nips08/NIPS2008.R
--- igraph-0.6.5~quantal1/doc/presentations/nips08/NIPS2008.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/nips08/NIPS2008.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,639 +0,0 @@
-#######################################################################
-## 1) Basics
-#######################################################################
-
-## Load the igraph package
-library(igraph)
-
-## Create a small graph, A->B, A->C, B->C, C->E, D
-## A=0, B=1, C=2, D=3, E=4
-g <- graph( c(0,1, 0,2, 1,2, 2,4), n=5 )
-
-## Print a graph to the screen
-g
-
-## Create an undirected graph as well
-## A--B, A--C, B--C, C--E, D
-g2 <- graph( c(0,1, 0,2, 1,2, 2,4), n=5, dir=FALSE )
-g2
-
-## How to decide what kind of object a variable refers to
-class(g2)
-class(1)
-class("foobar")
-
-## Is this object an igraph graph?
-is.igraph(g)
-is.igraph(1:10)
-
-## Summary, number of vertices, edges
-summary(g)
-vcount(g)
-ecount(g)
-
-## Is the graph directed?
-is.directed(g)
-is.directed(g2)
-is.directed(1:10)
-
-## Convert from directed to undirected
-as.undirected(g)
-
-## And back
-as.directed(as.undirected(g))
-
-## Multiple edges
-g <- graph( c(0,1,0,1, 0,2, 1,2, 3,4), n=5 )
-g
-
-is.simple(g)
-is.multiple(g)
-
-## Remove multiple edges
-g <- simplify(g)
-is.simple(g)
-
-## Loop edges
-g <- graph( c(0,0,0,1, 0,2, 1,2, 3,4), n=5 )
-g
-
-is.simple(g)
-is.loop(g)
-
-## Remove loop edges
-g <- simplify(g)
-is.simple(g)
-
-## Naming vertices
-g <- graph.ring(10)
-V(g)$name <- letters[1:10]
-V(g)$name
-g
-print(g, v=T)
-
-#######################################################################
-## 2) Creating graphs
-#######################################################################
-
-## The formula interface
-library(igraph)
-
-## A simple undirected graph
-g <- graph.formula(Alice-Bob-Cecil-Alice, 
-                   Daniel-Cecil-Eugene, Cecil-Gordon )
-
-## Another undirected graph, ":" notation
-g2 <- graph.formula(Alice-Bob:Cecil:Daniel, 
-                    Cecil:Daniel-Eugene:Gordon )
-
-## A directed graph
-g3 <- graph.formula(Alice +-+ Bob --+ Cecil 
-                    +-- Daniel, Eugene --+ Gordon:Helen )
-
-## A graph with isolate vertices
-g4 <- graph.formula(Alice -- Bob -- Daniel, 
-                    Cecil:Gordon, Helen )
-
-## "Arrows" can be arbitrarily long
-g5 <- graph.formula( Alice +---------+ Bob )
-
-## From edge lists
-el <- cbind( c(0, 0, 1, 2),
-             c(1, 2, 2, 4) )
-g <- graph.edgelist(el)
-g
-
-## Symbolic edge lists
-el <- cbind( c("Alice", "Alice", "Bob",   "Cecil"),
-             c("Bob",   "Cecil", "Cecil", "Ed") )
-g <- graph.edgelist(el)
-g
-summary(g)
-
-## Adjacency matrices
-A <- matrix(sample(0:1, 100, rep=TRUE), 10, 10)
-g <- graph.adjacency(A)
-
-#######################################################################
-## 3) Manipulate graphs, add and delete vertices and edges
-#######################################################################
-
-library(igraph)
-
-## Create undirected example graph
-g2 <- graph.formula(Alice-Bob:Cecil:Daniel, 
-                    Cecil:Daniel-Eugene:Gordon )
-print(g2, v=T)
-
-## Remove alice
-g3 <- delete.vertices(g2, 0)
-
-## Add three new vertices
-g4 <- add.vertices(g3, 3)
-print(g4, v=T)
-igraph.par("print.vertex.attributes", TRUE)
-igraph.par("plot.layout", layout.fruchterman.reingold)
-g4
-
-## Add three new vertices, with names this time
-g4 <- add.vertices(g3, 3, attr=list(name=c("Helen", "Ike", "Jane")))
-g4
-
-## Add some edges as well
-g4 <- add.edges(g4, c(6,7, 5,7))
-g4
-
-#######################################################################
-## 4) Edge sequences
-#######################################################################
-
-library(igraph)
-
-## Create directed example graph
-g2 <- graph.formula(Alice -+ Bob:Cecil:Daniel, 
-                    Cecil:Daniel +-+ Eugene:Gordon )
-print(g2, v=T)
-
-## Sequence of all edges
-E(g2)
-
-## Edge from a vertex to another
-E(g2, P=c(0,1))
-
-## Delete this edge
-g3 <- delete.edges(g2, E(g2, P=c(0,1)))
-g3
-
-## Get the id of the edge
-as.vector(E(g2, P=c(0,1)))
-
-## All adjacent edges of a vertex
-E(g2)[ adj(2) ]
-
-## Or multiple vertices
-E(g2)[ adj(c(2,0)) ]
-
-## Outgoing edges
-E(g2)[ from(2) ]
-
-## Incoming edges
-E(g2)[ to(2) ]
-
-## Edges along a path
-E(g2, path=c(0,3,4))
-
-#######################################################################
-## 5) A real example, creating a graph from data frames
-#######################################################################
-
-library(igraph)
-
-## We need some extra code, not in the current version yet
-source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-
-## Read the comma-separated value file 
-vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")
-
-## Read the edges, just a table, space separated 
-edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")
-
-## And create the graph
-jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-summary(jg)
-
-## Save it for future use
-save(jg, file="judicial.Rdata.gz", compress=TRUE)
-
-## Easy, huh?
-
-#######################################################################
-## 6) Visualizing graphs
-#######################################################################
-
-library(igraph)
-
-## Create a scale-free network
-g <- barabasi.game(100, m=1)
-g <- simplify(g)
-
-## simple plot
-igraph.par("plot.layout", layout.fruchterman.reingold)
-plot(g, vertex.size=3, vertex.label=NA, edge.arrow.size=0.6)
-
-## interactive
-id <- tkplot(g, vertex.size=3, vertex.label=NA, edge.arrow.size=0.6)
-coords <- tkplot.getcoords(id)
-
-## 3D
-open3d()
-rglplot(g, vertex.size=3, vertex.label=NA, edge.arrow.size=0.6)
-
-## A bit better 3D
-coords <- layout.kamada.kawai(g, dim=3)
-open3d()
-rglplot(g, vertex.size=3, vertex.label=NA, edge.arrow.size=0.6, layout=coords)
-
-#######################################################################
-## 7) Attributes
-#######################################################################
-
-library(igraph)
-
-## Load the jurisdiction network
-load("judicial.Rdata.gz")
-
-## If we don't have it then create it again
-if (!exists("jg")) {
-  source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-  vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")
-  edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")
-  jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-}
-
-## What do we have?
-summary(jg)
-V(jg)$year[1:100]
-V(jg)$parties[1:10]
-
-## Select vertices based on attributes
-V(jg) [ year >= 1990 ]
-V(jg) [ overruled!=0 ]
-
-## Group network measures based on attributes
-deg.per.year <- tapply(degree(jg, mode="out"), V(jg)$year, mean)
-
-## Plot it
-plot( names(deg.per.year), deg.per.year )
-
-## A more advanced example
-g <- erdos.renyi.game(100, 1/100)
-V(g)$color <- sample( c("red", "black"), 
-                     vcount(g), rep=TRUE)
-E(g)$color <- "grey"
-red <- V(g)[ color == "red" ]
-bl <- V(g)[ color == "black" ]
-E(g)[ red %--% red ]$color <- "red"
-E(g)[ bl  %--% bl ]$color <- "black"
-plot(g, vertex.size=5, layout=
-     layout.fruchterman.reingold)
-
-#######################################################################
-## 8) Centrality and its sensitivity
-#######################################################################
-
-library(igraph)
-
-## Create it
-g <- graph.formula(Andre----Beverly:Diane:Fernando:Carol,
-                   Beverly--Andre:Diane:Garth:Ed,
-                   Carol----Andre:Diane:Fernando,
-                   Diane----Andre:Carol:Fernando:Garth:Ed:Beverly,
-                   Ed-------Beverly:Diane:Garth,
-                   Fernando-Carol:Andre:Diane:Garth:Heather,
-                   Garth----Ed:Beverly:Diane:Fernando:Heather,
-                   Heather--Fernando:Garth:Ike,
-                   Ike------Heather:Jane,
-                   Jane-----Ike )
-g <- simplify(g)
-
-## Hand-drawn coordinates
-coords <- c(5,5,119,256,119,256,120,340,478,
-            622,116,330,231,116,5,330,451,231,231,231)
-coords <- matrix(coords, nc=2)
-
-## Labels the same as names
-V(g)$label <- V(g)$name
-g$layout <- coords # $
-
-## Take a look at it
-plot(g, asp=FALSE, vertex.label.color="blue", vertex.label.cex=1.5,
-     vertex.label.font=2, vertex.size=20, vertex.color="white",
-     vertex.frame.color="white", edge.color="black")  
-
-## Add degree centrality to labels
-V(g)$label <- paste(sep="\n", V(g)$name, degree(g))
-
-## And plot again
-plot(g, asp=FALSE, vertex.label.color="blue", vertex.label.cex=1.5,
-     vertex.label.font=2, vertex.size=20, vertex.color="white",
-     vertex.frame.color="white", edge.color="black")                      
-
-#######################################################################
-## 9) Analyzing a (moderately) big graph
-#######################################################################
-
-library(igraph)
-
-## Load the jurisdiction network
-load("judicial.Rdata.gz")
-
-## If we don't have it then create it again
-if (!exists("jg")) {
-  source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-  vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")
-  edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")
-  jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-}
-
-## Basic data
-summary(jg)
-
-## Is it a simple graph?
-is.simple(jg)
-
-## Is it connected?
-is.connected(jg)
-
-## How many components?
-no.clusters(jg)
-
-## How big are these?
-table(clusters(jg)$csize)
-
-## In-degree distribution
-plot(degree.distribution(jg, mode="in"), log="xy")
-
-## Out-degree distribution
-plot(degree.distribution(jg, mode="out"), log="xy")
-
-## Largest in- and out-degree, total degree
-max(degree(jg, mode="in"))
-max(degree(jg, mode="out"))
-max(degree(jg, mode="all"))
-
-## Density
-graph.density(jg)
-
-## Transitivity
-transitivity(jg)
-
-## Transitivity of a random graph of the same size
-g <- erdos.renyi.game(vcount(jg), ecount(jg), type="gnm")
-transitivity(g)
-
-## Dyad census
-dyad.census(jg)
-
-## Triad census
-triad.census(jg)
-
-## Authority and Hub scores
-authority.score(jg)$vector
-cor(authority.score(jg)$vector, V(jg)$auth)
-
-hub.score(jg)$vector
-cor(hub.score(jg)$vector, V(jg)$hub)
-
-######################################################################
-# 10) Community structure detection
-######################################################################
-
-library(igraph)
-
-## The concept of modularity
-g <- graph.full(5) %du% graph.full(5)
-g$layout <- layout.fruchterman.reingold
-plot(g)
-V(g)$color <- 2
-V(g)[0:4]$color <- 1
-plot(g)
-
-## This graph is modular
-modularity(g, membership=V(g)$color-1)
-
-## If we have everyone in the same group,
-## that is not modular
-V(g)$color <- 1
-modularity(g, membership=V(g)$color-1)
-
-## If we assign the vertices randomly to two
-## groups, that is not very modular, either
-V(g)$color <- sample(1:2, vcount(g), rep=TRUE)
-plot(g)
-modularity(g, membership=V(g)$color-1)
-
-## Keep only the largest component for further analysis
-load("judicial.Rdata.gz")
-
-cl <- clusters(jg)
-which.max(cl$csize)
-cl$membership == which.max(cl$csize)-1
-to.keep <- which(cl$membership == which.max(cl$csize)-1)-1
-jg2 <- subgraph(jg, to.keep)
-summary(jg2)
-
-## Fast & greedy community detection
-jg3 <- as.undirected(jg2, mode="collapse")
-is.simple(jg3)
-## system.time( fc <- fastgreedy.community(jg3) )
-
-## We do it on a smaller graph instead
-karate <- read.graph("http://cneurocvs.rmki.kfki.hu/igraph/karate.net",
-                     format="pajek")
-karate <- simplify(karate)
-
-system.time( fc <- fastgreedy.community(karate) )
-fc$modularity
-max(fc$modularity)
-which.max(fc$modularity)
-memb <- community.to.membership(karate, fc$merges, which.max(fc$modularity))
-memb
-
-lay <- layout.kamada.kawai(karate)
-plot(karate, layout=lay, vertex.size=5, vertex.label=NA,
-     vertex.color=memb$membership+1, asp=FALSE)
-
-## Spinglass community detection
-## system.time(spc <- spinglass.community(jg3, spins=20))
-
-system.time(spc <- spinglass.community(karate, spins=20))
-spc
-
-x11()
-plot(karate, layout=lay, vertex.size=5, vertex.label=NA,
-     vertex.color=spc$membership+1, asp=FALSE)
-
-######################################################################
-# 11) Cohesive blocks
-######################################################################
-
-library(igraph)
-
-## Load the graph
-cb <- graph( c(1,2,1,3,1,4,1,5,1,6,
-               2,3,2,4,2,5,2,7,
-               3,4,3,6,3,7,
-               4,5,4,6,4,7,
-               5,6,5,7,5,21,
-               6,7,
-               7,8,7,11,7,14,7,19,
-               8,9,8,11,8,14,
-               9,10,
-               10,12,10,13,
-               11,12,11,14,
-               12,16, 13,16, 14,15, 15,16,
-               17,18,17,19,17,20,
-               18,20,18,21,
-               19,20,19,22,19,23,
-               20,21, 21,22,21,23,
-               22,23)-1, dir=FALSE)
-
-## 
-V(cb)$label <- seq(vcount(cb))  # $
-
-blocks <- cohesive.blocks(cb)
-blocks
-
-summary(blocks)
-blocks$blocks
-lapply(blocks$blocks, "+", 1)
-blocks$block.cohesion
-plot(blocks, layout=layout.kamada.kawai,
-     vertex.label.cex=2, vertex.size=15,
-     vertex.label.color="black")
-
-######################################################################
-# 12) Weighted transitivity
-######################################################################
-
-library(igraph)
-
-## Define function
-wtrans <- function(g) {
-  W <- get.adjacency(g, attr="weight")
-  WM <- matrix(max(W), nrow(W), ncol(W))
-  diag(WM) <- 0
-  diag( W %*% W %*% W ) / 
-    diag( W %*% WM %*% W)
-}
-
-## Try it on an example graph
-g <- graph.formula(Andre----Beverly:Diane:Fernando:Carol,
-                   Beverly--Andre:Diane:Garth:Ed,
-                   Carol----Andre:Diane:Fernando,
-                   Diane----Andre:Carol:Fernando:Garth:Ed:Beverly,
-                   Ed-------Beverly:Diane:Garth,
-                   Fernando-Carol:Andre:Diane:Garth:Heather,
-                   Garth----Ed:Beverly:Diane:Fernando:Heather,
-                   Heather--Fernando:Garth:Ike,
-                   Ike------Heather:Jane,
-                   Jane-----Ike )
-g <- simplify(g)
-
-## Check the fallback
-E(g)$weight <- 1
-cbind(transitivity(g, "local"), wtrans(g))
-
-## Now change a weight
-E(g)[0]$weight <- 1/2
-
-## Take a look at it
-coords <- c(5,5,119,256,119,256,120,340,478,
-            622,116,330,231,116,5,330,451,231,231,231)
-coords <- matrix(coords, nc=2)
-V(g)$label <- paste(sep="", V(g)$name, "\n",
-                    round(transitivity(g, "local"),2),
-                    ", ", round(wtrans(g), 2))
-g$layout <- coords # $
-plot(g, asp=FALSE, vertex.label.color="blue", vertex.label.cex=1.5,
-     vertex.label.font=2, vertex.size=20, vertex.color="white",
-     vertex.frame.color="white", edge.color="black",
-     edge.label=E(g)$weight, edge.label.cex=1.5, edge.label.color="red")
-
-######################################################################
-# 12) Clique percolation
-######################################################################
-
-library(igraph)
-
-## Function to calculate clique communities
-clique.community <- function(graph, k) {
-  clq <- cliques(graph, min=k, max=k)
-  edges <- c()
-  for (i in seq(along=clq)) {
-    for (j in seq(along=clq)) {
-      if ( length(unique(c(clq[[i]], 
-             clq[[j]]))) == k+1 ) {
-        edges <- c(edges, c(i,j)-1)
-      }
-    }
-  }
-  clq.graph <- simplify(graph(edges))
-  V(clq.graph)$name <- 
-    seq(length=vcount(clq.graph))
-  comps <- decompose.graph(clq.graph)
-  
-  lapply(comps, function(x) {
-    unique(unlist(clq[ V(x)$name ]))
-  })
-}
-
-## Apply it to a graph, this is the example graph from
-## the original publication
-g <- graph.formula(A-B:F:C:E:D, B-A:D:C:E:F:G, C-A:B:F:E:D, D-A:B:C:F:E,
-                   E-D:A:C:B:F:V:W:U, F-H:B:A:C:D:E, G-B:J:K:L:H,
-                   H-F:G:I:J:K:L, I-J:L:H, J-I:G:H:L, K-G:H:L:M,
-                   L-H:G:I:J:K:M, M-K:L:Q:R:S:P:O:N, N-M:Q:R:P:S:O,
-                   O-N:M:P, P-Q:M:N:O:S, Q-M:N:P:V:U:W:R, R-M:N:V:W:Q,
-                   S-N:P:M:U:W:T, T-S:V:W:U, U-E:V:Q:S:W:T,
-                   V-E:U:W:T:R:Q, W-U:E:V:Q:R:S:T)
-g <- simplify(g)
-
-## Hand-made layout to make it look like the original in the paper
-lay <- c(387.0763, 306.6947, 354.0305, 421.0153, 483.5344, 512.1145, 
-         148.6107, 392.4351, 524.6183, 541.5878, 240.6031, 20, 
-         65.54962, 228.0992, 61.9771, 152.1832, 334.3817, 371.8931, 
-         421.9084, 265.6107, 106.6336, 57.51145, 605, 20, 124.8780, 
-         273.6585, 160.2439, 241.9512, 132.1951, 123.6585, 343.1707, 
-         465.1220, 317.561, 216.3415, 226.0976, 343.1707, 306.5854, 
-         123.6585, 360.2439, 444.3902, 532.1951, 720, 571.2195, 
-         639.5122, 505.3659, 644.3902)
-lay <- matrix(lay, nc=2)
-lay[,2] <- max(lay[,2])-lay[,2]
-
-## Take a look at it
-plot(g, layout=lay, vertex.label=V(g)$name)
-
-## Calculate communities
-res <- clique.community(g, k=4)
-
-## Paint them to different colors
-colbar <- rainbow( length(res)+1 )
-for (i in seq(along=res)) {
-  V(g)[ res[[i]] ]$color <- colbar[i+1]
-}
-
-## Paint the vertices in multiple communities to red
-V(g)[ unlist(res)[ duplicated(unlist(res)) ] ]$color <- "red"
-
-## Plot with the new colors
-plot(g, layout=lay, vertex.label=V(g)$name)
-
-######################################################################
-# 13) Compare to sna & network
-######################################################################
-
-library(igraph)
-library(sna)
-library(network)
-
-## Some (moderate size) data
-load("judicial.Rdata.gz")
-
-## Try using an adjacency matrix
-A <- get.adjacency(jg)
-
-## Try a 'network' object
-el <- get.edgelist(jg, name=FALSE)
-net <- network.initialize(vcount(jg))
-net2 <- network::add.edges(net, head=el[,1]+1, tail=el[,2]+1)
-
-## Great! Try calculating degree centrality
-deg <- degree(net2)
-deg <- igraph::degree(jg)
-
-## Ooops, try eigenvector centrality
-ev <- evcent(net2)
-ev <- igraph::evcent(jg)$vector
-
-## etc.
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/boxplot.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/boxplot.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/cblocks.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/cblocks.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-betweenness.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-betweenness.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-closeness.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-closeness.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-constraint.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-constraint.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-degree.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-degree.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-evcent.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-evcent.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-infocent.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-infocent.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet-trans.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet-trans.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/centnet.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/centnet.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/communities.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/communities.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/nips08/dend.pdf igraph-0.6.5/doc/presentations/nips08/dend.pdf
--- igraph-0.6.5~quantal1/doc/presentations/nips08/dend.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/nips08/dend.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,802 +0,0 @@
-%PDF-1.1
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20080612084932)
-/ModDate (D:20080612084932)
-/Title (R Graphics Output)
-/Producer (R 2.7.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Font
-/Subtype /Type1
-/Name /F1
-/BaseFont /ZapfDingbats
->>
-endobj
-6 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 7 0 R
-/Resources 4 0 R
->>
-endobj
-7 0 obj
-<<
-/Length 8 0 R
->>
-stream
-q
-Q q
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-59.04 87.20 m 59.04 399.19 l S
-59.04 87.20 m 51.84 87.20 l S
-59.04 139.20 m 51.84 139.20 l S
-59.04 191.20 m 51.84 191.20 l S
-59.04 243.20 m 51.84 243.20 l S
-59.04 295.19 m 51.84 295.19 l S
-59.04 347.19 m 51.84 347.19 l S
-59.04 399.19 m 51.84 399.19 l S
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 83.86 Tm (0) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 135.86 Tm (1) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 187.86 Tm (2) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 239.86 Tm (3) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 291.86 Tm (4) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 343.86 Tm (5) Tj
-/F2 1 Tf 0.00 12.00 -12.00 0.00 41.76 395.86 Tm (6) Tj
-ET
-Q q
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-343.63 431.20 m 178.73 431.20 l S
-178.73 431.20 m 178.73 409.71 l S
-178.73 409.71 m 116.75 409.71 l S
-116.75 409.71 m 116.75 308.89 l S
-116.75 308.89 m 99.58 308.89 l S
-99.58 308.89 m 99.58 90.84 l S
-99.58 90.84 m 90.99 90.84 l S
-90.99 90.84 m 90.99 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 89.01 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 95.21 67.39 Tm (24) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-99.58 90.84 m 108.16 90.84 l S
-108.16 90.84 m 108.16 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 106.19 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 112.27 67.39 Tm (25) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-116.75 308.89 m 133.93 308.89 l S
-133.93 308.89 m 133.93 105.42 l S
-133.93 105.42 m 125.34 105.42 l S
-125.34 105.42 m 125.34 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 123.37 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 129.45 67.39 Tm (23) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-133.93 105.42 m 142.52 105.42 l S
-142.52 105.42 m 142.52 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 140.54 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 146.74 67.39 Tm (27) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-178.73 409.71 m 240.71 409.71 l S
-240.71 409.71 m 240.71 389.84 l S
-240.71 389.84 m 188.68 389.84 l S
-188.68 389.84 m 188.68 328.34 l S
-188.68 328.34 m 168.28 328.34 l S
-168.28 328.34 m 168.28 151.98 l S
-168.28 151.98 m 159.69 151.98 l S
-159.69 151.98 m 159.69 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 157.72 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 163.80 67.39 Tm (28) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-168.28 151.98 m 176.87 151.98 l S
-176.87 151.98 m 176.87 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 174.90 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 180.97 67.39 Tm (31) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-188.68 328.34 m 209.08 328.34 l S
-209.08 328.34 m 209.08 236.93 l S
-209.08 236.93 m 194.05 236.93 l S
-194.05 236.93 m 194.05 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 192.07 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 198.15 74.07 Tm (9) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-209.08 236.93 m 224.11 236.93 l S
-224.11 236.93 m 224.11 223.08 l S
-224.11 223.08 m 211.22 223.08 l S
-211.22 223.08 m 211.22 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 209.25 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 215.33 74.07 Tm (8) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-224.11 223.08 m 236.99 223.08 l S
-236.99 223.08 m 236.99 101.26 l S
-236.99 101.26 m 228.40 101.26 l S
-228.40 101.26 m 228.40 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 226.43 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 232.62 74.07 Tm (2) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-236.99 101.26 m 245.58 101.26 l S
-245.58 101.26 m 245.58 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 243.60 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 249.68 67.39 Tm (13) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-240.71 389.84 m 292.74 389.84 l S
-292.74 389.84 m 292.74 348.68 l S
-292.74 348.68 m 271.34 348.68 l S
-271.34 348.68 m 271.34 94.56 l S
-271.34 94.56 m 262.75 94.56 l S
-262.75 94.56 m 262.75 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 260.78 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 266.86 67.39 Tm (26) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-271.34 94.56 m 279.93 94.56 l S
-279.93 94.56 m 279.93 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 277.95 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 284.03 67.39 Tm (29) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-292.74 348.68 m 314.15 348.68 l S
-314.15 348.68 m 314.15 270.73 l S
-314.15 270.73 m 297.11 270.73 l S
-297.11 270.73 m 297.11 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 295.13 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 301.21 67.39 Tm (30) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-314.15 270.73 m 331.19 270.73 l S
-331.19 270.73 m 331.19 142.02 l S
-331.19 142.02 m 314.28 142.02 l S
-314.28 142.02 m 314.28 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 312.31 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 318.50 67.39 Tm (22) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-331.19 142.02 m 348.10 142.02 l S
-348.10 142.02 m 348.10 132.65 l S
-348.10 132.65 m 331.46 132.65 l S
-331.46 132.65 m 331.46 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 329.48 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 335.56 67.39 Tm (20) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-348.10 132.65 m 364.74 132.65 l S
-364.74 132.65 m 364.74 124.28 l S
-364.74 124.28 m 348.64 124.28 l S
-348.64 124.28 m 348.64 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 346.66 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 352.74 67.39 Tm (15) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-364.74 124.28 m 380.84 124.28 l S
-380.84 124.28 m 380.84 116.95 l S
-380.84 116.95 m 365.81 116.95 l S
-365.81 116.95 m 365.81 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 363.84 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 370.03 67.39 Tm (14) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-380.84 116.95 m 395.87 116.95 l S
-395.87 116.95 m 395.87 110.65 l S
-395.87 110.65 m 382.99 110.65 l S
-382.99 110.65 m 382.99 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 381.01 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 387.09 67.39 Tm (18) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-395.87 110.65 m 408.75 110.65 l S
-408.75 110.65 m 408.75 92.38 l S
-408.75 92.38 m 400.16 92.38 l S
-400.16 92.38 m 400.16 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 398.19 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 404.27 67.39 Tm (32) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-408.75 92.38 m 417.34 92.38 l S
-417.34 92.38 m 417.34 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 415.37 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 421.45 67.39 Tm (33) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-343.63 431.20 m 508.52 431.20 l S
-508.52 431.20 m 508.52 429.17 l S
-508.52 429.17 m 455.99 429.17 l S
-455.99 429.17 m 455.99 289.26 l S
-455.99 289.26 m 434.52 289.26 l S
-434.52 289.26 m 434.52 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 432.54 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 438.62 67.39 Tm (16) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-455.99 289.26 m 477.46 289.26 l S
-477.46 289.26 m 477.46 209.72 l S
-477.46 209.72 m 460.28 209.72 l S
-460.28 209.72 m 460.28 87.20 l S
-460.28 87.20 m 451.69 87.20 l S
-451.69 87.20 m 451.69 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 449.72 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 455.71 74.07 Tm (5) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-460.28 87.20 m 468.87 87.20 l S
-468.87 87.20 m 468.87 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 466.90 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 472.97 74.07 Tm (6) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-477.46 209.72 m 494.64 209.72 l S
-494.64 209.72 m 494.64 87.83 l S
-494.64 87.83 m 486.05 87.83 l S
-486.05 87.83 m 486.05 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 484.07 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 490.27 74.07 Tm (4) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-494.64 87.83 m 503.22 87.83 l S
-503.22 87.83 m 503.22 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 501.25 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 507.33 67.39 Tm (10) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-508.52 429.17 m 561.06 429.17 l S
-561.06 429.17 m 561.06 369.50 l S
-561.06 369.50 m 520.40 369.50 l S
-520.40 369.50 m 520.40 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 518.43 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 524.62 67.39 Tm (11) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-561.06 369.50 m 601.72 369.50 l S
-601.72 369.50 m 601.72 253.42 l S
-601.72 253.42 m 554.22 253.42 l S
-554.22 253.42 m 554.22 184.82 l S
-554.22 184.82 m 537.58 184.82 l S
-537.58 184.82 m 537.58 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 535.60 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 541.79 67.39 Tm (12) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-554.22 184.82 m 570.86 184.82 l S
-570.86 184.82 m 570.86 173.40 l S
-570.86 173.40 m 554.75 173.40 l S
-554.75 173.40 m 554.75 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 552.78 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 558.97 67.39 Tm (17) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-570.86 173.40 m 586.96 173.40 l S
-586.96 173.40 m 586.96 162.45 l S
-586.96 162.45 m 571.93 162.45 l S
-571.93 162.45 m 571.93 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 569.95 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 576.15 67.39 Tm (21) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-586.96 162.45 m 601.99 162.45 l S
-601.99 162.45 m 601.99 97.68 l S
-601.99 97.68 m 589.11 97.68 l S
-589.11 97.68 m 589.11 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 587.13 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 593.32 74.07 Tm (1) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-601.99 97.68 m 614.87 97.68 l S
-614.87 97.68 m 614.87 89.02 l S
-614.87 89.02 m 606.28 89.02 l S
-606.28 89.02 m 606.28 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 604.31 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 610.39 74.07 Tm (3) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-614.87 89.02 m 623.46 89.02 l S
-623.46 89.02 m 623.46 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 621.48 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 627.59 74.07 Tm (7) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-601.72 253.42 m 649.22 253.42 l S
-649.22 253.42 m 649.22 196.71 l S
-649.22 196.71 m 640.64 196.71 l S
-640.64 196.71 m 640.64 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 638.66 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 644.74 74.07 Tm (0) Tj
-ET
-Q q 59.04 73.44 630.72 371.52 re W n
-0.000 0.000 0.000 RG
-0.75 w
-[] 0 d
-1 J
-1 j
-10.00 M
-649.22 196.71 m 657.81 196.71 l S
-657.81 196.71 m 657.81 87.20 l S
-0.000 0.000 0.000 rg
-BT
-/F1 1 Tf 2 Tr 4.99 0 0 4.99 655.84 85.47 Tm (l) Tj 0 Tr
-ET
-Q q
-BT
-0.000 0.000 0.000 rg
-/F2 1 Tf 0.00 12.00 -12.00 0.00 661.92 67.39 Tm (19) Tj
-ET
-Q
-endstream
-endobj
-8 0 obj
-13884
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-6 0 R
-]
-/Count 1
-/MediaBox [0 0 720 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font << /F1 5 0 R /F2 10 0 R >>
-/ExtGState << >>
->>
-endobj
-9 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-10 0 obj <<
-/Type /Font
-/Subtype /Type1
-/Name /F2
-/BaseFont /Helvetica
-/Encoding 9 0 R
->> endobj
-xref
-0 11
-0000000000 65535 f 
-0000000021 00000 n 
-0000000163 00000 n 
-0000014333 00000 n 
-0000014416 00000 n 
-0000000212 00000 n 
-0000000295 00000 n 
-0000000375 00000 n 
-0000014312 00000 n 
-0000014509 00000 n 
-0000014766 00000 n 
-trailer
-<<
-/Size 11
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-14863
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/groups.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/groups.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/nips08/igraph.tex igraph-0.6.5/doc/presentations/nips08/igraph.tex
--- igraph-0.6.5~quantal1/doc/presentations/nips08/igraph.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/nips08/igraph.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,972 +0,0 @@
-\documentclass[landscape,fleqno]{foils}
-
-\usepackage{ae}
-%\usepackage{hyperref}
-%\usepackage{thumbpdf}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage[left=1cm,right=1cm,top=2cm,bottom=2cm]{geometry}
-% \usepackage[display]{texpower}
-%\usepackage{psfrag}
-\usepackage{ragged2e}
-\usepackage{amstext}
-\usepackage{xspace}
-\usepackage{fancyvrb}
-\usepackage{amsmath}
-\usepackage{url}
-\usepackage{pause}
-\usepackage{tabularx}
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}%
-  \input #2.eps_t%
-  \includegraphics[width=#1]{#2.eps}%
-  \end{psfrags}%
-}
-
-\newcommand{\stitle}[1]{{\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-\newcommand{\cstitle}[1]{{\centering\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-
-\setlength{\columnsep}{0.5cm}
-\setlength{\columnseprule}{0.4pt}
-
-\renewcommand{\emph}[1]{\textcolor{red}{\bf #1}}
-
-\newcommand{\igraph}{\texttt{{igraph}}\xspace}
-
-\DefineVerbatimEnvironment{Myverb}{Verbatim}
-{gobble=2,numbers=left,numbersep=5mm,frame=lines,fontsize=\small}
-
-\newenvironment{narrow}[2]{%
-  \begin{list}{}{%
-      \setlength{\topsep}{0pt}%
-      \setlength{\leftmargin}{#1}%
-      \setlength{\rightmargin}{#2}%
-      \setlength{\listparindent}{\parindent}%
-      \setlength{\itemindent}{\parindent}%
-      \setlength{\parsep}{\parskip}}%
-    \item[]}{\end{list}}
-
-\newcommand{\bull}{$\bullet$\xspace}
-
-\begin{document}
-
-\RaggedRight
-% \color{white}
-% \pagecolor{black}
-\fvset{fontsize=\small}
-\fvset{commandchars=\\\{\}}
-\definecolor{grey}{gray}{0.75}
-\fvset{frame=single, numbers=left, rulecolor=\color{grey}}
-
-\MyLogo{\color{black}\texttt{http://cneurocvs.rmki.kfki.hu/igraph/NIPS2008.html}}
-
-\thispagestyle{empty}
-\vspace*{1cm}
-{\centering
-\hrule
-\Large
-\vspace*{1cm}
-{\bf Large-scale network analysis}
-\vspace*{1cm}
-\par
-\hrule
-\par
-\vspace*{2cm}
-\normalsize G\'abor Cs\'ardi\\
-\small \verb+csardi@rmki.kfki.hu+
-\par
-\vspace*{1.5cm}
-Department of Biophysics, 
-KFKI Research Institute for Nuclear and Particle Physics of the\\
-Hungarian Academy of Sciences, Budapest, Hungary\\[15pt]
-Currently at \\Department of Medical Genetics, \\
-University of Lausanne, Lausanne, Switzerland\\
-}
-
-\newpage
-\stitle{Outline}
-
-\begin{enumerate}
-{\centering
-\item The igraph R package\par
-\item What can you do with large graphs?\par
-\item Some unique igraph features\par
-\item Rapid prototyping\par
-}
-\end{enumerate}
-
-\newpage
-\stitle{The \emph{igraph} software package}
-
-\begin{itemize}
-\item R package, Python extension and C library. \pause
-\item Under active development. \pause
-\item Free for academic and commercial use (GPL). ``Standing on the
-  shoulder of giants.'' \pause
-\item State of the art data structures and algorithms, works well with
-  large graphs.
-\end{itemize}
-
-\newpage
-\stitle{How \emph{LARGE}?}
-
-\begin{itemize}
-\item Well, it depends what you want to calculate. \pause
-\item Just to create and manipulate it, it is enough
-  if it fits into the memory. \pause
-\item How do I know that it fits into the memory? \pause
-\item igraph (typically) needs 32 bytes per edge and 16 bytes per
-  vertex. \pause
-\item A graph with one million vertices and ten million edges needs 
-  about 320 Mbytes.
-\end{itemize}
-
-\newpage
-\stitle{Installation}
-
-\begin{Myverb}
-  install.packages("igraph")
-\end{Myverb}
-
-It is really that simple. Isn't it? \pause
-\vspace*{2cm}
-
-You might also need\vspace*{-1cm}
-\begin{Myverb}
-  install.packages("digest")
-  install.packages("rgl")
-\end{Myverb}
-
-\newpage
-\stitle{How to follow this ``lecture''?}
-\begin{enumerate}
-%\item Type 
-%\begin{Myverb}
-%  source("http://cneurocvs.rmki.kfki.hu/igraph/NIPS2008.R")
-%\end{Myverb}
-%and everything is run for you. You will see the commands on the screen
-%before R actually runs them, and you'll need to press \verb+ENTER+ to
-%proceed.\pause
-\item Go to \textcolor{red}{\url{http://cneurocvs.rmki.kfki.hu/igraph/NIPS2008.html}} and 
-  copy \& paste everything into your R session. You can skip any
-  example if you wish to.
-  \pause
-\item You type in everything I type in. \pause
-\item Sit back and watch. You can download the slides/code anyway.
-\end{enumerate}
-
-\newpage
-\stitle{The igraph data model}
-\begin{itemize}
-\item Binary relation (=\emph{edges}) between elements of a set
-  (=\emph{vertices}). \pause\\[-15pt]
-\item If the pairs are unordered, then the graph is undirected:\\[-20pt]
-
-  \begin{minipage}{0.7\textwidth}
-    \begin{align} 
-      \text{vertices} & =\{A,B,C,D,E\} \nonumber\\
-      \text{edges}    & =( \{A,B\},\{A,C\},\{B,C\},\{C,E\} ). \nonumber
-    \end{align}
-  \end{minipage}\begin{minipage}{0.3\textwidth}
-    \includegraphics[width=0.8\textwidth]{small3}
-  \end{minipage}\pause
-\item Otherwise it is directed:\\[-20pt]
-
-  \begin{minipage}{0.7\textwidth}
-    \begin{align} 
-      \text{vertices} & =\{A,B,C,D,E\} \nonumber\\
-      \text{edges}    & =( (A,B),(A,C),(B,C),(C,E) ). \nonumber
-    \end{align}
-  \end{minipage}\begin{minipage}{0.3\textwidth}
-    \includegraphics[width=0.8\textwidth]{small4}
-  \end{minipage}
-\end{itemize}
-
-\newpage
-\stitle{Vertex and edge ids}
-\begin{narrow}{0cm}{13.5cm}
-\begin{itemize}
-\item Vertices are always numbered from 0.
-\item Numbering is continual, form 0 to $n-1$. \pause
-\item We have to translate vertex names to ids: 
-\begin{align} 
-  V & =\{A,B,C,D,E\} \nonumber\\
-  E & =( (A,B),(A,C),(B,C),(C,E) ). \nonumber\\
-  A & =0, B=1, C=2, D=3, E=4. \nonumber
-\end{align}\vspace*{-2cm}\pause
-\begin{Myverb}
-  library(igraph)
-  g <- graph( c(0,1, 0,2, 1,2, 2,4), n=5 )
-  g
-  g2 <- graph( c(0,1, 0,2, 1,2, 2,4), 
-               n=5, dir=FALSE )
-  g2
-\end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Working with igraph graphs}
-\begin{Myverb}
-  ## How to decide what kind of object a variable refers to
-  class(g2)
-  class(1)
-  class("foobar")
-
-  ## Is this object an igraph graph?
-  is.igraph(g)
-  is.igraph(1:10)
-
-  ## Summary, number of vertices, edges
-  summary(g)
-  vcount(g)
-  ecount(g)
-
-  ## Is the graph directed?
-  is.directed(g)
-  is.directed(g2)
-  is.directed(1:10)
-\end{Myverb}
-
-\newpage
-\stitle{Working with igraph graphs}
-\begin{Myverb}
-  ## Convert from directed to undirected
-  as.undirected(g)
-
-  ## And back
-  as.directed(as.undirected(g))
-\end{Myverb}
-
-\newpage
-\stitle{The igraph data model, multiple edges}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \igraph can handle multi-graphs:
-  \begin{align} 
-    V & =\{A,B,C,D,E\} \nonumber\\
-    E & =( (AB),(AB),(AC),(BC),(CE) ). \nonumber
-  \end{align}
-  \begin{Myverb}
-  g <- graph( c(0,1,0,1, 0,2, 1,2, 3,4), n=5 )
-  g
-  \end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{The igraph data model, loop edges}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \igraph can handle loop-edges:
-  \begin{align} 
-    V & =\{A,B,C,D,E\} \nonumber\\
-    E & =( (AA),(AB),(AC),(BC),(CE) ). \nonumber
-  \end{align}
-  \begin{Myverb}
-  g <- graph( c(0,0,0,1, 0,2, 1,2, 3,4), n=5 )
-  g
-  \end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{The igraph data model, what cannot be represented}
-\begin{itemize}
-\item ``Mixed'' graphs, with undirected and directed edges.
-\item Hypergraphs.
-\item No direct support for bipartite (two-mode) graphs.
-\end{itemize}
-
-% \newpage
-% \stitle{Creating graphs, using vertex ids}
-% \begin{narrow}{0cm}{15cm}
-% \end{narrow}
-
-\newpage
-\stitle{Naming vertices}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  g <- graph.ring(10)
-  V(g)$name <- letters[1:10]
-  V(g)$name
-  g
-  print(g, v=T)
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Creating graphs, the formula interface}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  # A simple undirected graph
-  g <- graph.formula( Alice-Bob-Cecil-Alice, 
-       Daniel-Cecil-Eugene, Cecil-Gordon )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # Another undirected graph, ":" notation
-  g2 <- graph.formula( Alice-Bob:Cecil:Daniel, 
-       Cecil:Daniel-Eugene:Gordon )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # A directed graph
-  g3 <- graph.formula( Alice +-+ Bob --+ Cecil 
-      +-- Daniel, Eugene --+ Gordon:Helen )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # A graph with isolate vertices
-  g4 <- graph.formula( Alice -- Bob -- Daniel, 
-      Cecil:Gordon, Helen )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # "Arrows" can be arbitrarily long
-  g5 <- graph.formula( Alice +---------+ Bob )
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Creating graphs, from edge lists and adjacency matrices}
-\begin{Myverb}
-  ## From edge lists
-  el <- cbind( c(0, 0, 1, 2),
-               c(1, 2, 2, 4) )
-  g <- graph.edgelist(el)
-  g
-
-  ## Symbolic edge lists
-  el <- cbind( c("Alice", "Alice", "Bob",   "Cecil"),
-               c("Bob",   "Cecil", "Cecil", "Ed") )
-  g <- graph.edgelist(el)
-  g
-  summary(g)
-
-  ## Adjacency matrices
-  A <- matrix(sample(0:1, 100, rep=TRUE), 10, 10)
-  g <- graph.adjacency(A)
-\end{Myverb}
-
-\newpage
-\stitle{Creating graphs, from data frames}
-%% Here we start the example from Fowler's paper
-%% use the new version of graph.data.frame and read.csv
-
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-  vertices <- read.csv("judicial.csv")
-  edges <- read.table("allcites.txt")
-  jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Visualizing graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \verb+plot+ Uses traditional R graphics, non-interactive, 2d.
-  Publication quality plots in all formats R supports. \pause
-\begin{Myverb}
-  g <- barabasi.game(100, m=1)
-  g <- simplify(g)
-  igraph.par("plot.layout", 
-             layout.fruchterman.reingold)
-  plot(g, vertex.size=3, vertex.label=NA, 
-       edge.arrow.size=0.6)
-\end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Visualizing graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \verb+tkplot+ Uses Tcl/Tk via the \verb+tcltk+ package, 
-  interactive, 2d. \pause
-\begin{Myverb}
-  id <- tkplot(g, vertex.size=3, vertex.label=NA, 
-        edge.arrow.size=0.6)
-  coords <- tkplot.getcoords(id)
-\end{Myverb}
-\pause
-\item \verb+rglplot+ Needs the \verb+rgl+ package. \pause
-\begin{Myverb}
-  rglplot(g, vertex.size=3, vertex.label=NA)
-
-  coords <- layout.kamada.kawai(g, dim=3)
-  rglplot(g, vertex.size=3, vertex.label=NA, 
-          layout=coords)
-\end{Myverb}
-\pause
-\item (Almost) identical interfaces.
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph/vertex/edge attributes}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Assigning/querying attributes:
-  {\small
-    \texttt{set.graph.attribute},~\texttt{get.graph.attribute},
-    \texttt{set.vertex.attribute},~\texttt{get.vertex.attribute},  
-    \texttt{set.edge.attribute},~\texttt{get.edge.attribute},
-    \texttt{list.graph.attributes},
-    \texttt{list.vertex.attributes},
-    \texttt{list.edge.attributes}.
-} \pause
-\item \verb+V(g)+ and \verb+E(g)+. \pause
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph/vertex/edge attributes}
-\begin{Myverb}
-  ## Load the jurisdiction network
-  load("judicial.Rdata.gz")
-
-  ## If we don't have it then create it again
-  if (!exists("jg")) \{
-    source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-    vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")
-    edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")
-    jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-  \}
-\end{Myverb}
-
-\newpage
-\stitle{Graph/vertex/edge attributes}
-\begin{Myverb}
-  ## What do we have?
-  summary(jg)
-  V(jg)$year
-  V(jg)$parties
-
-  ## Select vertices based on attributes
-  V(jg) [ year >= 1990 ]
-  V(jg) [ overruled!=0 ]
-
-  ## Group network measures based on attributes
-  deg.per.year <- tapply(degree(jg, mode="out"), 
-                  V(jg)$year, mean)
-
-  ## Plot it
-  plot( names(deg.per.year), deg.per.year )
-\end{Myverb}
-
-\newpage
-\stitle{Smart indexing}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Easy access of attributes:
-  \begin{Myverb}
-  g <- erdos.renyi.game(100, 1/100)
-  V(g)$color <- sample( c("red", "black"), 
-                          vcount(g), rep=TRUE)
-  E(g)$color <- "grey"
-  red <- V(g)[ color == "red" ]
-  bl <- V(g)[ color == "black" ]
-  E(g)[ red %--% red ]$color <- "red"
-  E(g)[ bl  %--% bl ]$color <- "black"
-  plot(g, vertex.size=5, layout=
-         layout.fruchterman.reingold)
-\end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Centrality, the network}
-\begin{Myverb}
-  g <- graph.formula( Andre----Beverly:Diane:Fernando:Carol,
-                      Beverly--Andre:Diane:Garth:Ed,
-                      Carol----Andre:Diane:Fernando,
-                      Diane----Andre:Carol:Fernando:Garth:Ed:Beverly,
-                      Ed-------Beverly:Diane:Garth,
-                      Fernando-Carol:Andre:Diane:Garth:Heather,
-                      Garth----Ed:Beverly:Diane:Fernando:Heather,
-                      Heather--Fernando:Garth:Ike,
-                      Ike------Heather:Jane,
-                      Jane-----Ike )
-  g <- simplify(g)
-  coords <- c(5,5,119,256,119,256,120,340,478,
-      622,116,330,231,116,5,330,451,231,231,231)
-  coords <- matrix(coords, nc=2)
-  V(g)$label <- V(g)$name
-  g$layout <- coords # $
-  plot(g, asp=FALSE, vertex.label.color="blue", vertex.label.cex=1.5,
-       vertex.label.font=2, vertex.size=20, vertex.color="white",
-       vertex.frame.color="white", edge.color="black")  
-\end{Myverb}
-
-\newpage
-\stitle{Centrality, the network}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\end{center}    
-
-\newpage
-\stitle{Centrality, degree}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Number of adjacent edges.
-\end{center}
-
-\newpage
-\stitle{Centrality, degree}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-degree}
-\par Number of adjacent edges.
-\end{center}
-
-\newpage
-\stitle{Centrality, closeness}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Reciproc of the average distance to other vertices.
-\end{center}
-
-\newpage
-\stitle{Centrality, closeness}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-closeness}
-\par Reciproc of the average distance to other vertices.
-\end{center}
-
-\newpage
-\stitle{Centrality, betweenness}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Number of shortest paths going through a vertex.
-\end{center}
-
-\newpage
-\stitle{Centrality, betweenness}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-betweenness}
-\par Number of shortest paths going through a vertex.
-\end{center}
-
-\newpage
-\stitle{Centrality, eigenvector centrality}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Number of adjacent edges, weighted by their ``goodness''.
-\end{center}
-
-\newpage
-\stitle{Centrality, eigenvector centrality}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-evcent}
-\par Number of adjacent edges, weighted by their ``goodness''.
-\end{center}
-
-\newpage
-\stitle{Centrality, Burt's constraint}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Benefit of brokering between other actors.
-\end{center}
-
-\newpage
-\stitle{Centrality, Burt's constraint}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-constraint}
-\par Benefit of brokering between other actors.
-\end{center}
-
-% \newpage
-% \stitle{Centrality, information centrality}
-% \begin{center}
-% \includegraphics[width=0.8\textwidth]{centnet}
-% \end{center}
-
-% \newpage
-% \stitle{Centrality, information centrality}
-% \begin{center}
-% \includegraphics[width=0.8\textwidth]{centnet-infocent}
-% \end{center}
-
-\newpage
-\stitle{Centrality, transitivity}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Are my friends also friends of each other?
-\end{center}
-
-\newpage
-\stitle{Centrality, transitivity}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet-trans}
-\par Are my friends also friends of each other?
-\end{center}
-
-\newpage
-\stitle{Sensitivity of centrality measures}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{centnet}
-\par Remove two random edges, add two random edges.
-\end{center}
-
-\newpage
-\stitle{Sensitivity of centrality measures}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  cl <- numeric()
-  for (i in 1:100) \{ 
-    g2 <- delete.edges(g, sample(ecount(g), 2)-1)
-    g2 <- g2 %u% 
-       random.graph.game(vcount(g), 2, type="gnm")
-    cl <- cbind(cl, betweenness(g2))
-  \}
-  cl <- as.data.frame(t(cl))
-  colnames(cl) <- V(g)$name  # $
-  boxplot(cl, main="Sensitivity of betweenness")
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Sensitivity of centrality measures}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{boxplot}
-\end{center}
-
-\newpage
-\stitle{Working with a (moderately) large graph}
-\begin{Myverb}
-  library(igraph)
-  
-  ## Load the jurisdiction network
-  load("judicial.Rdata.gz")
-  
-  ## If we don't have it then create it again
-  if (!exists("jg")) \{
-    source("http://cneurocvs.rmki.kfki.hu/igraph/plus.R")
-    vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")
-    edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")
-    jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-  \}
-  
-  ## Basic data
-  summary(jg)
-  
-  ## Is it a simple graph?
-  is.simple(jg)
-\end{Myverb}  
-
-\newpage
-\stitle{Working with a (moderately) large graph}
-\begin{Myverb}
-  ## Is it connected?
-  is.connected(jg)
-  
-  ## How many components?
-  no.clusters(jg)
-
-  ## How big are these?
-  table(clusters(jg)$csize)   #$
-  
-  ## In-degree distribution
-  plot(degree.distribution(jg, mode="in"), log="xy")
-  
-  ## Out-degree distribution
-  plot(degree.distribution(jg, mode="out"), log="xy")
-  
-  ## Largest in- and out-degree, total degree
-  max(degree(jg, mode="in"))
-  max(degree(jg, mode="out"))
-  max(degree(jg, mode="all"))
-\end{Myverb}  
-
-\newpage
-\stitle{Working with a (moderately) large graph}
-\begin{Myverb}  
-  ## Density
-  graph.density(jg)
-  
-  ## Transitivity
-  transitivity(jg)
-  
-  ## Transitivity of a random graph of the same size
-  g <- erdos.renyi.game(vcount(jg), ecount(jg), type="gnm")
-  transitivity(g)
-  
-  ## Dyad census
-  dyad.census(jg)
-  
-  ## Triad census
-  triad.census(jg)
-  \end{Myverb}  
-
-\newpage
-\stitle{Working with a (moderately) large graph}
-\begin{Myverb}  
-  ## Authority and Hub scores
-  authority.score(jg)$vector
-  cor(authority.score(jg)$vector, V(jg)$auth)
-  
-  hub.score(jg)$vector
-  cor(hub.score(jg)$vector, V(jg)$hub)
-\end{Myverb} 
-
-\newpage
-\stitle{Big table of ``what can be run''}
-
-\renewcommand{\arraystretch}{1.7}
-\begin{tabularx}{\textwidth}{l|X}
-Fast (millions) & creating graphs (most of the time) \bull
-       structural modification (add/delete edges/vertices) \bull 
-       subgraph \bull simplify \bull graph.decompose \bull 
-       degree \bull clusters \bull graph.density \bull is.simple,
-       is.loop, is.multiple \bull articulation points and biconnected
-       components \bull ARPACK stuff: page.rank, hub.score,
-       authority.score, evcent \bull transitivity \bull Burt's
-       constraint \bull dyad \& triad census, graph motifs \bull
-       $k$-cores \bull MST \bull reciprocity \bull modularity \bull
-       closeness and (edge) betweenness \it{estimation} \bull shortest
-       paths from one source \bull generating $G_{n,p}$ and $G_{n,m}$
-       graphs \bull generating PA graphs with various PA exponents
-       \bull topological sort \\
-\hline
-Slow (10000) & closeness \bull diameter \bull betweenness \bull all-pairs
-       shortest paths, average path length \bull most layout
-       generators \bull \\
-\hline
-Very slow (100) & cliques \bull cohesive blocks \bull edge/vertex
-            connectivity \bull maximum flows and minimum cuts \bull 
-            bonpow \bull alpha centrality \bull (sub)graph isomorphism\\
-\end{tabularx}
-
-\newpage
-\stitle{Why is igraph sooooo slow?}
-
-\begin{tabularx}{\textwidth}{X|l}
-cliques and independent vertex sets & Hard problem \\
-\hline
-cohesive blocks                     & Semi-hard problem \\
-\hline
-edge/vertex connectivity, maximum flows and minimum cuts & Semi-hard
-                                      problem \\
-\hline
-Bonacich's power centrality, alpha centrality & Poor implementation \\
-\hline
-(sub)graph isomorphism & Hard problem \\
-\hline
-\emph{anything else} & \emph{contact us if you want to speed it up} \\
-\end{tabularx}
-
-% \newpage
-% \stitle{Generating random graphs}
-%% TODO
-
-\newpage
-\stitle{Connection to other network/graph software}
-\begin{itemize}
-\item \texttt{sna} and \texttt{network} R packages. Currently throught
-  adjacency matrices. Use namespaces!\pause
-\item Pajek. \texttt{.net} file format is supported. \pause
-\begin{Myverb}
-  g <- read.graph("http://vlado.fmf.uni-lj.si/pub/networks/data/", 
-       format="pajek")
-\end{Myverb}
-\pause
-\item Visone. Use GraphML format. \pause
-\item Cytoscape. Use GML format. \pause
-\item GraphViz. igraph can write \texttt{.dot} files. \pause
-\item In general. The \emph{GraphML} and \emph{GML} file formats 
-  are fully supported, many programs can read/write these.
-\end{itemize}
-
-\newpage
-\stitle{Community structure detection}
-\begin{center}
-\includegraphics[width=0.7\textwidth]{communities}\\
-\small(Modularity and community structure in networks, by Mark Newman,
-2006)
-\end{center}
-
-\newpage
-\stitle{Modularity score}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item How to define what is modular? Many proposed definitions, here
-  is a popular one:
-  \[ Q = \frac1{2|E|}\sum_{vw} [A_{vw} - p_{vw} ]\delta(c_v,c_w). \] \pause
-\item Random graph null model: 
-  \[ p_{vw} = p = \frac{1}{|V|(|V|-1)} \] \pause
-\item Degree sequence based null model:
-  \[ p_{vw} = \frac{k_vk_w}{2|E|} \]
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{``Fast-greedy'' algorithm}
-\begin{center}
-A Clauset, MEJ Newman, C Moore: Finding community structure in very
-large networks, \url{http://www.arxiv.org/abs/cond-mat/0408187}\\
-\includegraphics[width=0.75\textwidth]{dend}
-\end{center}
-
-\newpage
-\stitle{``Spinglass'' algorithm}
-\begin{center}
-J. Reichardt and S. Bornholdt: Statistical Mechanics of Community
-Detection, Phys. Rev. E, 74, 016110 (2006),
-\url{http://arxiv.org/abs/cond-mat/0603718}
-\includegraphics[width=0.42\textwidth]{spinglass1}\hfil%
-\includegraphics[width=0.42\textwidth]{spinglass2}
-\end{center}
-
-\newpage
-\stitle{Cohesive blocks}
-
-\begin{itemize}
-\item `Structural Cohesion and Embeddedness: a Hierarchical
-Concept of Social Groups' by J.Moody and D.White, Americal
-Sociological Review, 68, 103--127, 2003 \pause
-\item Definition 1: A collectivity is structurally cohesive to the extent
-  that the social relations of its members hold it together.  \pause
-\item Definition 2: A group is structurally cohesive to the extent that
-  multiple independent relational paths among all pairs of members hold
-  it together. \pause
-\item Vertex-independent paths and vertex connectivity. \pause
-\item Vertex connectivity and network flows.
-\end{itemize}
-
-\newpage
-\stitle{Cohesive blocks}
-\vspace*{-3cm}
-{\centering
-\includegraphics[width=0.9\textwidth]{groups}\\
-}
-
-\newpage
-\stitle{Cohesive blocks}
-\includegraphics[width=0.6\textwidth]{cblocks}\\
-
-\newpage
-\stitle{Cohesive blocks}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  cb <- graph( c(1,2,1,3,1,4,1,5,1,6,
-                2,3,2,4,2,5,2,7,
-                3,4,3,6,3,7,
-                4,5,4,6,4,7,
-                5,6,5,7,5,21,
-                6,7,
-                7,8,7,11,7,14,7,19,
-                8,9,8,11,8,14,
-                9,10,
-                10,12,10,13,
-                11,12,11,14,
-                12,16, 13,16, 14,15, 15,16,
-                17,18,17,19,17,20,
-                18,20,18,21,
-                19,20,19,22,19,23,
-                20,21, 21,22,21,23,
-                22,23)-1, dir=FALSE)
-
-  V(cb)$label <- seq(vcount(cb))  # $
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Cohesive blocks}
-\includegraphics[width=0.6\textwidth]{cblocks}\\
-
-\newpage
-\stitle{Cohesive blocks}
-\begin{Myverb}
-  blocks <- cohesive.blocks(cb)
-  blocks
-
-  summary(blocks)
-  blocks$blocks
-  lapply(blocks$blocks, "+", 1)
-  blocks$block.cohesion #$
-  plot(blocks, layout=layout.kamada.kawai,
-       vertex.label.cex=2, vertex.size=15,
-       vertex.label.color="black")
-\end{Myverb}
-   
-\newpage
-\stitle{Rapid prototyping}
-\begin{narrow}{0cm}{15cm}
-Weighted transitivity
-\[ c(i)=\frac{\mathbf{A}^3_{ii}}{(\mathbf{A1A})_{ii}} \] \pause
-\[ c_w(i)=\frac{\mathbf{W}^3_{ii}}{(\mathbf{WW_{\text{max}}W})_{ii}} \] \pause
-\begin{Myverb}
-  wtrans <- function(g) \{
-    W <- get.adjacency(g, attr="weight")
-    WM <- matrix(max(W), nrow(W), ncol(W))
-    diag(WM) <- 0
-    diag( W %*% W %*% W ) / 
-       diag( W %*% WM %*% W)
-  \}
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Rapid prototyping}
-\begin{narrow}{0cm}{15cm}
-Clique percolation, 
-Palla et al., Nature 435 814--818, 2005\\
-\includegraphics[width=\linewidth]{vicsek}
-\end{narrow}
-
-\newpage
-\stitle{Rapid prototyping, clique percolation}
-\begin{narrow}{0cm}{15cm}
-\vspace*{-10pt}
-\begin{Myverb}
-  clique.community <- function(graph, k) \{
-   clq <- cliques(graph, min=k, max=k)
-   edges <- c()
-   for (i in seq(along=clq)) \{
-     for (j in seq(along=clq)) \{
-       if ( length(unique(c(clq[[i]], 
-             clq[[j]]))) == k+1 ) \{
-         edges <- c(edges, c(i,j)-1)
-       \}
-     \}
-   \}
-   clq.graph <- simplify(graph(edges))
-   V(clq.graph)$name <- 
-      seq(length=vcount(clq.graph))
-   comps <- decompose.graph(clq.graph)
-   
-   lapply(comps, function(x) \{
-     unique(unlist(clq[ V(x)$name ]))
-   \})
-  \}
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\cstitle{Acknowledgement}
-
-\begin{center}
-\vfill
-Tam\'as Nepusz\par\vfil
-Peter McMahan, the BLISS, Walktrap and Spinglass projects\par\vfil
-All the people who contributed code, sent bug reports, suggestions\par\vfil
-The R project\par\vfil
-Hungarian Academy of Sciences\par\vfil
-The OSS community in general\par\vfill
-\end{center}
-
-\newpage
-\cstitle{More information}
-\begin{center}
-\vfill
-\centerline{\LARGE\url{http://igraph.sf.net}}\par\vspace*{3cm}
-Please send your comments, questions, feature requests, code (!) to the
-\url{igraph-help} mailing list. (See \textit{Community} on the
-homepage.)\par\vfill
-\end{center}
-
-\end{document}
- 
\ No newline at end of file
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/small3.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/small3.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/small4.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/small4.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/spinglass1.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/spinglass1.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/spinglass2.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/spinglass2.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/nips08/vicsek.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/nips08/vicsek.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/unil2009/abstract.txt igraph-0.6.5/doc/presentations/unil2009/abstract.txt
--- igraph-0.6.5~quantal1/doc/presentations/unil2009/abstract.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/unil2009/abstract.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-Social network analysis with R and the igraph package
-
-Social network analysis is a discipline that emphasizes the
-relationship of the actors in social systems, over their individual
-properties.
-
-GNU R is a cross-platform, open source statistical software
-package. It is a de facto standard for statistical software
-development and data analysis. Igraph is an extension package to GNU
-R, and implements several (social) network analysis methods. 
-
-This three hours workshop has four main parts. The first part is
-a crash-course to GNU R and igraph. The second part addresses the
-problem of small world networks; the third deals with network
-centrality, finding the key influential actors in social networks. 
-Finally, the fourth part discusses methods for finding
-communities, building blocks in networks. 
-
-All three problems are presented interactively, using various data
-sets. You are encouraged to take your laptop with you or use the
-desktop computers in the room. Please install R and the igraph package
-on your laptop before the workshop; the desktop computers have
-all the necessary software pre-installed. Please contact the
-organizers if you have problems installing R or igraph.
-
-Basic statistics and graph theory background is expected from the
-participants. 
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/Libxml2-Logo-180x168.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/Libxml2-Logo-180x168.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/user2008/Makefile igraph-0.6.5/doc/presentations/user2008/Makefile
--- igraph-0.6.5~quantal1/doc/presentations/user2008/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/user2008/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-SOURCE=csardi
-
-all: csardi-final.pdf
-
-ALLSVG = arch.pdf orgnet.pdf er.pdf ba.pdf attr.pdf \
-	 plot.pdf indd.pdf outdd.pdf schema.pdf igraph1.pdf \
-	 igraph2.pdf igraph3.pdf igraph11.pdf igraph0.pdf \
-	 mixed.pdf hyper.pdf bipartite.pdf transitivity.pdf \
-	 g1.pdf g2.pdf g3.pdf g4.pdf g5.pdf g6.pdf g7.pdf \
-	 g8.pdf
-
-OTHER = igraph.pdf
-
-ALLPNG = jgplot.png rglplot.png source_c.png source_cpp.png \
-         Rlogo-2.png Libxml2-Logo-180x168.png gmplogo2.png \
-	 hist3d_2lights.jpg logo125.png SQLite.png hash_small.png \
-	 matrix.jpg tkplot.png
-
-csardi.pdf: csardi.tex $(ALLSVG) $(ALLPNG) $(OTHER)
-	pdflatex csardi.tex
-
-csardi-final.pdf: csardi.pdf
-	ppower4 csardi.pdf csardi-final.pdf
-
-igraph.pdf : igraph.svg
-	inkscape $< -A $@
-
-%.pdf : %.svg.gz
-	gzip -dc $< > $(*F).svg
-	inkscape $(*F).svg -A $@
-	rm $(*F).svg
-
-clean : 
-	rm -rf $(ALLSVG) igraph.pdf csardi-final.pdf csardi.aux \
-	csardi.log csardi.pdf
-
-.PHONY: clean
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/Rlogo-2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/Rlogo-2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/SQLite.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/SQLite.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/arch.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/arch.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/attr.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/attr.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/ba.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/ba.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/bipartite.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/bipartite.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/user2008/csardi.tex igraph-0.6.5/doc/presentations/user2008/csardi.tex
--- igraph-0.6.5~quantal1/doc/presentations/user2008/csardi.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/user2008/csardi.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,842 +0,0 @@
-\documentclass[landscape]{foils}
-
-\usepackage{ae}
-%\usepackage{hyperref}
-%\usepackage{thumbpdf}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage[left=1cm,right=1cm,top=2cm,bottom=2cm]{geometry}
-\usepackage{ragged2e}
-\usepackage{amstext}
-\usepackage{xspace}
-\usepackage{fancyvrb}
-\usepackage{amsmath}
-\usepackage{url}
-\usepackage{tabularx}
-\usepackage{pause}
-
-\newcommand{\stitle}[1]{{\centering\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-\newcommand{\cstitle}[1]{{\centering\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-
-\setlength{\columnsep}{0.5cm}
-\setlength{\columnseprule}{0.4pt}
-
-\renewcommand{\emph}[1]{\textcolor{red}{\bf #1}}
-
-\newcommand{\igraph}{\texttt{{igraph}}\xspace}
-
-\DefineVerbatimEnvironment{Myverb}{Verbatim}
-{numbers=left,numbersep=5mm,frame=lines,fontsize=\small}
-
-\newenvironment{narrow}[2]{%
-  \begin{list}{}{%
-      \setlength{\topsep}{0pt}%
-      \setlength{\leftmargin}{#1}%
-      \setlength{\rightmargin}{#2}%
-      \setlength{\listparindent}{\parindent}%
-      \setlength{\itemindent}{\parindent}%
-      \setlength{\parsep}{\parskip}}%
-    \item[]}{\end{list}}
-
-\newcommand{\bull}{$\bullet$\xspace}
-
-\newcommand{\command}[1]{\textcolor{red}{#1}}
-\newcommand{\comment}[1]{\textcolor{blue}{#1}}
-
-\begin{document}
-
-\RaggedRight
-% \color{white}
-% \pagecolor{black}
-\fvset{fontsize=\small}
-\fvset{commandchars=\\\{\}}
-\definecolor{grey}{gray}{0.75}
-\fvset{frame=single, numbers=left, rulecolor=\color{grey}}
-
-\MyLogo{\color{black}igraph -- a package for network analysis}
-
-\thispagestyle{empty}
-\vspace*{1cm}
-{\centering
-\hrule
-\Large
-\vspace*{1cm}
-{\bf \textcolor{red}{igraph} -- a package for network analysis}
-\vspace*{1cm}
-\par
-\hrule
-\par
-\vspace*{4cm}
-\normalsize\textcolor{blue}{G\'abor Cs\'ardi}\\
-\small \textcolor{blue}{\texttt{Gabor.Csardi@unil.ch}}
-\par
-\vspace*{1.5cm}
-Department of Medical Genetics, \\
-University of Lausanne, Lausanne, Switzerland\\
-}
-
-\newpage
-
-\stitle{Outline}
-
-% Outline:
-\begin{enumerate}
-\centering\Large
-\vfill
-\item Why another graph package?\\
-\vfill
-\item igraph architecture, data model and data representation\\
-\vfill
-\item Manipulating graphs\\
-\vfill
-\item Features and their time complexity\\
-\vfill
-\mbox{}
-\vfill
-\end{enumerate}
-
-\newpage
-\stitle{Why another graph package?}
-\begin{itemize}
-\item \texttt{graph} is slow. \texttt{RBGL} is slow, too.
-\marginpar{\vspace*{3.5cm}}
-\marginpar{\hspace*{-8cm}\includegraphics{transitivity}}
-\begin{Myverb}
-> \command{ba2}\comment{                                # graph \& RBGL}
-\slshape A graphNEL graph with undirected edges
-\slshape Number of Nodes = 100000 
-\slshape Number of Edges = 199801  \pause
-> \command{system.time(RBGL::transitivity(ba2))}
-\slshape    user  system elapsed 
-\slshape   7.517   0.000   7.567 \pause
-> \command{summary(ba)}\comment{                        # igraph}
-\slshape Vertices: 1e+05 
-\slshape Edges: 199801 
-\slshape Directed: FALSE 
-\slshape No graph attributes.
-\slshape No vertex attributes.
-\slshape No edge attributes. \pause
-> \command{system.time(igraph::transitivity(ba))}
-\slshape    user  system elapsed 
-\slshape   0.328   0.000   0.335 
-\end{Myverb}
-\end{itemize}
-
-\newpage
-\stitle{Why another graph package?}
-\begin{itemize}
-\item \texttt{sna} is slow. \texttt{network} is slow, too.
-\begin{Myverb}
-> \command{net2}\comment{                                  # SNA \& network}
-\slshape  Network attributes:
-\slshape   vertices = 1e+05 
-\slshape   directed = TRUE 
-\slshape   hyper = FALSE 
-\slshape   loops = FALSE 
-\slshape   multiple = FALSE 
-\slshape   bipartite = FALSE 
-\slshape   total edges= 199801 
-\slshape     missing edges= 0 
-\slshape     non-missing edges= 199801 
-\slshape ... \pause
-> \command{gtrans(net2)}
-\slshape Error in matrix(0, nr = network.size(x), nc = network.size(x)) : 
-\slshape   too many elements specified
-\end{Myverb}
-\end{itemize}
-
-\newpage
-\stitle{Why another graph package?}
-\begin{itemize}
-\item \texttt{graph} is slow. \texttt{RBGL} is slow, too.
-\item \texttt{sna} is slow. \texttt{network} is slow, too.
-\item A generic solution was needed, i.e. a common C layer, that 
-  can be interfaced from C/C++, R, Python, etc.
-\end{itemize} \pause
-\begin{center}
-\includegraphics[width=0.8\textwidth]{schema}
-\end{center}
-
-\newpage
-\stitle{The igraph architecture}
-\begin{center}
-\vspace*{-2cm}
-\includegraphics[width=0.8\textwidth]{arch}
-\end{center}
-
-\newpage
-\stitle{Dependencies}
-\begin{itemize}
-% TODO: better look, e.g. add logos
-\item Standard C/C++ libraries. 
-  \marginpar{\vspace*{-1.5cm}}
-  \marginpar{\hspace*{-6.5cm}%
-    \includegraphics[width=3cm]{source_c}%
-    \includegraphics[width=3cm]{source_cpp}%
-%    \includegraphics[width=3cm]{gccegg-65}%
-  }\\[-10pt]\pause
-\item \texttt{stats} package, this is part of \texttt{base}.
-  \marginpar{\vspace*{0.3cm}}
-  \marginpar{\hspace*{-4cm}\mbox{ }%
-    \includegraphics[width=3cm]{Rlogo-2}}\\[-10pt]\pause
-\item Optional: \texttt{libxml2} library, for reading \\ GraphML files
-  (included in Windows builds).
-  \marginpar{\vspace*{-2.3cm}}
-  \marginpar{\hspace*{-8.5cm}%
-    \includegraphics[width=4.5cm]{Libxml2-Logo-180x168}
-  }\\[-10pt]\pause
-\item Optional: GMP library, graph automorphisms\\
-  (not included in Windows builds). 
-  \marginpar{\vspace*{-1.5cm}}
-  \marginpar{\hspace*{-6cm}%
-    \includegraphics[width=5.5cm]{gmplogo2}
-  }\\[-10pt]\pause
-\item Suggested packages: \texttt{stats4}, \texttt{rgl}, 
-  \texttt{tcltk}, \texttt{RSQLite},\\
-  \texttt{digest}, \texttt{graph},
-  \texttt{Matrix}.\\
-\begin{flushright}
-\includegraphics[width=3cm]{Rlogo-2}
-\includegraphics[width=3cm]{hist3d_2lights}
-\includegraphics[width=2cm]{logo125}
-\includegraphics[width=4cm]{SQLite}
-\includegraphics[width=2cm]{hash_small}
-\includegraphics[width=3cm]{plot}
-\includegraphics[width=3cm]{matrix}
-\end{flushright}
-\end{itemize}
-
-\newpage
-\stitle{The igraph data model, what cannot be represented}
-
-\begin{minipage}{0.6\textwidth}
-  ``Mixed'' graphs, with undirected and directed edges.
-  You can ``emulate'' them via graph attributes.
-\end{minipage}\begin{minipage}{0.3\textwidth}
-  \includegraphics[height=0.65\textwidth]{mixed}
-\end{minipage} \par \pause
-\vspace*{-1cm}
-{\raggedleft
-\begin{minipage}{0.3\textwidth}
-  \raggedleft
-  \includegraphics[height=0.65\textwidth]{hyper}
-\end{minipage}\begin{minipage}{0.6\textwidth}
-  Hypergraphs. Perhaps see the \texttt{hypergraph} package.
-\end{minipage} \par
-} \pause
-\begin{minipage}{0.6\textwidth}
-No direct support for bipartite (two-mode) graphs.\\
-  It is possible to handle them via graph attributes.
-\end{minipage}\begin{minipage}{0.3\textwidth}
-  \includegraphics[height=0.65\textwidth]{bipartite}
-\end{minipage}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph0}
-\end{center}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph1}
-\end{center}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph11}
-\end{center}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph2}
-\end{center}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph3}
-\end{center}
-
-\newpage
-\stitle{Graph representation, sparse graphs}
-
-Flat data structures, indexed edge lists. Easy to
-handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.55\textwidth]{igraph}
-\end{center}
-
-% \newpage
-% \stitle{Vertex and edge ids}
-
-\newpage
-\stitle{Creating graphs, via vertex ids}
-% TODO: plot
-\begin{Myverb}
-> \command{g <- graph( c(0,1, 1,2, 2,3, 3,4), n=6, directed=TRUE )}
-> \command{g}
-\slshape Vertices: 6 
-\slshape Edges: 4 
-\slshape Directed: TRUE 
-\slshape Edges:
-          
-\slshape [0] 0 -> 1
-\slshape [1] 1 -> 2
-\slshape [2] 2 -> 3
-\slshape [3] 3 -> 4
-\end{Myverb}
-\begin{flushright}
-\vspace*{-6cm}
-\includegraphics[width=0.45\textwidth]{g1}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, via vertex ids}
-\begin{Myverb}
-> \command{el <- cbind(0:9, 9:0)}
-> \command{g <- graph( t(el), directed=TRUE)}
-> \command{g}
-\slshape Vertices: 10 
-\slshape Edges: 10 
-\slshape Directed: TRUE 
-\slshape Edges:
-          
-\slshape [0] 0 -> 9
-\slshape [1] 1 -> 8
-\slshape [2] 2 -> 7
-\slshape [3] 3 -> 6
-\slshape [4] 4 -> 5
-\slshape [5] 5 -> 4
-\slshape [6] 6 -> 3
-\slshape [7] 7 -> 2
-\slshape [8] 8 -> 1
-\slshape [9] 9 -> 0
-\end{Myverb}
-\begin{flushright}
-\vspace*{-11.5cm}
-\includegraphics[width=0.45\textwidth]{g2}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.formula}}
-\begin{Myverb}
-\comment{# A simple undirected graph}
-> \command{g <- graph.formula( Alice-Bob-Cecil-Alice, }
-\command{       Daniel-Cecil-Eugene, Cecil-Gordon )}
-> \command{g}
-\slshape Vertices: 6 
-\slshape Edges: 6 
-\slshape Directed: FALSE 
-\slshape Edges:
-                    
-\slshape [0] Alice  -- Bob   
-\slshape [1] Bob    -- Cecil 
-\slshape [2] Alice  -- Cecil 
-\slshape [3] Cecil  -- Daniel
-\slshape [4] Cecil  -- Eugene
-\slshape [5] Cecil  -- Gordon
-\end{Myverb}
-\begin{flushright}
-\vspace*{-9.5cm}
-\includegraphics[width=0.45\textwidth]{g3}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.formula}}
-\begin{Myverb}
-\comment{# Another undirected graph, ":" notation}
-> \command{g2 <- graph.formula( Alice-Bob:Cecil:Daniel, }
-\command{        Cecil:Daniel-Eugene:Gordon )}
-> \command{g2}
-\slshape Vertices: 6 
-\slshape Edges: 7 
-\slshape Directed: FALSE 
-\slshape Edges:
-                    
-\slshape [0] Alice  -- Bob   
-\slshape [1] Alice  -- Cecil 
-\slshape [2] Alice  -- Daniel
-\slshape [3] Cecil  -- Eugene
-\slshape [4] Cecil  -- Gordon
-\slshape [5] Daniel -- Eugene
-\slshape [6] Daniel -- Gordon
-\end{Myverb}
-\begin{flushright}
-\vspace*{-10.5cm}
-\includegraphics[width=0.45\textwidth]{g4}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.formula}}
-\begin{Myverb}
-\comment{# A directed graph}
-> \command{g3 <- graph.formula( Alice +-+ Bob --+ Cecil }
-\command{        +-- Daniel, Eugene --+ Gordon:Helen )}
-> \command{g3}
-\slshape Vertices: 7 
-\slshape Edges: 6 
-\slshape Directed: TRUE 
-\slshape Edges:
-                    
-\slshape [0] Bob    -> Alice 
-\slshape [1] Alice  -> Bob   
-\slshape [2] Bob    -> Cecil 
-\slshape [3] Daniel -> Cecil 
-\slshape [4] Eugene -> Gordon
-\slshape [5] Eugene -> Helen 
-\end{Myverb}
-\begin{flushright}
-\vspace*{-9.5cm}
-\includegraphics[width=0.45\textwidth]{g5}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.formula}}
-\begin{Myverb}
-\comment{# A graph with isolate vertices}
-> \command{g4 <- graph.formula( Alice -- Bob -- Daniel, }
-\command{        Cecil:Gordon, Helen )}
-> \command{g4}
-\slshape Vertices: 6 
-\slshape Edges: 2 
-\slshape Directed: FALSE 
-\slshape Edges:
-                    
-\slshape [0] Alice  -- Bob   
-\slshape [1] Bob    -- Daniel
-> \command{V(g4)}
-\slshape Vertex sequence:
-\slshape [1] "Alice"  "Bob"    "Daniel" 
-\slshape [4] "Cecil"  "Gordon" "Helen"
-\end{Myverb}
-\begin{flushright}
-\vspace*{-9.5cm}
-\includegraphics[width=0.45\textwidth]{g6}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.formula}}
-\begin{Myverb}
-\comment{# "Arrows" can be arbitrarily long}
-> \command{g5 <- graph.formula( Alice +---------+ Bob )}
-> \command{g5}
-\slshape Vertices: 2 
-\slshape Edges: 2 
-\slshape Directed: TRUE 
-\slshape Edges:
-                  
-\slshape [0] Bob   -> Alice
-\slshape [1] Alice -> Bob  
-\end{Myverb}
-\begin{flushright}
-\vspace*{-5.5cm}
-\includegraphics[width=0.45\textwidth]{g7}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.famous}}
-\begin{Myverb}
-> \command{graph.famous("Cubical")}
-\slshape Vertices: 8 
-\slshape Edges: 12 
-\slshape Directed: FALSE 
-\slshape Edges:
-           
-\slshape [0]  0 -- 1
-\slshape [1]  1 -- 2
-\slshape [2]  2 -- 3
-\slshape [3]  0 -- 3
-\slshape [4]  4 -- 5
-\slshape [5]  5 -- 6
-\slshape [6]  6 -- 7
-\slshape [7]  4 -- 7
-\slshape [8]  0 -- 4
-\slshape [9]  1 -- 5
-\slshape [10] 2 -- 6
-\slshape [11] 3 -- 7
-\end{Myverb}
-\begin{flushright}
-\vspace*{-11.5cm}
-\includegraphics[width=0.45\textwidth]{g8}
-\end{flushright}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.data.frame}}
-\begin{Myverb}
-> \command{traits <- read.csv("traits.csv", head=F)}
-> \command{traits}
-\slshape                   V1 V2 V3
-\slshape 1     Alice Anderson 48  F
-\slshape 2       Bob Bradford 33  M
-\slshape 3       Cecil Connor 45  F
-\slshape 4      David Daugher 34  M
-\slshape 5  Esmeralda Escobar 21  F
-\slshape 6       Frank Finley 36  M
-\slshape 7         Gabi Garbo 44  F
-\slshape 8         Helen Hunt 40  F
-\slshape 9        Iris Irving 25  F
-\slshape 10       James Jones 47  M
-> \command{colnames(traits) <- c("name", "age", "gender")}
-> \command{traits[,1] <- sapply(strsplit(as.character(traits[,1]), " "), "[", 1)}
-\end{Myverb}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.data.frame}}
-\begin{Myverb}
-> \command{relations <- read.csv("relations.csv", head=F)}
-> \command{relations}
-\slshape           V1        V2 V3 V4 V5
-\slshape 1        Bob     Alice  N  4  4
-\slshape 2      Cecil       Bob  N  5  5
-\slshape 3      Cecil     Alice  Y  5  5
-\slshape 4      David     Alice  N  3  4
-\slshape 5      David       Bob  N  4  2
-\slshape 6  Esmeralda     Alice  Y  4  3
-\slshape 7      Frank     Alice  N  3  2
-\slshape 8      Frank Esmeralda  N  4  4
-\slshape 9       Gabi       Bob  Y  5  5
-\slshape 10      Gabi     Alice  N  3  0
-\slshape 11     Helen     Alice  N  4  1
-\slshape 12      Iris     Cecil  N  0  1
-\slshape ...
-> \command{colnames(relations) <- c("from", "to", "same.room", }
-\command{          "friendship", "advice")}
-\end{Myverb}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.data.frame}}
-\begin{Myverb}
-> \command{orgnet <- graph.data.frame(relations, vertices=traits)}
-> \command{summary(orgnet)}
-\slshape Vertices: 10 
-\slshape Edges: 34 
-\slshape Directed: TRUE 
-\slshape No graph attributes.
-\slshape Vertex attributes: name, age, gender.
-\slshape Edge attributes: same.room, friendship, advice.
-\end{Myverb}
-
-\newpage
-\stitle{Creating graphs, \texttt{graph.data.frame}}
-\begin{Myverb}
-> \command{plot(orgnet, layout=layout.kamada.kawai, vertex.label=V(orgnet)$name, }
-\command{    vertex.shape="rectangle", vertex.size=20, asp=FALSE)}
-\end{Myverb}
- % $
-\begin{center}
-\vspace*{-2cm}
-\includegraphics[width=0.8\textwidth]{orgnet}
-\end{center}
-
-\newpage
-\stitle{Creating graphs, random graphs}
-\begin{Myverb}
-> \command{er <- erdos.renyi.game(100, 100, type="gnm")}
-> \command{plot(er, vertex.size=5, vertex.label=NA, asp=FALSE, vertex.shape="square",}
-\command{       layout=layout.fruchterman.reingold, edge.color="black")}
-\end{Myverb}
-\begin{center}
-\vspace*{-1cm}
-\enlargethispage{2cm}
-\includegraphics[width=0.75\textwidth]{er}
-\end{center}
-
-\newpage
-\stitle{Creating graphs, random graphs}
-\begin{Myverb}
-> \command{ba <- ba.game(100, power=1, m=1)}
-> \command{plot(ba, vertex.size=3, vertex.label=NA, asp=FALSE, vertex.shape="square",}
-\command{       layout=layout.fruchterman.reingold, edge.color="black", }
-\command{       edge.arrow.size=0.5)}
-\end{Myverb}
-\begin{center}
-\vspace*{-1cm}
-\enlargethispage{2cm}
-\includegraphics[width=0.75\textwidth]{ba}
-\end{center}
-
-\newpage
-\stitle{Meta data: graph/vertex/edge attributes}
-\begin{itemize}
-\item Assigning attributes:
-  \texttt{set/get.graph/vertex/edge.attribute}. \pause
-\item \verb+V(g)+ and \verb+E(g)+. \pause
-\item Easy access of attributes:
-  \begin{Myverb}
-> \command{g <- erdos.renyi.game(30, 2/30)}
-> \command{V(g)$color <- sample( c("red", "black"), }
-\command{                        vcount(g), rep=TRUE)}
-> \command{V(g)$color}
-\slshape  [1] "red"   "black" "red"   "black" "black" "black" "red"   "red"   "red"  
-\slshape [10] "black" "black" "black" "red"   "red"   "black" "red"   "black" "black"
-\slshape [19] "red"   "red"   "black" "black" "red"   "black" "black" "red"   "black"
-\slshape [28] "black" "black" "red"  
-> \command{E(g)$color <- "grey"}
-\end{Myverb}
-% $
-\end{itemize}
-
-\newpage
-\stitle{Vertex/edge selection with attributes}
-\begin{Myverb}
-> \command{red <- V(g)[ color == "red" ]}
-> \command{bl <- V(g)[ color == "black" ]}
-> \command{E(g)[ red %--% red ]$color <- "red"}
-> \command{E(g)[ bl  %--% bl ]$color <- "black"}
-> \command{plot(g, vertex.size=5, }
-\command{       layout=layout.fruchterman.reingold, }
-\command{       vertex.label=NA)}
-\end{Myverb}
-\vspace*{-5cm}
-\begin{flushright}
-\includegraphics[width=0.45\textwidth]{attr}
-\end{flushright}
-
-\newpage
-\stitle{Visualizing graphs}
-\begin{itemize}
-\item Three functions with (almost) identical interfaces. \pause
-\item \verb+plot+ Uses traditional R graphics, non-interactive, 2d.
-  Publication quality plots in all formats R supports.
-\begin{Myverb}
-> \command{g <- barabasi.game(100, m=1)}
-> \command{igraph.par("plot.layout", }
-\command{             layout.fruchterman.reingold)}
-> \command{plot(g, vertex.size=4, vertex.label=NA, }
-\command{       edge.arrow.size=0.7, }
-\command{       edge.color="black",}
-\command{       vertex.color="red", frame=TRUE)}
-\end{Myverb}
-\end{itemize}
-\begin{flushright}
-\vspace*{-8cm}
-\includegraphics[width=0.45\textwidth]{plot}
-\end{flushright}
-
-\newpage
-\stitle{Visualizing graphs}
-\verb+tkplot+ Uses Tcl/Tk via the \verb+tcltk+ package, 
-  interactive, 2d.
-\begin{Myverb}
-> \command{id <- tkplot(g, vertex.size=4, }
-\command{        vertex.label=NA,}
-\command{        edge.color="black",}
-\command{        edge.arrow.size=0.7,}
-\command{        vertex.color="red")}
-> \command{coords <- tkplot.getcoords(id)}
-\end{Myverb}
-\begin{flushright}
-\vspace*{-6cm}
-\includegraphics{tkplot}
-\end{flushright}
-
-\newpage
-\stitle{Visualizing graphs}
-\verb+rglplot+ Needs the \verb+rgl+ package.
-\begin{Myverb}
-> \command{co <- layout.kamada.kawai(g, dim=3)}
-> \command{rglplot(g, vertex.size=5, }
-\command{           vertex.label=NA, }
-\command{           layout=co)}
-\end{Myverb}
-\begin{flushright}
-\vspace*{-6cm}
-\enlargethispage{3cm}
-\includegraphics{rglplot}
-\end{flushright}
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-> \command{vertices <- read.csv("http://cneurocvs.rmki.kfki.hu/igraph/judicial.csv")}
-> \command{edges <- read.table("http://cneurocvs.rmki.kfki.hu/igraph/allcites.txt")}
-> \command{jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)}
-> \command{summary(jg)}
-\slshape Vertices: 30288 
-\slshape Edges: 216738 
-\slshape Directed: TRUE 
-\slshape No graph attributes.
-\slshape Vertex attributes: name, usid, parties, year, overruled, overruling,
-\slshape   oxford, liihc, indeg, outdeg, hub, hubrank, auth, authrank, between, incent.
-\slshape No edge attributes.
-\end{Myverb}
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-> \command{is.connected(jg)}\comment{                   # Is it connected?}
-\slshape [1] FALSE\pause
-
-> \command{no.clusters(jg)}\comment{                    # How many components?}
-\slshape [1] 4881\pause
-
-> \command{table(clusters(jg)$csize)}\comment{          # How big are these?}
-
-\slshape     1     3     4 25389 
-\slshape  4871     8     1     1 \pause
-
-> \command{max(degree(jg, mode="in"))}\comment{         # Vertex degree}
-\slshape [1] 248
-> \command{max(degree(jg, mode="out"))}
-\slshape [1] 195
-> \command{max(degree(jg, mode="all"))}
-\slshape [1] 313
-\end{Myverb}
-%$
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-\comment{# In-degree distribution}
-> \command{plot(degree.distribution(jg, mode="in"), log="xy")}
-\end{Myverb}
-\begin{center}
-\includegraphics[width=0.7\textwidth]{indd}
-\end{center}
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-\comment{# Out-degree distribution}
-\command{plot(degree.distribution(jg, mode="out"), log="xy")}
-\end{Myverb}
-\begin{center}
-\includegraphics[width=0.7\textwidth]{outdd}
-\end{center}
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-\comment{# Taking the largest component}
-> \command{cl <- clusters(jg)}
-> \command{jg2 <- subgraph(jg, which(cl$membership == which.max(cl$csize)-1)-1)}
-> \command{summary(jg2)}
-\slshape Vertices: 25389 
-\slshape Edges: 216718 
-\slshape Directed: TRUE 
-\slshape No graph attributes.
-\slshape Vertex attributes: name, usid, parties, year, overruled, overruling, 
-\slshape    oxford, liihc, indeg, outdeg, hub, hubrank, auth, authrank, 
-\slshape    between, incent.
-\slshape No edge attributes.
-\end{Myverb}
-
-\newpage
-\stitle{Working with a somewhat bigger graph}
-\begin{Myverb}
-> \command{graph.density(jg2)}\comment{                        # Density}
-\slshape [1] 0.0003362180\pause
-
-> \command{transitivity(jg2)}\comment{                         # Transitivity}
-\slshape [1] 0.1260031\pause
-
-\comment{# Transitivity of a random graph of the same size}
-> \command{g <- erdos.renyi.game(vcount(jg2), ecount(jg2), type="gnm")}
-> \command{transitivity(g)}
-\slshape [1] 0.00064649\pause
-
-\comment{# Transitivity of a random graph with the same degrees}
-> \command{g2 <- degree.sequence.game(degree(jg2,mode="all"), method="vl")}
-> \command{transitivity(g2)}
-\slshape [1] 0.004107072
-\end{Myverb}
-
-\newpage
-\stitle{Community structure detection}
-\begin{Myverb}
-> \command{fc <- fastgreedy.community(simplify(as.undirected(jg2)))}
-> \command{memb <- community.to.membership(jg2, }
-\command{          fc$merges,}
-\command{          which.max(fc$modularity)) }
-> \command{lay <- layout.drl(jg2)}
-> \command{jg3 <- graph.empty(n=vcount(jg2))}
-> \command{colbar <- rainbow(5)}
-> \command{col <- colbar[memb$membership+1] }
-> \command{col[is.na(col)] <- "grey"}
-> \command{plot(jg3, layout=lay, vertex.size=1, }
-\command{       vertex.label=NA, asp=FALSE,}
-\command{       vertex.color=col, }
-\command{       vertex.frame.color=col)}
-\end{Myverb}
-%$
-\begin{flushright}
-\vspace*{-9.5cm}
-\includegraphics{jgplot}
-\end{flushright}
-
-\newpage
-\stitle{Functionality, what can be calculated?}
-\renewcommand{\arraystretch}{1.7}
-\begin{tabularx}{\textwidth}{l|X}
-Fast (millions) & creating graphs (most of the time) \bull
-       structural modification (add/delete edges/vertices) \bull 
-       subgraph \bull simplify \bull graph.decompose \bull 
-       degree \bull clusters \bull graph.density \bull is.simple,
-       is.loop, is.multiple \bull articulation points and biconnected
-       components \bull ARPACK stuff: page.rank, hub.score,
-       authority.score, eigenvector centrality \bull transitivity \bull Burt's
-       constraint \bull dyad \& triad census, graph motifs \bull
-       $k$-cores \bull MST \bull reciprocity \bull modularity \bull
-       closeness and (edge) betweenness \it{estimation} \bull shortest
-       paths from one source \bull generating $G_{n,p}$ and $G_{n,m}$
-       graphs \bull generating PA graphs with various PA exponents
-       \bull topological sort \\
-\hline
-Slow (10000) & closeness \bull diameter \bull betweenness \bull all-pairs
-       shortest paths, average path length \bull most layout
-       generators \bull \\
-\hline
-Very slow (100) & cliques \bull cohesive blocks \bull edge/vertex
-            connectivity \bull maximum flows and minimum cuts \bull 
-            power centrality \bull alpha centrality \bull (sub)graph isomorphism\\
-\end{tabularx}
-
-\newpage
-\stitle{Connection to other network/graph software}
-\begin{itemize}
-\item \texttt{graph} package: \texttt{igraph.to.graphNEL},
-  \texttt{igraph.from.graphNEL}. \pause
-\item Sparse matrices (\texttt{Matrix} package),
-  \texttt{get.adjacency} and \texttt{graph.adjacency} supports them. \pause
-\item \texttt{sna} and \texttt{network} R packages. Currently throught
-  adjacency matrices. Use namespaces! \pause
-\item Pajek. \texttt{.net} file format is supported. \pause
-\item Visone. Use GraphML format. \pause
-\item Cytoscape. Use GML format. \pause
-\item GraphViz. igraph can write \texttt{.dot} files. \pause
-\item In general. The \texttt{GraphML} and \texttt{GML} file formats 
-  are fully supported, many programs can read/write these.
-\end{itemize}
-
-\newpage
-\stitle{Acknowledgements}
-\begin{center}
-\setlength{\parskip}{30pt}
-\vfill
-Tam\'as Nepusz\par\vfil
-Peter McMahan, the BLISS, Walktrap, Spinglass, DrL projects\par\vfil
-All the people who contributed code, sent bug reports, suggestions\par\vfil
-The R project\par\vfil
-\end{center}
-\vfill\mbox{}\vfill
-
-\end{document}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/er.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/er.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g1.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g1.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g2.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g2.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g3.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g3.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g4.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g4.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g5.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g5.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g6.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g6.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g7.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g7.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/g8.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/g8.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/gmplogo2.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/gmplogo2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/hash_small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/hash_small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/hist3d_2lights.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/hist3d_2lights.jpg differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/hyper.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/hyper.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/user2008/igraph.svg igraph-0.6.5/doc/presentations/user2008/igraph.svg
--- igraph-0.6.5~quantal1/doc/presentations/user2008/igraph.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/user2008/igraph.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,2783 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:xlink="http://www.w3.org/1999/xlink"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   width="400"
-   height="400"
-   id="svg2"
-   sodipodi:version="0.32"
-   inkscape:version="0.46"
-   version="1.0"
-   sodipodi:docbase="/home/csardi/works/net/igraph-3/doc/presentations/wien08"
-   sodipodi:docname="igraph.svg"
-   inkscape:output_extension="org.inkscape.output.svg.inkscape">
-  <defs
-     id="defs4">
-    <inkscape:perspective
-       sodipodi:type="inkscape:persp3d"
-       inkscape:vp_x="0 : 200 : 1"
-       inkscape:vp_y="0 : 1000 : 0"
-       inkscape:vp_z="400 : 200 : 1"
-       inkscape:persp3d-origin="200 : 133.33333 : 1"
-       id="perspective448" />
-    <marker
-       inkscape:stockid="Dot_m"
-       orient="auto"
-       refY="0"
-       refX="0"
-       id="Dot_m"
-       style="overflow:visible">
-      <path
-         id="path4456"
-         d="M -2.5,-1 C -2.5,1.76 -4.74,4 -7.5,4 C -10.26,4 -12.5,1.76 -12.5,-1 C -12.5,-3.76 -10.26,-6 -7.5,-6 C -4.74,-6 -2.5,-3.76 -2.5,-1 z "
-         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none;marker-end:none"
-         transform="matrix(0.4,0,0,0.4,2.96,0.4)" />
-    </marker>
-    <marker
-       inkscape:stockid="TriangleOutM"
-       orient="auto"
-       refY="0"
-       refX="0"
-       id="TriangleOutM"
-       style="overflow:visible">
-      <path
-         id="path4420"
-         d="M 5.77,0 L -2.88,5 L -2.88,-5 L 5.77,0 z "
-         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
-         transform="scale(0.4,0.4)" />
-    </marker>
-    <clipPath
-       id="clip2">
-      <path
-         id="path2915"
-         d="M 0,0 L 145,0 L 145,361 L 0,361 L 0,0 z " />
-    </clipPath>
-    <clipPath
-       id="clip1">
-      <path
-         id="path2912"
-         d="M 0,0 L 145,0 L 145,361 L 0,361 L 0,0 z " />
-    </clipPath>
-    <clipPath
-       id="clip0">
-      <rect
-         id="rect2909"
-         height="360"
-         width="144"
-         x="0"
-         y="0" />
-    </clipPath>
-    <g
-       id="g2834">
-      <symbol
-         id="glyph0-0"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2837"
-           d="M 5.921875,-2.734375 L 6.859375,0 L 8.15625,0 L 4.96875,-9.109375 L 3.46875,-9.109375 L 0.21875,0 L 1.453125,0 L 2.40625,-2.734375 L 5.921875,-2.734375 z M 5.59375,-3.71875 L 2.703125,-3.71875 L 4.203125,-7.859375 L 5.59375,-3.71875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-1"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2840"
-           d="M 1.90625,-9.109375 L 0.84375,-9.109375 L 0.84375,0 L 1.90625,0 L 1.90625,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-2"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2843"
-           d="M 1.875,-6.546875 L 0.84375,-6.546875 L 0.84375,0 L 1.875,0 L 1.875,-6.546875 z M 1.875,-9.109375 L 0.828125,-9.109375 L 0.828125,-7.796875 L 1.875,-7.796875 L 1.875,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-3"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2846"
-           d="M 5.890625,-4.34375 C 5.84375,-4.984375 5.703125,-5.40625 5.453125,-5.765625 C 5,-6.375 4.21875,-6.734375 3.296875,-6.734375 C 1.53125,-6.734375 0.390625,-5.34375 0.390625,-3.15625 C 0.390625,-1.046875 1.515625,0.28125 3.28125,0.28125 C 4.84375,0.28125 5.84375,-0.65625 5.96875,-2.25 L 4.90625,-2.25 C 4.734375,-1.203125 4.203125,-0.671875 3.3125,-0.671875 C 2.15625,-0.671875 1.46875,-1.609375 1.46875,-3.15625 C 1.46875,-4.796875 2.15625,-5.78125 3.28125,-5.78125 C 4.15625,-5.78125 4.71875,-5.265625 4.84375,-4.34375 L 5.890625,-4.34375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-4"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2849"
-           d="M 6.40625,-2.921875 C 6.40625,-3.921875 6.34375,-4.53125 6.15625,-5.015625 C 5.71875,-6.09375 4.71875,-6.734375 3.5,-6.734375 C 1.671875,-6.734375 0.5,-5.34375 0.5,-3.1875 C 0.5,-1.03125 1.640625,0.28125 3.46875,0.28125 C 4.96875,0.28125 6.015625,-0.5625 6.28125,-1.984375 L 5.21875,-1.984375 C 4.9375,-1.125 4.34375,-0.671875 3.515625,-0.671875 C 2.84375,-0.671875 2.28125,-0.96875 1.9375,-1.53125 C 1.6875,-1.90625 1.59375,-2.28125 1.59375,-2.921875 L 6.40625,-2.921875 z M 1.609375,-3.78125 C 1.703125,-4.984375 2.4375,-5.78125 3.484375,-5.78125 C 4.515625,-5.78125 5.296875,-4.921875 5.296875,-3.84375 C 5.296875,-3.828125 5.296875,-3.796875 5.28125,-3.78125 L 1.609375,-3.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-5"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2852"
-           d="M 0.984375,0 L 5.09375,0 C 5.96875,0 6.59375,-0.234375 7.09375,-0.765625 C 7.53125,-1.234375 7.78125,-1.890625 7.78125,-2.59375 C 7.78125,-3.703125 7.28125,-4.359375 6.125,-4.8125 C 6.953125,-5.203125 7.390625,-5.875 7.390625,-6.796875 C 7.390625,-7.46875 7.140625,-8.046875 6.65625,-8.46875 C 6.1875,-8.90625 5.5625,-9.109375 4.6875,-9.109375 L 0.984375,-9.109375 L 0.984375,0 z M 2.15625,-5.1875 L 2.15625,-8.09375 L 4.40625,-8.09375 C 5.046875,-8.09375 5.40625,-8 5.71875,-7.765625 C 6.046875,-7.515625 6.21875,-7.140625 6.21875,-6.640625 C 6.21875,-6.15625 6.046875,-5.765625 5.71875,-5.515625 C 5.40625,-5.28125 5.046875,-5.1875 4.40625,-5.1875 L 2.15625,-5.1875 z M 2.15625,-1.03125 L 2.15625,-4.15625 L 4.984375,-4.15625 C 5.546875,-4.15625 5.921875,-4.03125 6.203125,-3.71875 C 6.46875,-3.4375 6.625,-3.03125 6.625,-2.59375 C 6.625,-2.15625 6.46875,-1.75 6.203125,-1.46875 C 5.921875,-1.15625 5.546875,-1.03125 4.984375,-1.03125 L 2.15625,-1.03125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-6"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2855"
-           d="M 3.40625,-6.734375 C 1.5625,-6.734375 0.453125,-5.421875 0.453125,-3.21875 C 0.453125,-1.03125 1.546875,0.28125 3.40625,0.28125 C 5.25,0.28125 6.375,-1.03125 6.375,-3.171875 C 6.375,-5.4375 5.28125,-6.734375 3.40625,-6.734375 z M 3.40625,-5.78125 C 4.59375,-5.78125 5.28125,-4.8125 5.28125,-3.1875 C 5.28125,-1.65625 4.5625,-0.671875 3.40625,-0.671875 C 2.25,-0.671875 1.53125,-1.640625 1.53125,-3.21875 C 1.53125,-4.796875 2.25,-5.78125 3.40625,-5.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-7"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2858"
-           d="M 0.671875,-9.109375 L 0.671875,0 L 1.609375,0 L 1.609375,-0.84375 C 2.109375,-0.078125 2.78125,0.28125 3.6875,0.28125 C 5.40625,0.28125 6.53125,-1.125 6.53125,-3.296875 C 6.53125,-5.421875 5.46875,-6.734375 3.734375,-6.734375 C 2.84375,-6.734375 2.203125,-6.40625 1.71875,-5.65625 L 1.71875,-9.109375 L 0.671875,-9.109375 z M 3.53125,-5.765625 C 4.703125,-5.765625 5.453125,-4.75 5.453125,-3.1875 C 5.453125,-1.703125 4.671875,-0.6875 3.53125,-0.6875 C 2.4375,-0.6875 1.71875,-1.6875 1.71875,-3.21875 C 1.71875,-4.765625 2.4375,-5.765625 3.53125,-5.765625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-8"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2861"
-           d="M 8.28125,-6.28125 C 7.90625,-8.28125 6.765625,-9.265625 4.765625,-9.265625 C 3.53125,-9.265625 2.546875,-8.875 1.875,-8.125 C 1.046875,-7.21875 0.59375,-5.921875 0.59375,-4.453125 C 0.59375,-2.953125 1.0625,-1.65625 1.921875,-0.78125 C 2.625,-0.046875 3.53125,0.28125 4.71875,0.28125 C 6.9375,0.28125 8.1875,-0.90625 8.46875,-3.328125 L 7.265625,-3.328125 C 7.15625,-2.703125 7.03125,-2.28125 6.84375,-1.90625 C 6.46875,-1.15625 5.703125,-0.734375 4.71875,-0.734375 C 2.90625,-0.734375 1.765625,-2.1875 1.765625,-4.46875 C 1.765625,-6.796875 2.859375,-8.234375 4.625,-8.234375 C 5.359375,-8.234375 6.046875,-8.015625 6.421875,-7.65625 C 6.765625,-7.34375 6.953125,-6.96875 7.09375,-6.28125 L 8.28125,-6.28125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-9"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2864"
-           d="M 1.109375,0 L 4.625,0 C 6.921875,0 8.34375,-1.71875 8.34375,-4.5625 C 8.34375,-7.390625 6.9375,-9.109375 4.625,-9.109375 L 1.109375,-9.109375 L 1.109375,0 z M 2.28125,-1.03125 L 2.28125,-8.09375 L 4.421875,-8.09375 C 6.21875,-8.09375 7.171875,-6.875 7.171875,-4.546875 C 7.171875,-2.25 6.21875,-1.03125 4.421875,-1.03125 L 2.28125,-1.03125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-10"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2867"
-           d="M 6.6875,-0.609375 C 6.578125,-0.59375 6.53125,-0.59375 6.46875,-0.59375 C 6.09375,-0.59375 5.90625,-0.78125 5.90625,-1.09375 L 5.90625,-4.953125 C 5.90625,-6.109375 5.046875,-6.734375 3.4375,-6.734375 C 2.484375,-6.734375 1.703125,-6.46875 1.265625,-5.96875 C 0.96875,-5.640625 0.84375,-5.265625 0.8125,-4.609375 L 1.859375,-4.609375 C 1.953125,-5.40625 2.421875,-5.78125 3.40625,-5.78125 C 4.34375,-5.78125 4.859375,-5.421875 4.859375,-4.796875 L 4.859375,-4.53125 C 4.859375,-4.09375 4.59375,-3.90625 3.78125,-3.796875 C 2.296875,-3.609375 2.078125,-3.5625 1.671875,-3.40625 C 0.90625,-3.09375 0.53125,-2.5 0.53125,-1.65625 C 0.53125,-0.46875 1.34375,0.28125 2.671875,0.28125 C 3.5,0.28125 4.15625,0 4.90625,-0.671875 C 4.96875,-0.015625 5.296875,0.28125 5.96875,0.28125 C 6.1875,0.28125 6.34375,0.265625 6.6875,0.171875 L 6.6875,-0.609375 z M 4.859375,-2.0625 C 4.859375,-1.71875 4.765625,-1.5 4.453125,-1.21875 C 4.03125,-0.828125 3.515625,-0.625 2.90625,-0.625 C 2.09375,-0.625 1.609375,-1.015625 1.609375,-1.671875 C 1.609375,-2.359375 2.078125,-2.71875 3.1875,-2.875 C 4.28125,-3.03125 4.515625,-3.078125 4.859375,-3.234375 L 4.859375,-2.0625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-11"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2870"
-           d="M 0.875,-6.546875 L 0.875,0 L 1.921875,0 L 1.921875,-3.609375 C 1.921875,-4.953125 2.625,-5.828125 3.703125,-5.828125 C 4.53125,-5.828125 5.046875,-5.328125 5.046875,-4.53125 L 5.046875,0 L 6.09375,0 L 6.09375,-4.953125 C 6.09375,-6.03125 5.28125,-6.734375 4.015625,-6.734375 C 3.03125,-6.734375 2.40625,-6.359375 1.84375,-5.453125 L 1.84375,-6.546875 L 0.875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-12"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2873"
-           d="M 2.28125,-4.15625 L 7.25,-4.15625 L 7.25,-5.171875 L 2.28125,-5.171875 L 2.28125,-8.09375 L 7.4375,-8.09375 L 7.4375,-9.109375 L 1.125,-9.109375 L 1.125,0 L 7.65625,0 L 7.65625,-1.03125 L 2.28125,-1.03125 L 2.28125,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-13"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2876"
-           d="M 5.46875,-4.71875 C 5.46875,-6.015625 4.609375,-6.734375 3.09375,-6.734375 C 1.578125,-6.734375 0.59375,-5.953125 0.59375,-4.734375 C 0.59375,-3.71875 1.109375,-3.21875 2.65625,-2.84375 L 3.640625,-2.609375 C 4.359375,-2.4375 4.65625,-2.171875 4.65625,-1.703125 C 4.65625,-1.09375 4.03125,-0.671875 3.125,-0.671875 C 2.5625,-0.671875 2.09375,-0.84375 1.828125,-1.109375 C 1.65625,-1.296875 1.59375,-1.484375 1.53125,-1.953125 L 0.421875,-1.953125 C 0.46875,-0.4375 1.328125,0.28125 3.03125,0.28125 C 4.6875,0.28125 5.734375,-0.53125 5.734375,-1.78125 C 5.734375,-2.765625 5.1875,-3.296875 3.890625,-3.609375 L 2.890625,-3.84375 C 2.03125,-4.046875 1.671875,-4.328125 1.671875,-4.78125 C 1.671875,-5.390625 2.21875,-5.78125 3.0625,-5.78125 C 3.90625,-5.78125 4.34375,-5.40625 4.375,-4.71875 L 5.46875,-4.71875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-14"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2879"
-           d="M 0.875,-6.546875 L 0.875,0 L 1.921875,0 L 1.921875,-4.109375 C 1.921875,-5.0625 2.609375,-5.828125 3.46875,-5.828125 C 4.234375,-5.828125 4.671875,-5.34375 4.671875,-4.515625 L 4.671875,0 L 5.71875,0 L 5.71875,-4.109375 C 5.71875,-5.0625 6.40625,-5.828125 7.265625,-5.828125 C 8.03125,-5.828125 8.46875,-5.34375 8.46875,-4.515625 L 8.46875,0 L 9.53125,0 L 9.53125,-4.90625 C 9.53125,-6.09375 8.84375,-6.734375 7.625,-6.734375 C 6.75,-6.734375 6.21875,-6.46875 5.609375,-5.734375 C 5.21875,-6.4375 4.703125,-6.734375 3.84375,-6.734375 C 2.96875,-6.734375 2.40625,-6.40625 1.84375,-5.625 L 1.84375,-6.546875 L 0.875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-15"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2882"
-           d="M 0.859375,-6.546875 L 0.859375,0 L 1.90625,0 L 1.90625,-3.40625 C 1.90625,-4.34375 2.15625,-4.953125 2.65625,-5.3125 C 2.96875,-5.546875 3.28125,-5.625 4.015625,-5.640625 L 4.015625,-6.703125 C 3.84375,-6.71875 3.75,-6.734375 3.609375,-6.734375 C 2.9375,-6.734375 2.421875,-6.34375 1.828125,-5.359375 L 1.828125,-6.546875 L 0.859375,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-16"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2885"
-           d="M 6.1875,-9.109375 L 5.15625,-9.109375 L 5.15625,-5.71875 C 4.71875,-6.390625 4.015625,-6.734375 3.140625,-6.734375 C 1.4375,-6.734375 0.328125,-5.375 0.328125,-3.28125 C 0.328125,-1.078125 1.40625,0.28125 3.171875,0.28125 C 4.078125,0.28125 4.703125,-0.046875 5.265625,-0.859375 L 5.265625,0 L 6.1875,0 L 6.1875,-9.109375 z M 3.3125,-5.765625 C 4.4375,-5.765625 5.15625,-4.765625 5.15625,-3.203125 C 5.15625,-1.6875 4.421875,-0.6875 3.328125,-0.6875 C 2.171875,-0.6875 1.40625,-1.703125 1.40625,-3.21875 C 1.40625,-4.75 2.171875,-5.765625 3.3125,-5.765625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-17"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2888"
-           d="M 2.28125,-4.15625 L 6.640625,-4.15625 L 6.640625,-5.171875 L 2.28125,-5.171875 L 2.28125,-8.09375 L 7.234375,-8.09375 L 7.234375,-9.109375 L 1.125,-9.109375 L 1.125,0 L 2.28125,0 L 2.28125,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-18"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2891"
-           d="M 8.859375,-4.8125 L 5.0625,-4.8125 L 5.0625,-3.78125 L 7.84375,-3.78125 L 7.84375,-3.53125 C 7.84375,-1.90625 6.640625,-0.734375 4.96875,-0.734375 C 4.046875,-0.734375 3.21875,-1.078125 2.671875,-1.65625 C 2.078125,-2.3125 1.71875,-3.40625 1.71875,-4.53125 C 1.71875,-6.765625 2.984375,-8.234375 4.90625,-8.234375 C 6.296875,-8.234375 7.296875,-7.53125 7.546875,-6.34375 L 8.734375,-6.34375 C 8.40625,-8.203125 7.015625,-9.265625 4.921875,-9.265625 C 3.8125,-9.265625 2.90625,-8.96875 2.203125,-8.390625 C 1.15625,-7.515625 0.546875,-6.09375 0.546875,-4.46875 C 0.546875,-1.65625 2.265625,0.28125 4.71875,0.28125 C 5.96875,0.28125 6.953125,-0.171875 7.84375,-1.15625 L 8.125,0.046875 L 8.859375,0.046875 L 8.859375,-4.8125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-19"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2894"
-           d="M 5.15625,-6.546875 L 5.15625,-5.59375 C 4.625,-6.375 3.984375,-6.734375 3.15625,-6.734375 C 1.484375,-6.734375 0.359375,-5.28125 0.359375,-3.15625 C 0.359375,-2.09375 0.65625,-1.21875 1.1875,-0.59375 C 1.671875,-0.03125 2.375,0.28125 3.0625,0.28125 C 3.890625,0.28125 4.46875,-0.0625 5.046875,-0.890625 L 5.046875,-0.546875 C 5.046875,0.34375 4.9375,0.875 4.671875,1.234375 C 4.40625,1.625 3.859375,1.84375 3.21875,1.84375 C 2.75,1.84375 2.328125,1.71875 2.03125,1.5 C 1.796875,1.3125 1.703125,1.140625 1.640625,0.75 L 0.578125,0.75 C 0.6875,1.984375 1.65625,2.71875 3.1875,2.71875 C 4.15625,2.71875 5,2.40625 5.421875,1.890625 C 5.921875,1.28125 6.109375,0.46875 6.109375,-1.078125 L 6.109375,-6.546875 L 5.15625,-6.546875 z M 3.265625,-5.78125 C 4.390625,-5.78125 5.046875,-4.828125 5.046875,-3.1875 C 5.046875,-1.625 4.375,-0.671875 3.28125,-0.671875 C 2.140625,-0.671875 1.453125,-1.640625 1.453125,-3.21875 C 1.453125,-4.796875 2.15625,-5.78125 3.265625,-5.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-20"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2897"
-           d="M 6.890625,-4.15625 L 6.890625,0 L 8.046875,0 L 8.046875,-9.109375 L 6.890625,-9.109375 L 6.890625,-5.171875 L 2.203125,-5.171875 L 2.203125,-9.109375 L 1.03125,-9.109375 L 1.03125,0 L 2.21875,0 L 2.21875,-4.15625 L 6.890625,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-21"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2900"
-           d="M 2.421875,-9.109375 L 1.25,-9.109375 L 1.25,0 L 2.421875,0 L 2.421875,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-22"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2903"
-           d="M 4.15625,-9.109375 L 4.15625,-2.703125 C 4.15625,-1.96875 4.09375,-1.5625 3.875,-1.25 C 3.65625,-0.90625 3.21875,-0.6875 2.765625,-0.6875 C 1.890625,-0.6875 1.40625,-1.28125 1.40625,-2.34375 L 1.40625,-2.921875 L 0.21875,-2.921875 L 0.21875,-2.125 C 0.21875,-0.65625 1.1875,0.28125 2.75,0.28125 C 4.34375,0.28125 5.328125,-0.703125 5.328125,-2.28125 L 5.328125,-9.109375 L 4.15625,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-23"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2906"
-           d="M 3.21875,-6.546875 L 2.140625,-6.546875 L 2.140625,-7.578125 C 2.140625,-8.015625 2.390625,-8.234375 2.859375,-8.234375 C 2.953125,-8.234375 2.984375,-8.234375 3.21875,-8.21875 L 3.21875,-9.09375 C 2.984375,-9.140625 2.84375,-9.15625 2.640625,-9.15625 C 1.671875,-9.15625 1.09375,-8.59375 1.09375,-7.65625 L 1.09375,-6.546875 L 0.21875,-6.546875 L 0.21875,-5.703125 L 1.09375,-5.703125 L 1.09375,0 L 2.140625,0 L 2.140625,-5.703125 L 3.21875,-5.703125 L 3.21875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-    </g>
-  </defs>
-  <sodipodi:namedview
-     id="base"
-     pagecolor="#ffffff"
-     bordercolor="#666666"
-     borderopacity="1.0"
-     gridtolerance="10000"
-     guidetolerance="10"
-     objecttolerance="10"
-     inkscape:pageopacity="0.0"
-     inkscape:pageshadow="2"
-     inkscape:zoom="1.979899"
-     inkscape:cx="156.0166"
-     inkscape:cy="186.51407"
-     inkscape:document-units="px"
-     inkscape:current-layer="g4252"
-     width="400px"
-     height="400px"
-     inkscape:window-width="1400"
-     inkscape:window-height="996"
-     inkscape:window-x="0"
-     inkscape:window-y="0"
-     showgrid="false" />
-  <metadata
-     id="metadata7">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <g
-     inkscape:label="Layer 1"
-     inkscape:groupmode="layer"
-     id="layer1"
-     transform="translate(-193.39368,-187.86171)">
-    <g
-       id="g4560"
-       transform="translate(19.697975,21.213203)">
-      <g
-         id="g6012"
-         transform="translate(10.101525,26.769042)">
-        <g
-           clip-path="url(#clip0)"
-           id="surface0"
-           transform="translate(287.14349,154.45437)">
-          <g
-             id="g2944"
-             clip-rule="nonzero"
-             clip-path="url(#clip2)">
-            <g
-               id="g2946"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use2948"
-                 y="24.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2950"
-                 y="24.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2952"
-                 y="24.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2954"
-                 y="24.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2956"
-                 y="24.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g2958"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use2960"
-                 y="41.369492"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use2962"
-                 y="41.369492"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use2964"
-                 y="41.369492"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g2966"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use2968"
-                 y="58.036148"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2970"
-                 y="58.036148"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2972"
-                 y="58.036148"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2974"
-                 y="58.036148"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2976"
-                 y="58.036148"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g2978"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use2980"
-                 y="74.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2982"
-                 y="74.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2984"
-                 y="74.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2986"
-                 y="74.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2988"
-                 y="74.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g2990"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use2992"
-                 y="91.369492"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2994"
-                 y="91.369492"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2996"
-                 y="91.369492"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2998"
-                 y="91.369492"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3000"
-                 y="91.369492"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3002"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3004"
-                 y="108.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3006"
-                 y="108.03615"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3008"
-                 y="108.03615"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3010"
-                 y="108.03615"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3012"
-                 y="108.03615"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3014"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3016"
-                 y="124.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3018"
-                 y="124.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3020"
-                 y="124.70282"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3022"
-                 y="124.70282"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3024"
-                 y="124.70282"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3026"
-                 y="124.70282"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3028"
-                 y="124.70282"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3030"
-                 y="124.70282"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3032"
-                 y="124.70282"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3034"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use3036"
-                 y="141.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3038"
-                 y="141.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3040"
-                 y="141.36949"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g3042"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3044"
-                 y="158.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3046"
-                 y="158.03615"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3048"
-                 y="158.03615"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3050"
-                 y="158.03615"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3052"
-                 y="158.03615"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3054"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3056"
-                 y="174.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3058"
-                 y="174.70282"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3060"
-                 y="174.70282"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3062"
-                 y="174.70282"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3064"
-                 y="174.70282"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3066"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use3068"
-                 y="191.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3070"
-                 y="191.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3072"
-                 y="191.36949"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3074"
-                 y="191.36949"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3076"
-                 y="191.36949"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g3078"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use3080"
-                 y="208.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3082"
-                 y="208.03615"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3084"
-                 y="208.03615"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g3086"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3088"
-                 y="224.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3090"
-                 y="224.70282"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3092"
-                 y="224.70282"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3094"
-                 y="224.70282"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3096"
-                 y="224.70282"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3098"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3100"
-                 y="241.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3102"
-                 y="241.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3104"
-                 y="241.36949"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3106"
-                 y="241.36949"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3108"
-                 y="241.36949"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3110"
-                 y="241.36949"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3112"
-                 y="241.36949"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3114"
-                 y="241.36949"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3116"
-                 y="241.36949"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3118"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3120"
-                 y="258.03613"
-                 x="12.53334"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3122"
-                 y="258.03613"
-                 x="20.170868"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3124"
-                 y="258.03613"
-                 x="27.120895"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3126"
-                 y="258.03613"
-                 x="34.070923"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3128"
-                 y="258.03613"
-                 x="36.845932"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3130"
-                 y="258.03613"
-                 x="43.795959"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3132"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3134"
-                 y="274.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3136"
-                 y="274.70282"
-                 x="22.258377"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3138"
-                 y="274.70282"
-                 x="25.033386"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3140"
-                 y="274.70282"
-                 x="31.983414"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3142"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3144"
-                 y="291.36951"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3146"
-                 y="291.36951"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3148"
-                 y="291.36951"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3150"
-                 y="291.36951"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3152"
-                 y="291.36951"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3154"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3156"
-                 y="308.03613"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3158"
-                 y="308.03613"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3160"
-                 y="308.03613"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3162"
-                 y="308.03613"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3164"
-                 y="308.03613"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3166"
-                 y="308.03613"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3168"
-                 y="308.03613"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3170"
-                 y="308.03613"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3172"
-                 y="308.03613"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3174"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use3176"
-                 y="324.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3178"
-                 y="324.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3180"
-                 y="324.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3182"
-                 y="324.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3184"
-                 y="324.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g3186"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3188"
-                 y="341.36951"
-                 x="12.53334"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3190"
-                 y="341.36951"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3192"
-                 y="341.36951"
-                 x="28.508408"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3194"
-                 y="341.36951"
-                 x="31.283417"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3196"
-                 y="341.36951"
-                 x="38.233444"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3198"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3200"
-                 y="24.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3202"
-                 y="24.70282"
-                 x="87.537521"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3204"
-                 y="24.70282"
-                 x="94.487549"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3206"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3208"
-                 y="41.369492"
-                 x="79.199997"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3210"
-                 y="41.369492"
-                 x="88.225037"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3212"
-                 y="41.369492"
-                 x="91.000046"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3214"
-                 y="41.369492"
-                 x="97.950073"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3216"
-                 y="41.369492"
-                 x="104.9001"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3218"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3220"
-                 y="58.036148"
-                 x="79.199997"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3222"
-                 y="58.036148"
-                 x="88.225037"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3224"
-                 y="58.036148"
-                 x="91.000046"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3226"
-                 y="58.036148"
-                 x="97.950073"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3228"
-                 y="58.036148"
-                 x="104.9001"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3230"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3232"
-                 y="74.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3234"
-                 y="74.70282"
-                 x="87.537521"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3236"
-                 y="74.70282"
-                 x="93.787552"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3238"
-                 y="74.70282"
-                 x="104.20009"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3240"
-                 y="74.70282"
-                 x="111.15012"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3242"
-                 y="74.70282"
-                 x="115.31264"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3244"
-                 y="74.70282"
-                 x="122.26266"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3246"
-                 y="74.70282"
-                 x="125.03767"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3248"
-                 y="74.70282"
-                 x="131.9877"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3250"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3252"
-                 y="91.369492"
-                 x="79.199997"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3254"
-                 y="91.369492"
-                 x="87.537521"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3256"
-                 y="91.369492"
-                 x="93.787552"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3258"
-                 y="91.369492"
-                 x="104.20009"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3260"
-                 y="91.369492"
-                 x="111.15012"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3262"
-                 y="91.369492"
-                 x="115.31264"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3264"
-                 y="91.369492"
-                 x="122.26266"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3266"
-                 y="91.369492"
-                 x="125.03767"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3268"
-                 y="91.369492"
-                 x="131.9877"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3270"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3272"
-                 y="108.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3274"
-                 y="108.03615"
-                 x="86.837524"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3276"
-                 y="108.03615"
-                 x="93.787552"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3278"
-                 y="108.03615"
-                 x="100.73758"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3280"
-                 y="108.03615"
-                 x="103.51259"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3282"
-                 y="108.03615"
-                 x="110.46262"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3284"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3286"
-                 y="124.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3288"
-                 y="124.70282"
-                 x="86.837524"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3290"
-                 y="124.70282"
-                 x="93.787552"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3292"
-                 y="124.70282"
-                 x="100.73758"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3294"
-                 y="124.70282"
-                 x="103.51259"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3296"
-                 y="124.70282"
-                 x="110.46262"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3298"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3300"
-                 y="141.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3302"
-                 y="141.36949"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3304"
-                 y="141.36949"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3306"
-                 y="141.36949"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3308"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3310"
-                 y="158.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3312"
-                 y="158.03615"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3314"
-                 y="158.03615"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3316"
-                 y="158.03615"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3318"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3320"
-                 y="174.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3322"
-                 y="174.70282"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3324"
-                 y="174.70282"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3326"
-                 y="174.70282"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3328"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3330"
-                 y="191.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3332"
-                 y="191.36949"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3334"
-                 y="191.36949"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3336"
-                 y="191.36949"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3338"
-                 y="191.36949"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3340"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3342"
-                 y="208.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3344"
-                 y="208.03615"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3346"
-                 y="208.03615"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3348"
-                 y="208.03615"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3350"
-                 y="208.03615"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3352"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3354"
-                 y="224.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3356"
-                 y="224.70282"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3358"
-                 y="224.70282"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3360"
-                 y="224.70282"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3362"
-                 y="224.70282"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3364"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3366"
-                 y="241.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3368"
-                 y="241.36949"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3370"
-                 y="241.36949"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3372"
-                 y="241.36949"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3374"
-                 y="241.36949"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3376"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3378"
-                 y="258.03613"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3380"
-                 y="258.03613"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3382"
-                 y="258.03613"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3384"
-                 y="258.03613"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3386"
-                 y="258.03613"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3388"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3390"
-                 y="274.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3392"
-                 y="274.70282"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3394"
-                 y="274.70282"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3396"
-                 y="274.70282"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3398"
-                 y="274.70282"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3400"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3402"
-                 y="291.36951"
-                 x="79.199997"
-                 xlink:href="#glyph0-21"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3404"
-                 y="291.36951"
-                 x="82.675003"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3406"
-                 y="291.36951"
-                 x="89.625031"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3408"
-                 y="291.36951"
-                 x="96.575058"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3410"
-                 y="291.36951"
-                 x="103.52509"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3412"
-                 y="291.36951"
-                 x="106.30009"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3414"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3416"
-                 y="308.03613"
-                 x="79.199997"
-                 xlink:href="#glyph0-21"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3418"
-                 y="308.03613"
-                 x="82.675003"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3420"
-                 y="308.03613"
-                 x="89.625031"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3422"
-                 y="308.03613"
-                 x="96.575058"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3424"
-                 y="308.03613"
-                 x="103.52509"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3426"
-                 y="308.03613"
-                 x="106.30009"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3428"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3430"
-                 y="324.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-22"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3432"
-                 y="324.70282"
-                 x="85.450027"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3434"
-                 y="324.70282"
-                 x="92.400055"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3436"
-                 y="324.70282"
-                 x="99.350082"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3438"
-                 y="324.70282"
-                 x="106.30011"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3440"
-                 y="324.70282"
-                 x="109.07512"
-                 xlink:href="#glyph0-23"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3442"
-                 y="324.70282"
-                 x="112.55013"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3444"
-                 y="324.70282"
-                 x="119.50015"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3446"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3448"
-                 y="341.36951"
-                 x="79.199997"
-                 xlink:href="#glyph0-22"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3450"
-                 y="341.36951"
-                 x="85.450027"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3452"
-                 y="341.36951"
-                 x="92.400055"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3454"
-                 y="341.36951"
-                 x="99.350082"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3456"
-                 y="341.36951"
-                 x="106.30011"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3458"
-                 y="341.36951"
-                 x="109.07512"
-                 xlink:href="#glyph0-23"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3460"
-                 y="341.36951"
-                 x="112.55013"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3462"
-                 y="341.36951"
-                 x="119.50015"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-          </g>
-        </g>
-        <g
-           id="g4205"
-           transform="matrix(1,0,0,0.972732,-0.89631,6.0184739)">
-          <g
-             id="g4228"
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)">
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4167"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="167.36218" />
-            <rect
-               y="185.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4169"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="203.07646"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4171"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4173"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="220.93361" />
-            <rect
-               y="238.79076"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4175"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4177"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="256.64789" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4179"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="274.50504" />
-            <rect
-               y="292.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4181"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="310.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4183"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4185"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="328.07648" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4187"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="345.93359" />
-            <rect
-               y="363.79074"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4189"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4191"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="381.64789" />
-            <rect
-               y="399.50504"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4193"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="417.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4195"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4197"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="435.21933" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4199"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="453.07648" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4201"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="470.93362" />
-            <rect
-               y="488.79077"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4203"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4226"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="506.44476" />
-            <rect
-               y="529.82227"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4552"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <text
-               xml:space="preserve"
-               style="font-size:16.66718292px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:center;line-height:125%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               x="220.492"
-               y="602.20081"
-               id="text4554"
-               sodipodi:linespacing="125%"
-               transform="scale(1.1060165,0.9041457)"><tspan
-                 sodipodi:role="line"
-                 id="tspan4556"
-                 x="220.492"
-                 y="602.20081">X</tspan></text>
-          </g>
-        </g>
-        <g
-           transform="matrix(1,0,0,0.972732,-54.434395,6.0184739)"
-           id="g4250">
-          <g
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)"
-             id="g4252">
-            <g
-               id="g4316">
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4254"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="167.36218" />
-              <rect
-                 y="185.21933"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4256"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 y="203.07646"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4258"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4260"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="220.93361" />
-              <rect
-                 y="238.79076"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4262"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4264"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="256.64789" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4266"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="274.50504" />
-              <rect
-                 y="292.36218"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4268"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 y="310.21933"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4270"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4272"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="328.07648" />
-              <rect
-                 y="350.36664"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4544"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            </g>
-            <text
-               xml:space="preserve"
-               style="font-size:15.47667217px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               x="193.91632"
-               y="199.77205"
-               id="text4294"
-               sodipodi:linespacing="125%"
-               transform="scale(1.1060165,0.9041457)"><tspan
-                 sodipodi:role="line"
-                 id="tspan4296"
-                 x="193.91632"
-                 y="199.77205"
-                 style="fill:#ff0000">A</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="219.11789"
-                 id="tspan4298"
-                 style="fill:#0000ff">B</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="238.46373"
-                 id="tspan4300"
-                 style="fill:#008000">C</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="257.80957"
-                 id="tspan4302">D</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="277.15541"
-                 id="tspan4304">E</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="296.50125"
-                 id="tspan4306">F</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="315.84709"
-                 id="tspan4308">G</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="335.19293"
-                 id="tspan4310">H</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="354.53877"
-                 id="tspan4312">I</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="373.88461"
-                 id="tspan4314">J</tspan></text>
-          </g>
-        </g>
-        <path
-           style="fill:#ff0000;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 199.83939,175.54978 L 237.00157,175.54978"
-           id="path4328" />
-        <path
-           id="path4530"
-           d="M 252.8724,175.54978 L 290.03458,175.54978"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,192.72237 L 290.03458,223.53202"
-           id="path4532"
-           sodipodi:nodetypes="cc" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,209.38989 L 290.03458,340.20464"
-           id="path4534"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4536"
-           d="M 252.8724,225.55233 L 290.03458,473.54478"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,242.72492 L 290.03458,192.72237"
-           id="path4538"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4540"
-           d="M 252.8724,258.88736 L 290.03458,290.70717"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4542"
-           d="M 199.83939,192.72237 L 237.00157,239.69446"
-           style="fill:#0000ff;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4550"
-           d="M 199.83939,346.26556 L 237.00157,507.88997"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <g
-           transform="matrix(1,0,0,0.972732,212.75095,6.0184739)"
-           id="g4900">
-          <g
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)"
-             id="g4902">
-            <rect
-               y="167.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4904"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4906"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="185.21933" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4908"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="203.07646" />
-            <rect
-               y="220.93361"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4910"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4912"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="238.79076" />
-            <rect
-               y="256.64789"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4914"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="274.50504"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4916"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4918"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="292.36218" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4920"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="310.21933" />
-            <rect
-               y="328.07648"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4922"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="345.93359"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4924"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4926"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="363.79074" />
-            <rect
-               y="381.64789"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4928"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4930"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="399.50504" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4932"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="417.36218" />
-            <rect
-               y="435.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4934"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="453.07648"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4936"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="470.93362"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4938"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4940"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="488.79077" />
-            <rect
-               y="506.44476"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4942"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4944"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="529.82227" />
-            <text
-               transform="scale(1.1060165,0.9041457)"
-               sodipodi:linespacing="125%"
-               id="text4946"
-               y="602.20081"
-               x="220.492"
-               style="font-size:16.66718292px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:center;line-height:125%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               xml:space="preserve"><tspan
-                 y="602.20081"
-                 x="220.492"
-                 id="tspan4948"
-                 sodipodi:role="line">X</tspan></text>
-          </g>
-        </g>
-        <g
-           id="g4950"
-           transform="matrix(1,0,0,0.972732,266.79411,6.0184739)">
-          <g
-             id="g4952"
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)">
-            <g
-               transform="translate(47.218382,0)"
-               id="g5000">
-              <g
-                 id="g4954"
-                 transform="translate(-48.548477,0)">
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4956"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="167.36218" />
-                <rect
-                   y="185.21933"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4958"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   y="203.07646"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4960"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4962"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="220.93361" />
-                <rect
-                   y="238.79076"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4964"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4966"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="256.64789" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4968"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="274.50504" />
-                <rect
-                   y="292.36218"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4970"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   y="310.21933"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4972"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4974"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="328.07648" />
-                <rect
-                   y="350.36664"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4976"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              </g>
-              <text
-                 xml:space="preserve"
-                 style="font-size:15.47667217px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-                 x="193.91632"
-                 y="199.77205"
-                 id="text4978"
-                 sodipodi:linespacing="125%"
-                 transform="scale(1.1060165,0.9041457)"><tspan
-                   sodipodi:role="line"
-                   id="tspan4980"
-                   x="193.91632"
-                   y="199.77205">A</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="219.11789"
-                   id="tspan4982">B</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="238.46373"
-                   id="tspan4984">C</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="257.80957"
-                   id="tspan4986">D</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="277.15541"
-                   id="tspan4988">E</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="296.50125"
-                   id="tspan4990">F</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="315.84709"
-                   id="tspan4992">G</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="335.19293"
-                   id="tspan4994">H</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="354.53877"
-                   id="tspan4996">I</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="373.88461"
-                   id="tspan4998">J</tspan></text>
-            </g>
-          </g>
-        </g>
-        <path
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 467.07928,175.54978 L 429.9171,175.54978"
-           id="path5025" />
-        <path
-           id="path5027"
-           d="M 467.07928,192.2173 L 429.9171,192.2173"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 467.07928,209.38989 L 429.9171,209.38989"
-           id="path5029" />
-        <path
-           id="path5031"
-           d="M 467.07928,226.05741 L 429.9171,226.05741"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           id="path5033"
-           d="M 519.10214,175.54978 L 481.93996,175.54978"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,191.71222 L 481.93996,176.05486"
-           id="path5035" />
-        <path
-           id="path5037"
-           d="M 519.10214,209.89497 L 481.93996,194.23761"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,225.55233 L 481.93996,193.73253"
-           id="path5039" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,345.76048 L 481.93996,508.39504"
-           id="path5041" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,275.55488 L 290.03458,357.37724"
-           id="path3602" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:#008000;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#008000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 199.83939,208.88481 L 237.00157,290.20209"
-           id="path3604" />
-      </g>
-    </g>
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/igraph0.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/igraph0.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/igraph1.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/igraph1.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/igraph11.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/igraph11.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/igraph2.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/igraph2.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/igraph3.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/igraph3.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/indd.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/indd.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/jgplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/jgplot.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/logo125.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/logo125.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/matrix.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/matrix.jpg differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/mixed.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/mixed.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/orgnet.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/orgnet.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/outdd.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/outdd.svg.gz differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/user2008/pause.sty igraph-0.6.5/doc/presentations/user2008/pause.sty
--- igraph-0.6.5~quantal1/doc/presentations/user2008/pause.sty	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/user2008/pause.sty	1970-01-01 00:00:00.000000000 +0000
@@ -1,185 +0,0 @@
-%% pause.sty                                      18 Jun 2002
-%%-----------------------------------------------------------
-%% History:
-%% The initial version was created                11 Jun 1999
-%% Updated to allow options                       10 Mar 2000
-%% Restructured after tests                       03 Apr 2000
-%% Added procesing for random builds              07 May 2000
-%% Supply test for new enough pdftex              09 May 2000
-%% No need for pdftex 14 any more                 31 May 2000
-%% Added commands for highligthing etc.           12 Jun 2000
-%% Added options ignore, nomarkers and dvipdfm
-%% runs with vlatex and dvipdfm                   10 Nov 2001
-%% Update comment section                         13 Jun 2002
-%% Make catcodes safe for pdfliteral              18 Jun 2002
-%%
-%%   Because we need a color definition this can be used
-%%   primarily with LaTeX. Thus we can also rely on \@ifnextchar
-%%   and LaTeX option processing.
-%%
-%% insert small colored chunks to mark spots in the pdf file,
-%% where a break should be made during display.
-%% This method needs postprocessing by another program.
-%% But one can preview the formatted text, where stops are indicated
-%% as small colored chunks. These will vanish during postprocessing.
-%%
-%% Take care: because we have to insert pdf comments starting with
-%% the letter '%' the catcode of '%' will be changed temporarily.
-
-%% must define all optional variants to support creating a file
-%% without pdf elements
-
-
-%% Options
-\newif\ifpause@ignore    \pause@ignorefalse
-\newif\ifpause@nomarkers \pause@nomarkersfalse
-\newif\ifpause@dvipdfm   \pause@dvipdfmfalse
-
-\DeclareOption{ignore}{\pause@ignoretrue}
-\DeclareOption{nomarkers}{\pause@nomarkerstrue}
-\DeclareOption{dvipdfm}{\pause@dvipdfmtrue}
-
-\ProcessOptions
-
-
-%% warning if ignore and nomarkers
-\ifpause@ignore
-  \ifpause@nomarkers
-    \message{Warning, options ignore and nomarkers used together}
-  \fi
-\fi
-
-%% We need to make sure that , and : are not active characters while
-%% we read these macro definitions.
-%% Save their current catcode settings now and restore them at the end
-\def\pppp@x#1{\catcode`\noexpand#1=\the\catcode`#1\relax}%
-\xdef\pppp@restoreCatcodes{\relax
-  \pppp@x\:\relax
-  \pppp@x\,\relax
-}
-\catcode`\,=12\relax
-\catcode`\:=12\relax
-
-\def\pauseDissolve{\pause[trans='Dissolve']}
-\def\pauseReplace{\pause[trans='Replace']}
-\def\pauseHBlinds{\pause[trans='Blinds,H']}
-\def\pauseVBlinds{\pause[trans='Blinds,V']}
-\def\pauseHOSplit{\pause[trans='Split,H,O']}
-\def\pauseHISplit{\pause[trans='Split,H,I']}
-\def\pauseVOSplit{\pause[trans='Split,V,O']}
-\def\pauseVISplit{\pause[trans='Split,V,I']}
-\def\pauseOBox{\pause[trans='Box,O']}
-\def\pauseIBox{\pause[trans='Box,I']}
-\def\pauseWipe#1{\pause[trans='Wipe,#1']}
-\def\pauseGlitter#1{\pause[trans='Glitter,#1']}
-\def\pause{\@ifnextchar [{\pppp@pause}{\pppp@pause[]}}
-
-
-
-%% dvipdfm support
-\ifpause@dvipdfm
-  {\catcode`\^^M=12
-  \gdef\pdfliteral#1{\special{pdf: content
-      #1
-  }}}
-
-  \message{Using color settings for dvipdfm}
-
-  \RequirePackage[dvipdfm]{color}
-
-  %% This is for the support of the dvipdfm color philosophy
-  \def\pppp@gettail #1 #2:{#2}
-  \def\pppp@gethead #1 #2:{#1}
-  \def\pppp@tail #1{\expandafter\pppp@gettail #1:}
-  \def\pppp@tailtail #1{\expandafter\pppp@gettail\pppp@gettail #1::}
-  \def\pppp@head #1{\expandafter\pppp@gethead #1:}
-  \def\pppp@removebrackets[#1]{#1}
-
-
-  % maps dvipdfm color arguments to pdf color commands
-  \def\pppp@dvipdfmmap #1{\expandafter\pppp@grayorother#1:}
-  \def\pppp@dvipdfmmapper#1{\csname dvipdfmmapel@#1\endcsname}
-  \def\pppp@dvipdfmmapvalue#1{\expandafter\def\csname dvipdfmmapel@#1\endcsname}
-
-  \def\pppp@grayorother#1#2:{\pppp@dvipdfmmapper{#1}[#1#2]}
-  \def\pppp@rgborcmyk #1 #2 #3 #4 #5 #6:{\pppp@dvipdfmmapper{#6}[#2 #3 #4 #5]}
-
-  % for the latest dvipdfm.def-File
-  \pppp@dvipdfmmapvalue{c}[#1]{\pppp@tail{#1} k \pppp@tail{#1} K}
-  \pppp@dvipdfmmapvalue{r}[#1]{\pppp@tail{#1} rg \pppp@tail{#1} RG}
-  \pppp@dvipdfmmapvalue{g}[#1]{\pppp@tail{#1} g \pppp@tail{#1} G}
-
-  % for dvipdfm.def with bg-error
-  \pppp@dvipdfmmapvalue{b}[#1]{\pppp@tail{#1} g \pppp@tail{#1} G}
-
-  % support of the older format ([...],...)
-  \pppp@dvipdfmmapvalue{0}[#1]{#1 g #1 G}
-  \pppp@dvipdfmmapvalue{1}[#1]{#1 g #1 G}
-  \pppp@dvipdfmmapvalue{[}[#1]{\expandafter\pppp@removebrackets[\expandafter\pppp@rgborcmyk #1 :}
-  \pppp@dvipdfmmapvalue{}[#1]{#1rg #1RG}
-  \pppp@dvipdfmmapvalue{ }[#1]{#1 k #1 K}
-
-  \def\pppp@colortostring #1{\expandafter\pppp@dvipdfmmap\csname\string\color@#1\endcsname}
-\else
-  \RequirePackage{color}
-  \def\pppp@colortostring #1{\csname\string\color@#1\endcsname}
-\fi
-
-
-\definecolor{pp4red}{rgb}{0.9,0.5,0}
-
-%% We need to make sure that our argument parameters do not contain
-%% active characters when we are called. This means we better set the
-%% catcodes for some common delimiters in our arguments. Let's hope
-%% that nobody is going to change the letters and digits, too.
-\gdef\pppp@catcodes{%
-  \catcode`\+12\relax
-  \catcode`\-12\relax
-  \catcode`\:12\relax
-  \catcode`\=12\relax
-  }
-%% now we need a section where % can be written to pdf files.
-%% thus make ! a comment character
-{\catcode`\%=11\catcode`\!=14
-\gdef\pppp@marker#1{!
-     \ifpause@ignore
-       \relax
-     \else
-       \pdfliteral{%pause}!
-       \ifpause@nomarkers
-         \relax
-       \else
-         \color{pp4red}\vrule width 2truemm height 5truemm\hss ! the marker
-       \fi
-       \pdfliteral{%esuap #1}!
-     \fi}
- \gdef\pppp@pause[#1]{!
-      \ifvmode
-        \vbox to 0pt{\vss\hsize0pt\noindent\hbox to 0pt{\pppp@marker{#1}}}\else!hmode or mmode
-        \null\hbox to 0pt{\pppp@marker{#1}}\null!
-        !\null\hbox to 0pt{\pppp@marker{#1}}\null
-      \fi}
-
-
- \ifpause@ignore
-   !! define dummies, if \pause should be ignored
-   \gdef\pauselevel#1{\relax}!
-   \gdef\pausecolors#1#2#3{}!
-   \gdef\pausecolorreset{\relax}
-   \gdef\pausebuild{\relax}
-   \gdef\pausehighlight{\relax}
- \else
-   \gdef\pauselevel{\bgroup\pppp@catcodes\pppp@pauselevel}!
-   \gdef\pppp@pauselevel#1{\pdfliteral{%pauselevel #1}\egroup}!
-   \gdef\pausecolors#1#2#3{!
-     \pdfliteral{%pausecolor \pppp@colortostring{#1}\space \pppp@colortostring{#2}\space \pppp@colortostring{#3}}}!
-   \gdef\pausecolorreset{!
-     \pdfliteral{%pausecolor reset}}!
-   \gdef\pausebuild{!
-     \pdfliteral{%pausecolor appear}}!
-   \gdef\pausehighlight{!
-     \pdfliteral{%pausecolor highlight}}!
- \fi
-}
-
-\pppp@restoreCatcodes
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/plot.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/plot.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/rglplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/rglplot.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/schema.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/schema.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/source_c.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/source_c.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/source_cpp.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/source_cpp.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/tkplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/tkplot.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/user2008/transitivity.svg.gz and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/user2008/transitivity.svg.gz differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/3dplot.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/3dplot.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/adjacency.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/adjacency.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/adjlist.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/adjlist.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/cb.Rdata and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/cb.Rdata differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/cblocks.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/cblocks.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/code.R igraph-0.6.5/doc/presentations/wien08/code.R
--- igraph-0.6.5~quantal1/doc/presentations/wien08/code.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/code.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,268 +0,0 @@
-
-## Generating the network figures
-
-## This function creates a lot of graphs
-
-frgraphs <- function() {
-  graphs <- list()
-  graphs[[1]] <- graph.full(5)
-  graphs[[2]] <- graph.full(4)
-  graphs[[3]] <- graph.full(6)
-  graphs[[4]] <- graph.full(6)
-  graphs[[5]] <- graph.full(8)
-  graphs[[6]] <- graph.full(2)
-  graphs[[7]] <- graph.formula( A-B-C-D-A, A-F, B-G, C-H, D-I )
-  graphs[[8]] <- graph.formula( A-B-C-A, D-E-F-D, A-D )
-  graphs[[9]] <- graph.ring(5)
-  graphs[[10]] <- graph.formula( A-B-C-A, B-D-E-B, C-E-F-C,
-                                D-G-H-D, E-H-I-E, F-I-J-F )
-  graphs[[11]] <- graph.formula( A-B-C-D-A, A-C, B-D,
-                                A-E-F-G-A, A-F, E-G,
-                                B-H-I-J-B, B-I, H-J,
-                                C-K-L-M-C, C-L, K-M,
-                                D-N-O-P-D, D-O, N-P )
-  graphs[[12]] <- graph.formula( A-B-C-D-F-E-A, A-D, E-C, B-F)
-  graphs[[13]] <- graph.formula( A-B:D:H, B-F:G, C-D:E:I, D-F, E-F:L, F-G:I:J:M,
-                                G-N, H-K:L, I-K, J-M:N, K-M, L-N )
-  graphs[[14]] <- simplify(graph.formula( A-B:H:L, B-A:C:K, C-B:D:M, D-C:E:L:M:N,
-                                         E-D:F:G, F-E:I:L, G-E:H:N, H-A:G:J,
-                                         I-F:J:K, J-H:I:M, K-B:I:N, L-A:D:F,
-                                         M-C:D:J, N-D:G:K ))
-  graphs[[15]] <- graph.formula( A-B-C-D-E-F-G-H-I-A,
-                                J-E:A:F, K-A:F:B, L-F:B:G, M-B:G:C, N-G:C:H,
-                                O-C:H:D, P-H:D:I, Q-D:I:E, R-I:E:A )
-  graphs[[16]] <- graph.formula( 0-1:4:8:11:15:19:22, 1-0:2:6:24, 2-1:3:5:23:29:30,
-                                3-2, 4-0:5, 5-2:4:6:9, 6-1:5:8:31:7:30, 7-6:30:31,
-                                8-0:6:9:13, 9-5:8:12:32:10:31, 10-9, 11-0:12,
-                                12-9:11:26:13, 13-8:12:27:33:14:32, 14-13:32:33,
-                                15-0:16, 16-15:20:17:26, 17-16:19:35:18:34:27,
-                                18-17:34:35, 19-0:24:20:17, 20-19:23:36:21:35:16,
-                                21-20, 22-0:23, 23-22:2:24:20, 24-23:1:29:25:36:19,
-                                25-24:29:36, 26-16:12:33:27:34, 27-26:13:28:17,
-                                28-27, 29-2:24:25, 30-2:6:7, 31-6:7:9,
-                                32-9:13:14, 33-13:14:26, 34-26:17:18, 35-17:18:20,
-                                36-20:24:25 )
-  graphs[[16]] <- simplify(graphs[[16]])
-  return graphs
-}
-
-#####################
-
-library(igraph)
-library(Cairo)
-
-graphs <- frgraphs()
-lay <- lapply(graphs, layout.fruchterman.reingold, niter=3000)
-
-CairoPDF(file="frplots.pdf")
-par(mai=c(0,0,0,0))
-layout(matrix(1:16, nr=4, byrow=TRUE))
-for (i in seq(along=graphs)) {
-  plot(graphs[[i]], layout=lay[[i]],
-       vertex.label=NA, vertex.size=13, edge.color="black",
-       vertex.color="red")
-}
-dev.off()
-
-#####################
-
-library(igraph)
-library(Cairo)
-
-g <- erdos.renyi.game(300, 250, type="gnm")
-colors <- rainbow( length(clusters(g)$csize) )
-V(g)$color <- colors[ clusters(g)$membership+1 ]
-CairoPDF(file="ercomps.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=layout.fruchterman.reingold, vertex.label=NA,
-     vertex.size=4, edge.color="black")
-dev.off()
-
-######################
-
-library(igraph)
-library(rgl)
-
-g <- graph.lattice( c(5,5,5), directed=TRUE, mutual=TRUE )
-V(g)$color <- "red"
-l <- layout.kamada.kawai(g, dim=3)
-open3d()
-rglplot(g, vertex.label=NA, layout=l)
-Sys.sleep(2) ; rgl.snapshot(file="3dplot.png")
-
-######################
-# Draw the example graph
-
-g <- graph.formula( A-B:C, B-C, C-E, D )
-V(g)$label <- V(g)$name
-CairoPDF(file="small1.pdf")
-plot(g, layout=layout.fruchterman.reingold, frame=TRUE,
-     vertex.size=50, vertex.label.cex=3, edge.color="black")
-dev.off()
-
-CairoPDF(file="small2.pdf")
-plot(g, layout=layout.fruchterman.reingold, frame=TRUE,
-     vertex.size=50, vertex.label.cex=3, edge.color="black")
-dev.off()
-
-l <- layout.fruchterman.reingold(g)
-
-CairoPDF(file="small3.pdf")
-plot(g, layout=l, frame=TRUE,
-     vertex.size=50, vertex.label.cex=3, edge.color="black")
-dev.off()
-
-g2 <- graph.formula( A-+B:C, B-+C, C-+E, D )
-V(g2)$label <- V(g)$name
-CairoPDF(file="small4.pdf")
-plot(g2, layout=l, frame=TRUE,
-     vertex.size=50, vertex.label.cex=3, edge.color="black")
-dev.off()
-
-#####################
-
-# graph representation
-
-CairoPDF(file="adjacency.pdf")
-par(mai=c(0,0,0,0))
-plot(NA, type="n", xlim=c(-2,10), ylim=c(0,12), frame=FALSE)
-
-for (i in seq(0.5,9.5,by=1)) {
-  symbols(x=rep(i,10), y=seq(0.5,9.5,by=1), squares=rep(1,10),
-          inches=FALSE, add=TRUE)
-}
-
-names <- c("Alice", "Bob", "Cecil", "Diana", "Esmeralda",
-           "Fabien", "Gigi", "Helen", "Iannis", "Jennifer")
-
-text(0, seq(9.5,0.5,by=-1), pos=2, names)
-text( seq(0.3,9.3,by=1), 10.2, pos=4, names, srt=90)
-
-g <- erdos.renyi.game(10, 20, type="gnm")
-A <- get.adjacency(g)
-
-x <- seq(0.5,9.5,by=1)
-for (i in 1:10) {
-  text(x=rep(x[i],10), y=rev(x), A[i,], cex=1.5)
-}
-dev.off()
-
-##########
-
-V(g)$name <- names
-el <- get.edgelist(g)
-# el <- el[1:16,]
-# el[16,] <- c("etc.", "")
-
-CairoPDF(file="edgelist.pdf", height=5, width=2)
-par(mai=c(0,0,0,0))
-plot(NA, type="n", xlim=c(0,4), ylim=c(0,nrow(el)), frame=FALSE)
-
-text(rep(0,nrow(el)), seq(nrow(el)-0.5, 0.5, by=-1), el[,1], pos=4)
-text(rep(2,nrow(el)), seq(nrow(el)-0.5, 0.5, by=-1), el[,2], pos=4)
-dev.off()
-
-CairoPNG(file="edgelist.png", height=500, width=200)
-par(mai=c(0,0,0,0))
-plot(NA, type="n", xlim=c(0,4), ylim=c(0,nrow(el)), frame=FALSE)
-
-text(rep(0,nrow(el)), seq(nrow(el)-0.5, 0.5, by=-1), el[,1], pos=4)
-text(rep(2,nrow(el)), seq(nrow(el)-0.5, 0.5, by=-1), el[,2], pos=4)
-dev.off()
-
-############
-
-adj <- get.adjlist(g)
-
-# x11(height=5, width=6)
-CairoPDF(file="adjlist.pdf", height=5, width=6)
-par(mai=c(0,0,0,0))
-plot(NA, type="n", xlim=c(0,10), ylim=c(0,length(adj)), frame=FALSE)
-
-text(rep(0,length(adj)), seq(length(adj)-0.5, 0.5, by=-1), V(g)$name, pos=4)
-for (i in seq(adj)) {
-  tt <- paste(V(g)$name[ adj[[i]]+1 ], collapse=", ")
-  text(rep(2, length(adj[[i]])), rev(x)[i], tt, pos=4)
-}
-dev.off()
-
-################
-
-l <- layout.kamada.kawai(g)
-
-CairoPDF(file="example.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=V(g)$name, vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-CairoPDF(file="ex-deg.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=paste(V(g)$name, degree(g), sep="\n"),
-     vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-CairoPDF(file="ex-close.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=paste(V(g)$name, round(closeness(g),2), sep="\n"),
-     vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-CairoPDF(file="ex-betw.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=paste(V(g)$name, round(betweenness(g),2), sep="\n"),
-     vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-CairoPDF(file="ex-ev.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=paste(V(g)$name, round(evcent(g)$vector, 2), sep="\n"),
-     vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-pg <- page.rank(g)$vector
-pg <- round(pg/max(pg), 2)
-CairoPDF(file="ex-pagerank.pdf")
-par(mai=c(0,0,0,0))
-plot(g, layout=l, vertex.size=30,
-     vertex.label=paste(V(g)$name, pg, sep="\n"),
-     vertex.label.cex=1.5,
-     vertex.color="white", vertex.frame.color="white")
-dev.off()
-
-#########################
-## Cohesive blocking
-
-cb <- graph( c(1,2,1,3,1,4,1,5,1,6,
-              2,3,2,4,2,5,2,7,
-              3,4,3,6,3,7,
-              4,5,4,6,4,7,
-              5,6,5,7,5,21,
-              6,7,
-              7,8,7,11,7,14,7,19,
-              8,9,8,11,8,14,
-              9,10,
-              10,12,10,13,
-              11,12,11,14,
-              12,16,
-              13,16,
-              14,15,
-              15,16,
-              17,18,17,19,17,20,
-              18,20,18,21,
-              19,20,19,22,19,23,
-              20,21,
-              21,22,21,23,
-              22,23)-1, dir=FALSE)
-
-V(cb)$label <- seq(vcount(cb))
-
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/commstr.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/commstr.jpg differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/edgelist.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/edgelist.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/edgelist.svg igraph-0.6.5/doc/presentations/wien08/edgelist.svg
--- igraph-0.6.5~quantal1/doc/presentations/wien08/edgelist.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/edgelist.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,1531 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://web.resource.org/cc/"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:xlink="http://www.w3.org/1999/xlink"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   width="144pt"
-   height="360pt"
-   viewBox="0 0 144 360"
-   version="1.1"
-   id="svg2830"
-   sodipodi:version="0.32"
-   inkscape:version="0.45"
-   sodipodi:docname="edgelist.svg"
-   sodipodi:docbase="/home/csardi/works/net/igraph-3/doc/presentations/wien08"
-   inkscape:output_extension="org.inkscape.output.svg.inkscape">
-  <metadata
-     id="metadata3465">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <sodipodi:namedview
-     inkscape:cy="356.14272"
-     inkscape:cx="19.05103"
-     inkscape:zoom="2.4559706"
-     inkscape:window-height="1021"
-     inkscape:window-width="1400"
-     inkscape:pageshadow="2"
-     inkscape:pageopacity="0.0"
-     guidetolerance="10.0"
-     gridtolerance="10.0"
-     objecttolerance="10.0"
-     borderopacity="1.0"
-     bordercolor="#666666"
-     pagecolor="#ffffff"
-     id="base"
-     inkscape:window-x="0"
-     inkscape:window-y="0"
-     inkscape:current-layer="surface0" />
-  <defs
-     id="defs2832">
-    <g
-       id="g2834">
-      <symbol
-         overflow="visible"
-         id="glyph0-0">
-        <path
-           style="stroke: none;"
-           d="M 5.921875 -2.734375 L 6.859375 0 L 8.15625 0 L 4.96875 -9.109375 L 3.46875 -9.109375 L 0.21875 0 L 1.453125 0 L 2.40625 -2.734375 L 5.921875 -2.734375 Z M 5.59375 -3.71875 L 2.703125 -3.71875 L 4.203125 -7.859375 L 5.59375 -3.71875 Z M 5.59375 -3.71875 "
-           id="path2837" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-1">
-        <path
-           style="stroke: none;"
-           d="M 1.90625 -9.109375 L 0.84375 -9.109375 L 0.84375 0 L 1.90625 0 L 1.90625 -9.109375 Z M 1.90625 -9.109375 "
-           id="path2840" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-2">
-        <path
-           style="stroke: none;"
-           d="M 1.875 -6.546875 L 0.84375 -6.546875 L 0.84375 0 L 1.875 0 L 1.875 -6.546875 Z M 1.875 -9.109375 L 0.828125 -9.109375 L 0.828125 -7.796875 L 1.875 -7.796875 L 1.875 -9.109375 Z M 1.875 -9.109375 "
-           id="path2843" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-3">
-        <path
-           style="stroke: none;"
-           d="M 5.890625 -4.34375 C 5.84375 -4.984375 5.703125 -5.40625 5.453125 -5.765625 C 5 -6.375 4.21875 -6.734375 3.296875 -6.734375 C 1.53125 -6.734375 0.390625 -5.34375 0.390625 -3.15625 C 0.390625 -1.046875 1.515625 0.28125 3.28125 0.28125 C 4.84375 0.28125 5.84375 -0.65625 5.96875 -2.25 L 4.90625 -2.25 C 4.734375 -1.203125 4.203125 -0.671875 3.3125 -0.671875 C 2.15625 -0.671875 1.46875 -1.609375 1.46875 -3.15625 C 1.46875 -4.796875 2.15625 -5.78125 3.28125 -5.78125 C 4.15625 -5.78125 4.71875 -5.265625 4.84375 -4.34375 L 5.890625 -4.34375 Z M 5.890625 -4.34375 "
-           id="path2846" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-4">
-        <path
-           style="stroke: none;"
-           d="M 6.40625 -2.921875 C 6.40625 -3.921875 6.34375 -4.53125 6.15625 -5.015625 C 5.71875 -6.09375 4.71875 -6.734375 3.5 -6.734375 C 1.671875 -6.734375 0.5 -5.34375 0.5 -3.1875 C 0.5 -1.03125 1.640625 0.28125 3.46875 0.28125 C 4.96875 0.28125 6.015625 -0.5625 6.28125 -1.984375 L 5.21875 -1.984375 C 4.9375 -1.125 4.34375 -0.671875 3.515625 -0.671875 C 2.84375 -0.671875 2.28125 -0.96875 1.9375 -1.53125 C 1.6875 -1.90625 1.59375 -2.28125 1.59375 -2.921875 L 6.40625 -2.921875 Z M 1.609375 -3.78125 C 1.703125 -4.984375 2.4375 -5.78125 3.484375 -5.78125 C 4.515625 -5.78125 5.296875 -4.921875 5.296875 -3.84375 C 5.296875 -3.828125 5.296875 -3.796875 5.28125 -3.78125 L 1.609375 -3.78125 Z M 1.609375 -3.78125 "
-           id="path2849" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-5">
-        <path
-           style="stroke: none;"
-           d="M 0.984375 0 L 5.09375 0 C 5.96875 0 6.59375 -0.234375 7.09375 -0.765625 C 7.53125 -1.234375 7.78125 -1.890625 7.78125 -2.59375 C 7.78125 -3.703125 7.28125 -4.359375 6.125 -4.8125 C 6.953125 -5.203125 7.390625 -5.875 7.390625 -6.796875 C 7.390625 -7.46875 7.140625 -8.046875 6.65625 -8.46875 C 6.1875 -8.90625 5.5625 -9.109375 4.6875 -9.109375 L 0.984375 -9.109375 L 0.984375 0 Z M 2.15625 -5.1875 L 2.15625 -8.09375 L 4.40625 -8.09375 C 5.046875 -8.09375 5.40625 -8 5.71875 -7.765625 C 6.046875 -7.515625 6.21875 -7.140625 6.21875 -6.640625 C 6.21875 -6.15625 6.046875 -5.765625 5.71875 -5.515625 C 5.40625 -5.28125 5.046875 -5.1875 4.40625 -5.1875 L 2.15625 -5.1875 Z M 2.15625 -1.03125 L 2.15625 -4.15625 L 4.984375 -4.15625 C 5.546875 -4.15625 5.921875 -4.03125 6.203125 -3.71875 C 6.46875 -3.4375 6.625 -3.03125 6.625 -2.59375 C 6.625 -2.15625 6.46875 -1.75 6.203125 -1.46875 C 5.921875 -1.15625 5.546875 -1.03125 4.984375 -1.03125 L 2.15625 -1.03125 Z M 2.15625 -1.03125 "
-           id="path2852" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-6">
-        <path
-           style="stroke: none;"
-           d="M 3.40625 -6.734375 C 1.5625 -6.734375 0.453125 -5.421875 0.453125 -3.21875 C 0.453125 -1.03125 1.546875 0.28125 3.40625 0.28125 C 5.25 0.28125 6.375 -1.03125 6.375 -3.171875 C 6.375 -5.4375 5.28125 -6.734375 3.40625 -6.734375 Z M 3.40625 -5.78125 C 4.59375 -5.78125 5.28125 -4.8125 5.28125 -3.1875 C 5.28125 -1.65625 4.5625 -0.671875 3.40625 -0.671875 C 2.25 -0.671875 1.53125 -1.640625 1.53125 -3.21875 C 1.53125 -4.796875 2.25 -5.78125 3.40625 -5.78125 Z M 3.40625 -5.78125 "
-           id="path2855" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-7">
-        <path
-           style="stroke: none;"
-           d="M 0.671875 -9.109375 L 0.671875 0 L 1.609375 0 L 1.609375 -0.84375 C 2.109375 -0.078125 2.78125 0.28125 3.6875 0.28125 C 5.40625 0.28125 6.53125 -1.125 6.53125 -3.296875 C 6.53125 -5.421875 5.46875 -6.734375 3.734375 -6.734375 C 2.84375 -6.734375 2.203125 -6.40625 1.71875 -5.65625 L 1.71875 -9.109375 L 0.671875 -9.109375 Z M 3.53125 -5.765625 C 4.703125 -5.765625 5.453125 -4.75 5.453125 -3.1875 C 5.453125 -1.703125 4.671875 -0.6875 3.53125 -0.6875 C 2.4375 -0.6875 1.71875 -1.6875 1.71875 -3.21875 C 1.71875 -4.765625 2.4375 -5.765625 3.53125 -5.765625 Z M 3.53125 -5.765625 "
-           id="path2858" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-8">
-        <path
-           style="stroke: none;"
-           d="M 8.28125 -6.28125 C 7.90625 -8.28125 6.765625 -9.265625 4.765625 -9.265625 C 3.53125 -9.265625 2.546875 -8.875 1.875 -8.125 C 1.046875 -7.21875 0.59375 -5.921875 0.59375 -4.453125 C 0.59375 -2.953125 1.0625 -1.65625 1.921875 -0.78125 C 2.625 -0.046875 3.53125 0.28125 4.71875 0.28125 C 6.9375 0.28125 8.1875 -0.90625 8.46875 -3.328125 L 7.265625 -3.328125 C 7.15625 -2.703125 7.03125 -2.28125 6.84375 -1.90625 C 6.46875 -1.15625 5.703125 -0.734375 4.71875 -0.734375 C 2.90625 -0.734375 1.765625 -2.1875 1.765625 -4.46875 C 1.765625 -6.796875 2.859375 -8.234375 4.625 -8.234375 C 5.359375 -8.234375 6.046875 -8.015625 6.421875 -7.65625 C 6.765625 -7.34375 6.953125 -6.96875 7.09375 -6.28125 L 8.28125 -6.28125 Z M 8.28125 -6.28125 "
-           id="path2861" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-9">
-        <path
-           style="stroke: none;"
-           d="M 1.109375 0 L 4.625 0 C 6.921875 0 8.34375 -1.71875 8.34375 -4.5625 C 8.34375 -7.390625 6.9375 -9.109375 4.625 -9.109375 L 1.109375 -9.109375 L 1.109375 0 Z M 2.28125 -1.03125 L 2.28125 -8.09375 L 4.421875 -8.09375 C 6.21875 -8.09375 7.171875 -6.875 7.171875 -4.546875 C 7.171875 -2.25 6.21875 -1.03125 4.421875 -1.03125 L 2.28125 -1.03125 Z M 2.28125 -1.03125 "
-           id="path2864" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-10">
-        <path
-           style="stroke: none;"
-           d="M 6.6875 -0.609375 C 6.578125 -0.59375 6.53125 -0.59375 6.46875 -0.59375 C 6.09375 -0.59375 5.90625 -0.78125 5.90625 -1.09375 L 5.90625 -4.953125 C 5.90625 -6.109375 5.046875 -6.734375 3.4375 -6.734375 C 2.484375 -6.734375 1.703125 -6.46875 1.265625 -5.96875 C 0.96875 -5.640625 0.84375 -5.265625 0.8125 -4.609375 L 1.859375 -4.609375 C 1.953125 -5.40625 2.421875 -5.78125 3.40625 -5.78125 C 4.34375 -5.78125 4.859375 -5.421875 4.859375 -4.796875 L 4.859375 -4.53125 C 4.859375 -4.09375 4.59375 -3.90625 3.78125 -3.796875 C 2.296875 -3.609375 2.078125 -3.5625 1.671875 -3.40625 C 0.90625 -3.09375 0.53125 -2.5 0.53125 -1.65625 C 0.53125 -0.46875 1.34375 0.28125 2.671875 0.28125 C 3.5 0.28125 4.15625 0 4.90625 -0.671875 C 4.96875 -0.015625 5.296875 0.28125 5.96875 0.28125 C 6.1875 0.28125 6.34375 0.265625 6.6875 0.171875 L 6.6875 -0.609375 Z M 4.859375 -2.0625 C 4.859375 -1.71875 4.765625 -1.5 4.453125 -1.21875 C 4.03125 -0.828125 3.515625 -0.625 2.90625 -0.625 C 2.09375 -0.625 1.609375 -1.015625 1.609375 -1.671875 C 1.609375 -2.359375 2.078125 -2.71875 3.1875 -2.875 C 4.28125 -3.03125 4.515625 -3.078125 4.859375 -3.234375 L 4.859375 -2.0625 Z M 4.859375 -2.0625 "
-           id="path2867" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-11">
-        <path
-           style="stroke: none;"
-           d="M 0.875 -6.546875 L 0.875 0 L 1.921875 0 L 1.921875 -3.609375 C 1.921875 -4.953125 2.625 -5.828125 3.703125 -5.828125 C 4.53125 -5.828125 5.046875 -5.328125 5.046875 -4.53125 L 5.046875 0 L 6.09375 0 L 6.09375 -4.953125 C 6.09375 -6.03125 5.28125 -6.734375 4.015625 -6.734375 C 3.03125 -6.734375 2.40625 -6.359375 1.84375 -5.453125 L 1.84375 -6.546875 L 0.875 -6.546875 Z M 0.875 -6.546875 "
-           id="path2870" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-12">
-        <path
-           style="stroke: none;"
-           d="M 2.28125 -4.15625 L 7.25 -4.15625 L 7.25 -5.171875 L 2.28125 -5.171875 L 2.28125 -8.09375 L 7.4375 -8.09375 L 7.4375 -9.109375 L 1.125 -9.109375 L 1.125 0 L 7.65625 0 L 7.65625 -1.03125 L 2.28125 -1.03125 L 2.28125 -4.15625 Z M 2.28125 -4.15625 "
-           id="path2873" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-13">
-        <path
-           style="stroke: none;"
-           d="M 5.46875 -4.71875 C 5.46875 -6.015625 4.609375 -6.734375 3.09375 -6.734375 C 1.578125 -6.734375 0.59375 -5.953125 0.59375 -4.734375 C 0.59375 -3.71875 1.109375 -3.21875 2.65625 -2.84375 L 3.640625 -2.609375 C 4.359375 -2.4375 4.65625 -2.171875 4.65625 -1.703125 C 4.65625 -1.09375 4.03125 -0.671875 3.125 -0.671875 C 2.5625 -0.671875 2.09375 -0.84375 1.828125 -1.109375 C 1.65625 -1.296875 1.59375 -1.484375 1.53125 -1.953125 L 0.421875 -1.953125 C 0.46875 -0.4375 1.328125 0.28125 3.03125 0.28125 C 4.6875 0.28125 5.734375 -0.53125 5.734375 -1.78125 C 5.734375 -2.765625 5.1875 -3.296875 3.890625 -3.609375 L 2.890625 -3.84375 C 2.03125 -4.046875 1.671875 -4.328125 1.671875 -4.78125 C 1.671875 -5.390625 2.21875 -5.78125 3.0625 -5.78125 C 3.90625 -5.78125 4.34375 -5.40625 4.375 -4.71875 L 5.46875 -4.71875 Z M 5.46875 -4.71875 "
-           id="path2876" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-14">
-        <path
-           style="stroke: none;"
-           d="M 0.875 -6.546875 L 0.875 0 L 1.921875 0 L 1.921875 -4.109375 C 1.921875 -5.0625 2.609375 -5.828125 3.46875 -5.828125 C 4.234375 -5.828125 4.671875 -5.34375 4.671875 -4.515625 L 4.671875 0 L 5.71875 0 L 5.71875 -4.109375 C 5.71875 -5.0625 6.40625 -5.828125 7.265625 -5.828125 C 8.03125 -5.828125 8.46875 -5.34375 8.46875 -4.515625 L 8.46875 0 L 9.53125 0 L 9.53125 -4.90625 C 9.53125 -6.09375 8.84375 -6.734375 7.625 -6.734375 C 6.75 -6.734375 6.21875 -6.46875 5.609375 -5.734375 C 5.21875 -6.4375 4.703125 -6.734375 3.84375 -6.734375 C 2.96875 -6.734375 2.40625 -6.40625 1.84375 -5.625 L 1.84375 -6.546875 L 0.875 -6.546875 Z M 0.875 -6.546875 "
-           id="path2879" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-15">
-        <path
-           style="stroke: none;"
-           d="M 0.859375 -6.546875 L 0.859375 0 L 1.90625 0 L 1.90625 -3.40625 C 1.90625 -4.34375 2.15625 -4.953125 2.65625 -5.3125 C 2.96875 -5.546875 3.28125 -5.625 4.015625 -5.640625 L 4.015625 -6.703125 C 3.84375 -6.71875 3.75 -6.734375 3.609375 -6.734375 C 2.9375 -6.734375 2.421875 -6.34375 1.828125 -5.359375 L 1.828125 -6.546875 L 0.859375 -6.546875 Z M 0.859375 -6.546875 "
-           id="path2882" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-16">
-        <path
-           style="stroke: none;"
-           d="M 6.1875 -9.109375 L 5.15625 -9.109375 L 5.15625 -5.71875 C 4.71875 -6.390625 4.015625 -6.734375 3.140625 -6.734375 C 1.4375 -6.734375 0.328125 -5.375 0.328125 -3.28125 C 0.328125 -1.078125 1.40625 0.28125 3.171875 0.28125 C 4.078125 0.28125 4.703125 -0.046875 5.265625 -0.859375 L 5.265625 0 L 6.1875 0 L 6.1875 -9.109375 Z M 3.3125 -5.765625 C 4.4375 -5.765625 5.15625 -4.765625 5.15625 -3.203125 C 5.15625 -1.6875 4.421875 -0.6875 3.328125 -0.6875 C 2.171875 -0.6875 1.40625 -1.703125 1.40625 -3.21875 C 1.40625 -4.75 2.171875 -5.765625 3.3125 -5.765625 Z M 3.3125 -5.765625 "
-           id="path2885" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-17">
-        <path
-           style="stroke: none;"
-           d="M 2.28125 -4.15625 L 6.640625 -4.15625 L 6.640625 -5.171875 L 2.28125 -5.171875 L 2.28125 -8.09375 L 7.234375 -8.09375 L 7.234375 -9.109375 L 1.125 -9.109375 L 1.125 0 L 2.28125 0 L 2.28125 -4.15625 Z M 2.28125 -4.15625 "
-           id="path2888" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-18">
-        <path
-           style="stroke: none;"
-           d="M 8.859375 -4.8125 L 5.0625 -4.8125 L 5.0625 -3.78125 L 7.84375 -3.78125 L 7.84375 -3.53125 C 7.84375 -1.90625 6.640625 -0.734375 4.96875 -0.734375 C 4.046875 -0.734375 3.21875 -1.078125 2.671875 -1.65625 C 2.078125 -2.3125 1.71875 -3.40625 1.71875 -4.53125 C 1.71875 -6.765625 2.984375 -8.234375 4.90625 -8.234375 C 6.296875 -8.234375 7.296875 -7.53125 7.546875 -6.34375 L 8.734375 -6.34375 C 8.40625 -8.203125 7.015625 -9.265625 4.921875 -9.265625 C 3.8125 -9.265625 2.90625 -8.96875 2.203125 -8.390625 C 1.15625 -7.515625 0.546875 -6.09375 0.546875 -4.46875 C 0.546875 -1.65625 2.265625 0.28125 4.71875 0.28125 C 5.96875 0.28125 6.953125 -0.171875 7.84375 -1.15625 L 8.125 0.046875 L 8.859375 0.046875 L 8.859375 -4.8125 Z M 8.859375 -4.8125 "
-           id="path2891" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-19">
-        <path
-           style="stroke: none;"
-           d="M 5.15625 -6.546875 L 5.15625 -5.59375 C 4.625 -6.375 3.984375 -6.734375 3.15625 -6.734375 C 1.484375 -6.734375 0.359375 -5.28125 0.359375 -3.15625 C 0.359375 -2.09375 0.65625 -1.21875 1.1875 -0.59375 C 1.671875 -0.03125 2.375 0.28125 3.0625 0.28125 C 3.890625 0.28125 4.46875 -0.0625 5.046875 -0.890625 L 5.046875 -0.546875 C 5.046875 0.34375 4.9375 0.875 4.671875 1.234375 C 4.40625 1.625 3.859375 1.84375 3.21875 1.84375 C 2.75 1.84375 2.328125 1.71875 2.03125 1.5 C 1.796875 1.3125 1.703125 1.140625 1.640625 0.75 L 0.578125 0.75 C 0.6875 1.984375 1.65625 2.71875 3.1875 2.71875 C 4.15625 2.71875 5 2.40625 5.421875 1.890625 C 5.921875 1.28125 6.109375 0.46875 6.109375 -1.078125 L 6.109375 -6.546875 L 5.15625 -6.546875 Z M 3.265625 -5.78125 C 4.390625 -5.78125 5.046875 -4.828125 5.046875 -3.1875 C 5.046875 -1.625 4.375 -0.671875 3.28125 -0.671875 C 2.140625 -0.671875 1.453125 -1.640625 1.453125 -3.21875 C 1.453125 -4.796875 2.15625 -5.78125 3.265625 -5.78125 Z M 3.265625 -5.78125 "
-           id="path2894" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-20">
-        <path
-           style="stroke: none;"
-           d="M 6.890625 -4.15625 L 6.890625 0 L 8.046875 0 L 8.046875 -9.109375 L 6.890625 -9.109375 L 6.890625 -5.171875 L 2.203125 -5.171875 L 2.203125 -9.109375 L 1.03125 -9.109375 L 1.03125 0 L 2.21875 0 L 2.21875 -4.15625 L 6.890625 -4.15625 Z M 6.890625 -4.15625 "
-           id="path2897" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-21">
-        <path
-           style="stroke: none;"
-           d="M 2.421875 -9.109375 L 1.25 -9.109375 L 1.25 0 L 2.421875 0 L 2.421875 -9.109375 Z M 2.421875 -9.109375 "
-           id="path2900" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-22">
-        <path
-           style="stroke: none;"
-           d="M 4.15625 -9.109375 L 4.15625 -2.703125 C 4.15625 -1.96875 4.09375 -1.5625 3.875 -1.25 C 3.65625 -0.90625 3.21875 -0.6875 2.765625 -0.6875 C 1.890625 -0.6875 1.40625 -1.28125 1.40625 -2.34375 L 1.40625 -2.921875 L 0.21875 -2.921875 L 0.21875 -2.125 C 0.21875 -0.65625 1.1875 0.28125 2.75 0.28125 C 4.34375 0.28125 5.328125 -0.703125 5.328125 -2.28125 L 5.328125 -9.109375 L 4.15625 -9.109375 Z M 4.15625 -9.109375 "
-           id="path2903" />
-      </symbol>
-      <symbol
-         overflow="visible"
-         id="glyph0-23">
-        <path
-           style="stroke: none;"
-           d="M 3.21875 -6.546875 L 2.140625 -6.546875 L 2.140625 -7.578125 C 2.140625 -8.015625 2.390625 -8.234375 2.859375 -8.234375 C 2.953125 -8.234375 2.984375 -8.234375 3.21875 -8.21875 L 3.21875 -9.09375 C 2.984375 -9.140625 2.84375 -9.15625 2.640625 -9.15625 C 1.671875 -9.15625 1.09375 -8.59375 1.09375 -7.65625 L 1.09375 -6.546875 L 0.21875 -6.546875 L 0.21875 -5.703125 L 1.09375 -5.703125 L 1.09375 0 L 2.140625 0 L 2.140625 -5.703125 L 3.21875 -5.703125 L 3.21875 -6.546875 Z M 3.21875 -6.546875 "
-           id="path2906" />
-      </symbol>
-    </g>
-    <clipPath
-       id="clip0">
-      <rect
-         width="144"
-         height="360"
-         id="rect2909" />
-    </clipPath>
-    <clipPath
-       id="clip1">
-      <path
-         d="M 0 0 L 145 0 L 145 361 L 0 361 Z M 0 0 "
-         id="path2912" />
-    </clipPath>
-    <clipPath
-       id="clip2">
-      <path
-         d="M 0 0 L 145 0 L 145 361 L 0 361 Z M 0 0 "
-         id="path2915" />
-    </clipPath>
-  </defs>
-  <g
-     id="surface0"
-     clip-path="url(#clip0)">
-    <g
-       clip-path="url(#clip2)"
-       clip-rule="nonzero"
-       id="g2944">
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g2946">
-        <use
-           xlink:href="#glyph0-0"
-           x="12.53334"
-           y="24.70282"
-           id="use2948" />
-        <use
-           xlink:href="#glyph0-1"
-           x="20.870865"
-           y="24.70282"
-           id="use2950" />
-        <use
-           xlink:href="#glyph0-2"
-           x="23.645874"
-           y="24.70282"
-           id="use2952" />
-        <use
-           xlink:href="#glyph0-3"
-           x="26.420883"
-           y="24.70282"
-           id="use2954" />
-        <use
-           xlink:href="#glyph0-4"
-           x="32.670914"
-           y="24.70282"
-           id="use2956" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g2958">
-        <use
-           xlink:href="#glyph0-5"
-           x="12.53334"
-           y="41.369492"
-           id="use2960" />
-        <use
-           xlink:href="#glyph0-6"
-           x="20.870865"
-           y="41.369492"
-           id="use2962" />
-        <use
-           xlink:href="#glyph0-7"
-           x="27.820892"
-           y="41.369492"
-           id="use2964" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g2966">
-        <use
-           xlink:href="#glyph0-8"
-           x="12.53334"
-           y="58.036148"
-           id="use2968" />
-        <use
-           xlink:href="#glyph0-4"
-           x="21.55838"
-           y="58.036148"
-           id="use2970" />
-        <use
-           xlink:href="#glyph0-3"
-           x="28.508408"
-           y="58.036148"
-           id="use2972" />
-        <use
-           xlink:href="#glyph0-2"
-           x="34.758438"
-           y="58.036148"
-           id="use2974" />
-        <use
-           xlink:href="#glyph0-1"
-           x="37.533447"
-           y="58.036148"
-           id="use2976" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g2978">
-        <use
-           xlink:href="#glyph0-0"
-           x="12.53334"
-           y="74.70282"
-           id="use2980" />
-        <use
-           xlink:href="#glyph0-1"
-           x="20.870865"
-           y="74.70282"
-           id="use2982" />
-        <use
-           xlink:href="#glyph0-2"
-           x="23.645874"
-           y="74.70282"
-           id="use2984" />
-        <use
-           xlink:href="#glyph0-3"
-           x="26.420883"
-           y="74.70282"
-           id="use2986" />
-        <use
-           xlink:href="#glyph0-4"
-           x="32.670914"
-           y="74.70282"
-           id="use2988" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g2990">
-        <use
-           xlink:href="#glyph0-9"
-           x="12.53334"
-           y="91.369492"
-           id="use2992" />
-        <use
-           xlink:href="#glyph0-2"
-           x="21.55838"
-           y="91.369492"
-           id="use2994" />
-        <use
-           xlink:href="#glyph0-10"
-           x="24.333389"
-           y="91.369492"
-           id="use2996" />
-        <use
-           xlink:href="#glyph0-11"
-           x="31.283417"
-           y="91.369492"
-           id="use2998" />
-        <use
-           xlink:href="#glyph0-10"
-           x="38.233444"
-           y="91.369492"
-           id="use3000" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3002">
-        <use
-           xlink:href="#glyph0-8"
-           x="12.53334"
-           y="108.036148"
-           id="use3004" />
-        <use
-           xlink:href="#glyph0-4"
-           x="21.55838"
-           y="108.036148"
-           id="use3006" />
-        <use
-           xlink:href="#glyph0-3"
-           x="28.508408"
-           y="108.036148"
-           id="use3008" />
-        <use
-           xlink:href="#glyph0-2"
-           x="34.758438"
-           y="108.036148"
-           id="use3010" />
-        <use
-           xlink:href="#glyph0-1"
-           x="37.533447"
-           y="108.036148"
-           id="use3012" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3014">
-        <use
-           xlink:href="#glyph0-12"
-           x="12.53334"
-           y="124.70282"
-           id="use3016" />
-        <use
-           xlink:href="#glyph0-13"
-           x="20.870865"
-           y="124.70282"
-           id="use3018" />
-        <use
-           xlink:href="#glyph0-14"
-           x="27.120895"
-           y="124.70282"
-           id="use3020" />
-        <use
-           xlink:href="#glyph0-4"
-           x="37.533432"
-           y="124.70282"
-           id="use3022" />
-        <use
-           xlink:href="#glyph0-15"
-           x="44.483459"
-           y="124.70282"
-           id="use3024" />
-        <use
-           xlink:href="#glyph0-10"
-           x="48.645981"
-           y="124.70282"
-           id="use3026" />
-        <use
-           xlink:href="#glyph0-1"
-           x="55.596008"
-           y="124.70282"
-           id="use3028" />
-        <use
-           xlink:href="#glyph0-16"
-           x="58.371017"
-           y="124.70282"
-           id="use3030" />
-        <use
-           xlink:href="#glyph0-10"
-           x="65.321045"
-           y="124.70282"
-           id="use3032" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3034">
-        <use
-           xlink:href="#glyph0-5"
-           x="12.53334"
-           y="141.369492"
-           id="use3036" />
-        <use
-           xlink:href="#glyph0-6"
-           x="20.870865"
-           y="141.369492"
-           id="use3038" />
-        <use
-           xlink:href="#glyph0-7"
-           x="27.820892"
-           y="141.369492"
-           id="use3040" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3042">
-        <use
-           xlink:href="#glyph0-8"
-           x="12.53334"
-           y="158.036148"
-           id="use3044" />
-        <use
-           xlink:href="#glyph0-4"
-           x="21.55838"
-           y="158.036148"
-           id="use3046" />
-        <use
-           xlink:href="#glyph0-3"
-           x="28.508408"
-           y="158.036148"
-           id="use3048" />
-        <use
-           xlink:href="#glyph0-2"
-           x="34.758438"
-           y="158.036148"
-           id="use3050" />
-        <use
-           xlink:href="#glyph0-1"
-           x="37.533447"
-           y="158.036148"
-           id="use3052" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3054">
-        <use
-           xlink:href="#glyph0-9"
-           x="12.53334"
-           y="174.70282"
-           id="use3056" />
-        <use
-           xlink:href="#glyph0-2"
-           x="21.55838"
-           y="174.70282"
-           id="use3058" />
-        <use
-           xlink:href="#glyph0-10"
-           x="24.333389"
-           y="174.70282"
-           id="use3060" />
-        <use
-           xlink:href="#glyph0-11"
-           x="31.283417"
-           y="174.70282"
-           id="use3062" />
-        <use
-           xlink:href="#glyph0-10"
-           x="38.233444"
-           y="174.70282"
-           id="use3064" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3066">
-        <use
-           xlink:href="#glyph0-0"
-           x="12.53334"
-           y="191.369492"
-           id="use3068" />
-        <use
-           xlink:href="#glyph0-1"
-           x="20.870865"
-           y="191.369492"
-           id="use3070" />
-        <use
-           xlink:href="#glyph0-2"
-           x="23.645874"
-           y="191.369492"
-           id="use3072" />
-        <use
-           xlink:href="#glyph0-3"
-           x="26.420883"
-           y="191.369492"
-           id="use3074" />
-        <use
-           xlink:href="#glyph0-4"
-           x="32.670914"
-           y="191.369492"
-           id="use3076" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3078">
-        <use
-           xlink:href="#glyph0-5"
-           x="12.53334"
-           y="208.036148"
-           id="use3080" />
-        <use
-           xlink:href="#glyph0-6"
-           x="20.870865"
-           y="208.036148"
-           id="use3082" />
-        <use
-           xlink:href="#glyph0-7"
-           x="27.820892"
-           y="208.036148"
-           id="use3084" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3086">
-        <use
-           xlink:href="#glyph0-9"
-           x="12.53334"
-           y="224.70282"
-           id="use3088" />
-        <use
-           xlink:href="#glyph0-2"
-           x="21.55838"
-           y="224.70282"
-           id="use3090" />
-        <use
-           xlink:href="#glyph0-10"
-           x="24.333389"
-           y="224.70282"
-           id="use3092" />
-        <use
-           xlink:href="#glyph0-11"
-           x="31.283417"
-           y="224.70282"
-           id="use3094" />
-        <use
-           xlink:href="#glyph0-10"
-           x="38.233444"
-           y="224.70282"
-           id="use3096" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3098">
-        <use
-           xlink:href="#glyph0-12"
-           x="12.53334"
-           y="241.369492"
-           id="use3100" />
-        <use
-           xlink:href="#glyph0-13"
-           x="20.870865"
-           y="241.369492"
-           id="use3102" />
-        <use
-           xlink:href="#glyph0-14"
-           x="27.120895"
-           y="241.369492"
-           id="use3104" />
-        <use
-           xlink:href="#glyph0-4"
-           x="37.533432"
-           y="241.369492"
-           id="use3106" />
-        <use
-           xlink:href="#glyph0-15"
-           x="44.483459"
-           y="241.369492"
-           id="use3108" />
-        <use
-           xlink:href="#glyph0-10"
-           x="48.645981"
-           y="241.369492"
-           id="use3110" />
-        <use
-           xlink:href="#glyph0-1"
-           x="55.596008"
-           y="241.369492"
-           id="use3112" />
-        <use
-           xlink:href="#glyph0-16"
-           x="58.371017"
-           y="241.369492"
-           id="use3114" />
-        <use
-           xlink:href="#glyph0-10"
-           x="65.321045"
-           y="241.369492"
-           id="use3116" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3118">
-        <use
-           xlink:href="#glyph0-17"
-           x="12.53334"
-           y="258.036148"
-           id="use3120" />
-        <use
-           xlink:href="#glyph0-10"
-           x="20.170868"
-           y="258.036148"
-           id="use3122" />
-        <use
-           xlink:href="#glyph0-7"
-           x="27.120895"
-           y="258.036148"
-           id="use3124" />
-        <use
-           xlink:href="#glyph0-2"
-           x="34.070923"
-           y="258.036148"
-           id="use3126" />
-        <use
-           xlink:href="#glyph0-4"
-           x="36.845932"
-           y="258.036148"
-           id="use3128" />
-        <use
-           xlink:href="#glyph0-11"
-           x="43.795959"
-           y="258.036148"
-           id="use3130" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3132">
-        <use
-           xlink:href="#glyph0-18"
-           x="12.53334"
-           y="274.70282"
-           id="use3134" />
-        <use
-           xlink:href="#glyph0-2"
-           x="22.258377"
-           y="274.70282"
-           id="use3136" />
-        <use
-           xlink:href="#glyph0-19"
-           x="25.033386"
-           y="274.70282"
-           id="use3138" />
-        <use
-           xlink:href="#glyph0-2"
-           x="31.983414"
-           y="274.70282"
-           id="use3140" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3142">
-        <use
-           xlink:href="#glyph0-9"
-           x="12.53334"
-           y="291.369492"
-           id="use3144" />
-        <use
-           xlink:href="#glyph0-2"
-           x="21.55838"
-           y="291.369492"
-           id="use3146" />
-        <use
-           xlink:href="#glyph0-10"
-           x="24.333389"
-           y="291.369492"
-           id="use3148" />
-        <use
-           xlink:href="#glyph0-11"
-           x="31.283417"
-           y="291.369492"
-           id="use3150" />
-        <use
-           xlink:href="#glyph0-10"
-           x="38.233444"
-           y="291.369492"
-           id="use3152" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3154">
-        <use
-           xlink:href="#glyph0-12"
-           x="12.53334"
-           y="308.036148"
-           id="use3156" />
-        <use
-           xlink:href="#glyph0-13"
-           x="20.870865"
-           y="308.036148"
-           id="use3158" />
-        <use
-           xlink:href="#glyph0-14"
-           x="27.120895"
-           y="308.036148"
-           id="use3160" />
-        <use
-           xlink:href="#glyph0-4"
-           x="37.533432"
-           y="308.036148"
-           id="use3162" />
-        <use
-           xlink:href="#glyph0-15"
-           x="44.483459"
-           y="308.036148"
-           id="use3164" />
-        <use
-           xlink:href="#glyph0-10"
-           x="48.645981"
-           y="308.036148"
-           id="use3166" />
-        <use
-           xlink:href="#glyph0-1"
-           x="55.596008"
-           y="308.036148"
-           id="use3168" />
-        <use
-           xlink:href="#glyph0-16"
-           x="58.371017"
-           y="308.036148"
-           id="use3170" />
-        <use
-           xlink:href="#glyph0-10"
-           x="65.321045"
-           y="308.036148"
-           id="use3172" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3174">
-        <use
-           xlink:href="#glyph0-0"
-           x="12.53334"
-           y="324.70282"
-           id="use3176" />
-        <use
-           xlink:href="#glyph0-1"
-           x="20.870865"
-           y="324.70282"
-           id="use3178" />
-        <use
-           xlink:href="#glyph0-2"
-           x="23.645874"
-           y="324.70282"
-           id="use3180" />
-        <use
-           xlink:href="#glyph0-3"
-           x="26.420883"
-           y="324.70282"
-           id="use3182" />
-        <use
-           xlink:href="#glyph0-4"
-           x="32.670914"
-           y="324.70282"
-           id="use3184" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3186">
-        <use
-           xlink:href="#glyph0-20"
-           x="12.53334"
-           y="341.369492"
-           id="use3188" />
-        <use
-           xlink:href="#glyph0-4"
-           x="21.55838"
-           y="341.369492"
-           id="use3190" />
-        <use
-           xlink:href="#glyph0-1"
-           x="28.508408"
-           y="341.369492"
-           id="use3192" />
-        <use
-           xlink:href="#glyph0-4"
-           x="31.283417"
-           y="341.369492"
-           id="use3194" />
-        <use
-           xlink:href="#glyph0-11"
-           x="38.233444"
-           y="341.369492"
-           id="use3196" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3198">
-        <use
-           xlink:href="#glyph0-5"
-           x="79.199997"
-           y="24.70282"
-           id="use3200" />
-        <use
-           xlink:href="#glyph0-6"
-           x="87.537521"
-           y="24.70282"
-           id="use3202" />
-        <use
-           xlink:href="#glyph0-7"
-           x="94.487549"
-           y="24.70282"
-           id="use3204" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3206">
-        <use
-           xlink:href="#glyph0-9"
-           x="79.199997"
-           y="41.369492"
-           id="use3208" />
-        <use
-           xlink:href="#glyph0-2"
-           x="88.225037"
-           y="41.369492"
-           id="use3210" />
-        <use
-           xlink:href="#glyph0-10"
-           x="91.000046"
-           y="41.369492"
-           id="use3212" />
-        <use
-           xlink:href="#glyph0-11"
-           x="97.950073"
-           y="41.369492"
-           id="use3214" />
-        <use
-           xlink:href="#glyph0-10"
-           x="104.900101"
-           y="41.369492"
-           id="use3216" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3218">
-        <use
-           xlink:href="#glyph0-9"
-           x="79.199997"
-           y="58.036148"
-           id="use3220" />
-        <use
-           xlink:href="#glyph0-2"
-           x="88.225037"
-           y="58.036148"
-           id="use3222" />
-        <use
-           xlink:href="#glyph0-10"
-           x="91.000046"
-           y="58.036148"
-           id="use3224" />
-        <use
-           xlink:href="#glyph0-11"
-           x="97.950073"
-           y="58.036148"
-           id="use3226" />
-        <use
-           xlink:href="#glyph0-10"
-           x="104.900101"
-           y="58.036148"
-           id="use3228" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3230">
-        <use
-           xlink:href="#glyph0-12"
-           x="79.199997"
-           y="74.70282"
-           id="use3232" />
-        <use
-           xlink:href="#glyph0-13"
-           x="87.537521"
-           y="74.70282"
-           id="use3234" />
-        <use
-           xlink:href="#glyph0-14"
-           x="93.787552"
-           y="74.70282"
-           id="use3236" />
-        <use
-           xlink:href="#glyph0-4"
-           x="104.200089"
-           y="74.70282"
-           id="use3238" />
-        <use
-           xlink:href="#glyph0-15"
-           x="111.150116"
-           y="74.70282"
-           id="use3240" />
-        <use
-           xlink:href="#glyph0-10"
-           x="115.312637"
-           y="74.70282"
-           id="use3242" />
-        <use
-           xlink:href="#glyph0-1"
-           x="122.262665"
-           y="74.70282"
-           id="use3244" />
-        <use
-           xlink:href="#glyph0-16"
-           x="125.037674"
-           y="74.70282"
-           id="use3246" />
-        <use
-           xlink:href="#glyph0-10"
-           x="131.987701"
-           y="74.70282"
-           id="use3248" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3250">
-        <use
-           xlink:href="#glyph0-12"
-           x="79.199997"
-           y="91.369492"
-           id="use3252" />
-        <use
-           xlink:href="#glyph0-13"
-           x="87.537521"
-           y="91.369492"
-           id="use3254" />
-        <use
-           xlink:href="#glyph0-14"
-           x="93.787552"
-           y="91.369492"
-           id="use3256" />
-        <use
-           xlink:href="#glyph0-4"
-           x="104.200089"
-           y="91.369492"
-           id="use3258" />
-        <use
-           xlink:href="#glyph0-15"
-           x="111.150116"
-           y="91.369492"
-           id="use3260" />
-        <use
-           xlink:href="#glyph0-10"
-           x="115.312637"
-           y="91.369492"
-           id="use3262" />
-        <use
-           xlink:href="#glyph0-1"
-           x="122.262665"
-           y="91.369492"
-           id="use3264" />
-        <use
-           xlink:href="#glyph0-16"
-           x="125.037674"
-           y="91.369492"
-           id="use3266" />
-        <use
-           xlink:href="#glyph0-10"
-           x="131.987701"
-           y="91.369492"
-           id="use3268" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3270">
-        <use
-           xlink:href="#glyph0-17"
-           x="79.199997"
-           y="108.036148"
-           id="use3272" />
-        <use
-           xlink:href="#glyph0-10"
-           x="86.837524"
-           y="108.036148"
-           id="use3274" />
-        <use
-           xlink:href="#glyph0-7"
-           x="93.787552"
-           y="108.036148"
-           id="use3276" />
-        <use
-           xlink:href="#glyph0-2"
-           x="100.737579"
-           y="108.036148"
-           id="use3278" />
-        <use
-           xlink:href="#glyph0-4"
-           x="103.512589"
-           y="108.036148"
-           id="use3280" />
-        <use
-           xlink:href="#glyph0-11"
-           x="110.462616"
-           y="108.036148"
-           id="use3282" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3284">
-        <use
-           xlink:href="#glyph0-17"
-           x="79.199997"
-           y="124.70282"
-           id="use3286" />
-        <use
-           xlink:href="#glyph0-10"
-           x="86.837524"
-           y="124.70282"
-           id="use3288" />
-        <use
-           xlink:href="#glyph0-7"
-           x="93.787552"
-           y="124.70282"
-           id="use3290" />
-        <use
-           xlink:href="#glyph0-2"
-           x="100.737579"
-           y="124.70282"
-           id="use3292" />
-        <use
-           xlink:href="#glyph0-4"
-           x="103.512589"
-           y="124.70282"
-           id="use3294" />
-        <use
-           xlink:href="#glyph0-11"
-           x="110.462616"
-           y="124.70282"
-           id="use3296" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3298">
-        <use
-           xlink:href="#glyph0-18"
-           x="79.199997"
-           y="141.369492"
-           id="use3300" />
-        <use
-           xlink:href="#glyph0-2"
-           x="88.925034"
-           y="141.369492"
-           id="use3302" />
-        <use
-           xlink:href="#glyph0-19"
-           x="91.700043"
-           y="141.369492"
-           id="use3304" />
-        <use
-           xlink:href="#glyph0-2"
-           x="98.65007"
-           y="141.369492"
-           id="use3306" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3308">
-        <use
-           xlink:href="#glyph0-18"
-           x="79.199997"
-           y="158.036148"
-           id="use3310" />
-        <use
-           xlink:href="#glyph0-2"
-           x="88.925034"
-           y="158.036148"
-           id="use3312" />
-        <use
-           xlink:href="#glyph0-19"
-           x="91.700043"
-           y="158.036148"
-           id="use3314" />
-        <use
-           xlink:href="#glyph0-2"
-           x="98.65007"
-           y="158.036148"
-           id="use3316" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3318">
-        <use
-           xlink:href="#glyph0-18"
-           x="79.199997"
-           y="174.70282"
-           id="use3320" />
-        <use
-           xlink:href="#glyph0-2"
-           x="88.925034"
-           y="174.70282"
-           id="use3322" />
-        <use
-           xlink:href="#glyph0-19"
-           x="91.700043"
-           y="174.70282"
-           id="use3324" />
-        <use
-           xlink:href="#glyph0-2"
-           x="98.65007"
-           y="174.70282"
-           id="use3326" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3328">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="191.369492"
-           id="use3330" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="191.369492"
-           id="use3332" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="191.369492"
-           id="use3334" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="191.369492"
-           id="use3336" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="191.369492"
-           id="use3338" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3340">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="208.036148"
-           id="use3342" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="208.036148"
-           id="use3344" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="208.036148"
-           id="use3346" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="208.036148"
-           id="use3348" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="208.036148"
-           id="use3350" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3352">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="224.70282"
-           id="use3354" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="224.70282"
-           id="use3356" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="224.70282"
-           id="use3358" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="224.70282"
-           id="use3360" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="224.70282"
-           id="use3362" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3364">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="241.369492"
-           id="use3366" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="241.369492"
-           id="use3368" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="241.369492"
-           id="use3370" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="241.369492"
-           id="use3372" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="241.369492"
-           id="use3374" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3376">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="258.036148"
-           id="use3378" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="258.036148"
-           id="use3380" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="258.036148"
-           id="use3382" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="258.036148"
-           id="use3384" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="258.036148"
-           id="use3386" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3388">
-        <use
-           xlink:href="#glyph0-20"
-           x="79.199997"
-           y="274.70282"
-           id="use3390" />
-        <use
-           xlink:href="#glyph0-4"
-           x="88.225037"
-           y="274.70282"
-           id="use3392" />
-        <use
-           xlink:href="#glyph0-1"
-           x="95.175064"
-           y="274.70282"
-           id="use3394" />
-        <use
-           xlink:href="#glyph0-4"
-           x="97.950073"
-           y="274.70282"
-           id="use3396" />
-        <use
-           xlink:href="#glyph0-11"
-           x="104.900101"
-           y="274.70282"
-           id="use3398" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3400">
-        <use
-           xlink:href="#glyph0-21"
-           x="79.199997"
-           y="291.369492"
-           id="use3402" />
-        <use
-           xlink:href="#glyph0-10"
-           x="82.675003"
-           y="291.369492"
-           id="use3404" />
-        <use
-           xlink:href="#glyph0-11"
-           x="89.625031"
-           y="291.369492"
-           id="use3406" />
-        <use
-           xlink:href="#glyph0-11"
-           x="96.575058"
-           y="291.369492"
-           id="use3408" />
-        <use
-           xlink:href="#glyph0-2"
-           x="103.525085"
-           y="291.369492"
-           id="use3410" />
-        <use
-           xlink:href="#glyph0-13"
-           x="106.300095"
-           y="291.369492"
-           id="use3412" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3414">
-        <use
-           xlink:href="#glyph0-21"
-           x="79.199997"
-           y="308.036148"
-           id="use3416" />
-        <use
-           xlink:href="#glyph0-10"
-           x="82.675003"
-           y="308.036148"
-           id="use3418" />
-        <use
-           xlink:href="#glyph0-11"
-           x="89.625031"
-           y="308.036148"
-           id="use3420" />
-        <use
-           xlink:href="#glyph0-11"
-           x="96.575058"
-           y="308.036148"
-           id="use3422" />
-        <use
-           xlink:href="#glyph0-2"
-           x="103.525085"
-           y="308.036148"
-           id="use3424" />
-        <use
-           xlink:href="#glyph0-13"
-           x="106.300095"
-           y="308.036148"
-           id="use3426" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3428">
-        <use
-           xlink:href="#glyph0-22"
-           x="79.199997"
-           y="324.70282"
-           id="use3430" />
-        <use
-           xlink:href="#glyph0-4"
-           x="85.450027"
-           y="324.70282"
-           id="use3432" />
-        <use
-           xlink:href="#glyph0-11"
-           x="92.400055"
-           y="324.70282"
-           id="use3434" />
-        <use
-           xlink:href="#glyph0-11"
-           x="99.350082"
-           y="324.70282"
-           id="use3436" />
-        <use
-           xlink:href="#glyph0-2"
-           x="106.30011"
-           y="324.70282"
-           id="use3438" />
-        <use
-           xlink:href="#glyph0-23"
-           x="109.075119"
-           y="324.70282"
-           id="use3440" />
-        <use
-           xlink:href="#glyph0-4"
-           x="112.550125"
-           y="324.70282"
-           id="use3442" />
-        <use
-           xlink:href="#glyph0-15"
-           x="119.500153"
-           y="324.70282"
-           id="use3444" />
-      </g>
-      <g
-         style="fill: rgb(0%,0%,0%); opacity: 1;"
-         id="g3446">
-        <use
-           xlink:href="#glyph0-22"
-           x="79.199997"
-           y="341.369492"
-           id="use3448" />
-        <use
-           xlink:href="#glyph0-4"
-           x="85.450027"
-           y="341.369492"
-           id="use3450" />
-        <use
-           xlink:href="#glyph0-11"
-           x="92.400055"
-           y="341.369492"
-           id="use3452" />
-        <use
-           xlink:href="#glyph0-11"
-           x="99.350082"
-           y="341.369492"
-           id="use3454" />
-        <use
-           xlink:href="#glyph0-2"
-           x="106.30011"
-           y="341.369492"
-           id="use3456" />
-        <use
-           xlink:href="#glyph0-23"
-           x="109.075119"
-           y="341.369492"
-           id="use3458" />
-        <use
-           xlink:href="#glyph0-4"
-           x="112.550125"
-           y="341.369492"
-           id="use3460" />
-        <use
-           xlink:href="#glyph0-15"
-           x="119.500153"
-           y="341.369492"
-           id="use3462" />
-      </g>
-    </g>
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ercomps.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ercomps.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ex-betw.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ex-betw.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ex-close.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ex-close.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ex-deg.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ex-deg.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ex-ev.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ex-ev.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/ex-pagerank.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/ex-pagerank.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/example.graph.Rdata and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/example.graph.Rdata differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/example.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/example.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/frplots.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/frplots.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/groups.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/groups.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/homepage.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/homepage.png differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/igraph.svg igraph-0.6.5/doc/presentations/wien08/igraph.svg
--- igraph-0.6.5~quantal1/doc/presentations/wien08/igraph.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/igraph.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,2783 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:xlink="http://www.w3.org/1999/xlink"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   width="400"
-   height="400"
-   id="svg2"
-   sodipodi:version="0.32"
-   inkscape:version="0.46"
-   version="1.0"
-   sodipodi:docbase="/home/csardi/works/net/igraph-3/doc/presentations/wien08"
-   sodipodi:docname="igraph.svg"
-   inkscape:output_extension="org.inkscape.output.svg.inkscape">
-  <defs
-     id="defs4">
-    <inkscape:perspective
-       sodipodi:type="inkscape:persp3d"
-       inkscape:vp_x="0 : 200 : 1"
-       inkscape:vp_y="0 : 1000 : 0"
-       inkscape:vp_z="400 : 200 : 1"
-       inkscape:persp3d-origin="200 : 133.33333 : 1"
-       id="perspective448" />
-    <marker
-       inkscape:stockid="Dot_m"
-       orient="auto"
-       refY="0"
-       refX="0"
-       id="Dot_m"
-       style="overflow:visible">
-      <path
-         id="path4456"
-         d="M -2.5,-1 C -2.5,1.76 -4.74,4 -7.5,4 C -10.26,4 -12.5,1.76 -12.5,-1 C -12.5,-3.76 -10.26,-6 -7.5,-6 C -4.74,-6 -2.5,-3.76 -2.5,-1 z "
-         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none;marker-end:none"
-         transform="matrix(0.4,0,0,0.4,2.96,0.4)" />
-    </marker>
-    <marker
-       inkscape:stockid="TriangleOutM"
-       orient="auto"
-       refY="0"
-       refX="0"
-       id="TriangleOutM"
-       style="overflow:visible">
-      <path
-         id="path4420"
-         d="M 5.77,0 L -2.88,5 L -2.88,-5 L 5.77,0 z "
-         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
-         transform="scale(0.4,0.4)" />
-    </marker>
-    <clipPath
-       id="clip2">
-      <path
-         id="path2915"
-         d="M 0,0 L 145,0 L 145,361 L 0,361 L 0,0 z " />
-    </clipPath>
-    <clipPath
-       id="clip1">
-      <path
-         id="path2912"
-         d="M 0,0 L 145,0 L 145,361 L 0,361 L 0,0 z " />
-    </clipPath>
-    <clipPath
-       id="clip0">
-      <rect
-         id="rect2909"
-         height="360"
-         width="144"
-         x="0"
-         y="0" />
-    </clipPath>
-    <g
-       id="g2834">
-      <symbol
-         id="glyph0-0"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2837"
-           d="M 5.921875,-2.734375 L 6.859375,0 L 8.15625,0 L 4.96875,-9.109375 L 3.46875,-9.109375 L 0.21875,0 L 1.453125,0 L 2.40625,-2.734375 L 5.921875,-2.734375 z M 5.59375,-3.71875 L 2.703125,-3.71875 L 4.203125,-7.859375 L 5.59375,-3.71875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-1"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2840"
-           d="M 1.90625,-9.109375 L 0.84375,-9.109375 L 0.84375,0 L 1.90625,0 L 1.90625,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-2"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2843"
-           d="M 1.875,-6.546875 L 0.84375,-6.546875 L 0.84375,0 L 1.875,0 L 1.875,-6.546875 z M 1.875,-9.109375 L 0.828125,-9.109375 L 0.828125,-7.796875 L 1.875,-7.796875 L 1.875,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-3"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2846"
-           d="M 5.890625,-4.34375 C 5.84375,-4.984375 5.703125,-5.40625 5.453125,-5.765625 C 5,-6.375 4.21875,-6.734375 3.296875,-6.734375 C 1.53125,-6.734375 0.390625,-5.34375 0.390625,-3.15625 C 0.390625,-1.046875 1.515625,0.28125 3.28125,0.28125 C 4.84375,0.28125 5.84375,-0.65625 5.96875,-2.25 L 4.90625,-2.25 C 4.734375,-1.203125 4.203125,-0.671875 3.3125,-0.671875 C 2.15625,-0.671875 1.46875,-1.609375 1.46875,-3.15625 C 1.46875,-4.796875 2.15625,-5.78125 3.28125,-5.78125 C 4.15625,-5.78125 4.71875,-5.265625 4.84375,-4.34375 L 5.890625,-4.34375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-4"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2849"
-           d="M 6.40625,-2.921875 C 6.40625,-3.921875 6.34375,-4.53125 6.15625,-5.015625 C 5.71875,-6.09375 4.71875,-6.734375 3.5,-6.734375 C 1.671875,-6.734375 0.5,-5.34375 0.5,-3.1875 C 0.5,-1.03125 1.640625,0.28125 3.46875,0.28125 C 4.96875,0.28125 6.015625,-0.5625 6.28125,-1.984375 L 5.21875,-1.984375 C 4.9375,-1.125 4.34375,-0.671875 3.515625,-0.671875 C 2.84375,-0.671875 2.28125,-0.96875 1.9375,-1.53125 C 1.6875,-1.90625 1.59375,-2.28125 1.59375,-2.921875 L 6.40625,-2.921875 z M 1.609375,-3.78125 C 1.703125,-4.984375 2.4375,-5.78125 3.484375,-5.78125 C 4.515625,-5.78125 5.296875,-4.921875 5.296875,-3.84375 C 5.296875,-3.828125 5.296875,-3.796875 5.28125,-3.78125 L 1.609375,-3.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-5"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2852"
-           d="M 0.984375,0 L 5.09375,0 C 5.96875,0 6.59375,-0.234375 7.09375,-0.765625 C 7.53125,-1.234375 7.78125,-1.890625 7.78125,-2.59375 C 7.78125,-3.703125 7.28125,-4.359375 6.125,-4.8125 C 6.953125,-5.203125 7.390625,-5.875 7.390625,-6.796875 C 7.390625,-7.46875 7.140625,-8.046875 6.65625,-8.46875 C 6.1875,-8.90625 5.5625,-9.109375 4.6875,-9.109375 L 0.984375,-9.109375 L 0.984375,0 z M 2.15625,-5.1875 L 2.15625,-8.09375 L 4.40625,-8.09375 C 5.046875,-8.09375 5.40625,-8 5.71875,-7.765625 C 6.046875,-7.515625 6.21875,-7.140625 6.21875,-6.640625 C 6.21875,-6.15625 6.046875,-5.765625 5.71875,-5.515625 C 5.40625,-5.28125 5.046875,-5.1875 4.40625,-5.1875 L 2.15625,-5.1875 z M 2.15625,-1.03125 L 2.15625,-4.15625 L 4.984375,-4.15625 C 5.546875,-4.15625 5.921875,-4.03125 6.203125,-3.71875 C 6.46875,-3.4375 6.625,-3.03125 6.625,-2.59375 C 6.625,-2.15625 6.46875,-1.75 6.203125,-1.46875 C 5.921875,-1.15625 5.546875,-1.03125 4.984375,-1.03125 L 2.15625,-1.03125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-6"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2855"
-           d="M 3.40625,-6.734375 C 1.5625,-6.734375 0.453125,-5.421875 0.453125,-3.21875 C 0.453125,-1.03125 1.546875,0.28125 3.40625,0.28125 C 5.25,0.28125 6.375,-1.03125 6.375,-3.171875 C 6.375,-5.4375 5.28125,-6.734375 3.40625,-6.734375 z M 3.40625,-5.78125 C 4.59375,-5.78125 5.28125,-4.8125 5.28125,-3.1875 C 5.28125,-1.65625 4.5625,-0.671875 3.40625,-0.671875 C 2.25,-0.671875 1.53125,-1.640625 1.53125,-3.21875 C 1.53125,-4.796875 2.25,-5.78125 3.40625,-5.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-7"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2858"
-           d="M 0.671875,-9.109375 L 0.671875,0 L 1.609375,0 L 1.609375,-0.84375 C 2.109375,-0.078125 2.78125,0.28125 3.6875,0.28125 C 5.40625,0.28125 6.53125,-1.125 6.53125,-3.296875 C 6.53125,-5.421875 5.46875,-6.734375 3.734375,-6.734375 C 2.84375,-6.734375 2.203125,-6.40625 1.71875,-5.65625 L 1.71875,-9.109375 L 0.671875,-9.109375 z M 3.53125,-5.765625 C 4.703125,-5.765625 5.453125,-4.75 5.453125,-3.1875 C 5.453125,-1.703125 4.671875,-0.6875 3.53125,-0.6875 C 2.4375,-0.6875 1.71875,-1.6875 1.71875,-3.21875 C 1.71875,-4.765625 2.4375,-5.765625 3.53125,-5.765625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-8"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2861"
-           d="M 8.28125,-6.28125 C 7.90625,-8.28125 6.765625,-9.265625 4.765625,-9.265625 C 3.53125,-9.265625 2.546875,-8.875 1.875,-8.125 C 1.046875,-7.21875 0.59375,-5.921875 0.59375,-4.453125 C 0.59375,-2.953125 1.0625,-1.65625 1.921875,-0.78125 C 2.625,-0.046875 3.53125,0.28125 4.71875,0.28125 C 6.9375,0.28125 8.1875,-0.90625 8.46875,-3.328125 L 7.265625,-3.328125 C 7.15625,-2.703125 7.03125,-2.28125 6.84375,-1.90625 C 6.46875,-1.15625 5.703125,-0.734375 4.71875,-0.734375 C 2.90625,-0.734375 1.765625,-2.1875 1.765625,-4.46875 C 1.765625,-6.796875 2.859375,-8.234375 4.625,-8.234375 C 5.359375,-8.234375 6.046875,-8.015625 6.421875,-7.65625 C 6.765625,-7.34375 6.953125,-6.96875 7.09375,-6.28125 L 8.28125,-6.28125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-9"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2864"
-           d="M 1.109375,0 L 4.625,0 C 6.921875,0 8.34375,-1.71875 8.34375,-4.5625 C 8.34375,-7.390625 6.9375,-9.109375 4.625,-9.109375 L 1.109375,-9.109375 L 1.109375,0 z M 2.28125,-1.03125 L 2.28125,-8.09375 L 4.421875,-8.09375 C 6.21875,-8.09375 7.171875,-6.875 7.171875,-4.546875 C 7.171875,-2.25 6.21875,-1.03125 4.421875,-1.03125 L 2.28125,-1.03125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-10"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2867"
-           d="M 6.6875,-0.609375 C 6.578125,-0.59375 6.53125,-0.59375 6.46875,-0.59375 C 6.09375,-0.59375 5.90625,-0.78125 5.90625,-1.09375 L 5.90625,-4.953125 C 5.90625,-6.109375 5.046875,-6.734375 3.4375,-6.734375 C 2.484375,-6.734375 1.703125,-6.46875 1.265625,-5.96875 C 0.96875,-5.640625 0.84375,-5.265625 0.8125,-4.609375 L 1.859375,-4.609375 C 1.953125,-5.40625 2.421875,-5.78125 3.40625,-5.78125 C 4.34375,-5.78125 4.859375,-5.421875 4.859375,-4.796875 L 4.859375,-4.53125 C 4.859375,-4.09375 4.59375,-3.90625 3.78125,-3.796875 C 2.296875,-3.609375 2.078125,-3.5625 1.671875,-3.40625 C 0.90625,-3.09375 0.53125,-2.5 0.53125,-1.65625 C 0.53125,-0.46875 1.34375,0.28125 2.671875,0.28125 C 3.5,0.28125 4.15625,0 4.90625,-0.671875 C 4.96875,-0.015625 5.296875,0.28125 5.96875,0.28125 C 6.1875,0.28125 6.34375,0.265625 6.6875,0.171875 L 6.6875,-0.609375 z M 4.859375,-2.0625 C 4.859375,-1.71875 4.765625,-1.5 4.453125,-1.21875 C 4.03125,-0.828125 3.515625,-0.625 2.90625,-0.625 C 2.09375,-0.625 1.609375,-1.015625 1.609375,-1.671875 C 1.609375,-2.359375 2.078125,-2.71875 3.1875,-2.875 C 4.28125,-3.03125 4.515625,-3.078125 4.859375,-3.234375 L 4.859375,-2.0625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-11"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2870"
-           d="M 0.875,-6.546875 L 0.875,0 L 1.921875,0 L 1.921875,-3.609375 C 1.921875,-4.953125 2.625,-5.828125 3.703125,-5.828125 C 4.53125,-5.828125 5.046875,-5.328125 5.046875,-4.53125 L 5.046875,0 L 6.09375,0 L 6.09375,-4.953125 C 6.09375,-6.03125 5.28125,-6.734375 4.015625,-6.734375 C 3.03125,-6.734375 2.40625,-6.359375 1.84375,-5.453125 L 1.84375,-6.546875 L 0.875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-12"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2873"
-           d="M 2.28125,-4.15625 L 7.25,-4.15625 L 7.25,-5.171875 L 2.28125,-5.171875 L 2.28125,-8.09375 L 7.4375,-8.09375 L 7.4375,-9.109375 L 1.125,-9.109375 L 1.125,0 L 7.65625,0 L 7.65625,-1.03125 L 2.28125,-1.03125 L 2.28125,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-13"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2876"
-           d="M 5.46875,-4.71875 C 5.46875,-6.015625 4.609375,-6.734375 3.09375,-6.734375 C 1.578125,-6.734375 0.59375,-5.953125 0.59375,-4.734375 C 0.59375,-3.71875 1.109375,-3.21875 2.65625,-2.84375 L 3.640625,-2.609375 C 4.359375,-2.4375 4.65625,-2.171875 4.65625,-1.703125 C 4.65625,-1.09375 4.03125,-0.671875 3.125,-0.671875 C 2.5625,-0.671875 2.09375,-0.84375 1.828125,-1.109375 C 1.65625,-1.296875 1.59375,-1.484375 1.53125,-1.953125 L 0.421875,-1.953125 C 0.46875,-0.4375 1.328125,0.28125 3.03125,0.28125 C 4.6875,0.28125 5.734375,-0.53125 5.734375,-1.78125 C 5.734375,-2.765625 5.1875,-3.296875 3.890625,-3.609375 L 2.890625,-3.84375 C 2.03125,-4.046875 1.671875,-4.328125 1.671875,-4.78125 C 1.671875,-5.390625 2.21875,-5.78125 3.0625,-5.78125 C 3.90625,-5.78125 4.34375,-5.40625 4.375,-4.71875 L 5.46875,-4.71875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-14"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2879"
-           d="M 0.875,-6.546875 L 0.875,0 L 1.921875,0 L 1.921875,-4.109375 C 1.921875,-5.0625 2.609375,-5.828125 3.46875,-5.828125 C 4.234375,-5.828125 4.671875,-5.34375 4.671875,-4.515625 L 4.671875,0 L 5.71875,0 L 5.71875,-4.109375 C 5.71875,-5.0625 6.40625,-5.828125 7.265625,-5.828125 C 8.03125,-5.828125 8.46875,-5.34375 8.46875,-4.515625 L 8.46875,0 L 9.53125,0 L 9.53125,-4.90625 C 9.53125,-6.09375 8.84375,-6.734375 7.625,-6.734375 C 6.75,-6.734375 6.21875,-6.46875 5.609375,-5.734375 C 5.21875,-6.4375 4.703125,-6.734375 3.84375,-6.734375 C 2.96875,-6.734375 2.40625,-6.40625 1.84375,-5.625 L 1.84375,-6.546875 L 0.875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-15"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2882"
-           d="M 0.859375,-6.546875 L 0.859375,0 L 1.90625,0 L 1.90625,-3.40625 C 1.90625,-4.34375 2.15625,-4.953125 2.65625,-5.3125 C 2.96875,-5.546875 3.28125,-5.625 4.015625,-5.640625 L 4.015625,-6.703125 C 3.84375,-6.71875 3.75,-6.734375 3.609375,-6.734375 C 2.9375,-6.734375 2.421875,-6.34375 1.828125,-5.359375 L 1.828125,-6.546875 L 0.859375,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-16"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2885"
-           d="M 6.1875,-9.109375 L 5.15625,-9.109375 L 5.15625,-5.71875 C 4.71875,-6.390625 4.015625,-6.734375 3.140625,-6.734375 C 1.4375,-6.734375 0.328125,-5.375 0.328125,-3.28125 C 0.328125,-1.078125 1.40625,0.28125 3.171875,0.28125 C 4.078125,0.28125 4.703125,-0.046875 5.265625,-0.859375 L 5.265625,0 L 6.1875,0 L 6.1875,-9.109375 z M 3.3125,-5.765625 C 4.4375,-5.765625 5.15625,-4.765625 5.15625,-3.203125 C 5.15625,-1.6875 4.421875,-0.6875 3.328125,-0.6875 C 2.171875,-0.6875 1.40625,-1.703125 1.40625,-3.21875 C 1.40625,-4.75 2.171875,-5.765625 3.3125,-5.765625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-17"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2888"
-           d="M 2.28125,-4.15625 L 6.640625,-4.15625 L 6.640625,-5.171875 L 2.28125,-5.171875 L 2.28125,-8.09375 L 7.234375,-8.09375 L 7.234375,-9.109375 L 1.125,-9.109375 L 1.125,0 L 2.28125,0 L 2.28125,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-18"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2891"
-           d="M 8.859375,-4.8125 L 5.0625,-4.8125 L 5.0625,-3.78125 L 7.84375,-3.78125 L 7.84375,-3.53125 C 7.84375,-1.90625 6.640625,-0.734375 4.96875,-0.734375 C 4.046875,-0.734375 3.21875,-1.078125 2.671875,-1.65625 C 2.078125,-2.3125 1.71875,-3.40625 1.71875,-4.53125 C 1.71875,-6.765625 2.984375,-8.234375 4.90625,-8.234375 C 6.296875,-8.234375 7.296875,-7.53125 7.546875,-6.34375 L 8.734375,-6.34375 C 8.40625,-8.203125 7.015625,-9.265625 4.921875,-9.265625 C 3.8125,-9.265625 2.90625,-8.96875 2.203125,-8.390625 C 1.15625,-7.515625 0.546875,-6.09375 0.546875,-4.46875 C 0.546875,-1.65625 2.265625,0.28125 4.71875,0.28125 C 5.96875,0.28125 6.953125,-0.171875 7.84375,-1.15625 L 8.125,0.046875 L 8.859375,0.046875 L 8.859375,-4.8125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-19"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2894"
-           d="M 5.15625,-6.546875 L 5.15625,-5.59375 C 4.625,-6.375 3.984375,-6.734375 3.15625,-6.734375 C 1.484375,-6.734375 0.359375,-5.28125 0.359375,-3.15625 C 0.359375,-2.09375 0.65625,-1.21875 1.1875,-0.59375 C 1.671875,-0.03125 2.375,0.28125 3.0625,0.28125 C 3.890625,0.28125 4.46875,-0.0625 5.046875,-0.890625 L 5.046875,-0.546875 C 5.046875,0.34375 4.9375,0.875 4.671875,1.234375 C 4.40625,1.625 3.859375,1.84375 3.21875,1.84375 C 2.75,1.84375 2.328125,1.71875 2.03125,1.5 C 1.796875,1.3125 1.703125,1.140625 1.640625,0.75 L 0.578125,0.75 C 0.6875,1.984375 1.65625,2.71875 3.1875,2.71875 C 4.15625,2.71875 5,2.40625 5.421875,1.890625 C 5.921875,1.28125 6.109375,0.46875 6.109375,-1.078125 L 6.109375,-6.546875 L 5.15625,-6.546875 z M 3.265625,-5.78125 C 4.390625,-5.78125 5.046875,-4.828125 5.046875,-3.1875 C 5.046875,-1.625 4.375,-0.671875 3.28125,-0.671875 C 2.140625,-0.671875 1.453125,-1.640625 1.453125,-3.21875 C 1.453125,-4.796875 2.15625,-5.78125 3.265625,-5.78125 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-20"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2897"
-           d="M 6.890625,-4.15625 L 6.890625,0 L 8.046875,0 L 8.046875,-9.109375 L 6.890625,-9.109375 L 6.890625,-5.171875 L 2.203125,-5.171875 L 2.203125,-9.109375 L 1.03125,-9.109375 L 1.03125,0 L 2.21875,0 L 2.21875,-4.15625 L 6.890625,-4.15625 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-21"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2900"
-           d="M 2.421875,-9.109375 L 1.25,-9.109375 L 1.25,0 L 2.421875,0 L 2.421875,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-22"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2903"
-           d="M 4.15625,-9.109375 L 4.15625,-2.703125 C 4.15625,-1.96875 4.09375,-1.5625 3.875,-1.25 C 3.65625,-0.90625 3.21875,-0.6875 2.765625,-0.6875 C 1.890625,-0.6875 1.40625,-1.28125 1.40625,-2.34375 L 1.40625,-2.921875 L 0.21875,-2.921875 L 0.21875,-2.125 C 0.21875,-0.65625 1.1875,0.28125 2.75,0.28125 C 4.34375,0.28125 5.328125,-0.703125 5.328125,-2.28125 L 5.328125,-9.109375 L 4.15625,-9.109375 z "
-           style="stroke:none" />
-      </symbol>
-      <symbol
-         id="glyph0-23"
-         overflow="visible"
-         style="overflow:visible">
-        <path
-           id="path2906"
-           d="M 3.21875,-6.546875 L 2.140625,-6.546875 L 2.140625,-7.578125 C 2.140625,-8.015625 2.390625,-8.234375 2.859375,-8.234375 C 2.953125,-8.234375 2.984375,-8.234375 3.21875,-8.21875 L 3.21875,-9.09375 C 2.984375,-9.140625 2.84375,-9.15625 2.640625,-9.15625 C 1.671875,-9.15625 1.09375,-8.59375 1.09375,-7.65625 L 1.09375,-6.546875 L 0.21875,-6.546875 L 0.21875,-5.703125 L 1.09375,-5.703125 L 1.09375,0 L 2.140625,0 L 2.140625,-5.703125 L 3.21875,-5.703125 L 3.21875,-6.546875 z "
-           style="stroke:none" />
-      </symbol>
-    </g>
-  </defs>
-  <sodipodi:namedview
-     id="base"
-     pagecolor="#ffffff"
-     bordercolor="#666666"
-     borderopacity="1.0"
-     gridtolerance="10000"
-     guidetolerance="10"
-     objecttolerance="10"
-     inkscape:pageopacity="0.0"
-     inkscape:pageshadow="2"
-     inkscape:zoom="1.979899"
-     inkscape:cx="156.0166"
-     inkscape:cy="186.51407"
-     inkscape:document-units="px"
-     inkscape:current-layer="g4252"
-     width="400px"
-     height="400px"
-     inkscape:window-width="1400"
-     inkscape:window-height="996"
-     inkscape:window-x="0"
-     inkscape:window-y="0"
-     showgrid="false" />
-  <metadata
-     id="metadata7">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <g
-     inkscape:label="Layer 1"
-     inkscape:groupmode="layer"
-     id="layer1"
-     transform="translate(-193.39368,-187.86171)">
-    <g
-       id="g4560"
-       transform="translate(19.697975,21.213203)">
-      <g
-         id="g6012"
-         transform="translate(10.101525,26.769042)">
-        <g
-           clip-path="url(#clip0)"
-           id="surface0"
-           transform="translate(287.14349,154.45437)">
-          <g
-             id="g2944"
-             clip-rule="nonzero"
-             clip-path="url(#clip2)">
-            <g
-               id="g2946"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use2948"
-                 y="24.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2950"
-                 y="24.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2952"
-                 y="24.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2954"
-                 y="24.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2956"
-                 y="24.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g2958"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use2960"
-                 y="41.369492"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use2962"
-                 y="41.369492"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use2964"
-                 y="41.369492"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g2966"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use2968"
-                 y="58.036148"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2970"
-                 y="58.036148"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2972"
-                 y="58.036148"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2974"
-                 y="58.036148"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2976"
-                 y="58.036148"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g2978"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use2980"
-                 y="74.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2982"
-                 y="74.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2984"
-                 y="74.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2986"
-                 y="74.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use2988"
-                 y="74.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g2990"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use2992"
-                 y="91.369492"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2994"
-                 y="91.369492"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2996"
-                 y="91.369492"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use2998"
-                 y="91.369492"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3000"
-                 y="91.369492"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3002"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3004"
-                 y="108.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3006"
-                 y="108.03615"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3008"
-                 y="108.03615"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3010"
-                 y="108.03615"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3012"
-                 y="108.03615"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3014"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3016"
-                 y="124.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3018"
-                 y="124.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3020"
-                 y="124.70282"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3022"
-                 y="124.70282"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3024"
-                 y="124.70282"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3026"
-                 y="124.70282"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3028"
-                 y="124.70282"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3030"
-                 y="124.70282"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3032"
-                 y="124.70282"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3034"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use3036"
-                 y="141.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3038"
-                 y="141.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3040"
-                 y="141.36949"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g3042"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3044"
-                 y="158.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-8"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3046"
-                 y="158.03615"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3048"
-                 y="158.03615"
-                 x="28.508408"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3050"
-                 y="158.03615"
-                 x="34.758438"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3052"
-                 y="158.03615"
-                 x="37.533447"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3054"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3056"
-                 y="174.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3058"
-                 y="174.70282"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3060"
-                 y="174.70282"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3062"
-                 y="174.70282"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3064"
-                 y="174.70282"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3066"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use3068"
-                 y="191.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3070"
-                 y="191.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3072"
-                 y="191.36949"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3074"
-                 y="191.36949"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3076"
-                 y="191.36949"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g3078"
-               style="opacity:1;fill:#0000ff">
-              <use
-                 id="use3080"
-                 y="208.03615"
-                 x="12.53334"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3082"
-                 y="208.03615"
-                 x="20.870865"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-              <use
-                 id="use3084"
-                 y="208.03615"
-                 x="27.820892"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#0000ff" />
-            </g>
-            <g
-               id="g3086"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3088"
-                 y="224.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3090"
-                 y="224.70282"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3092"
-                 y="224.70282"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3094"
-                 y="224.70282"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3096"
-                 y="224.70282"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3098"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3100"
-                 y="241.36949"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3102"
-                 y="241.36949"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3104"
-                 y="241.36949"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3106"
-                 y="241.36949"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3108"
-                 y="241.36949"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3110"
-                 y="241.36949"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3112"
-                 y="241.36949"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3114"
-                 y="241.36949"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3116"
-                 y="241.36949"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3118"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3120"
-                 y="258.03613"
-                 x="12.53334"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3122"
-                 y="258.03613"
-                 x="20.170868"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3124"
-                 y="258.03613"
-                 x="27.120895"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3126"
-                 y="258.03613"
-                 x="34.070923"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3128"
-                 y="258.03613"
-                 x="36.845932"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3130"
-                 y="258.03613"
-                 x="43.795959"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3132"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3134"
-                 y="274.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3136"
-                 y="274.70282"
-                 x="22.258377"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3138"
-                 y="274.70282"
-                 x="25.033386"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3140"
-                 y="274.70282"
-                 x="31.983414"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3142"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3144"
-                 y="291.36951"
-                 x="12.53334"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3146"
-                 y="291.36951"
-                 x="21.55838"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3148"
-                 y="291.36951"
-                 x="24.333389"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3150"
-                 y="291.36951"
-                 x="31.283417"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3152"
-                 y="291.36951"
-                 x="38.233444"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3154"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3156"
-                 y="308.03613"
-                 x="12.53334"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3158"
-                 y="308.03613"
-                 x="20.870865"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3160"
-                 y="308.03613"
-                 x="27.120895"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3162"
-                 y="308.03613"
-                 x="37.533432"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3164"
-                 y="308.03613"
-                 x="44.483459"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3166"
-                 y="308.03613"
-                 x="48.645981"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3168"
-                 y="308.03613"
-                 x="55.596008"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3170"
-                 y="308.03613"
-                 x="58.371017"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3172"
-                 y="308.03613"
-                 x="65.321045"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3174"
-               style="opacity:1;fill:#ff0000">
-              <use
-                 id="use3176"
-                 y="324.70282"
-                 x="12.53334"
-                 xlink:href="#glyph0-0"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3178"
-                 y="324.70282"
-                 x="20.870865"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3180"
-                 y="324.70282"
-                 x="23.645874"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3182"
-                 y="324.70282"
-                 x="26.420883"
-                 xlink:href="#glyph0-3"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-              <use
-                 id="use3184"
-                 y="324.70282"
-                 x="32.670914"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622"
-                 style="fill:#ff0000" />
-            </g>
-            <g
-               id="g3186"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3188"
-                 y="341.36951"
-                 x="12.53334"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3190"
-                 y="341.36951"
-                 x="21.55838"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3192"
-                 y="341.36951"
-                 x="28.508408"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3194"
-                 y="341.36951"
-                 x="31.283417"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3196"
-                 y="341.36951"
-                 x="38.233444"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3198"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3200"
-                 y="24.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-5"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3202"
-                 y="24.70282"
-                 x="87.537521"
-                 xlink:href="#glyph0-6"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3204"
-                 y="24.70282"
-                 x="94.487549"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3206"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3208"
-                 y="41.369492"
-                 x="79.199997"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3210"
-                 y="41.369492"
-                 x="88.225037"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3212"
-                 y="41.369492"
-                 x="91.000046"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3214"
-                 y="41.369492"
-                 x="97.950073"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3216"
-                 y="41.369492"
-                 x="104.9001"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3218"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3220"
-                 y="58.036148"
-                 x="79.199997"
-                 xlink:href="#glyph0-9"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3222"
-                 y="58.036148"
-                 x="88.225037"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3224"
-                 y="58.036148"
-                 x="91.000046"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3226"
-                 y="58.036148"
-                 x="97.950073"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3228"
-                 y="58.036148"
-                 x="104.9001"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3230"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3232"
-                 y="74.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3234"
-                 y="74.70282"
-                 x="87.537521"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3236"
-                 y="74.70282"
-                 x="93.787552"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3238"
-                 y="74.70282"
-                 x="104.20009"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3240"
-                 y="74.70282"
-                 x="111.15012"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3242"
-                 y="74.70282"
-                 x="115.31264"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3244"
-                 y="74.70282"
-                 x="122.26266"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3246"
-                 y="74.70282"
-                 x="125.03767"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3248"
-                 y="74.70282"
-                 x="131.9877"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3250"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3252"
-                 y="91.369492"
-                 x="79.199997"
-                 xlink:href="#glyph0-12"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3254"
-                 y="91.369492"
-                 x="87.537521"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3256"
-                 y="91.369492"
-                 x="93.787552"
-                 xlink:href="#glyph0-14"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3258"
-                 y="91.369492"
-                 x="104.20009"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3260"
-                 y="91.369492"
-                 x="111.15012"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3262"
-                 y="91.369492"
-                 x="115.31264"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3264"
-                 y="91.369492"
-                 x="122.26266"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3266"
-                 y="91.369492"
-                 x="125.03767"
-                 xlink:href="#glyph0-16"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3268"
-                 y="91.369492"
-                 x="131.9877"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3270"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3272"
-                 y="108.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3274"
-                 y="108.03615"
-                 x="86.837524"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3276"
-                 y="108.03615"
-                 x="93.787552"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3278"
-                 y="108.03615"
-                 x="100.73758"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3280"
-                 y="108.03615"
-                 x="103.51259"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3282"
-                 y="108.03615"
-                 x="110.46262"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3284"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3286"
-                 y="124.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-17"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3288"
-                 y="124.70282"
-                 x="86.837524"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3290"
-                 y="124.70282"
-                 x="93.787552"
-                 xlink:href="#glyph0-7"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3292"
-                 y="124.70282"
-                 x="100.73758"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3294"
-                 y="124.70282"
-                 x="103.51259"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3296"
-                 y="124.70282"
-                 x="110.46262"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3298"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3300"
-                 y="141.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3302"
-                 y="141.36949"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3304"
-                 y="141.36949"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3306"
-                 y="141.36949"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3308"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3310"
-                 y="158.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3312"
-                 y="158.03615"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3314"
-                 y="158.03615"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3316"
-                 y="158.03615"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3318"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3320"
-                 y="174.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-18"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3322"
-                 y="174.70282"
-                 x="88.925034"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3324"
-                 y="174.70282"
-                 x="91.700043"
-                 xlink:href="#glyph0-19"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3326"
-                 y="174.70282"
-                 x="98.65007"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3328"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3330"
-                 y="191.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3332"
-                 y="191.36949"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3334"
-                 y="191.36949"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3336"
-                 y="191.36949"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3338"
-                 y="191.36949"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3340"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3342"
-                 y="208.03615"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3344"
-                 y="208.03615"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3346"
-                 y="208.03615"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3348"
-                 y="208.03615"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3350"
-                 y="208.03615"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3352"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3354"
-                 y="224.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3356"
-                 y="224.70282"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3358"
-                 y="224.70282"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3360"
-                 y="224.70282"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3362"
-                 y="224.70282"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3364"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3366"
-                 y="241.36949"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3368"
-                 y="241.36949"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3370"
-                 y="241.36949"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3372"
-                 y="241.36949"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3374"
-                 y="241.36949"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3376"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3378"
-                 y="258.03613"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3380"
-                 y="258.03613"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3382"
-                 y="258.03613"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3384"
-                 y="258.03613"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3386"
-                 y="258.03613"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3388"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3390"
-                 y="274.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-20"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3392"
-                 y="274.70282"
-                 x="88.225037"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3394"
-                 y="274.70282"
-                 x="95.175064"
-                 xlink:href="#glyph0-1"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3396"
-                 y="274.70282"
-                 x="97.950073"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3398"
-                 y="274.70282"
-                 x="104.9001"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3400"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3402"
-                 y="291.36951"
-                 x="79.199997"
-                 xlink:href="#glyph0-21"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3404"
-                 y="291.36951"
-                 x="82.675003"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3406"
-                 y="291.36951"
-                 x="89.625031"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3408"
-                 y="291.36951"
-                 x="96.575058"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3410"
-                 y="291.36951"
-                 x="103.52509"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3412"
-                 y="291.36951"
-                 x="106.30009"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3414"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3416"
-                 y="308.03613"
-                 x="79.199997"
-                 xlink:href="#glyph0-21"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3418"
-                 y="308.03613"
-                 x="82.675003"
-                 xlink:href="#glyph0-10"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3420"
-                 y="308.03613"
-                 x="89.625031"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3422"
-                 y="308.03613"
-                 x="96.575058"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3424"
-                 y="308.03613"
-                 x="103.52509"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3426"
-                 y="308.03613"
-                 x="106.30009"
-                 xlink:href="#glyph0-13"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3428"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3430"
-                 y="324.70282"
-                 x="79.199997"
-                 xlink:href="#glyph0-22"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3432"
-                 y="324.70282"
-                 x="85.450027"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3434"
-                 y="324.70282"
-                 x="92.400055"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3436"
-                 y="324.70282"
-                 x="99.350082"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3438"
-                 y="324.70282"
-                 x="106.30011"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3440"
-                 y="324.70282"
-                 x="109.07512"
-                 xlink:href="#glyph0-23"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3442"
-                 y="324.70282"
-                 x="112.55013"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3444"
-                 y="324.70282"
-                 x="119.50015"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-            <g
-               id="g3446"
-               style="opacity:1;fill:#000000">
-              <use
-                 id="use3448"
-                 y="341.36951"
-                 x="79.199997"
-                 xlink:href="#glyph0-22"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3450"
-                 y="341.36951"
-                 x="85.450027"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3452"
-                 y="341.36951"
-                 x="92.400055"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3454"
-                 y="341.36951"
-                 x="99.350082"
-                 xlink:href="#glyph0-11"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3456"
-                 y="341.36951"
-                 x="106.30011"
-                 xlink:href="#glyph0-2"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3458"
-                 y="341.36951"
-                 x="109.07512"
-                 xlink:href="#glyph0-23"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3460"
-                 y="341.36951"
-                 x="112.55013"
-                 xlink:href="#glyph0-4"
-                 width="744.09448"
-                 height="1052.3622" />
-              <use
-                 id="use3462"
-                 y="341.36951"
-                 x="119.50015"
-                 xlink:href="#glyph0-15"
-                 width="744.09448"
-                 height="1052.3622" />
-            </g>
-          </g>
-        </g>
-        <g
-           id="g4205"
-           transform="matrix(1,0,0,0.972732,-0.89631,6.0184739)">
-          <g
-             id="g4228"
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)">
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4167"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="167.36218" />
-            <rect
-               y="185.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4169"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="203.07646"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4171"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4173"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="220.93361" />
-            <rect
-               y="238.79076"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4175"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4177"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="256.64789" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4179"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="274.50504" />
-            <rect
-               y="292.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4181"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="310.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4183"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4185"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="328.07648" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4187"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="345.93359" />
-            <rect
-               y="363.79074"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4189"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4191"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="381.64789" />
-            <rect
-               y="399.50504"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4193"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="417.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4195"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4197"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="435.21933" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4199"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="453.07648" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4201"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="470.93362" />
-            <rect
-               y="488.79077"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4203"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4226"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="506.44476" />
-            <rect
-               y="529.82227"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4552"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <text
-               xml:space="preserve"
-               style="font-size:16.66718292px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:center;line-height:125%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               x="220.492"
-               y="602.20081"
-               id="text4554"
-               sodipodi:linespacing="125%"
-               transform="scale(1.1060165,0.9041457)"><tspan
-                 sodipodi:role="line"
-                 id="tspan4556"
-                 x="220.492"
-                 y="602.20081">X</tspan></text>
-          </g>
-        </g>
-        <g
-           transform="matrix(1,0,0,0.972732,-54.434395,6.0184739)"
-           id="g4250">
-          <g
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)"
-             id="g4252">
-            <g
-               id="g4316">
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4254"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="167.36218" />
-              <rect
-                 y="185.21933"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4256"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 y="203.07646"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4258"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4260"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="220.93361" />
-              <rect
-                 y="238.79076"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4262"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4264"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="256.64789" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4266"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="274.50504" />
-              <rect
-                 y="292.36218"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4268"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 y="310.21933"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4270"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              <rect
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                 id="rect4272"
-                 width="20"
-                 height="17.857143"
-                 x="234.28572"
-                 y="328.07648" />
-              <rect
-                 y="350.36664"
-                 x="234.28572"
-                 height="17.857143"
-                 width="20"
-                 id="rect4544"
-                 style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            </g>
-            <text
-               xml:space="preserve"
-               style="font-size:15.47667217px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               x="193.91632"
-               y="199.77205"
-               id="text4294"
-               sodipodi:linespacing="125%"
-               transform="scale(1.1060165,0.9041457)"><tspan
-                 sodipodi:role="line"
-                 id="tspan4296"
-                 x="193.91632"
-                 y="199.77205"
-                 style="fill:#ff0000">A</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="219.11789"
-                 id="tspan4298"
-                 style="fill:#0000ff">B</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="238.46373"
-                 id="tspan4300"
-                 style="fill:#008000">C</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="257.80957"
-                 id="tspan4302">D</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="277.15541"
-                 id="tspan4304">E</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="296.50125"
-                 id="tspan4306">F</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="315.84709"
-                 id="tspan4308">G</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="335.19293"
-                 id="tspan4310">H</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="354.53877"
-                 id="tspan4312">I</tspan><tspan
-                 sodipodi:role="line"
-                 x="193.91632"
-                 y="373.88461"
-                 id="tspan4314">J</tspan></text>
-          </g>
-        </g>
-        <path
-           style="fill:#ff0000;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 199.83939,175.54978 L 237.00157,175.54978"
-           id="path4328" />
-        <path
-           id="path4530"
-           d="M 252.8724,175.54978 L 290.03458,175.54978"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,192.72237 L 290.03458,223.53202"
-           id="path4532"
-           sodipodi:nodetypes="cc" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,209.38989 L 290.03458,340.20464"
-           id="path4534"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4536"
-           d="M 252.8724,225.55233 L 290.03458,473.54478"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#ff0000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,242.72492 L 290.03458,192.72237"
-           id="path4538"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4540"
-           d="M 252.8724,258.88736 L 290.03458,290.70717"
-           style="fill:none;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4542"
-           d="M 199.83939,192.72237 L 237.00157,239.69446"
-           style="fill:#0000ff;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           id="path4550"
-           d="M 199.83939,346.26556 L 237.00157,507.88997"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <g
-           transform="matrix(1,0,0,0.972732,212.75095,6.0184739)"
-           id="g4900">
-          <g
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)"
-             id="g4902">
-            <rect
-               y="167.36218"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4904"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4906"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="185.21933" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4908"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="203.07646" />
-            <rect
-               y="220.93361"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4910"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4912"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="238.79076" />
-            <rect
-               y="256.64789"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4914"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="274.50504"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4916"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4918"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="292.36218" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4920"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="310.21933" />
-            <rect
-               y="328.07648"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4922"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="345.93359"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4924"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4926"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="363.79074" />
-            <rect
-               y="381.64789"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4928"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4930"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="399.50504" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4932"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="417.36218" />
-            <rect
-               y="435.21933"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4934"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="453.07648"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4936"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               y="470.93362"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4938"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4940"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="488.79077" />
-            <rect
-               y="506.44476"
-               x="234.28572"
-               height="17.857143"
-               width="20"
-               id="rect4942"
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-            <rect
-               style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-               id="rect4944"
-               width="20"
-               height="17.857143"
-               x="234.28572"
-               y="529.82227" />
-            <text
-               transform="scale(1.1060165,0.9041457)"
-               sodipodi:linespacing="125%"
-               id="text4946"
-               y="602.20081"
-               x="220.492"
-               style="font-size:16.66718292px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:center;line-height:125%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-               xml:space="preserve"><tspan
-                 y="602.20081"
-                 x="220.492"
-                 id="tspan4948"
-                 sodipodi:role="line">X</tspan></text>
-          </g>
-        </g>
-        <g
-           id="g4950"
-           transform="matrix(1,0,0,0.972732,266.79411,6.0184739)">
-          <g
-             id="g4952"
-             transform="matrix(0.7594588,0,0,0.9550678,68.326439,5.9331633)">
-            <g
-               transform="translate(47.218382,0)"
-               id="g5000">
-              <g
-                 id="g4954"
-                 transform="translate(-48.548477,0)">
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4956"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="167.36218" />
-                <rect
-                   y="185.21933"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4958"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   y="203.07646"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4960"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4962"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="220.93361" />
-                <rect
-                   y="238.79076"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4964"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4966"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="256.64789" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4968"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="274.50504" />
-                <rect
-                   y="292.36218"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4970"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   y="310.21933"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4972"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-                <rect
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1"
-                   id="rect4974"
-                   width="20"
-                   height="17.857143"
-                   x="234.28572"
-                   y="328.07648" />
-                <rect
-                   y="350.36664"
-                   x="234.28572"
-                   height="17.857143"
-                   width="20"
-                   id="rect4976"
-                   style="opacity:1;fill:none;fill-opacity:1;fill-rule:nonzero;stroke:#000000;stroke-width:1.4881413;stroke-linecap:square;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-dashoffset:0;stroke-opacity:1" />
-              </g>
-              <text
-                 xml:space="preserve"
-                 style="font-size:15.47667217px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1pt;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Nimbus Roman No9 L"
-                 x="193.91632"
-                 y="199.77205"
-                 id="text4978"
-                 sodipodi:linespacing="125%"
-                 transform="scale(1.1060165,0.9041457)"><tspan
-                   sodipodi:role="line"
-                   id="tspan4980"
-                   x="193.91632"
-                   y="199.77205">A</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="219.11789"
-                   id="tspan4982">B</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="238.46373"
-                   id="tspan4984">C</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="257.80957"
-                   id="tspan4986">D</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="277.15541"
-                   id="tspan4988">E</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="296.50125"
-                   id="tspan4990">F</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="315.84709"
-                   id="tspan4992">G</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="335.19293"
-                   id="tspan4994">H</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="354.53877"
-                   id="tspan4996">I</tspan><tspan
-                   sodipodi:role="line"
-                   x="193.91632"
-                   y="373.88461"
-                   id="tspan4998">J</tspan></text>
-            </g>
-          </g>
-        </g>
-        <path
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 467.07928,175.54978 L 429.9171,175.54978"
-           id="path5025" />
-        <path
-           id="path5027"
-           d="M 467.07928,192.2173 L 429.9171,192.2173"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 467.07928,209.38989 L 429.9171,209.38989"
-           id="path5029" />
-        <path
-           id="path5031"
-           d="M 467.07928,226.05741 L 429.9171,226.05741"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#006600;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           id="path5033"
-           d="M 519.10214,175.54978 L 481.93996,175.54978"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,191.71222 L 481.93996,176.05486"
-           id="path5035" />
-        <path
-           id="path5037"
-           d="M 519.10214,209.89497 L 481.93996,194.23761"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           sodipodi:nodetypes="cc" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,225.55233 L 481.93996,193.73253"
-           id="path5039" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 519.10214,345.76048 L 481.93996,508.39504"
-           id="path5041" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#0000ff;stroke-width:1.00000012;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 252.8724,275.55488 L 290.03458,357.37724"
-           id="path3602" />
-        <path
-           sodipodi:nodetypes="cc"
-           style="fill:#008000;fill-opacity:0.75000000000000000;fill-rule:evenodd;stroke:#008000;stroke-width:1.00000011999999994;stroke-linecap:butt;stroke-linejoin:miter;marker-start:url(#Dot_m);marker-end:url(#TriangleOutM);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
-           d="M 199.83939,208.88481 L 237.00157,290.20209"
-           id="path3604" />
-      </g>
-    </g>
-  </g>
-</svg>
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/karate.net igraph-0.6.5/doc/presentations/wien08/karate.net
--- igraph-0.6.5~quantal1/doc/presentations/wien08/karate.net	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/karate.net	1970-01-01 00:00:00.000000000 +0000
@@ -1,80 +0,0 @@
-*vertices 34
-*edges
-1 32
-1 22
-1 20
-1 18
-1 14
-1 13
-1 12
-1 11
-1 9
-1 8
-1 7
-1 6
-1 5
-1 4
-1 3
-1 2
-2 31
-2 22
-2 20
-2 18
-2 14
-2 8
-2 4
-2 3
-3 14
-3 9
-3 10
-3 33
-3 29
-3 28
-3 8
-3 4
-4 14
-4 13
-4 8
-5 11
-5 7
-6 17
-6 11
-6 7
-7 17
-9 34
-9 33
-9 33
-10 34
-14 34
-15 34
-15 33
-16 34
-16 33
-19 34
-19 33
-20 34
-21 34
-21 33
-23 34
-23 33
-24 30
-24 34
-24 33
-24 28
-24 26
-25 32
-25 28
-25 26
-26 32
-27 34
-27 30
-28 34
-29 34
-29 32
-30 34
-30 33
-31 34
-31 33
-32 34
-32 33
-33 34
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/lesmis.txt igraph-0.6.5/doc/presentations/wien08/lesmis.txt
--- igraph-0.6.5~quantal1/doc/presentations/wien08/lesmis.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/lesmis.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,254 +0,0 @@
-Myriel Napoleon
-Myriel MlleBaptistine
-Myriel MmeMagloire
-MlleBaptistine MmeMagloire
-Myriel CountessDeLo
-Myriel Geborand
-Myriel Champtercier
-Myriel Cravatte
-Myriel Count
-Myriel OldMan
-Labarre Valjean
-MmeMagloire Valjean
-MlleBaptistine Valjean
-Myriel Valjean
-Valjean Marguerite
-Valjean MmeDeR
-Valjean Isabeau
-Valjean Gervais
-Tholomyes Listolier
-Tholomyes Fameuil
-Listolier Fameuil
-Tholomyes Blacheville
-Listolier Blacheville
-Fameuil Blacheville
-Tholomyes Favourite
-Listolier Favourite
-Fameuil Favourite
-Blacheville Favourite
-Tholomyes Dahlia
-Listolier Dahlia
-Fameuil Dahlia
-Blacheville Dahlia
-Favourite Dahlia
-Tholomyes Zephine
-Listolier Zephine
-Fameuil Zephine
-Blacheville Zephine
-Favourite Zephine
-Dahlia Zephine
-Tholomyes Fantine
-Listolier Fantine
-Fameuil Fantine
-Blacheville Fantine
-Favourite Fantine
-Dahlia Fantine
-Zephine Fantine
-Marguerite Fantine
-Valjean Fantine
-Fantine MmeThenardier
-Valjean MmeThenardier
-MmeThenardier Thenardier
-Fantine Thenardier
-Valjean Thenardier
-MmeThenardier Cosette
-Valjean Cosette
-Tholomyes Cosette
-Thenardier Cosette
-Valjean Javert
-Fantine Javert
-Thenardier Javert
-MmeThenardier Javert
-Cosette Javert
-Valjean Fauchelevent
-Javert Fauchelevent
-Fantine Bamatabois
-Javert Bamatabois
-Valjean Bamatabois
-Fantine Perpetue
-Perpetue Simplice
-Valjean Simplice
-Fantine Simplice
-Javert Simplice
-Valjean Scaufflaire
-Valjean Woman1
-Javert Woman1
-Valjean Judge
-Bamatabois Judge
-Valjean Champmathieu
-Judge Champmathieu
-Bamatabois Champmathieu
-Judge Brevet
-Champmathieu Brevet
-Valjean Brevet
-Bamatabois Brevet
-Judge Chenildieu
-Champmathieu Chenildieu
-Brevet Chenildieu
-Valjean Chenildieu
-Bamatabois Chenildieu
-Judge Cochepaille
-Champmathieu Cochepaille
-Brevet Cochepaille
-Chenildieu Cochepaille
-Valjean Cochepaille
-Bamatabois Cochepaille
-Thenardier Pontmercy
-Thenardier Boulatruelle
-MmeThenardier Eponine
-Thenardier Eponine
-Eponine Anzelma
-Thenardier Anzelma
-MmeThenardier Anzelma
-Valjean Woman2
-Cosette Woman2
-Javert Woman2
-Fauchelevent MotherInnocent
-Valjean MotherInnocent
-Fauchelevent Gribier
-Jondrette MmeBurgon
-MmeBurgon Gavroche
-Thenardier Gavroche
-Javert Gavroche
-Valjean Gavroche
-Cosette Gillenormand
-Valjean Gillenormand
-Gillenormand Magnon
-MmeThenardier Magnon
-Gillenormand MlleGillenormand
-Cosette MlleGillenormand
-Valjean MlleGillenormand
-MlleGillenormand MmePontmercy
-Pontmercy MmePontmercy
-MlleGillenormand MlleVaubois
-MlleGillenormand LtGillenormand
-Gillenormand LtGillenormand
-Cosette LtGillenormand
-MlleGillenormand Marius
-Gillenormand Marius
-Pontmercy Marius
-LtGillenormand Marius
-Cosette Marius
-Valjean Marius
-Tholomyes Marius
-Thenardier Marius
-Eponine Marius
-Gavroche Marius
-Gillenormand BaronessT
-Marius BaronessT
-Marius Mabeuf
-Eponine Mabeuf
-Gavroche Mabeuf
-Marius Enjolras
-Gavroche Enjolras
-Javert Enjolras
-Mabeuf Enjolras
-Valjean Enjolras
-Enjolras Combeferre
-Marius Combeferre
-Gavroche Combeferre
-Mabeuf Combeferre
-Gavroche Prouvaire
-Enjolras Prouvaire
-Combeferre Prouvaire
-Gavroche Feuilly
-Enjolras Feuilly
-Prouvaire Feuilly
-Combeferre Feuilly
-Mabeuf Feuilly
-Marius Feuilly
-Marius Courfeyrac
-Enjolras Courfeyrac
-Combeferre Courfeyrac
-Gavroche Courfeyrac
-Mabeuf Courfeyrac
-Eponine Courfeyrac
-Feuilly Courfeyrac
-Prouvaire Courfeyrac
-Combeferre Bahorel
-Gavroche Bahorel
-Courfeyrac Bahorel
-Mabeuf Bahorel
-Enjolras Bahorel
-Feuilly Bahorel
-Prouvaire Bahorel
-Marius Bahorel
-Marius Bossuet
-Courfeyrac Bossuet
-Gavroche Bossuet
-Bahorel Bossuet
-Enjolras Bossuet
-Feuilly Bossuet
-Prouvaire Bossuet
-Combeferre Bossuet
-Mabeuf Bossuet
-Valjean Bossuet
-Bahorel Joly
-Bossuet Joly
-Gavroche Joly
-Courfeyrac Joly
-Enjolras Joly
-Feuilly Joly
-Prouvaire Joly
-Combeferre Joly
-Mabeuf Joly
-Marius Joly
-Bossuet Grantaire
-Enjolras Grantaire
-Combeferre Grantaire
-Courfeyrac Grantaire
-Joly Grantaire
-Gavroche Grantaire
-Bahorel Grantaire
-Feuilly Grantaire
-Prouvaire Grantaire
-Mabeuf MotherPlutarch
-Thenardier Gueulemer
-Valjean Gueulemer
-MmeThenardier Gueulemer
-Javert Gueulemer
-Gavroche Gueulemer
-Eponine Gueulemer
-Thenardier Babet
-Gueulemer Babet
-Valjean Babet
-MmeThenardier Babet
-Javert Babet
-Gavroche Babet
-Eponine Babet
-Thenardier Claquesous
-Babet Claquesous
-Gueulemer Claquesous
-Valjean Claquesous
-MmeThenardier Claquesous
-Javert Claquesous
-Eponine Claquesous
-Enjolras Claquesous
-Javert Montparnasse
-Babet Montparnasse
-Gueulemer Montparnasse
-Claquesous Montparnasse
-Valjean Montparnasse
-Gavroche Montparnasse
-Eponine Montparnasse
-Thenardier Montparnasse
-Cosette Toussaint
-Javert Toussaint
-Valjean Toussaint
-Gavroche Child1
-Gavroche Child2
-Child1 Child2
-Babet Brujon
-Gueulemer Brujon
-Thenardier Brujon
-Gavroche Brujon
-Eponine Brujon
-Claquesous Brujon
-Montparnasse Brujon
-Bossuet MmeHucheloup
-Joly MmeHucheloup
-Grantaire MmeHucheloup
-Bahorel MmeHucheloup
-Courfeyrac MmeHucheloup
-Gavroche MmeHucheloup
-Enjolras MmeHucheloup
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/presentation.tex igraph-0.6.5/doc/presentations/wien08/presentation.tex
--- igraph-0.6.5~quantal1/doc/presentations/wien08/presentation.tex	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/presentation.tex	1970-01-01 00:00:00.000000000 +0000
@@ -1,649 +0,0 @@
-\documentclass[landscape,fleqno]{foils}
-
-\usepackage{ae}
-%\usepackage{hyperref}
-%\usepackage{thumbpdf}
-\usepackage{graphicx}
-\usepackage{color}
-\usepackage[left=1cm,right=1cm,top=2cm,bottom=2cm]{geometry}
-% \usepackage[display]{texpower}
-%\usepackage{psfrag}
-\usepackage{ragged2e}
-\usepackage{amstext}
-\usepackage{xspace}
-\usepackage{fancyvrb}
-\usepackage{amsmath}
-\usepackage{url}
-\usepackage{pause}
-
-\newcommand{\figfigure}[2]{%
-  \begin{psfrags}%
-  \input #2.eps_t%
-  \includegraphics[width=#1]{#2.eps}%
-  \end{psfrags}%
-}
-
-\newcommand{\stitle}[1]{{\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-\newcommand{\cstitle}[1]{{\centering\color{blue}\Large #1\par\vspace*{10pt}\hrule}}
-
-\setlength{\columnsep}{0.5cm}
-\setlength{\columnseprule}{0.4pt}
-
-\renewcommand{\emph}[1]{\textcolor{red}{\bf #1}}
-
-\newcommand{\igraph}{\texttt{{igraph}}\xspace}
-
-\DefineVerbatimEnvironment{Myverb}{Verbatim}
-{gobble=2,numbers=left,numbersep=5mm,frame=lines,fontsize=\small}
-
-\newenvironment{narrow}[2]{%
-  \begin{list}{}{%
-      \setlength{\topsep}{0pt}%
-      \setlength{\leftmargin}{#1}%
-      \setlength{\rightmargin}{#2}%
-      \setlength{\listparindent}{\parindent}%
-      \setlength{\itemindent}{\parindent}%
-      \setlength{\parsep}{\parskip}}%
-    \item[]}{\end{list}}
-
-\begin{document}
-
-\RaggedRight
-% \color{white}
-% \pagecolor{black}
-\fvset{fontsize=\small}
-\fvset{commandchars=\\\{\}}
-\definecolor{grey}{gray}{0.75}
-\fvset{frame=single, numbers=left, rulecolor=\color{grey}}
-
-\MyLogo{\color{black}Practical statistical network analysis -- WU Wien}
-
-\thispagestyle{empty}
-\vspace*{1cm}
-{\centering
-\hrule
-\Large
-\vspace*{1cm}
-{\bf Practical statistical network analysis\\ (with \emph{R} and \igraph)}
-\vspace*{1cm}
-\par
-\hrule
-\par
-\vspace*{2cm}
-\normalsize G\'abor Cs\'ardi\\
-\small \verb+csardi@rmki.kfki.hu+
-\par
-\vspace*{1.5cm}
-Department of Biophysics, 
-KFKI Research Institute for Nuclear and Particle Physics of the\\
-Hungarian Academy of Sciences, Budapest, Hungary\\[15pt]
-Currently at \\Department of Medical Genetics, \\
-University of Lausanne, Lausanne, Switzerland\\
-}
-
-\newpage
-\stitle{What is a network (or graph)?}
-\includegraphics[width=0.5\textwidth]{frplots}
-
-\newpage
-\cstitle{What is a network (or graph)?}
-\begin{center}
-\includegraphics[width=0.6\textwidth]{ercomps}
-\end{center}
-
-\newpage
-\cstitle{What is a network (or graph)?}
-\begin{center}
-\includegraphics[width=0.8\textwidth]{3dplot}
-\end{center}
-
-\newpage
-\cstitle{What is a graph?}
-\begin{itemize}
-\item Binary relation (=\emph{edges}) between elements of a set
-  (=\emph{vertices}). \pause\\[-15pt]
-\item E.g. 
-  \begin{align} 
-    \text{vertices} & =\{A,B,C,D,E\} \nonumber\\
-    \text{edges}    & =( \{A,B\},\{A,C\},\{B,C\}, \{C,E\} ). \nonumber
-  \end{align} \pause
-\item It is ``better'' to draw it:
-  \begin{center}
-    \includegraphics[width=0.25\textwidth]{small1} \pause
-    \includegraphics[width=0.25\textwidth]{small2}
-  \end{center}
-\end{itemize}
-
-\newpage
-\cstitle{Undirected and directed graphs}
-\begin{itemize}
-\item If the pairs are unordered, then the graph is undirected:
-
-  \begin{minipage}{0.7\textwidth}
-    \begin{align} 
-      \text{vertices} & =\{A,B,C,D,E\} \nonumber\\
-      \text{edges}    & =( \{A,B\},\{A,C\},\{B,C\},\{C,E\} ). \nonumber
-    \end{align}
-  \end{minipage}\begin{minipage}{0.3\textwidth}
-    \includegraphics[width=0.8\textwidth]{small3}
-  \end{minipage}\pause
-
-\item Otherwise it is directed:
-
-  \begin{minipage}{0.7\textwidth}
-    \begin{align} 
-      \text{vertices} & =\{A,B,C,D,E\} \nonumber\\
-      \text{edges}    & =( (A,B),(A,C),(B,C),(C,E) ). \nonumber
-    \end{align}
-  \end{minipage}\begin{minipage}{0.3\textwidth}
-    \includegraphics[width=0.8\textwidth]{small4}
-  \end{minipage}
-\end{itemize}
-
-\newpage
-\stitle{The \igraph ``package''}
-
-\begin{narrow}{0cm}{10cm}
-\begin{itemize}
-\item For classic graph theory and network science.
-\item Core functionality is implemented as a C library.
-\item High level interfaces from \emph{R} and \emph{Python}.
-\item GNU GPL.
-\item \url{http://igraph.sf.net}
-\end{itemize}
-\includegraphics[width=0.45\textwidth]{homepage}
-\end{narrow}
-
-\newpage
-\stitle{Vertex and edge ids}
-\begin{narrow}{0cm}{12cm}
-\begin{itemize}
-\item Vertices are always numbered from zero (!).
-\item Numbering is continual, form 0 to $|V|-1$. \pause
-\item We have to ``translate'' vertex names to ids: 
-\begin{align} 
-  V & =\{A,B,C,D,E\} \nonumber\\
-  E & =( (A,B),(A,C),(B,C),(C,E) ). \nonumber\\
-  A & =0, B=1, C=2, D=3, E=4. \nonumber
-\end{align} \pause
-\begin{Myverb}
-  > g <- graph( c(0,1, 0,2, 1,2, 2,4), n=5 )
-\end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Creating \igraph graphs}
-% Giving the edges
-% igraph objects
-% is.igraph, is.directed, vcount, ecount, summary
-\begin{narrow}{0cm}{12cm}
-\begin{itemize}
-\item \igraph objects \pause
-\item \verb+print()+, \verb+summary()+, \verb+is.igraph()+ \pause
-\item \verb+is.directed()+, \verb+vcount()+, \verb+ecount()+
-\end{itemize}
-\begin{Myverb}
-  > g <- graph( c(0,1, 0,2, 1,2, 2,4), n=5 )
-  > g
-  Vertices: 5 
-  Edges: 4 
-  Directed: TRUE 
-  Edges:
-          
-  [0] 0 -> 1
-  [1] 0 -> 2
-  [2] 1 -> 2
-  [3] 2 -> 4
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Visualization}
-\begin{narrow}{0cm}{12cm}
-\begin{Myverb}
-  > g <- graph.tree(40, 4)
-  > plot(g)
-  > plot(g, layout=layout.circle)
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # Force directed layouts
-  > plot(g, layout=layout.fruchterman.reingold)
-  > plot(g, layout=layout.graphopt)
-  > plot(g, layout=layout.kamada.kawai)
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # Interactive
-  > tkplot(g, layout=layout.kamada.kawai)
-  > l <- layout=layout.kamada.kawai(g)
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # 3D
-  > rglplot(g, layout=l)
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # Visual properties
-  > plot(g, layout=l, vertex.color="cyan")
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Simple graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \igraph can handle multi-graphs:
-  \begin{align} 
-    V & =\{A,B,C,D,E\} \nonumber\\
-    E & =( (AB),(AB),(AC),(BC),(CE) ). \nonumber
-  \end{align}
-  \begin{Myverb}
-  > g <- graph( c(0,1,0,1, 0,2, 1,2, 3,4), n=5 )
-  > g
-  Vertices: 5 
-  Edges: 5 
-  Directed: TRUE 
-  Edges:
-          
-  [0] 0 -> 1
-  [1] 0 -> 1
-  [2] 0 -> 2
-  [3] 1 -> 2
-  [4] 3 -> 4
-  \end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Simple graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \igraph can handle loop-edges:
-  \begin{align} 
-    V & =\{A,B,C,D,E\} \nonumber\\
-    E & =( (AA),(AB),(AC),(BC),(CE) ). \nonumber
-  \end{align}
-  \begin{Myverb}
-  > g <- graph( c(0,0,0,1, 0,2, 1,2, 3,4), n=5 )
-  > g
-  Vertices: 5 
-  Edges: 5 
-  Directed: TRUE 
-  Edges:
-          
-  [0] 0 -> 0
-  [1] 0 -> 1
-  [2] 0 -> 2
-  [3] 1 -> 2
-  [4] 3 -> 4
-  \end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Creating (more) \igraph graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
- > el <- scan("lesmis.txt")
- > el <- matrix(el, byrow=TRUE, nc=2)
- > gmis <- graph.edgelist(el, dir=FALSE)
- > summary(gmis)
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Naming vertices}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
- > V(gmis)$name
- > g <- graph.ring(10)
- > V(g)$name <- sample(letters, vcount(g))
-\end{Myverb}
-\end{narrow}
-% From edge list, data frame
-% graph.edgelist
-% graph.data.frame
-
-\newpage
-\stitle{Creating (more) \igraph graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{Myverb}
-  # A simple undirected graph
-  > g <- graph.formula( Alice-Bob-Cecil-Alice, 
-      Daniel-Cecil-Eugene, Cecil-Gordon )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # Another undirected graph, ":" notation
-  > g2 <- graph.formula( Alice-Bob:Cecil:Daniel, 
-      Cecil:Daniel-Eugene:Gordon )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # A directed graph
-  > g3 <- graph.formula( Alice +-+ Bob --+ Cecil 
-      +-- Daniel, Eugene --+ Gordon:Helen )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # A graph with isolate vertices
-  > g4 <- graph.formula( Alice -- Bob -- Daniel, 
-      Cecil:Gordon, Helen )
-\end{Myverb}
-\vspace*{-2cm} \pause
-\begin{Myverb}
-  # "Arrows" can be arbitrarily long
-  > g5 <- graph.formula( Alice +---------+ Bob )
-\end{Myverb}
-\end{narrow}
-% Formula notation
-
-\newpage
-\stitle{Vertex/Edge sets, attributes}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Assigning attributes:
-  \texttt{set/get.graph/vertex/edge.attribute}. \pause\vspace*{-0.8cm}
-\item \verb+V(g)+ and \verb+E(g)+. \pause
-\item Smart indexing, e.g. \verb+V(g)[color=="white"]+ \pause
-\item Easy access of attributes:
-  \begin{Myverb}
-  > g <- erdos.renyi.game(100, 1/100)
-  > V(g)$color <- sample( c("red", "black"), 
-                          vcount(g), rep=TRUE)
-  > E(g)$color <- "grey"
-  > red <- V(g)[ color == "red" ]
-  > bl <- V(g)[ color == "black" ]
-  > E(g)[ red %--% red ]$color <- "red"
-  > E(g)[ bl  %--% bl ]$color <- "black"
-  > plot(g, vertex.size=5, layout=
-         layout.fruchterman.reingold)
-\end{Myverb}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Creating (even) more graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item E.g. from \verb+.csv+ files.
-\end{itemize}
-\begin{Myverb}
-  > traits <- read.csv("traits.csv", head=F)
-  > relations <- read.csv("relations.csv", head=F)
-  > orgnet <- graph.data.frame(relations)
-
-  > traits[,1] <- sapply(strsplit(as.character
-    (traits[,1]), split=" "), "[[", 1)
-  > idx <- match(V(orgnet)$name, traits[,1])
-  > V(orgnet)$gender <- as.character(traits[,3][idx])
-  > V(orgnet)$age <- traits[,2][idx]
-  
-  > igraph.par("print.vertex.attributes", TRUE)
-  > orgnet
-\end{Myverb}
-% $
-\end{narrow}
-
-\newpage
-\stitle{Creating (even) more graphs}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item From the web, e.g. Pajek files.
-\end{itemize}
-\begin{Myverb}
-  > karate <- read.graph("http://cneurocvs.rmki.kfki.hu/igraph/karate.net",
-                         format="pajek")
-  > summary(karate)
-  Vertices: 34 
-  Edges: 78 
-  Directed: FALSE 
-  No graph attributes.
-  No vertex attributes.
-  No edge attributes.
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Graph representation}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item There is no best format, everything depends on
-  what kind of questions one wants to ask.
-\begin{center}
-\includegraphics[width=0.45\textwidth]{example}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph representation}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Adjacency matrix. Good for questions like: is 'Alice' connected
-  to 'Bob'?
-\begin{center}
-  \includegraphics[width=0.45\textwidth]{adjacency}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph representation}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Edge list. Not really good for anything.
-\begin{center}
-  \includegraphics{edgelist}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph representation}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Adjacency lists. GQ: who are the neighbors of 'Alice'?
-\begin{center}
-  \includegraphics{adjlist}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Graph representation}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item \igraph. Flat data structures, indexed edge lists. Easy to
-  handle, good for many kind of questions.
-\begin{center}
-  \includegraphics[width=0.45\textwidth]{igraph}
-\end{center}
-\end{itemize}
-\end{narrow}
-% Adjacency matrix, edge list, adjacency lists,
-% igraph
-
-\newpage
-\stitle{Centrality in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item degree
-\begin{center}
-\includegraphics[width=0.45\textwidth]{ex-deg}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Centrality in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item closeness
-  \[ C_v = \frac{|V|-1}{\sum_{i\ne v} d_{vi}} \]
-\begin{center}
-\includegraphics[width=0.45\textwidth]{ex-close}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Centrality in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item betweenness
-  \[ B_v= \sum_{i\ne j, i\ne v, j\ne v} g_{ivj}/g_{ij} \]
-\begin{center}
-\includegraphics[width=0.45\textwidth]{ex-betw}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Centrality in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item eigenvector centrality
-\[ E_v = \frac{1}{\lambda} \sum_{i=1}^{|V|} A_{iv} E_i, 
-   \quad Ax=\lambda x \]
-\begin{center}
-\vspace*{-1cm}
-\includegraphics[width=0.45\textwidth]{ex-ev}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Centrality in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item page rank
-\[ E_v =  \frac{1-d}{|V|} + d \sum_{i=1}^{|V|} A_{iv} E_i \]
-\begin{center}
-\vspace*{-1cm}
-\includegraphics[width=0.45\textwidth]{ex-pagerank}
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Community structure in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Organizing things, clustering items to see the structure.
-\begin{center}
-\includegraphics[width=0.45\textwidth]{commstr}\\[15pt]
-{\tiny M. E. J. Newman, PNAS, 103, 8577--8582\par }
-\end{center}
-\end{itemize}
-\end{narrow}
-
-\newpage
-\stitle{Community structure in networks}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item How to define what is modular? Many proposed definitions, here
-  is a popular one:
-  \[ Q = \frac1{2|E|}\sum_{vw} [A_{vw} - p_{vw} ]\delta(c_v,c_w). \] \pause
-\item Random graph null model: 
-  \[ p_{vw} = p = \frac{1}{|V|(|V|-1)} \] \pause
-\item Degree sequence based null model:
-  \[ p_{vw} = \frac{k_vk_w}{2|E|} \]
-\end{itemize}
-\end{narrow}
-
-% modularity, clustering, organizing things
-% fast greedy
-% betweenness
-% spinglass
-
-\newpage
-\stitle{Cohesive blocks}
-(Based on `Structural Cohesion and Embeddedness: a Hierarchical
-Concept of Social Groups' by J.Moody and D.White, Americal
-Sociological Review, 68, 103--127, 2003)
-
-\begin{quotation}
-Definition 1: A collectivity is structurally cohesive to the extent
-that the social relations of its members hold it together. 
-\end{quotation} \pause\vspace*{-0.8cm}
-
-\begin{quotation}
-Definition 2: A group is structurally cohesive to the extent that
-multiple independent relational paths among all pairs of members hold
-it together.
-\end{quotation} \pause\vspace*{-0.8cm}
-
-\begin{itemize}
-\item Vertex-independent paths and vertex connectivity. \pause\vspace*{-0.8cm}
-\item Vertex connectivity and network flows.
-\end{itemize}
-
-\newpage
-\stitle{Cohesive blocks}
-\vspace*{-3cm}
-{\centering
-\includegraphics[width=0.9\textwidth]{groups}\\
-}
-
-\newpage
-\stitle{Cohesive blocks}
-\includegraphics[width=0.6\textwidth]{cblocks}\\
-
-\newpage
-\stitle{Rapid prototyping}
-\begin{narrow}{0cm}{15cm}
-Weighted transitivity
-\[ c(i)=\frac{\mathbf{A}^3_{ii}}{(\mathbf{A1A})_{ii}} \] \pause
-\[ c_w(i)=\frac{\mathbf{W}^3_{ii}}{(\mathbf{WW_{\text{max}}W})_{ii}} \] \pause
-\begin{Myverb}
-  wtrans <- function(g) \{
-    W <- get.adjacency(g, attr="weight")
-    WM <- matrix(max(W), nrow(W), ncol(W))
-    diag(WM) <- 0
-    diag( W %*% W %*% W ) / 
-       diag( W %*% WM %*% W)
-  \}
-\end{Myverb}
-\end{narrow}
-
-\newpage
-\stitle{Rapid prototyping}
-\begin{narrow}{0cm}{15cm}
-Clique percolation (Palla et al., Nature 435, 814, 2005)
-\includegraphics[width=0.4\textwidth]{vicsek}
-\end{narrow}
-
-\newpage
-\stitle{\ldots and the rest}
-\begin{narrow}{0cm}{15cm}
-\begin{itemize}
-\item Cliques and independent vertex sets.
-\item Network flows.
-\item Motifs, i.e. dyad and triad census.
-\item Random graph generators.
-\item Graph isomorphism.
-\item Vertex similarity measures, topological sorting, 
-  spanning trees, graph components, K-cores, transitivity or
-  clustering coefficient.
-\item etc.
-\item C-level: rich data type library.
-\end{itemize}
-\end{narrow}
-
-\newpage
-\cstitle{Acknowledgement}
-
-\begin{center}
-\vfill
-Tam\'as Nepusz\par\vfil
-All the people who contributed code, sent bug reports, suggestions\par\vfil
-The R project\par\vfil
-Hungarian Academy of Sciences\par\vfil
-The OSS community in general\par\vfill
-\end{center}
-
-\end{document}
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/relations.csv igraph-0.6.5/doc/presentations/wien08/relations.csv
--- igraph-0.6.5~quantal1/doc/presentations/wien08/relations.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/relations.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-Bob,Alice,N,4,4
-Cecil,Bob,N,5,5
-Cecil,Alice,Y,5,5
-David,Alice,N,3,4
-David,Bob,N,4,2
-Esmeralda,Alice,Y,4,3
-Frank,Alice,N,3,2
-Frank,Esmeralda,N,4,4
-Gabi,Bob,Y,5,5
-Gabi,Alice,N,3,0
-Helen,Alice,N,4,1
-Iris,Cecil,N,0,1
-Iris,Bob,Y,4,3
-Iris,Esmeralda,N,5,5
-James,Alice,N,3,2
-James,Bob,Y,4,5
-James,Gabi,Y,5,5
-Alice,Bob,N,4,4
-Bob,Cecil,N,5,5
-Alice,Cecil,Y,5,5
-Alice,David,N,0,3
-Bob,David,N,4,1
-Alice,Esmeralda,Y,3,1
-Alice,Frank,N,3,3
-Esmeralda,Frank,N,5,4
-Bob,Gabi,Y,4,5
-Alice,Gabi,N,0,1
-Alice,Helen,N,4,3
-Cecil,Iris,N,3,2
-Bob,Iris,Y,3,2
-Esmeralda,Iris,N,5,5
-Alice,James,N,0,3
-Bob,James,Y,4,3
-Gabi,James,Y,5,4
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/small1.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/small1.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/small2.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/small2.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/small3.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/small3.pdf differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/small4.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/small4.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/presentations/wien08/traits.csv igraph-0.6.5/doc/presentations/wien08/traits.csv
--- igraph-0.6.5~quantal1/doc/presentations/wien08/traits.csv	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/presentations/wien08/traits.csv	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-Alice Anderson,48,F
-Bob Bradford,33,M
-Cecil Connor,45,F
-David Daugher,34,M
-Esmeralda Escobar,21,F
-Frank Finley,36,M
-Gabi Garbo,44,F
-Helen Hunt,40,F
-Iris Irving,25,F
-James Jones,47,M
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/presentations/wien08/vicsek.pdf and /tmp/mkpaUile3f/igraph-0.6.5/doc/presentations/wien08/vicsek.pdf differ
diff -Nru igraph-0.6.5~quantal1/doc/progress.xxml igraph-0.6.5/doc/progress.xxml
--- igraph-0.6.5~quantal1/doc/progress.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/progress.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Progress">
-<title>Progress handlers</title>
-
-<section>
-<!-- doxrox-include about_progress_handlers -->
-</section>
-
-<section><title>Setting up progress handlers</title>
-<!-- doxrox-include igraph_progress_handler_t -->
-<!-- doxrox-include igraph_set_progress_handler -->
-<!-- doxrox-include igraph_progress_handler_stderr -->
-</section>
-
-<section><title>Invoking the progress handler</title>
-<!-- doxrox-include IGRAPH_PROGRESS -->
-<!-- doxrox-include igraph_progress -->
-<!-- doxrox-include igraph_progressf -->
-</section>
-
-<section>
-<!-- doxrox-include writing_progress_handlers -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_functions_with_progress -->
-</section>
-
-<section>
-<!-- doxrox-include progress_and_threads -->
-</section>
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/random.xxml igraph-0.6.5/doc/random.xxml
--- igraph-0.6.5~quantal1/doc/random.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/random.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Random">
-<title>Random numbers</title>
-
-<!-- doxrox-include about_rngs -->
-
-<section><title>The default random number generator</title>
-<!-- doxrox-include igraph_rng_default -->
-<!-- doxrox-include igraph_rng_set_default -->
-</section>
-
-<section><title>Creating random number generators</title>
-<!-- doxrox-include igraph_rng_init -->
-<!-- doxrox-include igraph_rng_destroy -->
-<!-- doxrox-include igraph_rng_seed -->
-<!-- doxrox-include igraph_rng_min -->
-<!-- doxrox-include igraph_rng_max -->
-<!-- doxrox-include igraph_rng_name -->
-</section>
-
-<section><title>Generating random numbers</title>
-<!-- doxrox-include igraph_rng_get_integer -->
-<!-- doxrox-include igraph_rng_get_unif -->
-<!-- doxrox-include igraph_rng_get_unif01 -->
-<!-- doxrox-include igraph_rng_get_normal -->
-<!-- doxrox-include igraph_rng_get_geom -->
-<!-- doxrox-include igraph_rng_get_binom -->
-</section>
-
-<section><title>Supported random number generators</title>
-<para>
-By default igraph uses the MT19937 generator. Prior to igraph version
-0.6, the generator supplied by the standard C library was used. This
-means the GLIBC2 generator on GNU libc 2 systems, and maybe the RAND
-generator on others.
-</para>
-<!-- doxrox-include igraph_rngtype_mt19937 -->
-<!-- doxrox-include igraph_rngtype_glibc2 -->
-<!-- doxrox-include igraph_rngtype_rand -->
-</section>
-
-<!-- doxrox-include rng_use_cases -->
-
-</chapter>
-
diff -Nru igraph-0.6.5~quantal1/doc/scg.xxml igraph-0.6.5/doc/scg.xxml
--- igraph-0.6.5~quantal1/doc/scg.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/scg.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-<?xml version='1.0'?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN"
-                  "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-SCG">
-<title>Spectral Coarse Graining</title>
-
-<section><title>Introduction</title>
-<!-- doxrox-include about_scg -->
-</section>
-
-<section><title>SCG functions</title>
-<!-- doxrox-include igraph_scg_adjacency -->
-<!-- doxrox-include igraph_scg_stochastic -->
-<!-- doxrox-include igraph_scg_laplacian -->
-<!-- doxrox-include igraph_scg_grouping -->
-<!-- doxrox-include igraph_scg_semiprojectors -->
-<!-- doxrox-include igraph_scg_norm_eps -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/separators.xxml igraph-0.6.5/doc/separators.xxml
--- igraph-0.6.5~quantal1/doc/separators.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/separators.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Separators">
-<title>Vertex separators</title>
-
-<!-- doxrox-include igraph_is_separator -->
-<!-- doxrox-include igraph_is_minimal_separator -->
-<!-- doxrox-include igraph_all_minimal_st_separators -->
-<!-- doxrox-include igraph_minimum_size_separators -->
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/sitemap_gen.py igraph-0.6.5/doc/sitemap_gen.py
--- igraph-0.6.5~quantal1/doc/sitemap_gen.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/sitemap_gen.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,2094 +0,0 @@
-#!/usr/bin/env python
-#
-# Copyright (c) 2004, 2005 Google Inc.
-# All rights reserved.
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions
-# are met:
-#
-# * Redistributions of source code must retain the above copyright
-#   notice, this list of conditions and the following disclaimer.
-#
-# * Redistributions in binary form must reproduce the above copyright
-#   notice, this list of conditions and the following disclaimer in
-#   the documentation and/or other materials provided with the
-#   distribution.
-#
-# * Neither the name of Google nor the names of its contributors may
-#   be used to endorse or promote products derived from this software
-#   without specific prior written permission.
-#
-# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
-# FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
-# COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
-# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
-# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-# CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
-# ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-# POSSIBILITY OF SUCH DAMAGE.
-#
-#
-# The sitemap_gen.py script is written in Python 2.2 and released to
-# the open source community for continuous improvements under the BSD
-# 2.0 new license, which can be found at:
-#
-#   http://www.opensource.org/licenses/bsd-license.php
-#
-
-__usage__ = \
-"""A simple script to automatically produce sitemaps for a webserver,
-in the Google Sitemap Protocol (GSP).
-
-Usage: python sitemap_gen.py --config=config.xml [--help] [--testing]
-            --config=config.xml, specifies config file location
-            --help, displays usage message
-            --testing, specified when user is experimenting
-"""
-
-# Please be careful that all syntax used in this file can be parsed on
-# Python 1.5 -- this version check is not evaluated until after the
-# entire file has been parsed.
-import sys
-if sys.hexversion < 0x02020000:
-  print 'This script requires Python 2.2 or later.'
-  print 'Currently run with version: %s' % sys.version
-  sys.exit(1)
-
-import fnmatch
-import glob
-import gzip
-import md5
-import os
-import re
-import stat
-import time
-import types
-import urllib
-import urlparse
-import xml.sax
-
-# True and False were introduced in Python2.2.2
-try:
-  testTrue=True
-  del testTrue
-except NameError:
-  True=1
-  False=0
-
-# Text encodings
-ENC_ASCII = 'ASCII'
-ENC_UTF8  = 'UTF-8'
-ENC_IDNA  = 'IDNA'
-ENC_ASCII_LIST = ['ASCII', 'US-ASCII', 'US', 'IBM367', 'CP367', 'ISO646-US'
-                  'ISO_646.IRV:1991', 'ISO-IR-6', 'ANSI_X3.4-1968',
-                  'ANSI_X3.4-1986', 'CPASCII' ]
-ENC_DEFAULT_LIST = ['ISO-8859-1', 'ISO-8859-2', 'ISO-8859-5']
-
-# Available Sitemap types
-SITEMAP_TYPES = ['web', 'mobile', 'news']
-
-# General Sitemap tags
-GENERAL_SITEMAP_TAGS = ['loc', 'changefreq', 'priority', 'lastmod']
-
-# News specific tags
-NEWS_SPECIFIC_TAGS = ['keywords', 'publication_date', 'stock_tickers']
-
-# News Sitemap tags
-NEWS_SITEMAP_TAGS = GENERAL_SITEMAP_TAGS + NEWS_SPECIFIC_TAGS
-
-# Maximum number of urls in each sitemap, before next Sitemap is created
-MAXURLS_PER_SITEMAP = 50000
-
-# Suffix on a Sitemap index file
-SITEINDEX_SUFFIX = '_index.xml'
-
-# Regular expressions tried for extracting URLs from access logs.
-ACCESSLOG_CLF_PATTERN = re.compile(
-  r'.+\s+"([^\s]+)\s+([^\s]+)\s+HTTP/\d+\.\d+"\s+200\s+.*'
-  )
-
-# Match patterns for lastmod attributes
-DATE_PATTERNS = map(re.compile, [
-  r'^\d\d\d\d$',
-  r'^\d\d\d\d-\d\d$',
-  r'^\d\d\d\d-\d\d-\d\d$',
-  r'^\d\d\d\d-\d\d-\d\dT\d\d:\d\dZ$',
-  r'^\d\d\d\d-\d\d-\d\dT\d\d:\d\d[+-]\d\d:\d\d$',
-  r'^\d\d\d\d-\d\d-\d\dT\d\d:\d\d:\d\d(\.\d+)?Z$',
-  r'^\d\d\d\d-\d\d-\d\dT\d\d:\d\d:\d\d(\.\d+)?[+-]\d\d:\d\d$',
-  ])
-
-# Match patterns for changefreq attributes
-CHANGEFREQ_PATTERNS = [
-  'always', 'hourly', 'daily', 'weekly', 'monthly', 'yearly', 'never'
-  ]
-
-# XML formats
-GENERAL_SITEINDEX_HEADER   = \
-  '<?xml version="1.0" encoding="UTF-8"?>\n' \
-  '<sitemapindex\n' \
-  '  xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"\n' \
-  '  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"\n' \
-  '  xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9\n' \
-  '                      http://www.sitemaps.org/schemas/sitemap/0.9/' \
-  'siteindex.xsd">\n'
-
-NEWS_SITEINDEX_HEADER   = \
-  '<?xml version="1.0" encoding="UTF-8"?>\n' \
-  '<sitemapindex\n' \
-  '  xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"\n' \
-  '  xmlns:news="http://www.google.com/schemas/sitemap-news/0.9"\n' \
-  '  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"\n' \
-  '  xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9\n' \
-  '                      http://www.sitemaps.org/schemas/sitemap/0.9/' \
-  'siteindex.xsd">\n'
-
-SITEINDEX_FOOTER   = '</sitemapindex>\n'
-SITEINDEX_ENTRY    = \
-  ' <sitemap>\n' \
-  '  <loc>%(loc)s</loc>\n' \
-  '  <lastmod>%(lastmod)s</lastmod>\n' \
-  ' </sitemap>\n'
-GENERAL_SITEMAP_HEADER     = \
-  '<?xml version="1.0" encoding="UTF-8"?>\n' \
-  '<urlset\n' \
-  '  xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"\n' \
-  '  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"\n' \
-  '  xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9\n' \
-  '                      http://www.sitemaps.org/schemas/sitemap/0.9/' \
-  'sitemap.xsd">\n'
-
-NEWS_SITEMAP_HEADER	= \
-  '<?xml version="1.0" encoding="UTF-8"?>\n' \
-  '<urlset\n' \
-  '  xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"\n' \
-  '  xmlns:news="http://www.google.com/schemas/sitemap-news/0.9"\n' \
-  '  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"\n' \
-  '  xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9\n' \
-  '                      http://www.sitemaps.org/schemas/sitemap/0.9/' \
-  'sitemap.xsd">\n'
-
-SITEMAP_FOOTER     = '</urlset>\n'
-SITEURL_XML_PREFIX = ' <url>\n'
-SITEURL_XML_SUFFIX = ' </url>\n'
-
-NEWS_TAG_XML_PREFIX	= '  <news:news>\n'
-NEWS_TAG_XML_SUFFIX	= '  </news:news>\n'
-
-# Search engines to notify with the updated sitemaps
-#
-# This list is very non-obvious in what's going on.  Here's the gist:
-# Each item in the list is a 6-tuple of items.  The first 5 are "almost"
-# the same as the input arguments to urlparse.urlunsplit():
-#   0 - schema
-#   1 - netloc
-#   2 - path
-#   3 - query    <-- EXCEPTION: specify a query map rather than a string
-#   4 - fragment
-# Additionally, add item 5:
-#   5 - query attribute that should be set to the new Sitemap URL
-# Clear as mud, I know.
-NOTIFICATION_SITES = [
-  ('http', 'www.google.com', 'webmasters/sitemaps/ping', {}, '', 'sitemap'),
-  ]
-
-
-class Error(Exception):
-  """
-  Base exception class.  In this module we tend not to use our own exception
-  types for very much, but they come in very handy on XML parsing with SAX.
-  """
-  pass
-#end class Error
-
-
-class SchemaError(Error):
-  """Failure to process an XML file according to the schema we know."""
-  pass
-#end class SchemeError
-
-
-class Encoder:
-  """
-  Manages wide-character/narrow-character conversions for just about all
-  text that flows into or out of the script.
-
-  You should always use this class for string coercion, as opposed to
-  letting Python handle coercions automatically.  Reason: Python
-  usually assumes ASCII (7-bit) as a default narrow character encoding,
-  which is not the kind of data we generally deal with.
-
-  General high-level methodologies used in sitemap_gen:
-
-  [PATHS]
-  File system paths may be wide or narrow, depending on platform.
-  This works fine, just be aware of it and be very careful to not
-  mix them.  That is, if you have to pass several file path arguments
-  into a library call, make sure they are all narrow or all wide.
-  This class has MaybeNarrowPath() which should be called on every
-  file system path you deal with.
-
-  [URLS]
-  URL locations are stored in Narrow form, already escaped.  This has the
-  benefit of keeping escaping and encoding as close as possible to the format
-  we read them in.  The downside is we may end up with URLs that have
-  intermingled encodings -- the root path may be encoded in one way
-  while the filename is encoded in another.  This is obviously wrong, but
-  it should hopefully be an issue hit by very few users.  The workaround
-  from the user level (assuming they notice) is to specify a default_encoding
-  parameter in their config file.
-
-  [OTHER]
-  Other text, such as attributes of the URL class, configuration options,
-  etc, are generally stored in Unicode for simplicity.
-  """
-
-  def __init__(self):
-    self._user      = None                  # User-specified default encoding
-    self._learned   = []                    # Learned default encodings
-    self._widefiles = False                 # File system can be wide
-
-    # Can the file system be Unicode?
-    try:
-      self._widefiles = os.path.supports_unicode_filenames
-    except AttributeError:
-      try:
-        self._widefiles = sys.getwindowsversion() == os.VER_PLATFORM_WIN32_NT
-      except AttributeError:
-        pass
-
-    # Try to guess a working default
-    try:
-      encoding = sys.getfilesystemencoding()
-      if encoding and not (encoding.upper() in ENC_ASCII_LIST):
-        self._learned = [ encoding ]
-    except AttributeError:
-      pass
-
-    if not self._learned:
-      encoding = sys.getdefaultencoding()
-      if encoding and not (encoding.upper() in ENC_ASCII_LIST):
-        self._learned = [ encoding ]
-
-    # If we had no guesses, start with some European defaults
-    if not self._learned:
-      self._learned = ENC_DEFAULT_LIST
-  #end def __init__
-
-  def SetUserEncoding(self, encoding):
-    self._user = encoding
-  #end def SetUserEncoding
-
-  def NarrowText(self, text, encoding):
-    """ Narrow a piece of arbitrary text """
-    if type(text) != types.UnicodeType:
-      return text
-
-    # Try the passed in preference
-    if encoding:
-      try:
-        result = text.encode(encoding)
-        if not encoding in self._learned:
-          self._learned.append(encoding)
-        return result
-      except UnicodeError:
-        pass
-      except LookupError:
-        output.Warn('Unknown encoding: %s' % encoding)
-
-    # Try the user preference
-    if self._user:
-      try:
-        return text.encode(self._user)
-      except UnicodeError:
-        pass
-      except LookupError:
-        temp = self._user
-        self._user = None
-        output.Warn('Unknown default_encoding: %s' % temp)
-
-    # Look through learned defaults, knock any failing ones out of the list
-    while self._learned:
-      try:
-        return text.encode(self._learned[0])
-      except:
-        del self._learned[0]
-
-    # When all other defaults are exhausted, use UTF-8
-    try:
-      return text.encode(ENC_UTF8)
-    except UnicodeError:
-      pass
-
-    # Something is seriously wrong if we get to here
-    return text.encode(ENC_ASCII, 'ignore')
-  #end def NarrowText
-  
-  def MaybeNarrowPath(self, text):
-    """ Paths may be allowed to stay wide """
-    if self._widefiles:
-      return text
-    return self.NarrowText(text, None)
-  #end def MaybeNarrowPath
-
-  def WidenText(self, text, encoding):
-    """ Widen a piece of arbitrary text """
-    if type(text) != types.StringType:
-      return text
-
-    # Try the passed in preference
-    if encoding:
-      try:
-        result = unicode(text, encoding)
-        if not encoding in self._learned:
-          self._learned.append(encoding)
-        return result
-      except UnicodeError:
-        pass
-      except LookupError:
-        output.Warn('Unknown encoding: %s' % encoding)
-
-    # Try the user preference
-    if self._user:
-      try:
-        return unicode(text, self._user)
-      except UnicodeError:
-        pass
-      except LookupError:
-        temp = self._user
-        self._user = None
-        output.Warn('Unknown default_encoding: %s' % temp)
-
-    # Look through learned defaults, knock any failing ones out of the list
-    while self._learned:
-      try:
-        return unicode(text, self._learned[0])
-      except:
-        del self._learned[0]
-
-    # When all other defaults are exhausted, use UTF-8
-    try:
-      return unicode(text, ENC_UTF8)
-    except UnicodeError:
-      pass
-
-    # Getting here means it wasn't UTF-8 and we had no working default.
-    # We really don't have anything "right" we can do anymore.
-    output.Warn('Unrecognized encoding in text: %s' % text)
-    if not self._user:
-      output.Warn('You may need to set a default_encoding in your '
-                  'configuration file.')
-    return text.decode(ENC_ASCII, 'ignore')
-  #end def WidenText
-#end class Encoder
-encoder = Encoder()
-
-
-class Output:
-  """
-  Exposes logging functionality, and tracks how many errors
-  we have thus output.
-
-  Logging levels should be used as thus:
-    Fatal     -- extremely sparingly
-    Error     -- config errors, entire blocks of user 'intention' lost
-    Warn      -- individual URLs lost
-    Log(,0)   -- Un-suppressable text that's not an error
-    Log(,1)   -- touched files, major actions
-    Log(,2)   -- parsing notes, filtered or duplicated URLs
-    Log(,3)   -- each accepted URL
-  """
-
-  def __init__(self):
-    self.num_errors    = 0                   # Count of errors
-    self.num_warns     = 0                   # Count of warnings
-
-    self._errors_shown = {}                  # Shown errors
-    self._warns_shown  = {}                  # Shown warnings
-    self._verbose      = 0                   # Level of verbosity
-  #end def __init__
-
-  def Log(self, text, level):
-    """ Output a blurb of diagnostic text, if the verbose level allows it """
-    if text:
-      text = encoder.NarrowText(text, None)
-      if self._verbose >= level:
-        print text
-  #end def Log
-
-  def Warn(self, text):
-    """ Output and count a warning.  Suppress duplicate warnings. """
-    if text:
-      text = encoder.NarrowText(text, None)
-      hash = md5.new(text).digest()
-      if not self._warns_shown.has_key(hash):
-        self._warns_shown[hash] = 1
-        print '[WARNING] ' + text
-      else:
-        self.Log('(suppressed) [WARNING] ' + text, 3)
-      self.num_warns = self.num_warns + 1
-  #end def Warn
-
-  def Error(self, text):
-    """ Output and count an error.  Suppress duplicate errors. """
-    if text:
-      text = encoder.NarrowText(text, None)
-      hash = md5.new(text).digest()
-      if not self._errors_shown.has_key(hash):
-        self._errors_shown[hash] = 1
-        print '[ERROR] ' + text
-      else:
-        self.Log('(suppressed) [ERROR] ' + text, 3)
-      self.num_errors = self.num_errors + 1
-  #end def Error
-
-  def Fatal(self, text):
-    """ Output an error and terminate the program. """
-    if text:
-      text = encoder.NarrowText(text, None)
-      print '[FATAL] ' + text
-    else:
-      print 'Fatal error.'
-    sys.exit(1)
-  #end def Fatal
-
-  def SetVerbose(self, level):
-    """ Sets the verbose level. """
-    try:
-      if type(level) != types.IntType:
-        level = int(level)
-      if (level >= 0) and (level <= 3):
-        self._verbose = level
-        return
-    except ValueError:
-      pass
-    self.Error('Verbose level (%s) must be between 0 and 3 inclusive.' % level)
-  #end def SetVerbose
-#end class Output
-output = Output()
-
-
-class URL(object):
-  """ URL is a smart structure grouping together the properties we
-  care about for a single web reference. """
-  __slots__ = 'loc', 'lastmod', 'changefreq', 'priority'
-
-  def __init__(self):
-    self.loc        = None                  # URL -- in Narrow characters
-    self.lastmod    = None                  # ISO8601 timestamp of last modify
-    self.changefreq = None                  # Text term for update frequency
-    self.priority   = None                  # Float between 0 and 1 (inc)
-  #end def __init__
-
-  def __cmp__(self, other):
-    if self.loc < other.loc:
-      return -1
-    if self.loc > other.loc:
-      return 1
-    return 0
-  #end def __cmp__
-
-  def TrySetAttribute(self, attribute, value):
-    """ Attempt to set the attribute to the value, with a pretty try
-    block around it.  """
-    if attribute == 'loc':
-      self.loc = self.Canonicalize(value)
-    else:
-      try:
-        setattr(self, attribute, value)
-      except AttributeError:
-        output.Warn('Unknown URL attribute: %s' % attribute)
-  #end def TrySetAttribute
-
-  def IsAbsolute(loc):
-    """ Decide if the URL is absolute or not """
-    if not loc:
-      return False
-    narrow = encoder.NarrowText(loc, None)
-    (scheme, netloc, path, query, frag) = urlparse.urlsplit(narrow)
-    if (not scheme) or (not netloc):
-      return False
-    return True
-  #end def IsAbsolute
-  IsAbsolute = staticmethod(IsAbsolute)
-
-  def Canonicalize(loc):
-    """ Do encoding and canonicalization on a URL string """
-    if not loc:
-      return loc
-    
-    # Let the encoder try to narrow it
-    narrow = encoder.NarrowText(loc, None)
-
-    # Escape components individually
-    (scheme, netloc, path, query, frag) = urlparse.urlsplit(narrow)
-    unr    = '-._~'
-    sub    = '!$&\'()*+,;='
-    netloc = urllib.quote(netloc, unr + sub + '%:@/[]')
-    path   = urllib.quote(path,   unr + sub + '%:@/')
-    query  = urllib.quote(query,  unr + sub + '%:@/?')
-    frag   = urllib.quote(frag,   unr + sub + '%:@/?')
-
-    # Try built-in IDNA encoding on the netloc
-    try:
-      (ignore, widenetloc, ignore, ignore, ignore) = urlparse.urlsplit(loc)
-      for c in widenetloc:
-        if c >= unichr(128):
-          netloc = widenetloc.encode(ENC_IDNA)
-          netloc = urllib.quote(netloc, unr + sub + '%:@/[]')
-          break
-    except UnicodeError:
-      # urlsplit must have failed, based on implementation differences in the
-      # library.  There is not much we can do here, except ignore it.
-      pass
-    except LookupError:
-      output.Warn('An International Domain Name (IDN) is being used, but this '
-                  'version of Python does not have support for IDNA encoding. '
-                  ' (IDNA support was introduced in Python 2.3)  The encoding '
-                  'we have used instead is wrong and will probably not yield '
-                  'valid URLs.')
-    bad_netloc = False
-    if '%' in netloc:
-      bad_netloc = True
-
-    # Put it all back together
-    narrow = urlparse.urlunsplit((scheme, netloc, path, query, frag))
-
-    # I let '%' through.  Fix any that aren't pre-existing escapes.
-    HEXDIG = '0123456789abcdefABCDEF'
-    list   = narrow.split('%')
-    narrow = list[0]
-    del list[0]
-    for item in list:
-      if (len(item) >= 2) and (item[0] in HEXDIG) and (item[1] in HEXDIG):
-        narrow = narrow + '%' + item
-      else:
-        narrow = narrow + '%25' + item
-
-    # Issue a warning if this is a bad URL
-    if bad_netloc:
-      output.Warn('Invalid characters in the host or domain portion of a URL: '
-                  + narrow)
-
-    return narrow
-  #end def Canonicalize
-  Canonicalize = staticmethod(Canonicalize)
-
-  def VerifyDate(self, date, metatag):
-    """Verify the date format is valid"""
-    match = False
-    if date:
-      date = date.upper()
-      for pattern in DATE_PATTERNS:
-        match = pattern.match(date)
-        if match:
-          return True
-      if not match:
-        output.Warn('The value for %s does not appear to be in ISO8601 '
-		    'format on URL: %s' % (metatag, self.loc))
-        return False
-  #end of VerifyDate
-
-  def Validate(self, base_url, allow_fragment):
-    """ Verify the data in this URL is well-formed, and override if not. """
-    assert type(base_url) == types.StringType
-    
-    # Test (and normalize) the ref
-    if not self.loc:
-      output.Warn('Empty URL')
-      return False
-    if allow_fragment:
-      self.loc = urlparse.urljoin(base_url, self.loc)
-    if not self.loc.startswith(base_url):
-      output.Warn('Discarded URL for not starting with the base_url: %s' %
-                  self.loc)
-      self.loc = None
-      return False
-
-    # Test the lastmod
-    if self.lastmod:
-      if not self.VerifyDate(self.lastmod, "lastmod"):
-        self.lastmod = None
-
-    # Test the changefreq
-    if self.changefreq:
-      match = False
-      self.changefreq = self.changefreq.lower()
-      for pattern in CHANGEFREQ_PATTERNS:
-        if self.changefreq == pattern:
-          match = True
-          break
-      if not match:
-        output.Warn('Changefreq "%s" is not a valid change frequency on URL '
-                    ': %s' % (self.changefreq, self.loc))
-        self.changefreq = None
-
-    # Test the priority
-    if self.priority:
-      priority = -1.0
-      try:
-        priority = float(self.priority)
-      except ValueError:
-        pass
-      if (priority < 0.0) or (priority > 1.0):
-        output.Warn('Priority "%s" is not a number between 0 and 1 inclusive '
-                    'on URL: %s' % (self.priority, self.loc))
-        self.priority = None
-
-    return True
-  #end def Validate
-
-  def MakeHash(self):
-    """ Provides a uniform way of hashing URLs """
-    if not self.loc:
-      return None
-    if self.loc.endswith('/'):
-      return md5.new(self.loc[:-1]).digest()
-    return md5.new(self.loc).digest()
-  #end def MakeHash
-
-  def Log(self, prefix='URL', level=3):
-    """ Dump the contents, empty or not, to the log. """
-    out = prefix + ':'
-    
-    for attribute in self.__slots__:
-      value = getattr(self, attribute)
-      if not value:
-        value = ''
-      out = out + ('  %s=[%s]' % (attribute, value))
-
-    output.Log('%s' % encoder.NarrowText(out, None), level)
-  #end def Log
-
-  def WriteXML(self, file):
-    """ Dump non-empty contents to the output file, in XML format. """
-    if not self.loc:
-      return
-    out = SITEURL_XML_PREFIX
-
-    for attribute in self.__slots__:
-      value = getattr(self, attribute)
-      if value:
-        if type(value) == types.UnicodeType:
-          value = encoder.NarrowText(value, None)
-        elif type(value) != types.StringType:
-          value = str(value)
-        value = xml.sax.saxutils.escape(value)
-        out = out + ('  <%s>%s</%s>\n' % (attribute, value, attribute))
-    
-    out = out + SITEURL_XML_SUFFIX
-    file.write(out)
-  #end def WriteXML
-#end class URL
-
-class NewsURL(URL):
-  """ NewsURL is a subclass of URL with News-Sitemap specific properties. """
-  __slots__ = 'loc', 'lastmod', 'changefreq', 'priority', 'publication_date', \
-	      'keywords', 'stock_tickers'
-
-  def __init__(self):
-    URL.__init__(self)
-    self.publication_date	= None	# ISO8601 timestamp of publication date
-    self.keywords 		= None  # Text keywords
-    self.stock_tickers   	= None  # Text stock
-  #end def __init__
-
-  def Validate(self, base_url, allow_fragment):
-    """ Verify the data in this News URL is well-formed, and override if not. """
-    assert type(base_url) == types.StringType
-
-    if not URL.Validate(self, base_url, allow_fragment):
-      return False
- 
-    if not URL.VerifyDate(self, self.publication_date, "publication_date"):
-      self.publication_date = None
- 
-    return True
-  #end def Validate
-
-  def WriteXML(self, file):
-    """ Dump non-empty contents to the output file, in XML format. """
-    if not self.loc:
-      return
-    out = SITEURL_XML_PREFIX
- 
-    # printed_news_tag indicates if news-specific metatags are present
-    printed_news_tag = False
-    for attribute in self.__slots__:
-      value = getattr(self, attribute)
-      if value:
-        if type(value) == types.UnicodeType:
-          value = encoder.NarrowText(value, None)
-        elif type(value) != types.StringType:
-          value = str(value)
-          value = xml.sax.saxutils.escape(value)
-        if attribute in NEWS_SPECIFIC_TAGS:
-          if not printed_news_tag:
-	    printed_news_tag = True
-	    out = out + NEWS_TAG_XML_PREFIX
-	  out = out + ('    <news:%s>%s</news:%s>\n' % (attribute, value, attribute))
-        else:
-	  out = out + ('  <%s>%s</%s>\n' % (attribute, value, attribute))
- 
-    if printed_news_tag:
-      out = out + NEWS_TAG_XML_SUFFIX
-    out = out + SITEURL_XML_SUFFIX
-    file.write(out)
-  #end def WriteXML
-#end class NewsURL
-
-
-class Filter:
-  """
-  A filter on the stream of URLs we find.  A filter is, in essence,
-  a wildcard applied to the stream.  You can think of this as an
-  operator that returns a tri-state when given a URL:
-
-    True  -- this URL is to be included in the sitemap
-    None  -- this URL is undecided
-    False -- this URL is to be dropped from the sitemap
-  """
-
-  def __init__(self, attributes):
-    self._wildcard  = None                  # Pattern for wildcard match
-    self._regexp    = None                  # Pattern for regexp match
-    self._pass      = False                 # "Drop" filter vs. "Pass" filter
-
-    if not ValidateAttributes('FILTER', attributes,
-                              ('pattern', 'type', 'action')):
-      return
-
-    # Check error count on the way in
-    num_errors = output.num_errors
-
-    # Fetch the attributes
-    pattern = attributes.get('pattern')
-    type    = attributes.get('type', 'wildcard')
-    action  = attributes.get('action', 'drop')
-    if type:
-      type = type.lower()
-    if action:
-      action = action.lower()
-
-    # Verify the attributes
-    if not pattern:
-      output.Error('On a filter you must specify a "pattern" to match')
-    elif (not type) or ((type != 'wildcard') and (type != 'regexp')):
-      output.Error('On a filter you must specify either \'type="wildcard"\' '
-                   'or \'type="regexp"\'')
-    elif (action != 'pass') and (action != 'drop'):
-      output.Error('If you specify a filter action, it must be either '
-                   '\'action="pass"\' or \'action="drop"\'')
-
-    # Set the rule
-    if action == 'drop':
-      self._pass = False
-    elif action == 'pass':
-      self._pass = True
-
-    if type == 'wildcard':
-      self._wildcard = pattern
-    elif type == 'regexp':
-      try:
-        self._regexp = re.compile(pattern)
-      except re.error:
-        output.Error('Bad regular expression: %s' %  pattern)
-
-    # Log the final results iff we didn't add any errors
-    if num_errors == output.num_errors:
-      output.Log('Filter: %s any URL that matches %s "%s"' %
-                 (action, type, pattern), 2)
-  #end def __init__
-
-  def Apply(self, url):
-    """ Process the URL, as above. """
-    if (not url) or (not url.loc):
-      return None
-    
-    if self._wildcard:
-      if fnmatch.fnmatchcase(url.loc, self._wildcard):
-        return self._pass
-      return None
-
-    if self._regexp:
-      if self._regexp.search(url.loc):
-        return self._pass
-      return None
-
-    assert False # unreachable
-  #end def Apply
-#end class Filter
-
-
-class InputURL:
-  """
-  Each Input class knows how to yield a set of URLs from a data source.
-
-  This one handles a single URL, manually specified in the config file.
-  """
-
-  def __init__(self, attributes):
-    self._url = None                        # The lonely URL
-
-    if not ValidateAttributes('URL', attributes,
-                                ('href', 'lastmod', 'changefreq', 'priority')):
-      return
-    
-    url = URL()
-    for attr in attributes.keys():
-      if attr == 'href':
-        url.TrySetAttribute('loc', attributes[attr])
-      else:
-        url.TrySetAttribute(attr, attributes[attr])
-
-    if not url.loc:
-      output.Error('Url entries must have an href attribute.')
-      return
-    
-    self._url = url
-    output.Log('Input: From URL "%s"' % self._url.loc, 2)
-  #end def __init__
-
-  def ProduceURLs(self, consumer):
-    """ Produces URLs from our data source, hands them in to the consumer. """
-    if self._url:
-      consumer(self._url, True)
-  #end def ProduceURLs
-#end class InputURL
-
-
-class InputURLList:
-  """
-  Each Input class knows how to yield a set of URLs from a data source.
-
-  This one handles a text file with a list of URLs
-  """
-
-  def __init__(self, attributes):
-    self._path      = None                  # The file path
-    self._encoding  = None                  # Encoding of that file
-
-    if not ValidateAttributes('URLLIST', attributes, ('path', 'encoding')):
-      return
-    
-    self._path      = attributes.get('path')
-    self._encoding  = attributes.get('encoding', ENC_UTF8)
-    if self._path:
-      self._path    = encoder.MaybeNarrowPath(self._path)
-      if os.path.isfile(self._path):
-        output.Log('Input: From URLLIST "%s"' % self._path, 2)
-      else:
-        output.Error('Can not locate file: %s' % self._path)
-        self._path = None
-    else:
-      output.Error('Urllist entries must have a "path" attribute.')
-  #end def __init__
-
-  def ProduceURLs(self, consumer):
-    """ Produces URLs from our data source, hands them in to the consumer. """
-
-    # Open the file
-    (frame, file) = OpenFileForRead(self._path, 'URLLIST')
-    if not file:
-      return
-
-    # Iterate lines
-    linenum = 0
-    for line in file.readlines():
-      linenum = linenum + 1
-
-      # Strip comments and empty lines
-      if self._encoding:
-        line = encoder.WidenText(line, self._encoding)
-      line = line.strip()
-      if (not line) or line[0] == '#':
-        continue
-      
-      # Split the line on space
-      url = URL()
-      cols = line.split(' ')
-      for i in range(0,len(cols)):
-        cols[i] = cols[i].strip()
-      url.TrySetAttribute('loc', cols[0])
-
-      # Extract attributes from the other columns
-      for i in range(1,len(cols)):
-        if cols[i]:
-          try:
-            (attr_name, attr_val) = cols[i].split('=', 1)
-            url.TrySetAttribute(attr_name, attr_val)
-          except ValueError:
-            output.Warn('Line %d: Unable to parse attribute: %s' %
-                        (linenum, cols[i]))
-
-      # Pass it on
-      consumer(url, False)
-
-    file.close()
-    if frame:
-      frame.close()
-  #end def ProduceURLs
-#end class InputURLList
-
-
-class InputNewsURLList:
-  """
-  Each Input class knows how to yield a set of URLs from a data source.
-
-  This one handles a text file with a list of News URLs and their metadata
-  """
-
-  def __init__(self, attributes):
-    self._path      = None                  # The file path
-    self._encoding  = None                  # Encoding of that file
-    self._tag_order = []                    # Order of URL metadata
- 
-    if not ValidateAttributes('URLLIST', attributes, ('path', 'encoding', \
-		              'tag_order')):
-      return
- 
-    self._path      = attributes.get('path')
-    self._encoding  = attributes.get('encoding', ENC_UTF8)
-    self._tag_order = attributes.get('tag_order')
- 
-    if self._path:
-      self._path    = encoder.MaybeNarrowPath(self._path)
-      if os.path.isfile(self._path):
-        output.Log('Input: From URLLIST "%s"' % self._path, 2)
-      else:
-        output.Error('Can not locate file: %s' % self._path)
-        self._path = None
-    else:
-      output.Error('Urllist entries must have a "path" attribute.')
-
-    # parse tag_order into an array
-    # tag_order_ascii created for more readable logging
-    tag_order_ascii = []
-    if self._tag_order:
-      self._tag_order = self._tag_order.split(",")
-      for i in range(0, len(self._tag_order)):
-        element = self._tag_order[i].strip().lower()
-	self._tag_order[i]= element
-	tag_order_ascii.append(element.encode('ascii'))
-      output.Log('Input: From URLLIST tag order is "%s"' % tag_order_ascii, 0)
-    else:
-      output.Error('News Urllist configuration file must contain tag_order '
-		   'to define Sitemap metatags.')
-
-    # verify all tag_order inputs are valid
-    tag_order_dict = {}
-    for tag in self._tag_order:
-      tag_order_dict[tag] = ""
-    if not ValidateAttributes('URLLIST', tag_order_dict, \
-		    NEWS_SITEMAP_TAGS): 
-      return
-
-    # loc tag must be present
-    loc_tag = False
-    for tag in self._tag_order:
-      if tag == 'loc':
-        loc_tag = True
-        break
-    if not loc_tag:
-      output.Error('News Urllist tag_order in configuration file '
-		   'does not contain "loc" value: %s' % tag_order_ascii)
-  #end def __init__
-
-  def ProduceURLs(self, consumer):
-    """ Produces URLs from our data source, hands them in to the consumer. """
-
-    # Open the file
-    (frame, file) = OpenFileForRead(self._path, 'URLLIST')
-    if not file:
-      return
-
-    # Iterate lines
-    linenum = 0
-    for line in file.readlines():
-      linenum = linenum + 1
-
-      # Strip comments and empty lines
-      if self._encoding:
-        line = encoder.WidenText(line, self._encoding)
-      line = line.strip()
-      if (not line) or line[0] == '#':
-        continue
-      
-      # Split the line on tabs
-      url = NewsURL()
-      cols = line.split('\t')
-      for i in range(0,len(cols)):
-        cols[i] = cols[i].strip()
-
-      for i in range(0,len(cols)):
-        if cols[i]:
-          attr_value = cols[i]
-	  if i < len(self._tag_order):
-            attr_name = self._tag_order[i]
-            try:
-              url.TrySetAttribute(attr_name, attr_value)
-            except ValueError:
-              output.Warn('Line %d: Unable to parse attribute: %s' %
-                        (linenum, cols[i]))
-
-      # Pass it on
-      consumer(url, False)
-
-    file.close()
-    if frame:
-      frame.close()
-  #end def ProduceURLs
-#end class InputNewsURLList
-
-
-class InputDirectory:
-  """
-  Each Input class knows how to yield a set of URLs from a data source.
-
-  This one handles a directory that acts as base for walking the filesystem.
-  """
-
-  def __init__(self, attributes, base_url):
-    self._path         = None               # The directory
-    self._url          = None               # The URL equivalent
-    self._default_file = None
-    self._remove_empty_directories = False 
-
-    if not ValidateAttributes('DIRECTORY', attributes, ('path', 'url',
-                              'default_file', 'remove_empty_directories')):
-      return
-
-    # Prep the path -- it MUST end in a sep
-    path = attributes.get('path')
-    if not path:
-      output.Error('Directory entries must have both "path" and "url" '
-                  'attributes')
-      return
-    path = encoder.MaybeNarrowPath(path)
-    if not path.endswith(os.sep):
-      path = path + os.sep
-    if not os.path.isdir(path):
-      output.Error('Can not locate directory: %s' % path)
-      return
-    
-    # Prep the URL -- it MUST end in a sep
-    url = attributes.get('url')
-    if not url:
-      output.Error('Directory entries must have both "path" and "url" '
-                  'attributes')
-      return
-    url = URL.Canonicalize(url)
-    if not url.endswith('/'):
-      url = url + '/'
-    if not url.startswith(base_url):
-      url = urlparse.urljoin(base_url, url)
-      if not url.startswith(base_url):
-        output.Error('The directory URL "%s" is not relative to the '
-                    'base_url: %s' % (url, base_url))
-        return
-
-    # Prep the default file -- it MUST be just a filename
-    file = attributes.get('default_file')
-    if file:
-      file = encoder.MaybeNarrowPath(file)
-      if os.sep in file:
-        output.Error('The default_file "%s" can not include path information.'
-                     % file)
-        file = None
-
-    # Prep the remove_empty_directories -- default is false
-    remove_empty_directories = attributes.get('remove_empty_directories')
-    if remove_empty_directories:
-      if (remove_empty_directories == '1') or \
-         (remove_empty_directories.lower() == 'true'):
-        remove_empty_directories = True
-      elif (remove_empty_directories == '0') or \
-	   (remove_empty_directories.lower() == 'false'):
-        remove_empty_directories = False
-      # otherwise the user set a non-default value
-      else:
-        output.Error('Configuration file remove_empty_directories '
-		     'value is not recognized.  Value must be true or false.')
-        return
-    else:
-      remove_empty_directories = False
-
-    self._path         = path
-    self._url          = url
-    self._default_file = file
-    self._remove_empty_directories = remove_empty_directories
-
-    if file:
-      output.Log('Input: From DIRECTORY "%s" (%s) with default file "%s"'
-                 % (path, url, file), 2)
-    else:
-      output.Log('Input: From DIRECTORY "%s" (%s) with no default file'
-                 % (path, url), 2)
-  #end def __init__
-  
-     
-  def ProduceURLs(self, consumer):
-    """ Produces URLs from our data source, hands them in to the consumer. """
-    if not self._path:
-      return
-
-    root_path = self._path
-    root_URL  = self._url
-    root_file = self._default_file
-    remove_empty_directories = self._remove_empty_directories
-
-    def HasReadPermissions(path):
-      """ Verifies a given path has read permissions. """  
-      stat_info = os.stat(path)
-      mode = stat_info[stat.ST_MODE]
-      if mode & stat.S_IREAD:
-        return True
-      else:
-        return None
-
-    def PerFile(dirpath, name):
-      """
-      Called once per file.
-      Note that 'name' will occasionally be None -- for a directory itself
-      """
-      # Pull a timestamp
-      url           = URL()
-      isdir         = False
-      try:
-        if name:
-          path      = os.path.join(dirpath, name)
-        else:
-          path      = dirpath
-        isdir       = os.path.isdir(path)
-        time        = None
-        if isdir and root_file:
-          file      = os.path.join(path, root_file)
-          try:
-            time    = os.stat(file)[stat.ST_MTIME];
-          except OSError:
-            pass
-        if not time:
-          time      = os.stat(path)[stat.ST_MTIME];
-        url.lastmod = TimestampISO8601(time)
-      except OSError:
-        pass
-      except ValueError:
-        pass
-
-      # Build a URL
-      middle        = dirpath[len(root_path):]
-      if os.sep != '/':
-        middle = middle.replace(os.sep, '/')
-      if middle:
-        middle      = middle + '/'
-      if name:
-        middle      = middle + name
-        if isdir:
-          middle    = middle + '/'
-      url.TrySetAttribute('loc', root_URL + encoder.WidenText(middle, None))
-
-      # Suppress default files.  (All the way down here so we can log it.)
-      if name and (root_file == name):
-        url.Log(prefix='IGNORED (default file)', level=2)
-        return
-  
-      # Suppress directories when remove_empty_directories="true"
-      try:
-        if isdir:
-	  if HasReadPermissions(path):
-            if remove_empty_directories == 'true' and \
-	       len(os.listdir(path)) == 0:
-              output.Log('IGNORED empty directory %s' % str(path), level=1)
-              return
-          elif path == self._path:
-            output.Error('IGNORED configuration file directory input %s due '
-			 'to file permissions' % self._path)
-          else:
-            output.Log('IGNORED files within directory %s due to file '
-		       'permissions' % str(path), level=0)
-      except OSError:
-        pass
-      except ValueError:
-        pass
- 
-      consumer(url, False)
-    #end def PerFile
-
-    def PerDirectory(ignore, dirpath, namelist):
-      """
-      Called once per directory with a list of all the contained files/dirs.
-      """
-      ignore = ignore  # Avoid warnings of an unused parameter
-
-      if not dirpath.startswith(root_path):
-        output.Warn('Unable to decide what the root path is for directory: '
-                    '%s' % dirpath)
-        return
-
-      for name in namelist:
-        PerFile(dirpath, name)
-    #end def PerDirectory
-
-    output.Log('Walking DIRECTORY "%s"' % self._path, 1)
-    PerFile(self._path, None)
-    os.path.walk(self._path, PerDirectory, None)
-  #end def ProduceURLs
-#end class InputDirectory
-
-
-class InputAccessLog:
-  """
-  Each Input class knows how to yield a set of URLs from a data source.
-
-  This one handles access logs.  It's non-trivial in that we want to
-  auto-detect log files in the Common Logfile Format (as used by Apache,
-  for instance) and the Extended Log File Format (as used by IIS, for
-  instance).
-  """
-
-  def __init__(self, attributes):
-    self._path         = None               # The file path
-    self._encoding     = None               # Encoding of that file
-    self._is_elf       = False              # Extended Log File Format?
-    self._is_clf       = False              # Common Logfile Format?
-    self._elf_status   = -1                 # ELF field: '200'
-    self._elf_method   = -1                 # ELF field: 'HEAD'
-    self._elf_uri      = -1                 # ELF field: '/foo?bar=1'
-    self._elf_urifrag1 = -1                 # ELF field: '/foo'
-    self._elf_urifrag2 = -1                 # ELF field: 'bar=1'
-
-    if not ValidateAttributes('ACCESSLOG', attributes, ('path', 'encoding')):
-      return
-
-    self._path      = attributes.get('path')
-    self._encoding  = attributes.get('encoding', ENC_UTF8)
-    if self._path:
-      self._path    = encoder.MaybeNarrowPath(self._path)
-      if os.path.isfile(self._path):
-        output.Log('Input: From ACCESSLOG "%s"' % self._path, 2)
-      else:
-        output.Error('Can not locate file: %s' % self._path)
-        self._path = None
-    else:
-      output.Error('Accesslog entries must have a "path" attribute.')
-  #end def __init__
-
-  def RecognizeELFLine(self, line):
-    """ Recognize the Fields directive that heads an ELF file """
-    if not line.startswith('#Fields:'):
-      return False
-    fields = line.split(' ')
-    del fields[0]
-    for i in range(0, len(fields)):
-      field = fields[i].strip()
-      if field == 'sc-status':
-        self._elf_status   = i
-      elif field == 'cs-method':
-        self._elf_method   = i
-      elif field == 'cs-uri':
-        self._elf_uri      = i
-      elif field == 'cs-uri-stem':
-        self._elf_urifrag1 = i
-      elif field == 'cs-uri-query':
-        self._elf_urifrag2 = i
-    output.Log('Recognized an Extended Log File Format file.', 2)
-    return True
-  #end def RecognizeELFLine
-
-  def GetELFLine(self, line):
-    """ Fetch the requested URL from an ELF line """
-    fields = line.split(' ')
-    count  = len(fields)
-
-    # Verify status was Ok
-    if self._elf_status >= 0:
-      if self._elf_status >= count:
-        return None
-      if not fields[self._elf_status].strip() == '200':
-        return None
-
-    # Verify method was HEAD or GET
-    if self._elf_method >= 0:
-      if self._elf_method >= count:
-        return None
-      if not fields[self._elf_method].strip() in ('HEAD', 'GET'):
-        return None
-
-    # Pull the full URL if we can
-    if self._elf_uri >= 0:
-      if self._elf_uri >= count:
-        return None
-      url = fields[self._elf_uri].strip()
-      if url != '-':
-        return url
-
-    # Put together a fragmentary URL
-    if self._elf_urifrag1 >= 0:
-      if self._elf_urifrag1 >= count or self._elf_urifrag2 >= count:
-        return None
-      urlfrag1 = fields[self._elf_urifrag1].strip()
-      urlfrag2 = None
-      if self._elf_urifrag2 >= 0:
-        urlfrag2 = fields[self._elf_urifrag2]
-      if urlfrag1 and (urlfrag1 != '-'):
-        if urlfrag2 and (urlfrag2 != '-'):
-          urlfrag1 = urlfrag1 + '?' + urlfrag2
-        return urlfrag1
-
-    return None
-  #end def GetELFLine
-
-  def RecognizeCLFLine(self, line):
-    """ Try to tokenize a logfile line according to CLF pattern and see if
-    it works. """
-    match = ACCESSLOG_CLF_PATTERN.match(line)
-    recognize = match and (match.group(1) in ('HEAD', 'GET'))
-    if recognize:
-      output.Log('Recognized a Common Logfile Format file.', 2)
-    return recognize
-  #end def RecognizeCLFLine
-
-  def GetCLFLine(self, line):
-    """ Fetch the requested URL from a CLF line """
-    match = ACCESSLOG_CLF_PATTERN.match(line)
-    if match:
-      request = match.group(1)
-      if request in ('HEAD', 'GET'):
-        return match.group(2)
-    return None
-  #end def GetCLFLine
-
-  def ProduceURLs(self, consumer):
-    """ Produces URLs from our data source, hands them in to the consumer. """
-
-    # Open the file
-    (frame, file) = OpenFileForRead(self._path, 'ACCESSLOG')
-    if not file:
-      return
-
-    # Iterate lines
-    for line in file.readlines():
-      if self._encoding:
-        line = encoder.WidenText(line, self._encoding)
-      line = line.strip()
-
-      # If we don't know the format yet, try them both
-      if (not self._is_clf) and (not self._is_elf):
-        self._is_elf = self.RecognizeELFLine(line)
-        self._is_clf = self.RecognizeCLFLine(line)
-
-      # Digest the line
-      match = None
-      if self._is_elf:
-        match = self.GetELFLine(line)
-      elif self._is_clf:
-        match = self.GetCLFLine(line)
-      if not match:
-        continue
-
-      # Pass it on
-      url = URL()
-      url.TrySetAttribute('loc', match)
-      consumer(url, True)
-
-    file.close()
-    if frame:
-      frame.close()
-  #end def ProduceURLs
-#end class InputAccessLog
-
-
-class FilePathGenerator:
-  """
-  This class generates filenames in a series, upon request.
-  You can request any iteration number at any time, you don't
-  have to go in order.
-
-  Example of iterations for '/path/foo.xml.gz':
-    0           --> /path/foo.xml.gz
-    1           --> /path/foo1.xml.gz
-    2           --> /path/foo2.xml.gz
-    _index.xml  --> /path/foo_index.xml
-  """
-
-  def __init__(self):
-    self.is_gzip     = False                 # Is this a  GZIP file?
-
-    self._path       = None                  # '/path/'
-    self._prefix     = None                  # 'foo'
-    self._suffix     = None                  # '.xml.gz'
-  #end def __init__
-
-  def Preload(self, path):
-    """ Splits up a path into forms ready for recombination. """
-    path = encoder.MaybeNarrowPath(path)
-
-    # Get down to a base name
-    path = os.path.normpath(path)
-    base = os.path.basename(path).lower()
-    if not base:
-      output.Error('Couldn\'t parse the file path: %s' % path)
-      return False
-    lenbase = len(base)
-
-    # Recognize extension
-    lensuffix = 0
-    compare_suffix = ['.xml', '.xml.gz', '.gz']
-    for suffix in compare_suffix:
-      if base.endswith(suffix):
-        lensuffix = len(suffix)
-        break
-    if not lensuffix:
-      output.Error('The path "%s" doesn\'t end in a supported file '
-                   'extension.' % path)
-      return False
-    self.is_gzip = suffix.endswith('.gz')
-
-    # Split the original path
-    lenpath = len(path)
-    self._path   = path[:lenpath-lenbase]
-    self._prefix = path[lenpath-lenbase:lenpath-lensuffix]
-    self._suffix = path[lenpath-lensuffix:]
-
-    return True
-  #end def Preload
-
-  def GeneratePath(self, instance):
-    """ Generates the iterations, as described above. """
-    prefix = self._path + self._prefix
-    if type(instance) == types.IntType:
-      if instance:
-        return '%s%d%s' % (prefix, instance, self._suffix)
-      return prefix + self._suffix
-    return prefix + instance
-  #end def GeneratePath
-
-  def GenerateURL(self, instance, root_url):
-    """ Generates iterations, but as a URL instead of a path. """
-    prefix = root_url + self._prefix
-    retval = None
-    if type(instance) == types.IntType:
-      if instance:
-        retval = '%s%d%s' % (prefix, instance, self._suffix)
-      else:
-        retval = prefix + self._suffix
-    else:
-      retval = prefix + instance
-    return URL.Canonicalize(retval)
-  #end def GenerateURL
-
-  def GenerateWildURL(self, root_url):
-    """ Generates a wildcard that should match all our iterations """
-    prefix = URL.Canonicalize(root_url + self._prefix)
-    temp   = URL.Canonicalize(prefix + self._suffix)
-    suffix = temp[len(prefix):]
-    return prefix + '*' + suffix
-  #end def GenerateURL
-#end class FilePathGenerator
-
-
-class PerURLStatistics:
-  """ Keep track of some simple per-URL statistics, like file extension. """
-
-  def __init__(self):
-    self._extensions  = {}                  # Count of extension instances
-  #end def __init__
-
-  def Consume(self, url):
-    """ Log some stats for the URL.  At the moment, that means extension. """
-    if url and url.loc:
-      (scheme, netloc, path, query, frag) = urlparse.urlsplit(url.loc)
-      if not path:
-        return
-
-      # Recognize directories
-      if path.endswith('/'):
-        if self._extensions.has_key('/'):
-          self._extensions['/'] = self._extensions['/'] + 1
-        else:
-          self._extensions['/'] = 1
-        return
-
-      # Strip to a filename
-      i = path.rfind('/')
-      if i >= 0:
-        assert i < len(path)
-        path = path[i:]
-
-      # Find extension
-      i = path.rfind('.')
-      if i > 0:
-        assert i < len(path)
-        ext = path[i:].lower()
-        if self._extensions.has_key(ext):
-          self._extensions[ext] = self._extensions[ext] + 1
-        else:
-          self._extensions[ext] = 1
-      else:
-        if self._extensions.has_key('(no extension)'):
-          self._extensions['(no extension)'] = self._extensions[
-            '(no extension)'] + 1
-        else:
-          self._extensions['(no extension)'] = 1
-  #end def Consume
-
-  def Log(self):
-    """ Dump out stats to the output. """
-    if len(self._extensions):
-      output.Log('Count of file extensions on URLs:', 1)
-      set = self._extensions.keys()
-      set.sort()
-      for ext in set:
-        output.Log(' %7d  %s' % (self._extensions[ext], ext), 1)
-  #end def Log
-
-class Sitemap(xml.sax.handler.ContentHandler):
-  """
-  This is the big workhorse class that processes your inputs and spits
-  out sitemap files.  It is built as a SAX handler for set up purposes.
-  That is, it processes an XML stream to bring itself up.
-  """
-
-  def __init__(self, suppress_notify):
-    xml.sax.handler.ContentHandler.__init__(self)
-    self._filters      = []                  # Filter objects
-    self._inputs       = []                  # Input objects
-    self._urls         = {}                  # Maps URLs to count of dups
-    self._set          = []                  # Current set of URLs
-    self._filegen      = None                # Path generator for output files
-    self._wildurl1     = None                # Sitemap URLs to filter out
-    self._wildurl2     = None                # Sitemap URLs to filter out
-    self._sitemaps     = 0                   # Number of output files
-    # We init _dup_max to 2 so the default priority is 0.5 instead of 1.0
-    self._dup_max      = 2                   # Max number of duplicate URLs
-    self._stat         = PerURLStatistics()  # Some simple stats
-    self._in_site      = False               # SAX: are we in a Site node?
-    self._in_Site_ever = False               # SAX: were we ever in a Site?
-
-    self._default_enc  = None                # Best encoding to try on URLs
-    self._base_url     = None                # Prefix to all valid URLs
-    self._store_into   = None                # Output filepath
-    self._sitemap_type = None		     # Sitemap type (web, mobile or news)
-    self._suppress     = suppress_notify     # Suppress notify of servers
-  #end def __init__
-
-  def ValidateBasicConfig(self):
-    """ Verifies (and cleans up) the basic user-configurable options. """
-    all_good = True
-
-    if self._default_enc:
-      encoder.SetUserEncoding(self._default_enc)
-
-    # Canonicalize the base_url
-    if all_good and not self._base_url:
-      output.Error('A site needs a "base_url" attribute.')
-      all_good = False
-    if all_good and not URL.IsAbsolute(self._base_url):
-        output.Error('The "base_url" must be absolute, not relative: %s' %
-                     self._base_url)
-        all_good = False
-    if all_good:
-      self._base_url = URL.Canonicalize(self._base_url)
-      if not self._base_url.endswith('/'):
-        self._base_url = self._base_url + '/'
-      output.Log('BaseURL is set to: %s' % self._base_url, 2)
-
-    # Load store_into into a generator
-    if all_good:
-      if self._store_into:
-        self._filegen = FilePathGenerator()
-        if not self._filegen.Preload(self._store_into):
-          all_good = False
-      else:
-        output.Error('A site needs a "store_into" attribute.')
-        all_good = False
-
-    # Ask the generator for patterns on what its output will look like
-    if all_good:
-      self._wildurl1 = self._filegen.GenerateWildURL(self._base_url)
-      self._wildurl2 = self._filegen.GenerateURL(SITEINDEX_SUFFIX,
-                                                 self._base_url)
-
-    # Unify various forms of False
-    if all_good:
-      if self._suppress:
-        if (type(self._suppress) == types.StringType) or (type(self._suppress)
-                                 == types.UnicodeType):
-          if (self._suppress == '0') or (self._suppress.lower() == 'false'):
-            self._suppress = False
-
-    # Clean up the sitemap_type
-    if all_good:
-      match = False
-      # If sitemap_type is not specified, default to web sitemap
-      if not self._sitemap_type:
-        self._sitemap_type = 'web'
-      else:
-	self._sitemap_type = self._sitemap_type.lower()
-        for pattern in SITEMAP_TYPES:
-          if self._sitemap_type == pattern:
-            match = True
-            break
-        if not match:
-          output.Error('The "sitemap_type" value must be "web", "mobile" '
-		       'or "news": %s' % self._sitemap_type)
-          all_good = False
-      output.Log('The Sitemap type is %s Sitemap.' % \
-		        self._sitemap_type.upper(), 0)
-
-    # Done
-    if not all_good:
-      output.Log('See "example_config.xml" for more information.', 0)
-    return all_good
-  #end def ValidateBasicConfig
-
-  def Generate(self):
-    """ Run over all the Inputs and ask them to Produce """
-    # Run the inputs
-    for input in self._inputs:
-      input.ProduceURLs(self.ConsumeURL)
-
-    # Do last flushes
-    if len(self._set):
-      self.FlushSet()
-    if not self._sitemaps:
-      output.Warn('No URLs were recorded, writing an empty sitemap.')
-      self.FlushSet()
-
-    # Write an index as needed
-    if self._sitemaps > 1:
-      self.WriteIndex()
-
-    # Notify
-    self.NotifySearch()
-
-    # Dump stats
-    self._stat.Log()
-  #end def Generate
-
-  def ConsumeURL(self, url, allow_fragment):
-    """
-    All per-URL processing comes together here, regardless of Input.
-    Here we run filters, remove duplicates, spill to disk as needed, etc.
-    
-    """
-    if not url:
-      return
-
-    # Validate
-    if not url.Validate(self._base_url, allow_fragment):
-      return
-
-    # Run filters
-    accept = None
-    for filter in self._filters:
-      accept = filter.Apply(url)
-      if accept != None:
-        break
-    if not (accept or (accept == None)):
-      url.Log(prefix='FILTERED', level=2)
-      return
-
-    # Ignore our out output URLs
-    if fnmatch.fnmatchcase(url.loc, self._wildurl1) or fnmatch.fnmatchcase(
-      url.loc, self._wildurl2):
-      url.Log(prefix='IGNORED (output file)', level=2)
-      return
-
-    # Note the sighting
-    hash = url.MakeHash()
-    if self._urls.has_key(hash):
-      dup = self._urls[hash]
-      if dup > 0:
-        dup = dup + 1
-        self._urls[hash] = dup
-        if self._dup_max < dup:
-          self._dup_max = dup
-      url.Log(prefix='DUPLICATE')
-      return
-
-    # Acceptance -- add to set
-    self._urls[hash] = 1
-    self._set.append(url)
-    self._stat.Consume(url)
-    url.Log()
-
-    # Flush the set if needed
-    if len(self._set) >= MAXURLS_PER_SITEMAP:
-      self.FlushSet()
-  #end def ConsumeURL
-
-  def FlushSet(self):
-    """
-    Flush the current set of URLs to the output.  This is a little
-    slow because we like to sort them all and normalize the priorities
-    before dumping.
-    """
-    
-    # Determine what Sitemap header to use (News or General)
-    if self._sitemap_type == 'news':
-      sitemap_header = NEWS_SITEMAP_HEADER
-    else:
-      sitemap_header = GENERAL_SITEMAP_HEADER
-      
-    # Sort and normalize
-    output.Log('Sorting and normalizing collected URLs.', 1)
-    self._set.sort()
-    for url in self._set:
-      hash = url.MakeHash()
-      dup = self._urls[hash]
-      if dup > 0:
-        self._urls[hash] = -1
-        if not url.priority:
-          url.priority = '%.4f' % (float(dup) / float(self._dup_max))
-
-    # Get the filename we're going to write to
-    filename = self._filegen.GeneratePath(self._sitemaps)
-    if not filename:
-      output.Fatal('Unexpected: Couldn\'t generate output filename.')
-    self._sitemaps = self._sitemaps + 1
-    output.Log('Writing Sitemap file "%s" with %d URLs' %
-        (filename, len(self._set)), 1)
-
-    # Write to it
-    frame = None
-    file  = None
-
-    try:
-      if self._filegen.is_gzip:
-        basename = os.path.basename(filename);
-        frame = open(filename, 'wb')
-        file = gzip.GzipFile(fileobj=frame, filename=basename, mode='wt')
-      else:
-        file = open(filename, 'wt')
-
-      file.write(sitemap_header)
-      for url in self._set:
-        url.WriteXML(file)
-      file.write(SITEMAP_FOOTER)
-
-      file.close()
-      if frame:
-        frame.close()
-
-      frame = None
-      file  = None
-    except IOError:
-      output.Fatal('Couldn\'t write out to file: %s' % filename)
-    os.chmod(filename, 0644)
-
-    # Flush
-    self._set = []
-  #end def FlushSet
-
-  def WriteIndex(self):
-    """ Write the master index of all Sitemap files """
-    # Make a filename
-    filename = self._filegen.GeneratePath(SITEINDEX_SUFFIX)
-    if not filename:
-      output.Fatal('Unexpected: Couldn\'t generate output index filename.')
-    output.Log('Writing index file "%s" with %d Sitemaps' %
-        (filename, self._sitemaps), 1)
-
-   # Determine what Sitemap index header to use (News or General)
-    if self._sitemap_type == 'news':
-      sitemap_index_header = NEWS_SITEMAP_HEADER
-    else:
-      sitemap__index_header = GENERAL_SITEMAP_HEADER
- 
-    # Make a lastmod time
-    lastmod = TimestampISO8601(time.time())
-
-    # Write to it
-    try:
-      fd = open(filename, 'wt')
-      fd.write(sitemap_index_header)
-
-      for mapnumber in range(0,self._sitemaps):
-        # Write the entry
-        mapurl = self._filegen.GenerateURL(mapnumber, self._base_url)
-        mapattributes = { 'loc' : mapurl, 'lastmod' : lastmod }
-        fd.write(SITEINDEX_ENTRY % mapattributes)
-
-      fd.write(SITEINDEX_FOOTER)
-
-      fd.close()
-      fd = None
-    except IOError:
-      output.Fatal('Couldn\'t write out to file: %s' % filename)
-    os.chmod(filename, 0644)
-  #end def WriteIndex
-
-  def NotifySearch(self):
-    """ Send notification of the new Sitemap(s) to the search engines. """
-    if self._suppress:
-      output.Log('Search engine notification is suppressed.', 1)
-      return
-
-    output.Log('Notifying search engines.', 1)
-
-    # Override the urllib's opener class with one that doesn't ignore 404s
-    class ExceptionURLopener(urllib.FancyURLopener):
-      def http_error_default(self, url, fp, errcode, errmsg, headers):
-        output.Log('HTTP error %d: %s' % (errcode, errmsg), 2)
-        raise IOError
-      #end def http_error_default
-    #end class ExceptionURLOpener
-    old_opener = urllib._urlopener
-    urllib._urlopener = ExceptionURLopener()
-
-    # Build the URL we want to send in
-    if self._sitemaps > 1:
-      url = self._filegen.GenerateURL(SITEINDEX_SUFFIX, self._base_url)
-    else:
-      url = self._filegen.GenerateURL(0, self._base_url)
-
-    # Test if we can hit it ourselves
-    try:
-      u = urllib.urlopen(url)
-      u.close()
-    except IOError:
-      output.Error('When attempting to access our generated Sitemap at the '
-                   'following URL:\n    %s\n  we failed to read it.  Please '
-                   'verify the store_into path you specified in\n'
-                   '  your configuration file is web-accessable.  Consult '
-                   'the FAQ for more\n  information.' % url)
-      output.Warn('Proceeding to notify with an unverifyable URL.')
-
-    # Cycle through notifications
-    # To understand this, see the comment near the NOTIFICATION_SITES comment
-    for ping in NOTIFICATION_SITES:
-      query_map             = ping[3]
-      query_attr            = ping[5]
-      query_map[query_attr] = url
-      query = urllib.urlencode(query_map)
-      notify = urlparse.urlunsplit((ping[0], ping[1], ping[2], query, ping[4]))
-
-      # Send the notification
-      output.Log('Notifying: %s' % ping[1], 0)
-      output.Log('Notification URL: %s' % notify, 2)
-      try:
-        u = urllib.urlopen(notify)
-        u.read()
-        u.close()
-      except IOError:
-        output.Warn('Cannot contact: %s' % ping[1])
-
-    if old_opener:
-      urllib._urlopener = old_opener
-  #end def NotifySearch
-
-  def startElement(self, tag, attributes):
-    """ SAX processing, called per node in the config stream. """
-    if tag == 'site':
-      if self._in_site:
-        output.Error('Can not nest Site entries in the configuration.')
-      else:
-        self._in_site     = True
-
-        if not ValidateAttributes('SITE', attributes,
-          ('verbose', 'default_encoding', 'base_url', 'store_into',
-           'suppress_search_engine_notify', 'sitemap_type')):
-          return
-
-        verbose           = attributes.get('verbose', 0)
-        if verbose:
-          output.SetVerbose(verbose)
-
-        self._default_enc = attributes.get('default_encoding')
-        self._base_url    = attributes.get('base_url')
-        self._store_into  = attributes.get('store_into')
-	self._sitemap_type= attributes.get('sitemap_type')
-        if not self._suppress:
-          self._suppress  = attributes.get('suppress_search_engine_notify',
-                                            False)
-        self.ValidateBasicConfig()
-    elif tag == 'filter':
-      self._filters.append(Filter(attributes))
-
-    elif tag == 'url':
-     print type(attributes)
-     self._inputs.append(InputURL(attributes))
-
-    elif tag == 'urllist':
-      for attributeset in ExpandPathAttribute(attributes, 'path'):
-        if self._sitemap_type == 'news':
-          self._inputs.append(InputNewsURLList(attributeset))
-        else:
-	  self._inputs.append(InputURLList(attributeset))
-
-    elif tag == 'directory':
-      self._inputs.append(InputDirectory(attributes, self._base_url))
-
-    elif tag == 'accesslog':
-      for attributeset in ExpandPathAttribute(attributes, 'path'):
-        self._inputs.append(InputAccessLog(attributeset))
-    else:
-      output.Error('Unrecognized tag in the configuration: %s' % tag)
-  #end def startElement
-
-  def endElement(self, tag):
-    """ SAX processing, called per node in the config stream. """
-    if tag == 'site':
-      assert self._in_site
-      self._in_site      = False
-      self._in_site_ever = True
-  #end def endElement
-
-  def endDocument(self):
-    """ End of SAX, verify we can proceed. """
-    if not self._in_site_ever:
-      output.Error('The configuration must specify a "site" element.')
-    else:
-      if not self._inputs:
-        output.Warn('There were no inputs to generate a sitemap from.')
-  #end def endDocument
-#end class Sitemap
-
-
-def ValidateAttributes(tag, attributes, goodattributes):
-  """ Makes sure 'attributes' does not contain any attribute not
-      listed in 'goodattributes' """
-  all_good = True
-  for attr in attributes.keys():
-    if not attr in goodattributes:
-      output.Error('Unknown %s attribute: %s' % (tag, attr))
-      all_good = False
-  return all_good
-#end def ValidateAttributes
-
-def ExpandPathAttribute(src, attrib):
-  """ Given a dictionary of attributes, return a list of dictionaries
-      with all the same attributes except for the one named attrib.
-      That one, we treat as a file path and expand into all its possible
-      variations. """
-  # Do the path expansion.  On any error, just return the source dictionary.
-  path = src.get(attrib)
-  if not path:
-    return [src]
-  path = encoder.MaybeNarrowPath(path);
-  pathlist = glob.glob(path)
-  if not pathlist:
-    return [src]
-
-  # If this isn't actually a dictionary, make it one
-  if type(src) != types.DictionaryType:
-    tmp = {}
-    for key in src.keys():
-      tmp[key] = src[key]
-    src = tmp
-  # Create N new dictionaries
-  retval = []
-  for path in pathlist:
-    dst = src.copy()
-    dst[attrib] = path
-    retval.append(dst)
-
-  return retval
-#end def ExpandPathAttribute
-
-def OpenFileForRead(path, logtext):
-  """ Opens a text file, be it GZip or plain """
-
-  frame = None
-  file  = None
-
-  if not path:
-    return (frame, file)
-
-  try:
-    if path.endswith('.gz'):
-      frame = open(path, 'rb')
-      file = gzip.GzipFile(fileobj=frame, mode='rt')
-    else:
-      file = open(path, 'rt')
-
-    if logtext:
-      output.Log('Opened %s file: %s' % (logtext, path), 1)
-    else:
-      output.Log('Opened file: %s' % path, 1)
-  except IOError:
-    output.Error('Can not open file: %s' % path)
-
-  return (frame, file)
-#end def OpenFileForRead
-
-def TimestampISO8601(t):
-  """Seconds since epoch (1970-01-01) --> ISO 8601 time string."""
-  return time.strftime('%Y-%m-%dT%H:%M:%SZ', time.gmtime(t))
-#end def TimestampISO8601
-
-def CreateSitemapFromFile(configpath, suppress_notify):
-  """ Sets up a new Sitemap object from the specified configuration file.  """
-
-  # Remember error count on the way in
-  num_errors = output.num_errors
-
-  # Rev up SAX to parse the config
-  sitemap = Sitemap(suppress_notify)
-  try:
-    output.Log('Reading configuration file: %s' % configpath, 0)
-    xml.sax.parse(configpath, sitemap)
-  except IOError:
-    output.Error('Cannot read configuration file: %s' % configpath)
-  except xml.sax._exceptions.SAXParseException, e:
-    output.Error('XML error in the config file (line %d, column %d): %s' %
-                 (e._linenum, e._colnum, e.getMessage()))
-  except xml.sax._exceptions.SAXReaderNotAvailable:
-    output.Error('Some installs of Python 2.2 did not include complete support'
-                 ' for XML.\n  Please try upgrading your version of Python'
-                 ' and re-running the script.')
-
-  # If we added any errors, return no sitemap
-  if num_errors == output.num_errors:
-    return sitemap
-  return None
-#end def CreateSitemapFromFile
-
-def ProcessCommandFlags(args):
-  """
-  Parse command line flags per specified usage, pick off key, value pairs
-  All flags of type "--key=value" will be processed as __flags[key] = value,
-                    "--option" will be processed as __flags[option] = option
-  """
-
-  flags   = {}
-  rkeyval = '--(?P<key>\S*)[=](?P<value>\S*)' # --key=val
-  roption = '--(?P<option>\S*)'               # --key
-  r = '(' + rkeyval + ')|(' + roption + ')'
-  rc = re.compile(r)
-  for a in args:
-    try:
-      rcg = rc.search(a).groupdict()
-      if rcg.has_key('key'):
-        flags[rcg['key']] = rcg['value']
-      if rcg.has_key('option'):
-        flags[rcg['option']] = rcg['option']
-    except AttributeError:
-      return None
-  return flags
-#end def ProcessCommandFlags
-
-
-#
-# __main__
-#
-
-if __name__ == '__main__':
-  flags = ProcessCommandFlags(sys.argv[1:])
-  if not flags or not flags.has_key('config') or flags.has_key('help'):
-    output.Log(__usage__, 0)
-  else:
-    suppress_notify = flags.has_key('testing')
-    sitemap = CreateSitemapFromFile(flags['config'], suppress_notify)
-    if not sitemap:
-      output.Log('Configuration file errors -- exiting.', 0)
-    else:
-      sitemap.Generate()
-      output.Log('Number of errors: %d' % output.num_errors, 1)
-      output.Log('Number of warnings: %d' % output.num_warns, 1)
diff -Nru igraph-0.6.5~quantal1/doc/sitemap_gen_config.xml igraph-0.6.5/doc/sitemap_gen_config.xml
--- igraph-0.6.5~quantal1/doc/sitemap_gen_config.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/sitemap_gen_config.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<site
-    base_url="http://igraph.sourceforge.net/"
-    store_into="sitemap.xml"
-    verbose="1"
-    sitemap_type="web">
-  <directory path="homepage" url="http://igraph.sourceforge.net/" />
-  <directory path="html" url="http://igraph.sourceforge.net/doc/" />
-  <directory path="book/html" url="http://igraph.sourceforge.net/igraphbook/" />
-  <filter action="drop" type="wildcard" pattern="*~" />
-  <filter action="drop" type="wildcard" pattern="*.html.in" />
-  <filter action="drop" type="wildcard" pattern="*.py" />
-  <filter action="drop" type="regexp"   pattern="/\.[^/]*"     />
-</site>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/sna_screenshot-small.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/sna_screenshot-small.jpg differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/sna_screenshot.jpg and /tmp/mkpaUile3f/igraph-0.6.5/doc/sna_screenshot.jpg differ
diff -Nru igraph-0.6.5~quantal1/doc/sparsemat.xxml igraph-0.6.5/doc/sparsemat.xxml
--- igraph-0.6.5~quantal1/doc/sparsemat.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/sparsemat.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-SparseMatrices2">
-<title>Sparse matrices, another kind</title>
-
-<section>
-<!-- doxrox-include about_sparsemat -->
-</section>
-
-<section><title>Creating sparse matrix objects</title>
-<!-- doxrox-include igraph_sparsemat_init -->
-<!-- doxrox-include igraph_sparsemat_copy -->
-<!-- doxrox-include igraph_sparsemat_realloc -->
-<!-- doxrox-include igraph_sparsemat_destroy -->
-<!-- doxrox-include igraph_sparsemat_eye -->
-<!-- doxrox-include igraph_sparsemat_diag -->
-</section>
-
-<section><title>Query properties of a sparse matrix</title>
-<!-- doxrox-include igraph_sparsemat_index -->
-<!-- doxrox-include igraph_sparsemat_nrow -->
-<!-- doxrox-include igraph_sparsemat_ncol -->
-<!-- doxrox-include igraph_sparsemat_type -->
-<!-- doxrox-include igraph_sparsemat_is_triplet -->
-<!-- doxrox-include igraph_sparsemat_is_cc -->
-<!-- doxrox-include igraph_sparsemat_min-->
-<!-- doxrox-include igraph_sparsemat_max-->
-<!-- doxrox-include igraph_sparsemat_minmax-->
-<!-- doxrox-include igraph_sparsemat_count_nonzero-->
-<!-- doxrox-include igraph_sparsemat_count_nonzerotol-->
-<!-- doxrox-include igraph_sparsemat_rowsums-->
-<!-- doxrox-include igraph_sparsemat_colsums-->
-</section>
-
-<section><title>Operations on sprase matrices</title>
-<!-- doxrox-include igraph_sparsemat_entry -->
-<!-- doxrox-include igraph_sparsemat_fkeep -->
-<!-- doxrox-include igraph_sparsemat_dropzeros -->
-<!-- doxrox-include igraph_sparsemat_droptol -->
-<!-- doxrox-include igraph_sparsemat_scale -->
-<!-- doxrox-include igraph_sparsemat_permute -->
-<!-- doxrox-include igraph_sparsemat_transpose -->
-<!-- doxrox-include igraph_sparsemat_add -->
-<!-- doxrox-include igraph_sparsemat_multiply -->
-<!-- doxrox-include igraph_sparsemat_gaxpy -->
-<!-- doxrox-include igraph_sparsemat_add_rows -->
-<!-- doxrox-include igraph_sparsemat_add_cols -->
-<!-- doxrox-include igraph_sparsemat_resize -->
-</section>
-
-<section><title>Operations that change the internal representation</title>
-<!-- doxrox-include igraph_sparsemat_compress -->
-<!-- doxrox-include igraph_sparsemat_dupl -->
-</section>
-
-<section><title>Decompositions and solving linear systems</title>
-<!-- doxrox-include igraph_sparsemat_symblu -->
-<!-- doxrox-include igraph_sparsemat_symbqr -->
-<!-- doxrox-include igraph_sparsemat_lsolve -->
-<!-- doxrox-include igraph_sparsemat_ltsolve -->
-<!-- doxrox-include igraph_sparsemat_usolve -->
-<!-- doxrox-include igraph_sparsemat_utsolve -->
-<!-- doxrox-include igraph_sparsemat_cholsol -->
-<!-- doxrox-include igraph_sparsemat_lusol -->
-<!-- doxrox-include igraph_sparsemat_lu -->
-<!-- doxrox-include igraph_sparsemat_qr -->
-<!-- doxrox-include igraph_sparsemat_luresol -->
-<!-- doxrox-include igraph_sparsemat_qrresol -->
-<!-- doxrox-include igraph_sparsemat_symbolic_destroy -->
-<!-- doxrox-include igraph_sparsemat_numeric_destroy -->
-</section>
-
-<section><title>Eigenvalues and eigenvectors</title>
-<!-- doxrox-include igraph_sparsemat_arpack_rssolve -->
-<!-- doxrox-include igraph_sparsemat_arpack_rnsolve -->
-</section>
-
-<section><title>Conversion to other data types</title>
-<!-- doxrox-include igraph_sparsemat -->
-<!-- doxrox-include igraph_get_sparsemat -->
-<!-- doxrox-include igraph_matrix_as_sparsemat -->
-<!-- doxrox-include igraph_sparsemat_as_matrix -->
-</section>
-
-<section><title>Writing to a file, or to the screen</title>
-<!-- doxrox-include igraph_sparsemat_print -->
-</section>
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/sparsematrix.xxml igraph-0.6.5/doc/sparsematrix.xxml
--- igraph-0.6.5~quantal1/doc/sparsematrix.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/sparsematrix.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-SparseMatrices">
-<title>Sparse matrices</title>
-
-<section>
-<!-- doxrox-include about_igraph_spmatrix_t_objects -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_spmatrix_constructor_and_destructor -->
-<!-- doxrox-include igraph_spmatrix_init -->
-<!-- doxrox-include igraph_spmatrix_copy -->
-<!-- doxrox-include igraph_spmatrix_destroy -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_spmatrix_accessing_elements -->
-<!-- doxrox-include igraph_spmatrix_e -->
-<!-- doxrox-include igraph_spmatrix_set -->
-<!-- doxrox-include igraph_spmatrix_add_e -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_spmatrix_iterating -->
-<!-- doxrox-include igraph_spmatrix_iter_create -->
-<!-- doxrox-include igraph_spmatrix_iter_reset -->
-<!-- doxrox-include igraph_spmatrix_iter_next -->
-<!-- doxrox-include igraph_spmatrix_iter_end -->
-<!-- doxrox-include igraph_spmatrix_iter_destroy -->
-</section>
-
-<section>
-<title>Matrix query operations</title>
-<!-- doxrox-include igraph_spmatrix_size -->
-<!-- doxrox-include igraph_spmatrix_nrow -->
-<!-- doxrox-include igraph_spmatrix_ncol -->
-<!-- doxrox-include igraph_spmatrix_count_nonzero -->
-<!-- doxrox-include igraph_spmatrix_max -->
-<!-- doxrox-include igraph_spmatrix_rowsums -->
-<!-- doxrox-include igraph_spmatrix_colsums -->
-</section>
-
-<section>
-<title>Matrix operations</title>
-<!-- doxrox-include igraph_spmatrix_scale -->
-<!-- doxrox-include igraph_spmatrix_add_rows -->
-<!-- doxrox-include igraph_spmatrix_add_cols -->
-<!-- doxrox-include igraph_spmatrix_resize -->
-</section>
-
-<section>
-<title>Printing sparse matrices</title>
-<!-- doxrox-include igraph_spmatrix_print -->
-<!-- doxrox-include igraph_spmatrix_fprint -->
-</section>
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/spatialgames.xxml igraph-0.6.5/doc/spatialgames.xxml
--- igraph-0.6.5~quantal1/doc/spatialgames.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/spatialgames.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN"
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Spatial-Games">
-<title>Games on Graphs</title>
-
-<section><title>Microscopic Update Rules</title>
-<!-- doxrox-include igraph_deterministic_optimal_imitation -->
-<!-- doxrox-include igraph_moran_process -->
-<!-- doxrox-include igraph_roulette_wheel_imitation -->
-<!-- doxrox-include igraph_stochastic_imitation -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/stack.xxml igraph-0.6.5/doc/stack.xxml
--- igraph-0.6.5~quantal1/doc/stack.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/stack.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Stacks">
-<title>Stacks</title>
-
-<!-- doxrox-include igraph_stack_init -->
-<!-- doxrox-include igraph_stack_destroy -->
-<!-- doxrox-include igraph_stack_reserve -->
-<!-- doxrox-include igraph_stack_empty -->
-<!-- doxrox-include igraph_stack_size -->
-<!-- doxrox-include igraph_stack_clear -->
-<!-- doxrox-include igraph_stack_push -->
-<!-- doxrox-include igraph_stack_pop -->
-<!-- doxrox-include igraph_stack_top -->
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/status.xxml igraph-0.6.5/doc/status.xxml
--- igraph-0.6.5~quantal1/doc/status.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/status.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Status">
-<title>Status handlers</title>
-
-<section>
-<!-- doxrox-include about_status_handlers -->
-</section>
-
-<section><title>Setting up status handlers</title>
-<!-- doxrox-include igraph_status_handler_t -->
-<!-- doxrox-include igraph_set_status_handler -->
-<!-- doxrox-include igraph_status_handler_stderr -->
-</section>
-
-<section><title>Invoking the status handler</title>
-<!-- doxrox-include IGRAPH_STATUS -->
-<!-- doxrox-include IGRAPH_STATUSF -->
-<!-- doxrox-include igraph_status -->
-<!-- doxrox-include igraph_statusf -->
-</section>
-
-</section>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/structural.xxml igraph-0.6.5/doc/structural.xxml
--- igraph-0.6.5~quantal1/doc/structural.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/structural.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,185 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Structural">
-<title>Structural Properties of Graphs</title>
-
-<!-- doxrox-include about_structural -->
-
-<section><title>Basic Properties</title>
-<!-- doxrox-include igraph_are_connected -->
-</section>
-
-<section><title>Shortest Path Related Functions</title>
-<!-- doxrox-include igraph_shortest_paths -->
-<!-- doxrox-include igraph_shortest_paths_dijkstra -->
-<!-- doxrox-include igraph_shortest_paths_bellman_ford -->
-<!-- doxrox-include igraph_shortest_paths_johnson -->
-<!-- doxrox-include igraph_get_shortest_paths -->
-<!-- doxrox-include igraph_get_shortest_path -->
-<!-- doxrox-include igraph_get_shortest_paths_dijkstra -->
-<!-- doxrox-include igraph_get_shortest_path_dijkstra -->
-<!-- doxrox-include igraph_get_all_shortest_paths -->
-<!-- doxrox-include igraph_get_all_shortest_paths_dijkstra -->
-<!-- doxrox-include igraph_average_path_length -->
-<!-- doxrox-include igraph_path_length_hist -->
-<!-- doxrox-include igraph_diameter -->
-<!-- doxrox-include igraph_diameter_dijkstra -->
-<!-- doxrox-include igraph_girth -->
-<!-- doxrox-include igraph_eccentricity -->
-<!-- doxrox-include igraph_radius -->
-</section>
-
-<section><title>Neighborhood of a vertex</title>
-<!-- doxrox-include igraph_neighborhood_size -->
-<!-- doxrox-include igraph_neighborhood -->
-<!-- doxrox-include igraph_neighborhood_graphs -->
-</section>
-
-<section><title>Graph Components</title>
-<!-- doxrox-include igraph_subcomponent -->
-<!-- doxrox-include igraph_induced_subgraph -->
-<!-- doxrox-include igraph_subgraph_edges -->
-<!-- doxrox-include igraph_subgraph -->
-<!-- doxrox-include igraph_clusters -->
-<!-- doxrox-include igraph_is_connected -->
-<!-- doxrox-include igraph_decompose -->
-<!-- doxrox-include igraph_decompose_destroy -->
-<!-- doxrox-include igraph_biconnected_components -->
-<!-- doxrox-include igraph_articulation_points -->
-</section>
-
-<section><title>Degree Sequences</title>
-<!-- doxrox-include igraph_is_degree_sequence -->
-<!-- doxrox-include igraph_is_graphical_degree_sequence -->
-</section>
-
-<section><title>Centrality Measures</title>
-<!-- doxrox-include igraph_closeness -->
-<!-- doxrox-include igraph_betweenness -->
-<!-- doxrox-include igraph_edge_betweenness -->
-<!-- doxrox-include igraph_pagerank -->
-<!-- doxrox-include igraph_pagerank_old -->
-<!-- doxrox-include igraph_personalized_pagerank -->
-<!-- doxrox-include igraph_personalized_pagerank_vs -->
-<!-- doxrox-include igraph_constraint -->
-<!-- doxrox-include igraph_maxdegree -->
-<!-- doxrox-include igraph_strength -->
-<!-- doxrox-include igraph_eigenvector_centrality -->
-<!-- doxrox-include igraph_hub_score -->
-<!-- doxrox-include igraph_authority_score -->
-</section>
-
-<section><title>Estimating Centrality Measures</title>
-<!-- doxrox-include igraph_closeness_estimate -->
-<!-- doxrox-include igraph_betweenness_estimate -->
-<!-- doxrox-include igraph_edge_betweenness_estimate -->
-</section>
-
-<section><title>Centralization</title>
-<!-- doxrox-include igraph_centralization -->
-<!-- doxrox-include igraph_centralization_degree -->
-<!-- doxrox-include igraph_centralization_betweenness -->
-<!-- doxrox-include igraph_centralization_closeness -->
-<!-- doxrox-include igraph_centralization_eigenvector_centrality -->
-<!-- doxrox-include igraph_centralization_degree_tmax -->
-<!-- doxrox-include igraph_centralization_betweenness_tmax -->
-<!-- doxrox-include igraph_centralization_closeness_tmax -->
-<!-- doxrox-include igraph_centralization_eigenvector_centrality_tmax -->
-</section>
-
-<section><title>Similarity Measures</title>
-<!-- doxrox-include igraph_bibcoupling -->
-<!-- doxrox-include igraph_cocitation -->
-<!-- doxrox-include igraph_similarity_jaccard -->
-<!-- doxrox-include igraph_similarity_jaccard_pairs -->
-<!-- doxrox-include igraph_similarity_jaccard_es -->
-<!-- doxrox-include igraph_similarity_dice -->
-<!-- doxrox-include igraph_similarity_dice_pairs -->
-<!-- doxrox-include igraph_similarity_dice_es -->
-<!-- doxrox-include igraph_similarity_inverse_log_weighted -->
-</section>
-
-<section><title>Spanning Trees</title>
-<!-- doxrox-include igraph_minimum_spanning_tree -->
-<!-- doxrox-include igraph_minimum_spanning_tree_unweighted -->
-<!-- doxrox-include igraph_minimum_spanning_tree_prim -->
-</section>
-
-<section><title>Transitivity or Clustering Coefficient</title>
-<!-- doxrox-include igraph_transitivity_undirected -->
-<!-- doxrox-include igraph_transitivity_local_undirected -->
-<!-- doxrox-include igraph_transitivity_avglocal_undirected -->
-<!-- doxrox-include igraph_transitivity_barrat -->
-</section>
-
-<section><title>Directedness conversion</title>
-<!-- doxrox-include igraph_to_directed -->
-<!-- doxrox-include igraph_to_undirected -->
-</section>
-
-<section><title>Spectral properties</title>
-<!-- doxrox-include igraph_laplacian -->
-</section>
-
-<section><title>Non-simple graphs: multiple and loop edges</title>
-<!-- doxrox-include igraph_is_simple -->
-<!-- doxrox-include igraph_is_loop -->
-<!-- doxrox-include igraph_is_multiple -->
-<!-- doxrox-include igraph_has_multiple -->
-<!-- doxrox-include igraph_count_multiple -->
-<!-- doxrox-include igraph_simplify -->
-</section>
-
-<section><title>Mixing patterns</title>
-<!-- doxrox-include igraph_assortativity_nominal -->
-<!-- doxrox-include igraph_assortativity -->
-<!-- doxrox-include igraph_assortativity_degree -->
-</section>
-
-<section><title>K-Cores</title>
-<!-- doxrox-include igraph_coreness -->
-</section>
-
-<section><title>Topological sorting, directed acyclic graphs</title>
-<!-- doxrox-include igraph_is_dag -->
-<!-- doxrox-include igraph_topological_sorting -->
-<!-- doxrox-include igraph_feedback_arc_set -->
-</section>
-
-<section><title>Maximum cardinality search, graph decomposition, chordal graphs</title>
-<!-- doxrox-include igraph_maximum_cardinality_search -->
-<!-- doxrox-include igraph_is_chordal -->
-</section>
-
-<section><title>Matchings</title>
-<!-- doxrox-include igraph_is_matching -->
-<!-- doxrox-include igraph_is_maximal_matching -->
-<!-- doxrox-include igraph_maximum_bipartite_matching -->
-</section>
-
-<section><title>Line graphs</title>
-<!-- doxrox-include igraph_linegraph -->
-</section>
-
-<section><title>Unfolding a graph into a tree</title>
-<!-- doxrox-include igraph_unfold_tree -->
-</section>
-
-<section><title>Other Operations</title>
-<!-- doxrox-include igraph_density -->
-<!-- doxrox-include igraph_reciprocity -->
-<!-- doxrox-include igraph_diversity -->
-<!-- doxrox-include igraph_is_mutual -->
-<!-- doxrox-include igraph_avg_nearest_neighbor_degree -->
-<!-- doxrox-include igraph_get_adjacency -->
-<!-- doxrox-include igraph_get_stochastic -->
-<!-- doxrox-include igraph_get_stochastic_sparsemat -->
-<!-- doxrox-include igraph_get_edgelist -->	
-<!-- doxrox-include igraph_contract_vertices -->
-</section>
-
-</chapter>
diff -Nru igraph-0.6.5~quantal1/doc/strvector.xxml igraph-0.6.5/doc/strvector.xxml
--- igraph-0.6.5~quantal1/doc/strvector.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/strvector.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Strvector">
-<title>String vectors</title>
-
-<!-- doxrox-include igraph_strvector_t -->
-<!-- doxrox-include igraph_strvector_init -->
-<!-- doxrox-include igraph_strvector_copy -->
-<!-- doxrox-include igraph_strvector_destroy -->
-<!-- doxrox-include STR -->
-<!-- doxrox-include igraph_strvector_get -->
-<!-- doxrox-include igraph_strvector_set -->
-<!-- doxrox-include igraph_strvector_set2 -->
-<!-- doxrox-include igraph_strvector_remove -->
-<!-- doxrox-include igraph_strvector_append -->
-<!-- doxrox-include igraph_strvector_clear -->
-<!-- doxrox-include igraph_strvector_resize -->
-<!-- doxrox-include igraph_strvector_size -->
-<!-- doxrox-include igraph_strvector_add -->
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/threading.xxml igraph-0.6.5/doc/threading.xxml
--- igraph-0.6.5~quantal1/doc/threading.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/threading.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section>
-<title>Using igraph in multi-threaded programs</title>
-<para>
-  The igraph library is considered thread-safe on platforms that 
-  support thread-local storage. This currently includes Linux and MS
-  Windows operating systems, but not Mac OSX. The best way to check 
-  whether an igraph build is thread-safe is checking the 
-  <link linkend="IGRAPH_THREAD_SAFE">
-    <function>IGRAPH_THREAD_SAFE</function>
-  </link> macro.
-</para>
-
-<!-- doxrox-include IGRAPH_THREAD_SAFE -->
-
-<section><title>Thread-safe ARPACK library</title>
-<para>
-Note that igraph is only thread-safe if it was built with the internal
-ARPACK library, i.e. the one that comes with igraph. The standard
-ARPACK library is not thread-safe.
-</para>
-</section>
-
-</section>
-
diff -Nru igraph-0.6.5~quantal1/doc/tutorial.xml igraph-0.6.5/doc/tutorial.xml
--- igraph-0.6.5~quantal1/doc/tutorial.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/tutorial.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,312 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE refentry PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-<!ENTITY tut_simple SYSTEM "../examples/doc/tut_simple.c">
-]>
-
-<chapter id="igraph-tutorial">
-<title>Tutorial</title>
-
-<section><title>Lesson 1. Compiling programs using igraph.</title>
-
-<para>
-The following short example program demonstrates the basic usage of 
-the <command>igraph</command> library.
-<programlisting>
-<![CDATA[#include <igraph.h>
-
-int main(void)
-{
-     igraph_integer_t diameter;
-     igraph_t graph;
-     igraph_erdos_renyi_game(&graph, IGRAPH_ERDOS_RENYI_GNP, 1000, 5.0/1000,
-                             IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
-     igraph_diameter(&graph, &diameter, 0, 0, 0, IGRAPH_UNDIRECTED, 1);
-     printf("Diameter of a random graph with average degree 5: %d\n",
-             (int) diameter);
-     igraph_destroy(&graph);
-     return 0;
-}]]>
-</programlisting>
-</para>
-
-<para>
-This example illustrates a couple of points. First, programs
-using the <command>igraph</command> library should include the
-<filename>igraph.h</filename> header 
-file. Second, <command>igraph</command> uses the
-<type>igraph_real_t</type> type for real numbers instead of
-<type>double</type>. Third, <command>igraph</command> graph objects
-are represented by the <type>igraph_t</type> data
-type. Fourth, the <link
-linkend="igraph_erdos_renyi_game"><function>igraph_erdos_renyi_game()</function></link>
-creates a graph and <link
-linkend="igraph_destroy"><function>igraph_destroy()</function></link>
-destroys it, ie. deallocates the memory associated to it.
-</para>
-
-<para>
-For compiling this program you need a C compiler, if this is called 
-<command>gcc</command> and the previous code is saved in file
-<filename>igraph_test.c</filename>, you will need a command like this:
-<programlisting>
-gcc igraph_test.c -I/usr/local/igraph -L/usr/local/lib -ligraph -o igraph_test
-</programlisting>
-</para>
-
-<para>
-The exact form depends on where <command>igraph</command> was installed on your
-system. The directory after the <option>-I</option> switch is the one
-containing the <filename>igraph.h</filename> file, while the one
-following <option>-L</option> should contain the 
-library file itself, usually a file called
-<filename>libigraph.so</filename>, <filename>libigraph.a</filename> or
-<filename>igraph.dll</filename>. 
-It your system has the <command>pkg-config</command> utility you are
-likely to get the neccessary compile options by issuing the command
-<programlisting>
-pkg-config --libs --cflags igraph
-</programlisting>
-</para>
-
-<para>
-The executable can be run by simply typing its name like this:
-<programlisting>
-./igraph_test
-</programlisting>
-on most systems. If you use dynamic linking and the <command>igraph</command>
-libraries are not at a standard place, you may need to set the
-<envar>LD_LIBRARY_PATH</envar> variable, the syntax depends on the
-shell use are using. In <command>bash</command> it goes like this:
-<programlisting>
-export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:/home/user/libs/igraph
-./igraph_test
-</programlisting>
-Here we assumed that the <command>igraph</command> library is installed in 
-<filename>/home/user/libs/igraph</filename>. Alternatively, you can use
-the <envar>LD_PRELOAD</envar> variable to preload the
-<command>igraph</command> library before invoking your program:
-<programlisting>
-LD_PRELOAD=/home/user/libs/igraph/libigraph.so ./igraph_test
-</programlisting>
-Please note that <envar>LD_PRELOAD</envar> and
-<envar>LD_LIBRARY_PATH</envar> are usually available only on
-Un*x-like systems. On Windows using Cygwin it is usually enough to set the
-<envar>PATH</envar> enviroment variable to include the folder in which
-the <command>igraph</command> library is installed, look for the 
-<filename>cygigraph-0.dll</filename> or similar file.
-</para>
-
-</section>
-<section><title>Lesson 2. Creating your first graphs.</title>
-
-<para>
-The functions generating graph objects are called graph
-generators. Stochastic (=randomized) graph generators are called
-<quote>games</quote>.
-</para>
-
-<para>
-<command>igraph</command> can handle directed and undirected graphs. Most graph
-generators are able to create both types of graphs and most other
-functions are usually also capable of handling
-both. Eg. <link linkend="igraph_shortest_paths"><function>igraph_shortest_paths()</function></link>
-which (surprisingly) calculates
-shortest paths from a vertex to another vertices can calculate
-directed or undirected paths.
-</para>
-
-<para>
-<command>igraph</command> has sophisticated ways for creating graphs. The simplest
-graphs are deterministic regular structures like star graphs
-(<link linkend="igraph_star"><function>igraph_star()</function></link>), 
-ring graphs (<link linkend="igraph_ring"><function>igraph_ring()</function></link>), lattices  
-(<link linkend="igraph_lattice"><function>igraph_lattice()</function></link>) or trees
-(<link linkend="igraph_tree"><function>igraph_tree()</function></link>).  
-</para>
-
-<para>
-The following example creates an undirected regular circular lattice,
-adds some random edges to it and calculates the average length of
-shortest paths between all pairs of vertices in the graph before and
-after adding the random edges. (The message is that some random edges
-can reduce path lengths a lot.)
-<programlisting>
-<![CDATA[#include <igraph.h>
-
-int main(void) {
-  igraph_real_t avg_path;
-  igraph_t graph;
-  igraph_vector_t dimvector;
-  igraph_vector_t edges;
-  int i;
-  
-  igraph_vector_init(&dimvector, 2);
-  VECTOR(dimvector)[0]=30;
-  VECTOR(dimvector)[1]=30;
-  igraph_lattice(&graph, &dimvector, 0, IGRAPH_UNDIRECTED, 0, 1);
-
-  srand(100);
-  igraph_vector_init(&edges, 20);
-  for (i=0; i<igraph_vector_size(&edges); i++) {
-    VECTOR(edges)[i] = rand() % (int)igraph_vcount(&graph);
-  }
-
-  igraph_average_path_length(&graph, &avg_path, IGRAPH_UNDIRECTED, 1);
-  printf("Average path length (lattice):            %f\n", (double) avg_path);
-
-  igraph_add_edges(&graph, &edges, 0);
-  igraph_average_path_length(&graph, &avg_path, IGRAPH_UNDIRECTED, 1);
-  printf("Average path length (randomized lattice): %f\n", (double) avg_path);
-  
-  igraph_vector_destroy(&dimvector);
-  igraph_vector_destroy(&edges);
-  igraph_destroy(&graph);
-
-  return 0;
-}]]>
-</programlisting>
-</para>
-
-<para>
-This example illustrates some new points. <command>igraph</command> uses 
-<link linkend="igraph_vector_t"><type>igraph_vector_t</type></link>
-instead of plain C arrays. <type>igraph_vector_t</type> is superior to
-regular arrays in almost every sense. Vectors are created by the
-<link linkend="igraph_vector_init"><function>igraph_vector_init()</function></link>
-function and like graphs they should be destroyed if not 
-needed any more by calling 
-<link linkend="igraph_vector_destroy"><function>igraph_vector_destroy()</function></link>
-on them. A vector can be indexed by the 
-<link linkend="VECTOR"><function>VECTOR()</function></link> function
-(right now it is a macro). Vectors 
-can be resized, eg. most <command>igraph</command> functions returning the result in a
-vector resize it to the size of the result.
-</para>
-
-<para>
-<link linkend="igraph_lattice"><function>igraph_lattice()</function></link>
-takes a vector argument specifying the dimensions of 
-the lattice, in this example we generate a 30x30 two dimensional
-lattice. See the documentation of
-<link linkend="igraph_lattice"><function>igraph_lattice()</function></link> in
-the reference manual for the other arguments.
-</para>
-
-<para>
-The vertices in a graph are identified by an integer number between
-0 and N-1, N is the number of vertices in the graph (this can be
-obtained by 
-<link linkend="igraph_vcount"><function>igraph_vcount()</function></link>, 
-as in the example). 
-</para>
-
-<para>
-The <link
-linkend="igraph_add_edges"><function>igraph_add_edges()</function></link>
-function simply takes a graph and a vector of 
-vertex ids defining the new edges. The first edge is between the first
-two vertex ids in the vector, the second edge is between the second
-two, etc. This way we add ten random edges to the lattice.
-</para>
-
-<para>
-Note that in the example it is possible to add loop edges, edges
-pointing to the same vertex and multiple edges, more than one edge
-between the same pair of vertices. 
-<type>igraph_t</type> can of course
-represent loops and
-multiple edges, although some routines expect simple graphs,
-ie. graphs without loop and multiple edges, because for example some
-structural properties are ill-defined for non-simple graphs. Loop
-edges can be removed by calling 
-<link linkend="igraph_simplify"><function>igraph_simplify()</function></link>.
-</para>
-
-</section>
-<section><title>Lesson 3. Calculating various properties of graphs.</title>
-<para>
-In our next example we will calculate various centrality measures in a
-friendship graph. The friendship graph is from the famous Zachary karate
-club study. (Web search on 'Zachary karate' if you want to know more about
-this.) Centrality measures quantify how central is the position of
-individual vertices in the graph.
-<programlisting>
-<![CDATA[#include <igraph.h>
-
-int main(void) {
-     igraph_t graph;
-     igraph_vector_t v;
-     igraph_vector_t result;
-     igraph_real_t edges[] = { 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8,
-                               0,10, 0,11, 0,12, 0,13, 0,17, 0,19, 0,21, 0,31,
-                               1, 2, 1, 3, 1, 7, 1,13, 1,17, 1,19, 1,21, 1,30,
-                               2, 3, 2, 7, 2,27, 2,28, 2,32, 2, 9, 2, 8, 2,13,
-                               3, 7, 3,12, 3,13, 4, 6, 4,10, 5, 6, 5,10, 5,16,
-                               6,16, 8,30, 8,32, 8,33, 9,33,13,33,14,32,14,33,
-                              15,32,15,33,18,32,18,33,19,33,20,32,20,33,
-                              22,32,22,33,23,25,23,27,23,32,23,33,23,29,
-                              24,25,24,27,24,31,25,31,26,29,26,33,27,33,
-                              28,31,28,33,29,32,29,33,30,32,30,33,31,32,31,33,
-                              32,33
-     };
-
-     igraph_vector_view(&v, edges, sizeof(edges)/sizeof(double));
-     igraph_create(&graph, &v, 0, IGRAPH_UNDIRECTED);
-
-     igraph_vector_init(&result, 0);
-
-     igraph_degree(&graph, &result, igraph_vss_all(), IGRAPH_ALL,
-                   IGRAPH_LOOPS);
-     printf("Maximum degree is      %10i, vertex %2i.\n",
-            (int)igraph_vector_max(&result), (int)igraph_vector_which_max(&result));
-
-     igraph_closeness(&graph, &result, igraph_vss_all(), IGRAPH_ALL);
-     printf("Maximum closeness is   %10f, vertex %2i.\n",
-             (double)igraph_vector_max(&result), (int)igraph_vector_which_max(&result));
-
-     igraph_betweenness(&graph, &result, igraph_vss_all(),
-                             IGRAPH_UNDIRECTED);
-     printf("Maximum betweenness is %10f, vertex %2i.\n",
-             (double)igraph_vector_max(&result), (int)igraph_vector_which_max(&result));
-
-     igraph_vector_destroy(&result);
-     igraph_destroy(&graph);
-
-     return 0;
-}]]>
-</programlisting>
-</para>
-
-<para>
-This example reflects some new features. First of all, it shows a
-way to define a graph simply as defining a C array with its edges.
-Function <link
-linkend="igraph_vector_view"><function>igraph_vector_view()</function></link>
-creates a <emphasis>view</emphasis> of a C 
-array. It does not copy any data, this also means that you should not
-call <link linkend="igraph_vector_destroy"><function>igraph_vector_destroy()</function></link>
-on a vector created this way. This vector is then used to create the
-undirected graph.
-</para>
-
-<para>
-Then the degree, closeness and betweenness centrality of the vertices
-is calculated and the highest values are printed. Note that the vector
-(<varname>result</varname>) which returns the result from these
-functions has to be initialized first, and also that the functions resize
-it to be able to hold the result.
-</para>
-
-<para>
-The <constant>igraph_vss_all()</constant> argument tells the functions to
-calculate the property for every vertex in the graph, it is shorthand
-for a <emphasis>vertex selector</emphasis> (<type>igraph_vs_t</type>). 
-Vertex selectors help performing operations on a subset of vertices,
-you can read more about them in <link linkend="igraph-Iterators">one
-of the following chapters.</link>
-</para>
-</section>
-
-</chapter>
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/doc/vector.xxml igraph-0.6.5/doc/vector.xxml
--- igraph-0.6.5~quantal1/doc/vector.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/vector.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,136 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE section PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<section id="igraph-Vectors">
-<title>Vectors</title>
-
-<section id="igraph_vector_t">
-<!-- doxrox-include about_igraph_vector_t_objects -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_vector_constructors_and_destructors -->
-<!-- doxrox-include igraph_vector_init -->
-<!-- doxrox-include igraph_vector_init_copy -->
-<!-- doxrox-include igraph_vector_init_seq -->
-<!-- doxrox-include igraph_vector_copy -->
-<!-- doxrox-include igraph_vector_destroy -->
-</section>
-
-<section><title>Initializing elements</title>
-<!-- doxrox-include igraph_vector_null -->
-<!-- doxrox-include igraph_vector_fill -->
-</section>
-
-<section>
-<!-- doxrox-include igraph_vector_accessing_elements -->
-<!-- doxrox-include VECTOR -->
-<!-- doxrox-include igraph_vector_e -->
-<!-- doxrox-include igraph_vector_e_ptr -->
-<!-- doxrox-include igraph_vector_set -->
-<!-- doxrox-include igraph_vector_tail -->
-</section>
-
-<section><title>Vector views</title>
-<!-- doxrox-include igraph_vector_view -->
-</section>
-
-<section><title>Copying vectors</title>
-<!-- doxrox-include igraph_vector_copy_to -->
-<!-- doxrox-include igraph_vector_update -->
-<!-- doxrox-include igraph_vector_append -->
-<!-- doxrox-include igraph_vector_swap -->
-</section>
-
-<section><title>Exchanging elements</title>
-<!-- doxrox-include igraph_vector_swap_elements -->
-<!-- doxrox-include igraph_vector_reverse -->
-<!-- doxrox-include igraph_vector_shuffle -->
-</section>
-
-<section><title>Vector operations</title>
-<!-- doxrox-include igraph_vector_add_constant -->
-<!-- doxrox-include igraph_vector_scale -->
-<!-- doxrox-include igraph_vector_add -->
-<!-- doxrox-include igraph_vector_sub -->
-<!-- doxrox-include igraph_vector_mul -->
-<!-- doxrox-include igraph_vector_div -->
-</section>
-
-<section><title>Vector comparisons</title>
-<!-- doxrox-include igraph_vector_all_e -->
-<!-- doxrox-include igraph_vector_all_l -->
-<!-- doxrox-include igraph_vector_all_g -->
-<!-- doxrox-include igraph_vector_all_le -->
-<!-- doxrox-include igraph_vector_all_ge -->
-</section>
-
-<section><title>Finding minimum and maximum</title>
-<!-- doxrox-include igraph_vector_min -->
-<!-- doxrox-include igraph_vector_max -->
-<!-- doxrox-include igraph_vector_which_min -->
-<!-- doxrox-include igraph_vector_which_max -->
-<!-- doxrox-include igraph_vector_minmax -->
-<!-- doxrox-include igraph_vector_which_minmax -->
-</section>
-
-<section><title>Vector properties</title>
-<!-- doxrox-include igraph_vector_empty -->
-<!-- doxrox-include igraph_vector_size -->
-<!-- doxrox-include igraph_vector_capacity -->
-<!-- doxrox-include igraph_vector_sum -->
-<!-- doxrox-include igraph_vector_prod -->
-<!-- doxrox-include igraph_vector_isininterval -->
-<!-- doxrox-include igraph_vector_maxdifference -->
-</section>
-
-<section><title>Searching for elements</title>
-<!-- doxrox-include igraph_vector_contains -->
-<!-- doxrox-include igraph_vector_search -->
-<!-- doxrox-include igraph_vector_binsearch -->
-<!-- doxrox-include igraph_vector_binsearch2 -->
-</section>
-
-<section><title>Resizing operations</title>
-<!-- doxrox-include igraph_vector_clear -->
-<!-- doxrox-include igraph_vector_reserve -->
-<!-- doxrox-include igraph_vector_resize -->
-<!-- doxrox-include igraph_vector_resize_min -->
-<!-- doxrox-include igraph_vector_push_back -->
-<!-- doxrox-include igraph_vector_pop_back -->
-<!-- doxrox-include igraph_vector_insert -->
-<!-- doxrox-include igraph_vector_remove -->
-<!-- doxrox-include igraph_vector_remove_section -->
-</section>
-
-<section><title>Sorting</title>
-<!-- doxrox-include igraph_vector_sort -->
-</section>
-
-<section><title>Set operations on sorted vectors</title>
-<!-- doxrox-include igraph_vector_intersect_sorted -->
-<!-- doxrox-include igraph_vector_difference_sorted -->
-</section>
-
-<section>
-<!-- doxrox-include about_igraph_vector_ptr_objects -->
-<!-- doxrox-include igraph_vector_ptr_init -->
-<!-- doxrox-include igraph_vector_ptr_copy -->
-<!-- doxrox-include igraph_vector_ptr_destroy -->
-<!-- doxrox-include igraph_vector_ptr_free_all -->
-<!-- doxrox-include igraph_vector_ptr_destroy_all -->
-<!-- doxrox-include igraph_vector_ptr_size -->
-<!-- doxrox-include igraph_vector_ptr_clear -->
-<!-- doxrox-include igraph_vector_ptr_push_back -->
-<!-- doxrox-include igraph_vector_ptr_e -->
-<!-- doxrox-include igraph_vector_ptr_set -->
-<!-- doxrox-include igraph_vector_ptr_resize -->
-<!-- doxrox-include igraph_vector_ptr_get_item_destructor -->
-<!-- doxrox-include igraph_vector_ptr_set_item_destructor -->
-<!-- doxrox-include IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR -->
-</section>
-
-</section>
diff -Nru igraph-0.6.5~quantal1/doc/version-greater-or-equal.xsl igraph-0.6.5/doc/version-greater-or-equal.xsl
--- igraph-0.6.5~quantal1/doc/version-greater-or-equal.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/version-greater-or-equal.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-<?xml version='1.0'?> <!--*- mode: xml -*-->
-<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform"
-                version="1.0"
-                xmlns="http://www.w3.org/TR/xhtml1/transitional"
-                exclude-result-prefixes="#default">
- <xsl:template name="version-greater-or-equal">
-  <xsl:param name="ver1"></xsl:param>
-  <xsl:param name="ver2"></xsl:param>
-  <xsl:variable name="vp1">
-    <xsl:choose>
-      <xsl:when test="contains($ver1, '.')">
-        <xsl:value-of select="substring-before($ver1, '.')"/>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:value-of select="$ver1"/>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:variable>
-  <xsl:variable name="vp2">
-    <xsl:choose>
-      <xsl:when test="contains($ver2, '.')">
-        <xsl:value-of select="substring-before($ver2, '.')"/>
-      </xsl:when>
-      <xsl:otherwise>
-        <xsl:value-of select="$ver2"/>
-      </xsl:otherwise>
-    </xsl:choose>
-  </xsl:variable>
-  <xsl:choose>
-    <xsl:when test="$vp1 &gt; $vp2">
-      1
-    </xsl:when>
-    <xsl:when test="$vp1 &lt; $vp2">
-      0
-    </xsl:when>
-    <xsl:when test="$vp1 = $vp2">
-      <xsl:choose>
-        <xsl:when test="contains($ver1, '.') and contains($ver2, '.')">
-          <xsl:call-template name="version-greater-or-equal">
-            <xsl:with-param name="ver1" select="substring-after($ver1, '.')"/>
-            <xsl:with-param name="ver2" select="substring-after($ver2, '.')"/>
-          </xsl:call-template>
-	</xsl:when>
-        <xsl:when test="contains($ver2, '.')">
-	   0
-	</xsl:when>
-	<xsl:otherwise>
-	   1
-	</xsl:otherwise>
-      </xsl:choose>
-    </xsl:when>
-  </xsl:choose>                                  
-</xsl:template>                                                                 
-</xsl:stylesheet>
diff -Nru igraph-0.6.5~quantal1/doc/visitors.xxml igraph-0.6.5/doc/visitors.xxml
--- igraph-0.6.5~quantal1/doc/visitors.xxml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/doc/visitors.xxml	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-<?xml version="1.0"?>
-<!DOCTYPE chapter PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN" 
-               "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
-<!ENTITY igraph "igraph">
-]>
-
-<chapter id="igraph-Visitors">
-<title>Graph visitors</title>
-
-<section><title>Breadth-first search</title>
-<!-- doxrox-include igraph_bfs -->
-<!-- doxrox-include igraph_bfshandler_t -->
-</section>
-
-<section><title>Depth-first search</title>
-<!-- doxrox-include igraph_dfs -->
-<!-- doxrox-include igraph_dfshandler_t -->
-</section>
-
-</chapter>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/zachary-small.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/zachary-small.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/doc/zachary.png and /tmp/mkpaUile3f/igraph-0.6.5/doc/zachary.png differ
diff -Nru igraph-0.6.5~quantal1/examples/simple/2wheap.c.xml igraph-0.6.5/examples/simple/2wheap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/2wheap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/2wheap.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,143 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> elems;
+  igraph_2wheap_t Q;
+  long int i;
+  igraph_real_t prev=IGRAPH_INFINITY;
+
+  <emphasis role="strong">srand</emphasis>(<emphasis role="strong">time</emphasis>(0));
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;elems, 100);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i] = <emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+  }
+ 
+  <emphasis role="strong">igraph_2wheap_init</emphasis>(&amp;Q, <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong">igraph_2wheap_push_with_index</emphasis>(&amp;Q, i, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i]);
+  }
+
+  <emphasis>/*****/</emphasis>
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i] != <emphasis role="strong">igraph_2wheap_get</emphasis>(&amp;Q, i)) { <emphasis role="strong">return</emphasis> 1; }
+  }
+
+  <emphasis>/*****/</emphasis>
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    long int j;
+    igraph_real_t tmp=<emphasis role="strong">igraph_2wheap_max</emphasis>(&amp;Q);
+    <emphasis role="strong">if</emphasis> (tmp &gt; prev) { <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong">if</emphasis> (tmp != <emphasis role="strong">igraph_2wheap_delete_max_index</emphasis>(&amp;Q, &amp;j)) { <emphasis role="strong">return</emphasis> 3; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[j] != tmp) { <emphasis role="strong">return</emphasis> 4; }
+    prev=tmp;
+  }
+
+  <emphasis>/*****/</emphasis>
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong">igraph_2wheap_push_with_index</emphasis>(&amp;Q, i, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i]);
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_2wheap_size</emphasis>(&amp;Q) != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems)) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i] = <emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+    <emphasis role="strong">igraph_2wheap_modify</emphasis>(&amp;Q, i, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i]);
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[i] != <emphasis role="strong">igraph_2wheap_get</emphasis>(&amp;Q, i)) { <emphasis role="strong">return</emphasis> 6; }
+  }
+  prev=IGRAPH_INFINITY;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;elems); i++) {
+    long int j;
+    igraph_real_t tmp=<emphasis role="strong">igraph_2wheap_max</emphasis>(&amp;Q);
+    <emphasis role="strong">if</emphasis> (tmp &gt; prev) { <emphasis role="strong">return</emphasis> 7; }
+    <emphasis role="strong">if</emphasis> (tmp != <emphasis role="strong">igraph_2wheap_delete_max_index</emphasis>(&amp;Q, &amp;j)) { <emphasis role="strong">return</emphasis> 8; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(elems)[j] != tmp) { <emphasis role="strong">return</emphasis> 9; }
+    prev=tmp;
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_2wheap_empty</emphasis>(&amp;Q)) { <emphasis role="strong">return</emphasis> 10; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_2wheap_size</emphasis>(&amp;Q) != 0) { <emphasis role="strong">return</emphasis> 11; }
+  
+  <emphasis role="strong">igraph_2wheap_destroy</emphasis>(&amp;Q);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;elems);
+
+  <emphasis>/* Hand-made example */</emphasis>
+    
+<emphasis role="strong">#define</emphasis> MAX       <emphasis role="strong">do</emphasis> { <emphasis role="strong">igraph_2wheap_delete_max</emphasis>(&amp;Q); <emphasis role="strong">igraph_2wheap_check</emphasis>(&amp;Q); } <emphasis role="strong">while</emphasis> (0)
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PUSH</emphasis>(i,e) <emphasis role="strong">do</emphasis> { <emphasis role="strong">igraph_2wheap_push_with_index</emphasis>(&amp;Q, (i), -(e)); <emphasis role="strong">igraph_2wheap_check</emphasis>(&amp;Q); } <emphasis role="strong">while</emphasis> (0);
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">MOD</emphasis>(i, e) <emphasis role="strong">do</emphasis> { <emphasis role="strong">igraph_2wheap_modify</emphasis>(&amp;Q, (i), -(e)); <emphasis role="strong">igraph_2wheap_check</emphasis>(&amp;Q); } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis role="strong">igraph_2wheap_init</emphasis>(&amp;Q, 21);
+  <emphasis>/* 0.00 [ 4] */</emphasis> <emphasis role="strong">PUSH</emphasis>(4, 0);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 0.63 [11] */</emphasis> <emphasis role="strong">PUSH</emphasis>(11, 0.63);
+  <emphasis>/* 0.05 [15] */</emphasis> <emphasis role="strong">PUSH</emphasis>(15, 0.05);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 0.4  [12] */</emphasis> <emphasis role="strong">PUSH</emphasis>(12, 0.4);
+  <emphasis>/* 0.4  [13] */</emphasis> <emphasis role="strong">PUSH</emphasis>(13, 0.4);
+  <emphasis>/* 0.12 [16] */</emphasis> <emphasis role="strong">PUSH</emphasis>(16, 0.12);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.1  [ 0] */</emphasis> <emphasis role="strong">PUSH</emphasis>(0, 1.1);
+  <emphasis>/* 1.1  [14] */</emphasis> <emphasis role="strong">PUSH</emphasis>(14, 1.1);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* [11]/0.44 */</emphasis> <emphasis role="strong">MOD</emphasis>(11, 0.44);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.1  [20] */</emphasis> <emphasis role="strong">PUSH</emphasis>(20, 1.1);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.3  [ 7] */</emphasis> <emphasis role="strong">PUSH</emphasis>(7, 1.3);
+  <emphasis>/* 1.7  [ 9] */</emphasis> <emphasis role="strong">PUSH</emphasis>(9, 1.7);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.6  [19] */</emphasis> <emphasis role="strong">PUSH</emphasis>(19, 1.6);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 2.1  [17] */</emphasis> <emphasis role="strong">PUSH</emphasis>(17, 2.1);
+  <emphasis>/* 1.3  [18] */</emphasis> <emphasis role="strong">PUSH</emphasis>(18, 1.3);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 2.3  [ 1] */</emphasis> <emphasis role="strong">PUSH</emphasis>(1, 2.3);
+  <emphasis>/* 2.2  [ 5] */</emphasis> <emphasis role="strong">PUSH</emphasis>(5, 2.2);
+  <emphasis>/* 2.3  [10] */</emphasis> <emphasis role="strong">PUSH</emphasis>(10, 2.3);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* [17]/1.5  */</emphasis> <emphasis role="strong">MOD</emphasis>(17, 1.5);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.8  [ 6] */</emphasis> <emphasis role="strong">PUSH</emphasis>(6, 1.8);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.3  [ 3] */</emphasis> <emphasis role="strong">PUSH</emphasis>(3, 1.3);
+  <emphasis>/* [ 6]/1.3  */</emphasis> <emphasis role="strong">MOD</emphasis>(6, 1.3);
+  <emphasis>/* MAX       */</emphasis> MAX;
+  <emphasis>/* 1.6  [ 8] */</emphasis> <emphasis role="strong">PUSH</emphasis>(8, 1.6);
+  <emphasis>/* MAX       */</emphasis> MAX;
+
+  <emphasis role="strong">igraph_2wheap_destroy</emphasis>(&amp;Q);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/VF2-compat.c.xml igraph-0.6.5/examples/simple/VF2-compat.c.xml
--- igraph-0.6.5~quantal1/examples/simple/VF2-compat.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/VF2-compat.c.xml	2013-03-03 01:46:00.000000000 +0000
@@ -0,0 +1,207 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+<emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+<emphasis>/* Vertices/edges with the same parity match */</emphasis>
+igraph_bool_t <emphasis role="strong">compat_parity</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph1, 
+			    <emphasis role="strong">const</emphasis> igraph_t *graph2,
+			    <emphasis role="strong">const</emphasis> igraph_integer_t g1_num,
+			    <emphasis role="strong">const</emphasis> igraph_integer_t g2_num,
+			    void *arg) {
+  <emphasis role="strong">return</emphasis> (g1_num % 2) == (g2_num %2);
+}
+
+<emphasis>/* Nothing vertex/edge 0 in graph1 */</emphasis>
+igraph_bool_t <emphasis role="strong">compat_not0</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph1, 
+			  <emphasis role="strong">const</emphasis> igraph_t *graph2,
+			  <emphasis role="strong">const</emphasis> igraph_integer_t g1_num,
+			  <emphasis role="strong">const</emphasis> igraph_integer_t g2_num,
+			  void *arg) {
+  <emphasis role="strong">return</emphasis> g1_num != 0;
+}
+
+int <emphasis role="strong">match_rings</emphasis>() {
+
+  igraph_t r1, r2;
+  igraph_bool_t iso;
+  igraph_integer_t count;
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;r1, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;r2, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			&amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			<emphasis>/*node_compat_fn=*/</emphasis> 0, <emphasis>/*edge_compat_fn=*/</emphasis> 0, 
+			<emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(1); }
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			&amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			compat_parity, <emphasis>/*edge_compat_fn=*/</emphasis> 0, <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(2); }  
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+  			&amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0,
+  			compat_not0, <emphasis>/*edge_compat_fn=*/</emphasis> 0, <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (iso) { <emphasis role="strong">exit</emphasis>(3); }
+
+  <emphasis>/* ------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			&amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			<emphasis>/*node_compat_fn=*/</emphasis> 0, compat_parity, <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(4); }  
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			&amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			<emphasis>/*node_compat_fn=*/</emphasis> 0, compat_not0, <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (iso) { <emphasis role="strong">exit</emphasis>(5); }  
+
+  <emphasis>/* ------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				&amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0, 
+				<emphasis>/*edge_compat_fn=*/</emphasis> 0, <emphasis>/*arg=*/</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (count != 20) { <emphasis role="strong">exit</emphasis>(6); }
+
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				&amp;count, compat_parity, <emphasis>/*edge_compat_fn=*/</emphasis> 0,
+				<emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 10) { <emphasis role="strong">exit</emphasis>(7); }
+
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				&amp;count, compat_not0, <emphasis>/*edge_compat_fn=*/</emphasis> 0,
+				<emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 0) { <emphasis role="strong">exit</emphasis>(8); }  
+
+  <emphasis>/* ------- */</emphasis> 
+
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				&amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0, compat_parity,
+				<emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 10) { <emphasis role="strong">exit</emphasis>(9); }
+
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;r1, &amp;r2, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				&amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0, compat_not0,
+				<emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 0) { <emphasis role="strong">exit</emphasis>(10); }    
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;r1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;r2);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">match_rings_open_closed</emphasis>() {
+  igraph_t ro, rc;
+  igraph_bool_t iso;
+  igraph_integer_t count;
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ro, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;rc, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);  
+
+  <emphasis role="strong"><link linkend='igraph_subisomorphic_vf2'>igraph_subisomorphic_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			   &amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			   <emphasis>/*node_compat_fn=*/</emphasis> 0, <emphasis>/*edge_compat_fn=*/</emphasis> 0, 
+			   <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(31); }
+
+  <emphasis role="strong"><link linkend='igraph_subisomorphic_vf2'>igraph_subisomorphic_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			   &amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			   compat_parity, <emphasis>/*edge_compat_fn=*/</emphasis> 0, 
+			   <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(32); }
+
+  <emphasis role="strong"><link linkend='igraph_subisomorphic_vf2'>igraph_subisomorphic_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			   &amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			   compat_not0, <emphasis>/*edge_compat_fn=*/</emphasis> 0, 
+			   <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (iso) { <emphasis role="strong">exit</emphasis>(33); }
+  
+  <emphasis>/* ------- */</emphasis> 
+
+  <emphasis role="strong"><link linkend='igraph_subisomorphic_vf2'>igraph_subisomorphic_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			   &amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			   <emphasis>/*node_compat_fn=*/</emphasis> 0, compat_parity,
+			   <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(34); }
+
+  <emphasis role="strong"><link linkend='igraph_subisomorphic_vf2'>igraph_subisomorphic_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+			   &amp;iso, <emphasis>/*map12=*/</emphasis> 0, <emphasis>/*map21=*/</emphasis> 0, 
+			   <emphasis>/*node_compat_fn=*/</emphasis> 0, compat_not0,
+			   <emphasis>/*arg=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">exit</emphasis>(35); }  
+
+  <emphasis>/* ------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+  				   &amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0,
+  				   <emphasis>/*edge_compat_fn=*/</emphasis> 0, <emphasis>/*arg=*/</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (count != 20) { <emphasis role="strong">exit</emphasis>(36); }
+
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+  				   &amp;count, compat_parity,
+  				   <emphasis>/*edge_compat_fn=*/</emphasis> 0, <emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 10) { <emphasis role="strong">exit</emphasis>(37); }
+
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+  				   &amp;count, compat_not0, <emphasis>/*edge_compat_fn=*/</emphasis> 0,
+  				   <emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 0) { <emphasis role="strong">exit</emphasis>(38); }
+
+  <emphasis>/* ------- */</emphasis> 
+
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				   &amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0, 
+				   compat_parity, <emphasis>/*arg=*/</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (count != 10) { <emphasis role="strong">exit</emphasis>(39); }
+
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;rc, &amp;ro, <emphasis>/*colors(4x)*/</emphasis> 0, 0, 0, 0,
+				   &amp;count, <emphasis>/*node_compat_fn=*/</emphasis> 0, compat_not0,
+				   <emphasis>/*arg=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (count != 2) { <emphasis role="strong">exit</emphasis>(40); }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ro);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;rc);
+  <emphasis role="strong">return</emphasis> 0;  
+}
+
+<emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+int <emphasis role="strong">main</emphasis>() {
+  <emphasis role="strong">match_rings</emphasis>();
+  <emphasis role="strong">match_rings_open_closed</emphasis>();
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/adjlist.c.xml igraph-0.6.5/examples/simple/adjlist.c.xml
--- igraph-0.6.5~quantal1/examples/simple/adjlist.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/adjlist.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,65 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g, g2;
+  igraph_adjlist_t adjlist;
+  igraph_bool_t iso;
+  
+  <emphasis>/* Directed, out */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 42, 3, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_adjlist_init'>igraph_adjlist_init</link></emphasis>(&amp;g, &amp;adjlist, IGRAPH_OUT);
+  <emphasis role="strong"><link linkend='igraph_adjlist'>igraph_adjlist</link></emphasis>(&amp;g2, &amp;adjlist, IGRAPH_OUT, <emphasis>/*duplicate=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;g, &amp;g2, &amp;iso, 0, 0, IGRAPH_BLISS_F, IGRAPH_BLISS_F, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_adjlist_destroy'>igraph_adjlist_destroy</link></emphasis>(&amp;adjlist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Directed, in */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 42, 3, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_adjlist_init'>igraph_adjlist_init</link></emphasis>(&amp;g, &amp;adjlist, IGRAPH_IN);
+  <emphasis role="strong"><link linkend='igraph_adjlist'>igraph_adjlist</link></emphasis>(&amp;g2, &amp;adjlist, IGRAPH_IN, <emphasis>/*duplicate=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;g, &amp;g2, &amp;iso, 0, 0, IGRAPH_BLISS_F, IGRAPH_BLISS_F, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_adjlist_destroy'>igraph_adjlist_destroy</link></emphasis>(&amp;adjlist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Undirected */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 42, 3, IGRAPH_TREE_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_adjlist_init'>igraph_adjlist_init</link></emphasis>(&amp;g, &amp;adjlist, IGRAPH_OUT);
+  <emphasis role="strong"><link linkend='igraph_adjlist'>igraph_adjlist</link></emphasis>(&amp;g2, &amp;adjlist, IGRAPH_ALL, <emphasis>/*duplicate=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;g, &amp;g2, &amp;iso, 0, 0, IGRAPH_BLISS_F, IGRAPH_BLISS_F, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_adjlist_destroy'>igraph_adjlist_destroy</link></emphasis>(&amp;adjlist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+			  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/assortativity.c.xml igraph-0.6.5/examples/simple/assortativity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/assortativity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/assortativity.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,213 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  FILE *karate, *neural;
+  igraph_real_t res;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> types;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> degree, outdegree, indegree;
+
+  igraph_real_t football_types[] = { 
+    7,0,2,3,7,3,2,8,8,7,3,10,6,2,6,2,7,9,6,1,9,8,8,7,10,0,6,9,
+    11,1,1,6,2,0,6,1,5,0,6,2,3,7,5,6,4,0,11,2,4,11,10,8,3,11,6,
+    1,9,4,11,10,2,6,9,10,2,9,4,11,8,10,9,6,3,11,3,4,9,8,8,1,5,3,
+    5,11,3,6,4,9,11,0,5,4,4,7,1,9,9,10,3,6,2,1,3,0,7,0,2,3,8,0,
+    4,8,4,9,11 };
+
+  karate=<emphasis role="strong">fopen</emphasis>("karate.gml", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, karate);
+  <emphasis role="strong">fclose</emphasis>(karate);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;types, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;types, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, <emphasis>/*loops=*/</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_assortativity_nominal'>igraph_assortativity_nominal</link></emphasis>(&amp;g, &amp;types, &amp;res, <emphasis>/*directed=*/</emphasis> 0);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*---------------------*/</emphasis>
+
+  neural=<emphasis role="strong">fopen</emphasis>("celegansneural.gml", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, neural);
+  <emphasis role="strong">fclose</emphasis>(neural);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;types, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, <emphasis>/*loops=*/</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_assortativity_nominal'>igraph_assortativity_nominal</link></emphasis>(&amp;g, &amp;types, &amp;res, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);  
+  <emphasis role="strong"><link linkend='igraph_assortativity_nominal'>igraph_assortativity_nominal</link></emphasis>(&amp;g, &amp;types, &amp;res, <emphasis>/*directed=*/</emphasis> 0);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);  
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;types);
+
+  <emphasis>/*---------------------*/</emphasis>
+  
+  karate=<emphasis role="strong">fopen</emphasis>("karate.gml", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, karate);
+  <emphasis role="strong">fclose</emphasis>(karate);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;degree, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;degree, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_add_constant'>igraph_vector_add_constant</link></emphasis>(&amp;degree, -1);
+
+  <emphasis role="strong"><link linkend='igraph_assortativity'>igraph_assortativity</link></emphasis>(&amp;g, &amp;degree, 0, &amp;res, <emphasis>/*directed=*/</emphasis> 0);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*---------------------*/</emphasis>
+
+  neural=<emphasis role="strong">fopen</emphasis>("celegansneural.gml", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, neural);
+  <emphasis role="strong">fclose</emphasis>(neural);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;degree, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_add_constant'>igraph_vector_add_constant</link></emphasis>(&amp;degree, -1);
+
+  <emphasis role="strong"><link linkend='igraph_assortativity'>igraph_assortativity</link></emphasis>(&amp;g, &amp;degree, 0, &amp;res, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);  
+  <emphasis role="strong"><link linkend='igraph_assortativity'>igraph_assortativity</link></emphasis>(&amp;g, &amp;degree, 0, &amp;res, <emphasis>/*directed=*/</emphasis> 0);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;degree);
+
+  <emphasis>/*---------------------*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;indegree, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;outdegree, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;indegree, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;outdegree, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_add_constant'>igraph_vector_add_constant</link></emphasis>(&amp;indegree, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_add_constant'>igraph_vector_add_constant</link></emphasis>(&amp;outdegree, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_assortativity'>igraph_assortativity</link></emphasis>(&amp;g, &amp;outdegree, &amp;indegree, &amp;res, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;indegree);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outdegree);
+
+  <emphasis>/*---------------------*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_assortativity_degree'>igraph_assortativity_degree</link></emphasis>(&amp;g, &amp;res, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/*---------------------*/</emphasis>
+
+  karate=<emphasis role="strong">fopen</emphasis>("karate.gml", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, karate);
+  <emphasis role="strong">fclose</emphasis>(karate);
+  
+  <emphasis role="strong"><link linkend='igraph_assortativity_degree'>igraph_assortativity_degree</link></emphasis>(&amp;g, &amp;res, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*---------------------*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis role="strong">sizeof</emphasis>(football_types)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t), 
+	       IGRAPH_UNDIRECTED,
+	       0,1,2,3,0,4,4,5,3,5,2,6,6,7,7,8,8,9,0,9,4,9,5,10,10,11,5,11,
+	       3,11,12,13,2,13,2,14,12,14,14,15,13,15,2,15,4,16,9,16,0,16,
+	       16,17,12,17,12,18,18,19,17,20,20,21,8,21,7,21,9,22,7,22,21,
+	       22,8,22,22,23,9,23,4,23,16,23,0,23,11,24,24,25,1,25,3,26,12,
+	       26,14,26,26,27,17,27,1,27,17,27,4,28,11,28,24,28,19,29,29,
+	       30,19,30,18,31,31,32,21,32,15,32,13,32,6,32,0,33,1,33,25,33,
+	       19,33,31,34,26,34,12,34,18,34,34,35,0,35,29,35,19,35,30,35,
+	       18,36,12,36,20,36,19,36,36,37,1,37,25,37,33,37,18,38,16,38,
+	       28,38,26,38,14,38,12,38,38,39,6,39,32,39,13,39,15,39,7,40,3,
+	       40,40,41,8,41,4,41,23,41,9,41,0,41,16,41,34,42,29,42,18,42,
+	       26,42,42,43,36,43,26,43,31,43,38,43,12,43,14,43,19,44,35,44,
+	       30,44,44,45,13,45,33,45,1,45,37,45,25,45,21,46,46,47,22,47,
+	       6,47,15,47,2,47,39,47,32,47,44,48,48,49,32,49,46,49,30,50,
+	       24,50,11,50,28,50,50,51,40,51,8,51,22,51,21,51,3,52,40,52,5,
+	       52,52,53,25,53,48,53,49,53,46,53,39,54,31,54,38,54,14,54,34,
+	       54,18,54,54,55,31,55,6,55,35,55,29,55,19,55,30,55,27,56,56,
+	       57,1,57,42,57,44,57,48,57,3,58,6,58,17,58,36,58,36,59,58,59,
+	       59,60,10,60,39,60,6,60,47,60,13,60,15,60,2,60,43,61,47,61,
+	       54,61,18,61,26,61,31,61,34,61,61,62,20,62,45,62,17,62,27,62,
+	       56,62,27,63,58,63,59,63,42,63,63,64,9,64,32,64,60,64,2,64,6,
+	       64,47,64,13,64,0,65,27,65,17,65,63,65,56,65,20,65,65,66,59,
+	       66,24,66,44,66,48,66,16,67,41,67,46,67,53,67,49,67,67,68,15,
+	       68,50,68,21,68,51,68,7,68,22,68,8,68,4,69,24,69,28,69,50,69,
+	       11,69,69,70,43,70,65,70,20,70,56,70,62,70,27,70,60,71,18,71,
+	       14,71,34,71,54,71,38,71,61,71,31,71,71,72,2,72,10,72,3,72,
+	       40,72,52,72,7,73,49,73,53,73,67,73,46,73,73,74,2,74,72,74,5,
+	       74,10,74,52,74,3,74,40,74,20,75,66,75,48,75,57,75,44,75,75,
+	       76,27,76,59,76,20,76,70,76,66,76,56,76,62,76,73,77,22,77,7,
+	       77,51,77,21,77,8,77,77,78,23,78,50,78,28,78,22,78,8,78,68,
+	       78,7,78,51,78,31,79,43,79,30,79,19,79,29,79,35,79,55,79,79,
+	       80,37,80,29,80,16,81,5,81,40,81,10,81,72,81,3,81,81,82,74,
+	       82,39,82,77,82,80,82,30,82,29,82,7,82,53,83,81,83,69,83,73,
+	       83,46,83,67,83,49,83,83,84,24,84,49,84,52,84,3,84,74,84,10,
+	       84,81,84,5,84,3,84,6,85,14,85,38,85,43,85,80,85,12,85,26,85,
+	       31,85,44,86,53,86,75,86,57,86,48,86,80,86,66,86,86,87,17,87,
+	       62,87,56,87,24,87,20,87,65,87,49,88,58,88,83,88,69,88,46,88,
+	       53,88,73,88,67,88,88,89,1,89,37,89,25,89,33,89,55,89,45,89,
+	       5,90,8,90,23,90,0,90,11,90,50,90,24,90,69,90,28,90,29,91,48,
+	       91,66,91,69,91,44,91,86,91,57,91,80,91,91,92,35,92,15,92,86,
+	       92,48,92,57,92,61,92,66,92,75,92,0,93,23,93,80,93,16,93,4,
+	       93,82,93,91,93,41,93,9,93,34,94,19,94,55,94,79,94,80,94,29,
+	       94,30,94,82,94,35,94,70,95,69,95,76,95,62,95,56,95,27,95,17,
+	       95,87,95,37,95,48,96,17,96,76,96,27,96,56,96,65,96,20,96,87,
+	       96,5,97,86,97,58,97,11,97,59,97,63,97,97,98,77,98,48,98,84,
+	       98,40,98,10,98,5,98,52,98,81,98,89,99,34,99,14,99,85,99,54,
+	       99,18,99,31,99,61,99,71,99,14,99,99,100,82,100,13,100,2,100,
+	       15,100,32,100,64,100,47,100,39,100,6,100,51,101,30,101,94,
+	       101,1,101,79,101,58,101,19,101,55,101,35,101,29,101,100,102,
+	       74,102,52,102,98,102,72,102,40,102,10,102,3,102,102,103,33,
+	       103,45,103,25,103,89,103,37,103,1,103,70,103,72,104,11,104,
+	       0,104,93,104,67,104,41,104,16,104,87,104,23,104,4,104,9,104,
+	       89,105,103,105,33,105,62,105,37,105,45,105,1,105,80,105,25,
+	       105,25,106,56,106,92,106,2,106,13,106,32,106,60,106,6,106,
+	       64,106,15,106,39,106,88,107,75,107,98,107,102,107,72,107,40,
+	       107,81,107,5,107,10,107,84,107,4,108,9,108,7,108,51,108,77,
+	       108,21,108,78,108,22,108,68,108,79,109,30,109,63,109,1,109,
+	       33,109,103,109,105,109,45,109,25,109,89,109,37,109,67,110,
+	       13,110,24,110,80,110,88,110,49,110,73,110,46,110,83,110,53,
+	       110,23,111,64,111,46,111,78,111,8,111,21,111,51,111,7,111,
+	       108,111,68,111,77,111,52,112,96,112,97,112,57,112,66,112,63,
+	       112,44,112,92,112,75,112,91,112,28,113,20,113,95,113,59,113,
+	       70,113,17,113,87,113,76,113,65,113,96,113,83,114,88,114,110,
+	       114,53,114,49,114,73,114,46,114,67,114,58,114,15,114,104,114,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;types, football_types, 
+		     <emphasis role="strong">sizeof</emphasis>(football_types) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_assortativity_nominal'>igraph_assortativity_nominal</link></emphasis>(&amp;g, &amp;types, &amp;res, <emphasis>/*directed=*/</emphasis> 0);
+  <emphasis role="strong">printf</emphasis>("%.5f\n", res);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/bellman_ford.c.xml igraph-0.6.5/examples/simple/bellman_ford.c.xml
--- igraph-0.6.5~quantal1/examples/simple/bellman_ford.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/bellman_ford.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,104 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_matrix</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m) {
+  long int nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m);
+  long int ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">printf</emphasis>("%li:", i);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      <emphasis role="strong">printf</emphasis>(" %3.0F", <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_real_t weights_data_0[] = { 0,2,1, 0,5,2, 1,1,0, 2,2,8, 1,1,3, 1,1,4, 2,1 };
+  igraph_real_t weights_data_1[] = { 6,7,8,-4,-2,-3,9,2,7 };
+  igraph_real_t weights_data_2[] = { 6,7,2,-4,-2,-3,9,2,7 };
+  igraph_matrix_t res;
+  
+  <emphasis>/* Graph with only positive weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,1, 0,2, 0,3,    1,2, 1,4, 1,5,
+	       2,3, 2,6,         3,2, 3,6,
+	       4,5, 4,7,         5,6, 5,8, 5,9,
+	       7,5, 7,8,         8,9,
+	       5,2,
+	       2,1,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, weights_data_0, 
+		     <emphasis role="strong">sizeof</emphasis>(weights_data_0)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;res, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_shortest_paths_bellman_ford'>igraph_shortest_paths_bellman_ford</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+				     &amp;weights, IGRAPH_OUT);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;res);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis>/***************************************/</emphasis>
+
+  <emphasis>/* Graph with negative weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED, 
+	       0,1, 0,3, 1,3, 1,4, 2,1, 3,2, 3,4, 4,0, 4,2, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, weights_data_1, 
+		     <emphasis role="strong">sizeof</emphasis>(weights_data_1)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;res, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_shortest_paths_bellman_ford'>igraph_shortest_paths_bellman_ford</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 
+				     <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), &amp;weights, IGRAPH_OUT);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;res);
+  
+  <emphasis>/***************************************/</emphasis>
+
+  <emphasis>/* Same graph with negative loop */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, weights_data_2, 
+		     <emphasis role="strong">sizeof</emphasis>(weights_data_2)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_shortest_paths_bellman_ford'>igraph_shortest_paths_bellman_ford</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+					 <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+                                         &amp;weights, IGRAPH_OUT) != IGRAPH_ENEGLOOP)
+    <emphasis role="strong">return</emphasis> 1;
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/biguint.c.xml igraph-0.6.5/examples/simple/biguint.c.xml
--- igraph-0.6.5~quantal1/examples/simple/biguint.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/biguint.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,88 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;bigint.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;limits.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_biguint_t A, B, C, D, E, zero, one;
+  
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;A);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;B);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;C);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;D);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;E);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;zero);
+  <emphasis role="strong">igraph_biguint_init</emphasis>(&amp;one);
+
+  <emphasis>/* set &amp; add &amp; sub */</emphasis>
+  <emphasis role="strong">igraph_biguint_set_limb</emphasis>(&amp;one, 1);
+  <emphasis role="strong">igraph_biguint_set_limb</emphasis>(&amp;A, UINT_MAX);
+  <emphasis role="strong">igraph_biguint_set_limb</emphasis>(&amp;B, UINT_MAX);
+  <emphasis role="strong">igraph_biguint_add</emphasis>(&amp;A, &amp;A, &amp;B);                      <emphasis>/* A &lt;- A + B */</emphasis>
+
+  <emphasis role="strong">igraph_biguint_print</emphasis>(&amp;B);
+  <emphasis role="strong">putchar</emphasis>('\n');
+  <emphasis role="strong">igraph_biguint_print</emphasis>(&amp;A);
+  <emphasis role="strong">putchar</emphasis>('\n');
+  
+  <emphasis role="strong">igraph_biguint_sub</emphasis>(&amp;A, &amp;A, &amp;B);                      <emphasis>/* A &lt;- A - B */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_biguint_equal</emphasis>(&amp;A, &amp;B)) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis>/* inc &amp; dec */</emphasis>
+  <emphasis role="strong">igraph_biguint_inc</emphasis>(&amp;A, &amp;A);	                       <emphasis>/* A &lt;- A + 1 */</emphasis>
+  <emphasis role="strong">igraph_biguint_dec</emphasis>(&amp;A, &amp;A);	                       <emphasis>/* A &lt;- A - 1 */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_biguint_equal</emphasis>(&amp;A, &amp;B)) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis>/* mul &amp; div */</emphasis>
+  <emphasis role="strong">igraph_biguint_mul</emphasis>(&amp;C, &amp;A, &amp;B);                      <emphasis>/* C &lt;- A * B */</emphasis>
+  <emphasis role="strong">igraph_biguint_div</emphasis>(&amp;E, &amp;D, &amp;C, &amp;B);                  <emphasis>/* E &lt;- C / B */</emphasis>
+				                       <emphasis>/* D &lt;- C % B */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_biguint_equal</emphasis>(&amp;E, &amp;A)) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_biguint_equal</emphasis>(&amp;D, &amp;zero)) { <emphasis role="strong">return</emphasis> 4; }
+
+  <emphasis role="strong">igraph_biguint_mul</emphasis>(&amp;C, &amp;A, &amp;A);                      <emphasis>/* C &lt;- A * A */</emphasis>
+  <emphasis role="strong">igraph_biguint_mul</emphasis>(&amp;D, &amp;C, &amp;A);		       <emphasis>/* C &lt;- C * A */</emphasis>
+  <emphasis role="strong">igraph_biguint_mul</emphasis>(&amp;C, &amp;D, &amp;A);		       <emphasis>/* C &lt;- C * A */</emphasis>
+
+  <emphasis role="strong">igraph_biguint_div</emphasis>(&amp;C, &amp;D, &amp;C, &amp;A);                  <emphasis>/* C &lt;- C / A */</emphasis>
+  <emphasis role="strong">igraph_biguint_div</emphasis>(&amp;C, &amp;D, &amp;C, &amp;A);		       <emphasis>/* C &lt;- C / A */</emphasis>
+  <emphasis role="strong">igraph_biguint_div</emphasis>(&amp;C, &amp;D, &amp;C, &amp;A);		       <emphasis>/* C &lt;- C / A */</emphasis>
+  <emphasis role="strong">igraph_biguint_div</emphasis>(&amp;C, &amp;D, &amp;C, &amp;A);		       <emphasis>/* C &lt;- C / A */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_biguint_equal</emphasis>(&amp;C, &amp;one)) { <emphasis role="strong">return</emphasis> 5; }
+
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;A);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;B);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;C);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;D);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;E);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;zero);
+  <emphasis role="strong">igraph_biguint_destroy</emphasis>(&amp;one);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/biguint_betweenness.c.xml igraph-0.6.5/examples/simple/biguint_betweenness.c.xml
--- igraph-0.6.5~quantal1/examples/simple/biguint_betweenness.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/biguint_betweenness.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,206 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">check</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v1, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v2, int code) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v1);
+  igraph_real_t m;
+
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;v, v1);
+  <emphasis role="strong"><link linkend='igraph_vector_sub'>igraph_vector_sub</link></emphasis>(&amp;v, v2);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] = <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]);
+  }
+  
+  <emphasis role="strong">if</emphasis> ( (m=<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v)) &gt; 0.01) { 
+    <emphasis role="strong">printf</emphasis>("Difference: %g\n", m);
+    <emphasis role="strong">exit</emphasis>(code); 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> bet, bet2, weights, edges;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> bbet, bbet2;
+  
+  igraph_real_t nontriv[] = { 0, 19, 0, 16, 0, 20, 1, 19, 2, 5, 3, 7, 3, 8, 
+			      4, 15, 4, 11, 5, 8, 5, 19, 6, 7, 6, 10, 6, 8, 
+			      6, 9, 7, 20, 9, 10, 9, 20, 10, 19, 
+			      11, 12, 11, 20, 12, 15, 13, 15, 
+			      14, 18, 14, 16, 14, 17, 15, 16, 17, 18 };
+  
+  igraph_real_t nontriv_weights[] = { 0.5249, 1, 0.1934, 0.6274, 0.5249, 
+				      0.0029, 0.3831, 0.05, 0.6274, 0.3831, 
+				      0.5249, 0.0587, 0.0579, 0.0562, 0.0562, 
+				      0.1934, 0.6274, 0.6274, 0.6274, 0.0418, 
+				      0.6274, 0.3511, 0.3511, 0.1486, 1, 1, 
+				      0.0711, 0.2409 };
+
+  igraph_real_t nontriv_res[] = { 20, 0, 0, 0, 0, 19, 80, 85, 32, 0, 10, 
+				  75, 70, 0, 36, 81, 60, 0, 19, 19, 86 };
+
+  <emphasis>/*******************************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(<emphasis>/* graph= */</emphasis>    &amp;g,
+		       <emphasis>/* n= */</emphasis>        1000,
+		       <emphasis>/* power= */</emphasis>    1,
+		       <emphasis>/* m= */</emphasis>        3,
+		       <emphasis>/* outseq= */</emphasis>   0,
+		       <emphasis>/* outpref= */</emphasis>  0,
+		       <emphasis>/* A= */</emphasis>        1,
+		       <emphasis>/* directed= */</emphasis> 0, 
+		       <emphasis>/* algo= */</emphasis>     IGRAPH_BARABASI_BAG,
+		       <emphasis>/* start_from= */</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/* multiple= */</emphasis> 1, <emphasis>/* loops= */</emphasis> 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bbet, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 2,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bbet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 2,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 0);  
+
+  <emphasis role="strong">check</emphasis>(&amp;bet, &amp;bbet, 10);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bbet);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*******************************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 20000, 10, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bbet, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bbet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 0);
+
+  <emphasis role="strong">check</emphasis>(&amp;bet, &amp;bbet, 20);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bbet2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights, 1.0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet2,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> &amp;weights, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bbet2,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> &amp;weights, 
+			      <emphasis>/* nobigint=  */</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;bet, &amp;bet2)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+<emphasis>/*   if (!igraph_vector_all_e(&amp;bbet, &amp;bbet2)) { */</emphasis>
+<emphasis>/*     return 2; */</emphasis>
+<emphasis>/*   } */</emphasis>
+
+  <emphasis role="strong">check</emphasis>(&amp;bet, &amp;bbet, 30);
+  <emphasis role="strong">check</emphasis>(&amp;bet2, &amp;bbet2, 40);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bbet);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bbet2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Non-trivial weighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges, nontriv, <emphasis role="strong">sizeof</emphasis>(nontriv)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;edges, 0, <emphasis>/* directed= */</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, nontriv_weights, 
+		     <emphasis role="strong">sizeof</emphasis>(nontriv_weights)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bbet, 0);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness'>igraph_betweenness</link></emphasis>(<emphasis>/*graph=*/</emphasis> &amp;g, <emphasis>/*res=*/</emphasis> &amp;bet, <emphasis>/*vids=*/</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 
+		     <emphasis>/*directed=*/</emphasis>0, <emphasis>/*weights=*/</emphasis> &amp;weights, <emphasis>/*nobigint=*/</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness'>igraph_betweenness</link></emphasis>(<emphasis>/*graph=*/</emphasis> &amp;g, <emphasis>/*res=*/</emphasis> &amp;bbet, <emphasis>/*vids=*/</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 
+		     <emphasis>/*directed=*/</emphasis>0, <emphasis>/*weights=*/</emphasis> &amp;weights, <emphasis>/*nobigint=*/</emphasis> 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;bet2, nontriv_res, 
+		     <emphasis role="strong">sizeof</emphasis>(nontriv_res)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;bet, &amp;bet2)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">check</emphasis>(&amp;bet, &amp;bbet, 50);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bbet);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 3;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/blas.c.xml igraph-0.6.5/examples/simple/blas.c.xml
--- igraph-0.6.5~quantal1/examples/simple/blas.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/blas.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,50 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t m;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> x, y;
+
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;x, 3, 1.0, 2.0, 3.0);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;y, 4, 4.0, 5.0, 6.0, 7.0);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 4, 3);
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 0, 0) = 1; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 0, 1) = 2; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 0, 2) = 3;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 1, 0) = 2; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 1, 1) = 3; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 1, 2) = 4;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 2, 0) = 3; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 2, 1) = 4; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 2, 2) = 5;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 3, 0) = 4; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 3, 1) = 5; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, 3, 2) = 6;
+
+  <emphasis role="strong"><link linkend='igraph_blas_dgemv'>igraph_blas_dgemv</link></emphasis>(0, 2, &amp;m, &amp;x, 3, &amp;y);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;y);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/bug-1033045.c.xml igraph-0.6.5/examples/simple/bug-1033045.c.xml
--- igraph-0.6.5~quantal1/examples/simple/bug-1033045.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/bug-1033045.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,51 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t graph;  
+  igraph_vector_ptr_t separators;
+  int i, n;  
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, <emphasis>/*directed=*/</emphasis> 0, 
+	       0,1,0,2, 1,3,1,4, 2,3,2,5, 3,4,3,5, 4,6, 5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;separators, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_all_minimal_st_separators'>igraph_all_minimal_st_separators</link></emphasis>(&amp;graph, &amp;separators);
+  
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;separators);  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *sep=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(separators)[i];
+    <emphasis role="strong">igraph_vector_print</emphasis>(sep);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(sep);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(sep);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;separators);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/cattributes.c.xml igraph-0.6.5/examples/simple/cattributes.c.xml
--- igraph-0.6.5~quantal1/examples/simple/cattributes.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/cattributes.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,398 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;string.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_attributes</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *g) {
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> gtypes, vtypes, etypes;
+  igraph_strvector_t gnames, vnames, enames;
+  long int i;
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec;
+  igraph_strvector_t svec;
+  long int j;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;gtypes, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vtypes, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;etypes, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;gnames, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;vnames, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;enames, 0);
+
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(g, &amp;gnames, &amp;gtypes, &amp;vnames, &amp;vtypes, 
+			 &amp;enames, &amp;etypes);
+
+  <emphasis>/* Graph attributes */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;gnames); i++) {
+    <emphasis role="strong">printf</emphasis>("%s=", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(gnames, i));
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(gtypes)[i]==IGRAPH_ATTRIBUTE_NUMERIC) {
+      <emphasis role="strong">igraph_real_printf</emphasis>(<emphasis role="strong"><link linkend='GAN'>GAN</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(gnames,i)));
+      <emphasis role="strong">putchar</emphasis>(' ');
+    } <emphasis role="strong">else</emphasis> {
+      <emphasis role="strong">printf</emphasis>("\"%s\" ", <emphasis role="strong"><link linkend='GAS'>GAS</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(gnames,i)));
+    }
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g); i++) {
+    long int j;
+    <emphasis role="strong">printf</emphasis>("Vertex %li: ", i);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;vnames); j++) {
+      <emphasis role="strong">printf</emphasis>("%s=", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, j));
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vtypes)[j]==IGRAPH_ATTRIBUTE_NUMERIC) {
+	<emphasis role="strong">igraph_real_printf</emphasis>(<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames,j), i));
+	<emphasis role="strong">putchar</emphasis>(' ');
+      } <emphasis role="strong">else</emphasis> {
+	<emphasis role="strong">printf</emphasis>("\"%s\" ", <emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames,j), i));
+      }
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(g); i++) {
+    long int j;
+    <emphasis role="strong">printf</emphasis>("Edge %li (%i-%i): ", i, (int)<emphasis role="strong">IGRAPH_FROM</emphasis>(g,i), (int)<emphasis role="strong">IGRAPH_TO</emphasis>(g,i));
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames); j++) {
+      <emphasis role="strong">printf</emphasis>("%s=", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j));
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(etypes)[j]==IGRAPH_ATTRIBUTE_NUMERIC) {
+	<emphasis role="strong">igraph_real_printf</emphasis>(<emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), i));
+	<emphasis role="strong">putchar</emphasis>(' ');
+      } <emphasis role="strong">else</emphasis> {
+	<emphasis role="strong">printf</emphasis>("\"%s\" ", <emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), i));
+      }
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+
+  <emphasis>/* Check vector-based query functions */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;svec, 0);
+  
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;vnames); j++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vtypes)[j]==IGRAPH_ATTRIBUTE_NUMERIC) {
+      <emphasis role="strong"><link linkend='igraph_cattribute_VANV'>igraph_cattribute_VANV</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, j), <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), &amp;vec);
+      <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g); i++) {
+	igraph_real_t num=<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, j), i);
+	<emphasis role="strong">if</emphasis> (num != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &amp;&amp;
+	    (!<emphasis role="strong">isnan</emphasis>(num) || !<emphasis role="strong">isnan</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i]))) {
+	  <emphasis role="strong">exit</emphasis>(51);
+	}
+      }
+    } <emphasis role="strong">else</emphasis> {
+      <emphasis role="strong"><link linkend='igraph_cattribute_VASV'>igraph_cattribute_VASV</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, j), <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), &amp;svec);
+      <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g); i++) {
+	<emphasis role="strong">const</emphasis> char *str=<emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, j), i);
+	<emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(str,<emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(svec, i))) {
+	  <emphasis role="strong">exit</emphasis>(52);
+	}
+      }
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames); j++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(etypes)[j]==IGRAPH_ATTRIBUTE_NUMERIC) {
+      <emphasis role="strong"><link linkend='igraph_cattribute_EANV'>igraph_cattribute_EANV</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), 
+			     <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID), &amp;vec);
+      <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(g); i++) {
+	igraph_real_t num=<emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), i);
+	<emphasis role="strong">if</emphasis> (num != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &amp;&amp; 
+	    (!<emphasis role="strong">isnan</emphasis>(num) || !<emphasis role="strong">isnan</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i]))) {
+	  <emphasis role="strong">exit</emphasis>(53);
+	}
+      }
+    } <emphasis role="strong">else</emphasis> {
+      <emphasis role="strong"><link linkend='igraph_cattribute_EASV'>igraph_cattribute_EASV</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), 
+			     <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID), &amp;svec);
+      <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(g); i++) {
+	<emphasis role="strong">const</emphasis> char *str=<emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(g, <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, j), i);
+	<emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(str,<emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(svec, i))) {
+	  <emphasis role="strong">exit</emphasis>(54);
+	}
+      }
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;svec);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;enames);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;vnames);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;gnames);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;etypes);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vtypes);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;gtypes);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, g2;
+  FILE *ifile;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> gtypes, vtypes, etypes;
+  igraph_strvector_t gnames, vnames, enames;
+  long int i;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> y;
+  igraph_strvector_t id;
+  char str[20];
+
+  <emphasis>/* turn on attribute handling */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("LINKS.NET", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;gtypes, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vtypes, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;etypes, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;gnames, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;vnames, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;enames, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, &amp;gnames, &amp;gtypes, &amp;vnames, &amp;vtypes, 
+			 &amp;enames, &amp;etypes);
+  
+  <emphasis>/* List attribute names and types */</emphasis>
+  <emphasis role="strong">printf</emphasis>("Graph attributes: ");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;gnames); i++) {
+    <emphasis role="strong">printf</emphasis>("%s (%i) ", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(gnames, i), (int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(gtypes)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong">printf</emphasis>("Vertex attributes: ");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;vnames); i++) {
+    <emphasis role="strong">printf</emphasis>("%s (%i) ", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(vnames, i), (int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vtypes)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong">printf</emphasis>("Edge attributes: ");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames); i++) {
+    <emphasis role="strong">printf</emphasis>("%s (%i) ", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(enames, i), (int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(etypes)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g);
+
+  <emphasis>/* Copying a graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis>/* Adding vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 3, 0);
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g);
+
+  <emphasis>/* Adding edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;g, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;g, 2, 5);
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;g, 3, 6);
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g);
+
+  <emphasis>/* Deleting vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_delete_vertices'>igraph_delete_vertices</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(1));
+  <emphasis role="strong"><link linkend='igraph_delete_vertices'>igraph_delete_vertices</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(4));
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g);
+
+  <emphasis>/* Deleting edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_1'>igraph_ess_1</link></emphasis>(<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)-1));
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_1'>igraph_ess_1</link></emphasis>(0));
+  <emphasis role="strong">print_attributes</emphasis>(&amp;g);
+
+  <emphasis>/* Set graph attributes */</emphasis>
+  <emphasis role="strong"><link linkend='SETGAN'>SETGAN</link></emphasis>(&amp;g, "id", 10);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='GAN'>GAN</link></emphasis>(&amp;g, "id") != 10) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+  <emphasis role="strong"><link linkend='SETGAS'>SETGAS</link></emphasis>(&amp;g, "name", "toy");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(<emphasis role="strong"><link linkend='GAS'>GAS</link></emphasis>(&amp;g, "name"), "toy")) {
+    <emphasis role="strong">return</emphasis> 12;
+  }
+  
+  <emphasis>/* Delete graph attributes */</emphasis>
+  <emphasis role="strong"><link linkend='DELGA'>DELGA</link></emphasis>(&amp;g, "id");
+  <emphasis role="strong"><link linkend='DELGA'>DELGA</link></emphasis>(&amp;g, "name");
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, &amp;gnames, 0,0,0,0,0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;gnames) != 0) {
+    <emphasis role="strong">return</emphasis> 14;
+  }  
+
+  <emphasis>/* Delete vertex attributes */</emphasis>
+  <emphasis role="strong"><link linkend='DELVA'>DELVA</link></emphasis>(&amp;g, "x");
+  <emphasis role="strong"><link linkend='DELVA'>DELVA</link></emphasis>(&amp;g, "shape");
+  <emphasis role="strong"><link linkend='DELVA'>DELVA</link></emphasis>(&amp;g, "xfact");
+  <emphasis role="strong"><link linkend='DELVA'>DELVA</link></emphasis>(&amp;g, "yfact");
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, 0,0, &amp;vnames, 0,0,0);  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;vnames) != 2) {
+    <emphasis role="strong">return</emphasis> 15;
+  }
+  
+  <emphasis>/* Delete edge attributes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, 0,0,0,0,&amp;enames,0);
+  i=<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames);
+  <emphasis role="strong"><link linkend='DELEA'>DELEA</link></emphasis>(&amp;g, "hook1");
+  <emphasis role="strong"><link linkend='DELEA'>DELEA</link></emphasis>(&amp;g, "hook2"); 
+  <emphasis role="strong"><link linkend='DELEA'>DELEA</link></emphasis>(&amp;g, "label");
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, 0,0,0,0,&amp;enames,0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames) != i-3) {
+    <emphasis role="strong">return</emphasis> 16;
+  }
+  
+  <emphasis>/* Set vertex attributes */</emphasis>
+  <emphasis role="strong"><link linkend='SETVAN'>SETVAN</link></emphasis>(&amp;g, "y", 0, -1);
+  <emphasis role="strong"><link linkend='SETVAN'>SETVAN</link></emphasis>(&amp;g, "y", 1, 2.1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "y", 0) != -1 || 
+      <emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "y", 1) != 2.1) {
+    <emphasis role="strong">return</emphasis> 17;
+  }
+  <emphasis role="strong"><link linkend='SETVAS'>SETVAS</link></emphasis>(&amp;g, "id", 0, "foo");
+  <emphasis role="strong"><link linkend='SETVAS'>SETVAS</link></emphasis>(&amp;g, "id", 1, "bar");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(<emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(&amp;g, "id", 0), "foo") ||
+      <emphasis role="strong">strcmp</emphasis>(<emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(&amp;g, "id", 1), "bar")) {
+    <emphasis role="strong">return</emphasis> 18;
+  }
+
+  <emphasis>/* Set edge attributes */</emphasis>
+  <emphasis role="strong"><link linkend='SETEAN'>SETEAN</link></emphasis>(&amp;g, "weight", 2, 100.0);
+  <emphasis role="strong"><link linkend='SETEAN'>SETEAN</link></emphasis>(&amp;g, "weight", 0, -100.1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(&amp;g, "weight", 2) != 100.0 ||
+      <emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(&amp;g, "weight", 0) != -100.1) {
+    <emphasis role="strong">return</emphasis> 19;
+  }
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 2, "RED");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 0, "Blue");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(<emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(&amp;g, "color", 2), "RED") ||
+      <emphasis role="strong">strcmp</emphasis>(<emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(&amp;g, "color", 0), "Blue")) {
+    <emphasis role="strong">return</emphasis> 20;
+  }      
+
+  <emphasis>/* Set vector attributes as vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;y, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;y, 1.23);
+  <emphasis role="strong"><link linkend='SETVANV'>SETVANV</link></emphasis>(&amp;g, "y", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {    
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "y", i) != 1.23) {
+      <emphasis role="strong">return</emphasis> 21;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;y, 0, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g)-1);
+  <emphasis role="strong"><link linkend='SETVANV'>SETVANV</link></emphasis>(&amp;g, "foobar", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "foobar", i) != i) {
+      <emphasis role="strong">return</emphasis> 22;
+    }
+  }  
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;id, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">snprintf</emphasis>(str, <emphasis role="strong">sizeof</emphasis>(str)-1, "%li", i);
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;id, i, str);
+  }
+  <emphasis role="strong"><link linkend='SETVASV'>SETVASV</link></emphasis>(&amp;g, "foo", &amp;id);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;id);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">printf</emphasis>("%s ", <emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(&amp;g, "foo", i));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;id, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">snprintf</emphasis>(str, <emphasis role="strong">sizeof</emphasis>(str)-1, "%li", i);
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;id, i, str);
+  }
+  <emphasis role="strong"><link linkend='SETVASV'>SETVASV</link></emphasis>(&amp;g, "id", &amp;id);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;id);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">printf</emphasis>("%s ", <emphasis role="strong"><link linkend='VAS'>VAS</link></emphasis>(&amp;g, "id", i));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");  
+  
+  <emphasis>/* Set edge attributes as vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;y, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;y, 12.3);
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "weight", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {    
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(&amp;g, "weight", i) != 12.3) {
+      <emphasis role="strong">return</emphasis> 23;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;y, 0, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)-1);
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "foobar", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "foobar", i) != i) {
+      <emphasis role="strong">return</emphasis> 24;
+    }
+  }  
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;id, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">snprintf</emphasis>(str, <emphasis role="strong">sizeof</emphasis>(str)-1, "%li", i);
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;id, i, str);
+  }
+  <emphasis role="strong"><link linkend='SETEASV'>SETEASV</link></emphasis>(&amp;g, "foo", &amp;id);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;id);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">printf</emphasis>("%s ", <emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(&amp;g, "foo", i));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;id, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">snprintf</emphasis>(str, <emphasis role="strong">sizeof</emphasis>(str)-1, "%li", i);
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;id, i, str);
+  }
+  <emphasis role="strong"><link linkend='SETEASV'>SETEASV</link></emphasis>(&amp;g, "color", &amp;id);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;id);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">printf</emphasis>("%s ", <emphasis role="strong"><link linkend='EAS'>EAS</link></emphasis>(&amp;g, "color", i));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");    
+
+  <emphasis>/* Delete all remaining attributes */</emphasis>
+  <emphasis role="strong"><link linkend='DELALL'>DELALL</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_cattribute_list'>igraph_cattribute_list</link></emphasis>(&amp;g, &amp;gnames, &amp;gtypes, &amp;vnames, &amp;vtypes, &amp;enames, &amp;etypes);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;gnames) != 0 ||
+      <emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;vnames) != 0 ||
+      <emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;enames) != 0) {
+    <emphasis role="strong">return</emphasis> 25;
+  }
+
+  <emphasis>/* Destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;gtypes);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vtypes);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;etypes);  
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;gnames);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;vnames);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;enames);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/cattributes2.c.xml igraph-0.6.5/examples/simple/cattributes2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/cattributes2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/cattributes2.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,61 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> y;  
+
+  <emphasis>/* turn on attribute handling */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+
+  <emphasis>/* Create a graph, add some attributes and save it as a GraphML file */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;g, "Petersen");
+  <emphasis role="strong"><link linkend='SETGAS'>SETGAS</link></emphasis>(&amp;g, "name", "Petersen's graph");
+  <emphasis role="strong"><link linkend='SETGAN'>SETGAN</link></emphasis>(&amp;g, "vertices", <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='SETGAN'>SETGAN</link></emphasis>(&amp;g, "edges", <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;y, 1, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='SETVANV'>SETVANV</link></emphasis>(&amp;g, "id", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+
+  <emphasis role="strong"><link linkend='SETVAS'>SETVAS</link></emphasis>(&amp;g, "name", 0, "foo");
+  <emphasis role="strong"><link linkend='SETVAS'>SETVAS</link></emphasis>(&amp;g, "name", 1, "foobar");
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;y, 1, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "id", &amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "name", 0, "FOO");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "name", 1, "FOOBAR");
+
+  <emphasis role="strong"><link linkend='igraph_write_graph_gml'>igraph_write_graph_gml</link></emphasis>(&amp;g, stdout, 0, "");
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g, stdout);
+   
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/cattributes3.c.xml igraph-0.6.5/examples/simple/cattributes3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/cattributes3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/cattributes3.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,159 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">mf</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *input, igraph_real_t *output) {
+  *output = 0.0;
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, g2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weight;
+  igraph_attribute_combination_t comb;
+  
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 4, IGRAPH_DIRECTED, 
+	       0, 1, 0, 1, 0, 1,
+	       1, 2, 2, 3, 
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;weight, 1, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "weight", &amp;weight);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weight);
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_SUM,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_PROD,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_MIN,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_MAX,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_FIRST,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_LAST,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_MEAN,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>  
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_FUNCTION, mf,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>  
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_MEAN,
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>  
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/cattributes4.c.xml igraph-0.6.5/examples/simple/cattributes4.c.xml
--- igraph-0.6.5~quantal1/examples/simple/cattributes4.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/cattributes4.c.xml	2013-03-03 01:45:46.000000000 +0000
@@ -0,0 +1,91 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">mf</emphasis>(<emphasis role="strong">const</emphasis> igraph_strvector_t *input, char *output) {
+  <emphasis>/* </emphasis><emphasis role="strong">TODO</emphasis><emphasis> */</emphasis>
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, g2;
+  igraph_attribute_combination_t comb;
+  
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 4, IGRAPH_DIRECTED, 
+	       0, 1, 0, 1, 0, 1,
+	       1, 2, 2, 3, 
+	       -1);
+    
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 0, "green");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 1, "red");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 2, "blue");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 3, "white");
+  <emphasis role="strong"><link linkend='SETEAS'>SETEAS</link></emphasis>(&amp;g, "color", 4, "black");
+  
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "weight", IGRAPH_ATTRIBUTE_COMBINE_SUM,
+			       "color",  IGRAPH_ATTRIBUTE_COMBINE_FIRST,
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_LAST,
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+
+  <emphasis>/* ****************************************************** */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g);
+  <emphasis role="strong">igraph_attribute_combination</emphasis>(&amp;comb, 
+			       "",       IGRAPH_ATTRIBUTE_COMBINE_IGNORE, 
+			       "color",  IGRAPH_ATTRIBUTE_COMBINE_CONCAT,
+			       IGRAPH_NO_MORE_ATTRIBUTES);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g2, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 1, &amp;comb);
+  <emphasis role="strong">igraph_attribute_combination_destroy</emphasis>(&amp;comb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis>/* ****************************************************** */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/centralization.c.xml igraph-0.6.5/examples/simple/centralization.c.xml
--- igraph-0.6.5~quantal1/examples/simple/centralization.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/centralization.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,174 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">ALMOST_EQUALS</emphasis>(a, b) (<emphasis role="strong">fabs</emphasis>((a)-(b)) &lt; 1e-8)
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_real_t cent;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> arpack_options;
+
+  <emphasis>/****************************/</emphasis>
+  <emphasis>/* in-star */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_IN, <emphasis>/*center=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_centralization_degree'>igraph_centralization_degree</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+			       <emphasis>/*mode=*/</emphasis> IGRAPH_IN, IGRAPH_NO_LOOPS,
+			       &amp;cent, <emphasis>/*theoretical_max=*/</emphasis> 0, 
+			       <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "in-star, degree: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 1; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_betweenness'>igraph_centralization_betweenness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED, <emphasis>/*nobigint=*/</emphasis> 1, &amp;cent, 
+				    <emphasis>/*theoretical_max=*/</emphasis> 0,
+				    <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "in-star, betweenness: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 2; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_closeness'>igraph_centralization_closeness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				  IGRAPH_IN, &amp;cent, 
+				  <emphasis>/*theoretical_max=*/</emphasis> 0,
+				  <emphasis>/*normalization=*/</emphasis> 1);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">ALMOST_EQUALS</emphasis>(cent, 1.0)) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "in-star, closeness: %g\n", cent);
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/****************************/</emphasis>
+  <emphasis>/* out-star */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, <emphasis>/*center=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_centralization_degree'>igraph_centralization_degree</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+			       <emphasis>/*mode=*/</emphasis> IGRAPH_OUT, IGRAPH_NO_LOOPS,
+			       &amp;cent, <emphasis>/*theoretical_max=*/</emphasis> 0,
+			       <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "out-star, degree: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 11; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_betweenness'>igraph_centralization_betweenness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED, <emphasis>/*nobigint=*/</emphasis> 1, &amp;cent,
+				    <emphasis>/*theoretical_max=*/</emphasis> 0,
+				    <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "out-star, betweenness: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 12; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_closeness'>igraph_centralization_closeness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				  IGRAPH_OUT, &amp;cent, 
+				  <emphasis>/*theoretical_max=*/</emphasis> 0,
+				  <emphasis>/*normalization=*/</emphasis> 1);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">ALMOST_EQUALS</emphasis>(cent, 1.0)) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "out-star, closeness: %g\n", cent);
+    <emphasis role="strong">return</emphasis> 13;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/****************************/</emphasis>
+  <emphasis>/* undricted star */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, <emphasis>/*center=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_centralization_degree'>igraph_centralization_degree</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+			       <emphasis>/*mode=*/</emphasis> IGRAPH_ALL, IGRAPH_NO_LOOPS,
+			       &amp;cent, <emphasis>/*theoretical_max=*/</emphasis> 0,
+			       <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "undirected star, degree: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 21; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_betweenness'>igraph_centralization_betweenness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED, <emphasis>/*nobigint=*/</emphasis> 1, &amp;cent,
+				    <emphasis>/*theoretical_max=*/</emphasis> 0,
+				    <emphasis>/*normalized=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (cent != 1.0) { 
+    <emphasis role="strong">fprintf</emphasis>(stderr, "undirected star, betweenness: %g\n", cent); 
+    <emphasis role="strong">return</emphasis> 22; 
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_closeness'>igraph_centralization_closeness</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				  IGRAPH_ALL, &amp;cent, 
+				  <emphasis>/*theoretical_max=*/</emphasis> 0,
+				  <emphasis>/*normalization=*/</emphasis> 1);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">ALMOST_EQUALS</emphasis>(cent, 1.0)) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "undirected star, closeness: %g\n", cent);
+    <emphasis role="strong">return</emphasis> 23;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/****************************/</emphasis>
+  <emphasis>/* single dyad */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n=*/</emphasis> 10, <emphasis>/*directed=*/</emphasis> 0, 
+	       0,1, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;arpack_options);
+  <emphasis role="strong"><link linkend='igraph_centralization_eigenvector_centrality'>igraph_centralization_eigenvector_centrality</link></emphasis>(&amp;g, <emphasis>/*vector=*/</emphasis> 0,
+					       <emphasis>/*value=*/</emphasis> 0, 
+					       <emphasis>/*directed=*/</emphasis> 1,
+					       <emphasis>/*scale=*/</emphasis> 1,
+					       &amp;arpack_options, &amp;cent,
+					       <emphasis>/*theoretical_max=*/</emphasis> 0,
+					       <emphasis>/*normalization=*/</emphasis> 1);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">ALMOST_EQUALS</emphasis>(cent, 1.0)) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "dyad, eigenvector centrality: %g\n", cent);
+    <emphasis role="strong">return</emphasis> 24;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_centralization_eigenvector_centrality'>igraph_centralization_eigenvector_centrality</link></emphasis>(&amp;g, <emphasis>/*vector=*/</emphasis> 0,
+					       <emphasis>/*value=*/</emphasis> 0, 
+					       <emphasis>/*directed=*/</emphasis> 1,
+					       <emphasis>/*scale=*/</emphasis> 0,
+					       &amp;arpack_options, &amp;cent,
+					       <emphasis>/*theoretical_max=*/</emphasis> 0,
+					       <emphasis>/*normalization=*/</emphasis> 1);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">ALMOST_EQUALS</emphasis>(cent, 1.0)) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "dyad, eigenvector centrality, not scaled: %g\n", cent);
+    <emphasis role="strong">return</emphasis> 25;
+  }
+    
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/cohesive_blocks.c.xml igraph-0.6.5/examples/simple/cohesive_blocks.c.xml
--- igraph-0.6.5~quantal1/examples/simple/cohesive_blocks.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/cohesive_blocks.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,175 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">doit</emphasis>(igraph_t *g) {
+
+  igraph_vector_ptr_t blocks;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> cohesion;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> parent;
+  igraph_t block_tree;
+  long int i;
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;blocks, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;cohesion, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;parent, 0);
+
+  <emphasis role="strong"><link linkend='igraph_cohesive_blocks'>igraph_cohesive_blocks</link></emphasis>(g, &amp;blocks, &amp;cohesion, &amp;parent, 
+			 &amp;block_tree);
+  
+  <emphasis role="strong">printf</emphasis>("Blocks:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;blocks); i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *sg=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(blocks)[i];
+    <emphasis role="strong">printf</emphasis>("  "); <emphasis role="strong">igraph_vector_print</emphasis>(sg);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(sg);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(sg);
+  }
+  <emphasis role="strong">printf</emphasis>("Cohesion:\n  ");  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;cohesion);
+  <emphasis role="strong">printf</emphasis>("Parents:\n  ");   <emphasis role="strong">igraph_vector_print</emphasis>(&amp;parent);
+  <emphasis role="strong">printf</emphasis>("Block graph:\n"); <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;block_tree, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;blocks);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cohesion);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;parent);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;block_tree);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  int ret;
+
+  <emphasis>/* --------------------------------------------------------*/</emphasis>
+  <emphasis>/* The graph from the Moody-White paper                    */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 23, IGRAPH_UNDIRECTED,
+	       0,1, 0,2, 0,3, 0,4, 0,5,
+	       1,2, 1,3, 1,4, 1,6,
+	       2,3, 2,5, 2,6,
+	       3,4, 3,5, 3,6,
+	       4,5, 4,6, 4,20,
+	       5,6, 
+	       6,7, 6,10, 6,13, 6,18,
+	       7,8, 7,10, 7,13,
+	       8,9,
+	       9,11, 9,12,
+	       10,11, 10,13,
+	       11,15,
+	       12,15,
+	       13,14,
+	       14,15,
+	       16,17, 16,18, 16,19,
+	       17,19, 17,20,
+	       18,19, 18,21, 18,22,
+	       19,20,
+	       20,21, 20,22,
+	       21,22,
+	       -1);
+  
+  <emphasis role="strong">if</emphasis> ( (ret=<emphasis role="strong">doit</emphasis>(&amp;g)) ) { <emphasis role="strong">return</emphasis> ret; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">printf</emphasis>("--\n");
+
+  <emphasis>/* --------------------------------------------------------*/</emphasis>
+  <emphasis>/* A tricky graph, where the separators themselves         */</emphasis>
+  <emphasis>/* form a block. But recently we don't include this        */</emphasis>
+  <emphasis>/* block in the results.                                   */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 8, IGRAPH_UNDIRECTED,
+	       0,1,0,4,0,5, 1,2,1,4,1,5,1,6, 2,3,2,5,2,6,2,7,
+	       3,6,3,7, 4,5, 5,6, 6,7, 
+	       -1);
+  
+  <emphasis role="strong">if</emphasis> ( (ret=<emphasis role="strong">doit</emphasis>(&amp;g)) ) { <emphasis role="strong">return</emphasis> ret; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">printf</emphasis>("--\n");  
+
+  <emphasis>/* --------------------------------------------------------*/</emphasis>
+  <emphasis>/* The science camp graph from </emphasis>http://intersci.ss.uci.edu/<emphasis> */</emphasis>
+  <emphasis>/* wiki/index.php/Cohesive_blocking                        */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 18, IGRAPH_UNDIRECTED, 
+	       0,1,0,2,0,3, 
+	       1,2,1,3,1,16,1,17, 
+	       2,3, 
+	       3,17, 
+	       4,5,4,6,4,7,4,8,
+	       5,6,5,7, 
+	       6,7,6,8,
+	       7,8,7,16,
+	       8,9,8,10,
+	       9,11,9,12,9,13,9,14,
+	       10,11,10,12,10,13,
+	       11,14,
+	       12,13,12,14,12,15,
+	       15,16,15,17,
+	       16,17,
+	       -1);
+	       
+  <emphasis role="strong">if</emphasis> ( (ret=<emphasis role="strong">doit</emphasis>(&amp;g)) ) { <emphasis role="strong">return</emphasis> ret; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">printf</emphasis>("--\n");  
+
+  <emphasis>/* --------------------------------------------------------*/</emphasis>
+  <emphasis>/* Zachary karate-club                                     */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 34, IGRAPH_UNDIRECTED,
+	       0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,10,0,11,0,12,0,13,
+	       0,17,0,19,0,21,0,31,
+	       1,2,1,3,1,7,1,13,1,17,1,19,1,21,1,30,
+	       2,3,2,7,2,27,2,28,2,32,2,9,2,8,2,13,
+	       3,7,3,12,3,13,
+	       4,6,4,10,
+	       5,6,5,10,5,16,
+	       6,16,
+	       8,30,8,32,8,33,
+	       9,33,
+	       13,33,
+	       14,32,14,33,
+	       15,32,15,33,
+	       18,32,18,33,
+	       19,33,
+	       20,32,20,33,
+	       22,32,22,33,
+	       23,25,23,27,23,32,23,33,23,29,
+	       24,25,24,27,24,31,
+	       25,31,
+	       26,29,26,33,
+	       27,33,
+	       28,31,28,33,
+	       29,32,29,33,
+	       30,32,30,33,
+	       31,32,31,33,
+	       32,33,
+	       -1);
+
+  <emphasis role="strong">if</emphasis> ( (ret=<emphasis role="strong">doit</emphasis>(&amp;g)) ) { <emphasis role="strong">return</emphasis> ret; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">printf</emphasis>("--\n");  
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/d_indheap.c.xml igraph-0.6.5/examples/simple/d_indheap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/d_indheap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/d_indheap.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,102 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_d_indheap_t h;
+  int i;
+  long int idx1, idx2;
+
+  <emphasis>/* igraph_d_indheap_init, igraph_d_indheap_destroy */</emphasis>
+  <emphasis role="strong">igraph_d_indheap_init</emphasis>(&amp;h, 0);
+  <emphasis role="strong">igraph_d_indheap_destroy</emphasis>(&amp;h);
+  <emphasis role="strong">igraph_d_indheap_init</emphasis>(&amp;h, 100);
+  <emphasis role="strong">igraph_d_indheap_destroy</emphasis>(&amp;h);  
+
+  <emphasis>/* igraph_d_indheap_empty, igraph_d_indheap_size */</emphasis>
+  <emphasis role="strong">igraph_d_indheap_init</emphasis>(&amp;h, 10);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_d_indheap_empty</emphasis>(&amp;h)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_d_indheap_size</emphasis>(&amp;h) != 0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 10, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_d_indheap_empty</emphasis>(&amp;h)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_d_indheap_size</emphasis>(&amp;h) != 1) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  
+  <emphasis>/* igraph_d_indheap_push */</emphasis>
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 9, 9, 8);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 3, 3, 2);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 2, 2, 1);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 1, 1, 0);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 7, 7, 6);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 4, 4, 3);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 0, 0, 1);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 6, 6, 5);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 5, 5, 4);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 8, 8, 7);  
+
+  <emphasis>/* igraph_d_indheap_max, igraph_d_indheap_delete_max */</emphasis>
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_d_indheap_empty</emphasis>(&amp;h)) {
+    <emphasis role="strong">printf</emphasis>("% li", (long int)<emphasis role="strong">igraph_d_indheap_max</emphasis>(&amp;h));
+    <emphasis role="strong">printf</emphasis>("% li\n", (long int)<emphasis role="strong">igraph_d_indheap_delete_max</emphasis>(&amp;h));
+  }
+
+  <emphasis>/* igraph_d_indheap_reserve */</emphasis>
+  <emphasis role="strong">igraph_d_indheap_reserve</emphasis>(&amp;h, 5);
+  <emphasis role="strong">igraph_d_indheap_reserve</emphasis>(&amp;h, 20);
+  <emphasis role="strong">igraph_d_indheap_reserve</emphasis>(&amp;h, 0);
+  <emphasis role="strong">igraph_d_indheap_reserve</emphasis>(&amp;h, 3);
+  
+  <emphasis>/* igraph_d_indheap_max_index */</emphasis>
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 0, 0, 1);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 8, 8, 7);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 2, 2, 1);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 7, 7, 6);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 9, 9, 8);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 4, 4, 3);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 3, 3, 2);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 5, 5, 4);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 1, 1, 0);  
+  <emphasis role="strong">igraph_d_indheap_push</emphasis>(&amp;h, 6, 6, 5);  
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_d_indheap_empty</emphasis>(&amp;h)) {
+    <emphasis role="strong">igraph_d_indheap_max_index</emphasis>(&amp;h, &amp;idx1, &amp;idx2);
+    <emphasis role="strong">printf</emphasis>(" %li %li", idx1, idx2);
+    <emphasis role="strong">igraph_d_indheap_delete_max</emphasis>(&amp;h);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong">igraph_d_indheap_destroy</emphasis>(&amp;h);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 5;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/dijkstra.c.xml igraph-0.6.5/examples/simple/dijkstra.c.xml
--- igraph-0.6.5~quantal1/examples/simple/dijkstra.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/dijkstra.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,69 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_matrix</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m) {
+  long int nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m);
+  long int ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">printf</emphasis>("%li:", i);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      <emphasis role="strong">printf</emphasis>(" %3.0F", <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_real_t weights_data[] = { 0,2,1, 0,5,2, 1,1,0, 2,2,8, 1,1,3, 1,1,4, 2,1 };
+  igraph_matrix_t res;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,1, 0,2, 0,3,    1,2, 1,4, 1,5,
+	       2,3, 2,6,         3,2, 3,6,
+	       4,5, 4,7,         5,6, 5,8, 5,9,
+	       7,5, 7,8,         8,9,
+	       5,2,
+	       2,1,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, weights_data, 
+		     <emphasis role="strong">sizeof</emphasis>(weights_data)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;res, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_shortest_paths_dijkstra'>igraph_shortest_paths_dijkstra</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+				 &amp;weights, IGRAPH_OUT);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;res);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/dominator_tree.c.xml igraph-0.6.5/examples/simple/dominator_tree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/dominator_tree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/dominator_tree.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,166 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g, domtree;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> dom, leftout;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;dom, 0);
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 13, IGRAPH_DIRECTED,
+	       0,1, 0,7, 0,10,
+	       1,2, 1,5,
+	       2,3,
+	       3,4,
+	       4,3, 4,0,
+	       5,3, 5,6,
+	       6,3,
+	       7,8, 7,10, 7,11,
+	       8,9,
+	       9,4, 9,8,
+	       10,11,
+	       11,12,
+	       12,9,
+	       -1);
+
+  <emphasis>/* Check NULL vector arguments */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, <emphasis>/*dom=*/</emphasis> 0, <emphasis>/*domtree=*/</emphasis> 0,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+
+  <emphasis>/* Proper calculation */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, &amp;dom, <emphasis>/*domtree=*/</emphasis> 0,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;dom);
+
+  <emphasis>/* Tree calculation */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, <emphasis>/*dom=*/</emphasis> 0, <emphasis>/*domtree=*/</emphasis> &amp;domtree,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;domtree, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;dom);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;domtree);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;dom, 0);
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 13, IGRAPH_DIRECTED,
+	       1,0, 2,0, 3,0,
+	       4,1,
+	       1,2, 4,2, 5,2,
+	       6,3, 7,3,
+	       12,4,
+	       8,5, 
+	       9,6,
+	       9,7, 10,7,
+	       5,8, 11,8,
+	       11,9,
+	       9,10,
+	       9,11, 0,11,
+	       8,12,
+	       -1);
+
+  <emphasis>/* Check NULL vector arguments */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, <emphasis>/*dom=*/</emphasis> 0, <emphasis>/*domtree=*/</emphasis> 0,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_IN);
+
+  <emphasis>/* Proper calculation */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, &amp;dom, <emphasis>/*domtree=*/</emphasis> 0,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_IN);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;dom);
+
+  <emphasis>/* Tree calculation */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, <emphasis>/*dom=*/</emphasis> 0, <emphasis>/*domtree=*/</emphasis> &amp;domtree,
+			<emphasis>/*leftout=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_IN);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;domtree, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;dom);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;domtree);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------*/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;dom, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;leftout, 0);
+
+  <emphasis>/* Check a graph with more components */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 20, IGRAPH_DIRECTED,
+	       0,1, 0,2, 0,3,
+	       1,4,
+	       2,1, 2,4, 2,8,
+	       3,9, 3,10,
+	       4,15,
+	       8,11, 
+	       9,12,
+	       10,12, 10,13,
+	       11,8, 11,14,
+	       12,14,
+	       13,12,
+	       14,12, 14,0,
+	       15,11,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 0, &amp;dom, &amp;domtree,
+			&amp;leftout, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;dom);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;leftout);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;domtree, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;dom);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;leftout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;domtree);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------*/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;dom, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;leftout, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,9,
+	       1,0, 1,2,
+	       2,3, 2,7,
+	       3,1,
+	       4,1, 4,3,
+	       5,2, 5,3, 5,4, 5,8,
+	       6,5, 6,9,
+	       8,7,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_dominator_tree'>igraph_dominator_tree</link></emphasis>(&amp;g, <emphasis>/*root=*/</emphasis> 9, &amp;dom, &amp;domtree,
+			&amp;leftout, <emphasis>/*mode=*/</emphasis> IGRAPH_IN);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;dom);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;leftout);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;domtree, stdout);
+   
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;dom);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;leftout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;domtree);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+ 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/dot.c.xml igraph-0.6.5/examples/simple/dot.c.xml
--- igraph-0.6.5~quantal1/examples/simple/dot.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/dot.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  FILE *ifile;
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("karate.gml", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">printf</emphasis>("directed\n");
+  } <emphasis role="strong">else</emphasis> {
+    <emphasis role="strong">printf</emphasis>("undirected\n");
+  }
+    
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">printf</emphasis>("-----------------\n");
+  <emphasis role="strong"><link linkend='igraph_write_graph_dot'>igraph_write_graph_dot</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/dqueue.c.xml igraph-0.6.5/examples/simple/dqueue.c.xml
--- igraph-0.6.5~quantal1/examples/simple/dqueue.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/dqueue.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,118 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_dqueue.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_dqueue_t q;
+  int i;
+
+  <emphasis>/* igraph_dqueue_init, igraph_dqueue_destroy, igraph_dqueue_empty */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dqueue_init'>igraph_dqueue_init</link></emphasis>(&amp;q, 5);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_dqueue_empty'>igraph_dqueue_empty</link></emphasis>(&amp;q)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_destroy'>igraph_dqueue_destroy</link></emphasis>(&amp;q);
+
+  <emphasis>/* igraph_dqueue_push, igraph_dqueue_pop */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dqueue_init'>igraph_dqueue_init</link></emphasis>(&amp;q, 4);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 1);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 2);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 3);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 4);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q) != 1) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q) != 2) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q) != 3) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q) != 4) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_destroy'>igraph_dqueue_destroy</link></emphasis>(&amp;q);
+
+  <emphasis>/* igraph_dqueue_clear, igraph_dqueue_size */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dqueue_init'>igraph_dqueue_init</link></emphasis>(&amp;q, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_size'>igraph_dqueue_size</link></emphasis>(&amp;q) != 0) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_clear'>igraph_dqueue_clear</link></emphasis>(&amp;q);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_size'>igraph_dqueue_size</link></emphasis>(&amp;q) != 0) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, i);
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_clear'>igraph_dqueue_clear</link></emphasis>(&amp;q);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_size'>igraph_dqueue_size</link></emphasis>(&amp;q) != 0) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_destroy'>igraph_dqueue_destroy</link></emphasis>(&amp;q);
+
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_dqueue_full */</emphasis>
+
+  <emphasis>/* igraph_dqueue_head, igraph_dqueue_back, igraph_dqueue_pop_back */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dqueue_init'>igraph_dqueue_init</link></emphasis>(&amp;q, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, i);
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_head'>igraph_dqueue_head</link></emphasis>(&amp;q) != 0) {
+      <emphasis role="strong">return</emphasis> 9;
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_back'>igraph_dqueue_back</link></emphasis>(&amp;q) != 9-i) {
+      <emphasis role="strong">return</emphasis> 10;
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_dqueue_pop_back'>igraph_dqueue_pop_back</link></emphasis>(&amp;q) != 9-i) {
+      <emphasis role="strong">return</emphasis> 11;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_dqueue_destroy'>igraph_dqueue_destroy</link></emphasis>(&amp;q);
+
+  <emphasis>/* print */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_dqueue_init'>igraph_dqueue_init</link></emphasis>(&amp;q, 4);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 1);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 2);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 3);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 4);
+  <emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q);
+  <emphasis role="strong"><link linkend='igraph_dqueue_pop'>igraph_dqueue_pop</link></emphasis>(&amp;q);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 5);
+  <emphasis role="strong"><link linkend='igraph_dqueue_push'>igraph_dqueue_push</link></emphasis>(&amp;q, 6);
+  <emphasis role="strong">igraph_dqueue_print</emphasis>(&amp;q);
+
+  <emphasis role="strong"><link linkend='igraph_dqueue_clear'>igraph_dqueue_clear</link></emphasis>(&amp;q);
+  <emphasis role="strong">igraph_dqueue_print</emphasis>(&amp;q);
+  
+  <emphasis role="strong"><link linkend='igraph_dqueue_destroy'>igraph_dqueue_destroy</link></emphasis>(&amp;q);  
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 12;  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/eigenvector_centrality.c.xml igraph-0.6.5/examples/simple/eigenvector_centrality.c.xml
--- igraph-0.6.5~quantal1/examples/simple/eigenvector_centrality.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/eigenvector_centrality.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,86 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> "igraph.h"
+
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, weights;
+  long int i;
+  igraph_real_t value;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 100, IGRAPH_STAR_UNDIRECTED, 0);
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_eigenvector_centrality'>igraph_eigenvector_centrality</link></emphasis>(&amp;g, &amp;v, &amp;value, <emphasis>/*directed=*/</emphasis> 0, 
+				<emphasis>/*scale=*/</emphasis>0, <emphasis>/*weights=*/</emphasis>0, 
+				&amp;options);
+
+  <emphasis role="strong">if</emphasis> (options.info != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">printf</emphasis>(" %.3f", <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Special cases: check for empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 10, 0);
+  <emphasis role="strong"><link linkend='igraph_eigenvector_centrality'>igraph_eigenvector_centrality</link></emphasis>(&amp;g, &amp;v, &amp;value, 0, 0, 0, &amp;options);
+  <emphasis role="strong">if</emphasis> (value != 0.0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">printf</emphasis>(" %.2f", <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Special cases: check for full graph, zero weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 10, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, 45);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights, 0);
+  <emphasis role="strong"><link linkend='igraph_eigenvector_centrality'>igraph_eigenvector_centrality</link></emphasis>(&amp;g, &amp;v, &amp;value, 0, 0, &amp;weights, &amp;options);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong">if</emphasis> (value != 0.0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">printf</emphasis>(" %.2f", <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/even_tarjan.c.xml igraph-0.6.5/examples/simple/even_tarjan.c.xml
--- igraph-0.6.5~quantal1/examples/simple/even_tarjan.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/even_tarjan.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,65 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;limits.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g, gbar;
+  igraph_integer_t k1, k2 = (igraph_integer_t) INT_MAX;
+  igraph_real_t tmpk;
+  long int i, j, n;
+
+  <emphasis>/* --------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;g, "meredith");
+  <emphasis role="strong">igraph_even_tarjan_reduction</emphasis>(&amp;g, &amp;gbar, <emphasis>/*capacity=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_vertex_connectivity'>igraph_vertex_connectivity</link></emphasis>(&amp;g, &amp;k1, <emphasis>/* checks= */</emphasis> 0);
+
+  n=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">for</emphasis> (j=i+1; j&lt;n; j++) {
+      igraph_bool_t conn;
+      <emphasis role="strong"><link linkend='igraph_are_connected'>igraph_are_connected</link></emphasis>(&amp;g, i, j, &amp;conn);
+      <emphasis role="strong">if</emphasis> (conn) { <emphasis role="strong">continue</emphasis>; }
+      <emphasis role="strong"><link linkend='igraph_maxflow_value'>igraph_maxflow_value</link></emphasis>(&amp;gbar, &amp;tmpk, 
+			   <emphasis>/* source= */</emphasis> i + n, 
+			   <emphasis>/* target= */</emphasis> j, 
+			   <emphasis>/* capacity= */</emphasis> 0);
+      <emphasis role="strong">if</emphasis> (tmpk &lt; k2) { k2=tmpk; }
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;gbar);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">if</emphasis> (k1 != k2) {
+    <emphasis role="strong">printf</emphasis>("k1 = %ld while k2 = %ld\n", (long int) k1, (long int) k2);
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/flow.c.xml igraph-0.6.5/examples/simple/flow.c.xml
--- igraph-0.6.5~quantal1/examples/simple/flow.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/flow.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,121 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;sys/time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;sys/resource.h&gt;
+
+float <emphasis role="strong">timer</emphasis> ()
+{
+  <emphasis role="strong">struct</emphasis> rusage r;
+
+  <emphasis role="strong">getrusage</emphasis>(0, &amp;r);
+  <emphasis role="strong">return</emphasis> (float)(r.ru_utime.tv_sec+r.ru_utime.tv_usec/(float)1000000);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_real_t flow;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> capacity;
+  long int i;
+  igraph_integer_t source, target;
+  FILE *infile;
+  float t;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;capacity, 0);
+
+  <emphasis>/***************/</emphasis>
+  infile=<emphasis role="strong">fopen</emphasis>("ak-4102.max", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_dimacs'>igraph_read_graph_dimacs</link></emphasis>(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity,
+			   IGRAPH_DIRECTED);
+  <emphasis role="strong">fclose</emphasis>(infile);
+
+  t=<emphasis role="strong">timer</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_maxflow_value'>igraph_maxflow_value</link></emphasis>(&amp;g, &amp;flow, source, target, &amp;capacity);
+  t=<emphasis role="strong">timer</emphasis>()-t;
+<emphasis>/*   printf("4102: %g (time %.10f)\n", flow, t); */</emphasis>
+  <emphasis role="strong">if</emphasis> (flow != 8207) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+  <emphasis>/***************/</emphasis>
+
+<emphasis>/*   /\***************\/ */</emphasis>
+<emphasis>/*   infile=fopen("ak-8198.max", "r"); */</emphasis>
+<emphasis>/*   igraph_read_graph_dimacs(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity, */</emphasis>
+<emphasis>/* 			   IGRAPH_DIRECTED); */</emphasis>
+<emphasis>/*   fclose(infile); */</emphasis>
+
+<emphasis>/*   t=timer(); */</emphasis>
+<emphasis>/*   igraph_maxflow_value(&amp;g, &amp;flow, source, target, &amp;capacity); */</emphasis>
+<emphasis>/*   t=timer()-t; */</emphasis>
+<emphasis>/*   printf("8198: %g (time %.10f)\n", flow, t); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   /\***************\/ */</emphasis>
+
+<emphasis>/*   /\***************\/ */</emphasis>
+<emphasis>/*   infile=fopen("ak-16390.max", "r"); */</emphasis>
+<emphasis>/*   igraph_read_graph_dimacs(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity, */</emphasis>
+<emphasis>/* 			   IGRAPH_DIRECTED); */</emphasis>
+<emphasis>/*   fclose(infile); */</emphasis>
+
+<emphasis>/*   t=timer(); */</emphasis>
+<emphasis>/*   igraph_maxflow_value(&amp;g, &amp;flow, source, target, &amp;capacity); */</emphasis>
+<emphasis>/*   t=timer()-t; */</emphasis>
+<emphasis>/*   printf("16390: %g (time %.10f)\n", flow, t); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   /\***************\/ */</emphasis>
+
+<emphasis>/*   /\***************\/ */</emphasis>
+<emphasis>/*   infile=fopen("ak-32774.max", "r"); */</emphasis>
+<emphasis>/*   igraph_read_graph_dimacs(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity, */</emphasis>
+<emphasis>/* 			   IGRAPH_DIRECTED); */</emphasis>
+<emphasis>/*   fclose(infile); */</emphasis>
+
+<emphasis>/*   t=timer(); */</emphasis>
+<emphasis>/*   igraph_maxflow_value(&amp;g, &amp;flow, source, target, &amp;capacity); */</emphasis>
+<emphasis>/*   t=timer()-t; */</emphasis>
+<emphasis>/*   printf("32774: %g (time %.10f)\n", flow, t); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   /\***************\/ */</emphasis>
+
+<emphasis>/*   /\***************\/ */</emphasis>
+<emphasis>/*   infile=fopen("ak-65542.max", "r"); */</emphasis>
+<emphasis>/*   igraph_read_graph_dimacs(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity, */</emphasis>
+<emphasis>/* 			   IGRAPH_DIRECTED); */</emphasis>
+<emphasis>/*   fclose(infile); */</emphasis>
+
+<emphasis>/*   t=timer(); */</emphasis>
+<emphasis>/*   igraph_maxflow_value(&amp;g, &amp;flow, source, target, &amp;capacity); */</emphasis>
+<emphasis>/*   t=timer()-t; */</emphasis>
+<emphasis>/*   printf("65542: %g (time %.10f)\n", flow, t); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   /\***************\/ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;capacity);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/flow2.c.xml igraph-0.6.5/examples/simple/flow2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/flow2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/flow2.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,240 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">check_flow</emphasis>(int errorinc,
+	       <emphasis role="strong">const</emphasis> igraph_t *graph, igraph_real_t flow_value, 
+	       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *flow, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *cut, 
+	       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *partition,
+	       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *partition2, 
+	       long int source, long int target, 
+	       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *capacity, 
+	       igraph_bool_t print) {
+
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph), m=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(graph);
+  long int nc=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(cut);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> inedges, outedges;
+  igraph_bool_t directed=<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(graph);
+  igraph_real_t cutsize;
+  igraph_t graph_copy;
+  igraph_matrix_t sp;
+
+  <emphasis role="strong">if</emphasis> (print) {
+    <emphasis role="strong">printf</emphasis>("flow value: %g\n", (double) flow_value);
+    <emphasis role="strong">printf</emphasis>("flow: "); <emphasis role="strong">igraph_vector_print</emphasis>(flow);
+    <emphasis role="strong">printf</emphasis>("first partition:  "); <emphasis role="strong">igraph_vector_print</emphasis>(partition);
+    <emphasis role="strong">printf</emphasis>("second partition: "); <emphasis role="strong">igraph_vector_print</emphasis>(partition2);
+    <emphasis role="strong">printf</emphasis>("edges in the cut: ");
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;nc; i++) {
+      long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*cut)[i];
+      long int from=<emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge);
+      long int to  =<emphasis role="strong">IGRAPH_TO</emphasis>  (graph, edge);
+      <emphasis role="strong">if</emphasis> (!directed &amp;&amp; from &gt; to) {
+	igraph_integer_t tmp=from;
+	from=to;
+	to=tmp;
+      }
+      <emphasis role="strong">printf</emphasis>("%li-%li (%g), ", from, to, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*capacity)[edge]);
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+  <emphasis role="strong">fflush</emphasis>(stdout);
+        
+  <emphasis>/* Always less than the capacity */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;m; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*flow)[i] &gt; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*capacity)[i]) {
+      <emphasis role="strong">return</emphasis> errorinc+3;
+    }
+  }
+  
+  <emphasis>/* What comes in goes out, but only in directed graphs, </emphasis>
+<emphasis>     there is no in and out in undirected ones...</emphasis>
+<emphasis>   */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(graph)) {
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;inedges, 0);
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;outedges, 0);
+
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+      long int n1, n2, j;
+      igraph_real_t in_flow=0.0, out_flow=0.0;
+      <emphasis role="strong"><link linkend='igraph_incident'>igraph_incident</link></emphasis>(graph, &amp;inedges,  i, IGRAPH_IN);
+      <emphasis role="strong"><link linkend='igraph_incident'>igraph_incident</link></emphasis>(graph, &amp;outedges, i, IGRAPH_OUT);
+      n1=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;inedges);
+      n2=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;outedges);
+      <emphasis role="strong">for</emphasis> (j=0; j&lt;n1; j++) {
+	long int e=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(inedges)[j];
+	in_flow += <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*flow)[e];
+      }
+      <emphasis role="strong">for</emphasis> (j=0; j&lt;n2; j++) {
+	long int e=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(outedges)[j];
+	out_flow += <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*flow)[e];
+      }
+      <emphasis role="strong">if</emphasis> (i == source) {
+	<emphasis role="strong">if</emphasis> (in_flow &gt; 0) { <emphasis role="strong">return</emphasis> errorinc+4; }
+	<emphasis role="strong">if</emphasis> (out_flow != flow_value) { <emphasis role="strong">return</emphasis> errorinc+5; }
+      } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (i == target) {
+	<emphasis role="strong">if</emphasis> (out_flow &gt; 0) { <emphasis role="strong">return</emphasis> errorinc+6; }
+	<emphasis role="strong">if</emphasis> (in_flow != flow_value) { <emphasis role="strong">return</emphasis> errorinc+7; }
+	
+      } <emphasis role="strong">else</emphasis> {
+	<emphasis role="strong">if</emphasis> (in_flow != out_flow) { <emphasis role="strong">return</emphasis> errorinc+8; }
+      }
+    }
+    
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inedges);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outedges);
+  }
+
+  <emphasis>/* Check the minimum cut size*/</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0, cutsize=0.0; i&lt;nc; i++) {
+    long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*cut)[i];
+    cutsize += <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*capacity)[edge];
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(cutsize-flow_value) &gt; 1e-14) { <emphasis role="strong">return</emphasis> errorinc+9; }
+
+  <emphasis>/* Check that the cut indeed cuts */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;graph_copy, graph);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;graph_copy, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(cut));
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;sp, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_shortest_paths'>igraph_shortest_paths</link></emphasis>(&amp;graph_copy, &amp;sp, <emphasis>/*from=*/</emphasis> <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(source),
+			<emphasis>/*to=*/</emphasis> <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(target), IGRAPH_OUT);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(sp, 0, 0) != IGRAPH_INFINITY) { <emphasis role="strong">return</emphasis> errorinc+10; }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;sp);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph_copy);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_real_t flow_value;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> cut;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> capacity;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> partition, partition2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> flow;
+  long int i, n;
+  igraph_integer_t source, target;
+  FILE *infile;
+  igraph_real_t flow_value2=0.0;
+  int check;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;capacity, 0);
+
+  <emphasis>/***************/</emphasis>
+  infile=<emphasis role="strong">fopen</emphasis>("ak-4102.max", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_dimacs'>igraph_read_graph_dimacs</link></emphasis>(&amp;g, infile, 0, 0, &amp;source, &amp;target, &amp;capacity,
+  			   IGRAPH_DIRECTED);
+  <emphasis role="strong">fclose</emphasis>(infile);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;cut, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;flow, 0);
+
+  <emphasis role="strong"><link linkend='igraph_maxflow'>igraph_maxflow</link></emphasis>(&amp;g, &amp;flow_value, &amp;flow, &amp;cut, &amp;partition,
+  		 &amp;partition2, source, target, &amp;capacity);
+
+  <emphasis role="strong">if</emphasis> (flow_value != 8207) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;cut);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    long int e=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(cut)[i];
+    flow_value2 += <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(capacity)[e];
+  }
+  <emphasis role="strong">if</emphasis> (flow_value != flow_value2) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* Check the flow */</emphasis>
+  <emphasis role="strong">if</emphasis> ( (check=<emphasis role="strong">check_flow</emphasis>(0, &amp;g, flow_value, &amp;flow, &amp;cut, &amp;partition,
+			 &amp;partition2, source, target, &amp;capacity, 
+			 <emphasis>/*print=*/</emphasis> 0))) {
+    <emphasis role="strong">return</emphasis> check;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;capacity);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cut);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;flow);
+
+  <emphasis>/* ------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 4, IGRAPH_UNDIRECTED,
+	       0,1,0,2,1,2,1,3,2,3, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;capacity, -1, 4,2,10,2,2, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;cut, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;flow, 0);
+
+  <emphasis role="strong"><link linkend='igraph_maxflow'>igraph_maxflow</link></emphasis>(&amp;g, &amp;flow_value, &amp;flow, &amp;cut, &amp;partition, &amp;partition2, 
+		 <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 3, &amp;capacity);
+
+  <emphasis role="strong">if</emphasis> ( (check=<emphasis role="strong">check_flow</emphasis>(20, &amp;g, flow_value, &amp;flow, &amp;cut, &amp;partition,
+			 &amp;partition2, 0, 3, &amp;capacity, 
+			 <emphasis>/*print=*/</emphasis> 1))) {
+    <emphasis role="strong">return</emphasis> check;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cut);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;capacity);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;flow);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_DIRECTED,
+	       0,1,1,2,2,3, 0,5,5,4,4,3, 3,0, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;capacity, -1, 3,1,2, 10,1,3, 2, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;cut, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;flow, 0);
+
+  <emphasis role="strong"><link linkend='igraph_maxflow'>igraph_maxflow</link></emphasis>(&amp;g, &amp;flow_value, &amp;flow, &amp;cut, &amp;partition, &amp;partition2, 
+		 <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2, &amp;capacity);
+
+  <emphasis role="strong">if</emphasis> ( (check=<emphasis role="strong">check_flow</emphasis>(40, &amp;g, flow_value, &amp;flow, &amp;cut, &amp;partition,
+			 &amp;partition2, 0, 2, &amp;capacity, 
+			 <emphasis>/*print=*/</emphasis> 1))) {
+    <emphasis role="strong">return</emphasis> check;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cut);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;capacity);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;flow);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/foreign.c.xml igraph-0.6.5/examples/simple/foreign.c.xml
--- igraph-0.6.5~quantal1/examples/simple/foreign.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/foreign.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,47 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>(int argc, char **argv) {
+
+  igraph_t g;
+  FILE *ifile;
+
+  <emphasis>/* PAJEK */</emphasis>
+  ifile=<emphasis role="strong">fopen</emphasis>("LINKS.NET", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong">printf</emphasis>("The graph:\n");
+  <emphasis role="strong">printf</emphasis>("Vertices: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Edges: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Directed: %i\n", (int) <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/gml.c.xml igraph-0.6.5/examples/simple/gml.c.xml
--- igraph-0.6.5~quantal1/examples/simple/gml.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/gml.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  FILE *ifile;
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("karate.gml", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_read_graph_gml'>igraph_read_graph_gml</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">printf</emphasis>("directed\n");
+  } <emphasis role="strong">else</emphasis> {
+    <emphasis role="strong">printf</emphasis>("undirected\n");
+  }
+    
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">printf</emphasis>("-----------------\n");
+  <emphasis role="strong"><link linkend='igraph_write_graph_gml'>igraph_write_graph_gml</link></emphasis>(&amp;g, stdout, 0, "test suite");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/graphml.c.xml igraph-0.6.5/examples/simple/graphml.c.xml
--- igraph-0.6.5~quantal1/examples/simple/graphml.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/graphml.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,99 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;unistd.h&gt;		<emphasis>/* unlink */</emphasis>
+
+void <emphasis role="strong">custom_warning_handler</emphasis> (<emphasis role="strong">const</emphasis> char *reason, <emphasis role="strong">const</emphasis> char *file,
+			     int line, int igraph_errno) {
+  <emphasis role="strong">printf</emphasis>("Warning: %s\n", reason);
+}
+
+int <emphasis role="strong">main</emphasis>(int argc, char **argv) {
+  igraph_t g;
+  <link linkend='igraph_error_handler_t'>igraph_error_handler_t</link>* oldhandler;
+  <link linkend='igraph_warning_handler_t'>igraph_warning_handler_t</link>* oldwarnhandler;
+  int result;
+  FILE *ifile, *ofile;
+
+  <emphasis>/* GraphML */</emphasis>
+  ifile=<emphasis role="strong">fopen</emphasis>("test.gxl", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  
+  oldhandler=<emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  oldwarnhandler=<emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(custom_warning_handler);
+  <emphasis role="strong">if</emphasis> (result=<emphasis role="strong"><link linkend='igraph_read_graph_graphml'>igraph_read_graph_graphml</link></emphasis>(&amp;g, ifile, 0)) {
+    <emphasis>// maybe it is simply disabled at compile-time</emphasis>
+    <emphasis role="strong">if</emphasis> (result == IGRAPH_UNIMPLEMENTED) <emphasis role="strong">return</emphasis> 77;
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(oldhandler);
+
+  <emphasis role="strong">fclose</emphasis>(ifile);
+
+  <emphasis>/* Write it back */</emphasis>
+  ofile=<emphasis role="strong">fopen</emphasis>("test2.gxl", "w");
+  <emphasis>/* If we can't create the test file, just skip the test */</emphasis>
+  <emphasis role="strong">if</emphasis> (ofile) {
+    <emphasis role="strong">if</emphasis> (result=<emphasis role="strong"><link linkend='igraph_write_graph_graphml'>igraph_write_graph_graphml</link></emphasis>(&amp;g, ofile)) {
+      <emphasis role="strong">return</emphasis> 1;
+    }
+    <emphasis role="strong">fclose</emphasis>(ofile);
+    <emphasis role="strong">unlink</emphasis>("test2.gxl");
+  }
+  
+  <emphasis role="strong">printf</emphasis>("The directed graph:\n");
+  <emphasis role="strong">printf</emphasis>("Vertices: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Edges: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Directed: %i\n", (int) <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+ 
+  <emphasis>/* The same with undirected graph */</emphasis>
+  ifile=<emphasis role="strong">fopen</emphasis>("test.gxl", "r");
+  <emphasis role="strong">if</emphasis> (result=<emphasis role="strong"><link linkend='igraph_read_graph_graphml'>igraph_read_graph_graphml</link></emphasis>(&amp;g, ifile, 0)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong">printf</emphasis>("The undirected graph:\n");
+  <emphasis role="strong">printf</emphasis>("Vertices: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Edges: %li\n", (long int) <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong">printf</emphasis>("Directed: %i\n", (int) <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(oldwarnhandler);
+
+  <emphasis>/* There were sometimes problems with this file */</emphasis>
+  <emphasis>/* Only if called from R though, and only on random occasions, once in every </emphasis>
+<emphasis>     ten reads. Do testing here doesn't make much sense, but if we have the file </emphasis>
+<emphasis>     then let's do it anyway. */</emphasis>
+  ifile=<emphasis role="strong">fopen</emphasis>("graphml-hsa05010.xml", "r");  
+  <emphasis role="strong"><link linkend='igraph_read_graph_graphml'>igraph_read_graph_graphml</link></emphasis>(&amp;g, ifile, 0);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/heap.c.xml igraph-0.6.5/examples/simple/heap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/heap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/heap.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,32 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis>/* This is not used by any functions any more,</emphasis>
+<emphasis>     no need to test it right now */</emphasis>
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_add_edges.c.xml igraph-0.6.5/examples/simple/igraph_add_edges.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_add_edges.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_add_edges.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,93 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  int ret;
+
+  <emphasis>/* Create graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 1);
+
+  <emphasis>/* Add edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 4);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=3;
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;v, 0);
+  
+  <emphasis>/* Check result */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis>/* Error, vector length */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=2;
+  ret=<emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVEVECTOR) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis>/* Check result */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis>/* Error, vector ids */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 4);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=4;
+  ret=<emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 2;
+  }  
+
+  <emphasis>/* Check result */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_add_vertices.c.xml igraph-0.6.5/examples/simple/igraph_add_vertices.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_add_vertices.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_add_vertices.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,64 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g1;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v1;
+  int ret;
+
+  <emphasis>/* Create a graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v1, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v1, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* Add more vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g1, 10, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g1) != 14) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* Add more vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g1, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g1) != 14) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis>/* Error */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g1, -1, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_adjacency.c.xml igraph-0.6.5/examples/simple/igraph_adjacency.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_adjacency.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_adjacency.c.xml	2013-03-03 01:45:47.000000000 +0000
@@ -0,0 +1,30 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_all_st_cuts.c.xml igraph-0.6.5/examples/simple/igraph_all_st_cuts.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_all_st_cuts.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_all_st_cuts.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,376 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_marked_queue.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_estack.h&gt;
+
+int <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph,
+			       <emphasis role="strong">const</emphasis> igraph_marked_queue_t *S,
+			       <emphasis role="strong">const</emphasis> igraph_estack_t *T,
+			       long int source,
+			       long int target,
+			       long int *v,
+			       <link linkend='igraph_vector_t'>igraph_vector_t</link> *Isv);
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_vector_ptr_t cuts, partition1s;
+  long int i, n;
+
+  igraph_marked_queue_t S;
+  igraph_estack_t T;
+  long int v;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> Isv;
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+  <emphasis>/* This is the example from the Provan-Shier paper, </emphasis>
+<emphasis>     for calculating the dominator tree and finding the right pivot </emphasis>
+<emphasis>     element */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 12, IGRAPH_DIRECTED,
+  	       <emphasis>/* a-&gt;b */</emphasis> 0,1,
+  	       <emphasis>/* b-&gt;t */</emphasis> 1,11,
+  	       <emphasis>/* c-&gt;b */</emphasis> 2,1,  <emphasis>/* c-&gt;d */</emphasis> 2,3,
+  	       <emphasis>/* d-&gt;e */</emphasis> 3,4,  <emphasis>/* d-&gt;i */</emphasis> 3,8,
+  	       <emphasis>/* e-&gt;c */</emphasis> 4,2,
+  	       <emphasis>/* f-&gt;c */</emphasis> 5,2,  <emphasis>/* f-&gt;e */</emphasis> 5,4,
+  	       <emphasis>/* g-&gt;d */</emphasis> 6,3,  <emphasis>/* g-&gt;e */</emphasis> 6,4,  <emphasis>/* g-&gt;f */</emphasis> 6,5,
+  	                        <emphasis>/* g-&gt;j */</emphasis> 6,9,
+  	       <emphasis>/* h-&gt;g */</emphasis> 7,6,  <emphasis>/* h-&gt;t */</emphasis> 7,11,
+  	       <emphasis>/* i-&gt;a */</emphasis> 8,0,
+  	       <emphasis>/* j-&gt;i */</emphasis> 9,8,
+  	       <emphasis>/* s-&gt;a */</emphasis> 10,0, <emphasis>/* s-&gt;c */</emphasis> 10,2, <emphasis>/* s-&gt;h */</emphasis> 10,7,
+  	       -1);
+  
+  <emphasis>/* S={s,a} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_marked_queue_start_batch</emphasis>(&amp;S);
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 10);
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 0);
+  
+  <emphasis>/* T={t} */</emphasis>
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 1);
+  <emphasis role="strong">igraph_estack_push</emphasis>(&amp;T, 11);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 10, <emphasis>/*target=*/</emphasis> 11,
+  				&amp;v, &amp;Isv);
+
+  <emphasis>/* Expected result: v=c, Isv={c,d,e,i} */</emphasis>
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+  
+  <emphasis>/* S={}, T={} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 3);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2,
+  				&amp;v, &amp;Isv);
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+  
+  <emphasis>/* S={}, T={0} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 3);
+  <emphasis role="strong">igraph_estack_push</emphasis>(&amp;T, 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2,
+  				&amp;v, &amp;Isv);
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+  
+  <emphasis>/* S={0}, T={} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 0);
+
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 3);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2,
+  				&amp;v, &amp;Isv);
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+  
+  <emphasis>/* S={0}, T={1} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 0);
+
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 3);
+  <emphasis role="strong">igraph_estack_push</emphasis>(&amp;T, 1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2,
+  				&amp;v, &amp;Isv);
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+  
+  <emphasis>/* S={0,1}, T={} */</emphasis>
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;S, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 0);
+  <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;S, 1);
+
+  <emphasis role="strong">igraph_estack_init</emphasis>(&amp;T, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 3);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;Isv, 0);
+  <emphasis role="strong">igraph_i_all_st_cuts_pivot</emphasis>(&amp;g, &amp;S, &amp;T,
+  				<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2,
+  				&amp;v, &amp;Isv);
+  <emphasis role="strong">printf</emphasis>("%li; ", v);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;Isv);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;Isv);
+  <emphasis role="strong">igraph_estack_destroy</emphasis>(&amp;T);
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;S);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,1, 1,2,
+  	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, <emphasis>/*cuts=*/</emphasis> 0, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 2);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED,
+  	       0,1, 1,2, 1,3, 2,4, 3,4,
+  	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, <emphasis>/*cuts=*/</emphasis> 0, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 4);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_DIRECTED,
+  	       0,1, 1,2, 1,3, 2,4, 3,4, 1,5, 5,4,
+  	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, &amp;cuts, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 4);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">printf</emphasis>("Partitions and cuts:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v2=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(cuts)[i];
+    <emphasis role="strong">printf</emphasis>("P: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+    <emphasis role="strong">printf</emphasis>("C: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v2);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cuts);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_DIRECTED,
+  	       0,2, 1,2,
+  	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, &amp;cuts, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 1, <emphasis>/*target=*/</emphasis> 2);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">printf</emphasis>("Partitions and cuts:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v2=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(cuts)[i];
+    <emphasis role="strong">printf</emphasis>("P: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+    <emphasis role="strong">printf</emphasis>("C: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v2);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cuts);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED,
+	       0,1, 1,2, 2,3, 3,4, 3,1,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, &amp;cuts, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 4);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">printf</emphasis>("Partitions and cuts:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v2=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(cuts)[i];
+    <emphasis role="strong">printf</emphasis>("P: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+    <emphasis role="strong">printf</emphasis>("C: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v2);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cuts);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 7, IGRAPH_DIRECTED,
+	       0,1,0,2, 1,3,2,3,
+	       1,4,1,5,1,6, 
+	       4,2,5,2,6,2,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partition1s, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_cuts'>igraph_all_st_cuts</link></emphasis>(&amp;g, &amp;cuts, &amp;partition1s,
+		     <emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 3);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong">printf</emphasis>("Partitions and cuts:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(partition1s)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v2=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(cuts)[i];
+    <emphasis role="strong">printf</emphasis>("P: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+    <emphasis role="strong">printf</emphasis>("C: ");
+    <emphasis role="strong">igraph_vector_print</emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v2);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v2);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;partition1s);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cuts);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_all_st_mincuts.c.xml igraph-0.6.5/examples/simple/igraph_all_st_mincuts.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_all_st_mincuts.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_all_st_mincuts.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,105 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_and_destroy</emphasis>(igraph_real_t value, 
+		      igraph_vector_ptr_t *partitions, 
+		      igraph_vector_ptr_t *cuts) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(partitions);
+  <emphasis role="strong">printf</emphasis>("Value: %g\n", value);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *vec=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*partitions)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *vec2=cuts ? <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*cuts)[i] : 0;
+    <emphasis role="strong">printf</emphasis>("Partition: "); <emphasis role="strong">igraph_vector_print</emphasis>(vec);
+    <emphasis role="strong">if</emphasis> (vec2) { <emphasis role="strong">printf</emphasis>("Cut: "); <emphasis role="strong">igraph_vector_print</emphasis>(vec2); }
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(vec);
+    <emphasis role="strong">if</emphasis> (vec2) { <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(vec2); }
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(vec);
+    <emphasis role="strong">if</emphasis> (vec2) { <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(vec2); }
+  }  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(partitions);
+  <emphasis role="strong">if</emphasis> (cuts) { <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(cuts); }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_vector_ptr_t partitions;
+  igraph_vector_ptr_t cuts;
+  igraph_real_t value;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED,
+  	       0,1, 1,2, 2,3, 3,4,
+  	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partitions, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_mincuts'>igraph_all_st_mincuts</link></emphasis>(&amp;g, &amp;value, &amp;cuts, &amp;partitions,
+  			<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 4,
+  			<emphasis>/*capacity=*/</emphasis> 0);
+  
+  <emphasis role="strong">print_and_destroy</emphasis>(value, &amp;partitions, &amp;cuts);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_DIRECTED, 0,1, 1,2, 1,3, 2,4, 3,4, 4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partitions, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_mincuts'>igraph_all_st_mincuts</link></emphasis>(&amp;g, &amp;value, &amp;cuts, &amp;partitions,
+  			<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 5, <emphasis>/*capacity=*/</emphasis> 0);
+
+  <emphasis role="strong">print_and_destroy</emphasis>(value, &amp;partitions, &amp;cuts);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_DIRECTED, 0,1, 1,2, 1,3, 2,4, 3,4, 4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partitions, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_mincuts'>igraph_all_st_mincuts</link></emphasis>(&amp;g, &amp;value, &amp;cuts, &amp;partitions,
+  			<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 4, <emphasis>/*capacity=*/</emphasis> 0);
+
+  <emphasis role="strong">print_and_destroy</emphasis>(value, &amp;partitions, &amp;cuts);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 9, IGRAPH_DIRECTED, 0,1, 0,2, 1,3, 2,3,
+	       1,4,4,2, 1,5,5,2, 1,6,6,2, 1,7,7,2, 1,8,8,2,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;partitions, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cuts, 0);
+  <emphasis role="strong"><link linkend='igraph_all_st_mincuts'>igraph_all_st_mincuts</link></emphasis>(&amp;g, &amp;value, &amp;cuts, &amp;partitions,
+  			<emphasis>/*source=*/</emphasis> 0, <emphasis>/*target=*/</emphasis> 3, <emphasis>/*capacity=*/</emphasis> 0);
+
+  <emphasis role="strong">print_and_destroy</emphasis>(value, &amp;partitions, &amp;cuts);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+ 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_are_connected.c.xml igraph-0.6.5/examples/simple/igraph_are_connected.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_are_connected.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_are_connected.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,109 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for whether two vertices are connected by an edge.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">R_INTEGER</emphasis>(a,b) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), (a), (b)))
+
+<emphasis>/* Crash the library function here. We expect error codes to be returned here.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_test</emphasis>() {
+  igraph_t g;
+  igraph_bool_t connected;
+  igraph_integer_t nvert, u, v;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert*/</emphasis> 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  u = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(-100*nvert, 100*nvert);
+  v = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(nvert, 100*nvert);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret = <emphasis role="strong"><link linkend='igraph_are_connected'>igraph_are_connected</link></emphasis>(&amp;g, u, v, &amp;connected);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">printf</emphasis>("Error test failed.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* Testing for two vertices being connected by an edge in various graphs.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">connected_test</emphasis>() {
+  igraph_t gcomplete, gempty;
+  igraph_bool_t connected;
+  igraph_integer_t nvert, u, v;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+
+  <emphasis>/* A complete graph on n vertices. Any two distinct vertices are connected */</emphasis>
+  <emphasis>/* by an edge. Hence we expect the test to return true for any given pair */</emphasis>
+  <emphasis>/* of distinct vertices. */</emphasis>
+  nvert = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(2, 100);
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;gcomplete, nvert, IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  u = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(0, nvert - 1);
+  <emphasis role="strong">do</emphasis> {
+    v = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(0, nvert - 1);
+  } <emphasis role="strong">while</emphasis> (v == u);
+  <emphasis role="strong"><link linkend='igraph_are_connected'>igraph_are_connected</link></emphasis>(&amp;gcomplete, u, v, &amp;connected);
+  <emphasis role="strong">if</emphasis> (!connected) {
+    <emphasis role="strong">printf</emphasis>("Expected connected = true, but received connected = false.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;gcomplete);
+
+  <emphasis>/* A graph with n vertices, but no edges. Any two distinct vertices are */</emphasis>
+  <emphasis>/* not joined by an edge. Thus we expect the test to return false for any */</emphasis>
+  <emphasis>/* given pair of distinct vertices. */</emphasis>
+  nvert = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(2, 100);
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;gempty, nvert, IGRAPH_DIRECTED);
+  u = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(0, nvert - 1);
+  <emphasis role="strong">do</emphasis> {
+    v = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(0, nvert - 1);
+  } <emphasis role="strong">while</emphasis> (v == u);
+  <emphasis role="strong"><link linkend='igraph_are_connected'>igraph_are_connected</link></emphasis>(&amp;gempty, u, v, &amp;connected);
+  <emphasis role="strong">if</emphasis> (connected) {
+    <emphasis role="strong">printf</emphasis>("Expected connected = false, but received connected = true.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;gempty);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  ret = <emphasis role="strong">connected_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_arpack_rnsolve.c.xml igraph-0.6.5/examples/simple/igraph_arpack_rnsolve.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_arpack_rnsolve.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_arpack_rnsolve.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,131 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> cb2_data_t {
+  igraph_matrix_t *A;
+} cb2_data_t;
+
+int <emphasis role="strong">cb2</emphasis>(igraph_real_t *to, <emphasis role="strong">const</emphasis> igraph_real_t *from, int n, void *extra) {
+  cb2_data_t *data=(cb2_data_t*) extra;
+  <emphasis role="strong"><link linkend='igraph_blas_dgemv_array'>igraph_blas_dgemv_array</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1.0, 
+			  data-&gt;A, from, <emphasis>/*beta=*/</emphasis> 0.0, to);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t A;
+  igraph_matrix_t values, vectors;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  cb2_data_t data = { &amp;A };  
+  int i, j;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42 * 42);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), -10, 10);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+  options.n=DIM;
+  options.start=0;
+  options.nev=4;
+  options.ncv=9;
+  options.which[0]='L' ; options.which[1]='M';
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;values, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, options.n, 1);
+
+  <emphasis role="strong"><link linkend='igraph_arpack_rnsolve'>igraph_arpack_rnsolve</link></emphasis>(cb2, <emphasis>/*extra=*/</emphasis> &amp;data, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+			&amp;values, &amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1) &gt; 0) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1) = -<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 3, 1) = -<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 3, 1);    
+  }
+
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* -------------- */</emphasis>
+
+  options.nev=3;
+  options.which[0]='L' ; options.which[1]='M';
+
+  <emphasis role="strong"><link linkend='igraph_arpack_rnsolve'>igraph_arpack_rnsolve</link></emphasis>(cb2, <emphasis>/*extra=*/</emphasis> &amp;data, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+			&amp;values, &amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1) &gt; 0) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1) = -<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(values, 2, 1);
+  }
+
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* -------------- */</emphasis>
+
+  options.nev=3;
+  options.which[0]='S' ; options.which[1]='R';
+
+  <emphasis role="strong"><link linkend='igraph_arpack_rnsolve'>igraph_arpack_rnsolve</link></emphasis>(cb2, <emphasis>/*extra=*/</emphasis> &amp;data, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+			&amp;values, &amp;vectors);
+
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* -------------- */</emphasis>
+
+  options.nev=3;
+  options.which[0]='L' ; options.which[1]='I';
+
+  <emphasis role="strong"><link linkend='igraph_arpack_rnsolve'>igraph_arpack_rnsolve</link></emphasis>(cb2, <emphasis>/*extra=*/</emphasis> &amp;data, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+			&amp;values, &amp;vectors);
+
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+			
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_array.c.xml igraph-0.6.5/examples/simple/igraph_array.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_array.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_array.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,86 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+void <emphasis role="strong">print_array</emphasis>(<emphasis role="strong">const</emphasis> igraph_array3_t *a, FILE *f) {
+  long int i,j,k;
+  <emphasis role="strong">for</emphasis> (k=0; k&lt;<emphasis role="strong">igraph_array3_n</emphasis>(a, 3); k++) {
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_array3_n</emphasis>(a, 1); i++) {
+      <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong">igraph_array3_n</emphasis>(a, 2); j++) {
+	<emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong">ARRAY3</emphasis>(*a, i, j, k));
+      }
+      <emphasis role="strong">fprintf</emphasis>(f, "\n");
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_array3_t a;
+  long int i,j,k;
+  long int s=1;
+  
+  <emphasis role="strong">igraph_array3_init</emphasis>(&amp;a, 5,4,3);
+  <emphasis role="strong">igraph_array3_destroy</emphasis>(&amp;a);
+
+  <emphasis role="strong">igraph_array3_init</emphasis>(&amp;a, 5,4,3);
+  <emphasis role="strong">print_array</emphasis>(&amp;a, stdout);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a, 1) != 5) { 
+    <emphasis role="strong">return</emphasis> 1;
+  } 
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a, 2) != 4) { 
+    <emphasis role="strong">return</emphasis> 1;
+  } 
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a, 3) != 3) { 
+    <emphasis role="strong">return</emphasis> 1;
+  } 
+  <emphasis role="strong">igraph_array3_destroy</emphasis>(&amp;a);
+
+  <emphasis role="strong">igraph_array3_init</emphasis>(&amp;a,5,4,3);
+  <emphasis role="strong">for</emphasis> (k=0; k&lt;<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a,3); k++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a,2); j++) {
+      <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_array3_n</emphasis>(&amp;a,1); i++) {
+	<emphasis role="strong">ARRAY3</emphasis>(a,i,j,k) = s++;
+      }
+    }
+  }
+  <emphasis role="strong">print_array</emphasis>(&amp;a,stdout);
+  <emphasis role="strong">print_vector</emphasis>(&amp;a.data, stdout);
+  <emphasis role="strong">igraph_array3_destroy</emphasis>(&amp;a);
+  
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 2;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_atlas.c.xml igraph-0.6.5/examples/simple/igraph_atlas.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_atlas.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_atlas.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,59 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_atlas'>igraph_atlas</link></emphasis>(&amp;g, 45);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_atlas'>igraph_atlas</link></emphasis>(&amp;g, 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_atlas'>igraph_atlas</link></emphasis>(&amp;g, 1252);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_atlas'>igraph_atlas</link></emphasis>(&amp;g, -1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  ret=<emphasis role="strong"><link linkend='igraph_atlas'>igraph_atlas</link></emphasis>(&amp;g, 1253);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_average_path_length.c.xml igraph-0.6.5/examples/simple/igraph_average_path_length.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_average_path_length.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_average_path_length.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,41 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_real_t result;
+  
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 30, <emphasis>/*power=*/</emphasis> 1, 30, 0, 0, <emphasis>/*A=*/</emphasis> 1, 
+		       IGRAPH_DIRECTED, IGRAPH_BARABASI_BAG,
+		       <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_average_path_length'>igraph_average_path_length</link></emphasis>(&amp;g, &amp;result, IGRAPH_UNDIRECTED, 1);
+  
+<emphasis>/*   printf("Length of the average shortest paths: %f\n", (float) result); */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_barabasi_game.c.xml igraph-0.6.5/examples/simple/igraph_barabasi_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_barabasi_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_barabasi_game.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,119 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, v2;
+  int i, ret;
+  
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 10, <emphasis>/*power=*/</emphasis> 1, 2, 0, 0, <emphasis>/*A=*/</emphasis> 1, 1, 
+		       IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 18) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2*i] &lt;= <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2*i+1]) {
+      <emphasis role="strong">return</emphasis> 4;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* out degree sequence */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=5;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=6; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=7;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[8]=8; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[9]=9;
+  
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 10, <emphasis>/*power=*/</emphasis> 1, 0, &amp;v, 0, <emphasis>/*A=*/</emphasis> 1, 1, 
+		       IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != <emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v2, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[i]) {
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;v);
+      <emphasis role="strong">printf</emphasis>("\n");
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;v2);
+      <emphasis role="strong">return</emphasis> 6;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* outpref, we cannot really test this quantitatively,</emphasis>
+<emphasis>     would need to set random seed */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 10, <emphasis>/*power=*/</emphasis> 1, 2, 0, 1, <emphasis>/*A=*/</emphasis> 1, 1,
+		       IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2*i] &lt;= <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2*i+1]) {
+      <emphasis role="strong">return</emphasis> 7;
+    }
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Error tests */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, -10, <emphasis>/*power=*/</emphasis> 1, 1, 0, 0, <emphasis>/*A=*/</emphasis> 1, 0, 
+			   IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  ret=<emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 10, <emphasis>/*power=*/</emphasis> 1, -2, 0, 0, <emphasis>/*A=*/</emphasis> 1, 0,
+			   IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 9);
+  ret=<emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 10, <emphasis>/*power=*/</emphasis> 1, 0, &amp;v, 0, <emphasis>/*A=*/</emphasis> 1, 0,
+			   IGRAPH_BARABASI_BAG, <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_barabasi_game2.c.xml igraph-0.6.5/examples/simple/igraph_barabasi_game2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_barabasi_game2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_barabasi_game2.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,93 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_bool_t simple;
+
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(<emphasis>/* graph=    */</emphasis> &amp;g, 
+		       <emphasis>/* n=        */</emphasis> 100,
+		       <emphasis>/* power=    */</emphasis> 1.0,
+		       <emphasis>/* m=        */</emphasis> 2,
+		       <emphasis>/* outseq=   */</emphasis> 0,
+		       <emphasis>/* outpref=  */</emphasis> 0,
+		       <emphasis>/* A=        */</emphasis> 1.0,
+		       <emphasis>/* directed= */</emphasis> IGRAPH_DIRECTED,
+		       <emphasis>/* algo=     */</emphasis> IGRAPH_BARABASI_PSUMTREE,
+		       <emphasis>/* start_from= */</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 197) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 3; }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* ============================== */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(<emphasis>/* graph=    */</emphasis> &amp;g, 
+		       <emphasis>/* n=        */</emphasis> 100,
+		       <emphasis>/* power=    */</emphasis> 1.0,
+		       <emphasis>/* m=        */</emphasis> 2,
+		       <emphasis>/* outseq=   */</emphasis> 0,
+		       <emphasis>/* outpref=  */</emphasis> 0,
+		       <emphasis>/* A=        */</emphasis> 1.0,
+		       <emphasis>/* directed= */</emphasis> IGRAPH_DIRECTED,
+		       <emphasis>/* algo=     */</emphasis> IGRAPH_BARABASI_PSUMTREE_MULTIPLE,
+		       <emphasis>/* start_from= */</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 198) { <emphasis role="strong">return</emphasis> 4; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (simple) { <emphasis role="strong">return</emphasis> 6; }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ============================== */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(<emphasis>/* graph=    */</emphasis> &amp;g, 
+		       <emphasis>/* n=        */</emphasis> 100,
+		       <emphasis>/* power=    */</emphasis> 1.0,
+		       <emphasis>/* m=        */</emphasis> 2,
+		       <emphasis>/* outseq=   */</emphasis> 0,
+		       <emphasis>/* outpref=  */</emphasis> 0,
+		       <emphasis>/* A=        */</emphasis> 1.0,
+		       <emphasis>/* directed= */</emphasis> IGRAPH_DIRECTED,
+		       <emphasis>/* algo=     */</emphasis> IGRAPH_BARABASI_BAG,
+		       <emphasis>/* start_from= */</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 198) { <emphasis role="strong">return</emphasis> 7; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (simple) { <emphasis role="strong">return</emphasis> 9; }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);    
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_betweenness.c.xml igraph-0.6.5/examples/simple/igraph_betweenness.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_betweenness.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_betweenness.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,141 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> bet, bet2, weights, edges;
+  
+  igraph_real_t nontriv[] = { 0, 19, 0, 16, 0, 20, 1, 19, 2, 5, 3, 7, 3, 8, 
+			      4, 15, 4, 11, 5, 8, 5, 19, 6, 7, 6, 10, 6, 8, 
+			      6, 9, 7, 20, 9, 10, 9, 20, 10, 19, 
+			      11, 12, 11, 20, 12, 15, 13, 15, 
+			      14, 18, 14, 16, 14, 17, 15, 16, 17, 18 };
+  
+  igraph_real_t nontriv_weights[] = { 0.5249, 1, 0.1934, 0.6274, 0.5249, 
+				      0.0029, 0.3831, 0.05, 0.6274, 0.3831, 
+				      0.5249, 0.0587, 0.0579, 0.0562, 0.0562, 
+				      0.1934, 0.6274, 0.6274, 0.6274, 0.0418, 
+				      0.6274, 0.3511, 0.3511, 0.1486, 1, 1, 
+				      0.0711, 0.2409 };
+
+  igraph_real_t nontriv_res[] = { 20, 0, 0, 0, 0, 19, 80, 85, 32, 0, 10, 
+				  75, 70, 0, 36, 81, 60, 0, 19, 19, 86 };
+
+  <emphasis>/*******************************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(<emphasis>/* graph= */</emphasis>    &amp;g,
+		       <emphasis>/* n= */</emphasis>        1000,
+		       <emphasis>/* power= */</emphasis>    1,
+		       <emphasis>/* m= */</emphasis>        3,
+		       <emphasis>/* outseq= */</emphasis>   0,
+		       <emphasis>/* outpref= */</emphasis>  0,
+		       <emphasis>/* A= */</emphasis>        1,
+		       <emphasis>/* directed= */</emphasis> 0,
+		       <emphasis>/* algo= */</emphasis>     IGRAPH_BARABASI_BAG,
+		       <emphasis>/* start_from= */</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/* multiple= */</emphasis> 1, <emphasis>/* loops= */</emphasis> 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 2,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*******************************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 20000, 10, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> 0, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights, 1.0);
+  
+  <emphasis role="strong"><link linkend='igraph_betweenness_estimate'>igraph_betweenness_estimate</link></emphasis>(<emphasis>/* graph=     */</emphasis> &amp;g,
+			      <emphasis>/* res=       */</emphasis> &amp;bet2,
+			      <emphasis>/* vids=      */</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			      <emphasis>/* directed = */</emphasis> 0,
+			      <emphasis>/* cutoff=    */</emphasis> 3,
+			      <emphasis>/* weights=   */</emphasis> &amp;weights, 
+			      <emphasis>/* nobigint=  */</emphasis> 1);
+
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;bet, &amp;bet2)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Non-trivial weighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges, nontriv, <emphasis role="strong">sizeof</emphasis>(nontriv)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;edges, 0, <emphasis>/* directed= */</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, nontriv_weights, 
+		     <emphasis role="strong">sizeof</emphasis>(nontriv_weights)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;bet, 0);
+
+  <emphasis role="strong"><link linkend='igraph_betweenness'>igraph_betweenness</link></emphasis>(<emphasis>/*graph=*/</emphasis> &amp;g, <emphasis>/*res=*/</emphasis> &amp;bet, <emphasis>/*vids=*/</emphasis> <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 
+		     <emphasis>/*directed=*/</emphasis>0, <emphasis>/*weights=*/</emphasis> &amp;weights, <emphasis>/*nobigint=*/</emphasis> 1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;bet2, nontriv_res, 
+		     <emphasis role="strong">sizeof</emphasis>(nontriv_res)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;bet, &amp;bet2)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;bet);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_bfs.c.xml igraph-0.6.5/examples/simple/igraph_bfs.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_bfs.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_bfs.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,62 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">vector_print</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vids, layers, parents;
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vids, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;layers, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;parents, 0);
+  <emphasis role="strong">igraph_i_bfs</emphasis>(&amp;g, 0, IGRAPH_ALL, &amp;vids, &amp;layers, &amp;parents);
+  <emphasis role="strong">vector_print</emphasis>(&amp;vids);
+  <emphasis role="strong">vector_print</emphasis>(&amp;layers);
+  <emphasis role="strong">vector_print</emphasis>(&amp;parents);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 20, 2, IGRAPH_TREE_UNDIRECTED);
+  <emphasis role="strong">igraph_i_bfs</emphasis>(&amp;g, 0, IGRAPH_ALL, &amp;vids, &amp;layers, &amp;parents);
+  <emphasis role="strong">vector_print</emphasis>(&amp;vids);
+  <emphasis role="strong">vector_print</emphasis>(&amp;layers);
+  <emphasis role="strong">vector_print</emphasis>(&amp;parents);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vids);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;layers);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;parents);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_bfs2.c.xml igraph-0.6.5/examples/simple/igraph_bfs2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_bfs2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_bfs2.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,129 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+igraph_bool_t <emphasis role="strong">bfs_callback</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph,
+			   igraph_integer_t vid, 
+			   igraph_integer_t pred, 
+			   igraph_integer_t succ,
+			   igraph_integer_t rank,
+			   igraph_integer_t dist,
+			   void *extra) {
+  <emphasis role="strong">printf</emphasis>(" %li", (long int) vid);
+  <emphasis role="strong">return</emphasis> 0;
+}		   
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph, ring;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> order, rank, father, pred, succ, dist;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> restricted;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> roots;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_disjoint_union'>igraph_disjoint_union</link></emphasis>(&amp;graph, &amp;ring, &amp;ring);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;order, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;rank, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;father, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;pred, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;succ, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;dist, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis>0, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 1, <emphasis>/*restricted=*/</emphasis> 0,
+	     &amp;order, &amp;rank, &amp;father, &amp;pred, &amp;succ, &amp;dist, 
+	     <emphasis>/*callback=*/</emphasis> 0, <emphasis>/*extra=*/</emphasis> 0);
+  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;order);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;rank);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;father);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;pred);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;succ);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;dist);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;order);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;rank);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;father);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;pred);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;succ);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;dist);
+
+  <emphasis>/* Test the callback */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> 0, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 1, <emphasis>/*restricted=*/</emphasis> 0,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis>/* Test different roots */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> 2, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 1, <emphasis>/*restricted=*/</emphasis> 0,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis>/* Test restricted */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;restricted, 0);
+  <emphasis role="strong">for</emphasis> (i=5; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;graph); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;restricted, i);
+  }
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> 5, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 1, &amp;restricted,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");  
+
+  <emphasis>/* Root not in restricted set */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> 4, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 1, &amp;restricted,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");  
+
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> 3, <emphasis>/*roots=*/</emphasis> 0, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 0, &amp;restricted,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");  
+
+  <emphasis>/* Multiple root vertices */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;roots, 3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(roots)[0]=3; 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(roots)[1]=4;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(roots)[2]=6;
+  <emphasis role="strong"><link linkend='igraph_bfs'>igraph_bfs</link></emphasis>(&amp;graph, <emphasis>/*root=*/</emphasis> -1, &amp;roots, <emphasis>/*neimode=*/</emphasis> IGRAPH_OUT, 
+	     <emphasis>/*unreachable=*/</emphasis> 0, &amp;restricted,
+	     0, 0, 0, 0, 0, 0, &amp;bfs_callback, 0);
+  <emphasis role="strong">printf</emphasis>("\n");    
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;roots);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;restricted);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_biconnected_components.c.xml igraph-0.6.5/examples/simple/igraph_biconnected_components.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_biconnected_components.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_biconnected_components.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,82 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">sort_and_print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">warning_handler_ignore</emphasis>(<emphasis role="strong">const</emphasis> char* reason,<emphasis role="strong">const</emphasis> char* file,int line,int e) {
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_vector_ptr_t result;
+  igraph_es_t es;
+  igraph_integer_t no;
+  long int i, j, n;
+  <emphasis role="strong">const</emphasis> int params[] = {4, -1, 2, 2, 0, 0, -1, -1};
+ 
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(warning_handler_ignore);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;result, 0);
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 7, 0, 0, 1, 1, 2, 2, 3, 3, 0, 2, 4, 4, 5, 2, 5, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_biconnected_components'>igraph_biconnected_components</link></emphasis>(&amp;g, &amp;no, 0, 0, &amp;result, 0);
+  <emphasis role="strong">if</emphasis> (no != 2 || no != <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result)) <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; no; i++) {
+    <emphasis role="strong">sort_and_print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong">free</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_biconnected_components'>igraph_biconnected_components</link></emphasis>(&amp;g, &amp;no, 0, &amp;result, 0, 0);
+  <emphasis role="strong">if</emphasis> (no != 2 || no != <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result)) <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; no; i++) {
+    <emphasis role="strong">sort_and_print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong">free</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_biconnected_components'>igraph_biconnected_components</link></emphasis>(&amp;g, &amp;no, &amp;result, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (no != 2 || no != <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result)) <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; no; i++) {
+    <emphasis role="strong">sort_and_print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+    <emphasis role="strong">free</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_bipartite_create.c.xml igraph-0.6.5/examples/simple/igraph_bipartite_create.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_bipartite_create.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_bipartite_create.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,65 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_real_t edges2[] = {0,1, 1,2, 3,4, 5,6, 6,5, 1,4, 1,6, 0,3 };
+  igraph_real_t edges3[] = {0,1, 1,2, 3,4, 5,6, 6,5, 2,4, 1,6, 0,3 };
+  igraph_t g;
+  igraph_vector_bool_t types;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges;
+  long int i;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges, edges2, <emphasis role="strong">sizeof</emphasis>(edges2)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, <emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;edges)+1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(&amp;types); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = i % 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_create_bipartite'>igraph_create_bipartite</link></emphasis>(&amp;g, &amp;types, &amp;edges, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Error handling */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges, edges3, <emphasis role="strong">sizeof</emphasis>(edges3)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, <emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;edges)+1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(&amp;types); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = i % 2;
+  }
+  ret = <emphasis role="strong"><link linkend='igraph_create_bipartite'>igraph_create_bipartite</link></emphasis>(&amp;g, &amp;types, &amp;edges, <emphasis>/*directed=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+  
+
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_bipartite_projection.c.xml igraph-0.6.5/examples/simple/igraph_bipartite_projection.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_bipartite_projection.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_bipartite_projection.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,174 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">check_projection</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph,
+		     <emphasis role="strong">const</emphasis> igraph_vector_bool_t *types,
+		     <emphasis role="strong">const</emphasis> igraph_t *proj1,
+		     <emphasis role="strong">const</emphasis> igraph_t *proj2) {
+  igraph_integer_t vcount1, ecount1, vcount2, ecount2;
+  <emphasis role="strong"><link linkend='igraph_bipartite_projection_size'>igraph_bipartite_projection_size</link></emphasis>(graph, types, &amp;vcount1, &amp;ecount1,
+				   &amp;vcount2, &amp;ecount2);
+  <emphasis role="strong">if</emphasis> (proj1 &amp;&amp; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(proj1) != vcount1) {
+    <emphasis role="strong">exit</emphasis>(10);
+  }
+  <emphasis role="strong">if</emphasis> (proj1 &amp;&amp; <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(proj1) != ecount1) {
+    <emphasis role="strong">exit</emphasis>(11);
+  }
+  <emphasis role="strong">if</emphasis> (proj2 &amp;&amp; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(proj2) != vcount2) {
+    <emphasis role="strong">exit</emphasis>(12);
+  }
+  <emphasis role="strong">if</emphasis> (proj2 &amp;&amp; <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(proj2) != ecount2) {
+    <emphasis role="strong">exit</emphasis>(13);
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, p1, p2, full, ring;
+  igraph_vector_bool_t types;
+  igraph_bool_t iso;
+  long int i, m2=0, w, f, t;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> mult1, mult2;
+  
+  <emphasis>/*******************************************************/</emphasis>
+  <emphasis>/* Full bipartite graph -&gt; full graphs                 */</emphasis>
+  <emphasis>/*******************************************************/</emphasis>
+
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, 0);
+  <emphasis role="strong"><link linkend='igraph_full_bipartite'>igraph_full_bipartite</link></emphasis>(&amp;g, &amp;types, 5, 3, <emphasis>/*directed=*/</emphasis> 0, 
+			<emphasis>/*mode=*/</emphasis> IGRAPH_ALL);
+
+  <emphasis>/* Get both projections */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_bipartite_projection'>igraph_bipartite_projection</link></emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2, 0, 0, <emphasis>/*probe1=*/</emphasis> -1);
+  <emphasis role="strong">check_projection</emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2);
+
+  <emphasis>/* Check first projection */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;full, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;p1), <emphasis>/*directed=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>0);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;p1, &amp;full, &amp;iso, 0, 0, 
+			  IGRAPH_BLISS_FM, IGRAPH_BLISS_FM, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;full);
+  
+  <emphasis>/* Check second projection */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;full, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;p2), <emphasis>/*directed=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>0);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;p2, &amp;full, &amp;iso, 0, 0, 
+			  IGRAPH_BLISS_FM, IGRAPH_BLISS_FM, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;full);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+
+  <emphasis>/*******************************************************/</emphasis>
+  <emphasis>/* More sophisticated test</emphasis>
+<emphasis>  /*******************************************************/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 100, <emphasis>/*directed=*/</emphasis> 1, <emphasis>/*mutual=*/</emphasis> 1, 
+	      <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(&amp;types); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = i%2 ? 0 : 1;
+  }
+  
+  <emphasis>/* Get both projections */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_bipartite_projection'>igraph_bipartite_projection</link></emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2, 0, 0, <emphasis>/*probe1=*/</emphasis> -1);
+  <emphasis role="strong">check_projection</emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2);
+  
+  <emphasis>/* Check first projection */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g)/2, <emphasis>/*directed=*/</emphasis> 0, 
+	      <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;p1, &amp;ring, &amp;iso, 0, 0, 
+			  IGRAPH_BLISS_FM, IGRAPH_BLISS_FM, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 1; }
+  
+  <emphasis>/* Check second projection */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_isomorphic_bliss'>igraph_isomorphic_bliss</link></emphasis>(&amp;p2, &amp;ring, &amp;iso, 0, 0, 
+			  IGRAPH_BLISS_FM, IGRAPH_BLISS_FM, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+
+  <emphasis>/*******************************************************/</emphasis>
+  <emphasis>/* Multiplicity test                                   */</emphasis>
+  <emphasis>/*******************************************************/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 
+	       0,8, 1,8, 2,8, 3,8, 4,8, 4,9, 5,9, 6,9, 7,9, 0,9, 
+	       -1);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">igraph_vector_bool_fill</emphasis>(&amp;types, 1);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[8] = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[9] = 0;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;mult1, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;mult2, 0);
+  <emphasis role="strong"><link linkend='igraph_bipartite_projection'>igraph_bipartite_projection</link></emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2, &amp;mult1, &amp;mult2, 
+			      <emphasis>/*probe=*/</emphasis> -1);
+  <emphasis role="strong">check_projection</emphasis>(&amp;g, &amp;types, &amp;p1, &amp;p2);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;mult1) != <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;p1)) {
+    <emphasis role="strong">return</emphasis> 21;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;mult2) != <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;p2)) {
+    <emphasis role="strong">return</emphasis> 22;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(mult1)[0] != 2) { 
+    <emphasis role="strong">return</emphasis> 23;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;mult2); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(mult2)[i] != 1 &amp;&amp; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(mult2)[i] != 2) {
+      <emphasis role="strong">return</emphasis> 24;
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(mult2)[i] == 2) {
+      m2++;
+      w=i;
+    }
+  }
+  <emphasis role="strong">if</emphasis> (m2 != 1) { 
+    <emphasis role="strong">return</emphasis> 25;
+  }
+  f=<emphasis role="strong">IGRAPH_FROM</emphasis>(&amp;p2, w);
+  t=<emphasis role="strong">IGRAPH_TO</emphasis>(&amp;p2, w);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fmin</emphasis>(f, t) != 0 || <emphasis role="strong">fmax</emphasis>(f, t) != 4) { 
+    <emphasis role="strong">return</emphasis> 26;
+  }
+   
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;mult1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;mult2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;p2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_cliques.c.xml igraph-0.6.5/examples/simple/igraph_cliques.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_cliques.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_cliques.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,86 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">warning_handler_ignore</emphasis>(<emphasis role="strong">const</emphasis> char* reason,<emphasis role="strong">const</emphasis> char* file,int line,int e) {
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_vector_ptr_t result;
+  igraph_es_t es;
+  igraph_integer_t omega;
+  long int i, j, n;
+  <emphasis role="strong">const</emphasis> int params[] = {4, -1, 2, 2, 0, 0, -1, -1};
+ 
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(warning_handler_ignore);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;result, 0);
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 6, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, 0, 0, 1, 0, 2, 3, 5, -1);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, es);
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong">sizeof</emphasis>(params)/(2*<emphasis role="strong">sizeof</emphasis>(params[0])); j++) {
+    <emphasis role="strong">if</emphasis> (params[2*j+1] != 0) {
+      <emphasis role="strong"><link linkend='igraph_cliques'>igraph_cliques</link></emphasis>(&amp;g, &amp;result, params[2*j], params[2*j+1]);  
+    } <emphasis role="strong">else</emphasis> {
+      <emphasis role="strong"><link linkend='igraph_largest_cliques'>igraph_largest_cliques</link></emphasis>(&amp;g, &amp;result);
+    }
+    n = <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result);
+    <emphasis role="strong">printf</emphasis>("%ld cliques found\n", (long)n);
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+      <link linkend='igraph_vector_t'>igraph_vector_t</link>* v;
+      v=<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;result,i);
+      <emphasis role="strong">print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)v);
+      <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+      <emphasis role="strong">free</emphasis>(v);
+    }
+  }
+   
+  <emphasis role="strong"><link linkend='igraph_clique_number'>igraph_clique_number</link></emphasis>(&amp;g, &amp;omega);
+  <emphasis role="strong">printf</emphasis>("omega=%ld\n", (long)omega);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 5, 2, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_cliques'>igraph_cliques</link></emphasis>(&amp;g, &amp;result, 5, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result) != 0) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;result);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_cocitation.c.xml igraph-0.6.5/examples/simple/igraph_cocitation.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_cocitation.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_cocitation.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,57 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_matrix</emphasis>(igraph_matrix_t *m, FILE *f) {
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m); j++) {
+      <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_matrix_t m;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 
+	       0,1, 2,1, 2,0, 3,0, 
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_bibcoupling'>igraph_bibcoupling</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>());
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_cocitation'>igraph_cocitation</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>());
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_edge_betweenness.c.xml igraph-0.6.5/examples/simple/igraph_community_edge_betweenness.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_edge_betweenness.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_edge_betweenness.c.xml	2013-03-03 01:45:48.000000000 +0000
@@ -0,0 +1,169 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">igraph_vector_between</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link>* v, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link>* lo,
+		<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link>* hi) {
+	<emphasis role="strong">return</emphasis> <emphasis role="strong"><link linkend='igraph_vector_all_le'>igraph_vector_all_le</link></emphasis>(lo, v) &amp;&amp; <emphasis role="strong"><link linkend='igraph_vector_all_ge'>igraph_vector_all_ge</link></emphasis>(hi, v);
+}
+
+void <emphasis role="strong">test_unweighted</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges, eb;
+  long int i;
+  long int no_of_edges;
+
+  <emphasis>/* Zachary Karate club */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);  
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;edges, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, 0);
+  <emphasis role="strong"><link linkend='igraph_community_edge_betweenness'>igraph_community_edge_betweenness</link></emphasis>(&amp;g, &amp;edges, &amp;eb, 0 <emphasis>/*merges */</emphasis>,
+				    0 <emphasis>/*bridges */</emphasis>, <emphasis>/*modularity=*/</emphasis> 0,
+				    <emphasis>/*membership=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED,
+				    <emphasis>/*weights=*/</emphasis> 0);
+  
+  no_of_edges=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;no_of_edges; i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(edges)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;no_of_edges; i++) {
+    <emphasis role="strong">printf</emphasis>("%.2f ", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eb)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis>/* Try it once again without storage space for edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_community_edge_betweenness'>igraph_community_edge_betweenness</link></emphasis>(&amp;g, 0, &amp;eb, 0 <emphasis>/*merges */</emphasis>,
+				    0 <emphasis>/*bridges */</emphasis>, <emphasis>/*modularity=*/</emphasis> 0,
+				    <emphasis>/*membership=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED,
+				    <emphasis>/*weights=*/</emphasis> 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;no_of_edges; i++) {
+    <emphasis role="strong">printf</emphasis>("%.2f ", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eb)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+}
+
+<emphasis role="strong">#define</emphasis> EPS 1e-4
+
+void <emphasis role="strong">test_weighted</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges, eb, weights;
+  long int i;
+  long int no_of_edges;
+  igraph_real_t weights_array[] = { 4, 1, 3, 2, 5, 8, 6, 7 };
+
+  igraph_real_t edges_array1[] = { 2, 3, 0, 1, 4, 7, 5, 6 };
+  igraph_real_t edges_array2[] = { 2, 3, 6, 5, 0, 1, 4, 7 };
+  igraph_real_t eb_array1_lo[] = { 4, 5, 3+1/3.0-EPS, 4, 2.5, 4, 1, 1 };
+  igraph_real_t eb_array1_hi[] = { 4, 5, 3+1/3.0+EPS, 4, 2.5, 4, 1, 1 };
+  igraph_real_t eb_array2_lo[] = { 4, 5, 3+1/3.0-EPS, 6, 1.5, 2, 1, 1 };
+  igraph_real_t eb_array2_hi[] = { 4, 5, 3+1/3.0+EPS, 6, 1.5, 2, 1, 1 };
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges_sol1, edges_sol2, eb_sol1_lo, eb_sol1_hi, eb_sol2_lo, eb_sol2_hi;
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges_sol1, edges_array1, 
+		     <emphasis role="strong">sizeof</emphasis>(edges_array1)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;edges_sol2, edges_array2, 
+		     <emphasis role="strong">sizeof</emphasis>(edges_array2)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;eb_sol1_lo, eb_array1_lo, <emphasis role="strong">sizeof</emphasis>(eb_array1_lo)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;eb_sol2_lo, eb_array2_lo, <emphasis role="strong">sizeof</emphasis>(eb_array2_lo)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;eb_sol1_hi, eb_array1_hi, <emphasis role="strong">sizeof</emphasis>(eb_array1_hi)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;eb_sol2_hi, eb_array2_hi, <emphasis role="strong">sizeof</emphasis>(eb_array2_hi)/<emphasis role="strong">sizeof</emphasis>(double));
+
+  <emphasis>/* Small graph as follows: A--B--C--A, A--D--E--A, B--D, C--E */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+      0, 1, 0, 2, 0, 3, 0, 4, 1, 2, 1, 3, 2, 4, 3, 4, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights, weights_array, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;edges, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, 0);
+  <emphasis role="strong"><link linkend='igraph_community_edge_betweenness'>igraph_community_edge_betweenness</link></emphasis>(&amp;g, &amp;edges, &amp;eb, 0 <emphasis>/*merges */</emphasis>,
+				    0 <emphasis>/*bridges */</emphasis>, <emphasis>/*modularity=*/</emphasis> 0,
+				    <emphasis>/*membership=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED,
+				    &amp;weights);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;edges_sol1, &amp;edges) &amp;&amp; 
+      !<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;edges_sol2, &amp;edges)) {
+    <emphasis role="strong">printf</emphasis>("Error, edges vector was: \n");
+	<emphasis role="strong">igraph_vector_print</emphasis>(&amp;edges);
+    <emphasis role="strong">exit</emphasis>(2);
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_vector_between</emphasis>(&amp;eb, &amp;eb_sol1_lo, &amp;eb_sol1_hi) &amp;&amp;
+      !<emphasis role="strong">igraph_vector_between</emphasis>(&amp;eb, &amp;eb_sol2_lo, &amp;eb_sol2_hi)) {
+    <emphasis role="strong">printf</emphasis>("Error, eb vector was: \n");
+	<emphasis role="strong">igraph_vector_print</emphasis>(&amp;eb);
+    <emphasis role="strong">exit</emphasis>(2);
+  }
+
+  <emphasis>/* Try it once again without storage space for edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_community_edge_betweenness'>igraph_community_edge_betweenness</link></emphasis>(&amp;g, 0, &amp;eb, 0 <emphasis>/*merges */</emphasis>,
+				    0 <emphasis>/*bridges */</emphasis>, <emphasis>/*modularity=*/</emphasis> 0,
+				    <emphasis>/*membership=*/</emphasis> 0,
+				    IGRAPH_UNDIRECTED,
+				    &amp;weights);
+
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_vector_between</emphasis>(&amp;eb, &amp;eb_sol1_lo, &amp;eb_sol1_hi) &amp;&amp;
+      !<emphasis role="strong">igraph_vector_between</emphasis>(&amp;eb, &amp;eb_sol2_lo, &amp;eb_sol2_hi)) {
+    <emphasis role="strong">printf</emphasis>("Error, eb vector was: \n");
+	<emphasis role="strong">igraph_vector_print</emphasis>(&amp;eb);
+    <emphasis role="strong">exit</emphasis>(2);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  <emphasis role="strong">test_unweighted</emphasis>();
+  <emphasis role="strong">test_weighted</emphasis>();
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_fastgreedy.c.xml igraph-0.6.5/examples/simple/igraph_community_fastgreedy.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_fastgreedy.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_fastgreedy.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,143 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">show_results</emphasis>(igraph_t *g, <link linkend='igraph_vector_t'>igraph_vector_t</link> *mod, igraph_matrix_t *merges, FILE* f) {
+  long int i;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+
+  i=<emphasis role="strong"><link linkend='igraph_vector_which_max'>igraph_vector_which_max</link></emphasis>(mod);
+  <emphasis role="strong">fprintf</emphasis>(f, "Modularity:  %f\n", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*mod)[i]);
+  <emphasis role="strong"><link linkend='igraph_community_to_membership'>igraph_community_to_membership</link></emphasis>(merges, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g), i, &amp;membership, 0);
+  <emphasis role="strong">printf</emphasis>("Membership: ");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;membership); i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(membership)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> modularity, weights;
+  igraph_matrix_t merges;
+  FILE *f;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;modularity,0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;merges,0,0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights,0);
+
+  <emphasis>/* Simple unweighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 
+	       0,1,0,2,0,3,0,4, 1,2,1,3,1,4, 2,3,2,4, 3,4,
+	       5,6,5,7,5,8,5,9, 6,7,6,8,6,9, 7,8,7,9, 8,9,
+           0,5, -1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+
+  <emphasis>/* Same simple graph, with uniform edge weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;weights, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights, 2);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, &amp;weights, &amp;merges, &amp;modularity, 
+			      <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Simple nonuniform weighted graph, with and without weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_UNDIRECTED, 
+	       0,1,1,2,2,3,2,4,2,5,3,4,3,5,4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;weights, 8);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights, 1);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[0] = 10; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[1] = 10;
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, &amp;weights, &amp;merges, &amp;modularity, 
+			      <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Zachary Karate club */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, 
+			      <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+   
+  <emphasis>/* Simple disconnected graph with isolates */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 9, IGRAPH_UNDIRECTED,
+	       0,  1,  0,  2,  0,  3,  1,  2,  1,  3,  2,  3,
+	       4,  5,  4,  6,  4,  7,  5,  6,  5,  7,  6,  7,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout); 
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Disjoint union of two rings */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 20, IGRAPH_UNDIRECTED,
+           0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,0,9,
+	   10,11,11,12,12,13,13,14,14,15,15,16,16,17,17,18,18,19,10,19,-1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Completely empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, -1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Ring graph with loop edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_UNDIRECTED,
+          0,1,1,2,2,3,3,4,4,5,5,0,0,0,2,2,-1);
+  <emphasis role="strong"><link linkend='igraph_community_fastgreedy'>igraph_community_fastgreedy</link></emphasis>(&amp;g, 0, &amp;merges, &amp;modularity, <emphasis>/*membership=*/</emphasis> 0);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;modularity, &amp;merges, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;modularity);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;merges);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_infomap.c.xml igraph-0.6.5/examples/simple/igraph_community_infomap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_infomap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_infomap.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,259 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+
+void <emphasis role="strong">gsumary</emphasis>(<emphasis role="strong">const</emphasis> igraph_t * g){
+  <emphasis role="strong">printf</emphasis>("|V|=%d |E|=%d directed=%d\n", (int)<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g), (int)<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(g), (int)<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(g));
+}
+
+void <emphasis role="strong">show_results</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> * membership, igraph_real_t codelength) {
+  <emphasis role="strong">printf</emphasis>("Codelength: %0.5f (in %d modules)\n", codelength, (int)<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(membership) + 1 );
+  <emphasis role="strong">printf</emphasis>("Membership: ");
+  int i;
+  <emphasis role="strong">for</emphasis> (i=0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(membership); i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*membership)[i] );
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">show_results_lite</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> * membership, igraph_real_t codelength) {
+  <emphasis role="strong">printf</emphasis>("Codelength: %0.5f (in %d modules)\n", codelength, (int)<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(membership) + 1 );
+  <emphasis role="strong">printf</emphasis>("Membership (1/100 of vertices): ");
+  int i;
+  <emphasis role="strong">for</emphasis> (i=0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(membership); i+=100) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*membership)[i] );
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">infomap_weighted_test</emphasis>(<emphasis role="strong">const</emphasis> igraph_t * g, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *weights){
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership;
+  igraph_real_t codelength = 1000;
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+
+  <emphasis role="strong"><link linkend='igraph_community_infomap'>igraph_community_infomap</link></emphasis>(<emphasis>/*in */</emphasis> g, <emphasis>/*e_weight=*/</emphasis> weights, NULL, <emphasis>/*nb_trials=*/</emphasis>5,
+                           <emphasis>/*out*/</emphasis> &amp;membership, &amp;codelength);
+  <emphasis role="strong">if</emphasis>(<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g) &gt; 500)
+      <emphasis role="strong">show_results_lite</emphasis>(&amp;membership, codelength);
+  <emphasis role="strong">else</emphasis>
+      <emphasis role="strong">show_results</emphasis>(&amp;membership, codelength);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+}
+
+
+void <emphasis role="strong">infomap_test</emphasis>(<emphasis role="strong">const</emphasis> igraph_t * g){
+  <emphasis role="strong">infomap_weighted_test</emphasis>(g, 0);
+}
+
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis>/* Two triangles connected by one edge */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# Two triangles connected by one edge\n");
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+                      0, 1, 1, 2, 2, 0,
+                      3, 4, 4, 5, 5, 3,
+                      0, 5,
+                      -1);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis>//return 0;</emphasis>
+
+  <emphasis>/* Two 4-cliques with one commun vertex (vertex 3) */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# Two 4-cliques (0123 and 4567) connected by two edges (0-4 and 1-5)\n");
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+                      0, 1,  0, 2,  0, 3,  1, 2,  1, 3,  2, 3, <emphasis>// 4-clique 0,1,2,3</emphasis>
+                      7, 4,  7, 5,  7, 6,  4, 5,  4, 6,  5, 6, <emphasis>// 4-clique 4,5,6,7</emphasis>
+                      0, 4,  1, 5, <emphasis>//8, 0, 8, 4,</emphasis>
+                      -1);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+
+  <emphasis role="strong">printf</emphasis>("# Two 4-cliques (0123 and 4567) connected by two edges (0-4 and 1-5)\n");
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;g, 0, 4);
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;g, 1, 5);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* Zachary Karate club -- this is just a quick smoke test */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# Zachary Karate club\n");
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+               0,  1,  0,  2,  0,  3,  0,  4,  0,  5, <emphasis>//0,  5, 0,  5, 0,  5,</emphasis>
+               0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+               0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+               0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+               1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+               2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+               2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+               4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+               6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+               13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+               18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+               22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+               23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+               25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+               28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+               31, 32, 31, 33, 32, 33,
+               -1);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* Flow.net that come in infomap_dir.tgz  */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# Flow (from infomap_dir.tgz)\n");
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED,
+              0, 1,     1, 2,    2, 3,    3, 0,    1, 4,
+              4, 5,     5, 6,    6, 7,    7, 4,    5, 8,
+              8, 9,     9, 10,  10, 11,  11, 8,    9, 12,
+              12, 13,  13, 14,  14, 15,  15, 12,  13, 0,
+               -1);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* MultiphysChemBioEco40W_weighted_dir.net */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# MultiphysChemBioEco40W_weighted_dir.net (from infomap_dir.tgz)\n");
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED,
+          1, 0,  2, 0,  3, 0,  4, 0,  5, 0,  6, 0,  7, 0,
+          8, 0,  9, 0,  16, 0,  18, 0,  0, 1,  2, 1,  3, 1,
+          5, 1,  6, 1,  7, 1,  9, 1,  10, 1,  16, 1,  18, 1,
+          0, 2,  3, 2,  4, 2,  5, 2,  6, 2,  7, 2,  0, 3,
+          1, 3,  2, 3,  4, 3,  5, 3,  6, 3,  7, 3,  8, 3,
+          9, 3,  10, 3,  11, 3,  13, 3,  14, 3,  16, 3,  17, 3,
+          18, 3,  19, 3,  26, 3,  30, 3,  1, 4,  3, 4,  5, 4,
+          6, 4,  13, 4,  18, 4,  0, 5,  1, 5,  2, 5,  3, 5,
+          6, 5,  7, 5,  9, 5,  1, 6,  3, 6,  7, 6,  9, 6,
+          16, 6,  0, 7,  1, 7,  2, 7,  3, 7,  5, 7,  6, 7,
+          9, 7,  3, 8,  5, 8,  3, 9,  7, 9,  12, 10,  13, 10,
+          14, 10,  15, 10,  16, 10,  17, 10,  18, 10,  19, 10,
+          21, 10,  3, 11,  18, 11,  10, 12,  14, 12,  16, 12,
+          17, 12,  18, 12,  3, 13,  10, 13,  14, 13,  16, 13,
+          10, 14,  12, 14,  13, 14,  15, 14,  16, 14,  17, 14,
+          18, 14,  10, 15,  14, 15,  18, 15,  0, 16,  2, 16,
+          3, 16,  6, 16,  10, 16,  12, 16,  13, 16,  14, 16,
+          17, 16,  18, 16,  10, 17,  12, 17,  14, 17,  18, 17,
+          3, 18,  10, 18,  12, 18,  14, 18,  15, 18,  16, 18,
+          17, 18,  19, 18,  21, 18,  11, 19,  16, 19,  17, 19,
+          16, 20,  18, 20,  21, 20,  22, 20,  23, 20,  24, 20,
+          25, 20,  26, 20,  27, 20,  28, 20,  29, 20,  3, 21,
+          14, 21,  18, 21,  20, 21,  22, 21,  23, 21,  24, 21,
+          25, 21,  26, 21,  27, 21,  28, 21,  29, 21,  35, 21,
+          36, 21,  38, 21,  18, 22,  20, 22,  21, 22,  23, 22,
+          24, 22,  25, 22,  26, 22,  27, 22,  29, 22,  3, 23,
+          20, 23,  21, 23,  22, 23,  24, 23,  25, 23,  26, 23,
+          27, 23,  28, 23,  29, 23,  35, 23,  38, 23,  39, 23,
+          20, 24,  21, 24,  23, 24,  25, 24,  26, 24,  27, 24,
+          28, 24,  29, 24,  9, 25,  20, 25,  21, 25,  22, 25,
+          23, 25,  24, 25,  26, 25,  27, 25,  28, 25,  29, 25,
+          18, 26,  20, 26,  21, 26,  22, 26,  23, 26,  25, 26,
+          27, 26,  28, 26,  29, 26,  30, 26,  32, 26,  35, 26,
+          36, 26,  38, 26,  39, 26,  3, 27,  14, 27,  20, 27,
+          21, 27,  22, 27,  23, 27,  24, 27,  25, 27,  26, 27,
+          28, 27,  29, 27,  38, 27,  3, 28,  18, 28,  20, 28,
+          21, 28,  23, 28,  24, 28,  25, 28,  26, 28,  27, 28,
+          29, 28,  35, 28,  14, 29,  16, 29,  18, 29,  20, 29,
+          21, 29,  22, 29,  23, 29,  24, 29,  25, 29,  26, 29,
+          27, 29,  28, 29,  31, 30,  32, 30,  33, 30,  34, 30,
+          35, 30,  36, 30,  38, 30,  39, 30,  30, 31,  32, 31,
+          34, 31,  36, 31,  30, 32,  34, 32,  35, 32,  36, 32,
+          30, 33,  32, 33,  34, 33,  35, 33,  36, 33,  38, 33,
+          30, 34,  31, 34,  32, 34,  33, 34,  35, 34,  36, 34,
+          38, 34,  39, 34,  26, 35,  30, 35,  32, 35,  33, 35,
+          34, 35,  36, 35,  38, 35,  39, 35,  30, 36,  34, 36,
+          35, 36,  38, 36,  39, 36,  34, 37,  26, 38,  30, 38,
+          32, 38,  33, 38,  34, 38,  35, 38,  36, 38,  39, 38,
+          26, 39,  30, 39,  33, 39,  34, 39,  35, 39,  36, 39,
+          38, 39,
+          -1);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;weights, 306,
+          5.0,  3.0,  130.0,  4.0,  15.0,  9.0,
+          7.0,  1.0,  1.0,  3.0,  1.0,  1.0,
+          1.0,  34.0,  38.0,  2.0,  23.0,  1.0,
+          1.0,  3.0,  2.0,  2.0,  16.0,  1.0,
+          3.0,  1.0,  3.0,  63.0,  92.0,  72.0,
+          25.0,  447.0,  121.0,  65.0,  4.0,  16.0,
+          35.0,  1.0,  19.0,  1.0,  78.0,  1.0,
+          45.0,  1.0,  3.0,  1.0,  1.0,  25.0,
+          1.0,  3.0,  1.0,  1.0,  3.0,  36.0,
+          19.0,  136.0,  41.0,  96.0,  1.0,  7.0,
+          26.0,  1.0,  2.0,  2.0,  3.0,  2.0,  2.0,
+          23.0,  52.0,  4.0,  1.0,  2.0,  1.0,  3.0,
+          1.0,  11.0,  2.0,  17.0,  1.0,  5.0,  18.0,
+          86.0,  5.0,  1.0,  1.0,  1.0,  6.0,  1.0,
+          2.0,  2.0,  20.0,  4.0,  5.0,  1.0,  5.0,
+          12.0,  4.0,  1.0,  1.0,  4.0,  9.0,  40.0,
+          2.0,  1.0,  4.0,  1.0,  1.0,  48.0,  2.0,
+          18.0,  1.0,  7.0,  2.0,  2.0,  53.0,  25.0,
+          9.0,  1.0,  23.0,  8.0,  62.0,  29.0,  35.0,
+          4.0,  34.0,  35.0,  3.0,  1.0,  24.0,  1.0,
+          6.0,  2.0,  2.0,  22.0,  7.0,  2.0,  5.0,
+          14.0,  3.0,  28.0,  14.0,  20.0,  3.0,  1.0,
+          5.0,  77.0,  20.0,  25.0,  35.0,  55.0,  35.0,
+          115.0,  68.0,  105.0,  2.0,  2.0,  2.0,  4.0,
+          2.0,  17.0,  12.0,  3.0,  3.0,  11.0,  10.0,
+          7.0,  2.0,  12.0,  31.0,  11.0,  5.0,  11.0,
+          65.0,  39.0,  17.0,  26.0,  3.0,  4.0,  2.0,
+          3.0,  6.0,  4.0,  8.0,  1.0,  7.0,  7.0,
+          6.0,  1.0,  39.0,  42.0,  9.0,  6.0,  9.0,
+          5.0,  45.0,  43.0,  26.0,  1.0,  2.0,  6.0,
+          2.0,  15.0,  3.0,  9.0,  2.0,  1.0,  1.0,
+          1.0,  4.0,  2.0,  9.0,  2.0,  1.0,  2.0,
+          28.0,  80.0,  10.0,  18.0,  13.0,  17.0,
+          28.0,  40.0,  76.0,  1.0,  2.0,  1.0,  11.0,
+          37.0,  5.0,  11.0,  14.0,  4.0,  14.0,  10.0,
+          1.0,  1.0,  1.0,  1.0,  41.0,  121.0,  6.0,
+          21.0,  12.0,  30.0,  6.0,  141.0,  43.0,  2.0,
+          12.0,  6.0,  35.0,  10.0,  7.0,  2.0,  12.0,
+          6.0,  2.0,  11.0,  1.0,  7.0,  6.0,  5.0,  3.0,
+          1.0,  2.0,  1.0,  1.0,  1.0,  1.0,  67.0,  9.0,
+          9.0,  11.0,  10.0,  21.0,  7.0,  12.0,  9.0,
+          16.0,  7.0,  4.0,  11.0,  17.0,  37.0,  32.0,
+          9.0,  2.0,  2.0,  5.0,  4.0,  2.0,  7.0,  3.0,
+          3.0,  5.0,  8.0,  14.0,  3.0,  38.0,  3.0,  9.0,
+          2.0,  8.0,  21.0,  18.0,  58.0);
+  <emphasis role="strong">infomap_weighted_test</emphasis>(&amp;g, &amp;weights);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+   <emphasis>/* Two triangles connected by one edge */</emphasis>
+  <emphasis role="strong">printf</emphasis>("# Wiktionary english verbs (synonymy 2008)\n");
+  FILE *wikt = <emphasis role="strong">fopen</emphasis>("wikti_en_V_syn.elist", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_edgelist'>igraph_read_graph_edgelist</link></emphasis>(&amp;g, wikt, 0, 0);
+  <emphasis role="strong">fclose</emphasis>(wikt);
+  <emphasis role="strong">gsumary</emphasis>(&amp;g);
+  <emphasis role="strong">infomap_test</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_label_propagation.c.xml igraph-0.6.5/examples/simple/igraph_community_label_propagation.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_label_propagation.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_label_propagation.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,103 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership, weights, initial;
+  igraph_vector_bool_t fixed;
+  igraph_bool_t ok;
+  long int i, j;
+  long int no_of_nodes;
+
+  <emphasis>/* Zachary Karate club -- this is just a quick smoke test */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+               0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+               0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+               0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+               0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+               1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+               2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+               2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+               4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+               6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+               13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+               18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+               22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+               23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+               25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+               28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+               31, 32, 31, 33, 32, 33,
+               -1);  
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+  <emphasis role="strong"><link linkend='igraph_community_label_propagation'>igraph_community_label_propagation</link></emphasis>(&amp;g, &amp;membership, 0, 0, 0, 
+				     <emphasis>/*modularity=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;membership) &gt; 3) {
+    <emphasis role="strong">printf</emphasis>("Resulting graph had more than four clusters:\n");
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++)
+      <emphasis role="strong">printf</emphasis>("%li ", (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(membership)[i]);
+    <emphasis role="strong">printf</emphasis>("\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* Simple star graph to test weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+               0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+               2,  3,  2,  4,  3,  4,  3,  5,  4,  5,  -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;initial, -1, 0, 0, 1, 1, 1, 1, -1);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;fixed, 6);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(fixed)[3] = 1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(fixed)[4] = 1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(fixed)[5] = 1;
+  <emphasis role="strong"><link linkend='igraph_community_label_propagation'>igraph_community_label_propagation</link></emphasis>(&amp;g, &amp;membership, &amp;weights,
+				     &amp;initial, &amp;fixed, <emphasis>/*modularity=*/</emphasis> 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++)
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(membership)[i] != (i &lt; 2 ? 0 : 1)) <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_community_label_propagation'>igraph_community_label_propagation</link></emphasis>(&amp;g, &amp;membership, 0,
+				     &amp;initial, &amp;fixed, <emphasis>/*modularity=*/</emphasis> 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i++)
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(membership)[i] != 0) <emphasis role="strong">return</emphasis> 4;
+
+  <emphasis>/* Check whether it works with no fixed vertices at all</emphasis>
+<emphasis>   * while an initial configuration is given -- see bug</emphasis>
+<emphasis>   * #570902 in Launchpad. This is a simple smoke test only. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_community_label_propagation'>igraph_community_label_propagation</link></emphasis>(&amp;g, &amp;membership, &amp;weights,
+				     &amp;initial, 0, <emphasis>/*modularity=*/</emphasis> 0);
+
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;fixed);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;initial);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_leading_eigenvector.c.xml igraph-0.6.5/examples/simple/igraph_community_leading_eigenvector.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_leading_eigenvector.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_leading_eigenvector.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,115 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>("%.2g", (double)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+    <emphasis role="strong">if</emphasis> (i!=n-1) { <emphasis role="strong">printf</emphasis>(" "); }
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">print_matrix</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m) {
+  long int i, j, nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m), ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      <emphasis role="strong">printf</emphasis>("%.2g", (double)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+      <emphasis role="strong">if</emphasis> (j!=ncol-1) { <emphasis role="strong">printf</emphasis>(" "); }
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_matrix_t merges;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership;
+  long int i, j;
+  igraph_bool_t split;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> x;
+  igraph_real_t val;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  
+  <emphasis>/* Zachary Karate club */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);  
+ 
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;merges, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, 0);
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+  <emphasis role="strong"><link linkend='igraph_community_leading_eigenvector'>igraph_community_leading_eigenvector</link></emphasis>(&amp;g, &amp;merges, &amp;membership, 1, 
+				       &amp;options, <emphasis>/*modularity=*/</emphasis> 0, 
+				       <emphasis>/*start=*/</emphasis> 0, <emphasis>/*eigenvalues=*/</emphasis> 0, 
+				       <emphasis>/*eigenvectors=*/</emphasis> 0, <emphasis>/*history=*/</emphasis> 0,
+				       <emphasis>/*callback=*/</emphasis> 0, 
+				       <emphasis>/*callback_extra=*/</emphasis> 0);
+
+  <emphasis role="strong">print_matrix</emphasis>(&amp;merges);
+  <emphasis role="strong">print_vector</emphasis>(&amp;membership);
+
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis>/* Make all the steps */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_community_leading_eigenvector'>igraph_community_leading_eigenvector</link></emphasis>(&amp;g, &amp;merges, &amp;membership, 
+				       <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g),
+				       &amp;options, <emphasis>/*modularity=*/</emphasis> 0, 
+				       <emphasis>/*start=*/</emphasis> 0, <emphasis>/*eigenvalues=*/</emphasis> 0,
+				       <emphasis>/*eigenvectors=*/</emphasis> 0, <emphasis>/*history=*/</emphasis> 0,
+				       <emphasis>/*callback=*/</emphasis> 0, 
+				       <emphasis>/*callback_extra=*/</emphasis> 0);
+
+  <emphasis role="strong">print_matrix</emphasis>(&amp;merges);
+  <emphasis role="strong">print_vector</emphasis>(&amp;membership);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;merges);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_multilevel.c.xml igraph-0.6.5/examples/simple/igraph_community_multilevel.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_multilevel.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_multilevel.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,109 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sts=2 sw=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">show_results</emphasis>(igraph_t *g, <link linkend='igraph_vector_t'>igraph_vector_t</link> *membership, igraph_matrix_t *memberships, <link linkend='igraph_vector_t'>igraph_vector_t</link> *modularity, FILE* f) {
+  long int i, j, no_of_nodes = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g);
+
+  j=<emphasis role="strong"><link linkend='igraph_vector_which_max'>igraph_vector_which_max</link></emphasis>(modularity);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(membership); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*membership)[i] != <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*memberships, j, i)) {
+      <emphasis role="strong">fprintf</emphasis>(f, "WARNING: best membership vector element %li does not match the best one in the membership matrix\n", i);
+    }
+  }
+
+  <emphasis role="strong">fprintf</emphasis>(f, "Modularities:\n");
+  <emphasis role="strong">igraph_vector_print</emphasis>(modularity);
+
+  <emphasis role="strong">for</emphasis> (i=0; i &lt; <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(memberships); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j &lt; no_of_nodes; j++) {
+      <emphasis role="strong">fprintf</emphasis>(f, "%ld ", (long int)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*memberships, i, j));
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }
+
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> modularity, membership, edges;
+  igraph_matrix_t memberships;
+  int i, j, k;
+  FILE *f;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;modularity,0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership,0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;memberships,0,0);
+
+  <emphasis>/* Unweighted test graph from the paper of Blondel et al */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 16, IGRAPH_UNDIRECTED,
+      0, 2, 0, 3, 0, 4, 0, 5,
+      1, 2, 1, 4, 1, 7,
+      2, 4, 2, 5, 2, 6,
+      3, 7,
+      4, 10,
+      5, 7, 5, 11,
+      6, 7, 6, 11,
+      8, 9, 8, 10, 8, 11, 8, 14, 8, 15,
+      9, 12, 9, 14,
+      10, 11, 10, 12, 10, 13, 10, 14,
+      11, 13,
+      -1);
+  <emphasis role="strong"><link linkend='igraph_community_multilevel'>igraph_community_multilevel</link></emphasis>(&amp;g, 0, &amp;membership, &amp;memberships, &amp;modularity);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;membership, &amp;memberships, &amp;modularity, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Ring of 30 cliques */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;edges,0);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 30; i++) {
+    <emphasis role="strong">for</emphasis> (j = 0; j &lt; 5; j++) {
+      <emphasis role="strong">for</emphasis> (k = j+1; k &lt; 5; k++) {
+        <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;edges, i*5+j);
+        <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;edges, i*5+k);
+      }
+    }
+  }
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 30; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;edges, i*5 % 150);
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;edges, (i*5+6) % 150);
+  }
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;edges, 150, 0);
+  <emphasis role="strong"><link linkend='igraph_community_multilevel'>igraph_community_multilevel</link></emphasis>(&amp;g, 0, &amp;membership, &amp;memberships, &amp;modularity);
+  <emphasis role="strong">show_results</emphasis>(&amp;g, &amp;membership, &amp;memberships, &amp;modularity, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;modularity);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;memberships);
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_community_optimal_modularity.c.xml igraph-0.6.5/examples/simple/igraph_community_optimal_modularity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_community_optimal_modularity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_community_optimal_modularity.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,78 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t graph;
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_real_t edges[] = { 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8,
+			    0,10, 0,11, 0,12, 0,13, 0,17, 0,19, 0,21, 0,31,
+			    1, 2, 1, 3, 1, 7, 1,13, 1,17, 1,19, 1,21, 1,30,
+			    2, 3, 2, 7, 2,27, 2,28, 2,32, 2, 9, 2, 8, 2,13,
+			    3, 7, 3,12, 3,13, 4, 6, 4,10, 5, 6, 5,10, 5,16,
+			    6,16, 8,30, 8,32, 8,33, 9,33,13,33,14,32,14,33,
+			    15,32,15,33,18,32,18,33,19,33,20,32,20,33,
+			    22,32,22,33,23,25,23,27,23,32,23,33,23,29,
+			    24,25,24,27,24,31,25,31,26,29,26,33,27,33,
+			    28,31,28,33,29,32,29,33,30,32,30,33,31,32,31,33,
+			    32,33
+  };
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership;
+  igraph_real_t modularity;
+  igraph_bool_t simple;
+  int retval;
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, edges, <emphasis role="strong">sizeof</emphasis>(edges)/<emphasis role="strong">sizeof</emphasis>(double));
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;graph, &amp;v, 0, IGRAPH_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;graph, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(&amp;<link linkend='igraph_error_handler_printignore'>igraph_error_handler_printignore</link>);
+
+  <emphasis>/* Zachary karate club */</emphasis>
+  retval = <emphasis role="strong"><link linkend='igraph_community_optimal_modularity'>igraph_community_optimal_modularity</link></emphasis>(&amp;graph, &amp;modularity,
+    &amp;membership, <emphasis>/*verbose=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (retval == IGRAPH_UNIMPLEMENTED) { <emphasis role="strong">return</emphasis> 77; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(modularity - 0.4197896) &gt; 0.0000001) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis>/* simple graph with loop edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 6, IGRAPH_UNDIRECTED,
+          0,1,1,2,2,3,3,4,4,5,5,0,0,0,2,2,-1);
+  <emphasis role="strong"><link linkend='igraph_community_optimal_modularity'>igraph_community_optimal_modularity</link></emphasis>(&amp;graph, &amp;modularity,
+    &amp;membership, <emphasis>/*verbose=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(modularity - 0.28125) &gt; 0.0000001) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_complementer.c.xml igraph-0.6.5/examples/simple/igraph_complementer.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_complementer.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_complementer.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,110 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g1, g2;
+  
+  <emphasis>/* complementer of the empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* the same without loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+  
+  <emphasis>/* complementer of the full graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g1, 5, IGRAPH_DIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g2) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* complementer of the full graph, results loops only */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g1, 5, IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/**************</emphasis>
+<emphasis>   * undirected *</emphasis>
+<emphasis>   *************/</emphasis>
+
+  <emphasis>/* complementer of the empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* the same without loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+  
+  <emphasis>/* complementer of the full graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g1, 5, IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g2) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis>/* complementer of the full graph, results loops only */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g1, 5, IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_complementer'>igraph_complementer</link></emphasis>(&amp;g2, &amp;g1, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g2, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_complex.c.xml igraph-0.6.5/examples/simple/igraph_complex.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_complex.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_complex.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,185 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+<emphasis role="strong">#define</emphasis> ARE 4
+<emphasis role="strong">#define</emphasis> AIM 5
+<emphasis role="strong">#define</emphasis> BRE 6
+<emphasis role="strong">#define</emphasis> BIM 2
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_complex_t a = <emphasis role="strong">igraph_complex</emphasis>(ARE, AIM);
+  igraph_complex_t b = <emphasis role="strong">igraph_complex</emphasis>(BRE, BIM);
+  igraph_complex_t c, d, e;
+  igraph_real_t m;
+
+  <emphasis>/* polar, mod, arg */</emphasis>
+  c=<emphasis role="strong">igraph_complex_polar</emphasis>(<emphasis role="strong">igraph_complex_mod</emphasis>(a), <emphasis role="strong">igraph_complex_arg</emphasis>(a));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a,c,1e-14)) { <emphasis role="strong">return</emphasis> 1; }
+  
+  <emphasis>/* add */</emphasis>
+  c=<emphasis role="strong">igraph_complex_add</emphasis>(a,b);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != ARE+BRE || <emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != AIM+BIM) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis>/* sub */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sub</emphasis>(a,b);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != ARE-BRE || <emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != AIM-BIM) { <emphasis role="strong">return</emphasis> 3; }
+
+  <emphasis>/* mul */</emphasis>
+  c=<emphasis role="strong">igraph_complex_mul</emphasis>(a,b);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != ARE*BRE-AIM*BIM || 
+      <emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != ARE*BIM+AIM*BRE) { <emphasis role="strong">return</emphasis> 4; }
+  
+  <emphasis>/* div */</emphasis>
+  c=<emphasis role="strong">igraph_complex_div</emphasis>(a,b);
+  c=<emphasis role="strong">igraph_complex_mul</emphasis>(c,b);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a,c,1e-14)) { <emphasis role="strong">return</emphasis> 5; }
+
+  <emphasis>/* add_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_add_real</emphasis>(a,<emphasis role="strong">IGRAPH_REAL</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a) + <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 6; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a)) { <emphasis role="strong">return</emphasis> 7; }
+
+  <emphasis>/* add_imag */</emphasis>
+  c=<emphasis role="strong">igraph_complex_add_imag</emphasis>(a,<emphasis role="strong">IGRAPH_IMAG</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a)) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) + <emphasis role="strong">IGRAPH_IMAG</emphasis>(b)) { <emphasis role="strong">return</emphasis> 9; }
+
+  <emphasis>/* sub_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sub_real</emphasis>(a,<emphasis role="strong">IGRAPH_REAL</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a) - <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 10; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a)) { <emphasis role="strong">return</emphasis> 11; }  
+
+  <emphasis>/* sub_imag */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sub_imag</emphasis>(a,<emphasis role="strong">IGRAPH_IMAG</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a)) { <emphasis role="strong">return</emphasis> 12; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) - <emphasis role="strong">IGRAPH_IMAG</emphasis>(b)) { <emphasis role="strong">return</emphasis> 13; }
+
+  <emphasis>/* mul_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_mul_real</emphasis>(a, <emphasis role="strong">IGRAPH_REAL</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a) * <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 14; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) * <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 15; }
+
+  <emphasis>/* mul_imag */</emphasis>
+  c=<emphasis role="strong">igraph_complex_mul_imag</emphasis>(a, <emphasis role="strong">IGRAPH_REAL</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != - <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) * <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 14; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != <emphasis role="strong">IGRAPH_REAL</emphasis>(a) * <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) { <emphasis role="strong">return</emphasis> 15; }  
+
+  <emphasis>/* div_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_div_real</emphasis>(a, <emphasis role="strong">IGRAPH_REAL</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong">IGRAPH_REAL</emphasis>(c) - <emphasis role="strong">IGRAPH_REAL</emphasis>(a) / <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) &gt; 1e-15) { 
+    <emphasis role="strong">return</emphasis> 16; 
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) - <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) / <emphasis role="strong">IGRAPH_REAL</emphasis>(b)) &gt; 1e-15) { 
+    <emphasis role="strong">return</emphasis> 17; 
+  }
+
+  <emphasis>/* div_imag */</emphasis>
+  c=<emphasis role="strong">igraph_complex_div_imag</emphasis>(a, <emphasis role="strong">IGRAPH_IMAG</emphasis>(b));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != <emphasis role="strong">IGRAPH_IMAG</emphasis>(a) / <emphasis role="strong">IGRAPH_IMAG</emphasis>(b)) { <emphasis role="strong">return</emphasis> 18; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != - <emphasis role="strong">IGRAPH_REAL</emphasis>(a) / <emphasis role="strong">IGRAPH_IMAG</emphasis>(b)) { <emphasis role="strong">return</emphasis> 19; }
+
+  <emphasis>/* conj */</emphasis>
+  c=<emphasis role="strong">igraph_complex_conj</emphasis>(a);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != ARE || <emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != -AIM) { <emphasis role="strong">return</emphasis> 20; }
+
+  <emphasis>/* neg */</emphasis>
+  c=<emphasis role="strong">igraph_complex_neg</emphasis>(a);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(c) != - <emphasis role="strong">IGRAPH_REAL</emphasis>(a) ||
+      <emphasis role="strong">IGRAPH_IMAG</emphasis>(c) != - <emphasis role="strong">IGRAPH_IMAG</emphasis>(a)) { <emphasis role="strong">return</emphasis> 21; }
+
+  <emphasis>/* inv */</emphasis>
+  c=<emphasis role="strong">igraph_complex_inv</emphasis>(a);
+  d=<emphasis role="strong">igraph_complex</emphasis>(1.0, 0.0);
+  e=<emphasis role="strong">igraph_complex_div</emphasis>(d, a);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, e, 1e-14)) { <emphasis role="strong">return</emphasis> 22; }
+
+  <emphasis>/* abs */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_complex_abs</emphasis>(a) != <emphasis role="strong">igraph_complex_mod</emphasis>(a)) { <emphasis role="strong">return</emphasis> 23; }
+
+  <emphasis>/* logabs */</emphasis>
+
+  <emphasis>/* sqrt */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sqrt</emphasis>(a);
+  d=<emphasis role="strong">igraph_complex_mul</emphasis>(c,c);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a, d, 1e-14)) { <emphasis role="strong">return</emphasis> 24; }
+
+  <emphasis>/* sqrt_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sqrt</emphasis>(<emphasis role="strong">igraph_complex</emphasis>(-1.0, 0.0));
+  d=<emphasis role="strong">igraph_complex_sqrt_real</emphasis>(-1.0);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, d, 1e-14)) { <emphasis role="strong">return</emphasis> 25; }
+
+  <emphasis>/* exp */</emphasis>
+  c=<emphasis role="strong">igraph_complex_exp</emphasis>(<emphasis role="strong">igraph_complex</emphasis>(0.0, M_PI));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, <emphasis role="strong">igraph_complex</emphasis>(-1.0, 0.0), 1e-14)) { 
+    <emphasis role="strong">return</emphasis> 26;
+  }
+
+  <emphasis>/* pow */</emphasis>  
+  c=<emphasis role="strong">igraph_complex_pow</emphasis>(<emphasis role="strong">igraph_complex</emphasis>(M_E, 0.0), <emphasis role="strong">igraph_complex</emphasis>(0.0, M_PI));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, <emphasis role="strong">igraph_complex</emphasis>(-1.0, 0.0), 1e-14)) { 
+    <emphasis role="strong">return</emphasis> 27;
+  }
+
+  <emphasis>/* pow_real */</emphasis>
+  c=<emphasis role="strong">igraph_complex_pow_real</emphasis>(a, 2.0);
+  d=<emphasis role="strong">igraph_complex_mul</emphasis>(a,a);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, d, 1e-12)) { <emphasis role="strong">return</emphasis> 28; }  
+
+  <emphasis>/* log */</emphasis>
+  c=<emphasis role="strong">igraph_complex_exp</emphasis>(<emphasis role="strong">igraph_complex_log</emphasis>(a));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a, c, 1e-14)) { <emphasis role="strong">return</emphasis> 29; }
+
+  <emphasis>/* log10 */</emphasis>
+  c=<emphasis role="strong">igraph_complex_pow</emphasis>(<emphasis role="strong">igraph_complex</emphasis>(10.0, 0), <emphasis role="strong">igraph_complex_log10</emphasis>(a));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a, c, 1e-14)) { <emphasis role="strong">return</emphasis> 30; }
+  
+  <emphasis>/* log_b */</emphasis>
+  c=<emphasis role="strong">igraph_complex_pow</emphasis>(b, <emphasis role="strong">igraph_complex_log_b</emphasis>(a, b));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(a, c, 1e-14)) { <emphasis role="strong">return</emphasis> 31; }
+
+  <emphasis>/* sin, cos */</emphasis>
+  c=<emphasis role="strong">igraph_complex_sin</emphasis>(a);
+  d=<emphasis role="strong">igraph_complex_cos</emphasis>(a);
+  e=<emphasis role="strong">igraph_complex_add</emphasis>(<emphasis role="strong">igraph_complex_mul</emphasis>(c,c), <emphasis role="strong">igraph_complex_mul</emphasis>(d,d));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(e, <emphasis role="strong">igraph_complex</emphasis>(1.0, 0.0), 1e-11)) { 
+    <emphasis role="strong">return</emphasis> 32;
+  }
+
+  <emphasis>/* tan */</emphasis>
+  c=<emphasis role="strong">igraph_complex_tan</emphasis>(a);
+  d=<emphasis role="strong">igraph_complex_div</emphasis>(<emphasis role="strong">igraph_complex_sin</emphasis>(a), <emphasis role="strong">igraph_complex_cos</emphasis>(a));
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_complex_eq_tol</emphasis>(c, d, 1e-14)) { <emphasis role="strong">return</emphasis> 33; }
+
+  <emphasis>/* sec */</emphasis>
+
+  <emphasis>/* csc */</emphasis>
+
+  <emphasis>/* cot */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_compose.c.xml igraph-0.6.5/examples/simple/igraph_compose.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_compose.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_compose.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,95 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g1, g2, res;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+
+  <emphasis>/* composition with the empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g2, 5, IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g1, &amp;g2);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;res) != 0) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g2, &amp;g1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;res) != 0) { 
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis>/* same but undirected */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g1, 5, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g2, 5, IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g1, &amp;g2);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;res) != 0) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g2, &amp;g1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;res) != 0) { 
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis>/* proper directed graph */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 2,4, 5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g2, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g1, &amp;g2);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis>/* undirected graph */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 0,4, 5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g2, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_compose'>igraph_compose</link></emphasis>(&amp;res, &amp;g1, &amp;g2);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_convergence_degree.c.xml igraph-0.6.5/examples/simple/igraph_convergence_degree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_convergence_degree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_convergence_degree.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,52 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> result;
+  long i;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result, 0);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 7, 0, 0,1,0,2,0,3,1,2,1,3,2,3,3,4,4,5,4,6,5,6, -1);
+  <emphasis role="strong">igraph_convergence_degree</emphasis>(&amp;g, &amp;result, 0, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++)
+    <emphasis role="strong">printf</emphasis>("%.4f ", (float)<emphasis role="strong"><link linkend='igraph_vector_e'>igraph_vector_e</link></emphasis>(&amp;result, i));
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, 1, 1,0,2,0,3,0,4,0,0,5, -1);
+  <emphasis role="strong">igraph_convergence_degree</emphasis>(&amp;g, &amp;result, 0, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g); i++)
+    <emphasis role="strong">printf</emphasis>("%.4f ", (float)<emphasis role="strong"><link linkend='igraph_vector_e'>igraph_vector_e</link></emphasis>(&amp;result, i));
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_convex_hull.c.xml igraph-0.6.5/examples/simple/igraph_convex_hull.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_convex_hull.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_convex_hull.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,63 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_real_t coords_array[][2] =
+   {{3, 2}, {5, 1}, {4, 4}, {6, 4}, {4, 3},
+    {2, 5}, {1, 3}, {2, 4}, {6, 3}, {9, 2}
+   };
+    
+  igraph_matrix_t coords, resmat;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> result;
+  long i;
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 10, 2);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;20; i++) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i/2, i%2) = coords_array[i/2][i%2];
+  
+  <emphasis>/* Testing with index output mode */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_convex_hull'>igraph_convex_hull</link></emphasis>(&amp;coords, &amp;result, 0))
+    <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;result); i++)
+    <emphasis role="strong">printf</emphasis>("%ld ", (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(result)[i]);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result);
+
+  <emphasis>/* Testing with coordinate output mode */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;resmat, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_convex_hull'>igraph_convex_hull</link></emphasis>(&amp;coords, 0, &amp;resmat))
+    <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;resmat); i++)
+    <emphasis role="strong">printf</emphasis>("%ld %ld ", (long)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(resmat, i, 0), (long)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(resmat, i, 1));
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;resmat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_copy.c.xml igraph-0.6.5/examples/simple/igraph_copy.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_copy.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_copy.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g1, g2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v1, v2;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v1, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[7]=2;
+
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v1, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_copy'>igraph_copy</link></emphasis>(&amp;g2, &amp;g1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g2, &amp;v2, 0);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;v1, &amp;v2)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_create.c.xml igraph-0.6.5/examples/simple/igraph_create.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_create.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_create.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,85 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v1, v2;
+  int ret;
+  
+  <emphasis>/* simple use */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v1, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v1, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 4) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;v1, &amp;v2)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* higher number of vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v1, 10, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;g, &amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;v1, &amp;v2)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* error: IGRAPH_EINVEVECTOR */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v1, 9);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[8]=0;
+  ret=<emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v1, 0, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVEVECTOR) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  
+  <emphasis>/* error: IGRAPH_EINVVID */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v1, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[7]=-1;
+  ret=<emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v1, 10, 1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_decompose.c.xml igraph-0.6.5/examples/simple/igraph_decompose.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_decompose.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_decompose.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,105 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">free_complist</emphasis>(igraph_vector_ptr_t *complist) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(complist); i++) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*complist)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*complist)[i]);
+  }
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t ring, g;
+  igraph_vector_ptr_t complist;
+  long int i;
+  igraph_real_t edges[]= { 0,1,1,2,2,0,
+		    3,4,4,5,5,6,
+		    8,9,9,10 };
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> idvect;
+
+  <emphasis>/* A ring, a single component */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring, 10, IGRAPH_UNDIRECTED, 0, 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;complist, 0);
+  <emphasis role="strong"><link linkend='igraph_decompose'>igraph_decompose</link></emphasis>(&amp;ring, &amp;complist, IGRAPH_WEAK, -1, 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(complist)[0], stdout);
+  <emphasis role="strong">free_complist</emphasis>(&amp;complist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring);
+  
+  <emphasis>/* random graph with a giant component */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 100, 4.0/100, 
+			  IGRAPH_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_decompose'>igraph_decompose</link></emphasis>(&amp;g, &amp;complist, IGRAPH_WEAK, -1, 20);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;complist) != 1) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">free_complist</emphasis>(&amp;complist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* a toy graph, three components maximum, with at least 2 vertices each */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, 
+		<emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, edges, <emphasis role="strong">sizeof</emphasis>(edges)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t)), 
+		0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_decompose'>igraph_decompose</link></emphasis>(&amp;g, &amp;complist, IGRAPH_WEAK, 3, 2);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;complist); i++) {
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(complist)[i], stdout);
+  }
+  <emphasis role="strong">free_complist</emphasis>(&amp;complist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* The same graph, this time with vertex attributes */</emphasis>
+<emphasis>/*   igraph_vector_init_seq(&amp;idvect, 0, igraph_vcount(&amp;g)-1); */</emphasis>
+<emphasis>/*   igraph_add_vertex_attribute(&amp;g, "id", IGRAPH_ATTRIBUTE_NUM); */</emphasis>
+<emphasis>/*   igraph_set_vertex_attributes(&amp;g, "id", IGRAPH_VS_ALL(&amp;g), &amp;idvect); */</emphasis>
+<emphasis>/*   igraph_vector_destroy(&amp;idvect); */</emphasis>
+
+<emphasis>/*   igraph_decompose(&amp;g, &amp;complist, IGRAPH_WEAK, 3, 2); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;igraph_vector_ptr_size(&amp;complist); i++) { */</emphasis>
+<emphasis>/*     igraph_t *comp=VECTOR(complist)[i]; */</emphasis>
+<emphasis>/*     igraph_es_t es; */</emphasis>
+<emphasis>/*     igraph_es_all(comp, &amp;es); */</emphasis>
+<emphasis>/*     while (!igraph_es_end(comp, &amp;es)) { */</emphasis>
+<emphasis>/*       igraph_real_t *from, *to;  */</emphasis>
+<emphasis>/*       igraph_get_vertex_attribute(comp, "id", igraph_es_from(comp, &amp;es), */</emphasis>
+<emphasis>/* 				  (void**) &amp;from, 0); */</emphasis>
+<emphasis>/*       igraph_get_vertex_attribute(comp, "id", igraph_es_to(comp, &amp;es), */</emphasis>
+<emphasis>/* 				  (void**) &amp;to, 0); */</emphasis>
+<emphasis>/*       printf("%li %li\n", (long int) *from, (long int) *to); */</emphasis>
+<emphasis>/*       igraph_es_next(comp, &amp;es); */</emphasis>
+<emphasis>/*     } */</emphasis>
+<emphasis>/*   } */</emphasis>
+  
+<emphasis>/*   free_complist(&amp;complist); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g);   */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;complist);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_degree.c.xml igraph-0.6.5/examples/simple/igraph_degree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_degree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_degree.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,211 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, seq;
+  int ret;
+  igraph_integer_t mdeg, nedges;
+  long int i;
+  long int ndeg;
+
+  <emphasis>/* Create graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_DIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+
+  <emphasis>/* Consistency check of the handshaking lemma. */</emphasis>
+  <emphasis>/* If d is the sum of all vertex degrees, then d = 2|E|. */</emphasis>
+  ndeg = 0;
+  nedges = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    ndeg += (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i];
+  }
+  <emphasis role="strong">if</emphasis> (ndeg != 2*nedges) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_UNDIRECTED);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis>/* Consistency check of the handshaking lemma. */</emphasis>
+  <emphasis>/* If d is the sum of all vertex degrees, then d = 2|E|. */</emphasis>
+  ndeg = 0;
+  nedges = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    ndeg += (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i];
+  }
+  <emphasis role="strong">if</emphasis> (ndeg != 2*nedges) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* Degree of the same vertex multiple times */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;seq, 3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(seq)[0]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(seq)[1]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(seq)[2]=2;
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;seq), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis>/* Errors */</emphasis>
+  ret=<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;seq), (igraph_neimode_t)0, 
+		    IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVMODE) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(seq)[0]=4;
+  ret=<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;seq), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 4;
+  }  
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;seq);
+
+  <emphasis>/* Maximum degree */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, 0 <emphasis>/*undirected*/</emphasis>, 0 <emphasis>/*undirected*/</emphasis>, 0<emphasis>/*uncircular*/</emphasis>);
+  <emphasis role="strong"><link linkend='igraph_maxdegree'>igraph_maxdegree</link></emphasis>(&amp;g, &amp;mdeg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (mdeg != 2) { 
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis>/* Consistency check of the handshaking lemma. */</emphasis>
+  <emphasis>/* If d is the sum of all vertex degrees, then d = 2|E|. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  ndeg = 0;
+  nedges = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    ndeg += (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i];
+  }
+  <emphasis role="strong">if</emphasis> (ndeg != 2*nedges) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 10, 0 <emphasis>/*undirected*/</emphasis>, 0<emphasis>/*no loops*/</emphasis>);
+  <emphasis role="strong"><link linkend='igraph_maxdegree'>igraph_maxdegree</link></emphasis>(&amp;g, &amp;mdeg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (mdeg != 9) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis>/* Consistency check of the handshaking lemma. */</emphasis>
+  <emphasis>/* If d is the sum of all vertex degrees, then d = 2|E|. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  ndeg = 0;
+  nedges = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    ndeg += (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i];
+  }
+  <emphasis role="strong">if</emphasis> (ndeg != 2*nedges) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+  <emphasis role="strong"><link linkend='igraph_maxdegree'>igraph_maxdegree</link></emphasis>(&amp;g, &amp;mdeg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (mdeg != 9) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  <emphasis role="strong"><link linkend='igraph_maxdegree'>igraph_maxdegree</link></emphasis>(&amp;g, &amp;mdeg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (mdeg != 1) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong"><link linkend='igraph_maxdegree'>igraph_maxdegree</link></emphasis>(&amp;g, &amp;mdeg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (mdeg != 9) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+  <emphasis>/* Consistency check of the handshaking lemma. */</emphasis>
+  <emphasis>/* If d is the sum of all vertex degrees, then d = 2|E|. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;v, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, IGRAPH_LOOPS);
+  ndeg = 0;
+  nedges = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    ndeg += (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i];
+  }
+  <emphasis role="strong">if</emphasis> (ndeg != 2*nedges) {
+    <emphasis role="strong">return</emphasis> 12;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_degree_sequence_game.c.xml igraph-0.6.5/examples/simple/igraph_degree_sequence_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_degree_sequence_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_degree_sequence_game.c.xml	2013-03-03 01:45:49.000000000 +0000
@@ -0,0 +1,99 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> outdeg, indeg, vec;
+  igraph_bool_t is_simple;
+
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;outdeg, 10, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0, 3.0);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;indeg, 10, 4.0, 4.0, 2.0, 2.0, 4.0, 4.0, 2.0, 2.0, 3.0, 3.0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, 0);
+
+  <emphasis>/* checking the simple method, undirected graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree_sequence_game'>igraph_degree_sequence_game</link></emphasis>(&amp;g, &amp;outdeg, 0, IGRAPH_DEGSEQ_SIMPLE);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10)
+	<emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1))
+	<emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* checking the Viger-Latapy method, undirected graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree_sequence_game'>igraph_degree_sequence_game</link></emphasis>(&amp;g, &amp;outdeg, 0, IGRAPH_DEGSEQ_VL);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10)
+	<emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple) || !is_simple)
+	<emphasis role="strong">return</emphasis> 4;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 0))
+	<emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* checking the simple method, directed graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree_sequence_game'>igraph_degree_sequence_game</link></emphasis>(&amp;g, &amp;outdeg, &amp;indeg, IGRAPH_DEGSEQ_SIMPLE);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10)
+	<emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1))
+	<emphasis role="strong">return</emphasis> 7;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1))
+	<emphasis role="strong">return</emphasis> 8;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* checking the no multiple edges method, undirected graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree_sequence_game'>igraph_degree_sequence_game</link></emphasis>(&amp;g, &amp;outdeg, 0, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10)
+	<emphasis role="strong">return</emphasis> 9;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple) || !is_simple)
+	<emphasis role="strong">return</emphasis> 10;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1))
+	<emphasis role="strong">return</emphasis> 11;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* checking the no multiple edges method, directed graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_degree_sequence_game'>igraph_degree_sequence_game</link></emphasis>(&amp;g, &amp;outdeg, &amp;indeg, IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10)
+	<emphasis role="strong">return</emphasis> 12;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple) || !is_simple)
+	<emphasis role="strong">return</emphasis> 13;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1))
+	<emphasis role="strong">return</emphasis> 14;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1))
+	<emphasis role="strong">return</emphasis> 15;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outdeg);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;indeg);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_delete_edges.c.xml igraph-0.6.5/examples/simple/igraph_delete_edges.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_delete_edges.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_delete_edges.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,85 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  int ret;
+  igraph_es_t es;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, IGRAPH_DIRECTED, 3,2, -1);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, es);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 3) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* error test, no such edge to delete */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, es);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">printf</emphasis>("Error code: %i\n", ret);
+    <emphasis role="strong">return</emphasis> 2;
+  } 
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 3) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis>/* error test, invalid vertex id */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, IGRAPH_DIRECTED, 10,2, -1);
+  ret=<emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, es);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 4;
+  } 
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 3) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  
+  <emphasis>/* error test, invalid (odd) length */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, IGRAPH_DIRECTED, 0,1,2, -1);
+  ret=<emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, es);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 6;
+  } 
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 3) {
+    <emphasis role="strong">return</emphasis> 7;
+  }  
+
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_delete_vertices.c.xml igraph-0.6.5/examples/simple/igraph_delete_vertices.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_delete_vertices.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_delete_vertices.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  int ret;
+
+  <emphasis>/* without edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 2, 0);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 3, 0);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 1, 0);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 4, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 15)  {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_delete_vertices'>igraph_delete_vertices</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(2));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 14)  {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+   
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* resize vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_delete_vertices'>igraph_delete_vertices</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(2));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 3) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 1) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+
+  <emphasis>/* error test */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_delete_vertices'>igraph_delete_vertices</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(3));
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_deterministic_optimal_imitation.c.xml igraph-0.6.5/examples/simple/igraph_deterministic_optimal_imitation.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_deterministic_optimal_imitation.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_deterministic_optimal_imitation.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,245 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for deterministic optimal imitation.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis>/* test parameters structure */</emphasis>
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  igraph_t *graph;
+  igraph_integer_t vertex;
+  igraph_optimal_t optimality;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *quantities;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *strategies;
+  igraph_neimode_t mode;
+  int retval;
+} strategy_test_t;
+
+<emphasis>/* Error tests. That is, we expect error codes to be returned from such tests.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_tests</emphasis>() {
+  igraph_t g, h;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat;
+  int i, n, ret;
+  strategy_test_t *test;
+
+  <emphasis>/* nonempty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;h, 0, 0);         <emphasis>/* empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quant, 1);  <emphasis>/* quantities vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;strat, 2);  <emphasis>/* strategies vector */</emphasis>
+
+  {
+    <emphasis>/* test parameters */</emphasis>
+    <emphasis>/*--graph--vertex--optimality--quantities--strategies--mode--retval--*/</emphasis>
+    <emphasis>/* null pointer for graph */</emphasis>
+    strategy_test_t null_graph = { NULL, 0, 0, NULL, NULL, IGRAPH_ALL, 
+				   IGRAPH_EINVAL };
+    <emphasis>/* null pointer for quantities vector */</emphasis>
+    strategy_test_t null_quant = { &amp;g, 0, 0, NULL, NULL, IGRAPH_ALL, 
+				   IGRAPH_EINVAL };
+    <emphasis>/* null pointer for strategies vector */</emphasis>
+    strategy_test_t null_strat = { &amp;g, 0, 0, &amp;quant, NULL, IGRAPH_ALL, 
+				   IGRAPH_EINVAL };
+    <emphasis>/* empty graph */</emphasis>
+    strategy_test_t empty_graph = {&amp;h, 0, 0, &amp;quant, &amp;strat, IGRAPH_ALL, 
+				   IGRAPH_EINVAL };
+    <emphasis>/* length of quantities vector different from number of vertices */</emphasis>
+    strategy_test_t qdiff_length = {&amp;g, 0, 0, &amp;quant, &amp;strat, IGRAPH_ALL, 
+				    IGRAPH_EINVAL };
+    <emphasis>/* length of strategies vector different from number of vertices */</emphasis>
+    strategy_test_t sdiff_length = {&amp;g, 0, 0, &amp;quant, &amp;strat, IGRAPH_ALL, 
+				    IGRAPH_EINVAL };
+    strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;null_graph,
+				     <emphasis>/* 2 */</emphasis> &amp;null_quant,
+				     <emphasis>/* 3 */</emphasis> &amp;null_strat,
+				     <emphasis>/* 4 */</emphasis> &amp;empty_graph,
+				     <emphasis>/* 5 */</emphasis> &amp;qdiff_length,
+				     <emphasis>/* 6 */</emphasis> &amp;sdiff_length};
+    n = 6;
+    <emphasis>/* Run the error tests. We expect an error to be raised for each test. */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+    i = 0;
+    <emphasis role="strong">while</emphasis> (i &lt; n) {
+      test = all_checks[i];
+      ret = <emphasis role="strong"><link linkend='igraph_deterministic_optimal_imitation'>igraph_deterministic_optimal_imitation</link></emphasis>(test-&gt;graph,
+						   test-&gt;vertex,
+						   test-&gt;optimality,
+						   test-&gt;quantities,
+						   test-&gt;strategies,
+						   test-&gt;mode);
+      <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+	<emphasis role="strong">printf</emphasis>("Error test no. %d failed.\n", (int)(i + 1));
+	<emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+      }
+      i++;
+    }
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;h);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* Updating the strategy of an isolated vertex. In this case, the strategies</emphasis>
+<emphasis> * vector should not change at all.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">isolated_vertex_test</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat, v;
+  int i, ret;
+
+  <emphasis>/* graph with one isolated vertex */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 1, 0);  <emphasis>/* new vertex 3 is isolated */</emphasis>
+  <emphasis>/* quantities vector: all vertices have the same fitness */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, 4, 0.25, 0.25, 0.25, 0.25);
+  <emphasis>/* strategies vector: 0 means aggressive strategy; 1 means passive */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, 4, 1., 0., 1., 0.);
+  <emphasis>/* make a copy of the original strategies vector for comparison later on */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;v, &amp;strat);
+  <emphasis>/* Now update strategy of vertex 3. Since this vertex is isolated, no */</emphasis>
+  <emphasis>/* strategy update would take place. The resulting strategies vector */</emphasis>
+  <emphasis>/* would be the same as it was originally. */</emphasis>
+  ret = <emphasis role="strong"><link linkend='igraph_deterministic_optimal_imitation'>igraph_deterministic_optimal_imitation</link></emphasis>(<emphasis>/*graph*/</emphasis> &amp;g,
+  					       <emphasis>/*vertex*/</emphasis> 3,
+  					       <emphasis>/*optimality*/</emphasis> IGRAPH_MAXIMUM,
+  					       <emphasis>/*quantities*/</emphasis> &amp;quant,
+  					       <emphasis>/*strategies*/</emphasis> &amp;strat,
+  					       <emphasis>/*mode*/</emphasis> IGRAPH_ALL);
+  <emphasis role="strong">if</emphasis> (ret) {
+    <emphasis role="strong">printf</emphasis>("Isolated vertex test failed.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;strat); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(strat)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]) {
+      <emphasis role="strong">printf</emphasis>("Isolated vertex test failed.\n");
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* A game on the Petersen graph. This graph has 10 vertices and 15 edges.</emphasis>
+<emphasis> * The Petersen graph is initialized with a default quantities vector and a</emphasis>
+<emphasis> * default strategies vector. For each vertex v in the graph, we update the</emphasis>
+<emphasis> * strategy of v via deterministic optimal imitation. The resulting updated</emphasis>
+<emphasis> * strategies vector is compared with the known result vector. A mismatch would</emphasis>
+<emphasis> * raise an error code. If the updated strategies vector matches the known</emphasis>
+<emphasis> * result vector, we reset the strategies vector to its default state and</emphasis>
+<emphasis> * repeat the game with another vertex.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">petersen_game_test</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> known_max_v, known_min_v, quant, strat, stratcopy;
+  int i, nedge, nvert;  
+
+  <emphasis>/* the Petersen graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n=*/</emphasis> 0, IGRAPH_UNDIRECTED, 
+	       0,1,0,4,0,5, 1,2,1,6, 2,3,2,7, 3,4,3,8, 4,9,
+	       5,7,5,8, 6,8,6,9, 7,9, -1);
+  nedge = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis>/* Strategies vector, one strategy for each vertex. Thus vec[i] is the */</emphasis>
+  <emphasis>/* strategy of vertex i. The strategy space is: {0, 1, 2, 3}. */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, nvert, 
+			  1., 1., 2., 2., 0.,
+			  0., 0., 1., 2., 3.);
+  <emphasis>/* Quantities vector, one quantity per vertex. Thus vec[i] is the */</emphasis>
+  <emphasis>/* quantity for vertex i. */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, nvert, 
+			  0.3, 1.1, 0.5, 1.0, 0.9, 
+			  0.8, 0.4, 0.1, 0.7, 0.7);
+  <emphasis>/* Known strategies that would be adopted. Thus vec[i] means that in */</emphasis>
+  <emphasis>/* game i where we revise the strategy of vertex i, the strategy */</emphasis>
+  <emphasis>/* vec[i] would be adopted by i. */</emphasis>
+  <emphasis>/*maximum deterministic imitation*/</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known_max_v, nvert, 
+			  1., 1., 1., 2., 2., 
+			  0., 1., 0., 2., 0.);
+  <emphasis>/*minimum deterministic imitation*/</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known_min_v, nvert,
+			  1., 1., 1., 2., 1.,
+			  1., 0., 1., 0., 1.);
+  <emphasis>/* play game and compare resulting updated strategies */</emphasis>
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; nvert; i++) {
+    <emphasis>/* maximum deterministic imitation */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcopy, &amp;strat);
+    <emphasis role="strong"><link linkend='igraph_deterministic_optimal_imitation'>igraph_deterministic_optimal_imitation</link></emphasis>(<emphasis>/*graph*/</emphasis> &amp;g,
+					   <emphasis>/*vertex*/</emphasis> (igraph_integer_t)i,
+					   <emphasis>/*optimality*/</emphasis> IGRAPH_MAXIMUM,
+					   <emphasis>/*quantities*/</emphasis> &amp;quant,
+					   <emphasis>/*strategies*/</emphasis> &amp;stratcopy,
+					   <emphasis>/*neighbours*/</emphasis> IGRAPH_ALL);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcopy)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(known_max_v)[i]) {
+      <emphasis role="strong">printf</emphasis>("Maximum deterministic imitation failed for vertex %d.\n", i);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcopy);
+    <emphasis>/* minimum deterministic imitation */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcopy, &amp;strat);
+    <emphasis role="strong"><link linkend='igraph_deterministic_optimal_imitation'>igraph_deterministic_optimal_imitation</link></emphasis>(<emphasis>/*graph*/</emphasis> &amp;g,
+					   <emphasis>/*vertex*/</emphasis> (igraph_integer_t)i,
+					   <emphasis>/*optimality*/</emphasis> IGRAPH_MINIMUM,
+					   <emphasis>/*quantities*/</emphasis> &amp;quant,
+					   <emphasis>/*strategies*/</emphasis> &amp;stratcopy,
+					   <emphasis>/*neighbours*/</emphasis> IGRAPH_ALL);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcopy)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(known_min_v)[i]) {
+      <emphasis role="strong">printf</emphasis>("Minimum deterministic imitation failed for vertex %d.\n", i);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcopy);
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known_max_v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known_min_v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_tests</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+  ret = <emphasis role="strong">isolated_vertex_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+  ret = <emphasis role="strong">petersen_game_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_diameter.c.xml igraph-0.6.5/examples/simple/igraph_diameter.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_diameter.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_diameter.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,62 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_integer_t result;
+  igraph_integer_t from, to;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> path;
+  
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 30, <emphasis>/*power=*/</emphasis> 1, 30, 0, 0, <emphasis>/*A=*/</emphasis> 1, 
+		       IGRAPH_DIRECTED, IGRAPH_BARABASI_BAG, 
+		       <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_diameter'>igraph_diameter</link></emphasis>(&amp;g, &amp;result, 0, 0, 0, IGRAPH_UNDIRECTED, 1);
+  
+<emphasis>/*   printf("Diameter: %li\n", (long int) result); */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;path, 0);
+  <emphasis role="strong"><link linkend='igraph_diameter'>igraph_diameter</link></emphasis>(&amp;g, &amp;result, &amp;from, &amp;to, &amp;path, IGRAPH_DIRECTED, 1);
+  <emphasis role="strong">printf</emphasis>("diameter: %li, from %li to %li\n", (long int) result,
+	 (long int) from, (long int) to);
+  <emphasis role="strong">print_vector</emphasis>(&amp;path);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;path);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_difference.c.xml igraph-0.6.5/examples/simple/igraph_difference.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_difference.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_difference.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,122 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t orig, sub, diff;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+
+  <emphasis>/* Subtract from itself */</emphasis>
+  <emphasis role="strong">printf</emphasis>("subtract itself\n");
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,1,2,2,1,4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;orig, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_difference'>igraph_difference</link></emphasis>(&amp;diff, &amp;orig, &amp;orig);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;diff, stdout);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;diff) != 0 ||
+      <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;diff) != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;orig)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;orig);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;diff);
+
+  <emphasis>/* Same for undirected graph */</emphasis>
+  <emphasis role="strong">printf</emphasis>("subtract itself, undirected\n");
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,1,2,2,1,4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;orig, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 1,0,1,2,2,1,4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;sub, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_difference'>igraph_difference</link></emphasis>(&amp;diff, &amp;orig, &amp;sub);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;diff, stdout);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;diff) != 0 ||
+      <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;diff) != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;orig)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;orig);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;sub);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;diff);
+  
+  <emphasis>/* Subtract the empty graph */</emphasis>
+  <emphasis role="strong">printf</emphasis>("subtract empty\n");
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,1,2,2,1,4,5, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;orig, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;sub, 3, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_difference'>igraph_difference</link></emphasis>(&amp;diff, &amp;orig, &amp;sub);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;diff, stdout);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;diff) != <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;orig) ||
+      <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;diff) != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;orig)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;orig);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;sub);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;diff);
+
+  <emphasis>/* A `real' example */</emphasis>
+  <emphasis role="strong">printf</emphasis>("real example\n");
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,1,2,2,1,4,5,8,9, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;orig, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,5,4,2,1,6,7, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;sub, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_difference'>igraph_difference</link></emphasis>(&amp;diff, &amp;orig, &amp;sub);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;diff, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;diff);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;orig);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;sub);  
+
+  <emphasis>/* undirected version */</emphasis>
+  <emphasis role="strong">printf</emphasis>("real example, undirected\n");
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,1,2,2,1,4,5,8,9,8,10,8,13,8,11,8,12, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;orig, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,5,4,2,1,6,7,8,10,8,13, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;sub, &amp;v, 0, IGRAPH_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong"><link linkend='igraph_difference'>igraph_difference</link></emphasis>(&amp;diff, &amp;orig, &amp;sub);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;diff, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;diff);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;orig);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;sub);  
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_disjoint_union.c.xml igraph-0.6.5/examples/simple/igraph_disjoint_union.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_disjoint_union.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_disjoint_union.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,96 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, l=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;l; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t left, right, uni;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_vector_ptr_t glist;
+  long int i;
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;left, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,2, 2,4, -1); 
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;right, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_disjoint_union'>igraph_disjoint_union</link></emphasis>(&amp;uni, &amp;left, &amp;right);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;uni, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;left);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;right);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);
+
+  <emphasis>/* Empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 0);
+  <emphasis role="strong"><link linkend='igraph_disjoint_union_many'>igraph_disjoint_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;uni) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;uni) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);
+
+  <emphasis>/* Non-empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 10); 
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]=<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(igraph_t));
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,0, -1);
+    <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i], &amp;v, 0, IGRAPH_DIRECTED);    
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_disjoint_union_many'>igraph_disjoint_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;uni, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eccentricity.c.xml igraph-0.6.5/examples/simple/igraph_eccentricity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eccentricity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eccentricity.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sts=2 sw=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-12  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> ecc;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;ecc, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_eccentricity'>igraph_eccentricity</link></emphasis>(&amp;g, &amp;ecc, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;ecc);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+  <emphasis role="strong"><link linkend='igraph_eccentricity'>igraph_eccentricity</link></emphasis>(&amp;g, &amp;ecc, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;ecc);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+  <emphasis role="strong"><link linkend='igraph_eccentricity'>igraph_eccentricity</link></emphasis>(&amp;g, &amp;ecc, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;ecc);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;ecc);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_edge_betweenness.c.xml igraph-0.6.5/examples/simple/igraph_edge_betweenness.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_edge_betweenness.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_edge_betweenness.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,85 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, "%.5f\n", (double) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> eb; 
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_edge_betweenness'>igraph_edge_betweenness</link></emphasis>(&amp;g, &amp;eb, IGRAPH_UNDIRECTED, <emphasis>/*weights=*/</emphasis> 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eb, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+    0, 1, 0, 2, 0, 3, 1, 4, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_edge_betweenness_estimate'>igraph_edge_betweenness_estimate</link></emphasis>(&amp;g, &amp;eb, IGRAPH_UNDIRECTED, 2, 
+				   <emphasis>/*weights=*/</emphasis> 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eb, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+    0, 1, 0, 3, 1, 2, 1, 4, 2, 5, 3, 4, 3, 6, 4, 5, 4, 7, 5, 8,
+    6, 7, 7, 8, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_edge_betweenness_estimate'>igraph_edge_betweenness_estimate</link></emphasis>(&amp;g, &amp;eb, IGRAPH_UNDIRECTED, 2,
+				   <emphasis>/*weights=*/</emphasis> 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eb, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,125 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  int nodes=10;
+  igraph_real_t triplets[] = { 1,0, 1/4.0,       0,1, 1/3.0, 
+			       2,0, 1/4.0,       0,2, 1/3.0,
+			       3,0, 1.0,         0,3, 1/3.0,
+			       4,1, 1.0,         1,4, 1/4.0,
+			       5,1, 1.0,         1,5, 1/4.0,
+			       6,1, 1.0,         1,6, 1/4.0,
+			       7,2, 1.0,         2,7, 1/4.0,
+			       8,2, 1.0,         2,8, 1/4.0,
+			       9,2, 1.0,         2,9, 1/4.0 };
+  
+  igraph_sparsemat_t mat;
+  int i, n=<emphasis role="strong">sizeof</emphasis>(triplets) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t);
+  igraph_eigen_which_t which;
+  igraph_vector_complex_t values, values2;
+  igraph_matrix_complex_t vectors, vectors2;
+  igraph_matrix_t mat2;
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;mat, nodes, nodes, n/3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i+=3) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;mat, triplets[i], triplets[i+1], triplets[i+2]);
+  }
+
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=1;
+
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors, 0, 0);
+
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, <emphasis>/*sparsemat=*/</emphasis> &amp;mat, <emphasis>/*fun=*/</emphasis> 0, 
+		      nodes, <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_REAL</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0)) &lt; 0) { 
+    <emphasis role="strong">igraph_matrix_complex_scale</emphasis>(&amp;vectors, <emphasis role="strong">igraph_complex</emphasis>(-1.0, -0.0 ));
+  }
+
+  <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_print</emphasis>(&amp;vectors);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;mat);
+
+  <emphasis>/* Calcualate all eigenvalues, using SM and LM and then check that they </emphasis>
+<emphasis>     are the same, in opposite order. We use a random matrix this time. */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, nodes, nodes);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) {
+    int j;
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat2, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  
+  which.pos=IGRAPH_EIGEN_SM;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values2, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors2, 0, 0);
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values2, &amp;vectors2);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">DUMP</emphasis>() <emphasis role="strong">do</emphasis> {				\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);	\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values2);	\
+  } <emphasis role="strong">while</emphasis>(0)
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) { 
+    int j;
+    igraph_real_t d=
+      <emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[i],
+					    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[nodes-i-1]));
+    <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) { 
+      igraph_real_t d=
+	<emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, i), 
+					      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j,
+						     nodes-i-1)));
+      <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 3; }
+    }
+  }
+  
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors);  
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values2);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors2);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix2.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix2.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,108 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">DUMP</emphasis>() <emphasis role="strong">do</emphasis> {				\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);	\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values2);	\
+  } <emphasis role="strong">while</emphasis>(0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis role="strong">const</emphasis> int nodes=10;
+  igraph_matrix_t mat2;
+  igraph_vector_complex_t values, values2;
+  igraph_matrix_complex_t vectors, vectors2;
+  igraph_eigen_which_t which;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, nodes, nodes);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) {
+    int j;
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat2, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+
+  <emphasis>/* Test LR, a single eigenvalue first */</emphasis>
+  
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors, 0, 0);
+  which.pos=IGRAPH_EIGEN_LR;
+  which.howmany=1;
+  
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which,
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  
+  <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_print</emphasis>(&amp;vectors);  
+  
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors);
+  
+  <emphasis>/* LR, and SR, all eigenvalues */</emphasis>
+  
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors, 0, 0);
+  which.pos=IGRAPH_EIGEN_LR;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values2, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors2, 0, 0);
+  which.pos=IGRAPH_EIGEN_SR;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values2, &amp;vectors2);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) { 
+    int j;
+    igraph_real_t d=
+      <emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[i],
+					    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[nodes-i-1]));
+    <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) { 
+      igraph_real_t d=
+	<emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, i), 
+					      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j,
+						     nodes-i-1)));
+      <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 3; }
+    }
+  }
+
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors);  
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values2);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors2);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix3.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix3.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,90 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">DUMP</emphasis>() <emphasis role="strong">do</emphasis> {				\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);	\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values2);	\
+  } <emphasis role="strong">while</emphasis>(0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis role="strong">const</emphasis> int nodes=10, skip=3;
+  igraph_matrix_t mat2;
+  igraph_vector_complex_t values, values2;
+  igraph_matrix_complex_t vectors, vectors2;
+  igraph_eigen_which_t which;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, nodes, nodes);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) {
+    int j;
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat2, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+
+  which.pos=IGRAPH_EIGEN_SELECT;
+  which.il=skip; 
+  which.iu=nodes-skip;
+
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors, 0, 0);
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  
+  which.pos=IGRAPH_EIGEN_ALL;
+
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values2, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors2, 0, 0);
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which,
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values2, &amp;vectors2);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes-skip*2+1; i++) {
+    int j;
+    igraph_real_t d=
+      <emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[i], 
+					    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[i+skip-1]));
+    <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) {
+      igraph_real_t d=
+	<emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, i), 
+					      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j, i+skip-1)));
+      <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 3; }
+    }
+  }
+  
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values2);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix4.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix4.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix4.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix4.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,93 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">DUMP</emphasis>() <emphasis role="strong">do</emphasis> {				\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);	\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values2);	\
+  } <emphasis role="strong">while</emphasis>(0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis role="strong">const</emphasis> int nodes=10, skip=3;
+  igraph_matrix_t mat2;
+  igraph_vector_complex_t values, values2;
+  igraph_matrix_complex_t vectors, vectors2;
+  igraph_eigen_which_t which;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, nodes, nodes);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) {
+    int j;
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat2, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors, 0, 0);
+  which.pos=IGRAPH_EIGEN_LI;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which,
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;values2, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;vectors2, 0, 0);
+  which.pos=IGRAPH_EIGEN_SI;
+  which.howmany=nodes;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;mat2, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, nodes, 
+		      <emphasis>/*extra=*/</emphasis> 0, IGRAPH_EIGEN_LAPACK, &amp;which, 
+		      <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, &amp;values2, &amp;vectors2);
+
+  <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;values2);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) { 
+    int j;
+    igraph_real_t d=
+      <emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[i],
+					    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[nodes-i-1]));
+    <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;nodes; j++) { 
+      igraph_real_t d=
+	<emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, i), 
+					      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j,
+						     nodes-i-1)));
+      <emphasis role="strong">if</emphasis> (d &gt; 1e-15) { <emphasis role="strong">DUMP</emphasis>(); <emphasis role="strong">return</emphasis> 3; }
+    }
+  }
+
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;values2);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;vectors2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix_symmetric.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix_symmetric.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix_symmetric.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix_symmetric.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,123 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+int <emphasis role="strong">check_ev</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values,
+	     <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors) {
+
+  int i, n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A);
+  int ne=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, lhs, rhs;
+
+  <emphasis role="strong">if</emphasis> (ne != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values)) {
+    <emphasis role="strong">printf</emphasis>("'values' and 'vectors' sizes do not match\n");
+    <emphasis role="strong">exit</emphasis>(1);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lhs, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;rhs, n);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;ne; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors, 0, i), n);
+    <emphasis role="strong"><link linkend='igraph_blas_dgemv'>igraph_blas_dgemv</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1, A, &amp;v, 
+		      <emphasis>/*beta=*/</emphasis> 0, &amp;lhs);
+    <emphasis role="strong"><link linkend='igraph_vector_update'>igraph_vector_update</link></emphasis>(&amp;rhs, &amp;v);
+    <emphasis role="strong"><link linkend='igraph_vector_scale'>igraph_vector_scale</link></emphasis>(&amp;rhs, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values)[i]);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;lhs, &amp;rhs) &gt; 1e-10) { 
+      <emphasis role="strong">printf</emphasis>("LHS: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lhs);
+      <emphasis role="strong">printf</emphasis>("RHS: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;rhs);
+      <emphasis role="strong">exit</emphasis>(2);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;rhs);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lhs);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_matrix_t A;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values;
+  igraph_matrix_t vectors;
+  int i, j;
+  igraph_eigen_which_t which;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42 * 42);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+
+  <emphasis>/* All eigenvalues and eigenvectors */</emphasis>
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=i; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, j, i) = 
+	<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=5;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_LAPACK, &amp;which, <emphasis>/*options=*/</emphasis> 0,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors);
+
+  which.howmany=8;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_LAPACK, &amp;which, <emphasis>/*options=*/</emphasis> 0,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors);
+
+  which.pos=IGRAPH_EIGEN_BE;
+  which.howmany=5;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_LAPACK, &amp;which, <emphasis>/*options=*/</emphasis> 0,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors);
+
+  which.pos=IGRAPH_EIGEN_SM;
+  which.howmany=5;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_LAPACK, &amp;which, <emphasis>/*options=*/</emphasis> 0,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix_symmetric_arpack.c.xml igraph-0.6.5/examples/simple/igraph_eigen_matrix_symmetric_arpack.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_eigen_matrix_symmetric_arpack.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_eigen_matrix_symmetric_arpack.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,124 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+int <emphasis role="strong">check_ev</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A, <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values,
+	     <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors, int err_off) {
+
+  int i, n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A);
+  int ne=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, lhs, rhs;
+
+  <emphasis role="strong">if</emphasis> (ne != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values)) {
+    <emphasis role="strong">printf</emphasis>("'values' and 'vectors' sizes do not match\n");
+    <emphasis role="strong">exit</emphasis>(err_off + 1);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lhs, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;rhs, n);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;ne; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors, 0, i), n);
+    <emphasis role="strong"><link linkend='igraph_blas_dgemv'>igraph_blas_dgemv</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1, A, &amp;v, 
+		      <emphasis>/*beta=*/</emphasis> 0, &amp;lhs);
+    <emphasis role="strong"><link linkend='igraph_vector_update'>igraph_vector_update</link></emphasis>(&amp;rhs, &amp;v);
+    <emphasis role="strong"><link linkend='igraph_vector_scale'>igraph_vector_scale</link></emphasis>(&amp;rhs, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values)[i]);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;lhs, &amp;rhs) &gt; 1e-10) { 
+      <emphasis role="strong">printf</emphasis>("LHS %i: ", i); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lhs);
+      <emphasis role="strong">printf</emphasis>("RHS %i: ", i); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;rhs);
+      <emphasis role="strong">exit</emphasis>(err_off + 2);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;rhs);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lhs);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_matrix_t A;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values;
+  igraph_matrix_t vectors;
+  int i, j;
+  igraph_eigen_which_t which;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42 * 42);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=i; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, j, i) = 
+	<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=2;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+  				IGRAPH_EIGEN_ARPACK, &amp;which, &amp;options,
+  				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors, 0);
+
+  which.howmany=8;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+  				IGRAPH_EIGEN_ARPACK, &amp;which, &amp;options,
+  				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors, 10);
+
+  which.pos=IGRAPH_EIGEN_BE;
+  which.howmany=5;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_ARPACK, &amp;which, &amp;options,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors, 20);
+
+  which.pos=IGRAPH_EIGEN_SM;
+  which.howmany=5;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;A, <emphasis>/*sA=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, DIM, <emphasis>/*extra=*/</emphasis> 0,
+				IGRAPH_EIGEN_ARPACK, &amp;which, &amp;options,
+				<emphasis>/*storage=*/</emphasis> 0, &amp;values, &amp;vectors);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors, 30);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_empty.c.xml igraph-0.6.5/examples/simple/igraph_empty.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_empty.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_empty.c.xml	2013-03-03 01:45:50.000000000 +0000
@@ -0,0 +1,80 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  int ret;
+
+  <emphasis>/* empty directed graph, zero vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 0, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* empty undirected graph, zero vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* empty directed graph, 20 vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 20, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 20) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* empty undirected graph, 30 vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 30, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 30) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* error: negative number of vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, -1, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_erdos_renyi_game.c.xml igraph-0.6.5/examples/simple/igraph_erdos_renyi_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_erdos_renyi_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_erdos_renyi_game.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,215 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  int i, ret;
+  igraph_bool_t simple;
+  
+  <emphasis>/* G(n,p) */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 0.0, 
+			  IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 1.0,
+			  IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*9) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* More useful tests */</emphasis>
+<emphasis>/*   printf("directed with loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 0.9999999,
+			    IGRAPH_DIRECTED, IGRAPH_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 5; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*10) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*9) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+<emphasis>/*   printf("directed without loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 0.9999999,
+			    IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 7; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*9) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+  
+<emphasis>/*   printf("undirected with loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 0.9999999,
+			    IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 9; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10+1)/2) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)/2) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+<emphasis>/*   printf("undirected without loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 10, 0.9999999,
+			    IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 11; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)/2) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)/2) { <emphasis role="strong">return</emphasis> 77; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }    
+
+  <emphasis>/* Create a couple of large graphs too */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 100000, 2.0/100000,
+			  IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 25; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 100000, 2.0/100000,
+			  IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 25; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 100000, 2.0/100000,
+			  IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 25; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, 100000, 2.0/100000,
+			  IGRAPH_DIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 25; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+
+  <emphasis>/* --------------------------------------------------------------------- */</emphasis>
+  <emphasis>/* G(n,m) */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 10, 0.5,
+			  IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* More useful tests */</emphasis>
+<emphasis>/*   printf("directed with loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    long int ec;
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 10, 10*10-1,
+			    IGRAPH_DIRECTED, IGRAPH_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 13; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*10-1) { <emphasis role="strong">return</emphasis> 14; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+    <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 27; }
+    ec=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+    <emphasis role="strong">if</emphasis> (ec != 10*9 &amp;&amp; ec != 10*9-1) { <emphasis role="strong">return</emphasis> 15; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+<emphasis>/*   printf("directed without loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 10, 10*9-1,
+			    IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+    <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+    <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 28; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 16; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)-1) { <emphasis role="strong">return</emphasis> 17; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*9-1) { <emphasis role="strong">return</emphasis> 18; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+  
+<emphasis>/*   printf("undirected with loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    long int ec;
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 10, 10*11/2-1,
+			    IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 19; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10+1)/2-1) { <emphasis role="strong">return</emphasis> 20; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+    <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 29; }
+    ec=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+    <emphasis role="strong">if</emphasis> (ec != 10*(10-1)/2 &amp;&amp; ec != 10*9/2-1) { <emphasis role="strong">return</emphasis> 21; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+<emphasis>/*   printf("undirected without loops\n"); */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 10, 10*9/2-1,
+			    IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+    <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+    <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 30; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10) { <emphasis role="strong">return</emphasis> 22; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)/2-1) { <emphasis role="strong">return</emphasis> 23; }
+    <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis>0, <emphasis>/*loops=*/</emphasis>1, <emphasis>/*edge_comb=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10*(10-1)/2-1) { <emphasis role="strong">return</emphasis> 24; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }  
+
+  <emphasis>/* Create a couple of large graphs too */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 100000, 2.0*100000,
+			  IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 200000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 31; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 100000, 2.0*100000,
+			  IGRAPH_DIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 32; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 200000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 100000, 2.0*100000,
+			  IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 200000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 0, 1, <emphasis>/*edge_comb=*/</emphasis> 0);	<emphasis>/* only remove loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 33; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, 100000, 2.0*100000,
+			  IGRAPH_DIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 200000) { <emphasis role="strong">return</emphasis> 26; }
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 0, 1, <emphasis>/*edge_comb=*/</emphasis> 0);	<emphasis>/* only remove loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;simple);
+  <emphasis role="strong">if</emphasis> (!simple) { <emphasis role="strong">return</emphasis> 34; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_es_adj.c.xml igraph-0.6.5/examples/simple/igraph_es_adj.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_es_adj.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_es_adj.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,127 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">igraph_vector_print</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> v=IGRAPH_VECTOR_NULL;
+  igraph_real_t edges1[] = { 0,1, 1,2, 2,2, 2,3, 2,4, 3,4 };
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> was;
+  igraph_integer_t size;
+  igraph_es_t it;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, edges1, <emphasis role="strong">sizeof</emphasis>(edges1)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;was, 0);
+
+  <emphasis>/******************************************/</emphasis>
+  <emphasis>/* Directed graph                         */</emphasis>
+  <emphasis>/******************************************/</emphasis>
+ 
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_DIRECTED);
+  
+  <emphasis>/* Simple test, all neighbors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;=<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_es_adj</emphasis>(&amp;g, &amp;it, i, IGRAPH_ALL);
+    <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;it, &amp;size);
+    <emphasis role="strong">printf</emphasis>("%ld\n", (long)size);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_es_end</emphasis>(&amp;g, &amp;it)) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;was, <emphasis role="strong">igraph_es_adj_vertex</emphasis>(&amp;g, &amp;it));
+      <emphasis role="strong">igraph_es_next</emphasis>(&amp;g, &amp;it);
+    }
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;was);
+  }
+
+  <emphasis>/* Simple test, outgoing neighbors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;=<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_es_adj</emphasis>(&amp;g, &amp;it, i, IGRAPH_OUT);
+    <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;it, &amp;size);
+    <emphasis role="strong">printf</emphasis>("%ld\n", (long)size);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_es_end</emphasis>(&amp;g, &amp;it)) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;was, <emphasis role="strong">igraph_es_adj_vertex</emphasis>(&amp;g, &amp;it));
+      <emphasis role="strong">igraph_es_next</emphasis>(&amp;g, &amp;it);
+    }
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;was);
+  }
+
+
+  <emphasis>/* Simple test, incoming neighbors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;=<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_es_adj</emphasis>(&amp;g, &amp;it, i, IGRAPH_IN);
+    <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;it, &amp;size);
+    <emphasis role="strong">printf</emphasis>("%ld\n", (long)size);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_es_end</emphasis>(&amp;g, &amp;it)) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;was, <emphasis role="strong">igraph_es_adj_vertex</emphasis>(&amp;g, &amp;it));
+      <emphasis role="strong">igraph_es_next</emphasis>(&amp;g, &amp;it);
+    }
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;was);
+  }
+		       
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/******************************************/</emphasis>
+  <emphasis>/* Undirected graph                       */</emphasis>
+  <emphasis>/******************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_UNDIRECTED);
+
+  <emphasis>/* Simple test, all neighbors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;=<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_es_adj</emphasis>(&amp;g, &amp;it, i, IGRAPH_ALL);
+    <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;it, &amp;size);
+    <emphasis role="strong">printf</emphasis>("%ld\n", (long)size);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_es_end</emphasis>(&amp;g, &amp;it)) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;was, <emphasis role="strong">igraph_es_adj_vertex</emphasis>(&amp;g, &amp;it));
+      <emphasis role="strong">igraph_es_next</emphasis>(&amp;g, &amp;it);
+    }
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;was);
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;was);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;was);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_es_fromto.c.xml igraph-0.6.5/examples/simple/igraph_es_fromto.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_es_fromto.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_es_fromto.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">igraph_vector_print</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> v=IGRAPH_VECTOR_NULL;
+  igraph_real_t edges1[] = { 0,1, 1,2, 2,2, 2,3, 2,4, 3,4 };
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> from, to;  
+  igraph_es_t it;
+  igraph_integer_t size;
+  long int i;
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, edges1, <emphasis role="strong">sizeof</emphasis>(edges1)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+
+  <emphasis>/******************************************/</emphasis>
+  <emphasis>/* Directed graph                         */</emphasis>
+  <emphasis>/******************************************/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_DIRECTED);
+  
+  <emphasis>/* {0,1} -&gt; {2,3}, result should be { 1-&gt;2 } */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;from, 2); <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(from)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(from)[1]=1;
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;to, 2);   <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(to)  [0]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(to)  [1]=3;
+  <emphasis role="strong"><link linkend='igraph_es_fromto'>igraph_es_fromto</link></emphasis>(&amp;g, &amp;it, <emphasis role="strong">IGRAPH_VS_VECTOR</emphasis>(&amp;g, &amp;from), 
+		   <emphasis role="strong">IGRAPH_VS_VECTOR</emphasis>(&amp;g, &amp;to), IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;from); <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;to);
+  <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;it, &amp;size);
+  <emphasis role="strong">printf</emphasis>("%ld\n", (long)size);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_es_end</emphasis>(&amp;g, &amp;it)) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;from, <emphasis role="strong">igraph_es_from</emphasis>(&amp;g, &amp;it));
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;to, <emphasis role="strong">igraph_es_to</emphasis>(&amp;g, &amp;it));
+    <emphasis role="strong">igraph_es_next</emphasis>(&amp;g, &amp;it);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;from); <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;to);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;from); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;to);
+
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;it);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;from);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;to);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_es_pairs.c.xml igraph-0.6.5/examples/simple/igraph_es_pairs.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_es_pairs.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_es_pairs.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,79 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  long int i;
+  igraph_integer_t size;
+
+  <emphasis>/* DIRECTED */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);  
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    igraph_es_t es;
+    igraph_eit_t it;
+    <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, IGRAPH_DIRECTED, 
+			  0,1,0,2,0,5,0,2,0,3,0,4,0,7,0,9, -1);
+    <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(&amp;g, es, &amp;it);
+    <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;es, &amp;size);
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_RESET'>IGRAPH_EIT_RESET</link></emphasis>(it);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(it)) {
+      <emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(it);
+      <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(it);
+      size--;
+    }
+    <emphasis role="strong">if</emphasis> (size != 0) <emphasis role="strong">return</emphasis> 1;
+    <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* UNDIRECTED */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    igraph_es_t es;
+    igraph_eit_t it;
+    <emphasis role="strong"><link linkend='igraph_es_pairs_small'>igraph_es_pairs_small</link></emphasis>(&amp;es, IGRAPH_DIRECTED,
+			  0,1,2,0,5,0,0,2,3,0,0,4,7,0,0,9, -1);
+    <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(&amp;g, es, &amp;it);
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_RESET'>IGRAPH_EIT_RESET</link></emphasis>(it);
+    <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(it)) {
+      <emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(it);
+      <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(it);
+    }
+    <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;it);
+    <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_es_path.c.xml igraph-0.6.5/examples/simple/igraph_es_path.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_es_path.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_es_path.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,74 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_es_t es;
+  igraph_eit_t eit;
+  igraph_integer_t size;
+
+  <emphasis>/* DIRECTED */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 0, 1);
+  <emphasis role="strong">igraph_es_path_small</emphasis>(&amp;es, IGRAPH_DIRECTED, 0,1,2,3,4,5,6,7,8,9,0,1,2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(&amp;g, es, &amp;eit);
+  <emphasis role="strong"><link linkend='igraph_es_size'>igraph_es_size</link></emphasis>(&amp;g, &amp;es, &amp;size);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(eit)) {
+    long int edge=<emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(eit);
+    igraph_integer_t from, to;
+    <emphasis role="strong"><link linkend='igraph_edge'>igraph_edge</link></emphasis>(&amp;g, edge, &amp;from, &amp;to);
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(eit);
+    size--;
+  }
+  <emphasis role="strong">if</emphasis> (size != 0) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;eit);
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* UNDIRECTED */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 0, 1);
+  <emphasis role="strong">igraph_es_path_small</emphasis>(&amp;es, IGRAPH_DIRECTED, 
+		       0,1,2,3,4,3,2,3,4,5,6,5,4,5,6,7,8,9,0,1,0,9, -1);
+  <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(&amp;g, es, &amp;eit);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(eit)) {
+    long int edge=<emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(eit);
+    igraph_integer_t from, to;
+    <emphasis role="strong"><link linkend='igraph_edge'>igraph_edge</link></emphasis>(&amp;g, edge, &amp;from, &amp;to);
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(eit);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;eit);
+  <emphasis role="strong"><link linkend='igraph_es_destroy'>igraph_es_destroy</link></emphasis>(&amp;es);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_feedback_arc_set.c.xml igraph-0.6.5/examples/simple/igraph_feedback_arc_set.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_feedback_arc_set.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_feedback_arc_set.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;string.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights, result;
+  igraph_bool_t dag;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result, 0);
+
+  <emphasis>/***********************************************************************/</emphasis>
+  <emphasis>/* Approximation with Eades' method                                    */</emphasis>
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Simple unweighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, 0, IGRAPH_FAS_APPROX_EADES);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Simple weighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 1, 1, 3, 1, 1, 1, 1, 1, 1, -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, &amp;weights, IGRAPH_FAS_APPROX_EADES);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Simple unweighted graph with loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, 1,1, 4,4, -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, 0, IGRAPH_FAS_APPROX_EADES);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_feedback_arc_set_ip.c.xml igraph-0.6.5/examples/simple/igraph_feedback_arc_set_ip.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_feedback_arc_set_ip.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_feedback_arc_set_ip.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,93 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;string.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights, result;
+  igraph_bool_t dag;
+  int retval;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result, 0);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(&amp;<link linkend='igraph_error_handler_printignore'>igraph_error_handler_printignore</link>);
+
+  <emphasis>/***********************************************************************/</emphasis>
+  <emphasis>/* Exact solution with integer programming                             */</emphasis>
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Simple unweighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, -1);
+  retval = <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, 0, IGRAPH_FAS_EXACT_IP);
+  <emphasis role="strong">if</emphasis> (retval == IGRAPH_UNIMPLEMENTED)
+    <emphasis role="strong">return</emphasis> 77;
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Simple weighted graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 1, 1, 3, 1, 1, 1, 1, 1, 1, -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, &amp;weights, IGRAPH_FAS_EXACT_IP);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Simple unweighted graph with loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,0, 2,3, 2,4, 0,4, 4,3, 5,0, 6,5, 1,1, 4,4, -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, 0, IGRAPH_FAS_EXACT_IP);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Disjoint union of two almost identical graphs */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED,
+      0,1, 1,2, 2,0, 2,3,  2,4,  0,4,  4,3,    5,0,  6,5, 1,1, 4,4,
+      7,8, 8,9, 9,7, 9,10, 9,11, 7,11, 11,10, 12,7, 13,12,
+      -1);
+  <emphasis role="strong"><link linkend='igraph_feedback_arc_set'>igraph_feedback_arc_set</link></emphasis>(&amp;g, &amp;result, 0, IGRAPH_FAS_EXACT_IP);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_delete_edges'>igraph_delete_edges</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_ess_vector'>igraph_ess_vector</link></emphasis>(&amp;result));
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;dag);
+  <emphasis role="strong">if</emphasis> (!dag)
+    <emphasis role="strong">return</emphasis> 4;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_fisher_yates_shuffle.c.xml igraph-0.6.5/examples/simple/igraph_fisher_yates_shuffle.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_fisher_yates_shuffle.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_fisher_yates_shuffle.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,107 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for the Fisher-Yates shuffle.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">R_INTEGER</emphasis>(a,b) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), (a), (b)))
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">R_UNIF</emphasis>(a,b) (<emphasis role="strong"><link linkend='igraph_rng_get_unif'>igraph_rng_get_unif</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), (a), (b)))
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_real_t d;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> u, v;
+  int ret;
+  long int i, k, n;
+
+  <emphasis>/********************************</emphasis>
+<emphasis>   * Example usage</emphasis>
+<emphasis>   ********************************/</emphasis>
+
+  <emphasis>/* Sequences with one element. Such sequences are trivially permuted.</emphasis>
+<emphasis>   * The result of any Fisher-Yates shuffle on a sequence with one element</emphasis>
+<emphasis>   * must be the original sequence itself.</emphasis>
+<emphasis>   */</emphasis>
+  n = 1;
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, n);
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+  k = <emphasis role="strong">R_INTEGER</emphasis>(-1000, 1000);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0] = k;
+  <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0] != k) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  d = <emphasis role="strong">R_UNIF</emphasis>(-1000.0, 1000.0);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0] = d;
+  <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0] != d) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* Sequences with multiple elements. A Fisher-Yates shuffle of a sequence S</emphasis>
+<emphasis>   * is a random permutation \pi(S) of S. Thus \pi(S) must have the same</emphasis>
+<emphasis>   * length and elements as the original sequence S. A major difference between</emphasis>
+<emphasis>   * S and its random permutation \pi(S) is that the order in which elements</emphasis>
+<emphasis>   * appear in \pi(S) is probably different from how elements are ordered in S.</emphasis>
+<emphasis>   * If S has length n = 1, then both \pi(S) and S are equivalent sequences in</emphasis>
+<emphasis>   * that \pi(S) is merely S and no permutation has taken place. If S has</emphasis>
+<emphasis>   * length n &gt; 1, then there are n! possible permutations of S. Assume that</emphasis>
+<emphasis>   * each such permutation is equally likely to appear as a result of the</emphasis>
+<emphasis>   * Fisher-Yates shuffle. As n increases, the probability that S is different</emphasis>
+<emphasis>   * from \pi(S) also increases. We have a probability of 1 / n! that S and</emphasis>
+<emphasis>   * \pi(S) are equivalent sequences.</emphasis>
+<emphasis>   */</emphasis>
+  n = 100;
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;u, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, n);
+
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    k = <emphasis role="strong">R_INTEGER</emphasis>(-1000, 1000);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(u)[i] = k;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] = k;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+  <emphasis>/* must have same length */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v) != n) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;u) != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis>/* must have same elements */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;u);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;u, &amp;v)) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;u);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* empty sequence */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  ret = <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_full.c.xml igraph-0.6.5/examples/simple/igraph_full.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_full.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_full.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,30 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_get_all_shortest_paths_dijkstra.c.xml igraph-0.6.5/examples/simple/igraph_get_all_shortest_paths_dijkstra.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_get_all_shortest_paths_dijkstra.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_get_all_shortest_paths_dijkstra.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,174 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">check_nrgeo</emphasis>(igraph_t *graph, igraph_vs_t vs,
+                 igraph_vector_ptr_t* paths,
+                 <link linkend='igraph_vector_t'>igraph_vector_t</link>* nrgeo) {
+  long int i, n;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> nrgeo2, *path;
+  igraph_vit_t vit;
+
+  n = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;nrgeo2, n);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(nrgeo) != n) {
+    <emphasis role="strong">printf</emphasis>("nrgeo vector length must be %ld, was %ld", n,
+        <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(nrgeo));
+    <emphasis role="strong">return</emphasis>;
+  }
+
+  n = <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(paths);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    path = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*paths)[i];
+    <emphasis role="strong">if</emphasis> (path == 0) {
+      <emphasis role="strong">printf</emphasis>("Null path found in result vector at index %ld\n", i);
+      <emphasis role="strong">return</emphasis>;
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(path) == 0) {
+      <emphasis role="strong">printf</emphasis>("Empty path found in result vector at index %ld\n", i);
+      <emphasis role="strong">return</emphasis>;
+    }
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo2)[(long int)<emphasis role="strong"><link linkend='igraph_vector_tail'>igraph_vector_tail</link></emphasis>(path)] += 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(graph, vs, &amp;vit);
+  <emphasis role="strong">for</emphasis> (<emphasis role="strong"><link linkend='IGRAPH_VIT_RESET'>IGRAPH_VIT_RESET</link></emphasis>(vit); !<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit); <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit)) {
+    long int node = <emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*nrgeo)[node] - <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo2)[node]) {
+      <emphasis role="strong">printf</emphasis>("nrgeo[%ld] invalid, observed = %ld, expected = %ld\n",
+          node, (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*nrgeo)[node], (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo2)[node]);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;nrgeo2);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_vector_ptr_t res;
+  long int i;
+  igraph_real_t weights[] = { 1, 2, 3, 4, 5, 1, 1, 1, 1, 1 }; 
+  igraph_real_t weights2[] = { 0,2,1, 0,5,2, 1,1,0, 2,2,8, 1,1,3, 1,1,4, 2,1 };
+  igraph_real_t dim[] = { 4, 4 };
+
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights_vec, dim_vec, nrgeo;
+  igraph_vs_t vs;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;nrgeo, 0);
+
+  <emphasis>/* Simple ring graph without weights */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 0, 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;res, 5);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 1, 3, 4, 5, 2, 1,  -1);
+  
+  <emphasis role="strong"><link linkend='igraph_get_all_shortest_paths_dijkstra'>igraph_get_all_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> &amp;res, 
+				     <emphasis>/*nrgeo=*/</emphasis> &amp;nrgeo, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     <emphasis>/*weights=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong">check_nrgeo</emphasis>(&amp;g, vs, &amp;res, &amp;nrgeo);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;res); i++) {
+    <emphasis role="strong">igraph_vector_print</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i] = 0;
+  }
+
+  <emphasis>/* Same ring, but with weights */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights_vec, weights, <emphasis role="strong">sizeof</emphasis>(weights)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_all_shortest_paths_dijkstra'>igraph_get_all_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> &amp;res, 
+				     <emphasis>/*nrgeo=*/</emphasis> &amp;nrgeo, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     <emphasis>/*weights=*/</emphasis> &amp;weights_vec, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong">check_nrgeo</emphasis>(&amp;g, vs, &amp;res, &amp;nrgeo);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;res); i++) {
+    <emphasis role="strong">igraph_vector_print</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i] = 0;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* More complicated example */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,1, 0,2, 0,3,    1,2, 1,4, 1,5,
+	       2,3, 2,6,         3,2, 3,6,
+	       4,5, 4,7,         5,6, 5,8, 5,9,
+	       7,5, 7,8,         8,9,
+	       5,2,
+	       2,1,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights_vec, weights2, <emphasis role="strong">sizeof</emphasis>(weights2)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_all_shortest_paths_dijkstra'>igraph_get_all_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> &amp;res, 
+				     <emphasis>/*nrgeo=*/</emphasis> &amp;nrgeo, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     <emphasis>/*weights=*/</emphasis> &amp;weights_vec, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+
+  <emphasis role="strong">check_nrgeo</emphasis>(&amp;g, vs, &amp;res, &amp;nrgeo);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;res); i++) {
+    <emphasis role="strong">igraph_vector_print</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i] = 0;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Regular lattice with some heavyweight edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;dim_vec, dim, <emphasis role="strong">sizeof</emphasis>(dim)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_lattice'>igraph_lattice</link></emphasis>(&amp;g, &amp;dim_vec, 1, 0, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 3, 12, 15, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights_vec, 24);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;weights_vec, 1);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights_vec)[2] = 100; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights_vec)[8] = 100; <emphasis>/* 1--&gt;2, 4--&gt;8 */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_get_all_shortest_paths_dijkstra'>igraph_get_all_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0,
+				     <emphasis>/*nrgeo=*/</emphasis> &amp;nrgeo, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     <emphasis>/*weights=*/</emphasis> &amp;weights_vec, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights_vec);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">printf</emphasis>("%ld ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo)[3]);
+  <emphasis role="strong">printf</emphasis>("%ld ", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo)[12]);
+  <emphasis role="strong">printf</emphasis>("%ld\n", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(nrgeo)[15]);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;nrgeo);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_get_eid.c.xml igraph-0.6.5/examples/simple/igraph_get_eid.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_get_eid.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_get_eid.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,161 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_integer_t eid;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> hist;
+  long int i;
+  int ret;
+
+  <emphasis>/* DIRECTED */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;hist, 9);
+
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_get_eid'>igraph_get_eid</link></emphasis>(&amp;g, &amp;eid, 0, i, IGRAPH_DIRECTED, <emphasis>/*error=*/</emphasis> 1);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(hist)[ (long int) eid ] = 1;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;hist, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;hist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* UNDIRECTED */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;hist, 9);
+
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_get_eid'>igraph_get_eid</link></emphasis>(&amp;g, &amp;eid, 0, i, IGRAPH_UNDIRECTED, <emphasis>/*error=*/</emphasis> 1);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(hist)[ (long int) eid ] += 1;
+    <emphasis role="strong"><link linkend='igraph_get_eid'>igraph_get_eid</link></emphasis>(&amp;g, &amp;eid, i, 0, IGRAPH_DIRECTED, <emphasis>/*error=*/</emphasis> 1);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(hist)[ (long int) eid ] += 1;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;hist, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;hist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* NON-EXISTANT EDGE */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, 0);
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  
+  ret=<emphasis role="strong"><link linkend='igraph_get_eid'>igraph_get_eid</link></emphasis>(&amp;g, &amp;eid, 5, 6, IGRAPH_UNDIRECTED, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+<emphasis>/* Stress test */</emphasis>
+
+<emphasis>/* int main() { */</emphasis>
+
+<emphasis>/*   igraph_t g; */</emphasis>
+<emphasis>/*   long int i, n; */</emphasis>
+<emphasis>/*   igraph_integer_t from, to, eid; */</emphasis>
+
+<emphasis>/*   igraph_barabasi_game(&amp;g, 10000, 100, 0, 0, 1); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 1, 1); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, to, from, 0, 1); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+
+<emphasis>/*   igraph_barabasi_game(&amp;g, 10000, 100, 0, 0, 0); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, to, from, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+
+<emphasis>/*   igraph_erdos_renyi_game(&amp;g, IGRAPH_ERDOS_RENYI_GNP, */</emphasis>
+<emphasis>/* 			  2000, 100.0/2000, 0, 0); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, to, from, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+
+<emphasis>/*   igraph_full(&amp;g, 500, 0, 0); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+  
+<emphasis>/*   igraph_star(&amp;g, 20000, IGRAPH_STAR_OUT, 0); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+
+<emphasis>/*   igraph_star(&amp;g, 20000, IGRAPH_STAR_IN, 0); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+
+<emphasis>/*   igraph_star(&amp;g, 2000000, IGRAPH_STAR_UNDIRECTED, 1999999); */</emphasis>
+<emphasis>/*   n=igraph_ecount(&amp;g); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;n; i++) { */</emphasis>
+<emphasis>/*     igraph_edge(&amp;g, i, &amp;from, &amp;to); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, from, to, 0, 1); */</emphasis>
+<emphasis>/*     igraph_get_eid(&amp;g, &amp;eid, to, from, 0, 1); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+    
+<emphasis>/*   return 0; */</emphasis>
+<emphasis>/* } */</emphasis>
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_get_eids.c.xml igraph-0.6.5/examples/simple/igraph_get_eids.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_get_eids.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_get_eids.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,217 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2008-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">check_simple</emphasis>() {
+
+  igraph_t g;
+  long int nodes=100;
+  long int edges=1000;
+  igraph_real_t p=3.0/nodes;
+  long int runs=10;
+  long int r, e, ecount;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> eids, pairs, path;
+
+  <emphasis role="strong">srand</emphasis>(<emphasis role="strong">time</emphasis>(0));
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;pairs, edges*2);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;path, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eids, 0);
+
+  <emphasis role="strong">for</emphasis> (r=0; r&lt;runs; r++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNP, nodes, p, 
+			    <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+    ecount=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+    <emphasis role="strong">for</emphasis> (e=0; e&lt;edges; e++) {
+      long int edge=<emphasis role="strong">RNG_INTEGER</emphasis>(0, ecount-1);
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(pairs)[2*e] = <emphasis role="strong">IGRAPH_FROM</emphasis>(&amp;g, edge);
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(pairs)[2*e+1] = <emphasis role="strong">IGRAPH_TO</emphasis>(&amp;g, edge);
+    }
+    <emphasis role="strong"><link linkend='igraph_get_eids'>igraph_get_eids</link></emphasis>(&amp;g, &amp;eids, &amp;pairs, <emphasis>/*path=*/</emphasis> 0, 0, <emphasis>/*error=*/</emphasis> 1);
+    <emphasis role="strong">for</emphasis> (e=0; e&lt;edges; e++) {
+      long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eids)[e];
+      long int from1=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(pairs)[2*e];
+      long int to1=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(pairs)[2*e+1];
+      long int from2=<emphasis role="strong">IGRAPH_FROM</emphasis>(&amp;g, edge);
+      long int to2=<emphasis role="strong">IGRAPH_TO</emphasis>(&amp;g, edge);
+      long int min1= from1 &lt; to1 ? from1 : to1;
+      long int max1= from1 &lt; to1 ? to1 : from1;
+      long int min2= from2 &lt; to2 ? from2 : to2;
+      long int max2= from2 &lt; to2 ? to2 : from2;
+      <emphasis role="strong">if</emphasis> (min1 != min2 || max1 != max2) {
+	<emphasis role="strong">return</emphasis> 11;
+      }
+    }
+    
+    <emphasis role="strong"><link linkend='igraph_diameter'>igraph_diameter</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> 0, &amp;path,
+		    IGRAPH_UNDIRECTED, <emphasis>/*unconn=*/</emphasis> 1);
+    <emphasis role="strong"><link linkend='igraph_get_eids'>igraph_get_eids</link></emphasis>(&amp;g, &amp;eids, <emphasis>/*pairs=*/</emphasis> 0, &amp;path, 0, <emphasis>/*error=*/</emphasis> 1);
+    <emphasis role="strong">for</emphasis> (e=0; e&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;path)-1; e++) {
+      long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eids)[e];
+      long int from1=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(path)[e];
+      long int to1=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(path)[e+1];
+      long int from2=<emphasis role="strong">IGRAPH_FROM</emphasis>(&amp;g, edge);
+      long int to2=<emphasis role="strong">IGRAPH_TO</emphasis>(&amp;g, edge);
+      long int min1= from1 &lt; to1 ? from1 : to1;
+      long int max1= from1 &lt; to1 ? to1 : from1;
+      long int min2= from2 &lt; to2 ? from2 : to2;
+      long int max2= from2 &lt; to2 ? to2 : from2;
+      <emphasis role="strong">if</emphasis> (min1 != min2 || max1 != max2) {
+	<emphasis role="strong">return</emphasis> 12;
+      }
+    }
+
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;path);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;pairs);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eids);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">check_multi</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> eids, eids2;
+  int ret;
+  long int i;
+
+  igraph_real_t q1[] = { 0,1, 0,1 };
+  igraph_real_t q2[] = { 0,1, 0,1, 0,1 };
+  igraph_real_t q3[] = { 1,0, 3,4, 1,0, 0,1, 3,4, 0,1 };
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eids, 0);
+
+  <emphasis>/*********************************/</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n=*/</emphasis> 10, <emphasis>/*directed=*/</emphasis> 1, 
+	       0,1, 0,1, 1,0, 1,2, 3,4, 3,4, 3,4, 3,5, 3,7, 
+	       9,8,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vec, q1, <emphasis role="strong">sizeof</emphasis>(q1) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids, &amp;vec, 0, <emphasis>/*directed=*/</emphasis> 1, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;eids);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eids, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vec, q2, <emphasis role="strong">sizeof</emphasis>(q2) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids, &amp;vec, 0, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;eids);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eids, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vec, q2, <emphasis role="strong">sizeof</emphasis>(q2) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids, &amp;vec, 0, <emphasis>/*directed=*/</emphasis> 1, <emphasis>/*error=*/</emphasis>1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) { <emphasis role="strong">return</emphasis> 1; } 
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_abort'>igraph_error_handler_abort</link>);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis>/*********************************/</emphasis>
+
+  <emphasis>/*********************************/</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n=*/</emphasis>10, <emphasis>/*directed=*/</emphasis>0, 
+	       0,1, 1,0, 0,1, 3,4, 3,4, 5,4, 9,8, 
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vec, q1, <emphasis role="strong">sizeof</emphasis>(q1) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids, &amp;vec, 0, <emphasis>/*directed=*/</emphasis>1, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;eids);
+  <emphasis role="strong">print_vector</emphasis>(&amp;eids, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vec, q3, <emphasis role="strong">sizeof</emphasis>(q3) / <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids, &amp;vec, 0, <emphasis>/*directed=*/</emphasis>0, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_abort'>igraph_error_handler_abort</link>);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/*********************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eids);
+
+  <emphasis>/*********************************/</emphasis>
+  <emphasis>/* Speed tests */</emphasis>
+
+<emphasis role="strong">#define</emphasis> NODES 10000
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, <emphasis>/*n=*/</emphasis> NODES, <emphasis>/*power=*/</emphasis> 1.0, <emphasis>/*m=*/</emphasis> 3, 
+		       <emphasis>/*outseq=*/</emphasis> 0, <emphasis>/*outpref=*/</emphasis> 0, <emphasis>/*A=*/</emphasis> 1,
+		       <emphasis>/*directed=*/</emphasis> 1, IGRAPH_BARABASI_BAG,
+		       <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loops=*/</emphasis> 0, <emphasis>/*edge_comb=*/</emphasis> 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eids, NODES/2);
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;eids, 0, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)-1, NODES/2);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, NODES);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;NODES/2; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[2*i]   = <emphasis role="strong">IGRAPH_FROM</emphasis>(&amp;g, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eids)[i]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[2*i+1] = <emphasis role="strong">IGRAPH_TO</emphasis>(&amp;g, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eids)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eids2, 0);
+  <emphasis role="strong"><link linkend='igraph_get_eids_multi'>igraph_get_eids_multi</link></emphasis>(&amp;g, &amp;eids2, &amp;vec, 0, <emphasis>/*directed=*/</emphasis> 1, <emphasis>/*error=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;eids, &amp;eids2)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis>/**/</emphasis>
+
+<emphasis>  for (i=0; i</emphasis><emphasis role="strong">&lt;NODES</emphasis>/2; i++) {
+    VECTOR(vec)[2*i]   = IGRAPH_TO(&amp;g, VECTOR(eids)[i]);
+    VECTOR(vec)[2*i+1] = IGRAPH_FROM(&amp;g, VECTOR(eids)[i]);
+  }
+  igraph_get_eids_multi(&amp;g, &amp;eids2, &amp;vec, 0, /*directed=*/ 0, /*error=*/ 1);
+  if (!igraph_vector_all_e(&amp;eids, &amp;eids2)) {
+    return 4;
+  }
+
+  igraph_vector_destroy(&amp;eids);
+  igraph_vector_destroy(&amp;eids2);
+  igraph_vector_destroy(&amp;vec);
+  igraph_destroy(&amp;g);
+		  
+  /*********************************/
+
+  return 0;
+}
+
+int main() {
+  int ret;
+
+  if ( (ret=check_simple()) != 0) { return ret; }
+  if ( (ret=check_multi()) != 0)  { return ret; }
+
+  return 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_get_shortest_paths.c.xml igraph-0.6.5/examples/simple/igraph_get_shortest_paths.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_get_shortest_paths.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_get_shortest_paths.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,112 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, l=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;l; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">check_evecs</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph, <emphasis role="strong">const</emphasis> igraph_vector_ptr_t *vecs,
+		<emphasis role="strong">const</emphasis> igraph_vector_ptr_t *evecs, int error_code) {
+
+  igraph_bool_t directed=<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(graph);
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(vecs);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(evecs) != n) { <emphasis role="strong">exit</emphasis>(error_code+1); }
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *vvec=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vecs)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *evec=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*evecs)[i];
+    long int j, n2=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(evec);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(vvec) == 0 &amp;&amp; n2==0) { <emphasis role="strong">continue</emphasis>; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(vvec) != n2+1) { <emphasis role="strong">exit</emphasis>(error_code+2); }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;n2; j++) {
+      long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*evec)[j];
+      long int from=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vvec)[j];
+      long int to=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vvec)[j+1];
+      <emphasis role="strong">if</emphasis> (directed) {
+	<emphasis role="strong">if</emphasis> (from != <emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge) ||
+	    to   != <emphasis role="strong">IGRAPH_TO</emphasis>  (graph, edge)) {
+	  <emphasis role="strong">exit</emphasis>(error_code);
+	}
+      } <emphasis role="strong">else</emphasis> {
+	long int from2=<emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge);
+	long int to2=<emphasis role="strong">IGRAPH_TO</emphasis>(graph, edge);
+	long int min1= from &lt; to ? from : to;
+	long int max1= from &lt; to ? to : from;
+	long int min2= from2 &lt; to2 ? from2 : to2;
+	long int max2= from2 &lt; to2 ? to2 : from2;
+	<emphasis role="strong">if</emphasis> (min1 != min2 || max2 != max2) { <emphasis role="strong">exit</emphasis>(error_code+3); }
+      }
+    }
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_vector_ptr_t vecs, evecs;
+  long int i;
+  igraph_vs_t vs;
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 0, 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;vecs, 5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;evecs, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i] = <emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i], 0);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i] = <emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i], 0);
+  }
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 1, 3, 5, 2, 1,  -1);
+  
+  <emphasis role="strong"><link linkend='igraph_get_shortest_paths'>igraph_get_shortest_paths</link></emphasis>(&amp;g, &amp;vecs, &amp;evecs, 0, vs, IGRAPH_OUT);
+
+  <emphasis role="strong">check_evecs</emphasis>(&amp;g, &amp;vecs, &amp;evecs, 10);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) {
+    <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;vecs);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;evecs);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_get_shortest_paths_dijkstra.c.xml igraph-0.6.5/examples/simple/igraph_get_shortest_paths_dijkstra.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_get_shortest_paths_dijkstra.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_get_shortest_paths_dijkstra.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,155 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, l=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;l; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">check_evecs</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph, <emphasis role="strong">const</emphasis> igraph_vector_ptr_t *vecs,
+		<emphasis role="strong">const</emphasis> igraph_vector_ptr_t *evecs, int error_code) {
+
+  igraph_bool_t directed=<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(graph);
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(vecs);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(evecs) != n) { <emphasis role="strong">exit</emphasis>(error_code+1); }
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *vvec=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vecs)[i];
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *evec=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*evecs)[i];
+    long int j, n2=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(evec);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(vvec) == 0 &amp;&amp; n2==0) { <emphasis role="strong">continue</emphasis>; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(vvec) != n2+1) { <emphasis role="strong">exit</emphasis>(error_code+2); }
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;n2; j++) {
+      long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*evec)[j];
+      long int from=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vvec)[j];
+      long int to=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vvec)[j+1];
+      <emphasis role="strong">if</emphasis> (directed) {
+	<emphasis role="strong">if</emphasis> (from != <emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge) ||
+	    to   != <emphasis role="strong">IGRAPH_TO</emphasis>  (graph, edge)) {
+	  <emphasis role="strong">exit</emphasis>(error_code);
+	}
+      } <emphasis role="strong">else</emphasis> {
+	long int from2=<emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge);
+	long int to2=<emphasis role="strong">IGRAPH_TO</emphasis>(graph, edge);
+	long int min1= from &lt; to ? from : to;
+	long int max1= from &lt; to ? to : from;
+	long int min2= from2 &lt; to2 ? from2 : to2;
+	long int max2= from2 &lt; to2 ? to2 : from2;
+	<emphasis role="strong">if</emphasis> (min1 != min2 || max2 != max2) { <emphasis role="strong">exit</emphasis>(error_code+3); }
+      }
+    }
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_vector_ptr_t vecs, evecs;
+  long int i;
+  igraph_real_t weights[] = { 1, 2, 3, 4, 5, 1, 1, 1, 1, 1 }; 
+  igraph_real_t weights2[] = { 0,2,1, 0,5,2, 1,1,0, 2,2,8, 1,1,3, 1,1,4, 2,1 };
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights_vec;
+  igraph_vs_t vs;
+
+  <emphasis>/* Simple ring graph without weights */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 0, 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;vecs, 5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;evecs, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i] = <emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i], 0);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i] = <emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i], 0);
+  }
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 1, 3, 5, 2, 1,  -1);
+  
+  <emphasis role="strong"><link linkend='igraph_get_shortest_paths_dijkstra'>igraph_get_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*vertices=*/</emphasis> &amp;vecs, 
+				     <emphasis>/*edges=*/</emphasis> &amp;evecs, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     <emphasis>/*weights=*/</emphasis> 0, <emphasis>/*mode=*/</emphasis> IGRAPH_OUT);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) 
+    <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+
+  <emphasis role="strong">check_evecs</emphasis>(&amp;g, &amp;vecs, &amp;evecs, 10);
+
+  <emphasis>/* Same ring, but with weights */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights_vec, weights, <emphasis role="strong">sizeof</emphasis>(weights)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_shortest_paths_dijkstra'>igraph_get_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*vertices=*/</emphasis> &amp;vecs, 
+				     <emphasis>/*edges=*/</emphasis> &amp;evecs, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     &amp;weights_vec, IGRAPH_OUT);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) 
+    <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+
+  <emphasis role="strong">check_evecs</emphasis>(&amp;g, &amp;vecs, &amp;evecs, 20);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* More complicated example */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,1, 0,2, 0,3,    1,2, 1,4, 1,5,
+	       2,3, 2,6,         3,2, 3,6,
+	       4,5, 4,7,         5,6, 5,8, 5,9,
+	       7,5, 7,8,         8,9,
+	       5,2,
+	       2,1,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;weights_vec, weights2, <emphasis role="strong">sizeof</emphasis>(weights2)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_get_shortest_paths_dijkstra'>igraph_get_shortest_paths_dijkstra</link></emphasis>(&amp;g, <emphasis>/*vertices=*/</emphasis> &amp;vecs, 
+				     <emphasis>/*edges=*/</emphasis> &amp;evecs, <emphasis>/*from=*/</emphasis> 0, <emphasis>/*to=*/</emphasis> vs, 
+				     &amp;weights_vec, IGRAPH_OUT);
+
+  <emphasis role="strong">check_evecs</emphasis>(&amp;g, &amp;vecs, &amp;evecs, 30);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;vecs); i++) {
+    <emphasis role="strong">print_vector</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vecs)[i]);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(evecs)[i]);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;vecs);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;evecs);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_girth.c.xml igraph-0.6.5/examples/simple/igraph_girth.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_girth.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_girth.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,43 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() { 
+  
+  igraph_t g;
+  igraph_integer_t girth;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_real_t chord[] = { 0, 50 };
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 100, IGRAPH_UNDIRECTED, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, chord, <emphasis role="strong">sizeof</emphasis>(chord)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_girth'>igraph_girth</link></emphasis>(&amp;g, &amp;girth, 0);
+  <emphasis role="strong">if</emphasis> (girth != 51) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_grg_game.c.xml igraph-0.6.5/examples/simple/igraph_grg_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_grg_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_grg_game.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,77 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;unistd.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;sys/times.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  long int i;
+  <emphasis role="strong">struct</emphasis> tms time;
+  clock_t current_time,start_time;
+  int tps;
+  long int runs=100, n=10000;
+  igraph_real_t r=0.01;
+  
+  <emphasis>/* Empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_grg_game'>igraph_grg_game</link></emphasis>(&amp;g, 100, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* Full graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_grg_game'>igraph_grg_game</link></emphasis>(&amp;g, 10, <emphasis role="strong">sqrt</emphasis>(2.0)/2, 1, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) * (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g)-1)/2) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Measure running time */</emphasis>
+<emphasis>/*   tps=sysconf(_SC_CLK_TCK); // clock ticks per second  */</emphasis>
+<emphasis>/*   times(&amp;time); start_time=time.tms_utime; */</emphasis>
+<emphasis>/*   for (i=0; i&lt;runs; i++) { */</emphasis>
+<emphasis>/*     igraph_grg_game2(&amp;g, n, r, 1);  */</emphasis>
+<emphasis>/*     igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   times(&amp;time); current_time=time.tms_utime; */</emphasis>
+<emphasis>/*   fprintf(stdout,"    sorted: time=%.3fs\n",(current_time-start_time)/(double)tps); */</emphasis>
+
+<emphasis>/*   tps=sysconf(_SC_CLK_TCK); // clock ticks per second  */</emphasis>
+<emphasis>/*   times(&amp;time); start_time=time.tms_utime; */</emphasis>
+<emphasis>/*   for (i=0; i&lt;runs; i++) { */</emphasis>
+<emphasis>/*     igraph_grg_game(&amp;g, n, r, 1); */</emphasis>
+<emphasis>/*     igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   times(&amp;time); current_time=time.tms_utime; */</emphasis>
+<emphasis>/*   fprintf(stdout,"non-sorted: time=%.3fs\n", */</emphasis>
+<emphasis>/* 	  (current_time-start_time)/(double)tps); */</emphasis>
+
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_growing_random_game.c.xml igraph-0.6.5/examples/simple/igraph_growing_random_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_growing_random_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_growing_random_game.c.xml	2013-03-03 01:45:51.000000000 +0000
@@ -0,0 +1,30 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_has_multiple.c.xml igraph-0.6.5/examples/simple/igraph_has_multiple.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_has_multiple.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_has_multiple.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,87 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(igraph_vector_bool_t *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %i", (int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  igraph_bool_t res;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,1, 0,1, 1,0, 3,4, 11,10, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (!res)
+    <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED,
+	       0,0, 1,2, 1,1, 2,2, 2,1, 2,3, 2,4, 
+	       2,5, 2,6, 2,2, 3,2, 0,0, 6,2, 2,2, 0,0, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (!res)
+    <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,1, 1,0, 3,4, 11,10, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (res)
+    <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED,
+	       0,0, 1,2, 1,1, 2,2, 2,3, 2,4, 2,5, 2,6, 2,2, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (!res)
+    <emphasis role="strong">return</emphasis> 4;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED,
+	       0,0, 1,2, 1,1, 2,2, 2,3, 2,4, 2,5, 2,6, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (res)
+    <emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED, 0,1, 0,1, 1,2, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (!res)
+    <emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED, 0,0, 0,0, -1);
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(&amp;graph, &amp;res);
+  <emphasis role="strong">if</emphasis> (!res)
+    <emphasis role="strong">return</emphasis> 7;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_hashtable.c.xml igraph-0.6.5/examples/simple/igraph_hashtable.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_hashtable.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_hashtable.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,132 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_hashtable_t ht;
+  char *str;
+  <emphasis role="strong">const</emphasis> igraph_strvector_t *keys;
+  long int i;
+
+  <emphasis>/* init and destroy */</emphasis>
+  <emphasis role="strong">igraph_hashtable_init</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_destroy</emphasis>(&amp;ht);
+
+  <emphasis>/* init, add some elements and destroy */</emphasis>
+  <emphasis role="strong">igraph_hashtable_init</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "green", "red");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "size", "", "4");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "", "grey");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "circle");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "diamond");
+  <emphasis role="strong">igraph_hashtable_destroy</emphasis>(&amp;ht);
+
+  <emphasis>/* reset */</emphasis>
+  <emphasis role="strong">igraph_hashtable_init</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "green", "red");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "size", "", "4");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "", "grey");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "circle");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "diamond");
+  <emphasis role="strong">igraph_hashtable_reset</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "green", "red");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "size", "", "4");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "", "grey");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "circle");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "diamond");
+  <emphasis role="strong">igraph_hashtable_destroy</emphasis>(&amp;ht);
+
+  <emphasis>/* Check semantics */</emphasis>
+  <emphasis role="strong">igraph_hashtable_init</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "green", "red");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "size", "", "4");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "color", "", "grey");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "circle");
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "diamond");
+  
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "color", &amp;str);
+  <emphasis role="strong">printf</emphasis>("color: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "size", &amp;str);
+  <emphasis role="strong">printf</emphasis>("size: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "shape", &amp;str);
+  <emphasis role="strong">printf</emphasis>("shape: %s\n", str);
+  
+  <emphasis role="strong">igraph_hashtable_reset</emphasis>(&amp;ht);
+
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "color", &amp;str);
+  <emphasis role="strong">printf</emphasis>("color: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "size", &amp;str);
+  <emphasis role="strong">printf</emphasis>("size: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "shape", &amp;str);
+  <emphasis role="strong">printf</emphasis>("shape: %s\n", str);
+  
+  <emphasis role="strong">igraph_hashtable_getkeys</emphasis>(&amp;ht, &amp;keys);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(keys); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(keys, i, &amp;str);
+    <emphasis role="strong">printf</emphasis>("%s ", str);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong">igraph_hashtable_destroy</emphasis>(&amp;ht);
+
+  <emphasis>/* addset2 */</emphasis>
+  <emphasis role="strong">igraph_hashtable_init</emphasis>(&amp;ht);
+  <emphasis role="strong">igraph_hashtable_addset2</emphasis>(&amp;ht, "color", "green", "redddd", 3);
+  <emphasis role="strong">igraph_hashtable_addset2</emphasis>(&amp;ht, "size", "", "4111", 1);
+  <emphasis role="strong">igraph_hashtable_addset2</emphasis>(&amp;ht, "color", "", "greysdsdf", 4);
+  <emphasis role="strong">igraph_hashtable_addset2</emphasis>(&amp;ht, "shape", "", "circle", 6);
+  <emphasis role="strong">igraph_hashtable_addset</emphasis>(&amp;ht, "shape", "", "diamond");
+  
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "color", &amp;str);
+  <emphasis role="strong">printf</emphasis>("color: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "size", &amp;str);
+  <emphasis role="strong">printf</emphasis>("size: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "shape", &amp;str);
+  <emphasis role="strong">printf</emphasis>("shape: %s\n", str);
+  
+  <emphasis role="strong">igraph_hashtable_reset</emphasis>(&amp;ht);
+
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "color", &amp;str);
+  <emphasis role="strong">printf</emphasis>("color: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "size", &amp;str);
+  <emphasis role="strong">printf</emphasis>("size: %s\n", str);
+  <emphasis role="strong">igraph_hashtable_get</emphasis>(&amp;ht, "shape", &amp;str);
+  <emphasis role="strong">printf</emphasis>("shape: %s\n", str);
+  
+  <emphasis role="strong">igraph_hashtable_getkeys</emphasis>(&amp;ht, &amp;keys);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(keys); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(keys, i, &amp;str);
+    <emphasis role="strong">printf</emphasis>("%s ", str);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong">igraph_hashtable_destroy</emphasis>(&amp;ht);
+  
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_hrg.c.xml igraph-0.6.5/examples/simple/igraph_hrg.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_hrg.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_hrg.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,74 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C++ -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t graph;
+  igraph_t full, tree;
+  <link linkend='igraph_hrg_t'>igraph_hrg_t</link> hrg;
+  igraph_t dendrogram;
+  int i, j;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> neis;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis>// We need attributes</emphasis>
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+  
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;full, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;tree, 15, <emphasis>/*children=*/</emphasis> 2, <emphasis>/*type=*/</emphasis> IGRAPH_TREE_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_disjoint_union'>igraph_disjoint_union</link></emphasis>(&amp;graph, &amp;full, &amp;tree);
+  <emphasis role="strong"><link linkend='igraph_add_edge'>igraph_add_edge</link></emphasis>(&amp;graph, 0, 10);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;full);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;tree);
+
+  <emphasis>// Fit</emphasis>
+  <emphasis role="strong"><link linkend='igraph_hrg_init'>igraph_hrg_init</link></emphasis>(&amp;hrg, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;graph));
+  <emphasis role="strong"><link linkend='igraph_hrg_fit'>igraph_hrg_fit</link></emphasis>(&amp;graph, &amp;hrg, <emphasis>/*start=*/</emphasis> 0, <emphasis>/*steps=*/</emphasis> 0);
+
+  <emphasis>// Create a graph from it</emphasis>
+  <emphasis role="strong"><link linkend='igraph_hrg_dendrogram'>igraph_hrg_dendrogram</link></emphasis>(&amp;dendrogram, &amp;hrg);
+
+  <emphasis>// Print the tree, with labels</emphasis>
+  <emphasis>// igraph_vector_init(&amp;neis, 0);</emphasis>
+  <emphasis>// for (i=0; i&lt;igraph_vcount(&amp;graph)-1; i++) {</emphasis>
+  <emphasis>//   printf("Vertex # %2i, ", (int) (i+igraph_vcount(&amp;graph)));</emphasis>
+  <emphasis>//   igraph_neighbors(&amp;dendrogram, &amp;neis, i+igraph_vcount(&amp;graph), IGRAPH_OUT);</emphasis>
+  <emphasis>//   printf("left: # %2i, right: # %2i, ", (int) VECTOR(neis)[0], </emphasis>
+  <emphasis>// 	   (int) VECTOR(neis)[1]);</emphasis>
+  <emphasis>//   printf("prob: %6.2g\n", </emphasis>
+  <emphasis>// 	   VAN(&amp;dendrogram, "probability", i+igraph_vcount(&amp;graph)));</emphasis>
+  <emphasis>// }</emphasis>
+  <emphasis>// igraph_vector_destroy(&amp;neis);</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;dendrogram);
+  <emphasis role="strong"><link linkend='igraph_hrg_destroy'>igraph_hrg_destroy</link></emphasis>(&amp;hrg);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_hrg2.c.xml igraph-0.6.5/examples/simple/igraph_hrg2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_hrg2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_hrg2.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,82 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C++ -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t karate;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> parents, weights;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;karate, 34, IGRAPH_UNDIRECTED,
+               0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,10,0,11,0,12,0,13,
+               0,17,0,19,0,21,0,31,
+               1,2,1,3,1,7,1,13,1,17,1,19,1,21,1,30,
+               2,3,2,7,2,27,2,28,2,32,2,9,2,8,2,13,
+               3,7,3,12,3,13,
+               4,6,4,10,
+               5,6,5,10,5,16,
+               6,16,
+               8,30,8,32,8,33,
+               9,33,
+               13,33,
+               14,32,14,33,
+               15,32,15,33,
+               18,32,18,33,
+               19,33,
+               20,32,20,33,
+               22,32,22,33,
+               23,25,23,27,23,32,23,33,23,29,
+               24,25,24,27,24,31,
+               25,31,
+               26,29,26,33,
+               27,33,
+               28,31,28,33,
+               29,32,29,33,
+               30,32,30,33,
+               31,32,31,33,
+               32,33,
+               -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;parents, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, 0);
+  <emphasis role="strong"><link linkend='igraph_hrg_consensus'>igraph_hrg_consensus</link></emphasis>(&amp;karate, &amp;parents, &amp;weights, <emphasis>/* hrg= */</emphasis> 0, 
+		       <emphasis>/* start= */</emphasis> 0, <emphasis>/* num_samples= */</emphasis> 100);
+
+  <emphasis>/* Check */</emphasis>
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;parents);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;weights);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;parents);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;karate);
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_hrg3.c.xml igraph-0.6.5/examples/simple/igraph_hrg3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_hrg3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_hrg3.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,82 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C++ -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t karate;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges, prob;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;karate, 34, IGRAPH_UNDIRECTED,
+               0,1,0,2,0,3,0,4,0,5,0,6,0,7,0,8,0,10,0,11,0,12,0,13,
+               0,17,0,19,0,21,0,31,
+               1,2,1,3,1,7,1,13,1,17,1,19,1,21,1,30,
+               2,3,2,7,2,27,2,28,2,32,2,9,2,8,2,13,
+               3,7,3,12,3,13,
+               4,6,4,10,
+               5,6,5,10,5,16,
+               6,16,
+               8,30,8,32,8,33,
+               9,33,
+               13,33,
+               14,32,14,33,
+               15,32,15,33,
+               18,32,18,33,
+               19,33,
+               20,32,20,33,
+               22,32,22,33,
+               23,25,23,27,23,32,23,33,23,29,
+               24,25,24,27,24,31,
+               25,31,
+               26,29,26,33,
+               27,33,
+               28,31,28,33,
+               29,32,29,33,
+               30,32,30,33,
+               31,32,31,33,
+               32,33,
+               -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;edges, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;prob, 0);
+  <emphasis role="strong"><link linkend='igraph_hrg_predict'>igraph_hrg_predict</link></emphasis>(&amp;karate, &amp;edges, &amp;prob, <emphasis>/* hrg= */</emphasis> 0, <emphasis>/* start= */</emphasis> 0, 
+		     <emphasis>/* num_samples= */</emphasis> 100, <emphasis>/* num_bins= */</emphasis> 25);
+
+  <emphasis>/* Check */</emphasis>
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;edges);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;prob);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;prob);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;karate);
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_i_cutheap.c.xml igraph-0.6.5/examples/simple/igraph_i_cutheap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_i_cutheap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_i_cutheap.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,63 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_i_cutheap_t ch;
+  long int i;
+  
+  <emphasis role="strong">igraph_i_cutheap_init</emphasis>(&amp;ch, 10);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong">igraph_i_cutheap_update</emphasis>(&amp;ch, i, i);
+  }
+<emphasis>/*   print_vector(&amp;ch.heap, stdout); */</emphasis>
+<emphasis>/*   print_vector(&amp;ch.index, stdout); */</emphasis>
+<emphasis>/*   print_vector(&amp;ch.hptr, stdout); */</emphasis>
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong">igraph_i_cutheap_empty</emphasis>(&amp;ch)) {
+    long int idx=<emphasis role="strong">igraph_i_cutheap_popmax</emphasis>(&amp;ch);
+    <emphasis role="strong">printf</emphasis>("%li ", idx);
+<emphasis>/*     print_vector(&amp;ch.heap, stdout); */</emphasis>
+<emphasis>/*     print_vector(&amp;ch.index, stdout); */</emphasis>
+<emphasis>/*     print_vector(&amp;ch.hptr, stdout); */</emphasis>
+<emphasis>/*     printf("------------\n"); */</emphasis>
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong">igraph_i_cutheap_destroy</emphasis>(&amp;ch);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_i_layout_sphere.c.xml igraph-0.6.5/examples/simple/igraph_i_layout_sphere.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_i_layout_sphere.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_i_layout_sphere.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,87 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">igraph_i_layout_sphere_2d</emphasis>(igraph_matrix_t *coords, igraph_real_t *x, igraph_real_t *y,
+			      igraph_real_t *r);
+int <emphasis role="strong">igraph_i_layout_sphere_3d</emphasis>(igraph_matrix_t *coords, igraph_real_t *x, igraph_real_t *y,
+			      igraph_real_t *z, igraph_real_t *r);
+
+int <emphasis role="strong">main</emphasis> () {
+  long int i; 
+  igraph_matrix_t m;
+  igraph_real_t x, y, z, r;
+
+  <emphasis role="strong">srand</emphasis>(<emphasis role="strong">time</emphasis>(0));
+
+  <emphasis>/* 2D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 1000, 2);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+  }
+  <emphasis role="strong">igraph_i_layout_sphere_2d</emphasis>(&amp;m, &amp;x, &amp;y, &amp;r);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    igraph_real_t dist=<emphasis role="strong">sqrt</emphasis>((<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)-x)*(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)-x) + 
+		     (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)-y)*(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)-y));
+    <emphasis role="strong">if</emphasis> (dist &gt; r) {
+      <emphasis role="strong">printf</emphasis>("x: %f y: %f r: %f\n", x, y, r);
+      <emphasis role="strong">printf</emphasis>("x: %f y: %f dist: %f (%li)\n", 
+	     <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0), <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1), dist, i);
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* 3D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 1000, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,2)=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+  }
+  <emphasis role="strong">igraph_i_layout_sphere_3d</emphasis>(&amp;m, &amp;x, &amp;y, &amp;z, &amp;r);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    igraph_real_t dist=<emphasis role="strong">sqrt</emphasis>((<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)-x)*(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0)-x) + 
+		     (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)-y)*(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1)-y) +
+		     (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,2)-z)*(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,2)-z));
+    <emphasis role="strong">if</emphasis> (dist &gt; r) {
+      <emphasis role="strong">printf</emphasis>("x: %f y: %f z: %f r: %f\n", x, y, z, r);
+      <emphasis role="strong">printf</emphasis>("x: %f y: %f z: %f dist: %f (%li)\n", 
+	     <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,0), <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,1), <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m,i,2), dist, i);
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_independent_sets.c.xml igraph-0.6.5/examples/simple/igraph_independent_sets.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_independent_sets.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_independent_sets.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,88 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">warning_handler_ignore</emphasis>(<emphasis role="strong">const</emphasis> char* reason,<emphasis role="strong">const</emphasis> char* file,int line,int e) {
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_vector_ptr_t result;
+  long int i, j, n;
+  igraph_integer_t alpha;
+  <emphasis role="strong">const</emphasis> int params[] = {4, -1, 2, 2, 0, 0, -1, -1};
+  
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(warning_handler_ignore);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;result, 0);
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 5, 2, IGRAPH_TREE_OUT);
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong">sizeof</emphasis>(params)/(2*<emphasis role="strong">sizeof</emphasis>(params[0])); j++) {
+    <emphasis role="strong">if</emphasis> (params[2*j+1] != 0) {
+      <emphasis role="strong"><link linkend='igraph_independent_vertex_sets'>igraph_independent_vertex_sets</link></emphasis>(&amp;g, &amp;result, params[2*j], params[2*j+1]);
+    } <emphasis role="strong">else</emphasis> {
+      <emphasis role="strong"><link linkend='igraph_largest_independent_vertex_sets'>igraph_largest_independent_vertex_sets</link></emphasis>(&amp;g, &amp;result);
+    }
+    n = <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result);
+    <emphasis role="strong">printf</emphasis>("%ld independent sets found\n", (long)n);
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+      <link linkend='igraph_vector_t'>igraph_vector_t</link>* v;
+      v=<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;result,i);
+      <emphasis role="strong">print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)v);
+      <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+      <emphasis role="strong">free</emphasis>(v);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, 2, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_maximal_independent_vertex_sets'>igraph_maximal_independent_vertex_sets</link></emphasis>(&amp;g, &amp;result);
+  n = <emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;result);
+  <emphasis role="strong">printf</emphasis>("%ld maximal independent sets found\n", (long)n);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link>* v;
+    v=<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;result,i);
+    <emphasis role="strong">print_vector</emphasis>((<link linkend='igraph_vector_t'>igraph_vector_t</link>*)v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong">free</emphasis>(v);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;result);
+
+  <emphasis role="strong"><link linkend='igraph_independence_number'>igraph_independence_number</link></emphasis>(&amp;g, &amp;alpha);
+  <emphasis role="strong">printf</emphasis>("alpha=%ld\n", (long)alpha);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_induced_subgraph_map.c.xml igraph-0.6.5/examples/simple/igraph_induced_subgraph_map.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_induced_subgraph_map.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_induced_subgraph_map.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,61 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g, sub;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> map, invmap;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> keep;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 9, IGRAPH_DIRECTED, 0,1, 0,2, 1,3, 2,3,
+	       1,4,4,2, 1,5,5,2, 1,6,6,2, 1,7,7,2, 1,8,8,2,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;map, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;invmap, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;keep, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g));
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;keep); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(keep)[i] = i;
+  }
+
+  <emphasis role="strong">igraph_induced_subgraph_map</emphasis>(&amp;g, &amp;sub, 
+			      <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;keep),
+			      IGRAPH_SUBGRAPH_COPY_AND_DELETE,
+			      &amp;map, &amp;invmap);
+  
+  <emphasis role="strong">printf</emphasis>("Map:         "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;map);
+  <emphasis role="strong">printf</emphasis>("Inverse map: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;invmap);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;sub, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;keep);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;map);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;invmap);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;sub);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_intersection.c.xml igraph-0.6.5/examples/simple/igraph_intersection.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_intersection.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_intersection.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,115 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, l=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;l; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t left, right, isec;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_vector_ptr_t glist;
+  igraph_t g1, g2, g3;
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;left, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 1,0, 5,4, 1,2, 3,2, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;right, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_intersection'>igraph_intersection</link></emphasis>(&amp;isec, &amp;left, &amp;right);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;isec, &amp;v, 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;left);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;right);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;isec);    
+
+  <emphasis>/* empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 0);
+  <emphasis role="strong"><link linkend='igraph_intersection_many'>igraph_intersection_many</link></emphasis>(&amp;isec, &amp;glist);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;isec) != 0 || !<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;isec)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;isec);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+
+  <emphasis>/* graph list with an empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 3);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g2, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g3, 10, IGRAPH_DIRECTED);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[0]=&amp;g1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[1]=&amp;g2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[2]=&amp;g3;
+  <emphasis role="strong"><link linkend='igraph_intersection_many'>igraph_intersection_many</link></emphasis>(&amp;isec, &amp;glist);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;isec) != 0 || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;isec) != 10) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g3);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;isec);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  
+  <emphasis>/* "proper" graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 3);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g1, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,3, 3,2, 4,5, 6,5, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g2, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 2,3, 1,0, 1,2, 3,2, 4,5, 6,5, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g3, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[0]=&amp;g1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[1]=&amp;g2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[2]=&amp;g3;
+  <emphasis role="strong"><link linkend='igraph_intersection_many'>igraph_intersection_many</link></emphasis>(&amp;isec, &amp;glist);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;isec, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g3);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;isec);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_degree_sequence.c.xml igraph-0.6.5/examples/simple/igraph_is_degree_sequence.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_degree_sequence.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_degree_sequence.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,141 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge, MA 02139, USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> outseq, inseq;
+    igraph_bool_t result;
+
+    <emphasis>/***** Testing igraph_is_degree_sequence *****/</emphasis>
+    
+    <emphasis>/* Valid undirected degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, 3, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 1;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Undirected degree sequence with negative degree */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, -2, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 2;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Undirected degree sequence with uneven sum */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 3;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Valid directed degree sequences */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 0, 2, 3, 0, 4, 3, 1, 3, 4, 2, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 0, 3, 1, 3, 2, 4, 4, 1, 3, 1, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 4;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/* Directed degree sequence with negative degree */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 0, 2, 3, 0, 4, 3, 1, 3, 4, 2, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 0, 3, 1, -7, 2, 4, 4, 1, 3, 1, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 5;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/* Directed degree sequence with different lengths */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 0, 2, 3, 0, 4, 3, 1, 3, 4, 2, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 0, 3, 1, 2, 4, 4, 1, 3, 1, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 5;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/* Directed degree sequence with different sums */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 0, 2, 3, 0, 4, 3, 1, 3, 4, 2, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 0, 3, 1, 2, 2, 4, 4, 1, 3, 1, -1);
+    <emphasis role="strong"><link linkend='igraph_is_degree_sequence'>igraph_is_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 6;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/***** Testing igraph_is_graphical_degree_sequence *****/</emphasis>
+
+    <emphasis>/* Valid undirected graphical degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, 3, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 7;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Another valid undirected graphical degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 4, 7, 4, 7, 7, 8, 9, 9, 4, 6, 5, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 8;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Valid undirected degree sequence but not graphical */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, 0, &amp;result);
+    <emphasis role="strong">if</emphasis> (result)
+        <emphasis role="strong">return</emphasis> 9;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+
+    <emphasis>/* Valid directed graphical degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 3, 3, 3, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 3, 3, 3, 3, 3, 3, 3, 3, 3, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 10;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/* Another valid directed graphical degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 1, 3, 2, 1, 3, 4, 3, 3, 1, 3, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 4, 1, 2, 3, 2, 3, 2, 3, 2, 2, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 11;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis>/* Yet another valid directed graphical degree sequence */</emphasis>
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;inseq, -1, 7, 4, 6, 4, 7, 8, 8, 8, 7, 4, -1);
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;outseq, -1, 8, 5, 6, 8, 6, 6, 5, 7, 5, 7, -1);
+    <emphasis role="strong"><link linkend='igraph_is_graphical_degree_sequence'>igraph_is_graphical_degree_sequence</link></emphasis>(&amp;outseq, &amp;inseq, &amp;result);
+    <emphasis role="strong">if</emphasis> (!result)
+        <emphasis role="strong">return</emphasis> 12;
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;outseq);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;inseq);
+
+    <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_directed.c.xml igraph-0.6.5/examples/simple/igraph_is_directed.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_directed.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_directed.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,44 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 0, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 0, 1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_loop.c.xml igraph-0.6.5/examples/simple/igraph_is_loop.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_loop.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_loop.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,56 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(igraph_vector_bool_t *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %i", (int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  igraph_vector_bool_t v;
+  
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;v, 0);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,1, 0,1, 1,0, 3,4, 11,10, -1);
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;graph, &amp;v, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED,
+	       0,0, 1,1, 2,2, 2,3, 2,4, 2,5, 2,6, 2,2, 0,0, -1);
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;graph, &amp;v, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;v);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_minimal_separator.c.xml igraph-0.6.5/examples/simple/igraph_is_minimal_separator.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_minimal_separator.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_minimal_separator.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,68 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">FAIL</emphasis>(msg, error) <emphasis role="strong">do</emphasis> { <emphasis role="strong">printf</emphasis>(msg "\n") ; <emphasis role="strong">return</emphasis> error; } <emphasis role="strong">while</emphasis> (0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> sep;
+  igraph_bool_t result;
+
+  <emphasis>/* Simple star graph, remove the center */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;graph, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_is_minimal_separator'>igraph_is_minimal_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(0), &amp;result);
+  <emphasis role="strong">if</emphasis> (!result) <emphasis role="strong">FAIL</emphasis>("Center of star graph failed.", 1);
+
+  <emphasis>/* Same graph, but another vertex */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_minimal_separator'>igraph_is_minimal_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(6), &amp;result);
+  <emphasis role="strong">if</emphasis> (result) <emphasis role="strong">FAIL</emphasis>("Non-center of star graph failed.", 2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis>/* Karate club */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;graph, "zachary");
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;sep, 32);
+  <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;sep, 33);
+  <emphasis role="strong"><link linkend='igraph_is_minimal_separator'>igraph_is_minimal_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;sep), &amp;result);
+  <emphasis role="strong">if</emphasis> (!result) <emphasis role="strong">FAIL</emphasis>("Karate network (32,33) failed", 3);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;sep, 5);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[0]=8;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[1]=9;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[2]=19;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[3]=30;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[4]=31;
+  <emphasis role="strong"><link linkend='igraph_is_minimal_separator'>igraph_is_minimal_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;sep), &amp;result);
+  <emphasis role="strong">if</emphasis> (result) <emphasis role="strong">FAIL</emphasis>("Karate network (8,9,19,30,31) failed", 4);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;sep);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_multiple.c.xml igraph-0.6.5/examples/simple/igraph_is_multiple.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_multiple.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_multiple.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,57 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(igraph_vector_bool_t *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_bool_size</emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %i", (int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  igraph_vector_bool_t v;
+  
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;v, 0);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,1, 0,1, 1,0, 3,4, 11,10, -1);
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;graph, &amp;v, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, IGRAPH_UNDIRECTED,
+	       0,0, 1,2, 1,1, 2,2, 2,1, 2,3, 2,4, 
+	       2,5, 2,6, 2,2, 3,2, 0,0, 6,2, 2,2, 0,0, -1);
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;graph, &amp;v, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;v);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_is_separator.c.xml igraph-0.6.5/examples/simple/igraph_is_separator.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_is_separator.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_is_separator.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,68 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">FAIL</emphasis>(msg, error) <emphasis role="strong">do</emphasis> { <emphasis role="strong">printf</emphasis>(msg "\n") ; <emphasis role="strong">return</emphasis> error; } <emphasis role="strong">while</emphasis> (0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> sep;
+  igraph_bool_t result;
+
+  <emphasis>/* Simple star graph, remove the center */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;graph, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_is_separator'>igraph_is_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(0), &amp;result);
+  <emphasis role="strong">if</emphasis> (!result) <emphasis role="strong">FAIL</emphasis>("Center of star graph failed.", 1);
+
+  <emphasis>/* Same graph, but another vertex */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_separator'>igraph_is_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(6), &amp;result);
+  <emphasis role="strong">if</emphasis> (result) <emphasis role="strong">FAIL</emphasis>("Non-center of star graph failed.", 2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis>/* Karate club */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;graph, "zachary");
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;sep, 32);
+  <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;sep, 33);
+  <emphasis role="strong"><link linkend='igraph_is_separator'>igraph_is_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;sep), &amp;result);
+  <emphasis role="strong">if</emphasis> (!result) <emphasis role="strong">FAIL</emphasis>("Karate network (32,33) failed", 3);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;sep, 5);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[0]=8;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[1]=9;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[2]=19;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[3]=30;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(sep)[4]=31;
+  <emphasis role="strong"><link linkend='igraph_is_separator'>igraph_is_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;sep), &amp;result);
+  <emphasis role="strong">if</emphasis> (result) <emphasis role="strong">FAIL</emphasis>("Karate network (8,9,19,30,31) failed", 4);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;sep);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_isomorphic_vf2.c.xml igraph-0.6.5/examples/simple/igraph_isomorphic_vf2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_isomorphic_vf2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_isomorphic_vf2.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,284 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+int <emphasis role="strong">random_permutation</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *vec) {
+  <emphasis>/* We just do size(vec) * 2 swaps */</emphasis>
+  long int one, two, tmp, i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(vec);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;2*n; i++) {
+    one= (double)<emphasis role="strong">rand</emphasis>() / RAND_MAX * n;
+    two= (double)<emphasis role="strong">rand</emphasis>() / RAND_MAX * n;
+    tmp=one; one=two; two=tmp;
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t ring1, ring2;
+  igraph_vector_int_t color1, color2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> perm;
+  igraph_bool_t iso;
+  igraph_integer_t count;
+  long int i;
+
+  <emphasis role="strong">srand</emphasis>(<emphasis role="strong">time</emphasis>(0));
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring1, 100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis>1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;perm, 0, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;ring1)-1);
+  <emphasis role="strong">random_permutation</emphasis>(&amp;perm);
+  <emphasis role="strong"><link linkend='igraph_permute_vertices'>igraph_permute_vertices</link></emphasis>(&amp;ring1, &amp;ring2, &amp;perm);
+  
+  <emphasis>/* Without colors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_isomorphic'>igraph_isomorphic</link></emphasis>(&amp;ring1, &amp;ring2, &amp;iso);
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Without color failed.\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* Without colors, number of isomorphisms */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, 0, 0, &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 200) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count without colors failed, expected %li, got %li.\n",
+	    (long int) 200, (long int) count);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* Everything has the same colors */</emphasis>
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color1, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;ring1));
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color2, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;ring2));
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Single color failed.\n");
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  
+  <emphasis>/* Two colors, just counting */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1); i+=2) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i+1] = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 100) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with two colors failed, expected %li, got %li.\n",
+	    (long int) 100, (long int) count);
+    <emphasis role="strong">return</emphasis> 4;
+  }
+
+  <emphasis>/* Separate colors for each vertex */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = i;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 1) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with separate colors failed, expected %li, got %li.\n",
+	    (long int) 1, (long int) count);
+    <emphasis role="strong">return</emphasis> 5;
+  }
+
+  <emphasis>/* Try a negative result */</emphasis>
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color1, 0);
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color2, 0); 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[0]=1;
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Negative test failed.\n");
+    <emphasis role="strong">return</emphasis> 6;
+  }
+
+  <emphasis>/* Another negative, same color distribution, different topology */</emphasis>
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color1, 0);
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color2, 0); 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[0]=1;  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[0]=1;  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[2]=1;
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Second negative test failed.\n");
+    <emphasis role="strong">return</emphasis> 7;
+  }  
+  
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color1);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color2);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;perm);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring1);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  <emphasis>/* SUBGRAPH ISOMORPHISM                                             */</emphasis>
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring1, 100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis>0);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring2, 80 , <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis>0);
+
+  <emphasis>/* One color */</emphasis>
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color1, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;ring1));
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color2, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;ring2));
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, 
+				   &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 42) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with one color failed, expected %li, got %li.\n",
+	    (long int) 42, (long int) count);
+    <emphasis role="strong">return</emphasis> 31;
+  }
+
+  <emphasis>/* Two colors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1); i+=2) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i+1] = 1;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color2); i+=2) {  
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i]   = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i+1] = 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, &amp;color1, &amp;color2, 0, 0, 
+				   &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 21) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with two colors failed, expected %li, got %li.\n",
+	    (long int) 21, (long int) count);
+    <emphasis role="strong">return</emphasis> 32;
+  }
+
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color1);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color2);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring2);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  <emphasis>/* EDGE COLORING, GRAPH ISOMORPHISM                                 */</emphasis>
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring1, 100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;perm, 0, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;ring1)-1);
+  <emphasis role="strong">random_permutation</emphasis>(&amp;perm);
+  <emphasis role="strong"><link linkend='igraph_permute_vertices'>igraph_permute_vertices</link></emphasis>(&amp;ring1, &amp;ring2, &amp;perm);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;perm);
+
+  <emphasis>/* Everything has the same color */</emphasis>
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color1, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;ring1));
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color2, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;ring2));
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Single edge-color failed.\n");
+    <emphasis role="strong">return</emphasis> 41;
+  }
+
+  <emphasis>/* Two colors, just counting */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1); i+=2) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i+1] = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2, &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 100) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with two edge colors failed, expected %li, got %li.\n",
+	    (long int) 100, (long int) count);
+    <emphasis role="strong">return</emphasis> 42;
+  }
+
+  <emphasis>/* Separate colors for each edge */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i] = i;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_isomorphisms_vf2'>igraph_count_isomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2, &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 1) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with separate edge colors failed, expected %li, got %li.\n",
+	    (long int) 1, (long int) count);
+    <emphasis role="strong">return</emphasis> 43;
+  }  
+
+  <emphasis>/* Try a negative result */</emphasis>
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color1, 0);
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color2, 0); 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[0]=1;
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Negative edge test failed.\n");
+    <emphasis role="strong">return</emphasis> 44;
+  }
+
+  <emphasis>/* Another negative, same color distribution, different topology */</emphasis>
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color1, 0);
+  <emphasis role="strong">igraph_vector_int_fill</emphasis>(&amp;color2, 0); 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[0]=1;  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[0]=1;  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[2]=1;
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2, &amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (iso) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Second negative edge test failed.\n");
+    <emphasis role="strong">return</emphasis> 45;
+  }    
+
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color1);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color2);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring2);
+
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+  <emphasis>/* EDGE COLORED SUBGRAPH ISOMORPHISM                                */</emphasis>
+  <emphasis>/* ---------------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring1, 100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis>0);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;ring2, 80 , <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis>0);
+
+  <emphasis>/* One color */</emphasis>
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color1, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;ring1));
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;color2, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;ring2));
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2,
+				   &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 42) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with one edge color failed, expected %li, got %li.\n",
+	    (long int) 42, (long int) count);
+    <emphasis role="strong">return</emphasis> 51;
+  }
+
+  <emphasis>/* Two colors */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color1)-1; i+=2) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i]   = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color1)[i+1] = 1;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_vector_int_size</emphasis>(&amp;color2)-1; i+=2) {  
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i]   = 0;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(color2)[i+1] = 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_count_subisomorphisms_vf2'>igraph_count_subisomorphisms_vf2</link></emphasis>(&amp;ring1, &amp;ring2, 0, 0, &amp;color1, &amp;color2,
+				   &amp;count, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (count != 22) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "Count with two edge colors failed, expected %li, got %li.\n",
+	    (long int) 22, (long int) count);
+    <emphasis role="strong">return</emphasis> 52;
+  }
+
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color1);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;color2);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ring2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_k_regular_game.c.xml igraph-0.6.5/examples/simple/igraph_k_regular_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_k_regular_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_k_regular_game.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,176 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> deg;
+  igraph_bool_t is_simple;
+  igraph_bool_t is_directed;
+
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(&amp;<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;deg, 0);
+
+  <emphasis>/* k-regular undirected graph, even degrees, no multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 4, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple);
+  <emphasis role="strong">if</emphasis> (!is_simple)
+	  <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular undirected graph, odd degrees, even number of vertices, no multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 3, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple);
+  <emphasis role="strong">if</emphasis> (!is_simple)
+	  <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular undirected graph, odd degrees, odd number of vertices, no multiple edges */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 9, 3, 0, 0))
+	  <emphasis role="strong">return</emphasis> 3;
+
+  <emphasis>/* k-regular undirected graph, even degrees, multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 4, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 14;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular undirected graph, odd degrees, even number of vertices, multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 3, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 15;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular undirected graph, odd degrees, odd number of vertices, multiple edges */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 9, 3, 0, 1))
+	  <emphasis role="strong">return</emphasis> 4;
+
+  <emphasis>/* k-regular directed graph, even degrees, no multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 4, 1, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple);
+  <emphasis role="strong">if</emphasis> (!is_simple)
+	  <emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular directed graph, odd degrees, even number of vertices, no multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 3, 1, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple);
+  <emphasis role="strong">if</emphasis> (!is_simple)
+	  <emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular directed graph, odd degrees, odd number of vertices, no multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 9, 3, 1, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;g, &amp;is_simple);
+  <emphasis role="strong">if</emphasis> (!is_simple)
+	  <emphasis role="strong">return</emphasis> 7;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 7;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular directed graph, even degrees, multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 4, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 16;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular directed graph, odd degrees, even number of vertices, multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 3, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 17;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular directed graph, odd degrees, odd number of vertices, multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 9, 3, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 18;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* k-regular undirected graph, too large degree, no multiple edges */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 10, 0, 0))
+	  <emphasis role="strong">return</emphasis> 8;
+
+  <emphasis>/* k-regular directed graph, too large degree, no multiple edges */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 10, 10, 1, 0))
+	  <emphasis role="strong">return</emphasis> 9;
+
+  <emphasis>/* empty graph */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 0, 0, 0, 0))
+	  <emphasis role="strong">return</emphasis> 10;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 0 || <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0 || <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 11;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_k_regular_game'>igraph_k_regular_game</link></emphasis>(&amp;g, 0, 0, 1, 0))
+	  <emphasis role="strong">return</emphasis> 12;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 0 || <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 0 || !<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g))
+	  <emphasis role="strong">return</emphasis> 13;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;deg);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_knn.c.xml igraph-0.6.5/examples/simple/igraph_knn.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_knn.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_knn.c.xml	2013-03-03 01:45:52.000000000 +0000
@@ -0,0 +1,43 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, v2;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_avg_nearest_neighbor_degree'>igraph_avg_nearest_neighbor_degree</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), &amp;v, &amp;v2, 
+				     <emphasis>/*weights=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgeev.c.xml igraph-0.6.5/examples/simple/igraph_lapack_dgeev.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgeev.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lapack_dgeev.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,235 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+int <emphasis role="strong">real_cplx_mult</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A,
+		   <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_real,
+		   <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_imag, 
+		   <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_real,
+		   <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_imag) {
+
+  int n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_real);
+  int r, c;
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A) != n || 
+      <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(A) != n || 
+      <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_imag) != n) {
+    <emphasis role="strong">printf</emphasis>("Wrong matrix or vector size");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_imag, n);
+
+  <emphasis role="strong">for</emphasis> (r=0; r&lt;n; r++) {
+    igraph_real_t s_real=0.0;
+    igraph_real_t s_imag=0.0;
+    <emphasis role="strong">for</emphasis> (c=0; c&lt;n; c++) {
+      s_real += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*A, r, c) * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[c];
+      s_imag += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*A, r, c) * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[c];
+    }
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_real)[r]=s_real;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_imag)[r]=s_imag;
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">sc_cplx_cplx_mult</emphasis>(igraph_real_t lambda_real,
+		      igraph_real_t lambda_imag,
+		      <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_real,
+		      <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_imag,
+		      <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_real,
+		      <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_imag) {
+  
+  int r;
+  int n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_real);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_imag) != n) {
+    <emphasis role="strong">printf</emphasis>("Wrong vector sizes");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_imag, n);
+
+  <emphasis role="strong">for</emphasis> (r=0; r&lt;n; r++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_real)[r] = (lambda_real * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[r] -
+			    lambda_imag * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[r]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_imag)[r] = (lambda_imag * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[r] + 
+			    lambda_real * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[r]);
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+igraph_bool_t <emphasis role="strong">check_ev</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A, 
+		       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values_real,
+		       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values_imag,
+		       <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors_left, 
+		       <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors_right, 
+		       igraph_real_t tol) {
+
+  int i, n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v_real, v_imag;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> AV_real, AV_imag, lv_real, lv_imag;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> null;
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(A)             != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values_real)   != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values_imag)   != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(vectors_left)  != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors_left)  != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(vectors_right) != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors_right) != n) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;AV_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;AV_imag, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lv_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lv_imag, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;null, n);
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;null);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i]==0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(null), n);
+    } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i] &gt; 0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i+1), n);
+    } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i] &lt; 0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i-1), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_scale'>igraph_vector_scale</link></emphasis>(&amp;v_imag, -1.0);
+    }
+    <emphasis role="strong">real_cplx_mult</emphasis>(A, &amp;v_real, &amp;v_imag, &amp;AV_real, &amp;AV_imag);
+    <emphasis role="strong">sc_cplx_cplx_mult</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_real)[i], <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i],
+		      &amp;v_real, &amp;v_imag, &amp;lv_real, &amp;lv_imag);
+    
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;AV_real, &amp;lv_real) &gt; tol ||
+	<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;AV_imag, &amp;lv_imag) &gt; tol) {
+      <emphasis role="strong">printf</emphasis>("ERROR:\n");
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;AV_real); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;AV_imag);
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lv_real); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lv_imag);      
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;null);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;AV_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;AV_real);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lv_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lv_real);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_matrix_t A;
+  igraph_matrix_t vectors_left, vectors_right;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values_real, values_imag;
+  int i, j;
+  int info=1;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors_left, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors_right, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values_real, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values_imag, 0);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_lapack_dgeev'>igraph_lapack_dgeev</link></emphasis>(&amp;A, &amp;values_real, &amp;values_imag,
+  		      &amp;vectors_left, &amp;vectors_right, &amp;info);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values_real, &amp;values_imag,
+  	       &amp;vectors_left, &amp;vectors_right, <emphasis>/*tol=*/</emphasis> 1e-8)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* ------------------------------------------------------- */</emphasis>
+
+  <emphasis>/* igraph_matrix_resize(&amp;A, 10, 10); */</emphasis>
+  <emphasis>/* igraph_matrix_null(&amp;A); */</emphasis>
+  <emphasis>/* for (i=0; i&lt;10; i++) { MATRIX(A, i, i) = 1.0; }  */</emphasis>
+  <emphasis>/* MATRIX(A,0,1) = 1.0; */</emphasis>
+
+  <emphasis>/* igraph_lapack_dgeev(&amp;A, &amp;values_real, &amp;values_imag,  */</emphasis>
+  <emphasis>/* 		      &amp;vectors_left, &amp;vectors_right, &amp;info);   */</emphasis>
+
+  <emphasis>/* if (check_ev(&amp;A, &amp;values_real, &amp;values_imag, */</emphasis>
+  <emphasis>/* 	       &amp;vectors_left, &amp;vectors_right, /\*tol=*\/ 1e-8)) { */</emphasis>
+  <emphasis>/*   return 2; */</emphasis>
+  <emphasis>/* } */</emphasis>
+
+  <emphasis>/* ------------------------------------------------------- */</emphasis>
+    
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;A, 10, 10);
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,0,1) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,0,2) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,0,3) = 1/3.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,1,0) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,1,4) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,1,5) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,1,6) = 1/4.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,2,0) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,2,7) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,2,8) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,2,9) = 1/4.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,3,0) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,4,1) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,5,1) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,6,1) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,7,2) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,8,2) = 1.0;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A,9,2) = 1.0;
+
+  info=0;
+  <emphasis role="strong"><link linkend='igraph_lapack_dgeev'>igraph_lapack_dgeev</link></emphasis>(&amp;A, &amp;values_real, &amp;values_imag,
+  		      &amp;vectors_left, &amp;vectors_right, &amp;info);
+
+  <emphasis>/* igraph_matrix_print(&amp;A); */</emphasis>
+  <emphasis>/* printf("---\n"); */</emphasis>
+  <emphasis>/* igraph_vector_print(&amp;values_real); */</emphasis>
+  <emphasis>/* igraph_vector_print(&amp;values_imag); */</emphasis>
+  <emphasis>/* igraph_matrix_print(&amp;vectors_left); */</emphasis>
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values_real, &amp;values_imag,
+  	       &amp;vectors_left, &amp;vectors_right, <emphasis>/*tol=*/</emphasis> 1e-8)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values_real);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors_right);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors_left);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgeevx.c.xml igraph-0.6.5/examples/simple/igraph_lapack_dgeevx.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgeevx.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lapack_dgeevx.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,201 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+int <emphasis role="strong">real_cplx_mult</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A,
+		   <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_real,
+		   <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_imag, 
+		   <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_real,
+		   <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_imag) {
+
+  int n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_real);
+  int r, c;
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A) != n || 
+      <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(A) != n || 
+      <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_imag) != n) {
+    <emphasis role="strong">printf</emphasis>("Wrong matrix or vector size");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_imag, n);
+
+  <emphasis role="strong">for</emphasis> (r=0; r&lt;n; r++) {
+    igraph_real_t s_real=0.0;
+    igraph_real_t s_imag=0.0;
+    <emphasis role="strong">for</emphasis> (c=0; c&lt;n; c++) {
+      s_real += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*A, r, c) * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[c];
+      s_imag += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*A, r, c) * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[c];
+    }
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_real)[r]=s_real;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_imag)[r]=s_imag;
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">sc_cplx_cplx_mult</emphasis>(igraph_real_t lambda_real,
+		      igraph_real_t lambda_imag,
+		      <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_real,
+		      <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v_imag,
+		      <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_real,
+		      <link linkend='igraph_vector_t'>igraph_vector_t</link> *res_imag) {
+  
+  int r;
+  int n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_real);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v_imag) != n) {
+    <emphasis role="strong">printf</emphasis>("Wrong vector sizes");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res_imag, n);
+
+  <emphasis role="strong">for</emphasis> (r=0; r&lt;n; r++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_real)[r] = (lambda_real * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[r] -
+			    lambda_imag * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[r]);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res_imag)[r] = (lambda_imag * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_real)[r] + 
+			    lambda_real * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v_imag)[r]);
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+igraph_bool_t <emphasis role="strong">check_ev</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A, 
+		       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values_real,
+		       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values_imag,
+		       <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors_left, 
+		       <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors_right, 
+		       igraph_real_t tol) {
+
+  int n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v_real, v_imag;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> AV_real, AV_imag, lv_real, lv_imag;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> null;
+  int i;
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(A)             != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values_real)   != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values_imag)   != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(vectors_left)  != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors_left)  != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(vectors_right) != n) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors_right) != n) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;AV_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;AV_imag, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lv_real, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lv_imag, n);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;null, n);
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;null);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i]==0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(null), n);
+    } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i] &gt; 0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i+1), n);
+    } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i] &lt; 0.0) {
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_real, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i-1), n);
+      <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v_imag, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors_right, 0, i), n);
+      <emphasis role="strong"><link linkend='igraph_vector_scale'>igraph_vector_scale</link></emphasis>(&amp;v_imag, -1.0);
+    }
+    <emphasis role="strong">real_cplx_mult</emphasis>(A, &amp;v_real, &amp;v_imag, &amp;AV_real, &amp;AV_imag);
+    <emphasis role="strong">sc_cplx_cplx_mult</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_real)[i], <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values_imag)[i],
+		      &amp;v_real, &amp;v_imag, &amp;lv_real, &amp;lv_imag);
+    
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;AV_real, &amp;lv_real) &gt; tol ||
+	<emphasis role="strong"><link linkend='igraph_vector_maxdifference'>igraph_vector_maxdifference</link></emphasis>(&amp;AV_imag, &amp;lv_imag) &gt; tol) {
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;AV_real); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;AV_imag);
+      <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lv_real); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;lv_imag);      
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;null);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;AV_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;AV_real);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lv_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lv_real);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_matrix_t A;
+  igraph_matrix_t vectors_left, vectors_right;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values_real, values_imag;
+  int i, j;
+  int info=1;
+  int ilo, ihi;
+  igraph_real_t abnrm;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors_left, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors_right, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values_real, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values_imag, 0);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_lapack_dgeevx'>igraph_lapack_dgeevx</link></emphasis>(IGRAPH_LAPACK_DGEEVX_BALANCE_BOTH,
+		       &amp;A, &amp;values_real, &amp;values_imag, 
+		       &amp;vectors_left, &amp;vectors_right, &amp;ilo, &amp;ihi,
+		       <emphasis>/*scale=*/</emphasis> 0, &amp;abnrm, <emphasis>/*rconde=*/</emphasis> 0, 
+		       <emphasis>/*rcondv=*/</emphasis> 0, &amp;info);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values_real, &amp;values_imag, 
+	       &amp;vectors_left, &amp;vectors_right, <emphasis>/*tol=*/</emphasis> 1e-8)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis>/* igraph_matrix_print(&amp;A); */</emphasis>
+  <emphasis>/* igraph_vector_print(&amp;values_real); */</emphasis>
+  <emphasis>/* igraph_vector_print(&amp;values_imag); */</emphasis>
+  <emphasis>/* igraph_matrix_print(&amp;vectors_left); */</emphasis>
+  <emphasis>/* igraph_matrix_print(&amp;vectors_right); */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values_imag);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values_real);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors_right);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors_left);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgehrd.c.xml igraph-0.6.5/examples/simple/igraph_lapack_dgehrd.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgehrd.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lapack_dgehrd.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  int nodes=10;
+  igraph_t tree;
+  igraph_matrix_t sto;
+  igraph_matrix_t hess;
+  igraph_matrix_complex_t evec1, evec2;
+  igraph_vector_complex_t eval1, eval2;
+  igraph_eigen_which_t which;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;tree, nodes, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;sto, nodes, nodes);
+  <emphasis role="strong"><link linkend='igraph_get_stochastic'>igraph_get_stochastic</link></emphasis>(&amp;tree, &amp;sto, <emphasis>/*column_wise=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;sto);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;hess, nodes, nodes);
+  <emphasis role="strong">igraph_lapack_dgehrd</emphasis>(&amp;sto, 1, nodes, &amp;hess);
+  
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;evec1, 0, 0);
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;eval1, 0);
+  which.pos = IGRAPH_EIGEN_ALL;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;sto, 0, 0, nodes, 0, IGRAPH_EIGEN_LAPACK, &amp;which, 0, 0,
+		      &amp;eval1, &amp;evec1);
+
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;evec2, 0, 0);
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;eval2, 0);
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(&amp;hess, 0, 0, nodes, 0, IGRAPH_EIGEN_LAPACK, &amp;which, 0, 
+		      0, &amp;eval2, &amp;evec2);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) { 
+    igraph_real_t d=<emphasis role="strong">igraph_complex_abs</emphasis>(<emphasis role="strong">igraph_complex_sub</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eval1)[i],
+							  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eval2)[i]));
+    <emphasis role="strong">if</emphasis> (d &gt; 1e-14) { <emphasis role="strong">printf</emphasis>("Difference: %g\n", d); <emphasis role="strong">return</emphasis> 1; }
+  }
+  
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;evec2);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;eval2);
+
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;evec1);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;eval1);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;hess);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;sto);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;tree);
+    
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgesv.c.xml igraph-0.6.5/examples/simple/igraph_lapack_dgesv.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dgesv.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lapack_dgesv.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,142 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+void <emphasis role="strong">igraph_print_warning</emphasis>(<emphasis role="strong">const</emphasis> char *reason, <emphasis role="strong">const</emphasis> char *file, 
+			  int line, int igraph_errno) {
+  <emphasis role="strong">printf</emphasis>("Warning: %s\n", reason);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_matrix_t A, B, RHS;
+  int info;
+  int i;
+
+  <emphasis>/* Identity matrix, you have to start somewhere */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;B, DIM, 1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, i) = 1.0;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, i, 0) = i+1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_copy'>igraph_matrix_copy</link></emphasis>(&amp;RHS, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_lapack_dgesv'>igraph_lapack_dgesv</link></emphasis>(&amp;A, <emphasis>/*ipiv=*/</emphasis> 0, &amp;RHS, &amp;info);
+
+  <emphasis role="strong">if</emphasis> (info != 0) { <emphasis role="strong">return</emphasis> 1;}
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;B, &amp;RHS)) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;RHS);
+
+  <emphasis>/* Diagonal matrix */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;RHS, DIM, 1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, i) = i+1;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(RHS, i, 0) = i+1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_lapack_dgesv'>igraph_lapack_dgesv</link></emphasis>(&amp;A, <emphasis>/*ipiv=*/</emphasis> 0, &amp;RHS, &amp;info);
+
+  <emphasis role="strong">if</emphasis> (info != 0) { <emphasis role="strong">return</emphasis> 3;}
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(RHS, i, 0) != 1.0) { <emphasis role="strong">return</emphasis> 4; }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;RHS);  
+
+  <emphasis>/* A general matrix */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;B, DIM, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;RHS, DIM, 1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    int j;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, i, 0) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_blas_dgemv_array'>igraph_blas_dgemv_array</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1.0, <emphasis>/*a=*/</emphasis> &amp;A, 
+			  <emphasis>/*x-*/</emphasis> &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, 0, 0), <emphasis>/*beta=*/</emphasis> 0,
+			  <emphasis>/*y=*/</emphasis> &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(RHS, 0, 0));
+
+  <emphasis role="strong"><link linkend='igraph_lapack_dgesv'>igraph_lapack_dgesv</link></emphasis>(&amp;A, <emphasis>/*ipiv=*/</emphasis> 0, &amp;RHS, &amp;info);
+  <emphasis role="strong">if</emphasis> (info != 0) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, i, 0) - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(RHS, i, 0)) &gt; 1e-13) { <emphasis role="strong">return</emphasis> 6; }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;RHS);
+
+  <emphasis>/* A singular matrix */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;B, DIM, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;RHS, DIM, 1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    int j;
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, i, 0) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, DIM-1, i) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, 0, i);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_blas_dgemv_array'>igraph_blas_dgemv_array</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1.0, <emphasis>/*a=*/</emphasis> &amp;A, 
+			  <emphasis>/*x-*/</emphasis> &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(B, 0, 0), <emphasis>/*beta=*/</emphasis> 0,
+			  <emphasis>/*y=*/</emphasis> &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(RHS, 0, 0));
+
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(igraph_print_warning);
+  <emphasis role="strong"><link linkend='igraph_lapack_dgesv'>igraph_lapack_dgesv</link></emphasis>(&amp;A, <emphasis>/*ipiv=*/</emphasis> 0, &amp;RHS, &amp;info);
+  <emphasis role="strong">if</emphasis> (info != 10) {
+    <emphasis role="strong">printf</emphasis>("LAPACK returned info = %d, should have been 10", info);
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;RHS);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dsyevr.c.xml igraph-0.6.5/examples/simple/igraph_lapack_dsyevr.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lapack_dsyevr.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lapack_dsyevr.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,190 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+igraph_bool_t <emphasis role="strong">check_ev</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *A, 
+		       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *values,
+		       <emphasis role="strong">const</emphasis> igraph_matrix_t *vectors, igraph_real_t tol) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, y;
+  int i, j;
+  int m=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(vectors);
+  int n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(A);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(A) != n)       { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(values) != m)  { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(vectors) != n) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;y, n);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;m; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*vectors, 0, i), n);
+    <emphasis role="strong"><link linkend='igraph_vector_update'>igraph_vector_update</link></emphasis>(&amp;y, &amp;v);
+    <emphasis role="strong"><link linkend='igraph_blas_dgemv'>igraph_blas_dgemv</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1.0, A, &amp;v, 
+		      <emphasis>/*beta=*/</emphasis> -<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values)[i], &amp;y);
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;n; j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(y)[i]) &gt; tol) {
+	<emphasis role="strong">printf</emphasis>("Matrix:\n"); <emphasis role="strong">igraph_matrix_print</emphasis>(A);
+	<emphasis role="strong">printf</emphasis>("lambda= %g\n", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*values)[i]);
+	<emphasis role="strong">printf</emphasis>("v= "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;v);
+	<emphasis role="strong">printf</emphasis>("residual: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;y);
+	<emphasis role="strong">return</emphasis> 1; 
+      }
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_matrix_t A;
+  igraph_matrix_t vectors, vectors2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values, values2;
+  int i, j;
+  int il, iu;
+  igraph_real_t vl, vu;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A, DIM, DIM);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+
+  <emphasis>/* All eigenvalues and eigenvectors */</emphasis>
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong">for</emphasis> (j=i; j&lt;DIM; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(A, j, i) = 
+	<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_lapack_dsyevr'>igraph_lapack_dsyevr</link></emphasis>(&amp;A, IGRAPH_LAPACK_DSYEV_ALL, <emphasis>/*vl=*/</emphasis> 0, <emphasis>/*vu=*/</emphasis> 0,
+		       <emphasis>/*vestimate=*/</emphasis> 0, <emphasis>/*il=*/</emphasis> 0, <emphasis>/*iu=*/</emphasis> 0, 
+		       <emphasis>/*abstol=*/</emphasis> 1e-10, &amp;values, &amp;vectors, <emphasis>/*support=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;values) != DIM) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;vectors) != DIM || 
+      <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;vectors) != DIM) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">check_ev</emphasis>(&amp;A, &amp;values, &amp;vectors, <emphasis>/*tol=*/</emphasis> 1e-8)) { <emphasis role="strong">return</emphasis> 3; }
+
+  <emphasis>/* Only a subset */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values2, 0);
+
+  il=2; iu=5;
+  <emphasis role="strong"><link linkend='igraph_lapack_dsyevr'>igraph_lapack_dsyevr</link></emphasis>(&amp;A, IGRAPH_LAPACK_DSYEV_SELECT, <emphasis>/*vl=*/</emphasis> 0, <emphasis>/*vu=*/</emphasis> 0,
+		       <emphasis>/*vestimate=*/</emphasis> 0, <emphasis>/*il=*/</emphasis> il, <emphasis>/*iu=*/</emphasis> iu, 
+		       <emphasis>/*abstol=*/</emphasis> 1e-10, &amp;values2, &amp;vectors2, 
+		       <emphasis>/*support=*/</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;values2) != iu-il+1) { <emphasis role="strong">return</emphasis> 4; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;vectors2) != DIM ||
+      <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;vectors2) != iu-il+1) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;iu-il+1; i++) {
+    igraph_real_t m1=1.0;
+
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[il+i-1] - <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[i]) &gt; 1e-8) {
+      <emphasis role="strong">printf</emphasis>("Full:   "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+      <emphasis role="strong">printf</emphasis>("Subset: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values2);
+      <emphasis role="strong">return</emphasis> 6;
+    }
+
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, il+i-1) * <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, 0, i) &lt; 0) {
+      m1=-1.0;
+    } <emphasis role="strong">else</emphasis> { 
+      m1=1.0;
+    }
+
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, il+i-1) - 
+	       m1 * <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j, i)) &gt; 1e-8) {
+	<emphasis role="strong">printf</emphasis>("Full:\n"); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+	<emphasis role="strong">printf</emphasis>("Subset:\n"); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors2);
+	<emphasis role="strong">return</emphasis> 7;
+      }
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors2);
+  
+  <emphasis>/* Subset based on an interval */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values2, 0);
+
+  il=2; iu=5;
+  vl = (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[il-1] + <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[il-2]) / 2.0;   
+  vu = (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[iu] + <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[iu-1]) / 2.0;
+
+  <emphasis role="strong"><link linkend='igraph_lapack_dsyevr'>igraph_lapack_dsyevr</link></emphasis>(&amp;A, IGRAPH_LAPACK_DSYEV_INTERVAL, vl, vu, 
+		       <emphasis>/*vestimate=*/</emphasis> iu-il+1, <emphasis>/*il=*/</emphasis> 0, <emphasis>/*iu=*/</emphasis> 0, 
+		       <emphasis>/*abstol=*/</emphasis> 1e-10, &amp;values2, &amp;vectors2, 
+		       <emphasis>/*support=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;values2) != iu-il+1) { <emphasis role="strong">return</emphasis> 4; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;vectors2) != DIM ||
+      <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;vectors2) != iu-il+1) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;iu-il+1; i++) {
+    igraph_real_t m1=1.0;
+
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[il+i-1] - <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values2)[i]) &gt; 1e-8) {
+      <emphasis role="strong">printf</emphasis>("Full:   "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+      <emphasis role="strong">printf</emphasis>("Subset: "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values2);
+      <emphasis role="strong">return</emphasis> 6;
+    }
+
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, il+i-1) * <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, 0, i) &lt; 0) {
+      m1=-1.0;
+    } <emphasis role="strong">else</emphasis> { 
+      m1=1.0;
+    }
+
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;DIM; j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, j, il+i-1) - 
+	       m1 * <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors2, j, i)) &gt; 1e-8) {
+	<emphasis role="strong">printf</emphasis>("Full:\n"); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+	<emphasis role="strong">printf</emphasis>("Subset:\n"); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors2);
+	<emphasis role="strong">return</emphasis> 7;
+      }
+    }
+  }  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors2);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_laplacian.c.xml igraph-0.6.5/examples/simple/igraph_laplacian.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_laplacian.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_laplacian.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,238 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+igraph_bool_t <emphasis role="strong">check_laplacian</emphasis>(igraph_t* graph, igraph_matrix_t* matrix, <link linkend='igraph_vector_t'>igraph_vector_t</link>* w) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec, res;
+  long int i, j;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph));
+
+  <emphasis role="strong">if</emphasis> (w)
+    <emphasis role="strong"><link linkend='igraph_strength'>igraph_strength</link></emphasis>(graph, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_NO_LOOPS, w);
+  <emphasis role="strong">else</emphasis>
+    <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(graph, &amp;vec, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_NO_LOOPS);
+
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] = <emphasis role="strong">sqrt</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i]);
+  }
+
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph); i++) {
+    <emphasis role="strong">for</emphasis> (j = 0; j &lt; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(graph); j++) {
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[i] += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*matrix, i, j) * <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[j];
+    }
+  }
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_min'>igraph_vector_min</link></emphasis>(&amp;res) &gt; 1e-7) {
+    <emphasis role="strong">printf</emphasis>("Invalid Laplacian matrix:\n");
+    <emphasis role="strong">igraph_matrix_print</emphasis>(matrix);
+    <emphasis role="strong">return</emphasis> 0;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+
+  <emphasis role="strong">return</emphasis> 1;
+}
+
+int <emphasis role="strong">test_unnormalized_laplacian</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>* w, igraph_bool_t dir) {
+  igraph_t g;
+  igraph_matrix_t m, m2;
+  igraph_sparsemat_t sm;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec, *weights = 0;
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;sm, 0, 0, 0);
+
+  <emphasis role="strong">if</emphasis> (w) {
+    weights = (<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(weights, w);
+  }
+
+  <emphasis>/* No loop or multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, dir, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 0, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 41;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;m);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Add some loop edges */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;vec, 4, 1.0, 1.0, 2.0, 2.0);
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 2);
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 2);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 0, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 42;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;m);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Duplicate some edges */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;vec, 4, 1.0, 2.0, 3.0, 4.0);
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 3);
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 3);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 0, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 43;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;m);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(weights); <emphasis role="strong">free</emphasis>(weights);
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">test_normalized_laplacian</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *w, igraph_bool_t dir) {
+  igraph_t g;
+  igraph_matrix_t m, m2;
+  igraph_sparsemat_t sm;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec, *weights = 0;
+  igraph_bool_t ok = 1;
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;sm, 0, 0, 0);
+
+  <emphasis role="strong">if</emphasis> (w) {
+    weights = (<link linkend='igraph_vector_t'>igraph_vector_t</link>*)<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link>));
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(weights, w);
+  }
+
+  <emphasis>/* Undirected graph, no loop or multiple edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, dir, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 1, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 44;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  ok = ok &amp;&amp; <emphasis role="strong">check_laplacian</emphasis>(&amp;g, &amp;m, weights);
+
+  <emphasis>/* Add some loop edges */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;vec, 4, 1.0, 1.0, 2.0, 2.0);
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 2);
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 2);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 1, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 45;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  ok = ok &amp;&amp; <emphasis role="strong">check_laplacian</emphasis>(&amp;g, &amp;m, weights);
+
+  <emphasis>/* Duplicate some edges */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;vec, 4, 1.0, 2.0, 3.0, 4.0);
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;vec, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 3);
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(weights, 3);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, &amp;m, &amp;sm, 1, weights);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;m2, &amp;sm);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_matrix_all_e_tol</emphasis>(&amp;m, &amp;m2, 0)) { 
+    <emphasis role="strong">return</emphasis> 46;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  ok = ok &amp;&amp; <emphasis role="strong">check_laplacian</emphasis>(&amp;g, &amp;m, weights);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong">if</emphasis> (weights) {
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(weights); <emphasis role="strong">free</emphasis>(weights);
+  }
+
+  <emphasis role="strong">if</emphasis> (ok)
+    <emphasis role="strong">printf</emphasis>("OK\n");
+
+  <emphasis role="strong">return</emphasis> !ok;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int res;
+  int i;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_integer_t is_weighted;
+
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;weights, 5, 1.0, 2.0, 3.0, 4.0, 5.0);
+
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 8; i++) {
+    igraph_bool_t is_normalized = i / 4;
+    <link linkend='igraph_vector_t'>igraph_vector_t</link>* v = ((i &amp; 2) / 2 ? &amp;weights : 0);
+    igraph_bool_t dir = (i % 2 ? IGRAPH_DIRECTED : IGRAPH_UNDIRECTED);
+
+    <emphasis role="strong">printf</emphasis>("=== %sormalized, %sweighted, %sdirected\n",
+      (is_normalized ? "N" : "Unn"),
+      (v != 0 ? "" : "un"),
+      (dir == IGRAPH_DIRECTED ? "" : "un")
+    );
+
+    <emphasis role="strong">if</emphasis> (is_normalized)
+      res = <emphasis role="strong">test_normalized_laplacian</emphasis>(v, dir);
+    <emphasis role="strong">else</emphasis>
+      res = <emphasis role="strong">test_unnormalized_laplacian</emphasis>(v, dir);
+
+    <emphasis role="strong">if</emphasis> (res)
+      <emphasis role="strong">return</emphasis> i+1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lattice.c.xml igraph-0.6.5/examples/simple/igraph_lattice.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lattice.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lattice.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,181 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  int dim;
+  int m;
+  int nei;
+  igraph_bool_t directed, mutual, circular;
+  igraph_real_t *dimedges;
+} lat_test_t;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">LAT_TEST</emphasis>(id, d, m, ne, di, mu, ci, ...) \
+  igraph_real_t lat_ ## id ## _edges[] = { __VA_ARGS__ } ; \
+  lat_test_t lat_ ## id = { d, m, ne, di, mu, ci, lat_ ## id ## _edges }
+
+<emphasis>/*----------------d--m--ne-di-mu-ci-dimedges------------------------*/</emphasis>
+<emphasis role="strong">LAT_TEST</emphasis>(u_0,     0, 0, 1, 0, 0, 0,  -1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_01,    1, 0, 1, 0, 0, 0,  0 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_02,    2, 0, 1, 0, 0, 0,  0, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_03,    2, 0, 1, 0, 0, 0,  1, 0 );
+
+<emphasis role="strong">LAT_TEST</emphasis>(d_0,     0, 0, 1, 1, 0, 0,  -1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_01,    1, 0, 1, 1, 0, 0,  0 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_02,    2, 0, 1, 1, 0, 0,  0, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_03,    2, 0, 1, 1, 0, 0,  1, 0 );
+
+<emphasis role="strong">LAT_TEST</emphasis>(u_1,     1, 0, 1, 0, 0, 0,  1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_1x1,   2, 0, 1, 0, 0, 0,  1, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_2,     1, 1, 1, 0, 0, 0,  2, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_2x1,   2, 1, 1, 0, 0, 0,  2,1, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(u_2x2,   2, 4, 1, 0, 0, 0,  2,2, 0,1, 0,2, 1,3, 2,3 );
+
+<emphasis role="strong">LAT_TEST</emphasis>(uc_1,    1, 0, 1, 0, 0, 1,  1 );
+<emphasis role="strong">LAT_TEST</emphasis>(uc_1x1,  2, 0, 1, 0, 0, 1,  1, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(uc_2,    1, 1, 1, 0, 0, 1,  2, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(uc_2x1,  2, 1, 1, 0, 0, 1,  2,1, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(uc_2x2,  2, 4, 1, 0, 0, 1,  2,2, 0,1, 0,2, 1,3, 2,3 );
+
+<emphasis role="strong">LAT_TEST</emphasis>(dc_1,    1, 0, 1, 1, 0, 1,  1 );
+<emphasis role="strong">LAT_TEST</emphasis>(dc_1x1,  2, 0, 1, 1, 0, 1,  1, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(dc_2,    1, 2, 1, 1, 0, 1,  2, 0,1, 1,0 );
+<emphasis role="strong">LAT_TEST</emphasis>(dc_2x1,  2, 2, 1, 1, 0, 1,  2,1, 0,1, 1,0 );
+<emphasis role="strong">LAT_TEST</emphasis>(dc_2x2,  2, 8, 1, 1, 0, 1,  2,2, 0,1, 0,2, 1,3, 2,3, 
+	                             1,0, 2,0, 3,1, 3,2, );
+
+<emphasis role="strong">LAT_TEST</emphasis>(d_1,     1, 0, 1, 1, 0, 0,  1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_1x1,   2, 0, 1, 1, 0, 0,  1, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_2,     1, 1, 1, 1, 0, 0,  2, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_2x1,   2, 1, 1, 1, 0, 0,  2,1, 0,1 );
+<emphasis role="strong">LAT_TEST</emphasis>(d_2x2,   2, 4, 1, 1, 0, 0,  2,2, 0,1, 0,2, 1,3, 2,3 );
+
+<emphasis role="strong">LAT_TEST</emphasis>(dmc_1,   1, 0, 1, 1, 0, 1,  1 );
+<emphasis role="strong">LAT_TEST</emphasis>(dmc_1x1, 2, 0, 1, 1, 0, 1,  1, 1 );
+<emphasis role="strong">LAT_TEST</emphasis>(dmc_2,   1, 2, 1, 1, 0, 1,  2, 0,1, 1,0 );
+<emphasis role="strong">LAT_TEST</emphasis>(dmc_2x1, 2, 2, 1, 1, 0, 1,  2,1, 0,1, 1,0 );
+<emphasis role="strong">LAT_TEST</emphasis>(dmc_2x2, 2, 4, 1, 1, 0, 1,  2,2, 0,1, 0,2, 1,3, 2,3, 
+				     1,0, 3,2, );
+<emphasis>/*----------------d--m--ne-di-mu-ci-dimedges------------------------*/</emphasis>
+
+<emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> add more */</emphasis>
+
+lat_test_t *all_checks[] = { <emphasis>/*  1 */</emphasis> &amp;lat_u_0,   <emphasis>/*  2 */</emphasis> &amp;lat_u_01,
+			     <emphasis>/*  3 */</emphasis> &amp;lat_u_02,  <emphasis>/*  4 */</emphasis> &amp;lat_u_03,
+			     <emphasis>/*  5 */</emphasis> &amp;lat_d_0,   <emphasis>/*  6 */</emphasis> &amp;lat_d_01,
+			     <emphasis>/*  7 */</emphasis> &amp;lat_d_02,  <emphasis>/*  8 */</emphasis> &amp;lat_d_03,
+			     <emphasis>/*  9 */</emphasis> &amp;lat_u_1,   <emphasis>/* 10 */</emphasis> &amp;lat_u_1x1,
+			     <emphasis>/* 11 */</emphasis> &amp;lat_u_2,   <emphasis>/* 12 */</emphasis> &amp;lat_u_2x1,
+			     <emphasis>/* 13 */</emphasis> &amp;lat_u_2x2, <emphasis>/* 14 */</emphasis> &amp;lat_u_1,
+			     <emphasis>/* 15 */</emphasis> &amp;lat_u_1x1, <emphasis>/* 16 */</emphasis> &amp;lat_u_2,
+			     <emphasis>/* 17 */</emphasis> &amp;lat_u_2x1, <emphasis>/* 18 */</emphasis> &amp;lat_uc_2x2,
+			     <emphasis>/* 19 */</emphasis> &amp;lat_dc_1,  <emphasis>/* 20 */</emphasis> &amp;lat_dc_1x1,
+			     <emphasis>/* 21 */</emphasis> &amp;lat_dc_2,  <emphasis>/* 22 */</emphasis> &amp;lat_dc_2x1,
+			     <emphasis>/* 23 */</emphasis> &amp;lat_dc_2x2,<emphasis>/* 24 */</emphasis> &amp;lat_d_1,
+			     <emphasis>/* 25 */</emphasis> &amp;lat_d_1x1, <emphasis>/* 26 */</emphasis> &amp;lat_d_2,
+			     <emphasis>/* 27 */</emphasis> &amp;lat_d_2x1, <emphasis>/* 28 */</emphasis> &amp;lat_d_2x2,
+			     <emphasis>/* 29 */</emphasis> &amp;lat_dc_2x2,<emphasis>/* 30 */</emphasis> &amp;lat_d_1,
+			     <emphasis>/* 31 */</emphasis> &amp;lat_d_1x1, <emphasis>/* 32 */</emphasis> &amp;lat_d_2,
+			     <emphasis>/* 33 */</emphasis> &amp;lat_d_2x1, <emphasis>/* 34 */</emphasis> &amp;lat_d_2x2,
+			     0 };
+
+int <emphasis role="strong">check_lattice_properties</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *lattice,
+			     <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *dim, 
+			     igraph_bool_t directed, 
+			     igraph_bool_t mutual, 
+			     igraph_bool_t circular) {
+  igraph_bool_t res;
+
+  <emphasis>/* Connected */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_connected'>igraph_is_connected</link></emphasis>(lattice, &amp;res, IGRAPH_WEAK); 
+  <emphasis role="strong">if</emphasis> (!res) {
+    <emphasis role="strong">printf</emphasis>("Not connected\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* Simple */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(lattice, &amp;res); 
+  <emphasis role="strong">if</emphasis> (!res) {
+    <emphasis role="strong">printf</emphasis>("Not simple\n");
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">check_lattice</emphasis>(<emphasis role="strong">const</emphasis> lat_test_t *test) {
+  igraph_t graph, othergraph;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> otheredges;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> dimvector;
+  igraph_bool_t iso;
+  int ret;  
+    
+  <emphasis>/* Create lattice */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;dimvector, test-&gt;dimedges, test-&gt;dim);
+  <emphasis role="strong"><link linkend='igraph_lattice'>igraph_lattice</link></emphasis>(&amp;graph, &amp;dimvector, test-&gt;nei, test-&gt;directed,
+		 test-&gt;mutual, test-&gt;circular);
+
+  <emphasis>/* Check its properties */</emphasis>
+  <emphasis role="strong">if</emphasis> (ret=<emphasis role="strong">check_lattice_properties</emphasis>(&amp;graph, &amp;dimvector, test-&gt;directed, 
+				   test-&gt;mutual, test-&gt;circular)) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+    <emphasis role="strong">printf</emphasis>("Lattice properties are not satisfied\n");
+    <emphasis role="strong">return</emphasis> ret;
+  }
+  
+  <emphasis>/* Check that it is isomorphic to the stored graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;otheredges, test-&gt;dimedges+test-&gt;dim, test-&gt;m * 2);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;othergraph, &amp;otheredges, <emphasis role="strong"><link linkend='igraph_vector_prod'>igraph_vector_prod</link></emphasis>(&amp;dimvector),
+		test-&gt;directed);
+  <emphasis role="strong"><link linkend='igraph_isomorphic'>igraph_isomorphic</link></emphasis>(&amp;graph, &amp;othergraph, &amp;iso);
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">printf</emphasis>("--\n");
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;graph, stdout);
+    <emphasis role="strong">printf</emphasis>("--\n");
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;othergraph, stdout);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;othergraph);
+    <emphasis role="strong">return</emphasis> 50;    
+  }  
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;othergraph);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int i, ret;
+
+  i=0;
+  <emphasis role="strong">while</emphasis> (all_checks[i]) {
+    <emphasis role="strong">if</emphasis> ((ret=<emphasis role="strong">check_lattice</emphasis>(all_checks[i]))) { 
+      <emphasis role="strong">printf</emphasis>("Check no #%d failed.\n", (int) (i+1));
+      <emphasis role="strong">return</emphasis> ret;
+    }
+    i++;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_grid.c.xml igraph-0.6.5/examples/simple/igraph_layout_grid.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_grid.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_grid.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,69 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_matrix_t coords;
+
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 15, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+
+  <emphasis>/* Predefined width, 2D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid'>igraph_layout_grid</link></emphasis>(&amp;g, &amp;coords, 5);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Automatic width, 2D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid'>igraph_layout_grid</link></emphasis>(&amp;g, &amp;coords, -1);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Predefined width and height, 3D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid_3d'>igraph_layout_grid_3d</link></emphasis>(&amp;g, &amp;coords, 4, 2);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("=====\n");
+
+  <emphasis>/* Predefined width, 3D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid_3d'>igraph_layout_grid_3d</link></emphasis>(&amp;g, &amp;coords, 4, -1);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("=====\n");
+
+  <emphasis>/* Predefined height, 3D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid_3d'>igraph_layout_grid_3d</link></emphasis>(&amp;g, &amp;coords, -1, 3);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("=====\n");
+
+  <emphasis>/* Automatic width and height, 3D */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_grid_3d'>igraph_layout_grid_3d</link></emphasis>(&amp;g, &amp;coords, -1, -1);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_lgl.c.xml igraph-0.6.5/examples/simple/igraph_layout_lgl.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_lgl.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_lgl.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,50 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_matrix_t coords;
+  igraph_real_t vc;
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 100, 3, IGRAPH_TREE_UNDIRECTED);
+<emphasis>/*   igraph_barabasi_game(&amp;g, 1000, 1, 0, 0, IGRAPH_UNDIRECTED); */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+  vc=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_layout_lgl'>igraph_layout_lgl</link></emphasis>(&amp;g, &amp;coords, 
+		    <emphasis>/* maxiter */</emphasis>    150, 
+		    <emphasis>/* maxdelta */</emphasis>   vc,
+		    <emphasis>/* area */</emphasis>       vc*vc,
+		    <emphasis>/* coolexp */</emphasis>    1.5,
+		    <emphasis>/* repulserad */</emphasis> vc*vc*vc,
+		    <emphasis>/* cellsize */</emphasis>   <emphasis role="strong">sqrt</emphasis>(<emphasis role="strong">sqrt</emphasis>(vc)),
+		    <emphasis>/* root */</emphasis>       0);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_mds.c.xml igraph-0.6.5/examples/simple/igraph_layout_mds.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_mds.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_mds.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,97 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">sqr</emphasis>(x) ((x)*(x))
+
+int <emphasis role="strong">main</emphasis>() {
+  float dist[8][8] = {
+	  {0.00, 4.69, 6.79, 3.50, 3.11, 4.46, 5.57, 3.00},
+	  {4.69, 0.00, 2.10, 2.27, 2.65, 2.36, 1.99, 1.74},
+	  {6.79, 2.10, 0.00, 3.78, 4.53, 2.83, 2.44, 3.79},
+	  {3.50, 2.27, 3.78, 0.00, 1.98, 4.35, 2.07, 0.53},
+	  {3.11, 2.65, 4.53, 1.98, 0.00, 3.80, 3.31, 1.47},
+	  {4.46, 2.36, 2.83, 4.35, 3.80, 0.00, 4.35, 3.82},
+	  {5.57, 1.99, 2.44, 2.07, 3.31, 4.35, 0.00, 2.57},
+	  {3.00, 1.74, 3.79, 0.53, 1.47, 3.82, 2.57, 0.00},
+  };
+  igraph_t g;
+  igraph_matrix_t coords, dist_mat;
+  igraph_real_t vc;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  int i, j;
+  <emphasis role="strong">srand</emphasis>(<emphasis role="strong">time</emphasis>(0));
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, 2, IGRAPH_TREE_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_layout_mds'>igraph_layout_mds</link></emphasis>(&amp;g, &amp;coords, 0, 2, &amp;options);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, 0, 0) &gt; 0) {
+    <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;coords); i++)
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 0) *= -1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, 0, 1) &lt; 0) {
+    <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;coords); i++)
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 1) *= -1;
+  }
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 8, IGRAPH_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 8, 2);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;dist_mat, 8, 8);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 8; i++)
+    <emphasis role="strong">for</emphasis> (j = 0; j &lt; 2; j++)
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, j) = <emphasis role="strong">rand</emphasis>() % 1000;
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 8; i++)
+    <emphasis role="strong">for</emphasis> (j = i+1; j &lt; 8; j++) {
+      double dist_sq = 0.0;
+      dist_sq += <emphasis role="strong">sqr</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 0)-<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, j, 0));
+      dist_sq += <emphasis role="strong">sqr</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 1)-<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, j, 1));
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(dist_mat, i, j) = <emphasis role="strong">sqrt</emphasis>(dist_sq);
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(dist_mat, j, i) = <emphasis role="strong">sqrt</emphasis>(dist_sq);
+	}
+  <emphasis role="strong"><link linkend='igraph_layout_mds'>igraph_layout_mds</link></emphasis>(&amp;g, &amp;coords, &amp;dist_mat, 2, &amp;options);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 8; i++)
+    <emphasis role="strong">for</emphasis> (j = i+1; j &lt; 8; j++) {
+      double dist_sq = 0.0;
+      dist_sq += <emphasis role="strong">sqr</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 0)-<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, j, 0));
+      dist_sq += <emphasis role="strong">sqr</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, i, 1)-<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(coords, j, 1));
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong">sqrt</emphasis>(dist_sq) - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(dist_mat, i, j)) &gt; 1e-2) {
+        <emphasis role="strong">printf</emphasis>("dist(%d,%d) should be %.4f, but it is %.4f\n",
+				i, j, <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(dist_mat, i, j), <emphasis role="strong">sqrt</emphasis>(dist_sq));
+        <emphasis role="strong">return</emphasis> 1;
+      }
+    }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;dist_mat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge.c.xml igraph-0.6.5/examples/simple/igraph_layout_merge.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_merge.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,84 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+int <emphasis role="strong">igraph_i_layout_merge_dla</emphasis>(igraph_i_layout_mergegrid_t *grid, 
+			      long int actg, igraph_real_t *x, igraph_real_t *y, igraph_real_t r,
+			      igraph_real_t cx, igraph_real_t cy, igraph_real_t startr, 
+			      igraph_real_t killr);
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis>/*******************/</emphasis>
+  <emphasis>/* Testing the DLA */</emphasis>
+  <emphasis>/*******************/</emphasis>
+  long int nodes=10;
+  igraph_i_layout_mergegrid_t grid;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> x, y, r;
+  long int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, nodes);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;y, nodes);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;r, nodes);  
+  <emphasis role="strong">igraph_i_layout_mergegrid_init</emphasis>(&amp;grid, -5, 5, 100, -5, 5, 100);
+
+  <emphasis>/* radius */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nodes; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(r)[i]=<emphasis role="strong">rand</emphasis>()/(double)RAND_MAX;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;r);
+
+  <emphasis>/* place */</emphasis>
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(x)[0]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(y)[0]=0;
+  <emphasis role="strong">igraph_i_layout_merge_place_sphere</emphasis>(&amp;grid, 0, 0, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(r)[nodes-1], 0);
+
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;nodes; i++) {
+<emphasis>/*     fprintf(stderr, "%li ", i); */</emphasis>
+    <emphasis role="strong">igraph_i_layout_merge_dla</emphasis>(&amp;grid, i, 
+			      <emphasis role="strong"><link linkend='igraph_vector_e_ptr'>igraph_vector_e_ptr</link></emphasis>(&amp;x, i),
+			      <emphasis role="strong"><link linkend='igraph_vector_e_ptr'>igraph_vector_e_ptr</link></emphasis>(&amp;y, i),
+			      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(r)[nodes-i-1], 0, 0, 4, 7);
+    <emphasis role="strong">igraph_i_layout_merge_place_sphere</emphasis>(&amp;grid, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(x)[i], <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(y)[i], 
+				       <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(r)[nodes-i-1], i);
+  }
+
+<emphasis>/*   for (i=0; i&lt;nodes; i++) {  */</emphasis>
+<emphasis>/*     printf("%f %f\n", VECTOR(x)[i], VECTOR(y)[i]); */</emphasis>
+<emphasis>/*   } */</emphasis>
+
+<emphasis>/*   print_grid(&amp;grid, stdout); */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;r);
+  <emphasis role="strong">igraph_i_layout_mergegrid_destroy</emphasis>(&amp;grid);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge2.c.xml igraph-0.6.5/examples/simple/igraph_layout_merge2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_merge2.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t small, big;
+  igraph_matrix_t small_coords, big_coords, merged_coords;
+  igraph_vector_ptr_t graph_ptr, coords_ptr;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> arpack_opts;
+
+  <emphasis>/* To make things reproducible */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;big, 10, IGRAPH_UNDIRECTED, 
+	       0,1, 1,2, 2,3, 3,4, 4,5, 5,6, 6,7, 7,8, 8,9, 9,0,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;small, 3, IGRAPH_UNDIRECTED,
+	       0,1, 1,2, 2,0,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;arpack_opts);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;big_coords, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_layout_mds'>igraph_layout_mds</link></emphasis>(&amp;big, &amp;big_coords, <emphasis>/*dist=*/</emphasis> 0, <emphasis>/*dim=*/</emphasis> 2,
+		    &amp;arpack_opts);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;small_coords, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_layout_mds'>igraph_layout_mds</link></emphasis>(&amp;small, &amp;small_coords, <emphasis>/*dist=*/</emphasis> 0, <emphasis>/*dim=*/</emphasis> 2,
+		    &amp;arpack_opts);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;graph_ptr, 2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;coords_ptr, 2);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;merged_coords, 0, 0);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(graph_ptr)[0] = &amp;big; 
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(graph_ptr)[1] = &amp;small;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(coords_ptr)[0] = &amp;big_coords;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(coords_ptr)[1] = &amp;small_coords;
+  
+  <emphasis role="strong"><link linkend='igraph_layout_merge_dla'>igraph_layout_merge_dla</link></emphasis>(&amp;graph_ptr, &amp;coords_ptr, &amp;merged_coords);
+  
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;merged_coords);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;merged_coords);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;small_coords);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;big_coords);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;graph_ptr);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;coords_ptr);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;small);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;big);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge3.c.xml igraph-0.6.5/examples/simple/igraph_layout_merge3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_merge3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_merge3.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,45 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t graph;
+  igraph_matrix_t coords;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;graph, IGRAPH_ERDOS_RENYI_GNP, <emphasis>/*n=*/</emphasis> 100, 
+			    <emphasis>/*p=*/</emphasis> 2.0/100, IGRAPH_UNDIRECTED, <emphasis>/*loops=*/</emphasis> 0);
+    <emphasis role="strong"><link linkend='igraph_layout_mds'>igraph_layout_mds</link></emphasis>(&amp;graph, &amp;coords, <emphasis>/*dist=*/</emphasis> 0, <emphasis>/*dim=*/</emphasis> 2,
+		      <emphasis>/*options=*/</emphasis> 0);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+	 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_reingold_tilford.c.xml igraph-0.6.5/examples/simple/igraph_layout_reingold_tilford.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_reingold_tilford.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_reingold_tilford.c.xml	2013-03-03 01:45:53.000000000 +0000
@@ -0,0 +1,48 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  FILE *f;
+  igraph_matrix_t coords;
+  long int i, n;
+
+  f=<emphasis role="strong">fopen</emphasis>("igraph_layout_reingold_tilford.in", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_edgelist'>igraph_read_graph_edgelist</link></emphasis>(&amp;g, f, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_layout_reingold_tilford'>igraph_layout_reingold_tilford</link></emphasis>(&amp;g, &amp;coords, IGRAPH_IN, 0, 0); 
+  
+  <emphasis>/*n=igraph_vcount(&amp;g);</emphasis>
+<emphasis>  for (i=0; i&lt;n; i++) {</emphasis>
+<emphasis>    printf("%6.3f %6.3f\n", MATRIX(coords, i, 0), MATRIX(coords, i, 1));</emphasis>
+<emphasis>  }*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_layout_sugiyama.c.xml igraph-0.6.5/examples/simple/igraph_layout_sugiyama.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_layout_sugiyama.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_layout_sugiyama.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,98 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g, extd_g;
+  igraph_matrix_t coords;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edgelist, extd_edgelist, extd_to_orig_eids;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> layers;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;coords, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;extd_to_orig_eids, 0);
+
+  <emphasis>/* Layout on simple graph with predefined layers */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;layers, -1, 0,1,1,2,3,3,4,4,5, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;edgelist, -1,
+          0,1, 0,2, 0,3, 1,2, 2,2, 1,4, 2,5, 4,6, 5,7, 6,8, 7,8,
+          3,8, 8,1, 8,2, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;edgelist, 0, 1);
+
+  <emphasis role="strong"><link linkend='igraph_layout_sugiyama'>igraph_layout_sugiyama</link></emphasis>(&amp;g, &amp;coords, 0, 0, &amp;layers,
+          <emphasis>/* hgap = */</emphasis> 1,
+          <emphasis>/* vgap = */</emphasis> 1,
+          <emphasis>/* maxiter = */</emphasis> 100,
+          <emphasis>/* weights = */</emphasis> 0);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Same, but this time also return the extended graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_sugiyama'>igraph_layout_sugiyama</link></emphasis>(&amp;g, &amp;coords, &amp;extd_g, &amp;extd_to_orig_eids, &amp;layers,
+          <emphasis>/* hgap = */</emphasis> 1,
+          <emphasis>/* vgap = */</emphasis> 1,
+          <emphasis>/* maxiter = */</emphasis> 100,
+          <emphasis>/* weights = */</emphasis> 0);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;extd_edgelist, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(&amp;extd_g, &amp;extd_edgelist, 0);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;extd_edgelist);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;extd_edgelist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;extd_g);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;extd_to_orig_eids);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;layers);
+
+  <emphasis>/* Same, but with automatic layering */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_layout_sugiyama'>igraph_layout_sugiyama</link></emphasis>(&amp;g, &amp;coords, 0, 0, 0,
+          <emphasis>/* hgap = */</emphasis> 1,
+          <emphasis>/* vgap = */</emphasis> 1,
+          <emphasis>/* maxiter = */</emphasis> 100,
+          <emphasis>/* weights = */</emphasis> 0);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis>/* Layering with gaps in it */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;layers, -1, 0,2,2,4,6,6,12,12,15, -1);
+  <emphasis role="strong"><link linkend='igraph_layout_sugiyama'>igraph_layout_sugiyama</link></emphasis>(&amp;g, &amp;coords, 0, 0, &amp;layers,
+          <emphasis>/* hgap = */</emphasis> 1,
+          <emphasis>/* vgap = */</emphasis> 1,
+          <emphasis>/* maxiter = */</emphasis> 100,
+          <emphasis>/* weights = */</emphasis> 0);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;layers);
+  <emphasis role="strong">printf</emphasis>("===\n");
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edgelist);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;coords);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;extd_to_orig_eids);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_lcf.c.xml igraph-0.6.5/examples/simple/igraph_lcf.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_lcf.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_lcf.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,48 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, g2;
+  igraph_bool_t iso;
+  
+  <emphasis role="strong"><link linkend='igraph_lcf'>igraph_lcf</link></emphasis>(&amp;g, 12, 5, -5, 6, 0);
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;g2, "franklin");
+  
+  <emphasis role="strong"><link linkend='igraph_isomorphic_vf2'>igraph_isomorphic_vf2</link></emphasis>(&amp;g, &amp;g2, 
+			<emphasis>/*vertex.color1=*/</emphasis> 0, <emphasis>/*vertex.color2=*/</emphasis> 0, 
+			<emphasis>/*edge.color1=*/</emphasis> 0, <emphasis>/*edge.color2=*/</emphasis> 0,
+			&amp;iso, 0, 0, 0, 0, 0);
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">printf</emphasis>("OOOPS!\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_local_transitivity.c.xml igraph-0.6.5/examples/simple/igraph_local_transitivity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_local_transitivity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_local_transitivity.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,60 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_vs_t vertices;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> result;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_vs_seq'>igraph_vs_seq</link></emphasis>(&amp;vertices, 1, 101);
+  <emphasis role="strong"><link linkend='igraph_barabasi_game'>igraph_barabasi_game</link></emphasis>(&amp;g, 100000, <emphasis>/*power=*/</emphasis> 1, 3, 0, 0, <emphasis>/*A=*/</emphasis> 1,
+		       IGRAPH_DIRECTED, IGRAPH_BARABASI_BAG, 
+		       <emphasis>/*start_from=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result, 0);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;1; i++) {
+    <emphasis role="strong">igraph_transitivity_local_undirected2</emphasis>(&amp;g, &amp;result, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			IGRAPH_TRANSITIVITY_NAN);
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;1; i++) {
+    <emphasis role="strong">igraph_transitivity_local_undirected4</emphasis>(&amp;g, &amp;result, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(),
+			IGRAPH_TRANSITIVITY_NAN);
+  }
+  
+<emphasis>/*   for (i=0; i&lt;igraph_vector_size(&amp;result); i++) { */</emphasis>
+<emphasis>/*     printf("%f ", VECTOR(result)[i]); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   printf("\n"); */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vertices);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_marked_queue.c.xml igraph-0.6.5/examples/simple/igraph_marked_queue.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_marked_queue.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_marked_queue.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,63 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> "igraph_marked_queue.h"
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_marked_queue_t Q;
+  long int i;
+  
+  <emphasis role="strong">igraph_marked_queue_init</emphasis>(&amp;Q, 100);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;50; i++) {
+    <emphasis role="strong">igraph_marked_queue_push</emphasis>(&amp;Q, i);
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_marked_queue_iselement</emphasis>(&amp;Q, i)) {
+      <emphasis role="strong">return</emphasis> 4;
+    }
+    <emphasis role="strong">if</emphasis> (! ((i+1) % 5)) {
+      <emphasis role="strong">igraph_marked_queue_start_batch</emphasis>(&amp;Q);
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;50; i++) {
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_marked_queue_iselement</emphasis>(&amp;Q, i)) {
+      <emphasis role="strong">printf</emphasis>("Problem with %li.\n", i);
+      <emphasis role="strong">return</emphasis> 3;
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;=50/5; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_marked_queue_empty</emphasis>(&amp;Q)) {
+      <emphasis role="strong">return</emphasis> 1;
+    }
+    <emphasis role="strong">igraph_marked_queue_pop_back_batch</emphasis>(&amp;Q);
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_marked_queue_empty</emphasis>(&amp;Q)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">igraph_marked_queue_destroy</emphasis>(&amp;Q);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_maximal_cliques.c.xml igraph-0.6.5/examples/simple/igraph_maximal_cliques.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_maximal_cliques.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_maximal_cliques.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,122 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> NODES 1000
+<emphasis role="strong">#define</emphasis> CLIQUE_SIZE 10
+<emphasis role="strong">#define</emphasis> NO_CLIQUES 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">INT</emphasis>(a) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, (a)))
+
+int <emphasis role="strong">permutation</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *vec) {
+  int i, r, tmp;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;CLIQUE_SIZE; i++) {
+    r=<emphasis role="strong">INT</emphasis>(NODES-1);
+    tmp=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[i];
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[i]=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[r];
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[r]=tmp;
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+void <emphasis role="strong">print_and_destroy_cliques</emphasis>(igraph_vector_ptr_t *cliques) {
+  int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(cliques); i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*cliques)[i];
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+  }
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, g2, cli;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> perm;
+  igraph_vector_ptr_t cliques;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis>/* Create a graph that has a random component, plus a number of </emphasis>
+<emphasis>     relatively small cliques */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;perm, 0, NODES-1);
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g, IGRAPH_ERDOS_RENYI_GNM, NODES, NODES, 
+        <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;cli, CLIQUE_SIZE, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;NO_CLIQUES; i++) {
+    <emphasis>/* Permute vertices of g */</emphasis>
+    <emphasis role="strong">permutation</emphasis>(&amp;perm);
+    <emphasis role="strong"><link linkend='igraph_permute_vertices'>igraph_permute_vertices</link></emphasis>(&amp;g, &amp;g2, &amp;perm);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+    g=g2;
+    
+    <emphasis>/* Add a clique */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_union'>igraph_union</link></emphasis>(&amp;g2, &amp;g, &amp;cli);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+    g=g2;
+  }
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, <emphasis>/*multiple=*/</emphasis> 1, <emphasis>/*loop=*/</emphasis> 0, <emphasis>/*edge_comb=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;perm);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;cli);
+  
+  <emphasis>/* Find the maximal cliques */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cliques, 0);
+  <emphasis role="strong"><link linkend='igraph_maximal_cliques'>igraph_maximal_cliques</link></emphasis>(&amp;g, &amp;cliques, <emphasis>/*min_size=*/</emphasis> 3,
+       <emphasis>/*max_size=*/</emphasis> 0 <emphasis>/*no limit*/</emphasis>);
+  
+  <emphasis>/* Print and destroy them */</emphasis>
+
+  <emphasis role="strong">print_and_destroy_cliques</emphasis>(&amp;cliques);
+  
+  <emphasis>/* Clean up */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cliques);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Build a triangle with a loop (thanks to Emmanuel Navarro) */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 3, IGRAPH_UNDIRECTED, 0, 1, 1, 2, 2, 0, 0, 0, -1);
+
+  <emphasis>/* Find the maximal cliques */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;cliques, 0);
+  <emphasis role="strong"><link linkend='igraph_maximal_cliques'>igraph_maximal_cliques</link></emphasis>(&amp;g, &amp;cliques, <emphasis>/*min_size=*/</emphasis> 3,
+    <emphasis>/*max_size=*/</emphasis> 0 <emphasis>/*no limit*/</emphasis>);
+
+  <emphasis>/* Print and destroy them */</emphasis>
+
+  <emphasis role="strong">print_and_destroy_cliques</emphasis>(&amp;cliques);
+  
+  <emphasis>/* Clean up */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;cliques);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_maximum_bipartite_matching.c.xml igraph-0.6.5/examples/simple/igraph_maximum_bipartite_matching.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_maximum_bipartite_matching.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_maximum_bipartite_matching.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,249 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Tamas Nepusz </emphasis>&lt;ntamas@gmail.com&gt;
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">test_graph_from_leda_tutorial</emphasis>() {
+  <emphasis>/* Test graph from the LEDA tutorial:</emphasis>
+<emphasis>   * </emphasis>http://www.leda-tutorial.org/en/unofficial/ch05s03s05.html
+<emphasis>   */</emphasis>
+  igraph_t graph;
+  igraph_vector_bool_t types;
+  igraph_vector_long_t matching;
+  igraph_integer_t matching_size;
+  igraph_real_t matching_weight;
+  igraph_bool_t is_matching;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, 0,
+      0, 8, 0, 12, 0, 14,
+      1, 9, 1, 10, 1, 13,
+      2, 8, 2, 9,
+      3, 10, 3, 11, 3, 13,
+      4, 9, 4, 14,
+      5, 14,
+      6, 9, 6, 14,
+      7, 8, 7, 12, 7, 14
+      , -1);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, 15);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 15; i++)
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = (i &gt;= 8);
+  <emphasis role="strong">igraph_vector_long_init</emphasis>(&amp;matching, 0);
+
+  <emphasis role="strong"><link linkend='igraph_maximum_bipartite_matching'>igraph_maximum_bipartite_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching_size,
+      &amp;matching_weight, &amp;matching, 0, 0);
+  <emphasis role="strong">if</emphasis> (matching_size != 6) {
+    <emphasis role="strong">printf</emphasis>("matching_size is %ld, expected: 6\n", (long)matching_size);
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (matching_weight != 6) {
+    <emphasis role="strong">printf</emphasis>("matching_weight is %ld, expected: 6\n", (long)matching_weight);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_is_maximal_matching'>igraph_is_maximal_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching, &amp;is_matching);
+  <emphasis role="strong">if</emphasis> (!is_matching) {
+    <emphasis role="strong">printf</emphasis>("not a matching: ");
+    <emphasis role="strong">igraph_vector_long_print</emphasis>(&amp;matching);
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong">igraph_vector_long_destroy</emphasis>(&amp;matching);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">test_weighted_graph_from_mit_notes</emphasis>() {
+  <emphasis>/* Test graph from the following lecture notes:</emphasis>
+<emphasis>   * </emphasis>http://math.mit.edu/~goemans/18433S07/matching-notes.pdf
+<emphasis>   */</emphasis>
+  igraph_t graph;
+  igraph_vector_bool_t types;
+  igraph_vector_long_t matching;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_integer_t matching_size;
+  igraph_real_t matching_weight;
+  igraph_bool_t is_matching;
+  igraph_real_t weight_array[] = { 2, 7, 2, 3,
+      1, 3, 9, 3, 3,
+      1, 3, 3, 1, 2,
+      4, 1, 2,
+      3 };
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, 0,
+      0, 6, 0, 7, 0, 8, 0, 9,
+      1, 5, 1, 6, 1, 7, 1, 8, 1, 9,
+      2, 5, 2, 6, 2, 7, 2, 8, 2, 9,
+      3, 5, 3, 7, 3, 9,
+      4, 7, -1);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, 10);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 10; i++)
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = (i &gt;= 5);
+  <emphasis role="strong">igraph_vector_long_init</emphasis>(&amp;matching, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init_copy'>igraph_vector_init_copy</link></emphasis>(&amp;weights, weight_array,
+      <emphasis role="strong">sizeof</emphasis>(weight_array) / <emphasis role="strong">sizeof</emphasis>(weight_array[0]));
+
+  <emphasis role="strong"><link linkend='igraph_maximum_bipartite_matching'>igraph_maximum_bipartite_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching_size,
+      &amp;matching_weight, &amp;matching, &amp;weights, 0);
+  <emphasis role="strong">if</emphasis> (matching_size != 4) {
+    <emphasis role="strong">printf</emphasis>("matching_size is %ld, expected: 4\n", (long)matching_size);
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (matching_weight != 19) {
+    <emphasis role="strong">printf</emphasis>("matching_weight is %ld, expected: 19\n", (long)matching_weight);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_is_maximal_matching'>igraph_is_maximal_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching, &amp;is_matching);
+  <emphasis role="strong">if</emphasis> (!is_matching) {
+    <emphasis role="strong">printf</emphasis>("not a matching: ");
+    <emphasis role="strong">igraph_vector_long_print</emphasis>(&amp;matching);
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong">igraph_vector_long_destroy</emphasis>(&amp;matching);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">test_weighted_graph_generated</emphasis>() {
+  <emphasis>/* Several randomly generated small test graphs */</emphasis>
+  igraph_t graph;
+  igraph_vector_bool_t types;
+  igraph_vector_long_t matching;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_integer_t matching_size;
+  igraph_real_t matching_weight;
+  igraph_bool_t is_matching;
+  igraph_real_t weight_array_1[] = { 8, 5, 9, 18, 20, 13 };
+  igraph_real_t weight_array_2[] = { 20, 4, 20, 3, 13, 1 };
+  int i;
+
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, 10);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 10; i++)
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = (i &gt;= 5);
+  <emphasis role="strong">igraph_vector_long_init</emphasis>(&amp;matching, 0);
+
+  <emphasis>/* Case 1 */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, 0, 0, 8, 2, 7, 3, 7, 3, 8, 4, 5, 4, 9, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_copy'>igraph_vector_init_copy</link></emphasis>(&amp;weights, weight_array_1,
+      <emphasis role="strong">sizeof</emphasis>(weight_array_1) / <emphasis role="strong">sizeof</emphasis>(weight_array_1[0]));
+  <emphasis role="strong"><link linkend='igraph_maximum_bipartite_matching'>igraph_maximum_bipartite_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching_size,
+      &amp;matching_weight, &amp;matching, &amp;weights, 0);
+  <emphasis role="strong">if</emphasis> (matching_weight != 43) {
+    <emphasis role="strong">printf</emphasis>("matching_weight is %ld, expected: 43\n", (long)matching_weight);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis>/* Case 2 */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;graph, 0, 0, 0, 5, 0, 6, 1, 7, 2, 5, 3, 5, 3, 9, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_copy'>igraph_vector_init_copy</link></emphasis>(&amp;weights, weight_array_2,
+      <emphasis role="strong">sizeof</emphasis>(weight_array_2) / <emphasis role="strong">sizeof</emphasis>(weight_array_2[0]));
+  <emphasis role="strong"><link linkend='igraph_maximum_bipartite_matching'>igraph_maximum_bipartite_matching</link></emphasis>(&amp;graph, &amp;types, &amp;matching_size,
+      &amp;matching_weight, &amp;matching, &amp;weights, 0);
+  <emphasis role="strong">if</emphasis> (matching_weight != 41) {
+    <emphasis role="strong">printf</emphasis>("matching_weight is %ld, expected: 41\n", (long)matching_weight);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+
+  <emphasis role="strong">igraph_vector_long_destroy</emphasis>(&amp;matching);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">test_weighted_graph_from_file</emphasis>(<emphasis role="strong">const</emphasis> char* fname, int type1_count, long exp_weight) {
+  igraph_t graph;
+  igraph_vector_bool_t types;
+  igraph_vector_long_t matching;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights;
+  igraph_real_t matching_weight;
+  FILE* f;
+  int i, n;
+
+  f = <emphasis role="strong">fopen</emphasis>(fname, "r");
+  <emphasis role="strong">if</emphasis> (!f) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "No such file: %s\n", fname);
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_ncol'>igraph_read_graph_ncol</link></emphasis>(&amp;graph, f, 0, 1, 1, 0);
+  <emphasis role="strong">fclose</emphasis>(f);
+
+  n = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;graph);
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;types, n);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(types)[i] = (i &gt;= type1_count);
+  }
+
+  <emphasis role="strong">igraph_vector_long_init</emphasis>(&amp;matching, 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, 0);
+  <emphasis role="strong"><link linkend='EANV'>EANV</link></emphasis>(&amp;graph, "weight", &amp;weights);
+  <emphasis role="strong"><link linkend='igraph_maximum_bipartite_matching'>igraph_maximum_bipartite_matching</link></emphasis>(&amp;graph, &amp;types, 0, &amp;matching_weight,
+      &amp;matching, &amp;weights, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+
+  <emphasis role="strong">igraph_vector_long_print</emphasis>(&amp;matching);
+  <emphasis role="strong">if</emphasis> (matching_weight != exp_weight) {
+    <emphasis role="strong">printf</emphasis>("matching_weight is %ld, expected: %ld\n", (long)matching_weight,
+        (long)exp_weight);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong">igraph_vector_long_destroy</emphasis>(&amp;matching);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;types);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">test_graph_from_leda_tutorial</emphasis>())
+    <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">test_weighted_graph_from_mit_notes</emphasis>())
+    <emphasis role="strong">return</emphasis> 2;
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">test_weighted_graph_generated</emphasis>())
+    <emphasis role="strong">return</emphasis> 3;
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) {
+    <emphasis role="strong">printf</emphasis>("Finally stack still has %d elements.\n", <emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>());
+    <emphasis role="strong">return</emphasis> 4;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_mincut.c.xml igraph-0.6.5/examples/simple/igraph_mincut.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_mincut.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_mincut.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,110 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_mincut</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph, igraph_real_t value, 
+		 <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *partition, 
+		 <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *partition2, 
+		 <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *cut, 
+		 <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *capacity) {
+  
+  long int i, nc=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(cut);
+  igraph_bool_t directed=<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(graph);
+
+  <emphasis role="strong">printf</emphasis>("mincut value: %g\n", (double) value);
+  <emphasis role="strong">printf</emphasis>("first partition:  ");  <emphasis role="strong">igraph_vector_print</emphasis>(partition);
+  <emphasis role="strong">printf</emphasis>("second partition: ");  <emphasis role="strong">igraph_vector_print</emphasis>(partition2);
+  <emphasis role="strong">printf</emphasis>("edges in the cut: ");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nc; i++) {
+    long int edge=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*cut)[i];
+    long int from=<emphasis role="strong">IGRAPH_FROM</emphasis>(graph, edge);
+    long int to  =<emphasis role="strong">IGRAPH_TO</emphasis>  (graph, edge);
+    <emphasis role="strong">if</emphasis> (!directed &amp;&amp; from &gt; to) {
+      igraph_integer_t tmp=from;
+      from=to;
+      to=tmp;
+    }
+    <emphasis role="strong">printf</emphasis>("%li-%li (%g), ", from, to, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*capacity)[edge]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> weights, partition, partition2, cut;
+  igraph_real_t value;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;partition2, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;cut, 0);
+
+  <emphasis>/* -------------------------------------------- */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,1, 0,4, 1,2, 1,4, 1,5, 2,3, 2,6, 3,6, 3,7, 4,5, 5,6, 6,7,
+	       -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 2,3,3,2,2, 4,2,2,2,3, 1,3, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_mincut'>igraph_mincut</link></emphasis>(&amp;g, &amp;value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+  <emphasis role="strong">print_mincut</emphasis>(&amp;g, value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 6, IGRAPH_DIRECTED,
+	       0,1,1,2,2,3, 0,5,5,4,4,3, 3,0, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 3,1,2, 10,1,3, 2, -1);
+
+  <emphasis role="strong"><link linkend='igraph_mincut'>igraph_mincut</link></emphasis>(&amp;g, &amp;value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+  <emphasis role="strong">print_mincut</emphasis>(&amp;g, value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED,
+	       4,3, 3,2, 2,1, 1,0, 
+	       -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;weights, -1, 1,1,1,1, -1);
+  <emphasis role="strong"><link linkend='igraph_mincut'>igraph_mincut</link></emphasis>(&amp;g, &amp;value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+  <emphasis role="strong">print_mincut</emphasis>(&amp;g, value, &amp;partition, &amp;partition2, &amp;cut, &amp;weights);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cut);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;partition);
+ 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_minimal_separators.c.xml igraph-0.6.5/examples/simple/igraph_minimal_separators.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_minimal_separators.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_minimal_separators.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,59 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t graph;
+  igraph_vector_ptr_t separators;
+  long int i, n;
+  
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;graph, "zachary");
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;separators, 0);
+  <emphasis role="strong"><link linkend='igraph_all_minimal_st_separators'>igraph_all_minimal_st_separators</link></emphasis>(&amp;graph, &amp;separators);
+
+  n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;separators);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    igraph_bool_t res;
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *sep=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(separators)[i];
+    <emphasis role="strong"><link linkend='igraph_is_separator'>igraph_is_separator</link></emphasis>(&amp;graph, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(sep), &amp;res);
+    <emphasis role="strong">if</emphasis> (!res) { 
+      <emphasis role="strong">printf</emphasis>("Vertex set %li is not a separator!\n", i);
+      <emphasis role="strong">igraph_vector_print</emphasis>(sep);
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(separators)[i];
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong">igraph_Free</emphasis>(v);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;separators);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_minimum_size_separators.c.xml igraph-0.6.5/examples/simple/igraph_minimum_size_separators.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_minimum_size_separators.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_minimum_size_separators.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,167 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">print_and_destroy</emphasis>(igraph_vector_ptr_t *ptr) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(ptr);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*ptr)[i];
+    <emphasis role="strong">igraph_vector_print</emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(v);
+    <emphasis role="strong"><link linkend='igraph_free'>igraph_free</link></emphasis>(v);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(ptr);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g, g2;
+  igraph_vector_ptr_t sep;
+  igraph_vs_t vs;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 7, IGRAPH_UNDIRECTED,
+	       1,0, 2,0, 3,0, 4,0, 5,0, 6,0,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_UNDIRECTED,
+	       0,3, 1,3, 2,3,
+	       0,4, 1,4, 2,4,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_UNDIRECTED,
+	       2,0, 3,0, 4,0,
+	       2,1, 3,1, 4,1,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED,
+	       0,2, 0,3, 1,2, 1,3, 5,2, 5,3, 6,2, 6,3, 
+	       7,2, 7,3, 8,2, 8,3, 9,2, 9,3,
+	       2,4, 4,3,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 4, IGRAPH_UNDIRECTED, <emphasis>/*loops=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis>/* ----------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 23, IGRAPH_UNDIRECTED,
+	       0,1, 0,2, 0,3, 0,4, 0,5,
+	       1,2, 1,3, 1,4, 1,6,
+	       2,3, 2,5, 2,6,
+	       3,4, 3,5, 3,6,
+	       4,5, 4,6, 4,20,
+	       5,6, 
+	       6,7, 6,10, 6,13, 6,18,
+	       7,8, 7,10, 7,13,
+	       8,9,
+	       9,11, 9,12,
+	       10,11, 10,13,
+	       11,15,
+	       12,15,
+	       13,14,
+	       14,15,
+	       16,17, 16,18, 16,19,
+	       17,19, 17,20,
+	       18,19, 18,21, 18,22,
+	       19,20,
+	       20,21, 20,22,
+	       21,22,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("Orig:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 0,1,2,3,4,5,6, 16,17,18,19,20,21,22, -1);
+  <emphasis role="strong"><link linkend='igraph_induced_subgraph'>igraph_induced_subgraph</link></emphasis>(&amp;g, &amp;g2, vs, IGRAPH_SUBGRAPH_AUTO);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g2, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("1-7,17-23:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 6,7,8,9,10,11,12,13,14,15, -1);
+  <emphasis role="strong"><link linkend='igraph_induced_subgraph'>igraph_induced_subgraph</link></emphasis>(&amp;g, &amp;g2, vs, IGRAPH_SUBGRAPH_AUTO);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g2, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("7-16:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 16,17,18,19,20,21,22, -1);
+  <emphasis role="strong"><link linkend='igraph_induced_subgraph'>igraph_induced_subgraph</link></emphasis>(&amp;g, &amp;g2, vs, IGRAPH_SUBGRAPH_AUTO);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g2, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("17-23:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 6,7,10,13, -1);
+  <emphasis role="strong"><link linkend='igraph_induced_subgraph'>igraph_induced_subgraph</link></emphasis>(&amp;g, &amp;g2, vs, IGRAPH_SUBGRAPH_AUTO);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g2, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("7,8,11,14:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;sep, 0);
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 0,1,2,3,4,5,6, -1);
+  <emphasis role="strong"><link linkend='igraph_induced_subgraph'>igraph_induced_subgraph</link></emphasis>(&amp;g, &amp;g2, vs, IGRAPH_SUBGRAPH_AUTO);
+  <emphasis role="strong"><link linkend='igraph_minimum_size_separators'>igraph_minimum_size_separators</link></emphasis>(&amp;g2, &amp;sep);
+  <emphasis role="strong">printf</emphasis>("1-7:\n"); <emphasis role="strong">print_and_destroy</emphasis>(&amp;sep);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);  
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_minimum_spanning_tree.c.xml igraph-0.6.5/examples/simple/igraph_minimum_spanning_tree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_minimum_spanning_tree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_minimum_spanning_tree.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,71 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g, tree;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> eb, edges;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eb, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis role="strong"><link linkend='igraph_edge_betweenness'>igraph_edge_betweenness</link></emphasis>(&amp;g, &amp;eb, IGRAPH_UNDIRECTED, <emphasis>/*weights=*/</emphasis> 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;eb); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eb)[i] = -<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(eb)[i];
+  }
+
+  <emphasis role="strong"><link linkend='igraph_minimum_spanning_tree_prim'>igraph_minimum_spanning_tree_prim</link></emphasis>(&amp;g, &amp;tree, &amp;eb);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;tree, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;edges, 0);
+  <emphasis role="strong"><link linkend='igraph_minimum_spanning_tree'>igraph_minimum_spanning_tree</link></emphasis>(&amp;g, &amp;edges, &amp;eb);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;edges);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;tree);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eb);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_moran_process.c.xml igraph-0.6.5/examples/simple/igraph_moran_process.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_moran_process.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_moran_process.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,222 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for the Moran process in a network setting.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;assert.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis>/* test parameters structure */</emphasis>
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  igraph_t *graph;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *weights;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *quantities;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *strategies;
+  igraph_neimode_t mode;
+  int retval;
+} strategy_test_t;
+
+<emphasis>/* Error tests, i.e. we expect errors to be raised for each test.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_tests</emphasis>() {
+  igraph_t g, gzero, h;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, quantnvert, quantzero;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> strat, stratnvert, stratzero;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> wgt, wgtnedge, wgtzero;
+  int i, n, nvert, ret;
+  strategy_test_t *test;
+
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;h, 0, 0);  <emphasis>/* empty graph */</emphasis>
+  <emphasis>/* nonempty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis>/* weights vectors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;wgt, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;wgtnedge, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g));
+  <emphasis>/* quantities vectors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quant, 1);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quantnvert, nvert, 0.1, 0.2, 0.3);
+  <emphasis>/* strategies vectors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;strat, 2);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;stratnvert, nvert, 0.0, 1.0, 2.0);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;gzero, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED,
+               0,3, 0,4, 1,2, 1,4, 1,5, 2,3, 2,4, 3,4, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;gzero);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quantzero, nvert);                <emphasis>/* vector of zeros */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;stratzero, nvert);                <emphasis>/* vector of zeros */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;wgtzero, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;gzero));  <emphasis>/* vector of zeros */</emphasis>
+  <emphasis>/* igraph_vector_init_real(&amp;stratzero, nvert, 1.0, 0.0, 1.0, 2.0, 0.0, 3.0); */</emphasis>
+
+  <emphasis>/* test parameters */</emphasis>
+  <emphasis>/*------graph--weights--quantities--strategies--mode--retval------*/</emphasis>
+  <emphasis>/* null pointer for graph */</emphasis>
+  strategy_test_t null_graph = {NULL, NULL, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for weights vector */</emphasis>
+  strategy_test_t null_wgt = {&amp;g, NULL, &amp;quantnvert, &amp;stratnvert, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for quantities vector */</emphasis>
+  strategy_test_t null_quant = {&amp;g, &amp;wgt, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for strategies vector */</emphasis>
+  strategy_test_t null_strat = {&amp;g, &amp;wgt, &amp;quant, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* empty graph */</emphasis>
+  strategy_test_t empty_graph = {&amp;h, &amp;wgt, &amp;quant, &amp;strat, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of quantities vector different from number of vertices */</emphasis>
+  strategy_test_t qdiff_length = {&amp;g, &amp;wgtnedge, &amp;quant, &amp;strat, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of strategies vector different from number of vertices */</emphasis>
+  strategy_test_t sdiff_length = {&amp;g, &amp;wgtnedge, &amp;quantnvert, &amp;strat, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of weights vector different from number of edges */</emphasis>
+  strategy_test_t wdiff_length = {&amp;g, &amp;wgt, &amp;quantnvert, &amp;stratnvert, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* weights vector contains all zeros */</emphasis>
+  strategy_test_t zero_wgt = {&amp;g, &amp;wgtnedge, &amp;quantnvert, &amp;stratnvert, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* quantities vector contains all zeros */</emphasis>
+  strategy_test_t zero_quant = {&amp;gzero, &amp;wgtzero, &amp;quantzero, &amp;stratzero, IGRAPH_ALL, IGRAPH_EINVAL};
+  strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis>  &amp;null_graph,
+                                   <emphasis>/* 2 */</emphasis>  &amp;null_quant,
+                                   <emphasis>/* 3 */</emphasis>  &amp;null_strat,
+                                   <emphasis>/* 4 */</emphasis>  &amp;null_wgt,
+                                   <emphasis>/* 5 */</emphasis>  &amp;empty_graph,
+                                   <emphasis>/* 6 */</emphasis>  &amp;qdiff_length,
+                                   <emphasis>/* 7 */</emphasis>  &amp;sdiff_length,
+                                   <emphasis>/* 8 */</emphasis>  &amp;wdiff_length,
+                                   <emphasis>/* 9 */</emphasis>  &amp;zero_quant,
+                                   <emphasis>/* 10 */</emphasis> &amp;zero_wgt};
+
+  <emphasis>/* Run the error tests. We expect error to be raised for each test. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  n = 10;
+  i = 0;
+  <emphasis role="strong">while</emphasis> (i &lt; n) {
+    test = all_checks[i];
+    ret = <emphasis role="strong"><link linkend='igraph_moran_process'>igraph_moran_process</link></emphasis>(test-&gt;graph, test-&gt;weights, test-&gt;quantities,
+                               test-&gt;strategies, test-&gt;mode);
+    <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+      <emphasis role="strong">printf</emphasis>("Error test no. %d failed.\n", (int)(i + 1));
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    i++;
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;gzero);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;h);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quantnvert);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quantzero);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratnvert);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratzero);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;wgt);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;wgtnedge);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;wgtzero);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* One iteration of the Moran process on a simple digraph.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">moran_one_test</emphasis>() {
+  igraph_t g;
+  igraph_integer_t u = -1;  <emphasis>/* vertex chosen for reproduction */</emphasis>
+  igraph_integer_t v = -1;  <emphasis>/* clone of u */</emphasis>
+  igraph_integer_t nedge, nvert;
+  igraph_real_t q = 0.0;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, quantcp;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> strat, stratcp;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> wgt;
+  long int i;
+
+  <emphasis>/* graph representing the game network; quantities and strategies vectors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert*/</emphasis> 0, IGRAPH_DIRECTED,
+               0,1, 0,4, 1,2, 1,4, 2,1, 3,2, 4,0, 4,3, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  nedge = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, nvert, 0.77, 0.83, 0.64, 0.81, 0.05);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, nvert, 2.0, 0.0, 0.0, 1.0, 2.0);
+  <emphasis>/* Set the edge weights. Here we assume the following correspondence */</emphasis>
+  <emphasis>/* between edge IDs and directed edges: */</emphasis>
+  <emphasis>/* edge 0: 0 -&gt; 1 */</emphasis>
+  <emphasis>/* edge 1: 0 -&gt; 4 */</emphasis>
+  <emphasis>/* edge 2: 1 -&gt; 2 */</emphasis>
+  <emphasis>/* edge 3: 1 -&gt; 4 */</emphasis>
+  <emphasis>/* edge 4: 2 -&gt; 1 */</emphasis>
+  <emphasis>/* edge 5: 3 -&gt; 2 */</emphasis>
+  <emphasis>/* edge 6: 4 -&gt; 0 */</emphasis>
+  <emphasis>/* edge 7: 4 -&gt; 3 */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;wgt, nedge, 1.9, 0.8, 6.2, 2.4, 1.1, 5.2, 7.3, 8.8);
+
+  <emphasis>/* play game */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;quantcp, &amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcp, &amp;strat);
+  <emphasis role="strong"><link linkend='igraph_moran_process'>igraph_moran_process</link></emphasis>(&amp;g, &amp;wgt, &amp;quantcp, &amp;stratcp, IGRAPH_OUT);
+
+  <emphasis>/* Determine which vertex was chosen for death. The original quantities */</emphasis>
+  <emphasis>/* vector contain unique values, i.e. no duplicates. Thus we compare the */</emphasis>
+  <emphasis>/* updated quantities with the original one. */</emphasis>
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;quant); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quant)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quantcp)[i]) {
+      <emphasis>/* found the new clone vertex */</emphasis>
+      v = (igraph_integer_t)i;
+      q = (igraph_real_t)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quantcp)[i];
+      <emphasis role="strong">break</emphasis>;
+    }
+  }
+  <emphasis role="strong">assert</emphasis>(v &gt;= 0);
+  <emphasis role="strong">assert</emphasis>(q != 0.0);
+
+  <emphasis>/* Now we know that v is a clone of some vertex. Determine the vertex that */</emphasis>
+  <emphasis>/* v is a clone of. */</emphasis>
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;quant); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quant)[i] == q) {
+      <emphasis>/* found the vertex chosen for reproduction */</emphasis>
+      u = (igraph_integer_t)i;
+      <emphasis role="strong">break</emphasis>;
+    }
+  }
+  <emphasis role="strong">assert</emphasis>(u &gt;= 0);
+
+  <emphasis>/* check that v is indeed a clone of u */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quant)[u] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(quantcp)[v])
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(strat)[u] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcp)[v])
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quantcp);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcp);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;wgt);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_tests</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  ret = <emphasis role="strong">moran_one_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_motifs_randesu.c.xml igraph-0.6.5/examples/simple/igraph_motifs_randesu.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_motifs_randesu.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_motifs_randesu.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,70 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); 
+  igraph_real_t sum=0.0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_is_nan</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i])) { sum += <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]; }
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">igraph_real_printf</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]/sum);
+    <emphasis role="strong">printf</emphasis>(" ");
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+igraph_bool_t <emphasis role="strong">print_motif</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph, <link linkend='igraph_vector_t'>igraph_vector_t</link> *vids,
+    int isoclass, void* extra) {
+  <emphasis role="strong">printf</emphasis>("Class %d: ", isoclass);
+  <emphasis role="strong">igraph_vector_print</emphasis>(vids);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> hist;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> cp;
+
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;cp, 8, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0);
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 1000, IGRAPH_DIRECTED, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;hist, 0);
+  <emphasis role="strong"><link linkend='igraph_motifs_randesu'>igraph_motifs_randesu</link></emphasis>(&amp;g, &amp;hist, 3, &amp;cp);
+  <emphasis role="strong">print_vector</emphasis>(&amp;hist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;hist);
+
+  <emphasis role="strong"><link linkend='igraph_famous'>igraph_famous</link></emphasis>(&amp;g, "bull");
+  <emphasis role="strong"><link linkend='igraph_motifs_randesu_callback'>igraph_motifs_randesu_callback</link></emphasis>(&amp;g, 3, &amp;cp, &amp;print_motif, 0);
+  <emphasis role="strong"><link linkend='igraph_motifs_randesu_callback'>igraph_motifs_randesu_callback</link></emphasis>(&amp;g, 4, &amp;cp, &amp;print_motif, 0);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;cp);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_neighbors.c.xml igraph-0.6.5/examples/simple/igraph_neighbors.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_neighbors.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_neighbors.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,75 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 8);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 1);
+
+  <emphasis role="strong"><link linkend='igraph_neighbors'>igraph_neighbors</link></emphasis>(&amp;g, &amp;v, 2, IGRAPH_OUT);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_neighbors'>igraph_neighbors</link></emphasis>(&amp;g, &amp;v, 2, IGRAPH_IN);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_neighbors'>igraph_neighbors</link></emphasis>(&amp;g, &amp;v, 2, IGRAPH_ALL);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  
+  <emphasis>/* Errors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_neighbors'>igraph_neighbors</link></emphasis>(&amp;g, &amp;v, 2, (igraph_neimode_t)0); <emphasis>/* conv for c++ */</emphasis>
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVMODE) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  ret=<emphasis role="strong"><link linkend='igraph_neighbors'>igraph_neighbors</link></emphasis>(&amp;g, &amp;v, 4, IGRAPH_ALL);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVVID) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_pagerank.c.xml igraph-0.6.5/examples/simple/igraph_pagerank.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_pagerank.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_pagerank.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,168 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;unistd.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %4.2f", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, res, reset, weights;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> arpack_options;
+  igraph_real_t value;
+  int ret;
+
+  <emphasis>/* Test graphs taken from </emphasis>http://www.iprcom.com/papers/pagerank/<emphasis> */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[4]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[5]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[6]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[7]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[8]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[9]=2;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+  <emphasis role="strong"><link linkend='igraph_pagerank_old'>igraph_pagerank_old</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 1000, 0.001, 0.85, 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 28);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 1]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 2]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 3]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 4]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 5]=3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 6]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 7]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 8]=2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ 9]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[10]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[11]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[12]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[13]=4;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[14]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[15]=5;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[16]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[17]=6;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[18]=3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[19]=7;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[20]=4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[21]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[22]=5; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[23]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[24]=6; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[25]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[26]=7; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[27]=0;
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, 1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+  <emphasis role="strong"><link linkend='igraph_pagerank_old'>igraph_pagerank_old</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 10000, 0.0001, 0.85, 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+   
+  <emphasis>/* New PageRank */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 11, IGRAPH_STAR_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;arpack_options);
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.85, 0, &amp;arpack_options);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis>/* Check twice more for consistency */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.85, 0, &amp;arpack_options);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.85, 0, &amp;arpack_options);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+
+  <emphasis>/* Check personalized PageRank */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_personalized_pagerank_vs'>igraph_personalized_pagerank_vs</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.5, <emphasis role="strong"><link linkend='igraph_vss_1'>igraph_vss_1</link></emphasis>(1), 0,
+		  &amp;arpack_options);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+
+  <emphasis>/* Errors */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  ret=<emphasis role="strong"><link linkend='igraph_pagerank_old'>igraph_pagerank_old</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, -1, 0.0001, 0.85, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  ret=<emphasis role="strong"><link linkend='igraph_pagerank_old'>igraph_pagerank_old</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 10000, -1, 0.85, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  ret=<emphasis role="strong"><link linkend='igraph_pagerank_old'>igraph_pagerank_old</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 10000, 0.0001, 1.2, 0);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;reset, 2);
+  ret=<emphasis role="strong"><link linkend='igraph_personalized_pagerank'>igraph_personalized_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.85, &amp;reset, 0, &amp;arpack_options);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;reset, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;reset, 0);
+  ret=<emphasis role="strong"><link linkend='igraph_personalized_pagerank'>igraph_personalized_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 0, 0.85, &amp;reset, 0, &amp;arpack_options);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;reset);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_abort'>igraph_error_handler_abort</link>);
+
+  <emphasis>/* Special cases: check for empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 10, 0);
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, &amp;value, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 0.85, 0, &amp;arpack_options);
+  <emphasis role="strong">if</emphasis> (value != 1.0) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Special cases: check for full graph, zero weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 10, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 45);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, &amp;value, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 0.85, &amp;v, &amp;arpack_options);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (value != 1.0) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Another test case for PageRank (bug #792352) */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 9, 1, 0, 5, 1, 5, 2, 0, 3, 1, 5, 4, 5, 7, 6, 0, 8, 0, 8, 1, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;weights, 9);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[0] = 4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[1] = 5; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[2] = 5;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[3] = 4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[4] = 4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[5] = 4;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[6] = 3; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[7] = 4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(weights)[8] = 4;
+  <emphasis role="strong"><link linkend='igraph_pagerank'>igraph_pagerank</link></emphasis>(&amp;g, &amp;res, 0, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), 1, 0.85, &amp;weights, &amp;arpack_options);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;weights);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_power_law_fit.c.xml igraph-0.6.5/examples/simple/igraph_power_law_fit.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_power_law_fit.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_power_law_fit.c.xml	2013-03-03 01:45:54.000000000 +0000
@@ -0,0 +1,305 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_result</emphasis>(<emphasis role="strong">const</emphasis> <link linkend='igraph_plfit_result_t'>igraph_plfit_result_t</link>* result) {
+  <emphasis role="strong">printf</emphasis>("continuous = %s\n", result-&gt;continuous ? "true" : "false");
+  <emphasis role="strong">printf</emphasis>("alpha = %.5f\n", result-&gt;alpha);
+  <emphasis role="strong">printf</emphasis>("xmin = %.5f\n", result-&gt;xmin);
+  <emphasis role="strong">printf</emphasis>("L = %.5f\n", result-&gt;L);
+  <emphasis role="strong">printf</emphasis>("D = %.5f\n", result-&gt;D);
+  <emphasis role="strong">printf</emphasis>("p = %.5f\n", result-&gt;p);
+  <emphasis role="strong">printf</emphasis>("====================\n");
+}
+
+int <emphasis role="strong">test_continuous</emphasis>() {
+  <link linkend='igraph_plfit_result_t'>igraph_plfit_result_t</link> result;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vector;
+  double data[] = { 1.52219974, 6.80675663, 1.02798042, 1.31180733, 3.97473174,
+        1.17209342, 1.64889191, 2.47764721, 1.32939375, 3.03762554, 1.62638327,
+        6.08405495, 1.70890382, 1.05294973, 1.17408407, 4.48945532, 1.16777371,
+        2.52502391, 1.09755984, 1.63838051, 1.03811206, 1.47224168, 1.57161431,
+        1.60163451, 2.08280263, 1.04678340, 1.33317526, 1.58588741, 1.26484666,
+        1.02367503, 1.57045702, 3.42374138, 1.23190611, 1.09378228, 1.04959505,
+        1.05818408, 1.43879491, 2.22750459, 1.41027204, 1.81964745, 2.80239939,
+        1.25399323, 1.07479219, 3.94616077, 1.26367914, 1.87367507, 1.35741026,
+        1.14867526, 7.33024762, 1.87957274, 2.79258534, 1.21682159, 1.61194300,
+        2.81885973, 1.21514746, 1.12850917, 51.85245035, 1.21883209, 1.04861029,
+        1.69215609, 2.18429429, 1.59752172, 1.41909984, 3.14393355, 1.18298455,
+        1.67063821, 1.88568524, 1.07445906, 1.45007973, 1.12568920, 1.56806310,
+        1.36996101, 1.19440982, 6.57296980, 1.35860725, 1.06552137, 1.16950701,
+        1.34750790, 1.66977492, 1.22658722, 1.62247444, 1.23458784, 8.55843760,
+        1.70020162, 4.76368831, 1.04846170, 1.13689661, 1.94449567, 1.10584812,
+        1.32525767, 1.26640912, 1.91372972, 1.56185373, 2.37829675, 1.04616674,
+        2.43549177, 1.14961092, 1.82106455, 1.25818298, 1.64763037, 1.43019402,
+        1.50439978, 1.90281251, 1.34827040, 1.57935671, 1.77260751, 1.06976614,
+        1.12236012, 2.19770254, 1.51825533, 1.19027804, 1.08307524, 1.57912902,
+        3.33313888, 2.14005088, 1.38341873, 1.20088138, 1.25870539, 1.03811620,
+        1.86622820, 2.99310953, 1.55615055, 2.12364873, 4.49081000, 1.01274439,
+        1.22373389, 3.79059729, 3.10099275, 2.70218546, 1.03609624, 2.20776919,
+        1.00651347, 1.87344592, 1.04903307, 1.24899747, 1.20377911, 1.12706494,
+        1.01706713, 7.01069306, 1.05363146, 2.50105512, 1.11168552, 1.71133998,
+        1.17714528, 1.37986755, 2.20981534, 1.18179277, 2.07982010, 4.04967099,
+        1.00680257, 1.62850069, 2.58816230, 1.35079027, 1.03382890, 4.54326500,
+        1.62489905, 1.36102570, 1.52349738, 1.06606346, 7.80558026, 1.02602538,
+        1.43330925, 1.36040920, 9.29692547, 15.27015690, 1.75966437, 1.02635409,
+        1.40421505, 2.87296958, 1.46232202, 1.87065204, 3.37278803, 1.82589564,
+        1.06488044, 1.72568108, 1.21062115, 4.39311214, 1.12636227, 2.20820528,
+        1.09826903, 2.58989998, 1.34944949, 1.08654244, 2.38021951, 3.96308780,
+        1.37494639, 1.18245279, 3.72506217, 3.79775023, 1.19018356, 2.86924476,
+        3.40015888, 1.92317855, 1.55203754, 1.34985008, 1.31480190, 1.65899877,
+        4.77446435, 1.41073246, 1.35555456, 2.40543613, 2.72162935, 1.34475982,
+        1.41342115, 5.15278473, 1.69654436, 3.21081899, 1.18822397, 1.40394863,
+        1.06793574, 1.67085563, 1.08125975, 1.11765459, 1.17245045, 1.15711479,
+        1.18656910, 1.61296203, 1.71427634, 1.24017302, 2.05291524, 2.52658791,
+        2.04645295, 34.07541626, 1.32670899, 1.03893757, 1.08957199, 5.55332328,
+        1.17276097, 1.60389480, 2.02098430, 2.92934928, 1.00558653, 1.05830070,
+        1.81440889, 3.85044779, 1.12317456, 1.39547640, 2.93105179, 1.95048788,
+        1.05602445, 1.96855429, 1.60432293, 3.28820202, 1.50117325, 1.19775674,
+        1.28280841, 1.08318646, 1.02098264, 1.24861938, 1.06511473, 1.07549717,
+        3.57739126, 1.07265409, 1.06312441, 1.16296512, 3.83654484, 2.02366951,
+        1.73168875, 1.60443228, 2.30779766, 1.50531775, 1.31925607, 1.87926179,
+        1.86249354, 2.14768716, 2.31583955, 2.15651148, 1.29677318, 1.10110071,
+        1.03383916, 1.50665009, 1.16502917, 1.40055008, 2.80847193, 1.29824634,
+        2.76239920, 1.73123621, 1.15286577, 1.89493526, 1.63112634, 1.17828846,
+        1.01293513, 1.84834048, 4.19026736, 1.82684815, 3.51812301, 1.33499862,
+        2.03087497, 1.32419883, 1.34126954, 1.98250684, 1.00025697, 1.59416883,
+        6.38249787, 2.79055559, 1.57750678, 1.36953983, 1.37513919, 3.63573178,
+        1.15637432, 9.28386344, 1.16947695, 1.54995742, 1.44018755, 1.29332881,
+        1.81274872, 1.14900153, 1.07117403, 1.17035915, 1.39229249, 1.96645872,
+        1.09147706, 1.25211993, 1.07092474, 1.85394206, 1.29807741, 3.41499510,
+        1.22444449, 1.00913782, 3.87431854, 1.01072376, 1.01186727, 3.00175639,
+        2.52183377, 1.23992099, 1.69819010, 1.36850400, 1.14577814, 1.06035078,
+        1.08414298, 1.55920217, 5.07059630, 1.15434572, 1.41873305, 1.24712256,
+        1.10478618, 1.30707247, 1.85719110, 1.89873207, 1.72629431, 1.65171651,
+        7.10864875, 2.31945709, 1.06722361, 1.26696259, 2.23845503, 1.38674196,
+        1.91015397, 1.29590323, 1.10448028, 4.52757499, 2.00258408, 1.38299092,
+        1.01431427, 1.54039270, 1.34880396, 1.08784083, 1.35553378, 1.37307373,
+        1.32320467, 1.50261683, 6.91050685, 1.06083157, 1.20841351, 2.92719840,
+        2.82178183, 2.05765813, 1.84621661, 1.04677388, 2.13801850, 1.39654855,
+        1.13037727, 1.37887598, 1.03221650, 1.15981176, 1.09896163, 1.88624084,
+        1.43459062, 1.54587662, 1.48604380, 2.06197392, 1.97079675, 4.31388672,
+        2.94376994, 3.48708489, 1.09674551, 2.46926816, 1.23705940, 1.57512843,
+        1.15595205, 1.18432818, 1.54298936, 1.60600489, 1.07361787, 1.38666771,
+        1.45533003, 1.78940830, 1.33799752, 1.12955889, 4.59400278, 1.15170228,
+        1.39346636, 1.61408789, 2.21293753, 5.33166143, 1.18147947, 1.54426891,
+        1.32496426, 1.25037632, 3.31244261, 1.36211171, 1.82239599, 1.75235087,
+        1.67044831, 1.24802350, 1.34776327, 1.34740665, 1.30664120, 1.06852680,
+        1.22513631, 1.25310923, 1.36394926, 1.07796356, 3.10823551, 1.46770227,
+        1.40264883, 1.08787681, 1.26460358, 1.10348946, 2.03168839, 1.09435135,
+        1.66991715, 1.19738540, 1.28922229, 2.85704149, 1.33952521, 1.73497688,
+        2.90052876, 5.34596348, 1.36399078, 3.38399264, 1.06089658, 1.09370142,
+        1.37523679, 3.01964907, 1.40684792, 1.11312672, 2.44666372, 1.73953904,
+        1.65569280, 1.05813000, 2.02893022, 1.72877601, 1.55758690, 1.83904301,
+        1.14316984, 1.17792251, 1.44106281, 9.67126482, 1.93207441, 1.08242887,
+        2.87271135, 2.19095115, 2.13195479, 1.02355472, 1.18218470, 1.30907724,
+        1.13291587, 2.85659336, 12.62726889, 1.18818589, 1.02852443, 1.12838670,
+        1.36349361, 1.34817100, 1.30535737, 3.22225028, 1.28680350, 1.83979657,
+        1.11088952, 1.43866586, 8.52587567, 3.73988696, 2.65816056, 1.17373111,
+        2.61567111, 3.24024082, 2.96798864, 1.05335616, 1.31159271, 1.36485918,
+        1.24988767, 7.80609746, 1.54892174, 1.10682809, 1.21728827, 1.20429971,
+        1.72719055, 1.78534831, 1.04414979, 1.25646988, 1.19788383, 1.08854812,
+        1.04859628, 1.04676064, 5.07295341, 3.83595341, 1.61079632, 1.10528426,
+        1.15050241, 2.78129736, 1.25494119, 1.28692155, 1.06812292, 3.29393761,
+        1.37542463, 1.67241953, 1.21698665, 10.57727604, 8.63598976, 1.18886984,
+        1.30609583, 9.47777457, 1.69612900, 2.23002585, 1.58461615, 1.04110023,
+        3.08140806, 1.39599251, 1.06575789, 1.29741002, 1.75253864, 1.82594258,
+        1.15111702, 1.17370053, 1.15254396, 1.94401179, 5.36344596, 4.66322185,
+        1.15073993, 3.21478159, 1.39843306, 1.03961906, 5.72845289, 1.72454161,
+        1.04610704, 1.38975310, 1.77732797, 1.10139931, 2.23656355, 1.89952669,
+        1.72136921, 1.15798212, 1.59545971, 1.08789161, 1.93272206, 2.57480708,
+        1.04977784, 2.00874078, 3.40065861, 1.00978603, 3.97804652, 1.54762586,
+        1.01015493, 1.15148220, 1.15246483, 19.67426012, 1.33290993, 2.33137522,
+        1.12841749, 1.73407057, 2.00469493, 1.27418995, 1.49814918, 1.10398785,
+        1.20063760, 1.05536150, 1.87616599, 1.49305736, 1.60241346, 1.16666060,
+        1.05013736, 1.77929210, 1.00206028, 3.41096863, 1.47499925, 1.14071240,
+        1.65361002, 1.76466424, 8.49298111, 1.41069285, 2.11681605, 4.90260842,
+        1.13029658, 1.20802818, 1.42525579, 1.00310774, 1.08082363, 9.95194247,
+        2.82773946, 2.77420002, 1.82543685, 1.28557906, 1.97711769, 1.19001264,
+        1.95712650, 1.54230291, 1.31625757, 2.36364128, 1.11523099, 1.00343756,
+        1.71299382, 1.44667100, 2.38154868, 1.41174217, 1.80660493, 1.51020853,
+        1.16761479, 1.25898190, 1.18150781, 1.58465451, 2.03560597, 3.48531184,
+        1.21187672, 1.35111036, 1.02954922, 1.90892663, 3.99078548, 5.67385199,
+        4.38055264, 1.17446048, 13.41617858, 1.60241740, 1.14811206, 4.68120263,
+        3.83763710, 2.66095263, 1.83338503, 4.75973082, 1.08982301, 4.04104276,
+        1.34220189, 1.06135891, 2.71185882, 1.46085873, 1.09915614, 10.35178646,
+        2.54402271, 2.65696704, 1.31388649, 1.02942408, 1.57780748, 1.01552697,
+        2.24860361, 2.22011778, 1.13595134, 1.11492512, 2.11966788, 1.20420149,
+        1.11112428, 3.09324603, 2.87240762, 1.50486558, 1.92227231, 4.12480449,
+        1.58244751, 1.69922308, 6.28134904, 2.91944178, 1.85386792, 1.41799519,
+        1.64636127, 2.05837832, 1.07153521, 2.05376943, 2.60053549, 1.09773382,
+        1.54671309, 1.68007415, 3.43941489, 1.41601033, 2.00237256, 1.20830978,
+        1.25582363, 1.10830461, 1.24850906, 1.88035202, 1.70557719, 1.04191110,
+        1.33501003, 1.33554804, 1.36935735, 4.79153510, 1.06566392, 1.14495966,
+        1.90020028, 1.08266994, 1.20588153, 1.40730214, 4.34320304, 1.71762330,
+        1.06620797, 1.39695239, 1.03024563, 3.94971225, 5.02945862, 1.06145571,
+        1.42511911, 2.13889169, 1.04986044, 1.91400616, 5.50708156, 1.52870464,
+        1.11303137, 1.05282759, 1.83793940, 3.05244089, 2.64499634, 1.51688076,
+        2.63350152, 1.31014486, 1.69462474, 1.67792130, 1.34236945, 1.02358460,
+        1.04593509, 1.04007620, 1.87990081, 1.28585413, 1.01636283, 3.55338495,
+        1.19542700, 1.23630628, 1.32321942, 4.03762786, 1.25379147, 1.12330233,
+        1.24966418, 1.26323243, 1.14779989, 1.20378343, 1.01531796, 1.44500318,
+        1.72723672, 15.68799957, 1.37641063, 7.00788166, 3.89674130, 1.68303382,
+        1.10089816, 1.72831362, 2.70479861, 1.75821836, 2.32404215, 2.64165162,
+        1.42441301, 1.83256456, 1.12548819, 4.81273800, 2.52840227, 2.68430190,
+        1.00928919, 1.02438446, 1.33909276, 2.32261242, 1.01299124, 1.07614975,
+        1.66823898, 1.97172786, 1.01707292, 1.68325092, 1.76834032, 1.08952069,
+        1.02265517, 1.96843176, 1.83351706, 1.92704772, 18.44811035, 1.00178046,
+        2.70555953, 1.35839004, 1.04834633, 1.26649072, 2.87152600, 4.12536409,
+        1.25200853, 1.71199647, 1.61175739, 1.26313274, 1.75224120, 2.70412800,
+        1.33998630, 1.61271556, 2.65784769, 10.38771107, 1.33121364, 1.01207979,
+        2.00238212, 2.50195600, 1.96917548, 1.71618169, 1.37050585, 10.11861690,
+        1.18339112, 1.80083386, 2.88582103, 1.21935761, 2.37900131, 1.49449487,
+        4.75106319, 2.33977804, 2.87963540, 1.01807103, 3.74847411, 1.71981276,
+        1.50726964, 1.20723219, 1.37904840, 1.04565533, 1.59877004, 1.11481349,
+        2.17320556, 2.07108468, 1.23274077, 1.75180110, 1.27558910, 1.63240839,
+        1.58760550, 1.01266256, 1.30395323, 1.14618521, 1.02385023, 2.24198100,
+        1.26765471, 1.15855534, 1.83936251, 1.32970987, 1.25844192, 1.31133485,
+        4.74300303, 6.19325623, 1.31832913, 3.97645560, 1.00545340, 1.24431862,
+        1.25855820, 1.15514241, 1.35986865, 1.72446070, 1.13069572, 2.45890932,
+        1.00394684, 1.03533631, 1.87698184, 2.34576160, 1.03997887, 1.02694456,
+        2.52227100, 2.66278467, 1.17002905, 3.42239624, 2.46753038, 1.17103623,
+        1.07832850, 1.42782632, 1.29110546, 1.03435772, 1.33512109, 1.14337058,
+        1.34103634, 1.15155161, 2.59805360, 2.09650343, 1.53399143, 1.02319185,
+        1.32210667, 1.05720671, 1.20882651, 2.34881662, 1.05163662, 3.26219380,
+        10.58124156, 1.07283644, 1.02105339, 1.23268679, 1.81469813, 1.49393533,
+        1.29760853, 5.37676625, 1.02529938, 1.86815537, 1.57961476, 3.77408176,
+        2.79405589, 3.25246617, 1.63913824, 3.12133428, 1.03787574, 4.17232960,
+        1.33406468, 1.57119541, 1.13675102, 3.42874720, 1.13066210, 1.33896458,
+        1.23883935, 1.35272696, 1.15172654, 2.18633755, 1.23251881, 1.59742606,
+        1.08718410, 1.06168544, 1.19926517, 1.00214807, 1.29121086, 3.44575916,
+        1.26524744, 1.16718301, 4.11789988, 1.25375574, 1.35753968, 1.69247751,
+        1.28473150, 2.20669768, 1.53213883, 2.30598771, 1.68420243, 1.37320685,
+        2.08619411, 1.26990265, 1.82215898, 1.10656122, 1.40229835, 1.11896817,
+        1.00127366, 2.88218857, 2.79105702, 1.28699225, 1.15929737, 1.07928363,
+        10.54130128, 8.79261793, 1.15699405, 1.69050500, 2.76586152, 1.22802809,
+        1.38014655, 2.19208585, 1.64409370, 1.46918371, 2.99582898, 1.37759923,
+        1.29776632, 1.82884215, 2.67317357, 1.37063041, 1.26884340, 1.07874723,
+        1.48172681, 1.01771849, 2.40642202, 1.37115433, 1.05954574, 2.12998246,
+        2.34178079, 1.54515623, 1.00179963, 2.12228030, 1.46007334, 1.20664530,
+        1.31417158, 1.03322353, 1.95420119, 1.30541569, 1.15016102, 2.17036908,
+        2.81707947, 1.16173181, 2.01742565, 1.02478594, 1.57428560, 1.21209176,
+        2.20735202, 1.12935761, 2.08850147, 1.05353378, 1.02324910, 1.49636415,
+        1.48061026, 2.25651770, 3.04296168, 1.24380806, 1.07707360, 2.00284318,
+        10.02810932, 3.38695326, 6.82841534, 2.13556915, 1.19152238};
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vector, data, <emphasis role="strong">sizeof</emphasis>(data) / <emphasis role="strong">sizeof</emphasis>(data[0]));
+
+  <emphasis>/* determining xmin and alpha */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, -1, 0))
+    <emphasis role="strong">return</emphasis> 1;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis>/* determining alpha only */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, 2, 0))
+    <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">test_discrete</emphasis>() {
+  <link linkend='igraph_plfit_result_t'>igraph_plfit_result_t</link> result;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vector;
+  double data[] = { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1,
+        2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 2, 5, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1,
+        1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1,
+        1, 1, 1, 1, 1, 1, 6, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 4, 1, 1, 1,
+        1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1,
+        1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1,
+        1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1,
+        1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 14, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2,
+        1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1,
+        1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 2, 5, 1, 1, 5, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 3, 1, 1,
+        2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1,
+        2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1,
+        1, 1, 2, 4, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2,
+        1, 1, 1, 1, 2, 11, 1, 33, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2,
+        2, 1, 1, 1, 2, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1,
+        1, 1, 2, 1, 2, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1,
+        3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1,
+        1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 2, 2, 2, 2, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
+        3, 2, 1, 1, 1, 2 };
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;vector, data, <emphasis role="strong">sizeof</emphasis>(data) / <emphasis role="strong">sizeof</emphasis>(data[0]));
+
+  <emphasis>/* determining xmin and alpha */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, -1, 0))
+    <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis>/* determining alpha only */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, 2, 0))
+    <emphasis role="strong">return</emphasis> 4;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis>/* forcing continuous fitting */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, -1, 1))
+    <emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis>/* forcing continuous fitting, xmin given */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_power_law_fit'>igraph_power_law_fit</link></emphasis>(&amp;vector, &amp;result, 2, 1))
+    <emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong">print_result</emphasis>(&amp;result);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int retval;
+
+  retval = <emphasis role="strong">test_continuous</emphasis>();
+  <emphasis role="strong">if</emphasis> (retval)
+    <emphasis role="strong">return</emphasis> retval;
+
+  retval = <emphasis role="strong">test_discrete</emphasis>();
+  <emphasis role="strong">if</emphasis> (retval)
+    <emphasis role="strong">return</emphasis> retval;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_preference_game.c.xml igraph-0.6.5/examples/simple/igraph_preference_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_preference_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_preference_game.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,132 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;assert.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> tdist;
+  igraph_matrix_t pmat;
+  igraph_bool_t conn;
+  igraph_vector_bool_t bs;
+  int i, ret;
+  
+  <emphasis>/* Symmetric preference game */</emphasis>
+  <emphasis role="strong">igraph_vector_bool_init</emphasis>(&amp;bs, 0);
+
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;tdist, 3, 1.0, 1.0, 1.0);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;pmat, 3, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;3; i++) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, i, i) = 0.2;
+
+  <emphasis>/* undirected, no loops */</emphasis>
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_preference_game'>igraph_preference_game</link></emphasis>(&amp;g, 1000, 3, &amp;tdist, <emphasis>/*fixed_sizes=*/</emphasis> 0,
+				      &amp;pmat, 0, 0, 0));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 1000) <emphasis role="strong">return</emphasis> 18;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 2;
+  <emphasis role="strong"><link linkend='igraph_is_connected'>igraph_is_connected</link></emphasis>(&amp;g, &amp;conn, IGRAPH_STRONG);
+  <emphasis role="strong">if</emphasis> (conn) <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 4;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 5;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;2; i++) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, i, i+1) = 0.1;
+
+  <emphasis>/* directed, no loops */</emphasis>
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_preference_game'>igraph_preference_game</link></emphasis>(&amp;g, 1000, 3, &amp;tdist, <emphasis>/*fixed_sizes=*/</emphasis>0, 
+				      &amp;pmat, 0, 1, 0));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 1000) <emphasis role="strong">return</emphasis> 17;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 6;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 7;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 8;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* undirected, loops */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;3; i++) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, i, i) = 1.0;
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_preference_game'>igraph_preference_game</link></emphasis>(&amp;g, 100, 3, &amp;tdist, <emphasis>/*fixed_sizes=*/</emphasis> 0,
+				      &amp;pmat, 0, 0, 1));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) <emphasis role="strong">return</emphasis> 16;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) &lt; 1395) <emphasis role="strong">return</emphasis> 20;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 9;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs) == 0) <emphasis role="strong">return</emphasis> 10;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 11;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* directed, loops */</emphasis>
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_preference_game'>igraph_preference_game</link></emphasis>(&amp;g, 100, 3, &amp;tdist, <emphasis>/*fixed_sizes=*/</emphasis> 0,
+				      &amp;pmat, 0, 1, 1));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) <emphasis role="strong">return</emphasis> 15;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) &lt; 2700) <emphasis role="strong">return</emphasis> 19;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 12;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs) == 0) <emphasis role="strong">return</emphasis> 13;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 14;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Asymmetric preference game */</emphasis>
+
+  <emphasis>/* directed, no loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;pmat, 2, 2);
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 0, 0) = 1; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 0, 1) = 1;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 1, 0) = 1; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 1, 1) = 1;
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_asymmetric_preference_game'>igraph_asymmetric_preference_game</link></emphasis>(&amp;g, 100, 2, 0, &amp;pmat, 0, 0, 0));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) <emphasis role="strong">return</emphasis> 21;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 9900) <emphasis role="strong">return</emphasis> 22;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 23;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 24;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 25;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* directed, loops */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;pmat, 2, 2);
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 0, 0) = 1; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 0, 1) = 1;
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 1, 0) = 1; <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(pmat, 1, 1) = 1;
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_asymmetric_preference_game'>igraph_asymmetric_preference_game</link></emphasis>(&amp;g, 100, 2, 0, &amp;pmat, 0, 0, 1));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 100) <emphasis role="strong">return</emphasis> 26;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 10000) <emphasis role="strong">return</emphasis> 27;
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) <emphasis role="strong">return</emphasis> 28;
+  <emphasis role="strong"><link linkend='igraph_is_loop'>igraph_is_loop</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs) != 100) <emphasis role="strong">return</emphasis> 29;
+  <emphasis role="strong"><link linkend='igraph_is_multiple'>igraph_is_multiple</link></emphasis>(&amp;g, &amp;bs, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_ID));
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_bool_sum</emphasis>(&amp;bs)) <emphasis role="strong">return</emphasis> 30;
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;tdist);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;pmat);
+  <emphasis role="strong">igraph_vector_bool_destroy</emphasis>(&amp;bs);
+
+  <emphasis role="strong">assert</emphasis>(IGRAPH_FINALLY_STACK_EMPTY);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_psumtree.c.xml igraph-0.6.5/examples/simple/igraph_psumtree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_psumtree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_psumtree.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,198 @@
+<programlisting linenumbering="numbered">
+<emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_psumtree.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_psumtree_t tree;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vec;
+  long int i;
+  igraph_real_t sum;
+
+  <emphasis>/* Uniform random numbers */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, 16);
+  <emphasis role="strong">igraph_psumtree_init</emphasis>(&amp;tree, 16);
+  sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree);
+  <emphasis role="strong">if</emphasis> (sum != 0) {
+    <emphasis role="strong">printf</emphasis>("Sum: %f instead of 0.\n", sum);
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;16; i++) {
+    <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, i, 1);
+  }
+  <emphasis role="strong">if</emphasis> ((sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree)) != 16) {
+    <emphasis role="strong">printf</emphasis>("Sum: %f instead of 16.\n", sum);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;16000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;16; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 1200) {
+      <emphasis role="strong">return</emphasis> 3;
+    }
+  }
+
+  <emphasis>/* Nonuniform, even indices have twice as much chance */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;16; i+=2) {
+    <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, i, 2);
+  }
+  <emphasis role="strong">if</emphasis> ((sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree)) != 24) {
+    <emphasis role="strong">printf</emphasis>("Sum: %f instead of 24.\n", sum);
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;vec);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;24000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;16; i++) {
+    <emphasis role="strong">if</emphasis> (i%2 == 0 &amp;&amp; (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 1800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 2200)) {
+      <emphasis role="strong">return</emphasis> 5;
+    }
+    <emphasis role="strong">if</emphasis> (i%2 != 0 &amp;&amp; (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 1200)) {
+      <emphasis role="strong">return</emphasis> 6;
+    }
+  }
+  
+  <emphasis>/* Test zero probabilities */</emphasis>
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 0, 0);
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 5, 0);
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 15, 0);
+  sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;vec);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;20000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[0] != 0 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[5] != 0 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[15] != 0) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">igraph_psumtree_destroy</emphasis>(&amp;tree);
+
+  <emphasis>/****************************************************/</emphasis>
+  <emphasis>/* Non power-of-two vector size                     */</emphasis>
+  <emphasis>/****************************************************/</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vec, 9);
+  <emphasis role="strong">igraph_psumtree_init</emphasis>(&amp;tree, 9);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9; i++) {
+    <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, i, 1);
+  }
+  sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 1200) {
+      <emphasis role="strong">return</emphasis> 8;
+    }
+  }
+
+  <emphasis>/* Nonuniform, even indices have twice as much chance */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9; i+=2) {
+    <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, i, 2);
+  }
+  sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;vec);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;14000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9; i++) {
+    <emphasis role="strong">if</emphasis> (i%2 == 0 &amp;&amp; (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 1800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 2200)) {
+      <emphasis role="strong">return</emphasis> 9;
+    }
+    <emphasis role="strong">if</emphasis> (i%2 != 0 &amp;&amp; (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &lt; 800 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[i] &gt; 1200)) {
+      <emphasis role="strong">return</emphasis> 10;
+    }
+  }
+
+  <emphasis>/* Test query */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_psumtree_size</emphasis>(&amp;tree); i++) {
+    <emphasis role="strong">if</emphasis> (i%2==0 &amp;&amp; <emphasis role="strong">igraph_psumtree_get</emphasis>(&amp;tree, i) != 2) {
+      <emphasis role="strong">return</emphasis> 11;
+    }
+    <emphasis role="strong">if</emphasis> (i%2!=0 &amp;&amp; <emphasis role="strong">igraph_psumtree_get</emphasis>(&amp;tree, i) != 1) {
+      <emphasis role="strong">return</emphasis> 12;
+    }
+  }
+  
+  <emphasis>/* Test zero probabilities */</emphasis>
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 0, 0);
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 5, 0);
+  <emphasis role="strong">igraph_psumtree_update</emphasis>(&amp;tree, 8, 0);
+  sum=<emphasis role="strong">igraph_psumtree_sum</emphasis>(&amp;tree);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;vec);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;9000; i++) {
+    igraph_real_t r=((double)<emphasis role="strong">rand</emphasis>())/RAND_MAX * sum;
+    long int idx;
+    <emphasis role="strong">igraph_psumtree_search</emphasis>(&amp;tree, &amp;idx, r);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[idx] += 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[0] != 0 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[5] != 0 || <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vec)[8] != 0) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vec);
+  <emphasis role="strong">igraph_psumtree_destroy</emphasis>(&amp;tree);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 13;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_qsort.c.xml igraph-0.6.5/examples/simple/igraph_qsort.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_qsort.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_qsort.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,59 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge, MA 02139, USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">comp</emphasis>(<emphasis role="strong">const</emphasis> void *a, <emphasis role="strong">const</emphasis> void *b) {
+  igraph_real_t *aa=(igraph_real_t *) a;
+  igraph_real_t *bb=(igraph_real_t *) b;
+  
+  <emphasis role="strong">if</emphasis> (*aa &lt; *bb) { 
+    <emphasis role="strong">return</emphasis> -1;
+  } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (*aa &gt; *bb) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {  
+  <emphasis role="strong">const</emphasis> int len=100;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  int i;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, len);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;len; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] = i;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong">igraph_qsort</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v), <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v), <emphasis role="strong">sizeof</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]), comp);
+  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_qsort_r.c.xml igraph-0.6.5/examples/simple/igraph_qsort_r.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_qsort_r.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_qsort_r.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,68 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge, MA 02139, USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">comp</emphasis>(void *extra, <emphasis role="strong">const</emphasis> void *a, <emphasis role="strong">const</emphasis> void *b) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *v=(<link linkend='igraph_vector_t'>igraph_vector_t</link>*) extra;
+  int *aa=(int*) a;
+  int *bb=(int*) b;
+  igraph_real_t aaa=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[*aa];
+  igraph_real_t bbb=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[*bb];
+  
+  <emphasis role="strong">if</emphasis> (aaa &lt; bbb) { 
+    <emphasis role="strong">return</emphasis> -1;
+  } <emphasis role="strong">else</emphasis> <emphasis role="strong">if</emphasis> (aaa &gt; bbb) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  <emphasis role="strong">const</emphasis> int len=100;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_vector_int_t idx;
+  int i;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, len);
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;idx, len);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;len; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] = i;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(idx)[i] = i;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_shuffle'>igraph_vector_shuffle</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">igraph_qsort_r</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(idx), len, <emphasis role="strong">sizeof</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(idx)[0]), (void*) &amp;v, comp);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;len; i++) { 
+    <emphasis role="strong">printf</emphasis>("%g ", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[ <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(idx)[i] ]);
+  }
+  
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;idx);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_radius.c.xml igraph-0.6.5/examples/simple/igraph_radius.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_radius.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_radius.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,49 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sts=2 sw=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_real_t radius;
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_UNDIRECTED, 0);
+  <emphasis role="strong"><link linkend='igraph_radius'>igraph_radius</link></emphasis>(&amp;g, &amp;radius, IGRAPH_OUT);
+  <emphasis role="strong">if</emphasis> (radius != 1) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+  <emphasis role="strong"><link linkend='igraph_radius'>igraph_radius</link></emphasis>(&amp;g, &amp;radius, IGRAPH_ALL);
+  <emphasis role="strong">if</emphasis> (radius != 1) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;g, 10, IGRAPH_STAR_OUT, 0);
+  <emphasis role="strong"><link linkend='igraph_radius'>igraph_radius</link></emphasis>(&amp;g, &amp;radius, IGRAPH_OUT);
+  <emphasis role="strong">if</emphasis> (radius != 0) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_random_sample.c.xml igraph-0.6.5/examples/simple/igraph_random_sample.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_random_sample.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_random_sample.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,225 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for random sampling.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;assert.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">R_INTEGER</emphasis>(a,b) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), (a), (b)))
+
+<emphasis>/* test parameters */</emphasis>
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  igraph_integer_t low;
+  igraph_integer_t high;
+  igraph_integer_t length;
+  int retval;
+} sampling_test_t;
+
+<emphasis>/* Error tests. Don't be afraid to crash the library function.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_test</emphasis>() {
+  <emphasis role="strong">const</emphasis> igraph_integer_t min = -1000;
+  <emphasis role="strong">const</emphasis> igraph_integer_t max = 1000;
+  igraph_integer_t low;       <emphasis>/* lower limit */</emphasis>
+  igraph_integer_t high;      <emphasis>/* upper limit */</emphasis>
+  igraph_integer_t length;    <emphasis>/* sample size */</emphasis>
+  igraph_integer_t poolsize;  <emphasis>/* size of candidate pool */</emphasis>
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> V;
+  int i, n, ret;
+  sampling_test_t *test;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;V, <emphasis>/*size*/</emphasis> 0);
+
+  <emphasis>/* test parameters */</emphasis>
+  <emphasis>/*----------low----high----length----retval----------*/</emphasis>
+  <emphasis>/* lower limit is greater than upper limit */</emphasis>
+  <emphasis role="strong">do</emphasis> {
+    high = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (high == max);
+  <emphasis role="strong">do</emphasis> {
+    low = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (low &lt;= high);
+  <emphasis role="strong">assert</emphasis>(low &gt; high);
+  length = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  sampling_test_t lower_bigger = {low, high, length, IGRAPH_EINVAL};
+  <emphasis>/* sample size is greater than size of candidate pool */</emphasis>
+  <emphasis role="strong">do</emphasis> {
+    high = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (high == min);
+  <emphasis role="strong">do</emphasis> {
+    low = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (low &gt;= high);
+  <emphasis role="strong">assert</emphasis>(low &lt; high);
+  poolsize = (igraph_integer_t)<emphasis role="strong">fabs</emphasis>((double)high - (double)low);
+  length = poolsize * poolsize;
+  sampling_test_t sample_size_bigger = {low, high, length, IGRAPH_EINVAL};
+
+  sampling_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;lower_bigger,
+                                   <emphasis>/* 2 */</emphasis> &amp;sample_size_bigger};
+
+  <emphasis>/* failure is the mother of success */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  n = 2;
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    test = all_checks[i];
+    ret = <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, test-&gt;low, test-&gt;high, test-&gt;length);
+    <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+      <emphasis role="strong">printf</emphasis>("Error test no. %d failed.\n", (int)(i + 1));
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_abort'>igraph_error_handler_abort</link>);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;V);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* Get a few random samples and test their properties.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">random_sample_test</emphasis>() {
+  <emphasis role="strong">const</emphasis> igraph_integer_t min = -1000;
+  <emphasis role="strong">const</emphasis> igraph_integer_t max = 1000;
+  igraph_integer_t low;       <emphasis>/* lower limit */</emphasis>
+  igraph_integer_t high;      <emphasis>/* upper limit */</emphasis>
+  igraph_integer_t length;    <emphasis>/* sample size */</emphasis>
+  igraph_integer_t poolsize;  <emphasis>/* size of candidate pool */</emphasis>
+  igraph_real_t sP;           <emphasis>/* population total sum */</emphasis>
+  igraph_real_t ss;           <emphasis>/* sample total sum */</emphasis>
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> V;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+
+  <emphasis>/* The generated sequence of numbers must be in increasing order. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;V, <emphasis>/*size*/</emphasis> 0);
+  <emphasis role="strong">do</emphasis> {
+    high = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (high == min);
+  <emphasis role="strong">do</emphasis> {
+    low = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(min, max);
+  } <emphasis role="strong">while</emphasis> (low &gt;= high);
+  poolsize = (igraph_integer_t)<emphasis role="strong">fabs</emphasis>((double)high - (double)low);
+  <emphasis role="strong">do</emphasis> {
+    length = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(1, max);
+  } <emphasis role="strong">while</emphasis> (length &gt; poolsize);
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, low, high, length);
+  <emphasis role="strong">if</emphasis> (length != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V)) {
+    <emphasis role="strong">printf</emphasis>("Requested vector length and resulting length mismatch.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; length - 1; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[i] &gt;= <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[i+1]) {
+      <emphasis role="strong">printf</emphasis>("Sample not in increasing order.\n");
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;V);
+
+  <emphasis>/* Let P be a candidate pool of positive integers with total sum s_P. */</emphasis>
+  <emphasis>/* Let S be a random sample from P and having total sum s_S. Then we */</emphasis>
+  <emphasis>/* have the bound s_s &lt;= s_P. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;V, <emphasis>/*size*/</emphasis> 0);
+  low = 1;
+  <emphasis role="strong">do</emphasis> {
+    high = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(low, max);
+  } <emphasis role="strong">while</emphasis> (high == low);
+  poolsize = (igraph_integer_t)<emphasis role="strong">fabs</emphasis>((double)high - (double)low);
+  <emphasis role="strong">do</emphasis> {
+    length = (igraph_integer_t)<emphasis role="strong">R_INTEGER</emphasis>(low, max);
+  } <emphasis role="strong">while</emphasis> (length &gt; poolsize);
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, low, high, length);
+  <emphasis>/* Use Gauss' formula to sum all consecutive positive integers from 1 */</emphasis>
+  <emphasis>/* up to and including an upper limit. In LaTeX, Gauss' formula is */</emphasis>
+  <emphasis>/* \sum_{i=1}^n i = \frac{n(n+1)}{2} where n is the upper limit. */</emphasis>
+  sP = (high * (high + 1)) / 2;
+  ss = <emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;V);
+  <emphasis role="strong">if</emphasis> (ss &gt; sP) {
+    <emphasis role="strong">printf</emphasis>("Sum of sampled sequence exceeds sum of whole population.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;V);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">equal_test</emphasis>() {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> V;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;V, 0);
+
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, 0, 0, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V) != 1) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[0] != 0) { <emphasis role="strong">return</emphasis> 2; }
+
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, 10, 10, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V) != 1) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[0] != 10) { <emphasis role="strong">return</emphasis> 4; }
+  
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, 2, 12, 11);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V) != 11) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 11; i++)
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[i] != i+2) { <emphasis role="strong">return</emphasis> 6; }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">rare_test</emphasis>() {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> V;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;V, 0);
+
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, 0, 0, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V) != 1) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[0] != 0) { <emphasis role="strong">return</emphasis> 2; }
+
+  <emphasis role="strong"><link linkend='igraph_random_sample'>igraph_random_sample</link></emphasis>(&amp;V, 10, 10, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;V) != 1) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(V)[0] != 10) { <emphasis role="strong">return</emphasis> 4; }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 1;
+  ret = <emphasis role="strong">random_sample_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 2;
+  ret = <emphasis role="strong">equal_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 3;
+  ret = <emphasis role="strong">rare_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 4;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_dl.c.xml igraph-0.6.5/examples/simple/igraph_read_graph_dl.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_dl.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_read_graph_dl.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,62 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis role="strong">const</emphasis> char *files[] = { "fullmatrix1.dl", "fullmatrix2.dl", 
+			  "fullmatrix3.dl", "fullmatrix4.dl",
+			  "edgelist1.dl", "edgelist2.dl", "edgelist3.dl",
+			  "edgelist4.dl", "edgelist5.dl", "edgelist6.dl",
+			  "nodelist1.dl", "nodelist2.dl" };
+  int no_files=<emphasis role="strong">sizeof</emphasis>(files)/<emphasis role="strong">sizeof</emphasis>(<emphasis role="strong">const</emphasis> char*);
+  int i, ret;
+  igraph_t g;
+  FILE *infile;
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;no_files; i++) {
+    <emphasis role="strong">printf</emphasis>("Doing %s\n", files[i]);
+    infile=<emphasis role="strong">fopen</emphasis>(files[i], "r");
+    <emphasis role="strong">if</emphasis> (!infile) {
+      <emphasis role="strong">printf</emphasis>("Cannot open file: %s\n", files[i]);
+      <emphasis role="strong">exit</emphasis>(1+i);
+    }
+    <emphasis role="strong"><link linkend='igraph_read_graph_dl'>igraph_read_graph_dl</link></emphasis>(&amp;g, infile, <emphasis>/*directed=*/</emphasis> 1);
+    ret=<emphasis role="strong">fclose</emphasis>(infile);
+    <emphasis role="strong">if</emphasis> (ret) {
+      <emphasis role="strong">printf</emphasis>("Cannot close file: %s\n", files[i]);
+      <emphasis role="strong">exit</emphasis>(11+i);
+    }
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0)
+    <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_graphdb.c.xml igraph-0.6.5/examples/simple/igraph_read_graph_graphdb.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_graphdb.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_read_graph_graphdb.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,42 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  FILE *input;
+  
+  input=<emphasis role="strong">fopen</emphasis>("iso_b03_m1000.A00", "rb");
+  <emphasis role="strong">if</emphasis> (!input) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_graphdb'>igraph_read_graph_graphdb</link></emphasis>(&amp;g, input, IGRAPH_DIRECTED);
+  <emphasis role="strong">fclose</emphasis>(input);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_lgl.c.xml igraph-0.6.5/examples/simple/igraph_read_graph_lgl.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_read_graph_lgl.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_read_graph_lgl.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,81 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph R package.</emphasis>
+<emphasis>   Copyright (C) 2005-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  FILE *input;
+
+  <emphasis>/* Without names and weights */</emphasis>
+  input=<emphasis role="strong">fopen</emphasis>("igraph_read_graph_lgl-1.lgl", "r");
+  <emphasis role="strong">if</emphasis> (!input) { 
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_lgl'>igraph_read_graph_lgl</link></emphasis>(&amp;g, input, 0, IGRAPH_ADD_WEIGHTS_NO, 1);
+  <emphasis role="strong">fclose</emphasis>(input);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* With names and weights */</emphasis>
+  input=<emphasis role="strong">fopen</emphasis>("igraph_read_graph_lgl-2.lgl", "r");
+  <emphasis role="strong">if</emphasis> (!input) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_lgl'>igraph_read_graph_lgl</link></emphasis>(&amp;g, input, 0, IGRAPH_ADD_WEIGHTS_NO, 1);
+  <emphasis role="strong">fclose</emphasis>(input);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_write_graph_ncol'>igraph_write_graph_ncol</link></emphasis>(&amp;g, stdout, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Same graph, but forcing undirected mode */</emphasis>
+  input=<emphasis role="strong">fopen</emphasis>("igraph_read_graph_lgl-2.lgl", "r");
+  <emphasis role="strong"><link linkend='igraph_read_graph_lgl'>igraph_read_graph_lgl</link></emphasis>(&amp;g, input, 0, IGRAPH_ADD_WEIGHTS_NO, 0);
+  <emphasis role="strong">fclose</emphasis>(input);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_write_graph_ncol'>igraph_write_graph_ncol</link></emphasis>(&amp;g, stdout, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Erroneous LGL file (empty vertex name) */</emphasis>
+  input=<emphasis role="strong">fopen</emphasis>("igraph_read_graph_lgl-3.lgl", "r");
+  <emphasis role="strong">if</emphasis> (!input) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_read_graph_lgl'>igraph_read_graph_lgl</link></emphasis>(&amp;g, input, 0, IGRAPH_ADD_WEIGHTS_NO, 1) !=
+		  IGRAPH_PARSEERROR) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">fclose</emphasis>(input);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_reciprocity.c.xml igraph-0.6.5/examples/simple/igraph_reciprocity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_reciprocity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_reciprocity.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,66 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;math.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_real_t res;
+
+  <emphasis>/* Trivial cases */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 100, IGRAPH_UNDIRECTED, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_reciprocity'>igraph_reciprocity</link></emphasis>(&amp;g, &amp;res, 0, IGRAPH_RECIPROCITY_DEFAULT);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (res != 1) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* Small test graph */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 
+	       0,  1,  0,  2,  0,  3,  1,  0,  2,  3,  3,  2, -1);
+  
+  <emphasis role="strong"><link linkend='igraph_reciprocity'>igraph_reciprocity</link></emphasis>(&amp;g, &amp;res, 0, IGRAPH_RECIPROCITY_RATIO);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (res != 0.5) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "%f != %f\n", res, 0.5);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1,1,2,2,1, -1);
+  <emphasis role="strong"><link linkend='igraph_reciprocity'>igraph_reciprocity</link></emphasis>(&amp;g, &amp;res, 0, IGRAPH_RECIPROCITY_DEFAULT);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(res - 2.0/3.0) &gt; 1e-15) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "%f != %f\n", res, 2.0/3.0);
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_rewire.c.xml igraph-0.6.5/examples/simple/igraph_rewire.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_rewire.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_rewire.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,54 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_integer_t result;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges, res;
+  igraph_vs_t vids;
+  long i, n;
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, 3, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_rewire'>igraph_rewire</link></emphasis>(&amp;g, 1000, IGRAPH_REWIRING_SIMPLE);
+  
+  n=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++)
+    <emphasis role="strong">printf</emphasis>("%ld ", (long)<emphasis role="strong"><link linkend='igraph_vector_e'>igraph_vector_e</link></emphasis>(&amp;res, i));
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g, &amp;res, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++)
+    <emphasis role="strong">printf</emphasis>("%ld ", (long)<emphasis role="strong"><link linkend='igraph_vector_e'>igraph_vector_e</link></emphasis>(&amp;res, i));
+  <emphasis role="strong">printf</emphasis>("\n");
+    
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_ring.c.xml igraph-0.6.5/examples/simple/igraph_ring.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_ring.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_ring.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,170 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+
+<emphasis>   Ring test suite</emphasis>
+<emphasis>   Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  int n, m;
+  igraph_bool_t directed, mutual, circular;
+  igraph_real_t *edges;
+} ring_test_t;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">RING_TEST</emphasis>(id, n, m, di, mu, ci, ...) \
+  igraph_real_t ring_ ## id ## _edges[] = { __VA_ARGS__ };		\
+  ring_test_t ring_ ## id = { n, m, di, mu, ci, ring_ ## id ## _edges }
+
+<emphasis>/*---------------n--m--di-mu-ci--edges-------------------------------------*/</emphasis>
+<emphasis role="strong">RING_TEST</emphasis>(uc_6,  6, 6, 0, 0, 1,  0,1, 1,2, 2,3, 3,4, 4,5, 5,0 );
+<emphasis role="strong">RING_TEST</emphasis>(uc_0,  0, 0, 0, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(uc_1,  1, 0, 0, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(uc_2,  2, 1, 0, 0, 1,  0,1 );
+
+<emphasis role="strong">RING_TEST</emphasis>(u_6,   6, 5, 0, 0, 0,  0,1, 1,2, 2,3, 3,4, 4,5 );
+<emphasis role="strong">RING_TEST</emphasis>(u_0,   0, 0, 0, 0, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(u_1,   1, 0, 0, 0, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(u_2,   2, 1, 0, 0, 0,  0,1 );
+
+<emphasis role="strong">RING_TEST</emphasis>(umc_6, 6, 6, 0, 1, 1,  0,1, 1,2, 2,3, 3,4, 4,5, 5,0 );
+<emphasis role="strong">RING_TEST</emphasis>(umc_0, 0, 0, 0, 1, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(umc_1, 1, 0, 0, 1, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(umc_2, 2, 1, 0, 1, 1,  0,1 );
+
+<emphasis role="strong">RING_TEST</emphasis>(um_6,  6, 5, 0, 1, 0,  0,1, 1,2, 2,3, 3,4, 4,5 );
+<emphasis role="strong">RING_TEST</emphasis>(um_0,  0, 0, 0, 1, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(um_1,  1, 0, 0, 1, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(um_2,  2, 1, 0, 1, 0,  0,1 );
+
+<emphasis role="strong">RING_TEST</emphasis>(dc_6,  6, 6, 1, 0, 1,  0,1, 1,2, 2,3, 3,4, 4,5, 5,0 );
+<emphasis role="strong">RING_TEST</emphasis>(dc_0,  0, 0, 1, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dc_1,  1, 0, 1, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dc_2,  2, 2, 1, 0, 1,  0,1, 1,0 );
+
+<emphasis role="strong">RING_TEST</emphasis>(d_6,   6, 5, 1, 0, 1,  0,1, 1,2, 2,3, 3,4, 4,5 );
+<emphasis role="strong">RING_TEST</emphasis>(d_0,   0, 0, 1, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(d_1,   1, 0, 1, 0, 1,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(d_2,   2, 1, 1, 0, 1,  0,1 );
+
+<emphasis role="strong">RING_TEST</emphasis>(dmc_6,  6,12, 1, 1, 1, 0,1, 1,2, 2,3, 3,4, 4,5, 5,0,
+                                 1,0, 2,1, 3,2, 4,3, 5,4, 0,5 );
+<emphasis role="strong">RING_TEST</emphasis>(dmc_0,  0, 0, 1, 1, 1, -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dmc_1,  1, 0, 1, 1, 1, -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dmc_2,  2, 2, 1, 1, 1, 0,1, 1,0 );
+
+<emphasis role="strong">RING_TEST</emphasis>(dm_6,  6,10, 1, 1, 0,  0,1, 1,2, 2,3, 3,4, 4,5,
+                                 1,0, 2,1, 3,2, 4,3, 5,4 );
+<emphasis role="strong">RING_TEST</emphasis>(dm_0,  0, 0, 1, 1, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dm_1,  1, 0, 1, 1, 0,  -1 );
+<emphasis role="strong">RING_TEST</emphasis>(dm_2,  2, 2, 1, 1, 0,  0,1, 1,0 );
+<emphasis>/*---------------n--m--di-mu-ci--edges-------------------------------------*/</emphasis>
+
+ring_test_t *all_checks[] = { <emphasis>/*  1 */</emphasis> &amp;ring_uc_6,   <emphasis>/*  2 */</emphasis> &amp;ring_uc_0,
+			      <emphasis>/*  3 */</emphasis> &amp;ring_uc_1,   <emphasis>/*  4 */</emphasis> &amp;ring_uc_2,
+			      <emphasis>/*  5 */</emphasis> &amp;ring_u_6,    <emphasis>/*  6 */</emphasis> &amp;ring_u_0,
+			      <emphasis>/*  7 */</emphasis> &amp;ring_u_1,    <emphasis>/*  8 */</emphasis> &amp;ring_u_2,
+			      <emphasis>/*  9 */</emphasis> &amp;ring_umc_6,  <emphasis>/* 10 */</emphasis> &amp;ring_umc_0,
+			      <emphasis>/* 11 */</emphasis> &amp;ring_umc_1,  <emphasis>/* 12 */</emphasis> &amp;ring_umc_2,
+			      <emphasis>/* 13 */</emphasis> &amp;ring_um_6,   <emphasis>/* 14 */</emphasis> &amp;ring_um_0,
+			      <emphasis>/* 15 */</emphasis> &amp;ring_um_1,   <emphasis>/* 16 */</emphasis> &amp;ring_um_2,
+			      <emphasis>/* 17 */</emphasis> &amp;ring_dc_6,   <emphasis>/* 18 */</emphasis> &amp;ring_dc_0,
+			      <emphasis>/* 19 */</emphasis> &amp;ring_dc_1,   <emphasis>/* 20 */</emphasis> &amp;ring_dc_2,
+			      <emphasis>/* 21 */</emphasis> &amp;ring_dmc_6,  <emphasis>/* 22 */</emphasis> &amp;ring_dmc_0,
+			      <emphasis>/* 23 */</emphasis> &amp;ring_dmc_1,  <emphasis>/* 24 */</emphasis> &amp;ring_dmc_2,
+			      <emphasis>/* 25 */</emphasis> &amp;ring_dm_6,   <emphasis>/* 26 */</emphasis> &amp;ring_dm_0,
+			      <emphasis>/* 27 */</emphasis> &amp;ring_dm_1,   <emphasis>/* 28 */</emphasis> &amp;ring_dm_2,
+			      0 };
+
+int <emphasis role="strong">check_ring_properties</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *ring, igraph_bool_t directed,
+			  igraph_bool_t mutual, igraph_bool_t circular) {
+
+  igraph_bool_t res;
+
+  <emphasis>/* Connected */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_connected'>igraph_is_connected</link></emphasis>(ring, &amp;res, IGRAPH_WEAK); 
+  <emphasis role="strong">if</emphasis> (!res) {
+    <emphasis role="strong">printf</emphasis>("Not connected\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* Simple */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(ring, &amp;res); 
+  <emphasis role="strong">if</emphasis> (!res) {
+    <emphasis role="strong">printf</emphasis>("Not simple\n");
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis>/* Girth, for big enough circular graphs */</emphasis>
+  <emphasis role="strong">if</emphasis> (circular &amp;&amp; <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(ring) &gt; 2) { 
+    igraph_integer_t girth;
+    <emphasis role="strong"><link linkend='igraph_girth'>igraph_girth</link></emphasis>(ring, &amp;girth, NULL);
+    <emphasis role="strong">if</emphasis> (girth != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(ring)) { 
+      <emphasis role="strong">printf</emphasis>("Wrong girth\n");
+      <emphasis role="strong">return</emphasis> 3; 
+    }
+  }
+   
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">check_ring</emphasis>(<emphasis role="strong">const</emphasis> ring_test_t *test) {
+  igraph_t graph, othergraph;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> otheredges;
+  igraph_bool_t iso;
+  int ret;
+
+  <emphasis>/* Create ring */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;graph, test-&gt;n, test-&gt;directed, test-&gt;mutual, test-&gt;circular);
+
+  <emphasis>/* Check its properties */</emphasis>
+  <emphasis role="strong">if</emphasis> ((ret=<emphasis role="strong">check_ring_properties</emphasis>(&amp;graph, test-&gt;directed, test-&gt;mutual, 
+				 test-&gt;circular))) { <emphasis role="strong">return</emphasis> ret;}
+
+  <emphasis>/* Check that it is isomorphic to the stored graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;otheredges, test-&gt;edges, test-&gt;m * 2);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;othergraph, &amp;otheredges, test-&gt;n, test-&gt;directed);
+  <emphasis role="strong"><link linkend='igraph_isomorphic'>igraph_isomorphic</link></emphasis>(&amp;graph, &amp;othergraph, &amp;iso);
+  <emphasis role="strong">if</emphasis> (!iso) { <emphasis role="strong">return</emphasis> 50; }
+
+  <emphasis>/* Clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;graph);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;othergraph);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int i, ret;
+
+  i=0;
+  <emphasis role="strong">while</emphasis> (all_checks[i]) {
+    <emphasis role="strong">if</emphasis> ((ret=<emphasis role="strong">check_ring</emphasis>(all_checks[i]))) { 
+      <emphasis role="strong">printf</emphasis>("Check no #%d failed.\n", (int) (i+1));
+      <emphasis role="strong">return</emphasis> ret;
+    }
+    i++;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_rng_get_exp.c.xml igraph-0.6.5/examples/simple/igraph_rng_get_exp.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_rng_get_exp.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_rng_get_exp.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,37 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge, MA, 02138 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;1000; i++) {
+    <emphasis role="strong">printf</emphasis>("%g\n", <emphasis role="strong">igraph_rng_get_exp</emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 2.5));
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_roulette_wheel_imitation.c.xml igraph-0.6.5/examples/simple/igraph_roulette_wheel_imitation.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_roulette_wheel_imitation.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_roulette_wheel_imitation.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,281 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for stochastic imitation via roulette wheel selection.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;time.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">R_INTEGER</emphasis>(a,b) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), (a), (b)))
+
+<emphasis>/* test parameters structure */</emphasis>
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  igraph_t *graph;
+  igraph_integer_t vertex;
+  igraph_bool_t islocal;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *quantities;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *strategies;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *known_strats;
+  igraph_neimode_t mode;
+  int retval;
+} strategy_test_t;
+
+<emphasis>/* Error tests. That is, we expect error codes to be returned from such tests.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_tests</emphasis>() {
+  igraph_t g, gzero, h;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, quantzero, strat, stratzero;
+  int i, n, nvert, ret;
+  strategy_test_t *test;
+
+  <emphasis>/* nonempty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;h, 0, 0);         <emphasis>/* empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quant, 1);  <emphasis>/* quantities vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;strat, 2);  <emphasis>/* strategies vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;gzero, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED,
+               0,3, 0,4, 1,2, 1,4, 1,5, 2,3, 2,4, 3,4, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;gzero);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;stratzero, nvert, 1.0, 0.0, 1.0, 2.0, 0.0, 3.0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quantzero, nvert);  <emphasis>/* vector of zeros */</emphasis>
+
+  <emphasis>/* test parameters */</emphasis>
+  <emphasis>/*graph--vert--islocal--quantities--strategies--known_strats--mode--retval*/</emphasis>
+  <emphasis>/* null pointer for graph */</emphasis>
+  strategy_test_t null_graph = {NULL, 0, 1, NULL, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for quantities vector */</emphasis>
+  strategy_test_t null_quant = {&amp;g, 0, 1, NULL, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for strategies vector */</emphasis>
+  strategy_test_t null_strat = {&amp;g, 0, 1, &amp;quant, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* empty graph */</emphasis>
+  strategy_test_t empty_graph = {&amp;h, 0, 1, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of quantities vector different from number of vertices */</emphasis>
+  strategy_test_t qdiff_length = {&amp;g, 0, 1, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of strategies vector different from number of vertices */</emphasis>
+  strategy_test_t sdiff_length = {&amp;g, 0, 1, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* quantities vector contains all zeros */</emphasis>
+  strategy_test_t zero_quant = {&amp;gzero, 4, 1, &amp;quantzero, &amp;stratzero, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;null_graph,
+                                   <emphasis>/* 2 */</emphasis> &amp;null_quant,
+                                   <emphasis>/* 3 */</emphasis> &amp;null_strat,
+                                   <emphasis>/* 4 */</emphasis> &amp;empty_graph,
+                                   <emphasis>/* 5 */</emphasis> &amp;qdiff_length,
+                                   <emphasis>/* 6 */</emphasis> &amp;sdiff_length,
+                                   <emphasis>/* 7 */</emphasis> &amp;zero_quant};
+
+  <emphasis>/* Run the error tests. We expect error to be raised for each test. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  n = 7;
+  i = 0;
+  <emphasis role="strong">while</emphasis> (i &lt; n) {
+    test = all_checks[i];
+    ret = <emphasis role="strong"><link linkend='igraph_roulette_wheel_imitation'>igraph_roulette_wheel_imitation</link></emphasis>(test-&gt;graph, test-&gt;vertex,
+                                          test-&gt;islocal, test-&gt;quantities,
+                                          test-&gt;strategies, test-&gt;mode);
+    <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+      <emphasis role="strong">printf</emphasis>("Error test no. %d failed.\n", (int)(i + 1));
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    i++;
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;gzero);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;h);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quantzero);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratzero);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* A game on a graph with 5 vertices and 7 edges. Use roulette wheel selection</emphasis>
+<emphasis> * to update strategies. This example also illustrates how a choice of</emphasis>
+<emphasis> * perspective (whether local or global) could affect the range of</emphasis>
+<emphasis> * possible strategies a vertex could adopt.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">roulette_test</emphasis>() {
+  igraph_t g;
+  igraph_bool_t success;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *known, quant, strat, stratcopy;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> known0, known1, known2, known3, known4, known5;
+  int i, k, n, nvert, ret;;
+  strategy_test_t *test;
+
+  <emphasis>/* the game network */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED,
+               0,3, 0,4, 1,2, 1,4, 1,5, 2,3, 2,4, 3,4, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis>/* strategies vector; the strategy space is {0, 1, 2, 3} */</emphasis>
+  <emphasis>/* V[i] is strategy of vertex i */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, nvert, 1.0, 0.0, 1.0, 2.0, 0.0, 3.0);
+  <emphasis>/* quantities vector; V[i] is quantity of vertex i */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, nvert, 0.56, 0.13, 0.26, 0.73, 0.67, 0.82);
+  <emphasis>/* possible strategies each vertex can adopt */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known0, <emphasis>/*n=*/</emphasis> 3, 0.0, 1.0, 2.0);       <emphasis>/* local */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known1, <emphasis>/*n=*/</emphasis> 3, 0.0, 1.0, 3.0);       <emphasis>/* local */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known2, <emphasis>/*n=*/</emphasis> 3, 0.0, 1.0, 2.0);       <emphasis>/* local */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known3, <emphasis>/*n=*/</emphasis> 3, 0.0, 1.0, 2.0);       <emphasis>/* local */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known4, <emphasis>/*n=*/</emphasis> 3, 0.0, 1.0, 2.0);       <emphasis>/* local */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known5, <emphasis>/*n=*/</emphasis> 4, 0.0, 1.0, 2.0, 3.0);  <emphasis>/* global */</emphasis>
+
+  <emphasis>/* test parameters */</emphasis>
+  <emphasis>/*graph--vert--islocal--quantities--strategies--known_strats--mode-retval*/</emphasis>
+  strategy_test_t game0 = {&amp;g, 0, 1, &amp;quant, NULL, &amp;known0, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t game1 = {&amp;g, 1, 1, &amp;quant, NULL, &amp;known1, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t game2 = {&amp;g, 2, 1, &amp;quant, NULL, &amp;known2, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t game3 = {&amp;g, 3, 1, &amp;quant, NULL, &amp;known3, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t game4 = {&amp;g, 4, 1, &amp;quant, NULL, &amp;known4, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t game5 = {&amp;g, 5, 0, &amp;quant, NULL, &amp;known5, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;game0,
+                                   <emphasis>/* 2 */</emphasis> &amp;game1,
+                                   <emphasis>/* 3 */</emphasis> &amp;game2,
+                                   <emphasis>/* 4 */</emphasis> &amp;game3,
+                                   <emphasis>/* 5 */</emphasis> &amp;game4,
+                                   <emphasis>/* 6 */</emphasis> &amp;game5};
+
+  <emphasis>/* play game */</emphasis>
+  n = 6;
+  i = 0;
+  <emphasis role="strong">while</emphasis> (i &lt; n) {
+    test = all_checks[i];
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcopy, &amp;strat);
+    ret = <emphasis role="strong"><link linkend='igraph_roulette_wheel_imitation'>igraph_roulette_wheel_imitation</link></emphasis>(test-&gt;graph, test-&gt;vertex,
+                                          test-&gt;islocal, test-&gt;quantities,
+                                          &amp;stratcopy, test-&gt;mode);
+    <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+      <emphasis role="strong">printf</emphasis>("Test no. %d failed.\n", i + 1);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis>/* If the revised strategy s matches one of the candidate strategies, */</emphasis>
+    <emphasis>/* then success. If s doesn't match any of the possible strategies, then */</emphasis>
+    <emphasis>/* failure. Default to failure. */</emphasis>
+    success = 0;
+    known = test-&gt;known_strats;
+    <emphasis role="strong">for</emphasis> (k = 0; k &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(known); k++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*known)[k] == <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcopy)[test-&gt;vertex]) {
+        success = 1;
+        <emphasis role="strong">break</emphasis>;
+      }
+    }
+    <emphasis role="strong">if</emphasis> (!success) {
+      <emphasis role="strong">printf</emphasis>("Roulette wheel imitation failed for vertex %d.\n",
+             (int)test-&gt;vertex);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcopy);
+    i++;
+  }
+  <emphasis>/* game finished; pack up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known3);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known4);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known5);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* It is possible for a vertex to retain its current strategy. This can</emphasis>
+<emphasis> * happen both in the local and global perspectives.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">retain_strategy_test</emphasis>() {
+  igraph_t g;
+  igraph_integer_t max, min, v;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat, stratcp;
+  int i, ntry, nvert;
+
+  <emphasis>/* the game network */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*nvert=*/</emphasis> 0, IGRAPH_UNDIRECTED,
+               0,3, 0,4, 1,2, 1,4, 1,5, 2,3, 2,4, 3,4, -1);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis>/* strategies vector; the strategy space is {0, 1, 2, 3} */</emphasis>
+  <emphasis>/* V[i] is strategy of vertex i */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, nvert, 1.0, 0.0, 1.0, 2.0, 0.0, 3.0);
+  <emphasis>/* quantities vector; V[i] is quantity of vertex i */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, nvert, 0.56, 0.13, 0.26, 0.73, 0.67, 0.82);
+
+  <emphasis>/* random vertex */</emphasis>
+  min = 0;
+  max = 5;
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), <emphasis role="strong">time</emphasis>(0));
+  v = <emphasis role="strong">R_INTEGER</emphasis>(min, max);  <emphasis>/* min &lt;= v &lt;= max */</emphasis>
+  <emphasis>/* Ensure that it is possible for v to retain its current strategy. We */</emphasis>
+  <emphasis>/* will try to do this at most ntry times. As there are at most 6 vertices */</emphasis>
+  <emphasis>/* to choose from, it shouldn't take long before we encounter a strategy */</emphasis>
+  <emphasis>/* revision round where v retains its current strategy. */</emphasis>
+  <emphasis>/* With local perspective. */</emphasis>
+  i = 0;
+  ntry = 100;
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;stratcp, 0);
+  <emphasis role="strong">do</emphasis> {
+    i++;
+    <emphasis role="strong">if</emphasis> (i &gt; ntry)
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;  <emphasis>/* ideally this should never happen */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcp);
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcp, &amp;strat);
+    <emphasis role="strong"><link linkend='igraph_roulette_wheel_imitation'>igraph_roulette_wheel_imitation</link></emphasis>(&amp;g, v, <emphasis>/*is local?*/</emphasis> 1, &amp;quant, &amp;stratcp,
+                                    IGRAPH_ALL);
+  }
+  <emphasis role="strong">while</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcp)[v] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(strat)[v]);
+  <emphasis>/* If we get to this point, we know that there was an update round */</emphasis>
+  <emphasis>/* i &lt;= ntry as a result of which v retains its current strategy. */</emphasis>
+  <emphasis>/* Now try again, but this time with the global perspective. */</emphasis>
+  i = 0;
+  <emphasis role="strong">do</emphasis> {
+    i++;
+    <emphasis role="strong">if</emphasis> (i &gt; ntry)
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;  <emphasis>/* ideally this should never happen */</emphasis>
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcp);
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcp, &amp;strat);
+    <emphasis role="strong"><link linkend='igraph_roulette_wheel_imitation'>igraph_roulette_wheel_imitation</link></emphasis>(&amp;g, v, <emphasis>/*is local?*/</emphasis> 0, &amp;quant, &amp;stratcp,
+                                    IGRAPH_ALL);
+  }
+  <emphasis role="strong">while</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcp)[v] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(strat)[v]);
+  <emphasis>/* nothing further to do, but housekeeping */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcp);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_tests</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  ret = <emphasis role="strong">roulette_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  ret = <emphasis role="strong">retain_strategy_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping.c.xml igraph-0.6.5/examples/simple/igraph_scg_grouping.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_grouping.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,84 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge, MA, 02138 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">SIZE</emphasis> (1000)
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_matrix_t M, M2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> lambda;
+  igraph_matrix_t V;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> ivec;
+  int i, j;
+  int n;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis>/* Symmetric matrix, exponentially distributed elements */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, SIZE, SIZE);
+  n=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;M);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;n; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, i, j) = <emphasis role="strong">igraph_rng_get_exp</emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M2, n, n);
+  <emphasis role="strong"><link linkend='igraph_matrix_update'>igraph_matrix_update</link></emphasis>(&amp;M2, &amp;M);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;M2);
+  <emphasis role="strong"><link linkend='igraph_matrix_add'>igraph_matrix_add</link></emphasis>(&amp;M, &amp;M2);
+  <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;M, 0.5);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M2);
+
+  <emphasis>/* Get first (most positive) two eigenvectors */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;lambda, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_lapack_dsyevr'>igraph_lapack_dsyevr</link></emphasis>(&amp;M, IGRAPH_LAPACK_DSYEV_SELECT, <emphasis>/*vl=*/</emphasis> 0, <emphasis>/*vu=*/</emphasis> 0, 
+		       <emphasis>/*vestimate=*/</emphasis> 0, <emphasis>/*il=*/</emphasis> n-1, <emphasis>/*iu=*/</emphasis> n, 
+		       <emphasis>/*abstol=*/</emphasis> 0.0, <emphasis>/*values=*/</emphasis> &amp;lambda, <emphasis>/*vectors=*/</emphasis> &amp;V, 
+		       <emphasis>/*support=*/</emphasis> 0);
+  
+  <emphasis>/* Grouping */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;ivec, 2);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ivec)[0] = 2; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ivec)[1] = 3;  
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*invervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> &amp;ivec, IGRAPH_SCG_SYMMETRIC, 
+		      IGRAPH_SCG_OPTIMUM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 100);
+  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;ivec);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;lambda);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping2.c.xml igraph-0.6.5/examples/simple/igraph_scg_grouping2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_grouping2.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,80 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_matrix_t adj, V;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;adj, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+    
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+
+  <emphasis role="strong"><link linkend='igraph_get_adjacency'>igraph_get_adjacency</link></emphasis>(&amp;g, &amp;adj, IGRAPH_GET_ADJACENCY_BOTH, <emphasis>/*eids=*/</emphasis> 0);
+
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=1;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;adj, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0, 
+				<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), <emphasis>/*extra=*/</emphasis> 0, 
+				<emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+				&amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0,
+				<emphasis>/*values=*/</emphasis> 0, &amp;V);
+  
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_OPTIMUM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_INTERV_KM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_INTERV, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_EXACT, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;adj);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping3.c.xml igraph-0.6.5/examples/simple/igraph_scg_grouping3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_grouping3.c.xml	2013-03-03 01:45:55.000000000 +0000
@@ -0,0 +1,121 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">const</emphasis> int nodes=10;
+  igraph_t g;
+  igraph_matrix_t V, V3;
+  igraph_matrix_complex_t V2;
+  igraph_sparsemat_t stochastic, stochasticT;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> p, selcol;
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, nodes, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;stochastic, nodes, nodes, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)*2);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;V2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V3, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;p, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;selcol, 1);  
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_get_stochastic_sparsemat'>igraph_get_stochastic_sparsemat</link></emphasis>(&amp;g, &amp;stochastic, <emphasis>/*column-wise=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;stochastic, &amp;stochasticT, <emphasis>/*values=*/</emphasis> 1);
+
+  which.pos=IGRAPH_EIGEN_LR;
+  which.howmany=1;
+
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;stochasticT, <emphasis>/*fun=*/</emphasis> 0, nodes,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*1algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V);
+
+  <emphasis>/* `p' is always the eigenvector corresponding to the 1-eigenvalue */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_get_col'>igraph_matrix_get_col</link></emphasis>(&amp;V, &amp;p, 0);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;p);
+
+  which.howmany=3;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;stochastic, <emphasis>/*fun=*/</emphasis> 0, nodes,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(selcol)[0]=2;
+  <emphasis role="strong"><link linkend='igraph_matrix_select_cols'>igraph_matrix_select_cols</link></emphasis>(&amp;V3, &amp;V, &amp;selcol);
+
+  <emphasis>/* ------------ */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_OPTIMUM, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_INTERV_KM, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_INTERV, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_EXACT, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;p);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;selcol);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V3);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;V2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;stochasticT);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;stochastic);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping4.c.xml igraph-0.6.5/examples/simple/igraph_scg_grouping4.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_grouping4.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_grouping4.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,100 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">const</emphasis> int nodes=10;
+  igraph_t g;
+  igraph_matrix_t V;
+  igraph_matrix_complex_t V2;
+  igraph_sparsemat_t laplacian;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, nodes, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;laplacian, nodes, nodes, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)*2);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;V2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;laplacian, 0, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0, <emphasis>/*sparseres=*/</emphasis> &amp;laplacian, 
+		   <emphasis>/*normalized=*/</emphasis> 0, <emphasis>/*weights=*/</emphasis> 0);
+
+  which.pos=IGRAPH_EIGEN_LR;
+  which.howmany=1;
+
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;laplacian, <emphasis>/*fun=*/</emphasis> 0, nodes,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V);
+
+  <emphasis>/* ------------ */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_OPTIMUM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_INTERV_KM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_INTERV, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_EXACT, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);
+
+  <emphasis>/* ------------ */</emphasis>  
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;V2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;laplacian);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors.c.xml igraph-0.6.5/examples/simple/igraph_scg_semiprojectors.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_semiprojectors.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,113 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  igraph_matrix_t adj, V;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;adj, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+    
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_get_adjacency'>igraph_get_adjacency</link></emphasis>(&amp;g, &amp;adj, IGRAPH_GET_ADJACENCY_BOTH, <emphasis>/*eids=*/</emphasis> 0);
+
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=1;
+  <emphasis role="strong">igraph_eigen_matrix_symmetric</emphasis>(&amp;adj, <emphasis>/*sparsemat=*/</emphasis> 0, <emphasis>/*fun=*/</emphasis> 0,
+				<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), <emphasis>/*extra=*/</emphasis> 0, 
+				<emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+				&amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+				<emphasis>/*values=*/</emphasis> 0, &amp;V);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">SEMI</emphasis>()								\
+  <emphasis role="strong">do</emphasis> {									\
+    <emphasis role="strong"><link linkend='igraph_scg_semiprojectors'>igraph_scg_semiprojectors</link></emphasis>(&amp;groups, IGRAPH_SCG_SYMMETRIC, &amp;L, &amp;R,	\
+			      &amp;Lsparse, &amp;Rsparse, <emphasis>/*p=*/</emphasis> 0,		\
+			      IGRAPH_SCG_NORM_ROW);			\
+  } <emphasis role="strong">while</emphasis>(0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()				\
+  <emphasis role="strong">do</emphasis> {						\
+    <emphasis role="strong">printf</emphasis>("----------------------\n");		\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;L);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;R);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+  } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_OPTIMUM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 2, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_INTERV_KM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 2, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_INTERV, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_SYMMETRIC,
+		      IGRAPH_SCG_EXACT, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;adj);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors2.c.xml igraph-0.6.5/examples/simple/igraph_scg_semiprojectors2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_semiprojectors2.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,148 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  int nodes=10;
+  igraph_t g;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  igraph_matrix_t V, V3;
+  igraph_matrix_complex_t V2;
+  igraph_sparsemat_t stochastic, stochasticT;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> p, selcol;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V3, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;selcol, 1);
+    
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;stochastic, nodes, nodes, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)*2);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;V2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;p, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_get_stochastic_sparsemat'>igraph_get_stochastic_sparsemat</link></emphasis>(&amp;g, &amp;stochastic, <emphasis>/*column-wise=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;stochastic, &amp;stochasticT, <emphasis>/*values=*/</emphasis> 1);
+
+  which.pos=IGRAPH_EIGEN_LR;
+  which.howmany=1;
+
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;stochasticT, <emphasis>/*fun=*/</emphasis> 0, 10,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V);
+  <emphasis>/* `p' is always the eigenvector corresponding to the 1-eigenvalue */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_get_col'>igraph_matrix_get_col</link></emphasis>(&amp;V, &amp;p, 0);
+
+  which.howmany=3;
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;stochastic, <emphasis>/*fun=*/</emphasis> 0, 10,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(selcol)[0]=2;
+  <emphasis role="strong"><link linkend='igraph_matrix_select_cols'>igraph_matrix_select_cols</link></emphasis>(&amp;V3, &amp;V, &amp;selcol);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">SEMI</emphasis>()								\
+  <emphasis role="strong">do</emphasis> {									\
+    <emphasis role="strong"><link linkend='igraph_scg_semiprojectors'>igraph_scg_semiprojectors</link></emphasis>(&amp;groups, IGRAPH_SCG_STOCHASTIC, &amp;L, &amp;R,	\
+			      &amp;Lsparse, &amp;Rsparse, &amp;p,			\
+			      IGRAPH_SCG_NORM_ROW);			\
+  } <emphasis role="strong">while</emphasis>(0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()				\
+  <emphasis role="strong">do</emphasis> {						\
+    <emphasis role="strong">printf</emphasis>("----------------------\n");		\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;L);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;R);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+  } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_OPTIMUM, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_INTERV_KM, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_INTERV, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_STOCHASTIC,
+		      IGRAPH_SCG_EXACT, &amp;p, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;p);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;selcol);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;L);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;R);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V3);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;V2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;stochasticT);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;stochastic);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors3.c.xml igraph-0.6.5/examples/simple/igraph_scg_semiprojectors3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_scg_semiprojectors3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_scg_semiprojectors3.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,129 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  int nodes=10;
+  igraph_t g;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  igraph_matrix_t V;
+  igraph_matrix_complex_t V2;
+  igraph_sparsemat_t laplacian, laplacianT;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_eigen_which_t which;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;V, 0, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;V2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+    
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;laplacian, nodes, nodes, <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g)*2);
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_laplacian'>igraph_laplacian</link></emphasis>(&amp;g, <emphasis>/*res=*/</emphasis> 0, <emphasis>/*sparseres=*/</emphasis> &amp;laplacian, 
+		   <emphasis>/*normalized=*/</emphasis> 0, <emphasis>/*weights=*/</emphasis> 0);
+
+  which.pos=IGRAPH_EIGEN_LM;
+  which.howmany=1;
+
+  <emphasis role="strong">igraph_eigen_matrix</emphasis>(<emphasis>/*matrix=*/</emphasis> 0, &amp;laplacian, <emphasis>/*fun=*/</emphasis> 0, 10,
+		      <emphasis>/*extra=*/</emphasis> 0, <emphasis>/*algorithm=*/</emphasis> IGRAPH_EIGEN_LAPACK,
+		      &amp;which, <emphasis>/*options=*/</emphasis> 0, <emphasis>/*storage=*/</emphasis> 0, 
+		      <emphasis>/*values=*/</emphasis> 0, &amp;V2);
+  <emphasis role="strong">igraph_matrix_complex_real</emphasis>(&amp;V2, &amp;V);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">SEMI</emphasis>()								\
+  <emphasis role="strong">do</emphasis> {									\
+    <emphasis role="strong"><link linkend='igraph_scg_semiprojectors'>igraph_scg_semiprojectors</link></emphasis>(&amp;groups, IGRAPH_SCG_LAPLACIAN, &amp;L, &amp;R,	\
+			      &amp;Lsparse, &amp;Rsparse, <emphasis>/*p=*/</emphasis> 0,		\
+			      IGRAPH_SCG_NORM_ROW);			\
+  } <emphasis role="strong">while</emphasis>(0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()				\
+  <emphasis role="strong">do</emphasis> {						\
+    <emphasis role="strong">printf</emphasis>("----------------------\n");		\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;L);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;R);			\
+    <emphasis role="strong">printf</emphasis>("---\n");				\
+  } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 3, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_OPTIMUM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 2, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_INTERV_KM, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*intervals=*/</emphasis> 2, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_INTERV, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_scg_grouping'>igraph_scg_grouping</link></emphasis>(&amp;V, &amp;groups, <emphasis>/*(ignored) intervals=*/</emphasis> 0, 
+		      <emphasis>/*intervals_vector=*/</emphasis> 0, IGRAPH_SCG_LAPLACIAN,
+		      IGRAPH_SCG_EXACT, <emphasis>/*p=*/</emphasis> 0, <emphasis>/*maxiter=*/</emphasis> 10000);
+  <emphasis role="strong">SEMI</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+
+  <emphasis>/* -------------- */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;L);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;R);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;V);
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;V2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;laplacian);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+    
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_set.c.xml igraph-0.6.5/examples/simple/igraph_set.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_set.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_set.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,86 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">print_set</emphasis>(igraph_set_t *set, FILE *f) {
+  long int state=0;
+  igraph_integer_t element;
+  <emphasis role="strong">while</emphasis> (<emphasis role="strong">igraph_set_iterate</emphasis>(set, &amp;state, &amp;element)) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) element);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_set_t set, set2;
+  int i;
+  igraph_integer_t *ptr;
+
+  <emphasis>/* simple init */</emphasis>
+  <emphasis role="strong">igraph_set_init</emphasis>(&amp;set, 0);
+  <emphasis role="strong">igraph_set_destroy</emphasis>(&amp;set);
+
+  <emphasis>/* addition, igraph_set_size */</emphasis>
+  <emphasis role="strong">igraph_set_init</emphasis>(&amp;set, 10);
+  i=10;
+  <emphasis role="strong">while</emphasis> (<emphasis role="strong">igraph_set_size</emphasis>(&amp;set) &lt; 10) {
+    <emphasis role="strong">igraph_set_add</emphasis>(&amp;set, 2*i);
+    i--;
+  }
+  <emphasis role="strong">while</emphasis> (<emphasis role="strong">igraph_set_size</emphasis>(&amp;set) &lt; 21) {
+    <emphasis role="strong">igraph_set_add</emphasis>(&amp;set, 2*i+1);
+    i++;
+  }
+  <emphasis role="strong">print_set</emphasis>(&amp;set, stdout);
+
+  <emphasis>/* adding existing element */</emphasis>
+  <emphasis role="strong">igraph_set_add</emphasis>(&amp;set, 8);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_set_size</emphasis>(&amp;set) != 21) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+
+  <emphasis>/* igraph_set_contains */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_set_contains</emphasis>(&amp;set, 42) || !<emphasis role="strong">igraph_set_contains</emphasis>(&amp;set, 7)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis>/* igraph_set_empty, igraph_set_clear */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_set_empty</emphasis>(&amp;set)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">igraph_set_clear</emphasis>(&amp;set);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_set_empty</emphasis>(&amp;set)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong">igraph_set_destroy</emphasis>(&amp;set);
+  
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 5;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_similarity.c.xml igraph-0.6.5/examples/simple/igraph_similarity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_similarity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_similarity.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,211 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set ts=2 sw=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_matrix</emphasis>(igraph_matrix_t *m, FILE *f) {
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m); j++) {
+      <emphasis role="strong">fprintf</emphasis>(f, " %.2f", <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "==========\n");
+}
+
+int <emphasis role="strong">check_jaccard_all</emphasis>(<emphasis role="strong">const</emphasis> igraph_t* g, igraph_matrix_t* m,
+		igraph_neimode_t mode, igraph_bool_t loops) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> pairs, res;
+  long int i, j, k, n;
+  igraph_eit_t eit;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+
+  <emphasis>/* First, query the similarities for all the vertices to a matrix */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_similarity_jaccard'>igraph_similarity_jaccard</link></emphasis>(g, m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), mode, loops);
+
+  <emphasis>/* Second, query the similarities for all pairs using a pair vector */</emphasis>
+  n = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;pairs, 0);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    <emphasis role="strong">for</emphasis> (j = n-1; j &gt;= 0; j--) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;pairs, i);
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;pairs, j);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_similarity_jaccard_pairs'>igraph_similarity_jaccard_pairs</link></emphasis>(g, &amp;res, &amp;pairs, mode, loops);
+  <emphasis role="strong">for</emphasis> (i = 0, k = 0; i &lt; n; i++) {
+    <emphasis role="strong">for</emphasis> (j = n-1; j &gt;= 0; j--, k++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k] - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j)) &gt; 1e-6) {
+        <emphasis role="strong">fprintf</emphasis>(stderr, "Jaccard similarity calculation for vertex pair %ld-%ld "
+            "does not match the value in the full matrix (%.6f vs %.6f)\n",
+            i, j, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k], <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+        <emphasis role="strong">return</emphasis> 1;
+      }
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;pairs);
+
+  <emphasis>/* Third, query the similarities for all edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_similarity_jaccard_es'>igraph_similarity_jaccard_es</link></emphasis>(g, &amp;res, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_FROM), mode, loops);
+  <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(g, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_FROM), &amp;eit);
+  k = 0;
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(eit)) {
+    long int eid = <emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(eit);
+    i = <emphasis role="strong">IGRAPH_FROM</emphasis>(g, eid); j = <emphasis role="strong">IGRAPH_TO</emphasis>(g, eid);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k] - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j)) &gt; 1e-6) {
+      <emphasis role="strong">fprintf</emphasis>(stderr, "Jaccard similarity calculation for edge %ld-%ld (ID=%ld) "
+          "does not match the value in the full matrix (%.6f vs %.6f)\n",
+          i, j, eid, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k], <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+      <emphasis role="strong">return</emphasis> 1;
+    }
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(eit);
+    k++;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;eit);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">check_dice_all</emphasis>(<emphasis role="strong">const</emphasis> igraph_t* g, igraph_matrix_t* m,
+		igraph_neimode_t mode, igraph_bool_t loops) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> pairs, res;
+  long int i, j, k, n;
+  igraph_eit_t eit;
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+
+  <emphasis>/* First, query the similarities for all the vertices to a matrix */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_similarity_dice'>igraph_similarity_dice</link></emphasis>(g, m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), mode, loops);
+
+  <emphasis>/* Second, query the similarities for all pairs using a pair vector */</emphasis>
+  n = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(g);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;pairs, 0);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; n; i++) {
+    <emphasis role="strong">for</emphasis> (j = n-1; j &gt;= 0; j--) {
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;pairs, i);
+      <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;pairs, j);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_similarity_dice_pairs'>igraph_similarity_dice_pairs</link></emphasis>(g, &amp;res, &amp;pairs, mode, loops);
+  <emphasis role="strong">for</emphasis> (i = 0, k = 0; i &lt; n; i++) {
+    <emphasis role="strong">for</emphasis> (j = n-1; j &gt;= 0; j--, k++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k] - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j)) &gt; 1e-6) {
+        <emphasis role="strong">fprintf</emphasis>(stderr, "Dice similarity calculation for vertex pair %ld-%ld "
+            "does not match the value in the full matrix (%.6f vs %.6f)\n",
+            i, j, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k], <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+        <emphasis role="strong">return</emphasis> 1;
+      }
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;pairs);
+
+  <emphasis>/* Third, query the similarities for all edges */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_similarity_dice_es'>igraph_similarity_dice_es</link></emphasis>(g, &amp;res, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_FROM), mode, loops);
+  <emphasis role="strong"><link linkend='igraph_eit_create'>igraph_eit_create</link></emphasis>(g, <emphasis role="strong"><link linkend='igraph_ess_all'>igraph_ess_all</link></emphasis>(IGRAPH_EDGEORDER_FROM), &amp;eit);
+  k = 0;
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_EIT_END'>IGRAPH_EIT_END</link></emphasis>(eit)) {
+    long int eid = <emphasis role="strong"><link linkend='IGRAPH_EIT_GET'>IGRAPH_EIT_GET</link></emphasis>(eit);
+    i = <emphasis role="strong">IGRAPH_FROM</emphasis>(g, eid); j = <emphasis role="strong">IGRAPH_TO</emphasis>(g, eid);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k] - <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j)) &gt; 1e-6) {
+      <emphasis role="strong">fprintf</emphasis>(stderr, "Dice similarity calculation for edge %ld-%ld (ID=%ld) "
+          "does not match the value in the full matrix (%.6f vs %.6f)\n",
+          i, j, eid, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[k], <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+      <emphasis role="strong">return</emphasis> 1;
+    }
+    <emphasis role="strong"><link linkend='IGRAPH_EIT_NEXT'>IGRAPH_EIT_NEXT</link></emphasis>(eit);
+    k++;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_eit_destroy'>igraph_eit_destroy</link></emphasis>(&amp;eit);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_matrix_t m;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 
+	       0,1, 2,1, 2,0, 3,0, 
+	       -1);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 0, 0);
+
+  ret = <emphasis role="strong">check_jaccard_all</emphasis>(&amp;g, &amp;m, IGRAPH_ALL, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 1;
+  
+  <emphasis role="strong"><link linkend='igraph_similarity_jaccard'>igraph_similarity_jaccard</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_seq'>igraph_vss_seq</link></emphasis>(1, 2), IGRAPH_ALL, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  ret = <emphasis role="strong">check_jaccard_all</emphasis>(&amp;g, &amp;m, IGRAPH_OUT, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 3;
+  
+  ret = <emphasis role="strong">check_jaccard_all</emphasis>(&amp;g, &amp;m, IGRAPH_IN, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 4;
+  
+  ret = <emphasis role="strong">check_dice_all</emphasis>(&amp;g, &amp;m, IGRAPH_ALL, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 5;
+  
+  ret = <emphasis role="strong">check_dice_all</emphasis>(&amp;g, &amp;m, IGRAPH_OUT, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 6;
+
+  ret = <emphasis role="strong">check_dice_all</emphasis>(&amp;g, &amp;m, IGRAPH_IN, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> 7;
+
+  <emphasis role="strong"><link linkend='igraph_similarity_inverse_log_weighted'>igraph_similarity_inverse_log_weighted</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_ALL);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_similarity_inverse_log_weighted'>igraph_similarity_inverse_log_weighted</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_similarity_inverse_log_weighted'>igraph_similarity_inverse_log_weighted</link></emphasis>(&amp;g, &amp;m, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_simplify.c.xml igraph-0.6.5/examples/simple/igraph_simplify.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_simplify.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_simplify.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,93 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+
+  <emphasis>/* Multiple edges */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 0,1, 0,1, 0,1, 0,1, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 1,0, 0,1, 1,0, 0,1, 0,1, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 1) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis>/* Loop edges*/</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,0,1,1,2,2, 1,2, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 0,0,1,1,2,2, 1,2, -1); 
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Loop &amp; multiple edges */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,0,0,0,0,0,0,0, 1,2, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1 <emphasis>/* multiple */</emphasis>, 0 <emphasis>/* loop */</emphasis>, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 1,1,1,1,1,1,1,1, 2,3, -1); 
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1 <emphasis>/* multiple */</emphasis>, 0 <emphasis>/* loop */</emphasis>, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 2,2,2,2,2,2, 3,2, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 0 <emphasis>/* multiple */</emphasis>, 1 <emphasis>/* loop */</emphasis>, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 3,3,3,3, 3,4, -1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 0 <emphasis>/* multiple */</emphasis>, 1 <emphasis>/* loop */</emphasis>, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 2,2,2,2,2,2,2,2, 3,2,3,2,3,2,3,2,3,2,-1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       2,2,2,2,2,2,2,2, 3,2,2,3,3,2,3,2,3,2,-1);
+  <emphasis role="strong"><link linkend='igraph_simplify'>igraph_simplify</link></emphasis>(&amp;g, 1, 1, <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 1) { 
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_small.c.xml igraph-0.6.5/examples/simple/igraph_small.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_small.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_small.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,36 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_DIRECTED, 0,1, 1,2, 2,3, 3,4, 6,1, -1);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,163 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_sparsemat_t A, B, C, D;
+  igraph_t G, H;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vect;
+  long int i;
+  
+  <emphasis>/* Create, compress, destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, 100, 20, 50);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis>/* Convert a ring graph to a matrix, print it, compress, print again */</emphasis>
+<emphasis role="strong">#define</emphasis> VC 10
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;G, VC, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;G, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;G);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+
+  <emphasis>/* Basic query, nrow, ncol, type, is_triplet, is_cc */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_sparsemat_nrow'>igraph_sparsemat_nrow</link></emphasis>(&amp;A) != VC ||
+      <emphasis role="strong"><link linkend='igraph_sparsemat_ncol'>igraph_sparsemat_ncol</link></emphasis>(&amp;A) != VC ||
+      <emphasis role="strong"><link linkend='igraph_sparsemat_nrow'>igraph_sparsemat_nrow</link></emphasis>(&amp;B) != VC || 
+      <emphasis role="strong"><link linkend='igraph_sparsemat_ncol'>igraph_sparsemat_ncol</link></emphasis>(&amp;B) != VC) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_sparsemat_is_triplet'>igraph_sparsemat_is_triplet</link></emphasis>(&amp;A)) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_sparsemat_is_cc'>igraph_sparsemat_is_cc</link></emphasis>(&amp;B))      { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_sparsemat_type'>igraph_sparsemat_type</link></emphasis>(&amp;A) != IGRAPH_SPARSEMAT_TRIPLET) { <emphasis role="strong">return</emphasis> 4; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_sparsemat_type'>igraph_sparsemat_type</link></emphasis>(&amp;B) != IGRAPH_SPARSEMAT_CC)      { <emphasis role="strong">return</emphasis> 5; }
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+<emphasis role="strong">#undef</emphasis> VC
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+
+  <emphasis>/* Create unit matrices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_sparsemat_eye'>igraph_sparsemat_eye</link></emphasis>(&amp;A, <emphasis>/*n=*/</emphasis> 5, <emphasis>/*nzmax=*/</emphasis> 5, <emphasis>/*value=*/</emphasis> 1.0, 
+		       <emphasis>/*compress=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_eye'>igraph_sparsemat_eye</link></emphasis>(&amp;B, <emphasis>/*n=*/</emphasis> 5, <emphasis>/*nzmax=*/</emphasis> 5, <emphasis>/*value=*/</emphasis> 1.0, 
+		       <emphasis>/*compress=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);  
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+
+  <emphasis>/* Create diagonal matrices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vect, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;5; i++) { <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(vect)[i] = i; }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_diag'>igraph_sparsemat_diag</link></emphasis>(&amp;A, <emphasis>/*nzmax=*/</emphasis> 5, <emphasis>/*values=*/</emphasis> &amp;vect, <emphasis>/*compress=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_diag'>igraph_sparsemat_diag</link></emphasis>(&amp;B, <emphasis>/*nzmax=*/</emphasis> 5, <emphasis>/*values=*/</emphasis> &amp;vect, <emphasis>/*compress=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vect);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+  
+  <emphasis>/* Transpose matrices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;G, 10, <emphasis>/*children=*/</emphasis> 2, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;G, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;G);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;B, &amp;C, <emphasis>/*values=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;C, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);	
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;C);	
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+
+  <emphasis>/* Add duplicate elements */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, 10, 10, <emphasis>/*nzmax=*/</emphasis> 20);
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, i, 1.0);
+  }
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, i, 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);	
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+  
+  <emphasis>/* Drop zero elements */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, 10, 10, <emphasis>/*nzmax=*/</emphasis> 20);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 7, 3, 0.0);
+  <emphasis role="strong">for</emphasis> (i=1; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, i, 1.0);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, i, 0.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, 0, 0.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dropzeros'>igraph_sparsemat_dropzeros</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;B, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);	  
+
+  <emphasis role="strong">printf</emphasis>("------------------------\n");
+
+  <emphasis>/* Add two matrices */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_star'>igraph_star</link></emphasis>(&amp;G, 10, IGRAPH_STAR_OUT, <emphasis>/*center=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;H, 10, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;G, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;H, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;G);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;H);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;C);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;B, &amp;D);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_add'>igraph_sparsemat_add</link></emphasis>(&amp;C, &amp;D, <emphasis>/*alpha=*/</emphasis> 1.0, <emphasis>/*beta=*/</emphasis> 2.0, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;C);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;D);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;A, stdout);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat2.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat2.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,261 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;cs/cs.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_blas_internal.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_arpack_internal.h&gt;
+
+int <emphasis role="strong">igraph_matrix_dgemv</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m,
+                        <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v,
+                        <link linkend='igraph_vector_t'>igraph_vector_t</link> *res,
+                        igraph_real_t alpha,
+                        igraph_real_t beta,
+                        igraph_bool_t transpose_m) {
+  
+  int nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m);
+  int ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  long int vlen=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  int one=1;
+  char t = transpose_m ? 't' : 'n';
+  long int input_len  = transpose_m ? nrow : ncol;
+  long int output_len = transpose_m ? ncol : nrow;
+  
+  <emphasis role="strong">if</emphasis> (vlen != input_len) {
+    <emphasis role="strong"><link linkend='IGRAPH_ERROR'>IGRAPH_ERROR</link></emphasis>("Matrix and vector sizes are incompatible", IGRAPH_EINVAL);
+  }
+  
+  <emphasis role="strong">if</emphasis> (beta != 0 &amp;&amp; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(res) != output_len) {
+    <emphasis role="strong"><link linkend='IGRAPH_ERROR'>IGRAPH_ERROR</link></emphasis>("Non-zero beta and bad `res' vector size, possible mistake",
+                 IGRAPH_EINVAL);
+  }
+  
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res, output_len));
+  
+  <emphasis role="strong">igraphdgemv_</emphasis>(&amp;t, &amp;nrow, &amp;ncol, &amp;alpha, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m,0,0), 
+               &amp;nrow, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v), &amp;one, &amp;beta, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res), &amp;one);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">igraph_matrix_vector_prod</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m,
+                              <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v,
+                              <link linkend='igraph_vector_t'>igraph_vector_t</link> *res) {
+  <emphasis role="strong">return</emphasis> <emphasis role="strong">igraph_matrix_dgemv</emphasis>(m, v, res, 1.0, 0.0, <emphasis>/*transpose=*/</emphasis> 0);
+}
+
+int <emphasis role="strong">my_dgemv</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m,
+                       <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v,
+                       <link linkend='igraph_vector_t'>igraph_vector_t</link> *res,
+                       igraph_real_t alpha,
+                       igraph_real_t beta,
+                       igraph_bool_t transpose_m) {
+  
+  int nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m);
+  int ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  long int vlen=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  int one=1;
+  char t = transpose_m ? 't' : 'n';
+  long int input_len  = transpose_m ? nrow : ncol;
+  long int output_len = transpose_m ? ncol : nrow;
+  
+  <emphasis role="strong">if</emphasis> (vlen != input_len) {
+    <emphasis role="strong"><link linkend='IGRAPH_ERROR'>IGRAPH_ERROR</link></emphasis>("Matrix and vector sizes are incompatible", IGRAPH_EINVAL);
+  }
+  
+  <emphasis role="strong">if</emphasis> (beta != 0 &amp;&amp; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(res) != output_len) {
+    <emphasis role="strong"><link linkend='IGRAPH_ERROR'>IGRAPH_ERROR</link></emphasis>("Non-zero beta and bad `res' vector size, possible mistake",
+                IGRAPH_EINVAL);
+  }
+  
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(res, output_len));
+  
+  <emphasis role="strong">igraphdgemv_</emphasis>(&amp;t, &amp;nrow, &amp;ncol, &amp;alpha, &amp;<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m,0,0), 
+              &amp;nrow, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v), &amp;one, &amp;beta, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*res), &amp;one);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">my_gaxpy</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m,
+	     <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *v,
+	     <link linkend='igraph_vector_t'>igraph_vector_t</link> *res) {
+  <emphasis role="strong">return</emphasis> <emphasis role="strong">my_dgemv</emphasis>(m, v, res, 1.0, 0.0, <emphasis>/*transpose=*/</emphasis> 0);
+}
+
+int <emphasis role="strong">my_dgemm</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *m1,
+	     <emphasis role="strong">const</emphasis> igraph_matrix_t *m2,
+	     igraph_matrix_t *res) {
+
+  long int m1_r=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m1);
+  long int m1_c=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m1);
+  long int m2_r=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m2);
+  long int m2_c=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m2);
+  long int i, j, k;
+  
+  <emphasis role="strong">if</emphasis> (m1_c != m2_r) { 
+    <emphasis role="strong"><link linkend='IGRAPH_ERROR'>IGRAPH_ERROR</link></emphasis>("Cannot multiply matrices, invalid dimensions", IGRAPH_EINVAL);
+  }
+  
+  <emphasis role="strong"><link linkend='IGRAPH_CHECK'>IGRAPH_CHECK</link></emphasis>(<emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(res, m1_r, m2_c));
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(res);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;m1_r; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;m2_c; j++) {
+      <emphasis role="strong">for</emphasis> (k=0; k&lt;m1_c <emphasis>/* which is also m2_r*/</emphasis>; k++) {
+	<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*res, i, j) += <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m1, i, k) * <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m2, k, j);
+      }
+    }
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+igraph_bool_t <emphasis role="strong">check_same</emphasis>(<emphasis role="strong">const</emphasis> igraph_sparsemat_t *A, 
+			 <emphasis role="strong">const</emphasis> igraph_matrix_t *M) {
+  
+  long int nrow=<emphasis role="strong"><link linkend='igraph_sparsemat_nrow'>igraph_sparsemat_nrow</link></emphasis>(A);
+  long int ncol=<emphasis role="strong"><link linkend='igraph_sparsemat_ncol'>igraph_sparsemat_ncol</link></emphasis>(A);
+  long int j, p, nzero=0;
+  
+  <emphasis role="strong">if</emphasis> (nrow != <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(M) ||
+      ncol != <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(M)) { 
+    <emphasis role="strong">return</emphasis> 0; 
+  }
+  
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;A-&gt;cs-&gt;n; j++) {
+    <emphasis role="strong">for</emphasis> (p=A-&gt;cs-&gt;p[j]; p &lt; A-&gt;cs-&gt;p[j+1]; p++) {
+      long int to=A-&gt;cs-&gt;i[p];
+      igraph_real_t value=A-&gt;cs-&gt;x[p];
+      <emphasis role="strong">if</emphasis> (value != <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, to, j)) { <emphasis role="strong">return</emphasis> 0; }
+      nzero += 1;
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;nrow; j++) {
+    <emphasis role="strong">for</emphasis> (p=0; p&lt;ncol; p++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, j, p) != 0) { nzero -= 1; }
+    }
+  }
+
+  <emphasis role="strong">return</emphasis> nzero == 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_sparsemat_t A, B, C, D;
+  igraph_t G, H;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, w, x, y;
+  igraph_matrix_t M, N, O;
+  long int i;
+
+  <emphasis role="strong">srand</emphasis>(1);
+
+  <emphasis>/* Matrix-vector product */</emphasis>
+<emphasis role="strong">#define</emphasis> NROW 10
+<emphasis role="strong">#define</emphasis> NCOL 5
+<emphasis role="strong">#define</emphasis> EDGES NROW*NCOL/3
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, NROW, NCOL);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, NROW, NCOL, EDGES);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, NCOL);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;w, NCOL);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;NCOL; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, NROW);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;y, NROW);
+  <emphasis role="strong">my_gaxpy</emphasis>(&amp;M, &amp;v, &amp;x);
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;y);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_gaxpy'>igraph_sparsemat_gaxpy</link></emphasis>(&amp;B, &amp;w, &amp;y);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;x, &amp;y)) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;y);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;w);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+
+<emphasis role="strong">#undef</emphasis> NROW
+<emphasis role="strong">#undef</emphasis> NCOL
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis>/* Matrix-matrix product */</emphasis>
+<emphasis role="strong">#define</emphasis> NROW_A 10
+<emphasis role="strong">#define</emphasis> NCOL_A 7
+<emphasis role="strong">#define</emphasis> EDGES_A NROW_A*NCOL_A/3
+<emphasis role="strong">#define</emphasis> NROW_B 7
+<emphasis role="strong">#define</emphasis> NCOL_B 9
+<emphasis role="strong">#define</emphasis> EDGES_B NROW_B*NCOL_B/3
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, NROW_A, NCOL_A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, NROW_A, NCOL_A, EDGES_A);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES_A; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW_A-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL_A-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;C);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;N, NROW_B, NCOL_B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;B, NROW_B, NCOL_B, EDGES_B);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES_B; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW_B-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL_B-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(N, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(N, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;B, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;B, &amp;D);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;O, 0, 0);
+  <emphasis role="strong">my_dgemm</emphasis>(&amp;M, &amp;N, &amp;O);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_multiply'>igraph_sparsemat_multiply</link></emphasis>(&amp;C, &amp;D, &amp;A);
+
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;O)) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;C);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;D);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;N);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;O);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat3.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat3.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,310 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;cs/cs.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+
+int <emphasis role="strong">permute</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *M, 
+	    <emphasis role="strong">const</emphasis> igraph_vector_int_t *p,
+	    <emphasis role="strong">const</emphasis> igraph_vector_int_t *q,
+	    igraph_matrix_t *res) {
+  
+  long int nrow=<emphasis role="strong">igraph_vector_int_size</emphasis>(p);
+  long int ncol=<emphasis role="strong">igraph_vector_int_size</emphasis>(q);
+  long int i, j;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(res, nrow, ncol);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      int ii=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*p)[i];
+      int jj=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*q)[j];
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*res, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, ii, jj);
+    }
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">permute_rows</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *M,
+		 <emphasis role="strong">const</emphasis> igraph_vector_int_t *p,
+		 igraph_matrix_t *res) {
+
+  long int nrow=<emphasis role="strong">igraph_vector_int_size</emphasis>(p);
+  long int ncol=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(M);
+  long int i, j;
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(res, nrow, ncol);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      int ii=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*p)[i];
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*res, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, ii, j);
+    }
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">permute_cols</emphasis>(<emphasis role="strong">const</emphasis> igraph_matrix_t *M,
+		 <emphasis role="strong">const</emphasis> igraph_vector_int_t *q,
+		 igraph_matrix_t *res) {
+
+  long int nrow=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(M);
+  long int ncol=<emphasis role="strong">igraph_vector_int_size</emphasis>(q);
+  long int i, j;
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(res, nrow, ncol);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;nrow; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;ncol; j++) {
+      int jj=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*q)[j];
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*res, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, i, jj);
+    }
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">random_permutation</emphasis>(igraph_vector_int_t *vec) {
+  <emphasis>/* We just do size(vec) * 2 swaps */</emphasis>
+  long int one, two, i, n=<emphasis role="strong">igraph_vector_int_size</emphasis>(vec);
+  int tmp;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;2*n; i++) {
+    one= <emphasis role="strong">RNG_INTEGER</emphasis>(0, n-1);
+    two= <emphasis role="strong">RNG_INTEGER</emphasis>(0, n-1);
+    tmp=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[one];
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[one] = <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[two];
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*vec)[two] = tmp;
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+igraph_bool_t <emphasis role="strong">check_same</emphasis>(<emphasis role="strong">const</emphasis> igraph_sparsemat_t *A, 
+			 <emphasis role="strong">const</emphasis> igraph_matrix_t *M) {
+  
+  long int nrow=<emphasis role="strong"><link linkend='igraph_sparsemat_nrow'>igraph_sparsemat_nrow</link></emphasis>(A);
+  long int ncol=<emphasis role="strong"><link linkend='igraph_sparsemat_ncol'>igraph_sparsemat_ncol</link></emphasis>(A);
+  long int j, p, nzero=0;
+  
+  <emphasis role="strong">if</emphasis> (nrow != <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(M) ||
+      ncol != <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(M)) { 
+    <emphasis role="strong">return</emphasis> 0; 
+  }
+  
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;A-&gt;cs-&gt;n; j++) {
+    <emphasis role="strong">for</emphasis> (p=A-&gt;cs-&gt;p[j]; p &lt; A-&gt;cs-&gt;p[j+1]; p++) {
+      long int to=A-&gt;cs-&gt;i[p];
+      igraph_real_t value=A-&gt;cs-&gt;x[p];
+      <emphasis role="strong">if</emphasis> (value != <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, to, j)) { <emphasis role="strong">return</emphasis> 0; }
+      nzero += 1;
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;nrow; j++) {
+    <emphasis role="strong">for</emphasis> (p=0; p&lt;ncol; p++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*M, j, p) != 0) { nzero -= 1; }
+    }
+  }
+
+  <emphasis role="strong">return</emphasis> nzero == 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_sparsemat_t A, B;
+  igraph_matrix_t M, N;
+  igraph_vector_int_t p, q;
+  long int i;
+
+  <emphasis>/* Permutation of a matrix */</emphasis>
+
+<emphasis role="strong">#define</emphasis> NROW 10
+<emphasis role="strong">#define</emphasis> NCOL 5
+<emphasis role="strong">#define</emphasis> EDGES NROW*NCOL/3
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, NROW, NCOL);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, NROW, NCOL, EDGES);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">igraph_vector_int_init_seq</emphasis>(&amp;p, 0, NROW-1);
+  <emphasis role="strong">igraph_vector_int_init_seq</emphasis>(&amp;q, 0, NCOL-1);
+
+  <emphasis>/* Identity */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;N, 0, 0);
+  <emphasis role="strong">permute</emphasis>(&amp;M, &amp;p, &amp;q, &amp;N);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_permute'>igraph_sparsemat_permute</link></emphasis>(&amp;B, &amp;p, &amp;q, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;N)) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis>/* Random permutation */</emphasis>
+  <emphasis role="strong">random_permutation</emphasis>(&amp;p);
+  <emphasis role="strong">random_permutation</emphasis>(&amp;q);
+
+  <emphasis role="strong">permute</emphasis>(&amp;M, &amp;p, &amp;q, &amp;N);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_permute'>igraph_sparsemat_permute</link></emphasis>(&amp;B, &amp;p, &amp;q, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;N)) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;p);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;q);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;N);
+
+<emphasis role="strong">#undef</emphasis> NROW
+<emphasis role="strong">#undef</emphasis> NCOL
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis>/* Indexing */</emphasis>
+
+<emphasis role="strong">#define</emphasis> NROW 10
+<emphasis role="strong">#define</emphasis> NCOL 5
+<emphasis role="strong">#define</emphasis> EDGES NROW*NCOL/3
+<emphasis role="strong">#define</emphasis> I_NROW 6
+<emphasis role="strong">#define</emphasis> I_NCOL 3
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, NROW, NCOL);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, NROW, NCOL, EDGES);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;p, I_NROW);
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;q, I_NCOL);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;I_NROW; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, I_NROW-1);
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;I_NCOL; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, I_NCOL-1);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;N, 0, 0);
+  <emphasis role="strong">permute</emphasis>(&amp;M, &amp;p, &amp;q, &amp;N);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_index'>igraph_sparsemat_index</link></emphasis>(&amp;B, &amp;p, &amp;q, &amp;A, 0);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;N)) { <emphasis role="strong">return</emphasis> 3; }
+  
+  <emphasis>/* A single element */</emphasis>
+  
+  <emphasis role="strong">igraph_vector_int_resize</emphasis>(&amp;p, 1);
+  <emphasis role="strong">igraph_vector_int_resize</emphasis>(&amp;q, 1);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    igraph_real_t value;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[0] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(q)[0] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_index'>igraph_sparsemat_index</link></emphasis>(&amp;B, &amp;p, &amp;q, <emphasis>/*res=*/</emphasis> 0, &amp;value);
+    <emphasis role="strong">if</emphasis> (value != <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[0], <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(q)[0])) { 
+      <emphasis role="strong">return</emphasis> 4; 
+    }
+  }
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    igraph_real_t value;
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[0] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(q)[0] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_index'>igraph_sparsemat_index</link></emphasis>(&amp;B, &amp;p, &amp;q, <emphasis>/*res=*/</emphasis> &amp;A, &amp;value);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+    <emphasis role="strong">if</emphasis> (value != <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[0], <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(q)[0])) { 
+      <emphasis role="strong">return</emphasis> 4; 
+    }
+  }
+
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;p);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;q);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;N);
+
+  <emphasis>/* Indexing only the rows or the columns */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;M, NROW, NCOL);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, NROW, NCOL, EDGES);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NROW-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, NCOL-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(M, r, c) + value;
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;p, I_NROW);
+  <emphasis role="strong">igraph_vector_int_init</emphasis>(&amp;q, I_NCOL);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;I_NROW; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, I_NROW-1);
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;I_NCOL; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(p)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(0, I_NCOL-1);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;N, 0, 0);
+  <emphasis role="strong">permute_rows</emphasis>(&amp;M, &amp;p, &amp;N);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_index'>igraph_sparsemat_index</link></emphasis>(&amp;B, &amp;p, 0, &amp;A, 0);
+
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;N)) { <emphasis role="strong">return</emphasis> 5; }
+  
+  <emphasis role="strong">permute_cols</emphasis>(&amp;M, &amp;q, &amp;N);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_index'>igraph_sparsemat_index</link></emphasis>(&amp;B, 0, &amp;q, &amp;A, 0);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_same</emphasis>(&amp;A, &amp;N)) { <emphasis role="strong">return</emphasis> 6; }
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;p);
+  <emphasis role="strong">igraph_vector_int_destroy</emphasis>(&amp;q);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;M);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;N);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat4.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat4.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat4.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat4.c.xml	2013-03-03 01:45:56.000000000 +0000
@@ -0,0 +1,288 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;cs/cs.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+
+igraph_bool_t <emphasis role="strong">check_solution</emphasis>(<emphasis role="strong">const</emphasis> igraph_sparsemat_t *A,
+			     <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *x,
+			     <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> *b) {
+
+  long int dim=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(x);
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> res;
+  int j, p;
+  igraph_real_t min, max;
+
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;res, b);
+  
+  <emphasis role="strong">for</emphasis> (j=0; j&lt;dim; j++) {
+    <emphasis role="strong">for</emphasis> (p=A-&gt;cs-&gt;p[j]; p &lt; A-&gt;cs-&gt;p[j+1]; p++) {
+      long int from=A-&gt;cs-&gt;i[p];
+      igraph_real_t value=A-&gt;cs-&gt;x[p];
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(res)[from] -= <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*x)[j] * value;
+    }
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_minmax'>igraph_vector_minmax</link></emphasis>(&amp;res, &amp;min, &amp;max);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);
+
+  <emphasis role="strong">return</emphasis> <emphasis role="strong">abs</emphasis>(min) &lt; 1e-15 &amp;&amp; <emphasis role="strong">abs</emphasis>(max) &lt; 1e-15;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_sparsemat_t A, B, C;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> b, x;
+  long int i;
+
+  <emphasis>/* lsolve */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/6)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, r);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {    
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_lsolve'>igraph_sparsemat_lsolve</link></emphasis>(&amp;B, &amp;b, &amp;x);
+
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;B, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 1; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis>/* ltsolve */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/6)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, r);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {    
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_ltsolve'>igraph_sparsemat_ltsolve</link></emphasis>(&amp;B, &amp;b, &amp;x);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;B, &amp;A, <emphasis>/*values=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;A, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 2; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis>/* usolve */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/6)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, r);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;B, &amp;A, <emphasis>/*values=*/</emphasis> 1);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {    
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_usolve'>igraph_sparsemat_usolve</link></emphasis>(&amp;A, &amp;b, &amp;x);
+
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;A, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 3; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES  
+
+  <emphasis>/* utsolve */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/6)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int r=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int c=<emphasis role="strong">RNG_INTEGER</emphasis>(0, r);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1,5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, r, c, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;B, &amp;A, <emphasis>/*values=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {    
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_utsolve'>igraph_sparsemat_utsolve</link></emphasis>(&amp;A, &amp;b, &amp;x);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;A, &amp;B, <emphasis>/*values=*/</emphasis> 1);
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;B, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 4; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES  
+
+  <emphasis>/* cholsol */</emphasis>
+  <emphasis>/* We need a positive definite matrix, so we create a full-rank</emphasis>
+<emphasis>     matrix first and then calculate A'A, which will be positive</emphasis>
+<emphasis>     definite. */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/6)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int from=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int to=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1, 5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, from, to, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_transpose'>igraph_sparsemat_transpose</link></emphasis>(&amp;B, &amp;A, <emphasis>/*values=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_multiply'>igraph_sparsemat_multiply</link></emphasis>(&amp;A, &amp;B, &amp;C);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_cholsol'>igraph_sparsemat_cholsol</link></emphasis>(&amp;C, &amp;b, &amp;x, <emphasis>/*order=*/</emphasis> 0);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;C, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 5; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;C);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis>/* lusol */</emphasis>
+
+<emphasis role="strong">#define</emphasis> DIM 10
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">EDGES</emphasis> (DIM*DIM/4)
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, EDGES+DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, <emphasis role="strong">RNG_INTEGER</emphasis>(1,3));
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;EDGES; i++) {
+    long int from=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    long int to=<emphasis role="strong">RNG_INTEGER</emphasis>(0, DIM-1);
+    igraph_real_t value=<emphasis role="strong">RNG_INTEGER</emphasis>(1, 5);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, from, to, value);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_dupl'>igraph_sparsemat_dupl</link></emphasis>(&amp;B);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;b, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(b)[i] = <emphasis role="strong">RNG_INTEGER</emphasis>(1,10);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;x, DIM);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_lusol'>igraph_sparsemat_lusol</link></emphasis>(&amp;B, &amp;b, &amp;x, <emphasis>/*order=*/</emphasis> 0, <emphasis>/*tol=*/</emphasis> 1e-10);
+  
+  <emphasis role="strong">if</emphasis> (! <emphasis role="strong">check_solution</emphasis>(&amp;B, &amp;x, &amp;b)) { <emphasis role="strong">return</emphasis> 6; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;b);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;x);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+
+<emphasis role="strong">#undef</emphasis> DIM
+<emphasis role="strong">#undef</emphasis> EDGES
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat5.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat5.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat5.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat5.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,352 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2009-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+
+<emphasis role="strong">#define</emphasis> EPS 1e-13
+
+
+<emphasis>/* Generic test for 1x1 matrices */</emphasis>
+void <emphasis role="strong">test_1x1</emphasis>(igraph_real_t value) {
+  igraph_sparsemat_t A, B;
+  igraph_matrix_t values, vectors;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values2;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, 1, 1, 1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, 0, value);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;values, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  options.mode=1;  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rnsolve'>igraph_sparsemat_arpack_rnsolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, &amp;vectors);
+  <emphasis role="strong">printf</emphasis>("rnsolve:\n  - eigenvalues:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("  - eigenvectors:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values2, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  options.mode=1;  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values2, &amp;vectors, IGRAPH_SPARSEMAT_SOLVE_LU);
+  <emphasis role="strong">printf</emphasis>("rssolve:\n  - eigenvalues:\n    "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values2);
+  <emphasis role="strong">printf</emphasis>("  - eigenvectors:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+}
+
+<emphasis>/* Generic test for 2x2 matrices */</emphasis>
+void <emphasis role="strong">test_2x2</emphasis>(igraph_real_t a, igraph_real_t b, igraph_real_t c, igraph_real_t d) {
+  igraph_sparsemat_t A, B;
+  igraph_matrix_t values, vectors;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values2;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+  options.mode=1; options.nev=2;
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, 2, 2, 4);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, 0, a);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 0, 1, b);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 1, 0, c);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, 1, 1, d);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;values, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rnsolve'>igraph_sparsemat_arpack_rnsolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, &amp;vectors);
+  <emphasis role="strong">printf</emphasis>("rnsolve:\n  - eigenvalues:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("  - eigenvectors:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (b == c) {
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values2, 0);
+    <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+    <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+            &amp;values2, &amp;vectors, IGRAPH_SPARSEMAT_SOLVE_QR);
+    <emphasis role="strong">printf</emphasis>("rssolve:\n  - eigenvalues:\n    "); <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values2);
+    <emphasis role="strong">printf</emphasis>("  - eigenvectors:\n    "); <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values2);
+    <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_sparsemat_t A, B;
+  igraph_matrix_t vectors, values2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values;
+  long int i;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  igraph_real_t min, max;
+  igraph_t g1, g2, g3;
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Identity matrix */</emphasis>
+<emphasis role="strong">#define</emphasis> DIM 10
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+  options.mode=1;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> 0, <emphasis>/*solvemethod=*/</emphasis>0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] != 1.0) { <emphasis role="strong">return</emphasis> 1; }
+
+  options.mode=3;
+  options.sigma=2;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> 0,
+				  IGRAPH_SPARSEMAT_SOLVE_LU);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] != 1.0) { <emphasis role="strong">return</emphasis> 21; }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0, 
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> 0,
+				  IGRAPH_SPARSEMAT_SOLVE_QR);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] != 1.0) { <emphasis role="strong">return</emphasis> 31; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);  
+
+<emphasis role="strong">#undef</emphasis> DIM
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Diagonal matrix */</emphasis>
+<emphasis role="strong">#define</emphasis> DIM 10
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, DIM);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;DIM; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, i, i, i+1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  
+  options.mode=1;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> &amp;vectors, 
+				  <emphasis>/*solvemethod=*/</emphasis> 0);
+  <emphasis role="strong">if</emphasis> ( <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] - DIM) &gt; EPS ) {
+    <emphasis role="strong">printf</emphasis>("VECTOR(values)[0] numerical precision is only %g, should be %g",
+			<emphasis role="strong">fabs</emphasis>((double)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0]-DIM), EPS);
+	<emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">if</emphasis> ( <emphasis role="strong">fabs</emphasis>(<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, DIM-1, 0)) - 1.0) &gt; EPS) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, DIM-1, 0) = 0.0;
+  <emphasis role="strong"><link linkend='igraph_matrix_minmax'>igraph_matrix_minmax</link></emphasis>(&amp;vectors, &amp;min, &amp;max);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(min) &gt; EPS) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(max) &gt; EPS) { <emphasis role="strong">return</emphasis> 3; }
+
+  options.mode=3;
+  options.sigma=11;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> &amp;vectors,
+				  IGRAPH_SPARSEMAT_SOLVE_LU);
+  <emphasis role="strong">if</emphasis> ( <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] - DIM) &gt; EPS ) {
+    <emphasis role="strong">printf</emphasis>("VECTOR(values)[0] numerical precision is only %g, should be %g",
+			<emphasis role="strong">fabs</emphasis>((double)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0]-DIM), EPS);
+	<emphasis role="strong">return</emphasis> 22;
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, <emphasis>/*vectors=*/</emphasis> &amp;vectors,
+				  IGRAPH_SPARSEMAT_SOLVE_QR);
+  <emphasis role="strong">if</emphasis> ( <emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] - DIM) &gt; EPS ) {
+    <emphasis role="strong">printf</emphasis>("VECTOR(values)[0] numerical precision is only %g, should be %g",
+			<emphasis role="strong">fabs</emphasis>((double)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0]-DIM), EPS);
+    <emphasis role="strong">return</emphasis> 32;
+  }
+
+  <emphasis role="strong">if</emphasis> ( <emphasis role="strong">fabs</emphasis>(<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, DIM-1, 0)) - 1.0) &gt; EPS) { <emphasis role="strong">return</emphasis> 23; }
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, DIM-1, 0) = 0.0;
+  <emphasis role="strong"><link linkend='igraph_matrix_minmax'>igraph_matrix_minmax</link></emphasis>(&amp;vectors, &amp;min, &amp;max);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(min) &gt; EPS) { <emphasis role="strong">return</emphasis> 23; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(max) &gt; EPS) { <emphasis role="strong">return</emphasis> 23; }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+<emphasis role="strong">#undef</emphasis> DIM
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* A tree, plus a ring */</emphasis>
+<emphasis role="strong">#define</emphasis> DIM 10
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g1, DIM, <emphasis>/*children=*/</emphasis> 2, IGRAPH_TREE_UNDIRECTED);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g2, DIM, IGRAPH_UNDIRECTED, <emphasis>/*mutual=*/</emphasis> 0, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_union'>igraph_union</link></emphasis>(&amp;g3, &amp;g1, &amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;g3, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g3);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;values, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  
+  options.mode=1;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, &amp;vectors, <emphasis>/*solvemethod=*/</emphasis> 0);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0) &lt; 0.0) { 
+    <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;vectors, -1.0);
+  }
+  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+
+  options.mode=3;
+  options.sigma=<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(values)[0] * 1.1;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, &amp;vectors, 
+				  IGRAPH_SPARSEMAT_SOLVE_LU);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0) &lt; 0.0) { 
+    <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;vectors, -1.0);
+  }  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rssolve'>igraph_sparsemat_arpack_rssolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values, &amp;vectors, 
+				  IGRAPH_SPARSEMAT_SOLVE_QR);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0) &lt; 0.0) { 
+    <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;vectors, -1.0);
+  }  
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;values);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+<emphasis role="strong">#undef</emphasis> DIM
+
+  <emphasis role="strong">printf</emphasis>("--\n");
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* A directed tree and a directed, mutual ring */</emphasis>
+<emphasis role="strong">#define</emphasis> DIM 10
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g1, DIM, <emphasis>/*children=*/</emphasis> 2, IGRAPH_TREE_OUT);
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g2, DIM, IGRAPH_DIRECTED, <emphasis>/*mutual=*/</emphasis> 1, <emphasis>/*circular=*/</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_union'>igraph_union</link></emphasis>(&amp;g3, &amp;g1, &amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;g3, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g3);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;values2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+  
+  options.mode=1;
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rnsolve'>igraph_sparsemat_arpack_rnsolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values2, &amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0) &lt; 0.0) { 
+    <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;vectors, -1.0);
+  }
+  
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;values2);
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;vectors);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;values2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+<emphasis role="strong">#undef</emphasis> DIM
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* A small test graph */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g1, 11, IGRAPH_DIRECTED,
+	       0, 1, 1, 3, 1, 8, 2, 10, 3, 6, 3, 10, 4, 2, 5, 4, 
+	       6, 1, 6, 4, 7, 9, 8, 5, 8, 7, 9, 8, 10, 0,
+	       -1);
+
+  <emphasis role="strong"><link linkend='igraph_get_sparsemat'>igraph_get_sparsemat</link></emphasis>(&amp;g1, &amp;A);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;A, &amp;B);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;values2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;vectors, 0, 0);
+
+  options.mode=1;  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_arpack_rnsolve'>igraph_sparsemat_arpack_rnsolve</link></emphasis>(&amp;B, &amp;options, <emphasis>/*storage=*/</emphasis> 0,
+				  &amp;values2, &amp;vectors);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(vectors, 0, 0) &lt; 0.0) { 
+    <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;vectors, -1.0);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;values2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;vectors);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;B);
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Testing the special case solver for 1x1 matrices */</emphasis>
+  <emphasis role="strong">printf</emphasis>("--\n");
+  <emphasis role="strong">test_1x1</emphasis>(2);
+  <emphasis role="strong">test_1x1</emphasis>(0);
+  <emphasis role="strong">test_1x1</emphasis>(-3);
+
+  <emphasis>/***********************************************************************/</emphasis>
+
+  <emphasis>/* Testing the special case solver for 2x2 matrices */</emphasis>
+  <emphasis role="strong">printf</emphasis>("--\n");
+  <emphasis role="strong">test_2x2</emphasis>(1, 2, 2, 4);      <emphasis>/* symmetric */</emphasis>
+  <emphasis role="strong">test_2x2</emphasis>(1, 2, 3, 4);      <emphasis>/* non-symmetric, real eigenvalues */</emphasis>
+  <emphasis role="strong">test_2x2</emphasis>(1, -5, 10, 4);    <emphasis>/* non-symmetric, complex eigenvalues */</emphasis>
+  <emphasis role="strong">test_2x2</emphasis>(0, 0, 0, 0);      <emphasis>/* symmetric, pathological */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat6.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat6.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat6.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat6.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,64 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_sparsemat.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t mat, mat2, mat3;
+  igraph_sparsemat_t spmat, spmat2;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+<emphasis role="strong">#define</emphasis> NROW 10
+<emphasis role="strong">#define</emphasis> NCOL 7  
+<emphasis role="strong">#define</emphasis> NZERO 15
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, NROW, NCOL);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;NZERO; i++) {
+    int r=<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, NROW-1);
+    int c=<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, NCOL-1);
+    igraph_real_t val=<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10);
+    <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat, r, c) = val;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_as_sparsemat'>igraph_matrix_as_sparsemat</link></emphasis>(&amp;spmat, &amp;mat, <emphasis>/*tol=*/</emphasis> 1e-14);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat2, &amp;spmat);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat2)) { <emphasis role="strong">return</emphasis> 1; }
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat3, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat3, &amp;spmat2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat3)) { <emphasis role="strong">return</emphasis> 2; }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat3);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat7.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat7.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat7.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat7.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,78 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM1 10
+<emphasis role="strong">#define</emphasis> DIM2 5
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">INT</emphasis>(a) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, (a)))
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t mat;
+  igraph_sparsemat_t spmat, spmat2;
+  int i;
+  igraph_real_t m1, m2;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 1, 2, -1.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 3, 2, 10.0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  } 
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 1, 2, -1.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 3, 2, 10.0);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat2);
+  m1=<emphasis role="strong">igraph_sparsemat_min</emphasis>(&amp;spmat2);
+  m2=<emphasis role="strong"><link linkend='igraph_matrix_min'>igraph_matrix_min</link></emphasis>(&amp;mat);
+  <emphasis role="strong">if</emphasis> (m1 != m2) {
+    <emphasis role="strong">printf</emphasis>("%f %f\n", m1, m2);
+    <emphasis role="strong">return</emphasis> 1; 
+  }
+  m1=<emphasis role="strong">igraph_sparsemat_max</emphasis>(&amp;spmat2);
+  m2=<emphasis role="strong"><link linkend='igraph_matrix_max'>igraph_matrix_max</link></emphasis>(&amp;mat);
+  <emphasis role="strong">if</emphasis> (m1 != m2) {
+    <emphasis role="strong">printf</emphasis>("%f %f\n", m1, m2);
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong">igraph_sparsemat_minmax</emphasis>(&amp;spmat2, &amp;m1, &amp;m2);
+  <emphasis role="strong">if</emphasis> (m1 != <emphasis role="strong"><link linkend='igraph_matrix_min'>igraph_matrix_min</link></emphasis>(&amp;mat)) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">if</emphasis> (m2 != <emphasis role="strong"><link linkend='igraph_matrix_max'>igraph_matrix_max</link></emphasis>(&amp;mat)) { <emphasis role="strong">return</emphasis> 4; }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+  
+  
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat8.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat8.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat8.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat8.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,185 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM1 10
+<emphasis role="strong">#define</emphasis> DIM2 5
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">INT</emphasis>(a) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, (a)))
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t mat, mat2;
+  igraph_sparsemat_t spmat, spmat2;
+  int i, j, nz1, nz2;
+  igraph_real_t m1, m2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> sums1, sums2;
+  
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis>/* COPY */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_copy'>igraph_sparsemat_copy</link></emphasis>(&amp;spmat2, &amp;spmat);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat2, &amp;spmat2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat2)) { <emphasis role="strong">return</emphasis> 1;}
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_copy'>igraph_sparsemat_copy</link></emphasis>(&amp;spmat, &amp;spmat2);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat2, &amp;spmat);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat2)) { <emphasis role="strong">return</emphasis> 2; }
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+
+  <emphasis>/* COLSUMS, ROWSUMS */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;sums1, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;sums2, 0);
+  <emphasis role="strong">igraph_sparsemat_colsums</emphasis>(&amp;spmat, &amp;sums1);
+  <emphasis role="strong"><link linkend='igraph_matrix_colsum'>igraph_matrix_colsum</link></emphasis>(&amp;mat, &amp;sums2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;sums1, &amp;sums2)) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong">igraph_sparsemat_colsums</emphasis>(&amp;spmat2, &amp;sums1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;sums1, &amp;sums2)) { <emphasis role="strong">return</emphasis> 4; }
+  
+  <emphasis role="strong">igraph_sparsemat_rowsums</emphasis>(&amp;spmat, &amp;sums1);
+  <emphasis role="strong"><link linkend='igraph_matrix_rowsum'>igraph_matrix_rowsum</link></emphasis>(&amp;mat, &amp;sums2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;sums1, &amp;sums2)) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong">igraph_sparsemat_rowsums</emphasis>(&amp;spmat2, &amp;sums1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_all_e'>igraph_vector_all_e</link></emphasis>(&amp;sums1, &amp;sums2)) { <emphasis role="strong">return</emphasis> 6; }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;sums1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;sums2);
+
+  <emphasis>/* COUNT_NONZERO, COUNT_NONZEROTOL */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 1, 2, 1.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 1, 2, 1.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, 1, 3, 1e-12);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat2);
+
+  nz1=<emphasis role="strong">igraph_sparsemat_count_nonzero</emphasis>(&amp;spmat2);
+  <emphasis role="strong">for</emphasis> (nz2=0, i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;mat); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;mat); j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat, i, j) != 0) { nz2++; }
+    }
+  }
+  <emphasis role="strong">if</emphasis> (nz1 != nz2) { <emphasis role="strong">printf</emphasis>("%i %i\n", nz1, nz2); <emphasis role="strong">return</emphasis> 7; }
+  
+  nz1=<emphasis role="strong">igraph_sparsemat_count_nonzerotol</emphasis>(&amp;spmat2, 1e-10);
+  <emphasis role="strong">for</emphasis> (nz2=0, i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;mat); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;mat); j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">fabs</emphasis>(<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat, i, j)) &gt;= 1e-10) { nz2++; }
+    }
+  }
+  <emphasis role="strong">if</emphasis> (nz1 != nz2) { <emphasis role="strong">printf</emphasis>("%i %i\n", nz1, nz2); <emphasis role="strong">return</emphasis> 8; }
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+
+  <emphasis>/* SCALE */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_scale'>igraph_sparsemat_scale</link></emphasis>(&amp;spmat, 2.0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_scale'>igraph_sparsemat_scale</link></emphasis>(&amp;spmat2, 2.0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat2, &amp;spmat2);
+  <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;mat, 1.0/2.0);
+  <emphasis role="strong"><link linkend='igraph_matrix_scale'>igraph_matrix_scale</link></emphasis>(&amp;mat2, 1.0/2.0);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat2)) { <emphasis role="strong">return</emphasis> 9; }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+
+  <emphasis>/* ADDROWS, ADDCOLS */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;spmat, DIM1, DIM2, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;spmat, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), 1.0);
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;spmat, &amp;spmat2);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_add_rows'>igraph_sparsemat_add_rows</link></emphasis>(&amp;spmat, 3); 
+  <emphasis role="strong"><link linkend='igraph_sparsemat_add_cols'>igraph_sparsemat_add_cols</link></emphasis>(&amp;spmat, 2);
+  
+  <emphasis role="strong"><link linkend='igraph_sparsemat_add_rows'>igraph_sparsemat_add_rows</link></emphasis>(&amp;spmat2, 3);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_add_cols'>igraph_sparsemat_add_cols</link></emphasis>(&amp;spmat2, 2);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat, &amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;mat2, &amp;spmat2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;mat, &amp;mat2)) { <emphasis role="strong">return</emphasis> 10; }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat2);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;spmat2);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat9.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat9.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat9.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat9.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,85 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM1 10
+<emphasis role="strong">#define</emphasis> DIM2 5
+<emphasis role="strong">#define</emphasis> DIM3 6
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">INT</emphasis>(a) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, (a)))
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">REAL</emphasis>() (<emphasis role="strong"><link linkend='igraph_rng_get_normal'>igraph_rng_get_normal</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, 1))
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_sparsemat_t sA, sB, sC;
+  igraph_matrix_t A1, A2, A3, B, C;
+  int i;
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;sA, DIM1, DIM2, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;sA, <emphasis role="strong">INT</emphasis>(DIM1-1), <emphasis role="strong">INT</emphasis>(DIM2-1), <emphasis role="strong">REAL</emphasis>());
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;sA, &amp;sB);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;sA);
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;sA, DIM2, DIM3, 20);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;sA, <emphasis role="strong">INT</emphasis>(DIM2-1), <emphasis role="strong">INT</emphasis>(DIM3-1), <emphasis role="strong">REAL</emphasis>());
+  }
+  <emphasis role="strong"><link linkend='igraph_sparsemat_compress'>igraph_sparsemat_compress</link></emphasis>(&amp;sA, &amp;sC);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;sA);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;B, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;B, &amp;sB);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;C, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;C, &amp;sC);
+  
+  <emphasis>/* All possible products */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_sparsemat_multiply'>igraph_sparsemat_multiply</link></emphasis>(&amp;sB, &amp;sC, &amp;sA);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A1, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_as_matrix'>igraph_sparsemat_as_matrix</link></emphasis>(&amp;A1, &amp;sA);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A2, 0, 0);
+  <emphasis role="strong">igraph_sparsemat_dense_multiply</emphasis>(&amp;B, &amp;sC, &amp;A2);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;A3, 0, 0);
+  <emphasis role="strong">igraph_sparsemat_multiply_by_dense</emphasis>(&amp;sB, &amp;C, &amp;A3);
+  
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;A1, &amp;A2) ||
+      !<emphasis role="strong"><link linkend='igraph_matrix_all_e'>igraph_matrix_all_e</link></emphasis>(&amp;A2, &amp;A3)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;sA);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;sB);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;sC);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A1);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;A3);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;B);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;C);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat_is_symmetric.c.xml igraph-0.6.5/examples/simple/igraph_sparsemat_is_symmetric.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_sparsemat_is_symmetric.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_sparsemat_is_symmetric.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,63 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#define</emphasis> DIM 10
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">INT</emphasis>(a) (<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, (a)))
+
+int <emphasis role="strong">main</emphasis>() {
+  int runs=100;
+  <emphasis role="strong">const</emphasis> int noelements=20;
+  igraph_sparsemat_t A;
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+
+  <emphasis role="strong">for</emphasis> (; runs &gt; 0; runs--) {
+
+    <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, noelements * 2);    
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;noelements; i++) {
+      int row=<emphasis role="strong">INT</emphasis>(DIM-1);
+      int col=<emphasis role="strong">INT</emphasis>(DIM-1);
+      int val=<emphasis role="strong">INT</emphasis>(100);
+      <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, row, col, val);
+      <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, col, row, val);
+    }
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_sparsemat_is_symmetric</emphasis>(&amp;A)) { <emphasis role="strong">return</emphasis> 1; }
+    <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+    <emphasis role="strong"><link linkend='igraph_sparsemat_init'>igraph_sparsemat_init</link></emphasis>(&amp;A, DIM, DIM, noelements);
+    <emphasis role="strong">for</emphasis> (i=0; i&lt;noelements; i++) {
+      <emphasis role="strong"><link linkend='igraph_sparsemat_entry'>igraph_sparsemat_entry</link></emphasis>(&amp;A, <emphasis role="strong">INT</emphasis>(DIM-1), <emphasis role="strong">INT</emphasis>(DIM-1), <emphasis role="strong">INT</emphasis>(100));
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_sparsemat_is_symmetric</emphasis>(&amp;A)) { <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;A);
+
+  }
+    
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_star.c.xml igraph-0.6.5/examples/simple/igraph_star.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_star.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_star.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,30 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_stochastic_imitation.c.xml igraph-0.6.5/examples/simple/igraph_stochastic_imitation.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_stochastic_imitation.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_stochastic_imitation.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,241 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/*</emphasis>
+<emphasis>  Test suite for stochastic imitation via uniform selection.</emphasis>
+<emphasis>  Copyright (C) 2011 Minh Van Nguyen </emphasis>&lt;nguyenminh2@gmail.com&gt;
+
+<emphasis>  This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>  it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>  the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>  (at your option) any later version.</emphasis>
+
+<emphasis>  This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>  but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>  GNU General Public License for more details.</emphasis>
+
+<emphasis>  You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>  along with this program; if not, write to the Free Software</emphasis>
+<emphasis>  Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA</emphasis>
+<emphasis>  02110-1301 USA</emphasis>
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis>/* test parameters structure */</emphasis>
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> {
+  igraph_t *graph;
+  igraph_integer_t vertex;
+  igraph_imitate_algorithm_t algo;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *quantities;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *strategies;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *known_strats;
+  igraph_neimode_t mode;
+  int retval;
+} strategy_test_t;
+
+<emphasis>/* Error tests. That is, we expect error codes to be returned from such tests.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">error_tests</emphasis>() {
+  igraph_t g, h;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat;
+  int i, n, ret;
+  strategy_test_t *test;
+
+  <emphasis>/* nonempty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n vertices*/</emphasis> 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;h, 0, 0);         <emphasis>/* empty graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;quant, 1);  <emphasis>/* quantities vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;strat, 2);  <emphasis>/* strategies vector */</emphasis>
+
+  <emphasis>/* test parameters */</emphasis>
+  <emphasis>/*graph--vertex--algo--quantities--strategies--known_strats--mode--retval*/</emphasis>
+  <emphasis>/* null pointer for graph */</emphasis>
+  strategy_test_t null_graph = {NULL, 0, IGRAPH_IMITATE_BLIND, NULL, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for quantities vector */</emphasis>
+  strategy_test_t null_quant = {&amp;g, 0, IGRAPH_IMITATE_BLIND, NULL, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* null pointer for strategies vector */</emphasis>
+  strategy_test_t null_strat = {&amp;g, 0, IGRAPH_IMITATE_BLIND, &amp;quant, NULL, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* empty graph */</emphasis>
+  strategy_test_t empty_graph = {&amp;h, 0, IGRAPH_IMITATE_BLIND, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of quantities vector different from number of vertices */</emphasis>
+  strategy_test_t qdiff_length = {&amp;g, 0, IGRAPH_IMITATE_BLIND, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  <emphasis>/* length of strategies vector different from number of vertices */</emphasis>
+  strategy_test_t sdiff_length = {&amp;g, 0, IGRAPH_IMITATE_BLIND, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  strategy_test_t unknown_algo = {&amp;g, 0, -1, &amp;quant, &amp;strat, NULL, IGRAPH_ALL, IGRAPH_EINVAL};
+  strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;null_graph,
+                                   <emphasis>/* 2 */</emphasis> &amp;null_quant,
+                                   <emphasis>/* 3 */</emphasis> &amp;null_strat,
+                                   <emphasis>/* 4 */</emphasis> &amp;empty_graph,
+                                   <emphasis>/* 5 */</emphasis> &amp;qdiff_length,
+                                   <emphasis>/* 6 */</emphasis> &amp;sdiff_length,
+                                   <emphasis>/* 7 */</emphasis> &amp;unknown_algo};
+  <emphasis>/* Run the error tests. We expect error to be raised for each test. */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+  n = 7;
+  i = 0;
+  <emphasis role="strong">while</emphasis> (i &lt; n) {
+    test = all_checks[i];
+    ret = <emphasis role="strong"><link linkend='igraph_stochastic_imitation'>igraph_stochastic_imitation</link></emphasis>(test-&gt;graph, test-&gt;vertex, test-&gt;algo,
+                                      test-&gt;quantities, test-&gt;strategies,
+                                      test-&gt;mode);
+    <emphasis role="strong">if</emphasis> (ret != test-&gt;retval) {
+      <emphasis role="strong">printf</emphasis>("Error test no. %d failed.\n", (int)(i + 1));
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    i++;
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;h);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* Updating the strategy of an isolated vertex. In this case, the strategies</emphasis>
+<emphasis> * vector should not change at all.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">isolated_vertex_test</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat, v;
+  int i, ret;
+
+  <emphasis>/* graph with one isolated vertex */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n vertices*/</emphasis> 0, IGRAPH_UNDIRECTED, 0,1, 1,2, 2,0, -1);
+  <emphasis role="strong"><link linkend='igraph_add_vertices'>igraph_add_vertices</link></emphasis>(&amp;g, 1, 0);  <emphasis>/* new vertex 3 is isolated */</emphasis>
+  <emphasis>/* quantities vector: all vertices have the same fitness */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, 4, 0.25, 0.25, 0.25, 0.25);
+  <emphasis>/* strategies vector: 0 means aggressive strategy; 1 means passive */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, 4, 1.0, 0.0, 1.0, 0.0);
+  <emphasis>/* make a copy of the original strategies vector for comparison later on */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;v, &amp;strat);
+  <emphasis>/* Now update strategy of vertex 3. Since this vertex is isolated, no */</emphasis>
+  <emphasis>/* strategy update would take place. The resulting strategies vector */</emphasis>
+  <emphasis>/* would be the same as it was originally. */</emphasis>
+  ret = <emphasis role="strong"><link linkend='igraph_stochastic_imitation'>igraph_stochastic_imitation</link></emphasis>(<emphasis>/*graph*/</emphasis> &amp;g,
+                                    <emphasis>/*vertex*/</emphasis> 3,
+                                    <emphasis>/*algorithm*/</emphasis> IGRAPH_IMITATE_BLIND,
+                                    <emphasis>/*quantities*/</emphasis> &amp;quant,
+                                    <emphasis>/*strategies*/</emphasis> &amp;strat,
+                                    <emphasis>/*mode*/</emphasis> IGRAPH_ALL);
+  <emphasis role="strong">if</emphasis> (ret) {
+    <emphasis role="strong">printf</emphasis>("Isolated vertex test failed.\n");
+    <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+  }
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;strat); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(strat)[i] != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]) {
+      <emphasis role="strong">printf</emphasis>("Isolated vertex test failed.\n");
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+<emphasis>/* A game on the Petersen graph. This graph has 10 vertices and 15 edges. The</emphasis>
+<emphasis> * Petersen graph is initialized with a default quantities vector and a</emphasis>
+<emphasis> * default strategies vector. Some vertices are chosen for strategy revision,</emphasis>
+<emphasis> * each one via a different stochastic imitation rule.</emphasis>
+<emphasis> */</emphasis>
+int <emphasis role="strong">petersen_game_test</emphasis>() {
+  igraph_t g;
+  igraph_bool_t success;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> quant, strat, stratcopy, *knownstrats;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> known0, known2, known4;
+  int i, k, n, nedge, nvert, ret;
+  strategy_test_t *test;
+
+  <emphasis>/* the Petersen graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, <emphasis>/*n vertices*/</emphasis> 0, IGRAPH_UNDIRECTED,
+               0,1,0,4,0,5, 1,2,1,6, 2,3,2,7, 3,4,3,8, 4,9,
+               5,7,5,8, 6,8,6,9, 7,9, -1);
+  nedge = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g);
+  nvert = <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis>/* Strategies vector, one strategy for each vertex. Thus vec[i] is the */</emphasis>
+  <emphasis>/* strategy of vertex i. The strategy space is: {0, 1, 2, 3}. */</emphasis>
+  <emphasis>/* Each strategy should be an integer. */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;strat, nvert,
+                          1.0, 1.0, 2.0, 2.0, 0.0,
+                          0.0, 0.0, 1.0, 2.0, 3.0);
+  <emphasis>/* Quantities vector, one quantity per vertex. Thus vec[i] is the */</emphasis>
+  <emphasis>/* quantity for vertex i. */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;quant, nvert,
+                          0.3, 1.1, 0.5, 1.0, 0.9,
+                          0.8, 0.4, 0.1, 0.7, 0.7);
+  <emphasis>/* parameter settings and known results */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known0, 2, 0.0, 1.0);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known2, 2, 1.0, 2.0);
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;known4, 2, 0.0, 2.0);
+  <emphasis>/*graph--vertex--algo--quantities--strategies--known_strats--mode--retval*/</emphasis>
+  strategy_test_t blind0 = {&amp;g, 0, IGRAPH_IMITATE_BLIND, &amp;quant, NULL, &amp;known0, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t augmented4 = {&amp;g, 4, IGRAPH_IMITATE_AUGMENTED, &amp;quant, NULL, &amp;known4, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t contracted2 = {&amp;g, 2, IGRAPH_IMITATE_CONTRACTED, &amp;quant, NULL, &amp;known2, IGRAPH_ALL, IGRAPH_SUCCESS};
+  strategy_test_t *all_checks[] = {<emphasis>/* 1 */</emphasis> &amp;blind0,
+                                   <emphasis>/* 2 */</emphasis> &amp;augmented4,
+                                   <emphasis>/* 3 */</emphasis> &amp;contracted2};
+  <emphasis>/* run the tests */</emphasis>
+  n = 3;
+  i = 0;
+  <emphasis role="strong">while</emphasis> (i &lt; n) {
+    test = all_checks[i];
+    <emphasis role="strong"><link linkend='igraph_vector_copy'>igraph_vector_copy</link></emphasis>(&amp;stratcopy, &amp;strat);
+    ret = <emphasis role="strong"><link linkend='igraph_stochastic_imitation'>igraph_stochastic_imitation</link></emphasis>(test-&gt;graph, test-&gt;vertex, test-&gt;algo,
+                                      test-&gt;quantities, &amp;stratcopy,
+                                      test-&gt;mode);
+    <emphasis role="strong">if</emphasis> (ret) {
+      <emphasis role="strong">printf</emphasis>("Stochastic imitation failed for vertex %d.\n",
+             (int)test-&gt;vertex);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis>/* If the updated strategy for the vertex matches one of the known */</emphasis>
+    <emphasis>/* strategies, then success. Default to failure. */</emphasis>
+    success = 0;
+    knownstrats = test-&gt;known_strats;
+    <emphasis role="strong">for</emphasis> (k = 0; k &lt; <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(knownstrats); k++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*knownstrats)[k] == <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(stratcopy)[test-&gt;vertex]) {
+        success = 1;
+        <emphasis role="strong">break</emphasis>;
+      }
+    }
+    <emphasis role="strong">if</emphasis> (!success) {
+      <emphasis role="strong">printf</emphasis>("Stochastic imitation failed for vertex %d.\n",
+             (int)test-&gt;vertex);
+      <emphasis role="strong">return</emphasis> IGRAPH_FAILURE;
+    }
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;stratcopy);
+    i++;
+  }
+  <emphasis>/* clean up */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;known4);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;quant);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;strat);
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  int ret;
+
+  ret = <emphasis role="strong">error_tests</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+  ret = <emphasis role="strong">isolated_vertex_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+  ret = <emphasis role="strong">petersen_game_test</emphasis>();
+  <emphasis role="strong">if</emphasis> (ret)
+    <emphasis role="strong">return</emphasis> ret;
+
+  <emphasis role="strong">return</emphasis> IGRAPH_SUCCESS;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_strvector.c.xml igraph-0.6.5/examples/simple/igraph_strvector.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_strvector.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_strvector.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,191 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">strvector_print</emphasis>(<emphasis role="strong">const</emphasis> igraph_strvector_t *sv) {
+  long int i, s=<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(sv);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;s; i++) {
+    <emphasis role="strong">printf</emphasis>("---%s---\n", <emphasis role="strong"><link linkend='STR'>STR</link></emphasis>(*sv, i));
+  }
+}
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_strvector_t sv1, sv2;
+  char *str1, *str2;
+  int i;
+
+  <emphasis>/* igraph_strvector_init, igraph_strvector_destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 10);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+
+  <emphasis>/* igraph_strvector_get, igraph_strvector_set */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "zero");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "one");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "two");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 3, "three");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 4, "four");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+
+  <emphasis>/* igraph_strvector_remove_section, igraph_strvector_remove, </emphasis>
+<emphasis>     igraph_strvector_resize, igraph_strvector_size */</emphasis>
+  <emphasis role="strong">igraph_strvector_remove_section</emphasis>(&amp;sv1, 0, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 10);
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "zero");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "one");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "two");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 3, "three");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 4, "four");
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 10);
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "zero");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "one");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "two");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 3, "three");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 4, "four");
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }  
+
+  <emphasis>/* igraph_strvector_move_interval */</emphasis>
+  <emphasis role="strong">igraph_strvector_move_interval</emphasis>(&amp;sv1, 3, 5, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+
+  <emphasis>/* igraph_strvector_copy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_copy'>igraph_strvector_copy</link></emphasis>(&amp;sv2, &amp;sv1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv2); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv2, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv2);
+  <emphasis role="strong"><link linkend='igraph_strvector_copy'>igraph_strvector_copy</link></emphasis>(&amp;sv2, &amp;sv1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv2) != 0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv2);
+
+  <emphasis>/* igraph_strvector_add */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;sv1, "zeroth");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;sv1, "first");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;sv1, "second");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;sv1, "third");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;sv1, "fourth");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1); i++) {
+    <emphasis role="strong"><link linkend='igraph_strvector_get'>igraph_strvector_get</link></emphasis>(&amp;sv1, i, &amp;str1);
+    <emphasis role="strong">printf</emphasis>("---%s---\n", str1);
+  }
+
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_strvector_permdelete */</emphasis>
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_strvector_remove_negidx */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+
+  <emphasis>/* append */</emphasis>
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv2, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_append'>igraph_strvector_append</link></emphasis>(&amp;sv1, &amp;sv2);
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 3);
+  <emphasis role="strong"><link linkend='igraph_strvector_append'>igraph_strvector_append</link></emphasis>(&amp;sv1, &amp;sv2);
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  <emphasis role="strong">printf</emphasis>("---\n");   
+
+  <emphasis role="strong"><link linkend='igraph_strvector_append'>igraph_strvector_append</link></emphasis>(&amp;sv2, &amp;sv1);
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv2);
+  <emphasis role="strong">printf</emphasis>("---\n");   
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "0");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "1");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "2");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv2, 0, "3");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv2, 1, "4");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv2, 2, "5");
+  <emphasis role="strong"><link linkend='igraph_strvector_append'>igraph_strvector_append</link></emphasis>(&amp;sv1, &amp;sv2);
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv2);
+  
+  <emphasis>/* clear */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 3);
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "0");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "1");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "2");
+  <emphasis role="strong"><link linkend='igraph_strvector_clear'>igraph_strvector_clear</link></emphasis>(&amp;sv1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_strvector_size'>igraph_strvector_size</link></emphasis>(&amp;sv1) != 0) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_strvector_resize'>igraph_strvector_resize</link></emphasis>(&amp;sv1, 4);
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "one");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "two");
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+
+  <emphasis>/* STR */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;sv1, 5);
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 0, "one");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 1, "two");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 2, "three");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 3, "four");
+  <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;sv1, 4, "five");
+  <emphasis role="strong">strvector_print</emphasis>(&amp;sv1);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;sv1);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 4;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_to_undirected.c.xml igraph-0.6.5/examples/simple/igraph_to_undirected.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_to_undirected.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_to_undirected.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_t g;
+  
+  <emphasis role="strong">igraph_vector_init_int</emphasis>(&amp;v, 2, 5, 5);
+  <emphasis role="strong"><link linkend='igraph_lattice'>igraph_lattice</link></emphasis>(&amp;g, &amp;v, 1, IGRAPH_DIRECTED, 1 <emphasis>/*mutual*/</emphasis>, 0 <emphasis>/*circular*/</emphasis>);
+  <emphasis role="strong"><link linkend='igraph_to_undirected'>igraph_to_undirected</link></emphasis>(&amp;g, IGRAPH_TO_UNDIRECTED_COLLAPSE, 
+		       <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">printf</emphasis>("---\n");
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 
+	       0,1, 2,1, 2,3, 2,3, 4,3, 4,3,
+	       5,6, 6,5, 6,7, 6,7, 7,6, 7,8, 7,8, 8,7, 8,7, 8,8, 9,9, 9,9,
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_to_undirected'>igraph_to_undirected</link></emphasis>(&amp;g, IGRAPH_TO_UNDIRECTED_MUTUAL,
+		       <emphasis>/*edge_comb=*/</emphasis> 0);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_topological_sorting.c.xml igraph-0.6.5/examples/simple/igraph_topological_sorting.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_topological_sorting.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_topological_sorting.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,98 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %d", (int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+void <emphasis role="strong">igraph_warning_handler_print_stdout</emphasis>(<emphasis role="strong">const</emphasis> char *reason, <emphasis role="strong">const</emphasis> char *file,
+					 int line, int igraph_errno) {
+  <emphasis role="strong">fprintf</emphasis>(stdout, "Warning: %s\n", reason);
+}
+
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, res;
+  igraph_bool_t is_dag;
+  int ret;
+
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(igraph_warning_handler_print_stdout);
+
+  <emphasis>/* Test graph taken from </emphasis>http://en.wikipedia.org/wiki/Topological_sorting
+<emphasis>   * @ 05.03.2006 */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 8, 1, 0, 3, 0, 4, 1, 3, 2, 4, 2, 7, \
+	       3, 5, 3, 6, 3, 7, 4, 6, -1);
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;res, 0);
+
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;is_dag);
+  <emphasis role="strong">if</emphasis> (!is_dag)
+    <emphasis role="strong">return</emphasis> 2;
+
+  <emphasis role="strong"><link linkend='igraph_topological_sorting'>igraph_topological_sorting</link></emphasis>(&amp;g, &amp;res, IGRAPH_OUT);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_topological_sorting'>igraph_topological_sorting</link></emphasis>(&amp;g, &amp;res, IGRAPH_IN);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+
+  <emphasis>/* Add a circle: 5 -&gt; 0 */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int</emphasis>(&amp;v, 2, 5, 0);
+  <emphasis role="strong"><link linkend='igraph_add_edges'>igraph_add_edges</link></emphasis>(&amp;g, &amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;is_dag);
+  <emphasis role="strong">if</emphasis> (is_dag)
+    <emphasis role="strong">return</emphasis> 3;
+  <emphasis role="strong"><link linkend='igraph_topological_sorting'>igraph_topological_sorting</link></emphasis>(&amp;g, &amp;res, IGRAPH_OUT);
+  <emphasis role="strong">print_vector</emphasis>(&amp;res, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Error handling */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_set_error_handler'>igraph_set_error_handler</link></emphasis>(<link linkend='igraph_error_handler_ignore'>igraph_error_handler_ignore</link>);
+
+  <emphasis>/* This graph is the same but undirected */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 8, 0, 0, 3, 0, 4, 1, 3, 2, 4, 2, 7, \
+	       3, 5, 3, 6, 3, 7, 4, 6, -1);
+  <emphasis role="strong"><link linkend='igraph_is_dag'>igraph_is_dag</link></emphasis>(&amp;g, &amp;is_dag);
+  <emphasis role="strong">if</emphasis> (is_dag)
+    <emphasis role="strong">return</emphasis> 4;
+  ret=<emphasis role="strong"><link linkend='igraph_topological_sorting'>igraph_topological_sorting</link></emphasis>(&amp;g, &amp;res, IGRAPH_ALL);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  ret=<emphasis role="strong"><link linkend='igraph_topological_sorting'>igraph_topological_sorting</link></emphasis>(&amp;g, &amp;res, IGRAPH_OUT);
+  <emphasis role="strong">if</emphasis> (ret != IGRAPH_EINVAL) {
+    <emphasis role="strong">return</emphasis> 1;
+  }  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;res);  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_transitive_closure_dag.c.xml igraph-0.6.5/examples/simple/igraph_transitive_closure_dag.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_transitive_closure_dag.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_transitive_closure_dag.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,51 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g, g2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> deg;
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 9, IGRAPH_DIRECTED,
+	       8,7, 7,6, 6,3, 6,0, 3,2, 3,1, 5,0, 4,1,
+	       -1);
+  <emphasis role="strong">igraph_transitive_closure_dag</emphasis>(&amp;g, &amp;g2);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g2) != <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g)) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g2) != 19) { <emphasis role="strong">return</emphasis> 1; }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;deg, 0);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g2, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_IN, IGRAPH_LOOPS);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_degree'>igraph_degree</link></emphasis>(&amp;g2, &amp;deg, <emphasis role="strong"><link linkend='igraph_vss_all'>igraph_vss_all</link></emphasis>(), IGRAPH_OUT, IGRAPH_LOOPS);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;deg);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;deg);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_transitivity.c.xml igraph-0.6.5/examples/simple/igraph_transitivity.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_transitivity.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_transitivity.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,95 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_real_t res;
+
+  <emphasis>/* Trivial cases */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 100, IGRAPH_UNDIRECTED, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_transitivity_undirected'>igraph_transitivity_undirected</link></emphasis>(&amp;g, &amp;res, IGRAPH_TRANSITIVITY_NAN);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">if</emphasis> (res != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 20, IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_transitivity_undirected'>igraph_transitivity_undirected</link></emphasis>(&amp;g, &amp;res, IGRAPH_TRANSITIVITY_NAN);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">if</emphasis> (res != 1) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* Degenerate cases */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED,
+		  0,  1,  2,  3,  4,  5, -1);
+  <emphasis role="strong"><link linkend='igraph_transitivity_undirected'>igraph_transitivity_undirected</link></emphasis>(&amp;g, &amp;res, IGRAPH_TRANSITIVITY_NAN);
+  <emphasis>/* res should be NaN here, any comparison must return false */</emphasis>
+  <emphasis role="strong">if</emphasis> (res == 0 || res &gt; 0 || res &lt; 0) {
+	<emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_transitivity_undirected'>igraph_transitivity_undirected</link></emphasis>(&amp;g, &amp;res, IGRAPH_TRANSITIVITY_ZERO);
+  <emphasis>/* res should be zero here */</emphasis>
+  <emphasis role="strong">if</emphasis> (res) {
+	<emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Zachary Karate club */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 0, IGRAPH_UNDIRECTED, 
+	       0,  1,  0,  2,  0,  3,  0,  4,  0,  5,
+	       0,  6,  0,  7,  0,  8,  0, 10,  0, 11,
+	       0, 12,  0, 13,  0, 17,  0, 19,  0, 21,
+	       0, 31,  1,  2,  1,  3,  1,  7,  1, 13,
+	       1, 17,  1, 19,  1, 21,  1, 30,  2,  3,
+	       2,  7,  2,  8,  2,  9,  2, 13,  2, 27,
+	       2, 28,  2, 32,  3,  7,  3, 12,  3, 13,
+	       4,  6,  4, 10,  5,  6,  5, 10,  5, 16,
+	       6, 16,  8, 30,  8, 32,  8, 33,  9, 33,
+	       13, 33, 14, 32, 14, 33, 15, 32, 15, 33,
+	       18, 32, 18, 33, 19, 33, 20, 32, 20, 33,
+	       22, 32, 22, 33, 23, 25, 23, 27, 23, 29,
+	       23, 32, 23, 33, 24, 25, 24, 27, 24, 31,
+	       25, 31, 26, 29, 26, 33, 27, 33, 28, 31,
+	       28, 33, 29, 32, 29, 33, 30, 32, 30, 33,
+	       31, 32, 31, 33, 32, 33,
+	       -1);  
+  
+  <emphasis role="strong"><link linkend='igraph_transitivity_undirected'>igraph_transitivity_undirected</link></emphasis>(&amp;g, &amp;res, IGRAPH_TRANSITIVITY_NAN);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">if</emphasis> (res != 0.2556818181818181767717) {
+    <emphasis role="strong">fprintf</emphasis>(stderr, "%f != %f\n", res, 0.2556818181818181767717);
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_tree.c.xml igraph-0.6.5/examples/simple/igraph_tree.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_tree.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_tree.c.xml	2013-03-03 01:45:57.000000000 +0000
@@ -0,0 +1,30 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_trie.c.xml igraph-0.6.5/examples/simple/igraph_trie.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_trie.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_trie.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,99 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_types_internal.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_trie_t trie;
+  long int id;
+  int i;
+  char *str;
+
+  <emphasis>/* init */</emphasis>
+  <emphasis role="strong">igraph_trie_init</emphasis>(&amp;trie, 0);
+
+  <emphasis>/* add and get values */</emphasis>
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "a", &amp;id);      <emphasis role="strong">printf</emphasis>("a:     %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "axon", &amp;id);   <emphasis role="strong">printf</emphasis>("axon:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis>/* check for existence */</emphasis>
+  <emphasis role="strong">igraph_trie_check</emphasis>(&amp;trie, "head", &amp;id); <emphasis role="strong">printf</emphasis>("head:  %li\n", id);
+  <emphasis role="strong">igraph_trie_check</emphasis>(&amp;trie, "alma", &amp;id); <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+   
+  <emphasis>/* destroy */</emphasis>
+  <emphasis role="strong">igraph_trie_destroy</emphasis>(&amp;trie);
+
+  <emphasis>/* the same with index */</emphasis>
+  <emphasis role="strong">igraph_trie_init</emphasis>(&amp;trie, 1);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "a", &amp;id);      <emphasis role="strong">printf</emphasis>("a:     %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "axon", &amp;id);   <emphasis role="strong">printf</emphasis>("axon:  %li\n", id);
+
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hello", &amp;id);  <emphasis role="strong">printf</emphasis>("hello: %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "hepp", &amp;id);   <emphasis role="strong">printf</emphasis>("hepp:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "alma", &amp;id);   <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+  <emphasis role="strong">igraph_trie_get</emphasis>(&amp;trie, "also", &amp;id);   <emphasis role="strong">printf</emphasis>("also:  %li\n", id);
+
+  <emphasis>/* check for existence */</emphasis>
+  <emphasis role="strong">igraph_trie_check</emphasis>(&amp;trie, "head", &amp;id); <emphasis role="strong">printf</emphasis>("head:  %li\n", id);
+  <emphasis role="strong">igraph_trie_check</emphasis>(&amp;trie, "alma", &amp;id); <emphasis role="strong">printf</emphasis>("alma:  %li\n", id);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong">igraph_trie_size</emphasis>(&amp;trie); i++) {
+    <emphasis role="strong">igraph_trie_idx</emphasis>(&amp;trie, i, &amp;str);
+    <emphasis role="strong">printf</emphasis>("%d: %s\n", i, str);
+  }
+  <emphasis role="strong">igraph_trie_destroy</emphasis>(&amp;trie);
+
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) <emphasis role="strong">return</emphasis> 1;
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_union.c.xml igraph-0.6.5/examples/simple/igraph_union.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_union.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_union.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,127 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, l=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;l; i++) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t left, right, uni;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  igraph_vector_ptr_t glist;
+  long int i;
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,2, 2,3, -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;left, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,2, 2,2, 2,4, -1); 
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;right, &amp;v, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis role="strong"><link linkend='igraph_union'>igraph_union</link></emphasis>(&amp;uni, &amp;left, &amp;right);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;uni, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;left);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;right);
+
+  <emphasis>/* Empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 0);
+  <emphasis role="strong"><link linkend='igraph_union_many'>igraph_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;uni) || <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;uni) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);  
+
+  <emphasis>/* Non-empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 10); 
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]=<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(igraph_t));
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1, 1,0, -1);
+    <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i], &amp;v, 0, IGRAPH_DIRECTED);    
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_union_many'>igraph_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;uni, stdout);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);  
+
+  <emphasis>/* Another non-empty graph list */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 10); 
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]=<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(igraph_t));
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, i,i+1, 1,0, -1);
+    <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i], &amp;v, 0, IGRAPH_DIRECTED);    
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_union_many'>igraph_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;uni, stdout);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);  
+  
+  <emphasis>/* Undirected graph list*/</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;glist, 10); 
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]=<emphasis role="strong">calloc</emphasis>(1, <emphasis role="strong">sizeof</emphasis>(igraph_t));
+    <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, i,i+1, 1,0, -1);
+    <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i], &amp;v, 0, IGRAPH_UNDIRECTED);    
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  }
+
+  <emphasis role="strong"><link linkend='igraph_union_many'>igraph_union_many</link></emphasis>(&amp;uni, &amp;glist);
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;uni, stdout);
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;glist); i++) {
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+    <emphasis role="strong">free</emphasis>(<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(glist)[i]);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;glist);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;uni);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_version.c.xml igraph-0.6.5/examples/simple/igraph_version.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_version.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_version.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,46 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;string.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  char tmp[100];
+  <emphasis role="strong">const</emphasis> char *string;
+  int major, minor, subminor;  
+  
+  <emphasis role="strong"><link linkend='igraph_version'>igraph_version</link></emphasis>(&amp;string, &amp;major, &amp;minor, &amp;subminor);
+  <emphasis role="strong">if</emphasis> (subminor != 0) { 
+    <emphasis role="strong">sprintf</emphasis>(tmp, "%i.%i.%i", major, minor, subminor);
+  } <emphasis role="strong">else</emphasis> {
+    <emphasis role="strong">sprintf</emphasis>(tmp, "%i.%i", major, minor);    
+  }
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">strcmp</emphasis>(string, tmp)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_vs_nonadj.c.xml igraph-0.6.5/examples/simple/igraph_vs_nonadj.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_vs_nonadj.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_vs_nonadj.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,66 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis> () {
+
+  igraph_t g;
+  igraph_vs_t vs;
+  igraph_vit_t vit;  
+  igraph_integer_t size;
+
+  <emphasis>/* empty graph, all vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_empty'>igraph_empty</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vs_nonadj'>igraph_vs_nonadj</link></emphasis>(&amp;vs, 0, IGRAPH_ALL);
+  <emphasis role="strong"><link linkend='igraph_vs_size'>igraph_vs_size</link></emphasis>(&amp;g, &amp;vs, &amp;size);
+  <emphasis role="strong">printf</emphasis>("%li ", (long int) size);
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(&amp;g, vs, &amp;vit);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit)) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int) <emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit));
+    <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* full graph, no vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_full'>igraph_full</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, IGRAPH_LOOPS);
+  <emphasis role="strong"><link linkend='igraph_vs_nonadj'>igraph_vs_nonadj</link></emphasis>(&amp;vs, 0, IGRAPH_ALL);
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(&amp;g, vs, &amp;vit);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit)) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int) <emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit));
+    <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_vs_seq.c.xml igraph-0.6.5/examples/simple/igraph_vs_seq.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_vs_seq.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_vs_seq.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,51 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_vs_t vs;
+  igraph_vit_t vit;
+  igraph_t g;
+  igraph_integer_t size;
+
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_UNDIRECTED, 0, 1);
+  <emphasis role="strong"><link linkend='igraph_vs_seq'>igraph_vs_seq</link></emphasis>(&amp;vs, 0, 9);
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(&amp;g, vs, &amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_size'>igraph_vs_size</link></emphasis>(&amp;g, &amp;vs, &amp;size);
+  <emphasis role="strong">printf</emphasis>("%li", (long int) size);
+  
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit)) {
+    <emphasis role="strong">printf</emphasis>(" %li", (long int)<emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit));
+    <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_vs_vector.c.xml igraph-0.6.5/examples/simple/igraph_vs_vector.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_vs_vector.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_vs_vector.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,83 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <emphasis role="strong">const</emphasis> <link linkend='igraph_vector_t'>igraph_vector_t</link> v=IGRAPH_VECTOR_NULL;
+  igraph_real_t edges[] = { 0,1, 1,2, 2,2, 2,3, 2,4, 3,4 };
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v2, v3;
+  long int i;
+  igraph_vit_t vit;
+  igraph_vs_t vs;
+  igraph_integer_t size;
+
+  <emphasis role="strong"><link linkend='igraph_vector_view'>igraph_vector_view</link></emphasis>(&amp;v, edges, <emphasis role="strong">sizeof</emphasis>(edges)/<emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;v, 0, IGRAPH_DIRECTED);
+
+  <emphasis>/* Create iterator based on a vector (view) */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 6);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[0]=0;   <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[1]=2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[2]=4;   <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[3]=0;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[4]=2;   <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[5]=4;
+
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(&amp;g, <emphasis role="strong"><link linkend='igraph_vss_vector'>igraph_vss_vector</link></emphasis>(&amp;v2), &amp;vit);
+
+  i=0;
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit)) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit) != <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[i]) {
+      <emphasis role="strong">return</emphasis> 1;
+    }
+    <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit);
+    i++;
+  }
+  <emphasis role="strong">if</emphasis> (i != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v2)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+
+  <emphasis>/* Create small vector iterator */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vs_vector_small'>igraph_vs_vector_small</link></emphasis>(&amp;vs, 0, 2, 4, 0, 2, 4, 2, -1);
+  <emphasis role="strong"><link linkend='igraph_vit_create'>igraph_vit_create</link></emphasis>(&amp;g, vs, &amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_size'>igraph_vs_size</link></emphasis>(&amp;g, &amp;vs, &amp;size);
+  <emphasis role="strong">printf</emphasis>("%li ", (long int) size);
+  <emphasis role="strong">for</emphasis> (; !<emphasis role="strong"><link linkend='IGRAPH_VIT_END'>IGRAPH_VIT_END</link></emphasis>(vit); <emphasis role="strong"><link linkend='IGRAPH_VIT_NEXT'>IGRAPH_VIT_NEXT</link></emphasis>(vit)) {
+    <emphasis role="strong">printf</emphasis>("%li ", (long int) <emphasis role="strong"><link linkend='IGRAPH_VIT_GET'>IGRAPH_VIT_GET</link></emphasis>(vit));
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+  
+  <emphasis role="strong"><link linkend='igraph_vit_destroy'>igraph_vit_destroy</link></emphasis>(&amp;vit);
+  <emphasis role="strong"><link linkend='igraph_vs_destroy'>igraph_vs_destroy</link></emphasis>(&amp;vs);
+
+  <emphasis>/* Clean up */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_weighted_adjacency.c.xml igraph-0.6.5/examples/simple/igraph_weighted_adjacency.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_weighted_adjacency.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_weighted_adjacency.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,109 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdarg.h&gt;
+
+void <emphasis role="strong">print</emphasis>(igraph_t *g) {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> el;
+  long int i, j, n;
+  char ch = <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(g) ? '&gt;' : '-';
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;el, 0);
+  <emphasis role="strong"><link linkend='igraph_get_edgelist'>igraph_get_edgelist</link></emphasis>(g, &amp;el, 0);
+  n = <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(g);
+
+  <emphasis role="strong">for</emphasis> (i=0, j=0; i&lt;n; i++, j+=2) {
+    <emphasis role="strong">printf</emphasis>("%ld --%c %ld: %ld\n",
+      (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(el)[j], ch, (long)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(el)[j+1], (long)<emphasis role="strong"><link linkend='EAN'>EAN</link></emphasis>(g, "weight", i)); 
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;el);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_matrix_t mat;
+  int m[4][4] = { { 0, 1, 2, 0 }, { 2, 0, 0, 1 }, { 0, 0, 1, 0 }, { 0, 1, 0, 0 } };
+  long int i, j;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;mat, 4, 4);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;4; i++) <emphasis role="strong">for</emphasis> (j=0; j&lt;4; j++) <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(mat, i, j) = m[i][j];
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+
+  <emphasis>/* [ 0 1 2 0 ]</emphasis>
+<emphasis>     [ 2 0 0 1 ]</emphasis>
+<emphasis>     [ 0 0 1 0 ]</emphasis>
+<emphasis>     [ 0 1 0 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_DIRECTED, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* [ 0 1 2 0 ]</emphasis>
+<emphasis>     [ - 0 0 1 ]</emphasis>
+<emphasis>     [ - - 1 0 ]</emphasis>
+<emphasis>     [ - - - 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_UPPER, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* [ 0 - - - ]</emphasis>
+<emphasis>     [ 2 0 - - ]</emphasis>
+<emphasis>     [ 0 0 1 - ]</emphasis>
+<emphasis>     [ 0 1 0 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_LOWER, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* [ 0 1 0 0 ]</emphasis>
+<emphasis>     [ 1 0 0 1 ]</emphasis>
+<emphasis>     [ 0 0 1 0 ]</emphasis>
+<emphasis>     [ 0 1 0 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_MIN, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* [ 0 2 2 0 ]</emphasis>
+<emphasis>     [ 2 0 0 1 ]</emphasis>
+<emphasis>     [ 2 0 1 0 ]</emphasis>
+<emphasis>     [ 0 1 0 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_MAX, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* [ 0 3 2 0 ]</emphasis>
+<emphasis>     [ 3 0 0 2 ]</emphasis>
+<emphasis>     [ 2 0 1 0 ]</emphasis>
+<emphasis>     [ 0 2 0 0 ] */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_weighted_adjacency'>igraph_weighted_adjacency</link></emphasis>(&amp;g, &amp;mat, IGRAPH_ADJ_PLUS, 0, <emphasis>/*loops=*/</emphasis> 1);
+  <emphasis role="strong">print</emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;mat);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 1;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_leda.c.xml igraph-0.6.5/examples/simple/igraph_write_graph_leda.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_leda.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_write_graph_leda.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,103 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>(int argc, char **argv) {
+  int i;
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> values;
+  igraph_strvector_t strvalues;
+  <emphasis role="strong">const</emphasis> char* strings[] = {"foo", "bar", "baz", "spam", "eggs", "bacon"};
+
+  <emphasis>/* Setting up attribute handler */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+
+  <emphasis>/* Saving directed graph, no attributes */</emphasis>  
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, <emphasis>/* directed = */</emphasis> 1,
+                     <emphasis>/* mutual   = */</emphasis> 0,
+                     <emphasis>/* circular = */</emphasis> 1);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, 0, 0);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Saving undirected graph, no attributes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, <emphasis>/* directed = */</emphasis> 0,
+                     <emphasis>/* mutual   = */</emphasis> 0,
+                     <emphasis>/* circular = */</emphasis> 1);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, 0, 0);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Saving directed graph with vertex attributes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, <emphasis>/* directed = */</emphasis> 1,
+                     <emphasis>/* mutual   = */</emphasis> 0,
+                     <emphasis>/* circular = */</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;values, 5, 9);
+  <emphasis role="strong"><link linkend='SETVANV'>SETVANV</link></emphasis>(&amp;g, "name", &amp;values);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, "name", 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='DELVAS'>DELVAS</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;strvalues, 5);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 5; i++)
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;strvalues, i, strings[i]);
+  <emphasis role="strong"><link linkend='SETVASV'>SETVASV</link></emphasis>(&amp;g, "name", &amp;strvalues);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, "name", 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;strvalues);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Saving undirected graph with edge attributes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, <emphasis>/* directed = */</emphasis> 0,
+                     <emphasis>/* mutual   = */</emphasis> 0,
+                     <emphasis>/* circular = */</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;values, 5, 9);
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "weight", &amp;values);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, 0, "weight");
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='DELEAS'>DELEAS</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;strvalues, 5);
+  <emphasis role="strong">for</emphasis> (i = 0; i &lt; 5; i++)
+    <emphasis role="strong"><link linkend='igraph_strvector_set'>igraph_strvector_set</link></emphasis>(&amp;strvalues, i, strings[i]);
+  <emphasis role="strong"><link linkend='SETEASV'>SETEASV</link></emphasis>(&amp;g, "weight", &amp;strvalues);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, 0, "weight");
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;strvalues);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* Saving undirected graph with edge attributes and large weights */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 5, <emphasis>/* directed = */</emphasis> 0,
+                     <emphasis>/* mutual   = */</emphasis> 0,
+                     <emphasis>/* circular = */</emphasis> 1);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;values, 123456789, 123456793);
+  <emphasis role="strong"><link linkend='SETEANV'>SETEANV</link></emphasis>(&amp;g, "weight", &amp;values);
+  <emphasis role="strong">igraph_write_graph_leda</emphasis>(&amp;g, stdout, 0, "weight");
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;values);
+  <emphasis role="strong">printf</emphasis>("===\n");
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_lgl.c.xml igraph-0.6.5/examples/simple/igraph_write_graph_lgl.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_lgl.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_write_graph_lgl.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,49 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+int <emphasis role="strong">main</emphasis>(int argc, char **argv) {
+
+  igraph_t g;
+  <link linkend='igraph_error_handler_t'>igraph_error_handler_t</link> *oldhandler;
+  FILE *ofile;
+  int ret;
+
+  <emphasis>/* This is not used right now, as we don't have attributes */</emphasis>
+  
+  <emphasis>/* Testing error handling */</emphasis>  
+<emphasis>/*   igraph_barabasi_game(&amp;g, 10, 1, 0, 0, IGRAPH_DIRECTED); */</emphasis>
+<emphasis>/*   oldhandler=igraph_set_error_handler(igraph_error_handler_ignore); */</emphasis>
+<emphasis>/*   ofile=fopen("test.txt", "w"); */</emphasis>
+<emphasis>/*   ret=igraph_write_graph_lgl(&amp;g, ofile, "names", "weights", 1); */</emphasis>
+<emphasis>/*   if (ret != IGRAPH_EINVAL) { */</emphasis>
+<emphasis>/*     return 1; */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   fclose(ofile); */</emphasis>
+<emphasis>/*   igraph_destroy(&amp;g); */</emphasis>
+<emphasis>/*   igraph_set_error_handler(oldhandler); */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_pajek.c.xml igraph-0.6.5/examples/simple/igraph_write_graph_pajek.c.xml
--- igraph-0.6.5~quantal1/examples/simple/igraph_write_graph_pajek.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/igraph_write_graph_pajek.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,76 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  igraph_strvector_t names;
+
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);
+  
+  <emphasis>/* save a simple ring graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_ring'>igraph_ring</link></emphasis>(&amp;g, 10, IGRAPH_DIRECTED, 0 <emphasis>/* mutual */</emphasis>, 1 <emphasis>/* circular */</emphasis>);
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+  
+  <emphasis>/* add some vertex attributes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;names, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "A");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "B");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "C");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "D");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "E");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "F");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "G");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "H");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "I");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "J");
+  <emphasis role="strong"><link linkend='SETVASV'>SETVASV</link></emphasis>(&amp;g, "id", &amp;names);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;names);
+
+  <emphasis>/* save the graph with vertex names */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_strvector_init'>igraph_strvector_init</link></emphasis>(&amp;names, 0);
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "escaping spaces");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "escaping \\backslashes\\");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "square");
+  <emphasis role="strong"><link linkend='igraph_strvector_add'>igraph_strvector_add</link></emphasis>(&amp;names, "escaping \"quotes\"");
+  <emphasis role="strong"><link linkend='SETVASV'>SETVASV</link></emphasis>(&amp;g, "shape", &amp;names);
+  <emphasis role="strong"><link linkend='igraph_strvector_destroy'>igraph_strvector_destroy</link></emphasis>(&amp;names);
+
+  <emphasis>/* save the graph with escaped shapes */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+
+  <emphasis>/* destroy the graph */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/indheap.c.xml igraph-0.6.5/examples/simple/indheap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/indheap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/indheap.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,32 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <emphasis>/* This is not used by any functions any more,</emphasis>
+<emphasis>     no need to test it right now */</emphasis>
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/levc-stress.c.xml igraph-0.6.5/examples/simple/levc-stress.c.xml
--- igraph-0.6.5~quantal1/examples/simple/levc-stress.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/levc-stress.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,68 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* vim:set sw=2 ts=2 sts=2 et: */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge, MA 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis>/* This is a test for bug #1002140, reported by Luiz Fernando </emphasis>
+<emphasis>   Bittencourt: </emphasis>https://bugs.launchpad.net/igraph/<emphasis>+bug/1002140 */</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  int k;	
+  <emphasis role="strong">for</emphasis>(k=0; k&lt;20; k++) { 
+    igraph_t g;
+    igraph_matrix_t merges;
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> membership;
+    long int i, j;
+    <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+    double modularity;
+    <link linkend='igraph_vector_t'>igraph_vector_t</link> history;
+    FILE *DLFile = <emphasis role="strong">fopen</emphasis>("input.dl","r");		
+    
+    <emphasis role="strong"><link linkend='igraph_read_graph_dl'>igraph_read_graph_dl</link></emphasis>(&amp;g, DLFile, <emphasis>/*directed=*/</emphasis> 0);
+    <emphasis role="strong">fclose</emphasis>(DLFile);
+		
+    <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;merges, 0, 0);
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+    <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;history, 0);
+    <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+
+    <emphasis role="strong"><link linkend='igraph_community_leading_eigenvector'>igraph_community_leading_eigenvector</link></emphasis>(&amp;g, &amp;merges, &amp;membership,
+					 <emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g), 
+					 &amp;options, &amp;modularity,
+					 <emphasis>/*start=*/</emphasis> 0, <emphasis>/*eigenvalues=*/</emphasis> 0, 
+					 <emphasis>/*eigenvectors=*/</emphasis> 0, &amp;history,
+					 <emphasis>/*callback=*/</emphasis> 0, 
+					 <emphasis>/*callback_extra=*/</emphasis> 0);
+
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;history);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+    <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;merges);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/lineendings.c.xml igraph-0.6.5/examples/simple/lineendings.c.xml
--- igraph-0.6.5~quantal1/examples/simple/lineendings.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/lineendings.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,72 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  FILE *ifile;
+  
+  <emphasis>/* turn on attribute handling */</emphasis>
+<emphasis>/*   igraph_i_set_attribute_table(&amp;igraph_cattribute_table); */</emphasis>
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek1.net", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek2.net", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek3.net", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek4.net", "r");
+  <emphasis role="strong">if</emphasis> (ifile==0) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong"><link linkend='igraph_write_graph_pajek'>igraph_write_graph_pajek</link></emphasis>(&amp;g, stdout);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+ 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/matrix.c.xml igraph-0.6.5/examples/simple/matrix.c.xml
--- igraph-0.6.5~quantal1/examples/simple/matrix.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/matrix.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,174 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_matrix</emphasis>(igraph_matrix_t *m, FILE *f) {
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m); j++) {
+      <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }  
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t m, m1;
+  long int i, j, k;
+  
+  <emphasis>/* igraph_matrix_init, igraph_matrix_destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 10, 10);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_matrix_ncol, igraph_matrix_nrow */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 10, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m) != 10) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* igraph_matrix_size, igraph_matrix_resize */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 6, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_size'>igraph_matrix_size</link></emphasis>(&amp;m) != 30) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m) != 6) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 2, 4);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m) != 2) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m) != 4) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* MATRIX, igraph_matrix_null */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 3, 4);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, i, j)= i+1;
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_matrix_add_cols, igraph_matrix_add_rows */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 4, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, i, j)= (i+1)*(j+1);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_add_cols'>igraph_matrix_add_cols</link></emphasis>(&amp;m, 2);
+  <emphasis role="strong"><link linkend='igraph_matrix_add_rows'>igraph_matrix_add_rows</link></emphasis>(&amp;m, 2);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m) != 6) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* igraph_matrix_remove_col */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 5, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, i, j)= (i+1)*(j+1);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_remove_col'>igraph_matrix_remove_col</link></emphasis>(&amp;m, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_remove_col'>igraph_matrix_remove_col</link></emphasis>(&amp;m, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_matrix_permdelete_rows */</emphasis>
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_matrix_delete_rows_neg */</emphasis>
+
+  <emphasis>/* igraph_matrix_copy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 2, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, i, j)= (i+1)*(j+1);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_matrix_copy'>igraph_matrix_copy</link></emphasis>(&amp;m1, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m1, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m1);
+
+  <emphasis>/* in-place transpose */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m,5,2);
+  k=0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, j, i)=k++;
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m,5,1);
+  k=0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, j, i)=k++;
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m,1,5);
+  k=0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m, j, i)=k++;
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 10;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/matrix2.c.xml igraph-0.6.5/examples/simple/matrix2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/matrix2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/matrix2.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,317 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+void <emphasis role="strong">print_matrix</emphasis>(igraph_matrix_t *m) {
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m); j++) {
+      <emphasis role="strong">printf</emphasis>(" %g", <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j));
+    }
+    <emphasis role="strong">printf</emphasis>("\n");
+  }  
+}
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v) {
+  long int i, n=<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>(" %g", <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">printf</emphasis>("\n");
+}
+
+void <emphasis role="strong">byrow</emphasis>(igraph_matrix_t *m) {
+  long int r=<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(m), c=<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(m);
+  long int n=0, i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;r; i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;c; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(*m, i, j) = n++;
+    }
+  }
+}
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">apply</emphasis>(m,a,b) \
+   <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;(m)); i++) { \
+     <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;(m)); j++) { \
+        (a); \
+     } \
+     (b); \
+   }
+
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t m, m2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  long int i, j, i2, j2;
+  igraph_real_t r1, r2;
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 4, 3);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_matrix_e */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_e\n");
+  <emphasis role="strong">apply</emphasis>(m, <emphasis role="strong">printf</emphasis>("%i ", (int)<emphasis role="strong"><link linkend='igraph_matrix_e'>igraph_matrix_e</link></emphasis>(&amp;m, i, j)), <emphasis role="strong">printf</emphasis>("\n"));
+
+  <emphasis>/* igraph_matrix_e_ptr */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_e_ptr\n");
+  <emphasis role="strong">apply</emphasis>(m, <emphasis role="strong">printf</emphasis>("%i ", (int)<emphasis role="strong"><link linkend='igraph_matrix_e_ptr'>igraph_matrix_e_ptr</link></emphasis>(&amp;m, i, j)[0]), <emphasis role="strong">printf</emphasis>("\n"));
+
+  <emphasis>/* igraph_matrix_set */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_set\n");
+  <emphasis role="strong">apply</emphasis>(m, <emphasis role="strong"><link linkend='igraph_matrix_set'>igraph_matrix_set</link></emphasis>(&amp;m, i, j, i),0 );
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong">apply</emphasis>(m, <emphasis role="strong"><link linkend='igraph_matrix_set'>igraph_matrix_set</link></emphasis>(&amp;m, i, j, j),0 );
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+
+  <emphasis>/* igraph_matrix_fill */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_fill\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_fill'>igraph_matrix_fill</link></emphasis>(&amp;m, 42);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_fill'>igraph_matrix_fill</link></emphasis>(&amp;m, -42.1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_matrix_update */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_update\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_update'>igraph_matrix_update</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_rbind */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_rbind\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_rbind'>igraph_matrix_rbind</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 0, <emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m2));
+  <emphasis role="strong"><link linkend='igraph_matrix_rbind'>igraph_matrix_rbind</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  <emphasis role="strong">printf</emphasis>("\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_rbind'>igraph_matrix_rbind</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+
+  <emphasis>/* igraph_matrix_cbind */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_cbind\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 4, 3);
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m2, 4, 2);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  <emphasis role="strong">byrow</emphasis>(&amp;m2);
+  <emphasis role="strong"><link linkend='igraph_matrix_cbind'>igraph_matrix_cbind</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+
+  <emphasis>/* igraph_matrix_swap */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_swap\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_update'>igraph_matrix_update</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_swap'>igraph_matrix_swap</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  
+  <emphasis>/* igraph_matrix_get_row */</emphasis>
+  <emphasis>/* igraph_matrix_set_row */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_get_row\n");
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_set_row\n");
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong"><link linkend='igraph_matrix_get_row'>igraph_matrix_get_row</link></emphasis>(&amp;m, &amp;v, i);
+    <emphasis role="strong"><link linkend='igraph_matrix_set_row'>igraph_matrix_set_row</link></emphasis>(&amp;m2, &amp;v, i);
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_set_col */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_set_col\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(&amp;m2);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_ncol'>igraph_matrix_ncol</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong"><link linkend='igraph_matrix_get_col'>igraph_matrix_get_col</link></emphasis>(&amp;m, &amp;v, i);
+    <emphasis role="strong"><link linkend='igraph_matrix_set_col'>igraph_matrix_set_col</link></emphasis>(&amp;m2, &amp;v, i);
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  
+  <emphasis>/* igraph_matrix_swap_rows */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_swap_rows\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_swap_rows'>igraph_matrix_swap_rows</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_swap_rows'>igraph_matrix_swap_rows</link></emphasis>(&amp;m2, 0, 2);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  
+  <emphasis>/* igraph_matrix_swap_cols */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_swap_cols\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_swap_cols'>igraph_matrix_swap_cols</link></emphasis>(&amp;m2, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_swap_cols'>igraph_matrix_swap_cols</link></emphasis>(&amp;m2, 0, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_add_constant */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_add_constant\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_add_constant'>igraph_matrix_add_constant</link></emphasis>(&amp;m2, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);  
+  <emphasis role="strong"><link linkend='igraph_matrix_add_constant'>igraph_matrix_add_constant</link></emphasis>(&amp;m2, -1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  
+  <emphasis>/* igraph_matrix_add */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_add\n");
+  <emphasis role="strong">byrow</emphasis>(&amp;m2);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_add'>igraph_matrix_add</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_sub */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_sub\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_sub'>igraph_matrix_sub</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_mul_elements */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_mul_elements\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_mul_elements'>igraph_matrix_mul_elements</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_div_elements */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_div_elements\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_fill'>igraph_matrix_fill</link></emphasis>(&amp;m, 2);
+  <emphasis role="strong"><link linkend='igraph_matrix_div_elements'>igraph_matrix_div_elements</link></emphasis>(&amp;m2, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+
+  <emphasis>/* igraph_matrix_min */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_min\n");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_min'>igraph_matrix_min</link></emphasis>(&amp;m2) != 0) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_min'>igraph_matrix_min</link></emphasis>(&amp;m) != 2) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis>/* igraph_matrix_which_min */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_which_min\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_which_min'>igraph_matrix_which_min</link></emphasis>(&amp;m2, &amp;i, &amp;j);
+  <emphasis role="strong">if</emphasis> (i != 0 || j != 0) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m2,0,1) = -1;
+  <emphasis role="strong"><link linkend='igraph_matrix_which_min'>igraph_matrix_which_min</link></emphasis>(&amp;m2, &amp;i, &amp;j);
+  <emphasis role="strong">if</emphasis> (i != 0 || j != 1) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m2,3,1) = -2;
+  <emphasis role="strong"><link linkend='igraph_matrix_which_min'>igraph_matrix_which_min</link></emphasis>(&amp;m2, &amp;i, &amp;j);
+  <emphasis role="strong">if</emphasis> (i != 3 || j != 1) { <emphasis role="strong">return</emphasis> 2; }
+
+  <emphasis>/* igraph_matrix_which_max */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_which_max\n");
+  <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m2,3,0) = 100;
+  <emphasis role="strong"><link linkend='igraph_matrix_which_max'>igraph_matrix_which_max</link></emphasis>(&amp;m2, &amp;i, &amp;j);
+  <emphasis role="strong">if</emphasis> (i != 3 || j != 0) { <emphasis role="strong">return</emphasis> 3; }
+  
+  <emphasis>/* igraph_matrix_minmax */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_minmax\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_minmax'>igraph_matrix_minmax</link></emphasis>(&amp;m2, &amp;r1, &amp;r2);
+  <emphasis role="strong">printf</emphasis>("%g %g\n", r1, r2);
+  
+  <emphasis>/* igraph_matrix_which_minmax */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_which_minmax\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_which_minmax'>igraph_matrix_which_minmax</link></emphasis>(&amp;m2, &amp;i, &amp;j, &amp;i2, &amp;j2);
+  <emphasis role="strong">if</emphasis> (i != 3 || j != 1 || i2 != 3 || j2 != 0) { <emphasis role="strong">return</emphasis> 4; }
+
+  <emphasis>/* igraph_matrix_isnull */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_isnull\n");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_isnull'>igraph_matrix_isnull</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong"><link linkend='igraph_matrix_null'>igraph_matrix_null</link></emphasis>(&amp;m);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_isnull'>igraph_matrix_isnull</link></emphasis>(&amp;m)) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m2, 5, 0);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_isnull'>igraph_matrix_isnull</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 5; }  
+  
+  <emphasis>/* igraph_matrix_empty */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_empty\n");
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_empty'>igraph_matrix_empty</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 6; }
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m2, 5, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_empty'>igraph_matrix_empty</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 6; }
+
+  <emphasis>/* igraph_matrix_is_symmetric */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_is_symmetric\n");
+  <emphasis role="strong">byrow</emphasis>(&amp;m2);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_is_symmetric'>igraph_matrix_is_symmetric</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 7; }
+  <emphasis role="strong"><link linkend='igraph_matrix_update'>igraph_matrix_update</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong"><link linkend='igraph_matrix_transpose'>igraph_matrix_transpose</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_add'>igraph_matrix_add</link></emphasis>(&amp;m, &amp;m2);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_is_symmetric'>igraph_matrix_is_symmetric</link></emphasis>(&amp;m)) { <emphasis role="strong">return</emphasis> 7; }
+
+  <emphasis>/* igraph_matrix_prod */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_prod\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 3,2);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_add_constant'>igraph_matrix_add_constant</link></emphasis>(&amp;m, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong">printf</emphasis>("product: %g\n", <emphasis role="strong"><link linkend='igraph_matrix_prod'>igraph_matrix_prod</link></emphasis>(&amp;m));
+
+  <emphasis>/* igraph_matrix_rowsum */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_rowsum\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_rowsum'>igraph_matrix_rowsum</link></emphasis>(&amp;m, &amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v);
+
+  <emphasis>/* igraph_matrix_colsum */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_colsum\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_colsum'>igraph_matrix_colsum</link></emphasis>(&amp;m, &amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v);
+
+  <emphasis>/* igraph_matrix_contains */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_contains\n");
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_contains'>igraph_matrix_contains</link></emphasis>(&amp;m, 0)) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_contains'>igraph_matrix_contains</link></emphasis>(&amp;m, 6.0001)) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_contains'>igraph_matrix_contains</link></emphasis>(&amp;m, 7)) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_contains'>igraph_matrix_contains</link></emphasis>(&amp;m, 1)) { <emphasis role="strong">return</emphasis> 8; }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_contains'>igraph_matrix_contains</link></emphasis>(&amp;m, 6)) { <emphasis role="strong">return</emphasis> 8; }
+  
+  <emphasis>/* igraph_matrix_search */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_search\n");
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_search'>igraph_matrix_search</link></emphasis>(&amp;m, 0, 6.0, &amp;i2, &amp;i, &amp;j)) { <emphasis role="strong">return</emphasis> 9; }
+  <emphasis role="strong">if</emphasis> (i2 != 5 || i != 2 || j != 1) { <emphasis role="strong">return</emphasis> 9; }
+  
+  <emphasis>/* igraph_matrix_remove_row */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_remove_row\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_remove_row'>igraph_matrix_remove_row</link></emphasis>(&amp;m, 1);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m,5,4);
+  <emphasis role="strong">byrow</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_remove_row'>igraph_matrix_remove_row</link></emphasis>(&amp;m, 4);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_matrix_remove_row'>igraph_matrix_remove_row</link></emphasis>(&amp;m, 0);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m);
+
+  <emphasis>/* igraph_matrix_select_cols */</emphasis>
+  <emphasis role="strong">printf</emphasis>("igraph_matrix_select_cols\n");
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 6, 5);
+  <emphasis role="strong">apply</emphasis>(m, <emphasis role="strong"><link linkend='igraph_matrix_set'>igraph_matrix_set</link></emphasis>(&amp;m, i, j, j),0 );
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 3);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[0]=0; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[1]=4; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[2]=2;
+  <emphasis role="strong"><link linkend='igraph_matrix_select_cols'>igraph_matrix_select_cols</link></emphasis>(&amp;m, &amp;m2, &amp;v);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_select_cols'>igraph_matrix_select_cols</link></emphasis>(&amp;m, &amp;m2, &amp;v);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m2);
+  <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_matrix_select_cols'>igraph_matrix_select_cols</link></emphasis>(&amp;m, &amp;m2, &amp;v);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_matrix_empty'>igraph_matrix_empty</link></emphasis>(&amp;m2)) { <emphasis role="strong">return</emphasis> 9; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 10;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/matrix3.c.xml igraph-0.6.5/examples/simple/matrix3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/matrix3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/matrix3.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,44 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, USA 02139</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_matrix_t m;
+  
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m, 10, 10);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_capacity'>igraph_matrix_capacity</link></emphasis>(&amp;m) != 100) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_add_cols'>igraph_matrix_add_cols</link></emphasis>(&amp;m, 5);
+  <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;m, 5, 5);
+  <emphasis role="strong"><link linkend='igraph_matrix_resize_min'>igraph_matrix_resize_min</link></emphasis>(&amp;m);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_matrix_capacity'>igraph_matrix_capacity</link></emphasis>(&amp;m) != <emphasis role="strong"><link linkend='igraph_matrix_size'>igraph_matrix_size</link></emphasis>(&amp;m)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/mt.c.xml igraph-0.6.5/examples/simple/mt.c.xml
--- igraph-0.6.5~quantal1/examples/simple/mt.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/mt.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,40 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;1000; i++) {
+    igraph_real_t r=<emphasis role="strong"><link linkend='igraph_rng_get_unif01'>igraph_rng_get_unif01</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>());
+    <emphasis role="strong">if</emphasis> (r&lt;0 || r&gt;1) {
+      <emphasis role="strong">return</emphasis> 1;
+    }
+  }
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/pajek.c.xml igraph-0.6.5/examples/simple/pajek.c.xml
--- igraph-0.6.5~quantal1/examples/simple/pajek.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/pajek.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,48 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2010-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  FILE *ifile;
+  
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek5.net", "r");
+  <emphasis role="strong">if</emphasis> (!ifile) { <emphasis role="strong">return</emphasis> 1; }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10 || <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 9 ||
+      <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) { <emphasis role="strong">return</emphasis> 2; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  ifile=<emphasis role="strong">fopen</emphasis>("pajek6.net", "r");
+  <emphasis role="strong">if</emphasis> (!ifile) { <emphasis role="strong">return</emphasis> 3; }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 10 || <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 9 ||
+      !<emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) { <emphasis role="strong">return</emphasis> 4; }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/pajek2.c.xml igraph-0.6.5/examples/simple/pajek2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/pajek2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/pajek2.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,50 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  FILE *ifile;
+  int i, n;
+
+  <emphasis>/* turn on attribute handling */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_i_set_attribute_table'>igraph_i_set_attribute_table</link></emphasis>(&amp;igraph_cattribute_table);  
+
+  ifile=<emphasis role="strong">fopen</emphasis>("bipartite.net", "r");
+  <emphasis role="strong">if</emphasis> (!ifile) { <emphasis role="strong">return</emphasis> 5; }
+  <emphasis role="strong"><link linkend='igraph_read_graph_pajek'>igraph_read_graph_pajek</link></emphasis>(&amp;g, ifile);
+  <emphasis role="strong">fclose</emphasis>(ifile);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g) != 13 || <emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(&amp;g) != 11 ||
+      <emphasis role="strong"><link linkend='igraph_is_directed'>igraph_is_directed</link></emphasis>(&amp;g)) { <emphasis role="strong">return</emphasis> 6; }
+
+  <emphasis role="strong">for</emphasis> (i=0, n=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g); i&lt;n; i++) {
+    <emphasis role="strong">printf</emphasis>("%i ", (int) <emphasis role="strong"><link linkend='VAN'>VAN</link></emphasis>(&amp;g, "type", i));
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);  
+
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/random_seed.c.xml igraph-0.6.5/examples/simple/random_seed.c.xml
--- igraph-0.6.5~quantal1/examples/simple/random_seed.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/random_seed.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g1, g2;
+  igraph_bool_t iso;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1122);
+  
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g1, IGRAPH_ERDOS_RENYI_GNP, 
+			  100, 3.0/100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+  
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1122);
+  
+  <emphasis role="strong"><link linkend='igraph_erdos_renyi_game'>igraph_erdos_renyi_game</link></emphasis>(&amp;g2, IGRAPH_ERDOS_RENYI_GNP, 
+			  100, 3.0/100, <emphasis>/*directed=*/</emphasis> 0, <emphasis>/*loops=*/</emphasis> 0);
+
+  <emphasis role="strong"><link linkend='igraph_isomorphic'>igraph_isomorphic</link></emphasis>(&amp;g1, &amp;g2, &amp;iso);
+  
+  <emphasis role="strong">if</emphasis> (!iso) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g2);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g1);
+ 
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/scg.c.xml igraph-0.6.5/examples/simple/scg.c.xml
--- igraph-0.6.5~quantal1/examples/simple/scg.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/scg.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,161 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> ev;
+  igraph_t scg_graph;
+  igraph_matrix_t scg_matrix;
+  igraph_sparsemat_t scg_sparsemat;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  igraph_matrix_t input_matrix;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> eval;
+  igraph_matrix_t evec;
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;ev, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;scg_matrix, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;eval, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;evec, 0, 0);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">CALLSYM</emphasis>(algo) <emphasis role="strong">do</emphasis> {						\
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;eval);						\
+    <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;evec, 0, 0);					\
+    <emphasis role="strong"><link linkend='igraph_scg_adjacency'>igraph_scg_adjacency</link></emphasis>(&amp;g, <emphasis>/*matrix=*/</emphasis> 0, <emphasis>/*sparsemat=*/</emphasis> 0, &amp;ev,	\
+			 <emphasis>/* intervals= */</emphasis> 3, <emphasis>/* intervals_vector= */</emphasis> 0,	\
+			 <emphasis>/* algorithm= */</emphasis> algo, &amp;eval, &amp;evec,		\
+			 <emphasis>/* groups= */</emphasis> &amp;groups, <emphasis>/* use_arpack= */</emphasis> 0,	\
+			 <emphasis>/* maxiter= */</emphasis> 0, &amp;scg_graph, &amp;scg_matrix,	\
+			 &amp;scg_sparsemat, &amp;L, &amp;R,			\
+			 &amp;Lsparse, &amp;Rsparse); } <emphasis role="strong">while</emphasis>(0)
+
+  
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()						\
+  <emphasis role="strong">do</emphasis> {								\
+    <emphasis role="strong">printf</emphasis>("------------------------------------\n");		\
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;scg_graph, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);				\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;eval);					\
+    <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;evec);					\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;scg_sparsemat, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Lsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Rsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+  } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1;
+  <emphasis role="strong">CALLSYM</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 3;
+  <emphasis role="strong">CALLSYM</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;ev, 2);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[1] = 3;
+  <emphasis role="strong">CALLSYM</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">CALLSYM2</emphasis>(algo) <emphasis role="strong">do</emphasis> {						\
+    <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;eval);						\
+    <emphasis role="strong"><link linkend='igraph_matrix_resize'>igraph_matrix_resize</link></emphasis>(&amp;evec, 0, 0);					\
+    <emphasis role="strong"><link linkend='igraph_scg_adjacency'>igraph_scg_adjacency</link></emphasis>(<emphasis>/* graph=*/</emphasis> 0, &amp;input_matrix, <emphasis>/*sparsemat=*/</emphasis> 0, \
+			 &amp;ev, <emphasis>/* intervals= */</emphasis> 3,			\
+			 <emphasis>/* intervals_vector= */</emphasis> 0,			\
+			 <emphasis>/* algorithm= */</emphasis> algo, &amp;eval, &amp;evec,		\
+			 <emphasis>/* groups= */</emphasis> &amp;groups, <emphasis>/* use_arpack= */</emphasis> 0,	\
+			 <emphasis>/* maxiter= */</emphasis> 0, &amp;scg_graph, &amp;scg_matrix,	\
+			 &amp;scg_sparsemat, &amp;L, &amp;R,			\
+			 &amp;Lsparse, &amp;Rsparse); } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;input_matrix, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_get_adjacency'>igraph_get_adjacency</link></emphasis>(&amp;g, &amp;input_matrix, IGRAPH_GET_ADJACENCY_BOTH, 
+		       <emphasis>/* eids= */</emphasis> 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;ev, 1);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1;
+  <emphasis role="strong">CALLSYM2</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 3;
+  <emphasis role="strong">CALLSYM2</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;ev, 2);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[1] = 3;
+  <emphasis role="strong">CALLSYM2</emphasis>(IGRAPH_SCG_EXACT);
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;evec);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;eval);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;input_matrix);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;scg_matrix);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;L);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;R);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;ev);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------- */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/scg2.c.xml igraph-0.6.5/examples/simple/scg2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/scg2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/scg2.c.xml	2013-03-03 01:45:58.000000000 +0000
@@ -0,0 +1,127 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> ev;
+  igraph_t scg_graph;
+  igraph_matrix_t scg_matrix;
+  igraph_sparsemat_t scg_sparsemat;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> p;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_vector_complex_t eval;
+  igraph_matrix_complex_t evec;
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;ev, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;scg_matrix, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;p, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;eval, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;evec, 0, 0);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">CALLSTO</emphasis>() <emphasis role="strong">do</emphasis> {							 \
+    <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;p, 0);					 \
+    <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;groups, 0);					 \
+    <emphasis role="strong">igraph_vector_complex_resize</emphasis>(&amp;eval, 0);				 \
+    <emphasis role="strong">igraph_matrix_complex_resize</emphasis>(&amp;evec, 0, 0);				 \
+    <emphasis role="strong"><link linkend='igraph_scg_stochastic'>igraph_scg_stochastic</link></emphasis>(&amp;g, <emphasis>/*matrix=*/</emphasis> 0, <emphasis>/*sparsemat=*/</emphasis> 0, &amp;ev,	 \
+			  <emphasis>/* intervals= */</emphasis> 2, <emphasis>/* intervals_vector= */</emphasis> 0, \
+			  <emphasis>/* algorithm= */</emphasis> IGRAPH_SCG_EXACT,		 \
+			  IGRAPH_SCG_NORM_ROW, &amp;eval, &amp;evec, 		 \
+			  &amp;groups, &amp;p, <emphasis>/* use_arpack= */</emphasis> 0,		 \
+			  <emphasis>/* maxiter= */</emphasis> 0, &amp;scg_graph, &amp;scg_matrix,	 \
+			  &amp;scg_sparsemat, &amp;L, &amp;R,			 \
+			  &amp;Lsparse, &amp;Rsparse);				 \
+} <emphasis role="strong">while</emphasis> (0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()						\
+  <emphasis role="strong">do</emphasis> {								\
+    <emphasis role="strong">printf</emphasis>("--------------------------------\n");		\
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);				\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;eval);				\
+    <emphasis role="strong">igraph_matrix_complex_print</emphasis>(&amp;evec);				\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;scg_graph, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;scg_sparsemat, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Lsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Rsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+  } <emphasis role="strong">while</emphasis> (0)
+  
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1;
+  <emphasis role="strong">CALLSTO</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 3;
+  <emphasis role="strong">CALLSTO</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;ev, 2);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[1] = 3;
+  <emphasis role="strong">CALLSTO</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;evec);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;eval);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;p);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;scg_matrix);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;L);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;R);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;ev);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------- */</emphasis>
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/scg3.c.xml igraph-0.6.5/examples/simple/scg3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/scg3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/scg3.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,125 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> ev;
+  igraph_t scg_graph;
+  igraph_matrix_t scg_matrix;
+  igraph_sparsemat_t scg_sparsemat;
+  igraph_matrix_t L, R;
+  igraph_sparsemat_t Lsparse, Rsparse;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> groups;
+  igraph_vector_complex_t eval;
+  igraph_matrix_complex_t evec;
+  
+  <emphasis role="strong"><link linkend='igraph_tree'>igraph_tree</link></emphasis>(&amp;g, 10, <emphasis>/* children= */</emphasis> 3, IGRAPH_TREE_UNDIRECTED);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;ev, 1);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;L, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;R, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;scg_matrix, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;groups, 0);
+  <emphasis role="strong">igraph_vector_complex_init</emphasis>(&amp;eval, 0);
+  <emphasis role="strong">igraph_matrix_complex_init</emphasis>(&amp;evec, 0, 0);
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">CALLLAP</emphasis>() <emphasis role="strong">do</emphasis> {							 \
+    <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;groups, 0);					 \
+    <emphasis role="strong">igraph_vector_complex_resize</emphasis>(&amp;eval, 0);				 \
+    <emphasis role="strong">igraph_matrix_complex_resize</emphasis>(&amp;evec, 0, 0);				 \
+    <emphasis role="strong"><link linkend='igraph_scg_laplacian'>igraph_scg_laplacian</link></emphasis>(&amp;g, <emphasis>/*matrix=*/</emphasis> 0, <emphasis>/*sparsemat=*/</emphasis> 0, &amp;ev,	 \
+			 <emphasis>/* intervals= */</emphasis> 2, <emphasis>/* intervals_vector= */</emphasis> 0, \
+			 <emphasis>/* algorithm= */</emphasis> IGRAPH_SCG_EXACT,		\
+			 IGRAPH_SCG_NORM_ROW,				\
+			 IGRAPH_SCG_DIRECTION_DEFAULT, &amp;eval, &amp;evec,	\
+			 &amp;groups, <emphasis>/* use_arpack= */</emphasis> 0,			\
+			 <emphasis>/* maxiter= */</emphasis> 0, &amp;scg_graph, &amp;scg_matrix,	\
+			 &amp;scg_sparsemat, &amp;L, &amp;R,			\
+			 &amp;Lsparse, &amp;Rsparse);				\
+} <emphasis role="strong">while</emphasis> (0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">PRINTRES</emphasis>()						\
+  <emphasis role="strong">do</emphasis> {								\
+    <emphasis role="strong">printf</emphasis>("--------------------------------\n");		\
+    <emphasis role="strong">igraph_vector_print</emphasis>(&amp;groups);				\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong">igraph_vector_complex_print</emphasis>(&amp;eval);				\
+    <emphasis role="strong">igraph_matrix_complex_print</emphasis>(&amp;evec);				\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;scg_graph, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;scg_sparsemat, stdout);		\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Lsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+    <emphasis role="strong"><link linkend='igraph_sparsemat_print'>igraph_sparsemat_print</link></emphasis>(&amp;Rsparse, stdout);			\
+    <emphasis role="strong">printf</emphasis>("---\n");						\
+  } <emphasis role="strong">while</emphasis> (0)
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1;
+  <emphasis role="strong">CALLLAP</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 3;
+  <emphasis role="strong">CALLLAP</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;ev, 2);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[0] = 1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(ev)[1] = 3;
+  <emphasis role="strong">CALLLAP</emphasis>();
+  <emphasis role="strong">PRINTRES</emphasis>();
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;scg_graph);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;scg_sparsemat);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Lsparse);
+  <emphasis role="strong"><link linkend='igraph_sparsemat_destroy'>igraph_sparsemat_destroy</link></emphasis>(&amp;Rsparse);
+
+  <emphasis role="strong">igraph_matrix_complex_destroy</emphasis>(&amp;evec);
+  <emphasis role="strong">igraph_vector_complex_destroy</emphasis>(&amp;eval);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;groups);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;scg_matrix);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;L);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;R);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;ev);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* -------------------------------------------------------------------- */</emphasis>
+
+<emphasis role="strong">#ifdef</emphasis> __APPLE__
+  <emphasis role="strong">return</emphasis> 0;
+<emphasis role="strong">#else</emphasis>
+  <emphasis role="strong">return</emphasis> 77;
+<emphasis role="strong">#endif</emphasis>
+}
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/single_target_shortest_path.c.xml igraph-0.6.5/examples/simple/single_target_shortest_path.c.xml
--- igraph-0.6.5~quantal1/examples/simple/single_target_shortest_path.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/single_target_shortest_path.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,79 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">igraph_warnings_ignore</emphasis>(<emphasis role="strong">const</emphasis> char *reason, <emphasis role="strong">const</emphasis> char *file,
+			    int line, int igraph_errno) {
+  <emphasis>/* Do nothing */</emphasis>
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vpath, epath;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> w;
+  
+  <emphasis>/* Unweighted */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_DIRECTED,
+	       0,1, 1,2, 2,3, 3,4, 0,3, 
+	       -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;vpath, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;epath, 0);
+  <emphasis role="strong"><link linkend='igraph_get_shortest_path'>igraph_get_shortest_path</link></emphasis>(&amp;g, &amp;vpath, &amp;epath, 0, 4, IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vpath);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;epath);
+
+  <emphasis role="strong"><link linkend='igraph_get_shortest_path'>igraph_get_shortest_path</link></emphasis>(&amp;g, &amp;vpath, &amp;epath, 0, 0, IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vpath);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;epath);
+
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(igraph_warnings_ignore);
+  <emphasis role="strong"><link linkend='igraph_get_shortest_path'>igraph_get_shortest_path</link></emphasis>(&amp;g, &amp;vpath, &amp;epath, 4, 0, IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vpath);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;epath);
+  <emphasis role="strong"><link linkend='igraph_set_warning_handler'>igraph_set_warning_handler</link></emphasis>(<link linkend='igraph_warning_handler_print'>igraph_warning_handler_print</link>);
+
+  <emphasis role="strong"><link linkend='igraph_get_shortest_path'>igraph_get_shortest_path</link></emphasis>(&amp;g, &amp;vpath, &amp;epath, 4, 0, IGRAPH_ALL);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vpath);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;epath);
+
+  <emphasis>/* Weighted */</emphasis>
+
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;w, 5);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[0]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[1]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[2]=1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[3]=1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(w)[4]=3.1;
+
+  <emphasis role="strong"><link linkend='igraph_get_shortest_path_dijkstra'>igraph_get_shortest_path_dijkstra</link></emphasis>(&amp;g, &amp;vpath, &amp;epath, 0, 4, &amp;w, IGRAPH_OUT);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;vpath);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;epath);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;w);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;epath);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vpath);
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/spinglass.c.xml igraph-0.6.5/examples/simple/spinglass.c.xml
--- igraph-0.6.5~quantal1/examples/simple/spinglass.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/spinglass.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,100 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_real_t  modularity, temperature;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> membership, csize;
+  long int i;
+  igraph_real_t cohesion, adhesion;
+  igraph_integer_t inner_links;
+  igraph_integer_t outer_links;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_UNDIRECTED, 
+	       0,1,0,2,0,3,0,4, 1,2,1,3,1,4, 2,3,2,4, 3,4,
+	       5,6,5,7,5,8,5,9, 6,7,6,8,6,9, 7,8,7,9, 8,9, 0,5, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;membership, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;csize, 0);
+  <emphasis role="strong"><link linkend='igraph_community_spinglass'>igraph_community_spinglass</link></emphasis>(&amp;g, 
+			     0, <emphasis>/* no weights */</emphasis>
+			     &amp;modularity,
+			     &amp;temperature,
+			     &amp;membership,
+			     &amp;csize,
+			     2,	   <emphasis>/* no of spins */</emphasis>
+			     0,    <emphasis>/* parallel update */</emphasis>
+			     1.0,  <emphasis>/* start temperature */</emphasis>
+			     0.01, <emphasis>/* stop temperature */</emphasis>
+			     0.99, <emphasis>/* cooling factor */</emphasis>
+			     IGRAPH_SPINCOMM_UPDATE_CONFIG,
+			     1.0, <emphasis>/* gamma */</emphasis>
+			     IGRAPH_SPINCOMM_IMP_ORIG,
+			     <emphasis>/*gamma-=*/</emphasis> 0);
+
+<emphasis>/*   printf("Modularity:  %f\n", modularity); */</emphasis>
+<emphasis>/*   printf("Temperature: %f\n", temperature); */</emphasis>
+<emphasis>/*   printf("Cluster sizes: "); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;igraph_vector_size(&amp;csize); i++) { */</emphasis>
+<emphasis>/*     printf("%li ", (long int)VECTOR(csize)[i]); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   printf("\n"); */</emphasis>
+<emphasis>/*   printf("Membership: "); */</emphasis>
+<emphasis>/*   for (i=0; i&lt;igraph_vector_size(&amp;membership); i++) { */</emphasis>
+<emphasis>/*     printf("%li ", (long int)VECTOR(membership)[i]); */</emphasis>
+<emphasis>/*   } */</emphasis>
+<emphasis>/*   printf("\n"); */</emphasis>
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;csize) != 2) {
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;csize);  
+    <emphasis role="strong">return</emphasis> 77;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(csize)[0] != 5) {
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+    <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;csize);  
+    <emphasis role="strong">return</emphasis> 77;
+  }
+
+  <emphasis>/* Try to call this as well, we don't check the results currently.... */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_community_spinglass_single'>igraph_community_spinglass_single</link></emphasis>(&amp;g, 
+				    <emphasis>/*weights=  */</emphasis> 0,
+				    <emphasis>/*vertex=   */</emphasis> 0,
+				    <emphasis>/*community=*/</emphasis> &amp;membership,
+				    <emphasis>/*cohesion= */</emphasis> &amp;cohesion,
+				    <emphasis>/*adhesion= */</emphasis> &amp;adhesion,
+				    <emphasis>/*inner_links= */</emphasis> &amp;inner_links,
+				    <emphasis>/*outer_links= */</emphasis> &amp;outer_links,
+				    <emphasis>/*spins=       */</emphasis> 2,
+				    <emphasis>/*update_rule= */</emphasis> IGRAPH_SPINCOMM_UPDATE_CONFIG,
+				    <emphasis>/*gamma=       */</emphasis> 1.0);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;membership);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;csize);  
+  
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/spmatrix.c.xml igraph-0.6.5/examples/simple/spmatrix.c.xml
--- igraph-0.6.5~quantal1/examples/simple/spmatrix.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/spmatrix.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,212 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+void <emphasis role="strong">print_matrix</emphasis>(igraph_spmatrix_t *m, FILE *f) {
+  long int i, j;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(m); j++) {
+      <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int)<emphasis role="strong"><link linkend='igraph_spmatrix_e'>igraph_spmatrix_e</link></emphasis>(m, i, j));
+    }
+    <emphasis role="strong">fprintf</emphasis>(f, "\n");
+  }  
+  <emphasis role="strong">fprintf</emphasis>(f, "=========================\n");
+}
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n=========================\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_spmatrix_t m, m1;
+  igraph_spmatrix_iter_t mit;
+  igraph_real_t arr[12];
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  long int i, j;
+  int order[] = { 1, 5, 8, 4, 0, 9, 6, 10, 11, 2, 3, 7 };
+
+  <emphasis>/* igraph_spmatrix_init, igraph_spmatrix_destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 10, 10);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 0, 0);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_spmatrix_ncol, igraph_spmatrix_nrow */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 10, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m) != 10) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* igraph_spmatrix_size, igraph_spmatrix_resize */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_resize'>igraph_spmatrix_resize</link></emphasis>(&amp;m, 6, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_size'>igraph_spmatrix_size</link></emphasis>(&amp;m) != 30) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m) != 6) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_resize'>igraph_spmatrix_resize</link></emphasis>(&amp;m, 2, 4);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m) != 2) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m) != 4) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_spmatrix_get, igraph_spmatrix_set, igraph_spmatrix_null */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 3, 4);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, (i+j) % 3);
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">igraph_spmatrix_null</emphasis>(&amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis>/* now fill it in shuffled order */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;12; i++) {
+    <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, order[i]/4, order[i]%4, (order[i]/4+order[i]%4) % 3);
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis>/* now decrease all elements by two in shuffled order */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;12; i++) {
+    <emphasis role="strong"><link linkend='igraph_spmatrix_add_e'>igraph_spmatrix_add_e</link></emphasis>(&amp;m, order[i]/4, order[i]%4, -2);
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis>/* now increase all elements by one in shuffled order */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;12; i++) {
+    <emphasis role="strong"><link linkend='igraph_spmatrix_add_e'>igraph_spmatrix_add_e</link></emphasis>(&amp;m, order[i]/4, order[i]%4, 1);
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  
+  <emphasis>/* igraph_matrix_add_cols, igraph_matrix_add_rows */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 4, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, (i+1)*(j+1));
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_add_cols'>igraph_spmatrix_add_cols</link></emphasis>(&amp;m, 2);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_add_rows'>igraph_spmatrix_add_rows</link></emphasis>(&amp;m, 2);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m) != 5) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m) != 6) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* igraph_spmatrix_count_nonzero */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 5, 3);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, i*j);
+    }
+  }
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m, stdout);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_spmatrix_count_nonzero'>igraph_spmatrix_count_nonzero</link></emphasis>(&amp;m) != 8) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* igraph_spmatrix_copy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 3, 4);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, i*j);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_copy'>igraph_spmatrix_copy</link></emphasis>(&amp;m1, &amp;m);
+  <emphasis role="strong">print_matrix</emphasis>(&amp;m1, stdout);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m1);
+
+  <emphasis>/* igraph_spmatrix_copy_to */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 3, 4);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, i*j);
+    }
+  }
+  <emphasis role="strong">igraph_spmatrix_copy_to</emphasis>(&amp;m, arr);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;12; i++) { <emphasis role="strong">printf</emphasis>(" %ld", (long)arr[i]); }
+  <emphasis role="strong">printf</emphasis>("\n=========================\n");
+  
+  <emphasis>/* igraph_spmatrix_max */</emphasis>
+  arr[0] = <emphasis role="strong"><link linkend='igraph_spmatrix_max'>igraph_spmatrix_max</link></emphasis>(&amp;m, arr+1, arr+2);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;3; i++) { <emphasis role="strong">printf</emphasis>(" %ld", (long)arr[i]); }
+  <emphasis role="strong">printf</emphasis>("\n=========================\n");
+ 
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* igraph_spmatrix_colsums */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 3, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, i+j-4);
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_colsums'>igraph_spmatrix_colsums</link></emphasis>(&amp;m, &amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+
+  <emphasis>/* igraph_spmatrix_iter_t */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_spmatrix_init'>igraph_spmatrix_init</link></emphasis>(&amp;m, 5, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_nrow'>igraph_spmatrix_nrow</link></emphasis>(&amp;m); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;<emphasis role="strong"><link linkend='igraph_spmatrix_ncol'>igraph_spmatrix_ncol</link></emphasis>(&amp;m); j++) {
+      <emphasis role="strong">if</emphasis> (<emphasis role="strong">abs</emphasis>(i-j) == 1)
+        <emphasis role="strong"><link linkend='igraph_spmatrix_set'>igraph_spmatrix_set</link></emphasis>(&amp;m, i, j, (i+1)*(j+1));
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_iter_create'>igraph_spmatrix_iter_create</link></emphasis>(&amp;mit, &amp;m);
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='igraph_spmatrix_iter_end'>igraph_spmatrix_iter_end</link></emphasis>(&amp;mit)) {
+    <emphasis role="strong">printf</emphasis>("%ld %ld %ld\n", mit.ri, mit.ci, (long int)mit.value);
+    <emphasis role="strong"><link linkend='igraph_spmatrix_iter_next'>igraph_spmatrix_iter_next</link></emphasis>(&amp;mit);
+  }
+  <emphasis role="strong"><link linkend='igraph_spmatrix_iter_destroy'>igraph_spmatrix_iter_destroy</link></emphasis>(&amp;mit);
+  <emphasis role="strong"><link linkend='igraph_spmatrix_destroy'>igraph_spmatrix_destroy</link></emphasis>(&amp;m);
+  <emphasis role="strong">printf</emphasis>("=========================\n");
+
+  <emphasis>/* </emphasis><emphasis role="strong">TODO:</emphasis><emphasis> igraph_spmatrix_add_col_values */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/stack.c.xml igraph-0.6.5/examples/simple/stack.c.xml
--- igraph-0.6.5~quantal1/examples/simple/stack.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/stack.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,94 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;igraph_stack.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+
+  igraph_stack_t st;
+  int i;
+
+  <emphasis>/* igraph_stack_init, igraph_stack_destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_stack_init'>igraph_stack_init</link></emphasis>(&amp;st, 0);
+  <emphasis role="strong"><link linkend='igraph_stack_destroy'>igraph_stack_destroy</link></emphasis>(&amp;st);
+  <emphasis role="strong"><link linkend='igraph_stack_init'>igraph_stack_init</link></emphasis>(&amp;st, 10);
+  <emphasis role="strong"><link linkend='igraph_stack_destroy'>igraph_stack_destroy</link></emphasis>(&amp;st);
+
+  <emphasis>/* igraph_stack_reserve */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_stack_init'>igraph_stack_init</link></emphasis>(&amp;st, 0);
+  <emphasis role="strong"><link linkend='igraph_stack_reserve'>igraph_stack_reserve</link></emphasis>(&amp;st, 10);
+  <emphasis role="strong"><link linkend='igraph_stack_reserve'>igraph_stack_reserve</link></emphasis>(&amp;st, 5);
+
+  <emphasis>/* igraph_stack_empty */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_stack_empty'>igraph_stack_empty</link></emphasis>(&amp;st)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_stack_push'>igraph_stack_push</link></emphasis>(&amp;st, 1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_stack_empty'>igraph_stack_empty</link></emphasis>(&amp;st)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* igraph_stack_size */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_stack_size'>igraph_stack_size</link></emphasis>(&amp;st) != 1) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_stack_push'>igraph_stack_push</link></emphasis>(&amp;st, i);
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_stack_size'>igraph_stack_size</link></emphasis>(&amp;st) != 11) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+
+  <emphasis>/* igraph_stack_clear */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_stack_clear'>igraph_stack_clear</link></emphasis>(&amp;st);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_stack_empty'>igraph_stack_empty</link></emphasis>(&amp;st)) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong"><link linkend='igraph_stack_push'>igraph_stack_push</link></emphasis>(&amp;st, 100);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_stack_pop'>igraph_stack_pop</link></emphasis>(&amp;st) != 100) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong"><link linkend='igraph_stack_clear'>igraph_stack_clear</link></emphasis>(&amp;st);
+  <emphasis role="strong"><link linkend='igraph_stack_clear'>igraph_stack_clear</link></emphasis>(&amp;st);
+
+  <emphasis>/* igraph_stack_push, igraph_stack_pop */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong"><link linkend='igraph_stack_push'>igraph_stack_push</link></emphasis>(&amp;st, 100-i);
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;100; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_stack_pop'>igraph_stack_pop</link></emphasis>(&amp;st) != i+1) {
+      <emphasis role="strong">return</emphasis> 7;
+    }
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_stack_empty'>igraph_stack_empty</link></emphasis>(&amp;st)) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_stack_destroy'>igraph_stack_destroy</link></emphasis>(&amp;st);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 9;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/tls1.c.xml igraph-0.6.5/examples/simple/tls1.c.xml
--- igraph-0.6.5~quantal1/examples/simple/tls1.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/tls1.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,53 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;pthread.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;unistd.h&gt;
+
+void *<emphasis role="strong">thread_function</emphasis>(void *arg) {
+  <emphasis role="strong"><link linkend='IGRAPH_FINALLY'>IGRAPH_FINALLY</link></emphasis>(0, 0);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  pthread_t thread_id;
+  void *exit_status;
+
+  <emphasis>/* Skip if igraph is not thread-safe */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<link linkend='IGRAPH_THREAD_SAFE'>IGRAPH_THREAD_SAFE</link>) { 
+    <emphasis role="strong">return</emphasis> 77;
+  }
+  
+  <emphasis>/* Run a thread that leaves some junk in the error stack */</emphasis>
+  <emphasis role="strong">pthread_create</emphasis>(&amp;thread_id, NULL, thread_function, 0);
+  <emphasis role="strong">pthread_join</emphasis>(thread_id, &amp;exit_status);
+
+  <emphasis>/* Check that the error stack is not common */</emphasis>
+  <emphasis role="strong">if</emphasis> (!IGRAPH_FINALLY_STACK_EMPTY) {
+    <emphasis role="strong">printf</emphasis>("Foobar\n");
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/tls2.c.xml igraph-0.6.5/examples/simple/tls2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/tls2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/tls2.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,232 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;pthread.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;unistd.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;string.h&gt;
+
+<emphasis role="strong">#include</emphasis> "igraph_arpack_internal.h"
+
+<emphasis>/* Test whether ARPACK is thread-safe. We will create two threads, </emphasis>
+<emphasis>   each calling a different ARPACK eigensolver. We will make sure that</emphasis>
+<emphasis>   the ARPACK calls from the two threads overlap */</emphasis>
+
+<emphasis role="strong">typedef</emphasis> <emphasis role="strong">struct</emphasis> thread_data_t {
+  igraph_matrix_t *m;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *result;
+  pthread_cond_t *cond;
+  pthread_mutex_t *mutex;
+  int *steps, *othersteps;
+} thread_data_t;
+
+int <emphasis role="strong">arpack_mult</emphasis>(igraph_real_t *to, igraph_real_t *from, int n, 
+		igraph_matrix_t *matrix) {
+  <emphasis>/* </emphasis><emphasis role="strong">TODO</emphasis><emphasis> */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_blas_dgemv_array'>igraph_blas_dgemv_array</link></emphasis>(<emphasis>/*transpose=*/</emphasis> 0, <emphasis>/*alpha=*/</emphasis> 1.0, matrix,
+			  from, <emphasis>/*beta=*/</emphasis> 0.0, to);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+<emphasis>/* This is the function performed by each thread. It calles the</emphasis>
+<emphasis>   low-level ARPACK symmetric eigensolver, step by step. After each</emphasis>
+<emphasis>   step, it synchronizes with the other thread.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   The synchronization ensures that the two threads are using the</emphasis>
+<emphasis>   thread-local variables at the same time. If they are really</emphasis>
+<emphasis>   thread-local, then ARPACK still delivers the correct solution for</emphasis>
+<emphasis>   the two matrices. Otherwise the result is undefined: maybe results</emphasis>
+<emphasis>   will be incorrect, or the program will crash.</emphasis>
+
+<emphasis>   This function is basically a simplified copy of igraph_arpack_rssolve.</emphasis>
+<emphasis>*/</emphasis>
+
+void *<emphasis role="strong">thread_function</emphasis>(void *arg) {
+  thread_data_t *data=(thread_data_t*) arg;
+  igraph_matrix_t *M=data-&gt;m;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> *result=data-&gt;result;
+  pthread_cond_t *cond=data-&gt;cond;
+  pthread_mutex_t *mutex=data-&gt;mutex;
+  <link linkend='igraph_arpack_options_t'>igraph_arpack_options_t</link> options;
+  igraph_real_t *v, *workl, *workd, *d, *resid, *ax;
+  int *select;
+  int ido=0;
+  int rvec=1;
+  char *all="All";
+  int i;
+
+  <emphasis role="strong"><link linkend='igraph_arpack_options_init'>igraph_arpack_options_init</link></emphasis>(&amp;options);
+  options.n = <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(M);
+  options.ldv = options.n;
+  options.nev = 1;
+  options.ncv = 3;
+  options.lworkl = options.ncv * (options.ncv+8);
+  options.which[0] = 'L'; options.which[1] = 'M';
+
+  options.iparam[0]=options.ishift;
+  options.iparam[2]=options.mxiter;
+  options.iparam[3]=options.nb;
+  options.iparam[4]=0;
+  options.iparam[6]=options.mode;
+  options.info=options.start;
+
+  v=<emphasis role="strong">igraph_Calloc</emphasis>(options.ldv * options.ncv, igraph_real_t);
+  workl=<emphasis role="strong">igraph_Calloc</emphasis>(options.lworkl, igraph_real_t);
+  workd=<emphasis role="strong">igraph_Calloc</emphasis>(3*options.n, igraph_real_t);
+  d=<emphasis role="strong">igraph_Calloc</emphasis>(2*options.ncv, igraph_real_t);
+  resid=<emphasis role="strong">igraph_Calloc</emphasis>(options.n, igraph_real_t);
+  ax=<emphasis role="strong">igraph_Calloc</emphasis>(options.n, igraph_real_t);
+  select=<emphasis role="strong">igraph_Calloc</emphasis>(options.ncv, int);
+  
+  <emphasis role="strong">if</emphasis> (!v || !workl || !workd || !d || !resid || !ax || !select) { 
+    <emphasis role="strong">printf</emphasis>("Out of memory\n");
+    <emphasis role="strong">return</emphasis> 0;
+  }
+  
+  <emphasis role="strong">while</emphasis> (1) {
+    <emphasis role="strong">igraphdsaupd_</emphasis>(&amp;ido, options.bmat, &amp;options.n, options.which,
+		  &amp;options.nev, &amp;options.tol, resid, &amp;options.ncv, v, 
+		  &amp;options.ldv, options.iparam, options.ipntr, workd,
+		  workl, &amp;options.lworkl, &amp;options.info);
+    
+    <emphasis role="strong">if</emphasis> (ido == -1 || ido == 1) {
+      
+      igraph_real_t *from=workd+options.ipntr[0]-1;
+      igraph_real_t *to=workd+options.ipntr[1]-1;
+      <emphasis role="strong">arpack_mult</emphasis>(to, from, options.n, M);
+      
+    } <emphasis role="strong">else</emphasis> { 
+      <emphasis role="strong">break</emphasis>;
+    }
+
+    <emphasis role="strong">pthread_mutex_lock</emphasis>(mutex);
+    *(data-&gt;steps) += 1;
+    <emphasis role="strong">if</emphasis> ( *(data-&gt;othersteps) == *(data-&gt;steps) ) { 
+      <emphasis role="strong">pthread_cond_signal</emphasis>(cond);
+    }
+    <emphasis role="strong">pthread_mutex_unlock</emphasis>(mutex);
+
+    <emphasis role="strong">while</emphasis> ( *(data-&gt;othersteps) &lt; *(data-&gt;steps) &amp;&amp; *(data-&gt;othersteps) != -1 ) {
+      <emphasis role="strong">pthread_cond_wait</emphasis>(cond, mutex);
+    }
+    <emphasis role="strong">pthread_mutex_unlock</emphasis>(mutex);
+  }
+
+  <emphasis role="strong">pthread_mutex_lock</emphasis>(mutex);
+  *data-&gt;steps = -1;
+  <emphasis role="strong">pthread_cond_signal</emphasis>(cond);
+  <emphasis role="strong">pthread_mutex_unlock</emphasis>(mutex);
+
+  <emphasis role="strong">if</emphasis> (options.info != 0) {
+    <emphasis role="strong">printf</emphasis>("ARPACK error\n");
+    <emphasis role="strong">return</emphasis> 0;
+  }
+
+  <emphasis role="strong">igraphdseupd_</emphasis>(&amp;rvec, all, select, d, v, &amp;options.ldv,
+		&amp;options.sigma, options.bmat, &amp;options.n,
+		options.which, &amp;options.nev, &amp;options.tol,
+		resid, &amp;options.ncv, v, &amp;options.ldv, options.iparam,
+		options.ipntr, workd, workl, &amp;options.lworkl,
+		&amp;options.ierr);
+  
+  <emphasis role="strong">if</emphasis> (options.ierr != 0) {
+    <emphasis role="strong">printf</emphasis>("ARPACK error\n");
+    <emphasis role="strong">return</emphasis> 0;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(result, options.n);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;options.n; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*result)[i] = v[i];
+  }
+
+  <emphasis role="strong">free</emphasis>(v);
+  <emphasis role="strong">free</emphasis>(workl);
+  <emphasis role="strong">free</emphasis>(workd);
+  <emphasis role="strong">free</emphasis>(d);
+  <emphasis role="strong">free</emphasis>(resid);
+  <emphasis role="strong">free</emphasis>(ax);
+  <emphasis role="strong">free</emphasis>(select);
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  pthread_t thread_id1, thread_id2;
+  void *exit_status1, *exit_status2;
+  igraph_matrix_t m1, m2;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> result1, result2;
+  pthread_cond_t steps_cond = PTHREAD_COND_INITIALIZER;
+  pthread_mutex_t steps_mutex = PTHREAD_MUTEX_INITIALIZER;
+  int steps1=0, steps2=0;
+  thread_data_t 
+    data1 = { &amp;m1, &amp;result1, &amp;steps_cond, &amp;steps_mutex, &amp;steps1, &amp;steps2 },
+    data2 = { &amp;m2, &amp;result2, &amp;steps_cond, &amp;steps_mutex, &amp;steps2, &amp;steps1 };
+  int i, j;
+
+  <emphasis>/* Skip if igraph is not thread safe */</emphasis>
+  <emphasis role="strong">if</emphasis> (!<link linkend='IGRAPH_THREAD_SAFE'>IGRAPH_THREAD_SAFE</link>) {
+    <emphasis role="strong">return</emphasis> 77;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m1, 10, 10);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;m2, 10, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result1, <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m1));
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;result2, <emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m2));  
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 42);
+  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m1); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;=i; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m1, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m1, j, i) = 
+	<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, 10);
+    }
+  }
+
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;m2); i++) {
+    <emphasis role="strong">for</emphasis> (j=0; j&lt;=i; j++) {
+      <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m2, i, j) = <emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(m2, j, i) = 
+	<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 0, 10);
+    }
+  }
+
+  <emphasis role="strong">pthread_create</emphasis>(&amp;thread_id1, NULL, thread_function, (void *) &amp;data1);
+  <emphasis role="strong">pthread_create</emphasis>(&amp;thread_id2, NULL, thread_function, (void *) &amp;data2);
+
+  <emphasis role="strong">pthread_join</emphasis>(thread_id1, &amp;exit_status1);
+  <emphasis role="strong">pthread_join</emphasis>(thread_id2, &amp;exit_status2);
+
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;m1);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result1);
+  <emphasis role="strong">printf</emphasis>("---\n");
+  <emphasis role="strong">igraph_matrix_print</emphasis>(&amp;m2);
+  <emphasis role="strong">igraph_vector_print</emphasis>(&amp;result2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;result2);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m1);
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;m2);  
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/topology.c.xml igraph-0.6.5/examples/simple/topology.c.xml
--- igraph-0.6.5~quantal1/examples/simple/topology.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/topology.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,64 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t g;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> edges;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> vids;
+  igraph_integer_t class;
+  
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;edges, -1, 
+			     0,1, 1,3, 1,4, 1,6, 3,1,
+			     4,1, 4,2, 6,4, 6,5, 7,8,
+			     8,7, 7,9, 9,7, 8,9, 9,8,
+			     -1);
+  <emphasis role="strong"><link linkend='igraph_create'>igraph_create</link></emphasis>(&amp;g, &amp;edges, 0, IGRAPH_DIRECTED);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;edges);
+  
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;vids, -1, 1,4,6, -1);
+  <emphasis role="strong"><link linkend='igraph_isoclass_subgraph'>igraph_isoclass_subgraph</link></emphasis>(&amp;g, &amp;vids, &amp;class);
+  <emphasis role="strong">printf</emphasis>("class: %i\n", (int)class);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vids);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;vids, -1, 0,1,3, -1);
+  <emphasis role="strong"><link linkend='igraph_isoclass_subgraph'>igraph_isoclass_subgraph</link></emphasis>(&amp;g, &amp;vids, &amp;class);
+  <emphasis role="strong">printf</emphasis>("class: %i\n", (int)class);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vids);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;vids, -1, 7,8,9, -1);
+  <emphasis role="strong"><link linkend='igraph_isoclass_subgraph'>igraph_isoclass_subgraph</link></emphasis>(&amp;g, &amp;vids, &amp;class);
+  <emphasis role="strong">printf</emphasis>("class: %i\n", (int)class);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vids);
+
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;vids, -1, 0,2,5, -1);
+  <emphasis role="strong"><link linkend='igraph_isoclass_subgraph'>igraph_isoclass_subgraph</link></emphasis>(&amp;g, &amp;vids, &amp;class);
+  <emphasis role="strong">printf</emphasis>("class: %i\n", (int)class);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;vids);
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/vector.c.xml igraph-0.6.5/examples/simple/vector.c.xml
--- igraph-0.6.5~quantal1/examples/simple/vector.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/vector.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,342 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v, v2, v3;
+  int i;
+  igraph_real_t *ptr;
+  long int pos;
+
+  <emphasis>/* simple init */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* vector of zeros */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* VECTOR(), igraph_vector_size */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=10-i;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_reserve, igraph_vector_push_back */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_reserve'>igraph_vector_reserve</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;v, i);
+  }
+
+  <emphasis>/* igraph_vector_empty, igraph_vector_clear */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_empty'>igraph_vector_empty</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_clear'>igraph_vector_clear</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_empty'>igraph_vector_empty</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_e, igraph_vector_e_ptr */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    *<emphasis role="strong"><link linkend='igraph_vector_e_ptr'>igraph_vector_e_ptr</link></emphasis>(&amp;v, i) = 100*i;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='igraph_vector_e'>igraph_vector_e</link></emphasis>(&amp;v, i));
+  }
+  <emphasis role="strong">fprintf</emphasis>(stdout, "\n");
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_set */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_set'>igraph_vector_set</link></emphasis>(&amp;v, i, 20*i);
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_null */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=i+1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_tail, igraph_vector_pop_back */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=i+1;
+  }
+  <emphasis role="strong">while</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_empty'>igraph_vector_empty</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='igraph_vector_tail'>igraph_vector_tail</link></emphasis>(&amp;v));
+    <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='igraph_vector_pop_back'>igraph_vector_pop_back</link></emphasis>(&amp;v));
+  }
+  <emphasis role="strong">fprintf</emphasis>(stdout, "\n");
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_seq, igraph_vector_order */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong">igraph_vector_order1</emphasis>(&amp;v, &amp;v2, 10);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v2, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_resize, igraph_vector_sort */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 20);  
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=10-i;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_resize'>igraph_vector_resize</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_sort'>igraph_vector_sort</link></emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_max, igraph_vector_init_copy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=100-i;    
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(stdout, "\n");
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li\n", (long int)<emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;v));
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  ptr=(igraph_real_t*) <emphasis role="strong">malloc</emphasis>(10* <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_vector_init_copy'>igraph_vector_init_copy</link></emphasis>(&amp;v, ptr, 10);
+  <emphasis role="strong">free</emphasis>(ptr);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]=100-i;
+  }
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  
+  <emphasis>/* igraph_vector_copy_to */</emphasis>
+  ptr=(igraph_real_t*) <emphasis role="strong">malloc</emphasis>(10* <emphasis role="strong">sizeof</emphasis>(igraph_real_t));
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 11, 20);
+  <emphasis role="strong"><link linkend='igraph_vector_copy_to'>igraph_vector_copy_to</link></emphasis>(&amp;v, ptr);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)ptr[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(stdout, "\n");
+  <emphasis role="strong">free</emphasis>(ptr);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_seq, igraph_vector_sum, igraph_vector_prod */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 1, 5);
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;v));
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li\n", (long int)<emphasis role="strong"><link linkend='igraph_vector_prod'>igraph_vector_prod</link></emphasis>(&amp;v));
+  
+  <emphasis>/* igraph_vector_remove_section */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_remove_section'>igraph_vector_remove_section</link></emphasis>(&amp;v, 2, 4);
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li", (long int)<emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;v));
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li\n", (long int)<emphasis role="strong"><link linkend='igraph_vector_prod'>igraph_vector_prod</link></emphasis>(&amp;v));
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_remove */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_remove'>igraph_vector_remove</link></emphasis>(&amp;v, 9);
+  <emphasis role="strong"><link linkend='igraph_vector_remove'>igraph_vector_remove</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_remove'>igraph_vector_remove</link></emphasis>(&amp;v, 4);
+  <emphasis role="strong">fprintf</emphasis>(stdout, " %li\n", (long int)<emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;v));
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_move_interval */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 0, 9);
+  <emphasis role="strong">igraph_vector_move_interval</emphasis>(&amp;v, 5, 10, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_sum'>igraph_vector_sum</link></emphasis>(&amp;v) != 70) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+    
+  <emphasis>/* igraph_vector_isininterval */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 1, 10);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_isininterval'>igraph_vector_isininterval</link></emphasis>(&amp;v, 1, 10)) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_isininterval'>igraph_vector_isininterval</link></emphasis>(&amp;v, 2, 10)) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_isininterval'>igraph_vector_isininterval</link></emphasis>(&amp;v, 1, 9)) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+
+  <emphasis>/* igraph_vector_any_smaller */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_any_smaller</emphasis>(&amp;v, 1)) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_vector_any_smaller</emphasis>(&amp;v, 2)) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_all_e */</emphasis>
+
+  <emphasis>/* igraph_vector_binsearch */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 0, 9);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, 0, 0)) {
+      <emphasis role="strong">return</emphasis> 9;
+    }
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, 10, 0)) {
+    <emphasis role="strong">return</emphasis> 10;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, -1, 0)) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]= 2*i;
+  }
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    long int pos;
+    <emphasis role="strong">if</emphasis> (!<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i], &amp;pos)) {
+      <emphasis role="strong">fprintf</emphasis>(stderr, "cannot find %i\n", (int)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]);
+      <emphasis role="strong">return</emphasis> 12;
+    }
+    <emphasis role="strong">if</emphasis> (pos != i) {
+      <emphasis role="strong">return</emphasis> 13;
+    }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i]+1, &amp;pos)) {
+      <emphasis role="strong">return</emphasis> 14;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* Binsearch in empty vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 0);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_binsearch2'>igraph_vector_binsearch2</link></emphasis>(&amp;v, 0)) {
+    <emphasis role="strong">return</emphasis> 16;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_binsearch'>igraph_vector_binsearch</link></emphasis>(&amp;v, 1, &amp;pos)) {
+    <emphasis role="strong">return</emphasis> 17;
+  }
+  <emphasis role="strong">if</emphasis> (pos != 0) {
+    <emphasis role="strong">return</emphasis> 18;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_real */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real</emphasis>(&amp;v, 10, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_int */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int</emphasis>(&amp;v, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_real */</emphasis>
+  <emphasis role="strong">igraph_vector_init_real_end</emphasis>(&amp;v, -1, 1.0, 2.0, 3.0, 4.0, 5.0, 
+		       6.0, 7.0, 8.0, 9.0, 10.0, -1.0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_init_int */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -1);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* igraph_vector_permdelete */</emphasis>
+  <emphasis>/* igraph_vector_remove_negidx */</emphasis>
+
+  <emphasis>/* order2 */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 10,9,8,7,6,7,8,9,10, -1);
+  <emphasis role="strong">igraph_vector_order2</emphasis>(&amp;v);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* filter_smaller, quite special.... */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,2,3,4,4,4,4,5,6,7,8, -1);
+  <emphasis role="strong">igraph_vector_filter_smaller</emphasis>(&amp;v, 4);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 1,2,3,4,4,4,4,5,6,7,8, -1);
+  <emphasis role="strong">igraph_vector_filter_smaller</emphasis>(&amp;v, 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,0,1,2,3,4,4,4,4,5,6,7,8, -1);
+  <emphasis role="strong">igraph_vector_filter_smaller</emphasis>(&amp;v, 0);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis>/* rank */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v, -1, 0,1,2,6,5,2,1,0, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 0);
+  <emphasis role="strong">igraph_vector_rank</emphasis>(&amp;v, &amp;v2, 7);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v, stdout);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v2, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+
+  <emphasis>/* order */</emphasis>
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v,  -1, 1,1,2,2, -1);
+  <emphasis role="strong">igraph_vector_init_int_end</emphasis>(&amp;v2, -1, 2,3,1,3, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v3, 0);
+  <emphasis role="strong">igraph_vector_order</emphasis>(&amp;v, &amp;v2, &amp;v3, 3);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v3, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v3);
+
+  <emphasis>/* fill */</emphasis>
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v, 100);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;v, 1.234567);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v)[i] != 1.234567) { 
+      <emphasis role="strong">return</emphasis> 15;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 16;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+  
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/vector2.c.xml igraph-0.6.5/examples/simple/vector2.c.xml
--- igraph-0.6.5~quantal1/examples/simple/vector2.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/vector2.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,126 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+void <emphasis role="strong">print_vector</emphasis>(<link linkend='igraph_vector_t'>igraph_vector_t</link> *v, FILE *f) {
+  long int i;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(v); i++) {
+    <emphasis role="strong">fprintf</emphasis>(f, " %li", (long int) <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(*v)[i]);
+  }
+  <emphasis role="strong">fprintf</emphasis>(f, "\n");
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v1, v2, v3;
+  igraph_real_t min, max;
+  long int imin, imax;
+  int i;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v1, 1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v2, 0, 9);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_swap'>igraph_vector_swap</link></emphasis>(&amp;v1, &amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v2, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_swap_elements'>igraph_vector_swap_elements</link></emphasis>(&amp;v1, 0, 9);
+  <emphasis role="strong"><link linkend='igraph_vector_swap_elements'>igraph_vector_swap_elements</link></emphasis>(&amp;v1, 3, 6);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_reverse'>igraph_vector_reverse</link></emphasis>(&amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v2, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_reverse'>igraph_vector_reverse</link></emphasis>(&amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v2, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;v1, 4);
+  <emphasis role="strong"><link linkend='igraph_vector_fill'>igraph_vector_fill</link></emphasis>(&amp;v2, 2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_add'>igraph_vector_add</link></emphasis>(&amp;v1, &amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_sub'>igraph_vector_sub</link></emphasis>(&amp;v1, &amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_div'>igraph_vector_div</link></emphasis>(&amp;v1, &amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_mul'>igraph_vector_mul</link></emphasis>(&amp;v1, &amp;v2);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v1, stdout);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_minmax'>igraph_vector_minmax</link></emphasis>(&amp;v1, &amp;min, &amp;max);
+  <emphasis role="strong"><link linkend='igraph_vector_which_minmax'>igraph_vector_which_minmax</link></emphasis>(&amp;v1, &amp;imin, &amp;imax);
+  <emphasis role="strong">printf</emphasis>("%g %g %li %li\n", min, max, imin, imax);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v1, 1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v2, 10);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) { <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[i] = 10-i; }
+
+  <emphasis role="strong"><link linkend='igraph_vector_minmax'>igraph_vector_minmax</link></emphasis>(&amp;v1, &amp;min, &amp;max);
+  <emphasis role="strong"><link linkend='igraph_vector_which_minmax'>igraph_vector_which_minmax</link></emphasis>(&amp;v1, &amp;imin, &amp;imax);
+  <emphasis role="strong">printf</emphasis>("%g %g %li %li\n", min, max, imin, imax);
+  <emphasis role="strong"><link linkend='igraph_vector_minmax'>igraph_vector_minmax</link></emphasis>(&amp;v2, &amp;min, &amp;max);
+  <emphasis role="strong"><link linkend='igraph_vector_which_minmax'>igraph_vector_which_minmax</link></emphasis>(&amp;v2, &amp;imin, &amp;imax);
+  <emphasis role="strong">printf</emphasis>("%g %g %li %li\n", min, max, imin, imax);
+  
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_isnull</emphasis>(&amp;v1)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_null'>igraph_vector_null</link></emphasis>(&amp;v1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_vector_isnull</emphasis>(&amp;v1)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+
+  <emphasis role="strong">igraph_vector_init_int</emphasis>(&amp;v1, 10, 3, 5, 6, 6, 6, 7, 8, 8, 9, 10);
+  <emphasis role="strong">igraph_vector_init_int</emphasis>(&amp;v2, 10, 1, 3, 3, 6, 6, 9, 12, 15, 17, 20);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;v3, 0);
+
+  <emphasis role="strong"><link linkend='igraph_vector_intersect_sorted'>igraph_vector_intersect_sorted</link></emphasis>(&amp;v1, &amp;v2, &amp;v3);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v3, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_difference_sorted'>igraph_vector_difference_sorted</link></emphasis>(&amp;v1, &amp;v2, &amp;v3);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v3, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_difference_sorted'>igraph_vector_difference_sorted</link></emphasis>(&amp;v2, &amp;v1, &amp;v3);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v3, stdout);
+  <emphasis role="strong"><link linkend='igraph_vector_difference_sorted'>igraph_vector_difference_sorted</link></emphasis>(&amp;v2, &amp;v2, &amp;v3);
+  <emphasis role="strong">print_vector</emphasis>(&amp;v3, stdout);
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v2);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v3);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 3; 
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/vector3.c.xml igraph-0.6.5/examples/simple/vector3.c.xml
--- igraph-0.6.5~quantal1/examples/simple/vector3.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/vector3.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,47 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard st, Cambridge MA, USA 02139</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> v;
+  
+  <emphasis role="strong"><link linkend='igraph_vector_init_seq'>igraph_vector_init_seq</link></emphasis>(&amp;v, 1, 1000);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_capacity'>igraph_vector_capacity</link></emphasis>(&amp;v) != 1000) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_push_back'>igraph_vector_push_back</link></emphasis>(&amp;v, 1001);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_capacity'>igraph_vector_capacity</link></emphasis>(&amp;v) != 2000) { 
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_vector_resize_min'>igraph_vector_resize_min</link></emphasis>(&amp;v);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_capacity'>igraph_vector_capacity</link></emphasis>(&amp;v) != <emphasis role="strong"><link linkend='igraph_vector_size'>igraph_vector_size</link></emphasis>(&amp;v)) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;v);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/vector_ptr.c.xml igraph-0.6.5/examples/simple/vector_ptr.c.xml
--- igraph-0.6.5~quantal1/examples/simple/vector_ptr.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/vector_ptr.c.xml	2013-03-03 01:45:59.000000000 +0000
@@ -0,0 +1,278 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2006-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdlib.h&gt;
+
+igraph_vector_ptr_t custom_destructor_stack;
+
+void <emphasis role="strong">custom_destructor</emphasis>(void* ptr) {
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_push_back'>igraph_vector_ptr_push_back</link></emphasis>(&amp;custom_destructor_stack, ptr);
+}
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_vector_ptr_t v1, v2;
+  <emphasis role="strong">const</emphasis> igraph_vector_ptr_t v3=IGRAPH_VECTOR_PTR_NULL;
+  int i;
+  void ** ptr;
+  int d1=1, d2=2, d3=3, d4=4, d5=5;
+  char *block1=0, *block2=0;
+
+  <emphasis>/* igraph_vector_ptr_init, igraph_vector_ptr_destroy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_free_all, igraph_vector_ptr_destroy_all */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[i]=(void*)<emphasis role="strong">malloc</emphasis>(i*10);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_free_all'>igraph_vector_ptr_free_all</link></emphasis>(&amp;v1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1); i++) {
+    <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[i]=(void*)<emphasis role="strong">malloc</emphasis>(i*10);
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy_all'>igraph_vector_ptr_destroy_all</link></emphasis>(&amp;v1);     
+  
+  <emphasis>/* igraph_vector_ptr_reserve */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 0);
+  <emphasis role="strong">igraph_vector_ptr_reserve</emphasis>(&amp;v1, 5);
+  <emphasis role="strong">igraph_vector_ptr_reserve</emphasis>(&amp;v1, 15);
+  <emphasis role="strong">igraph_vector_ptr_reserve</emphasis>(&amp;v1, 1);
+  <emphasis role="strong">igraph_vector_ptr_reserve</emphasis>(&amp;v1, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_empty, igraph_vector_ptr_clear */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">igraph_vector_ptr_empty</emphasis>(&amp;v1)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_clear'>igraph_vector_ptr_clear</link></emphasis>(&amp;v1);
+  <emphasis role="strong">if</emphasis> (!<emphasis role="strong">igraph_vector_ptr_empty</emphasis>(&amp;v1)) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+
+  <emphasis>/* igraph_vector_ptr_size */</emphasis>
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1) != 0) {
+    <emphasis role="strong">return</emphasis> 3;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_resize'>igraph_vector_ptr_resize</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1) != 10) {
+    <emphasis role="strong">return</emphasis> 4;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_push_back */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 0);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;10; i++) {
+    <emphasis role="strong"><link linkend='igraph_vector_ptr_push_back'>igraph_vector_ptr_push_back</link></emphasis>(&amp;v1, (void*)<emphasis role="strong">malloc</emphasis>(i*10));
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy_all'>igraph_vector_ptr_destroy_all</link></emphasis>(&amp;v1);
+  
+  <emphasis>/* igraph_vector_ptr_e */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[0]=&amp;d1;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[1]=&amp;d2;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[2]=&amp;d3;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[3]=&amp;d4;
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[4]=&amp;d5;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 0) != &amp;d1) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 1) != &amp;d2) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 2) != &amp;d3) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 3) != &amp;d4) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 4) != &amp;d5) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_set */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 0, &amp;d1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 1, &amp;d2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 2, &amp;d3);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 3, &amp;d4);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 4, &amp;d5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 0) != &amp;d1) {
+    <emphasis role="strong">return</emphasis> 5;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 1) != &amp;d2) {
+    <emphasis role="strong">return</emphasis> 6;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 2) != &amp;d3) {
+    <emphasis role="strong">return</emphasis> 7;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 3) != &amp;d4) {
+    <emphasis role="strong">return</emphasis> 8;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 4) != &amp;d5) {
+    <emphasis role="strong">return</emphasis> 9;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_null */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 0, &amp;d1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 1, &amp;d2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 2, &amp;d3);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 3, &amp;d4);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 4, &amp;d5);
+  <emphasis role="strong">igraph_vector_ptr_null</emphasis>(&amp;v1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1); i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[i] != 0) {
+      <emphasis role="strong">return</emphasis> 10;
+    }
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_resize */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 0, &amp;d1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 1, &amp;d2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 2, &amp;d3);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 3, &amp;d4);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 4, &amp;d5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_resize'>igraph_vector_ptr_resize</link></emphasis>(&amp;v1, 10);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_resize'>igraph_vector_ptr_resize</link></emphasis>(&amp;v1, 15);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_resize'>igraph_vector_ptr_resize</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1) != 5) {
+    <emphasis role="strong">return</emphasis> 11;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 0) != &amp;d1) {
+    <emphasis role="strong">return</emphasis> 12;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 1) != &amp;d2) {
+    <emphasis role="strong">return</emphasis> 13;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 2) != &amp;d3) {
+    <emphasis role="strong">return</emphasis> 14;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 3) != &amp;d4) {
+    <emphasis role="strong">return</emphasis> 15;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_e'>igraph_vector_ptr_e</link></emphasis>(&amp;v1, 4) != &amp;d5) {
+    <emphasis role="strong">return</emphasis> 16;
+  }
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_view */</emphasis>
+  ptr=(void**) <emphasis role="strong">malloc</emphasis>(5 * <emphasis role="strong">sizeof</emphasis>(void*));
+  <emphasis role="strong">igraph_vector_ptr_view</emphasis>(&amp;v3, ptr, 5);
+  ptr[0]=&amp;d1; ptr[1]=&amp;d2; ptr[2]=&amp;d3; ptr[3]=&amp;d4; ptr[4]=&amp;d5;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v3); i++) {
+    <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v3)[i]) != i+1) {
+      <emphasis role="strong">return</emphasis> 17;
+    }
+  }
+  
+  <emphasis>/* igraph_vector_ptr_init_copy */</emphasis>
+  <emphasis role="strong">igraph_vector_ptr_init_copy</emphasis>(&amp;v1, ptr, 5);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1); i++) {
+    <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[i]) != i+1) {
+      <emphasis role="strong">return</emphasis> 18;
+    }
+  }
+
+  <emphasis>/* igraph_vector_ptr_copy_to */</emphasis>
+  <emphasis role="strong">igraph_vector_ptr_copy_to</emphasis>(&amp;v1, ptr);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v1); i++) {
+    <emphasis role="strong">if</emphasis> ( *((int*)ptr[i]) != i+1) {
+      <emphasis role="strong">return</emphasis> 19;
+    }
+  }
+  <emphasis role="strong">free</emphasis>(ptr);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+
+  <emphasis>/* igraph_vector_ptr_copy */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 0, &amp;d1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 1, &amp;d2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 2, &amp;d3);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 3, &amp;d4);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_set'>igraph_vector_ptr_set</link></emphasis>(&amp;v1, 4, &amp;d5);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_copy'>igraph_vector_ptr_copy</link></emphasis>(&amp;v2, &amp;v1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v1);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_vector_ptr_size'>igraph_vector_ptr_size</link></emphasis>(&amp;v2); i++) {
+    <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[i]) != i+1) {
+      <emphasis role="strong">return</emphasis> 20;
+    }
+  }
+
+  <emphasis>/* igraph_vector_ptr_remove */</emphasis>
+  <emphasis role="strong">igraph_vector_ptr_remove</emphasis>(&amp;v2, 0);
+  <emphasis role="strong">igraph_vector_ptr_remove</emphasis>(&amp;v2, 3);
+  <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[0]) != 2) {
+      <emphasis role="strong">return</emphasis> 21;
+  }
+  <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[1]) != 3) {
+      <emphasis role="strong">return</emphasis> 22;
+  }
+  <emphasis role="strong">if</emphasis> ( *((int*)<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v2)[2]) != 4) {
+      <emphasis role="strong">return</emphasis> 23;
+  }
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;v2);
+
+  <emphasis>/* Testing destructor */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;custom_destructor_stack, 0);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_init'>igraph_vector_ptr_init</link></emphasis>(&amp;v1, 2);
+  block1 = <emphasis role="strong">igraph_Calloc</emphasis>(32, char);
+  block2 = <emphasis role="strong">igraph_Calloc</emphasis>(64, char);
+  <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[0] = block1; <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(v1)[1] = block2;
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_get_item_destructor'>igraph_vector_ptr_get_item_destructor</link></emphasis>(&amp;v1) != 0) {
+    <emphasis role="strong">return</emphasis> 24;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_ptr_set_item_destructor'>igraph_vector_ptr_set_item_destructor</link></emphasis>(&amp;v1, &amp;custom_destructor) != 0) {
+    <emphasis role="strong">return</emphasis> 25;
+  }
+  <emphasis>/* Okay, let's clear the vector. This should push the blocks in the</emphasis>
+<emphasis>   * custom destructor stack */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_clear'>igraph_vector_ptr_clear</link></emphasis>(&amp;v1);
+  <emphasis>/* Put the blocks back and destroy the vector */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_push_back'>igraph_vector_ptr_push_back</link></emphasis>(&amp;v1, block1);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_push_back'>igraph_vector_ptr_push_back</link></emphasis>(&amp;v1, block2);
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy_all'>igraph_vector_ptr_destroy_all</link></emphasis>(&amp;v1);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(custom_destructor_stack)[0] != block1 ||
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(custom_destructor_stack)[1] != block2 ||
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(custom_destructor_stack)[2] != block1 ||
+      <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(custom_destructor_stack)[3] != block2
+     )
+    <emphasis role="strong">return</emphasis> 26;
+
+  <emphasis role="strong"><link linkend='igraph_vector_ptr_destroy'>igraph_vector_ptr_destroy</link></emphasis>(&amp;custom_destructor_stack);
+
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FINALLY_STACK_SIZE</emphasis>() != 0) <emphasis role="strong">return</emphasis> 27;
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/walktrap.c.xml igraph-0.6.5/examples/simple/walktrap.c.xml
--- igraph-0.6.5~quantal1/examples/simple/walktrap.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/walktrap.c.xml	2013-03-03 01:46:00.000000000 +0000
@@ -0,0 +1,71 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph library.</emphasis>
+<emphasis>   Copyright (C) 2007-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+
+int <emphasis role="strong">main</emphasis>() {
+  igraph_t g;
+  igraph_matrix_t merges;
+  <link linkend='igraph_vector_t'>igraph_vector_t</link> modularity;
+  long int no_of_nodes;
+  long int i;
+  
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_UNDIRECTED, 
+	       0,1,0,2,0,3,0,4, 1,2,1,3,1,4, 2,3,2,4, 3,4,
+	       5,6,5,7,5,8,5,9, 6,7,6,8,6,9, 7,8,7,9, 8,9, 0,5, -1);
+  <emphasis role="strong"><link linkend='igraph_vector_init'>igraph_vector_init</link></emphasis>(&amp;modularity, 0);
+  <emphasis role="strong"><link linkend='igraph_matrix_init'>igraph_matrix_init</link></emphasis>(&amp;merges, 0, 0);
+  
+  <emphasis role="strong"><link linkend='igraph_community_walktrap'>igraph_community_walktrap</link></emphasis>(&amp;g, 0 <emphasis>/* no weights */</emphasis>,
+			    4 <emphasis>/* steps */</emphasis>,
+			    &amp;merges, &amp;modularity, 
+			    <emphasis>/* membership=*/</emphasis> 0);
+  
+  no_of_nodes=<emphasis role="strong"><link linkend='igraph_vcount'>igraph_vcount</link></emphasis>(&amp;g);
+  <emphasis role="strong">printf</emphasis>("Merges:\n");
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;<emphasis role="strong"><link linkend='igraph_matrix_nrow'>igraph_matrix_nrow</link></emphasis>(&amp;merges); i++) {
+    <emphasis role="strong">printf</emphasis>("%2.1li + %2.li -&gt; %2.li (modularity %4.2f)\n", 
+	   (long int)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(merges, i, 0), 
+	   (long int)<emphasis role="strong"><link linkend='MATRIX'>MATRIX</link></emphasis>(merges, i, 1), 
+	   no_of_nodes+i,
+	   <emphasis role="strong"><link linkend='VECTOR'>VECTOR</link></emphasis>(modularity)[i]);
+  }
+  
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis>/* isolated vertices */</emphasis>
+  <emphasis role="strong"><link linkend='igraph_small'>igraph_small</link></emphasis>(&amp;g, 5, IGRAPH_UNDIRECTED, -1);
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_community_walktrap'>igraph_community_walktrap</link></emphasis>(&amp;g, 0 <emphasis>/* no weights */</emphasis>, 4 <emphasis>/* steps */</emphasis>, &amp;merges,
+      &amp;modularity, <emphasis>/* membership = */</emphasis> 0)) {
+    <emphasis role="strong">return</emphasis> 1;
+  }
+  <emphasis role="strong">if</emphasis> (<emphasis role="strong"><link linkend='igraph_vector_min'>igraph_vector_min</link></emphasis>(&amp;modularity) != 0 || <emphasis role="strong"><link linkend='igraph_vector_max'>igraph_vector_max</link></emphasis>(&amp;modularity) != 0) {
+    <emphasis role="strong">return</emphasis> 2;
+  }
+  <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;g);
+
+  <emphasis role="strong"><link linkend='igraph_matrix_destroy'>igraph_matrix_destroy</link></emphasis>(&amp;merges);
+  <emphasis role="strong"><link linkend='igraph_vector_destroy'>igraph_vector_destroy</link></emphasis>(&amp;modularity);
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/examples/simple/watts_strogatz_game.c.xml igraph-0.6.5/examples/simple/watts_strogatz_game.c.xml
--- igraph-0.6.5~quantal1/examples/simple/watts_strogatz_game.c.xml	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/examples/simple/watts_strogatz_game.c.xml	2013-03-03 01:46:00.000000000 +0000
@@ -0,0 +1,113 @@
+<programlisting linenumbering="numbered"><emphasis>/* -*- mode: C -*-  */</emphasis>
+<emphasis>/* </emphasis>
+<emphasis>   IGraph R library.</emphasis>
+<emphasis>   Copyright (C) 2011-2012  Gabor Csardi </emphasis>&lt;csardi.gabor@gmail.com&gt;
+<emphasis>   334 Harvard street, Cambridge MA, 02139 USA</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is free software; you can redistribute it and/or modify</emphasis>
+<emphasis>   it under the terms of the GNU General Public License as published by</emphasis>
+<emphasis>   the Free Software Foundation; either version 2 of the License, or</emphasis>
+<emphasis>   (at your option) any later version.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   This program is distributed in the hope that it will be useful,</emphasis>
+<emphasis>   but WITHOUT ANY WARRANTY; without even the implied warranty of</emphasis>
+<emphasis>   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</emphasis>
+<emphasis>   GNU General Public License for more details.</emphasis>
+<emphasis>   </emphasis>
+<emphasis>   You should have received a copy of the GNU General Public License</emphasis>
+<emphasis>   along with this program; if not, write to the Free Software</emphasis>
+<emphasis>   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA </emphasis>
+<emphasis>   02110-1301 USA</emphasis>
+
+<emphasis>*/</emphasis>
+
+<emphasis role="strong">#include</emphasis> &lt;igraph.h&gt;
+<emphasis role="strong">#include</emphasis> &lt;stdio.h&gt;
+
+<emphasis role="strong">#define</emphasis> N 1000
+
+igraph_bool_t <emphasis role="strong">has_loops</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph) {
+  int i, n=<emphasis role="strong"><link linkend='igraph_ecount'>igraph_ecount</link></emphasis>(graph);
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;n; i++) {
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">IGRAPH_FROM</emphasis>(graph, i) == <emphasis role="strong">IGRAPH_TO</emphasis>(graph, i)) { <emphasis role="strong">return</emphasis> 1; }
+  }
+  <emphasis role="strong">return</emphasis> 0;
+}
+
+igraph_bool_t <emphasis role="strong">has_multiple</emphasis>(<emphasis role="strong">const</emphasis> igraph_t *graph) {
+  igraph_bool_t res;
+  <emphasis role="strong"><link linkend='igraph_has_multiple'>igraph_has_multiple</link></emphasis>(graph, &amp;res);
+  <emphasis role="strong">return</emphasis> res;
+}
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">ERR</emphasis>() <emphasis role="strong">do</emphasis> {				\
+  <emphasis role="strong">printf</emphasis>("Seed: %d\n", seed);			\
+  <emphasis role="strong"><link linkend='igraph_write_graph_edgelist'>igraph_write_graph_edgelist</link></emphasis>(&amp;ws, stdout);	\
+  } <emphasis role="strong">while</emphasis> (0)
+
+<emphasis role="strong">#define</emphasis> <emphasis role="strong">SEED</emphasis>() <emphasis role="strong">do</emphasis> {							\
+    seed=<emphasis role="strong"><link linkend='igraph_rng_get_integer'>igraph_rng_get_integer</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), 1, 10000);		\
+    <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), seed);				\
+  } <emphasis role="strong">while</emphasis> (0)
+
+int <emphasis role="strong">main</emphasis>() {
+  
+  igraph_t ws;
+  igraph_bool_t sim, seen_loops, seen_multiple;
+  int i, seed=1305473657;
+
+  <emphasis role="strong"><link linkend='igraph_rng_seed'>igraph_rng_seed</link></emphasis>(<emphasis role="strong"><link linkend='igraph_rng_default'>igraph_rng_default</link></emphasis>(), seed);
+  
+  <emphasis>/* No loops, no multiple edges */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;N; i++) {
+    <emphasis role="strong">SEED</emphasis>();
+    <emphasis role="strong"><link linkend='igraph_watts_strogatz_game'>igraph_watts_strogatz_game</link></emphasis>(&amp;ws, <emphasis>/*dim=*/</emphasis> 1, <emphasis>/*size=*/</emphasis> 5, <emphasis>/*nei=*/</emphasis> 1,
+			       <emphasis>/*p=*/</emphasis> 0.5, <emphasis>/*loops=*/</emphasis> 0, <emphasis>/*multiple=*/</emphasis> 0);
+    <emphasis role="strong"><link linkend='igraph_is_simple'>igraph_is_simple</link></emphasis>(&amp;ws, &amp;sim); <emphasis role="strong">if</emphasis> (!sim) { <emphasis role="strong">ERR</emphasis>(); <emphasis role="strong">return</emphasis> 1; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">has_loops</emphasis>(&amp;ws)) { <emphasis role="strong">ERR</emphasis>(); <emphasis role="strong">return</emphasis> 1; }
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">has_multiple</emphasis>(&amp;ws)) { <emphasis role="strong">ERR</emphasis>(); <emphasis role="strong">return</emphasis> 2; }
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ws);
+  }
+
+  <emphasis>/* No loops, multiple edges possible */</emphasis>
+  seen_multiple=0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;N; i++) {
+    <emphasis role="strong">SEED</emphasis>();
+    <emphasis role="strong"><link linkend='igraph_watts_strogatz_game'>igraph_watts_strogatz_game</link></emphasis>(&amp;ws, <emphasis>/*dim=*/</emphasis> 1, <emphasis>/*size=*/</emphasis> 5, <emphasis>/*nei=*/</emphasis> 1,
+			       <emphasis>/*p=*/</emphasis> 0.5, <emphasis>/*loops=*/</emphasis> 0, <emphasis>/*multiple=*/</emphasis> 1);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">has_loops</emphasis>(&amp;ws)) { <emphasis role="strong">ERR</emphasis>(); <emphasis role="strong">return</emphasis> 3; }
+    seen_multiple = seen_multiple || <emphasis role="strong">has_multiple</emphasis>(&amp;ws);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ws);
+  }  
+  <emphasis>/* This might actually happen */</emphasis>
+  <emphasis>/* if (!seen_multiple) { return 4; } */</emphasis>
+
+  <emphasis>/* Loops possible, no multiple edges */</emphasis>
+  seen_loops=0;
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;N; i++) {
+    <emphasis role="strong">SEED</emphasis>();
+    <emphasis role="strong"><link linkend='igraph_watts_strogatz_game'>igraph_watts_strogatz_game</link></emphasis>(&amp;ws, <emphasis>/*dim=*/</emphasis> 1, <emphasis>/*size=*/</emphasis> 5, <emphasis>/*nei=*/</emphasis> 1,
+			       <emphasis>/*p=*/</emphasis> 0.5, <emphasis>/*loops=*/</emphasis> 1, <emphasis>/*multiple=*/</emphasis> 0);
+    <emphasis role="strong">if</emphasis> (<emphasis role="strong">has_multiple</emphasis>(&amp;ws)) { <emphasis role="strong">return</emphasis> 5; }
+    seen_loops = seen_loops || <emphasis role="strong">has_loops</emphasis>(&amp;ws);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ws);
+  }
+  <emphasis>/* This might actually happen */</emphasis>
+  <emphasis>/* if (!seen_loops) { return 6; } */</emphasis>
+  
+  <emphasis>/* Both loops and multiple edges are possible */</emphasis>
+  <emphasis role="strong">for</emphasis> (i=0; i&lt;N; i++) {
+    <emphasis role="strong">SEED</emphasis>();
+    <emphasis role="strong"><link linkend='igraph_watts_strogatz_game'>igraph_watts_strogatz_game</link></emphasis>(&amp;ws, <emphasis>/*dim=*/</emphasis> 1, <emphasis>/*size=*/</emphasis> 5, <emphasis>/*nei=*/</emphasis> 1,
+			       <emphasis>/*p=*/</emphasis> 0.5, <emphasis>/*loops=*/</emphasis> 1, <emphasis>/*multiple=*/</emphasis> 1);
+    seen_loops = seen_loops || <emphasis role="strong">has_loops</emphasis>(&amp;ws);
+    seen_multiple = seen_multiple || <emphasis role="strong">has_multiple</emphasis>(&amp;ws);
+    <emphasis role="strong"><link linkend='igraph_destroy'>igraph_destroy</link></emphasis>(&amp;ws);
+  }
+  <emphasis>/* This might actually happen */</emphasis>
+  <emphasis>/* if (!seen_loops) { return 7; } */</emphasis>
+  <emphasis>/* if (!seen_multiple) { return 8; }   */</emphasis>
+
+  <emphasis role="strong">return</emphasis> 0;
+}
+</programlisting>
diff -Nru igraph-0.6.5~quantal1/igraph.pc igraph-0.6.5/igraph.pc
--- igraph-0.6.5~quantal1/igraph.pc	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/igraph.pc	2013-03-03 01:29:55.000000000 +0000
@@ -0,0 +1,12 @@
+prefix=/usr/local
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: libigraph
+Description: A library for creating and manipulating graphs
+Version: 0.6.5
+URL: http://igraph.sourceforge.net
+Libs: -L${libdir} -ligraph
+Libs.private: -lxml2 -lz -lm
+Cflags: -I${includedir}/igraph
diff -Nru igraph-0.6.5~quantal1/include/igraph_threading.h igraph-0.6.5/include/igraph_threading.h
--- igraph-0.6.5~quantal1/include/igraph_threading.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/include/igraph_threading.h	2013-03-03 01:29:55.000000000 +0000
@@ -0,0 +1,51 @@
+/* -*- mode: C -*-  */
+/* 
+   IGraph library.
+   Copyright (C) 2011-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard street, Cambridge, MA 02139 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#ifndef IGRAPH_THREADING_H
+#define IGRAPH_THREADING_H
+
+#undef __BEGIN_DECLS
+#undef __END_DECLS
+#ifdef __cplusplus
+# define __BEGIN_DECLS extern "C" {
+# define __END_DECLS }
+#else
+# define __BEGIN_DECLS /* empty */
+# define __END_DECLS /* empty */
+#endif
+
+__BEGIN_DECLS
+
+/** 
+ * \define IGRAPH_THREAD_SAFE
+ * 
+ * Macro that is defined to be 1 if the current build of the 
+ * igraph library is thread-safe, and 0 if it is not.
+ */
+
+#define IGRAPH_THREAD_SAFE 1
+
+__END_DECLS
+
+#endif
+
diff -Nru igraph-0.6.5~quantal1/include/igraph_version.h igraph-0.6.5/include/igraph_version.h
--- igraph-0.6.5~quantal1/include/igraph_version.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/include/igraph_version.h	2013-03-03 01:29:55.000000000 +0000
@@ -0,0 +1,36 @@
+/* -*- mode: C -*-  */
+/* 
+   IGraph library.
+   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard street, Cambridge, MA 02139 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#ifndef IGRAPH_VERSION_H
+#define IGRAPH_VERSION_H
+
+#define IGRAPH_VERSION "0.6.5"
+
+int igraph_version(const char **version_string,
+		   int *major,
+		   int *minor,
+		   int *subminor);
+
+#endif
+
+
diff -Nru igraph-0.6.5~quantal1/install-sh igraph-0.6.5/install-sh
--- igraph-0.6.5~quantal1/install-sh	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/install-sh	2013-03-03 01:29:38.000000000 +0000
@@ -0,0 +1,527 @@
+#!/bin/sh
+# install - install a program, script, or datafile
+
+scriptversion=2011-01-19.21; # UTC
+
+# This originates from X11R5 (mit/util/scripts/install.sh), which was
+# later released in X11R6 (xc/config/util/install.sh) with the
+# following copyright and license.
+#
+# Copyright (C) 1994 X Consortium
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to
+# deal in the Software without restriction, including without limitation the
+# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+# sell copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
+# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+# Except as contained in this notice, the name of the X Consortium shall not
+# be used in advertising or otherwise to promote the sale, use or other deal-
+# ings in this Software without prior written authorization from the X Consor-
+# tium.
+#
+#
+# FSF changes to this file are in the public domain.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# `make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.
+
+nl='
+'
+IFS=" ""	$nl"
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit=${DOITPROG-}
+if test -z "$doit"; then
+  doit_exec=exec
+else
+  doit_exec=$doit
+fi
+
+# Put in absolute file names if you don't have them in your path;
+# or use environment vars.
+
+chgrpprog=${CHGRPPROG-chgrp}
+chmodprog=${CHMODPROG-chmod}
+chownprog=${CHOWNPROG-chown}
+cmpprog=${CMPPROG-cmp}
+cpprog=${CPPROG-cp}
+mkdirprog=${MKDIRPROG-mkdir}
+mvprog=${MVPROG-mv}
+rmprog=${RMPROG-rm}
+stripprog=${STRIPPROG-strip}
+
+posix_glob='?'
+initialize_posix_glob='
+  test "$posix_glob" != "?" || {
+    if (set -f) 2>/dev/null; then
+      posix_glob=
+    else
+      posix_glob=:
+    fi
+  }
+'
+
+posix_mkdir=
+
+# Desired mode of installed file.
+mode=0755
+
+chgrpcmd=
+chmodcmd=$chmodprog
+chowncmd=
+mvcmd=$mvprog
+rmcmd="$rmprog -f"
+stripcmd=
+
+src=
+dst=
+dir_arg=
+dst_arg=
+
+copy_on_change=false
+no_target_directory=
+
+usage="\
+Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
+   or: $0 [OPTION]... SRCFILES... DIRECTORY
+   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
+   or: $0 [OPTION]... -d DIRECTORIES...
+
+In the 1st form, copy SRCFILE to DSTFILE.
+In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
+In the 4th, create DIRECTORIES.
+
+Options:
+     --help     display this help and exit.
+     --version  display version info and exit.
+
+  -c            (ignored)
+  -C            install only if different (preserve the last data modification time)
+  -d            create directories instead of installing files.
+  -g GROUP      $chgrpprog installed files to GROUP.
+  -m MODE       $chmodprog installed files to MODE.
+  -o USER       $chownprog installed files to USER.
+  -s            $stripprog installed files.
+  -t DIRECTORY  install into DIRECTORY.
+  -T            report an error if DSTFILE is a directory.
+
+Environment variables override the default commands:
+  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
+  RMPROG STRIPPROG
+"
+
+while test $# -ne 0; do
+  case $1 in
+    -c) ;;
+
+    -C) copy_on_change=true;;
+
+    -d) dir_arg=true;;
+
+    -g) chgrpcmd="$chgrpprog $2"
+	shift;;
+
+    --help) echo "$usage"; exit $?;;
+
+    -m) mode=$2
+	case $mode in
+	  *' '* | *'	'* | *'
+'*	  | *'*'* | *'?'* | *'['*)
+	    echo "$0: invalid mode: $mode" >&2
+	    exit 1;;
+	esac
+	shift;;
+
+    -o) chowncmd="$chownprog $2"
+	shift;;
+
+    -s) stripcmd=$stripprog;;
+
+    -t) dst_arg=$2
+	# Protect names problematic for `test' and other utilities.
+	case $dst_arg in
+	  -* | [=\(\)!]) dst_arg=./$dst_arg;;
+	esac
+	shift;;
+
+    -T) no_target_directory=true;;
+
+    --version) echo "$0 $scriptversion"; exit $?;;
+
+    --)	shift
+	break;;
+
+    -*)	echo "$0: invalid option: $1" >&2
+	exit 1;;
+
+    *)  break;;
+  esac
+  shift
+done
+
+if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
+  # When -d is used, all remaining arguments are directories to create.
+  # When -t is used, the destination is already specified.
+  # Otherwise, the last argument is the destination.  Remove it from $@.
+  for arg
+  do
+    if test -n "$dst_arg"; then
+      # $@ is not empty: it contains at least $arg.
+      set fnord "$@" "$dst_arg"
+      shift # fnord
+    fi
+    shift # arg
+    dst_arg=$arg
+    # Protect names problematic for `test' and other utilities.
+    case $dst_arg in
+      -* | [=\(\)!]) dst_arg=./$dst_arg;;
+    esac
+  done
+fi
+
+if test $# -eq 0; then
+  if test -z "$dir_arg"; then
+    echo "$0: no input file specified." >&2
+    exit 1
+  fi
+  # It's OK to call `install-sh -d' without argument.
+  # This can happen when creating conditional directories.
+  exit 0
+fi
+
+if test -z "$dir_arg"; then
+  do_exit='(exit $ret); exit $ret'
+  trap "ret=129; $do_exit" 1
+  trap "ret=130; $do_exit" 2
+  trap "ret=141; $do_exit" 13
+  trap "ret=143; $do_exit" 15
+
+  # Set umask so as not to create temps with too-generous modes.
+  # However, 'strip' requires both read and write access to temps.
+  case $mode in
+    # Optimize common cases.
+    *644) cp_umask=133;;
+    *755) cp_umask=22;;
+
+    *[0-7])
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw='% 200'
+      fi
+      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
+    *)
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw=,u+rw
+      fi
+      cp_umask=$mode$u_plus_rw;;
+  esac
+fi
+
+for src
+do
+  # Protect names problematic for `test' and other utilities.
+  case $src in
+    -* | [=\(\)!]) src=./$src;;
+  esac
+
+  if test -n "$dir_arg"; then
+    dst=$src
+    dstdir=$dst
+    test -d "$dstdir"
+    dstdir_status=$?
+  else
+
+    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
+    # might cause directories to be created, which would be especially bad
+    # if $src (and thus $dsttmp) contains '*'.
+    if test ! -f "$src" && test ! -d "$src"; then
+      echo "$0: $src does not exist." >&2
+      exit 1
+    fi
+
+    if test -z "$dst_arg"; then
+      echo "$0: no destination specified." >&2
+      exit 1
+    fi
+    dst=$dst_arg
+
+    # If destination is a directory, append the input filename; won't work
+    # if double slashes aren't ignored.
+    if test -d "$dst"; then
+      if test -n "$no_target_directory"; then
+	echo "$0: $dst_arg: Is a directory" >&2
+	exit 1
+      fi
+      dstdir=$dst
+      dst=$dstdir/`basename "$src"`
+      dstdir_status=0
+    else
+      # Prefer dirname, but fall back on a substitute if dirname fails.
+      dstdir=`
+	(dirname "$dst") 2>/dev/null ||
+	expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	     X"$dst" : 'X\(//\)[^/]' \| \
+	     X"$dst" : 'X\(//\)$' \| \
+	     X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
+	echo X"$dst" |
+	    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)[^/].*/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\).*/{
+		   s//\1/
+		   q
+		 }
+		 s/.*/./; q'
+      `
+
+      test -d "$dstdir"
+      dstdir_status=$?
+    fi
+  fi
+
+  obsolete_mkdir_used=false
+
+  if test $dstdir_status != 0; then
+    case $posix_mkdir in
+      '')
+	# Create intermediate dirs using mode 755 as modified by the umask.
+	# This is like FreeBSD 'install' as of 1997-10-28.
+	umask=`umask`
+	case $stripcmd.$umask in
+	  # Optimize common cases.
+	  *[2367][2367]) mkdir_umask=$umask;;
+	  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
+
+	  *[0-7])
+	    mkdir_umask=`expr $umask + 22 \
+	      - $umask % 100 % 40 + $umask % 20 \
+	      - $umask % 10 % 4 + $umask % 2
+	    `;;
+	  *) mkdir_umask=$umask,go-w;;
+	esac
+
+	# With -d, create the new directory with the user-specified mode.
+	# Otherwise, rely on $mkdir_umask.
+	if test -n "$dir_arg"; then
+	  mkdir_mode=-m$mode
+	else
+	  mkdir_mode=
+	fi
+
+	posix_mkdir=false
+	case $umask in
+	  *[123567][0-7][0-7])
+	    # POSIX mkdir -p sets u+wx bits regardless of umask, which
+	    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
+	    ;;
+	  *)
+	    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
+	    trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
+
+	    if (umask $mkdir_umask &&
+		exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
+	    then
+	      if test -z "$dir_arg" || {
+		   # Check for POSIX incompatibilities with -m.
+		   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
+		   # other-writeable bit of parent directory when it shouldn't.
+		   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
+		   ls_ld_tmpdir=`ls -ld "$tmpdir"`
+		   case $ls_ld_tmpdir in
+		     d????-?r-*) different_mode=700;;
+		     d????-?--*) different_mode=755;;
+		     *) false;;
+		   esac &&
+		   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
+		     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
+		     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
+		   }
+		 }
+	      then posix_mkdir=:
+	      fi
+	      rmdir "$tmpdir/d" "$tmpdir"
+	    else
+	      # Remove any dirs left behind by ancient mkdir implementations.
+	      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
+	    fi
+	    trap '' 0;;
+	esac;;
+    esac
+
+    if
+      $posix_mkdir && (
+	umask $mkdir_umask &&
+	$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
+      )
+    then :
+    else
+
+      # The umask is ridiculous, or mkdir does not conform to POSIX,
+      # or it failed possibly due to a race condition.  Create the
+      # directory the slow way, step by step, checking for races as we go.
+
+      case $dstdir in
+	/*) prefix='/';;
+	[-=\(\)!]*) prefix='./';;
+	*)  prefix='';;
+      esac
+
+      eval "$initialize_posix_glob"
+
+      oIFS=$IFS
+      IFS=/
+      $posix_glob set -f
+      set fnord $dstdir
+      shift
+      $posix_glob set +f
+      IFS=$oIFS
+
+      prefixes=
+
+      for d
+      do
+	test X"$d" = X && continue
+
+	prefix=$prefix$d
+	if test -d "$prefix"; then
+	  prefixes=
+	else
+	  if $posix_mkdir; then
+	    (umask=$mkdir_umask &&
+	     $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
+	    # Don't fail if two instances are running concurrently.
+	    test -d "$prefix" || exit 1
+	  else
+	    case $prefix in
+	      *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
+	      *) qprefix=$prefix;;
+	    esac
+	    prefixes="$prefixes '$qprefix'"
+	  fi
+	fi
+	prefix=$prefix/
+      done
+
+      if test -n "$prefixes"; then
+	# Don't fail if two instances are running concurrently.
+	(umask $mkdir_umask &&
+	 eval "\$doit_exec \$mkdirprog $prefixes") ||
+	  test -d "$dstdir" || exit 1
+	obsolete_mkdir_used=true
+      fi
+    fi
+  fi
+
+  if test -n "$dir_arg"; then
+    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
+    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
+      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
+  else
+
+    # Make a couple of temp file names in the proper directory.
+    dsttmp=$dstdir/_inst.$$_
+    rmtmp=$dstdir/_rm.$$_
+
+    # Trap to clean up those temp files at exit.
+    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
+
+    # Copy the file name to the temp name.
+    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
+
+    # and set any options; do chmod last to preserve setuid bits.
+    #
+    # If any of these fail, we abort the whole thing.  If we want to
+    # ignore errors from any of these, just make sure not to ignore
+    # errors from the above "$doit $cpprog $src $dsttmp" command.
+    #
+    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
+    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
+    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
+
+    # If -C, don't bother to copy if it wouldn't change the file.
+    if $copy_on_change &&
+       old=`LC_ALL=C ls -dlL "$dst"	2>/dev/null` &&
+       new=`LC_ALL=C ls -dlL "$dsttmp"	2>/dev/null` &&
+
+       eval "$initialize_posix_glob" &&
+       $posix_glob set -f &&
+       set X $old && old=:$2:$4:$5:$6 &&
+       set X $new && new=:$2:$4:$5:$6 &&
+       $posix_glob set +f &&
+
+       test "$old" = "$new" &&
+       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
+    then
+      rm -f "$dsttmp"
+    else
+      # Rename the file to the real destination.
+      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
+
+      # The rename failed, perhaps because mv can't rename something else
+      # to itself, or perhaps because mv is so ancient that it does not
+      # support -f.
+      {
+	# Now remove or move aside any old file at destination location.
+	# We try this two ways since rm can't unlink itself on some
+	# systems and the destination file might be busy for other
+	# reasons.  In this case, the final cleanup might fail but the new
+	# file should still install successfully.
+	{
+	  test ! -f "$dst" ||
+	  $doit $rmcmd -f "$dst" 2>/dev/null ||
+	  { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
+	    { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
+	  } ||
+	  { echo "$0: cannot unlink or rename $dst" >&2
+	    (exit 1); exit 1
+	  }
+	} &&
+
+	# Now rename the file to the real destination.
+	$doit $mvcmd "$dsttmp" "$dst"
+      }
+    fi || exit 1
+
+    trap '' 0
+  fi
+done
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:
diff -Nru igraph-0.6.5~quantal1/interfaces/Makefile.in igraph-0.6.5/interfaces/Makefile.in
--- igraph-0.6.5~quantal1/interfaces/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/interfaces/Makefile.in	2013-03-03 01:30:05.000000000 +0000
@@ -0,0 +1,380 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = interfaces
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+MAINTAINERCLEANFILES = Makefile.in
+DISTCLEANFILES = R/igraph/src/*.o R/igraph/src/igraph.so \
+                 shell/.deps
+
+all: all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(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) --gnu interfaces/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu interfaces/Makefile
+.PRECIOUS: 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;
+
+$(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):
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+tags: TAGS
+TAGS:
+
+ctags: CTAGS
+CTAGS:
+
+
+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
+installdirs:
+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)
+	-test -z "$(DISTCLEANFILES)" || rm -f $(DISTCLEANFILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+	-test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES)
+clean: clean-am
+
+clean-am: clean-generic clean-libtool mostlyclean-am
+
+distclean: distclean-am
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+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-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 -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am check check-am clean clean-generic clean-libtool \
+	distclean distclean-generic distclean-libtool distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	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-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am
+
+
+# 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 -Nru igraph-0.6.5~quantal1/interfaces/R/DESCRIPTION.in igraph-0.6.5/interfaces/R/DESCRIPTION.in
--- igraph-0.6.5~quantal1/interfaces/R/DESCRIPTION.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/DESCRIPTION.in	2013-03-02 20:23:36.000000000 +0000
@@ -1,6 +1,6 @@
 Package: igraph
-Version: @VERSION@
-Date: 2013-02-24
+Version: @VERSION@-1
+Date: 2013-02-27
 Title:  Network analysis and visualization
 Author: See AUTHORS file.
 Maintainer: Gabor Csardi <csardi.gabor@gmail.com>
diff -Nru igraph-0.6.5~quantal1/interfaces/R/Makefile.am igraph-0.6.5/interfaces/R/Makefile.am
--- igraph-0.6.5~quantal1/interfaces/R/Makefile.am	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/Makefile.am	1970-01-01 00:00:00.000000000 +0000
@@ -1,181 +0,0 @@
-
-DATAVERSION=0.1
-
-all: igraph_$(VERSION).tar.gz igraphdata_$(DATAVERSION).tar.gz
-
-DATAFILES = $(wildcard igraphdata/data/*.rda) igraphdata/DESCRIPTION \
-	igraphdata/LICENSE $(wildcard igraphdata/man/*.Rd) \
-	$(wildcard igraphdata/inst/*)
-
-igraphdata_$(DATAVERSION).tar.gz: $(DATAFILES)
-	R CMD build igraphdata
-
-RFILES = $(wildcard igraph/R/*.R) $(wildcard igraph/man/*.Rd) \
-	igraph/src/config.h igraph/src/config.h.in igraph/src/Makevars.in \
-	igraph/src/Makevars.win igraph/DESCRIPTION \
-	igraph/NAMESPACE igraph/R/auto.R igraph/src/rinterface.c \
-	igraph/configure igraph/configure.in igraph/src/rinterface.h arpack/stamp
-
-igraph/src/config.h: src/config.h
-	cp $< $@
-igraph/src/config.h.in: src/config.h.in
-	cp $< $@
-igraph/src/Makevars.in: src/Makevars.in
-	cp $< $@
-igraph/src/Makevars.win: src/Makevars.win
-	cp $< $@
-igraph/DESCRIPTION: DESCRIPTION
-	cp $< $@
-igraph/configure: configure
-	cp $< $@
-igraph/configure.in: configure.in
-	cp $< $@
-igraph/src/rinterface.h: src/rinterface.h
-	cp $< $@
-
-arpack/stamp: $(wildcard arpack/*.f) $(wildcard arpack/*.h)
-	cp arpack/*.{f,h} igraph/src/ && \
-	touch arpack/stamp
-
-# Files generated by stimulus
-
-igraph/src/rinterface.c: ../../interfaces/functions.def ../../interfaces/R/src/rinterface.c.in  ../../interfaces/R/types-C.def ../../tools/stimulus.py
-	../../tools/stimulus.py \
-           -f ../../interfaces/functions.def \
-           -i ../../interfaces/R/src/rinterface.c.in \
-           -o igraph/src/rinterface.c \
-           -t ../../interfaces/R/types-C.def \
-           -l RC
-
-igraph/R/auto.R: ../../interfaces/functions.def auto.R.in ../../interfaces/R/types-R.def ../../tools/stimulus.py
-	../../tools/stimulus.py \
-           -f ../../interfaces/functions.def \
-           -i auto.R.in \
-           -o igraph/R/auto.R \
-           -t ../../interfaces/R/types-R.def \
-           -l RR
-
-igraph/NAMESPACE: ../functions.def NAMESPACE.in ../../tools/stimulus.py
-	../../tools/stimulus.py \
-            -f ../functions.def \
-            -i NAMESPACE.in \
-            -o igraph/NAMESPACE \
-            -l RNamespace
-
-# Files from the original source
-
-YFILES = $(wildcard $(top_srcdir)/src/*.y)
-LFILES = $(wildcard $(top_srcdir)/src/*.l)
-SRCFILES_ORIGPLACE = $(wildcard $(top_srcdir)/src/*.c) \
-	$(wildcard $(top_srcdir)/src/*.h) \
-	$(wildcard $(top_srcdir)/src/*.cc) \
-	$(wildcard $(top_srcdir)/src/*.hh) \
-	$(wildcard $(top_srcdir)/src/*.cpp) \
-	$(wildcard $(top_srcdir)/src/*.pmt) \
-	$(YFILES:.y=.c) $(YFILES:.y=.h) $(LFILES:.l=.c)
-
-SRCFILES_ORIGPLACE6 =   $(wildcard $(top_srcdir)/include/*.h)
-
-SRCFILES_ORIGPLACE7 = 	$(wildcard $(top_srcdir)/src/cs/*.c)
-
-SRCFILES_ORIGPLACE8 = 	$(wildcard $(top_srcdir)/src/cs/*.h)
-
-SRCFILES_ORIGPLACE9 =   $(wildcard $(top_srcdir)/optional/glpk/*.c)
-
-SRCFILES_ORIGPLACE10 =  $(wildcard $(top_srcdir)/optional/glpk/*.h)
-
-SRCFILES_ORIGPLACE11 =  $(wildcard $(top_srcdir)/optional/glpk/amd/*.c)
-
-SRCFILES_ORIGPLACE12 =  $(wildcard $(top_srcdir)/optional/glpk/amd/*.h)
-
-SRCFILES_ORIGPLACE13 =  $(wildcard $(top_srcdir)/optional/glpk/colamd/*.c)
-
-SRCFILES_ORIGPLACE14 =  $(wildcard $(top_srcdir)/optional/glpk/colamd/*.h)
-
-SRCFILES_ORIGPLACE15 =  $(wildcard $(top_srcdir)/optional/simpleraytracer/*.cpp)
-
-SRCFILES_ORIGPLACE16 =  $(wildcard $(top_srcdir)/optional/simpleraytracer/*.h)
-
-SRCFILES_ORIGPLACE17 =  $(wildcard $(top_srcdir)/src/plfit/*.h)
-
-SRCFILES_ORIGPLACE18 =  $(wildcard $(top_srcdir)/src/plfit/*.c)
-
-SRCFILES = $(patsubst $(top_srcdir)/src/%,igraph/src/%,$(SRCFILES_ORIGPLACE)) \
-	$(patsubst $(top_srcdir)/include/%,igraph/src/%,$(SRCFILES_ORIGPLACE6)) \
-	$(patsubst $(top_srcdir)/src/cs/%,igraph/src/%,$(SRCFILES_ORIGPLACE7)) \
-	$(patsubst $(top_srcdir)/src/cs/%,igraph/src/cs/%,$(SRCFILES_ORIGPLACE8)) \
-	$(patsubst $(top_srcdir)/optional/glpk/%,igraph/src/%,$(SRCFILES_ORIGPLACE9)) \
-	$(patsubst $(top_srcdir)/optional/glpk/%,igraph/src/glpk/%,$(SRCFILES_ORIGPLACE10)) \
-	$(patsubst $(top_srcdir)/optional/glpk/amd/%,igraph/src/%,$(SRCFILES_ORIGPLACE11)) \
-	$(patsubst $(top_srcdir)/optional/glpk/amd/%,igraph/src/glpk/amd/%,$(SRCFILES_ORIGPLACE12)) \
-	$(patsubst $(top_srcdir)/optional/glpk/colamd/%,igraph/src/%,$(SRCFILES_ORIGPLACE13)) \
-	$(patsubst $(top_srcdir)/optional/glpk/colamd/%,igraph/src/glpk/colamd/%,$(SRCFILES_ORIGPLACE14)) \
-	$(patsubst $(top_srcdir)/optional/simpleraytracer/%,igraph/src/%,$(SRCFILES_ORIGPLACE15)) \
-	$(patsubst $(top_srcdir)/optional/simpleraytracer/%,igraph/src/%,$(SRCFILES_ORIGPLACE16)) \
-	$(patsubst $(top_srcdir)/src/plfit/%,igraph/src/plfit/%,$(SRCFILES_ORIGPLACE17)) \
-	$(patsubst $(top_srcdir)/src/plfit/%,igraph/src/%,$(SRCFILES_ORIGPLACE18))
-
-igraph/src/cs/%.h: $(top_srcdir)/src/cs/%.h
-	cp $(top_srcdir)/src/cs/$(@F) igraph/src/cs/$(@F)
-
-igraph/src/glpk/amd/%.h: $(top_srcdir)/optional/glpk/amd/%.h
-	cp $(top_srcdir)/optional/glpk/amd/$(@F) igraph/src/glpk/amd/$(@F)
-igraph/src/glpk/colamd/%.h: $(top_srcdir)/optional/glpk/colamd/%.h
-	cp $(top_srcdir)/optional/glpk/colamd/$(@F) igraph/src/glpk/colamd/$(@F)
-igraph/src/glpk/%.h: $(top_srcdir)/optional/glpk/%.h
-	cp $(top_srcdir)/optional/glpk/$(@F) igraph/src/glpk/$(@F)
-
-igraph/src/%.c: $(top_srcdir)/src/plfit/%.c
-	cp $(top_srcdir)/src/plfit/$(@F) igraph/src/$(@F)
-igraph/src/plfit/%.h: $(top_srcdir)/src/plfit/%.h
-	cp $(top_srcdir)/src/plfit/$(@F) igraph/src/plfit/$(@F)
-
-igraph/src/%.c: $(top_srcdir)/src/%.c
-	cp $(top_srcdir)/src/$(@F) $@
-igraph/src/%.cc: $(top_srcdir)/src/%.cc
-	cp $(top_srcdir)/src/$(@F) $@
-igraph/src/%.hh: $(top_srcdir)/src/%.hh
-	cp $(top_srcdir)/src/$(@F) $@
-igraph/src/%.cpp: $(top_srcdir)/src/%.cpp
-	cp $(top_srcdir)/src/$(@F) $@
-igraph/src/%.pmt: $(top_srcdir)/src/%.pmt
-	cp $(top_srcdir)/src/$(@F) $@
-igraph/src/%.h: $(top_srcdir)/src/%.h
-	cp $(top_srcdir)/src/$(@F) $@
-
-igraph/src/%.c: $(top_srcdir)/src/cs/%.c
-	cp $(top_srcdir)/src/cs/$(@F) igraph/src/$(@F)
-igraph/src/%.c: $(top_srcdir)/optional/glpk/amd/%.c
-	cp $(top_srcdir)/optional/glpk/amd/$(@F) igraph/src/$(@F)
-igraph/src/%.c: $(top_srcdir)/optional/glpk/colamd/%.c
-	cp $(top_srcdir)/optional/glpk/colamd/$(@F) igraph/src/$(@F)
-igraph/src/%.c: $(top_srcdir)/optional/glpk/%.c
-	cp $(top_srcdir)/optional/glpk/$(@F) igraph/src/$(@F)
-
-igraph/src/%.cpp: $(top_srcdir)/optional/simpleraytracer/%.cpp
-	cp $(top_srcdir)/optional/simpleraytracer/$(@F) igraph/src/$(@F)
-igraph/src/%.h: $(top_srcdir)/optional/simpleraytracer/%.h
-	cp $(top_srcdir)/optional/simpleraytracer/$(@F) igraph/src/$(@F)
-
-igraph/src/%.h: $(top_srcdir)/include/%.h
-	cp $(top_srcdir)/include/$(@F) $@
-
-igraph_$(VERSION).tar.gz: $(RFILES) $(SRCFILES)
-	echo $(top_scrdir)
-	rm -f igraph/R/config.R
-	rm -f igraph/src/config.h
-	rm -rf igraph/a.out*
-	touch igraph/src/config.h
-	R CMD build igraph
-
-tests:
-	cd tests && echo "tools:::.runPackageTestsR()" | \
-	R --no-save && echo
-
-homepagetests:
-	$(eval $@_TMP := $(shell mktemp -d -t igraph))
-	cp -r ../../doc/homepage/examples $($@_TMP) && \
-	cd $($@_TMP)/examples && echo "tools:::.runPackageTestsR()" | \
-	R --no-save && echo
-
-.PHONY: tests
diff -Nru igraph-0.6.5~quantal1/interfaces/R/Makefile.in igraph-0.6.5/interfaces/R/Makefile.in
--- igraph-0.6.5~quantal1/interfaces/R/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/interfaces/R/Makefile.in	2013-03-03 01:30:05.000000000 +0000
@@ -0,0 +1,546 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = interfaces/R
+DIST_COMMON = $(srcdir)/DESCRIPTION.in $(srcdir)/Makefile.am \
+	$(srcdir)/Makefile.in $(srcdir)/configure.in.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES = configure.in DESCRIPTION
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+DATAVERSION = 0.1
+DATAFILES = $(wildcard igraphdata/data/*.rda) igraphdata/DESCRIPTION \
+	igraphdata/LICENSE $(wildcard igraphdata/man/*.Rd) \
+	$(wildcard igraphdata/inst/*)
+
+RFILES = $(wildcard igraph/R/*.R) $(wildcard igraph/man/*.Rd) \
+	igraph/src/config.h igraph/src/config.h.in igraph/src/Makevars.in \
+	igraph/src/Makevars.win igraph/DESCRIPTION \
+	igraph/NAMESPACE igraph/R/auto.R igraph/src/rinterface.c \
+	igraph/configure igraph/configure.in igraph/src/rinterface.h arpack/stamp
+
+
+# Files from the original source
+YFILES = $(wildcard $(top_srcdir)/src/*.y)
+LFILES = $(wildcard $(top_srcdir)/src/*.l)
+SRCFILES_ORIGPLACE = $(wildcard $(top_srcdir)/src/*.c) \
+	$(wildcard $(top_srcdir)/src/*.h) \
+	$(wildcard $(top_srcdir)/src/*.cc) \
+	$(wildcard $(top_srcdir)/src/*.hh) \
+	$(wildcard $(top_srcdir)/src/*.cpp) \
+	$(wildcard $(top_srcdir)/src/*.pmt) \
+	$(YFILES:.y=.c) $(YFILES:.y=.h) $(LFILES:.l=.c)
+
+SRCFILES_ORIGPLACE6 = $(wildcard $(top_srcdir)/include/*.h)
+SRCFILES_ORIGPLACE7 = $(wildcard $(top_srcdir)/src/cs/*.c)
+SRCFILES_ORIGPLACE8 = $(wildcard $(top_srcdir)/src/cs/*.h)
+SRCFILES_ORIGPLACE9 = $(wildcard $(top_srcdir)/optional/glpk/*.c)
+SRCFILES_ORIGPLACE10 = $(wildcard $(top_srcdir)/optional/glpk/*.h)
+SRCFILES_ORIGPLACE11 = $(wildcard $(top_srcdir)/optional/glpk/amd/*.c)
+SRCFILES_ORIGPLACE12 = $(wildcard $(top_srcdir)/optional/glpk/amd/*.h)
+SRCFILES_ORIGPLACE13 = $(wildcard $(top_srcdir)/optional/glpk/colamd/*.c)
+SRCFILES_ORIGPLACE14 = $(wildcard $(top_srcdir)/optional/glpk/colamd/*.h)
+SRCFILES_ORIGPLACE15 = $(wildcard $(top_srcdir)/optional/simpleraytracer/*.cpp)
+SRCFILES_ORIGPLACE16 = $(wildcard $(top_srcdir)/optional/simpleraytracer/*.h)
+SRCFILES_ORIGPLACE17 = $(wildcard $(top_srcdir)/src/plfit/*.h)
+SRCFILES_ORIGPLACE18 = $(wildcard $(top_srcdir)/src/plfit/*.c)
+SRCFILES = $(patsubst $(top_srcdir)/src/%,igraph/src/%,$(SRCFILES_ORIGPLACE)) \
+	$(patsubst $(top_srcdir)/include/%,igraph/src/%,$(SRCFILES_ORIGPLACE6)) \
+	$(patsubst $(top_srcdir)/src/cs/%,igraph/src/%,$(SRCFILES_ORIGPLACE7)) \
+	$(patsubst $(top_srcdir)/src/cs/%,igraph/src/cs/%,$(SRCFILES_ORIGPLACE8)) \
+	$(patsubst $(top_srcdir)/optional/glpk/%,igraph/src/%,$(SRCFILES_ORIGPLACE9)) \
+	$(patsubst $(top_srcdir)/optional/glpk/%,igraph/src/glpk/%,$(SRCFILES_ORIGPLACE10)) \
+	$(patsubst $(top_srcdir)/optional/glpk/amd/%,igraph/src/%,$(SRCFILES_ORIGPLACE11)) \
+	$(patsubst $(top_srcdir)/optional/glpk/amd/%,igraph/src/glpk/amd/%,$(SRCFILES_ORIGPLACE12)) \
+	$(patsubst $(top_srcdir)/optional/glpk/colamd/%,igraph/src/%,$(SRCFILES_ORIGPLACE13)) \
+	$(patsubst $(top_srcdir)/optional/glpk/colamd/%,igraph/src/glpk/colamd/%,$(SRCFILES_ORIGPLACE14)) \
+	$(patsubst $(top_srcdir)/optional/simpleraytracer/%,igraph/src/%,$(SRCFILES_ORIGPLACE15)) \
+	$(patsubst $(top_srcdir)/optional/simpleraytracer/%,igraph/src/%,$(SRCFILES_ORIGPLACE16)) \
+	$(patsubst $(top_srcdir)/src/plfit/%,igraph/src/plfit/%,$(SRCFILES_ORIGPLACE17)) \
+	$(patsubst $(top_srcdir)/src/plfit/%,igraph/src/%,$(SRCFILES_ORIGPLACE18))
+
+all: all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(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) --gnu interfaces/R/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu interfaces/R/Makefile
+.PRECIOUS: 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;
+
+$(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):
+configure.in: $(top_builddir)/config.status $(srcdir)/configure.in.in
+	cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
+DESCRIPTION: $(top_builddir)/config.status $(srcdir)/DESCRIPTION.in
+	cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+tags: TAGS
+TAGS:
+
+ctags: CTAGS
+CTAGS:
+
+
+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
+installdirs:
+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)
+
+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-generic clean-libtool mostlyclean-am
+
+distclean: distclean-am
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+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-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 -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am check check-am clean clean-generic clean-libtool \
+	distclean distclean-generic distclean-libtool distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	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-generic \
+	mostlyclean-libtool pdf pdf-am ps ps-am uninstall uninstall-am
+
+
+all: igraph_$(VERSION).tar.gz igraphdata_$(DATAVERSION).tar.gz
+
+igraphdata_$(DATAVERSION).tar.gz: $(DATAFILES)
+	R CMD build igraphdata
+
+igraph/src/config.h: src/config.h
+	cp $< $@
+igraph/src/config.h.in: src/config.h.in
+	cp $< $@
+igraph/src/Makevars.in: src/Makevars.in
+	cp $< $@
+igraph/src/Makevars.win: src/Makevars.win
+	cp $< $@
+igraph/DESCRIPTION: DESCRIPTION
+	cp $< $@
+igraph/configure: configure
+	cp $< $@
+igraph/configure.in: configure.in
+	cp $< $@
+igraph/src/rinterface.h: src/rinterface.h
+	cp $< $@
+
+arpack/stamp: $(wildcard arpack/*.f) $(wildcard arpack/*.h)
+	cp arpack/*.{f,h} igraph/src/ && \
+	touch arpack/stamp
+
+# Files generated by stimulus
+
+igraph/src/rinterface.c: ../../interfaces/functions.def ../../interfaces/R/src/rinterface.c.in  ../../interfaces/R/types-C.def ../../tools/stimulus.py
+	../../tools/stimulus.py \
+           -f ../../interfaces/functions.def \
+           -i ../../interfaces/R/src/rinterface.c.in \
+           -o igraph/src/rinterface.c \
+           -t ../../interfaces/R/types-C.def \
+           -l RC
+
+igraph/R/auto.R: ../../interfaces/functions.def auto.R.in ../../interfaces/R/types-R.def ../../tools/stimulus.py
+	../../tools/stimulus.py \
+           -f ../../interfaces/functions.def \
+           -i auto.R.in \
+           -o igraph/R/auto.R \
+           -t ../../interfaces/R/types-R.def \
+           -l RR
+
+igraph/NAMESPACE: ../functions.def NAMESPACE.in ../../tools/stimulus.py
+	../../tools/stimulus.py \
+            -f ../functions.def \
+            -i NAMESPACE.in \
+            -o igraph/NAMESPACE \
+            -l RNamespace
+
+igraph/src/cs/%.h: $(top_srcdir)/src/cs/%.h
+	cp $(top_srcdir)/src/cs/$(@F) igraph/src/cs/$(@F)
+
+igraph/src/glpk/amd/%.h: $(top_srcdir)/optional/glpk/amd/%.h
+	cp $(top_srcdir)/optional/glpk/amd/$(@F) igraph/src/glpk/amd/$(@F)
+igraph/src/glpk/colamd/%.h: $(top_srcdir)/optional/glpk/colamd/%.h
+	cp $(top_srcdir)/optional/glpk/colamd/$(@F) igraph/src/glpk/colamd/$(@F)
+igraph/src/glpk/%.h: $(top_srcdir)/optional/glpk/%.h
+	cp $(top_srcdir)/optional/glpk/$(@F) igraph/src/glpk/$(@F)
+
+igraph/src/%.c: $(top_srcdir)/src/plfit/%.c
+	cp $(top_srcdir)/src/plfit/$(@F) igraph/src/$(@F)
+igraph/src/plfit/%.h: $(top_srcdir)/src/plfit/%.h
+	cp $(top_srcdir)/src/plfit/$(@F) igraph/src/plfit/$(@F)
+
+igraph/src/%.c: $(top_srcdir)/src/%.c
+	cp $(top_srcdir)/src/$(@F) $@
+igraph/src/%.cc: $(top_srcdir)/src/%.cc
+	cp $(top_srcdir)/src/$(@F) $@
+igraph/src/%.hh: $(top_srcdir)/src/%.hh
+	cp $(top_srcdir)/src/$(@F) $@
+igraph/src/%.cpp: $(top_srcdir)/src/%.cpp
+	cp $(top_srcdir)/src/$(@F) $@
+igraph/src/%.pmt: $(top_srcdir)/src/%.pmt
+	cp $(top_srcdir)/src/$(@F) $@
+igraph/src/%.h: $(top_srcdir)/src/%.h
+	cp $(top_srcdir)/src/$(@F) $@
+
+igraph/src/%.c: $(top_srcdir)/src/cs/%.c
+	cp $(top_srcdir)/src/cs/$(@F) igraph/src/$(@F)
+igraph/src/%.c: $(top_srcdir)/optional/glpk/amd/%.c
+	cp $(top_srcdir)/optional/glpk/amd/$(@F) igraph/src/$(@F)
+igraph/src/%.c: $(top_srcdir)/optional/glpk/colamd/%.c
+	cp $(top_srcdir)/optional/glpk/colamd/$(@F) igraph/src/$(@F)
+igraph/src/%.c: $(top_srcdir)/optional/glpk/%.c
+	cp $(top_srcdir)/optional/glpk/$(@F) igraph/src/$(@F)
+
+igraph/src/%.cpp: $(top_srcdir)/optional/simpleraytracer/%.cpp
+	cp $(top_srcdir)/optional/simpleraytracer/$(@F) igraph/src/$(@F)
+igraph/src/%.h: $(top_srcdir)/optional/simpleraytracer/%.h
+	cp $(top_srcdir)/optional/simpleraytracer/$(@F) igraph/src/$(@F)
+
+igraph/src/%.h: $(top_srcdir)/include/%.h
+	cp $(top_srcdir)/include/$(@F) $@
+
+igraph_$(VERSION).tar.gz: $(RFILES) $(SRCFILES)
+	echo $(top_scrdir)
+	rm -f igraph/R/config.R
+	rm -f igraph/src/config.h
+	rm -rf igraph/a.out*
+	touch igraph/src/config.h
+	R CMD build igraph
+
+tests:
+	cd tests && echo "tools:::.runPackageTestsR()" | \
+	R --no-save && echo
+
+homepagetests:
+	$(eval $@_TMP := $(shell mktemp -d -t igraph))
+	cp -r ../../doc/homepage/examples $($@_TMP) && \
+	cd $($@_TMP)/examples && echo "tools:::.runPackageTestsR()" | \
+	R --no-save && echo
+
+.PHONY: tests
+
+# 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 -Nru igraph-0.6.5~quantal1/interfaces/R/NAMESPACE.in igraph-0.6.5/interfaces/R/NAMESPACE.in
--- igraph-0.6.5~quantal1/interfaces/R/NAMESPACE.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/NAMESPACE.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,271 +0,0 @@
-
-importFrom(stats, as.dendrogram)
-importFrom(stats, as.hclust)
-
-# The igraph interface
-
-export(add.vertices, delete.edges,
-       delete.vertices, ecount, neighbors, incident, get.edges, get.edge.ids)
-
-export("[.igraph", "[[.igraph", "[<-.igraph")
-
-S3method("[", "igraph")
-S3method("[[", "igraph")
-S3method("[<-", "igraph")
-
-export(edge, edges, vertex, vertices, path,
-       "+.igraph", "-.igraph")
-
-S3method("+", "igraph")
-S3method("-", "igraph")
-
-# Attributes
-
-export(get.graph.attribute, set.graph.attribute,
-       get.vertex.attribute, set.vertex.attribute,
-       get.edge.attribute, set.edge.attribute,
-       list.graph.attributes, list.vertex.attributes,
-       list.edge.attributes, remove.graph.attribute,
-       remove.vertex.attribute, remove.edge.attribute)
-
-# iterators
-
-export(V, E, "$.igraph.vs", "$.igraph.es",
-       "[.igraph.vs", "[.igraph.es", "[<-.igraph.vs", "[<-.igraph.es",
-       "$<-.igraph.vs", "$<-.igraph.es", "V<-", "E<-",
-       print.igraph.vs, print.igraph.es, "%--%", "%->%", "%<-%")
-
-S3method("$", igraph)
-S3method("$<-", igraph)
-S3method("$", igraph.vs)
-S3method("[", igraph.vs)
-S3method("[<-", igraph.vs)
-S3method("$<-", igraph.vs)
-S3method("$", igraph.es)
-S3method("[", igraph.es)
-S3method("[<-", igraph.es)
-S3method("$<-", igraph.es)
-S3method(print, igraph.vs)
-S3method(print, igraph.es)
-  
-# basic functions, printing
-
-export(is.igraph, is.named, is.weighted, is.bipartite,
-       are.connected, print.igraph, str.igraph, summary.igraph,
-       is.directed, get.edge)
-
-S3method("str", "igraph")
-
-# structure generators
-
-export(graph, graph.adjacency, graph.star, graph.tree, graph.lattice,
-       graph.ring, graph.full, graph.atlas, graph.data.frame, graph.edgelist,
-       graph.extended.chordal.ring, line.graph, graph.de.bruijn, graph.kautz,
-       graph.formula, graph.famous)
-
-# games
-
-export(erdos.renyi.game, random.graph.game, degree.sequence.game,
-       aging.prefatt.game, aging.barabasi.game, aging.ba.game,
-       growing.random.game, barabasi.game, ba.game,
-       callaway.traits.game, establishment.game, grg.game,
-       preference.game, asymmetric.preference.game, connect.neighborhood,
-       rewire.edges, watts.strogatz.game, lastcit.game, cited.type.game,
-       citing.cited.type.game)
-
-# community structure
-
-export(edge.betweenness.community,
-       spinglass.community, walktrap.community,
-       edge.betweenness.community.merges, fastgreedy.community,
-       community.to.membership)
-
-export(membership, modularity, sizes, algorithm, is.hierarchical, merges,
-       cutat, communities, crossing, plot.communities, compare,
-       compare.communities, showtrace, code.length, asPhylo, dendPlot)
-
-S3method("print", communities)
-S3method("modularity", communities)
-S3method("length", communities)
-S3method("as.dendrogram", communities)
-S3method("as.hclust", communities)
-S3method("asPhylo", communities)
-S3method("modularity", igraph)
-S3method("dendPlot", communities)
-S3method("compare", communities)
-S3method("compare", numeric)
-S3method("compare", default)
-
-# conversion
-
-export(get.adjacency, get.edgelist, as.directed, as.undirected,
-       get.adjlist, get.adjedgelist, igraph.from.graphNEL, 
-       igraph.to.graphNEL, get.data.frame)
-
-# fitting, other
-
-export(power.law.fit, running.mean, igraph.sample)
-
-# foreign formats
-
-export(read.graph, write.graph, graph.graphdb)
-
-# layouts
-
-export(layout.auto, layout.random, layout.circle,
-       layout.spring, layout.kamada.kawai, layout.lgl,
-       layout.fruchterman.reingold.grid, layout.sphere, layout.merge,
-       layout.reingold.tilford, layout.norm, piecewise.layout)
-export(igraph.drl.default, igraph.drl.coarsen, igraph.drl.coarsest,
-       igraph.drl.refine, igraph.drl.final)
-
-# structural properties
-
-export(subgraph, degree, degree.distribution, diameter,
-       subcomponent, betweenness, bibcoupling, cocitation,
-       shortest.paths, minimum.spanning.tree,
-       get.shortest.paths, average.path.length, transitivity,
-       get.all.shortest.paths, get.diameter, farthest.nodes,
-       constraint, page.rank, reciprocity, rewire,
-       graph.density, neighborhood.size, neighborhood, graph.neighborhood,
-       graph.coreness, topological.sort, girth, is.loop, is.multiple,
-       count.multiple)
-
-# plotting
-
-export(plot.igraph, tkplot, tkplot.close, tkplot.off, tkplot.fit.to.screen,
-       tkplot.reshape, tkplot.export.postscript, tkplot.getcoords,
-       tkplot.center, tkplot.rotate, rglplot.igraph, rglplot,
-       autocurve.edges, vertex.shapes, add.vertex.shape,
-       igraph.shape.noclip, igraph.shape.noplot)
-
-S3method(rglplot, igraph)
-
-# components
-
-export(cluster.distribution, is.connected, decompose.graph,
-       no.clusters)
-
-# centrality
-
-export(evcent, bonpow, alpha.centrality, subgraph.centrality)
-export(igraph.arpack.default)
-
-# dynamics measurement
-
-export(revolver.d, revolver.error.d,
-       revolver.ad, revolver.error.ad,
-       revolver.ade, revolver.error.ade,
-       revolver.e, revolver.error.e,
-       revolver.de, revolver.error.de,
-       revolver.l, revolver.error.l,
-       revolver.dl, revolver.error.dl,
-       revolver.el, revolver.error.el,
-       revolver.r, revolver.error.r,
-       revolver.ar, revolver.error.ar,
-       revolver.di, revolver.error.di,
-       revolver.adi, revolver.error.adi,
-       revolver.il, revolver.error.il,
-       revolver.ir, revolver.error.ir,
-       revolver.air, revolver.error.air)
-
-export (revolver.d.d, revolver.p.p)
-
-export (evolver.d)
-
-# isomorphism, motifs
-
-export(graph.isoclass, graph.isomorphic, graph.motifs,
-       graph.motifs.est, graph.isocreate, graph.motifs.no,
-       graph.isomorphic.vf2, graph.subisomorphic.vf2,
-       graph.count.isomorphisms.vf2, graph.count.subisomorphisms.vf2,
-       graph.get.isomorphisms.vf2, graph.get.subisomorphisms.vf2)
-
-# operators
-
-export(graph.disjoint.union, "%du%", graph.intersection, "%s%",
-       graph.union, "%u%", graph.difference, "%m%",
-       graph.complementer, graph.compose, "%c%")
-
-export(graph.intersection.by.name, graph.union.by.name,
-       graph.difference.by.name)
-
-# parameters, config
-
-export(igraph.par, igraph.options, getIgraphOpt)
-
-# console
-
-export(igraph.console, .igraph.progress, .igraph.status)
-
-# flows, cuts, etc.
-
-export(graph.mincut, vertex.connectivity, edge.connectivity,
-       edge.disjoint.paths, vertex.disjoint.paths, graph.adhesion,
-       graph.cohesion)
-
-# cliques
-
-export(cliques, largest.cliques, maximal.cliques, clique.number,
-       independent.vertex.sets, largest.independent.vertex.sets,
-       maximal.independent.vertex.sets, independence.number)
-
-# cohesive blocking, this is what remains from the old implementation
-
-S3method(layout.svd, igraph)
-export(layout.svd)
-
-# cohesive blocking, new style 
-
-export(blocks, blockGraphs, cohesion, hierarchy, parent,
-       plotHierarchy, exportPajek, maxcohesion)
-
-S3method(print, cohesiveBlocks)
-S3method(summary, cohesiveBlocks)
-S3method(plot, cohesiveBlocks)
-S3method(length, cohesiveBlocks)
-
-# arpack
-
-export(arpack)
-
-# tkigraph, demo
-
-export(tkigraph,igraphdemo)
-
-# HRG
-
-S3method(print, igraphHRG)
-S3method(print, igraphHRGConsensus)
-S3method("as.dendrogram", igraphHRG)
-S3method("as.hclust", igraphHRG)
-S3method("asPhylo", igraphHRG)
-S3method("dendPlot", igraphHRG)
-
-# SCG
-
-export(scg)
-S3method(scg, "igraph")
-S3method(scg, "matrix")
-S3method(scg, "Matrix")
-
-# nexus
-
-export(nexus.get, nexus.list, nexus.info, nexus.search)
-S3method(print, nexusDatasetInfo)
-S3method(print, nexusDatasetInfoList)
-S3method(summary, nexusDatasetInfoList)
-S3method("[", nexusDatasetInfoList)
-
-# Sparse data frame
-
-S3method(as.data.frame, igraphSDF)
-S3method("[", igraphSDF)
-S3method("[<-", igraphSDF)
-
-# convert to igraph
-
-export(as.igraph)
-S3method(as.igraph, "igraphHRG")
-
-######################## REST IS GENERATED BY stimulus
diff -Nru igraph-0.6.5~quantal1/interfaces/R/R1-TODO.txt igraph-0.6.5/interfaces/R/R1-TODO.txt
--- igraph-0.6.5~quantal1/interfaces/R/R1-TODO.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/R1-TODO.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,318 +0,0 @@
-
-Public functions:
------------------
-
-$.igraph.es
-$.igraph.vs
-$<-.igraph.es
-$<-.igraph.vs
-%--%
-%->%
-%<-%
-%c%					C
-%du%					C
-%m%					C
-%s%					C
-%u%					C
-E					C
-E<-					C
-V					C
-V<-					C
-[.igraph.es
-[.igraph.vs
-[<-.igraph.es
-[<-.igraph.vs
-add.edges				C
-add.vertices				C
-aging.ba.game
-aging.barabasi.game
-aging.prefatt.game
-algorithm
-all.st.cuts				C
-all.st.mincuts				C
-alpha.centrality			C
-are.connected				C
-arpack					C
-arpack.unpack.complex
-articulation.points			C
-as.directed				C
-as.undirected				C
-assortativity				C
-assortativity.degree			C
-assortativity.nominal			C
-asymmetric.preference.game
-authority.score				C
-average.path.length			C
-ba.game					C
-barabasi.game				C
-betweenness				C			
-betweenness.estimate
-bibcoupling				
-biconnected.components			C
-bipartite.projection			C
-bipartite.projection.size		C
-blockGraphs
-blocks
-bonpow					C
-callaway.traits.game
-canonical.permutation			C
-centralization.betweenness
-centralization.betweenness.tmax
-centralization.closeness
-centralization.closeness.tmax
-centralization.degree
-centralization.degree.tmax
-centralization.evcent
-centralization.evcent.tmax
-centralize.scores
-cited.type.game
-citing.cited.type.game
-clique.number				C
-cliques					C
-closeness				C
-closeness.estimate
-cluster.distribution
-clusters				C
-cocitation
-cohesion
-cohesive.blocks
-cohesive.blocks.old
-communities				C
-community.le.to.membership
-community.to.membership
-compare.communities
-connect.neighborhood
-constraint				C
-contract.vertices			C
-convex.hull
-count.multiple				C
-crossing				C
-cutat					C
-decompose.graph				C
-degree					C
-degree.distribution
-degree.sequence.game			C
-delete.edges				C
-delete.vertices				C
-diameter				C
-dominator.tree				C
-dyad.census				C
-ecount
-edge.betweenness			C
-edge.betweenness.community		C
-edge.betweenness.community.merges
-edge.betweenness.estimate
-edge.connectivity			C
-edge.disjoint.paths
-erdos.renyi.game
-establishment.game
-evcent					C
-evolver.d
-exportPajek
-farthest.nodes				C
-fastgreedy.community			C
-forest.fire.game
-get.adjacency				C
-get.adjedgelist				C
-get.adjlist				C
-get.all.shortest.paths			C
-get.diameter				C
-get.edge				C
-get.edge.attribute
-get.edgelist				C
-get.graph.attribute
-get.incidence				C
-get.shortest.paths			C
-get.vertex.attribute
-girth					C
-graph
-graph.adhesion				C
-graph.adjacency				C
-graph.adjlist				C
-graph.atlas				C
-graph.automorphisms
-graph.bfs				
-graph.bipartite				C
-graph.cohesion				C
-graph.complementer			C
-graph.compose				C
-graph.coreness				C
-graph.count.isomorphisms.vf2
-graph.count.subisomorphisms.vf2
-graph.data.frame			C
-graph.de.bruijn				C
-graph.density				C
-graph.dfs
-graph.difference			C
-graph.difference.by.name
-graph.disjoint.union			C
-graph.edgelist				C
-graph.empty
-graph.extended.chordal.ring
-graph.famous
-graph.formula
-graph.full
-graph.full.bipartite
-graph.full.citation
-graph.get.isomorphisms.vf2
-graph.get.subisomorphisms.vf2
-graph.graphdb
-graph.incidence				C
-graph.intersection			C
-graph.intersection.by.name
-graph.isoclass				C
-graph.isoclass.subgraph			C
-graph.isocreate				C
-graph.isomorphic			C
-graph.isomorphic.34			C
-graph.isomorphic.bliss			C
-graph.isomorphic.vf2			C
-graph.kautz				C
-graph.knn				C
-graph.laplacian
-graph.lattice
-graph.lcf
-graph.maxflow				C
-graph.mincut				C
-graph.motifs				C
-graph.motifs.est			C
-graph.motifs.no				C
-graph.neighborhood			C
-graph.ring
-graph.star
-graph.strength
-graph.subisomorphic.vf2			C
-graph.tree
-graph.union				C
-graph.union.by.name
-grg.game
-growing.random.game
-hierarchy
-hub.score				C
-igraph.arpack.default
-igraph.from.graphNEL			C
-igraph.par
-igraph.sample
-igraph.to.graphNEL			C
-igraphdemo
-independence.number			C
-independent.vertex.sets			C
-induced.subgraph			C
-is.bgraph
-is.bipartite				C
-is.chordal				C
-is.connected
-is.dag
-is.directed
-is.hierarchical
-is.igraph
-is.loop
-is.minimal.separator
-is.multiple
-is.mutual
-is.separator
-is.simple
-label.propagation.community		C
-largest.cliques				C
-largest.independent.vertex.sets		C
-lastcit.game
-layout.auto
-layout.circle
-layout.drl
-layout.fruchterman.reingold
-layout.fruchterman.reingold.grid
-layout.graphopt
-layout.kamada.kawai
-layout.lgl
-layout.mds
-layout.merge
-layout.norm
-layout.random
-layout.reingold.tilford
-layout.sphere
-layout.spring
-layout.star
-layout.svd
-leading.eigenvector.community		C
-leading.eigenvector.community.naive
-leading.eigenvector.community.step
-line.graph
-list.edge.attributes
-list.graph.attributes
-list.vertex.attributes
-maxcohesion
-maximal.cliques
-maximal.independent.vertex.sets
-maximum.cardinality.search		C
-membership
-merges
-minimal.st.separators			C
-minimum.size.separators			C
-minimum.spanning.tree
-modularity
-multilevel.community			C
-neighborhood				C
-neighborhood.size			C
-neighbors				C
-no.clusters
-optimal.community			C
-page.rank
-page.rank.old
-parent
-path.length.hist
-permute.vertices
-piecewise.layout
-plot.bgraph
-plot.communities
-plot.igraph
-plotHierarchy
-power.law.fit
-preference.game
-print.bgraph
-print.igraph
-print.igraph.es
-print.igraph.vs
-random.graph.game
-read.graph
-reciprocity
-remove.edge.attribute
-remove.graph.attribute
-remove.vertex.attribute
-rewire
-rewire.edges
-rglplot.igraph
-running.mean
-set.edge.attribute
-set.graph.attribute
-set.vertex.attribute
-shortest.paths
-similarity.dice
-similarity.invlogweighted
-similarity.jaccard
-simplify
-sizes
-spinglass.community
-split.join.distance
-subcomponent
-subgraph
-subgraph.centrality
-subgraph.edges
-summary.igraph
-tkplot
-topological.sort
-transitivity
-triad.census
-unfold.tree				C
-vcount
-vertex.connectivity
-vertex.disjoint.paths
-walktrap.community			C
-watts.strogatz.game
-write.graph
-write.pajek.bgraph
-
-Private functions:
-------------------
-
-TODO
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/debug.h igraph-0.6.5/interfaces/R/arpack/debug.h
--- igraph-0.6.5~quantal1/interfaces/R/arpack/debug.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/debug.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,16 +0,0 @@
-c
-c\SCCS Information: @(#) 
-c FILE: debug.h   SID: 2.3   DATE OF SID: 11/16/95   RELEASE: 2 
-c
-c     %---------------------------------%
-c     | See debug.doc for documentation |
-c     %---------------------------------%
-      integer  logfil, ndigit, mgetv0,
-     &         msaupd, msaup2, msaitr, mseigt, msapps, msgets, mseupd,
-     &         mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, mneupd,
-     &         mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd
-      common /debug/ 
-     &         logfil, ndigit, mgetv0,
-     &         msaupd, msaup2, msaitr, mseigt, msapps, msgets, mseupd,
-     &         mnaupd, mnaup2, mnaitr, mneigh, mnapps, mngets, mneupd,
-     &         mcaupd, mcaup2, mcaitr, mceigh, mcapps, mcgets, mceupd
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dgetv0.f igraph-0.6.5/interfaces/R/arpack/dgetv0.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dgetv0.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dgetv0.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,419 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdgetv0
-c
-c\Description: 
-c  Generate a random initial residual vector for the Arnoldi process.
-c  Force the residual vector to be in the range of the operator OP.  
-c
-c\Usage:
-c  call igraphdgetv0
-c     ( IDO, BMAT, ITRY, INITV, N, J, V, LDV, RESID, RNORM, 
-c       IPNTR, WORKD, IERR )
-c
-c\Arguments
-c  IDO     Integer.  (INPUT/OUTPUT)
-c          Reverse communication flag.  IDO must be zero on the first
-c          call to igraphdgetv0.
-c          -------------------------------------------------------------
-c          IDO =  0: first call to the reverse communication interface
-c          IDO = -1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c                    This is for the initialization phase to force the
-c                    starting vector into the range of OP.
-c          IDO =  2: compute  Y = B * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c          IDO = 99: done
-c          -------------------------------------------------------------
-c
-c  BMAT    Character*1.  (INPUT)
-c          BMAT specifies the type of the matrix B in the (generalized)
-c          eigenvalue problem A*x = lambda*B*x.
-c          B = 'I' -> standard eigenvalue problem A*x = lambda*x
-c          B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x
-c
-c  ITRY    Integer.  (INPUT)
-c          ITRY counts the number of times that igraphdgetv0 is called.  
-c          It should be set to 1 on the initial call to igraphdgetv0.
-c
-c  INITV   Logical variable.  (INPUT)
-c          .TRUE.  => the initial residual vector is given in RESID.
-c          .FALSE. => generate a random initial residual vector.
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the problem.
-c
-c  J       Integer.  (INPUT)
-c          Index of the residual vector to be generated, with respect to
-c          the Arnoldi process.  J > 1 in case of a "restart".
-c
-c  V       Double precision N by J array.  (INPUT)
-c          The first J-1 columns of V contain the current Arnoldi basis
-c          if this is a "restart".
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling 
-c          program.
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          Initial residual vector to be generated.  If RESID is 
-c          provided, force RESID into the range of the operator OP.
-c
-c  RNORM   Double precision scalar.  (OUTPUT)
-c          B-norm of the generated residual.
-c
-c  IPNTR   Integer array of length 3.  (OUTPUT)
-c
-c  WORKD   Double precision work array of length 2*N.  (REVERSE COMMUNICATION).
-c          On exit, WORK(1:N) = B*RESID to be used in SSAITR.
-c
-c  IERR    Integer.  (OUTPUT)
-c          =  0: Normal exit.
-c          = -1: Cannot generate a nontrivial restarted residual vector
-c                in the range of the operator OP.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c
-c\Routines called:
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine for vector output.
-c     dlarnv  LAPACK routine for generating a random vector.
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors. 
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\SCCS Information: @(#) 
-c FILE: getv0.F   SID: 2.6   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdgetv0 
-     &   ( ido, bmat, itry, initv, n, j, v, ldv, resid, rnorm, 
-     &     ipntr, workd, ierr )
-c 
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1
-      logical    initv
-      integer    ido, ierr, itry, j, ldv, n
-      Double precision
-     &           rnorm
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    ipntr(3)
-      Double precision
-     &           resid(n), v(ldv,j), workd(2*n)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %------------------------%
-c     | Local Scalars & Arrays |
-c     %------------------------%
-c
-      logical    first, inits, orth
-      integer    idist, iseed(4), iter, msglvl, jj
-      Double precision
-     &           rnorm0
-      save       first, iseed, inits, iter, msglvl, orth, rnorm0
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dlarnv, igraphdvout, dcopy, dgemv, igraphsecond
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           ddot, dnrm2
-      external   ddot, dnrm2
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    abs, sqrt
-c
-c     %-----------------%
-c     | Data Statements |
-c     %-----------------%
-c
-      data       inits /.true./
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-c
-c     %-----------------------------------%
-c     | Initialize the seed of the LAPACK |
-c     | random number generator           |
-c     %-----------------------------------%
-c
-      if (inits) then
-          iseed(1) = 1
-          iseed(2) = 3
-          iseed(3) = 5
-          iseed(4) = 7
-          inits = .false.
-      end if
-c
-      if (ido .eq.  0) then
-c 
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphsecond (t0)
-         msglvl = mgetv0
-c 
-         ierr   = 0
-         iter   = 0
-         first  = .FALSE.
-         orth   = .FALSE.
-c
-c        %-----------------------------------------------------%
-c        | Possibly generate a random starting vector in RESID |
-c        | Use a LAPACK random number generator used by the    |
-c        | matrix generation routines.                         |
-c        |    idist = 1: uniform (0,1)  distribution;          |
-c        |    idist = 2: uniform (-1,1) distribution;          |
-c        |    idist = 3: normal  (0,1)  distribution;          |
-c        %-----------------------------------------------------%
-c
-         if (.not.initv) then
-            idist = 2
-            call dlarnv (idist, iseed, n, resid)
-         end if
-c 
-c        %----------------------------------------------------------%
-c        | Force the starting vector into the range of OP to handle |
-c        | the generalized problem when B is possibly (singular).   |
-c        %----------------------------------------------------------%
-c
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nopx = nopx + 1
-            ipntr(1) = 1
-            ipntr(2) = n + 1
-            call dcopy (n, resid, 1, workd, 1)
-            ido = -1
-            go to 9000
-         end if
-      end if
-c 
-c     %-----------------------------------------%
-c     | Back from computing OP*(initial-vector) |
-c     %-----------------------------------------%
-c
-      if (first) go to 20
-c
-c     %-----------------------------------------------%
-c     | Back from computing B*(orthogonalized-vector) |
-c     %-----------------------------------------------%
-c
-      if (orth)  go to 40
-c 
-      if (bmat .eq. 'G') then
-         call igraphsecond (t3)
-         tmvopx = tmvopx + (t3 - t2)
-      end if
-c 
-c     %------------------------------------------------------%
-c     | Starting vector is now in the range of OP; r = OP*r; |
-c     | Compute B-norm of starting vector.                   |
-c     %------------------------------------------------------%
-c
-      call igraphsecond (t2)
-      first = .TRUE.
-      if (bmat .eq. 'G') then
-         nbx = nbx + 1
-         call dcopy (n, workd(n+1), 1, resid, 1)
-         ipntr(1) = n + 1
-         ipntr(2) = 1
-         ido = 2
-         go to 9000
-      else if (bmat .eq. 'I') then
-         call dcopy (n, resid, 1, workd, 1)
-      end if
-c 
-   20 continue
-c
-      if (bmat .eq. 'G') then
-         call igraphsecond (t3)
-         tmvbx = tmvbx + (t3 - t2)
-      end if
-c 
-      first = .FALSE.
-      if (bmat .eq. 'G') then
-          rnorm0 = ddot (n, resid, 1, workd, 1)
-          rnorm0 = sqrt(abs(rnorm0))
-      else if (bmat .eq. 'I') then
-           rnorm0 = dnrm2(n, resid, 1)
-      end if
-      rnorm  = rnorm0
-c
-c     %---------------------------------------------%
-c     | Exit if this is the very first Arnoldi step |
-c     %---------------------------------------------%
-c
-      if (j .eq. 1) go to 50
-c 
-c     %----------------------------------------------------------------
-c     | Otherwise need to B-orthogonalize the starting vector against |
-c     | the current Arnoldi basis using Gram-Schmidt with iter. ref.  |
-c     | This is the case where an invariant subspace is encountered   |
-c     | in the middle of the Arnoldi factorization.                   |
-c     |                                                               |
-c     |       s = V^{T}*B*r;   r = r - V*s;                           |
-c     |                                                               |
-c     | Stopping criteria used for iter. ref. is discussed in         |
-c     | Parlett's book, page 107 and in Gragg & Reichel TOMS paper.   |
-c     %---------------------------------------------------------------%
-c
-      orth = .TRUE.
-   30 continue
-c
-      call dgemv ('T', n, j-1, one, v, ldv, workd, 1, 
-     &            zero, workd(n+1), 1)
-      call dgemv ('N', n, j-1, -one, v, ldv, workd(n+1), 1, 
-     &            one, resid, 1)
-c 
-c     %----------------------------------------------------------%
-c     | Compute the B-norm of the orthogonalized starting vector |
-c     %----------------------------------------------------------%
-c
-      call igraphsecond (t2)
-      if (bmat .eq. 'G') then
-         nbx = nbx + 1
-         call dcopy (n, resid, 1, workd(n+1), 1)
-         ipntr(1) = n + 1
-         ipntr(2) = 1
-         ido = 2
-         go to 9000
-      else if (bmat .eq. 'I') then
-         call dcopy (n, resid, 1, workd, 1)
-      end if
-c 
-   40 continue
-c
-      if (bmat .eq. 'G') then
-         call igraphsecond (t3)
-         tmvbx = tmvbx + (t3 - t2)
-      end if
-c 
-      if (bmat .eq. 'G') then
-         rnorm = ddot (n, resid, 1, workd, 1)
-         rnorm = sqrt(abs(rnorm))
-      else if (bmat .eq. 'I') then
-         rnorm = dnrm2(n, resid, 1)
-      end if
-c
-c     %--------------------------------------%
-c     | Check for further orthogonalization. |
-c     %--------------------------------------%
-c
-      if (msglvl .gt. 2) then
-          call igraphdvout (logfil, 1, rnorm0, ndigit, 
-     &                '_getv0: re-orthonalization ; rnorm0 is')
-          call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &                '_getv0: re-orthonalization ; rnorm is')
-      end if
-c
-      if (rnorm .gt. 0.717*rnorm0) go to 50
-c 
-      iter = iter + 1
-      if (iter .le. 1) then
-c
-c        %-----------------------------------%
-c        | Perform iterative refinement step |
-c        %-----------------------------------%
-c
-         rnorm0 = rnorm
-         go to 30
-      else
-c
-c        %------------------------------------%
-c        | Iterative refinement step "failed" |
-c        %------------------------------------%
-c
-         do 45 jj = 1, n
-            resid(jj) = zero
-   45    continue
-         rnorm = zero
-         ierr = -1
-      end if
-c 
-   50 continue
-c
-      if (msglvl .gt. 0) then
-         call igraphdvout (logfil, 1, rnorm, ndigit,
-     &        '_getv0: B-norm of initial / restarted starting vector')
-      end if
-      if (msglvl .gt. 2) then
-         call igraphdvout (logfil, n, resid, ndigit,
-     &        '_getv0: initial / restarted starting vector')
-      end if
-      ido = 99
-c 
-      call igraphsecond (t1)
-      tgetv0 = tgetv0 + (t1 - t0)
-c 
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdgetv0 |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dlaqrb.f igraph-0.6.5/interfaces/R/arpack/dlaqrb.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dlaqrb.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dlaqrb.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,521 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdlaqrb
-c
-c\Description:
-c  Compute the eigenvalues and the Schur decomposition of an upper 
-c  Hessenberg submatrix in rows and columns ILO to IHI.  Only the
-c  last component of the Schur vectors are computed.
-c
-c  This is mostly a modification of the LAPACK routine dlahqr.
-c  
-c\Usage:
-c  call igraphdlaqrb
-c     ( WANTT, N, ILO, IHI, H, LDH, WR, WI,  Z, INFO )
-c
-c\Arguments
-c  WANTT   Logical variable.  (INPUT)
-c          = .TRUE. : the full Schur form T is required;
-c          = .FALSE.: only eigenvalues are required.
-c
-c  N       Integer.  (INPUT)
-c          The order of the matrix H.  N >= 0.
-c
-c  ILO     Integer.  (INPUT)
-c  IHI     Integer.  (INPUT)
-c          It is assumed that H is already upper quasi-triangular in
-c          rows and columns IHI+1:N, and that H(ILO,ILO-1) = 0 (unless
-c          ILO = 1). SLAQRB works primarily with the Hessenberg
-c          submatrix in rows and columns ILO to IHI, but applies
-c          transformations to all of H if WANTT is .TRUE..
-c          1 <= ILO <= max(1,IHI); IHI <= N.
-c
-c  H       Double precision array, dimension (LDH,N).  (INPUT/OUTPUT)
-c          On entry, the upper Hessenberg matrix H.
-c          On exit, if WANTT is .TRUE., H is upper quasi-triangular in
-c          rows and columns ILO:IHI, with any 2-by-2 diagonal blocks in
-c          standard form. If WANTT is .FALSE., the contents of H are
-c          unspecified on exit.
-c
-c  LDH     Integer.  (INPUT)
-c          The leading dimension of the array H. LDH >= max(1,N).
-c
-c  WR      Double precision array, dimension (N).  (OUTPUT)
-c  WI      Double precision array, dimension (N).  (OUTPUT)
-c          The real and imaginary parts, respectively, of the computed
-c          eigenvalues ILO to IHI are stored in the corresponding
-c          elements of WR and WI. If two eigenvalues are computed as a
-c          complex conjugate pair, they are stored in consecutive
-c          elements of WR and WI, say the i-th and (i+1)th, with
-c          WI(i) > 0 and WI(i+1) < 0. If WANTT is .TRUE., the
-c          eigenvalues are stored in the same order as on the diagonal
-c          of the Schur form returned in H, with WR(i) = H(i,i), and, if
-c          H(i:i+1,i:i+1) is a 2-by-2 diagonal block,
-c          WI(i) = sqrt(H(i+1,i)*H(i,i+1)) and WI(i+1) = -WI(i).
-c
-c  Z       Double precision array, dimension (N).  (OUTPUT)
-c          On exit Z contains the last components of the Schur vectors.
-c
-c  INFO    Integer.  (OUPUT)
-c          = 0: successful exit
-c          > 0: SLAQRB failed to compute all the eigenvalues ILO to IHI
-c               in a total of 30*(IHI-ILO+1) iterations; if INFO = i,
-c               elements i+1:ihi of WR and WI contain those eigenvalues
-c               which have been successfully computed.
-c
-c\Remarks
-c  1. None.
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     dlabad  LAPACK routine that computes machine constants.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlanhs  LAPACK routine that computes various norms of a matrix.
-c     dlanv2  LAPACK routine that computes the Schur factorization of
-c             2 by 2 nonsymmetric matrix in standard form.
-c     dlarfg  LAPACK Householder reflection construction routine.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     drot    Level 1 BLAS that applies a rotation to a 2 by 2 matrix.
-
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.4'
-c               Modified from the LAPACK routine dlahqr so that only the
-c               last component of the Schur vectors are computed.
-c
-c\SCCS Information: @(#) 
-c FILE: laqrb.F   SID: 2.2   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\Remarks
-c     1. None
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdlaqrb ( wantt, n, ilo, ihi, h, ldh, wr, wi,
-     &                    z, info )
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      logical    wantt
-      integer    ihi, ilo, info, ldh, n
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           h( ldh, * ), wi( * ), wr( * ), z( * )
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           zero, one, dat1, dat2
-      parameter (zero = 0.0D+0, one = 1.0D+0, dat1 = 7.5D-1, 
-     &           dat2 = -4.375D-1)
-c
-c     %------------------------%
-c     | Local Scalars & Arrays |
-c     %------------------------%
-c
-      integer    i, i1, i2, itn, its, j, k, l, m, nh, nr
-      Double precision
-     &           cs, h00, h10, h11, h12, h21, h22, h33, h33s,
-     &           h43h34, h44, h44s, ovfl, s, smlnum, sn, sum,
-     &           t1, t2, t3, tst1, ulp, unfl, v1, v2, v3
-      Double precision
-     &           v( 3 ), work( 1 )
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlamch, dlanhs
-      external   dlamch, dlanhs
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, dlabad, dlanv2, dlarfg, drot
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      info = 0
-c
-c     %--------------------------%
-c     | Quick return if possible |
-c     %--------------------------%
-c
-      if( n.eq.0 )
-     &   return
-      if( ilo.eq.ihi ) then
-         wr( ilo ) = h( ilo, ilo )
-         wi( ilo ) = zero
-         return
-      end if
-c 
-c     %---------------------------------------------%
-c     | Initialize the vector of last components of |
-c     | the Schur vectors for accumulation.         |
-c     %---------------------------------------------%
-c
-      do 5 j = 1, n-1
-         z(j) = zero
-  5   continue 
-      z(n) = one
-c 
-      nh = ihi - ilo + 1
-c
-c     %-------------------------------------------------------------%
-c     | Set machine-dependent constants for the stopping criterion. |
-c     | If norm(H) <= sqrt(OVFL), overflow should not occur.        |
-c     %-------------------------------------------------------------%
-c
-      unfl = dlamch( 'safe minimum' )
-      ovfl = one / unfl
-      call dlabad( unfl, ovfl )
-      ulp = dlamch( 'precision' )
-      smlnum = unfl*( nh / ulp )
-c
-c     %---------------------------------------------------------------%
-c     | I1 and I2 are the indices of the first row and last column    |
-c     | of H to which transformations must be applied. If eigenvalues |
-c     | only are computed, I1 and I2 are set inside the main loop.    |
-c     | Zero out H(J+2,J) = ZERO for J=1:N if WANTT = .TRUE.          |
-c     | else H(J+2,J) for J=ILO:IHI-ILO-1 if WANTT = .FALSE.          |
-c     %---------------------------------------------------------------%
-c
-      if( wantt ) then
-         i1 = 1
-         i2 = n
-         do 8 i=1,i2-2
-            h(i1+i+1,i) = zero
- 8       continue
-      else
-         do 9 i=1, ihi-ilo-1
-            h(ilo+i+1,ilo+i-1) = zero
- 9       continue
-      end if
-c 
-c     %---------------------------------------------------%
-c     | ITN is the total number of QR iterations allowed. |
-c     %---------------------------------------------------%
-c
-      itn = 30*nh
-c 
-c     ------------------------------------------------------------------
-c     The main loop begins here. I is the loop index and decreases from
-c     IHI to ILO in steps of 1 or 2. Each iteration of the loop works
-c     with the active submatrix in rows and columns L to I.
-c     Eigenvalues I+1 to IHI have already converged. Either L = ILO or
-c     H(L,L-1) is negligible so that the matrix splits.
-c     ------------------------------------------------------------------
-c 
-      i = ihi
-   10 continue
-      l = ilo
-      if( i.lt.ilo )
-     &   go to 150
- 
-c     %--------------------------------------------------------------%
-c     | Perform QR iterations on rows and columns ILO to I until a   |
-c     | submatrix of order 1 or 2 splits off at the bottom because a |
-c     | subdiagonal element has become negligible.                   |
-c     %--------------------------------------------------------------%
- 
-      do 130 its = 0, itn
-c
-c        %----------------------------------------------%
-c        | Look for a single small subdiagonal element. |
-c        %----------------------------------------------%
-c
-         do 20 k = i, l + 1, -1
-            tst1 = abs( h( k-1, k-1 ) ) + abs( h( k, k ) )
-            if( tst1.eq.zero )
-     &         tst1 = dlanhs( '1', i-l+1, h( l, l ), ldh, work )
-            if( abs( h( k, k-1 ) ).le.max( ulp*tst1, smlnum ) )
-     &         go to 30
-   20    continue
-   30    continue
-         l = k
-         if( l.gt.ilo ) then
-c
-c           %------------------------%
-c           | H(L,L-1) is negligible |
-c           %------------------------%
-c
-            h( l, l-1 ) = zero
-         end if
-c
-c        %-------------------------------------------------------------%
-c        | Exit from loop if a submatrix of order 1 or 2 has split off |
-c        %-------------------------------------------------------------%
-c
-         if( l.ge.i-1 )
-     &      go to 140
-c
-c        %---------------------------------------------------------%
-c        | Now the active submatrix is in rows and columns L to I. |
-c        | If eigenvalues only are being computed, only the active |
-c        | submatrix need be transformed.                          |
-c        %---------------------------------------------------------%
-c
-         if( .not.wantt ) then
-            i1 = l
-            i2 = i
-         end if
-c 
-         if( its.eq.10 .or. its.eq.20 ) then
-c
-c           %-------------------%
-c           | Exceptional shift |
-c           %-------------------%
-c
-            s = abs( h( i, i-1 ) ) + abs( h( i-1, i-2 ) )
-            h44 = dat1*s
-            h33 = h44
-            h43h34 = dat2*s*s
-c
-         else
-c
-c           %-----------------------------------------%
-c           | Prepare to use Wilkinson's double shift |
-c           %-----------------------------------------%
-c
-            h44 = h( i, i )
-            h33 = h( i-1, i-1 )
-            h43h34 = h( i, i-1 )*h( i-1, i )
-         end if
-c
-c        %-----------------------------------------------------%
-c        | Look for two consecutive small subdiagonal elements |
-c        %-----------------------------------------------------%
-c
-         do 40 m = i - 2, l, -1
-c
-c           %---------------------------------------------------------%
-c           | Determine the effect of starting the double-shift QR    |
-c           | iteration at row M, and see if this would make H(M,M-1) |
-c           | negligible.                                             |
-c           %---------------------------------------------------------%
-c
-            h11 = h( m, m )
-            h22 = h( m+1, m+1 )
-            h21 = h( m+1, m )
-            h12 = h( m, m+1 )
-            h44s = h44 - h11
-            h33s = h33 - h11
-            v1 = ( h33s*h44s-h43h34 ) / h21 + h12
-            v2 = h22 - h11 - h33s - h44s
-            v3 = h( m+2, m+1 )
-            s = abs( v1 ) + abs( v2 ) + abs( v3 )
-            v1 = v1 / s
-            v2 = v2 / s
-            v3 = v3 / s
-            v( 1 ) = v1
-            v( 2 ) = v2
-            v( 3 ) = v3
-            if( m.eq.l )
-     &         go to 50
-            h00 = h( m-1, m-1 )
-            h10 = h( m, m-1 )
-            tst1 = abs( v1 )*( abs( h00 )+abs( h11 )+abs( h22 ) )
-            if( abs( h10 )*( abs( v2 )+abs( v3 ) ).le.ulp*tst1 )
-     &         go to 50
-   40    continue
-   50    continue
-c
-c        %----------------------%
-c        | Double-shift QR step |
-c        %----------------------%
-c
-         do 120 k = m, i - 1
-c 
-c           ------------------------------------------------------------
-c           The first iteration of this loop determines a reflection G
-c           from the vector V and applies it from left and right to H,
-c           thus creating a nonzero bulge below the subdiagonal.
-c
-c           Each subsequent iteration determines a reflection G to
-c           restore the Hessenberg form in the (K-1)th column, and thus
-c           chases the bulge one step toward the bottom of the active
-c           submatrix. NR is the order of G.
-c           ------------------------------------------------------------
-c 
-            nr = min( 3, i-k+1 )
-            if( k.gt.m )
-     &         call dcopy( nr, h( k, k-1 ), 1, v, 1 )
-            call dlarfg( nr, v( 1 ), v( 2 ), 1, t1 )
-            if( k.gt.m ) then
-               h( k, k-1 ) = v( 1 )
-               h( k+1, k-1 ) = zero
-               if( k.lt.i-1 )
-     &            h( k+2, k-1 ) = zero
-            else if( m.gt.l ) then
-               h( k, k-1 ) = -h( k, k-1 )
-            end if
-            v2 = v( 2 )
-            t2 = t1*v2
-            if( nr.eq.3 ) then
-               v3 = v( 3 )
-               t3 = t1*v3
-c
-c              %------------------------------------------------%
-c              | Apply G from the left to transform the rows of |
-c              | the matrix in columns K to I2.                 |
-c              %------------------------------------------------%
-c
-               do 60 j = k, i2
-                  sum = h( k, j ) + v2*h( k+1, j ) + v3*h( k+2, j )
-                  h( k, j ) = h( k, j ) - sum*t1
-                  h( k+1, j ) = h( k+1, j ) - sum*t2
-                  h( k+2, j ) = h( k+2, j ) - sum*t3
-   60          continue
-c
-c              %----------------------------------------------------%
-c              | Apply G from the right to transform the columns of |
-c              | the matrix in rows I1 to min(K+3,I).               |
-c              %----------------------------------------------------%
-c
-               do 70 j = i1, min( k+3, i )
-                  sum = h( j, k ) + v2*h( j, k+1 ) + v3*h( j, k+2 )
-                  h( j, k ) = h( j, k ) - sum*t1
-                  h( j, k+1 ) = h( j, k+1 ) - sum*t2
-                  h( j, k+2 ) = h( j, k+2 ) - sum*t3
-   70          continue
-c
-c              %----------------------------------%
-c              | Accumulate transformations for Z |
-c              %----------------------------------%
-c
-               sum      = z( k ) + v2*z( k+1 ) + v3*z( k+2 )
-               z( k )   = z( k ) - sum*t1
-               z( k+1 ) = z( k+1 ) - sum*t2
-               z( k+2 ) = z( k+2 ) - sum*t3
- 
-            else if( nr.eq.2 ) then
-c
-c              %------------------------------------------------%
-c              | Apply G from the left to transform the rows of |
-c              | the matrix in columns K to I2.                 |
-c              %------------------------------------------------%
-c
-               do 90 j = k, i2
-                  sum = h( k, j ) + v2*h( k+1, j )
-                  h( k, j ) = h( k, j ) - sum*t1
-                  h( k+1, j ) = h( k+1, j ) - sum*t2
-   90          continue
-c
-c              %----------------------------------------------------%
-c              | Apply G from the right to transform the columns of |
-c              | the matrix in rows I1 to min(K+3,I).               |
-c              %----------------------------------------------------%
-c
-               do 100 j = i1, i
-                  sum = h( j, k ) + v2*h( j, k+1 )
-                  h( j, k ) = h( j, k ) - sum*t1
-                  h( j, k+1 ) = h( j, k+1 ) - sum*t2
-  100          continue
-c
-c              %----------------------------------%
-c              | Accumulate transformations for Z |
-c              %----------------------------------%
-c
-               sum      = z( k ) + v2*z( k+1 )
-               z( k )   = z( k ) - sum*t1
-               z( k+1 ) = z( k+1 ) - sum*t2
-            end if
-  120    continue
- 
-  130 continue
-c
-c     %-------------------------------------------------------%
-c     | Failure to converge in remaining number of iterations |
-c     %-------------------------------------------------------%
-c
-      info = i
-      return
- 
-  140 continue
- 
-      if( l.eq.i ) then
-c
-c        %------------------------------------------------------%
-c        | H(I,I-1) is negligible: one eigenvalue has converged |
-c        %------------------------------------------------------%
-c
-         wr( i ) = h( i, i )
-         wi( i ) = zero
-
-      else if( l.eq.i-1 ) then
-c
-c        %--------------------------------------------------------%
-c        | H(I-1,I-2) is negligible;                              |
-c        | a pair of eigenvalues have converged.                  |
-c        |                                                        |
-c        | Transform the 2-by-2 submatrix to standard Schur form, |
-c        | and compute and store the eigenvalues.                 |
-c        %--------------------------------------------------------%
-c
-         call dlanv2( h( i-1, i-1 ), h( i-1, i ), h( i, i-1 ),
-     &                h( i, i ), wr( i-1 ), wi( i-1 ), wr( i ), wi( i ),
-     &                cs, sn )
- 
-         if( wantt ) then
-c
-c           %-----------------------------------------------------%
-c           | Apply the transformation to the rest of H and to Z, |
-c           | as required.                                        |
-c           %-----------------------------------------------------%
-c
-            if( i2.gt.i )
-     &         call drot( i2-i, h( i-1, i+1 ), ldh, h( i, i+1 ), ldh,
-     &                    cs, sn )
-            call drot( i-i1-1, h( i1, i-1 ), 1, h( i1, i ), 1, cs, sn )
-            sum      = cs*z( i-1 ) + sn*z( i )
-            z( i )   = cs*z( i )   - sn*z( i-1 )
-            z( i-1 ) = sum
-         end if
-      end if
-c
-c     %---------------------------------------------------------%
-c     | Decrement number of remaining iterations, and return to |
-c     | start of the main loop with new value of I.             |
-c     %---------------------------------------------------------%
-c
-      itn = itn - its
-      i = l - 1
-      go to 10
- 
-  150 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdlaqrb |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dmout.f igraph-0.6.5/interfaces/R/arpack/dmout.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dmout.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dmout.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,167 +0,0 @@
-*-----------------------------------------------------------------------
-*  Routine:    DMOUT
-*
-*  Purpose:    Real matrix output routine.
-*
-*  Usage:      CALL DMOUT (LOUT, M, N, A, LDA, IDIGIT, IFMT)
-*
-*  Arguments
-*     M      - Number of rows of A.  (Input)
-*     N      - Number of columns of A.  (Input)
-*     A      - Real M by N matrix to be printed.  (Input)
-*     LDA    - Leading dimension of A exactly as specified in the
-*              dimension statement of the calling program.  (Input)
-*     IFMT   - Format to be used in printing matrix A.  (Input)
-*     IDIGIT - Print up to IABS(IDIGIT) decimal digits per number.  (In)
-*              If IDIGIT .LT. 0, printing is done with 72 columns.
-*              If IDIGIT .GT. 0, printing is done with 132 columns.
-*
-*-----------------------------------------------------------------------
-*
-      SUBROUTINE IGRAPHDMOUT( LOUT, M, N, A, LDA, IDIGIT, IFMT )
-*     ...
-*     ... SPECIFICATIONS FOR ARGUMENTS
-*     ...
-*     ... SPECIFICATIONS FOR LOCAL VARIABLES
-*     .. Scalar Arguments ..
-      CHARACTER*( * )    IFMT
-      INTEGER            IDIGIT, LDA, LOUT, M, N
-*     ..
-*     .. Array Arguments ..
-      DOUBLE PRECISION   A( LDA, * )
-*     ..
-*     .. Local Scalars ..
-      CHARACTER*80       LINE
-      INTEGER            I, J, K1, K2, LLL, NDIGIT
-*     ..
-*     .. Local Arrays ..
-      CHARACTER          ICOL( 3 )
-*     ..
-*     .. Intrinsic Functions ..
-      INTRINSIC          LEN, MIN, MIN0
-*     ..
-*     .. Data statements ..
-      DATA               ICOL( 1 ), ICOL( 2 ), ICOL( 3 ) / 'C', 'o',
-     $                   'l' /
-*     ..
-*     .. Executable Statements ..
-*     ...
-*     ... FIRST EXECUTABLE STATEMENT
-*
-c$$$      LLL = MIN( LEN( IFMT ), 80 )
-c$$$      DO 10 I = 1, LLL
-c$$$         LINE( I: I ) = '-'
-c$$$   10 CONTINUE
-c$$$*
-c$$$      DO 20 I = LLL + 1, 80
-c$$$         LINE( I: I ) = ' '
-c$$$   20 CONTINUE
-c$$$*
-c$$$      WRITE( LOUT, FMT = 9999 )IFMT, LINE( 1: LLL )
-c$$$ 9999 FORMAT( / 1X, A, / 1X, A )
-c$$$*
-c$$$      IF( M.LE.0 .OR. N.LE.0 .OR. LDA.LE.0 )
-c$$$     $   RETURN
-c$$$      NDIGIT = IDIGIT
-c$$$      IF( IDIGIT.EQ.0 )
-c$$$     $   NDIGIT = 4
-c$$$*
-c$$$*=======================================================================
-c$$$*             CODE FOR OUTPUT USING 72 COLUMNS FORMAT
-c$$$*=======================================================================
-c$$$*
-c$$$      IF( IDIGIT.LT.0 ) THEN
-c$$$         NDIGIT = -IDIGIT
-c$$$         IF( NDIGIT.LE.4 ) THEN
-c$$$            DO 40 K1 = 1, N, 5
-c$$$               K2 = MIN0( N, K1+4 )
-c$$$               WRITE( LOUT, FMT = 9998 )( ICOL, I, I = K1, K2 )
-c$$$               DO 30 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9994 )I, ( A( I, J ), J = K1, K2 )
-c$$$   30          CONTINUE
-c$$$   40       CONTINUE
-c$$$*
-c$$$         ELSE IF( NDIGIT.LE.6 ) THEN
-c$$$            DO 60 K1 = 1, N, 4
-c$$$               K2 = MIN0( N, K1+3 )
-c$$$               WRITE( LOUT, FMT = 9997 )( ICOL, I, I = K1, K2 )
-c$$$               DO 50 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9993 )I, ( A( I, J ), J = K1, K2 )
-c$$$   50          CONTINUE
-c$$$   60       CONTINUE
-c$$$*
-c$$$         ELSE IF( NDIGIT.LE.10 ) THEN
-c$$$            DO 80 K1 = 1, N, 3
-c$$$               K2 = MIN0( N, K1+2 )
-c$$$               WRITE( LOUT, FMT = 9996 )( ICOL, I, I = K1, K2 )
-c$$$               DO 70 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9992 )I, ( A( I, J ), J = K1, K2 )
-c$$$   70          CONTINUE
-c$$$   80       CONTINUE
-c$$$*
-c$$$         ELSE
-c$$$            DO 100 K1 = 1, N, 2
-c$$$               K2 = MIN0( N, K1+1 )
-c$$$               WRITE( LOUT, FMT = 9995 )( ICOL, I, I = K1, K2 )
-c$$$               DO 90 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9991 )I, ( A( I, J ), J = K1, K2 )
-c$$$   90          CONTINUE
-c$$$  100       CONTINUE
-c$$$         END IF
-c$$$*
-c$$$*=======================================================================
-c$$$*             CODE FOR OUTPUT USING 132 COLUMNS FORMAT
-c$$$*=======================================================================
-c$$$*
-c$$$      ELSE
-c$$$         IF( NDIGIT.LE.4 ) THEN
-c$$$            DO 120 K1 = 1, N, 10
-c$$$               K2 = MIN0( N, K1+9 )
-c$$$               WRITE( LOUT, FMT = 9998 )( ICOL, I, I = K1, K2 )
-c$$$               DO 110 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9994 )I, ( A( I, J ), J = K1, K2 )
-c$$$  110          CONTINUE
-c$$$  120       CONTINUE
-c$$$*
-c$$$         ELSE IF( NDIGIT.LE.6 ) THEN
-c$$$            DO 140 K1 = 1, N, 8
-c$$$               K2 = MIN0( N, K1+7 )
-c$$$               WRITE( LOUT, FMT = 9997 )( ICOL, I, I = K1, K2 )
-c$$$               DO 130 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9993 )I, ( A( I, J ), J = K1, K2 )
-c$$$  130          CONTINUE
-c$$$  140       CONTINUE
-c$$$*
-c$$$         ELSE IF( NDIGIT.LE.10 ) THEN
-c$$$            DO 160 K1 = 1, N, 6
-c$$$               K2 = MIN0( N, K1+5 )
-c$$$               WRITE( LOUT, FMT = 9996 )( ICOL, I, I = K1, K2 )
-c$$$               DO 150 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9992 )I, ( A( I, J ), J = K1, K2 )
-c$$$  150          CONTINUE
-c$$$  160       CONTINUE
-c$$$*
-c$$$         ELSE
-c$$$            DO 180 K1 = 1, N, 5
-c$$$               K2 = MIN0( N, K1+4 )
-c$$$               WRITE( LOUT, FMT = 9995 )( ICOL, I, I = K1, K2 )
-c$$$               DO 170 I = 1, M
-c$$$                  WRITE( LOUT, FMT = 9991 )I, ( A( I, J ), J = K1, K2 )
-c$$$  170          CONTINUE
-c$$$  180       CONTINUE
-c$$$         END IF
-c$$$      END IF
-c$$$      WRITE( LOUT, FMT = 9990 )
-c$$$*
-c$$$ 9998 FORMAT( 10X, 10( 4X, 3A1, I4, 1X ) )
-c$$$ 9997 FORMAT( 10X, 8( 5X, 3A1, I4, 2X ) )
-c$$$ 9996 FORMAT( 10X, 6( 7X, 3A1, I4, 4X ) )
-c$$$ 9995 FORMAT( 10X, 5( 9X, 3A1, I4, 6X ) )
-c$$$ 9994 FORMAT( 1X, ' Row', I4, ':', 1X, 1P, 10D12.3 )
-c$$$ 9993 FORMAT( 1X, ' Row', I4, ':', 1X, 1P, 8D14.5 )
-c$$$ 9992 FORMAT( 1X, ' Row', I4, ':', 1X, 1P, 6D18.9 )
-c$$$ 9991 FORMAT( 1X, ' Row', I4, ':', 1X, 1P, 5D22.13 )
-c$$$ 9990 FORMAT( 1X, ' ' )
-*
-      RETURN
-      END
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dnaitr.f igraph-0.6.5/interfaces/R/arpack/dnaitr.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dnaitr.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dnaitr.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,840 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdnaitr
-c
-c\Description: 
-c  Reverse communication interface for applying NP additional steps to 
-c  a K step nonsymmetric Arnoldi factorization.
-c
-c  Input:  OP*V_{k}  -  V_{k}*H = r_{k}*e_{k}^T
-c
-c          with (V_{k}^T)*B*V_{k} = I, (V_{k}^T)*B*r_{k} = 0.
-c
-c  Output: OP*V_{k+p}  -  V_{k+p}*H = r_{k+p}*e_{k+p}^T
-c
-c          with (V_{k+p}^T)*B*V_{k+p} = I, (V_{k+p}^T)*B*r_{k+p} = 0.
-c
-c  where OP and B are as in igraphdnaupd.  The B-norm of r_{k+p} is also
-c  computed and returned.
-c
-c\Usage:
-c  call igraphdnaitr
-c     ( IDO, BMAT, N, K, NP, NB, RESID, RNORM, V, LDV, H, LDH, 
-c       IPNTR, WORKD, INFO )
-c
-c\Arguments
-c  IDO     Integer.  (INPUT/OUTPUT)
-c          Reverse communication flag.
-c          -------------------------------------------------------------
-c          IDO =  0: first call to the reverse communication interface
-c          IDO = -1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y.
-c                    This is for the restart phase to force the new
-c                    starting vector into the range of OP.
-c          IDO =  1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y,
-c                    IPNTR(3) is the pointer into WORK for B * X.
-c          IDO =  2: compute  Y = B * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y.
-c          IDO = 99: done
-c          -------------------------------------------------------------
-c          When the routine is used in the "shift-and-invert" mode, the
-c          vector B * Q is already available and do not need to be
-c          recompute in forming OP * Q.
-c
-c  BMAT    Character*1.  (INPUT)
-c          BMAT specifies the type of the matrix B that defines the
-c          semi-inner product for the operator OP.  See igraphdnaupd.
-c          B = 'I' -> standard eigenvalue problem A*x = lambda*x
-c          B = 'G' -> generalized eigenvalue problem A*x = lambda*M**x
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the eigenproblem.
-c
-c  K       Integer.  (INPUT)
-c          Current size of V and H.
-c
-c  NP      Integer.  (INPUT)
-c          Number of additional Arnoldi steps to take.
-c
-c  NB      Integer.  (INPUT)
-c          Blocksize to be used in the recurrence.          
-c          Only work for NB = 1 right now.  The goal is to have a 
-c          program that implement both the block and non-block method.
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          On INPUT:  RESID contains the residual vector r_{k}.
-c          On OUTPUT: RESID contains the residual vector r_{k+p}.
-c
-c  RNORM   Double precision scalar.  (INPUT/OUTPUT)
-c          B-norm of the starting residual on input.
-c          B-norm of the updated residual r_{k+p} on output.
-c
-c  V       Double precision N by K+NP array.  (INPUT/OUTPUT)
-c          On INPUT:  V contains the Arnoldi vectors in the first K 
-c          columns.
-c          On OUTPUT: V contains the new NP Arnoldi vectors in the next
-c          NP columns.  The first K columns are unchanged.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling 
-c          program.
-c
-c  H       Double precision (K+NP) by (K+NP) array.  (INPUT/OUTPUT)
-c          H is used to store the generated upper Hessenberg matrix.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling 
-c          program.
-c
-c  IPNTR   Integer array of length 3.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORK for 
-c          vectors used by the Arnoldi iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X.
-c          IPNTR(2): pointer to the current result vector Y.
-c          IPNTR(3): pointer to the vector B * X when used in the 
-c                    shift-and-invert mode.  X is the current operand.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (REVERSE COMMUNICATION)
-c          Distributed array to be used in the basic Arnoldi iteration
-c          for reverse communication.  The calling program should not 
-c          use WORKD as temporary workspace during the iteration !!!!!!
-c          On input, WORKD(1:N) = B*RESID and is used to save some 
-c          computation at the first step.
-c
-c  INFO    Integer.  (OUTPUT)
-c          = 0: Normal exit.
-c          > 0: Size of the spanning invariant subspace of OP found.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c
-c\Routines called:
-c     igraphdgetv0  ARPACK routine to generate the initial vector.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdmout   ARPACK utility routine that prints matrices
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlabad  LAPACK routine that computes machine constants.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlascl  LAPACK routine for careful scaling of a matrix.
-c     dlanhs  LAPACK routine that computes various norms of a matrix.
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     daxpy   Level 1 BLAS that computes a vector triad.
-c     dscal   Level 1 BLAS that scales a vector.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors. 
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c 
-c\Revision history:
-c     xx/xx/92: Version ' 2.4'
-c
-c\SCCS Information: @(#) 
-c FILE: naitr.F   SID: 2.4   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\Remarks
-c  The algorithm implemented is:
-c  
-c  restart = .false.
-c  Given V_{k} = [v_{1}, ..., v_{k}], r_{k}; 
-c  r_{k} contains the initial residual vector even for k = 0;
-c  Also assume that rnorm = || B*r_{k} || and B*r_{k} are already 
-c  computed by the calling program.
-c
-c  betaj = rnorm ; p_{k+1} = B*r_{k} ;
-c  For  j = k+1, ..., k+np  Do
-c     1) if ( betaj < tol ) stop or restart depending on j.
-c        ( At present tol is zero )
-c        if ( restart ) generate a new starting vector.
-c     2) v_{j} = r(j-1)/betaj;  V_{j} = [V_{j-1}, v_{j}];  
-c        p_{j} = p_{j}/betaj
-c     3) r_{j} = OP*v_{j} where OP is defined as in igraphdnaupd
-c        For shift-invert mode p_{j} = B*v_{j} is already available.
-c        wnorm = || OP*v_{j} ||
-c     4) Compute the j-th step residual vector.
-c        w_{j} =  V_{j}^T * B * OP * v_{j}
-c        r_{j} =  OP*v_{j} - V_{j} * w_{j}
-c        H(:,j) = w_{j};
-c        H(j,j-1) = rnorm
-c        rnorm = || r_(j) ||
-c        If (rnorm > 0.717*wnorm) accept step and go back to 1)
-c     5) Re-orthogonalization step:
-c        s = V_{j}'*B*r_{j}
-c        r_{j} = r_{j} - V_{j}*s;  rnorm1 = || r_{j} ||
-c        alphaj = alphaj + s_{j};   
-c     6) Iterative refinement step:
-c        If (rnorm1 > 0.717*rnorm) then
-c           rnorm = rnorm1
-c           accept step and go back to 1)
-c        Else
-c           rnorm = rnorm1
-c           If this is the first time in step 6), go to 5)
-c           Else r_{j} lies in the span of V_{j} numerically.
-c              Set r_{j} = 0 and rnorm = 0; go to 1)
-c        EndIf 
-c  End Do
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdnaitr
-     &   (ido, bmat, n, k, np, nb, resid, rnorm, v, ldv, h, ldh, 
-     &    ipntr, workd, info)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1
-      integer    ido, info, k, ldh, ldv, n, nb, np
-      Double precision
-     &           rnorm
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    ipntr(3)
-      Double precision
-     &           h(ldh,k+np), resid(n), v(ldv,k+np), workd(3*n)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      logical    first, orth1, orth2, rstart, step3, step4
-      integer    ierr, i, infol, ipj, irj, ivj, iter, itry, j, msglvl,
-     &           jj
-      Double precision
-     &           betaj, ovfl, temp1, rnorm1, smlnum, tst1, ulp, unfl, 
-     &           wnorm
-      save       first, orth1, orth2, rstart, step3, step4,
-     &           ierr, ipj, irj, ivj, iter, itry, j, msglvl, ovfl,
-     &           betaj, rnorm1, smlnum, ulp, unfl, wnorm
-c
-c     %-----------------------%
-c     | Local Array Arguments | 
-c     %-----------------------%
-c
-      Double precision
-     &           xtemp(2)
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   daxpy, dcopy, dscal, dgemv, igraphdgetv0, dlabad, 
-     &           igraphdvout, igraphdmout, igraphivout, igraphsecond
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           ddot, dnrm2, dlanhs, dlamch
-      external   ddot, dnrm2, dlanhs, dlamch
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    abs, sqrt
-c
-c     %-----------------%
-c     | Data statements |
-c     %-----------------%
-c
-      data      first / .true. /
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (first) then
-c
-c        %-----------------------------------------%
-c        | Set machine-dependent constants for the |
-c        | the splitting and deflation criterion.  |
-c        | If norm(H) <= sqrt(OVFL),               |
-c        | overflow should not occur.              |
-c        | REFERENCE: LAPACK subroutine dlahqr     |
-c        %-----------------------------------------%
-c
-         unfl = dlamch( 'safe minimum' )
-         ovfl = one / unfl
-         call dlabad( unfl, ovfl )
-         ulp = dlamch( 'precision' )
-         smlnum = unfl*( n / ulp )
-         first = .false.
-      end if
-c
-      if (ido .eq. 0) then
-c 
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphsecond (t0)
-         msglvl = mnaitr
-c 
-c        %------------------------------%
-c        | Initial call to this routine |
-c        %------------------------------%
-c
-         info   = 0
-         step3  = .false.
-         step4  = .false.
-         rstart = .false.
-         orth1  = .false.
-         orth2  = .false.
-         j      = k + 1
-         ipj    = 1
-         irj    = ipj   + n
-         ivj    = irj   + n
-      end if
-c 
-c     %-------------------------------------------------%
-c     | When in reverse communication mode one of:      |
-c     | STEP3, STEP4, ORTH1, ORTH2, RSTART              |
-c     | will be .true. when ....                        |
-c     | STEP3: return from computing OP*v_{j}.          |
-c     | STEP4: return from computing B-norm of OP*v_{j} |
-c     | ORTH1: return from computing B-norm of r_{j+1}  |
-c     | ORTH2: return from computing B-norm of          |
-c     |        correction to the residual vector.       |
-c     | RSTART: return from OP computations needed by   |
-c     |         igraphdgetv0.                                 |
-c     %-------------------------------------------------%
-c
-      if (step3)  go to 50
-      if (step4)  go to 60
-      if (orth1)  go to 70
-      if (orth2)  go to 90
-      if (rstart) go to 30
-c
-c     %-----------------------------%
-c     | Else this is the first step |
-c     %-----------------------------%
-c
-c     %--------------------------------------------------------------%
-c     |                                                              |
-c     |        A R N O L D I     I T E R A T I O N     L O O P       |
-c     |                                                              |
-c     | Note:  B*r_{j-1} is already in WORKD(1:N)=WORKD(IPJ:IPJ+N-1) |
-c     %--------------------------------------------------------------%
- 
- 1000 continue
-c
-         if (msglvl .gt. 1) then
-            call igraphivout (logfil, 1, j, ndigit, 
-     &                  '_naitr: generating Arnoldi vector number')
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &                  '_naitr: B-norm of the current residual is')
-         end if
-c 
-c        %---------------------------------------------------%
-c        | STEP 1: Check if the B norm of j-th residual      |
-c        | vector is zero. Equivalent to determing whether   |
-c        | an exact j-step Arnoldi factorization is present. |
-c        %---------------------------------------------------%
-c
-         betaj = rnorm
-         if (rnorm .gt. zero) go to 40
-c
-c           %---------------------------------------------------%
-c           | Invariant subspace found, generate a new starting |
-c           | vector which is orthogonal to the current Arnoldi |
-c           | basis and continue the iteration.                 |
-c           %---------------------------------------------------%
-c
-            if (msglvl .gt. 0) then
-               call igraphivout (logfil, 1, j, ndigit,
-     &                     '_naitr: ****** RESTART AT STEP ******')
-            end if
-c 
-c           %---------------------------------------------%
-c           | ITRY is the loop variable that controls the |
-c           | maximum amount of times that a restart is   |
-c           | attempted. NRSTRT is used by stat.h         |
-c           %---------------------------------------------%
-c 
-            betaj  = zero
-            nrstrt = nrstrt + 1
-            itry   = 1
-   20       continue
-            rstart = .true.
-            ido    = 0
-   30       continue
-c
-c           %--------------------------------------%
-c           | If in reverse communication mode and |
-c           | RSTART = .true. flow returns here.   |
-c           %--------------------------------------%
-c
-            call igraphdgetv0 (ido, bmat, itry, .false., n, j, v, ldv, 
-     &                   resid, rnorm, ipntr, workd, ierr)
-            if (ido .ne. 99) go to 9000
-            if (ierr .lt. 0) then
-               itry = itry + 1
-               if (itry .le. 3) go to 20
-c
-c              %------------------------------------------------%
-c              | Give up after several restart attempts.        |
-c              | Set INFO to the size of the invariant subspace |
-c              | which spans OP and exit.                       |
-c              %------------------------------------------------%
-c
-               info = j - 1
-               call igraphsecond (t1)
-               tnaitr = tnaitr + (t1 - t0)
-               ido = 99
-               go to 9000
-            end if
-c 
-   40    continue
-c
-c        %---------------------------------------------------------%
-c        | STEP 2:  v_{j} = r_{j-1}/rnorm and p_{j} = p_{j}/rnorm  |
-c        | Note that p_{j} = B*r_{j-1}. In order to avoid overflow |
-c        | when reciprocating a small RNORM, test against lower    |
-c        | machine bound.                                          |
-c        %---------------------------------------------------------%
-c
-         call dcopy (n, resid, 1, v(1,j), 1)
-         if (rnorm .ge. unfl) then
-             temp1 = one / rnorm
-             call dscal (n, temp1, v(1,j), 1)
-             call dscal (n, temp1, workd(ipj), 1)
-         else
-c
-c            %-----------------------------------------%
-c            | To scale both v_{j} and p_{j} carefully |
-c            | use LAPACK routine SLASCL               |
-c            %-----------------------------------------%
-c
-             call dlascl ('General', i, i, rnorm, one, n, 1, 
-     &                    v(1,j), n, infol)
-             call dlascl ('General', i, i, rnorm, one, n, 1, 
-     &                    workd(ipj), n, infol)
-         end if
-c
-c        %------------------------------------------------------%
-c        | STEP 3:  r_{j} = OP*v_{j}; Note that p_{j} = B*v_{j} |
-c        | Note that this is not quite yet r_{j}. See STEP 4    |
-c        %------------------------------------------------------%
-c
-         step3 = .true.
-         nopx  = nopx + 1
-         call igraphsecond (t2)
-         call dcopy (n, v(1,j), 1, workd(ivj), 1)
-         ipntr(1) = ivj
-         ipntr(2) = irj
-         ipntr(3) = ipj
-         ido = 1
-c 
-c        %-----------------------------------%
-c        | Exit in order to compute OP*v_{j} |
-c        %-----------------------------------%
-c 
-         go to 9000 
-   50    continue
-c 
-c        %----------------------------------%
-c        | Back from reverse communication; |
-c        | WORKD(IRJ:IRJ+N-1) := OP*v_{j}   |
-c        | if step3 = .true.                |
-c        %----------------------------------%
-c
-         call igraphsecond (t3)
-         tmvopx = tmvopx + (t3 - t2)
- 
-         step3 = .false.
-c
-c        %------------------------------------------%
-c        | Put another copy of OP*v_{j} into RESID. |
-c        %------------------------------------------%
-c
-         call dcopy (n, workd(irj), 1, resid, 1)
-c 
-c        %---------------------------------------%
-c        | STEP 4:  Finish extending the Arnoldi |
-c        |          factorization to length j.   |
-c        %---------------------------------------%
-c
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            step4 = .true.
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %-------------------------------------%
-c           | Exit in order to compute B*OP*v_{j} |
-c           %-------------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd(ipj), 1)
-         end if
-   60    continue
-c 
-c        %----------------------------------%
-c        | Back from reverse communication; |
-c        | WORKD(IPJ:IPJ+N-1) := B*OP*v_{j} |
-c        | if step4 = .true.                |
-c        %----------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c 
-         step4 = .false.
-c
-c        %-------------------------------------%
-c        | The following is needed for STEP 5. |
-c        | Compute the B-norm of OP*v_{j}.     |
-c        %-------------------------------------%
-c
-         if (bmat .eq. 'G') then  
-             wnorm = ddot (n, resid, 1, workd(ipj), 1)
-             wnorm = sqrt(abs(wnorm))
-         else if (bmat .eq. 'I') then
-            wnorm = dnrm2(n, resid, 1)
-         end if
-c
-c        %-----------------------------------------%
-c        | Compute the j-th residual corresponding |
-c        | to the j step factorization.            |
-c        | Use Classical Gram Schmidt and compute: |
-c        | w_{j} <-  V_{j}^T * B * OP * v_{j}      |
-c        | r_{j} <-  OP*v_{j} - V_{j} * w_{j}      |
-c        %-----------------------------------------%
-c
-c
-c        %------------------------------------------%
-c        | Compute the j Fourier coefficients w_{j} |
-c        | WORKD(IPJ:IPJ+N-1) contains B*OP*v_{j}.  |
-c        %------------------------------------------%
-c 
-         call dgemv ('T', n, j, one, v, ldv, workd(ipj), 1,
-     &               zero, h(1,j), 1)
-c
-c        %--------------------------------------%
-c        | Orthogonalize r_{j} against V_{j}.   |
-c        | RESID contains OP*v_{j}. See STEP 3. | 
-c        %--------------------------------------%
-c
-         call dgemv ('N', n, j, -one, v, ldv, h(1,j), 1,
-     &               one, resid, 1)
-c
-         if (j .gt. 1) h(j,j-1) = betaj
-c
-         call igraphsecond (t4)
-c 
-         orth1 = .true.
-c
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(irj), 1)
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %----------------------------------%
-c           | Exit in order to compute B*r_{j} |
-c           %----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd(ipj), 1)
-         end if 
-   70    continue
-c 
-c        %---------------------------------------------------%
-c        | Back from reverse communication if ORTH1 = .true. |
-c        | WORKD(IPJ:IPJ+N-1) := B*r_{j}.                    |
-c        %---------------------------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c 
-         orth1 = .false.
-c
-c        %------------------------------%
-c        | Compute the B-norm of r_{j}. |
-c        %------------------------------%
-c
-         if (bmat .eq. 'G') then         
-            rnorm = ddot (n, resid, 1, workd(ipj), 1)
-            rnorm = sqrt(abs(rnorm))
-         else if (bmat .eq. 'I') then
-            rnorm = dnrm2(n, resid, 1)
-         end if
-c 
-c        %-----------------------------------------------------------%
-c        | STEP 5: Re-orthogonalization / Iterative refinement phase |
-c        | Maximum NITER_ITREF tries.                                |
-c        |                                                           |
-c        |          s      = V_{j}^T * B * r_{j}                     |
-c        |          r_{j}  = r_{j} - V_{j}*s                         |
-c        |          alphaj = alphaj + s_{j}                          |
-c        |                                                           |
-c        | The stopping criteria used for iterative refinement is    |
-c        | discussed in Parlett's book SEP, page 107 and in Gragg &  |
-c        | Reichel ACM TOMS paper; Algorithm 686, Dec. 1990.         |
-c        | Determine if we need to correct the residual. The goal is |
-c        | to enforce ||v(:,1:j)^T * r_{j}|| .le. eps * || r_{j} ||  |
-c        | The following test determines whether the sine of the     |
-c        | angle between  OP*x and the computed residual is less     |
-c        | than or equal to 0.717.                                   |
-c        %-----------------------------------------------------------%
-c
-         if (rnorm .gt. 0.717*wnorm) go to 100
-         iter  = 0
-         nrorth = nrorth + 1
-c 
-c        %---------------------------------------------------%
-c        | Enter the Iterative refinement phase. If further  |
-c        | refinement is necessary, loop back here. The loop |
-c        | variable is ITER. Perform a step of Classical     |
-c        | Gram-Schmidt using all the Arnoldi vectors V_{j}  |
-c        %---------------------------------------------------%
-c 
-   80    continue
-c
-         if (msglvl .gt. 2) then
-            xtemp(1) = wnorm
-            xtemp(2) = rnorm
-            call igraphdvout (logfil, 2, xtemp, ndigit, 
-     &           '_naitr: re-orthonalization; wnorm and rnorm are')
-            call igraphdvout (logfil, j, h(1,j), ndigit,
-     &                  '_naitr: j-th column of H')
-         end if
-c
-c        %----------------------------------------------------%
-c        | Compute V_{j}^T * B * r_{j}.                       |
-c        | WORKD(IRJ:IRJ+J-1) = v(:,1:J)'*WORKD(IPJ:IPJ+N-1). |
-c        %----------------------------------------------------%
-c
-         call dgemv ('T', n, j, one, v, ldv, workd(ipj), 1, 
-     &               zero, workd(irj), 1)
-c
-c        %---------------------------------------------%
-c        | Compute the correction to the residual:     |
-c        | r_{j} = r_{j} - V_{j} * WORKD(IRJ:IRJ+J-1). |
-c        | The correction to H is v(:,1:J)*H(1:J,1:J)  |
-c        | + v(:,1:J)*WORKD(IRJ:IRJ+J-1)*e'_j.         |
-c        %---------------------------------------------%
-c
-         call dgemv ('N', n, j, -one, v, ldv, workd(irj), 1, 
-     &               one, resid, 1)
-         call daxpy (j, one, workd(irj), 1, h(1,j), 1)
-c 
-         orth2 = .true.
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(irj), 1)
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %-----------------------------------%
-c           | Exit in order to compute B*r_{j}. |
-c           | r_{j} is the corrected residual.  |
-c           %-----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd(ipj), 1)
-         end if 
-   90    continue
-c
-c        %---------------------------------------------------%
-c        | Back from reverse communication if ORTH2 = .true. |
-c        %---------------------------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c
-c        %-----------------------------------------------------%
-c        | Compute the B-norm of the corrected residual r_{j}. |
-c        %-----------------------------------------------------%
-c 
-         if (bmat .eq. 'G') then         
-             rnorm1 = ddot (n, resid, 1, workd(ipj), 1)
-             rnorm1 = sqrt(abs(rnorm1))
-         else if (bmat .eq. 'I') then
-             rnorm1 = dnrm2(n, resid, 1)
-         end if
-c
-         if (msglvl .gt. 0 .and. iter .gt. 0) then
-            call igraphivout (logfil, 1, j, ndigit,
-     &           '_naitr: Iterative refinement for Arnoldi residual')
-            if (msglvl .gt. 2) then
-                xtemp(1) = rnorm
-                xtemp(2) = rnorm1
-                call igraphdvout (logfil, 2, xtemp, ndigit,
-     &           '_naitr: iterative refinement ; rnorm and rnorm1 are')
-            end if
-         end if
-c
-c        %-----------------------------------------%
-c        | Determine if we need to perform another |
-c        | step of re-orthogonalization.           |
-c        %-----------------------------------------%
-c
-         if (rnorm1 .gt. 0.717*rnorm) then
-c
-c           %---------------------------------------%
-c           | No need for further refinement.       |
-c           | The cosine of the angle between the   |
-c           | corrected residual vector and the old |
-c           | residual vector is greater than 0.717 |
-c           | In other words the corrected residual |
-c           | and the old residual vector share an  |
-c           | angle of less than arcCOS(0.717)      |
-c           %---------------------------------------%
-c
-            rnorm = rnorm1
-c 
-         else
-c
-c           %-------------------------------------------%
-c           | Another step of iterative refinement step |
-c           | is required. NITREF is used by stat.h     |
-c           %-------------------------------------------%
-c
-            nitref = nitref + 1
-            rnorm  = rnorm1
-            iter   = iter + 1
-            if (iter .le. 1) go to 80
-c
-c           %-------------------------------------------------%
-c           | Otherwise RESID is numerically in the span of V |
-c           %-------------------------------------------------%
-c
-            do 95 jj = 1, n
-               resid(jj) = zero
-  95        continue
-            rnorm = zero
-         end if
-c 
-c        %----------------------------------------------%
-c        | Branch here directly if iterative refinement |
-c        | wasn't necessary or after at most NITER_REF  |
-c        | steps of iterative refinement.               |
-c        %----------------------------------------------%
-c 
-  100    continue
-c 
-         rstart = .false.
-         orth2  = .false.
-c 
-         call igraphsecond (t5)
-         titref = titref + (t5 - t4)
-c 
-c        %------------------------------------%
-c        | STEP 6: Update  j = j+1;  Continue |
-c        %------------------------------------%
-c
-         j = j + 1
-         if (j .gt. k+np) then
-            call igraphsecond (t1)
-            tnaitr = tnaitr + (t1 - t0)
-            ido = 99
-            do 110 i = max(1,k), k+np-1
-c     
-c              %--------------------------------------------%
-c              | Check for splitting and deflation.         |
-c              | Use a standard test as in the QR algorithm |
-c              | REFERENCE: LAPACK subroutine dlahqr        |
-c              %--------------------------------------------%
-c     
-               tst1 = abs( h( i, i ) ) + abs( h( i+1, i+1 ) )
-               if( tst1.eq.zero )
-     &              tst1 = dlanhs( '1', k+np, h, ldh, workd(n+1) )
-               if( abs( h( i+1,i ) ).le.max( ulp*tst1, smlnum ) ) 
-     &              h(i+1,i) = zero
- 110        continue
-c     
-            if (msglvl .gt. 2) then
-               call igraphdmout (logfil, k+np, k+np, h, ldh, ndigit, 
-     &          '_naitr: Final upper Hessenberg matrix H of order K+NP')
-            end if
-c     
-            go to 9000
-         end if
-c
-c        %--------------------------------------------------------%
-c        | Loop back to extend the factorization by another step. |
-c        %--------------------------------------------------------%
-c
-      go to 1000
-c 
-c     %---------------------------------------------------------------%
-c     |                                                               |
-c     |  E N D     O F     M A I N     I T E R A T I O N     L O O P  |
-c     |                                                               |
-c     %---------------------------------------------------------------%
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdnaitr |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dnapps.f igraph-0.6.5/interfaces/R/arpack/dnapps.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dnapps.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dnapps.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,647 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdnapps
-c
-c\Description:
-c  Given the Arnoldi factorization
-c
-c     A*V_{k} - V_{k}*H_{k} = r_{k+p}*e_{k+p}^T,
-c
-c  apply NP implicit shifts resulting in
-c
-c     A*(V_{k}*Q) - (V_{k}*Q)*(Q^T* H_{k}*Q) = r_{k+p}*e_{k+p}^T * Q
-c
-c  where Q is an orthogonal matrix which is the product of rotations
-c  and reflections resulting from the NP bulge chage sweeps.
-c  The updated Arnoldi factorization becomes:
-c
-c     A*VNEW_{k} - VNEW_{k}*HNEW_{k} = rnew_{k}*e_{k}^T.
-c
-c\Usage:
-c  call igraphdnapps
-c     ( N, KEV, NP, SHIFTR, SHIFTI, V, LDV, H, LDH, RESID, Q, LDQ, 
-c       WORKL, WORKD )
-c
-c\Arguments
-c  N       Integer.  (INPUT)
-c          Problem size, i.e. size of matrix A.
-c
-c  KEV     Integer.  (INPUT/OUTPUT)
-c          KEV+NP is the size of the input matrix H.
-c          KEV is the size of the updated matrix HNEW.  KEV is only 
-c          updated on ouput when fewer than NP shifts are applied in
-c          order to keep the conjugate pair together.
-c
-c  NP      Integer.  (INPUT)
-c          Number of implicit shifts to be applied.
-c
-c  SHIFTR, Double precision array of length NP.  (INPUT)
-c  SHIFTI  Real and imaginary part of the shifts to be applied.
-c          Upon, entry to igraphdnapps, the shifts must be sorted so that the 
-c          conjugate pairs are in consecutive locations.
-c
-c  V       Double precision N by (KEV+NP) array.  (INPUT/OUTPUT)
-c          On INPUT, V contains the current KEV+NP Arnoldi vectors.
-c          On OUTPUT, V contains the updated KEV Arnoldi vectors
-c          in the first KEV columns of V.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling
-c          program.
-c
-c  H       Double precision (KEV+NP) by (KEV+NP) array.  (INPUT/OUTPUT)
-c          On INPUT, H contains the current KEV+NP by KEV+NP upper 
-c          Hessenber matrix of the Arnoldi factorization.
-c          On OUTPUT, H contains the updated KEV by KEV upper Hessenberg
-c          matrix in the KEV leading submatrix.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling
-c          program.
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          On INPUT, RESID contains the the residual vector r_{k+p}.
-c          On OUTPUT, RESID is the update residual vector rnew_{k} 
-c          in the first KEV locations.
-c
-c  Q       Double precision KEV+NP by KEV+NP work array.  (WORKSPACE)
-c          Work array used to accumulate the rotations and reflections
-c          during the bulge chase sweep.
-c
-c  LDQ     Integer.  (INPUT)
-c          Leading dimension of Q exactly as declared in the calling
-c          program.
-c
-c  WORKL   Double precision work array of length (KEV+NP).  (WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.
-c
-c  WORKD   Double precision work array of length 2*N.  (WORKSPACE)
-c          Distributed array used in the application of the accumulated
-c          orthogonal matrix Q.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c
-c\Routines called:
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdmout   ARPACK utility routine that prints matrices.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlabad  LAPACK routine that computes machine constants.
-c     dlacpy  LAPACK matrix copy routine.
-c     dlamch  LAPACK routine that determines machine constants. 
-c     dlanhs  LAPACK routine that computes various norms of a matrix.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c     dlarf   LAPACK routine that applies Householder reflection to
-c             a matrix.
-c     dlarfg  LAPACK Householder reflection construction routine.
-c     dlartg  LAPACK Givens rotation construction routine.
-c     dlaset  LAPACK matrix initialization routine.
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     daxpy   Level 1 BLAS that computes a vector triad.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     dscal   Level 1 BLAS that scales a vector.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: napps.F   SID: 2.3   DATE OF SID: 4/20/96   RELEASE: 2
-c
-c\Remarks
-c  1. In this version, each shift is applied to all the sublocks of
-c     the Hessenberg matrix H and not just to the submatrix that it
-c     comes from. Deflation as in LAPACK routine dlahqr (QR algorithm
-c     for upper Hessenberg matrices ) is used.
-c     The subdiagonals of H are enforced to be non-negative.
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdnapps
-     &   ( n, kev, np, shiftr, shifti, v, ldv, h, ldh, resid, q, ldq, 
-     &     workl, workd )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    kev, ldh, ldq, ldv, n, np
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           h(ldh,kev+np), resid(n), shifti(np), shiftr(np), 
-     &           v(ldv,kev+np), q(ldq,kev+np), workd(2*n), workl(kev+np)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %------------------------%
-c     | Local Scalars & Arrays |
-c     %------------------------%
-c
-      integer    i, iend, ir, istart, j, jj, kplusp, msglvl, nr
-      logical    cconj, first
-      Double precision
-     &           c, f, g, h11, h12, h21, h22, h32, ovfl, r, s, sigmai, 
-     &           sigmar, smlnum, ulp, unfl, u(3), t, tau, tst1
-      save       first, ovfl, smlnum, ulp, unfl 
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   daxpy, dcopy, dscal, dlacpy, dlarfg, dlarf,
-     &           dlaset, dlabad, igraphsecond, dlartg
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlamch, dlanhs, dlapy2
-      external   dlamch, dlanhs, dlapy2
-c
-c     %----------------------%
-c     | Intrinsics Functions |
-c     %----------------------%
-c
-      intrinsic  abs, max, min
-c
-c     %----------------%
-c     | Data statments |
-c     %----------------%
-c
-      data       first / .true. /
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (first) then
-c
-c        %-----------------------------------------------%
-c        | Set machine-dependent constants for the       |
-c        | stopping criterion. If norm(H) <= sqrt(OVFL), |
-c        | overflow should not occur.                    |
-c        | REFERENCE: LAPACK subroutine dlahqr           |
-c        %-----------------------------------------------%
-c
-         unfl = dlamch( 'safe minimum' )
-         ovfl = one / unfl
-         call dlabad( unfl, ovfl )
-         ulp = dlamch( 'precision' )
-         smlnum = unfl*( n / ulp )
-         first = .false.
-      end if
-c
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------%
-c
-      call igraphsecond (t0)
-      msglvl = mnapps
-      kplusp = kev + np 
-c 
-c     %--------------------------------------------%
-c     | Initialize Q to the identity to accumulate |
-c     | the rotations and reflections              |
-c     %--------------------------------------------%
-c
-      call dlaset ('All', kplusp, kplusp, zero, one, q, ldq)
-c
-c     %----------------------------------------------%
-c     | Quick return if there are no shifts to apply |
-c     %----------------------------------------------%
-c
-      if (np .eq. 0) go to 9000
-c
-c     %----------------------------------------------%
-c     | Chase the bulge with the application of each |
-c     | implicit shift. Each shift is applied to the |
-c     | whole matrix including each block.           |
-c     %----------------------------------------------%
-c
-      cconj = .false.
-      do 110 jj = 1, np
-         sigmar = shiftr(jj)
-         sigmai = shifti(jj)
-c
-         if (msglvl .gt. 2 ) then
-            call igraphivout (logfil, 1, jj, ndigit, 
-     &               '_napps: shift number.')
-            call igraphdvout (logfil, 1, sigmar, ndigit, 
-     &               '_napps: The real part of the shift ')
-            call igraphdvout (logfil, 1, sigmai, ndigit, 
-     &               '_napps: The imaginary part of the shift ')
-         end if
-c
-c        %-------------------------------------------------%
-c        | The following set of conditionals is necessary  |
-c        | in order that complex conjugate pairs of shifts |
-c        | are applied together or not at all.             |
-c        %-------------------------------------------------%
-c
-         if ( cconj ) then
-c
-c           %-----------------------------------------%
-c           | cconj = .true. means the previous shift |
-c           | had non-zero imaginary part.            |
-c           %-----------------------------------------%
-c
-            cconj = .false.
-            go to 110
-         else if ( jj .lt. np .and. abs( sigmai ) .gt. zero ) then
-c
-c           %------------------------------------%
-c           | Start of a complex conjugate pair. |
-c           %------------------------------------%
-c
-            cconj = .true.
-         else if ( jj .eq. np .and. abs( sigmai ) .gt. zero ) then
-c
-c           %----------------------------------------------%
-c           | The last shift has a nonzero imaginary part. |
-c           | Don't apply it; thus the order of the        |
-c           | compressed H is order KEV+1 since only np-1  |
-c           | were applied.                                |
-c           %----------------------------------------------%
-c
-            kev = kev + 1
-            go to 110
-         end if
-         istart = 1
-   20    continue
-c
-c        %--------------------------------------------------%
-c        | if sigmai = 0 then                               |
-c        |    Apply the jj-th shift ...                     |
-c        | else                                             |
-c        |    Apply the jj-th and (jj+1)-th together ...    |
-c        |    (Note that jj < np at this point in the code) |
-c        | end                                              |
-c        | to the current block of H. The next do loop      |
-c        | determines the current block ;                   |
-c        %--------------------------------------------------%
-c
-         do 30 i = istart, kplusp-1
-c
-c           %----------------------------------------%
-c           | Check for splitting and deflation. Use |
-c           | a standard test as in the QR algorithm |
-c           | REFERENCE: LAPACK subroutine dlahqr    |
-c           %----------------------------------------%
-c
-            tst1 = abs( h( i, i ) ) + abs( h( i+1, i+1 ) )
-            if( tst1.eq.zero )
-     &         tst1 = dlanhs( '1', kplusp-jj+1, h, ldh, workl )
-            if( abs( h( i+1,i ) ).le.max( ulp*tst1, smlnum ) ) then
-               if (msglvl .gt. 0) then
-                  call igraphivout (logfil, 1, i, ndigit, 
-     &                 '_napps: matrix splitting at row/column no.')
-                  call igraphivout (logfil, 1, jj, ndigit, 
-     &                 '_napps: matrix splitting with shift number.')
-                  call igraphdvout (logfil, 1, h(i+1,i), ndigit, 
-     &                 '_napps: off diagonal element.')
-               end if
-               iend = i
-               h(i+1,i) = zero
-               go to 40
-            end if
-   30    continue
-         iend = kplusp
-   40    continue
-c
-         if (msglvl .gt. 2) then
-             call igraphivout (logfil, 1, istart, ndigit, 
-     &                   '_napps: Start of current block ')
-             call igraphivout (logfil, 1, iend, ndigit, 
-     &                   '_napps: End of current block ')
-         end if
-c
-c        %------------------------------------------------%
-c        | No reason to apply a shift to block of order 1 |
-c        %------------------------------------------------%
-c
-         if ( istart .eq. iend ) go to 100
-c
-c        %------------------------------------------------------%
-c        | If istart + 1 = iend then no reason to apply a       |
-c        | complex conjugate pair of shifts on a 2 by 2 matrix. |
-c        %------------------------------------------------------%
-c
-         if ( istart + 1 .eq. iend .and. abs( sigmai ) .gt. zero ) 
-     &      go to 100
-c
-         h11 = h(istart,istart)
-         h21 = h(istart+1,istart)
-         if ( abs( sigmai ) .le. zero ) then
-c
-c           %---------------------------------------------%
-c           | Real-valued shift ==> apply single shift QR |
-c           %---------------------------------------------%
-c
-            f = h11 - sigmar
-            g = h21
-c 
-            do 80 i = istart, iend-1
-c
-c              %-----------------------------------------------------%
-c              | Contruct the plane rotation G to zero out the bulge |
-c              %-----------------------------------------------------%
-c
-               call dlartg (f, g, c, s, r)
-               if (i .gt. istart) then
-c
-c                 %-------------------------------------------%
-c                 | The following ensures that h(1:iend-1,1), |
-c                 | the first iend-2 off diagonal of elements |
-c                 | H, remain non negative.                   |
-c                 %-------------------------------------------%
-c
-                  if (r .lt. zero) then
-                     r = -r
-                     c = -c
-                     s = -s
-                  end if
-                  h(i,i-1) = r
-                  h(i+1,i-1) = zero
-               end if
-c
-c              %---------------------------------------------%
-c              | Apply rotation to the left of H;  H <- G'*H |
-c              %---------------------------------------------%
-c
-               do 50 j = i, kplusp
-                  t        =  c*h(i,j) + s*h(i+1,j)
-                  h(i+1,j) = -s*h(i,j) + c*h(i+1,j)
-                  h(i,j)   = t   
-   50          continue
-c
-c              %---------------------------------------------%
-c              | Apply rotation to the right of H;  H <- H*G |
-c              %---------------------------------------------%
-c
-               do 60 j = 1, min(i+2,iend)
-                  t        =  c*h(j,i) + s*h(j,i+1)
-                  h(j,i+1) = -s*h(j,i) + c*h(j,i+1)
-                  h(j,i)   = t   
-   60          continue
-c
-c              %----------------------------------------------------%
-c              | Accumulate the rotation in the matrix Q;  Q <- Q*G |
-c              %----------------------------------------------------%
-c
-               do 70 j = 1, min( j+jj, kplusp ) 
-                  t        =   c*q(j,i) + s*q(j,i+1)
-                  q(j,i+1) = - s*q(j,i) + c*q(j,i+1)
-                  q(j,i)   = t   
-   70          continue
-c
-c              %---------------------------%
-c              | Prepare for next rotation |
-c              %---------------------------%
-c
-               if (i .lt. iend-1) then
-                  f = h(i+1,i)
-                  g = h(i+2,i)
-               end if
-   80       continue
-c
-c           %-----------------------------------%
-c           | Finished applying the real shift. |
-c           %-----------------------------------%
-c 
-         else
-c
-c           %----------------------------------------------------%
-c           | Complex conjugate shifts ==> apply double shift QR |
-c           %----------------------------------------------------%
-c
-            h12 = h(istart,istart+1)
-            h22 = h(istart+1,istart+1)
-            h32 = h(istart+2,istart+1)
-c
-c           %---------------------------------------------------------%
-c           | Compute 1st column of (H - shift*I)*(H - conj(shift)*I) |
-c           %---------------------------------------------------------%
-c
-            s    = 2.0*sigmar
-            t = dlapy2 ( sigmar, sigmai ) 
-            u(1) = ( h11 * (h11 - s) + t * t ) / h21 + h12
-            u(2) = h11 + h22 - s 
-            u(3) = h32
-c
-            do 90 i = istart, iend-1
-c
-               nr = min ( 3, iend-i+1 )
-c
-c              %-----------------------------------------------------%
-c              | Construct Householder reflector G to zero out u(1). |
-c              | G is of the form I - tau*( 1 u )' * ( 1 u' ).       |
-c              %-----------------------------------------------------%
-c
-               call dlarfg ( nr, u(1), u(2), 1, tau )
-c
-               if (i .gt. istart) then
-                  h(i,i-1)   = u(1)
-                  h(i+1,i-1) = zero
-                  if (i .lt. iend-1) h(i+2,i-1) = zero
-               end if
-               u(1) = one
-c
-c              %--------------------------------------%
-c              | Apply the reflector to the left of H |
-c              %--------------------------------------%
-c
-               call dlarf ('Left', nr, kplusp-i+1, u, 1, tau,
-     &                     h(i,i), ldh, workl)
-c
-c              %---------------------------------------%
-c              | Apply the reflector to the right of H |
-c              %---------------------------------------%
-c
-               ir = min ( i+3, iend )
-               call dlarf ('Right', ir, nr, u, 1, tau,
-     &                     h(1,i), ldh, workl)
-c
-c              %-----------------------------------------------------%
-c              | Accumulate the reflector in the matrix Q;  Q <- Q*G |
-c              %-----------------------------------------------------%
-c
-               call dlarf ('Right', kplusp, nr, u, 1, tau, 
-     &                     q(1,i), ldq, workl)
-c
-c              %----------------------------%
-c              | Prepare for next reflector |
-c              %----------------------------%
-c
-               if (i .lt. iend-1) then
-                  u(1) = h(i+1,i)
-                  u(2) = h(i+2,i)
-                  if (i .lt. iend-2) u(3) = h(i+3,i)
-               end if
-c
-   90       continue
-c
-c           %--------------------------------------------%
-c           | Finished applying a complex pair of shifts |
-c           | to the current block                       |
-c           %--------------------------------------------%
-c 
-         end if
-c
-  100    continue
-c
-c        %---------------------------------------------------------%
-c        | Apply the same shift to the next block if there is any. |
-c        %---------------------------------------------------------%
-c
-         istart = iend + 1
-         if (iend .lt. kplusp) go to 20
-c
-c        %---------------------------------------------%
-c        | Loop back to the top to get the next shift. |
-c        %---------------------------------------------%
-c
-  110 continue
-c
-c     %--------------------------------------------------%
-c     | Perform a similarity transformation that makes   |
-c     | sure that H will have non negative sub diagonals |
-c     %--------------------------------------------------%
-c
-      do 120 j=1,kev
-         if ( h(j+1,j) .lt. zero ) then
-              call dscal( kplusp-j+1, -one, h(j+1,j), ldh )
-              call dscal( min(j+2, kplusp), -one, h(1,j+1), 1 )
-              call dscal( min(j+np+1,kplusp), -one, q(1,j+1), 1 )
-         end if
- 120  continue
-c
-      do 130 i = 1, kev
-c
-c        %--------------------------------------------%
-c        | Final check for splitting and deflation.   |
-c        | Use a standard test as in the QR algorithm |
-c        | REFERENCE: LAPACK subroutine dlahqr        |
-c        %--------------------------------------------%
-c
-         tst1 = abs( h( i, i ) ) + abs( h( i+1, i+1 ) )
-         if( tst1.eq.zero )
-     &       tst1 = dlanhs( '1', kev, h, ldh, workl )
-         if( h( i+1,i ) .le. max( ulp*tst1, smlnum ) ) 
-     &       h(i+1,i) = zero
- 130  continue
-c
-c     %-------------------------------------------------%
-c     | Compute the (kev+1)-st column of (V*Q) and      |
-c     | temporarily store the result in WORKD(N+1:2*N). |
-c     | This is needed in the residual update since we  |
-c     | cannot GUARANTEE that the corresponding entry   |
-c     | of H would be zero as in exact arithmetic.      |
-c     %-------------------------------------------------%
-c
-      if (h(kev+1,kev) .gt. zero)
-     &    call dgemv ('N', n, kplusp, one, v, ldv, q(1,kev+1), 1, zero, 
-     &                workd(n+1), 1)
-c 
-c     %----------------------------------------------------------%
-c     | Compute column 1 to kev of (V*Q) in backward order       |
-c     | taking advantage of the upper Hessenberg structure of Q. |
-c     %----------------------------------------------------------%
-c
-      do 140 i = 1, kev
-         call dgemv ('N', n, kplusp-i+1, one, v, ldv,
-     &               q(1,kev-i+1), 1, zero, workd, 1)
-         call dcopy (n, workd, 1, v(1,kplusp-i+1), 1)
-  140 continue
-c
-c     %-------------------------------------------------%
-c     |  Move v(:,kplusp-kev+1:kplusp) into v(:,1:kev). |
-c     %-------------------------------------------------%
-c
-      call dlacpy ('A', n, kev, v(1,kplusp-kev+1), ldv, v, ldv)
-c 
-c     %--------------------------------------------------------------%
-c     | Copy the (kev+1)-st column of (V*Q) in the appropriate place |
-c     %--------------------------------------------------------------%
-c
-      if (h(kev+1,kev) .gt. zero)
-     &   call dcopy (n, workd(n+1), 1, v(1,kev+1), 1)
-c 
-c     %-------------------------------------%
-c     | Update the residual vector:         |
-c     |    r <- sigmak*r + betak*v(:,kev+1) |
-c     | where                               |
-c     |    sigmak = (e_{kplusp}'*Q)*e_{kev} |
-c     |    betak = e_{kev+1}'*H*e_{kev}     |
-c     %-------------------------------------%
-c
-      call dscal (n, q(kplusp,kev), resid, 1)
-      if (h(kev+1,kev) .gt. zero)
-     &   call daxpy (n, h(kev+1,kev), v(1,kev+1), 1, resid, 1)
-c
-      if (msglvl .gt. 1) then
-         call igraphdvout (logfil, 1, q(kplusp,kev), ndigit,
-     &        '_napps: sigmak = (e_{kev+p}^T*Q)*e_{kev}')
-         call igraphdvout (logfil, 1, h(kev+1,kev), ndigit,
-     &        '_napps: betak = e_{kev+1}^T*H*e_{kev}')
-         call igraphivout (logfil, 1, kev, ndigit, 
-     &               '_napps: Order of the final Hessenberg matrix ')
-         if (msglvl .gt. 2) then
-            call igraphdmout (logfil, kev, kev, h, ldh, ndigit,
-     &      '_napps: updated Hessenberg matrix H for next iteration')
-         end if
-c
-      end if
-c 
- 9000 continue
-      call igraphsecond (t1)
-      tnapps = tnapps + (t1 - t0)
-c 
-      return
-c
-c     %---------------%
-c     | End of igraphdnapps |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dnaup2.f igraph-0.6.5/interfaces/R/arpack/dnaup2.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dnaup2.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dnaup2.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,838 +0,0 @@
-c\BeginDoc
-c
-c\Name: igraphdnaup2
-c
-c\Description: 
-c  Intermediate level interface called by igraphdnaupd.
-c
-c\Usage:
-c  call igraphdnaup2
-c     ( IDO, BMAT, N, WHICH, NEV, NP, TOL, RESID, MODE, IUPD,
-c       ISHIFT, MXITER, V, LDV, H, LDH, RITZR, RITZI, BOUNDS, 
-c       Q, LDQ, WORKL, IPNTR, WORKD, INFO )
-c
-c\Arguments
-c
-c  IDO, BMAT, N, WHICH, NEV, TOL, RESID: same as defined in igraphdnaupd.
-c  MODE, ISHIFT, MXITER: see the definition of IPARAM in igraphdnaupd.
-c
-c  NP      Integer.  (INPUT/OUTPUT)
-c          Contains the number of implicit shifts to apply during 
-c          each Arnoldi iteration.  
-c          If ISHIFT=1, NP is adjusted dynamically at each iteration 
-c          to accelerate convergence and prevent stagnation.
-c          This is also roughly equal to the number of matrix-vector 
-c          products (involving the operator OP) per Arnoldi iteration.
-c          The logic for adjusting is contained within the current
-c          subroutine.
-c          If ISHIFT=0, NP is the number of shifts the user needs
-c          to provide via reverse comunication. 0 < NP < NCV-NEV.
-c          NP may be less than NCV-NEV for two reasons. The first, is
-c          to keep complex conjugate pairs of "wanted" Ritz values 
-c          together. The igraphsecond, is that a leading block of the current
-c          upper Hessenberg matrix has split off and contains "unwanted"
-c          Ritz values.
-c          Upon termination of the IRA iteration, NP contains the number 
-c          of "converged" wanted Ritz values.
-c
-c  IUPD    Integer.  (INPUT)
-c          IUPD .EQ. 0: use explicit restart instead implicit update.
-c          IUPD .NE. 0: use implicit update.
-c
-c  V       Double precision N by (NEV+NP) array.  (INPUT/OUTPUT)
-c          The Arnoldi basis vectors are returned in the first NEV 
-c          columns of V.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling 
-c          program.
-c
-c  H       Double precision (NEV+NP) by (NEV+NP) array.  (OUTPUT)
-c          H is used to store the generated upper Hessenberg matrix
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling 
-c          program.
-c
-c  RITZR,  Double precision arrays of length NEV+NP.  (OUTPUT)
-c  RITZI   RITZR(1:NEV) (resp. RITZI(1:NEV)) contains the real (resp.
-c          imaginary) part of the computed Ritz values of OP.
-c
-c  BOUNDS  Double precision array of length NEV+NP.  (OUTPUT)
-c          BOUNDS(1:NEV) contain the error bounds corresponding to 
-c          the computed Ritz values.
-c          
-c  Q       Double precision (NEV+NP) by (NEV+NP) array.  (WORKSPACE)
-c          Private (replicated) work array used to accumulate the
-c          rotation in the shift application step.
-c
-c  LDQ     Integer.  (INPUT)
-c          Leading dimension of Q exactly as declared in the calling
-c          program.
-c
-c  WORKL   Double precision work array of length at least 
-c          (NEV+NP)**2 + 3*(NEV+NP).  (INPUT/WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.  It is used in shifts calculation, shifts
-c          application and convergence checking.
-c
-c          On exit, the last 3*(NEV+NP) locations of WORKL contain
-c          the Ritz values (real,imaginary) and associated Ritz
-c          estimates of the current Hessenberg matrix.  They are
-c          listed in the same order as returned from igraphdneigh.
-c
-c          If ISHIFT .EQ. O and IDO .EQ. 3, the first 2*NP locations
-c          of WORKL are used in reverse communication to hold the user 
-c          supplied shifts.
-c
-c  IPNTR   Integer array of length 3.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORKD for 
-c          vectors used by the Arnoldi iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X.
-c          IPNTR(2): pointer to the current result vector Y.
-c          IPNTR(3): pointer to the vector B * X when used in the 
-c                    shift-and-invert mode.  X is the current operand.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (WORKSPACE)
-c          Distributed array to be used in the basic Arnoldi iteration
-c          for reverse communication.  The user should not use WORKD
-c          as temporary workspace during the iteration !!!!!!!!!!
-c          See Data Distribution Note in DNAUPD.
-c
-c  INFO    Integer.  (INPUT/OUTPUT)
-c          If INFO .EQ. 0, a randomly initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          Error flag on output.
-c          =     0: Normal return.
-c          =     1: Maximum number of iterations taken.
-c                   All possible eigenvalues of OP has been found.  
-c                   NP returns the number of converged Ritz values.
-c          =     2: No shifts could be applied.
-c          =    -8: Error return from LAPACK eigenvalue calculation;
-c                   This should never happen.
-c          =    -9: Starting vector is zero.
-c          = -9999: Could not build an Arnoldi factorization.
-c                   Size that was built in returned in NP.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c
-c\Routines called:
-c     igraphdgetv0  ARPACK initial vector generation routine. 
-c     igraphdnaitr  ARPACK Arnoldi factorization routine.
-c     igraphdnapps  ARPACK application of implicit shifts routine.
-c     igraphdnconv  ARPACK convergence of Ritz values routine.
-c     igraphdneigh  ARPACK compute Ritz values and error bounds routine.
-c     igraphdngets  ARPACK reorder Ritz values and error bounds routine.
-c     igraphdsortc  ARPACK sorting routine.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdmout   ARPACK utility routine that prints matrices
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors. 
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c     dswap   Level 1 BLAS that swaps two vectors.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c 
-c\SCCS Information: @(#) 
-c FILE: naup2.F   SID: 2.4   DATE OF SID: 7/30/96   RELEASE: 2
-c
-c\Remarks
-c     1. None
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdnaup2
-     &   ( ido, bmat, n, which, nev, np, tol, resid, mode, iupd, 
-     &     ishift, mxiter, v, ldv, h, ldh, ritzr, ritzi, bounds, 
-     &     q, ldq, workl, ipntr, workd, info )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1, which*2
-      integer    ido, info, ishift, iupd, mode, ldh, ldq, ldv, mxiter,
-     &           n, nev, np
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    ipntr(13)
-      Double precision
-     &           bounds(nev+np), h(ldh,nev+np), q(ldq,nev+np), resid(n),
-     &           ritzi(nev+np), ritzr(nev+np), v(ldv,nev+np), 
-     &           workd(3*n), workl( (nev+np)*(nev+np+3) )
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      character  wprime*2
-      logical    cnorm, getv0, initv, update, ushift
-      integer    ierr, iter, j, kplusp, msglvl, nconv, nevbef, nev0, 
-     &           np0, nptemp, numcnv
-      Double precision
-     &           rnorm, temp, eps23
-c
-c     %-----------------------%
-c     | Local array arguments |
-c     %-----------------------%
-c
-      integer    kp(4)
-      save
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, igraphdgetv0, igraphdnaitr, igraphdnconv, 
-     &     igraphdneigh, igraphdngets, igraphdnapps,
-     &     igraphdvout, igraphivout, igraphsecond
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           ddot, dnrm2, dlapy2, dlamch
-      external   ddot, dnrm2, dlapy2, dlamch
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    min, max, abs, sqrt
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (ido .eq. 0) then
-c 
-         call igraphsecond (t0)
-c 
-         msglvl = mnaup2
-c 
-c        %-------------------------------------%
-c        | Get the machine dependent constant. |
-c        %-------------------------------------%
-c
-         eps23 = dlamch('Epsilon-Machine')
-         eps23 = eps23**(2.0D+0 / 3.0D+0)
-c
-         nev0   = nev
-         np0    = np
-c
-c        %-------------------------------------%
-c        | kplusp is the bound on the largest  |
-c        |        Lanczos factorization built. |
-c        | nconv is the current number of      |
-c        |        "converged" eigenvlues.      |
-c        | iter is the counter on the current  |
-c        |      iteration step.                |
-c        %-------------------------------------%
-c
-         kplusp = nev + np
-         nconv  = 0
-         iter   = 0
-c 
-c        %---------------------------------------%
-c        | Set flags for computing the first NEV |
-c        | steps of the Arnoldi factorization.   |
-c        %---------------------------------------%
-c
-         getv0    = .true.
-         update   = .false.
-         ushift   = .false.
-         cnorm    = .false.
-c
-         if (info .ne. 0) then
-c
-c           %--------------------------------------------%
-c           | User provides the initial residual vector. |
-c           %--------------------------------------------%
-c
-            initv = .true.
-            info  = 0
-         else
-            initv = .false.
-         end if
-      end if
-c 
-c     %---------------------------------------------%
-c     | Get a possibly random starting vector and   |
-c     | force it into the range of the operator OP. |
-c     %---------------------------------------------%
-c
-   10 continue
-c
-      if (getv0) then
-         call igraphdgetv0 (ido, bmat, 1, initv, n, 1, v, ldv, resid,
-     &        rnorm, ipntr, workd, info)
-c
-         if (ido .ne. 99) go to 9000
-c
-         if (rnorm .eq. zero) then
-c
-c           %-----------------------------------------%
-c           | The initial vector is zero. Error exit. | 
-c           %-----------------------------------------%
-c
-            info = -9
-            go to 1100
-         end if
-         getv0 = .false.
-         ido  = 0
-      end if
-c 
-c     %-----------------------------------%
-c     | Back from reverse communication : |
-c     | continue with update step         |
-c     %-----------------------------------%
-c
-      if (update) go to 20
-c
-c     %-------------------------------------------%
-c     | Back from computing user specified shifts |
-c     %-------------------------------------------%
-c
-      if (ushift) go to 50
-c
-c     %-------------------------------------%
-c     | Back from computing residual norm   |
-c     | at the end of the current iteration |
-c     %-------------------------------------%
-c
-      if (cnorm)  go to 100
-c 
-c     %----------------------------------------------------------%
-c     | Compute the first NEV steps of the Arnoldi factorization |
-c     %----------------------------------------------------------%
-c
-      call igraphdnaitr (ido, bmat, n, 0, nev, mode, resid, rnorm, v,
-     &     ldv, h, ldh, ipntr, workd, info)
-c 
-c     %---------------------------------------------------%
-c     | ido .ne. 99 implies use of reverse communication  |
-c     | to compute operations involving OP and possibly B |
-c     %---------------------------------------------------%
-c
-      if (ido .ne. 99) go to 9000
-c
-      if (info .gt. 0) then
-         np   = info
-         mxiter = iter
-         info = -9999
-         go to 1200
-      end if
-c 
-c     %--------------------------------------------------------------%
-c     |                                                              |
-c     |           M A I N  ARNOLDI  I T E R A T I O N  L O O P       |
-c     |           Each iteration implicitly restarts the Arnoldi     |
-c     |           factorization in place.                            |
-c     |                                                              |
-c     %--------------------------------------------------------------%
-c 
- 1000 continue
-c
-         iter = iter + 1
-c
-         if (msglvl .gt. 0) then
-            call igraphivout (logfil, 1, iter, ndigit, 
-     &           '_naup2: **** Start of major iteration number ****')
-         end if
-c 
-c        %-----------------------------------------------------------%
-c        | Compute NP additional steps of the Arnoldi factorization. |
-c        | Adjust NP since NEV might have been updated by last call  |
-c        | to the shift application routine igraphdnapps.                  |
-c        %-----------------------------------------------------------%
-c
-         np  = kplusp - nev
-c
-         if (msglvl .gt. 1) then
-            call igraphivout (logfil, 1, nev, ndigit, 
-     &     '_naup2: The length of the current Arnoldi factorization')
-            call igraphivout (logfil, 1, np, ndigit, 
-     &           '_naup2: Extend the Arnoldi factorization by')
-         end if
-c
-c        %-----------------------------------------------------------%
-c        | Compute NP additional steps of the Arnoldi factorization. |
-c        %-----------------------------------------------------------%
-c
-         ido = 0
-   20    continue
-         update = .true.
-c
-         call igraphdnaitr (ido, bmat, n, nev, np, mode, resid, rnorm,
-     &        v, ldv, h, ldh, ipntr, workd, info)
-c 
-c        %---------------------------------------------------%
-c        | ido .ne. 99 implies use of reverse communication  |
-c        | to compute operations involving OP and possibly B |
-c        %---------------------------------------------------%
-c
-         if (ido .ne. 99) go to 9000
-c
-         if (info .gt. 0) then
-            np = info
-            mxiter = iter
-            info = -9999
-            go to 1200
-         end if
-         update = .false.
-c
-         if (msglvl .gt. 1) then
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &           '_naup2: Corresponding B-norm of the residual')
-         end if
-c 
-c        %--------------------------------------------------------%
-c        | Compute the eigenvalues and corresponding error bounds |
-c        | of the current upper Hessenberg matrix.                |
-c        %--------------------------------------------------------%
-c
-         call igraphdneigh (rnorm, kplusp, h, ldh, ritzr, ritzi, bounds,
-     &                q, ldq, workl, ierr)
-c
-         if (ierr .ne. 0) then
-            info = -8
-            go to 1200
-         end if
-c
-c        %----------------------------------------------------%
-c        | Make a copy of eigenvalues and corresponding error |
-c        | bounds obtained from igraphdneigh.                       |
-c        %----------------------------------------------------%
-c
-         call dcopy(kplusp, ritzr, 1, workl(kplusp**2+1), 1)
-         call dcopy(kplusp, ritzi, 1, workl(kplusp**2+kplusp+1), 1)
-         call dcopy(kplusp, bounds, 1, workl(kplusp**2+2*kplusp+1), 1)
-c
-c        %---------------------------------------------------%
-c        | Select the wanted Ritz values and their bounds    |
-c        | to be used in the convergence test.               |
-c        | The wanted part of the spectrum and corresponding |
-c        | error bounds are in the last NEV loc. of RITZR,   |
-c        | RITZI and BOUNDS respectively. The variables NEV  |
-c        | and NP may be updated if the NEV-th wanted Ritz   |
-c        | value has a non zero imaginary part. In this case |
-c        | NEV is increased by one and NP decreased by one.  |
-c        | NOTE: The last two arguments of igraphdngets are no     |
-c        | longer used as of version 2.1.                    |
-c        %---------------------------------------------------%
-c
-         nev = nev0
-         np = np0
-         numcnv = nev
-         call igraphdngets (ishift, which, nev, np, ritzr, ritzi, 
-     &                bounds, workl, workl(np+1))
-         if (nev .eq. nev0+1) numcnv = nev0+1
-c 
-c        %-------------------%
-c        | Convergence test. | 
-c        %-------------------%
-c
-         call dcopy (nev, bounds(np+1), 1, workl(2*np+1), 1)
-         call igraphdnconv (nev, ritzr(np+1), ritzi(np+1), 
-     &        workl(2*np+1), tol, nconv)
-c 
-         if (msglvl .gt. 2) then
-            kp(1) = nev
-            kp(2) = np
-            kp(3) = numcnv
-            kp(4) = nconv
-            call igraphivout (logfil, 4, kp, ndigit, 
-     &                  '_naup2: NEV, NP, NUMCNV, NCONV are')
-            call igraphdvout (logfil, kplusp, ritzr, ndigit,
-     &           '_naup2: Real part of the eigenvalues of H')
-            call igraphdvout (logfil, kplusp, ritzi, ndigit,
-     &           '_naup2: Imaginary part of the eigenvalues of H')
-            call igraphdvout (logfil, kplusp, bounds, ndigit, 
-     &          '_naup2: Ritz estimates of the current NCV Ritz values')
-         end if
-c
-c        %---------------------------------------------------------%
-c        | Count the number of unwanted Ritz values that have zero |
-c        | Ritz estimates. If any Ritz estimates are equal to zero |
-c        | then a leading block of H of order equal to at least    |
-c        | the number of Ritz values with zero Ritz estimates has  |
-c        | split off. None of these Ritz values may be removed by  |
-c        | shifting. Decrease NP the number of shifts to apply. If |
-c        | no shifts may be applied, then prepare to exit          |
-c        %---------------------------------------------------------%
-c
-         nptemp = np
-         do 30 j=1, nptemp
-            if (bounds(j) .eq. zero) then
-               np = np - 1
-               nev = nev + 1
-            end if
- 30      continue
-c     
-         if ( (nconv .ge. numcnv) .or. 
-     &        (iter .gt. mxiter) .or.
-     &        (np .eq. 0) ) then
-c
-            if (msglvl .gt. 4) then
-               call igraphdvout(logfil, kplusp, workl(kplusp**2+1), 
-     &              ndigit,
-     &             '_naup2: Real part of the eig computed by _neigh:')
-               call igraphdvout(logfil, kplusp, 
-     &                     workl(kplusp**2+kplusp+1), ndigit,
-     &             '_naup2: Imag part of the eig computed by _neigh:')
-               call igraphdvout(logfil, kplusp, 
-     &                     workl(kplusp**2+kplusp*2+1), ndigit,
-     &             '_naup2: Ritz eistmates computed by _neigh:')
-            end if
-c     
-c           %------------------------------------------------%
-c           | Prepare to exit. Put the converged Ritz values |
-c           | and corresponding bounds in RITZ(1:NCONV) and  |
-c           | BOUNDS(1:NCONV) respectively. Then sort. Be    |
-c           | careful when NCONV > NP                        |
-c           %------------------------------------------------%
-c
-c           %------------------------------------------%
-c           |  Use h( 3,1 ) as storage to communicate  |
-c           |  rnorm to _neupd if needed               |
-c           %------------------------------------------%
-
-            h(3,1) = rnorm
-c
-c           %----------------------------------------------%
-c           | To be consistent with igraphdngets, we first do a  |
-c           | pre-processing sort in order to keep complex |
-c           | conjugate pairs together.  This is similar   |
-c           | to the pre-processing sort used in igraphdngets    |
-c           | except that the sort is done in the opposite |
-c           | order.                                       |
-c           %----------------------------------------------%
-c
-            if (which .eq. 'LM') wprime = 'SR'
-            if (which .eq. 'SM') wprime = 'LR'
-            if (which .eq. 'LR') wprime = 'SM'
-            if (which .eq. 'SR') wprime = 'LM'
-            if (which .eq. 'LI') wprime = 'SM'
-            if (which .eq. 'SI') wprime = 'LM'
-c
-            call igraphdsortc (wprime, .true., kplusp, ritzr, ritzi, 
-     &           bounds)
-c
-c           %----------------------------------------------%
-c           | Now sort Ritz values so that converged Ritz  |
-c           | values appear within the first NEV locations |
-c           | of ritzr, ritzi and bounds, and the most     |
-c           | desired one appears at the front.            |
-c           %----------------------------------------------%
-c
-            if (which .eq. 'LM') wprime = 'SM'
-            if (which .eq. 'SM') wprime = 'LM'
-            if (which .eq. 'LR') wprime = 'SR'
-            if (which .eq. 'SR') wprime = 'LR'
-            if (which .eq. 'LI') wprime = 'SI'
-            if (which .eq. 'SI') wprime = 'LI'
-c
-            call igraphdsortc(wprime, .true., kplusp, ritzr, ritzi, 
-     &           bounds)
-c
-c           %--------------------------------------------------%
-c           | Scale the Ritz estimate of each Ritz value       |
-c           | by 1 / max(eps23,magnitude of the Ritz value).   |
-c           %--------------------------------------------------%
-c
-            do 35 j = 1, nev0
-                temp = max(eps23,dlapy2(ritzr(j),
-     &                                   ritzi(j)))
-                bounds(j) = bounds(j)/temp
- 35         continue
-c
-c           %----------------------------------------------------%
-c           | Sort the Ritz values according to the scaled Ritz  |
-c           | esitmates.  This will push all the converged ones  |
-c           | towards the front of ritzr, ritzi, bounds          |
-c           | (in the case when NCONV < NEV.)                    |
-c           %----------------------------------------------------%
-c
-            wprime = 'LR'
-            call igraphdsortc(wprime, .true., nev0, bounds, ritzr, 
-     &           ritzi)
-c
-c           %----------------------------------------------%
-c           | Scale the Ritz estimate back to its original |
-c           | value.                                       |
-c           %----------------------------------------------%
-c
-            do 40 j = 1, nev0
-                temp = max(eps23, dlapy2(ritzr(j),
-     &                                   ritzi(j)))
-                bounds(j) = bounds(j)*temp
- 40         continue
-c
-c           %------------------------------------------------%
-c           | Sort the converged Ritz values again so that   |
-c           | the "threshold" value appears at the front of  |
-c           | ritzr, ritzi and bound.                        |
-c           %------------------------------------------------%
-c
-            call igraphdsortc(which, .true., nconv, ritzr, ritzi, 
-     &           bounds)
-c
-            if (msglvl .gt. 1) then
-               call igraphdvout (logfil, kplusp, ritzr, ndigit,
-     &            '_naup2: Sorted real part of the eigenvalues')
-               call igraphdvout (logfil, kplusp, ritzi, ndigit,
-     &            '_naup2: Sorted imaginary part of the eigenvalues')
-               call igraphdvout (logfil, kplusp, bounds, ndigit,
-     &            '_naup2: Sorted ritz estimates.')
-            end if
-c
-c           %------------------------------------%
-c           | Max iterations have been exceeded. | 
-c           %------------------------------------%
-c
-            if (iter .gt. mxiter .and. nconv .lt. numcnv) info = 1
-c
-c           %---------------------%
-c           | No shifts to apply. | 
-c           %---------------------%
-c
-            if (np .eq. 0 .and. nconv .lt. numcnv) info = 2
-c
-            np = nconv
-            go to 1100
-c
-         else if ( (nconv .lt. numcnv) .and. (ishift .eq. 1) ) then
-c     
-c           %-------------------------------------------------%
-c           | Do not have all the requested eigenvalues yet.  |
-c           | To prevent possible stagnation, adjust the size |
-c           | of NEV.                                         |
-c           %-------------------------------------------------%
-c
-            nevbef = nev
-            nev = nev + min(nconv, np/2)
-            if (nev .eq. 1 .and. kplusp .ge. 6) then
-               nev = kplusp / 2
-            else if (nev .eq. 1 .and. kplusp .gt. 3) then
-               nev = 2
-            end if
-            np = kplusp - nev
-c     
-c           %---------------------------------------%
-c           | If the size of NEV was just increased |
-c           | resort the eigenvalues.               |
-c           %---------------------------------------%
-c     
-            if (nevbef .lt. nev) 
-     &         call igraphdngets (ishift, which, nev, np, ritzr, ritzi, 
-     &              bounds, workl, workl(np+1))
-c
-         end if              
-c     
-         if (msglvl .gt. 0) then
-            call igraphivout (logfil, 1, nconv, ndigit, 
-     &           '_naup2: no. of "converged" Ritz values at this iter.')
-            if (msglvl .gt. 1) then
-               kp(1) = nev
-               kp(2) = np
-               call igraphivout (logfil, 2, kp, ndigit, 
-     &              '_naup2: NEV and NP are')
-               call igraphdvout (logfil, nev, ritzr(np+1), ndigit,
-     &              '_naup2: "wanted" Ritz values -- real part')
-               call igraphdvout (logfil, nev, ritzi(np+1), ndigit,
-     &              '_naup2: "wanted" Ritz values -- imag part')
-               call igraphdvout (logfil, nev, bounds(np+1), ndigit,
-     &              '_naup2: Ritz estimates of the "wanted" values ')
-            end if
-         end if
-c
-         if (ishift .eq. 0) then
-c
-c           %-------------------------------------------------------%
-c           | User specified shifts: reverse comminucation to       |
-c           | compute the shifts. They are returned in the first    |
-c           | 2*NP locations of WORKL.                              |
-c           %-------------------------------------------------------%
-c
-            ushift = .true.
-            ido = 3
-            go to 9000
-         end if
-c 
-   50    continue
-c
-c        %------------------------------------%
-c        | Back from reverse communication;   |
-c        | User specified shifts are returned |
-c        | in WORKL(1:2*NP)                   |
-c        %------------------------------------%
-c
-         ushift = .false.
-c
-         if ( ishift .eq. 0 ) then
-c 
-c            %----------------------------------%
-c            | Move the NP shifts from WORKL to |
-c            | RITZR, RITZI to free up WORKL    |
-c            | for non-exact shift case.        |
-c            %----------------------------------%
-c
-             call dcopy (np, workl,       1, ritzr, 1)
-             call dcopy (np, workl(np+1), 1, ritzi, 1)
-         end if
-c
-         if (msglvl .gt. 2) then 
-            call igraphivout (logfil, 1, np, ndigit, 
-     &                  '_naup2: The number of shifts to apply ')
-            call igraphdvout (logfil, np, ritzr, ndigit,
-     &                  '_naup2: Real part of the shifts')
-            call igraphdvout (logfil, np, ritzi, ndigit,
-     &                  '_naup2: Imaginary part of the shifts')
-            if ( ishift .eq. 1 ) 
-     &          call igraphdvout (logfil, np, bounds, ndigit,
-     &                  '_naup2: Ritz estimates of the shifts')
-         end if
-c
-c        %---------------------------------------------------------%
-c        | Apply the NP implicit shifts by QR bulge chasing.       |
-c        | Each shift is applied to the whole upper Hessenberg     |
-c        | matrix H.                                               |
-c        | The first 2*N locations of WORKD are used as workspace. |
-c        %---------------------------------------------------------%
-c
-         call igraphdnapps (n, nev, np, ritzr, ritzi, v, ldv, 
-     &                h, ldh, resid, q, ldq, workl, workd)
-c
-c        %---------------------------------------------%
-c        | Compute the B-norm of the updated residual. |
-c        | Keep B*RESID in WORKD(1:N) to be used in    |
-c        | the first step of the next call to igraphdnaitr.  |
-c        %---------------------------------------------%
-c
-         cnorm = .true.
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(n+1), 1)
-            ipntr(1) = n + 1
-            ipntr(2) = 1
-            ido = 2
-c 
-c           %----------------------------------%
-c           | Exit in order to compute B*RESID |
-c           %----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd, 1)
-         end if
-c 
-  100    continue
-c 
-c        %----------------------------------%
-c        | Back from reverse communication; |
-c        | WORKD(1:N) := B*RESID            |
-c        %----------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c 
-         if (bmat .eq. 'G') then         
-            rnorm = ddot (n, resid, 1, workd, 1)
-            rnorm = sqrt(abs(rnorm))
-         else if (bmat .eq. 'I') then
-            rnorm = dnrm2(n, resid, 1)
-         end if
-         cnorm = .false.
-c
-         if (msglvl .gt. 2) then
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &      '_naup2: B-norm of residual for compressed factorization')
-            call igraphdmout (logfil, nev, nev, h, ldh, ndigit,
-     &        '_naup2: Compressed upper Hessenberg matrix H')
-         end if
-c 
-      go to 1000
-c
-c     %---------------------------------------------------------------%
-c     |                                                               |
-c     |  E N D     O F     M A I N     I T E R A T I O N     L O O P  |
-c     |                                                               |
-c     %---------------------------------------------------------------%
-c
- 1100 continue
-c
-      mxiter = iter
-      nev = numcnv
-c     
- 1200 continue
-      ido = 99
-c
-c     %------------%
-c     | Error Exit |
-c     %------------%
-c
-      call igraphsecond (t1)
-      tnaup2 = t1 - t0
-c     
- 9000 continue
-c
-c     %---------------%
-c     | End of igraphdnaup2 |
-c     %---------------%
-c
-      return
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dnaupd.f igraph-0.6.5/interfaces/R/arpack/dnaupd.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dnaupd.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dnaupd.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,655 +0,0 @@
-c\BeginDoc
-c
-c\Name: igraphdnaupd
-c
-c\Description: 
-c  Reverse communication interface for the Implicitly Restarted Arnoldi
-c  iteration. This subroutine computes approximations to a few eigenpairs 
-c  of a linear operator "OP" with respect to a semi-inner product defined by 
-c  a symmetric positive semi-definite real matrix B. B may be the identity 
-c  matrix. NOTE: If the linear operator "OP" is real and symmetric 
-c  with respect to the real positive semi-definite symmetric matrix B, 
-c  i.e. B*OP = (OP')*B, then subroutine ssaupd should be used instead.
-c
-c  The computed approximate eigenvalues are called Ritz values and
-c  the corresponding approximate eigenvectors are called Ritz vectors.
-c
-c  igraphdnaupd is usually called iteratively to solve one of the 
-c  following problems:
-c
-c  Mode 1:  A*x = lambda*x.
-c           ===> OP = A  and  B = I.
-c
-c  Mode 2:  A*x = lambda*M*x, M symmetric positive definite
-c           ===> OP = inv[M]*A  and  B = M.
-c           ===> (If M can be factored see remark 3 below)
-c
-c  Mode 3:  A*x = lambda*M*x, M symmetric semi-definite
-c           ===> OP = Real_Part{ inv[A - sigma*M]*M }  and  B = M. 
-c           ===> shift-and-invert mode (in real arithmetic)
-c           If OP*x = amu*x, then 
-c           amu = 1/2 * [ 1/(lambda-sigma) + 1/(lambda-conjg(sigma)) ].
-c           Note: If sigma is real, i.e. imaginary part of sigma is zero;
-c                 Real_Part{ inv[A - sigma*M]*M } == inv[A - sigma*M]*M 
-c                 amu == 1/(lambda-sigma). 
-c  
-c  Mode 4:  A*x = lambda*M*x, M symmetric semi-definite
-c           ===> OP = Imaginary_Part{ inv[A - sigma*M]*M }  and  B = M. 
-c           ===> shift-and-invert mode (in real arithmetic)
-c           If OP*x = amu*x, then 
-c           amu = 1/2i * [ 1/(lambda-sigma) - 1/(lambda-conjg(sigma)) ].
-c
-c  Both mode 3 and 4 give the same enhancement to eigenvalues close to
-c  the (complex) shift sigma.  However, as lambda goes to infinity,
-c  the operator OP in mode 4 dampens the eigenvalues more strongly than
-c  does OP defined in mode 3.
-c
-c  NOTE: The action of w <- inv[A - sigma*M]*v or w <- inv[M]*v
-c        should be accomplished either by a direct method
-c        using a sparse matrix factorization and solving
-c
-c           [A - sigma*M]*w = v  or M*w = v,
-c
-c        or through an iterative method for solving these
-c        systems.  If an iterative method is used, the
-c        convergence test must be more stringent than
-c        the accuracy requirements for the eigenvalue
-c        approximations.
-c
-c\Usage:
-c  call igraphdnaupd
-c     ( IDO, BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM,
-c       IPNTR, WORKD, WORKL, LWORKL, INFO )
-c
-c\Arguments
-c  IDO     Integer.  (INPUT/OUTPUT)
-c          Reverse communication flag.  IDO must be zero on the first 
-c          call to igraphdnaupd.  IDO will be set internally to
-c          indicate the type of operation to be performed.  Control is
-c          then given back to the calling routine which has the
-c          responsibility to carry out the requested operation and call
-c          igraphdnaupd with the result.  The operand is given in
-c          WORKD(IPNTR(1)), the result must be put in WORKD(IPNTR(2)).
-c          -------------------------------------------------------------
-c          IDO =  0: first call to the reverse communication interface
-c          IDO = -1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c                    This is for the initialization phase to force the
-c                    starting vector into the range of OP.
-c          IDO =  1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c                    In mode 3 and 4, the vector B * X is already
-c                    available in WORKD(ipntr(3)).  It does not
-c                    need to be recomputed in forming OP * X.
-c          IDO =  2: compute  Y = B * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c          IDO =  3: compute the IPARAM(8) real and imaginary parts 
-c                    of the shifts where INPTR(14) is the pointer
-c                    into WORKL for placing the shifts. See Remark
-c                    5 below.
-c          IDO = 99: done
-c          -------------------------------------------------------------
-c             
-c  BMAT    Character*1.  (INPUT)
-c          BMAT specifies the type of the matrix B that defines the
-c          semi-inner product for the operator OP.
-c          BMAT = 'I' -> standard eigenvalue problem A*x = lambda*x
-c          BMAT = 'G' -> generalized eigenvalue problem A*x = lambda*B*x
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the eigenproblem.
-c
-c  WHICH   Character*2.  (INPUT)
-c          'LM' -> want the NEV eigenvalues of largest magnitude.
-c          'SM' -> want the NEV eigenvalues of smallest magnitude.
-c          'LR' -> want the NEV eigenvalues of largest real part.
-c          'SR' -> want the NEV eigenvalues of smallest real part.
-c          'LI' -> want the NEV eigenvalues of largest imaginary part.
-c          'SI' -> want the NEV eigenvalues of smallest imaginary part.
-c
-c  NEV     Integer.  (INPUT)
-c          Number of eigenvalues of OP to be computed. 0 < NEV < N-1.
-c
-c  TOL     Double precision scalar.  (INPUT)
-c          Stopping criterion: the relative accuracy of the Ritz value 
-c          is considered acceptable if BOUNDS(I) .LE. TOL*ABS(RITZ(I))
-c          where ABS(RITZ(I)) is the magnitude when RITZ(I) is complex.
-c          DEFAULT = DLAMCH('EPS')  (machine precision as computed
-c                    by the LAPACK auxiliary subroutine DLAMCH).
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          On INPUT: 
-c          If INFO .EQ. 0, a random initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          On OUTPUT:
-c          RESID contains the final residual vector.
-c
-c  NCV     Integer.  (INPUT)
-c          Number of columns of the matrix V. NCV must satisfy the two
-c          inequalities 2 <= NCV-NEV and NCV <= N.
-c          This will indicate how many Arnoldi vectors are generated 
-c          at each iteration.  After the startup phase in which NEV 
-c          Arnoldi vectors are generated, the algorithm generates 
-c          approximately NCV-NEV Arnoldi vectors at each subsequent update 
-c          iteration. Most of the cost in generating each Arnoldi vector is 
-c          in the matrix-vector operation OP*x. 
-c          NOTE: 2 <= NCV-NEV in order that complex conjugate pairs of Ritz 
-c          values are kept together. (See remark 4 below)
-c
-c  V       Double precision array N by NCV.  (OUTPUT)
-c          Contains the final set of Arnoldi basis vectors. 
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling program.
-c
-c  IPARAM  Integer array of length 11.  (INPUT/OUTPUT)
-c          IPARAM(1) = ISHIFT: method for selecting the implicit shifts.
-c          The shifts selected at each iteration are used to restart
-c          the Arnoldi iteration in an implicit fashion.
-c          -------------------------------------------------------------
-c          ISHIFT = 0: the shifts are provided by the user via
-c                      reverse communication.  The real and imaginary
-c                      parts of the NCV eigenvalues of the Hessenberg
-c                      matrix H are returned in the part of the WORKL 
-c                      array corresponding to RITZR and RITZI. See remark 
-c                      5 below.
-c          ISHIFT = 1: exact shifts with respect to the current
-c                      Hessenberg matrix H.  This is equivalent to 
-c                      restarting the iteration with a starting vector
-c                      that is a linear combination of approximate Schur
-c                      vectors associated with the "wanted" Ritz values.
-c          -------------------------------------------------------------
-c
-c          IPARAM(2) = No longer referenced.
-c
-c          IPARAM(3) = MXITER
-c          On INPUT:  maximum number of Arnoldi update iterations allowed. 
-c          On OUTPUT: actual number of Arnoldi update iterations taken. 
-c
-c          IPARAM(4) = NB: blocksize to be used in the recurrence.
-c          The code currently works only for NB = 1.
-c
-c          IPARAM(5) = NCONV: number of "converged" Ritz values.
-c          This represents the number of Ritz values that satisfy
-c          the convergence criterion.
-c
-c          IPARAM(6) = IUPD
-c          No longer referenced. Implicit restarting is ALWAYS used.  
-c
-c          IPARAM(7) = MODE
-c          On INPUT determines what type of eigenproblem is being solved.
-c          Must be 1,2,3,4; See under \Description of igraphdnaupd for the 
-c          four modes available.
-c
-c          IPARAM(8) = NP
-c          When ido = 3 and the user provides shifts through reverse
-c          communication (IPARAM(1)=0), igraphdnaupd returns NP, the number
-c          of shifts the user is to provide. 0 < NP <=NCV-NEV. See Remark
-c          5 below.
-c
-c          IPARAM(9) = NUMOP, IPARAM(10) = NUMOPB, IPARAM(11) = NUMREO,
-c          OUTPUT: NUMOP  = total number of OP*x operations,
-c                  NUMOPB = total number of B*x operations if BMAT='G',
-c                  NUMREO = total number of steps of re-orthogonalization.        
-c
-c  IPNTR   Integer array of length 14.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORKD and WORKL
-c          arrays for matrices/vectors used by the Arnoldi iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X in WORKD.
-c          IPNTR(2): pointer to the current result vector Y in WORKD.
-c          IPNTR(3): pointer to the vector B * X in WORKD when used in 
-c                    the shift-and-invert mode.
-c          IPNTR(4): pointer to the next available location in WORKL
-c                    that is untouched by the program.
-c          IPNTR(5): pointer to the NCV by NCV upper Hessenberg matrix
-c                    H in WORKL.
-c          IPNTR(6): pointer to the real part of the ritz value array 
-c                    RITZR in WORKL.
-c          IPNTR(7): pointer to the imaginary part of the ritz value array
-c                    RITZI in WORKL.
-c          IPNTR(8): pointer to the Ritz estimates in array WORKL associated
-c                    with the Ritz values located in RITZR and RITZI in WORKL.
-c
-c          IPNTR(14): pointer to the NP shifts in WORKL. See Remark 5 below.
-c
-c          Note: IPNTR(9:13) is only referenced by igraphdneupd. See Remark 2 below.
-c
-c          IPNTR(9):  pointer to the real part of the NCV RITZ values of the 
-c                     original system.
-c          IPNTR(10): pointer to the imaginary part of the NCV RITZ values of 
-c                     the original system.
-c          IPNTR(11): pointer to the NCV corresponding error bounds.
-c          IPNTR(12): pointer to the NCV by NCV upper quasi-triangular
-c                     Schur matrix for H.
-c          IPNTR(13): pointer to the NCV by NCV matrix of eigenvectors
-c                     of the upper Hessenberg matrix H. Only referenced by
-c                     igraphdneupd if RVEC = .TRUE. See Remark 2 below.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (REVERSE COMMUNICATION)
-c          Distributed array to be used in the basic Arnoldi iteration
-c          for reverse communication.  The user should not use WORKD 
-c          as temporary workspace during the iteration. Upon termination
-c          WORKD(1:N) contains B*RESID(1:N). If an invariant subspace
-c          associated with the converged Ritz values is desired, see remark
-c          2 below, subroutine igraphdneupd uses this output.
-c          See Data Distribution Note below.  
-c
-c  WORKL   Double precision work array of length LWORKL.  (OUTPUT/WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.  See Data Distribution Note below.
-c
-c  LWORKL  Integer.  (INPUT)
-c          LWORKL must be at least 3*NCV**2 + 6*NCV.
-c
-c  INFO    Integer.  (INPUT/OUTPUT)
-c          If INFO .EQ. 0, a randomly initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          Error flag on output.
-c          =  0: Normal exit.
-c          =  1: Maximum number of iterations taken.
-c                All possible eigenvalues of OP has been found. IPARAM(5)  
-c                returns the number of wanted converged Ritz values.
-c          =  2: No longer an informational error. Deprecated starting
-c                with release 2 of ARPACK.
-c          =  3: No shifts could be applied during a cycle of the 
-c                Implicitly restarted Arnoldi iteration. One possibility 
-c                is to increase the size of NCV relative to NEV. 
-c                See remark 4 below.
-c          = -1: N must be positive.
-c          = -2: NEV must be positive.
-c          = -3: NCV-NEV >= 2 and less than or equal to N.
-c          = -4: The maximum number of Arnoldi update iteration 
-c                must be greater than zero.
-c          = -5: WHICH must be one of 'LM', 'SM', 'LR', 'SR', 'LI', 'SI'
-c          = -6: BMAT must be one of 'I' or 'G'.
-c          = -7: Length of private work array is not sufficient.
-c          = -8: Error return from LAPACK eigenvalue calculation;
-c          = -9: Starting vector is zero.
-c          = -10: IPARAM(7) must be 1,2,3,4.
-c          = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatable.
-c          = -12: IPARAM(1) must be equal to 0 or 1.
-c          = -9999: Could not build an Arnoldi factorization.
-c                   IPARAM(5) returns the size of the current Arnoldi
-c                   factorization.
-c
-c\Remarks
-c  1. The computed Ritz values are approximate eigenvalues of OP. The
-c     selection of WHICH should be made with this in mind when
-c     Mode = 3 and 4.  After convergence, approximate eigenvalues of the
-c     original problem may be obtained with the ARPACK subroutine igraphdneupd.
-c
-c  2. If a basis for the invariant subspace corresponding to the converged Ritz 
-c     values is needed, the user must call igraphdneupd immediately following 
-c     completion of igraphdnaupd. This is new starting with release 2 of ARPACK.
-c
-c  3. If M can be factored into a Cholesky factorization M = LL'
-c     then Mode = 2 should not be selected.  Instead one should use
-c     Mode = 1 with  OP = inv(L)*A*inv(L').  Appropriate triangular 
-c     linear systems should be solved with L and L' rather
-c     than computing inverses.  After convergence, an approximate
-c     eigenvector z of the original problem is recovered by solving
-c     L'z = x  where x is a Ritz vector of OP.
-c
-c  4. At present there is no a-priori analysis to guide the selection
-c     of NCV relative to NEV.  The only formal requrement is that NCV > NEV + 2.
-c     However, it is recommended that NCV .ge. 2*NEV+1.  If many problems of
-c     the same type are to be solved, one should experiment with increasing
-c     NCV while keeping NEV fixed for a given test problem.  This will 
-c     usually decrease the required number of OP*x operations but it
-c     also increases the work and storage required to maintain the orthogonal
-c     basis vectors.  The optimal "cross-over" with respect to CPU time
-c     is problem dependent and must be determined empirically. 
-c     See Chapter 8 of Reference 2 for further information.
-c
-c  5. When IPARAM(1) = 0, and IDO = 3, the user needs to provide the 
-c     NP = IPARAM(8) real and imaginary parts of the shifts in locations 
-c         real part                  imaginary part
-c         -----------------------    --------------
-c     1   WORKL(IPNTR(14))           WORKL(IPNTR(14)+NP)
-c     2   WORKL(IPNTR(14)+1)         WORKL(IPNTR(14)+NP+1)
-c                        .                          .
-c                        .                          .
-c                        .                          .
-c     NP  WORKL(IPNTR(14)+NP-1)      WORKL(IPNTR(14)+2*NP-1).
-c
-c     Only complex conjugate pairs of shifts may be applied and the pairs 
-c     must be placed in consecutive locations. The real part of the 
-c     eigenvalues of the current upper Hessenberg matrix are located in 
-c     WORKL(IPNTR(6)) through WORKL(IPNTR(6)+NCV-1) and the imaginary part 
-c     in WORKL(IPNTR(7)) through WORKL(IPNTR(7)+NCV-1). They are ordered
-c     according to the order defined by WHICH. The complex conjugate
-c     pairs are kept together and the associated Ritz estimates are located in
-c     WORKL(IPNTR(8)), WORKL(IPNTR(8)+1), ... , WORKL(IPNTR(8)+NCV-1).
-c
-c-----------------------------------------------------------------------
-c
-c\Data Distribution Note: 
-c
-c  Fortran-D syntax:
-c  ================
-c  Double precision resid(n), v(ldv,ncv), workd(3*n), workl(lworkl)
-c  decompose  d1(n), d2(n,ncv)
-c  align      resid(i) with d1(i)
-c  align      v(i,j)   with d2(i,j)
-c  align      workd(i) with d1(i)     range (1:n)
-c  align      workd(i) with d1(i-n)   range (n+1:2*n)
-c  align      workd(i) with d1(i-2*n) range (2*n+1:3*n)
-c  distribute d1(block), d2(block,:)
-c  replicated workl(lworkl)
-c
-c  Cray MPP syntax:
-c  ===============
-c  Double precision  resid(n), v(ldv,ncv), workd(n,3), workl(lworkl)
-c  shared     resid(block), v(block,:), workd(block,:)
-c  replicated workl(lworkl)
-c  
-c  CM2/CM5 syntax:
-c  ==============
-c  
-c-----------------------------------------------------------------------
-c
-c     include   'ex-nonsym.doc'
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c  3. B.N. Parlett & Y. Saad, "Complex Shift and Invert Strategies for
-c     Real Matrices", Linear Algebra and its Applications, vol 88/89,
-c     pp 575-595, (1987).
-c
-c\Routines called:
-c     igraphdnaup2  ARPACK routine that implements the Implicitly Restarted
-c             Arnoldi Iteration.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c 
-c\Revision history:
-c     12/16/93: Version '1.1'
-c
-c\SCCS Information: @(#) 
-c FILE: naupd.F   SID: 2.5   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\Remarks
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdnaupd
-     &   ( ido, bmat, n, which, nev, tol, resid, ncv, v, ldv, iparam, 
-     &     ipntr, workd, workl, lworkl, info )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1, which*2
-      integer    ido, info, ldv, lworkl, n, ncv, nev
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    iparam(11), ipntr(14)
-      Double precision
-     &           resid(n), v(ldv,ncv), workd(3*n), workl(lworkl)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    bounds, ierr, ih, iq, ishift, iupd, iw, 
-     &           ldh, ldq, levec, mode, msglvl, mxiter, nb,
-     &           nev0, next, np, ritzi, ritzr, j
-      save       bounds, ih, iq, ishift, iupd, iw, ldh, ldq,
-     &           levec, mode, msglvl, mxiter, nb, nev0, next,
-     &           np, ritzi, ritzr
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   igraphdnaup2, igraphdvout, igraphivout, 
-     &     igraphsecond, igraphdstatn
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlamch
-      external   dlamch
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-      if (ido .eq. 0) then
-c 
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphdstatn
-         call igraphsecond (t0)
-         msglvl = mnaupd
-c
-c        %----------------%
-c        | Error checking |
-c        %----------------%
-c
-         ierr   = 0
-         ishift = iparam(1)
-         levec  = iparam(2)
-         mxiter = iparam(3)
-         nb     = iparam(4)
-c
-c        %--------------------------------------------%
-c        | Revision 2 performs only implicit restart. |
-c        %--------------------------------------------%
-c
-         iupd   = 1
-         mode   = iparam(7)
-c
-         if (n .le. 0) then
-             ierr = -1
-         else if (nev .le. 0) then
-             ierr = -2
-         else if (ncv .le. nev+1 .or.  ncv .gt. n) then
-             ierr = -3
-         else if (mxiter .le. 0) then
-             ierr = -4
-         else if (which .ne. 'LM' .and.
-     &       which .ne. 'SM' .and.
-     &       which .ne. 'LR' .and.
-     &       which .ne. 'SR' .and.
-     &       which .ne. 'LI' .and.
-     &       which .ne. 'SI') then
-            ierr = -5
-         else if (bmat .ne. 'I' .and. bmat .ne. 'G') then
-            ierr = -6
-         else if (lworkl .lt. 3*ncv**2 + 6*ncv) then
-            ierr = -7
-         else if (mode .lt. 1 .or. mode .gt. 5) then
-                                                ierr = -10
-         else if (mode .eq. 1 .and. bmat .eq. 'G') then
-                                                ierr = -11
-         else if (ishift .lt. 0 .or. ishift .gt. 1) then
-                                                ierr = -12
-         end if
-c 
-c        %------------%
-c        | Error Exit |
-c        %------------%
-c
-         if (ierr .ne. 0) then
-            info = ierr
-            ido  = 99
-            go to 9000
-         end if
-c 
-c        %------------------------%
-c        | Set default parameters |
-c        %------------------------%
-c
-         if (nb .le. 0)				nb = 1
-         if (tol .le. zero)			tol = dlamch('EpsMach')
-c
-c        %----------------------------------------------%
-c        | NP is the number of additional steps to      |
-c        | extend the length NEV Lanczos factorization. |
-c        | NEV0 is the local variable designating the   |
-c        | size of the invariant subspace desired.      |
-c        %----------------------------------------------%
-c
-         np     = ncv - nev
-         nev0   = nev 
-c 
-c        %-----------------------------%
-c        | Zero out internal workspace |
-c        %-----------------------------%
-c
-         do 10 j = 1, 3*ncv**2 + 6*ncv
-            workl(j) = zero
-  10     continue
-c 
-c        %-------------------------------------------------------------%
-c        | Pointer into WORKL for address of H, RITZ, BOUNDS, Q        |
-c        | etc... and the remaining workspace.                         |
-c        | Also update pointer to be used on output.                   |
-c        | Memory is laid out as follows:                              |
-c        | workl(1:ncv*ncv) := generated Hessenberg matrix             |
-c        | workl(ncv*ncv+1:ncv*ncv+2*ncv) := real and imaginary        |
-c        |                                   parts of ritz values      |
-c        | workl(ncv*ncv+2*ncv+1:ncv*ncv+3*ncv) := error bounds        |
-c        | workl(ncv*ncv+3*ncv+1:2*ncv*ncv+3*ncv) := rotation matrix Q |
-c        | workl(2*ncv*ncv+3*ncv+1:3*ncv*ncv+6*ncv) := workspace       |
-c        | The final workspace is needed by subroutine igraphdneigh called   |
-c        | by igraphdnaup2. Subroutine igraphdneigh calls LAPACK routines for      |
-c        | calculating eigenvalues and the last row of the eigenvector |
-c        | matrix.                                                     |
-c        %-------------------------------------------------------------%
-c
-         ldh    = ncv
-         ldq    = ncv
-         ih     = 1
-         ritzr  = ih     + ldh*ncv
-         ritzi  = ritzr  + ncv
-         bounds = ritzi  + ncv
-         iq     = bounds + ncv
-         iw     = iq     + ldq*ncv
-         next   = iw     + ncv**2 + 3*ncv
-c
-         ipntr(4) = next
-         ipntr(5) = ih
-         ipntr(6) = ritzr
-         ipntr(7) = ritzi
-         ipntr(8) = bounds
-         ipntr(14) = iw 
-c
-      end if
-c
-c     %-------------------------------------------------------%
-c     | Carry out the Implicitly restarted Arnoldi Iteration. |
-c     %-------------------------------------------------------%
-c
-      call igraphdnaup2 
-     &   ( ido, bmat, n, which, nev0, np, tol, resid, mode, iupd,
-     &     ishift, mxiter, v, ldv, workl(ih), ldh, workl(ritzr), 
-     &     workl(ritzi), workl(bounds), workl(iq), ldq, workl(iw), 
-     &     ipntr, workd, info )
-c 
-c     %--------------------------------------------------%
-c     | ido .ne. 99 implies use of reverse communication |
-c     | to compute operations involving OP or shifts.    |
-c     %--------------------------------------------------%
-c
-      if (ido .eq. 3) iparam(8) = np
-      if (ido .ne. 99) go to 9000
-c 
-      iparam(3) = mxiter
-      iparam(5) = np
-      iparam(9) = nopx
-      iparam(10) = nbx
-      iparam(11) = nrorth
-c
-c     %------------------------------------%
-c     | Exit if there was an informational |
-c     | error within igraphdnaup2.               |
-c     %------------------------------------%
-c
-      if (info .lt. 0) go to 9000
-      if (info .eq. 2) info = 3
-c
-      if (msglvl .gt. 0) then
-         call igraphivout (logfil, 1, mxiter, ndigit,
-     &               '_naupd: Number of update iterations taken')
-         call igraphivout (logfil, 1, np, ndigit,
-     &               '_naupd: Number of wanted "converged" Ritz values')
-         call igraphdvout (logfil, np, workl(ritzr), ndigit, 
-     &               '_naupd: Real part of the final Ritz values')
-         call igraphdvout (logfil, np, workl(ritzi), ndigit, 
-     &               '_naupd: Imaginary part of the final Ritz values')
-         call igraphdvout (logfil, np, workl(bounds), ndigit, 
-     &               '_naupd: Associated Ritz estimates')
-      end if
-c
-      call igraphsecond (t1)
-      tnaupd = t1 - t0
-c
-c
- 9000 continue
-c
-      return
-c
-c     %---------------%
-c     | End of igraphdnaupd |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dnconv.f igraph-0.6.5/interfaces/R/arpack/dnconv.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dnconv.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dnconv.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,146 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdnconv
-c
-c\Description: 
-c  Convergence testing for the nonsymmetric Arnoldi eigenvalue routine.
-c
-c\Usage:
-c  call igraphdnconv
-c     ( N, RITZR, RITZI, BOUNDS, TOL, NCONV )
-c
-c\Arguments
-c  N       Integer.  (INPUT)
-c          Number of Ritz values to check for convergence.
-c
-c  RITZR,  Double precision arrays of length N.  (INPUT)
-c  RITZI   Real and imaginary parts of the Ritz values to be checked
-c          for convergence.
-
-c  BOUNDS  Double precision array of length N.  (INPUT)
-c          Ritz estimates for the Ritz values in RITZR and RITZI.
-c
-c  TOL     Double precision scalar.  (INPUT)
-c          Desired backward error for a Ritz value to be considered
-c          "converged".
-c
-c  NCONV   Integer scalar.  (OUTPUT)
-c          Number of "converged" Ritz values.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphsecond  ARPACK utility routine for timing.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics 
-c     Rice University           
-c     Houston, Texas    
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: nconv.F   SID: 2.3   DATE OF SID: 4/20/96   RELEASE: 2
-c
-c\Remarks
-c     1. xxxx
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdnconv (n, ritzr, ritzi, bounds, tol, nconv)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    n, nconv
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-
-      Double precision
-     &           ritzr(n), ritzi(n), bounds(n)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i
-      Double precision
-     &           temp, eps23
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlapy2, dlamch
-      external   dlapy2, dlamch
-
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-c     %-------------------------------------------------------------%
-c     | Convergence test: unlike in the symmetric code, I am not    |
-c     | using things like refined error bounds and gap condition    |
-c     | because I don't know the exact equivalent concept.          |
-c     |                                                             |
-c     | Instead the i-th Ritz value is considered "converged" when: |
-c     |                                                             |
-c     |     bounds(i) .le. ( TOL * | ritz | )                       |
-c     |                                                             |
-c     | for some appropriate choice of norm.                        |
-c     %-------------------------------------------------------------%
-c
-      call igraphsecond (t0)
-c
-c     %---------------------------------%
-c     | Get machine dependent constant. |
-c     %---------------------------------%
-c
-      eps23 = dlamch('Epsilon-Machine')
-      eps23 = eps23**(2.0D+0 / 3.0D+0)
-c
-      nconv  = 0
-      do 20 i = 1, n
-         temp = max( eps23, dlapy2( ritzr(i), ritzi(i) ) )
-         if (bounds(i) .le. tol*temp)   nconv = nconv + 1
-   20 continue
-c 
-      call igraphsecond (t1)
-      tnconv = tnconv + (t1 - t0)
-c 
-      return
-c
-c     %---------------%
-c     | End of igraphdnconv |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dneigh.f igraph-0.6.5/interfaces/R/arpack/dneigh.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dneigh.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dneigh.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,315 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdneigh
-c
-c\Description:
-c  Compute the eigenvalues of the current upper Hessenberg matrix
-c  and the corresponding Ritz estimates given the current residual norm.
-c
-c\Usage:
-c  call igraphdneigh
-c     ( RNORM, N, H, LDH, RITZR, RITZI, BOUNDS, Q, LDQ, WORKL, IERR )
-c
-c\Arguments
-c  RNORM   Double precision scalar.  (INPUT)
-c          Residual norm corresponding to the current upper Hessenberg 
-c          matrix H.
-c
-c  N       Integer.  (INPUT)
-c          Size of the matrix H.
-c
-c  H       Double precision N by N array.  (INPUT)
-c          H contains the current upper Hessenberg matrix.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling
-c          program.
-c
-c  RITZR,  Double precision arrays of length N.  (OUTPUT)
-c  RITZI   On output, RITZR(1:N) (resp. RITZI(1:N)) contains the real 
-c          (respectively imaginary) parts of the eigenvalues of H.
-c
-c  BOUNDS  Double precision array of length N.  (OUTPUT)
-c          On output, BOUNDS contains the Ritz estimates associated with
-c          the eigenvalues RITZR and RITZI.  This is equal to RNORM 
-c          times the last components of the eigenvectors corresponding 
-c          to the eigenvalues in RITZR and RITZI.
-c
-c  Q       Double precision N by N array.  (WORKSPACE)
-c          Workspace needed to store the eigenvectors of H.
-c
-c  LDQ     Integer.  (INPUT)
-c          Leading dimension of Q exactly as declared in the calling
-c          program.
-c
-c  WORKL   Double precision work array of length N**2 + 3*N.  (WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.  This is needed to keep the full Schur form
-c          of H and also in the calculation of the eigenvectors of H.
-c
-c  IERR    Integer.  (OUTPUT)
-c          Error exit flag from igraphdlaqrb or dtrevc.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphdlaqrb  ARPACK routine to compute the real Schur form of an
-c             upper Hessenberg matrix and last row of the Schur vectors.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdmout   ARPACK utility routine that prints matrices
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlacpy  LAPACK matrix copy routine.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c     dtrevc  LAPACK routine to compute the eigenvectors of a matrix
-c             in upper quasi-triangular form
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c     dscal   Level 1 BLAS that scales a vector.
-c     
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: neigh.F   SID: 2.3   DATE OF SID: 4/20/96   RELEASE: 2
-c
-c\Remarks
-c     None
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdneigh (rnorm, n, h, ldh, ritzr, ritzi, bounds, 
-     &                   q, ldq, workl, ierr)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    ierr, n, ldh, ldq
-      Double precision     
-     &           rnorm
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision     
-     &           bounds(n), h(ldh,n), q(ldq,n), ritzi(n), ritzr(n),
-     &           workl(n*(n+3))
-c 
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision     
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c 
-c     %------------------------%
-c     | Local Scalars & Arrays |
-c     %------------------------%
-c
-      logical    select(1)
-      integer    i, iconj, msglvl
-      Double precision     
-     &           temp, vl(1)
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, dlacpy, igraphdlaqrb, dtrevc, igraphdvout, 
-     & igraphsecond
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlapy2, dnrm2
-      external   dlapy2, dnrm2
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic  abs
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-c
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------%
-c
-      call igraphsecond (t0)
-      msglvl = mneigh
-c 
-      if (msglvl .gt. 2) then
-          call igraphdmout (logfil, n, n, h, ldh, ndigit, 
-     &         '_neigh: Entering upper Hessenberg matrix H ')
-      end if
-c 
-c     %-----------------------------------------------------------%
-c     | 1. Compute the eigenvalues, the last components of the    |
-c     |    corresponding Schur vectors and the full Schur form T  |
-c     |    of the current upper Hessenberg matrix H.              |
-c     | igraphdlaqrb returns the full Schur form of H in WORKL(1:N**2)  |
-c     | and the last components of the Schur vectors in BOUNDS.   |
-c     %-----------------------------------------------------------%
-c
-      call dlacpy ('All', n, n, h, ldh, workl, n)
-      call igraphdlaqrb (.true., n, 1, n, workl, n, ritzr, ritzi,
-     &      bounds, ierr)
-      if (ierr .ne. 0) go to 9000
-c
-      if (msglvl .gt. 1) then
-         call igraphdvout (logfil, n, bounds, ndigit,
-     &              '_neigh: last row of the Schur matrix for H')
-      end if
-c
-c     %-----------------------------------------------------------%
-c     | 2. Compute the eigenvectors of the full Schur form T and  |
-c     |    apply the last components of the Schur vectors to get  |
-c     |    the last components of the corresponding eigenvectors. |
-c     | Remember that if the i-th and (i+1)-st eigenvalues are    |
-c     | complex conjugate pairs, then the real & imaginary part   |
-c     | of the eigenvector components are split across adjacent   |
-c     | columns of Q.                                             |
-c     %-----------------------------------------------------------%
-c
-      call dtrevc ('R', 'A', select, n, workl, n, vl, n, q, ldq,
-     &             n, n, workl(n*n+1), ierr)
-c
-      if (ierr .ne. 0) go to 9000
-c
-c     %------------------------------------------------%
-c     | Scale the returning eigenvectors so that their |
-c     | euclidean norms are all one. LAPACK subroutine |
-c     | dtrevc returns each eigenvector normalized so  |
-c     | that the element of largest magnitude has      |
-c     | magnitude 1; here the magnitude of a complex   |
-c     | number (x,y) is taken to be |x| + |y|.         |
-c     %------------------------------------------------%
-c
-      iconj = 0
-      do 10 i=1, n
-         if ( abs( ritzi(i) ) .le. zero ) then
-c
-c           %----------------------%
-c           | Real eigenvalue case |
-c           %----------------------%
-c    
-            temp = dnrm2( n, q(1,i), 1 )
-            call dscal ( n, one / temp, q(1,i), 1 )
-         else
-c
-c           %-------------------------------------------%
-c           | Complex conjugate pair case. Note that    |
-c           | since the real and imaginary part of      |
-c           | the eigenvector are stored in consecutive |
-c           | columns, we further normalize by the      |
-c           | square root of two.                       |
-c           %-------------------------------------------%
-c
-            if (iconj .eq. 0) then
-               temp = dlapy2( dnrm2( n, q(1,i), 1 ), 
-     &                        dnrm2( n, q(1,i+1), 1 ) )
-               call dscal ( n, one / temp, q(1,i), 1 )
-               call dscal ( n, one / temp, q(1,i+1), 1 )
-               iconj = 1
-            else
-               iconj = 0
-            end if
-         end if         
-   10 continue
-c
-      call dgemv ('T', n, n, one, q, ldq, bounds, 1, zero, workl, 1)
-c
-      if (msglvl .gt. 1) then
-         call igraphdvout (logfil, n, workl, ndigit,
-     &              '_neigh: Last row of the eigenvector matrix for H')
-      end if
-c
-c     %----------------------------%
-c     | Compute the Ritz estimates |
-c     %----------------------------%
-c
-      iconj = 0
-      do 20 i = 1, n
-         if ( abs( ritzi(i) ) .le. zero ) then
-c
-c           %----------------------%
-c           | Real eigenvalue case |
-c           %----------------------%
-c    
-            bounds(i) = rnorm * abs( workl(i) )
-         else
-c
-c           %-------------------------------------------%
-c           | Complex conjugate pair case. Note that    |
-c           | since the real and imaginary part of      |
-c           | the eigenvector are stored in consecutive |
-c           | columns, we need to take the magnitude    |
-c           | of the last components of the two vectors |
-c           %-------------------------------------------%
-c
-            if (iconj .eq. 0) then
-               bounds(i) = rnorm * dlapy2( workl(i), workl(i+1) )
-               bounds(i+1) = bounds(i)
-               iconj = 1
-            else
-               iconj = 0
-            end if
-         end if
-   20 continue
-c
-      if (msglvl .gt. 2) then
-         call igraphdvout (logfil, n, ritzr, ndigit,
-     &              '_neigh: Real part of the eigenvalues of H')
-         call igraphdvout (logfil, n, ritzi, ndigit,
-     &              '_neigh: Imaginary part of the eigenvalues of H')
-         call igraphdvout (logfil, n, bounds, ndigit,
-     &              '_neigh: Ritz estimates for the eigenvalues of H')
-      end if
-c
-      call igraphsecond (t1)
-      tneigh = tneigh + (t1 - t0)
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdneigh |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dneupd.f igraph-0.6.5/interfaces/R/arpack/dneupd.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dneupd.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dneupd.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,1044 +0,0 @@
-c\BeginDoc
-c
-c\Name: igraphdneupd
-c
-c\Description: 
-c
-c  This subroutine returns the converged approximations to eigenvalues
-c  of A*z = lambda*B*z and (optionally):
-c
-c      (1) The corresponding approximate eigenvectors;
-c
-c      (2) An orthonormal basis for the associated approximate
-c          invariant subspace;
-c
-c      (3) Both.
-c
-c  There is negligible additional cost to obtain eigenvectors.  An orthonormal
-c  basis is always computed.  There is an additional storage cost of n*nev
-c  if both are requested (in this case a separate array Z must be supplied).
-c
-c  The approximate eigenvalues and eigenvectors of  A*z = lambda*B*z
-c  are derived from approximate eigenvalues and eigenvectors of
-c  of the linear operator OP prescribed by the MODE selection in the
-c  call to DNAUPD.  DNAUPD must be called before this routine is called.
-c  These approximate eigenvalues and vectors are commonly called Ritz
-c  values and Ritz vectors respectively.  They are referred to as such
-c  in the comments that follow.  The computed orthonormal basis for the
-c  invariant subspace corresponding to these Ritz values is referred to as a
-c  Schur basis.
-c
-c  See documentation in the header of the subroutine DNAUPD for 
-c  definition of OP as well as other terms and the relation of computed
-c  Ritz values and Ritz vectors of OP with respect to the given problem
-c  A*z = lambda*B*z.  For a brief description, see definitions of 
-c  IPARAM(7), MODE and WHICH in the documentation of DNAUPD.
-c
-c\Usage:
-c  call igraphdneupd 
-c     ( RVEC, HOWMNY, SELECT, DR, DI, Z, LDZ, SIGMAR, SIGMAI, WORKEV, BMAT, 
-c       N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, IPNTR, WORKD, WORKL, 
-c       LWORKL, INFO )
-c
-c\Arguments:
-c  RVEC    LOGICAL  (INPUT) 
-c          Specifies whether a basis for the invariant subspace corresponding 
-c          to the converged Ritz value approximations for the eigenproblem 
-c          A*z = lambda*B*z is computed.
-c
-c             RVEC = .FALSE.     Compute Ritz values only.
-c
-c             RVEC = .TRUE.      Compute the Ritz vectors or Schur vectors.
-c                                See Remarks below. 
-c 
-c  HOWMNY  Character*1  (INPUT) 
-c          Specifies the form of the basis for the invariant subspace 
-c          corresponding to the converged Ritz values that is to be computed.
-c
-c          = 'A': Compute NEV Ritz vectors; 
-c          = 'P': Compute NEV Schur vectors;
-c          = 'S': compute some of the Ritz vectors, specified
-c                 by the logical array SELECT.
-c
-c  SELECT  Logical array of dimension NCV.  (INPUT)
-c          If HOWMNY = 'S', SELECT specifies the Ritz vectors to be
-c          computed. To select the Ritz vector corresponding to a
-c          Ritz value (DR(j), DI(j)), SELECT(j) must be set to .TRUE.. 
-c          If HOWMNY = 'A' or 'P', SELECT is used as internal workspace.
-c
-c  DR      Double precision array of dimension NEV+1.  (OUTPUT)
-c          If IPARAM(7) = 1,2 or 3 and SIGMAI=0.0  then on exit: DR contains 
-c          the real part of the Ritz  approximations to the eigenvalues of 
-c          A*z = lambda*B*z. 
-c          If IPARAM(7) = 3, 4 and SIGMAI is not equal to zero, then on exit:
-c          DR contains the real part of the Ritz values of OP computed by 
-c          DNAUPD. A further computation must be performed by the user
-c          to transform the Ritz values computed for OP by DNAUPD to those
-c          of the original system A*z = lambda*B*z. See remark 3 below.
-c
-c  DI      Double precision array of dimension NEV+1.  (OUTPUT)
-c          On exit, DI contains the imaginary part of the Ritz value 
-c          approximations to the eigenvalues of A*z = lambda*B*z associated
-c          with DR.
-c
-c          NOTE: When Ritz values are complex, they will come in complex 
-c                conjugate pairs.  If eigenvectors are requested, the 
-c                corresponding Ritz vectors will also come in conjugate 
-c                pairs and the real and imaginary parts of these are 
-c                represented in two consecutive columns of the array Z 
-c                (see below).
-c
-c  Z       Double precision N by NEV+1 array if RVEC = .TRUE. and HOWMNY = 'A'. (OUTPUT)
-c          On exit, if RVEC = .TRUE. and HOWMNY = 'A', then the columns of 
-c          Z represent approximate eigenvectors (Ritz vectors) corresponding 
-c          to the NCONV=IPARAM(5) Ritz values for eigensystem 
-c          A*z = lambda*B*z. 
-c 
-c          The complex Ritz vector associated with the Ritz value 
-c          with positive imaginary part is stored in two consecutive 
-c          columns.  The first column holds the real part of the Ritz 
-c          vector and the igraphsecond column holds the imaginary part.  The 
-c          Ritz vector associated with the Ritz value with negative 
-c          imaginary part is simply the complex conjugate of the Ritz vector 
-c          associated with the positive imaginary part.
-c
-c          If  RVEC = .FALSE. or HOWMNY = 'P', then Z is not referenced.
-c
-c          NOTE: If if RVEC = .TRUE. and a Schur basis is not required,
-c          the array Z may be set equal to first NEV+1 columns of the Arnoldi
-c          basis array V computed by DNAUPD.  In this case the Arnoldi basis
-c          will be destroyed and overwritten with the eigenvector basis.
-c
-c  LDZ     Integer.  (INPUT)
-c          The leading dimension of the array Z.  If Ritz vectors are
-c          desired, then  LDZ >= max( 1, N ).  In any case,  LDZ >= 1.
-c
-c  SIGMAR  Double precision  (INPUT)
-c          If IPARAM(7) = 3 or 4, represents the real part of the shift. 
-c          Not referenced if IPARAM(7) = 1 or 2.
-c
-c  SIGMAI  Double precision  (INPUT)
-c          If IPARAM(7) = 3 or 4, represents the imaginary part of the shift. 
-c          Not referenced if IPARAM(7) = 1 or 2. See remark 3 below.
-c
-c  WORKEV  Double precision work array of dimension 3*NCV.  (WORKSPACE)
-c
-c  **** The remaining arguments MUST be the same as for the   ****
-c  **** call to DNAUPD that was just completed.               ****
-c
-c  NOTE: The remaining arguments
-c
-c           BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, IPNTR,
-c           WORKD, WORKL, LWORKL, INFO
-c
-c         must be passed directly to DNEUPD following the last call
-c         to DNAUPD.  These arguments MUST NOT BE MODIFIED between
-c         the the last call to DNAUPD and the call to DNEUPD.
-c
-c  Three of these parameters (V, WORKL, INFO) are also output parameters:
-c
-c  V       Double precision N by NCV array.  (INPUT/OUTPUT)
-c
-c          Upon INPUT: the NCV columns of V contain the Arnoldi basis
-c                      vectors for OP as constructed by DNAUPD .
-c
-c          Upon OUTPUT: If RVEC = .TRUE. the first NCONV=IPARAM(5) columns
-c                       contain approximate Schur vectors that span the
-c                       desired invariant subspace.  See Remark 2 below.
-c
-c          NOTE: If the array Z has been set equal to first NEV+1 columns
-c          of the array V and RVEC=.TRUE. and HOWMNY= 'A', then the
-c          Arnoldi basis held by V has been overwritten by the desired
-c          Ritz vectors.  If a separate array Z has been passed then
-c          the first NCONV=IPARAM(5) columns of V will contain approximate
-c          Schur vectors that span the desired invariant subspace.
-c
-c  WORKL   Double precision work array of length LWORKL.  (OUTPUT/WORKSPACE)
-c          WORKL(1:ncv*ncv+3*ncv) contains information obtained in
-c          igraphdnaupd.  They are not changed by igraphdneupd.
-c          WORKL(ncv*ncv+3*ncv+1:3*ncv*ncv+6*ncv) holds the
-c          real and imaginary part of the untransformed Ritz values,
-c          the upper quasi-triangular matrix for H, and the
-c          associated matrix representation of the invariant subspace for H.
-c
-c          Note: IPNTR(9:13) contains the pointer into WORKL for addresses
-c          of the above information computed by igraphdneupd.
-c          -------------------------------------------------------------
-c          IPNTR(9):  pointer to the real part of the NCV RITZ values of the
-c                     original system.
-c          IPNTR(10): pointer to the imaginary part of the NCV RITZ values of
-c                     the original system.
-c          IPNTR(11): pointer to the NCV corresponding error bounds.
-c          IPNTR(12): pointer to the NCV by NCV upper quasi-triangular
-c                     Schur matrix for H.
-c          IPNTR(13): pointer to the NCV by NCV matrix of eigenvectors
-c                     of the upper Hessenberg matrix H. Only referenced by
-c                     igraphdneupd if RVEC = .TRUE. See Remark 2 below.
-c          -------------------------------------------------------------
-c
-c  INFO    Integer.  (OUTPUT)
-c          Error flag on output.
-c
-c          =  0: Normal exit.
-c
-c          =  1: The Schur form computed by LAPACK routine dlahqr
-c                could not be reordered by LAPACK routine dtrsen.
-c                Re-enter subroutine igraphdneupd with IPARAM(5)=NCV and 
-c                increase the size of the arrays DR and DI to have 
-c                dimension at least dimension NCV and allocate at least NCV 
-c                columns for Z. NOTE: Not necessary if Z and V share 
-c                the same space. Please notify the authors if this error
-c                occurs.
-c
-c          = -1: N must be positive.
-c          = -2: NEV must be positive.
-c          = -3: NCV-NEV >= 2 and less than or equal to N.
-c          = -5: WHICH must be one of 'LM', 'SM', 'LR', 'SR', 'LI', 'SI'
-c          = -6: BMAT must be one of 'I' or 'G'.
-c          = -7: Length of private work WORKL array is not sufficient.
-c          = -8: Error return from calculation of a real Schur form.
-c                Informational error from LAPACK routine dlahqr.
-c          = -9: Error return from calculation of eigenvectors.
-c                Informational error from LAPACK routine dtrevc.
-c          = -10: IPARAM(7) must be 1,2,3,4.
-c          = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatible.
-c          = -12: HOWMNY = 'S' not yet implemented
-c          = -13: HOWMNY must be one of 'A' or 'P' if RVEC = .true.
-c          = -14: DNAUPD did not find any eigenvalues to sufficient
-c                 accuracy.
-c
-c\BeginLib
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c  3. B.N. Parlett & Y. Saad, "Complex Shift and Invert Strategies for
-c     Real Matrices", Linear Algebra and its Applications, vol 88/89,
-c     pp 575-595, (1987).
-c
-c\Routines called:
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphdmout   ARPACK utility routine that prints matrices
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dgeqr2  LAPACK routine that computes the QR factorization of 
-c             a matrix.
-c     dlacpy  LAPACK matrix copy routine.
-c     dlahqr  LAPACK routine to compute the real Schur form of an
-c             upper Hessenberg matrix.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c     dlaset  LAPACK matrix initialization routine.
-c     dorm2r  LAPACK routine that applies an orthogonal matrix in 
-c             factored form.
-c     dtrevc  LAPACK routine to compute the eigenvectors of a matrix
-c             in upper quasi-triangular form.
-c     dtrsen  LAPACK routine that re-orders the Schur form.
-c     dtrmm   Level 3 BLAS matrix times an upper triangular matrix.
-c     dger    Level 2 BLAS rank one update to a matrix.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors.
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c     dscal   Level 1 BLAS that scales a vector.
-c
-c\Remarks
-c
-c  1. Currently only HOWMNY = 'A' and 'P' are implemented.
-c
-c     Let X' denote the transpose of X.
-c
-c  2. Schur vectors are an orthogonal representation for the basis of
-c     Ritz vectors. Thus, their numerical properties are often superior.
-c     If RVEC = .TRUE. then the relationship
-c             A * V(:,1:IPARAM(5)) = V(:,1:IPARAM(5)) * T, and
-c     V(:,1:IPARAM(5))' * V(:,1:IPARAM(5)) = I are approximately satisfied.
-c     Here T is the leading submatrix of order IPARAM(5) of the real 
-c     upper quasi-triangular matrix stored workl(ipntr(12)). That is,
-c     T is block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; 
-c     each 2-by-2 diagonal block has its diagonal elements equal and its
-c     off-diagonal elements of opposite sign.  Corresponding to each 2-by-2
-c     diagonal block is a complex conjugate pair of Ritz values. The real
-c     Ritz values are stored on the diagonal of T.
-c
-c  3. If IPARAM(7) = 3 or 4 and SIGMAI is not equal zero, then the user must
-c     form the IPARAM(5) Rayleigh quotients in order to transform the Ritz
-c     values computed by DNAUPD for OP to those of A*z = lambda*B*z. 
-c     Set RVEC = .true. and HOWMNY = 'A', and
-c     compute 
-c           Z(:,I)' * A * Z(:,I) if DI(I) = 0.
-c     If DI(I) is not equal to zero and DI(I+1) = - D(I), 
-c     then the desired real and imaginary parts of the Ritz value are
-c           Z(:,I)' * A * Z(:,I) +  Z(:,I+1)' * A * Z(:,I+1),
-c           Z(:,I)' * A * Z(:,I+1) -  Z(:,I+1)' * A * Z(:,I), respectively.
-c     Another possibility is to set RVEC = .true. and HOWMNY = 'P' and
-c     compute V(:,1:IPARAM(5))' * A * V(:,1:IPARAM(5)) and then an upper
-c     quasi-triangular matrix of order IPARAM(5) is computed. See remark
-c     2 above.
-c
-c\Authors
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Chao Yang                    Houston, Texas
-c     Dept. of Computational &
-c     Applied Mathematics          
-c     Rice University           
-c     Houston, Texas            
-c 
-c\SCCS Information: @(#) 
-c FILE: neupd.F   SID: 2.5   DATE OF SID: 7/31/96   RELEASE: 2 
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-      subroutine igraphdneupd (rvec, howmny, select, dr, di, z, ldz, 
-     &     sigmar, sigmai, workev, bmat, n, which, nev, tol, 
-     &     resid, ncv, v, ldv, iparam, ipntr, workd, 
-     &     workl, lworkl, info)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat, howmny, which*2
-      logical    rvec
-      integer    info, ldz, ldv, lworkl, n, ncv, nev
-      Double precision     
-     &           sigmar, sigmai, tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    iparam(11), ipntr(14)
-      logical    select(ncv)
-      Double precision
-     &           dr(nev+1), di(nev+1), resid(n), v(ldv,ncv), z(ldz,*), 
-     &           workd(3*n), workl(lworkl), workev(3*ncv)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      character  type*6
-      integer    bounds, ierr, ih, ihbds, iheigr, iheigi, iconj, nconv, 
-     &           invsub, iuptri, iwev, iwork(1), j, k, ktrord, 
-     &           ldh, ldq, mode, msglvl, outncv, ritzr, ritzi, wri, wrr,
-     &           irr, iri, ibd
-      logical    reord
-      Double precision
-     &           conds, rnorm, sep, temp, thres, vl(1,1), temp1, eps23
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, dger, dgeqr2, dlacpy, dlahqr, dlaset, 
-     &     igraphdmout, dorm2r, dtrevc, dtrmm, dtrsen, dscal, 
-     &     igraphdvout, igraphivout
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlapy2, dnrm2, dlamch, ddot
-      external   dlapy2, dnrm2, dlamch, ddot
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    abs, min, sqrt
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-c     %------------------------%
-c     | Set default parameters |
-c     %------------------------%
-c
-      msglvl = mneupd
-      mode = iparam(7)
-      nconv = iparam(5)
-      info = 0
-c
-c     %---------------------------------%
-c     | Get machine dependent constant. |
-c     %---------------------------------%
-c
-      eps23 = dlamch('Epsilon-Machine')
-      eps23 = eps23**(2.0D+0 / 3.0D+0)
-c
-c     %--------------%
-c     | Quick return |
-c     %--------------%
-c
-      ierr = 0
-c
-      if (nconv .le. 0) then
-         ierr = -14
-      else if (n .le. 0) then
-         ierr = -1
-      else if (nev .le. 0) then
-         ierr = -2
-      else if (ncv .le. nev+1 .or.  ncv .gt. n) then
-         ierr = -3
-      else if (which .ne. 'LM' .and.
-     &        which .ne. 'SM' .and.
-     &        which .ne. 'LR' .and.
-     &        which .ne. 'SR' .and.
-     &        which .ne. 'LI' .and.
-     &        which .ne. 'SI') then
-         ierr = -5
-      else if (bmat .ne. 'I' .and. bmat .ne. 'G') then
-         ierr = -6
-      else if (lworkl .lt. 3*ncv**2 + 6*ncv) then
-         ierr = -7
-      else if ( (howmny .ne. 'A' .and.
-     &           howmny .ne. 'P' .and.
-     &           howmny .ne. 'S') .and. rvec ) then
-         ierr = -13
-      else if (howmny .eq. 'S' ) then
-         ierr = -12
-      end if
-c     
-      if (mode .eq. 1 .or. mode .eq. 2) then
-         type = 'REGULR'
-      else if (mode .eq. 3 .and. sigmai .eq. zero) then
-         type = 'SHIFTI'
-      else if (mode .eq. 3 ) then
-         type = 'REALPT'
-      else if (mode .eq. 4 ) then
-         type = 'IMAGPT'
-      else 
-                                              ierr = -10
-      end if
-      if (mode .eq. 1 .and. bmat .eq. 'G')    ierr = -11
-c
-c     %------------%
-c     | Error Exit |
-c     %------------%
-c
-      if (ierr .ne. 0) then
-         info = ierr
-         go to 9000
-      end if
-c 
-c     %--------------------------------------------------------%
-c     | Pointer into WORKL for address of H, RITZ, BOUNDS, Q   |
-c     | etc... and the remaining workspace.                    |
-c     | Also update pointer to be used on output.              |
-c     | Memory is laid out as follows:                         |
-c     | workl(1:ncv*ncv) := generated Hessenberg matrix        |
-c     | workl(ncv*ncv+1:ncv*ncv+2*ncv) := real and imaginary   |
-c     |                                   parts of ritz values |
-c     | workl(ncv*ncv+2*ncv+1:ncv*ncv+3*ncv) := error bounds   |
-c     %--------------------------------------------------------%
-c
-c     %-----------------------------------------------------------%
-c     | The following is used and set by DNEUPD.                  |
-c     | workl(ncv*ncv+3*ncv+1:ncv*ncv+4*ncv) := The untransformed |
-c     |                             real part of the Ritz values. |
-c     | workl(ncv*ncv+4*ncv+1:ncv*ncv+5*ncv) := The untransformed |
-c     |                        imaginary part of the Ritz values. |
-c     | workl(ncv*ncv+5*ncv+1:ncv*ncv+6*ncv) := The untransformed |
-c     |                           error bounds of the Ritz values |
-c     | workl(ncv*ncv+6*ncv+1:2*ncv*ncv+6*ncv) := Holds the upper |
-c     |                             quasi-triangular matrix for H |
-c     | workl(2*ncv*ncv+6*ncv+1: 3*ncv*ncv+6*ncv) := Holds the    |
-c     |       associated matrix representation of the invariant   |
-c     |       subspace for H.                                     |
-c     | GRAND total of NCV * ( 3 * NCV + 6 ) locations.           |
-c     %-----------------------------------------------------------%
-c     
-      ih     = ipntr(5)
-      ritzr  = ipntr(6)
-      ritzi  = ipntr(7)
-      bounds = ipntr(8)
-      ldh    = ncv
-      ldq    = ncv
-      iheigr = bounds + ldh
-      iheigi = iheigr + ldh
-      ihbds  = iheigi + ldh
-      iuptri = ihbds  + ldh
-      invsub = iuptri + ldh*ncv
-      ipntr(9)  = iheigr
-      ipntr(10) = iheigi
-      ipntr(11) = ihbds
-      ipntr(12) = iuptri
-      ipntr(13) = invsub
-      wrr = 1
-      wri = ncv + 1
-      iwev = wri + ncv
-c
-c     %-----------------------------------------%
-c     | irr points to the REAL part of the Ritz |
-c     |     values computed by _neigh before    |
-c     |     exiting _naup2.                     |
-c     | iri points to the IMAGINARY part of the |
-c     |     Ritz values computed by _neigh      |
-c     |     before exiting _naup2.              |
-c     | ibd points to the Ritz estimates        |
-c     |     computed by _neigh before exiting   |
-c     |     _naup2.                             |
-c     %-----------------------------------------%
-c
-      irr = ipntr(14)+ncv*ncv
-      iri = irr+ncv
-      ibd = iri+ncv
-c
-c     %------------------------------------%
-c     | RNORM is B-norm of the RESID(1:N). |
-c     %------------------------------------%
-c
-      rnorm = workl(ih+2)
-      workl(ih+2) = zero
-c     
-      if (rvec) then
-c     
-c        %-------------------------------------------%
-c        | Get converged Ritz value on the boundary. |
-c        | Note: converged Ritz values have been     |
-c        | placed in the first NCONV locations in    |
-c        | workl(ritzr) and workl(ritzi).  They have |
-c        | been sorted (in _naup2) according to the  |
-c        | WHICH selection criterion.                |
-c        %-------------------------------------------%
-c
-         if (which .eq. 'LM' .or. which .eq. 'SM') then
-            thres = dlapy2( workl(ritzr), workl(ritzi) )
-         else if (which .eq. 'LR' .or. which .eq. 'SR') then
-            thres = workl(ritzr)
-         else if (which .eq. 'LI' .or. which .eq. 'SI') then
-            thres = abs( workl(ritzi) )
-         end if
-c
-         if (msglvl .gt. 2) then
-            call igraphdvout(logfil, 1, thres, ndigit,
-     &           '_neupd: Threshold eigenvalue used for re-ordering')
-         end if
-c
-c        %----------------------------------------------------------%
-c        | Check to see if all converged Ritz values appear at the  |
-c        | top of the upper quasi-triangular matrix computed by     |
-c        | _neigh in _naup2.  This is done in the following way:    |
-c        |                                                          |
-c        | 1) For each Ritz value obtained from _neigh, compare it  |
-c        |    with the threshold Ritz value computed above to       |
-c        |    determine whether it is a wanted one.                 |
-c        |                                                          | 
-c        | 2) If it is wanted, then check the corresponding Ritz    |
-c        |    estimate to see if it has converged.  If it has, set  |
-c        |    correponding entry in the logical array SELECT to     |
-c        |    .TRUE..                                               |
-c        |                                                          |
-c        | If SELECT(j) = .TRUE. and j > NCONV, then there is a     |
-c        | converged Ritz value that does not appear at the top of  |
-c        | the upper quasi-triangular matrix computed by _neigh in  |
-c        | _naup2.  Reordering is needed.                           |
-c        %----------------------------------------------------------%
-c
-         reord = .false.
-         ktrord = 0
-         do 10 j = 0, ncv-1
-            select(j+1) = .false.
-            if (which .eq. 'LM') then
-               if (dlapy2(workl(irr+j), workl(iri+j))
-     &            .ge. thres) then
-                  temp1 = max( eps23, 
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            else if (which .eq. 'SM') then
-               if (dlapy2(workl(irr+j), workl(iri+j))
-     &            .le. thres) then
-                  temp1 = max( eps23,
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            else if (which .eq. 'LR') then
-               if (workl(irr+j) .ge. thres) then
-                  temp1 = max( eps23,
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            else if (which .eq. 'SR') then
-               if (workl(irr+j) .le. thres) then
-                  temp1 = max( eps23,
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            else if (which .eq. 'LI') then
-               if (abs(workl(iri+j)) .ge. thres) then
-                  temp1 = max( eps23,
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            else if (which .eq. 'SI') then
-               if (abs(workl(iri+j)) .le. thres) then
-                  temp1 = max( eps23,
-     &                         dlapy2( workl(irr+j), workl(iri+j) ) )
-                  if (workl(ibd+j) .le. tol*temp1)
-     &               select(j+1) = .true.
-               end if
-            end if
-            if (j+1 .gt. nconv ) reord = ( select(j+1) .or. reord )
-            if (select(j+1)) ktrord = ktrord + 1
- 10      continue 
-c
-         if (msglvl .gt. 2) then
-             call igraphivout(logfil, 1, ktrord, ndigit,
-     &            '_neupd: Number of specified eigenvalues')
-             call igraphivout(logfil, 1, nconv, ndigit,
-     &            '_neupd: Number of "converged" eigenvalues')
-         end if
-c
-c        %-----------------------------------------------------------%
-c        | Call LAPACK routine dlahqr to compute the real Schur form |
-c        | of the upper Hessenberg matrix returned by DNAUPD.        |
-c        | Make a copy of the upper Hessenberg matrix.               |
-c        | Initialize the Schur vector matrix Q to the identity.     |
-c        %-----------------------------------------------------------%
-c     
-         call dcopy (ldh*ncv, workl(ih), 1, workl(iuptri), 1)
-         call dlaset ('All', ncv, ncv, zero, one, workl(invsub), ldq)
-         call dlahqr (.true., .true., ncv, 1, ncv, workl(iuptri), ldh,
-     &        workl(iheigr), workl(iheigi), 1, ncv, 
-     &        workl(invsub), ldq, ierr)
-         call dcopy (ncv, workl(invsub+ncv-1), ldq, workl(ihbds), 1)
-c     
-         if (ierr .ne. 0) then
-            info = -8
-            go to 9000
-         end if
-c     
-         if (msglvl .gt. 1) then
-            call igraphdvout (logfil, ncv, workl(iheigr), ndigit,
-     &           '_neupd: Real part of the eigenvalues of H')
-            call igraphdvout (logfil, ncv, workl(iheigi), ndigit,
-     &           '_neupd: Imaginary part of the Eigenvalues of H')
-            call igraphdvout (logfil, ncv, workl(ihbds), ndigit,
-     &           '_neupd: Last row of the Schur vector matrix')
-            if (msglvl .gt. 3) then
-               call igraphdmout (logfil, ncv, ncv, workl(iuptri), ldh, 
-     &              ndigit,
-     &              '_neupd: The upper quasi-triangular matrix ')
-            end if
-         end if 
-c
-         if (reord) then
-c     
-c           %-----------------------------------------------------%
-c           | Reorder the computed upper quasi-triangular matrix. | 
-c           %-----------------------------------------------------%
-c     
-            call dtrsen ('None', 'V', select, ncv, workl(iuptri), ldh, 
-     &           workl(invsub), ldq, workl(iheigr), workl(iheigi), 
-     &           nconv, conds, sep, workl(ihbds), ncv, iwork, 1, ierr)
-c
-            if (ierr .eq. 1) then
-               info = 1
-               go to 9000
-            end if
-c
-            if (msglvl .gt. 2) then
-                call igraphdvout (logfil, ncv, workl(iheigr), ndigit,
-     &           '_neupd: Real part of the eigenvalues of H--reordered')
-                call igraphdvout (logfil, ncv, workl(iheigi), ndigit,
-     &           '_neupd: Imag part of the eigenvalues of H--reordered')
-                if (msglvl .gt. 3) then
-                   call igraphdmout (logfil, ncv, ncv, workl(iuptri), 
-     &                  ldq, ndigit,
-     &              '_neupd: Quasi-triangular matrix after re-ordering')
-                end if
-            end if
-c     
-         end if
-c
-c        %---------------------------------------%
-c        | Copy the last row of the Schur vector |
-c        | into workl(ihbds).  This will be used |
-c        | to compute the Ritz estimates of      |
-c        | converged Ritz values.                |
-c        %---------------------------------------%
-c
-         call dcopy(ncv, workl(invsub+ncv-1), ldq, workl(ihbds), 1)
-c
-c        %----------------------------------------------------%
-c        | Place the computed eigenvalues of H into DR and DI |
-c        | if a spectral transformation was not used.         |
-c        %----------------------------------------------------%
-c
-         if (type .eq. 'REGULR') then 
-            call dcopy (nconv, workl(iheigr), 1, dr, 1)
-            call dcopy (nconv, workl(iheigi), 1, di, 1)
-         end if
-c     
-c        %----------------------------------------------------------%
-c        | Compute the QR factorization of the matrix representing  |
-c        | the wanted invariant subspace located in the first NCONV |
-c        | columns of workl(invsub,ldq).                            |
-c        %----------------------------------------------------------%
-c     
-         call dgeqr2 (ncv, nconv, workl(invsub), ldq, workev, 
-     &        workev(ncv+1), ierr)
-c
-c        %---------------------------------------------------------%
-c        | * Postmultiply V by Q using dorm2r.                     |   
-c        | * Copy the first NCONV columns of VQ into Z.            |
-c        | * Postmultiply Z by R.                                  |
-c        | The N by NCONV matrix Z is now a matrix representation  |
-c        | of the approximate invariant subspace associated with   |
-c        | the Ritz values in workl(iheigr) and workl(iheigi)      |
-c        | The first NCONV columns of V are now approximate Schur  |
-c        | vectors associated with the real upper quasi-triangular |
-c        | matrix of order NCONV in workl(iuptri)                  |
-c        %---------------------------------------------------------%
-c     
-         call dorm2r ('Right', 'Notranspose', n, ncv, nconv,
-     &        workl(invsub), ldq, workev, v, ldv, workd(n+1), ierr)
-         call dlacpy ('All', n, nconv, v, ldv, z, ldz)
-c
-         do 20 j=1, nconv
-c     
-c           %---------------------------------------------------%
-c           | Perform both a column and row scaling if the      |
-c           | diagonal element of workl(invsub,ldq) is negative |
-c           | I'm lazy and don't take advantage of the upper    |
-c           | quasi-triangular form of workl(iuptri,ldq)        |
-c           | Note that since Q is orthogonal, R is a diagonal  |
-c           | matrix consisting of plus or minus ones           |
-c           %---------------------------------------------------%
-c     
-            if (workl(invsub+(j-1)*ldq+j-1) .lt. zero) then
-               call dscal (nconv, -one, workl(iuptri+j-1), ldq)
-               call dscal (nconv, -one, workl(iuptri+(j-1)*ldq), 1)
-            end if
-c     
- 20      continue
-c     
-         if (howmny .eq. 'A') then
-c     
-c           %--------------------------------------------%
-c           | Compute the NCONV wanted eigenvectors of T | 
-c           | located in workl(iuptri,ldq).              |
-c           %--------------------------------------------%
-c     
-            do 30 j=1, ncv
-               if (j .le. nconv) then
-                  select(j) = .true.
-               else
-                  select(j) = .false.
-               end if
- 30         continue
-c
-            call dtrevc ('Right', 'Select', select, ncv, workl(iuptri), 
-     &           ldq, vl, 1, workl(invsub), ldq, ncv, outncv, workev,
-     &           ierr)
-c
-            if (ierr .ne. 0) then
-                info = -9
-                go to 9000
-            end if
-c     
-c           %------------------------------------------------%
-c           | Scale the returning eigenvectors so that their |
-c           | Euclidean norms are all one. LAPACK subroutine |
-c           | dtrevc returns each eigenvector normalized so  |
-c           | that the element of largest magnitude has      |
-c           | magnitude 1;                                   |
-c           %------------------------------------------------%
-c     
-            iconj = 0
-            do 40 j=1, nconv
-c
-               if ( workl(iheigi+j-1) .eq. zero ) then
-c     
-c                 %----------------------%
-c                 | real eigenvalue case |
-c                 %----------------------%
-c     
-                  temp = dnrm2( ncv, workl(invsub+(j-1)*ldq), 1 )
-                  call dscal ( ncv, one / temp, 
-     &                 workl(invsub+(j-1)*ldq), 1 )
-c
-               else
-c     
-c                 %-------------------------------------------%
-c                 | Complex conjugate pair case. Note that    |
-c                 | since the real and imaginary part of      |
-c                 | the eigenvector are stored in consecutive |
-c                 | columns, we further normalize by the      |
-c                 | square root of two.                       |
-c                 %-------------------------------------------%
-c
-                  if (iconj .eq. 0) then
-                     temp = dlapy2( dnrm2( ncv, workl(invsub+(j-1)*ldq),
-     &                      1 ), dnrm2( ncv, workl(invsub+j*ldq),  1) )
-                     call dscal ( ncv, one / temp, 
-     &                      workl(invsub+(j-1)*ldq), 1 )
-                     call dscal ( ncv, one / temp, 
-     &                      workl(invsub+j*ldq), 1 )
-                     iconj = 1
-                  else
-                     iconj = 0
-                  end if
-c
-               end if
-c
- 40         continue
-c
-            call dgemv('T', ncv, nconv, one, workl(invsub),
-     &                ldq, workl(ihbds), 1, zero,  workev, 1)
-c
-            iconj = 0
-            do 45 j=1, nconv
-               if (workl(iheigi+j-1) .ne. zero) then
-c
-c                 %-------------------------------------------%
-c                 | Complex conjugate pair case. Note that    |
-c                 | since the real and imaginary part of      |
-c                 | the eigenvector are stored in consecutive |
-c                 %-------------------------------------------%
-c
-                  if (iconj .eq. 0) then
-                     workev(j) = dlapy2(workev(j), workev(j+1))
-                     workev(j+1) = workev(j)
-                     iconj = 1
-                  else
-                     iconj = 0
-                  end if
-               end if
- 45         continue
-c
-            if (msglvl .gt. 2) then
-               call dcopy(ncv, workl(invsub+ncv-1), ldq,
-     &                    workl(ihbds), 1)
-               call igraphdvout (logfil, ncv, workl(ihbds), ndigit,
-     &              '_neupd: Last row of the eigenvector matrix for T')
-               if (msglvl .gt. 3) then
-                  call igraphdmout (logfil, ncv, ncv, workl(invsub), 
-     &                 ldq, ndigit, 
-     &                 '_neupd: The eigenvector matrix for T')
-               end if
-            end if
-c
-c           %---------------------------------------%
-c           | Copy Ritz estimates into workl(ihbds) |
-c           %---------------------------------------%
-c
-            call dcopy(nconv, workev, 1, workl(ihbds), 1)
-c
-c           %---------------------------------------------------------%
-c           | Compute the QR factorization of the eigenvector matrix  |
-c           | associated with leading portion of T in the first NCONV |
-c           | columns of workl(invsub,ldq).                           |
-c           %---------------------------------------------------------%
-c     
-            call dgeqr2 (ncv, nconv, workl(invsub), ldq, workev, 
-     &                   workev(ncv+1), ierr)
-c     
-c           %----------------------------------------------%
-c           | * Postmultiply Z by Q.                       |   
-c           | * Postmultiply Z by R.                       |
-c           | The N by NCONV matrix Z is now contains the  | 
-c           | Ritz vectors associated with the Ritz values |
-c           | in workl(iheigr) and workl(iheigi).          |
-c           %----------------------------------------------%
-c     
-            call dorm2r ('Right', 'Notranspose', n, ncv, nconv,
-     &           workl(invsub), ldq, workev, z, ldz, workd(n+1), ierr)
-c     
-            call dtrmm ('Right', 'Upper', 'No transpose', 'Non-unit',
-     &                  n, nconv, one, workl(invsub), ldq, z, ldz)
-c     
-         end if
-c     
-      else 
-c
-c        %------------------------------------------------------%
-c        | An approximate invariant subspace is not needed.     |
-c        | Place the Ritz values computed DNAUPD into DR and DI |
-c        %------------------------------------------------------%
-c
-         call dcopy (nconv, workl(ritzr), 1, dr, 1)
-         call dcopy (nconv, workl(ritzi), 1, di, 1)
-         call dcopy (nconv, workl(ritzr), 1, workl(iheigr), 1)
-         call dcopy (nconv, workl(ritzi), 1, workl(iheigi), 1)
-         call dcopy (nconv, workl(bounds), 1, workl(ihbds), 1)
-      end if
-c 
-c     %------------------------------------------------%
-c     | Transform the Ritz values and possibly vectors |
-c     | and corresponding error bounds of OP to those  |
-c     | of A*x = lambda*B*x.                           |
-c     %------------------------------------------------%
-c
-      if (type .eq. 'REGULR') then
-c
-         if (rvec) 
-     &      call dscal (ncv, rnorm, workl(ihbds), 1)     
-c     
-      else 
-c     
-c        %---------------------------------------%
-c        |   A spectral transformation was used. |
-c        | * Determine the Ritz estimates of the |
-c        |   Ritz values in the original system. |
-c        %---------------------------------------%
-c     
-         if (type .eq. 'SHIFTI') then
-c
-            if (rvec) 
-     &         call dscal (ncv, rnorm, workl(ihbds), 1)
-c
-            do 50 k=1, ncv
-               temp = dlapy2( workl(iheigr+k-1), 
-     &                        workl(iheigi+k-1) )
-               workl(ihbds+k-1) = abs( workl(ihbds+k-1) ) 
-     &                          / temp / temp
- 50         continue
-c
-         else if (type .eq. 'REALPT') then
-c
-            do 60 k=1, ncv
- 60         continue
-c
-         else if (type .eq. 'IMAGPT') then
-c
-            do 70 k=1, ncv
- 70         continue
-c
-         end if
-c     
-c        %-----------------------------------------------------------%
-c        | *  Transform the Ritz values back to the original system. |
-c        |    For TYPE = 'SHIFTI' the transformation is              |
-c        |             lambda = 1/theta + sigma                      |
-c        |    For TYPE = 'REALPT' or 'IMAGPT' the user must from     |
-c        |    Rayleigh quotients or a projection. See remark 3 above.| 
-c        | NOTES:                                                    |
-c        | *The Ritz vectors are not affected by the transformation. |
-c        %-----------------------------------------------------------%
-c     
-         if (type .eq. 'SHIFTI') then 
-c
-            do 80 k=1, ncv
-               temp = dlapy2( workl(iheigr+k-1), 
-     &                        workl(iheigi+k-1) )
-               workl(iheigr+k-1) = workl(iheigr+k-1) / temp / temp 
-     &                           + sigmar   
-               workl(iheigi+k-1) = -workl(iheigi+k-1) / temp / temp
-     &                           + sigmai   
- 80         continue
-c
-            call dcopy (nconv, workl(iheigr), 1, dr, 1)
-            call dcopy (nconv, workl(iheigi), 1, di, 1)
-c
-         else if (type .eq. 'REALPT' .or. type .eq. 'IMAGPT') then
-c
-            call dcopy (nconv, workl(iheigr), 1, dr, 1)
-            call dcopy (nconv, workl(iheigi), 1, di, 1)
-c
-         end if
-c
-      end if
-c
-      if (type .eq. 'SHIFTI' .and. msglvl .gt. 1) then
-         call igraphdvout (logfil, nconv, dr, ndigit,
-     &   '_neupd: Untransformed real part of the Ritz valuess.')
-         call igraphdvout (logfil, nconv, di, ndigit,
-     &   '_neupd: Untransformed imag part of the Ritz valuess.')
-         call igraphdvout (logfil, nconv, workl(ihbds), ndigit,
-     &   '_neupd: Ritz estimates of untransformed Ritz values.')
-      else if (type .eq. 'REGULR' .and. msglvl .gt. 1) then
-         call igraphdvout (logfil, nconv, dr, ndigit,
-     &   '_neupd: Real parts of converged Ritz values.')
-         call igraphdvout (logfil, nconv, di, ndigit,
-     &   '_neupd: Imag parts of converged Ritz values.')
-         call igraphdvout (logfil, nconv, workl(ihbds), ndigit,
-     &   '_neupd: Associated Ritz estimates.')
-      end if
-c 
-c     %-------------------------------------------------%
-c     | Eigenvector Purification step. Formally perform |
-c     | one of inverse subspace iteration. Only used    |
-c     | for MODE = 2.                                   |
-c     %-------------------------------------------------%
-c
-      if (rvec .and. howmny .eq. 'A' .and. type .eq. 'SHIFTI') then
-c
-c        %------------------------------------------------%
-c        | Purify the computed Ritz vectors by adding a   |
-c        | little bit of the residual vector:             |
-c        |                      T                         |
-c        |          resid(:)*( e    s ) / theta           |
-c        |                      NCV                       |
-c        | where H s = s theta. Remember that when theta  |
-c        | has nonzero imaginary part, the corresponding  |
-c        | Ritz vector is stored across two columns of Z. |
-c        %------------------------------------------------%
-c
-         iconj = 0
-         do 110 j=1, nconv
-            if (workl(iheigi+j-1) .eq. zero) then
-               workev(j) =  workl(invsub+(j-1)*ldq+ncv-1) /
-     &                      workl(iheigr+j-1)
-            else if (iconj .eq. 0) then
-               temp = dlapy2( workl(iheigr+j-1), workl(iheigi+j-1) )
-               workev(j) = ( workl(invsub+(j-1)*ldq+ncv-1) * 
-     &                       workl(iheigr+j-1) +
-     &                       workl(invsub+j*ldq+ncv-1) * 
-     &                       workl(iheigi+j-1) ) / temp / temp
-               workev(j+1) = ( workl(invsub+j*ldq+ncv-1) * 
-     &                         workl(iheigr+j-1) -
-     &                         workl(invsub+(j-1)*ldq+ncv-1) * 
-     &                         workl(iheigi+j-1) ) / temp / temp
-               iconj = 1
-            else
-               iconj = 0
-            end if
- 110     continue
-c
-c        %---------------------------------------%
-c        | Perform a rank one update to Z and    |
-c        | purify all the Ritz vectors together. |
-c        %---------------------------------------%
-c
-         call dger (n, nconv, one, resid, 1, workev, 1, z, ldz)
-c
-      end if
-c
- 9000 continue
-c
-      return
-c     
-c     %---------------%
-c     | End of DNEUPD |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dngets.f igraph-0.6.5/interfaces/R/arpack/dngets.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dngets.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dngets.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,231 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdngets
-c
-c\Description: 
-c  Given the eigenvalues of the upper Hessenberg matrix H,
-c  computes the NP shifts AMU that are zeros of the polynomial of 
-c  degree NP which filters out components of the unwanted eigenvectors
-c  corresponding to the AMU's based on some given criteria.
-c
-c  NOTE: call this even in the case of user specified shifts in order
-c  to sort the eigenvalues, and error bounds of H for later use.
-c
-c\Usage:
-c  call igraphdngets
-c     ( ISHIFT, WHICH, KEV, NP, RITZR, RITZI, BOUNDS, SHIFTR, SHIFTI )
-c
-c\Arguments
-c  ISHIFT  Integer.  (INPUT)
-c          Method for selecting the implicit shifts at each iteration.
-c          ISHIFT = 0: user specified shifts
-c          ISHIFT = 1: exact shift with respect to the matrix H.
-c
-c  WHICH   Character*2.  (INPUT)
-c          Shift selection criteria.
-c          'LM' -> want the KEV eigenvalues of largest magnitude.
-c          'SM' -> want the KEV eigenvalues of smallest magnitude.
-c          'LR' -> want the KEV eigenvalues of largest real part.
-c          'SR' -> want the KEV eigenvalues of smallest real part.
-c          'LI' -> want the KEV eigenvalues of largest imaginary part.
-c          'SI' -> want the KEV eigenvalues of smallest imaginary part.
-c
-c  KEV      Integer.  (INPUT/OUTPUT)
-c           INPUT: KEV+NP is the size of the matrix H.
-c           OUTPUT: Possibly increases KEV by one to keep complex conjugate
-c           pairs together.
-c
-c  NP       Integer.  (INPUT/OUTPUT)
-c           Number of implicit shifts to be computed.
-c           OUTPUT: Possibly decreases NP by one to keep complex conjugate
-c           pairs together.
-c
-c  RITZR,  Double precision array of length KEV+NP.  (INPUT/OUTPUT)
-c  RITZI   On INPUT, RITZR and RITZI contain the real and imaginary 
-c          parts of the eigenvalues of H.
-c          On OUTPUT, RITZR and RITZI are sorted so that the unwanted
-c          eigenvalues are in the first NP locations and the wanted
-c          portion is in the last KEV locations.  When exact shifts are 
-c          selected, the unwanted part corresponds to the shifts to 
-c          be applied. Also, if ISHIFT .eq. 1, the unwanted eigenvalues
-c          are further sorted so that the ones with largest Ritz values
-c          are first.
-c
-c  BOUNDS  Double precision array of length KEV+NP.  (INPUT/OUTPUT)
-c          Error bounds corresponding to the ordering in RITZ.
-c
-c  SHIFTR, SHIFTI  *** USE deprecated as of version 2.1. ***
-c  
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphdsortc  ARPACK sorting routine.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: ngets.F   SID: 2.3   DATE OF SID: 4/20/96   RELEASE: 2
-c
-c\Remarks
-c     1. xxxx
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdngets ( ishift, which, kev, np, ritzr, ritzi,
-     &     bounds, shiftr, shifti )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character*2 which
-      integer    ishift, kev, np
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           bounds(kev+np), ritzr(kev+np), ritzi(kev+np), 
-     &           shiftr(1), shifti(1)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0, zero = 0.0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    msglvl
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, igraphdsortc, igraphsecond
-c
-c     %----------------------%
-c     | Intrinsics Functions |
-c     %----------------------%
-c
-      intrinsic  abs
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------%
-c 
-      call igraphsecond (t0)
-      msglvl = mngets
-c 
-c     %----------------------------------------------------%
-c     | LM, SM, LR, SR, LI, SI case.                       |
-c     | Sort the eigenvalues of H into the desired order   |
-c     | and apply the resulting order to BOUNDS.           |
-c     | The eigenvalues are sorted so that the wanted part |
-c     | are always in the last KEV locations.              |
-c     | We first do a pre-processing sort in order to keep |
-c     | complex conjugate pairs together                   |
-c     %----------------------------------------------------%
-c
-      if (which .eq. 'LM') then
-         call igraphdsortc ('LR', .true., kev+np, ritzr, ritzi, bounds)
-      else if (which .eq. 'SM') then
-         call igraphdsortc ('SR', .true., kev+np, ritzr, ritzi, bounds)
-      else if (which .eq. 'LR') then
-         call igraphdsortc ('LM', .true., kev+np, ritzr, ritzi, bounds)
-      else if (which .eq. 'SR') then
-         call igraphdsortc ('SM', .true., kev+np, ritzr, ritzi, bounds)
-      else if (which .eq. 'LI') then
-         call igraphdsortc ('LM', .true., kev+np, ritzr, ritzi, bounds)
-      else if (which .eq. 'SI') then
-         call igraphdsortc ('SM', .true., kev+np, ritzr, ritzi, bounds)
-      end if
-c      
-      call igraphdsortc (which, .true., kev+np, ritzr, ritzi, bounds)
-c     
-c     %-------------------------------------------------------%
-c     | Increase KEV by one if the ( ritzr(np),ritzi(np) )    |
-c     | = ( ritzr(np+1),-ritzi(np+1) ) and ritz(np) .ne. zero |
-c     | Accordingly decrease NP by one. In other words keep   |
-c     | complex conjugate pairs together.                     |
-c     %-------------------------------------------------------%
-c     
-      if (       ( ritzr(np+1) - ritzr(np) ) .eq. zero
-     &     .and. ( ritzi(np+1) + ritzi(np) ) .eq. zero ) then
-         np = np - 1
-         kev = kev + 1
-      end if
-c
-      if ( ishift .eq. 1 ) then
-c     
-c        %-------------------------------------------------------%
-c        | Sort the unwanted Ritz values used as shifts so that  |
-c        | the ones with largest Ritz estimates are first        |
-c        | This will tend to minimize the effects of the         |
-c        | forward instability of the iteration when they shifts |
-c        | are applied in subroutine igraphdnapps.                     |
-c        | Be careful and use 'SR' since we want to sort BOUNDS! |
-c        %-------------------------------------------------------%
-c     
-         call igraphdsortc ( 'SR', .true., np, bounds, ritzr, ritzi )
-      end if
-c     
-      call igraphsecond (t1)
-      tngets = tngets + (t1 - t0)
-c
-      if (msglvl .gt. 0) then
-         call igraphivout (logfil, 1, kev, ndigit, '_ngets: KEV is')
-         call igraphivout (logfil, 1, np, ndigit, '_ngets: NP is')
-         call igraphdvout (logfil, kev+np, ritzr, ndigit,
-     &        '_ngets: Eigenvalues of current H matrix -- real part')
-         call igraphdvout (logfil, kev+np, ritzi, ndigit,
-     &        '_ngets: Eigenvalues of current H matrix -- imag part')
-         call igraphdvout (logfil, kev+np, bounds, ndigit, 
-     &      '_ngets: Ritz estimates of the current KEV+NP Ritz values')
-      end if
-c     
-      return
-c     
-c     %---------------%
-c     | End of igraphdngets |
-c     %---------------%
-c     
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsaitr.f igraph-0.6.5/interfaces/R/arpack/dsaitr.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsaitr.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsaitr.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,854 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsaitr
-c
-c\Description: 
-c  Reverse communication interface for applying NP additional steps to 
-c  a K step symmetric Arnoldi factorization.
-c
-c  Input:  OP*V_{k}  -  V_{k}*H = r_{k}*e_{k}^T
-c
-c          with (V_{k}^T)*B*V_{k} = I, (V_{k}^T)*B*r_{k} = 0.
-c
-c  Output: OP*V_{k+p}  -  V_{k+p}*H = r_{k+p}*e_{k+p}^T
-c
-c          with (V_{k+p}^T)*B*V_{k+p} = I, (V_{k+p}^T)*B*r_{k+p} = 0.
-c
-c  where OP and B are as in igraphdsaupd.  The B-norm of r_{k+p} is also
-c  computed and returned.
-c
-c\Usage:
-c  call igraphdsaitr
-c     ( IDO, BMAT, N, K, NP, MODE, RESID, RNORM, V, LDV, H, LDH, 
-c       IPNTR, WORKD, INFO )
-c
-c\Arguments
-c  IDO     Integer.  (INPUT/OUTPUT)
-c          Reverse communication flag.
-c          -------------------------------------------------------------
-c          IDO =  0: first call to the reverse communication interface
-c          IDO = -1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y.
-c                    This is for the restart phase to force the new
-c                    starting vector into the range of OP.
-c          IDO =  1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y,
-c                    IPNTR(3) is the pointer into WORK for B * X.
-c          IDO =  2: compute  Y = B * X  where
-c                    IPNTR(1) is the pointer into WORK for X,
-c                    IPNTR(2) is the pointer into WORK for Y.
-c          IDO = 99: done
-c          -------------------------------------------------------------
-c          When the routine is used in the "shift-and-invert" mode, the
-c          vector B * Q is already available and does not need to be
-c          recomputed in forming OP * Q.
-c
-c  BMAT    Character*1.  (INPUT)
-c          BMAT specifies the type of matrix B that defines the
-c          semi-inner product for the operator OP.  See igraphdsaupd.
-c          B = 'I' -> standard eigenvalue problem A*x = lambda*x
-c          B = 'G' -> generalized eigenvalue problem A*x = lambda*M*x
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the eigenproblem.
-c
-c  K       Integer.  (INPUT)
-c          Current order of H and the number of columns of V.
-c
-c  NP      Integer.  (INPUT)
-c          Number of additional Arnoldi steps to take.
-c
-c  MODE    Integer.  (INPUT)
-c          Signifies which form for "OP". If MODE=2 then
-c          a reduction in the number of B matrix vector multiplies
-c          is possible since the B-norm of OP*x is equivalent to
-c          the inv(B)-norm of A*x.
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          On INPUT:  RESID contains the residual vector r_{k}.
-c          On OUTPUT: RESID contains the residual vector r_{k+p}.
-c
-c  RNORM   Double precision scalar.  (INPUT/OUTPUT)
-c          On INPUT the B-norm of r_{k}.
-c          On OUTPUT the B-norm of the updated residual r_{k+p}.
-c
-c  V       Double precision N by K+NP array.  (INPUT/OUTPUT)
-c          On INPUT:  V contains the Arnoldi vectors in the first K 
-c          columns.
-c          On OUTPUT: V contains the new NP Arnoldi vectors in the next
-c          NP columns.  The first K columns are unchanged.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling 
-c          program.
-c
-c  H       Double precision (K+NP) by 2 array.  (INPUT/OUTPUT)
-c          H is used to store the generated symmetric tridiagonal matrix
-c          with the subdiagonal in the first column starting at H(2,1)
-c          and the main diagonal in the igraphsecond column.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling 
-c          program.
-c
-c  IPNTR   Integer array of length 3.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORK for 
-c          vectors used by the Arnoldi iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X.
-c          IPNTR(2): pointer to the current result vector Y.
-c          IPNTR(3): pointer to the vector B * X when used in the 
-c                    shift-and-invert mode.  X is the current operand.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (REVERSE COMMUNICATION)
-c          Distributed array to be used in the basic Arnoldi iteration
-c          for reverse communication.  The calling program should not 
-c          use WORKD as temporary workspace during the iteration !!!!!!
-c          On INPUT, WORKD(1:N) = B*RESID where RESID is associated
-c          with the K step Arnoldi factorization. Used to save some 
-c          computation at the first step. 
-c          On OUTPUT, WORKD(1:N) = B*RESID where RESID is associated
-c          with the K+NP step Arnoldi factorization.
-c
-c  INFO    Integer.  (OUTPUT)
-c          = 0: Normal exit.
-c          > 0: Size of an invariant subspace of OP is found that is
-c               less than K + NP.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphdgetv0  ARPACK routine to generate the initial vector.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphdmout   ARPACK utility routine that prints matrices.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlascl  LAPACK routine for careful scaling of a matrix.
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     daxpy   Level 1 BLAS that computes a vector triad.
-c     dscal   Level 1 BLAS that scales a vector.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors. 
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c 
-c\Revision history:
-c     xx/xx/93: Version ' 2.4'
-c
-c\SCCS Information: @(#) 
-c FILE: saitr.F   SID: 2.6   DATE OF SID: 8/28/96   RELEASE: 2
-c
-c\Remarks
-c  The algorithm implemented is:
-c  
-c  restart = .false.
-c  Given V_{k} = [v_{1}, ..., v_{k}], r_{k}; 
-c  r_{k} contains the initial residual vector even for k = 0;
-c  Also assume that rnorm = || B*r_{k} || and B*r_{k} are already 
-c  computed by the calling program.
-c
-c  betaj = rnorm ; p_{k+1} = B*r_{k} ;
-c  For  j = k+1, ..., k+np  Do
-c     1) if ( betaj < tol ) stop or restart depending on j.
-c        if ( restart ) generate a new starting vector.
-c     2) v_{j} = r(j-1)/betaj;  V_{j} = [V_{j-1}, v_{j}];  
-c        p_{j} = p_{j}/betaj
-c     3) r_{j} = OP*v_{j} where OP is defined as in igraphdsaupd
-c        For shift-invert mode p_{j} = B*v_{j} is already available.
-c        wnorm = || OP*v_{j} ||
-c     4) Compute the j-th step residual vector.
-c        w_{j} =  V_{j}^T * B * OP * v_{j}
-c        r_{j} =  OP*v_{j} - V_{j} * w_{j}
-c        alphaj <- j-th component of w_{j}
-c        rnorm = || r_{j} ||
-c        betaj+1 = rnorm
-c        If (rnorm > 0.717*wnorm) accept step and go back to 1)
-c     5) Re-orthogonalization step:
-c        s = V_{j}'*B*r_{j}
-c        r_{j} = r_{j} - V_{j}*s;  rnorm1 = || r_{j} ||
-c        alphaj = alphaj + s_{j};   
-c     6) Iterative refinement step:
-c        If (rnorm1 > 0.717*rnorm) then
-c           rnorm = rnorm1
-c           accept step and go back to 1)
-c        Else
-c           rnorm = rnorm1
-c           If this is the first time in step 6), go to 5)
-c           Else r_{j} lies in the span of V_{j} numerically.
-c              Set r_{j} = 0 and rnorm = 0; go to 1)
-c        EndIf 
-c  End Do
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsaitr
-     &   (ido, bmat, n, k, np, mode, resid, rnorm, v, ldv, h, ldh, 
-     &    ipntr, workd, info)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1
-      integer    ido, info, k, ldh, ldv, n, mode, np
-      Double precision
-     &           rnorm
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    ipntr(3)
-      Double precision
-     &           h(ldh,2), resid(n), v(ldv,k+np), workd(3*n)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      logical    first, orth1, orth2, rstart, step3, step4
-      integer    i, ierr, ipj, irj, ivj, iter, itry, j, msglvl, 
-     &           infol, jj
-      Double precision
-     &           rnorm1, wnorm, safmin, temp1
-      save       orth1, orth2, rstart, step3, step4,
-     &           ierr, ipj, irj, ivj, iter, itry, j, msglvl,
-     &           rnorm1, safmin, wnorm
-c
-c     %-----------------------%
-c     | Local Array Arguments | 
-c     %-----------------------%
-c
-      Double precision
-     &           xtemp(2)
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   daxpy, dcopy, dscal, dgemv, igraphdgetv0, 
-     &     igraphdvout, igraphdmout,
-     &     dlascl, igraphivout, igraphsecond
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           ddot, dnrm2, dlamch
-      external   ddot, dnrm2, dlamch
-c
-c     %-----------------%
-c     | Data statements |
-c     %-----------------%
-c
-      data      first / .true. /
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (first) then
-         first = .false.
-c
-c        %--------------------------------%
-c        | safmin = safe minimum is such  |
-c        | that 1/sfmin does not overflow |
-c        %--------------------------------%
-c
-         safmin = dlamch('safmin')
-      end if
-c
-      if (ido .eq. 0) then
-c 
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphsecond (t0)
-         msglvl = msaitr
-c 
-c        %------------------------------%
-c        | Initial call to this routine |
-c        %------------------------------%
-c
-         info   = 0
-         step3  = .false.
-         step4  = .false.
-         rstart = .false.
-         orth1  = .false.
-         orth2  = .false.
-c 
-c        %--------------------------------%
-c        | Pointer to the current step of |
-c        | the factorization to build     |
-c        %--------------------------------%
-c
-         j      = k + 1
-c 
-c        %------------------------------------------%
-c        | Pointers used for reverse communication  |
-c        | when using WORKD.                        |
-c        %------------------------------------------%
-c
-         ipj    = 1
-         irj    = ipj   + n
-         ivj    = irj   + n
-      end if
-c 
-c     %-------------------------------------------------%
-c     | When in reverse communication mode one of:      |
-c     | STEP3, STEP4, ORTH1, ORTH2, RSTART              |
-c     | will be .true.                                  |
-c     | STEP3: return from computing OP*v_{j}.          |
-c     | STEP4: return from computing B-norm of OP*v_{j} |
-c     | ORTH1: return from computing B-norm of r_{j+1}  |
-c     | ORTH2: return from computing B-norm of          |
-c     |        correction to the residual vector.       |
-c     | RSTART: return from OP computations needed by   |
-c     |         igraphdgetv0.                                 |
-c     %-------------------------------------------------%
-c
-      if (step3)  go to 50
-      if (step4)  go to 60
-      if (orth1)  go to 70
-      if (orth2)  go to 90
-      if (rstart) go to 30
-c
-c     %------------------------------%
-c     | Else this is the first step. |
-c     %------------------------------%
-c 
-c     %--------------------------------------------------------------%
-c     |                                                              |
-c     |        A R N O L D I     I T E R A T I O N     L O O P       |
-c     |                                                              |
-c     | Note:  B*r_{j-1} is already in WORKD(1:N)=WORKD(IPJ:IPJ+N-1) |
-c     %--------------------------------------------------------------%
-c
- 1000 continue
-c
-         if (msglvl .gt. 2) then
-            call igraphivout (logfil, 1, j, ndigit, 
-     &                  '_saitr: generating Arnoldi vector no.')
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &                  '_saitr: B-norm of the current residual =')
-         end if
-c 
-c        %---------------------------------------------------------%
-c        | Check for exact zero. Equivalent to determing whether a |
-c        | j-step Arnoldi factorization is present.                |
-c        %---------------------------------------------------------%
-c
-         if (rnorm .gt. zero) go to 40
-c
-c           %---------------------------------------------------%
-c           | Invariant subspace found, generate a new starting |
-c           | vector which is orthogonal to the current Arnoldi |
-c           | basis and continue the iteration.                 |
-c           %---------------------------------------------------%
-c
-            if (msglvl .gt. 0) then
-               call igraphivout (logfil, 1, j, ndigit,
-     &                     '_saitr: ****** restart at step ******')
-            end if
-c 
-c           %---------------------------------------------%
-c           | ITRY is the loop variable that controls the |
-c           | maximum amount of times that a restart is   |
-c           | attempted. NRSTRT is used by stat.h         |
-c           %---------------------------------------------%
-c
-            nrstrt = nrstrt + 1
-            itry   = 1
-   20       continue
-            rstart = .true.
-            ido    = 0
-   30       continue
-c
-c           %--------------------------------------%
-c           | If in reverse communication mode and |
-c           | RSTART = .true. flow returns here.   |
-c           %--------------------------------------%
-c
-            call igraphdgetv0 (ido, bmat, itry, .false., n, j, v, ldv, 
-     &                   resid, rnorm, ipntr, workd, ierr)
-            if (ido .ne. 99) go to 9000
-            if (ierr .lt. 0) then
-               itry = itry + 1
-               if (itry .le. 3) go to 20
-c
-c              %------------------------------------------------%
-c              | Give up after several restart attempts.        |
-c              | Set INFO to the size of the invariant subspace |
-c              | which spans OP and exit.                       |
-c              %------------------------------------------------%
-c
-               info = j - 1
-               call igraphsecond (t1)
-               tsaitr = tsaitr + (t1 - t0)
-               ido = 99
-               go to 9000
-            end if
-c 
-   40    continue
-c
-c        %---------------------------------------------------------%
-c        | STEP 2:  v_{j} = r_{j-1}/rnorm and p_{j} = p_{j}/rnorm  |
-c        | Note that p_{j} = B*r_{j-1}. In order to avoid overflow |
-c        | when reciprocating a small RNORM, test against lower    |
-c        | machine bound.                                          |
-c        %---------------------------------------------------------%
-c
-         call dcopy (n, resid, 1, v(1,j), 1)
-         if (rnorm .ge. safmin) then
-             temp1 = one / rnorm
-             call dscal (n, temp1, v(1,j), 1)
-             call dscal (n, temp1, workd(ipj), 1)
-         else
-c
-c            %-----------------------------------------%
-c            | To scale both v_{j} and p_{j} carefully |
-c            | use LAPACK routine SLASCL               |
-c            %-----------------------------------------%
-c
-             call dlascl ('General', i, i, rnorm, one, n, 1, 
-     &                    v(1,j), n, infol)
-             call dlascl ('General', i, i, rnorm, one, n, 1, 
-     &                    workd(ipj), n, infol)
-         end if
-c 
-c        %------------------------------------------------------%
-c        | STEP 3:  r_{j} = OP*v_{j}; Note that p_{j} = B*v_{j} |
-c        | Note that this is not quite yet r_{j}. See STEP 4    |
-c        %------------------------------------------------------%
-c
-         step3 = .true.
-         nopx  = nopx + 1
-         call igraphsecond (t2)
-         call dcopy (n, v(1,j), 1, workd(ivj), 1)
-         ipntr(1) = ivj
-         ipntr(2) = irj
-         ipntr(3) = ipj
-         ido = 1
-c 
-c        %-----------------------------------%
-c        | Exit in order to compute OP*v_{j} |
-c        %-----------------------------------%
-c 
-         go to 9000
-   50    continue
-c 
-c        %-----------------------------------%
-c        | Back from reverse communication;  |
-c        | WORKD(IRJ:IRJ+N-1) := OP*v_{j}.   |
-c        %-----------------------------------%
-c
-         call igraphsecond (t3)
-         tmvopx = tmvopx + (t3 - t2)
-c 
-         step3 = .false.
-c
-c        %------------------------------------------%
-c        | Put another copy of OP*v_{j} into RESID. |
-c        %------------------------------------------%
-c
-         call dcopy (n, workd(irj), 1, resid, 1)
-c 
-c        %-------------------------------------------%
-c        | STEP 4:  Finish extending the symmetric   |
-c        |          Arnoldi to length j. If MODE = 2 |
-c        |          then B*OP = B*inv(B)*A = A and   |
-c        |          we don't need to compute B*OP.   |
-c        | NOTE: If MODE = 2 WORKD(IVJ:IVJ+N-1) is   |
-c        | assumed to have A*v_{j}.                  |
-c        %-------------------------------------------%
-c
-         if (mode .eq. 2) go to 65
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            step4 = .true.
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %-------------------------------------%
-c           | Exit in order to compute B*OP*v_{j} |
-c           %-------------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-              call dcopy(n, resid, 1 , workd(ipj), 1)
-         end if
-   60    continue
-c 
-c        %-----------------------------------%
-c        | Back from reverse communication;  |
-c        | WORKD(IPJ:IPJ+N-1) := B*OP*v_{j}. |
-c        %-----------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if 
-c
-         step4 = .false.
-c
-c        %-------------------------------------%
-c        | The following is needed for STEP 5. |
-c        | Compute the B-norm of OP*v_{j}.     |
-c        %-------------------------------------%
-c
-   65    continue
-         if (mode .eq. 2) then
-c
-c           %----------------------------------%
-c           | Note that the B-norm of OP*v_{j} |
-c           | is the inv(B)-norm of A*v_{j}.   |
-c           %----------------------------------%
-c
-            wnorm = ddot (n, resid, 1, workd(ivj), 1)
-            wnorm = sqrt(abs(wnorm))
-         else if (bmat .eq. 'G') then         
-            wnorm = ddot (n, resid, 1, workd(ipj), 1)
-            wnorm = sqrt(abs(wnorm))
-         else if (bmat .eq. 'I') then
-            wnorm = dnrm2(n, resid, 1)
-         end if
-c
-c        %-----------------------------------------%
-c        | Compute the j-th residual corresponding |
-c        | to the j step factorization.            |
-c        | Use Classical Gram Schmidt and compute: |
-c        | w_{j} <-  V_{j}^T * B * OP * v_{j}      |
-c        | r_{j} <-  OP*v_{j} - V_{j} * w_{j}      |
-c        %-----------------------------------------%
-c
-c
-c        %------------------------------------------%
-c        | Compute the j Fourier coefficients w_{j} |
-c        | WORKD(IPJ:IPJ+N-1) contains B*OP*v_{j}.  |
-c        %------------------------------------------%
-c
-         if (mode .ne. 2 ) then
-            call dgemv('T', n, j, one, v, ldv, workd(ipj), 1, zero, 
-     &                  workd(irj), 1)
-         else if (mode .eq. 2) then
-            call dgemv('T', n, j, one, v, ldv, workd(ivj), 1, zero, 
-     &                  workd(irj), 1)
-         end if
-c
-c        %--------------------------------------%
-c        | Orthgonalize r_{j} against V_{j}.    |
-c        | RESID contains OP*v_{j}. See STEP 3. | 
-c        %--------------------------------------%
-c
-         call dgemv('N', n, j, -one, v, ldv, workd(irj), 1, one, 
-     &               resid, 1)
-c
-c        %--------------------------------------%
-c        | Extend H to have j rows and columns. |
-c        %--------------------------------------%
-c
-         h(j,2) = workd(irj + j - 1)
-         if (j .eq. 1  .or.  rstart) then
-            h(j,1) = zero
-         else
-            h(j,1) = rnorm
-         end if
-         call igraphsecond (t4)
-c 
-         orth1 = .true.
-         iter  = 0
-c 
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(irj), 1)
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %----------------------------------%
-c           | Exit in order to compute B*r_{j} |
-c           %----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd(ipj), 1)
-         end if
-   70    continue
-c 
-c        %---------------------------------------------------%
-c        | Back from reverse communication if ORTH1 = .true. |
-c        | WORKD(IPJ:IPJ+N-1) := B*r_{j}.                    |
-c        %---------------------------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c 
-         orth1 = .false.
-c
-c        %------------------------------%
-c        | Compute the B-norm of r_{j}. |
-c        %------------------------------%
-c
-         if (bmat .eq. 'G') then         
-            rnorm = ddot (n, resid, 1, workd(ipj), 1)
-            rnorm = sqrt(abs(rnorm))
-         else if (bmat .eq. 'I') then
-            rnorm = dnrm2(n, resid, 1)
-         end if
-c
-c        %-----------------------------------------------------------%
-c        | STEP 5: Re-orthogonalization / Iterative refinement phase |
-c        | Maximum NITER_ITREF tries.                                |
-c        |                                                           |
-c        |          s      = V_{j}^T * B * r_{j}                     |
-c        |          r_{j}  = r_{j} - V_{j}*s                         |
-c        |          alphaj = alphaj + s_{j}                          |
-c        |                                                           |
-c        | The stopping criteria used for iterative refinement is    |
-c        | discussed in Parlett's book SEP, page 107 and in Gragg &  |
-c        | Reichel ACM TOMS paper; Algorithm 686, Dec. 1990.         |
-c        | Determine if we need to correct the residual. The goal is |
-c        | to enforce ||v(:,1:j)^T * r_{j}|| .le. eps * || r_{j} ||  |
-c        %-----------------------------------------------------------%
-c
-         if (rnorm .gt. 0.717*wnorm) go to 100
-         nrorth = nrorth + 1
-c 
-c        %---------------------------------------------------%
-c        | Enter the Iterative refinement phase. If further  |
-c        | refinement is necessary, loop back here. The loop |
-c        | variable is ITER. Perform a step of Classical     |
-c        | Gram-Schmidt using all the Arnoldi vectors V_{j}  |
-c        %---------------------------------------------------%
-c
-   80    continue
-c
-         if (msglvl .gt. 2) then
-            xtemp(1) = wnorm
-            xtemp(2) = rnorm
-            call igraphdvout (logfil, 2, xtemp, ndigit, 
-     &           '_saitr: re-orthonalization ; wnorm and rnorm are')
-         end if
-c
-c        %----------------------------------------------------%
-c        | Compute V_{j}^T * B * r_{j}.                       |
-c        | WORKD(IRJ:IRJ+J-1) = v(:,1:J)'*WORKD(IPJ:IPJ+N-1). |
-c        %----------------------------------------------------%
-c
-         call dgemv ('T', n, j, one, v, ldv, workd(ipj), 1, 
-     &               zero, workd(irj), 1)
-c
-c        %----------------------------------------------%
-c        | Compute the correction to the residual:      |
-c        | r_{j} = r_{j} - V_{j} * WORKD(IRJ:IRJ+J-1).  |
-c        | The correction to H is v(:,1:J)*H(1:J,1:J) + |
-c        | v(:,1:J)*WORKD(IRJ:IRJ+J-1)*e'_j, but only   |
-c        | H(j,j) is updated.                           |
-c        %----------------------------------------------%
-c
-         call dgemv ('N', n, j, -one, v, ldv, workd(irj), 1, 
-     &               one, resid, 1)
-c
-         if (j .eq. 1  .or.  rstart) h(j,1) = zero
-         h(j,2) = h(j,2) + workd(irj + j - 1)
-c 
-         orth2 = .true.
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(irj), 1)
-            ipntr(1) = irj
-            ipntr(2) = ipj
-            ido = 2
-c 
-c           %-----------------------------------%
-c           | Exit in order to compute B*r_{j}. |
-c           | r_{j} is the corrected residual.  |
-c           %-----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd(ipj), 1)
-         end if
-   90    continue
-c
-c        %---------------------------------------------------%
-c        | Back from reverse communication if ORTH2 = .true. |
-c        %---------------------------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c
-c        %-----------------------------------------------------%
-c        | Compute the B-norm of the corrected residual r_{j}. |
-c        %-----------------------------------------------------%
-c 
-         if (bmat .eq. 'G') then         
-             rnorm1 = ddot (n, resid, 1, workd(ipj), 1)
-             rnorm1 = sqrt(abs(rnorm1))
-         else if (bmat .eq. 'I') then
-             rnorm1 = dnrm2(n, resid, 1)
-         end if
-c
-         if (msglvl .gt. 0 .and. iter .gt. 0) then
-            call igraphivout (logfil, 1, j, ndigit,
-     &           '_saitr: Iterative refinement for Arnoldi residual')
-            if (msglvl .gt. 2) then
-                xtemp(1) = rnorm
-                xtemp(2) = rnorm1
-                call igraphdvout (logfil, 2, xtemp, ndigit,
-     &           '_saitr: iterative refinement ; rnorm and rnorm1 are')
-            end if
-         end if
-c 
-c        %-----------------------------------------%
-c        | Determine if we need to perform another |
-c        | step of re-orthogonalization.           |
-c        %-----------------------------------------%
-c
-         if (rnorm1 .gt. 0.717*rnorm) then
-c
-c           %--------------------------------%
-c           | No need for further refinement |
-c           %--------------------------------%
-c
-            rnorm = rnorm1
-c 
-         else
-c
-c           %-------------------------------------------%
-c           | Another step of iterative refinement step |
-c           | is required. NITREF is used by stat.h     |
-c           %-------------------------------------------%
-c
-            nitref = nitref + 1
-            rnorm  = rnorm1
-            iter   = iter + 1
-            if (iter .le. 1) go to 80
-c
-c           %-------------------------------------------------%
-c           | Otherwise RESID is numerically in the span of V |
-c           %-------------------------------------------------%
-c
-            do 95 jj = 1, n
-               resid(jj) = zero
-  95        continue
-            rnorm = zero
-         end if
-c 
-c        %----------------------------------------------%
-c        | Branch here directly if iterative refinement |
-c        | wasn't necessary or after at most NITER_REF  |
-c        | steps of iterative refinement.               |
-c        %----------------------------------------------%
-c
-  100    continue
-c 
-         rstart = .false.
-         orth2  = .false.
-c 
-         call igraphsecond (t5)
-         titref = titref + (t5 - t4)
-c 
-c        %----------------------------------------------------------%
-c        | Make sure the last off-diagonal element is non negative  |
-c        | If not perform a similarity transformation on H(1:j,1:j) |
-c        | and scale v(:,j) by -1.                                  |
-c        %----------------------------------------------------------%
-c
-         if (h(j,1) .lt. zero) then
-            h(j,1) = -h(j,1)
-            if ( j .lt. k+np) then 
-               call dscal(n, -one, v(1,j+1), 1)
-            else
-               call dscal(n, -one, resid, 1)
-            end if
-         end if
-c 
-c        %------------------------------------%
-c        | STEP 6: Update  j = j+1;  Continue |
-c        %------------------------------------%
-c
-         j = j + 1
-         if (j .gt. k+np) then
-            call igraphsecond (t1)
-            tsaitr = tsaitr + (t1 - t0)
-            ido = 99
-c
-            if (msglvl .gt. 1) then
-               call igraphdvout (logfil, k+np, h(1,2), ndigit, 
-     &         '_saitr: main diagonal of matrix H of step K+NP.')
-               if (k+np .gt. 1) then
-               call igraphdvout (logfil, k+np-1, h(2,1), ndigit, 
-     &         '_saitr: sub diagonal of matrix H of step K+NP.')
-               end if
-            end if
-c
-            go to 9000
-         end if
-c
-c        %--------------------------------------------------------%
-c        | Loop back to extend the factorization by another step. |
-c        %--------------------------------------------------------%
-c
-      go to 1000
-c 
-c     %---------------------------------------------------------------%
-c     |                                                               |
-c     |  E N D     O F     M A I N     I T E R A T I O N     L O O P  |
-c     |                                                               |
-c     %---------------------------------------------------------------%
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdsaitr |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsapps.f igraph-0.6.5/interfaces/R/arpack/dsapps.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsapps.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsapps.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,516 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsapps
-c
-c\Description:
-c  Given the Arnoldi factorization
-c
-c     A*V_{k} - V_{k}*H_{k} = r_{k+p}*e_{k+p}^T,
-c
-c  apply NP shifts implicitly resulting in
-c
-c     A*(V_{k}*Q) - (V_{k}*Q)*(Q^T* H_{k}*Q) = r_{k+p}*e_{k+p}^T * Q
-c
-c  where Q is an orthogonal matrix of order KEV+NP. Q is the product of 
-c  rotations resulting from the NP bulge chasing sweeps.  The updated Arnoldi 
-c  factorization becomes:
-c
-c     A*VNEW_{k} - VNEW_{k}*HNEW_{k} = rnew_{k}*e_{k}^T.
-c
-c\Usage:
-c  call igraphdsapps
-c     ( N, KEV, NP, SHIFT, V, LDV, H, LDH, RESID, Q, LDQ, WORKD )
-c
-c\Arguments
-c  N       Integer.  (INPUT)
-c          Problem size, i.e. dimension of matrix A.
-c
-c  KEV     Integer.  (INPUT)
-c          INPUT: KEV+NP is the size of the input matrix H.
-c          OUTPUT: KEV is the size of the updated matrix HNEW.
-c
-c  NP      Integer.  (INPUT)
-c          Number of implicit shifts to be applied.
-c
-c  SHIFT   Double precision array of length NP.  (INPUT)
-c          The shifts to be applied.
-c
-c  V       Double precision N by (KEV+NP) array.  (INPUT/OUTPUT)
-c          INPUT: V contains the current KEV+NP Arnoldi vectors.
-c          OUTPUT: VNEW = V(1:n,1:KEV); the updated Arnoldi vectors
-c          are in the first KEV columns of V.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling
-c          program.
-c
-c  H       Double precision (KEV+NP) by 2 array.  (INPUT/OUTPUT)
-c          INPUT: H contains the symmetric tridiagonal matrix of the
-c          Arnoldi factorization with the subdiagonal in the 1st column
-c          starting at H(2,1) and the main diagonal in the 2nd column.
-c          OUTPUT: H contains the updated tridiagonal matrix in the 
-c          KEV leading submatrix.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling
-c          program.
-c
-c  RESID   Double precision array of length (N).  (INPUT/OUTPUT)
-c          INPUT: RESID contains the the residual vector r_{k+p}.
-c          OUTPUT: RESID is the updated residual vector rnew_{k}.
-c
-c  Q       Double precision KEV+NP by KEV+NP work array.  (WORKSPACE)
-c          Work array used to accumulate the rotations during the bulge
-c          chase sweep.
-c
-c  LDQ     Integer.  (INPUT)
-c          Leading dimension of Q exactly as declared in the calling
-c          program.
-c
-c  WORKD   Double precision work array of length 2*N.  (WORKSPACE)
-c          Distributed array used in the application of the accumulated
-c          orthogonal matrix Q.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c
-c\Routines called:
-c     igraphivout   ARPACK utility routine that prints integers. 
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlartg  LAPACK Givens rotation construction routine.
-c     dlacpy  LAPACK matrix copy routine.
-c     dlaset  LAPACK matrix initialization routine.
-c     dgemv   Level 2 BLAS routine for matrix vector multiplication.
-c     daxpy   Level 1 BLAS that computes a vector triad.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     dscal   Level 1 BLAS that scales a vector.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     12/16/93: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: sapps.F   SID: 2.5   DATE OF SID: 4/19/96   RELEASE: 2
-c
-c\Remarks
-c  1. In this version, each shift is applied to all the subblocks of
-c     the tridiagonal matrix H and not just to the submatrix that it 
-c     comes from. This routine assumes that the subdiagonal elements 
-c     of H that are stored in h(1:kev+np,1) are nonegative upon input
-c     and enforce this condition upon output. This version incorporates
-c     deflation. See code for documentation.
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsapps
-     &   ( n, kev, np, shift, v, ldv, h, ldh, resid, q, ldq, workd )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    kev, ldh, ldq, ldv, n, np
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           h(ldh,2), q(ldq,kev+np), resid(n), shift(np), 
-     &           v(ldv,kev+np), workd(2*n)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i, iend, istart, itop, j, jj, kplusp, msglvl
-      logical    first
-      Double precision
-     &           a1, a2, a3, a4, big, c, epsmch, f, g, r, s
-      save       epsmch, first
-c
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   daxpy, dcopy, dscal, dlacpy, dlartg, dlaset, 
-     &     igraphdvout, igraphivout, igraphsecond, dgemv
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlamch
-      external   dlamch
-c
-c     %----------------------%
-c     | Intrinsics Functions |
-c     %----------------------%
-c
-      intrinsic  abs
-c
-c     %----------------%
-c     | Data statments |
-c     %----------------%
-c
-      data       first / .true. /
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (first) then
-         epsmch = dlamch('Epsilon-Machine')
-         first = .false.
-      end if
-      itop = 1
-c
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------%
-c
-      call igraphsecond (t0)
-      msglvl = msapps
-c 
-      kplusp = kev + np 
-c 
-c     %----------------------------------------------%
-c     | Initialize Q to the identity matrix of order |
-c     | kplusp used to accumulate the rotations.     |
-c     %----------------------------------------------%
-c
-      call dlaset ('All', kplusp, kplusp, zero, one, q, ldq)
-c
-c     %----------------------------------------------%
-c     | Quick return if there are no shifts to apply |
-c     %----------------------------------------------%
-c
-      if (np .eq. 0) go to 9000
-c 
-c     %----------------------------------------------------------%
-c     | Apply the np shifts implicitly. Apply each shift to the  |
-c     | whole matrix and not just to the submatrix from which it |
-c     | comes.                                                   |
-c     %----------------------------------------------------------%
-c
-      do 90 jj = 1, np
-c 
-         istart = itop
-c
-c        %----------------------------------------------------------%
-c        | Check for splitting and deflation. Currently we consider |
-c        | an off-diagonal element h(i+1,1) negligible if           |
-c        |         h(i+1,1) .le. epsmch*( |h(i,2)| + |h(i+1,2)| )   |
-c        | for i=1:KEV+NP-1.                                        |
-c        | If above condition tests true then we set h(i+1,1) = 0.  |
-c        | Note that h(1:KEV+NP,1) are assumed to be non negative.  |
-c        %----------------------------------------------------------%
-c
-   20    continue
-c
-c        %------------------------------------------------%
-c        | The following loop exits early if we encounter |
-c        | a negligible off diagonal element.             |
-c        %------------------------------------------------%
-c
-         do 30 i = istart, kplusp-1
-            big   = abs(h(i,2)) + abs(h(i+1,2))
-            if (h(i+1,1) .le. epsmch*big) then
-               if (msglvl .gt. 0) then
-                  call igraphivout (logfil, 1, i, ndigit, 
-     &                 '_sapps: deflation at row/column no.')
-                  call igraphivout (logfil, 1, jj, ndigit, 
-     &                 '_sapps: occured before shift number.')
-                  call igraphdvout (logfil, 1, h(i+1,1), ndigit, 
-     &                 '_sapps: the corresponding off diagonal element')
-               end if
-               h(i+1,1) = zero
-               iend = i
-               go to 40
-            end if
-   30    continue
-         iend = kplusp
-   40    continue
-c
-         if (istart .lt. iend) then
-c 
-c           %--------------------------------------------------------%
-c           | Construct the plane rotation G'(istart,istart+1,theta) |
-c           | that attempts to drive h(istart+1,1) to zero.          |
-c           %--------------------------------------------------------%
-c
-             f = h(istart,2) - shift(jj)
-             g = h(istart+1,1)
-             call dlartg (f, g, c, s, r)
-c 
-c            %-------------------------------------------------------%
-c            | Apply rotation to the left and right of H;            |
-c            | H <- G' * H * G,  where G = G(istart,istart+1,theta). |
-c            | This will create a "bulge".                           |
-c            %-------------------------------------------------------%
-c
-             a1 = c*h(istart,2)   + s*h(istart+1,1)
-             a2 = c*h(istart+1,1) + s*h(istart+1,2)
-             a4 = c*h(istart+1,2) - s*h(istart+1,1)
-             a3 = c*h(istart+1,1) - s*h(istart,2) 
-             h(istart,2)   = c*a1 + s*a2
-             h(istart+1,2) = c*a4 - s*a3
-             h(istart+1,1) = c*a3 + s*a4
-c 
-c            %----------------------------------------------------%
-c            | Accumulate the rotation in the matrix Q;  Q <- Q*G |
-c            %----------------------------------------------------%
-c
-             do 60 j = 1, min(istart+jj,kplusp)
-                a1            =   c*q(j,istart) + s*q(j,istart+1)
-                q(j,istart+1) = - s*q(j,istart) + c*q(j,istart+1)
-                q(j,istart)   = a1
-   60        continue
-c
-c
-c            %----------------------------------------------%
-c            | The following loop chases the bulge created. |
-c            | Note that the previous rotation may also be  |
-c            | done within the following loop. But it is    |
-c            | kept separate to make the distinction among  |
-c            | the bulge chasing sweeps and the first plane |
-c            | rotation designed to drive h(istart+1,1) to  |
-c            | zero.                                        |
-c            %----------------------------------------------%
-c
-             do 70 i = istart+1, iend-1
-c 
-c               %----------------------------------------------%
-c               | Construct the plane rotation G'(i,i+1,theta) |
-c               | that zeros the i-th bulge that was created   |
-c               | by G(i-1,i,theta). g represents the bulge.   |
-c               %----------------------------------------------%
-c
-                f = h(i,1)
-                g = s*h(i+1,1)
-c
-c               %----------------------------------%
-c               | Final update with G(i-1,i,theta) |
-c               %----------------------------------%
-c
-                h(i+1,1) = c*h(i+1,1)
-                call dlartg (f, g, c, s, r)
-c
-c               %-------------------------------------------%
-c               | The following ensures that h(1:iend-1,1), |
-c               | the first iend-2 off diagonal of elements |
-c               | H, remain non negative.                   |
-c               %-------------------------------------------%
-c
-                if (r .lt. zero) then
-                   r = -r
-                   c = -c
-                   s = -s
-                end if
-c 
-c               %--------------------------------------------%
-c               | Apply rotation to the left and right of H; |
-c               | H <- G * H * G',  where G = G(i,i+1,theta) |
-c               %--------------------------------------------%
-c
-                h(i,1) = r
-c 
-                a1 = c*h(i,2)   + s*h(i+1,1)
-                a2 = c*h(i+1,1) + s*h(i+1,2)
-                a3 = c*h(i+1,1) - s*h(i,2)
-                a4 = c*h(i+1,2) - s*h(i+1,1)
-c 
-                h(i,2)   = c*a1 + s*a2
-                h(i+1,2) = c*a4 - s*a3
-                h(i+1,1) = c*a3 + s*a4
-c 
-c               %----------------------------------------------------%
-c               | Accumulate the rotation in the matrix Q;  Q <- Q*G |
-c               %----------------------------------------------------%
-c
-                do 50 j = 1, min( j+jj, kplusp )
-                   a1       =   c*q(j,i) + s*q(j,i+1)
-                   q(j,i+1) = - s*q(j,i) + c*q(j,i+1)
-                   q(j,i)   = a1
-   50           continue
-c
-   70        continue
-c
-         end if
-c
-c        %--------------------------%
-c        | Update the block pointer |
-c        %--------------------------%
-c
-         istart = iend + 1
-c
-c        %------------------------------------------%
-c        | Make sure that h(iend,1) is non-negative |
-c        | If not then set h(iend,1) <-- -h(iend,1) |
-c        | and negate the last column of Q.         |
-c        | We have effectively carried out a        |
-c        | similarity on transformation H           |
-c        %------------------------------------------%
-c
-         if (h(iend,1) .lt. zero) then
-             h(iend,1) = -h(iend,1)
-             call dscal(kplusp, -one, q(1,iend), 1)
-         end if
-c
-c        %--------------------------------------------------------%
-c        | Apply the same shift to the next block if there is any |
-c        %--------------------------------------------------------%
-c
-         if (iend .lt. kplusp) go to 20
-c
-c        %-----------------------------------------------------%
-c        | Check if we can increase the the start of the block |
-c        %-----------------------------------------------------%
-c
-         do 80 i = itop, kplusp-1
-            if (h(i+1,1) .gt. zero) go to 90
-            itop  = itop + 1
-   80    continue
-c
-c        %-----------------------------------%
-c        | Finished applying the jj-th shift |
-c        %-----------------------------------%
-c
-   90 continue
-c
-c     %------------------------------------------%
-c     | All shifts have been applied. Check for  |
-c     | more possible deflation that might occur |
-c     | after the last shift is applied.         |                               
-c     %------------------------------------------%
-c
-      do 100 i = itop, kplusp-1
-         big   = abs(h(i,2)) + abs(h(i+1,2))
-         if (h(i+1,1) .le. epsmch*big) then
-            if (msglvl .gt. 0) then
-               call igraphivout (logfil, 1, i, ndigit, 
-     &              '_sapps: deflation at row/column no.')
-               call igraphdvout (logfil, 1, h(i+1,1), ndigit, 
-     &              '_sapps: the corresponding off diagonal element')
-            end if
-            h(i+1,1) = zero
-         end if
- 100  continue
-c
-c     %-------------------------------------------------%
-c     | Compute the (kev+1)-st column of (V*Q) and      |
-c     | temporarily store the result in WORKD(N+1:2*N). |
-c     | This is not necessary if h(kev+1,1) = 0.         |
-c     %-------------------------------------------------%
-c
-      if ( h(kev+1,1) .gt. zero ) 
-     &   call dgemv ('N', n, kplusp, one, v, ldv,
-     &                q(1,kev+1), 1, zero, workd(n+1), 1)
-c 
-c     %-------------------------------------------------------%
-c     | Compute column 1 to kev of (V*Q) in backward order    |
-c     | taking advantage that Q is an upper triangular matrix |    
-c     | with lower bandwidth np.                              |
-c     | Place results in v(:,kplusp-kev:kplusp) temporarily.  |
-c     %-------------------------------------------------------%
-c
-      do 130 i = 1, kev
-         call dgemv ('N', n, kplusp-i+1, one, v, ldv,
-     &               q(1,kev-i+1), 1, zero, workd, 1)
-         call dcopy (n, workd, 1, v(1,kplusp-i+1), 1)
-  130 continue
-c
-c     %-------------------------------------------------%
-c     |  Move v(:,kplusp-kev+1:kplusp) into v(:,1:kev). |
-c     %-------------------------------------------------%
-c
-      call dlacpy ('All', n, kev, v(1,np+1), ldv, v, ldv)
-c 
-c     %--------------------------------------------%
-c     | Copy the (kev+1)-st column of (V*Q) in the |
-c     | appropriate place if h(kev+1,1) .ne. zero. |
-c     %--------------------------------------------%
-c
-      if ( h(kev+1,1) .gt. zero ) 
-     &     call dcopy (n, workd(n+1), 1, v(1,kev+1), 1)
-c 
-c     %-------------------------------------%
-c     | Update the residual vector:         |
-c     |    r <- sigmak*r + betak*v(:,kev+1) |
-c     | where                               |
-c     |    sigmak = (e_{kev+p}'*Q)*e_{kev}  |
-c     |    betak = e_{kev+1}'*H*e_{kev}     |
-c     %-------------------------------------%
-c
-      call dscal (n, q(kplusp,kev), resid, 1)
-      if (h(kev+1,1) .gt. zero) 
-     &   call daxpy (n, h(kev+1,1), v(1,kev+1), 1, resid, 1)
-c
-      if (msglvl .gt. 1) then
-         call igraphdvout (logfil, 1, q(kplusp,kev), ndigit, 
-     &      '_sapps: sigmak of the updated residual vector')
-         call igraphdvout (logfil, 1, h(kev+1,1), ndigit, 
-     &      '_sapps: betak of the updated residual vector')
-         call igraphdvout (logfil, kev, h(1,2), ndigit, 
-     &      '_sapps: updated main diagonal of H for next iteration')
-         if (kev .gt. 1) then
-         call igraphdvout (logfil, kev-1, h(2,1), ndigit, 
-     &      '_sapps: updated sub diagonal of H for next iteration')
-         end if
-      end if
-c
-      call igraphsecond (t1)
-      tsapps = tsapps + (t1 - t0)
-c 
- 9000 continue 
-      return
-c
-c     %---------------%
-c     | End of igraphdsapps |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsaup2.f igraph-0.6.5/interfaces/R/arpack/dsaup2.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsaup2.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsaup2.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,853 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsaup2
-c
-c\Description: 
-c  Intermediate level interface called by igraphdsaupd.
-c
-c\Usage:
-c  call igraphdsaup2 
-c     ( IDO, BMAT, N, WHICH, NEV, NP, TOL, RESID, MODE, IUPD,
-c       ISHIFT, MXITER, V, LDV, H, LDH, RITZ, BOUNDS, Q, LDQ, WORKL, 
-c       IPNTR, WORKD, INFO )
-c
-c\Arguments
-c
-c  IDO, BMAT, N, WHICH, NEV, TOL, RESID: same as defined in igraphdsaupd.
-c  MODE, ISHIFT, MXITER: see the definition of IPARAM in igraphdsaupd.
-c  
-c  NP      Integer.  (INPUT/OUTPUT)
-c          Contains the number of implicit shifts to apply during 
-c          each Arnoldi/Lanczos iteration.  
-c          If ISHIFT=1, NP is adjusted dynamically at each iteration 
-c          to accelerate convergence and prevent stagnation.
-c          This is also roughly equal to the number of matrix-vector 
-c          products (involving the operator OP) per Arnoldi iteration.
-c          The logic for adjusting is contained within the current
-c          subroutine.
-c          If ISHIFT=0, NP is the number of shifts the user needs
-c          to provide via reverse comunication. 0 < NP < NCV-NEV.
-c          NP may be less than NCV-NEV since a leading block of the current
-c          upper Tridiagonal matrix has split off and contains "unwanted"
-c          Ritz values.
-c          Upon termination of the IRA iteration, NP contains the number 
-c          of "converged" wanted Ritz values.
-c
-c  IUPD    Integer.  (INPUT)
-c          IUPD .EQ. 0: use explicit restart instead implicit update.
-c          IUPD .NE. 0: use implicit update.
-c
-c  V       Double precision N by (NEV+NP) array.  (INPUT/OUTPUT)
-c          The Lanczos basis vectors.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling 
-c          program.
-c
-c  H       Double precision (NEV+NP) by 2 array.  (OUTPUT)
-c          H is used to store the generated symmetric tridiagonal matrix
-c          The subdiagonal is stored in the first column of H starting 
-c          at H(2,1).  The main diagonal is stored in the igraphsecond column
-c          of H starting at H(1,2). If igraphdsaup2 converges store the 
-c          B-norm of the final residual vector in H(1,1).
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling 
-c          program.
-c
-c  RITZ    Double precision array of length NEV+NP.  (OUTPUT)
-c          RITZ(1:NEV) contains the computed Ritz values of OP.
-c
-c  BOUNDS  Double precision array of length NEV+NP.  (OUTPUT)
-c          BOUNDS(1:NEV) contain the error bounds corresponding to RITZ.
-c
-c  Q       Double precision (NEV+NP) by (NEV+NP) array.  (WORKSPACE)
-c          Private (replicated) work array used to accumulate the 
-c          rotation in the shift application step.
-c
-c  LDQ     Integer.  (INPUT)
-c          Leading dimension of Q exactly as declared in the calling
-c          program.
-c          
-c  WORKL   Double precision array of length at least 3*(NEV+NP).  (INPUT/WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.  It is used in the computation of the 
-c          tridiagonal eigenvalue problem, the calculation and
-c          application of the shifts and convergence checking.
-c          If ISHIFT .EQ. O and IDO .EQ. 3, the first NP locations
-c          of WORKL are used in reverse communication to hold the user 
-c          supplied shifts.
-c
-c  IPNTR   Integer array of length 3.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORKD for 
-c          vectors used by the Lanczos iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X.
-c          IPNTR(2): pointer to the current result vector Y.
-c          IPNTR(3): pointer to the vector B * X when used in one of  
-c                    the spectral transformation modes.  X is the current
-c                    operand.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (REVERSE COMMUNICATION)
-c          Distributed array to be used in the basic Lanczos iteration
-c          for reverse communication.  The user should not use WORKD
-c          as temporary workspace during the iteration !!!!!!!!!!
-c          See Data Distribution Note in igraphdsaupd.
-c
-c  INFO    Integer.  (INPUT/OUTPUT)
-c          If INFO .EQ. 0, a randomly initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          Error flag on output.
-c          =     0: Normal return.
-c          =     1: All possible eigenvalues of OP has been found.  
-c                   NP returns the size of the invariant subspace
-c                   spanning the operator OP. 
-c          =     2: No shifts could be applied.
-c          =    -8: Error return from trid. eigenvalue calculation;
-c                   This should never happen.
-c          =    -9: Starting vector is zero.
-c          = -9999: Could not build an Lanczos factorization.
-c                   Size that was built in returned in NP.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c  3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
-c     1980.
-c  4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
-c     Computer Physics Communications, 53 (1989), pp 169-179.
-c  5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
-c     Implement the Spectral Transformation", Math. Comp., 48 (1987),
-c     pp 663-673.
-c  6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos 
-c     Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", 
-c     SIAM J. Matr. Anal. Apps.,  January (1993).
-c  7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
-c     for Updating the QR decomposition", ACM TOMS, December 1990,
-c     Volume 16 Number 4, pp 369-377.
-c
-c\Routines called:
-c     igraphdgetv0  ARPACK initial vector generation routine. 
-c     igraphdsaitr  ARPACK Lanczos factorization routine.
-c     igraphdsapps  ARPACK application of implicit shifts routine.
-c     igraphdsconv  ARPACK convergence of Ritz values routine.
-c     igraphdseigt  ARPACK compute Ritz values and error bounds routine.
-c     igraphdsgets  ARPACK reorder Ritz values and error bounds routine.
-c     igraphdsortr  ARPACK sorting routine.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     ddot    Level 1 BLAS that computes the scalar product of two vectors. 
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c     dscal   Level 1 BLAS that scales a vector.
-c     dswap   Level 1 BLAS that swaps two vectors.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c 
-c\Revision history:
-c     12/15/93: Version ' 2.4'
-c     xx/xx/95: Version ' 2.4'.  (R.B. Lehoucq)
-c
-c\SCCS Information: @(#) 
-c FILE: saup2.F   SID: 2.6   DATE OF SID: 8/16/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsaup2
-     &   ( ido, bmat, n, which, nev, np, tol, resid, mode, iupd, 
-     &     ishift, mxiter, v, ldv, h, ldh, ritz, bounds, 
-     &     q, ldq, workl, ipntr, workd, info )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1, which*2
-      integer    ido, info, ishift, iupd, ldh, ldq, ldv, mxiter,
-     &           n, mode, nev, np
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    ipntr(3)
-      Double precision
-     &           bounds(nev+np), h(ldh,2), q(ldq,nev+np), resid(n), 
-     &           ritz(nev+np), v(ldv,nev+np), workd(3*n), 
-     &           workl(3*(nev+np))
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      character  wprime*2
-      logical    cnorm, getv0, initv, update, ushift
-      integer    ierr, iter, j, kplusp, msglvl, nconv, nevbef, nev0, 
-     &           np0, nptemp, nevd2, nevm2, kp(3) 
-      Double precision
-     &           rnorm, temp, eps23
-      save       cnorm, getv0, initv, update, ushift,
-     &           iter, kplusp, msglvl, nconv, nev0, np0,
-     &           rnorm, eps23
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, igraphdgetv0, igraphdsaitr, dscal, 
-     &     igraphdsconv, igraphdseigt, igraphdsgets, 
-     &     igraphdsapps, igraphdsortr, igraphdvout, igraphivout, 
-     &     igraphsecond, dswap
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           ddot, dnrm2, dlamch
-      external   ddot, dnrm2, dlamch
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    min
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      if (ido .eq. 0) then
-c 
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphsecond (t0)
-         msglvl = msaup2
-c
-c        %---------------------------------%
-c        | Set machine dependent constant. |
-c        %---------------------------------%
-c
-         eps23 = dlamch('Epsilon-Machine')
-         eps23 = eps23**(2.0D+0/3.0D+0)
-c
-c        %-------------------------------------%
-c        | nev0 and np0 are integer variables  |
-c        | hold the initial values of NEV & NP |
-c        %-------------------------------------%
-c
-         nev0   = nev
-         np0    = np
-c
-c        %-------------------------------------%
-c        | kplusp is the bound on the largest  |
-c        |        Lanczos factorization built. |
-c        | nconv is the current number of      |
-c        |        "converged" eigenvlues.      |
-c        | iter is the counter on the current  |
-c        |      iteration step.                |
-c        %-------------------------------------%
-c
-         kplusp = nev0 + np0
-         nconv  = 0
-         iter   = 0
-c 
-c        %--------------------------------------------%
-c        | Set flags for computing the first NEV steps |
-c        | of the Lanczos factorization.              |
-c        %--------------------------------------------%
-c
-         getv0    = .true.
-         update   = .false.
-         ushift   = .false.
-         cnorm    = .false.
-c
-         if (info .ne. 0) then
-c
-c        %--------------------------------------------%
-c        | User provides the initial residual vector. |
-c        %--------------------------------------------%
-c
-            initv = .true.
-            info  = 0
-         else
-            initv = .false.
-         end if
-      end if
-c 
-c     %---------------------------------------------%
-c     | Get a possibly random starting vector and   |
-c     | force it into the range of the operator OP. |
-c     %---------------------------------------------%
-c
-   10 continue
-c
-      if (getv0) then
-         call igraphdgetv0 (ido, bmat, 1, initv, n, 1, v, ldv, resid,
-     &        rnorm, ipntr, workd, info)
-c
-         if (ido .ne. 99) go to 9000
-c
-         if (rnorm .eq. zero) then
-c
-c           %-----------------------------------------%
-c           | The initial vector is zero. Error exit. | 
-c           %-----------------------------------------%
-c
-            info = -9
-            go to 1200
-         end if
-         getv0 = .false.
-         ido  = 0
-      end if
-c 
-c     %------------------------------------------------------------%
-c     | Back from reverse communication: continue with update step |
-c     %------------------------------------------------------------%
-c
-      if (update) go to 20
-c
-c     %-------------------------------------------%
-c     | Back from computing user specified shifts |
-c     %-------------------------------------------%
-c
-      if (ushift) go to 50
-c
-c     %-------------------------------------%
-c     | Back from computing residual norm   |
-c     | at the end of the current iteration |
-c     %-------------------------------------%
-c
-      if (cnorm)  go to 100
-c 
-c     %----------------------------------------------------------%
-c     | Compute the first NEV steps of the Lanczos factorization |
-c     %----------------------------------------------------------%
-c
-      call igraphdsaitr (ido, bmat, n, 0, nev0, mode, resid, rnorm, v, 
-     &     ldv, h, ldh, ipntr, workd, info)
-c 
-c     %---------------------------------------------------%
-c     | ido .ne. 99 implies use of reverse communication  |
-c     | to compute operations involving OP and possibly B |
-c     %---------------------------------------------------%
-c
-      if (ido .ne. 99) go to 9000
-c
-      if (info .gt. 0) then
-c
-c        %-----------------------------------------------------%
-c        | igraphdsaitr was unable to build an Lanczos factorization |
-c        | of length NEV0. INFO is returned with the size of   |
-c        | the factorization built. Exit main loop.            |
-c        %-----------------------------------------------------%
-c
-         np   = info
-         mxiter = iter
-         info = -9999
-         go to 1200
-      end if
-c 
-c     %--------------------------------------------------------------%
-c     |                                                              |
-c     |           M A I N  LANCZOS  I T E R A T I O N  L O O P       |
-c     |           Each iteration implicitly restarts the Lanczos     |
-c     |           factorization in place.                            |
-c     |                                                              |
-c     %--------------------------------------------------------------%
-c 
- 1000 continue
-c
-         iter = iter + 1
-c
-         if (msglvl .gt. 0) then
-            call igraphivout (logfil, 1, iter, ndigit, 
-     &           '_saup2: **** Start of major iteration number ****')
-         end if
-         if (msglvl .gt. 1) then
-            call igraphivout (logfil, 1, nev, ndigit, 
-     &     '_saup2: The length of the current Lanczos factorization')
-            call igraphivout (logfil, 1, np, ndigit, 
-     &           '_saup2: Extend the Lanczos factorization by')
-         end if
-c 
-c        %------------------------------------------------------------%
-c        | Compute NP additional steps of the Lanczos factorization. |
-c        %------------------------------------------------------------%
-c
-         ido = 0
-   20    continue
-         update = .true.
-c
-         call igraphdsaitr (ido, bmat, n, nev, np, mode, resid, rnorm, 
-     &        v, ldv, h, ldh, ipntr, workd, info)
-c 
-c        %---------------------------------------------------%
-c        | ido .ne. 99 implies use of reverse communication  |
-c        | to compute operations involving OP and possibly B |
-c        %---------------------------------------------------%
-c
-         if (ido .ne. 99) go to 9000
-c
-         if (info .gt. 0) then
-c
-c           %-----------------------------------------------------%
-c           | igraphdsaitr was unable to build an Lanczos factorization |
-c           | of length NEV0+NP0. INFO is returned with the size  |  
-c           | of the factorization built. Exit main loop.         |
-c           %-----------------------------------------------------%
-c
-            np = info
-            mxiter = iter
-            info = -9999
-            go to 1200
-         end if
-         update = .false.
-c
-         if (msglvl .gt. 1) then
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &           '_saup2: Current B-norm of residual for factorization')
-         end if
-c 
-c        %--------------------------------------------------------%
-c        | Compute the eigenvalues and corresponding error bounds |
-c        | of the current symmetric tridiagonal matrix.           |
-c        %--------------------------------------------------------%
-c
-         call igraphdseigt (rnorm, kplusp, h, ldh, ritz, bounds, workl, 
-     &        ierr)
-c
-         if (ierr .ne. 0) then
-            info = -8
-            go to 1200
-         end if
-c
-c        %----------------------------------------------------%
-c        | Make a copy of eigenvalues and corresponding error |
-c        | bounds obtained from _seigt.                       |
-c        %----------------------------------------------------%
-c
-         call dcopy(kplusp, ritz, 1, workl(kplusp+1), 1)
-         call dcopy(kplusp, bounds, 1, workl(2*kplusp+1), 1)
-c
-c        %---------------------------------------------------%
-c        | Select the wanted Ritz values and their bounds    |
-c        | to be used in the convergence test.               |
-c        | The selection is based on the requested number of |
-c        | eigenvalues instead of the current NEV and NP to  |
-c        | prevent possible misconvergence.                  |
-c        | * Wanted Ritz values := RITZ(NP+1:NEV+NP)         |
-c        | * Shifts := RITZ(1:NP) := WORKL(1:NP)             |
-c        %---------------------------------------------------%
-c
-         nev = nev0
-         np = np0
-         call igraphdsgets (ishift, which, nev, np, ritz, bounds, workl)
-c 
-c        %-------------------%
-c        | Convergence test. |
-c        %-------------------%
-c
-         call dcopy (nev, bounds(np+1), 1, workl(np+1), 1)
-         call igraphdsconv (nev, ritz(np+1), workl(np+1), tol, nconv)
-c
-         if (msglvl .gt. 2) then
-            kp(1) = nev
-            kp(2) = np
-            kp(3) = nconv
-            call igraphivout (logfil, 3, kp, ndigit,
-     &                  '_saup2: NEV, NP, NCONV are')
-            call igraphdvout (logfil, kplusp, ritz, ndigit,
-     &           '_saup2: The eigenvalues of H')
-            call igraphdvout (logfil, kplusp, bounds, ndigit,
-     &          '_saup2: Ritz estimates of the current NCV Ritz values')
-         end if
-c
-c        %---------------------------------------------------------%
-c        | Count the number of unwanted Ritz values that have zero |
-c        | Ritz estimates. If any Ritz estimates are equal to zero |
-c        | then a leading block of H of order equal to at least    |
-c        | the number of Ritz values with zero Ritz estimates has  |
-c        | split off. None of these Ritz values may be removed by  |
-c        | shifting. Decrease NP the number of shifts to apply. If |
-c        | no shifts may be applied, then prepare to exit          |
-c        %---------------------------------------------------------%
-c
-         nptemp = np
-         do 30 j=1, nptemp
-            if (bounds(j) .eq. zero) then
-               np = np - 1
-               nev = nev + 1
-            end if
- 30      continue
-c 
-         if ( (nconv .ge. nev0) .or. 
-     &        (iter .gt. mxiter) .or.
-     &        (np .eq. 0) ) then
-c     
-c           %------------------------------------------------%
-c           | Prepare to exit. Put the converged Ritz values |
-c           | and corresponding bounds in RITZ(1:NCONV) and  |
-c           | BOUNDS(1:NCONV) respectively. Then sort. Be    |
-c           | careful when NCONV > NP since we don't want to |
-c           | swap overlapping locations.                    |
-c           %------------------------------------------------%
-c
-            if (which .eq. 'BE') then
-c
-c              %-----------------------------------------------------%
-c              | Both ends of the spectrum are requested.            |
-c              | Sort the eigenvalues into algebraically decreasing  |
-c              | order first then swap low end of the spectrum next  |
-c              | to high end in appropriate locations.               |
-c              | NOTE: when np < floor(nev/2) be careful not to swap |
-c              | overlapping locations.                              |
-c              %-----------------------------------------------------%
-c
-               wprime = 'SA'
-               call igraphdsortr (wprime, .true., kplusp, ritz, bounds)
-               nevd2 = nev / 2
-               nevm2 = nev - nevd2 
-               if ( nev .gt. 1 ) then
-                  call dswap ( min(nevd2,np), ritz(nevm2+1), 1,
-     &                 ritz( max(kplusp-nevd2+1,kplusp-np+1) ), 1)
-                  call dswap ( min(nevd2,np), bounds(nevm2+1), 1,
-     &                 bounds( max(kplusp-nevd2+1,kplusp-np)+1 ), 1)
-               end if
-c
-            else
-c
-c              %--------------------------------------------------%
-c              | LM, SM, LA, SA case.                             |
-c              | Sort the eigenvalues of H into the an order that |
-c              | is opposite to WHICH, and apply the resulting    |
-c              | order to BOUNDS.  The eigenvalues are sorted so  |
-c              | that the wanted part are always within the first |
-c              | NEV locations.                                   |
-c              %--------------------------------------------------%
-c
-               if (which .eq. 'LM') wprime = 'SM'
-               if (which .eq. 'SM') wprime = 'LM'
-               if (which .eq. 'LA') wprime = 'SA'
-               if (which .eq. 'SA') wprime = 'LA'
-c
-               call igraphdsortr (wprime, .true., kplusp, ritz, bounds)
-c
-            end if
-c
-c           %--------------------------------------------------%
-c           | Scale the Ritz estimate of each Ritz value       |
-c           | by 1 / max(eps23,magnitude of the Ritz value).   |
-c           %--------------------------------------------------%
-c
-            do 35 j = 1, nev0
-               temp = max( eps23, abs(ritz(j)) )
-               bounds(j) = bounds(j)/temp
- 35         continue
-c
-c           %----------------------------------------------------%
-c           | Sort the Ritz values according to the scaled Ritz  |
-c           | esitmates.  This will push all the converged ones  |
-c           | towards the front of ritzr, ritzi, bounds          |
-c           | (in the case when NCONV < NEV.)                    |
-c           %----------------------------------------------------%
-c
-            wprime = 'LA'
-            call igraphdsortr(wprime, .true., nev0, bounds, ritz)
-c
-c           %----------------------------------------------%
-c           | Scale the Ritz estimate back to its original |
-c           | value.                                       |
-c           %----------------------------------------------%
-c
-            do 40 j = 1, nev0
-                temp = max( eps23, abs(ritz(j)) )
-                bounds(j) = bounds(j)*temp
- 40         continue
-c
-c           %--------------------------------------------------%
-c           | Sort the "converged" Ritz values again so that   |
-c           | the "threshold" values and their associated Ritz |
-c           | estimates appear at the appropriate position in  |
-c           | ritz and bound.                                  |
-c           %--------------------------------------------------%
-c
-            if (which .eq. 'BE') then
-c
-c              %------------------------------------------------%
-c              | Sort the "converged" Ritz values in increasing |
-c              | order.  The "threshold" values are in the      |
-c              | middle.                                        |
-c              %------------------------------------------------%
-c
-               wprime = 'LA'
-               call igraphdsortr(wprime, .true., nconv, ritz, bounds)
-c
-            else
-c
-c              %----------------------------------------------%
-c              | In LM, SM, LA, SA case, sort the "converged" |
-c              | Ritz values according to WHICH so that the   |
-c              | "threshold" value appears at the front of    |
-c              | ritz.                                        |
-c              %----------------------------------------------%
-
-               call igraphdsortr(which, .true., nconv, ritz, bounds)
-c
-            end if
-c
-c           %------------------------------------------%
-c           |  Use h( 1,1 ) as storage to communicate  |
-c           |  rnorm to _seupd if needed               |
-c           %------------------------------------------%
-c
-            h(1,1) = rnorm
-c
-            if (msglvl .gt. 1) then
-               call igraphdvout (logfil, kplusp, ritz, ndigit,
-     &            '_saup2: Sorted Ritz values.')
-               call igraphdvout (logfil, kplusp, bounds, ndigit,
-     &            '_saup2: Sorted ritz estimates.')
-            end if
-c
-c           %------------------------------------%
-c           | Max iterations have been exceeded. | 
-c           %------------------------------------%
-c
-            if (iter .gt. mxiter .and. nconv .lt. nev) info = 1
-c
-c           %---------------------%
-c           | No shifts to apply. | 
-c           %---------------------%
-c
-            if (np .eq. 0 .and. nconv .lt. nev0) info = 2
-c
-            np = nconv
-            go to 1100
-c
-         else if (nconv .lt. nev .and. ishift .eq. 1) then
-c
-c           %---------------------------------------------------%
-c           | Do not have all the requested eigenvalues yet.    |
-c           | To prevent possible stagnation, adjust the number |
-c           | of Ritz values and the shifts.                    |
-c           %---------------------------------------------------%
-c
-            nevbef = nev
-            nev = nev + min (nconv, np/2)
-            if (nev .eq. 1 .and. kplusp .ge. 6) then
-               nev = kplusp / 2
-            else if (nev .eq. 1 .and. kplusp .gt. 2) then
-               nev = 2
-            end if
-            np  = kplusp - nev
-c     
-c           %---------------------------------------%
-c           | If the size of NEV was just increased |
-c           | resort the eigenvalues.               |
-c           %---------------------------------------%
-c     
-            if (nevbef .lt. nev) 
-     &         call igraphdsgets (ishift, which, nev, np, ritz, bounds,
-     &              workl)
-c
-         end if
-c
-         if (msglvl .gt. 0) then
-            call igraphivout (logfil, 1, nconv, ndigit,
-     &           '_saup2: no. of "converged" Ritz values at this iter.')
-            if (msglvl .gt. 1) then
-               kp(1) = nev
-               kp(2) = np
-               call igraphivout (logfil, 2, kp, ndigit,
-     &              '_saup2: NEV and NP are')
-               call igraphdvout (logfil, nev, ritz(np+1), ndigit,
-     &              '_saup2: "wanted" Ritz values.')
-               call igraphdvout (logfil, nev, bounds(np+1), ndigit,
-     &              '_saup2: Ritz estimates of the "wanted" values ')
-            end if
-         end if
-
-c 
-         if (ishift .eq. 0) then
-c
-c           %-----------------------------------------------------%
-c           | User specified shifts: reverse communication to     |
-c           | compute the shifts. They are returned in the first  |
-c           | NP locations of WORKL.                              |
-c           %-----------------------------------------------------%
-c
-            ushift = .true.
-            ido = 3
-            go to 9000
-         end if
-c
-   50    continue
-c
-c        %------------------------------------%
-c        | Back from reverse communication;   |
-c        | User specified shifts are returned |
-c        | in WORKL(1:*NP)                   |
-c        %------------------------------------%
-c
-         ushift = .false.
-c 
-c 
-c        %---------------------------------------------------------%
-c        | Move the NP shifts to the first NP locations of RITZ to |
-c        | free up WORKL.  This is for the non-exact shift case;   |
-c        | in the exact shift case, igraphdsgets already handles this.   |
-c        %---------------------------------------------------------%
-c
-         if (ishift .eq. 0) call dcopy (np, workl, 1, ritz, 1)
-c
-         if (msglvl .gt. 2) then
-            call igraphivout (logfil, 1, np, ndigit,
-     &                  '_saup2: The number of shifts to apply ')
-            call igraphdvout (logfil, np, workl, ndigit,
-     &                  '_saup2: shifts selected')
-            if (ishift .eq. 1) then
-               call igraphdvout (logfil, np, bounds, ndigit,
-     &                  '_saup2: corresponding Ritz estimates')
-             end if
-         end if
-c 
-c        %---------------------------------------------------------%
-c        | Apply the NP0 implicit shifts by QR bulge chasing.      |
-c        | Each shift is applied to the entire tridiagonal matrix. |
-c        | The first 2*N locations of WORKD are used as workspace. |
-c        | After igraphdsapps is done, we have a Lanczos                 |
-c        | factorization of length NEV.                            |
-c        %---------------------------------------------------------%
-c
-         call igraphdsapps (n, nev, np, ritz, v, ldv, h, ldh, resid, 
-     &        q, ldq, workd)
-c
-c        %---------------------------------------------%
-c        | Compute the B-norm of the updated residual. |
-c        | Keep B*RESID in WORKD(1:N) to be used in    |
-c        | the first step of the next call to igraphdsaitr.  |
-c        %---------------------------------------------%
-c
-         cnorm = .true.
-         call igraphsecond (t2)
-         if (bmat .eq. 'G') then
-            nbx = nbx + 1
-            call dcopy (n, resid, 1, workd(n+1), 1)
-            ipntr(1) = n + 1
-            ipntr(2) = 1
-            ido = 2
-c 
-c           %----------------------------------%
-c           | Exit in order to compute B*RESID |
-c           %----------------------------------%
-c 
-            go to 9000
-         else if (bmat .eq. 'I') then
-            call dcopy (n, resid, 1, workd, 1)
-         end if
-c 
-  100    continue
-c 
-c        %----------------------------------%
-c        | Back from reverse communication; |
-c        | WORKD(1:N) := B*RESID            |
-c        %----------------------------------%
-c
-         if (bmat .eq. 'G') then
-            call igraphsecond (t3)
-            tmvbx = tmvbx + (t3 - t2)
-         end if
-c 
-         if (bmat .eq. 'G') then         
-            rnorm = ddot (n, resid, 1, workd, 1)
-            rnorm = sqrt(abs(rnorm))
-         else if (bmat .eq. 'I') then
-            rnorm = dnrm2(n, resid, 1)
-         end if
-         cnorm = .false.
-  130    continue
-c
-         if (msglvl .gt. 2) then
-            call igraphdvout (logfil, 1, rnorm, ndigit, 
-     &      '_saup2: B-norm of residual for NEV factorization')
-            call igraphdvout (logfil, nev, h(1,2), ndigit,
-     &           '_saup2: main diagonal of compressed H matrix')
-            call igraphdvout (logfil, nev-1, h(2,1), ndigit,
-     &           '_saup2: subdiagonal of compressed H matrix')
-         end if
-c 
-      go to 1000
-c
-c     %---------------------------------------------------------------%
-c     |                                                               |
-c     |  E N D     O F     M A I N     I T E R A T I O N     L O O P  |
-c     |                                                               |
-c     %---------------------------------------------------------------%
-c 
- 1100 continue
-c
-      mxiter = iter
-      nev = nconv
-c 
- 1200 continue
-      ido = 99
-c
-c     %------------%
-c     | Error exit |
-c     %------------%
-c
-      call igraphsecond (t1)
-      tsaup2 = t1 - t0
-c 
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdsaup2 |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsaupd.f igraph-0.6.5/interfaces/R/arpack/dsaupd.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsaupd.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsaupd.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,653 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsaupd
-c
-c\Description: 
-c
-c  Reverse communication interface for the Implicitly Restarted Arnoldi 
-c  Iteration.  For symmetric problems this reduces to a variant of the Lanczos 
-c  method.  This method has been designed to compute approximations to a 
-c  few eigenpairs of a linear operator OP that is real and symmetric 
-c  with respect to a real positive semi-definite symmetric matrix B, 
-c  i.e.
-c                   
-c       B*OP = (OP')*B.  
-c
-c  Another way to express this condition is 
-c
-c       < x,OPy > = < OPx,y >  where < z,w > = z'Bw  .
-c  
-c  In the standard eigenproblem B is the identity matrix.  
-c  ( A' denotes transpose of A)
-c
-c  The computed approximate eigenvalues are called Ritz values and
-c  the corresponding approximate eigenvectors are called Ritz vectors.
-c
-c  igraphdsaupd is usually called iteratively to solve one of the 
-c  following problems:
-c
-c  Mode 1:  A*x = lambda*x, A symmetric 
-c           ===> OP = A  and  B = I.
-c
-c  Mode 2:  A*x = lambda*M*x, A symmetric, M symmetric positive definite
-c           ===> OP = inv[M]*A  and  B = M.
-c           ===> (If M can be factored see remark 3 below)
-c
-c  Mode 3:  K*x = lambda*M*x, K symmetric, M symmetric positive semi-definite
-c           ===> OP = (inv[K - sigma*M])*M  and  B = M. 
-c           ===> Shift-and-Invert mode
-c
-c  Mode 4:  K*x = lambda*KG*x, K symmetric positive semi-definite, 
-c           KG symmetric indefinite
-c           ===> OP = (inv[K - sigma*KG])*K  and  B = K.
-c           ===> Buckling mode
-c
-c  Mode 5:  A*x = lambda*M*x, A symmetric, M symmetric positive semi-definite
-c           ===> OP = inv[A - sigma*M]*[A + sigma*M]  and  B = M.
-c           ===> Cayley transformed mode
-c
-c  NOTE: The action of w <- inv[A - sigma*M]*v or w <- inv[M]*v
-c        should be accomplished either by a direct method
-c        using a sparse matrix factorization and solving
-c
-c           [A - sigma*M]*w = v  or M*w = v,
-c
-c        or through an iterative method for solving these
-c        systems.  If an iterative method is used, the
-c        convergence test must be more stringent than
-c        the accuracy requirements for the eigenvalue
-c        approximations.
-c
-c\Usage:
-c  call igraphdsaupd 
-c     ( IDO, BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM,
-c       IPNTR, WORKD, WORKL, LWORKL, INFO )
-c
-c\Arguments
-c  IDO     Integer.  (INPUT/OUTPUT)
-c          Reverse communication flag.  IDO must be zero on the first 
-c          call to igraphdsaupd.  IDO will be set internally to
-c          indicate the type of operation to be performed.  Control is
-c          then given back to the calling routine which has the
-c          responsibility to carry out the requested operation and call
-c          igraphdsaupd with the result.  The operand is given in
-c          WORKD(IPNTR(1)), the result must be put in WORKD(IPNTR(2)).
-c          (If Mode = 2 see remark 5 below)
-c          -------------------------------------------------------------
-c          IDO =  0: first call to the reverse communication interface
-c          IDO = -1: compute  Y = OP * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c                    This is for the initialization phase to force the
-c                    starting vector into the range of OP.
-c          IDO =  1: compute  Y = OP * X where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c                    In mode 3,4 and 5, the vector B * X is already
-c                    available in WORKD(ipntr(3)).  It does not
-c                    need to be recomputed in forming OP * X.
-c          IDO =  2: compute  Y = B * X  where
-c                    IPNTR(1) is the pointer into WORKD for X,
-c                    IPNTR(2) is the pointer into WORKD for Y.
-c          IDO =  3: compute the IPARAM(8) shifts where
-c                    IPNTR(11) is the pointer into WORKL for
-c                    placing the shifts. See remark 6 below.
-c          IDO = 99: done
-c          -------------------------------------------------------------
-c             
-c  BMAT    Character*1.  (INPUT)
-c          BMAT specifies the type of the matrix B that defines the
-c          semi-inner product for the operator OP.
-c          B = 'I' -> standard eigenvalue problem A*x = lambda*x
-c          B = 'G' -> generalized eigenvalue problem A*x = lambda*B*x
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the eigenproblem.
-c
-c  WHICH   Character*2.  (INPUT)
-c          Specify which of the Ritz values of OP to compute.
-c
-c          'LA' - compute the NEV largest (algebraic) eigenvalues.
-c          'SA' - compute the NEV smallest (algebraic) eigenvalues.
-c          'LM' - compute the NEV largest (in magnitude) eigenvalues.
-c          'SM' - compute the NEV smallest (in magnitude) eigenvalues. 
-c          'BE' - compute NEV eigenvalues, half from each end of the
-c                 spectrum.  When NEV is odd, compute one more from the
-c                 high end than from the low end.
-c           (see remark 1 below)
-c
-c  NEV     Integer.  (INPUT)
-c          Number of eigenvalues of OP to be computed. 0 < NEV < N.
-c
-c  TOL     Double precision scalar.  (INPUT)
-c          Stopping criterion: the relative accuracy of the Ritz value 
-c          is considered acceptable if BOUNDS(I) .LE. TOL*ABS(RITZ(I)).
-c          If TOL .LE. 0. is passed a default is set:
-c          DEFAULT = DLAMCH('EPS')  (machine precision as computed
-c                    by the LAPACK auxiliary subroutine DLAMCH).
-c
-c  RESID   Double precision array of length N.  (INPUT/OUTPUT)
-c          On INPUT: 
-c          If INFO .EQ. 0, a random initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          On OUTPUT:
-c          RESID contains the final residual vector. 
-c
-c  NCV     Integer.  (INPUT)
-c          Number of columns of the matrix V (less than or equal to N).
-c          This will indicate how many Lanczos vectors are generated 
-c          at each iteration.  After the startup phase in which NEV 
-c          Lanczos vectors are generated, the algorithm generates 
-c          NCV-NEV Lanczos vectors at each subsequent update iteration.
-c          Most of the cost in generating each Lanczos vector is in the 
-c          matrix-vector product OP*x. (See remark 4 below).
-c
-c  V       Double precision N by NCV array.  (OUTPUT)
-c          The NCV columns of V contain the Lanczos basis vectors.
-c
-c  LDV     Integer.  (INPUT)
-c          Leading dimension of V exactly as declared in the calling
-c          program.
-c
-c  IPARAM  Integer array of length 11.  (INPUT/OUTPUT)
-c          IPARAM(1) = ISHIFT: method for selecting the implicit shifts.
-c          The shifts selected at each iteration are used to restart
-c          the Arnoldi iteration in an implicit fashion.
-c          -------------------------------------------------------------
-c          ISHIFT = 0: the shifts are provided by the user via
-c                      reverse communication.  The NCV eigenvalues of
-c                      the current tridiagonal matrix T are returned in
-c                      the part of WORKL array corresponding to RITZ.
-c                      See remark 6 below.
-c          ISHIFT = 1: exact shifts with respect to the reduced 
-c                      tridiagonal matrix T.  This is equivalent to 
-c                      restarting the iteration with a starting vector 
-c                      that is a linear combination of Ritz vectors 
-c                      associated with the "wanted" Ritz values.
-c          -------------------------------------------------------------
-c
-c          IPARAM(2) = LEVEC
-c          No longer referenced. See remark 2 below.
-c
-c          IPARAM(3) = MXITER
-c          On INPUT:  maximum number of Arnoldi update iterations allowed. 
-c          On OUTPUT: actual number of Arnoldi update iterations taken. 
-c
-c          IPARAM(4) = NB: blocksize to be used in the recurrence.
-c          The code currently works only for NB = 1.
-c
-c          IPARAM(5) = NCONV: number of "converged" Ritz values.
-c          This represents the number of Ritz values that satisfy
-c          the convergence criterion.
-c
-c          IPARAM(6) = IUPD
-c          No longer referenced. Implicit restarting is ALWAYS used. 
-c
-c          IPARAM(7) = MODE
-c          On INPUT determines what type of eigenproblem is being solved.
-c          Must be 1,2,3,4,5; See under \Description of igraphdsaupd for the 
-c          five modes available.
-c
-c          IPARAM(8) = NP
-c          When ido = 3 and the user provides shifts through reverse
-c          communication (IPARAM(1)=0), igraphdsaupd returns NP, the number
-c          of shifts the user is to provide. 0 < NP <=NCV-NEV. See Remark
-c          6 below.
-c
-c          IPARAM(9) = NUMOP, IPARAM(10) = NUMOPB, IPARAM(11) = NUMREO,
-c          OUTPUT: NUMOP  = total number of OP*x operations,
-c                  NUMOPB = total number of B*x operations if BMAT='G',
-c                  NUMREO = total number of steps of re-orthogonalization.        
-c
-c  IPNTR   Integer array of length 11.  (OUTPUT)
-c          Pointer to mark the starting locations in the WORKD and WORKL
-c          arrays for matrices/vectors used by the Lanczos iteration.
-c          -------------------------------------------------------------
-c          IPNTR(1): pointer to the current operand vector X in WORKD.
-c          IPNTR(2): pointer to the current result vector Y in WORKD.
-c          IPNTR(3): pointer to the vector B * X in WORKD when used in 
-c                    the shift-and-invert mode.
-c          IPNTR(4): pointer to the next available location in WORKL
-c                    that is untouched by the program.
-c          IPNTR(5): pointer to the NCV by 2 tridiagonal matrix T in WORKL.
-c          IPNTR(6): pointer to the NCV RITZ values array in WORKL.
-c          IPNTR(7): pointer to the Ritz estimates in array WORKL associated
-c                    with the Ritz values located in RITZ in WORKL.
-c          IPNTR(11): pointer to the NP shifts in WORKL. See Remark 6 below.
-c
-c          Note: IPNTR(8:10) is only referenced by igraphdseupd. See Remark 2.
-c          IPNTR(8): pointer to the NCV RITZ values of the original system.
-c          IPNTR(9): pointer to the NCV corresponding error bounds.
-c          IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors
-c                     of the tridiagonal matrix T. Only referenced by
-c                     igraphdseupd if RVEC = .TRUE. See Remarks.
-c          -------------------------------------------------------------
-c          
-c  WORKD   Double precision work array of length 3*N.  (REVERSE COMMUNICATION)
-c          Distributed array to be used in the basic Arnoldi iteration
-c          for reverse communication.  The user should not use WORKD 
-c          as temporary workspace during the iteration. Upon termination
-c          WORKD(1:N) contains B*RESID(1:N). If the Ritz vectors are desired
-c          subroutine igraphdseupd uses this output.
-c          See Data Distribution Note below.  
-c
-c  WORKL   Double precision work array of length LWORKL.  (OUTPUT/WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.  See Data Distribution Note below.
-c
-c  LWORKL  Integer.  (INPUT)
-c          LWORKL must be at least NCV**2 + 8*NCV .
-c
-c  INFO    Integer.  (INPUT/OUTPUT)
-c          If INFO .EQ. 0, a randomly initial residual vector is used.
-c          If INFO .NE. 0, RESID contains the initial residual vector,
-c                          possibly from a previous run.
-c          Error flag on output.
-c          =  0: Normal exit.
-c          =  1: Maximum number of iterations taken.
-c                All possible eigenvalues of OP has been found. IPARAM(5)  
-c                returns the number of wanted converged Ritz values.
-c          =  2: No longer an informational error. Deprecated starting
-c                with release 2 of ARPACK.
-c          =  3: No shifts could be applied during a cycle of the 
-c                Implicitly restarted Arnoldi iteration. One possibility 
-c                is to increase the size of NCV relative to NEV. 
-c                See remark 4 below.
-c          = -1: N must be positive.
-c          = -2: NEV must be positive.
-c          = -3: NCV must be greater than NEV and less than or equal to N.
-c          = -4: The maximum number of Arnoldi update iterations allowed
-c                must be greater than zero.
-c          = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'.
-c          = -6: BMAT must be one of 'I' or 'G'.
-c          = -7: Length of private work array WORKL is not sufficient.
-c          = -8: Error return from trid. eigenvalue calculation;
-c                Informatinal error from LAPACK routine dsteqr.
-c          = -9: Starting vector is zero.
-c          = -10: IPARAM(7) must be 1,2,3,4,5.
-c          = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatable.
-c          = -12: IPARAM(1) must be equal to 0 or 1.
-c          = -13: NEV and WHICH = 'BE' are incompatable.
-c          = -9999: Could not build an Arnoldi factorization.
-c                   IPARAM(5) returns the size of the current Arnoldi
-c                   factorization. The user is advised to check that
-c                   enough workspace and array storage has been allocated.
-c
-c
-c\Remarks
-c  1. The converged Ritz values are always returned in ascending 
-c     algebraic order.  The computed Ritz values are approximate
-c     eigenvalues of OP.  The selection of WHICH should be made
-c     with this in mind when Mode = 3,4,5.  After convergence, 
-c     approximate eigenvalues of the original problem may be obtained 
-c     with the ARPACK subroutine igraphdseupd. 
-c
-c  2. If the Ritz vectors corresponding to the converged Ritz values
-c     are needed, the user must call igraphdseupd immediately following completion
-c     of igraphdsaupd. This is new starting with version 2.1 of ARPACK.
-c
-c  3. If M can be factored into a Cholesky factorization M = LL'
-c     then Mode = 2 should not be selected.  Instead one should use
-c     Mode = 1 with  OP = inv(L)*A*inv(L').  Appropriate triangular 
-c     linear systems should be solved with L and L' rather
-c     than computing inverses.  After convergence, an approximate
-c     eigenvector z of the original problem is recovered by solving
-c     L'z = x  where x is a Ritz vector of OP.
-c
-c  4. At present there is no a-priori analysis to guide the selection
-c     of NCV relative to NEV.  The only formal requrement is that NCV > NEV.
-c     However, it is recommended that NCV .ge. 2*NEV.  If many problems of
-c     the same type are to be solved, one should experiment with increasing
-c     NCV while keeping NEV fixed for a given test problem.  This will 
-c     usually decrease the required number of OP*x operations but it
-c     also increases the work and storage required to maintain the orthogonal
-c     basis vectors.   The optimal "cross-over" with respect to CPU time
-c     is problem dependent and must be determined empirically.
-c
-c  5. If IPARAM(7) = 2 then in the Reverse commuication interface the user
-c     must do the following. When IDO = 1, Y = OP * X is to be computed.
-c     When IPARAM(7) = 2 OP = inv(B)*A. After computing A*X the user
-c     must overwrite X with A*X. Y is then the solution to the linear set
-c     of equations B*Y = A*X.
-c
-c  6. When IPARAM(1) = 0, and IDO = 3, the user needs to provide the 
-c     NP = IPARAM(8) shifts in locations: 
-c     1   WORKL(IPNTR(11))           
-c     2   WORKL(IPNTR(11)+1)         
-c                        .           
-c                        .           
-c                        .      
-c     NP  WORKL(IPNTR(11)+NP-1). 
-c
-c     The eigenvalues of the current tridiagonal matrix are located in 
-c     WORKL(IPNTR(6)) through WORKL(IPNTR(6)+NCV-1). They are in the
-c     order defined by WHICH. The associated Ritz estimates are located in
-c     WORKL(IPNTR(8)), WORKL(IPNTR(8)+1), ... , WORKL(IPNTR(8)+NCV-1).
-c
-c-----------------------------------------------------------------------
-c
-c\Data Distribution Note:
-c
-c  Fortran-D syntax:
-c  ================
-c  REAL       RESID(N), V(LDV,NCV), WORKD(3*N), WORKL(LWORKL)
-c  DECOMPOSE  D1(N), D2(N,NCV)
-c  ALIGN      RESID(I) with D1(I)
-c  ALIGN      V(I,J)   with D2(I,J)
-c  ALIGN      WORKD(I) with D1(I)     range (1:N)
-c  ALIGN      WORKD(I) with D1(I-N)   range (N+1:2*N)
-c  ALIGN      WORKD(I) with D1(I-2*N) range (2*N+1:3*N)
-c  DISTRIBUTE D1(BLOCK), D2(BLOCK,:)
-c  REPLICATED WORKL(LWORKL)
-c
-c  Cray MPP syntax:
-c  ===============
-c  REAL       RESID(N), V(LDV,NCV), WORKD(N,3), WORKL(LWORKL)
-c  SHARED     RESID(BLOCK), V(BLOCK,:), WORKD(BLOCK,:)
-c  REPLICATED WORKL(LWORKL)
-c  
-c
-c\BeginLib
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c  3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
-c     1980.
-c  4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
-c     Computer Physics Communications, 53 (1989), pp 169-179.
-c  5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
-c     Implement the Spectral Transformation", Math. Comp., 48 (1987),
-c     pp 663-673.
-c  6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos 
-c     Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", 
-c     SIAM J. Matr. Anal. Apps.,  January (1993).
-c  7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
-c     for Updating the QR decomposition", ACM TOMS, December 1990,
-c     Volume 16 Number 4, pp 369-377.
-c  8. R.B. Lehoucq, D.C. Sorensen, "Implementation of Some Spectral
-c     Transformations in a k-Step Arnoldi Method". In Preparation.
-c
-c\Routines called:
-c     igraphdsaup2  ARPACK routine that implements the Implicitly Restarted
-c             Arnoldi Iteration.
-c     igraphdstats  ARPACK routine that initialize timing and other statistics
-c             variables.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dlamch  LAPACK routine that determines machine constants.
-c
-c\Authors
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c 
-c\Revision history:
-c     12/15/93: Version ' 2.4'
-c
-c\SCCS Information: @(#) 
-c FILE: saupd.F   SID: 2.7   DATE OF SID: 8/27/96   RELEASE: 2 
-c
-c\Remarks
-c     1. None
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsaupd
-     &   ( ido, bmat, n, which, nev, tol, resid, ncv, v, ldv, iparam, 
-     &     ipntr, workd, workl, lworkl, info )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat*1, which*2
-      integer    ido, info, ldv, lworkl, n, ncv, nev
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    iparam(11), ipntr(11)
-      Double precision
-     &           resid(n), v(ldv,ncv), workd(3*n), workl(lworkl)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    bounds, ierr, ih, iq, ishift, iupd, iw, 
-     &           ldh, ldq, msglvl, mxiter, mode, nb,
-     &           nev0, next, np, ritz, j
-      save       bounds, ierr, ih, iq, ishift, iupd, iw,
-     &           ldh, ldq, msglvl, mxiter, mode, nb,
-     &           nev0, next, np, ritz
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   igraphdsaup2,  igraphdvout, igraphivout, 
-     &     igraphsecond, igraphdstats
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dlamch
-      external   dlamch
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-      if (ido .eq. 0) then
-c
-c        %-------------------------------%
-c        | Initialize timing statistics  |
-c        | & message level for debugging |
-c        %-------------------------------%
-c
-         call igraphdstats
-         call igraphsecond (t0)
-         msglvl = msaupd
-c
-         ierr   = 0
-         ishift = iparam(1)
-         mxiter = iparam(3)
-         nb     = iparam(4)
-c
-c        %--------------------------------------------%
-c        | Revision 2 performs only implicit restart. |
-c        %--------------------------------------------%
-c
-         iupd   = 1
-         mode   = iparam(7)
-c
-c        %----------------%
-c        | Error checking |
-c        %----------------%
-c
-         if (n .le. 0) then
-            ierr = -1
-         else if (nev .le. 0) then
-            ierr = -2
-         else if (ncv .le. nev .or.  ncv .gt. n) then
-            ierr = -3
-         end if
-c
-c        %----------------------------------------------%
-c        | NP is the number of additional steps to      |
-c        | extend the length NEV Lanczos factorization. |
-c        %----------------------------------------------%
-c
-         np     = ncv - nev
-c 
-         if (mxiter .le. 0)                     ierr = -4
-         if (which .ne. 'LM' .and.
-     &       which .ne. 'SM' .and.
-     &       which .ne. 'LA' .and.
-     &       which .ne. 'SA' .and.
-     &       which .ne. 'BE')                   ierr = -5
-         if (bmat .ne. 'I' .and. bmat .ne. 'G') ierr = -6
-c
-         if (lworkl .lt. ncv**2 + 8*ncv)        ierr = -7
-         if (mode .lt. 1 .or. mode .gt. 5) then
-                                                ierr = -10
-         else if (mode .eq. 1 .and. bmat .eq. 'G') then
-                                                ierr = -11
-         else if (ishift .lt. 0 .or. ishift .gt. 1) then
-                                                ierr = -12
-         else if (nev .eq. 1 .and. which .eq. 'BE') then
-                                                ierr = -13
-         end if
-c 
-c        %------------%
-c        | Error Exit |
-c        %------------%
-c
-         if (ierr .ne. 0) then
-            info = ierr
-            ido  = 99
-            go to 9000
-         end if
-c 
-c        %------------------------%
-c        | Set default parameters |
-c        %------------------------%
-c
-         if (nb .le. 0)                         nb = 1
-         if (tol .le. zero)                     tol = dlamch('EpsMach')
-c
-c        %----------------------------------------------%
-c        | NP is the number of additional steps to      |
-c        | extend the length NEV Lanczos factorization. |
-c        | NEV0 is the local variable designating the   |
-c        | size of the invariant subspace desired.      |
-c        %----------------------------------------------%
-c
-         np     = ncv - nev
-         nev0   = nev 
-c 
-c        %-----------------------------%
-c        | Zero out internal workspace |
-c        %-----------------------------%
-c
-         do 10 j = 1, ncv**2 + 8*ncv
-            workl(j) = zero
- 10      continue
-c 
-c        %-------------------------------------------------------%
-c        | Pointer into WORKL for address of H, RITZ, BOUNDS, Q  |
-c        | etc... and the remaining workspace.                   |
-c        | Also update pointer to be used on output.             |
-c        | Memory is laid out as follows:                        |
-c        | workl(1:2*ncv) := generated tridiagonal matrix        |
-c        | workl(2*ncv+1:2*ncv+ncv) := ritz values               |
-c        | workl(3*ncv+1:3*ncv+ncv) := computed error bounds     |
-c        | workl(4*ncv+1:4*ncv+ncv*ncv) := rotation matrix Q     |
-c        | workl(4*ncv+ncv*ncv+1:7*ncv+ncv*ncv) := workspace     |
-c        %-------------------------------------------------------%
-c
-         ldh    = ncv
-         ldq    = ncv
-         ih     = 1
-         ritz   = ih     + 2*ldh
-         bounds = ritz   + ncv
-         iq     = bounds + ncv
-         iw     = iq     + ncv**2
-         next   = iw     + 3*ncv
-c
-         ipntr(4) = next
-         ipntr(5) = ih
-         ipntr(6) = ritz
-         ipntr(7) = bounds
-         ipntr(11) = iw
-      end if
-c
-c     %-------------------------------------------------------%
-c     | Carry out the Implicitly restarted Lanczos Iteration. |
-c     %-------------------------------------------------------%
-c
-      call igraphdsaup2 
-     &   ( ido, bmat, n, which, nev0, np, tol, resid, mode, iupd,
-     &     ishift, mxiter, v, ldv, workl(ih), ldh, workl(ritz),
-     &     workl(bounds), workl(iq), ldq, workl(iw), ipntr, workd,
-     &     info )
-c
-c     %--------------------------------------------------%
-c     | ido .ne. 99 implies use of reverse communication |
-c     | to compute operations involving OP or shifts.    |
-c     %--------------------------------------------------%
-c
-      if (ido .eq. 3) iparam(8) = np
-      if (ido .ne. 99) go to 9000
-c 
-      iparam(3) = mxiter
-      iparam(5) = np
-      iparam(9) = nopx
-      iparam(10) = nbx
-      iparam(11) = nrorth
-c
-c     %------------------------------------%
-c     | Exit if there was an informational |
-c     | error within igraphdsaup2.               |
-c     %------------------------------------%
-c
-      if (info .lt. 0) go to 9000
-      if (info .eq. 2) info = 3
-c
-      if (msglvl .gt. 0) then
-         call igraphivout (logfil, 1, mxiter, ndigit,
-     &               '_saupd: number of update iterations taken')
-         call igraphivout (logfil, 1, np, ndigit,
-     &               '_saupd: number of "converged" Ritz values')
-         call igraphdvout (logfil, np, workl(Ritz), ndigit, 
-     &               '_saupd: final Ritz values')
-         call igraphdvout (logfil, np, workl(Bounds), ndigit, 
-     &               '_saupd: corresponding error bounds')
-      end if 
-c
-      call igraphsecond (t1)
-      tsaupd = t1 - t0
-c 
-c 
- 9000 continue
-c 
-      return
-c
-c     %---------------%
-c     | End of igraphdsaupd |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsconv.f igraph-0.6.5/interfaces/R/arpack/dsconv.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsconv.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsconv.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,138 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsconv
-c
-c\Description: 
-c  Convergence testing for the symmetric Arnoldi eigenvalue routine.
-c
-c\Usage:
-c  call igraphdsconv
-c     ( N, RITZ, BOUNDS, TOL, NCONV )
-c
-c\Arguments
-c  N       Integer.  (INPUT)
-c          Number of Ritz values to check for convergence.
-c
-c  RITZ    Double precision array of length N.  (INPUT)
-c          The Ritz values to be checked for convergence.
-c
-c  BOUNDS  Double precision array of length N.  (INPUT)
-c          Ritz estimates associated with the Ritz values in RITZ.
-c
-c  TOL     Double precision scalar.  (INPUT)
-c          Desired relative accuracy for a Ritz value to be considered
-c          "converged".
-c
-c  NCONV   Integer scalar.  (OUTPUT)
-c          Number of "converged" Ritz values.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Routines called:
-c     igraphsecond  ARPACK utility routine for timing.
-c     dlamch  LAPACK routine that determines machine constants. 
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\SCCS Information: @(#) 
-c FILE: sconv.F   SID: 2.4   DATE OF SID: 4/19/96   RELEASE: 2
-c
-c\Remarks
-c     1. Starting with version 2.4, this routine no longer uses the
-c        Parlett strategy using the gap conditions. 
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsconv (n, ritz, bounds, tol, nconv)
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    n, nconv
-      Double precision
-     &           tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           ritz(n), bounds(n)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i
-      Double precision
-     &           temp, eps23
-c
-c     %-------------------%
-c     | External routines |
-c     %-------------------%
-c
-      Double precision
-     &           dlamch
-      external   dlamch
-
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    abs
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      call igraphsecond (t0)
-c
-      eps23 = dlamch('Epsilon-Machine') 
-      eps23 = eps23**(2.0D+0 / 3.0D+0)
-c
-      nconv  = 0
-      do 10 i = 1, n
-c
-c        %-----------------------------------------------------%
-c        | The i-th Ritz value is considered "converged"       |
-c        | when: bounds(i) .le. TOL*max(eps23, abs(ritz(i)))   |
-c        %-----------------------------------------------------%
-c
-         temp = max( eps23, abs(ritz(i)) )
-         if ( bounds(i) .le. tol*temp ) then
-            nconv = nconv + 1
-         end if
-c
-   10 continue
-c 
-      call igraphsecond (t1)
-      tsconv = tsconv + (t1 - t0)
-c 
-      return
-c
-c     %---------------%
-c     | End of igraphdsconv |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dseigt.f igraph-0.6.5/interfaces/R/arpack/dseigt.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dseigt.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dseigt.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,181 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdseigt
-c
-c\Description: 
-c  Compute the eigenvalues of the current symmetric tridiagonal matrix
-c  and the corresponding error bounds given the current residual norm.
-c
-c\Usage:
-c  call igraphdseigt
-c     ( RNORM, N, H, LDH, EIG, BOUNDS, WORKL, IERR )
-c
-c\Arguments
-c  RNORM   Double precision scalar.  (INPUT)
-c          RNORM contains the residual norm corresponding to the current
-c          symmetric tridiagonal matrix H.
-c
-c  N       Integer.  (INPUT)
-c          Size of the symmetric tridiagonal matrix H.
-c
-c  H       Double precision N by 2 array.  (INPUT)
-c          H contains the symmetric tridiagonal matrix with the 
-c          subdiagonal in the first column starting at H(2,1) and the 
-c          main diagonal in igraphsecond column.
-c
-c  LDH     Integer.  (INPUT)
-c          Leading dimension of H exactly as declared in the calling 
-c          program.
-c
-c  EIG     Double precision array of length N.  (OUTPUT)
-c          On output, EIG contains the N eigenvalues of H possibly 
-c          unsorted.  The BOUNDS arrays are returned in the
-c          same sorted order as EIG.
-c
-c  BOUNDS  Double precision array of length N.  (OUTPUT)
-c          On output, BOUNDS contains the error estimates corresponding
-c          to the eigenvalues EIG.  This is equal to RNORM times the
-c          last components of the eigenvectors corresponding to the
-c          eigenvalues in EIG.
-c
-c  WORKL   Double precision work array of length 3*N.  (WORKSPACE)
-c          Private (replicated) array on each PE or array allocated on
-c          the front end.
-c
-c  IERR    Integer.  (OUTPUT)
-c          Error exit flag from igraphdstqrb.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphdstqrb  ARPACK routine that computes the eigenvalues and the
-c             last components of the eigenvectors of a symmetric
-c             and tridiagonal matrix.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.4'
-c
-c\SCCS Information: @(#) 
-c FILE: seigt.F   SID: 2.4   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\Remarks
-c     None
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdseigt 
-     &   ( rnorm, n, h, ldh, eig, bounds, workl, ierr )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    ierr, ldh, n
-      Double precision
-     &           rnorm
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           eig(n), bounds(n), h(ldh,2), workl(3*n)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           zero
-      parameter (zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i, k, msglvl
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, igraphdstqrb, igraphdvout, igraphsecond
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------% 
-c
-      call igraphsecond (t0)
-      msglvl = mseigt
-c
-      if (msglvl .gt. 0) then
-         call igraphdvout (logfil, n, h(1,2), ndigit,
-     &              '_seigt: main diagonal of matrix H')
-         if (n .gt. 1) then
-         call igraphdvout (logfil, n-1, h(2,1), ndigit,
-     &              '_seigt: sub diagonal of matrix H')
-         end if
-      end if
-c
-      call dcopy  (n, h(1,2), 1, eig, 1)
-      call dcopy  (n-1, h(2,1), 1, workl, 1)
-      call igraphdstqrb (n, eig, workl, bounds, workl(n+1), ierr)
-      if (ierr .ne. 0) go to 9000
-      if (msglvl .gt. 1) then
-         call igraphdvout (logfil, n, bounds, ndigit,
-     &              '_seigt: last row of the eigenvector matrix for H')
-      end if
-c
-c     %-----------------------------------------------%
-c     | Finally determine the error bounds associated |
-c     | with the n Ritz values of H.                  |
-c     %-----------------------------------------------%
-c
-      do 30 k = 1, n
-         bounds(k) = rnorm*abs(bounds(k))
-   30 continue
-c 
-      call igraphsecond (t1)
-      tseigt = tseigt + (t1 - t0)
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdseigt |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsesrt.f igraph-0.6.5/interfaces/R/arpack/dsesrt.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsesrt.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsesrt.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,217 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsesrt
-c
-c\Description:
-c  Sort the array X in the order specified by WHICH and optionally 
-c  apply the permutation to the columns of the matrix A.
-c
-c\Usage:
-c  call igraphdsesrt
-c     ( WHICH, APPLY, N, X, NA, A, LDA)
-c
-c\Arguments
-c  WHICH   Character*2.  (Input)
-c          'LM' -> X is sorted into increasing order of magnitude.
-c          'SM' -> X is sorted into decreasing order of magnitude.
-c          'LA' -> X is sorted into increasing order of algebraic.
-c          'SA' -> X is sorted into decreasing order of algebraic.
-c
-c  APPLY   Logical.  (Input)
-c          APPLY = .TRUE.  -> apply the sorted order to A.
-c          APPLY = .FALSE. -> do not apply the sorted order to A.
-c
-c  N       Integer.  (INPUT)
-c          Dimension of the array X.
-c
-c  X      Double precision array of length N.  (INPUT/OUTPUT)
-c          The array to be sorted.
-c
-c  NA      Integer.  (INPUT)
-c          Number of rows of the matrix A.
-c
-c  A      Double precision array of length NA by N.  (INPUT/OUTPUT)
-c         
-c  LDA     Integer.  (INPUT)
-c          Leading dimension of A.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Routines
-c     dswap  Level 1 BLAS that swaps the contents of two vectors.
-c
-c\Authors
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     12/15/93: Version ' 2.1'.
-c               Adapted from the sort routine in LANSO and 
-c               the ARPACK code igraphdsortr
-c
-c\SCCS Information: @(#) 
-c FILE: sesrt.F   SID: 2.3   DATE OF SID: 4/19/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsesrt (which, apply, n, x, na, a, lda)
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character*2 which
-      logical    apply
-      integer    lda, n, na
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           x(0:n-1), a(lda, 0:n-1)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i, igap, j
-      Double precision
-     &           temp
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dswap
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      igap = n / 2
-c 
-      if (which .eq. 'SA') then
-c
-c        X is sorted into decreasing order of algebraic.
-c
-   10    continue
-         if (igap .eq. 0) go to 9000
-         do 30 i = igap, n-1
-            j = i-igap
-   20       continue
-c
-            if (j.lt.0) go to 30
-c
-            if (x(j).lt.x(j+igap)) then
-               temp = x(j)
-               x(j) = x(j+igap)
-               x(j+igap) = temp
-               if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
-            else
-               go to 30
-            endif
-            j = j-igap
-            go to 20
-   30    continue
-         igap = igap / 2
-         go to 10
-c
-      else if (which .eq. 'SM') then
-c
-c        X is sorted into decreasing order of magnitude.
-c
-   40    continue
-         if (igap .eq. 0) go to 9000
-         do 60 i = igap, n-1
-            j = i-igap
-   50       continue
-c
-            if (j.lt.0) go to 60
-c
-            if (abs(x(j)).lt.abs(x(j+igap))) then
-               temp = x(j)
-               x(j) = x(j+igap)
-               x(j+igap) = temp
-               if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
-            else
-               go to 60
-            endif
-            j = j-igap
-            go to 50
-   60    continue
-         igap = igap / 2
-         go to 40
-c
-      else if (which .eq. 'LA') then
-c
-c        X is sorted into increasing order of algebraic.
-c
-   70    continue
-         if (igap .eq. 0) go to 9000
-         do 90 i = igap, n-1
-            j = i-igap
-   80       continue
-c
-            if (j.lt.0) go to 90
-c           
-            if (x(j).gt.x(j+igap)) then
-               temp = x(j)
-               x(j) = x(j+igap)
-               x(j+igap) = temp
-               if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
-            else
-               go to 90
-            endif
-            j = j-igap
-            go to 80
-   90    continue
-         igap = igap / 2
-         go to 70
-c 
-      else if (which .eq. 'LM') then
-c
-c        X is sorted into increasing order of magnitude.
-c
-  100    continue
-         if (igap .eq. 0) go to 9000
-         do 120 i = igap, n-1
-            j = i-igap
-  110       continue
-c
-            if (j.lt.0) go to 120
-c
-            if (abs(x(j)).gt.abs(x(j+igap))) then
-               temp = x(j)
-               x(j) = x(j+igap)
-               x(j+igap) = temp
-               if (apply) call dswap( na, a(1, j), 1, a(1,j+igap), 1)
-            else
-               go to 120
-            endif
-            j = j-igap
-            go to 110
-  120    continue
-         igap = igap / 2
-         go to 100
-      end if
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdsesrt |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dseupd.f igraph-0.6.5/interfaces/R/arpack/dseupd.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dseupd.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dseupd.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,905 +0,0 @@
-c\BeginDoc
-c
-c\Name: igraphdseupd
-c
-c\Description: 
-c
-c  This subroutine returns the converged approximations to eigenvalues
-c  of A*z = lambda*B*z and (optionally):
-c
-c      (1) the corresponding approximate eigenvectors,
-c
-c      (2) an orthonormal (Lanczos) basis for the associated approximate
-c          invariant subspace,
-c
-c      (3) Both.
-c
-c  There is negligible additional cost to obtain eigenvectors.  An orthonormal
-c  (Lanczos) basis is always computed.  There is an additional storage cost 
-c  of n*nev if both are requested (in this case a separate array Z must be 
-c  supplied).
-c
-c  These quantities are obtained from the Lanczos factorization computed
-c  by DSAUPD for the linear operator OP prescribed by the MODE selection
-c  (see IPARAM(7) in DSAUPD documentation.)  DSAUPD must be called before
-c  this routine is called. These approximate eigenvalues and vectors are 
-c  commonly called Ritz values and Ritz vectors respectively.  They are 
-c  referred to as such in the comments that follow.   The computed orthonormal 
-c  basis for the invariant subspace corresponding to these Ritz values is 
-c  referred to as a Lanczos basis.
-c
-c  See documentation in the header of the subroutine DSAUPD for a definition 
-c  of OP as well as other terms and the relation of computed Ritz values 
-c  and vectors of OP with respect to the given problem  A*z = lambda*B*z.  
-c
-c  The approximate eigenvalues of the original problem are returned in
-c  ascending algebraic order.  The user may elect to call this routine
-c  once for each desired Ritz vector and store it peripherally if desired.
-c  There is also the option of computing a selected set of these vectors
-c  with a single call.
-c
-c\Usage:
-c  call igraphdseupd 
-c     ( RVEC, HOWMNY, SELECT, D, Z, LDZ, SIGMA, BMAT, N, WHICH, NEV, TOL,
-c       RESID, NCV, V, LDV, IPARAM, IPNTR, WORKD, WORKL, LWORKL, INFO )
-c
-c  RVEC    LOGICAL  (INPUT) 
-c          Specifies whether Ritz vectors corresponding to the Ritz value 
-c          approximations to the eigenproblem A*z = lambda*B*z are computed.
-c
-c             RVEC = .FALSE.     Compute Ritz values only.
-c
-c             RVEC = .TRUE.      Compute Ritz vectors.
-c
-c  HOWMNY  Character*1  (INPUT) 
-c          Specifies how many Ritz vectors are wanted and the form of Z
-c          the matrix of Ritz vectors. See remark 1 below.
-c          = 'A': compute NEV Ritz vectors;
-c          = 'S': compute some of the Ritz vectors, specified
-c                 by the logical array SELECT.
-c
-c  SELECT  Logical array of dimension NEV.  (INPUT)
-c          If HOWMNY = 'S', SELECT specifies the Ritz vectors to be
-c          computed. To select the Ritz vector corresponding to a
-c          Ritz value D(j), SELECT(j) must be set to .TRUE.. 
-c          If HOWMNY = 'A' , SELECT is not referenced.
-c
-c  D       Double precision array of dimension NEV.  (OUTPUT)
-c          On exit, D contains the Ritz value approximations to the
-c          eigenvalues of A*z = lambda*B*z. The values are returned
-c          in ascending order. If IPARAM(7) = 3,4,5 then D represents
-c          the Ritz values of OP computed by igraphdsaupd transformed to
-c          those of the original eigensystem A*z = lambda*B*z. If 
-c          IPARAM(7) = 1,2 then the Ritz values of OP are the same 
-c          as the those of A*z = lambda*B*z.
-c
-c  Z       Double precision N by NEV array if HOWMNY = 'A'.  (OUTPUT)
-c          On exit, Z contains the B-orthonormal Ritz vectors of the
-c          eigensystem A*z = lambda*B*z corresponding to the Ritz
-c          value approximations.
-c          If  RVEC = .FALSE. then Z is not referenced.
-c          NOTE: The array Z may be set equal to first NEV columns of the 
-c          Arnoldi/Lanczos basis array V computed by DSAUPD.
-c
-c  LDZ     Integer.  (INPUT)
-c          The leading dimension of the array Z.  If Ritz vectors are
-c          desired, then  LDZ .ge.  max( 1, N ).  In any case,  LDZ .ge. 1.
-c
-c  SIGMA   Double precision  (INPUT)
-c          If IPARAM(7) = 3,4,5 represents the shift. Not referenced if
-c          IPARAM(7) = 1 or 2.
-c
-c
-c  **** The remaining arguments MUST be the same as for the   ****
-c  **** call to DNAUPD that was just completed.               ****
-c
-c  NOTE: The remaining arguments
-c
-c           BMAT, N, WHICH, NEV, TOL, RESID, NCV, V, LDV, IPARAM, IPNTR,
-c           WORKD, WORKL, LWORKL, INFO
-c
-c         must be passed directly to DSEUPD following the last call
-c         to DSAUPD.  These arguments MUST NOT BE MODIFIED between
-c         the the last call to DSAUPD and the call to DSEUPD.
-c
-c  Two of these parameters (WORKL, INFO) are also output parameters:
-c
-c  WORKL   Double precision work array of length LWORKL.  (OUTPUT/WORKSPACE)
-c          WORKL(1:4*ncv) contains information obtained in
-c          igraphdsaupd.  They are not changed by igraphdseupd.
-c          WORKL(4*ncv+1:ncv*ncv+8*ncv) holds the
-c          untransformed Ritz values, the computed error estimates,
-c          and the associated eigenvector matrix of H.
-c
-c          Note: IPNTR(8:10) contains the pointer into WORKL for addresses
-c          of the above information computed by igraphdseupd.
-c          -------------------------------------------------------------
-c          IPNTR(8): pointer to the NCV RITZ values of the original system.
-c          IPNTR(9): pointer to the NCV corresponding error bounds.
-c          IPNTR(10): pointer to the NCV by NCV matrix of eigenvectors
-c                     of the tridiagonal matrix T. Only referenced by
-c                     igraphdseupd if RVEC = .TRUE. See Remarks.
-c          -------------------------------------------------------------
-c
-c  INFO    Integer.  (OUTPUT)
-c          Error flag on output.
-c          =  0: Normal exit.
-c          = -1: N must be positive.
-c          = -2: NEV must be positive.
-c          = -3: NCV must be greater than NEV and less than or equal to N.
-c          = -5: WHICH must be one of 'LM', 'SM', 'LA', 'SA' or 'BE'.
-c          = -6: BMAT must be one of 'I' or 'G'.
-c          = -7: Length of private work WORKL array is not sufficient.
-c          = -8: Error return from trid. eigenvalue calculation;
-c                Information error from LAPACK routine dsteqr.
-c          = -9: Starting vector is zero.
-c          = -10: IPARAM(7) must be 1,2,3,4,5.
-c          = -11: IPARAM(7) = 1 and BMAT = 'G' are incompatible.
-c          = -12: NEV and WHICH = 'BE' are incompatible.
-c          = -14: DSAUPD did not find any eigenvalues to sufficient
-c                 accuracy.
-c          = -15: HOWMNY must be one of 'A' or 'S' if RVEC = .true.
-c          = -16: HOWMNY = 'S' not yet implemented
-c
-c\BeginLib
-c
-c\References:
-c  1. D.C. Sorensen, "Implicit Application of Polynomial Filters in
-c     a k-Step Arnoldi Method", SIAM J. Matr. Anal. Apps., 13 (1992),
-c     pp 357-385.
-c  2. R.B. Lehoucq, "Analysis and Implementation of an Implicitly 
-c     Restarted Arnoldi Iteration", Rice University Technical Report
-c     TR95-13, Department of Computational and Applied Mathematics.
-c  3. B.N. Parlett, "The Symmetric Eigenvalue Problem". Prentice-Hall,
-c     1980.
-c  4. B.N. Parlett, B. Nour-Omid, "Towards a Black Box Lanczos Program",
-c     Computer Physics Communications, 53 (1989), pp 169-179.
-c  5. B. Nour-Omid, B.N. Parlett, T. Ericson, P.S. Jensen, "How to
-c     Implement the Spectral Transformation", Math. Comp., 48 (1987),
-c     pp 663-673.
-c  6. R.G. Grimes, J.G. Lewis and H.D. Simon, "A Shifted Block Lanczos 
-c     Algorithm for Solving Sparse Symmetric Generalized Eigenproblems", 
-c     SIAM J. Matr. Anal. Apps.,  January (1993).
-c  7. L. Reichel, W.B. Gragg, "Algorithm 686: FORTRAN Subroutines
-c     for Updating the QR decomposition", ACM TOMS, December 1990,
-c     Volume 16 Number 4, pp 369-377.
-c
-c\Remarks
-c  1. The converged Ritz values are always returned in increasing 
-c     (algebraic) order.
-c
-c  2. Currently only HOWMNY = 'A' is implemented. It is included at this
-c     stage for the user who wants to incorporate it. 
-c
-c\Routines called:
-c     igraphdsesrt  ARPACK routine that sorts an array X, and applies the
-c             corresponding permutation to a matrix A.
-c     igraphdsortr  igraphdsortr  ARPACK sorting routine.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dgeqr2  LAPACK routine that computes the QR factorization of
-c             a matrix.
-c     dlacpy  LAPACK matrix copy routine.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dorm2r  LAPACK routine that applies an orthogonal matrix in
-c             factored form.
-c     dsteqr  LAPACK routine that computes eigenvalues and eigenvectors
-c             of a tridiagonal matrix.
-c     dger    Level 2 BLAS rank one update to a matrix.
-c     dcopy   Level 1 BLAS that copies one vector to another .
-c     dnrm2   Level 1 BLAS that computes the norm of a vector.
-c     dscal   Level 1 BLAS that scales a vector.
-c     dswap   Level 1 BLAS that swaps the contents of two vectors.
-
-c\Authors
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Chao Yang                    Houston, Texas
-c     Dept. of Computational & 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c 
-c\Revision history:
-c     12/15/93: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: seupd.F   SID: 2.7   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-      subroutine igraphdseupd (rvec, howmny, select, d, z, ldz, 
-     &     sigma, bmat, n, which, nev, tol, resid, ncv, v, ldv, iparam, 
-     &     ipntr, workd, workl, lworkl, info )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character  bmat, howmny, which*2
-      logical    rvec, select(ncv)
-      integer    info, ldz, ldv, lworkl, n, ncv, nev
-      Double precision     
-     &           sigma, tol
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      integer    iparam(7), ipntr(11)
-      Double precision
-     &           d(nev), resid(n), v(ldv,ncv), z(ldz, nev), 
-     &           workd(2*n), workl(lworkl)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      character  type*6
-      integer    bounds, ierr, ih, ihb, ihd, iq, iw, j, k, 
-     &           ldh, ldq, mode, msglvl, nconv, next, ritz,
-     &           irz, ibd, ktrord, leftptr, rghtptr, ism, ilg
-      Double precision
-     &           bnorm2, rnorm, temp, thres1, thres2, tempbnd, eps23
-      logical    reord
-c
-c     %--------------%
-c     | Local Arrays |
-c     %--------------%
-c
-      Double precision 
-     &           kv(2)
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dcopy, dger, dgeqr2, dlacpy, dorm2r, dscal, 
-     &     igraphdsesrt, dsteqr, dswap, igraphdvout, 
-     &     igraphivout, igraphdsortr
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision
-     &           dnrm2, dlamch
-      external   dnrm2, dlamch
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    min
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-c     %------------------------%
-c     | Set default parameters |
-c     %------------------------%
-c
-      msglvl = mseupd
-      mode = iparam(7)
-      nconv = iparam(5)
-      info = 0
-c
-c     %--------------%
-c     | Quick return |
-c     %--------------%
-c
-      if (nconv .eq. 0) go to 9000
-      ierr = 0
-c
-      if (nconv .le. 0)                        ierr = -14 
-      if (n .le. 0)                            ierr = -1
-      if (nev .le. 0)                          ierr = -2
-      if (ncv .le. nev .or.  ncv .gt. n)       ierr = -3
-      if (which .ne. 'LM' .and.
-     &    which .ne. 'SM' .and.
-     &    which .ne. 'LA' .and.
-     &    which .ne. 'SA' .and.
-     &    which .ne. 'BE')                     ierr = -5
-      if (bmat .ne. 'I' .and. bmat .ne. 'G')   ierr = -6
-      if ( (howmny .ne. 'A' .and.
-     &           howmny .ne. 'P' .and.
-     &           howmny .ne. 'S') .and. rvec ) 
-     &                                         ierr = -15
-      if (rvec .and. howmny .eq. 'S')           ierr = -16
-c
-      if (rvec .and. lworkl .lt. ncv**2+8*ncv) ierr = -7
-c     
-      if (mode .eq. 1 .or. mode .eq. 2) then
-         type = 'REGULR'
-      else if (mode .eq. 3 ) then
-         type = 'SHIFTI'
-      else if (mode .eq. 4 ) then
-         type = 'BUCKLE'
-      else if (mode .eq. 5 ) then
-         type = 'CAYLEY'
-      else 
-                                               ierr = -10
-      end if
-      if (mode .eq. 1 .and. bmat .eq. 'G')     ierr = -11
-      if (nev .eq. 1 .and. which .eq. 'BE')    ierr = -12
-c
-c     %------------%
-c     | Error Exit |
-c     %------------%
-c
-      if (ierr .ne. 0) then
-         info = ierr
-         go to 9000
-      end if
-c     
-c     %-------------------------------------------------------%
-c     | Pointer into WORKL for address of H, RITZ, BOUNDS, Q  |
-c     | etc... and the remaining workspace.                   |
-c     | Also update pointer to be used on output.             |
-c     | Memory is laid out as follows:                        |
-c     | workl(1:2*ncv) := generated tridiagonal matrix H      |
-c     |       The subdiagonal is stored in workl(2:ncv).      |
-c     |       The dead spot is workl(1) but upon exiting      |
-c     |       igraphdsaupd stores the B-norm of the last residual   |
-c     |       vector in workl(1). We use this !!!             |
-c     | workl(2*ncv+1:2*ncv+ncv) := ritz values               |
-c     |       The wanted values are in the first NCONV spots. |
-c     | workl(3*ncv+1:3*ncv+ncv) := computed Ritz estimates   |
-c     |       The wanted values are in the first NCONV spots. |
-c     | NOTE: workl(1:4*ncv) is set by igraphdsaupd and is not      |
-c     |       modified by igraphdseupd.                             |
-c     %-------------------------------------------------------%
-c
-c     %-------------------------------------------------------%
-c     | The following is used and set by igraphdseupd.              |
-c     | workl(4*ncv+1:4*ncv+ncv) := used as workspace during  |
-c     |       computation of the eigenvectors of H. Stores    |
-c     |       the diagonal of H. Upon EXIT contains the NCV   |
-c     |       Ritz values of the original system. The first   |
-c     |       NCONV spots have the wanted values. If MODE =   |
-c     |       1 or 2 then will equal workl(2*ncv+1:3*ncv).    |
-c     | workl(5*ncv+1:5*ncv+ncv) := used as workspace during  |
-c     |       computation of the eigenvectors of H. Stores    |
-c     |       the subdiagonal of H. Upon EXIT contains the    |
-c     |       NCV corresponding Ritz estimates of the         |
-c     |       original system. The first NCONV spots have the |
-c     |       wanted values. If MODE = 1,2 then will equal    |
-c     |       workl(3*ncv+1:4*ncv).                           |
-c     | workl(6*ncv+1:6*ncv+ncv*ncv) := orthogonal Q that is  |
-c     |       the eigenvector matrix for H as returned by     |
-c     |       dsteqr. Not referenced if RVEC = .False.        |
-c     |       Ordering follows that of workl(4*ncv+1:5*ncv)   |
-c     | workl(6*ncv+ncv*ncv+1:6*ncv+ncv*ncv+2*ncv) :=         |
-c     |       Workspace. Needed by dsteqr and by igraphdseupd.      |
-c     | GRAND total of NCV*(NCV+8) locations.                 |
-c     %-------------------------------------------------------%
-c
-c
-      ih     = ipntr(5)
-      ritz   = ipntr(6)
-      bounds = ipntr(7)
-      ldh    = ncv
-      ldq    = ncv
-      ihd    = bounds + ldh
-      ihb    = ihd    + ldh
-      iq     = ihb    + ldh
-      iw     = iq     + ldh*ncv
-      next   = iw     + 2*ncv
-      ipntr(4)  = next
-      ipntr(8)  = ihd
-      ipntr(9)  = ihb
-      ipntr(10) = iq
-c
-c     %----------------------------------------%
-c     | irz points to the Ritz values computed |
-c     |     by _seigt before exiting _saup2.   |
-c     | ibd points to the Ritz estimates       |
-c     |     computed by _seigt before exiting  |
-c     |     _saup2.                            |
-c     %----------------------------------------%
-c
-      irz = ipntr(11)+ncv
-      ibd = irz+ncv
-c
-c
-c     %---------------------------------%
-c     | Set machine dependent constant. |
-c     %---------------------------------%
-c
-      eps23 = dlamch('Epsilon-Machine') 
-      eps23 = eps23**(2.0D+0 / 3.0D+0)
-c
-c     %---------------------------------------%
-c     | RNORM is B-norm of the RESID(1:N).    |
-c     | BNORM2 is the 2 norm of B*RESID(1:N). |
-c     | Upon exit of igraphdsaupd WORKD(1:N) has    |
-c     | B*RESID(1:N).                         |
-c     %---------------------------------------%
-c
-      rnorm = workl(ih)
-      if (bmat .eq. 'I') then
-         bnorm2 = rnorm
-      else if (bmat .eq. 'G') then
-         bnorm2 = dnrm2(n, workd, 1)
-      end if
-c
-      if (rvec) then
-c
-c        %------------------------------------------------%
-c        | Get the converged Ritz value on the boundary.  |
-c        | This value will be used to dermine whether we  |
-c        | need to reorder the eigenvalues and            |
-c        | eigenvectors comupted by _steqr, and is        |
-c        | referred to as the "threshold" value.          |
-c        |                                                |
-c        | A Ritz value gamma is said to be a wanted      |
-c        | one, if                                        |
-c        | abs(gamma) .ge. threshold, when WHICH = 'LM';  |
-c        | abs(gamma) .le. threshold, when WHICH = 'SM';  |
-c        | gamma      .ge. threshold, when WHICH = 'LA';  |
-c        | gamma      .le. threshold, when WHICH = 'SA';  |
-c        | gamma .le. thres1 .or. gamma .ge. thres2       |
-c        |                            when WHICH = 'BE';  |
-c        |                                                |
-c        | Note: converged Ritz values and associated     |
-c        | Ritz estimates have been placed in the first   |
-c        | NCONV locations in workl(ritz) and             |
-c        | workl(bounds) respectively. They have been     |
-c        | sorted (in _saup2) according to the WHICH      |
-c        | selection criterion. (Except in the case       |
-c        | WHICH = 'BE', they are sorted in an increasing |
-c        | order.)                                        |
-c        %------------------------------------------------%
-c
-         if (which .eq. 'LM' .or. which .eq. 'SM'
-     &       .or. which .eq. 'LA' .or. which .eq. 'SA' ) then
-c
-             thres1 = workl(ritz)
-c
-             if (msglvl .gt. 2) then
-                call igraphdvout(logfil, 1, thres1, ndigit,
-     &          '_seupd: Threshold eigenvalue used for re-ordering')
-             end if
-c
-         else if (which .eq. 'BE') then
-c
-c            %------------------------------------------------%
-c            | Ritz values returned from _saup2 have been     |
-c            | sorted in increasing order.  Thus two          |
-c            | "threshold" values (one for the small end, one |
-c            | for the large end) are in the middle.          |
-c            %------------------------------------------------%
-c
-             ism = max(nev,nconv) / 2
-             ilg = ism + 1
-             thres1 = workl(ism)
-             thres2 = workl(ilg) 
-c
-             if (msglvl .gt. 2) then
-                kv(1) = thres1
-                kv(2) = thres2
-                call igraphdvout(logfil, 2, kv, ndigit,
-     &          '_seupd: Threshold eigenvalues used for re-ordering')
-             end if
-c
-         end if
-c
-c        %----------------------------------------------------------%
-c        | Check to see if all converged Ritz values appear within  |
-c        | the first NCONV diagonal elements returned from _seigt.  |
-c        | This is done in the following way:                       |
-c        |                                                          |
-c        | 1) For each Ritz value obtained from _seigt, compare it  |
-c        |    with the threshold Ritz value computed above to       |
-c        |    determine whether it is a wanted one.                 |
-c        |                                                          |
-c        | 2) If it is wanted, then check the corresponding Ritz    |
-c        |    estimate to see if it has converged.  If it has, set  |
-c        |    correponding entry in the logical array SELECT to     |
-c        |    .TRUE..                                               |
-c        |                                                          |
-c        | If SELECT(j) = .TRUE. and j > NCONV, then there is a     |
-c        | converged Ritz value that does not appear at the top of  |
-c        | the diagonal matrix computed by _seigt in _saup2.        |
-c        | Reordering is needed.                                    |
-c        %----------------------------------------------------------%
-c
-         reord = .false.
-         ktrord = 0
-         do 10 j = 0, ncv-1
-            select(j+1) = .false.
-            if (which .eq. 'LM') then
-               if (abs(workl(irz+j)) .ge. abs(thres1)) then
-                   tempbnd = max( eps23, abs(workl(irz+j)) )
-                   if (workl(ibd+j) .le. tol*tempbnd) then
-                      select(j+1) = .true.
-                   end if
-               end if
-            else if (which .eq. 'SM') then
-               if (abs(workl(irz+j)) .le. abs(thres1)) then
-                   tempbnd = max( eps23, abs(workl(irz+j)) )
-                   if (workl(ibd+j) .le. tol*tempbnd) then
-                      select(j+1) = .true.
-                   end if
-               end if
-            else if (which .eq. 'LA') then
-               if (workl(irz+j) .ge. thres1) then
-                  tempbnd = max( eps23, abs(workl(irz+j)) )
-                  if (workl(ibd+j) .le. tol*tempbnd) then
-                     select(j+1) = .true.
-                  end if
-               end if
-            else if (which .eq. 'SA') then
-               if (workl(irz+j) .le. thres1) then
-                  tempbnd = max( eps23, abs(workl(irz+j)) )
-                  if (workl(ibd+j) .le. tol*tempbnd) then
-                     select(j+1) = .true.
-                  end if
-               end if
-            else if (which .eq. 'BE') then
-               if ( workl(irz+j) .le. thres1 .or.
-     &              workl(irz+j) .ge. thres2 ) then
-                  tempbnd = max( eps23, abs(workl(irz+j)) )
-                  if (workl(ibd+j) .le. tol*tempbnd) then
-                     select(j+1) = .true.
-                  end if
-               end if
-            end if
-            if (j+1 .gt. nconv ) reord = select(j+1) .or. reord
-            if (select(j+1)) ktrord = ktrord + 1
- 10      continue
-
-c        %-------------------------------------------%
-c        | If KTRORD .ne. NCONV, something is wrong. |
-c        %-------------------------------------------%
-c
-         if (msglvl .gt. 2) then
-             call igraphivout(logfil, 1, ktrord, ndigit,
-     &            '_seupd: Number of specified eigenvalues')
-             call igraphivout(logfil, 1, nconv, ndigit,
-     &            '_seupd: Number of "converged" eigenvalues')
-         end if
-c
-c        %-----------------------------------------------------------%
-c        | Call LAPACK routine _steqr to compute the eigenvalues and |
-c        | eigenvectors of the final symmetric tridiagonal matrix H. |
-c        | Initialize the eigenvector matrix Q to the identity.      |
-c        %-----------------------------------------------------------%
-c
-         call dcopy (ncv-1, workl(ih+1), 1, workl(ihb), 1)
-         call dcopy (ncv, workl(ih+ldh), 1, workl(ihd), 1)
-c
-         call dsteqr ('Identity', ncv, workl(ihd), workl(ihb),
-     &                workl(iq), ldq, workl(iw), ierr)
-c
-         if (ierr .ne. 0) then
-            info = -8
-            go to 9000
-         end if
-c
-         if (msglvl .gt. 1) then
-            call dcopy (ncv, workl(iq+ncv-1), ldq, workl(iw), 1)
-            call igraphdvout (logfil, ncv, workl(ihd), ndigit,
-     &          '_seupd: NCV Ritz values of the final H matrix')
-            call igraphdvout (logfil, ncv, workl(iw), ndigit,
-     &           '_seupd: last row of the eigenvector matrix for H')
-         end if
-c
-         if (reord) then
-c
-c           %---------------------------------------------%
-c           | Reordered the eigenvalues and eigenvectors  |
-c           | computed by _steqr so that the "converged"  |
-c           | eigenvalues appear in the first NCONV       |
-c           | positions of workl(ihd), and the associated |
-c           | eigenvectors appear in the first NCONV      |
-c           | columns.                                    |
-c           %---------------------------------------------%
-c
-            leftptr = 1
-            rghtptr = ncv
-c
-            if (ncv .eq. 1) go to 30
-c
- 20         if (select(leftptr)) then
-c
-c              %-------------------------------------------%
-c              | Search, from the left, for the first Ritz |
-c              | value that has not converged.             |
-c              %-------------------------------------------%
-c
-               leftptr = leftptr + 1
-c
-            else if ( .not. select(rghtptr)) then
-c
-c              %----------------------------------------------%
-c              | Search, from the right, the first Ritz value |
-c              | that has converged.                          |
-c              %----------------------------------------------%
-c
-               rghtptr = rghtptr - 1
-c
-            else
-c
-c              %----------------------------------------------%
-c              | Swap the Ritz value on the left that has not |
-c              | converged with the Ritz value on the right   |
-c              | that has converged.  Swap the associated     |
-c              | eigenvector of the tridiagonal matrix H as   |
-c              | well.                                        |
-c              %----------------------------------------------%
-c
-               temp = workl(ihd+leftptr-1)
-               workl(ihd+leftptr-1) = workl(ihd+rghtptr-1)
-               workl(ihd+rghtptr-1) = temp
-               call dcopy(ncv, workl(iq+ncv*(leftptr-1)), 1,
-     &                    workl(iw), 1)
-               call dcopy(ncv, workl(iq+ncv*(rghtptr-1)), 1,
-     &                    workl(iq+ncv*(leftptr-1)), 1)
-               call dcopy(ncv, workl(iw), 1,
-     &                    workl(iq+ncv*(rghtptr-1)), 1)
-               leftptr = leftptr + 1
-               rghtptr = rghtptr - 1
-c
-            end if
-c
-            if (leftptr .lt. rghtptr) go to 20
-c
- 30      end if
-c
-         if (msglvl .gt. 2) then
-             call igraphdvout (logfil, ncv, workl(ihd), ndigit,
-     &       '_seupd: The eigenvalues of H--reordered')
-         end if
-c
-c        %----------------------------------------%
-c        | Load the converged Ritz values into D. |
-c        %----------------------------------------%
-c
-         call dcopy(nconv, workl(ihd), 1, d, 1)
-c
-      else
-c
-c        %-----------------------------------------------------%
-c        | Ritz vectors not required. Load Ritz values into D. |
-c        %-----------------------------------------------------%
-c
-         call dcopy (nconv, workl(ritz), 1, d, 1)
-         call dcopy (ncv, workl(ritz), 1, workl(ihd), 1)
-c
-      end if
-c
-c     %------------------------------------------------------------------%
-c     | Transform the Ritz values and possibly vectors and corresponding |
-c     | Ritz estimates of OP to those of A*x=lambda*B*x. The Ritz values |
-c     | (and corresponding data) are returned in ascending order.        |
-c     %------------------------------------------------------------------%
-c
-      if (type .eq. 'REGULR') then
-c
-c        %---------------------------------------------------------%
-c        | Ascending sort of wanted Ritz values, vectors and error |
-c        | bounds. Not necessary if only Ritz values are desired.  |
-c        %---------------------------------------------------------%
-c
-         if (rvec) then
-            call igraphdsesrt ('LA', rvec , nconv, d, ncv, workl(iq), 
-     &           ldq)
-         else
-            call dcopy (ncv, workl(bounds), 1, workl(ihb), 1)
-         end if
-c
-      else 
-c 
-c        %-------------------------------------------------------------%
-c        | *  Make a copy of all the Ritz values.                      |
-c        | *  Transform the Ritz values back to the original system.   |
-c        |    For TYPE = 'SHIFTI' the transformation is                |
-c        |             lambda = 1/theta + sigma                        |
-c        |    For TYPE = 'BUCKLE' the transformation is                |
-c        |             lambda = sigma * theta / ( theta - 1 )          |
-c        |    For TYPE = 'CAYLEY' the transformation is                |
-c        |             lambda = sigma * (theta + 1) / (theta - 1 )     |
-c        |    where the theta are the Ritz values returned by igraphdsaupd.  |
-c        | NOTES:                                                      |
-c        | *The Ritz vectors are not affected by the transformation.   |
-c        |  They are only reordered.                                   |
-c        %-------------------------------------------------------------%
-c
-         call dcopy (ncv, workl(ihd), 1, workl(iw), 1)
-         if (type .eq. 'SHIFTI') then 
-            do 40 k=1, ncv
-               workl(ihd+k-1) = one / workl(ihd+k-1) + sigma
-  40        continue
-         else if (type .eq. 'BUCKLE') then
-            do 50 k=1, ncv
-               workl(ihd+k-1) = sigma * workl(ihd+k-1) / 
-     &                          (workl(ihd+k-1) - one)
-  50        continue
-         else if (type .eq. 'CAYLEY') then
-            do 60 k=1, ncv
-               workl(ihd+k-1) = sigma * (workl(ihd+k-1) + one) /
-     &                          (workl(ihd+k-1) - one)
-  60        continue
-         end if
-c 
-c        %-------------------------------------------------------------%
-c        | *  Store the wanted NCONV lambda values into D.             |
-c        | *  Sort the NCONV wanted lambda in WORKL(IHD:IHD+NCONV-1)   |
-c        |    into ascending order and apply sort to the NCONV theta   |
-c        |    values in the transformed system. We'll need this to     |
-c        |    compute Ritz estimates in the original system.           |
-c        | *  Finally sort the lambda's into ascending order and apply |
-c        |    to Ritz vectors if wanted. Else just sort lambda's into  |
-c        |    ascending order.                                         |
-c        | NOTES:                                                      |
-c        | *workl(iw:iw+ncv-1) contain the theta ordered so that they  |
-c        |  match the ordering of the lambda. We'll use them again for |
-c        |  Ritz vector purification.                                  |
-c        %-------------------------------------------------------------%
-c
-         call dcopy (nconv, workl(ihd), 1, d, 1)
-         call igraphdsortr ('LA', .true., nconv, workl(ihd), workl(iw))
-         if (rvec) then
-            call igraphdsesrt ('LA', rvec , nconv, d, ncv, workl(iq), 
-     &           ldq)
-         else
-            call dcopy (ncv, workl(bounds), 1, workl(ihb), 1)
-            call dscal (ncv, bnorm2/rnorm, workl(ihb), 1)
-            call igraphdsortr ('LA', .true., nconv, d, workl(ihb))
-         end if
-c
-      end if 
-c 
-c     %------------------------------------------------%
-c     | Compute the Ritz vectors. Transform the wanted |
-c     | eigenvectors of the symmetric tridiagonal H by |
-c     | the Lanczos basis matrix V.                    |
-c     %------------------------------------------------%
-c
-      if (rvec .and. howmny .eq. 'A') then
-c    
-c        %----------------------------------------------------------%
-c        | Compute the QR factorization of the matrix representing  |
-c        | the wanted invariant subspace located in the first NCONV |
-c        | columns of workl(iq,ldq).                                |
-c        %----------------------------------------------------------%
-c     
-         call dgeqr2 (ncv, nconv, workl(iq), ldq, workl(iw+ncv), 
-     &        workl(ihb), ierr)
-c
-c     
-c        %--------------------------------------------------------%
-c        | * Postmultiply V by Q.                                 |   
-c        | * Copy the first NCONV columns of VQ into Z.           |
-c        | The N by NCONV matrix Z is now a matrix representation |
-c        | of the approximate invariant subspace associated with  |
-c        | the Ritz values in workl(ihd).                         |
-c        %--------------------------------------------------------%
-c     
-         call dorm2r ('Right', 'Notranspose', n, ncv, nconv, workl(iq),
-     &        ldq, workl(iw+ncv), v, ldv, workd(n+1), ierr)
-         call dlacpy ('All', n, nconv, v, ldv, z, ldz)
-c
-c        %-----------------------------------------------------%
-c        | In order to compute the Ritz estimates for the Ritz |
-c        | values in both systems, need the last row of the    |
-c        | eigenvector matrix. Remember, it's in factored form |
-c        %-----------------------------------------------------%
-c
-         do 65 j = 1, ncv-1
-            workl(ihb+j-1) = zero 
-  65     continue
-         workl(ihb+ncv-1) = one
-         call dorm2r ('Left', 'Transpose', ncv, 1, nconv, workl(iq),
-     &        ldq, workl(iw+ncv), workl(ihb), ncv, temp, ierr)
-c
-      else if (rvec .and. howmny .eq. 'S') then
-c
-c     Not yet implemented. See remark 2 above.
-c
-      end if
-c
-      if (type .eq. 'REGULR' .and. rvec) then
-c
-            do 70 j=1, ncv
-               workl(ihb+j-1) = rnorm * abs( workl(ihb+j-1) )
- 70         continue
-c
-      else if (type .ne. 'REGULR' .and. rvec) then
-c
-c        %-------------------------------------------------%
-c        | *  Determine Ritz estimates of the theta.       |
-c        |    If RVEC = .true. then compute Ritz estimates |
-c        |               of the theta.                     |
-c        |    If RVEC = .false. then copy Ritz estimates   |
-c        |              as computed by igraphdsaupd.             |
-c        | *  Determine Ritz estimates of the lambda.      |
-c        %-------------------------------------------------%
-c
-         call dscal (ncv, bnorm2, workl(ihb), 1)
-         if (type .eq. 'SHIFTI') then 
-c
-            do 80 k=1, ncv
-               workl(ihb+k-1) = abs( workl(ihb+k-1) ) / workl(iw+k-1)**2
- 80         continue
-c
-         else if (type .eq. 'BUCKLE') then
-c
-            do 90 k=1, ncv
-               workl(ihb+k-1) = sigma * abs( workl(ihb+k-1) ) / 
-     &                          ( workl(iw+k-1)-one )**2
- 90         continue
-c
-         else if (type .eq. 'CAYLEY') then
-c
-            do 100 k=1, ncv
-               workl(ihb+k-1) = abs( workl(ihb+k-1) / 
-     &                          workl(iw+k-1)*(workl(iw+k-1)-one) )
- 100        continue
-c
-         end if
-c
-      end if
-c
-      if (type .ne. 'REGULR' .and. msglvl .gt. 1) then
-         call igraphdvout (logfil, nconv, d, ndigit,
-     &          '_seupd: Untransformed converged Ritz values')
-         call igraphdvout (logfil, nconv, workl(ihb), ndigit, 
-     &     '_seupd: Ritz estimates of the untransformed Ritz values')
-      else if (msglvl .gt. 1) then
-         call igraphdvout (logfil, nconv, d, ndigit,
-     &          '_seupd: Converged Ritz values')
-         call igraphdvout (logfil, nconv, workl(ihb), ndigit, 
-     &     '_seupd: Associated Ritz estimates')
-      end if
-c 
-c     %-------------------------------------------------%
-c     | Ritz vector purification step. Formally perform |
-c     | one of inverse subspace iteration. Only used    |
-c     | for MODE = 3,4,5. See reference 7               |
-c     %-------------------------------------------------%
-c
-      if (rvec .and. (type .eq. 'SHIFTI' .or. type .eq. 'CAYLEY')) then
-c
-         do 110 k=0, nconv-1
-            workl(iw+k) = workl(iq+k*ldq+ncv-1) / workl(iw+k)
- 110     continue
-c
-      else if (rvec .and. type .eq. 'BUCKLE') then
-c
-         do 120 k=0, nconv-1
-            workl(iw+k) = workl(iq+k*ldq+ncv-1) / (workl(iw+k)-one)
- 120     continue
-c
-      end if 
-c
-      if (type .ne. 'REGULR')
-     &   call dger (n, nconv, one, resid, 1, workl(iw), 1, z, ldz)
-c
- 9000 continue
-c
-      return
-c
-c     %---------------%
-c     | End of igraphdseupd |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsgets.f igraph-0.6.5/interfaces/R/arpack/dsgets.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsgets.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsgets.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,220 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsgets
-c
-c\Description: 
-c  Given the eigenvalues of the symmetric tridiagonal matrix H,
-c  computes the NP shifts AMU that are zeros of the polynomial of 
-c  degree NP which filters out components of the unwanted eigenvectors 
-c  corresponding to the AMU's based on some given criteria.
-c
-c  NOTE: This is called even in the case of user specified shifts in 
-c  order to sort the eigenvalues, and error bounds of H for later use.
-c
-c\Usage:
-c  call igraphdsgets
-c     ( ISHIFT, WHICH, KEV, NP, RITZ, BOUNDS, SHIFTS )
-c
-c\Arguments
-c  ISHIFT  Integer.  (INPUT)
-c          Method for selecting the implicit shifts at each iteration.
-c          ISHIFT = 0: user specified shifts
-c          ISHIFT = 1: exact shift with respect to the matrix H.
-c
-c  WHICH   Character*2.  (INPUT)
-c          Shift selection criteria.
-c          'LM' -> KEV eigenvalues of largest magnitude are retained.
-c          'SM' -> KEV eigenvalues of smallest magnitude are retained.
-c          'LA' -> KEV eigenvalues of largest value are retained.
-c          'SA' -> KEV eigenvalues of smallest value are retained.
-c          'BE' -> KEV eigenvalues, half from each end of the spectrum.
-c                  If KEV is odd, compute one more from the high end.
-c
-c  KEV      Integer.  (INPUT)
-c          KEV+NP is the size of the matrix H.
-c
-c  NP      Integer.  (INPUT)
-c          Number of implicit shifts to be computed.
-c
-c  RITZ    Double precision array of length KEV+NP.  (INPUT/OUTPUT)
-c          On INPUT, RITZ contains the eigenvalues of H.
-c          On OUTPUT, RITZ are sorted so that the unwanted eigenvalues 
-c          are in the first NP locations and the wanted part is in 
-c          the last KEV locations.  When exact shifts are selected, the
-c          unwanted part corresponds to the shifts to be applied.
-c
-c  BOUNDS  Double precision array of length KEV+NP.  (INPUT/OUTPUT)
-c          Error bounds corresponding to the ordering in RITZ.
-c
-c  SHIFTS  Double precision array of length NP.  (INPUT/OUTPUT)
-c          On INPUT:  contains the user specified shifts if ISHIFT = 0.
-c          On OUTPUT: contains the shifts sorted into decreasing order 
-c          of magnitude with respect to the Ritz estimates contained in
-c          BOUNDS. If ISHIFT = 0, SHIFTS is not modified on exit.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     igraphdsortr  ARPACK utility sorting routine.
-c     igraphivout   ARPACK utility routine that prints integers.
-c     igraphsecond  ARPACK utility routine for timing.
-c     igraphdvout   ARPACK utility routine that prints vectors.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     dswap   Level 1 BLAS that swaps the contents of two vectors.
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     xx/xx/93: Version ' 2.1'
-c
-c\SCCS Information: @(#) 
-c FILE: sgets.F   SID: 2.4   DATE OF SID: 4/19/96   RELEASE: 2
-c
-c\Remarks
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsgets ( ishift, which, kev, np, ritz, bounds, 
-     &     shifts )
-c
-c     %----------------------------------------------------%
-c     | Include files for debugging and timing information |
-c     %----------------------------------------------------%
-c
-      include   'debug.h'
-      include   'stat.h'
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character*2 which
-      integer    ishift, kev, np
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           bounds(kev+np), ritz(kev+np), shifts(np)
-c
-c     %------------%
-c     | Parameters |
-c     %------------%
-c
-      Double precision
-     &           one, zero
-      parameter (one = 1.0D+0, zero = 0.0D+0)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    kevd2, msglvl
-c
-c     %----------------------%
-c     | External Subroutines |
-c     %----------------------%
-c
-      external   dswap, dcopy, igraphdsortr, igraphsecond
-c
-c     %---------------------%
-c     | Intrinsic Functions |
-c     %---------------------%
-c
-      intrinsic    max, min
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c 
-c     %-------------------------------%
-c     | Initialize timing statistics  |
-c     | & message level for debugging |
-c     %-------------------------------%
-c
-      call igraphsecond (t0)
-      msglvl = msgets
-c 
-      if (which .eq. 'BE') then
-c
-c        %-----------------------------------------------------%
-c        | Both ends of the spectrum are requested.            |
-c        | Sort the eigenvalues into algebraically increasing  |
-c        | order first then swap high end of the spectrum next |
-c        | to low end in appropriate locations.                |
-c        | NOTE: when np < floor(kev/2) be careful not to swap |
-c        | overlapping locations.                              |
-c        %-----------------------------------------------------%
-c
-         call igraphdsortr ('LA', .true., kev+np, ritz, bounds)
-         kevd2 = kev / 2 
-         if ( kev .gt. 1 ) then
-            call dswap ( min(kevd2,np), ritz, 1, 
-     &                   ritz( max(kevd2,np)+1 ), 1)
-            call dswap ( min(kevd2,np), bounds, 1, 
-     &                   bounds( max(kevd2,np)+1 ), 1)
-         end if
-c
-      else
-c
-c        %----------------------------------------------------%
-c        | LM, SM, LA, SA case.                               |
-c        | Sort the eigenvalues of H into the desired order   |
-c        | and apply the resulting order to BOUNDS.           |
-c        | The eigenvalues are sorted so that the wanted part |
-c        | are always in the last KEV locations.               |
-c        %----------------------------------------------------%
-c
-         call igraphdsortr (which, .true., kev+np, ritz, bounds)
-      end if
-c
-      if (ishift .eq. 1 .and. np .gt. 0) then
-c     
-c        %-------------------------------------------------------%
-c        | Sort the unwanted Ritz values used as shifts so that  |
-c        | the ones with largest Ritz estimates are first.       |
-c        | This will tend to minimize the effects of the         |
-c        | forward instability of the iteration when the shifts  |
-c        | are applied in subroutine igraphdsapps.                     |
-c        %-------------------------------------------------------%
-c     
-         call igraphdsortr ('SM', .true., np, bounds, ritz)
-         call dcopy (np, ritz, 1, shifts, 1)
-      end if
-c 
-      call igraphsecond (t1)
-      tsgets = tsgets + (t1 - t0)
-c
-      if (msglvl .gt. 0) then
-         call igraphivout (logfil, 1, kev, ndigit, '_sgets: KEV is')
-         call igraphivout (logfil, 1, np, ndigit, '_sgets: NP is')
-         call igraphdvout (logfil, kev+np, ritz, ndigit,
-     &        '_sgets: Eigenvalues of current H matrix')
-         call igraphdvout (logfil, kev+np, bounds, ndigit, 
-     &        '_sgets: Associated Ritz estimates')
-      end if
-c 
-      return
-c
-c     %---------------%
-c     | End of igraphdsgets |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsortc.f igraph-0.6.5/interfaces/R/arpack/dsortc.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsortc.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsortc.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,344 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsortc
-c
-c\Description:
-c  Sorts the complex array in XREAL and XIMAG into the order 
-c  specified by WHICH and optionally applies the permutation to the
-c  real array Y. It is assumed that if an element of XIMAG is
-c  nonzero, then its negative is also an element. In other words,
-c  both members of a complex conjugate pair are to be sorted and the
-c  pairs are kept adjacent to each other.
-c
-c\Usage:
-c  call igraphdsortc
-c     ( WHICH, APPLY, N, XREAL, XIMAG, Y )
-c
-c\Arguments
-c  WHICH   Character*2.  (Input)
-c          'LM' -> sort XREAL,XIMAG into increasing order of magnitude.
-c          'SM' -> sort XREAL,XIMAG into decreasing order of magnitude.
-c          'LR' -> sort XREAL into increasing order of algebraic.
-c          'SR' -> sort XREAL into decreasing order of algebraic.
-c          'LI' -> sort XIMAG into increasing order of magnitude.
-c          'SI' -> sort XIMAG into decreasing order of magnitude.
-c          NOTE: If an element of XIMAG is non-zero, then its negative
-c                is also an element.
-c
-c  APPLY   Logical.  (Input)
-c          APPLY = .TRUE.  -> apply the sorted order to array Y.
-c          APPLY = .FALSE. -> do not apply the sorted order to array Y.
-c
-c  N       Integer.  (INPUT)
-c          Size of the arrays.
-c
-c  XREAL,  Double precision array of length N.  (INPUT/OUTPUT)
-c  XIMAG   Real and imaginary part of the array to be sorted.
-c
-c  Y       Double precision array of length N.  (INPUT/OUTPUT)
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     xx/xx/92: Version ' 2.1'
-c               Adapted from the sort routine in LANSO.
-c
-c\SCCS Information: @(#) 
-c FILE: sortc.F   SID: 2.3   DATE OF SID: 4/20/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsortc (which, apply, n, xreal, ximag, y)
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character*2 which
-      logical    apply
-      integer    n
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision     
-     &           xreal(0:n-1), ximag(0:n-1), y(0:n-1)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i, igap, j
-      Double precision     
-     &           temp, temp1, temp2
-c
-c     %--------------------%
-c     | External Functions |
-c     %--------------------%
-c
-      Double precision     
-     &           dlapy2
-      external   dlapy2
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      igap = n / 2
-c 
-      if (which .eq. 'LM') then
-c
-c        %------------------------------------------------------%
-c        | Sort XREAL,XIMAG into increasing order of magnitude. |
-c        %------------------------------------------------------%
-c
-   10    continue
-         if (igap .eq. 0) go to 9000
-c
-         do 30 i = igap, n-1
-            j = i-igap
-   20       continue
-c
-            if (j.lt.0) go to 30
-c
-            temp1 = dlapy2(xreal(j),ximag(j))
-            temp2 = dlapy2(xreal(j+igap),ximag(j+igap))
-c
-            if (temp1.gt.temp2) then
-                temp = xreal(j)
-                xreal(j) = xreal(j+igap)
-                xreal(j+igap) = temp
-c
-                temp = ximag(j)
-                ximag(j) = ximag(j+igap)
-                ximag(j+igap) = temp
-c
-                if (apply) then
-                    temp = y(j)
-                    y(j) = y(j+igap)
-                    y(j+igap) = temp
-                end if
-            else
-                go to 30
-            end if
-            j = j-igap
-            go to 20
-   30    continue
-         igap = igap / 2
-         go to 10
-c
-      else if (which .eq. 'SM') then
-c
-c        %------------------------------------------------------%
-c        | Sort XREAL,XIMAG into decreasing order of magnitude. |
-c        %------------------------------------------------------%
-c
-   40    continue
-         if (igap .eq. 0) go to 9000
-c
-         do 60 i = igap, n-1
-            j = i-igap
-   50       continue
-c
-            if (j .lt. 0) go to 60
-c
-            temp1 = dlapy2(xreal(j),ximag(j))
-            temp2 = dlapy2(xreal(j+igap),ximag(j+igap))
-c
-            if (temp1.lt.temp2) then
-               temp = xreal(j)
-               xreal(j) = xreal(j+igap)
-               xreal(j+igap) = temp
-c
-               temp = ximag(j)
-               ximag(j) = ximag(j+igap)
-               ximag(j+igap) = temp
-c 
-               if (apply) then
-                  temp = y(j)
-                  y(j) = y(j+igap)
-                  y(j+igap) = temp
-               end if
-            else
-               go to 60
-            endif
-            j = j-igap
-            go to 50
-   60    continue
-         igap = igap / 2
-         go to 40
-c 
-      else if (which .eq. 'LR') then
-c
-c        %------------------------------------------------%
-c        | Sort XREAL into increasing order of algebraic. |
-c        %------------------------------------------------%
-c
-   70    continue
-         if (igap .eq. 0) go to 9000
-c
-         do 90 i = igap, n-1
-            j = i-igap
-   80       continue
-c
-            if (j.lt.0) go to 90
-c
-            if (xreal(j).gt.xreal(j+igap)) then
-               temp = xreal(j)
-               xreal(j) = xreal(j+igap)
-               xreal(j+igap) = temp
-c
-               temp = ximag(j)
-               ximag(j) = ximag(j+igap)
-               ximag(j+igap) = temp
-c 
-               if (apply) then
-                  temp = y(j)
-                  y(j) = y(j+igap)
-                  y(j+igap) = temp
-               end if
-            else
-               go to 90
-            endif
-            j = j-igap
-            go to 80
-   90    continue
-         igap = igap / 2
-         go to 70
-c 
-      else if (which .eq. 'SR') then
-c
-c        %------------------------------------------------%
-c        | Sort XREAL into decreasing order of algebraic. |
-c        %------------------------------------------------%
-c
-  100    continue
-         if (igap .eq. 0) go to 9000
-         do 120 i = igap, n-1
-            j = i-igap
-  110       continue
-c
-            if (j.lt.0) go to 120
-c
-            if (xreal(j).lt.xreal(j+igap)) then
-               temp = xreal(j)
-               xreal(j) = xreal(j+igap)
-               xreal(j+igap) = temp
-c
-               temp = ximag(j)
-               ximag(j) = ximag(j+igap)
-               ximag(j+igap) = temp
-c 
-               if (apply) then
-                  temp = y(j)
-                  y(j) = y(j+igap)
-                  y(j+igap) = temp
-               end if
-            else
-               go to 120
-            endif
-            j = j-igap
-            go to 110
-  120    continue
-         igap = igap / 2
-         go to 100
-c 
-      else if (which .eq. 'LI') then
-c
-c        %------------------------------------------------%
-c        | Sort XIMAG into increasing order of magnitude. |
-c        %------------------------------------------------%
-c
-  130    continue
-         if (igap .eq. 0) go to 9000
-         do 150 i = igap, n-1
-            j = i-igap
-  140       continue
-c
-            if (j.lt.0) go to 150
-c
-            if (abs(ximag(j)).gt.abs(ximag(j+igap))) then
-               temp = xreal(j)
-               xreal(j) = xreal(j+igap)
-               xreal(j+igap) = temp
-c
-               temp = ximag(j)
-               ximag(j) = ximag(j+igap)
-               ximag(j+igap) = temp
-c 
-               if (apply) then
-                  temp = y(j)
-                  y(j) = y(j+igap)
-                  y(j+igap) = temp
-               end if
-            else
-               go to 150
-            endif
-            j = j-igap
-            go to 140
-  150    continue
-         igap = igap / 2
-         go to 130
-c 
-      else if (which .eq. 'SI') then
-c
-c        %------------------------------------------------%
-c        | Sort XIMAG into decreasing order of magnitude. |
-c        %------------------------------------------------%
-c
-  160    continue
-         if (igap .eq. 0) go to 9000
-         do 180 i = igap, n-1
-            j = i-igap
-  170       continue
-c
-            if (j.lt.0) go to 180
-c
-            if (abs(ximag(j)).lt.abs(ximag(j+igap))) then
-               temp = xreal(j)
-               xreal(j) = xreal(j+igap)
-               xreal(j+igap) = temp
-c
-               temp = ximag(j)
-               ximag(j) = ximag(j+igap)
-               ximag(j+igap) = temp
-c 
-               if (apply) then
-                  temp = y(j)
-                  y(j) = y(j+igap)
-                  y(j+igap) = temp
-               end if
-            else
-               go to 180
-            endif
-            j = j-igap
-            go to 170
-  180    continue
-         igap = igap / 2
-         go to 160
-      end if
-c 
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdsortc |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dsortr.f igraph-0.6.5/interfaces/R/arpack/dsortr.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dsortr.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dsortr.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,218 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdsortr
-c
-c\Description:
-c  Sort the array X1 in the order specified by WHICH and optionally 
-c  applies the permutation to the array X2.
-c
-c\Usage:
-c  call igraphdsortr
-c     ( WHICH, APPLY, N, X1, X2 )
-c
-c\Arguments
-c  WHICH   Character*2.  (Input)
-c          'LM' -> X1 is sorted into increasing order of magnitude.
-c          'SM' -> X1 is sorted into decreasing order of magnitude.
-c          'LA' -> X1 is sorted into increasing order of algebraic.
-c          'SA' -> X1 is sorted into decreasing order of algebraic.
-c
-c  APPLY   Logical.  (Input)
-c          APPLY = .TRUE.  -> apply the sorted order to X2.
-c          APPLY = .FALSE. -> do not apply the sorted order to X2.
-c
-c  N       Integer.  (INPUT)
-c          Size of the arrays.
-c
-c  X1      Double precision array of length N.  (INPUT/OUTPUT)
-c          The array to be sorted.
-c
-c  X2      Double precision array of length N.  (INPUT/OUTPUT)
-c          Only referenced if APPLY = .TRUE.
-c
-c\EndDoc
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University 
-c     Dept. of Computational &     Houston, Texas 
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\Revision history:
-c     12/16/93: Version ' 2.1'.
-c               Adapted from the sort routine in LANSO.
-c
-c\SCCS Information: @(#) 
-c FILE: sortr.F   SID: 2.3   DATE OF SID: 4/19/96   RELEASE: 2
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdsortr (which, apply, n, x1, x2)
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      character*2 which
-      logical    apply
-      integer    n
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           x1(0:n-1), x2(0:n-1)
-c
-c     %---------------%
-c     | Local Scalars |
-c     %---------------%
-c
-      integer    i, igap, j
-      Double precision
-     &           temp
-c
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      igap = n / 2
-c 
-      if (which .eq. 'SA') then
-c
-c        X1 is sorted into decreasing order of algebraic.
-c
-   10    continue
-         if (igap .eq. 0) go to 9000
-         do 30 i = igap, n-1
-            j = i-igap
-   20       continue
-c
-            if (j.lt.0) go to 30
-c
-            if (x1(j).lt.x1(j+igap)) then
-               temp = x1(j)
-               x1(j) = x1(j+igap)
-               x1(j+igap) = temp
-               if (apply) then
-                  temp = x2(j)
-                  x2(j) = x2(j+igap)
-                  x2(j+igap) = temp
-               end if
-            else
-               go to 30
-            endif
-            j = j-igap
-            go to 20
-   30    continue
-         igap = igap / 2
-         go to 10
-c
-      else if (which .eq. 'SM') then
-c
-c        X1 is sorted into decreasing order of magnitude.
-c
-   40    continue
-         if (igap .eq. 0) go to 9000
-         do 60 i = igap, n-1
-            j = i-igap
-   50       continue
-c
-            if (j.lt.0) go to 60
-c
-            if (abs(x1(j)).lt.abs(x1(j+igap))) then
-               temp = x1(j)
-               x1(j) = x1(j+igap)
-               x1(j+igap) = temp
-               if (apply) then
-                  temp = x2(j)
-                  x2(j) = x2(j+igap)
-                  x2(j+igap) = temp
-               end if
-            else
-               go to 60
-            endif
-            j = j-igap
-            go to 50
-   60    continue
-         igap = igap / 2
-         go to 40
-c
-      else if (which .eq. 'LA') then
-c
-c        X1 is sorted into increasing order of algebraic.
-c
-   70    continue
-         if (igap .eq. 0) go to 9000
-         do 90 i = igap, n-1
-            j = i-igap
-   80       continue
-c
-            if (j.lt.0) go to 90
-c           
-            if (x1(j).gt.x1(j+igap)) then
-               temp = x1(j)
-               x1(j) = x1(j+igap)
-               x1(j+igap) = temp
-               if (apply) then
-                  temp = x2(j)
-                  x2(j) = x2(j+igap)
-                  x2(j+igap) = temp
-               end if
-            else
-               go to 90
-            endif
-            j = j-igap
-            go to 80
-   90    continue
-         igap = igap / 2
-         go to 70
-c 
-      else if (which .eq. 'LM') then
-c
-c        X1 is sorted into increasing order of magnitude.
-c
-  100    continue
-         if (igap .eq. 0) go to 9000
-         do 120 i = igap, n-1
-            j = i-igap
-  110       continue
-c
-            if (j.lt.0) go to 120
-c
-            if (abs(x1(j)).gt.abs(x1(j+igap))) then
-               temp = x1(j)
-               x1(j) = x1(j+igap)
-               x1(j+igap) = temp
-               if (apply) then
-                  temp = x2(j)
-                  x2(j) = x2(j+igap)
-                  x2(j+igap) = temp
-               end if
-            else
-               go to 120
-            endif
-            j = j-igap
-            go to 110
-  120    continue
-         igap = igap / 2
-         go to 100
-      end if
-c
- 9000 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdsortr |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dstatn.f igraph-0.6.5/interfaces/R/arpack/dstatn.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dstatn.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dstatn.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-c
-c     %---------------------------------------------%
-c     | Initialize statistic and timing information |
-c     | for nonsymmetric Arnoldi code.              |
-c     %---------------------------------------------%
-c
-c\Author
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas    
-c
-c\SCCS Information: @(#) 
-c FILE: statn.F   SID: 2.4   DATE OF SID: 4/20/96   RELEASE: 2
-c
-      subroutine igraphdstatn
-c
-c     %--------------------------------%
-c     | See stat.doc for documentation |
-c     %--------------------------------%
-c
-      include   'stat.h'
-c 
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-c
-      nopx   = 0
-      nbx    = 0
-      nrorth = 0
-      nitref = 0
-      nrstrt = 0
-c 
-      tnaupd = 0.0D+0
-      tnaup2 = 0.0D+0
-      tnaitr = 0.0D+0
-      tneigh = 0.0D+0
-      tngets = 0.0D+0
-      tnapps = 0.0D+0
-      tnconv = 0.0D+0
-      titref = 0.0D+0
-      tgetv0 = 0.0D+0
-      trvec  = 0.0D+0
-c 
-c     %----------------------------------------------------%
-c     | User time including reverse communication overhead |
-c     %----------------------------------------------------%
-c
-      tmvopx = 0.0D+0
-      tmvbx  = 0.0D+0
-c 
-      return
-c
-c
-c     %---------------%
-c     | End of igraphdstatn |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dstats.f igraph-0.6.5/interfaces/R/arpack/dstats.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dstats.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dstats.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-c
-c\SCCS Information: @(#) 
-c FILE: stats.F   SID: 2.1   DATE OF SID: 4/19/96   RELEASE: 2
-c     %---------------------------------------------%
-c     | Initialize statistic and timing information |
-c     | for symmetric Arnoldi code.                 |
-c     %---------------------------------------------%
- 
-      subroutine igraphdstats
-
-c     %--------------------------------%
-c     | See stat.doc for documentation |
-c     %--------------------------------%
-      include   'stat.h'
- 
-c     %-----------------------%
-c     | Executable Statements |
-c     %-----------------------%
-
-      nopx   = 0
-      nbx    = 0
-      nrorth = 0
-      nitref = 0
-      nrstrt = 0
- 
-      tsaupd = 0.0D+0
-      tsaup2 = 0.0D+0
-      tsaitr = 0.0D+0
-      tseigt = 0.0D+0
-      tsgets = 0.0D+0
-      tsapps = 0.0D+0
-      tsconv = 0.0D+0
-      titref = 0.0D+0
-      tgetv0 = 0.0D+0
-      trvec  = 0.0D+0
- 
-c     %----------------------------------------------------%
-c     | User time including reverse communication overhead |
-c     %----------------------------------------------------%
-      tmvopx = 0.0D+0
-      tmvbx  = 0.0D+0
- 
-      return
-c
-c     End of igraphdstats
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dstqrb.f igraph-0.6.5/interfaces/R/arpack/dstqrb.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dstqrb.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dstqrb.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,594 +0,0 @@
-c-----------------------------------------------------------------------
-c\BeginDoc
-c
-c\Name: igraphdstqrb
-c
-c\Description:
-c  Computes all eigenvalues and the last component of the eigenvectors
-c  of a symmetric tridiagonal matrix using the implicit QL or QR method.
-c
-c  This is mostly a modification of the LAPACK routine dsteqr.
-c  See Remarks.
-c
-c\Usage:
-c  call igraphdstqrb
-c     ( N, D, E, Z, WORK, INFO )
-c
-c\Arguments
-c  N       Integer.  (INPUT)
-c          The number of rows and columns in the matrix.  N >= 0.
-c
-c  D       Double precision array, dimension (N).  (INPUT/OUTPUT)
-c          On entry, D contains the diagonal elements of the
-c          tridiagonal matrix.
-c          On exit, D contains the eigenvalues, in ascending order.
-c          If an error exit is made, the eigenvalues are correct
-c          for indices 1,2,...,INFO-1, but they are unordered and
-c          may not be the smallest eigenvalues of the matrix.
-c
-c  E       Double precision array, dimension (N-1).  (INPUT/OUTPUT)
-c          On entry, E contains the subdiagonal elements of the
-c          tridiagonal matrix in positions 1 through N-1.
-c          On exit, E has been destroyed.
-c
-c  Z       Double precision array, dimension (N).  (OUTPUT)
-c          On exit, Z contains the last row of the orthonormal 
-c          eigenvector matrix of the symmetric tridiagonal matrix.  
-c          If an error exit is made, Z contains the last row of the
-c          eigenvector matrix associated with the stored eigenvalues.
-c
-c  WORK    Double precision array, dimension (max(1,2*N-2)).  (WORKSPACE)
-c          Workspace used in accumulating the transformation for 
-c          computing the last components of the eigenvectors.
-c
-c  INFO    Integer.  (OUTPUT)
-c          = 0:  normal return.
-c          < 0:  if INFO = -i, the i-th argument had an illegal value.
-c          > 0:  if INFO = +i, the i-th eigenvalue has not converged
-c                              after a total of  30*N  iterations.
-c
-c\Remarks
-c  1. None.
-c
-c-----------------------------------------------------------------------
-c
-c\BeginLib
-c
-c\Local variables:
-c     xxxxxx  real
-c
-c\Routines called:
-c     daxpy   Level 1 BLAS that computes a vector triad.
-c     dcopy   Level 1 BLAS that copies one vector to another.
-c     dswap   Level 1 BLAS that swaps the contents of two vectors.
-c     lsame   LAPACK character comparison routine.
-c     dlae2   LAPACK routine that computes the eigenvalues of a 2-by-2 
-c             symmetric matrix.
-c     dlaev2  LAPACK routine that eigendecomposition of a 2-by-2 symmetric 
-c             matrix.
-c     dlamch  LAPACK routine that determines machine constants.
-c     dlanst  LAPACK routine that computes the norm of a matrix.
-c     dlapy2  LAPACK routine to compute sqrt(x**2+y**2) carefully.
-c     dlartg  LAPACK Givens rotation construction routine.
-c     dlascl  LAPACK routine for careful scaling of a matrix.
-c     dlaset  LAPACK matrix initialization routine.
-c     dlasr   LAPACK routine that applies an orthogonal transformation to 
-c             a matrix.
-c     dlasrt  LAPACK sorting routine.
-c     dsteqr  LAPACK routine that computes eigenvalues and eigenvectors
-c             of a symmetric tridiagonal matrix.
-c     xerbla  LAPACK error handler routine.
-c
-c\Authors
-c     Danny Sorensen               Phuong Vu
-c     Richard Lehoucq              CRPC / Rice University
-c     Dept. of Computational &     Houston, Texas
-c     Applied Mathematics
-c     Rice University           
-c     Houston, Texas            
-c
-c\SCCS Information: @(#) 
-c FILE: stqrb.F   SID: 2.5   DATE OF SID: 8/27/96   RELEASE: 2
-c
-c\Remarks
-c     1. Starting with version 2.5, this routine is a modified version
-c        of LAPACK version 2.0 subroutine SSTEQR. No lines are deleted,
-c        only commeted out and new lines inserted.
-c        All lines commented out have "c$$$" at the beginning.
-c        Note that the LAPACK version 1.0 subroutine SSTEQR contained
-c        bugs. 
-c
-c\EndLib
-c
-c-----------------------------------------------------------------------
-c
-      subroutine igraphdstqrb ( n, d, e, z, work, info )
-c
-c     %------------------%
-c     | Scalar Arguments |
-c     %------------------%
-c
-      integer    info, n
-c
-c     %-----------------%
-c     | Array Arguments |
-c     %-----------------%
-c
-      Double precision
-     &           d( n ), e( n-1 ), z( n ), work( 2*n-2 )
-c
-c     .. parameters ..
-      Double precision               
-     &                   zero, one, two, three
-      parameter          ( zero = 0.0D+0, one = 1.0D+0, 
-     &                     two = 2.0D+0, three = 3.0D+0 )
-      integer            maxit
-      parameter          ( maxit = 30 )
-c     ..
-c     .. local scalars ..
-      integer            i, icompz, ii, iscale, j, jtot, k, l, l1, lend,
-     &                   lendm1, lendp1, lendsv, lm1, lsv, m, mm, mm1,
-     &                   nm1, nmaxit
-      Double precision               
-     &                   anorm, b, c, eps, eps2, f, g, p, r, rt1, rt2,
-     &                   s, safmax, safmin, ssfmax, ssfmin, tst
-c     ..
-c     .. external functions ..
-      logical            lsame
-      Double precision
-     &                   dlamch, dlanst, dlapy2
-      external           lsame, dlamch, dlanst, dlapy2
-c     ..
-c     .. external subroutines ..
-      external           dlae2, dlaev2, dlartg, dlascl, dlaset, dlasr,
-     &                   dlasrt, dswap, xerbla
-c     ..
-c     .. intrinsic functions ..
-      intrinsic          abs, max, sign, sqrt
-c     ..
-c     .. executable statements ..
-c
-c     test the input parameters.
-c
-      info = 0
-c
-c$$$      IF( LSAME( COMPZ, 'N' ) ) THEN
-c$$$         ICOMPZ = 0
-c$$$      ELSE IF( LSAME( COMPZ, 'V' ) ) THEN
-c$$$         ICOMPZ = 1
-c$$$      ELSE IF( LSAME( COMPZ, 'I' ) ) THEN
-c$$$         ICOMPZ = 2
-c$$$      ELSE
-c$$$         ICOMPZ = -1
-c$$$      END IF
-c$$$      IF( ICOMPZ.LT.0 ) THEN
-c$$$         INFO = -1
-c$$$      ELSE IF( N.LT.0 ) THEN
-c$$$         INFO = -2
-c$$$      ELSE IF( ( LDZ.LT.1 ) .OR. ( ICOMPZ.GT.0 .AND. LDZ.LT.MAX( 1,
-c$$$     $         N ) ) ) THEN
-c$$$         INFO = -6
-c$$$      END IF
-c$$$      IF( INFO.NE.0 ) THEN
-c$$$         CALL XERBLA( 'SSTEQR', -INFO )
-c$$$         RETURN
-c$$$      END IF
-c
-c    *** New starting with version 2.5 ***
-c
-      icompz = 2
-c    *************************************
-c
-c     quick return if possible
-c
-      if( n.eq.0 )
-     $   return
-c
-      if( n.eq.1 ) then
-         if( icompz.eq.2 )  z( 1 ) = one
-         return
-      end if
-c
-c     determine the unit roundoff and over/underflow thresholds.
-c
-      eps = dlamch( 'e' )
-      eps2 = eps**2
-      safmin = dlamch( 's' )
-      safmax = one / safmin
-      ssfmax = sqrt( safmax ) / three
-      ssfmin = sqrt( safmin ) / eps2
-c
-c     compute the eigenvalues and eigenvectors of the tridiagonal
-c     matrix.
-c
-c$$      if( icompz.eq.2 )
-c$$$     $   call dlaset( 'full', n, n, zero, one, z, ldz )
-c
-c     *** New starting with version 2.5 ***
-c
-      if ( icompz .eq. 2 ) then
-         do 5 j = 1, n-1
-            z(j) = zero
-  5      continue
-         z( n ) = one
-      end if
-c     *************************************
-c
-      nmaxit = n*maxit
-      jtot = 0
-c
-c     determine where the matrix splits and choose ql or qr iteration
-c     for each block, according to whether top or bottom diagonal
-c     element is smaller.
-c
-      l1 = 1
-      nm1 = n - 1
-c
-   10 continue
-      if( l1.gt.n )
-     $   go to 160
-      if( l1.gt.1 )
-     $   e( l1-1 ) = zero
-      if( l1.le.nm1 ) then
-         do 20 m = l1, nm1
-            tst = abs( e( m ) )
-            if( tst.eq.zero )
-     $         go to 30
-            if( tst.le.( sqrt( abs( d( m ) ) )*sqrt( abs( d( m+
-     $          1 ) ) ) )*eps ) then
-               e( m ) = zero
-               go to 30
-            end if
-   20    continue
-      end if
-      m = n
-c
-   30 continue
-      l = l1
-      lsv = l
-      lend = m
-      lendsv = lend
-      l1 = m + 1
-      if( lend.eq.l )
-     $   go to 10
-c
-c     scale submatrix in rows and columns l to lend
-c
-      anorm = dlanst( 'i', lend-l+1, d( l ), e( l ) )
-      iscale = 0
-      if( anorm.eq.zero )
-     $   go to 10
-      if( anorm.gt.ssfmax ) then
-         iscale = 1
-         call dlascl( 'g', 0, 0, anorm, ssfmax, lend-l+1, 1, d( l ), n,
-     $                info )
-         call dlascl( 'g', 0, 0, anorm, ssfmax, lend-l, 1, e( l ), n,
-     $                info )
-      else if( anorm.lt.ssfmin ) then
-         iscale = 2
-         call dlascl( 'g', 0, 0, anorm, ssfmin, lend-l+1, 1, d( l ), n,
-     $                info )
-         call dlascl( 'g', 0, 0, anorm, ssfmin, lend-l, 1, e( l ), n,
-     $                info )
-      end if
-c
-c     choose between ql and qr iteration
-c
-      if( abs( d( lend ) ).lt.abs( d( l ) ) ) then
-         lend = lsv
-         l = lendsv
-      end if
-c
-      if( lend.gt.l ) then
-c
-c        ql iteration
-c
-c        look for small subdiagonal element.
-c
-   40    continue
-         if( l.ne.lend ) then
-            lendm1 = lend - 1
-            do 50 m = l, lendm1
-               tst = abs( e( m ) )**2
-               if( tst.le.( eps2*abs( d( m ) ) )*abs( d( m+1 ) )+
-     $             safmin )go to 60
-   50       continue
-         end if
-c
-         m = lend
-c
-   60    continue
-         if( m.lt.lend )
-     $      e( m ) = zero
-         p = d( l )
-         if( m.eq.l )
-     $      go to 80
-c
-c        if remaining matrix is 2-by-2, use dlae2 or dlaev2
-c        to compute its eigensystem.
-c
-         if( m.eq.l+1 ) then
-            if( icompz.gt.0 ) then
-               call dlaev2( d( l ), e( l ), d( l+1 ), rt1, rt2, c, s )
-               work( l ) = c
-               work( n-1+l ) = s
-c$$$               call dlasr( 'r', 'v', 'b', n, 2, work( l ),
-c$$$     $                     work( n-1+l ), z( 1, l ), ldz )
-c
-c              *** New starting with version 2.5 ***
-c
-               tst      = z(l+1)
-               z(l+1) = c*tst - s*z(l)
-               z(l)   = s*tst + c*z(l)
-c              *************************************
-            else
-               call dlae2( d( l ), e( l ), d( l+1 ), rt1, rt2 )
-            end if
-            d( l ) = rt1
-            d( l+1 ) = rt2
-            e( l ) = zero
-            l = l + 2
-            if( l.le.lend )
-     $         go to 40
-            go to 140
-         end if
-c
-         if( jtot.eq.nmaxit )
-     $      go to 140
-         jtot = jtot + 1
-c
-c        form shift.
-c
-         g = ( d( l+1 )-p ) / ( two*e( l ) )
-         r = dlapy2( g, one )
-         g = d( m ) - p + ( e( l ) / ( g+sign( r, g ) ) )
-c
-         s = one
-         c = one
-         p = zero
-c
-c        inner loop
-c
-         mm1 = m - 1
-         do 70 i = mm1, l, -1
-            f = s*e( i )
-            b = c*e( i )
-            call dlartg( g, f, c, s, r )
-            if( i.ne.m-1 )
-     $         e( i+1 ) = r
-            g = d( i+1 ) - p
-            r = ( d( i )-g )*s + two*c*b
-            p = s*r
-            d( i+1 ) = g + p
-            g = c*r - b
-c
-c           if eigenvectors are desired, then save rotations.
-c
-            if( icompz.gt.0 ) then
-               work( i ) = c
-               work( n-1+i ) = -s
-            end if
-c
-   70    continue
-c
-c        if eigenvectors are desired, then apply saved rotations.
-c
-         if( icompz.gt.0 ) then
-            mm = m - l + 1
-c$$$            call dlasr( 'r', 'v', 'b', n, mm, work( l ), work( n-1+l ),
-c$$$     $                  z( 1, l ), ldz )
-c
-c             *** New starting with version 2.5 ***
-c
-              call dlasr( 'r', 'v', 'b', 1, mm, work( l ), 
-     &                    work( n-1+l ), z( l ), 1 )
-c             *************************************                             
-         end if
-c
-         d( l ) = d( l ) - p
-         e( l ) = g
-         go to 40
-c
-c        eigenvalue found.
-c
-   80    continue
-         d( l ) = p
-c
-         l = l + 1
-         if( l.le.lend )
-     $      go to 40
-         go to 140
-c
-      else
-c
-c        qr iteration
-c
-c        look for small superdiagonal element.
-c
-   90    continue
-         if( l.ne.lend ) then
-            lendp1 = lend + 1
-            do 100 m = l, lendp1, -1
-               tst = abs( e( m-1 ) )**2
-               if( tst.le.( eps2*abs( d( m ) ) )*abs( d( m-1 ) )+
-     $             safmin )go to 110
-  100       continue
-         end if
-c
-         m = lend
-c
-  110    continue
-         if( m.gt.lend )
-     $      e( m-1 ) = zero
-         p = d( l )
-         if( m.eq.l )
-     $      go to 130
-c
-c        if remaining matrix is 2-by-2, use dlae2 or dlaev2
-c        to compute its eigensystem.
-c
-         if( m.eq.l-1 ) then
-            if( icompz.gt.0 ) then
-               call dlaev2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2, c, s )
-c$$$               work( m ) = c
-c$$$               work( n-1+m ) = s
-c$$$               call dlasr( 'r', 'v', 'f', n, 2, work( m ),
-c$$$     $                     work( n-1+m ), z( 1, l-1 ), ldz )
-c
-c               *** New starting with version 2.5 ***
-c
-                tst      = z(l)
-                z(l)   = c*tst - s*z(l-1)
-                z(l-1) = s*tst + c*z(l-1)
-c               ************************************* 
-            else
-               call dlae2( d( l-1 ), e( l-1 ), d( l ), rt1, rt2 )
-            end if
-            d( l-1 ) = rt1
-            d( l ) = rt2
-            e( l-1 ) = zero
-            l = l - 2
-            if( l.ge.lend )
-     $         go to 90
-            go to 140
-         end if
-c
-         if( jtot.eq.nmaxit )
-     $      go to 140
-         jtot = jtot + 1
-c
-c        form shift.
-c
-         g = ( d( l-1 )-p ) / ( two*e( l-1 ) )
-         r = dlapy2( g, one )
-         g = d( m ) - p + ( e( l-1 ) / ( g+sign( r, g ) ) )
-c
-         s = one
-         c = one
-         p = zero
-c
-c        inner loop
-c
-         lm1 = l - 1
-         do 120 i = m, lm1
-            f = s*e( i )
-            b = c*e( i )
-            call dlartg( g, f, c, s, r )
-            if( i.ne.m )
-     $         e( i-1 ) = r
-            g = d( i ) - p
-            r = ( d( i+1 )-g )*s + two*c*b
-            p = s*r
-            d( i ) = g + p
-            g = c*r - b
-c
-c           if eigenvectors are desired, then save rotations.
-c
-            if( icompz.gt.0 ) then
-               work( i ) = c
-               work( n-1+i ) = s
-            end if
-c
-  120    continue
-c
-c        if eigenvectors are desired, then apply saved rotations.
-c
-         if( icompz.gt.0 ) then
-            mm = l - m + 1
-c$$$            call dlasr( 'r', 'v', 'f', n, mm, work( m ), work( n-1+m ),
-c$$$     $                  z( 1, m ), ldz )
-c
-c           *** New starting with version 2.5 ***
-c
-            call dlasr( 'r', 'v', 'f', 1, mm, work( m ), work( n-1+m ),
-     &                  z( m ), 1 )
-c           *************************************                             
-         end if
-c
-         d( l ) = d( l ) - p
-         e( lm1 ) = g
-         go to 90
-c
-c        eigenvalue found.
-c
-  130    continue
-         d( l ) = p
-c
-         l = l - 1
-         if( l.ge.lend )
-     $      go to 90
-         go to 140
-c
-      end if
-c
-c     undo scaling if necessary
-c
-  140 continue
-      if( iscale.eq.1 ) then
-         call dlascl( 'g', 0, 0, ssfmax, anorm, lendsv-lsv+1, 1,
-     $                d( lsv ), n, info )
-         call dlascl( 'g', 0, 0, ssfmax, anorm, lendsv-lsv, 1, e( lsv ),
-     $                n, info )
-      else if( iscale.eq.2 ) then
-         call dlascl( 'g', 0, 0, ssfmin, anorm, lendsv-lsv+1, 1,
-     $                d( lsv ), n, info )
-         call dlascl( 'g', 0, 0, ssfmin, anorm, lendsv-lsv, 1, e( lsv ),
-     $                n, info )
-      end if
-c
-c     check for no convergence to an eigenvalue after a total
-c     of n*maxit iterations.
-c
-      if( jtot.lt.nmaxit )
-     $   go to 10
-      do 150 i = 1, n - 1
-         if( e( i ).ne.zero )
-     $      info = info + 1
-  150 continue
-      go to 190
-c
-c     order eigenvalues and eigenvectors.
-c
-  160 continue
-      if( icompz.eq.0 ) then
-c
-c        use quick sort
-c
-         call dlasrt( 'i', n, d, info )
-c
-      else
-c
-c        use selection sort to minimize swaps of eigenvectors
-c
-         do 180 ii = 2, n
-            i = ii - 1
-            k = i
-            p = d( i )
-            do 170 j = ii, n
-               if( d( j ).lt.p ) then
-                  k = j
-                  p = d( j )
-               end if
-  170       continue
-            if( k.ne.i ) then
-               d( k ) = d( i )
-               d( i ) = p
-c$$$               call dswap( n, z( 1, i ), 1, z( 1, k ), 1 )
-c           *** New starting with version 2.5 ***
-c
-               p    = z(k)
-               z(k) = z(i)
-               z(i) = p
-c           *************************************
-            end if
-  180    continue
-      end if
-c
-  190 continue
-      return
-c
-c     %---------------%
-c     | End of igraphdstqrb |
-c     %---------------%
-c
-      end
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/dvout.f igraph-0.6.5/interfaces/R/arpack/dvout.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/dvout.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/dvout.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,122 +0,0 @@
-*-----------------------------------------------------------------------
-*  Routine:    DVOUT
-*
-*  Purpose:    Real vector output routine.
-*
-*  Usage:      CALL DVOUT (LOUT, N, SX, IDIGIT, IFMT)
-*
-*  Arguments
-*     N      - Length of array SX.  (Input)
-*     SX     - Real array to be printed.  (Input)
-*     IFMT   - Format to be used in printing array SX.  (Input)
-*     IDIGIT - Print up to IABS(IDIGIT) decimal digits per number.  (In)
-*              If IDIGIT .LT. 0, printing is done with 72 columns.
-*              If IDIGIT .GT. 0, printing is done with 132 columns.
-*
-*-----------------------------------------------------------------------
-*
-      SUBROUTINE IGRAPHDVOUT( LOUT, N, SX, IDIGIT, IFMT )
-*     ...
-*     ... SPECIFICATIONS FOR ARGUMENTS
-*     ...
-*     ... SPECIFICATIONS FOR LOCAL VARIABLES
-*     .. Scalar Arguments ..
-      CHARACTER*( * )    IFMT
-      INTEGER            IDIGIT, LOUT, N
-*     ..
-*     .. Array Arguments ..
-      DOUBLE PRECISION   SX( * )
-*     ..
-*     .. Local Scalars ..
-      CHARACTER*80       LINE
-      INTEGER            I, K1, K2, LLL, NDIGIT
-*     ..
-*     .. Intrinsic Functions ..
-      INTRINSIC          LEN, MIN, MIN0
-*     ..
-*     .. Executable Statements ..
-*     ...
-*     ... FIRST EXECUTABLE STATEMENT
-*
-*
-c$$$      LLL = MIN( LEN( IFMT ), 80 )
-c$$$      DO 10 I = 1, LLL
-c$$$         LINE( I: I ) = '-'
-c$$$   10 CONTINUE
-c$$$*
-c$$$      DO 20 I = LLL + 1, 80
-c$$$         LINE( I: I ) = ' '
-c$$$   20 CONTINUE
-c$$$*
-c$$$      WRITE( LOUT, FMT = 9999 )IFMT, LINE( 1: LLL )
-c$$$ 9999 FORMAT( / 1X, A, / 1X, A )
-c$$$*
-c$$$      IF( N.LE.0 )
-c$$$     $   RETURN
-c$$$      NDIGIT = IDIGIT
-c$$$      IF( IDIGIT.EQ.0 )
-c$$$     $   NDIGIT = 4
-c$$$*
-c$$$*=======================================================================
-c$$$*             CODE FOR OUTPUT USING 72 COLUMNS FORMAT
-c$$$*=======================================================================
-c$$$*
-c$$$      IF( IDIGIT.LT.0 ) THEN
-c$$$         NDIGIT = -IDIGIT
-c$$$         IF( NDIGIT.LE.4 ) THEN
-c$$$            DO 30 K1 = 1, N, 5
-c$$$               K2 = MIN0( N, K1+4 )
-c$$$               WRITE( LOUT, FMT = 9998 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   30       CONTINUE
-c$$$         ELSE IF( NDIGIT.LE.6 ) THEN
-c$$$            DO 40 K1 = 1, N, 4
-c$$$               K2 = MIN0( N, K1+3 )
-c$$$               WRITE( LOUT, FMT = 9997 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   40       CONTINUE
-c$$$         ELSE IF( NDIGIT.LE.10 ) THEN
-c$$$            DO 50 K1 = 1, N, 3
-c$$$               K2 = MIN0( N, K1+2 )
-c$$$               WRITE( LOUT, FMT = 9996 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   50       CONTINUE
-c$$$         ELSE
-c$$$            DO 60 K1 = 1, N, 2
-c$$$               K2 = MIN0( N, K1+1 )
-c$$$               WRITE( LOUT, FMT = 9995 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   60       CONTINUE
-c$$$         END IF
-c$$$*
-c$$$*=======================================================================
-c$$$*             CODE FOR OUTPUT USING 132 COLUMNS FORMAT
-c$$$*=======================================================================
-c$$$*
-c$$$      ELSE
-c$$$         IF( NDIGIT.LE.4 ) THEN
-c$$$            DO 70 K1 = 1, N, 10
-c$$$               K2 = MIN0( N, K1+9 )
-c$$$               WRITE( LOUT, FMT = 9998 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   70       CONTINUE
-c$$$         ELSE IF( NDIGIT.LE.6 ) THEN
-c$$$            DO 80 K1 = 1, N, 8
-c$$$               K2 = MIN0( N, K1+7 )
-c$$$               WRITE( LOUT, FMT = 9997 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   80       CONTINUE
-c$$$         ELSE IF( NDIGIT.LE.10 ) THEN
-c$$$            DO 90 K1 = 1, N, 6
-c$$$               K2 = MIN0( N, K1+5 )
-c$$$               WRITE( LOUT, FMT = 9996 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$   90       CONTINUE
-c$$$         ELSE
-c$$$            DO 100 K1 = 1, N, 5
-c$$$               K2 = MIN0( N, K1+4 )
-c$$$               WRITE( LOUT, FMT = 9995 )K1, K2, ( SX( I ), I = K1, K2 )
-c$$$  100       CONTINUE
-c$$$         END IF
-c$$$      END IF
-c$$$      WRITE( LOUT, FMT = 9994 )
-c$$$      RETURN
-c$$$ 9998 FORMAT( 1X, I4, ' - ', I4, ':', 1P, 10D12.3 )
-c$$$ 9997 FORMAT( 1X, I4, ' - ', I4, ':', 1X, 1P, 8D14.5 )
-c$$$ 9996 FORMAT( 1X, I4, ' - ', I4, ':', 1X, 1P, 6D18.9 )
-c$$$ 9995 FORMAT( 1X, I4, ' - ', I4, ':', 1X, 1P, 5D24.13 )
-c$$$ 9994 FORMAT( 1X, ' ' )
-      END
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/ivout.f igraph-0.6.5/interfaces/R/arpack/ivout.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/ivout.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/ivout.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-C-----------------------------------------------------------------------
-C  Routine:    IVOUT
-C
-C  Purpose:    Integer vector output routine.
-C
-C  Usage:      CALL IVOUT (LOUT, N, IX, IDIGIT, IFMT)
-C
-C  Arguments
-C     N      - Length of array IX. (Input)
-C     IX     - Integer array to be printed. (Input)
-C     IFMT   - Format to be used in printing array IX. (Input)
-C     IDIGIT - Print up to ABS(IDIGIT) decimal digits / number. (Input)
-C              If IDIGIT .LT. 0, printing is done with 72 columns.
-C              If IDIGIT .GT. 0, printing is done with 132 columns.
-C
-C-----------------------------------------------------------------------
-C
-      SUBROUTINE IGRAPHIVOUT (LOUT, N, IX, IDIGIT, IFMT)
-C     ...
-C     ... SPECIFICATIONS FOR ARGUMENTS
-      INTEGER    IX(*), N, IDIGIT, LOUT
-      CHARACTER  IFMT*(*)
-C     ...
-C     ... SPECIFICATIONS FOR LOCAL VARIABLES
-      INTEGER    I, NDIGIT, K1, K2, LLL
-      CHARACTER*80 LINE
-*     ...
-*     ... SPECIFICATIONS INTRINSICS
-      INTRINSIC          MIN
-*
-C
-c$$$      LLL = MIN ( LEN ( IFMT ), 80 )
-c$$$      DO 1 I = 1, LLL
-c$$$          LINE(I:I) = '-'
-c$$$    1 CONTINUE
-c$$$C
-c$$$      DO 2 I = LLL+1, 80
-c$$$          LINE(I:I) = ' '
-c$$$    2 CONTINUE
-c$$$C
-c$$$      WRITE ( LOUT, 2000 ) IFMT, LINE(1:LLL)
-c$$$ 2000 FORMAT ( /1X, A  /1X, A )
-c$$$C
-c$$$      IF (N .LE. 0) RETURN
-c$$$      NDIGIT = IDIGIT
-c$$$      IF (IDIGIT .EQ. 0) NDIGIT = 4
-c$$$C
-c$$$C=======================================================================
-c$$$C             CODE FOR OUTPUT USING 72 COLUMNS FORMAT
-c$$$C=======================================================================
-c$$$C
-c$$$      IF (IDIGIT .LT. 0) THEN
-c$$$C
-c$$$      NDIGIT = -IDIGIT
-c$$$      IF (NDIGIT .LE. 4) THEN
-c$$$         DO 10 K1 = 1, N, 10
-c$$$            K2 = MIN0(N,K1+9)
-c$$$            WRITE(LOUT,1000) K1,K2,(IX(I),I=K1,K2)
-c$$$   10    CONTINUE
-c$$$C
-c$$$      ELSE IF (NDIGIT .LE. 6) THEN
-c$$$         DO 30 K1 = 1, N, 7
-c$$$            K2 = MIN0(N,K1+6)
-c$$$            WRITE(LOUT,1001) K1,K2,(IX(I),I=K1,K2)
-c$$$   30    CONTINUE
-c$$$C
-c$$$      ELSE IF (NDIGIT .LE. 10) THEN
-c$$$         DO 50 K1 = 1, N, 5
-c$$$            K2 = MIN0(N,K1+4)
-c$$$            WRITE(LOUT,1002) K1,K2,(IX(I),I=K1,K2)
-c$$$   50    CONTINUE
-c$$$C
-c$$$      ELSE
-c$$$         DO 70 K1 = 1, N, 3
-c$$$            K2 = MIN0(N,K1+2)
-c$$$            WRITE(LOUT,1003) K1,K2,(IX(I),I=K1,K2)
-c$$$   70    CONTINUE
-c$$$      END IF
-c$$$C
-c$$$C=======================================================================
-c$$$C             CODE FOR OUTPUT USING 132 COLUMNS FORMAT
-c$$$C=======================================================================
-c$$$C
-c$$$      ELSE
-c$$$C
-c$$$      IF (NDIGIT .LE. 4) THEN
-c$$$         DO 90 K1 = 1, N, 20
-c$$$            K2 = MIN0(N,K1+19)
-c$$$            WRITE(LOUT,1000) K1,K2,(IX(I),I=K1,K2)
-c$$$   90    CONTINUE
-c$$$C
-c$$$      ELSE IF (NDIGIT .LE. 6) THEN
-c$$$         DO 110 K1 = 1, N, 15
-c$$$            K2 = MIN0(N,K1+14)
-c$$$            WRITE(LOUT,1001) K1,K2,(IX(I),I=K1,K2)
-c$$$  110    CONTINUE
-c$$$C
-c$$$      ELSE IF (NDIGIT .LE. 10) THEN
-c$$$         DO 130 K1 = 1, N, 10
-c$$$            K2 = MIN0(N,K1+9)
-c$$$            WRITE(LOUT,1002) K1,K2,(IX(I),I=K1,K2)
-c$$$  130    CONTINUE
-c$$$C
-c$$$      ELSE
-c$$$         DO 150 K1 = 1, N, 7
-c$$$            K2 = MIN0(N,K1+6)
-c$$$            WRITE(LOUT,1003) K1,K2,(IX(I),I=K1,K2)
-c$$$  150    CONTINUE
-c$$$      END IF
-c$$$      END IF
-c$$$      WRITE (LOUT,1004)
-c$$$C
-c$$$ 1000 FORMAT(1X,I4,' - ',I4,':',20(1X,I5))
-c$$$ 1001 FORMAT(1X,I4,' - ',I4,':',15(1X,I7))
-c$$$ 1002 FORMAT(1X,I4,' - ',I4,':',10(1X,I11))
-c$$$ 1003 FORMAT(1X,I4,' - ',I4,':',7(1X,I15))
-c$$$ 1004 FORMAT(1X,' ')
-c$$$C
-      RETURN
-      END
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/second.f igraph-0.6.5/interfaces/R/arpack/second.f
--- igraph-0.6.5~quantal1/interfaces/R/arpack/second.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/second.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-      SUBROUTINE IGRAPHSECOND( T )
-*
-      REAL       T
-*
-*  -- LAPACK auxiliary routine (preliminary version) --
-*     Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd.,
-*     Courant Institute, Argonne National Lab, and Rice University
-*     July 26, 1991
-*
-*  Purpose
-*  =======
-*
-*  SECOND returns the user time for a process in igraphseconds.
-*  This version gets the time from the system function ETIME.
-*
-*     .. Local Scalars ..
-      REAL               T1
-*     ..
-*     .. Local Arrays ..
-      REAL               TARRAY( 2 )
-*     ..
-*     .. External Functions ..
-      REAL               ETIME
-*     ..
-*     .. Executable Statements ..
-*
-
-      T1 = ETIME( TARRAY )
-      T  = TARRAY( 1 )
-
-      RETURN
-*
-*     End of SECOND
-*
-      END
diff -Nru igraph-0.6.5~quantal1/interfaces/R/arpack/stat.h igraph-0.6.5/interfaces/R/arpack/stat.h
--- igraph-0.6.5~quantal1/interfaces/R/arpack/stat.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/arpack/stat.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-c     %--------------------------------%
-c     | See stat.doc for documentation |
-c     %--------------------------------%
-c
-c\SCCS Information: @(#) 
-c FILE: stat.h   SID: 2.2   DATE OF SID: 11/16/95   RELEASE: 2 
-c
-      real       t0, t1, t2, t3, t4, t5
-c     save       t0, t1, t2, t3, t4, t5
-c
-      integer    nopx, nbx, nrorth, nitref, nrstrt
-      real       tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv,
-     &           tnaupd, tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv,
-     &           tcaupd, tcaup2, tcaitr, tceigh, tcgets, tcapps, tcconv,
-     &           tmvopx, tmvbx, tgetv0, titref, trvec
-      common /timing/ 
-     &           nopx, nbx, nrorth, nitref, nrstrt,
-     &           tsaupd, tsaup2, tsaitr, tseigt, tsgets, tsapps, tsconv,
-     &           tnaupd, tnaup2, tnaitr, tneigh, tngets, tnapps, tnconv,
-     &           tcaupd, tcaup2, tcaitr, tceigh, tcgets, tcapps, tcconv,
-     &           tmvopx, tmvbx, tgetv0, titref, trvec
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/AUTHORS igraph-0.6.5/interfaces/R/igraph/AUTHORS
--- igraph-0.6.5~quantal1/interfaces/R/igraph/AUTHORS	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/AUTHORS	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-
-igraph authors, in alphabetical order:
---------------------------------------
-
-Patrick R. Amestoy	AMD library
-Adelchi Azzalini	igraph.options based on the sm package
-Tamas Badics		GLPK
-Gregory Benison		Minimum cut calculation
-Adrian Bowman		igraph.options based on the sm package
-Keith Briggs		Parts from the Very Nauty Graph Library
-      			Geometric random graphs
-			Girth
-      			Various patches and bug fixes
-Jeroen Bruggeman	spinglass community detection
-       			Burt's constraints
-Juergen Buchmueller	Big number math implementation
-Carter T. Butts		Some layout algorithms from the SNA R package
-       	  		bonpow function in the SNA R package
-			Some R manual pages, from the SNA R package
-Aaron Clauset		Hierarchical random graphs
-J.T. Conklin		logbl function
-Topher Cooper		GSL random number generators (not used in R)
-Gabor Csardi		Most of igraph
-Peter DalGaard		zeroin root finder
-Timothy A Davis		CXSPARSE: a Concise Sparse Matrix package - Extended
-	  		AMD library
-	  		Sparse matrix column ordering
-Laurent Deniau		Bits of the error handling system
-Ulrich Drepper		logbl function
-Iain S. Duff		AMD library
-     			GLPK
-S.I. Feldman		f2c
-David Firth		Display data frame in Tk, from relimp package
-P. Foggia		VF2 graph isomorphism algorithm
-John Fox		R: suppressing X11 warnings
-Alan George   		GLPK
-John Gilbert		Sparse matrix column ordering
-D.Goldfarb		GLPK
-Brian Gough		GSL random number generators (not used in R)
-Tom Gregorovic		Multilevel community detection
-M.Grigoriadis		GLPK
-Oscar Gustafsson	GLPK
-Paul Hsieh		pstdint.h
-Ross Ihaka		Some random number generators (not used in R)
-Tommi Junttila		BLISS graph isomorphism library
-Petteri Kaski		BLISS graph isomorphism library
-Oleg Keselyov		zeroin root finder
-Darwin Klingman		GLPK
-Donald E. Knuth		GLPK
-Stefan I. Larimore	Sparse matrix column ordering
-Yusin Lee 		GLPK
-Richard Lehoucq		ARPACK
-Rene Locher		R arrow drawing function, from IDPmisc package
-J.C. Nash		BFGS optimizer
-Joseph W-H Liu		GLPK
-Makoto Matsumoto	GSL random number generators (not used in R)
-Vincent Matossian	Graph laplacian
-			igraph_neighborhood_graphs
-			Line graphs
-Peter McMahan		Cohesive blocking
-Andrew Makhorin		GLPK
-David Morton de Lachapelle	Spectral coarse graining
-Laurence Muller		Fixes for compilation on MS Visual Studio
-Emmanuel Navarro	infomap community detection
-	 		Various fixes and patches
-Tamas Nepusz		Most of igraph
-Esmond Ng 		Sparse matrix column ordering
-Kevin O'Neill		Maximal independent vertex sets
-Takuji Nishimura	GSL random number generators (not used in R)
-Jim Orlin		GLPK
-Patric Ostergard	GLPK
-Elliot Paquette		psumtree data type
-Pascal Pons		walktrap community detection
-Joerg Reichardt		spinglass community detection
-Marc Rieffel		GSL random number generators (not used in R)
-B.D. Ripley		igraph.options based on the sm package
-     			BFGS optimizer
-			Various bug fixes
-Martin Rosvall		infomap community detection
-Andreas Ruckstuhl	R arrow drawing function, from IDPmisc package
-Heinrich Schuchardt	GLPK
-J.K. Reid 		GLPK
-C. Sansone		VF2 graph isomorphism algorithm
-Michael Schmuhl		The graphopt layout generator
-Danny Sorensen		ARPACK
-James Theiler		GSL random number generators (not used in R)
-Samuel Thiriot		Interconnected islands graph generator
-Vincent A. Traag	spinglass community detection
-Magnus Torfason		R operators that work by name
-Minh Van Nguyen		Microscopic update rules
-     	 		Various test cases
-     	 		Many documentation and other fixes
-M. Vento		VF2 graph isomorphism algorithm
-Fabien Viger		gengraph graph generator
-Phuong Vu		ARPACK
-P.J. Weinberger		f2c
-Garrett A. Wollman	qsort
-B.N. Wylie 		DrL layout generator
-Chao Yang		ARPACK
-
-Institutional copyright owners:
--------------------------------
-
-Free Software Foundation, Inc	Code generated by bison
-Sandia Corporation	  	DrL layout generator
-The R Development Core Team 	Some random number generators (not used in R)
-      		       		R: as.dendrogram from stats package
-The Regents of the University of California	qsort
-Xerox PARC		      	Sparse matrix column ordering
-
-Other contributors
-------------------
-
-Neal Becker		Patches to compile with gcc 4.4
-Richard Bowman		R patches
-Alex Chen		Patch to compile on Intel compilers
-Daniel Cordeiro 	Patches
-Tom Gregorovic		Bug fixes
-Mayank Lahiri		Forest fire game fix
-John Lapeyre 		Patches
-Christopher Lu		Various fixes and patches
-André Panisson		R patches
-Bob Pap 		Bug fixes
-Keith Ponting		R package bug fixes
-Martin J Reed		Bug fixes
-Elena Tea Russo		Bug fixes
-KennyTM			Bug fixes
-Jordi Torrents		Patches
-Matthew Walker		Various patches
-Kai Willadsen		Arrow size support in Python
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/LICENSE igraph-0.6.5/interfaces/R/igraph/LICENSE
--- igraph-0.6.5~quantal1/interfaces/R/igraph/LICENSE	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/LICENSE	1970-01-01 00:00:00.000000000 +0000
@@ -1,340 +0,0 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-                       51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    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 2 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, write to the Free Software
-    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/NEWS igraph-0.6.5/interfaces/R/igraph/NEWS
--- igraph-0.6.5~quantal1/interfaces/R/igraph/NEWS	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/NEWS	1970-01-01 00:00:00.000000000 +0000
@@ -1,773 +0,0 @@
-============
-igraph 0.6.5
-============
-
-Released February 24, 2013
-
-This is a minor release, to fix some very annoying bugs in 0.6.4:
-
-- igraph should now work well with older R versions.
-- Eliminate gap between vertex and edge when plotting an edge without an arrow.
-  Fixes #1118448.
-- Fixed an out-of-bounds array indexing error in the DrL layout, that
-  potentially caused crashes.
-- Fixed a crash in weighted betweenness calculation.
-- Plotting: fixed a bug that caused misplaced arrows at rectangle 
-  vertex shapes. 
-
-============
-igraph 0.6.4
-============
-
-Released February 2, 2013
-
-The version number is not a mistake, we jump to 0.6.4 from 0.6, 
-for technical reasons. This version was actually never really
-released, but some R packages of this version were uplodaded to 
-CRAN, so we include this version in this NEW file.
-
-==========================
-New features and bug fixes
-==========================
-
-- Added a vertex shape API for defining new vertex shapes, and also 
-  a couple of new vertex shapes.
-- Added the get.data.frame() function, opposite of graph.data.frame().
-- Added bipartite support to the Pajek reader and writer, closes bug
-  #1042298.
-- degree.sequence.game() has a new method now: "simple.no.multiple".
-- Added the is.degree.sequence() and is.graphical.degree.sequence()
-  functions.
-- rewire() has a new method: "loops", that can create loop edges.
-- Walktrap community detection now handles isolates.
-- layout.mds() returns a layout matrix now.
-- layout.mds() uses LAPACK instead of ARPACK.
-- Handle the '~' character in write.graph and read.graph. Bug
-  #1066986.
-- Added k.regular.game().
-- Use vertex names to plot if no labels are specified in the function
-  call or as vetex attributes. Fixes issue #1085431.
-- power.law.fit() can now use a C implementation.
-
-- Fixed a bug in barabasi.game() when out.seq was an empty vector.
-- Fixed a bug that made functions with a progress bar fail if called 
-  from another package.
-- Fixed a bug when creating graphs from a weighted integer adjacency 
-  matrix via graph.adjacency(). Bug #1019624.
-- Fixed overflow issues in centralization calculations.
-- Fixed a minimal.st.separators() bug, some vertex sets were incorrectly
-  reported as separators. Bug #1033045.
-- Fixed a bug that mishandled vertex colors in VF2 isomorphism
-  functions. Bug #1032819.
-- Pajek exporter now always quotes strings, thanks to Elena Tea Russo.
-- Fixed a bug with handling small edge weights in shortest paths 
-  calculation in shortest.paths() (Dijkstra's algorithm.) Thanks to 
-  Martin J Reed.
-- Weighted transitivity uses V(graph) as 'vids' if it is NULL.
-- Fixed a bug when 'pie' vertices were drawn together with other 
-  vertex shapes.
-- Speed up printing graphs.
-- Speed up attribute queries and other basic operations, by avoiding 
-  copying of the graph. Bug #1043616.
-- Fixed a bug in the NCV setting for ARPACK functions. It cannot be
-  bigger than the matrix size.
-- layout.merge()'s DLA mode has better defaults now.
-- Fixed a bug in layout.mds() that resulted vertices on top of each
-  other.
-- Fixed a bug in layout.spring(), it was not working properly.
-- Fixed layout.svd(), which was completely defunct.
-- Fixed a bug in layout.graphopt() that caused warnings and on 
-  some platforms crashes.
-- Fixed community.to.membership(). Bug #1022850.
-- Fixed a graph.incidence() crash if it was called with a non-matrix
-  argument.
-- Fixed a get.shortest.paths bug, when output was set to "both".
-- Motif finding functions return NA for isomorphism classes that are
-  not motifs (i.e. not connected). Fixes bug #1050859. 
-- Fixed get.adjacency() when attr is given, and the attribute has some
-  complex type. Bug #1025799. 
-- Fixed attribute name in graph.adjacency() for dense matrices. Bug
-  #1066952. 
-- Fixed erratic behavior of alpha.centrality().
-- Fixed igraph indexing, when attr is given. Bug #1073705.
-- Fixed a bug when calculating the largest cliques of a directed
-  graph. Bug #1073800.
-- Fixed a bug in the maximal clique search, closes #1074402.
-- Warn for negative weights when calculating PageRank.
-- Fixed dense, unweighted graph.adjacency when diag=FALSE. Closes
-  issue #1077425. 
-- Fixed a bug in eccentricity() and radius(), the results were often
-  simply wrong.
-- Fixed a bug in get.all.shortest.paths() when some edges had zero weight.
-- graph.data.frame() is more careful when vertex names are numbers, to
-  avoid their scientific notation. Fixes issue #1082221. 
-- Better check for NAs in vertex names. Fixes issue #1087215
-- Fixed a potential crash in the DrL layout generator.
-- Fixed a bug in the Reingold-Tilford layout when the graph is
-  directed and mode != ALL.
-- Fixed a bug in get.shortest.paths() when output="epath".
-- Fixed a bug in layout.sugiyama() when the graph had no edges.
-- Fixed a bug in label.propagation.community() when initial labels
-  contained -1 entries. Issue #1105460.
-
-==========
-igraph 0.6
-==========
-
-Released June 11, 2012
-
-See also the release notes at 
-http://igraph.sf.net/relnotes-0.6.html
-
-=====================
-R: Major new features
-=====================
-
-- Vertices and edges are numbered from 1 instead of 0. 
-  Note that this makes most of the old R igraph code incompatible
-  with igraph 0.6. If you want to use your old code, please use 
-  the igraph0 package. See more at http://igraph.sf.net/relnotes-0.6.html.
-- The '[' and '[[' operators can now be used on igraph graphs, 
-  for '[' the graph behaves as an adjacency matrix, for '[[' is 
-  is treated as an adjacency list. It is also much simpler to
-  manipulate the graph structure, i.e. add/remove edges and vertices, 
-  with some new operators. See more at ?graph.structure.
-- In all functions that take a vector or list of vertices or edges, 
-  vertex/edge names can be given instead of the numeric ids.
-- New package 'igraphdata', contains a number of data sets that can
-  be used directly in igraph.
-- Igraph now supports loading graphs from the Nexus online data
-  repository, see nexus.get(), nexus.info(), nexus.list() and 
-  nexus.search().
-- All the community structure finding algorithm return a 'communities'
-  object now, which has a bunch of useful operations, see 
-  ?communities for details.
-- Vertex and edge attributes are handled much better now. They 
-  are kept whenever possible, and can be combined via a flexible API.
-  See ?attribute.combination.
-- R now prints igraph graphs to the screen in a more structured and 
-  informative way. The output of summary() was also updated
-  accordingly.
-
-=====================
-R: Other new features
-=====================
-
-- It is possible to mark vertex groups on plots, via
-  shading. Communities and cohesive blocks are plotted using this by
-  default.
-- Some igraph demos are now available, see a list via 
-  'demo(package="igraph")'.
-- igraph now tries to select the optimal layout algorithm, when
-  plotting a graph.
-- Added a simple console, using Tcl/Tk. It contains a text area
-  for status messages and also a status bar. See igraph.console().
-- Reimplemented igraph options support, see igraph.options() and 
-  getIgraphOpt().
-- Igraph functions can now print status messages.
-
-===========================
-R: New or updated functions
-===========================
-
-Community detection
--------------------
-- The multi-level modularity optimization community structure detection 
-  algorithm by Blondel et al. was added, see multilevel.community().
-- Distance between two community structures: compare.communities().
-- Community structure via exact modularity optimization,
-  optimal.community().
-- Hierarchical random graphs and community finding, porting the code
-  from Aaron Clauset. See hrg.game(), hrg.fit(), etc.
-- Added the InfoMAP community finding method, thanks to Emmanuel
-  Navarro for the code. See infomap.community().
-
-Shortest paths
---------------
-- Eccentricity (eccentricity()), and radius (radius()) calculations.
-- Shortest path calculations with get.shortest.paths() can now 
-  return the edges along the shortest paths.
-- get.all.shortest.paths() now supports edge weights.
-
-Centrality
-----------
-- Centralization scores for degree, closeness, betweenness and 
-  eigenvector centrality. See centralization.scores().
-- Personalized Page-Rank scores, see page.rank().
-- Subgraph centrality, subgraph.centrality().
-- Authority (authority.score()) and hub (hub.score()) scores support 
-  edge weights now.
-- Support edge weights in betweenness and closeness calculations.
-- bonpow(), Bonacich's power centrality and alpha.centrality(), 
-  Alpha centrality calculations now use sparse matrices by default.
-- Eigenvector centrality calculation, evcent() now works for 
-  directed graphs.
-- Betweenness calculation can now use arbitrarily large integers,
-  this is required for some lattice-like graphs to avoid overflow.
-
-Input/output and file formats
------------------------------
-- Support the DL file format in graph.read(). See 
-  http://www.analytictech.com/networks/dataentry.htm.
-- Support writing the LEDA file format in write.graph().
-
-Plotting and layouts
---------------------
-- Star layout: layout.star().
-- Layout based on multidimensional scaling, layout.mds().
-- New layouts layout.grid() and layout.grid.3d().
-- Sugiyama layout algorithm for layered directed acyclic graphs, 
-  layout.sugiyama().
-
-Graph generators
-----------------
-- New graph generators: static.fitness.game(), static.power.law.game().
-- barabasi.game() was rewritten and it supports three algorithms now,
-  the default algorithm does not generate multiple or loop edges.
-  The graph generation process can now start from a supplied graph.
-- The Watts-Strogatz graph generator, igraph_watts_strogatz() can 
-  now create graphs without loop edges.
-
-Others
-------
-- Added the Spectral Coarse Graining algorithm, see scg(). 
-- The cohesive.blocks() function was rewritten in C, it is much faster
-  now. It has a nicer API, too. See demo("cohesive").
-- Added generic breadth-first and depth-first search implementations
-  with many callbacks, graph.bfs() and graph_dfs().
-- Support vertex and edge coloring in the VF2 (sub)graph isomorphism 
-  functions (graph.isomorphic.vf2(), graph.count.isomorphisms.vf2(), 
-  graph.get.isomorphisms.vf2(), graph.subisomorphic.vf2(), 
-  graph.count.subisomorphisms.vf2(), graph.get.subisomorphisms.vf2()).
-- Assortativity coefficient, assortativity(), assortativity.nominal()
-  and assortativity.degree().
-- Vertex operators that work by vertex names: 
-  graph.intersection.by.name(), graph.union.by.name(), 
-  graph.difference.by.name(). Thanks to Magnus Torfason for 
-  contributing his code!
-- Function to calculate a non-induced subraph: subgraph.edges().
-- More comprehensive maximum flow and minimum cut calculation, 
-  see functions graph.maxflow(), graph.mincut(), stCuts(), stMincuts().
-- Check whether a directed graph is a DAG, is.dag().
-- has.multiple() to decide whether a graph has multiple edges.
-- Added a function to calculate a diversity score for the vertices,
-  graph.diversity().
-- Graph Laplacian calculation (graph.laplacian()) supports edge 
-  weights now.
-- Biconnected component calculation, biconnected.components() 
-  now returns the components themselves.
-- bipartite.projection() calculates multiplicity of edges.
-- Maximum cardinality search: maximum.cardinality.search() and 
-  chordality test: is.chordal()
-- Convex hull computation, convex.hull().
-- Contract vertices, contract.vertices().
-
-============
-igraph 0.5.3
-============
-
-Released November 22, 2009
-
-Bugs corrected in the R interface
----------------------------------
-- Some small changes to make 'R CMD check' clean
-- Fixed a bug in graph.incidence, the 'directed' and 'mode' arguments 
-  were not handled correctly
-- Betweenness and edge betweenness functions work for graphs with
-  many shortest paths now (up to the limit of long long int)
-- When compiling the package, the configure script fails if there is
-  no C compiler available
-- igraph.from.graphNEL creates the right number of loop edges now
-- Fixed a bug in bipartite.projection() that caused occasional crashes 
-  on some systems
-
-============
-igraph 0.5.2
-============
-
-Released April 10, 2009
-
-See also the release notes at
-http://igraph.sf.net/relnotes-0.5.2.html
-
-New in the R interface
-----------------------
-
-- Added progress bar support to beweenness() and
-  betweenness.estimate(), layout.drl()
-- Speeded up betweenness estimation
-- Speeded up are.connected()
-- Johnson's shortest paths algorithm added
-- shortest.paths() has now an 'algorithm' argument to choose from the
-  various implementations manually
-- Always quote symbolic vertex names when printing graphs or edges
-- Average nearest neighbor degree calculation, graph.knn()
-- Weighted degree (also called strength) calculation, graph.strength()
-- Some new functions to support bipartite graphs: graph.bipartite(),
-  is.bipartite(), get.indicence(), graph.incidence(),
-  bipartite.projection(), bipartite.projection.size()
-- Support for plotting curved edges with plot.igraph() and tkplot()
-- Added support for weighted graphs in alpha.centrality()
-- Added the label propagation community detection algorithm by
-  Raghavan et al., label.propagation.community()
-- cohesive.blocks() now has a 'cutsetHeuristic' argument to choose
-  between two cutset algorithms
-- Added a function to "unfold" a tree, unfold.tree()
-- New tkplot() arguments to change the drawing area
-- Added a minimal GUI, invoke it with tkigraph()
-- The DrL layout generator, layout.drl() has a three dimensional mode
-  now.
-
-Bugs corrected in the R interface
----------------------------------
-
-- Fixed a bug in VF2 graph isomorphism functions
-- Fixed a bug when a sparse adjacency matrix was requested in
-  get.adjacency() and the graph was named
-- VL graph generator in degree.sequence.game() checks now that
-  the sum of the degrees is even
-- Many fixes for supporting various compilers, e.g. GCC 4.4 and Sun's
-  C compiler
-- Fixed memory leaks in graph.automorphisms(), Bellman-Ford
-  shortest.paths(), independent.vertex.sets()
-- Fix a bug when a graph was imported from LGL and exported to NCOL
-  format (#289596)
-- cohesive.blocks() creates its temporary file in the session
-  temporary directory
-- write.graph() and read.graph() now give error messages when unknown
-  arguments are given
-- The GraphML reader checks the name of the attributes to avoid adding
-  a duplicate 'id' attribute
-- It is possible to change the 'ncv' ARPACK parameter for
-  leading.eigenvector.community()
-- Fixed a bug in path.length.hist(), 'unconnected' was wrong
-  for unconnected and undirected graphs
-- Better handling of attribute assingment via iterators, this is now
-  also clarified in the manual
-- Better error messages for unknown vertex shapes
-- Make R package unload cleanly if unloadNamespace() is used
-- Fixed a bug in plotting square shaped vertices (#325244)
-- Fixed a bug in graph.adjacency() when the matrix is a sparse matrix
-  of class "dgTMatrix"
-
-============
-igraph 0.5.1
-============
-
-Released July 14, 2008
-
-See also the release notes at 
-http://igraph.sf.net/relnotes-0.5.1.html
-
-New in the R interface
-----------------------
-
-- A new layout generator called DrL.
-- Uniform sampling of random connected undirected graphs with a 
-  given degree sequence.
-- Edge labels are plotted at 1/3 of the edge, this is better if 
-  the graph has mutual edges.
-- Initial and experimental vertex shape support in 'plot'.
-- New function, 'graph.adjlist' creates igraph graphs from
-  adjacency lists.
-- Conversion to/from graphNEL graphs, from the 'graph' R package.
-- Fastgreedy community detection can utilize edge weights now, this 
-  was missing from the R interface.
-- The 'arrow.width' graphical parameter was added.
-- graph.data.frame has a new argument 'vertices'.
-- graph.adjacency and get.adjacency support sparse matrices, 
-  the 'Matrix' package is required to use this functionality.
-- graph.adjacency adds column/row names as 'name' attribute.
-- Weighted shortest paths using Dijkstra's or the Belmann-Ford 
-  algorithm.
-- Shortest path functions return 'Inf' for unreachable vertices.
-- New function 'is.mutual' to find mutual edges in a directed graph.
-- Added inverse log-weighted similarity measure (a.k.a. Adamic/Adar
-  similarity).
-- preference.game and asymmetric.preference.game were 
-  rewritten, they are O(|V|+|E|) now, instead of O(|V|^2).
-- Edge weight support in function 'get.shortest.paths', it uses 
-  Dijkstra's algorithm.
-
-Bugs corrected in the R interface
----------------------------------
-  
-- A bug was corrected in write.pajek.bgraph.
-- Several bugs were corrected in graph.adjacency.
-- Pajek reader bug corrected, used to segfault if '*Vertices' 
-  was missing.
-- Directedness is handled correctly when writing GML files.
-  (But note that 'correct' conflicts the standard here.)
-- Corrected a bug when calculating weighted, directed PageRank on an 
-  undirected graph. (Which does not make sense anyway.)
-- Several bugs were fixed in the Reingold-Tilford layout to avoid 
-  edge crossings.
-- A bug was fixed in the GraphML reader, when the value of a graph
-  attribute was not specified.
-- Fixed a bug in the graph isomorphism routine for small (3-4 vertices)
-  graphs.
-- Corrected the random sampling implementation (igraph_random_sample),
-  now it always generates unique numbers. This affects the 
-  Gnm Erdos-Renyi generator, it always generates simple graphs now.
-- The basic igraph constructor (igraph_empty_attrs, all functions 
-  are expected to call this internally) now checks whether the number
-  of vertices is finite.
-- The LGL, NCOL and Pajek graph readers handle errors properly now.
-- The non-symmetric ARPACK solver returns results in a consistent form
-  now.
-- The fast greedy community detection routine now checks that the graph
-  is simple.
-- The LGL and NCOL parsers were corrected to work with all 
-  kinds of end-of-line encodings.
-- Hub & authority score calculations initialize ARPACK parameters now.
-- Fixed a bug in the Walktrap community detection routine, when applied 
-  to unconnected graphs.
-- Several small memory leaks were removed, and a big one from the Spinglass
-  community structure detection function
-
-=========
-igraph 0.5
-=========
-
-Released February 14, 2008
-
-See also the release notes at http://igraph.sf.net/relnotes-0.5.html
-
-New in the R interface
-----------------------
-
-- The 'rescale', 'asp' and 'frame' graphical parameters were added
-- Create graphs from a formula notation (graph.formula)
-- Handle graph attributes properly
-- Calculate the actual minimum cut for undirected graphs
-- Adjacency lists, get.adjlist and get.adjedgelist added
-- Eigenvector centrality computation is much faster now
-- Proper R warnings, instead of writing the warning to the terminal
-- R checks graphical parameters now, the unknown ones are not just
-  ignored, but an error message is given  
-- plot.igraph has an 'add' argument now to compose plots with multiple
-  graphs
-- plot.igraph supports the 'main' and 'sub' arguments
-- layout.norm is public now, it can normalize a layout
-- It is possible to supply startup positions to layout generators
-- Always free memory when CTRL+C/ESC is pressed, in all operating
-  systems
-- plot.igraph can plot square vertices now, see the 'shape' parameter
-- graph.adjacency rewritten when creating weighted graphs
-- We use match.arg whenever possible. This means that character scalar 
-  options can be abbreviated and they are always case insensitive
-
-- VF2 graph isomorphism routines can check subgraph isomorphism now,
-  and they are able to return matching(s)
-- The BLISS graph isomorphism algorithm is included in igraph now. See
-  canonical.permutation, graph.isomorphic.bliss
-- We use ARPACK for eigenvalue/eigenvector calculation. This means that the
-  following functions were rewritten: page.rank,
-  leading.eigenvector.community.*, evcent. New functions based on
-  ARPACK: hub.score, authority.score, arpack.
-- Edge weights for Fruchterman-Reingold layout (layout.fruchterman.reingold).
-- Line graph calculation (line.graph)
-- Kautz and de Bruijn graph generators (graph.kautz, graph.de.bruijn)
-- Support for writing graphs in DOT format
-- Jaccard and Dice similarity coefficients added (similarity.jaccard,
-  similarity.dice)
-- Counting the multiplicity of edges (count.multiple)
-- The graphopt layout algorithm was added, layout.graphopt
-- Generation of "famous" graphs (graph.famous).
-- Create graphs from LCF notation (graph.cf).
-- Dyad census and triad cencus functions (dyad.census, triad.census)
-- Cheking for simple graphs (is.simple)
-- Create full citation networks (graph.full.citation)
-- Create a histogram of path lengths (path.length.hist)
-- Forest fire model added (forest.fire.game)
-- DIMACS reader can handle different file types now
-- Biconnected components and articulation points (biconnected.components,
-  articulation.points)
-- Kleinberg's hub and authority scores (hub.score, authority.score)
-- as.undirected handles attributes now
-- Geometric random graph generator (grg.game) can return the
-  coordinates of the vertices
-- Function added to convert leading eigenvector community structure result to
-  a membership vector (community.le.to.membership)
-- Weighted fast greedy community detection
-- Weighted page rank calculation
-- Functions for estimating closeness, betweenness, edge betweenness by 
-  introducing a cutoff for path lengths (closeness.estimate,
-  betweenness.estimate, edge.betweenness.estimate)
-- Weighted modularity calculation
-- Function for permuting vertices (permute.vertices)
-- Betweenness and closeness calculations are speeded up
-- read.graph can handle all possible line terminators now (\r, \n, \r\n, \n\r)
-- Error handling was rewritten for walktrap community detection,
-  the calculation can be interrupted now
-- The maxflow/mincut functions allow to supply NULL pointer for edge
-  capacities, implying unit capacities for all edges
-
-Bugs corrected in the R interface
----------------------------------
-
-- Fixed a bug in cohesive.blocks, cohesive blocks were sometimes not
-  calculated correctly
-
-=========
-igraph 0.4.5
-=========
-
-Released January 1, 2008
-
-New:
-- Cohesive block finding in the R interface, thanks to Peter McMahan
-  for contributing his code. See James Moody and Douglas R. White,
-  2003, in Structural Cohesion and Embeddedness: A Hierarchical
-  Conception of Social Groups American Sociological Review 68(1):1-25 
-- Biconnected components and articulation points.
-- R interface: better printing of attributes.
-- R interface: graph attributes can be used via '$'.
-
-Bug fixed:
-- Erdos-Renyi random graph generators rewritten.
-
-=========
-igraph 0.4.4
-=========
-
-Released October 3, 2007
-
-This release should work seemlessly with the new R 2.6.0 version.
-Some other bugs were also fixed:
-- A bug was fixed in the Erdos-Renyi graph generator, which sometimes
-  added an extra vertex.
-
-=========
-igraph 0.4.3
-=========
-
-Released August 13, 2007
-
-The next one in the sequence of bugfix releases. Thanks to many people
-sending bug reports. Here are the changes:
-- Some memory leaks removed when using attributes from R or Python.
-- GraphML parser: entities and character data in multiple chunks are
-  now handled correctly. 
-- A bug corrected in edge betweenness community structure detection,
-  it failed if called many times from the same program/session.
-- Edge betweeness community structure: handle unconnected graphs properly.
-- Fixed bug related to fast greedy community detection in unconnected graphs.
-- Use a different kind of parser (Push) for reading GraphML
-  files. This is almost invisible for users but fixed a
-  nondeterministic bug when reading in GraphML files.
-- R interface: plot now handles properly if called with a vector as
-  the edge.width argument for directed graphs.
-- R interface: bug (typo) corrected for walktrap.community and
-  weighted graphs. 
-
-=========
-igraph 0.4.2
-=========
-
-Released June 7, 2007
-
-This is another bugfix release, as there was a serious bug in the 
-R package of the previous version: it could not read and write graphs
-to files in any format under MS Windows.
-
-Some other bits added: 
-- circular Reingold-Tilford layout generator for trees
-- corrected a bug, Pajek files are written properly under MS Windows now.
-- arrow.size graphical edge parameter added in the R interface.
-
-=========
-igraph 0.4.1
-=========
-
-Released May 23, 2007
-
-This is a minor release, it corrects a number of bugs, mostly in the 
-R package.
-
-=========
-igraph 0.4
-=========
-
-Released May 21, 2007
-
-The major new additions in this release is a bunch of community
-detection algorithms and support for the GML file format. Here 
-is the complete list of changes:
-
-New in the R interface
-----------------------
-
-- as the internal representation changed, graphs stored with 'save' 
-  with an older igraph version cannot be read back with the new
-  version reliably.
-- neighbors returns ordered lists
-- is.loop and is.multiple were added
-
-- topological sorting
-- VF2 isomorphism algorithm
-- support for reading graphs from the Graph Database for isomorphism
-- graph.mincut can calculate the actual minimum cut
-- girth calculation added, thanks to Keith Briggs
-- support for reading and writing GML files
-
-- Walktrap community detection algorithm added, thanks to Matthieu Latapy 
-  and Pascal Pons
-- edge betweenness based community detection algorithm added
-- fast greedy algorithm for community detection by Clauset et al. added
-  thanks to Aaron Clauset for sharing his code  
-- leading eigenvector community detection algorithm by Mark Newman added
-- functions for creating dendrograms from the output of the 
-  community detection algorithms added
-- community.membership supporting function added, creates 
-  a membership vector from a community structure merge tree
-- modularity calculation added
-
-- graphics parameter handling is completely rewritten, uniform handling 
-  of colors and fonts, make sure you read ?igraph.plotting
-- new plotting parameter for edges: arrow.mode
-- a bug corrected when playing a nonlinear barabasi.game
-- better looking plotting in 3d using rglplot: edges are 3d too
-- rglplot layout is allowed to be two dimensional now
-- rglplot suspends updates while drawing, this makes it faster
-- loop edges are correctly plotted by all three plotting functions
-
-- better printing of attributes when printing graphs
-- summary of a graph prints attribute names
-- is.igraph rewritten to make it possible to inherit from the 'igraph' class
-- somewhat better looking progress meter for functions which support it
-
-Others
-------
-
-- many functions benefit from the new internal representation and are 
-  faster now: transitivity, reciprocity, graph operator functions like 
-  intersection and union, etc.
-
-Bugs corrected
---------------
-
-- corrected a bug when reading Pajek files: directed graphs were read
-  as undirected 
-
-=========
-igraph 0.3.2
-=========
-
-Released Dec 19, 2006
-
-This is a new major release, it contains many new things:
-
-Changes in the R interface
---------------------------
-
-- bonpow function ported from SNA to calculate Bonacich power centrality
-- get.adjacency supports attributes now, this means that it sets the
-  colnames  and rownames attributes and can return attribute values in
-  the matrix instead of 0/1
-- grg.game, geometric random graphs
-- graph.density, graph density calculation
-- edge and vertex attributes can be added easily now when added new
-  edges with add.edges or new vertices with add.vertices
-- graph.data.frame creates graph from data frames, this can be used to 
-  create graphs with edge attributes easily
-- plot.igraph and tkplot can plot self-loop edges now
-- graph.edgelist to create a graph from an edge list, can also handle 
-  edge lists with symbolic names
-- get.edgelist has now a 'names' argument and can return symbolic
-  vertex names instead of vertex ids, by default id uses the 'name'
-  vertex attribute is returned 
-- printing graphs on screen also prints symbolic symbolic names
-  (the 'name' attribute if present)
-- maximum flow and minimum cut functions: graph.maxflow, graph.mincut
-- vertex and edge connectivity: edge.connectivity, vertex.connectivity
-- edge and vertex disjoint paths: edge.disjoint.paths, 
-  vertex.disjoint.paths
-- White's cohesion and adhesion measure: graph.adhesion, graph.cohesion
-- dimacs file format added
-- as.directed handles attributes now
-- constraint corrected, it handles weighted graphs as well now
-- weighted attribute to graph.adjacency
-- spinglass-based community structure detection, the Joerg Reichardt --
-  Stefan Bornholdt algorithm added: spinglass.community
-- graph.extended.chordal.ring, extended chordal ring generation
-- no.clusters calculates the number of clusters without calculating
-  the clusters themselves
-- minimum spanning tree functions updated to keep attributes
-- transitivity can calculate local transitivity as well
-- neighborhood related functions added: neighborhood,
-  neighborhood.size, graph.neighborhood
-- new graph generators based on vertex types: preference.game and
-  asymmetric.preference.game
-
-Bugs corrected
---------------
-
-- attribute handling bug when deleting edges corrected
-- GraphML escaping and NaN handling corrected
-- bug corrected to make it possible compile the R package without the 
-  libxml2 library
-- a bug in Erdos-Renyi graph generation corrected: it had problems 
-  with generating large directed graphs
-- bug in constraint calculation corrected, it works well now
-- fixed memory leaks in the GraphML reader
-- error handling bug corrected in the GraphML reader
-- bug corrected in R version of graph.laplacian when normalized
-  Laplacian is requested
-- memory leak corrected in get.all.shortest.paths in the R package
-
-=========
-igraph 0.2.1
-=========
-
-Released Aug 23, 2006
-
-This is a bug-fix release. Bugs fixed:
-- reciprocity corrected to avoid segfaults
-- some docs updates
-- various R package updates to make it conform to the CRAN rules
-
-=========
-igraph 0.2
-=========
-
-Released Aug 18, 2006
-
-Release time at last! There are many new things in igraph 0.2, the
-most important ones:
-- reading writing Pajek and GraphML formats with attributes
-  (not all Pajek and GraphML files are supported, see documentation
-  for details)
-- the RANDEDU fast motif search algorithm is implemented
-- many new graph generators, both games and regular graphs
-- many new structural properties: transitivity, reciprocity, etc.
-- graph operators: union, intersection, difference, structural holes, etc.
-- conversion between directed and undirected graphs
-- new layout algorithms for trees and large graphs, 3D layouts
-and many more.
-
-New things specifically in the R package:
-- support for CTRL+C
-- new functions: Graph Laplacian, Burt's constraint, etc.
-- vertex/edge sequences totally rewritten, smart indexing (see manual)
-- new R manual and tutorial: `Network Analysis with igraph', still 
-  under development but useful
-- very basic 3D plotting using OpenGL
-
-Although this release was somewhat tested on Linux, MS Windows, Mac
-OSX, Solaris 8 and FreeBSD, no heavy testing was done, so it might
-contain bugs, and we kindly ask you to send bug reports to make igraph
-better.
-
-=========
-igraph 0.1
-=========
-
-Released Jan 30, 2006
-
-After about a year of development this is the first "official" release 
-of the igraph library. This release should be considered as beta 
-software, but it should be useful in general. Please send your 
-questions and comments.
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/attributes.R igraph-0.6.5/interfaces/R/igraph/R/attributes.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/attributes.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/attributes.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,242 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-##
-## The brand new attribute interface:
-##
-## g(graph)$name                   # get a graph attribute
-## g(graph)$name <- "Ring"         # set a graph attribute
-## 
-## v(graph)$color <- "red"         # set vertex attribute
-## v(graph)$color[1:5] <- "blue"   
-## v(graph)$color[c(5,6,7)]        # get vertex attribute
-##
-## e(graph)$weight <- 1            # set edge attribute
-## e(graph)$weight[1:10]           # get edge attribute
-##
-
-get.graph.attribute <- function(graph, name) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  .Call("R_igraph_mybracket2", graph, 9L, 2L,
-        PACKAGE="igraph")[[as.character(name)]]
-}
-
-set.graph.attribute <- function(graph, name, value) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  .Call("R_igraph_mybracket3_set", graph, 9L, 2L, name, value,
-        PACKAGE="igraph")
-}
-
-get.vertex.attribute <- function(graph, name, index=V(graph)) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  index <- as.igraph.vs(graph, index)  
-  myattr <- .Call("R_igraph_mybracket2", graph, 9L, 3L,
-                  PACKAGE="igraph")[[as.character(name)]]
-  if (is.list(myattr) && length(index)==1) {
-    myattr[[index]]
-  } else {
-    myattr[index]
-  }
-}
-
-set.vertex.attribute <- function(graph, name, index=V(graph), value) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (!missing(index)) { index <- as.igraph.vs(graph, index) }
-  name <- as.character(name)
-  vc <- vcount(graph)
-
-  vattrs <- .Call("R_igraph_mybracket2", graph, 9L, 3L, PACKAGE="igraph")
-  vattrs[[name]][index] <- value
-  length(vattrs[[name]]) <- vc
-  
-  .Call("R_igraph_mybracket2_set", graph, 9L, 3L, vattrs, PACKAGE="igraph")
-}
-
-get.edge.attribute <- function(graph, name, index=E(graph)) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  name <- as.character(name)
-  index <- as.igraph.es(graph, index)
-  myattr <- .Call("R_igraph_mybracket2", graph, 9L, 4L,
-                  PACKAGE="igraph")[[name]]
-  if (is.list(myattr) && length(index)==1) {
-    myattr[[index]]
-  } else {
-    myattr[index]
-  }
-}
-
-set.edge.attribute <- function(graph, name, index=E(graph), value) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  name <- as.character(name)
-  index <- as.igraph.es(graph, index)
-  ec <- ecount(graph)
-
-  eattrs <- .Call("R_igraph_mybracket2", graph, 9L, 4L, PACKAGE="igraph")
-  eattrs[[name]][index] <- value
-  length(eattrs[[name]]) <- ec
-
-  .Call("R_igraph_mybracket2_set", graph, 9L, 4L, eattrs, PACKAGE="igraph")
-}
-
-list.graph.attributes <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  res <- names(.Call("R_igraph_mybracket2", graph, 9L, 2L, PACKAGE="igraph"))
-  if (is.null(res)) { res <- character() }
-  res
-}
-
-list.vertex.attributes <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  res <- names(.Call("R_igraph_mybracket2", graph, 9L, 3L, PACKAGE="igraph"))
-                     
-  if (is.null(res)) { res <- character() }
-  res
-}
-
-list.edge.attributes <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  res <- names(.Call("R_igraph_mybracket2", graph, 9L, 4L, PACKAGE="igraph"))
-  if (is.null(res)) { res <- character() }
-  res
-}
-
-remove.graph.attribute <- function(graph, name) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  name <- as.character(name)
-  if (!name %in% list.graph.attributes(graph)) {
-    stop("No such graph attribute: ", name)
-  }
-
-  gattr <- .Call("R_igraph_mybracket2", graph, 9L, 2L, PACKAGE="igraph")
-  gattr[[name]] <- NULL
-  
-  .Call("R_igraph_mybracket2_set", graph, 9L, 2L, gattr, PACKAGE="igraph")
-}
-
-remove.vertex.attribute <- function(graph, name) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  name <- as.character(name)
-  if (!name %in% list.vertex.attributes(graph)) {
-    stop("No such vertex attribute: ", name)
-  }
-
-  vattr <- .Call("R_igraph_mybracket2", graph, 9L, 3L, PACKAGE="igraph")
-  vattr[[name]] <- NULL
-  
-  .Call("R_igraph_mybracket2_set", graph, 9L, 3L, vattr, PACKAGE="igraph")
-}
-
-remove.edge.attribute <- function(graph, name) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  name <- as.character(name)
-  if (!name %in% list.edge.attributes(graph)) {
-    stop("No such edge attribute: ", name)
-  }
-
-  eattr <- .Call("R_igraph_mybracket2", graph, 9L, 4L, PACKAGE="igraph")
-  eattr[[name]] <- NULL
-  
-  .Call("R_igraph_mybracket2_set", graph, 9L, 4L, eattr, PACKAGE="igraph")
-}
-
-#############
-
-is.named <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  "name" %in% list.vertex.attributes(graph)
-}
-
-is.weighted <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  "weight" %in% list.edge.attributes(graph)
-}
-
-is.bipartite <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  "type" %in% list.vertex.attributes(graph)
-}
-
-#############
-
-igraph.i.attribute.combination <- function(comb) {
-  if (is.function(comb)) {
-    comb <- list(comb)
-  }
-  comb <- as.list(comb)
-  if (any(!sapply(comb, function(x)
-                  is.function(x) || (is.character(x) && length(x)==1)))) {
-    stop("Attribute combination element must be a function or character scalar")
-  }
-  if (is.null(names(comb))) {
-    names(comb) <- rep("", length(comb))
-  }
-  if (any(duplicated(names(comb)))) {
-    warning("Some attributes are duplicated")
-  }
-  comb <- lapply(comb, function(x) {
-    if (!is.character(x)) {
-      x
-    } else {
-      known <- data.frame(n=c("ignore", "sum", "prod", "min", "max", "random",
-                            "first", "last", "mean", "median", "concat"),
-                          i=c(0,3,4,5,6,7,8,9,10,11,12), stringsAsFactors=FALSE)
-      x <- pmatch(tolower(x), known[,1])
-      if (is.na(x)) {
-        stop("Unknown/unambigous attribute combination specification")
-      }
-      known[,2][x]
-    }
-  })
-
-  comb
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/basic.R igraph-0.6.5/interfaces/R/igraph/R/basic.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/basic.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/basic.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-is.igraph <- function(graph){
-  "igraph" %in% class(graph)
-}
-
-is.directed <- function(graph) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_is_directed", graph,
-        PACKAGE="igraph")
-}
-
-get.edge <- function(graph, id) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  id <- as.numeric(id)
-  ec <- ecount(graph)
-  
-  if (id < 1 || id > ec) {
-    stop("No such edge")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_get_edge", graph, as.numeric(id)-1,
-               PACKAGE="igraph")
-  res+1
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/bipartite.R igraph-0.6.5/interfaces/R/igraph/R/bipartite.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/bipartite.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/bipartite.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2009-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-bipartite.projection <- function(graph, types=NULL,
-                                 multiplicity=TRUE, probe1=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(types) && "type" %in% list.vertex.attributes(graph)) { 
-  types <- V(graph)$type 
-  } 
-  if (!is.null(types)) { 
-  types <- as.logical(types) 
-  } else { 
-  stop("Not a bipartite graph, supply `types' argument") 
-  }
-  if (!is.null(probe1)) {
-    probe1 <- as.igraph.vs(graph, probe1)-1
-  } else {
-    probe1 <- -1
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_bipartite_projection", graph, types, probe1,
-        PACKAGE="igraph")
-  if (multiplicity) {
-    E(res[[1]])$weight <- res[[3]]
-    E(res[[2]])$weight <- res[[4]]
-  }
-  res[1:2]
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/centrality.R igraph-0.6.5/interfaces/R/igraph/R/centrality.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/centrality.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/centrality.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,78 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-igraph.arpack.default <- list(bmat="I", n=0, which="XX", nev=1, tol=0.0,
-                              ncv=3, ldv=0, ishift=1, maxiter=3000, nb=1,
-                              mode=1, start=0, sigma=0.0, sigmai=0.0)
-
-arpack <- function(func, extra=NULL, sym=FALSE, options=igraph.arpack.default,
-                   env=parent.frame(), complex=!sym) {
-  
-  options.tmp <- igraph.arpack.default
-  options.tmp[ names(options) ] <- options
-  options <- options.tmp
-
-  if (sym && complex) {
-    complex <- FALSE
-    warning("Symmetric matrix, setting `complex' to FALSE")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_arpack", func, extra, options, env, sym,
-               PACKAGE="igraph")
-
-  if (complex) {
-    rew <- arpack.unpack.complex(res$vectors, res$values,
-                                 min(res$options$nev, res$options$nconv))
-    res$vectors <- rew$vectors
-    res$values <- rew$values
-
-    res$values <- apply(res$values, 1, function(x) x[1]+x[2]*1i)
-    dim(res$vectors) <- c(nrow(res$vectors)*2, ncol(res$vectors)/2)
-    res$vectors <- apply(res$vectors, 2, function(x) {
-      l <- length(x)/2
-      x[1:l] + x[(l+1):length(x)]*1i
-    })
-  } else {
-    if (is.matrix(res$values)) {
-      if (!all(res$values[,2]==0)) {
-        warning("Dropping imaginary parts of eigenvalues")
-      }
-      res$values <- res$values[,1]
-    }
-    res$vectors <- res$vectors[,1:length(res$values)]
-  }
-  
-  res
-}
-
-subgraph.centrality <- function(graph, diag=FALSE) {
-  A <- get.adjacency(graph)
-  if (!diag) { diag(A) <- 0 }
-  eig <- eigen(A)
-  res <- as.vector(eig$vectors^2 %*% exp(eig$values))
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) { 
-    names(res) <- get.vertex.attribute(graph, "name") 
-  }
-  res
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/cliques.R igraph-0.6.5/interfaces/R/igraph/R/cliques.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/cliques.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/cliques.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,127 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-cliques <- function(graph, min=NULL, max=NULL) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(min)) {
-    min <- 0
-  }
-  if (is.null(max)) {
-    max <- 0
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_cliques", graph, as.numeric(min), as.numeric(max),
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)
-}
-
-largest.cliques <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_largest_cliques", graph,
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)  
-}
-
-maximal.cliques <- function(graph, min=NULL, max=NULL) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  if (is.null(min)) { min <- 0 }
-  if (is.null(max)) { max <- 0 }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_maximal_cliques", graph, as.numeric(min),
-               as.numeric(max),
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)
-}
-
-clique.number <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_clique_number", graph,
-        PACKAGE="igraph")
-}
-
-independent.vertex.sets <- function(graph, min=NULL, max=NULL) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  if (is.null(min)) {
-    min <- 0
-  }
-
-  if (is.null(max)) {
-    max <- 0
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_independent_vertex_sets", graph, as.numeric(min),
-               as.numeric(max),
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)
-}
-
-largest.independent.vertex.sets <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_largest_independent_vertex_sets", graph,
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)
-}
-
-maximal.independent.vertex.sets <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_maximal_independent_vertex_sets", graph,
-               PACKAGE="igraph")
-  lapply(res, function(x) x+1)
-}
-
-independence.number <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_independence_number", graph,
-        PACKAGE="igraph")
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/cocitation.R igraph-0.6.5/interfaces/R/igraph/R/cocitation.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/cocitation.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/cocitation.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-cocitation <- function(graph, v=V(graph)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  v <- as.igraph.vs(graph, v)
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_cocitation", graph, v-1,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    rownames(res) <- get.vertex.attribute(graph, "name", v)
-    colnames(res) <- get.vertex.attribute(graph, "name")
-  }
-  res
-}
-
-bibcoupling <- function(graph, v=V(graph)) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  v <- as.igraph.vs(graph, v)
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_bibcoupling", graph, v-1,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    rownames(res) <- get.vertex.attribute(graph, "name", v)
-    colnames(res) <- get.vertex.attribute(graph, "name")
-  }
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/cohesive.blocks.R igraph-0.6.5/interfaces/R/igraph/R/cohesive.blocks.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/cohesive.blocks.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/cohesive.blocks.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,320 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-cohesive.blocks <- function(graph, labels=TRUE) {
-
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_cohesive_blocks", graph,
-        PACKAGE="igraph")
-  class(res) <- "cohesiveBlocks"
-  if (labels && "name" %in% list.vertex.attributes(graph)) {
-    res$labels <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res
-}
-
-length.cohesiveBlocks <- function(x) {
-  length(x$blocks)
-}
-
-blocks <- function(blocks) {
-  blocks$blocks
-}
-
-blockGraphs <- function(blocks, graph) {
-  lapply(blocks(blocks), induced.subgraph, graph=graph)
-}
-
-cohesion <- function(blocks) {
-  blocks$cohesion
-}
-
-hierarchy <- function(blocks) {
-  blocks$blockTree
-}
-
-parent <- function(blocks) {
-  blocks$parent
-}
-
-print.cohesiveBlocks <- function(x, ...) {
-  cat("Cohesive block structure:\n")
-  myb <- blocks(x)
-  ch <- cohesion(x)
-  pp <- parent(x)
-  si <- sapply(myb, length)
-
-  cs <- 3 + 2 + nchar(length(x)) +
-    max(shortest.paths(hierarchy(x), mode="out", v=1)) * 3
-  
-  .plot <- function(b, ind="") {
-    if (b!=1) {
-      he <- format(paste(sep="", ind, "'- B-", b), width=cs)
-      ind <- paste("  ", ind)
-    } else {
-      he <- format(paste(sep="", "B-", b), width=cs)
-    }
-    cat(sep="", he,
-        "c ", format(ch[b], width=nchar(max(ch)), justify="right"),
-        ", n ", format(si[b], width=nchar(x$vcount), justify="right"))
-
-    if (x$vcount <= options("width")$width-40 && b != 1) {
-      o <- rep(".", x$vcount)
-      o[ myb[[b]] ] <- "o"
-      oo <- character()
-      for (i in 1:floor(x$vcount/10)) {
-        oo <- c(oo, o[((i-1)*10+1):(i*10)], " ")
-      }
-      if (x$vcount %% 10) { oo <- c(oo, o[(i*10+1):length(o)]) }
-      cat("  ", paste(oo, collapse=""), "\n")
-    } else {
-      cat("\n")
-    }
-
-    wc <- which(pp==b)
-    sapply(wc, .plot, ind=ind)
-  }
-  if (length(x) >0) .plot(1) else cat("No cohesive blocks found.")
-  
-  invisible(x)
-}
-
-summary.cohesiveBlocks <- function(object, ...) {
-  cat("Structurally cohesive block structure, with",
-      length(blocks(object)), "blocks.\n")
-  invisible(object)
-}
-
-plot.cohesiveBlocks <- function(x, y,
-                                colbar=rainbow(max(cohesion(x))+1),
-                                col=colbar[maxcohesion(x)+1],
-                                mark.groups=blocks(x)[-1],
-                                ...) {
-  plot(y, mark.groups=mark.groups,
-       vertex.color=col, ...)
-}
-
-plotHierarchy <- function(blocks,
-                          layout=layout.reingold.tilford(hierarchy(blocks),
-                            root=1), ...) {
-  plot(hierarchy(blocks), layout=layout, ...)
-}
-
-exportPajek.cohesiveblocks.pf <- function(blocks, graph, file) {
-
-  closeit <- FALSE
-  if (is.character(file)) {
-    file <- file(file, open = "w+b")
-    closeit <- TRUE
-  }
-  if (!isOpen(file)) {
-    file <- open(file)
-    closeit <- TRUE
-  }
-
-  ## The original graph
-  cat(file=file, sep="", "*Network cohesive_blocks_input.net\r\n")
-  write.graph(graph, file=file, format="pajek")
-
-  ## The hierarchy graph
-  cat(file=file, sep="", "\r\n*Network hierarchy.net\r\n")
-  write.graph(hierarchy(blocks), file=file, format="pajek")
-
-  ## The blocks
-  myb <- blocks(blocks)
-  for (b in seq_along(myb)) {
-    thisb <- rep(0, vcount(graph))
-    thisb[ myb[[b]] ] <- 1
-    cat(file=file, sep="", "\r\n*Partition block_", b, ".clu\r\n",
-        "*Vertices ", vcount(graph), "\r\n   ")    
-    cat(thisb, sep="\r\n   ", file=file)
-  }
-  
-  if (closeit) {
-    close(file)
-  }
-  invisible(NULL)
-}
-
-exportPajek.cohesiveblocks.nopf <- function(blocks, graph, file) {
-
-  ## The original graph
-  write.graph(graph, file=paste(sep="", file, ".net"), format="pajek")
-
-  ## The hierarchy graph
-  write.graph(hierarchy(blocks), file=paste(sep="", file, "_hierarchy.net"),
-              format="pajek")
-
-  ## The blocks
-  myb <- blocks(blocks)
-  for (b in seq_along(myb)) {
-    thisb <- rep(0, vcount(graph))
-    thisb[ myb[[b]] ] <- 1
-    cat(file=paste(sep="", file, "_block_", b, ".clu"), sep="\r\n",
-        paste("*Vertices", vcount(graph)), thisb)
-  }
-  
-  invisible(NULL)
-}
-
-exportPajek <- function(blocks, graph, file,
-                        project.file=TRUE) {
-  
-  if (!project.file && !is.character(file)) {
-    stop(paste("`file' must be a filename (without extension) when writing",
-               "to separate files"))
-  }
-
-  if (project.file) {
-    return(exportPajek.cohesiveblocks.pf(blocks, graph, file))
-  } else {
-    return(exportPajek.cohesiveblocks.nopf(blocks, graph, file))
-  }
-}
-
-maxcohesion <- function(blocks) {
-  res <- numeric(blocks$vcount)
-  myb <- blocks(blocks)
-  coh <- cohesion(blocks)
-  oo <- order(coh)
-  myb <- myb[oo]
-  coh <- coh[oo]
-  for (b in seq_along(myb)) {
-    res[ myb[[b]] ] <- coh[b]
-  }
-  res
-}
-
-#########################################################
-## Various designs to print the cohesive blocks
-
-## Cohesive block structure:
-## B-1          c. 1, n. 34
-## '- B-2       c. 2, n. 28    1,2,3,4,8,9,10,13,14,15,16,18,19,20,21,22,
-##    |                        23,24,25,26,27,28,29,30,31,32,33,34
-##    '- B-4    c. 4, n.  5    1,2,3,4,8
-##    '- B-5    c. 3, n.  7    1,2,3,9,31,33,34
-##    '- B-7    c. 4, n.  5    1,2,3,4,14
-##    '- B-8    c. 3, n. 10    3,24,25,26,28,29,30,32,33,34
-## '- B-3       c. 2, n.  6    1,5,6,7,11,17
-##    '- B-6    c. 3, n.  5    1,5,6,7,11
-
-## Cohesive block structure:
-## B-1          c. 1, n. 23
-## '- B-2       c. 2, n. 14    1,2,3,4,5,6,7,8,12,19,20,21,22,23
-##    '- B-4    c. 5, n.  7    1,2,3,4,5,6,7
-## '- B-3       c. 2, n. 10    7,9,10,11,13,14,15,16,17,18
-##    '- B-5    c. 3, n.  4    7,9,10,11
-
-## #########################################################
-
-## Cohesive block structure:
-## B-1        c 1, n 34    
-## '- B-2     c 2, n 28    oooo...ooo ..oooo.ooo oooooooooo oooo
-##    '- B-4  c 4, n  5    oooo...o.. .......... .......... ....
-##    '- B-5  c 3, n  7    ooo.....o. .......... .......... o.oo
-##    '- B-7  c 4, n  5    oooo...... ...o...... .......... ....
-##    '- B-8  c 3, n 10    ..o....... .......... ...ooo.ooo .ooo
-## '- B-3     c 2, n  6    o...ooo... o.....o... .......... ....
-##    '- B-6  c 3, n  5    o...ooo... o......... .......... ....
-
-## Cohesive block structure:
-## B-1        c 1, n 23    oooooooooo oooooooooo ooo
-## '- B-2     c 2, n 14    oooooooo.. .o......oo ooo
-##    '- B-4  c 5, n  7    ooooooo... .......... ...
-## '- B-3     c 2, n 10    ......o.oo o.oooooo.. ...
-##    '- B-5  c 3, n  4    ......o.oo o......... ...
-
-## #########################################################
-
-## Cohesive block structure:
-## B-1          c. 1, n. 34
-## '- B-2       c. 2, n. 28     1, 2, 3, 4, 8, 9,10,13,14,15,16,18,19,20,21,
-##    |                        22,23,24,25,26,27,28,29,30,31,32,33,34
-##    '- B-4    c. 4, n.  5     1, 2, 3, 4, 8
-##    '- B-5    c. 3, n.  7     1, 2, 3, 9,31,33,34
-##    '- B-7    c. 4, n.  5     1, 2, 3, 4,14
-##    '- B-8    c. 3, n. 10     3,24,25,26,28,29,30,32,33,34
-## '- B-3       c. 2, n.  6     1, 5, 6, 7,11,17
-##    '- B-6    c. 3, n.  5     1, 5, 6, 7,11
-
-## Cohesive block structure:
-## B-1          c. 1, n. 23
-## '- B-2       c. 2, n. 14     1, 2, 3, 4, 5, 6, 7, 8,12,19,20,21,22,23
-##    '- B-4    c. 5, n.  7     1, 2, 3, 4, 5, 6, 7
-## '- B-3       c. 2, n. 10     7, 9,10,11,13,14,15,16,17,18
-##    '- B-5    c. 3, n.  4     7, 9,10,11
-
-## #########################################################
-
-## Cohesive block structure:
-## B-1          c. 1, n. 34
-## '- B-2       c. 2, n. 28    1-4, 8-10, 13-16, 18-34
-##    '- B-4    c. 4, n.  5    1-4, 8
-##    '- B-5    c. 3, n.  7    1-3, 9, 31, 33-34
-##    '- B-7    c. 4, n.  5    1-4, 14
-##    '- B-8    c. 3, n. 10    3, 24-26, 28-30, 32-34
-## '- B-3       c. 2, n.  6    1, 5-7, 11, 17
-##    '- B-6    c. 3, n.  5    1, 5-7, 11
-
-## Cohesive block structure:
-## B-1          c. 1, n. 23
-## '- B-2       c. 2, n. 14    1-8, 12, 19-23
-##    '- B-4    c. 5, n.  7    1-7
-## '- B-3       c. 2, n. 10    7, 9-11, 13-18
-##    '- B-5    c. 3, n.  4    7, 9-11
-
-## ##########################################################
-
-## Cohesive block structure:
-## B-1        c. 1, n. 34    
-## |- B-2     c. 2, n. 28  [ 1] oooo...ooo ..oooo.ooo 
-## |  |                    [21] oooooooooo oooo
-## |  |- B-4  c. 4, n.  5  [ 1] oooo...o.. .......... 
-## |  |                    [21] .......... ....
-## |  |- B-5  c. 3, n.  7  [ 1] ooo.....o. .......... 
-## |  |                    [21] .......... o.oo
-## |  |- B-7  c. 4, n.  5  [ 1] oooo...... ...o...... 
-## |  |                    [21] .......... ....
-## |  |- B-8  c. 3, n. 10  [ 1] ..o....... .......... 
-## |                       [21] ...ooo.ooo .ooo
-## '- B-3     c. 2, n.  6  [ 1] o...ooo... o.....o... 
-##    |                    [21] .......... ....
-##    '- B-6  c. 3, n.  5  [ 1] o...ooo... o......... 
-##                         [21] .......... ....
-
-## Cohesive block structure:
-## B-1          c. 1, n. 23  [ 1] oooooooooo oooooooooo 
-## |                         [21] ooo
-## |- B-2       c. 2, n. 14  [ 1] oooooooo.. .o......oo 
-## |  |                      [21] ooo
-## |  '- B-4    c. 5, n.  7  [ 1] ooooooo... .......... 
-## |                         [21] ...
-## '- B-3       c. 2, n. 10  [ 1] ......o.oo o.oooooo.. 
-##    |                      [21] ...
-##    '- B-5    c. 3, n.  4  [ 1] ......o.oo o.........
-##                           [21] ...
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/community.R igraph-0.6.5/interfaces/R/igraph/R/community.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,864 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Community structure
-###################################################################
-
-membership <- function(communities) {
-  if (!is.null(communities$membership)) {
-    res <- communities$membership
-  } else if (!is.null(communities$merges) &&
-             !is.null(communities$modularity)) {
-    res <- community.to.membership2(communities$merges, communities$vcount,
-                                    which.max(communities$modularity))
-  } else {
-    stop("Cannot calculate community membership")
-  }
-  if (!is.null(communities$names)) {
-    names(res) <- communities$names
-  }
-  res
-}
-
-print.communities <- function(x, ...) {
-  cat("Graph community structure calculated with the",
-      algorithm(x), "algorithm\n")
-  if (algorithm(x)=="spinglass") {
-    cat("Number of communities:", max(membership(x)), "\n")
-    cat("Modularity:", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) %in% c("walktrap", "edge betweenness",
-                                "fast greedy")) {
-    cat("Number of communities (best split):", max(membership(x)), "\n")
-    cat("Modularity (best split):", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) %in% c("leading eigenvector")) {
-    cat("Number of communities (best split):", max(membership(x)), "\n")
-    cat("Modularity (best split):", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) == "label propagation") {
-    cat("Number of communities:", max(membership(x)), "\n")
-    cat("Modularity:", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) == "multi level") {
-    cat("Number of communities (best split):", max(membership(x)), "\n")
-    cat("Modularity (best split):", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) == "optimal") {
-    cat("Number of communities:", max(membership(x)), "\n")
-    cat("Modularity:", modularity(x), "\n")
-    cat("Membership vector:\n")
-    print(membership(x))
-  } else if (algorithm(x) == "infomap") {
-    cat("Number of communities:", max(membership(x)), "\n")
-    if (!is.null(x$modularity)) {
-      cat("Modularity:", modularity(x), "\n")
-    }
-    cat("Membership vector:\n")
-    print(membership(x))
-  }
-  invisible(x)
-}
-
-modularity <- function(x, ...)
-  UseMethod("modularity")
-
-modularity.igraph <- function(x, membership, weights=NULL, ...) {
-  # Argument checks
-  if (!is.igraph(x)) { stop("Not a graph object") }
-  membership <- as.numeric(membership)
-  if (!is.null(weights)) weights <- as.numeric(weights)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_modularity", x, membership-1, weights,
-        PACKAGE="igraph")
-  res
-}
-
-modularity.communities <- function(x, ...) {
-  if (!is.null(x$modularity)) {
-    max(x$modularity)
-  } else {
-    stop("Modularity was not calculated")
-  }
-}
-
-length.communities <- function(x) {
-  m <- membership(x)
-  max(m)
-}
-
-sizes <- function(communities) {
-  m <- membership(communities)
-  table(`Community sizes`=m)
-}
-
-communities <- function(communities) {
-  m <- membership(communities)
-  tapply(seq_along(m), m, simplify=FALSE,
-         function(x) x)
-}
-
-algorithm <- function(communities) {
-  communities$algorithm
-}
-
-merges <- function(communities) {
-  if (!is.null(communities$merges)) {
-    communities$merges
-  } else {
-    stop("Not a hierarchical community structure")
-  }
-}
-
-crossing <- function(communities, graph) {
-  m <- membership(communities)
-  el <- get.edgelist(graph, names=FALSE)
-  m[el[,1]] != m[el[,2]]
-}
-
-code.length <- function(communities) {
-  communities$codelength
-}
-
-is.hierarchical <- function(communities, full=FALSE) {
-  alg <- algorithm(communities)
-  if (alg %in% c("walktrap", "edge betweenness","fast greedy") ||
-      (alg == "leading eigenvector" && !full)) {
-    TRUE
-  } else if (alg %in% c("spinglass", "label propagation", "multi level",
-                        "optimal") ||
-             (alg == "leading eigenvector" && full)) {
-    FALSE
-  } else {
-    stop("Unknown community detection algorithm")
-  }
-}
-
-complete.dend <- function(comm, use.modularity) {
-  merges <- comm$merges
-  if (nrow(merges) < comm$vcount-1) {
-    if (use.modularity) {
-      stop(paste("`use.modularity' requires a full dendrogram,",
-                 "i.e. a connected graph"))
-    }
-    miss <- seq_len(comm$vcount + nrow(merges))[-as.vector(merges)]
-    miss <- c(miss, seq_len(length(miss)-2) + comm$vcount+nrow(merges))
-    miss <- matrix(miss, byrow=TRUE, ncol=2)
-    merges <- rbind(merges, miss)
-  }
-  storage.mode(merges) <- "integer"
-
-  merges
-}
-
-# The following functions were adapted from the stats R package
-
-as.dendrogram.communities <- function(object, hang=-1, use.modularity=FALSE,
-                                      ...) {
-  if (!is.hierarchical(object, full=TRUE)) {
-    stop("Not a fully hierarchical community structure")
-  }
-
-  .memberDend <- function(x) {
-    r <- attr(x,"x.member")
-    if(is.null(r)) {
-      r <- attr(x,"members")
-    if(is.null(r)) r <- 1:1
-    }
-    r
-  }
-
-  ## If multiple components, then we merge them in arbitrary order
-  merges <- complete.dend(object, use.modularity)
-  
-  storage.mode(merges) <- "integer"
-  
-  if (is.null(object$names)) {
-    object$names <- 1:(nrow(merges)+1)
-  }
-  z <- list()
-  if (!use.modularity || is.null(object$modularity)) {
-    object$height <- 1:nrow(merges)
-  } else {
-    object$height <- object$modularity[-1]
-    object$height <- cumsum(object$height - min(object$height))
-  }
-  nMerge <- length(oHgt <- object$height)
-  if (nMerge != nrow(merges))
-    stop("'merge' and 'height' do not fit!")
-  hMax <- oHgt[nMerge]
-  one <- 1L
-  two <- 2L
-  leafs <- nrow(merges)+1
-  for (k in 1:nMerge) {
-    x <- merges[k, ]# no sort() anymore!
-    if (any(neg <- x < leafs+1))
-      h0 <- if (hang < 0) 0 else max(0, oHgt[k] - hang * hMax)
-    if (all(neg)) {                  # two leaves
-      zk <- as.list(x)
-      attr(zk, "members") <- two
-      attr(zk, "midpoint") <- 0.5 # mean( c(0,1) )
-      objlabels <- object$names[x]
-      attr(zk[[1]], "label") <- objlabels[1]
-      attr(zk[[2]], "label") <- objlabels[2]
-      attr(zk[[1]], "members") <- attr(zk[[2]], "members") <- one
-      attr(zk[[1]], "height") <- attr(zk[[2]], "height") <- h0
-      attr(zk[[1]], "leaf") <- attr(zk[[2]], "leaf") <- TRUE
-    }
-    else if (any(neg)) {            # one leaf, one node
-      X <- as.character(x)
-      ## Originally had "x <- sort(..) above => leaf always left, x[1];
-      ## don't want to assume this
-      isL <- x[1] < leafs+1 ## is leaf left?
-      zk <-
-        if(isL) list(x[1], z[[X[2]]])
-        else    list(z[[X[1]]], x[2])
-      attr(zk, "members") <- attr(z[[X[1 + isL]]], "members") + one
-      attr(zk, "midpoint") <-
-        (.memberDend(zk[[1]]) + attr(z[[X[1 + isL]]], "midpoint"))/2
-      attr(zk[[2 - isL]], "members") <- one
-      attr(zk[[2 - isL]], "height") <- h0
-      attr(zk[[2 - isL]], "label") <- object$names[x[2 - isL]]
-      attr(zk[[2 - isL]], "leaf") <- TRUE
-      }
-    else {                        # two nodes
-      x <- as.character(x)
-      zk <- list(z[[x[1]]], z[[x[2]]])
-      attr(zk, "members") <- attr(z[[x[1]]], "members") +
-        attr(z[[x[2]]], "members")
-      attr(zk, "midpoint") <- (attr(z[[x[1]]], "members") +
-                               attr(z[[x[1]]], "midpoint") +
-                               attr(z[[x[2]]], "midpoint"))/2
-    }
-    attr(zk, "height") <- oHgt[k]
-    z[[k <- as.character(k+leafs)]] <- zk
-  }
-  z <- z[[k]]
-  class(z) <- "dendrogram"
-  z
-}
-
-as.hclust.communities <- function(x, hang=-1, use.modularity=FALSE,
-                                  ...) {
-  as.hclust(as.dendrogram(x, hang=hang, use.modularity=use.modularity))
-}
-
-asPhylo <- function(x, ...)
-  UseMethod("asPhylo")
-
-asPhylo.communities <- function(x, use.modularity=FALSE, ...) {
-
-  if (!is.hierarchical(x, full=TRUE)) {
-    stop("Not a fully hierarchical community structure")
-  }
-
-  require(ape, quietly = TRUE)
-  
-  ## If multiple components, then we merge them in arbitrary order
-  merges <- complete.dend(x, use.modularity)
-
-  if (!use.modularity || is.null(x$modularity)) {
-    height <- 1:nrow(merges)
-  } else {
-    height <- x$modularity[-1]
-    height <- cumsum(height - min(height))
-  }
-
-  if (is.null(x$names)) {
-    labels <- 1:(nrow(merges)+1)
-  } else {
-    labels <- x$names
-  }
-
-  N <- nrow(merges)
-  edge <- matrix(0L, 2*N, 2)
-  edge.length <- numeric(2*N)
-  node <- integer(N)
-  node[N] <- N + 2L
-  cur.nod <- N + 3L
-  j <- 1L
-  for (i in N:1) {
-    edge[j:(j+1), 1] <- node[i]
-    for (l in 1:2) {
-      k <- j + l -1L
-      y <- merges[i, l]
-      if (y > N+1) {
-        edge[k, 2] <- node[y-N-1] <- cur.nod
-        cur.nod <- cur.nod + 1L
-        edge.length[k] <- height[i] - height[y-N-1]
-      } else {
-        edge[k, 2] <- y
-        edge.length[k] <- height[i]
-      }
-    }
-    j <- j + 2L    
-  }
-
-  obj <- list(edge=edge, edge.length=edge.length/2, tip.label=labels,
-              Nnode=N)
-  class(obj) <- "phylo"
-  reorder(obj)
-}
-
-cutat <- function(communities, no, steps) {
-
-  if (!inherits(communities, "communities")) {
-    stop("Not a community structure")
-  }
-  if (!is.hierarchical(communities, full=TRUE)) {
-    stop("Not a fully hierarchical communitity structure")
-  }
-
-  if ((!missing(no) && !missing(steps)) ||
-      ( missing(no) &&  missing(steps))) {
-    stop("Please give either `no' or `steps' (but not both)")
-  }
-
-  if (!missing(steps)) {
-    mm <- merges(communities)
-    if (steps > nrow(mm)) {
-      warning("Cannot make that many steps")
-      steps <- nrow(mm)
-    }
-    community.to.membership2(mm, communities$vcount, steps)
-  } else {
-    mm <- merges(communities)
-    noc <- communities$vcount - nrow(mm) # final number of communities
-    if (no<noc) {
-      warning("Cannot have that few communities")
-      no=noc
-    }
-    steps <- communities$vcount-no
-    community.to.membership2(mm, communities$vcount, steps)    
-  }
-}
-
-showtrace <- function(communities) {
-
-  if (!inherits(communities, "communities")) {
-    stop("Not a community structure")
-  }
-  if (is.null(communities$history)) {
-    stop("History was not recorded")
-  }
-
-  res <- character()
-  i <- 1
-  while (i <= length(communities$history)) {
-    if (communities$history[i] == 2) {  # IGRAPH_LEVC_HIST_SPLIT
-      resnew <- paste("Splitting community", communities$history[i+1],
-                      "into two.")
-      i <- i + 2
-    } else if (communities$history[i]==3) { # IGRAPH_LEVC_HIST_FAILED
-      resnew <- paste("Failed splitting community",
-                      communities$history[i+1], "into two.")
-      i <- i + 2
-    } else if (communities$history[i]==4) { # IGRAPH_LEVC_START_FULL
-      resnew <- "Starting with the whole graph as a community."
-      i <- i + 1
-    } else if (communities$history[i]==5) { # IGRAPH_LEVC_START_GIVEN
-      resnew <- paste("Starting from the", communities$history[i+1],
-                      "given communities.")
-      i <- i + 2
-    }
-
-    res <- c(res, resnew)
-  }
-  res
-}
-
-#####################################################################
-
-community.to.membership2 <- function(merges, vcount, steps) {
-  mode(merges) <- "numeric"
-  mode(vcount) <- "numeric"
-  mode(steps)  <- "numeric"
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_community_to_membership2", merges-1, vcount, steps,
-               PACKAGE="igraph")
-  res+1
-}
-
-#####################################################################
-
-spinglass.community <- function(graph, weights=NULL, vertex=NULL, spins=25,
-                                parupdate=FALSE, start.temp=1,
-                                stop.temp=0.01, cool.fact=0.99,
-                                update.rule=c("config", "random", "simple"),
-                                gamma=1.0, implementation=c("orig", "neg"),
-                                gamma.minus=1.0) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-
-  update.rule <- igraph.match.arg(update.rule)
-  update.rule <- switch(update.rule, "simple"=0, "random"=0, "config"=1)
-  implementation <- switch(igraph.match.arg(implementation),
-                                            "orig"=0, "neg"=1)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  if (is.null(vertex)) {    
-    res <- .Call("R_igraph_spinglass_community", graph, weights,
-                 as.numeric(spins), as.logical(parupdate),
-                 as.numeric(start.temp),
-                 as.numeric(stop.temp), as.numeric(cool.fact),
-                 as.numeric(update.rule), as.numeric(gamma),
-                 as.numeric(implementation), as.numeric(gamma.minus),
-                 PACKAGE="igraph")
-    res$algorithm  <- "spinglass"
-    res$vcount     <- vcount(graph)
-    res$membership <- res$membership + 1
-    if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-      res$names <- get.vertex.attribute(graph, "name")
-    }
-    class(res) <- "communities"
-  } else {
-    res <- .Call("R_igraph_spinglass_my_community", graph, weights,
-                 as.igraph.vs(graph, vertex)-1, as.numeric(spins), 
-                 as.numeric(update.rule), as.numeric(gamma),
-                 PACKAGE="igraph")
-    res$community <- res$community + 1
-  }
-  res
-}
-
-walktrap.community <- function(graph, weights=E(graph)$weight, steps=4,
-                               merges=TRUE, modularity=TRUE,
-                               membership=TRUE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  if (membership && !modularity) {
-    modularity <- TRUE
-  }
-  
-  if (!is.null(weights)) {
-    weights <- as.numeric(weights)
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_walktrap_community", graph, weights, as.numeric(steps),
-        as.logical(merges), as.logical(modularity), as.logical(membership),
-        PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-
-  res$vcount <- vcount(graph)
-  res$algorithm <- "walktrap"
-  res$membership <- res$membership + 1
-  res$merges <- res$merges + 1
-  class(res) <- "communities"
-  res
-}
-
-edge.betweenness.community <- function(graph, weights=E(graph)$weight,
-                                       directed=TRUE,
-                                       edge.betweenness=TRUE,
-                                       merges=TRUE, bridges=TRUE,
-                                       modularity=TRUE,
-                                       membership=TRUE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  if (!is.null(weights)) {
-    weights <- as.numeric(weights)
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_community_edge_betweenness", graph, weights,
-               as.logical(directed),
-               as.logical(edge.betweenness),
-               as.logical(merges), as.logical(bridges),
-               as.logical(modularity), as.logical(membership),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res$algorithm <- "edge betweenness"
-  res$membership <- res$membership + 1
-  res$merges <- res$merges + 1
-  res$removed.edges <- res$removed.edges + 1
-  res$bridges <- res$bridges + 1
-  class(res) <- "communities"
-  res
-}
-
-edge.betweenness.community.merges <- function(graph, edges) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_community_eb_get_merges", graph, as.numeric(edges),
-        PACKAGE="igraph")
-}
-
-fastgreedy.community <- function(graph, merges=TRUE, modularity=TRUE,
-                                 membership=TRUE,
-                                 weights=E(graph)$weight) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (!is.null(weights)) {
-    weights <- as.numeric(weights)
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_community_fastgreedy", graph, as.logical(merges),
-               as.logical(modularity), as.logical(membership), weights,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$algorithm <- "fast greedy"
-  res$vcount <- vcount(graph)
-  res$membership <- res$membership + 1
-  res$merges <- res$merges + 1
-  class(res) <- "communities"
-  res
-}
-
-community.to.membership <- function(graph, merges, steps, membership=TRUE,
-                                    csize=TRUE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  merges <- as.matrix(merges)
-  merges <- structure(as.numeric(merges), dim=dim(merges))
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_community_to_membership", graph, merges-1,
-        as.numeric(steps), as.logical(membership), as.logical(csize),
-        PACKAGE="igraph")
-}
-
-igraph.i.levc.arp <- function(externalP, externalE) {
-  f <- function(v) {
-    v <- as.numeric(v)
-    .Call("R_igraph_i_levc_arp", externalP, externalE, v, PACKAGE="igraph");
-  }
-  f
-}
-
-leading.eigenvector.community <- function(graph, steps=-1, start=NULL,
-                                          options=igraph.arpack.default,
-                                          callback=NULL, extra=NULL,
-                                          env=parent.frame()){
-
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  steps <- as.integer(steps)
-  if (!is.null(start)) { start <- as.numeric(start)-1 }
-  options.tmp <- igraph.arpack.default; options.tmp[ names(options) ] <- options ; options <- options.tmp
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_community_leading_eigenvector", graph, steps,
-               options, start, callback, extra, env,
-               environment(igraph.i.levc.arp),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$algorithm <- "leading eigenvector"
-  res$vcount <- vcount(graph)
-  res$membership <- res$membership + 1
-  res$merges <- res$merges + 1
-  res$history <- res$history + 1
-  class(res) <- "communities"
-  res
-}
-
-label.propagation.community <- function(graph, weights=NULL, initial=NULL,
-                                        fixed=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-  weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-  weights <- as.numeric(weights) 
-  } else { 
-  weights <- NULL 
-  }
-  if (!is.null(initial)) initial <- as.numeric(initial)
-  if (!is.null(fixed)) fixed <- as.logical(fixed)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_community_label_propagation", graph, weights, initial, fixed,
-        PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res$algorithm <- "label propagation"
-  res$membership <- res$membership + 1
-  class(res) <- "communities"
-  res
-}
-
-multilevel.community <- function(graph, weights=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-  weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-  weights <- as.numeric(weights) 
-  } else { 
-  weights <- NULL 
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_community_multilevel", graph, weights,
-        PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res$algorithm <- "multi level"
-  res$membership <- res$membership + 1
-  res$memberships <- res$memberships + 1
-  class(res) <- "communities"
-  res
-}
-
-optimal.community <- function(graph) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_community_optimal_modularity", graph,
-               getIgraphOpt("verbose"), PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res$algorithm <- "optimal"
-  res$membership <- res$membership + 1
-  class(res) <- "communities"
-  res
-}
-
-infomap.community <- function(graph, e.weights=NULL, v.weights=NULL,
-                              nb.trials=10, modularity=TRUE) {
-  
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(e.weights) && "weight" %in% list.edge.attributes(graph)) { 
-    e.weights <- E(graph)$weight 
-  } 
-  if (!is.null(e.weights) && any(!is.na(e.weights))) { 
-    e.weights <- as.numeric(e.weights) 
-  } else { 
-    e.weights <- NULL 
-  }
-  if (is.null(v.weights) && "weight" %in% list.vertex.attributes(graph)) { 
-    v.weights <- V(graph)$weight 
-  } 
-  if (!is.null(v.weights) && any(!is.na(v.weights))) { 
-    v.weights <- as.numeric(v.weights) 
-  } else { 
-    v.weights <- NULL 
-  }
-  nb.trials <- as.integer(nb.trials)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_community_infomap", graph, e.weights,
-               v.weights, nb.trials,
-               PACKAGE="igraph")
-
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-  res$vcount <- vcount(graph)
-  res$algorithm <- "infomap"
-  res$membership <- res$membership + 1
-  if (modularity) {
-    res$modularity <- modularity(graph, res$membership, weights=e.weights)
-  }
-  class(res) <- "communities"
-  res
-}
-
-plot.communities <- function(x, y,
-                             colbar=rainbow(length(x)),
-                             col=colbar[membership(x)],
-                             mark.groups=communities(x),
-                             edge.color=c("black", "red")[crossing(x,y)+1],
-                             ...) {
-
-  plot(y, vertex.color=col, mark.groups=mark.groups,
-       edge.color=edge.color,
-       ...)  
-}
-
-dendPlot <- function(x, mode=getIgraphOpt("dend.plot.type"), ...)
-  UseMethod("dendPlot")
-
-dendPlot.communities <- function(x, 
-                                 mode=getIgraphOpt("dend.plot.type"), ...,
-                                 use.modularity=FALSE) {  
-  mode <- igraph.match.arg(mode, c("auto", "phylo", "hclust", "dendrogram"))
-
-  if (mode=="auto") {
-    value <- tryCatch(suppressWarnings(library("ape", character.only=TRUE,
-                                               logical.return=TRUE,
-                                               warn.conflicts=FALSE,
-                                               quietly=TRUE,
-                                               pos="package:base")),
-                      error=function(e) e)
-    mode <- if (value) "phylo" else "hclust"
-  }
-  
-  if (mode=="hclust") {
-    dendPlotHclust(x, use.modularity=use.modularity, ...)
-  } else if (mode=="dendrogram") {
-    dendPlotDendrogram(x, use.modularity=use.modularity, ...)
-  } else if (mode=="phylo") {
-    dendPlotPhylo(x, use.modularity=use.modularity, ...)
-  }
-}
-
-dendPlotHclust <- function(communities, rect=length(communities),
-                           colbar=rainbow(rect), hang=-1, ann=FALSE,
-                           main="", sub="", xlab="", ylab="", ...,
-                           use.modularity=FALSE) {
-  hc <- as.hclust(communities, hang=hang, use.modularity=use.modularity)
-  ret <- plot(hc, hang=hang, ann=ann, main=main, sub=sub, xlab=xlab,
-              ylab=ylab, ...)
-  if (rect > 0) {
-    rect.hclust(hc, k=rect, border=colbar)
-  }
-  invisible(ret)
-}
-
-dendPlotDendrogram <- function(communities, hang=-1, ...,
-                               use.modularity=FALSE) {
-  plot(as.dendrogram(communities, hang=hang, use.modularity=use.modularity),
-       ...)
-}
-
-dendPlotPhylo <- function(communities, colbar=rainbow(length(communities)),
-                          col=colbar[membership(communities)],
-                          mark.groups=communities(communities),
-                          use.modularity=FALSE, 
-                          edge.color="#AAAAAAFF",
-                          edge.lty=c(1,2), ...) {
-  
-  phy <- asPhylo(communities, use.modularity=use.modularity)
-
-  getedges <- function(tip) {
-    repeat {      
-      ee <- which(! phy$edge[,1] %in% tip & phy$edge[,2] %in% tip)
-      if (length(ee)<=1) { break }
-      tip <- c(tip, unique(phy$edge[ee,1]))
-    }
-    ed <- which(phy$edge[,1] %in% tip & phy$edge[,2] %in% tip)
-    eds <- phy$edge[ed, 1]
-    good <- which(phy$edge[ed,1] %in% which(tabulate(eds) != 1))
-    ed[good]
-  }
-  gredges <- lapply(mark.groups, getedges)
-
-  if (length(mark.groups) > 0) {
-    ecol <- rep(edge.color, nrow(phy$edge))
-    for (gr in seq_along(gredges)) {
-      ecol[gredges[[gr]]] <- colbar[gr]
-    }
-  } else {
-    ecol <- edge.color
-  }
-  
-  elty <- rep(edge.lty[2], nrow(phy$edge))
-  elty[ unlist(gredges) ] <- edge.lty[1]
-  
-  plot(phy, edge.color=ecol, edge.lty=elty, tip.color=col, ...)
-}
-
-compare <- function(comm1, comm2, method=c("vi", "nmi",
-                                       "split.join", "rand",
-                                       "adjusted.rand"))
-  UseMethod("compare")
-
-compare.communities <- function(comm1, comm2, method=c("vi", "nmi",
-                                                "split.join", "rand",
-                                                "adjusted.rand")) {
-  compare.numeric(comm1, comm2, method)
-}
-
-compare.numeric <- function(comm1, comm2, method=c("vi", "nmi",
-                                            "split.join", "rand",
-                                            "adjusted.rand")) {
-  comm1 <- if (inherits(comm1, "communities")) {
-    membership(comm1)
-  } else {
-    as.numeric(comm1)
-  }
-  comm2 <- if (inherits(comm2, "communities")) {
-    membership(comm2)
-  } else {
-    as.numeric(comm2)
-  }
-  method <- switch(igraph.match.arg(method), vi = 0, nmi = 1, 
-                   split.join = 2, rand = 3, adjusted.rand = 4)
-  on.exit(.Call("R_igraph_finalizer", PACKAGE = "igraph"))
-  res <- .Call("R_igraph_compare_communities", comm1, comm2, 
-               method, PACKAGE = "igraph")
-  res  
-}
-                                
-compare.default <- function(comm1, comm2, method=c("vi", "nmi",
-                                            "split.join", "rand",
-                                            "adjusted.rand")) {
-  compare.numeric(as.numeric(comm1), as.numeric(comm2), method)
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/components.R igraph-0.6.5/interfaces/R/igraph/R/components.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/components.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/components.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Connected components, subgraphs, kinda
-###################################################################
-
-no.clusters <- function(graph, mode=c("weak", "strong")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "weak"=1, "strong"=2)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_no_clusters", graph, as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-cluster.distribution <- function(graph, cumulative=FALSE, mul.size=FALSE,
-                                 ...) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  cs <- clusters(graph, ...)$csize;
-  hi <- hist(cs, -1:max(cs), plot=FALSE)$intensities;
-  if (mul.size) {
-    hi <- hi*1:max(cs)
-    hi <- hi/sum(hi)
-  }
-  if (!cumulative) {
-    res <- hi
-  } else {
-    res <- rev(cumsum(rev(hi)));
-  }
-  
-  res
-}
-
-is.connected <- function(graph, mode=c("weak", "strong")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "weak"=1, "strong"=2)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_is_connected", graph, as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-decompose.graph <- function(graph, mode=c("weak", "strong"), max.comps=NA,
-                      min.vertices=0) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "weak"=1, "strong"=2)
-
-  if (is.na(max.comps)) {
-    max.comps=-1
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_decompose", graph, as.numeric(mode),
-        as.numeric(max.comps), as.numeric(min.vertices),
-        PACKAGE="igraph"
-        )
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/console.R igraph-0.6.5/interfaces/R/igraph/R/console.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/console.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/console.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,226 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-.igraph.pb <- NULL
-
-.igraph.progress <- function(percent, message, clean=FALSE) {
-  if (clean) {
-    if (!is.null(.igraph.pb)) { close(.igraph.pb) }
-    return(invisible())
-  }
-  type <- getIgraphOpt("verbose")
-  if (is.logical(type) && type) {
-    .igraph.progress.txt(percent, message)
-  } else {
-    switch (type,
-            "tk"=.igraph.progress.tk(percent, message),
-            "tkconsole"=.igraph.progress.tkconsole(percent, message),
-            stop("Cannot interpret 'verbose' option, this should not happen"))
-  }
-}
-
-.igraph.status <- function(message) {
-  type <- getIgraphOpt("verbose")
-  if (is.logical(type) && type) {
-    message(message, appendLF=FALSE)
-  } else {
-    switch(type,
-           "tk"=message(message, appendLF=FALSE),
-           "tkconsole"=.igraph.progress.tkconsole.message(message, start=TRUE),
-           stop("Cannot interpret 'verbose' option, this should not happen"))
-  }
-  0L
-}
-
-.igraph.progress.txt <- function(percent, message) {
-  pb <- get(".igraph.pb", asNamespace("igraph"))
-  if (percent==0) {
-    if (!is.null(pb)) { close(pb) }
-    cat(sep="", "  ", message, "\n")
-    pb <- txtProgressBar(min=0, max=100, style=3)
-  }
-  setTxtProgressBar(pb, percent)
-  if (percent==100) {
-    close(pb);
-    pb <- NULL
-  }
-  assign(".igraph.pb", pb, envir=asNamespace("igraph"))
-  0L
-}
-
-.igraph.progress.tk <- function(percent, message) {
-  pb <- get(".igraph.pb", asNamespace("igraph"))
-  if (percent==0) {
-    if (!is.null(pb)) { close(pb) }
-    pb <- tkProgressBar(min=0, max=100, title=message, label="0 %")
-  }
-  setTkProgressBar(pb, percent, label=paste(percent, "%"))
-  if (percent==100) {
-    close(pb);
-    pb <- NULL
-  }
-  assign(".igraph.pb", pb, envir=asNamespace("igraph"))
-  0L
-}
-
-.igraph.progress.tkconsole <- function(percent, message) {
-  pb <- get(".igraph.pb", asNamespace("igraph"))
-  startmess <- FALSE
-
-  ## Open the console, if it is not open
-  if (is.null(pb)) {
-    startmess <- TRUE
-    pb <- .igraph.progress.tkconsole.create(NA)
-  }
-
-  ## Update progress bar
-  pb$pb$set(pb$pb$widget, percent)
-  tkconfigure(pb$pb$label, text=substr(message, 1, 20))
-  tcl("update", "idletasks")
-  
-  ## Done
-  assign(".igraph.pb", pb, envir=asNamespace("igraph"))  
-  if (startmess) .igraph.progress.tkconsole.message("Console started.\n")
-  0L
-}
-
-.igraph.progress.tkconsole.create <- function(oldverb) {
-  console <- tktoplevel()
-  tktitle(console) <- "igraph console"
-
-  fn <- tkfont.create(family="courier", size=8)
-
-  lfr <- tkframe(console)
-  image <- tkimage.create("photo", "img", format="gif",
-                          file=system.file("igraph2.gif", package="igraph"))
-  logo <- tklabel(lfr, relief="flat", padx=10, pady=10, image=image)
-  
-  scr <- tkscrollbar(console, repeatinterval=5,
-                     command=function(...) tkyview(txt, ...)) 
-  txt <- tktext(console, yscrollcommand=function(...) tkset(scr, ...),
-                width=60, height=7, font=fn)
-  tkconfigure(txt, state="disabled")
-  pbar <- .igraph.progress.tkconsole.pbar(console)
-
-  bclear <- tkbutton(lfr, text="Clear", command=function() {
-    tkconfigure(txt, state="normal")
-    tkdelete(txt, "0.0", "end")
-    tkconfigure(txt, state="disabled")
-  })
-  bstop  <- tkbutton(lfr, text="Stop",  command=function() {})
-  bclose <- tkbutton(lfr, text="Close", command=function() {
-    if (!is.na(oldverb) && getIgraphOpt("verbose") == "tkconsole") {
-      igraph.options(verbose=oldverb)
-    }
-    tkdestroy(console) })
-
-  tkpack(logo, side="top", fill="none", expand=0, anchor="n",
-         ipadx=10, ipady=10)
-  tkpack(bclear, side="top", fill="x", expand=0, padx=10)
-  ## tkpack(bstop, side="top", fill="x", expand=0, padx=10)
-  tkpack(bclose, side="top", fill="x", expand=0, padx=10)  
-  
-  tkpack(lfr, side="left", fill="none", expand=0, anchor="n")
-  tkpack(pbar$frame, side="bottom", fill="x", expand=0)
-  tkpack(scr, side="right", fill="y", expand=0)
-  tkpack(txt, side="left", fill="both", expand=1)
-
-  tkbind(console, "<Destroy>", function() {
-    if (!is.na(oldverb) && getIgraphOpt("verbose") == "tkconsole") {
-      igraph.options(verbose=oldverb)
-    }
-    assign(".igraph.pb", NULL, envir=asNamespace("igraph"))
-  })
-  
-  res <- list(top=console, txt=txt, pb=pbar$pb, oldverb=oldverb)
-  class(res) <- "igraphconsole"
-  res
-}
-
-.igraph.progress.tkconsole.message <- function(message, start=FALSE) {
-  txt <- get(".igraph.pb", asNamespace("igraph"))$txt
-  if (is.null(txt)) {
-    if (start) {
-      pb <- .igraph.progress.tkconsole.create(NA)
-      assign(".igraph.pb", pb, envir=asNamespace("igraph"))
-      txt <- pb$txt
-    } else { 
-      return()
-    }
-  }
-  tkconfigure(txt, state="normal")
-  now <- paste(sep="", substr(date(), 5, 19), ": ")
-  s1 <- grepl("^ ", message)
-  if (!s1) { tkinsert(txt, "insert", now) }
-  tkinsert(txt, "insert", message)
-  tksee(txt, "end")
-  tkconfigure(txt, state="disabled")
-  tcl("update", "idletasks")
-}
-
-close.igraphconsole <- function(con, ...) {
-  invisible()
-}
-
-## Much of this is from tkProgressbar
-
-.igraph.progress.tkconsole.pbar <- function(top) {
-  useText <- FALSE
-  have_ttk <- as.character(tcl("info", "tclversion")) >= "8.5"
-  if (!have_ttk && as.character(tclRequire("PBar")) == "FALSE") 
-    useText <- TRUE
-  fn <- tkfont.create(family = "helvetica", size = 10)
-  frame <- tkframe(top)
-  if (useText) {
-    .lab <- tklabel(frame, text = " ", font = fn, anchor="w",
-                    padx = 20)
-    tkpack(.lab, side = "left", anchor="w", padx=5)
-    fn2 <- tkfont.create(family = "helvetica", size = 12)
-    .vlab <- tklabel(frame, text = "0%", font = fn2, padx = 20)
-    tkpack(.vlab, side = "right")
-  } else {
-    .lab <- tklabel(frame, text = " ", font = fn, anchor="w",
-                    pady = 5)
-    tkpack(.lab, side = "top", anchor="w", padx=5)
-    tkpack(tklabel(frame, text = "", font = fn), side = "bottom")
-    .val <- tclVar()
-    pBar <- if (have_ttk) {
-      ttkprogressbar(frame, length = 300, variable=.val)
-    } else {
-      tkwidget(frame, "ProgressBar", width = 300, variable=.val)
-    }
-    tkpack(pBar, side = "bottom", anchor="w", padx=5)
-  }
-  get <- function(w) { return(tclvalue(.val)); }
-  set <- function(w, val) { tclvalue(.val) <<- val }
-  pb <- list(widget=pBar, get=get, set=set, label=.lab)
-  list(frame=frame, pb=pb)
-}
-
-igraph.console <- function() {
-  oldverb <- getIgraphOpt("verbose")
-  igraph.options(verbose="tkconsole")
-  pb <- .igraph.progress.tkconsole.create(oldverb)
-  assign(".igraph.pb", pb, envir=asNamespace("igraph"))  
-  .igraph.progress.tkconsole.message("Console started.\n")
-  invisible()
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/conversion.R igraph-0.6.5/interfaces/R/igraph/R/conversion.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/conversion.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/conversion.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,501 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-get.adjacency.dense <- function(graph, type=c("both", "upper", "lower"),
-                                attr=NULL, edges=FALSE, names=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  type <- igraph.match.arg(type)
-  type <- switch(type, "upper"=0, "lower"=1, "both"=2)
-  
-  if (edges || is.null(attr)) {    
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_get_adjacency", graph, as.numeric(type),
-                 as.logical(edges), PACKAGE="igraph")
-  } else {
-    attr <- as.character(attr)
-    if (! attr %in% list.edge.attributes(graph)) {
-      stop("no such edge attribute")
-    }
-    exattr <- get.edge.attribute(graph, attr)
-    if (is.logical(exattr)) {
-      res <- matrix(FALSE, nrow=vcount(graph), ncol=vcount(graph))
-    } else if (is.character(exattr)) {
-      res <- matrix("", nrow=vcount(graph), ncol=vcount(graph))
-    } else if (is.numeric(exattr)) {
-      res <- matrix(0, nrow=vcount(graph), ncol=vcount(graph))
-    } else {
-      stop("Sparse matrices must be either numeric or logical,",
-           "and the edge attribute is not")
-    }
-    if (is.directed(graph)) {
-      for (i in seq(length=ecount(graph))) {
-        e <- get.edge(graph, i)
-        res[ e[1], e[2] ] <- get.edge.attribute(graph, attr, i)
-      }
-    } else {
-      if (type==0) {
-        ## upper
-        for (i in seq(length=ecount(graph))) {
-          e <- get.edge(graph, i)
-          res[ min(e), max(e) ] <- get.edge.attribute(graph, attr, i)
-        }        
-      } else if (type==1) {
-        ## lower
-        for (i in seq(length=ecount(graph))) {
-          e <- get.edge(graph, i)
-          res[ max(e), min(e) ] <- get.edge.attribute(graph, attr, i)
-        }        
-      } else if (type==2) {
-        ## both
-        for (i in seq(length=ecount(graph))) {
-          e <- get.edge(graph, i)
-          res[ e[1], e[2] ] <- get.edge.attribute(graph, attr, i)
-          if (e[1] != e[2]) {
-            res[ e[2], e[1] ] <- get.edge.attribute(graph, attr, i)
-          }
-        }
-      }
-    }
-  }
-
-  if (names && "name" %in% list.vertex.attributes(graph)) {
-    colnames(res) <- rownames(res) <- V(graph)$name
-  }
-  
-  res  
-}
-
-get.adjacency.sparse <- function(graph, type=c("both", "upper", "lower"),
-                                 attr=NULL, edges=FALSE, names=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  require(Matrix)
-  
-  type <- igraph.match.arg(type)
-
-  vc <- vcount(graph)
-  
-  el <- get.edgelist(graph, names=FALSE)
-  if (edges) {
-    value <- seq_len(nrow(el))
-  } else if (!is.null(attr)) {
-    attr <- as.character(attr)
-    if (!attr %in% list.edge.attributes(graph)) {
-      stop("no such edge attribute")
-    }
-    value <- get.edge.attribute(graph, name=attr)
-    if (!is.numeric(value) && !is.logical(value)) {
-      stop("Sparse matrices must be either numeric or logical,",
-           "and the edge attribute is not")
-    }
-  } else {
-    value <- rep(1, nrow(el))
-  }
-
-  if (is.directed(graph)) {
-    res <- sparseMatrix(dims=c(vc, vc), i=el[,1], j=el[,2], x=value)
-  } else {
-    if (type=="upper") {
-      ## upper
-      res <- sparseMatrix(dims=c(vc, vc), i=pmin(el[,1],el[,2]),
-                          j=pmax(el[,1],el[,2]), x=value)
-    } else if (type=="lower") {
-      ## lower
-      res <- sparseMatrix(dims=c(vc, vc), i=pmax(el[,1],el[,2]),
-                          j=pmin(el[,1],el[,2]), x=value)
-    } else if (type=="both") {
-      ## both
-      res <- sparseMatrix(dims=c(vc, vc), i=pmin(el[,1],el[,2]),
-                          j=pmax(el[,1],el[,2]), x=value, symmetric=TRUE)
-      res <- as(res, "dgCMatrix")
-    }
-  }
-
-  if (names && "name" %in% list.vertex.attributes(graph)) {
-    colnames(res) <- rownames(res) <- V(graph)$name
-  }
-
-  res
-}
-
-get.adjacency <- function(graph, type=c("both", "upper", "lower"),
-                          attr=NULL, edges=FALSE, names=TRUE, 
-                          sparse=getIgraphOpt("sparsematrices")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (!sparse) {
-    get.adjacency.dense(graph, type=type, attr=attr, edges=edges, names=names)
-  } else {
-    get.adjacency.sparse(graph, type=type, attr=attr, edges=edges, names=names)
-  }  
-}
-
-get.edgelist <- function(graph, names=TRUE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- matrix(.Call("R_igraph_get_edgelist", graph, TRUE,
-                      PACKAGE="igraph"), ncol=2)
-  res <- res+1
-  if (names && "name" %in% list.vertex.attributes(graph)) {
-    res <- matrix(V(graph)$name[ res ], ncol=2)
-  }
-
-  res
-}
-
-as.directed <- function(graph, mode=c("mutual", "arbitrary")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "arbitrary"=0, "mutual"=1)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_to_directed", graph, as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-get.adjlist <- function(graph, mode=c("all", "out", "in", "total")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  mode <- igraph.match.arg(mode)
-  mode <- as.numeric(switch(mode, "out"=1, "in"=2, "all"=3, "total"=3))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_get_adjlist", graph, mode,
-               PACKAGE="igraph")
-  res <- lapply(res, function(x) x+1)
-  if (is.named(graph)) names(res) <- V(graph)$name
-  res
-}
-
-get.adjedgelist <- function(graph, mode=c("all", "out", "in", "total")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  mode <- igraph.match.arg(mode)
-  mode <- as.numeric(switch(mode, "out"=1, "in"=2, "all"=3, "total"=3))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_get_adjedgelist", graph, mode,
-               PACKAGE="igraph")
-  res <- lapply(res, function(x) x+1)
-  if (is.named(graph)) names(res) <- V(graph)$name
-  res
-}
-
-igraph.from.graphNEL <- function(graphNEL, name=TRUE, weight=TRUE,
-                                 unlist.attrs=TRUE) {
-
-  require(graph)
-
-  if (!inherits(graphNEL, "graphNEL")) {
-    stop("Not a graphNEL graph")
-  }
-  
-  al <- lapply(edgeL(graphNEL), "[[", "edges")
-  if (edgemode(graphNEL)=="undirected") {
-    al <- mapply(SIMPLIFY=FALSE, seq_along(al), al, FUN=function(n, l) {
-      c(l, rep(n, sum(l==n)))
-    })
-  }
-  mode <- if (edgemode(graphNEL)=="directed") "out" else "all"
-  g <- graph.adjlist(al, mode=mode, duplicate=TRUE)
-  if (name) {
-    V(g)$name <- nodes(graphNEL)
-  }
-
-  ## Graph attributes
-  g.n <- names(graphNEL@graphData)
-  g.n <- g.n [ g.n != "edgemode" ]
-  for (n in g.n) {
-    g <- set.graph.attribute(g, n, graphNEL@graphData[[n]])
-  }
-  
-  ## Vertex attributes
-  v.n <- names(nodeDataDefaults(graphNEL))
-  for (n in v.n) {
-    val <- unname(nodeData(graphNEL, attr=n))
-    if (unlist.attrs && all(sapply(val, length)==1)) { val <- unlist(val) }
-    g <- set.vertex.attribute(g, n, value=val)
-  }
-
-  ## Edge attributes
-  e.n <- names(edgeDataDefaults(graphNEL))
-  if (!weight) { e.n <- e.n [ e.n != "weight" ] }
-  if (length(e.n) > 0) {
-    el <- get.edgelist(g)
-    el <- paste(sep="|", el[,1], el[,2])
-    for (n in e.n) {
-      val <- unname(edgeData(graphNEL, attr=n)[el])
-      if (unlist.attrs && all(sapply(val, length)==1)) { val <- unlist(val) }
-      g <- set.edge.attribute(g, n, value=val)
-    }
-  }
-  
-  g 
-}
-
-igraph.to.graphNEL <- function(graph) {
-
-  if (!is.igraph(graph)) {
-    stop("Not an igraph graph")
-  }
-  
-  require(graph)
-
-  if ("name" %in% list.vertex.attributes(graph) &&
-      is.character(V(graph)$name)) {
-    name <- V(graph)$name
-  } else {
-    name <- as.character(seq(vcount(graph)))    
-  }
-
-  edgemode <- if (is.directed(graph)) "directed" else "undirected"  
-
-  if ("weight" %in% list.edge.attributes(graph) &&
-      is.numeric(E(graph)$weight)) {
-    al <- get.adjedgelist(graph, "out")
-    for (i in seq(along=al)) {
-      edges <- get.edges(graph, al[[i]])
-      edges <- ifelse( edges[,2]==i, edges[,1], edges[,2])
-      weights <- E(graph)$weight[al[[i]]]
-      al[[i]] <- list(edges=edges, weights=weights)
-    }
-  } else {
-    al <- get.adjlist(graph, "out")
-    al <- lapply(al, function(x) list(edges=x))
-  }  
-  
-  names(al) <- name
-  res <- new("graphNEL", nodes=name, edgeL=al, edgemode=edgemode)
-
-  ## Add graph attributes (other than 'directed')
-  ## Are this "officially" supported at all?
-
-  g.n <- list.graph.attributes(graph)
-  if ("directed" %in% g.n) {
-    warning("Cannot add graph attribute `directed'")
-    g.n <- g.n[ g.n != "directed" ]
-  }
-  for (n in g.n) {
-    res@graphData[[n]] <- get.graph.attribute(graph, n)
-  }
-
-  ## Add vertex attributes (other than 'name', that is already
-  ## added as vertex names)
-  
-  v.n <- list.vertex.attributes(graph)
-  v.n <- v.n[ v.n != "name" ]
-  for (n in v.n) {
-    nodeDataDefaults(res, attr=n) <- NA
-    nodeData(res, attr=n) <- get.vertex.attribute(graph, n)
-  }
-
-  ## Add edge attributes (other than 'weight')
-  
-  e.n <- list.edge.attributes(graph)
-  e.n <- e.n[ e.n != "weight" ]
-  if (length(e.n) > 0) {
-    el <- get.edgelist(graph)
-    el <- paste(sep="|", el[,1], el[,2])
-    for (n in e.n) {
-      edgeDataDefaults(res, attr=n) <- NA
-      res@edgeData@data[el] <- mapply(function(x,y) {
-        xx <- c(x,y); names(xx)[length(xx)] <- n; xx },
-                                      res@edgeData@data[el],
-                                      get.edge.attribute(graph, n),
-                                      SIMPLIFY=FALSE)
-    }
-  }
-  
-  res
-}
-
-get.incidence.dense <- function(graph, types, names, attr) {
-
-  if (is.null(attr)) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    ## Function call
-    res <- .Call("R_igraph_get_incidence", graph, types,
-                 PACKAGE="igraph")
-
-    if (names && "name" %in% list.vertex.attributes(graph)) {
-      rownames(res$res) <- V(graph)$name[ res$row_ids+1 ]
-      colnames(res$res) <- V(graph)$name[ res$col_ids+1 ]
-    } else {
-      rownames(res$res) <- res$row_ids+1
-      colnames(res$res) <- res$col_ids+1
-    }
-    res$res
-    
-  } else {
-
-    attr <- as.character(attr)
-    if (!attr %in% list.edge.attributes(graph)) {
-      stop("no such edge attribute")
-    }
-
-    vc <- vcount(graph)
-    n1 <- sum(!types)
-    n2 <- vc-n1    
-    res <- matrix(0, n1, n2)
-
-    recode <- numeric(vc)
-    recode[!types] <- seq_len(n1)
-    recode[types]  <- seq_len(n2)
-    
-    for (i in seq(length=ecount(graph))) {
-      eo <- get.edge(graph, i)
-      e <- recode[eo]
-      if (!types[eo[1]]) {
-        res[ e[1], e[2] ] <- get.edge.attribute(graph, attr, i)
-      } else{
-        res[ e[2], e[1] ] <- get.edge.attribute(graph, attr, i)
-      }
-    }
-
-    if (names && "name" %in% list.vertex.attributes(graph)) {
-      rownames(res) <- V(graph)$name[ which(!types) ]
-      colnames(res) <- V(graph)$name[ which( types) ]
-    } else {
-      rownames(res) <- which(!types)
-      colnames(res) <- which(types)
-    }
-
-    res
-  }
-}
-
-get.incidence.sparse <- function(graph, types, names, attr) {
-
-  vc <- vcount(graph)
-  if (length(types) != vc) {
-    stop("Invalid types vector")
-  }
-  
-  require(Matrix)
-  el <- get.edgelist(graph, names=FALSE)
-  if (any(types[el[,1]] == types[el[,2]])) {
-    stop("Invalid types vector, not a bipartite graph")
-  }
-
-  n1 <- sum(!types)
-  n2 <- vc-n1
-
-  recode <- numeric(vc)
-  recode[!types] <- seq_len(n1)
-  recode[types]  <- seq_len(n2) + n1
-
-  el[,1] <- recode[el[,1]]
-  el[,2] <- recode[el[,2]]
-
-  change <- el[,1] > n1
-  el[change,] <- el[change,2:1]
-  el[,2] <- el[,2]-n1
-
-  if (!is.null(attr)) {
-    attr <- as.character(attr)
-    if (!attr %in% list.edge.attributes(graph)) {
-      stop("no such edge attribute")
-    }
-    value <- get.edge.attribute(graph, name=attr)
-  } else { 
-    value <- rep(1, nrow(el))
-  }
-
-  res <- spMatrix(n1, n2, i=el[,1], j=el[,2], x=value)
-
-  if (names && "name" %in% list.vertex.attributes(graph)) {
-    rownames(res) <- V(graph)$name[which(!types)]
-    colnames(res) <- V(graph)$name[which(types)]
-  } else {
-    rownames(res) <- which(!types)
-    colnames(res) <- which(types)
-  }
-  res
-}
-
-get.incidence <- function(graph, types=NULL, attr=NULL,
-                          names=TRUE, sparse=FALSE) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(types) && "type" %in% list.vertex.attributes(graph)) { 
-    types <- V(graph)$type 
-  } 
-  if (!is.null(types)) { 
-    types <- as.logical(types) 
-  } else { 
-    stop("Not a bipartite graph, supply `types' argument") 
-  }
-  
-  names <- as.logical(names)
-  sparse <- as.logical(sparse)
-  
-  if (sparse) {
-    get.incidence.sparse(graph, types=types, names=names, attr=attr)
-  } else {
-    get.incidence.dense(graph, types=types, names=names, attr=attr)
-  }
-}
-
-get.data.frame <- function(x, what=c("edges", "vertices", "both")) {
-
-  if (!is.igraph(x)) { stop("Not a graph object") }
-  what <- igraph.match.arg(what)
-
-  if (what %in% c("vertices", "both")) {
-    ver <- .Call("R_igraph_mybracket2", x, 9L, 3L, PACKAGE="igraph")
-    class(ver) <- "data.frame"
-    rn <- if (is.named(x)) { V(x)$name } else { seq_len(vcount(x)) }
-    rownames(ver) <- rn
-  }
-
-  if (what %in% c("edges", "both")) {
-    el <- get.edgelist(x)
-    edg <- c(list(from=el[,1]), list(to=el[,2]),
-             .Call("R_igraph_mybracket2", x, 9L, 4L, PACKAGE="igraph"))
-    class(edg) <- "data.frame"
-    rownames(edg) <- seq_len(ecount(x))
-  }
-  
-  if (what=="both") {
-    list(vertices=ver, edges=edg)
-  } else if (what=="vertices") {
-    ver
-  } else {
-    edg
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/decomposition.R igraph-0.6.5/interfaces/R/igraph/R/decomposition.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/decomposition.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/decomposition.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2008-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Graph decomposition
-###################################################################
-
-is.chordal <- function(graph, alpha = NULL, alpham1 = NULL,
-                       fillin = FALSE, newgraph = FALSE) {
-    if (!is.igraph(graph)) {
-        stop("Not a graph object")
-    }
-    if (!is.null(alpha)) 
-        alpha <- as.numeric(alpha)-1
-    if (!is.null(alpham1)) 
-        alpham1 <- as.numeric(alpham1)-1
-    fillin <- as.logical(fillin)
-    newgraph <- as.logical(newgraph)
-    on.exit(.Call("R_igraph_finalizer", PACKAGE = "igraph"))
-    res <- .Call("R_igraph_is_chordal", graph, alpha, alpham1, 
-                 fillin, newgraph, PACKAGE = "igraph")
-    if (fillin) { res$fillin <- res$fillin + 1 }
-    res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/demo.R igraph-0.6.5/interfaces/R/igraph/R/demo.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/demo.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/demo.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,157 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-igraphdemo <- function(which) {
-  require(igraph)
-  require(tcltk)
-  
-  if (missing(which)) {
-    demodir <- system.file("demo", package="igraph")
-    if (demodir=="") {
-      stop("Could not find igraph demos, broken igraph installation?")
-    }
-    return( sub("\\.R$", "", list.files(demodir)) )
-  }
-
-  if (!grepl("\\.R$", which)) {
-    which <- paste(which, sep=".", "R")
-  }
-
-  if (!file.exists(which) && ! grepl("^/", which)) {
-    which <- system.file( paste("demo", sep="/", which), package="igraph" )
-  }
-
-  if (which=="" || !file.exists(which)) {
-    stop("Could not find demo file")
-  }
-  
-  .igraphdemo.next <- function(top, txt) {
-    act <- as.character(tktag.nextrange(txt, "active", "0.0"))
-    if (length(act)==0) {
-      return()
-    }
-
-    options(keep.source=TRUE)
-    
-    text <- tclvalue(tkget(txt, act[1], act[2]))
-    cat("=======================================================\n");
-
-    expr <- parse(text=text)
-    for (i in seq_along(expr)) {
-      co <- as.character(attributes(expr)$srcref[[i]])
-      co[1] <- paste("> ", sep="", co[1])
-      if (length(co)>1) {
-        co[-1] <- paste(" +", sep="", co[-1])
-      }
-      cat(co, sep="\n")
-      res <- withVisible(eval(expr[[i]], envir=.GlobalEnv))
-      if (res$visible) {
-        print(res$value)
-      }
-    }
-    cat("> -------------------------------------------------------\n");
-    cat(options()$prompt)
-    
-    tktag.remove(txt, "activechunk", act[1], act[2])
-    tktag.remove(txt, "active", act[1], act[2])
-
-    nex <- as.character(tktag.nextrange(txt, "activechunk", act[1]))
-    if (length(nex)!=0) {
-      tktag.add(txt, "active", nex[1], nex[2])
-      tksee(txt, paste(sep="", as.numeric(nex[2]), ".0"))
-      tksee(txt, paste(sep="", as.numeric(nex[1]), ".0"))
-    }
-  }
-  
-  .igraphdemo.close <- function(top) {
-    tkdestroy(top)
-  }
-  
-  .igraphdemo.reset <- function(top, txt, which) {
-    demolines <- readLines(which)
-    demolines <- demolines[!grepl("^pause\\(\\)$", demolines)]
-    demolines <- paste(" ", sep="", demolines)
-
-    ch <- grep("^[ ]*###", demolines)
-    ch <- c(ch, length(demolines)+1)
-    if (length(ch)==1) {
-      warning("Demo source file does not contain chunks")
-    } else {
-      demolines <- demolines[ch[1]:length(demolines)]
-      ch <- grep("^[ ]*###", demolines)
-      ch <- c(ch, length(demolines)+1)
-    }
-    
-    tkconfigure(txt, state="normal")
-    tkdelete(txt, "0.0", "end")
-    tkinsert(txt, "insert", paste(demolines, collapse="\n"))
-    tkconfigure(txt, state="disabled")
-
-    for (i in seq_along(ch[-1])) {
-      from <- paste(sep="", ch[i], ".0")
-      to <- paste(sep="", ch[i+1]-1, ".0")
-      tktag.add(txt, "chunk", from, to)
-      tktag.add(txt, "activechunk", from, to)
-    }
-    tktag.configure(txt, "chunk", "-borderwidth", "1")
-    tktag.configure(txt, "chunk", "-relief", "sunken")
-    if (length(ch) >= 2) {
-      tktag.add(txt, "active", paste(sep="", ch[1], ".0"),
-                paste(sep="", ch[2]-1, ".0"))
-      tktag.configure(txt, "active", "-foreground", "red")
-      tktag.configure(txt, "active", "-background", "lightgrey")
-    }
-
-    comm <- grep("^#", demolines)
-    for (i in comm) {
-      tktag.add(txt, "comment", paste(sep="", i, ".0"),
-                paste(sep="", i, ".end"))
-    }
-    tktag.configure(txt, "comment", "-font", "bold")
-    tktag.configure(txt, "comment", "-foreground", "darkolivegreen")
-  }
-
-  top <- tktoplevel(background="lightgrey")
-  tktitle(top) <- paste("igraph demo:", which)
-  
-  main.menu <- tkmenu(top)
-  tkadd(main.menu, "command", label="Close", command=function()
-        .igraphdemo.close(top))
-  tkadd(main.menu, "command", label="Reset", command=function()
-        .igraphdemo.reset(top, txt, which))
-  tkconfigure(top, "-menu", main.menu)
-
-  scr <- tkscrollbar(top, repeatinterval=5,
-                     command=function(...) tkyview(txt,...))
-  txt <- tktext(top, yscrollcommand=function(...) tkset(scr, ...),
-                width=80, height=40)
-  but <- tkbutton(top, text="Next", command=function()
-                  .igraphdemo.next(top, txt))
-  
-  tkpack(but, side="bottom", fill="x", expand=0)
-  tkpack(scr, side="right", fill="y", expand=0)
-  tkpack(txt, side="left", fill="both", expand=1)
-
-  .igraphdemo.reset(top, txt, which)
-  
-  invisible()
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/fit.R igraph-0.6.5/interfaces/R/igraph/R/fit.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/fit.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/fit.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,77 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Pit a power-law (khmm a Yule really) distribution,
-# this is a common degree distribution in networks
-###################################################################
-
-power.law.fit <- function(x, xmin=NULL, start=2, force.continuous=FALSE,
-                          implementation=c("plfit", "R.mle"), ...) {
-
-  implementation <- igraph.match.arg(implementation)
-
-  if (implementation == "r.mle") {
-    power.law.fit.old(x, xmin, start, ...)
-  } else if (implementation == "plfit") {
-    if (is.null(xmin)) xmin <- -1
-    power.law.fit.new(x, xmin=xmin, force.continuous=force.continuous)
-  }
-}
-
-power.law.fit.old <- function(x, xmin=NULL, start=2, ...) {
-
-  if (length(x) == 0) {
-    stop("zero length vector")
-  }
-  if (length(x) == 1) {
-    stop("vector should be at least of length two")
-  }  
-
-  require(stats4)
-  
-  if (is.null(xmin)) { xmin <- min(x) }
-  
-  n <- length(x)
-  x <- x[ x >= xmin]
-  if (length(x) != n) {
-    n <- length(x)
-  }
-  
-#  mlogl <- function(alpha) {
-#    if (xmin > 1) {
-#      C <- 1/(1/(alpha-1)-sum(beta(1:(xmin-1), alpha)))
-#    } else {
-#      C <- alpha-1
-#    }
-#    -n*log(C)-sum(lbeta(x, alpha))
-#  }
-
-  mlogl <- function(alpha) {
-     C <- 1/sum( (xmin:10000)^-alpha )
-     -n*log(C)+alpha*sum(log(x))
-  }
-
-  alpha <- mle(mlogl, start=list(alpha=start), ...)
-
-  alpha
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/flow.R igraph-0.6.5/interfaces/R/igraph/R/flow.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/flow.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/flow.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,154 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-graph.mincut <- function(graph, source=NULL, target=NULL, capacity=NULL,
-                         value.only=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (is.null(capacity)) {
-    if ("capacity" %in% list.edge.attributes(graph)) {
-      capacity <- E(graph)$capacity
-    }
-  }
-  if (is.null(source) && !is.null(target) ||
-      is.null(target) && !is.null(source)) {
-    stop("Please give both source and target or neither")
-  }
-  if (!is.null(capacity)) {
-    capacity <- as.numeric(capacity)
-  }
-
-  value.only <- as.logical(value.only)
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  if (is.null(target) && is.null(source)) {
-    if (value.only) {
-      res <- .Call("R_igraph_mincut_value", graph, capacity,
-                   PACKAGE="igraph")
-    } else {
-      res <- .Call("R_igraph_mincut", graph, capacity,
-                   PACKAGE="igraph")
-      res$cut <- res$cut + 1
-      res$partition1 <- res$partition1 + 1
-      res$partition2 <- res$partition2 + 1
-      res
-    }
-  } else {
-    if (value.only) {
-      res <- .Call("R_igraph_st_mincut_value", graph,
-                   as.igraph.vs(graph, source)-1,
-                   as.igraph.vs(graph, target)-1, capacity,
-                   PACKAGE="igraph")
-    } else {
-      stop("Calculating minimum s-t cuts is not implemented yet")
-    }
-  }
-  res
-}
-
-vertex.connectivity <- function(graph, source=NULL, target=NULL, checks=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(source) && is.null(target)) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_vertex_connectivity", graph, as.logical(checks),
-          PACKAGE="igraph")
-  } else if (!is.null(source) && !is.null(target)) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_st_vertex_connectivity", graph, as.igraph.vs(graph, source)-1,
-          as.igraph.vs(graph, target)-1,
-          PACKAGE="igraph")
-  } else {
-    stop("either give both source and target or neither")
-  }
-}
-
-edge.connectivity <- function(graph, source=NULL, target=NULL, checks=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(source) && is.null(target)) {    
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_edge_connectivity", graph, as.logical(checks),
-          PACKAGE="igraph")
-  } else if (!is.null(source) && !is.null(target)) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_st_edge_connectivity", graph,
-          as.igraph.vs(graph, source)-1, as.igraph.vs(graph, target)-1,
-          PACKAGE="igraph")
-  } else {
-    stop("either give both source and target or neither")
-  }
-}
-
-edge.disjoint.paths <- function(graph, source, target) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_edge_disjoint_paths", graph,
-        as.igraph.vs(graph, source)-1, as.igraph.vs(graph, target)-1,
-        PACKAGE="igraph")
-}
-
-vertex.disjoint.paths <- function(graph, source=NULL, target=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_vertex_disjoint_paths", graph, as.igraph.vs(graph, source)-1,
-        as.igraph.vs(graph, target)-1,
-        PACKAGE="igraph")
-}
-
-graph.adhesion <- function(graph, checks=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_adhesion", graph, as.logical(checks),
-        PACKAGE="igraph")
-}
-
-graph.cohesion <- function(graph, checks=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_cohesion", graph, as.logical(checks),
-        PACKAGE="igraph")
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/foreign.R igraph-0.6.5/interfaces/R/igraph/R/foreign.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/foreign.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/foreign.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,450 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Reading foreign file formats
-###################################################################
-
-read.graph.toraw <- function(filename) {
-  if (is.character(filename)) {
-    filename <- file(filename, open="rb")
-  }
-  if (!isOpen(filename)) {
-    open(filename, open="rb")
-  }
-
-  tmpbufsize <- 20000
-  buffer <- tmpbuffer <- readBin(filename, what=raw(0), n=tmpbufsize)
-  while (length(tmpbuffer) == tmpbufsize) {
-    tmpbuffer <- readBin(filename, what=raw(0), n=tmpbufsize)
-    buffer <- c(buffer, tmpbuffer)
-  }
-  close(filename)
-  rm(tmpbuffer)
-  
-  buffer
-}
-
-write.graph.fromraw <- function(buffer, file) {
-
-  closeit <- FALSE
-  if (is.character(file)) {
-    file <- file(file, open="w+b")
-    closeit <- TRUE
-  }
-  
-  if (!isOpen(file)) {
-    file <- open(file)
-    closeit <- TRUE
-  }
-
-  writeBin(buffer, file)
-
-  if (closeit) {
-    close(file)
-  }
-
-  invisible(NULL)
-}
-
-read.graph <- function(file, format=c("edgelist", "pajek", "ncol", "lgl",
-                               "graphml", "dimacs", "graphdb", "gml", "dl"),
-                       ...) {
-
-  if (!is.character(file) || length(grep("://", file, fixed=TRUE)) > 0 ||
-      length(grep("~", file, fixed=TRUE)) > 0) {
-    buffer <- read.graph.toraw(file)
-    file <- tempfile()
-    write.graph.fromraw(buffer, file)
-  }
-
-  format <- igraph.match.arg(format)
-  res <- switch(format,
-                "pajek"=read.graph.pajek(file, ...),
-                "ncol"=read.graph.ncol(file, ...),
-                "edgelist"=read.graph.edgelist(file, ...),
-                "lgl"=read.graph.lgl(file, ...),
-                "graphml"=read.graph.graphml(file, ...),
-                "dimacs"=read.graph.dimacs(file, ...),
-                "graphdb"=read.graph.graphdb(file, ...),
-                "gml"=read.graph.gml(file, ...),
-                "dl"=read.graph.dl(file, ...),
-                stop(paste("Unknown file format:",format))
-                )
-  res
-}
-
-write.graph <- function(graph, file, format=c("edgelist", "pajek", "ncol", "lgl",
-                                       "graphml", "dimacs", "gml", "dot", "leda"), ...) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (!is.character(file) || length(grep("://", file, fixed=TRUE)) > 0 ||
-      length(grep("~", file, fixed=TRUE)) > 0) {
-    tmpfile <- TRUE
-    origfile <- file
-    file <- tempfile()
-  } else {
-    tmpfile <- FALSE
-  }
-  
-  format <- igraph.match.arg(format)
-  res <- switch(format,
-                "pajek"=write.graph.pajek(graph, file, ...),
-                "edgelist"=write.graph.edgelist(graph, file, ...),
-                "ncol"=write.graph.ncol(graph, file, ...),
-                "lgl"=write.graph.lgl(graph, file, ...),
-                "graphml"=write.graph.graphml(graph, file, ...),
-                "dimacs"=write.graph.dimacs(graph, file, ...),
-                "gml"=write.graph.gml(graph, file, ...),
-                "dot"=write.graph.dot(graph, file, ...),
-                "leda"=write.graph.leda(graph, file, ...),
-                stop(paste("Unknown file format:",format))
-                )
-
-  if (tmpfile) {
-    buffer <- read.graph.toraw(file)
-    write.graph.fromraw(buffer, origfile)
-  }
-  
-  invisible(res)
-}
-
-################################################################
-# Plain edge list format, not sorted
-################################################################
-
-read.graph.edgelist <- function(file, n=0,
-                                directed=TRUE, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (edgelist format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_edgelist", file,
-        as.numeric(n), as.logical(directed),
-        PACKAGE="igraph")
-}
-
-write.graph.edgelist <- function(graph, file, ...) {
-  
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (edgelist format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_edgelist", graph, file,
-        PACKAGE="igraph")
-}
-
-################################################################
-# NCOL and LGL formats, quite simple
-################################################################
-
-read.graph.ncol <- function(file, predef=character(0), names=TRUE,
-                            weights=c("auto", "yes", "no"),
-                            directed=FALSE, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (NCOL format)")
-  }
-  weights <- switch(igraph.match.arg(weights), "no"=0, "yes"=1, "auto"=2)
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_ncol", file, as.character(predef),
-        as.logical(names), as.numeric(weights), as.logical(directed),
-        PACKAGE="igraph")
-}
-
-write.graph.ncol <- function(graph, file, 
-                             names="name", weights="weight", ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (NCOL format)")
-  }
-  names <- as.character(names)
-  weights <- as.character(weights)
-  if (length(names)==0 || ! names %in% list.vertex.attributes(graph)) { names <- NULL }
-  if (length(weights)==0 || ! weights %in% list.edge.attributes(graph)) { weights <- NULL }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_ncol", graph, file,
-        names, weights,
-        PACKAGE="igraph")
-}  
-
-read.graph.lgl <- function(file, names=TRUE,
-                           weights=c("auto", "yes", "no"),
-                           directed=FALSE,
-                            ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (LGL format)")
-  }
-  weights <- switch(igraph.match.arg(weights), "no"=0, "yes"=1, "auto"=2)
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_lgl", file,
-        as.logical(names), as.numeric(weights), as.logical(directed),
-        PACKAGE="igraph")
-}
-
-write.graph.lgl <- function(graph, file, 
-                            names="name", weights="weight",
-                            isolates=FALSE, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (LGL format)")
-  }
-  names <- as.character(names)
-  weights <- as.character(weights)
-  if (length(names)==0 || ! names %in% list.vertex.attributes(graph)) { names <- NULL }
-  if (length(weights)==0 || ! weights %in% list.edge.attributes(graph)) { weights <- NULL }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_lgl", graph, file,
-        names, weights, as.logical(isolates),
-        PACKAGE="igraph")
-}  
-
-read.graph.pajek <- function(file, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (Pajek format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_read_graph_pajek", file,
-               PACKAGE="igraph")
-  if ("type" %in% list.vertex.attributes(res)) {
-    type <- as.logical(V(res)$type)
-    res <- remove.vertex.attribute(res, "type")
-    res <- set.vertex.attribute(res, "type", value=type)
-  }
-  res
-}
-
-write.graph.pajek <- function(graph, file, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (Pajek format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_pajek", graph, file,
-        PACKAGE="igraph")
-}
-
-read.graph.dimacs <- function(file, directed=TRUE, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (DIMACS format)")
-  }
-  res <- .Call("R_igraph_read_graph_dimacs", file, as.logical(directed),
-               PACKAGE="igraph")
-  if (res[[1]][1] == "max") {
-    graph <- res[[2]]
-    graph <- set.graph.attribute(graph, "problem", res[[1]])
-    graph <- set.graph.attribute(graph, "source", res[[3]])
-    graph <- set.graph.attribute(graph, "target", res[[4]])
-    E(graph)$capacity <- res[[5]]
-    graph
-  } else if (res[[1]][1] == "edge") {
-    graph <- res[[2]]
-    graph <- set.graph.attribute(graph, "problem", res[[1]])
-    V(graph)$label <- res[[3]]
-    graph
-  }
-}
-
-write.graph.dimacs <- function(graph, file,
-                               source=NULL, target=NULL, capacity=NULL, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (DIMACS format)")
-  }
-  if (is.null(source)) {
-    source <- get.graph.attribute(graph, "source")
-  }
-  if (is.null(target)) {
-    target <- get.graph.attribute(graph, "target")
-  }
-  if (is.null(capacity)) {
-    capacity <- E(graph)$capacity
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_dimacs", graph, file, as.numeric(source),
-        as.numeric(target), as.numeric(capacity),
-        PACKAGE="igraph")
-}
-
-################################################################
-# GraphML
-################################################################
-
-read.graph.graphml <- function(file, index=0, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (GraphML format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_graphml", file, as.numeric(index),
-        PACKAGE="igraph")
-}
-
-write.graph.graphml <- function(graph, file, ...) {
-
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (GraphML format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_graphml", graph, file,
-        PACKAGE="igraph")
-}
-
-################################################################
-# GML
-################################################################
-
-read.graph.gml <- function(file, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (GML format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_gml", file,
-        PACKAGE="igraph")
-}
-
-write.graph.gml <- function(graph, file, id=NULL, creator=NULL, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (GML format)")
-  }
-  if (!is.null(id)) {
-    id <- as.numeric(id)
-  }
-  if (!is.null(creator)) {
-    creator <- as.character(creator)
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_gml", graph, file, id, creator,
-        PACKAGE="igraph")
-}
-
-################################################################
-# UCINET DL
-################################################################
-
-read.graph.dl <- function(file, directed=TRUE, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (DL format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_dl", file, as.logical(directed),
-        PACKAGE="igraph")
-}  
-
-################################################################
-# Dot
-################################################################
-
-write.graph.dot <- function(graph, file, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (DOT format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_dot", graph, file,
-        PACKAGE="igraph")
-}
-
-################################################################
-# Download a file from the graph database for
-# isomorphic problems
-################################################################
-
-graph.graphdb <- function(url=NULL,
-                          prefix="iso", type="r001", nodes=NULL, pair="A", which=0,
-                          base="http://cneurocvs.rmki.kfki.hu/graphdb/gzip",
-                          compressed=TRUE, directed=TRUE) {
-  
-  if (is.null(nodes) && is.null(url)) {
-    stop("The `nodes' or the `url' argument must be non-null")
-  }
-
-  if (is.null(url)) {
-  
-    prefixes <- c("iso", "si6", "mcs10", "mcs30", "mcs50", "mcs70", "mcs90")
-    types <- c("r001", "r005", "r01", "r02", "m2D", "m2Dr2", "m2Dr4", "m2Dr6",
-               "m3D", "m3Dr2", "m3Dr4", "m3Dr6", "m4D", "m4Dr2", "m4Dr4",
-               "m4Dr6", "b03", "b03m", "b06", "b06m", "b09", "b09m")
-    sizecode <- if (nodes<=100) "s" else if (nodes<2000) "m" else "l" # "l" ????
-    typegroups <- c("rand", "rand", "rand", "rand",
-                    "m2D", "m2D", "m2D", "m2D",
-                    "m2D", "m3D", "m3D", "m3D",
-                    "m4D", "m4D", "m4D", "m4D",
-                    "bvg", "bvg", "bvg", "bvg", "bvg", "bvg")
-    typegroup <- typegroups[which(types==type)]
-    
-    if (!prefix %in% prefixes) {
-      stop("Invalid prefix!")
-    }
-    if (!type %in% types) {
-      stop("Invalid graph type!")
-    }
-    suff <- if (compressed) ".gz" else ""
-    filename <- paste(sep="", base, "/", prefix, "/", typegroup, "/", type, "/",
-                      prefix, "_", type, "_", sizecode, nodes,
-                      ".", pair, formatC(which, width=2, flag="0"), suff)
-  } else {
-    filename <- url
-  }
-  
-  ## ok, we have the filename
-
-  f <- try(gzcon(file(filename, open="rb")))
-  if (inherits(f, "try-error")) {
-    stop(paste("Cannot open URL:", filename));
-  }
-
-  buffer <- read.graph.toraw(f)
-  f <- tempfile()
-  write.graph.fromraw(buffer, f)
-
-  .Call("R_igraph_read_graph_graphdb", f, as.logical(directed),
-        PACKAGE="igraph")
-  
-}
-
-read.graph.graphdb <- function(file, directed=TRUE, ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to read.graph (GraphDB format)")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_read_graph_graphdb", file, as.logical(directed),
-        PACKAGE="igraph")
-}
-
-write.graph.leda <- function(graph, file, vertex.attr=NULL, edge.attr=NULL,
-                             ...) {
-  if (length(list(...))>0) {
-    stop("Unknown arguments to write.graph (LEDA format)")
-  }
-  if (!is.null(vertex.attr)) { vertex.attr <- as.character(vertex.attr) }
-  if (!is.null(edge.attr))   { edge.attr   <- as.character(edge.attr)   }
-  on.exit(.Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_write_graph_leda", graph, file, vertex.attr, edge.attr,
-        PACKAGE="igraph")
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/games.R igraph-0.6.5/interfaces/R/igraph/R/games.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/games.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/games.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,465 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-ba.game <- function(n, power=1, m=NULL, out.dist=NULL, out.seq=NULL,
-                    out.pref=FALSE, zero.appeal=1,
-                    directed=TRUE, algorithm=c("psumtree",
-                                     "psumtree-multiple", "bag"),
-                    start.graph=NULL) {
-
-  if (!is.null(start.graph) && !is.igraph(start.graph)) {
-    stop("`start.graph' not an `igraph' object")
-  }
-  
-  # Checks
-  if (! is.null(out.seq) && (!is.null(m) || !is.null(out.dist))) {
-    warning("if `out.seq' is given `m' and `out.dist' should be NULL")
-    m <- out.dist <- NULL
-  }
-  if (is.null(out.seq) && !is.null(out.dist) && !is.null(m)) {
-    warning("if `out.dist' is given `m' will be ignored")
-    m <- NULL
-  }
-  if (!is.null(m) && m==0) {
-    warning("`m' is zero, graph will be empty")
-  }
-  if (power < 0) {
-    warning("`power' is negative")
-  }
-  
-  if (is.null(m) && is.null(out.dist) && is.null(out.seq)) {
-    m <- 1
-  }
-  
-  n <- as.numeric(n)
-  power <- as.numeric(power)
-  if (!is.null(m)) { m <- as.numeric(m) }
-  if (!is.null(out.dist)) { out.dist <- as.numeric(out.dist) }
-  if (!is.null(out.seq)) { out.seq <- as.numeric(out.seq) }
-  out.pref <- as.logical(out.pref)
-
-  if (!is.null(out.dist)) {
-    nn <- if (is.null(start.graph)) n else n-vcount(start.graph)
-    out.seq <- as.numeric(sample(0:(length(out.dist)-1), nn,
-                                 replace=TRUE, prob=out.dist))
-  }
-
-  if (is.null(out.seq)) {
-    out.seq <- numeric()
-  }
-
-  algorithm <- igraph.match.arg(algorithm)
-  algorithm1 <- switch(algorithm,
-                       "psumtree"=1, "psumtree-multiple"=2,
-                       "bag"=0)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_barabasi_game", n, power, m, out.seq, out.pref,
-               zero.appeal, directed, algorithm1, start.graph,
-               PACKAGE="igraph")
-  
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Barabasi graph"
-    res$power <- power
-    res$m <- m
-    res$zero.appeal <- zero.appeal
-    res$algorithm <- algorithm
-  }
-
-  res
-}
-
-barabasi.game <- ba.game
-
-erdos.renyi.game <- function(n, p.or.m, type=c("gnp", "gnm"),
-                             directed=FALSE, loops=FALSE, ...) {
-  
-  type <- igraph.match.arg(type)
-  type1 <- switch(type, "gnp"=0, "gnm"=1)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_erdos_renyi_game", as.numeric(n), as.numeric(type1),
-               as.numeric(p.or.m), as.logical(directed), as.logical(loops),
-               PACKAGE="igraph")
-
-  if (getIgraphOpt("add.params")) {
-    res$name <- sprintf("Erdos renyi (%s) graph", type)
-    res$type <- type
-    res$loops <- loops
-    if (type=="gnp") { res$p <- p.or.m }
-    if (type=="gnm") { res$m <- p.or.m }
-  }
-  res
-}
-
-random.graph.game <- erdos.renyi.game
-
-degree.sequence.game <- function(out.deg, in.deg=NULL,
-                                 method=c("simple", "vl",
-                                   "simple.no.multiple"),
-                                 ...) {
-
-  method <- igraph.match.arg(method)
-  method1 <- switch(method, "simple"=0, "vl"=1, "simple.no.multiple"=2)
-  if (!is.null(in.deg)) { in.deg <- as.numeric(in.deg) }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_degree_sequence_game", as.numeric(out.deg),
-               in.deg, as.numeric(method1),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Degree sequence random graph"
-    res$method <- method
-  }
-  res
-}
-
-growing.random.game <- function(n, m=1, directed=TRUE, citation=FALSE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_growing_random_game", as.numeric(n), as.numeric(m),
-               as.logical(directed), as.logical(citation),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Growing random graph"
-    res$m <- m
-    res$citation <- citation
-  }
-  res
-}
-
-aging.prefatt.game <- function(n, pa.exp, aging.exp, m=NULL, aging.bin=300,
-                               out.dist=NULL, out.seq=NULL,
-                               out.pref=FALSE, directed=TRUE,
-                               zero.deg.appeal=1, zero.age.appeal=0,
-                               deg.coef=1, age.coef=1,
-                               time.window=NULL) {
-  # Checks
-  if (! is.null(out.seq) && (!is.null(m) || !is.null(out.dist))) {
-    warning("if `out.seq' is given `m' and `out.dist' should be NULL")
-    m <- out.dist <- NULL
-  }
-  if (is.null(out.seq) && !is.null(out.dist) && !is.null(m)) {
-    warning("if `out.dist' is given `m' will be ignored")
-    m <- NULL
-  }
-  if (!is.null(out.seq) && length(out.seq) != n) {
-    stop("`out.seq' should be of length `n'")
-  }
-  if (!is.null(out.seq) && min(out.seq)<0) {
-    stop("negative elements in `out.seq'");
-  }
-  if (!is.null(m) && m<0) {
-    stop("`m' is negative")
-  }
-  if (!is.null(time.window) && time.window <= 0) {
-    stop("time window size should be positive")
-  }
-  if (!is.null(m) && m==0) {
-    warning("`m' is zero, graph will be empty")
-  }
-  if (pa.exp < 0) {
-    warning("preferential attachment is negative")
-  }
-  if (aging.exp > 0) {
-    warning("aging exponent is positive")
-  }
-  if (zero.deg.appeal <=0 ) {
-    warning("initial attractiveness is not positive")
-  }
-
-  if (is.null(m) && is.null(out.dist) && is.null(out.seq)) {
-    m <- 1
-  }
-  
-  n <- as.numeric(n)
-  if (!is.null(m)) { m <- as.numeric(m) }
-  if (!is.null(out.dist)) { out.dist <- as.numeric(out.dist) }
-  if (!is.null(out.seq)) { out.seq <- as.numeric(out.seq) }
-  out.pref <- as.logical(out.pref)
-
-  if (!is.null(out.dist)) {
-    out.seq <- as.numeric(sample(0:(length(out.dist)-1), n,
-                                 replace=TRUE, prob=out.dist))
-  }
-
-  if (is.null(out.seq)) {
-    out.seq <- numeric()
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- if (is.null(time.window)) {
-    .Call("R_igraph_barabasi_aging_game", as.numeric(n),
-          as.numeric(pa.exp), as.numeric(aging.exp),
-          as.numeric(aging.bin), m, out.seq,
-          out.pref, as.numeric(zero.deg.appeal), as.numeric(zero.age.appeal),
-          as.numeric(deg.coef), as.numeric(age.coef), directed, 
-          PACKAGE="igraph")
-  } else {
-    .Call("R_igraph_recent_degree_aging_game", as.numeric(n),
-          as.numeric(pa.exp), as.numeric(aging.exp),
-          as.numeric(aging.bin), m, out.seq, out.pref, as.numeric(zero.deg.appeal),
-          directed,
-          time.window,
-          PACKAGE="igraph")
-  }
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Aging Barabasi graph"
-    res$pa.exp <- pa.exp
-    res$aging.exp <- aging.exp
-    res$m <- m
-    res$aging.bin <- aging.bin
-    res$out.pref <- out.pref
-    res$zero.deg.appeal <- zero.deg.appeal
-    res$zero.age.appeal <- zero.age.appeal
-    res$deg.coef <- deg.coef
-    res$age.coef <- age.coef
-    res$time.window <- if (is.null(time.window)) Inf else time.window
-  }
-  res
-}
-
-aging.barabasi.game <- aging.ba.game <- aging.prefatt.game
-
-callaway.traits.game <- function(nodes, types, edge.per.step=1,
-                                 type.dist=rep(1, types),
-                                 pref.matrix=matrix(1, types, types),
-                                 directed=FALSE) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_callaway_traits_game", as.double(nodes),
-               as.double(types), as.double(edge.per.step),
-               as.double(type.dist), matrix(as.double(pref.matrix), types,
-                                            types),
-               as.logical(directed),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Trait-based Callaway graph"
-    res$types <- types
-    res$edge.per.step <- edge.per.step
-    res$type.dist <- type.dist
-    res$pref.matrix <- pref.matrix
-  }
-  res
-}
-
-establishment.game <- function(nodes, types, k=1, type.dist=rep(1, types),
-                               pref.matrix=matrix(1, types, types),
-                               directed=FALSE) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_establishment_game", as.double(nodes),
-               as.double(types), as.double(k), as.double(type.dist),
-               matrix(as.double(pref.matrix), types, types),
-               as.logical(directed),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Trait-based growing graph"
-    res$types <- types
-    res$k <- k
-    res$type.dist <- type.dist
-    res$pref.matrix <- pref.matrix
-  }
-  res
-}
-
-grg.game <- function(nodes, radius, torus=FALSE, coords=FALSE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_grg_game", as.double(nodes), as.double(radius),
-               as.logical(torus), as.logical(coords),
-               PACKAGE="igraph")
-  if (coords) {
-    V(res[[1]])$x <- res[[2]]
-    V(res[[1]])$y <- res[[3]]
-  }
-  if (getIgraphOpt("add.params")) {
-    res[[1]]$name <- "Geometric random graph"
-    res[[1]]$radius <- radius
-    res[[1]]$torus <- torus
-  }
-  res[[1]]
-}
-
-preference.game <- function(nodes, types, type.dist=rep(1, types),
-                            fixed.sizes=FALSE,
-                            pref.matrix=matrix(1, types, types),
-                            directed=FALSE, loops=FALSE) {
-
-  if (nrow(pref.matrix) != types || ncol(pref.matrix) != types) {
-    stop("Invalid size for preference matrix")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_preference_game", as.double(nodes),
-               as.double(types),
-               as.double(type.dist), as.logical(fixed.sizes),
-               matrix(as.double(pref.matrix), types, types),
-               as.logical(directed), as.logical(loops),
-               PACKAGE="igraph")
-  V(res[[1]])$type <- res[[2]]+1
-  if (getIgraphOpt("add.params")) {
-    res[[1]]$name <- "Preference random graph"
-    res[[1]]$types <- types
-    res[[1]]$type.dist <- type.dist
-    res[[1]]$fixed.sizes <- fixed.sizes
-    res[[1]]$pref.matrix <- pref.matrix
-    res[[1]]$loops <- loops
-  }
-  res[[1]]
-}
-
-asymmetric.preference.game <- function(nodes, types,
-                                  type.dist.matrix=matrix(1, types,types),
-                                  pref.matrix=matrix(1, types, types),
-                                  loops=FALSE) {
-  
-  if (nrow(pref.matrix) != types || ncol(pref.matrix) != types) {
-    stop("Invalid size for preference matrix")
-  }
-  if (nrow(type.dist.matrix) != types || ncol(type.dist.matrix) != types) {
-    stop("Invalid size for type distribution matrix")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_asymmetric_preference_game",
-               as.double(nodes), as.double(types),
-               matrix(as.double(type.dist.matrix), types, types),
-               matrix(as.double(pref.matrix), types, types),
-               as.logical(loops),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Asymmetric preference random graph"
-    res$types <- types
-    res$type.dist.matrix <- type.dist.matrix
-    res$pref.matrix <- pref.matrix
-    res$loops <- loops
-  }
-}
-
-connect.neighborhood <- function(graph, order, mode=c("all", "out", "in", "total")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3, "total"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_connect_neighborhood", graph, as.numeric(order),
-        as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-rewire.edges <- function(graph, prob, loops=FALSE, multiple=FALSE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_rewire_edges", graph, as.numeric(prob), as.logical(loops),
-        as.logical(multiple),
-        PACKAGE="igraph")
-}
-
-watts.strogatz.game <- function(dim, size, nei, p, loops=FALSE,
-                                multiple=FALSE) {
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_watts_strogatz_game", as.numeric(dim),
-               as.numeric(size), as.numeric(nei), as.numeric(p),
-               as.logical(loops), as.logical(multiple),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Watts-Strogatz random graph"
-    res$dim <- dim
-    res$size <- size
-    res$nei <- nei
-    res$p <- p
-    res$loops <- loops
-    res$multiple <- multiple
-  }
-  res
-}
-
-lastcit.game <- function(n, edges=1, agebins=n/7100, pref=(1:(agebins+1))^-3,
-                         directed=TRUE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_lastcit_game", as.numeric(n), as.numeric(edges),
-               as.numeric(agebins),
-               as.numeric(pref), as.logical(directed),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Random citation graph based on last citation"
-    res$edges <- edges
-    res$agebins <- agebins
-  }
-  res
-}
-
-cited.type.game <- function(n, edges=1, types=rep(0, n),
-                            pref=rep(1, length(types)),
-                            directed=TRUE, attr=TRUE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_cited_type_game", as.numeric(n), as.numeric(edges),
-               as.numeric(types), as.numeric(pref), as.logical(directed),
-               PACKAGE="igraph")
-  if (attr) {
-    V(res)$type <- types
-  }
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Random citation graph (cited type)"
-    res$edges <- edges
-  }
-  res
-}
-
-citing.cited.type.game <- function(n, edges=1, types=rep(0, n),
-                                   pref=matrix(1, nrow=length(types),
-                                     ncol=length(types)),
-                                   directed=TRUE, attr=TRUE) {
-  pref <- structure(as.numeric(pref), dim=dim(pref))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_citing_cited_type_game", as.numeric(n),
-               as.numeric(types), pref, as.numeric(edges),
-               as.logical(directed),
-               PACKAGE="igraph")
-  if (attr) {
-    V(res)$type <- types
-  }
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Random citation graph (citing & cited type)"
-    res$edges <- edges
-  }
-  res
-}
-
-
-simple.interconnected.islands.game <- function(islands.n, islands.size, islands.pin, n.inter) {
-  
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call(	"R_igraph_simple_interconnected_islands_game", 
-		as.numeric(islands.n), 
-		as.numeric(islands.size),
-        	as.numeric(islands.pin), 
-		as.numeric(n.inter),
-        	PACKAGE="igraph")
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/hrg.R igraph-0.6.5/interfaces/R/igraph/R/hrg.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/hrg.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/hrg.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,529 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2011-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-hrg.fit <- function(graph, hrg=NULL, start=FALSE, steps=0) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(hrg)) { 
-    hrg <- list(left=c(), right=c(), prob=c(), edges=c(), 
-                vertices=c()) 
-  } 
-  hrg <- lapply(hrg[c("left","right","prob","edges","vertices")], 
-                as.numeric)
-  start <- as.logical(start)
-  steps <- as.integer(steps)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_hrg_fit", graph, hrg, start, steps,
-               PACKAGE="igraph")
-  
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$names <- V(graph)$name
-  }
-
-  class(res) <- "igraphHRG"
-  res
-}
-
-hrg.consensus <- function(graph, hrg=NULL, start=FALSE, num.samples=10000) {
-  
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-
-  if (is.null(hrg)) {
-    hrg <- list(left=c(), right=c(), prob=c(), edges=c(), vertices=c())
-  }
-  hrg <- lapply(hrg[c("left","right","prob","edges","vertices")], as.numeric)
-  start <- as.logical(start)
-  num.samples <- as.integer(num.samples)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_hrg_consensus", graph, hrg, start, num.samples,
-        PACKAGE="igraph")
-  res$parents <- res$parents + 1
-  res <- list(consensus=list(parents=res$parents, weights=res$weights),
-              hrg=res$hrg)
-  class(res$consensus) <- "igraphHRGConsensus"
-  class(res$hrg) <- "igraphHRG"
-
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$hrg$names <- V(graph)$name
-    res$consensus$names <- V(graph)$name
-  }
-  
-  res
-}
-
-hrg.predict <- function(graph, hrg=NULL, start=FALSE, num.samples=10000,
-                        num.bins=25) {
-  
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(hrg)) { 
-    hrg <- list(left=c(), right=c(), prob=c(), edges=c(), 
-                vertices=c()) 
-  } 
-  hrg <- lapply(hrg[c("left","right","prob","edges","vertices")], 
-                as.numeric)
-  start <- as.logical(start)
-  num.samples <- as.integer(num.samples)
-  num.bins <- as.integer(num.bins)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_hrg_predict", graph, hrg, start, num.samples,
-               num.bins, PACKAGE="igraph")
-  res$edges <- matrix(res$edges, ncol=2, byrow=TRUE)
-  class(res$hrg) <- "igraphHRG"
-  res
-}
-
-as.igraph <- function(x, ...)
-  UseMethod("as.igraph")
-
-as.igraph.igraphHRG <- function(x, ...) {
-  ovc <- length(x$left)+1L
-  ivc <- ovc-1L
-  ll <- ifelse(x$left  < 0, -x$left  + ovc, x$left  + 1)
-  rr <- ifelse(x$right < 0, -x$right + ovc, x$right + 1)
-  edges <- c(rbind(seq_len(ivc)+ovc, ll), rbind(seq_len(ivc)+ovc, rr))
-  res <- graph(edges)
-  
-  V(res)$name <- c(if (!is.null(x$names)) x$names else as.character(1:ovc),
-                   paste(sep="", "g", 1:ivc))
-  V(res)$prob <- c(rep(NA, ovc), x$prob)
-  res$name <- "Fitted HRG"
-  res
-}
-
-buildMerges <- function(object) {
-
-  ## Build a merge matrix. This is done by a post-order
-  ## traversal of the tree.
-
-  S <- numeric()
-  vcount <- length(object$left)+1
-  nMerge <- vcount-1
-  merges <- matrix(0, nrow=vcount-1, ncol=3)
-  mptr <- 1
-  S[length(S)+1] <- -1
-  prev <- NULL
-  while (length(S) != 0) {
-    curr <- S[length(S)]
-    ## coming from parent? going left if possible.
-    if (is.null(prev) ||
-        (prev < 0 && object$left[-prev] == curr) ||
-        (prev < 0 && object$right[-prev] == curr)) {
-      if (curr < 0) { S <- c(S, object$left[-curr]) }
-    ## coming from left child? going right
-    } else if (curr < 0 && object$left[-curr] == prev) {
-      S <- c(S, object$right[-curr])
-    ## coming from right child? going up
-    } else {
-      if (curr < 0) {
-        merges[mptr,] <- c(object$left[-curr], object$right[-curr], curr)
-        mptr <- mptr + 1
-      }
-      S <- S[-length(S)]
-    }
-    prev <- curr
-  }
-  merges
-} 
-
-as.dendrogram.igraphHRG <- function(object, hang=0.01, ...) {
-
-  nMerge <- length(object$left)
-  merges <- buildMerges(object)
-  
-  .memberDend <- function(x) {
-    r <- attr(x,"x.member")
-    if(is.null(r)) {
-      r <- attr(x,"members")
-      if(is.null(r)) r <- 1:1
-    }
-    r
-  }
-  
-  oHgt <- 1:nrow(merges)
-  hMax <- oHgt[length(oHgt)]
-  mynames <- if (is.null(object$names)) 1:(nMerge+1) else object$names
-  z <- list()
-  
-  for (k in 1:nMerge) {
-    x <- merges[k,1:2]
-    if (any(neg <- x >= 0)) {
-      h0 <- if (hang < 0) 0 else max(0, oHgt[k] - hang * hMax)
-    }
-    if (all(neg)) {                     # two leaves
-      zk <- as.list(x+1)
-      attr(zk, "members") <- 2L
-      attr(zk, "midpoint") <- 1/2       # mean( c(0,1) )
-      objlabels <- mynames[x+1]
-      attr(zk[[1]], "label") <- objlabels[1]
-      attr(zk[[2]], "label") <- objlabels[2]
-      attr(zk[[1]], "members") <- attr(zk[[2]], "members") <- 1L
-      attr(zk[[1]], "height") <- attr(zk[[2]], "height") <- h0
-      attr(zk[[1]], "leaf") <- attr(zk[[2]], "leaf") <- TRUE
-    } else if (any(neg)) {              # one leaf, one node
-      X <- paste(sep="", "g", -x)
-      isL <- x[1] >= 0
-      zk <- if (isL) list(x[1]+1, z[[X[2]]]) else list(z[[X[1]]], x[2]+1)
-      attr(zk, "members") <- attr(z[[X[1+isL]]], "members") + 1L
-      attr(zk, "midpoint") <-
-        (.memberDend(zk[[1]]) + attr(z[[X[1+isL]]], "midpoint"))/2
-      attr(zk[[2 - isL]], "members") <- 1L
-      attr(zk[[2 - isL]], "height") <- h0
-      attr(zk[[2 - isL]], "label") <- mynames[x[2 - isL]+1]
-      attr(zk[[2 - isL]], "leaf") <- TRUE
-    } else {                            #two nodes
-      X <- paste(sep="", "g", -x)
-      zk <- list(z[[X[1]]], z[[X[2]]])
-      attr(zk, "members") <- attr(z[[X[1]]], "members") +
-        attr(z[[X[2]]], "members")
-      attr(zk, "midpoint") <- (attr(z[[X[1]]], "members") +
-                               attr(z[[X[1]]], "midpoint") +
-                               attr(z[[X[2]]], "midpoint"))/2
-    }
-    attr(zk, "height") <- oHgt[k]
-    z[[k <- paste(sep="", "g", -merges[k,3])]] <- zk
-  }
-  z <- z[[k]]
-  class(z) <- "dendrogram"
-  z
-}
-
-as.hclust.igraphHRG <- function(x, ...) {
-  merge3 <- buildMerges(x)
-
-  ## We need to rewrite the merge matrix, because hclust assumes
-  ## that group ids are assigned in the order of the merges
-  map <- order(-merge3[,3])
-  
-  merge <- merge3[,1:2]
-  gs <- which(merge < 0)
-  merge[ gs] <- map[ -merge[gs] ]
-  merge[-gs] <- -merge[-gs]-1
-
-  ## To get the ordering, we need to recode the merge matrix again,
-  ## without using group ids. Here the right node is merged _into_
-  ## the left node.
-  map2 <- numeric(nrow(merge))
-  mergeInto <- merge
-  for (i in 1:nrow(merge)) {
-    mr <- mergeInto[i,]
-    mr[mr > 0] <- -map2[mr[mr>0]]
-    mergeInto[i,] <- -mr
-    map2[i] <- -mr[1]
-  }
-  n <- nrow(merge)+1
-  hcass <- .Fortran(stats:::C_hcass2, n=as.integer(n),
-                    ia=as.integer(mergeInto[,1]),
-                    ib=as.integer(mergeInto[,2]),
-                    order=integer(n), iia=integer(n), iib=integer(n),
-                    PACKAGE="stats")
-                    
-
-  mynames <- if (is.null(x$names)) 1:n else x$names
-  res <- list(merge=merge, height=1:nrow(merge), order=hcass$order,
-              labels=mynames, method=NA_character_,
-              dist.method=NA_character_)
-  class(res) <- "hclust"
-  res  
-}
-
-asPhylo.igraphHRG <- function(x, ...) {
-  require(ape, quietly=TRUE)
-
-  ovc <- length(x$left)+1L
-  ivc <- ovc-1L
-  ll <- ifelse(x$left  < 0, -x$left  + ovc, x$left  + 1)
-  rr <- ifelse(x$right < 0, -x$right + ovc, x$right + 1)
-  edge <- matrix(rbind(seq_len(ivc)+ovc, ll, seq_len(ivc)+ovc, rr),
-                 ncol=2, byrow=TRUE)
-
-  edge.length <- rep(0.5, nrow(edge))
-  labels <- if (is.null(x$names)) 1:ovc else x$names
-  obj <- list(edge=edge, edge.length=edge.length/2, tip.label=labels,
-              Nnode=ivc)
-  class(obj) <- "phylo"
-  reorder(obj)
-}
-
-dendPlot.igraphHRG <- function(x, mode=getIgraphOpt("dend.plot.type"), ...) {
-
-  if (mode=="auto") {
-    value <- tryCatch(suppressWarnings(library("ape", character.only=TRUE,
-                                               logical.return=TRUE,
-                                               warn.conflicts=FALSE,
-                                               quietly=TRUE,
-                                               pos="package:base")),
-                      error=function(e) e)
-    mode <- if (value) "phylo" else "hclust"
-  }
-
-  if (mode=="hclust") {
-    hrgPlotHclust(x, ...)
-  } else if (mode=="dendrogram") {
-    hrgPlotDendrogram(x, ...)
-  } else if (mode=="phylo") {
-    hrgPlotPhylo(x, ...)
-  }
-}
-
-hrgPlotHclust <- function(x, rect=0, colbar=rainbow(rect), hang=.01,
-                          ann=FALSE, main="", sub="", xlab="", ylab="",
-                          ...) {
-  hc <- as.hclust(x)
-  ret <- plot(hc, hang=hang, ann=ann, main=main, sub=sub, xlab=xlab,
-              ylab=ylab, ...)
-  if (rect > 0) {
-    rect.hclust(hc, k=rect, border=colbar)
-  }
-  invisible(ret)
-}
-
-hrgPlotDendrogram <- function(x, ...) {
-  plot(as.dendrogram(x), ...)
-}
-
-hrgPlotPhylo <- function(x, colbar=rainbow(11, start=.7, end=.1),
-                         edge.color=NULL, use.edge.length=FALSE, ...) {
-  vc <- length(x$left)+1
-  phy <- asPhylo(x)
-  br <- seq(0,1,length=length(colbar)) ; br[1] <- -1
-  cc <- as.integer(cut(x$prob[phy$edge[,1] - vc], breaks=br))
-  if (is.null(edge.color)) { edge.color <- colbar[cc] }
-  plot(phy, edge.color=edge.color, use.edge.length=use.edge.length, ...)
-}
-
-print.igraphHRG <- function(x, type=c("auto", "tree", "plain"),
-                            level=3, ...) {
-
-  type <- igraph.match.arg(type)
-  if (type=="auto") {
-    type <- if (length(x$left <= 100)) "tree" else "plain"
-  }
-  if (type=="tree") {
-    return(print1.igraphHRG(x, level=level, ...))
-  } else {
-    return(print2.igraphHRG(x, ...))
-  }
-}
-
-print1.igraphHRG <- function(x, level=3, ...) {
-  cat(sep="", "Hierarchical random graph, at level ", level, ":\n")
-
-  ## Depth of printed top of the dendrogram
-  .depth <- function(b, l) {
-    l[2] <- max(l[2], nchar(format(x$prob[b], digits=2)))
-    if (l[1]==level) { return(l) }
-    if (x$left[b] < 0 && x$right[b] < 0) {
-      l1 <- .depth(-x$left[b], c(l[1]+1, l[2]))
-      l2 <- .depth(-x$right[b], c(l[1]+1, l[2]))
-      return(pmax(l1,l2))
-    }
-    if (x$left[b] < 0)  { return(.depth(-x$left[b],  c(l[1]+1, l[2]))) }
-    if (x$right[b] < 0) { return(.depth(-x$right[b], c(l[1]+1, l[2]))) }
-    return(l)
-  }
-  cs <- .depth(1, c(1, 0))
-  pw <- cs[2]
-  cs <- cs[1] * 3
-  vw <- nchar(as.character(length(x$left)+1))
-  sp <- paste(collapse="", rep(" ", cs+pw+2+2))
-  nn <- if (is.null(x$names)) seq_len(length(x$left)+1) else x$names
-  
-  ## Function to collect all individual vertex children
-  .children <- function(b) {
-    res <- c()
-    if (x$left[b]  < 0) {
-      res <- c(res, .children(-x$left[b]))
-    } else {
-      res <- c(x$left[b]+1, res)
-    }
-    if (x$right[b] < 0) {
-      res <- c(res, .children(-x$right[b]))
-    } else {
-      res <- c(x$right[b]+1, res)
-    }
-    return(res)
-  }
-
-  ## Recursive printing
-  .plot <- function(b, l, ind = "") {
-    if (b != 1) {
-      he <- format(paste(sep="", ind, "'- g", b), width=cs)
-      ind <- paste("  ", ind)
-    } else {
-      he <- format(paste(sep="", ind, "g", b), width=cs)
-    }
-    ## whether to go left and/or right
-    gol <- x$left[b]  < 0 && l < level
-    gor <- x$right[b] < 0 && l < level
-
-    ## the children to print
-    ch1 <- character()
-    if (!gol && x$left[b] < 0) {
-      ch1 <- c(ch1, paste(sep="", "g", -x$left[b]))
-    }
-    if (!gor && x$right[b] < 0) {
-      ch1 <- c(ch1, paste(sep="", "g", -x$right[b]))
-    }
-    ch2 <- numeric()
-    if (!gol) {
-      if (x$left[b]  <  0) { ch2 <- c(ch2, .children(-x$left[b])) }
-      if (x$left[b]  >= 0) { ch2 <- c(ch2, x$left[b] + 1) }
-    }
-    if (!gor) {
-      if (x$right[b] <  0) { ch2 <- c(ch2, .children(-x$right[b])) }
-      if (x$right[b] >= 0) { ch2 <- c(ch2, x$right[b] + 1) }
-    }
-
-    ## print this line
-    ch2 <- as.character(nn[ch2])
-    lf <- gsub(" ", "x", format(ch2, width=vw), fixed=TRUE)
-    lf <- paste(collapse=" ", lf)
-    lf <- strwrap(lf, width=getOption("width") - cs - pw - 3 - 2)
-    lf <- gsub("x", " ", lf, fixed=TRUE)
-    if (length(lf) > 1) {
-      lf <- c(lf[1], paste(sp, lf[-1]))
-      lf <- paste(collapse="\n", lf)
-    }
-    op <- paste(sep="", format(he, width=cs),
-                " p=", format(x$prob[b], digits=2, width=pw, justify="left"),
-                "  ", paste(collapse=" ", lf))
-    cat(op, fill=TRUE)
-
-    ## recursive call
-    if (x$left[b]  < 0 && l < level) .plot(-x$left[b],  l+1, ind)
-    if (x$right[b] < 0 && l < level) .plot(-x$right[b], l+1, ind)
-  }
-
-  ## Do it
-  if (length(x$left) > 0) .plot(b=1, l=1)
-
-  invisible(x)
-}
-
-print2.igraphHRG <- function(x, ...) {
-  cat("Hierarchical random graph:\n")
-  bw <- ceiling(log10(length(x$left)+1))+1
-  p <- format(x$prob, digits=1)
-  pw <- 4 + max(nchar(p))
-  nn <- if (is.null(x$names)) seq_len(length(x$left)+1) else x$names
-  op <- sapply(seq_along(x$left), function(i) {
-    lc <- if (x$left[i] < 0) {
-      paste(sep="", "g", -x$left[i])
-    } else {
-      nn[x$left[i]+1]
-    }
-    rc <- if (x$right[i] < 0) {
-      paste(sep="", "g", -x$right[i])
-    } else {
-      nn[x$right[i]+1]
-    }
-    paste(sep="", format(paste(sep="", "g", i), width=bw),
-          format(paste(sep="", " p=", p[i]), width=pw),
-          "-> ", lc, " ", rc)
-  })
-  op <- format(op, justify="left")
-  cat(op, sep="   ", fill=TRUE)
-  invisible(x)
-}
-
-# TODO: print as a tree
-
-print.igraphHRGConsensus <- function(x, ...) {
-  cat("HRG consensus tree:\n")
-  n <- length(x$parents) - length(x$weights)
-  mn <- if (is.null(x$names)) seq_len(n) else x$names
-  id <- c(mn, paste(sep="", "g", seq_along(x$weights)))
-  ch <- tapply(id, x$parents, c)[-1]   # first is zero
-  bw <- nchar(as.character(length(x$weights)))
-  vw <- max(nchar(id))
-  op <- sapply(seq_along(x$weights), function(i) {
-    mych <- format(ch[[i]], width=vw)
-    if (length(ch[[i]])*(vw+1) + bw + 4 > getOption("width")) {
-      mych <- gsub(" ", "x", mych, fixed=TRUE)
-      mych <- paste(collapse=" ", mych)
-      pref <- paste(collapse="", rep(" ", bw+5))
-      mych <- strwrap(mych, width=getOption("width") - bw - 4,
-                      initial="", prefix=pref)
-      mych <- gsub("x", " ", mych, fixed=TRUE)
-      mych <- paste(collapse="\n", mych)
-    } else {
-      mych <- paste(collapse=" ", mych)
-    }
-    paste(sep="", "g", format(i, width=bw), " -> ", mych)
-  })
-  if (max(nchar(op)) < (getOption("width")-4)/2) {
-    op <- format(op, justify="left")
-    cat(op, sep="   ", fill=TRUE)
-  } else {
-    cat(op, sep="\n")
-  }
-  
-  invisible(x)
-}
-
-"
-## How to print HRGs?
-
-B-1           p=0
-'- B-3        p=1  6
-   '- B-7     p=1  2
-      '- B-5  p=1  1 5
-'- B-6        p=1  7
-   '- B-2     p=1  4
-      '- B-4  p=1  3 8
-
-## The same at levels 1, 2 and 3:
-
-B-1  p=0  B-3 B-6 6 2 1 5 7 4 3 8
-
-B-1     p=0
-'+ B-3  p=1  B-7  6 2 1 5
-'+ B-6  p=1  B-2  7 4 3 8
-
-B-1        p=0
-'- B-3     p=1  6
-   '+ B-7  p=1  B-5 2 1 5
-'- B-6     p=1  7
-   '+ B-2  p=1  B-4 4 3 8
-
-## This can be tedious if the graph is big, as we always have n-1
-## internal nodes, we can restrict ourselves to (say) level 3 by default.
-
-## Another possibility is to order the lines according to the group ids.
-
-B-1  p=0  B-3 B-6
-B-2  p=1  B-4 4
-B-3  p=1  B-7 6
-B-4  p=1  3 8
-B-5  p=1  1 5
-B-6  p=1  B-2 7
-B-7  p=1  B-5 2
-
-"
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/indexing.R igraph-0.6.5/interfaces/R/igraph/R/indexing.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/indexing.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/indexing.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,238 +0,0 @@
-
-## IGraph library.
-## Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-## 334 Harvard street, Cambridge, MA 02139 USA
-
-## 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 2 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, write to the Free Software
-## Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-## 02110-1301 USA
-
-# Indexing of igraph graphs.
-#
-# Goals:
-# 1. flexible graph manipulation
-# 2. to be as close to the usual matrix and adjacency list semantics,
-#    as possible
-# 3. simple
-# 4. fast
-# 5. orthogonal
-#
-# Rules:
-# - [ is about the existence of the edges.
-# - [ can be used for weights as well, if the graph is weighted.
-# - [[ is about adjacent vertices, and essentially works as an
-#   adjacency list.
-#
-# Use cases:
-# - G[1,2]      is there an edge from vertex 1 to vertex 2?
-# - G[1,1:3]    are there edges from vertex 1 to vertices 1:3?
-# - G[1:2,1:3]  are there adges from vertices 1:2 to vertices 1:3?
-#               this returns a (possibly sparse) matrix.
-# - G[degree(G)==0,1:4]
-#               logical vectors work
-# - G[1,-1]     negative indices work
-#
-# - G[[1,]]     adjacent vertices of 1
-# - G[[,1]]     adjacent predessors of 1
-# - G[[degree(G),]]
-#               logical vectors work
-# - G[[-1,]]    negative indices work
-#
-# - G[1,2,attr="value"]
-#               query an edge attribute
-# - G[1:3,2,eid=TRUE]
-#               create an edge sequence
-
-
-`[.igraph` <- function(x, i, j, ..., from, to,
-                       sparse=getIgraphOpt("sparsematrices"),
-                       edges=FALSE, drop=TRUE,
-                       attr=if (is.weighted(x)) "weight" else NULL) {
-  ## TODO: make it faster, don't need the whole matrix usually
-
-  ################################################################
-  ## Argument checks
-  if ((!missing(from) || !missing(to)) &&
-      (!missing(i)    || !missing(j))) {
-    stop("Cannot give 'from'/'to' together with regular indices")
-  }
-  if ((!missing(from) &&  missing(to)) ||
-      ( missing(from) && !missing(to))) {
-    stop("Cannot give 'from'/'to' without the other")
-  }
-  if (!missing(from)) {
-    if ((!is.numeric(from) && !is.character(from)) || any(is.na(from))) {
-      stop("'from' must be a numeric or character vector without NAs")
-    }
-    if ((!is.numeric(to) && !is.character(to)) || any(is.na(to))) {
-      stop("'to' must be a numeric or character vector without NAs")
-    }
-    if (length(from) != length(to)) {
-      stop("'from' and 'to' must have the same length")
-    }
-  }
-
-  ##################################################################
-  
-  if (!missing(from)) {
-    res <- get.edge.ids(x, rbind(from, to), error=FALSE)
-    if (edges) {
-      ## nop
-    } else if (!is.null(attr)) {
-      if (any(res!=0)) {
-        res[res!=0] <- get.edge.attribute(x, attr, res[res!=0])
-      }
-    } else {
-      res <- as.logical(res)+0
-    }
-    res
-  } else if (missing(i) && missing(j)) {
-    get.adjacency(x, sparse=sparse, attr=attr, edges=edges)
-  } else if (missing(j)) {
-    get.adjacency(x, sparse=sparse, attr=attr, edges=edges)[i,,drop=drop]
-  } else if (missing(i)) {
-    get.adjacency(x, sparse=sparse, attr=attr, edges=edges)[,j,drop=drop]
-  } else {
-    get.adjacency(x, sparse=sparse, attr=attr, edges=edges)[i,j,drop=drop]
-  }
-}
-
-`[[.igraph` <- function(x, i, j, ..., directed=TRUE,
-                        edges=FALSE, exact=TRUE) {
-  ## TODO: make it faster, don't need the whole list usually
-  getfun <- if (edges) get.adjedgelist else get.adjlist
-  if (missing(i) && missing(j)) {
-    mode <- if (directed) "out" else "all"
-    getfun(x, mode=mode)
-  } else if (missing(j)) {
-    mode <- if (directed) "out" else "all"
-    getfun(x, mode=mode)[i]
-  } else if (missing(i)) {
-    mode <- if (directed) "in" else "all"
-    getfun(x, mode=mode)[j]
-  } else {
-    mode <- if (directed) "out" else "all"
-    i <- as.igraph.vs(x, i)
-    j <- as.igraph.vs(x, j)
-    if (!edges) {
-      lapply(getfun(x, mode=mode)[i], intersect, j)
-    } else {
-      ee <- get.adjedgelist(x, mode=mode)[i]
-      lapply(seq_along(i), function(yy) {
-        from <- i[yy]
-        el <- get.edges(x, ee[[yy]])
-        other <- ifelse(el[,1]==from, el[,2], el[,1])
-        ee[[yy]][other %in% j]
-      })
-      
-    }
-  }
-}
-
-`[<-.igraph` <- function(x, i, j, ..., from, to,
-                         attr=if (is.weighted(x)) "weight" else NULL,
-                         value) {
-  ## TODO: rewrite this in C to make it faster
-
-  ################################################################
-  ## Argument checks
-  if ((!missing(from) || !missing(to)) &&
-      (!missing(i)    || !missing(j))) {
-    stop("Cannot give 'from'/'to' together with regular indices")
-  }
-  if ((!missing(from) &&  missing(to)) ||
-      ( missing(from) && !missing(to))) {
-    stop("Cannot give 'from'/'to' without the other")
-  }
-  if (is.null(attr) &&
-      (!is.null(value) && !is.numeric(value) && !is.logical(value))) {
-    stop("New value should be NULL, numeric or logical")
-  }  
-  if (is.null(attr) && !is.null(value) && length(value) != 1) {
-    stop("Logical or numeric value must be of length 1")
-  }
-  if (!missing(from)) {
-    if ((!is.numeric(from) && !is.character(from)) || any(is.na(from))) {
-      stop("'from' must be a numeric or character vector without NAs")
-    }
-    if ((!is.numeric(to) && !is.character(to)) || any(is.na(to))) {
-      stop("'to' must be a numeric or character vector without NAs")
-    }
-    if (length(from) != length(to)) {
-      stop("'from' and 'to' must have the same length")
-    }
-  }
-
-  ##################################################################
-
-  if (!missing(from)) {    
-    if (is.null(value) ||
-        (is.null(attr) && is.logical(value) && !value) ||
-        (is.null(attr) && is.numeric(value) && value==0)) {
-      ## Delete edges
-      todel <- x[from=from, to=to, ..., edges=TRUE]
-      x <- delete.edges(x, todel)
-    } else {
-      ## Addition or update of an attribute (or both)
-      ids <- x[from=from, to=to, ..., edges=TRUE]
-      if (any(ids==0)) {
-        x <- add.edges(x, rbind(from[ids==0], to[ids==0]))
-      }
-      if (!is.null(attr)) {
-        ids <- x[from=from, to=to, ..., edges=TRUE]
-        x <- set.edge.attribute(x, attr, ids, value=value)
-      }
-    }
-  } else if (is.null(value) ||
-      (is.null(attr) && is.logical(value) && !value) ||
-      (is.null(attr) && is.numeric(value) && value==0)) {
-    ## Delete edges
-    if (missing(i) && missing(j)) {
-      todel <- unlist(x[[ ,  , ..., edges=TRUE]])
-    } else if (missing(j)) {
-      todel <- unlist(x[[i,  , ..., edges=TRUE]])
-    } else if (missing(i)) {
-      todel <- unlist(x[[ , j, ..., edges=TRUE]])
-    } else {
-      todel <- unlist(x[[i, j, ..., edges=TRUE]])
-    }
-    x <- delete.edges(x, todel)
-  } else {
-    ## Addition or update of an attribute (or both)
-    i <- if (missing(i)) as.numeric(V(x)) else as.igraph.vs(x, i)
-    j <- if (missing(j)) as.numeric(V(x)) else as.igraph.vs(x, j)
-    if (length(i) != 0 && length(j) != 0) {
-      ## Existing edges, and their endpoints
-      exe <- x[[i, j, ..., edges=TRUE]]
-      exv <- x[[i, j, ...]]
-      toadd <- unlist(lapply(seq_along(exv), function(idx) {
-        to <- setdiff(j, exv[[idx]])
-        if (length(to!=0)) {
-          rbind(i[idx], setdiff(j, exv[[idx]]))
-        } else {
-          numeric()
-        }
-      }))
-      ## Do the changes
-      if (is.null(attr)) {
-        x <- add.edges(x, toadd)
-      } else {
-        x <- add.edges(x, toadd, attr=structure(list(value), names=attr))
-        toupdate <- unlist(x[[i, j, ..., edges=TRUE]])
-        x <- set.edge.attribute(x, attr, toupdate, value)
-      }
-    }    
-  }
-  x
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/interface.R igraph-0.6.5/interfaces/R/igraph/R/interface.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/interface.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/interface.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,176 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Structure building
-###################################################################
-
-add.edges <- function(graph, edges, ..., attr=list()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  attrs <- list(...)
-  attrs <- append(attrs, attr)
-  nam <- names(attrs)
-  if (length(attrs) != 0 && (is.null(nam) || any(nam==""))) {
-    stop("please supply names for attributes")
-  }
-  
-  edges.orig <- ecount(graph)  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  graph <- .Call("R_igraph_add_edges", graph, as.igraph.vs(graph, edges)-1,
-                 PACKAGE="igraph")
-  edges.new <- ecount(graph)
-  
-  if (edges.new-edges.orig != 0) {
-    idx <- seq(edges.orig+1, edges.new)
-  } else {
-    idx <- numeric()
-  }
-
-  eattrs <- .Call("R_igraph_mybracket2", graph, 9L, 4L, PACKAGE="igraph")
-  for (i in seq(attrs)) { eattrs[[nam[i]]][idx] <- attrs[[nam[i]]] }
-
-  .Call("R_igraph_mybracket2_set", graph, 9L, 4L, eattrs, PACKAGE="igraph")
-}
-
-add.vertices <- function(graph, nv, ..., attr=list()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  attrs <- list(...)
-  attrs <- append(attrs, attr)
-  nam <- names(attrs)
-  if (length(attrs) != 0 && (is.null(nam) || any(nam==""))) {
-    stop("please supply names for attributes")
-  }
-
-  vertices.orig <- vcount(graph)  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  graph <- .Call("R_igraph_add_vertices", graph, as.numeric(nv),
-                 PACKAGE="igraph")
-  vertices.new <- vcount(graph)
-
-  if (vertices.new-vertices.orig != 0) {
-    idx <- seq(vertices.orig+1, vertices.new)
-  } else {
-    idx <- numeric()
-  }
-
-  vattrs <- .Call("R_igraph_mybracket2", graph, 9L, 3L, PACKAGE="igraph")
-  for (i in seq(attrs)) { vattrs[[nam[i]]][idx] <- attrs[[nam[i]]] }
-
-  .Call("R_igraph_mybracket2_set", graph, 9L, 3L, vattrs, PACKAGE="igraph")
-}
-
-delete.edges <- function(graph, edges) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_delete_edges", graph, as.igraph.es(graph, edges)-1,
-        PACKAGE="igraph")
-}
-
-delete.vertices <- function(graph, v) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_delete_vertices", graph, as.igraph.vs(graph, v)-1,
-        PACKAGE="igraph")
-}
-
-###################################################################
-# Structure query
-###################################################################
-  
-ecount <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_ecount", graph,
-        PACKAGE="igraph")
-}
- 
-neighbors <- function(graph, v, mode=1) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (is.character(mode)) {
-    mode <- switch(mode, "out"=1, "in"=2, "all"=3, "total"=3)
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_neighbors", graph, as.igraph.vs(graph, v)-1,
-               as.numeric(mode),
-               PACKAGE="igraph")
-  res+1
-}
-
-incident <- function(graph, v, mode=c("all", "out", "in", "total")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (is.directed(graph)) {
-    mode <- igraph.match.arg(mode)
-    mode <- switch(mode, "out"=1, "in"=2, "all"=3, "total"=3)
-  } else {
-    mode=1
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_incident", graph, as.igraph.vs(graph, v)-1,
-               as.numeric(mode),
-               PACKAGE="igraph")
-  res+1
-}  
-
-is.directed <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_is_directed", graph,
-        PACKAGE="igraph")
-}
-
-get.edges <- function(graph, es) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_edges", graph, as.igraph.es(graph, es)-1,
-               PACKAGE="igraph")
-  matrix(res, ncol=2, byrow=TRUE)+1
-}
-
-get.edge.ids <- function(graph, vp, directed=TRUE, error=FALSE, multi=FALSE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_get_eids", graph, as.igraph.vs(graph, vp)-1,
-        as.logical(directed), as.logical(error), as.logical(multi),
-        PACKAGE="igraph")+1
-}  
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/iterators.R igraph-0.6.5/interfaces/R/igraph/R/iterators.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/iterators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/iterators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,422 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Constructors
-###################################################################
-
-V <- function(graph) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  vc <- vcount(graph)
-  res <- seq_len(vc)
-  class(res) <- "igraph.vs"
-  ne <- new.env()
-  assign("graph", graph, envir=ne)
-  attr(res, "env") <- ne
-  res
-}
-
-E <- function(graph, P=NULL, path=NULL, directed=TRUE) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (!is.null(P) && !is.null(path)) {
-    stop("Cannot give both `P' and `path' at the same time")
-  }
-  
-  if (is.null(P) && is.null(path)) {  
-    ec <- ecount(graph)
-    res <- seq_len(ec)
-  } else if (!is.null(P)) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_es_pairs", graph, as.igraph.vs(graph, P)-1,
-                 as.logical(directed),
-                 PACKAGE="igraph")+1
-  } else {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_es_path", graph, as.igraph.vs(graph, path)-1,
-                 as.logical(directed),
-                 PACKAGE="igraph")+1
-  }
-  
-  class(res) <- "igraph.es"
-  ne <- new.env()
-  assign("graph", graph, envir=ne)
-  attr(res, "env") <- ne
-  res
-}
-
-"[.igraph.vs" <- function(x, i) {
-  i <- substitute(i)
-  if (is.numeric(i) || is.integer(i)) {
-    # simple indexing by vertex ids
-    res <- i[ i %in% x ]
-    attributes(res) <- attributes(x)
-  } else if (is.logical(i)) {
-    # simple indexing by logical vector
-    res <- as.numeric(x) [ i ]
-    attributes(res) <- attributes(x)
-  } else if (is.character(i)) {
-    res <- as.igraph.vs(get("graph", attr(x, "env")), i)
-    attributes(res) <- attributes(x)
-  } else {
-    # language expression, we also do attribute based indexing
-    graph <- get("graph", attr(x, "env"))
-    nei <- function(v, mode=c("all", "in", "out", "total")) {
-      ## TRUE iff the vertex is a neighbor (any type)
-      ## of at least one vertex in v
-      mode <- igraph.match.arg(mode)
-      mode <- switch(mode, "out"=1, "in"=2, "all"=3, "total"=3)
-
-      if (is.logical(v)) {
-        v <- which(v)
-      }
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_vs_nei", graph, x, as.igraph.vs(graph, v)-1,
-                   as.numeric(mode),
-                   PACKAGE="igraph")
-      tmp[as.numeric(x)]
-    }
-    innei <- function(v, mode=c("in", "all", "out", "total")) {
-      nei(v, mode)
-    }
-    outnei <- function(v, mode=c("out", "all", "in", "total")) {
-      nei(v, mode)
-    }
-    inc <- adj <- function(e) {
-      ## TRUE iff the vertex (in the vs) is incident
-      ## to at least one edge in e
-      if (is.logical(e)) {
-        e <- which(e)
-      }
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_vs_adj", graph, x, as.igraph.es(graph, e)-1,
-                   as.numeric(3),
-                   PACKAGE="igraph")
-      tmp[as.numeric(x)]
-    }
-    from <- function(e) {
-      ## TRUE iff the vertex is the source of at least one edge in e
-      if (is.logical(e)) {
-        e <- which(e)
-      }
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_vs_adj", graph, x, as.igraph.es(graph, e)-1,
-                   as.numeric(1),
-                   PACKAGE="igraph")
-      tmp[as.numeric(x)]
-    }
-    to <- function(e) {
-      ## TRUE iff the vertex is the target of at least one edge in e
-      if (is.logical(e)) {
-        e <- which(e)
-      }
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_vs_adj", graph, x, as.igraph.es(graph, e)-1,
-                   as.numeric(2),
-                   PACKAGE="igraph")
-      tmp[as.numeric(x)]
-    }
-    i <- eval(i, envir=c(.Call("R_igraph_mybracket2", graph, 9L, 3L,
-                   PACKAGE="igraph"), nei=nei, innei=innei,
-                   outnei=outnei, adj=adj, inc=inc, from=from, to=to),
-              enclos=parent.frame())
-    if (is.numeric(i) || is.integer(i)) {
-      i <- as.numeric(i)
-      res <- i[ i %in% x ]
-      attributes(res) <- attributes(x)
-    } else if (is.logical(i)) {
-      res <- as.numeric(x) [ i ]
-      attributes(res) <- attributes(x)
-    } else if (is.character(i)) {
-      res <- as.igraph.vs(get("graph", attr(x, "env")), i)
-      attributes(res) <- attributes(x)
-    } else {
-      stop("invalid indexing of vertex seq")
-    }
-  }
-
-  res
-}
-
-"[.igraph.es" <- function(x, i) {
-  i <- substitute(i)
-  if (is.numeric(i) || is.integer(i)) {
-    # simple indexing by vertex ids
-    res <- i[ i %in% x ]
-    attributes(res) <- attributes(x)    
-  } else if (is.logical(i)) {
-    # simple indexing by a logical vector
-    res <- as.numeric(x) [ i ]
-    attributes(res) <- attributes(x)
-  } else if (is.character(i)) {
-    res <- as.igraph.es(get("graph", attr(x, "env")), i)
-    attributes(res) <- attributes(x)
-  } else {
-    # language expression, we also do attribute based indexing
-    graph <- get("graph", attr(x, "env"))
-    i <- substitute(i)
-    inc <- adj <- function(v) {
-      ## TRUE iff the edge is incident to at least one vertex in v
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_es_adj", graph, x, as.igraph.vs(graph, v)-1,
-                   as.numeric(3),
-                   PACKAGE="igraph")
-      tmp[ as.numeric(x) ]
-    }
-    from <- function(v) {
-      ## TRUE iff the edge originates from at least one vertex in v
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_es_adj", graph, x, as.igraph.vs(graph, v)-1,
-                   as.numeric(1),
-                   PACKAGE="igraph")
-      tmp[ as.numeric(x) ]      
-    }
-    to <- function(v) {
-      ## TRUE iff the edge points to at least one vertex in v
-      on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-      tmp <- .Call("R_igraph_es_adj", graph, x, as.igraph.vs(graph, v)-1,
-                   as.numeric(2),
-                   PACKAGE="igraph")
-      tmp[ as.numeric(x) ]
-    }
-    i <- eval(i, envir=c(.Call("R_igraph_mybracket2", graph, 9L, 4L,
-                   PACKAGE="igraph"),
-                   inc=inc, adj=adj, from=from, to=to,
-                   .igraph.from=list(.Call("R_igraph_mybracket",
-                     graph, 3L, PACKAGE="igraph")[ as.numeric(x) ]),
-                   .igraph.to=list(.Call("R_igraph_mybracket",
-                     graph, 4L, PACKAGE="igraph")[as.numeric(x)]),
-                   .igraph.graph=list(graph),
-                   `%--%`=`%--%`, `%->%`=`%->%`, `%<-%`=`%<-%`),
-              enclos=parent.frame())
-    if (is.numeric(i) || is.integer(i)) {
-      i <- as.numeric(i)
-      res <- i[ i %in% x ]
-      attributes(res) <- attributes(x)
-    } else if (is.logical(i)) {
-      res <- as.numeric(x) [ i ]
-      attributes(res) <- attributes(x)
-    } else {
-      stop("invalid indexing of edge seq")
-    }
-  }
-  
-  res
-} 
-
-"%--%" <- function(f, t) {  
-  from <- get(".igraph.from", parent.frame())
-  to <- get(".igraph.to", parent.frame())
-  graph <- get(".igraph.graph", parent.frame())
-  f <- as.igraph.vs(graph, f)-1
-  t <- as.igraph.vs(graph, t)-1
-  (from %in% f & to %in% t) | (to %in% f & from %in% t)
-}
-
-"%->%" <- function(f, t) {
-  from <- get(".igraph.from", parent.frame())
-  to <- get(".igraph.to", parent.frame())
-  graph <- get(".igraph.graph", parent.frame())
-  f <- as.igraph.vs(graph, f)-1
-  t <- as.igraph.vs(graph, t)-1
-  if (is.directed(graph)) {
-    from %in% f & to %in% t
-  } else {
-    (from %in% f & to %in% t) | (to %in% f & from %in% t)
-  }
-}
-
-"%<-%" <- function(t, value) {
-  from <- get(".igraph.from", parent.frame())
-  to <- get(".igraph.to", parent.frame())
-  graph <- get(".igraph.graph", parent.frame())
-  value <- as.igraph.vs(graph, value)-1
-  t <- as.igraph.vs(graph, t)-1
-  if (is.directed(graph)) {
-    from %in% value & to %in% t
-  } else {
-    (from %in% value & to %in% t) | (to %in% value & from %in% t)
-  }
-}
-
-"[<-.igraph.vs" <- function(x, i, value) {
-  if (! "name"  %in% names(attributes(value)) ||
-      ! "value" %in% names(attributes(value))) {
-    stop("invalid indexing")
-  }
-  value
-}
-
-"[<-.igraph.es" <- function(x, i, value) {
-  if (! "name"  %in% names(attributes(value)) ||
-      ! "value" %in% names(attributes(value))) {
-    stop("invalid indexing")
-  }
-  value
-}  
-
-"$.igraph" <- function(x, name) {
-  get.graph.attribute(x, name)
-}
-
-"$<-.igraph" <- function(x, name, value) {
-  set.graph.attribute(x, name, value)
-}
-  
-"$.igraph.vs" <- function(x, name) {
-  get.vertex.attribute(get("graph", attr(x, "env")), name, x)
-}
-
-"$.igraph.es" <- function(x, name) {
-  get.edge.attribute(get("graph", attr(x, "env")), name, x)
-}
-
-"$<-.igraph.vs" <- function(x, name, value) {
-  attr(x, "name") <- name
-  attr(x, "value") <- value
-  x
-}
-
-"$<-.igraph.es" <- function(x, name, value) {
-  attr(x, "name") <- name
-  attr(x, "value") <- value
-  x
-}
-
-"V<-" <- function(x, value) {
-  if (!is.igraph(x)) {
-    stop("Not a graph object")
-  }
-  if (! "name"  %in% names(attributes(value)) ||
-      ! "value" %in% names(attributes(value))) {
-    stop("invalid indexing")
-  }
-  set.vertex.attribute(x, attr(value, "name"), index=value,
-                       value=attr(value, "value"))
-}
-
-"E<-" <- function(x, path=NULL, P=NULL, directed=NULL, value) {
-  if (!is.igraph(x)) {
-    stop("Not a graph object")
-  }
-  if (! "name"  %in% names(attributes(value)) ||
-      ! "value" %in% names(attributes(value))) {
-    stop("invalid indexing")
-  }
-  set.edge.attribute(x, attr(value, "name"), index=value,
-                     value=attr(value, "value"))
-}
-
-print.igraph.vs <- function(x, ...) {
-  cat("Vertex sequence:\n")
-  graph <- get("graph", attr(x, "env"))
-  x <- as.numeric(x)
-  if ("name" %in% list.vertex.attributes(graph)) {
-    x <- V(graph)$name[x]
-  }
-  print(x)
-}
-
-print.igraph.es <- function(x, ...) {
-  cat("Edge sequence:\n")
-  graph <- get("graph", attr(x, "env"))
-  if (is.directed(graph)) {
-    arrow <- "->"
-  } else {
-    arrow <- "--"
-  }
-  x <- as.numeric(x)
-  el <- get.edges(graph, x)
-  if ("name" %in% list.vertex.attributes(graph)) {
-    el <- matrix(V(graph)$name[el], ncol=2)
-  }
-  tab <- data.frame(e=paste(sep="", "[", x, "]"), row.names="e")
-  if (is.numeric(el)) { w <- nchar(max(el)) } else { w <- max(nchar(el)) }
-  tab[" "] <- paste(format(el[,1], width=w), arrow, format(el[,2], width=w))
-  print(tab)
-}
-
-# these are internal
-
-as.igraph.vs <- function(graph, v, na.ok=FALSE) {
-  if (is.character(v) && "name" %in% list.vertex.attributes(graph)) {
-    v <- as.numeric(match(v, V(graph)$name))
-    if (!na.ok && any(is.na(v))) {
-      stop("Invalid vertex names")
-    }
-    v
-  } else {
-    if (is.logical(v)) {
-      res <- as.vector(V(graph))[v]
-    } else if (is.numeric(v) && any(v<=0)){
-      res <- as.vector(V(graph))[v]
-    } else {
-      res <- as.numeric(v)
-    }
-    if (!na.ok && any(is.na(res))) {
-      stop("Invalid vertex name(s)")
-    }
-    res
-  }
-}
-
-as.igraph.es <- function(graph, e) {
-  if (is.character(e)) {
-    Pairs <- grep("|", e, fixed=TRUE)
-    Names <- if (length(Pairs)==0) seq_along(e) else -Pairs
-    res <- numeric(length(e))
-
-    ## Based on vertex ids/names
-    if (length(Pairs)!=0) {
-      vv <- strsplit(e[Pairs], "|", fixed=TRUE)
-      vl <- sapply(vv, length)
-      if (any(vl != 2)) {
-        stop("Invalid edge name: ", e[Pairs][vl!=2][1])
-      }
-      vp <- unlist(vv)
-      if (! "name" %in% list.vertex.attributes(graph)) {
-        vp <- as.numeric(vp)
-      }
-      res[Pairs] <- get.edge.ids(graph, vp)
-    }
-
-    ## Based on edge ids/names
-    if (length(Names) != 0) {
-      if ("name" %in% list.edge.attributes(graph)) {
-        res[Names] <- as.numeric(match(e[Names], E(graph)$name))
-      } else {
-        res[Names] <- as.numeric(e[Names])
-      }
-    }
-    
-  } else {
-    res <- as.numeric(e)
-  }
-  if (any(is.na(res))) {
-    stop("Invalid edge names")
-  }
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/layout.R igraph-0.6.5/interfaces/R/igraph/R/layout.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/layout.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/layout.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,870 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2003-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Layouts
-###################################################################
-
-layout.random <- function(graph, params, dim=2) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (dim==2) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_layout_random", graph,
-          PACKAGE="igraph")
-  } else if (dim==3) {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_layout_random_3d", graph,
-          PACKAGE="igraph")
-  } else {
-    stop("Invalid `dim' value");
-  }
-}
-
-layout.circle <- function(graph, params) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_layout_circle", graph,
-        PACKAGE="igraph")
-}
-
-layout.sphere <- function(graph, params) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_layout_sphere", graph,
-        PACKAGE="igraph")
-}
-
-layout.fruchterman.reingold <- function(graph, ..., dim=2,
-                                        params=list()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  if (dim==2) {
-    fn <- "R_igraph_layout_fruchterman_reingold"
-  } else if (dim==3 ){
-    fn <- "R_igraph_layout_fruchterman_reingold_3d"
-  } else {
-    stop("Invalid `dim' argument");
-  }
-  
-  vc <- vcount(graph)
-  if (is.null(params$niter))     { params$niter      <- 500  }
-  if (is.null(params$maxdelta))  { params$maxdelta   <- vc   }
-  if (is.null(params$area))      { params$area       <- vc^2 }
-  if (is.null(params$coolexp))   { params$coolexp    <- 1.5  }
-  if (is.null(params$repulserad)){ params$repulserad <- params$area * vc }
-  if (is.null(params$weights))   {
-    params$weights <- NULL
-  } else {
-    params$weights <- as.numeric(params$weights)
-  }
-  if (!is.null(params$start)) {
-    params$start <- structure(as.numeric(params$start), dim=dim(params$start))
-  }
-  if (!is.null(params$minx)) {
-    params$minx <- as.double(params$minx)
-  }
-  if (!is.null(params$maxx)) {
-    params$maxx <- as.double(params$maxx)
-  }
-  if (!is.null(params$miny)) {
-    params$miny <- as.double(params$miny)
-  }
-  if (!is.null(params$maxy)) {
-    params$maxy <- as.double(params$maxy)
-  }
-  if (!is.null(params$minz)) {
-    params$minz <- as.double(params$minz)
-  }
-  if (!is.null(params$maxz)) {
-    params$maxz <- as.double(params$maxz)
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call(fn, graph,
-        as.double(params$niter), as.double(params$maxdelta),
-        as.double(params$area), as.double(params$coolexp),
-        as.double(params$repulserad), params$weights, params$start,
-        params$minx, params$maxx, params$miny, params$maxy,
-        params$minz, params$maxz,
-        PACKAGE="igraph")
-}
-
-layout.fruchterman.reingold.grid <- function(graph, ...,
-                                             params=list()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  vc <- vcount(graph)
-  if (is.null(params$niter))     { params$niter      <- 500  }
-  if (is.null(params$maxdelta))  { params$maxdelta   <- vc   }
-  if (is.null(params$area))      { params$area       <- vc^2 }
-  if (is.null(params$coolexp))   { params$coolexp    <- 1.5  }
-  if (is.null(params$repulserad)){ params$repulserad <- params$area * vc }
-  if (is.null(params$cellsize))  { params$cellsize   <-
-                                     (sqrt(sqrt(params$area))) }
-  if (is.null(params$weights))   {
-    params$weights <- NULL
-  } else {
-    params$weights <- as.numeric(params$weights)
-  }
-  if (!is.null(params$start)) {
-    params$start <- structure(as.numeric(params$start), dim=dim(params$start))
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_layout_fruchterman_reingold_grid", graph,
-        as.double(params$niter), as.double(params$maxdelta),
-        as.double(params$area), as.double(params$coolexp),
-        as.double(params$repulserad), as.double(params$cellsize),
-        params$start, params$weights,
-        PACKAGE="igraph")
-}
-  
-
-# FROM SNA 0.5
-
-layout.kamada.kawai<-function(graph, ..., dim=2,
-                              params=list()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  if (dim==2) {
-    fn <- "R_igraph_layout_kamada_kawai"
-  } else if (dim==3) {
-    fn <- "R_igraph_layout_kamada_kawai_3d"
-  } else {
-    stop("Invalid `dim' parameter")
-  }
-  
-  vc <- vcount(graph)
-  if (is.null(params$niter))      { params$niter   <- 1000 }
-  if (is.null(params$sigma))      { params$sigma   <- vc/4 }
-  if (is.null(params$initemp))    { params$initemp <- 10   }
-  if (is.null(params$coolexp))    { params$coolexp <- 0.99 }
-  if (is.null(params$kkconst))    { params$kkconst <- vc^2 }
-  if (is.null(params$fixz))       { params$fixz    <- FALSE}
-  if (!is.null(params$start)) {
-    params$start <- structure(as.numeric(params$start), dim=dim(params$start))
-  }
-  if (!is.null(params$minx)) {
-    params$minx <- as.double(params$minx)
-  }
-  if (!is.null(params$maxx)) {
-    params$maxx <- as.double(params$maxx)
-  }
-  if (!is.null(params$miny)) {
-    params$miny <- as.double(params$miny)
-  }
-  if (!is.null(params$maxy)) {
-    params$maxy <- as.double(params$maxy)
-  }
-  if (!is.null(params$minz)) {
-    params$minz <- as.double(params$minz)
-  }
-  if (!is.null(params$maxz)) {
-    params$maxz <- as.double(params$maxz)
-  }
-  if (params$fixz && dim==2) {
-    warning("`fixz' works for 3D only, ignored.")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call(fn, graph,
-        as.double(params$niter), as.double(params$initemp),
-        as.double(params$coolexp), as.double(params$kkconst),
-        as.double(params$sigma), params$start, as.logical(params$fixz),
-        params$minx, params$maxx, params$miny, params$maxy,
-        params$minz, params$maxz,
-        PACKAGE="igraph")
-}
-
-layout.graphopt <- function(graph, ..., 
-                            params=list()) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  vc <- vcount(graph)
-  if (is.null(params$niter))            { params$niter           <- 500   }
-  if (is.null(params$charge))           { params$charge          <- 0.001 }
-  if (is.null(params$mass))             { params$mass            <- 30    }
-  if (is.null(params$spring.length))    { params$spring.length   <- 0     }
-  if (is.null(params$spring.constant))  { params$spring.constant <- 1     }
-  if (is.null(params$max.sa.movement))  { params$max.sa.movement <- 5     }
-  if (!is.null(params$start)) {
-    params$start <- structure(as.numeric(params$start), dim=dim(params$start))
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_layout_graphopt", graph,
-        as.double(params$niter), as.double(params$charge),
-        as.double(params$mass), as.double(params$spring.length),
-        as.double(params$spring.constant), params$max.sa.movement,
-        params$start,
-        PACKAGE="igraph")
-}
-
-layout.lgl <- function(graph, ..., params=list()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  vc <- vcount(graph)
-  if (is.null(params$maxiter))   { params$maxiter    <- 150  }
-  if (is.null(params$maxdelta))  { params$maxdelta   <- vc   }
-  if (is.null(params$area))      { params$area       <- vc^2 }
-  if (is.null(params$coolexp))   { params$coolexp    <- 1.5  }
-  if (is.null(params$repulserad)){ params$repulserad <- params$area * vc }
-  if (is.null(params$cellsize))  { params$cellsize   <-
-                                     (sqrt(sqrt(params$area))) }
-  if (is.null(params$root))      {
-    params$root <- -1
-  } else {
-    params$root <- as.igraph.vs(graph, params$root)-1
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_layout_lgl", graph, as.double(params$maxiter),
-        as.double(params$maxdelta), as.double(params$area),
-        as.double(params$coolexp), as.double(params$repulserad),
-        as.double(params$cellsize), params$root,
-        PACKAGE="igraph")
-}
-
-layout.reingold.tilford <- function(graph, ..., params=list()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }
-
-  if (is.null(params$root))          { params$root       <- numeric()  }
-  if (is.null(params$circular))      { params$circular   <- FALSE      }
-  if (is.null(params$rootlevel))     { params$rootlevel  <- numeric()  }
-  if (is.null(params$mode))          { params$mode       <- "out"      }
-  if (is.null(params$flip.y))        { params$flip.y     <- TRUE       }
-  params$mode <- tolower(params$mode)
-  params$mode <- switch(params$mode, "out"=1, "in"=2, "all"=3, "total"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_layout_reingold_tilford", graph,
-               as.igraph.vs(graph, params$root)-1,
-               as.double(params$mode), as.double(params$rootlevel),
-               as.logical(params$circular),
-               PACKAGE="igraph")
-  if (params$flip.y) {
-    res[,2] <- max(res[,2])-res[,2]
-  }
-  res
-}
-
-layout.merge <- function(graphs, layouts, method="dla") {
-
-  if (!all(sapply(graphs, is.igraph))) {
-    stop("Not a graph object")
-  }
-  if (method == "dla") {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_layout_merge_dla",
-                 graphs, layouts,
-                 PACKAGE="igraph")
-  } else {
-    stop("Invalid `method'.")
-  }
-  res
-}
-
-# FROM SNA 0.5
-
-symmetrize.mat <- function(mats,rule=c("weak", "strong", "lower", "upper")){
-   rule <- igraph.match.arg(rule)
-   
-   #Build the input data structures
-   if(length(dim(mats))>2){
-      m<-dim(mats)[1]
-      n<-dim(mats)[2]
-      o<-dim(mats)[3]
-      d<-mats
-   }else{
-      m<-1
-      n<-dim(mats)[1]
-      o<-dim(mats)[2]
-      d<-array(dim=c(1,n,o))
-      d[1,,]<-mats
-   }
-   #Apply the symmetry rule
-   for(i in 1:m){
-      if(rule=="upper"){
-         temp<-d[i,,]
-         for(j in 1:n)
-            temp[j:n,j]<-temp[j,j:n]
-         d[i,,]<-temp
-      }else if(rule=="lower"){
-         temp<-d[i,,]
-         for(j in 1:n)
-            temp[j,j:n]<-temp[j:n,j]
-         d[i,,]<-temp
-      }else if(rule=="weak"){
-         d[i,,]<-matrix(as.numeric(d[i,,]|t(d[i,,])),nrow=n,ncol=o)
-      }else if(rule=="strong"){
-         d[i,,]<-matrix(as.numeric(d[i,,]&t(d[i,,])),nrow=n,ncol=o)
-      }
-   }
-   #Return the symmetrized matrix
-   if(m==1)
-      out<-d[1,,]
-   else
-      out<-d
-   out
-}
-
-# FROM SNA 0.5
-
-layout.spring<-function(graph, ..., params=list()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  if (length(params)==0) {
-    params <- list(...)
-  }  
-
-  if (is.null(params$mass))     { params$mass     <- 0.1 }
-  if (is.null(params$equil))    { params$equil    <- 1 }
-  if (is.null(params$k))        { params$k        <- 0.001 }
-  if (is.null(params$repeqdis)) { params$repeqdis <- 0.1 }
-  if (is.null(params$kfr))      { params$kfr      <- 0.01 }
-  if (is.null(params$repulse))  { params$repulse  <- FALSE }
-
-  #Create initial condidions
-  vc <- vcount(graph)
-  f.x <- rep(0,vc)       #Set initial x/y forces to zero
-  f.y <- rep(0,vc)
-  v.x <- rep(0,vc)       #Set initial x/y velocities to zero
-  v.y <- rep(0,vc)
-  tempa <- sample((0:(vc-1))/vc) #Set initial positions randomly on the circle
-  x <- vc/(2*pi)*sin(2*pi*tempa)
-  y <- vc/(2*pi)*cos(2*pi*tempa)
-  ds <- symmetrize.mat(get.adjacency(graph, sparse=FALSE))#Symmetrize/dichotomize the graph
-  kfr <- params$kfr                     #Set initial friction level
-  niter <- 1                            #Set the iteration counter
-  #Simulate, with increasing friction, until motion stops    
-  repeat{
-    niter <- niter+1                    #Update the iteration counter
-    dis <- as.matrix(dist(cbind(x,y)))  #Get inter-point distances
-    #Get angles relative to the positive x direction
-    theta <- acos(t(outer(x,x,"-"))/dis)*sign(t(outer(y,y,"-"))) 
-    #Compute spring forces; note that we assume a base spring coefficient
-    #of params$k units ("pseudo-Newtons/quasi-meter"?), with an equilibrium
-    #extension of params$equil units for all springs
-    f.x <- apply(ds*cos(theta)*params$k*(dis-params$equil),1,sum,na.rm=TRUE)
-    f.y <- apply(ds*sin(theta)*params$k*(dis-params$equil),1,sum,na.rm=TRUE)
-    #If node repulsion is active, add a force component for this
-    #as well.  We employ an inverse cube law which is equal in power
-    #to the attractive spring force at distance params$repeqdis
-    if(params$repulse){
-      f.x <- f.x-apply(cos(theta)*params$k/(dis/params$repeqdis)^3,1,
-                       sum,na.rm=TRUE)
-      f.y <- f.y-apply(sin(theta)*params$k/(dis/params$repeqdis)^3,1,
-                       sum,na.rm=TRUE)
-    }
-    #Adjust the velocities (assume a mass of params$mass units); note that the
-    #motion is roughly modeled on the sliding of flat objects across
-    #a uniform surface (e.g., spring-connected cylinders across a table).
-    #We assume that the coefficients of static and kinetic friction are
-    #the same, which should only trouble you if you are under the 
-    #delusion that this is a simulation rather than a graph drawing
-    #exercise (in which case you should be upset that I'm not using
-    #Runge-Kutta or the like!).
-    v.x <- v.x+f.x/params$mass         #Add accumulated spring/repulsion forces
-    v.y <- v.y+f.y/params$mass
-    spd <- sqrt(v.x^2+v.y^2)     #Determine frictional forces
-    fmag <- pmin(spd,kfr)  #We can't let friction _create_ motion!
-    theta <- acos(v.x/spd)*sign(v.y)  #Calculate direction of motion
-    f.x <- fmag*cos(theta)        #Decompose frictional forces
-    f.y <- fmag*sin(theta)
-    f.x[is.nan(f.x)] <- 0         #Correct for any 0/0 problems
-    f.y[is.nan(f.y)] <- 0
-    v.x <- v.x-f.x                #Apply frictional forces (opposing motion -
-    v.y <- v.y-f.y                #note that mass falls out of equation)
-    #Adjust the positions (yep, it's primitive linear updating time!)
-    x <- x+v.x
-    y <- y+v.y
-    #Check for cessation of motion, and increase friction
-    mdist <- mean(dis)
-    if(all(v.x<mdist*1e-5)&&all(v.y<mdist*1e-5))
-      break
-    else
-      kfr <- params$kfr*exp(0.1*niter)
-  }
-  #Return the result
-  cbind(x,y)
-}
-
-layout.norm <- function(layout, xmin=NULL, xmax=NULL, ymin=NULL, ymax=NULL,
-                          zmin=NULL, zmax=NULL) {
-
-  if (!is.matrix(layout)) {
-    stop("`layout' not a matrix")
-  }
-  if (ncol(layout) != 2 && ncol(layout) != 3) {
-    stop("`layout' should have 2 or three columns")
-  }
-  
-  if (!is.null(xmin) && !is.null(xmax)) {
-    layout[,1] <- .layout.norm.col(layout[,1], xmin, xmax)
-  }
-
-  if (!is.null(ymin) && !is.null(ymax)) {
-    layout[,2] <- .layout.norm.col(layout[,2], ymin, ymax)
-  }
-  
-  if (ncol(layout)==3 && !is.null(zmin) && !is.null(zmax)) {
-    layout[,3] <- .layout.norm.col(layout[,3], zmin, zmax)
-  }
-
-  layout
-}
-
-.layout.norm.col <- function(v, min, max) {
-
-  vr <- range(v)
-  if (vr[1]==vr[2]) {
-    fac <- 1
-  } else {
-    fac <- (max-min)/(vr[2]-vr[1])
-  }
-
-  (v-vr[1]) * fac + min
-}
-
-layout.svd <- function(graph, d=shortest.paths(graph), ...)
-  UseMethod("layout.svd", graph)
-
-layout.svd.igraph <- function(graph, d=shortest.paths(graph), ...) {
-    
-    if (!is.igraph(graph)) {
-      stop("Not a graph object")
-    }
-
-    clust <- clusters(graph)
-    llist <- list()
-    llen <- numeric()
-    glist <- list()
-    for(i in 1:length(clust$csize)){
-        ind <- clust$membership==i
-        
-        if(length(which(ind))>=3){
-            thisl <- svd(d[ind, ind], 2)[[2]]
-            thisl[, 1] <- thisl[, 1]/dist(range(thisl[, 1]))
-            thisl[, 2] <- thisl[, 2]/dist(range(thisl[, 2]))
-            llist[[i]] <- thisl
-        }else if(length(which(ind))==2){
-            llist[[i]] <- d[ind, ind]
-        } else {
-            llist[[i]] <- matrix(c(0, 0), nrow=1)
-        }
-        
-        llen[i] <- length(which(ind))
-        
-        glist[[i]] <- induced.subgraph(graph, V(graph)[ind])
-    }
-    
-    ## merge them all:
-    lmerged <- layout.merge(glist, llist)
-    
-    ## now reorder these rows to reflect original graph:
-    l <- matrix(rep(NA, 2*vcount(graph)), ncol=2)
-    l[order(clust$membership), ] <- lmerged
-    return(l)
-}
-
-piecewise.layout <- function(graph, layout=layout.kamada.kawai, ...) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  V(graph)$id <- seq(vcount(graph))
-  gl <- decompose.graph(graph)
-  ll <- lapply(gl, layout, ...)
-  
-  l <- layout.merge(gl, ll)
-  l[ unlist(sapply(gl, get.vertex.attribute, "id")), ] <- l[]
-  l
-}
-
-layout.drl <- function(graph, use.seed = FALSE,
-                       seed=matrix(runif(vcount(graph)*2), ncol=2),
-                       options=igraph.drl.default,
-                       weights=E(graph)$weight,
-                       fixed=NULL,
-                       dim=2)
-{
-    if (!is.igraph(graph)) {
-        stop("Not a graph object")
-    }
-    if (dim != 2 && dim != 3) {
-      stop("`dim' must be 2 or 3")
-    }
-    use.seed <- as.logical(use.seed)
-    seed <- as.matrix(seed)
-    options.tmp <- igraph.drl.default
-    options.tmp[names(options)] <- options
-    options <- options.tmp
-    if (!is.null(weights)) {
-      weights <- as.numeric(weights)
-    }
-    if (!is.null(fixed)) {
-      fixed <- as.logical(fixed)
-    }
-    on.exit(.Call("R_igraph_finalizer", PACKAGE = "igraph"))
-    if (dim==2) {
-      res <- .Call("R_igraph_layout_drl", graph, seed, use.seed, options, 
-                   weights, fixed, PACKAGE = "igraph")
-    } else {
-      res <- .Call("R_igraph_layout_drl_3d", graph, seed, use.seed, options, 
-                   weights, fixed, PACKAGE = "igraph")
-    }      
-    res
-}
-
-igraph.drl.default <- list(edge.cut=32/40,
-                           init.iterations=0,
-                           init.temperature=2000,
-                           init.attraction=10,
-                           init.damping.mult=1.0,
-                           liquid.iterations=200,
-                           liquid.temperature=2000,
-                           liquid.attraction=10,
-                           liquid.damping.mult=1.0,
-                           expansion.iterations=200,
-                           expansion.temperature=2000,
-                           expansion.attraction=2,
-                           expansion.damping.mult=1.0,
-                           cooldown.iterations=200,
-                           cooldown.temperature=2000,
-                           cooldown.attraction=1,
-                           cooldown.damping.mult=.1,
-                           crunch.iterations=50,
-                           crunch.temperature=250,
-                           crunch.attraction=1,
-                           crunch.damping.mult=0.25,
-                           simmer.iterations=100,
-                           simmer.temperature=250,
-                           simmer.attraction=.5,
-                           simmer.damping.mult=0)
-
-igraph.drl.coarsen <- list(edge.cut=32/40,
-                           init.iterations=0,
-                           init.temperature=2000,
-                           init.attraction=10,
-                           init.damping.mult=1.0,
-                           liquid.iterations=200,
-                           liquid.temperature=2000,
-                           liquid.attraction=2,
-                           liquid.damping.mult=1.0,
-                           expansion.iterations=200,
-                           expansion.temperature=2000,
-                           expansion.attraction=10,
-                           expansion.damping.mult=1.0,
-                           cooldown.iterations=200,
-                           cooldown.temperature=2000,
-                           cooldown.attraction=1,
-                           cooldown.damping.mult=.1,
-                           crunch.iterations=50,
-                           crunch.temperature=250,
-                           crunch.attraction=1,
-                           crunch.damping.mult=0.25,
-                           simmer.iterations=100,
-                           simmer.temperature=250,
-                           simmer.attraction=.5,
-                           simmer.damping.mult=0)
-
-igraph.drl.coarsest <- list(edge.cut=32/40,
-                            init.iterations=0,
-                            init.temperature=2000,
-                            init.attraction=10,
-                            init.damping.mult=1.0,
-                            liquid.iterations=200,
-                            liquid.temperature=2000,
-                            liquid.attraction=2,
-                            liquid.damping.mult=1.0,
-                            expansion.iterations=200,
-                            expansion.temperature=2000,
-                            expansion.attraction=10,
-                            expansion.damping.mult=1.0,
-                            cooldown.iterations=200,
-                            cooldown.temperature=2000,
-                            cooldown.attraction=1,
-                            cooldown.damping.mult=.1,
-                            crunch.iterations=200,
-                            crunch.temperature=250,
-                            crunch.attraction=1,
-                            crunch.damping.mult=0.25,
-                            simmer.iterations=100,
-                            simmer.temperature=250,
-                            simmer.attraction=.5,
-                            simmer.damping.mult=0)
-
-igraph.drl.refine <- list(edge.cut=32/40,
-                          init.iterations=0,
-                          init.temperature=50,
-                          init.attraction=.5,
-                          init.damping.mult=1.0,
-                          liquid.iterations=0,
-                          liquid.temperature=2000,
-                          liquid.attraction=2,
-                          liquid.damping.mult=1.0,
-                          expansion.iterations=50,
-                          expansion.temperature=500,
-                          expansion.attraction=.1,
-                          expansion.damping.mult=.25,
-                          cooldown.iterations=50,
-                          cooldown.temperature=250,
-                          cooldown.attraction=1,
-                          cooldown.damping.mult=.1,
-                          crunch.iterations=50,
-                          crunch.temperature=250,
-                          crunch.attraction=1,
-                          crunch.damping.mult=0.25,
-                          simmer.iterations=0,
-                          simmer.temperature=250,
-                          simmer.attraction=.5,
-                          simmer.damping.mult=0)
-
-igraph.drl.final <- list(edge.cut=32/40,
-                         init.iterations=0,
-                         init.temperature=50,
-                         init.attraction=.5,
-                         init.damping.mult=0,
-                         liquid.iterations=0,
-                         liquid.temperature=2000,
-                         liquid.attraction=2,
-                         liquid.damping.mult=1.0,
-                         expansion.iterations=50,
-                         expansion.temperature=2000,
-                         expansion.attraction=2,
-                         expansion.damping.mult=1.0,
-                         cooldown.iterations=50,
-                         cooldown.temperature=200,
-                         cooldown.attraction=1,
-                         cooldown.damping.mult=.1,
-                         crunch.iterations=50,
-                         crunch.temperature=250,
-                         crunch.attraction=1,
-                         crunch.damping.mult=0.25,
-                         simmer.iterations=25,
-                         simmer.temperature=250,
-                         simmer.attraction=.5,
-                         simmer.damping.mult=0)
-
-layout.auto <- function(graph, dim=2, ...) {
-
-  ## 1. If there is a 'layout' graph attribute, we just use that.
-  ## 2. Otherwise, if there are vertex attributes called 'x' and 'y',
-  ##    we use those (and the 'z' vertex attribute as well, if present).
-  ## 3. Otherwise, if the graph is connected and small (<100) we use
-  ##    the Kamada-Kawai layout.
-  ## 4. Otherwise if the graph is medium size (<1000) we use the
-  ##    Fruchterman-Reingold layout.
-  ## 5. Otherwise we use the DrL layout generator.
-  
-  if ("layout" %in% list.graph.attributes(graph)) {
-    lay <- get.graph.attribute(graph, "layout")
-    if (is.function(lay)) {
-      lay(graph, ...)
-    } else {
-      lay
-    }
-
-  } else if ( all(c("x", "y") %in% list.vertex.attributes(graph)) ) {
-    if ("z" %in% list.vertex.attributes(graph)) {
-      cbind(V(graph)$x, V(graph)$y, V(graph)$z)
-    } else {
-      cbind(V(graph)$x, V(graph)$y)
-    }
-
-  } else if (is.connected(graph) && vcount(graph) < 100) {
-    layout.kamada.kawai(graph, dim=dim, ...)
-
-  } else if (vcount(graph) < 1000) {
-    layout.fruchterman.reingold(graph, dim=dim, ...)
-
-  } else {
-    layout.drl(graph, dim=dim, ...)
-  }
-  
-}
-
-layout.sugiyama <- function(graph, layers=NULL, hgap=1, vgap=1,
-                            maxiter=100, weights=NULL,
-                            attributes=c("default", "all", "none")) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (!is.null(layers)) layers <- as.numeric(layers)-1
-  hgap <- as.numeric(hgap)
-  vgap <- as.numeric(vgap)
-  maxiter <- as.integer(maxiter)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-    weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-    weights <- as.numeric(weights) 
-  } else { 
-    weights <- NULL 
-  }
-  attributes <- igraph.match.arg(attributes)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_layout_sugiyama", graph, layers, hgap,
-               vgap, maxiter, weights, PACKAGE="igraph")
-
-  # Flip the y coordinates, more natural this way
-  res$res[,2] <- max(res$res[,2]) - res$res[,2] + 1
-
-  # Separate real and dummy vertices
-  vc <- vcount(graph)
-  res$layout <- res$res[seq_len(vc),]
-  if (nrow(res$res)==vc) {
-    res$layout.dummy <- matrix(nrow=0, ncol=2)
-  } else {
-    res$layout.dummy <- res$res[(vc+1):nrow(res$res),]
-  }
-  
-  # Add some attributes to the extended graph
-  E(res$extd_graph)$orig <- res$extd_to_orig_eids
-  res$extd_to_orig_eids <- NULL
-
-  res$extd_graph <- set.vertex.attribute(res$extd_graph, "dummy",
-                                         value=c(rep(FALSE, vc),
-                                           rep(TRUE, nrow(res$res)-vc)))
-
-  res$extd_graph$layout <- rbind(res$layout, res$layout.dummy)
-
-  if (attributes=="default" || attributes=="all") {
-    if ("size" %in% list.vertex.attributes(graph)) {
-      V(res$extd_graph)$size <- 0
-      V(res$extd_graph)$size[ !V(res$extd_graph)$dummy ] <- V(graph)$size
-    }
-    if ("size2" %in% list.vertex.attributes(graph)) {
-      V(res$extd_graph)$size2 <- 0
-      V(res$extd_graph)$size2[ !V(res$extd_graph)$dummy ] <- V(graph)$size2
-    }
-    if ("shape" %in% list.vertex.attributes(graph)) {
-      V(res$extd_graph)$shape <- "none"
-      V(res$extd_graph)$shape[ !V(res$extd_graph)$dummy ] <- V(graph)$shape
-    }
-    if ("label" %in% list.vertex.attributes(graph)) {
-      V(res$extd_graph)$label <- ""
-      V(res$extd_graph)$label[ !V(res$extd_graph)$dummy ] <- V(graph)$label
-    }
-    if ("color" %in% list.vertex.attributes(graph)) {
-      V(res$extd_graph)$color <- head(V(graph)$color, 1)
-      V(res$extd_graph)$color[ !V(res$extd_graph)$dummy ] <- V(graph)$color
-    }
-    eetar <- get.edgelist(res$extd_graph, names=FALSE)[,2]
-    E(res$extd_graph)$arrow.mode <- 0
-    if ("arrow.mode" %in% list.edge.attributes(graph)) {
-      E(res$extd_graph)$arrow.mode[ eetar <= vc ] <- E(graph)$arrow.mode
-    } else {
-      E(res$extd_graph)$arrow.mode[ eetar <= vc ] <- is.directed(graph) * 2
-    }
-    if ("arrow.size" %in% list.edge.attributes(graph)) {
-      E(res$extd_graph)$arrow.size <- 0
-      E(res$extd_graph)$arrow.size[ eetar <= vc ] <- E(graph)$arrow.size
-    }
-  }
-
-  if (attributes=="all") {
-    gatt <- setdiff(list.graph.attributes(graph), "layout")
-    vatt <- setdiff(list.vertex.attributes(graph),
-                    c("size", "size2", "shape", "label", "color"))
-    eatt <- setdiff(list.edge.attributes(graph),
-                    c("arrow.mode", "arrow.size"))
-    for (ga in gatt) {
-      res$extd_graph <- set.graph.attribute(res$extd_graph, ga,
-                                            get.graph.attribute(graph, ga))
-    }
-    for (va in vatt) {
-      notdummy <- which(!V(res$extd_graph)$dummy)
-      res$extd_graph <- set.vertex.attribute(res$extd_graph, va,
-                                             notdummy,
-                                             get.vertex.attribute(graph, va))
-    }
-    for (ea in eatt) {
-      eanew <- get.edge.attribute(graph, ea)[E(res$extd_graph)$orig]
-      res$extd_graph <- set.edge.attribute(res$extd_graph, ea, value=eanew)
-    }
-  }
-  
-  res$res <- NULL
-  res
-}
-
-layout.mds <- function(graph, dist=NULL, dim=2,
-                       options=igraph.arpack.default) {
-  
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (!is.null(dist)) dist <- structure(as.double(dist), dim=dim(dist))
-  dim <- as.integer(dim)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_layout_mds", graph, dist, dim,
-        PACKAGE="igraph")
-
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/minimum.spanning.tree.R igraph-0.6.5/interfaces/R/igraph/R/minimum.spanning.tree.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/minimum.spanning.tree.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/minimum.spanning.tree.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-minimum.spanning.tree <- function(graph, weights=NULL,
-                                  algorithm=NULL, ...) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(algorithm)) {
-    if (!is.null(weights) || "weight" %in% list.edge.attributes(graph)) {
-      algorithm <- "prim"
-    } else {
-      algorithm <- "unweighted"
-    }
-  }
-  
-  if (algorithm=="unweighted") {
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_minimum_spanning_tree_unweighted", graph,
-          PACKAGE="igraph")
-  } else if (algorithm=="prim") {
-    if (is.null(weights) && ! "weight" %in% list.edge.attributes(graph)) {
-      stop("edges weights must be supplied for Prim's algorithm")
-    } else if (is.null(weights)) {
-      weights <- E(graph)$weight
-    }
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    .Call("R_igraph_minimum_spanning_tree_prim", graph, as.numeric(weights),
-          PACKAGE="igraph")    
-  } else {
-    stop("Invalid algorithm")
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/motifs.R igraph-0.6.5/interfaces/R/igraph/R/motifs.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/motifs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/motifs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,76 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-graph.motifs <- function(graph, size=3, cut.prob=rep(0, size)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  cut.prob <- as.numeric(cut.prob)
-  if (length(cut.prob) != size) {
-    cut.prob <- c(cut.prob[-length(cut.prob)],
-                  rep(cut.prob[-length(cut.prob)], length(cut.prob)-1))
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_motifs_randesu", graph, as.integer(size),
-               as.numeric(cut.prob),
-               PACKAGE="igraph")
-  res[is.nan(res)] <- NA
-  res
-}
-
-graph.motifs.no <- function(graph, size=3, cut.prob=rep(0, size)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  cut.prob <- as.numeric(cut.prob)
-  if (length(cut.prob) != size) {
-    cut.prob <- c(cut.prob[-length(cut.prob)],
-                  rep(cut.prob[-length(cut.prob)], length(cut.prob)-1))
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_motifs_randesu_no", graph, as.integer(size),
-        as.numeric(cut.prob),
-        PACKAGE="igraph")
-}
-
-graph.motifs.est <- function(graph, size=3, cut.prob=rep(0, size),
-                             sample.size=vcount(graph)/10, sample=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  cut.prob <- as.numeric(cut.prob)
-  if (length(cut.prob) != size) {
-    cut.prob <- c(cut.prob[-length(cut.prob)],
-                  rep(cut.prob[-length(cut.prob)], length(cut.prob)-1))
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_motifs_randesu_estimate", graph, as.integer(size),
-        as.numeric(cut.prob), as.integer(sample.size), as.numeric(sample),
-        PACKAGE="igraph")
-}
-  
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/nexus.R igraph-0.6.5/interfaces/R/igraph/R/nexus.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/nexus.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/nexus.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,377 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2011-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-makeNexusDatasetInfo <- function(entries) {
-  dsi <- lapply(entries, "[", 2)
-  nam <- sapply(entries, "[", 1)
-
-  attr <- nam=="attribute"
-  myattr <- unlist(dsi[attr])
-  dsi <- dsi[!attr]
-  nam <- nam[!attr]
-  names(dsi) <- nam
-  class(dsi) <- "nexusDatasetInfo"
-
-  if (length(myattr) != 0) {
-    myattr <- strsplit(myattr, "\n", fixed=TRUE)
-    attrdat <- lapply(myattr, function(x) strsplit(x[1], " ")[[1]])
-    myattr <- sapply(myattr, "[", 2)
-    dsi$attributes <- mapply(attrdat, myattr, SIMPLIFY=FALSE,
-                             FUN=function(dat, desc) {
-                               list(type=dat[1], datatype=dat[2], name=dat[3],
-                                    description=desc)
-                             })
-  }
-  
-  dsi$id <- as.numeric(dsi$id)
-  dsi$tags <- strsplit(dsi$tags, ";", fixed=TRUE)[[1]]
-  
-  dsi
-}
-
-print.nexusDatasetInfo <- function(x, ...) {
-  ve <- strsplit(parseVE(x$`vertices/edges`), "/")[[1]]
-  nc <- c("U", "-", "-", "-")
-  if ("directed" %in% x$tags && "undirected" %in% x$tags) {
-    nc[1] <- "B"
-  } else if ("directed" %in% x$tags) {
-    nc[1] <- "D"
-  }
-  if (is.null(x$attributes)) {
-    nc[2] <- "?"
-  } else if (any(sapply(x$attributes,
-                        function(X) X$name=="name" && X$type=="vertex"))) {
-    nc[2] <- "N"
-  } 
-  if ("weighted" %in% x$tags) {
-    nc[3] <- "W"
-  }
-  if ("bipartite" %in% x$tags) {
-    nc[4] <- "B"
-  }
-  nc <- paste(nc, collapse="")
-  head <- paste(sep="", "NEXUS ", nc, " ", ve[1], " ", ve[2], " #",
-                x$id, " ", x$sid, " -- ", x$name)
-  if (nchar(head) > getOption("width")) {
-    head <- paste(sep="", substr(head, 1, getOption("width")-1), "+")
-  }
-  cat(head, sep="", "\n")
-  if (length(x$tags) != 0) {
-    tt <- strwrap(paste(sep="", "+ tags: ", paste(x$tags, collapse="; ")),
-                  initial="", prefix="  ")
-    cat(tt, sep="\n")
-  }
-  if ("networks" %in% names(x)) {
-    nets <- strsplit(x$networks, " ")[[1]]
-    nn <- strwrap(paste(sep="", "+ nets: ", paste(nets, collapse="; ")),
-                  initial="", prefix="  ")
-    cat(nn, sep="\n")
-  }
-  attr <- x[["attributes"]]
-  printed <- c("id", "sid", "vertices/edges", "name", "tags", "networks",
-               "attributes")
-  x <- x[ setdiff(names(x), printed) ]
-  if (length(attr)>0) {
-    dcode <- function(d) {
-      if (d=="numeric") return("n")
-      if (d=="string") return("c")
-      "x"
-    }
-    cat("+ attr: ")
-    astr <- sapply(attr, function(a) {
-      paste(sep="", a$name, " (", substr(a$type, 1, 1), "/",
-            dcode(a$datatype), ")")
-    })
-    cat(strwrap(paste(astr, collapse=", "), exdent=2), "\n")
-  }
-  for (i in names(x)) {
-    xx <- strsplit(x[[i]], "\n")[[1]]
-    ff <- strwrap(paste(sep="", "+ ", i, ": ", xx[1]), initial="",
-                  prefix="  ")
-    xx <- unlist(sapply(xx[-1], strwrap, prefix="  "))
-    cat(ff, sep="\n")
-    if (length(xx)>0) {
-      cat(xx, sep="\n")
-    }
-  }
-  invisible(x)
-}
-
-summary.nexusDatasetInfoList <- function(object, ...) {
-  o <- as.numeric(attr(object, "offset"))
-  s <- as.numeric(attr(object, "size"))
-  t <- as.numeric(attr(object, "totalsize"))
-  n <- attr(object, "name")
-  cat(sep="", "NEXUS ", o+1, "-", o+s, "/", t, " -- ", n, "\n")
-  invisible(object)
-}
-
-parseVE <- function(ve) {
-  if (length(ve)==0) { return(character(0)) }
-  ve <- strsplit(unname(ve), " ")
-  ve <- lapply(ve, strsplit, "/")
-  v <- lapply(ve, function(x) sapply(x, "[", 1))
-  e <- lapply(ve, function(x) sapply(x, "[", 2))
-  int <- function(x) {
-    if (length(unique(x))==1) {
-      as.character(x[1])
-    } else {
-      paste(sep="", min(x), "-", max(x))
-    }
-  }
-  v <- sapply(v, int)
-  e <- sapply(e, int)
-  paste(v, sep="/", e)
-}
-
-print.nexusDatasetInfoList <- function(x, ...) {
-  summary(x)
-  
-  if (length(x)==0) { return(invisible(x)) }
-  
-  ve <- parseVE(unname(sapply(x, "[[", "vertices/edges")))
-  nets <- sapply(x, function(y) length(strsplit(y$networks, " ")[[1]]))
-  sid <- sapply(x, "[[", "sid")
-  if (any(nets>1)) {
-    sid[nets > 1] <- paste(sep="", sid[nets>1], ".", nets[nets>1])
-  }
-  df <- data.frame(no=paste(sep="", "[", format(seq_along(x)), "] "),
-                   sid=format(sid),
-                   size=paste(sep="", " ", format(ve)),
-                   id=paste(sep="", " #", format(sapply(x, "[[", "id")), " "),
-                   name=sapply(x, "[[", "name"))
-  out <- do.call(paste, c(as.list(df), sep=""))
-  long <- nchar(out) > getOption("width")  
-  out <- paste(sep="", substr(out, 1, getOption("width")-1),
-               ifelse(long, "+", ""))
-  cat(out, sep="\n")
-  invisible(x)
-}
-
-nexus.format.result <- function(l, name="") {
-  
-  if (length(l)==0) {
-    res <- list()
-    class(res) <- "nexusDatasetInfoList"
-    return(res)
-  }
-  
-  l <- lapply(l, function(x) c(sub("[ ]*:[^:]*$", "", x),
-                               sub("^[^:]*:[ ]*", "", x)))
-  spos <- which(sapply(l, function(x) x[1]=="id"))
-  epos <- c((spos-1), length(l))
-  ehead <- epos[1]
-  epos <- epos[-1]
-  
-  res <- mapply(spos, epos, SIMPLIFY=FALSE, FUN=function(s, e)
-                makeNexusDatasetInfo(l[s:e]))
-  class(res) <- "nexusDatasetInfoList"
-
-  for (h in 1:ehead) {
-    attr(res, l[[h]][1]) <- l[[h]][2]
-    attr(res, "name") <- name
-  }
-  
-  res
-}
-
-nexus.list <- function(tags=NULL, offset=0, limit=10,
-                       operator=c("or", "and"),
-                       order=c("date", "name", "popularity"),
-                       nexus.url=getIgraphOpt("nexus.url")) {
-
-  operator=igraph.match.arg(operator)
-  order=igraph.match.arg(order)
-  
-  if (is.null(tags)) {
-    u <- paste(sep="", nexus.url, "/api/dataset_info?format=text",
-               "&offset=", offset, "&limit=", limit, "&order=", order)
-    name <- "data set list"
-  } else {
-    tags <- paste(tags, collapse="|")
-    u <- paste(sep="", nexus.url, "/api/dataset_info?tag=", tags,
-               "&operator=", operator, "&format=text",
-               "&offset=", offset, "&limit=", limit, "&order=", order)
-    name <- paste("tags:", gsub("|", "; ", tags, fixed=TRUE))
-  }
-  f <- url(URLencode(u))
-  l <- readLines(f)
-  close(f)
-
-  nexus.format.result(l, name)
-}
-
-nexus.info <- function(id, nexus.url=getIgraphOpt("nexus.url")) {
-
-  if (inherits(id, "nexusDatasetInfo")) {
-    id <- id$id
-  } else if (inherits(id, "nexusDatasetInfoList")) {
-    rid <- sapply(id, "[[", "id")
-    res <- lapply(rid, nexus.info, nexus.url=nexus.url)
-    class(res) <- class(id)
-    attributes(res) <- attributes(id)
-    return(res)
-  }  
-  
-  u <- paste(sep="", nexus.url, "/api/dataset_info?format=text&id=", id)
-  f <- url(URLencode(u))
-  l <- readLines(f)
-  close(f)
-  l2 <- character()
-  for (i in seq_along(l)) {
-    if (!grepl("^  ", l[i])) {
-      l2 <- c(l2, l[i])
-    } else {
-      l2[length(l2)] <- paste(sep="\n", l2[length(l2)],
-                              sub("  ", "", l[i], fixed=TRUE))
-    }
-  }
-  l2 <- lapply(l2, function(x)
-               c(sub("[ ]*:.*$", "", x), sub("^[^:]*:[ ]*", "", x)))
-  res <- makeNexusDatasetInfo(l2)
-  if (! "attributes" %in% names(res)) { res$attributes <- list() }
-  return(res)
-}  
-
-nexus.get <- function(id, offset=0,
-                      order=c("date", "name", "popularity"),
-                      nexus.url=getIgraphOpt("nexus.url")) {
-
-  order=igraph.match.arg(order)
-
-  if (inherits(id, "nexusDatasetInfo")) {
-    id <- id$id
-  } else if (inherits(id, "nexusDatasetInfoList")) {
-    id <- sapply(id, "[[", "id")
-    return(lapply(id, nexus.get, nexus.url=nexus.url))
-  }
-  
-  u <- paste(sep="", nexus.url, "/api/dataset?id=", id, "&format=R-igraph")
-  env <- new.env()
-  rdata <- url(URLencode(u))
-  load(rdata, envir=env)
-  close(rdata)
-  return(get(ls(env)[1], env))
-}
-
-nexus.search <- function(q, offset=0, limit=10,
-                         order=c("date", "name", "popularity"),
-                         nexus.url=getIgraphOpt("nexus.url")) {
-
-  order=igraph.match.arg(order)
-
-  u <- paste(sep="", nexus.url, "/api/search?q=", q,
-             "&format=text","&offset=", offset, "&limit=", limit,
-             "&order=", order)
-  f <- url(URLencode(u))
-  l <- readLines(f)
-  close(f)
-
-  if (length(l)==0) {
-    res <- list()
-    class(res) <- "nexusDatasetInfoList"
-    return(res)
-  }
-
-  nexus.format.result(l, name=paste("q:", q))
-}
-
-`[.nexusDatasetInfoList` <- function(x, i) {
-  res <- unclass(x)[i]
-  class(res) <- class(x)
-  attributes(res) <- attributes(x)
-  res
-}
-
-'
-DATA SET LIST:
---------------
-
-NEXUS 1-10/18 -- data set list
-[ 1] kaptail.4         #18 39/109-223   Kapferer tailor shop
-[ 2] condmatcollab2003 #17 31163/120029 Condensed matter collaborations, 2003
-[ 3] condmatcollab     #16 16726/47594  Condensed matter collaborations, 1999
-[ 4] powergrid         #15 4941/6594    Western US power grid
-[ 5] celegansneural    #14 297/2359     C. Elegans neural network
-[ 6] polblogs          #13 1490/19090   US political blog network
-[ 7] dolphins          #12 62/159       Dolphin social network
-[ 8] football          #11 115/616      Network of American college ...
-[ 9] adjnoun           #10 112/425      Word adjacencies from David ...
-[10] huckleberry       # 9 74/301       Coappearance network from ...
-
-
-TAG SEARCH:
------------
-
-NEXUS 1-4/4 -- tags: directed
-[1] kaptail.4 #18 39/109-223 Kapferer tailor shop
-[2] polblogs  #13 1490/19090 US political blog network
-[3] macaque   # 4 45/463     Macaque visuotactile brain areas
-[4] UKfaculty # 2 81/817     UK faculty social network
-
-
-FULL TEXT SEARCH:
------------------
-  
-NEXUS 1-2/2 -- q: US
-[1] powergrid #15 4941/6594  Western US power grid
-[2] polblogs  #13 1490/19090 US political blog network
-
-
-DATA SET SUMMARY:
------------------
-  
-NEXUS B--- 39 109-223 -- #18 Kapferer tailor shop
-+ tags: directed; social network; undirected
-+ networks: 1/KAPFTI2; 2/KAPFTS2; 3/KAPFTI1; 4/KAPFTS1
-
-NEXUS U--- 4941 6594 -- #15 Western US power grid
-+ tags: technology
-
-DATA SET INFO:
---------------
-
-NEXUS B--- 39 109-223 -- #18 Kapferer tailor shop
-+ tags: directed; social network; undirected
-+ attr: name (v/c) [Actor names]
-+ networks: 1/KAPFTI2; 2/KAPFTS2; 3/KAPFTI1; 4/KAPFTS1
-+ nets: #1 KAPFTI2; #2 KAPFTS2; #3 KAPFTI1; #4 KAPFTS1
-+ date: 2011-01-23
-+ licence: Creative Commons by-sa 3.0
-+ licence url: http://creativecommons.org/licenses/by-sa/3.0/
-+ summary: Interactions in a tailor shop in Zambia (then
-  Northern Rhodesia) over a period of ten months.
-+ details: Bruce Kapferer (1972) observed interactions in a tailor
-  shop in Zambia (then Northern Rhodesia) over a period of ten months.
-  His focus was the changing patterns of alliance among workers during
-  extended negotiations for higher wages. . The matrices represent two
-  different types of interaction, recorded at two different times
-  (seven months apart) over a period of one month. TI1 and TI2 record
-  the "instrumental" (work- and assistance-related) interactions at the
-  two times; TS1 and TS2 the "sociational" (friendship, socioemotional)
-  interactions. . The data are particularly interesting since an
-  abortive strike occurred after the first set of observations, and a
-  successful strike took place after the second.
-+ formats: Pajek; R-igraph
-+ citation: Kapferer B. (1972). Strategy and transaction in an African
-  factory. Manchester: Manchester University Press. 
-'
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/operators.R igraph-0.6.5/interfaces/R/igraph/R/operators.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/operators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/operators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,236 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-graph.disjoint.union <- function(...) {
-
-  graphs <- unlist(recursive=FALSE, lapply(list(...), function(l) {
-    if (is.igraph(l)) list(l) else l
-  } ))
-  if (!all(sapply(graphs, is.igraph))) {
-    stop("Not a graph object")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_disjoint_union", graphs,
-        PACKAGE="igraph")
-}
-
-"%du%" <- function(x,y) {
-  graph.disjoint.union(x,y)
-}
-
-graph.union <- function(...) {
-
-  graphs <- unlist(recursive=FALSE, lapply(list(...), function(l) {
-    if (is.igraph(l)) list(l) else l
-  } ))
-  if (!all(sapply(graphs, is.igraph))) {
-    stop("Not a graph object")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_union", graphs,
-        PACKAGE="igraph")
-}
-
-"%u%" <- function(x,y) {
-  graph.union(x,y)
-}
-
-graph.intersection <- function(...) {
-
-  graphs <- unlist(recursive=FALSE, lapply(list(...), function(l) {
-    if (is.igraph(l)) list(l) else l
-  } ))
-  if (!all(sapply(graphs, is.igraph))) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_intersection", graphs,
-        PACKAGE="igraph")
-}
-
-"%s%" <- function(x,y) {
-  graph.intersection(x,y)
-}
-
-graph.difference <- function(big, small) {
-
-  if (!is.igraph(big) || !is.igraph(small)) {
-    stop("argument is not a graph")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_difference", big, small,
-        PACKAGE="igraph")
-}
-    
-"%m%" <- function(x,y) {
-  graph.difference(x,y)
-}
-
-graph.complementer <- function(graph, loops=FALSE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_complementer", graph, as.logical(loops),
-        PACKAGE="igraph")
-}
-
-graph.compose <- function(g1, g2) {
-
-  if (!is.igraph(g1) || !is.igraph(g2)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_compose", g1, g2,
-        PACKAGE="igraph")
-}
-
-"%c%" <- function(x,y) {
-  graph.compose(x,y)
-}
-
-edge <- function(...) {
-  structure(list(...), class="igraph.edge")
-}
-
-edges <- edge
-
-vertex <- function(...) {
-  structure(list(...), class="igraph.vertex")
-}
-
-vertices <- vertex
-
-path <- function(...) {
-  structure(list(...), class="igraph.path")
-}
-
-`+.igraph` <- function(e1, e2) {
-  if (!is.igraph(e1) && is.igraph(e2)) {
-    tmp <- e1
-    e1 <- e2
-    e2 <- tmp
-  }
-  if (is.igraph(e2)) {
-    ## Disjoint union of graphs
-    res <- graph.disjoint.union(e1,e2)
-
-  } else if ("igraph.edge" %in% class(e2)) {
-    ## Adding edges, possibly with attributes
-    ## Non-named arguments define the edges
-    if (is.null(names(e2))) {
-      toadd <- unlist(e2, recursive=FALSE)
-      attr <- list()
-    } else {
-      toadd <- unlist(e2[names(e2)==""])
-      attr <- e2[names(e2)!=""]
-    }
-    res <- add.edges(e1, as.igraph.vs(e1, toadd), attr=attr)
-
-  } else if ("igraph.vertex" %in% class(e2)) {
-    ## Adding vertices, possibly with attributes
-    ## If there is a single unnamed argument, that contains the vertex names
-    wn <- which(names(e2)=="")
-    if (length(wn)==1) {
-      names(e2)[wn] <- "name"
-    } else if (is.null(names(e2))) {
-    ## No names at all, everything is a vertex name
-      e2 <- list(name=unlist(e2, recursive=FALSE))
-    } else if (length(wn)==0) {
-    ## If there are no non-named arguments, we are fine
-    } else {
-    ## Otherwise, all unnamed arguments are collected and used as
-    ## vertex names
-      nn <- unlist(e2[wn], recursive=FALSE)
-      e2 <- c(list(name=nn), e2[names(e2)!=""])
-    }
-    la <- unique(sapply(e2, length))
-    res <- add.vertices(e1, la, attr=e2)
-
-  } else if ("igraph.path" %in% class(e2)) {
-    ## Adding edges along a path, possibly with attributes
-    ## Non-named arguments define the edges
-    if (is.null(names(e2))) {
-      toadd <- unlist(e2, recursive=FALSE)
-      attr <- list()
-    } else {
-      toadd <- unlist(e2[names(e2)==""])
-      attr <- e2[names(e2)!=""]
-    }
-    toadd <- as.igraph.vs(e1, toadd)
-    lt <- length(toadd)
-    if (lt >= 2) {
-      toadd <- c(toadd[1], rep(toadd[2:(lt-1)], each=2), toadd[lt])
-      res <- add.edges(e1, toadd, attr=attr)
-    } else {
-      res <- e1
-    }
-    
-  } else if (is.numeric(e2) && length(e2)==1) {
-    ## Adding some isolate vertices
-    res <- add.vertices(e1, e2)
-
-  } else if (is.character(e2)) {
-    ## Adding named vertices
-    res <- add.vertices(e1, length(e2), name=e2)
-    
-  } else {
-    stop("Cannot add unknown type to igraph graph")
-  }
-  res
-}
-
-`-.igraph` <- function(e1, e2) {
-  if (missing(e2)) {
-    stop("Non-numeric argument to negation operator")
-  }
-  if (is.igraph(e2)) {
-    res <- graph.difference(e1, e2)
-  } else if ("igraph.vertex" %in% class(e2)) {
-    res <- delete.vertices(e1, unlist(e2, recursive=FALSE))
-  } else if ("igraph.edge" %in% class(e2)) {
-    res <- delete.edges(e1, unlist(e2, recursive=FALSE))
-  } else if ("igraph.path" %in% class(e2)) {
-    todel <- unlist(e2, recursive=FALSE)
-    lt <- length(todel)
-    if (lt >= 2) {
-      todel <- paste(todel[-lt], todel[-1], sep="|")
-      res <- delete.edges(e1, todel)
-    } else {
-      res <- e1
-    }
-  } else if ("igraph.vs" %in% class(e2)) {
-    res <- delete.vertices(e1, e2)
-  } else if ("igraph.es" %in% class(e2)) {
-    res <- delete.edges(e1, e2)
-  } else if (is.numeric(e2) || is.character(e2)) {
-    res <- delete.vertices(e1, e2)
-  } else {
-    stop("Cannot substract unknown type from igraph graph")
-  }
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/other.R igraph-0.6.5/interfaces/R/igraph/R/other.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/other.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/other.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,67 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-running.mean <- function(v, binwidth) {
-
-  v <- as.numeric(v)
-  binwidth <- as.numeric(binwidth)
-  if (length(v) < binwidth) {
-    stop("Vector too short for this binwidth.")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_running_mean", v, binwidth,
-       PACKAGE="igraph");
-}
-
-igraph.sample <- function(low, high, length) {
-  if (length>high-low+1) {
-    stop("length too big for this interval")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_random_sample", as.numeric(low), as.numeric(high),
-        as.numeric(length),
-        PACKAGE="igraph")
-}
-
-igraph.match.arg <- function(arg, choices, several.ok=FALSE) {
-  if (missing(choices)) {
-    formal.args <- formals(sys.function(sys.parent()))
-    choices <- eval(formal.args[[deparse(substitute(arg))]])
-  }
-
-  arg <- tolower(arg)
-  choices <- tolower(choices)
-
-  match.arg(arg=arg, choices=choices, several.ok=several.ok)
-}
-
-igraph.i.spMatrix <- function(M) {
-  require(Matrix)
-  if (M$type == "triplet") {
-    sparseMatrix(dims=M$dim, i=M$i+1L, j=M$p+1L, x=M$x)
-  } else {
-    new("dgCMatrix", Dim=M$dim, Dimnames=list(NULL, NULL),
-        factors=list(), i=M$i, p=M$p, x=M$x)
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/package.R igraph-0.6.5/interfaces/R/igraph/R/package.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/package.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/package.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-.onAttach <- function(library, pkg) {
-    ## we can't do this in .onLoad
-    unlockBinding(".igraph.pars", asNamespace("igraph"))
-    unlockBinding(".igraph.pb", asNamespace("igraph"))
-    invisible()
-}
-
-.onLoad <- function(libname, pkgname) {
-  library.dynam("igraph", pkgname, libname, local=FALSE);
-  .Call("R_igraph_init", FALSE, FALSE, PACKAGE="igraph")
-}
-
-.onUnload <- function(libpath) {
-  library.dynam.unload("igraph", libpath)
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/par.R igraph-0.6.5/interfaces/R/igraph/R/par.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/par.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/par.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,106 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-.igraph.pars <- list("print.vertex.attributes"=FALSE,
-                    "print.edge.attributes"=FALSE,
-                    "print.graph.attributes"=FALSE,
-                    "verbose"=FALSE,
-                    "vertex.attr.comb"=list(name="concat", "ignore"),
-                    "edge.attr.comb"=list(weight="sum", name="concat",
-                      "ignore"),
-                     "sparsematrices"=TRUE,
-                     "nexus.url"="http://nexus.igraph.org",
-                     "add.params"=TRUE,
-                     "add.vertex.names"=TRUE,
-                     "dend.plot.type"="auto",
-                     "print.full"=FALSE
-                    )
-
-igraph.pars.set.verbose <- function(verbose) {
-  if (is.logical(verbose)) {
-    .Call("R_igraph_set_verbose", verbose, PACKAGE="igraph")
-  } else if (is.character(verbose)) {
-    if (!verbose %in% c("tk", "tkconsole")) {
-      stop("Unknown 'verbose' value")
-    }
-    if (verbose %in% c("tk", "tkconsole")) {
-      if (!capabilities()[["X11"]]) { stop("X11 not available")           }
-      if (!require("tcltk"))        { stop("tcltk package not available") }
-    }
-    .Call("R_igraph_set_verbose", verbose, PACKAGE="igraph")
-  } else {
-    stop("'verbose' should be a logical or character scalar")
-  }
-  verbose
-}
-
-igraph.pars.callbacks <- list("verbose"=igraph.pars.set.verbose)
-
-## This is based on 'sm.options' in the 'sm' package
-
-igraph.options <- function(...) {
-  if (nargs() == 0) return(.igraph.pars)
-  current <- .igraph.pars
-  temp <- list(...)
-  if (length(temp) == 1 && is.null(names(temp))) {
-    arg <- temp[[1]]
-    switch(mode(arg),
-           list = temp <- arg,
-           character = return(.igraph.pars[arg]),
-           stop("invalid argument: ", sQuote(arg)))
-  }
-  if (length(temp) == 0) return(current)
-  n <- names(temp)
-  if (is.null(n)) stop("options must be given by name")
-  env <- asNamespace("igraph")
-  cb <- intersect(names(igraph.pars.callbacks), n)
-  for (cn in cb) {
-    temp[[cn]] <- igraph.pars.callbacks[[cn]](temp[[cn]])
-  }
-  current <- .igraph.pars               # callback might have updated it
-  current[n] <- temp
-  assign(".igraph.pars", current, envir = env)
-  invisible(current)
-}
-
-getIgraphOpt <- function(x, default=NULL) {
-  if (missing(default)) 
-    return(igraph.options(x)[[1L]])
-  if (x %in% names(igraph.options())) 
-    igraph.options(x)[[1L]]
-  else default
-}
-
-## This is deprecated from 0.6
-
-igraph.par <- function(parid, parvalue=NULL) {
-
-  .Deprecated("igraph.options", package="igraph")
-  
-  if (is.null(parvalue)) {
-    res <- .igraph.pars[[parid]]
-    res
-  } else {
-    .igraph.pars[[parid]] <- parvalue
-    invisible(parvalue)
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.R igraph-0.6.5/interfaces/R/igraph/R/plot.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/plot.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,720 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2003-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-plot.igraph <- function(x, 
-                       # SPECIFIC: #####################################
-                       axes=FALSE, xlab="", ylab="", add=FALSE,
-                       xlim=c(-1,1), ylim=c(-1,1), main="", sub="",
-                       mark.groups=list(), mark.shape=1/2,
-                       mark.col=rainbow(length(mark.groups), alpha=0.3),
-                       mark.border=rainbow(length(mark.groups), alpha=1),
-                       mark.expand=15,
-                       ...) {
-
-  graph <- x
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  ################################################################
-  ## Visual parameters
-  params <- i.parse.plot.params(graph, list(...))
-  vertex.size        <- 1/200 * params("vertex", "size")
-  label.family       <- params("vertex", "label.family")
-  label.font         <- params("vertex", "label.font")
-  label.cex          <- params("vertex", "label.cex")
-  label.degree       <- params("vertex", "label.degree")
-  label.color        <- params("vertex", "label.color")
-  label.dist         <- params("vertex", "label.dist")
-  labels             <- params("vertex", "label")
-  shape              <- igraph.check.shapes(params("vertex", "shape"))
-
-  edge.color         <- params("edge", "color")
-  edge.width         <- params("edge", "width")
-  edge.lty           <- params("edge", "lty")
-  arrow.mode         <- params("edge", "arrow.mode")
-  edge.labels        <- params("edge", "label")
-  loop.angle         <- params("edge", "loop.angle")
-  edge.label.font    <- params("edge", "label.font")
-  edge.label.family  <- params("edge", "label.family")
-  edge.label.cex     <- params("edge", "label.cex")
-  edge.label.color   <- params("edge", "label.color")
-  arrow.size         <- params("edge", "arrow.size")[1]
-  arrow.width        <- params("edge", "arrow.width")[1]
-  curved             <- params("edge", "curved")
-  if (is.function(curved)) { curved <- curved(graph) }
-  
-  layout             <- params("plot", "layout")
-  margin             <- params("plot", "margin")
-  margin <- rep(margin, length=4)
-  rescale            <- params("plot", "rescale")
-  asp                <- params("plot", "asp")
-  frame              <- params("plot", "frame")
-
-  # the new style parameters can't do this yet
-  arrow.mode         <- i.get.arrow.mode(graph, arrow.mode)
-
-  ################################################################
-  ## create the plot
-  maxv <- max(vertex.size)
-  if (rescale) {
-    # norm layout to (-1, 1)
-    layout <- layout.norm(layout, -1, 1, -1, 1)
-    xlim <- c(xlim[1]-margin[2]-maxv, xlim[2]+margin[4]+maxv)
-    ylim <- c(ylim[1]-margin[1]-maxv, ylim[2]+margin[3]+maxv)
-  }
-  if (!add) {
-    plot(0, 0, type="n", xlab=xlab, ylab=ylab, xlim=xlim, ylim=ylim,
-         axes=axes, frame=frame, asp=asp, main=main, sub=sub)
-  }
-
-  ################################################################
-  ## Mark vertex groups
-  if (!is.list(mark.groups) && is.numeric(mark.groups)) {
-    mark.groups <- list(mark.groups)
-  }
-
-  mark.shape  <- rep(mark.shape,  length=length(mark.groups))
-  mark.border <- rep(mark.border, length=length(mark.groups))
-  mark.col    <- rep(mark.col,    length=length(mark.groups))
-  mark.expand <- rep(mark.expand, length=length(mark.groups))
-  
-  for (g in seq_along(mark.groups)) {
-    v <- mark.groups[[g]]
-    if (length(vertex.size)==1) {
-      vs <- vertex.size
-    } else {
-      vs <- rep(vertex.size, length=vcount(graph))[v]
-    }
-    igraph.polygon(layout[v,,drop=FALSE],
-                   vertex.size=vs,
-                   expand.by=mark.expand[g]/200,
-                   shape=mark.shape[g],
-                   col=mark.col[g],
-                   border=mark.border[g])
-  }
-
-  ################################################################
-  ## calculate position of arrow-heads
-  el <- get.edgelist(graph, names=FALSE)
-  loops.v <- el[,1] [ el[,1] == el[,2] ]
-  loops.e <- which(el[,1] == el[,2])
-  nonloops.e <- which(el[,1] != el[,2])
-  loop.labels <- edge.labels[el[,1] == el[,2]]
-  edge.labels <- edge.labels[el[,1] != el[,2]]
-  el <- el[el[,1] != el[,2],,drop=FALSE]
-
-  edge.coords <- matrix(0, nrow=nrow(el), ncol=4)
-  edge.coords[,1] <- layout[,1][ el[,1] ]
-  edge.coords[,2] <- layout[,2][ el[,1] ]
-  edge.coords[,3] <- layout[,1][ el[,2] ]
-  edge.coords[,4] <- layout[,2][ el[,2] ]
-  if ( length(unique(shape)) == 1) {
-    ## same vertex shape for all vertices
-    ec <- .igraph.shapes[[ shape[1] ]]$clip(edge.coords, el,
-                                            params=params, end="both")
-  } else {
-    ## different vertex shapes, do it by "endpoint"
-    shape <- rep(shape, length=vcount(graph))
-    ec <- edge.coords
-    ec[,1:2] <- t(sapply(seq(length=nrow(el)), function(x) {
-      .igraph.shapes[[ shape[el[x,1]] ]]$clip(edge.coords[x,,drop=FALSE],
-                                              el[x,,drop=FALSE],
-                                              params=params, end="from")
-    }))
-    ec[,3:4] <- t(sapply(seq(length=nrow(el)), function(x) {
-      .igraph.shapes[[ shape[el[x,2]] ]]$clip(edge.coords[x,,drop=FALSE],
-                                              el[x,,drop=FALSE],
-                                              params=params, end="to")
-    }))
-  }
-  
-  x0 <- ec[,1] ; y0 <- ec[,2] ; x1 <- ec[,3] ; y1 <- ec[,4]
-
-  ################################################################
-  ## add the loop edges
-  if (length(loops.e) > 0) {
-    ec <- edge.color
-    if (length(ec)>1) { ec <- ec[loops.e] }
-
-    point.on.cubic.bezier <- function(cp, t) {
-
-      c <- 3 * (cp[2,] - cp[1,])
-      b <- 3 * (cp[3,] - cp[2,]) - c
-      a <- cp[4,] - cp[1,] - c - b
-      
-      t2 <- t*t;
-      t3 <- t*t*t
-      
-      a*t3 + b*t2 + c*t + cp[1,]
-    }
-
-    compute.bezier <- function(cp, points) {
-      dt <- seq(0, 1, by=1/(points-1))
-      sapply(dt, function(t) point.on.cubic.bezier(cp, t))
-    }
-    
-    plot.bezier <- function(cp, points, color, width, arr, lty, arrow.size, arr.w) {
-      p <- compute.bezier( cp, points )
-      polygon(p[1,], p[2,], border=color, lwd=width, lty=lty)
-      if (arr==1 || arr==3) {
-        igraph.Arrows(p[1,ncol(p)-1], p[2,ncol(p)-1], p[1,ncol(p)], p[2,ncol(p)],
-                      sh.col=color, h.col=color, size=arrow.size,
-                      sh.lwd=width, h.lwd=width, open=FALSE, code=2, width=arr.w)
-      }
-      if (arr==2 || arr==3) {
-        igraph.Arrows(p[1,2], p[2,2], p[1,1], p[2,1],
-                      sh.col=color, h.col=color, size=arrow.size,
-                      sh.lwd=width, h.lwd=width, open=FALSE, code=2, width=arr.w)
-      }
-    }
-    
-    loop <- function(x0, y0, cx=x0, cy=y0, color, angle=0, label=NA,
-                     width=1, arr=2, lty=1, arrow.size=arrow.size, arr.w=arr.w) {
-
-      rad <- angle
-      center <- c(cx,cy)
-      cp <- matrix( c(x0,y0, x0+.4,y0+.2, x0+.4,y0-.2, x0,y0),
-                   ncol=2, byrow=TRUE)
-      phi <- atan2(cp[,2]-center[2], cp[,1]-center[1])
-      r <- sqrt((cp[,1]-center[1])**2 + (cp[,2]-center[2])**2)
-      
-      phi <- phi + rad
-
-      cp[,1] <- cx+r*cos(phi)
-      cp[,2] <- cy+r*sin(phi)
-
-      plot.bezier(cp, 50, color, width, arr=arr, lty=lty, arrow.size=arrow.size, arr.w=arr.w)
-
-      if (is.language(label) || !is.na(label)) {
-        lx <- x0+.3
-        ly <- y0
-        phi <- atan2(ly-center[2], lx-center[1])
-        r <- sqrt((lx-center[1])**2 + (ly-center[2])**2)
-
-        phi <- phi + rad
-
-        lx <- cx+r*cos(phi)
-        ly <- cy+r*sin(phi)
-
-        text(lx, ly, label, col=edge.label.color, font=edge.label.font,
-             family=edge.label.family, cex=edge.label.cex)
-      }
-    }
-
-    ec <- edge.color
-    if (length(ec)>1) { ec <- ec[loops.e] }
-    vs <- vertex.size
-    if (length(vertex.size)>1) { vs <- vs[loops.v] }
-    ew <- edge.width
-    if (length(edge.width)>1) { ew <- ew[loops.e] }
-    la <- loop.angle
-    if (length(loop.angle)>1) { la <- la[loops.e] }
-    lty <- edge.lty
-    if (length(edge.lty)>1) { lty <- lty[loops.e] }
-    arr <- arrow.mode
-    if (length(arrow.mode)>1) { arr <- arrow.mode[loops.e] }
-    asize <- arrow.size
-    if (length(arrow.size)>1) { asize <- arrow.size[loops.e] }
-    xx0 <- layout[loops.v,1] + cos(la) * vs
-    yy0 <- layout[loops.v,2] - sin(la) * vs
-    mapply(loop, xx0, yy0,
-           color=ec, angle=-la, label=loop.labels, lty=lty,
-           width=ew, arr=arr, arrow.size=asize, arr.w=arrow.width)
-  }
-
-  ################################################################
-  ## non-loop edges
-  if (length(x0) != 0) {
-    if (length(edge.color)>1) { edge.color <- edge.color[nonloops.e] }
-    if (length(edge.width)>1) { edge.width <- edge.width[nonloops.e] }
-    if (length(edge.lty)>1) { edge.lty <- edge.lty[nonloops.e] }
-    if (length(arrow.mode)>1) { arrow.mode <- arrow.mode[nonloops.e] }
-    if (length(arrow.size)>1) { arrow.size <- arrow.size[nonloops.e] }
-    if (length(curved)>1) { curved <- curved[nonloops.e] }
-    if (length(unique(arrow.mode))==1) {
-      igraph.Arrows(x0, y0, x1, y1, h.col=edge.color, sh.col=edge.color,
-                    sh.lwd=edge.width, h.lwd=1, open=FALSE, code=arrow.mode[1],
-                    sh.lty=edge.lty, h.lty=1, size=arrow.size,
-                    width=arrow.width, curved=curved)
-    } else {
-      ## different kinds of arrows drawn separately as 'arrows' cannot
-      ## handle a vector as the 'code' argument
-      curved <- rep(curved, length=ecount(graph))[nonloops.e]
-      for (code in 0:3) {
-        valid <- arrow.mode==code
-        if (!any(valid)) { next }
-        ec <- edge.color ; if (length(ec)>1) { ec <- ec[valid] }
-        ew <- edge.width ; if (length(ew)>1) { ew <- ew[valid] }
-        el <- edge.lty   ; if (length(el)>1) { el <- el[valid] }
-        igraph.Arrows(x0[valid], y0[valid], x1[valid], y1[valid],
-                      code=code, sh.col=ec, h.col=ec, sh.lwd=ew, h.lwd=1,
-                      h.lty=1, sh.lty=el, open=FALSE, size=arrow.size,
-                      width=arrow.width, curved=curved[valid])
-      }
-    }
-    phi <- atan2(y1-y0, x1-x0)
-    r <- sqrt( (x1-x0)^2 + (y1-y0)^2 )
-    x <- x0 + 2/3*r*cos(phi)
-    y <- y0 + 2/3*r*sin(phi)
-    text(x, y, labels=edge.labels, col=edge.label.color, family=edge.label.family,
-         font=edge.label.font, cex=edge.label.cex)
-  }
-  
-  rm(x0, y0, x1, y1)
-  
-  ################################################################
-  # add the vertices
-  if (length(unique(shape)) == 1) {
-    .igraph.shapes[[ shape[1] ]]$plot(layout, params=params)
-  } else {
-    sapply(seq(length=vcount(graph)), function(x) {
-      .igraph.shapes[[ shape[x] ]]$plot(layout[x,,drop=FALSE], v=x,
-                                        params=params)
-    })
-  }
-      
-  ################################################################
-  # add the labels
-  par(xpd=TRUE)
-  x <- layout[,1]+label.dist*cos(-label.degree)* 
-    (vertex.size+6*8*log10(nchar(labels)+1))/200
-  y <- layout[,2]+label.dist*sin(-label.degree)*
-    (vertex.size+6*8*log10(nchar(labels)+1))/200
-  if (length(label.family)==1) {
-    text(x, y, labels=labels, col=label.color, family=label.family,
-         font=label.font, cex=label.cex)
-  } else {
-    if1 <- function(vect, idx) if (length(vect)==1) vect else vect[idx]
-    sapply(seq_len(vcount(graph)), function(v) {
-      text(x[v], y[v], labels=if1(labels, v), col=if1(label.color, v),
-           family=if1(label.family, v), font=if1(label.font, v),
-           cex=if1(label.cex, v))
-    })
-  }
-  rm(x, y)
-  invisible(NULL)
-}
-
-rglplot        <- function(x, ...)
-  UseMethod("rglplot", x)
-
-rglplot.igraph <- function(x, ...) {
-
-  require(rgl)
-  
-  graph <- x
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  create.edge <- function(v1, v2, r1, r2, ec, ew, am, as) {
-    ## these could also be parameters:
-    aw <- 0.005*3*as                      # arrow width
-    al <- 0.005*4*as                      # arrow length    
-    
-    dist <- sqrt(sum((v2-v1)^2))   # distance of the centers
-
-    if (am==0) {
-      edge <- qmesh3d(c(-ew/2,-ew/2,dist,1, ew/2,-ew/2,dist,1, ew/2,ew/2,dist,1,
-                        -ew/2,ew/2,dist,1,  -ew/2,-ew/2,0,1, ew/2,-ew/2,0,1,
-                        ew/2,ew/2,0,1, -ew/2,ew/2,0,1),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7, 4,1,5,8))
-    } else if (am==1) {
-      edge <- qmesh3d(c(-ew/2,-ew/2,dist,1, ew/2,-ew/2,dist,1,
-                        ew/2,ew/2,dist,1, -ew/2,ew/2,dist,1,
-                        -ew/2,-ew/2,al+r1,1, ew/2,-ew/2,al+r1,1,
-                        ew/2,ew/2,al+r1,1, -ew/2,ew/2,al+r1,1,
-                        -aw/2,-aw/2,al+r1,1, aw/2,-aw/2,al+r1,1,
-                        aw/2,aw/2,al+r1,1, -aw/2,aw/2,al+r1,1, 0,0,r1,1),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7, 4,1,5,8,
-                        9,10,11,12, 9,12,13,13, 9,10,13,13, 10,11,13,13,
-                        11,12,13,13))
-    } else if (am==2) {
-      box <- dist-r2-al
-      edge <- qmesh3d(c(-ew/2,-ew/2,box,1, ew/2,-ew/2,box,1, ew/2,ew/2,box,1,
-                        -ew/2,ew/2,box,1,  -ew/2,-ew/2,0,1, ew/2,-ew/2,0,1,
-                        ew/2,ew/2,0,1, -ew/2,ew/2,0,1,
-                        -aw/2,-aw/2,box,1, aw/2,-aw/2,box,1, aw/2,aw/2,box,1,
-                        -aw/2,aw/2,box,1, 0,0,box+al,1),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7, 4,1,5,8,
-                        9,10,11,12, 9,12,13,13, 9,10,13,13, 10,11,13,13,
-                        11,12,13,13))
-    } else {
-      edge <- qmesh3d(c(-ew/2,-ew/2,dist-al-r2,1, ew/2,-ew/2,dist-al-r2,1,
-                        ew/2,ew/2,dist-al-r2,1, -ew/2,ew/2,dist-al-r2,1,
-                        -ew/2,-ew/2,r1+al,1, ew/2,-ew/2,r1+al,1,
-                        ew/2,ew/2,r1+al,1, -ew/2,ew/2,r1+al,1,
-                        -aw/2,-aw/2,dist-al-r2,1, aw/2,-aw/2,dist-al-r2,1,
-                        aw/2,aw/2,dist-al-r2,1, -aw/2,aw/2,dist-al-r2,1,
-                        -aw/2,-aw/2,r1+al,1, aw/2,-aw/2,r1+al,1,
-                        aw/2,aw/2,r1+al,1, -aw/2,aw/2,r1+al,1,
-                        0,0,dist-r2,1, 0,0,r1,1),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7, 4,1,5,8,
-                        9,10,11,12, 9,12,17,17, 9,10,17,17, 10,11,17,17,
-                        11,12,17,17,
-                        13,14,15,16, 13,16,18,18, 13,14,18,18, 14,15,18,18,
-                        15,16,18,18))
-    }
-      
-
-    ## rotate and shift it to its position
-    phi<- -atan2(v2[2]-v1[2],v1[1]-v2[1])-pi/2
-    psi<- acos((v2[3]-v1[3])/dist)    
-    rot1 <- rbind(c(1,0,0),c(0,cos(psi),sin(psi)), c(0,-sin(psi),cos(psi)))
-    rot2 <- rbind(c(cos(phi),sin(phi),0),c(-sin(phi),cos(phi),0), c(0,0,1))
-    rot <- rot1 %*% rot2
-    edge <- transform3d(edge, rotationMatrix(matrix=rot))
-    edge <- transform3d(edge, translationMatrix(v1[1], v1[2], v1[3]))
-
-    ## we are ready 
-    shade3d(edge, col=ec)
-  }
-  
-  create.loop <- function(v, r, ec, ew, am, la, la2, as) {
-    aw <- 0.005*3*as
-    al <- 0.005*4*as
-    wi <- aw*2                          # size of the loop
-    wi2 <- wi+aw-ew                     # size including the arrow heads
-    hi <- al*2+ew*2
-    gap <- wi-2*ew
-
-    if (am==0) {
-      edge <- qmesh3d(c(-wi/2,-ew/2,0,1, -gap/2,-ew/2,0,1,
-                        -gap/2,ew/2,0,1, -wi/2,ew/2,0,1,
-                        -wi/2,-ew/2,hi-ew+r,1, -gap/2,-ew/2,hi-ew+r,1,
-                        -gap/2,ew/2,hi-ew+r,1, -wi/2,ew/2,hi-ew+r,1,
-                        wi/2,-ew/2,0,1, gap/2,-ew/2,0,1,
-                        gap/2,ew/2,0,1, wi/2,ew/2,0,1,
-                        wi/2,-ew/2,hi-ew+r,1, gap/2,-ew/2,hi-ew+r,1,
-                        gap/2,ew/2,hi-ew+r,1, wi/2,ew/2,hi-ew+r,1,
-                        -wi/2,-ew/2,hi+r,1, -wi/2,ew/2,hi+r,1,
-                        wi/2,-ew/2,hi+r,1, wi/2,ew/2,hi+r,1
-                        ),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7,
-                        1,4,18,17,
-                        9,10,11,12, 13,14,15,16, 9,10,14,13, 10,11,15,14,
-                        11,12,16,15, 9,12,20,19,
-                        5,13,19,17, 17,18,20,19, 8,16,20,18, 6,7,15,14
-                        ))
-    } else if (am==1 || am==2) {
-      edge <- qmesh3d(c(-wi/2,-ew/2,r+al,1, -gap/2,-ew/2,r+al,1,
-                        -gap/2,ew/2,r+al,1, -wi/2,ew/2,r+al,1,
-                        -wi/2,-ew/2,hi-ew+r,1, -gap/2,-ew/2,hi-ew+r,1,
-                        -gap/2,ew/2,hi-ew+r,1, -wi/2,ew/2,hi-ew+r,1,
-                        wi/2,-ew/2,0,1, gap/2,-ew/2,0,1,
-                        gap/2,ew/2,0,1, wi/2,ew/2,0,1,
-                        wi/2,-ew/2,hi-ew+r,1, gap/2,-ew/2,hi-ew+r,1,
-                        gap/2,ew/2,hi-ew+r,1, wi/2,ew/2,hi-ew+r,1,
-                        -wi/2,-ew/2,hi+r,1, -wi/2,ew/2,hi+r,1,
-                        wi/2,-ew/2,hi+r,1, wi/2,ew/2,hi+r,1,
-                        # the arrow
-                        -wi2/2,-aw/2,r+al,1, -wi2/2+aw,-aw/2,r+al,1,
-                        -wi2/2+aw,aw/2,r+al,1, -wi2/2,aw/2,r+al,1,
-                        -wi2/2+aw/2,0,r,1                   
-                        ),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7,
-                        1,4,18,17,
-                        9,10,11,12, 13,14,15,16, 9,10,14,13, 10,11,15,14,
-                        11,12,16,15, 9,12,20,19,
-                        5,13,19,17, 17,18,20,19, 8,16,20,18, 6,7,15,14,
-                        # the arrow
-                        21,22,23,24, 21,22,25,25, 22,23,25,25, 23,24,25,25,
-                        21,24,25,25
-                        ))
-    } else if (am==3) {
-      edge <- qmesh3d(c(-wi/2,-ew/2,r+al,1, -gap/2,-ew/2,r+al,1,
-                        -gap/2,ew/2,r+al,1, -wi/2,ew/2,r+al,1,
-                        -wi/2,-ew/2,hi-ew+r,1, -gap/2,-ew/2,hi-ew+r,1,
-                        -gap/2,ew/2,hi-ew+r,1, -wi/2,ew/2,hi-ew+r,1,
-                        wi/2,-ew/2,r+al,1, gap/2,-ew/2,r+al,1,
-                        gap/2,ew/2,r+al,1, wi/2,ew/2,r+al,1,
-                        wi/2,-ew/2,hi-ew+r,1, gap/2,-ew/2,hi-ew+r,1,
-                        gap/2,ew/2,hi-ew+r,1, wi/2,ew/2,hi-ew+r,1,
-                        -wi/2,-ew/2,hi+r,1, -wi/2,ew/2,hi+r,1,
-                        wi/2,-ew/2,hi+r,1, wi/2,ew/2,hi+r,1,
-                        # the arrows
-                        -wi2/2,-aw/2,r+al,1, -wi2/2+aw,-aw/2,r+al,1,
-                        -wi2/2+aw,aw/2,r+al,1, -wi2/2,aw/2,r+al,1,
-                        -wi2/2+aw/2,0,r,1,
-                        wi2/2,-aw/2,r+al,1, wi2/2-aw,-aw/2,r+al,1,
-                        wi2/2-aw,aw/2,r+al,1, wi2/2,aw/2,r+al,1,
-                        wi2/2-aw/2,0,r,1                   
-                        ),
-                      c(1,2,3,4, 5,6,7,8, 1,2,6,5, 2,3,7,6, 3,4,8,7,
-                        1,4,18,17,
-                        9,10,11,12, 13,14,15,16, 9,10,14,13, 10,11,15,14,
-                        11,12,16,15, 9,12,20,19,
-                        5,13,19,17, 17,18,20,19, 8,16,20,18, 6,7,15,14,
-                        # the arrows
-                        21,22,23,24, 21,22,25,25, 22,23,25,25, 23,24,25,25,
-                        21,24,25,25,
-                        26,27,28,29, 26,27,30,30, 27,28,30,30, 28,29,30,30,
-                        26,29,30,30
-                        ))
-    }
-
-    # rotate and shift to its position
-    rot1 <- rbind(c(1,0,0),c(0,cos(la2),sin(la2)), c(0,-sin(la2),cos(la2)))
-    rot2 <- rbind(c(cos(la),sin(la),0),c(-sin(la),cos(la),0), c(0,0,1))
-    rot <- rot1 %*% rot2
-    edge <- transform3d(edge, rotationMatrix(matrix=rot))
-    edge <- transform3d(edge, translationMatrix(v[1], v[2], v[3]))
-
-    ## we are ready
-    shade3d(edge, col=ec)
-  }
-  
-  # Visual parameters
-  params <- i.parse.plot.params(graph, list(...))
-  labels <- params("vertex", "label")
-  label.color <- params("vertex", "label.color")
-  label.font <- params("vertex", "label.font")
-  label.degree <- params("vertex", "label.degree")
-  label.dist <- params("vertex", "label.dist")
-  vertex.color <- params("vertex", "color")
-  vertex.size <- (1/200) * params("vertex", "size")
-  loop.angle <- params("edge", "loop.angle")
-  loop.angle2 <- params("edge", "loop.angle2")
-
-  edge.color <- params("edge", "color")
-  edge.width <- (1/200) * params("edge", "width")
-  edge.labels <- params("edge","label")
-  arrow.mode <- params("edge","arrow.mode")
-  arrow.size <- params("edge","arrow.size")
-  
-  layout <- params("plot", "layout")
-  rescale <- params("plot", "rescale")
-
-  # the new style parameters can't do this yet
-  arrow.mode         <- i.get.arrow.mode(graph, arrow.mode)
-  
-  # norm layout to (-1, 1)
-  if (ncol(layout)==2) { layout <- cbind(layout, 0) }
-  if (rescale) {
-    layout <- layout.norm(layout, -1, 1, -1, 1, -1, 1)
-  }
-  
-  # add the edges, the loops are handled separately
-  el <- get.edgelist(graph, names=FALSE)
-  
-  # It is faster this way
-  par3d(skipRedraw=TRUE)
-
-  # edges first
-  for (i in seq(length=nrow(el))) {
-    from <- el[i,1]
-    to   <- el[i,2]
-    v1 <- layout[from,]
-    v2 <- layout[to,]
-    am <- arrow.mode; if (length(am)>1) { am <- am[i] }
-    ew <- edge.width; if (length(ew)>1) { ew <- ew[i] }
-    ec <- edge.color; if (length(ec)>1) { ec <- ec[i] }
-    r1 <- vertex.size; if (length(r1)>1) { r1 <- r1[from] }
-    r2 <- vertex.size; if (length(r2)>1) { r2 <- r2[to] }
-
-    if (from!=to) {
-      create.edge(v1,v2,r1,r2,ec,ew,am,arrow.size)
-    } else {
-      la <- loop.angle; if (length(la)>1) { la <- la[i] }
-      la2 <- loop.angle2; if (length(la2)>1) { la2 <- la2[i] }      
-      create.loop(v1,r1,ec,ew,am,la,la2,arrow.size)
-    }
-    
-  }
-      
-  # add the vertices
-  if (length(vertex.size)==1) { vertex.size <- rep(vertex.size, nrow(layout)) }
-  rgl.spheres(layout[,1], layout[,2], layout[,3], radius=vertex.size,
-              col=vertex.color)
-
-  # add the labels, 'l1' is a stupid workaround of a mysterious rgl bug
-  labels[is.na(labels)] <- ""
-  x <- layout[,1]+label.dist*cos(-label.degree)* 
-    (vertex.size+6*10*log10(nchar(labels)+1))/200
-  y <- layout[,2]+label.dist*sin(-label.degree)*
-    (vertex.size+6*10*log10(nchar(labels)+1))/200
-  z <- layout[,3]
-  l1 <- labels[1]
-  labels[1] <- ""
-  rgl.texts(x,y,z, labels, col=label.color, adj=0)
-  rgl.texts(c(0,x[1]), c(0,y[1]), c(0,z[1]),
-            c("",l1), col=c(label.color[1],label.color[1]), adj=0)
-
-  edge.labels[is.na(edge.labels)] <- ""
-  if (any(edge.labels != "")) {
-    x0 <- layout[,1][el[,1]]
-    x1 <- layout[,1][el[,2]]
-    y0 <- layout[,2][el[,1]]
-    y1 <- layout[,2][el[,2]]
-    z0 <- layout[,3][el[,1]]
-    z1 <- layout[,4][el[,2]]
-    rgl.texts((x0+x1)/2, (y0+y1)/2, (z0+z1)/2, edge.labels,
-              col=label.color)
-  }
-
-  # draw everything
-  par3d(skipRedraw=FALSE)
-  
-  invisible(NULL)
-}
-
-# This is taken from the IDPmisc package,
-# slightly modified: code argument added
-
-igraph.Arrows <-
-function (x1, y1, x2, y2,
-                    code=2,
-                    size= 1,     
-                    width= 1.2/4/cin,
-                    open=TRUE,
-                    sh.adj=0.1, 
-                    sh.lwd=1,
-                    sh.col=if(is.R()) par("fg") else 1,
-                    sh.lty=1,
-                    h.col=sh.col,
-                    h.col.bo=sh.col,
-                    h.lwd=sh.lwd,
-                    h.lty=sh.lty,
-                    curved=FALSE)
-  ## Author: Andreas Ruckstuhl, refined by Rene Locher
-  ## Version: 2005-10-17
-{
-  cin <- size * par("cin")[2]
-  width <- width * (1.2/4/cin)
-  uin <- if (is.R()) 
-    1/xyinch()
-  else par("uin")
-  x <- sqrt(seq(0, cin^2, length = floor(35 * cin) + 2))
-  delta <-  sqrt(h.lwd)*par("cin")[2]*0.005      ## has been 0.05
-  x.arr <- c(-rev(x), -x)
-  wx2 <- width * x^2
-  y.arr <- c(-rev(wx2 + delta), wx2 + delta)
-  deg.arr <- c(atan2(y.arr, x.arr), NA)
-  r.arr <- c(sqrt(x.arr^2 + y.arr^2), NA)
-
-  ## backup
-  bx1 <- x1 ; bx2 <- x2 ; by1 <- y1 ; by2 <- y2
-  
-  ## shaft
-  lx <- length(x1)
-  r.seg <- rep(cin*sh.adj, lx)
-  theta1 <- atan2((y1 - y2) * uin[2], (x1 - x2) * uin[1])
-  th.seg1 <- theta1 + rep(atan2(0, -cin), lx)
-  theta2 <- atan2((y2 - y1) * uin[2], (x2 - x1) * uin[1])
-  th.seg2 <- theta2 + rep(atan2(0, -cin), lx)
-  x1d <- y1d <- x2d <- y2d <- 0
-  if (code %in% c(1,3)) {
-    x2d <- r.seg*cos(th.seg2)/uin[1]
-    y2d <- r.seg*sin(th.seg2)/uin[2]
-  }
-  if (code %in% c(2,3)) {
-    x1d <- r.seg*cos(th.seg1)/uin[1]
-    y1d <- r.seg*sin(th.seg1)/uin[2]
-  }
-  if (is.logical(curved) && all(!curved)) {
-    segments(x1+x1d, y1+y1d, x2+x2d, y2+y2d, lwd=sh.lwd, col=sh.col, lty=sh.lty)
-  } else {
-    if (is.numeric(curved)) {
-      lambda <- curved
-    } else {
-      lambda <- as.logical(curved) * 0.5
-    }
-    c.x1 <- x1+x1d
-    c.y1 <- y1+y1d
-    c.x2 <- x2+x2d
-    c.y2 <- y2+y2d
-
-    midx <- (x1+x2)/2
-    midy <- (y1+y2)/2  
-    spx <- midx - lambda * 1/2 * (c.y2-c.y1)
-    spy <- midy + lambda * 1/2 * (c.x2-c.x1)
-    sh.col <- rep(sh.col, length=length(c.x1))
-    sh.lty <- rep(sh.lty, length=length(c.x1))
-    sh.lwd <- rep(sh.lwd, length=length(c.x1))
-    for (i in seq_len(length(c.x1))) {
-      spl <- xspline(x=c(c.x1[i],spx[i],c.x2[i]),
-                     y=c(c.y1[i],spy[i],c.y2[i]), shape=1, draw=FALSE)
-      lines(spl, lwd=sh.lwd[i], col=sh.col[i], lty=sh.lty[i])
-      if (code %in% c(2,3)) {
-        x1[i] <- spl$x[3*length(spl$x)/4]
-        y1[i] <- spl$y[3*length(spl$y)/4]
-      }
-      if (code %in% c(1,3)) {
-        x2[i] <- spl$x[length(spl$x)/4]
-        y2[i] <- spl$y[length(spl$y)/4]
-      }
-    }
-  }
-
-  ## forward arrowhead
-  if (code %in% c(2,3)) {    
-    theta <- atan2((by2 - y1) * uin[2], (bx2 - x1) * uin[1])
-    Rep <- rep(length(deg.arr), lx)
-    p.x2 <- rep(bx2, Rep)
-    p.y2 <- rep(by2, Rep)
-    ttheta <- rep(theta, Rep) + rep(deg.arr, lx)
-    r.arr <- rep(r.arr, lx)  
-    if(open) lines((p.x2 + r.arr * cos(ttheta)/uin[1]),
-                   (p.y2 + r.arr*sin(ttheta)/uin[2]), 
-                   lwd=h.lwd, col = h.col.bo, lty=h.lty) else
-    polygon(p.x2 + r.arr * cos(ttheta)/uin[1], p.y2 + r.arr*sin(ttheta)/uin[2], 
-            col = h.col, lwd=h.lwd,
-            border=h.col.bo, lty=h.lty)
-  }
-    
-  ## backward arrow head
-  if (code %in% c(1,3)) {
-    x1 <- bx1; y1 <- by1
-    tmp <- x1 ; x1 <- x2 ; x2 <- tmp
-    tmp <- y1 ; y1 <- y2 ; y2 <- tmp
-    theta <- atan2((y2 - y1) * uin[2], (x2 - x1) * uin[1])
-    lx <- length(x1)
-    Rep <- rep(length(deg.arr), lx)
-    p.x2 <- rep(x2, Rep)
-    p.y2 <- rep(y2, Rep)
-    ttheta <- rep(theta, Rep) + rep(deg.arr, lx)
-    r.arr <- rep(r.arr, lx)
-
-    if(open) lines((p.x2 + r.arr * cos(ttheta)/uin[1]),
-                   (p.y2 + r.arr*sin(ttheta)/uin[2]), 
-                   lwd=h.lwd, col = h.col.bo, lty=h.lty) else
-    polygon(p.x2 + r.arr * cos(ttheta)/uin[1], p.y2 + r.arr*sin(ttheta)/uin[2], 
-            col = h.col, lwd=h.lwd,
-            border=h.col.bo, lty=h.lty)
-  }
-} # Arrows
-
-igraph.polygon <- function(points, vertex.size=15/200, expand.by=15/200,
-                           shape=1/2, col="#ff000033", border=NA) {
-
-  by <- expand.by
-  pp <- rbind(points,
-              cbind(points[,1]-vertex.size-by, points[,2]),
-              cbind(points[,1]+vertex.size+by, points[,2]),
-              cbind(points[,1], points[,2]-vertex.size-by),
-              cbind(points[,1], points[,2]+vertex.size+by))
-
-  cl <- convex.hull(pp)
-  xspline(cl$rescoords, shape=shape, open=FALSE, col=col, border=border)
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.common.R igraph-0.6.5/interfaces/R/igraph/R/plot.common.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.common.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/plot.common.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,936 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2003-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Common functions for plot and tkplot
-###################################################################
-
-i.parse.plot.params <- function(graph, params) {
-  
-  ## store the arguments
-  p <- list(vertex=list(), edge=list(), plot=list())
-  for (n in names(params)) {
-    if (substr(n, 1, 7)=="vertex.") {
-      nn <- substring(n, 8)
-      p[["vertex"]][[nn]] <- params[[n]]
-    } else if (substr(n, 1, 5)=="edge.") {
-      nn <- substring(n, 6)
-      p[["edge"]][[nn]] <- params[[n]]
-    } else {
-      p[["plot"]][[n]] <- params[[n]]
-    }
-  }
-
-  ## check that names are present
-
-  mis <- ! names(p[["vertex"]]) %in% names(i.default.values$vertex) &
-         ! paste("vertex.", sep="", names(p[["vertex"]])) %in%
-           names(igraph.options())
-  if (any(mis)) {
-    stop("Unknown vertex parameters: ",
-         paste(sep=", ", collapse=", ", names(p[["vertex"]])[mis]))
-  }
-  mis <- ! names(p[["edge"]]) %in% names(i.default.values$edge) &
-         ! paste("edge.", sep="", names(p[["edge"]])) %in%
-           names(igraph.options())
-  if (any(mis)) {
-    stop("Unknown edge parameters: ",
-         paste(sep=", ", collapse=", ", names(p[["edge"]])[mis]))
-  }
-  mis <- ! names(p[["plot"]]) %in% names(i.default.values$plot) &
-         ! paste("plot.", sep="", names(p[["plot"]])) %in%
-           names(igraph.options())
-  if (any(mis)) {
-    stop("Unknown plot parameters: ",
-         paste(sep=", ", collapse=", ", names(p[["plot"]]) [ mis ]))
-  }
-  
-  func <- function(type, name, range=NULL, dontcall=FALSE) {
-    if (! type %in% names(p)) {
-      stop("Invalid plot option type")
-    }
-    ret <- function() {
-      v <- p[[type]][[name]]
-      if (is.function(v) && !dontcall) {
-        v <- v(graph)
-      }
-      if (is.null(range)) {
-        return (v)        
-      } else {
-        if (length(v)==1) {
-          return(rep(v, length(range)))
-        } else {
-          return (rep(v, length=max(range)+1)[[range+1]])
-        }
-      }
-    }
-    if (name %in% names(p[[type]])) {
-      ## we already have the parameter
-      return(ret())
-    } else {
-      ## we don't have the parameter, check attributes first
-      if (type=="vertex" && name %in% list.vertex.attributes(graph)) {
-        p[[type]][[name]] <- get.vertex.attribute(graph, name)
-        return(ret())
-      } else if (type=="edge" && name %in% list.edge.attributes(graph)) {
-        p[[type]][[name]] <- get.edge.attribute(graph, name)
-        return(ret())
-      } else if (type=="plot" && name %in% list.graph.attributes(graph)) {
-        p[[type]][[name]] <- get.graph.attribute(graph, name)
-        return(ret())
-      } else {
-        ## no attributes either, check igraph parameters
-        n <- paste(sep="", type, ".", name)
-        v <- getIgraphOpt(n)
-        if (!is.null(v)) {
-          p[[type]][[name]] <- v
-          return(ret())
-        }
-        ## no igraph parameter either, use default value
-        p[[type]][[name]] <- i.default.values[[type]][[name]]
-        return(ret())
-      }
-    }
-    
-  }
-
-  return (func)
-}
-
-i.get.edge.labels <- function(graph, edge.labels=NULL) {
-
-  if (is.null(edge.labels)) {
-    edge.labels <- rep(NA, ecount(graph))
-  }
-
-  edge.labels
-}
-
-i.get.labels <- function(graph, labels=NULL) {
-
-  if (is.null(labels)) {
-    if ("name" %in% list.vertex.attributes(graph)) {
-      labels <- get.vertex.attribute(graph, "name")
-    } else {
-      labels <- seq_len(vcount(graph))
-    }
-  }
-  labels
-}
-
-i.get.arrow.mode <- function(graph, arrow.mode=NULL) {
-
-  if (is.character(arrow.mode) &&
-      length(arrow.mode)==1 && substr(arrow.mode, 1, 2)=="a:") {
-    arrow.mode <- get.vertex.attribute(graph, substring(arrow.mode,3))
-  }
-
-  if (is.character(arrow.mode)) {
-    tmp <- numeric(length(arrow.mode))
-    tmp[ arrow.mode %in% c("<", "<-") ] <- 1
-    tmp[ arrow.mode %in% c(">", "->") ] <- 2
-    tmp[ arrow.mode %in% c("<>", "<->") ] <- 3
-    arrow.mode <- tmp
-  }
-
-  if (is.null(arrow.mode)) {
-    if (is.directed(graph)) {
-      arrow.mode <- 2
-    } else {
-      arrow.mode <- 0
-    }
-  }
-
-  arrow.mode
-}
-
-igraph.check.shapes <- function(x) {
-  xx <- unique(x)
-  bad.shapes <- ! xx %in% ls(.igraph.shapes)
-  if (any(bad.shapes)) {
-    bs <- paste(xx[bad.shapes], collapse=", ")
-    stop("Bad vertex shape(s): ", bs, ".")
-  }
-  x
-}
-
-autocurve.edges <- function(graph, start=0.5) {
-  cm <- count.multiple(graph)
-  el <- apply(get.edgelist(graph, names=FALSE), 1, paste, collapse=":")
-  ord <- order(el)
-  res <- numeric(length(ord))
-
-  p <- 1
-  while (p <= length(res)) {
-    m <- cm[ord[p]]
-    idx <- p:(p+m-1)
-    if (m==1) {
-      r <- 0
-    } else {
-      r <- seq(-start, start, length=m)
-    }
-    res[ord[idx]] <- r
-    p <- p + m
-  }
-
-  res
-}
-
-.igraph.logo.raster <-
-structure(c(16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 311332508L, 
-1217499541L, 1804702102L, 1066570390L, 211129749L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 379033495L, 1334940052L, -2104389227L, 
--1450012011L, -2087546218L, 1368494484L, 412456341L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 41975936L, 1905496981L, 
--141388906L, -7171435L, -7171435L, -7171435L, -325938283L, 1452380564L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-41975936L, 1905496981L, -158166379L, -7171435L, -7171435L, -7171435L, 
--7171435L, -7171435L, -141389163L, 1972540052L, 41975936L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, -2037148780L, -7171435L, -24798561L, -12009013L, 
--13250855L, -11616826L, -24340838L, -7171435L, 1586664085L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 311332508L, -963472747L, -7171435L, 
--7171435L, -7171435L, -7171435L, -7236971L, -7171435L, -7171435L, 
--7171435L, -7171435L, -946695531L, 361927314L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 798134930L, 
--40791403L, -25321308L, -16061704L, -16715521L, -16715521L, -16715521L, 
--15408144L, -24471653L, -258829418L, 344755353L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -1483500650L, -7171435L, -7171435L, -7824996L, -12858668L, 
--15212050L, -16519427L, -15212050L, -12858668L, -7890531L, -7171435L, 
--7171435L, -1382903147L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 2056426132L, -7171435L, -13643043L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -12139572L, 
--7171435L, 1385337493L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 1452380564L, -7171435L, 
--7171435L, -8936279L, -15800587L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -15865867L, -9132373L, -7171435L, -7171435L, 
-1485934996L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -1433234795L, -7171435L, -15603981L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -14100510L, -7171435L, -2104389227L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, -812412011L, -7171435L, -7432808L, -15080979L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -15277585L, -7498344L, -7171435L, -694971499L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, -1919774060L, 
--7171435L, -14623768L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -13120041L, -7171435L, 1704104597L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 177838489L, 
--74280299L, -7171435L, -10439750L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--10701380L, -7171435L, -40725867L, 211129749L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 1368494484L, -7171435L, -10374471L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16584963L, -9067350L, 
--7171435L, 714248856L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 999527315L, -7171435L, -7171435L, 
--12270386L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -12531503L, -7171435L, 
--7171435L, 1033015958L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 33554431L, -1080913258L, -7171435L, -10701636L, -15277329L, 
--16519427L, -14885141L, -9720911L, -7171435L, -1718381676L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 1217499541L, -7171435L, -7171435L, -12793389L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -13054505L, -7171435L, -7171435L, 1251053972L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-479367826L, -929918315L, -7171435L, -7171435L, -7236971L, -7171435L, 
--7171435L, -1366060139L, 227117469L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 361927314L, 
--7171435L, -7171435L, -10962753L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--11289661L, -7171435L, -7171435L, 412456341L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 1536398230L, 
--7171435L, -778857580L, -1013804395L, -1752067691L, 1334940052L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, -544042347L, 
--7171435L, -8086625L, -16061704L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16126983L, -8217439L, 
--7171435L, -426601835L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, -1097690475L, -23948651L, 
-579833750L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 76714645L, 1452446357L, -1986882923L, 
--1785556331L, 1720881813L, 361927317L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, -2070703211L, -7171435L, 
--7171435L, -10570822L, -16649985L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16649985L, -10636101L, -7171435L, -7171435L, 
--2020503147L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 596808338L, -23948651L, -1114467692L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 747803285L, -829255019L, -7171435L, -7171435L, -7171435L, 
--7171435L, -326004074L, 1418891925L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 127046290L, -728591723L, -7171435L, -7171435L, 
--9786446L, -15603981L, -16715521L, -16715521L, -16715521L, -15538958L, 
--9655375L, -7171435L, -7171435L, -661482859L, 144678815L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
--2053991786L, -7171435L, 1502778005L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 278041237L, -443444587L, 
--7171435L, -10963009L, -14492954L, -15015956L, -12335666L, -24340839L, 
--40725867L, 999461525L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 848598164L, -225275243L, -7171435L, -7171435L, -7171435L, 
--8347998L, -9720911L, -8348254L, -7171435L, -7171435L, -7171435L, 
--225275243L, 949129878L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 61516458L, -443379051L, -292384107L, 
-127046290L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, -1835887979L, -7171435L, -12008757L, -16715521L, 
--16715521L, -16715521L, -16715521L, -14492954L, -24013930L, -745368939L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-546279319L, -1114467692L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -7171435L, -7171435L, -1064136043L, 546279319L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 1301451413L, -7171435L, -1835822188L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
--795700587L, -24340838L, -16519427L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -9917004L, -7171435L, 361927317L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-33554431L, 1469289365L, -1752067691L, -896363883L, -242052459L, 
--141389163L, -7171435L, -309095531L, 429496729L, 1301451413L, 
--2104389227L, -1215130987L, -879586667L, -1701670251L, 1704104597L, 
-798134930L, 75530368L, 16777215L, -1332571499L, -7171435L, 798134930L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, -174943595L, -9067350L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -11420476L, -7171435L, 
-999461525L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
--1986948715L, -7171435L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -158166379L, 
--1517120875L, -74280299L, -879586667L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -812477803L, -24340839L, -16519427L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -9851469L, -7171435L, 328372885L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 261724569L, -1248685419L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -7566182L, 
--8355679L, -7171435L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -1869376618L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, -1902996843L, 
--7171435L, -11681849L, -16715521L, -16715521L, -16715521L, -16715521L, 
--14166045L, -7236714L, -208498027L, 882086803L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 1150456470L, -493710699L, -7171435L, -7171435L, -7303018L, 
--10789959L, -13026608L, -14934812L, -16513548L, -16645131L, -15921426L, 
--14013478L, -11973946L, -8618845L, -7171435L, -7171435L, -23948651L, 
--1768779114L, 144678815L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 227709589L, -544107883L, -7171435L, 
--10570822L, -13969951L, -14492954L, -11943478L, -24210280L, -23948651L, 
--7171435L, -23948651L, -1517186668L, 529831060L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 596808338L, -174943595L, 
--7171435L, -7171435L, -8684636L, -14605855L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16316174L, -11382080L, -7237226L, -7171435L, -7171435L, -1852665195L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 663917205L, -929918315L, -7171435L, -7171435L, 
--7171435L, -7171435L, -393112938L, 1284674197L, 1049661588L, 
--879586667L, -7171435L, -141389163L, -1986948715L, 261724569L, 
-16777215L, 16777215L, 16777215L, 41975936L, -1013804395L, -7171435L, 
--7171435L, -11184706L, -16316174L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -14342690L, -8158305L, -7171435L, -23948651L, 
-1066570390L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 59937429L, 1234342549L, 2140312213L, 
--1936551275L, 1486000789L, 294818453L, 16777215L, 16777215L, 
-33554431L, 1519621014L, -527265131L, -7171435L, -342715755L, 
-1821545109L, 93952409L, 16777215L, 1922142614L, -7171435L, -7171435L, 
--9868880L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -14210851L, -7237227L, -7171435L, 
--560819563L, 211129749L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 144678815L, 1989383061L, -258829675L, -7171435L, -644705643L, 
-1804767894L, -141389163L, -7171435L, -7829349L, -15658261L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -11184706L, -7171435L, -7171435L, -1785622123L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 344755353L, -1835822188L, -91057515L, -7171435L, -7171435L, 
--7171435L, -13289772L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16250383L, -8421470L, -7171435L, -292384107L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 647271572L, -409824619L, -7171435L, -7566183L, -16513548L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -11447872L, 
--7171435L, -7171435L, 613782933L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
--460090475L, -7171435L, -9342293L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -13421357L, -7171435L, -7171435L, 
-1502778005L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-965907093L, -1785556331L, -879586667L, -158166379L, -695037291L, 
--1584229739L, 1435669141L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 412456341L, -7171435L, 
--7171435L, -11184706L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -15263513L, -7171435L, -7171435L, -1903062635L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 143823509L, -1936551275L, -40725867L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -7171435L, 
--1299017067L, 412258965L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 1200853907L, -7171435L, -7171435L, -12895025L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16579339L, -7566183L, -7171435L, -1114467692L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -1231908203L, -7171435L, -7171435L, -7171435L, -8282719L, 
--9655375L, -8544092L, -7236714L, -7171435L, -7171435L, -577596779L, 
-194155157L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-747737495L, -7171435L, -7171435L, -11908411L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -15987217L, -7171435L, 
--7171435L, -1483566443L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 1720881813L, -7171435L, 
--7171435L, -8348254L, -14231324L, -16715521L, -16715521L, -16715521L, 
--15212050L, -9263188L, -7171435L, -7171435L, -1768779115L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 61516458L, -158166379L, 
--7171435L, -10000462L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -14145060L, -7171435L, -7171435L, -91057515L, 
--1315794284L, 1603375510L, 295081622L, 16777215L, 16777215L, 
-16777215L, 16777215L, 127046293L, -242052459L, -7171435L, -7629158L, 
--15538958L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16519427L, -8740442L, -7171435L, -23948651L, 747803285L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, -963472747L, -7171435L, 
--8158305L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -12237111L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -74280299L, -1164865131L, 1754502038L, 412456341L, 
-16777215L, 915575445L, -7171435L, -7171435L, -12008757L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--13773857L, -7171435L, -7171435L, 1720881813L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, -1819110763L, -7171435L, -7171435L, 
--15263513L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--9868879L, -7171435L, -74280299L, 1368560277L, -1651338603L, 
--325938539L, -7171435L, -7171435L, -7171435L, -40725867L, -1013804395L, 
--1382903147L, -7171435L, -7171435L, -14100510L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16061960L, 
--7171435L, -7171435L, -1668115819L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 1402180499L, -7171435L, -7171435L, -9539923L, 
--16579339L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -13816104L, -7171435L, 
--7171435L, -946695531L, 16777215L, 16777215L, 61516458L, 1116967831L, 
--1802333548L, -460090475L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -14558233L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16388613L, -7302250L, -7171435L, 
--1433234795L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -1198353770L, -7171435L, -7171435L, -12500278L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -15987217L, -8092514L, -7171435L, -74280299L, 898666645L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 33554431L, 
-949129878L, -1970105706L, -443379050L, -7171435L, -7171435L, 
--12793389L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -14558233L, -7171435L, -7171435L, 1972540053L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-479367826L, -258829675L, -7171435L, -7500391L, -14737438L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16447757L, 
--10263627L, -7171435L, -7171435L, -2070703211L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 294818453L, -23948651L, -7171435L, -8478812L, -16323334L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--9917005L, -7171435L, -7171435L, 1083347605L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 1603375510L, 
--7171435L, -7171435L, -7434600L, -12237111L, -16513548L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -16645131L, -16645131L, 
--16645131L, -16645131L, -15000603L, -9013337L, -7171435L, -7171435L, 
--778923371L, 109084842L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
--1768779115L, -7171435L, -7171435L, -10178634L, -16061960L, -16715521L, 
--16715521L, -16715521L, -16388612L, -11224382L, -7171435L, -7171435L, 
--997027179L, 43160213L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 33554431L, -728591723L, -7171435L, 
--7171435L, -7171435L, -9276502L, -14605855L, -16513549L, -16645131L, 
--16645131L, -16645131L, -16645131L, -16645131L, -15789843L, -12171320L, 
--7368809L, -7171435L, -7171435L, -376270187L, 781226134L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 194155157L, -577596779L, 
--7171435L, -7171435L, -7890531L, -10636100L, -12335666L, -11028288L, 
--8413533L, -7171435L, -7171435L, -174943595L, 613585557L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 33554431L, 579833750L, 261724569L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-160337550L, -1416457579L, -7171435L, -7171435L, -124611948L, 
--7171435L, -7171435L, -7171435L, -7500391L, -9342293L, -11316288L, 
--12171320L, -10263627L, -8355679L, -7171435L, -7171435L, -7171435L, 
--7171435L, -1416457579L, 344755353L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 647139989L, -913141099L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -476933483L, 1150456469L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 1184010901L, -1131244907L, 
--275606891L, -7171435L, -23948651L, -644705643L, -1768779114L, 
-311332508L, 16777215L, 16777215L, 16777215L, 16777215L, 379033495L, 
--929852523L, -7171435L, -23948651L, 2056426132L, 428838809L, 
--1282305642L, -7171435L, -7171435L, -7171435L, -7171435L, -7171435L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -325938539L, 
-1485934996L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 59937429L, 
-2039648917L, -711814507L, -40725867L, -7171435L, -7171435L, -510487915L, 
--1752001899L, 261264021L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 211129749L, -1701670251L, -7171435L, -7171435L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -426601835L, 
-1234408342L, 16777215L, 16777215L, 697274261L, -544042347L, -7171435L, 
--124611947L, 1485934996L, 16777215L, 16777215L, 16777215L, 1167365268L, 
--2137943659L, -1248619627L, -376270187L, -7171435L, -7171435L, 
--91057515L, -846032235L, -1752067691L, 1653772948L, 395350160L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 227709589L, 949129877L, 378704533L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, -1550741099L, -7171435L, -7171435L, -8021089L, 
--11616570L, -13446949L, -12662830L, -10178634L, -7171435L, -7171435L, 
--91057515L, 831689367L, 1133613460L, -275606891L, -7171435L, 
--342715755L, 999527315L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 529831060L, 865178006L, 
-144678815L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-1368494484L, -7171435L, -7171435L, -9851725L, -15996425L, -16715521L, 
--16715521L, -16715521L, -16715521L, -13904672L, -7563622L, -7171435L, 
--476933483L, -91057514L, -7171435L, -644705643L, 613782933L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, -846032235L, 
--7171435L, -8217439L, -16061704L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -12727853L, -7171435L, -7171435L, 
--7171435L, -1030581611L, 311332508L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 109084842L, -91057515L, -7171435L, -12139828L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16649985L, -7890531L, -7171435L, -695037291L, 109084842L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-831689367L, -7171435L, -7171435L, -13970208L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--9720911L, -7171435L, -1080913258L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 596808338L, -7171435L, 
--7171435L, -13512485L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -9197652L, -7171435L, 
--1299017067L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 33554431L, -258829675L, -7171435L, -11355453L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -16715521L, 
--16715521L, -16192519L, -7498343L, -7171435L, 2089980564L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, -1265462635L, -7171435L, -7367273L, -14950677L, -16715521L, 
--16715521L, -16715521L, -16715521L, -16715521L, -16715521L, -10897730L, 
--7171435L, -7171435L, 1049661588L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 630296984L, 
--174943595L, -7171435L, -8086625L, -14100766L, -16715521L, -16715521L, 
--16715521L, -16323077L, -11028288L, -7171435L, -7171435L, -1550741099L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 1821545109L, -7171435L, 
--7171435L, -7236971L, -8740186L, -10439750L, -9655375L, -7825252L, 
--7171435L, -7171435L, -476933483L, 277843855L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 1385337493L, -376270187L, -7171435L, 
--7171435L, -7171435L, -7171435L, -7171435L, -7171435L, -1332571499L, 
-395350160L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 344755353L, 1922142614L, -1533898091L, 
--728591723L, -1080913258L, -1903062635L, 1284805780L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 16777215L, 
-16777215L, 16777215L, 16777215L), .Dim = c(64L, 64L), class = "nativeRaster", channels = 4L)
-
-i.vertex.default <- list(color="SkyBlue2",
-                         size=15,
-                         size2=15,
-                         label=i.get.labels,
-                         label.degree=-pi/4,
-                         label.color="darkblue",
-                         label.dist=0,
-                         label.family="serif",
-                         label.font=1,
-                         label.cex=1,
-                         frame.color="black",
-                         shape="circle",
-                         pie=1,
-                         pie.color=list(c("white", "lightblue", "mistyrose",
-                           "lightcyan", "lavender", "cornsilk")),
-                         pie.border=list(c("white", "lightblue","mistyrose",
-                           "lightcyan", "lavender", "cornsilk")),
-                         pie.angle=45,
-                         pie.density=-1,
-                         pie.lty=1,
-                         raster=.igraph.logo.raster)
-
-i.edge.default <- list(color="darkgrey",
-                       label=i.get.edge.labels,
-                       lty=1,
-                       width=1,
-                       loop.angle=0,
-                       loop.angle2=0,
-                       label.family="serif",
-                       label.font=1,
-                       label.cex=1,
-                       label.color="darkblue",
-                       arrow.size=1,
-                       arrow.mode=i.get.arrow.mode,
-                       curved=autocurve.edges,
-                       arrow.width=1)
-
-i.plot.default <- list(layout=layout.auto,
-                       margin=c(0,0,0,0),
-                       rescale=TRUE,
-                       asp=1,
-                       frame=FALSE)
-
-i.default.values <- new.env()
-
-i.default.values[["vertex"]] <- i.vertex.default
-i.default.values[["edge"]]   <- i.edge.default
-i.default.values[["plot"]]   <- i.plot.default
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.shapes.R igraph-0.6.5/interfaces/R/igraph/R/plot.shapes.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/plot.shapes.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/plot.shapes.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,747 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2003-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-## API design
-##
-## A vertex shape is defined by two functions: the clipping function and
-## the plotting function.
-##
-## The clipping function is called to determine where to put the
-## arrowhead of a potential (incoming) incident edge. Its signature is
-##    function(coords, el, params, end=c("both", "from", "to"))
-## where the arguments are:
-##    coords    A matrix with one row for each edge, and four columns.
-##              It contains the coordinates of the end points of all
-##              edges. The first two columns are the coordinates of the
-##              first end points (sources, if the graph is directed),
-##              the last two columns are for the other end points
-##              (targets if the graph is directed).
-##    el        The edge list itself, with vertex ids.
-##    params    A function object to query plotting parameters.
-##    end       Which end points to calculate. "both" means both,
-##              "from" means the first end point, "to" the second.
-## The clipping function must return the new version of "coords",
-## modified according to the vertex sizes/shapes, with proper positions
-## for the potential arrow heads. The positions are for the tips of the
-## arrows.
-##
-## The plotting function plots the vertex. Its signature is
-##    function(coords, v=NULL, params)
-## where the arguments are
-##    coords    Two column matrix, the coordinates for the vertices to draw.
-##    v         The vertex ids of the vertices to draw. If NULL, then all
-##              vertices are drawn.
-##    params    A function object to query plotting parameters.
-## 
-## vertex.shapes()         - lists all vertex shapes
-## vertex.shapes(shape)    - returns the clipping and plotting functions
-##                           for a given vertex shape
-## add.vertex.shape()      - adds a new vertex shape, the clipping and
-##                           plotting functions must be given, and
-##                           optionally the newly introduced plotting
-##                           parameters. This function can also be used
-##                           to overwrite a given vertex shape.
-##
-## Examples:
-## add.vertex.shapes("image", clip=image.clip, plot=image.plot,
-##                   parameters=list(filename=NA))
-##
-## add.vertex.shapes("triangle", clip=vertex.shapes("circle")$clip,
-##                   plot=triangle.plot)
-##
-## add.vertex.shapes("polygon", clip=vertex.shapes("circle")$clip,
-##                   plot=polygon.plot)
-##
-###################################################################
-
-vertex.shapes <- function(shape=NULL) {
-  if (is.null(shape)) {
-    ls(.igraph.shapes)
-  } else {
-    ## checkScalarString(shape)
-    .igraph.shapes[[shape]]
-  }
-}
-
-igraph.shape.noclip <- function(coords, el, params,
-                                end=c("both", "from", "to")) {
-  end <- igraph.match.arg(end)
-
-  if (end=="both") {
-    coords
-  } else if (end=="from") {
-    coords[,1:2,drop=FALSE]
-  } else {
-    coords[,3:4,drop=FALSE]
-  }
-}
-
-igraph.shape.noplot <- function(coords, v=NULL, params) {
-  invisible(NULL)
-}
-
-add.vertex.shape <- function(shape, clip=igraph.shape.noclip,
-                             plot=igraph.shape.noplot,
-                             parameters=list()) {
-
-  ## TODO
-  ## checkScalarString(shape)
-  ## checkFunction(clip)
-  ## checkFunction(plot)
-  ## checkList(parameters, named=TRUE)
-
-  assign(shape, value=list(clip=clip, plot=plot), envir=.igraph.shapes)
-  do.call(igraph.options, parameters)
-  invisible(TRUE)
-}
-
-## These are the predefined shapes
-
-.igraph.shape.circle.clip <- function(coords, el, params,
-                                      end=c("both", "from", "to")) {
-  
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-
-  if (end=="from") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    vsize.from <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    res <- cbind(coords[,1] + vsize.from*cos(phi),
-                 coords[,2] + vsize.from*sin(phi) )
-  } else if (end=="to") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    r <- sqrt( (coords[,3] - coords[,1])^2 + (coords[,4] - coords[,2])^2 )
-    vsize.to <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- cbind(coords[,1] + (r-vsize.to)*cos(phi),
-                 coords[,2] + (r-vsize.to)*sin(phi) )
-  } else if (end=="both") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    r <- sqrt( (coords[,3] - coords[,1])^2 + (coords[,4] - coords[,2])^2 )
-    vsize.from <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    vsize.to <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- cbind(coords[,1] + vsize.from*cos(phi),
-                 coords[,2] + vsize.from*sin(phi),
-                 coords[,1] + (r-vsize.to)*cos(phi),
-                 coords[,2] + (r-vsize.to)*sin(phi) )
-  }
-  res
-}
-
-.igraph.shape.circle.plot <- function(coords, v=NULL, params) {
-  
-  vertex.color       <- params("vertex", "color")
-  if (length(vertex.color) != 1 && !is.null(v)) {
-    vertex.color <- vertex.color[v]
-  }
-  vertex.frame.color <- params("vertex", "frame.color")
-  if (length(vertex.frame.color) != 1 && !is.null(v)) {
-    vertex.frame.color <- vertex.frame.color[v]
-  }
-  vertex.size        <- 1/200 * params("vertex", "size")
-  if (length(vertex.size) != 1 && !is.null(v)) {
-    vertex.size <- vertex.size[v]
-  }
-  vertex.size <- rep(vertex.size, length=nrow(coords))
-  
-  symbols(x=coords[,1], y=coords[,2], bg=vertex.color, fg=vertex.frame.color,
-          circles=vertex.size, add=TRUE, inches=FALSE)
-}
-
-.igraph.shape.square.clip <- function(coords, el, params,
-                                      end=c("both", "from", "to")) {
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-
-  square.shift <- function(x0, y0, x1, y1, vsize) {
-    m <- (y0-y1)/(x0-x1)
-    l <- cbind(x1-vsize/m , y1-vsize,
-               x1-vsize , y1-vsize*m,
-               x1+vsize/m, y1+vsize,
-               x1+vsize , y1+vsize*m )
-    
-    v <- cbind(x1-vsize <= l[,1] & l[,1] <= x1+vsize &
-               y1-vsize <= l[,2] & l[,2] <= y1+vsize,
-               x1-vsize <= l[,3] & l[,3] <= x1+vsize &
-               y1-vsize <= l[,4] & l[,4] <= y1+vsize,
-               x1-vsize <= l[,5] & l[,5] <= x1+vsize &
-               y1-vsize <= l[,6] & l[,6] <= y1+vsize,
-               x1-vsize <= l[,7] & l[,7] <= x1+vsize &
-               y1-vsize <= l[,8] & l[,8] <= y1+vsize)
-    
-    d <- cbind((l[,1]-x0)^2 + (l[,2]-y0)^2,
-               (l[,3]-x0)^2 + (l[,4]-y0)^2,
-               (l[,5]-x0)^2 + (l[,6]-y0)^2,
-               (l[,7]-x0)^2 + (l[,8]-y0)^2)
-    
-    t(sapply(seq(length=nrow(l)), function(x) {
-      d[x,][!v[x,]] <- Inf
-      m <- which.min(d[x,])
-      l[x, c(m*2-1, m*2)]
-    }))
-  }
-    
-  if (end %in% c("from", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    res <- res1 <- square.shift(coords[,3], coords[,4], coords[,1], coords[,2],
-                                vsize)
-  }
-  if (end %in% c("to", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- res2 <- square.shift(coords[,1], coords[,2], coords[,3], coords[,4],
-                                vsize)
-  }
-  if (end=="both") {
-    res <- cbind(res1, res2)
-  }
-  
-  res
-}
-
-.igraph.shape.square.plot <- function(coords, v=NULL, params) {
-
-  vertex.color       <- params("vertex", "color")
-  if (length(vertex.color) != 1 && !is.null(v)) {
-    vertex.color <- vertex.color[v]
-  }
-  vertex.frame.color <- params("vertex", "frame.color")
-  if (length(vertex.frame.color) != 1 && !is.null(v)) {
-    vertex.frame.color <- vertex.frame.color[v]
-  }
-  vertex.size        <- 1/200 * params("vertex", "size")
-  if (length(vertex.size) != 1 && !is.null(v)) {
-    vertex.size <- vertex.size[v]
-  }
-  vertex.size <- rep(vertex.size, length=nrow(coords))
-  
-  symbols(x=coords[,1], y=coords[,2], bg=vertex.color, fg=vertex.frame.color,
-          squares=2*vertex.size, add=TRUE, inches=FALSE)
-}  
-
-.igraph.shape.csquare.clip <- function(coords, el, params,
-                                       end=c("both", "from", "to")) {
-
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-  
-  square.shift <- function(x0, y0, x1, y1, vsize) {
-
-    l <- cbind(x1,       y1-vsize,
-               x1-vsize, y1,
-               x1,       y1+vsize,
-               x1+vsize, y1)
-    
-    d <- cbind((l[,1]-x0)^2 + (l[,2]-y0)^2,
-               (l[,3]-x0)^2 + (l[,4]-y0)^2,
-               (l[,5]-x0)^2 + (l[,6]-y0)^2,
-               (l[,7]-x0)^2 + (l[,8]-y0)^2)
-    
-    t(sapply(seq(length=nrow(l)), function(x) {
-      m <- which.min(d[x,])
-      l[x, c(m*2-1, m*2)]
-    }))
-  }
-  
-  if (end %in% c("from", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    res <- res1 <- square.shift(coords[,3], coords[,4], coords[,1], coords[,2],
-                                vsize)
-  }
-  if (end %in% c("to", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- res2 <- square.shift(coords[,1], coords[,2], coords[,3], coords[,4],
-                                vsize)
-  }
-  if (end=="both") {
-    res <- cbind(res1, res2)
-  }
-  
-  res
-}
-
-.igraph.shape.csquare.plot <- .igraph.shape.square.plot
-
-.igraph.shape.rectangle.clip <- function(coords, el, params,
-                                         end=c("both", "from", "to")) {
-
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-  vertex.size2 <- 1/200 * params("vertex", "size2")
-  
-  rec.shift <- function(x0, y0, x1, y1, vsize, vsize2) {
-    m <- (y0-y1)/(x0-x1)
-    l <- cbind(x1-vsize/m,  y1-vsize2,
-               x1-vsize,    y1-vsize*m,
-               x1+vsize2/m, y1+vsize2,
-               x1+vsize,    y1+vsize*m )
-    
-    v <- cbind(x1-vsize <= l[,1] & l[,1] <= x1+vsize &
-               y1-vsize2 <= l[,2] & l[,2] <= y1+vsize2,
-               x1-vsize <= l[,3] & l[,3] <= x1+vsize &
-               y1-vsize2 <= l[,4] & l[,4] <= y1+vsize2,
-               x1-vsize <= l[,5] & l[,5] <= x1+vsize &
-               y1-vsize2 <= l[,6] & l[,6] <= y1+vsize2,
-               x1-vsize <= l[,7] & l[,7] <= x1+vsize &
-               y1-vsize2 <= l[,8] & l[,8] <= y1+vsize2)
-    
-    d <- cbind((l[,1]-x0)^2 + (l[,2]-y0)^2,
-               (l[,3]-x0)^2 + (l[,4]-y0)^2,
-               (l[,5]-x0)^2 + (l[,6]-y0)^2,
-               (l[,7]-x0)^2 + (l[,8]-y0)^2)
-    
-    t(sapply(seq(length=nrow(l)), function(x) {
-      d[x,][!v[x,]] <- Inf
-      m <- which.min(d[x,])
-      l[x, c(m*2-1, m*2)]
-    }))
-  }
-  
-  if (end %in% c("from", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,1] ]
-    }
-    res <- res1 <- rec.shift(coords[,3], coords[,4], coords[,1], coords[,2],
-                             vsize, vsize2)
-  }
-  if (end %in% c("to", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,2] ]
-    }
-    res <- res2 <- rec.shift(coords[,1], coords[,2], coords[,3], coords[,4],
-                             vsize, vsize2)
-  }
-  if (end=="both") {
-    res <- cbind(res1, res2)
-  }
-  
-  res
-}
-
-.igraph.shape.rectangle.plot <- function(coords, v=NULL, params) {
-
-  vertex.color       <- params("vertex", "color")
-  if (length(vertex.color) != 1 && !is.null(v)) {
-    vertex.color <- vertex.color[v]
-  }
-  vertex.frame.color <- params("vertex", "frame.color")
-  if (length(vertex.frame.color) != 1 && !is.null(v)) {
-    vertex.frame.color <- vertex.frame.color[v]
-  }
-  vertex.size        <- 1/200 * params("vertex", "size")
-  if (length(vertex.size) != 1 && !is.null(v)) {
-    vertex.size <- vertex.size[v]
-  }
-  vertex.size <- rep(vertex.size, length=nrow(coords))   
-  vertex.size2       <- 1/200 * params("vertex", "size2")
-  if (length(vertex.size2) != 1 && !is.null(v)) {
-    vertex.size2 <- vertex.size2[v]
-  }
-  vertex.size <- cbind(vertex.size, vertex.size2)
-  
-  symbols(x=coords[,1], y=coords[,2], bg=vertex.color, fg=vertex.frame.color,
-          rectangles=2*vertex.size, add=TRUE, inches=FALSE)
-}
-
-.igraph.shape.crectangle.clip <- function(coords, el, params,
-                                          end=c("both", "from", "to")) {
-
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-  vertex.size2 <- 1/200 * params("vertex", "size2")
-    
-  rec.shift <- function(x0, y0, x1, y1, vsize, vsize2) {
-    
-    l <- cbind(x1,       y1-vsize2,
-               x1-vsize, y1,
-               x1,       y1+vsize2,
-               x1+vsize, y1)
-    
-    d <- cbind((l[,1]-x0)^2 + (l[,2]-y0)^2,
-               (l[,3]-x0)^2 + (l[,4]-y0)^2,
-               (l[,5]-x0)^2 + (l[,6]-y0)^2,
-               (l[,7]-x0)^2 + (l[,8]-y0)^2)
-      
-    t(sapply(seq(length=nrow(l)), function(x) {
-      m <- which.min(d[x,])
-      l[x, c(m*2-1, m*2)]
-    }))
-  }
-  
-  if (end %in% c("from", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,1] ]
-    }
-    res <- res1 <- rec.shift(coords[,3], coords[,4], coords[,1], coords[,2],
-                             vsize, vsize2)
-  }
-  if (end %in% c("to", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,2] ]
-    }
-    res <- res2 <- rec.shift(coords[,1], coords[,2], coords[,3], coords[,4],
-                             vsize, vsize2)
-  }
-  if (end=="both") {
-    res <- cbind(res1, res2)
-  }
-  
-  res
-}
-
-.igraph.shape.crectangle.plot <- .igraph.shape.rectangle.plot
-
-.igraph.shape.vrectangle.clip <- function(coords, el, params,
-                                          end=c("both", "from", "to")) {
-
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-  vertex.size2 <- 1/200 * params("vertex", "size2")
-  
-  rec.shift <- function(x0, y0, x1, y1, vsize, vsize2) {
-    
-    l <- cbind(x1-vsize, y1, x1+vsize, y1)
-    
-    d <- cbind((l[,1]-x0)^2 + (l[,2]-y0)^2,
-               (l[,3]-x0)^2 + (l[,4]-y0)^2)
-    
-    t(sapply(seq(length=nrow(l)), function(x) {
-      m <- which.min(d[x,])
-      l[x, c(m*2-1, m*2)]
-    }))
-  }
-
-  if (end %in% c("from", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,1] ]
-    }
-    res <- res1 <- rec.shift(coords[,3], coords[,4], coords[,1], coords[,2],
-                             vsize, vsize2)
-  }
-  if (end %in% c("to", "both")) {
-    vsize <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    vsize2 <- if (length(vertex.size2)==1) {
-      vertex.size2
-    } else {
-      vertex.size2[ el[,2] ]
-    }
-    res <- res2 <- rec.shift(coords[,1], coords[,2], coords[,3], coords[,4],
-                             vsize, vsize2)
-  }
-  if (end=="both") {
-    res <- cbind(res1, res2)
-  }
-
-  res
-}    
-
-.igraph.shape.vrectangle.plot <- .igraph.shape.rectangle.plot
-
-.igraph.shape.none.clip <- .igraph.shape.circle.clip
-
-.igraph.shape.none.plot <- function(coords, v=NULL, params) {
-  ## does not plot anything at all
-  invisible(NULL)
-}
-
-mypie <- function(x, y, values, radius, edges=200, col=NULL, angle=45,
-                  density=NULL, border=NULL, lty=NULL, init.angle=90, ...) {
-  values <- c(0, cumsum(values)/sum(values))
-  dx <- diff(values)
-  nx <- length(dx)
-  twopi <- 2 * pi
-  if (is.null(col)) 
-    col <- if (is.null(density)) 
-      c("white", "lightblue", "mistyrose", "lightcyan", 
-        "lavender", "cornsilk")
-    else par("fg")
-  col <- rep(col, length.out = nx)
-  border <- rep(border, length.out = nx)
-  lty <- rep(lty, length.out = nx)
-  angle <- rep(angle, length.out = nx)
-  density <- rep(density, length.out = nx)
-  t2xy <- function(t) {
-    t2p <- twopi * t + init.angle * pi/180
-    list(x = radius * cos(t2p), y = radius * sin(t2p))
-  }
-  for (i in 1:nx) {
-    n <- max(2, floor(edges * dx[i]))
-    P <- t2xy(seq.int(values[i], values[i + 1], length.out = n))
-    polygon(x+c(P$x, 0), y+c(P$y, 0), density = density[i], angle = angle[i], 
-            border = border[i], col = col[i], lty = lty[i], ...)
-  }
-}
-
-.igraph.shape.pie.clip <- function(coords, el, params,
-                                   end=c("both", "from", "to")) {
-
-  end <- match.arg(end)
-
-  if (length(coords)==0) { return (coords) }     
-
-  vertex.size <- 1/200 * params("vertex", "size")
-
-  if (end=="from") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    vsize.from <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    res <- cbind(coords[,1] + vsize.from*cos(phi),
-                 coords[,2] + vsize.from*sin(phi) )
-  } else if (end=="to") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    r <- sqrt( (coords[,3] - coords[,1])^2 + (coords[,4] - coords[,2])^2 )
-    vsize.to <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- cbind(coords[,1] + (r-vsize.to)*cos(phi),
-                 coords[,2] + (r-vsize.to)*sin(phi) )
-  } else if (end=="both") {
-    phi <- atan2(coords[,4] - coords[,2], coords[,3] - coords[,1])
-    r <- sqrt( (coords[,3] - coords[,1])^2 + (coords[,4] - coords[,2])^2 )
-    vsize.from <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,1] ]
-    }
-    vsize.to <- if (length(vertex.size)==1) {
-      vertex.size
-    } else {
-      vertex.size[ el[,2] ]
-    }
-    res <- cbind(coords[,1] + vsize.from*cos(phi),
-                 coords[,2] + vsize.from*sin(phi),
-                 coords[,1] + (r-vsize.to)*cos(phi),
-                 coords[,2] + (r-vsize.to)*sin(phi) )
-  }
-
-  res
-}
-
-.igraph.shape.pie.plot <- function(coords, v=NULL, params) {
-
-  getparam <- function(pname) {
-    p <- params("vertex", pname)
-    if (length(p) != 1 && !is.null(v)) {
-      p <- p[v]
-    }
-    p
-  }
-  vertex.color       <- getparam("color")
-  vertex.frame.color <- getparam("frame.color")
-  vertex.size        <- rep(1/200 * getparam("size"), length=nrow(coords))
-  vertex.pie         <- getparam("pie")
-  vertex.pie.color   <- getparam("pie.color")
-  vertex.pie.angle   <- getparam("pie.angle")
-  vertex.pie.density <- getparam("pie.density")
-  vertex.pie.lty     <- getparam("pie.lty")
-
-  for (i in seq_len(nrow(coords))) {
-    pie <- if(length(vertex.pie)==1) {
-      vertex.pie[[1]]
-    } else {
-      vertex.pie[[i]]
-    }
-    col <- if (length(vertex.pie.color)==1) {
-      vertex.pie.color[[1]]
-    } else {
-      vertex.pie.color[[i]]
-    }
-    mypie(x=coords[i,1], y=coords[i,2], pie,
-          radius=vertex.size[i], edges=200, col=col,
-          angle=na.omit(vertex.pie.angle[c(i,1)])[1],
-          density=na.omit(vertex.pie.density[c(i,1)])[1],
-          border=na.omit(vertex.frame.color[c(i,1)])[1],
-          lty=na.omit(vertex.pie.lty[c(i,1)])[1])
-  }
-}
-
-.igraph.shape.sphere.clip <- .igraph.shape.circle.clip
-
-.igraph.shape.sphere.plot <- function(coords, v=NULL, params) {
-
-  getparam <- function(pname) {
-    p <- params("vertex", pname)
-    if (length(p) != 1 && !is.null(v)) {
-      p <- p[v]
-    }
-    p
-  }
-  vertex.color       <- getparam("color")
-  vertex.size        <- rep(1/200 * getparam("size"), length=nrow(coords))
-
-  ## Need to create a separate image for every different vertex color
-  allcols <- unique(vertex.color)
-  images <- lapply(allcols, function(col) {
-    img <- .Call("R_igraph_getsphere", pos=c(0.0,0.0,10.0), radius=7.0,
-                 color=col2rgb(col)/255, bgcolor=c(0,0,0),
-                 lightpos=list(c(-2,2,2)), lightcolor=list(c(1,1,1)),
-                 width=100L, height=100L,
-                 PACKAGE="igraph")
-    as.raster(img)
-  })
-  whichImage <- match(vertex.color, allcols)  
-  
-  for (i in seq_len(nrow(coords))) {
-    vsp2 <- vertex.size[i]
-    rasterImage(images[[ whichImage[i] ]],
-                coords[i,1]-vsp2, coords[i,2]-vsp2,
-                coords[i,1]+vsp2, coords[i,2]+vsp2)
-  }
-}
-
-.igraph.shape.raster.clip <- .igraph.shape.rectangle.clip
-
-.igraph.shape.raster.plot <- function(coords, v=NULL, params) {
-
-  getparam <- function(pname) {
-    p <- params("vertex", pname)
-    if (is.list(p) && length(p) != 1 && !is.null(v)) {
-      p <- p[v]
-    }
-    p
-  }
-
-  size   <- rep(1/200 * getparam("size"), length=nrow(coords))
-  size2  <- rep(1/200 * getparam("size2"), length=nrow(coords))
-  raster <- getparam("raster")
-
-  for (i in seq_len(nrow(coords))) {
-    ras <- if (!is.list(raster) || length(raster)==1) raster else raster[[i]]
-    rasterImage(ras, coords[i,1]-size[i], coords[i,2]-size2[i],
-                coords[i,1]+size[i], coords[i,2]+size2[i])
-  }
-}
-
-.igraph.shapes <- new.env()
-.igraph.shapes[["circle"]] <- list(clip=.igraph.shape.circle.clip,
-                                   plot=.igraph.shape.circle.plot)
-.igraph.shapes[["square"]] <- list(clip=.igraph.shape.square.clip,
-                                   plot=.igraph.shape.square.plot)
-.igraph.shapes[["csquare"]] <- list(clip=.igraph.shape.csquare.clip,
-                                    plot=.igraph.shape.csquare.plot)
-.igraph.shapes[["rectangle"]] <- list(clip=.igraph.shape.rectangle.clip,
-                                      plot=.igraph.shape.rectangle.plot)
-.igraph.shapes[["crectangle"]] <- list(clip=.igraph.shape.crectangle.clip,
-                                       plot=.igraph.shape.crectangle.plot)
-.igraph.shapes[["vrectangle"]] <- list(clip=.igraph.shape.vrectangle.clip,
-                                       plot=.igraph.shape.vrectangle.plot)
-.igraph.shapes[["none"]] <- list(clip=.igraph.shape.none.clip,
-                                 plot=.igraph.shape.none.plot)
-.igraph.shapes[["pie"]] <- list(clip=.igraph.shape.pie.clip,
-                                plot=.igraph.shape.pie.plot)
-.igraph.shapes[["sphere"]] <- list(clip=.igraph.shape.sphere.clip,
-                                   plot=.igraph.shape.sphere.plot)
-.igraph.shapes[["raster"]] <- list(clip=.igraph.shape.raster.clip,
-                                   plot=.igraph.shape.raster.plot)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/print.R igraph-0.6.5/interfaces/R/igraph/R/print.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/print.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/print.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,595 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Convert graphs to human readable forms
-###################################################################
-
-.print.header <- function(object) {
-
-  if (!is.igraph(object)) {
-    stop("Not a graph object")
-  }
-
-  title <- paste(sep="", "IGRAPH ",
-                 c("U","D")[is.directed(object)+1],
-                 c("-","N")[is.named(object)+1],
-                 c("-","W")[is.weighted(object)+1],
-                 c("-","B")[is.bipartite(object)+1], " ",
-                 vcount(object), " ", ecount(object), " -- ")
-  w <- getOption("width")
-  if (nchar(title) < w && "name" %in% list.graph.attributes(object)) {
-    title <- substring(paste(sep="", title, object$name), 1, w-1)
-  }
-  cat(title, "\n", sep="")
-
-  aa <- function(names, code, fun) {
-    if (length(names)==0) {
-      ""
-    } else {
-      type <- sapply(names, function(x) mode(fun(object, x)))
-      type <- sapply(type, switch, "numeric"="n", "character"="c", "x")
-      paste(sep="", names, " (", code, "/", type, ")")
-    }
-  }
-  ga <- aa(list.graph.attributes(object), "g", get.graph.attribute)
-  va <- aa(list.vertex.attributes(object), "v", get.vertex.attribute)
-  ea <- aa(list.edge.attributes(object), "e", get.edge.attribute)
-  atxt <- c(ga, va, ea)
-  atxt <- paste(atxt[atxt!=""], collapse=", ")
-  if (atxt != "") {
-    atxt <- strwrap(paste(sep="", "+ attr: ", atxt), exdent=2)
-    cat(atxt, sep="\n")
-  }
-}
-
-.print.graph.attributes <- function(x) {
-  list <- list.graph.attributes(x)
-  if (length(list)!=0) {
-    cat("+ graph attributes:\n")
-    lapply(list, function(n) {
-      cat(sep="", "[[", n, "]]\n")
-      print(get.graph.attribute(x, n))
-    })
-  }
-}
-
-.print.vertex.attributes <- function(x) {
-  vc <- vcount(x)
-  list <- list.vertex.attributes(x)
-  if (length(list) != 0) {
-    cat("+ vertex attributes:\n")
-    mp <- getOption("max.print")
-    options(max.print=1000000000)
-    if (vc <= mp) {
-      omitted.vertices <- 0
-      ind <- as.numeric(V(x))
-    } else {
-      omitted.vertices <- vc-mp
-      ind <- seq(length=mp)
-    }
-    if (vc==0 ||
-        all(sapply(list, function(v)
-                   is.numeric(get.vertex.attribute(x, v)) ||
-                   is.character(get.vertex.attribute(x, v)) ||
-                   is.logical(get.vertex.attribute(x, v))))) {
-      ## create a table
-      tab <- data.frame(v=paste(sep="", "[", ind, "]"), row.names="v")
-      for (i in list) {
-        tab[i] <- get.vertex.attribute(x, i, ind)
-      }
-      print(tab)
-    } else {
-      for (i in ind) {
-        cat(sep="", "[[", i, "]]\n")
-        lapply(list, function(n) {
-          cat(sep="", "[[", i, "]][[", n, "]]\n")
-          print(get.vertex.attribute(x, n, i))})
-      }
-    }
-    options(max.print=mp)
-    if (omitted.vertices != 0) {
-      cat(paste('[ reached getOption("max.print") -- omitted',
-                omitted.vertices, "vertices ]\n\n"))
-    }      
-  }
-}
-
-.print.edges.edgelist <- function(x, names) {
-  ec <- ecount(x)
-  list <- list.edge.attributes(x)
-  list <- list[list!="name"]
-  arrow <- ifelse(is.directed(x), "->", "--")
-  if (is.named(x)) {
-    cat("+ edges (vertex names) and their attributes:\n")
-  } else {
-    cat("+ edges and their attributes:\n")
-  }
-  if (names && ! "name" %in% list.vertex.attributes(x)) {
-    names <- FALSE
-  }
-  if (names && "name" %in% list.vertex.attributes(x) &&
-      !is.numeric(get.vertex.attribute(x, "name")) &&
-      !is.character(get.vertex.attribute(x, "name")) &&
-      !is.logical(get.vertex.attribute(x, "name"))) {
-    warning("Can't print vertex names, complex `name' vertex attribute")
-    names <- FALSE
-  }
-  
-  mp <- getOption("max.print")
-  if (mp >= ec) {
-    omitted.edges <- 0
-    el <- get.edgelist(x, names=names)
-  } else {
-    omitted.edges <- ec-mp
-    el <- get.edges(x, seq_len(mp))
-    if (names) { el[] <- V(x)$name[el] }
-  }
-  ename <- if ("name" %in% list.edge.attributes(x)) {
-    paste(sep="", "'", E(x)$name, "'")
-  } else {
-    seq(length=nrow(el))
-  }
-  if (ec==0 || 
-      all(sapply(list, function(v) is.numeric(get.edge.attribute(x, v)) |
-                 is.character(get.edge.attribute(x,v)) |
-                 is.logical(get.edge.attribute(x, v))))) {
-    ## create a table
-    tab <- data.frame(row.names=paste(sep="", "[", ename, "]"))
-    if (is.numeric(el)) { w <- nchar(max(el)) } else { w <- max(nchar(el)) }
-    tab["edge"] <- paste(sep="", format(el[,1], width=w),
-                         arrow, format(el[,2], width=w))
-    for (i in list) {
-      tab[i] <- get.edge.attribute(x, i)
-    }
-    print(tab)
-  } else {
-    i <- 1
-    apply(el, 1, function(v) {
-      cat(sep="", "[", ename[i], "] ", v[1], " ", arrow, " ", v[2]);
-      lapply(list, function(n) {
-        cat(sep="", "\n[[", i, "]][[", n, "]]\n")
-        print(get.edge.attribute(x, n, i))})
-      cat("\n")
-      i <<- i+1
-    })
-  }
-  if (omitted.edges != 0) {
-    cat(paste('[ reached getOption("max.print") -- omitted', omitted.edges,
-              'edges ]\n\n'))
-  }    
-} 
-
-.print.edges.compressed <- function(x, names) {
-  ## TODO: getOption("max.print")
-  if (is.named(x)) cat("+ edges (vertex names):\n") else cat("+ edges:\n")
-  el <- get.edgelist(x, names=names)
-  arrow <- c("--", "->")[is.directed(x)+1]
-  edges <- paste(sep="", format(el[,1]), arrow, format(el[,2]))
-  print(edges, quote=FALSE)
-}
-
-.print.edges.adjlist <- function(x) {
-  ## TODO: getOption("max.print")
-  cat("+ edges:\n")
-  vc <- vcount(x)
-  arrow <- c(" -- ", " -> ")[is.directed(x)+1]
-  al <- get.adjlist(x, mode="out")
-  w <- nchar(max(which(degree(x, mode="in") != 0)))
-  mpl <- trunc((getOption("width")-nchar(arrow)-nchar(vc)) / (w+1))
-  if (any(sapply(al, length) > mpl)) {
-    ## Wrapping needed
-    mw <- nchar(vcount(x))
-    sm <- paste(collapse="", rep(" ", mw+4))
-    alstr <- lapply(seq_along(al), function(x) {
-      len <- length(al[[x]])
-      fac <- rep(1:(len/mpl+1), each=mpl, length=len)
-      nei <- tapply(format(al[[x]], width=mw), fac, paste, collapse=" ")
-      mark <- paste(sep="", format(x, width=mw), arrow)
-      mark <- c(mark, rep(sm, max(0, length(nei)-1)))
-      paste(sep="", mark, nei)
-    })
-    cat(unlist(alstr), sep="\n")
-  } else { 
-    alstr <- sapply(al, function(x) {
-      paste(format(x, width=w), collapse=" ")
-    })
-    mark <- paste(sep="", format(seq_len(vc)), arrow)
-    alstr <- paste(sep="", mark, alstr)
-    maxw <- max(nchar(alstr))
-    sep <- "   "
-    ncol <- trunc((getOption("width")-1+nchar(sep)) / (maxw+nchar(sep)))
-    if (ncol > 1) {
-      alstr <- format(alstr, width=maxw, justify="left")
-      fac <- rep(1:(vc/ncol+1), each=ncol, length=vc)
-      alstr <- tapply(alstr, fac, paste, collapse=sep)
-    }
-    cat(alstr, sep="\n")
-  }
-}
-
-.print.edges.adjlist.named <- function(x) {
-  ## TODO getOption("max.print")
-  cat("+ edges (vertex names):\n")
-
-  arrow <- c(" -- ", " -> ")[is.directed(x)+1]
-  vn <- V(x)$name
-
-  al <- get.adjlist(x, mode="out")
-  alstr <- sapply(al, function(x) { paste(collapse=", ", vn[x]) })
-  alstr <- paste(sep="", format(vn), arrow, alstr)
-  alstr <- strwrap(alstr, exdent=max(nchar(vn))+nchar(arrow))
-  cat(alstr, sep="\n")
-}
-
-str.igraph <- function(object, ...) {
-  print.igraph(object, full=TRUE, ...)
-}
-
-print.igraph <- function(x, full=getIgraphOpt("print.full"),
-                graph.attributes=getIgraphOpt("print.graph.attributes"),
-                vertex.attributes=getIgraphOpt("print.vertex.attributes"),
-                edge.attributes=getIgraphOpt("print.edge.attributes"),
-                names=TRUE, ...) {
-  
-  if (!is.igraph(x)) {
-    stop("Not a graph object")
-  }
-
-  .print.header(x)
-  if (full) { 
-    if (graph.attributes)  .print.graph.attributes(x)
-    if (vertex.attributes) .print.vertex.attributes(x)
-    if (ecount(x)==0) {
-      ## Do nothing
-    } else if (edge.attributes && length(list.edge.attributes(x)) !=0 ) {
-      .print.edges.edgelist(x, names)
-    } else if (median(degree(x, mode="out")) < 3) {
-      .print.edges.compressed(x, names)
-    } else if (is.named(x)) {
-      .print.edges.adjlist.named(x)
-    } else {
-      .print.edges.adjlist(x)
-    }
-  }
-  
-  invisible(x)
-}
-
-summary.igraph <- function(object, ...) {
-
-  if (!is.igraph(object)) {
-    stop("Not a graph object")
-  }
-
-  title <- paste(sep="", "IGRAPH ",
-                 c("U","D")[is.directed(object)+1],
-                 c("-","N")[is.named(object)+1],
-                 c("-","W")[is.weighted(object)+1],
-                 c("-","B")[is.bipartite(object)+1], " ",
-                 vcount(object), " ", ecount(object), " -- ")
-  w <- getOption("width")
-  if (nchar(title) < w && "name" %in% list.graph.attributes(object)) {
-    title <- substring(paste(sep="", title, object$name), 1, w-1)
-  }
-  cat(title, "\n", sep="")
-
-  aa <- function(names, code, fun) {
-    if (length(names)==0) {
-      ""
-    } else {
-      type <- sapply(names, function(x) mode(fun(object, x)))
-      type <- sapply(type, switch, "numeric"="n", "character"="c", "x")
-      paste(sep="", names, " (", code, "/", type, ")")
-    }
-  }
-  ga <- aa(list.graph.attributes(object), "g", get.graph.attribute)
-  va <- aa(list.vertex.attributes(object), "v", get.vertex.attribute)
-  ea <- aa(list.edge.attributes(object), "e", get.edge.attribute)
-  atxt <- c(ga, va, ea)
-  atxt <- paste(atxt[atxt!=""], collapse=", ")
-  if (atxt != "") {
-    atxt <- strwrap(paste(sep="", "attr: ", atxt), exdent=2)
-    cat(atxt, sep="\n")
-  }
-
-  invisible(object)
-}
-
-"
-####################################################################
-## Various designs for printing graphs
-
-## Summary
-
-IGRAPH UNW- 5 5 -- A ring
-Attr: name (g/c), name (v/c), weight (e/n)
-
-IGRAPH D-W- 100 200 -- Gnm random graph
-
-## Printing, edge list
-
-IGRAPH-UNW--V5-E5----------------------------------------- A ring -
-+ attributes: name (g), name (v), weight (e).
-+ edges:
-     edge  weight              
-[1]' a--b       1
-[2]' b--c       2
-[3]' c--d      -1
-[4]' d--e     0.5
-[5]' a--e       1
-
-## Compressed edge list
-
-IGRAPH UNW- 5 10 -- A ring 
-+ attributes: name (g/c), name (v/n), weight (e/n)
-+ edges:
-[1]' 1--2 2--3 3--4 4--5 1--5 2--5 5--1
-[8]' 1--4 4--2 1--3
-
-## This is good if vertices are named
-
-IGRAPH UNW- 10 18 -- Krackhardt kite
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-Andre    -- [1] Beverly, Carol, Diane, Fernando
-Beverly  -- [1] Andre, Diane, Ed, Garth
-Carol    -- [1] Andre, Diane, Fernando
-Diane    -- [1] Andre, Beverly, Carol, Diane, Ed
-         -- [6] Garth
-Ed       -- [1] Beverly, Diane, Garth
-Fernando -- [1] Andre, Carol, Diane, Garth
-Garth    -- [1] Beverly, Diane, Ed, Fernando
-Heather  -- [1] Fernando, Garth
-Ike      -- [1] Heather, Jane
-Jane     -- [1] Ike
-
-IGRAPH UNW- 10 18 -- Krackhardt kite
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-Andre    -- Beverly, Carol, Diane, Fernando
-Beverly  -- Andre, Diane, Ed, Garth
-Carol    -- Andre, Diane, Fernando
-Diane    -- Andre, Beverly, Carol, Diane, Ed, Garth
-Ed       -- Beverly, Diane, Garth
-Fernando -- Andre, Carol, Diane, Garth
-Garth    -- Beverly, Diane, Ed, Fernando
-Heather  -- Fernando, Garth
-Ike      -- Heather, Jane
-Jane     -- Ike
-
-## This is the good one if vertices are not named
-
-IGRAPH U--- 100 200 -- Gnm random graph 
-+ edges:
-[  1] 28 46 89 90                 [  2] 47 69 72 89
-[  3] 29                          [  4] 17 20
-[  5] 11 40 42 51 78 89           [  6] 27 32 70 87 93
-[  7] 18 27 87                    [  8] 18 24 82
-[  9] 18 20 85 94                 [ 10] 24 70 77 91
-[ 11]  5 12 34 61 62              [ 12] 11 41 44 61 65 80
-...
-
-## Alternative designs, summary
-
-IGRAPH-UNW--V5-E5,---------------------------------------- A ring -
-+ attributes: name (g/c), name (v/c), weight (e/n)
-
-IGRAPH. |V|=5, |E|=5, undirected, named, weighted.
-Attributes: name (g/c), name (v/c), weight (e/n)
-
-IGRAPH: 'A ring'
-Graph attributes: |V|=5, |E|=5, undirected, name.
-Vertex attributes: name.
-Edge attributes: weight.
-
-## Alternative designs, printing
-
-IGRAPH-UNW--V5-E5----------------------------------------- A ring -
-'- attributes: name (g), name (v), weight (e).
-'         edge  weight              
-[1] 'a' -- 'b'       1
-[2] 'b' -- 'c'       2
-[3] 'c' -- 'd'      -1
-[4] 'd' -- 'e'     0.5
-[5] 'a' -- 'e'       1
-
-IGRAPH-UNW--V-5-E-10-------------------------------------- A ring -
-|- attributes: name (g), name (v), weight (e).
-|- edges:
-[1] 'a'--'b'  'b'--'c'  'c'--'d'  'd'--'e'  'a'--'e'  'b'-'e'
-[7] 'e'--'a'  'a'--'d'  'd'--'b'  'a'--'c'
-
-
-IGRAPH-UNW--V-5-E-10-------------------------------------- A ring -
-+ attributes: name (g), name (v), weight (e).
-+ vertices:
-|     name
-| [1]    a
-| [2]    b
-| [3]    c
-| [4]    d
-| [5]    e
-+ edges:
-[1] 'a'--'b'  'b'--'c'  'c'--'d'  'd'--'e'  'a'--'e'  'b'-'e'
-[7] 'e'--'a'  'a'--'d'  'd'--'b'  'a'--'c'
-
-
-
-
-IGRAPH-UNW--V-5-E-10-------------------------------------- A ring -
-+ graph attributes: name
-+ vertex attributes: name
-+ edge attributes: weight
-+ vertices:
-|   name
-|1]    a
-|2]    b
-|3]    c
-|4]    d
-|5]    e
-+ edges:
-|1] a--b  b--c  c--d  d--e  a--e  b-e
-|7] e--a  a--d  d--b  a--c
-
-
-
-IGRAPH-UNW--V-5-E-10-------------------------------------- A ring -
-+ graph attributes:  name (c)
-+ vertex attributes: name (c)
-+ edge attributes:   weight (n)
-+ edges:
-[1] a--b  b--c  c--d  d--e  a--e  b-e
-[7] e--a  a--d  d--b  a--c
-
-
-IGRAPH-UNW--V-5-E-10-------------------------------------- A ring -
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[ 1] a--b b--c c--d d--e a--e b--e e--a a--d d--b
-[10] a--c
-
-IGRAPH-DNW--V-5-E-10-------------------------------------- A ring -
-+ attributes: name (g/c), name (v/n), weight (e/n)
-+ edges:
-[1]' 1->2 2->3 3->4 4->5 1->5 2->5 5->1
-[8]' 1->4 4->2 1->3
-
-
-IGRAPH-UNW--V-5-E-20-------------------------------------- A ring -
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[ 1] a-b b-c c-d d-e a-e b-e e-a a-d d-b a-c
-[11] a-b b-c c-d d-e a-e b-e e-a a-d d-b a-c
-
-
-IGRAPH-UNW--V-8-E-10-------------------------------------- A ring -
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[a] b c e f h
-[b] a c e
-[c] a b d
-[d] a b c h
-[e] a b d
-[f] a
-[g]
-[h] a d
-
-IGRAPH-UNW--V-10-E-18------------------------------------- A ring -
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[a] a--{b,c,e,f,h}  b--{a,c,e}  c--{a,b,d}  d--{a,b,c,h}
-[e] e--{a,b,d}      f--{a}      g--{}       h--{a,d}
-
-
-IGRAPH-UNW--V10-E18------------------------------Krackhardt kite--
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[   Andre][1] Beverly  Carol    Diane    Fernando
-[ Beverly][1] Andre    Diane    Ed       Garth
-[   Carol][1] Andre    Diane    Fernando
-[   Diane][1] Andre    Beverly  Carol    Diane    Ed
-[   Diane][6] Garth
-[      Ed][1] Beverly  Diane    Garth
-[Fernando][1] Andre    Carol    Diane    Garth
-[   Garth][1] Beverly  Diane    Ed       Fernando
-[ Heather][1] Fernando Garth
-[     Ike][1] Heather  Jane
-[    Jane][1] Ike
-
-IGRAPH-UNW--V10-E18-------------------------------Krackhardt kite--
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[   Andre][1] Beverly/1  Carol/3    Diane/3    Fernando/1
-[ Beverly][1] Andre/1    Diane/1    Ed/2       Garth/2
-[   Carol][1] Andre/2    Diane/2    Fernando/1
-[   Diane][1] Andre/5    Beverly/1  Carol/0.4  Diane/2
-[   Diane][5] Ed/1.5     Garth/2.5
-[      Ed][1] Beverly/-1 Diane/1.5  Garth/2
-[Fernando][1] Andre/1    Carol/2    Diane/1    Garth/1
-[   Garth][1] Beverly/2  Diane/3    Ed/1       Fernando/-1
-[ Heather][1] Fernando/3 Garth/1
-[     Ike][1] Heather/1  Jane/-1
-[    Jane][1] Ike/-2
-
-
-IGRAPH-UNW--V10-E18-------------------------------Krackhardt kite--
-+ attributes: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[   Andre][1] Beverly (1)  Carol (3)    Diane (3)    Fernando (1)
-[ Beverly][1] Andre (1)    Diane (1)    Ed (2)       Garth (2)
-[   Carol][1] Andre (2)    Diane (2)    Fernando (1)
-[   Diane][1] Andre (5)    Beverly (1)  Carol (0.5)  Diane (2)
-[   Diane][5] Ed (1.5)     Garth (2.5)
-[      Ed][1] Beverly (-1) Diane (1.5)  Garth (2)
-[Fernando][1] Andre (1)    Carol (2)    Diane (1)    Garth (1)
-[   Garth][1] Beverly (2)  Diane (3)    Ed (1)       Fernando (-1)
-[ Heather][1] Fernando (3) Garth (1)
-[     Ike][1] Heather (1)  Jane (-1)
-[    Jane][1] Ike (-2)
-
-IGRAPH UNW- V10 E18 -- Krackhardt kite
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ edges:
-[   Andre][1] Beverly (1)  Carol (3)    Diane (3)    Fernando (1)
-[ Beverly][1] Andre (1)    Diane (1)    Ed (2)       Garth (2)
-[   Carol][1] Andre (2)    Diane (2)    Fernando (1)
-[   Diane][1] Andre (5)    Beverly (1)  Carol (0.5)  Diane (2)
-[   Diane][5] Ed (1.5)     Garth (2.5)
-[      Ed][1] Beverly (-1) Diane (1.5)  Garth (2)
-[Fernando][1] Andre (1)    Carol (2)    Diane (1)    Garth (1)
-[   Garth][1] Beverly (2)  Diane (3)    Ed (1)       Fernando (-1)
-[ Heather][1] Fernando (3) Garth (1)
-[     Ike][1] Heather (1)  Jane (-1)
-[    Jane][1] Ike (-2)
-
-
-
-IGRAPH-U----V100-E200----------------------------Gnm random graph--
-+ edges:
-[  1] 28 46 89 90
-[  2] 47 69 72 89
-[  3] 29
-[  4] 17 20
-[  5] 11 40 42 51 78 89
-[  6] 27 32 70 87 93
-[  7] 18 27 87
-[  8] 18 24 82
-[  9] 18 20 85 94
-[ 10] 24 70 77 91
-[ 11]  5 12 34 61 62
-[ 12] 11 41 44 61 65 80
-...
-
-IGRAPH-U----100-200------------------------------Gnm random graph--
-+ edges:
-[  1] 28 46 89 90                 [  2] 47 69 72 89
-[  3] 29                          [  4] 17 20
-[  5] 11 40 42 51 78 89           [  6] 27 32 70 87 93
-[  7] 18 27 87                    [  8] 18 24 82
-[  9] 18 20 85 94                 [ 10] 24 70 77 91
-[ 11]  5 12 34 61 62              [ 12] 11 41 44 61 65 80
-...
-
-
-
-"
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/revolver.R igraph-0.6.5/interfaces/R/igraph/R/revolver.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/revolver.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/revolver.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,493 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-evolver.d <- function(nodes, kernel, outseq=NULL, outdist=NULL,
-                      m=1, directed=TRUE) {
-
-  if (!is.null(outseq)) { outseq <- as.numeric(outseq) }
-  if (!is.null(outdist)) { outdist <- as.numeric(outdist) }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_evolver_d", as.numeric(nodes), as.numeric(kernel),
-        outseq, outdist, m, as.logical(directed),
-        PACKAGE="igraph")
-}
-  
-revolver.d <- function(graph, niter=5, sd=FALSE, norm=FALSE,
-                      cites=FALSE, expected=FALSE, error=TRUE,
-                      debug=numeric()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_d", graph, as.numeric(niter), as.logical(sd),
-        as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug),
-        PACKAGE="igraph")
-}
-
-revolver.error.d <- function(graph, kernel) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_d", graph, as.numeric(kernel),
-        PACKAGE="igraph")
-}
-
-revolver.ad <- function(graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-                       sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE, error=TRUE,
-                       debug=matrix(ncol=2, nrow=0)) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_ad", graph, as.numeric(niter), as.numeric(agebins),
-        as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)),
-        PACKAGE="igraph")
-}
-
-revolver.error.ad <- function(graph, kernel) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_ad", graph, kernel,
-        PACKAGE="igraph")
-}
-
-revolver.ade <- function(graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-                        sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                        error=TRUE, debug=matrix(ncol=2, nrow=0)) {
-                        
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_ade", graph, as.numeric(cats), as.numeric(niter),
-        as.numeric(agebins), as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
-
-revolver.error.ade <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-  
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_ade", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.e <- function(graph, cats, niter=5, st=FALSE,
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_e", graph, as.numeric(cats), as.numeric(niter), as.logical(st),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-                                                     
-revolver.error.e <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_e", graph, as.numeric(kernel), as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.de <- function(graph, cats, niter=5,
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_de", graph, as.numeric(cats), as.numeric(niter),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-                       
-revolver.error.de <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_de", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.l <- function(graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_l", graph, as.numeric(niter), as.numeric(agebins),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.l <- function(graph, kernel) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_l", graph, as.numeric(kernel),
-        PACKAGE="igraph")
-}
-
-revolver.dl <- function(graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-                       sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                       error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_dl", graph, as.numeric(niter), as.numeric(agebins),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.dl <- function(graph, kernel) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_dl", graph, kernel,
-        PACKAGE="igraph")
-}
-
-revolver.el <- function(graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-                       sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                       error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_el", graph, as.numeric(cats), as.numeric(niter),
-        as.numeric(agebins),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.el <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_el", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.r <- function(graph, window, niter=5, sd=FALSE, norm=FALSE,
-                       cites=FALSE, expected=FALSE, error=TRUE,
-                       debug=numeric()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_r", graph, as.numeric(niter), as.numeric(window),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.r <- function(graph, kernel, window) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_r", graph, as.numeric(kernel), as.numeric(window),
-        PACKAGE="igraph")
-}
-
-revolver.ar <- function(graph, window, niter=5, agebins=max(vcount(graph)/7100, 10),
-                       sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE, error=TRUE,
-                       debug=matrix(ncol=2, nrow=0)) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_ar", graph, as.numeric(niter), as.numeric(agebins),
-        as.numeric(window),
-        as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
-
-revolver.error.ar <- function(graph, kernel, window) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_ar", graph, kernel, as.numeric(window),
-        PACKAGE="igraph")
-}
-
-revolver.di <- function(graph, cats, niter=5,
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_di", graph, as.numeric(cats), as.numeric(niter),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.di <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_di", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.adi <- function(graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-                        sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                        error=TRUE, debug=matrix(ncol=2, nrow=0)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_adi", graph, as.numeric(cats), as.numeric(niter),
-        as.numeric(agebins), as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
-
-revolver.error.adi <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_adi", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.il <- function(graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_il", graph, as.numeric(cats),
-        as.numeric(niter), as.numeric(agebins),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.il <- function(graph, kernel, cats) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_il", graph, kernel, as.numeric(cats),
-        PACKAGE="igraph")
-}
-
-revolver.ir <- function(graph, cats, window, niter=5,
-                      sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                      error=TRUE, debug=numeric()) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_ir", graph, as.numeric(cats), as.numeric(window),
-        as.numeric(niter),
-        as.logical(sd), as.logical(norm), as.logical(cites), as.logical(expected),
-        as.logical(error), as.numeric(debug), 
-        PACKAGE="igraph")
-}
-
-revolver.error.ir <- function(graph, kernel, cats, window) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_ir", graph, kernel, as.numeric(cats),
-        as.numeric(window),
-        PACKAGE="igraph")
-}
-
-revolver.air <- function(graph, cats, window,
-                        niter=5, agebins=max(vcount(graph)/7100, 10),
-                        sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                        error=TRUE, debug=matrix(ncol=2, nrow=0)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_air", graph, as.numeric(cats), as.numeric(window),
-        as.numeric(niter),
-        as.numeric(agebins), as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
-
-revolver.error.air <- function(graph, kernel, cats, window) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  kernel <- structure(as.numeric(kernel), dim=dim(kernel))
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_error2_air", graph, kernel, as.numeric(cats),
-        as.numeric(window),
-        PACKAGE="igraph")
-}
-
-revolver.d.d <- function(graph, vtime=V(graph)$time, etime=E(graph)$time, niter=5,
-                         sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                         error=TRUE, debug=matrix(ncol=2, nrow=0)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-
-  if (is.null(vtime)) {
-    stop("vtime missing")
-  }
-  if (is.null(etime)) {
-    stop("etime missing")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_d_d", graph, as.numeric(niter),
-        as.numeric(vtime), as.numeric(etime), 
-        as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
-
-revolver.p.p <- function(graph, events=get.graph.attribute(graph, "events"),
-                         vtime=V(graph)$time, etime=E(graph)$time,
-                         niter=5, sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-                         error=TRUE, debug=matrix(ncol=2, nrow=0)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object!")
-  }
-  if (is.null(events) || !is.list(events)) {
-    stop("events missing or not a list")
-  }
-  if (is.null(vtime)) {
-    ## TODO: calculate from events
-    stop("vtime missing")
-  }
-  if (is.null(etime)) {
-    ## TODO: calculate from events
-    stop("etime missing")
-  }
-  
-  authors <- unlist(events)
-  eventsizes <- sapply(events, length)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_revolver_p_p", graph, as.numeric(niter),
-        as.numeric(vtime), as.numeric(etime), as.numeric(authors),
-        as.numeric(eventsizes), as.logical(sd), as.logical(norm), as.logical(cites),
-        as.logical(expected), as.logical(error),
-        structure(as.numeric(debug), dim=dim(debug)), 
-        PACKAGE="igraph")
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/scg.R igraph-0.6.5/interfaces/R/igraph/R/scg.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/scg.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/scg.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,249 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-get.stochastic <- function(graph, column.wise=FALSE,
-                           sparse=getIgraphOpt("sparsematrices")) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
- 
-  column.wise <- as.logical(column.wise)
-  if (length(column.wise) != 1) {
-    stop("`column.wise' must be a logical scalar")
-  }
-
-  sparse <- as.logical(sparse)
-  if (length(sparse) != 1) {
-    stop("`sparse' must be a logical scalar")
-  }
-
-  on.exit(.Call("R_igraph_finalizer", PACKAGE="igraph"))
-  if (sparse) {
-    res <- .Call("R_igraph_get_stochastic_sparsemat", graph, column.wise,
-                 PACKAGE="igraph")
-    res <- igraph.i.spMatrix(res)
-  } else {
-    res <- .Call("R_igraph_get_stochastic", graph, column.wise,
-                 PACKAGE="igraph")
-  }
-
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    rownames(res) <- colnames(res) <- V(graph)$name
-  }
-
-  res
-} 
-
-scgGrouping <- function(V, nt,
-                         mtype=c("symmetric", "laplacian",
-                           "stochastic"),
-                         algo=c("optimum", "interv_km", "interv",
-                           "exact_scg"),
-                         p=NULL, maxiter=100) {
-
-  V <- as.matrix(structure(as.double(V), dim=dim(V)))
-  groups <- as.numeric(nt)
-
-  mtype <- switch(igraph.match.arg(mtype), "symmetric"=1, 
-                        "laplacian"=2, "stochastic"=3)
-  algo <- switch(igraph.match.arg(algo), "optimum"=1,
-                      "interv_km"=2, "interv"=3, "exact_scg"=4)
-  if (!is.null(p)) p <- as.numeric(p)
-  maxiter <- as.integer(maxiter)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_scg_grouping", V, as.integer(nt[1]),
-               if (length(nt)==1) NULL else nt,
-               mtype, algo, p, maxiter,
-               PACKAGE="igraph")
-  res
-}
-
-scgSemiProjectors <- function(groups,
-                               mtype=c("symmetric", "laplacian",
-                                 "stochastic"), p=NULL,
-                               norm=c("row", "col"),
-                               sparse=getIgraphOpt("sparsematrices")) {
-  # Argument checks
-  groups <- as.numeric(groups)-1
-  mtype <- switch(igraph.match.arg(mtype), "symmetric"=1, 
-  "laplacian"=2, "stochastic"=3)
-  if (!is.null(p)) p <- as.numeric(p)
-  norm <- switch(igraph.match.arg(norm), "row"=1, "col"=2)
-  sparse <- as.logical(sparse)
-  if (sparse && !require(Matrix)) { sparse <- FALSE }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_scg_semiprojectors", groups, mtype, p, norm,
-               sparse,
-               PACKAGE="igraph")
-
-  if (sparse) {
-    res$L <- igraph.i.spMatrix(res$L)
-    res$R <- igraph.i.spMatrix(res$R)
-  }
-                
-  res
-}
-
-scg <- function(X, ev, nt, groups=NULL, 
-                mtype=c("symmetric", "laplacian", "stochastic"),
-                algo=c("optimum", "interv_km", "interv",
-                  "exact_scg"), norm=c("row", "col"),
-                direction=c("default", "left", "right"),
-                evec=NULL, p=NULL, use.arpack=FALSE, maxiter=300,
-                sparse=getIgraphOpt("sparsematrices"),
-                output=c("default", "matrix", "graph"), semproj=FALSE,
-                epairs=FALSE, stat.prob=FALSE)
-  UseMethod("scg")
-
-scg.igraph <- function(X, ev, nt, groups=NULL,
-                       mtype=c("symmetric", "laplacian", "stochastic"),
-                       algo=c("optimum", "interv_km", "interv",
-                         "exact_scg"), norm=c("row", "col"),
-                       direction=c("default", "left", "right"),
-                       evec=NULL, p=NULL, use.arpack=FALSE, maxiter=300,
-                       sparse=getIgraphOpt("sparsematrices"),
-                       output=c("default", "matrix", "graph"), semproj=FALSE,
-                       epairs=FALSE, stat.prob=FALSE) {
-  
-  myscg(graph=X, matrix=NULL, sparsemat=NULL, ev=ev, nt=nt,
-        groups=groups, mtype=mtype, algo=algo,
-        norm=norm, direction=direction, evec=evec, p=p,
-        use.arpack=use.arpack, maxiter=maxiter, sparse=sparse,
-        output=output, semproj=semproj, epairs=epairs,
-        stat.prob=stat.prob)
-}
-
-scg.matrix <- function(X, ev, nt, groups=NULL,
-                       mtype=c("symmetric", "laplacian", "stochastic"),
-                       algo=c("optimum", "interv_km", "interv",
-                         "exact_scg"), norm=c("row", "col"),
-                       direction=c("default", "left", "right"),
-                       evec=NULL, p=NULL, use.arpack=FALSE, maxiter=300,
-                       sparse=getIgraphOpt("sparsematrices"),
-                       output=c("default", "matrix", "graph"), semproj=FALSE,
-                       epairs=FALSE, stat.prob=FALSE) {
-  
-  myscg(graph=NULL, matrix=X, sparsemat=NULL, ev=ev, nt=nt,
-        groups=groups, mtype=mtype, algo=algo,
-        norm=norm, direction=direction, evec=evec, p=p, 
-        use.arpack=use.arpack, maxiter=maxiter, sparse=sparse,
-        output=output, semproj=semproj, epairs=epairs,
-        stat.prob=stat.prob)
-}
-
-scg.Matrix <- function(X, ev, nt, groups=NULL,
-                       mtype=c("symmetric", "laplacian", "stochastic"),
-                       algo=c("optimum", "interv_km", "interv",
-                         "exact_scg"), norm=c("row", "col"),
-                       direction=c("default", "left", "right"),
-                       evec=NULL, p=NULL, use.arpack=FALSE, maxiter=300,
-                       sparse=getIgraphOpt("sparsematrices"),
-                       output=c("default", "matrix", "graph"), semproj=FALSE,
-                       epairs=FALSE, stat.prob=FALSE) {
-
-  myscg(graph=NULL, matrix=NULL, sparsemat=X, ev=ev, nt=nt,
-        groups=groups, mtype=mtype, algo=algo,
-        norm=norm, direction=direction, evec=evec, p=p,
-        use.arpack=use.arpack, maxiter=maxiter, sparse=sparse,
-        output=output, semproj=semproj, epairs=epairs,
-        stat.prob=stat.prob)
-}
-
-myscg <- function(graph, matrix, sparsemat, ev, nt, groups=NULL,
-                  mtype=c("symmetric", "laplacian", "stochastic"),
-                  algo=c("optimum", "interv_km", "interv",
-                    "exact_scg"), norm=c("row", "col"),
-                  direction=c("default", "left", "right"),
-                  evec=NULL, p=NULL, use.arpack=FALSE, maxiter=300,
-                  sparse=getIgraphOpt("sparsematrices"),
-                  output=c("default", "matrix", "graph"), semproj=FALSE,
-                  epairs=FALSE, stat.prob=FALSE) {
-
-  ## Argument checks
-  if (!is.null(graph))  { stopifnot(is.igraph(graph)) }
-  if (!is.null(matrix)) { stopifnot(is.matrix(matrix)) }
-  if (!is.null(sparsemat)) { stopifnot(inherits(sparsemat, "Matrix")) }
-
-  if (!is.null(sparsemat)) { sparsemat <- as(sparsemat, "dgCMatrix") }
-  ev <- as.numeric(as.integer(ev))
-  nt <- as.numeric(as.integer(nt))
-  if (!is.null(groups)) groups <- as.numeric(groups)
-  mtype <- igraph.match.arg(mtype)
-  algo <- switch(igraph.match.arg(algo), "optimum"=1,
-                      "interv_km"=2, "interv"=3, "exact_scg"=4)
-  if (!is.null(groups)) { storage.mode(groups) <- "double" }
-  use.arpack <- as.logical(use.arpack)
-  maxiter <- as.integer(maxiter)
-  sparse <- as.logical(sparse)
-  output <- switch(igraph.match.arg(output), "default"=1, "matrix"=2,
-                   "graph"=3)
-  semproj <- as.logical(semproj)
-  epairs <- as.logical(epairs)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-
-  if (mtype=="symmetric") {
-    if (!is.null(evec)) { storage.mode(evec) <- "double" }
-    res <- .Call("R_igraph_scg_adjacency", graph, matrix, sparsemat, ev,
-                 nt, algo, evec, groups,
-                 use.arpack, maxiter, sparse, output, semproj, epairs,
-                 PACKAGE="igraph")
-
-  } else if (mtype=="laplacian") {
-    norm <- switch(igraph.match.arg(norm), "row"=1, "col"=2)
-    if (!is.null(evec)) { storage.mode(evec) <- "complex" }
-    direction <- switch(igraph.match.arg(direction), "default"=1, "left"=2,
-                        "right"=3)
-    res <- .Call("R_igraph_scg_laplacian", graph, matrix, sparsemat, ev,
-                 nt, algo, norm, direction,
-                 evec, groups, use.arpack, maxiter, sparse, output,
-                 semproj, epairs,
-                 PACKAGE="igraph")
-
-  } else if (mtype=="stochastic") {
-    norm <- switch(igraph.match.arg(norm), "row"=1, "col"=2)
-    if (!is.null(evec)) { storage.mode(evec) <- "complex" }
-    if (!is.null(p)) { storage.mode(p) <- "double" }
-    stat.prob <- as.logical(stat.prob)
-    res <- .Call("R_igraph_scg_stochastic", graph, matrix, sparsemat, ev,
-                 nt, algo, norm, evec, groups, p, use.arpack,
-                 maxiter, sparse, output, semproj, epairs, stat.prob,
-                 PACKAGE="igraph")    
-  }
-
-  if (!is.null(res$Xt) &&
-      class(res$Xt) == "igraph.tmp.sparse") {
-    res$Xt <- igraph.i.spMatrix(res$Xt)
-  }
-  if (!is.null(res$L) && class(res$L) == "igraph.tmp.sparse") {
-    res$L <- igraph.i.spMatrix(res$L)
-  }
-  if (!is.null(res$R) && class(res$R) == "igraph.tmp.sparse") {
-    res$R <- igraph.i.spMatrix(res$R)
-  }
-
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/setbyname.R igraph-0.6.5/interfaces/R/igraph/R/setbyname.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/setbyname.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/setbyname.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,234 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-# This file contains code, that was written by Magnus Torfason
-
-# This function checks some very basic pitfalls that can cause
-# incorrect merge results, and then merges using the merge function.
-#
-# Additionally, if indicate.origin=TRUE is specified, it will add 
-# variables called was.in.x and was.in.y indicating if an entry was
-# in the x/y part of the merge.
-safer.merge = function(
-        x, y, by = intersect(names(x), names(y)),
-        by.x = by, by.y = by, all = FALSE, all.x = all, all.y = all,
-        suffixes = c(".x",".y"), incomparables = NULL, 
-        indicate.origin=FALSE, allow.duplicates=FALSE, 
-        allow.duplicates.x=allow.duplicates, allow.duplicates.y=allow.duplicates, 
-        ...)
-{
-    if ( !allow.duplicates.x & (sum(duplicated(x[,by.x]))!=0) )
-    {
-        stop("safer.merge: Duplicates found in x, but allow.duplicates.x is FALSE" )
-    }
-    if ( !allow.duplicates.y & (sum(duplicated(y[,by.y]))!=0) )
-    {
-        stop("safer.merge: Duplicates found in y, but allow.duplicates.y is FALSE" )
-    }
-    stopifnot( sum(is.na(x[,by.x])) == 0 )
-    stopifnot( sum(is.na(y[,by.y])) == 0 )
-    
-    if ( indicate.origin )
-    {
-        stopifnot( !("was.in" %in% names(x) ) )
-        stopifnot( !("was.in" %in% names(y) ) )
-        x$was.in=TRUE
-        y$was.in=TRUE
-    }
-    
-    result = merge(x, y, by=by, 
-        by.x=by.x, by.y=by.y, all=all, all.x=all.x, all.y=all.y,
-        sort=TRUE, suffixes=suffixes, incomparables=incomparables, ...)
-    
-    if ( indicate.origin )
-    {
-        was.in.x = paste("was.in", suffixes[1], sep="")
-        was.in.y = paste("was.in", suffixes[2], sep="")
-        result[ is.na(result[,was.in.x]) , was.in.x] = FALSE
-        result[ is.na(result[,was.in.y]) , was.in.y] = FALSE
-    }
-    
-    return(result)
-}
-    
-# Return graph vertices as a data.frame.
-# If keep.attributes == TRUE, the data.frame contains all vertex attributes.
-get.vertices.as.data.frame = function(graph, keep.attributes=FALSE)
-{
-    stopifnot( length(V(graph)$name) == length(unique(V(graph)$name))) # Vertex names must be unique
-    d = data.frame(V=V(graph)$name)
-    if ( keep.attributes )
-    {
-        # Bind attributes if requested
-        attr.names = list.vertex.attributes(graph) 
-        d.a = as.data.frame(lapply( attr.names, 
-                      function(attr, g){get.vertex.attribute(g,attr)},
-                      graph))
-        names(d.a) = attr.names
-        d = cbind(d,d.a)
-    }
-    return(d)
-}
-
-# Return graph edges as a mergable data.frame
-# If the graph is undirected, the result will have all V1 <= V2
-# If keep.attributes == TRUE, the data.frame contains all edge attributes.
-get.edges.as.data.frame = function(graph, keep.attributes=FALSE)
-{
-    stopifnot( length(V(graph)$name) == length(unique(V(graph)$name))) # Vertex names must be unique
-    m = get.edgelist(graph)
-    if ( !is.directed(graph) )
-    {
-        ix.rev        = m[,1] > m[,2]       # Choose which pairs to switch
-        m[ix.rev,1:2] = m[ix.rev,2:1]       # Switch
-    }
-    d = as.data.frame(m)
-    if ( keep.attributes )
-    {
-        # Bind attributes if requested
-        attr.names = list.edge.attributes(graph) 
-        d.a = as.data.frame(lapply( attr.names, 
-                      function(attr, g){get.edge.attribute(g,attr)},
-                      graph))
-        names(d.a) = attr.names
-        d = cbind(d,d.a)
-    }
-    return(d)
-}
-
-# Create an intersection of two graphs.
-# This function correctly intersects the graphs based
-# on the name attributes, such that:
-#   Any vertex that is in g1 and g2 is in the result.
-#   Any edge that is in g1 and g2 is in the result.
-# This function preserves some attributes, but not all.
-graph.intersection.by.name = function(g1, g2, 
-        keep.x.vertices          = FALSE,
-        keep.x.vertex.attributes = FALSE,
-        keep.x.edge.attributes   = FALSE)
-{
-    # Only undirected graphs are supported
-    stopifnot(!is.directed(g1) & !is.directed(g2))
-
-    # Construct data.frames of nodes and edges
-    dv1 = get.vertices.as.data.frame(g1, keep.attributes=keep.x.vertex.attributes)
-    dv2 = get.vertices.as.data.frame(g2)
-    de1 = get.edges.as.data.frame(g1, keep.attributes=keep.x.edge.attributes)
-    de2 = get.edges.as.data.frame(g2)
-
-    # Merge data.frames and construct result
-    if ( keep.x.vertices )
-        dv = dv1
-    else
-        dv = safer.merge(dv1, dv2)
-    de = safer.merge(de1, de2)
-    g  = graph.data.frame(de, directed=FALSE, vertices=dv)
-    return(g)
-}
-
-# Create union of two graphs.
-# This function correctly unions the graphs based
-# on the name attributes, such that:
-#   Any vertex that is in g1 or g2 is in the result.
-#   Any edge that is in g1 or g2 is in the result.
-# However, this function does NOT preserve other attributes.
-graph.union.by.name = function(g1, g2)
-{
-    # Only undirected graphs are supported
-    stopifnot(!is.directed(g1) & !is.directed(g2))
-
-    # Construct data.frames of nodes and edges
-    dv1 = get.vertices.as.data.frame(g1)
-    dv2 = get.vertices.as.data.frame(g2)
-    de1 = get.edges.as.data.frame(g1)
-    de2 = get.edges.as.data.frame(g2)
-
-    # Merge data.frames and construct result
-    dv = safer.merge(dv1, dv2, all=TRUE)
-    de = safer.merge(de1, de2, all=TRUE)
-    g  = graph.data.frame(de, directed=FALSE, vertices=dv)
-    return(g)
-}
-
-# Create difference of two graphs.
-# This function correctly diffs the graphs based
-# on the name attributes. Note that this difference applies
-# only to the edges, not the vertices, so that:
-#   Any vertex that is in g1 is in the result.
-#   Any edge that is in g1 but not in g2 is in the result.
-# However, this function does NOT preserve other attributes.
-graph.difference.by.name = function(g1, g2,
-            keep.x.vertex.attributes = FALSE,
-            keep.x.edge.attributes   = FALSE)
-{
-    # Only undirected graphs are supported
-    stopifnot(!is.directed(g1) & !is.directed(g2))
-
-    # Construct data.frames of nodes and edges
-    dv = get.vertices.as.data.frame(g1, keep.attributes=keep.x.vertex.attributes)
-    de1 = get.edges.as.data.frame(g1, keep.attributes=keep.x.edge.attributes)
-    de2 = get.edges.as.data.frame(g2)
-
-    # Merge data.frames and construct result
-    de = safer.merge(de1, de2, all=TRUE, indicate.origin=TRUE) # All edges
-    de = de[ (de$was.in.x & !de$was.in.y) ,                    # Remove g2 edges
-             setdiff(names(de),c("was.in.x","was.in.y")) ]     # Keep attributes from g1     
-    g  = graph.data.frame(de, directed=FALSE, vertices=dv)     # The new graph
-    return(g)
-}
-
-
-# Test/demonstration code
-if (FALSE)
-{
-
-# Load library and set parameters for better printing
-library(igraph)
-igraph.options(print.vertex.attributes=TRUE)
-igraph.options(print.edge.attributes=TRUE)
-
-# Define input graphs
-g1 <- graph.formula(a-b-c)
-V(g1)$v.attr=c(1,2,3)
-E(g1)$e.attr=c(5,7)
-g2 <- graph.formula(b-c-d)
-
-# Test the functions
-graph.intersection.by.name(g1,g2) # Vertices are intersected as well
-graph.union.by.name(g1,g2)        # Vertices are unioned as well
-graph.difference.by.name(g1,g2)   # Vertices from x (g1) are used
-
-# graph.intersection.by.name() has some extra parameters
-graph.intersection.by.name(g1,g2,
-    keep.x.vertices          = TRUE) # Keep all x vertices (only intersect edges)
-
-graph.intersection.by.name(g1,g2,
-    keep.x.vertices          = FALSE, # Keep all x vertices (only intersect edges)
-    keep.x.vertex.attributes = TRUE, # Don't throw away V(g1) attributes
-    keep.x.edge.attributes   = TRUE) # Don't throw away E(g1) attributes
-
-# graph.difference.by.name() has some extra parameters
-graph.difference.by.name(g1,g2,
-    keep.x.vertex.attributes = TRUE, # Don't throw away V(g1) attributes
-    keep.x.edge.attributes   = TRUE) # Don't throw away E(g1) attributes
-
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/socnet.R igraph-0.6.5/interfaces/R/igraph/R/socnet.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/socnet.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/socnet.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,2407 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2009-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-# TODO LIST:
-#   * adding edges to a graph
-#   * exporting graphics
-#   * scroll bar for the graph list area   == IMPOSSIBLE right now, should be a list
-#   * window title in the error dialog
-#   * keyboard shortcuts
-#   * implement min & max in .tkigraph.dialog
-
-.tkigraph.env <- new.env()
-
-tkigraph <- function() {
-
-  require(tcltk) || stop("tcl/tk library not available")
-
-  options(scipen=10000)
-  
-  if (!exists("window", envir=.tkigraph.env, inherits=FALSE)) {
-    assign("window", TRUE, envir=.tkigraph.env)
-    assign("graphs", list(), envir=.tkigraph.env)
-    assign("selected", list(), envir=.tkigraph.env)
-    assign("tklines", list(), envir=.tkigraph.env)
-  } else {
-    stop("tkigraph window is already open!")
-  }
-  
-  # Create top window
-  top <- tktoplevel(background="lightgrey", width=700, height=400)
-  tktitle(top) <- "iGraph GUI (Social Network Basics)"
-  topframe <- tkframe(top, relief="sunken", borderwidth=1)
-  scr <- tkscrollbar(top, repeatinterval=5,
-                     command=function(...) tkyview(topframe))
-  tkplace(topframe, x=0, y=0, relwidth=1.0)
-  
-  # Store myself in the environment if needed
-  if (!exists("top", envir=.tkigraph.env, inherits=FALSE)) {
-    assign("top", top, envir=.tkigraph.env)
-    assign("topframe", topframe, envir=.tkigraph.env)
-  }
-  
-  # kill myself if window was closed
-  tkbind(top, "<Destroy>", function() .tkigraph.close())
-
-  # pull-down menu
-  main.menu <- tkmenu(top)
-
-  graph.menu <- tkmenu(main.menu)
-  
-  create.menu <- tkmenu(main.menu)
-  tkadd(create.menu, "command", label="By hand", command=function() {
-    .tkigraph.by.hand()
-  })
-  tkadd(create.menu, "separator")
-  tkadd(create.menu, "command", label="Ring", command=function() {
-    .tkigraph.ring()
-  })
-  tkadd(create.menu, "command", label="Tree", command=function() {
-    .tkigraph.tree()
-  })
-  tkadd(create.menu, "command", label="Lattice", command=function() {
-    .tkigraph.lattice()
-  })
-  tkadd(create.menu, "command", label="Star", command=function() {
-    .tkigraph.star()
-  })
-  tkadd(create.menu, "command", label="Full", command=function() {
-    .tkigraph.full()
-  })
-  tkadd(create.menu, "separator")
-  tkadd(create.menu, "command", label="Graph atlas...", command=function() {
-    .tkigraph.atlas()
-  })
-  tkadd(create.menu, "separator")
-  tkadd(create.menu, "command", label="Moody-White network", command=function() {
-    g <- graph.adjacency(.tkigraph.net.moody.white, mode="undirected")
-    g <- set.graph.attribute(g, "name", "Moody-White network")
-    .tkigraph.add.graph(g)
-  })
-  
-  tkadd(create.menu, "separator") 
-  tkadd(create.menu, "command", label="Random (Erdos-Renyi G(n,p))",
-        command=function() {
-          .tkigraph.erdos.renyi.game()
-        })
-  tkadd(create.menu, "command", label="Random (Erdos-Renyi G(n,m))",
-        command=function() { .tkigraph.erdos.renyi.gnm.game() })
-  tkadd(create.menu, "command", label="Random (Barabasi-Albert)",
-        command=function() {
-          .tkigraph.barabasi.game()
-        })
-  tkadd(create.menu, "command", label="Random (Configuration model)",
-        command=function() {
-          .tkigraph.degree.sequence.game()
-        })
-  tkadd(create.menu, "command", label="Watts-Strogatz random graph",
-        command=function() {
-          .tkigraph.watts.strogatz()
-        })
-  tkadd(create.menu, "separator")
-  tkadd(create.menu, "command", label="Simplify", command=function() {
-    .tkigraph.simplify()
-  })
-  tkadd(graph.menu, "cascade", label="Create", menu=create.menu)
-  tkadd(graph.menu, "command", label="Delete", command=function() {
-    .tkigraph.delete() })  
-  tkadd(graph.menu, "separator")
-  tkadd(graph.menu, "command", label="Show graph",
-        command=function() { .tkigraph.show() })
-  tkadd(graph.menu, "command", label="Basic statistics",
-        command=function() { .tkigraph.stat() })
-  tkadd(graph.menu, "separator")
-  tkadd(graph.menu, "command", label="Import session", command=function() {
-    .tkigraph.load()
-  })
-#  tkadd(graph.menu, "command", label="Load from the Web", command=function() {
-#    .tkigraph.load.online()
-#  })
-  tkadd(graph.menu, "command", label="Export session", command=function() {
-    .tkigraph.save()
-  })
-  tkadd(graph.menu, "separator")
-  tkadd(graph.menu, "command", label="Import adjacency matrix",
-        command=function() .tkigraph.import.adjacency())
-  tkadd(graph.menu, "command", label="Import edge list",
-        command=function() .tkigraph.import.edgelist())
-  tkadd(graph.menu, "command", label="Import Pajek file",
-        command=function() .tkigraph.import.pajek())
-  tkadd(graph.menu, "command", label="Export adjacency matrix",
-        command=function() .tkigraph.export.adjacency())
-  tkadd(graph.menu, "command", label="Export edge list",
-        command=function() .tkigraph.export.edgelist())
-  tkadd(graph.menu, "command", label="Export Pajek file",
-        command=function() .tkigraph.export.pajek())
-  tkadd(main.menu, "cascade", label="Graph", menu=graph.menu)
-
-  plot.menu <- tkmenu(main.menu)
-  tkadd(plot.menu, "command", label="Simple", command=function() {
-    .tkigraph.plot(simple=TRUE)
-  })
-  tkadd(plot.menu, "command", label="Advanced", command=function() {
-    .tkigraph.plot(simple=FALSE)
-  })
-  tkadd(main.menu, "cascade", label="Draw", menu=plot.menu)
-  
-  centrality.menu <- tkmenu(main.menu)
-  tkadd(centrality.menu, "command", label="Degree (out)", command=function() {
-    .tkigraph.degree("out")
-  })
-  tkadd(centrality.menu, "command", label="Degree (in)", command=function() {
-    .tkigraph.degree("in")
-  })
-  tkadd(centrality.menu, "command", label="Degree (total)",
-        command=function() {
-          .tkigraph.degree("total")
-        })
-  tkadd(centrality.menu, "command", label="Plot log-log degree distribution",
-        command=function() {
-          .tkigraph.degree.dist(power=FALSE)
-        })
-  tkadd(centrality.menu, "command", label="Fit a power-law to degree distribution",
-        command=function() {
-          .tkigraph.degree.dist(power=TRUE)
-        })
-  tkadd(centrality.menu, "separator")
-  tkadd(centrality.menu, "command", label="Closeness", command=function() {
-    .tkigraph.closeness()
-  })
-  tkadd(centrality.menu, "command", label="Betweenness", command=function() {
-    .tkigraph.betweenness()
-  })
-  tkadd(centrality.menu, "command", label="Burt's constraint", command=function() {
-    .tkigraph.constraints()
-  })
-  tkadd(centrality.menu, "command", label="Page rank", command=function() {
-    .tkigraph.page.rank()
-  })
-  tkadd(centrality.menu, "separator")  
-  tkadd(centrality.menu, "command", label="Edge betweenness",
-        command=function() {
-          .tkigraph.edge.betweenness()
-        })
-  tkadd(main.menu, "cascade", label="Centrality", menu=centrality.menu)
-
-  distances.menu <- tkmenu(main.menu)
-  tkadd(distances.menu, "command", label="Distance matrix",
-        command=function() { .tkigraph.dist.matrix() })
-  tkadd(distances.menu, "command", label="Distances from/to vertex",
-        command=function() { .tkigraph.distance.tofrom() })
-  tkadd(distances.menu, "command", label="Diameter (undirected)",
-        command=function() { .tkigraph.diameter() })
-  tkadd(distances.menu, "command", label="Draw diameter",
-        command=function() { .tkigraph.plot.diameter(simple=FALSE) })
-  tkadd(distances.menu, "command", label="Average path length (undirected)",
-        command=function() { .tkigraph.diameter(mode="path") })
-  tkadd(main.menu, "cascade", label="Distances", menu=distances.menu)
-
-  component.menu <- tkmenu(main.menu)
-  tkadd(component.menu, "command", label="Show components",
-        command=function() { .tkigraph.clusters() })
-  tkadd(component.menu, "command", label="Show membership",
-        command=function() { .tkigraph.clusters.membership() })
-  tkadd(component.menu, "command", label="Calculate component sizes",
-        command=function() { .tkigraph.calculate.clusters() })
-  tkadd(component.menu, "command", label="Draw components",
-        command=function() { .tkigraph.plot.comp(simple=FALSE) })
-  tkadd(component.menu, "command", label="Create graph from giant component",
-        command=function() { .tkigraph.create.giantcomp() })
-  tkadd(component.menu, "command", label="Create graph from component of a vertex",
-        command=function() { .tkigraph.create.mycomp() })
-  tkadd(component.menu, "command", label="Create graph from a component",
-        command=function() { .tkigraph.create.comp() })
-
-  community.menu <- tkmenu(main.menu)
-  tkadd(community.menu, "command", label="Spinglass algorithm",
-        command=function() { .tkigraph.spinglass() })
-  tkadd(community.menu, "command", label="Spinglass algorithm, single vertex",
-        command=function() { .tkigraph.my.spinglass() })
-
-  cohesion.menu <- tkmenu(main.menu)
-  tkadd(cohesion.menu, "command", label="Cohesion of all components",
-        command=function() { .tkigraph.cohesion() })
-  
-  subgraph.menu <- tkmenu(main.menu)
-  tkadd(subgraph.menu, "cascade", label="Components", menu=component.menu)
-  tkadd(subgraph.menu, "cascade", label="Communities", menu=community.menu)
-  tkadd(subgraph.menu, "cascade", label="Cohesion", menu=cohesion.menu)
-  
-  tkadd(main.menu, "cascade", label="Subgraphs", menu=subgraph.menu)
-  
-  motif.menu <- tkmenu(main.menu)
-  tkadd(motif.menu, "command", label="Draw motifs", command=function() {
-    .tkigraph.motifs.draw()
-  })
-  tkadd(motif.menu, "command", label="Find motifs", command=function() {
-    .tkigraph.motifs.find()
-  })
-  tkadd(main.menu, "cascade", label="Motifs", menu=motif.menu)
-
-  help.menu <- tkmenu(main.menu)
-  tkadd(help.menu, "command", label="Contents", command=function() { .tkigraph.help() })
-  tkadd(help.menu, "command", label="In external browser",
-        command=function() { .tkigraph.help.external() })
-  tkadd(help.menu, "separator")
-  tkadd(help.menu, "command", label="About", command=function() { .tkigraph.about() })
-  tkadd(main.menu, "cascade", label="Help", menu=help.menu)
-  
-  tkadd(main.menu, "command", label="Quit", command=.tkigraph.close)
-  
-  tkconfigure(top, "-menu", main.menu)
-
-  # Set up the main area
-  tkgrid(tklabel(top, text=""),
-         tklabel(top, text="#", justify="center", relief="raised"),
-         tklabel(top, text="Name", width=50, relief="raised",
-                 justify="left"),
-         tklabel(top, text="|V|", width=6, relief="raised",
-                 justify="left"),
-         tklabel(top, text="|E|", width=6, relief="raised",
-                 justify="left"),
-         tklabel(top, text="Dir.", width=6, relief="raised",
-                 justify="left"),
-         sticky="nsew", "in"=topframe)
-  tkgrid.columnconfigure(topframe, 2, weight=1)
-
-  invisible(NULL)
-}
-
-.tkigraph.close <- function() {
-  message <- "Are you sure?"
-  yesno <- tkmessageBox(message=message, icon="question", type="yesno",
-                        default="yes")
-  if (as.character(yesno) == "no") { return() }
-  top <- get("top", .tkigraph.env)
-  tkbind(top, "<Destroy>", "")
-  tkdestroy(top)
-  rm(list=ls(envir=.tkigraph.env), envir=.tkigraph.env)
-}
-
-.tkigraph.get.selected <- function() {
-  gnos <- get("selected", .tkigraph.env)
-  which(as.logical(sapply(gnos, tclvalue)))
-}
-
-.tkigraph.error <- function(message) {
-  tkmessageBox(message=message, icon="error", type="ok")
-}
-
-.tkigraph.warning <- function(message) {
-  tkmessageBox(message=message, icon="warning", type="ok")
-}
-
-.tkigraph.dialogbox <- function(TITLE="Setup parameters", ...) {
-  
-  params <- list(...)
-  answers <- lapply(params, "[[", "default")
-  dialog <- tktoplevel()
-  frame <- tkframe(dialog)
-  tkgrid(frame)
-  tktitle(dialog) <- TITLE
-  vars <- lapply(answers, tclVar)
-  retval <- list()
-  widgets <- list()
-
-  OnOK <- function() {
-    retval <<- lapply(vars, tclvalue)
-    for (i in seq(along=params)) {
-      if (params[[i]]$type == "listbox") {
-        retval[[i]] <<- as.numeric(tclvalue(tkcurselection(widgets[[i]])))
-      }
-    }
-    tkdestroy(dialog)    
-  }
-
-  tkgrid(tklabel(dialog, text=TITLE,
-                 font=tkfont.create(family="times", size="16", weight="bold")),
-         columnspan=2, sticky="nsew", "in"=frame, padx=10, pady=10)
-  
-  OK.but <- tkbutton(dialog, text="   OK    ", command=OnOK)
-  for (i in seq(along=params)) {
-    tkgrid(tklabel(dialog, text=params[[i]]$name),
-           column=0, row=i, sticky="nw", padx=10, "in"=frame)
-    if (params[[i]]$type == "numeric" || params[[i]]$type == "text") {
-      tmp <- tkentry(dialog, width="10", textvariable=vars[[i]])
-      tkgrid(tmp, column=1, row=i, sticky="nsew", padx=10, "in"=frame)
-      tkbind(tmp, "<Return>", OnOK)
-    } else if (params[[i]]$type == "boolean") {
-      b <- tkcheckbutton(dialog, onvalue="TRUE", offvalue="FALSE",
-                           variable=vars[[i]])
-      if (params[[i]]$default == "TRUE") { tkselect(b) }
-      tkgrid(b, column=1, row=i, sticky="w", padx=10, "in"=frame)
-    } else if (params[[i]]$type == "listbox") {
-      f <- tkframe(dialog)
-      tkgrid(f, "in"=frame, padx=10, sticky="nsew", column=1, row=i)
-      scr <- tkscrollbar(f, repeatinterval=5)
-      fun <- eval(eval(substitute(expression(function(...) tkset(scr,...)),
-                                  list(scr=scr))))
-      lb <- tklistbox(f, selectmode="single", exportselection=FALSE,
-                      height=3, yscrollcommand=fun)
-      fun <- eval(eval(substitute(expression(function(...) tkyview(lb, ...)),
-          list(lb=lb))))
-      tkconfigure(scr, "-command", fun)
-      tkselection.set(lb, as.numeric(params[[i]]$default)+1)
-      lapply(params[[i]]$values, function(l) tkinsert(lb, "end", l))
-      tkselection.set(lb, as.numeric(params[[i]]$default))
-      tkgrid(lb, scr, sticky="nsew", "in"=f)
-      tkgrid.configure(scr, sticky="nsw")
-      tkgrid.columnconfigure(f, 0, weight=1)
-      widgets[[i]] <- lb
-    }
-  }
-  tkgrid(OK.but, column=0, columnspan=2, sticky="nsew", "in"=frame, pady=10,
-         padx=10)
-  tkgrid.columnconfigure(frame, 1, weight=1)
-  tkwait.window(dialog)
-
-  for (i in seq(retval)) {
-    if (params[[i]]$type == "numeric") {
-      retval[[i]] <- eval(parse(text=retval[[i]]))
-    } else if (params[[i]]$type == "text") {
-      retval[[i]] <- eval(retval[[i]])
-    } else if (params[[i]]$type == "boolean") {
-      if (retval[[i]] == "FALSE") {
-        retval[[i]] <- FALSE
-      } else {
-        retval[[i]] <- TRUE
-      }
-    } else if (params[[i]]$type == "listbox") {
-      ## nothing to do
-    }
-  }
-  names(retval) <- names(params)
-  return (retval)  
-}
-
-.tkigraph.add.graph <- function(g) {
-  top <- get("top", .tkigraph.env)
-  topframe <- get("topframe", .tkigraph.env)
-
-  ## add 'name' attribute if not present
-  if (!"name" %in% list.vertex.attributes(g)) {
-    V(g)$name <- as.integer(seq(vcount(g)))
-  }
-  if (!"name" %in% list.edge.attributes(g)) {
-    E(g)$name <- as.integer(seq(ecount(g)))
-  }
-  
-  graphs <- get("graphs", .tkigraph.env)
-  selected <- get("selected", .tkigraph.env)
-  assign("graphs", append(graphs, list(g)), .tkigraph.env)
-  no <- length(graphs)+1
-
-  selected[[no]] <- tclVar("FALSE")
-  assign("selected", selected, .tkigraph.env)
-
-  name <- get.graph.attribute(g, "name")
-  tmpvar <- tclVar(as.character(name))
-  but <- tkcheckbutton(top, onvalue="TRUE", offvalue="FALSE",
-                       variable=selected[[no]])
-  lab <- tklabel(top, text=as.character(no), width=2)
-  ent <- tkentry(top, width=30, textvariable=tmpvar)
-  lab2 <- tklabel(top, text=as.character(vcount(g)),
-                  justify="right", padx=2)
-  lab3 <- tklabel(top, text=as.character(ecount(g)), justify="right",
-                  padx=2)
-  lab4 <- tklabel(top, text=if (is.directed(g)) "YES" else "NO")
-  tkgrid(but, lab, ent, lab2, lab3, lab4, "in"=topframe, sticky="nsew")
-
-  tklines <- get("tklines", .tkigraph.env)
-  tklines[[no]] <- list(but, lab, ent, lab2, lab3, lab4)
-  assign("tklines", tklines, .tkigraph.env)
-}
-
-.tkigraph.delete <- function() {
-  gnos <- .tkigraph.get.selected()  
-
-  if (length(gnos) == 0) { return() }
-  if (length(gnos) > 1) {
-    message <- paste("Are you sure to delete", length(gnos), "graphs?")
-  } else {
-    message <- paste("Are you sure to delete graph #", gnos, "?")
-  }
-  yesno <- tkmessageBox(message=message, icon="question", type="yesno",
-                        default="yes")
-  if (as.character(yesno) == "no") { return() }
-
-  ## remove from the screen
-  graphs <- get("graphs", .tkigraph.env)
-  topframe <- get("topframe", .tkigraph.env)
-  todel <- get("tklines", .tkigraph.env)[gnos]
-  todel <- unlist(recursive=FALSE, todel)
-  for (i in todel) {
-    tkgrid.remove(topframe, i)
-  }
-  ## delete the graphs
-  graphs[gnos] <- NA
-  assign("graphs", graphs, .tkigraph.env)
-  selected <- get("selected", .tkigraph.env)
-  for (i in gnos) { 
-    selected[[i]] <- tclVar("FALSE")
-  }
-  assign("selected", selected, .tkigraph.env)
-}
-
-.tkigraph.load <- function() {
-  filename <- tkgetOpenFile(defaultextension="Rdata",
-                            title="Load graphs")
-  env <- new.env()
-  load(paste(as.character(filename), collapse=" "), envir=env)
-  .tkigraph.graphs <- get("graphs", envir=env) 
-  for (i in seq(.tkigraph.graphs)) {
-    .tkigraph.add.graph(.tkigraph.graphs[[i]])
-  }
-  if (".tkigraph.graphs" %in% ls(all.names=TRUE)) {
-    rm(.tkigraph.graphs)
-  }
-}
-
-.tkigraph.load.online <- function() {
-  ## TODO
-}
-
-.tkigraph.save <- function() {
-  graphs <- get("graphs", .tkigraph.env)
-  topframe <- get("topframe", .tkigraph.env)
-  for (i in seq(graphs)) {
-    if (is.na(graphs)[i]) { next }
-    entry <- tkgrid.slaves(topframe, row=i, col=2)
-    graphs[[i]] <- set.graph.attribute(graphs[[i]], "name",
-                                       as.character(tcl(entry, "get")))
-  }
-  graphs <- graphs[ !is.na(graphs) ]
-  filename <- tkgetSaveFile(initialfile="graphs.Rdata",
-                            defaultextension="Rdata",
-                            title="Save graphs")
-  save(graphs, file=paste(as.character(filename), collapse=" "))
-}
-
-.tkigraph.import.adjacency <- function() {
-  filename <- tkgetOpenFile(defaultextension="adj",
-                            title="Import adjacency matrix")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  tab <- read.table(filename)
-  tab <- as.matrix(tab)
-  if (ncol(tab) != nrow(tab)) {
-    .tkigraph.error("Cannot interpret as adjacency matrix")
-    return()
-  }
-  dir <- if (all(t(tab)==tab)) "undirected" else "directed"
-  if (all(unique(tab) %in% c(0,1))) {
-    weighted <- NULL
-  } else {
-    weighted <- "weight"
-  }
-  g <- .tkigraph.graph.adjacency(tab, mode=dir, weighted=weighted)
-  g <- set.graph.attribute(g, "name", "Imported adjacency matrix")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.graph.adjacency <- function(adjmatrix, mode, weighted) {
-  if (is.null(weighted)) {
-    g <- graph.adjacency(adjmatrix, mode=mode)
-  } else {
-    ## there is bug in the currect igraph version, this is a workaround
-    if (mode=="undirected") {
-      adjmatrix[ lower.tri(adjmatrix) ] <- 0
-    }
-    g <- graph.adjacency(adjmatrix, mode=mode, weighted=weighted)
-  }
-  g
-}
-
-.tkigraph.import.edgelist <- function() {
-  filename <- tkgetOpenFile(defaultextension="el",
-                            title="Import edge list")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  tab <- read.table(filename,
-                    colClasses="character")
-  cn <- rep("", ncol(tab))
-  if (ncol(tab)>=3) { cn[3] <- "weight" }
-  colnames(tab) <- cn
-  read <- .tkigraph.dialogbox(TITLE="Importing an edge list",
-                              directed=list(name="Directed", type="boolean",
-                                default="FALSE"))
-  g <- graph.data.frame(tab, directed=read$directed)
-  g <- set.graph.attribute(g, "name", "Imported edge list")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.import.pajek <- function() {
-  filename <- tkgetOpenFile(defaultextension="net",
-                            title="Import Pajek file")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  g <- read.graph(file=filename, format="pajek")
-  color <- NULL # To eliminate a check NOTE
-  if ("color" %in% list.vertex.attributes(g)) { V(g)[ color=="" ]$color <- "black" }
-  if ("color" %in% list.edge.attributes(g)) { E(g)[ color=="" ]$color <- "black" }
-  g <- set.graph.attribute(g, "name", "Imported Pajek fie")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.export.adjacency <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  if ("weight" %in% list.graph.attributes(graph)) {
-    tab <- get.adjacency(graph, attr="weight", names=FALSE, sparse=FALSE)
-  } else {
-    tab <- get.adjacency(graph, names=FALSE, sparse=FALSE)
-  }
-  filename <- tkgetSaveFile(initialfile="graph.adj",
-                            defaultextension="adj",
-                            title="Export adjacency matrix")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  write.table(tab, file=filename, row.names=FALSE, col.names=FALSE)
-}
-
-.tkigraph.export.edgelist <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  el <- get.edgelist(graph)
-  if ("weight" %in% list.edge.attributes(graph)) {
-    el <- cbind(el, E(graph)$weight)
-  }
-  filename <- tkgetSaveFile(initialfile="graph.el",
-                            defaultextension="el",
-                            title="Export edge list")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  write.table(el, file=filename,
-              row.names=FALSE, col.names=FALSE)
-}
-
-.tkigraph.export.pajek <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  filename <- tkgetSaveFile(initialfile="pajek.net",
-                            defaultextension="net",
-                            title="Export Pajek file")
-  filename <- paste(as.character(filename), collapse=" ")
-  if (filename=="") { return() }
-  write.graph(graph, file=filename, format="pajek")
-}
-
-.tkigraph.show <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  el <- get.edgelist(graphs[[gnos]])
-  el <- data.frame(from=el[,1], to=el[,2])
-#  if (any(V(graphs[[gnos]])$name != seq(length=vcount(graphs[[gnos]])))) {
-#    el2 <- get.edgelist(graphs[[gnos]], names=FALSE)
-#    el <- cbind(el, el2)
-#  }
-  if ("weight" %in% list.edge.attributes(graphs[[gnos]])) {
-    el <- cbind(el, value=E(graphs[[gnos]])$weight)
-  }
-
-  .tkigraph.showData(el, title=paste(sep="", "Graph #", gnos), right=FALSE)
-}
-
-.tkigraph.stat <- function() {
-  gnos <- .tkigraph.get.selected()
-
-  if (length(gnos) == 0) {
-    .tkigraph.error("Please select some graphs")
-    return()
-  }
-
-  read <- .tkigraph.dialogbox(TITLE="Choose statistics",
-                              vertices=list(name="Vertices", type="boolean",
-                                default="FALSE"),
-                              edges=list(name="Edges", type="boolean",
-                                default="FALSE"),
-                              recip=list(name="Reciprocity", type="boolean",
-                                default="FALSE"),
-                              dens=list(name="Density", type="boolean",
-                                default="FALSE"),
-                              trans=list(name="Transitivity (global)",
-                                type="boolean", default="FALSE"),
-                              ltrans=list(name="Mean local transitivity",
-                                type="boolean", default="FALSE"),
-                              deg=list(name="Average degree",
-                                type="boolean", default="FALSE"),
-                              maxdeg=list(name="Maximum degree (total)",
-                                type="boolean", default="FALSE"),
-                              maxindeg=list(name="Maximum degree (in)",
-                                type="boolean", default="FALSE"),
-                              maxoutdeg=list(name="Maximum degree (out)",
-                                type="boolean", default="FALSE"),
-                              mindeg=list(name="Minimum degree (total)",
-                                type="boolean", default="FALSE"),
-                              minindeg=list(name="Minimum degree (in)",
-                                type="boolean", default="FALSE"),
-                              minoutdeg=list(name="Minimum degree (out)",
-                                type="boolean", default="FALSE")
-                              )
-  
-  graphs <- get("graphs", .tkigraph.env)[gnos]
-
-  v <- e <- recip <- dens <- trans <- ltrans <- 
-    deg <- maxdeg <- maxindeg <- maxoutdeg <-
-      mindeg <- minindeg <- minoutdeg <- numeric()
-  for (i in seq(along=gnos)) {
-    if (read$vertices) {
-      v[i] <- vcount( graphs[[ i ]] )
-    }
-    if (read$edges) {
-      e[i] <- ecount( graphs[[ i ]] )
-    }
-    if (read$recip) {
-      recip[i] <- reciprocity( graphs[[ i ]] )
-    }
-    if (read$dens) {
-      dens[i] <- graph.density( graphs[[ i ]] )
-    }
-    if (read$trans) {
-      trans[i] <- transitivity( graphs[[ i ]], type="global")
-    }
-    if (read$ltrans) {
-      ltrans[i] <- transitivity( graphs[[ i ]], type="localaverage")
-    }
-    if (read$deg) {
-      deg[i] <- mean(degree( graphs[[ i ]], mode="total"))
-    }
-    if (read$maxdeg) {
-      maxdeg[i] <- max(degree( graphs[[ i ]], mode="total"))
-    }
-    if (read$maxindeg) {
-      maxindeg[i] <- max(degree( graphs[[ i ]], mode="in"))
-    }
-    if (read$maxoutdeg) {
-      maxoutdeg[i] <- max(degree( graphs[[ i ]], mode="out"))
-    }
-    if (read$mindeg) {
-      mindeg[i] <- min(degree( graphs[[ i ]], mode="total"))
-    }
-    if (read$minindeg) {
-      minindeg[i] <- min(degree( graphs[[ i ]], mode="in"))
-    }
-    if (read$minoutdeg) {
-      minoutdeg[i] <- min(degree( graphs[[ i ]], mode="out"))
-    }
-  }
-
-  value <- numeric()
-  cn <- character()
-  if (read$vertices) {
-    value <- cbind(value, v)
-    cn <- c(cn, "Vertices")
-  }
-  if (read$edges) {
-    value <- cbind(value, e)
-    cn <- c(cn, "Edges")
-  }
-  if (read$recip) {
-    value <- cbind(value, recip)
-    cn <- c(cn, "Reciprocity")
-  }
-  if (read$dens) {
-    value <- cbind(value, dens)
-    cn <- c(cn, "Density")
-  }
-  if (read$trans) {
-    value <- cbind(value, trans)
-    cn <- c(cn, "Transitivity")
-  }
-  if (read$ltrans) {
-    value <- cbind(value, ltrans)
-    cn <- c(cn, "Local trans.")
-  }
-  if (read$deg) {
-    value <- cbind(value, deg)
-    cn <- c(cn, "Mean degree")
-  }
-  if (read$maxdeg) {
-    value <- cbind(value, maxdeg)
-    cn <- c(cn, "Max. degree")
-  }
-  if (read$maxindeg) {
-    value <- cbind(value, maxindeg)
-    cn <- c(cn, "Max. in-deg.")
-  }
-  if (read$maxoutdeg) {
-    value <- cbind(value, maxoutdeg)
-    cn <- c(cn, "Max. out-deg.")
-  }
-  if (read$mindeg) {
-    value <- cbind(value, mindeg)
-    cn <- c(cn, "Min. deg.")
-  }
-  if (read$minindeg) {
-    value <- cbind(value, minindeg)
-    cn <- c(cn, "Min. in-deg.")
-  }
-  if (read$minoutdeg) {
-    value <- cbind(value, minoutdeg)
-    cn <- c(cn, "Min. out-deg.")
-  }
-
-  value <- t(value)
-  rownames(value) <- cn
-  colnames(value) <- gnos
-  .tkigraph.showData(value, title="Graphs properties", sort.button=FALSE)  
-}
-
-.tkigraph.plot <- function(simple=TRUE, gnos=NULL, ...) {
-
-  if (is.null(gnos)) {
-    gnos <- .tkigraph.get.selected()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-
-  if (length(gnos)==0) {
-    return (.tkigraph.error("Please select one or more graphs to draw."))
-  }
-
-  max.vcount <- max(sapply(graphs[gnos], vcount))
-  if (max.vcount > 5000) {
-    vertex.size <- 1
-  } else if (max.vcount > 30) {
-    vertex.size <- 3
-  } else {
-    vertex.size <- 15
-  }
-
-  if (!simple) {
-    read <- .tkigraph.dialogbox(TITLE="Drawing graphs",
-                                interactive=list(name="Interactive",
-                                  type="boolean", default="FALSE"),
-                                vertex.size=list(name="Vertex size",
-                                  type="numeric", default=vertex.size),
-                                labels=list(name="Vertex labels", type="listbox",
-                                  default="3", values=c("None", "IDs", "Names",
-                                                 "Labels")),
-                                elabels=list(name="Edge labels", type="listbox",
-                                  default="0", values=c("None", "IDs", "Names",
-                                                 "Values")),
-                                layout=list(name="Layout",
-                                  type="listbox", default="0",
-                                  values=c("Default", "Force-based (KK)",
-                                    "Force-based (FR)", "Tree (RT)",
-                                    "Circle", "Random")))
-  } else {
-    read <- list(interactive=FALSE,
-                 vertex.size=vertex.size,
-                 labels=3,              # labels
-                 elabels=0,             # none
-                 layout=0)
-  }
-    
-  if (!read$interactive) {
-    fun <- function(...) { dev.new() ; plot.igraph(...) }
-  } else {
-    fun <- tkplot
-  }
-  
-  layout.default <- function(graph, layout.par) {
-    if ("x" %in% list.vertex.attributes(graph) &&
-        "y" %in% list.vertex.attributes(graph)) {
-      cbind( V(graph)$x , V(graph)$y )
-    } else if ("layout" %in% list.graph.attributes(graph)) {
-      l <- get.graph.attribute(graph, "layout")
-      if (is.function(l)) {
-        l(graph)
-      } else {
-        l
-      }
-    } else if (vcount(graph) < 300 && is.connected(graph)) {
-      layout.kamada.kawai(graph)
-    } else if (vcount(graph) < 1000) {
-      layout.fruchterman.reingold(graph)
-    } else {
-      layout.circle(graph)
-    }
-  }
-  
-  layouts <- list(layout.default, layout.kamada.kawai,
-                  layout.fruchterman.reingold,
-                  layout.reingold.tilford, layout.circle, layout.random)
-
-  if (read$vertex.size < 10) {
-    label.dist <- 0.4
-  } else {
-    label.dist <- 0
-  }
-  
-  for (i in gnos) {
-
-    if (read$labels == "0") {
-      labels <- NA
-    } else if (read$labels == "1") {
-      labels <- seq(vcount(graphs[[i]]))
-    } else if (read$labels == "2") {
-      labels <- V(graphs[[i]])$name
-    } else if (read$labels == "3") {
-      if ("label" %in% list.vertex.attributes(graphs[[i]])) {
-        labels <- V(graphs[[i]])$label
-      } else {
-        labels <- V(graphs[[i]])$name
-      }
-    }
-
-    if (read$elabels == "0") {
-      elabels <- NA
-    } else if (read$labels == "1") {
-      elabels <- seq(ecount(graphs[[i]]))
-    } else if (read$labels == "2") {
-      elabels <- E(graphs[[i]])$name
-    } else if (read$labels == "3") {
-      if ("weight" %in% list.edge.attributes(graphs[[i]])) {
-        elabels <- E(graphs[[i]])$weight
-      } else {
-        .tkigraph.warning("No edge weights, not a valued graph");
-        elabels <- NA
-      }
-    }    
-
-    if (vcount(graphs[[i]]) > 10) {
-      eas <- 0.5
-    } else {
-      eas <- 1
-    }
-    
-    g <- graphs[[i]]
-    g <- remove.vertex.attribute(g, "name")
-    fun(g, layout=layouts[[ read$layout+1 ]],
-        vertex.size=read$vertex.size, ## vertex.color=read$vertex.color,
-        vertex.label=labels, vertex.label.dist=label.dist,
-        edge.label=elabels, edge.arrow.size=eas,
-        ...)
-  }
-}
-
-.tkigraph.by.hand <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) > 1) {
-    .tkigraph.error("Please select zero or one graph")
-    return()
-  }
-
-  if (length(gnos)==0) {
-    newdf <- edit(data.frame(list(from=character(), to=character())))
-    if (ncol(newdf) > 2) {
-      colnames(newdf) <- c("from", "to", "weight")
-    }
-    read <- .tkigraph.dialogbox(TITLE="Creating a graph by hand",
-                                directed=list(name="Directed", type="boolean",
-                                  default="FALSE"))
-    g <- graph.data.frame(newdf, directed=read$directed)
-    g <- set.graph.attribute(g, "name", "New graph")
-    .tkigraph.add.graph(g)
-  } else {
-    graphs <- get("graphs", .tkigraph.env)
-    df <- get.edgelist(graphs[[gnos]])
-    colnames <- c("from", "to")    
-    if ("weight" %in% list.edge.attributes(graphs[[gnos]])) {
-      df <- cbind(df, E(g)$weight)
-      colnames <- c("from", "to", "weight")
-    }
-    df <- as.data.frame(df)
-        
-    colnames(df) <- colnames
-    df <- edit(df)
-    if (ncol(df) > 2) {
-      colnames(df) <- c("from", "to", "weight")
-    }
-    graphs[[gnos]] <- graph.data.frame(df,
-                                       directed=is.directed(graphs[[gnos]]))
-    assign("graphs", graphs, .tkigraph.env)
-  }
-  invisible(NULL)
-}
-
-.tkigraph.tree <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Regular tree",
-                              n=list(name="Vertices", type="numeric",
-                                default=63, min=0),
-                              b=list(name="Branches", type="numeric",
-                                default=2, min=1),
-                              mode=list(name="Mode", type="listbox",
-                                values=c("Directed (out)", "Directed (in)",
-                                  "Undirected"), default="2"))
-  read$mode <- c("out", "in", "undirected")[read$mode+1]
-  g <- graph.tree(n=read$n, children=read$b, mode=read$mode)
-  lay <- layout.reingold.tilford(g, root=1, mode="all")
-  g <- set.graph.attribute(g, "layout", lay)
-  g <- set.graph.attribute(g, "name", "Regular tree")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.ring <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Regular ring",
-                              n=list(name="Vertices", type="numeric",
-                                default=100, min=0))
-  g <- graph.ring(n=read$n)
-  g <- set.graph.attribute(g, "layout", layout.circle)
-  g <- set.graph.attribute(g, "name", "Regular ring")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.lattice <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Regular lattice",
-                              dim=list(name="Dimensions", type="numeric",
-                                default=2, min=1, max=5),
-                              s1=list(name="Size 1", type="numeric",
-                                default=10, min=1),
-                              s2=list(name="Size 2", type="numeric",
-                                default=10, min=1),
-                              s3=list(name="Size 3", type="numeric",
-                                default=10, min=1),
-                              s4=list(name="Size 4", type="numeric",
-                                default=10, min=1),
-                              s5=list(name="Size 5", type="numeric",
-                                default=10, min=1))
-  if (read$dim > 5) { read$dim <- 5 }
-  dimv <- c(read$s1, read$s2, read$s3, read$s4, read$s5)[1:read$dim]
-  g <- graph.lattice(dimvector=dimv)
-  g <- set.graph.attribute(g, "name", "Regular Lattice")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.star <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Star graph",
-                              n=list(name="Vertices", type="numeric",
-                                default=100, min=0),
-                              mode=list(name="Mode", type="listbox",
-                                values=c("Directed (out)", "Directed (in)",
-                                  "Undirected"), default="2"))
-  read$mode <- c("out", "in", "undirected")[read$mode+1]
-  g <- graph.star(read$n, mode=read$mode)
-  g <- set.graph.attribute(g, "name", "Star graph")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.full <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Full graph",
-                              n=list(name="Vertices", type="numeric",
-                                default=30, min=0),
-                              directed=list(name="Directed", type="boolean",
-                                default="FALSE"),
-                              loops=list(name="Loops", type="boolean",
-                                default="FALSE"))
-  g <- graph.full(read$n, read$directed, read$loops)
-  g <- set.graph.attribute(g, "name", "Full graph")
-  .tkigraph.add.graph(g)
-}                             
-
-.tkigraph.atlas <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Graph Atlas",
-                              n=list(name="Number", type="numeric",
-                                default=sample(0:1252, 1), min=0, max=1252))
-  g <- graph.atlas(read$n)
-  g <- set.graph.attribute(g, "name",
-                           paste("Graph Atlas #", read$n))
-  .tkigraph.add.graph(g)
-}
-  
-.tkigraph.erdos.renyi.game <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Erdos-Renyi random graph, G(n,p)",
-                              n=list(name="Vertices", type="numeric",
-                                default=100, min=0),
-                              p=list(name="Connection probability",
-                                type="numeric", default=0.02, min=0, max=1),
-                              directed=list(name="Directed",
-                                type="boolean", default="FALSE"))
-  
-  g <- erdos.renyi.game(read$n,read$p,directed=read$directed)
-  g <- set.graph.attribute(g, "name", "Random graph (Erdos-Renyi G(n,p))")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.erdos.renyi.gnm.game <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Erdos-Renyi random graph, G(n,m)",
-                              n=list(name="Vertices", type="numeric",
-                                default=100, min=0),
-                              m=list(name="Edges", type="numeric",
-                                default=200, min=0),
-                              directed=list(name="Directed",
-                                type="boolean", default="FALSE"))
-
-  g <- erdos.renyi.game(read$n, read$m, type="gnm", directed=read$directed)
-  g <- set.graph.attribute(g, "name", "Random graph (Erdos-Renyi G(n,m))")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.barabasi.game <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Scale Free graph",
-                              n=list(name="Vertices", type="numeric",
-                                default=100, min=0),
-                              m=list(name="Edges per time step",
-                                type="numeric", default=1, min=0),
-                              directed=list(name="Directed",
-                                type="boolean", default="TRUE"))
-  g <- barabasi.game(n=read$n, m=read$m, directed=read$directed)
-  g <- set.graph.attribute(g, "name", "Scale-free random graph")
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.degree.sequence.game <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) == 0) {
-    .tkigraph.error("Please select at least one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-
-  for (i in gnos) {
-    if (is.directed(graphs[[i]])) {
-      indeg <- degree(graphs[[i]], mode="in")
-      outdeg <- degree(graphs[[i]], mode="out")
-      g <- degree.sequence.game(out.deg=outdeg, in.deg=indeg)
-    } else {
-      deg <- degree(graphs[[i]])
-      g <- degree.sequence.game(deg)
-    }
-    g <- set.graph.attribute(g, "name",
-                             paste(sep="", "Configuration model (#", i,")"))
-    .tkigraph.add.graph(g)
-  }
-}
-
-.tkigraph.watts.strogatz <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Watts-Strogatz graph",
-                              dim=list(name="Dimensions", type="numeric",
-                                default=1, min=1),
-                              size=list(name="Lattice size", type="numeric",
-                                default=1000, min=1),
-                              nei=list(name="Neighborhood", type="numeric",
-                                default=5, min=1),
-                              p=list(name="Rewiring probability",
-                                type="numeric", default=0.01, min=0, max=1))
-  g <- watts.strogatz.game(dim=read$dim, size=read$size, nei=read$nei,
-                           p=read$p)
-  g <- set.graph.attribute(g, "name", "Watts-Strogatz small-world graph")
-  if (read$dim == 1) { 
-    g <- set.graph.attribute(g, "layout", layout.circle)
-  }
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.simplify <- function() {
-  gnos <- .tkigraph.get.selected()
-  graphs <- get("graphs", .tkigraph.env)
-
-  for (i in gnos) {
-    g <- simplify(graphs[[i]])
-    g <- set.graph.attribute(g, "name",
-                             paste(sep="", "Simplification of #", i))
-    .tkigraph.add.graph(g)
-  }
-}
-
-#####################################################
-
-.tkigraph.degree <- function(mode) {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  deg <- degree(graphs[[gnos]], mode=mode)
-  value <- data.frame(Vertex=V(graphs[[gnos]])$name, deg)
-  colnames(value) <- c("Vertex", paste(sep="","Degree (", mode, ")"))
-  plot.command <- function() {
-    read <- .tkigraph.dialogbox(TITLE="Plot degree distribution",
-                                logx=list(name="Logarithmic `X' axis",
-                                  type="boolean", default="FALSE"),
-                                logy=list(name="Logarithmic `Y' axis",
-                                  type="boolean", default="FALSE"),
-                                hist=list(name="Histogram",
-                                  type="boolean", default="FALSE"))
-
-    if (!read$hist) {
-      h <- hist(value[,2], -1:max(value[,2]), plot=FALSE)$density  
-      log <- ""
-      if (read$logx) { log <- paste(sep="", log, "x") }
-      if (read$logy) { log <- paste(sep="", log, "y") }
-      dev.new()
-      plot(0:max(value[,2]), h, xlab="Degree", ylab="Relative frequency",
-           type="b", main="Degree distribution", log=log)
-    } else {
-      dev.new()
-      hist(value[,2], main="Degree distribution", xlab="Degree")
-    }
-  }
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean degree:", round(mean(deg), 2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Degree for graph #", gnos),
-                     plot.text="Plot distribution",
-                     plot.command=plot.command,
-                     showmean=mv)
-}
-
-.tkigraph.degree.dist <- function(power=FALSE) {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  read <- .tkigraph.dialogbox(TITLE="Choose degree type",
-                              type=list(name="Degree type",
-                                type="listbox", default="0",
-                                values=c("Out", "In", "Total")))
-  mode <- c("out", "in", "all")[read$type+1]
-  deg <- degree(graphs[[gnos]], mode=mode)
-  dev.new()
-  h <- hist(deg, -1:max(deg), plot=FALSE)$density
-  plot(0:max(deg), h, xlab="Degree", ylab="Relative frequency",
-       type="b", main="Degree distribution", log="xy")
-
-  if (power) {
-    if (max(deg)<10) {
-      .tkigraph.error("Degrees are too small for a power-law fit")
-      return()
-    }
-    fit <- power.law.fit(deg, xmin=10)
-    lines(0:max(deg), (0:max(deg))^(-coef(fit)), col="red")
-    legend("topright", c(paste("exponent:", round(coef(fit), 2)),
-                         paste("standard error:", round(sqrt(vcov(fit)), 2))),
-           bty="n", cex=1.5)
-  }
-}
-
-.tkigraph.closeness <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  cl <- closeness(graphs[[gnos]], mode="out")
-  value <- data.frame(Vertex=V(graphs[[gnos]])$name, Closeness=cl)
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(cl),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Closeness for graph #", gnos),
-                     showmean=mv)
-}
-
-.tkigraph.betweenness <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  btw <- betweenness(graphs[[gnos]])
-  vc <- vcount(graphs[[gnos]])
-  m <- (vc-1)*(vc-2)
-  nbtw <- btw/m
-  value <- data.frame(V(graphs[[gnos]])$name, btw, nbtw)
-  colnames(value) <- c("Vertex", "Betweenness", "Normalized Betweenness")
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(btw),2), "&", round(mean(nbtw),5))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Betweenness for graph #", gnos),
-                     showmean=mv)
-}
-
-.tkigraph.constraints <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  const <- constraint(graphs[[gnos]])
-  value <- data.frame(V(graphs[[gnos]])$name, const)
-  colnames(value) <- c("Vertex", "Constraint")
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(const),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Constraint for graph #", gnos),
-                     showmean=mv)
-}  
-
-.tkigraph.power.centrality <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  bp <- bonpow(graphs[[gnos]])
-  value <- data.frame(V(graphs[[gnos]])$name, bp)
-  colnames(value) <- c("Vertex", "Power centrality")
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(bp),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Power centrality for graph #", gnos),
-                     showmean=mv)
-}    
-
-.tkigraph.page.rank <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  bp <- page.rank(graphs[[gnos]])$vector
-  value <- data.frame(V(graphs[[gnos]])$name, bp)
-  colnames(value) <- c("Vertex", "Page rank")
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(bp),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Page rank centrality for graph #", gnos),
-                     showmean=mv)
-}    
-
-.tkigraph.edge.betweenness <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- get("graphs", .tkigraph.env)
-  ebtw <- edge.betweenness(graphs[[gnos]])
-  el <- get.edgelist(graphs[[gnos]])
-  value <- data.frame(E(graphs[[gnos]])$name, el[,1], el[,2], ebtw)
-  colnames(value) <- c("Edge", "From", "To", "Betweenness")
-  value <- value[ order(value[,4], decreasing=TRUE), ]
-  mv <- paste("Mean value:", round(mean(ebtw),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Edge betweenness for graph #",gnos),
-                     showmean=mv)
-}
-
-#####################################################
-
-.tkigraph.dist.matrix <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  if (vcount(graph) > 100) {
-    .tkigraph.error("Graphs is too large to do this")
-    return()
-  }
-
-  value <- shortest.paths(graph, mode="out")
-  rownames(value) <- colnames(value) <- V(graph)$name
-  .tkigraph.showData(value, sort.button=FALSE, 
-                     title=paste(sep="", "Distance matrix for graph #", gnos))
-}
-
-.tkigraph.distance.tofrom <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  read <- .tkigraph.dialogbox(TITLE="Distance from a vertex",
-                              v=list(name="Vertex ID", type="numeric",
-                                default=1, min=1, max=vcount(graph)))
-  if (read$v < 1 || read$v > vcount(graph)) {
-    .tkigraph.error("Invalid vertex ID")
-    return()
-  }
-
-  value <- shortest.paths(graph, read$v, mode="out")
-  dim(value) <- NULL
-  value <- data.frame( V(graph)$name, value)
-  colnames(value) <- c("Vertex", "Distance")
-  mv <- paste("Mean distance:", round(mean(value[,2]),2))
-  .tkigraph.showData(value,
-                     title=paste("Distance from vertex", read$v, "in graph #",
-                       gnos), showmean=mv)
-}
-
-.tkigraph.diameter <- function(mode="dia") {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)==0) {
-    .tkigraph.error("Please select one or more graphs")
-    return()
-  }
-
-  isconn <- logical()
-  dia <- numeric()
-  graphs <- get("graphs", .tkigraph.env)
-  for (i in seq(along=gnos)) {
-    if (mode=="dia") {
-      dia[i] <- diameter(graphs[[ gnos[i] ]], directed=FALSE)
-    } else if (mode=="path") {
-      dia[i] <- average.path.length(graphs[[ gnos[i] ]], directed=FALSE)
-    }
-    isconn[i] <- is.connected(graphs[[ gnos[i] ]])
-  }
-
-  value <- data.frame( gnos, isconn, dia)
-  if (mode=="dia") {
-    title <- "Diameter"
-    colnames(value) <- c("Graph #", "Connected", "Diameter")
-  } else if (mode=="path") {
-    title <- "Average path length"
-    colnames(value) <- c("Graph #", "Connected", "Mean path length")  }
-  title <- paste(title, "of graph")
-  if (length(gnos) > 1) {
-    title <- paste(sep="", title, "s")
-  }
-  .tkigraph.showData(value, title=title)
-  
-}
-
-.tkigraph.plot.diameter <- function(simple=FALSE) {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  edges <- E(graph, path=get.diameter(graph, directed=FALSE), directed=FALSE)
-  color <- rep("black", ecount(graph))
-  color[edges] <- "red"
-  width <- rep(1, ecount(graph))
-  width[edges] <- 2
-  .tkigraph.plot(gnos=gnos, simple=simple, edge.color=color, edge.width=width)
-}
-
-.tkigraph.clusters <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  comm <- clusters(graph)
-  members <- sapply(sapply(seq(along=comm$csize),
-                           function(i) which(comm$membership==i)),
-                    paste, collapse=", ")
-  value <- data.frame("Component"=seq(along=comm$csize), "Members"=members)
-  .tkigraph.showData(value, title=paste("Components of graph #",
-                       gnos), right=FALSE)
-}
-
-.tkigraph.clusters.membership <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  comm <- clusters(graph)
-  value <- data.frame("Vertex"=seq(along=comm$membership),
-                 "Component"=comm$membership)
-  .tkigraph.showData(value, title=paste("Components of graph #", gnos))
-}
-
-.tkigraph.calculate.clusters <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  cs <- clusters(graph)$csize
-  value <- data.frame(seq(along=cs), cs)
-  colnames(value) <- c("Cluster #", "Size")
-
-  plot.command <- function() {
-    read <- .tkigraph.dialogbox(TITLE="Plot degree distribution",
-                                logx=list(name="Logarithmic `X' axis",
-                                  type="boolean", default="FALSE"),
-                                logy=list(name="Logarithmic `Y' axis",
-                                  type="boolean", default="FALSE"),
-                                hist=list(name="Histogram",
-                                  type="boolean", default="FALSE"))
-
-    if (!read$hist) {
-      h <- hist(value[,2], 0:max(value[,2]), plot=FALSE)$density  
-      log <- ""
-      if (read$logx) { log <- paste(sep="", log, "x") }
-      if (read$logy) { log <- paste(sep="", log, "y") }
-      dev.new()
-      plot(1:max(value[,2]), h, xlab="Component size",
-           ylab="Relative frequency",
-           type="b", main="Component size distribution", log=log)
-    } else {
-      dev.new()
-      hist(value[,2], main="Component size distribution", xlab="Degree")
-    }
-  }
-  value <- value[ order(value[,2], decreasing=TRUE), ]
-  mv <- paste("Mean component size:", round(mean(cs),2))
-  .tkigraph.showData(value,
-                     title=paste(sep="", "Component sizes, graph #", gnos),
-                     plot.text="Plot distribution",
-                     plot.command=plot.command, showmean=mv)
-}
-
-.tkigraph.plot.comp <- function(simple=FALSE) {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  clu <- clusters(graph)
-  colbar <- rainbow(length(clu$csize)*2)
-  vertex.color <- colbar[ clu$membership ]
-  .tkigraph.plot(gnos=gnos, simple=simple, vertex.color=vertex.color)
-}
-
-.tkigraph.create.giantcomp <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  clu <- clusters(graph)
-  v <- which(clu$membership == which.max(clu$csize))
-  g <- induced.subgraph(graph, v)
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.create.mycomp <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  read <- .tkigraph.dialogbox(TITLE="Component of a vertex",
-                              vertex=list(name="Vertex", type="numeric",
-                                default=1, min=1, max=vcount(graph)))
-  if (read$vertex<1 || read$vertex >vcount(graph)) {
-    .tkigraph.error("Invalid vertex id")
-    return()
-  }
-
-  g <- induced.subgraph(graph, subcomponent(graph, read$vertex))
-  .tkigraph.add.graph(g)
-}
-
-.tkigraph.create.comp <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-  read <- .tkigraph.dialogbox(TITLE="Graph from component",
-                              comp=list(name="Component id", type="numeric",
-                                default=1, min=1))
-  clu <- clusters(graph)
-  if (read$comp<1 || read$comp > length(clu$csize)) {
-    .tkigraph.error("Invalid component id")
-    return()
-  }
-  
-  v <- which(clu$membership==read$comp)
-  g <- induced.subgraph(graph, v)
-  .tkigraph.add.graph(g)  
-}
-
-.tkigraph.motifs.draw <- function() {
-  read <- .tkigraph.dialogbox(TITLE="Draw all motifs",
-                              size=list(name="Size", type="numeric",
-                                default=3, min=3, max=4),
-                              directed=list(name="Directed", type="boolean",
-                                default="FALSE"))
-
-  if (read$size < 3 || read$size > 4) {
-    .tkigraph.error("Invalid motif size, should be 3 or 4")
-    return()
-  }
-
-  if (read$size == 3) {
-    co <- matrix( c(1,1, 0,0, 2,0), ncol=2, byrow=TRUE)
-  } else {
-    co <- matrix( c(0,1, 1,1, 0,0, 1,0), ncol=2, byrow=TRUE)
-  }
-
-  if (read$size == 3 && read$dir) {
-    no <- 16
-    rows <- cols <- 4
-  } else if (read$size == 3 && !read$dir) {
-    no <- 4
-    rows <- cols <- 2
-  } else if (read$size == 4 && read$dir) {
-    no <- 216
-    rows <- cols <- 15
-  } else if (read$size == 4 && !read$dir) {
-    no <- 11
-    rows <- 4
-    cols <- 3
-  }
-  names <- as.character(seq(no))
-  dev.new()
-  layout( matrix(1:(rows*cols), nrow=rows, byrow=TRUE) )
-  layout.show(rows*cols)
-  for (i in seq(no)) {
-    g <- graph.isocreate(read$size, i-1, directed=read$dir)
-    par(mai=c(0,0,0,0), mar=c(0,0,0,0))
-    par(cex=2)
-    plot(g, layout=co, vertex.color="red", vertex.label=NA, frame=TRUE,
-         edge.color="black", margin=0.1, edge.arrow.size=.5)
-    text(0,0, names[i], col="blue", cex=.5)
-  }
-  
-}
-
-.tkigraph.motifs.find <- function() {
-
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  
-  read <- .tkigraph.dialogbox(TITLE="Find motifs",
-                              size=list(name="Size", type="numeric",
-                                default=3, min=3, max=4))
-  if (read$size < 3 || read$size > 4) {
-    .tkigraph.error("Invalid motif size, should be 3 or 4")
-    return()
-  }
-  
-  graphs <- get("graphs", .tkigraph.env)
-  motifs <- graph.motifs(graphs[[gnos]], size=read$size)
-
-  if (read$size == 3) {
-    co <- matrix( c(1,1, 0,0, 2,0), ncol=2, byrow=TRUE)
-  } else {
-    co <- matrix( c(0,1, 1,1, 0,0, 1,0), ncol=2, byrow=TRUE)
-  }
-
-  if (read$size == 3 && is.directed(graphs[[gnos]])) {
-    no <- 16
-    rows <- cols <- 4
-  } else if (read$size == 3 && !is.directed(graphs[[gnos]])) {
-    no <- 4
-    rows <- cols <- 2
-  } else if (read$size == 4 && is.directed(graphs[[gnos]])) {
-    no <- 216
-    rows <- cols <- 15
-  } else if (read$size == 4 && !is.directed(graphs[[gnos]])) {
-    no <- 11
-    rows <- 4
-    cols <- 3
-  }
-
-  dev.new()
-  barplot(motifs, names.arg=seq(no))
-  
-  names <- as.character(seq(no))
-  dev.new()
-  layout( matrix(1:(rows*cols), nrow=rows, byrow=TRUE) )
-  layout.show(rows*cols)
-  for (i in seq(no)) {
-    g <- graph.isocreate(read$size, i-1,
-                         directed=is.directed(graphs[[gnos]]))
-    par(mai=c(0,0,0,0), mar=c(0,0,0,0))
-    par(cex=2)
-    plot(g, layout=co, vertex.color="red", vertex.label=NA, frame=TRUE,
-         edge.color="black", margin=0.1)
-    text(0,0, motifs[i], col="green")
-  }  
-  
-}
-
-.tkigraph.spinglass <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-
-  if (!is.connected(graph)) {
-    .tkigraph.error("Graph is not connected")
-    return()
-  }
-
-  weights <- if ("weight" %in% list.edge.attributes(graph)) "TRUE" else "FALSE"
-  read <- .tkigraph.dialogbox(TITLE="Spinglass community structure",
-                              gamma=list(name="Gamma parameter",
-                                type="numeric", default=1),
-                              weights=list(name="Use edge weights",
-                                type="boolean", default=weights),
-                              spins=list(name="Number of spins",
-                                type="numeric", default=25),
-                              parupdate=list(name="Parallel update",
-                                type="boolean", default="FALSE"),
-                              update.rule=list(name="Update rule",
-                                type="listbox", default="1",
-                                values=c("Simple", "Configuration model")),
-                              start.temp=list(name="Start temperature",
-                                type="numeric", default=1),
-                              stop.temp=list(name="Stop temperature",
-                                type="numeric", default=0.1),
-                              cool.fact=list(name="Cooling factor",
-                                type="numeric", default=0.99))
-
-  read$update.rule <- c("simple", "config")[read$update.rule+1]
-  if (read$weights) {
-    if (!"weight" %in% list.edge.attributes(graph)) {
-      .tkigraph.warning("This graphs is not weighted")
-      read$weights <- NULL
-    } else {
-      read$weights <- E(graph)$weight
-    }
-  } else {
-    read$weights <- NULL
-  }
-  comm <- spinglass.community(graph, weights=read$weights, spins=read$spins,
-                              parupdate=read$parupdate, start.temp=read$start.temp,
-                              stop.temp=read$stop.temp, cool.fact=read$cool.fact,
-                              update.rule=read$update.rule, gamma=read$gamma)
-
-  .tkigraph.spinglass.community.dialog(comm, read, gnos)
-}
-
-.tkigraph.spinglass.community.dialog <- function(comm, read, gnos) {
-  dialog <- tktoplevel()
-  frame <- tkframe(dialog)
-  tkgrid(frame)
-  tktitle(dialog) <- "Spinglass community structure algorithm results"
-
-  read$update.rule <- if (read$update.rule=="simple") "Simple" else "Configuration model"
-  tkgrid(tklabel(dialog, text="Spinglass community structure algorithm results",
-                 font=tkfont.create(family="times", size=16, weight="bold")),
-         columnspan=3, sticky="nsew", "in"=frame, padx=10, pady=10)
-  tkgrid(txt <- tktext(dialog), columnspan=1, rowspan=5, sticky="nsew",
-         "in"=frame, padx=10, pady=10)
-  tkconfigure(txt, height=15)
-  tkinsert(txt, "end", "Parameters were:\n")
-  tkinsert(txt, "end", paste("  Gamma=", read$gamma, "\n"))
-  tkinsert(txt, "end", if (is.null(read$weights)) "  Weights were not used.\n" else
-           "  Weights were used.\n")
-  tkinsert(txt, "end", paste("  Number of spins=", read$spins, "\n"))
-  tkinsert(txt, "end", if (read$parupdate) "  Parallel updating.\n" else
-           "  Sequential updating.\n")
-  tkinsert(txt, "end", paste("  Update rule:", read$update.rule, "\n"))
-  tkinsert(txt, "end", paste("  Start temperature was", read$start.temp, "\n"))
-  tkinsert(txt, "end", paste("  Stop temperaure was", read$stop.temp, "\n"))
-  tkinsert(txt, "end", paste("  Cooling factor was", read$cool.fact, "\n"))
-
-  tkinsert(txt, "end", "\nResults:\n")
-  tkinsert(txt, "end", paste("  Number of communities found:", length(comm$csize),
-                             "\n"))
-  tkinsert(txt, "end", paste("  Modularity of the result:", comm$modularity, "\n"))
-  tkinsert(txt, "end", paste("  Stopped at temperature:", comm$temperature, "\n"))
-  tkconfigure(txt, state="disabled")
-
-  show.communities <- function() {
-    members <- sapply(sapply(seq(along=comm$csize),
-                             function(i) which(comm$membership==i)),
-                      paste, collapse=", ")
-    value <- data.frame("Community"=seq(along=comm$csize), "Members"=members)
-    .tkigraph.showData(value,
-                       title=paste("Communities, spinglass algorithm on graph #",
-                         gnos), right=FALSE)
-  }
-  show.membership <- function() {
-    value <- data.frame("Vertex"=seq(along=comm$membership),
-                   "Community"=comm$membership)
-    .tkigraph.showData(value,
-                       title=paste("Communities, spinglass algorithm on graph #",
-                         gnos))
-  }
-  show.csize <- function() {
-    value <- data.frame("Comm. #"=seq(along=comm$csize), "Size"=comm$csize)
-    value <- value[ order(value[,2], decreasing=TRUE), ]
-    .tkigraph.showData(value,
-                       title=paste("Communities, spinglass algorithm on graph #",
-                         gnos))                       
-  }
-  plot.communities <- function(simple=FALSE) {
-    colbar <- rainbow(length(comm$csize)*2)
-    vertex.color=colbar[ comm$membership ]
-    .tkigraph.plot(gnos=gnos, simple=simple, vertex.color=vertex.color)
-  }
-  create.subgraph <- function() {
-    ## TODO
-  }
-  
-  tkgrid(tkbutton(dialog, text="Show communities", command=show.communities),
-         "in"=frame, sticky="ew", column=1, row=1, padx=10, pady=10)
-  tkgrid(tkbutton(dialog, text="Show membership", command=show.membership),
-         "in"=frame, sticky="ew", column=1, row=2, padx=10, pady=10)
-  tkgrid(tkbutton(dialog, text="Show community sizes", command=show.csize),
-         "in"=frame, sticky="ew", column=1, row=3, padx=10, pady=10)
-  tkgrid(tkbutton(dialog, text="Draw communities",
-                  command=function() plot.communities(simple=FALSE)),
-         "in"=frame, sticky="ew", column=1, row=4, padx=10, pady=10)
-##   tkgrid(tkbutton(dialog, text="Create subgraph", command=create.subgraph),
-##          "in"=frame, sticky="nsew", column=1, row=6, padx=10, pady=10)
-  
-  tkgrid(tkbutton(dialog, text="Close", command=function() tkdestroy(dialog)),
-         "in"=frame, sticky="nsew", columnspan=2, padx=10, pady=10)
-}
-
-.tkigraph.my.spinglass <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos)!=1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graph <- get("graphs", .tkigraph.env)[[gnos]]
-
-  if (!is.connected(graph)) {
-    .tkigraph.error("Graph is not connected")
-    return()
-  }
-
-  weights <- if ("weight" %in% list.edge.attributes(graph)) "TRUE" else "FALSE"
-  read <- .tkigraph.dialogbox(TITLE="Spinglass community of a vertex",
-                              vertex=list(name="Vertex", type="numeric",
-                                default=1, min=1, max=vcount(graph)),
-                              gamma=list(name="Gamma parameter",
-                                type="numeric", default=1),
-                              weights=list(name="Use edge weights",
-                                type="boolean", default=weights),
-                              spins=list(name="Number of spins",
-                                type="numeric", default=25),
-                              update.rule=list(name="Update rule",
-                                type="listbox", default="1",
-                                values=c("Simple", "Configuration model")))
-                              
-  if (read$vertex<1 || read$vertex > vcount(graph)) {
-    .tkigraph.error("Invalid vertex id")
-    return()
-  }
-  
-  read$update.rule <- c("simple", "config")[read$update.rule+1]
-  if (read$weights) {
-    if (!"weight" %in% list.edge.attributes(graph)) {
-      .tkigraph.warning("This graphs is not weighted")
-      read$weights <- NULL
-    } else {
-      read$weights <- E(graph)$weight
-    }
-  } else {
-    read$weights <- NULL
-  }
-  comm <- spinglass.community(graph, vertex=read$vertex,
-                              weights=read$weights, spins=read$spins,
-                              update.rule=read$update.rule, gamma=read$gamma)
-  .tkigraph.spinglass.mycommunity.dialog(comm, read, gnos)
-}
-
-.tkigraph.spinglass.mycommunity.dialog <- function(comm, read, gnos) {
-  dialog <- tktoplevel()
-  frame <- tkframe(dialog)
-  tkgrid(frame)
-  tktitle(dialog) <- "Spinglass community of a single vertex"
-
-  scr <- tkscrollbar(dialog, repeatinterval=5,
-                     command=function(...) tkyview(txt,...))
-  
-  read$update.rule <- if (read$update.rule=="simple") "Simple" else "Configuration model"
-  tkgrid(tklabel(dialog, text="Spinglass community of a single vertex",
-                 font=tkfont.create(family="times", size=16, weight="bold")),
-         columnspan=3, sticky="nsew", "in"=frame, padx=10, pady=10)
-  tkgrid(txt <- tktext(dialog, yscrollcommand=function(...) tkset(scr,...)),
-         columnspan=1, rowspan=3, sticky="nsew", "in"=frame, padx=10, pady=10)
-  tkconfigure(txt, height=17)
-  tkgrid(scr, row=1, column=1, rowspan=3, sticky="ns", "in"=frame, pady=10)
-  tkinsert(txt, "end", "Parameters were:\n")
-  tkinsert(txt, "end", paste("  Vertex:", read$vertex, "\n"));
-  tkinsert(txt, "end", paste("  Gamma=", read$gamma, "\n"))
-  tkinsert(txt, "end", if (is.null(read$weights)) "  Weights were not used.\n" else
-           "  Weights were used.\n")
-  tkinsert(txt, "end", paste("  Number of spins=", read$spins, "\n"))
-  tkinsert(txt, "end", paste("  Update rule:", read$update.rule, "\n"))
-
-  tkinsert(txt, "end", "\nResults:\n")
-  tkinsert(txt, "end", paste("  Size of the community:", length(comm$community),
-                             "\n"))
-  tkinsert(txt, "end", paste("  Cohesion:", comm$cohesion, "\n"))
-  tkinsert(txt, "end", paste("  Adhesion:", comm$adhesion, "\n"))
-  tkinsert(txt, "end", paste("  Inner links:", comm$inner.links, "\n"))
-  tkinsert(txt, "end", paste("  Outer links:", comm$outer.links, "\n"))
-
-  tkinsert(txt, "end", "\nThe community:\n")
-  con <- textConnection(NULL, open="w", local=TRUE)
-  cat(sort(comm$community), file=con, fill=TRUE, sep=", ")
-  tkinsert(txt, "end", textConnectionValue(con))
-  close(con)
-  tkconfigure(txt, state="disabled")
-
-  plot.communities <- function(simple=FALSE) {
-    graph <- get("graphs", .tkigraph.env)[[gnos]]
-    color <- rep("skyblue2", vcount(graph))
-    color[ comm$community ] <- "red"
-    .tkigraph.plot(gnos=gnos, simple=simple, vertex.color=color)
-  }
-  
-  create.graph <- function() {
-    graph <- get("graphs", .tkigraph.env)[[gnos]]
-    g <- induced.subgraph(graph, comm$community)
-    .tkigraph.add.graph(g)
-  }
-  
-  tkgrid(tkbutton(dialog, text="Draw community",
-                  command=function() plot.communities(simple=FALSE)),
-         "in"=frame, sticky="ew", column=2, row=1, padx=10, pady=10)  
-  tkgrid(tkbutton(dialog, text="Create graph from community",
-                  command=create.graph),
-         "in"=frame, sticky="ew", column=2, row=2, padx=10, pady=10)         
-  
-  tkgrid(tkbutton(dialog, text="Close", command=function() tkdestroy(dialog)),
-         "in"=frame, sticky="nsew", columnspan=3, padx=10, pady=10)  
-}
-
-.tkigraph.cohesion <- function() {
-  gnos <- .tkigraph.get.selected()
-  if (length(gnos) != 1) {
-    .tkigraph.error("Please select exactly one graph")
-    return()
-  }
-  graphs <- decompose.graph(get("graphs", .tkigraph.env)[[gnos]])
-  coh <- sapply(graphs, graph.cohesion)
-  value <- data.frame("Component"=seq(length=length(graphs)), "Cohesion"=coh)
-  .tkigraph.showData(value, title=paste("Cohesion of components in graph #",
-                              gnos), right=FALSE)
-}  
-
-.tkigraph.help <- function(page="index.html") {
-  dialog <- tktoplevel()
-  tktitle(dialog) <- "Help (main page)"
-
-  close <- function() {
-    tkdestroy(dialog)
-  }
-
-  scr <- tkscrollbar(dialog, repeatinterval=5,
-                     command=function(...) tkyview(txt,...))
-  txt <- tktext(dialog, yscrollcommand=function(...) tkset(scr, ...),
-                width=80, height=40)
-
-  main.menu <- tkmenu(dialog)
-  tkadd(main.menu, "command", label="Back", command=function() {
-    tcl("render_back", txt)
-  })
-  tkadd(main.menu, "command", label="Forw", command=function() {
-    tcl("render_forw", txt)
-  })
-  tkadd(main.menu, "command", label="Home", command=function() {
-    tcl("render", txt, "index.html"); return()
-  })
-  tkadd(main.menu, "command", label="Close", command=function() {
-    tkdestroy(dialog); return()
-  })
-  tkconfigure(dialog, "-menu", main.menu)
-  
-  tkpack(scr, side="right", fill="y", expand=0)
-  tkpack(txt, side="left", fill="both", expand=1)
-
-  browser.button <- tkbutton(dialog, command=function() {
-    browseURL(tclvalue("browser_url"))
-  })
-  
-  tcl("global", "tkigraph_help_root", "tkigraph_help_history",
-      "tkigraph_help_history_pos", "browser_button", "browser_url")  
-  tcl("set", "tkigraph_help_root",
-      system.file("tkigraph_help", package="igraph"))
-  tcl("set", "browser_button", browser.button)
-  
-  tcl("source", system.file("html_library.tcl", package="igraph"))
-  tcl("source", system.file("my_html_library.tcl", package="igraph"))
-  tcl("HMinit_win", txt)
-  tcl("start_history", txt)
-  tcl("render", txt, "index.html")
-  
-  tkconfigure(txt, state="disabled")
-}
-
-.tkigraph.help.external <- function(page="index.html") {
-  f <- system.file("tkigraph_help/index.html", package="igraph")
-  browseURL(f)
-}
-
-.tkigraph.about <- function() {
-  dialog <- tktoplevel()
-  tktitle(dialog) <- "About tkigraph"
-  image <-tkimage.create("photo", "img", format="gif",
-                         file=system.file("igraph.gif", package="igraph"))
-  logo <- tklabel(dialog, relief="flat", padx=10, pady=10, image=image)
-  label <- tklabel(dialog, padx=30, pady=10,
-                   text=paste(sep="", "tkigraph (c) 2009 Gabor Csardi\n",
-                     "igraph (c) 2003-2009 Gabor Csardi and Tamas Nepusz\n\n",
-                     "This is igraph version ",
-                     packageDescription("igraph")$Version, " and\n",
-                     R.version$version.string))
-  close <- tkbutton(dialog, text="Close", command=function() {
-    tkdestroy(dialog); return()
-  })
-
-  tkpack(logo, side="top", anchor="c", expand=0)
-  tkpack(label, side="top", anchor="c", expand=0)
-  tkpack(close, side="bottom", anchor="c", expand=0)
-}
-
-#####################################################
-# This is from the 'relimp' package by David Firth, thanks
-
-.tkigraph.showData <-
-    function (dataframe,
-              colname.bgcolor = "grey50",
-              rowname.bgcolor = "grey50",
-              body.bgcolor = "white",
-              colname.textcolor = "white",
-              rowname.textcolor = "white",
-              body.textcolor = "black",
-              font = "Courier 12",
-              maxheight = 30,
-              maxwidth = 80,
-              title = NULL,
-              rowname.bar = "left",
-              colname.bar = "top",
-              rownumbers = FALSE,
-              placement = "-20-40",
-              plot.text="Plot",
-              plot.command=NULL,
-              suppress.X11.warnings = FALSE,
-              right=TRUE,
-              showmean=NULL,
-              sort.button=TRUE,
-              inthis=NULL)
-{
-    if (suppress.X11.warnings) { ## as in John Fox's Rcmdr package
-        messages.connection <- textConnection(NULL, open = "w", local = TRUE)
-        sink(messages.connection, type = "message")
-        on.exit({
-            sink(type="message")
-            close(messages.connection)
-        })
-    }
-    object.name <- deparse(substitute(dataframe))
-    if (!is.data.frame(dataframe)){
-        temp <- try(dataframe <- as.data.frame(dataframe), silent = FALSE)
-        if (inherits(temp, "try-error")) {
-            stop(paste(object.name, "cannot be coerced to a data frame"))
-        }
-        object.name <- paste("as.data.frame(", object.name, ")", sep = "")
-    }
-
-    if (is.numeric(rownumbers) &&
-        length(rownumbers) != nrow(dataframe))
-        stop("rownumbers argument must be TRUE, FALSE or have length nrow(dataframe)")
-    oldwidth <- unlist(options("width"))
-    options(width = 10000)
-    conn <- textConnection(NULL, open="w", local=TRUE)
-    sink(conn)
-    options(max.print=10000000)
-    print(dataframe, right=right)
-    sink()
-    zz <- strsplit(textConnectionValue(conn), "\n", fixed=TRUE)
-    close(conn)
-    if (length(zz) > 1 + nrow(dataframe)) stop(
-       "data frame too wide")
-    options(width = oldwidth)
-    if (is.null(inthis)) {
-      base <- tktoplevel()
-      tkwm.geometry(base, placement)
-      tkwm.title(base, {
-        if (is.null(title))
-          object.name
-        else title
-      })
-    } else { base <- inthis }      
-    nrows <- length(zz) - 1
-    if (is.numeric(rownumbers))
-        rowname.text <- paste(rownumbers, row.names(dataframe))
-    else if (rownumbers)
-        rowname.text <- paste(1:nrows, row.names(dataframe))
-    else rowname.text <- row.names(dataframe)
-    namewidth = max(nchar(rowname.text))
-    yy <- substring(zz, 2 + max(nchar(row.names(dataframe))))
-    datawidth <- max(nchar(yy))
-    winwidth <- min(1 + datawidth, maxwidth)
-    hdr <- tktext(base,
-                  bg = colname.bgcolor,
-                  fg = colname.textcolor,
-                  font = font,
-                  height = 1,
-                  width = winwidth,
-                  takefocus = TRUE)
-    ftr <- tktext(base,
-                  bg = colname.bgcolor,
-                  fg = colname.textcolor,
-                  font = font,
-                  height = 1,
-                  width = winwidth,
-                  takefocus = TRUE)
-    textheight <- min(maxheight, nrows)
-    txt <- tktext(base,
-                  bg = body.bgcolor,
-                  fg = body.textcolor,
-                  font = font,
-                  height = textheight,
-                  width = winwidth,
-                  setgrid = 1,
-                  takefocus = TRUE)
-     lnames <- tktext(base,
-                     bg = rowname.bgcolor,
-                     fg = rowname.textcolor,
-                     font = font,
-                     height = textheight,
-                     width = namewidth,
-                     takefocus = TRUE)
-    rnames <- tktext(base,
-                     bg = rowname.bgcolor,
-                     fg = rowname.textcolor,
-                     font = font,
-                     height = textheight,
-                     width = namewidth,
-                     takefocus = TRUE)
-    xscroll <- tkscrollbar(base,
-                           orient = "horizontal",
-                           repeatinterval = 1,
-                           command = function(...) {
-                               tkxview(txt, ...)
-                               tkxview(hdr, ...)
-                               tkxview(ftr, ...)
-                           })
-    string.to.vector <- function(string.of.indices) {
-        string.of.indices <- tclvalue(string.of.indices)
-        as.numeric(strsplit(string.of.indices, split = " ")[[1]])
-    }
-    tkconfigure(txt, xscrollcommand = function(...) {
-        tkset(xscroll, ...)
-        xy <- string.to.vector(tkget(xscroll))
-        tkxview.moveto(hdr, xy[1])
-        tkxview.moveto(ftr, xy[1])
-    })
-    tkconfigure(hdr, xscrollcommand = function(...) {
-        tkset(xscroll, ...)
-        xy <- string.to.vector(tkget(xscroll))
-        tkxview.moveto(txt, xy[1])
-        tkxview.moveto(ftr, xy[1])
-    })
-    tkconfigure(ftr, xscrollcommand = function(...) {
-        tkset(xscroll, ...)
-        xy <- string.to.vector(tkget(xscroll))
-        tkxview.moveto(hdr, xy[1])
-        tkxview.moveto(txt, xy[1])
-    })
-    yscroll <- tkscrollbar(base,
-                           orient = "vertical",
-                           repeatinterval = 1,
-                           command = function(...) {
-                               tkyview(txt, ...)
-                               tkyview(lnames, ...)
-                               tkyview(rnames, ...)
-                           })
-    tkconfigure(txt, yscrollcommand = function(...) {
-        tkset(yscroll, ...)
-        xy <- string.to.vector(tkget(yscroll))
-        tkyview.moveto(lnames, xy[1])
-        tkyview.moveto(rnames, xy[1])
-    })
-    tkconfigure(lnames, yscrollcommand = function(...) {
-        tkset(yscroll, ...)
-        xy <- string.to.vector(tkget(yscroll))
-        tkyview.moveto(txt, xy[1])
-        tkyview.moveto(rnames, xy[1])
-    })
-    tkconfigure(rnames, yscrollcommand = function(...) {
-        tkset(yscroll, ...)
-        xy <- string.to.vector(tkget(yscroll))
-        tkyview.moveto(txt, xy[1])
-        tkyview.moveto(lnames, xy[1])
-    })
-    tkbind(txt, "<B2-Motion>", function(x, y) {
-        tkscan.dragto(txt, x, y)
-    })
-## The next block just enables copying from the text boxes
-{
-    copyText.hdr <- function(){
-        tcl("event", "generate",
-              .Tk.ID(hdr),
-              "<<Copy>>")}
-    tkbind(hdr, "<Button-1>", function() tkfocus(hdr))
-    editPopupMenu.hdr <- tkmenu(hdr, tearoff = FALSE)
-    tkadd(editPopupMenu.hdr, "command", label = "Copy <Ctrl-C>",
-              command = copyText.hdr)
-    RightClick.hdr <- function(x,y) # x and y are the mouse coordinates
-    {
-        rootx <- as.integer(tkwinfo("rootx", hdr))
-        rooty <- as.integer(tkwinfo("rooty", hdr))
-        xTxt <- as.integer(x) + rootx
-        yTxt <- as.integer(y) + rooty
-        tcl("tk_popup", editPopupMenu.hdr, xTxt, yTxt)
-    }
-    tkbind(hdr, "<Button-3>", RightClick.hdr)
-    tkbind(hdr, "<Control-KeyPress-c>", copyText.hdr)
-    ##
-    copyText.ftr <- function(){
-        tcl("event", "generate",
-              .Tk.ID(ftr),
-              "<<Copy>>")}
-    tkbind(ftr, "<Button-1>", function() tkfocus(ftr))
-    editPopupMenu.ftr <- tkmenu(ftr, tearoff = FALSE)
-    tkadd(editPopupMenu.ftr, "command", label = "Copy <Ctrl-C>",
-              command = copyText.ftr)
-    RightClick.ftr <- function(x,y) # x and y are the mouse coordinates
-    {
-        rootx <- as.integer(tkwinfo("rootx", ftr))
-        rooty <- as.integer(tkwinfo("rooty", ftr))
-        xTxt <- as.integer(x) + rootx
-        yTxt <- as.integer(y) + rooty
-        tcl("tk_popup", editPopupMenu.ftr, xTxt, yTxt)
-    }
-    tkbind(ftr, "<Button-3>", RightClick.ftr)
-    tkbind(ftr, "<Control-KeyPress-c>", copyText.ftr)
-    ##
-    copyText.txt <- function(){
-        tcl("event", "generate",
-              .Tk.ID(txt),
-              "<<Copy>>")}
-    tkbind(txt, "<Button-1>", function() tkfocus(txt))
-    editPopupMenu.txt <- tkmenu(txt, tearoff = FALSE)
-    tkadd(editPopupMenu.txt, "command", label = "Copy <Ctrl-C>",
-              command = copyText.txt)
-    RightClick.txt <- function(x,y) # x and y are the mouse coordinates
-    {
-        rootx <- as.integer(tkwinfo("rootx", txt))
-        rooty <- as.integer(tkwinfo("rooty", txt))
-        xTxt <- as.integer(x) + rootx
-        yTxt <- as.integer(y) + rooty
-        tcl("tk_popup", editPopupMenu.txt, xTxt, yTxt)
-    }
-    tkbind(txt, "<Button-3>", RightClick.txt)
-    tkbind(txt, "<Control-KeyPress-c>", copyText.txt)
-    ##
-    copyText.lnames <- function(){
-        tcl("event", "generate",
-              .Tk.ID(lnames),
-              "<<Copy>>")}
-    tkbind(lnames, "<Button-1>", function() tkfocus(lnames))
-    editPopupMenu.lnames <- tkmenu(lnames, tearoff = FALSE)
-    tkadd(editPopupMenu.lnames, "command", label = "Copy <Ctrl-C>",
-              command = copyText.lnames)
-    RightClick.lnames <- function(x,y) # x and y are the mouse coordinates
-    {
-        rootx <- as.integer(tkwinfo("rootx", lnames))
-        rooty <- as.integer(tkwinfo("rooty", lnames))
-        xTxt <- as.integer(x) + rootx
-        yTxt <- as.integer(y) + rooty
-        tcl("tk_popup", editPopupMenu.lnames, xTxt, yTxt)
-    }
-    tkbind(lnames, "<Button-3>", RightClick.lnames)
-    tkbind(lnames, "<Control-KeyPress-c>", copyText.lnames)
-    ##
-        copyText.rnames <- function(){
-        tcl("event", "generate",
-              .Tk.ID(rnames),
-              "<<Copy>>")}
-    tkbind(rnames, "<Button-1>", function() tkfocus(rnames))
-    editPopupMenu.rnames <- tkmenu(rnames, tearoff = FALSE)
-    tkadd(editPopupMenu.rnames, "command", label = "Copy <Ctrl-C>",
-              command = copyText.rnames)
-    RightClick.rnames <- function(x,y) # x and y are the mouse coordinates
-    {
-        rootx <- as.integer(tkwinfo("rootx", rnames))
-        rooty <- as.integer(tkwinfo("rooty", rnames))
-        xTxt <- as.integer(x) + rootx
-        yTxt <- as.integer(y) + rooty
-        tcl("tk_popup", editPopupMenu.rnames, xTxt, yTxt)
-    }
-    tkbind(rnames, "<Button-3>", RightClick.rnames)
-    tkbind(rnames, "<Control-KeyPress-c>", copyText.rnames)
-}
-
-    tktag.configure(hdr, "notwrapped", wrap = "none")
-    tktag.configure(ftr, "notwrapped", wrap = "none")
-    tktag.configure(txt, "notwrapped", wrap = "none")
-    tktag.configure(lnames, "notwrapped", wrap = "none")
-    tktag.configure(rnames, "notwrapped", wrap = "none")
-    tkinsert(txt, "end", paste(paste(yy[-1], collapse = "\n"),
-                               sep = ""), "notwrapped")
-
-    tkgrid(txt, row = 1, column = 1, sticky = "nsew")
-    if ("top" %in% colname.bar) {
-        tkinsert(hdr, "end", paste(yy[1], sep = ""), "notwrapped")
-        tkgrid(hdr, row = 0, column = 1, sticky = "ew")
-    }
-    if ("bottom" %in% colname.bar) {
-        tkinsert(ftr, "end", paste(yy[1], sep = ""), "notwrapped")
-        tkgrid(ftr, row = 2, column = 1, sticky = "ew")
-    }
-    if ("left" %in% rowname.bar) {
-        tkinsert(lnames, "end",
-                 paste(rowname.text, collapse = "\n"),
-                 "notwrapped")
-        tkgrid(lnames, row = 1, column = 0, sticky = "ns")
-    }
-    if ("right" %in% rowname.bar) {
-        tkinsert(rnames, "end",
-                 paste(rowname.text, collapse = "\n"),
-                 "notwrapped")
-        tkgrid(rnames, row = 1, column = 2, sticky = "ns")
-    }
-    tkconfigure(hdr, state = "disabled")
-    tkconfigure(ftr, state = "disabled")
-    tkconfigure(txt, state = "disabled")
-    tkconfigure(lnames, state = "disabled")
-    tkconfigure(rnames, state = "disabled")
-    if (maxheight < nrows) {
-        tkgrid(yscroll, row = 1, column = 3, sticky = "ns")
-    }
-    if (maxwidth < datawidth) {
-        tkgrid(xscroll, row = 3, column = 1, sticky = "ew")
-    }
-
-    sortColumn <- function(n, decreasing=FALSE) {
-      dataframe <<- dataframe[ order(dataframe[[n]], decreasing=decreasing), ]
-      rownames(dataframe) <- seq(length=nrow(dataframe))
-      .tkigraph.showData(dataframe,
-                         colname.bgcolor = colname.bgcolor,
-                         rowname.bgcolor = rowname.bgcolor,
-                         body.bgcolor = body.bgcolor,
-                         colname.textcolor = colname.textcolor,
-                         rowname.textcolor = rowname.textcolor,
-                         body.textcolor = body.textcolor,
-                         font = font,
-                         maxheight = maxheight,
-                         maxwidth = maxwidth,
-                         title = title,
-                         rowname.bar = rowname.bar,
-                         colname.bar = colname.bar,
-                         rownumbers = rownumbers,
-                         placement = placement,
-                         plot.text=plot.text,
-                         plot.command=plot.command,
-                         suppress.X11.warnings = suppress.X11.warnings,
-                         right=right,
-                         showmean=showmean,
-                         sort.button=sort.button,
-                         inthis=base)
-    }
-
-    pf <- tkframe(base)
-    if (is.null(inthis)) { tkgrid(pf, column=5, row=0, rowspan=10, sticky="new") }
-
-    if (!is.null(showmean) && is.null(inthis)) {
-      for (i in seq(along=showmean)) {
-        tkgrid(tklabel(base, text=showmean[1]), sticky="nsew",
-               column=0, padx=1, pady=1, columnspan=4)
-      }
-    }
-
-    sortBut <- tkbutton(base, text="Sort otherwise", command=function() {})
-
-    sortPopup <- function() {
-      sortMenu <- tkmenu(base, tearoff=FALSE)
-      sapply(seq(along=colnames(dataframe)),
-             function(n) {
-               tkadd(sortMenu, "command", label=colnames(dataframe)[n],
-                     command=function() sortColumn(colnames(dataframe)[n]))
-               label <- paste(colnames(dataframe)[n], "decreasing", sep=", ")
-               tkadd(sortMenu, "command", label=label,
-                     command=function() sortColumn(colnames(dataframe)[n],
-                       decreasing=TRUE))
-             })
-      rootx <- as.integer(tkwinfo("rootx", sortBut))
-      rooty <- as.integer(tkwinfo("rooty", sortBut))
-      tkpopup(sortMenu, rootx, rooty)
-    }
-
-    if (!is.null(plot.command)) {
-      but <- tkbutton(base, text=plot.text, command=plot.command)
-      tkgrid(but, "in"=pf, sticky="ew", column=10, row=1, padx=1, pady=1)
-    }
-
-    if (sort.button) { tkgrid(sortBut, "in"=pf, sticky="ew", column=10, row=2,
-                              padx=1, pady=1) }
-    tkconfigure(sortBut, command=sortPopup)
-
-    savebut <- tkbutton(base, text="Export table to file", command=function() {
-      filename <- tkgetSaveFile(initialfile="data.txt",
-                                defaultextension="txt",
-                                title="Export as table")
-      filename <- paste(as.character(filename), collapse=" ")
-      write.table(dataframe, file=filename, row.names=FALSE, col.names=FALSE)
-    })
-    tkgrid(savebut, "in"=pf, sticky="ew", column=10, row=3, padx=1, pady=1)
-
-    but <- tkbutton(base, text="Close", command=function() tkdestroy(base))
-    tkgrid(but, "in"=pf, sticky="ew", column=10, row=4, padx=1, pady=1) 
-    tkgrid.columnconfigure(pf, 0, weight=1)
-
-    tkgrid.rowconfigure(base, 1, weight = 1)
-    tkgrid.columnconfigure(base, 1, weight = 1)
-    tkwm.maxsize(base, 2 + datawidth, nrows)
-    tkwm.minsize(base, 2 + nchar(names(dataframe)[1]), 1)
-invisible(NULL)
-}
-
-.tkigraph.net.moody.white <-
-matrix( c(0,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          1,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          1,1,0,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
-          1,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          0,1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,
-          0,0,0,0,0,0,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,1,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,1,1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,1,0,0,
-          0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,1,0,1,1,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,0,1,0,0,
-          0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,1,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,
-          0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,0), nrow=23, ncol=23)
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/sparsedf.R igraph-0.6.5/interfaces/R/igraph/R/sparsedf.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/sparsedf.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/sparsedf.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,108 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-# This is a sparse data frame. It is like a regular data frame,
-# but it allows for some columns to be constant, and then it
-# stores that column more economically.
-
-sdf <- function(..., row.names = NULL, NROW = NULL) {
-  
-  cols <- list(...)
-  
-  if (is.null(names(cols)) || any(names(cols) == "") ||
-      any(duplicated(names(cols)))) {
-    stop("Columns must be have (unique) names")
-  }
-  
-  lens <- sapply(cols, length)
-  n1lens <- lens[ lens != 1 ]
-  
-  if (length(unique(n1lens)) > 1) {
-    stop("Columns must be constants or have the same length")
-  }
-  
-  if (length(n1lens) == 0) {
-    if (is.null(NROW)) {
-      stop("Cannot determine number of rows")
-    }
-    attr(cols, "NROW") <- NROW
-  } else {
-    if (!is.null(NROW) && n1lens[1] != NROW) {
-      stop("NROW does not match column lengths")
-    }
-    attr(cols, "NROW") <- unname(n1lens[1])
-  }
-
-  class(cols) <- "igraphSDF"
-  attr(cols, "row.names") <- row.names
-  
-  cols
-}
-
-as.data.frame.igraphSDF <- function(x, row.names, optional, ...) {
-  as.data.frame(lapply(x, rep, length.out=attr(x, "NROW")))
-}
-
-`[.igraphSDF` <- function(x, i, j, ..., drop=TRUE) {
-  if (!is.character(j)) {
-    stop("The column index must be character")
-  }
-  if (!missing(i) && !is.numeric(i)) {
-    stop("The row index must be numeric")
-  }
-  if (missing(i)) {
-    rep(x[[j]], length.out=attr(x, "NROW"))
-  } else {
-    if (length(x[[j]])==1) {
-      rep(x[[j]], length(i))
-    } else {
-      x[[j]][i]
-    }
-  }
-}
-
-`[<-.igraphSDF` <- function(x, i, j, value) {
-  if (!is.character(j)) {
-    stop("The column index must be character")
-  }
-  if (!missing(i) && !is.numeric(i)) {
-    stop("Row index must be numeric, if given")
-  }
-  if (missing(i)) {
-    if (length(value) != attr(x, "NROW") && length(value) != 1) {
-      stop("Replacement value has the wrong length")
-    }
-    x[[j]] <- value
-  } else {
-    if (length(value) != length(i) && length(value) != 1) {
-      stop("Replacement value has the wrong length")
-    }
-    tmp <- rep(x[[j]], length=attr(x, "NROW"))
-    tmp[i] <- value
-    if (length(unique(tmp)) == 1) {
-      tmp <- tmp[1]
-    }
-    x[[j]] <- tmp
-  }
-
-  x
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/structural.properties.R igraph-0.6.5/interfaces/R/igraph/R/structural.properties.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/structural.properties.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/structural.properties.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,1110 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Structural properties
-###################################################################
-
-diameter <- function(graph, directed=TRUE, unconnected=TRUE, weights=NULL) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_diameter", graph, as.logical(directed),
-        as.logical(unconnected), weights,
-        PACKAGE="igraph")
-}
-
-get.diameter <- function(graph, directed=TRUE, unconnected=TRUE,
-                         weights=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_get_diameter", graph, as.logical(directed),
-               as.logical(unconnected), weights,
-               PACKAGE="igraph")
-  res + 1
-}
-
-farthest.nodes <- function(graph, directed=TRUE, unconnected=TRUE,
-                           weights=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_farthest_points", graph, as.logical(directed),
-               as.logical(unconnected), weights,
-               PACKAGE="igraph")
-  res[1:2] <- res[1:2] + 1
-  res
-}       
-
-average.path.length <- function(graph, directed=TRUE, unconnected=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_average_path_length", graph, as.logical(directed),
-        as.logical(unconnected),
-        PACKAGE="igraph")
-}
-
-degree <- function(graph, v=V(graph),
-                   mode=c("all", "out", "in", "total"), loops=TRUE,
-                   normalized=FALSE){
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  v <- as.igraph.vs(graph, v)
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3, "total"=3)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_degree", graph, v-1,
-               as.numeric(mode), as.logical(loops), PACKAGE="igraph")
-  if (normalized) { res <- res / (vcount(graph)-1) }
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- V(graph)$name[v]
-  }
-  res
-}
-  
-degree.distribution <- function(graph, cumulative=FALSE, ...) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  cs <- degree(graph, ...)
-  hi <- hist(cs, -1:max(cs), plot=FALSE)$intensities
-  if (!cumulative) {
-    res <- hi
-  } else {
-    res <- rev(cumsum(rev(hi)))
-  }
-  
-  res
-}
-
-shortest.paths <- function(graph, v=V(graph), to=V(graph),
-                           mode=c("all", "out", "in"),
-                           weights=NULL,
-                           algorithm=c("automatic", "unweighted", "dijkstra",
-                             "bellman-ford", "johnson")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  v <- as.igraph.vs(graph, v)
-  to <- as.igraph.vs(graph, to)
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)  
-  algorithm <- igraph.match.arg(algorithm)
-  algorithm <- switch(algorithm, "automatic"=0, "unweighted"=1,
-                      "dijkstra"=2, "bellman-ford"=3, "johnson"=4)
-  
-  if (is.null(weights)) {
-    if ("weight" %in% list.edge.attributes(graph)) {
-      weights <- as.numeric(E(graph)$weight)
-    }
-  } else {
-    if (length(weights)==1 && is.na(weights)) {
-      weights <- NULL
-    } else {
-      weights <- as.numeric(weights)
-    }
-  }
-
-  if (! is.null(weights) && algorithm==1) {
-    weights <- NULL
-    warning("Unweighted algorithm chosen, weights ignored")
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_shortest_paths", graph, v-1, to-1,
-               as.numeric(mode), weights, as.numeric(algorithm),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    rownames(res) <- V(graph)$name[v]
-    colnames(res) <- V(graph)$name[to]
-  }
-  res
-}
-
-get.shortest.paths <- function(graph, from, to=V(graph),
-                               mode=c("out", "all", "in"),
-                               weights=NULL,
-                               output=c("vpath", "epath", "both")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-  output <- igraph.match.arg(output)
-  output <- switch(output, "vpath"=0, "epath"=1, "both"=2)
-
-  if (is.null(weights)) {
-    if ("weight" %in% list.edge.attributes(graph)) {
-      weights <- as.numeric(E(graph)$weight)
-    }
-  } else {
-    if (length(weights)==1 && is.na(weights)) {
-      weights <- NULL
-    } else {
-      weights <- as.numeric(weights)
-    }
-  }
-  
-  to <- as.igraph.vs(graph, to)-1
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_get_shortest_paths", graph,
-               as.igraph.vs(graph, from)-1, to, as.numeric(mode), as.numeric(length(to)),
-               weights, as.numeric(output), PACKAGE="igraph")
-
-  if (output !=2 ) {
-    res <- lapply(res, function(x) x+1)
-  } else {
-    res <- list(vpath=lapply(res$vpath, function(x) x+1),
-                epath=lapply(res$epath, function(x) x+1))
-  }
-  res
-}
-
-get.all.shortest.paths <- function(graph, from,
-                                   to=V(graph),
-                                   mode=c("out", "all", "in"),
-				   weights=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  if (is.null(weights)) {
-    if ("weight" %in% list.edge.attributes(graph)) {
-      weights <- as.numeric(E(graph)$weight)
-    }
-  } else {
-    if (length(weights)==1 && is.na(weights)) {
-      weights <- NULL
-    } else {
-      weights <- as.numeric(weights)
-    }
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  if (is.null(weights)) {
-    res <- .Call("R_igraph_get_all_shortest_paths", graph,
-                 as.igraph.vs(graph, from)-1, as.igraph.vs(graph, to)-1,
-                 as.numeric(mode), PACKAGE="igraph")
-  } else {
-    res <- .Call("R_igraph_get_all_shortest_paths_dijkstra", graph, 
-                 as.igraph.vs(graph, from)-1, as.igraph.vs(graph, to)-1,
-                 weights, as.numeric(mode), PACKAGE="igraph")
-  }       
-  res
-}
-
-subcomponent <- function(graph, v, mode=c("all", "out", "in")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_subcomponent", graph, as.igraph.vs(graph, v)-1,
-               as.numeric(mode),
-               PACKAGE="igraph")
-  res+1
-}
-
-subgraph <- function(graph, v) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_subgraph", graph, as.igraph.vs(graph, v)-1,
-        PACKAGE="igraph")
-}
-
-betweenness <- function(graph, v=V(graph), directed=TRUE, weights=NULL,
-                        nobigint=TRUE, normalized=FALSE) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  v <- as.igraph.vs(graph, v)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_betweenness", graph, v-1,
-               as.logical(directed), weights, as.logical(nobigint),
-               PACKAGE="igraph")
-  if (normalized) {
-    vc <- vcount(graph)
-    res <- 2*res / ( vc*vc-3*vc+2)
-  }
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- V(graph)$name[v]
-  }
-  res
-}
-
-transitivity <- function(graph, type=c("undirected", "global", "globalundirected",
-                                  "localundirected", "local", "average",
-                                  "localaverage", "localaverageundirected",
-                                  "barrat", "weighted"),
-                         vids=NULL, weights=NULL, isolates=c("NaN", "zero")) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  type <- igraph.match.arg(type)
-  type <- switch(type, "undirected"=0, "global"=0, "globalundirected"=0,
-                 "localundirected"=1, "local"=1, "average"=2,
-                 "localaverage"=2, "localaverageundirected"=2, "barrat"=3,
-                 "weighted"=3)
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    weights <- E(graph)$weight
-  }
-  if (!is.null(weights) && any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    weights <- NULL
-  }
-
-  isolates <- igraph.match.arg(isolates)
-  isolates <- as.double(switch(isolates, "nan"=0, "zero"=1))
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  if (type==0) {
-    .Call("R_igraph_transitivity_undirected", graph, isolates,
-          PACKAGE="igraph")
-  } else if (type==1) {
-    if (is.null(vids)) {
-      .Call("R_igraph_transitivity_local_undirected_all", graph, isolates,
-            PACKAGE="igraph")
-    } else {
-      vids <- as.igraph.vs(graph, vids)-1
-      .Call("R_igraph_transitivity_local_undirected", graph, vids,
-            isolates, PACKAGE="igraph")
-    }
-  } else if (type==2) {
-    .Call("R_igraph_transitivity_avglocal_undirected", graph, isolates,
-          PACKAGE="igraph")
-  } else if (type==3) {
-    if (is.null(vids)) { vids <- V(graph) }
-    vids <- as.igraph.vs(graph, vids)-1
-    if (is.null(weights)) {
-      .Call("R_igraph_transitivity_local_undirected", graph, vids,
-            isolates, PACKAGE="igraph")
-    } else { 
-      .Call("R_igraph_transitivity_barrat", graph, vids, weights,
-            isolates, PACKAGE="igraph")
-    }
-  }
-}
-
-## Generated by stimulus now
-## graph.laplacian <- function(graph, normalized=FALSE) {
-
-##   if (!is.igraph(graph)) {
-##     stop("Not a graph object")
-##   }
-  
-##   on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-##   .Call("R_igraph_laplacian", graph, as.logical(normalized),
-##         PACKAGE="igraph")
-## }
-  
-## OLD implementation
-## graph.laplacian <- function(graph, normalized=FALSE) {
-
-##   if (!is.igraph(graph)) {
-##     stop("Not a graph object")
-##   }
-##   if (is.directed(graph)) {
-##     warning("Laplacian of a directed graph???")
-##   }
-
-##   M <- get.adjacency(graph)
-##   if (!normalized) {
-##     M <- structure(ifelse(M>0, -1, 0), dim=dim(M))
-##     diag(M) <- degree(graph)
-##   } else {
-##     deg <- degree(graph)
-##     deg <- outer(deg, deg, "*")
-##     M <- structure(ifelse(M>0, -1/deg, 0))
-##     diag(M) <- 1
-##   }
-  
-##   M
-## }
-
-## Structural holes a'la Burt, code contributed by
-## Jeroen Bruggeman
-
-## constraint.orig <- function(graph, nodes=V(graph), attr=NULL) {
-
-##   if (!is.igraph(graph)) {
-##     stop("Not a graph object")
-##   }
-
-##   idx <- degree(graph) != 0
-##   A <- get.adjacency(graph, attr=attr)
-##   A <- A[idx, idx]
-##   n <- sum(idx)
-  
-##   one <- c(rep(1,n))
-##   CZ <- A + t(A)
-##   cs <- CZ %*% one                      # degree of vertices
-##   ics <- 1/cs
-##   CS <- ics %*% t(one)                  # 1/degree of vertices
-##   P <- CZ * CS  #intermediate result: proportionate tie strengths
-##   PSQ <- P%*%P #sum paths of length two
-##   P.bi <- as.numeric(P>0)  #exclude paths to non-contacts (& reflexive):
-##   PC <- (P + (PSQ*P.bi))^2  #dyadic constraint
-##   ci <- PC %*% one      #overall constraint
-##   dim(ci) <- NULL
-
-##   ci2 <- numeric(vcount(graph))
-##   ci2[idx] <- ci
-##   ci2[!idx] <- NaN
-##   ci2[nodes+1]
-## }
-
-## Newest implementation, hopefully correct, there is a C implementation
-## now so we don't need this
-
-## constraint.old <- function(graph, nodes=V(graph)) {
-
-##   if (!is.igraph(graph)) {
-##     stop("Not a graph object")
-##   }
-
-##   nodes <- as.numeric(nodes)
-##   res <- numeric(length(nodes))
-##   deg <- degree(graph, mode="all", loops=FALSE)
-
-##   not <- function(i, v) v[ v!=i ]
-
-##   for (a in seq(along=nodes)) {
-##     i <- nodes[a]
-    
-##     first <- not(i, neighbors(graph, i, mode="all"))
-##     first <- unique(first)
-##     for (b in seq(along=first)) {
-##       j <- first[b]
-
-##       ## cj is the contribution of j
-##       cj <- are.connected(graph, i, j)      / deg[i+1]
-##       cj <- cj + are.connected(graph, j, i) / deg[i+1]
-
-##       second <- not(i, not(j, neighbors(graph, j, mode="all")))
-##       for (c in seq(along=second)) {
-##         q <- second[c]
-##         cj <- cj + are.connected(graph, i, q) / deg[q+1] / deg[i+1]
-##         cj <- cj + are.connected(graph, q, i) / deg[q+1] / deg[i+1]
-##       }
-                            
-##       ## Ok, we have the total contribution of j
-##       res[a] <- res[a] + cj*cj
-##     }
-##   }
-
-##   if (!is.directed(graph)) {
-##     res <- res/4
-##   }
-##   res
-## }
-
-constraint <- function(graph, nodes=V(graph), weights=NULL) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  nodes <- as.igraph.vs(graph, nodes)
-  
-  if (is.null(weights)) {
-    if ("weight" %in% list.edge.attributes(graph)) {
-      weights <- E(graph)$weight
-    }
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_constraint", graph, nodes-1, as.numeric(weights),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- V(graph)$name[nodes]
-  }
-  res
-}
-
-reciprocity <- function(graph, ignore.loops=TRUE,
-                        mode=c("default", "ratio")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- switch(igraph.match.arg(mode), 'default'=0, 'ratio'=1)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_reciprocity", graph, as.logical(ignore.loops),
-        as.numeric(mode), PACKAGE="igraph")
-}
-
-rewire <- function(graph, mode=c("simple", "loops"), niter=100) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "simple"=0, "loops"=1)
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_rewire", graph, as.numeric(niter), as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-bonpow.dense <- function(graph, nodes=V(graph),
-                         loops=FALSE, exponent=1,
-                         rescale=FALSE, tol=1e-7){
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }  
-  
-  d <- get.adjacency(graph)
-  if (!loops) {
-    diag(d) <- 0
-  }
-  n <- vcount(graph)
-  id <- matrix(0,nrow=n,ncol=n)
-  diag(id) <- 1
-
-#  ev <- apply(solve(id-exponent*d,tol=tol)%*%d,1,sum)
-  ev <- solve(id-exponent*d, tol=tol) %*% apply(d,1,sum)
-  if(rescale) {
-    ev <- ev/sum(ev)
-  } else {
-    ev <- ev*sqrt(n/sum((ev)^2))
-  } 
-  ev[as.numeric(nodes)]
-}
-
-bonpow.sparse <- function(graph, nodes=V(graph), loops=FALSE,
-                          exponent=1, rescale=FALSE, tol=1e-07) {
-
-  ## remove loops if requested
-  if (!loops) {
-    graph <- simplify(graph, remove.multiple=FALSE, remove.loops=TRUE)
-  }
-
-  vg <- vcount(graph)
-  
-  ## sparse adjacency matrix
-  d <- get.adjacency(graph, sparse=TRUE)
-
-  ## sparse identity matrix
-  id <- Diagonal(vg)
-
-  ## solve it
-  ev <- solve(id - exponent * d, degree(graph, mode="out"), tol=tol)
-
-  if (rescale) {
-    ev <- ev/sum(ev)
-  } else {
-    ev <- ev * sqrt(vcount(graph)/sum((ev)^2))
-  }
-
-  ev[as.numeric(nodes)]
-}
-
-bonpow <- function(graph, nodes=V(graph),
-                   loops=FALSE, exponent=1,
-                   rescale=FALSE, tol=1e-7, sparse=TRUE){
-
-  nodes <- as.igraph.vs(graph, nodes)
-  if (sparse && require(Matrix)) {
-    res <- bonpow.sparse(graph, nodes, loops, exponent, rescale, tol)
-  }  else {
-    res <- bonpow.dense(graph, nodes, loops, exponent, rescale, tol)
-  }
-
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- get.vertex.attribute(graph, "name", nodes)
-  }
-  
-  res
-}
-
-alpha.centrality.dense <- function(graph, nodes=V(graph), alpha=1,
-                                   loops=FALSE, exo=1, weights=NULL,
-                                   tol=1e-7) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  exo <- rep(exo, length=vcount(graph))
-  exo <- matrix(exo, ncol=1)
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    ## weights == NULL and there is a "weight" edge attribute
-    attr <- "weight"
-  } else if (is.null(weights)) {
-    ## weights == NULL, but there is no "weight" edge attribute
-    attr <- NULL
-  } else if (is.character(weights) && length(weights)==1) {
-    ## name of an edge attribute, nothing to do
-    attr <- "weight"
-  } else if (any(!is.na(weights))) {
-    ## weights != NULL and weights != rep(NA, x)
-    graph <- set.edge.attribute(graph, "weight", value=as.numeric(weights))
-    attr <- "weight"
-  } else {
-    ## weights != NULL, but weights == rep(NA, x)
-    attr <- NULL
-  }
-
-  d <- t(get.adjacency(graph, attr=attr, sparse=FALSE))
-  if (!loops) {
-    diag(d) <- 0
-  }
-  n <- vcount(graph)
-  id <- matrix(0, nrow=n, ncol=n)
-  diag(id) <- 1
-  
-  ev <- solve(id-alpha*d, tol=tol) %*% exo
-  ev[as.numeric(nodes)]
-}
-
-alpha.centrality.sparse <- function(graph, nodes=V(graph), alpha=1,
-                                   loops=FALSE, exo=1, weights=NULL,
-                                   tol=1e-7) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  vc <- vcount(graph)
-
-  if (!loops) {
-    graph <- simplify(graph, remove.multiple=FALSE, remove.loops=TRUE)
-  }  
-
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) {
-    ## weights == NULL and there is a "weight" edge attribute
-    weights <- E(graph)$weight
-  } else if (is.null(weights)) {
-    ## weights == NULL, but there is no "weight" edge attribute
-    weights <- rep(1, ecount(graph))
-  } else if (is.character(weights) && length(weights)==1) {
-    weights <- get.edge.attribute(graph, weights)
-  } else if (any(!is.na(weights))) {
-    weights <- as.numeric(weights)
-  } else {
-    ## weights != NULL, but weights == rep(NA, x)
-    weights <- rep(1, ecount(graph))
-  } 
-  
-  el <- get.edgelist(graph, names=FALSE)
-  M <- sparseMatrix(dims=c(vc, vc), i=el[,2], j=el[,1], x=weights)
-  M <- as(M, "dgCMatrix")
-  
-  ## Create an identity matrix
-  M2 <- sparseMatrix(dims=c(vc, vc), i=1:vc, j=1:vc, x=rep(1, vc))
-  M2 <- as(M2, "dgCMatrix")
-
-  ## exo
-  exo <- cbind(rep(exo, length=vc))
-
-  ## Solve the equation
-  M3 <- M2-alpha*M
-  r <- solve(M3, tol=tol, exo)
-  
-  r[ as.numeric(nodes)]
-}
-
-alpha.centrality <- function(graph, nodes=V(graph), alpha=1,
-                             loops=FALSE, exo=1, weights=NULL,
-                             tol=1e-7, sparse=TRUE) {
-
-  nodes <- as.igraph.vs(graph, nodes)
-  if (sparse && require(Matrix)) {
-    res <- alpha.centrality.sparse(graph, nodes, alpha, loops,
-                                   exo, weights, tol)
-  } else {
-    res <- alpha.centrality.dense(graph, nodes, alpha, loops,
-                                  exo, weights, tol)
-  }
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- get.vertex.attribute(graph, "name", nodes)
-  }
-  res
-}
-
-
-graph.density <- function(graph, loops=FALSE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }  
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_density", graph, as.logical(loops),
-        PACKAGE="igraph")
-}
-
-neighborhood.size <- function(graph, order, nodes=V(graph),
-                              mode=c("all", "out", "in")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_neighborhood_size", graph, 
-        as.igraph.vs(graph, nodes)-1, as.numeric(order), as.numeric(mode),
-        PACKAGE="igraph")
-}
-
-neighborhood <- function(graph, order, nodes=V(graph), mode=c("all", "out", "in")) {
-  
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_neighborhood", graph, 
-               as.igraph.vs(graph, nodes)-1, as.numeric(order),
-               as.numeric(mode),
-               PACKAGE="igraph")
-  res <- lapply(res, function(x) x+1)
-  res
-}
-
-graph.neighborhood <- function(graph, order, nodes=V(graph),
-                               mode=c("all", "out", "in")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_neighborhood_graphs", graph, 
-               as.igraph.vs(graph, nodes)-1, as.numeric(order),
-               as.numeric(mode),
-               PACKAGE="igraph")
-  res
-}
-
-graph.coreness <- function(graph, mode=c("all", "out", "in")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_coreness", graph, as.numeric(mode),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- get.vertex.attribute(graph, "name")
-  }
-  res
-}
-
-topological.sort <- function(graph, mode=c("out", "all", "in")) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode, "out"=1, "in"=2, "all"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_topological_sorting", graph, as.numeric(mode),
-               PACKAGE="igraph")
-  res+1
-}
-
-girth <- function(graph, circle=TRUE) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_girth", graph, as.logical(circle),
-        PACKAGE="igraph")
-}
-
-is.loop <- function(graph, eids=E(graph)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_is_loop", graph, as.igraph.es(graph, eids)-1,
-        PACKAGE="igraph")
-}
-
-is.multiple <- function(graph, eids=E(graph)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_is_multiple", graph, as.igraph.es(graph, eids)-1,
-        PACKAGE="igraph")
-}
-
-count.multiple <- function(graph, eids=E(graph)) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_count_multiple", graph, as.igraph.es(graph, eids)-1,
-        PACKAGE="igraph")
-}
-
-graph.bfs <- function(graph, root, neimode=c("out", "in", "all", "total"),
-                      unreachable=TRUE, restricted=NULL,
-                      order=TRUE, rank=FALSE, father=FALSE,
-                      pred=FALSE, succ=FALSE, dist=FALSE,
-                      callback=NULL, extra=NULL, rho=parent.frame()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  if (length(root)==1) {
-    root <- as.igraph.vs(graph, root)-1
-    roots <- NULL    
-  } else {
-    root <- as.igraph.vs(graph, 0)      # ignored anyway
-    roots <- as.igraph.vs(graph, root)
-  }
-  neimode <- switch(igraph.match.arg(neimode),
-                    "out"=1, "in"=2, "all"=3, "total"=3)
-  unreachable <- as.logical(unreachable)
-  if (!is.null(restricted)) { restricted <- as.igraph.vs(graph, restricted) }
-  if (!is.null(callback)) { callback <- as.function(callback) }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_bfs", graph, root, roots, neimode, unreachable,
-               restricted,
-               as.logical(order), as.logical(rank), as.logical(father),
-               as.logical(pred), as.logical(succ), as.logical(dist),
-               callback, extra, rho,
-               PACKAGE="igraph")
-  
-  if (order)  res$order  <- res$order+1
-  if (rank)   res$rank   <- res$rank+1
-  if (father) res$father <- res$father+1
-  if (pred)   res$pred   <- res$pred+1
-  if (succ)   res$succ   <- res$succ+1
-  res
-}
-
-graph.dfs <- function(graph, root, neimode=c("out", "in", "all", "total"),
-                      unreachable=TRUE,
-                      order=TRUE, order.out=FALSE, father=FALSE, dist=FALSE,
-                      in.callback=NULL, out.callback=NULL, extra=NULL,
-                      rho=parent.frame()) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object");
-  }
-
-  root <- as.igraph.vs(graph, root)-1
-  neimode <- switch(igraph.match.arg(neimode),
-                    "out"=1, "in"=2, "all"=3, "total"=3)
-  unreachable <- as.logical(unreachable)
-  if (!is.null(in.callback)) { in.callback <- as.function(in.callback) }
-  if (!is.null(out.callback)) { out.callback <- as.function(out.callback) }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_dfs", graph, root, neimode, unreachable,
-               as.logical(order), as.logical(order.out), as.logical(father),
-               as.logical(dist), in.callback, out.callback, extra, rho,
-               PACKAGE="igraph")
-  
-  if (order)     res$order     <- res$order+1
-  if (order.out) res$order.out <- res$order.out+1
-  if (father)    res$father    <- res$father+1
-  res
-}
-
-edge.betweenness <- function(graph, e=E(graph),
-                             directed=TRUE, weights=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  e <- as.igraph.es(graph, e)
-  directed <- as.logical(directed)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-  weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-  weights <- as.numeric(weights) 
-  } else { 
-  weights <- NULL 
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_edge_betweenness", graph, directed, weights,
-        PACKAGE="igraph")
-  res[as.numeric(e)]
-}
-
-edge.betweenness.estimate <- function(graph, e=E(graph),
-                                      directed=TRUE, cutoff, weights=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  e <- as.igraph.es(graph, e)
-  directed <- as.logical(directed)
-  cutoff <- as.numeric(cutoff)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-  weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-  weights <- as.numeric(weights) 
-  } else { 
-  weights <- NULL 
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_edge_betweenness_estimate", graph, directed, cutoff, weights,
-        PACKAGE="igraph")
-  res[as.numeric(e)]
-}
-
-clusters <- function(graph, mode=c("weak", "strong")) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  mode <- switch(igraph.match.arg(mode), "weak"=1, "strong"=2)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_clusters", graph, mode,
-        PACKAGE="igraph")
-  res$membership <- res$membership + 1
-  res
-}
-
-unfold.tree <- function(graph, mode=c("all", "out", "in", "total"), roots) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  mode <- switch(igraph.match.arg(mode), "out"=1, "in"=2, "all"=3, "total"=3)
-  roots <- as.igraph.vs(graph, roots)-1
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_unfold_tree", graph, mode, roots,
-        PACKAGE="igraph")
-  res
-}
-
-closeness <- function(graph, vids=V(graph),
-                      mode=c("out", "in", "all", "total"), weights=NULL,
-                      normalized=FALSE) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  vids <- as.igraph.vs(graph, vids)
-  mode <- switch(igraph.match.arg(mode), "out"=1, "in"=2, "all"=3, "total"=3)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-  weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-  weights <- as.numeric(weights) 
-  } else { 
-  weights <- NULL 
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_closeness", graph, vids-1, mode, weights,
-               PACKAGE="igraph")
-  if (!normalized) { res <- res / (vcount(graph)-1) }
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    names(res) <- V(graph)$name[vids]
-  }
-  res
-}
-
-graph.laplacian <- function(graph, normalized=FALSE, weights=NULL,
-                            sparse=getIgraphOpt("sparsematrices")) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  normalized <- as.logical(normalized)
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-    weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-    weights <- as.numeric(weights) 
-  } else { 
-    weights <- NULL 
-  }
-  sparse <- as.logical(sparse)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_laplacian", graph, normalized, weights, sparse,
-               PACKAGE="igraph")
-  if (sparse) {
-    res <- igraph.i.spMatrix(res)
-  }
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    rownames(res) <- colnames(res) <- V(graph)$name
-  }
-  res
-}
-
-is.matching <- function(graph, matching, types=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(types) && "type" %in% list.vertex.attributes(graph)) { 
-    types <- V(graph)$type 
-  } 
-  if (!is.null(types)) { 
-    types <- as.logical(types) 
-  }
-  matching <- as.igraph.vs(graph, matching, na.ok=TRUE)-1
-  matching[ is.na(matching) ] <- -1
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_is_matching", graph, types, matching,
-        PACKAGE="igraph")
-
-  res
-}
-
-is.maximal.matching <- function(graph, matching, types=NULL) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(types) && "type" %in% list.vertex.attributes(graph)) { 
-    types <- V(graph)$type 
-  } 
-  if (!is.null(types)) { 
-    types <- as.logical(types) 
-  }
-  matching <- as.igraph.vs(graph, matching, na.ok=TRUE)-1
-  matching[ is.na(matching) ] <- -1
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_is_maximal_matching", graph, types, matching,
-        PACKAGE="igraph")
-
-  res
-}
-
-maximum.bipartite.matching <- function(graph, types=NULL, weights=NULL,
-                                       eps=.Machine$double.eps) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  if (is.null(types) && "type" %in% list.vertex.attributes(graph)) { 
-    types <- V(graph)$type 
-  } 
-  if (!is.null(types)) { 
-    types <- as.logical(types) 
-  }
-  if (is.null(weights) && "weight" %in% list.edge.attributes(graph)) { 
-    weights <- E(graph)$weight 
-  } 
-  if (!is.null(weights) && any(!is.na(weights))) { 
-    weights <- as.numeric(weights) 
-  } else { 
-    weights <- NULL 
-  }
-  eps <- as.numeric(eps)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_maximum_bipartite_matching", graph, types, weights,
-               eps,
-               PACKAGE="igraph")
-
-  res$matching[ res$matching==0 ] <- NA
-  if (getIgraphOpt("add.vertex.names") && is.named(graph)) {
-    res$matching <- V(graph)$name[res$matching]
-    names(res$matching) <- V(graph)$name
-  }
-  res
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/structure.generators.R igraph-0.6.5/interfaces/R/igraph/R/structure.generators.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/structure.generators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/structure.generators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,880 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-graph <- function( edges, n=max(edges), directed=TRUE ) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_create", as.numeric(edges)-1, as.numeric(n),
-        as.logical(directed),
-        PACKAGE="igraph")
-}
-
-graph.formula <- function(..., simplify=TRUE) {
-  mf <- as.list(match.call())[-1]
-
-  ## Operators first
-  f <- function(x) {
-    if (is.call(x)) {
-      return (list(as.character(x[[1]]), lapply(x[-1], f)))
-    } else {
-      return (NULL)
-    }
-  }
-  ops <- unlist(lapply(mf, f))
-  if (all(ops %in% c("-", ":"))) {
-    directed <- FALSE
-  } else if (all(ops %in% c("-", "+", ":"))) {
-    directed <- TRUE
-  } else {
-    stop("Invalid operator in formula")
-  }
-
-  f <- function(x) {
-    if (is.call(x)) {
-      if (length(x)==3) {
-        return( list(f(x[[2]]), op=as.character(x[[1]]), f(x[[3]])) )
-      } else {
-        return( list(op=as.character(x[[1]]), f(x[[2]])) )
-      }
-    } else {
-      return( c(sym=as.character(x)) )
-    }
-  }
-  
-  ret <- lapply(mf, function(x) unlist(f(x)))
-
-  v <- unique(unlist(lapply(ret, function(x) { x[ names(x)=="sym" ] })))
-
-  ## Merge symbols for ":"
-  ret <- lapply(ret, function(x) {
-    res <- list()
-    for (i in seq(along=x)) {
-      if (x[i]==":" && names(x)[i]=="op") {
-        ## SKIP
-      } else if (i>1 && x[i-1]==":" && names(x)[i-1]=="op") {
-        res[[length(res)]] <- c(res[[length(res)]], unname(x[i]))
-      } else {
-        res <- c(res, x[i])
-      }
-    }
-    res
-  })
-
-  ## Ok, create the edges
-  edges <- numeric()
-  for (i in seq(along=ret)) {
-    prev.sym <- character()
-    lhead <- rhead <- character()
-    for (j in seq(along=ret[[i]])) {
-      act <- ret[[i]][[j]]
-      if (names(ret[[i]])[j]=="op") {
-        if (length(lhead)==0) {
-          lhead <- rhead <- act
-        } else {
-          rhead <- act
-        }
-      } else if (names(ret[[i]])[j]=="sym") {
-        for (ps in prev.sym) {
-          for (ps2 in act) {
-            if (lhead=="+") {
-              edges <- c(edges, unname(c(ps2, ps)))
-            }            
-            if (!directed || rhead=="+") {
-              edges <- c(edges, unname(c(ps, ps2)))
-            }
-          }
-        }
-        lhead <- rhead <- character()
-        prev.sym <- act
-      }
-    }
-  }
-
-  ids <- seq(along=v)
-  names(ids) <- v
-  res <- graph( unname(ids[edges]), n=length(v), directed=directed)
-  if (simplify) res <- simplify(res)
-  res <- set.vertex.attribute(res, "name", value=v)
-  res
-}
-
-graph.adjacency.dense <- function(adjmatrix, mode=c("directed", "undirected", "max",
-                                               "min", "upper", "lower", "plus"),
-                                  weighted=NULL, diag=TRUE) {
-
-  mode <- igraph.match.arg(mode)
-  mode <- switch(mode,
-                 "directed"=0,
-                 "undirected"=1,
-                 "max"=1,
-                 "upper"=2,
-                 "lower"=3,
-                 "min"=4,
-                 "plus"=5)
-  
-  if (!is.null(weighted)) {
-    if (is.logical(weighted) && weighted) {
-      weighted <- "weight"
-    }
-    if (!is.character(weighted)) {
-      stop("invalid value supplied for `weighted' argument, please see docs.")
-    }
-
-    if (nrow(adjmatrix) != ncol(adjmatrix)) {
-      stop("not a square matrix")
-    }
-
-    mode(adjmatrix) <- "numeric"
-    
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_weighted_adjacency", adjmatrix,
-                 as.numeric(mode), weighted, diag,
-                 PACKAGE="igraph")
-  } else {
-    
-    adjmatrix <- as.matrix(adjmatrix)
-    attrs <- attributes(adjmatrix)
-    adjmatrix <- as.numeric(adjmatrix)
-    attributes(adjmatrix) <- attrs
-
-    if (!diag) { diag(adjmatrix) <- 0 }
-    
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    res <- .Call("R_igraph_graph_adjacency", adjmatrix, as.numeric(mode),
-                 PACKAGE="igraph")
-  }
-
-  res
-}
-
-graph.adjacency.sparse <- function(adjmatrix, mode=c("directed", "undirected", "max",
-                                                "min", "upper", "lower", "plus"),
-                                   weighted=NULL, diag=TRUE) {
-
-  require(Matrix)
-  
-  mode <- igraph.match.arg(mode)
-
-  if (!is.null(weighted)) {
-    if (is.logical(weighted) && weighted) {
-      weighted <- "weight"
-    }
-    if (!is.character(weighted)) {
-      stop("invalid value supplied for `weighted' argument, please see docs.")
-    }
-  }
-  
-  if (nrow(adjmatrix) != ncol(adjmatrix)) {
-    stop("not a square matrix")
-  }
-
-  vc <- nrow(adjmatrix)
-
-  ## to remove non-redundancies that can persist in a dgtMatrix
-  if(inherits(adjmatrix, "dgTMatrix")) {
-    adjmatrix = as(adjmatrix, "CsparseMatrix")
-  }
-  
-  if (is.null(weighted) && mode=="undirected") { mode <- "max" }
-  
-  if (mode == "directed") {
-    ## DIRECTED
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    if (!diag) { el <- el[ el[,1] != el[,2], ] }      
-  } else if (mode == "undirected") {
-    ## UNDIRECTED, must be symmetric if weighted
-    if (!is.null(weighted) &&
-        !selectMethod("isSymmetric", "sparseMatrix")(adjmatrix)) {
-      stop("Please supply a symmetric matrix if you want to create a weighted graph with mode=UNDIRECTED.")
-    }
-    if (diag) {
-      adjmatrix <- tril(adjmatrix)
-    } else {
-      adjmatrix <- tril(adjmatrix, -1)
-    }      
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-  } else if (mode=="max") {
-    ## MAXIMUM
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    rm(adjmatrix)
-    if (!diag) { el <- el[ el[,1] != el[,2], ] }
-    el <- el[ el[,3] != 0, ]
-    w <- el[,3]
-    el <- el[,1:2]
-    el <- cbind( pmin(el[,1],el[,2]), pmax(el[,1], el[,2]) )
-    o <- order(el[,1], el[,2])
-    el <- el[o,]
-    w <- w[o]
-    dd <- el[2:nrow(el),1] == el[1:(nrow(el)-1),1] &
-          el[2:nrow(el),2] == el[1:(nrow(el)-1),2]
-    dd <- which(dd)
-    if (length(dd)>0) {
-      mw <- pmax(w[dd], w[dd+1])
-      w[dd] <- mw
-      w[dd+1] <- mw
-      el <- el[-dd,]
-      w <- w[-dd]
-    }
-    el <- cbind(el, w)
-    rm(w,dd)
-  } else if (mode=="upper") {
-    ## UPPER
-    if (diag) {
-      adjmatrix <- triu(adjmatrix)
-    } else {
-      adjmatrix <- triu(adjmatrix, 1)
-    }
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    rm(adjmatrix)
-    if (!diag) { el <- el[ el[,1] != el[,2], ] }      
-  } else if (mode=="lower") {
-    ## LOWER
-    if (diag) {
-      adjmatrix <- tril(adjmatrix)
-    } else {
-      adjmatrix <- tril(adjmatrix, -1)
-    }
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    rm(adjmatrix)
-    if (!diag) { el <- el[ el[,1] != el[,2], ] }      
-  } else if (mode=="min") {
-    ## MINIMUM
-    adjmatrix <- sign(adjmatrix) * sign(Matrix::t(adjmatrix)) * adjmatrix
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    if (!diag) { el <- el[ el[,1] != el[,2], ] }
-    el <- el[ el[,3] != 0, ]
-    w <- el[,3]
-    el <- el[,1:2]
-    el <- cbind( pmin(el[,1],el[,2]), pmax(el[,1], el[,2]) )
-    o <- order(el[,1], el[,2])
-    el <- el[o,]
-    w <- w[o]
-    dd <- el[2:nrow(el),1] == el[1:(nrow(el)-1),1] &
-          el[2:nrow(el),2] == el[1:(nrow(el)-1),2]
-    dd <- which(dd)
-    if (length(dd)>0) {
-      mw <- pmin(w[dd], w[dd+1])
-      w[dd] <- mw
-      w[dd+1] <- mw
-      el <- el[-dd,]
-      w <- w[-dd]
-    }
-    el <- cbind(el, w)
-    rm(w,dd)
-  } else if (mode=="plus") {
-    ## PLUS
-    adjmatrix <- adjmatrix + Matrix::t(adjmatrix)
-    if (diag) {
-      adjmatrix <- tril(adjmatrix)
-    } else {
-      adjmatrix <- tril(adjmatrix, -1)
-    }
-    el <- selectMethod("summary", "sparseMatrix")(adjmatrix)
-    if (diag) {
-      loop <- el[,1] == el[,2]
-      el[loop,3] <- el[loop,3] / 2
-    }
-    el <- el[ el[,3] != 0, ]
-    rm(adjmatrix)
-  }
-
-  if (!is.null(weighted)) {
-    res <- graph.empty(n=vc, directed=(mode=="directed"))
-    weight <- list(el[,3])
-    names(weight) <- weighted
-    res <- add.edges(res, edges=t(as.matrix(el[,1:2])), attr=weight)
-  } else {
-    edges <- unlist(apply(el, 1, function(x) rep(unname(x[1:2]), x[3])))
-    res <- graph(n=vc, edges, directed=(mode=="directed"))
-  }
-  res
-}
-
-graph.adjacency <- function(adjmatrix, mode=c("directed", "undirected", "max",
-                                         "min", "upper", "lower", "plus"),
-                            weighted=NULL, diag=TRUE,
-                            add.colnames=NULL, add.rownames=NA) {
-
-  if (inherits(adjmatrix, "Matrix")) {
-    res <- graph.adjacency.sparse(adjmatrix, mode=mode, weighted=weighted, diag=diag)
-  } else {
-    res <- graph.adjacency.dense(adjmatrix, mode=mode, weighted=weighted, diag=diag)
-  }    
-  
-  ## Add columns and row names as attributes
-  if (is.null(add.colnames)) {
-    if (!is.null(colnames(adjmatrix))) {
-      add.colnames <- "name"
-    } else {
-      add.colnames <- NA
-    }
-  } else if (!is.na(add.colnames)) {
-    if (is.null(colnames(adjmatrix))) {
-      warning("No column names to add")
-      add.colnames <- NA
-    }
-  }
-  
-  if (is.null(add.rownames)) {
-    if (!is.null(rownames(adjmatrix))) {
-      add.rownames <- "name"
-    } else {
-      add.colnames <- NA
-    }
-  } else if (!is.na(add.rownames)) {
-    if (is.null(rownames(adjmatrix))) {
-      warning("No row names to add")
-      add.rownames <- NA
-    }
-  }
-
-  if (!is.na(add.rownames) && !is.na(add.colnames) &&
-      add.rownames == add.colnames ) {
-    warning("Same attribute for columns and rows, row names are ignored")
-    add.rownames <- NA
-  }
-
-  if (!is.na(add.colnames)) {
-    res <- set.vertex.attribute(res, add.colnames, value=colnames(adjmatrix))
-  }
-  if (!is.na(add.rownames)) {
-    res <- set.vertex.attribute(res, add.rownames, value=rownames(adjmatrix))
-  }
-
-  res
-}
-  
-
-graph.star <- function(n, mode=c("in", "out", "mutual", "undirected"),
-                       center=1 ) {
-
-  mode <- igraph.match.arg(mode)
-  mode1 <- switch(mode, "out"=0, "in"=1, "undirected"=2, "mutual"=3)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_star", as.numeric(n), as.numeric(mode1),
-               as.numeric(center)-1,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- switch(mode, "in"="In-star", "out"="Out-star", "Star")
-    res$mode <- mode
-    res$center <- center
-  }
-  res
-}
-
-graph.full <- function(n, directed=FALSE, loops=FALSE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_full", as.numeric(n), as.logical(directed),
-               as.logical(loops),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Full graph"
-    res$loops <- loops
-  }
-  res
-}
-
-###################################################################
-# Lattices, every kind
-###################################################################
-
-graph.lattice <- function(dimvector=NULL,length=NULL, dim=NULL, nei=1,
-                          directed=FALSE, mutual=FALSE, circular=FALSE, ...) {
-
-##   # Check
-##   if (is.null(dimvector) && (is.null(length) || is.null(dim))) {
-##     stop("Either `length' and `dim' or 'dimvector' must be set. See docs.")
-##   }
-##   if (!is.null(length) && length < 1) {
-##     stop("Invalid `length' argument, should be at least one")
-##   }
-##   if (!is.null(length) && dim < 1) {
-##     stop("Invalid `dim' argument, should be at least one")
-##   }
-##   if (!is.null(length) && any(dimvector < 1)) {
-##     stop("Invalid `dimvector', has negative or smaller than one elements")
-##   }
-##   if (mutual && !directed) {
-##     warning("`mutual' specified for undirected graph, proceeding with multiplex edges...")
-##   }
-##   if (nei < 1) {
-##     stop("`nei' should be at least one")
-##   }
-  
-##   if (!is.null(length)) {
-##     length <- as.numeric(length)
-##     dim <- as.numeric(dim)
-##     dimvector <- rep(length, times=dim)
-##   } else {
-##     dimvector <- as.numeric(dimvector)
-##   }
-##   nei <- as.numeric(nei)
-
-##   n <- prod(dimvector)
-##   res <- graph.empty(n=n, directed=directed, ...)
-##   res <- add.edges(res, .Call("REST_create_lattice", dimvector, n,
-##                               circular, mutual, PACKAGE="igraph"))
-
-##   # Connect also to local neighborhood
-##   if (nei >= 2) {
-##     neighbors <- lapply(1:length(res), function(a) get.neighborhood(res, a))
-##     res <- add.edges(res, .Call("REST_connect_neighborhood", neighbors, nei,
-##                                 mutual, PACKAGE="igraph"))
-##   }
-  
-##   res
-
-  if (is.null(dimvector)) {
-    dimvector <- rep(length, dim)
-  }
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_lattice", as.numeric(dimvector), as.numeric(nei),
-               as.logical(directed), as.logical(mutual),
-               as.logical(circular),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Lattice graph"
-    res$dimvector <- dimvector
-    res$nei <- nei
-    res$mutual <- mutual
-    res$circular <- circular
-  }
-  res
-}
-
-graph.ring <- function(n, directed=FALSE, mutual=FALSE, circular=TRUE) {
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_ring", as.numeric(n), as.logical(directed),
-               as.logical(mutual), as.logical(circular),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Ring graph"
-    res$mutual <- mutual
-    res$circular <- circular
-  }
-  res
-}
-
-###################################################################
-# Trees, regular
-###################################################################
-
-graph.tree <- function(n, children=2, mode=c("out", "in", "undirected")) {
-
-  mode <- igraph.match.arg(mode)
-  mode1 <- switch(mode, "out"=0, "in"=1, "undirected"=2);
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_tree", as.numeric(n), as.numeric(children),
-               as.numeric(mode1),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Tree"
-    res$children <- children
-    res$mode <- mode
-  }
-  res
-}
-
-###################################################################
-# The graph atlas
-###################################################################
-
-graph.atlas <- function(n) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_atlas", as.numeric(n),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- sprintf("Graph from the Atlas #%i", n)
-    res$n <- n
-  }
-  res
-}
-
-###################################################################
-# Create a graph from a data frame
-###################################################################
-
-graph.data.frame <- function(d, directed=TRUE, vertices=NULL) {
-
-  if (ncol(d) < 2) {
-    stop("the data frame should contain at least two columns")
-  }
-
-  ## This is to avoid scientific notation in vertex names, if they
-  ## happen to be numbers
-  scipen <- getOption("scipen")
-  options("scipen"=999)
-  on.exit(options(scipen=scipen))
-  
-  ## Handle if some elements are 'NA'
-  if (any(is.na(d[,1:2]))) {
-    warning("In `d' `NA' elements were replaced with string \"NA\"")
-    d[,1:2][ is.na(d[,1:2]) ] <- 'NA'
-  }
-  if (!is.null(vertices) && any(is.na(vertices[,1]))) {
-    warning("In `vertices[,1]' `NA' elements were replaced with string \"NA\"")
-    vertices[,1][is.na(vertices[,1])] <- 'NA'
-  }    
-  
-  names <- unique( c(as.character(d[,1]), as.character(d[,2])) )
-  if (!is.null(vertices)) {
-    names2 <- names
-    vertices <- as.data.frame(vertices)
-    if (ncol(vertices) < 1) {
-      stop("Vertex data frame contains no rows")
-    }
-    names <- as.character(vertices[,1])
-    if (any(duplicated(names))) {
-      stop("Duplicate vertex names")
-    }
-    if (any(! names2 %in% names)) {
-      stop("Some vertex names in edge list are not listed in vertex data frame")
-    }
-  }
-    
-  # create graph
-  g <- graph.empty(n=0, directed=directed)
-
-  # vertex attributes
-  attrs <- list(name=names)
-  if (!is.null(vertices)) {
-    if (ncol(vertices) > 1) {
-      for (i in 2:ncol(vertices)) {
-        newval <- vertices[,i]
-        if (class(newval) == "factor") {
-          newval <- as.character(newval)
-        }
-        attrs[[ names(vertices)[i] ]] <- newval
-      }
-    }
-  }
-
-  # add vertices
-  g <- add.vertices(g, length(names), attr=attrs)
-    
-  # create edge list
-  from <- as.character(d[,1])
-  to <- as.character(d[,2])
-  edges <- rbind(match(from, names), match(to,names))
-  
-  # edge attributes
-  attrs <- list()
-  if (ncol(d) > 2) {
-    for (i in 3:ncol(d)) {
-      newval <- d[,i]
-      if (class(newval) == "factor") {
-        newval <- as.character(newval)
-      }
-      attrs[[ names(d)[i] ]] <- newval
-    }
-  }
-
-  # add the edges
-  g <- add.edges(g, edges, attr=attrs)
-  g
-}
-
-graph.edgelist <- function(el, directed=TRUE) {
-
-  if (!is.matrix(el) || ncol(el) != 2) {
-    stop("graph.edgelist expects a matrix with two columns")
-  }
-
-  if (nrow(el) == 0) {
-    res <- graph.empty(directed=directed)
-  } else {  
-    if (is.character(el)) {
-      ## symbolic edge list
-      names <- unique(as.character(t(el)))
-      ids <- seq(names)
-      names(ids) <- names
-      res <- graph( unname(ids[t(el)]), directed=directed)
-      rm(ids)
-      V(res)$name <- names
-    } else {
-      ## normal edge list
-      res <- graph( t(el), directed=directed )
-    }
-  }
-
-  res
-}
-
-graph.extended.chordal.ring <- function(n, w) {
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_extended_chordal_ring", as.numeric(n),
-               as.matrix(w),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {  
-    res$name <- "Extended chordal ring"
-    res$w <- w
-  }
-  res
-}
-
-line.graph <- function(graph) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_line_graph", graph,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- "Line graph"
-  }
-  res
-}
-  
-  
-graph.de.bruijn <- function(m, n) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_de_bruijn", as.numeric(m), as.numeric(n),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- sprintf("De-Bruijn graph %i-%i", m, n)
-    res$m <- m
-    res$n <- n
-  }
-  res
-}
-
-graph.kautz <- function(m, n) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_kautz", as.numeric(m), as.numeric(n),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- sprintf("Kautz graph %i-%i", m, n)
-    res$m <- m
-    res$n <- n
-  }
-  res
-}
-
-graph.famous <- function(name) {
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_famous", as.character(name),
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$name <- name
-  }
-  res
-}
-
-graph.full.bipartite <- function(n1, n2, directed=FALSE,
-                                 mode=c("all", "out", "in")) {
-
-  n1 <- as.integer(n1)
-  n2 <- as.integer(n2)
-  directed <- as.logical(directed)
-  mode1 <- switch(igraph.match.arg(mode), "out"=1, "in"=2, "all"=3, "total"=3)  
-  
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_full_bipartite", n1, n2, as.logical(directed), mode1,
-               PACKAGE="igraph")
-  if (getIgraphOpt("add.params")) {
-    res$graph$name <- "Full bipartite graph"
-    res$n1 <- n1
-    res$n2 <- n2
-    res$mode <- mode
-  }
-  set.vertex.attribute(res$graph, "type", value=res$types)
-}
-
-graph.bipartite <- function(types, edges, directed=FALSE) {
-
-  types <- as.logical(types)
-  edges <- as.numeric(edges)-1
-  directed <- as.logical(directed)
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  res <- .Call("R_igraph_create_bipartite", types, edges, directed,
-               PACKAGE="igraph")
-  set.vertex.attribute(res, "type", value=types)
-}
-
-graph.incidence.sparse <- function(incidence, directed, mode, multiple,
-                                   weighted) {
-  require(Matrix)
-
-  n1 <- nrow(incidence)
-  n2 <- ncol(incidence)
-  el <- selectMethod("summary", signature=c(object="sparseMatrix"))(incidence)
-  ## el <- summary(incidence)
-  el[,2] <- el[,2] + n1
-
-  if (!is.null(weighted)) {
-
-    if (is.logical(weighted) && weighted) {
-      weighted <- "weight"
-    }
-    if (!is.character(weighted)) {
-      stop("invalid value supplied for `weighted' argument, please see docs.")
-    }
-
-    if (!directed || mode==1) {
-      ## nothing do to
-    } else if (mode==2) {
-      el[,1:2] <- el[,c(2,1)]
-    } else if (mode==3) {
-      el <- rbind(el, el[,c(2,1,3)])
-    }
-
-    res <- graph.empty(n=n1+n2, directed=directed)
-    weight <- list(el[,3])
-    names(weight) <- weighted
-    res <- add.edges(res, edges=t(as.matrix(el[,1:2])), attr=weight)
-
-  } else {
-
-    if (multiple) {
-      el[,3] <- ceiling(el[,3])
-      el[,3][ el[,3] < 0 ] <- 0
-    } else {
-      el[,3] <- el[,3] != 0
-    }
-
-    if (!directed || mode==1) {
-      ## nothing do to
-    } else if (mode==2) {
-      el[,1:2] <- el[,c(2,1)]
-    } else if (mode==3) {
-      el <- rbind(el, el[,c(2,1,3)])
-    }
-    
-    edges <- unlist(apply(el, 1, function(x) rep(unname(x[1:2]), x[3])))
-    res <- graph(n=n1+n2, edges, directed=directed)
-  } 
-    
-  set.vertex.attribute(res, "type", value=c(rep(FALSE, n1), rep(TRUE, n2)))
-}
-
-graph.incidence.dense <- function(incidence, directed, mode, multiple,
-                                  weighted) {
-
-  if (!is.null(weighted)) {
-    if (is.logical(weighted) && weighted) {
-      weighted <- "weight"
-    }
-    if (!is.character(weighted)) {
-      stop("invalid value supplied for `weighted' argument, please see docs.")
-    }
-
-    n1 <- nrow(incidence)
-    n2 <- ncol(incidence)
-    no.edges <- sum(incidence != 0)
-    if (directed && mode==3) { no.edges <- no.edges * 2 }
-    edges <- numeric(2*no.edges)
-    weight <- numeric(no.edges)
-    ptr <- 1
-    for (i in seq_len(nrow(incidence))) {
-      for (j in seq_len(ncol(incidence))) {
-        if (incidence[i,j] != 0) {
-          if (!directed || mode==1) {
-            edges[2*ptr-1] <- i
-            edges[2*ptr] <- n1+j
-            weight[ptr] <- incidence[i,j]
-            ptr <- ptr + 1
-          } else if (mode==2) {
-            edges[2*ptr-1] <- n1+j
-            edges[2*ptr] <- i
-            weight[ptr] <- incidence[i,j]
-            ptr <- ptr + 1
-          } else if (mode==3) {
-            edges[2*ptr-1] <- i
-            edges[2*ptr] <- n1+j
-            weight[ptr] <- incidence[i,j]
-            ptr <- ptr + 1
-            edges[2*ptr-1] <- n1+j
-            edges[2*ptr] <- i
-          }
-        }
-      }
-    }
-    res <- graph.empty(n=n1+n2, directed=directed)
-    weight <- list(weight)
-    names(weight) <- weighted
-    res <- add.edges(res, edges, attr=weight)
-    res <- set.vertex.attribute(res, "type",
-                                value=c(rep(FALSE, n1), rep(TRUE, n2)))
-    
-  } else {
-
-    mode(incidence) <- "double"
-    on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-    ## Function call
-    res <- .Call("R_igraph_incidence", incidence, directed, mode, multiple,
-                 PACKAGE="igraph")
-    res <- set.vertex.attribute(res$graph, "type", value=res$types)
-
-  }
-
-  res
-}
-
-graph.incidence <- function(incidence, directed=FALSE,
-                            mode=c("all", "out", "in", "total"), 
-                            multiple=FALSE, weighted=NULL,
-                            add.names=NULL) {
-  # Argument checks
-  directed <- as.logical(directed)
-  mode <- switch(igraph.match.arg(mode), "out"=1, "in"=2, "all"=3, "total"=3)
-  multiple <- as.logical(multiple)
-
-  if (inherits(incidence, "Matrix")) {
-    res <- graph.incidence.sparse(incidence, directed=directed,
-                                  mode=mode, multiple=multiple,
-                                  weighted=weighted)
-  } else {
-    incidence <- as.matrix(incidence)
-    res <- graph.incidence.dense(incidence, directed=directed, mode=mode,
-                                 multiple=multiple, weighted=weighted)
-  }
-
-  ## Add names
-  if (is.null(add.names)) {
-    if (!is.null(rownames(incidence)) && !is.null(colnames(incidence))) {
-      add.names <- "name"
-    } else {
-      add.names <- NA
-    }
-  } else if (!is.na(add.names)) {
-    if (is.null(rownames(incidence)) || is.null(colnames(incidence))) {
-      warning("Cannot add row- and column names, at least one of them is missing")
-      add.names <- NA
-    }
-  }
-  if (!is.na(add.names)) {
-    res <- set.vertex.attribute(res, add.names,
-                                value=c(rownames(incidence), colnames(incidence)))
-  }
-  res
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/structure.info.R igraph-0.6.5/interfaces/R/igraph/R/structure.info.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/structure.info.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/structure.info.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-are.connected <- function(graph, v1, v2) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  .Call("R_igraph_are_connected", graph, as.igraph.vs(graph, v1)-1,
-        as.igraph.vs(graph, v2)-1,
-        PACKAGE="igraph")
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/tkplot.R igraph-0.6.5/interfaces/R/igraph/R/tkplot.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/tkplot.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/tkplot.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,1478 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2003-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-###################################################################
-# Internal variables
-###################################################################
-
-# the environment containing all the plots
-.tkplot.env <- new.env()
-assign(".next", 1, .tkplot.env)
-
-###################################################################
-# Main function
-###################################################################
-
-tkplot <- function(graph, canvas.width=450, canvas.height=450, ...) {
-
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  
-  # Libraries
-  require(tcltk) || stop("tcl/tk library not available")
-
-  # Visual parameters
-  params <- i.parse.plot.params(graph, list(...))
-  labels <- params("vertex", "label")
-  label.color <- .tkplot.convert.color(params("vertex", "label.color"))
-  label.font <- .tkplot.convert.font(params("vertex", "label.font"),
-                                     params("vertex", "label.family"),
-                                     params("vertex", "label.cex"))
-  label.degree <- params("vertex", "label.degree")
-  label.dist <- params("vertex", "label.dist")
-  vertex.color <- .tkplot.convert.color(params("vertex", "color"))
-  vertex.size <- params("vertex", "size")
-  vertex.frame.color <- .tkplot.convert.color(params("vertex", "frame.color"))
-
-  edge.color <- .tkplot.convert.color(params("edge", "color"))
-  edge.width <- params("edge", "width")
-  edge.labels <- params("edge", "label")
-  edge.lty <- params("edge", "lty")
-  loop.angle <- params("edge", "loop.angle")
-  arrow.mode <- params("edge", "arrow.mode")
-  edge.label.font <- .tkplot.convert.font(params("edge", "label.font"),
-                                          params("edge", "label.family"),
-                                          params("edge", "label.cex"))
-  edge.label.color <- params("edge", "label.color")
-  arrow.size  <- params("edge", "arrow.size")[1]
-  curved <- params("edge", "curved")
-  curved <- rep(curved, length=ecount(graph))
-  
-  layout <- unname(params("plot", "layout"))
-  layout[,2] <- -layout[,2]
-  margin <- params("plot", "margin")
-  margin <- rep(margin, length=4)
-
-  # the new style parameters can't do this yet
-  arrow.mode         <- i.get.arrow.mode(graph, arrow.mode)
-  
-  # Edge line type
-  edge.lty <- i.tkplot.get.edge.lty(edge.lty)
-
-  # Create window & canvas
-  top <- tktoplevel(background="lightgrey")
-  canvas <- tkcanvas(top, relief="raised",
-                     width=canvas.width, height=canvas.height,
-                     borderwidth=2)
-  tkpack(canvas, fill="both", expand=1)
-
-  # Create parameters
-  vertex.params <- sdf(vertex.color=vertex.color,
-                       vertex.size=vertex.size,
-                       label.font=label.font,
-                       NROW=vcount(graph))
-                       
-  params <- list(vertex.params=vertex.params,
-                 edge.color=edge.color, label.color=label.color,
-                 labels.state=1, edge.width=edge.width,
-                 padding=margin*300+max(vertex.size)+5,
-                 grid=0, label.degree=label.degree,
-                 label.dist=label.dist, edge.labels=edge.labels,
-                 vertex.frame.color=vertex.frame.color,
-                 loop.angle=loop.angle, edge.lty=edge.lty, arrow.mode=arrow.mode,
-                 edge.label.font=edge.label.font,
-                 edge.label.color=edge.label.color, arrow.size=arrow.size,
-                 curved=curved)
-
-  # The popup menu
-  popup.menu <- tkmenu(canvas)
-  tkadd(popup.menu, "command", label="Fit to screen", command=function() {
-    tkplot.fit.to.screen(tkp.id)})  
-
-  # Different popup menu for vertices
-  vertex.popup.menu <- tkmenu(canvas)
-  tkadd(vertex.popup.menu, "command", label="Vertex color",
-        command=function() {
-          tkp <- .tkplot.get(tkp.id)
-          vids <- .tkplot.get.selected.vertices(tkp.id)
-          if (length(vids)==0) return(FALSE)
-          
-          initialcolor <- tkp$params$vertex.params[vids[1], "vertex.color"]
-          color <- .tkplot.select.color(initialcolor)
-          if (color=="") return(FALSE) # Cancel
-          
-          .tkplot.update.vertex.color(tkp.id, vids, color)
-        })
-  tkadd(vertex.popup.menu, "command", label="Vertex size",
-        command=function() {
-          tkp <- .tkplot.get(tkp.id)
-          vids <- .tkplot.get.selected.vertices(tkp.id)
-          if (length(vids)==0) return(FALSE)
-
-          initialsize <- tkp$params$vertex.params[1, "vertex.size"]
-          size <- .tkplot.select.number("Vertex size", initialsize, 1, 20)
-          if (is.na(size)) return(FALSE)
-
-          .tkplot.update.vertex.size(tkp.id, vids, size)
-        })
-  
-  # Different popup menu for edges
-  edge.popup.menu <- tkmenu(canvas)
-  tkadd(edge.popup.menu, "command", label="Edge color",
-        command=function() {
-          tkp <- .tkplot.get(tkp.id)
-          eids <- .tkplot.get.selected.edges(tkp.id)
-          if (length(eids)==0) return(FALSE)
-          
-          initialcolor <- ifelse(length(tkp$params$edge.color)>1,
-                                 tkp$params$edge.color[eids[1]],
-                                 tkp$params$edge.color)
-          color <- .tkplot.select.color(initialcolor)
-          if (color=="") return(FALSE) # Cancel
-
-          .tkplot.update.edge.color(tkp.id, eids, color)          
-        })
-  tkadd(edge.popup.menu, "command", label="Edge width",
-        command=function() {
-          tkp <- .tkplot.get(tkp.id)
-          eids <- .tkplot.get.selected.edges(tkp.id)
-          if (length(eids)==0) return(FALSE)
-          
-          initialwidth <- ifelse(length(tkp$params$edge.width)>1,
-                                 tkp$params$edge.width[eids[1]],
-                                 tkp$params$edge.width)
-          width <- .tkplot.select.number("Edge width", initialwidth, 1, 10)
-          if (is.na(width)) return(FALSE) # Cancel
-
-          .tkplot.update.edge.width(tkp.id, eids, width)
-        })
-          
-  
-  # Create plot object
-  tkp <- list(top=top, canvas=canvas, graph=graph, coords=layout,
-              labels=labels, params=params, popup.menu=popup.menu,
-              vertex.popup.menu=vertex.popup.menu,
-              edge.popup.menu=edge.popup.menu)
-  tkp.id <- .tkplot.new(tkp)
-  tktitle(top) <- paste("Graph plot", as.character(tkp.id))
-
-  # The main pull-down menu
-  main.menu <- tkmenu(top)
-  tkadd(main.menu, "command", label="Close", command=function() {
-    tkplot.close(tkp.id, TRUE)})
-  select.menu <- .tkplot.select.menu(tkp.id, main.menu)
-  tkadd(main.menu, "cascade", label="Select", menu=select.menu)  
-  layout.menu <- .tkplot.layout.menu(tkp.id, main.menu)
-  tkadd(main.menu, "cascade", label="Layout", menu=layout.menu)
-  view.menu <- tkmenu(main.menu)
-  tkadd(main.menu, "cascade", label="View", menu=view.menu)
-  tkadd(view.menu, "command", label="Fit to screen", command=function() {
-    tkplot.fit.to.screen(tkp.id)})
-  tkadd(view.menu, "command", label="Center on screen", command=function() {
-    tkplot.center(tkp.id)})
-  tkadd(view.menu, "separator")
-  view.menu.labels <- tclVar(1)
-  view.menu.grid <- tclVar(0)
-  tkadd(view.menu, "checkbutton", label="Labels",
-        variable=view.menu.labels, command=function() {
-          .tkplot.toggle.labels(tkp.id)})
-# grid canvas object not implemented in tcltk (?) :(
-#   tkadd(view.menu, "checkbutton", label="Grid",
-#         variable=view.menu.grid, command=function() {
-#           .tkplot.toggle.grid(tkp.id)})
-  tkadd(view.menu, "separator")
-  rotate.menu <- tkmenu(view.menu)
-  tkadd(view.menu, "cascade", label="Rotate", menu=rotate.menu)
-  sapply(c(-90,-45,-15,-5,-1,1,5,15,45,90),
-         function(deg) {
-           tkadd(rotate.menu, "command",
-                 label=paste(deg, "degree"), command=function() {
-                   tkplot.rotate(tkp.id, degree=deg)
-                 })
-         })
-  export.menu <- tkmenu(main.menu)
-  tkadd(main.menu, "cascade", label="Export", menu=export.menu)
-  tkadd(export.menu, "command", label="Postscript", command=function() {
-    tkplot.export.postscript(tkp.id)})
-  tkconfigure(top, "-menu", main.menu)
-  
-  # plot it
-  .tkplot.create.edges(tkp.id)
-  .tkplot.create.vertices(tkp.id)
-  # we would need an update here
-  tkplot.fit.to.screen(tkp.id, canvas.width, canvas.height)
-
-  # Kill myself if window was closed
-  tkbind(top, "<Destroy>", function() tkplot.close(tkp.id, FALSE))
-
-###################################################################
-# The callbacks for interactive editing
-###################################################################  
-
-  tkitembind(canvas, "vertex||label||edge", "<1>", function(x, y) {
-    tkp <- .tkplot.get(tkp.id)
-    canvas <- .tkplot.get(tkp.id, "canvas")
-    .tkplot.deselect.all(tkp.id)
-    .tkplot.select.current(tkp.id)
-#     tkitemraise(canvas, "current")
-  })
-  tkitembind(canvas, "vertex||label||edge", "<Control-1>", function(x,y) {
-    canvas <- .tkplot.get(tkp.id, "canvas")
-    curtags <- as.character(tkgettags(canvas, "current"))
-    seltags <- as.character(tkgettags(canvas, "selected"))
-    if ("vertex" %in% curtags && "vertex" %in% seltags) {
-      if ("selected" %in% curtags) {
-        .tkplot.deselect.current(tkp.id)
-      } else {
-        .tkplot.select.current(tkp.id)
-      }
-    } else if ("edge" %in% curtags && "edge" %in% seltags) {
-      if ("selected" %in% curtags) {
-        .tkplot.deselect.current(tkp.id)
-      } else {
-        .tkplot.select.current(tkp.id)
-      }
-    } else if ("label" %in% curtags && "vertex" %in% seltags) {
-      vtag <- curtags[pmatch("v-", curtags)]
-      tkid <- as.numeric(tkfind(canvas, "withtag",
-                                paste(sep="", "vertex&&", vtag)))
-      vtags <- as.character(tkgettags(canvas, tkid))
-      if ("selected" %in% vtags) {
-        .tkplot.deselect.vertex(tkp.id, tkid)
-      } else {
-        .tkplot.select.vertex(tkp.id, tkid)
-      }
-    } else {
-      .tkplot.deselect.all(tkp.id)
-      .tkplot.select.current(tkp.id)
-    }
-  })
-  tkitembind(canvas, "vertex||edge||label", "<Shift-Alt-1>", function(x, y) {
-    canvas <- .tkplot.get(tkp.id, "canvas")
-    tkitemlower(canvas, "current")
-  })
-  tkitembind(canvas, "vertex||edge||label", "<Alt-1>", function(x, y) {
-    canvas <- .tkplot.get(tkp.id, "canvas")
-    tkitemraise(canvas, "current")
-  })  
-  tkbind(canvas, "<3>", function(x, y) {
-    canvas <- .tkplot.get(tkp.id, "canvas")
-    tags <- as.character(tkgettags(canvas, "current"))
-    if ("label" %in% tags) {
-      vtag <- tags[ pmatch("v-", tags) ]
-      vid <- as.character(tkfind(canvas, "withtag",
-                                 paste(sep="", "vertex&&", vtag)))
-      tags <- as.character(tkgettags(canvas, vid))
-    }
-    if ("selected" %in% tags) {
-      # The selection is active
-    } else {
-      # Delete selection, single object
-      .tkplot.deselect.all(tkp.id)
-      .tkplot.select.current(tkp.id)
-    }
-    tags <- as.character(tkgettags(canvas, "selected"))
-    ## TODO: what if different types of objects are selected
-    if ("vertex" %in% tags || "label" %in% tags) {
-      menu <- .tkplot.get(tkp.id, "vertex.popup.menu")
-    } else if ("edge" %in% tags) {
-      menu <- .tkplot.get(tkp.id, "edge.popup.menu")
-    } else {
-      menu <- .tkplot.get(tkp.id, "popup.menu")
-    }
-    x <- as.integer(x) + as.integer(tkwinfo("rootx", canvas))
-    y <- as.integer(y) + as.integer(tkwinfo("rooty", canvas))
-    .Tcl(paste("tk_popup", .Tcl.args(menu, x, y)))
-  })
-  if (tkp$params$label.dist==0) tobind <- "vertex||label"
-  else tobind <- "vertex"
-  tkitembind(canvas, tobind, "<B1-Motion>", function(x, y) {
-    tkp <- .tkplot.get(tkp.id)
-    x <- as.numeric(x)
-    y <- as.numeric(y)
-    width <- as.numeric(tkwinfo("width", tkp$canvas))
-    height <- as.numeric(tkwinfo("height", tkp$canvas))
-    if (x < 10) { x <- 10 }
-    if (x > width-10) { x <- width-10 }
-    if (y < 10) { y <- 10 }
-    if (y > height-10) { y <- height-10 }
-    
-                                        # get the id
-    tags <- as.character(tkgettags(tkp$canvas, "selected"))
-    id <- as.numeric(strsplit(tags[pmatch("v-", tags)],
-                              "-", fixed=TRUE)[[1]][2])
-    if (is.na(id)) { return() }
-                                        # move the vertex
-    .tkplot.set.vertex.coords(tkp.id, id, x, y)
-    .tkplot.update.vertex(tkp.id, id, x, y)
-  })
-  if (tkp$params$label.dist!=0) {
-    tkitembind(canvas, "label", "<B1-Motion>", function(x,y) {
-      tkp <- .tkplot.get(tkp.id)
-      x <- as.numeric(x)
-      y <- as.numeric(y)
-                                        # get the id
-      tags <- as.character(tkgettags(tkp$canvas, "selected"))
-      id <- as.numeric(strsplit(tags[pmatch("v-", tags)],
-                                "-", fixed=TRUE)[[1]][2])
-      if (is.na(id)) { return() }
-      phi <- pi+atan2(tkp$coords[id,2]-y, tkp$coords[id,1]-x)
-      .tkplot.set.label.degree(tkp.id, id, phi)
-      .tkplot.update.label(tkp.id, id, tkp$coords[id,1], tkp$coords[id,2])
-    })
-  }
-  
-  # We don't need these any more, they are stored in the environment
-  rm(tkp, params, layout, vertex.color, edge.color, top, canvas,
-     main.menu, layout.menu, view.menu, export.menu, label.font, label.degree,
-     vertex.frame.color, vertex.params)
-  
-  tkp.id
-}
-
-###################################################################
-# Internal functions handling data about layouts for the GUI
-###################################################################
-
-.tkplot.addlayout <- function(name, layout.data) {
-  if (!exists(".layouts", envir=.tkplot.env)) {
-    assign(".layouts", list(), .tkplot.env)
-  }
-
-  assign("tmp", layout.data, .tkplot.env)
-  cmd <- paste(sep="", ".layouts[[\"", name, "\"]]", " <- tmp")
-  eval(parse(text=cmd), .tkplot.env)
-  rm("tmp", envir=.tkplot.env)
-}
-
-.tkplot.getlayout <- function(name) {
-  cmd <- paste(sep="", ".layouts[[\"", name, "\"]]")
-  eval(parse(text=cmd), .tkplot.env)
-}
-
-.tkplot.layouts.newdefaults <- function(name, defaults) {
-  assign("tmp", defaults, .tkplot.env)
-  for (i in seq(along=defaults)) {
-    cmd <- paste(sep="", '.layouts[["', name, '"]]$params[[', i,
-                 ']]$default <- tmp[[', i, ']]')
-    eval(parse(text=cmd), .tkplot.env)
-  }
-}
-
-.tkplot.getlayoutlist <- function() {
-  eval(parse(text="names(.layouts)"), .tkplot.env)
-}
-
-.tkplot.getlayoutname <- function(name) {
-  cmd <- paste(sep="", '.layouts[["', name, '"]]$name')
-  eval(parse(text=cmd), .tkplot.env)
-}
-
-.tkplot.addlayout("random",
-                  list(name="Random", f=layout.random, params=list()))
-.tkplot.addlayout("circle",
-                  list(name="Circle", f=layout.circle, params=list()))
-.tkplot.addlayout("fruchterman.reingold",
-                  list(name="Fruchterman-Reingold",
-                       f=layout.fruchterman.reingold,
-                       params=list(
-                         niter=list(name="Number of iterations",
-                           type="numeric",
-                           default=500),
-                         maxdelta=list(name="Maximum change (n)",
-                           type="expression",
-                           default=expression(vcount(.tkplot.g))),
-                         area=list(name="Area parameter (n^2)",
-                           type="expression",
-                           default=expression(vcount(.tkplot.g)^2)),
-                         coolexp=list(name="Cooling exponent",
-                           type="numeric",
-                           default=3),                         
-                         repulserad=list(name="Cancellation radius (n^3)",
-                           type="expression",
-                           # FIXME: this should be area * n, but parameters
-                           # can't depend on each other....
-                           default=expression(vcount(.tkplot.g)^3))
-                         )
-                       )
-                  )
-.tkplot.addlayout("kamada.kawai",
-                  list(name="Kamada-Kawai",
-                       f=layout.kamada.kawai,
-                       params=list(
-                         niter=list(name="Number of iterations",
-                           type="numeric",
-                           default=1000),
-                         initemp=list(name="Initial temperature",
-                           type="numeric",
-                           default=10),
-                         coolexp=list(name="Cooling exponent",
-                           type="numeric",
-                           default=0.99)
-                         )
-                       )
-                  )
-.tkplot.addlayout("spring",
-                  list(name="Spring Embedder",
-                       f=layout.spring,
-                       params=list(
-                         mass=list(names="The vertex mass",
-                           type="numeric",
-                           default=0.1),
-                         equil=list(names="The equilibrium spring extension",
-                           type="numeric",
-                           default=1),
-                         k=list(names="The spring coefficient",
-                           type="numeric",
-                           default=0.001),
-                         repeqdis=list(names="Repulsion balance point",
-                           type="numeric",
-                           default=0.1),
-                         kfr=list(names="Friction base coefficient",
-                           type="numeric",
-                           default=0.01),
-                         repulse=list(names="Use repulsion",
-                           type="logical",
-                           default=FALSE)
-                         )
-                       )
-                  )
-.tkplot.addlayout("reingold.tilford",
-                  list(names="Reingold-Tilford",
-                       f=layout.reingold.tilford,
-                       params=list(
-                         root=list(name="Root vertex",
-                           type="numeric",
-                           default=1)
-                         )
-                       )
-                  )
-                       
-###################################################################
-# Other public functions, misc.
-###################################################################
-
-tkplot.close <- function(tkp.id, window.close=TRUE) {
-  if (window.close) {
-    cmd <- paste(sep="", "tkp.", tkp.id, "$top")
-    top <- eval(parse(text=cmd), .tkplot.env)
-    tkbind(top, "<Destroy>", "")
-    tkdestroy(top)
-  }
-  cmd <- paste(sep="", "tkp.", tkp.id)
-  rm(list=cmd, envir=.tkplot.env)
-  invisible(NULL)
-}
-
-tkplot.off <- function() {
-  eapply(.tkplot.env, function(tkp) { tkdestroy(tkp$top) })
-  rm(list=ls(.tkplot.env), envir=.tkplot.env)
-  invisible(NULL)
-}
-
-tkplot.fit.to.screen <- function(tkp.id, width=NULL, height=NULL) {
-  tkp <- .tkplot.get(tkp.id)
-  if (is.null(width)) {
-    width  <- as.numeric(tkwinfo("width", tkp$canvas))
-  }
-  if (is.null(height)) {
-    height <- as.numeric(tkwinfo("height", tkp$canvas))
-  }
-  coords <- .tkplot.get(tkp.id, "coords")
-  # Shift to zero
-  coords[,1] <- coords[,1]-min(coords[,1])
-  coords[,2] <- coords[,2]-min(coords[,2])
-  # Scale
-  coords[,1] <- coords[,1] / max(coords[,1]) *
-    (width-(tkp$params$padding[2]+tkp$params$padding[4]))
-  coords[,2] <- coords[,2] / max(coords[,2]) *
-    (height-(tkp$params$padding[1]+tkp$params$padding[3]))
-  # Padding
-  coords[,1] <- coords[,1]+tkp$params$padding[2]
-  coords[,2] <- coords[,2]+tkp$params$padding[3]
-  # Store
-  .tkplot.set(tkp.id, "coords", coords)
-  # Update
-  .tkplot.update.vertices(tkp.id)
-  invisible(NULL)
-}
-
-tkplot.center <- function(tkp.id) {
-  tkp <- .tkplot.get(tkp.id)
-  width  <- as.numeric(tkwinfo("width", tkp$canvas))
-  height <- as.numeric(tkwinfo("height", tkp$canvas))
-  coords <- .tkplot.get(tkp.id, "coords")
-  canvas.center.x <- width/2
-  canvas.center.y <- height/2
-  coords <- .tkplot.get(tkp.id, "coords")
-  r1 <- range(coords[,1])
-  r2 <- range(coords[,2])
-  coords.center.x <- (r1[1]+r1[2])/2
-  coords.center.y <- (r2[1]+r2[2])/2
-  # Shift to center
-  coords[,1] <- coords[,1]+canvas.center.x-coords.center.x
-  coords[,2] <- coords[,2]+canvas.center.y-coords.center.y
-  # Store
-  .tkplot.set(tkp.id, "coords", coords)
-  # Update
-  .tkplot.update.vertices(tkp.id)
-  invisible(NULL)
-}
-  
-tkplot.reshape <- function(tkp.id, newlayout, ...) {
-  tkp <- .tkplot.get(tkp.id)
-  .tkplot.set(tkp.id, "coords", newlayout(tkp$graph, ...))
-  tkplot.fit.to.screen(tkp.id)
-  .tkplot.update.vertices(tkp.id)
-  invisible(NULL)
-}
-
-tkplot.export.postscript <- function(tkp.id) {
-
-  tkp <- .tkplot.get(tkp.id)
-
-  filename <- tkgetSaveFile(initialfile="Rplots.eps",
-                            defaultextension="eps",
-                            title="Export graph to PostScript file")
-  tkpostscript(tkp$canvas, file=filename)
-  invisible(NULL)
-}
-
-tkplot.getcoords <- function(tkp.id, norm=FALSE) {
-  coords <- .tkplot.get(tkp.id, "coords")
-  coords[,2] <- max(coords[,2]) - coords[,2]
-  if (norm) {
-    # Shift
-    coords[,1] <- coords[,1]-min(coords[,1])
-    coords[,2] <- coords[,2]-min(coords[,2])
-    # Scale
-    coords[,1] <- coords[,1] / max(coords[,1])-0.5
-    coords[,2] <- coords[,2] / max(coords[,2])-0.5
-  }
-  coords
-}
-
-tkplot.rotate <- function(tkp.id, degree=NULL, rad=NULL) {
-  coords <- .tkplot.get(tkp.id, "coords")
-
-  if (is.null(degree) && is.null(rad)) {
-    rad <- pi/2
-  } else if (is.null(rad) && !is.null(degree)) {
-    rad <- degree/180*pi
-  }
-  
-  center <- c(mean(range(coords[,1])), mean(range(coords[,2])))
-  phi <- atan2(coords[,2]-center[2], coords[,1]-center[1])
-  r   <- sqrt((coords[,1]-center[1])**2 + (coords[,2]-center[2])**2)
-
-  phi <- phi + rad
-
-  coords[,1] <- r * cos(phi)
-  coords[,2] <- r * sin(phi)
-  
-  .tkplot.set(tkp.id, "coords", coords)
-  tkplot.center(tkp.id)
-  invisible(NULL)
-}
-
-###################################################################
-# Internal functions, handling the internal environment
-###################################################################
-
-.tkplot.new <- function(tkp) {
-  id <- get(".next", .tkplot.env)
-  assign(".next", id+1, .tkplot.env)
-  assign("tmp", tkp, .tkplot.env)
-  cmd <- paste("tkp.", id, "<- tmp", sep="")
-  eval(parse(text=cmd), .tkplot.env)
-  rm("tmp", envir=.tkplot.env)
-  id
-}
-
-.tkplot.get <- function(tkp.id, what=NULL) {
-  if (is.null(what)) {
-    get(paste("tkp.", tkp.id, sep=""), .tkplot.env)
-  } else {
-    cmd <- paste("tkp.", tkp.id, "$", what, sep="")
-    eval(parse(text=cmd), .tkplot.env)
-  }
-}
-
-.tkplot.set <- function(tkp.id, what, value) {
-  assign("tmp", value, .tkplot.env)
-  cmd <- paste(sep="", "tkp.", tkp.id, "$", what, "<-tmp")
-  eval(parse(text=cmd), .tkplot.env)
-  rm("tmp", envir=.tkplot.env)
-  TRUE
-}
-
-.tkplot.set.params <- function(tkp.id, what, value) {
-  assign("tmp", value, .tkplot.env)
-  cmd <- paste(sep="", "tkp.", tkp.id, "$params$", what, "<-tmp")
-  eval(parse(text=cmd), .tkplot.env)
-  rm("tmp", envir=.tkplot.env)
-  TRUE
-}
-
-.tkplot.set.vertex.coords <- function(tkp.id, id, x, y) {
-  cmd <- paste(sep="", "tkp.", tkp.id, "$coords[",id,",]<-c(",x,",",y,")")
-  eval(parse(text=cmd), .tkplot.env)
-  TRUE
-}
-
-.tkplot.set.label.degree <- function(tkp.id, id, phi) {
-  tkp <- .tkplot.get(tkp.id)
-  
-  if (length(tkp$params$label.degree)==1) {
-    label.degree <- rep(tkp$params$label.degree, times=vcount(tkp$graph))
-    label.degree[id] <- phi
-    assign("tmp", label.degree, .tkplot.env)
-    cmd <- paste(sep="", "tkp.", tkp.id, "$params$label.degree <- tmp")
-    eval(parse(text=cmd), .tkplot.env)
-    rm("tmp", envir=.tkplot.env)
-  } else {
-    cmd <- paste(sep="", "tkp.", tkp.id, "$params$label.degree[", id,
-                 "] <- ", phi)
-    eval(parse(text=cmd), .tkplot.env)
-  }
-  TRUE
-}   
-
-###################################################################
-# Internal functions, creating and updating canvas objects
-###################################################################
-
-# Creates a new vertex tk object
-.tkplot.create.vertex <- function(tkp.id, id, label, x=0, y=0) {
-  tkp <- .tkplot.get(tkp.id)
-  vertex.size <- tkp$params$vertex.params[id, "vertex.size"]
-  vertex.color <- tkp$params$vertex.params[id, "vertex.color"]
-  vertex.frame.color <- ifelse(length(tkp$params$vertex.frame.color)>1,
-                               tkp$params$vertex.frame.color[id],
-                               tkp$params$vertex.frame.color)
-  item <- tkcreate(tkp$canvas, "oval", x-vertex.size, y-vertex.size,
-                   x+vertex.size, y+vertex.size, width=1,
-                   outline=vertex.frame.color,  fill=vertex.color)
-  tkaddtag(tkp$canvas, "vertex", "withtag", item)
-  tkaddtag(tkp$canvas, paste("v-", id, sep=""), "withtag", item)
-  if (!is.na(label)) {
-    label.degree <- ifelse(length(tkp$params$label.degree)>1,
-                           tkp$params$label.degree[id],
-                           tkp$params$label.degree)
-    label.color <- if (length(tkp$params$label.color)>1) {
-      tkp$params$label.color[id]
-    } else {
-      tkp$params$label.color
-    }
-    label.dist <- tkp$params$label.dist
-    label.x <- x+label.dist*cos(label.degree)*
-      (vertex.size+6+4*(ceiling(log10(id))))
-    label.y <- y+label.dist*sin(label.degree)*
-      (vertex.size+6+4*(ceiling(log10(id))))
-    if (label.dist==0)
-      { afill <- label.color }
-    else
-      { afill <- "red" }
-    litem <- tkcreate(tkp$canvas, "text", label.x, label.y,
-                      text=as.character(label), state="normal",
-                      fill=label.color, activefill=afill,
-                      font=tkp$params$vertex.params[id, "label.font"])
-    tkaddtag(tkp$canvas, "label", "withtag", litem)
-    tkaddtag(tkp$canvas, paste("v-", id, sep=""), "withtag", litem)
-  }
-  item
-}
-
-# Create all vertex objects and move them into correct position
-.tkplot.create.vertices <- function(tkp.id) {
-  tkp <- .tkplot.get(tkp.id)
-  n <- vcount(tkp$graph)
-
-  # Labels
-  labels <- i.get.labels(tkp$graph, tkp$labels)
-
-  mapply(function(v, l, x, y) .tkplot.create.vertex(tkp.id, v, l, x, y),
-         1:n, labels, tkp$coords[,1], tkp$coords[,2])
-}
-
-.tkplot.update.label <- function(tkp.id, id, x, y) {
-  tkp <- .tkplot.get(tkp.id)
-  vertex.size <- tkp$params$vertex.params[id, "vertex.size"]
-  label.degree <- ifelse(length(tkp$params$label.degree)>1,
-                         tkp$params$label.degree[id],
-                         tkp$params$label.degree)
-  label.dist <- tkp$params$label.dist
-  label.x <- x+label.dist*cos(label.degree)*
-    (vertex.size+6+4*(ceiling(log10(id))))
-  label.y <- y+label.dist*sin(label.degree)*
-    (vertex.size+6+4*(ceiling(log10(id))))
-  tkcoords(tkp$canvas, paste("label&&v-", id, sep=""),
-           label.x, label.y)
-}
-
-.tkplot.update.vertex <- function(tkp.id, id, x, y) {
-  tkp <- .tkplot.get(tkp.id)
-  vertex.size <- tkp$params$vertex.params[id, "vertex.size"]
-  # Vertex
-  tkcoords(tkp$canvas, paste("vertex&&v-", id, sep=""),
-           x-vertex.size, y-vertex.size,
-           x+vertex.size, y+vertex.size)
-  # Label
-  .tkplot.update.label(tkp.id, id, x, y)
-  
-  # Edges
-  edge.from.ids <- as.numeric(tkfind(tkp$canvas, "withtag",
-                                     paste("from-", id, sep="")))
-  edge.to.ids <- as.numeric(tkfind(tkp$canvas, "withtag",
-                                   paste("to-", id, sep="")))
-  for (i in seq(along=edge.from.ids)) {
-    .tkplot.update.edge(tkp.id, edge.from.ids[i])
-  }
-  for (i in seq(along=edge.to.ids)) {
-    .tkplot.update.edge(tkp.id, edge.to.ids[i])
-  }
-}
-
-.tkplot.update.vertices <- function(tkp.id) {
-  tkp <- .tkplot.get(tkp.id)
-  n <- vcount(tkp$graph)
-  mapply(function(v, x, y) .tkplot.update.vertex(tkp.id, v, x, y), 1:n,
-         tkp$coords[,1], tkp$coords[,2])
-}
-
-# Creates tk object for edge 'id'
-.tkplot.create.edge <- function(tkp.id, from, to, id) {
-  tkp <- .tkplot.get(tkp.id)  
-  from.c <- tkp$coords[from,]
-  to.c   <- tkp$coords[to,]
-  edge.color <- ifelse(length(tkp$params$edge.color)>1,
-                       tkp$params$edge.color[id],
-                       tkp$params$edge.color)
-  edge.width <- ifelse(length(tkp$params$edge.width)>1,
-                       tkp$params$edge.width[id],
-                       tkp$params$edge.width)
-  edge.lty <- ifelse(length(tkp$params$edge.lty)>1,
-                       tkp$params$edge.lty[[id]],
-                       tkp$params$edge.lty)
-  arrow.mode <- ifelse(length(tkp$params$arrow.mode)>1,
-                       tkp$params$arrow.mode[[id]],
-                       tkp$params$arrow.mode)
-  arrow.size <- tkp$params$arrow.size
-  curved <- tkp$params$curved[[id]]
-  arrow <- c("none", "first", "last", "both")[arrow.mode+1]
-  
-  if (from != to) {
-    ## non-loop edge
-    if (is.logical(curved)) curved <- curved * 0.5
-    if (curved != 0) {
-      smooth <- TRUE
-      midx <- (from.c[1]+to.c[1])/2
-      midy <- (from.c[2]+to.c[2])/2        
-      spx <- midx - curved * 1/2 * (from.c[2]-to.c[2])
-      spy <- midy + curved * 1/2 * (from.c[1]-to.c[1])
-      coords <- c(from.c[1], from.c[2], spx, spy, to.c[1], to.c[2])
-    } else {
-      smooth <- FALSE
-      coords <- c(from.c[1], from.c[2], to.c[1], to.c[2])
-    }
-    args <- c(list(tkp$canvas, "line"),
-              coords, 
-              list(width=edge.width, activewidth=2*edge.width,
-                   arrow=arrow, arrowshape=arrow.size * c(10, 10, 5),
-                   fill=edge.color, activefill="red", dash=edge.lty,
-                   tags=c("edge", paste(sep="", "edge-", id),
-                     paste(sep="", "from-", from),
-                     paste(sep="", "to-", to))), smooth=smooth)
-    do.call(tkcreate, args)
-  } else {
-    ## loop edge
-    ## the coordinates are not correct but we will call update anyway...
-    tkcreate(tkp$canvas, "line", from.c[1], from.c[2],
-             from.c[1]+20, from.c[1]-10, from.c[2]+30, from.c[2],
-             from.c[1]+20, from.c[1]+10, from.c[1], from.c[2],
-             width=edge.width, activewidth=2*edge.width,
-             arrow=arrow, arrowshape=arrow.size * c(10,10,5), dash=edge.lty,
-             fill=edge.color, activefill="red", smooth=TRUE,
-             tags=c("edge", "loop", paste(sep="", "edge-", id),
-               paste(sep="", "from-", from),
-               paste(sep="", "to-", to)))
-    
-  }
-
-  edge.label <- ifelse(length(tkp$params$edge.labels)>1,
-                       tkp$params$edge.labels[id],
-                       tkp$params$edge.labels)
-  if (!is.na(edge.label)) {
-    label.color <- ifelse(length(tkp$params$edge.label.color)>1,
-                          tkp$params$edge.label.color[id],
-                          tkp$params$edge.label.color)
-    ## not correct for loop edges but we will update anyway...
-    label.x <- (to.c[1]+from.c[1])/2
-    label.y <- (to.c[2]+from.c[2])/2
-    litem <- tkcreate(tkp$canvas, "text", label.x, label.y,
-                      text=as.character(edge.label), state="normal",
-                      fill=label.color,
-                      font=tkp$params$edge.label.font)
-    tkaddtag(tkp$canvas, "label", "withtag", litem)
-    tkaddtag(tkp$canvas, paste(sep="", "edge-", id), "withtag", litem)
-  }
-}
-
-# Creates all edges
-.tkplot.create.edges <- function(tkp.id) {
-  tkp <- .tkplot.get(tkp.id)
-  n <- ecount(tkp$graph)
-  edgematrix <- get.edgelist(tkp$graph, names=FALSE)
-  mapply(function(from, to, id) .tkplot.create.edge(tkp.id, from, to, id),
-         edgematrix[,1],
-         edgematrix[,2], 1:nrow(edgematrix))
-}
-
-# Update an edge with given itemid (not edge id!)
-.tkplot.update.edge <- function(tkp.id, itemid) {
-  tkp <- .tkplot.get(tkp.id)
-  tags <- as.character(tkgettags(tkp$canvas, itemid))
-  from <- as.numeric(substring(grep("from-", tags, value=TRUE, fixed=TRUE),6))
-  to <- as.numeric(substring(grep("to-", tags, value=TRUE, fixed=TRUE),4))
-  from.c <- tkp$coords[from,]
-  to.c <- tkp$coords[to,]
-
-  edgeid <- as.numeric(substring(tags[ pmatch("edge-", tags) ], 6))
-
-  if (from != to) {
-    phi <- atan2(to.c[2]-from.c[2], to.c[1]-from.c[1])
-    r <- sqrt( (to.c[1]-from.c[1])^2 + (to.c[2]-from.c[2])^2 )
-    vertex.size <- tkp$params$vertex.params[to, "vertex.size"]
-    vertex.size2 <- tkp$params$vertex.params[from, "vertex.size"]
-    curved <- tkp$params$curved[[edgeid]]
-    to.c[1] <- from.c[1] + (r-vertex.size)*cos(phi)
-    to.c[2] <- from.c[2] + (r-vertex.size)*sin(phi)
-    from.c[1] <- from.c[1] + vertex.size2*cos(phi)
-    from.c[2] <- from.c[2] + vertex.size2*sin(phi)
-    if (is.logical(curved)) curved <- curved * 0.5
-    if (curved == 0) {
-      tkcoords(tkp$canvas, itemid, from.c[1], from.c[2], to.c[1], to.c[2])
-    } else {
-      midx <- (from.c[1]+to.c[1])/2
-      midy <- (from.c[2]+to.c[2])/2        
-      spx <- midx - curved * 1/2 * (from.c[2]-to.c[2])
-      spy <- midy + curved * 1/2 * (from.c[1]-to.c[1])
-      tkcoords(tkp$canvas, itemid, from.c[1], from.c[2], spx, spy,
-               to.c[1], to.c[2])
-    }
-  } else {
-    vertex.size <- tkp$params$vertex.params[to, "vertex.size"]
-    loop.angle <- ifelse(length(tkp$param$loop.angle)>1,
-                         tkp$params$loop.angle[edgeid],
-                         tkp$params$loop.angle)
-    xx <- from.c[1] + cos(loop.angle/180*pi)*vertex.size
-    yy <- from.c[2] + sin(loop.angle/180*pi)*vertex.size
-    cc <- matrix(c(xx,yy, xx+20,yy-10, xx+30,yy, xx+20,yy+10, xx,yy),
-                 ncol=2, byrow=TRUE)
-
-    phi <- atan2(cc[,2]-yy, cc[,1]-xx)
-    r <- sqrt((cc[,1]-xx)**2 + (cc[,2]-yy)**2)
-    phi <- phi+loop.angle/180*pi
-    cc[,1] <- xx+r*cos(phi)
-    cc[,2] <- yy+r*sin(phi)
-    tkcoords(tkp$canvas, itemid, cc[1,1], cc[1,2], cc[2,1], cc[2,2],
-             cc[3,1], cc[3,2], cc[4,1], cc[4,2], cc[5,1]+0.001, cc[5,2]+0.001)
-  }
-
-  edge.label <- ifelse(length(tkp$params$edge.labels)>1,
-                       tkp$params$edge.labels[edgeid],
-                       tkp$params$edge.labels)
-  if (!is.na(edge.label)) {
-    if (from != to) {
-      label.x <- (to.c[1]+from.c[1])/2
-      label.y <- (to.c[2]+from.c[2])/2
-    } else {
-      ## loops
-      label.x <- xx+cos(loop.angle/180*pi)*30
-      label.y <- yy+sin(loop.angle/180*pi)*30
-    }
-    litem <- as.numeric(tkfind(tkp$canvas, "withtag",
-                               paste(sep="", "label&&edge-", edgeid)))
-    tkcoords(tkp$canvas, litem, label.x, label.y)
-  }
-}
-
-.tkplot.toggle.labels <- function(tkp.id) {
-  .tkplot.set.params(tkp.id, "labels.state",
-                    1 - .tkplot.get(tkp.id, "params")$labels.state)
-  tkp <- .tkplot.get(tkp.id)
-  state <- ifelse(tkp$params$labels.state==1, "normal", "hidden")
-  tkitemconfigure(tkp$canvas, "label", "-state", state)  
-}
-
-.tkplot.toggle.grid <- function(tkp.id) {
-  .tkplot.set.params(tkp.id, "grid",
-                    1 - .tkplot.get(tkp.id, "params")$grid)
-  tkp <- .tkplot.get(tkp.id)
-  state <- ifelse(tkp$params$grid==1, "normal", "hidden")
-  if (state=="hidden") {
-    tkdelete(tkp$canvas, "grid")
-  } else {
-    tkcreate(tkp$canvas, "grid", 0, 0, 10, 10, tags=c("grid"))
-  }
-}
-
-.tkplot.update.vertex.color <- function(tkp.id, vids, newcolor) {
-  tkp <- .tkplot.get(tkp.id)
-  vparams <- tkp$params$vertex.params
-  vparams[vids, "vertex.color"] <- newcolor
-  .tkplot.set(tkp.id, "params$vertex.params", vparams)
-  tkitemconfigure(tkp$canvas, "selected&&vertex", "-fill", newcolor)
-}
-
-.tkplot.update.edge.color <- function(tkp.id, eids, newcolor) {
-  tkp <- .tkplot.get(tkp.id)
-  colors <- tkp$params$edge.color
-  if (length(colors)==1 && length(eids)==ecount(tkp$graph)) {
-    ## Uniform color -> uniform color
-    .tkplot.set(tkp.id, "params$edge.color", newcolor)
-  } else if (length(colors)==1) {
-    ## Uniform color -> nonuniform color
-    colors <- rep(colors, ecount(tkp$graph))
-    colors[eids] <- newcolor
-    .tkplot.set(tkp.id, "params$edge.color", colors)
-  } else if (length(eids)==ecount(tkp$graph)) {
-    ## Non-uniform -> uniform
-    .tkplot.set(tkp.id, "params$edge.color", newcolor)
-  } else {
-    ## Non-uniform -> non-uniform
-    colors[eids] <- newcolor
-    .tkplot.set(tkp.id, "params$edge.color", colors)
-  }
-
-  tkitemconfigure(tkp$canvas, "selected&&edge", "-fill", newcolor)
-}
-
-.tkplot.update.edge.width <- function(tkp.id, eids, newwidth) {
-  tkp <- .tkplot.get(tkp.id)
-  widths <- tkp$params$edge.width
-  if (length(widths)==1 && length(eids)==ecount(tkp$graph)) {
-    ## Uniform width -> uniform width
-    .tkplot.set(tkp.id, "params$edge.width", newwidth)
-  } else if (length(widths)==1) {
-    ## Uniform width -> nonuniform width
-    widths <- rep(widths, ecount(tkp$graph))
-    widths[eids] <- newwidth
-    .tkplot.set(tkp.id, "params$edge.width", widths)
-  } else if (length(eids)==ecount(tkp$graph)) {
-    ## Non-uniform -> uniform
-    .tkplot.set(tkp.id, "params$edge.width", newwidth)
-  } else {
-    ## Non-uniform -> non-uniform
-    widths[eids] <- newwidth
-    .tkplot.set(tkp.id, "params$edge.width", widths)
-  }
-
-  tkitemconfigure(tkp$canvas, "selected&&edge", "-width", newwidth)
-}
-  
-
-.tkplot.update.vertex.size <- function(tkp.id, vids, newsize) {
-  tkp <- .tkplot.get(tkp.id)
-  vparams <- tkp$params$vertex.params
-  vparams[vids, "vertex.size"] <- newsize
-  .tkplot.set(tkp.id, "params$vertex.params", vparams)
-  sapply(vids, function(id) {
-    .tkplot.update.vertex(tkp.id, id, tkp$coords[id,1], tkp$coords[id,2])
-  })
-}
-
-.tkplot.get.numeric.vector <- function(...) {
-  labels <- list(...)
-  if (length(labels)==0) return(FALSE)
-  
-  answers <- as.list(rep("", length(labels)))
-  dialog <- tktoplevel()
-  vars <- lapply(answers, tclVar)
-
-  retval <- list()
-
-  OnOK <- function() {
-    retval <<- lapply(vars, tclvalue)
-    tkdestroy(dialog)
-  }
-  
-  OK.but <- tkbutton(dialog, text="   OK   ", command=OnOK)
-  for (i in seq(along=labels)) {
-    tkgrid(tklabel(dialog, text=labels[[i]]))
-    tmp <- tkentry(dialog, width="40",textvariable=vars[[i]])
-    tkgrid(tmp)
-    tkbind(tmp, "<Return>", OnOK)
-  }
-  tkgrid(OK.but)
-  tkwait.window(dialog)
-
-  retval <- lapply(retval, function(v)
-                   { eval(parse(text=paste("c(", v, ")"))) })
-  return (retval)
-}
-
-.tkplot.select.number <- function(label, initial, low=1, high=100) {
-  dialog <- tktoplevel()
-  SliderValue <- tclVar(as.character(initial))
-  SliderValueLabel <- tklabel(dialog,text=as.character(tclvalue(SliderValue)))
-  tkgrid(tklabel(dialog,text=label), SliderValueLabel)
-  tkconfigure(SliderValueLabel, textvariable=SliderValue)
-  slider <- tkscale(dialog, from=high, to=low,
-                    showvalue=F, variable=SliderValue,
-                    resolution=1, orient="horizontal")  
-  OnOK <- function() {
-    SliderValue <<- as.numeric(tclvalue(SliderValue))
-    tkdestroy(dialog)
-  }
-  OnCancel <- function() {
-    SliderValue <<- NA
-    tkdestroy(dialog)
-  }
-  OK.but <- tkbutton(dialog, text="   OK   ", command=OnOK)
-  cancel.but <- tkbutton(dialog, text=" Cancel ", command=OnCancel)
-  tkgrid(slider)
-  tkgrid(OK.but, cancel.but)
-  
-  tkwait.window(dialog)
-  return(SliderValue)
-}
-  
-###################################################################
-# Internal functions, vertex and edge selection
-###################################################################
-
-.tkplot.deselect.all <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  ids <- as.numeric(tkfind(canvas, "withtag", "selected"))
-  for (i in ids) {
-    .tkplot.deselect.this(tkp.id, i)
-  }
-}
-
-.tkplot.select.all.vertices <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  vertices <- as.numeric(tkfind(canvas, "withtag", "vertex"))
-  for (i in vertices) {
-    .tkplot.select.vertex(tkp.id, i)
-  }
-}
-
-.tkplot.select.some.vertices <- function(tkp.id, vids) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  vids <- unique(vids)
-  for (i in vids) {
-    tkid <- as.numeric(tkfind(canvas, "withtag",
-                              paste(sep="", "vertex&&v-", i)))
-    .tkplot.select.vertex(tkp.id, tkid)
-  }
-}
-
-.tkplot.select.all.edges <- function(tkp.id, vids) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  edges <- as.numeric(tkfind(canvas, "withtag", "edge"))
-  for (i in edges) {
-    .tkplot.select.edge(tkp.id, i)
-  }
-}
-
-.tkplot.select.some.edges <- function(tkp.id, from, to) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  fromtags <- sapply(from, function(i) { paste(sep="", "from-", i) })
-  totags <- sapply(from, function(i) { paste(sep="", "to-", i) })
-  edges <- as.numeric(tkfind(canvas, "withtag", "edge"))
-  for (i in edges) {
-    tags <- as.character(tkgettags(canvas, i))
-    ftag <- tags[ pmatch("from-", tags) ]
-    ttag <- tags[ pmatch("to-", tags) ]
-    if (ftag %in% fromtags && ttag %in% totags) {
-      .tkplot.select.edge(tkp.id, i)
-    }
-  }
-}
-
-.tkplot.select.vertex <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkaddtag(canvas, "selected", "withtag", tkid)
-  tkitemconfigure(canvas, tkid, "-outline", "red",
-                  "-width", 2)
-}
-
-.tkplot.select.edge <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkaddtag(canvas, "selected", "withtag", tkid)
-  tkitemconfigure(canvas, tkid, "-dash", "-")
-}
-
-.tkplot.select.label <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkaddtag(canvas, "selected", "withtag", tkid)
-}  
-
-.tkplot.deselect.vertex <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkdtag(canvas, tkid, "selected")
-  tkp <- .tkplot.get(tkp.id)
-  tags <- as.character(tkgettags(canvas, tkid))
-  id <- as.numeric(substring(tags[pmatch("v-", tags)], 3))
-  vertex.frame.color <- ifelse(length(tkp$params$vertex.frame.color)>1,
-                               tkp$params$vertex.frame.color[id],
-                               tkp$params$vertex.frame.color)  
-  tkitemconfigure(canvas, tkid, "-outline", vertex.frame.color,
-                  "-width", 1)
-}
-
-.tkplot.deselect.edge <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkdtag(canvas, tkid, "selected")
-  tkp <- .tkplot.get(tkp.id)
-  tags <- as.character(tkgettags(canvas, tkid))
-  id <- as.numeric(substring(tags[pmatch("edge-", tags)], 6))
-  edge.lty <- ifelse(length(tkp$params$edge.lty)>1,
-                     tkp$params$edge.lty[[id]],
-                     tkp$params$edge.lty)
-  tkitemconfigure(canvas, tkid, "-dash", edge.lty)
-}
-
-.tkplot.deselect.label <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkdtag(canvas, tkid, "selected")
-}
-
-.tkplot.select.current <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkid <- as.numeric(tkfind(canvas, "withtag", "current"))
-  .tkplot.select.this(tkp.id, tkid)
-}
-
-.tkplot.deselect.current <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkid <- as.numeric(tkfind(canvas, "withtag", "current"))
-  .tkplot.deselect.this(tkp.id, tkid)
-}
-
-.tkplot.select.this <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tags <- as.character(tkgettags(canvas, tkid))
-  if ("vertex" %in% tags) {
-    .tkplot.select.vertex(tkp.id, tkid)
-  } else if ("edge" %in% tags) {
-    .tkplot.select.edge(tkp.id, tkid)
-  } else if ("label" %in% tags) {
-    tkp <- .tkplot.get(tkp.id)
-    if (tkp$params$label.dist == 0) {
-      id <- tags[pmatch("v-", tags)]
-      tkid <- as.character(tkfind(canvas, "withtag",
-                                  paste(sep="", "vertex&&", id)))
-      .tkplot.select.vertex(tkp.id, tkid)
-    } else {
-      .tkplot.select.label(tkp.id, tkid)
-    }
-  } 
-}
-
-.tkplot.deselect.this <- function(tkp.id, tkid) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tags <- as.character(tkgettags(canvas, tkid))
-  if ("vertex" %in% tags) {
-    .tkplot.deselect.vertex(tkp.id, tkid)
-  } else if ("edge" %in% tags) {
-    .tkplot.deselect.edge(tkp.id, tkid)
-  } else if ("label" %in% tags) {
-    tkp <- .tkplot.get(tkp.id)
-    if (tkp$params$label.dist == 0) {
-      id <- tags[pmatch("v-", tags)]
-      tkid <- as.character(tkfind(canvas, "withtag",
-                                  paste(sep="", "vertex&&", id)))
-      .tkplot.deselect.vertex(tkp.id, tkid)
-    } else {
-      .tkplot.deselect.label(tkp.id, tkid)
-    }
-  }
-}
-
-.tkplot.get.selected.vertices <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkids <- as.numeric(tkfind(canvas, "withtag", "vertex&&selected"))
-
-  ids <- sapply(tkids, function(tkid) {
-    tags <- as.character(tkgettags(canvas, tkid))
-    id <- as.numeric(substring(tags [pmatch("v-", tags)], 3))
-    id})
-
-  ids
-}
-
-.tkplot.get.selected.edges <- function(tkp.id) {
-  canvas <- .tkplot.get(tkp.id, "canvas")
-  tkids <- as.numeric(tkfind(canvas, "withtag", "edge&&selected"))
-
-  ids <- sapply(tkids, function(tkid) {
-    tags <- as.character(tkgettags(canvas, tkid))
-    id <- as.numeric(substring(tags [pmatch("edge-", tags)], 6))
-    id})
-
-  ids
-}
-
-###################################################################
-# Internal functions: manipulating the UI
-###################################################################
-
-.tkplot.select.menu <- function(tkp.id, main.menu) {
-  select.menu <- tkmenu(main.menu)
-
-  tkadd(select.menu, "command", label="Select all vertices",
-        command=function() {
-          .tkplot.deselect.all(tkp.id)
-          .tkplot.select.all.vertices(tkp.id)
-        })
-  tkadd(select.menu, "command", label="Select all edges",
-        command=function() {
-          .tkplot.deselect.all(tkp.id)
-          .tkplot.select.all.edges(tkp.id)
-        })
-  tkadd(select.menu, "command", label="Select some vertices...",
-        command=function() {
-          vids <- .tkplot.get.numeric.vector("Select vertices")
-          .tkplot.select.some.vertices(tkp.id, vids[[1]])
-        })
-  tkadd(select.menu, "command", label="Select some edges...",
-        command=function() {
-          fromto <- .tkplot.get.numeric.vector("Select edges from vertices",
-                                               "to vertices")
-          .tkplot.select.some.edges(tkp.id, fromto[[1]], fromto[[2]])
-        })
-  tkadd(select.menu, "separator")
-  tkadd(select.menu, "command", label="Deselect everything",
-        command=function() { .tkplot.deselect.all(tkp.id) })
-
-  select.menu
-}
-
-.tkplot.layout.menu <- function(tkp.id, main.menu) {
-  layout.menu <- tkmenu(main.menu)
-  
-  sapply(.tkplot.getlayoutlist(), function(n) {
-    tkadd(layout.menu, "command", label=.tkplot.getlayoutname(n),
-          command=function() {
-            .tkplot.layout.dialog(tkp.id, n)
-          })
-  })
-  
-  layout.menu
-}
-
-.tkplot.layout.dialog <- function(tkp.id, layout.name) {
-  layout <- .tkplot.getlayout(layout.name)
-
-  # No parameters
-  if (length(layout$params)==0) {
-    return(tkplot.reshape(tkp.id, layout$f, params=list()))
-  }
-  
-  submit <- function() {
-    realparams <- params <- vector(mode="list", length(layout$params))
-    names(realparams) <- names(params) <- names(layout$params)
-    for (i in seq(along=layout$params)) {
-      realparams[[i]] <-
-        params[[i]] <- switch(layout$params[[i]]$type,
-                              "numeric"=as.numeric(tkget(values[[i]])),
-                              "character"=as.character(tkget(values[[i]])),
-                              "logical"=as.logical(tclvalue(values[[i]])),
-                              "choice"=as.character(tclvalue(values[[i]])),
-                              "initial"=as.logical(tclvalue(values[[i]]))
-                              )
-      if (layout$params[[i]]$type=="initial" &&
-          params[[i]]) {
-        realparams[[i]] <- tkplot.getcoords(tkp.id, norm=TRUE)
-      }
-    }
-    if (as.logical(tclvalue(save.default))) {
-      .tkplot.layouts.newdefaults(layout.name, params)
-    }
-    tkdestroy(dialog)
-    tkplot.reshape(tkp.id, layout$f, params=realparams)
-  }
-  
-  dialog <- tktoplevel(.tkplot.get(tkp.id, "top"))
-  
-  tkwm.title(dialog, paste("Layout parameters for graph plot", tkp.id))
-  tkwm.transient(dialog, .tkplot.get(tkp.id, "top"))
-
-  tkgrid(tklabel(dialog, text=paste(layout$name, "layout"),
-                 font=tkfont.create(family="helvetica",size=20,weight="bold")),
-         row=0, column=0, columnspan=2, padx=10, pady=10)
-                 
-  row <- 1
-  values <- list()
-  for (i in seq(along=layout$params)) {
-    
-    tkgrid(tklabel(dialog, text=paste(sep="", layout$params[[i]]$name, ":")),
-                   row=row, column=0, sticky="ne", padx=5, pady=5)
-    
-    if (layout$params[[i]]$type %in% c("numeric", "character")) {
-      values[[i]] <- tkentry(dialog)
-      tkinsert(values[[i]], 0, as.character(layout$params[[i]]$default))
-      tkgrid(values[[i]], row=row, column=1, sticky="nw", padx=5, pady=5)
-    } else if (layout$params[[i]]$type=="logical") {
-      values[[i]] <- tclVar(as.character(layout$params[[i]]$default))
-      tmp <- tkcheckbutton(dialog, onvalue="TRUE", offvalue="FALSE",
-                           variable=values[[i]])
-      tkgrid(tmp, row=row, column=1, sticky="nw", padx=5, pady=5)
-    } else if (layout$params[[i]]$type=="choice") {
-      tmp.frame <- tkframe(dialog)
-      tkgrid(tmp.frame, row=row, column=1, sticky="nw", padx=5, pady=5)
-      values[[i]] <- tclVar(layout$params[[i]]$default)
-      for (j in 1:length(layout$params[[i]]$values)) {
-        tmp <- tkradiobutton(tmp.frame, variable=values[[i]],
-                             value=layout$params[[i]]$values[j],
-                             text=layout$params[[i]]$values[j])
-        tkpack(tmp, anchor="nw")
-      }
-    } else if (layout$params[[i]]$type=="initial") {
-      values[[i]] <- tclVar(as.character(layout$params[[i]]$default))
-      tkgrid(tkcheckbutton(dialog, onvalue="TRUE", offvalue="FALSE",
-                           variable=values[[i]]),
-             row=row, column=1, sticky="nw", padx=5, pady=5)
-    } else if (layout$param[[i]]$type=="expression") {
-      values[[i]] <- tkentry(dialog)
-      .tkplot.g <- .tkplot.get(tkp.id, "graph")
-      tkinsert(values[[i]], 0, as.character(eval(layout$params[[i]]$default)))
-      tkgrid(values[[i]], row=row, column=1, sticky="nw", padx=5, pady=5)
-    }      
-
-    row <- row + 1
-    
-  } # for along layout$params
-
-  tkgrid(tklabel(dialog, text="Set these as defaults"), sticky="ne",
-         row=row, column=0, padx=5, pady=5)
-  save.default <- tclVar("FALSE")
-  tkgrid(tkcheckbutton(dialog, onvalue="TRUE", offvalue="FALSE",
-                       variable=save.default, text=""), row=row,
-         column=1, sticky="nw", padx=5, pady=5)
-  row <- row + 1
-  
-  tkgrid(tkbutton(dialog, text="OK", command=submit), row=row, column=0)
-  tkgrid(tkbutton(dialog, text="Cancel",
-                  command=function() { tkdestroy(dialog); invisible(TRUE) }),
-         row=row, column=1)
-}
-
-.tkplot.select.color <- function(initialcolor) {
-  
-  color <- tclvalue(tcl("tk_chooseColor", initialcolor=initialcolor,
-                        title="Choose a color"))
-  return(color);
-}
-
-###################################################################
-# Internal functions: other
-###################################################################
-
-.tkplot.convert.color <- function(col) {
-  if (is.numeric(col)) {
-    ## convert numeric color based on current palette
-    p <- palette()
-    col <- col %% length(p)
-    col[col==0] <- length(p)
-    col <- palette()[col]
-  } else if (is.character(col) && any(substr(col,1,1)=="#" & nchar(col)==9)) {
-    ## drop alpha channel, tcltk doesn't support it
-    idx <- substr(col,1,1)=="#" & nchar(col)==9
-    col[idx] <- substr(col[idx],1,7)
-  }
-
-  ## replace NA's with ""
-  col[is.na(col)] <- ""
-
-  col
-}
-
-.tkplot.convert.font <- function(font, family, cex) {
-  tk.fonts <- as.character(tkfont.names())
-  if (as.character(font) %in% tk.fonts) {
-    ## already defined Tk font
-    as.character(font)
-  } else {
-    ## we create a font from familiy, font & cex
-    font <- as.numeric(font)
-    family <- as.character(family)
-    cex <- as.numeric(cex)    
-
-    ## multiple sizes
-    if (length(cex) > 1) {
-      return(sapply(cex, .tkplot.convert.font, font=font, family=family))
-    }
-    
-    ## set slant & weight
-    if (font==2) {
-      slant <- "roman"
-      weight <- "bold"
-    } else if (font==3) {
-      slant <- "italic"
-      weight <- "normal"
-    } else if (font==4) {
-      slant <- "italic"
-      weight <- "bold"
-    } else {
-      slant <- "roman"
-      weight <- "normal"
-    }
-
-    ## set tkfamily
-    if (family=="symbol" || font==5) {
-      tkfamily <- "symbol"
-    } else if (family=="serif") {
-      tkfamily <- "Times"
-    } else if (family=="sans") {
-      tkfamily <- "Helvetica"
-    } else if (family=="mono") {
-      tkfamily <- "Courier"
-    } else {
-      ## pass the family and see what happens
-      tkfamily <- family
-    }
-    
-    newfont <- tkfont.create(family=tkfamily, slant=slant, weight=weight,
-                             size=as.integer(12*cex))
-    as.character(newfont)
-  }
-}
-
-i.tkplot.get.edge.lty <- function(edge.lty) {
-
-  if (is.numeric(edge.lty)) {
-    lty <- c( " ", "", "-", ".", "-.", "--", "--.")
-    edge.lty <- lty[edge.lty %% 7 + 1]
-  } else if (is.character(edge.lty)) {
-    wh <- edge.lty %in% c("blank", "solid", "dashed", "dotted", "dotdash",
-                          "longdash", "twodash")
-    lty <- c( " ", "", "-", ".", "-.", "--", "--.")
-    names(lty) <- c("blank", "solid", "dashed", "dotted", "dotdash",
-                    "longdash", "twodash")
-    edge.lty[wh] <- lty[ edge.lty[wh] ]
-  }
-  edge.lty
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/R/topology.R igraph-0.6.5/interfaces/R/igraph/R/topology.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/R/topology.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/R/topology.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-graph.isoclass.subgraph <- function(graph, vids) {
-  # Argument checks
-  if (!is.igraph(graph)) { stop("Not a graph object") }
-  vids <- as.igraph.vs(graph, vids)-1
-
-  on.exit( .Call("R_igraph_finalizer", PACKAGE="igraph") )
-  # Function call
-  res <- .Call("R_igraph_isoclass_subgraph", graph, vids,
-        PACKAGE="igraph")
-  res
-}
-
-# Rest generated by stimulus
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/00Index igraph-0.6.5/interfaces/R/igraph/demo/00Index
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/00Index	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/00Index	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-crashR		A crash-course into R
-centrality	Classic and other vertex centrality indices
-community	Community structure detection
-smallworld	Small-world networks
-cohesive	Cohesive blocking, the Moody & White method
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/centrality.R igraph-0.6.5/interfaces/R/igraph/demo/centrality.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/centrality.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/centrality.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,209 +0,0 @@
-
-pause <- function() {
-  cat("Press ENTER/RETURN/NEWLINE to continue.")
-  readLines(n=1)
-  invisible()
-}
-
-### Traditional approaches: degree, closeness, betweenness
-g <- graph.formula(Andre----Beverly:Diane:Fernando:Carol,
-                   Beverly--Andre:Diane:Garth:Ed,
-                   Carol----Andre:Diane:Fernando,
-                   Diane----Andre:Carol:Fernando:Garth:Ed:Beverly,
-                   Ed-------Beverly:Diane:Garth,
-                   Fernando-Carol:Andre:Diane:Garth:Heather,
-                   Garth----Ed:Beverly:Diane:Fernando:Heather,
-                   Heather--Fernando:Garth:Ike,
-                   Ike------Heather:Jane,
-                   Jane-----Ike )
-
-pause()
-
-### Hand-drawn coordinates
-coords <- c(5,5,119,256,119,256,120,340,478,
-            622,116,330,231,116,5,330,451,231,231,231)
-coords <- matrix(coords, nc=2)
-
-pause()
-
-### Labels the same as names
-V(g)$label <- V(g)$name
-g$layout <- coords # $
-
-pause()
-
-### Take a look at it
-plotG <- function(g) {
-  plot(g, asp=FALSE, vertex.label.color="blue", vertex.label.cex=1.5,
-       vertex.label.font=2, vertex.size=25, vertex.color="white",
-       vertex.frame.color="white", edge.color="black")
-}
-plotG(g)
-
-pause()
-
-### Add degree centrality to labels
-V(g)$label <- paste(sep="\n", V(g)$name, degree(g))
-
-pause()
-
-### And plot again
-plotG(g)
-
-pause()
-
-### Betweenness
-V(g)$label <- paste(sep="\n", V(g)$name, round(betweenness(g), 2))
-plotG(g)
-
-pause()
-
-### Closeness
-V(g)$label <- paste(sep="\n", V(g)$name, round(closeness(g), 2))
-plotG(g)
-
-pause()
-
-### Eigenvector centrality
-V(g)$label <- paste(sep="\n", V(g)$name, round(evcent(g)$vector, 2))
-plotG(g)
-
-pause()
-
-### PageRank
-V(g)$label <- paste(sep="\n", V(g)$name, round(page.rank(g)$vector, 2))
-plotG(g)
-
-pause()
-
-### Correlation between centrality measures
-karate <- graph.famous("Zachary")
-cent <- list(`Degree`=degree(g),
-             `Closeness`=closeness(g),
-             `Betweenness`=betweenness(g),
-             `Eigenvector`=evcent(g)$vector,
-             `PageRank`=page.rank(g)$vector)
-
-pause()
-
-### Pairs plot
-pairs(cent, lower.panel=function(x,y) {
-  usr <- par("usr")
-  text(mean(usr[1:2]), mean(usr[3:4]), round(cor(x,y), 3), cex=2, col="blue")
-} )
-
-pause()
-
-## ### A real network, US supreme court citations
-## ##  You will need internet connection for this to work
-## vertices <- read.csv("http://jhfowler.ucsd.edu/data/judicial.csv")
-## edges <- read.table("http://jhfowler.ucsd.edu/data/allcites.txt")
-## jg <- graph.data.frame(edges, vertices=vertices, dir=TRUE)
-
-## pause()
-
-## ### Basic data
-## summary(jg)
-
-## pause()
-
-## ### Is it a simple graph?
-## is.simple(jg)
-
-## pause()
-
-## ### Is it connected?
-## is.connected(jg)
-
-## pause()
-
-## ### How many components?
-## no.clusters(jg)
-
-## pause()
-
-## ### How big are these?
-## table(clusters(jg)$csize)
-
-## pause()
-
-## ### In-degree distribution
-## plot(degree.distribution(jg, mode="in"), log="xy")
-
-## pause()
-
-## ### Out-degree distribution
-## plot(degree.distribution(jg, mode="out"), log="xy")
-
-## pause()
-
-## ### Largest in- and out-degree, total degree
-## c(max(degree(jg, mode="in")),
-##   max(degree(jg, mode="out")),
-##   max(degree(jg, mode="all")))
-
-## pause()
-
-## ### Density
-## graph.density(jg)
-
-## pause()
-
-## ### Transitivity
-## transitivity(jg)
-
-## pause()
-
-## ### Transitivity of a random graph of the same size
-## g <- erdos.renyi.game(vcount(jg), ecount(jg), type="gnm")
-## transitivity(g)
-
-## pause()
-
-## ### Transitivity of a random graph with the same degree distribution
-## g <- degree.sequence.game(degree(jg, mode="out"), degree(jg, mode="in"),
-##                           method="simple")
-## transitivity(g)
-
-## pause()
-
-## ### Authority and Hub scores
-## AS <- authority.score(jg)$vector
-## HS <- hub.score(jg)$vector
-
-## pause()
-
-## ### Time evolution of authority scores
-## AS <- authority.score(jg)$vector
-## center <- which.max(AS)
-## startyear <- V(jg)[center]$year
-
-## pause()
-
-## ### Function to go back in time
-## auth.year <- function(y) {
-##   print(y)
-##   keep <- which(V(jg)$year <= y)
-##   g2 <- subgraph(jg, keep)
-##   as <- abs(authority.score(g2, scale=FALSE)$vector)
-##   w <- match(V(jg)[center]$usid, V(g2)$usid)
-##   as[w]
-## }
-
-## pause()
-
-## ### Go back in time for the top authority, do a plot
-## AS2 <- sapply(startyear:2005, auth.year)
-## plot(startyear:2005, AS2, type="b", xlab="year", ylab="authority score")
-
-## pause()
-
-## ### Check another case
-## center <- "22US1"
-## startyear <- V(jg)[center]$year
-
-## pause()
-
-## ### Calculate past authority scores & plot them
-## AS3 <- sapply(startyear:2005, auth.year)
-## plot(startyear:2005, AS3, type="b", xlab="year", ylab="authority score")
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/cohesive.R igraph-0.6.5/interfaces/R/igraph/demo/cohesive.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/cohesive.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/cohesive.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-
-pause <- function() {
-  cat("Press ENTER/RETURN/NEWLINE to continue.")
-  readLines(n=1)
-  invisible()
-}
-
-### The Zachary Karate club network
-
-karate <- graph.famous("Zachary")
-summary(karate)
-
-pause()
-
-### Create a layout that is used from now on
-
-karate$layout <- layout.auto(karate)
-plot(karate)
-
-pause()
-
-### Run cohesive blocking on it
-
-cbKarate <- cohesive.blocks(karate)
-cbKarate
-
-pause()
-
-### Plot the results and all the groups
-
-plot(cbKarate, karate)
-
-pause()
-
-### This is a bit messy, plot them step-by-step
-### See the hierarchy tree first
-
-hierarchy(cbKarate)
-plotHierarchy(cbKarate)
-
-## Plot the first level, blocks 1 & 2
-
-plot(cbKarate, karate, mark.groups=blocks(cbKarate)[1:2+1],
-     col="cyan")
-
-pause()
-
-### The second group is simple, plot its more cohesive subgroup
-
-plot(cbKarate, karate, mark.groups=blocks(cbKarate)[c(2,5)+1], col="cyan")
-
-pause()
-
-### The first group has more subgroups, plot them
-
-sub1 <- blocks(cbKarate)[parent(cbKarate)==1]
-sub1
-plot(cbKarate, karate, mark.groups=sub1)
-
-pause()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/community.R igraph-0.6.5/interfaces/R/igraph/demo/community.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,232 +0,0 @@
-
-pause <- function() {
-  cat("Press ENTER/RETURN/NEWLINE to continue.")
-  readLines(n=1)
-  invisible()
-}
-
-### A modular graph has dense subgraphs
-mod <- graph.full(10) %du% graph.full(10) %du% graph.full(10)
-perfect <- c(rep(1,10), rep(2,10), rep(3,10))
-perfect
-
-pause()
-
-### Plot it with community (=component) colors
-plot(mod, vertex.color=perfect, layout=layout.fruchterman.reingold)
-
-pause()
-
-### Modularity of the perfect division
-modularity(mod, perfect)
-
-pause()
-
-### Modularity of the trivial partition, quite bad
-modularity(mod, rep(1, 30))
-
-pause()
-
-### Modularity of a good partition with two communities
-modularity(mod, c(rep(1, 10), rep(2,20)))
-
-pause()
-
-### A real little network, Zachary's karate club data
-karate <- graph.famous("Zachary")
-karate$layout <- layout.kamada.kawai(karate, niter=1000)
-
-pause()
-
-### Greedy algorithm
-fc <- fastgreedy.community(karate)
-memb <- membership(fc)
-plot(karate, vertex.color=memb)
-  
-pause()
-
-### Greedy algorithm, easier plotting
-plot(fc, karate)
-
-pause()
-
-### Spinglass algorithm, create a hierarchical network
-pref.mat <- matrix(0, 16, 16)
-pref.mat[1:4,1:4] <- pref.mat[5:8,5:8] <-
-  pref.mat[9:12,9:12] <- pref.mat[13:16,13:16] <- 7.5/127
-pref.mat[ pref.mat==0 ] <- 5/(3*128)
-diag(pref.mat) <- diag(pref.mat) + 10/31
-
-pause()
-
-### Create the network with the given vertex preferences
-G <- preference.game(128*4, types=16, pref.matrix=pref.mat)
-
-pause()
-
-### Run spinglass community detection with two gamma parameters
-sc1 <- spinglass.community(G, spins=4, gamma=1.0)
-sc2.2 <- spinglass.community(G, spins=16, gamma=2.2)
-
-pause()
-
-### Plot the adjacency matrix, use the Matrix package if available
-if (require(Matrix)) {
-  myimage <- function(...) image(Matrix(...))
-} else {
-  myimage <- image
-}
-A <- get.adjacency(G)
-myimage(A)
-
-pause()
-
-### Ordering according to (big) communities
-ord1 <- order(membership(sc1))
-myimage(A[ord1,ord1])
-
-pause()
-
-### Ordering according to (small) communities
-ord2.2 <- order(membership(sc2.2))
-myimage(A[ord2.2,ord2.2])
-
-pause()
-
-### Consensus ordering
-ord <- order(membership(sc1), membership(sc2.2))
-myimage(A[ord,ord])
-
-pause()
-
-### Comparision of algorithms
-communities <- list()
-
-pause()
-
-### edge.betweenness.community
-ebc <- edge.betweenness.community(karate)
-communities$`Edge betweenness` <- ebc
-
-pause()
-
-### fastgreedy.community
-fc <- fastgreedy.community(karate)
-communities$`Fast greedy` <- fc
-
-pause()
-
-### leading.eigenvector.community
-lec <- leading.eigenvector.community(karate)
-communities$`Leading eigenvector` <- lec
-
-pause()
-
-### spinglass.community
-sc <- spinglass.community(karate, spins=10)
-communities$`Spinglass` <- sc
-
-pause()
-
-### walktrap.community
-wt <- walktrap.community(karate)
-communities$`Walktrap` <- wt
-
-pause()
-
-### label.propagation.community
-labprop <- label.propagation.community(karate)
-communities$`Label propagation` <- labprop
-
-pause()
-
-### Plot everything
-layout(rbind(1:3, 4:6))
-coords <- layout.kamada.kawai(karate)
-lapply(seq_along(communities), function(x) {
-  m <- modularity(communities[[x]])
-  par(mar=c(1,1,3,1))
-  plot(communities[[x]], karate, layout=coords,
-       main=paste(names(communities)[x], "\n",
-         "Modularity:", round(m, 3)))
-})
-
-pause()
-
-### Function to calculate clique communities
-clique.community <- function(graph, k) {
-  clq <- cliques(graph, min=k, max=k)
-  edges <- c()
-  for (i in seq(along=clq)) {
-    for (j in seq(along=clq)) {
-      if ( length(unique(c(clq[[i]], 
-             clq[[j]]))) == k+1 ) {
-        edges <- c(edges, c(i,j))
-      }
-    }
-  }
-  clq.graph <- simplify(graph(edges))
-  V(clq.graph)$name <- 
-    seq(length=vcount(clq.graph))
-  comps <- decompose.graph(clq.graph)
-  
-  lapply(comps, function(x) {
-    unique(unlist(clq[ V(x)$name ]))
-  })
-}
-
-pause()
-
-### Apply it to a graph, this is the example graph from
-##  the original publication
-g <- graph.formula(A-B:F:C:E:D, B-A:D:C:E:F:G, C-A:B:F:E:D, D-A:B:C:F:E,
-                   E-D:A:C:B:F:V:W:U, F-H:B:A:C:D:E, G-B:J:K:L:H,
-                   H-F:G:I:J:K:L, I-J:L:H, J-I:G:H:L, K-G:H:L:M,
-                   L-H:G:I:J:K:M, M-K:L:Q:R:S:P:O:N, N-M:Q:R:P:S:O,
-                   O-N:M:P, P-Q:M:N:O:S, Q-M:N:P:V:U:W:R, R-M:N:V:W:Q,
-                   S-N:P:M:U:W:T, T-S:V:W:U, U-E:V:Q:S:W:T,
-                   V-E:U:W:T:R:Q, W-U:E:V:Q:R:S:T)
-
-pause()
-
-### Hand-made layout to make it look like the original in the paper
-lay <- c(387.0763, 306.6947, 354.0305, 421.0153, 483.5344, 512.1145, 
-         148.6107, 392.4351, 524.6183, 541.5878, 240.6031, 20, 
-         65.54962, 228.0992, 61.9771, 152.1832, 334.3817, 371.8931, 
-         421.9084, 265.6107, 106.6336, 57.51145, 605, 20, 124.8780, 
-         273.6585, 160.2439, 241.9512, 132.1951, 123.6585, 343.1707, 
-         465.1220, 317.561, 216.3415, 226.0976, 343.1707, 306.5854, 
-         123.6585, 360.2439, 444.3902, 532.1951, 720, 571.2195, 
-         639.5122, 505.3659, 644.3902)
-lay <- matrix(lay, nc=2)
-lay[,2] <- max(lay[,2])-lay[,2]
-
-pause()
-
-### Take a look at it
-layout(1)
-plot(g, layout=lay, vertex.label=V(g)$name)
-
-pause()
-
-### Calculate communities
-res <- clique.community(g, k=4)
-
-pause()
-
-### Paint them to different colors
-colbar <- rainbow( length(res)+1 )
-for (i in seq(along=res)) {
-  V(g)[ res[[i]] ]$color <- colbar[i+1]
-}
-
-pause()
-
-### Paint the vertices in multiple communities to red
-V(g)[ unlist(res)[ duplicated(unlist(res)) ] ]$color <- "red"
-
-pause()
-
-### Plot with the new colors
-plot(g, layout=lay, vertex.label=V(g)$name)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/crashR.R igraph-0.6.5/interfaces/R/igraph/demo/crashR.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/crashR.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/crashR.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,341 +0,0 @@
-
-pause <- function() {
-  cat("Press ENTER/RETURN/NEWLINE to continue.")
-  readLines(n=1)
-  invisible()
-}
-
-### R objects, (real) numbers
-a <- 3
-a
-b <- 4
-b
-a+b
-
-pause()
-
-### Case sensitive
-A <- 16
-a
-A
-
-pause()
-
-### Vector objects
-a <- c(1,2,3,4,5,6,7,8,9,10)
-a
-b <- 1:100
-b
-a[1]
-b[1:5]
-a[1] <- 10
-a
-a[1:4] <- 2
-a
-
-pause()
-
-### Vector arithmetic
-a * 2 + 1
-
-pause()
-
-### Functions
-ls()
-length(a)
-mean(a)
-sd(a)
-sd
-c
-
-pause()
-
-### Getting help
-# ?sd
-# ??"standard deviation"
-# RSiteSearch("network betweenness")
-
-pause()
-
-### Classes
-class(2)
-class(1:10)
-class(sd)
-
-pause()
-
-### Character vectors
-char.vec <- c("this", "is", "a", "vector", "of", "characters")
-char_vec <- char.vec
-char.vec[1]
-
-pause()
-
-### Index vectors
-age <- c(45, 36, 65, 21, 52, 19)
-age[1]
-age[1:5]
-age[c(2,5,6)]
-
-b[ seq(1,100,by=2) ]
-
-pause()
-
-### Named vectors
-names(age) <- c("Alice", "Bob", "Cecil", "David", "Eve", "Fiona")
-age
-age["Bob"]
-age[c("Eve", "David", "David")]
-
-pause()
-
-### Indexing with logical vectors
-age[c(FALSE, TRUE, FALSE, TRUE, FALSE, TRUE)]
-names(age)[ age>40 ]
-age > 40
-
-pause()
-
-### Matrices
-M <- matrix(1:20, 10, 2)
-M
-M2 <- matrix(1:20, 10, 2, byrow=TRUE)   ## Named argument!
-M2
-M[1,1]
-M[1,]
-M[,1]
-M[1:5,2]
-
-pause()
-
-### Generic functions
-sd(a)
-sd(M)
-class(a)
-class(M)
-
-pause()
-
-### Lists
-l <- list(1:10, "Hello!", diag(5))
-l
-l[[1]]
-l[2:3]
-l
-l2 <- list(A=1:10, H="Hello!", M=diag(5))
-l2
-l2$A
-l2$M
-
-pause()
-
-### Factors
-countries <- c("SUI", "USA", "GBR", "GER", "SUI",
-               "SUI", "GBR", "GER", "FRA", "GER")
-countries
-fcountries <- factor(countries)
-fcountries
-levels(fcountries)
-
-pause()
-
-### Data frames
-survey <- data.frame(row.names=c("Alice", "Bob", "Cecil", "David", "Eve"),
-                     Sex=c("F","M","F","F","F"),
-                     Age=c(45,36,65,21,52),
-                     Country=c("SUI", "USA", "SUI", "GBR", "USA"),
-                     Married=c(TRUE, FALSE, FALSE, TRUE, TRUE),
-                     Salary=c(70, 65, 200, 45, 100))
-survey
-survey$Sex
-plot(survey$Age, survey$Salary)
-AS.model <- lm(Salary ~ Age, data=survey)
-AS.model
-summary(AS.model)
-abline(AS.model)
-
-tapply(survey$Salary, survey$Country, mean)
-
-pause()
-
-### Packages
-# install.packages("igraph")
-# library(help="igraph")
-library(igraph)
-sessionInfo()
-
-pause()
-
-### Graphs
-## Create a small graph, A->B, A->C, B->C, C->E, D
-## A=1, B=2, C=3, D=4, E=5
-g <- graph( c(1,2, 1,3, 2,3, 3,5), n=5 )
-
-pause()
-
-### Print a graph to the screen
-g
-
-pause()
-
-### Create an undirected graph as well
-## A--B, A--C, B--C, C--E, D
-g2 <- graph( c(1,2, 1,3, 2,3, 3,5), n=5, dir=FALSE )
-g2
-
-pause()
-
-### Is this object an igraph graph?
-is.igraph(g)
-is.igraph(1:10)
-
-pause()
-
-### Summary, number of vertices, edges
-summary(g)
-vcount(g)
-ecount(g)
-
-pause()
-
-### Is the graph directed?
-is.directed(g)
-is.directed(g2)
-
-pause()
-
-### Convert from directed to undirected
-as.undirected(g)
-
-pause()
-
-### And back
-as.directed(as.undirected(g))
-
-pause()
-
-### Multiple edges
-g <- graph( c(1,2,1,2, 1,3, 2,3, 4,5), n=5 )
-g
-
-is.simple(g)
-is.multiple(g)
-
-pause()
-
-### Remove multiple edges
-g <- simplify(g)
-is.simple(g)
-
-pause()
-
-### Loop edges
-g <- graph( c(1,1,1,2, 1,3, 2,3, 4,5), n=5 )
-g
-
-is.simple(g)
-is.loop(g)
-
-pause()
-
-### Remove loop edges
-g <- simplify(g)
-is.simple(g)
-
-pause()
-
-### Naming vertices
-g <- graph.ring(10)
-V(g)$name <- letters[1:10]
-V(g)$name
-g
-print(g, v=T)
-
-pause()
-
-### Create undirected example graph
-g2 <- graph.formula(Alice-Bob:Cecil:Daniel, 
-                    Cecil:Daniel-Eugene:Gordon )
-print(g2, v=T)
-
-pause()
-
-### Remove Alice
-g3 <- delete.vertices(g2, match("Alice", V(g2)$name))
-
-pause()
-
-### Add three new vertices
-g4 <- add.vertices(g3, 3)
-print(g4, v=T)
-igraph.options(print.vertex.attributes=TRUE, 
-               plot.layout=layout.fruchterman.reingold)
-g4
-plot(g4)                      
-
-pause()
-
-### Add three new vertices, with names this time
-g4 <- add.vertices(g3, 3, attr=list(name=c("Helen", "Ike", "Jane")))
-g4
-
-pause()
-
-### Add some edges as well
-g4 <- add.edges(g4, match(c("Helen", "Jane", "Ike", "Jane"), V(g4)$name ))
-g4
-
-pause()
-
-### Edge sequences, first create a directed example graph
-g2 <- graph.formula(Alice -+ Bob:Cecil:Daniel, 
-                    Cecil:Daniel +-+ Eugene:Gordon )
-print(g2, v=T)
-plot(g2, layout=layout.kamada.kawai, vertex.label=V(g2)$name)
-
-pause()
-
-### Sequence of all edges
-E(g2)
-
-pause()
-
-### Edge from a vertex to another
-E(g2, P=c(1,2))
-
-pause()
-
-### Delete this edge
-g3 <- delete.edges(g2, E(g2, P=c(1,2)))
-g3
-
-pause()
-
-### Get the id of the edge
-as.vector(E(g2, P=c(1,2)))
-
-pause()
-
-### All adjacent edges of a vertex
-E(g2)[ adj(3) ]
-
-pause()
-
-### Or multiple vertices
-E(g2)[ adj(c(3,1)) ]
-
-pause()
-
-### Outgoing edges
-E(g2)[ from(3) ]
-
-pause()
-
-### Incoming edges
-E(g2)[ to(3) ]
-
-pause()
-
-### Edges along a path
-E(g2, path=c(1,4,5))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/demo/smallworld.R igraph-0.6.5/interfaces/R/igraph/demo/smallworld.R
--- igraph-0.6.5~quantal1/interfaces/R/igraph/demo/smallworld.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/demo/smallworld.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,188 +0,0 @@
-
-pause <- function() {
-  cat("Press ENTER/RETURN/NEWLINE to continue.")
-  readLines(n=1)
-  invisible()
-}
-
-pause()
-
-### Create a star-like graph
-t1 <- graph.formula(A-B:C:D:E)
-t1
-
-pause()
-
-### Define its plotting properties
-t1$layout <- layout.circle
-V(t1)$color <- "white"
-V(t1)[name=="A"]$color <- "orange"
-V(t1)$size <- 40
-V(t1)$label.cex <- 3
-V(t1)$label <- V(t1)$name
-E(t1)$color <- "black"
-E(t1)$width <- 3
-
-pause()
-
-### Plot 't1' and A's transitivity
-tr <- transitivity(t1, type="local")[1]
-plot(t1, main=paste("Transitivity of 'A':", tr))
-
-pause()
-
-### Add an edge and recalculate transitivity
-t2 <- add.edges(t1, V(t1)[name %in% c("C","D")], color="red", width=3)
-tr <- transitivity(t2, type="local")[1]
-plot(t2, main=paste("Transitivity of 'A':", round(tr,4)))
-
-pause()
-
-### Add two more edges
-newe <- match(c("B", "C", "B", "E"), V(t2)$name)-1
-t3 <- add.edges(t2, newe, color="red", width=3)
-tr <- transitivity(t3, type="local")[1]
-plot(t3, main=paste("Transitivity of 'A':", round(tr,4)))
-
-pause()
-
-### A one dimensional, circular lattice
-ring <- graph.ring(50)
-ring$layout <- layout.circle
-V(ring)$size <- 3
-plot(ring, vertex.label=NA, main="Ring graph")
-
-pause()
-
-### Watts-Strogatz model
-ws1 <- watts.strogatz.game(1, 50, 3, p=0)
-ws1$layout <- layout.circle
-V(ws1)$size <- 3
-E(ws1)$curved <- 1
-plot(ws1, vertex.label=NA, main="regular graph")
-
-pause()
-
-### Zoom in to this part
-axis(1)
-axis(2)
-abline(h=c(0.8, 1.1))
-abline(v=c(-0.2,0.2))
-
-pause()
-
-### Zoom in to this part
-plot(ws1, vertex.label=NA, xlim=c(-0.2, 0.2), ylim=c(0.8,1.1))
-
-pause()
-
-### Transitivity of the ring graph
-transitivity(ws1)
-
-pause()
-
-### Path lengths, regular graph
-average.path.length(ws1)
-
-pause()
-
-### Function to test regular graph with given size
-try.ring.pl <- function(n) {
-  g <- watts.strogatz.game(1, n, 3, p=0)
-  average.path.length(g)
-}
-try.ring.pl(10)
-try.ring.pl(100)
-
-pause()
-
-### Test a number of regular graphs
-ring.size <- seq(100, 1000, by=100)
-ring.pl <- sapply(ring.size, try.ring.pl)
-plot(ring.size, ring.pl, type="b")
-
-pause()
-
-### Path lengths, random graph
-rg <- erdos.renyi.game(50, 50*3, type="gnm")
-rg$layout <- layout.circle
-V(rg)$size <- 3
-plot(rg, vertex.label=NA, main="Random graph")
-average.path.length(rg)
-
-pause()
-
-### Path length of random graphs
-try.random.pl <- function(n) {
-  g <- erdos.renyi.game(n, n*3, type="gnm")
-  average.path.length(g)
-}
-try.random.pl(100)
-
-pause()
-
-### Plot network size vs. average path length
-random.pl <- sapply(ring.size, try.random.pl)
-plot(ring.size, random.pl, type="b")
-
-pause()
-
-### Plot again, logarithmic 'x' axis
-plot(ring.size, random.pl, type="b", log="x")
-
-pause()
-
-### Transitivity, random graph, by definition
-ecount(rg) / (vcount(rg)*(vcount(rg)-1)/2)
-transitivity(rg, type="localaverage")
-
-pause()
-
-### Rewiring
-ws2 <- watts.strogatz.game(1, 50, 3, p=0.1)
-ws2$layout <- layout.circle
-V(ws2)$size <- 3
-plot(ws2, vertex.label=NA)
-average.path.length(ws2)
-
-pause()
-
-### Path lengths in randomized lattices
-try.rr.pl <- function(n, p) {
-  g <- watts.strogatz.game(1, n, 3, p=p)
-  average.path.length(g)
-}
-rr.pl.0.1 <- sapply(ring.size, try.rr.pl, p=0.1)
-plot(ring.size, rr.pl.0.1, type="b")
-
-pause()
-
-### Logarithmic 'x' axis 
-plot(ring.size, rr.pl.0.1, type="b", log="x")
-
-pause()
-
-### Create the graph in the Watts-Strogatz paper
-ws.paper <- function(p, n=1000) {
-  g <- watts.strogatz.game(1, n, 10, p=p)
-  tr <- transitivity(g, type="localaverage")
-  pl <- average.path.length(g)
-  c(tr, pl)
-}
-
-pause()
-
-### Do the simulation for a number of 'p' values
-rewire.prob <- ((1:10)^4)/(10^4)
-ws.result <- sapply(rewire.prob, ws.paper)
-dim(ws.result)
-
-pause()
-
-### Plot it
-plot(rewire.prob, ws.result[1,]/ws.result[1,1], log="x", pch=22,
-     xlab="p", ylab="")
-points(rewire.prob, ws.result[2,]/ws.result[2,1], pch=20)
-legend("bottomleft", c(expression(C(p)/C(0)), expression(L(p)/L(0))),
-       pch=c(22, 20))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/AUTHORS igraph-0.6.5/interfaces/R/igraph/inst/AUTHORS
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/AUTHORS	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/AUTHORS	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-
-igraph authors, in alphabetical order:
---------------------------------------
-
-Patrick R. Amestoy	AMD library
-Adelchi Azzalini	igraph.options based on the sm package
-Tamas Badics		GLPK
-Gregory Benison		Minimum cut calculation
-Adrian Bowman		igraph.options based on the sm package
-Keith Briggs		Parts from the Very Nauty Graph Library
-      			Geometric random graphs
-			Girth
-      			Various patches and bug fixes
-Jeroen Bruggeman	spinglass community detection
-       			Burt's constraints
-Juergen Buchmueller	Big number math implementation
-Carter T. Butts		Some layout algorithms from the SNA R package
-       	  		bonpow function in the SNA R package
-			Some R manual pages, from the SNA R package
-Aaron Clauset		Hierarchical random graphs
-J.T. Conklin		logbl function
-Topher Cooper		GSL random number generators (not used in R)
-Gabor Csardi		Most of igraph
-Peter DalGaard		zeroin root finder
-Timothy A Davis		CXSPARSE: a Concise Sparse Matrix package - Extended
-	  		AMD library
-	  		Sparse matrix column ordering
-Laurent Deniau		Bits of the error handling system
-Ulrich Drepper		logbl function
-Iain S. Duff		AMD library
-     			GLPK
-S.I. Feldman		f2c
-David Firth		Display data frame in Tk, from relimp package
-P. Foggia		VF2 graph isomorphism algorithm
-John Fox		R: suppressing X11 warnings
-Alan George   		GLPK
-John Gilbert		Sparse matrix column ordering
-D.Goldfarb		GLPK
-Brian Gough		GSL random number generators (not used in R)
-Tom Gregorovic		Multilevel community detection
-M.Grigoriadis		GLPK
-Oscar Gustafsson	GLPK
-Paul Hsieh		pstdint.h
-Ross Ihaka		Some random number generators (not used in R)
-Tommi Junttila		BLISS graph isomorphism library
-Petteri Kaski		BLISS graph isomorphism library
-Oleg Keselyov		zeroin root finder
-Darwin Klingman		GLPK
-Donald E. Knuth		GLPK
-Stefan I. Larimore	Sparse matrix column ordering
-Yusin Lee 		GLPK
-Richard Lehoucq		ARPACK
-Rene Locher		R arrow drawing function, from IDPmisc package
-J.C. Nash		BFGS optimizer
-Joseph W-H Liu		GLPK
-Makoto Matsumoto	GSL random number generators (not used in R)
-Vincent Matossian	Graph laplacian
-			igraph_neighborhood_graphs
-			Line graphs
-Peter McMahan		Cohesive blocking
-Andrew Makhorin		GLPK
-David Morton de Lachapelle	Spectral coarse graining
-Laurence Muller		Fixes for compilation on MS Visual Studio
-Emmanuel Navarro	infomap community detection
-	 		Various fixes and patches
-Tamas Nepusz		Most of igraph
-Esmond Ng 		Sparse matrix column ordering
-Kevin O'Neill		Maximal independent vertex sets
-Takuji Nishimura	GSL random number generators (not used in R)
-Jim Orlin		GLPK
-Patric Ostergard	GLPK
-Elliot Paquette		psumtree data type
-Pascal Pons		walktrap community detection
-Joerg Reichardt		spinglass community detection
-Marc Rieffel		GSL random number generators (not used in R)
-B.D. Ripley		igraph.options based on the sm package
-     			BFGS optimizer
-			Various bug fixes
-Martin Rosvall		infomap community detection
-Andreas Ruckstuhl	R arrow drawing function, from IDPmisc package
-Heinrich Schuchardt	GLPK
-J.K. Reid 		GLPK
-C. Sansone		VF2 graph isomorphism algorithm
-Michael Schmuhl		The graphopt layout generator
-Danny Sorensen		ARPACK
-James Theiler		GSL random number generators (not used in R)
-Samuel Thiriot		Interconnected islands graph generator
-Vincent A. Traag	spinglass community detection
-Magnus Torfason		R operators that work by name
-Minh Van Nguyen		Microscopic update rules
-     	 		Various test cases
-     	 		Many documentation and other fixes
-M. Vento		VF2 graph isomorphism algorithm
-Fabien Viger		gengraph graph generator
-Phuong Vu		ARPACK
-P.J. Weinberger		f2c
-Garrett A. Wollman	qsort
-B.N. Wylie 		DrL layout generator
-Chao Yang		ARPACK
-
-Institutional copyright owners:
--------------------------------
-
-Free Software Foundation, Inc	Code generated by bison
-Sandia Corporation	  	DrL layout generator
-The R Development Core Team 	Some random number generators (not used in R)
-      		       		R: as.dendrogram from stats package
-The Regents of the University of California	qsort
-Xerox PARC		      	Sparse matrix column ordering
-
-Other contributors
-------------------
-
-Neal Becker		Patches to compile with gcc 4.4
-Richard Bowman		R patches
-Alex Chen		Patch to compile on Intel compilers
-Daniel Cordeiro 	Patches
-Tom Gregorovic		Bug fixes
-Mayank Lahiri		Forest fire game fix
-John Lapeyre 		Patches
-Christopher Lu		Various fixes and patches
-André Panisson		R patches
-Bob Pap 		Bug fixes
-Keith Ponting		R package bug fixes
-Martin J Reed		Bug fixes
-Elena Tea Russo		Bug fixes
-KennyTM			Bug fixes
-Jordi Torrents		Patches
-Matthew Walker		Various patches
-Kai Willadsen		Arrow size support in Python
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/CITATION igraph-0.6.5/interfaces/R/igraph/inst/CITATION
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/CITATION	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/CITATION	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-citHeader("To cite 'igraph' in publications use:")
-
-citEntry(entry="article",
-	 title="The igraph software package for complex network research",
-         author=personList(as.person("Gabor Csardi"),
-			   as.person("Tamas Nepusz")),
-	 journal="InterJournal",
-         volume="Complex Systems",
-         pages="1695",
-         year="2006",
-         url="http://igraph.sf.net",
-         textVersion=paste("Csardi G, Nepusz T: The igraph software package for ",
-                           "complex network research, InterJournal, ",
-                           "Complex Systems 1695. 2006. ",
-                           "http://igraph.sf.net", sep=""))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/html_library.license.terms igraph-0.6.5/interfaces/R/igraph/inst/html_library.license.terms
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/html_library.license.terms	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/html_library.license.terms	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-Sun Microsystems, Inc.  The following terms apply to all files
-associated with the software unless explicitly disclaimed in individual
-files.
-
-The authors hereby grant permission to use, copy, modify, distribute,
-and license this software and its documentation for any purpose, provided
-that existing copyright notices are retained in all copies and that this
-notice is included verbatim in any distributions. No written agreement,
-license, or royalty fee is required for any of the authorized uses.
-Modifications to this software may be copyrighted by their authors
-and need not follow the licensing terms described here, provided that
-the new terms are clearly indicated on the first page of each file where
-they apply.
-
-IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
-FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
-ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
-DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGE.
-
-THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
-INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE
-IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
-NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
-MODIFICATIONS.
-
-RESTRICTED RIGHTS: Use, duplication or disclosure by the government
-is subject to the restrictions as set forth in subparagraph (c) (1) (ii)
-of the Rights in Technical Data and Computer Software Clause as DFARS
-252.227-7013 and FAR 52.227-19.
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/html_library.tcl igraph-0.6.5/interfaces/R/igraph/inst/html_library.tcl
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/html_library.tcl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/html_library.tcl	1970-01-01 00:00:00.000000000 +0000
@@ -1,1417 +0,0 @@
-# Simple HTML display library by Stephen Uhler (stephen.uhler@sun.com)
-# Copyright (c) 1995 by Sun Microsystems
-# Version 0.3 Fri Sep  1 10:47:17 PDT 1995
-#
-# See the file "license.terms" for information on usage and redistribution
-# of this file, and for a DISCLAIMER OF ALL WARRANTIES.
-#
-# To use this package,  create a text widget (say, .text)
-# and set a variable full of html, (say $html), and issue:
-#	HMinit_win .text
-#	HMparse_html $html "HMrender .text"
-# You also need to supply the routine:
-#   proc HMlink_callback {win href} { ...}
-#      win:  The name of the text widget
-#      href  The name of the link
-# which will be called anytime the user "clicks" on a link.
-# The supplied version just prints the link to stdout.
-# In addition, if you wish to use embedded images, you will need to write
-#   proc HMset_image {handle src}
-#      handle  an arbitrary handle (not really)
-#      src     The name of the image
-# Which calls
-#	HMgot_image $handle $image
-# with the TK image.
-#
-# To return a "used" text widget to its initialized state, call:
-#   HMreset_win .text
-# See "sample.tcl" for sample usage
-##################################################################
-############################################
-# mapping of html tags to text tag properties
-# properties beginning with "T" map directly to text tags
-
-# These are Defined in HTML 2.0
-
-array set HMtag_map {
-	b      {weight bold}
-	blockquote	{style i indent 1 Trindent rindent}
-	bq		{style i indent 1 Trindent rindent}
-	cite   {style i}
-	code   {family courier}
-	dfn    {style i}	
-	dir    {indent 1}
-	dl     {indent 1}
-	em     {style i}
-	h1     {size 24 weight bold}
-	h2     {size 22}		
-	h3     {size 20}	
-	h4     {size 18}
-	h5     {size 16}
-	h6     {style i}
-	i      {style i}
-	kbd    {family courier weight bold}
-	menu     {indent 1}
-	ol     {indent 1}
-	pre    {fill 0 family courier Tnowrap nowrap}
-	samp   {family courier}		
-	strong {weight bold}		
-	tt     {family courier}
-	u	 {Tunderline underline}
-	ul     {indent 1}
-	var    {style i}	
-}
-
-# These are in common(?) use, but not defined in html2.0
-
-array set HMtag_map {
-	center {Tcenter center}
-	strike {Tstrike strike}
-	u	   {Tunderline underline}
-}
-
-# initial values
-
-set HMtag_map(hmstart) {
-	family times   weight medium   style r   size 14
-	Tcenter ""   Tlink ""   Tnowrap ""   Tunderline ""   list list
-	fill 1   indent "" counter 0 adjust 0
-}
-
-# html tags that insert white space
-
-array set HMinsert_map {
-	blockquote "\n\n" /blockquote "\n"
-	br	"\n"
-	dd	"\n" /dd	"\n"
-	dl	"\n" /dl	"\n"
-	dt	"\n"
-	form "\n"	/form "\n"
-	h1	"\n\n"	/h1	"\n"
-	h2	"\n\n"	/h2	"\n"
-	h3	"\n\n"	/h3	"\n"
-	h4	"\n"	/h4	"\n"
-	h5	"\n"	/h5	"\n"
-	h6	"\n"	/h6	"\n"
-	li   "\n"
-	/dir "\n"
-	/ul "\n"
-	/ol "\n"
-	/menu "\n"
-	p	"\n\n"
-	pre "\n"	/pre "\n"
-}
-
-# tags that are list elements, that support "compact" rendering
-
-array set HMlist_elements {
-	ol 1   ul 1   menu 1   dl 1   dir 1
-}
-############################################
-# initialize the window and stack state
-
-proc HMinit_win {win} {
-	upvar #0 HM$win var
-	
-	HMinit_state $win
-	$win tag configure underline -underline 1
-	$win tag configure center -justify center
-	$win tag configure nowrap -wrap none
-	$win tag configure rindent -rmargin $var(S_tab)c
-	$win tag configure strike -overstrike 1
-	$win tag configure mark -foreground red		;# list markers
-	$win tag configure list -spacing1 3p -spacing3 3p		;# regular lists
-	$win tag configure compact -spacing1 0p		;# compact lists
-	$win tag configure link -borderwidth 2 -foreground blue	;# hypertext links
-	HMset_indent $win $var(S_tab)
-	$win configure -wrap word
-
-	# configure the text insertion point
-	$win mark set $var(S_insert) 1.0
-
-	# for horizontal rules
-	$win tag configure thin -font [HMx_font times 2 medium r]
-	$win tag configure hr -relief sunken -borderwidth 2 -wrap none \
-		-tabs [winfo width $win]
-	bind $win <Configure> {
-		%W tag configure hr -tabs %w
-		%W tag configure last -spacing3 %h
-	}
-
-	# generic link enter callback
-
-	$win tag bind link <1> "HMlink_hit $win %x %y"
-}
-
-# set the indent spacing (in cm) for lists
-# TK uses a "weird" tabbing model that causes \t to insert a single
-# space if the current line position is past the tab setting
-
-proc HMset_indent {win cm} {
-	set tabs [expr $cm / 2.0]
-	$win configure -tabs ${tabs}c
-	foreach i {1 2 3 4 5 6 7 8 9} {
-		set tab [expr $i * $cm]
-		$win tag configure indent$i -lmargin1 ${tab}c -lmargin2 ${tab}c \
-			-tabs "[expr $tab + $tabs]c [expr $tab + 2*$tabs]c"
-	}
-}
-
-# reset the state of window - get ready for the next page
-# remove all but the font tags, and remove all form state
-
-proc HMreset_win {win} {
-	upvar #0 HM$win var
-	regsub -all { +[^L ][^ ]*} " [$win tag names] " {} tags
-	catch "$win tag delete $tags"
-	eval $win mark unset [$win mark names]
-	$win delete 0.0 end
-	$win tag configure hr -tabs [winfo width $win]
-
-	# configure the text insertion point
-	$win mark set $var(S_insert) 1.0
-
-	# remove form state.  If any check/radio buttons still exists, 
-	# their variables will be magically re-created, and never get
-	# cleaned up.
-	catch unset [info globals HM$win.form*]
-
-	HMinit_state $win
-	return HM$win
-}
-
-# initialize the window's state array
-# Parameters beginning with S_ are NOT reset
-#  adjust_size:		global font size adjuster
-#  unknown:		character to use for unknown entities
-#  tab:			tab stop (in cm)
-#  stop:		enabled to stop processing
-#  update:		how many tags between update calls
-#  tags:		number of tags processed so far
-#  symbols:		Symbols to use on un-ordered lists
-
-proc HMinit_state {win} {
-	upvar #0 HM$win var
-	array set tmp [array get var S_*]
-	catch {unset var}
-	array set var {
-		stop 0
-		tags 0
-		fill 0
-		list list
-		S_adjust_size 0
-		S_tab 1.0
-		S_unknown \xb7
-		S_update 10
-		S_symbols O*=+-o\xd7\xb0>:\xb7
-		S_insert Insert
-	}
-	array set var [array get tmp]
-}
-
-# alter the parameters of the text state
-# this allows an application to over-ride the default settings
-# it is called as: HMset_state -param value -param value ...
-
-array set HMparam_map {
-	-update S_update
-	-tab S_tab
-	-unknown S_unknown
-	-stop S_stop
-	-size S_adjust_size
-	-symbols S_symbols
-    -insert S_insert
-}
-
-proc HMset_state {win args} {
-	upvar #0 HM$win var
-	global HMparam_map
-	set bad 0
-	if {[catch {array set params $args}]} {return 0}
-	foreach i [array names params] {
-		incr bad [catch {set var($HMparam_map($i)) $params($i)}]
-	}
-	return [expr $bad == 0]
-}
-
-############################################
-# manage the display of html
-
-# HMrender gets called for every html tag
-#   win:   The name of the text widget to render into
-#   tag:   The html tag (in arbitrary case)
-#   not:   a "/" or the empty string
-#   param: The un-interpreted parameter list
-#   text:  The plain text until the next html tag
-
-proc HMrender {win tag not param text} {
-	upvar #0 HM$win var
-	if {$var(stop)} return
-	global HMtag_map HMinsert_map HMlist_elements
-	set tag [string tolower $tag]
-	set text [HMmap_esc $text]
-
-	# manage compact rendering of lists
-	if {[info exists HMlist_elements($tag)]} {
-		set list "list [expr {[HMextract_param $param compact] ? "compact" : "list"}]"
-	} else {
-		set list ""
-	}
-
-	# Allow text to be diverted to a different window (for tables)
-	# this is not currently used
-	if {[info exists var(divert)]} {
-		set win $var(divert)
-		upvar #0 HM$win var
-	}
-
-	# adjust (push or pop) tag state
-	catch {HMstack $win $not "$HMtag_map($tag) $list"}
-
-	# insert white space (with current font)
-	# adding white space can get a bit tricky.  This isn't quite right
-	set bad [catch {$win insert $var(S_insert) $HMinsert_map($not$tag) "space $var(font)"}]
-	if {!$bad && [lindex $var(fill) end]} {
-		set text [string trimleft $text]
-	}
-
-	# to fill or not to fill
-	if {[lindex $var(fill) end]} {
-		set text [HMzap_white $text]
-	}
-
-	# generic mark hook
-	catch {HMmark $not$tag $win $param text} err
-
-	# do any special tag processing
-	catch {HMtag_$not$tag $win $param text} msg
-
-
-	# add the text with proper tags
-
-	set tags [HMcurrent_tags $win]
-	$win insert $var(S_insert) $text $tags
-
-	# We need to do an update every so often to insure interactive response.
-	# This can cause us to re-enter the event loop, and cause recursive
-	# invocations of HMrender, so we need to be careful.
-	if {!([incr var(tags)] % $var(S_update))} {
-		update
-	}
-}
-
-# html tags requiring special processing
-# Procs of the form HMtag_<tag> or HMtag_</tag> get called just before
-# the text for this tag is displayed.  These procs are called inside a 
-# "catch" so it is OK to fail.
-#   win:   The name of the text widget to render into
-#   param: The un-interpreted parameter list
-#   text:  A pass-by-reference name of the plain text until the next html tag
-#          Tag commands may change this to affect what text will be inserted
-#          next.
-
-# A pair of pseudo tags are added automatically as the 1st and last html
-# tags in the document.  The default is <HMstart> and </HMstart>.
-# Append enough blank space at the end of the text widget while
-# rendering so HMgoto can place the target near the top of the page,
-# then remove the extra space when done rendering.
-
-proc HMtag_hmstart {win param text} {
-	upvar #0 HM$win var
-	$win mark gravity $var(S_insert) left
-	$win insert end "\n " last
-	$win mark gravity $var(S_insert) right
-}
-
-proc HMtag_/hmstart {win param text} {
-	$win delete last.first end
-}
-
-# put the document title in the window banner, and remove the title text
-# from the document
-
-proc HMtag_title {win param text} {
-	upvar $text data
-	wm title [winfo toplevel $win] $data
-	set data ""
-}
-
-proc HMtag_hr {win param text} {
-	upvar #0 HM$win var
-	$win insert $var(S_insert) "\n" space "\n" thin "\t" "thin hr" "\n" thin
-}
-
-# list element tags
-
-proc HMtag_ol {win param text} {
-	upvar #0 HM$win var
-	set var(count$var(level)) 0
-}
-
-proc HMtag_ul {win param text} {
-	upvar #0 HM$win var
-	catch {unset var(count$var(level))}
-}
-
-proc HMtag_menu {win param text} {
-	upvar #0 HM$win var
-	set var(menu) ->
-	set var(compact) 1
-}
-
-proc HMtag_/menu {win param text} {
-	upvar #0 HM$win var
-	catch {unset var(menu)}
-	catch {unset var(compact)}
-}
-	
-proc HMtag_dt {win param text} {
-	upvar #0 HM$win var
-	upvar $text data
-	set level $var(level)
-	incr level -1
-	$win insert $var(S_insert) "$data" \
-		"hi [lindex $var(list) end] indent$level $var(font)"
-	set data {}
-}
-
-proc HMtag_li {win param text} {
-	upvar #0 HM$win var
-	set level $var(level)
-	incr level -1
-	set x [string index $var(S_symbols)+-+-+-+-" $level]
-	catch {set x [incr var(count$level)]}
-	catch {set x $var(menu)}
-	$win insert $var(S_insert) \t$x\t "mark [lindex $var(list) end] indent$level $var(font)"
-}
-
-# Manage hypertext "anchor" links.  A link can be either a source (href)
-# a destination (name) or both.  If its a source, register it via a callback,
-# and set its default behavior.  If its a destination, check to see if we need
-# to go there now, as a result of a previous HMgoto request.  If so, schedule
-# it to happen with the closing </a> tag, so we can highlight the text up to
-# the </a>.
-
-proc HMtag_a {win param text} {
-	upvar #0 HM$win var
-
-	# a source
-
-	if {[HMextract_param $param href]} {
-		set var(Tref) [list L:$href]
-		HMstack $win "" "Tlink link"
-		HMlink_setup $win $href
-	}
-
-	# a destination
-
-	if {[HMextract_param $param name]} {
-		set var(Tname) [list N:$name]
-		HMstack $win "" "Tanchor anchor"
-		$win mark set N:$name "$var(S_insert) - 1 chars"
-		$win mark gravity N:$name left
-		if {[info exists var(goto)] && $var(goto) == $name} {
-			unset var(goto)
-			set var(going) $name
-		}
-	}
-}
-
-# The application should call here with the fragment name
-# to cause the display to go to this spot.
-# If the target exists, go there (and do the callback),
-# otherwise schedule the goto to happen when we see the reference.
-
-proc HMgoto {win where {callback HMwent_to}} {
-	upvar #0 HM$win var
-	if {[regexp N:$where [$win mark names]]} {
-		$win see N:$where
-		update
-		eval $callback $win [list $where]
-		return 1
-	} else {
-		set var(goto) $where
-		return 0
-	}
-}
-
-# We actually got to the spot, so highlight it!
-# This should/could be replaced by the application
-# We'll flash it orange a couple of times.
-
-proc HMwent_to {win where {count 0} {color orange}} {
-	upvar #0 HM$win var
-	if {$count > 5} return
-	catch {$win tag configure N:$where -foreground $color}
-	update
-	after 200 [list HMwent_to $win $where [incr count] \
-				[expr {$color=="orange" ? "" : "orange"}]]
-}
-
-proc HMtag_/a {win param text} {
-	upvar #0 HM$win var
-	if {[info exists var(Tref)]} {
-		unset var(Tref)
-		HMstack $win / "Tlink link"
-	}
-
-	# goto this link, then invoke the call-back.
-
-	if {[info exists var(going)]} {
-		$win yview N:$var(going)
-		update
-		HMwent_to $win $var(going)
-		unset var(going)
-	}
-
-	if {[info exists var(Tname)]} {
-		unset var(Tname)
-		HMstack $win / "Tanchor anchor"
-	}
-}
-
-#           Inline Images
-# This interface is subject to change
-# Most of the work is getting around a limitation of TK that prevents
-# setting the size of a label to a widthxheight in pixels
-#
-# Images have the following parameters:
-#    align:  top,middle,bottom
-#    alt:    alternate text
-#    ismap:  A clickable image map
-#    src:    The URL link
-# Netscape supports (and so do we)
-#    width:  A width hint (in pixels)
-#    height:  A height hint (in pixels)
-#    border: The size of the window border
-
-proc HMtag_img {win param text} {
-	upvar #0 HM$win var
-
-	# get alignment
-	array set align_map {top top    middle center    bottom bottom}
-	set align bottom		;# The spec isn't clear what the default should be
-	HMextract_param $param align
-	catch {set align $align_map([string tolower $align])}
-
-	# get alternate text
-	set alt "<image>"
-	HMextract_param $param alt
-	set alt [HMmap_esc $alt]
-
-	# get the border width
-	set border 1
-	HMextract_param $param border
-
-	# see if we have an image size hint
-	# If so, make a frame the "hint" size to put the label in
-	# otherwise just make the label
-	set item $win.$var(tags)
-	# catch {destroy $item}
-	if {[HMextract_param $param width] && [HMextract_param $param height]} {
-		frame $item -width $width -height $height
-		pack propagate $item 0
-		set label $item.label
-		label $label
-		pack $label -expand 1 -fill both
-	} else {
-		set label $item
-		label $label 
-	}
-
-	$label configure -relief ridge -fg orange -text $alt
-	catch {$label configure -bd $border}
-	$win window create $var(S_insert) -align $align -window $item -pady 2 -padx 2
-
-	# add in all the current tags (this is overkill)
-	set tags [HMcurrent_tags $win]
-	foreach tag $tags {
-		$win tag add $tag $item
-	}
-
-	# set imagemap callbacks
-	if {[HMextract_param $param ismap]} {
-		# regsub -all {[^L]*L:([^ ]*).*}  $tags {\1} link
-		set link [lindex $tags [lsearch -glob $tags L:*]]
-		regsub L: $link {} link
-		global HMevents
-		regsub -all {%} $link {%%} link2
-		foreach i [array names HMevents] {
-			bind $label <$i> "catch \{%W configure $HMevents($i)\}"
-		}
-		bind $label <1> "+HMlink_callback $win $link2?%x,%y"
-	} 
-
-	# now callback to the application
-	set src ""
-	HMextract_param $param src
-	HMset_image $win $label $src
-	return $label	;# used by the forms package for input_image types
-}
-
-# The app needs to supply one of these
-proc HMset_image {win handle src} {
-	HMgot_image $handle "can't get\n$src"
-}
-
-# When the image is available, the application should call back here.
-# If we have the image, put it in the label, otherwise display the error
-# message.  If we don't get a callback, the "alt" text remains.
-# if we have a clickable image, arrange for a callback
-
-proc HMgot_image {win image_error} {
-	# if we're in a frame turn on geometry propogation
-	if {[winfo name $win] == "label"} {
-		pack propagate [winfo parent $win] 1
-	}
-	if {[catch {$win configure -image $image_error}]} {
-		$win configure -image {}
-		$win configure -text $image_error
-	}
-}
-
-# Sample hypertext link callback routine - should be replaced by app
-# This proc is called once for each <A> tag.
-# Applications can overwrite this procedure, as required, or
-# replace the HMevents array
-#   win:   The name of the text widget to render into
-#   href:  The HREF link for this <a> tag.
-
-array set HMevents {
-	Enter	{-borderwidth 2 -relief raised }
-	Leave	{-borderwidth 2 -relief flat }
-	1		{-borderwidth 2 -relief sunken}
-	ButtonRelease-1	{-borderwidth 2 -relief raised}
-}
-
-# We need to escape any %'s in the href tag name so the bind command
-# doesn't try to substitute them.
-
-proc HMlink_setup {win href} {
-	global HMevents
-	regsub -all {%} $href {%%} href2
-	foreach i [array names HMevents] {
-		eval {$win tag bind  L:$href <$i>} \
-			\{$win tag configure \{L:$href2\} $HMevents($i)\}
-	}
-}
-
-# generic link-hit callback
-# This gets called upon button hits on hypertext links
-# Applications are expected to supply ther own HMlink_callback routine
-#   win:   The name of the text widget to render into
-#   x,y:   The cursor position at the "click"
-
-proc HMlink_hit {win x y} {
-	set tags [$win tag names @$x,$y]
-	set link [lindex $tags [lsearch -glob $tags L:*]]
-	# regsub -all {[^L]*L:([^ ]*).*}  $tags {\1} link
-	regsub L: $link {} link
-	HMlink_callback $win $link
-}
-
-# replace this!
-#   win:   The name of the text widget to render into
-#   href:  The HREF link for this <a> tag.
-
-proc HMlink_callback {win href} {
-	puts "Got hit on $win, link $href"
-}
-
-# extract a value from parameter list (this needs a re-do)
-# returns "1" if the keyword is found, "0" otherwise
-#   param:  A parameter list.  It should alredy have been processed to
-#           remove any entity references
-#   key:    The parameter name
-#   val:    The variable to put the value into (use key as default)
-
-proc HMextract_param {param key {val ""}} {
-
-	if {$val == ""} {
-		upvar $key result
-	} else {
-		upvar $val result
-	}
-    set ws "    \n\r"
- 
-    # look for name=value combinations.  Either (') or (") are valid delimeters
-    if {
-      [regsub -nocase [format {.*%s[%s]*=[%s]*"([^"]*).*} $key $ws $ws] $param {\1} value] ||
-      [regsub -nocase [format {.*%s[%s]*=[%s]*'([^']*).*} $key $ws $ws] $param {\1} value] ||
-      [regsub -nocase [format {.*%s[%s]*=[%s]*([^%s]+).*} $key $ws $ws $ws] $param {\1} value] } {
-        set result $value
-        return 1
-    }
-
-	# now look for valueless names
-	# I should strip out name=value pairs, so we don't end up with "name"
-	# inside the "value" part of some other key word - some day
-	
-	set bad \[^a-zA-Z\]+
-	if {[regexp -nocase  "$bad$key$bad" -$param-]} {
-		return 1
-	} else {
-		return 0
-	}
-}
-
-# These next two routines manage the display state of the page.
-
-# Push or pop tags to/from stack.
-# Each orthogonal text property has its own stack, stored as a list.
-# The current (most recent) tag is the last item on the list.
-# Push is {} for pushing and {/} for popping
-
-proc HMstack {win push list} {
-	upvar #0 HM$win var
-	array set tags $list
-	if {$push == ""} {
-		foreach tag [array names tags] {
-			lappend var($tag) $tags($tag)
-		}
-	} else {
-		foreach tag [array names tags] {
-			# set cnt [regsub { *[^ ]+$} $var($tag) {} var($tag)]
-			set var($tag) [lreplace $var($tag) end end]
-		}
-	}
-}
-
-# extract set of current text tags
-# tags starting with T map directly to text tags, all others are
-# handled specially.  There is an application callback, HMset_font
-# to allow the application to do font error handling
-
-proc HMcurrent_tags {win} {
-	upvar #0 HM$win var
-	set font font
-	foreach i {family size weight style} {
-		set $i [lindex $var($i) end]
-		append font :[set $i]
-	}
-	set xfont [HMx_font $family $size $weight $style $var(S_adjust_size)]
-	HMset_font $win $font $xfont
-	set indent [llength $var(indent)]
-	incr indent -1
-	lappend tags $font indent$indent
-	foreach tag [array names var T*] {
-		lappend tags [lindex $var($tag) end]	;# test
-	}
-	set var(font) $font
-	set var(xfont) [$win tag cget $font -font]
-	set var(level) $indent
-	return $tags
-}
-
-# allow the application to do do better font management
-# by overriding this procedure
-
-proc HMset_font {win tag font} {
-	catch {$win tag configure $tag -font $font} msg
-}
-
-# generate an X font name
-proc HMx_font {family size weight style {adjust_size 0}} {
-	catch {incr size $adjust_size}
-	return "-*-$family-$weight-$style-normal-*-*-${size}0-*-*-*-*-*-*"
-}
-
-# Optimize HMrender (hee hee)
-# This is experimental
-
-proc HMoptimize {} {
-	regsub -all "\n\[ 	\]*#\[^\n\]*" [info body HMrender] {} body
-	regsub -all ";\[ 	\]*#\[^\n]*" $body {} body
-	regsub -all "\n\n+" $body \n body
-	proc HMrender {win tag not param text} $body
-}
-############################################
-# Turn HTML into TCL commands
-#   html    A string containing an html document
-#   cmd		A command to run for each html tag found
-#   start	The name of the dummy html start/stop tags
-
-proc HMparse_html {html {cmd HMtest_parse} {start hmstart}} {
-	regsub -all \{ $html {\&ob;} html
-	regsub -all \} $html {\&cb;} html
-	set w " \t\r\n"	;# white space
-	proc HMcl x {return "\[$x\]"}
-	set exp <(/?)([HMcl ^$w>]+)[HMcl $w]*([HMcl ^>]*)>
-	set sub "\}\n$cmd {\\2} {\\1} {\\3} \{"
-	regsub -all $exp $html $sub html
-	eval "$cmd {$start} {} {} \{ $html \}"
-	eval "$cmd {$start} / {} {}"
-}
-
-proc HMtest_parse {command tag slash text_after_tag} {
-	puts "==> $command $tag $slash $text_after_tag"
-}
-
-# Convert multiple white space into a single space
-
-proc HMzap_white {data} {
-	regsub -all "\[ \t\r\n\]+" $data " " data
-	return $data
-}
-
-# find HTML escape characters of the form &xxx;
-
-proc HMmap_esc {text} {
-	if {![regexp & $text]} {return $text}
-	regsub -all {([][$\\])} $text {\\\1} new
-	regsub -all {&#([0-9][0-9]?[0-9]?);?} \
-		$new {[format %c [scan \1 %d tmp;set tmp]]} new
-	regsub -all {&([a-zA-Z]+);?} $new {[HMdo_map \1]} new
-	return [subst $new]
-}
-
-# convert an HTML escape sequence into character
-
-proc HMdo_map {text {unknown ?}} {
-	global HMesc_map
-	set result $unknown
-	catch {set result $HMesc_map($text)}
-	return $result
-}
-
-# table of escape characters (ISO latin-1 esc's are in a different table)
-
-array set HMesc_map {
-   lt <   gt >   amp &   quot \"   copy \xa9
-   reg \xae   ob \x7b   cb \x7d   nbsp \xa0
-}
-#############################################################
-# ISO Latin-1 escape codes
-
-array set HMesc_map {
-	nbsp \xa0 iexcl \xa1 cent \xa2 pound \xa3 curren \xa4
-	yen \xa5 brvbar \xa6 sect \xa7 uml \xa8 copy \xa9
-	ordf \xaa laquo \xab not \xac shy \xad reg \xae
-	hibar \xaf deg \xb0 plusmn \xb1 sup2 \xb2 sup3 \xb3
-	acute \xb4 micro \xb5 para \xb6 middot \xb7 cedil \xb8
-	sup1 \xb9 ordm \xba raquo \xbb frac14 \xbc frac12 \xbd
-	frac34 \xbe iquest \xbf Agrave \xc0 Aacute \xc1 Acirc \xc2
-	Atilde \xc3 Auml \xc4 Aring \xc5 AElig \xc6 Ccedil \xc7
-	Egrave \xc8 Eacute \xc9 Ecirc \xca Euml \xcb Igrave \xcc
-	Iacute \xcd Icirc \xce Iuml \xcf ETH \xd0 Ntilde \xd1
-	Ograve \xd2 Oacute \xd3 Ocirc \xd4 Otilde \xd5 Ouml \xd6
-	times \xd7 Oslash \xd8 Ugrave \xd9 Uacute \xda Ucirc \xdb
-	Uuml \xdc Yacute \xdd THORN \xde szlig \xdf agrave \xe0
-	aacute \xe1 acirc \xe2 atilde \xe3 auml \xe4 aring \xe5
-	aelig \xe6 ccedil \xe7 egrave \xe8 eacute \xe9 ecirc \xea
-	euml \xeb igrave \xec iacute \xed icirc \xee iuml \xef
-	eth \xf0 ntilde \xf1 ograve \xf2 oacute \xf3 ocirc \xf4
-	otilde \xf5 ouml \xf6 divide \xf7 oslash \xf8 ugrave \xf9
-	uacute \xfa ucirc \xfb uuml \xfc yacute \xfd thorn \xfe
-	yuml \xff
-}
-
-##########################################################
-# html forms management commands
-
-# As each form element is located, it is created and rendered.  Additional
-# state is stored in a form specific global variable to be processed at
-# the end of the form, including the "reset" and "submit" options.
-# Remember, there can be multiple forms existing on multiple pages.  When
-# HTML tables are added, a single form could be spread out over multiple
-# text widgets, which makes it impractical to hang the form state off the
-# HM$win structure.  We don't need to check for the existance of required
-# parameters, we just "fail" and get caught in HMrender
-
-# This causes line breaks to be preserved in the inital values
-# of text areas
-array set HMtag_map {
-	textarea    {fill 0}
-}
-
-##########################################################
-# html isindex tag.  Although not strictly forms, they're close enough
-# to be in this file
-
-# is-index forms
-# make a frame with a label, entry, and submit button
-
-proc HMtag_isindex {win param text} {
-	upvar #0 HM$win var
-
-	set item $win.$var(tags)
-	if {[winfo exists $item]} {
-		destroy $item
-	}
-	frame $item -relief ridge -bd 3
-	set prompt "Enter search keywords here"
-	HMextract_param $param prompt
-	label $item.label -text [HMmap_esc $prompt] -font $var(xfont)
-	entry $item.entry
-	bind $item.entry <Return> "$item.submit invoke"
-	button $item.submit -text search -font $var(xfont) -command \
-		[format {HMsubmit_index %s {%s} [HMmap_reply [%s get]]} \
-		$win $param $item.entry]
-	pack $item.label -side top
-	pack $item.entry $item.submit -side left
-
-	# insert window into text widget
-
-	$win insert $var(S_insert) \n isindex
-	HMwin_install $win $item
-	$win insert $var(S_insert) \n isindex
-	bind $item <Visibility> {focus %W.entry}
-}
-
-# This is called when the isindex form is submitted.
-# The default version calls HMlink_callback.  Isindex tags should either
-# be deprecated, or fully supported (e.g. they need an href parameter)
-
-proc HMsubmit_index {win param text} {
-	HMlink_callback $win ?$text
-}
-
-# initialize form state.  All of the state for this form is kept
-# in a global array whose name is stored in the form_id field of
-# the main window array.
-# Parameters: ACTION, METHOD, ENCTYPE
-
-proc HMtag_form {win param text} {
-	upvar #0 HM$win var
-
-	# create a global array for the form
-	set id HM$win.form$var(tags)
-	upvar #0 $id form
-
-	# missing /form tag, simulate it
-	if {[info exists var(form_id)]} {
-		puts "Missing end-form tag !!!! $var(form_id)"
-		HMtag_/form $win {} {}
-	}
-	catch {unset form}
-	set var(form_id) $id
-
-	set form(param) $param		;# form initial parameter list
-	set form(reset) ""			;# command to reset the form
-	set form(reset_button) ""	;# list of all reset buttons
-	set form(submit) ""			;# command to submit the form
-	set form(submit_button) ""	;# list of all submit buttons
-}
-
-# Where we're done try to get all of the state into the widgets so
-# we can free up the form structure here.  Unfortunately, we can't!
-
-proc HMtag_/form {win param text} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	# make submit button entries for all radio buttons
-	foreach name [array names form radio_*] {
-		regsub radio_ $name {} name
-		lappend form(submit) [list $name \$form(radio_$name)]
-	}
-
-	# process the reset button(s)
-
-	foreach item $form(reset_button) {
-		$item configure -command $form(reset)
-	}
-
-	# no submit button - add one
-	if {$form(submit_button) == ""} {
-		HMinput_submit $win {}
-	}
-
-	# process the "submit" command(s)
-	# each submit button could have its own name,value pair
-
-	foreach item $form(submit_button) {
-		set submit $form(submit)
-		catch {lappend submit $form(submit_$item)}
-		$item configure -command  \
-				[list HMsubmit_button $win $var(form_id) $form(param) \
-				$submit]
-	}
-
-	# unset all unused fields here
-	unset form(reset) form(submit) form(reset_button) form(submit_button)
-	unset var(form_id)
-}
-
-###################################################################
-# handle form input items
-# each item type is handled in a separate procedure
-# Each "type" procedure needs to:
-# - create the window
-# - initialize it
-# - add the "submit" and "reset" commands onto the proper Q's
-#   "submit" is subst'd
-#   "reset" is eval'd
-
-proc HMtag_input {win param text} {
-	upvar #0 HM$win var
-
-	set type text	;# the default
-	HMextract_param $param type
-	set type [string tolower $type]
-	if {[catch {HMinput_$type $win $param} err]} {
-		puts stderr $err
-	}
-}
-
-# input type=text
-# parameters NAME (reqd), MAXLENGTH, SIZE, VALUE
-
-proc HMinput_text {win param {show {}}} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	# make the entry
-	HMextract_param $param name		;# required
-	set item $win.input_text,$var(tags)
-	set size 20; HMextract_param $param size
-	set maxlength 0; HMextract_param $param maxlength
-	entry $item -width $size -show $show
-
-	# set the initial value
-	set value ""; HMextract_param $param value
-	$item insert 0 $value
-		
-	# insert the entry
-	HMwin_install $win $item
-
-	# set the "reset" and "submit" commands
-	append form(reset) ";$item delete 0 end;$item insert 0 [list $value]"
-	lappend form(submit) [list $name "\[$item get]"]
-
-	# handle the maximum length (broken - no way to cleanup bindtags state)
-	if {$maxlength} {
-		bindtags $item "[bindtags $item] max$maxlength"
-		bind max$maxlength <KeyPress> "%W delete $maxlength end"
-	}
-}
-
-# password fields - same as text, only don't show data
-# parameters NAME (reqd), MAXLENGTH, SIZE, VALUE
-
-proc HMinput_password {win param} {
-	HMinput_text $win $param *
-}
-
-# checkbuttons are missing a "get" option, so we must use a global
-# variable to store the value.
-# Parameters NAME, VALUE, (reqd), CHECKED
-
-proc HMinput_checkbox {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	HMextract_param $param name
-	HMextract_param $param value
-
-	# Set the global variable, don't use the "form" alias as it is not
-	# defined in the global scope of the button
-	set variable $var(form_id)(check_$var(tags))	
-	set item $win.input_checkbutton,$var(tags)
-	checkbutton $item -variable $variable -off {} -on $value -text "  "
-	if {[HMextract_param $param checked]} {
-		$item select
-		append form(reset) ";$item select"
-	} else {
-		append form(reset) ";$item deselect"
-	}
-
-	HMwin_install $win $item
-	lappend form(submit) [list $name \$form(check_$var(tags))]
-}
-
-# radio buttons.  These are like check buttons, but only one can be selected
-
-proc HMinput_radio {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	HMextract_param $param name
-	HMextract_param $param value
-
-	set first [expr ![info exists form(radio_$name)]]
-	set variable $var(form_id)(radio_$name)
-	set variable $var(form_id)(radio_$name)
-	set item $win.input_radiobutton,$var(tags)
-	radiobutton $item -variable $variable -value $value -text " "
-
-	HMwin_install $win $item
-
-	if {$first || [HMextract_param $param checked]} {
-		$item select
-		append form(reset) ";$item select"
-	} else {
-		append form(reset) ";$item deselect"
-	}
-
-	# do the "submit" actions in /form so we only end up with 1 per button grouping
-	# contributing to the submission
-}
-
-# hidden fields, just append to the "submit" data
-# params: NAME, VALUE (reqd)
-
-proc HMinput_hidden {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-	HMextract_param $param name
-	HMextract_param $param value
-	lappend form(submit) [list $name $value]
-}
-
-# handle input images.  The spec isn't very clear on these, so I'm not
-# sure its quite right
-# Use std image tag, only set up our own callbacks
-#  (e.g. make sure ismap isn't set)
-# params: NAME, SRC (reqd) ALIGN
-
-proc HMinput_image {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-	HMextract_param $param name
-	set name		;# barf if no name is specified
-	set item [HMtag_img $win $param {}]
-	$item configure -relief raised -bd 2 -bg blue
-
-	# make a dummy "submit" button, and invoke it to send the form.
-	# We have to get the %x,%y in the value somehow, so calculate it during
-	# binding, and save it in the form array for later processing
-
-	set submit $win.dummy_submit,$var(tags)
-	if {[winfo exists $submit]} {
-		destroy $submit
-	}
-	button $submit	-takefocus 0;# this never gets mapped!
-	lappend form(submit_button) $submit
-	set form(submit_$submit) [list $name $name.\$form(X).\$form(Y)]
-	
-	$item configure -takefocus 1
-	bind $item <FocusIn> "catch \{$win see $item\}"
-	bind $item <1> "$item configure -relief sunken"
-	bind $item <Return> "
-		set $var(form_id)(X) 0
-		set $var(form_id)(Y) 0
-		$submit invoke	
-	"
-	bind $item <ButtonRelease-1> "
-		set $var(form_id)(X) %x
-		set $var(form_id)(Y) %y
-		$item configure -relief raised
-		$submit invoke	
-	"
-}
-
-# Set up the reset button.  Wait for the /form to attach
-# the -command option.  There could be more that 1 reset button
-# params VALUE
-
-proc HMinput_reset {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	set value reset
-	HMextract_param $param value
-
-	set item $win.input_reset,$var(tags)
-	button $item -text [HMmap_esc $value]
-	HMwin_install $win $item
-	lappend form(reset_button) $item
-}
-
-# Set up the submit button.  Wait for the /form to attach
-# the -command option.  There could be more that 1 submit button
-# params: NAME, VALUE
-
-proc HMinput_submit {win param} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	HMextract_param $param name
-	set value submit
-	HMextract_param $param value
-	set item $win.input_submit,$var(tags)
-	button $item -text [HMmap_esc $value] -fg blue
-	HMwin_install $win $item
-	lappend form(submit_button) $item
-	# need to tie the "name=value" to this button
-	# save the pair and do it when we finish the submit button
-	catch {set form(submit_$item) [list $name $value]}
-}
-
-#########################################################################
-# selection items
-# They all go into a list box.  We don't what to do with the listbox until
-# we know how many items end up in it.  Gather up the data for the "options"
-# and finish up in the /select tag
-# params: NAME (reqd), MULTIPLE, SIZE 
-
-proc HMtag_select {win param text} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-
-	HMextract_param $param name
-	set size 5;  HMextract_param $param size
-	set form(select_size) $size
-	set form(select_name) $name
-	set form(select_values) ""		;# list of values to submit
-	if {[HMextract_param $param multiple]} {
-		set mode multiple
-	} else {
-		set mode single
-	}
-	set item $win.select,$var(tags)
-    frame $item
-    set form(select_frame) $item
-	listbox $item.list -selectmode $mode -width 0 -exportselection 0
-	HMwin_install $win $item
-}
-
-# select options
-# The values returned in the query may be different from those
-# displayed in the listbox, so we need to keep a separate list of
-# query values.
-#  form(select_default) - contains the default query value
-#  form(select_frame) - name of the listbox's containing frame
-#  form(select_values)  - list of query values
-# params: VALUE, SELECTED
-
-proc HMtag_option {win param text} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-	upvar $text data
-	set frame $form(select_frame)
-
-	# set default option (or options)
-	if {[HMextract_param $param selected]} {
-        lappend form(select_default) [$form(select_frame).list size]
-    }
-    set value [string trimright $data " \n"]
-    $frame.list insert end $value
-	HMextract_param $param value
-	lappend form(select_values) $value
-	set data ""
-}
- 
-# do most of the work here!
-# if SIZE>1, make the listbox.  Otherwise make a "drop-down"
-# listbox with a label in it
-# If the # of items > size, add a scroll bar
-# This should probably be broken up into callbacks to make it
-# easier to override the "look".
-
-proc HMtag_/select {win param text} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-	set frame $form(select_frame)
-	set size $form(select_size)
-	set items [$frame.list size]
-
-	# set the defaults and reset button
-	append form(reset) ";$frame.list selection clear 0  $items"
-	if {[info exists form(select_default)]} {
-		foreach i $form(select_default) {
-			$frame.list selection set $i
-			append form(reset) ";$frame.list selection set $i"
-		}
-	} else {
-		$frame.list selection set 0
-		append form(reset) ";$frame.list selection set 0"
-	}
-
-	# set up the submit button. This is the general case.  For single
-	# selections we could be smarter
-
-	for {set i 0} {$i < $size} {incr i} {
-		set value [format {[expr {[%s selection includes %s] ? {%s} : {}}]} \
-				$frame.list $i [lindex $form(select_values) $i]]
-		lappend form(submit) [list $form(select_name) $value]
-	}
-	
-	# show the listbox - no scroll bar
-
-	if {$size > 1 && $items <= $size} {
-		$frame.list configure -height $items
-		pack $frame.list
-
-	# Listbox with scrollbar
-
-	} elseif {$size > 1} {
-		scrollbar $frame.scroll -command "$frame.list yview"  \
-				-orient v -takefocus 0
-		$frame.list configure -height $size \
-			-yscrollcommand "$frame.scroll set"
-		pack $frame.list $frame.scroll -side right -fill y
-
-	# This is a joke!
-
-	} else {
-		scrollbar $frame.scroll -command "$frame.list yview"  \
-			-orient h -takefocus 0
-		$frame.list configure -height 1 \
-			-yscrollcommand "$frame.scroll set"
-		pack $frame.list $frame.scroll -side top -fill x
-	}
-
-	# cleanup
-
-	foreach i [array names form select_*] {
-		unset form($i)
-	}
-}
-
-# do a text area (multi-line text)
-# params: COLS, NAME, ROWS (all reqd, but default rows and cols anyway)
-
-proc HMtag_textarea {win param text} {
-	upvar #0 HM$win var
-	upvar #0 $var(form_id) form
-	upvar $text data
-
-	set rows 5; HMextract_param $param rows
-	set cols 30; HMextract_param $param cols
-	HMextract_param $param name
-	set item $win.textarea,$var(tags)
-	frame $item
-	text $item.text -width $cols -height $rows -wrap none \
-			-yscrollcommand "$item.scroll set" -padx 3 -pady 3
-	scrollbar $item.scroll -command "$item.text yview"  -orient v
-	$item.text insert 1.0 $data
-	HMwin_install $win $item
-	pack $item.text $item.scroll -side right -fill y
-	lappend form(submit) [list $name "\[$item.text get 0.0 end]"]
-	append form(reset) ";$item.text delete 1.0 end; \
-			$item.text insert 1.0 [list $data]"
-	set data ""
-}
-
-# procedure to install windows into the text widget
-# - win:  name of the text widget
-# - item: name of widget to install
-
-proc HMwin_install {win item} {
-	upvar #0 HM$win var
-	$win window create $var(S_insert) -window $item -align bottom
-	$win tag add indent$var(level) $item
-	set focus [expr {[winfo class $item] != "Frame"}]
-	$item configure -takefocus $focus
-	bind $item <FocusIn> "$win see $item"
-}
-
-#####################################################################
-# Assemble and submit the query
-# each list element in "stuff" is a name/value pair
-# - The names are the NAME parameters of the various fields
-# - The values get run through "subst" to extract the values
-# - We do the user callback with the list of name value pairs
-
-proc HMsubmit_button {win form_id param stuff} {
-	upvar #0 HM$win var
-	upvar #0 $form_id form
-	set query ""
-	foreach pair $stuff {
-		set value [subst [lindex $pair 1]]
-		if {$value != ""} {
-			set item [lindex $pair 0]
-			lappend query $item $value
-		}
-	}
-	# this is the user callback.
-	HMsubmit_form $win $param $query
-}
-
-# sample user callback for form submission
-# should be replaced by the application
-# Sample version generates a string suitable for http
-
-proc HMsubmit_form {win param query} {
-	set result ""
-	set sep ""
-	foreach i $query {
-		append result  $sep [HMmap_reply $i]
-		if {$sep != "="} {set sep =} {set sep &}
-	}
-	puts $result
-}
-
-# do x-www-urlencoded character mapping
-# The spec says: "non-alphanumeric characters are replaced by '%HH'"
- 
-set HMalphanumeric	a-zA-Z0-9	;# definition of alphanumeric character class
-for {set i 1} {$i <= 256} {incr i} {
-    set c [format %c $i]
-    if {![string match \[$HMalphanumeric\] $c]} {
-        set HMform_map($c) %[format %.2x $i]
-    }
-}
-
-# These are handled specially
-array set HMform_map {
-    " " +   \n %0d%0a
-}
-
-# 1 leave alphanumerics characters alone
-# 2 Convert every other character to an array lookup
-# 3 Escape constructs that are "special" to the tcl parser
-# 4 "subst" the result, doing all the array substitutions
- 
-proc HMmap_reply {string} {
-    global HMform_map HMalphanumeric
-    regsub -all \[^$HMalphanumeric\] $string {$HMform_map(&)} string
-    regsub -all \n $string {\\n} string
-    regsub -all \t $string {\\t} string
-    regsub -all {[][{})\\]\)} $string {\\&} string
-    return [subst $string]
-}
-
-# convert a x-www-urlencoded string int a a list of name/value pairs
-
-# 1  convert a=b&c=d... to {a} {b} {c} {d}...
-# 2, convert + to  " "
-# 3, convert %xx to char equiv
-
-proc HMcgiDecode {data} {
-	set data [split $data "&="]
-	foreach i $data {
-		lappend result [cgiMap $i]
-	}
-	return $result
-}
-
-proc HMcgiMap {data} {
-	regsub -all {\+} $data " " data
-	
-	if {[regexp % $data]} {
-		regsub -all {([][$\\])} $data {\\\1} data
-		regsub -all {%([0-9a-fA-F][0-9a-fA-F])} $data  {[format %c 0x\1]} data
-		return [subst $data]
-	} else {
-		return $data
-	}
-}
-
-# There is a bug in the tcl library focus routines that prevents focus
-# from every reaching an un-viewable window.  Use our *own*
-# version of the library routine, until the bug is fixed, make sure we
-# over-ride the library version, and not the otherway around
-
-auto_load tkFocusOK
-proc tkFocusOK w {
-    set code [catch {$w cget -takefocus} value]
-    if {($code == 0) && ($value != "")} {
-    if {$value == 0} {
-        return 0
-    } elseif {$value == 1} {
-        return 1
-    } else {
-        set value [uplevel #0 $value $w]
-        if {$value != ""} {
-        return $value
-        }
-    }
-    }
-    set code [catch {$w cget -state} value]
-    if {($code == 0) && ($value == "disabled")} {
-    return 0
-    }
-    regexp Key|Focus "[bind $w] [bind [winfo class $w]]"
-}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraph/inst/igraph.gif and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraph/inst/igraph.gif differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraph/inst/igraph2.gif and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraph/inst/igraph2.gif differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/my_html_library.tcl igraph-0.6.5/interfaces/R/igraph/inst/my_html_library.tcl
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/my_html_library.tcl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/my_html_library.tcl	1970-01-01 00:00:00.000000000 +0000
@@ -1,102 +0,0 @@
-
-#   IGraph R package
-#   Copyright (C) 2009-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard street, Cambridge, MA 02139 USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-proc render_real {win href} {
-    global tkigraph_help_root 
-    set Url $tkigraph_help_root/$href
-    $win configure -state normal
-    HMreset_win $win
-    HMparse_html [get_html $Url] "HMrender $win"
-    $win tag add indented 1.0 insert
-    $win tag configure indented -lmargin1 20 -lmargin2 20
-    $win configure -state disabled
-    update
-}
-
-proc render {win href} {
-    global tkigraph_help_history tkigraph_help_history_pos
-    global browser_button browser_url
-    if { [ regexp ^http:// "$href" ] } { 
-	set browser_url $href
-	$browser_button invoke
-	return
-    }
-    lappend tkigraph_help_history($win) $href
-    incr tkigraph_help_history_pos($win)
-    render_real $win $href
-}
-
-proc start_history {win} {
-    global tkigraph_help_history tkigraph_help_history_pos
-    set tkigraph_help_history($win) [ list ]
-    set tkigraph_help_history_pos($win) -1
-}
-
-proc render_back {win} {
-    global tkigraph_help_history tkigraph_help_history_pos
-    if { $tkigraph_help_history_pos($win) > 0 } { 
-	set pos [ incr tkigraph_help_history_pos($win) -1 ]
-	render_real $win [ lindex $tkigraph_help_history($win) $pos ]
-    }
-}
-
-proc render_forw {win} {
-    global tkigraph_help_history tkigraph_help_history_pos
-    if { [ expr $tkigraph_help_history_pos($win) + 1 ] < 
-	 [ llength $tkigraph_help_history($win) ] } {
-	set pos [ incr tkigraph_help_history_pos($win) ]
-	render_real $win [ lindex $tkigraph_help_history($win) $pos ]
-    }
-}
-
-proc HMlink_callback {win href} {
-    render $win $href
-}
-
-proc get_html {file} {
-    global tkigraph_help_root
-    if {[catch {set fd [open $file]} msg]} {
-	return "
-                        <title>Bad file $file</title>
-                        <h1>Error reading $file</h1><p>
-                        $msg<hr>
-                        <a href=$tkigraph_help_root>Go home</a>
-                "
-    }
-    set result [read $fd]
-    close $fd
-    return $result
-}
-
-proc HMset_image {win handle src} {
-    global tkigraph_help_root
-    set image $tkigraph_help_root/$src
-    update
-    if {[string first " $image " " [image names] "] >= 0} {
-	HMgot_image $handle $image
-    } else {
-	set type photo
-	if {[file extension $image] == ".bmp"} {set type bitmap}
-	catch {image create $type $image -file $image} image
-	HMgot_image $handle $image
-    }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/communities.html igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/communities.html
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/communities.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/communities.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-<html>
-<title>Community structure detection</title>
-<body>
-<p>Bla-bla-bla</p>
-</body>
-</html>
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/index.html igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/index.html
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,168 +0,0 @@
-<html>
-  <head>
-  <link rel="stylesheet" type="text/css" href="style.css"></link>
-  <title>tkigraph online help</title>
-  </head>
-  <body>
-    
-    <h1>The tkigraph manual</h1>
-
-    <div class="main">
-
-    <p>tkigraph is a basic Graphical User Interface (GUI) to some
-      igraph functions. </p>
-
-    <h2>What is tkigraph?</h2>
-    
-    <p>tkigraph is a simple Graphical User Interface to the igraph R
-    package. R is a general purpose programming language and
-    environment, used mostly but not exclusively for statistical
-    analysis. igraph is an extension package to R. tkigraph lets you
-    use some basic features of igraph via a GUI, instead of typing in
-    R commands.</p>
-
-    <h2>Installing and starting tkigraph</h2>
-
-    <p>Well, if you are reading these lines, then you probably already
-      know how to install and start tkigraph.
-      If not, here is how to do it.</p>
-    
-    <p>First, install the GNU R software package. It can be downloaded
-      from <i><a href="http://www.r-project.org">the R website</a></i>, but
-      first check your system, because it might be already
-      installed. You can also ask your system administrator to
-      install it for you.</p>
-    
-    <p>Second, you need to install the igraph extension
-      package. First, start R by clicking on its icon in Windows, or
-      by typing "R" into a terminal and pressing ENTER on Linux.
-      Now type in
-      <pre>
-	install.package("igraph")
-      </pre>
-      and press ENTER. After choosing an appropriate mirror site, R
-      downloads and installs the igraph package.
-    </p>
-
-    <p>Third, you need to load the igraph package and start
-      tkigraph. This can be done by typing
-      <pre>
-	library(igraph)
-	tkigraph()
-      </pre>
-      (in two separate lines, pressing ENTER after each line) 
-      into your R session. You should see a new windows appear, it
-      looks like the one on the picture below.</p>
-    
-    <h2>The tkigraph window</h2>
-    
-    <p>The main window of tkigraph look like this:</p>
-
-    <p><img alt="Main tkigraph window" src="tkigraph-main.gif"></p>
-    
-    <p>Almost all the window is occupied by the list of graphs in the
-      workspace. Unlike on the picture for you this is initially
-      empty. Every graph has a number, in the <code>#</code> column, a
-      name that is not necessarily unique, you can change the name of
-      the graph to whatever you like. In the last three columns you
-      can see the number of vertices and edges in the graph, and
-      whether it is directed or not.
-    </p>
-
-    <p>In the leftmost column there is a checkbox for every graph, you
-      can select one or more graphs using this and then perform
-      operations on them. Some operations require exactly one graph to
-      be selected, others work happily on many graphs as well. You
-      will always get an error message if not the appropriate number
-      of graphs were selected for an operation.
-    </p>
-    
-    <h2>The tkigraph menus</h2>
-
-    <p>
-      Creating new graphs or performing operations on them can be
-      done by selecting entries from the main menu. Let us discuss
-      briefly what the various menus are good for.
-    </p>
-
-    <h3>Graph menu</h3>
-    
-    <p>
-      The Graph menu lets you create and delete graphs, show them in
-      an edge list format, calculate some basic properties for
-      them. Moreover all file-related operations are here a well.
-    </p>    
-
-    <h3>Draw menu</h3>
-    
-    <p>
-      In this menu you can draw your graphs using various layouts,
-      possibly also interactively. There are two entries in the menu.
-      The first one (Simple) tries to do the plotting automatically;
-      first it chooses an appropriate layout for the graph and then
-      tries to guess the graphical parameters to make the plot look
-      good. Finally it creates a non-interactive plot.
-    </p>
-
-    <p>
-      The advanced plotting lets you choose various graphical
-      parameters, and you also have the possibility to create an
-      interactive plot.
-    </p>
-
-    <h3>Centrality menu</h3>
-
-    <p>
-      Lets you calculate various degree centrality measures, plus edge
-      betweenness. The results are always shown in a table that can be
-      sorted according to all of its columns and the data can also be
-      exported into a text file.
-    </p>
-
-    <h3>Distances menu</h3>
-
-    <p>
-      Various measures related to path lengths in the network are
-      included in this menu.
-    </p>
-    
-    <h3>Subgraphs menu</h3>
-
-    <p>
-      This menu contains three slightly related entries. Components
-      are maximal connected subgraphs of a graph. Communities are
-      natural modules in the graph, a module is a subgraph that has
-      more edges within the module than between the module and the
-      rest of the graph. (Loosely speaking.) In the 'Communities' menu
-      you can run the Spinglass algorithm by J Reichardt and S
-      Bornholdt. Cohesion measures how difficult it is to disconnect a
-      graph by removing vertices from it. The last menu entry
-      calculates cohesion for all components in the selected graph.
-    </p>
-
-    <h3>Motifs menu</h3>
-
-    <p>
-      Motifs are small subgraphs with a given structure. The first
-      menu entry in this menu just plots all possible motifs of a
-      given size in a directed or directed graphs. The second menu
-      entry finds all the different motifs in the selected graph and
-      plots all the different motifs annotated with the number of
-      motifs of that kind found in the graph. It also plots a
-      histogram for the various motifs.
-    </p>
-    
-    <h3>Help menu</h3>
-
-    <p>
-      This is what you are reading right now.
-    </p>
-
-    <h3>Quit</h3>
-    
-    <p>
-      Not really a menu, just a button. Lets you quit from tkigraph.
-    </p>
-
-  </div></body>
-</html>
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/style.css igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/style.css
--- igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/style.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/style.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,391 +0,0 @@
-
-body {
-    font: medium/150% "Lucida Grande", sans-serif;
-    margin: 0; padding: 0 0 10px;
-    color: #333; background: #fff;
-}
-a img { border: 0; }
-h1 {
-    color: #fff;
-    margin: 0;
-    height: 40px;
-    line-height: 40px;
-    text-shadow: 0px 1px 2px #000;
-    background: #1872ce url(images/header_blue.png) repeat-x;
-    border-top: 1px solid #1872ce;
-    border-bottom: 1px solid #1c477f;
-    font-size: large;
-    padding-left: 10px;
-}
-h2 {
-    font-size: 1.5em;
-    text-indent: -40px;
-}
-h2.th {
-    font-size: 1.5em;
-    text-indent: 0px;
-}
-h3 {
-    font-size: 1em;
-    text-indent: -20px;
-}
-h4 {
-    font-size: 0.8em;
-}
-body.error h1 {
-    background: #d70000;
-    border-bottom: 1px solid #7f0000;
-}
-hr {
-  color: #888; background-color: #888;
-  height: 1px; width: 100%;
-  border: 0;
-}
-code { font-size: 1.2em; }
-img.float_right { float: right }
-img.float_left { float: left }
-pre.condensed { font-size: 0.8em; line-height: 1.5em; }
-
-.igraphlogo {
-    float: right;
-    padding-left: 40px;
-    padding-right: 40px;
-    padding-top:30px;
-}
-
-div.main {
-    max-width:900px;
-    padding-left: 50px;
-    padding-bottom: 50px;
-    margin-right: 0;
-}
-.more {
-    text-align: right;
-    margin-top: -1em;
-}
-.back {
-    text-align: left;
-}
-
-ul.no-bullet {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.no-bullet li {
-  padding: 0; margin: 0;
-}
-li.download {
-  line-height: 1em;
-  padding-bottom: 10px !important;
-}
-li.download .name {
-  font-weight: bold;
-  padding-left: 20px;
-}
-li.download span.comment {
-  font-size: 0.8em;
-  color: #888;
-}
-li.download div.comment {
-  font-size: 0.8em;
-  padding: 4px 0px 0px 20px;
-}
-p.comment {
-  font-size: 0.8em;
-  color: #888;
-}
-div.image_caption {
-  font-size: 0.8em;
-  color: #888;
-  text-align: center;
-}
-li.download-c {
-  background: url(images/icon_c.png) no-repeat 0px 0px;
-}
-li.download-sf {
-  background: url(images/icon_sf.png) no-repeat 0px 0px;
-}
-li.download-r {
-  background: url(images/icon_r.png) no-repeat 0px 0px;
-}
-li.download-python {
-  background: url(images/icon_python.png) no-repeat 0px 0px;
-}
-li.download-ruby {
-  background: url(images/icon_ruby.png) no-repeat 0px 0px;
-}
-li.download-doc {
-  background: url(images/icon_documentation.png) no-repeat 0px 0px;
-}
-li.download-wiki {
-  background: url(images/icon_wiki.png) no-repeat 0px 0px;
-}
-ul.download-links {
-  list-style-type: none;
-  padding: 2px 0 0 20px; margin: 0;
-  font-size: 0.8em;
-}
-ul.download-links li {
-  padding: 0px 10px 0px 0px; margin: 0;
-  padding-bottom: 5px !important;
-}
-ul.download-links li.download-source {
-  background: url(images/icon_source.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-sf {
-  background: url(images/icon_sf.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-windows {
-  background: url(images/icon_windows.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-debian {
-  background: url(images/icon_debian.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-osx {
-  background: url(images/icon_osx.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-html {
-  background: url(images/icon_html.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-external {
-  background: url(images/icon_links.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-wiki {
-  background: url(images/icon_wiki.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-pdf {
-  background: url(images/icon_pdf.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-html {
-  background: url(images/icon_html.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-ul.download-links li.download-info {
-  background: url(images/icon_info.png) no-repeat 0px 0px;
-  padding-left: 18px;
-}
-
-a { color: #00f; text-decoration: none }
-a:visited { color: #00c }
-a:hover { color: #00f; text-decoration: underline }
-h1 a, h1 a:visited, h1 a:hover { color: #fff; text-decoration: none }
-h2 a, h2 a:visited, h2 a:hover { color: #000; text-decoration: none }
-h3 a, h3 a:visited, h3 a:hover { color: #000; text-decoration: none }
-
-#sourceforge_logo {
-  float: right;
-  padding: 3px 15px 0px 0px;
-}
-
-/* Menu items */
-ul.menu {
-  list-style-type: none;
-  padding: 0; margin: 0;
-}
-ul.menu-upper {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-  margin-top: 10px;
-  width: 95%;
-  border-bottom: 1px solid;
-  text-align: left;
-}
-ul.menu li {
-  padding: 0px 10px 10px 20px;
-  margin: 0px;
-}
-ul.menu-upper li {
-  padding: 8px 10px 4px 25px;
-  font-size: 0.8em;
-  border: solid;
-  border-width: 1px 1px 1px 1px;
-  margin: 0px 0px 0px 0px;
-  display: inline;
-}
-ul.menu-upper li:hover {
-  border-top: solid 2px #0000ff;
-  border-left: solid 2px #0000ff;
-  border-right: solid 2px #0000ff;  
-}
-ul li.item-introduction {
-  background: #dadaff url(images/icon_info.png) no-repeat 5px 6px;
-}
-ul li.item-download {
-  background: #dadaff url(images/icon_download.png) no-repeat 5px 6px;
-}
-ul li.item-news {
-  background: #dadaff url(images/icon_news.png) no-repeat 5px 6px;
-}
-ul li.item-documentation {
-  background: #dadaff url(images/icon_documentation.png) no-repeat 5px 6px;
-}
-ul li.item-wiki {
-  background: #dadaff url(images/icon_wiki.png) no-repeat 5px 6px;
-}
-ul li.item-screenshots {
-  background: #dadaff url(images/icon_screenshots.png) no-repeat 5px 6px;
-}
-ul li.item-community {
-  background: #dadaff url(images/icon_community.png) no-repeat 5px 6px;
-}
-ul li.item-bug {
-  background: #dadaff url(images/icon_bug.png) no-repeat 5px 6px;
-}
-ul li.item-links {
-  background: #dadaff url(images/icon_links.png) no-repeat 5px 6px;
-}
-ul li.item-license {
-  background: #dadaff url(images/icon_license.png) no-repeat 5px 6px;
-}
-body#index li#n-index {
-    background: #ffffff url(images/icon_info.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#news li#n-news {
-    background: #ffffff url(images/icon_news.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#download li#n-download{
-    background: #ffffff url(images/icon_download.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#documentation li#n-documentation{
-    background: #ffffff url(images/icon_documentation.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#screenshots li#n-screenshots{
-    background: #ffffff url(images/icon_screenshots.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#support li#n-support{
-    background: #ffffff url(images/icon_community.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#bugs li#n-bugs{
-    background: #ffffff url(images/icon_bug.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-body#license li#n-license {
-    background: #ffffff url(images/icon_license.png) no-repeat 5px 6px;
-    border-bottom: 1px solid #ffffff;
-}
-
-/* Forms */
-label {
-  display: block;
-  float: left;
-  width: 130px;
-  font-weight: bold;
-}
-label.normal {
-  color: #444;
-}
-div.explanation {
-  border-left: 130px solid white;
-  font-size: 0.8em;
-  color: #888;
-}
-.programlisting 
-{
-  background: #eeeeff;
-  border: solid 1px #4444ff;
-  padding: 0.5em;
-}
-p.news
-{
-  padding: 0px 40px 0px;
-}
-h4.news
-{
-  padding: 0px 40px 0px;
-}
-ul.newslist
-{
-  padding: 0px 60px 0px;
-}
-table.intro td {
-  vertical-align: top;
-  width: 33.3%;
-  padding: 20px;
-}
-div.feed {
-  width: 100%;
-  padding: 20px;
-}
-div.feedburnerFeedBlock p.feedTitle { 
-    font-size: 1em;
-}
-div.feedburnerFeedBlock a { 
-    color: black;
-}
-div.feedburnerFeedBlock ul a { 
-    color: #00f; text-decoration: none
-}
-div.feedburnerFeedBlock { 
-    font-size: 1em;
-}
-div.feedburnerFeedBlock ul { 
-  list-style-type: none;
-}
-div.feedburnerFeedBlock ul li { 
-    margin-top: 10px;
-}
-div.feedburnerFeedBlock p.date {
-    font-style: italic;
-    font-size: 0.8em;
-    margin: 5px;    
-}
-div.feedburnerFeedBlock p.date:before {
-    content: "(";
-}
-div.feedburnerFeedBlock p.date:after {
-    content: ")";
-}
-div.feedburnerFeedBlock span, span+p {display:inline}
-div.feed span.headline {
-    font-size: 1.25em;
-}
-#creditfooter {
-    float: right;
-}
-div.feedburnerFeedBlock table {
-    table-layout: fixed;
-    width: 100%;
-}
-div.quick-menu {
-    position:fixed;
-    bottom:0;
-    width: 100%;
-}
-div.quick-menu ul.menu-bottom {
-    padding: 5px;
-    border-top: 1px solid #0000a0;
-    text-align: center;
-    background: #dadaff;
-}
-ul.menu-bottom {
-  list-style-type: none;
-  padding: 0px 0px 0px 15px; margin: 0;
-}
-ul.menu-bottom li {
-  padding: 8px 10px 10px 25px;
-  font-size: 0.8em;
-  margin: 0px;
-  display: inline;
-}
-div.copyright {
-    border-top: 1px solid #8e8e8e;
-    text-align: center;
-    color: #8e8e8e;
-    padding-top: 10px;
-    padding-bottom: 50px;
-}
\ No newline at end of file
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraph/inst/tkigraph_help/tkigraph-main.gif and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraph/inst/tkigraph_help/tkigraph-main.gif differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/SCGintro.Rd igraph-0.6.5/interfaces/R/igraph/man/SCGintro.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/SCGintro.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/SCGintro.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,157 +0,0 @@
-\name{Spectral coarse graining}
-\alias{SCG}
-\concept{Spectral coarse graining}
-\title{Spectral Coarse Graining}
-\description{
-  Functions to perform the Spectral Coarse Graining (SCG) of matrices
-  and graphs.
-}
-\section{Introduction}{
-  The SCG functions provide a framework, called Spectral Coarse Graining
-  (SCG), for reducing large graphs while preserving their
-  \emph{spectral-related features}, that is features closely related
-  with the eigenvalues and eigenvectors of a graph matrix (which for now
-  can be the adjacency, the stochastic, or the Laplacian matrix).
-
-  Common examples of such features comprise the first-passage-time of
-  random walkers on Markovian graphs, thermodynamic properties of
-  lattice models in statistical physics (e.g. Ising model), and the
-  epidemic threshold of epidemic network models (SIR and SIS models).
-
-  SCG differs from traditional clustering schemes by producing a
-  \emph{coarse-grained graph} (not just a partition of the vertices),
-  representative of the original one. As shown in [1], Principal
-  Component Analysis can be viewed as a particular SCG, called
-  \emph{exact SCG}, where the matrix to be coarse-grained is the
-  covariance matrix of some data set. 
-
-  SCG should be of interest to practitioners of various
-  fields dealing with problems where matrix eigenpairs play an important
-  role, as for instance is the case of dynamical processes on networks.
-}
-\section{SCG in brief}{
-  The main idea of SCG is to operate on a matrix a shrinkage operation
-  specifically designed to preserve some of the matrix eigenpairs while
-  not altering other important matrix features (such as its structure). 
-  Mathematically, this idea was expressed as follows. Consider a
-  (complex) \eqn{n \times n}{n x n} matrix \eqn{M} and form the product
-  \deqn{\widetilde{M} = LMR^*,}{M'=LMR*,}
-  where \eqn{\tilde n < n}{n' < n} and
-  \eqn{L,R \in \mathbf{C}^{\tilde n \times n}}{L,R in C[n'xn]} are such
-  that \eqn{LR^*=I_{\tilde n}}{LR*=I[n']} (\eqn{R^*}{R*} denotes the
-  conjugate transpose of \eqn{R}). Under these assumptions, it can be
-  shown that \eqn{P=R^*L}{P=R*L} is an \eqn{\tilde n}{n'}-rank projector
-  and that, if \eqn{(\lambda, v)}{(lambda, v)} is a (right) 
-  eigenpair of \eqn{M} (i.e. \eqn{Mv=\lambda v}{Mv=lambda v}) and
-  \eqn{P} is orthogonal, there exists an eigenvalue \eqn{\tilde
-    \lambda}{lambda'} of \eqn{\widetilde M}{M'} such that
-  \deqn{|\lambda-\tilde{\lambda}| \le \textrm{const} \Vert e_P(v)\Vert
-    [1 + O(\Vert e_P(v)\Vert^2)],}{%
-  |lambda-lambda'| <= const ||e[P](v)|| [1+O(||e[P](v)||^2)],}
-  where \eqn{\Vert e_P(v)\Vert = \Vert
-    v-Pv\Vert}{||e[P](v)||=||v-Pv||}. 
-  Hence, if \eqn{P} (or equivalently \eqn{L}, \eqn{R}) is chosen so as
-  to make \eqn{\Vert e_P(v)\Vert}{||e[P](v)||} as small as possible, one
-  can preserve to any desired level the original eigenvalue
-  \eqn{\lambda}{lambda} in the coarse-grained matrix \eqn{\widetilde M}{M'};
-  under extra assumptions on \eqn{M}, this result can be generalized to
-  eigenvectors [1]. This leads to the following generic definition of a
-  SCG problem.
-
-  Given \eqn{M\in\mathbf{C}^{n\times n}}{M in C[nxn]} and
-  \eqn{(\lambda,v)}{(lambda,v)} a (right) eigenpair of \eqn{M} to be
-  preserved by the coarse graining, the problem is to find a projector
-  \eqn{\widehat{P}}{P'} solving
-  \deqn{\min_{P\in \Omega} \Vert e_{P}(v)\Vert,}{%
-  min(||e[P](v)||, p in Omega),}
-  where \eqn{\Omega}{Omega} is a set of projectors in
-  \eqn{\mathbf{C}^{n\times n}}{C[nxn]} described by some 
-  ad hoc constraints \eqn{c_{1},\dots c_{r}}{c[1], ..., c[r]}
-  (e.g. \eqn{c_{1}:P\in\mathbf{R}^{n\times n}, c_{2}:P=P^{t},
-    c_{3}:P_{ij}\ge 0}{c[1]: P in R[nxn], c[2]: P=t(P), c[3]: P[i,j] >=
-    0}, etc).
-
-  Choosing pertinent constraints to solve the SCG problem is of great
-  importance in applications. For instance, in the absence of
-  constraints the SCG problem is solved trivially by
-  \eqn{\widehat{P}=vv^*}{P'=vv*} (\eqn{v} is assumed normalized). We have
-  designed a particular constraint, called \emph{homogeneous mixing},
-  which ensures that vertices belonging to the same group are merged
-  consistently from a physical point of view (see [1] for
-  details). Under this constraint the SCG problem reduces to finding the
-  partition of \eqn{\{1,\dots,n\}}{1, ..., n} (labeling the original
-  vertices) minimizing
-  \deqn{\Vert e_P(v)\Vert^{2} =
-    \sum_{\alpha=1}^{\tilde{n}}\sum_{i\in\alpha}[v(i)-(Pv)(i)]^{2},}{%
-    ||e[P](v)||^2 = sum([v(i)-(Pv)(i)]^2; alpha=1,...,n', i in alpha),} 
-  where \eqn{\alpha}{alpha} denotes a group (i.e. a block) in a partition of
-  \eqn{ \{1,\dots,n\} }{{1, ..., n}}, and \eqn{|\alpha|}{|alpha|} is the
-  number of elements in \eqn{\alpha}{alpha}. 
-
-  If \eqn{M} is symmetric or stochastic, for instance, then it may be
-  desirable (or mandatory) to choose \eqn{L}, \eqn{R} so that
-  \eqn{\widetilde M}{M'} is symmetric or stochastic as well. This
-  \emph{structural constraint} has led to the construction of particular
-  semi-projectors for symmetric [1], stochastic [3] and Laplacian [2]
-  matrices, that are made available.
-
-  In short, the coarse graining of matrices and graphs involves: 
-  \enumerate{
-    \item Retrieving a matrix or a graph matrix \eqn{M} from the
-    problem. 
-    \item Computing the eigenpairs of \eqn{M} to be preserved in the
-    coarse-grained graph or matrix. 
-    \item Setting some problem-specific constraints (e.g. dimension of
-    the coarse-grained object). 
-    \item Solving the constrained SCG problem, that is finding
-    \eqn{\widehat{P}}{P'}. 
-    \item Computing from \eqn{\widehat{P}}{P'} two semi-projectors
-    \eqn{\widehat{L}}{L'} and \eqn{\widehat{R}}{R'} (e.g. following the method
-    proposed in [1]). 
-    \item Working out the product \eqn{\widetilde{M}=\widehat{L} M
-      \widehat{R}^*}{M'=L'MR'*} and, if needed, defining from
-    \eqn{\widetilde{M}}{M'} a coarse-grained graph. 
-  }
-}
-\section{Functions for performing SCG}{
-  The main function is the \dQuote{all-in-one}
-  \code{\link{scg}}. This function handles all the steps involved in the
-  Spectral Coarse Graining (SCG) of some particular matrices and graphs
-  as described above and in reference [1]. In more details,
-  \code{\link{scg}} computes some prescribed eigenpairs of a matrix or a
-  graph matrix (for now adjacency, Laplacian and stochastic matrices are
-  available), works out an optimal partition to preserve the eigenpairs,
-  and finally outputs a coarse-grained matrix or graph along with other
-  useful information. 
- 
-  These steps can also be carried out independently: (1) Use
-  \code{\link{get.adjacency}}, \code{\link{graph.laplacian}} or
-  \code{\link{get.stochastic}} to compute a matrix \eqn{M}. (2) Work
-  out some prescribed eigenpairs of \eqn{M} e.g. by 
-  means of \code{eigen} or \code{arpack}. (3) Invoke one the four
-  algorithms of the function \code{\link{scgGrouping}} to get a
-  partition that will preserve the eigenpairs in the coarse-grained
-  matrix. (4) Compute the semi-projectors \eqn{L} and \eqn{R} using
-  \code{\link{scgSemiProjectors}} and from there the coarse-grained
-  matrix \eqn{\widetilde{M}=LMR^*}{M'=LMR*}. If necessary, construct a
-  coarse-grained graph from \eqn{\widetilde{M}}{M'} (e.g. as in [1]). 
-}
-\references{
-  D. Morton de Lachapelle, D. Gfeller, and P. De Los Rios,
-  Shrinking Matrices while Preserving their Eigenpairs with Application
-  to the Spectral Coarse Graining of Graphs. Submitted to \emph{SIAM
-    Journal on Matrix Analysis and Applications}, 2008. 
-  \url{http://people.epfl.ch/david.morton}
-  
-  D. Gfeller, and P. De Los Rios, Spectral Coarse Graining and
-  Synchronization in Oscillator Networks. \emph{Physical Review
-    Letters}, \bold{100}(17), 2008. 
-  \url{http://arxiv.org/abs/0708.2055}
-
-  D. Gfeller, and P. De Los Rios, Spectral Coarse Graining of Complex
-  Networks, \emph{Physical Review Letters}, \bold{99}(3), 2007. 
-  \url{http://arxiv.org/abs/0706.0812}
-}
-\author{David Morton de Lachapelle \email{david.morton@epfl.ch},
-  \email{david.mortondelachapelle@swissquote.ch}}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/aaa-igraph-package.Rd igraph-0.6.5/interfaces/R/igraph/man/aaa-igraph-package.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/aaa-igraph-package.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/aaa-igraph-package.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,151 +0,0 @@
-\docType{package}
-\name{igraph-package}
-\alias{igraph-package}
-\alias{igraph}
-\title{The igraph package}
-\description{igraph is a library and R package for network analysis.}
-\section{Introduction}{
-  The main goals of the igraph library is 
-  to provide a set of data types and functions for 1) pain-free
-  implementation of graph algorithms, 2) fast handling of large graphs,
-  with millions of vertices and edges, 3) allowing rapid prototyping via
-  high level languages like R.
-}
-\section{Igraph graphs}{
-  Igraph graphs have a class \sQuote{\code{igraph}}. They are printed to
-  the screen in a special format, here is an example, a ring graph
-  created using \code{\link{graph.ring}}: \preformatted{    IGRAPH U--- 10 10 -- Ring graph
-    + attr: name (g/c), mutual (g/x), circular (g/x)  }
-  The \sQuote{\code{IGRAPH}} denotes that this is an igraph graph. Then
-  come four bits that denote the kind of the graph: the first is
-  \sQuote{\code{U}} for undirected and \sQuote{\code{D}} for directed
-  graphs. The second is \sQuote{\code{N}} for named graph (i.e. if the
-  graph has the \sQuote{\code{name}} vertex attribute set). The third is
-  \sQuote{\code{W}} for weighted graphs (i.e. if the
-  \sQuote{\code{weight}} edge attribute is set). The fourth is
-  \sQuote{\code{B}} for bipartite graphs (i.e. if the
-  \sQuote{\code{type}} vertex attribute is set).
-
-  Then comes two numbers, the number of vertices and the number of edges
-  in the graph, and after a double dash, the name of the graph (the
-  \sQuote{\code{name}} graph attribute) is printed if present. The
-  second line is optional and it contains all the attributes of the
-  graph. This graph has a \sQuote{\code{name}} graph attribute, of type
-  character, and two other graph attributes called
-  \sQuote{\code{mutual}} and \sQuote{\code{circular}}, of a complex
-  type. A complex type is simply anything that is not numeric or
-  character. See the documentation of \code{\link{print.igraph}} for
-  details.
-
-  If you want to see the edges of the graph as well, then use the
-  \code{\link{str.igraph}} function, it is of course enough to type
-  \code{str} instead of \code{str.igraph}: \preformatted{    > str(g)
-    IGRAPH U--- 10 10 -- Ring graph
-    + attr: name (g/c), mutual (g/x), circular (g/x)
-    + edges:
-     [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10 }
-}
-\section{Creating graphs}{
-  There are many functions in igraph for creating graphs, both
-  deterministic and stochastic; stochastic graph constructors are called
-  \sQuote{games}.
-
-  To create small graphs with a given structure probably the
-  \code{\link{graph.formula}} function is easiest. It uses R's formula
-  interface, its manual page contains many examples. Another option is
-  \code{\link{graph}}, which takes numeric vertex ids directly.
-  \code{\link{graph.atlas}} creates graph from the Graph Atlas,
-  \code{\link{graph.famous}} can create some special graphs.
-
-  To create graphs from field data, \code{\link{graph.edgelist}},
-  \code{\link{graph.data.frame}} and \code{\link{graph.adjacency}} are
-  probably the best choices.
-
-  The igraph package includes some classic random graphs like the
-  Erdos-Renyi GNP and GNM graphs (\code{\link{erdos.renyi.game}}) and
-  some recent  popular models, like preferential attachment
-  (\code{\link{barabasi.game}}) and the small-world model
-  (\code{\link{watts.strogatz.game}}). 
-}
-\section{Vertex and edge IDs}{
-  Vertices and edges have numerical vertex ids in igraph. Vertex ids are
-  always consecutive and they start with one. I.e. for a graph with
-  \eqn{n} vertices the vertex ids are between \eqn{1} and
-  \eqn{n}. If some operation changes the number of vertices in the
-  graphs, e.g. a subgraph is created via \code{\link{induced.subgraph}}, then
-  the vertices are renumbered to satisfty this criteria.
-
-  The same is true for the edges as well, edge ids are always between
-  one and \eqn{m}, the total number of edges in the graph.
-
-  It is often desirable to follow vertices along a number of graph
-  operations, and vertex ids don't allow this because of the
-  renumbering. The solution is to assign attributes to the
-  vertices. These are kept by all operations, if possible. See more
-  about attributes in the next section.
-}
-\section{Attributes}{
-  In igraph it is possible to assign attributes to the vertices or edges
-  of a graph, or to the graph itself. igraph provides flexible
-  constructs for selecting a set of vertices or edges based on their
-  attribute values, see \code{\link{get.vertex.attribute}} and
-  \code{\link{iterators}} for details.
-
-  Some vertex/edge/graph attributes are treated specially. One of them
-  is the \sQuote{name} attribute. This is used for printing the graph
-  instead of the numerical ids, if it exists. Vertex names can also be
-  used to specify a vector or set of vertices, in all igraph
-  functions. E.g. \code{\link{degree}} has a \code{v} argument
-  that gives the vertices for which the degree is calculated. This
-  argument can be given as a character vector of vertex names.
-
-  Edges can also have a \sQuote{name} attribute, and this is treated
-  specially as well. Just like for vertices, edges can also be selected
-  based on their names, e.g. in the \code{\link{delete.edges}} and
-  other functions.
-
-  We note here, that vertex names can also be used to select edges.
-  The form \sQuote{\code{from|to}}, where \sQuote{\code{from}} and
-  \sQuote{\code{to}} are vertex names, select a single, possibly
-  directed, edge going from \sQuote{\code{from}} to
-  \sQuote{\code{to}}. The two forms can also be mixed in the same edge
-  selector.
-  
-  Other attributes define visualization parameters, see
-  \code{\link{igraph.plotting}} for details.
-
-  Attribute values can be set to any R object, but note that storing the
-  graph in some file formats might result the loss of complex attribute
-  values. All attribute values are preserved if you use
-  \code{\link[base]{save}} and \code{\link[base]{load}} to store/retrieve your
-  graphs.
-}
-\section{Visualization}{
-  igraph provides three different ways for visualization. The first is
-  the \code{\link{plot.igraph}} function. (Actually you don't need to
-  write \code{plot.igraph}, \code{plot} is enough. This function uses
-  regular R graphics and can be used with any R device.
-
-  The second function is \code{\link{tkplot}}, which uses a Tk GUI for
-  basic interactive graph manipulation. (Tk is quite resource hungry, so
-  don't try this for very large graphs.)
-
-  The third way requires the \code{rgl} package and uses OpenGL. See the
-  \code{\link{rglplot}} function for the details.
-
-  Make sure you read \code{\link{igraph.plotting}} before you start
-  plotting your graphs.
-}
-\section{File formats}{
-  igraph can handle various graph file formats, usually both for reading
-  and writing. We suggest that you use the GraphML file format for your
-  graphs, except if the graphs are too big. For big graphs a simpler
-  format is recommended. See \code{\link{read.graph}} and
-  \code{\link{write.graph}} for details.
-}
-\section{Further information}{
-  The igraph homepage is at \url{http://igraph.sourceforge.net}.
-  See especially the documentation section. Join the igraph-help mailing
-  list if you have questions or comments.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/aging.prefatt.game.Rd igraph-0.6.5/interfaces/R/igraph/man/aging.prefatt.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/aging.prefatt.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/aging.prefatt.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-\name{aging.prefatt.game}
-\alias{aging.prefatt.game}
-\alias{aging.barabasi.game}
-\alias{aging.ba.game}
-\concept{Preferential attachment}
-\concept{Aging of vertices}
-\concept{Random graph model}
-\title{Generate an evolving random graph with preferential attachment
-  and aging}
-\description{This function creates a random graph by simulating its
-  evolution. Each time a new vertex is added it creates a number of links
-  to old vertices and the probability that an old vertex is cited depends on
-  its in-degree (preferential attachment) and age.}
-\usage{
-aging.prefatt.game (n, pa.exp, aging.exp, m = NULL, aging.bin = 300,
-     out.dist = NULL, out.seq = NULL, out.pref = FALSE,
-     directed = TRUE, zero.deg.appeal = 1, zero.age.appeal = 0,
-     deg.coef = 1, age.coef = 1, time.window = NULL)
-}
-\arguments{
-  \item{n}{The number of vertices in the graph.}
-  \item{pa.exp}{The preferantial attachment exponent, see the details
-    below.}
-  \item{aging.exp}{The exponent of the aging, usually a non-positive
-    number, see details below.}
-  \item{m}{The number of edges each new vertex creates (except the very
-    first vertex). This argument is used only if both the
-    \code{out.dist} and \code{out.seq} arguments are NULL.}
-  \item{aging.bin}{The number of bins to use for measuring the age of
-    vertices, see details below.}
-  \item{out.dist}{The discrete distribution to generate the number of
-    edges to add in each time step if \code{out.seq} is NULL. See
-    details below.}
-  \item{out.seq}{The number of edges to add in each time step, a vector
-    containing as many elements as the number of vertices. See details
-    below.}
-  \item{out.pref}{Logical constant, whether to include edges not
-    initiated by the vertex as a basis of preferential attachment. See
-    details below.}
-  \item{directed}{Logical constant, whether to generate a directed
-    graph. See details below.}
-  \item{zero.deg.appeal}{The degree-dependent part of the
-    \sQuote{attractiveness} of the vertices with no adjacent edges. See
-    also details below.} 
-  \item{zero.age.appeal}{The age-dependent part of the
-    \sQuote{attrativeness} of the vertices with age zero. It is usually
-    zero, see details below.} 
-  \item{deg.coef}{The coefficient of the degree-dependent
-    \sQuote{attractiveness}. See details below.}
-  \item{age.coef}{The coefficient of the age-dependent part of the
-    \sQuote{attractiveness}. See details below.}
-  \item{time.window}{Integer constant, if NULL only adjacent added in
-    the last \code{time.windows} time steps are counted as a basis of
-    the preferential attachment. See also details below.}
-}
-\details{
-  This is a discrete time step model of a growing graph. We start with a
-  network containing a single vertex (and no edges) in the first time
-  step. Then in each time step (starting with the second) a new vertex
-  is added and it initiates a number of edges to the old vertices in the
-  network. The probability that an old vertex is connected to is
-  proportional to 
-  \deqn{P[i] \sim (c\cdot k_i^\alpha+a)(d\cdot l_i^\beta+b)\cdot }{%
-        P[i] ~ (c k[i]^alpha + a) (d l[i]^beta + a)}
-
-  Here \eqn{k_i}{k[i]} is the in-degree of vertex \eqn{i} in the current
-  time step and \eqn{l_i}{l[i]} is the age of vertex \eqn{i}. The age is
-  simply defined as the number of time steps passed since the vertex is
-  added, with the extension that vertex age is divided to be in
-  \code{aging.bin} bins.
-
- \eqn{c}, \eqn{\alpha}{alpha}, \eqn{a}, \eqn{d}, \eqn{\beta}{beta} and
- \eqn{b} are parameters and they can be set via the following
- arguments: \code{pa.exp} (\eqn{\alpha}{alpha}, mandatory argument),
- \code{aging.exp} (\eqn{\beta}{beta}, mandatory argument),
- \code{zero.deg.appeal} (\eqn{a}, optional, the default value is 1),
- \code{zero.age.appeal} (\eqn{b}, optional, the default is 0),
- \code{deg.coef} (\eqn{c}, optional, the default is 1),
- and \code{age.coef} (\eqn{d}, optional, the default is 1).
-
- The number of edges initiated in each time step is governed by the
- \code{m}, \code{out.seq} and \code{out.pref} parameters. If
- \code{out.seq} is given then it is interpreted as a vector giving the
- number of edges to be added in each time step. It should be of length
- \code{n} (the number of vertices), and its first element will be
- ignored. If \code{out.seq} is not given (or NULL) and \code{out.dist}
- is given then it will be used as a discrete probability distribution to
- generate the number of edges. Its first element gives the probability
- that zero edges are added at a time step, the second element is the
- probability that one edge is added, etc. (\code{out.seq} should contain
- non-negative numbers, but if they don't sum up to 1, they will be
- normalized to sum up to 1. This behavior is similar to the \code{prob}
- argument of the \code{sample} command.)
-
- By default a directed graph is generated, but it \code{directed} is set
- to \code{FALSE} then an undirected is created. Even if an undirected
- graph is generaed \eqn{k_i}{k[i]} denotes only the adjacent edges not
- initiated by the vertex itself except if \code{out.pref} is set to
- \code{TRUE}.
-
- If the \code{time.window} argument is given (and not NULL) then
- \eqn{k_i}{k[i]} means only the adjacent edges added in the previous
- \code{time.window} time steps.
-
- This function might generate graphs with multiple edges.
-}
-\value{A new graph.}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{barabasi.game}}, \code{\link{erdos.renyi.game}}}
-\examples{
-# The maximum degree for graph with different aging exponents
-g1 <- aging.prefatt.game(10000, pa.exp=1, aging.exp=0, aging.bin=1000)
-g2 <- aging.prefatt.game(10000, pa.exp=1, aging.exp=-1,   aging.bin=1000)
-g3 <- aging.prefatt.game(10000, pa.exp=1, aging.exp=-3,   aging.bin=1000)
-max(degree(g1))
-max(degree(g2))
-max(degree(g3))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/all.st.cuts.Rd igraph-0.6.5/interfaces/R/igraph/man/all.st.cuts.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/all.st.cuts.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/all.st.cuts.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-\name{stCuts}
-\alias{stCuts}
-\concept{Edge cuts}
-\concept{(s,t)-cuts}
-\title{List all (s,t)-cuts of a graph}
-\description{
-  List all (s,t)-cuts in a directed graph.
-}
-\usage{
-stCuts(graph, source, target)
-}
-\arguments{
-  \item{graph}{The input graph. It must be directed.}
-  \item{source}{The source vertex.}
-  \item{target}{The target vertex.}
-}
-\details{
-  Given a \eqn{G} directed graph and two, different and non-ajacent
-  vertices, \eqn{s} and \eqn{t}, an \eqn{(s,t)}-cut is a set of edges,
-  such that after removing these edges from \eqn{G} there is no directed
-  path from \eqn{s} to \eqn{t}.
-}
-\value{
-  A list with entries:
-  \item{cuts}{A list of numeric vectors containing edge ids. Each vector
-    is an \eqn{(s,t)}-cut.}
-  \item{partition1s}{A list of numeric vectors containing vertex
-    ids, they correspond to the edge cuts. Each vertex set is a 
-    generator of the corresponding cut, i.e. in the graph \eqn{G=(V,E)}, the
-    vertex set \eqn{X} and its complementer \eqn{V-X}, generates the cut
-    that contains exactly the edges that go from \eqn{X} to \eqn{V-X}.}
-}
-\references{
-  JS Provan and DR Shier: A Paradigm for listing
-  (s,t)-cuts in graphs, \emph{Algorithmica} 15, 351--372, 1996.    
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{stMincuts}} to list all minimum cuts.
-}
-\examples{
-# A very simple graph
-g <- graph.formula(a -+ b -+ c -+ d -+ e)
-stCuts(g, source="a", target="e")
-
-# A somewhat more difficult graph
-g2 <- graph.formula(s --+ a:b, a:b --+ t,
-                   a --+ 1:2:3, 1:2:3 --+ b)
-stCuts(g2, source="s", target="t")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/all.st.mincuts.Rd igraph-0.6.5/interfaces/R/igraph/man/all.st.mincuts.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/all.st.mincuts.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/all.st.mincuts.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-\name{stMincuts}
-\alias{stMincuts}
-\concept{Edge cuts}
-\concept{(s,t)-cuts}
-\concept{Minimum cuts}
-\concept{Minimum (s,t)-cuts}
-\title{List all minimum \eqn{(s,t)}-cuts of a graph}
-\description{
-  Listing all minimum \eqn{(s,t)}-cuts of a directed graph, for given
-  \eqn{s} and \eqn{t}.
-}
-\usage{
-stMincuts(graph, source, target, capacity = NULL)
-}
-\arguments{
-  \item{graph}{The input graph. It must be directed.}
-  \item{source}{The id of the source vertex.}
-  \item{target}{The id of the target vertex.}
-  \item{capacity}{Numeric vector giving the edge capacities. If this is
-    \code{NULL} and the graph has a \code{weight} edge
-    attribute, then this attribute defines the edge capacities. For
-    forcing unit edge capacities, even for graphs that have a
-    \code{weight} edge attribute, supply \code{NA} here.}
-}
-\details{
-  Given a \eqn{G} directed graph and two, different and non-ajacent
-  vertices, \eqn{s} and \eqn{t}, an \eqn{(s,t)}-cut is a set of edges,
-  such that after removing these edges from \eqn{G} there is no directed
-  path from \eqn{s} to \eqn{t}.
-
-  The size of an \eqn{(s,t)}-cut is defined as the sum of the
-  capacities (or weights) in the cut. For unweighed (=equally weighted)
-  graphs, this is simply the number of edges.
-  
-  An \eqn{(s,t)}-cut is minimum if it is of the smallest possible
-  size.
-}
-\value{
-  A list with entries:
-  \item{value}{Numeric scalar, the size of the minimum cut(s).}
-  \item{cuts}{A list of numeric vectors containing edge ids. Each vector
-    is a minimum \eqn{(s,t)}-cut.}
-  \item{partition1s}{A list of numeric vectors containing vertex
-    ids, they correspond to the edge cuts. Each vertex set is a 
-    generator of the corresponding cut, i.e. in the graph \eqn{G=(V,E)}, the
-    vertex set \eqn{X} and its complementer \eqn{V-X}, generates the cut
-    that contains exactly the edges that go from \eqn{X} to \eqn{V-X}.}
-}
-\references{
-  JS Provan and DR Shier: A Paradigm for listing
-  (s,t)-cuts in graphs, \emph{Algorithmica} 15, 351--372, 1996.  
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{stCuts}}, \code{\link{minimum.size.separators}}
-}
-\examples{
-# A difficult graph, from the Provan-Shier paper
-g <- graph.formula(s --+ a:b, a:b --+ t,
-                   a --+ 1:2:3:4:5, 1:2:3:4:5 --+ b)
-stMincuts(g, source="s", target="t")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/alpha.centrality.Rd igraph-0.6.5/interfaces/R/igraph/man/alpha.centrality.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/alpha.centrality.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/alpha.centrality.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,73 +0,0 @@
-\name{alpha.centrality}
-\alias{alpha.centrality}
-\concept{Alpha centrality}
-\title{Find Bonacich alpha centrality scores of network positions}
-\description{\code{alpha.centrality} calculates the alpha centrality of
-  some (or all) vertices in a graph.
-}
-\usage{
-alpha.centrality(graph, nodes=V(graph), alpha=1, loops=FALSE,
-                 exo=1, weights=NULL, tol=1e-7, sparse=TRUE)
-}
-\arguments{
-  \item{graph}{The input graph, can be directed or undirected}
-  \item{nodes}{Vertex sequence, the vertices for which the alpha
-    centrality values are returned. (For technical reasons they
-    will be calculated for all vertices, anyway.)}
-  \item{alpha}{Parameter specifying the relative importance of
-    endogenous versus exogenous factors in the determination of
-    centrality. See details below.}
-  \item{loops}{Whether to eliminate loop edges from the graph before the
-    calculation.}
-  \item{exo}{The exogenous factors, in most cases this is either a
-    constant -- the same factor for every node, or a vector giving the
-    factor for every vertex. Note that too long vectors will be
-    truncated and too short vectors will be replicated to match the
-    number of vertices.}
-  \item{weights}{A character scalar that gives the name of the edge
-    attribute to use in the adjacency matrix. If it is \code{NULL}, then
-    the \sQuote{weight} edge attribute of the graph is used, if there is
-    one. Otherwise, or if it is \code{NA}, then the calculation uses the
-    standard adjacency matrix.}
-  \item{tol}{Tolerance for near-singularities during matrix inversion,
-    see \code{\link{solve}}.}
-  \item{sparse}{Logical scalar, whether to use sparse matrices for the
-    calculation. The \sQuote{Matrix} package is required for sparse
-    matrix support}
-}
-\details{
-  The alpha centrality measure can be considered as a generalization of
-  eigenvector centerality to directed graphs. It was proposed by
-  Bonacich in 2001 (see reference below).
-
-  The alpha centrality of the vertices in a graph is defined as the
-  solution of the following matrix equation:
-  \deqn{x=\alpha A^T x+e,}{x=alpha t(A)x+e,}
-  where \eqn{A}{A} is the (not neccessarily symmetric) adjacency matrix of
-  the graph, \eqn{e}{e} is the vector of exogenous sources of status of the
-  vertices and \eqn{\alpha}{alpha} is the relative importance of the endogenous
-  versus exogenous factors.
-}
-\value{
-  A numeric vector contaning the centrality scores for the selected
-  vertices.
-}
-\references{
-  Bonacich, P. and Paulette, L. (2001). ``Eigenvector-like measures of
-  centrality for asymmetric relations'' \emph{Social Networks}, 23,
-  191-201.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\section{Warning}{Singular adjacency matrices cause problems for this
-  algorithm, the routine may fail is certain cases.}
-\seealso{\code{\link{evcent}} and \code{\link{bonpow}}}
-\examples{
-# The examples from Bonacich's paper
-g.1 <- graph( c(1,3,2,3,3,4,4,5) )
-g.2 <- graph( c(2,1,3,1,4,1,5,1) )
-g.3 <- graph( c(1,2,2,3,3,4,4,1,5,1) )
-alpha.centrality(g.1)
-alpha.centrality(g.2)
-alpha.centrality(g.3,alpha=0.5)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/arpack.Rd igraph-0.6.5/interfaces/R/igraph/man/arpack.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/arpack.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/arpack.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,260 +0,0 @@
-\name{arpack}
-\alias{arpack}
-\alias{arpack-options}
-\alias{igraph.arpack.default}
-\alias{arpack.unpack.complex}
-\concept{Eigenvalues}
-\concept{Eigenvectors}
-\concept{ARPACK}
-\title{ARPACK eigenvector calculation}
-\description{Interface to the ARPACK library for calculating
-  eigenvectors of sparse matrices}
-\usage{
-arpack(func, extra = NULL, sym = FALSE, options = igraph.arpack.default, 
-    env = parent.frame(), complex=!sym)
-arpack.unpack.complex(vectors, values, nev)
-}
-\arguments{
-  \item{func}{The function to perform the matrix-vector
-    multiplication. ARPACK requires to perform these by the user. The
-    function gets the vector \eqn{x} as the first argument, and it should
-    return \eqn{Ax}, where \eqn{A} is the \dQuote{input matrix}. (The
-    input matrix is never given explicitly.) The second argument is
-    \code{extra}.}
-  \item{extra}{Extra argument to supply to \code{func}.}
-  \item{sym}{Logical scalar, whether the input matrix is
-    symmetric. Always supply \code{TRUE} here if it is, since it can
-    speed up the computation. }
-  \item{options}{Options to ARPACK, a named list to overwrite some of
-    the default option values. See details below.}
-  \item{env}{The environment in which \code{func} will be evaluated.}
-  \item{complex}{Whether to convert the eigenvectors returned by ARPACK
-    into R complex vectors. By default this is not done for symmetric
-    problems (these only have real eigenvectors/values), but only
-    non-symmetric ones. If you have a non-symmetric problem, but you're
-    sure that the results will be real, then supply \code{FALSE} here.
-    The conversion is done by calling \code{arpack.unpack.complex}.
-  }
-  \item{vectors}{Eigenvectors, as returned by ARPACK.}
-  \item{values}{Eigenvalues, as returned by ARPACK}
-  \item{nev}{The number of eigenvectors/values to extract. This can be
-    less than or equal to the number of eigenvalues requested in the
-    original ARPACK call.}
-}
-\details{
-  ARPACK is a library for solving large scale eigenvalue problems.
-  The package is designed to compute a few eigenvalues and corresponding
-  eigenvectors of a general \eqn{n} by \eqn{n} matrix \eqn{A}. It is
-  most appropriate for large sparse or structured matrices \eqn{A} where
-  structured means that a matrix-vector product \code{w <- Av} requires
-  order \eqn{n} rather than the usual order \eqn{n^2} floating point
-  operations. Please see 
-  \url{http://www.caam.rice.edu/software/ARPACK/} for details.
-
-  This function is an interface to ARPACK. igraph does not contain all
-  ARPACK routines, only the ones dealing with symmetric and
-  non-symmetric eigenvalue problems using double precision real
-  numbers.
-
-  The eigenvalue calculation in ARPACK (in the simplest
-  case) involves the calculation of the \eqn{Av} product where \eqn{A}
-  is the matrix we work with and \eqn{v} is an arbitrary vector. The
-  function supplied in the \code{fun} argument is expected to perform
-  this product. If the product can be done efficiently, e.g. if the
-  matrix is sparse, then \code{arpack} is usually able to calculate the
-  eigenvalues very quickly.
-
-  The \code{options} argument specifies what kind of calculation to
-  perform. It is a list with the following members, they correspond
-  directly to ARPACK parameters. On input it has the following fields:
-  \describe{
-    \item{bmat}{Character constant, possible values: \sQuote{\code{I}},
-      stadard eigenvalue problem, \eqn{Ax=\lambda x}{A*x=lambda*x}; and
-      \sQuote{\code{G}}, generalized eigenvalue problem,
-      \eqn{Ax=\lambda B x}{A*x=lambda B*x}. Currently only
-      \sQuote{\code{I}} is supported.}
-    \item{n}{Numeric scalar. The dimension of the eigenproblem. You only
-      need to set this if you call \code{\link{arpack}}
-      directly. (I.e. not needed for \code{\link{evcent}},
-      \code{\link{page.rank}}, etc.)}
-    \item{which}{Specify which eigenvalues/vectors to compute, character
-      constant with exactly two characters.
-
-      Possible values for symmetric input matrices:
-      \describe{
-	\item{\sQuote{\code{LA}}}{Compute \code{nev} largest (algebraic)
-	  eigenvalues.}
-	\item{\sQuote{\code{SA}}}{Compute \code{nev} smallest (algebraic)
-	  eigenvalues.}
-	\item{\sQuote{\code{LM}}}{Compute \code{nev} largest (in magnitude)
-	  eigenvalues.}
-	\item{\sQuote{\code{SM}}}{Compute \code{nev} smallest (in magnitude)
-	  eigenvalues.}
-	\item{\sQuote{\code{BE}}}{Compute \code{nev} eigenvalues, half
-	  from each end of the spectrum. When \code{nev} is odd, compute
-	  one more from the high end than from the low end.}
-      }
-
-      Possible values for non-symmetric input matrices:
-      \describe{
-	\item{\sQuote{\code{LM}}}{Compute \code{nev} eigenvalues of
-	  largest magnitude.}
-	\item{\sQuote{\code{SM}}}{Compute \code{nev} eigenvalues of
-	  smallest magnitude.}
-	\item{\sQuote{\code{LR}}}{Compute \code{nev} eigenvalues of
-	  largest real part.}
-	\item{\sQuote{\code{SR}}}{Compute \code{nev} eigenvalues of
-	  smallest real part.}
-	\item{\sQuote{\code{LI}}}{Compute \code{nev} eigenvalues of
-	  largest imaginary part.}
-	\item{\sQuote{\code{SI}}}{Compute \code{nev} eigenvalues of
-	  smallest imaginary part.}
-      }	
-
-      This parameter is sometimes overwritten by the various functions,
-      e.g. \code{\link{page.rank}} always sets \sQuote{\code{LM}}.
-    }
-    \item{nev}{Numeric scalar. The number of eigenvalues to be computed.}
-    \item{tol}{Numeric scalar. Stopping criterion: the relative accuracy
-      of the Ritz value is considered acceptable if its error is less
-      than \code{tol} times its estimated value. If this is set to zero
-      then machine precision is used.}
-    \item{ncv}{Number of Lanczos vectors to be generated.}
-    \item{ldv}{Numberic scalar. It should be set to
-      zero in the current implementation.}
-    \item{ishift}{Either zero or one. If zero then the shifts are
-      provided by the user via reverse communication. If one then exact
-      shifts with respect to the reduced tridiagonal matrix \eqn{T}.
-      Please always set this to one.}
-    \item{maxiter}{Maximum number of Arnoldi update iterations allowed. }
-    \item{nb}{Blocksize to be used in the recurrence. Please always
-      leave this on the default value, one.}
-    \item{mode}{The type of the eigenproblem to be solved.
-      Possible values if the input matrix is symmetric:
-      \describe{
-	\item{1}{\eqn{Ax=\lambda x}{A*x=lambda*x}, \eqn{A} is symmetric.}
-	\item{2}{\eqn{Ax=\lambda Mx}{A*x=lambda*M*x}, \eqn{A} is
-	  symmetric, \eqn{M} is symmetric positive definite.}
-	\item{3}{\eqn{Kx=\lambda Mx}{K*x=lambda*M*x}, \eqn{K} is
-	  symmetric, \eqn{M} is symmetric positive semi-definite.}
-	\item{4}{\eqn{Kx=\lambda KGx}{K*x=lambda*KG*x}, \eqn{K} is
-	  symmetric positive semi-definite, \eqn{KG} is symmetric
-	  indefinite.}
-	\item{5}{\eqn{Ax=\lambda Mx}{A*x=lambda*M*x}, \eqn{A} is
-	  symmetric, \eqn{M} is symmetric positive
-	  semi-definite. (Cayley transformed mode.)}
-      }
-      Please note that only \code{mode==1} was tested and other values
-      might not work properly.
-
-      Possible values if the input matrix is not symmetric:
-      \describe{
-	\item{1}{\eqn{Ax=\lambda x}{A*x=lambda*x}.}
-	\item{2}{\eqn{Ax=\lambda Mx}{A*x=lambda*M*x}, \eqn{M} is
-	  symmetric positive definite.}
-	\item{3}{\eqn{Ax=\lambda Mx}{A*x=lambda*M*x}, \eqn{M} is
-	  symmetric semi-definite.}
-	\item{4}{\eqn{Ax=\lambda Mx}{A*x=lambda*M*x}, \eqn{M} is
-	      symmetric semi-definite.}
-      }
-      Please note that only \code{mode==1} was tested and other values
-      might not work properly.
-    }
-    \item{start}{Not used currently. Later it be used to set a starting
-      vector.}
-    \item{sigma}{Not used currently.}
-    \item{sigmai}{Not use currently.}
-
-    On output the following additional fields are added:
-    \describe{
-      \item{info}{Error flag of ARPACK. Possible values:
-	\describe{
-	  \item{0}{Normal exit.}
-	  \item{1}{Maximum number of iterations taken.}
-	  \item{3}{No shifts could be applied during a cycle of the
-	    Implicitly restarted Arnoldi iteration. One possibility
-	    is to increase the size of \code{ncv} relative to \code{nev}.}
-	}
-
-	ARPACK can return more error conditions than these, but they are
-	converted to regular igraph errors.
-      }
-      \item{iter}{Number of Arnoldi iterations taken.}
-      \item{nconv}{Number of \dQuote{converged} Ritz values. This
-	represents the number of Ritz values that satisfy the
-	convergence critetion. }
-      \item{numop}{Total number of matrix-vector multiplications.}
-      \item{numopb}{Not used currently.}
-      \item{numreo}{Total number of steps of re-orthogonalization.}
-    }
-  }
-  Please see the ARPACK documentation for additional details.
-
-  \code{arpack.unpack.complex} is a (semi-)internal function that
-  converts the output of the non-symmetric ARPACK solver to a more
-  readable format. It is called internally by \code{arpack}.
-  
-}
-\value{
-  A named list with the following members:
-  \item{values}{Numeric vector, the desired eigenvalues.}
-  \item{vectors}{Numeric matrix, the desired eigenvectors as
-    columns. If \code{complex=TRUE} (the default for non-symmetric
-    problems), then the matrix is complex.}
-  \item{options}{A named list with the supplied \code{options} and
-    some information about the performed calculation, including an
-    ARPACK exit code. See the details above.
-  }
-}
-\references{
-  D.C. Sorensen, Implicit Application of Polynomial Filters in
-  a k-Step Arnoldi Method. \emph{SIAM J. Matr. Anal. Apps.}, 13 (1992),
-  pp 357-385.
-  
-  R.B. Lehoucq, Analysis and Implementation of an Implicitly
-  Restarted Arnoldi Iteration. \emph{Rice University Technical Report}
-  TR95-13, Department of Computational and Applied Mathematics.
-  
-  B.N. Parlett & Y. Saad, Complex Shift and Invert Strategies for
-  Real Matrices. \emph{Linear Algebra and its Applications}, vol 88/89,
-  pp 575-595, (1987).
-}
-\author{Rich Lehoucq, Kristi Maschhoff, Danny Sorensen, Chao Yang for
-  ARPACK, Gabor Csardi \email{csardi.gabor@gmail.com} for the R interface.}
-\seealso{\code{\link{evcent}}, \code{\link{page.rank}},
-  \code{\link{hub.score}}, \code{\link{leading.eigenvector.community}}
-  are some of the functions in igraph which use ARPACK. The ARPACK
-  homepage is at \url{http://www.caam.rice.edu/software/ARPACK/}.
-}
-\examples{
-# Identity matrix
-f <- function(x, extra=NULL) x
-arpack(f, options=list(n=10, nev=2, ncv=4), sym=TRUE)
-
-# Graph laplacian of a star graph (undirected), n>=2
-# Note that this is a linear operation
-f <- function(x, extra=NULL) {
-  y <- x
-  y[1] <- (length(x)-1)*x[1] - sum(x[-1])
-  for (i in 2:length(x)) {
-    y[i] <- x[i] - x[1]
-  }
-  y
-}
-
-arpack(f, options=list(n=10, nev=1, ncv=3), sym=TRUE)
-
-# double check
-eigen(graph.laplacian(graph.star(10, mode="undirected")))
-
-## First three eigenvalues of the adjacency matrix of a graph
-## We need the 'Matrix' package for this
-if (require(Matrix)) {
-  g <- erdos.renyi.game(1000, 5/1000)
-  M <- get.adjacency(g, sparse=TRUE)
-  f2 <- function(x, extra=NULL) { cat("."); as.vector(M \%*\% x) }
-  baev <- arpack(f2, options=list(n=vcount(g), nev=3, ncv=8, sym=TRUE,
-                                  which="LM", maxiter=200))
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/articulation.points.Rd igraph-0.6.5/interfaces/R/igraph/man/articulation.points.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/articulation.points.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/articulation.points.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{articulation.points}
-\alias{articulation.points}
-\concept{Articulation point}
-\title{Articulation points of a graph}
-\description{Articuation points or cut vertices are vertices whose
-  removal increases the number of connected components in a graph.}
-\usage{
-articulation.points(graph)
-}
-\arguments{
-  \item{graph}{The input graph. It is treated as an undirected graph,
-    even if it is directed.}
-}
-\details{
-  Articuation points or cut vertices are vertices whose
-  removal increases the number of connected components in a graph. If
-  the original graph was connected, then the removal of a single
-  articulation point makes it undirected. If a graph contains no
-  articulation points, then its vertex connectivity is at least two.  
-}
-\value{A numeric vector giving the vertex ids of the articulation points
-  of the input graph.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{biconnected.components}}, \code{\link{clusters}},
-  \code{\link{is.connected}}, \code{\link{vertex.connectivity}}}
-\examples{
-g <- graph.disjoint.union( graph.full(5), graph.full(5) )
-clu <- clusters(g)$membership
-g <- add.edges(g, c(match(1, clu), match(2, clu)) )
-articulation.points(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/as.directed.Rd igraph-0.6.5/interfaces/R/igraph/man/as.directed.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/as.directed.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/as.directed.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-\name{as.directed}
-\alias{as.directed}
-\alias{as.undirected}
-\concept{Directed graph}
-\concept{Undirected graph}
-\title{Convert between directed and undirected graphs}
-\description{\code{as.directed} converts an undirected graph to
-  directed, \code{as.undirected} does the opposite, it converts a directed
-  graph to undirected.}
-\usage{
-as.directed(graph, mode = c("mutual", "arbitrary")) 
-as.undirected(graph, mode = c("collapse", "each", "mutual"),
-       edge.attr.comb = getIgraphOpt("edge.attr.comb"))
-}
-\arguments{
-  \item{graph}{The graph to convert.}
-  \item{mode}{Character constant, defines the conversion algorithm. For
-    \code{as.directed} it can be \code{mutual} or \code{arbitrary}. For
-    \code{as.undirected} it can be \code{each}, \code{collapse} or
-    \code{mutual}. See details below.}
-  \item{edge.attr.comb}{Specifies what to do with edge attributes, if
-    \code{mode="collapse"} or \code{mode="mutual"}.
-    In these cases many edges might be mapped to a
-    single one in the new graph, and their attributes are
-    combined. Please see \code{\link{attribute.combination}} for details
-    on this.}
-}
-\details{
-  Conversion algorithms for \code{as.directed}:
-  \describe{
-    \item{\code{arbitrary}}{The number of
-      edges in the graph stays the same, an arbitrarily directed edge is
-      created for each undirected edge.}
-    \item{\code{mutual}}{Two directed edges are created for each undirected
-      edge, one in each direction.}
-  }
-
-  Conversion algorithms for \code{as.undirected}:
-  \describe{
-    \item{\code{each}}{The number of edges remains constant, an
-      undirected edge is created for each directed one, this version
-      might create graphs with multiple edges.}
-    \item{\code{collapse}}{One undirected edge will be created for each
-      pair of vertices which are connected with at least one directed
-      edge, no multiple edges will be created.}
-    \item{\code{mutual}}{One undirected edge will be created for each
-      pair of mutual edges. Non-mutual edges are ignored. This mode
-      might create multiple edges if there are more than one mutual edge
-      pairs between the same pair of vertices.
-    }
-  }
-}
-\value{
-  A new graph object.
-}
-%\references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{simplify}} for removing multiple and/or loop edges
-  from a graph.}
-\examples{
-g <- graph.ring(10)
-as.directed(g, "mutual")
-g2 <- graph.star(10)
-as.undirected(g)
-
-# Combining edge attributes
-g3 <- graph.ring(10, directed=TRUE, mutual=TRUE)
-E(g3)$weight <- seq_len(ecount(g3))
-ug3 <- as.undirected(g3)
-print(ug3, e=TRUE)
-\dontrun{
-  x11(width=10, height=5)
-  layout(rbind(1:2))
-  plot( g3, layout=layout.circle, edge.label=E(g3)$weight)
-  plot(ug3, layout=layout.circle, edge.label=E(ug3)$weight)
-}
-
-g4 <- graph(c(1,2, 3,2,3,4,3,4, 5,4,5,4,
-              6,7, 7,6,7,8,7,8, 8,7,8,9,8,9,
-              9,8,9,8,9,9, 10,10,10,10))
-E(g4)$weight <- seq_len(ecount(g4))
-ug4 <- as.undirected(g4, mode="mutual",
-              edge.attr.comb=list(weight=length))
-print(ug4, e=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/as.igraph.Rd igraph-0.6.5/interfaces/R/igraph/man/as.igraph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/as.igraph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/as.igraph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{as.igraph}
-\alias{as.igraph}
-\alias{as.igraph.igraphHRG}
-\concept{Hierarchical random graphs}
-\title{Conversion to igraph}
-\description{These fucntions convert various objects to igraph graphs.}
-\usage{
-\method{as.igraph}{igraphHRG}(x, \dots)
-}
-\arguments{
-  \item{x}{The object to convert.}
-  \item{\dots}{Additional arguments. None currently.}
-}
-\details{
-  You can use \code{as.igraph} to convert various objects to igraph
-  graphs. Right now the following objects are supported:
-  \itemize{
-    \item code{igraphHRG} These objects are created by the
-    \code{\link{hrg.fit}} and \code{\link{hrg.consensus}} functions.
-  }
-}
-\value{
-  All these functions return an igraph graph.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}.}
-% \seealso{}
-\examples{
-g <- graph.full(5) + graph.full(5)
-hrg <- hrg.fit(g)
-as.igraph(hrg)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/assortativity.Rd igraph-0.6.5/interfaces/R/igraph/man/assortativity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/assortativity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/assortativity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,107 +0,0 @@
-\name{assortativity}
-\alias{assortativity}
-\alias{assortativity.degree}
-\alias{assortativity.nominal}
-\concept{Assortativity coefficient}
-\title{Assortativity coefficient}
-\description{
-  The assortativity coefficient is positive is similar vertices (based
-  on some external property) tend to connect to each, and negative
-  otherwise.
-}
-\usage{
-assortativity (graph, types1, types2 = NULL, directed = TRUE) 
-assortativity.nominal (graph, types, directed = TRUE) 
-assortativity.degree (graph, directed = TRUE) 
-}
-\arguments{
-  \item{graph}{The input graph, it can be directed or undirected.}
-  \item{types}{Vector giving the vertex types. They as assumed to be
-    integer numbers, starting with one. Non-integer values are
-    converted to integers with \code{\link{as.integer}}.}
-  \item{types1}{The vertex values, these can be arbitrary numeric
-    values.}
-  \item{types2}{A second value vector to be using for the incoming
-    edges when calculating assortativity for a directed graph. 
-    Supply \code{NULL} here if you want to use the same values
-    for outgoing and incoming edges. This argument is ignored
-    (with a warning) if it is not \code{NULL} and undirected
-    assortativity coefficient is being calculated.}
-  \item{directed}{Logical scalar, whether to consider edge directions
-    for directed graphs. This argument is ignored for undirected
-    graphs. Supply \code{TRUE} here to do the natural thing, i.e. use
-    directed version of the measure for directed graphs and the
-    undirected version for undirected graphs.}
-}
-\details{
-  The assortativity coefficient measures the level of homophyly of the
-  graph, based on some vertex labeling or values assigned to
-  vertices. If the coefficient is high, that means that connected
-  vertices tend to have the same labels or similar assigned values.
-  
-  M.E.J. Newman defined two kinds of assortativity coefficients, the
-  first one is for categorical labels of
-  vertices. \code{assortativity.nominal} calculates this measure. It is
-  defines as
-
-  \deqn{r=\frac{\sum_i e_{ii}-\sum_i a_i b_i}{1-\sum_i a_i b_i}}{
-    r=(sum(e(i,i), i) - sum(a(i)b(i), i)) / (1 - sum(a(i)b(i), i))}
-
-  where \eqn{e_{ij}}{e(i,j)} is the fraction of edges connecting vertices
-  of type \eqn{i} and \eqn{j},
-  \eqn{a_i=\sum_j e_{ij}}{a(i)=sum(e(i,j), j)} and
-  \eqn{b_j=\sum_i e_{ij}}{b(j)=sum(e(i,j), i)}.
-  
-  The second assortativity variant is based on values assigned to the
-  vertices. \code{assortativity} calculates this measure. It is defined
-  as
-
-  \deqn{r=\frac1{\sigma_q^2}\sum_{jk} jk(e_{jk}-q_j q_k)}{
-    sum(jk(e(j,k)-q(j)q(k)), j, k) / sigma(q)^2}
-
-  for undirected graphs (\eqn{q_i=\sum_j e_{ij}}{q(i)=sum(e(i,j), j)})
-  and as 
-
-  \deqn{r=\frac1{\sigma_o\sigma_i}\sum_{jk}jk(e_{jk}-q_j^o q_k^i)}{
-    sum(jk(e(j,k)-qout(j)qin(k)), j, k) / sigma(qin) / sigma(qout)
-  }
-
-  for directed ones. Here
-  \eqn{q_i^o=\sum_j e_{ij}}{qout(i)=sum(e(i,j), j)},
-  \eqn{q_i^i=\sum_j e_{ji}}{qin(i)=sum(e(j,i), j)},
-  moreover, \eqn{\sigma_q}{sigma(q)},
-  \eqn{sigma_o}{sigma(qout)} and
-  \eqn{sigma_i}{sigma(qin)} are the standard deviations of \eqn{q},
-  \eqn{q^o}{qout} and \eqn{q^i}{qin}, respectively.
-
-  The reason of the difference is that in directed
-  networks the relationship is not symmetric, so it is possible to
-  assign different values to the outgoing and the incoming end of the
-  edges.
-
-  \code{assortativity.degree} uses vertex degree (minus one) as vertex
-  values and calls \code{assortativity}.
-}
-\value{
-  A single real number.
-}
-\references{
- M. E. J. Newman: Mixing patterns in networks, \emph{Phys. Rev. E} 67,
- 026126 (2003) \url{http://arxiv.org/abs/cond-mat/0209450}
-
- M. E. J. Newman: Assortative mixing in networks,
- \emph{Phys. Rev. Lett.} 89, 208701 (2002)
- \url{http://arxiv.org/abs/cond-mat/0205405/}
-}
-\author{
-  Gabor Csardi \email{csardi.gabor@gmail.com}
-}
-% \seealso{}
-\examples{
-# random network, close to zero
-assortativity.degree(erdos.renyi.game(10000,3/10000))
-
-# BA model, tends to be dissortative
-assortativity.degree(ba.game(10000, m=4))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/attribute.combination.Rd igraph-0.6.5/interfaces/R/igraph/man/attribute.combination.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/attribute.combination.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/attribute.combination.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,144 +0,0 @@
-\name{Combining attributes}
-\alias{attribute.combination}
-\concept{Vertex/edge/graph attributes}
-\title{How igraph functions handle attributes when the graph changes}
-\description{Many times, when the structure of a graph is modified,
-  vertices/edges map of the original graph map to vertices/edges in the
-  newly created (modified) graph. For example \code{\link{simplify}}
-  maps multiple edges to single edges. igraph provides a flexible
-  mechanism to specify what to do with the vertex/edge attributes in
-  these cases.}
-\details{
-  The functions that support the combination of attributes have one or
-  two extra arguments called \code{vertex.attr.comb} and/or
-  \code{edge.attr.comb} that specify how to perform the mapping of the
-  attributes. E.g. \code{\link{contract.vertices}} contracts many
-  vertices into a single one, the attributes of the vertices can be
-  combined and stores as the vertex attributes of the new graph.
-
-  The specification of the combination of (vertex or edge) attributes
-  can be given as
-  \enumerate{
-    \item{a character scalar,}
-    \item{a function object or}
-    \item{a list of character scalars and/or function objects.}
-  }
-
-  If it is a character scalar, then it refers to one of the predefined
-  combinations, see their list below.
-
-  If it is a function, then the given function is expected to perform
-  the combination. It will be called once for each new vertex/edge in
-  the graph, with a single argument: the attribute values of the
-  vertices that map to that single vertex.
-
-  The third option, a list can be used to specify different combination
-  methods for different attributes. A named entry of the list
-  corresponds to the attribute with the same name. An unnamed entry
-  (i.e. if the name is the empty string) of the list specifies the
-  default combination method. I.e.
-  \preformatted{list(weight="sum", "ignore")}
-  specifies that the weight of the new edge should be sum of the weights
-  of the corresponding edges in the old graph; and that the rest of the
-  attributes should be ignored (=dropped).
-}
-\section{Predefined combination functions}{
-  The following combination behaviors are predefined:
-  \describe{
-    \item{\sQuote{ignore}}{The attribute is ignored and dropped.}
-    \item{\sQuote{sum}}{The sum of the attributes is calculated. This
-      does not work for character attributes and works for complex
-      attributes only if they have a \code{sum} generic
-      defined. (E.g. it works for sparse matrices from the \code{Matrix}
-      package, because they have a \code{sum} method.)}
-    \item{\sQuote{prod}}{The product of the attributes is
-      calculated. This does not work for character attributes and 
-      works for complex attributes only if they have a \code{prod}
-      function defined.}
-    \item{\sQuote{min}}{The minimum of the attributes is calculated and
-      returned. For character and complex attributes the standard R
-      \code{min} function is used.}
-    \item{\sQuote{max}}{The maximum of the attributes is calculated and
-      returned. For character and complex attributes the standard R
-      \code{max} function is used.}
-    \item{\sQuote{random}}{Chooses one of the supplied attribute
-      values, uniformly randomly. For character and complex attributes
-      this is implemented by calling \code{sample}.}
-    \item{\sQuote{first}}{Always chooses the first attribute value. It
-      is implemented by calling the \code{head} function.}
-    \item{\sQuote{last}}{Always chooses the last attribute value. It is
-      implemented by calling the \code{tail} function.}
-    \item{\sQuote{mean}}{The mean of the attributes is calculated and
-      returned. For character and complex attributes this simply calls
-      the \code{mean} function.}
-    \item{\sQuote{median}}{The median of the attributes is
-      selected. Calls the R \code{median} function for all attribute
-      types.}
-    \item{\sQuote{concat}}{Concatenate the attributes, using the
-      \code{c} function. This results almost always a complex
-      attribute.}
-  }
-}
-\section{Specifying combination methods for all graphs}{
-  The are two standard igraph parameters that define the default
-  behavior when combining vertices and edges: \code{vertex.attr.comb}
-  specifies how to combine vertices by default, \code{edge.attr.comb}
-  does the same for edges.
-
-  E.g. if you want to drop all vertex attributes when combining
-  vertices, you can specify
-  \preformatted{igraph.options(vertex.attr.comb="ignore")}
-
-  As another example, if -- when combining edges -- you want to keep the
-  mean weight of the edges, concatenate their names into a single
-  character scalar, and drop everything else, then use
-  \preformatted{igraph.options(edge.attr.comb=list(weight="mean",
-    name=toString, "ignore")}
-}
-\section{Simple and complex attributes}{
-  An attribute is simple if (for all vertices/edges) it can be specified
-  as an atomic vector. Character and numeric attributes are always
-  simple. E.g. a vertex attribute that is a numeric vector of arbitrary
-  length for each vertex, is a complex attribute.
-
-  Combination of attributes might turn a complex attribute into
-  a single one, and the opposite is possible, too. E.g. when
-  contatenating attribute values to form the new attribute value, the
-  result will be typically a complex attribute.
-
-  See also examples below.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link[igraph]{attributes}} on how to use
-  graph/vertex/edges attributes in general. \code{\link{igraph.options}} on
-  igraph parameters.}
-\examples{
-g <- graph( c(1,2, 1,2, 1,2, 2,3, 3,4) )
-E(g)$weight <- 1:5
-
-## print attribute values with the graph
-igraph.options(print.graph.attributes=TRUE)
-igraph.options(print.vertex.attributes=TRUE)
-igraph.options(print.edge.attributes=TRUE)
-
-## new attribute is the sum of the old ones
-simplify(g, edge.attr.comb="sum")
-
-## collect attributes into a string
-simplify(g, edge.attr.comb=toString)
-
-## concatenate them into a vector, this creates a complex
-## attribute
-simplify(g, edge.attr.comb="concat")
-
-E(g)$name <- letters[seq_len(ecount(g))]
-
-## both attributes are collected into strings
-simplify(g, edge.attr.comb=toString)
-
-## harmonic average of weights, names are dropped
-simplify(g, edge.attr.comb=list(weight=function(x) length(x)/sum(1/x),
-                                name="ignore"))
-
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/attributes.Rd igraph-0.6.5/interfaces/R/igraph/man/attributes.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/attributes.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/attributes.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,152 +0,0 @@
-\name{attributes}
-\alias{attributes}
-\alias{set.graph.attribute}
-\alias{get.graph.attribute}
-\alias{remove.graph.attribute}
-\alias{list.graph.attributes}
-\alias{set.vertex.attribute}
-\alias{get.vertex.attribute}
-\alias{remove.vertex.attribute}
-\alias{list.vertex.attributes}
-\alias{set.edge.attribute}
-\alias{get.edge.attribute}
-\alias{remove.edge.attribute}
-\alias{list.edge.attributes}
-\concept{Vertex/edge/graph attributes}
-\title{Graph, vertex and edge attributes}
-\description{Attributes are associated values belonging to a graph,
-  vertices or edges. These can represent some property, like data
-  about how the graph was constructed, the color of the vertices when
-  the graph is plotted, or simply the weights of the edges in a weighted
-  graph.}
-\usage{
-get.graph.attribute(graph, name)
-set.graph.attribute(graph, name, value)
-remove.graph.attribute(graph, name)
-get.vertex.attribute(graph, name, index=V(graph))
-set.vertex.attribute(graph, name, index=V(graph), value)
-remove.vertex.attribute(graph, name)
-get.edge.attribute(graph, name, index=E(graph))
-set.edge.attribute(graph, name, index=E(graph), value)
-remove.edge.attribute(graph, name)
-}
-\arguments{
-  \item{graph}{The graph object to work on. Note that the original graph
-  is never modified, a new graph object is returned instead; if you don't
-  assign it to a variable your modifications will be lost! See examples
-  below.}
-  \item{name}{Character constant, the name of the attribute.}
-  \item{index}{Numeric vector, the ids of the vertices or edges.
-    It is not recycled, even if \code{value} is longer.}
-  \item{value}{Numeric vector, the new value(s) of the attributes, it
-    will be recycled if needed.}
-}
-\details{
-  There are three types of attributes in igraph: graph, vertex and edge
-  attributes. Graph attributes are associated with graph, vertex
-  attributes with vertices and edge attributes with edges.
-
-  Examples for graph attributes are the date when the graph data was
-  collected or other types of memos like the type of the data, or
-  whether the graph is a simple graph, ie. one without loops and
-  multiple edges.
-
-  Examples of vertex attributes are vertex properties, like the
-  vertex coordinates for the visualization of the graph, or other
-  visualization parameters, or meta-data associated with the vertices,
-  like the gender and the age of the individuals in a friendship
-  network, the type of the neurons in a graph representing neural
-  circuitry or even some pre-computed structual properties, like the
-  betweenness centrality of the vertices.
-
-  Examples of edge attributes are data associated with edges: most
-  commonly edge weights, or visualization parameters.
-
-  In recent igraph versions, arbitrary R objects can be assigned as
-  graph, vertex or edge attributes.
-  
-  Some igraph functions use the values or graph, vertex and edge
-  attributes if they are present but this is not done in the current
-  version very extensively. Expect more in the (near) future.
-
-  Graph attributes can be created with the \code{set.graph.attribute}
-  function, and removed with \code{remove.graph.attribute}. Graph
-  attributes are queried with \code{get.graph.attribute} and the
-  assigned graph attributes are listed with
-  \code{list.graph.attributes}.
-
-  There is a simpler notation for using graph attributes: the
-  \sQuote{\code{$}} operator. It can be used both to query and set graph
-  attributes, see an example below.
-  
-  The functions for vertex attributes are
-  \code{set.vertex.attribute}, \code{get.vertex.attribute},
-  \code{remove.vertex.attribute} and \code{list.vertex.attributes} and
-  for edge attributes they are \code{set.edge.attribute},
-  \code{get.edge.attribute}, \code{remove.edge.attribute} and
-  \code{list.edge.attributes}.
-  
-  There is however a (syntactically) much simpler way to handle vertex
-  and edge attribute by using vertex and edge selectors, it works like this:
-  \code{V(g)} selects all vertices in a graph, and \code{V(g)$name}
-  queries the \code{name} attribute for all vertices. Similarly is
-  \code{vs} is a vertex set \code{vs$name} gives the values of the
-  \code{name} attribute for the vertices in the vertex set.
-
-  This form can also be used to set the values of the attributes, like
-  the regular R convention:
-  \preformatted{V(g)$color <- "red"}
-  It works for vertex subsets as well:
-  \preformatted{V(g)[1:5]$color <- "green"}
-
-  The notation for edges is similar: \code{E(g)} means all edges
-  \code{E(g)$weight} is the \code{weight} attribute for all edges, etc.
-
-  See also the manual page for \code{iterators} about how to create
-  various vertex and edge sets.
-}
-\value{
-  \code{get.graph.attribute}, \code{get.vertex.attribute} and
-  \code{get.edge.attribute} return an R object, or a list of R objects
-  if attributes of more vertices/edges are requested.
-
-  \code{set.graph.attribute}, \code{set.vertex.attribute},
-  \code{set.edge.attribute}, and also \code{remove.graph.attribute},
-  \code{remove.vertex.attribute} and \code{remove.edge.attribute} return
-  a new graph object with the updates/removes performed.
-
-  \code{list.graph.attributes}, \code{list.vertex.attributes} and
-  \code{list.edge.attributes} return a character vector, the names of
-  the attributes present.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{print.igraph}} can print attributes. See
-  \code{\link{attribute.combination}} for details on how igraph combines
-  attributes if several vertices or edges are mapped into one.}
-\examples{
-g <- graph.ring(10)
-g <- set.graph.attribute(g, "name", "RING")
-# It is the same as
-g$name <- "RING"
-g$name
-
-g <- set.vertex.attribute(g, "color", value=c("red", "green"))
-get.vertex.attribute(g, "color")
-
-g <- set.edge.attribute(g, "weight", value=runif(ecount(g)))
-get.edge.attribute(g, "weight")
-
-# The following notation is more convenient
-
-g <- graph.star(10)
-
-V(g)$color <- c("red", "green")
-V(g)$color
-
-E(g)$weight <- runif(ecount(g))
-E(g)$weight
-
-print(g, g=TRUE, v=TRUE, e=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/autocurve.edges.Rd igraph-0.6.5/interfaces/R/igraph/man/autocurve.edges.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/autocurve.edges.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/autocurve.edges.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-\name{autocurve.edges}
-\alias{autocurve.edges}
-\title{Optimal edge curvature when plotting graphs}
-\description{
-  If graphs have multiple edges, then drawing them as straight lines
-  does not show them when plotting the graphs; they will be on top
-  of each other. One solution is to bend the edges, with diffenent
-  curvature, so that all of them are visible.}
-\usage{
-autocurve.edges (graph, start = 0.5)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{start}{The curvature at the two extreme edges. All edges will
-    have a curvature between \code{-start} and \code{start}, spaced
-    equally.}
-}
-\details{
-  \code{autocurve.edges} calculates the optimal \code{edge.curved}
-  vector for plotting a graph with multiple edges, so that all edges
-  are visible.
-}
-\value{
-  A numeric vector, its length is the number of edges in the graph.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{igraph.plotting}} for all plotting parameters,
-  \code{\link{plot.igraph}}, \code{\link{tkplot}} and
-  \code{\link{rglplot}} for plotting functions.
-}
-\examples{
-g <- graph( c(0,1,1,0,1,2,1,3,1,3,1,3,
-              2,3,2,3,2,3,2,3,0,1)+1 )
-
-autocurve.edges(g)
-
-\dontrun{
-set.seed(42)
-plot(g)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/ba.game.Rd igraph-0.6.5/interfaces/R/igraph/man/ba.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/ba.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/ba.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,108 +0,0 @@
-\name{barabasi.game}
-\alias{barabasi.game}
-\alias{ba.game}
-\concept{Preferential attachment model}
-\concept{Random graph model}
-\title{Generate scale-free graphs according to the Barabasi-Albert
-  model}
-\description{The BA-model is a very simple stochastic algorithm for
-  building a graph.}
-\usage{
-barabasi.game(n, power = 1, m = NULL, out.dist = NULL, out.seq = NULL, 
-    out.pref = FALSE, zero.appeal = 1, directed = TRUE,
-    algorithm = c("psumtree", "psumtree-multiple", "bag"),
-    start.graph = NULL)
-}
-\arguments{
-  \item{n}{Number of vertices.}
-  \item{power}{The power of the preferential attachment, the default is
-    one, ie. linear preferential attachment.}
-  \item{m}{Numeric constant, the number of edges to add in each time
-    step This argument is only used if both \code{out.dist} and
-    \code{out.seq} are omitted or NULL.}
-  \item{out.dist}{Numeric vector, the distribution of the number of
-    edges to add in each time step. This argument is only used if the
-    \code{out.seq} argument is omitted or NULL.}
-  \item{out.seq}{Numeric vector giving the number of edges to add in
-    each time step. Its first element is ignored as no edges are added
-    in the first time step.}
-  \item{out.pref}{Logical, if true the total degree is used for
-    calculating the citation probability, otherwise the in-degree is
-    used. }
-  \item{zero.appeal}{The \sQuote{attractiveness} of the vertices with no
-    adjacent edges. See details below.}
-  \item{directed}{Whether to create a directed graph.}
-  \item{algorithm}{The algorithm to use for the graph generation.
-    \code{psumtree} uses a partial prefix-sum tree to generate
-    the graph, this algorithm can handle any \code{power} and
-    \code{zero.appeal} values and never generates multiple edges.
-    \code{psumtree-multiple} also uses a partial prefix-sum
-    tree, but the generation of multiple edges is allowed. Before the
-    0.6 version igraph used this algorithm if \code{power} was not one,
-    or \code{zero.appeal} was not one.
-    \code{bag} is the algorithm that was previously (before
-    version 0.6) used if \code{power} was one and \code{zero.appeal} was
-    one as well. It works by putting the ids of the vertices into a bag
-    (mutliset, really), exactly as many times as their (in-)degree, plus
-    once more. Then the required number of cited vertices are drawn from
-    the bag, with replacement. This method might generate multiple
-    edges. It only works if \code{power} and \code{zero.appeal} are
-    equal one.
-  }
-  \item{start.graph}{\code{NULL} or an igraph graph. If a graph, then
-    the supplied graph is used as a starting graph for the preferential
-    attachment algorithm. The graph should have at least one vertex. If
-    a graph is supplied here and the \code{out.seq} argument is not
-    \code{NULL}, then it should contain the out degrees of the new
-    vertices only, not the ones in the \code{start.graph}.}
-}
-\details{
-  This is a simple stochastic algorithm to generate a graph. It is a
-  discrete time step model and in each time step a single vertex is
-  added.
-
-  We start with a single vertex and no edges in the first time
-  step. Then we add one vertex in each time step and the new vertex
-  initiates some edges to old vertices. The probability that an old vertex
-  is chosen is given by
-  \deqn{P[i] \sim k_i^\alpha+a}{P[i] ~ k[i]^alpha + a}
-  where \eqn{k_i}{k[i]} is the in-degree of vertex \eqn{i} in the
-  current time step (more precisely the number of adjacent edges of
-  \eqn{i} which were not initiated by \eqn{i} itself) and
-  \eqn{\alpha}{alpha} and \eqn{a} are parameters given by the
-  \code{power} and \code{zero.appeal} arguments.
-
-  The number of edges initiated in a time step is given by the \code{m},
-  \code{out.dist} and \code{out.seq} arguments. If \code{out.seq} is
-  given and not NULL then it gives the number of edges to add in a
-  vector, the first element is ignored, the second is the number of
-  edges to add in the second time step and so on. If \code{out.seq} is
-  not given or null and \code{out.dist} is given and not NULL then it is
-  used as a discrete distribution to generate the number of edges in
-  each time step. Its first element is the probability that no edges
-  will be added, the second is the probability that one edge is added,
-  etc. (\code{out.dist} does not need to sum up to one, it normalized
-  automatically.) \code{out.dist} should contain non-negative numbers
-  and at east one element should be positive.
-
-  If both \code{out.seq} and \code{out.dist} are omitted or NULL then
-  \code{m} will be used, it should be a positive integer constant and
-  \code{m} edges will be added in each time step.
-
-  \code{barabasi.game} generates a directed graph by default, set
-  \code{directed} to \code{FALSE} to generate an undirected graph. Note
-  that even if an undirected graph is generated \eqn{k_i}{k[i]} denotes
-  the number of adjacent edges not initiated by the vertex itself and
-  not the total (in- + out-) degree of the vertex, unless the
-  \code{out.pref} argument is set to \code{TRUE}.
-}
-\value{A graph object.}
-\references{  Barabasi, A.-L. and Albert R. 1999. Emergence of scaling
-  in random networks \emph{Science}, 286 509--512.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{random.graph.game}}}
-\examples{
-g <- barabasi.game(10000)
-degree.distribution(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/betweenness.Rd igraph-0.6.5/interfaces/R/igraph/man/betweenness.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/betweenness.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/betweenness.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,96 +0,0 @@
-\name{betweenness}
-\alias{betweenness}
-\alias{edge.betweenness}
-\alias{betweenness.estimate}
-\alias{edge.betweenness.estimate}
-\concept{Betweenness centrality}
-\concept{Edge betweenness}
-\title{Vertex and edge betweenness centrality}
-\description{The vertex and edge betweenness are (roughly) defined by
-  the number of geodesics (shortest paths) going through a vertex or an
-  edge. 
-}
-\usage{
-betweenness(graph, v=V(graph), directed = TRUE, weights = NULL,
-     nobigint = TRUE, normalized = FALSE)
-edge.betweenness(graph, e=E(graph), directed = TRUE, weights = NULL)
-betweenness.estimate(graph, vids = V(graph), directed = TRUE, cutoff,
-     weights = NULL, nobigint = TRUE)
-edge.betweenness.estimate(graph, e=E(graph),
-     directed = TRUE, cutoff, weights = NULL)
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{v}{The vertices for which the vertex betweenness will be
-    calculated.}
-  \item{e}{The edges for which the edge betweenness will be
-    calculated.}
-  \item{directed}{Logical, whether directed paths should be considered
-    while determining the shortest paths.}
-  \item{weights}{Optional positive weight vector for calculating
-    weighted betweenness. If the graph has a \code{weight} edge
-    attribute, then this is used by default.}
-  \item{nobigint}{Logical scalar, whether to use big integers during the
-    calculation. This is only required for lattice-like graphs that have
-    very many shortest paths between a pair of vertices. If \code{TRUE}
-    (the default), then big integers are not used.}
-  \item{normalized}{Logical scalar, whether to normalize the betweenness
-    scores. If \code{TRUE}, then the results are normalized according to
-    \deqn{B^n=\frac{2B}{n^2-3n+2}}{Bnorm=2*B/(n*n-3*n+2)}, where
-    \eqn{B^n}{Bnorm} is the normalized, \eqn{B} the raw betweenness, and
-    \eqn{n} is the number of vertices in the graph.}
-  \item{vids}{The vertices for which the vertex betweenness estimation
-    will be calculated.}
-  \item{cutoff}{The maximum path length to consider when calculating the
-    betweenness. If zero or negative then there is no such limit.}
-}
-\details{The vertex betweenness of vertex \eqn{v}{\code{v}} is defined
-  by
-
-  \deqn{\sum_{i\ne j, i\ne v, j\ne v} g_{ivj}/g_{ij}}{sum( g_ivj / g_ij, i!=j,i!=v,j!=v)}
-  
-  The edge betweenness of edge \eqn{e}{\code{e}} is defined by
-
-  \deqn{\sum_{i\ne j} g{iej}/g_{ij}.}{sum( g_iej / g_ij, i!=j).}
-
-  \code{betweenness} calculates vertex betweenness,
-  \code{edge.betweenness} calculates edge.betweenness.
-
-  \code{betweenness.estimate} only considers paths of length
-  \code{cutoff} or smaller, this can be run for larger graphs, as the
-  running time is not quadratic (if \code{cutoff} is small). If
-  \code{cutoff} is zero or negative then the function calculates the
-  exact betweenness scores.
-
-  \code{edge.betweenness.estimate} is similar, but for edges.
-
-  For calculating the betweenness a similar algorithm to the one
-  proposed by Brandes (see References) is used.
-}
-\value{A numeric vector with the betweenness score for each vertex in
-  \code{v} for \code{betweenness}.
-
-  A numeric vector with the edge betweenness score for each edge in
-  \code{e} for \code{edge.betweenness}.
-
-  \code{betweenness.estimate} returns the estimated betweenness scores
-  for vertices in \code{vids}, \code{edge.betweenness.estimate}
-  the estimated edge betweenness score for \emph{all} edges; both in
-  a numeric vector.
-}
-\note{\code{edge.betweenness} might give false values for graphs with
-  multiple edges.}
-\references{Freeman, L.C. (1979). Centrality in Social Networks I:
-  Conceptual Clarification. \emph{Social Networks}, 1, 215-239.
-
-  Ulrik Brandes, A Faster Algorithm for Betweenness Centrality. \emph{Journal
-  of Mathematical Sociology} 25(2):163-177, 2001. 
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{closeness}}, \code{\link{degree}}}
-\examples{
-g <- random.graph.game(10, 3/10)
-betweenness(g)
-edge.betweenness(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/biconnected.components.Rd igraph-0.6.5/interfaces/R/igraph/man/biconnected.components.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/biconnected.components.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/biconnected.components.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-\name{biconnected.components}
-\alias{biconnected.components}
-\concept{Biconnected component}
-\title{Biconnected components}
-\description{Finding the biconnected components of a graph}
-\usage{
-biconnected.components(graph)
-}
-\arguments{
-  \item{graph}{The input graph. It is treated as an undirected graph,
-    even if it is directed.}
-}
-\details{
-  A graph is biconnected if the removal of any single vertex (and its
-  adjacent edges) does not disconnect it.
-
-  A biconnected component of a graph is a maximal biconnected subgraph
-  of it. The biconnected components of a graph can be given by the
-  partition of its edges: every edge is a member of exactly one
-  biconnected component. Note that this is not true for vertices: the same
-  vertex can be part of many biconnected components.  
-}
-\value{
-  A named list with three components:
-  \item{no}{Numeric scalar, an integer giving the number of
-    biconnected components in the graph.}
-  \item{tree_edges}{The components themselves, a list of numeric
-    vectors. Each vector is a set of edge ids giving the edges in a
-    biconnected component. These edges define a spanning tree of the
-    component.}
-  \item{component_edges}{A list of numeric vectors. It gives all edges
-  in the components.}
-  \item{components}{A list of numeric vectors, the vertices of the
-    components.}
-  \item{articulation_points}{The articulation points of the graph. See
-    \code{\link{articulation.points}}.}
-}
-%\references
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{articulation.points}}, \code{\link{clusters}},
-  \code{\link{is.connected}}, \code{\link{vertex.connectivity}}}
-\examples{
-g <- graph.disjoint.union( graph.full(5), graph.full(5) )
-clu <- clusters(g)$membership
-g <- add.edges(g, c(which(clu==1), which(clu==2)))
-bc <- biconnected.components(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/bipartite.projection.Rd igraph-0.6.5/interfaces/R/igraph/man/bipartite.projection.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/bipartite.projection.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/bipartite.projection.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-\name{bipartite.projection}
-\alias{bipartite.projection}
-\alias{bipartite.projection.size}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\title{Project a bipartite graph}
-\description{A bipartite graph is projected into two one-mode networks}
-\usage{
-bipartite.projection.size(graph, types = NULL)
-bipartite.projection (graph, types = NULL, multiplicity = TRUE,
-       probe1 = NULL)
-}
-\arguments{
-  \item{graph}{The input graph. It can be directed, but edge directions
-    are ignored during the computation.}
-  \item{types}{An optional vertex type vector to use instead of the
-    \sQuote{\code{type}} vertex attribute. You must supply this argument
-    if the graph has no \sQuote{\code{type}} vertex attribute.}
-  \item{multiplicity}{If \code{TRUE}, then igraph keeps the multiplicity
-    of the edges as an edge attribute. E.g. if there is an A-C-B and
-    also an A-D-B triple in the bipartite graph (but no more X, such
-    that A-X-B is also in the graph), then the multiplicity of the A-B
-    edge in the projection will be 2.}
-  \item{probe1}{This argument can be used to specify the order of the
-    projections in the resulting list. If given, then it is considered
-    as a vertex id (or a symbolic vertex name); the projection
-    containing this vertex will be the first one in the result list.}
-}
-\details{
-  Bipartite graphs have a \code{type} vertex attribute in
-  igraph, this is boolean and \code{FALSE} for the vertices of the first
-  kind and \code{TRUE} for vertices of the second kind.
-
-  \code{bipartite.projection.size} calculates the number of vertices and
-  edges in the two projections of the bipartite graphs, without
-  calculating the projections themselves. This is useful to check how
-  much memory the projections would need if you have a large bipartite
-  graph.
-
-  \code{bipartite.projections} calculates the actual projections.
-  You can use the \code{probe1} argument to specify the order of the
-  projections in the result. By default vertex type \code{FALSE} is the
-  first and \code{TRUE} is the second.
-
-  \code{bipartite.projections} keeps vertex attributes.
-}
-\value{
-  A list of two undirected graphs. See details above.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-## Projection of a full bipartite graph is a full graph
-g <- graph.full.bipartite(10,5)
-proj <- bipartite.projection(g)
-graph.isomorphic(proj[[1]], graph.full(10))
-graph.isomorphic(proj[[2]], graph.full(5))
-
-## The projection keeps the vertex attributes
-M <- matrix(0, nr=5, nc=3)
-rownames(M) <- c("Alice", "Bob", "Cecil", "Dan", "Ethel")
-colnames(M) <- c("Party", "Skiing", "Badminton")
-M[] <- sample(0:1, length(M), replace=TRUE)
-M
-g2 <- graph.incidence(M)
-g2$name <- "Event network"
-proj2 <- bipartite.projection(g2)
-print(proj2[[1]], g=TRUE, e=TRUE)
-print(proj2[[2]], g=TRUE, e=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/bonpow.Rd igraph-0.6.5/interfaces/R/igraph/man/bonpow.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/bonpow.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/bonpow.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,116 +0,0 @@
-\name{bonpow}
-\alias{bonpow}
-\concept{Bonacich Power centrality}
-%- Also NEED an `\alias' for EACH other topic documented here.
-\title{ Find Bonacich Power Centrality Scores of Network Positions }
-\description{
-  \code{bonpow} takes a graph (\code{dat}) and returns the
-  Boncich power centralities of positions (selected by \code{nodes}).
-  The decay rate for power contributions is specified by \code{exponent}
-  (1 by default).
-}
-\usage{
-bonpow(graph, nodes=V(graph), loops=FALSE, exponent=1,
-    rescale=FALSE, tol=1e-7, sparse=TRUE)
-}
-%- maybe also `usage' for other objects documented here.
-\arguments{
-  \item{graph}{ the input graph. }
-  \item{nodes}{ vertex sequence indicating which vertices are to be
-    included in the calculation.  By default, all vertices are included. } 
-  \item{loops}{ boolean indicating whether or not the diagonal should be
-    treated as valid data.  Set this true if and only if the data can
-    contain loops.  \code{loops} is \code{FALSE} by default. } 
-  \item{exponent}{ exponent (decay rate) for the Bonacich power
-    centrality score; can be negative } 
-  \item{rescale}{ if true, centrality scores are rescaled such that they
-    sum to 1. } 
-  \item{tol}{ tolerance for near-singularities during matrix inversion
-    (see \code{\link{solve}}) }
-  \item{sparse}{Logical scalar, whether to use sparse matrices for the
-    calculation. The \sQuote{Matrix} package is required for sparse
-    matrix support}
-}
-\details{
-Bonacich's power centrality measure is defined by
-\eqn{C_{BP}\left(\alpha,\beta\right)=\alpha\left(\mathbf{I}-\beta\mathbf{A}\right)^{-1}\mathbf{A}\mathbf{1}}{C_BP(alpha,beta)=alpha
-  (I-beta A)^-1 A 1}, where \eqn{\beta}{beta} is an attenuation parameter
-(set here by \code{exponent}) and \eqn{\mathbf{A}}{A} is the graph
-adjacency matrix.  (The coefficient \eqn{\alpha}{alpha} acts as a
-scaling parameter, and is set here (following Bonacich (1987)) such that
-the sum of squared scores is equal to the number of vertices.  This
-allows 1 to be used as a reference value for the ``middle'' of the
-centrality range.)  When \eqn{\beta \rightarrow
-  1/\lambda_{\mathbf{A}1}}{beta->1/lambda_A1} (the reciprocal of the
-largest eigenvalue of \eqn{\mathbf{A}}{A}), this is to within a constant
-multiple of the familiar eigenvector centrality score; for other values
-of \eqn{\beta}, the behavior of the measure is quite different.  In
-particular, \eqn{\beta} gives positive and negative weight to even and
-odd walks, respectively, as can be seen from the series expansion
-\eqn{C_{BP}\left(\alpha,\beta\right)=\alpha \sum_{k=0}^\infty \beta^k
-  \mathbf{A}^{k+1} \mathbf{1}}{C_BP(alpha,beta) = alpha sum( beta^k
-  A^(k+1) 1, k in 0..infinity )} which converges so long as \eqn{|\beta|
-  < 1/\lambda_{\mathbf{A}1}}{|beta|<1/lambda_A1}.  The magnitude of
-\eqn{\beta}{beta} controls the influence of distant actors on ego's
-centrality score, with larger magnitudes indicating slower rates of
-decay.  (High rates, hence, imply a greater sensitivity to edge
-effects.) 
-
-Interpretively, the Bonacich power measure corresponds to the notion
-that the power of a vertex is recursively defined by the sum of the
-power of its alters.  The nature of the recursion involved is then
-controlled by the power exponent: positive values imply that vertices
-become more powerful as their alters become more powerful (as occurs in
-cooperative relations), while negative values imply that vertices become
-more powerful only as their alters become \emph{weaker} (as occurs in
-competitive or antagonistic relations).  The magnitude of the exponent
-indicates the tendency of the effect to decay across long walks; higher
-magnitudes imply slower decay.  One interesting feature of this measure
-is its relative instability to changes in exponent magnitude
-(particularly in the negative case).  If your theory motivates use of
-this measure, you should be very careful to choose a decay parameter on
-a non-ad hoc basis.
-}
-\value{
-  A vector, containing the centrality scores.
-}
-\references{ Bonacich, P.  (1972).  ``Factoring and Weighting Approaches
-  to Status Scores and Clique Identification.''  \emph{Journal of
-    Mathematical Sociology}, 2, 113-120. 
-
-  Bonacich, P.  (1987).  ``Power and Centrality: A Family of Measures.''
-  \emph{American Journal of Sociology}, 92, 1170-1182. 
- }
-\author{ Carter T. Butts \email{buttsc@uci.edu}, ported to igraph by
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-\section{Warning }{Singular adjacency matrices cause no end of headaches
-  for this algorithm; thus, the routine may fail in certain cases.  This
-  will be fixed when I get a better algorithm.  \code{bonpow} will not
-  symmetrize your data before extracting eigenvectors; don't send this
-  routine asymmetric matrices unless you really mean to do so.} 
-\seealso{ \code{\link{evcent}} and \code{\link{alpha.centrality}} }
-\note{ This function was ported (ie. copied) from the SNA package. }
-\examples{
-# Generate some test data from Bonacich, 1987:
-g.c <- graph( c(1,2,1,3,2,4,3,5), dir=FALSE)
-g.d <- graph( c(1,2,1,3,1,4,2,5,3,6,4,7), dir=FALSE)
-g.e <- graph( c(1,2,1,3,1,4,2,5,2,6,3,7,3,8,4,9,4,10), dir=FALSE)
-g.f <- graph( c(1,2,1,3,1,4,2,5,2,6,2,7,3,8,3,9,3,10,4,11,4,12,4,13), dir=FALSE)
-# Compute Bonpow scores
-for (e in seq(-0.5,.5, by=0.1)) {
-  print(round(bonpow(g.c, exp=e)[c(1,2,4)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.d, exp=e)[c(1,2,5)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.e, exp=e)[c(1,2,5)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.f, exp=e)[c(1,2,5)], 2))
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/canonical.permutation.Rd igraph-0.6.5/interfaces/R/igraph/man/canonical.permutation.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/canonical.permutation.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/canonical.permutation.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-\name{canonical.permutation}
-\alias{canonical.permutation}
-\concept{Canonical permutation}
-\concept{BLISS}
-\title{Canonical permutation of a graph}
-\description{The canonical permutation brings every isomorphic graphs
-  into the same (labeled) graph.}
-\usage{
-canonical.permutation(graph, sh="fm")
-}
-\arguments{
-  \item{graph}{The input graph, treated as undirected.}
-  \item{sh}{Type of the heuristics to use for the BLISS
-    algorithm. See details for possible values.}
-}
-\details{
-  \code{canonical.permutation} computes a permutation which brings the
-  graph into canonical form, as defined by the BLISS algorithm.
-  All isomorphic graphs have the same canonical form.
-
-  See the paper below for the details about BLISS. This and more
-  information is available at
-  \url{http://www.tcs.hut.fi/Software/bliss/index.html}.
-
-  The possible values for the \code{sh} argument are:
-  \describe{
-    \item{\code{f}}{First non-singleton cell.}
-    \item{\code{fl}}{First largest non-singleton cell.}
-    \item{\code{fs}}{First smallest non-singleton cell.}
-    \item{\code{fm}}{First maximally non-trivially connectec
-      non-singleton cell.}
-    \item{\code{flm}}{Largest maximally non-trivially connected
-      non-singleton cell.}
-    \item{\code{fsm}}{Smallest maximally non-trivially connected
-      non-singleton cell.}
-  }
-  See the paper in references for details about these.
-}
-\value{
-  A list with the following members:
-  \item{labeling}{The canonical parmutation which takes the input
-    graph into canonical form. A numeric vector, the first element is
-    the new label of vertex 0, the second element for vertex 1, etc. }
-  \item{info}{Some information about the BLISS computation. A named
-    list with the following members:
-    \describe{
-      \item{\code{nof_nodes}}{The number of nodes in the search tree.}
-      \item{\code{nof_leaf_nodes}}{The number of leaf nodes in the search
-	tree.}
-      \item{\code{nof_bad_nodes}}{Number of bad nodes.}
-      \item{\code{nof_canupdates}}{Number of canrep updates.}
-      \item{\code{max_level}}{Maximum level.}
-      \item{\code{group_size}}{The size of the automorphism group of the
-	input graph, as a string. This number is exact if igraph was
-	compiled with the GMP library, and approximate otherwise.}
-    }
-  }
-}
-\references{
-  Tommi Junttila and Petteri Kaski: Engineering an Efficient Canonical
-  Labeling Tool for Large and Sparse Graphs, \emph{Proceedings of the
-    Ninth Workshop on Algorithm Engineering and Experiments and the
-    Fourth Workshop on Analytic Algorithms and Combinatorics.} 2007.
-}
-\author{Tommi Junttila for BLISS, Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the igraph and R interfaces.}
-\seealso{\code{\link{permute.vertices}} to apply a permutation to a
-  graph, \code{\link{graph.isomorphic}} for deciding graph isomorphism,
-  possibly based on canonical labels.}
-\examples{
-## Calculate the canonical form of a random graph
-g1 <- erdos.renyi.game(10, 20, type="gnm")
-cp1 <- canonical.permutation(g1)
-cf1 <- permute.vertices(g1, cp1$labeling)
-
-## Do the same with a random permutation of it
-g2 <- permute.vertices(g1, sample(vcount(g1)))
-cp2 <- canonical.permutation(g2)
-cf2 <- permute.vertices(g2, cp2$labeling)
-
-## Check that they are the same
-el1 <- get.edgelist(cf1)
-el2 <- get.edgelist(cf2)
-el1 <- el1[ order(el1[,1], el1[,2]), ]
-el2 <- el2[ order(el2[,1], el2[,2]), ]
-all(el1 == el2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/centralization.Rd igraph-0.6.5/interfaces/R/igraph/man/centralization.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/centralization.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/centralization.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,156 +0,0 @@
-\name{centralization}
-\alias{centralization}
-\alias{centralize.scores}
-\alias{centralization.degree}
-\alias{centralization.closeness}
-\alias{centralization.betweenness}
-\alias{centralization.evcent}
-\alias{centralization.degree.tmax}
-\alias{centralization.closeness.tmax}
-\alias{centralization.betweenness.tmax}
-\alias{centralization.evcent.tmax}
-\title{Centralization of a graph.tmax}
-\description{
-  Centralization is a method for creating a graph level centralization
-  measure from the centrality scores of the vertices.
-}
-\usage{
-centralize.scores (scores, theoretical.max, normalized = TRUE)
-
-centralization.degree (graph, mode = c("all", "out", "in", "total"),
-    loops = TRUE, normalized = TRUE) 
-centralization.closeness (graph, mode = c("out", "in", "all", "total"),
-    normalized = TRUE)
-centralization.betweenness (graph, directed = TRUE, nobigint = TRUE,
-    normalized = TRUE)
-centralization.evcent (graph, directed = FALSE, scale = TRUE,
-    options = igraph.arpack.default, normalized = TRUE)
-
-centralization.degree.tmax (graph = NULL, nodes = 0,
-    mode = c("all", "out", "in", "total"), loops = FALSE)
-centralization.closeness.tmax (graph = NULL, nodes = 0,
-    directed = TRUE)
-centralization.betweenness.tmax (graph = NULL, nodes = 0,
-    directed = TRUE)
-centralization.evcent.tmax (graph = NULL, nodes = 0,
-    directed = FALSE, scale = TRUE)
-}
-\arguments{
-  \item{scores}{The vertex level centrality scores.}
-  \item{theoretical.max}{Real scalar. The graph level centrality score
-    of the most centralized graph with the same number of vertices as
-    the graph under study. This is only used if the \code{normalized}
-    argument is set to \code{TRUE}.}
-  \item{normalized}{Logical scalar. Whether to normalize the graph level
-    centrality score by dividing the supplied theoretical maximum.}
-  \item{graph}{The input graph. For the \dQuote{tmax} functions it can
-    be \code{NULL}, see the details below.}
-  \item{mode}{This is the same as the \code{mode} argument of
-    \code{degree} and \code{closeness}.}
-  \item{loops}{Logical scalar, whether to consider loops edges when
-    calculating the degree.}
-  \item{directed}{logical scalar, whether to use directed shortest paths
-    for calculating betweenness.}
-  \item{nobigint}{Logical scalar, whether to use big integers for the
-    betweenness calculation. This argument is passed to the
-    \code{\link{betweenness}} function.}
-  \item{scale}{Whether to rescale the eigenvector centrality scores,
-    such that the maximum score is one.}
-  \item{nodes}{The number of vertices. This is ignored if the graph is
-    given.}
-  \item{options}{This is passed to \code{\link{evcent}}, the options for
-    the ARPACK eigensolver.}
-}
-\details{
-  Centralization is a general method for calculating a graph-level
-  centrality score based on node-level centrality measure. The
-  formula for this is
-
-  \deqn{C(G)=\sum_v (\max_w c_w - c_v),}{
-    C(G)=sum( max(c(w), w) - c(v),v),}
-  
-  where \eqn{c_v}{c(v)} is the centrality of vertex \eqn{v}.
-
-  The graph-level centrality score can be normalized by dividing by the
-  maximum theoretical score for a graph with the same number of
-  vertices, using the same parameters, e.g. directedness, whether we
-  consider loop edges, etc.
-
-  For degree, closeness and betweenness the most centralized structure
-  is some version of the star graph, in-star, out-star or undirected
-  star.
-
-  For eigenvector centrality the most centralized structure is the graph
-  with a single edge (and potentially many isolates).
-
-  \code{centralize.scores} using the general centralization formula to
-  calculate a graph-level score from vertex-level scores.
-
-  \code{centralization.degree}, \code{centralization.closeness},
-  \code{centralization.betweenness} calculate both the vertex-level and
-  the graph-level indices.
-
-  \code{centralization.degree.tmax},
-  \code{centralization.closeness.tmax},
-  \code{centralization.betweenness.tmax} and
-  \code{centralization.evcent.tmax} return the theoretical maximum
-  scores. They operate in two modes. In the first mode, a graph is given
-  and the maximum score is calculated based on that. E.g. the number of
-  vertices and directedness is taken from this graph.
-
-  The other way to call these functions is to omit the
-  \code{graph} argument, but explicitly specify the rest of the
-  arguments.
-}
-\value{
-  For \code{centralize.scores} a real scalar.
-
-  For \code{centralization.degree}, \code{centralization.closeness} and
-  \code{centralization.betweenness} a named list with the following
-  components:
-  \item{res}{The node-level centrality scores.}
-  \item{centralization}{The graph level centrality index.}
-  \item{theoretical_max}{The maximum theoretical graph level
-    centralization score for a graph with the given number of vertices,
-    using the same parameters. If the \code{normalized} argument was
-    \code{TRUE}, then the result was divided by this number.}
-
-  For \code{centralization.evcent} a named list with the following
-  components:
-  \item{vector}{The node-level centrality scores.}
-  \item{value}{The corresponding eigenvalue.}
-  \item{options}{ARPACK options, see the return value of
-  \code{\link{evcent}} for details.} 
-  \item{centralization}{The graph level centrality index.}
-  \item{theoretical_max}{The same as above, the theoretical maximum
-    centralization score for a graph with the same number of vertices.}
-
-  For \code{centralization.degree.tmax},
-  \code{centralization.closeness.tmax},
-  \code{centralization.betweenness.tmax} and
-  \code{centralization.evcent.tmax} a real scalar.
-}
-\references{
-  Freeman, L.C.  (1979).  Centrality in Social Networks I:
-  Conceptual Clarification. \emph{Social Networks} 1, 215--239.
-
-  Wasserman, S., and Faust, K.  (1994).  \emph{Social Network Analysis:
-  Methods and Applications.}  Cambridge University Press.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-\examples{
-# A BA graph is quite centralized
-g <- ba.game(1000, m=4)
-centralization.degree(g)$centralization
-centralization.closeness(g, mode="all")$centralization
-centralization.evcent(g, directed=FALSE)$centralization
-
-# The most centralized graph according to eigenvector centrality
-g0 <- graph( c(2,1), n=10, dir=FALSE )
-g1 <- graph.star(10, mode="undirected")
-centralization.evcent(g0)$centralization
-centralization.evcent(g1)$centralization
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/cliques.Rd igraph-0.6.5/interfaces/R/igraph/man/cliques.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/cliques.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/cliques.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,68 +0,0 @@
-\name{cliques}
-\alias{cliques}
-\alias{largest.cliques}
-\alias{maximal.cliques}
-\alias{clique.number}
-\concept{Clique}
-\concept{Maximal clique}
-\concept{Largest clique}
-\title{The functions find cliques, ie. complete subgraphs in a graph}
-\description{These functions find all, the largest or all the maximal
-  cliques in an undirected graph. The size of the largest clique can
-  also be calculated.}
-\usage{
-cliques(graph, min=NULL, max=NULL)
-largest.cliques(graph)
-maximal.cliques(graph, min=NULL, max=NULL)
-clique.number(graph)
-}
-\arguments{
-  \item{graph}{The input graph, directed graphs will be considered as
-    undirected ones, multiple edges and loops are ignored.}
-  \item{min}{Numeric constant, lower limit on the size of the cliques to
-    find. \code{NULL} means no limit, ie. it is the same as 0.}
-  \item{max}{Numeric constant, upper limit on the size of the cliques to
-    find. \code{NULL} means no limit.}
-}
-\details{
-  \code{cliques} find all complete subgraphs in the input graph, obeying
-  the size limitations given in the \code{min} and \code{max} arguments.
-
-  \code{largest.cliques} finds all largest cliques in the input graph. A
-  clique is largest if there is no other clique including more vertices.
-
-  \code{maximal.cliques} finds all maximal cliques in the input graph.
-  A clique in maximal if it cannot be extended to a larger clique. The
-  largest cliques are always maximal, but a maximal clique is not
-  neccessarily the largest.
-
-  \code{clique.number} calculates the size of the largest clique(s).
-
-  The current implementation of these functions searches
-  for maximal independent vertex sets (see
-  \code{\link{independent.vertex.sets}}) in the complementer graph.
-}
-\value{
-  \code{cliques}, \code{largest.cliques} and \code{clique.number} return
-  a list containing numeric vectors of vertex ids. Each list element is
-  a clique.
-
-  \code{clique.number} returns an integer constant.
-}
-%\references{TODO}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R interface and the manual page. }
-\seealso{\code{\link{independent.vertex.sets}}}
-\examples{
-# this usually contains cliques of size six
-g <- erdos.renyi.game(100, 0.3)
-clique.number(g)
-cliques(g, min=6)
-largest.cliques(g)
-
-# To have a bit less maximal cliques, about 100-200 usually
-g <- erdos.renyi.game(100, 0.03)
-maximal.cliques(g)
-
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/closeness.Rd igraph-0.6.5/interfaces/R/igraph/man/closeness.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/closeness.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/closeness.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-\name{closeness}
-\alias{closeness}
-\alias{closeness.estimate}
-\concept{Closeness centrality}
-\title{Closeness centrality of vertices}
-\description{Cloness centrality measures how many steps is required
-  to access every other vertex from a given vertex.}
-\usage{
-closeness(graph, vids=V(graph), mode = c("out", "in", "all", "total"),
-        weights = NULL, normalized = FALSE)
-closeness.estimate(graph, vids=V(graph), mode = c("out", "in", "all",
-       "total"), cutoff, weights = NULL) 
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{vids}{The vertices for which closeness will be calculated.}
-  \item{mode}{Character string, defined the types of the paths used for
-    measuring the distance in directed graphs. \dQuote{in} measures the
-    paths \emph{to} a vertex, \dQuote{out} measures paths \emph{from} a
-    vertex, \emph{all} uses undirected paths. This argument is ignored
-    for undirected graphs.}
-  \item{normalized}{Logical scalar, whether to calculate the normalized
-    closeness. Normalization is performed by multiplying the raw
-    closeness by \eqn{n-1}, where \eqn{n} is the number of vertices in
-    the graph.}
-  \item{cutoff}{The maximum path length to consider when calculating the
-    betweenness. If zero or negative then there is no such limit.}
-  \item{weights}{Optional positive weight vector for calculating
-    weighted closeness. If the graph has a \code{weight} edge
-    attribute, then this is used by default.}
-}
-\details{The closeness centrality of a vertex is defined by the inverse
-  of the average length of the shortest paths to/from all the other
-  vertices in the graph:
-
-  \deqn{\frac{1}{\sum_{i\ne v} d_vi}}{1/sum( d(v,i), i != v)}
-
-  If there is no (directed) path between vertex \eqn{v}{\code{v}} and
-  \eqn{i}{\code{i}} then the total number of vertices is used in the
-  formula instead of the path length.
-
-  \code{closeness.estimate} only considers paths of length
-  \code{cutoff} or smaller, this can be run for larger graphs, as the
-  running time is not quadratic (if \code{cutoff} is small). If
-  \code{cutoff} is zero or negative then the function calculates the
-  exact closeness scores.  
-}
-\value{Numeric vector with the closeness values of all the vertices in
-  \code{v}.} 
-\references{ Freeman, L.C. (1979). Centrality in Social Networks I:
-  Conceptual Clarification. \emph{Social Networks}, 1, 215-239. }
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{betweenness}}, \code{\link{degree}}}
-\examples{
-g <- graph.ring(10)
-g2 <- graph.star(10)
-closeness(g)
-closeness(g2, mode="in")
-closeness(g2, mode="out")
-closeness(g2, mode="all")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/clusters.Rd igraph-0.6.5/interfaces/R/igraph/man/clusters.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/clusters.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/clusters.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,73 +0,0 @@
-\name{clusters}
-\alias{no.clusters}
-\alias{clusters}
-\alias{is.connected}
-\alias{cluster.distribution}
-\concept{Connectedness}
-\concept{Graph component}
-\title{Connected components of a graph}
-\description{Calculate the maximal (weakly or strongly) 
-  connected components of a graph
-}
-\usage{
-is.connected(graph, mode=c("weak", "strong"))
-clusters(graph, mode=c("weak", "strong"))
-no.clusters(graph, mode=c("weak", "strong"))
-cluster.distribution(graph, cumulative = FALSE, mul.size = FALSE, \dots)
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{mode}{Character string, either \dQuote{weak} or \dQuote{strong}.
-    For directed graphs \dQuote{weak} implies weakly, \dQuote{strong}
-    strongly connected components to search. It is ignored for
-    undirected graphs.}
-  \item{cumulative}{Logical, if TRUE the cumulative distirubution
-    (relative frequency) is calculated.}
-  \item{mul.size}{Logical. If TRUE the relative frequencies will be
-    multiplied by the cluster sizes.}
-  \item{\dots}{Additional attributes to pass to \code{cluster}, right
-    now only \code{mode} makes sense.}
-}
-\details{
-  \code{is.connected} decides whether the graph is weakly or strongly
-  connected.
-
-  \code{clusters} finds the maximal (weakly or strongly) connected
-  components of a graph.
-
-  \code{no.clusters} does almost the same as \code{clusters} but returns
-  only the number of clusters found instead of returning the actual
-  clusters.
-
-  \code{cluster.distribution} creates a histogram for the maximal
-  connected component sizes.
-
-  The weakly connected components are found by a simple breadth-first
-  search. The strongly connected components are implemented by two
-  consecutive depth-first searches.
-}
-\value{
-  For \code{is.connected} a logical constant.
-
-  For \code{clusters} a named list with three components:
-  \item{membership}{numeric vector giving the cluster id to which each
-    vertex belongs.}
-  \item{csize}{numeric vector giving the sizes of the clusters.}
-  \item{no}{numeric constant, the number of clusters.}
-
-  For \code{no.clusters} an integer constant is returned.
-  
-  For \code{cluster.distribution} a numeric vector with the relative
-  frequencies. The length of the vector is the size of the largest
-  component plus one. Note that (for currently unknown reasons) the
-  first element of the vector is the number of clusters of size zero, so
-  this is always zero.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{subcomponent}}}
-\examples{
-g <- erdos.renyi.game(20, 1/20)
-clusters(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/cocitation.Rd igraph-0.6.5/interfaces/R/igraph/man/cocitation.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/cocitation.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/cocitation.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-\name{cocitation}
-\alias{cocitation}
-\alias{bibcoupling}
-\concept{Cocication}
-\concept{Bibliographic coupling}
-\title{Cocitation coupling}
-\description{Two vertices are cocited if there is another vertex citing
-  both of them. \code{cocitation} siply counts how many types two vertices
-  are cocited. The bibliographic coupling of two vertices is the number
-  of other vertices they both cite, \code{bibcoupling} calculates this.
-}
-\usage{
-cocitation(graph, v=V(graph))
-bibcoupling(graph, v=V(graph))
-}
-\arguments{
-  \item{graph}{The graph object to analyze}
-  \item{v}{Vertex sequence or numeric vector, the vertex ids for which
-    the cocitation or bibliographic coupling values we want to
-    calculate. The default is all vertices.} 
-}
-\details{
-  \code{cocitation} calculates the cocitation counts for the vertices in the
-  \code{v} argument and all vertices in the graph.
-
-  \code{bibcoupling} calculates the bibliographic coupling for vertices
-  in \code{v} and all vertices in the graph.
-
-  Calculating the cocitation or bibliographic coupling for only one
-  vertex costs the same amount of computation as for all vertices. This
-  might change in the future. 
-}
-\value{
-  A numeric matrix with \code{length(v)} lines and \code{vcount(graph)}
-  columns. Element \code{(i,j)} contains the cocitation or bibliographic
-  coupling for vertices \code{v[i]} and \code{j}.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-cocitation(g)
-bibcoupling(g)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/cohesive.blocks.Rd igraph-0.6.5/interfaces/R/igraph/man/cohesive.blocks.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/cohesive.blocks.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/cohesive.blocks.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,268 +0,0 @@
-\name{cohesive.blocks}
-\alias{cohesive.blocks}
-\alias{cohesiveBlocks}
-\alias{blocks}
-\alias{blockGraphs}
-\alias{cohesion}
-\alias{hierarchy}
-\alias{parent}
-\alias{plotHierarchy}
-\alias{exportPajek}
-\alias{maxcohesion}
-\alias{plot.cohesiveBlocks}
-\alias{summary.cohesiveBlocks}
-\alias{length.cohesiveBlocks}
-\alias{print.cohesiveBlocks}
-\concept{Structurally cohesive blocks}
-\title{Calculate Cohesive Blocks}
-\description{Calculates cohesive blocks for objects of class \code{igraph}.}
-\usage{
-cohesive.blocks(graph, labels = TRUE)
-
-blocks(blocks)
-blockGraphs(blocks, graph)
-cohesion(blocks)
-hierarchy(blocks)
-parent(blocks)
-plotHierarchy(blocks,
-   layout=layout.reingold.tilford(hierarchy(blocks), root=1), \dots)
-exportPajek(blocks, graph, file, project.file = TRUE)
-maxcohesion(blocks)
-
-\method{print}{cohesiveBlocks}(x, \dots)
-\method{summary}{cohesiveBlocks}(object, \dots)
-\method{length}{cohesiveBlocks}(x)
-\method{plot}{cohesiveBlocks}(x, y, colbar = rainbow(max(cohesion(x))+1),
-     col = colbar[maxcohesion(x)+1], mark.groups = blocks(x)[-1], \dots)
-}
-\arguments{
-    \item{graph}{For \code{cohesive.blocks} a graph object of class
-      \code{igraph}. It must be undirected and simple. (See
-      \code{\link{is.simple}}.)
-
-      For \code{blockGraphs} and \code{exportPajek} the same graph must
-      be supplied whose cohesive block structure is given in the
-      \code{blocks} argument.
-    }
-    \item{labels}{Logical scalar, whether to add the vertex labels to
-      the result object. These labels can be then used when reporting 
-      and plotting the cohesive blocks.}
-    \item{blocks,x,object}{A \code{cohesiveBlocks} object, created with
-      the \code{cohesive.blocks} function.}
-    \item{file}{Defines the file (or connection) the Pajek file is
-      written to.
-
-      If the \code{project.file} argument is \code{TRUE},
-      then it can be a filename (with extension), a file object, or in
-      general any king of connection object. The file/connection will be
-      opened if it wasn't already.
-
-      If the \code{project.file} argument is \code{FALSE}, then several
-      files are created and \code{file} must be a character scalar
-      containing the base name of the files, without extension. (But it
-      can contain the path to the files.)
-
-      See also details below.
-    }
-    \item{project.file}{Logical scalar, whether to create a single Pajek
-      project file containing all the data, or to create separated files
-      for each item. See details below.}
-    \item{y}{The graph whose cohesive blocks are supplied in the
-      \code{x} argument.}
-    \item{colbar}{Color bar for the vertex colors. Its length should be
-      at least \eqn{m+1}, where \eqn{m} is the maximum cohesion in the
-      graph. Alternatively, the vertex colors can also be directly
-    specified via the \code{col} argument.}
-    \item{col}{A vector of vertex colors, in any of the usual
-      formats. (Symbolic color names (e.g. \sQuote{red}, \sQuote{blue},
-      etc.) , RGB colors (e.g. \sQuote{#FF9900FF}), integer numbers
-      referring to the current palette. By default the given
-      \code{colbar} is used and vertices with the same maximal cohesion
-      will have the same color.}
-    \item{mark.groups}{A list of vertex sets to mark on the plot by
-      circling them. By default all cohesive blocks are marked, except
-      the one corresponding to the all vertices.}
-    \item{layout}{The layout of a plot, it is simply passed on to
-      \code{plot.igraph}, see the possible formats there. By default the
-      Reingold-Tilford layout generator is used.}
-    \item{\dots}{Additional arguments. \code{plotHierarchy} and
-      \code{plot} pass them to \code{plot.igraph}.
-      \code{print} and \code{summary} ignore them.
-    }
-}
-\details{
-  Cohesive blocking is a method of determining hierarchical subsets of
-  graph vertices based on their structural cohesion (or vertex
-  connectivity). For a given graph \eqn{G}, a subset of its vertices
-  \eqn{S\subset V(G)}{S} is said to be maximally \eqn{k}-cohesive if there is
-  no superset of \eqn{S} with vertex connectivity greater than or equal to
-  \eqn{k}. Cohesive blocking is a process through which, given a
-  \eqn{k}-cohesive set of vertices, maximally \eqn{l}-cohesive subsets are
-  recursively identified with \eqn{l>k}. Thus a hiearchy of vertex subsets
-  is found, whith the entire graph \eqn{G} at its root. 
-  
-  The function \code{cohesive.blocks} implements cohesive blocking.
-  It returns a \code{cohesiveBlocks} object. \code{cohesiveBlocks}
-  should be handled as an opaque class, i.e. its internal structure
-  should not be accessed directly, but through the functions listed
-  here.
-
-  The function \code{length} can be used on \code{cohesiveBlocks}
-  objects and it gives the number of blocks.
-  
-  The function \code{blocks} returns the actual blocks stored in the
-  \code{cohesiveBlocks} object. They are returned in a list of numeric
-  vectors, each containing vertex ids.
-
-  The function \code{blockGraphs} is similar, but returns the blocks as
-  (induced) subgraphs of the input graph. The various (graph, vertex and
-  edge) attributes are kept in the subgraph.
-
-  The function \code{cohesion} returns a numeric vector, the cohesion of
-  the different blocks. The order of the blocks is the same as for
-  the \code{blocks} and \code{blockGraphs} functions.
-
-  The block hierarchy can be queried using the \code{hierarchy}
-  function. It returns an igraph graph, its vertex ids are ordered
-  according the order of the blocks in the \code{blocks} and
-  \code{blockGraphs}, \code{cohesion}, etc. functions.
-
-  \code{parent} gives the parent vertex of each block, in the block
-  hierarchy, for the root vertex it gives 0.
-
-  \code{plotHierarchy} plots the hierarchy tree of the cohesive blocks
-  on the active graphics device, by calling \code{igraph.plot}.
-
-  The \code{exportPajek} function can be used to export the graph and
-  its cohesive blocks in Pajek format. It can either export a single
-  Pajek project file with all the information, or a set of files,
-  depending on its \code{project.file} argument. If \code{project.file}
-  is \code{TRUE}, then the following information is written to the file
-  (or connection) given in the \code{file} argument: (1) the input
-  graph, together with its attributes, see \code{\link{write.graph}} for
-  details; (2) the hierarchy graph; and (3) one binary partition for
-  each cohesive block. If \code{project.file} is \code{FALSE}, then the
-  \code{file} argument must be a character scalar and it is used as the
-  base name for the generated files. If \code{file} is
-  \sQuote{basename}, then the following files are created: (1)
-  \sQuote{basename.net} for the original graph; (2)
-  \sQuote{basename_hierarchy.net} for the hierarchy graph; (3)
-  \sQuote{basename_block_x.net} for each cohesive block, where
-  \sQuote{x} is the number of the block, starting with one.
-
-  \code{maxcohesion} returns the maximal cohesion of each vertex,
-  i.e. the cohesion of the most cohesive block of the vertex.
-
-  The generic function \code{summary} works on \code{cohesiveBlocks}
-  objects and it prints a one line summary to the terminal.
-
-  The generic function \code{print} is also defined on
-  \code{cohesiveBlocks} objects and it is invoked automatically if the
-  name of the \code{cohesiveBlocks} object is typed in. It produces
-  an output like this: \preformatted{
-    Cohesive block structure:
-    B-1         c 1, n 23
-    '- B-2      c 2, n 14   oooooooo.. .o......oo ooo 
-       '- B-4   c 5, n  7   ooooooo... .......... ... 
-    '- B-3      c 2, n 10   ......o.oo o.oooooo.. ... 
-       '- B-5   c 3, n  4   ......o.oo o......... ...     
-  }
-  The left part shows the block structure, in this case for five
-  blocks. The first block always corresponds to the whole graph, even if
-  its cohesion is zero. Then cohesion of the block and the number of
-  vertices in the block are shown. The last part is only printed if the
-  display is wide enough and shows the vertices in the blocks,
-  ordered by vertex ids. \sQuote{o} means that the vertex is included,
-  a dot means that it is not, and the vertices are shown in groups of
-  ten.
-  
-  The generic function \code{plot} plots the graph, showing one or more
-  cohesive blocks in it.  
-}
-\value{
-  \code{cohesive.blocks} returns a \code{cohesiveBlocks}
-  object.
-
-  \code{blocks} returns a list of numeric vectors, containing vertex
-  ids.
-
-  \code{blockGraphs} returns a list of igraph graphs, corresponding to
-  the cohesive blocks.
-
-  \code{cohesion} returns a numeric vector, the cohesion of each block.
-
-  \code{hierarchy} returns an igraph graph, the representation of the
-  cohesive block hierarchy.
-
-  \code{parent} returns a numeric vector giving the parent block of each
-  cohesive block, in the block hierarchy. The block at the root of the
-  hierarchy has no parent and \code{0} is returned for it.
-
-  \code{plotHierarchy}, \code{plot} and \code{exportPajek} return
-  \code{NULL}, invisibly.
-
-  \code{maxcohesion} returns a numeric vector with one entry for each
-  vertex, giving the cohesion of its most cohesive block.
-
-  \code{print} and \code{summary} return the \code{cohesiveBlocks}
-  object itself, invisibly.
-
-  \code{length} returns a numeric scalar, the number of blocks.  
-}
-\references{
-  J. Moody and D. R. White. Structural cohesion and embeddedness: A
-  hierarchical concept of social groups. \emph{American Sociological
-    Review}, 68(1):103--127, Feb 2003. 
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com} for the current
-  implementation, Peter McMahan \email{peter.mcmahan@gmail.com} wrote
-  the first version in R.}
-\seealso{\code{\link{graph.cohesion}}}
-\examples{
-## The graph from the Moody-White paper
-mw <- graph.formula(1-2:3:4:5:6, 2-3:4:5:7, 3-4:6:7, 4-5:6:7,
-                    5-6:7:21, 6-7, 7-8:11:14:19, 8-9:11:14, 9-10,
-                    10-12:13, 11-12:14, 12-16, 13-16, 14-15, 15-16,
-                    17-18:19:20, 18-20:21, 19-20:22:23, 20-21,
-                    21-22:23, 22-23)
-
-mwBlocks <- cohesive.blocks(mw)
-
-# Inspect block membership and cohesion
-mwBlocks
-blocks(mwBlocks)
-cohesion(mwBlocks)
-
-# Save results in a Pajek file
-\dontrun{
-exportPajek(mwBlocks, mw, file="/tmp/mwBlocks.paj")
-}
-
-# Plot the results
-if (interactive()) {
-  plot(mwBlocks, mw)
-}
-
-## The science camp network
-camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-                      Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-                      Holly   - Carol:Pat:Pam:Jennie:Bill,
-                      Bill    - Pauline:Michael:Lee:Holly,
-                      Pauline - Bill:Jennie:Ann,
-                      Jennie  - Holly:Michael:Lee:Ann:Pauline,
-                      Michael - Bill:Jennie:Ann:Lee:John,
-                      Ann     - Michael:Jennie:Pauline,
-                      Lee     - Michael:Bill:Jennie,
-                      Gery    - Pat:Steve:Russ:John,
-                      Russ    - Steve:Bert:Gery:John,
-                      John    - Gery:Russ:Michael)
-campBlocks <- cohesive.blocks(camp)
-campBlocks
-
-if (interactive()) {
-  plot(campBlocks, camp, vertex.label=V(camp)$name, margin=-0.2,
-       vertex.shape="rectangle", vertex.size=24, vertex.size2=8,
-       mark.border=1, colbar=c(NA, NA,"cyan","orange") )
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/communities.Rd igraph-0.6.5/interfaces/R/igraph/man/communities.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/communities.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/communities.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,246 +0,0 @@
-\name{communities}
-\alias{communities}
-\alias{membership}
-\alias{algorithm}
-\alias{crossing}
-\alias{cutat}
-\alias{merges}
-\alias{sizes}
-\alias{is.hierarchical}
-\alias{print.communities}
-\alias{plot.communities}
-\alias{length.communities}
-\alias{modularity.communities}
-\alias{as.dendrogram.communities}
-\alias{as.hclust.communities}
-\alias{asPhylo}
-\alias{asPhylo.communities}
-\alias{showtrace}
-\alias{code.length}
-\concept{Community structure}
-\title{Functions to deal with the result of network community detection}
-\description{igraph community detection functions return their results
-  as an object from the \code{communities} class. This manual page
-  describes the operations of this class.}
-\usage{
-\method{print}{communities}(x, \dots)
-
-\method{length}{communities}(x)
-sizes(communities)
-membership(communities)
-\method{modularity}{communities}(x, \dots)
-algorithm(communities)
-crossing(communities, graph)
-
-is.hierarchical(communities, full = FALSE)
-merges(communities)
-cutat(communities, no, steps)
-\method{as.dendrogram}{communities}(object, hang=-1,
-   use.modularity=FALSE, \dots)
-\method{as.hclust}{communities}(x, hang = -1,
-   use.modularity = FALSE, \dots)
-\method{asPhylo}{communities}(x, use.modularity=FALSE, \dots)
-showtrace(communities)
-
-code.length(communities)
-
-\method{plot}{communities}(x, y,
-   colbar=rainbow(length(x)),
-   col=colbar[membership(x)],
-   mark.groups=communities(x),
-   edge.color=c("black", "red")[crossing(x,y)+1],
-   \dots)
-}
-\arguments{
-  \item{communities,x,object}{A \code{communities} object, the result of
-    an igraph community detection function.}
-  \item{graph}{An igraph graph object, corresponding to
-    \code{communities}.}
-  \item{full}{Logical scalar, if \code{TRUE}, then
-    \code{is.hierarchical} only returns \code{TRUE} for fully
-   hierarchical algorithms. The \sQuote{leading eigenvector} algorithm
-   is hierarchical, it gives a hierarchy of groups, but not a full
-   dendrogram with all vertices, so it is not fully hierarchical.}
-  \item{y}{An igraph graph object, corresponding to the communities in
-    \code{x}.}
-  \item{no}{Integer scalar, the desired number of communities. If too
-    low or two high, then an error message is given. Exactly one of
-    \code{no} and \code{steps} must be supplied.}
-  \item{steps}{The number of merge operations to perform to produce the
-    communities. Exactly one of \code{no} and \code{steps} must be
-    supplied.}
-  \item{colbar}{A vector of colors, in any format that is accepted by
-    the regular R plotting methods. E.g. it may be an integer vector, a
-    character vector of color names, a character vector of RGB
-    colors. This vector gives the color bar for the vertices. The length
-    of the vector should be the same as the number of communities.}
-  \item{col}{A vector of colors, in any format that is accepted by the
-    regular R plotting methods. This vector gives the colors of the
-    vertices explicitly.}
-  \item{mark.groups}{A list of numeric vectors. The communities can be
-    highlighted using colored polygons. The groups for which the
-    polygons are drawn are given here. The default is to use the groups
-    given by the communities. Supply \code{NULL} here if you do not want
-    to highlight any groups.}
-  \item{edge.color}{The colors of the edges. By default the edges within
-    communities are colored green and other edges are red.}
-  \item{hang}{Numeric scalar indicating how the height of leaves should
-    be computed from the heights of their parents; see
-   \code{\link{plot.hclust}}.}
- \item{use.modularity}{Logical scalar, whether to use the modularity
-   values to define the height of the branches.}
- \item{\dots}{Additional arguments. \code{plot.communities} passes
-   these to \code{\link{plot.igraph}}. The other functions silently
-   ignore them.}
-}
-\details{
-  Community structure detection algorithms try to find dense subgraphs
-  in directed or undirected graphs, by optimizing some criteria, and
-  usually using heuristics.
-
-  igraph implements a number of commmunity detection methods (see them
-  below), all of which return an object of the class
-  \code{communities}. Because the community structure detection
-  algorithms are different, \code{communities} objects do not always
-  have the same structure. Nevertheless, they have some common
-  operations, these are documented here.
-
-  The \code{print} generic function is defined for \code{communities},
-  it prints a short summary.
-
-  The \code{length} generic function call be called on
-  \code{communities} and returns the number of communities.
-
-  The \code{sizes} function returns the community sizes, in the order of
-  their ids.
-  
-  \code{membership} gives the division of the vertices, into
-  communities. It returns a numeric vector, one value for each vertex,
-  the id of its community. Community ids start from one. Note that some
-  algorithms calculate the complete (or incomplete) hierarchical
-  structure of the communities, and not just a single
-  partitioning. For these algorithms typically the membership for the
-  highest modularity value is returned, but see also the manual pages of
-  the individual algorithms.
-  
-  \code{modularity} gives the modularity score of the partitioning. (See
-  \code{\link{modularity.igraph}} for details. For algorithms that do
-  not result a single partitioning, the highest modularity value is
-  returned.
-
-  \code{algorithm} gives the name of the algorithm that was used to
-  calculate the community structure.
-
-  \code{crossing} returns a logical vector, with one value for each
-  edge, ordered according to the edge ids. The value is \code{TRUE} iff
-  the edge connects two different communities, according to the (best)
-  membership vector, as returned by \code{membership()}.
-
-  \code{is.hierarchical} checks whether a hierarchical algorithm was
-  used to find the community structure. Some functions only make sense
-  for hierarchical methods (e.g. \code{merges}, \code{cutat} and
-  \code{as.dendrogram}).
-  
-  \code{merges} returns the merge matrix for hierarchical methods. An
-  error message is given, if a non-hierarchical method was used to find
-  the community structure. You can check this by calling
-  \code{is.hierarchical} on the \code{communities} object.
-
-  \code{cutat} cuts the merge tree of a hierarchical community finding
-  method, at the desired place and returns a membership vector. The
-  desired place can be expressed as the desired number of communities or
-  as the number of merge steps to make. The function gives an error
-  message, if called with a non-hierarchical method.
-
-  \code{as.dendrogram} converts a hierarchical community structure to a
-  \code{dendrogram} object. It only works for hierarchical methods, and
-  gives an error message to others. See \code{\link[stats]{dendrogram}}
-  for details.
-
-  \code{as.hclust} is similar to \code{as.dendrogram}, but converts a
-  hierarchical community structure to a \code{hclust} object.
-
-  \code{asPhylo} converts a hierarchical community structure to
-  a \code{phylo} object, you will need the \code{ape} package for this.
-  
-  \code{showtrace} works (currently) only for communities found by the
-  leading eigenvector method
-  (\code{\link{leading.eigenvector.community}}), and returns a character
-  vector that gives the steps performed by the algorithm while finding
-  the communities.
-
-  \code{code.length} is defined for the InfoMAP method
-  (\code{\link{infomap.community}} and returns the code length of the
-  partition.
-  
-  It is possibly to call the \code{plot} function on \code{communities}
-  objects. This will plot the graph (and uses \code{\link{plot.igraph}}
-  internally), with the communities shown. By default it colores the
-  vertices according to their communities, and also marks the vertex
-  groups corresponding to the communities. It passes additional
-  arguments to \code{\link{plot.igraph}}, please see that and also
-  \code{\link{igraph.plotting}} on how to change the plot.
-}
-\value{
-  \code{print} returns the \code{communities} object itself, invisibly.
-
-  \code{length} returns an integer scalar.
-
-  \code{sizes} returns a numeric vector.
-  
-  \code{membership} returns a numeric vector, one number for each vertex
-  in the graph that was the input of the community detection.
-  
-  \code{modularity} returns a numeric scalar.
-
-  \code{algorithm} returns a character scalar.
-
-  \code{crossing} returns a logical vector.
-
-  \code{is.hierarchical} returns a logical scalar.
-
-  \code{merges} returns a two-column numeric matrix.
-
-  \code{cutat} returns a numeric vector, the membership vector of the
-  vertices.
-
-  \code{as.dendrogram} returns a \code{\link[stats]{dendrogram}}
-  object.
-
-  \code{showtrace} returns a character vector.
-
-  \code{code.length} returns a numeric scalar for communities found with
-  the InfoMAP method and \code{NULL} for other methods.
-  
-  \code{plot} for \code{communities} objects returns \code{NULL},
-  invisibly.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  See \code{\link{dendPlot}} for plotting community structure
-  dendrograms.
-  
-  See \code{\link{compare.communities}} for comparing two community
-  structures on the same graph.
-  
-  The different methods for finding communities, they all return a
-  \code{communities} object:
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link{label.propagation.community}},
-  \code{\link{leading.eigenvector.community}},
-  \code{\link{multilevel.community}},
-  \code{\link{optimal.community}},
-  \code{\link{spinglass.community}},
-  \code{\link{walktrap.community}}.
-}
-\examples{
-karate <- graph.famous("Zachary")
-wc <- walktrap.community(karate)
-modularity(wc)
-membership(wc)
-plot(wc, karate)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/community.edge.betweenness.Rd igraph-0.6.5/interfaces/R/igraph/man/community.edge.betweenness.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/community.edge.betweenness.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/community.edge.betweenness.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,96 +0,0 @@
-\name{edge.betweenness.community}
-\alias{edge.betweenness.community}
-\alias{edge.betweenness.community.merges}
-\concept{Edge betweenness}
-\concept{Community structure}
-\title{Community structure detection based on edge betweenness}
-\description{Many networks consist of modules which are densely
-  connected themselves but sparsely connected to other modules.}
-\usage{
-edge.betweenness.community (graph, weights = E(graph)$weight,
-    directed = TRUE, edge.betweenness = TRUE, merges = TRUE,
-    bridges = TRUE, modularity = TRUE, membership = TRUE)
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{weights}{The edge weights. Supply \code{NULL} to omit edge
-    weights. By default the \sQuote{\code{weight}} edge attribute is
-    used, if it is present.}
-  \item{directed}{Logical constant, whether to calculate directed edge
-    betweenness for directed graphs. It is ignored for undirected
-    graphs.}
-  \item{edge.betweenness}{Logical constant, whether to return the edge
-    betweenness of the edges at the time of their removal.}
-  \item{merges}{Logical constant, whether to return the merge matrix
-    representing the hierarchical community structure of the network.
-    This argument is called \code{merges}, even if the community
-    structure algorithm itself is divisive and not agglomerative: it
-    builds the tree from top to bottom. There is one line for each merge
-    (i.e. split) in matrix, the first line is the first merge (last
-    split). The communities are identified by integer number starting from
-    one. Community ids smaller than or equal to \eqn{N}, the
-    number of vertices in the graph, belong to singleton communities,
-    ie. individual vertices. Before the first merge we have
-    \eqn{N} communities numbered from one to \eqn{N}. The
-    first merge, the first line of the matrix creates community
-    \eqn{N+1}, the second merge creates community \eqn{N+2},
-    etc.
-  }
-  \item{bridges}{Logical constant, whether to return a list the edge
-    removals which actually splitted a component of the graph.}
-  \item{modularity}{Logical constant, whether to calculate the
-    maximum modularity score, considering all possibly community
-    structures along the edge-betweenness based edge removals.}
-  \item{membership}{Logical constant, whether to calculate the
-    membership vector corresponding to the highest possible modularity
-    score.}
-}
-\details{
-  The edge betweenness score of an edge measures the number of shortest
-  paths through it, see \code{\link{edge.betweenness}} for details. The
-  idea of the edge betweenness based community structure detection is
-  that it is likely that edges connecting separate modules have high
-  edge betweenness as all the shortest paths from one module to another
-  must traverse through them. So if we gradually remove the edge with
-  the highest edge betweenness score we will get a hierarchical map, a
-  rooted tree, called a dendrogram of the graph. The leafs of the tree
-  are the individual vertices and the root of the tree represents the
-  whole graph. 
-
-  \code{edge.betweenness.community} performs this algorithm by
-  calculating the edge betweenness of the graph, removing the edge with
-  the highest edge betweenness score, then recalculating edge
-  betweenness of the edges and again removing the one with the highest
-  score, etc.
-
-  \code{edge.betweeness.community} returns various information collected
-  throught the run of the algorithm. See the return value down here.
-}
-\value{
-  \code{edge.betweenness.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{edge.betweenness}} for the definition and
-  calculation of the edge betweenness,
-  \code{\link{walktrap.community}}, \code{\link{fastgreedy.community}},
-  \code{\link{leading.eigenvector.community}} for other community
-  detection methods.
-
-  See \code{\link{communities}} for extracting the results of the
-  community detection.
-}
-\references{M Newman and M Girvan: Finding and evaluating community
-  structure in networks, \emph{Physical Review E} 69, 026113 (2004)
-}
-\examples{
-g <- barabasi.game(100,m=2)
-eb <- edge.betweenness.community(g)
-
-g <- graph.full(10) \%du\% graph.full(10)
-g <- add.edges(g, c(1,11))
-eb <- edge.betweenness.community(g)
-eb
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/community.structure.Rd igraph-0.6.5/interfaces/R/igraph/man/community.structure.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/community.structure.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/community.structure.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-\name{community.to.membership}
-\alias{community.to.membership}
-\concept{Community structure}
-\title{Common functions supporting community detection algorithms}
-\description{
-  \code{community.to.membership} takes a merge matrix, a typical result
-  of community structure detection algorithms and creates a membership
-  vector by performing a given number of merges in the merge matrix.
-}
-\usage{
-community.to.membership(graph, merges, steps, membership=TRUE, csize=TRUE)
-}
-\arguments{
-  \item{graph}{The graph to which the merge matrix belongs.}
-  \item{merges}{The merge matrix, see
-    e.g. \code{\link{walktrap.community}} for the exact format.}
-  \item{steps}{The number of steps, ie. merges to be performed.}
-  \item{membership}{Logical scalar, whether to include the membership
-    vector in the result.}
-  \item{csize}{Logical scalar, whether to include the sizes of the
-    communities in the result.}
-}
-%\details{}
-\value{
-  A named list with two members:
-  \item{membership}{The membership vector.}
-  \item{csize}{A numeric vector giving the sizes of the communities.}
-}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{walktrap.community}},
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link{spinglass.community}} for various community detection
-  methods.
-}
-\examples{
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-wtc <- walktrap.community(g)
-community.to.membership(g, wtc$merges, steps=12)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/compare.communities.Rd igraph-0.6.5/interfaces/R/igraph/man/compare.communities.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/compare.communities.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/compare.communities.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,75 +0,0 @@
-\name{compare.communities}
-\alias{compare.communities}
-\alias{compare.numeric}
-\alias{compare}
-\concept{Community structure}
-\title{Compares community structures using various metrics}
-\description{
-  This function assesses the distance between two community structures.
-}
-\usage{
-\method{compare}{communities}(comm1, comm2, method = c("vi", "nmi",
-                                      "split.join", "rand",
-                                      "adjusted.rand"))
-\method{compare}{numeric}(comm1, comm2, method = c("vi", "nmi",
-                                      "split.join", "rand",
-                                      "adjusted.rand"))
-}
-\arguments{
-  \item{comm1}{A \code{\link{communities}} object containing a community
-    structure; or a numeric vector, the membership vector of the first
-    community structure. The membership vector should contain the
-    community id of each vertex, the numbering of the communities starts
-    with one.}
-  \item{comm2}{A \code{\link{communities}} object containing a community
-    structure; or a numeric vector, the membership vector of the second
-    community structure, in the same format as for the previous
-    argument.} 
-  \item{method}{Character scalar, the comparison method to use. Possible
-    values: \sQuote{vi} is the variation of information (VI) metric of
-    Meila (2003), \sQuote{nmi} is the normalized mutual information
-    measure proposed by Danon et al. (2005), \sQuote{split.join} is the
-    split-join distance of can Dongen (2000), \sQuote{rand} is the Rand
-    index of Rand (1971), \sQuote{adjusted.rand} is the adjusted Rand
-    index by Hubert and Arabie (1985).}
-}
-% \details{}
-\value{A real number.}
-\references{
-  Meila M: Comparing clusterings by the variation of information.
-  In: Scholkopf B, Warmuth MK (eds.). \emph{Learning Theory and Kernel
-    Machines: 16th Annual Conference on Computational Learning Theory
-    and 7th Kernel Workshop}, COLT/Kernel 2003, Washington, DC,
-  USA. Lecture Notes in Computer Science, vol. 2777, Springer,
-  2003. ISBN: 978-3-540-40720-1.
-
-  Danon L, Diaz-Guilera A, Duch J, Arenas A: Comparing community structure
-  identification. \emph{J Stat Mech} P09008, 2005.
-
-  van Dongen S: Performance criteria for graph clustering and Markov cluster
-  experiments. Technical Report INS-R0012, National Research Institute for
-  Mathematics and Computer Science in the Netherlands, Amsterdam, May 2000.
- 
-  Rand WM: Objective criteria for the evaluation of clustering methods.
-  \emph{J Am Stat Assoc} 66(336):846-850, 1971.
-
-  Hubert L and Arabie P: Comparing partitions. \emph{Journal of
-    Classification} 2:193-218, 1985.
-  
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com}}
-\seealso{
-  \code{\link{walktrap.community}},
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link{spinglass.community}} for various community detection
-  methods.
-}
-\examples{
-g <- graph.famous("Zachary")
-sg <- spinglass.community(g)
-le <- leading.eigenvector.community(g)
-compare(sg, le, method="rand")
-compare(membership(sg), membership(le))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/components.Rd igraph-0.6.5/interfaces/R/igraph/man/components.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/components.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/components.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{components}
-\alias{subcomponent}
-\concept{Subcomponent}
-\title{In- or out- component of a vertex}
-\description{Finds all vertices reachable from a given vertex, or the
-  opposite: all vertices from which a given vertex is reachable via a
-  directed path.}
-\usage{
-subcomponent(graph, v, mode = c("all", "out", "in"))
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{v}{The vertex to start the search from.}
-  \item{mode}{Character string, either \dQuote{in}, \dQuote{out} or
-    \dQuote{all}. If \dQuote{in} all vertices from which \code{v} is
-    reachable are listed. If \dQuote{out} all vertices reachable from
-    \code{v} are returned. If \dQuote{all} returns the union of
-    these. It is ignored for undirected graphs.} 
-}
-\details{A breadh-first search is conducted starting from vertex
-  \code{v}.}
-\value{Numeric vector, the ids of the vertices in the same component as
-  \code{v}.} 
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{clusters}}}
-\examples{
-g <- erdos.renyi.game(100, 1/200)
-subcomponent(g, 1, "in")
-subcomponent(g, 1, "out")
-subcomponent(g, 1, "all")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/constraint.Rd igraph-0.6.5/interfaces/R/igraph/man/constraint.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/constraint.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/constraint.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-\name{constraint}
-\alias{constraint}
-\concept{Burt's constraint}
-\title{Burt's constraint}
-\description{Given a graph, \code{constraint} calculates Burt's constraint for
-  each vertex.
-}
-\usage{
-constraint(graph, nodes=V(graph), weights=NULL)
-}
-\arguments{
-  \item{graph}{A graph object, the input graph.}
-  \item{nodes}{The vertices for which the constraint will be
-    calculated. Defaults to all vertices.}
-  \item{weights}{The weights of the edges. If this is \code{NULL} and
-    there is a \code{weight} edge attribute this is used. If there is no
-    such edge attribute all edges will have the same weight.}
-}
-\details{Burt's constraint is higher if ego has less, or mutually
-  stronger related (i.e. more redundant) contacts. Burt's measure of
-  constraint, \eqn{C_i}{C[i]}, of vertex \eqn{i}'s ego network
-  \eqn{V_i}{V[i]}, is defined for directed and valued graphs,
-  \deqn{C_i=\sum_{j \in V_i \setminus \{i\}} (p_{ij}+\sum_{q \in V_i
-      \setminus \{i,j\}} p_{iq} p_{qj})^2}{%
-    C[i] = sum( [sum( p[i,j] + p[i,q] p[q,j], q in V[i], q != i,j )]^2, j in
-    V[i], j != i).
-  }
-  for a graph of order (ie. number of vertices) \eqn{N}, where
-  proportional tie strengths are defined as 
-  \deqn{p_{ij} = \frac{a_{ij}+a_{ji}}{\sum_{k \in V_i \setminus \{i\}}(a_{ik}+a_{ki})},}{%
-    p[i,j]=(a[i,j]+a[j,i]) / sum(a[i,k]+a[k,i], k in V[i], k != i),
-  }
-  \eqn{a_{ij}}{a[i,j]} are elements of \eqn{A} and the latter being the
-  graph adjacency matrix. For isolated vertices, constraint is undefined.
-}
-\value{A numeric vector of constraint scores}
-\author{Jeroen Bruggeman \email{j.p.bruggeman@uva.nl} and Gabor Csardi
-  \email{csardi.gabor@gmail.com}
-}
-\references{Burt, R.S. (2004). Structural holes and good ideas. \emph{American
-    Journal of Sociology} 110, 349-399.
-}
-\examples{
-g <- erdos.renyi.game(20, 5/20)
-constraint(g)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/contract.vertices.Rd igraph-0.6.5/interfaces/R/igraph/man/contract.vertices.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/contract.vertices.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/contract.vertices.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-\name{contract.vertices}
-\alias{contract.vertices}
-\title{Contract several vertices into a single one}
-\description{
-  This function creates a new graph, by merging several 
-  vertices into one. The vertices in the new graph correspond
-  to sets of vertices in the input graph.
-}
-\usage{
-contract.vertices(graph, mapping,
-                  vertex.attr.comb=getIgraphOpt("vertex.attr.comb"))
-}
-\arguments{
-  \item{graph}{The input graph, it can be directed or undirected.}
-  \item{mapping}{A numeric vector that specifies the mapping. Its
-    elements correspond to the vertices, and for each element the id in
-    the new graph is given.}
-  \item{vertex.attr.comb}{Specifies how to combine the vertex attributes
-    in the new graph. Please see \code{\link{attribute.combination}} for
-    details.
-  }
-}
-\details{
-  The attributes of the graph are kept. Graph and edge attributes are
-  unchanged, vertex attributes are combined, according to the
-  \code{vertex.attr.comb} parameter.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-g$name <- "Ring"
-V(g)$name <- letters[1:vcount(g)]
-E(g)$weight <- runif(ecount(g))
-
-g2 <- contract.vertices(g, rep(1:5, each=2),
-                        vertex.attr.comb=toString)
-
-## graph and edge attributes are kept, vertex attributes are
-## combined using the 'toString' function.
-print(g2, g=TRUE, v=TRUE, e=TRUE)
-
-}
-\keyword{graphs}
-
-  
-  
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/conversion.Rd igraph-0.6.5/interfaces/R/igraph/man/conversion.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/conversion.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/conversion.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,82 +0,0 @@
-\name{conversion}
-\alias{get.adjacency}
-\alias{get.edgelist}
-\concept{Edge list}
-\concept{Adjacency list}
-\title{Convert a graph to an adjacency matrix or an edge list}
-\description{Sometimes it is useful to have a standard representation of
-  a graph, like an adjacency matrix or an edge list.}
-\usage{
-get.adjacency(graph, type=c("both", "upper", "lower"),
-       attr=NULL, edges=FALSE, names=TRUE,
-       sparse=getIgraphOpt("sparsematrices"))
-get.edgelist(graph, names=TRUE)
-}
-\arguments{
-  \item{graph}{The graph to convert.}
-  \item{type}{Gives how to create the adjacency matrix for undirected
-    graphs. It is ignored for directed graphs. Possible values:
-    \code{upper}: the upper right triangle of the matrix is used,
-    \code{lower}: the lower left triangle of the matrix is
-    used. \code{both}: the whole matrix is used, a symmetric matrix is
-    returned.}
-  \item{attr}{Either \code{NULL} or a character string giving an edge
-    attribute name. If \code{NULL} a traditional adjacency matrix is
-    returned. If not \code{NULL} then the values of the given edge
-    attribute are included in the adjacency matrix. If the graph has
-    multiple edges, the edge attribute of an arbitrarily chosen edge
-    (for the multiple edges) is included. This argument is ignored if
-    \code{edges} is \code{TRUE}.
-
-    Note that this works only for certain attribute types. If the
-    \code{sparse} argumen is \code{TRUE}, then the attribute must be
-    either logical or numeric. If the \code{sparse} argument is
-    \code{FALSE}, then character is also allowed. The reason for the
-    difference is that the \code{Matrix} package does not support
-    character sparse matrices yet.
-  }
-  \item{edges}{Logical scalar, whether to return the edge ids in the
-    matrix. For non-existant edges zero is returned.}
-  \item{names}{Logical constant.
-
-    For \code{graph.adjacenct} it gives whether to assign row and column names
-    to the matrix. These are only assigned if the \code{name} vertex
-    attribute is present in the graph.
-
-    for \code{get.edgelist} it gives whether to return a character
-    matrix containing vertex names (ie. the \code{name} vertex
-    attribute) if they exist or numeric vertex ids.
-  }
-  \item{sparse}{Logical scalar, whether to create a sparse matrix. The
-    \sQuote{\code{Matrix}} package must be installed for creating sparse
-    matrices.}
-}
-\details{
-  \code{get.adjacency} returns the adjacency matrix of a graph, a
-  regular \R matrix if \code{sparse} is \code{FALSE}, or a sparse
-  matrix, as defined in the \sQuote{\code{Matrix}} package, if
-  \code{sparse} if \code{TRUE}.
-  
-  \code{get.edgelist} returns the list of edges in a graph.  
-}
-\value{
-  A \code{vcount(graph)} by \code{vcount(graph)} (usually) numeric
-  matrix for \code{get.adjacency}. (This can be huge!) Note that a
-  non-numeric matrix might be returned if \code{attr} is a non-numeric
-  edge attribute.
-
-  A \code{ecount(graph)} by 2 numeric matrix for \code{get.edgelist}.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.adjacency}}, \code{\link{read.graph}}}
-\examples{
-g <- erdos.renyi.game(10, 2/10)
-get.edgelist(g)
-get.adjacency(g)
-V(g)$name <- letters[1:vcount(g)]
-get.adjacency(g)
-E(g)$weight <- runif(ecount(g))
-get.adjacency(g, attr="weight")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/convex.hull.Rd igraph-0.6.5/interfaces/R/igraph/man/convex.hull.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/convex.hull.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/convex.hull.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-\name{convex.hull}
-\alias{convex.hull}
-\concept{Convex hull}
-\title{Convex hull of a set of vertices}
-\description{
-  Calculate the convex hull of a set of points, i.e. the covering
-  polygon that has the smallest area.
-}
-\usage{
-convex.hull(data)
-}
-\arguments{
-  \item{data}{The data points, a numeric matrix with two columns.}
-}
-%\details{}
-\value{
-  A named list with components:
-  \item{resverts}{The indices of the input vertices that constritute the
-    convex hull.}
-  \item{rescoords}{The coordinates of the corners of the convex hull.}
-}
-\references{
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford
- Stein. Introduction to Algorithms, Second Edition. MIT Press and
- McGraw-Hill, 2001. ISBN 0262032937. Pages 949-955 of section 33.3:
- Finding the convex hull.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com}}
-% \seealso
-\examples{
-M <- cbind( runif(100), runif(100) )
-convex.hull(M)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/decompose.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/decompose.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/decompose.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/decompose.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-\name{decompose.graph}
-\alias{decompose.graph}
-\concept{Graph decomposition}
-\concept{Graph component}
-\title{Decompose a graph into components}
-\description{Creates a separate graph for each component of a graph.}
-\usage{
-decompose.graph(graph, mode = c("weak", "strong"),
-       max.comps = NA, min.vertices = 0) 
-}
-\arguments{
-  \item{graph}{The original graph.}
-  \item{mode}{Character constant giving the type of the components,
-    wither \code{weak} for weakly connected components or \code{strong}
-    for strongly connected components.}
-  \item{max.comps}{The maximum number of components to return. The first
-    \code{max.comps} components will be returned (which hold at least
-    \code{min.vertices} vertices, see the next parameter), the others
-    will be ignored. Supply \code{NA} here if you don't want to limit
-    the number of components.}
-  \item{min.vertices}{The minimum number of vertices a component should
-    contain in order to place it in the result list. Eg. supply 2
-    here to ignore isolate vertices.}
-}
-% \details{}
-\value{
-  A list of graph objects.
-}
-%\references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{is.connected}} to decide whether a graph is
-  connected, \code{\link{clusters}} to calculate the connected
-  components of a graph.}
-\examples{
-# the diameter of each component in a random graph
-g <- erdos.renyi.game(1000, 1/1000)
-comps <- decompose.graph(g, min.vertices=2)
-sapply(comps, diameter)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/degree.Rd igraph-0.6.5/interfaces/R/igraph/man/degree.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/degree.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/degree.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-\name{degree}
-\alias{degree}
-\concept{Vertex degree}
-\concept{Degree distribution}
-\alias{degree.distribution}
-\title{Degree and degree distribution of the vertices}
-\description{The degree of a vertex is its most basic structural
-  property, the number of its adjacent edges.}
-\usage{
-degree(graph, v=V(graph), mode = c("all", "out", "in", "total"),
-       loops = TRUE, normalized = FALSE) 
-degree.distribution(graph, cumulative = FALSE, \dots) 
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{v}{The ids of vertices of which the degree will be calculated.}
-  \item{mode}{Character string, \dQuote{out} for out-degree, \dQuote{in} for
-    in-degree or \dQuote{total} for the sum of the two. For undirected
-    graphs this argument is ignored. \dQuote{all} is a synonym of
-    \dQuote{total}.}
-  \item{loops}{Logical; whether the loop edges are also counted.}
-  \item{normalized}{Logical scalar, whether to normalize the degree.
-    If \code{TRUE} then the result is divided by \eqn{n-1}, where
-    \eqn{n} is the number of vertices in the graph.}
-  \item{cumulative}{Logical; whether the cumulative degree distribution
-    is to be calculated.}
-  \item{\dots}{Additional arguments to pass to \code{degree},
-    eg. \code{mode} is useful but also \code{v} and \code{loops} make
-    sense.}
-}
-% \details{}
-\value{
-  For \code{degree} a numeric vector of the same length as argument
-  \code{v}.
-
-  For \code{degree.distribution} a numeric vector of the same length as
-  the maximum degree plus one. The first element is the relative
-  frequency zero degree vertices, the second vertices with degree one, 
-  etc. 
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-degree(g)
-g2 <- erdos.renyi.game(1000, 10/1000)
-degree.distribution(g2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/degree.sequence.game.Rd igraph-0.6.5/interfaces/R/igraph/man/degree.sequence.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/degree.sequence.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/degree.sequence.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-\name{degree.sequence.game}
-\alias{degree.sequence.game}
-\concept{Degree sequence}
-\concept{Configuration model}
-\title{Generate random graphs with a given degree sequence}
-\description{It is often useful to create a graph with given vertex
-  degrees. This is exactly what \code{degree.sequence.game} does.}
-\usage{
-degree.sequence.game(out.deg, in.deg = NULL,
-     method = c("simple", "vl", "simple.no.multiple"), \dots)
-}
-\arguments{
-  \item{out.deg}{Numeric vector, the sequence of degrees (for undirected
-  graphs) or out-degrees (for directed graphs). For undirected graphs
-  its sum should be even. For directed graphs its sum should be the same
-  as the sum of \code{in.deg}.}
-  \item{in.deg}{For directed graph, the in-degree sequence. By default
-    this is \code{NULL} and an undirected graph is created.}
-  \item{method}{Character, the method for generating the graph. Right
-    now the \dQuote{simple}, \dQuote{simple.no.multiple} and \dQuote{vl}
-    methods are implemented.}
-  \item{\dots}{Additional arguments, these are used as graph
-    attributes.}
-}
-\details{The \dQuote{simple} method connects the out-stubs of the
-  edges (undirected graphs) or the out-stubs and in-stubs
-  (directed graphs) together. This way loop edges and also multiple
-  edges may be generated. This method is not adequate if one needs to
-  generate simple graphs with a given degree sequence. The multiple and
-  loop edges can be deleted, but then the degree sequence is distorted
-  and there is nothing to ensure that the graphs are sampled uniformly.
-
-  The \dQuote{simple.no.multiple} method is similar to \dQuote{simple},
-  but tries to avoid multiple and loop edges and restarts the
-  generation from scratch if it gets stuck. It is not guaranteed
-  to sample uniformly from the space of all possible graphs with
-  the given sequence, but it is relatively fast and it will
-  eventually succeed if the provided degree sequence is graphical,
-  but there is no upper bound on the number of iterations.
-  
-  The \dQuote{vl} method is a more sophisticated generator. The
-  algorithm and the implementation was done by Fabien Viger and Matthieu
-  Latapy. This generator always generates undirected, connected simple
-  graphs, it is an error to pass the \code{in.deg} argument to it.
-  The algorithm relies on first creating an initial (possibly
-  unconnected) simple undirected graph with the given degree sequence
-  (if this is possible at all). Then some rewiring is done to make the
-  graph connected. Finally a Monte-Carlo algorithm is used to randomize
-  the graph. The \dQuote{vl} samples from the undirected, connected
-  simple graphs unformly. See
-  \url{http://www-rp.lip6.fr/~latapy/FV/generation.html} for details.
-}
-\value{The new graph object.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{erdos.renyi.game}}, \code{\link{barabasi.game}},
-  \code{\link{simplify}} to get rid of the multiple and/or loops edges.}
-\examples{
-## The simple generator
-g <- degree.sequence.game(rep(2,100))
-degree(g)
-is.simple(g)   # sometimes TRUE, but can be FALSE
-g2 <- degree.sequence.game(1:10, 10:1)
-degree(g2, mode="out")
-degree(g2, mode="in")
-
-## The vl generator
-g3 <- degree.sequence.game(rep(2,100), method="vl")
-degree(g3)
-is.simple(g3)  # always TRUE
-
-## Exponential degree distribution
-## Note, that we correct the degree sequence if its sum is odd
-degs <- sample(1:100, 100, replace=TRUE, prob=exp(-0.5*(1:100)))
-if (sum(degs) \%\% 2 != 0) { degs[1] <- degs[1] + 1 }
-g4 <- degree.sequence.game(degs, method="vl")
-all(degree(g4) == degs)
-
-## Power-law degree distribution
-## Note, that we correct the degree sequence if its sum is odd
-degs <- sample(1:100, 100, replace=TRUE, prob=(1:100)^-2)
-if (sum(degs) \%\% 2 != 0) { degs[1] <- degs[1] + 1 }
-g5 <- degree.sequence.game(degs, method="vl")
-all(degree(g5) == degs)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.Rd igraph-0.6.5/interfaces/R/igraph/man/dendPlot.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/dendPlot.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-\name{dendPlot}
-\alias{dendPlot}
-\concept{Dendrograms}
-\title{Plot dendrograms}
-\description{
-  This is generic function that can plot various objects as dendrograms.
-}
-% \usage
-% \arguments{}
-\details{
-  Currently the function is defined for \code{communities} (see
-  \code{\link{dendPlot.communities}}) and \code{igraphHRG}
-  (see \code{\link{dendPlot.igraphHRG}}) objects.
-}
-% \value{}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-karate <- graph.famous("Zachary")
-fc <- fastgreedy.community(karate)
-dendPlot(fc)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.communities.Rd igraph-0.6.5/interfaces/R/igraph/man/dendPlot.communities.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.communities.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/dendPlot.communities.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,95 +0,0 @@
-\name{dendPlot.communities}
-\alias{dendPlot.communities}
-\concept{Dendrograms}
-\concept{Community structure}
-\title{Community structure dendrogram plots}
-\description{Plot a hierarchical community structure as a dendrogram.}
-\usage{
-\method{dendPlot}{communities}(x, mode = getIgraphOpt("dend.plot.type"),
-   \dots, use.modularity = FALSE)
-}
-\arguments{
-  \item{x}{An object containing the community structure of a graph. See
-    \code{\link{communities}} for details.}
-  \item{mode}{Which dendrogram plotting function to use. See details
-    below.}
-  \item{\dots}{Additional arguments to supply to the dendrogram plotting
-    function.}
- \item{use.modularity}{Logical scalar, whether to use the modularity
-   values to define the height of the branches.}
-}
-\details{
-  \code{dendPlot} supports three different plotting functions, selected
-  via the \code{mode} argument. By default the plotting function is
-  taken from the \code{dend.plot.type} igraph option, and it has for
-  possible values: \itemize{
-  \item \code{auto} Choose automatically between the plotting
-    functions. As \code{plot.phylo} is the most sophisticated, that is
-    choosen, whenever the \code{ape} package is available. Otherwise
-    \code{plot.hclust} is used.
-  \item \code{phylo} Use \code{plot.phylo} from the \code{ape}
-    package.
-  \item \code{hclust} Use \code{plot.hclust} from the \code{stats}
-    package.
-  \item \code{dendrogram} Use \code{plot.dendrogram} from the
-    \code{stats} package.
-  }
-
-  The different plotting functions take different sets of
-  arguments. When using \code{plot.phylo} (\code{mode="phylo"}), we have
-  the following syntax: \preformatted{
-    dendPlot(x, mode="phylo",
-         colbar = rainbow(11, start=0.7, end=0.1),
-	 edge.color = NULL, use.edge.length = FALSE, \dots)
-  } The extra arguments not documented above: \itemize{
-    \item \code{colbar} Color bar for the edges. 
-    \item \code{edge.color} Edge colors. If \code{NULL}, then the
-    \code{colbar} argument is used.
-    \item \code{use.edge.length} Passed to \code{plot.phylo}.
-    \item \code{dots} Attitional arguments to pass to
-    \code{plot.phylo}.
-  }
-
-  The syntax for \code{plot.hclust} (\code{mode="hclust"}): \preformatted{
-    dendPlot(x, mode="hclust", rect = 0, colbar = rainbow(rect),
-         hang = 0.01, ann = FALSE, main = "", sub = "", xlab = "",
-	 ylab = "", \dots)
-  } The extra arguments not documented above: \itemize{
-    \item \code{rect} A numeric scalar, the number of groups to mark on
-    the dendrogram. The dendrogram is cut into exactly \code{rect}
-    groups and they are marked via the \code{rect.hclust} command. Set
-    this to zero if you don't want to mark any groups.
-    \item \code{colbar} The colors of the rectanges that mark the
-    vertex groups via the \code{rect} argument.
-    \item \code{hang} Where to put the leaf nodes, this corresponds to the
-    \code{hang} argument of \code{plot.hclust}.
-    \item \code{ann} Whether to annotate the plot, the \code{ann} argument
-    of \code{plot.hclust}.
-    \item \code{main} The main title of the plot, the \code{main} argument
-    of \code{plot.hclust}.
-    \item \code{sub} The sub-title of the plot, the \code{sub} argument
-    of \code{plot.hclust}.
-    \item \code{xlab} The label on the horizontal axis, passed to
-    \code{plot.hclust}. 
-    \item \code{ylab} The label on the vertical axis, passed to
-    \code{plot.hclust}. 
-    \item \code{dots} Attitional arguments to pass to \code{plot.hclust}.
-  }
-
-  The syntax for \code{plot.dendrogram} (\code{mode="dendrogram"}): \preformatted{
-    dendPlot(x, \dots)
-  } The extra arguments are simply passed to \code{as.dendrogram}.  
-}
-\value{
-  Returns whatever the return value was from the plotting function,
-  \code{plot.phylo}, \code{plot.dendrogram} or \code{plot.hclust}.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-% \seealso{}
-\examples{
-karate <- graph.famous("Zachary")
-fc <- fastgreedy.community(karate)
-dendPlot(fc)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.igraphHRG.Rd igraph-0.6.5/interfaces/R/igraph/man/dendPlot.igraphHRG.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/dendPlot.igraphHRG.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/dendPlot.igraphHRG.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,94 +0,0 @@
-\name{dendPlot.igraphHRG}
-\alias{dendPlot.igraphHRG}
-\concept{Dendrograms}
-\concept{Hierarchical random graphs}
-\title{HRG dendrogram plot}
-\description{Plot a hierarchical random graph as a dendrogram.}
-\usage{
-\method{dendPlot}{igraphHRG}(x, mode = getIgraphOpt("dend.plot.type"),
-        \dots)
-}
-\arguments{
-  \item{x}{An \code{igraphHRG}, a hierarchical random graph,
-    as returned by the \code{\link{hrg.fit}} function.}
-  \item{mode}{Which dendrogram plotting function to use. See details
-    below.}
-  \item{\dots}{Additional arguments to supply to the dendrogram plotting
-    function.}
-}
-\details{
-  \code{dendPlot} supports three different plotting functions, selected
-  via the \code{mode} argument. By default the plotting function is
-  taken from the \code{dend.plot.type} igraph option, and it has for
-  possible values: \itemize{
-  \item \code{auto} Choose automatically between the plotting
-    functions. As \code{plot.phylo} is the most sophisticated, that is
-    choosen, whenever the \code{ape} package is available. Otherwise
-    \code{plot.hclust} is used.
-  \item \code{phylo} Use \code{plot.phylo} from the \code{ape}
-    package.
-  \item \code{hclust} Use \code{plot.hclust} from the \code{stats}
-    package.
-  \item \code{dendrogram} Use \code{plot.dendrogram} from the
-    \code{stats} package.
-  }
-
-  The different plotting functions take different sets of
-  arguments. When using \code{plot.phylo} (\code{mode="phylo"}), we have
-  the following syntax: \preformatted{
-    dendPlot(x, mode="phylo",
-         colbar = rainbow(11, start=0.7, end=0.1),
-	 edge.color = NULL, use.edge.length = FALSE, \dots)
-  } The extra arguments not documented above: \itemize{
-    \item \code{colbar} Color bar for the edges. 
-    \item \code{edge.color} Edge colors. If \code{NULL}, then the
-    \code{colbar} argument is used.
-    \item \code{use.edge.length} Passed to \code{plot.phylo}.
-    \item \code{dots} Attitional arguments to pass to
-    \code{plot.phylo}.
-  }
-
-  The syntax for \code{plot.hclust} (\code{mode="hclust"}): \preformatted{
-    dendPlot(x, mode="hclust", rect = 0, colbar = rainbow(rect),
-         hang = 0.01, ann = FALSE, main = "", sub = "", xlab = "",
-	 ylab = "", \dots)
-  } The extra arguments not documented above: \itemize{
-    \item \code{rect} A numeric scalar, the number of groups to mark on
-    the dendrogram. The dendrogram is cut into exactly \code{rect}
-    groups and they are marked via the \code{rect.hclust} command. Set
-    this to zero if you don't want to mark any groups.
-    \item \code{colbar} The colors of the rectanges that mark the
-    vertex groups via the \code{rect} argument.
-    \item \code{hang} Where to put the leaf nodes, this corresponds to the
-    \code{hang} argument of \code{plot.hclust}.
-    \item \code{ann} Whether to annotate the plot, the \code{ann} argument
-    of \code{plot.hclust}.
-    \item \code{main} The main title of the plot, the \code{main} argument
-    of \code{plot.hclust}.
-    \item \code{sub} The sub-title of the plot, the \code{sub} argument
-    of \code{plot.hclust}.
-    \item \code{xlab} The label on the horizontal axis, passed to
-    \code{plot.hclust}. 
-    \item \code{ylab} The label on the vertical axis, passed to
-    \code{plot.hclust}. 
-    \item \code{dots} Attitional arguments to pass to \code{plot.hclust}.
-  }
-
-  The syntax for \code{plot.dendrogram} (\code{mode="dendrogram"}): \preformatted{
-    dendPlot(x, \dots)
-  } The extra arguments are simply passed to \code{as.dendrogram}.
-  
-}
-\value{
-  Returns whatever the return value was from the plotting function,
-  \code{plot.phylo}, \code{plot.dendrogram} or \code{plot.hclust}.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.full(5) + graph.full(5)
-hrg <- hrg.fit(g)
-dendPlot(hrg)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/diameter.Rd igraph-0.6.5/interfaces/R/igraph/man/diameter.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/diameter.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/diameter.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-\name{diameter}
-\alias{diameter}
-\alias{get.diameter}
-\alias{farthest.nodes}
-\concept{Diameter}
-\title{Diameter of a graph}
-\description{The diameter of a graph is the length of the longest
-  geodesic.}
-\usage{
-diameter(graph, directed = TRUE, unconnected = TRUE, weights = NULL)
-get.diameter (graph, directed = TRUE, unconnected = TRUE, weights = NULL) 
-farthest.nodes (graph, directed = TRUE, unconnected = TRUE, weights = NULL) 
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{directed}{Logical, whether directed or undirected paths are to
-    be considered. This is ignored for undirected graphs.}
-  \item{unconnected}{Logical, what to do if the graph is unconnected. If
-    FALSE, the function will return a number that is one larger the
-    largest possible diameter, which is always the number of
-    vertices. If TRUE, the diameters of the connected components will be
-    calculated and the largest one will be returned.}
-  \item{weights}{Optional positive weight vector for calculating
-    weighted distances. If the graph has a \code{weight} edge
-    attribute, then this is used by default.}
-}
-\details{The diameter is calculated by using a breadth-first search like
-  method.
-
-  \code{get.diameter} returns a path with the actual diameter. If there
-  are many shortest paths of the length of the diameter, then it returns
-  the first one found.
-
-  \code{farthest.points} returns two vertex ids, the vertices which are
-  connected by the diameter path.
-}
-\value{A numeric constant for \code{diameter}, a numeric vector for
-  \code{get.diameter} and a numeric vector of length two for
-  \code{farthest.nodes}.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{shortest.paths}}}
-\examples{
-g <- graph.ring(10)
-g2 <- delete.edges(g, c(1,2,1,10))
-diameter(g2, unconnected=TRUE)
-diameter(g2, unconnected=FALSE)
-
-## Weighted diameter
-set.seed(1)
-g <- graph.ring(10)
-E(g)$weight <- sample(seq_len(ecount(g)))
-diameter(g)
-get.diameter(g)
-diameter(g, weights=NA)
-get.diameter(g, weights=NA)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/dominator.tree.Rd igraph-0.6.5/interfaces/R/igraph/man/dominator.tree.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/dominator.tree.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/dominator.tree.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,75 +0,0 @@
-\name{dominator.tree}
-\alias{dominator.tree}
-\concept{Domintor tree}
-\title{Dominator tree}
-\description{Dominator tree of a directed graph.
-}
-\usage{
-dominator.tree (graph, root, mode = c("out", "in"))
-}
-\arguments{
-  \item{graph}{A directed graph. If it is not a flowgraph, and it
-    contains some vertices not reachable from the root vertex,
-    then these vertices will be collected and returned as part of the
-    result.}
-  \item{root}{The id of the root (or source) vertex, this will be the
-    root of the tree.}
-  \item{mode}{Constant, must be \sQuote{\code{in}} or
-    \sQuote{\code{out}}. If it is \sQuote{\code{in}}, then all
-    directions are considered as opposite to the original one in the
-    input graph.}
-}
-\details{
- A flowgraph is a directed graph with a distinguished start (or
- root) vertex \eqn{r}, such that for any vertex \eqn{v}, there is a path
- from \eqn{r} to \eqn{v}. A vertex \eqn{v} dominates another vertex
- \eqn{w} (not equal to \eqn{v}), if every path from \eqn{r} to \eqn{w}
- contains \eqn{v}. Vertex \eqn{v} is the immediate dominator or \eqn{w},
- \eqn{v=\textrm{idom}(w)}{v=idom(w)}, if \eqn{v} dominates \eqn{w} and
- every other dominator of \eqn{w} dominates \eqn{v}. The edges
- \eqn{{(\textrm{idom}(w), w)| w \ne r}}{{(idom(w),w)| w is not r}}
- form a directed tree, rooted at \eqn{r}, called the dominator tree of
- the graph. Vertex \eqn{v} dominates vertex \eqn{w} if and only if
- \eqn{v} is an ancestor of \eqn{w} in the dominator tree.
-
- This function implements the Lengauer-Tarjan algorithm
- to construct the dominator tree of a directed graph. For details see
- the reference below.
-}
-\value{
-  A list with components:
-  \item{dom}{
-    A numeric vector giving the immediate dominators for each
-    vertex. For vertices that are unreachable from the root, it contains
-    \code{NaN}. For the root vertex itself it contains minus one.
-  }
-  \item{domtree}{
-    A graph object, the dominator tree. Its vertex ids are the as the
-    vertex ids of the input graph. Isolate vertices are the ones that
-    are unreachable from the root.
-  }
-  \item{leftout}{
-    A numeric vector containing the vertex ids that are unreachable from
-    the root.
-  }
-}
-\references{
-  Thomas Lengauer, Robert Endre Tarjan: A fast algorithm
-  for finding dominators in a flowgraph, \emph{ACM Transactions on
-  Programming Languages and Systems (TOPLAS)} I/1, 121--141, 1979.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-## The example from the paper
-g <- graph.formula(R-+A:B:C, A-+D, B-+A:D:E, C-+F:G, D-+L,
-                   E-+H, F-+I, G-+I:J, H-+E:K, I-+K, J-+I,
-                   K-+I:R, L-+H)
-dtree <- dominator.tree(g, root="R")
-layout <- layout.reingold.tilford(dtree$domtree, root="R")
-layout[,2] <- -layout[,2]
-if (interactive()) {
-  plot(dtree$domtree, layout=layout, vertex.label=V(dtree$domtree)$name)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/dyad.census.Rd igraph-0.6.5/interfaces/R/igraph/man/dyad.census.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/dyad.census.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/dyad.census.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-\name{dyad.census}
-\alias{dyad.census}
-\concept{Dyad census}
-\title{Dyad census of a graph}
-\description{Classify dyads in a directed graphs. The relationship
-  between each pair of vertices is measured. It can be in three states:
-  mutual, asymmetric or non-existent.}
-\usage{
-dyad.census(graph)
-}
-\arguments{
-  \item{graph}{The input graph. A warning is given if it is not directed.}
-}
-%\details{}
-\value{A named numeric vector with three elements:
-  \item{mut}{The number of pairs with mutual connections.}
-  \item{asym}{The number of pairs with non-mutual connections.}
-  \item{null}{The number of pairs with no connection between them.}
-}
-\references{
-  Holland, P.W. and Leinhardt, S. A Method for Detecting
-  Structure in Sociometric Data. \emph{American Journal of Sociology}, 76,
-  492--513. 1970.
-
-  Wasserman, S., and Faust, K. \emph{Social Network Analysis: Methods
-  and Applications.} Cambridge: Cambridge University Press. 1994.
-}
-\author{
-  Gabor Csardi \email{csardi.gabor@gmail.com}
-}
-\seealso{
-  \code{\link{triad.census}} for the same classification, but with triples.
-}
-\examples{
-g <- ba.game(100)
-dyad.census(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/eccentricity.Rd igraph-0.6.5/interfaces/R/igraph/man/eccentricity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/eccentricity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/eccentricity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-\name{eccentricity}
-\alias{eccentricity}
-\alias{radius}
-\concept{Eccentricity}
-\concept{Radius}
-\title{Eccentricity and radius}
-\description{The eccentricity of a vertex is its shortest path distance
-  from the farthest other node in the graph. The smallest eccentricity
-  in a graph is called its radius}
-\usage{
-eccentricity(graph, vids=V(graph), mode=c("all", "out", "in", "total"))
-radius(graph, mode=c("all", "out", "in", "total"))
-}
-\arguments{
-  \item{graph}{The input graph, it can be directed or undirected.}
-  \item{vids}{The vertices for which the eccentricity is calculated.}
-  \item{mode}{Character constant, gives whether the shortest paths to or
-    from the given vertices should be calculated for directed graphs. If
-    \code{out} then the shortest paths \emph{from} the vertex, if
-    \code{in} then \emph{to} it will be considered. If \code{all}, the
-    default, then the corresponding undirected graph will be used, edge
-    directions will be ignored. This argument is ignored for
-    undirected graphs.}
-}
-\details{
- The eccentricity of a vertex is calculated by measuring the shortest
- distance from (or to) the vertex, to (or from) all vertices in the
- graph, and taking the maximum.
-
- This implementation ignores vertex pairs that are in different
- components. Isolate vertices have eccentricity zero.  
-}
-\value{
-  \code{eccentricity} returns a numeric vector, containing the
-  eccentricity score of each given vertex.
-
-  \code{radius} returns a numeric scalar.
-}
-\references{
-  Harary, F. Graph Theory. Reading, MA: Addison-Wesley, p. 35, 1994.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{shortest.paths}} for general shortest path
-  calculations.}
-\examples{
-g <- graph.star(10, mode="undirected")
-eccentricity(g)
-radius(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/edge.connectivity.Rd igraph-0.6.5/interfaces/R/igraph/man/edge.connectivity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/edge.connectivity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/edge.connectivity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,80 +0,0 @@
-\name{edge.connectivity}
-\alias{edge.connectivity}
-\alias{edge.disjoint.paths}
-\alias{graph.adhesion}
-\concept{Edge connectivity}
-\concept{Edge-disjoint paths}
-\concept{Graph adhesion}
-\title{Edge connectivity.}
-\description{The edge connectivity of a graph or two vertices, this is
-  recently also called group adhesion.}
-\usage{
-edge.connectivity(graph, source=NULL, target=NULL, checks=TRUE)
-edge.disjoint.paths(graph, source, target)
-graph.adhesion(graph, checks=TRUE)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{source}{The id of the source vertex, for
-    \code{edge.connectivity} it can be \code{NULL}, see details below.}
-  \item{target}{The id of the target vertex, for
-    \code{edge.connectivity} it can be \code{NULL}, see details below.}
-  \item{checks}{Logical constant. Whether to check that the graph is
-    connected and also the degree of the vertices. If the graph is
-    not (strongly) connected then the connectivity is obviously zero. Otherwise
-    if the minimum degree is one then the edge connectivity is also
-    one. It is a good idea to perform these checks, as they can be
-    done quickly compared to the connectivity calculation itself. 
-    They were suggested by Peter McMahan, thanks Peter.
-  }
-}
-\details{
-  The edge connectivity of a pair of vertices (\code{source} and
-  \code{target}) is the minimum number of edges needed to remove to
-  eliminate all (directed) paths from \code{source} to \code{target}.
-  \code{edge.connectivity} calculates this quantity if both the
-  \code{source} and \code{target} arguments are given (and not
-  \code{NULL}). 
-
-  The edge connectivity of a graph is the minimum of the edge
-  connectivity of every (ordered) pair of vertices in the graph.
-  \code{edge.connectivity} calculates this quantity if neither the
-  \code{source} nor the \code{target} arguments are given (ie. they are
-  both \code{NULL}).
-
-  A set of edge disjoint paths between two vertices is a set of paths
-  between them containing no common edges. The maximum number of edge
-  disjoint paths between two vertices is the same as their edge
-  connectivity.
-
-  The adhesion of a graph is the minimum number of edges needed to
-  remove to obtain a graph which is not strongly connected. This is the
-  same as the edge connectivity of the graph.
-
-  The three functions documented on this page calculate similar
-  properties, more precisely the most general is
-  \code{edge.connectivity}, the others are included only for having more
-  descriptive function names.
-}
-\value{
-  A scalar real value.
-}
-\references{Douglas R. White and Frank Harary: The cohesiveness of
-  blocks in social networks: node connectivity and conditional
-  density, TODO: citation}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.maxflow}}, \code{\link{vertex.connectivity}},
-  \code{\link{vertex.disjoint.paths}}, \code{\link{graph.cohesion}}}
-\examples{
-g <- barabasi.game(100, m=1)
-g2 <- barabasi.game(100, m=5)
-edge.connectivity(g, 100, 1)
-edge.connectivity(g2, 100, 1)
-edge.disjoint.paths(g2, 100, 1)
-
-g <- erdos.renyi.game(50, 5/50)
-g <- as.directed(g)
-g <- induced.subgraph(g, subcomponent(g, 1))
-graph.adhesion(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/erdos.renyi.game.Rd igraph-0.6.5/interfaces/R/igraph/man/erdos.renyi.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/erdos.renyi.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/erdos.renyi.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-\name{erdos.renyi.game}
-\alias{erdos.renyi.game}
-\alias{random.graph.game}
-\concept{Random graph model}
-\concept{Erdos-Renyi graph}
-\title{Generate random graphs according to the Erdos-Renyi model}
-\description{This model is very simple, every possible edge is created
-  with the same constant probability. }
-\usage{
-erdos.renyi.game(n, p.or.m, type=c("gnp", "gnm"),
-                 directed = FALSE, loops = FALSE, \dots)
-}
-\arguments{
-  \item{n}{The number of vertices in the graph.}
-  \item{p.or.m}{Either the probability for drawing an edge between two
-    arbitrary vertices (G(n,p) graph), or the number of edges in the
-    graph (for G(n,m) graphs).}
-  \item{type}{The type of the random graph to create, either \code{gnp}
-    (G(n,p) graph) or \code{gnm} (G(n,m) graph).}
-  \item{directed}{Logical, whether the graph will be directed, defaults
-    to FALSE.}
-  \item{loops}{Logical, whether to add loop edges, defaults to FALSE.}
-  \item{\dots}{Additional arguments, ignored.}
-}
-\details{
-  In G(n,p) graphs, the graph has \sQuote{n} vertices and for each edge
-  the probability that it is present in the graph is \sQuote{p}.
-
-  In G(n,m) graphs, the graph has \sQuote{n} vertices and \sQuote{m}
-  edges, and the \sQuote{m} edges are chosen uniformly randomly from the
-  set of all possible edges. This set includes loop edges as well if the
-  \code{loops} parameter is TRUE.
-  
-  \code{random.graph.game} is an alias to this function.
-}
-\value{A graph object.}
-\references{ Erdos, P. and Renyi, A., On random graphs, \emph{Publicationes
-  Mathematicae} 6, 290--297 (1959).
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{barabasi.game}}}
-\examples{
-g <- erdos.renyi.game(1000, 1/1000)
-degree.distribution(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/evcent.Rd igraph-0.6.5/interfaces/R/igraph/man/evcent.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/evcent.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/evcent.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,75 +0,0 @@
-\name{evcent}
-\alias{evcent}
-\concept{Eigenvector centrality}
-\title{Find Eigenvector Centrality Scores of Network Positions}
-\description{
-  \code{evcent} takes a graph (\code{graph}) and returns the
-  eigenvector centralities of positions \code{v} within it
-}
-\usage{
-evcent (graph, directed = FALSE, scale = TRUE, weights = NULL,
-     options = igraph.arpack.default) 
-}
-\arguments{
-  \item{graph}{Graph to be analyzed.}
-  \item{directed}{Logical scalar, whether to consider direction of the
-    edges in directed graphs. It is ignored for undirected graphs.}
-  \item{scale}{Logical scalar, whether to scale the result to have a
-    maximum score of one. If no scaling is used then the result vector
-    has unit length in the Euclidean norm.}
-  \item{weights}{A numerical vector or \code{NULL}. This argument can be
-    used to give edge weights for calculating the weighted eigenvector
-    centrality of vertices. If this is \code{NULL} and the graph has a
-    \code{weight} edge attribute then that is used. If \code{weights} is
-    a numerical vector then it used, even if the graph has a
-    \code{weights} edge attribute. If this is \code{NA}, then no edge
-    weights are used (even if the graph has a \code{weight} edge
-    attribute. Note that if there are negative edge weights and the
-    direction of the edges is considered, then the eigenvector might be
-    complex. In this case only the real part is reported.}
-  \item{options}{A named list, to override some ARPACK options. See
-    \code{\link{arpack}} for details.}
-}
-\details{
-Eigenvector centrality scores correspond to the values of the first
-eigenvector of the graph adjacency matrix; these scores may, in turn, be
-interpreted as arising from a reciprocal process in which the centrality
-of each actor is proportional to the sum of the centralities of those
-actors to whom he or she is connected.  In general, vertices with high
-eigenvector centralities are those which are connected to many other
-vertices which are, in turn, connected to many others (and so on).  (The
-perceptive may realize that this implies that the largest values will be
-obtained by individuals in large cliques (or high-density
-substructures).  This is also intelligible from an algebraic point of
-view, with the first eigenvector being closely related to the best
-rank-1 approximation of the adjacency matrix (a relationship which is
-easy to see in the special case of a diagonalizable symmetric real
-matrix via the \eqn{SLS^-1}{$S \Lambda S^{-1}$} decomposition).)
-
-From igraph version 0.5 this function uses ARPACK for the underlying
-computation, see \code{\link{arpack}} for more about ARPACK in igraph.
-}
-\value{
-  A named list with components:
-  \item{vector}{A vector containing the centrality scores.}
-  \item{value}{The eigenvalue corresponding to the calculated
-    eigenvector, i.e. the centrality scores.}
-  \item{options}{A named list, information about the underlying ARPACK
-    computation. See \code{\link{arpack}} for the details.
-  }
-}
-\references{ Bonacich, P.  (1987).  Power and Centrality: A Family of
-Measures. \emph{American Journal of Sociology}, 92, 1170-1182. }
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} and Carter T. Butts
-\email{buttsc@uci.edu} for the manual page} 
-\section{WARNING }{\code{evcent} will not symmetrize your data before
-extracting eigenvectors; don't send this routine asymmetric matrices
-unless you really mean to do so.}
-% \seealso{}
-\examples{
-#Generate some test data
-g <- graph.ring(10, directed=FALSE)
-#Compute eigenvector centrality scores
-evcent(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/evolver.Rd igraph-0.6.5/interfaces/R/igraph/man/evolver.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/evolver.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/evolver.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,243 +0,0 @@
-\name{revolver}
-\alias{evolver}
-\alias{revolver}
-\alias{evolver.d}
-\alias{revolver.d}
-\alias{revolver.ad}
-\alias{revolver.ade}
-\alias{revolver.adi}
-\alias{revolver.air}
-\alias{revolver.ar}
-\alias{revolver.de}
-\alias{revolver.di}
-\alias{revolver.dl}
-\alias{revolver.e}
-\alias{revolver.el}
-\alias{revolver.il}
-\alias{revolver.ir}
-\alias{revolver.l}
-\alias{revolver.r}
-\alias{revolver.error.d}
-\alias{revolver.error.ad}
-\alias{revolver.error.ade}
-\alias{revolver.error.adi}
-\alias{revolver.error.air}
-\alias{revolver.error.ar}
-\alias{revolver.error.de}
-\alias{revolver.error.di}
-\alias{revolver.error.dl}
-\alias{revolver.error.e}
-\alias{revolver.error.el}
-\alias{revolver.error.il}
-\alias{revolver.error.ir}
-\alias{revolver.error.l}
-\alias{revolver.error.r}
-\alias{revolver.d.d}
-\alias{revolver.p.p}
-\alias{revolver.ml.AD.alpha.a.beta}
-\alias{revolver.ml.AD.dpareto}
-\alias{revolver.ml.AD.dpareto.eval}
-\alias{revolver.ml.ad}
-\alias{revolver.ml.ade}
-\alias{revolver.ml.ADE.alpha.a.beta}
-\alias{revolver.ml.ADE.dpareto}
-\alias{revolver.ml.ADE.dpareto.eval}
-\alias{revolver.ml.ADE.dpareto.evalf}
-\alias{revolver.ml.d}
-\alias{revolver.ml.D.alpha}
-\alias{revolver.ml.D.alpha.a}
-\alias{revolver.ml.de}
-\alias{revolver.ml.DE.alpha.a}
-\alias{revolver.ml.df}
-\alias{revolver.ml.f}
-\alias{revolver.ml.l}
-\alias{revolver.probs.ad}
-\alias{revolver.probs.ade}
-\alias{revolver.probs.ADE.dpareto}
-\alias{revolver.probs.d}
-\alias{revolver.probs.de}
-\title{Measuring the driving force in evolving networks}
-\description{These functions assume a simple evolving network model and
-  measure the functional form of a so-called \emph{attractiveness
-    function} governing the evolution of the network.
-}
-\usage{
-evolver.d (nodes, kernel, outseq = NULL, outdist = NULL, m = 1, 
-           directed = TRUE)
-
-revolver.d (graph, niter=5, sd=FALSE, norm=FALSE,
-           cites=FALSE, expected=FALSE, error=TRUE, debug=numeric())
-revolver.ad (graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE, error=TRUE,
-            debug=matrix(ncol=2, nrow=0))
-revolver.ade (graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-             sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-             error=TRUE, debug=matrix(ncol=2, nrow=0))
-revolver.e (graph, cats, niter=5, st=FALSE,
-           sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-           error=TRUE, debug=numeric())
-revolver.de (graph, cats, niter=5,
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.l (graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-           sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-           error=TRUE, debug=numeric())
-revolver.dl (graph, niter=5, agebins=max(vcount(graph)/7100, 10),
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.el (graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.r (graph, window, niter=5, sd=FALSE, norm=FALSE,
-           cites=FALSE, expected=FALSE, error=TRUE, debug=numeric())
-revolver.ar (graph, window, niter=5, agebins=max(vcount(graph)/7100, 10),
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE, error=TRUE,
-            debug=matrix(ncol=2, nrow=0))
-revolver.di (graph, cats, niter=5,
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.adi (graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-             sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-             error=TRUE, debug=matrix(ncol=2, nrow=0))
-revolver.il (graph, cats, niter=5, agebins=max(vcount(graph)/7100, 10),
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.ir (graph, cats, window, niter=5,
-            sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-            error=TRUE, debug=numeric())
-revolver.air (graph, cats, window,
-             niter=5, agebins=max(vcount(graph)/7100, 10),
-             sd=FALSE, norm=FALSE, cites=FALSE, expected=FALSE,
-             error=TRUE, debug=matrix(ncol=2, nrow=0))
-revolver.d.d (graph, vtime = V(graph)$time, etime = E(graph)$time, niter = 5, 
-             sd = FALSE, norm = FALSE, cites = FALSE, expected = FALSE, 
-             error = TRUE, debug = matrix(ncol = 2, nrow = 0))
-revolver.p.p (graph, events = get.graph.attribute(graph, "events"), 
-             vtime = V(graph)$time, etime = E(graph)$time, niter = 5, sd = FALSE, 
-             norm = FALSE, cites = FALSE, expected = FALSE, error = TRUE, 
-             debug = matrix(ncol = 2, nrow = 0)) 
-revolver.error.d (graph, kernel)
-revolver.error.ad (graph, kernel)
-revolver.error.ade (graph, kernel, cats)
-revolver.error.adi (graph, kernel, cats)
-revolver.error.air (graph, kernel, cats, window)
-revolver.error.ar (graph, kernel, window)
-revolver.error.de (graph, kernel, cats)
-revolver.error.di (graph, kernel, cats)
-revolver.error.dl (graph, kernel)
-revolver.error.e (graph, kernel, cats)
-revolver.error.el (graph, kernel, cats)
-revolver.error.il (graph, kernel, cats)
-revolver.error.ir (graph, kernel, cats, window)
-revolver.error.l (graph, kernel)
-revolver.error.r (graph, kernel, window)
-
-revolver.ml.ade (graph, niter, cats, agebins = 300, delta = 1e-10,
-    filter = NULL)
-revolver.ml.d (graph, niter, delta = 1e-10, filter = NULL)
-revolver.ml.de (graph, niter, cats, delta = 1e-10, filter = NULL)
-revolver.ml.df (graph, niter, delta = 1e-10)
-revolver.ml.f (graph, niter, delta = 1e-10)
-revolver.ml.l (graph, niter, agebins = 300, delta = 1e-10)
-
-revolver.ml.AD.alpha.a.beta (graph, alpha, a, beta, abstol = 1e-08,
-    reltol = 1e-08, maxit = 1000, agebins = 300, filter = NULL)
-revolver.ml.AD.dpareto (graph, alpha, a, paralpha, parbeta, parscale,
-    abstol = 1e-08, reltol = 1e-08, maxit = 1000, agebins = 300, filter
-    = NULL)
-revolver.ml.ADE.alpha.a.beta (graph, cats, alpha, a, beta, coeffs,
-    abstol = 1e-08, reltol = 1e-08, maxit = 1000, agebins = 300, filter
-    = NULL)
-revolver.ml.ADE.dpareto (graph, cats, alpha, a, paralpha, parbeta, parscale, 
-    coeffs, abstol = 1e-08, reltol = 1e-08, maxit = 1000, agebins = 300, 
-    filter = NULL)
-revolver.ml.D.alpha (graph, alpha, abstol = 1e-08, reltol = 1e-08, maxit
-    = 1000, filter = NULL)
-revolver.ml.D.alpha.a (graph, alpha, a, abstol = 1e-08, reltol = 1e-08,
-    maxit = 1000, filter = NULL)
-revolver.ml.DE.alpha.a (graph, cats, alpha, a, coeffs, abstol = 1e-08,
-    reltol = 1e-08, maxit = 1000, filter = NULL)
-
-revolver.ml.AD.dpareto.eval (graph, alpha, a, paralpha, parbeta,
-    parscale, agebins = 300, filter = NULL) 
-revolver.ml.ADE.dpareto.eval (graph, cats, alpha, a, paralpha, parbeta,
-    parscale, coeffs, agebins = 300, filter = NULL) 
-revolver.ml.ADE.dpareto.evalf (graph, cats, par, agebins, filter = NULL)
-
-revolver.probs.ad (graph, kernel, ntk = FALSE)
-revolver.probs.ade (graph, kernel, cats)
-revolver.probs.d (graph, kernel, ntk = FALSE)
-revolver.probs.de (graph, kernel, cats)
-revolver.probs.ADE.dpareto (graph, par, cats, gcats, agebins)
-}
-\arguments{
-  \item{nodes}{The number of vertices in the generated network.}
-  \item{kernel}{The kernel function, a vector, matrix or array,
-    depending on the number of model parameters.}
-  \item{outseq}{The out-degree sequence, or \code{NULL} if no out-degree
-    sequence is used.}
-  \item{outdist}{The out-degree distribution, or \code{NULL} if all
-    vertices have the same out-degree. This argument is ignored if the
-    \code{outseq} argument is not \code{NULL}.}
-  \item{m}{Numeric scalar, the out-degree of the verticec. It is ignored
-    if at least one of \code{outseq} and \code{outdist} is not
-    \code{NULL}.}
-  \item{directed}{Logical scalar, whether to create a directed graph.}
-  \item{graph}{The input graph.}
-  \item{niter}{The number of iterations to perform.}
-  \item{sd}{Logical scalar, whether to return the standard deviation of
-    the estimates.}
-  \item{norm}{Logical scalar, whether to return the normalizing factors.}
-  \item{cites}{Logical scalar, whether to return the number of citations
-    to the different vertex types.}
-  \item{expected}{Logical scalar, whether to return the expected number
-    of citations for the different vertex types.}
-  \item{error}{Logical scalar, whether to return the error of the fit.}
-  \item{debug}{Currently not used.}
-  \item{agebins}{The number of bins for vertex age.}
-  \item{cats}{The number of categories to use.}
-  \item{window}{The width of the time window to use, measured in number
-    of vertices.}
-  \item{vtime}{Numeric vector, the time steps when the vertices where
-    added to the network.}
-  \item{etime}{Numeric vector, the time steps when the edges where added
-    to the network.}
-  \item{events}{A list of numeric vectors, each vector represents an
-    event, with the participation of the listed vertices.}
-  \item{delta}{Real scalar, the error margin that is allowed for the
-    convergence.}
-  \item{filter}{Logical vector, length is the number of vertices. Only
-    vertices corresponding to \code{TRUE} entries are used in the
-    fitting.}
-  \item{alpha}{Starting value for the \sQuote{\code{alpha}} parameter.}
-  \item{a}{Starting value for the \sQuote{\code{a}} parameter.}
-  \item{paralpha}{Starting value for the \sQuote{\code{paralpha}}
-    (Pareto alpha) parameter.}
-  \item{parbeta}{Starting value for the \sQuote{\code{parbeta}} (Pareto
-    beta) parameter.}
-  \item{parscale}{Starting value for the \sQuote{\code{parscale}}
-    (Pareto scale) parameter.}
-  \item{abstol}{Real scalar, absolute tolerance for the ML fitting.}
-  \item{reltol}{Real scalar, relative tolerance for the ML fitting.}
-  \item{maxit}{Numeric scalar, the maximum number of iterations.}
-  \item{beta}{Real scalar, starting value for the \sQuote{\code{beta}}
-    parameter.}
-  \item{coeffs}{Numeric vector, starting values for the coefficients.}
-  \item{par}{Pareto parameters for the different vertex types, in a
-    matrix.}
-  \item{ntk}{Logical scalar, whether to return the Ntk values.}
-  \item{gcats}{Numeric vector, the vertex types.}
-  \item{st}{Logical scalar, whether to return the S(t) values.}
-}
-\details{
-  The functions should be considered as experimental, so no
-  detailed documentation yet. Sorry.
-}
-\value{
-  A named list.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% seealso{}
-% \examples{}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/fastgreedy.community.Rd igraph-0.6.5/interfaces/R/igraph/man/fastgreedy.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/fastgreedy.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/fastgreedy.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-\name{fastgreedy.community}
-\alias{fastgreedy.community}
-\concept{Community structure}
-\concept{Fast greedy community detection}
-\title{Community structure via greedy optimization of modularity}
-\description{
-  This function tries to find dense subgraph, also called communities in
-  graphs via directly optimizing a modularity score.
-}
-\usage{
-fastgreedy.community(graph, merges=TRUE, modularity=TRUE,
-      membership=TRUE, weights=E(graph)$weight)
-}
-\arguments{
-  \item{graph}{The input graph}
-  \item{merges}{Logical scalar, whether to return the merge matrix.}
-  \item{modularity}{Logical scalar, whether to return a vector containing
-    the modularity after each merge.}
-  \item{membership}{Logical scalar, whether to calculate the membership
-    vector corresponding to the maximum modularity score, considering
-    all possible community structures along the merges.}
-  \item{weights}{If not \code{NULL}, then a numeric vector of edge
-    weights. The length must match the number of edges in the graph.
-    By default the \sQuote{\code{weight}} edge attribute is used as
-    weights. If it is not present, then all edges are considered to have
-    the same weight.
-  }
-}
-\details{
- This function implements the fast greedy modularity optimization
- algorithm for finding community structure, see 
- A Clauset, MEJ Newman, C Moore: Finding community structure in very
- large networks, http://www.arxiv.org/abs/cond-mat/0408187 for the
- details.
-}
-\value{
-  \code{fastgreedy.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{
-  A Clauset, MEJ Newman, C Moore: Finding community structure in very
-  large networks, http://www.arxiv.org/abs/cond-mat/0408187
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R interface.
-}
-\seealso{
-  \code{\link{communities}} for extracting the results.
-  
-  See also \code{\link{walktrap.community}},
-  \code{\link{spinglass.community}},
-  \code{\link{leading.eigenvector.community}} and 
-  \code{\link{edge.betweenness.community}} for other methods.
-}
-\examples{
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-fc <- fastgreedy.community(g)
-membership(fc)
-sizes(fc)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/forest.fire.game.Rd igraph-0.6.5/interfaces/R/igraph/man/forest.fire.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/forest.fire.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/forest.fire.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,79 +0,0 @@
-\name{forest.fire.game}
-\alias{forest.fire.game}
-\concept{Random graph model}
-\concept{Forest fire model}
-\title{Forest Fire Network Model}
-\description{This is a growing network model, which resembles of how the
-  forest fire spreads by igniting trees close by.}
-\usage{
-forest.fire.game (nodes, fw.prob, bw.factor = 1, ambs = 1, directed = TRUE)
-}
-\arguments{
-  \item{nodes}{The number of vertices in the graph.}
-  \item{fw.prob}{The forward burning probability, see details below.}
-  \item{bw.factor}{The backward burning ratio. The backward burning
-    probability is calculated as \code{bw.factor*fw.prob}.}
-  \item{ambs}{The number of ambassador vertices.}
-  \item{directed}{Logical scalar, whether to create a directed graph.}
-}
-\details{
-  The forest fire model intends to reproduce the following network
-  characteristics, observed in real networks:
-  \itemize{
-    \item Heavy-tailed in-degree distribution. 
-    \item Heavy-tailed out-degree distribution.
-    \item Communities.
-    \item Densification power-law. The network is densifying in time,
-      according to a power-law rule.
-    \item Shrinking diameter. The diameter of the network decreases in
-      time.
-  }
-
-  The network is generated in the following way. One vertex is added at
-  a time. This vertex connects to (cites) \code{ambs} vertices already
-  present in the network, chosen uniformly random. Now, for each cited
-  vertex \eqn{v} we do the following procedure:
-  \enumerate{
-    \item We generate two random number, \eqn{x} and \eqn{y}, that are
-      geometrically distributed with means \eqn{p/(1-p)} and
-      \eqn{rp(1-rp)}. (\eqn{p} is \code{fw.prob}, \eqn{r} is
-      \code{bw.factor}.) The new vertex cites \eqn{x} outgoing neighbors
-      and \eqn{y} incoming neighbors of \eqn{v}, from those which are
-      not yet cited by the new vertex. If there are less than \eqn{x} or
-      \eqn{y} such vertices available then we cite all of them.
-    \item The same procedure is applied to all the newly cited
-      vertices.
-  }
-}
-\note{
-  The version of the model in the published paper is incorrect
-  in the sense that it cannot generate the kind of graphs the authors
-  claim. A corrected version is available from
-  \url{http://www.cs.cmu.edu/~jure/pubs/powergrowth-tkdd.pdf}, our
-  implementation is based on this.
-}
-\value{A simple graph, possibly directed if the \code{directed} argument
-  is \code{TRUE}.}
-\references{
-  Jure Leskovec, Jon Kleinberg and Christos Faloutsos. Graphs over time:
-  densification laws, shrinking diameters and possible explanations.
-  \emph{KDD '05: Proceeding of the eleventh ACM SIGKDD international
-    conference on Knowledge discovery in data mining}, 177--187, 2005.
-}
-\author{
-  Gabor Csardi \email{csardi.gabor@gmail.com}
-}
-\seealso{
-  \code{\link{barabasi.game}} for the basic preferential attachment
-  model.
-}
-\examples{
-g <- forest.fire.game(10000, fw.prob=0.37, bw.factor=0.32/0.37)
-dd1 <- degree.distribution(g, mode="in")
-dd2 <- degree.distribution(g, mode="out")
-if (interactive()) {
-  plot(seq(along=dd1)-1, dd1, log="xy")
-  points(seq(along=dd2)-1, dd2, col=2, pch=2)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.adjlist.Rd igraph-0.6.5/interfaces/R/igraph/man/get.adjlist.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.adjlist.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/get.adjlist.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-\name{get.adjlist}
-\alias{get.adjlist}
-\alias{get.adjedgelist}
-\concept{Adjacency list}
-\title{Adjacency lists}
-\description{Create adjacency lists from a graph, either for adjacent
-  edges or for neighboring vertices
-}
-\usage{
-get.adjlist(graph, mode = c("all", "out", "in", "total"))
-get.adjedgelist(graph, mode = c("all", "out", "in", "total"))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{mode}{Character scalar, it gives what kind of adjacent
-    edges/vertices to include in the lists. \sQuote{\code{out}} is for
-    outgoing edges/vertices, \sQuote{\code{in}} is for incoming
-    edges/vertices, \sQuote{\code{all}} is for both. This argument is
-    ignored for undirected graphs.}
-}
-\details{
-  \code{get.adjlist} returns a list of numeric vectors, which include
-  the ids of neighbor vertices (according to the \code{mode} argument) of all
-  vertices.
-
-  \code{get.adjedgelist} returns a list of numeric vectors, which
-  include the ids of adjacent edgs (according to the \code{mode}
-  argument) of all vertices.
-}
-\value{
-  A list of numeric vectors.
-}
-%\references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{get.edgelist}}, \code{\link{get.adjacency}}}
-\examples{
-g <- graph.ring(10)
-get.adjlist(g)
-get.adjedgelist(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.edge.ids.Rd igraph-0.6.5/interfaces/R/igraph/man/get.edge.ids.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.edge.ids.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/get.edge.ids.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-\name{get.edge.ids}
-\alias{get.edge.ids}
-\title{Find the edge ids based on the incident vertices of the edges}
-\description{
-  Find the edges in an igraph graph that have the specified end
-  points. This function handles multi-graph (graphs with multiple edges)
-  and can consider or ignore the edge directions in directed graphs.
-}
-\usage{
-get.edge.ids(graph, vp, directed = TRUE, error = FALSE, multi = FALSE)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{vp}{The indicent vertices, given as vertex ids or symbolic
-    vertex names. They are interpreted pairwise, i.e. the first and
-    second are used for the first edge, the third and fourth for the
-    second, etc.}
-  \item{directed}{Logical scalar, whether to consider edge directions in
-    directed graphs. This argument is ignored for undirected graphs.}
-  \item{error}{Logical scalar, whether to report an error if an edge is
-    not found in the graph. If \code{FALSE}, then no error is reported,
-    and zero is returned for the non-existant edge(s).}
-  \item{multi}{Logical scalar, whether to handle multiple edges
-    properly. If \code{FALSE}, and a pair of vertices are given twice
-    (or more), then always the same edge id is reported back for
-    them. If \code{TRUE}, then the edge ids of multiple edges are
-    correctly reported.}
-}
-\details{
-  igraph vertex ids are natural numbers, starting from one, up to the
-  number of vertices in the graph. Similarly, edges are also numbered
-  from one, up to the number of edges.
-
-  This function allows finding the edges of the graph, via their
-  incident vertices.
-}
-\value{A numeric vector of edge ids, one for each pair of input
-  vertices. If there is no edge in the input graph for a given pair of
-  vertices, then zero is reported. (If the \code{error} argument is
-  \code{FALSE}.) }
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-g <- graph.ring(10)
-ei <- get.edge.ids(g, c(1,2, 4,5))
-E(g)[ei]
-
-## non-existant edge
-get.edge.ids(g, c(2,1, 1,4, 5,4))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.incidence.Rd igraph-0.6.5/interfaces/R/igraph/man/get.incidence.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/get.incidence.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/get.incidence.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-\name{get.incidence}
-\alias{get.incidence}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\concept{Incidence matrix}
-\title{Incidence matrix of a bipartite graph}
-\description{This function can return a sparse or dense incidence matrix
-of a bipartite network. The incidence matrix is an \eqn{n} times \eqn{m}
-matrix, \eqn{n} and \eqn{m} are the number of vertices of the two kinds.}
-\usage{
-get.incidence(graph, types=NULL, attr=NULL, names=TRUE, sparse=FALSE)
-}
-\arguments{
-  \item{graph}{The input graph. The direction of the edges is ignored in
-  directed graphs.}
-  \item{types}{An optional vertex type vector to use instead of the
-    \code{type} vertex attribute. You must supply this argument
-    if the graph has no \code{type} vertex attribute.}
-  \item{attr}{Either \code{NULL} or a character string giving an edge
-    attribute name. If \code{NULL}, then a traditional incidence matrix is
-    returned. If not \code{NULL} then the values of the given edge
-    attribute are included in the incidence matrix. If the graph has
-    multiple edges, the edge attribute of an arbitrarily chosen edge
-    (for the multiple edges) is included.}
-  \item{names}{Logical scalar, if \code{TRUE} and the vertices in the
-    graph are named (i.e. the graph has a vertex attribute called
-    \code{name}), then vertex names will be added to the result
-    as row and column names. Otherwise the ids of the vertices are used
-    as row and column names.}
-  \item{sparse}{Logical scalar, if it is \code{TRUE} then a sparse
-    matrix is created, you will need the \code{Matrix} package for this.}
-}
-\details{
-  Bipartite graphs have a \code{type} vertex attribute in
-  igraph, this is boolean and \code{FALSE} for the vertices of the first
-  kind and \code{TRUE} for vertices of the second kind.
-}
-\value{
-  A sparse or dense matrix.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{\code{\link{graph.incidence}} for the opposite operation.}
-\examples{
-g <- graph.bipartite( c(0,1,0,1,0,0), c(1,2,2,3,3,4) )
-get.incidence(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/girth.Rd igraph-0.6.5/interfaces/R/igraph/man/girth.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/girth.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/girth.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,55 +0,0 @@
-\name{girth}
-\alias{girth}
-\concept{Girth}
-\title{Girth of a graph}
-\description{The girth of a graph is the length of the shortest circle
-  in it.}
-\usage{
-girth(graph, circle=TRUE)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but the algorithm
-    searches for undirected circles anyway.}
-  \item{circle}{Logical scalar, whether to return the shortest circle
-    itself.}
-}
-\details{
-  The current implementation works for undirected graphs only, 
-  directed graphs are treated as undirected graphs. Loop edges and
-  multiple edges are ignored.
-  If the graph is a forest (ie. acyclic), then zero is returned.
-
-  This implementation is based on Alon Itai and Michael Rodeh:
-  Finding a minimum circuit in a graph
-  \emph{Proceedings of the ninth annual ACM symposium on Theory of
-    computing}, 1-10, 1977. The first implementation of this
-  function was done by Keith Briggs, thanks Keith.
-}
-\value{
-  A named list with two components:
-  \item{girth}{Integer constant, the girth of the graph, or 0 if the
-    graph is acyclic.}
-  \item{circle}{Numeric vector with the vertex ids in the shortest
-    circle.}
-}
-\references{
-  Alon Itai and Michael Rodeh: Finding a minimum circuit in a graph 
-  \emph{Proceedings of the ninth annual ACM symposium on Theory of 
-    computing}, 1-10, 1977
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-# No circle in a tree
-g <- graph.tree(1000, 3)
-girth(g)
-
-# The worst case running time is for a ring
-g <- graph.ring(100)
-girth(g)
-
-# What about a random graph?
-g <- erdos.renyi.game(1000, 1/1000)
-girth(g)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.adjacency.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.adjacency.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.adjacency.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.adjacency.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,156 +0,0 @@
-\name{graph.adjacency}
-\alias{graph.adjacency}
-\concept{Adjacency matrix}
-\concept{Sparse matrix}
-\title{Create graphs from adjacency matrices}
-\description{\code{graph.adjacency} is a flexible function for creating
-  \code{igraph} graphs from adjacency matrices.}
-\usage{
-graph.adjacency(adjmatrix, mode=c("directed", "undirected", "max",
-        "min", "upper", "lower", "plus"), weighted=NULL, diag=TRUE,
-        add.colnames=NULL, add.rownames=NA)
-}
-\arguments{
-  \item{adjmatrix}{A square adjacency matrix. From igraph version 0.5.1
-    this can be a sparse matrix created with the \code{Matrix} package.}
-  \item{mode}{
-    Character scalar, specifies how igraph should interpret the supplied
-    matrix. See also the \code{weighted} argument, the interpretation
-    depends on that too. Possible values are: \code{directed},
-    \code{undirected}, \code{upper}, \code{lower}, \code{max},
-    \code{min}, \code{plus}. See details below.
-  }
-  \item{weighted}{This argument specifies whether to create a weighted
-    graph from an adjacency matrix. If it is \code{NULL} then an
-    unweighted graph is created and the elements of the adjacency matrix
-    gives the number of edges between the vertices. If it is a character
-    constant then for every non-zero matrix entry an edge is created and
-    the value of the entry is added as an edge attribute named by the
-    \code{weighted} argument. If it is \code{TRUE} then a weighted graph
-    is created and the name of the edge attribute will be
-    \code{weight}. See also details below.
-  }
-  \item{diag}{Logical scalar, whether to include the diagonal of the
-    matrix in the calculation. If this is \code{FALSE} then the diagonal
-    is zerod out first.
-  }
-  \item{add.colnames}{Character scalar, whether to add the column names as
-    vertex attributes. If it is \sQuote{\code{NULL}} (the default)
-    then, if present, column names are added as vertex attribute
-    \sQuote{name}. If \sQuote{\code{NA}} then they will not be added.
-    If a character constant, then it gives the name of the vertex
-    attribute to add.}
-  \item{add.rownames}{Character scalar, whether to add the row names as
-    vertex attributes. Possible values the same as the previous
-    argument. By default row names are not added. If
-    \sQuote{\code{add.rownames}} and \sQuote{\code{add.colnames}} specify the
-    same vertex attribute, then the former is ignored. }
-}
-\details{
-  \code{graph.adjacency} creates a graph from an adjacency matrix.
-
-  The order of the vertices are preserved, i.e. the vertex corresponding
-  to the first row will be vertex 0 in the graph, etc.
-
-  \code{graph.adjacency} operates in two main modes, depending on the
-  \code{weighted} argument.
-
-  If this argument is \code{NULL} then an unweighted graph is
-  created and an element of the adjacency matrix gives the number
-  of edges to create between the two corresponding vertices.
-  The details depend on the value of the \code{mode} argument:
-  \describe{
-    \item{\code{directed}}{The graph will be directed and a matrix
-      element gives the number of edges between two vertices.}
-    \item{\code{undirected}}{This is exactly the same as \code{max},
-      for convenience. Note that it is \emph{not} checked whether the
-      matrix is symmetric.} 
-    \item{\code{max}}{An undirected graph will be created and
-      \code{max(A(i,j), A(j,i))} gives the number of edges.}
-    \item{\code{upper}}{An undirected graph will be created, only the
-      upper right triangle (including the diagonal) is used for the
-      number of edges.}
-    \item{\code{lower}}{An undirected graph will be created, only the
-      lower left triangle (including the diagonal) is used for
-      creating the edges.}
-    \item{\code{min}}{undirected graph will be created with
-      \code{min(A(i,j), A(j,i))} edges between vertex \code{i} and
-      \code{j}.}
-    \item{\code{plus}}{ undirected graph will be created with
-      \code{A(i,j)+A(j,i)} edges between vertex \code{i} and
-      \code{j}.}  
-  }
-
-  If the \code{weighted} argument is not \code{NULL} then the elements
-  of the matrix give the weights of the edges (if they are not zero).
-  The details depend on the value of the \code{mode} argument:
-  \describe{
-    \item{\code{directed}}{The graph will be directed and a matrix
-      element gives the edge weights.}
-    \item{\code{undirected}}{First we check that the matrix is
-      symmetric. It is an error if not. Then only the upper triangle is
-      used to create a weighted undirected graph.}
-    \item{\code{max}}{An undirected graph will be created and
-      \code{max(A(i,j), A(j,i))} gives the edge weights.}
-    \item{\code{upper}}{An undirected graph will be created, only the
-      upper right triangle (including the diagonal) is used (for the
-      edge weights).}
-    \item{\code{lower}}{An undirected graph will be created, only the
-      lower left triangle (including the diagonal) is used for
-      creating the edges.}
-    \item{\code{min}}{An undirected graph will be created,
-      \code{min(A(i,j), A(j,i))} gives the edge weights.}
-    \item{\code{plus}}{An undirected graph will be created,
-      \code{A(i,j)+A(j,i)} gives the edge weights.}
-  }
-  
-}
-\value{
-  An igraph graph object.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\link{graph} and \code{\link{graph.formula}} for
-  other ways to create graphs.
-}
-\examples{
-adjm <- matrix(sample(0:1, 100, replace=TRUE, prob=c(0.9,0.1)), nc=10)
-g1 <- graph.adjacency( adjm )
-adjm <- matrix(sample(0:5, 100, replace=TRUE,
-                      prob=c(0.9,0.02,0.02,0.02,0.02,0.02)), nc=10)
-g2 <- graph.adjacency(adjm, weighted=TRUE)
-E(g2)$weight
-
-## various modes for weighted graphs, with some tests
-nzs <- function(x) sort(x [x!=0])
-adjm <- matrix(runif(100), 10)
-adjm[ adjm<0.5 ] <- 0
-g3 <- graph.adjacency((adjm + t(adjm))/2, weighted=TRUE,
-                      mode="undirected") 
-
-g4 <- graph.adjacency(adjm, weighted=TRUE, mode="max")
-all(nzs(pmax(adjm, t(adjm))[upper.tri(adjm)]) == sort(E(g4)$weight))
-
-g5 <- graph.adjacency(adjm, weighted=TRUE, mode="min")
-all(nzs(pmin(adjm, t(adjm))[upper.tri(adjm)]) == sort(E(g5)$weight))
-
-g6 <- graph.adjacency(adjm, weighted=TRUE, mode="upper")
-all(nzs(adjm[upper.tri(adjm)]) == sort(E(g6)$weight))
-
-g7 <- graph.adjacency(adjm, weighted=TRUE, mode="lower")
-all(nzs(adjm[lower.tri(adjm)]) == sort(E(g7)$weight))
-
-g8 <- graph.adjacency(adjm, weighted=TRUE, mode="plus")
-d2 <- function(x) { diag(x) <- diag(x)/2; x }
-all(nzs((d2(adjm+t(adjm)))[lower.tri(adjm)]) == sort(E(g8)$weight))
-
-g9 <- graph.adjacency(adjm, weighted=TRUE, mode="plus", diag=FALSE)
-d0 <- function(x) { diag(x) <- 0 }
-all(nzs((d0(adjm+t(adjm)))[lower.tri(adjm)]) == sort(E(g9)$weight))
-
-## row/column names
-rownames(adjm) <- sample(letters, nrow(adjm))
-colnames(adjm) <- seq(ncol(adjm))
-g10 <- graph.adjacency(adjm, weighted=TRUE, add.rownames="code")
-summary(g10)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.adjlist.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.adjlist.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.adjlist.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.adjlist.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-\name{Graphs from adjacency lists}
-\alias{graph.adjlist}
-\title{Create graphs from adjacency lists}
-\description{An adjacency list is a list of numeric vectors, containing
-  the neighbor vertices for each vertex. This function creates an igraph
-  graph object from such a list.
-}
-\usage{
-graph.adjlist(adjlist, mode = c("out", "in", "all", "total"),
-              duplicate = TRUE)
-}
-\arguments{
-  \item{adjlist}{The adjacency list. It should be consistent, i.e. the
-    maximum throughout all vectors in the list must be less than the
-    number of vectors (=the number of vertices in the graph). Note that
-    the list is expected to be 0-indexed.}
-  \item{mode}{Character scalar, it specifies whether the graph to create
-    is undirected (\sQuote{all} or \sQuote{total}) or directed; and in
-    the latter case, whether it contains the outgoing (\sQuote{out}) or
-    the incoming (\sQuote{in}) neighbors of the vertices.}
-  \item{duplicate}{Logical scalar. For undirected graphs it gives
-    whether edges are included in the list twice. E.g. if it is
-    \code{TRUE} then for an undirected \code{{A,B}} edge
-    \code{graph.adjlist} expects \code{A} included in the neighbors of
-    \code{B} and \code{B} to be included in the neighbors of \code{A}.
-
-    This argument is ignored if \code{mode} is \code{out} or \code{in}.
-  }
-}
-\details{
-  Adjacency lists are handy if you intend to do many (small)
-  modifications to a graph. In this case adjacency lists are more
-  efficient than igraph graphs.
-
-  The idea is that you convert your graph to an adjacency list by
-  \code{\link{get.adjlist}}, do your modifications to the graphs and
-  finally create again an igraph graph by calling \code{graph.adjlist}.
-}
-\value{
-  An igraph graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{get.edgelist}} }
-\examples{
-## Directed
-g <- graph.ring(10, dir=TRUE)
-al <- get.adjlist(g, mode="out")
-g2 <- graph.adjlist(al)
-graph.isomorphic(g, g2)
-
-## Undirected
-g <- graph.ring(10)
-al <- get.adjlist(g)
-g2 <- graph.adjlist(al, mode="all")
-graph.isomorphic(g, g2)
-ecount(g2)
-g3 <- graph.adjlist(al, mode="all", duplicate=FALSE)
-ecount(g3)
-is.multiple(g3)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.automorphisms.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.automorphisms.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.automorphisms.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.automorphisms.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-\name{graph.automorphisms}
-\alias{graph.automorphisms}
-\concept{Graph automorphism}
-\title{Number of automorphisms}
-\description{Calculate the number of automorphisms of a graph,
-  i.e. the number of isomorphisms to itself.}
-\usage{
-graph.automorphisms(graph, sh="fm")
-}
-\arguments{
-  \item{graph}{The input graph, it is treated as undirected.}
-  \item{sh}{The splitting heuristics for the BLISS algorithm. Possible
-    values are: \sQuote{\code{f}}: first non-singleton cell,
-    \sQuote{\code{fl}}: first largest non-singleton cell,
-    \sQuote{\code{fs}}: first smallest non-singleton cell,
-    \sQuote{\code{fm}}: first maximally non-trivially connected
-    non-singleton cell, \sQuote{\code{flm}}: first largest maximally
-    non-trivially connected non-singleton cell, \sQuote{\code{fsm}}:
-    first smallest maximally non-trivially connected non-singleton
-    cell.}
-}
-\details{
-  An automorphism of a graph is a permutation of its vertices which
-  brings the graph into itself.
-
-  This function calculates the number of automorphism of a graph using
-  the BLISS algorithm. See also the BLISS homepage at 
-  \url{http://www.tcs.hut.fi/Software/bliss/index.html}.
-}
-\value{
-  A named list with the following members:
-  \item{group_size}{The size of the automorphism group of the
-    input graph, as a string. This number is exact if igraph was
-    compiled with the GMP library, and approximate otherwise.}
-  \item{nof_nodes}{The number of nodes in the search tree.}
-  \item{nof_leaf_nodes}{The number of leaf nodes in the search
-    tree.}
-  \item{nof_bad_nodes}{Number of bad nodes.}
-  \item{nof_canupdates}{Number of canrep updates.}
-  \item{max_level}{Maximum level.}
-}
-\references{
-  Tommi Junttila and Petteri Kaski: Engineering an Efficient Canonical
-  Labeling Tool for Large and Sparse Graphs, \emph{Proceedings of the
-    Ninth Workshop on Algorithm Engineering and Experiments and the
-    Fourth Workshop on Analytic Algorithms and Combinatorics.} 2007.
-}
-\author{ Tommi Juntilla \email{google@for.it} for BLISS and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the igraph glue code and this manual
-  page.} 
-\seealso{\code{\link{canonical.permutation}}, \code{\link{permute.vertices}}}
-\examples{
-## A ring has n*2 automorphisms, you can "turn" it by 0-9 vertices
-## and each of these graphs can be "flipped"
-g <- graph.ring(10)
-graph.automorphisms(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.bfs.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.bfs.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.bfs.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.bfs.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,113 +0,0 @@
-\name{graph.bfs}
-\alias{graph.bfs}
-\title{Breadth-first search}
-\description{Breadth-first search is an algorithm to traverse a
-  graph. We start from a root vertex and spread along every edge
-  \dQuote{simultaneously}. }
-\usage{
-graph.bfs (graph, root, neimode = c("out", "in", "all", "total"), 
-    unreachable = TRUE, restricted = NULL, order = TRUE,
-    rank = FALSE, father = FALSE, pred = FALSE, succ = FALSE,
-    dist = FALSE, callback = NULL, extra = NULL, 
-    rho = parent.frame()) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{root}{Numeric vector, usually of length one. The root vertex, or
-    root vertices to start the search from.}
-  \item{neimode}{For directed graphs specifies the type of edges to
-    follow. \sQuote{out} follows outgoing, \sQuote{in} incoming
-    edges. \sQuote{all} ignores edge directions
-    completely. \sQuote{total} is a synonym for \sQuote{all}. This
-    argument is ignored for undirected graphs.}
-  \item{unreachable}{Logical scalar, whether the search should visit
-    the vertices that are unreachable from the given root
-    vertex (or vertices). If \code{TRUE}, then additional searches are
-    performed until all vertices are visited.}
-  \item{restricted}{\code{NULL} (=no restriction), or a vector of
-    vertices (ids or symbolic names). In the latter case, the search is
-    restricted to the given vertices.}
-  \item{order}{Logical scalar, whether to return the ordering of the
-    vertices.}
-  \item{rank}{Logical scalar, whether to return the rank of the
-    vertices.}
-  \item{father}{Logical scalar, whether to return the father of the
-    vertices.}
-  \item{pred}{Logical scalar, whether to return the predecessors of the
-    vertices.}
-  \item{succ}{Logical scalar, whether to return the successors of the
-    vertices.}
-  \item{dist}{Logical scalar, whether to return the distance from the
-    root of the search tree.}
-  \item{callback}{If not \code{NULL}, then it must be callback
-    function. This is called whenever a vertex is visited. See details
-    below.}
-  \item{extra}{Additional argument to supply to the callback function.}
-  \item{rho}{The environment in which the callback function is
-    evaluated.}
-}
-\details{
-  
-  The callback function must have the following arguments:
-  \describe{
-    \item{graph}{The input graph is passed to the callback function
-      here.}
-    \item{data}{A named numeric vector, with the following entries:
-      \sQuote{vid}, the vertex that was just visited, \sQuote{pred}, its
-      predecessor, \sQuote{succ}, its successor, \sQuote{rank}, the rank
-      of the current vertex, \sQuote{dist}, its distance from the root
-      of the search tree.}
-    \item{extra}{The extra argument.}
-  }
-  See examples below on how to use the callback function.
-}
-\value{
-  A named list with the following entries:
-  \item{root}{Numeric scalar. The root vertex that was used as the
-    starting point of the search.}
-  \item{neimode}{Character scalar. The \code{neimode} argument of the
-    function call. Note that for undirected graphs this is always
-    \sQuote{all}, irrespectively of the supplied value.}
-  \item{order}{Numeric vector. The vertex ids, in the order in which
-    they were visited by the search.}
-  \item{rank}{Numeric vector. The rank for each vertex.}
-  \item{father}{Numeric vector. The father of each vertex, i.e. the
-    vertex it was discovered from.}
-  \item{pred}{Numeric vector. The previously visited vertex for each
-    vertex, or 0 if there was no such vertex.}
-  \item{succ}{Numeric vector. The next vertex that was visited after the
-    current one, or 0 if there was no such vertex.}
-  \item{dist}{Numeric vector, for each vertex its distance from the root
-    of the search tree.}
-  
-  Note that \code{order}, \code{rank}, \code{father}, \code{pred},
-  \code{succ} and \code{dist} might be \code{NULL} if their
-  corresponding argument is \code{FALSE}, i.e. if their calculation is
-  not requested.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{ \code{\link{graph.dfs}} for depth-first search.}
-\examples{
-## Two rings
-graph.bfs(graph.ring(10) \%du\% graph.ring(10), root=1, "out",
-          order=TRUE, rank=TRUE, father=TRUE, pred=TRUE,
-          succ=TRUE, dist=TRUE)
-
-## How to use a callback
-f <- function(graph, data, extra) {
-  print(data)
-  FALSE
-}
-tmp <- graph.bfs(graph.ring(10) \%du\% graph.ring(10), root=1, "out",
-                 callback=f)
-
-## How to use a callback to stop the search
-## We stop after visiting all vertices in the initial component
-f <- function(graph, data, extra) {
- data['succ'] == -1
-}
-graph.bfs(graph.ring(10) \%du\% graph.ring(10), root=1, callback=f)
-
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.bipartite.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.bipartite.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.bipartite.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.bipartite.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-\name{graph.bipartite}
-\alias{graph.bipartite}
-\alias{is.bipartite}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\title{Create a bipartite graph}
-\description{A bipartite graph has two kinds of vertices and connections
-  are only allowed between different kinds.
-}
-\usage{
-graph.bipartite(types, edges, directed=FALSE)
-is.bipartite(graph)
-}
-\arguments{
-  \item{types}{A vector giving the vertex types. It will be coerced into
-  boolean. The length of the vector gives the number of vertices in the
-  graph.}
-  \item{edges}{A vector giving the edges of the graph, the same way as
-    for the regular \code{\link{graph}} function. It is checked that the
-    edges indeed connect vertices of different kind, accoding to the
-    supplied \code{types} vector.}
-  \item{directed}{Whether to create a directed graph, boolean
-    constant. Note that by default undirected graphs are created, as
-    this is more common for bipartite graphs.}
-  \item{graph}{The input graph.}
-}
-\details{
-  Bipartite graphs have a \code{type} vertex attribute in
-  igraph, this is boolean and \code{FALSE} for the vertices of the first
-  kind and \code{TRUE} for vertices of the second kind.
-
-  \code{graph.bipartite} basically does three things. First it checks
-  tha \code{edges} vector against the vertex \code{types}. Then it
-  creates a graph using the \code{edges} vector and finally it adds the
-  \code{types} vector as a vertex attribute called \code{type}.
-
-  \code{is.bipartite} checks whether the graph is bipartite or not. It
-  just checks whether the graph has a vertex attribute called
-  \code{type}.
-}
-\value{
-  \code{graph.bipartite} returns a bipartite igraph graph. In other
-  words, an igraph graph that has a vertex attribute named \code{type}.
-
-  \code{is.bipartite} returns a logical scalar.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph}} to create one-mode networks}
-\examples{
-g <- graph.bipartite( rep(0:1,length=10), c(1:10))
-print(g, v=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.constructors.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.constructors.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.constructors.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.constructors.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,176 +0,0 @@
-\name{graph.constructors}
-\alias{graph.constructors}
-\alias{graph.empty}
-\alias{graph}
-\alias{graph.star}
-\alias{graph.lattice}
-\alias{graph.ring}
-\alias{graph.tree}
-\alias{graph.full}
-\alias{graph.full.citation}
-\alias{graph.atlas}
-\alias{graph.edgelist}
-\alias{graph.extended.chordal.ring}
-\concept{Tree}
-\concept{Lattice}
-\concept{Star graph}
-\concept{Graph Atlas}
-\concept{Empty graph}
-\concept{Full graph}
-\title{Various methods for creating graphs}
-\description{These method can create various (mostly regular) graphs:
-  empty graphs, graphs with the given edges, graphs from adjacency
-  matrices, star graphs, lattices, rings, trees.}
-\usage{
-graph.empty(n=0, directed=TRUE)
-graph(edges, n=max(edges), directed=TRUE)
-graph.star(n, mode = c("in", "out", "mutual", "undirected"), center = 1)
-graph.lattice(dimvector = NULL, length = NULL, dim = NULL, nei = 1,
-              directed = FALSE, mutual = FALSE, circular = FALSE, \dots)
-graph.ring(n, directed = FALSE, mutual = FALSE, circular=TRUE)
-graph.tree(n, children = 2, mode=c("out", "in", "undirected"))
-graph.full(n, directed = FALSE, loops = FALSE)
-graph.full.citation(n, directed = TRUE)
-graph.atlas(n)
-graph.edgelist(el, directed=TRUE)
-graph.extended.chordal.ring(n, w)
-}
-\arguments{
-  \item{edges}{Numeric vector defining the edges, the first edge points
-    from the first element to the second, the second edge from the third
-  to the fourth, etc.}
-  \item{directed}{Logical, if TRUE a directed graph will be
-    created. Note that for while most constructors the default is TRUE,
-    for \code{graph.lattice} and \code{graph.ring} it is FALSE. For
-    \code{graph.star} the \code{mode} argument should be used for
-    creating an undirected graph.}
-  \item{n}{The number of vertices in the graph for most functions.
-
-    For \code{graph} this parameter is ignored if there is a bigger
-    vertex id in \code{edges}. This means that for this function it is
-    safe to supply zero here if the vertex with the largest id is not an
-    isolate.
-
-    For \code{graph.atlas} this is the number (id) of the graph to
-    create. 
-  }
-  \item{mode}{
-    For \code{graph.star} it defines the direction of the
-    edges, \code{in}: the edges point \emph{to} the center, \code{out}:
-    the edges point \emph{from} the center, \code{mutual}: a directed
-    star is created with mutual edges, \code{undirected}: the edges
-    are undirected.
-
-    For \code{igraph.tree} this parameter defines the direction of the
-    edges. \code{out} indicates that the edges point from the parent to
-    the children, \code{in} indicates that they point from the children
-    to their parents, while \code{undirected} creates an undirected
-    graph. 
-  }
-  \item{center}{For \code{graph.star} the center vertex of the graph, by
-    default the first vertex.}
-  \item{dimvector}{A vector giving the size of the lattice in each
-    dimension, for \code{graph.lattice}.}
-  \item{nei}{The distance within which (inclusive) the neighbors on the
-    lattice will be connected. This parameter is not used right now.}
-  \item{mutual}{Logical, if TRUE directed lattices will be mutually
-    connected.} 
-  \item{circular}{Logical, if TRUE the lattice or ring will be circular.}
-  \item{length}{Integer constant, for regular lattices, the size of the
-    lattice in each dimension.}
-  \item{dim}{Integer constant, the dimension of the lattice.}
-  \item{children}{Integer constant, the number of children of a vertex
-    (except for leafs) for \code{graph.tree}.}
-  \item{loops}{If TRUE also loops edges (self edges) are added.}
-  \item{graph}{An object.}
-  \item{el}{An edge list, a two column matrix, character or numeric. See
-    details below.}
-  \item{w}{A matrix which specifies the extended chordal ring. See
-    details below.}
-  \item{\dots}{Currently ignored.}
-}
-\details{All these functions create graphs in a deterministic way.
-
-  \code{graph.empty} is the simplest one, this creates an empty graph.
-
-  \code{graph} creates a graph with the given edges.
-
-  \code{graph.star} creates a star graph, in this every single vertex is
-  connected to the center vertex and nobody else.
-
-  \code{graph.lattice} is a flexible function, it can create lattices of
-  arbitrary dimensions, periodic or unperiodic ones. It has two
-  forms. In the first form you only supply \code{dimvector}, but not
-  \code{length} and \code{dim}. In the second form you omit
-  \code{dimvector} and supply \code{length} and \code{dim}.
-
-  \code{graph.ring} is actually a special case of \code{graph.lattice},
-  it creates a one dimensional circular lattice.
-
-  \code{graph.tree} creates regular trees.
-
-  \code{graph.full} simply creates full graphs.
-
-  \code{graph.full.citation} creates a full citation graph. This is a
-  directed graph, where every i->j edge is present if and only if j<i.
-  If \code{directed=FALSE} then the graph is just a full graph.
-  
-  \code{graph.atlas} creates graphs from the book An Atlas of Graphs by
-  Roland C. Read and Robin J. Wilson. The atlas contains all undirected
-  graphs with up to seven vertices, numbered from 0 up to 1252. The
-  graphs are listed: 
-  \enumerate{
-    \item in increasing order of number of nodes;
-    \item for a fixed number of nodes, in increasing order of the number
-      of edges;
-    \item for fixed numbers of nodes and edges, in increasing order of
-      the degree sequence, for example 111223 < 112222;
-    \item for fixed degree sequence, in increasing number of
-      automorphisms.
-  }
-
-  \code{graph.edgelist} creates a graph from an edge list. Its argument
-  is a two-column matrix, each row defines one edge. If it is 
-  a numeric matrix then its elements are interpreted as vertex ids. If
-  it is a character matrix then it is interpreted as symbolic vertex
-  names and a vertex id will be assigned to each name, and also a
-  \code{name} vertex attribute will be added.
-  
-  \code{graph.extended.chordal.ring} creates an extended chordal ring.
-  An extended chordal ring is regular graph, each node has the same
-  degree. It can be obtained from a simple ring by adding some extra
-  edges specified by a matrix. Let p denote the number of columns in
-  the \sQuote{\code{W}} matrix. The extra edges of vertex \code{i}
-  are added according to column \code{i mod p} in
-  \sQuote{\code{W}}. The number of extra edges is the number
-  of rows in \sQuote{\code{W}}: for each row \code{j} an edge
-  \code{i->i+w[ij]} is added if \code{i+w[ij]} is less than the number
-  of total nodes. See also Kotsis, G: Interconnection Topologies for
-  Parallel Processing Systems, PARS Mitteilungen 11, 1-6, 1993.
-
-  
-}
-\value{Every function documented here returns a \code{graph} object.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.adjacency}} to create graphs from adjacency
-  matrices, \code{\link{graph.formula}} for a handy way to create small
-  graphs, \code{\link{graph.data.frame}} for an easy way to create
-  graphs with many edge/vertex attributes.
-}
-\examples{
-g1 <- graph.empty()
-g2 <- graph( c(1,2,2,3,3,4,5,6), directed=FALSE )
-g5 <- graph.star(10, mode="out")
-g6 <- graph.lattice(c(5,5,5))
-g7 <- graph.lattice(length=5, dim=3)
-g8 <- graph.ring(10)
-g9 <- graph.tree(10, 2)
-g10 <- graph.full(5, loops=TRUE)
-g11 <- graph.full.citation(10)
-g12 <- graph.atlas(sample(0:1252, 1))
-el <- matrix( c("foo", "bar", "bar", "foobar"), nc=2, byrow=TRUE)
-g13 <- graph.edgelist(el)
-g15 <- graph.extended.chordal.ring(15, matrix(c(3,12,4,7,8,11), nr=2))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.data.frame.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.data.frame.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.data.frame.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.data.frame.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,107 +0,0 @@
-\name{graph.data.frame}
-\alias{graph.data.frame}
-\alias{get.data.frame}
-\concept{Data frame}
-\title{Creating igraph graphs from data frames or vice-versa}
-\description{
-  This function creates an igraph graph from one or two data frames
-  containing the (symbolic) edge list and edge/vertex attributes.
-}
-\usage{
-graph.data.frame(d, directed=TRUE, vertices=NULL)
-get.data.frame(x, what=c("edges", "vertices", "both"))
-}
-\arguments{
-  \item{d}{A data frame containing a symbolic edge list in the first two
-    columns. Additional columns are considered as edge attributes.}
-  \item{directed}{Logical scalar, whether or not to create a directed graph.}
-  \item{vertices}{A data frame with vertex metadata, or \code{NULL}. See
-    details below.}
-  \item{x}{An igraph object.}
-  \item{what}{Character constant, whether to return info about vertices,
-    edges, or both. The default is \sQuote{edges}.}
-}
-\details{
-  \code{graph.data.frame} creates igraph graphs from one or two data
-  frames. It has two modes of operatation, depending whether the
-  \code{vertices} argument is \code{NULL} or not.
-
-  If \code{vertices} is \code{NULL}, then the first two columns of
-  \code{d} are used as a symbolic edge list and additional columns as
-  edge attributes. The names of the attributes are taken from the names
-  of the columns.
-
-  If \code{vertices} is not \code{NULL}, then it must be a data frame
-  giving vertex metadata. The first column of \code{vertices} is assumed
-  to contain symbolic vertex names, this will be added to the graphs as
-  the \sQuote{\code{name}} vertex attribute. Other columns will be added
-  as additional vertex attributes. If \code{vertices} is not \code{NULL}
-  then the symbolic edge list given in \code{d} is checked to contain
-  only vertex names listed in \code{vertices}.
-
-  Typically, the data frames are exported from some speadsheat software
-  like Excel and are imported into R via \code{\link{read.table}},
-  \code{\link{read.delim}} or \code{\link{read.csv}}.
-
-  \code{get.data.frame} converts the igraph graph into one or more data
-  frames, depending on the \code{what} argument.
-
-  If the \code{what} argument is \code{edges} (the default), then the
-  edges of the graph and also the edge attributes are returned. The
-  edges will be in the first two columns, named \code{from} and
-  \code{to}. (This also denotes edge direction for directed graphs.)
-  For named graphs, the vertex names will be included in these columns,
-  for other graphs, the numeric vertex ids. The edge attributes will be
-  in the other columns. It is not a good idea to have an edge attribute
-  named \code{from} or \code{to}, because then the column named in the
-  data frame will not be unique. The edges are listed in the order of
-  their numeric ids.
-
-  If the \code{what} argument is \code{vertices}, then vertex attributes
-  are returned. Vertices are listed in the order of their numeric vertex
-  ids.
-
-  If the \code{what} argument is \code{both}, then both vertex and edge
-  data is returned, in a list with named entries \code{vertices} and
-  \code{edges}.
-}
-\note{
-  For \code{graph.data.frame} \code{NA} elements in the first two
-  columns \sQuote{d} are replaced by the string \dQuote{NA} before
-  creating the graph. This means that all \code{NA}s will correspond to
-  a single vertex. 
-
-  \code{NA} elements in the first column of \sQuote{vertices} are also
-  replaced by the string \dQuote{NA}, but the rest of \sQuote{vertices}
-  is not touched. In other words, vertex names (=the first column)
-  cannot be \code{NA}, but other vertex attributes can.
-}
-\value{
-  An igraph graph object for \code{graph.data.frame}, and either a data
-  frame or a list of two data frames named \code{edges} and
-  \code{vertices} for \code{as.data.frame}.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{graph.constructors}} and
-  \code{\link{graph.formula}} for other ways to create graphs,
-  \code{\link{read.table}} to read in tables from files.}
-\examples{
-## A simple example with a couple of actors
-## The typical case is that these tables are read in from files....
-actors <- data.frame(name=c("Alice", "Bob", "Cecil", "David",
-                            "Esmeralda"),
-                     age=c(48,33,45,34,21),
-                     gender=c("F","M","F","M","F"))
-relations <- data.frame(from=c("Bob", "Cecil", "Cecil", "David",
-                               "David", "Esmeralda"),
-                        to=c("Alice", "Bob", "Alice", "Alice", "Bob", "Alice"),
-                        same.dept=c(FALSE,FALSE,TRUE,FALSE,FALSE,TRUE),
-                        friendship=c(4,5,5,2,1,1), advice=c(4,5,5,4,2,3))
-g <- graph.data.frame(relations, directed=TRUE, vertices=actors)
-print(g, e=TRUE, v=TRUE)
-
-## The opposite operation
-get.data.frame(g, what="vertices")
-get.data.frame(g, what="edges")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.de.bruijn.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.de.bruijn.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.de.bruijn.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.de.bruijn.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-\name{graph.de.bruijn}
-\alias{graph.de.bruijn}
-\concept{De Bruijn graph}
-\title{De Bruijn graphs.}
-\description{De Bruijn graphs are labeled graphs representing the
-  overlap of strings. }
-\usage{
-graph.de.bruijn(m,n)
-}
-\arguments{
-  \item{m}{Integer scalar, the size of the alphabet. See details below.}
-  \item{n}{Integer scalar, the length of the labels. See details below.}
-}
-\details{
- A de Bruijn graph represents relationships between strings. An alphabet
- of \code{m} letters are used and strings of length \code{n} are considered. 
- A vertex corresponds to every possible string and there is a directed edge
- from vertex \code{v} to vertex \code{w} if the string of \code{v} can
- be transformed into the string of \code{w} by removing its first letter
- and appending a letter to it.
- 
- Please note that the graph will have \code{m} to the power \code{n}
- vertices and even more edges, so probably you don't want to supply too
- big numbers for \code{m} and \code{n}.
- 
- De Bruijn graphs have some interesting properties, please see another source,
- eg. Wikipedia for details.   
-}
-\value{A graph object.}
-\author{Gabor Csardi <csardi.gabor@gmail.com>}
-\seealso{\code{\link{graph.kautz}}, \code{\link{line.graph}}}
-\examples{
-# de Bruijn graphs can be created recursively by line graphs as well 
-g <- graph.de.bruijn(2,1)
-graph.de.bruijn(2,2)
-line.graph(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.density.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.density.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.density.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.density.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-\name{graph.density}
-\alias{graph.density}
-\concept{Graph density}
-\title{Graph density}
-\description{The density of a graph is the ratio of the number of edges
-  and the number of possible edges.}
-\usage{
-graph.density(graph, loops=FALSE)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{loops}{Logical constant, whether to allow loop edges in the
-    graph. If this is TRUE then self loops are considered to be possible. If
-    this is FALSE then we assume that the graph does not contain any
-    loop edges and that loop edges are not meaningful.}
-}
-\details{
-  Note that this function may return strange results for graph with
-  multiple edges, density is ill-defined for graphs with multiple
-  edges. 
-}
-\value{
-  A real constant. This function returns \code{NaN} (=0.0/0.0) for an
-  empty graph with zero vertices.
-}
-\references{
-  Wasserman, S., and Faust, K.  (1994).  Social Network Analysis:
-  Methods and Applications.  Cambridge: Cambridge University Press.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{vcount}}, \code{\link{ecount}},
-  \code{\link{simplify}} to get rid of the multiple and/or loop edges.}
-\examples{
-g1 <- graph.empty(n=10)
-g2 <- graph.full(n=10)
-g3 <- erdos.renyi.game(n=10, 0.4)
-
-# loop edges
-g <- graph( c(1,2, 2,2, 2,3) )
-graph.density(g, loops=FALSE)              # this is wrong!!!
-graph.density(g, loops=TRUE)               # this is right!!!
-graph.density(simplify(g), loops=FALSE)    # this is also right, but different
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.dfs.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.dfs.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.dfs.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.dfs.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,102 +0,0 @@
-\name{graph.dfs}
-\alias{graph.dfs}
-\title{Depth-first search}
-\description{Depth-first search is an algorithm to traverse a graph. It
-  starts from a root vertex and tries to go quickly as far from as possible.}
-\usage{
-graph.dfs (graph, root, neimode = c("out", "in", "all", "total"), 
-    unreachable = TRUE, order = TRUE, order.out = FALSE,
-    father = FALSE, dist = FALSE, in.callback = NULL,
-    out.callback = NULL, extra = NULL, rho = parent.frame()) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{root}{The single root vertex to start the search from. }
-  \item{neimode}{For directed graphs specifies the type of edges to
-    follow. \sQuote{out} follows outgoing, \sQuote{in} incoming
-    edges. \sQuote{all} ignores edge directions
-    completely. \sQuote{total} is a synonym for \sQuote{all}. This
-    argument is ignored for undirected graphs.}
-  \item{unreachable}{Logical scalar, whether the search should visit
-    the vertices that are unreachable from the given root
-    vertex (or vertices). If \code{TRUE}, then additional searches are
-    performed until all vertices are visited.}
-  \item{order}{Logical scalar, whether to return the DFS ordering of the
-    vertices.}
-  \item{order.out}{Logical scalar, whether to return the ordering based
-    on leaving the subtree of the vertex.}
-  \item{father}{Logical scalar, whether to return the father of the
-    vertices.}
-  \item{dist}{Logical scalar, whether to return the distance from the
-    root of the search tree.}
-  \item{in.callback}{If not \code{NULL}, then it must be callback
-    function. This is called whenever a vertex is visited. See details
-    below.}
-  \item{out.callback}{If not \code{NULL}, then it must be callback
-    function. This is called whenever the subtree of a vertex is
-    completed by the algorithm. See details below.}
-  \item{extra}{Additional argument to supply to the callback function.}
-  \item{rho}{The environment in which the callback function is
-    evaluated.}
-}
-\details{
-  The callback functions must have the following arguments:
-  \describe{
-    \item{graph}{The input graph is passed to the callback function
-      here.}
-    \item{data}{A named numeric vector, with the following entries:
-      \sQuote{vid}, the vertex that was just visited and \sQuote{dist},
-      its distance from the root of the search tree.}
-    \item{extra}{The extra argument.}
-  }
-  See examples below on how to use the callback functions.
-}
-\value{
-  A named list with the following entries:
-  \item{root}{Numeric scalar. The root vertex that was used as the
-    starting point of the search.}
-  \item{neimode}{Character scalar. The \code{neimode} argument of the
-    function call. Note that for undirected graphs this is always
-    \sQuote{all}, irrespectively of the supplied value.}
-  \item{order}{Numeric vector. The vertex ids, in the order in which
-    they were visited by the search.}
-  \item{order.out}{Numeric vector, the vertex ids, in the order of the
-    completion of their subtree.}
-  \item{father}{Numeric vector. The father of each vertex, i.e. the
-    vertex it was discovered from.}
-  \item{dist}{Numeric vector, for each vertex its distance from the root
-    of the search tree.}
-
-  Note that \code{order}, \code{order.out}, \code{father}, and
-  \code{dist} might be \code{NULL} if their corresponding argument is
-  \code{FALSE}, i.e. if their calculation is not requested.  
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{ \code{\link{graph.bfs}} for breadth-first search.}
-\examples{
-## A graph with two separate trees
-graph.dfs(graph.tree(10) \%du\% graph.tree(10), root=1, "out",
-          TRUE, TRUE, TRUE, TRUE)
-
-## How to use a callback
-f.in <- function(graph, data, extra) {
-  cat("in:", paste(collapse=", ", data), "\n")
-  FALSE
-}
-f.out <- function(graph, data, extra) {
-  cat("out:", paste(collapse=", ", data), "\n")
-  FALSE
-}
-tmp <- graph.dfs(graph.tree(10), root=1, "out",
-                 in.callback=f.in, out.callback=f.out)
-
-## Terminate after the first component, using a callback
-f.out <- function(graph, data, extra) {
- data['vid'] == 1
-}
-tmp <- graph.dfs(graph.tree(10) \%du\% graph.tree(10), root=1,
-                 out.callback=f.out)
-
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.diversity.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.diversity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.diversity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.diversity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,57 +0,0 @@
-\name{graph.diversity}
-\alias{graph.diversity}
-\concept{Entropy}
-\title{Graph diversity}
-\description{
-  Calculates a measure of diversity for all vertices.
-}
-\usage{
-graph.diversity(graph, weights = NULL, vids = V(graph))
-}
-\arguments{
-  \item{graph}{The input graph. Edge directions are ignored.}
-  \item{weights}{\code{NULL}, or the vector of edge weights to use for
-    the computation. If \code{NULL}, then the \sQuote{weight} attibute
-    is used. Note that this measure is not defined for unweighted
-    graphs.}
-  \item{vids}{The vertex ids for which to calculate the measure.}
-}
-\details{
-  The diversity of a vertex is defined as the (scaled) Shannon entropy
-  of the weights of its incident edges:
-  \deqn{D(i)=\frac{H(i)}{\log k_i}}{D(i)=H(i)/log(k[i])}
-  and
-  \deqn{H(i)=-\sum_{j=1}^{k_i} p_{ij}\log p_{ij},}{%
-    H(i) = -sum(p[i,j] log(p[i,j]), j=1..k[i]),}
-  where
-  \deqn{p_{ij}=\frac{w_{ij}}{\sum_{l=1}^{k_i}}V_{il},}{%
-    p[i,j] = w[i,j] / sum(w[i,l], l=1..k[i]),}
-  and \eqn{k_i}{k[i]} is the (total) degree of vertex \eqn{i},
-  \eqn{w_{ij}}{w[i,j]} is the weight of the edge(s) between vertices
-  \eqn{i} and \eqn{j}.
-
-  For vertices with degree less than two the function returns
-  \code{NaN}.  
-}
-\value{
-  A numeric vector, its length is the number of vertices.
-}
-\references{
-  Nathan Eagle, Michael Macy and Rob Claxton: Network Diversity and
-  Economic Development, \emph{Science} \bold{328}, 1029--1031, 2010.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g1 <- erdos.renyi.game(20, 2/20)
-g2 <- erdos.renyi.game(20, 2/20)
-g3 <- erdos.renyi.game(20, 5/20)
-E(g1)$weight <- 1
-E(g2)$weight <- runif(ecount(g2))
-E(g3)$weight <- runif(ecount(g3))
-graph.diversity(g1)
-graph.diversity(g2)
-graph.diversity(g3)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.famous.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.famous.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.famous.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.famous.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,133 +0,0 @@
-\encoding{UTF-8}
-\name{graph.famous}
-\alias{graph.famous}
-\title{Creating named graphs}
-\description{There are some famous, named graphs, sometimes
-  counterexamples to some conjecture or unique graphs with given
-  features. These can be created with this function}
-\usage{
-graph.famous(name)
-}
-\arguments{
-  \item{name}{Character constant giving the name of the graph. It is
-    case insensitive.}
-}
-\details{
-  \code{graph.famous} knows the following graphs:
-  \describe{
-    \item{Bull}{The bull graph, 5 vertices, 5 edges, resembles to the
-      head of a bull if drawn properly.}
-    \item{Chvatal}{This is the smallest triangle-free graph that is
-      both 4-chromatic and 4-regular. According to the Grunbaum
-      conjecture there exists an m-regular, m-chromatic graph
-      with n vertices for every m>1 and n>2. The Chvatal graph
-      is an example for m=4 and n=12. It has 24 edges.}
-    \item{Coxeter}{A non-Hamiltonian cubic symmetric graph with 28
-      vertices and 42 edges.}
-    \item{Cubical}{The Platonic graph of the cube. A convex regular
-      polyhedron with 8 vertices and 12 edges.}
-    \item{Diamond}{A graph with 4 vertices and 5 edges, resembles to a
-      schematic diamond if drawn properly.}
-    \item{Dodecahedral, Dodecahedron}{Another Platonic solid
-      with 20 vertices and 30 edges.}
-    \item{Folkman}{The semisymmetric graph with minimum number of
-      vertices, 20 and 40 edges. A semisymmetric graph is
-      regular, edge transitive and not vertex transitive.}
-    \item{Franklin}{This is a graph whose embedding to the Klein
-      bottle can be colored with six colors, it is a
-      counterexample to the neccessity of the Heawood
-      conjecture on a Klein bottle. It has 12 vertices and 18
-      edges.}
-    \item{Frucht}{The Frucht Graph is the smallest cubical graph
-      whose automorphism group consists only of the identity
-      element. It has 12 vertices and 18 edges.}
-    \item{Grotzsch}{The Grötzsch graph is a triangle-free graph with
-      11 vertices, 20 edges, and chromatic number 4. It is named after
-      German mathematician Herbert Grötzsch, and its existence
-      demonstrates that the assumption of planarity is necessary in
-      Grötzsch's theorem that every triangle-free planar
-      graph is 3-colorable.}
-    \item{Heawood}{The Heawood graph is an undirected graph with 14
-      vertices and 21 edges. The graph is cubic, and all cycles in the
-      graph have six or more edges. Every smaller cubic graph has shorter
-      cycles, so this graph is the 6-cage, the smallest cubic graph of
-      girth 6.}
-    \item{Herschel}{The Herschel graph is the smallest
-      nonhamiltonian polyhedral graph. It is the
-      unique such graph on 11 nodes, and has 18 edges.}
-    \item{House}{The house graph is a 5-vertex, 6-edge graph, the
-      schematic draw of a house if drawn properly, basicly a 
-      triangle of the top of a square.}
-    \item{HouseX}{The same as the house graph with an X in the square. 5
-      vertices and 8 edges.}
-    \item{Icosahedral, Icosahedron}{A Platonic solid with 12
-      vertices and 30 edges.}
-    \item{Krackhardt\_Kite}{A social network with 10 vertices and 18 edges.
-      Krackhardt, D. Assessing the Political Landscape:
-      Structure, Cognition, and Power in Organizations.
-      Admin. Sci. Quart. 35, 342-369, 1990.}
-    \item{Levi}{The graph is a 4-arc transitive cubic graph, it has
-      30 vertices and 45 edges.}
-    \item{McGee}{The McGee graph is the unique 3-regular 7-cage
-      graph, it has 24 vertices and 36 edges.}
-    \item{Meredith}{The Meredith graph is a quartic graph on 70
-      nodes and 140 edges that is a counterexample to the conjecture that
-      every 4-regular 4-connected graph is Hamiltonian.}
-    \item{Noperfectmatching}{A connected graph with 16 vertices and
-      27 edges containing no perfect matching. A matching in a graph
-      is a set of pairwise non-adjacent edges; that is, no two edges
-      share a common vertex. A perfect matching is a matching
-      which covers all vertices of the graph.}
-    \item{Nonline}{A graph whose connected components are the 9
-      graphs whose presence as a vertex-induced subgraph in a
-      graph makes a nonline graph. It has 50 vertices and 72 edges.}
-    \item{Octahedral, Octahedron}{Platonic solid with 6
-      vertices and 12 edges.} 
-    \item{Petersen}{A 3-regular graph with 10 vertices and 15 edges. It is
-      the smallest hypohamiltonian graph, ie. it is
-      non-hamiltonian but removing any single vertex from it makes it
-      Hamiltonian.}
-    \item{Robertson}{The unique (4,5)-cage graph, ie. a 4-regular
-      graph of girth 5. It has 19 vertices and 38 edges.}
-    \item{Smallestcyclicgroup}{A smallest nontrivial graph
-      whose automorphism group is cyclic. It has 9 vertices and
-      15 edges.}
-    \item{Tetrahedral, Tetrahedron}{Platonic solid with 4
-      vertices and 6 edges.}
-    \item{Thomassen}{The smallest hypotraceable graph,
-      on 34 vertices and 52 edges. A hypotracable graph does
-      not contain a Hamiltonian path but after removing any
-      single vertex from it the remainder always contains a
-      Hamiltonian path. A graph containing a Hamiltonian path
-      is called tracable.}
-    \item{Tutte}{Tait's Hamiltonian graph conjecture states that
-      every 3-connected 3-regular planar graph is Hamiltonian.
-      This graph is a counterexample. It has 46 vertices and 69
-      edges.}
-    \item{Uniquely3colorable}{Returns a 12-vertex, triangle-free
-      graph with chromatic number 3 that is uniquely
-      3-colorable.}
-    \item{Walther}{An identity graph with 25 vertices and 31
-      edges. An identity graph has a single graph automorphism,
-      the trivial one.}
-    \item{Zachary}{Social network of friendships between 34 members of a
-      karate club at a US university in the 1970s. See
-      W. W. Zachary, An information flow model for conflict and
-      fission in small groups, Journal of Anthropological
-      Research 33, 452-473 (1977).
-    }
-  }
-}
-\value{A graph object.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{graph}} can create arbitrary graphs, see also the other
-  functions on the its manual page for creating special graphs.
-}
-\examples{
-solids <- list(graph.famous("Tetrahedron"),
-               graph.famous("Cubical"),
-               graph.famous("Octahedron"),
-               graph.famous("Dodecahedron"),
-               graph.famous("Icosahedron"))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.formula.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.formula.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.formula.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.formula.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,125 +0,0 @@
-\name{graph.formula}
-\alias{graph.formula}
-\title{Creating (small) graphs via a simple interface}
-\description{
-  This function is useful if you want to create a small (named) graph
-  quickly, it works for both directed and undirected graphs.
-}
-\usage{
-graph.formula(..., simplify = TRUE)
-}
-\arguments{
-  \item{...}{The formulae giving the structure of the graph, see details
-    below.}
-  \item{simplify}{Logical scalar, whether to call \code{\link{simplify}}
-    on the created graph. By default the graph is simplified, loop and
-    multiple edges are removed.}
-}
-\details{
-  \code{graph.formula} is very handy for creating small graphs quickly.
-  You need to supply one or more R expressions giving the structure of
-  the graph. The expressions consist of vertex names and edge
-  operators. An edge operator is a sequence of \sQuote{\code{-}} and
-  \sQuote{\code{+}} characters, the former is for the edges and the
-  latter is used for arrow heads. The edges can be arbitrarily long,
-  ie. you may use as many \sQuote{\code{-}} characters to \dQuote{draw}
-  them as you like.
-
-  If all edge operators consist of only \sQuote{\code{-}} characters
-  then the graph will be undirected, whereas a single \sQuote{\code{+}}
-  character implies a directed graph.
-
-  Let us see some simple examples. Without arguments the function
-  creates an empty graph:
-  \preformatted{
-    graph.formula()
-  }
-
-  A simple undirected graph with two vertices called \sQuote{A} and
-  \sQuote{B} and one edge only:
-  \preformatted{
-    graph.formula(A-B)
-  }
-
-  Remember that the length of the edges does not matter, so we could
-  have written the following, this creates the same graph:
-  \preformatted{
-    graph.formula( A-----B )
-  }
-
-  If you have many disconnected components in the graph, separate them
-  with commas. You can also give isolate vertices.
-  \preformatted{
-    graph.formula( A--B, C--D, E--F, G--H, I, J, K )
-  }
-
-  The \sQuote{\code{:}} operator can be used to define vertex sets. If
-  an edge operator connects two vertex sets then every edge from the
-  first set will be connected to every edge in the second set. The
-  following form creates a full graph, including loop edges:
-  \preformatted{
-    graph.formula( A:B:C:D -- A:B:C:D )
-  }
-
-  In directed graphs, edges will be created only if the edge operator
-  includes a arrow head (\sQuote{+}) \emph{at the end} of the edge:
-  \preformatted{
-    graph.formula( A -+ B -+ C )
-    graph.formula( A +- B -+ C )
-    graph.formula( A +- B -- C )
-  }
-  Thus in the third example no edge is created between vertices \code{B}
-  and \code{C}.
-
-  Mutual edges can be also created with a simple edge operator:
-  \preformatted{
-    graph.formula( A +-+ B +---+ C ++ D + E)
-  }
-  Note again that the length of the edge operators is arbitrary,
-  \sQuote{\code{+}}, \sQuote{\code{++}} and \sQuote{\code{+-----+}} have
-  exactly the same meaning.
-
-  If the vertex names include spaces or other special characters then
-  you need to quote them:
-  \preformatted{
-    graph.formula( "this is" +- "a silly" -+ "graph here" )
-  }
-  You can include any character in the vertex names this way, even
-  \sQuote{+} and \sQuote{-} characters.
-
-  See more examples below.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph}} for more general graph creation methods.}
-\examples{
-# A simple undirected graph
-g <- graph.formula( Alice-Bob-Cecil-Alice, Daniel-Cecil-Eugene, Cecil-Gordon )
-g
-
-# Another undirected graph, ":" notation
-g2 <- graph.formula( Alice-Bob:Cecil:Daniel, Cecil:Daniel-Eugene:Gordon )
-g2
-
-# A directed graph
-g3 <- graph.formula( Alice +-+ Bob --+ Cecil +-- Daniel,
-                     Eugene --+ Gordon:Helen )
-g3
-
-# A graph with isolate vertices
-g4 <- graph.formula( Alice -- Bob -- Daniel, Cecil:Gordon, Helen )
-g4
-V(g4)$name
-
-# "Arrows" can be arbitrarily long
-g5 <- graph.formula( Alice +---------+ Bob )
-g5
-
-# Special vertex names
-g6 <- graph.formula( "+" -- "-", "*" -- "/", "\%\%" -- "\%/\%" )
-g6
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.full.bipartite.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.full.bipartite.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.full.bipartite.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.full.bipartite.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-\name{graph.full.bipartite}
-\alias{graph.full.bipartite}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\title{Create a full bipartite graph}
-\description{Bipartite graphs are also called two-mode by some. This
-  function creates a bipartite graph in which every possible edge is
-  present.}
-\usage{
-graph.full.bipartite (n1, n2, directed = FALSE, mode = c("all", "out", "in")) 
-}
-\arguments{
-  \item{n1}{The number of vertices of the first kind.}
-  \item{n2}{The number of vertices of the second kind.}
-  \item{directed}{Logical scalar, whether the graphs is directed.}
-  \item{mode}{Scalar giving the kind of edges to create for directed
-    graphs. If this is \sQuote{\code{out}} then all vertices of the
-    first kind are connected to the others; \sQuote{\code{in}} specifies
-    the opposite direction; \sQuote{\code{all}} creates mutual
-    edges. This argument is ignored for undirected graphs.x}
-}
-\details{
-  Bipartite graphs have a \sQuote{\code{type}} vertex attribute in
-  igraph, this is boolean and \code{FALSE} for the vertices of the first
-  kind and \code{TRUE} for vertices of the second kind.
-}
-\value{
-  An igraph graph, with the \sQuote{\code{type}} vertex attribute set.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.full}} for creating one-mode full graphs}
-\examples{
-g <- graph.full.bipartite(2, 3)
-g2 <- graph.full.bipartite(2, 3, dir=TRUE)
-g3 <- graph.full.bipartite(2, 3, dir=TRUE, mode="in")
-g4 <- graph.full.bipartite(2, 3, dir=TRUE, mode="all")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.graphdb.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.graphdb.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.graphdb.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.graphdb.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-\name{graph.graphdb}
-\alias{graph.graphdb}
-\concept{Graph database}
-\title{Load a graph from the graph database for testing graph
-  isomorphism.}
-\description{This function downloads a graph from a database created for
-  the evaluation of graph isomorphism testing algothitms.}
-\usage{
-graph.graphdb (url = NULL, prefix = "iso", type = "r001", nodes = NULL, 
-    pair = "A", which = 0, base = "http://cneurocvs.rmki.kfki.hu/graphdb/gzip", 
-    compressed = TRUE, directed = TRUE) 
-}
-\arguments{
-  \item{url}{If not \code{NULL} it is a complete URL with the file to import.}
-  \item{prefix}{Gives the prefix. See details below. Possible values:
-    \code{iso}, \code{i2}, \code{si4}, \code{si6}, \code{mcs10},
-    \code{mcs30}, \code{mcs50}, \code{mcs70}, \code{mcs90}.
-  }
-  \item{type}{Gives the graph type identifier. See details
-    below. Possible values: \code{r001}, \code{r005}, \code{r01},
-    \code{r02}, \code{m2D}, \code{m2Dr2}, \code{m2Dr4}, \code{m2Dr6}
-    \code{m3D}, \code{m3Dr2}, \code{m3Dr4}, \code{m3Dr6}, \code{m4D},
-    \code{m4Dr2}, \code{m4Dr4}, \code{m4Dr6}, \code{b03}, 
-    \code{b03m}, \code{b06}, \code{b06m}, \code{b09}, \code{b09m}.
-  }
-  \item{nodes}{The number of vertices in the graph.}
-  \item{pair}{Specifies which graph of the pair to read. Possible
-    values: \code{A} and \code{B}.}
-  \item{which}{Gives the number of the graph to read. For every graph
-    type there are a number of actual graphs in the database. This
-    argument specifies which one to read.}
-  \item{base}{The base address of the database. See details below.}
-  \item{compressed}{Logical constant, if TRUE than the file is expected
-    to be compressed by gzip. If \code{url} is \code{NULL} then a
-    \sQuote{\code{.gz}} suffix is added to the filename.}
-  \item{directed}{Logical constant, whether to create a directed graph.}
-}
-\details{
-  \code{graph.graphdb} reads a graph from the graph database from an FTP
-  or HTTP server or from a local copy. It has two modes of operation:
-
-  If the \code{url} argument is specified then it should the complete
-  path to a local or remote graph database file. In this case
-  we simply call \code{\link{read.graph}} with the proper arguments to
-  read the file.
-
-  If \code{url} is \code{NULL}, and this is the default, then the
-  filename is assembled from the \code{base}, \code{prefix}, \code{type},
-  \code{nodes}, \code{pair} and \code{which} arguments.
-  
-  See the documentation for the graph database at
-  \url{http://amalfi.dis.unina.it/graph/db/doc/graphdbat.html} for
-  the actual format of a graph database file and other information.
-}
-\value{
-  A new graph object.
-}
-\references{M. De Santo, P. Foggia, C. Sansone, M. Vento:
-  A large database of graphs and its use for benchmarking graph
-  isomorphism algorithms, \emph{Pattern Recognition Letters},
-  Volume 24, Issue 8 (May 2003)
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{read.graph}}, \code{\link{graph.isomorphic.vf2}}}
-\examples{
-\dontrun{
-g <- graph.graphdb(prefix="iso", type="r001", nodes=20, pair="A",
-  which=10, compressed=TRUE)
-g2 <- graph.graphdb(prefix="iso", type="r001", nodes=20, pair="B",
-  which=10, compressed=TRUE)
-graph.isomorphic.vf2(g, g2)	% should be TRUE
-g3 <- graph.graphdb(url="http://cneurocvs.rmki.kfki.hu/graphdb/gzip/iso/bvg/b06m/iso_b06m_m200.A09.gz")
-}}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.incidence.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.incidence.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.incidence.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.incidence.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,73 +0,0 @@
-\name{graph.incidence}
-\alias{graph.incidence}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\title{Create graphs from an incidence matrix}
-\description{\code{graph.incidence} creates a bipartite igraph graph
-  from an incidence matrix.}
-\usage{
-graph.incidence(incidence, directed = FALSE, mode = c("all", "out", 
-    "in", "total"), multiple = FALSE, weighted = NULL, add.names = NULL)
-}
-\arguments{
-  \item{incidence}{The input incidence matrix. It can also be a sparse
-    matrix from the \code{Matrix} package.}
-  \item{directed}{Logical scalar, whether to create a directed graph.}
-  \item{mode}{A character constant, defines the direction of the edges
-    in directed graphs, ignored for undirected graphs. If
-    \sQuote{\code{out}}, then edges go from vertices of the first kind
-    (corresponding to rows in the incidence matrix) to vertices of the
-    second kind (columns in the incidence matrix). If
-    \sQuote{\code{in}}, then the opposite direction is used. If
-    \sQuote{\code{all}} or \sQuote{\code{total}}, then mutual edges are
-    created. }
-  \item{multiple}{Logical scalar, specifies how to interpret the matrix
-    elements. See details below.}
-  \item{weighted}{This argument specifies whether to create a weighted
-    graph from the incidence matrix. If it is \code{NULL} then an
-    unweighted graph is created and the \code{multiple} argument is used
-    to determine the edges of the graph. If it is a character
-    constant then for every non-zero matrix entry an edge is created and
-    the value of the entry is added as an edge attribute named by the
-    \code{weighted} argument. If it is \code{TRUE} then a weighted graph
-    is created and the name of the edge attribute will be
-    \sQuote{\code{weight}}.
-  }
-  \item{add.names}{A character constant, \code{NA} or
-    \code{NULL}. \code{graph.incidence} can add the row and column names
-    of the incidence matrix as vertex attributes. If this argument is
-    \code{NULL} (the default) and the incidence matrix has both row and
-    column names, then these are added as the \sQuote{\code{name}} vertex
-    attribute. If you want a different vertex attribute for this, then
-    give the name of the attributes as a character string. If this
-    argument is \code{NA}, then no vertex attributes (other than type)
-    will be added.
-  }
-}
-\details{
-  Bipartite graphs have a \sQuote{\code{type}} vertex attribute in
-  igraph, this is boolean and \code{FALSE} for the vertices of the first
-  kind and \code{TRUE} for vertices of the second kind.
-
- \code{graph.incidence} can operate in two modes, depending on the
- \code{multiple} argument. If it is \code{FALSE} then a single edge is
- created for every non-zero element in the incidence matrix. If
- \code{multiple} is \code{TRUE}, then the matrix elements are rounded up
- to the closest non-negative integer to get the number of edges to
- create between a pair of vertices.
-}
-\value{
-  A bipartite igraph graph. In other words, an igraph graph that has a
-  vertex attribute \code{type}. 
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.bipartite}} for another way to create
-  bipartite graphs}
-\examples{
-inc <- matrix(sample(0:1, 15, repl=TRUE), 3, 5)
-colnames(inc) <- letters[1:5]
-rownames(inc) <- LETTERS[1:3]
-graph.incidence(inc)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.isomorphism.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.isomorphism.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.isomorphism.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.isomorphism.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,252 +0,0 @@
-\name{graph-isomorphism}
-\alias{graph.isoclass}
-\alias{graph.isocreate}
-\alias{graph.isomorphic}
-\alias{graph.isomorphic.vf2}
-\alias{graph.count.isomorphisms.vf2}
-\alias{graph.count.subisomorphisms.vf2}
-\alias{graph.get.isomorphisms.vf2}
-\alias{graph.get.subisomorphisms.vf2}
-\alias{graph.isoclass.subgraph}
-\alias{graph.isomorphic.34}
-\alias{graph.isomorphic.bliss}
-\alias{graph.subisomorphic.vf2}
-\concept{Graph isomorphism}
-\concept{Subgraph isomorphism}
-\concept{VF2 algorithm}
-\concept{BLISS algorithm}
-\title{Graph Isomorphism}
-\description{These functions deal with graph isomorphism.}
-\usage{
-graph.isomorphic(graph1, graph2)
-graph.isomorphic.34(graph1, graph2)
-graph.isomorphic.bliss(graph1, graph2, sh1="fm", sh2="fm")
-graph.isomorphic.vf2(graph1, graph2, vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-
-graph.count.isomorphisms.vf2(graph1, graph2,
-     vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-graph.get.isomorphisms.vf2(graph1, graph2,
-     vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-
-graph.subisomorphic.vf2(graph1, graph2,
-     vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-graph.count.subisomorphisms.vf2(graph1, graph2,
-     vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-graph.get.subisomorphisms.vf2(graph1, graph2,
-     vertex.color1, vertex.color2,
-     edge.color1, edge.color2)
-
-graph.isoclass(graph)
-graph.isoclass.subgraph(graph, vids)
-graph.isocreate(size, number, directed=TRUE)
-}
-\arguments{
-  \item{graph}{A graph object.}
-  \item{graph1,graph2}{Graph objects}
-  \item{vertex.color1,vertex.color2}{
-    Optional integer vectors giving the colors of the
-    vertices for colored (sub)graph isomorphism. If they are not given,
-    but the graph has a \dQuote{color} vertex attribute, then it will be
-    used. If you want to ignore these attributes, then supply
-    \code{NULL} for both of these arguments. See also examples below.}
-  \item{edge.color1,edge.color2}{
-    Optional integer vectors giving the colors of the edges
-    for edge-colored (sub)graph isomorphism. If they are not given,
-    but the graph has a \dQuote{color} edge attribute, then it will be
-    used. If you want to ignore these attributes, then supply
-    \code{NULL} for both of these arguments.}
-  \item{size}{A numeric integer giving the number of vertices in the
-    graph to create. Only three or four are suppported right now.}
-  \item{number}{The number of the isomorphism class of the graph to be
-    created.}
-  \item{directed}{Whether to create a directed graph.}
-  \item{sh1}{Character constant, the heuristics to use in the BLISS
-    algorithm, for \code{graph1}. See the \code{sh} argument of
-    \code{\link{canonical.permutation}} for possible values.}
-  \item{sh2}{Character constant, the heuristics to use in the BLISS
-    algorithm, for \code{graph2}. See the \code{sh} argument of
-    \code{\link{canonical.permutation}} for possible values.}
-  \item{vids}{Numeric vector, the vertex ids of vertices to form the
-    induced subgraph for determining the isomorphism class.}
-}
-\details{
-  \code{graph.isomorphic} decides whether two graphs are isomorphic.
-  The input graphs must be both directed or both undirected.
-  This function is a higher level interface to the other graph
-  isomorphism decision functions. Currently it does the following:
-  \enumerate{
-    \item If the two graphs do not agree in the number of vertices and
-    the number of edges then \code{FALSE} is returned.
-    \item Otherwise if the graphs have 3 or 4 vertices, then
-    \code{igraph.isomorphic.34} is called.
-    \item Otherwise if the graphs are directed, then
-    \code{igraph.isomorphic.vf2} is called.
-    \item Otherwise \code{igraph.isomorphic.bliss} is called.
-  }
-
-  \code{igraph.isomorphic.34} decides whether two graphs, both of which
-  contains only 3 or 4 vertices, are isomorphic. It works based on a
-  precalculated and stored table.
-
-  \code{igraph.isomorphic.bliss} uses the BLISS algorithm by Junttila
-  and Kaski, and it works for undirected graphs. For both graphs the
-  \code{\link{canonical.permutation}} and then the
-  \code{\link{permute.vertices}} function is called to transfer them
-  into canonical form; finally the canonical forms are compared.
-
-  \code{graph.isomorphic.vf2} decides whethe two graphs are isomorphic,
-  it implements the VF2 algorithm, by Cordella, Foggia et al., see
-  references.
-
-  \code{graph.count.isomorphisms.vf2} counts the different isomorphic
-  mappings between \code{graph1} and \code{graph2}. (To count
-  automorphisms you can supply the same graph twice, but it is better to
-  call \code{\link{graph.automorphisms}}.) It uses the VF2 algorithm.
-
-  \code{graph.get.isomorphisms.vf2} calculates all isomorphic mappings
-  between \code{graph1} and \code{graph2}. It uses the VF2 algorithm.
-
-  \code{graph.subisomorphic.vf2} decides whether \code{graph2} is
-  isomorphic to some subgraph of \code{graph1}. It uses the VF2 algorithm.
-
-  \code{graph.count.subisomorphisms.vf2} counts the different isomorphic
-  mappings between \code{graph2} and the subgraphs of \code{graph1}. It
-  uses the VF2 algorithm.
-
-  \code{graph.get.subisomorphisms.vf2} calculates all isomorphic
-  mappings between \code{graph2} and the subgraphs of \code{graph1}. It
-  uses the VF2 algorithm.
-  
-  \code{graph.isoclass} returns the isomorphism class of a graph, a
-  non-negative integer number. Graphs (with the same number of vertices)
-  having the same isomorphism class are isomorphic and isomorphic graphs
-  always have the same isomorphism class. Currently it can handle only
-  graphs with 3 or 4 vertices.
-
-  \code{graph.isoclass.subgraph} calculates the isomorphism class of a
-  subgraph of the input graph. Currently it only works for subgraphs
-  with 3 or 4 vertices.
-  
-  \code{graph.isocreate} create a graph from the given isomorphic
-  class. Currently it can handle only graphs with 3 or 4 vertices.
-}
-\note{
-  Functions \code{graph.isoclass}, \code{graph.isoclass.subgraph} and
-  \code{graph.isocreate} are considered experimental and might be
-  reorganized/rewritten later.
-}
-\value{
-  \code{graph.isomorphic} and \code{graph.isomorphic.34} return a
-  logical scalar, \code{TRUE} if the input graphs are isomorphic,
-  \code{FALSE} otherwise.
-
-  \code{graph.isomorphic.bliss} returns a named list with elements:
-  \item{iso}{A logical scalar, whether the two graphs are isomorphic.}
-  \item{map12}{A numeric vector, an mapping from \code{graph1} to
-    \code{graph2} if \code{iso} is \code{TRUE}, an empty numeric
-    vector otherwise.}
-  \item{map21}{A numeric vector, an mapping from \code{graph2} to
-    \code{graph1} if \code{iso} is \code{TRUE}, an empty numeric
-    vector otherwise.}
-  \item{info1}{Some information about the canonical form calculation
-    for \code{graph1}. A named list, see the return value of
-    \code{\link{canonical.permutation}} for details. }
-  \item{info2}{Some information about the canonical form calculation
-    for \code{graph2}. A named list, see the return value of
-    \code{\link{canonical.permutation}} for details. }
-
-  \code{graph.isomorphic.vf2} returns a names list with three elements:
-  \item{iso}{A logical scalar, whether the two graphs are isomorphic.}
-  \item{map12}{A numeric vector, an mapping from \code{graph1} to
-    \code{graph2} if \code{iso} is \code{TRUE}, an empty numeric
-    vector otherwise.}
-  \item{map21}{A numeric vector, an mapping from \code{graph2} to
-    \code{graph1} if \code{iso} is \code{TRUE}, an empty numeric
-    vector otherwise.}
-
-  \code{graph.count.isomorphisms.vf2} returns a numeric scalar, an
-  integer, the number of isomorphic mappings between the two input
-  graphs.
-
-  \code{graph.get.isomorphisms.vf2} returns a list of numeric
-  vectors. Every numeric vector is a permutation which takes
-  \code{graph2} into \code{graph1}.
-
-  \code{graph.subisomorphic.vf2} returns a named list with three
-  elements:
-  \item{iso}{Logical scalar, \code{TRUE} if a subgraph of
-    \code{graph1} is isomorphic to \code{graph2}.}
-  \item{map12}{Numeric vector, empty if \code{iso} is
-    \code{FALSE}. Otherwise a mapping from a subgraph of \code{graph1}
-    to \code{graph2}. -1 denotes the vertices which are not part of
-    the mapping.}
-  \item{map21}{Numeric vector, empty if \code{iso} is
-    \code{FALSE}. Otherwise a mapping from \code{graph2} into
-    \code{graph1}.}
-
-  \code{graph.count.subisomorphisms.vf2} returns a numeric scalar, an
-  integer.
-
-  \code{graph.get.subisomorphisms.vf2} returns a list of numeric
-  vectors, each numeric vector is an isomorphic mapping from
-  \code{graph2} to a subgraph of \code{graph1}.
-  
-  \code{graph.isoclass} and \code{graph.isoclass.subgraph} return a
-  non-negative integer number. 
-
-  \code{graph.isocreate} returns a graph object.
-}
-\references{
-  Tommi Junttila and Petteri Kaski: Engineering an Efficient Canonical
-  Labeling Tool for Large and Sparse Graphs, \emph{Proceedings of the
-    Ninth Workshop on Algorithm Engineering and Experiments and the
-    Fourth Workshop on Analytic Algorithms and Combinatorics.} 2007.
-
-  LP Cordella,  P Foggia, C Sansone, and M Vento:
-  An improved algorithm for matching large graphs,
-  \emph{Proc. of the 3rd IAPR TC-15 Workshop on Graphbased
-    Representations in Pattern Recognition}, 149--159, 2001.
-}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.motifs}}}
-\examples{
-# create some non-isomorphic graphs
-g1 <- graph.isocreate(3, 10)
-g2 <- graph.isocreate(3, 11)
-graph.isoclass(g1)
-graph.isoclass(g2)
-graph.isomorphic(g1, g2)
-
-# create two isomorphic graphs, by
-# permuting the vertices of the first 
-g1 <- barabasi.game(30, m=2, directed=FALSE)
-g2 <- permute.vertices(g1, sample(vcount(g1)))
-# should be TRUE
-graph.isomorphic(g1, g2)
-graph.isomorphic.bliss(g1, g2)
-graph.isomorphic.vf2(g1, g2)
-
-# colored graph isomorphism
-g1 <- graph.ring(10)
-g2 <- graph.ring(10)
-graph.isomorphic.vf2(g1, g2)
-
-V(g1)$color <- rep(1:2, length=vcount(g1))
-V(g2)$color <- rep(1:2, length=vcount(g2))
-graph.count.isomorphisms.vf2(g1, g2)
-graph.count.isomorphisms.vf2(g1, g2, vertex.color1=NULL,
-    vertex.color2=NULL)
-
-V(g1)$color <- 1
-V(g2)$color <- 2
-graph.isomorphic.vf2(g1, g2)
-graph.isomorphic.vf2(g2, g2, vertex.color1=NULL,
-    vertex.color2=NULL)
-
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.kautz.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.kautz.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.kautz.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.kautz.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-\name{graph.kautz}
-\alias{graph.kautz}
-\concept{Kautz graph}
-\title{Kautz graphs}
-\description{Kautz graphs are labeled graphs representing the
-  overlap of strings. }
-\usage{
-graph.kautz(m,n)
-}
-\arguments{
-  \item{m}{Integer scalar, the size of the alphabet. See details below.}
-  \item{n}{Integer scalar, the length of the labels. See details below.}
-}
-\details{
-  A Kautz graph is a labeled graph, vertices are labeled by strings
-  of length \code{n+1} above an alphabet with \code{m+1} letters, with
-  the restriction that every two consecutive letters in the string
-  must be different. There is a directed edge from a vertex \code{v} to
-  another vertex \code{w} if it is possible to transform the string of
-  \code{v} into the string of \code{w} by removing the first letter and
-  appending a letter to it.
-  
-  Kautz graphs have some interesting properties, see eg. Wikipedia
-  for details.
-}
-\value{A graph object.}
-\author{Gabor Csardi <csardi.gabor@gmail.com>, the first version in R was
-  written by Vincent Matossian.}
-\seealso{\code{\link{graph.de.bruijn}}, \code{\link{line.graph}}}
-\examples{
-line.graph(graph.kautz(2,1))
-graph.kautz(2,2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.kcores.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.kcores.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.kcores.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.kcores.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-\name{graph.coreness}
-\alias{graph.coreness}
-\concept{K-core}
-\title{K-core decomposition of graphs}
-\description{The k-core of graph is a maximal subgraph in which each
-  vertex has at least degree k. The coreness of a vertex is k if it
-  belongs to the k-core but not to the (k+1)-core.}
-\usage{
-graph.coreness(graph, mode=c("all", "out", "in"))
-}
-\arguments{
-  \item{graph}{The input graph, it can be directed or undirected}
-  \item{mode}{The type of the core in directed graphs. Character
-    constant, possible values: \code{in}: in-cores are computed,
-    \code{out}: out-cores are computed, \code{all}: the corresponding
-    undirected graph is considered. This argument is ignored for
-    undirected graphs.}
-}
-\details{
-  The k-core of a graph is the maximal subgraph in which every vertex
-  has at least degree k. The cores of a graph form layers: the (k+1)-core
-  is always a subgraph of the k-core.
-
-  This function calculates the coreness for each vertex.
-}
-\value{
-  Numeric vector of integer numbers giving the coreness of each vertex.
-}
-\references{Vladimir Batagelj, Matjaz Zaversnik: An O(m)
-  Algorithm for Cores Decomposition of Networks, 2002
-  
-  Seidman S. B. (1983) Network structure and minimum degree, \emph{Social
-    Networks}, 5, 269--287.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{degree}}}
-\examples{
-g <- graph.ring(10)
-g <- add.edges(g, c(1,2, 2,3, 1,3))
-graph.coreness(g) 		% small core triangle in a ring
-}
-\keyword{graphs}
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.knn.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.knn.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.knn.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.knn.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-\name{graph.knn}
-\alias{graph.knn}
-\title{Average nearest neighbor degree}
-\description{Calculate the average nearest neighbor degree of the given
-  vertices and the same quantity in the function of vertex degree}
-\usage{
-graph.knn(graph, vids=V(graph), weights=NULL)
-}
-\arguments{
-  \item{graph}{The input graph. It can be directed, but it will be
-    treated as undirected, i.e. the direction of the edges is ignored.}
-  \item{vids}{The vertices for which the calculation is
-    performed. Normally it includes all vertices. Note, that if not all
-    vertices are given here, then both \sQuote{\code{knn}} and
-    \sQuote{\code{knnk}} will be calculated based on the given vertices
-    only.}
-  \item{weights}{Weight vector. If the graph has a \code{weight} edge
-    attribute, then this is used by default. If this argument is given,
-    then vertex strength (see \code{\link{graph.strength}}) is used
-    instead of vertex degree. But note that \code{knnk} is still given
-    in the function of the normal vertex degree. }
-}
-\details{
-  Note that for zero degree vertices the answer in \sQuote{\code{knn}}
-  is \code{NaN} (zero divided by zero), the same is true for
-  \sQuote{\code{knnk}} if a given degree never appears in the network.
-}
-\value{
-  A list with two members:
-  \item{knn}{A numeric vector giving the average nearest neighbor
-    degree for all vertices in \code{vids}.}
-  \item{knnk}{A numeric vector, its length is the maximum (total)
-    vertex degree in the graph. The first element is the
-    average nearest neighbor degree of vertices with degree one, etc.
-  }
-}
-\references{
-  Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, Alessandro
-  Vespignani: The architecture of complex weighted networks,
-  Proc. Natl. Acad. Sci. USA 101, 3747 (2004)
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-# Some trivial ones
-g <- graph.ring(10)
-graph.knn(g)
-g2 <- graph.star(10)
-graph.knn(g2)
-
-# A scale-free one, try to plot 'knnk'
-g3 <- ba.game(1000, m=5)
-graph.knn(g3)
-
-# A random graph
-g4 <- random.graph.game(1000, p=5/1000)
-graph.knn(g4)
-
-# A weighted graph
-g5 <- graph.star(10)
-E(g5)$weight <- seq(ecount(g5))
-graph.knn(g5)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.laplacian.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.laplacian.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.laplacian.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.laplacian.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-\name{graph.laplacian}
-\alias{graph.laplacian}
-\concept{Graph Laplacian}
-\title{Graph Laplacian}
-\description{The Laplacian of a graph.}
-\usage{
-graph.laplacian(graph, normalized=FALSE, weights=NULL,
-   sparse=getIgraphOpt("sparsematrices"))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{normalized}{Whether to calculate the normalized Laplacian. See
-    definitions below.}
-  \item{weights}{An optional vector giving edge weights for weighted
-    Laplacian matrix. If this is \code{NULL} and the graph has an edge
-    attribute called \code{weight}, then it will be used
-    automatically. Set this to \code{NA} if you want the unweighted
-    Laplacian on a graph that has a \code{weight} edge attribute.}
-  \item{sparse}{Logical scalar, whether to return the result as a sparse
-    matrix. The \code{Matrix} package is required for sparse matrices.}
-}
-\details{
-  The Laplacian Matrix of a graph is a symmetric matrix having
-  the same number of rows and columns as the number of vertices in the
-  graph and element (i,j) is d[i], the degree of vertex i if if i==j,
-  -1 if i!=j and there is an edge between vertices i and j and 0
-  otherwise.
-
-  A normalized version of the Laplacian Matrix is similar: element (i,j)
-  is 1 if i==j, -1/sqrt(d[i] d[j]) if i!=j and there is an edge between
-  vertices i and j and 0 otherwise.
-
-  The weighted version of the Laplacian simply works with the weighted
-  degree instead of the plain degree. I.e. (i,j) is d[i], the weighted
-  degree of vertex i if if i==j, -w if i!=j and there is an edge between
-  vertices i and j with weight w, and 0 otherwise. The weighted degree
-  of a vertex is the sum of the weights of its adjacent edges.
-}
-\value{A numeric matrix.}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-graph.laplacian(g)
-graph.laplacian(g, norm=TRUE)
-graph.laplacian(g, norm=TRUE, sparse=FALSE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.lcf.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.lcf.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.lcf.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.lcf.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-\name{graph.lcf}
-\alias{graph.lcf}
-\concept{LCF notation}
-\title{Creating a graph from LCF notation}
-\description{LCF is short for Lederberg-Coxeter-Frucht, it is a concise notation for
-  3-regular Hamiltonian graphs. It constists of three parameters, the
-  number of vertices in the graph, a list of shifts giving additional
-  edges to a cycle backbone and another integer giving how many times
-  the shifts should be performed. See
-  \url{http://mathworld.wolfram.com/LCFNotation.html} for details.}
-\usage{
-graph.lcf(n, shifts, repeats)
-}
-\arguments{
-  \item{n}{Integer, the number of vertices in the graph.}
-  \item{shifts}{Integer vector, the shifts.}
-  \item{repeats}{Integer constant, how many times to repeat the shifts.}
-}
-%\details{}
-\value{A graph object.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{graph}} can create arbitrary graphs, see also the other
-  functions on the its manual page for creating special graphs.
-}
-\examples{
-# This is the Franklin graph:
-g1 <- graph.lcf(12, c(5,-5), 6)
-g2 <- graph.famous("Franklin")
-graph.isomorphic.vf2(g1, g2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.maxflow.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.maxflow.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.maxflow.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.maxflow.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-\name{graph.maxflow}
-\alias{graph.maxflow}
-\alias{graph.mincut}
-\concept{Maximum flow}
-\concept{Minimum cut}
-\title{Maximum flow in a network}
-\description{In a graph where each edge has a given flow capacity the
-  maximal flow between two vertices is calculated.}
-\usage{
-graph.maxflow(graph, source, target, capacity=NULL)
-graph.mincut(graph, source=NULL, target=NULL, capacity=NULL,
-       value.only = TRUE)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{source}{The id of the source vertex.}
-  \item{target}{The id of the target vertex (sometimes also called sink).}
-  \item{capacity}{Vector giving the capacity of the edges. If this is
-    \code{NULL} (the default) then the \code{capacity} edge attribute is
-    used.}
-  \item{value.only}{Logical scalar, if \code{TRUE} only the minumum cut
-    value is returned, if \code{FALSE} the edges in the cut and a the
-    two (or more) partitions are also returned.
-  }
-}
-\details{
-  \code{graph.maxflow} calculates the maximum flow between two vertices
-  in a weighted (ie. valued) graph. A flow from \code{source} to
-  \code{target} is an assignment of non-negative real numbers to the
-  edges of the graph, satisfying two properties: (1) for each edge the
-  flow (ie. the assigned number) is not more than the capacity of the
-  edge (the \code{capacity} parameter or edge attribute), (2) for every
-  vertex, except the source and the target the incoming flow is the same
-  as the outgoing flow. The value of the flow is the incoming flow of
-  the \code{target} vertex. The maximum flow is the flow of maximum
-  value.
-
-  \code{graph.mincut} calculates the minimum st-cut between two vertices
-  in a graph (if the \code{source} and \code{target} arguments are
-  given) or the minimum cut of the graph (if both \code{source} and
-  \code{target} are \code{NULL}).
-
-  The minimum st-cut between \code{source} and \code{target} is the
-  minimum total weight of edges needed to remove to eliminate all paths from
-  \code{source} to \code{target}.
-
-  The minimum cut of a graph is the minimum total weight of the edges
-  needed to remove to separate the graph into (at least) two
-  components. (Which is to make the graph \emph{not} strongly connected
-  in the directed case.)
-  
-  The maximum flow between two vertices in a graph is the same as the minimum
-  st-cut, so \code{graph.maxflow} and \code{graph.mincut} essentially
-  calculate the same quantity, the only difference is that
-  \code{graph.mincut} can be invoked without giving the \code{source}
-  and \code{target} arguments and then minimum of all possible minimum
-  cuts is calculated.
-
-  For undirected graphs the Stoer-Wagner algorithm (see reference below)
-  is used to calculate the minimum cut.
-}
-\value{
-  For \code{graph.maxflow} a named list with components:
-  \item{value}{A numeric scalar, the value of the maximum flow.}
-  \item{flow}{A numeric vector, the flow itself, one entry for each
-    edge. For undirected graphs this entry is bit trickier,
-    since for these the flow direction is not predetermined by
-    the edge direction. For these graphs the elements of the
-    this vector can be negative, this means that the flow
-    goes from the bigger vertex id to the smaller one. Positive
-    values mean that the flow goes from the smaller vertex id to
-    the bigger one.}
-  \item{cut}{A numeric vector of edge ids, the minimum cut corresponding
-    to the maximum flow.}
-  \item{partition1}{A numeric vector of vertex ids, the vertices in the
-    first partition of the minimum cut corresponding to the maximum
-    flow.}
-  \item{partition2}{A numeric vector of vertex ids, the vertices in the
-    second partition of the minimum cut corresponding to the maximum
-    flow.}
-  
-  For \code{graph.mincut} a numeric constant, the value of the minimum
-  cut, except if \code{value.only=FALSE}. In this case a named list with
-  components:
-  \item{value}{Numeric scalar, the cut value.}
-  \item{cut}{Numeric vector, the edges in the cut.}
-  \item{partition1}{The vertices in the first partition after the cut
-    edges are removed. Note that these vertices might be actually in
-    different components (after the cut edges are removed), as the
-    graph may fall apart into more than two components.}
-  \item{partition2}{The vertices in the second partition after the cut
-    edges are removed. Note that these vertices might be actually in
-    different components (after the cut edges are removed), as the
-    graph may fall apart into more than two components.}
-}
-\references{
-  A. V. Goldberg and R. E. Tarjan: A New Approach to the Maximum Flow
-  Problem \emph{Journal of the ACM} 35:921-940, 1988.
-  
-  M. Stoer and F. Wagner: A simple min-cut algorithm, \emph{Journal of
-  the ACM}, 44 585-591, 1997.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{shortest.paths}}, \code{\link{edge.connectivity}},
-  \code{\link{vertex.connectivity}}}
-\examples{
-E <- rbind( c(1,3,3), c(3,4,1), c(4,2,2), c(1,5,1), c(5,6,2), c(6,2,10))
-colnames(E) <- c("from", "to", "capacity")
-g1 <- graph.data.frame(as.data.frame(E))
-graph.maxflow(g1, source=V(g1)["1"], target=V(g1)["2"])
-
-g <- graph.ring(100)
-graph.mincut(g, capacity=rep(1,vcount(g)))
-graph.mincut(g, value.only=FALSE, capacity=rep(1,vcount(g)))
-
-g2 <- graph( c(1,2,2,3,3,4, 1,6,6,5,5,4, 4,1) )
-E(g2)$capacity <- c(3,1,2, 10,1,3, 2)
-graph.mincut(g2, value.only=FALSE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.motifs.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.motifs.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.motifs.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.motifs.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-\name{graph-motifs}
-\alias{graph.motifs}
-\alias{graph.motifs.no}
-\alias{graph.motifs.est}
-\concept{Graph motif}
-\title{Graph motifs}
-\description{Graph motifs are small connected subgraphs with a
-  well-defined structure. These functions search a graph for various
-  motifs.}
-\usage{
-graph.motifs(graph, size = 3, cut.prob = rep(0, size)) 
-graph.motifs.no(graph, size = 3, cut.prob = rep(0, size)) 
-graph.motifs.est(graph, size = 3, cut.prob = rep(0, size), sample.size =
-    vcount(graph)/10, sample = NULL) 
-}
-\arguments{
-  \item{graph}{Graph object, the input graph.}
-  \item{size}{The size of the motif, currently 3 and 4 are supported
-    only.}
-  \item{cut.prob}{Numeric vector giving the probabilities that the
-    search graph is cut at a certain level. Its length should be the
-    same as the size of the motif (the \code{size} argument). By default
-    no cuts are made.}
-  \item{sample.size}{The number of vertices to use as a starting point
-    for finding motifs. Only used if the \code{sample} argument is
-    \code{NULL}.}
-  \item{sample}{If not \code{NULL} then it specifies the vertices to use
-    as a starting point for finding motifs.}
-}
-\details{
-  \code{graph.motifs} searches a graph for motifs of a given size and
-  returns a numeric vector containing the number of different
-  motifs. The order of the motifs is defined by their isomorphism class,
-  see \code{\link{graph.isoclass}}.
-
-  \code{graph.motifs.no} calculates the total number of motifs of a
-  given size in graph.
-
-  \code{graph.motifs.est} estimates the total number of motifs of a
-  given size in a graph based on a sample. 
-}
-\value{
-  \code{graph.motifs} returns a numeric vector, the number of occurences
-  of each motif in the graph. The motifs are ordered by their
-  isomorphism classes. Note that for unconnected subgraphs, which are
-  not considered to be motifs, the result will be \code{NA}.
-
-  \code{graph.motifs.no} and \code{graph.motifs.est} return a numeric
-  constant.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.isoclass}}}
-\examples{
-g <- barabasi.game(100)
-graph.motifs(g, 3)
-graph.motifs.no(g, 3)
-graph.motifs.est(g, 3)
-}
-\keyword{graphs}
-
-  
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.strength.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.strength.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.strength.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.strength.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-\name{graph.strength}
-\alias{graph.strength}
-\title{Strength or weighted vertex degree}
-\description{Summing up the edge weights of the adjacent edges for each
-  vertex.}
-\usage{
-graph.strength (graph, vids = V(graph), mode = c("all", "out", "in", "total"),
-      loops = TRUE, weights = NULL)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{vids}{The vertices for which the strength will be calculated.}
-  \item{mode}{Character string, \dQuote{out} for out-degree, \dQuote{in} for
-    in-degree or \dQuote{all} for the sum of the two. For undirected
-    graphs this argument is ignored.}
-  \item{loops}{Logical; whether the loop edges are also counted.}
-  \item{weights}{Weight vector. If the graph has a \code{weight} edge
-    attribute, then this is used by default. If the graph does not have
-    a \code{weight} edge attribute and this argument is \code{NULL},
-    then a warning is given and \code{\link{degree}} is called.}
-}
-% \details{}
-\value{
-  A numeric vector giving the strength of the vertices.
-}
-\references{
-  Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, Alessandro
-  Vespignani: The architecture of complex weighted networks,
-  Proc. Natl. Acad. Sci. USA 101, 3747 (2004)
-}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{\code{\link{degree}} for the unweighted version.}
-\examples{
-g <- graph.star(10)
-E(g)$weight <- seq(ecount(g))
-graph.strength(g)
-graph.strength(g, mode="out")
-graph.strength(g, mode="in")
-
-# No weights, a warning is given
-g <- graph.ring(10)
-graph.strength(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.structure.Rd igraph-0.6.5/interfaces/R/igraph/man/graph.structure.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graph.structure.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graph.structure.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,347 +0,0 @@
-\name{graph.structure}
-\alias{add.edges}
-\alias{add.vertices}
-\alias{delete.edges}
-\alias{delete.vertices}
-\alias{[.igraph}
-\alias{[[.igraph}
-\alias{[<-.igraph}
-\alias{+.igraph}
-\alias{-.igraph}
-\alias{edge}
-\alias{edges}
-\alias{vertex}
-\alias{vertices}
-\alias{path}
-\title{Method for structural manipulation of graphs}
-\description{These are the methods for simple manipulation of graphs:
-  adding and deleting edges and vertices.}
-\usage{
-\method{[}{igraph}(x, i, j, \dots, from, to,
-                   sparse=getIgraphOpt("sparsematrices"),
-                   edges=FALSE, drop=TRUE,
-                   attr=if (is.weighted(x)) "weight" else NULL)
-\method{[[}{igraph}(x, i, j, \dots, directed=TRUE, edges=FALSE, exact=TRUE)
-\method{[}{igraph}(x, i, j, \dots, from, to,
-                   attr=if (is.weighted(x)) "weight" else NULL) <- value 
-
-\method{+}{igraph}(e1, e2)
-\method{-}{igraph}(e1, e2)
-vertex(\dots)
-vertices(\dots)
-edge(\dots)
-edges(\dots)
-path(\dots)
-
-add.edges(graph, edges, \dots, attr=list())
-add.vertices(graph, nv, \dots, attr=list())
-delete.edges(graph, edges)
-delete.vertices(graph, v)
-}
-\arguments{
-  \item{x,graph,e1}{The graph to work on.}
-  \item{i,j}{Vertex ids or names or logical vectors. See details below.}
-  \item{\dots}{These are currently ignored for the indexing operators.
-    For \code{vertex}, \code{vertices}, \code{edge}, \code{edges} and
-    \code{path} see details below.
-    For \code{add.edges} and \code{add.vertices} these additional
-    parameters will be added as edge/vertex attributes. Note that these
-    arguments have to be named.}
-  \item{from}{A numeric or character vector giving vertex ids or names.
-    Together with the \code{to} argument, it can be used to query/set
-    a sequence of edges. See details below.
-
-    This argument cannot be present together with any of the
-    \code{i} and \code{j} arguments and if it is present, then the
-    \code{to} argument must be present as well.}
-  \item{to}{A numeric or character vector giving vertex ids or names.
-    Together with the \code{from} argument, it can be used to query/set
-    a sequence of edges. See details below.
-
-    This argument cannot be present together with any of the
-    \code{i} and \code{j} arguments and if it is present, then the
-    \code{from} argument must be present as well.}
-  \item{sparse}{Logical scalar, whether to use sparse matrix.}
-  \item{directed}{Logical scalar, whether to consider edge directions
-    in directed graphs. It is ignored for undirected graphs.}
-  \item{edges}{Logical scalar, whether to return edge ids.}
-  \item{drop,exact}{These arguments are ignored.}
-  \item{value}{A logical or numeric scalar or \code{NULL}. If
-     \code{FALSE}, \code{NULL} or zero, then the specified edges will be
-     deleted. If \code{TRUE} or a non-zero numeric value, then the
-     specified edges will be added. (Only if they don't yet exist.)}
-  \item{e2}{See details below.}
-  \item{attr}{For the indexing operators: if not \code{NULL}, then it
-     should be the name of an edge attribute. This attribute is queried,
-     or updated to the given value. For \code{add.edges} and
-     \code{add.vertices}: additional edge/vertex attributes to add. This
-     will be concatenated to the other supplied attributes.}
-  \item{nv}{Numeric constant, the number of vertices to add.}
-  \item{v}{Vector sequence, the vertices to remove.}
-}
-\details{
-  There are, by and large, three ways to manipulate the structure
-  of a graph in igraph. The first way is using the \sQuote{\code{[}} and
-  \sQuote{\code{[[}} indexing operators on the graph object, very
-  much like the graph was an adjacency matrix (\code{[}) or an adjacency
-  list (\code{[}). The single bracket indexes the (possibly weighted)
-  adjacency matrix of the graph. The double bracket operator is
-  similar, but queries the adjacencly list of the graph. The details
-  on how to use the indexing operators are 
-  discussed below.
-
-  The addition (\sQuote{\code{+}}) and division (\sQuote{\code{-}})
-  operators can also be used to add and remove vertices and edges. This
-  form is sometimes more readable, and is usually the best if the user 
-  also wants to add attributes, together with the new vertices/edges.
-  Please see the details below.
-
-  In addition, the four functions, \code{add.vertices}, \code{add.edges},
-  \code{delete.vertices} and \code{delete.edges} can also be used
-  to manipulate the structure.
-}
-\section{The indexing operators}{
-  The one-bracket (\sQuote{\code{[}}) and two-brackets
-  (\sQuote{\code{[[}}) indexing operators allow relatively
-  straightforward query and update operations on graphs. The one bracket
-  operator works on the (imaginary) adjacency matrix of the graph.
-  Here is what you can do with it:
-
-  \enumerate{
-    \item Check whether there is an edge between two vertices (\eqn{v}
-      and \eqn{w}) in the graph: \preformatted{  graph[v, w]}
-      A numeric scalar is returned, one if the edge exists, zero
-      otherwise.
-    \item Extract the (sparse) adjacency matrix of the graph, or part of
-      it: \preformatted{  graph[]
-  graph[1:3,5:6]
-  graph[c(1,3,5),]}
-      The first variants returns the full adjacency matrix, the other
-      two return part of it.
-    \item The \code{from} and \code{to} arguments can be used to check
-      the existence of many edges. In this case, both \code{from} and
-      \code{to} must be present and they must have the same length. They
-      must contain vertex ids or names. A numeric vector is returned, of
-      the same length as \code{from} and \code{to}, it contains ones
-      for existing edges edges and zeros for non-existing ones.
-      Example: \preformatted{  graph[from=1:3, to=c(2,3,5)]}.
-    \item For weighted graphs, the \code{[} operator returns the edge
-      weights. For non-esistent edges zero weights are returned. Other
-      edge attributes can be queried as well, by giving the \code{attr}
-      argument. 
-    \item Querying edge ids instead of the existance of edges or edge
-      attributes. E.g. \preformatted{  graph[1, 2, edges=TRUE]}
-      returns the id of the edge between vertices 1 and 2, or zero if
-      there is no such edge.
-    \item Adding one or more edges to a graph. For this the element(s) of
-      the imaginary adjacency matrix must be set to a non-zero numeric
-      value (or \code{TRUE}): \preformatted{  graph[1, 2] <- 1
-  graph[1:3,1] <- 1
-  graph[from=1:3, to=c(2,3,5)] <- TRUE}
-      This does not affect edges that are already present in the graph,
-      i.e. no multiple edges are created.
-    \item Adding weighted edges to a graph. The \code{attr} argument
-      contains the name of the edge attribute to set, so it does not
-      have to be \sQuote{weight}: \preformatted{  graph[1, 2, attr="weight"]<- 5
-  graph[from=1:3, to=c(2,3,5)] <- c(1,-1,4)}
-      If an edge is already present in the network, then only its
-      weigths or other attribute are updated. If the graph is already
-      weighted, then the \code{attr="weight"} setting is implicit, and
-      one does not need to give it explicitly.
-    \item Deleting edges. The replacement syntax allow the deletion of
-      edges, by specifying \code{FALSE} or \code{NULL} as the
-      replacement value: \preformatted{  graph[v, w] <- FALSE}
-      removes the edge from vertex \eqn{v} to vertex \eqn{w}.
-      As this can be used to delete edges between two sets of vertices,
-      either pairwise: \preformatted{  graph[from=v, to=w] <- FALSE}
-      or not: \preformatted{  graph[v, w] <- FALSE }
-      if \eqn{v} and \eqn{w} are vectors of edge ids or names.
-  }
-
-  The double bracket operator indexes the (imaginary) adjacency list
-  of the graph. This can used for the following operations:
-  \enumerate{
-    \item Querying the adjacent vertices for one or more
-      vertices: \preformatted{  graph[[1:3,]]
-  graph[[,1:3]]}
-      The first form gives the successors, the second the predessors
-      or the 1:3 vertices. (For undirected graphs they are equivalent.)
-    \item Querying the incident edges for one or more vertices,
-      if the \code{edges} argument is set to
-      \code{TRUE}: \preformatted{  graph[[1:3, , edges=TRUE]]
-  graph[[, 1:3, edges=TRUE]]}
-    \item Querying the edge ids between two sets or vertices,
-      if both indices are used. E.g. \preformatted{  graph[[v, w, edges=TRUE]]}
-      gives the edge ids of all the edges that exist from vertices
-      \eqn{v} to vertices \eqn{w}.
-  }
-
-  Both the \sQuote{\code{[}} and \sQuote{\code{[[}} operators allow
-  logical indices and negative indices as well, with the usual R
-  semantics. E.g. \preformatted{  graph[degree(graph)==0, 1] <- 1}
-  adds an edge from every isolate vertex to vertex one,
-  and \preformatted{  G <- graph.empty(10)
-  G[-1,1] <- TRUE}
-  creates a star graph.
-
-  Of course, the indexing operators support vertex names,
-  so instead of a numeric vertex id a vertex can also be given to
-  \sQuote{\code{[}} and \sQuote{\code{[[}}.
-}
-\section{The plus operator for adding vertices and edges}{
-  The plus operator can be used to add vertices or edges to graph.
-  The actual operation that is performed depends on the type of the
-  right hand side argument.
-  \itemize{
-  \item If it is another igraph graph object, then the disjoint union of
-    the two graphs is calculated, see \code{\link{graph.disjoint.union}}.
-  \item If it is a numeric scalar, then the specified number of vertices
-    are added to the graph.
-  \item If it is a character scalar or vector, then it is interpreted as
-    the names of the vertices to add to the graph.
-  \item If it is an object created with the \code{vertex} or
-    \code{vertices} function, then new vertices are added to the
-    graph. This form is appropriate when one wants to add some vertex
-    attributes as well. The operands of the \code{vertices} function
-    specifies the number of vertices to add and their attributes as
-    well.
-
-    The unnamed arguments of \code{vertices} are concatenated and
-    used as the \sQuote{\code{name}} vertex attribute (i.e. vertex
-    names), the named arguments will be added as additional vertex
-    attributes. Examples: \preformatted{  g <- g + vertex(shape="circle", color="red")
-  g <- g + vertex("foo", color="blue")
-  g <- g + vertex("bar", "foobar")
-  g <- g + vertices("bar2", "foobar2", color=1:2, shape="rectangle")}
-    See more examples below.
-
-    \code{vertex} is just an alias to \code{vertices}, and it is
-    provided for readability. The user should use it if a single vertex
-    is added to the graph.
-
-  \item If it is an object created with the \code{edge} or \code{edges}
-    function, then new edges will be added to the graph. The new edges
-    and possibly their attributes can be specified as the arguments of
-    the \code{edges} function.
-
-    The unnamed arguments of \code{edges} are concatenated and used
-    as vertex ids of the end points of the new edges. The named
-    arguments will be added as edge attributes.
-
-    Examples: \preformatted{  g <- graph.empty() + vertices(letters[1:10]) +
-  vertices("foo", "bar", "bar2", "foobar2")
-  g <- g + edge("a", "b")
-  g <- g + edges("foo", "bar", "bar2", "foobar2")
-  g <- g + edges(c("bar", "foo", "foobar2", "bar2"), color="red", weight=1:2)}
-    See more examples below.
-
-    \code{edge} is just an alias to \code{edges} and it is provided
-    for readability. The user should use it if a single edge is added to
-    the graph.
-
-  \item If it is an object created with the \code{path} function, then
-    new edges that form a path are added. The edges and possibly their
-    attributes are specified as the arguments to the \code{path}
-    function. The non-named arguments are concatenated and interpreted
-    as the vertex ids along the path. The remaining arguments are added
-    as edge attributes.
-
-    Examples: \preformatted{  g <- graph.empty() + vertices(letters[1:10])
-  g <- g + path("a", "b", "c", "d")
-  g <- g + path("e", "f", "g", weight=1:2, color="red")
-  g <- g + path(c("f", "c", "j", "d"), width=1:3, color="green")}
-  }
-
-  It is important to note that, although the plus operator is
-  commutative, i.e. is possible to write \preformatted{  graph <- "foo" + graph.empty()}
-  it is not associative, e.g. \preformatted{  graph <- "foo" + "bar" + graph.empty()}
-  results a syntax error, unless parentheses are used: \preformatted{  graph <- "foo" + ( "bar" + graph.empty() )}
-  For clarity, we suggest to always put the graph object on the left
-  hand side of the operator: \preformatted{  graph <- graph.empty() + "foo" + "bar"}  
-}
-\section{The minus operator for deleting vertices and edges}{
-  The minus operator (\sQuote{\code{-}}) can be used to remove vertices
-  or edges from the graph. The operation performed is selected based on
-  the type of the right hand side argument:
-  \itemize{
-  \item If it is an igraph graph object, then the difference of the
-    two graphs is calculated, see \code{\link{graph.difference}}.
-  \item If it is a numeric or character vector, then it is interpreted
-    as a vector of vertex ids and the specified vertices will be
-    deleted from the graph. Example: \preformatted{  g <- graph.ring(10)
-  V(g)$name <- letters[1:10]
-  g <- g - c("a", "b")}
-  \item If \code{e2} is a vertex sequence (e.g. created by the
-    \code{\link{V}} function), then these vertices will be deleted from
-    the graph.
-  \item If it is an edge sequence (e.g. created by the \code{\link{E}}
-    function), then these edges will be deleted from the graph.
-  \item If it is an object created with the \code{vertex} (or the
-    \code{vertices}) function, then all arguments of \code{vertices} are
-    concatenated and the result is interpreted as a vector of vertex
-    ids. These vertices will be removed from the graph.
-  \item If it is an object created with the \code{edge} (or the
-    \code{edges}) function, then all arguments of \code{edges} are
-    concatenated and then interpreted as edges to be removed from the
-    graph.
-    Example: \preformatted{  g <- graph.ring(10)
-  V(g)$name <- letters[1:10]
-  E(g)$name <- LETTERS[1:10]
-  g <- g - edge("e|f")
-  g <- g - edge("H")}
-  \item If it is an object created with the \code{path} function,
-    then all \code{path} arguments are concatenated and then interpreted
-    as a path along which edges will be removed from the graph.
-    Example: \preformatted{  g <- graph.ring(10)
-  V(g)$name <- letters[1:10]
-  g <- g - path("a", "b", "c", "d")}
-  }
-}
-\section{More functions to manipulate graph structure}{
-  \code{add.edges} adds the specified edges to the graph. The ids of the
-  vertices are preserved. The additionally supplied named arguments will
-  be added as edge attributes for the new edges. If an attribute was not
-  present in the original graph, its value for the original edges will
-  be \code{NA}.
-
-  \code{add.vertices} adds the specified number of isolate vertices to
-  the graph. The ids of the old vertices are preserved. The additionally
-  supplied named arguments will be added as vertex attributes for the
-  new vertices. If an attribute was not present in the original graph,
-  its value is set to \code{NA} for the original vertices.
-
-  \code{delete.edges} removes the specified edges from the graph. If a
-  specified edge is not present, the function gives an error message,
-  and the original graph remains unchanged.
-  The ids of the vertices are preserved.
-
-  \code{delete.vertices} removes the specified vertices from the graph
-  together with their adjacent edges. The ids of the vertices are
-  \emph{not} preserved.
-}
-\value{For the indexing operators see the description above. The other
-  functions return a new graph.}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-# 10 vertices named a,b,c,... and no edges
-g <- graph.empty() + vertices(letters[1:10])
-
-# Add edges to make it a ring
-g <- g + path(letters[1:10], letters[1], color="grey")
-
-# Add some extra random edges
-g <- g + edges(sample(V(g), 10, replace=TRUE), color="red")
-g$layout <- layout.circle
-if (interactive()) {
-  plot(g)
-}
-
-# The old-style operations
-g <- graph.ring(10)
-add.edges(g, c(2,6,3,7) )
-delete.edges(g, E(g, P=c(1,10, 2,3)) )
-delete.vertices(g, c(2,7,8) )
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/graphNEL.Rd igraph-0.6.5/interfaces/R/igraph/man/graphNEL.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/graphNEL.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/graphNEL.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,71 +0,0 @@
-\name{conversion between igraph and graphNEL graphs}
-\alias{igraph.from.graphNEL}
-\alias{igraph.to.graphNEL}
-\concept{Conversion}
-\concept{graph package}
-\concept{graphNEL object}
-\title{Convert igraph graphs to graphNEL objects or back}
-\description{The graphNEL class is defined in the \code{graph} package,
-  it is another way to represent graphs. These functions are provided to
-  convert between the igraph and the graphNEL objects.}
-\usage{
-igraph.from.graphNEL(graphNEL, name = TRUE, weight = TRUE,
-              unlist.attrs = TRUE)
-igraph.to.graphNEL(graph)
-}
-\arguments{
-  \item{graphNEL}{The graphNEL graph.}
-  \item{name}{Logical scalar, whether to add graphNEL vertex names as an
-    igraph vertex attribute called \sQuote{\code{name}}.}
-  \item{weight}{Logical scalar, whether to add graphNEL edge weights as
-    an igraph edge attribute called \sQuote{\code{weight}}. (graphNEL
-    graphs are always weighted.)}
-  \item{unlist.attrs}{Logical scalar. graphNEL attribute query functions
-    return the values of the attributes in R lists, if this argument is
-    \code{TRUE} (the default) these will be converted to atomic vectors,
-    whenever possible, before adding them to the igraph graph.}
-  \item{graph}{An igraph graph object.}
-}
-\details{
-  \code{igraph.from.graphNEL} takes a graphNEL graph and converts it to
-  an igraph graph. It handles all graph/vertex/edge attributes. If the
-  graphNEL graph has a vertex attribute called \sQuote{\code{name}} it
-  will be used as igraph vertex attribute \sQuote{\code{name}} and the
-  graphNEL vertex names will be ignored.
-
-  Because graphNEL graphs poorly support multiple edges, the edge
-  attributes of the multiple edges are lost: they are all replaced by
-  the attributes of the first of the multiple edges.
-  
-  \code{igraph.to.graphNEL} converts and igraph graph to a graphNEL
-  graph. It converts all graph/vertex/edge attributes. If the igraph
-  graph has a vertex attribute \sQuote{\code{name}}, then it will be
-  used to assign vertex names in the graphNEL graph. Otherwise igraph
-  vertex ids will be used for this purpose.
-}
-\value{
-  \code{igraph.from.graphNEL} returns an igraph graph object.
-
-  \code{igraph.to.graphNEL} returns a graphNEL graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{get.adjacency}}, \code{\link{graph.adjacency}},
-  \code{\link{get.adjlist}} and \code{\link{graph.adjlist}}.
-}
-\examples{
-## Undirected
-g <- graph.ring(10)
-V(g)$name <- letters[1:10]
-GNEL <- igraph.to.graphNEL(g)
-g2 <- igraph.from.graphNEL(GNEL)
-g2
-
-## Directed
-g3 <- graph.star(10, mode="in")
-V(g3)$name <- letters[1:10]
-GNEL2 <- igraph.to.graphNEL(g3)
-g4 <- igraph.from.graphNEL(GNEL2)
-g4
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/grg.game.Rd igraph-0.6.5/interfaces/R/igraph/man/grg.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/grg.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/grg.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-\name{grg.game}
-\alias{grg.game}
-\concept{Geometric random graph}
-\title{Geometric random graphs}
-\description{Generate a random graph based on the distance of random
-  point on a unit square}
-\usage{
-grg.game(nodes, radius, torus = FALSE, coords = FALSE)
-}
-\arguments{
-  \item{nodes}{The number of vertices in the graph.}
-  \item{radius}{The radius within which the vertices will be connected
-    by an edge.}
-  \item{torus}{Logical constant, whether to use a torus instead of a
-    square.}
-  \item{coords}{Logical scalar, whether to add the positions of the
-    vertices as vertex attributes called \sQuote{\code{x}} and
-    \sQuote{\code{y}}.}
-}
-\details{
-  First a number of points are dropped on a unit square, these points
-  correspond to the vertices of the graph to create. Two points will be
-  connected with an undirected edge if they are closer to each other in
-  Euclidean norm than a given radius. If the \code{torus} argument is
-  \code{TRUE} then a unit area torus is used instead of a square.
-}
-\value{
-  A graph object. If \code{coords} is \code{TRUE} then with vertex
-  attributes \sQuote{\code{x}} and \sQuote{\code{y}}.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}, first version was
-  written by Keith Briggs \email{keith.briggs@bt.com}}
-\seealso{\code{\link{random.graph.game}}}
-\examples{
-g <- grg.game(1000, 0.05, torus=FALSE)
-g2 <- grg.game(1000, 0.05, torus=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/growing.random.game.Rd igraph-0.6.5/interfaces/R/igraph/man/growing.random.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/growing.random.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/growing.random.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-\name{growing.random.game}
-\alias{growing.random.game}
-\concept{Random graph model}
-\title{Growing random graph generation}
-\description{This function creates a random graph by simulating its
-  stochastic evolution.}
-\usage{
-growing.random.game(n, m = 1, directed = TRUE, citation = FALSE)
-}
-\arguments{
-  \item{n}{Numeric constant, number of vertices in the graph.}
-  \item{m}{Numeric constant, number of edges added in each time step.}
-  \item{directed}{Logical, whether to create a directed graph.}
-  \item{citation}{Logical. If \code{TRUE} a citation graph is created,
-    ie. in each time step the added edges are originating from the new
-    vertex. }
-}
-\details{
-  This is discrete time step model, in each time step a new vertex is
-  added to the graph and \code{m} new edges are created. If
-  \code{citation} is \code{FALSE} these edges are connecting two
-  uniformly randomly chosen vertices, otherwise the edges are connecting 
-  new vertex to uniformly randomly chosen old vertices.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{barabasi.game}}, \code{\link{erdos.renyi.game}}}
-\examples{
-g <- growing.random.game(500, citation=FALSE)
-g2 <- growing.random.game(500, citation=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/hrg.Rd igraph-0.6.5/interfaces/R/igraph/man/hrg.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/hrg.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/hrg.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,228 +0,0 @@
-\name{Hierarchical random graphs}
-\alias{HRG}
-\alias{hrg.consensus}
-\alias{hrg.game}
-\alias{hrg.create}
-\alias{hrg.predict}
-\alias{hrg.dendrogram}
-\alias{hrg.fit}
-\alias{print.igraphHRG}
-\alias{print.igraphHRGConsensus}
-\concept{Hierarchical random graphs}
-\title{Hierarchical random graphs}
-\description{Fitting and sampling hierarchical random graph models.}
-\usage{
-hrg.fit (graph, hrg = NULL, start = FALSE, steps = 0)
-hrg.consensus (graph, hrg = NULL, start = FALSE, num.samples = 10000)
-
-hrg.create (graph, prob)
-hrg.dendrogram (hrg)
-
-hrg.game (hrg)
-
-hrg.predict (graph, hrg = NULL, start = FALSE, num.samples = 10000,
-             num.bins = 25)
-
-\method{print}{igraphHRG}(x, type=c("auto", "tree", "plain"),
-           level = 3, \dots)
-\method{print}{igraphHRGConsensus}(x, \dots)
-}
-\arguments{
-  \item{graph}{The graph to fit the model to. Edge directions are
-    ignored in directed graphs.}
-  \item{hrg}{A hierarchical random graph model, in the form of an
-    \code{igraphHRG} object. \code{hrg.fit} allows this to be
-    \code{NULL}, in which case a random starting point is used for the
-    fitting. \code{hrg.consensus} and \code{hrg.predict} allow this to
-    be \code{NULL} as well, then a HRG is fitted to the graph first,
-    from a random starting point.}
-  \item{start}{Logical, whether to start the fitting/sampling from the
-    supplied \code{igraphHRG} object, or from a random starting point.}
-  \item{steps}{The number of MCMC steps to make. If this is zero, then
-    the MCMC procedure is performed until convergence.}
-  \item{num.samples}{Number of samples to use for consensus generation
-    or missing edge prediction.}
-  \item{prob}{A vector of probabilities, one for each vertex, in the
-    order of vertex ids.}
-  \item{num.bins}{Number of bins for the edge probabilities. Give a
-    higher number for a more accurate prediction.}
-  \item{x}{\code{igraphHRG} or \code{igraphHRGConsensus} object to
-    print.}
-  \item{type}{How to print the dendrogram, see details below.}
-  \item{level}{The number of top levels to print from the dendrogram.}
-  \item{\dots}{Additional arguments, not used currently.}
-}
-\details{
- A hierarchical random graph is an ensemble of undirected
- graphs with \eqn{n} vertices. It is defined via a binary tree with
- \eqn{n} leaf and \eqn{n-1} internal vertices, where the
- internal vertices are labeled with probabilities.
- The probability that two vertices are connected in the random graph
- is given by the probability label at their closest common
- ancestor.
-
- Please see references below for more about hierarchical random graphs. 
- 
- igraph contains functions for fitting HRG models to a given network
- (\code{hrg.fit}, for generating networks from a given HRG
- ensemble (\code{hrg.game}), converting an igraph graph to a
- HRG and back (\code{hrg.create}, \code{hrg.dendrogram}),
- for calculating a consensus tree from a set of sampled HRGs
- (\code{hrg.consensus}) and for predicting missing edges in a
- network based on its HRG models (\code{hrg.predict}). 
- 
- The igraph HRG implementation is heavily based on the code
- published by Aaron Clauset, at his website,
- \url{http://tuvalu.santafe.edu/~aaronc/hierarchy/}.
-
- \code{hrg.fit} fits a HRG to a given graph. It takes the specified
- \code{steps} number of MCMC steps to perform the fitting, or a
- convergence criteria if the specified number of steps is
- zero. \code{hrg.fit} can start from a given HRG, if this is given in
- the \code{hrg} argument and the \code{start} argument is \code{TRUE}.
-
- \code{hrg.consensus} creates a consensus tree from several fitted
- hierarchical random graph models, using phylogeny methods. If the
- \code{hrg} argument is given and \code{start} is set to \code{TRUE},
- then it starts sampling from the given HRG. Otherwise it optimizes the
- HRG log-likelihood first, and then samples starting from the optimum.
-
- \code{hrg.create} creates a HRG from an igraph graph. The igraph graph
- must be a directed binary tree, with \eqn{n-1} internal and \eqn{n}
- leaf vertices. The \code{prob} argument contains the HRG probability
- labels for each vertex; these are ignored for leaf vertices.
-
- \code{hrg.dendrogram} creates the corresponsing igraph tree of a
- hierarchical random graph model.
-
- \code{hrg.game} samples a graph from a given hierarchical random graph
- model.
-
- \code{hrg.predict} uses a hierarchical random graph model to predict
- missing edges from a network. This is done by sampling hierarchical
- models around the optimum model, proportionally to their
- likelihood. The MCMC sampling is stated from \code{hrg}, if it is given
- and the \code{start} argument is set to \code{TRUE}. Otherwise a HRG is
- fitted to the graph first.
-}
-\section{Printing HRGs to the screen}{
-  \code{igraphHRG} objects can be printed to the screen in two forms: as
-  a tree or as a list, depending on the \code{type} argument of the
-  print function. By default the \code{auto} type is used, which selects
-  \code{tree} for small graphs and \code{simple} (=list) for bigger
-  ones. The \code{tree} format looks like
-  this: \preformatted{Hierarchical random graph, at level 3:
-g1        p=   0  
-'- g15    p=0.33  1 
-   '- g13 p=0.88  6  3  9  4  2  10 7  5  8 
-'- g8     p= 0.5  
-   '- g16 p= 0.2  20 14 17 19 11 15 16 13
-   '- g5  p=   0  12 18  }
-  This is a graph with 20 vertices, and the
-  top three levels of the fitted hierarchical random graph are
-  printed. The root node of the HRG is always vertex group #1
-  (\sQuote{\code{g1}} in the the printout). Vertex pairs in the left
-  subtree of \code{g1} connect to vertices in the right subtree with
-  probability zero, according to the fitted model. \code{g1} has two
-  subgroups, \code{g15} and \code{g8}. \code{g15} has a subgroup of a
-  single vertex (vertex 1), and another larger subgroup that contains
-  vertices 6, 3, etc. on lower levels, etc.
-
-  The \code{plain} printing is simpler and faster to produce, but less
-  visual: \preformatted{Hierarchical random graph:
-g1  p=0.0 -> g12 g10   g2  p=1.0 -> 7 10      g3  p=1.0 -> g18 14    
-g4  p=1.0 -> g17 15    g5  p=0.4 -> g15 17    g6  p=0.0 -> 1 4       
-g7  p=1.0 -> 11 16     g8  p=0.1 -> g9 3      g9  p=0.3 -> g11 g16   
-g10 p=0.2 -> g4 g5     g11 p=1.0 -> g6 5      g12 p=0.8 -> g8 8      
-g13 p=0.0 -> g14 9     g14 p=1.0 -> 2 6       g15 p=0.2 -> g19 18    
-g16 p=1.0 -> g13 g2    g17 p=0.5 -> g7 13     g18 p=1.0 -> 12 19     
-g19 p=0.7 -> g3 20}
-  It lists the two subgroups of each internal node, in
-  as many columns as the screen width allows.
-
-  Consensus dendrograms (\code{igraphHRGConsensus} objects) are printed
-  simply by listing the children of each internal node of the
-  dendrogram: \preformatted{HRG consensus tree:
-g1 -> 11 12 13 14 15 16 17 18 19 20
-g2 -> 1  2  3  4  5  6  7  8  9  10   
-g3 -> g1 g2}
-  The root of the dendrogram is \code{g3} (because it has no incoming
-  edges), and it has two subgroups, \code{g1} and \code{g2}.
-}
-\value{
-  \code{hrg.fit} returns an \code{igraphHRG} object. This is a list with
-  the following members:
-  \item{left}{Vector that contains the left children of the internal
-    tree vertices. The first vertex is always the root vertex, so
-    the first element of the vector is the left child of the root
-    vertex. Internal vertices are denoted with negative numbers,
-    starting from -1 and going down, i.e. the root vertex is
-    -1. Leaf vertices are denoted by non-negative number, starting
-    from zero and up.}
-  \item{right}{Vector that contains the right children of the
-    vertices, with the same encoding as the \code{left} vector.}
-  \item{prob}{The connection probabilities attached to the internal
-    vertices, the first number belongs to the root vertex
-    (i.e. internal vertex -1), the second to internal vertex -2,
-    etc.}
-  \item{edges}{The number of edges in the subtree below the given
-    internal vertex.}
-  \item{vertices}{The number of vertices in the subtree below the
-    given internal vertex, including itself.}
-
-  \code{hrg.consensus} returns a list of two objects. The first is an
-  \code{igraphHRGConsensus} object, the second is an \code{igraphHRG}
-  object. The \code{igraphHRGConsensus} object has the following
-  members:
-  \item{parents}{For each vertex, the id of its parent vertex is stored,
-    or zero, if the vertex is the root vertex in the tree. The first n
-    vertex ids (from 0) refer to the original vertices of the graph,
-    the other ids refer to vertex groups.}
-  \item{weights}{Numeric vector, counts the number of times a given
-    tree split occured in the generated network samples, for each
-    internal vertices. The order is the same as in the \code{parents}
-    vector.}
-
-  \code{hrg.create} returns an \code{igraphHRG} object.
-
-  \code{hrg.dendrogram} returns an igraph graph.
-
-  \code{hrg.game} returns an igraph graph.
-}
-\references{
-  A. Clauset, C. Moore, and M.E.J. Newman. Hierarchical structure and the
-  prediction of missing links in networks. \emph{Nature} 453, 98--101
-  (2008); 
-
-  A. Clauset, C. Moore, and M.E.J. Newman. Structural Inference of
-  Hierarchies in Networks. In E. M. Airoldi  et al. (Eds.): ICML 2006 Ws,
-  \emph{Lecture Notes in Computer Science} 4503, 1--13. Springer-Verlag,
-  Berlin Heidelberg (2007). 
-}
-\author{
-  Gabor Csardi \email{csardi.gabor@gmail.com}, based on code from Aaron
-  Clauset, thanks Aaron!
-}
-% \seealso{}
-\examples{
-
-## We are not running these examples any more, because they
-## take a long time (~15 seconds) to run and this is against the CRAN
-## repository policy. Copy and paste them by hand to your R prompt if
-## you want to run them.
-
-\dontrun{
-## A graph with two dense groups
-g <- erdos.renyi.game(10, p=1/2) + erdos.renyi.game(10, p=1/2)
-hrg <- hrg.fit(g)
-hrg
-
-## The consensus tree for it
-hrg.consensus(g, hrg=hrg, start=TRUE)
-
-## Prediction of missing edges
-g2 <- graph.full(4) + (graph.full(4) - path(1,2))
-hrg.predict(g2)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.console.Rd igraph-0.6.5/interfaces/R/igraph/man/igraph.console.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.console.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/igraph.console.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-\name{igraph console}
-\alias{igraph.console}
-\concept{The igraph console}
-\title{The igraph console}
-\description{The igraph console is a GUI windows that shows what the
-  currently running igraph function is doing.}
-\usage{
-igraph.console()
-}
-%\arguments{}
-\details{
-  The console can be started by calling the \code{igraph.console}
-  function. Then it stays open, until the user closes it.
-
-  Another way to start it to set the \code{verbose} igraph option to
-  \dQuote{tkconsole} via \code{igraph.options}. Then the console
-  (re)opens each time an igraph function supporting it starts; to close
-  it, set the \code{verbose} option to another value.
-
-  The console is written in Tcl/Tk and required the \code{tcltk}
-  package.
-}
-\value{\code{NULL}, invisibly.}
-% \references
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{igraph.options}} and the \code{verbose} option.}
-%\examples{}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.par.Rd igraph-0.6.5/interfaces/R/igraph/man/igraph.par.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.par.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/igraph.par.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,104 +0,0 @@
-\name{igraph options}
-\alias{igraph.options}
-\alias{getIgraphOpt}
-\alias{igraph.par}
-\title{Parameters for the igraph package}
-\description{igraph has some parameters which (usually) affect the
-  behavior of many functions. These can be set for the whole session via
-  \code{igraph.options}.
-}
-\usage{
-igraph.options(\dots)
-getIgraphOpt(x, default = NULL)
-igraph.par(parid, parvalue = NULL)
-}
-\arguments{
-  \item{\dots}{A list may be given as the only argument, or any number
-    of arguments may be in the \code{name=value} form, or no argument at
-    all may be given. See the Value and Details sections for explanation.}
-  \item{x}{A character string holding an option name.}
-  \item{default}{If the specified option is not set in the options list,
-    this value is returned. This facilitates retrieving an option and
-    checking whether it is set and setting it separately if not.}
-  \item{parid}{The name of the parameter. See the currently used
-    parameters below.}
-  \item{parvalue}{The new value of the parameter. If \code{NULL} then
-    the current value of the parameter is listed.}
-}
-\details{
-  From igraph version 0.6, \code{igraph.par} is deprecated. Please use
-  the more flexible \code{igraph.options} and \code{getIgraphOpt}
-  functions instead.
-
-  The parameter values set via a call to the \code{igraph.options}
-  function will remain in effect for the rest of the session, affecting
-  the subsequent behaviour of the other functions of the \code{igraph}
-  package for which the given parameters are relevant.
-
-  This offers the possibility of customizing the functioning of the
-  \code{igraph} package, for instance by insertions of appropriate calls
-  to \code{igraph.options} in a load hook for package \pkg{igraph}.
-  
-  The currently used parameters in alphabetical order:
-  \describe{
-    \item{add.params}{Logical scalar, whether to add model
-      parameter to the graphs that are created by the various
-      graph constructors. By default it is \code{TRUE}.}
-    \item{add.vertex.names}{Logical scalar, whether to add
-      vertex names to node level indices, like degree, betweenness
-      scores, etc. By default it is \code{TRUE}.}
-    \item{dend.plot.type}{The plotting function to use when plotting
-      community structure dendrograms via
-      \code{\link{dendPlot}}}. Possible values are \sQuote{auto} (the
-      default), \sQuote{phylo}, \sQuote{hclust} and
-      \sQuote{dendrogram}. See \code{\link{dendPlot}} for details.
-    \item{edge.attr.comb}{Specifies what to do with the edge
-      attributes if the graph is modified. The default value is
-      \code{list(weight="sum", name="concat", "ignore")}. See
-      \code{\link{attribute.combination}} for details on this.}
-    \item{nexus.url}{The base URL of the default Nexus server. See
-      \code{\link{nexus}} for details.}
-    \item{print.edge.attributes}{Logical constant, whether to print edge
-      attributes when printing graphs. Defaults to \code{FALSE}.}
-    \item{print.full}{Logical scalar, whether \code{\link{print.igraph}}
-      should show the graph structure as well, or only a summary of the
-      graph.}
-    \item{print.graph.attributes}{Logical constant, whether to print
-      graph attributes when printing graphs. Defaults to \code{FALSE}.}
-    \item{print.vertex.attributes}{Logical constant, whether to print
-      vertex attributes when printing graphs. Defaults to \code{FALSE}.}
-    \item{sparsematrices}{Whether to use the \code{Matrix} package for
-      (sparse) matrices. It is recommended, if the user works with
-      larger graphs.}
-    \item{verbose}{Logical constant, whether igraph functions should
-      talk more than minimal. Eg. if \code{TRUE} thne some functions
-      will use progress bars while computing. Defaults to \code{FALSE}.}
-    \item{vertex.attr.comb}{Specifies what to do with the vertex
-      attributes if the graph is modified. The default value is
-      \code{list(name="concat", "ignore")} See
-      \code{\link{attribute.combination}} for details on this.}
-  }
-}
-\value{
-  \code{igraph.options} returns a list with  the updated values of the
-  parameters. If the argument list is not empty, the returned list is
-  invisible.
-
-  For \code{getIgraphOpt}, the current value set for option \code{x}, or
-  \code{NULL} if the option is unset.
-  
-  If \code{parvalue} is \code{NULL} then \code{igraph.par} returns the
-  current value of the parameter. Otherwise the new value of the
-  parameter is returned invisibly.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{igraph.options} is similar to \code{\link{options}} and
-  \code{getIgraphOpt} is similar to \code{\link{getOption}}.}
-\examples{
-oldval <- getIgraphOpt("verbose")
-igraph.options(verbose=TRUE)
-layout.kamada.kawai(graph.ring(10))
-igraph.options(verbose=oldval)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.sample.Rd igraph-0.6.5/interfaces/R/igraph/man/igraph.sample.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.sample.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/igraph.sample.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,29 +0,0 @@
-\name{igraph.sample}
-\alias{igraph.sample}
-\title{Sampling a random integer sequence}
-\description{This function provides a very efficient way to pull an
-  integer random sample sequence from an integer interval.}
-\usage{
-igraph.sample(low, high, length)
-}
-\arguments{
-  \item{low}{The lower limit of the interval (inclusive).}
-  \item{high}{The higher limit of the interval (inclusive).}
-  \item{length}{The length of the sample.}
-}
-\details{The algorithm runs in \code{O(length)} expected time, even if
-  \code{high-low} is big. It is much faster (but of course less general)
-  than the builtin \code{sample} function of R.}
-\value{
-  An increasing numeric vector containing integers, the sample.
-}
-\references{Jeffrey Scott Vitter: An Efficient Algorithm for Sequential
-  Random Sampling, \emph{ACM Transactions on Mathematical Software}, 13/1,
-  58--67.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-rs <- igraph.sample(1, 100000000, 10)
-rs
-}
-\keyword{datagen}
-    
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.vertex.shapes.Rd igraph-0.6.5/interfaces/R/igraph/man/igraph.vertex.shapes.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraph.vertex.shapes.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/igraph.vertex.shapes.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,248 +0,0 @@
-\name{Vertex shapes}
-\alias{igraph.vertex.shapes}
-\alias{vertex.shapes}
-\alias{add.vertex.shape}
-\alias{igraph.shape.noclip}
-\alias{igraph.shape.noplot}
-\concept{Vertex shapes}
-\concept{Visualization}
-\title{Various vertex shapes when plotting igraph graphs}
-\description{Starting from version 0.5.1 igraph supports different
-  vertex shapes when plotting graphs.}
-\usage{
-vertex.shapes (shape = NULL)
-add.vertex.shape (shape, clip = igraph.shape.noclip,
-       plot = igraph.shape.noplot, parameters = list())
-igraph.shape.noclip (coords, el, params, end = c("both", "from", "to"))
-igraph.shape.noplot (coords, v = NULL, params)
-}
-\arguments{
-  \item{shape}{Character scalar, name of a vertex shape. If it is
-    \code{NULL} for \code{vertex.shapes}, then the names of all defined
-    vertex shapes are returned.} 
-  \item{clip}{An R function object, the clipping function.}
-  \item{plot}{An R function object, the plotting function.}
-  \item{parameters}{Named list, additional plot/vertex/edge
-    parameters. The element named define the new parameters, and the
-    elements themselves define their default values.
-    Vertex parameters should have a prefix
-    \sQuote{\code{vertex.}}, edge parameters a prefix
-    \sQuote{\code{edge.}}. Other general plotting parameters should have
-    a prefix \sQuote{\code{plot.}}. See Details below.}
-  \item{coords,el,params,end,v}{See parameters of the clipping/plotting
-    functions below.} 
-}
-\details{
-  In igraph a vertex shape is defined by two functions: 1) provides
-  information about the size of the shape for clipping the edges and 2)
-  plots the shape if requested. These functions are called \dQuote{shape
-    functions} in the rest of this manual page. The first one is the
-  clipping function and the second is the plotting function.
-  
-  The clipping function has the following arguments:
-  \describe{
-    \item{coords}{A matrix with four columns, it contains the
-      coordinates of the vertices for the edge list supplied in the
-      \code{el} argument.}
-    \item{el}{A matrix with two columns, the edges of which some end
-      points will be clipped. It should have the same number of rows as
-      \code{coords}.}
-    \item{params}{This is a function object that can be called to query
-      vertex/edge/plot graphical parameters. The first argument of the
-      function is \dQuote{\code{vertex}}, \dQuote{\code{edge}} or
-      \dQuote{\code{plot}} to decide the type of the parameter, the
-      second is a character string giving the name of the
-      parameter. E.g.
-      \preformatted{
-	params("vertex", "size")
-      }
-    }
-    \item{end}{Character string, it gives which end points will be
-      used. Possible values are \dQuote{\code{both}},
-      \dQuote{\code{from}} and \dQuote{\code{to}}. If
-      \dQuote{\code{from}} the function is expected to clip the
-      first column in the \code{el} edge list, \dQuote{\code{to}}
-      selects the second column, \dQuote{\code{both}} selects both.}
-  }
-
-  The clipping function should return a matrix
-  with the same number of rows as the \code{el} arguments.
-  If \code{end} is \code{both} then the matrix must have four
-  columns, otherwise two. The matrix contains the modified coordinates,
-  with the clipping applied.
-
-  The plotting function has the following arguments:
-  \describe{
-    \item{coords}{The coordinates of the vertices, a matrix with two
-      columns.}
-    \item{v}{The ids of the vertices to plot. It should match the number
-      of rows in the \code{coords} argument.}
-    \item{params}{The same as for the clipping function, see above.}
-  }
-
-  The return value of the plotting function is not used.
-
-  \code{vertex.shapes} can be used to list the names of all installed
-  vertex shapes, by calling it without arguments, or setting the
-  \code{shape} argument to \code{NULL}. If a shape name is given, then
-  the clipping and plotting functions of that shape are returned in a
-  named list.
-
-  \code{add.vertex.shape} can be used to add new vertex shapes to
-  igraph. For this one must give the clipping and plotting functions of
-  the new shape. It is also possible to list the plot/vertex/edge
-  parameters, in the \code{parameters} argument, that the clipping
-  and/or plotting functions can make use of. An example would be a
-  generic regular polygon shape, which can have a parameter for the
-  number of sides.
-
-  \code{igraph.shape.noclip} is a very simple clipping function that the
-  user can use in their own shape definitions. It does no clipping, the
-  edges will be drawn exactly until the listed vertex position
-  coordinates.
-
-  \code{igraph.shape.noplot} is a very simple (and probably not very
-  useful) plotting function, that does not plot anything.
-}
-\value{
-  \code{vertex.shapes} returns a character vector if the \code{shape}
-  argument is \code{NULL}. It returns a named list with entries named
-  \sQuote{clip} and \sQuote{plot}, both of them R functions.
-
-  \code{add.vertex.shape} returns \code{TRUE}, invisibly.
-
-  \code{igraph.shape.noclip} returns the appropriate columns of its
-  \code{coords} argument.
-
-  \code{igraph.shape.noplot} returns \code{NULL}, invisibly.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{igraph.plotting}}, \code{\link{plot.igraph}} }
-\examples{
-#################################################################
-# all vertex shapes, minus "raster", that might not be available
-shapes <- setdiff(vertex.shapes(), "")
-g <- graph.ring(length(shapes))
-set.seed(42)
-plot(g, vertex.shape=shapes, vertex.label=shapes, vertex.label.dist=1,
-     vertex.size=15, vertex.size2=15,
-     vertex.pie=lapply(shapes, function(x) if (x=="pie") 2:6 else 0),
-     vertex.pie.color=list(heat.colors(5)))
-
-# add new vertex shape, plot nothing with no clipping
-add.vertex.shape("nil")
-plot(g, vertex.shape="nil")
-
-#################################################################
-# triangle vertex shape
-mytriangle <- function(coords, v=NULL, params) {
-  vertex.color <- params("vertex", "color")
-  if (length(vertex.color) != 1 && !is.null(v)) {
-    vertex.color <- vertex.color[v]
-  }
-  vertex.size <- 1/200 * params("vertex", "size")
-  if (length(vertex.size) != 1 && !is.null(v)) {
-    vertex.size <- vertex.size[v]
-  }
-
-  symbols(x=coords[,1], y=coords[,2], bg=vertex.color,
-          stars=cbind(vertex.size, vertex.size, vertex.size),
-          add=TRUE, inches=FALSE)
-}
-# clips as a circle
-add.vertex.shape("triangle", clip=vertex.shapes("circle")$clip,
-                 plot=mytriangle)
-plot(g, vertex.shape="triangle", vertex.color=rainbow(vcount(g)),
-     vertex.size=seq(10,20,length=vcount(g)))
-
-#################################################################
-# generic star vertex shape, with a parameter for number of rays
-mystar <- function(coords, v=NULL, params) {
-  vertex.color <- params("vertex", "color")
-  if (length(vertex.color) != 1 && !is.null(v)) {
-    vertex.color <- vertex.color[v]
-  }
-  vertex.size  <- 1/200 * params("vertex", "size")
-  if (length(vertex.size) != 1 && !is.null(v)) {
-    vertex.size <- vertex.size[v]
-  }
-  norays <- params("vertex", "norays")
-  if (length(norays) != 1 && !is.null(v)) {
-    norays <- norays[v]
-  }
-
-  mapply(coords[,1], coords[,2], vertex.color, vertex.size, norays,
-         FUN=function(x, y, bg, size, nor) {
-           symbols(x=x, y=y, bg=bg,
-                   stars=matrix(c(size,size/2), nrow=1, ncol=nor*2),
-                   add=TRUE, inches=FALSE)
-         })
-}
-# no clipping, edges will be below the vertices anyway
-add.vertex.shape("star", clip=igraph.shape.noclip,
-                 plot=mystar, parameters=list(vertex.norays=5))
-plot(g, vertex.shape="star", vertex.color=rainbow(vcount(g)),
-     vertex.size=seq(10,20,length=vcount(g)))
-plot(g, vertex.shape="star", vertex.color=rainbow(vcount(g)),
-     vertex.size=seq(10,20,length=vcount(g)),
-     vertex.norays=rep(4:8, length=vcount(g)))
-
-#################################################################
-# Pictures as vertices.
-# Similar musicians from last.fm, we start from an artist and
-# will query two levels. We will use the XML, png and jpeg packages
-# for this.
-
-if (require(XML) && require(png) && require(jpeg)) {
-  url <- 'http://ws.audioscrobbler.com/2.0/?method=artist.getinfo&artist=\%s&api_key=1784468ada3f544faf9172ee8b99fca3'
-  getartist <- function(artist) {
-    cat("Downloading from last.fm. ... ")
-    txt <- readLines(sprintf(url, URLencode(artist)))
-    xml <- xmlTreeParse(txt, useInternal=TRUE)
-    img <- xpathSApply(xml, "/lfm/artist/image[@size='medium'][1]",
-                       xmlValue)
-    if (img != "") {
-      con <- url(img, open="rb")
-      bin <- readBin(con, what="raw", n=10^6)
-      close(con)
-      if (grepl("\\\\.png$", img)) {
-        rast <- readPNG(bin, native=TRUE)
-      } else if (grepl("\\\\.jpe?g$", img)) {
-        rast <- readJPEG(bin, native=TRUE)
-      } else {
-        rast <- as.raster(matrix())
-      }
-    } else {
-      rast <- as.raster(numeric())
-    }
-    sim <- xpathSApply(xml, "/lfm/artist/similar/artist/name", xmlValue)
-    cat("done.\\n")
-    list(name=artist, image=rast, similar=sim)
-  }
-
-  ego <- getartist("Placebo")
-  similar <- lapply(ego$similar, getartist)
-  
-  edges1 <- cbind(ego$name, ego$similar)
-  edges2 <- lapply(similar, function(x) cbind(x$name, x$similar))
-  edges3 <- rbind(edges1, do.call(rbind, edges2))
-  edges <- edges3[ edges3[,1] \%in\% c(ego$name, ego$similar) &
-                   edges3[,2] \%in\% c(ego$name, ego$similar), ]
-
-  musnet <- simplify(graph.data.frame(edges, dir=FALSE,
-                     vertices=data.frame(name=c(ego$name, ego$similar))))
-  str(musnet)
-  
-  V(musnet)$raster <- c(list(ego$image), lapply(similar, "[[", "image"))
-  plot(musnet, layout=layout.star, vertex.shape="raster",
-       vertex.label=V(musnet)$name, margin=.2,
-       vertex.size=50, vertex.size2=50,
-       vertex.label.dist=2, vertex.label.degree=0)
-}
-
-}
-
-	      
-	      
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraphdemo.Rd igraph-0.6.5/interfaces/R/igraph/man/igraphdemo.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/igraphdemo.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/igraphdemo.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{igraphdemo}
-\alias{igraphdemo}
-\title{Run igraph demos, step by step}
-\description{Run one of the accompanying igraph demos, somewhat
-  interactively, using a Tk window. }
-\usage{
-igraphdemo(which)
-}
-\arguments{
-  \item{which}{If not given, then the names of the available demos are
-    listed. Otherwise it should be either a filename or the name of an
-    igraph demo.}
-}
-\details{
-  This function provides a somewhat nicer interface to igraph demos that
-  come with the package, than the standard \code{\link{demo}}
-  function. Igraph demos are divided into chunks and \code{igraphdemo}
-  runs them chunk by chunk, with the possibility of inspecting the
-  workspace between two chunks.
-
-  The \code{tcltk} package is needed for \code{igraphdemo}.
-}
-\value{Returns \code{NULL}, invisibly.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{demo}}}
-\examples{
-igraphdemo()
-if (interactive()) {
-  igraphdemo("centrality")
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/independent.sets.Rd igraph-0.6.5/interfaces/R/igraph/man/independent.sets.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/independent.sets.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/independent.sets.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-\name{independent.vertex.sets}
-\alias{independent.vertex.sets}
-\alias{largest.independent.vertex.sets}
-\alias{maximal.independent.vertex.sets}
-\alias{independence.number}
-\concept{Independent vertex set}
-\title{Independent vertex sets}
-\description{A vertex set is called independent if there no edges
-  between any two vertices in it. These functions find independent
-  vertex sets in undirected graphs}
-\usage{
-independent.vertex.sets(graph, min=NULL, max=NULL)
-largest.independent.vertex.sets(graph)
-maximal.independent.vertex.sets(graph)
-independence.number(graph)
-}
-\arguments{
-  \item{graph}{The input graph, directed graphs are considered as
-    undirected, loop edges and multiple edges are ignored.}
-  \item{min}{Numeric constant, limit for the minimum size of the
-    independent vertex sets to find. \code{NULL} means no limit.}
-  \item{max}{Numeric constant, limit for the maximum size of
-    the independent vertex sets to find. \code{NULL} means no limit.
-  }
-}
-\details{
-  \code{independent.vertex.sets} finds all independent vertex sets in
-  the network, obeying the size limitations given in the \code{min} and
-  \code{max} arguments.
-
-  \code{largest.independent.vertex.sets} finds the largest independent
-  vertex sets in the graph. An independent vertex set is largest if
-  there is no independent vertex set with more vertices.
-
-  \code{maximal.independent.vertex.sets} finds the maximal independent
-  vertex sets in the graph. An independent vertex set is maximal if it
-  cannot be extended to a larger independent vertex set. The largest
-  independent vertex sets are maximal, but the opposite is not always
-  true.
-
-  \code{independece.number} calculate the size of the largest
-  independent vertex set(s).
-
-  These functions use the algorithm described by Tsukiyama et al., see
-  reference below.
-}
-\value{
-  \code{independent.vertex.sets}, \code{largest.independent.vertex.sets}
-  and \code{maximal.independent.vertex.sets} return a list containing
-  numeric vertex ids, each list element is an independent vertex set.
-
-  \code{independence.number} returns an integer constant.
-}
-\references{
-  S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirawaka. A new algorithm
-  for generating all the maximal independent sets. \emph{SIAM J Computing},
-  6:505--517, 1977.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com} ported it from the Very
-  Nauty Graph Library by Keith Briggs \email{google@for.it} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} wrote the R interface and this manual page. }
-\seealso{\code{\link{cliques}}}
-\examples{
-# A quite dense graph
-g <- erdos.renyi.game(100, 0.8)
-independence.number(g)
-independent.vertex.sets(g, min=independence.number(g))
-largest.independent.vertex.sets(g)
-# Empty graph
-induced.subgraph(g, largest.independent.vertex.sets(g)[[1]])
-
-length(maximal.independent.vertex.sets(g))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/infomap.Rd igraph-0.6.5/interfaces/R/igraph/man/infomap.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/infomap.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/infomap.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,64 +0,0 @@
-\name{infomap.community}
-\alias{infomap.community}
-\concept{Community structure}
-\title{Infomap community finding}
-\description{Find community structure that minimizes the expected
-  description length of a random walker trajectory}
-\usage{
-infomap.community (graph, e.weights = NULL, v.weights = NULL,
-                   nb.trials = 10, modularity = TRUE) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{e.weights}{If not \code{NULL}, then a numeric vector of edge
-    weights. The length must match the number of edges in the graph.
-    By default the \sQuote{\code{weight}} edge attribute is used as
-    weights. If it is not present, then all edges are considered to have
-    the same weight.}
-  \item{v.weights}{If not \code{NULL}, then a numeric vector of vertex
-    weights. The length must match the number of vertices in the graph.
-    By default the \sQuote{\code{weight}} vertex attribute is used as
-    weights. If it is not present, then all vertices are considered to have
-    the same weight.}
-  \item{nb.trials}{The number of attempts to partition the network
-    (can be any integer value equal or larger than 1).}
-  \item{modularity}{Logical scalar, whether to calculate the modularity
-    score of the detected community structure.}
-}
-\details{
-  Please see the details of this method in the references given below.
-}
-\value{
-  \code{infomap.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{
-  The original paper: M. Rosvall and C. T. Bergstrom, Maps of
-  information flow reveal community structure in complex networks,
-  \emph{PNAS} 105, 1118 (2008)
-  \url{http://dx.doi.org/10.1073/pnas.0706851105}, 
-  \url{http://arxiv.org/abs/0707.0609}
-
-  A more detailed paper: M. Rosvall, D. Axelsson, and C. T. Bergstrom,
-  The map equation, \emph{Eur. Phys. J. Special Topics} 178, 13 (2009).
-  \url{http://dx.doi.org/10.1140/epjst/e2010-01179-1},
-  \url{http://arxiv.org/abs/0906.1405}.
-}
-\author{
-  Martin Rosvall \email{martin.rosvall at physics dot umu dot se} wrote
-  the original C++ code. This was ported to be more igraph-like by
-  Emmanuel Navarro \email{navarro at irit dot fr}. The R interface and
-  some cosmetics was done by Gabor Csardi
-  \email{csardi.gabor@gmail.com}.
-}
-\seealso{Other community finding methods and \code{\link{communities}}.}
-\examples{
-## Zachary's karate club
-g <- graph.famous("Zachary")
-
-imc <- infomap.community(g)
-membership(imc)
-communities(imc)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/interconnected.islands.Rd igraph-0.6.5/interfaces/R/igraph/man/interconnected.islands.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/interconnected.islands.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/interconnected.islands.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{interconnected.islands}
-\alias{interconnected.islands.game}
-\concept{Random graph model}
-\title{A graph with subgraphs that are each a random graph.}
-\description{
-  Create a number of Erdos-Renyi random graphs with identical
-  parameters, and connect them with the specified number of edges.
-}
-\usage{
-interconnected.islands.game (islands.n, islands.size, islands.pin,
-                             n.inter)
-}
-\arguments{
-  \item{islands.n}{The number of islands in the graph.}
-  \item{islands.size}{The size of islands in the graph.}
-  \item{islands.pin}{The probability to create each possible edge into
-    each island.}
-  \item{n.inter}{The number of edges to create between two islands.}
-}
-% \details{}
-\value{
-  An igraph graph.
-}
-% \references{}
-\author{Samuel Thiriot \email{samuel.thiriot at res-ear dot ch}}
-\seealso{\code{\link{erdos.renyi.game}}}
-\examples{
-g <- interconnected.islands.game(3, 10, 5/10, 1)
-oc <- optimal.community(g)
-oc
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.bipartite.Rd igraph-0.6.5/interfaces/R/igraph/man/is.bipartite.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.bipartite.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.bipartite.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-\name{bipartite.mapping}
-\alias{bipartite.mapping}
-\concept{Bipartite graph}
-\concept{Two-mode network}
-\title{Decide whether a graph is bipartite}
-\description{This function decides whether the vertices of a network can
-  be mapped to two vertex types in a way that no vertices of the same
-  type are connected.}
-\usage{
-bipartite.mapping(graph)
-}
-\arguments{
-  \item{graph}{The input graph.}
-}
-\details{
-  A bipartite graph in igraph has a \sQuote{\code{type}} vertex
-  attribute giving the two vertex types.
-
-  This function simply checks whether a graph \emph{could} be
-  bipartite. It tries to find a mapping that gives a possible division
-  of the vertices into two classes, such that no two vertices of the
-  same class are connected by an edge.
-
-  The existence of such a mapping is equivalent of having no circuits of
-  odd length in the graph. A graph with loop edges cannot bipartite.
-
-  Note that the mapping is not necessarily unique, e.g. if the graph has
-  at least two components, then the vertices in the separate components
-  can be mapped independently.
-}
-\value{
-  A named list with two elements:
-  \item{res}{A logical scalar, \code{TRUE} if the can be bipartite,
-    \code{FALSE} otherwise.}
-  \item{type}{A possibly vertex type mapping, a logical vector. If no
-    such mapping exists, then an empty vector.}
-}
-% e
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-% \seealso{}
-\examples{
-## A ring has just one loop, so it is fine
-g <- graph.ring(10)
-bipartite.mapping(g)
-
-## A star is fine, too
-g2 <- graph.star(10)
-bipartite.mapping(g2)
-
-## A graph containing a triangle is not fine
-g3 <- graph.ring(10)
-g3 <- add.edges(g3, c(1,3))
-bipartite.mapping(g3)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.chordal.Rd igraph-0.6.5/interfaces/R/igraph/man/is.chordal.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.chordal.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.chordal.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,71 +0,0 @@
-\name{is.chordal}
-\alias{is.chordal}
-\concept{maximum cardinality search}
-\concept{graph decomposition}
-\concept{chordal graph}
-\title{Chordality of a graph}
-\description{
-  A graph is chordal (or triangulated) if each of its cycles of four or
-  more nodes has a chord, which is an edge joining two nodes that are
-  not adjacent in the cycle. An equivalent definition is that any
-  chordless cycles have at most three nodes.}
-\usage{
-is.chordal(graph, alpha = NULL, alpham1 = NULL, fillin = FALSE,
-           newgraph = FALSE)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but edge directions
-    are ignored, as the algorithm is defined for undirected graphs.}
-  \item{alpha}{Numeric vector, the maximal chardinality ordering of the
-    vertices. If it is \code{NULL}, then it is automatically calculated
-    by calling \code{\link{maximum.cardinality.search}}, or from
-    \code{alpham1} if that is given..}
-  \item{alpham1}{Numeric vector, the inverse of \code{alpha}. If it is
-    \code{NULL}, then it is automatically calculated by calling
-    \code{\link{maximum.cardinality.search}}, or from \code{alpha}.}
-  \item{fillin}{Logical scalar, whether to calculate the fill-in edges.}
-  \item{newgraph}{Logical scalar, whether to calculate the triangulated
-    graph.}
-}
-\details{
-  The chordality of the graph is decided by first performing maximum
-  cardinality search on it (if the \code{alpha} and \code{alpham1}
-  arguments are \code{NULL}), and then calculating the set of fill-in
-  edges.
-
-  The set of fill-in edges is empty if and only if the graph is
-  chordal.
-
-  It is also true that adding the fill-in edges to the graph makes it
-  chordal.
-}
-\value{
-  A list with three members:
-  \item{chordal}{Logical scalar, it is \code{TRUE} iff the input graph
-    is chordal.}
-  \item{fillin}{If requested, then a numeric vector giving the fill-in
-    edges. \code{NULL} otherwise.}
-  \item{newgraph}{If requested, then the triangulated graph, an
-    \code{igraph} object. \code{NULL} otherwise.}
-}
-\references{ Robert E Tarjan and Mihalis Yannakakis. (1984). Simple
-  linear-time algorithms to test chordality of graphs, test acyclicity
-  of hypergraphs, and selectively reduce acyclic hypergraphs.
-  \emph{SIAM Journal of Computation} 13, 566--579.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{maximum.cardinality.search}} }
-\examples{
-## The examples from the Tarjan-Yannakakis paper
-g1 <- graph.formula(A-B:C:I, B-A:C:D, C-A:B:E:H, D-B:E:F,
-                    E-C:D:F:H, F-D:E:G, G-F:H, H-C:E:G:I,
-                    I-A:H)
-maximum.cardinality.search(g1)
-is.chordal(g1, fillin=TRUE)
-
-g2 <- graph.formula(A-B:E, B-A:E:F:D, C-E:D:G, D-B:F:E:C:G,
-                    E-A:B:C:D:F, F-B:D:E, G-C:D:H:I, H-G:I:J,
-                    I-G:H:J, J-H:I)
-maximum.cardinality.search(g2)
-is.chordal(g2, fillin=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.dag.Rd igraph-0.6.5/interfaces/R/igraph/man/is.dag.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.dag.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.dag.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-\name{is.dag}
-\alias{is.dag}
-\concept{DAG}
-\title{Directed acyclic graphs}
-\description{This function tests whether the given graph is a DAG, a
-  directed acyclic graph.}
-\usage{
-is.dag(graph)
-}
-\arguments{
-  \item{graph}{The input graph. It may be undirected, in which case
-    \code{FALSE} is reported.}
-}
-\details{
-  \code{is.dag} checks whether there is a directed cycle in the
-  graph. If not, the graph is a DAG.
-}
-\value{A logical vector of length one.}
-\author{Tamas Nepusz \email{ntamas@gmail.com} for the C code,
-  Gabor Csardi \email{csardi.gabor@gmail.com} for the R interface.
-}
-\examples{
-g <- graph.tree(10)
-is.dag(g)
-g2 <- g + edge(5,1)
-is.dag(g2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.degree.sequence.Rd igraph-0.6.5/interfaces/R/igraph/man/is.degree.sequence.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.degree.sequence.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.degree.sequence.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,55 +0,0 @@
-\name{is.degree.sequence}
-\alias{is.degree.sequence}
-\alias{is.graphical.degree.sequence}
-\concept{Degree sequence}
-\title{Degree sequences of graphs}
-\description{
-  These functions decide whether a sequence (or two, if the graph is
-  directed) of integers can be realized as vertex degrees by a graph or
-  simple graph.
-}
-\usage{
-is.degree.sequence (out.deg, in.deg = NULL)
-is.graphical.degree.sequence (out.deg, in.deg = NULL)
-}
-\arguments{
-  \item{out.deg}{Integer vector, the degree sequence for undirected
-    graphs, or the out-degree sequence for directed graphs.}
-  \item{in.deg}{\code{NULL} or an integer vector. For undireted graphs,
-    it should be \code{NULL}. For directed graphs it specifies the
-    in-degrees.}
-}
-\details{
-  \code{is.degree.sequence} checks whether the given vertex degrees (in-
-  and out-degrees for directed graphs) can be realized by a graph. Note
-  that the graph does not have to be simple, it may contain loop and
-  multiple edges. For undirected graphs, it also checks whether the sum
-  of degrees is even. For directed graphs, the function checks whether
-  the lengths of the two degree vectors are equal and whether their sums
-  are also equal. These are known sufficient and necessary conditions
-  for a degree sequence to be valid.
-
-  \code{is.graphial.degree.sequence} determines whether the given vertex
-  degrees (in- and out-degrees for directed graphs) can be reliazed in a
-  simple graph, i.e. a graph without multiple or loop edges.
-}
-\value{
-  A logical scalar.
-}
-\references{
-  Hakimi SL: On the realizability of a set of integers as degrees of the
-  vertices of a simple graph. \emph{J SIAM Appl Math} 10:496-506, 1962.
- 
-  PL Erdos, I Miklos and Z Toroczkai: A simple Havel-Hakimi type algorithm
-  to realize graphical degree sequences of directed graphs.
-  \emph{The Electronic Journal of Combinatorics} 17(1):R66, 2010.
-}
-\author{
-  Tamas Nepusz \email{ntamas@gmail.com}
-}
-\examples{
-g <- erdos.renyi.game(100, 2/100)
-is.degree.sequence(degree(g))
-is.graphical.degree.sequence(degree(g))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/is.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-\name{is.igraph}
-\alias{is.igraph}
-\title{Is this object a graph?}
-\description{\code{is.graph} makes its decision based on the class
-  attribute of the object.}
-\usage{
-is.igraph(graph)
-}
-\arguments{
-  \item{graph}{An R object.}
-}
-% \details{}
-\value{
-  A logical constant, \code{TRUE} if argument \code{graph} is a graph
-  object.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-is.igraph(g)
-is.igraph(numeric(10))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.multiple.Rd igraph-0.6.5/interfaces/R/igraph/man/is.multiple.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.multiple.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.multiple.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,76 +0,0 @@
-\name{is.multiple}
-\alias{has.multiple}
-\alias{is.loop}
-\alias{is.multiple}
-\alias{count.multiple}
-\concept{Simple graph}
-\title{Find the multiple or loop edges in a graph}
-\description{A loop edge is an edge from a vertex to itself. An edge is
-  a multiple edge if it has exactly the same head and tail vertices as
-  another edge. A graph without multiple and loop edges is called a
-  simple graph.}
-\usage{
-is.loop(graph, eids=E(graph))
-has.multiple(graph)
-is.multiple(graph, eids=E(graph))
-count.multiple(graph, eids=E(graph))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{eids}{The edges to which the query is restricted. By default
-    this is all edges in the graph.}
-}
-\details{
-  \code{is.loop} decides whether the edges of the graph are loop edges.
-  
-  \code{has.multiple} decides whether the graph has any multiple edges.
-
-  \code{is.multiple} decides whether the edges of the graph are multiple
-  edges.
-
-  \code{count.multiple} counts the multiplicity of each edge of a
-  graph.
-  
-  Note that the semantics for \code{is.multiple} and
-  \code{count.multiple} is different. \code{is.multiple} gives \code{TRUE}
-  for all occurences of a multiple edge except for one. Ie. if there are
-  three \code{i-j} edges in the graph then \code{is.multiple} returns
-  \code{TRUE} for only two of them while \code{count.multiple} returns
-  \sQuote{3} for all three.
-
-  See the examples for getting rid of multiple edges while keeping their
-  original multiplicity as an edge attribute.
-}
-\value{
-  \code{has.multiple} returns a logical scalar.
-  \code{is.loop} and \code{is.multiple} return a logical
-  vector. \code{count.multiple} returns a numeric vector.
-}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{simplify}} to eliminate loop and multiple edges.}
-\examples{
-# Loops
-g <- graph( c(1,1,2,2,3,3,4,5) )
-is.loop(g)
-
-# Multiple edges
-g <- barabasi.game(10, m=3, algorithm="bag")
-has.multiple(g)
-is.multiple(g)
-count.multiple(g)
-is.multiple(simplify(g))
-all(count.multiple(simplify(g)) == 1)
-
-# Direction of the edge is important
-is.multiple(graph( c(1,2, 2,1) ))
-is.multiple(graph( c(1,2, 2,1), dir=FALSE ))
-
-# Remove multiple edges but keep multiplicity
-g <- barabasi.game(10, m=3, algorithm="bag")
-E(g)$weight <- count.multiple(g)
-g <- simplify(g)
-any(is.multiple(g))
-E(g)$weight
-}
-\keyword{graphs}
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.mutual.Rd igraph-0.6.5/interfaces/R/igraph/man/is.mutual.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.mutual.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.mutual.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-\name{is.mutual}
-\alias{is.mutual}
-\concept{Mutual edges}
-\concept{Reciprocity}
-\title{Find mutual edges in a directed graph}
-\description{This function checks the reciproc pair of the supplied edges.}
-\usage{
-is.mutual(graph, es = E(graph))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{es}{Edge sequence, the edges that will be probed. By default is
-    includes all edges in the order of their ids.}
-}
-\details{
-  In a directed graph an (A,B) edge is mutual if the graph also includes
-  a (B,A) directed edge.
-
-  Note that multi-graphs are not handled properly, i.e. if the graph
-  contains two copies of (A,B) and one copy of (B,A), then these three
-  edges are considered to be mutual.
-
-  Undirected graphs contain only mutual edges by definition.
-}
-\value{
-  A logical vector of the same length as the number of edges supplied.
-}
-%\references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{reciprocity}}, \code{\link{dyad.census}} if you
-  just want some statistics about mutual edges.}
-\examples{
-g <- erdos.renyi.game(10,50,type="gnm",directed=TRUE)
-reciprocity(g)
-dyad.census(g)
-is.mutual(g)
-sum(is.mutual(g))/2 == dyad.census(g)$mut
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.named.Rd igraph-0.6.5/interfaces/R/igraph/man/is.named.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.named.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.named.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-\name{is.named}
-\alias{is.named}
-\concept{Named graphs}
-\title{Named graphs}
-\description{An igraph graph is named, if there is a symbolic name
-  associated with its vertices.}
-\usage{
-is.named(graph)
-}
-\arguments{
-  \item{graph}{The input graph.}
-}
-\details{
-  In igraph vertices can always be identified and specified via their
-  numeric vertex ids. This is, however, not always convenient, and in
-  many cases there exist symbolic ids that correspond to the
-  vertices. To allow this more flexible identification of vertices, one
-  can assign a vertex attribute called \sQuote{name} to an igraph
-  graph. After doing this, the symbolic vertex names can be used in all
-  igraph functions, instead of the numeric ids.
-
-  Note that the uniqueness of vertex names are currently not enforced in
-  igraph, you have to check that for yourself, when assigning the vertex
-  names.
-}
-\value{A logical scalar.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-g <- graph.ring(10)
-is.named(g)
-V(g)$name <- letters[1:10]
-is.named(g)
-neighbors(g, "a")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.separator.Rd igraph-0.6.5/interfaces/R/igraph/man/is.separator.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.separator.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.separator.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,69 +0,0 @@
-\name{is.separator}
-\alias{is.separator}
-\alias{is.minimal.separator}
-\concept{Vertex separator}
-\title{Vertex separators}
-\description{These functions check whether a given set of vertices is a
-  vertex separator, or a minimal vertex separator.
-}
-\usage{
-is.separator(graph, candidate)
-is.minimal.separator(graph, candidate)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but edge directions
-    are ignored.}
-  \item{candidate}{A numeric vector giving the vertex ids of the
-    candidate separator.}
-}
-\details{
-  \code{is.separator} decides whether the supplied vertex set is a
-  vertex separator. A vertex set is a vertex separator if its removal
-  results a disconnected graph.
-
-  \code{is.minimal.separator} decides whether the supplied vertex set is
-  a minimal vertex separator. A minimal vertex separator is a vertex
-  separator, such that none of its subsets is a vertex separator.
-
-  In the special case of a fully connected graph with \eqn{n} vertices,
-  each set of \eqn{n-1} vertices is considered to be a vertex
-  separator.
-}
-\value{
-  A logical scalar, whether the supplied vertex set is a (minimal)
-  vertex separator or not.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{minimum.size.separators}} lists all vertex separator of
-  minimum size.
-}
-\examples{
-# The graph from the Moody-White paper
-mw <- graph.formula(1-2:3:4:5:6, 2-3:4:5:7, 3-4:6:7, 4-5:6:7,
-                    5-6:7:21, 6-7, 7-8:11:14:19, 8-9:11:14, 9-10,
-                    10-12:13, 11-12:14, 12-16, 13-16, 14-15, 15-16,
-                    17-18:19:20, 18-20:21, 19-20:22:23, 20-21,
-                    21-22:23, 22-23)
-
-# Cohesive subgraphs
-mw1 <- induced.subgraph(mw, as.character(c(1:7, 17:23)))
-mw2 <- induced.subgraph(mw, as.character(7:16))
-mw3 <- induced.subgraph(mw, as.character(17:23))
-mw4 <- induced.subgraph(mw, as.character(c(7,8,11,14)))
-mw5 <- induced.subgraph(mw, as.character(1:7))
-
-check.sep <- function(G) {
-  sep <- minimum.size.separators(G)
-  sapply(sep, is.minimal.separator, graph=G)
-}
-
-check.sep(mw)
-check.sep(mw1)
-check.sep(mw2)
-check.sep(mw3)
-check.sep(mw4)
-check.sep(mw5)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.weighted.Rd igraph-0.6.5/interfaces/R/igraph/man/is.weighted.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/is.weighted.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/is.weighted.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{is.weighted}
-\alias{is.weighted}
-\concept{Weighted graphs}
-\title{Weighted graphs}
-\description{In weighted graphs, a real number is assigned to each
-  (directed or undirected) edge.}
-\usage{
-is.weighted(graph)
-}
-\arguments{
-  \item{graph}{The input graph.}
-}
-\details{
-  In igraph edge weights are represented via an edge attribute, called
-  \sQuote{weight}. The \code{is.weighted} function only checks that such
-  an attribute exists. (It does not even checks that it is a numeric edge
-  attribute.)
-
-  Edge weights are used for different purposes by the different
-  functions. E.g. shortest path functions use it as the cost of the
-  path; community finding methods use it as the strength of the
-  relationship between two vertices, etc. Check the manual pages of the
-  functions working with weighted graphs for details.
-}
-\value{A logical scalar.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\examples{
-g <- graph.ring(10)
-get.shortest.paths(g, 8, 2)
-E(g)$weight <- seq_len(ecount(g))
-get.shortest.paths(g, 8, 2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/iterators.Rd igraph-0.6.5/interfaces/R/igraph/man/iterators.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/iterators.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/iterators.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,230 +0,0 @@
-\name{iterators}
-\alias{iterators}
-\alias{V}
-\alias{E}
-\alias{V<-}
-\alias{E<-}
-\alias{\%--\%}
-\alias{\%->\%}
-\alias{\%<-\%}
-\alias{[<-.igraph.es}
-\alias{[.igraph.es}
-\alias{$<-.igraph.es}
-\alias{$.igraph.es}
-\alias{[<-.igraph.vs}
-\alias{[.igraph.vs}
-\alias{$<-.igraph.vs}
-\alias{$.igraph.vs}
-\alias{print.igraph.es}
-\alias{print.igraph.vs}
-\title{Vertex and edge sequences and iterators}
-\description{Vertex and edge sequences are central concepts of
-  igraph.}
-\usage{
-V(graph)
-E(graph, P=NULL, path=NULL, directed=TRUE)
-}
-\arguments{
-  \item{graph}{A graph object.}
-  \item{P}{Numeric vector for selecting edges by giving their end
-    points. See details below.}
-  \item{path}{Numeric vector, this is for selecting all edges along a
-    path. See also details below.}
-  \item{directed}{Logcal constant, can be supplied only if either
-    \code{P} or \code{path} is also present and gives whether the pairs
-    or the path are directed or not.} 
-}
-\details{
-  One often needs to perform an operation on a subset of vertices of
-  edges in a graph.
-
-  A vertex sequence is simply a vector containing vertex ids, but it has
-  a special class attribute which makes it possible to perform graph
-  specific operations on it, like selecting a subset of the vertices
-  based on some vertex attributes.
-
-  A vertex sequence is created by \code{V(g)} this selects are vertices
-  in increasing vertex id order. A vertex sequence can be indexed by a
-  numeric vector, and a subset of all vertices can be
-  selected.
-
-  Vertex sequences provide powerful operations for dealing with vertex
-  attributes. A vertex sequence can be indexed with the
-  \sQuote{\code{$}} operator to select (or modify) the attributes of a
-  subset of vertices. A vertex sequence can be indexed by a logical
-  expression, and this expression may contain the names of the vertex
-  attributes and ordinary variables as well. The return value of such a
-  construct (ie. a vertex sequence indexed by a logical expression) is
-  another vertex sequence containing only vertices from the original
-  sequence for which the expression evaluates to TRUE.
-
-  Let us see an example to make everything clear. We assign random
-  numbers between 1 and 100 to the vertices, and select those vertices
-  for which the number is less than 50. We set the color of these
-  vertices to red.
-  \preformatted{
-    g <- graph.ring(10)
-    V(g)$number <- sample(1:100, vcount(g), replace=TRUE)
-    V(g)$color <- "grey"
-    V(g)[ number < 50 ]$color <- "red"
-    plot(g, layout=layout.circle, vertex.color=V(g)$color,
-         vertex.label=V(g)$number)
-  }
-
-  There is a similar notation for edges. \code{E(g)} selects all edges
-  from the \sQuote{\code{g}} graph. Edge sequences can be also indexed
-  with logical expressions containing edge attributes:
-  \preformatted{
-    g <- graph.ring(10)
-    E(g)$weight <- runif(ecount(g))
-    E(g)$width <- 1
-    E(g)[ weight >= 0.5 ]$width <- 3
-    plot(g, layout=layout.circle, edge.width=E(g)$width, edge.color="black")
-  }
-
-  It is important to note that, whenever we use iterators to assign new
-  attribute values, the new values are recycled. So in the following
-  example half of the vertices will be black, the other half red, in an
-  alternated way.
-  \preformatted{
-    g <- graph.ring(10)
-    V(g)$color <- c("black", "red")
-    plot(g, layout=layout.circle)
-  }
-
-  For the recycling, the standard R rules apply and a warning is given
-  if the number of items to replace is not a multiple of the replacement
-  length. E.g. the following code gives a warning, because we set the
-  attribute for three vertices, but supply only two values:
-  \preformatted{
-    g <- graph.tree(10)
-    V(g)$color <- "grey"
-    V(g)[1:3]$color <- c("green", "blue")
-  }
-  
-  If a new vertex/edge attribute is created with an assignment, but only
-  a subset of of vertices are specified, then the rest is set to
-  \code{NA} if the new values are in a vector and to \code{NULL} if they
-  are a list. Try the following:
-  \preformatted{
-    V(g)[5]$foo <- "foo"
-    V(g)$foo
-    V(g)[5]$bar <- list(bar="bar")
-    V(g)$bar
-  }
-  
-  There are some special functions which are only defined in the
-  indexing expressions of vertex and edge sequences. For vertex
-  sequences these are: \code{nei}, \code{inc}, \code{from} and
-  \code{to}, \code{innei} and \code{outnei}. (The \code{adj} special
-  function is an alias for \code{inc}, for compatibility reasons.)
-
-  \code{nei} has a mandatory and an optional argument, the first is
-  another vertex sequence, the second is a mode argument similar to that
-  of the \code{\link{neighbors}} function. \code{nei} returns a logical
-  vector of the same length as the indexed vertex sequence and evaluates
-  to \code{TRUE} for those vertices only which have a neighbor vertex in
-  the vertex sequence supplied as a parameter. Thus for selecting all
-  neighbors of vertices 1 and 2 one can write:
-  \preformatted{
-    V(g) [ nei( 1:2 ) ]
-  }
-  The mode argument (just like for \code{\link{neighbors}}) gives the
-  type of the neighbors to be included, it is interpreted only in
-  directed graphs, and defaults to all types of neighbors. See the
-  example below. \code{innei(v)} is a shorthand for the \sQuote{incoming}
-  neighbors (\code{nei(v, mode="in")}), and \code{outnei(v)} is a
-  shorthand for the \sQuote{outgoing} neighbors
-  (\code{nei(v,mode="out")}).
-
-  \code{inc} takes an edge sequence as an argument and returns
-  \code{TRUE} for vertices which have at least one incident edge in it.
-
-  \code{from} and \code{to} are similar to \code{inc} but only edges
-  originated at (\code{from}) or pointing to (\code{to}) are taken into
-  account.
-
-  For edge sequences the special functions are: \code{inc}, \code{from},
-  \code{to}, \code{\%--\%}, \code{\%->\%} and \code{\%<-\%}.
-
-  \code{inc} takes a vertex sequence as an argument and returns
-  \code{TRUE} for edges which have an incident vertex in it.
-
-  \code{from} and \code{to} are similar to \code{inc}, but only vertices
-  at the source (\code{from}) or target (\code{to}) of the edge.
-
-  The \code{\%--\%} operator selects edges connecting two vertex
-  sequences, the direction of the edges is ignored. The \code{\%->\%} is
-  different only for directed graphs and only edges pointing from the
-  left hand side argument to the right hand side argument are selected.
-  \code{\%<-\%} is exactly the opposite, it selects edges pointing from
-  the right hand side to the left hand side.  
-
-  \code{E} has two optional arguments: \code{P} and \code{path}. If
-  given \code{P} can be used to select edges based on their end points,
-  eg. \code{E(g, P=c(1,2))} selects edge \code{1->2}.
-
-  \code{path} can be used to select all edges along a path. The path
-  should be given with the visited vertex ids in the appropriate order.
-  
-  See also the examples below.  
-}
-\note{
-  A note about the performance of the \code{V} and \code{E} functions,
-  and the selection of edges and vertices. Since all selectors
-  are evaluated as logical vectors on all vertices/edges, their
-  performance is bad on large graphs. (Time complexity is proportional
-  to the total number of vertices/edges.) We suggest using the
-  \code{\link{neighbors}}, \code{\link{incident}} functions and
-  simple R vector operations for manipulating vertex/edge sequences
-  in large graphs.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-# mean degree of vertices in the largest cluster in a random graph
-g <- erdos.renyi.game(100, 2/100)
-c <- clusters(g)
-vsl <- which(which.max(c$csize)==c$membership)
-mean(degree(g, vsl))
-
-# set the color of these vertices to red, others greens
-V(g)$color <- "green"
-V(g)[vsl]$color <- "red"
-\dontrun{plot(g, vertex.size=3, labels=NA, vertex.color="a:color",
-              layout=layout.fruchterman.reingold)}
-
-# the longest geodesic within the largest cluster
-long <- numeric()
-for (v in vsl) {
-  paths <- get.shortest.paths(g, from=v, to=vsl)
-  fl <- paths[[ which.max(sapply(paths, length)) ]]
-  if (length(fl) > length(long)) {
-    long <- fl
-  }
-}
-
-# the mode argument of the nei() function
-g <- graph( c(1,2, 2,3, 2,4, 4,2) )
-V(g)[ nei( c(2,4) ) ]
-V(g)[ nei( c(2,4), "in") ]
-V(g)[ nei( c(2,4), "out") ]
-
-# operators for edge sequences
-g <- barabasi.game(100, power=0.3)
-E(g) [ 1:3 \%--\% 2:6 ]
-E(g) [ 1:5 \%->\% 1:6 ]
-E(g) [ 1:3 \%<-\% 2:6 ]
-
-# the edges along the diameter
-g <- barabasi.game(100, directed=FALSE)
-d <- get.diameter(g)
-E(g, path=d)
-
-# performance for large graphs is bad
-largeg <- graph.lattice(c(1000, 100))
-system.time(E(largeg)[inc(1)])
-system.time(incident(largeg, 1))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/k.regular.game.Rd igraph-0.6.5/interfaces/R/igraph/man/k.regular.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/k.regular.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/k.regular.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-\name{k.regular.game}
-\alias{k.regular.game}
-\concept{Random graph model}
-\concept{Regular graph}
-\title{Create a random regular graph}
-\description{Generate a random graph where each vertex has the same
-  degree.}
-\usage{
-k.regular.game (no.of.nodes, k, directed = FALSE, multiple = FALSE) 
-}
-\arguments{
-  \item{no.of.nodes}{Integer scalar, the number of vertices in the
-    generated graph.}
-  \item{k}{Integer scalar, the degree of each vertex in the graph, or
-    the out-degree and in-degree in a directed graph.}
-  \item{directed}{Logical scalar, whether to create a directed graph.}
-  \item{multiple}{Logical scalar, whether multiple edges are allowed.}
-}
-\details{
-  This game generates a directed or undirected random graph where the
-  degrees of vertices are equal to a predefined constant k. For undirected
-  graphs, at least one of k and the number of vertices must be even.
-
-  The game simply uses \code{\link{degree.sequence.game}} with
-  appropriately constructed degree sequences.
-}
-\value{
-  An igraph graph.
-}
-% \references{}
-\author{
-  Tamas Nepusz \email{ntamas@gmail.com}
-}
-\seealso{
-  \code{\link{degree.sequence.game}} for a generator with prescribed
-  degree sequence.
-}
-\examples{
-## A simple ring
-ring <- k.regular.game(10, 2)
-plot(ring)
-
-## k-regular graphs on 10 vertices, with k=1:9
-k10 <- lapply(1:9, k.regular.game, no.of.nodes=10)
-
-layout(matrix(1:9, nrow=3, byrow=TRUE))
-sapply(k10, plot, vertex.label=NA)
-}
-\keyword{graphs}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/kleinberg.Rd igraph-0.6.5/interfaces/R/igraph/man/kleinberg.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/kleinberg.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/kleinberg.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-\name{kleinberg}
-\alias{authority.score}
-\alias{hub.score}
-\concept{Hub and authority score}
-\title{Kleinberg's centrality scores.}
-\description{Kleinberg's hub and authority scores.}
-\usage{
-authority.score (graph, scale = TRUE, weights=NULL, options = igraph.arpack.default) 
-hub.score (graph, scale = TRUE, weights=NULL, options = igraph.arpack.default) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{scale}{Logical scalar, whether to scale the result to have a
-    maximum score of one. If no scaling is used then the result vector
-    has unit length in the Euclidean norm.}
-  \item{weights}{Optional positive weight vector for calculating
-    weighted scores. If the graph has a \code{weight} edge
-    attribute, then this is used by default.}
-  \item{options}{A named list, to override some ARPACK options. See
-    \code{\link{arpack}} for details.}
-}
-\details{
-  The authority scores of the vertices are defined as the principal
-  eigenvector of \eqn{A^T A}{t(A)*A}, where \eqn{A} is the adjacency
-  matrix of the graph.
-
-  The hub scores of the vertices are defined as the principal
-  eigenvector of \eqn{A A^T}{A*t(A)}, where \eqn{A} is the adjacency
-  matrix of the graph.
-
-  Obviously, for undirected matrices the adjacency matrix is symmetric
-  and the two scores are the same.
-}
-\value{
-  A named list with members:
-  \item{vector}{The authority/hub scores of the vertices.}
-  \item{value}{The corresponding eigenvalue of the calculated
-    principal eigenvector.}
-  \item{options}{Some information about the ARPACK computation, it has
-    the same members as the \code{options} member returned by
-    \code{\link{arpack}}, see that for documentation.}
-}
-\references{
-  J. Kleinberg. Authoritative sources in a hyperlinked
-  environment. \emph{Proc. 9th ACM-SIAM Symposium on Discrete Algorithms},
-  1998. Extended version in \emph{Journal of the ACM} 46(1999). Also
-  appears as IBM Research Report RJ 10076, May 1997.
-}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{\code{\link{evcent}} for eigenvector centrality,
-  \code{\link{page.rank}} for the Page Rank scores. \code{\link{arpack}}
-  for the underlining machinery of the computation.
-}
-\examples{
-## An in-star
-g <- graph.star(10)
-hub.score(g)$vector
-authority.score(g)$vector
-
-## A ring
-g2 <- graph.ring(10)
-hub.score(g2)$vector
-authority.score(g2)$vector
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/label.propagation.community.Rd igraph-0.6.5/interfaces/R/igraph/man/label.propagation.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/label.propagation.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/label.propagation.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,70 +0,0 @@
-\name{label.propagation.community}
-\alias{label.propagation.community}
-\concept{Community structure}
-\title{Finding communities based on propagating labels}
-\description{
-  This is a fast, nearly linear time algorithm for detecting community
-  structure in networks. In works by labeling the vertices with unique
-  labels and then updating the labels by majority voting in the
-  neighborhood of the vertex.
-}
-\usage{
-label.propagation.community (graph, weights = NULL,
-            initial = NULL, fixed = NULL)
-}
-\arguments{
-  \item{graph}{The input graph, should be undirected to make sense.}
-  \item{weights}{An optional weight vector. It should contain a positive
-    weight for all the edges. The \sQuote{weight} edge attribute is used
-    if present. Supply \sQuote{\code{NA}} here if you want to ignore the
-    \sQuote{weight} edge attribute.}
-  \item{initial}{The initial state. If \code{NULL}, every vertex will have
-    a different label at the beginning. Otherwise it must be a vector
-    with an entry for each vertex. Non-negative values denote different
-    labels, negative entries denote vertices without labels.}
-  \item{fixed}{Logical vector denoting which labels are fixed. Of course
-    this makes sense only if you provided an initial state, otherwise
-    this element will be ignored. Also note that vertices without labels
-    cannot be fixed.}
-}
-\details{
-  This function implements the community detection method described in:
-  Raghavan, U.N. and Albert, R. and Kumara, S.: Near linear time algorithm
-  to detect community structures in large-scale networks. Phys Rev E
-  76, 036106. (2007). This version extends the original method by
-  the ability to take edge weights into consideration and also
-  by allowing some labels to be fixed.
-
-  From the abstract of the paper:
-  \dQuote{In our algorithm every node is initialized with a unique label
-    and at every step each node adopts the label that most of its
-    neighbors currently have. In this iterative process densely
-    connected groups of  nodes form a consensus on a unique label to form
-    communities.}
-}
-\value{
-  \code{label.propagation.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{
-  Raghavan, U.N. and Albert, R. and Kumara, S.: Near linear time algorithm
-  to detect community structures in large-scale networks. \emph{Phys Rev E}
-  76, 036106. (2007)
-}
-\author{
-  Tamas Nepusz \email{ntamas@gmail.com} for the C implementation,
-  Gabor Csardi \email{csardi.gabor@gmail.com} for this manual page.
-}
-\seealso{
-  \code{\link{communities}} for extracting the actual results.
-  
-  \code{\link{fastgreedy.community}},
-  \code{\link{walktrap.community}} and \code{\link{spinglass.community}}
-  for other community detection methods.}
-\examples{
-  g <- erdos.renyi.game(10, 5/10) \%du\% erdos.renyi.game(9, 5/9)
-  g <- add.edges(g, c(1, 12))
-  label.propagation.community(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,324 +0,0 @@
-\name{layout}
-\alias{layout}
-\alias{layout.auto}
-\alias{layout.random}
-\alias{layout.circle}
-\alias{layout.sphere}
-\alias{layout.fruchterman.reingold}
-\alias{layout.fruchterman.reingold.grid}
-\alias{layout.kamada.kawai}
-\alias{layout.spring}
-\alias{layout.reingold.tilford}
-\alias{layout.lgl}
-\alias{layout.svd}
-\alias{layout.graphopt}
-\alias{layout.norm}
-\concept{Graph layout}
-\title{Generate coordinates for plotting graphs}
-\description{Some simple and not so simple functions determining the
-  placement of the vertices for drawing a graph.}
-\usage{
-layout.auto(graph, dim=2, \dots)
-layout.random(graph, params, dim=2)
-layout.circle(graph, params)
-layout.sphere(graph, params)
-layout.fruchterman.reingold(graph, \dots, dim=2, params)
-layout.kamada.kawai(graph, \dots, dim=2, params)
-layout.spring(graph, \dots, params)
-layout.reingold.tilford(graph, \dots, params)
-layout.fruchterman.reingold.grid(graph, \dots, params)
-layout.lgl(graph, \dots, params)
-layout.graphopt(graph, ..., params=list())
-layout.svd(graph, d=shortest.paths(graph), ...)
-layout.norm(layout, xmin = NULL, xmax = NULL, ymin = NULL, ymax = NULL,
-      zmin = NULL, zmax = NULL)
-}
-\arguments{
-  \item{graph}{The graph to place.}
-  \item{params}{The list of function dependent parameters.}
-  \item{dim}{Numeric constant, either 2 or 3. Some functions are able
-    to generate 2d and 3d layouts as well, supply this argument to
-    change the default behavior.}
-  \item{\dots}{Function dependent parameters, this is an alternative
-    notation to the \code{params} argument. For \code{layout.auto} these
-    extra parameters are simply passed to the real layout function, if
-    one is called.}
-  \item{d}{The matrix used for singular value decomposition. By default it
-    is the distance matrix of the graph.}
-  \item{layout}{A matrix with two or three columns, the layout to
-    normalize.}
-  \item{xmin,xmax}{The limits for the first coordinate, if one of them
-    or both are \code{NULL} then no normalization is performed along
-    this direction.}
-  \item{ymin,ymax}{The limits for the second coordinate, if one of them
-    or both are \code{NULL} then no normalization is performed along
-    this direction.}
-  \item{zmin,zmax}{The limits for the third coordinate, if one of them
-    or both are \code{NULL} then no normalization is performed along
-    this direction.}  
-}
-\details{
-  These functions calculate the coordinates of the vertices for a graph
-  usually based on some optimality criterion.
-
-  \code{layout.auto} tries to choose an appropriate layout function for
-  the supplied graph, and uses that to generate the layout. The current
-  implementations works like this:
-  \enumerate{
-    \item If the graph has a graph attribute called \sQuote{layout},
-    then this is used. If this attribute is an R function, then it is
-    called, with the graph and any other extra arguments.
-    \item Otherwise, if the graph has vertex attributes called
-    \sQuote{x} and \sQuote{y}, then these are used as coordinates. If
-    the graph has an additional \sQuote{z} vertex attribute, that is
-    also used.
-    \item Otherwise, if the graph is connected and has less than 100
-    vertices, the Kamada-Kawai layout is used, by calling
-    \code{layout.kamada.kawai}.
-    \item Otherwise, if the graph has less than 1000 vertices, then the
-    Fruchterman-Reingold layout is used, by calling
-    \code{layout.fruchterman.reingold}.
-    \item Otherwise the DrL layout is used, \code{layout.drl} is called.
-  }
-  
-  \code{layout.random} simply places the vertices randomly on a
-  square. It has no parameters.
-
-  \code{layout.circle} places the vertices on a unit circle
-  equidistantly. It has no paramaters.
-
-  \code{layout.sphere} places the vertices (approximately) uniformly on
-  the surface of a sphere, this is thus a 3d layout. It is not clear
-  however what \dQuote{uniformly on a sphere} means.
-  
-  \code{layout.fruchterman.reingold} uses a force-based algorithm
-  proposed by Fruchterman and Reingold, see references. Parameters and
-  their default values:
-  \describe{
-    \item{niter}{Numeric, the number of iterations to perform (500).}
-    \item{coolexp}{Numeric, the cooling exponent for the simulated
-      annealing (3).}
-    \item{maxdelta}{Maximum change (\code{vcount(graph)}).}
-    \item{area}{Area parameter (\code{vcount(graph)^2}).}
-    \item{repulserad}{Cancellation radius (\code{area}*vcount(graph)).}
-    \item{weights}{A vector giving edge weights or \code{NULL}. If not
-      \code{NULL} then the attraction along the edges will be multiplied
-      by the given edge weights (\code{NULL}).}
-    \item{minx}{If not \code{NULL}, then it must be a numeric vector
-      that gives lower boundaries for the \sQuote{x} coordinates of the
-      vertices. The length of the vector must match the number of
-      vertices in the graph.}
-    \item{maxx}{Similar to \code{minx}, but gives the upper boundaries.}
-    \item{miny}{Similar to \code{minx}, but gives the lower boundaries
-      of the \sQuote{y} coordinates.}
-    \item{maxy}{Similar to \code{minx}, but gives the upper boundaries
-      of the \sQuote{y} coordinates.}    
-    \item{minz}{Similar to \code{minx}, but gives the lower boundaries
-      of the \sQuote{z} coordinates, if the \code{dim} argument is
-      3. Otherwise it is ignored.}
-    \item{maxz}{Similar to \code{minx}, but gives the upper boundaries
-      of the \sQuote{z} coordinates, if the \code{dim} argument is
-      3. Otherwise it is ignored.}
-    \item{start}{If given, then it should be a matrix with two columns
-      and one line for each vertex. This matrix will be used as starting
-      positions for the algorithm. If not given, then a random starting
-      matrix is used.}
-  }
-  This function was ported from the SNA package.
-
-  \code{layout.kamada.kawai} is another force based algorithm. 
-  Parameters and default values:
-  \describe{
-    \item{niter}{Number of iterations to perform (1000).}
-    \item{sigma}{Sets the base standard deviation of position change
-      proposals (vcount(graph)/4).}
-    \item{initemp}{The initial temperature (10).}
-    \item{coolexp}{The cooling exponent (0.99).}
-    \item{kkconst}{Sets the Kamada-Kawai vertex attraction
-      constant (vcount(graph)**2).}
-    \item{minx}{If not \code{NULL}, then it must be a numeric vector
-      that gives lower boundaries for the \sQuote{x} coordinates of the
-      vertices. The length of the vector must match the number of
-      vertices in the graph.}
-    \item{maxx}{Similar to \code{minx}, but gives the upper boundaries.}
-    \item{miny}{Similar to \code{minx}, but gives the lower boundaries
-      of the \sQuote{y} coordinates.}
-    \item{maxy}{Similar to \code{minx}, but gives the upper boundaries
-      of the \sQuote{y} coordinates.}    
-    \item{minz}{Similar to \code{minx}, but gives the lower boundaries
-      of the \sQuote{z} coordinates, if the \code{dim} argument is
-      3. Otherwise it is ignored.}
-    \item{maxz}{Similar to \code{minx}, but gives the upper boundaries
-      of the \sQuote{z} coordinates, if the \code{dim} argument is
-      3. Otherwise it is ignored.}
-    \item{start}{If given, then it should be a matrix with two columns
-      and one line for each vertex. This matrix will be used as starting
-      positions for the algorithm. If not given, then a random starting
-      matrix is used.}
-  }
-  This function performs very well for connected graphs, but it gives
-  poor results for unconnected ones.
-  This function was ported from the SNA package.
-
-  \code{layout.spring} is a spring embedder algorithm.
-  Parameters and default values:
-  \describe{
-    \item{mass}{The vertex mass (in \sQuote{quasi-kilograms}). (Defaults to 0.1.)}
-    \item{equil}{The equilibrium spring extension (in
-      \sQuote{quasi-meters}). (Defaults to 1.)}
-    \item{k}{The spring coefficient (in \sQuote{quasi-Newtons per
-      quasi-meter}). (Defaults to 0.001.)}
-    \item{repeqdis}{The point at which repulsion (if employed) balances
-      out the spring extension force (in \sQuote{quasi-meters}). (Defaults to
-      0.1.)}
-    \item{kfr}{The base coefficient of kinetic friction (in
-      \sQuote{quasi-Newton quasi-kilograms}). (Defaults to 0.01.)}
-    \item{repulse}{Should repulsion be used? (Defaults to FALSE.)}
-  }
-  This function was ported from the SNA package.
-
-  \code{layout.reingold.tilford} generates a tree-like layout, so it is
-  mainly for trees. Parameters and default values:
-  \describe{
-    \item{root}{The id of the root vertex, defaults to 1.}
-    \item{circular}{Logical scalar, whether to plot the tree in a
-      circular fashion, defaults to \code{FALSE}.}
-    \item{flip.y}{Logical scalar, whether to flip the \sQuote{y}
-      coordinates. The default is flipping because that puts the root
-      vertex on the top.}
-  }
-  
-  \code{layout.fruchterman.reingold.grid} is similar to
-  \code{layout.fruchterman.reingold} but repelling force is calculated
-  only between vertices that are closer to each other than a limit, so
-  it is faster. Patameters and default values:
-  \describe{
-    \item{niter}{Numeric, the number of iterations to perform (500).}
-    \item{maxdelta}{Maximum change for one vertex in one iteration. (The
-      number of vertices in the graph.)}
-    \item{area}{The area of the surface on which the vertices are placed.
-      (The square of the number of vertices.)}
-    \item{coolexp}{The cooling exponent of the simulated annealing
-      (1.5).}
-    \item{repulserad}{Cancellation radius for the repulsion (the
-      \code{area} times the number of vertices).}
-    \item{cellsize}{The size of the cells for the grid. When calculating
-      the repulsion forces between vertices only vertices in the same or
-      neighboring grid cells are taken into account (the fourth root of
-      the number of \code{area}.}
-    \item{start}{If given, then it should be a matrix with two columns
-      and one line for each vertex. This matrix will be used as starting
-      positions for the algorithm. If not given, then a random starting
-      matrix is used.}
-  }
-  
-  \code{layout.lgl} is for large connected graphs, it is similar to the
-  layout generator of the Large Graph Layout software
-  (\url{http://bioinformatics.icmb.utexas.edu/lgl}). Parameters and
-  default values:
-  \describe{
-    \item{maxiter}{The maximum number of iterations to perform (150).}
-    \item{maxdelta}{The maximum change for a vertex during an iteration
-      (the number of vertices).}
-    \item{area}{The area of the surface on which the vertices are placed
-      (square of the number of vertices). }
-    \item{coolexp}{The cooling exponent of the simulated annealing (1.5).}
-    \item{repulserad}{Cancellation radius for the repulsion (the
-      \code{area} times the number of vertices).}
-    \item{cellsize}{The size of the cells for the grid. When calculating
-      the repulsion forces between vertices only vertices in the same or
-      neighboring grid cells are taken into account (the fourth root of
-      the number of \code{area}.}
-    \item{root}{The id of the vertex to place at the middle of the
-      layout. The default value is -1 which means that a random vertex
-      is selected.}
-  }
-
-  \code{layout.graphopt} is a port of the graphopt layout algorithm by
-  Michael Schmuhl. graphopt version 0.4.1 was rewritten in C and the
-  support for layers was removed (might be added later) and a code was a
-  bit reorganized to avoid some unneccessary steps is the node charge
-  (see below) is zero.
-
-  graphopt uses physical analogies for defining attracting and repelling 
-  forces among the vertices and then the physical system is simulated 
-  until it reaches an equilibrium. (There is no simulated annealing or 
-  anything like that, so a stable fixed point is not guaranteed.)
-  
-  See also \url{http://www.schmuhl.org/graphopt/} for the original
-  graphopt.
-
-  Parameters and default values:
-  \describe{
-    \item{niter}{Integer scalar, the number of iterations to perform.
-      Should be a couple of hundred in general. If you have a large graph 
-      then you might want to only do a few iterations and then check the 
-      result. If it is not good enough you can feed it in again in 
-      the \code{start} argument. The default value is 500.
-    }
-    \item{charge}{The charge of the vertices, used to calculate electric
-      repulsion. The default is 0.001.}
-    \item{mass}{The mass of the vertices, used for the spring
-      forces. The default is 30.}
-    \item{spring.length}{The length of the springs, an integer
-      number. The default value is zero.}
-    \item{spring.constant}{The spring constant, the default value is one.}
-    \item{max.sa.movement}{Real constant, it gives the maximum amount of
-      movement allowed in a single step along a single axis. The default
-      value is 5.}
-    \item{start}{If given, then it should be a matrix with two columns
-      and one line for each vertex. This matrix will be used as starting
-      positions for the algorithm. If not given, then a random starting
-      matrix is used.}
-  }
-  
-  \code{layout.svd} is a currently \emph{experimental} layout function based on
-  singular value decomposition. It does not have the usual \code{params}
-  argument, but take a single argument, the distance matrix of the
-  graph. This function generates the layout separately for each graph
-  component and then merges them via \code{\link{layout.merge}}.
-
-  \code{layout.norm} normalizes a layout, it linearly transforms each
-  coordinate separately to fit into the given limits.
-
-  \code{layout.drl} is another force-driven layout generator, it is
-  suitable for quite large graphs. See \code{\link{layout.drl}} for
-  details.
-}
-\value{All these functions return a numeric matrix with at least two
-  columns and the same number of lines as the number of vertices.}
-\references{
-  Fruchterman, T.M.J. and Reingold, E.M. (1991). Graph Drawing by
-  Force-directed Placement. \emph{Software - Practice and Experience},
-  21(11):1129-1164. 
-
-  Kamada, T. and Kawai, S. (1989). An Algorithm for Drawing General
-  Undirected Graphs. \emph{Information Processing Letters}, 31(1):7-15. 
-
-  Reingold, E and Tilford, J (1981). Tidier drawing of trees.
-  \emph{IEEE Trans. on Softw. Eng.}, SE-7(2):223--228.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{layout.drl}}, \code{\link{plot.igraph}}, \code{\link{tkplot}}}
-\examples{
-g <- graph.ring(10)
-layout.random(g)
-layout.kamada.kawai(g)
-
-# Fixing ego
-g <- ba.game(20, m=2)
-minC <- rep(-Inf, vcount(g))
-maxC <- rep(Inf, vcount(g))
-minC[1] <- maxC[1] <- 0
-co <- layout.fruchterman.reingold(g, minx=minC, maxx=maxC,
-                                  miny=minC, maxy=maxC)
-co[1,]
-\dontrun{plot(g, layout=co, vertex.size=30, edge.arrow.size=0.2,
-     vertex.label=c("ego", rep("", vcount(g)-1)), rescale=FALSE,
-     xlim=range(co[,1]), ylim=range(co[,2]), vertex.label.dist=1,
-     vertex.label.color="red")
-axis(1)
-axis(2)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.drl.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.drl.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.drl.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.drl.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,102 +0,0 @@
-\name{layout.drl}
-\alias{layout.drl}
-\alias{igraph.drl.default}
-\alias{igraph.drl.coarsen}
-\alias{igraph.drl.coarsest}
-\alias{igraph.drl.refine}
-\alias{igraph.drl.final}
-\concept{Graph layout}
-\title{The DrL graph layout generator}
-\description{
-  DrL is a force-directed graph layout toolbox focused on
-  real-world large-scale graphs, developed by Shawn Martin and
-  colleagues at Sandia National Laboratories.
-}
-\usage{
-layout.drl (graph, use.seed = FALSE, seed = matrix(runif(vcount(graph) * 
-    2), ncol = 2), options = igraph.drl.default, weights = E(graph)$weight, 
-    fixed = NULL, dim = 2) 
-}
-\arguments{
-  \item{graph}{The input graph, in can be directed or undirected.}
-  \item{use.seed}{Logical scalar, whether to use the coordinates given
-    in the \code{seed} argument as a starting point.}
-  \item{seed}{A matrix with two columns, the starting coordinates for
-    the vertices is \code{use.seed} is \code{TRUE}. It is ignored
-    otherwise.}
-  \item{options}{Options for the layout generator, a named list. See
-    details below.}
-  \item{weights}{Optional edge weights. Supply \code{NULL} here if you
-    want to weight edges equally. By default the \code{weight} edge
-    attribute is used if the graph has one.}
-  \item{fixed}{Logical vector, it can be used to fix some vertices. All
-    vertices for which it is \code{TRUE} are kept at the coordinates
-    supplied in the \code{seed} matrix. It is ignored it \code{NULL} or
-    if \code{use.seed} is \code{FALSE}. }
-  \item{dim}{Either \sQuote{2} or \sQuote{3}, it specifies whether we
-    want a two dimensional or a three dimensional layout. Note that
-    because of the nature of the DrL algorithm, the three dimensional
-    layout takes significantly longer to compute.}
-}
-\details{
-  This function implements the force-directed DrL layout generator.
-
-  The generator has the following parameters:
-  \describe{
-    \item{edge.cut}{Edge cutting is done in the late stages of the
-      algorithm in order to achieve less dense layouts.  Edges are cut
-      if there is a lot of stress on them (a large value in the
-      objective function sum). The edge cutting parameter is a value
-      between 0 and 1 with 0 representing no edge cutting and 1
-      representing maximal edge cutting. } 
-    \item{init.iterations}{Number of iterations in the first phase.}
-    \item{init.temperature}{Start temperature, first phase.}
-    \item{init.attraction}{Attraction, first phase.}
-    \item{init.damping.mult}{Damping, first phase.}
-    \item{liquid.iterations}{Number of iterations, liquid phase.}
-    \item{liquid.temperature}{Start temperature, liquid phase.}
-    \item{liquid.attraction}{Attraction, liquid phase.}
-    \item{liquid.damping.mult}{Damping, liquid phase.}
-    \item{expansion.iterations}{Number of iterations, expansion phase.}
-    \item{expansion.temperature}{Start temperature, expansion phase.}
-    \item{expansion.attraction}{Attraction, expansion phase.}
-    \item{expansion.damping.mult}{Damping, expansion phase.}
-    \item{cooldown.iterations}{Number of iterations, cooldown phase.}
-    \item{cooldown.temperature}{Start temperature, cooldown phase.}
-    \item{cooldown.attraction}{Attraction, cooldown phase.}
-    \item{cooldown.damping.mult}{Damping, cooldown phase.}
-    \item{crunch.iterations}{Number of iterations, crunch phase.}
-    \item{crunch.temperature}{Start temperature, crunch phase.}
-    \item{crunch.attraction}{Attraction, crunch phase.}
-    \item{crunch.damping.mult}{Damping, crunch phase.}
-    \item{simmer.iterations}{Number of iterations, simmer phase.}
-    \item{simmer.temperature}{Start temperature, simmer phase.}
-    \item{simmer.attraction}{Attraction, simmer phase.}
-    \item{simmer.damping.mult}{Damping, simmer phase.}
-
-    There are five pre-defined parameter settings as well, these are
-    called \code{igraph.drl.default}, \code{igraph.drl.coarsen},
-    \code{igraph.drl.coarsest}, \code{igraph.drl.refine} and
-    \code{igraph.drl.final}.
-  }
-}
-\value{
-  A numeric matrix with two columns.
-}
-\references{
-  See the following technical report:
-  Martin, S., Brown, W.M., Klavans, R., Boyack, K.W., DrL: Distributed
-  Recursive (Graph) Layout. SAND Reports, 2008. 2936: p. 1-10. 
-}
-\author{Shawn Martin \email{google@for.it} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R/igraph interface and the three
-    dimensional version.}
-\seealso{\code{\link{layout}} for other layout generators.}
-\examples{
-g <- as.undirected(ba.game(100, m=1))
-l <- layout.drl(g, options=list(simmer.attraction=0))
-\dontrun{
-plot(g, layout=l, vertex.size=3, vertex.label=NA)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.grid.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.grid.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.grid.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.grid.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-\name{layout.grid}
-\alias{layout.grid}
-\alias{layout.grid.3d}
-\concept{Graph layout}
-\title{Simple grid layout}
-\description{This layout places vertices on a rectangulat grid, in two
-  or three dimensions.}
-\usage{
-layout.grid (graph, width = 0)
-layout.grid.3d (graph, width = 0, height = 0)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{width}{The number of vertices in a single row of the grid. If
-    this is zero or negative for \code{layout.grid}, then the width of
-    the grid will be the square root of the number of vertices in the
-    graph, rounded up to the next integer. Similarly, it will be the
-    cube root for \code{layout.grid.3d}.}
-  \item{height}{The number of vertices in a single column of the
-    grid, for three dimensional layouts. If this is zero or negative,
-    then it is determinted automatically.}
-}
-\details{
-  These functions place the vertices on a simple rectangular grid, one
-  after the other. If you want to change the order of the vertices, then
-  see the \code{\link{permute.vertices}} function.
-}
-\value{
-  A two-column matrix for \code{layout.grid}, a three-column matrix for
-  \code{layout.grid.3d}.
-}
-% \references{}
-\author{ Tamas Nepusz \email{ntamas@gmail.com} }
-\seealso{ \code{\link{layout}} for other layout generators }
-\examples{
-g <- graph.lattice( c(3,3) )
-layout.grid(g)
-
-g2 <- graph.lattice( c(3,3,3) )
-layout.grid.3d(g2)
-
-\dontrun{
-plot(g, layout=layout.grid)
-rglplot(g, layout=layout.grid.3d)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.mds.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.mds.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.mds.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.mds.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-\name{layout.mds}
-\alias{layout.mds}
-\concept{Graph layout}
-\title{Graph layout by multidimensional scaling}
-\description{
-  Multidimensional scaling of some distance matrix defined on the
-  vertices of a graph.
-}
-\usage{
-layout.mds(graph, dist=NULL, dim=2, options=igraph.arpack.default)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{dist}{The distance matrix for the multidimensional scaling.
-    If \code{NULL} (the default), then the unweighted shortest path
-    matrix is used.}
-  \item{dim}{\code{layout.mds} supports dimensions up to the number of
-    nodes minus one, but only if the graph is connected; for unconnected
-    graphs, the only possible values is 2. This is because
-    \code{layout.merge} only works in 2D.}
-  \item{options}{This is currently ignored, as ARPACK is not used
-    any more for solving the eigenproblem}
-}
-\details{
-  \code{layout.mds} uses metric multidimensional scaling for generating
-  the coordinates. Multidimensional scaling aims to place points from a
-  higher dimensional space in a (typically) 2 dimensional plane, so that
-  the distance between the points are kept as much as this is possible.
-
-  By default igraph uses the shortest path matrix as the distances
-  between the nodes, but the user can override this via the \code{dist}
-  argument.
-
-  This function generates the layout separately for each graph component
-  and then merges them via \code{\link{layout.merge}}.
-}
-\value{
-  A numeric matrix with \code{dim} columns.
-}
-\references{
-  Cox, T. F. and Cox, M. A. A. (2001) \emph{Multidimensional Scaling}.
-  Second edition. Chapman and Hall.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{layout}}, \code{\link{plot.igraph}}}
-\examples{
-g <- erdos.renyi.game(100, 2/100)
-l <- layout.mds(g)
-plot(g, layout=l, vertex.label=NA, vertex.size=3)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.merge.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.merge.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.merge.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.merge.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-\name{layout.merge}
-\alias{layout.merge}
-\alias{piecewise.layout}
-\title{Merging graph layouts}
-\description{Place several graphs on the same layout}
-\usage{
-layout.merge(graphs, layouts, method = "dla")
-piecewise.layout(graph, layout=layout.kamada.kawai, \dots)
-}
-\arguments{
-  \item{graphs}{A list of graph objects.}
-  \item{layouts}{A list of two-column matrices.}
-  \item{method}{Character constant giving the method to use. Right now
-    only \code{dla} is implemented.}
-  \item{graph}{The input graph.}
-  \item{layout}{A function object, the layout function to use.}
-  \item{\dots}{Additional arguments to pass to the \code{layout} layout
-    function.}
-}
-\details{
-  \code{layout.merge} takes a list of graphs and a list of coordinates and
-  places the graphs in a common layout. The method to use is chosen via
-  the \code{method} parameter, although right now only the \code{dla}
-  method is implemented.
-
-  The \code{dla} method covers the graph with circles.
-  Then it sorts the graphs based on the number of vertices
-  first and places the largest graph at the center of the layout. Then
-  the other graphs are placed in decreasing order via a DLA (diffision
-  limited aggregation) algorithm: the graph is placed randomly on a
-  circle far away from the center and a random walk is conducted until
-  the graph walks into the larger graphs already placed or walks too far
-  from the center of the layout.
-
-  The \code{piecewise.layout} function disassembles the graph first into
-  maximal connected components and calls the supplied \code{layout}
-  function for each component separately. Finally it merges the layouts
-  via calling \code{layout.merge}.
-}
-\value{
-  A matrix with two columns and as many lines as the total number of
-  vertices in the graphs.
-}
-% \references
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{plot.igraph}}, \code{\link{tkplot}},
-  \code{\link{layout}}, \code{\link{graph.disjoint.union}}
-}
-\examples{
-# create 20 scale-free graphs and place them in a common layout
-graphs <- lapply(sample(5:20, 20, replace=TRUE),
-          barabasi.game, directed=FALSE)
-layouts <- lapply(graphs, layout.kamada.kawai)
-lay <- layout.merge(graphs, layouts)
-g <- graph.disjoint.union(graphs)
-\dontrun{plot(g, layout=lay, vertex.size=3, labels=NA, edge.color="black")}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.star.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.star.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.star.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.star.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-\name{layout.star}
-\alias{layout.star}
-\concept{Graph layout}
-\title{Generate coordinates to place the vertices of a graph in a
-  star-shape}
-\description{
-  A simple layout generator, that places one vertex in the center of a
-  circle and the rest of the vertices equidistantly on the perimeter.
-}
-\usage{
-layout.star(graph, center = V(graph)[1], order = NULL)
-}
-\arguments{
-  \item{graph}{The graph to layout.}
-  \item{center}{The id of the vertex to put in the center. By default it
-    is the first vertex.}
-  \item{order}{Numeric vector, the order of the vertices along the
-    perimeter. The default ordering is given by the vertex ids.}
-}
-\details{
-  It is possible to choose the vertex that will be in the center, and
-  the order of the vertices can be also given.
-}
-\value{A matrix with two columns and as many rows as the number of
-  vertices in the input graph.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{layout}} and \code{\link{layout.drl}} for other
-  layout algorithms, \code{\link{plot.igraph}} and \code{\link{tkplot}}
-  on how to plot graphs and \code{\link{graph.star}} on how to create
-  ring graphs.}
-\examples{
-g <- graph.star(10)
-layout.star(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.sugiyama.Rd igraph-0.6.5/interfaces/R/igraph/man/layout.sugiyama.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/layout.sugiyama.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/layout.sugiyama.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,195 +0,0 @@
-\name{layout.sugiyama}
-\alias{layout.sugiyama}
-\concept{Graph layout}
-\title{The Sugiyama graph layout generator}
-\description{
-  Sugiyama layout algorithm for layered directed acyclic graphs. The
-  algorithm minimized edge crossings.
-}
-\usage{
-layout.sugiyama (graph, layers = NULL, hgap = 1, vgap = 1, maxiter = 100, 
-    weights = NULL, attributes = c("default", "all", "none")) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{layers}{A numeric vector or \code{NULL}. If not \code{NULL},
-    then it should specify the layer index of the vertices. Layers are
-    numbered from one. If \code{NULL}, then igraph calculates the layers
-    automatically.}
-  \item{hgap}{Real scalar, the minimum horizontal gap between vertices
-    in the same layer.}
-  \item{vgap}{Real scalar, the distance between layers.}
-  \item{maxiter}{Integer scalar, the maximum number of iterations in the
-    crossing minimization stage. 100 is a reasonable default; if you
-    feel that you have too many edge crossings, increase this.}
-  \item{weights}{Optional edge weight vector. If \code{NULL}, then the
-    'weight' edge attribute is used, if there is one. Supply \code{NA}
-    here and igraph ignores the edge weights.}
-  \item{attributes}{Which graph/vertex/edge attributes to keep in the
-    extended graph. \sQuote{default} keeps the \sQuote{size},
-    \sQuote{size2}, \sQuote{shape}, \sQuote{label} and \sQuote{color}
-    vertex attributes and the \sQuote{arrow.mode} and
-    \sQuote{arrow.size} edge attributes. \sQuote{all} keep all graph,
-    vertex and edge attributes, \sQuote{none} keeps none of them.}
-}
-\details{
-  This layout algorithm is designed for directed acyclic graphs where each
-  vertex is assigned to a layer. Layers are indexed from zero, and vertices
-  of the same layer will be placed on the same horizontal line. The X
-  coordinates of vertices within each layer are decided by the heuristic
-  proposed by Sugiyama et al. to minimize edge crossings.
-
-  You can also try to lay out undirected graphs, graphs containing cycles, or
-  graphs without an a priori layered assignment with this algorithm. igraph
-  will try to eliminate cycles and assign vertices to layers, but there is no
-  guarantee on the quality of the layout in such cases.
-
-  The Sugiyama layout may introduce \dQuote{bends} on the edges in order
-  to obtain a visually more pleasing layout. This is achieved by adding
-  dummy nodes to edges spanning more than one layer. The resulting
-  layout assigns coordinates not only to the nodes of the original graph
-  but also to the dummy nodes. The layout algorithm will also return the
-  extended graph with the dummy nodes.
-
-  For more details, see the reference below.
-}
-\value{
-  A list with the components:
-  \item{layout}{The layout, a two-column matrix, for the original graph
-    vertices.}
-  \item{layout.dummy}{The layout for the dummy vertices, a two column
-    matrix.}
-  \item{extd_graph}{The original graph, extended with dummy vertices.
-    The \sQuote{dummy} vertex attribute is set on this graph, 
-    it is a logical attributes, and it tells you whether the vertex is a
-    dummy vertex. The \sQuote{layout} graph attribute is also set, and
-    it is the layout matrix for all (original and dummy) vertices.}
-}
-\references{
-  K. Sugiyama, S. Tagawa and M. Toda, "Methods for Visual Understanding
-  of Hierarchical Systems". IEEE Transactions on Systems, Man and
-  Cybernetics 11(2):109-125, 1981.
-}
-\author{
-  Tamas Nepusz \email{ntamas@gmail.com}
-}
-\examples{
-## Data taken from http://tehnick-8.narod.ru/dc_clients/
-DC <- graph.formula("DC++" -+
-                "LinuxDC++":"BCDC++":"EiskaltDC++":"StrongDC++":"DiCe!++",
-                "LinuxDC++" -+ "FreeDC++", "BCDC++" -+ "StrongDC++",
-                "FreeDC++" -+ "BMDC++":"EiskaltDC++",
-                "StrongDC++" -+ "AirDC++":"zK++":"ApexDC++":"TkDC++",
-                "StrongDC++" -+ "StrongDC++ SQLite":"RSX++",
-                "ApexDC++" -+ "FlylinkDC++ ver <= 4xx",
-                "ApexDC++" -+ "ApexDC++ Speed-Mod":"DiCe!++",
-                "StrongDC++ SQLite" -+ "FlylinkDC++ ver >= 5xx",
-                "ApexDC++ Speed-Mod" -+ "FlylinkDC++ ver <= 4xx",
-                "ApexDC++ Speed-Mod" -+ "GreylinkDC++",
-                "FlylinkDC++ ver <= 4xx" -+ "FlylinkDC++ ver >= 5xx",
-                "FlylinkDC++ ver <= 4xx" -+ AvaLink,
-                "GreylinkDC++" -+ AvaLink:"RayLinkDC++":"SparkDC++":PeLink)
-
-## Use edge types
-E(DC)$lty <- 1
-E(DC)["BCDC++" \%->\% "StrongDC++"]$lty <- 2
-E(DC)["FreeDC++" \%->\% "EiskaltDC++"]$lty <- 2
-E(DC)["ApexDC++" \%->\% "FlylinkDC++ ver <= 4xx"]$lty <- 2
-E(DC)["ApexDC++" \%->\% "DiCe!++"]$lty <- 2
-E(DC)["StrongDC++ SQLite" \%->\% "FlylinkDC++ ver >= 5xx"]$lty <- 2
-E(DC)["GreylinkDC++" \%->\% "AvaLink"]$lty <- 2
-
-## Layers, as on the plot
-layers <- list(c("DC++"),
-               c("LinuxDC++", "BCDC++"),
-               c("FreeDC++", "StrongDC++"),
-               c("BMDC++", "EiskaltDC++", "AirDC++", "zK++", "ApexDC++",
-                 "TkDC++", "RSX++"),
-               c("StrongDC++ SQLite", "ApexDC++ Speed-Mod", "DiCe!++"),
-               c("FlylinkDC++ ver <= 4xx", "GreylinkDC++"),
-               c("FlylinkDC++ ver >= 5xx", "AvaLink", "RayLinkDC++",
-                 "SparkDC++", "PeLink"))
-
-## Check that we have all nodes
-all(sort(unlist(layers)) == sort(V(DC)$name))
-
-## Add some graphical parameters
-V(DC)$color <- "white"
-V(DC)$shape <- "rectangle"
-V(DC)$size <- 20
-V(DC)$size2 <- 10
-V(DC)$label <- lapply(V(DC)$name, function(x)
-                      paste(strwrap(x, 12), collapse="\n"))
-E(DC)$arrow.size <- 0.5
-
-## Create a similar layout using the predefined layers
-lay1 <- layout.sugiyama(DC, layers=apply(sapply(layers,
-                        function(x) V(DC)$name \%in\% x), 1, which))
-
-## Simple plot, not very nice
-par(mar=rep(.1, 4))
-plot(DC, layout=lay1$layout, vertex.label.cex=0.5)
-
-## Sugiyama plot
-plot(lay1$extd_graph, vertex.label.cex=0.5)
-
-## The same with automatic layer calculation
-## Keep vertex/edge attributes in the extended graph
-lay2 <- layout.sugiyama(DC, attributes="all")
-plot(lay2$extd_graph, vertex.label.cex=0.5)
-
-## Another example, from the following paper:
-## Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
-## An Efficient Implementation of Sugiyama's Algorithm for
-## Layered Graph Drawing, Journal of Graph Algorithms and
-## Applications 9, 305--325 (2005).
-
-ex <- graph.formula( 0 -+ 29: 6: 5:20: 4,
-                     1 -+ 12,
-                     2 -+ 23: 8,
-                     3 -+  4,
-                     4,
-                     5 -+  2:10:14:26: 4: 3,
-                     6 -+  9:29:25:21:13,
-                     7,
-                     8 -+ 20:16,
-                     9 -+ 28: 4,
-                    10 -+ 27,
-                    11 -+  9:16,
-                    12 -+  9:19,
-                    13 -+ 20,
-                    14 -+ 10,
-                    15 -+ 16:27,
-                    16 -+ 27,
-                    17 -+  3,
-                    18 -+ 13,
-                    19 -+  9,
-                    20 -+  4,
-                    21 -+ 22,
-                    22 -+  8: 9,
-                    23 -+  9:24,
-                    24 -+ 12:15:28,
-                    25 -+ 11,
-                    26 -+ 18,
-                    27 -+ 13:19,
-                    28 -+  7,
-                    29 -+ 25                    )
-
-layers <- list( 0, c(5, 17), c(2, 14, 26, 3), c(23, 10, 18), c(1, 24),
-                12, 6, c(29,21), c(25,22), c(11,8,15), 16, 27, c(13,19),
-                c(9, 20), c(4, 28), 7 )
-
-layex <- layout.sugiyama(ex, layers=apply(sapply(layers,
-                        function(x) V(ex)$name \%in\% as.character(x)),
-                        1, which))
-
-origvert <- c(rep(TRUE, vcount(ex)), rep(FALSE, nrow(layex$layout.dummy)))
-realedge <- get.edgelist(layex$extd_graph)[,2] <= vcount(ex)
-plot(layex$extd_graph, vertex.label.cex=0.5,
-     edge.arrow.size=.5, 
-     vertex.size=ifelse(origvert, 5, 0),
-     vertex.shape=ifelse(origvert, "square", "none"),
-     vertex.label=ifelse(origvert, V(ex)$name, ""),
-     edge.arrow.mode=ifelse(realedge, 2, 0))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/leading.eigenvector.Rd igraph-0.6.5/interfaces/R/igraph/man/leading.eigenvector.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/leading.eigenvector.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/leading.eigenvector.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-\name{leading.eigenvector.community}
-\alias{leading.eigenvector.community}
-\alias{community.le.to.membership}
-\concept{Community structure}
-\title{Community structure detecting based on the leading eigenvector
-  of the community matrix}
-\description{This function tries to find densely connected subgraphs in
-  a graph by calculating the leading non-negative eigenvector of the
-  modularity matrix of the graph.}
-\usage{
-leading.eigenvector.community(graph, steps = -1, start = NULL,
-       options = igraph.arpack.default, callback = NULL, extra = NULL,
-       env = parent.frame())
-community.le.to.membership(merges, steps, membership) 
-}
-\arguments{
-  \item{graph}{The input graph. Should be undirected as the method needs
-    a symmetric matrix.}
-  \item{steps}{The number of steps to take, this is actually the number
-    of tries to make a step. It is not a particularly useful parameter.
-
-    For \code{community.le.to.membership} the number of merges to
-    produce from the supplied \code{membership} vector.
-  }
-  \item{start}{\code{NULL}, or a numeric membership vector, giving the
-    start configuration of the algorithm.}
-  \item{membership}{The starting community
-    structure on which \code{steps} merges are performed.
-  }
-  \item{options}{A named list to override some ARPACK options.}
-  \item{callback}{If not \code{NULL}, then it must be callback
-    function. This is called after each iteration, after calculating the
-    leading eigenvector of the modularity matrix. See details below.}
-  \item{extra}{Additional argument to supply to the callback function.}
-  \item{env}{The environment in which the callback function is
-    evaluated.}
-  \item{merges}{The merge matrix, possible from the result of
-    \code{leading.eigenvector.community}.}
-}
-\details{
-  The function documented in these section implements the 
-  \sQuote{leading eigenvector} method developed by Mark Newman, see the
-  reference below.
-  
-  The heart of the method is the definition of the modularity matrix,
-  \code{B}, which is \code{B=A-P}, \code{A} being the adjacency matrix of
-  the (undirected) 
-  network, and \code{P} contains the probability that certain edges are
-  present according to the \sQuote{configuration model}. In
-  other words, a \code{P[i,j]} element of \code{P} is the probability that
-  there is an edge between vertices \code{i} and \code{j} in a random
-  network in which the degrees of all vertices are the same as in the
-  input graph.
-  
-  The leading eigenvector method works by calculating the eigenvector
-  of the modularity matrix for the largest positive eigenvalue and
-  then separating vertices into two community based on the sign of
-  the corresponding element in the eigenvector. If all elements in
-  the eigenvector are of the same sign that means that the network
-  has no underlying comuunity structure.
-  Check Newman's paper to understand why this is a good method for
-  detecting community structure.
-
-  \code{community.le.to.memberhip} creates a membership vector from the
-  result of \code{leading.eigenvector.community}. It takes
-  \code{membership} and permformes \code{steps} merges, according to the
-  supplied \code{merges} matrix.
-}
-\section{Callback functions}{
-  The \code{callback} argument can be used to supply a function that is
-  called after each eigenvector calculation. The following arguments are
-  supplied to this function:
-  \describe{
-    \item{membership}{The actual membership vector, with zero-based
-      indexing.}
-    \item{community}{The community that the algorithm just tried to
-      split, community numbering starts with zero here.}
-    \item{value}{The eigenvalue belonging to the leading eigenvector
-      the algorithm just found.}
-    \item{vector}{The leading eigenvector the algorithm just found.}
-    \item{multiplier}{An R function that can be used to multiple the
-      actual modularity matrix with an arbitrary vector. Supply the
-      vector as an argument to perform this multiplication. This
-      function can be used with ARPACK.}
-    \item{extra}{The \code{extra} argument that was passed to
-      \code{leading.eigenvector.community}. }
-  }
-}
-\value{
-  \code{leading.eigenvector.community} returns a named list with
-  the following members:
-  \item{membership}{The membership vector at the end of the algorithm,
-    when no more splits are possible.}
-  \item{merges}{The merges matrix starting from the state described by
-    the \code{membership} member. This is a two-column matrix and each
-    line describes a merge of two communities, the first line is the
-    first merge and it creates community \sQuote{\code{N}}, \code{N}
-    is the number of initial communities in the graph, the second line
-    creates community \code{N+1}, etc.
-  }
-  \item{options}{Information about the underlying ARPACK computation,
-    see \code{\link{arpack}} for details.
-  }
-
-  \code{community.le.to.membership} returns a named list with two
-  components:
-  \item{membership}{A membership vector, a numerical vector
-    indication which vertex belongs to which community. The
-    communities are always numbered from one.}
-  \item{csize}{A numeric vector giving the sizes of the communities.}
-}
-\references{
-  MEJ Newman: Finding community structure using the eigenvectors of
-  matrices, Physical Review E 74 036104, 2006.
-} 
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{modularity}}, \code{\link{walktrap.community}},
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link[stats]{as.dendrogram}}
-}
-\examples{
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-lec <- leading.eigenvector.community(g)
-lec
-
-leading.eigenvector.community(g, start=membership(lec))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/line.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/line.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/line.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/line.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-\name{line.graph}
-\alias{line.graph}
-\concept{Line graph}
-\title{Line graph of a graph}
-\description{This function calculates the line graph of another graph.}
-\usage{
-line.graph(graph)
-}
-\arguments{
-  \item{graph}{The input graph, it can be directed or undirected.}
-}
-\details{
- The line graph \code{L(G)} of a \code{G} undirected graph is defined as
- follows. \code{L(G)} has one vertex for each edge in \code{G} and two
- vertices in \code{L(G)} are connected  by an edge if their
- corresponding edges share an end point.
-
- The line graph \code{L(G)} of a \code{G} directed graph is slightly
- different, \code{L(G)} has one vertex for each edge in \code{G} and two
- vertices in \code{L(G)} are connected by a directed edge if the target
- of the first vertex's corresponding edge is the same as the source of
- the second vertex's corresponding edge.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}, the first version of the C
-  code was written by Vincent Matossian.}
-% \seealso{}
-\examples{
-# generate the first De-Bruijn graphs
-g <- graph.full(2, directed=TRUE, loops=TRUE)
-line.graph(g)
-line.graph(line.graph(g))
-line.graph(line.graph(line.graph(g)))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/matching.Rd igraph-0.6.5/interfaces/R/igraph/man/matching.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/matching.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/matching.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,104 +0,0 @@
-\name{graph.matching}
-\alias{is.matching}
-\alias{is.maximal.matching}
-\alias{maximum.bipartite.matching}
-\concept{Matching}
-\concept{Maximal matching}
-\concept{Maximum bipartite matching}
-\title{Graph matching}
-\description{A matching in a graph means the selection of a set of edges
-  that are pairwise non-adjacenct, i.e. they have no common incident
-  vertices. A matching is maximal if it is not a proper subset of any
-  other matching.}
-\usage{
-is.matching(graph, matching, types = NULL)
-is.maximal.matching(graph, matching, types = NULL)
-maximum.bipartite.matching(graph, types = NULL, weights = NULL,
-       eps = .Machine$double.eps)
-}
-\arguments{
-  \item{graph}{The input graph. It might be directed, but edge directions
-    will be ignored.}
-  \item{types}{Vertex types, if the graph is bipartite. By default they
-    are taken from the \sQuote{\code{type}} vertex attribute, if
-    present.}
-  \item{matching}{A potential matching. An integer vector that gives the
-    pair in the matching for each vertex. For vertices without a pair,
-    supply \code{NA} here.}
-  \item{weights}{Potential edge weights. If the graph has an edge
-    attribute called \sQuote{\code{weight}}, and this argument is
-    \code{NULL}, then the edge attribute is used automatically.}
-  \item{eps}{A small real number used in equality tests in the weighted
-    bipartite matching algorithm. Two real numbers are considered
-    equal in the algorithm if their difference is smaller than
-    \code{eps}. This is required to avoid the accumulation of numerical
-    errors. By default it is set to the smallest \eqn{x}, such that
-    \eqn{1+x \ne 1}{1+x != 1} holds. If you are running the algorithm
-    with no  weights, this argument is ignored.}
-}
-\details{
-  \code{is.matching} checks a matching vector and verifies whether its
-  length matches the number of vertices in the given graph, its values
-  are between zero (inclusive) and the number of vertices (inclusive),
-  and whether there exists a corresponding edge in the graph for every
-  matched vertex pair. For bipartite graphs, it also verifies whether
-  the matched vertices are in different parts of the graph.
-
-  \code{is.maximal.matching} checks whether a matching is maximal.
-  A matching is maximal if and only if there exists no unmatched vertex
-  in a graph such that one of its neighbors is also unmatched.
-
-  \code{maximum.bipartite.matching} calculates a maximum matching in a
-  bipartite graph. A matching in a bipartite graph is a partial
-  assignment of vertices of the first kind to vertices of the second
-  kind such that each vertex of the first kind is matched to at most one
-  vertex of the second kind and vice versa, and matched vertices must be
-  connected by an edge in the graph. The size (or cardinality) of a
-  matching is the number of edges. A matching is a maximum matching if
-  there exists no other matching with larger cardinality. For weighted
-  graphs, a maximum matching is a matching whose edges have the largest
-  possible total weight among all possible matchings.
- 
-  Maximum matchings in bipartite graphs are found by the push-relabel
-  algorithm with greedy initialization and a global relabeling after
-  every \eqn{n/2} steps where \eqn{n} is the number of vertices in the
-  graph.
-}
-\value{
-  \code{is.matching} and \code{is.maximal.matching} return a logical
-  scalar.
-
-  \code{maximum.bipartite.matching} returns a list with components:
-  \item{matching_size}{The size of the matching, i.e. the number of
-    edges connecting the matched vertices.}
-  \item{matching_weight}{The weights of the matching, if the graph was
-    weighted. For unweighted graphs this is the same as the size of the
-    matching.}
-  \item{matching}{The matching itself. Numeric vertex id, or vertex
-    names if the graph was named. Non-matched vertices are denoted by
-    \code{NA}.}
-}
-% \references{}
-\author{Tamas Nepusz \email{ntamas@gmail.com}}
-\examples{
-g <- graph.formula( a-b-c-d-e-f )
-m1 <- c("b", "a", "d", "c", "f", "e")   # maximal matching
-m2 <- c("b", "a", "d", "c", NA, NA)     # non-maximal matching
-m3 <- c("b", "c", "d", "c", NA, NA)     # not a matching
-is.matching(g, m1)
-is.matching(g, m2)
-is.matching(g, m3)
-is.maximal.matching(g, m1)
-is.maximal.matching(g, m2)
-is.maximal.matching(g, m3)
-
-V(g)$type <- c(FALSE,TRUE)
-str(g, v=TRUE)
-maximum.bipartite.matching(g)
-
-g2 <- graph.formula( a-b-c-d-e-f-g )
-V(g2)$type <- rep(c(FALSE,TRUE), length=vcount(g2))
-str(g2, v=TRUE)
-maximum.bipartite.matching(g2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/maximum.cardinality.search.Rd igraph-0.6.5/interfaces/R/igraph/man/maximum.cardinality.search.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/maximum.cardinality.search.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/maximum.cardinality.search.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-\name{maximum.cardinality.search}
-\alias{maximum.cardinality.search}
-\concept{maximum cardinality search}
-\concept{graph decomposition}
-\concept{chordal graph}
-\title{Maximum cardinality search}
-\description{Maximum cardinality search is a simple ordering a vertices
-  that is useful in determining the chordality of a graph.}
-\usage{
-maximum.cardinality.search(graph)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but edge directions
-    are ignored, as the algorithm is defined for undirected graphs.}
-}
-\details{
-  Maximum cardinality search visits the vertices in such an order that
-  every time the vertex with the most already visited neighbors is
-  visited. Ties are broken randomly.
-
-  The algorithm provides a simple basis for deciding whether a graph is
-  chordal, see References below, and also \code{\link{is.chordal}}.
-}
-\value{A list with two components:
-  \item{alpha}{Numeric vector. The vertices ordered according to the maximum cardinality
-    search.}
-  \item{alpham1}{Numeric vector. The inverse of \code{alpha}.}
-}
-\references{ Robert E Tarjan and Mihalis Yannakakis. (1984). Simple
-  linear-time algorithms to test chordality of graphs, test acyclicity
-  of hypergraphs, and selectively reduce acyclic hypergraphs.
-  \emph{SIAM Journal of Computation} 13, 566--579.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{is.chordal}} }
-\examples{
-## The examples from the Tarjan-Yannakakis paper
-g1 <- graph.formula(A-B:C:I, B-A:C:D, C-A:B:E:H, D-B:E:F,
-                    E-C:D:F:H, F-D:E:G, G-F:H, H-C:E:G:I,
-                    I-A:H)
-maximum.cardinality.search(g1)
-is.chordal(g1, fillin=TRUE)
-
-g2 <- graph.formula(A-B:E, B-A:E:F:D, C-E:D:G, D-B:F:E:C:G,
-                    E-A:B:C:D:F, F-B:D:E, G-C:D:H:I, H-G:I:J,
-                    I-G:H:J, J-H:I)
-maximum.cardinality.search(g2)
-is.chordal(g2, fillin=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimal.st.separators.Rd igraph-0.6.5/interfaces/R/igraph/man/minimal.st.separators.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimal.st.separators.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/minimal.st.separators.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-\name{minimal.st.separators}
-\alias{minimal.st.separators}
-\concept{Minimal (s,t) separators}
-\concept{Vertex separator}
-\title{Minimum size vertex separators}
-\description{List all vertex sets that are minimal (s,t) separators for
-  some s and t, in an undirected graph.}
-\usage{
-minimal.st.separators(graph)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but edge directions
-    are ignored.}
-}
-\details{
-  A \eqn{(s,t)} vertex separator is a set of vertices, such that after
-  their removal from the graph, there is no path between \eqn{s} and
-  \eqn{t} in the graph.
-
-  A \eqn{(s,t)} vertex separator is minimal if none of its subsets is an
-  \eqn{(s,t)} vertex separator.
-}
-\value{
-  A list of numeric vectors. Each vector contains a vertex set (defined
-  by vertex ids), each vector is an (s,t) separator of the input graph,
-  for some \eqn{s} and \eqn{t}.
-}
-\references{
-  Anne Berry, Jean-Paul Bordat and Olivier Cogis: Generating All the
-  Minimal Separators of a Graph, In: Peter Widmayer, Gabriele Neyer
-  and Stephan Eidenbenz (editors): \emph{Graph-theoretic concepts in
-    computer science}, 1665, 167--172, 1999. Springer. 
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-\examples{
-ring <- graph.ring(4)
-minimal.st.separators(ring)
-
-chvatal <- graph.famous("chvatal")
-minimal.st.separators(chvatal)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimum.size.separators.Rd igraph-0.6.5/interfaces/R/igraph/man/minimum.size.separators.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimum.size.separators.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/minimum.size.separators.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,78 +0,0 @@
-\name{minimum.size.separators}
-\alias{minimum.size.separators}
-\concept{Minimum size vertex separator}
-\concept{Vertex separator}
-\title{Minimum size vertex separators}
-\description{Find all vertex sets of minimal size whose removal
-  separates the graph into more components}
-\usage{
-minimum.size.separators (graph)
-}
-\arguments{
-  \item{graph}{The input graph. It may be directed, but edge directions
-    are ignored.}
-}
-\details{
-  This function implements the Kanevsky algorithm for finding all
-  minimal-size vertex separators in an undirected graph. See the
-  reference below for the details.
-
-  In the special case of a fully connected input graph with \eqn{n}
-  vertices, all subsets of size \eqn{n-1} are listed as the result.
-}
-\value{
-  A list of numeric vectors. Each numeric vector is a vertex separator.
-}
-\references{
-  Arkady Kanevsky: Finding all minimum-size separating vertex sets in a
-  graph. \emph{Networks} 23 533--541, 1993.
-
-  JS Provan and DR Shier: A Paradigm for listing
-  (s,t)-cuts in graphs, \emph{Algorithmica} 15, 351--372, 1996.
-
-  J. Moody and D. R. White. Structural cohesion and embeddedness: A
-  hierarchical concept of social groups. \emph{American Sociological
-    Review}, 68 103--127, Feb 2003.  
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{is.separator}}
-}
-\examples{
-# The graph from the Moody-White paper
-mw <- graph.formula(1-2:3:4:5:6, 2-3:4:5:7, 3-4:6:7, 4-5:6:7,
-                    5-6:7:21, 6-7, 7-8:11:14:19, 8-9:11:14, 9-10,
-                    10-12:13, 11-12:14, 12-16, 13-16, 14-15, 15-16,
-                    17-18:19:20, 18-20:21, 19-20:22:23, 20-21,
-                    21-22:23, 22-23)
-
-# Cohesive subgraphs
-mw1 <- induced.subgraph(mw, as.character(c(1:7, 17:23)))
-mw2 <- induced.subgraph(mw, as.character(7:16))
-mw3 <- induced.subgraph(mw, as.character(17:23))
-mw4 <- induced.subgraph(mw, as.character(c(7,8,11,14)))
-mw5 <- induced.subgraph(mw, as.character(1:7))
-
-minimum.size.separators(mw)
-minimum.size.separators(mw1)
-minimum.size.separators(mw2)
-minimum.size.separators(mw3)
-minimum.size.separators(mw4)
-minimum.size.separators(mw5)
-
-# Another example, the science camp network
-camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-                      Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-                      Holly   - Carol:Pat:Pam:Jennie:Bill,
-                      Bill    - Pauline:Michael:Lee:Holly,
-                      Pauline - Bill:Jennie:Ann,
-                      Jennie  - Holly:Michael:Lee:Ann:Pauline,
-                      Michael - Bill:Jennie:Ann:Lee:John,
-                      Ann     - Michael:Jennie:Pauline,
-                      Lee     - Michael:Bill:Jennie,
-                      Gery    - Pat:Steve:Russ:John,
-                      Russ    - Steve:Bert:Gery:John,
-                      John    - Gery:Russ:Michael)
-lapply(minimum.size.separators(camp), function(x) V(camp)[x])
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimum.spanning.tree.Rd igraph-0.6.5/interfaces/R/igraph/man/minimum.spanning.tree.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/minimum.spanning.tree.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/minimum.spanning.tree.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-\name{minimum.spanning.tree}
-\alias{minimum.spanning.tree}
-\concept{Minimum spanning tree}
-\title{Minimum spanning tree}
-\description{A subgraph of a connected graph is a \emph{minimum spanning tree}
-  if it is tree, and the sum of its edge weights are the minimal among
-  all tree subgraphs of the graph. A minimum spanning forest of a graph
-  is the graph consisting of the minimum spanning trees of its
-  components.}
-\usage{
-minimum.spanning.tree(graph, weights=NULL, algorithm=NULL, \dots)
-}
-\arguments{
-  \item{graph}{The graph object to analyze.}
-  \item{weights}{Numeric algorithm giving the weights of the edges in
-    the graph. The order is determined by the edge ids. This is ignored
-    if the \code{unweighted} algorithm is chosen
-  }
-  \item{algorithm}{The algorithm to use for
-    calculation. \code{unweighted} can be used for unwieghted graphs,
-    and \code{prim} runs Prim's algorithm for weighted graphs.
-    If this is \code{NULL} then igraph tries to select the algorithm
-    automatically: if the graph has an edge attribute called
-    \code{weight} of the \code{weights} argument is not \code{NULL} then
-    Prim's algorithm is chosen, otherwise the unwweighted algorithm is
-    performed.
-  }
-  \item{\dots}{Additional arguments, unused.}
-}
-\details{
-  If the graph is unconnected a minimum spanning forest is returned.
-}
-\value{
-  A graph object with the minimum spanning forest. (To check that it is
-  a tree check that the number of its edges is \code{vcount(graph)-1}.)
-  The edge and vertex attributes of the original graph are preserved in
-  the result.
-}
-\references{ Prim, R.C. 1957. Shortest connection networks and some
-  generalizations \emph{Bell System Technical Journal}, 37 1389--1401.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{clusters}}}
-\examples{
-g <- erdos.renyi.game(100, 3/100)
-mst <- minimum.spanning.tree(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/modularity.Rd igraph-0.6.5/interfaces/R/igraph/man/modularity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/modularity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/modularity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-\name{modularity}
-\alias{modularity}
-\alias{modularity.igraph}
-\concept{Modularity}
-\title{Modularity of a community structure of a graph}
-\description{This function calculates how modular is a given division of a
-  graph into subgraphs.
-}
-\usage{
-\method{modularity}{igraph}(x, membership, weights = NULL, \dots)
-}
-\arguments{
-  \item{x}{The input graph.}
-  \item{membership}{Numeric vector, for each vertex it gives its
-    community. The communities are numbered from one.
-  }
-  \item{weights}{If not \code{NULL} then a numeric vector giving edge
-    weights.}
-  \item{\dots}{Additional arguments, none currently.}
-}
-\details{
-  The modularity of a graph with respect to some division (or vertex
-  types) measures how good the division is, or how separated are the 
-  different vertex types from each other. It defined as 
-  \deqn{Q=\frac{1}{2m} \sum_{i,j} A_{ij}-\frac{k_ik_j}{2m}\delta(c_i,c_j),}{Q=1/(2m) * sum(Aij-ki*kj/(2m)delta(ci,cj),i,j),}
-  here \eqn{m} is the number of edges, \eqn{A_{ij}}{Aij} is the element
-  of the \eqn{A} adjacency matrix 
-  in row \eqn{i} and column \eqn{j}, \eqn{k_i}{ki} is the degree of \eqn{i},
-  \eqn{k_j}{kj} is the degree of \eqn{j}, \eqn{c_i}{ci} is the type (or
-  component) of \eqn{i}, \eqn{c_j}{cj} that of \eqn{j}, the sum goes
-  over all \eqn{i} and \eqn{j} pairs of vertices, and
-  \eqn{\delta(x,y)}{delta(x,y)} is 1 if \eqn{x=y} and 0 otherwise.
-
-  If edge weights are given, then these are considered as the element of
-  the \eqn{A} adjacency matrix, and \eqn{k_i}{ki} is the sum of weights
-  of adjacent edges for vertex \eqn{i}.
-}
-\value{
-  A numeric scalar, the modularity score of the given configuration.
-}
-\references{
-  MEJ Newman and M Girvan: Finding and evaluating community
-  structure in networks. Physical Review E 69 026113, 2004.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{
-  \code{\link{walktrap.community}},
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link{spinglass.community}} for various community detection
-  methods.
-}
-\examples{
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-wtc <- walktrap.community(g)
-modularity(wtc)
-modularity(g, membership(wtc))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/multilevel.community.Rd igraph-0.6.5/interfaces/R/igraph/man/multilevel.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/multilevel.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/multilevel.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,70 +0,0 @@
-\name{multilevel.community}
-\alias{multilevel.community}
-\concept{Community structure}
-\concept{Multilevel community detection}
-\title{Finding community structure by multi-level optimization of
-  modularity}
-\description{This function implements the multi-level modularity optimization
-  algorithm for finding community structure, see references below. It
-  is based on the modularity measure and a hierarchial approach.
-}
-\usage{
-multilevel.community (graph, weights = NULL) 
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{weights}{Optional positive weight vector.
-    If the graph has a \code{weight} edge attribute, then this is used
-    by default. Supply \code{NA} here if the graph has a \code{weight}
-    edge attribute, but you want to ignore it.}
-}
-\details{
-  This function implements the multi-level modularity optimization
-  algorithm for finding community structure, see 
-  VD Blondel, J-L Guillaume, R Lambiotte and E Lefebvre: Fast unfolding of
-  community hierarchies in large networks,
-  \url{http://arxiv.org/abs/arXiv:0803.0476}
-  for the details.
-
-  It is based on the modularity measure and a hierarchial approach. 
-  Initially, each vertex is assigned to a community on its own. In every
-  step, vertices are re-assigned to communities in a local, greedy way:
-  each vertex is moved to the community with which it achieves the
-  highest contribution to modularity. When no vertices can be
-  reassigned, each community is considered a vertex on its own, and the
-  process starts again with the merged communities. The process stops
-  when there is only a single vertex left or when the modularity
-  cannot be increased any more in a step.
-  
-  This function was contributed by Tom Gregorovic.
-}
-\value{
-  \code{multilevel.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{
-  Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne
-  Lefebvre: Fast unfolding of communities in large
-  networks. J. Stat. Mech. (2008) P10008   
-}
-\author{Tom Gregorovic, Tamas Nepusz \email{tamas@cs.rhul.ac.uk}}
-\seealso{
-  See \code{\link{communities}} for extracting the membership,
-  modularity scores, etc. from the results.
-  
-  Other community detection algorithms:
-  \code{\link{walktrap.community}},
-  \code{\link{spinglass.community}},
-  \code{\link{leading.eigenvector.community}},
-  \code{\link{edge.betweenness.community}},
-  \code{\link{fastgreedy.community}},
-  \code{\link{label.propagation.community}}
-}
-\examples{
-# This is so simple that we will have only one level
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-multilevel.community(g)
-}
-\keyword{graphs}
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/neighborhood.Rd igraph-0.6.5/interfaces/R/igraph/man/neighborhood.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/neighborhood.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/neighborhood.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,77 +0,0 @@
-\name{neighborhood}
-\alias{neighborhood}
-\alias{neighborhood.size}
-\alias{graph.neighborhood}
-\alias{connect.neighborhood}
-\title{Neighborhood of graph vertices}
-\description{These functions find the vertices not farther than a given
-  limit from another fixed vertex, these are called the neighborhood of
-  the vertex.}
-\usage{
-neighborhood.size(graph, order, nodes=V(graph), mode=c("all", "out", "in"))
-neighborhood(graph, order, nodes=V(graph), mode=c("all", "out", "in"))
-graph.neighborhood(graph, order, nodes=V(graph), mode=c("all", "out", "in"))
-connect.neighborhood(graph, order, mode=c("all", "out", "in", "total"))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{order}{Integer giving the order of the neighborhood.}
-  \item{nodes}{The vertices for which the calculation is performed.}
-  \item{mode}{Character constatnt, it specifies how to use the direction
-    of the edges if a directed graph is analyzed. For \sQuote{out} only
-    the outgoing edges are followed, so all vertices reachable from the
-    source vertex in at most \code{order} steps are counted. For
-    \sQuote{"in"} all vertices from which the source vertex is reachable
-    in at most \code{order} steps are counted. \sQuote{"all"} ignores
-    the direction of the edges. This argument is ignored for undirected
-    graphs.} 
-}
-\details{
-  The neighborhood of a given order \code{o} of a vertex \code{v}
-  includes all vertices which are closer to \code{v} than the
-  order. Ie. order 0 is always \code{v} itself, order 1 is \code{v}
-  plus its immediate neighbors, order 2 is order 1 plus the immediate
-  neighbors of the vertices in order 1, etc.
-
-  \code{neighborhood.size} calculates the size of the neighborhoods for
-  the given vertices with the given order.
-
-  \code{neighborhood} calculates the neighborhoods of the given vertices
-  with the given order parameter.
-
-  \code{graph.neighborhood} is creates (sub)graphs from all neighborhoods of
-  the given vertices with the given order parameter. This function
-  preserves the vertex, edge and graph attributes.
-
-  \code{connect.neighborhood} creates a new graph by connecting each
-  vertex to all other vertices in its neighborhood.
-}
-\value{
-  \code{neighborhood.size} returns with an integer vector.
-
-  \code{neighborhood} returns with a list of integer vectors.
-
-  \code{graph.neighborhood} returns with a list of graphs.
-
-  \code{connect.neighborhood} returns with a new graph object.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}, the first version was
-  done by Vincent Matossian}
-\examples{
-g <- graph.ring(10)
-neighborhood.size(g, 0, 1:3)
-neighborhood.size(g, 1, 1:3)
-neighborhood.size(g, 2, 1:3)
-neighborhood(g, 0, 1:3)
-neighborhood(g, 1, 1:3)
-neighborhood(g, 2, 1:3)
-
-# attributes are preserved
-V(g)$name <- c("a", "b", "c", "d", "e", "f", "g", "h", "i", "j")
-graph.neighborhood(g, 2, 1:3)
-
-# connecting to the neighborhood
-g <- graph.ring(10)
-g <- connect.neighborhood(g, 2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/nexus.Rd igraph-0.6.5/interfaces/R/igraph/man/nexus.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/nexus.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/nexus.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,203 +0,0 @@
-\name{nexus}
-\alias{nexus}
-\alias{nexus.list}
-\alias{nexus.info}
-\alias{nexus.get}
-\alias{nexus.search}
-\alias{nexusDatasetInfo}
-\alias{print.nexusDatasetInfo}
-\alias{print.nexusDatasetInfoList}
-\alias{summary.nexusDatasetInfoList}
-\concept{The Nexus network repository}
-\title{Query and download from the Nexus network repository}
-\description{The Nexus network repository is an online collection of
-  network data sets. These functions can be used to query it and
-  download data from it, directly as an igraph graph.}
-\usage{
-nexus.list(tags=NULL, offset=0, limit=10,
-           operator=c("or", "and"),
-           order=c("date", "name", "popularity"),
-           nexus.url=getIgraphOpt("nexus.url"))
-nexus.info(id, nexus.url=getIgraphOpt("nexus.url"))
-nexus.get(id, offset=0, order=c("date", "name", "popularity"),
-          nexus.url=getIgraphOpt("nexus.url"))
-nexus.search(q, offset=0, limit=10,
-             order=c("date", "name", "popularity"),
-             nexus.url=getIgraphOpt("nexus.url"))
-
-\method{print}{nexusDatasetInfo}(x, \dots)
-\method{summary}{nexusDatasetInfoList}(object, \dots)
-\method{print}{nexusDatasetInfoList}(x, \dots)
-}
-\arguments{
-  \item{tags}{A character vector, the tags that are searched. If not
-    given (or \code{NULL}), then all datasets are listed.}
-  \item{offset}{An offset to select part of the results. Results are
-    listed from \code{offset}+1.}
-  \item{limit}{The maximum number of results to return.}
-  \item{operator}{A character scalar. If \sQuote{or} (the default),
-    then all datasets that have at least one of the given tags, are
-    returned. If it if \sQuote{and}, then only datasets that have all
-    the given tags, are returned.}
-  \item{order}{The ordering of the results, possible values are:
-    \sQuote{date}, \sQuote{name}, \sQuote{popularity}.}
-  \item{id}{The numeric or character id of the data set to query or
-    download. Instead of the data set ids, it is possible to supply a
-    \code{nexusDatasetInfo} or \code{nexusDatasetInfoList} object
-    here directly and then the query is done on the corresponding data
-    set(s).}
-  \item{q}{Nexus search string. See examples below. For the complete
-    documentation please see the Nexus homepage at
-    \url{http://nexus.igraph.org}.}
-  \item{nexus.url}{The URL of the Nexus server. Don't change this from
-    the default, unless you set up your own Nexus server.}
-  \item{x,object}{The \code{nexusDatasetInfo} object to print.}
-  \item{\dots}{Currently ignored.}
-}
-\details{
-  Nexus is an online repository of networks, with an API that allow
-  programatic queries against it, and programatic data download as
-  well.
-
-  The \code{nexus.list} and \code{nexus.info} functions query the
-  online database. They both return \code{nexusDatasetInfo} objects.
-  \code{nexus.info} returns more information than \code{nexus.list}.
-
-  \code{nexus.search} searches Nexus, and returns a list of data sets,
-  as \code{nexusDatasetInfo} objects. See below for some search
-  examples.
-
-  \code{nexus.get} downloads a data set from Nexus, based on its numeric
-  id, or based on a Nexus search string. For search strings, only the
-  first search hit is downloaded, but see also the \code{offset}
-  argument. (If there are not data sets found, then the function returns
-  an error.)
-  
-  The \code{nexusDatasetInfo} objects returned by \code{nexus.list} have
-  the following fields:
-  \describe{
-    \item{id}{The numeric id of the dataset.}
-    \item{sid}{The character id of the dataset.}
-    \item{name}{Character scalar, the name of the dataset.}
-    \item{vertices/edges}{Character, the number of vertices and edges in
-      the graph(s). Vertices and edges are separated by a slash, and
-      if the data set consists of multiple networks, then they are
-      separated by spaces.}
-    \item{tags}{Character vector, the tags of the dataset. Directed
-      graph have the tags \sQuote{directed}. Undirected graphs are
-      tagged as \sQuote{undirected}. Other common tags are:
-      \sQuote{weighted}, \sQuote{bipartite}, \sQuote{social network},
-      etc.}
-    \item{networks}{The ids and names of the networks in the data
-      set. The numeric and character id are separated by a slash, and
-      multiple networks are separated by spaces.}
-  }
-
-  \code{nexusDatasetInfo} objects returned by \code{nexus.info} have the
-  following additional fields:
-  \describe{
-    \item{date}{Character scalar, e.g. \sQuote{2011-01-09}, the date
-      when the dataset was added to the database.}
-    \item{formats}{Character vector, the data formats in which the data
-      set is available. The various formats are separated by semicolons.}
-    \item{licence}{Character scalar, the licence of the dataset.}
-    \item{licence url}{Character scalar, the URL of the licence of the
-      dataset. Pleaase make sure you consult this before using a
-      dataset.}
-    \item{summary}{Character scalar, the short description of
-      the dataset, this is usually a single sentence.}
-    \item{description}{Character scalar, the full description of the
-      dataset.}
-    \item{citation}{Character scalar, the paper(s) describing the
-      dataset. Please cite these papers if you are using the dataset in
-      your research, the licence of most datasets requires this.}
-    \item{attributes}{A list of lists, each list entry is a graph,
-      vertex or edge attribute and has the following entries:
-      \describe{
-	\item{type}{Type of the attribute, either \sQuote{graph},
-	  \sQuote{vertex} or \sQuote{edge}.}
-	\item{datatype}{Data type of the attribute, currently it can be
-	  \sQuote{numeric} and \sQuote{string}.}
-	\item{name}{Character scalar, the name of the attribute.}
-	\item{description}{Character scalar, the description of the
-	  attribute.}
-      }
-    }
-  }
-
-  The results of the Nexus queries are printed to the screen in a
-  consise format, similar to the format of igraph graphs. A data set
-  list (typically the result of \code{nexus.list} and
-  \code{nexus.search}) looks like this: \preformatted{NEXUS 1-5/18 -- data set list
-[1] kaptail.4         39/109-223   #18 Kapferer tailor shop
-[2] condmatcollab2003 31163/120029 #17 Condensed matter collaborations+
-[3] condmatcollab     16726/47594  #16 Condensed matter collaborations+
-[4] powergrid         4941/6594    #15 Western US power grid
-[5] celegansneural    297/2359     #14 C. Elegans neural network }
-  Each line here represents a data set, and the following information is
-  given about them: the character id of the data set
-  (e.g. \code{kaptail} or \code{powergrid}), the number of vertices and
-  number of edges in the graph of the data sets. For data sets with
-  multiple graphs, intervals are given here. Then the numeric id of the
-  data set and the reamining space is filled with the name of the data
-  set.
-
-  Summary information about an individual Nexus data set is printed
-  as \preformatted{NEXUS B--- 39 109-223 #18 kaptail -- Kapferer tailor shop
-+ tags: directed; social network; undirected
-+ nets: 1/KAPFTI2; 2/KAPFTS2; 3/KAPFTI1; 4/KAPFTS1}
-  This is very similar to the header that is used for printing igraph
-  graphs, but there are some differences as well. The four characters
-  after the \code{NEXUS} word give the most important properties of the
-  graph(s): the first is \sQuote{\code{U}} for undirected and
-  \sQuote{\code{D}} for directed graphs, and \sQuote{\code{B}} if the
-  data set contains both directed and undirected graphs. The second is
-  \sQuote{\code{N}} named graphs. The third character is
-  \sQuote{\code{W}} for weighted graphs, the fourth is \sQuote{\code{B}}
-  if the data set contains bipartite graphs. Then the number of vertices
-  and number of edges are printed, for data sets with multiple graphs,
-  the smallest and the largest values are given. Then comes the numeric
-  id, and the string id of the data set. The end of the first
-  line contains the name of the data set. The second row
-  lists the data set tags, and the third row the networks that are
-  included in the data set.
-
-  Detailed data set information is printed similarly, but it contains
-  more fields.
-}
-\value{
-  \code{nexus.list} and \code{nexus.search} return a list of
-  \code{nexusDatasetInfo} objects. The list also has these attributes:
-  \describe{
-    \item{size}{The number of data sets returned by the query.}
-    \item{totalsize}{The total number of data sets found for the query.}
-    \item{offset}{The offset parameter of the query.}
-    \item{limit}{The limit parameter of the query.}
-  }
-  
-  \code{nexus.info} returns a single \code{nexusDatasetInfo} object.
-
-  \code{nexus.get} returns an igraph graph object, or a list of graph
-  objects, if the data set consists of multiple networks.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \url{http://nexus.igraph.org} }
-\examples{
-\dontrun{nexus.list(tag="weighted")
-nexus.list(limit=3, order="name")
-nexus.list(limit=3, order="name")[[1]]
-nexus.info(2)
-g <- nexus.get(2)
-summary(g)
-
-## Data sets related to 'US':
-nexus.search("US")
-
-## Search for data sets that have 'network' in their name:
-nexus.search("name:network")
-
-## Any word can match
-nexus.search("blog or US or karate")
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/operators.Rd igraph-0.6.5/interfaces/R/igraph/man/operators.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/operators.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/operators.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,103 +0,0 @@
-\name{graph-operators}
-\alias{graph.union}
-\alias{graph.disjoint.union}
-\alias{graph.intersection}
-\alias{graph.compose}
-\alias{graph.difference}
-\alias{graph.complementer}
-\alias{\%c\%}
-\alias{\%du\%}
-\alias{\%m\%}
-\alias{\%s\%}
-\alias{\%u\%}
-\concept{Graph operators}
-\title{Graph operators}
-\description{Graph operators handle graphs in terms of set theory.}
-\usage{
-graph.union(\dots)
-graph.disjoint.union(\dots)
-graph.intersection(\dots)
-graph.compose(g1, g2)
-graph.difference(big, small)
-graph.complementer(graph, loops=FALSE)
-x \%c\% y
-x \%du\% y
-x \%m\% y
-x \%s\% y
-x \%u\% y
-}
-\arguments{
-  \item{\dots}{Graph objects or lists of graph objects.}
-  \item{g1,g2,big,small,graph,x,y}{Graph objects.}
-  \item{loops}{Logical constant, whether to generate loop edges.}
-}
-\details{
-  A graph is homogenous binary relation over the set 0, \dots, |V|-1,
-  |V| is the number of vertices in the graph. A homogenous binary
-  relation is a set of ordered (directed graphs) or unordered
-  (undirected graphs) pairs taken from 0, \dots, |V|-1. The functions
-  documented here handle graphs as relations.
-
-  \code{graph.union} creates the union of two or more graphs. Ie. only
-  edges which are included in at least one graph will be part of the new
-  graph. This function can be also used via the \%u\% operator.
-
-  \code{graph.disjoint.union} creates a union of two or more disjoint
-  graphs. Thus first the vertices in the second, third, etc. graphs are
-  relabeled to have completely disjoint graphs. Then a simple union is
-  created. This function can also be used via the \%du\% operator.
-
-  \code{graph.intersection} creates the intersection of two or more
-  graphs: only edges present in all graphs will be included.
-  The corresponding operator is \%s\%.
-
-  \code{graph.difference} creates the difference of two graphs. Only
-  edges present in the first graph but not in the second will be be
-  included in the new graph. The corresponding operator is \%m\%.
-
-  \code{graph.complementer} creates the complementer of a graph. Only
-  edges which are \emph{not} present in the original graph will be
-  included in the new graph.
-
-  \code{graph.compose} creates the composition of two graphs. The new
-  graph will contain an (a,b) edge only if there is a vertex c, such
-  that edge (a,c) is included in the first graph and (c,b) is included
-  in the second graph. The corresponding operator is \%c\%.
-
-  \code{graph.complementer} keeps graph and vertex attriubutes, edge
-  attributes are lost. \code{graph.difference} keeps all attributes
-  (graph, vertex and edge) of the first graph.
-  The other functions do not handle vertex and edge
-  attributes, the new graph will have no attributes at all.
-}
-\value{
-A new graph object.
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g1 <- graph.ring(10)
-g2 <- graph.star(10, mode="undirected")
-graph.union(g1, g2)
-graph.disjoint.union(g1, g2)
-graph.intersection(g1, g2)
-graph.difference(g1, g2)
-graph.complementer(g2)
-graph.compose(g1, g2)
-
-## graph complementer keeps graph and vertex attributes
-g2$layout <- layout.circle
-V(g2)$name <- letters[1:vcount(g2)]
-cg2 <- graph.complementer(g2)
-cg2$layout
-V(cg2)$name
-
-## graph difference keeps the attributes of the first graph
-g1$name <- "Ring"
-V(g1)$name <- LETTERS[1:vcount(g1)]
-E(g1)$weight <- round(runif(ecount(g1))*10)
-dg <- graph.difference(g1, g2)
-print(dg, g=TRUE, v=TRUE, e=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/operatorsByName.Rd igraph-0.6.5/interfaces/R/igraph/man/operatorsByName.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/operatorsByName.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/operatorsByName.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,82 +0,0 @@
-\name{graph-operators-by-name}
-\alias{graph.intersection.by.name}
-\alias{graph.union.by.name}
-\alias{graph.difference.by.name}
-\concept{Graph operators}
-\title{Graph operators based on symbolic vertex names}
-\description{Normally igraph operators are based on internal igraph
-  vertex ids. This function works with vertex names instead.}
-\usage{
-graph.intersection.by.name(g1, g2, keep.x.vertices = FALSE,
-      keep.x.vertex.attributes = FALSE,
-      keep.x.edge.attributes = FALSE)
-graph.union.by.name(g1, g2)
-graph.difference.by.name(g1, g2, keep.x.vertex.attributes = FALSE,
-      keep.x.edge.attributes = FALSE)
-}
-\arguments{
-  \item{g1,g2}{The input graphs, they should be both directed or both
-    undirected.}
-  \item{keep.x.vertices}{Logical scalar, whether to keep all the
-    vertices of \code{g1}, even if they do not appear in \code{g2}.}
-  \item{keep.x.vertex.attributes}{Logical scalar, whether to keep all
-    vertex attributes of the \code{g1}, even if they do not appear in
-    \code{g2}.}
-  \item{keep.x.edge.attributes}{Logical scalar, whether to keep edge
-    attributes of \code{g1}, even if they do not appear in \code{g2}.}
-}
-\details{
-  These functions treat the graphs as sets of ordered (if they are
-  directed), or unordered (if they are undirected) pairs of symbolic
-  vertex names and perform set operations on them.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{Magnus Torfason}
-\seealso{\code{\link{graph.union}}, \code{link{graph.intersection}} and
-  \code{link{graph.difference}} for the functions that are based on
-  vertex ids.}
-\examples{
-# Print attributes as well
-igraph.options(print.vertex.attributes=TRUE,
-               print.edge.attributes=TRUE)
-
-# Creating a wheel graph
-g1 <- graph.ring(10)
-V(g1)$name <- letters[1:vcount(g1)]
-g2 <- graph.star(11, mode="undirected")
-V(g2)$name <- c("z", letters[1:vcount(g1)])
-g <- graph.union.by.name(g1, g2)
-if (interactive()) {
-  plot(g, layout=layout.kamada.kawai, vertex.label=V(g)$name)
-}
-g
-
-# Some more examples
-g1 <- graph.formula(a-b-c)
-V(g1)$v.attr=c(1,2,3)
-E(g1)$e.attr=c(5,7)
-g2 <- graph.formula(b-c-d)
-
-# Test the functions
-graph.intersection.by.name(g1,g2) # Vertices are intersected as well
-graph.union.by.name(g1,g2)        # Vertices are unioned as well
-graph.difference.by.name(g1,g2)   # Vertices from x (g1) are used
-
-# graph.intersection.by.name() has some extra parameters
-graph.intersection.by.name(g1,g2,
-    keep.x.vertices          = TRUE) # Keep all x vertices (only intersect edges)
-
-graph.intersection.by.name(g1,g2,
-    keep.x.vertices          = FALSE, # Keep all x vertices (only intersect edges)
-    keep.x.vertex.attributes = TRUE, # Don't throw away V(g1) attributes
-    keep.x.edge.attributes   = TRUE) # Don't throw away E(g1) attributes
-
-# graph.difference.by.name() has some extra parameters
-graph.difference.by.name(g1,g2,
-    keep.x.vertex.attributes = TRUE, # Don't throw away V(g1) attributes
-    keep.x.edge.attributes   = TRUE) # Don't throw away E(g1) attributes
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/optimal.community.Rd igraph-0.6.5/interfaces/R/igraph/man/optimal.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/optimal.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/optimal.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-\name{optimal.community}
-\alias{optimal.community}
-\concept{Community structure}
-\concept{Modularity}
-\title{Optimal community structure}
-\description{
-  This function calculates the optimal community structure of a graph,
-  by maximizing the modularity measure over all possible partitions.}
-\usage{
-optimal.community(graph)
-}
-\arguments{
-  \item{graph}{The input graph. Edge directions are ignored for directed
-    graphs.}
-}
-\details{
-  This function calculates the optimal community structure for a
-  graph, in terms of maximal modularity score. 
-  
-  The calculation is done by transforming the modularity maximization
-  into an integer programming problem, and then calling the GLPK
-  library to solve that. Please the reference below for details. 
-
-  Note that modularity optimization is an NP-complete problem, and
-  all known algorithms for it have exponential time complexity. This
-  means that you probably don't want to run this function on larger
-  graphs. Graphs with up to fifty vertices should be fine, graphs
-  with a couple of hundred vertices might be possible.
-}
-\value{
-  \code{optimal.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{
-  Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Gorke, Martin
-  Hoefer, Zoran Nikoloski, Dorothea Wagner: On Modularity Clustering,
-  \emph{IEEE Transactions on Knowledge and Data Engineering}
-  20(2):172-188, 2008.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{communities}} for the documentation of the result,
-  \code{\link{modularity}}. See also \code{\link{fastgreedy.community}} 
-  for a fast greedy optimizer.
-}
-\examples{
-## Zachary's karate club
-g <- graph.famous("Zachary")
-
-## We put everything into a big 'try' block, in case 
-## igraph was compiled without GLPK support
-
-try({
-  ## The calculation only takes a couple of seconds
-  oc <- optimal.community(g)
-
-  ## Double check the result
-  print(modularity(oc))
-  print(modularity(g, membership(oc)))
-
-  ## Compare to the greedy optimizer
-  fc <- fastgreedy.community(g)
-  print(modularity(fc))
-}, silent=TRUE)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/page.rank.Rd igraph-0.6.5/interfaces/R/igraph/man/page.rank.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/page.rank.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/page.rank.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,115 +0,0 @@
-\name{page.rank}
-\alias{page.rank}
-\alias{page.rank.old}
-\concept{Page rank}
-\title{The Page Rank algorithm}
-\description{ Calculates the Google PageRank for the specified
-  vertices.}
-\usage{
-page.rank (graph, vids = V(graph), directed = TRUE, damping = 0.85, 
-    personalized = NULL, weights = NULL,
-    options = igraph.arpack.default) 
-page.rank.old (graph, vids = V(graph), directed = TRUE, niter = 1000, 
-    eps = 0.001, damping = 0.85, old = FALSE) 
-}
-\arguments{
-  \item{graph}{The graph object. }
-  \item{vids}{The vertices of interest.}
-  \item{directed}{Logical, if true directed paths will be considered for
-    directed graphs. It is ignored for undirected graphs.}
-  \item{damping}{The damping factor (\sQuote{d} in the original paper).}
-  \item{personalized}{Optional vector giving a probability distribution
-    to calculate personalized PageRank. For personalized PageRank, the
-    probability of jumping to a node when abandoning the random walk is
-    not uniform, but it is given by this vector. The vector should
-    contains an entry for each vertex and it will be rescaled to sum up
-    to one.}
-  \item{weights}{A numerical vector or \code{NULL}. This argument can be
-    used to give edge weights for calculating the weighted PageRank of
-    vertices. If this is \code{NULL} and the graph has a \code{weight}
-    edge attribute then that is used. If \code{weights} is a numerical
-    vector then it used, even if the graph has a \code{weights} edge
-    attribute. If this is \code{NA}, then no edge weights are used (even
-    if the graph has a \code{weight} edge attribute.}
-  \item{options}{A named list, to override some ARPACK options. See
-    \code{\link{arpack}} for details.}
-  \item{niter}{The maximum number of iterations to perform.} 
-  \item{eps}{The algorithm will consider the calculation as complete if
-    the difference of PageRank values between iterations change less
-    than this value for every node.}
-  \item{old}{A logical scalar, whether the old style (pre igraph 0.5)
-    normalization to use. See details below.}
-}
-\details{
-  For the explanation of the PageRank algorithm, see the following
-  webpage: \url{http://www-db.stanford.edu/~backrub/google.html}, or the
-  following reference: 
-
-  Sergey Brin and Larry Page: The Anatomy of a Large-Scale Hypertextual
-  Web Search Engine. Proceedings of the 7th World-Wide Web Conference,
-  Brisbane, Australia, April 1998.  
-
-  igraph 0.5 (and later) contains two PageRank calculation
-  implementations. The \code{page.rank} function uses ARPACK to perform
-  the calculation, see also \code{\link{arpack}}.
-
-  The \code{page.rank.old} function performs a simple power method, this
-  is the implementation that was available under the name
-  \code{page.rank} in pre 0.5 igraph versions. Note that
-  \code{page.rank.old} has an argument called \code{old}. If this
-  argument is \code{FALSE} (the default), then the proper PageRank
-  algorithm is used, i.e. \eqn{(1-d)/n} is added to the weighted
-  PageRank of vertices to calculate the next iteration. If this
-  argument is \code{TRUE} then \eqn{(1-d)} is added, just like in the
-  PageRank paper; \eqn{d} is the damping factor, and \eqn{n} is the
-  total number of vertices.
-  A further difference is that the old implementation does not
-  renormalize the page rank vector after each iteration.
-  Note that the \code{old=FALSE} method is not stable,
-  is does not necessarily converge to a fixed point. It should be
-  avoided for new code, it is only included for compatibility with old
-  igraph versions.
-  
-  Please note that the PageRank of a given vertex depends on the PageRank
-  of all other vertices, so even if you want to calculate the PageRank for
-  only some of the vertices, all of them must be calculated. Requesting
-  the PageRank for only some of the vertices does not result in any
-  performance increase at all. 
-
-  Since the calculation is an iterative process, the algorithm is
-  stopped after a given count of iterations or if the PageRank value
-  differences between iterations are less than a predefined value. 
-}
-\value{
-  For \code{page.rank} a named list with entries:
-  \item{vector}{A numeric vector with the PageRank scores.}
-  \item{value}{The eigenvalue corresponding to the eigenvector with
-    the page rank scores. It should be always exactly one.}
-  \item{options}{Some information about the underlying ARPACK
-    calculation. See \code{\link{arpack}} for details.}
-  
-  For \code{page.rank.old} a numeric vector of Page Rank scores.
-}
-\references{
-  Sergey Brin and Larry Page: The Anatomy of a Large-Scale Hypertextual
-  Web Search Engine. Proceedings of the 7th World-Wide Web Conference,
-  Brisbane, Australia, April 1998.  
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{Other centrality scores: \code{\link{closeness}},
-  \code{\link{betweenness}}, \code{\link{degree}}}
-\examples{
-g <- random.graph.game(20, 5/20, directed=TRUE)
-page.rank(g)$vector
-
-g2 <- graph.star(10)
-page.rank(g2)$vector
-
-# Personalized PageRank
-g3 <- graph.ring(10)
-page.rank(g3)$vector
-reset <- seq(vcount(g3))
-page.rank(g3, personalized=reset)$vector
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/permute.vertices.Rd igraph-0.6.5/interfaces/R/igraph/man/permute.vertices.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/permute.vertices.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/permute.vertices.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-\name{permute.vertices}
-\alias{permute.vertices}
-\concept{Permutation}
-\title{Permute the vertices of a graph}
-\description{Create a new graph, by permuting vertex ids.}
-\usage{
-permute.vertices(graph, permutation)
-}
-\arguments{
-  \item{graph}{The input graph, it can directed or undirected.}
-  \item{permutation}{A numeric vector giving the permutation to
-    apply. The first element is the new id of vertex 1, etc. Every
-    number between one and \code{vcount(graph)} must appear exactly
-    once.}
-}
-\details{
-  This function creates a new graph from the input graph by permuting
-  its vertices according to the specified mapping. Call this function
-  with the output of \code{\link{canonical.permutation}} to create
-  the canonical form of a graph.
-
-  \code{permute.vertices} keeps all graph, vertex and edge attributes of
-  the graph.
-}
-\value{A new graph object.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{canonical.permutation}}}
-\examples{
-# Random permutation of a random graph
-g <- random.graph.game(20, 50, type="gnm")
-g2 <- permute.vertices(g, sample(vcount(g)))
-graph.isomorphic(g, g2)
-
-# Permutation keeps all attributes
-g$name <- "Random graph, Gnm, 20, 50"
-V(g)$name <- letters[1:vcount(g)]
-E(g)$weight <- sample(1:5, ecount(g), replace=TRUE)
-g2 <- permute.vertices(g, sample(vcount(g)))
-graph.isomorphic(g, g2)
-g2$name
-V(g2)$name
-E(g2)$weight
-all(sort(E(g2)$weight) == sort(E(g)$weight))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/plot.common.Rd igraph-0.6.5/interfaces/R/igraph/man/plot.common.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/plot.common.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/plot.common.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,451 +0,0 @@
-\name{Drawing graphs}
-\alias{igraph.plotting}
-\concept{Visualization}
-\title{Drawing graphs}
-\description{The common bits of the three plotting functions
-  \code{plot.igraph}, \code{tkplot} and \code{rglplot} are discussed in
-  this manual page}
-\details{
-  There are currently three different functions in the igraph package
-  which can draw graph in various ways:
-
-  \code{plot.igraph} does simple non-interactive 2D plotting to R devices.
-  Actually it is an implementation of the \code{\link[graphics]{plot}}
-  generic function, 
-  so you can write \code{plot(graph)} instead of
-  \code{plot.igraph(graph)}. As it used the standard R devices it
-  supports every output format for which R has an output device. The
-  list is quite impressing: PostScript, PDF files, XFig files, SVG
-  files, JPG, PNG and of course you can plot to the screen as well using
-  the default devices, or the good-looking anti-aliased Cairo device.
-  See \code{\link{plot.igraph}} for some more information.
-
-  \code{\link{tkplot}} does interactive 2D plotting using the \code{tcltk}
-  package. It can only handle graphs of moderate size, a thousend
-  vertices is probably already too many. Some parameters of the plotted
-  graph can be changed interactively after issuing the \code{tkplot}
-  command: the position, color and size of the vertices and the color
-  and width of the edges. See \code{\link{tkplot}} for details.
-    
-  \code{\link{rglplot}} is an experimental function to draw graphs in 3D
-  using OpenGL. See \code{\link{rglplot}} for some more information.
-
-  Please also check the examples below.
-}
-\section{How to specify graphical parameters}{
-  There are three ways to give values to the parameters described below,
-  in section 'Parameters'. We give these three ways here in the order of
-  their precedence. 
-
-  The first method is to supply named arguments to the plotting commands:
-  \code{\link{plot.igraph}}, \code{\link{tkplot}} or
-  \code{\link{rglplot}}. Parameters for vertices start with prefix
-  \sQuote{\code{vertex.}}, parameters for edges have prefix
-  \sQuote{\code{edge.}}, and global parameters have no prefix. Eg. the
-  color of the vertices can be given via argument \code{vertex.color},
-  whereas \code{edge.color} sets the color of the edges. \code{layout}
-  gives the layout of the graphs.
-
-  The second way is to assign vertex, edge and graph attributes to the
-  graph. These attributes have now prefix, ie. the color of the vertices
-  is taken from the \code{color} vertex attribute and the color of the
-  edges from the \code{color} edge attribute. The layout of the graph is
-  given by the \code{layout} graph attribute. (Always assuming that the
-  corresponding command argument is not present.) Setting vertex and
-  edge attributes are handy if you want to assign a given \sQuote{look}
-  to a graph, attributes are saved with the graph is you save it with
-  \code{\link[base]{save}} or in GraphML format with
-  \code{\link{write.graph}}, so the graph will have the same look after
-  loading it again.
-
-  If a parameter is not given in the command line, and the corresponding
-  vertex/edge/graph attribute is also missing then the general igraph
-  parameters handled by \code{\link{igraph.options}} are also
-  checked. Vertex parameters have prefix \sQuote{\code{vertex.}}, edge
-  parameters are prefixed with \sQuote{\code{edge.}}, general parameters
-  like \code{layout} are prefixed with \sQuote{\code{plot}}.
-  These parameters are useful if you want
-  all or most of your graphs to have the same look, vertex size, vertex
-  color, etc. Then you don't need to set these at every plotting, and
-  you also don't need to assign vertex/edge attributes to every graph.
-
-  If the value of a parameter is not specified by any of the three ways
-  described here, its default valued is used, as given in the source
-  code.
-
-  Different parameters can have different type, eg. vertex colors can be
-  given as a character vector with color names, or as an integer vector
-  with the color numbers from the current palette. Different types are
-  valid for different parameters, this is discussed in detail in the
-  next section. It is however always true that the parameter can always
-  be a function object in which it will be called with the graph as its
-  single argument to get the \dQuote{proper} value of the parameter.
-  (If the function returns another function object that will \emph{not}
-  be called again\dots)
-}
-\section{The list of parameters}{
-  Vertex parameters first, note that the \sQuote{\code{vertex.}} prefix
-  needs to be added if they are used as an argument or when setting via
-  \code{\link{igraph.options}}. The value of the parameter may be scalar
-  valid for every vertex or a vector with a separate value for each
-  vertex. (Shorter vectors are recycled.)
-  \describe{
-    \item{size}{The size of the vertex, a numeric scalar or vector, in
-      the latter case each vertex sizes may differ. This vertex sizes
-      are scaled in order have about the same size of vertices for a
-      given value for all three plotting commands. It does not need to
-      be an integer number.
-
-      The default value is 15. This is big enough to place short labels
-      on vertices.}
-    \item{size2}{The \dQuote{other} size of the vertex, for some vertex
-      shapes. For the various rectangle shapes this gives the height of
-      the vertices, whereas \code{size} gives the width. It is ignored
-      by shapes for which the size can be specified with a single
-      number.
-
-      The default is 15.
-    }
-    \item{color}{The fill color of the vertex. If it is numeric then
-      the current palette is used, see
-      \code{\link[grDevices]{palette}}. If it is a character vector then
-      it may either contain named colors or RGB specified colors with
-      three or four bytes. All strings starting with \sQuote{\code{#}}
-      are assumed to be RGB color specifications. It is possible to mix
-      named color and RGB colors. Note that \code{\link{tkplot}} ignores
-      the fourth byte (alpha channel) in the RGB color specification.
-
-      If you don't want (some) vertices to have any color, supply
-      \code{NA} as the color name.
-      
-      The default value is \dQuote{\code{SkyBlue2}}.
-    }
-    \item{frame.color}{The color of the frame of the vertices, the same
-      formats are allowed as for the fill color.
-
-      If you don't want vertices to have a frame, supply \code{NA} as
-      the color name.
-
-      By default it is \dQuote{black}.
-    }
-    \item{shape}{The shape of the vertex, currently
-      \dQuote{\code{circle}}, \dQuote{\code{square}},
-      \dQuote{\code{csquare}}, \dQuote{\code{rectangle}},
-      \dQuote{\code{crectangle}}, \dQuote{\code{vrectangle}},
-      \dQuote{\code{pie}} (see \link{vertex.shape.pie}),
-      \sQuote{\code{sphere}}, and \dQuote{\code{none}} are supported,
-      and only by the \code{\link{plot.igraph}}
-      command. \dQuote{\code{none}} does not draw the vertices at all,
-      although vertex label are plotted (if given). See
-      \code{\link{igraph.vertex.shapes}} for details about vertex
-      shapes and \code{\link{vertex.shape.pie}} for using pie charts as
-      vertices.
-
-      The \dQuote{\code{sphere}} vertex shape plots vertices as 3D
-      ray-traced spheres, in the given color and size. This produces a
-      raster image and it is only supported with some graphics
-      devices. On some devices raster transparency is not supported and
-      the spheres do not have a transparent background. See
-      \code{\link{dev.capabilities}} and the \sQuote{\code{rasterImage}}
-      capability to check that your device is supported.
-      
-      By default vertices are drawn as circles.
-    }
-    \item{label}{The vertex labels. They will be converted to
-      character. Specify \code{NA} to omit vertex labels.
-
-      The default vertex labels are the vertex ids.
-    }
-    \item{label.family}{The font family to be used for vertex labels.
-      As different plotting commands can used different fonts, they
-      interpret this parameter different ways. The basic notation is,
-      however, understood by both \code{\link{plot.igraph}} and
-      \code{\link{tkplot}}. \code{\link{rglplot}} does not support fonts
-      at all right now, it ignores this parameter completely.
-
-      For \code{\link{plot.igraph}} this parameter is simply passed to
-      \code{\link[graphics]{text}} as argument \code{family}.
-
-      For \code{\link{tkplot}} some
-      conversion is performed. If this parameter is the name of an
-      exixting Tk font, then that font is used and the \code{label.font}
-      and \code{label.cex} parameters are ignored complerely. If it is
-      one of the base families (serif, sans, mono) then Times,
-      Helvetica or Courier fonts are used, there are guaranteed to exist
-      on all systems. For the \sQuote{symbol} base family we used the
-      symbol font is available, otherwise the first font which has
-      \sQuote{symbol} in its name. If the parameter is not a name of the
-      base families and it is also not a named Tk font then we pass it
-      to \code{\link[tcltk]{tkfont.create}} and hope the user knows what
-      she is doing. The \code{label.font} and \code{label.cex}
-      parameters are also passed to \code{\link[tcltk]{tkfont.create}}
-      in this case.
-
-      The default value is \sQuote{serif}.
-    }
-    \item{label.font}{The font within the font family to use for the
-      vertex labels. It is interpreted the same way as the the
-      \code{font} graphical parameter: 1 is plain text, 2 is bold face,
-      3 is italic, 4 is bold and italic and 5 specifies the symbol
-      font.
-
-      For \code{\link{plot.igraph}} this parameter is simply passed to
-      \code{\link[graphics]{text}}.
-
-      For \code{\link{tkplot}}, if the \code{label.family} parameter is
-      not the name of a Tk font then this parameter is used to set
-      whether the newly created font should be italic and/or
-      boldface. Otherwise it is ignored.
-
-      For \code{\link{rglplot}} it is ignored.
-
-      The default value is 1.
-    }
-    \item{label.cex}{The font size for vertex labels. It is interpreted
-      as a multiplication factor of some device-dependent base font
-      size.
-
-      For \code{\link{plot.igraph}} it is simply passed to
-      \code{\link[graphics]{text}} as argument \code{cex}.
-
-      For \code{\link{tkplot}} it is multiplied by 12 and then used as
-      the \code{size} argument for \code{\link[tcltk]{tkfont.create}}.
-      The base font is thus 12 for tkplot.
-
-      For \code{\link{rglplot}} it is ignored.
-
-      The default value is 1.
-    }
-    \item{label.dist}{
-      The distance of the label from the center of the vertex. If it is 0
-      then the label is centered on the vertex. If it is 1 then the
-      label is displayed beside the vertex.
-
-      The default value is 0.
-    }
-    \item{label.degree}{
-      It defines the position of the vertex labels, relative to the
-      center of the vertices. It is interpreted as an angle in radian,
-      zero means \sQuote{to the right}, and \sQuote{\code{pi}} means to
-      the left, up is \code{-pi/2} and down is \code{pi/2}.
-
-      The default value is \code{-pi/4}.
-    }
-    \item{label.color}{The color of the labels, see the \code{color}
-      vertex parameter discussed earlier for the possible values.
-
-      The default value is \code{black}.
-    }    
-  }
-
-  Edge parameters require to add the \sQuote{\code{edge.}} prefix when
-  used as arguments or set by \code{\link{igraph.options}}. The edge
-  parameters:
-  \describe{
-    \item{color}{The color of the edges, see the \code{color} vertex
-      parameter for the possible values.
-
-      By default this parameter is \code{darkgrey}.
-    }
-    \item{width}{The width of the edges.
-
-      The default value is 1.
-    }
-    \item{arrow.size}{The size of the arrows. Currently this is a
-      constant, so it is the same for every edge. If a vector is
-      submitted then only the first element is used, ie. if this is
-      taken from an edge attribute then only the attribute of the first
-      edge is used for all arrows. This will likely change in the future.
-
-      The default value is 1.
-    }
-    \item{arrow.width}{The width of the arrows. Currently this is a
-      constant, so it is the same for every edge. If a vector is
-      submitted then only the first element is used, ie. if this is
-      taken from an edge attribute then only the attribute of the first
-      edge is used for all arrows. This will likely change in the future.
-
-      This argument is currently only used by \code{\link{plot.igraph}}.
-      
-      The default value is 1, which gives the same width as before
-      this option appeared in igraph.
-    }
-    \item{lty}{The line type for the edges. Almost the same format is
-      accepted as for the standard graphics \code{\link[graphics]{par}},
-      0 and \dQuote{blank} mean no edges, 1 and \dQuote{solid} are for
-      solid lines, the other possible values are: 2 (\dQuote{dashed}),
-      3 (\dQuote{dotted}), 4 (\dQuote{dotdash}), 5 (\dQuote{longdash}),
-      6 (\dQuote{twodash}).
-
-      \code{\link{tkplot}} also accepts standard Tk line type strings,
-      it does not however support \dQuote{blank} lines, instead of type
-      \sQuote{0} type \sQuote{1}, ie. solid lines will be drawn.
-      
-      This argument is ignored for \code{\link{rglplot}}.
-
-      The default value is type 1, a solid line.
-    }
-    \item{label}{The edge labels. They will be converted to
-      character. Specify \code{NA} to omit edge labels.
-
-      Edge labels are omitted by default.}
-    \item{label.family}{Font family of the edge labels. See the vertex
-      parameter with the same name for the details.}
-    \item{label.font}{The font for the edge labels. See the
-      corresponding vertex parameter discussed earlier for details.}
-    \item{label.cex}{The font size for the edge labels, see the
-      corresponding vertex parameter for details.}
-    \item{label.color}{The color of the edge labels, see the
-      \code{color} vertex parameters on how to specify colors. }
-    \item{curved}{Specifies whether to draw curved edges, or not. This
-      can be a logical or a numeric vector or scalar. 
-
-      First the vector is replicated to have the same length as the
-      number of edges in the graph. Then it is interpreted for each edge
-      separately. A numeric value specifies the curvature of the edge;
-      zero curvature means straight edges, negative values means the
-      edge bends clockwise, positive values the opposite. \code{TRUE}
-      means curvature 0.5, \code{FALSE} means curvature zero.
-
-      By default the vector specifying the curvatire is calculated via a
-      call to the \code{\link{autocurve.edges}} function. This function makes
-      sure that multiple edges are curved and are all visible. This
-      parameter is ignored for loop edges. 
-      
-      The default value is \code{FALSE}.
-      
-      This parameter is currently ignored by \code{\link{rglplot}}.}
-    \item{arrow.mode}{This parameter can be used to specify for which
-      edges should arrows be drawn. If this parameter is given by the
-      user (in either of the three ways) then it specifies which edges
-      will have forward, backward arrows, or both, or no arrows at all.
-      As usual, this parameter can be a vector or a scalar value.
-      It can be an integer or character type. If it is integer then 0
-      means no arrows, 1 means backward arrows, 2 is for forward arrows
-      and 3 for both. If it is a character vector then \dQuote{<} and
-      \dQuote{<-} specify backward, \dQuote{>} and \dQuote{->} forward
-      arrows and \dQuote{<>} and \dQuote{<->} stands for both arrows.
-      All other values mean no arrows, perhaps you should use \dQuote{-}
-      or \dQuote{--} to specify no arrows.
-
-      Hint: this parameter can be used as a \sQuote{cheap} solution for
-      drawing \dQuote{mixed} graphs: graphs in which some edges are
-      directed some are not. If you want do this, then please create a
-      \emph{directed} graph, because as of version 0.4 the vertex pairs
-      in the edge lists can be swapped in undirected graphs.
-
-      By default, no arrows will be drawn for undirected graphs, and for 
-      directed graphs, an arrow will be drawn for each edge, according
-      to its direction. This is not very surprising, it is the expected
-      behavior.
-    }
-    \item{loop.angle}{Gives the angle in radian for plotting loop
-      edges. See the \code{label.dist} vertex parameter to see how this
-      is interpreted.
-
-      The default value is 0.
-    }    
-    \item{loop.angle2}{Gives the second angle in radian for plotting
-      loop edges. This is only used in 3D, \code{loop.angle} is enough
-      in 2D.
-
-      The default value is 0.
-    }
-  }
-
-  Other parameters:
-  \describe{
-    \item{layout}{
-      Either a function or a numeric
-      matrix. It specifies how the vertices will be placed on the plot.
-      
-      If it is a numeric matrix, then the matrix has to have one line for
-      each vertex, specifying its coordinates. The matrix should have at
-      least two columns, for the \code{x} and \code{y} coordinates, and
-      it can also have third column, this will be the \code{z}
-      coordinate for 3D plots and it is ignored for 2D plots.
-
-      If a two column matrix is given for the 3D plotting function
-      \code{\link{rglplot}} then the third column is assumed to be 1 for
-      each vertex.
-
-      If \code{layout} is a function, this function will be called with the
-      \code{graph} as the single parameter to determine the
-      actual coordinates. The function should return a matrix with two
-      or three columns. For the 2D plots the third column is ignored.
-
-      The default value is \code{layout.random}, ie. a function
-      returning with 2D random placement.}
-    \item{margin}{The amount of empty space below, over, at the left and
-      right of the plot, it is a numeric vector of length four. Usually
-      values between 0 and 0.5 are meaningful, but negative values are
-      also possible, that will make the plot zoom in to a part of the
-      graph. If it is shorter than four then it is recycled.
-
-      \code{\link{rglplot}} does not support this parameter, as it can
-      zoom in and out the graph in a more flexible way.
-      
-      Its default value is 0.
-    }
-    \item{rescale}{Logical constant, whether to rescale the coordinates
-      to the [-1,1]x[-1,1](x[-1,1]) interval. This parameter is not
-      implemented for \code{tkplot}.
-
-      Defaults to \code{TRUE}, the layout will be rescaled.
-    }
-    \item{asp}{A numeric constant, it gives the \code{asp} parameter
-      for \code{\link{plot}}, the aspect ratio. Supply 0 here if you
-      don't want to give an aspect ratio. It is ignored by \code{tkplot}
-      and \code{rglplot}.
-
-      Defaults to 1.
-    }
-    \item{frame}{Boolean, whether to plot a frame around the graph. It
-      is ignored by \code{tkplot} and \code{rglplot}.
-
-      Defaults to \code{FALSE}.
-    }
-  }
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{plot.igraph}}, \code{\link{tkplot}},
-  \code{\link{rglplot}}, \code{\link{igraph.options}}}
-\examples{
-\dontrun{
-
-# plotting a simple ring graph, all default parameters, except the layout
-g <- graph.ring(10)
-g$layout <- layout.circle
-plot(g)
-tkplot(g)
-rglplot(g)
-
-# plotting a random graph, set the parameters in the command arguments
-g <- barabasi.game(100)
-plot(g, layout=layout.fruchterman.reingold, vertex.size=4,
-     vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5)
-
-# plot a random graph, different color for each component
-g <- erdos.renyi.game(100, 1/100)
-comps <- clusters(g)$membership
-colbar <- rainbow(max(comps)+1)
-V(g)$color <- colbar[comps+1]
-plot(g, layout=layout.fruchterman.reingold, vertex.size=5, vertex.label=NA)
-
-# plot communities in a graph
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(0,5, 0,10, 5,10))
-com <- spinglass.community(g, spins=5)
-V(g)$color <- com$membership+1
-g <- set.graph.attribute(g, "layout", layout.kamada.kawai(g))
-plot(g, vertex.label.dist=1.5)
-
-# draw a bunch of trees, fix layout
-igraph.options(plot.layout=layout.reingold.tilford)
-plot(graph.tree(20, 2))
-plot(graph.tree(50, 3), vertex.size=3, vertex.label=NA)
-tkplot(graph.tree(50, 2, mode="undirected"), vertex.size=10,
-vertex.color="green")
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/plot.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/plot.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/plot.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/plot.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,69 +0,0 @@
-\name{plot.igraph}
-\alias{plot.igraph}
-\concept{Visualization}
-\title{Plotting of graphs}
-\description{\code{plot.graph} is able to plot graphs to any R
-  device. It is the non-interactive companion of the \code{tkplot}
-  function.}
-\usage{
-\S3method{plot}{igraph}(x, axes=FALSE, xlab="", ylab="", add=FALSE,
-      xlim=c(-1,1), ylim=c(-1,1), main="", sub="",
-      mark.groups=list(), mark.shape=1/2, 
-      mark.col=rainbow(length(mark.groups), alpha=0.3),
-      mark.border=rainbow(length(mark.groups), alpha=1),
-      mark.expand=15, \dots)
-}
-\arguments{
-  \item{x}{The graph to plot.}
-  \item{axes}{Logical, whether to plot axes, defaults to FALSE.}
-  \item{xlab}{The label of the horizontal axis. Defaults to the empty string.}
-  \item{ylab}{The label of the vertical axis. Defaults to the empty
-    string.}
-  \item{add}{Logical scalar, whether to add the plot to the current
-    device, or delete the device's current contents first.}
-  \item{xlim}{The limits for the horizontal axis, it is unlikely that
-    you want to modify this.}
-  \item{ylim}{The limits for the vertical axis, it is unlikely that you
-    want to modify this.}
-  \item{main}{Main title.}
-  \item{sub}{Subtitle.}
-  \item{mark.groups}{A list of vertex id vectors. It is interpreted as a
-    set of vertex groups. Each vertex group is highlighted, by plotting
-    a colored smoothed polygon around and \dQuote{under} it. See the
-    arguments below to control the look of the polygons.}
-  \item{mark.shape}{A numeric scalar or vector. Controls the smoothness
-    of the vertex group marking polygons. This is basically the \sQuote{shape}
-    parameter of the \code{\link[graphics]{xspline}} function, its
-    possible values are between -1 and 1. If it is a vector, then a
-    different value is used for the different vertex groups.}
-  \item{mark.col}{A scalar or vector giving the colors of marking the
-    polygons, in any format accepted by
-    \code{\link[graphics]{xspline}}; e.g. numeric color ids, symbolic
-    color names, or colors in RGB.}
-  \item{mark.border}{A scalar or vector giving the colors of the borders
-    of the vertex group marking polygons. If it is \code{NA}, then no
-    border is drawn.}
-  \item{mark.expand}{A numeric scalar or vector, the size of the border
-    around the marked vertex groups. It is in the same units as the vertex
-    sizes. If a vector is given, then different values are used for the
-    different vertex groups.} 
-  \item{\dots}{Additional plotting parameters. See
-    \link{igraph.plotting} for the complete list.}
-}
-\details{
-  One convenient way to plot graphs is to plot with \code{\link{tkplot}}
-  first, handtune the placement of the vertices, query the coordinates
-  by the \code{\link{tkplot.getcoords}} function and use them with
-  \code{plot} to plot the graph to any R device.}
-\value{Returns \code{NULL}, invisibly.}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{layout}} for different layouts,
-  \code{\link{igraph.plotting}} for the detailed description of the
-  plotting parameters and \code{\link{tkplot}} and \code{\link{rglplot}}
-  for other graph plotting functions. }
-\examples{
-g <- graph.ring(10)
-\dontrun{plot(g, layout=layout.kamada.kawai, vertex.color="green")}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/power.law.fit.Rd igraph-0.6.5/interfaces/R/igraph/man/power.law.fit.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/power.law.fit.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/power.law.fit.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,116 +0,0 @@
-\name{power.law.fit}
-\alias{power.law.fit}
-\concept{Power-law}
-\title{Fitting a power-law distribution function to discrete data}
-\description{\code{power.law.fit} fits a power-law distribution to a
-  data set.}
-\usage{
-power.law.fit(x, xmin=NULL, start=2, force.continuous=FALSE,
-              implementation=c("plfit", "R.mle"), \dots)
-}
-\arguments{
-  \item{x}{The data to fit, a numeric vector. For implementation
-    \sQuote{\code{R.mle}} the data must be integer values. For the
-    \sQuote{\code{plfit}} implementation non-integer values might be
-    present and then a continuous power-law distribution is fitted.}
-  \item{xmin}{Numeric scalar, or \code{NULL}. The lower bound for
-    fitting the power-law. If \code{NULL}, the smallest value in
-    \code{x} will be used for the \sQuote{\code{R.mle}} implementation,
-    and its value will be automatically determined for the
-    \sQuote{\code{plfit}} implementation. This argument makes it
-    possible to fit only the tail of the distribution. }
-  \item{start}{Numeric scalar. The initial value of the exponent for the
-    minimizing function, for the \sQuote{\code{R.mle}}
-    implementation. Ususally it is safe to leave this untouched.}
-  \item{force.continuous}{Logical scalar. Whether to force a continuous
-    distribution for the \sQuote{\code{plfit}} implementation, even if
-    the sample vector contains integer values only (by chance). If this
-    argument is false, igraph will assume a continuous distribution if
-    at least one sample is non-integer and assume a discrete
-    distribution otherwise.} 
-  \item{implementation}{Character scalar. Which implementation to
-    use. See details below.}
-  \item{\dots}{Additional arguments, passed to the maximum likelihood
-    optimizing function, \code{\link[stats4]{mle}}, if the
-    \sQuote{\code{R.mle}} implementation is chosen. It is ignored by the
-    \sQuote{\code{plfit}} implementation.}
-}
-\details{
-  This function fits a power-law distribution to a vector containing
-  samples from a distribution (that is assumed to follow a power-law of
-  course). In a power-law distribution, it is generally assumed that
-  \eqn{P(X=x)} is proportional to \eqn{x^{-alpha}}{x^-alpha}, where
-  \eqn{x} is a positive number and \eqn{\alpha}{alpha} is greater than
-  1. In many real-world cases, the power-law behaviour kicks in only
-  above a threshold value \eqn{x_{min}}{xmin}. The goal of this function
-  is to determine \eqn{\alpha}{alpha} if \eqn{x_{min}}{xmin} is given,
-  or to determine \eqn{x_{min}}{xmin} and the corresponding value of
-  \eqn{\alpha}{alpha}.
-
-  \code{power.law.fit} provides two maximum likelihood implementations.
-  If the \code{implementation} argument is \sQuote{\code{R.mle}}, then
-  the BFGS optimization (see \link[stats4]{mle}) algorithm is applied.
-  The additional arguments are passed to the mle function, so it is
-  possible to change the optimization method and/or its parameters.
-  This implementation can \emph{not} to fit the \eqn{x_{min}}{xmin}
-  argument, so use the \sQuote{\code{plfit}} implementation if you want
-  to do that.
-
-  The \sQuote{\code{plfit}} implementation also uses the maximum
-  likelihood principle to determine \eqn{\alpha}{alpha} for a given
-  \eqn{x_{min}}{xmin}; When \eqn{x_{min}}{xmin} is not given in advance,
-  the algorithm will attempt to find itsoptimal value for which the
-  \eqn{p}-value of a Kolmogorov-Smirnov test between the fitted
-  distribution and the original sample is the largest. The function uses
-  the method of Clauset, Shalizi and Newman to calculate the parameters
-  of the fitted distribution. See references below for the details.   
-}
-\value{
-  Depends on the \code{implementation} argument. If it is
-  \sQuote{\code{R.mle}}, then an object with class
-  \sQuote{\code{mle}}. It can be used to 
-  calculate confidence intervals and log-likelihood. See
-  \code{\link[stats4]{mle-class}} for details.
-
-  If \code{implementation} is \sQuote{\code{plfit}}, then the result is
-  a named list with entries:
-  \item{continuous}{Logical scalar, whether the fitted power-law
-  distribution was continuous or discrete.}
-  \item{alpha}{Numeric scalar, the exponent of the fitted power-law
-  distribution.}
-  \item{xmin}{Numeric scalar, the minimum value from which the power-law
-    distribution was fitted. In other words, only the values larger than
-    \code{xmin} were used from the input vector.}
-  \item{logLik}{Numeric scalar, the log-likelihood of the fitted
-    parameters.}
-  \item{KS.stat}{Numeric scalar, the test statistic of a
-    Kolmogorov-Smirnov test that compares the fitted distribution with
-    the input vector. Smaller scores denote better fit.}
-  \item{KS.p}{Numeric scalar, the p-value of the Kolmogorov-Smirnov
-    test. Small p-values (less than 0.05) indicate that the test
-    rejected the hypothesis that the original data could have been drawn
-    from the fitted power-law distribution.}
-}
-\references{
-  Power laws, Pareto distributions and Zipf's law,
-  M. E. J. Newman, \emph{Contemporary Physics}, 46, 323-351, 2005.
-
-  Aaron Clauset, Cosma R .Shalizi and Mark E.J. Newman: Power-law
-  distributions in empirical data. SIAM Review 51(4):661-703, 2009.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link[stats4]{mle}}}
-\examples{
-# This should approximately yield the correct exponent 3
-g <- barabasi.game(1000) # increase this number to have a better estimate
-d <- degree(g, mode="in")
-fit1 <- power.law.fit(d+1, 10)
-fit2 <- power.law.fit(d+1, 10, implementation="R.mle")
-
-fit1$alpha
-coef(fit2)
-fit1$logLik
-logLik(fit2)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/preference.game.Rd igraph-0.6.5/interfaces/R/igraph/man/preference.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/preference.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/preference.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-\name{preference.game}
-\alias{preference.game}
-\alias{asymmetric.preference.game}
-\title{Trait-based random generation}
-\description{Generation of random graphs based on different vertex types.}
-\usage{
-preference.game(nodes, types, type.dist=rep(1, types), fixed.sizes=FALSE,
-    pref.matrix=matrix(1, types, types), directed=FALSE, loops=FALSE)
-asymmetric.preference.game(nodes, types,
-    type.dist.matrix=matrix(1,types,types),
-    pref.matrix = matrix(1, types, types), loops=FALSE)
-}
-\arguments{
-  \item{nodes}{The number of vertices in the graphs.}
-  \item{types}{The number of different vertex types.}
-  \item{type.dist}{The distribution of the vertex types, a numeric
-    vector of length \sQuote{types} containing non-negative numbers. The
-    vector will be normed to obtain probabilities.}
-  \item{fixed.sizes}{Fix the number of vertices with a given
-    vertex type label. The \code{type.dist} argument gives the group
-    sizes (i.e. number of vertices with the different labels) in this
-    case.}
-  \item{type.dist.matrix}{The joint distribution of the in- and
-    out-vertex types.}
-  \item{pref.matrix}{A square matrix giving the preferences of the
-    vertex types. The matrix has \sQuote{types} rows and columns.}
-  \item{directed}{Logical constant, whether to create a directed graph.}
-  \item{loops}{Logical constant, whether self-loops are allowed in the
-    graph.}
-}
-\details{
-  Both models generate random graphs with given vertex types. For
-  \code{preference.game} the probability that two vertices will be
-  connected depends on their type and is given by the
-  \sQuote{pref.matrix} argument. This matrix should be symmetric to make
-  sense but this is not checked. The distribution of the different
-  vertes types is given by the \sQuote{type.dist} vector.
-
-  For \code{asymmetric.preference.game} each vertex has an in-type and
-  an out-type and a directed graph is created. The probability that a
-  directed edge is realized from a vertex with a given out-type to a
-  vertex with a given in-type is given in the \sQuote{pref.matrix}
-  argument, which can be asymmetric. The joint distribution for the in-
-  and out-types is given in the \sQuote{type.dist.matrix} argument.
-}
-\value{An igraph graph.}
-%\references{}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R interface} 
-\examples{
-pf <- matrix( c(1, 0, 0, 1), nr=2)
-g <- preference.game(20, 2, pref.matrix=pf)
-\dontrun{tkplot(g, layout=layout.fruchterman.reingold)}
-
-pf <- matrix( c(0, 1, 0, 0), nr=2)
-g <- asymmetric.preference.game(20, 2, pref.matrix=pf)
-\dontrun{tkplot(g, layout=layout.circle)}
-}
-\seealso{\code{\link{establishment.game}}.
-  \code{\link{callaway.traits.game}}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/print.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/print.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/print.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/print.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,79 +0,0 @@
-\name{print.igraph}
-\alias{print.igraph}
-\alias{str.igraph}
-\alias{summary.igraph}
-\title{Print graphs to the terminal}
-\description{These functions attempt to print a graph to the terminal in
-  a human readable form.}
-\usage{
-\method{print}{igraph}(x, full=getIgraphOpt("print.full"),
-  graph.attributes=getIgraphOpt("print.graph.attributes"),
-  vertex.attributes=getIgraphOpt("print.vertex.attributes"),
-  edge.attributes=getIgraphOpt("print.edge.attributes"),
-  names=TRUE, \dots)
-\method{summary}{igraph}(object, \dots)
-\method{str}{igraph}(object, \dots)
-}
-\arguments{
-  \item{x}{The graph to print.}
-  \item{full}{Logical scalar, whether to print the graph structure
-    itself as well.}
-  \item{graph.attributes}{Logical constant, whether to print graph attributes.}
-  \item{vertex.attributes}{Logical constant, whether to print vertex attributes.}
-  \item{edge.attributes}{Logical constant, whether to print edge
-    attributes.}
-  \item{names}{Logical constant, whether to print symbolic vertex names
-    (ie. the \code{name} vertex attribute) or vertex ids.}
-  \item{object}{The graph of which the summary will be printed.}
-  \item{\dots}{Additional agruments.}
-}
-\details{
-  \code{summary.igraph} prints the number of vertices, edges and whether the
-  graph is directed.
-
-  \code{str.igraph} prints the same information, and also lists
-  the edges, and optionally graph, vertex and/or edge attributes.
-
-  \code{print.igraph} behaves either as \code{summary.igraph} or
-  \code{str.igraph} depending on the \code{full} argument. See also the
-  \sQuote{print.full} igraph option and \code{\link{getIgraphOpt}}.
-
-  The graph summary printed by \code{summary.igraph} (and
-  \code{print.igraph} and \code{str.igraph}) consists one or more
-  lines. The first line contains the basic properties of the graph, and
-  the rest contains its attributes. Here is an example, a small star
-  graph with weighed directed edges and named vertices: \preformatted{    IGRAPH DNW- 10 9 -- In-star
-    + attr: name (g/c), mode (g/c), center (g/n), name (v/c),
-      weight (e/n) }
-  The first line always starts with \code{IGRAPH}, showing you that the
-  object is an igraph graph. Then a four letter long code string is
-  printed. The first letter distinguishes between directed
-  (\sQuote{\code{D}}) and undirected (\sQuote{\code{U}}) graphs. The
-  second letter is \sQuote{\code{N}} for named graphs, i.e. graphs with
-  the \code{name} vertex attribute set. The third letter is
-  \sQuote{\code{W}} for weighted graphs, i.e. graphs with the
-  \code{weight} edge attribute set. The fourth letter is
-  \sQuote{\code{B}} for bipartite graphs, i.e. for graphs with the
-  \code{type} vertex attribute set.
-
-  Then, after two dashes, the name of the graph is printed, if it has
-  one, i.e. if the \code{name} graph attribute is set.
-
-  From the second line, the attributes of the graph are listed,
-  separated by a comma. After the attribute names, the kind of the
-  attribute -- graph, vertex or edge -- is denoted, and the type of the
-  attribute as well, character, numeric, or other (\sQuote{\code{x}}).  
-  
-  As of igraph 0.4 \code{str.igraph} (and \code{print.igraph}) uses the
-  \code{max.print} option, see \code{\link[base]{options}} for details.
-}
-\value{All these functions return the graph invisibly.}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-\examples{
-g <- graph.ring(10)
-g
-summary(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/read.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/read.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/read.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/read.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,341 +0,0 @@
-\name{read.graph}
-\alias{read.graph}
-\alias{LGL}
-\alias{Pajek}
-\alias{GraphML}
-\alias{GML}
-\alias{DL}
-\alias{UCINET}
-\title{Reading foreign file formats}
-\description{The \code{read.graph} function is able to read graphs in
-  various representations from a file, or from a http
-  connection. Currently some simple formats are supported.}
-\usage{
-read.graph(file, format = c("edgelist", "pajek", "ncol", "lgl",
-        "graphml", "dimacs", "graphdb", "gml", "dl"), \dots)
-}
-\arguments{
-  \item{file}{The connection to read from. This can be a local file, or
-    a \code{http} or \code{ftp} connection. It can also be a character
-    string  with the file name or URI.}
-  \item{format}{Character constant giving the file format. Right now
-    \code{edgelist}, \code{pajek}, \code{graphml}, \code{gml},
-    \code{ncol}, \code{lgl}, \code{dimacs} and \code{graphdb}
-    are supported, the default is \code{edgelist}. As of igraph 0.4 this
-    argument is case insensitive.
-  }
-  \item{\dots}{Additional arguments, see below.}
-}
-\details{
-  The \code{read.graph} function may have additional arguments depending
-  on the file format (the \code{format} argument). See the details
-  separately for each file format, below.
-}
-\section{Edge list format}{
-      This format is a simple text file with numeric vertex ids defining
-      the edges. There is no need to have newline characters between the
-      edges, a simple space will also do.
-      
-      Additional arguments:
-      \describe{
-	\item{n}{The number of vertices in the graph. If it is smaller
-	  than or equal to the largest integer in the file, then it is
-	  ignored; so it is safe to set it to zero (the default).}
-	\item{directed}{Logical scalar, whether to create a directed
-	  graph. The default value is \code{TRUE}.}
-      }
-}
-\section{Pajek format}{
-      Pajek it a popular network analysis program for Windows. (See the
-      Pajek homepage at
-      \url{http://vlado.fmf.uni-lj.si/pub/networks/pajek/}.)
-      It has a quite flexible but not very well
-      documented file format, see the Pajek manual on the Pajek homepage
-      for some information about the file format.
-
-      \code{igraph} implements only a subset of the Pajek format:
-      \itemize{
-	\item Only .net files are supported, Pajek project files (which
-	  can contain many graph and also other type of data) are
-	  not. Poject files might be supported in a forthcoming igraph
-	  release if they turned out to be needed.
-	\item Time events networks are not supported.
-	\item Hypergraphs (graphs with non-binary edges) are not
-	  supported as igraph cannot handle them.
-	\item Graphs containing both directed and undirected edges are
-	  not supported as igraph cannot represent them.
-	\item Graph with multiple edge sets are not supported.
-      }
-
-      From version 0.6.1 igraph supports reading bipartite (two-mode)
-      graphs from Pajek files and adds the \code{type} vertex
-      attribute. A warning is given if invalid edges (edges connecting
-      vertices of the same type) are present in the file.
-      
-      Vertex and edge attributes defined in the Pajek file will be also
-      read and assigned to the graph object to be created. These are
-      mainly parameters for graph visualization, but not exclusively,
-      eg. the file might contain edge weights as well.
-
-      The following vertex attributes might be added:
-      \tabular{ll}{
-	igraph name \tab description, Pajek attribute \cr
-	id 	    \tab Vertex id \cr
-	x, y, z     \tab The \sQuote{x}, \sQuote{y} and \sQuote{z} coordinate of the vertex \cr
-	vertexsize  \tab The size of the vertex when plotted (\code{size} in Pajek). \cr
-	shape 	    \tab The shape of the vertex when plotted. \cr
-	color 	    \tab Vertex color (\code{ic} in Pajek) if given with symbolic name \cr
-	framecolor  \tab Border color (\code{bc} in Pajek) if given with symbolic name \cr
-	labelcolor  \tab Label color (\code{lc} in Pajek) if given with symbolic name \cr
-	xfact, yfact \tab The \code{x_fact} and \code{y_fact} Pajek attributes. \cr
-	labeldist \tab The distance of the label from the vertex. (\code{lr} in Pajek.) \cr
-	labeldegree, \tab \cr
-	labeldegree2 \tab The \code{la} and \code{lphi} Pajek attributes \cr
-	framewidth \tab The width of the border (\code{bw} in Pajek). \cr
-	fontsize  \tab Size of the label font (\code{fos} in Pajek.) \cr
-	rotation \tab The rotation of the vertex (\code{phi} in Pajek). \cr
-	radius \tab Radius, for some vertex shapes (\code{r} in Pajek). \cr
-	diamondratio \tab For the diamond shape (\code{q} in Pajek). \cr
-	type \tab vertex types in bipartite (two-mode) graphs. \cr
-      }
-
-      These igraph attributes are only created if there is at least one vertex
-      in the Pajek file which has the corresponding associated
-      information. Eg. if there are vertex coordinates for at least one vertex
-      then the \sQuote{x}, \sQuote{y} and possibly also \sQuote{z}
-      vertex attributes will be created. For those vertices for which the
-      attribute is not defined, \code{NaN} is assigned. 
-      
-      The following edge attributes might be added:
-      \tabular{ll}{
-	igraph name \tab description, Pajek attribute \cr
-	weight 	\tab Edge weights. \cr
-	label 	\tab \code{l} in Pajek. \cr
-	color 	\tab Edge color, if the color is given with a symbolic name, \code{c} in Pajek. \cr
-	color-red, \tab \cr
-	color-green, \tab \cr
-	color-blue \tab Edge color if it was given in RGB notation, \code{c} in Pajek. \cr
-	edgewidth \tab \code{w} in Pajek. \cr
-	arrowsize \tab \code{s} in Pajek. \cr
-	hook1, hook2 \tab \code{h1} and \code{h2} in Pajek. \cr
-	angle1, angle2 \tab \code{a1} and \code{a2} in Pajek, Bezier curve parameters. \cr
-	velocity1, \tab \cr
-	velocity2 \tab \code{k1} and \code{k2} in Pajek, Bezier curve parameter. \cr
-	arrowpos \tab \code{ap} in Pajek. \cr
-	labelpos \tab \code{lp} in Pajek. \cr
-	labelangle, \tab \cr
-	labelangle2 \tab \code{lr} and \code{lphi} in Pajek. \cr
-	labeldegree \tab \code{la} in Pajek. \cr
-	fontsize \tab \code{fos} in Pajek. \cr
-	arrowtype \tab \code{a} in Pajek. \cr
-	linepattern \tab \code{p} in Pajek. \cr
-	labelcolor \tab \code{lc} in Pajek. \cr
-      }
-      
-      There are no additional arguments for this format.
-}
-\section{GraphML file format}{
-      GraphML is an XML-based file format (an XML application in the XML
-      terminology) to describe graphs. It is a modern format, and can
-      store graphs with an extensible set of vertex and edge attributes,
-      and generalized graphs which igraph cannot handle. Thus igraph
-      supports only a subset of the GraphML language: 
-      \itemize{
-	\item Hypergraphs are not supported.
-	\item Nested graphs are not supported.
-	\item Mixed graphs, ie. graphs with both directed and
-	  undirected edges are not supported. read.graph() sets the
-	  graph directed if this is the default in the GraphML file,
-	  even if all the edges are in fact undirected.
-      }
-
-      See the GraphML homepage at
-      \url{http://graphml.graphdrawing.org} for more information about
-      the GraphML format.       
-      
-      Additional arguments:
-      \describe{
-	\item{index}{If the GraphML file contains more than one graphs,
-	  this argument can be used to select the graph to read. By
-	  default the first graph is read (index 0).}
-      }
-}
-\section{GML file format}{
-      GML is a simple textual format, see
-      \url{http://www.infosun.fim.uni-passau.de/Graphlet/GML/} for details.
- 
-      Although all syntactically correct GML can be parsed, 
-      we implement only a subset of this format, some attributes might be
-      ignored. Here is a list of all the differences:
-      \itemize{
-	\item Only \code{node} and \code{edge} attributes are 
-	  used, and only if they have a simple type: integer, real or
-	  string. So if an attribute is an array or a record, then it is 
-	  ignored. This is also true if only some values of the
-	  attribute are complex.
-	\item Top level attributes except for \code{Version} and the
-	  first \code{graph} attribute are completely ignored.
-	\item Graph attributes except for \code{node} and
-	  \code{edge} are completely ignored.
-	\item There is no maximum line length.
-	\item There is no maximum keyword length.
-	\item Character entities in strings are not interpreted.
-	\item We allow \code{inf} (infinity) and \code{nan}
-	  (not a number) as a real number. This is case insensitive, so
-	  \code{nan}, \code{NaN} and \code{NAN} are equal.
-      }
-      
-      Please contact us if you cannot live with these
-      limitations of the GML parser.
-
-      There are not additional argument for this format.
-}
-\section{DL file format}{
-      The DL format is a simple textual file format used by the UCINET
-      software. See
-      \url{http://www.analytictech.com/networks/dataentry.htm} for
-      examples. All formats mentioned here is supported by igraph.
-
-      Note the specification does not mention whether the
-      format is case sensitive or not. For igraph DL files are case
-      sensitive, i.e. \sQuote{Larry} and \sQuote{larry} are not the
-      same.
-      
-      Additional arguments:
-      \describe{
-	\item{directed}{Logical scalar, whether to create a directed
-	  graph. The default is to make the graph directed.}
-      }
-}
-\section{NCOL format}{
-      This format is used by the Large Graph Layout program
-      (\url{http://bioinformatics.icmb.utexas.edu/lgl}), and it is
-      simply a symbolic weighted edge list. It is a simple text file
-      with one edge per line. An edge is defined by two symbolic vertex
-      names separated by whitespace. (The symbolic vertex names
-      themselves cannot contain whitespace.) They might followed by an
-      optional number, this will be the weight of the edge; the number
-      can be negative and can be in scientific notation. If there is no
-      weight specified to an edge it is assumed to be zero. 
-
-      The resulting graph is always undirected. LGL cannot deal with
-      files which contain multiple or loop edges, this is however not
-      checked here, as igraph is happy with these.
-
-      Additional arguments:
-      \describe{
-	\item{names}{Logical constant, whether to add the symbolic names
-	  as vertex attributes to the graph. If TRUE the name of the
-	  vertex attribute will be \sQuote{name}.}
-	\item{weights}{Character scalar, specifies whether edge weights
-	  should be added to the graph. Possible values are and their
-	  meaning are: \sQuote{no}, edge weights will not be added;
-	  \sQuote{yes}, edge weights will be added, if they are not
-	  present in the file, then all edges get zero weight;
-	  \sQuote{auto}, edge weights will added if they are present in
-	  the file, otherwise not. The default is \sQuote{auto}.
-	}
-	\item{directed}{Logical constant, whether to create a directed
-	  graph. The default is undirected.} 
-      }
-}
-\section{LGL file format}{
-      The \code{lgl} format is used by the Large Graph Layout
-      visualization software
-      (\url{http://bioinformatics.icmb.utexas.edu/lgl}), it can describe
-      undirected optionally weighted graphs. From the LGL manual:
-      \dQuote{The second format is the LGL file format (.lgl file
-      suffix). This is yet another graph file format that tries to be
-      as stingy as possible with space, yet keeping the edge file in a
-      human readable (not binary) format. The format itself is like
-      the following: \preformatted{	 # vertex1name 
-	vertex2name [optionalWeight]
-	vertex3name [optionalWeight]
-      } Here, the first vertex of an edge is preceded with a pound sign
-      '\#'.  Then each vertex that shares an edge with that vertex is
-      listed one per line on subsequent lines.}
-      
-      LGL cannot handle loop and multiple edges or directed graphs, but
-      in igraph it is not an error to have multiple and loop edges.
-      
-      Additional arguments:
-      \describe{
-	\item{names}{Logical constant, whether to add the symbolic names
-	  as vertex attributes to the graph. If TRUE the name of the
-	  vertex attribute will be \sQuote{name}.}
-	\item{weights}{Character scalar, specifies whether edge weights
-	  should be added to the graph. Possible values are and their
-	  meaning are: \sQuote{no}, edge weights will not be added;
-	  \sQuote{yes}, edge weights will be added, if they are not
-	  present in the file, then all edges get zero weight;
-	  \sQuote{auto}, edge weights will added if they are present in
-	  the file, otherwise not. The default is \sQuote{auto}.
-	}
-      }      
-}
-\section{DIMACS file format}{
-      The DIMACS file format, more specifically the 
-      version for network flow problems, see the files at
-      \url{ftp://dimacs.rutgers.edu/pub/netflow/general-info/}
-
-      This is a line-oriented text file (ASCII) format. The first
-      character of each line defines the type of the line. If the first
-      character is \code{c} the line is a comment line and it is
-      ignored. There is one problem line (\code{p}) in the file, it
-      must appear before any node and arc descriptor lines. The problem
-      line has three fields separated by spaces: the problem type
-      (\code{min}, \code{max} or \code{asn}), the
-      number of vertices and number of edges in the graph.
-      Exactly two node identification lines are expected
-      (\code{n}), one for the source, one for the target vertex.
-      These have two fields: the id of the vertex and the type of the
-      vertex, either \code{s} (=source) or \code{t}
-      (=target). Arc lines start with \code{a} and have three
-      fields: the source vertex, the target vertex and the edge capacity.
-      
-      Vertex ids are numbered from 1.
-
-      The source vertex is assigned to the \code{source}, the target
-      vertex to the \code{target} graph attribute. The edge capacities
-      are assigned to the \code{capacity} edge attribute.
-
-      Additional arguments:
-      \describe{
-	\item{directed}{Logical scalar, whether to create a directed
-	  graph. By default a directed graph is created.
-	}
-      }
-}
-\section{GraphDB format}{
-      This is a binary format, used in the graph database
-      for isomorphism testing (\url{http://amalfi.dis.unina.it/graph/})
-      From the graph database homepage
-      (\url{http://amalfi.dis.unina.it/graph/db/doc/graphdbat-2.html}):
-
-      \emph{The graphs are stored in a compact binary format, one graph per
-	file. The file is composed of 16 bit words, which are represented
-	using the so-called little-endian convention, i.e. the least
-	significant byte of the word is stored first.}
-      
-      \emph{Then, for each node, the file contains the list of edges coming
-	out of the node itself. The list is represented by a word encoding
-	its length, followed by a word for each edge, representing the
-	destination node of the edge. Node numeration is 0-based, so the
-	first node of the graph has index 0.}
-
-      See also \code{\link{graph.graphdb}}.
-      
-      Only unlabelled graphs are implemented.
-
-      Additional attributes:
-      \describe{
-	\item{directed}{Logical scalar. Whether to create a directed
-	  graph.}
-      }
-}
-\value{A graph object.}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{write.graph}} }
-% \examples{}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/reciprocity.Rd igraph-0.6.5/interfaces/R/igraph/man/reciprocity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/reciprocity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/reciprocity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,43 +0,0 @@
-\name{reciprocity}
-\alias{reciprocity}
-\concept{Reciprocity}
-\title{Reciprocity of graphs}
-\description{Calculates the reciprocity of a directed graph.}
-\usage{
-reciprocity(graph, ignore.loops = TRUE, mode = c("default", "ratio")) 
-}
-\arguments{
-  \item{graph}{The graph object.}
-  \item{ignore.loops}{Logical constant, whether to ignore loop edges.}
-  \item{mode}{See below.}
-}
-\details{
-The measure of reciprocity defines the proporsion of mutual
-connections, in a directed graph. It is most commonly defined as
-the probability that the opposite counterpart of a directed edge is
-also included in the graph. Or in adjacency matrix notation: 
-\eqn{\sum_{ij} (A\cdot A')_{ij}}{sum(i, j, (A.*A')ij) / sum(i, j, Aij)},
-where \eqn{A\cdot A'}{A.*A'} is the element-wise product of matrix
-\eqn{A} and its transpose. This measure is calculated if the \code{mode}
-argument is \code{default}.
-
-Prior to igraph version 0.6, another measure was implemented,
-defined as the probability of mutual connection between a vertex
-pair, if we know that there is a (possibly non-mutual) connection
-between them. In other words, (unordered) vertex pairs are
-classified into three groups: (1) not-connected, (2)
-non-reciprocaly connected, (3) reciprocally connected. 
-The result is the size of group (3), divided by the sum of group
-sizes (2)+(3). This measure is calculated if \code{mode} is
-\code{ratio}.
-}
-\value{A numeric scalar between zero and one.}
-% \references{}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- random.graph.game(20, 5/20, directed=TRUE)
-reciprocity(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/rewire.Rd igraph-0.6.5/interfaces/R/igraph/man/rewire.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/rewire.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/rewire.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-\name{rewire}
-\alias{rewire}
-\title{Graph rewiring}
-\description{Randomly rewires a graph while preserving the degree
-  distribution.}
-\usage{
-rewire(graph, mode = c("simple", "loops"), niter = 100) 
-}
-\arguments{
-  \item{graph}{The graph to be rewired.}
-  \item{mode}{The rewiring algorithm to be used. It can be one of the
-    following: \code{simple}: simple rewiring algorithm which
-    chooses two arbitrary edges in each step (namely (a,b) and (c,d))
-    and substitutes them with (a,d) and (c,b) if they don't yet exist,
-    avoiding the creation or destruction of loop edges or \code{loops}:
-    similar to \code{simple} but allows the creation and destruction of
-    loop edges.}
-  \item{niter}{Number of rewiring trials to perform.}
-}
-\details{
-This function generates a new graph based on the original one by
-randomly rewiring edges while preserving the original graph's degree
-distribution.
-}
-\value{A new graph object.}
-% \references{}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and
-  Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{degree.sequence.game}}}
-\examples{
-g <- graph.ring(20)
-g2 <- rewire(g, niter=3)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/rewire.edges.Rd igraph-0.6.5/interfaces/R/igraph/man/rewire.edges.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/rewire.edges.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/rewire.edges.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-\name{rewire.edges}
-\alias{rewire.edges}
-\title{Rewires the endpoints of the edges of a graph randomly}
-\description{This function rewires the endpoints of the edges with a
-  constant probability uniformly randomly to a new vertex in a graph. } 
-\usage{
-rewire.edges(graph, prob, loops=FALSE, multiple=FALSE)
-}
-\arguments{
-  \item{graph}{The input graph}
-  \item{prob}{The rewiring probability, a real number between zero and
-    one.}
-  \item{loops}{Logical scalar, whether loop edges are allowed in the
-    rewired graph.}
-  \item{multiple}{Logical scalar, whether multiple edges are allowed
-    int the generated graph.}
-}
-\details{
-  Note that this function might create graphs with multiple and/or loop
-  edges.
-}
-\value{A new graph object.}
-%\references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-\examples{
-# Some random shortcuts shorten the distances on a lattice
-g <- graph.lattice( length=100, dim=1, nei=5 )
-average.path.length(g)
-g <- rewire.edges( g, prob=0.05 )
-average.path.length(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/rglplot.Rd igraph-0.6.5/interfaces/R/igraph/man/rglplot.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/rglplot.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/rglplot.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-\name{rglplot}
-\alias{rglplot}
-\alias{rglplot.igraph}
-\concept{Visualization}
-\title{3D plotting of graphs with OpenGL}
-\description{Using the \code{rgl} package, \code{rglplot} plots a graph
-  in 3D. The plot can be zoomed, rotated, shifted, etc. but the
-  coordinates of the vertices is fixed.}
-\usage{
-rglplot(x, \dots)
-}
-\arguments{
-  \item{x}{The graph to plot.}
-  \item{\dots}{Additional arguments, see \code{\link{igraph.plotting}}
-    for the details}
-}
-\details{
-  Note that \code{rglplot} is considered to be highly experimental. It
-  is not very useful either. See \code{\link{igraph.plotting}} for the
-  possible arguments.
-}
-\value{\code{NULL}, invisibly.}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{igraph.plotting}},
-  \code{\link{plot.igraph}} for the 2D version,
-  \code{\link{tkplot}} for interactive graph drawing in 2D.}
-\examples{
-\dontrun{
-g <- graph.lattice( c(5,5,5) )
-coords <- layout.fruchterman.reingold(g, dim=3)
-rglplot(g, layout=coords)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/running.mean.Rd igraph-0.6.5/interfaces/R/igraph/man/running.mean.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/running.mean.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/running.mean.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-\name{running.mean}
-\alias{running.mean}
-\title{Running mean of a time series}
-\description{\code{running.mean} calculates the running mean in a vector
-  with the given bin width.}
-\usage{
-running.mean(v, binwidth)
-}
-\arguments{
-  \item{v}{The numeric vector.}
-  \item{binwidth}{Numeric constant, the size of the bin, should be
-    meaningful, ie. smaller than the length of \code{v}. }
-}
-\details{The running mean of \code{v} is a \code{w}
-  vector of length \code{length(v)-binwidth+1}. The first element of
-  \code{w} id the average of the first \code{binwidth} elements of
-  \code{v}, the second element of \code{w} is the average of elements
-  \code{2:(binwidth+1)}, etc.}
-\value{
-  A numeric vector of length \code{length(v)-binwidth+1}
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-running.mean(1:100, 10)
-}
-\keyword{manip}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg.Rd igraph-0.6.5/interfaces/R/igraph/man/scg.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/scg.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,213 +0,0 @@
-\name{scg}
-\alias{scg}
-\concept{Spectral coarse graining}
-\title{All-in-one Function for the SCG of Matrices and Graphs}
-\description{
-  This function handles all the steps involved in the Spectral Coarse
-  Graining (SCG) of some matrices and graphs as described in the
-  reference below.
-}
-\usage{
-scg(X, ev, nt, groups = NULL, mtype = c("symmetric", "laplacian",
-      "stochastic"), algo = c("optimum", "interv_km", "interv",
-      "exact_scg"), norm = c("row", "col"), direction = c("default",
-      "left", "right"), evec = NULL, p = NULL, use.arpack = FALSE,
-    maxiter = 300, sparse = getIgraphOpt("sparsematrices"), output =
-    c("default", "matrix", "graph"), semproj = FALSE, epairs = FALSE,
-    stat.prob = FALSE) 
-}
-\arguments{
-  \item{X}{The input graph or square matrix. Can be of class
-    \code{igraph}, \code{matrix} or \code{Matrix}.} 
-  \item{ev}{A vector of positive integers giving the indexes of the
-    eigenpairs to be preserved. For real eigenpairs, 1 designates the
-    eigenvalue with largest algebraic value, 2 the one with second
-    largest algebraic value, etc. In the complex case, it is the
-    magnitude that matters.}
-  \item{nt}{A vector of positive integers of length one or equal
-    to \code{length(ev)}. When \code{algo} = \dQuote{optimum},
-    \code{nt} contains the number of groups used to partition
-    each eigenvector separately. When \code{algo} is equal to
-    \dQuote{interv\_km} or \dQuote{interv}, \code{nt} contains
-    the number of intervals used to partition each eigenvector. The same
-    partition size or number of intervals is used for each eigenvector
-    if \code{nt} is a single integer. When \code{algo} =
-    \dQuote{exact\_cg} this parameter is ignored.}
-  \item{groups}{A vector of \code{nrow(X)} or \code{vcount(X)} integers
-    labeling each group vertex in the partition. If this parameter is
-    supplied most part of the function is bypassed.}
-  \item{mtype}{Character scalar. The type of semi-projector to be
-    used for the SCG. For now \dQuote{symmetric}, \dQuote{laplacian} and
-    \dQuote{stochastic} are available.}
-  \item{algo}{Character scalar. The algorithm used to solve the SCG
-    problem. Possible values are \dQuote{optimum}, \dQuote{interv\_km},
-    \dQuote{interv} and \dQuote{exact\_scg}.}
-  \item{norm}{Character scalar. Either \dQuote{row} or \dQuote{col}. If
-    set to \dQuote{row} the rows of the Laplacian matrix sum up to zero
-    and the rows of the stochastic matrix sum up to one; otherwise it is
-    the columns.}  
-  \item{direction}{Character scalar. When set to \dQuote{right},
-    resp. \dQuote{left}, the parameters \code{ev} and \code{evec} refer
-    to right, resp. left eigenvectors. When passed \dQuote{default} it
-    is the SCG described in the reference below that is applied (common
-    usage). This argument is currently not implemented, and right
-    eigenvectors are always used.}
-  \item{evec}{A numeric matrix of (eigen)vectors to be preserved by the
-    coarse graining (the vectors are to be stored column-wise in
-    \code{evec}). If supplied, the eigenvectors should correspond to the
-    indexes in \code{ev} as no cross-check will be done.}
-  \item{p}{A probability vector of length \code{nrow(X)} (or
-    \code{vcount(X)}). \code{p} is the stationary probability
-    distribution of a Markov chain when \code{mtype} =
-    \dQuote{stochastic}. This parameter is ignored in all other cases.}
- \item{use.arpack}{Logical scalar. When set to \code{TRUE} uses the
-   function \code{\link{arpack}} to compute
-   eigenpairs. This parameter should be set to \code{TRUE} if one deals
-   with large (over a few thousands) AND sparse graphs or matrices. This
-   argument is not implemented currently and LAPACK is used for solving
-   the eigenproblems. }
-  \item{maxiter}{A positive integer giving the maximum number of
-    iterations for the k-means algorithm when \code{algo} =
-    \dQuote{interv\_km}. This parameter is ignored in all other cases.}
-  \item{sparse}{Logical scalar. Whether to return sparse matrices in the
-    result, if matrices are requested.}
-  \item{output}{Character scalar. Set this parameter to \dQuote{default}
-    to retrieve a coarse-grained object of the same class as \code{X}.}
-  \item{semproj}{Logical scalar. Set this parameter to \code{TRUE} to
-    retrieve the semi-projectors of the SCG.}
-  \item{epairs}{Logical scalar. Set this to \code{TRUE} to collect the
-    eigenpairs computed by \code{scg}.}
-  \item{stat.prob}{Logical scalar. This is to collect the stationary
-    probability \code{p} when dealing with stochastic matrices.}
-}
-\details{
-  Please see \link{SCG} for an introduction.
-  
-  In the following \eqn{V} is the matrix of eigenvectors for which the
-  SCG is solved. \eqn{V} is calculated from \code{X}, if it is not given
-  in the \code{evec} argument.
-  
-  The algorithm \dQuote{optimum} solves exactly the SCG problem for each
-  eigenvector in \code{V}. The running time of this algorithm is
-  \eqn{O(\max nt \cdot m^2)}{O(max(nt) m^2)} for the symmetric and
-  laplacian matrix problems (i.e. when \code{mtype} is
-  \dQuote{symmetric} or \dQuote{laplacian}. It is \eqn{O(m^3)} for the
-  stochastic problem. Here \eqn{m} is the number of rows in \code{V}.
-  In all three cases, the memory usage is \eqn{O(m^2)}.
-
-  The algorithms \dQuote{interv} and \dQuote{interv\_km} solve
-  approximately the SCG problem by performing a (for now) constant
-  binning of the components of the eigenvectors, that is
-  \code{nt[i]} constant-size bins are used to partition
-  \code{V[,i]}. When \code{algo} = \dQuote{interv\_km}, the (Lloyd)
-  k-means algorithm is run on each partition obtained by \dQuote{interv}
-  to improve accuracy. 
-
-  Once a minimizing partition (either exact or approximate) has been
-  found for each eigenvector, the final grouping is worked out as
-  follows: two vertices are grouped together in the final partition if
-  they are grouped together in each minimizing partition. In general the
-  size of the final partition is not known in advance when
-  \code{ncol(V)}>1. 
-
-  Finally, the algorithm \dQuote{exact\_scg} groups the vertices with
-  equal components in each eigenvector. The last three algorithms
-  essentially have linear running time and memory load.
-}
-\value{
-  \item{Xt}{The coarse-grained graph, or matrix, possibly a sparse matrix.}
-  \item{groups}{A vector of \code{nrow(X)} or \code{vcount(X)} integers
-    giving the group label of each object (vertex) in the partition.}
-  \item{L}{The semi-projector \eqn{L} if \code{semproj = TRUE}.}
-  \item{R}{The semi-projector \eqn{R} if \code{semproj = TRUE}.}
-  \item{values}{The computed eigenvalues if \code{epairs = TRUE}.}
-  \item{vectors}{The computed or supplied eigenvectors if \code{epairs =
-      TRUE}.}
-  \item{p}{The stationary probability vector if \code{mtype =
-      stochastic} and \code{stat.prob = TRUE}. For other matrix types
-    this is missing.}
-}
-\references{
-D. Morton de Lachapelle, D. Gfeller, and P. De Los Rios, Shrinking
-  Matrices while Preserving their Eigenpairs with Application to the
-  Spectral Coarse Graining of Graphs. Submitted to \emph{SIAM Journal on
-    Matrix Analysis and Applications}, 2008.
-  \url{http://people.epfl.ch/david.morton} 
-}
-\author{David Morton de Lachapelle \email{david.morton@epfl.ch},
-  \email{david.mortondelachapelle@swissquote.ch}} 
-\seealso{\link{SCG} for an introduction.
-  \code{\link{scgNormEps}}, \code{\link{scgGrouping}} and
-  \code{\link{scgSemiProjectors}}.}
-\examples{
-
-## We are not running these examples any more, because they
-## take a long time (~20 seconds) to run and this is against the CRAN
-## repository policy. Copy and paste them by hand to your R prompt if
-## you want to run them.
-
-\dontrun{
-# SCG of a toy network
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-cg <- scg(g, 1, 3, algo="exact_scg")
-
-#plot the result
-layout <- layout.kamada.kawai(g)
-nt <- vcount(cg$Xt)
-col <- rainbow(nt)
-vsize <- table(cg$groups)
-ewidth <- round(E(cg$Xt)$weight,2)
-
-op <- par(mfrow=c(1,2))
-plot(g, vertex.color = col[cg$groups], vertex.size = 20,
-		vertex.label = NA, layout = layout)
-plot(cg$Xt, edge.width = ewidth, edge.label = ewidth, 
-	vertex.color = col, vertex.size = 20*vsize/max(vsize),
-	vertex.label=NA, layout = layout.kamada.kawai)
-par(op)
-
-## SCG of real-world network
-library(igraphdata)
-data(immuno)
-summary(immuno)
-n <- vcount(immuno)
-interv <- c(100,100,50,25,12,6,3,2,2)
-cg <- scg(immuno, ev= n-(1:9), nt=interv, mtype="laplacian",
-                        algo="interv", epairs=TRUE)
-
-## are the eigenvalues well-preserved?
-gt <- cg$Xt
-nt <- vcount(gt)
-Lt <- graph.laplacian(gt)
-evalt <- eigen(Lt, only.values=TRUE)$values[nt-(1:9)]
-res <- cbind(interv, cg$values, evalt)
-res <- round(res,5)
-colnames(res) <- c("interv","lambda_i","lambda_tilde_i")
-rownames(res) <- c("N-1","N-2","N-3","N-4","N-5","N-6","N-7","N-8","N-9")
-print(res)
-
-## use SCG to get the communities
-com <- scg(graph.laplacian(immuno), ev=n-c(1,2), nt=2)$groups
-col <- rainbow(max(com))
-layout <- layout.auto(immuno)
-
-plot(immuno, layout=layout, vertex.size=3, vertex.color=col[com],
-                vertex.label=NA)
-
-## display the coarse-grained graph
-gt <- simplify(as.undirected(gt))
-layout.cg <- layout.kamada.kawai(gt)
-com.cg <- scg(graph.laplacian(gt), nt-c(1,2), 2)$groups
-vsize <- sqrt(as.vector(table(cg$groups)))
-
-op <- par(mfrow=c(1,2))
-plot(immuno, layout=layout, vertex.size=3, vertex.color=col[com],
-                vertex.label=NA)
-plot(gt, layout=layout.cg, vertex.size=15*vsize/max(vsize), 
-                vertex.color=col[com.cg],vertex.label=NA)
-par(op)
-
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg.grouping.Rd igraph-0.6.5/interfaces/R/igraph/man/scg.grouping.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg.grouping.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/scg.grouping.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,119 +0,0 @@
-\name{scgGrouping}
-\alias{scgGrouping}
-\title{SCG Problem Solver}
-\description{
-  This function solves the Spectral Coarse Graining (SCG) problem;
-  either exactly, or approximately but faster.
-}
-\usage{
-scgGrouping(V, nt, mtype = c("symmetric", "laplacian",
-          "stochastic"), algo = c("optimum", "interv_km",
-          "interv","exact_scg"), p = NULL, maxiter = 100)
-}
-\arguments{
-  \item{V}{A numeric matrix of (eigen)vectors to be preserved by the
-    coarse graining (the vectors are to be stored column-wise in
-    \code{V}).} 
-  \item{nt}{A vector of positive integers of length one or equal to
-    \code{length(ev)}. When \code{algo} = \dQuote{optimum}, \code{nt}
-    contains the number of groups used to partition each eigenvector
-    separately. When \code{algo} is equal to \dQuote{interv\_km} or
-    \dQuote{interv}, \code{nt} contains the number of intervals used to
-    partition each eigenvector. The same partition size or number of
-    intervals is used for each eigenvector if \code{nt} is a single
-    integer. When \code{algo} = \dQuote{exact\_cg} this parameter is
-    ignored.}
-  \item{mtype}{The type of semi-projectors used in the SCG. For now
-    \dQuote{symmetric}, \dQuote{laplacian} and \dQuote{stochastic} are
-    available.}
-  \item{algo}{The algorithm used to solve the SCG problem. Possible
-    values are \dQuote{optimum}, \dQuote{interv\_km}, \dQuote{interv}
-    and \dQuote{exact\_scg}.} 
-  \item{p}{A probability vector of length equal to
-    \code{nrow(V)}. \code{p} is the stationary probability distribution
-    of a Markov chain when \code{mtype} = \dQuote{stochastic}. This
-    parameter is ignored in all other cases.}
-  \item{maxiter}{A positive
-    integer giving the maximum number of iterations of the k-means
-    algorithm when \code{algo} = \dQuote{interv\_km}. This parameter is
-    ignored in all other cases.} 
-}
-\details{
-  The algorithm \dQuote{optimum} solves exactly the SCG problem for each
-  eigenvector in \code{V}. The running time of this algorithm is
-  \eqn{O(\max nt \cdot m^2)}{O(max(nt) m^2)} for the symmetric and
-  laplacian matrix problems (i.e. when \code{mtype} is
-  \dQuote{symmetric} or \dQuote{laplacian}. It is \eqn{O(m^3)} for the
-  stochastic problem. Here \eqn{m} is the number of rows in \code{V}.
-  In all three cases, the memory usage is \eqn{O(m^2)}.
-
-  The algorithms \dQuote{interv} and \dQuote{interv\_km} solve
-  approximately the SCG problem by performing a (for now) constant
-  binning of the components of the eigenvectors, that is \code{nt[i]}
-  constant-size bins are used to partition \code{V[,i]}. When
-  \code{algo} = \dQuote{interv\_km}, the (Lloyd) k-means algorithm is
-  run on each partition obtained by \dQuote{interv} to improve
-  accuracy. 
-
-  Once a minimizing partition (either exact or approximate) has been
-  found for each eigenvector, the final grouping is worked out as
-  follows: two vertices are grouped together in the final partition if
-  they are grouped together in each minimizing partition. In general the
-  size of the final partition is not known in advance when
-  \code{ncol(V)}>1. 
-
-  Finally, the algorithm \dQuote{exact\_scg} groups the vertices with
-  equal components in each eigenvector. The last three algorithms
-  essentially have linear running time and memory load.
-}
-\value{
-  A vector of \code{nrow(V)} integers giving the group label of each
-  object (vertex) in the partition.
-}
-\references{
-D. Morton de Lachapelle, D. Gfeller, and P. De Los Rios, Shrinking
-  Matrices while Preserving their Eigenpairs with Application to the
-  Spectral Coarse Graining of Graphs. Submitted to \emph{SIAM Journal on
-    Matrix Analysis and Applications}, 2008.
-  \url{http://people.epfl.ch/david.morton}
-}
-\author{David Morton de Lachapelle \email{david.morton@epfl.ch},
-  \email{david.mortondelachapelle@swissquote.ch}} 
-\seealso{\link{SCG} for a detailed introduction. \code{\link{scg}},
-  \code{\link{scgNormEps}}}
-\examples{
-# eigenvectors of a random symmetric matrix
-M <- matrix(rexp(10^6), 10^3, 10^3)
-M <- (M + t(M))/2
-V <- eigen(M, symmetric=TRUE)$vectors[,c(1,2)]
-
-# displays size of the groups in the final partition
-gr <- scgGrouping(V, nt=c(2,3))
-col <- rainbow(max(gr))
-plot(table(gr), col=col, main="Group size", xlab="group", ylab="size")
-
-## comparison with the grouping obtained by kmeans
-## for a partition of same size
-gr.km <- kmeans(V,centers=max(gr), iter.max=100, nstart=100)$cluster
-op <- par(mfrow=c(1,2))
-plot(V[,1], V[,2], col=col[gr],
-	main = "SCG grouping",
-	xlab = "1st eigenvector",
-	ylab = "2nd eigenvector")
-plot(V[,1], V[,2], col=col[gr.km],
-	main = "K-means grouping",
-	xlab = "1st eigenvector",
-	ylab = "2nd eigenvector")
-par(op)
-## kmeans disregards the first eigenvector as it
-## spreads a much smaller range of values than the second one
-
-### comparing optimal and k-means solutions
-### in the one-dimensional case.
-x <- rexp(2000, 2)
-gr.true <- scgGrouping(cbind(x), 100)
-gr.km <- kmeans(x, 100, 100, 300)$cluster
-scgNormEps(cbind(x), gr.true)
-scgNormEps(cbind(x), gr.km)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg_extra.Rd igraph-0.6.5/interfaces/R/igraph/man/scg_extra.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/scg_extra.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/scg_extra.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-\name{scgExtra}
-\alias{scgNormEps}
-\title{SCG Extra Functions}
-\description{
-  Some useful functions to perform general actions in Spectral Coarse
-  Graining (SCG).
-}
-\usage{
-scgNormEps(V, groups, mtype = c("symmetric", "laplacian",
-          "stochastic"), p = NULL, norm = c("row", "col"))
-}
-\arguments{
-  \item{V}{A numeric matrix of (eigen)vectors assumed normalized.
-    The vectors are to be stored column-wise in \code{V}).}
-  \item{groups}{A vector of \code{nrow(V)} integers labeling 
-    each group vertex in the partition.}
-  \item{mtype}{The type of semi-projector used for the SCG. For 
-    now \dQuote{symmetric}, \dQuote{laplacian} and \dQuote{stochastic}
-    are available.} 
-  \item{p}{A probability vector of length \code{nrow(V)}.
-    \code{p} is the stationary probability distribution of a Markov chain 
-    when \code{mtype} = \dQuote{stochastic}. This parameter is ignored otherwise.}
-  \item{norm}{Either \dQuote{row} or \dQuote{col}. If set to \dQuote{row} 
-    the rows of the Laplacian matrix sum to zero and the rows of the 
-    stochastic matrix sum to one; otherwise it is the columns.}
-}
-\details{
- \code{scgNormEps} computes \eqn{\Vert v_i-Pv_i\Vert}{|v[i]-Pv[i]|},
-   where \eqn{v_i}{v[i]} is the \eqn{i}th eigenvector in \code{V} and
-   \eqn{P} is the projector corresponding to the \code{mtype} argument.
-}
-\value{
-  \code{normEps} returns with a numeric vector whose \eqn{i}th component is 
-  \eqn{\Vert v_i-Pv_i\Vert}{|v[i]-Pv[i]|} (see Details).
-}
-\references{
-  D. Morton de Lachapelle, D. Gfeller, and P. De Los Rios, Shrinking
-  Matrices while Preserving their Eigenpairs with Application to the
-  Spectral Coarse Graining of Graphs. Submitted to \emph{SIAM Journal on
-    Matrix Analysis and Applications}, 2008. 
-  \url{http://people.epfl.ch/david.morton}
-}
-\author{David Morton de Lachapelle \email{david.morton@epfl.ch},
-  \email{david.mortondelachapelle@swissquote.ch}}
-\seealso{\link{SCG} and \code{\link{scg}}. }
-\examples{
-v <- rexp(20)
-km <- kmeans(v,5)
-sum(km$withinss)
-scgNormEps(cbind(v), km$cluster)^2
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/semiProjectors.Rd igraph-0.6.5/interfaces/R/igraph/man/semiProjectors.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/semiProjectors.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/semiProjectors.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,92 +0,0 @@
-\name{scgSemiProjectors}
-\alias{scgSemiProjectors}
-\title{Semi-Projectors}
-\description{
-  A function to compute the \eqn{L} and \eqn{R} semi-projectors for a
-  given partition of the vertices.
-}
-\usage{
-scgSemiProjectors(groups, mtype = c("symmetric", "laplacian",
-                    "stochastic"), p = NULL, norm = c("row", "col"),
-                  sparse = getIgraphOpt("sparsematrices"))
-}
-\arguments{
-  \item{groups}{A vector of \code{nrow(X)} or \code{vcount(X)} integers
-    giving the group label of every vertex in the partition.}
-  \item{mtype}{The type of semi-projectors. For now \dQuote{symmetric},
-    \dQuote{laplacian} and \dQuote{stochastic} are available.}
-  \item{p}{A probability vector of length \code{length(gr)}. \code{p} is
-    the stationary probability distribution of a Markov chain when
-    \code{mtype} = \dQuote{stochastic}. This parameter is ignored in
-    all other cases.} 
-  \item{norm}{Either \dQuote{row} or \dQuote{col}. If set to
-    \dQuote{row} the rows of the Laplacian matrix sum up to zero 
-    and the rows of the stochastic sum up to one; otherwise it is the
-    columns.}
-  \item{sparse}{Logical scalar, whether to return sparse matrices.}
-}
-\details{
-  The three types of semi-projectors are defined as follows.
-  Let \eqn{\gamma(j)}{gamma(j)} label the group of vertex \eqn{j} in a
-  partition of all the vertices.
- 
-  The symmetric semi-projectors are defined as
-  \deqn{L_{\alpha j}=R_{\alpha j}=
-    \frac{1}{\sqrt{|\alpha|}}\delta_{\alpha\gamma(j)},}{%
-    L[alpha,j] = R[alpha,j] = 1/sqrt(|alpha|) delta[alpha,gamma(j)],}
-  the (row) Laplacian semi-projectors as
-  \deqn{L_{\alpha j}=\frac{1}{|\alpha|}\delta_{\alpha\gamma(j)}\,\,\,\,
-    \textrm{and}\,\,\,\, R_{\alpha j}=\delta_{\alpha\gamma(j)},}{%
-    L[alpha,j] = 1/|alpha| delta[alpha,gamma(j)] and
-    R[alpha,j] = delta[alpha,gamma(j)],}
-  and the (row) stochastic semi-projectors as
-  \deqn{L_{\alpha j}=\frac{p_{1}(j)}{\sum_{k\in\gamma(j)}p_{1}(k)}\,\,\,\,
-      \textrm{and}\,\,\,\, R_{\alpha j}=\delta_{\alpha\gamma(j)\delta_{\alpha\gamma(j)}},}{%
-      L[alpha,j] = p[1][j] / sum(p[1][k]; k in gamma(j))
-      delta[alpha,gamma(j)] and 
-      R[alpha,j] = delta[alpha,gamma(j)],}
-  where \eqn{p_1}{p[1]} is the (left) eigenvector associated with the
-  one-eigenvalue of the stochastic matrix. \eqn{L} and \eqn{R} are
-  defined in a symmetric way when \code{norm = col}. All these
-  semi-projectors verify various properties described in the
-  reference.
-}
-\value{
- \item{L}{The semi-projector \eqn{L}.}
- \item{R}{The semi-projector \eqn{R}.}
-}
-\references{
-  D. Morton de Lachapelle, D. Gfeller, and P. De Los Rios, Shrinking
-  Matrices while Preserving their Eigenpairs with Application to the
-  Spectral Coarse Graining of Graphs. Submitted to \emph{SIAM
-    Journal on Matrix Analysis and Applications}, 2008. 
-  \url{http://people.epfl.ch/david.morton}
-}
-\author{David Morton de Lachapelle \email{david.morton@epfl.ch},
-  \email{david.mortondelachapelle@swissquote.ch}} 
-\seealso{\link{SCG} for a detailed introduction. \code{\link{scg}},
-  \code{\link{scgNormEps}}, \code{\link{scgGrouping}}}
-\examples{
-# compute the semi-projectors and projector for the partition
-# provided by a community detection method
-g <- barabasi.game(20, m=1.5)
-eb <- edge.betweenness.community(g)
-memb <- membership(eb)
-lr <- scgSemiProjectors(memb)
-#In the symmetric case L = R
-tcrossprod(lr$R)  # same as lr$R %*% t(lr$R)
-P <- crossprod(lr$R)  # same as t(lr$R) %*% lr$R
-#P is an orthogonal projector
-isSymmetric(P)
-sum( (P \%*\% P-P)^2 )
-
-## use L and R to coarse-grain the graph Laplacian
-lr <- scgSemiProjectors(memb, mtype="laplacian")
-L <- graph.laplacian(g)
-Lt <- lr$L \%*\% L \%*\% t(lr$R)
-## or better lr$L \%*\% tcrossprod(L,lr$R)
-rowSums(Lt)
-}
-\keyword{array}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/shortest.paths.Rd igraph-0.6.5/interfaces/R/igraph/man/shortest.paths.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/shortest.paths.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/shortest.paths.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,178 +0,0 @@
-\name{shortest.paths}
-\alias{shortest.paths}
-\alias{get.shortest.paths}
-\alias{get.all.shortest.paths}
-\alias{average.path.length}
-\alias{path.length.hist}
-\concept{Shortest path}
-\concept{Geodesic}
-\title{Shortest (directed or undirected) paths between vertices}
-\description{\code{shortest.paths} calculates the length of all the
-  shortest paths from or to the vertices in the
-  network. \code{get.shortest.paths} calculates one shortest path (the
-  path itself, and not just its length) from or to the given vertex.}
-\usage{
-shortest.paths(graph, v=V(graph), to=V(graph),
-      mode = c("all", "out", "in"),
-      weights = NULL, algorithm = c("automatic", "unweighted",
-                                    "dijkstra", "bellman-ford",
-                                    "johnson"))
-get.shortest.paths(graph, from, to=V(graph), mode = c("out", "all",
-      "in"), weights = NULL, output=c("vpath", "epath", "both"))
-get.all.shortest.paths(graph, from, to = V(graph), mode = c("out", 
-      "all", "in"), weights=NULL) 
-average.path.length(graph, directed=TRUE, unconnected=TRUE)
-path.length.hist (graph, directed = TRUE)
-}
-\arguments{
-  \item{graph}{The graph to work on.}
-  \item{v}{Numeric vector, the vertices from which the shortest
-    paths will be calculated.}
-  \item{to}{Numeric vector, the vertices to which the shortest paths
-    will be calculated. By default it includes all vertices. Note that
-    for \code{shortest.paths} every vertex must be included here at most
-    once. (This is not required for \code{get.shortest.paths}.}
-  \item{mode}{Character constant, gives whether the shortest paths to or
-    from the given vertices should be calculated for directed graphs. If
-    \code{out} then the shortest paths \emph{from} the vertex, if
-    \code{in} then \emph{to} it will be considered. If \code{all}, the
-    default, then the corresponding undirected graph will be used,
-    ie. not directed paths are searched. This argument is ignored for
-    undirected graphs.}
-  \item{weights}{Possibly a numeric vector giving edge weights. If this
-    is \code{NULL} and the graph has a \code{weight} edge attribute,
-    then the attribute is used. If this is \code{NA} then no weights are
-    used (even if the graph has a \code{weight} attribute).}
-  \item{algorithm}{Which algorithm to use for the calculation. By
-    default igraph tries to select the fastest suitable algorithm. If
-    there are no weights, then an unweighted breadth-first search is used,
-    otherwise if all weights are positive, then Dijkstra's algorithm is
-    used. If there are negative weights and we do the calculation for
-    more than 100 sources, then Johnson's algorithm is used. Otherwise
-    the Bellman-Ford algorithm is used. You can override igraph's choice
-    by explicitly giving this parameter. Note that the igraph C core
-    might still override your choice in obvious cases, i.e. if there are
-    no edge weights, then the unweighted algorithm will be used,
-    regardless of this argument.
-  }
-  \item{from}{Numeric constant, the vertex from or to the shortest paths
-    will be calculated. Note that right now this is not a vector of
-    vertex ids, but only a single vertex.}
-  \item{output}{Character scalar, defines how to report the shortest
-    paths. \dQuote{vpath} means that the vertices along the paths are
-    reported, this form was used prior to igraph version
-    0.6. \dQuote{epath} means that the edges along the paths are
-    reported. \dQuote{both} means that both forms are returned, in a
-    named list with components \dQuote{vpath} and \dQuote{epath}.}
-  \item{directed}{Whether to consider directed paths in directed graphs,
-    this argument is ignored for undirected graphs.}
-  \item{unconnected}{What to do if the graph is unconnected (not
-    strongly connected if directed paths are considered). If TRUE only
-    the lengths of the existing paths are considered and averaged; if
-    FALSE the length of the missing paths are counted having length
-    \code{vcount(graph)}, one longer than the longest possible geodesic
-    in the network.}
-}
-\details{
-  The shortest path, or geodesic between two pair of vertices is a path
-  with the minimal number of vertices. The functions documented in this
-  manual page all calculate shortest paths between vertex pairs.
-  
-  \code{shortest.paths} calculates the lengths of pairwise shortest
-  paths from a set of vertices (\code{from}) to another set of vertices
-  (\code{to}). It uses different algorithms, depending on the
-  \code{argorithm} argument and the \code{weight} edge attribute of the
-  graph. The implemented algorithms are breadth-first search
-  (\sQuote{\code{unweighted}}), this only works for unweighted graphs;
-  the Dijkstra algorithm (\sQuote{\code{dijkstra}}), this works for
-  graphs with non-negative edge weights; the Bellman-Ford algorithm
-  (\sQuote{\code{bellman-ford}}), and Johnson's algorithm
-  (\sQuote{\code{"johnson"}}). The latter two algorithms work with
-  arbitrary edge weights, but (naturally) only for graphs that don't
-  have a negative cycle.
-
-  igraph can choose automatically between algorithms, and chooses the
-  most efficient one that is appropriate for the supplied weights (if
-  any). For automatic algorithm selection, supply
-  \sQuote{\code{automatic}} as the \code{algorithm} argument. (This is
-  also the default.)
-
-  \code{get.shortest.paths} calculates a single shortest path (i.e. the
-  path itself, not just its length) between the source vertex
-  given in \code{from}, to the target vertices given in
-  \code{to}. \code{get.shortest.paths} uses breadth-first search for
-  unweighted graphs and Dijkstra's algorithm for weighted graphs. The
-  latter only works if the edge weights are non-negative.
-
-  \code{get.all.shortest.paths} calculates \emph{all} shortest paths
-  between pairs of vertices. More precisely, between the \code{from}
-  vertex to the vertices given in \code{to}. It uses a breadth-first
-  search for unweighted graphs and Dijkstra's algorithm for weighted
-  ones. The latter only supports non-negative edge weights.
-
-  \code{average.path.length} calculates the average path length in a
-  graph, by calculating the shortest paths between all pairs of vertices
-  (both ways for directed graphs). This function does not consider edge
-  weights currently and uses a breadth-first search.
-  
-  \code{path.length.hist} calculates a histogram, by calculating the
-  shortest path length between each pair of vertices. For directed
-  graphs both directions are considered, so every pair of vertices
-  appears twice in the histogram.
-}
-\value{
-  For \code{shortest.paths} a numeric matrix with \code{length(to)}
-  columns and \code{length(v)} rows. The shortest path length from a vertex to
-  itself is always zero. For unreachable vertices \code{Inf} is included.
-
-  For \code{get.shortest.paths} the return value depends on the
-  \code{output} parameter. If this is \dQuote{vpath}, then a list of length
-  \code{vcount(graph)} is returned.
-  List element \code{i} contains the vertex ids on
-  the path from vertex \code{from} to vertex \code{i} (or the other way
-  for directed graphs depending on the \code{mode} argument). The vector
-  also contains \code{from} and \code{i} as the first and last
-  elements. If \code{from} is the same as \code{i} then it is only
-  included once. If there is no path between two vertices then a
-  numeric vector of length zero is returned as the list element.
-
-  If \code{output} is \dQuote{epath}, then a similar list is returned,
-  but the vectors in the list contain the edge ids along the shortest
-  paths, instead of the vertex ids.
-
-  If \code{output} is \dQuote{both}, then both lists are returned, in a
-  named list with entries named as \dQuote{vpath} and \dQuote{epath}.
-  
-  For \code{get.all.shortest.paths} a list is returned, each list
-  element contains a shortest path from \code{from} to a vertex in
-  \code{to}. The shortest paths to the same vertex are collected into
-  consecutive elements of the list.
-  
-  For \code{average.path.length} a single number is returned.
-
-  \code{path.length.hist} returns a named list with two entries:
-  \code{res} is a numeric vector, the histogram of distances,
-  \code{unconnected} is a numeric scalar, the number of pairs for which
-  the first vertex is not reachable from the second. The sum of the two
-  entries is always \eqn{n(n-1)} for directed graphs and \eqn{n(n-1)/2}
-  for undirected graphs.
-}
-\references{ West, D.B. (1996). \emph{Introduction to Graph Theory.} Upper
-  Saddle River, N.J.: Prentice Hall. }
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-\examples{
-g <- graph.ring(10)
-shortest.paths(g)
-get.shortest.paths(g, 5)
-get.all.shortest.paths(g, 1, 6:8)
-average.path.length(g)
-## Weighted shortest paths
-el <- matrix(nc=3, byrow=TRUE,
-             c(1,2,0, 1,3,2, 1,4,1, 2,3,0, 2,5,5, 2,6,2, 3,2,1, 3,4,1,
-               3,7,1, 4,3,0, 4,7,2, 5,6,2, 5,8,8, 6,3,2, 6,7,1, 6,9,1,
-               6,10,3, 8,6,1, 8,9,1, 9,10,4) )
-g2 <- add.edges(graph.empty(10), t(el[,1:2]), weight=el[,3])
-shortest.paths(g2, mode="out")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/similarity.Rd igraph-0.6.5/interfaces/R/igraph/man/similarity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/similarity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/similarity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,64 +0,0 @@
-\name{similarity}
-\alias{similarity.jaccard}
-\alias{similarity.dice}
-\alias{similarity.invlogweighted}
-\concept{Vertex similarity}
-\title{Similarity measures of two vertices}
-\description{
-  These functions calculates similarity scores for vertices based on
-  their connection patterns.
-}
-\usage{
-similarity.jaccard(graph, vids = V(graph), mode = c("all", "out", "in",
-      "total"), loops = FALSE) 
-similarity.dice(graph, vids = V(graph), mode = c("all", "out", "in",
-      "total"), loops = FALSE)
-similarity.invlogweighted(graph, vids = V(graph),
-       mode = c("all", "out", "in", "total"))
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{vids}{The vertex ids for which the similarity is calculated.}
-  \item{mode}{The type of neighboring vertices to use for the
-    calculation, possible values: \sQuote{\code{out}},
-    \sQuote{\code{in}}, \sQuote{\code{all}}.}
-  \item{loops}{Whether to include vertices themselves in the neighbor
-    sets.}
-}
-\details{
- The Jaccard similarity coefficient of two vertices is the number of common
- neighbors divided by the number of vertices that are neighbors of at
- least one of the two vertices being
- considered. \code{similarity.jaccard} calculates
- the pairwise Jaccard similarities for some (or all) of the vertices.
-
- The Dice similarity coefficient of two vertices is twice the number of common
- neighbors divided by the sum of the degrees of the
- vertices. \code{similarity.dice} calculates the pairwise Dice
- similarities for some (or all) of the vertices.
-
- The inverse log-weighted similarity of two vertices is the number of
- their common neighbors, weighted by the inverse logarithm of their degrees.
- It is based on the assumption that two vertices should be considered
- more similar if they share a low-degree common neighbor, since high-degree
- common neighbors are more likely to appear even by pure chance.
- Isolated vertices will have zero similarity to any other vertex.
- Self-similarities are not calculated.
- See the following paper for more details: Lada A. Adamic and Eytan Adar:
- Friends and neighbors on the Web. Social Networks, 25(3):211-230, 2003.
-}
-\value{
-  A \code{length(vids)} by \code{length(vids)} numeric matrix containing
-  the similarity scores.
-}
-\references{Lada A. Adamic and Eytan Adar:
- Friends and neighbors on the Web. \emph{Social Networks}, 25(3):211-230, 2003.}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the manual page.}
-\seealso{\code{\link{cocitation}} and \code{\link{bibcoupling}}}
-\examples{
-g <- graph.ring(5)
-similarity.dice(g)
-similarity.jaccard(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/simplify.Rd igraph-0.6.5/interfaces/R/igraph/man/simplify.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/simplify.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/simplify.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-\name{simplify}
-\alias{simplify}
-\alias{is.simple}
-\concept{Simple graph}
-\title{Simple graphs}
-\description{Simple graphs are graphs which do not contain loop and
-  multiple edges.}
-\usage{
-simplify(graph, remove.multiple = TRUE, remove.loops = TRUE,
-         edge.attr.comb = getIgraphOpt("edge.attr.comb"))
-is.simple(graph)
-}
-\arguments{
-  \item{graph}{The graph to work on.}
-  \item{remove.loops}{Logical, whether the loop edges are to be
-    removed.}
-  \item{remove.multiple}{Logical, whether the multiple edges are to be
-    removed.}
-  \item{edge.attr.comb}{Specifies what to do with edge attributes, if
-    \code{remove.multiple=TRUE}. In this case many edges might be mapped
-    to a single one in the new graph, and their attributes are
-    combined. Please see \code{\link{attribute.combination}} for details
-    on this.}
-}
-\details{
-  A loop edge is an edge for which the two endpoints are the same
-  vertex. Two edges are multiple edges if they have exactly the same two
-  endpoints (for directed graphs order does matter). A graph is simple
-  is it does not contain loop edges and multiple edges.
-
-  \code{is.simple} checks whether a graph is simple.
-
-  \code{simplify} removes the loop and/or multiple edges from a graph.
-  If both \code{remove.loops} and \code{remove.multiple} are \code{TRUE}
-  the function returns a simple graph.
-}
-\value{A new graph object with the edges deleted. }
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{is.loop}}, \code{\link{is.multiple}} and
-  \code{\link{count.multiple}}, \code{\link{delete.edges}},
-  \code{\link{delete.vertices}}}
-\examples{
-g <- graph( c(1,2,1,2,3,3) )
-is.simple(g)
-is.simple(simplify(g, remove.loops=FALSE))
-is.simple(simplify(g, remove.multiple=FALSE))
-is.simple(simplify(g))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/spinglass.community.Rd igraph-0.6.5/interfaces/R/igraph/man/spinglass.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/spinglass.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/spinglass.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,142 +0,0 @@
-\name{spinglass.community}
-\alias{spinglass.community}
-\concept{Statistical mechanics}
-\concept{Spin-glass}
-\concept{Community structure}
-\title{Finding communities in graphs based on statistical meachanics}
-\description{This function tries to find communities in graphs via
-  a spin-glass model and simulated annealing.}
-\usage{
-spinglass.community(graph, weights=NULL, vertex=NULL, spins=25,
-                    parupdate=FALSE, start.temp=1, stop.temp=0.01,
-                    cool.fact=0.99, update.rule=c("config", "random",
-                    "simple"), gamma=1, implementation=c("orig", "neg"),
-                    gamma.minus=1)
-}
-\arguments{
-  \item{graph}{The input graph, can be directed but the direction of the
-    edges is neglected.}
-  \item{weights}{The weights of the edges. Either a numeric vector or
-    \code{NULL}. If it is null and the input graph has a \sQuote{weight}
-    edge attribute then that will be used. If \code{NULL} and no such
-    attribute is present then the edges will have equal weights. Set
-    this to \code{NA} if the graph was a \sQuote{weight} edge attribute,
-    but you don't want to use it for community detection.}
-  \item{vertex}{This parameter can be used to calculate the community of
-      a given vertex without calculating all communities. Note that if
-      this argument is present then some other arguments are ignored.}
-  \item{spins}{Integer constant, the number of spins to use. This is the
-    upper limit for the number of communities. It is not a problem to
-    supply a (reasonably) big number here, in which case some
-    spin states will be unpopulated. }
-  \item{parupdate}{Logical constant, whether to update the spins of the
-    vertices in parallel (synchronously) or not. This argument is
-    ignored if the second form of the function is used (ie. the
-    \sQuote{\code{vertex}} argument is present). }
-  \item{start.temp}{Real constant, the start temperature.
-    This argument is ignored if the second form of the
-    function is used (ie. the \sQuote{\code{vertex}} argument is
-    present). } 
-  \item{stop.temp}{Real constant, the stop temperature. The simulation
-    terminates if the temperature lowers below this level.
-    This argument is ignored if the second form of the
-    function is used (ie. the \sQuote{\code{vertex}} argument is
-    present). } 
-  \item{cool.fact}{Cooling factor for the simulated annealing.
-    This argument is ignored if the second form of the
-    function is used (ie. the \sQuote{\code{vertex}} argument is
-    present). }     
-  \item{update.rule}{Character constant giving the \sQuote{null-model}
-    of the simulation. Possible values: \dQuote{simple} and
-    \dQuote{config}. \dQuote{simple} uses a random graph with the same
-    number of edges as the baseline probability and \dQuote{config} uses
-    a random graph with the same vertex degrees as the input graph.}
-  \item{gamma}{Real constant, the gamma argument of the algorithm. This
-    specifies the balance between the importance of present and
-    non-present edges in a community. Roughly, a comunity is a set of
-    vertices having many edges inside the community and few edges
-    outside the community. The default 1.0 value makes existing and
-    non-existing links equally important. Smaller values make the
-    existing links, greater values the missing links more important.}
-  \item{implementation}{Character scalar. Currently igraph contains two
-    implementations for the Spin-glass community finding algorithm. The
-    faster original implementation is the default. The other
-    implementation, that takes into account negative weights, can be
-    chosen by supplying \sQuote{neg} here.}
-  \item{gamma.minus}{Real constant, the gamma.minus parameter of
-    the algorithm. This specifies the balance between the importance of
-    present and non-present negative weighted edges in a
-    community. Smaller values of gamma.minus, leads to communities with
-    lesser negative intra-connectivity. If this argument is set to zero,
-    the algorithm reduces to a graph coloring algorithm, using the
-    number of spins as the number of colors. This argument is ignored if
-    the \sQuote{orig} implementation is chosen.}
-}
-\details{
-  This function tries to find communities in a graph. A community is a
-  set of nodes with many edges inside the community and  few edges
-  between outside it (i.e. between the community itself and the rest of
-  the graph.)
-
-  This idea is reversed for edges having a negative weight, 
-  ie. few negative edges inside a community and many negative edges
-  between communities. Note that only the \sQuote{neg} implementation
-  supports negative edge weights.
-
-  The \code{spinglass.cummunity} function can solve two problems related
-  to community detection. If the \code{vertex} argument is not given (or
-  it is \code{NULL}), then the regular community detection problem is
-  solved (approximately), i.e. partitioning the vertices into
-  communities, by optimizing the an energy function.
-
-  If the \code{vertex} argument is given and it is not \code{NULL}, then
-  it must be a vertex id, and the same energy function is used to find
-  the community of the the given vertex. See also the examples below.
-}
-\value{
-  If the \code{vertex} argument is not given, ie. the first form is used
-  then a \code{\link{spinglass.community}} returns a
-  \code{\link{communities}} object. 
-
-  If the \code{vertex} argument is present, ie. the second form is used
-  then a named list is returned with the following components:
-  \item{community}{Numeric vector giving the ids of the vertices in
-    the same community as \code{vertex}.}
-  \item{cohesion}{The cohesion score of the result, see references.}
-  \item{adhesion}{The adhesion score of the result, see references.}
-  \item{inner.links}{The number of edges within the community of
-    \code{vertex}.}
-  \item{outer.links}{The number of edges between the community of
-    \code{vertex} and the rest of the graph. }
-}
-\references{
-  J. Reichardt and S. Bornholdt: Statistical Mechanics of Community
-  Detection, \emph{Phys. Rev. E}, 74, 016110 (2006),
-  \url{http://arxiv.org/abs/cond-mat/0603718}
-
-  M. E. J. Newman and M. Girvan: Finding and evaluating community
-  structure in networks, \emph{Phys. Rev. E} 69, 026113 (2004)
-
-  V.A. Traag and Jeroen Bruggeman: Community detection in networks 
-  with positive and negative links, \url{http://arxiv.org/abs/0811.2329}
-  (2008).
-  
-}
-\author{Jorg Reichardt \email{lastname@physik.uni-wuerzburg.de} for the
-  original code and Gabor Csardi \email{csardi.gabor@gmail.com} for the
-  igraph glue code.
-  
-  Changes to the original function for including the
-  possibility of negative ties were implemented 
-  by Vincent Traag \email{vtraag@f-m.fm}.}
-\seealso{\code{\link{communities}}, \code{\link{clusters}}}
-\examples{
-  g <- erdos.renyi.game(10, 5/10) \%du\% erdos.renyi.game(9, 5/9)
-  g <- add.edges(g, c(1, 12))
-  g <- induced.subgraph(g, subcomponent(g, 1))
-  spinglass.community(g, spins=2)
-  spinglass.community(g, vertex=1)
-}
-\keyword{graphs}
-
-    
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/static.fitness.game.Rd igraph-0.6.5/interfaces/R/igraph/man/static.fitness.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/static.fitness.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/static.fitness.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,73 +0,0 @@
-\name{static.fitness.game}
-\alias{static.fitness.game}
-\concept{Random graph model}
-\title{Random graphs from vertex fitness scores}
-\description{
-  This function generates a non-growing random graph with edge probabilities
-  proportional to node fitness scores.
-}
-\usage{
-static.fitness.game (no.of.edges, fitness.out, fitness.in,
-                     loops = FALSE, multiple = FALSE) 
-
-}
-\arguments{
-  \item{no.of.edges}{The number of edges in the generated graph.}
-  \item{fitness.out}{A numeric vector containing the fitness of each
-    vertex. For directed graphs, this specifies the out-fitness
-    of each vertex.}
-  \item{fitness.in}{If \code{NULL} (the default), the generated graph
-    will be undirected. If not \code{NULL}, then it should be a numeric
-    vector and it specifies the in-fitness of each vertex.
-
-    If this argument is not \code{NULL}, then a directed graph is
-    generated, otherwise an undirected one.
-  }
-  \item{loops}{Logical scalar, whether to allow loop edges in the
-    graph.}
-  \item{multiple}{Logical scalar, whether to allow multiple edges in the
-    graph.}
-}
-\details{
-  This game generates a directed or undirected random graph where the
-  probability of an edge between vertices \eqn{i} and \eqn{j} depends on
-  the fitness scores of the two vertices involved. For undirected graphs,
-  each vertex has a single fitness score. For directed graphs, each
-  vertex has an out- and an in-fitness, and the probability of an edge
-  from \eqn{i} to \eqn{j} depends on the out-fitness of vertex \eqn{i}
-  and the in-fitness of vertex \eqn{j}.
-  
-  The generation process goes as follows. We start from \eqn{N}
-  disconnected nodes (where \eqn{N} is given by the length of the fitness
-  vector). Then we randomly select two vertices \eqn{i} and \eqn{j}, with
-  probabilities proportional to their fitnesses. (When the generated
-  graph is directed, \eqn{i} is selected according to the out-fitnesses
-  and \eqn{j} is selected according to the in-fitnesses). If the
-  vertices are not connected yet (or if multiple edges are allowed), we 
-  connect them; otherwise we select a new pair. This is repeated until
-  the desired number of links are created.
-  
-  It can be shown that the \emph{expected} degree of each vertex will be
-  proportional to its fitness, although the actual, observed degree will not
-  be. If you need to generate a graph with an exact degree sequence, consider
-  \code{\link{degree.sequence.game}} instead.
-  
-  This model is commonly used to generate static scale-free networks. To
-  achieve this, you have to draw the fitness scores from the desired power-law
-  distribution. Alternatively, you may use
-  \code{\link{static.power.law.game}} which generates the fitnesses for
-  you with a given exponent.
-}
-\value{An igraph graph, directed or undirected.}
-\references{
-  Goh K-I, Kahng B, Kim D: Universal behaviour of load distribution
-  in scale-free networks. \emph{Phys Rev Lett} 87(27):278701, 2001.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com}}
-\examples{
-N <- 10000
-g <- static.fitness.game(5*N, sample((1:50)^-2, N, replace=TRUE))
-degree.distribution(g)
-\dontrun{plot(degree.distribution(g, cumulative=TRUE), log="xy")}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/static.power.law.game.Rd igraph-0.6.5/interfaces/R/igraph/man/static.power.law.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/static.power.law.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/static.power.law.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,78 +0,0 @@
-\name{static.power.law.game}
-\alias{static.power.law.game}
-\concept{Random graph model}
-\title{Scale-free random graphs, from vertex fitness scores}
-\description{
-  This function generates a non-growing random graph with expected
-  power-law degree distributions.
-}
-\usage{
-static.power.law.game (no.of.nodes, no.of.edges, exponent.out,
-                       exponent.in = -1, loops = FALSE,
-                       multiple = FALSE, finite.size.correction = TRUE) 
-}
-\arguments{
-  \item{no.of.nodes}{The number of vertices in the generated graph.}
-  \item{no.of.edges}{The number of edges in the generated graph.}
-  \item{exponent.out}{Numeric scalar, the power law exponent of the
-    degree distribution. For directed graphs, this specifies the
-    exponent of the out-degree distribution. It must be greater than or
-    equal to 2. If you pass \code{Inf} here, you will get back an
-    Erdos-Renyi random network.}
-  \item{exponent.in}{Numeric scalar. If negative, the generated graph
-    will be undirected. If greater than or equal to 2, this argument
-    specifies the exponent of the in-degree distribution. If
-    non-negative but less than 2, an error will be generated.}
-  \item{loops}{Logical scalar, whether to allow loop edges in the
-    generated graph.}
-  \item{multiple}{Logical scalar, whether to allow multiple edges in the
-    generated graph.}
-  \item{finite.size.correction}{Logical scalar, whether to use the
-    proposed finite size correction of Cho et al., see references
-    below.}
-}
-\details{
- This game generates a directed or undirected random graph where the
- degrees of vertices follow power-law distributions with prescribed
- exponents. For directed graphs, the exponents of the in- and out-degree
- distributions may be specified separately.
-
- The game simply uses \code{\link{static.fitness.game}} with appropriately
- constructed fitness vectors. In particular, the fitness of vertex
- \eqn{i} is \eqn{i^{-alpha}}{i^(-alpha)}, where \eqn{alpha = 1/(gamma-1)}
- and gamma is the exponent given in the arguments.
-
- To remove correlations between in- and out-degrees in case of directed
- graphs, the in-fitness vector will be shuffled after it has been set up
- and before \code{\link{static.fitness.game}} is called.
-
- Note that significant finite size effects may be observed for exponents
- smaller than 3 in the original formulation of the game. This function
- provides an argument that lets you remove the finite size effects by
- assuming that the fitness of vertex \eqn{i} is 
- \eqn{(i+i_0-1)^{-alpha}}{(i+i0-1)^(-alpha)}
- where \eqn{i_0}{i0} is a constant chosen appropriately to ensure that
- the maximum degree is less than the square root of the number of edges
- times the average degree; see the paper of Chung and Lu, and Cho et al
- for more details.
-}
-\value{An igraph graph, directed or undirected.}
-\references{
-  Goh K-I, Kahng B, Kim D: Universal behaviour of load distribution
-  in scale-free networks. \emph{Phys Rev Lett} 87(27):278701, 2001.
-
- Chung F and Lu L: Connected components in a random graph with given
- degree sequences. \emph{Annals of Combinatorics} 6, 125-145, 2002.
-
- Cho YS, Kim JS, Park J, Kahng B, Kim D: Percolation transitions in
- scale-free networks under the Achlioptas process. \emph{Phys Rev Lett}
- 103:135702, 2009.
-}
-\author{Tamas Nepusz \email{ntamas@gmail.com}}
-\examples{
-g <- static.power.law.game(10000, 30000, 2.2, 2.3)
-\dontrun{plot(degree.distribution(g, cumulative=TRUE, mode="out"), log="xy")}
-}
-\keyword{graphs}
- 
-  
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/stochasticMatrix.Rd igraph-0.6.5/interfaces/R/igraph/man/stochasticMatrix.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/stochasticMatrix.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/stochasticMatrix.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-\name{get.stochastic}
-\alias{get.stochastic}
-\title{Stochastic matrix of a graph}
-\description{Retrieves the stochastic matrix of a graph of class
-  \code{igraph}.
-}
-\usage{
-get.stochastic(graph, column.wise = FALSE, sparse =
-      getIgraphOpt("sparsematrices"))
-}
-\arguments{
-  \item{graph}{The input graph. Must be of class \code{igraph}.}
-  \item{column.wise}{If \code{FALSE}, then the rows of the stochastic
-    matrix sum up to one; otherwise it is the columns.}
-  \item{sparse}{Logical scalar, whether to return a sparse matrix. The
-    \code{Matrix} package is needed for sparse matrices.}
-}
-\details{
-  Let \eqn{M} be an \eqn{n \times n}{n x n} adjacency matrix with real
-  non-negative entries. Let us define
-  \eqn{D = \textrm{diag}(\sum_{i}M_{1i}, \dots, \sum_{i}M_{ni})}{%
-    D=diag( sum(M[1,i], i), ..., sum(M[n,i], i) )}
-  
-  The (row) stochastic matrix is defined as
-  \deqn{W = D^{-1}M,}{W = inv(D) M,}
-  where it is assumed that \eqn{D} is non-singular.
-  Column stochastic matrices are defined in a symmetric way.
-}
-
-\value{
- A regular \R matrix or a matrix of class \code{Matrix} if a
- \code{sparse} argument was \code{TRUE}.
-}
-
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{get.adjacency}}}
-\examples{
-## g is a large sparse graph
-g <- barabasi.game(n = 10^5, power = 2, directed = FALSE)
-W <- get.stochastic(g, sparse=TRUE)
-
-## a dense matrix here would probably not fit in the memory
-class(W)
-
-## may not be exactly 1, due to numerical errors
-max(abs(rowSums(W))-1)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/structure.info.Rd igraph-0.6.5/interfaces/R/igraph/man/structure.info.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/structure.info.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/structure.info.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-\name{structure.info}
-\alias{vcount}
-\alias{ecount}
-\alias{neighbors}
-\alias{incident}
-\alias{is.directed}
-\alias{are.connected}
-\alias{get.edge}
-\alias{get.edges}
-\title{Gaining information about graph structure}
-\description{Functions for exploring the basic structure of a network:
-  number of vertices and edges, the neighbors of a node, test whether
-  two vertices are connected by an edge.
-}
-\usage{
-vcount(graph)
-ecount(graph)
-neighbors(graph, v, mode = 1)
-incident(graph, v, mode=c("all", "out", "in", "total"))
-is.directed(graph)
-are.connected(graph, v1, v2)
-get.edge(graph, id)
-get.edges(graph, es)
-}
-\arguments{
-  \item{graph}{The graph.}
-  \item{v}{The vertex of which the adjacent vertices or incident edges
-    are queried.}
-  \item{mode}{Character string, specifying the type of adjacent vertices
-    or incident edges to list in a directed graph. If \dQuote{out}, then
-    only outgoing edges (or their corresponding vertices) are
-    considered; \dQuote{in} considers incoming edges; \sQuote{all}
-    ignores edge directions. This argument is ignored for undirected
-    graphs.}
-  \item{v1}{The id of the first vertex. For directed graphs only edges
-    pointing from \code{v1} to \code{v2} are searched.}
-  \item{v2}{The id of the second vertex. For directed graphs only edges
-    pointing from \code{v1} to \code{v2} are searched.}
-  \item{id}{A numeric edge id.}
-  \item{es}{An edge sequence.}
-}
-\details{
-  These functions provide the basic structural information of a graph.
-
-  \code{vcount} gives the number of vertices in the graph.
-
-  \code{ecount} gives the number of edges in the graph.
-
-  \code{neighbors} gives the neighbors of a vertex. The vertices
-  connected by multiple edges are listed as many times as the number of
-  connecting edges.
-
-  \code{incident} gives the incident edges of a vertex.
-  
-  \code{is.directed} gives whether the graph is directed or not. It just
-  gives its \code{directed} attribute.
-  
-  \code{are.connected} decides whether there is an edge from \code{v1}
-  to \code{v2}. 
-
-  \code{get.edge} returns the end points of the edge with the supplied
-  edge id. For directed graph the source vertex comes first, for
-  undirected graphs, the order is arbitrary.
-
-  \code{get.edges} returns a matrix with the endpoints of the edges in
-  the edge sequence argument. 
-}
-\value{
-  \code{vcount} and \code{ecount} return integer
-  constants. \code{neighbors} returns an integer
-  vector. \code{is.directed} and \code{are.connected} return boolean
-  constants. \code{get.edge} returns a numeric vector of length two.
-  \code{get.edges} returns a two-column matrix.
-}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph}}}
-\examples{
-g <- graph.ring(10)
-vcount(g)
-ecount(g)
-neighbors(g, 5)
-incident(g, 5)
-are.connected(g, 1, 2)
-are.connected(g, 2, 4)
-get.edges(g, 1:6)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/subgraph.Rd igraph-0.6.5/interfaces/R/igraph/man/subgraph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/subgraph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/subgraph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,57 +0,0 @@
-\name{subgraph}
-\alias{subgraph}
-\alias{induced.subgraph}
-\alias{subgraph.edges}
-\concept{Subgraph}
-\title{Subgraph of a graph}
-\description{\code{subgraph} creates a subgraph of a graph, containing
-  only the specified vertices and all the edges among them.}
-\usage{
-induced.subgraph(graph, vids, impl=c("auto", "copy_and_delete",
-     "create_from_scratch"))
-subgraph.edges(graph, eids, delete.vertices = TRUE)
-subgraph(graph, v)
-}
-\arguments{
-  \item{graph}{The original graph.}
-  \item{vids,v}{Numeric vector, the vertices of the original 
-    graph which will form the subgraph.}
-  \item{impl}{Character scalar, to choose between two 
-    implementation of the subgraph
-    calculation. \sQuote{\code{copy_and_delete}} copies the graph
-    first, and then deletes the vertices and edges that are not
-    included in the result graph. \sQuote{\code{create_from_scratch}}
-    searches for all vertices and edges that must be kept and then
-    uses them to create the graph from scratch. \sQuote{\code{auto}}
-    chooses between the two implementations automatically, using
-    heuristics based on the size of the original and the result
-    graph.}
-  \item{eids}{The edge ids of the edges that will be kept in the
-    result graph.}
-  \item{delete.vertices}{Logical scalar, whether to remove vertices
-    that do not have any adjacent edges in \code{eids}.}
-}
-\details{
-  \code{induced.subgraph} calculates the induced subgraph of a set of
-  vertices in a graph. This means that exactly the specified vertices
-  and all the edges between then will be kept in the result graph.
-
-  \code{subgraph.edges} calculates the subgraph of a graph. For this
-  function one can specify the vertices and edges to keep. This
-  function will be renamed to \code{subgraph} in the next major
-  version of igraph.
-
-  The \code{subgraph} function does the same as \code{induced.graph}
-  currently (assuming \sQuote{\code{auto}} as the \code{impl}
-  argument), but it is deprecated and will be removed in the next
-  major version of igraph.
-}
-\value{A new graph object.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso
-\examples{
-g <- graph.ring(10)
-g2 <- induced.subgraph(g, 1:7)
-g3 <- subgraph.edges(g, 1:5, 1:5)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/subgraph.centrality.Rd igraph-0.6.5/interfaces/R/igraph/man/subgraph.centrality.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/subgraph.centrality.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/subgraph.centrality.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-\name{subgraph.centrality}
-\alias{subgraph.centrality}
-\concept{Subgraph centrality}
-\title{Find subgraph centrality scores of network positions}
-\description{Subgraph centrality of a vertex measures the number of
-  subgraphs a vertex participates in, weighting them according to their
-  size.}
-\usage{
-subgraph.centrality (graph, diag=FALSE)
-}
-\arguments{
-  \item{graph}{The input graph, it should be undirected, but the
-    implementation does not check this currently. }
-  \item{diag}{Boolean scalar, whether to include the diagonal of the
-    adjacency matrix in the analysis. Giving \code{FALSE} here
-    effectively eliminates the loops edges from the graph before the
-    calculation.}
-}
-\details{
-  The subgraph centrality of a vertex is defined as the number of closed
-  loops originating at the vertex, where longer loops are exponentially
-  downweighted.
-
-  Currently the calculation is performed by explicitly calculating all
-  eigenvalues and eigenvectors of the adjacency matrix of the
-  graph. This effectively means that the measure can only be calculated
-  for small graphs.
-}
-\value{
-  A numeric vector, the subgraph centrality scores of the vertices.
-}
-\references{
-  Ernesto Estrada, Juan A. Rodriguez-Velazquez: Subgraph centrality in
-  Complex Networks. \emph{Physical Review E} 71, 056103 (2005).
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com} based on the Matlab
-  code by Ernesto Estrada}
-\seealso{\code{\link{evcent}}, \code{\link{page.rank}}}
-\examples{
-g <- ba.game(100, m=4, dir=FALSE)
-sc <- subgraph.centrality(g)
-cor(degree(g), sc)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/tkigraph.Rd igraph-0.6.5/interfaces/R/igraph/man/tkigraph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/tkigraph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/tkigraph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-\name{tkigraph}
-\alias{tkigraph}
-\concept{GUI}
-\title{Experimental basic igraph GUI}
-\description{This functions starts an experimental GUI to some igraph
-  functions. The GUI was written in Tcl/Tk, so it is cross platform.}
-\usage{
-tkigraph()
-}
-%\arguments{}
-\details{
-  \code{tkigraph} has its own online help system, please see that for
-  the details about how to use it.
-}
-\value{Returns \code{NULL}, invisibly.}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{\code{\link{tkplot}} for interactive plotting of graphs.}
-% \examples{}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/tkplot.Rd igraph-0.6.5/interfaces/R/igraph/man/tkplot.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/tkplot.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/tkplot.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,120 +0,0 @@
-\name{tkplot}
-\alias{tkplot}
-\alias{tkplot.close}
-\alias{tkplot.off}
-\alias{tkplot.fit.to.screen}
-\alias{tkplot.reshape}
-\alias{tkplot.export.postscript}
-\alias{tkplot.getcoords}
-\alias{tkplot.center}
-\alias{tkplot.rotate}
-\concept{Visualization}
-\title{Interactive plotting of graphs}
-\description{\code{tkplot} and its companion functions serve as an
-  interactive graph drawing facility. Not all parameters of the plot can
-  be changed interactively right now though, eg. the colors of vertices,
-  edges, and also others have to be pre-defined.}
-\usage{
-tkplot(graph, canvas.width=450, canvas.height=450, \dots)
-
-tkplot.close(tkp.id, window.close = TRUE) 
-tkplot.off()
-tkplot.fit.to.screen(tkp.id, width = NULL, height = NULL)
-tkplot.reshape(tkp.id, newlayout, \dots)
-tkplot.export.postscript(tkp.id)
-tkplot.getcoords(tkp.id, norm = FALSE)
-tkplot.center(tkp.id)
-tkplot.rotate(tkp.id, degree = NULL, rad = NULL)
-}
-\arguments{
-  \item{graph}{The \code{graph} to plot.}
-  \item{canvas.width,canvas.height}{The size of the tkplot
-    drawing area.}
-  \item{tkp.id}{The id of the tkplot window to close/reshape/etc.}
-  \item{window.close}{Leave this on the default value.}
-  \item{width}{The width of the rectangle for generating new
-    coordinates.}
-  \item{height}{The height of the rectangle for generating new
-    coordinates.}
-  \item{newlayout}{The new layout, see the \code{layout} parameter of
-    tkplot.}
-  \item{norm}{Logical, should we norm the coordinates.}
-  \item{degree}{The degree to rotate the plot.}
-  \item{rad}{The degree to rotate the plot, in radian.}
-  \item{\dots}{Additional plotting parameters. See
-    \link{igraph.plotting} for the complete list.}
-}
-\details{
-  \code{tkplot} is an interactive graph drawing facility. It is not very
-  well developed at this stage, but it should be still useful.
-
-  It's handling should be quite straightforward most of the time, here
-  are some remarks and hints.
-
-  There are different popup menus, activated by the right mouse button,
-  for vertices and edges. Both operate on the current selection if the
-  vertex/edge under the cursor is part of the selection and operate on
-  the vertex/edge under the cursor if it is not.
-
-  One selection can be active at a time, either a vertex or an edge
-  selection. A vertex/edge can be added to a selection by holding the
-  \code{control} key while clicking on it with the left mouse
-  button. Doing this again deselect the vertex/edge.
-
-  Selections can be made also from the \code{Select} menu. The `Select
-  some vertices' dialog allows to give an expression for the vertices to
-  be selected: this can be a list of numeric R expessions separated by
-  commas, like `\code{1,2:10,12,14,15}' for example. Similarly in the
-  `Select some edges' dialog two such lists can be given and all edges
-  connecting a vertex in the first list to one in the second list will
-  be selected.
-
-  In the color dialog a color name like 'orange' or RGB notation can
-  also be used.
-
-  The \code{tkplot} command creates a new Tk window with the graphical
-  representation of \code{graph}. The command returns an integer number,
-  the tkplot id. The other commands utilize this id to be able to
-  query or manipulate the plot.
-
-  \code{tkplot.close} closes the Tk plot with id \code{tkp.id}.
-
-  \code{tkplot.off} closes all Tk plots.
-
-  \code{tkplot.fit.to.screen} fits the plot to the given rectange
-  (\code{width} and \code{height}), if some of these are \code{NULL}
-  the actual phisical width od height of the plot window is used.
-
-  \code{tkplot.reshape} applies a new layout to the plot, its optional
-  parameters will be collected to a list analogous to \code{layout.par}.
-
-  \code{tkplot.export.postscript} creates a dialog window for saving the
-  plot in postscript format.
-
-  \code{tkplot.getcoords} returns the coordinates of the vertices in a
-  matrix. Each row corresponds to one vertex.
-
-  \code{tkplot.center} shifts the figure to the center of its plot window.
-
-  \code{tkplot.rotate} rotates the figure, its parameter can be given
-  either in degrees or in radians.
-}
-\value{
-  \code{tkplot} returns an integer, the id of the plot, this can be used
-  to manipulate it from the command line.
-
-  \code{tkplot.getcoords} returns a matrix with the coordinates.
-
-  \code{tkplot.close}, \code{tkplot.off}, \code{tkplot.fit.to.screen},
-  \code{tkplot.reshape}, \code{tkplot.export.postscript},
-  \code{tkplot.center} and \code{tkplot.rotate} return \code{NULL}
-  invisibly. 
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{plot.igraph}}, \code{\link{layout}}}
-\examples{
-g <- graph.ring(10)
-\dontrun{tkplot(g)}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/topological.sort.Rd igraph-0.6.5/interfaces/R/igraph/man/topological.sort.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/topological.sort.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/topological.sort.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-\name{topological.sort}
-\alias{topological.sort}
-\concept{Topological sort}
-\title{Topological sorting of vertices in a graph}
-\description{
-  A topological sorting of a directed acyclic graph is a linear ordering
-  of its nodes where each node comes before all nodes to which it has
-  edges. 
-}
-\usage{
-topological.sort(graph, mode=c("out", "all", "in"))
-}
-\arguments{
-  \item{graph}{The input graph, should be directed}
-  \item{mode}{Specifies how to use the direction of the edges.
-    For \dQuote{\code{out}}, the sorting order ensures that each node comes
-    before all nodes to which it has edges, so nodes with no incoming
-    edges go first. For \dQuote{\code{in}}, it is quite the opposite: each
-    node comes before all nodes from which it receives edges. Nodes 
-    with no outgoing edges go first.}
-}
-\details{
-  Every DAG has at least one topological sort, and may have many.
-  This function returns a possible topological sort among them. If the
-  graph is not acyclic (it has at least one cycle), a partial topological
-  sort is returned and a warning is issued.}
-\value{
-  A numeric vector containing vertex ids in topologically sorted order.
-}
-%\references{
-%}
-\author{Tamas Nepusz \email{ntamas@gmail.com} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R interface} 
-%\seealso{}
-\examples{
-g <- barabasi.game(100)
-topological.sort(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/traits.Rd igraph-0.6.5/interfaces/R/igraph/man/traits.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/traits.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/traits.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-\name{traits}
-\alias{callaway.traits.game}
-\alias{establishment.game}
-\title{Graph generation based on different vertex types}
-\description{These functions implement evolving network models based on
-  different vertex types.
-}
-\usage{
-callaway.traits.game (nodes, types, edge.per.step = 1, type.dist = rep(1, 
-    types), pref.matrix = matrix(1, types, types), directed = FALSE)
-establishment.game(nodes, types, k = 1, type.dist = rep(1, types),
-    pref.matrix = matrix(1, types, types), directed = FALSE)
-}
-\arguments{
-  \item{nodes}{The number of vertices in the graph.}
-  \item{types}{The number of different vertex types.}
-  \item{edge.per.step}{The number of edges to add to the graph per time step.}
-  \item{type.dist}{The distribution of the vertex types. This is assumed
-    to be stationary in time.}
-  \item{pref.matrix}{A matrix giving the preferences of the given vertex
-    types. These should be probabilities, ie. numbers between zero and
-    one.}
-  \item{directed}{Logical constant, whether to generate directed
-    graphs.}
-  \item{k}{The number of trials per time step, see details below.}
-}
-\details{
-  For \code{callaway.traits.game} the simulation goes like this: in each
-  discrete time step a new vertex is added to the graph. The type of
-  this vertex is generated based on \code{type.dist}. Then two vertices are
-  selected uniformly randomly from the graph. The probability that they
-  will be connected depends on the types of these vertices and is taken
-  from \code{pref.matrix}. Then another two vertices are selected and
-  this is repeated \code{edges.per.step} times in each time step.
-
-  For \code{establishment.game} the simulation goes like this: a single
-  vertex is added at each time step. This new vertex tries to connect to
-  \code{k} vertices in the graph. The probability that such a connection is
-  realized depends on the types of the vertices involved and is taken
-  from \code{pref.matrix}.
-}
-\value{
-  A new graph object.
-}
-% \references{}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-# two types of vertices, they like only themselves
-g1 <- callaway.traits.game(1000, 2, pref.matrix=matrix( c(1,0,0,1), nc=2))
-g2 <- establishment.game(1000, 2, k=2, pref.matrix=matrix( c(1,0,0,1), nc=2))
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/transitivity.Rd igraph-0.6.5/interfaces/R/igraph/man/transitivity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/transitivity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/transitivity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,124 +0,0 @@
-\name{transitivity}
-\alias{transitivity}
-\concept{Transitivity}
-\concept{Clustering coefficient}
-\title{Transitivity of a graph}
-\description{Transitivity measures the probability that the adjacent
-  vertices of a vertex are connected. This is sometimes also called the
-  clustering coefficient. }
-\usage{
-transitivity(graph, type=c("undirected", "global", "globalundirected",
-       "localundirected", "local", "average", "localaverage",
-       "localaverageundirected", "barrat", "weighted"), vids=NULL,
-       weights=NULL, isolates=c("NaN", "zero"))
-}
-\arguments{
-  \item{graph}{The graph to analyze.}
-  \item{type}{The type of the transitivity to calculate. Possible
-    values:
-    \describe{
-      \item{\code{global}}{The global transitivity of an
-	undirected graph (directed graphs are considered as undirected ones
-	as well). This is simply the ratio of the triangles and the
-	connected triples in the graph. For directed graph the direction
-	of the edges is ignored. }
-      \item{\code{local}}{The local transitivity of an undirected graph,
-	this is calculated for each vertex given in the \code{vids}
-	argument. The local transitivity of a vertex is the ratio of the
-	triangles connected to the vertex and the triples centered on
-	the vertex. For directed graph the direction of the edges is
-	ignored. }
-      \item{\code{undirected}}{This is the same as \code{global}.}
-      \item{\code{globalundirected}}{This is the same as \code{global}.}
-      \item{\code{localundirected}}{This is the same as \code{local}.}
-      \item{\code{barrat}}{The weighted transitivity as defined
-	A. Barrat. See details below.}
-      \item{\code{weighted}}{The same as \code{barrat}.}
-    }
-  }
-  \item{vids}{The vertex ids for the local transitivity will be
-    calculated. This will be ignored for global transitivity types.
-    The default value is \code{NULL}, in this case all vertices are
-    considered. It is slightly faster to supply \code{NULL} here than
-    \code{V(graph)}.    
-  }
-  \item{weights}{Optional weights for weighted transitivity. It is
-    ignored for other transitivity measures. If it is \code{NULL} (the
-    default) and the graph has a \code{weight} edge attribute, then it
-    is used automatically.
-  }
-  \item{isolates}{Character scalar, defines how to treat vertices with
-    degree zero and one. If it is \sQuote{\code{NaN}} then they local
-    transitivity is reported as \code{NaN} and they are not included in
-    the averaging, for the transitivity types that calculate an
-    average. If there are no vertices with degree
-    two or higher, then the averaging will still result \code{NaN}. If
-    it is \sQuote{\code{zero}}, then we report 0 transitivity for them,
-    and they are included in the averaging, if an average is
-    calculated.
-  }
-}
-\details{
-   Note that there are essentially two classes of transitivity measures,
-   one is a vertex-level, the other a graph level property.
-
-   There are several generalizations of transitivity to weighted graphs,
-   here we use the definition by A. Barrat, this is a local vertex-level
-   quantity, its formula is
-
-   \deqn{C_i^w=\frac{1}{s_i(k_i-1)}\sum_{j,h}\frac{w_{ij}+w_{ih}}{2}a_{ij}a_{ih}a_{jh}}{
-     weighted C_i = 1/s_i 1/(k_i-1) sum( (w_ij+w_ih)/2 a_ij a_ih a_jh, j, h)}
-
-   \eqn{s_i}{s_i} is the strength of vertex \eqn{i}{i}, see
-   \code{\link{graph.strength}}, \eqn{a_{ij}}{a_ij} are elements of the
-   adjacency matrix, \eqn{k_i}{k_i} is the vertex degree,
-   \eqn{w_{ij}}{w_ij} are the weights.
-   
-   This formula gives back the normal not-weighted local transitivity if
-   all the edge weights are the same.
-
-   The \code{barrat} type of transitivity does not work for graphs with
-   multiple and/or loop edges. If you want to calculate it for a
-   directed graph, call \code{\link{as.undirected}} with the
-   \code{collapse} mode first.
-}
-\value{
-  For \sQuote{\code{global}} a single number, or \code{NaN} if there are no
-  connected triples in the graph.
-
-  For \sQuote{\code{local}} a vector of transitivity scores, one for
-  each vertex in \sQuote{\code{vids}}.
-}
-\references{ Wasserman, S., and Faust, K. (1994). \emph{Social Network
-    Analysis: Methods and Applications.} Cambridge: Cambridge University
-  Press.
-
-  Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, Alessandro
-  Vespignani: The architecture of complex weighted networks,
-  Proc. Natl. Acad. Sci. USA 101, 3747 (2004)
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.ring(10)
-transitivity(g)
-g2 <- erdos.renyi.game(1000, 10/1000)
-transitivity(g2)   # this is about 10/1000
-
-# Weighted version, the figure from the Barrat paper
-gw <- graph.formula(A-B:C:D:E, B-C:D, C-D)
-E(gw)$weight <- 1
-E(gw)[ V(gw)[name == "A"] \%--\% V(gw)[name == "E" ] ]$weight <- 5
-transitivity(gw, vids="A", type="local")
-transitivity(gw, vids="A", type="weighted")
-
-# Weighted reduces to "local" if weights are the same
-gw2 <- erdos.renyi.game(1000, 10/1000)
-E(gw2)$weight <- 1
-t1 <- transitivity(gw2, type="local")
-t2 <- transitivity(gw2, type="weighted")
-all(is.na(t1) == is.na(t2))
-all(na.omit(t1 == t2))
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/triad.census.Rd igraph-0.6.5/interfaces/R/igraph/man/triad.census.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/triad.census.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/triad.census.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-\name{triad.census}
-\alias{triad.census}
-\concept{Triad census}
-\title{Triad census, subgraphs with three vertices}
-\description{This function counts the different subgraphs of three
-  vertices in a graph.}
-\usage{
-triad.census(graph)
-}
-\arguments{
-  \item{graph}{The input graph, it should be directed. An undirected
-    graph results a warning, and undefined results.}
-}
-\details{
-  Triad census was defined by David and Leinhardt (see References
-  below). Every triple of vertices (A, B, C) are classified into the 16
-  possible states:
-  \describe{
-    \item{003}{A,B,C, the empty graph.}
-    \item{012}{A->B, C, the graph with a single directed edge.}
-    \item{102}{A<->B, C, the graph with a mutual connection between two
-      vertices.}
-    \item{021D}{A<-B->C, the out-star.}
-    \item{021U}{A->B<-C, the in-star.}
-    \item{021C}{A->B->C, directed line.}
-    \item{111D}{A<->B<-C.}
-    \item{111U}{A<->B->C.}
-    \item{030T}{A->B<-C, A->C.}
-    \item{030C}{A<-B<-C, A->C.}
-    \item{201}{A<->B<->C.}
-    \item{120D}{A<-B->C, A<->C.}
-    \item{120U}{A->B<-C, A<->C.}
-    \item{120C}{A->B->C, A<->C.}
-    \item{210}{A->B<->C, A<->C.}
-    \item{300}{A<->B<->C, A<->C, the complete graph.}
-  }
-
-  This functions uses the RANDESU motif finder algorithm to find and
-  count the subgraphs, see \code{\link{graph.motifs}}. 
-}
-\value{A numeric vector, the subgraph counts, in the order given in the
-  above description.}
-\references{
-  See also Davis, J.A. and Leinhardt, S.  (1972).  The Structure of
-  Positive Interpersonal Relations in Small Groups.  In J. Berger
-  (Ed.), Sociological Theories in Progress, Volume 2, 218-251. 
-  Boston: Houghton Mifflin.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{dyad.census}} for classifying binary relationships,
-  \code{\link{graph.motifs}} for the underlying implementation.}
-\examples{
-g <- erdos.renyi.game(15, 45, type="gnm", dir=TRUE)
-triad.census(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/undocumented.Rd igraph-0.6.5/interfaces/R/igraph/man/undocumented.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/undocumented.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/undocumented.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-\name{igraph.undocumented}
-\alias{cited.type.game}
-\alias{citing.cited.type.game}
-\alias{lastcit.game}
-\title{Undocumented and unsupportted igraph functions}
-\description{These functions are still in the alpha stage or
-  their arguments are expected to change, so they're not documented yet.
-  They are also not very useful for the general audience.
-}
-\usage{
-lastcit.game(n, edges=1, agebins=n/7100, pref=(1:(agebins+1))^-3,
-     directed=TRUE)
-cited.type.game(n, edges=1, types=rep(0, n),
-     pref=rep(1, length(types)),
-     directed=TRUE, attr=TRUE)
-citing.cited.type.game(n, edges=1, types=rep(0, n),
-    pref=matrix(1, nrow=length(types), ncol=length(types)),
-    directed=TRUE, attr=TRUE)
-}
-\arguments{
-  \item{n}{Number of vertices.}
-  \item{edges}{Number of edges per step.}
-  \item{agebins}{Number of aging bins.}
-  \item{pref}{Vector (\code{lastcit.game} and \code{cited.type.game} or
-    matrix (\code{citing.cited.type.game}) giving the (unnormalized)
-    citation probabilities for the different vertex types.} 
-  \item{directed}{Logical scalar, whether to generate directed
-    networks.}
-  \item{types}{Vector of length \sQuote{\code{n}}, the types of the
-    vertices. Types are numbered from zero.}
-  \item{attr}{Logical scalar, whether to add the vertex types to the
-    generated graph as a vertex attribute called \sQuote{\code{type}}. }
-}
-%\details{}
-\value{A new graph.}
-%\references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-%\seealso{}
-%\examples{}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/unfold.tree.Rd igraph-0.6.5/interfaces/R/igraph/man/unfold.tree.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/unfold.tree.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/unfold.tree.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-\name{unfold.tree}
-\alias{unfold.tree}
-\concept{Tree}
-\concept{Forest}
-\concept{Breadth-first search}
-\title{Convert a general graph into a forest}
-\description{
-Perform a breadth-first search on a graph and convert it into a tree or
-forest by replicating vertices that were found more than once.
-}
-\usage{
-unfold.tree(graph, mode = c("all", "out", "in", "total"), roots) 
-}
-\arguments{
-  \item{graph}{The input graph, it can be either directed or
-    undirected.}
-  \item{mode}{Character string, defined the types of the paths used for
-    the breadth-first search. \dQuote{out} follows the outgoing,
-    \dQuote{in} the incoming edges, \dQuote{all} and \dQuote{total} both
-    of them. This argument is ignored for undirected graphs.}
-  \item{roots}{A vector giving the vertices from which the breadth-first
-    search is performed. Typically it contains one vertex per component.}
-}
-\details{
-  A forest is a graph, whose components are trees.
-  
-  The \code{roots} vector can be calculated by simply doing a
-  topological sort in all components of the graph, see the examples
-  below.
-}
-\value{
-  A list with two components:
-  \item{tree}{The result, an \code{igraph} object, a tree or a forest.}
-  \item{vertex_index}{A numeric vector, it gives a mapping from the
-    vertices of the new graph to the vertices of the old graph.}
-}
-% \references{}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-% \seealso{}
-\examples{
-g <- graph.tree(10) %du% graph.tree(10)
-V(g)$id <- seq_len(vcount(g))-1
-roots <- sapply(decompose.graph(g), function(x) {
-            V(x)$id[ topological.sort(x)[1]+1 ] })
-tree <- unfold.tree(g, roots=roots)
-}
-\keyword{graphs}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/vertex.connectivity.Rd igraph-0.6.5/interfaces/R/igraph/man/vertex.connectivity.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/vertex.connectivity.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/vertex.connectivity.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-\name{vertex.connectivity}
-\alias{vertex.connectivity}
-\alias{vertex.disjoint.paths}
-\alias{graph.cohesion}
-\concept{Vertex connectivity}
-\concept{Vertex-disjoint paths}
-\concept{Graph cohesion}
-\title{Vertex connectivity.}
-\description{The vertex connectivity of a graph or two vertices, this is
-  recently also called group cohesion.}
-\usage{
-vertex.connectivity(graph, source=NULL, target=NULL, checks=TRUE)
-vertex.disjoint.paths(graph, source, target)
-graph.cohesion(graph, checks=TRUE)
-}
-\arguments{
-  \item{graph}{The input graph.}
-  \item{source}{The id of the source vertex, for
-    \code{vertex.connectivity} it can be \code{NULL}, see details
-    below.}
-  \item{target}{The id of the target vertex, for
-    \code{vertex.connectivity} it can be \code{NULL}, see details
-    below.}
-  \item{checks}{Logical constant. Whether to check that the graph is
-    connected and also the degree of the vertices. If the graph is
-    not (strongly) connected then the connectivity is obviously zero. Otherwise
-    if the minimum degree is one then the vertex connectivity is also
-    one. It is a good idea to perform these checks, as they can be
-    done quickly compared to the connectivity calculation itself. 
-    They were suggested by Peter McMahan, thanks Peter.}
-}
-\details{
-  The vertex connectivity of two vertices (\code{source} and
-  \code{target}) in a directed graph is the minimum number of vertices
-  needed to remove from the graph to eliminate all (directed) paths from
-  \code{source} to \code{target}. \code{vertex.connectivity} 
-  calculates this quantity if both the \code{source} and \code{target}
-  arguments are given and they're not \code{NULL}.
-
-  The vertex connectivity of a graph is the minimum vertex connectivity
-  of all (ordered) pairs of vertices in the graph. In other words this
-  is the minimum number of vertices needed to remove to make the graph
-  not strongly connected. (If the graph is not strongly connected then
-  this is zero.) \code{vertex.connectivity} calculates this quantitty if
-  neither the \code{source} nor \code{target} arguments are
-  given. (Ie. they are both \code{NULL}.)
-
-  A set of vertex disjoint directed paths from \code{source} to \code{vertex}
-  is a set of directed paths between them whose vertices do not contain common
-  vertices (apart from \code{source} and \code{target}). The maximum number of
-  vertex disjoint paths between two vertices is the same as their vertex
-  connectivity in most cases (if the two vertices are not connected by an edge).
-
-  The cohesion of a graph (as defined by White and Harary, see
-  references), is the vertex connectivity of the graph. This is
-  calculated by \code{graph.cohesion}.
-
-  These three functions essentially calculate the same measure(s), more
-  precisely \code{vertex.connectivity} is the most general, the other
-  two are included only for the ease of using more descriptive function
-  names.
-}
-\value{
-  A scalar real value.
-}
-\references{White, Douglas R and Frank Harary 2001. The Cohesiveness of
-  Blocks In Social Networks: Node Connectivity and Conditional Density.
-  \emph{Sociological Methodology} 31 (1) : 305-359.}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.maxflow}}, \code{\link{edge.connectivity}},
-  \code{\link{edge.disjoint.paths}}, \code{\link{graph.adhesion}}}
-\examples{
-g <- barabasi.game(100, m=1)
-g <- delete.edges(g, E(g)[ 100 \%--\% 1 ])
-g2 <- barabasi.game(100, m=5)
-g2 <- delete.edges(g2, E(g2)[ 100 \%--\% 1])
-vertex.connectivity(g, 100, 1)
-vertex.connectivity(g2, 100, 1)
-vertex.disjoint.paths(g2, 100, 1)
-
-g <- erdos.renyi.game(50, 5/50)
-g <- as.directed(g)
-g <- induced.subgraph(g, subcomponent(g, 1))
-graph.cohesion(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/vertex.shape.pie.Rd igraph-0.6.5/interfaces/R/igraph/man/vertex.shape.pie.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/vertex.shape.pie.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/vertex.shape.pie.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-\name{Pie charts as vertices}
-\alias{vertex.shape.pie}
-\concept{Vertex shapes}
-\title{Using pie charts as vertices in graph plots}
-\description{
-  More complex vertex images can be used to express addtional
-  information about vertices. E.g. pie charts can be used as vertices,
-  to denote vertex classes, fuzzy classification of vertices, etc.
-}
-\details{
-  The vertex shape \sQuote{pie} makes igraph draw a pie chart for every
-  vertex. There are some extra graphical vertex parameters that specify
-  how the pie charts will look like:
-  \describe{
-    \item{pie}{Numeric vector, gives the sizes of the pie slices.}
-    \item{pie.color}{A list of color vectors to use for the pies. If it
-      is a list of a single vector, then this is used for all pies. It
-      the color vector is shorter than the number of areas in a pie,
-      then it is recycled.}
-    \item{pie.border}{The color of the border line of the pie charts, in
-      the same format as \code{pie.color}.}
-    \item{pie.angle}{The slope of shading lines, given as an angle in
-      degrees (counter-clockwise).}
-    \item{pie.density}{The density of the shading lines, in lines per
-      inch. Non-positive values inhibit the drawing of shading lines.}
-    \item{pie.lty}{The line type of the border of the slices.}
-  }
-}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com} }
-\seealso{ \code{\link{igraph.plotting}}, \code{\link{plot.igraph}} }
-\examples{
-g <- graph.ring(10)
-values <- lapply(1:10, function(x) sample(1:10,3))
-if (interactive()) {
-  plot(g, vertex.shape="pie", vertex.pie=values,
-       vertex.pie.color=list(heat.colors(5)),
-       vertex.size=seq(10,30,length=10), vertex.label=NA)
-}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/walktrap.community.Rd igraph-0.6.5/interfaces/R/igraph/man/walktrap.community.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/walktrap.community.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/walktrap.community.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-\name{walktrap.community}
-\alias{walktrap.community}
-\concept{Random walk}
-\concept{Community structure}
-\title{Community strucure via short random walks}
-\description{This function tries to find densely connected subgraphs,
-  also called communities in a graph via random walks. The idea is that
-  short random walks tend to stay in the same community.
-}
-\usage{
-walktrap.community(graph, weights = E(graph)$weight, steps = 4, merges =
-          TRUE, modularity = TRUE, membership = TRUE)
-}
-\arguments{
-  \item{graph}{The input graph, edge directions are ignored in directed
-    graphs.}
-  \item{weights}{The edge weights.}
-  \item{steps}{The length of the random walks to perform.}
-  \item{merges}{Logical scalar, whether to include the merge matrix in
-    the result.}
-  \item{modularity}{Logical scalar, whether to include the vector of the
-    modularity scores in the result. If the \code{membership} argument
-    is true, then it will be always calculated.}
-  \item{membership}{Logical scalar, whether to calculate the membership
-    vector for the split corresponding to the highest modularity value.}
-}
-\details{
-  This function is the implementation of the Walktrap community
-  finding algorithm, see Pascal Pons, Matthieu Latapy: Computing
-  communities in large networks using random walks, 
-  http://arxiv.org/abs/physics/0512106
-}
-\value{
-  \code{walktrap.community} returns a \code{\link{communities}}
-  object, please see the \code{\link{communities}} manual page for
-  details.
-}
-\references{Pascal Pons, Matthieu Latapy: Computing
-  communities in large networks using random walks, 
-  http://arxiv.org/abs/physics/0512106
-}
-\author{Pascal Pons \email{google@for.it} and Gabor Csardi
-  \email{csardi.gabor@gmail.com} for the R and igraph interface}
-\seealso{
-  See \code{\link{communities}} on getting the actual membership vector,
-  merge matrix, modularity score, etc.
-  
-  \code{\link{modularity}} and 
-  \code{\link{fastgreedy.community}},
-  \code{\link{spinglass.community}},
-  \code{\link{leading.eigenvector.community}},
-  \code{\link{edge.betweenness.community}} for other community detection
-  methods.
-}
-\examples{
-g <- graph.full(5) \%du\% graph.full(5) \%du\% graph.full(5)
-g <- add.edges(g, c(1,6, 1,11, 6, 11))
-walktrap.community(g)
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/watts.strogatz.game.Rd igraph-0.6.5/interfaces/R/igraph/man/watts.strogatz.game.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/watts.strogatz.game.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/watts.strogatz.game.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-\name{watts.strogatz.game}
-\alias{watts.strogatz.game}
-\concept{Small-world model}
-\concept{Watts-strogatz model}
-\title{The Watts-Strogatz small-world model}
-\description{Generate a graph according to the Watts-Strogatz network
-  model.}
-\usage{
-watts.strogatz.game(dim, size, nei, p, loops = FALSE, multiple = FALSE)
-}
-\arguments{
-  \item{dim}{Integer constant, the dimension of the starting lattice.}
-  \item{size}{Integer constant, the size of the lattice along each
-    dimension.}
-  \item{nei}{Integer constant, the neighborhood within which the
-    vertices of the lattice will be connected.}
-  \item{p}{Real constant between zero and one, the rewiring
-    probability. }
-  \item{loops}{Logical scalar, whether loops edges are allowed in the
-    generated graph.}
-  \item{multiple}{Logical scalar, whether multiple edges are allowed
-    int the generated graph.}
-}
-\details{
-  First a lattice is created with the given \code{dim}, \code{size} and
-  \code{nei} arguments. Then the edges of the lattice are rewired
-  uniformly randomly with probability \code{p}.
-
-  Note that this function might create graphs with loops and/or multiple
-  edges. You can use \code{\link{simplify}} to get rid of these.
-}
-\value{A graph object.}
-\references{
-  Duncan J Watts and Steven H Strogatz: Collective dynamics of
-  \sQuote{small world} networks, Nature 393, 440-442, 1998.
-}
-\author{ Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{\code{\link{graph.lattice}}, \code{\link{rewire.edges}}}
-\examples{
-g <- watts.strogatz.game(1, 100, 5, 0.05)
-average.path.length(g)
-transitivity(g, type="average")
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraph/man/write.graph.Rd igraph-0.6.5/interfaces/R/igraph/man/write.graph.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraph/man/write.graph.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraph/man/write.graph.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,182 +0,0 @@
-\name{write.graph}
-\alias{write.graph}
-\title{Writing the graph to a file in some format}
-\description{\code{write.graph} is a general function for exporting
-  graphs to foreign file formats, however not many formats are
-  implemented right now.}
-\usage{
-write.graph(graph, file, format=c("edgelist", "pajek", "ncol",
-       "lgl", "graphml", "dimacs", "gml", "dot", "leda"), \dots)
-}
-\arguments{
-  \item{graph}{The graph to export.}
-  \item{file}{A connection or a string giving the file name to write the
-    graph to.}
-  \item{format}{Character string giving the file format. Right now 
-    \code{pajek}, \code{graphml}, \code{dot},
-    \code{gml}, \code{edgelist}, \code{lgl},
-    \code{ncol} and \code{dimacs} are implemented. As of igraph 0.4 this
-    argument is case insensitive.
-  }
-  \item{\dots}{Other, format specific arguments, see below.}
-}
-\section{Edge list format}{
-  The \code{edgelist} format is a simple text file, with one edge in a
-  line, the two vertex ids separated by a space character. The file is
-  sorted by the first and the second column. This format has no
-  additional arguments.
-}
-\section{Pajek format}{
-  The Pajek format is a text file, see \code{\link{read.graph}} for
-  details. Appropriate vertex and edge attributes are also written to
-  the file. This format has no additional arguments.
-}
-\section{GraphML format}{
-  The GraphML format is a flexible XML based format. See
-  \code{\link{read.graph}} for GraphML details. Vertex and edge
-  attributes are also written to the file. This format has no additional
-  arguments.
-}
-\section{Dot format}{
-  The dot format is used by the popular GraphViz program. Vertex and
-  edge attributes are written to the file. There are no additional
-  arguments for this format.
-}
-\section{LGL format}{
-  The \code{lgl} format is also a simple text file, this is the
-  format expected by the 'Large Graph Layout' layout generator software.
-  See \link{read.graph} for details.
-  Additional arguments:
-  \describe{
-    \item{names}{If you want to write symbolic vertex names instead of
-      vertex ids, supply the name of the vertex attribute containing the
-      symbolic names here. By default the \sQuote{name} attribute is
-      used if there is one. Supply \code{NULL} if you want to use numeric 
-      vertex ids even if there is a \sQuote{name} vertex attribute.} 
-    \item{weights}{If you want to write edge weights to the file, supply
-      the name of the edge attribute here. By defaults the vertex
-      attribute \sQuote{weights} are used if they are installed.
-      Supply \code{NULL} here if you want to omit the weights.}
-    \item{isolates}{Logical, if \code{TRUE} the isolate vertices are
-      also written to the file, they are omitted by default.}
-  }
-}
-\section{NCOL format}{
-  The \code{ncol} format is also used by LGL, it is a text file, see
-  \link{read.graph} for details.
-  Additional arguments:
-  \describe{
-    \item{names}{If you want to write symbolic vertex names instead of
-      vertex ids, supply the name of the vertex attribute containing the
-      symbolic names here. By default the \sQuote{name} attribute is
-      used if there is one. Supply \code{NULL} if you want to use numeric 
-      vertex ids even if there is a \sQuote{name} vertex attribute.} 
-    \item{weights}{If you want to write edge weights to the file, supply
-      the name of the edge attribute here. By defaults the vertex
-      attribute \sQuote{weights} are used if they are installed.
-      Supply \code{NULL} here if you want to omit the weights.}
-  }
-}
-\section{Dimacs format}{
-  The \code{dimacs} file format, more specifically the 
-  version for network flow problems, see the files at
-  \url{ftp://dimacs.rutgers.edu/pub/netflow/general-info/}
-  
-  This is a line-oriented text file (ASCII) format. The first
-  character of each line defines the type of the line. If the first
-  character is \code{c} the line is a comment line and it is
-  ignored. There is one problem line (\code{p} in the file, it
-  must appear before any node and arc descriptor lines. The problem
-  line has three fields separated by spaces: the problem type
-  (\code{min}, \code{max} or \code{asn}), the
-  number of vertices and number of edges in the graph.
-  Exactly two node identification lines are expected
-  (\code{n}), one for the source, one for the target vertex.
-  These have two fields: the id of the vertex and the type of the
-  vertex, either \code{s} (=source) or \code{t}
-  (=target). Arc lines start with \code{a} and have three
-  fields: the source vertex, the target vertex and the edge capacity.
-  
-  Vertex ids are numbered from 1.
-  
-  Additional arguments:
-  \describe{
-    \item{source}{The id of the source vertex, if \code{NULL} (the
-      default) then it is taken from the \code{source} graph attribute.}
-    \item{target}{The id of the target vertex, if \code{NULL} (the
-      default) then it is taken from the \code{target} graph attribute.}
-    \item{capacity}{A numeric vector giving the edge capacities. If
-      \code{NULL} (the default) then it is taken from the
-      \code{capacity} edge attribute.}
-  }
-}
-\section{GML file format}{
-  GML is a quite general textual format, see 
-  \url{http://www.infosun.fim.uni-passau.de/Graphlet/GML/} for details.
- 
-  The graph, vertex and edges attributes are written to the
-  file as well, if they are numeric of string.
- 
-  As igraph is more forgiving about attribute names, it might 
-  be neccessary to simplify the them before writing to the GML file.
-  This way we'll have a syntactically correct GML file. The following 
-  simple procedure is performed on each attribute name: first the alphanumeric 
-  characters are extracted, the others are ignored. Then if the first character
-  is not a letter then the attribute name is prefixed with <quote>igraph</quote>.
-  Note that this might result identical names for two attributes, igraph 
-  does not check this. 
- 
-  The \dQuote{id} vertex attribute is treated specially. 
-  If the \code{id} argument is not \code{NULL} then it should be a numeric 
-  vector with the vertex ids and the \dQuote{id} vertex attribute is 
-  ignored (if there is one). If \code{id} is 0 and there is a 
-  numeric \code{id} vertex attribute that is used instead. If ids
-  are not specified in either way then the regular igraph vertex ids are used.
- 
-  Note that whichever way vertex ids are specified, their 
-  uniqueness is not checked.
- 
-  If the graph has edge attributes named \dQuote{source}
-  or \dQuote{target} they're silently ignored. GML uses these attributes
-  to specify the edges, so we cannot write them to the file. Rename them 
-  before calling this function if you want to preserve them.
-
-  Additional arguments:
-  \describe{
-    \item{id}{\code{NULL} or a numeric vector giving the vertex ids. See
-      details above.}
-    \item{creator}{A character scalar to be added to the
-      \dQuote{Creator} line in the GML file. If this is \code{NULL} (the
-      default) then the current date and time is added.}
-  }
-}
-\section{LEDA file format}{
-  LEDA is a library for efficient data types and algorithms. 
-  The support for the LEDA format is very basic at the moment; igraph
-  writes only the LEDA graph section which supports one selected vertex
-  and edge attribute and no layout information or visual attributes.
-  See
-  \url{http://www.algorithmic-solutions.info/leda_guide/graphs/leda_native_graph_fileformat.html}
-  for the details of this format.
-
-  Additional arguments:
-  \describe{
-    \item{vertex.attr}{The name of the vertex attribute whose values
-      are to be stored in the output or \code{NULL} if no vertex
-      attribute has to be stored.} 
-    \item{edge.attr}{The name of the edge attribute whose values
-      are to be stored in the output or \code{NULL} if no edge attribute
-      has to be stored.}
-  }
-}
-\value{A NULL, invisibly.}
-\references{Adai AT, Date SV, Wieland S, Marcotte EM. LGL: creating a
-  map of protein function with an algorithm for visualizing very large
-  biological networks. \emph{J Mol Biol.} 2004 Jun 25;340(1):179-90.}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\seealso{ \code{\link{read.graph}} }
-\examples{
-g <- graph.ring(10)
-\dontrun{write.graph(g, "/tmp/g.txt", "edgelist")}
-}
-\keyword{graphs}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/DESCRIPTION igraph-0.6.5/interfaces/R/igraphdata/DESCRIPTION
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/DESCRIPTION	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/DESCRIPTION	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-Package: igraphdata
-Version: 0.1-1
-Date: 2013-01-05
-Title: A collection of network data sets for the igraph package
-Author: Gabor Csardi <csardi.gabor@gmail.com>
-Maintainer: Gabor Csardi <csardi.gabor@gmail.com>
-Depends: R (>= 2.10)
-Suggests: igraph0, igraph
-Description: A small collection of various network data sets, 
-  to use with the igraph package. They also work with the igraph0 
-  package.
-License: CC BY-SA 2.0 + file LICENSE
-URL: http://igraph.sourceforge.net
-BugReports: http://bugs.launchpad.net/igraph
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/LICENSE igraph-0.6.5/interfaces/R/igraphdata/LICENSE
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/LICENSE	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/LICENSE	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-This files lists the copyright holders and licenses (if known) of the
-various data sets in the igraphdata package:
-
-Koenigsberg
------------
-
-This data set was collected from Public Domain sources, and it is 
-int the Public Domain itself.
-
-Please cite the following publication if you use this data set:
-
-Euler, L.: Solutio problematis ad geometriam situs pertinentis.
-Commentarii academiae scientiarum Petropolitanae, 128-140, 1741.
-
-
-UKfaculty
----------
-
-This dataset is licensed under a Creative Commons
-Attribution-Share Alike 2.0 UK: England & Wales License, 
-see http://creativecommons.org/licenses/by-sa/2.0/uk/ for details.
-
-Please cite the following reference if you use this dataset:
-
-Nepusz T., Petróczi A., Négyessy L., Bazsó F.: Fuzzy communities and
-the concept of bridgeness in complex networks. Physical Review E
-77:016107, 2008.
-
-USairports
-----------
-
-The data is from the Research and Innovative Technology Administration, 
-and it is in the Public Domain.
-
-foodwebs
---------
-
-The data was downloaded from 
-http://vlado.fmf.uni-lj.si/pub/networks/data/bio/foodweb/foodweb.htm
-Please see the manual page of the data set for the publications 
-that you should cite, if you use some of this data.
-
-immuno
-------
-
-The data was collected by David Gfeller. Please cite his PhD thesis if 
-you use this data set:
-
-D. Gfeller, Simplifying complex networks: from a clustering to a
-coarse graining strategy, \emph{PhD Thesis EPFL}, no 3888, 2007.
-http://library.epfl.ch/theses/?nr=3888
-
-karate
-------
-
-The data was extracted from the original publication.
-Please cite:
-
-Wayne W. Zachary. An Information Flow Model for Conflict and
-Fission in Small Groups. Journal of Anthropological Research
-Vol. 33, No. 4 452-473
-
-macaque
--------
-
-This dataset is licensed under a Creative Commons
-Attribution-Share Alike 2.0 UK: England & Wales License, 
-see http://creativecommons.org/licenses/by-sa/2.0/uk/ for details.
-
-Please cite the following reference if you use this dataset:
-
-Négyessy L., Nepusz T., Kocsis L., Bazsó F.: Prediction of the main
-cortical areas and connections involved in the tactile function of the
-visual cortex by network analysis. European Journal of Neuroscience
-23(7):1919–1930, 2006. 
-
-yeast
------
-
-The data was downloaded from 
-http://www.nature.com/nature/journal/v417/n6887/suppinfo/nature750.html
-
-Please cite the following paper if you use this data set:
-
-Comparative assessment of large-scale data sets of protein-protein
-interactions. Christian von Mering, Roland Krause, Berend Snel,
-Michael Cornell, Stephen G. Oliver, Stanley Fields and Peer Bork.
-Nature 417, 399-403 (2002)
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/Koenigsberg.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/Koenigsberg.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/UKfaculty.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/UKfaculty.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/USairports.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/USairports.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/foodwebs.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/foodwebs.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/immuno.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/immuno.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/karate.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/karate.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/macaque.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/macaque.rda differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/igraphdata/data/yeast.rda and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/igraphdata/data/yeast.rda differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/inst/CITATION igraph-0.6.5/interfaces/R/igraphdata/inst/CITATION
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/inst/CITATION	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/inst/CITATION	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-citHeader("To cite package 'igraphdata' in publications use
-the reference below. Please don't forget to also cite the
-paper(s) given at the manual pages of the individual data set(s).")
-     
-desc <- packageDescription("igraphdata")
-year <- sub(".*(2[[:digit:]]{3})-.*", "\\1", desc$Date)
-vers <- paste("R package version", desc$Version)
-     
-citEntry(entry="Manual",
-         title = "igraphdata: a collection of network data sets for the igraph package",
-         author = personList(as.person("Gabor Csardi")),
-         year = year,
-         note = vers,
-         
-         textVersion =
-         paste("Gabor Csardi (",
-               year,
-               "). igraphdata: a collection of network data sets for the igraph package. ",
-               vers, ".", sep=""))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/inst/getdata.R igraph-0.6.5/interfaces/R/igraphdata/inst/getdata.R
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/inst/getdata.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/inst/getdata.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,489 +0,0 @@
-
-#   igraphdata R package
-#   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-#   334 Harvard st, 02139 Cambridge, MA, USA
-#   
-#   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 2 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, write to the Free Software
-#   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA
-#   02110-1301 USA
-#
-###################################################################
-
-library(igraph)
-
-tmp <- tempdir()
-
-#####################################################################
-## Foodwebs
-
-u1 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/bio/FoodWeb/Webs_paj.zip"
-u2 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/bio/FoodWeb/ATLSS_paj.zip"
-foodzip <- paste(tmp, sep="/", c("f1.zip", "f2.zip"))
-download.file(url=u1, destfile=foodzip[1])
-download.file(url=u2, destfile=foodzip[2])
-unlink(paste(tmp, sep="/", "paj"), recursive=TRUE)
-system(paste("cd", tmp, ";", "unzip", foodzip[1]))
-system(paste("cd", tmp, ";", "unzip", foodzip[2]))
-system(paste("cd", tmp, ";", "mv *.paj paj/"))
-
-pajfiles <- list.files(paste(tmp, sep="/", "paj"), full.names=TRUE)
-
-readpaj <- function(filename) {
-  lines <- readLines(filename)
-  lines <- grep("^%", lines, invert=TRUE, value=TRUE)       # comments
-  lines <- grep("^[ \t]*$", lines, invert=TRUE, value=TRUE) # empty lines
-
-  eco <- lines[grep("^\\*partitio", lines)[1]:
-               (grep("^\\*network", lines)[1]-1)]
-  net <- lines[grep("^\\*network", lines)[1]:(grep("^\\*vector", lines)[1]-1)]
-  bim <- lines[grep("^\\*vector", lines)[1]:length(lines)]
-
-  tf <- tempfile()
-  cat(net, file=tf, sep="\n")
-  G <- read.graph(tf, format="pajek")
-  V(G)$name <- V(G)$id
-  G <- remove.vertex.attribute(G, "id")
-  V(G)$ECO <- as.numeric(eco[-(1:2)])
-  V(G)$Biomass <- as.numeric(bim[-(1:2)])
-  G
-}
-
-foodwebs <- lapply(pajfiles, readpaj)
-names(foodwebs) <- sub("\\.paj$", "", basename(pajfiles))
-
-foodwebs <- foodwebs[setdiff(names(foodwebs), c("Everglades", "Florida"))]
-
-authors <- c("ChesLower", "Hagy, J.D.",
-             "ChesMiddle", "Hagy, J.D.",
-             "ChesUpper", "Hagy, J.D.",
-             "Chesapeake", "Baird, D. and R.E. Ulanowicz",
-             "CrystalC", "Homer, M. and W.M. Kemp",
-             "CryslalD", "Homer, M. and W.M. Kemp",
-             "Maspalomas",
-             "Almunia, J., G. Basterretxea, J. Aristegui, and R.E. Ulanowicz",
-             "Michigan", "Krause, A. and D. Mason",
-             "Mondego", "Patricio, J.",
-             "Narragan", "Monaco, M.E. and R.E. Ulanowicz",
-             "Rhode", "Correll, D",
-             "StMarks", "Baird, D., J. Luczkovich and R. R. Christian",
-             "baydry",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "baywet",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "cypdry",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "cypwet",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "gramdry",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "gramwet",
-             "Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich",
-             "mangdry",
-             "Ulanowicz, R. E., C. Bondavalli, J. J. Heymans, and M. S. Egnotovich",
-             "mangwet",
-             "Ulanowicz, R. E., C. Bondavalli, J. J. Heymans, and M. S. Egnotovich"
-             )                           
-
-Authors <- matrix(authors, nc=2, byrow=TRUE)
-
-citations <- 
-"ChesLower,ChesMiddle,ChesUpper| Hagy, J.D. (2002) Eutrophication, hypoxia
-                   and trophic transfer efficiency in Chesapeake Bay PhD
-                   Dissertation, University of Maryland at College
-                   Park (USA), 446 pp.
-Chesapeake|        Baird D. & Ulanowicz R.E. (1989) The seasonal dynamics
-                   of the Chesapeake Bay ecosystem. Ecological Monographs
-                   59:329-364.
-CrystalC,CrystalD| Homer, M. and W.M. Kemp. Unpublished Ms. See also
-                   Ulanowicz, R.E. 1986. Growth and Development:
-                   Ecosystems Phenomenology. Springer, New York. pp 69-79. 
-Maspalomas|        Almunia, J., G. Basterretxea, J. Aristegui, and R.E.
-                   Ulanowicz. (1999) Benthic- Pelagic switching in a coastal
-                   subtropical lagoon. Estuarine, Coastal and Shelf
-                   Science 49:363-384.
-Michigan|          Krause, A. and D. Mason. (In preparation.) A. Krause,
-                   PhD. Dissertation, Michigan State University.
-                   Ann Arbor, MI. USA 
-Mondego|           Patricio, J. (In Preparation) Master's Thesis.
-                   University of Coimbra, Coimbra, Portugal. 
-Narragan|          Monaco, M.E. and R.E. Ulanowicz. (1997) Comparative
-                   ecosystem trophic structure of three U.S. Mid-Atlantic
-                   estuaries. Mar. Ecol. Prog. Ser. 161:239-254.
-Rhode|             Correll, D. (Unpublished manuscript) Smithsonian
-                   Institute, Chesapeake Bay Center for Environmental
-                   Research, Edgewater, Maryland 21037-0028 USA. 
-StMarks|           Baird, D., J. Luczkovich and R. R. Christian. (1998)
-                   Assessment of spatial and temporal variability in
-                   ecosystem attributes of the St Marks National Wildlife
-                   Refuge, Apalachee Bay, Florida. Estuarine, Coastal, and
-                   Shelf Science 47: 329-349.
-baydry,baywet|     Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich.
-                   1998. Network analysis of trophic dynamics in South
-                   Florida ecosystems, FY 97: the Florida Bay ecosystem.
-                   Annual Report to the United States Geological Service
-                   Biological Resources Division, University of Miami Coral
-                   Gables, [UMCES] CBL 98-123, Maryland System Center for
-                   Environmental Science, Chesapeake Biological Laboratory,
-                   Maryland, USA.
-cypdry,cypwet|     Ulanowicz, R. E., C. Bondavalli, and M. S. Egnotovich.
-                   1997. Network analysis of trophic dynamics in South
-                   Florida ecosystems, FY 96: the cypress wetland ecosystem.
-                   Annual Report to the United States Geological Service
-                   Biological Resources Division, University of Miami Coral
-                   Gables, [UM-CES] CBL 97-075, Maryland System Center for
-                   Environmental Science, Chesapeake Biological Laboratory.
-gramdry,gramwet|   Ulanowicz, R. E., J. J. Heymans, and M. S. Egnotovich.
-                   2000. Network analysis of trophic dynamics in South
-                   Florida ecosystems, FY 99: the graminoid ecosystem.
-                   Technical Report TS-191-99, Maryland System Center for
-                   Environmental Science, Chesapeake Biological Laboratory,
-                   Maryland, USA.
-mangdry,mangwet|   Ulanowicz, R. E., C. Bondavalli, J. J. Heymans, and
-                   M. S. Egnotovich. 1999. Network analysis of trophic
-                   dynamics in South Florida ecosystems, FY 98: the mangrove
-                   ecosystem. Technical Report TS-191-99, Maryland System
-                   Center for Environmental Science, Chesapeake Biological
-                   Laboratory, Maryland, USA."
-
-
-Citations <- readLines(textConnection(citations))
-Citations2 <- Citations[1]
-for (i in 2:length(Citations)) {
-  if (grepl("^[ ]", Citations[i])) {
-    Citations2[length(Citations2)] <- paste(Citations2[length(Citations2)],
-                                            sub("^[ ]*", "", Citations[i]))
-  } else {
-    Citations2 <- c(Citations2, Citations[i])
-  }
-}
-Citations2 <- strsplit(Citations2, split="|", fixed=TRUE)
-ids <- lapply(Citations2, function(x) strsplit(x[1], ",")[[1]])
-cits <- sub("^[ ]*", "", sapply(Citations2, "[[", 2))
-Citations2 <- cbind(unlist(ids), rep(cits, sapply(ids, length)))
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/bio/foodweb/foodweb.htm"
-
-name <-
-"ChesLower|         Lower Chesapeake Bay in Summer
-ChesMiddle|         Middle Chesapeake Bay in Summer
-ChesUpper|          Upper Chesapeake Bay in Summer
-Chesapeake|         Chesapeake Bay Mesohaline Network
-CrystalC|           Crystal River Creek (Control)
-CrystalD|           Crystal River Creek (Delta Temp)
-Maspalomas|         Charca de Maspalomas
-Michigan|           Lake Michigan Control network
-Mondego|            Mondego Estuary - Zostrea site
-Narragan|           Narragansett Bay Model
-Rhode|              Rhode River Watershed - Water Budget
-StMarks|            St. Marks River (Florida) Flow network
-baydry|             Florida Bay Trophic Exchange Matrix, dry season
-baywet|             Florida Bay Trophic Exchange Matrix, wet season
-cypdry|             Cypress Dry Season
-cypwet|             Cypress Wet Season
-gramdry|            Everglades Graminoids - Dry Season
-gramwet|            Everglades Graminoids - Wet Season
-mangdry|            Mangrove Estuary, Dry Season
-mangwet|            Mangrove Estuary, Wet Season"
-
-Name <- read.delim(textConnection(name), sep="|", header=FALSE)
-Name[,2] <- sub("^[ ]*", "", Name[,2])
-
-for (n in names(foodwebs)) {
-  foodwebs[[n]]$Citation <- Citations2[,2][match(n, Citations2[,1])]
-  foodwebs[[n]]$Author   <- Authors[,2][match(n, Authors[,1])]
-  foodwebs[[n]]$URL      <- url
-  foodwebs[[n]]$name     <- Name[,2][match(n, Name[,1])]
-}
-  
-save(foodwebs, file="/tmp/foodwebs.rda")
-
-#####################################################################
-
-## Konigsberg
-
-library(igraph)
-
-edges <- '
-from,to,Euler_letter,name
-Altstadt-Loebenicht,Kneiphof,a,Kraemer Bruecke
-Altstadt-Loebenicht,Kneiphof,b,Schmiedebruecke
-Altstadt-Loebenicht,Lomse,f,Holzbruecke
-Kneiphof,Lomse,e,Honigbruecke
-Vorstadt-Haberberg,Lomse,g,Hohe Bruecke
-Vorstadt-Haberberg,Kneiphof,c,Gruene Bruecke
-Vorstadt-Haberberg,Kneiphof,d,Koettelbruecke'
-
-vertices <- "
-name,Euler_letter
-Altstadt-Loebenicht,B
-Kneiphof,A
-Vorstadt-Haberberg,C
-Lomse,D"
-
-Koenigsberg <- graph.data.frame(read.csv(textConnection(edges)),
-                                vertices=read.csv(textConnection(vertices)),
-                                directed=FALSE)
-
-Koenigsberg$name <- "The seven bidges of Koenigsberg"
-
-save(Koenigsberg, file="/tmp/Koenigsberg.rda")
-
-########################################################################
-
-## Yeast protein interactions
-
-## library(igraph)
-
-## tmp <- tempdir()
-
-## url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/bio/Yeast/yeast.zip"
-## yzip <- paste(tmp, sep="/", "y.zip")
-## download.file(url=url, destfile=yzip)
-## system(paste("cd", tmp, ";", "unzip", yzip))
-
-## YS <- read.graph(paste(tmp, sep="/", "YeastS.net"), format="pajek")
-## YL <- read.graph(paste(tmp, sep="/", "YeastL.net"), format="pajek")
-## cluLines <- readLines(paste(tmp, sep="/", "Yeast.clu"))
-## cluLines <- cluLines[(grep("^\\*vertices", cluLines)+1):length(cluLines)]
-## ccode <- c("1"="T", "2"="M", "3"="U", "4"="C", "5"="F", "6"="P",
-##            "7"="G", "8"="D", "9"="O", "10"="E", "11"="R", "12"="B", "13"="A")
-
-## V(YS)$name <- V(YS)$id
-## V(YS)$Long_name <- V(YL)$id
-## YS <- remove.vertex.attribute(YS, "id")
-## V(YS)$Class <- ccode[cluLines]
-## YS$name <- "Yeast protein interaction network by Bu et al. 2003"
-## YS$Citation <- "Dongbo Bu, Yi Zhao, Lun Cai, Hong Xue, Xiaopeng Zhu, Hongchao Lu, Jingfen Zhang, Shiwei Sun, Lunjiang Ling, Nan Zhang, Guojie Li and Runsheng Chen: Topological structure analysis of the protein–protein interaction network in budding yeast. Nucl. Acids Res. (2003) 31 (9): 2443-2450."
-## YS$Author <- "Dongbo Bu, Yi Zhao, Lun Cai, Hong Xue, Xiaopeng Zhu, Hongchao Lu, Jingfen Zhang, Shiwei Sun, Lunjiang Ling, Nan Zhang, Guojie Li and Runsheng Chen"
-## YS$URL <- "http://www.bioinfo.org.cn/PIN/"
-
-## class <-
-## "Category,Description,Original MIPS category
-##  E,energy production,energy
-##  G,aminoacid metabolism,aminoacid metabolism
-##  M,other metabolism,all remaining metabolism categories
-##  P,translation,protein synthesis
-##  T,transcription,\"transcription, but without subcategory 'transcriptional control'\"
-##  B,transcriptional control,subcategory 'transcriptional control'
-##  F,protein fate,\"protein fate (folding, modification, destination)\"
-##  O,cellular organization,cellular transport and transport mechanisms
-##  A,transport and sensing,categories 'transport facilitation' and 'regulation of / interaction with cellular environment'
-##  R,stress and defense,\"cell rescue, defense and virulence\"
-##  D,genome maintenance,DNA processing and cell cycle
-##  C,cellular fate / organization,categories 'cell fate' and 'cellular communication / signal transduction' and 'control of cellular organization'
-##  U,uncharacterized,categories 'not yet clear-cut' and 'uncharacterized'
-## "
-
-## classes <- read.csv(textConnection(class), header=TRUE, stringsAsFactors=FALSE)
-## YS$Classes <- classes
-
-## yeast <- YS
-## save(yeast, file="/tmp/yeast.rda")
-
-###########################################################################
-
-## Yeast protein interactions, from the van Mering paper
-
-library(igraph)
-library(org.Sc.sgd.db)
-
-tmp <- tempdir()
-
-urls <- paste(sep="", "http://www.nature.com/nature/journal/v417/n6887/extref/nature750-s", 1:4, ".doc")
-dest <- paste(sep="", tmp, "/s", 1:4, ".txt")
-sapply(1:4, function(x) download.file(url=urls[x], destfile=dest[x]))
-
-## Proteins
-
-vert <- readLines(paste(tmp, sep="/", "s1.txt"))
-vert <- vert[grep("^Y", vert)[1]:length(vert)]
-vert <- vert[vert != ""]
-
-vert12 <- sub("\\][ ].*$", "]", vert)
-vert12 <- read.delim(textConnection(paste(vert12, sep="\n")),
-                     header=FALSE, stringsAsFactors=FALSE, sep=" ")
-vert12[,2] <- sub("\\]", "", sub("\\[", "", vert12[,2]))
-colnames(vert12) <- c("name", "Class")
-
-vert3 <- sub("^[^ ]+[ ][^ ]+[ ]", "", vert)
-
-## Connections
-
-int <- readLines(paste(tmp, sep="/", "s4.txt"))
-int <- int[grep("^Y", int)[1]:length(int)]
-int <- int[int != ""]
-
-fromto <- t(sapply(strsplit(int, "[ ]+"), "[", 1:2))
-highconf <- grep("confidence: high", int)
-highmed <- grep("confidence: low", int, invert=TRUE)
-
-## Classes
-
-class <-
-"Category,Description,Original MIPS category
- E,energy production,energy
- G,aminoacid metabolism,aminoacid metabolism
- M,other metabolism,all remaining metabolism categories
- P,translation,protein synthesis
- T,transcription,\"transcription, but without subcategory 'transcriptional control'\"
- B,transcriptional control,subcategory 'transcriptional control'
- F,protein fate,\"protein fate (folding, modification, destination)\"
- O,cellular organization,cellular transport and transport mechanisms
- A,transport and sensing,categories 'transport facilitation' and 'regulation of / interaction with cellular environment'
- R,stress and defense,\"cell rescue, defense and virulence\"
- D,genome maintenance,DNA processing and cell cycle
- C,cellular fate / organization,categories 'cell fate' and 'cellular communication / signal transduction' and 'control of cellular organization'
- U,uncharacterized,categories 'not yet clear-cut' and 'uncharacterized'
-"
-
-classes <- read.csv(textConnection(class), header=TRUE, stringsAsFactors=FALSE)
-
-# Create the network
-
-yeast <- graph.data.frame(fromto[highmed,], directed=FALSE)
-yeast$name <- "Yeast protein interactions, von Mering et al."
-yeast$Citation <- "Comparative assessment of large-scale data sets of protein-protein interactions. Christian von Mering, Roland Krause, Berend Snel, Michael Cornell, Stephen G. Oliver, Stanley Fields and Peer Bork. Nature 417, 399-403 (2002)"
-yeast$Author <- "Christian von Mering, Roland Krause, Berend Snel, Michael Cornell, Stephen G. Oliver, Stanley Fields and Peer Bork"
-yeast$URL <- "http://www.nature.com/nature/journal/v417/n6887/full/nature750.html"
-yeast$Classes <- classes
-
-V(yeast)$Class <- vert12[,2][match(V(yeast)$name, vert12[,1])]
-V(yeast)$Description <- vert3[match(V(yeast)$name, vert12[,1])]
-
-E(yeast)$Confidence <- ifelse(grepl("confidence: high", int[highmed]),
-                              "high", "medium")
-
-save(yeast, file="/tmp/yeast.rda")
-
-###################################################################
-
-## Zachary karate club
-
-library(igraph)
-
-tmp <- tempdir()
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/UciNet/zachary.dat"
-dest <- paste(tmp, sep="/", "k.dat")
-download.file(url=url, destfile=dest)
-
-l <- readLines(dest)
-l <- l[(grep("^DATA", l)+1):length(l)]
-l1 <- matrix(scan(textConnection(paste(l[1:34], collapse="\n"))), nr=34)
-l2 <- matrix(scan(textConnection(paste(l[1:34+34], collapse="\n"))), nr=34)
-
-karate <- graph.adjacency(l2, weighted=TRUE, mode="undirected")
-V(karate)$Faction <- c(1,1,1,1,1,1,1,1, 2,2, 1,1,1,1, 2,2, 1,1, 2, 1, 2, 1,
-                     2,2,2,2,2,2,2,2,2,2,2,2)
-karate$name <- "Zachary's karate club network"
-karate$Citation <- "Wayne W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research Vol. 33, No. 4 452-473"
-karate$Author <- "Wayne W. Zachary"
-
-save(karate, file="/tmp/karate.rda")
-
-#####################################################################
-## US airport network
-
-tab <- read.csv("~/Downloads/1067890998_T_T100D_SEGMENT_ALL_CARRIER.csv")
-tab <- tab[ tab$PASSENGERS != 0, ]
-
-tab2 <- tab[,c("ORIGIN", "DEST", "UNIQUE_CARRIER_NAME", "DEPARTURES_PERFORMED", "SEATS", "PASSENGERS", "AIRCRAFT_TYPE", "DISTANCE")]
-
-vert <- rbind(data.frame(name=tab$ORIGIN, CITY=tab$ORIGIN_CITY_NAME),
-              data.frame(name=tab$DEST,CITY=tab$DEST_CITY_NAME))
-vert <- vert[ !duplicated(vert$name), ]
-
-names(tab2) <- c("from", "to", "Carrier", "Departures", "Seats", "Passengers", "Aircraft", "Distance")
-names(vert) <- c("name", "City")
-
-library(igraph)
-
-USairports <- graph.data.frame(tab2, vertices=vert)
-USairports$name <- "US airports"
-
-## Add positions
-
-temp <- "http://www.armcode.com/airports/airport-%s.htm"
-
-codes <- lapply(letters, function(x) {
-  print(x)
-  l <- readLines(sprintf(temp, x))
-  r <- grep('class="row3"', l, value=TRUE)
-  r2 <- sub("<TR><TD[^<]*</TD><TD[^<]*</TD><TD[^<]*</TD><TD[^>]*>", "", r)
-  r3 <- grep("^<", r2, invert=TRUE, value=TRUE)
-  c1 <- substr(r3, 1, 3)
-  c2 <- sub("^.*>(.*)</a></TD></TR>", "\\1", r3)
-  list(code=c1, pos=c2)
-})
-
-iata <- unlist(lapply(codes, "[[", 1))
-pos  <- unlist(lapply(codes, "[[", 2))
-
-miss <- setdiff(V(USairports)$name, iata)
-misspos <- sapply(miss, function(code) {
-  print(code)
-  try({
-    l <- readLines(sprintf("http://www.airnav.com/airport/%s", code))
-    e <- grep("Lat/Long:&nbsp;", l, value=TRUE)
-    e2 <- sub("^.*Lat/Long:&nbsp;.*valign=top>([^<]*)<BR>.*$", "\\1", e)
-    g <- gsub("[^NSEW]", "", strsplit(e2, "/",)[[1]])
-    co <- round(as.numeric(gsub("[^0-9.]", "", strsplit(e2, "/")[[1]])))
-    paste(g, co, sep="")
-  })
-})
-
-stillmiss <- miss[sapply(misspos, inherits, "try-error")]
-stillmiss <- cbind(stillmiss, V(USairports)[stillmiss]$City)
-stillpos <- c("344059N 0902050W",
-              "664903N 1610120W",
-              "572817N 1534855W",
-              "573300N 1534500W",
-              "581000N 1523000W",
-              "574500N 1531900W",
-              "552431N 1321945W",
-              "621402N 1544405W",
-              "642215N 1611326W",
-              "635310N 1521807W",
-              "603522N 1520928W",
-              "594336N 1571533W",
-              "630150N 1633158W",
-              "551400N 1321300W",
-              "555656N 1333943W",
-              "555059N 1331340W",
-              "551421N 1320651W",
-              "581401N 1572101W",
-              "561904N 1583526W",
-              "592559N 1545827W",
-              "560021N 1603338W",
-              "605742N 1511954W",
-              "591900N 1545500W",
-              "355919N 1134836W",
-              "174449N 0644218W",
-              "181443N 0653836W",
-              "581300N 1573000W")
-
-bak <- misspos
-misspos[stillmiss[,1]] <- stillpos
-misspos <- unlist(sapply(misspos, paste, collapse=" "))
-
-misspos <- sub("([0-9]+)([NS]) ([0-9]+)([WE])", "\\2\\1 \\4\\3", misspos)
-
-iata <- c(iata, names(misspos))
-pos <- c(pos, unname(misspos))
-
-V(USairports)$Position <- pos[match(V(USairports)$name, iata)]
-
-save(USairports, file="/tmp/USairports.rda")
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/Koenigsberg.Rd igraph-0.6.5/interfaces/R/igraphdata/man/Koenigsberg.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/Koenigsberg.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/Koenigsberg.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-\name{Koenigsberg}
-\docType{data}
-\alias{Koenigsberg}
-\title{Bridges of Koenigsberg from Euler's times}
-\description{
-  The Seven Bridges of Koenigsberg is a notable historical problem in
-  mathematics. Its negative resolution by Leonhard Euler in 1735 laid
-  the foundations of graph theory and presaged the idea of topology. 
-
-  The city of Koenigsberg in Prussia (now Kaliningrad, Russia) was set on
-  both sides of the Pregel River, and included two large islands which
-  were connected to each other and the mainland by seven bridges
-
-  The problem was to find a walk through the city that would cross each
-  bridge once and only once. The islands could not be reached by any route
-  other than the bridges, and every bridge must have been crossed
-  completely every time (one could not walk half way onto the bridge and
-  then turn around and later cross the other half from the other side).
-
-  Euler proved that the problem has no solution.
-}
-\usage{
-Koenigsberg
-}
-\format{
-  An undirected \code{igraph} graph object with vertex attributes
-  \sQuote{name} and \sQuote{Euler_letter}, the latter is the notation
-  from Eulers original paper; and edge attributes \code{name} (the name
-  of the bridge) and \sQuote{Euler_letter}, again, Euler's notation
-  from his paper.
-
-  This dataset is in the public domain.
-}
-\source{Wikipedia,
-  \url{http://de.wikipedia.org/wiki/K\%C3\%B6nigsberger_Br\%C3\%BCcken}
-}
-% \references{}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/UKfaculty.Rd igraph-0.6.5/interfaces/R/igraphdata/man/UKfaculty.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/UKfaculty.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/UKfaculty.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-\name{UKfaculty}
-\docType{data}
-\alias{UKfaculty}
-\title{Friendship network of a UK university faculty}
-\description{The personal friendship network of a faculty of a UK
-  university, consisting of 81 vertices (individuals) and 817 directed
-  and weighted connections. The school affiliation of each individual is
-  stored as a vertex attribute. This dataset can serve as a testbed for
-  community detection algorithms.}
-\usage{
-UKfaculty
-}
-\format{
-  A directed \code{igraph} graph object with vertex attribute
-  \sQuote{Group}, the numeric id of the school affiliation, and edge
-  attribute \sQuote{weight}, i.e. the graph is weighted.
-
-  This dataset is licensed under a Creative Commons
-  Attribution-Share Alike 2.0 UK: England & Wales License, 
-  see \url{http://creativecommons.org/licenses/by-sa/2.0/uk/} for details.
-  Please cite the reference below if you use this dataset.  
-}
-\source{See reference below.}
-\references{Nepusz T., Petroczi A., Negyessy L., Bazso F.: Fuzzy
-  communities and the concept of bridgeness in complex
-  networks. Physical Review E 77:016107, 2008.
-}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/USairports.Rd igraph-0.6.5/interfaces/R/igraphdata/man/USairports.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/USairports.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/USairports.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-\name{USairports}
-\docType{data}
-\alias{USairports}
-\title{US airport network, 2010 December}
-\description{
-  The network of passanger flights between airports in the United
-  States. The data set was compiled based on flights in 2010
-  December. This network is directed and edge directions correspond to
-  flight directions. Each edge is specific to a single carrier aircraft
-  type. Multiple carriers between the same two airports are denoted by
-  multiple edges.
-
-  See information about the included meta-data below.
-}
-\usage{
-USairports
-}
-\format{
-  A directed \code{igraph} graph object, with multiple edges. It has a
-  \sQuote{name} graph attribute, and several vertex and edge
-  attributes. The vertex attributes:
-  \describe{
-    \item{name}{Symbolic vertex name, this is the three letter IATA
-      airport code.}
-    \item{City}{City and state, where the airport is located.}
-    \item{Position}{Position of the airport, in WGS coordinates.}
-  }
-
-  Edge attributes:
-  \describe{
-    \item{Carrier}{Name of the airline. The network includes both
-      domestic and international carriers that performed at least one
-      flight in December of 2010.}
-    \item{Departures}{The number of departures (for a given airline and
-      aircraft type.}
-    \item{Seats}{The total number of seats available on the flights
-      carried out by a given airline, using a given aircraft type.}
-    \item{Passengers}{The total number of passangers on the flights
-      carried out by a given airline, using a given aircraft type.}
-    \item{Aircraft}{Type of the aircraft.}
-    \item{Distance}{The distance between the two airports, in miles.}
-  }
-}
-\source{
-  Most of this information was downloaded from The Research and
-  Innovative Technology Administration (RITA). See
-  \url{http://www.rita.dot.gov/about_rita/} for details. The airport
-  position information was collected from Wikipedia and other public
-  online sources.
-}
-% \references{}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/aaa-igraphdata-package.Rd igraph-0.6.5/interfaces/R/igraphdata/man/aaa-igraphdata-package.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/aaa-igraphdata-package.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/aaa-igraphdata-package.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,16 +0,0 @@
-\docType{package}
-\name{igraphdata-package}
-\alias{igraphdata-package}
-\alias{igraphdata}
-\title{The igraphdata package}
-\description{The igraphdata package provides various data sets }
-\section{How to use the data sets}{
-  After loading the \code{igraphdata} package, the various data sets can
-  be loaded using the regular \code{\link{data}} command.
-
-  Type in \preformatted{  data(package="igraphdata")}
-  to get a list of data sets included in this package.
-}
-\author{Gabor Csardi \email{csardi.gabor@gmail.com}}
-\references{\code{\link{data}}}
-%\examples{}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/foodwebs.Rd igraph-0.6.5/interfaces/R/igraphdata/man/foodwebs.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/foodwebs.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/foodwebs.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,138 +0,0 @@
-\name{foodwebs}
-\docType{data}
-\alias{foodwebs}
-\title{A collection of food webs}
-\description{A list of graphs. Each one is a food web, i.e. a directed
-  graph of predator-prey relationships.}
-\usage{
-foodwebs
-}
-\format{
-  A named list of directed \code{igraph} graph objects. Here are the
-  list of the graphs included:
-  \describe{
-    \item{\sQuote{ChesLower}}{Lower Chesapeake Bay in Summer.
-
-      Reference: Hagy, J.D. (2002) Eutrophication, hypoxia and
-      trophic transfer efficiency in Chesapeake Bay PhD Dissertation,
-      University of Maryland at College Park (USA), 446 pp.}
-    \item{\sQuote{ChesMiddle}}{Middle Chesapeake Bay in Summer.
-
-      Reference: same as for \sQuote{ChesLower}.}
-    \item{\sQuote{ChesUpper}}{Upper Chesapeake Bay in Summer.
-
-      Reference: same as for \sQuote{ChesLower}.}
-    \item{\sQuote{Chesapeake}}{Chesapeake Bay Mesohaline Network.
-
-      Reference: Baird D. & Ulanowicz R.E. (1989) The seasonal dynamics
-      of the Chesapeake Bay ecosystem. Ecological Monographs 59:329-364.}
-    \item{\sQuote{CrystalC}}{Crystal River Creek (Control).
-
-      Reference: Homer, M. and W.M. Kemp. Unpublished Ms. See also
-      Ulanowicz, R.E. 1986. Growth and Development: Ecosystems
-      Phenomenology. Springer, New York. pp 69-79.}
-    \item{\sQuote{CrystalD}}{Crystal River Creek (Delta Temp).
-
-      Reference: same as for \sQuote{CrystalD}.}
-    \item{\sQuote{Maspalomas}}{Charca de Maspalomas.
-
-      Reference: Almunia, J., G. Basterretxea, J. Aristegui, and
-      R.E. Ulanowicz. (1999) Benthic- Pelagic switching in a coastal
-      subtropical lagoon. Estuarine, Coastal and Shelf Science
-      49:363-384.}
-    \item{\sQuote{Michigan}}{Lake Michigan Control network.
-
-      Reference: Krause, A. and D. Mason. (In preparation.) A. Krause,
-      PhD. Dissertation, Michigan State University. Ann Arbor, MI. USA.}
-    \item{\sQuote{Mondego}}{Mondego Estuary - Zostrea site.
-
-      Reference: Patricio, J. (In Preparation) Master's
-      Thesis. University of Coimbra, Coimbra, Portugal.}
-    \item{\sQuote{Narragan}}{Narragansett Bay Model.
-
-      Reference: Monaco, M.E. and R.E. Ulanowicz. (1997) Comparative
-      ecosystem trophic structure of three U.S. Mid-Atlantic
-      estuaries. Mar. Ecol. Prog. Ser. 161:239-254.}
-    \item{\sQuote{Rhode}}{Rhode River Watershed - Water Budget.
-
-      Reference: Correll, D. (Unpublished manuscript) Smithsonian
-      Institute, Chesapeake Bay Center for Environmental Research,
-      Edgewater, Maryland 21037-0028 USA.}
-    \item{\sQuote{StMarks}}{St. Marks River (Florida) Flow network.
-
-      Reference: Baird, D., J. Luczkovich and R. R. Christian. (1998)
-      Assessment of spatial and temporal variability in ecosystem
-      attributes of the St Marks National Wildlife Refuge, Apalachee Bay,
-      Florida. Estuarine, Coastal, and Shelf Science 47: 329-349.}
-    \item{\sQuote{baydry}}{Florida Bay Trophic Exchange Matrix, dry season.
-
-      Reference: Ulanowicz, R. E., C. Bondavalli, and
-      M. S. Egnotovich. 1998. Network analysis of trophic dynamics in
-      South Florida ecosystems, FY 97: the Florida Bay ecosystem. Annual
-      Report to the United States Geological Service Biological Resources
-      Division, University of Miami Coral Gables, [UMCES] CBL 98-123,
-      Maryland System Center for Environmental Science, Chesapeake
-      Biological Laboratory, Maryland, USA.}
-    \item{\sQuote{baywet}}{Florida Bay Trophic Exchange Matrix, wet season.
-      
-      Reference: same as for \sQuote{baydry}.}
-    \item{\sQuote{cypdry}}{Cypress, dry season.
-
-      Reference: Ulanowicz, R. E., C. Bondavalli, and
-      M. S. Egnotovich. 1997. Network analysis of trophic dynamics in
-      South Florida ecosystems, FY 96: the cypress wetland
-      ecosystem. Annual Report to the United States Geological Service
-      Biological Resources Division, University of Miami Coral Gables,
-      [UM-CES] CBL 97-075, Maryland System Center for Environmental
-      Science, Chesapeake Biological Laboratory.}
-    \item{\sQuote{cypwet}}{Cypress, wet season.
-
-      Reference: same as for \sQuote{cypdry}.}
-    \item{\sQuote{gramdry}}{Everglades Graminoids - Dry Season.
-
-      Reference: Ulanowicz, R. E., J. J. Heymans, and
-      M. S. Egnotovich. 2000. Network analysis of trophic dynamics in
-      South Florida ecosystems, FY 99: the graminoid ecosystem. Technical
-      Report TS-191-99, Maryland System Center for Environmental Science,
-      Chesapeake Biological Laboratory, Maryland, USA.}
-    \item{\sQuote{gramwet}}{Everglades Graminoids - Wet Season.
-
-      Reference: same as for \sQuote{gramdry}.}
-    \item{\sQuote{mangdry}}{Mangrove Estuary, Dry Season.
-
-      Reference: Ulanowicz, R. E., C. Bondavalli, J. J. Heymans, and
-      M. S. Egnotovich. 1999. Network analysis of trophic dynamics in
-      South Florida ecosystems, FY 98: the mangrove ecosystem. Technical
-      Report TS-191-99, Maryland System Center for Environmental Science,
-      Chesapeake Biological Laboratory, Maryland, USA.}
-    \item{\sQuote{mangwet}}{Mangrove Estuary, Wet Season.
-      
-      Reference: same as for \sQuote{mangdry}.}
-  }
-
-  Each graph has the following vertex attributes: \sQuote{name} is the
-  name of the species, \sQuote{ECO} is the type of the node, and
-  integer value between one and five, meaning:
-  \enumerate{
-    \item Living/producing compartment
-    \item Other compartment
-    \item Input
-    \item Output
-    \item Respiration.
-  }
-  The \sQuote{Biomass} vertex attribute contains the biomass of the
-  species.
-  
-  Edges are weighted, and the weights denote energy flux between the
-  species involved.
-  
-  The graphs also contain some informative graph attributes:
-  \sQuote{Author}, \sQuote{Citation}, \sQuote{URL}, and
-  \sQuote{name}.
-}
-\source{See references for the individual webs above. The data itself
-  was downloaded from
-  \url{http://vlado.fmf.uni-lj.si/pub/networks/data/bio/foodweb/foodweb.htm}.
-}
-\references{See them above.}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/immuno.Rd igraph-0.6.5/interfaces/R/igraphdata/man/immuno.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/immuno.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/immuno.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-\name{immuno}
-\docType{data}
-\alias{immuno}
-\title{Immunoglobulin interaction network}
-\description{
-  The undirected and connected network of interactions
-  in the immunoglobulin protein. It is made up of 1316 vertices
-  representing amino-acids and an edge is drawn between two
-  amino-acids if the shortest distance between their C_alpha atoms
-  is smaller than the threshold value \eqn{\theta=8}{theta=8} Angstrom.
-}
-\usage{
-immuno
-}
-\format{
-  An undirected \code{igraph} graph object.
-
-  Graph attributes: \sQuote{name}, \sQuote{Citation}, \sQuote{Author}.
-}
-\source{
-  See reference below.
-}
-\references{
-  D. Gfeller, Simplifying complex networks: from a clustering to a
-  coarse graining strategy, \emph{PhD Thesis EPFL}, no 3888, 2007.
-  \url{http://library.epfl.ch/theses/?nr=3888}
-}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/karate.Rd igraph-0.6.5/interfaces/R/igraphdata/man/karate.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/karate.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/karate.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,62 +0,0 @@
-\name{karate}
-\docType{data}
-\alias{karate}
-\title{Zachary's karate club network}
-\description{
-  Social network between members of a university karate club, led by
-  president John A. and karate instructor Mr. Hi (pseudonyms).
-
-  The edge weights are the number of common activities the club
-  members took part of. These activities were:
-  \enumerate{
-    \item Association in and between academic classes at the university.
-    \item Membership in Mr. Hi's private karate studio on the east side
-    of the city where Mr. Hi taught nights as a part-time instructor.
-    \item Membership in Mr. Hi's private karate studio on the east side
-    of the city, where many of his supporters worked out on weekends. 
-    \item Student teaching at the east-side karate studio referred to in
-    (2). This is different from (2) in that student teachers interacted
-    with each other, but were prohibited from interacting with their
-    students. 
-    \item Interaction at the university rathskeller, located in the same
-    basement as the karate club's workout area.
-    \item Interaction at a student-oriented bar located across the
-    street from the university campus.
-    \item Attendance at open karate tournaments held through the area at
-    private karate studios.
-    \item Attendance at intercollegiate karate tournaments held at local
-    universities. Since both open and intercollegiate tournaments were
-    held on Saturdays, attendance at both was impossible.
-  }
-
-  Zachary studied conflict and fission in this network, as the karate
-  club was split into two separate clubs, after long disputes between
-  two factions of the club, one led by John A., the other by Mr. Hi.
-
-  The \sQuote{Faction} vertex attribute gives the faction memberships of
-  the actors. After the split of the club, club members chose their
-  new clubs based on their factions, except actor no. 9, who was in John
-  A.'s faction but chose Mr. Hi's club.
-}
-\usage{
-karate
-}
-\format{
-  An undirected \code{igraph} graph object. Vertex no. 1 is Mr. Hi,
-  vertex no. 34 corresponds to John A.
-
-  Graph attributes: \sQuote{name}, \sQuote{Citation}, \sQuote{Author}.
-
-  Vertex attribute: \sQuote{Faction}.
-
-  Edge attribute: \sQuote{weight}.
-}
-\source{
-  See reference below.
-}
-\references{
-  Wayne W. Zachary. An Information Flow Model for Conflict and Fission
-  in Small Groups. \emph{Journal of Anthropological Research} Vol. 33,
-  No. 4 452-473
-}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/macaque.Rd igraph-0.6.5/interfaces/R/igraphdata/man/macaque.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/macaque.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/macaque.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-\name{macaque}
-\docType{data}
-\alias{macaque}
-\title{Visuotactile brain areas and connections}
-\description{
-  Graph model of the visuotactile brain areas and connections of the
-  macaque monkey. The model consists of 45 areas and 463 directed
-  connections.
-}
-\usage{
-macaque
-}
-\format{
-  A directed \code{igraph} graph object with vertex attributes
-  \sQuote{name} and \sQuote{shape}.
-
-  This dataset is licensed under a Creative Commons
-  Attribution-Share Alike 2.0 UK: England & Wales License, 
-  see \url{http://creativecommons.org/licenses/by-sa/2.0/uk/} for details.
-  Please cite the reference below if you use this dataset.  
-}
-\source{See reference below.}
-\references{Negyessy L., Nepusz T., Kocsis L., Bazso F.: Prediction of
-  the main cortical areas and connections involved in the tactile
-  function of the visual cortex by network analysis. \emph{European
-    Journal of Neuroscience}, 23(7): 1919-1930, 2006. }
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/yeast.Rd igraph-0.6.5/interfaces/R/igraphdata/man/yeast.Rd
--- igraph-0.6.5~quantal1/interfaces/R/igraphdata/man/yeast.Rd	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/igraphdata/man/yeast.Rd	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-\name{yeast}
-\docType{data}
-\alias{yeast}
-\title{Yeast protein interaction network}
-\description{
-  Comprehensive protein-protein interaction maps promise to reveal many
-  aspects of the complex regulatory network underlying cellular
-  function.
-
-  This data set was compiled by von Mering et al. (see reference below),
-  combining various sources. Only the interactions that have 
-  \sQuote{high} and \sQuote{medium} confidence are included here.
-}
-\usage{
-yeast
-}
-\format{
-  An undirected \code{igraph} graph object. Its graph attributes:
-  \sQuote{name}, \sQuote{Citation}, \sQuote{Author},
-  \sQuote{URL}. \sQuote{Classes}. The \sQuote{Classes}
-  attribute contain the key for the classification labels of the
-  proteins, in a data frame, the original MIPS categories are given
-  after the semicolon:
-  \describe{
-    \item{E}{energy production; energy}
-    \item{G}{aminoacid metabolism; aminoacid metabolism} 
-    \item{M}{other metabolism; all remaining metabolism categories}
-    \item{P}{translation; protein synthesis}
-    \item{T}{transcription; transcription, but without subcategory
-      \sQuote{transcriptional control}}
-    \item{B}{transcriptional control; subcategory
-      \sQuote{transcriptional control}}
-    \item{F}{protein fate; protein fate (folding, modification,
-      destination)}
-    \item{O}{cellular organization; cellular transport and transport
-      mechanisms}
-    \item{A}{transport and sensing; categories \sQuote{transport
-	facilitation} and \sQuote{regulation of / interaction with
-	cellular environment}}
-    \item{R}{stress and defense; cell rescue, defense and virulence}
-    \item{D}{genome maintenance; DNA processing and cell cycle}
-    \item{C}{cellular fate / organization; categories \sQuote{cell fate}
-      and \sQuote{cellular communication /  signal transduction} and
-      \sQuote{control of cellular organization}}
-    \item{U}{uncharacterized; categories \sQuote{not yet clear-cut} and
-      \sQuote{uncharacterized}}
-  }
-  
-  Vertex attributes: \sQuote{name}, \sQuote{Description},
-  \sQuote{Class}, the last one contains the class of the protein,
-  accoring to the classification above.
-
-  Note that some proteins in the network did not appear in the
-  annotation files, the \sQuote{Class} and \sQuote{Description}
-  attributes are \code{NA} for these.
-}
-\source{The data was downloaded from
-  \url{http://www.nature.com/nature/journal/v417/n6887/suppinfo/nature750.html}.
-}
-\references{
-Comparative assessment of large-scale data sets of protein-protein
-  interactions. Christian von Mering, Roland Krause, Berend Snel,
-  Michael Cornell, Stephen G. Oliver, Stanley Fields and Peer
-  Bork. \emph{Nature} 417, 399-403 (2002) 
-}
-\keyword{datasets}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/src/Makevars igraph-0.6.5/interfaces/R/src/Makevars
--- igraph-0.6.5~quantal1/interfaces/R/src/Makevars	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/src/Makevars	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-PKG_CFLAGS=-DUSING_R -I.
diff -Nru igraph-0.6.5~quantal1/interfaces/R/src/Makevars.in igraph-0.6.5/interfaces/R/src/Makevars.in
--- igraph-0.6.5~quantal1/interfaces/R/src/Makevars.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/src/Makevars.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-PKG_CFLAGS=-DUSING_R -I. -Ics -Iglpk -Iglpk/amd -Iglpk/colamd -Iplfit \
-	@CPPFLAGS@ @CFLAGS@ -DNDEBUG \
-	-DPACKAGE_VERSION=\"@PACKAGE_VERSION@\" -DINTERNAL_ARPACK \
-	-DIGRAPH_THREAD_LOCAL=/**/
-PKG_CXXFLAGS= -DUSING_R -DIGRAPH_THREAD_LOCAL=/**/ -DNDEBUG
-PKG_LIBS=@XML2_LIBS@ @GMP_LIBS@ @GLPK_LIBS@ $(FLIBS) $(LAPACK_LIBS) $(BLAS_LIBS)
-
-all: $(SHLIB)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/src/rinterface.c.in igraph-0.6.5/interfaces/R/src/rinterface.c.in
--- igraph-0.6.5~quantal1/interfaces/R/src/rinterface.c.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/src/rinterface.c.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,9560 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library R interface.
-   Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
-   334 Harvard street, Cambridge, MA 02139 USA
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-#include "igraph.h"
-#include "igraph_error.h"
-
-#include "config.h"
-
-#define USE_RINTERNALS
-#include <R.h>
-#include <Rinternals.h>
-#include <Rdefines.h>
-
-#include <stdio.h>
-
-int igraph_free(void *p);
-
-SEXP R_igraph_vector_to_SEXP(const igraph_vector_t *v);
-SEXP R_igraph_vector_bool_to_SEXP(igraph_vector_bool_t *v);
-SEXP R_igraph_vector_long_to_SEXP(igraph_vector_long_t *v);
-SEXP R_igraph_vector_complex_to_SEXP(igraph_vector_complex_t* v);
-SEXP R_igraph_0orvector_to_SEXP(igraph_vector_t *v);
-SEXP R_igraph_0orvector_bool_to_SEXP(igraph_vector_bool_t *v);
-SEXP R_igraph_0orvector_long_to_SEXP(igraph_vector_long_t *v);
-SEXP R_igraph_0orvector_complex_to_SEXP(igraph_vector_complex_t *v);
-SEXP R_igraph_matrix_to_SEXP(igraph_matrix_t *m);
-SEXP R_igraph_matrix_complex_to_SEXP(igraph_matrix_complex_t *m);
-SEXP R_igraph_0ormatrix_complex_to_SEXP(igraph_matrix_complex_t *m);
-SEXP R_igraph_strvector_to_SEXP(const igraph_strvector_t *m);
-SEXP R_igraph_to_SEXP(igraph_t *graph);
-SEXP R_igraph_vectorlist_to_SEXP(const igraph_vector_ptr_t *ptr);
-void R_igraph_vectorlist_destroy(igraph_vector_ptr_t *ptr);
-SEXP R_igraph_hrg_to_SEXP(const igraph_hrg_t *hrg);
-SEXP R_igraph_sparsemat_to_SEXP(igraph_sparsemat_t *sp);
-SEXP R_igraph_0orsparsemat_to_SEXP(igraph_sparsemat_t *sp);
-SEXP R_igraph_plfit_result_to_SEXP(const igraph_plfit_result_t *plfit);
-
-int R_igraph_SEXP_to_strvector(SEXP rval, igraph_strvector_t *sv);
-int R_igraph_SEXP_to_strvector_copy(SEXP rval, igraph_strvector_t *sv);
-int R_SEXP_to_vector(SEXP sv, igraph_vector_t *v);
-int R_SEXP_to_vector_copy(SEXP sv, igraph_vector_t *v);
-int R_SEXP_to_matrix(SEXP pakl, igraph_matrix_t *akl);
-int R_SEXP_to_matrix_complex(SEXP pakl, igraph_matrix_complex_t *akl);
-int R_SEXP_to_igraph_matrix_copy(SEXP pakl, igraph_matrix_t *akl);
-int R_SEXP_to_igraph(SEXP graph, igraph_t *res);
-int R_SEXP_to_igraph_copy(SEXP graph, igraph_t *res);
-int R_SEXP_to_igraph_vs(SEXP rit, igraph_t *graph, igraph_vs_t *it);
-int R_SEXP_to_igraph_es(SEXP rit, igraph_t *graph, igraph_es_t *it);
-int R_SEXP_to_igraph_adjlist(SEXP vectorlist, igraph_adjlist_t *ptr);
-int R_SEXP_to_vector_bool(SEXP sv, igraph_vector_bool_t *v);
-int R_SEXP_to_vector_int(SEXP sv, igraph_vector_int_t *v);
-int R_SEXP_to_vector_long_copy(SEXP sv, igraph_vector_long_t *v);
-int R_SEXP_to_hrg(SEXP shrg, igraph_hrg_t *hrg);
-int R_SEXP_to_hrg_copy(SEXP shrg, igraph_hrg_t *hrg);
-int R_SEXP_to_sparsemat(SEXP pakl, igraph_sparsemat_t *akl);
-
-SEXP R_igraph_i_lang7(SEXP s, SEXP t, SEXP u, SEXP v, SEXP w, SEXP x, SEXP y)
-{
-    PROTECT(s);
-    PROTECT(t);
-    PROTECT(u);
-    s = LCONS(s, LCONS(t, LCONS(u, list4(v, w, x, y))));
-    UNPROTECT(3);
-    return s;
-}
-
-/* get the list element named str, or return NULL */
-/* from the R Manual */
-
-SEXP R_igraph_getListElement(SEXP list, const char *str)
-{
-  SEXP elmt = R_NilValue, names = getAttrib(list, R_NamesSymbol);
-  int i;
-  
-  for (i = 0; i < length(list); i++)
-    if(strcmp(CHAR(STRING_ELT(names, i)), str) == 0) {
-      elmt = VECTOR_ELT(list, i);
-      break;
-    }
-  return elmt;
-}
-
-/******************************************************
- * Attributes                                         *
- *****************************************************/
-
-int R_SEXP_to_attr_comb(SEXP input, igraph_attribute_combination_t *comb) {
-  long int i, n=GET_LENGTH(input);
-  SEXP names=GET_NAMES(input);
-  
-  igraph_attribute_combination_init(comb);
-  
-  for (i=0; i<n; i++) {
-    const char *n;
-    igraph_attribute_combination_type_t type;
-    void *func;
-    
-    /* Name */
-    if (!isNull(names)) {
-      n=CHAR(STRING_ELT(names, i));
-    }
-    if (isNull(names) || strlen(n)==0) {
-      n=0;
-    }
-
-    /* Type and function, if any */
-    if (isFunction(VECTOR_ELT(input, i))) {
-      type=IGRAPH_ATTRIBUTE_COMBINE_FUNCTION;
-      func=VECTOR_ELT(input, i);      
-    } else {
-      type=REAL(AS_NUMERIC(VECTOR_ELT(input, i)))[0];
-      func=0;
-    }
-    igraph_attribute_combination_add(comb, n, type, func);
-  }
-  
-  return 0;
-}
-
-int R_igraph_attribute_init(igraph_t *graph, igraph_vector_ptr_t *attr) {
-  SEXP result, names, gal;
-  long int i;
-  long int attrno;
-  PROTECT(result=NEW_LIST(4));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(3));
-  REAL(VECTOR_ELT(result, 0))[0]=0; /* R objects */
-  REAL(VECTOR_ELT(result, 0))[1]=1; /* igraph_t objects */
-  REAL(VECTOR_ELT(result, 0))[2]=1; /* whether the graph is safe */
-  for (i=1; i<3; i++) {
-    SET_VECTOR_ELT(result, i+1, NEW_LIST(0)); /* gal, val, eal */
-  }
-  graph->attr=result;
-
-  /* Add graph attributes */
-  attrno= attr==NULL ? 0 : igraph_vector_ptr_size(attr);
-  SET_VECTOR_ELT(result, 1, NEW_LIST(attrno));
-  gal=VECTOR_ELT(result, 1);
-  PROTECT(names=NEW_CHARACTER(attrno));
-  for (i=0; i<attrno; i++) {
-    igraph_attribute_record_t *rec=VECTOR(*attr)[i];
-    igraph_vector_t *vec;
-    igraph_strvector_t *strvec;
-    SET_STRING_ELT(names, i, mkChar(rec->name));
-    SET_VECTOR_ELT(gal, i, R_NilValue);
-    switch (rec->type) {
-    case IGRAPH_ATTRIBUTE_NUMERIC:
-      vec=(igraph_vector_t*) rec->value;
-      if (igraph_vector_size(vec) > 0) {
-	SET_VECTOR_ELT(gal, i, NEW_NUMERIC(1));
-	REAL(VECTOR_ELT(gal, i))[0]=VECTOR(*vec)[0];
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_STRING:
-      strvec=(igraph_strvector_t*) rec->value;
-      if (igraph_strvector_size(strvec) > 0) {
-	SET_VECTOR_ELT(gal, i, NEW_CHARACTER(1));
-	SET_STRING_ELT(VECTOR_ELT(gal,i), 0, mkChar(STR(*strvec, 0)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_R_OBJECT:
-      IGRAPH_ERROR("R_objects not implemented yet", IGRAPH_UNIMPLEMENTED);
-      break;
-    case IGRAPH_ATTRIBUTE_DEFAULT:
-    case IGRAPH_ATTRIBUTE_PY_OBJECT:
-    default:
-      IGRAPH_ERROR("Unknown attribute type, this should not happen",
-		   IGRAPH_EINTERNAL);
-      break;
-    }
-  }
-  SET_NAMES(gal, names);
-  
-  UNPROTECT(1);
-  return 0;
-}
-
-void R_igraph_attribute_destroy(igraph_t *graph) {
-  SEXP attr=graph->attr;
-  REAL(VECTOR_ELT(attr, 0))[1] -= 1; /* refcount for igraph_t */
-  if (REAL(VECTOR_ELT(attr, 0))[1]==0 && 
-      REAL(VECTOR_ELT(attr, 0))[2]==1) {
-    UNPROTECT_PTR(attr);
-  }
-  graph->attr=0;
-}
-
-/* If not copying all three attribute kinds are requested, then 
-   we don't refcount, but really copy the requested ones, because 
-   1) we can only refcount all three at the same time, and 
-   2) the not-copied attributes will be set up by subsequent calls 
-      to permute_vertices and/or permute/edges anyway. */
-
-int R_igraph_attribute_copy(igraph_t *to, const igraph_t *from,
-			    igraph_bool_t ga, igraph_bool_t va, igraph_bool_t ea) {
-  SEXP fromattr=from->attr;
-  if (ga && va && ea) {
-    to->attr=from->attr;
-    REAL(VECTOR_ELT(fromattr, 0))[1] += 1; /* refcount only */
-    if (REAL(VECTOR_ELT(fromattr, 0))[1] == 1) {
-      PROTECT(to->attr);
-    }
-  } else {
-    R_igraph_attribute_init(to,0); /* Sets up many things */
-    SEXP toattr=to->attr;
-    if (ga) {
-      SET_VECTOR_ELT(toattr, 1, duplicate(VECTOR_ELT(fromattr, 1)));
-    } 
-    if (va) {
-      SET_VECTOR_ELT(toattr, 2, duplicate(VECTOR_ELT(fromattr, 2)));      
-    } 
-    if (ea) {
-      SET_VECTOR_ELT(toattr, 3, duplicate(VECTOR_ELT(fromattr, 3)));      
-    }
-  }
-  return 0;
-}
-
-int R_igraph_attribute_add_vertices(igraph_t *graph, long int nv, 
-				    igraph_vector_ptr_t *nattr) {
-  SEXP attr=graph->attr;
-  SEXP val, rep=0, names, newnames;
-  igraph_vector_t news;
-  long int valno, i, origlen, nattrno, newattrs;
-  if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) {
-    SEXP newattr;
-    PROTECT(newattr=duplicate(attr));
-    REAL(VECTOR_ELT(attr, 0))[1] -= 1;
-    if (REAL(VECTOR_ELT(attr, 0))[1] == 0) {
-      UNPROTECT_PTR(attr);
-    }
-    REAL(VECTOR_ELT(newattr, 0))[0] = 0;
-    REAL(VECTOR_ELT(newattr, 0))[1] = 1;
-    attr=graph->attr=newattr;
-  }
-
-  val=VECTOR_ELT(attr, 2);
-  valno=GET_LENGTH(val);  
-  names=GET_NAMES(val);
-  if (nattr==NULL) { 
-    nattrno=0;
-  } else {
-    nattrno=igraph_vector_ptr_size(nattr); 
-  }
-  origlen=igraph_vcount(graph)-nv;
-
-  /* First add the new attributes, if any */
-  newattrs=0;
-  IGRAPH_VECTOR_INIT_FINALLY(&news, 0);
-  for (i=0; i<nattrno; i++) {
-    igraph_attribute_record_t *nattr_entry=VECTOR(*nattr)[i];
-    const char *nname=nattr_entry->name;
-    long int j; 
-    igraph_bool_t l=0;
-    for (j=0; !l && j<valno; j++) {
-      l=!strcmp(nname, CHAR(STRING_ELT(names, j)));
-    }
-    if (!l) {
-      newattrs++;
-      IGRAPH_CHECK(igraph_vector_push_back(&news, i));
-    }
-  }
-  if (newattrs != 0) {
-    SEXP app, newval;
-    PROTECT(app=NEW_LIST(newattrs));
-    PROTECT(newnames=NEW_CHARACTER(newattrs));
-    PROTECT(rep=EVAL(lang3(install("rep"), ScalarLogical(NA_LOGICAL), 
-			   ScalarInteger(origlen))));
-    for (i=0; i<newattrs; i++) {
-      igraph_attribute_record_t *tmp=
-	VECTOR(*nattr)[(long int)VECTOR(news)[i]];
-      SET_VECTOR_ELT(app, i, rep);
-      SET_STRING_ELT(newnames, i, CREATE_STRING_VECTOR(tmp->name));
-    }
-    UNPROTECT(1); 		/* rep */
-    PROTECT(newval=EVAL(lang3(install("c"), val, app)));
-    PROTECT(newnames=EVAL(lang3(install("c"), names, newnames)));
-    SET_NAMES(newval, newnames);
-    SET_VECTOR_ELT(attr, 2, newval);
-    val=VECTOR_ELT(attr, 2);    
-    valno=GET_LENGTH(val);  
-    names=GET_NAMES(val);
-    UNPROTECT(4);
-    rep=0;
-  }
-  igraph_vector_destroy(&news);
-  IGRAPH_FINALLY_CLEAN(1);	/* news */
-
-  /* Now append the new values */
-  for (i=0; i<valno; i++) {
-    SEXP oldva=VECTOR_ELT(val, i), newva;
-    const char *sexpname=CHAR(STRING_ELT(names,i));
-    igraph_bool_t l=0;
-    long int j;
-    for (j=0; !l && j<nattrno; j++) {
-      igraph_attribute_record_t *tmp=VECTOR(*nattr)[j];
-      l=!strcmp(sexpname, tmp->name);
-    }
-    if (l) {
-      /* This attribute is present in nattr */
-      SEXP app=0;
-      igraph_attribute_record_t *tmprec=VECTOR(*nattr)[j-1];
-      switch (tmprec->type) {
-      case IGRAPH_ATTRIBUTE_NUMERIC:
-	if (nv != igraph_vector_size(tmprec->value)) {
-	  IGRAPH_ERROR("Invalid attribute length", IGRAPH_EINVAL);
-	}
-	PROTECT(app=NEW_NUMERIC(nv));
-	igraph_vector_copy_to(tmprec->value, REAL(app));
-	break;
-      case IGRAPH_ATTRIBUTE_STRING:
-	if (nv != igraph_strvector_size(tmprec->value)) {
-	  IGRAPH_ERROR("Invalid attribute length", IGRAPH_EINVAL);
-	}
-	PROTECT(app=R_igraph_strvector_to_SEXP(tmprec->value));
-	break;
-      case IGRAPH_ATTRIBUTE_R_OBJECT:
-	/* TODO */
-	IGRAPH_ERROR("R_objects not implemented yet", IGRAPH_UNIMPLEMENTED);
-	break;
-      default:
-	warning("Ignoring unknown attribute type");
-	break;
-      }
-      if (app!=0) {
-	PROTECT(newva=EVAL(lang3(install("c"), oldva, app)));
-	SET_VECTOR_ELT(val, i, newva);
-	UNPROTECT(2);		/* app & newva */
-      }
-    } else {
-      /* No such attribute, append NA's */
-      if (rep==0) {
-	PROTECT(rep=EVAL(lang3(install("rep"), ScalarLogical(NA_LOGICAL), 
-			       ScalarInteger(nv))));
-      }
-      PROTECT(newva=EVAL(lang3(install("c"), oldva, rep)));
-      SET_VECTOR_ELT(val, i, newva);
-      UNPROTECT(1); 		/* newva */
-    }
-  }
-  if (rep != 0) {
-    UNPROTECT(1);
-  } 
-  
-  return 0;
-}
-
-/* void R_igraph_attribute_delete_vertices(igraph_t *graph,  */
-/* 					const igraph_vector_t *eidx, */
-/* 					const igraph_vector_t *vidx) { */
-/*   SEXP attr=graph->attr; */
-/*   SEXP eal, val; */
-/*   long int valno, ealno, i; */
-/*   if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) { */
-/*     SEXP newattr; */
-/*     PROTECT(newattr=duplicate(attr)); */
-/*     REAL(VECTOR_ELT(attr, 0))[1] -= 1; */
-/*     if (REAL(VECTOR_ELT(attr, 0))[1] == 0) { */
-/*       UNPROTECT_PTR(attr); */
-/*     } */
-/*     REAL(VECTOR_ELT(newattr, 0))[0] = 0; */
-/*     REAL(VECTOR_ELT(newattr, 0))[1] = 1; */
-/*     attr=graph->attr=newattr; */
-/*   } */
-
-/*   /\* Vertices *\/ */
-/*   val=VECTOR_ELT(attr, 2); */
-/*   valno=GET_LENGTH(val); */
-/*   for (i=0; i<valno; i++) { */
-/*     SEXP oldva=VECTOR_ELT(val, i), newva, ss; */
-/*     long int origlen=GET_LENGTH(oldva); */
-/*     long int newlen=0, j; */
-/*     for (j=0; j<igraph_vector_size(vidx); j++) { */
-/*       if (VECTOR(*vidx)[j] > 0) { */
-/* 	newlen++; */
-/*       } */
-/*     } */
-/*     PROTECT(ss=NEW_NUMERIC(newlen)); */
-/*     for (j=0; j<origlen; j++) { */
-/*       if (VECTOR(*vidx)[j]>0) { */
-/* 	REAL(ss)[(long int)VECTOR(*vidx)[j]-1]=j+1; */
-/*       } */
-/*     } */
-/*     PROTECT(newva=EVAL(lang3(install("["), oldva, ss))); */
-/*     SET_VECTOR_ELT(val, i, newva); */
-/*     UNPROTECT(2); */
-/*   }     */
-
-/*   /\* Edges *\/ */
-/*   eal=VECTOR_ELT(attr, 3); */
-/*   ealno=GET_LENGTH(eal); */
-/*   for (i=0; i<ealno; i++) { */
-/*     SEXP oldea=VECTOR_ELT(eal, i), newea, ss; */
-/*     long int origlen=GET_LENGTH(oldea); */
-/*     long int newlen=0, j; */
-/*     /\* calculate new length *\/ */
-/*     for (j=0; j<origlen; j++) { */
-/*       if (VECTOR(*eidx)[j] > 0) { */
-/* 	newlen++; */
-/*       } */
-/*     }     */
-/*     PROTECT(ss=NEW_NUMERIC(newlen)); */
-/*     for (j=0; j<origlen; j++) { */
-/*       if (VECTOR(*eidx)[j]>0) { */
-/* 	REAL(ss)[(long int)VECTOR(*eidx)[j]-1]=j+1; */
-/*       } */
-/*     } */
-/*     PROTECT(newea=EVAL(lang3(install("["), oldea, ss))); */
-/*     SET_VECTOR_ELT(eal, i, newea); */
-/*     UNPROTECT(2); */
-/*   } */
-/* } */
-
-int R_igraph_attribute_permute_vertices(const igraph_t *graph,
-					igraph_t *newgraph,
-					const igraph_vector_t *idx) {
-
-  if (graph == newgraph) {
-
-    SEXP attr=newgraph->attr;
-    SEXP val, toval;
-    SEXP names;
-    long int i, valno;
-    long int idxlen=igraph_vector_size(idx);
-    SEXP ss;
-
-    /* We copy if we need to */
-    if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) {
-      SEXP newattr;
-      PROTECT(newattr=duplicate(attr));
-      REAL(VECTOR_ELT(attr, 0))[1] -= 1;
-      if (REAL(VECTOR_ELT(attr, 0))[1] == 0) {
-	UNPROTECT_PTR(attr);
-      }
-      REAL(VECTOR_ELT(newattr, 0))[0] = 0;
-      REAL(VECTOR_ELT(newattr, 0))[1] = 1;
-      attr=newgraph->attr=newattr;
-    }
-
-    val=VECTOR_ELT(attr,2);
-    valno=GET_LENGTH(val);
-    
-    /* If we have no vertex attributes, then we don't need to do anything */
-    if (valno==0) { return 0; }
-    
-    /* Convert idx to an R object, we will use this for indexing */
-    PROTECT(ss=NEW_INTEGER(idxlen));
-    for (i=0; i<idxlen; i++) {
-      INTEGER(ss)[i] = VECTOR(*idx)[i]+1;
-    }
-    
-    for (i=0; i<valno; i++) {
-      SEXP oldva=VECTOR_ELT(val, i);
-      SEXP newva;
-      
-      /* We do NOT do any copying, the attributes were already copied, 
-	 we're doing this in place. */
-      PROTECT(newva=EVAL(lang3(install("["), oldva, ss)));
-      SET_VECTOR_ELT(val, i, newva);
-      UNPROTECT(1);
-    }
-    
-    UNPROTECT(1);    
-
-  } else {
-
-    SEXP attr=graph->attr;
-    SEXP toattr=newgraph->attr;
-    SEXP val, toval;
-    SEXP names;
-    long int i, valno;
-    long int idxlen=igraph_vector_size(idx);
-    SEXP ss;
-
-    val=VECTOR_ELT(attr,2);
-    valno=GET_LENGTH(val);
-    
-    /* If we have no vertex attributes, then we don't need to do anything */
-    if (valno==0) { return 0; }
-    
-    /* Convert idx to an R object, we will use this for indexing */
-    PROTECT(ss=NEW_INTEGER(idxlen));
-    for (i=0; i<idxlen; i++) {
-      INTEGER(ss)[i] = VECTOR(*idx)[i]+1;
-    }
-    
-    /* Resize the vertex attribute list in 'newgraph' */
-    PROTECT(toval=NEW_LIST(valno));
-    PROTECT(names=GET_NAMES(val));
-    SET_NAMES(toval, names);
-    UNPROTECT(1);
-    
-    for (i=0; i<valno; i++) {
-      SEXP oldva=VECTOR_ELT(val, i);
-      SEXP newva;
-      
-      PROTECT(newva=EVAL(lang3(install("["), oldva, ss)));
-      SET_VECTOR_ELT(toval, i, newva);
-      UNPROTECT(1);
-    }
-    
-    SET_VECTOR_ELT(toattr, 2, toval);
-    UNPROTECT(2);
-  }
-  
-  return 0;
-}
-
-int R_igraph_attribute_add_edges(igraph_t *graph, 
-				 const igraph_vector_t *edges,
-				 igraph_vector_ptr_t *nattr) {
-  SEXP attr=graph->attr;
-  SEXP eal, rep=0, names, newnames;
-  igraph_vector_t news;
-  long int ealno, i, origlen, nattrno, newattrs;  
-  long int ne=igraph_vector_size(edges)/2;
-  if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) {
-    SEXP newattr;
-    PROTECT(newattr=duplicate(attr));
-    REAL(VECTOR_ELT(attr, 0))[1] -= 1;
-    if (REAL(VECTOR_ELT(attr, 0))[1] == 0) {
-      UNPROTECT_PTR(attr);
-    }
-    REAL(VECTOR_ELT(newattr, 0))[0] = 0;
-    REAL(VECTOR_ELT(newattr, 0))[1] = 1;
-    attr=graph->attr=newattr;
-  }
-
-  eal=VECTOR_ELT(attr, 3);
-  ealno=GET_LENGTH(eal);
-  names=GET_NAMES(eal);
-  if (nattr==NULL) {
-    nattrno=0; 
-  } else {
-    nattrno=igraph_vector_ptr_size(nattr);
-  }
-  origlen=igraph_ecount(graph)-ne;
-
-  /* First add the new attributes, if any */
-  newattrs=0;
-  IGRAPH_VECTOR_INIT_FINALLY(&news, 0);
-  for (i=0; i<nattrno; i++) {
-    igraph_attribute_record_t *nattr_entry=VECTOR(*nattr)[i];
-    const char *nname=nattr_entry->name;
-    long int j;
-    igraph_bool_t l=0;
-    for (j=0; !l && j<ealno; j++) {
-      l=!strcmp(nname, CHAR(STRING_ELT(names, j)));
-    }
-    if (!l) {
-      newattrs++;
-      IGRAPH_CHECK(igraph_vector_push_back(&news, i));
-    }
-  }
-  if (newattrs != 0) {
-    SEXP app, neweal;
-    PROTECT(app=NEW_LIST(newattrs));
-    PROTECT(newnames=NEW_CHARACTER(newattrs));
-    PROTECT(rep=EVAL(lang3(install("rep"), ScalarLogical(NA_LOGICAL),
-			   ScalarInteger(origlen))));
-    for (i=0; i<newattrs; i++) {
-      igraph_attribute_record_t *tmp=
-	VECTOR(*nattr)[ (long int) VECTOR(news)[i]];
-      SET_VECTOR_ELT(app, i, rep);
-      SET_STRING_ELT(newnames, i, CREATE_STRING_VECTOR(tmp->name));
-    }
-    UNPROTECT(1);		/* rep */
-    PROTECT(neweal=EVAL(lang3(install("c"), eal, app)));
-    PROTECT(newnames=EVAL(lang3(install("c"), names, newnames)));
-    SET_NAMES(neweal, newnames);
-    SET_VECTOR_ELT(attr, 3, neweal);
-    eal=VECTOR_ELT(attr, 3);
-    ealno=GET_LENGTH(eal);
-    names=GET_NAMES(eal);
-    UNPROTECT(4);
-    rep=0;
-  }
-  igraph_vector_destroy(&news);
-  IGRAPH_FINALLY_CLEAN(1);
-
-  /* Now append the new values */
-  for (i=0; i<ealno; i++) {
-    SEXP oldea=VECTOR_ELT(eal, i), newea;
-    const char *sexpname=CHAR(STRING_ELT(names, i));
-    igraph_bool_t l=0;
-    long int j;
-    for (j=0; !l && j<nattrno; j++) {
-      igraph_attribute_record_t *tmp=VECTOR(*nattr)[j];
-      l=!strcmp(sexpname, tmp->name);
-    }
-    if (l) {
-      /* This attribute is present in nattr */
-      SEXP app=0;
-      igraph_attribute_record_t *tmprec=VECTOR(*nattr)[j-1];
-      switch (tmprec->type) {
-      case IGRAPH_ATTRIBUTE_NUMERIC:
-	if (ne != igraph_vector_size(tmprec->value)) {
-	  IGRAPH_ERROR("Invalid attribute length", IGRAPH_EINVAL);
-	}
-	PROTECT(app=NEW_NUMERIC(ne));
-	igraph_vector_copy_to(tmprec->value, REAL(app));
-	break;
-      case IGRAPH_ATTRIBUTE_STRING:
-	if (ne != igraph_strvector_size(tmprec->value)) {
-	  IGRAPH_ERROR("Invalid attribute length", IGRAPH_EINVAL);
-	}
-	PROTECT(app=R_igraph_strvector_to_SEXP(tmprec->value));
-	break;
-      case IGRAPH_ATTRIBUTE_R_OBJECT:
-	/* TODO */
-	IGRAPH_ERROR("R objects not implemented yet", IGRAPH_UNIMPLEMENTED);
-	break;
-      default:
-	warning("Ignoring unknown attribute type");
-	break;
-      }
-      if (app!=0) {
-	PROTECT(newea=EVAL(lang3(install("c"), oldea, app)));
-	SET_VECTOR_ELT(eal, i, newea);
-	UNPROTECT(2);		/* app & newea */
-      }
-    } else {
-      /* No such attribute, append NA's */
-      if (rep==0) {
-	PROTECT(rep=EVAL(lang3(install("rep"), ScalarLogical(NA_LOGICAL),
-			       ScalarInteger(ne))));
-      }
-      PROTECT(newea=EVAL(lang3(install("c"), oldea, rep)));
-      SET_VECTOR_ELT(eal, i, newea);
-      UNPROTECT(1);		/* newea */
-    }
-  }
-  if (rep != 0) {
-    UNPROTECT(1);
-  }
-
-  return 0;
-}
-
-/* void R_igraph_attribute_delete_edges(igraph_t *graph,  */
-/* 				     const igraph_vector_t *idx) { */
-/*   SEXP attr=graph->attr; */
-/*   SEXP eal; */
-/*   long int ealno, i; */
-/*   if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) { */
-/*     SEXP newattr; */
-/*     PROTECT(newattr=duplicate(attr)); */
-/*     REAL(VECTOR_ELT(attr, 0))[1] -= 1; */
-/*     if (REAL(VECTOR_ELT(attr, 0))[1] == 0) { */
-/*       UNPROTECT_PTR(attr); */
-/*     } */
-/*     REAL(VECTOR_ELT(newattr, 0))[0] = 0; */
-/*     REAL(VECTOR_ELT(newattr, 0))[1] = 1; */
-/*     attr=graph->attr=newattr; */
-/*   } */
-
-/*   eal=VECTOR_ELT(attr, 3); */
-/*   ealno=GET_LENGTH(eal); */
-/*   for (i=0; i<ealno; i++) { */
-/*     SEXP oldea=VECTOR_ELT(eal, i), newea, ss; */
-/*     long int origlen=GET_LENGTH(oldea); */
-/*     long int newlen=0, j; */
-/*     /\* create subscript vector *\/ */
-/*     for (j=0; j<origlen; j++) { */
-/*       if (VECTOR(*idx)[j] > 0) { */
-/* 	newlen++; */
-/*       } */
-/*     } */
-/*     PROTECT(ss=NEW_NUMERIC(newlen)); */
-/*     for (j=0; j<origlen; j++) { */
-/*       if (VECTOR(*idx)[j] > 0) { */
-/* 	REAL(ss)[(long int)VECTOR(*idx)[j]-1] = j+1; */
-/*       } */
-/*     } */
-/*     PROTECT(newea=EVAL(lang3(install("["), oldea, ss))); */
-/*     SET_VECTOR_ELT(eal, i, newea); */
-/*     UNPROTECT(2); */
-/*   } */
-/* } */
-
-int R_igraph_attribute_permute_edges(const igraph_t *graph,
-				     igraph_t *newgraph,
-				     const igraph_vector_t *idx) {
-
-  if (graph==newgraph) {
-    
-    SEXP attr=newgraph->attr;
-    SEXP eal;
-    long int i, ealno;
-    long int idxlen=igraph_vector_size(idx);
-    SEXP ss;
-    
-    /* We copy if we need to */
-    if (REAL(VECTOR_ELT(attr, 0))[0]+REAL(VECTOR_ELT(attr, 0))[1] > 1) {
-      SEXP newattr;
-      PROTECT(newattr=duplicate(attr));
-      REAL(VECTOR_ELT(attr, 0))[1] -= 1;
-      if (REAL(VECTOR_ELT(attr, 0))[1] == 0) {
-      UNPROTECT_PTR(attr);
-      }
-      REAL(VECTOR_ELT(newattr, 0))[0] = 0;
-      REAL(VECTOR_ELT(newattr, 0))[1] = 1;
-      attr=newgraph->attr=newattr;
-    }
-    
-    eal=VECTOR_ELT(attr,3);
-    ealno=GET_LENGTH(eal);
-    
-    /* If we have no edge attributes, then we don't need to do anything */
-    if (ealno==0) { return 0; }
-    
-    /* Convert idx to an R object, we will use this for indexing */
-    PROTECT(ss=NEW_INTEGER(idxlen));
-    for (i=0; i<idxlen; i++) {
-      INTEGER(ss)[i] = VECTOR(*idx)[i]+1;
-    }
-    
-    for (i=0; i<ealno; i++) {
-      SEXP oldea=VECTOR_ELT(eal, i);
-      SEXP newea;
-      
-      /* We do NOT do any copying, the attributes were already copied, 
-	 we're doing this in place. */
-      PROTECT(newea=EVAL(lang3(install("["), oldea, ss)));
-      SET_VECTOR_ELT(eal, i, newea);
-      UNPROTECT(1);
-    }
-    
-    UNPROTECT(1);
-
-  } else { 
-
-    SEXP attr=graph->attr;
-    SEXP toattr=newgraph->attr;
-    SEXP eal, toeal;
-    SEXP names;
-    long int i, ealno;
-    long int idxlen=igraph_vector_size(idx);
-    SEXP ss;
-
-    eal=VECTOR_ELT(attr,3);
-    ealno=GET_LENGTH(eal);
-    
-    /* If we have no vertex attributes, then we don't need to do anything */
-    if (ealno==0) { return 0; }
-    
-    /* Convert idx to an R object, we will use this for indexing */
-    PROTECT(ss=NEW_INTEGER(idxlen));
-    for (i=0; i<idxlen; i++) {
-      INTEGER(ss)[i] = VECTOR(*idx)[i]+1;
-    }
-    
-    /* Resize the vertex attribute list in 'newgraph' */
-    PROTECT(toeal=NEW_LIST(ealno));
-    PROTECT(names=GET_NAMES(eal));
-    SET_NAMES(toeal, names);
-    UNPROTECT(1);
-    
-    for (i=0; i<ealno; i++) {
-      SEXP oldea=VECTOR_ELT(eal, i);
-      SEXP newea;
-      
-      PROTECT(newea=EVAL(lang3(install("["), oldea, ss)));
-      SET_VECTOR_ELT(toeal, i, newea);
-      UNPROTECT(1);
-    }
-    
-    SET_VECTOR_ELT(toattr, 3, toeal);
-    UNPROTECT(2);
-  }
-  
-  return 0;
-}
-
-int R_igraph_attribute_get_info(const igraph_t *graph,
-				igraph_strvector_t *gnames,
-				igraph_vector_t *gtypes,
-				igraph_strvector_t *vnames,
-				igraph_vector_t *vtypes,
-				igraph_strvector_t *enames,
-				igraph_vector_t *etypes) {
-  igraph_strvector_t *names[3] = { gnames, vnames, enames };
-  igraph_vector_t *types[3] = { gtypes, vtypes, etypes };
-  long int i, j;
-
-  SEXP attr=graph->attr;
-
-  for (i=0; i<3; i++) {
-    igraph_strvector_t *n=names[i];
-    igraph_vector_t *t=types[i];
-    SEXP al=VECTOR_ELT(attr, i+1);
-
-    if (n) {			/* return names */
-      SEXP names=GET_NAMES(al);
-      R_igraph_SEXP_to_strvector_copy(names, n);
-    }
-
-    if (t) {			/* return types */
-      igraph_vector_resize(t, GET_LENGTH(al));
-      for (j=0; j<GET_LENGTH(al); j++) {
-	SEXP a=VECTOR_ELT(al, j);
-	if (TYPEOF(a)==REALSXP || TYPEOF(a)==INTSXP) {
-	  VECTOR(*t)[j]=IGRAPH_ATTRIBUTE_NUMERIC;
-	} else if (IS_CHARACTER(a)) {
-	  VECTOR(*t)[j]=IGRAPH_ATTRIBUTE_STRING;
-	} else {
-	  VECTOR(*t)[j]=IGRAPH_ATTRIBUTE_R_OBJECT;
-	}
-      }
-    }
-  }
-
-  return 0;
-}
-
-igraph_bool_t R_igraph_attribute_has_attr(const igraph_t *graph,
-					  igraph_attribute_elemtype_t type,
-					  const char *name) {
-  long int attrnum;
-  SEXP res;
-  
-  switch (type) {
-  case IGRAPH_ATTRIBUTE_GRAPH:
-    attrnum=1;
-    break;
-  case IGRAPH_ATTRIBUTE_VERTEX:
-    attrnum=2;
-    break;
-  case IGRAPH_ATTRIBUTE_EDGE:
-    attrnum=3;
-    break;
-  default:
-    IGRAPH_ERROR("Unkwown attribute element type", IGRAPH_EINVAL);
-    break;
-  }
-  
-  res=R_igraph_getListElement(VECTOR_ELT(graph->attr, attrnum), name);
-  return res != R_NilValue;
-}
-
-int R_igraph_attribute_gettype(const igraph_t *graph,
-			       igraph_attribute_type_t *type,
-			       igraph_attribute_elemtype_t elemtype,
-			       const char *name) {
-  long int attrnum;
-  SEXP res;
-  
-  switch (elemtype) {
-  case IGRAPH_ATTRIBUTE_GRAPH:
-    attrnum=1;
-    break;
-  case IGRAPH_ATTRIBUTE_VERTEX:
-    attrnum=2;
-    break;
-  case IGRAPH_ATTRIBUTE_EDGE:
-    attrnum=3;
-    break;
-  default:
-    IGRAPH_ERROR("Unkwown attribute element type", IGRAPH_EINVAL);
-    break;
-  }
-  
-  res=R_igraph_getListElement(VECTOR_ELT(graph->attr, attrnum), name);
-  if (IS_NUMERIC(res) || IS_INTEGER(res)) {
-    *type=IGRAPH_ATTRIBUTE_NUMERIC;
-  } else if (IS_CHARACTER(res)) {
-    *type=IGRAPH_ATTRIBUTE_STRING;
-  } else {
-    *type=IGRAPH_ATTRIBUTE_R_OBJECT;
-  }
-  return 0;
-}
-
-int R_igraph_attribute_get_numeric_graph_attr(const igraph_t *graph,
-					      const char *name, 
-					      igraph_vector_t *value) {
-  SEXP gal=VECTOR_ELT(graph->attr, 1);
-  SEXP ga=R_igraph_getListElement(gal, name);
-  
-  if (ga == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-
-  PROTECT(ga=AS_NUMERIC(ga));
-  
-  IGRAPH_CHECK(igraph_vector_resize(value, 1));
-  VECTOR(*value)[0]=REAL(ga)[0];
-
-  UNPROTECT(1);
-
-  return 0;
-}
-
-int R_igraph_attribute_get_string_graph_attr(const igraph_t *graph,
-					     const char *name,
-					     igraph_strvector_t *value) {
-  /* TODO: serialization */
-  SEXP gal=VECTOR_ELT(graph->attr, 1);
-  SEXP ga=R_igraph_getListElement(gal, name);
-  
-  if (ga == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-
-  PROTECT(ga=AS_CHARACTER(ga));
-
-  IGRAPH_CHECK(igraph_strvector_resize(value, 1));
-  IGRAPH_CHECK(igraph_strvector_set(value, 0, CHAR(STRING_ELT(ga, 0))));
-
-  UNPROTECT(1);
-
-  return 0;
-}
-
-int R_igraph_attribute_get_numeric_vertex_attr(const igraph_t *graph, 
-					       const char *name,
-					       igraph_vs_t vs,
-					       igraph_vector_t *value) {
-  /* TODO: serialization */
-  SEXP val=VECTOR_ELT(graph->attr, 2);
-  SEXP va=R_igraph_getListElement(val, name);
-  igraph_vector_t newvalue;
-
-  if (va == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-  PROTECT(va=AS_NUMERIC(va));
-
-  if (igraph_vs_is_all(&vs)) {
-    R_SEXP_to_vector_copy(va, &newvalue);
-    igraph_vector_destroy(value);
-    *value=newvalue;
-  } else {
-    igraph_vit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_vit_create(graph, vs, &it));
-    IGRAPH_FINALLY(igraph_vit_destroy, &it);
-    IGRAPH_CHECK(igraph_vector_resize(value, IGRAPH_VIT_SIZE(it)));
-    while (!IGRAPH_VIT_END(it)) {
-      long int v=IGRAPH_VIT_GET(it);
-      VECTOR(*value)[i]=REAL(va)[v];
-      IGRAPH_VIT_NEXT(it);
-      i++;
-    }
-    igraph_vit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  UNPROTECT(1);
-  return 0;
-}
-
-int R_igraph_attribute_get_string_vertex_attr(const igraph_t *graph, 
-					      const char *name,
-					      igraph_vs_t vs,
-					      igraph_strvector_t *value) {
-  /* TODO: serialization */
-  SEXP val, va;
-
-  val=VECTOR_ELT(graph->attr, 2);  
-  va=R_igraph_getListElement(val, name);
-  if (va == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-
-  PROTECT(va=AS_CHARACTER(va));
-  
-  if (igraph_vs_is_all(&vs)) {
-    R_igraph_SEXP_to_strvector_copy(va, value);
-  } else {
-    igraph_vit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_vit_create(graph, vs, &it));
-    IGRAPH_FINALLY(igraph_vit_destroy, &it);
-    IGRAPH_CHECK(igraph_strvector_resize(value, IGRAPH_VIT_SIZE(it)));
-    while (!IGRAPH_VIT_END(it)) {
-      long int v=IGRAPH_VIT_GET(it);
-      const char *str=CHAR(STRING_ELT(va, v));
-      IGRAPH_CHECK(igraph_strvector_set(value, i, str));
-      IGRAPH_VIT_NEXT(it);
-      i++;
-    }
-    igraph_vit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  UNPROTECT(1);
-
-  return 0;
-}
-
-int R_igraph_attribute_get_numeric_edge_attr(const igraph_t *graph,
-					     const char *name,
-					     igraph_es_t es,
-					     igraph_vector_t *value) {
-  /* TODO: serialization */
-  SEXP eal=VECTOR_ELT(graph->attr, 3);
-  SEXP ea=R_igraph_getListElement(eal, name);
-  igraph_vector_t newvalue;
-
-  if (ea == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-  PROTECT(ea=AS_NUMERIC(ea));
-  
-  if (igraph_es_is_all(&es)) {    
-    R_SEXP_to_vector_copy(AS_NUMERIC(ea), &newvalue);
-    igraph_vector_destroy(value);
-    *value=newvalue;
-  } else {
-    igraph_eit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_eit_create(graph, es, &it));
-    IGRAPH_FINALLY(igraph_eit_destroy, &it);
-    IGRAPH_CHECK(igraph_vector_resize(value, IGRAPH_EIT_SIZE(it)));
-    while (!IGRAPH_EIT_END(it)) {
-      long int e=IGRAPH_EIT_GET(it);
-      VECTOR(*value)[i]=REAL(ea)[e];
-      IGRAPH_EIT_NEXT(it);
-      i++;
-    }
-    igraph_eit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  UNPROTECT(1);
-  return 0;
-}
-
-int R_igraph_attribute_get_string_edge_attr(const igraph_t *graph,
-					    const char *name,
-					    igraph_es_t es,
-					    igraph_strvector_t *value) {
-  /* TODO: serialization */
-  SEXP eal=VECTOR_ELT(graph->attr, 3);
-  SEXP ea=R_igraph_getListElement(eal, name);
-  
-  if (ea == R_NilValue) {
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  }
-
-  PROTECT(ea=AS_CHARACTER(ea));
-  
-  if (igraph_es_is_all(&es)) {
-    R_igraph_SEXP_to_strvector_copy(ea, value);
-  } else {
-    igraph_eit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_eit_create(graph, es, &it));
-    IGRAPH_FINALLY(igraph_eit_destroy, &it);
-    IGRAPH_CHECK(igraph_strvector_resize(value, IGRAPH_EIT_SIZE(it)));
-    while (!IGRAPH_EIT_END(it)) {
-      long int e=IGRAPH_EIT_GET(it);
-      const char *str=CHAR(STRING_ELT(ea, e));
-      IGRAPH_CHECK(igraph_strvector_set(value, i, str));
-      IGRAPH_EIT_NEXT(it);
-      i++;
-    }
-    igraph_eit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-  
-  UNPROTECT(1);
-  
-  return 0;
-}
-
-SEXP R_igraph_ac_sum_numeric(SEXP attr, 
-			     const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    igraph_real_t s=0.0;
-    for (j=0; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      s += REAL(attr2)[src];
-    }
-    REAL(res)[i] = s;
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_prod_numeric(SEXP attr, 
-			      const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    igraph_real_t s=1.0;
-    for (j=0; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      s *= REAL(attr2)[src];
-    }
-    REAL(res)[i] = s;
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_min_numeric(SEXP attr, 
-			     const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    igraph_real_t m= n > 0 ? REAL(attr2)[(long) VECTOR(*v)[0] ] : NA_REAL;
-    for (j=1; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      igraph_real_t val= REAL(attr2)[src];
-      if (val < m) {
-	m=val;
-      }
-    }
-    REAL(res)[i] = m;
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_max_numeric(SEXP attr, 
-			     const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    igraph_real_t m= n > 0 ? REAL(attr2)[(long) VECTOR(*v)[0] ] : NA_REAL;
-    for (j=1; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      igraph_real_t val= REAL(attr2)[src];
-      if (val > m) {
-	m=val;
-      }
-    }
-    REAL(res)[i] = m;
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_random_numeric(SEXP attr, 
-				const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-
-  RNG_BEGIN();
-
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    if (n==0) {
-      REAL(res)[i]=NA_REAL;
-    } else if (n==1) {
-      REAL(res)[i]=REAL(attr2)[(long) VECTOR(*v)[0] ];
-    } else {
-      long int r=RNG_INTEGER(0,n-1);
-      REAL(res)[i]=REAL(attr2)[(long) VECTOR(*v)[r] ];
-    }
-  }
-
-  RNG_END();
-
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_first_numeric(SEXP attr, 
-			       const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    if (n==0) {
-      REAL(res)[i]=NA_REAL;
-    } else {
-      REAL(res)[i]=REAL(attr2)[(long) VECTOR(*v)[0] ];
-    }
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_last_numeric(SEXP attr, 
-			      const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    if (n==0) {
-      REAL(res)[i]=NA_REAL;
-    } else {
-      REAL(res)[i]=REAL(attr2)[(long) VECTOR(*v)[n-1] ];
-    }
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_mean_numeric(SEXP attr, 
-			      const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    igraph_real_t s= n>0 ? 0.0 : NA_REAL;
-    for (j=0; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      s += REAL(attr2)[src];
-    }
-    if (n>0) { s=s/n; }
-    REAL(res)[i] = s;
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_median_numeric(SEXP attr, 
-				const igraph_vector_ptr_t *merges) {
-  SEXP res;
-  SEXP attr2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(attr2=AS_NUMERIC(attr));
-  PROTECT(res=NEW_NUMERIC(len));
-
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    SEXP tmp, call, tmp2;
-    if (n==0) {
-      REAL(res)[i] = NA_REAL;
-    } else if (n==1) {
-      REAL(res)[i] = REAL(attr2)[ (long) VECTOR(*v)[0] ];
-    } else {
-      PROTECT(tmp=NEW_NUMERIC(n));
-      for (j=0; j<n; j++) {
-	long int src=VECTOR(*v)[j];
-	REAL(tmp)[j] = REAL(attr2)[src];
-      }
-      PROTECT(call=lang2(install("median"), tmp));
-      PROTECT(tmp2=EVAL(call));
-      REAL(res)[i] = REAL(tmp2)[0];
-      UNPROTECT(3);
-    }
-  }
-  
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_ac_all_other(SEXP attr,
-			   const igraph_vector_ptr_t *merges,
-			   const char *function_name,
-			   SEXP arg) {
-  SEXP res, res2;
-  long int i, len=igraph_vector_ptr_size(merges);
-
-  PROTECT(res=NEW_LIST(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    SEXP tmp;
-    PROTECT(tmp=NEW_NUMERIC(n));
-    for (j=0; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      REAL(tmp)[j] = src+1;
-    }
-    if (! arg) {
-      SET_VECTOR_ELT(res, i, 
-		     EVAL(lang2(install(function_name), 
-				EVAL(lang3(install("["), attr, tmp)))));
-    } else {
-      SET_VECTOR_ELT(res, i, 
-		     EVAL(lang3(install(function_name), 
-				EVAL(lang3(install("["), attr, tmp)),
-				arg)));
-    }
-    UNPROTECT(1);
-  }
-    
-  if (IS_VECTOR(attr)) {
-    /* try to simplify it */
-    igraph_bool_t good=1;
-    for (i=0; i<len; i++) {
-      if (GET_LENGTH(VECTOR_ELT(res, i)) != 1) {
-	good=0;
-	break;
-      }
-    }
-    if (good) {
-      res2=EVAL(lang3(install("unlist"), res, 
-		      ScalarLogical(0)));
-      UNPROTECT(1);
-      return res2;
-    }
-  }
-  
-  UNPROTECT(1);
-  return res;
-}
-
-SEXP R_igraph_ac_func(SEXP attr, 
-		      const igraph_vector_ptr_t *merges,
-		      SEXP func) {
-  SEXP res, res2;
-  long int i, len=igraph_vector_ptr_size(merges);
-  
-  PROTECT(res=NEW_LIST(len));
-  
-  for (i=0; i<len; i++) {
-    igraph_vector_t *v=VECTOR(*merges)[i];
-    long int j, n=igraph_vector_size(v);
-    SEXP tmp;
-    PROTECT(tmp=NEW_NUMERIC(n));
-    for (j=0; j<n; j++) {
-      long int src=VECTOR(*v)[j];
-      REAL(tmp)[j] = src+1;
-    }
-    SET_VECTOR_ELT(res, i, 
-		   EVAL(lang2(func, 
-			      EVAL(lang3(install("["), attr, tmp)))));
-    UNPROTECT(1);
-  }
-  
-  if (IS_VECTOR(attr)) {
-    /* try to simplify it */
-    igraph_bool_t good=1;
-    for (i=0; i<len; i++) {
-      if (GET_LENGTH(VECTOR_ELT(res, i)) != 1) {
-	good=0;
-	break;
-      }
-    }
-    if (good) {
-      res2=EVAL(lang3(install("unlist"), res, 
-		      ScalarLogical(0)));
-      UNPROTECT(1);
-      return res2;
-    }
-  }
-  
-  UNPROTECT(1);
-  return res;
-}
-
-int R_igraph_attribute_combine_vertices(const igraph_t *graph,
-			 igraph_t *newgraph,
-			 const igraph_vector_ptr_t *merges,
-			 const igraph_attribute_combination_t *comb) {
-  
-  SEXP attr=graph->attr;
-  SEXP toattr=newgraph->attr;
-  SEXP val=VECTOR_ELT(attr, 2);
-  SEXP toval;
-  long int i, j, valno=GET_LENGTH(val);
-  SEXP names, newnames;
-  SEXP res;
-  int keepno=0;
-  int *TODO;
-  void **funcs;
-  
-  /* Create the TODO list first */
-  PROTECT(names=GET_NAMES(val));
-  TODO=igraph_Calloc(valno, int);
-  if (!TODO) {
-    IGRAPH_ERROR("Cannot combine edge attributes", 
-		 IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_free, TODO);
-  funcs=igraph_Calloc(valno, void*);
-  if (!funcs) {
-    IGRAPH_ERROR("Cannot combine edge attributes",
-		 IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_free, funcs);
-  for (i=0; i<valno; i++) {
-    const char *name=CHAR(STRING_ELT(names, i));
-    igraph_attribute_combination_type_t todo;
-    void *voidfunc;
-    igraph_attribute_combination_query(comb, name, &todo, &voidfunc);
-    TODO[i]=todo;
-    funcs[i]=voidfunc;
-    if (todo != IGRAPH_ATTRIBUTE_COMBINE_IGNORE) {
-      keepno++;
-    }
-  }
-
-  /* Not safe to UNPROTECT attributes */
-  REAL(VECTOR_ELT(attr, 0))[2]=0;
-  REAL(VECTOR_ELT(toattr, 0))[2]=0;
-  
-  PROTECT(res=NEW_LIST(keepno));
-  PROTECT(newnames=NEW_CHARACTER(keepno));
-  for (i=0, j=0; i<valno; i++) {
-    SEXP va=VECTOR_ELT(val, i);
-    const char *name=CHAR(STRING_ELT(names, i));
-    igraph_attribute_combination_type_t todo=TODO[i];
-    igraph_attribute_type_t type;
-    void *voidfunc=funcs[i];
-    SEXP func;
-
-    /* What kind of attribute */
-    R_igraph_attribute_gettype(graph, &type, 
-			       IGRAPH_ATTRIBUTE_VERTEX, name);
-    
-    switch (todo) {
-    case IGRAPH_ATTRIBUTE_COMBINE_DEFAULT:
-      /* Never happens from R */
-    case IGRAPH_ATTRIBUTE_COMBINE_IGNORE:
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_FUNCTION:
-      func=(SEXP)voidfunc;
-      SET_VECTOR_ELT(res, j, R_igraph_ac_func(va, merges, func));
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_SUM:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_sum_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "sum", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_PROD:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_prod_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "prod", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MIN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_min_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "min", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MAX:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_max_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "max", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_RANDOM:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_random_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "sample", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_FIRST:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_first_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "head", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_LAST:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_last_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "tail", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MEAN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_mean_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "mean", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MEDIAN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_median_numeric(va, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "median", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_CONCAT:
-      SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(va, merges, "c", NULL));
-      break;
-    default:
-      IGRAPH_ERROR("Unknown attribute combination", 
-		   IGRAPH_UNIMPLEMENTED);
-      break;
-    }
-
-    if (todo != IGRAPH_ATTRIBUTE_COMBINE_IGNORE) {
-      SET_STRING_ELT(newnames, j, STRING_ELT(names, i));
-      j++;
-    }
-  } 
-
-  /* It is now safe to UNPROTECT attributes */
-  REAL(VECTOR_ELT(attr, 0))[2]=1;
-  REAL(VECTOR_ELT(toattr, 0))[2]=1;
-
-  igraph_free(funcs);
-  igraph_free(TODO);
-  IGRAPH_FINALLY_CLEAN(2);
-
-  SET_NAMES(res, newnames);
-  SET_VECTOR_ELT(toattr, 2, res);
-  UNPROTECT(3);
-  
-  return 0;
-}
-
-int R_igraph_attribute_combine_edges(const igraph_t *graph,
-			 igraph_t *newgraph,
-			 const igraph_vector_ptr_t *merges,
-			 const igraph_attribute_combination_t *comb) {
-
-  SEXP attr=graph->attr;
-  SEXP toattr=newgraph->attr;
-  SEXP eal=VECTOR_ELT(attr, 3);
-  SEXP toeal;
-  long int i, j, ealno=GET_LENGTH(eal);
-  SEXP names, newnames;
-  SEXP res;
-  int keepno=0;
-  int *TODO;
-  void **funcs;
-
-  /* Create the TODO list first */
-  PROTECT(names=GET_NAMES(eal));
-  TODO=igraph_Calloc(ealno, int);
-  if (!TODO) {
-    IGRAPH_ERROR("Cannot combine edge attributes", 
-		 IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_free, TODO);
-  funcs=igraph_Calloc(ealno, void*);
-  if (!funcs) {
-    IGRAPH_ERROR("Cannot combine edge attributes",
-		 IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_free, funcs);
-  for (i=0; i<ealno; i++) {
-    const char *name=CHAR(STRING_ELT(names, i));
-    igraph_attribute_combination_type_t todo;
-    void *voidfunc;
-    igraph_attribute_combination_query(comb, name, &todo, &voidfunc);
-    TODO[i]=todo;
-    funcs[i]=voidfunc;
-    if (todo != IGRAPH_ATTRIBUTE_COMBINE_IGNORE) {
-      keepno++;
-    }
-  }
-
-  /* Not safe to UNPROTECT attributes */
-  REAL(VECTOR_ELT(attr, 0))[2]=0;
-  REAL(VECTOR_ELT(toattr, 0))[2]=0;
-
-  PROTECT(res=NEW_LIST(keepno));
-  PROTECT(newnames=NEW_CHARACTER(keepno));
-  for (i=0, j=0; i<ealno; i++) {
-    SEXP ea=VECTOR_ELT(eal, i);
-    const char *name=CHAR(STRING_ELT(names, i));
-    igraph_attribute_combination_type_t todo=TODO[i];
-    igraph_attribute_type_t type;
-    void *voidfunc=funcs[i];
-    SEXP func;
-
-    /* What kind of attribute */
-    R_igraph_attribute_gettype(graph, &type, IGRAPH_ATTRIBUTE_EDGE, name);
-    
-    switch (todo) {
-    case IGRAPH_ATTRIBUTE_COMBINE_DEFAULT:
-      /* Never happens from R */
-    case IGRAPH_ATTRIBUTE_COMBINE_IGNORE:
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_FUNCTION:
-      func=(SEXP)voidfunc;
-      SET_VECTOR_ELT(res, j, R_igraph_ac_func(ea, merges, func));
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_SUM:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_sum_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "sum", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_PROD:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_prod_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "prod", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MIN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_min_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "min", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MAX:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_max_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "max", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_RANDOM:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_random_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "sample", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_FIRST:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_first_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "head", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_LAST:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_last_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "tail", 
-						     ScalarInteger(1)));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MEAN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_mean_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "mean", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_MEDIAN:
-      if (type==IGRAPH_ATTRIBUTE_NUMERIC) {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_median_numeric(ea, merges));
-      } else {
-	SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "median", NULL));
-      }
-      break;
-    case IGRAPH_ATTRIBUTE_COMBINE_CONCAT:
-      SET_VECTOR_ELT(res, j, R_igraph_ac_all_other(ea, merges, "c", NULL));
-      break;
-    default:
-      IGRAPH_ERROR("Unknown attribute combination", 
-		   IGRAPH_UNIMPLEMENTED);
-      break;
-    }
-
-    if (todo != IGRAPH_ATTRIBUTE_COMBINE_IGNORE) {
-      SET_STRING_ELT(newnames, j, STRING_ELT(names, i));
-      j++;
-    }
-  }   
-
-  /* It is now safe to UNPROTECT attributes */
-  REAL(VECTOR_ELT(attr, 0))[2]=1;
-  REAL(VECTOR_ELT(toattr, 0))[2]=1;
-
-  igraph_free(funcs);
-  igraph_free(TODO);
-  IGRAPH_FINALLY_CLEAN(2);
-
-  SET_NAMES(res, newnames);
-  SET_VECTOR_ELT(toattr, 3, res);
-  UNPROTECT(3);
-
-  return 0;
-}
-
-igraph_attribute_table_t R_igraph_attribute_table={
-  &R_igraph_attribute_init, &R_igraph_attribute_destroy,
-  &R_igraph_attribute_copy, &R_igraph_attribute_add_vertices,
-  &R_igraph_attribute_permute_vertices, 
-  &R_igraph_attribute_combine_vertices,
-  &R_igraph_attribute_add_edges,
-  &R_igraph_attribute_permute_edges,
-  &R_igraph_attribute_combine_edges,
-  &R_igraph_attribute_get_info,
-  &R_igraph_attribute_has_attr, &R_igraph_attribute_gettype,
-  &R_igraph_attribute_get_numeric_graph_attr,
-  &R_igraph_attribute_get_string_graph_attr,
-  &R_igraph_attribute_get_numeric_vertex_attr,
-  &R_igraph_attribute_get_string_vertex_attr,
-  &R_igraph_attribute_get_numeric_edge_attr,
-  &R_igraph_attribute_get_string_edge_attr
-};
-
-igraph_attribute_table_t *R_igraph_attribute_oldtable;
-
-/******************************************************
- * things to do before and after                      *
- * calling an interface function                      *
- *****************************************************/
-
-igraph_error_handler_t *R_igraph_oldhandler;
-
-void R_igraph_myhandler (const char *reason, const char *file,
-			 int line, int igraph_errno) {
-  IGRAPH_FINALLY_FREE();
-  error("At %s:%i : %s, %s", file, line, reason, 
-	igraph_strerror(igraph_errno));
-}
-
-void R_igraph_warning_handler(const char *reason, const char *file,
-			      int line, int igraph_errno) {
-  warning("At %s:%i :%s", file, line, reason);
-}
-
-extern int R_interrupts_pending;
-
-int R_igraph_interrupt_handler(void *data) {
-#if  ( defined(HAVE_AQUA) || defined(Win32) )
-  R_CheckUserInterrupt();
-#else
-  if (R_interrupts_pending) {
-    IGRAPH_FINALLY_FREE();
-    R_CheckUserInterrupt();
-  }
-#endif
-  return 0;
-}
-
-int R_igraph_progress_handler(const char *message, igraph_real_t percent,
-			      void * data) {
-  SEXP ec, rho;
-  int ecint;
-  PROTECT(rho = EVAL(lang2(install("getNamespace"), 
-			   ScalarString(mkChar("igraph"))))); 
-
-  PROTECT(ec=eval(lang3(install(".igraph.progress"), ScalarReal(percent), 
-			ScalarString(mkChar(message))), rho));
-  ecint=INTEGER(ec)[0];
-  UNPROTECT(2);
-  return ecint;
-}
-
-int R_igraph_status_handler(const char *message, void *data) {
-  SEXP ec;
-  int ecint;
-  PROTECT(ec=EVAL(lang2(install(".igraph.status"), 
-			ScalarString(mkChar(message)))));
-  ecint=INTEGER(ec)[0];
-  UNPROTECT(1);
-  return 0;
-}
-
-SEXP R_igraph_init(SEXP progress, SEXP status) {
-  igraph_set_error_handler(R_igraph_myhandler);
-  igraph_set_warning_handler(R_igraph_warning_handler);
-  igraph_set_interruption_handler(R_igraph_interrupt_handler);
-  igraph_i_set_attribute_table(&R_igraph_attribute_table);
-  if (LOGICAL(status)[0]) { 
-    igraph_set_status_handler(R_igraph_status_handler);
-  }
-  if (LOGICAL(progress)[0]) {
-    igraph_set_progress_handler(R_igraph_progress_handler);
-  }
-  return R_NilValue;
-}
-
-SEXP R_igraph_set_verbose(SEXP verbose) {
-  if (LOGICAL(verbose)[0]) {
-    igraph_set_status_handler(R_igraph_status_handler);    
-    igraph_set_progress_handler(R_igraph_progress_handler);
-  } else {
-    igraph_set_status_handler(0);
-    igraph_set_progress_handler(0);
-  }
-  return R_NilValue;
-}
-
-SEXP R_igraph_finalizer() {
-  SEXP rho;
-  PROTECT(rho = EVAL(lang2(install("getNamespace"), 
-			   ScalarString(mkChar("igraph")))));
-  eval(lang4(install(".igraph.progress"), ScalarReal(0.0), 
-	     ScalarString(mkChar("")), ScalarLogical(1)), rho);
-  UNPROTECT(1);
-  IGRAPH_FINALLY_FREE();
-  return R_NilValue;
-}
-
-/******************************************************
- * functions to convert igraph objects to SEXP
- *****************************************************/
-
-SEXP R_igraph_vector_to_SEXP(const igraph_vector_t *v) {
-  SEXP result;
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(v)));
-  igraph_vector_copy_to(v, REAL(result));
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vector_to_SEXPp1(const igraph_vector_t *v) {
-  SEXP result;
-  long int i, n=igraph_vector_size(v);
-
-  PROTECT(result=NEW_NUMERIC(n));
-  for (i=0; i<n; i++) {
-    REAL(result)[i]=VECTOR(*v)[i]+1;
-  }
-  UNPROTECT(1);
-  return result;
-}  
-
-SEXP R_igraph_0orvector_to_SEXP(igraph_vector_t *v) {
-  SEXP result;
-  if (v) {
-    PROTECT(result=R_igraph_vector_to_SEXP(v));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_0orvector_to_SEXPp1(igraph_vector_t *v) {
-  SEXP result;
-  if (v) {
-    PROTECT(result=R_igraph_vector_to_SEXPp1(v));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vector_bool_to_SEXP(igraph_vector_bool_t *v) {
-  SEXP result;
-  long int n=igraph_vector_bool_size(v);
-  
-  PROTECT(result=NEW_LOGICAL(n));
-  if (sizeof(igraph_bool_t)==sizeof(LOGICAL(result)[0])) {
-    igraph_vector_bool_copy_to(v, LOGICAL(result));
-  } else {
-    long int i;
-    for (i=0; i<n; i++) {
-      LOGICAL(result)[i] = VECTOR(*v)[i];
-    }
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vector_long_to_SEXP(igraph_vector_long_t *v) {
-  SEXP result;
-  long int i, n=igraph_vector_long_size(v);
-  double *rr;
-  
-  PROTECT(result=NEW_NUMERIC(n));
-  rr=REAL(result);
-  for (i=0; i<n; i++) {
-    rr[i] = VECTOR(*v)[i];
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vector_long_to_SEXPp1(igraph_vector_long_t *v) {
-  SEXP result;
-  long int i, n=igraph_vector_long_size(v);
-  double *rr;
-  
-  PROTECT(result=NEW_NUMERIC(n));
-  rr=REAL(result);
-  for (i=0; i<n; i++) {
-    rr[i] = VECTOR(*v)[i]+1;
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_0orvector_bool_to_SEXP(igraph_vector_bool_t *v) {
-  SEXP result;
-  if (v) {
-    PROTECT(result=R_igraph_vector_bool_to_SEXP(v));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_0orvector_long_to_SEXP(igraph_vector_long_t *v) {
-  SEXP result;
-  if (v) {
-    PROTECT(result=R_igraph_vector_long_to_SEXP(v));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vector_complex_to_SEXP(igraph_vector_complex_t* v) {
-  long int n=igraph_vector_complex_size(v);
-  SEXP result;
-  PROTECT(result=NEW_COMPLEX(n));
-  igraph_vector_complex_copy_to(v, (igraph_complex_t*) COMPLEX(result));
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_0orvector_complex_to_SEXP(igraph_vector_complex_t *v) {
-  SEXP result;
-  if (v) {
-    PROTECT(result=R_igraph_vector_complex_to_SEXP(v));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_matrix_to_SEXP(igraph_matrix_t *m) {
-
-  SEXP result, dim; 
-  
-  PROTECT(result=NEW_NUMERIC(igraph_matrix_size(m)));
-  igraph_matrix_copy_to(m, REAL(result));
-  PROTECT(dim=NEW_INTEGER(2));
-  INTEGER(dim)[0]=igraph_matrix_nrow(m);
-  INTEGER(dim)[1]=igraph_matrix_ncol(m);
-  SET_DIM(result, dim);
-
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_0ormatrix_to_SEXP(igraph_matrix_t *m) {
-  SEXP result;
-  if (m) {
-    PROTECT(result=R_igraph_matrix_to_SEXP(m));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_matrix_complex_to_SEXP(igraph_matrix_complex_t *m) {
-  SEXP result, dim;
-  PROTECT(result=NEW_COMPLEX(igraph_matrix_complex_size(m)));
-  igraph_matrix_complex_copy_to(m, (igraph_complex_t*) COMPLEX(result));
-  PROTECT(dim=NEW_INTEGER(2));
-  INTEGER(dim)[0]=igraph_matrix_complex_nrow(m);
-  INTEGER(dim)[1]=igraph_matrix_complex_ncol(m);
-  SET_DIM(result, dim);
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_0ormatrix_complex_to_SEXP(igraph_matrix_complex_t *m) {
-  SEXP result;
-  if (m) {
-    PROTECT(result=R_igraph_matrix_complex_to_SEXP(m));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_array3_to_SEXP(igraph_array3_t *a) {
-  SEXP result, dim;
-  
-  PROTECT(result=NEW_NUMERIC(igraph_array3_size(a)));
-  igraph_vector_copy_to(&a->data, REAL(result));
-  PROTECT(dim=NEW_INTEGER(3));
-  INTEGER(dim)[0]=igraph_array3_n(a, 1);
-  INTEGER(dim)[1]=igraph_array3_n(a, 2);
-  INTEGER(dim)[2]=igraph_array3_n(a, 3);
-  SET_DIM(result, dim);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_0orarray3_to_SEXP(igraph_array3_t *a) {
-  SEXP result;
-  if (a) {
-    PROTECT(result=R_igraph_array3_to_SEXP(a));
-  } else {
-    PROTECT(result=R_NilValue);
-  }
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_strvector_to_SEXP(const igraph_strvector_t *m) {
-  SEXP result;
-  long int i;
-  char *str;
-  long int len;
-  
-  len=igraph_strvector_size(m);
-  PROTECT(result=NEW_CHARACTER(len));
-  for (i=0; i<len; i++) {
-    igraph_strvector_get(m, i, &str);
-    SET_STRING_ELT(result, i, CREATE_STRING_VECTOR(str));
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_to_SEXP(igraph_t *graph) {
-  
-  SEXP result;
-  long int no_of_nodes=igraph_vcount(graph);
-  long int no_of_edges=igraph_ecount(graph);
-  
-  PROTECT(result=NEW_LIST(9));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1));
-  SET_VECTOR_ELT(result, 1, NEW_LOGICAL(1));
-  SET_VECTOR_ELT(result, 2, NEW_NUMERIC(no_of_edges));
-  SET_VECTOR_ELT(result, 3, NEW_NUMERIC(no_of_edges));
-  SET_VECTOR_ELT(result, 4, NEW_NUMERIC(no_of_edges));
-  SET_VECTOR_ELT(result, 5, NEW_NUMERIC(no_of_edges));
-  SET_VECTOR_ELT(result, 6, NEW_NUMERIC(no_of_nodes+1));
-  SET_VECTOR_ELT(result, 7, NEW_NUMERIC(no_of_nodes+1));
-
-  REAL(VECTOR_ELT(result, 0))[0]=no_of_nodes;
-  LOGICAL(VECTOR_ELT(result, 1))[0]=graph->directed;
-  memcpy(REAL(VECTOR_ELT(result, 2)), graph->from.stor_begin, 
-	 sizeof(igraph_real_t)*no_of_edges);
-  memcpy(REAL(VECTOR_ELT(result, 3)), graph->to.stor_begin, 
-	 sizeof(igraph_real_t)*no_of_edges);
-  memcpy(REAL(VECTOR_ELT(result, 4)), graph->oi.stor_begin, 
-	 sizeof(igraph_real_t)*no_of_edges);
-  memcpy(REAL(VECTOR_ELT(result, 5)), graph->ii.stor_begin, 
-	 sizeof(igraph_real_t)*no_of_edges);
-  memcpy(REAL(VECTOR_ELT(result, 6)), graph->os.stor_begin, 
-	 sizeof(igraph_real_t)*(no_of_nodes+1));
-  memcpy(REAL(VECTOR_ELT(result, 7)), graph->is.stor_begin, 
-	 sizeof(igraph_real_t)*(no_of_nodes+1));
-  
-  SET_CLASS(result, ScalarString(CREATE_STRING_VECTOR("igraph")));
-
-  /* Attributes */
-  SET_VECTOR_ELT(result, 8, graph->attr);
-  REAL(VECTOR_ELT(graph->attr, 0))[0] += 1;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vectorlist_to_SEXP(const igraph_vector_ptr_t *ptr) {
-  SEXP result;
-  long int i, n=igraph_vector_ptr_size(ptr);
-  
-  PROTECT(result=NEW_LIST(n));
-  for (i=0; i<n; i++) {
-    igraph_vector_t *v=VECTOR(*ptr)[i];
-    SET_VECTOR_ELT(result, i, R_igraph_vector_to_SEXP(v));
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vectorlist_to_SEXP_p1(const igraph_vector_ptr_t *ptr) {
-  SEXP result;
-  long int i, n=igraph_vector_ptr_size(ptr);
-  
-  PROTECT(result=NEW_LIST(n));
-  for (i=0; i<n; i++) {
-    igraph_vector_t *v=VECTOR(*ptr)[i];
-    long int j, vn=igraph_vector_size(v);
-    SEXP vs;
-    PROTECT(vs=NEW_NUMERIC(vn));
-    for (j=0; j<vn; j++) {
-      REAL(vs)[j] = VECTOR(*v)[j] + 1;
-    }
-    SET_VECTOR_ELT(result, i, vs);
-    UNPROTECT(1);
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-void R_igraph_vectorlist_destroy(igraph_vector_ptr_t *ptr) {
-  long int i, n=igraph_vector_ptr_size(ptr);
-  
-  for (i=0; i<n; i++) {
-    igraph_vector_t *v=VECTOR(*ptr)[i];
-    igraph_vector_destroy(v);
-    igraph_free(v);
-  }
-  igraph_vector_ptr_destroy(ptr);
-}
-
-SEXP R_igraph_hrg_to_SEXP(const igraph_hrg_t *hrg) {
-  SEXP result, names;
-  
-  PROTECT(result=NEW_LIST(5));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&hrg->left));
-  SET_VECTOR_ELT(result, 1, R_igraph_vector_to_SEXP(&hrg->right));
-  SET_VECTOR_ELT(result, 2, R_igraph_vector_to_SEXP(&hrg->prob));
-  SET_VECTOR_ELT(result, 3, R_igraph_vector_to_SEXP(&hrg->edges));
-  SET_VECTOR_ELT(result, 4, R_igraph_vector_to_SEXP(&hrg->vertices));
-  
-  PROTECT(names=NEW_CHARACTER(5));
-  SET_STRING_ELT(names, 0, mkChar("left"));
-  SET_STRING_ELT(names, 1, mkChar("right"));
-  SET_STRING_ELT(names, 2, mkChar("prob"));
-  SET_STRING_ELT(names, 3, mkChar("edges"));
-  SET_STRING_ELT(names, 4, mkChar("vertices"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;  
-}
-
-int R_SEXP_to_hrg(SEXP shrg, igraph_hrg_t *hrg) {
-  R_SEXP_to_vector(VECTOR_ELT(shrg, 0), &hrg->left);
-  R_SEXP_to_vector(VECTOR_ELT(shrg, 1), &hrg->right);
-  R_SEXP_to_vector(VECTOR_ELT(shrg, 2), &hrg->prob);
-  R_SEXP_to_vector(VECTOR_ELT(shrg, 3), &hrg->edges);
-  R_SEXP_to_vector(VECTOR_ELT(shrg, 4), &hrg->vertices);
-  return 0;
-}
-
-int R_SEXP_to_hrg_copy(SEXP shrg, igraph_hrg_t *hrg) {
-  R_SEXP_to_vector_copy(VECTOR_ELT(shrg, 0), &hrg->left);
-  R_SEXP_to_vector_copy(VECTOR_ELT(shrg, 1), &hrg->right);
-  R_SEXP_to_vector_copy(VECTOR_ELT(shrg, 2), &hrg->prob);
-  R_SEXP_to_vector_copy(VECTOR_ELT(shrg, 3), &hrg->edges);
-  R_SEXP_to_vector_copy(VECTOR_ELT(shrg, 4), &hrg->vertices);
-  return 0;
-}
-
-SEXP R_igraph_plfit_result_to_SEXP(const igraph_plfit_result_t *plfit) {
-  SEXP result, names;
-  
-  PROTECT(result=NEW_LIST(6));
-  SET_VECTOR_ELT(result, 0, ScalarLogical(plfit->continuous));
-  SET_VECTOR_ELT(result, 1, ScalarReal(plfit->alpha));
-  SET_VECTOR_ELT(result, 2, ScalarReal(plfit->xmin));
-  SET_VECTOR_ELT(result, 3, ScalarReal(plfit->L));
-  SET_VECTOR_ELT(result, 4, ScalarReal(plfit->D));
-  SET_VECTOR_ELT(result, 5, ScalarReal(plfit->p));
-  
-  PROTECT(names=NEW_CHARACTER(6));
-  SET_STRING_ELT(names, 0, mkChar("continuous"));
-  SET_STRING_ELT(names, 1, mkChar("alpha"));
-  SET_STRING_ELT(names, 2, mkChar("xmin"));
-  SET_STRING_ELT(names, 3, mkChar("logLik"));
-  SET_STRING_ELT(names, 4, mkChar("KS.stat"));
-  SET_STRING_ELT(names, 5, mkChar("KS.p"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-int R_SEXP_to_sparsemat(SEXP pakl, igraph_sparsemat_t *akl) {
-  SEXP Dim=GET_SLOT(pakl, install("Dim"));
-  SEXP i=GET_SLOT(pakl, install("i"));
-  SEXP p=GET_SLOT(pakl, install("p"));
-  SEXP x=GET_SLOT(pakl, install("x"));
-  
-  igraph_i_sparsemat_view(akl, /*nzmax=*/ GET_LENGTH(x), 
-			  /*m=*/ INTEGER(Dim)[0], /*n=*/ INTEGER(Dim)[1],
-			  /*p=*/ INTEGER(p), /*i=*/ INTEGER(i), 
-			  /*x=*/ REAL(x), /*nz=*/ -1);
-  
-  return 0;
-}
-
-SEXP R_igraph_sparsemat_to_SEXP_triplet(igraph_sparsemat_t *sp) {
-  SEXP res, names;
-  int nz=igraph_sparsemat_nonzero_storage(sp);
-
-  PROTECT(res=NEW_LIST(5));
-  SET_VECTOR_ELT(res, 0, ScalarString(CREATE_STRING_VECTOR("triplet")));
-  SET_VECTOR_ELT(res, 1, NEW_INTEGER(2));
-  INTEGER(VECTOR_ELT(res, 1))[0] = igraph_sparsemat_nrow(sp);
-  INTEGER(VECTOR_ELT(res, 1))[1] = igraph_sparsemat_ncol(sp);
-  SET_VECTOR_ELT(res, 2, NEW_INTEGER(nz));
-  SET_VECTOR_ELT(res, 3, NEW_INTEGER(nz));
-  SET_VECTOR_ELT(res, 4, NEW_NUMERIC(nz));
-  if (nz > 0) {
-    igraph_vector_int_t i, j;
-    igraph_vector_t x;
-    igraph_vector_int_view(&i, INTEGER(VECTOR_ELT(res, 2)), nz);
-    igraph_vector_int_view(&j, INTEGER(VECTOR_ELT(res, 3)), nz);
-    igraph_vector_view(&x, REAL(VECTOR_ELT(res, 4)), nz);
-    igraph_sparsemat_getelements(sp, &j, &i, &x);
-  }
-
-  PROTECT(names=NEW_CHARACTER(5));
-  SET_STRING_ELT(names, 0, mkChar("type"));
-  SET_STRING_ELT(names, 1, mkChar("dim"));
-  SET_STRING_ELT(names, 2, mkChar("p"));
-  SET_STRING_ELT(names, 3, mkChar("i"));
-  SET_STRING_ELT(names, 4, mkChar("x"));
-  SET_NAMES(res, names);
-  SET_CLASS(res, ScalarString(CREATE_STRING_VECTOR("igraph.tmp.sparse")));
-
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_sparsemat_to_SEXP_cc(igraph_sparsemat_t *sp) {
-  SEXP res, names;
-  int nz=igraph_sparsemat_nonzero_storage(sp);
-  int m=igraph_sparsemat_nrow(sp);
-  int n=igraph_sparsemat_ncol(sp);
-
-  PROTECT(res=NEW_LIST(5));
-  SET_VECTOR_ELT(res, 0, ScalarString(CREATE_STRING_VECTOR("cc")));
-  SET_VECTOR_ELT(res, 1, NEW_INTEGER(2));
-  INTEGER(VECTOR_ELT(res, 1))[0] = m;
-  INTEGER(VECTOR_ELT(res, 1))[1] = n;
-  SET_VECTOR_ELT(res, 2, NEW_INTEGER(n+1));
-  SET_VECTOR_ELT(res, 3, NEW_INTEGER(nz));
-  SET_VECTOR_ELT(res, 4, NEW_NUMERIC(nz));
-  if (nz > 0) {
-    igraph_vector_int_t i, p;
-    igraph_vector_t x;
-    igraph_vector_int_view(&p, INTEGER(VECTOR_ELT(res, 2)), n+1);
-    igraph_vector_int_view(&i, INTEGER(VECTOR_ELT(res, 3)), nz);
-    igraph_vector_view(&x, REAL(VECTOR_ELT(res, 4)), nz);
-    igraph_sparsemat_getelements_sorted(sp, &i, &p, &x);
-  }
-
-  PROTECT(names=NEW_CHARACTER(5));
-  SET_STRING_ELT(names, 0, mkChar("type"));
-  SET_STRING_ELT(names, 1, mkChar("dim"));
-  SET_STRING_ELT(names, 2, mkChar("p"));
-  SET_STRING_ELT(names, 3, mkChar("i"));
-  SET_STRING_ELT(names, 4, mkChar("x"));
-  SET_NAMES(res, names);
-  SET_CLASS(res, ScalarString(CREATE_STRING_VECTOR("igraph.tmp.sparse")));
-
-  UNPROTECT(2);
-  return res;
-}
-
-SEXP R_igraph_sparsemat_to_SEXP(igraph_sparsemat_t *sp) {
-  if (igraph_sparsemat_is_triplet(sp)) {
-    return R_igraph_sparsemat_to_SEXP_triplet(sp);
-  } else {
-    return R_igraph_sparsemat_to_SEXP_cc(sp);
-  }
-}
-
-SEXP R_igraph_0orsparsemat_to_SEXP(igraph_sparsemat_t *sp) {
-  if (!sp) {
-    return R_NilValue;
-  } else {
-    return R_igraph_sparsemat_to_SEXP(sp);
-  }
-}
-
-int R_SEXP_to_igraph_adjlist(SEXP vectorlist, igraph_adjlist_t *ptr) {
-  long int length=GET_LENGTH(vectorlist);
-  long int i;
-
-  ptr->length=length;
-  ptr->adjs = (igraph_vector_t*) R_alloc(length, sizeof(igraph_vector_t));
-  for (i=0; i<length; i++) {
-    SEXP vec=VECTOR_ELT(vectorlist, i);
-    igraph_vector_view(&ptr->adjs[i], REAL(vec), GET_LENGTH(vec));
-  }
-  return 0;
-}
-
-int R_igraph_SEXP_to_strvector(SEXP rval, igraph_strvector_t *sv) {
-  long int i;
-  sv->len=GET_LENGTH(rval);
-  sv->data=(char**) R_alloc(sv->len, sizeof(char*));
-  for (i=0; i<sv->len; i++) {
-    sv->data[i]=(char*) CHAR(STRING_ELT(rval, i));
-  }
-
-  return 0;
-}
-
-int R_igraph_SEXP_to_strvector_copy(SEXP rval, igraph_strvector_t *sv) {
-  long int i;
-  igraph_strvector_init(sv, GET_LENGTH(rval));
-  for (i=0; i<sv->len; i++) {
-    igraph_strvector_set(sv, i, CHAR(STRING_ELT(rval, i)));
-  }
-  
-  return 0;
-}
-
-int R_SEXP_to_vector(SEXP sv, igraph_vector_t *v) {
-  v->stor_begin=REAL(sv);
-  v->stor_end=v->stor_begin+GET_LENGTH(sv);
-  v->end=v->stor_end;
-  return 0;
-}
-
-int R_SEXP_to_vector_copy(SEXP sv, igraph_vector_t *v) {
-  return igraph_vector_init_copy(v, REAL(sv), GET_LENGTH(sv));  
-}
-
-int R_SEXP_to_vector_bool(SEXP sv, igraph_vector_bool_t *v) {
-  v->stor_begin=LOGICAL(sv);
-  v->stor_end=v->stor_begin+GET_LENGTH(sv);
-  v->end=v->stor_end;
-  return 0;
-}
-
-int R_SEXP_to_vector_int(SEXP sv, igraph_vector_int_t *v) {
-  v->stor_begin=(int*) INTEGER(sv);
-  v->stor_end=v->stor_begin+GET_LENGTH(sv);
-  v->end=v->stor_end;
-  return 0;
-}
-
-int R_SEXP_to_vector_long_copy(SEXP sv, igraph_vector_long_t *v) {
-  long int i, n=GET_LENGTH(sv);
-  double *svv=REAL(sv);
-  igraph_vector_long_init(v, n);
-  for (i=0; i<n; i++) {
-    VECTOR(*v)[i] = svv[i];
-  }
-  return 0;  
-}
-
-int R_SEXP_to_matrix(SEXP pakl, igraph_matrix_t *akl) {
-  R_SEXP_to_vector(pakl, &akl->data);
-  akl->nrow=INTEGER(GET_DIM(pakl))[0];
-  akl->ncol=INTEGER(GET_DIM(pakl))[1];
-
-  return 0;
-}
-
-int R_SEXP_to_igraph_matrix_copy(SEXP pakl, igraph_matrix_t *akl) {
-  igraph_vector_init_copy(&akl->data, REAL(pakl), GET_LENGTH(pakl));
-  akl->nrow=INTEGER(GET_DIM(pakl))[0];
-  akl->ncol=INTEGER(GET_DIM(pakl))[1];
-
-  return 0;
-}
-
-int R_SEXP_to_vector_complex(SEXP pv, igraph_vector_complex_t *v) {
-  v->stor_begin=(igraph_complex_t*) COMPLEX(pv);
-  v->stor_end=v->stor_begin+GET_LENGTH(pv);
-  v->end=v->stor_end;
-  return 0;
-}
-
-int R_SEXP_to_vector_complex_copy(SEXP pv, igraph_vector_complex_t *v) {
-  igraph_vector_complex_init_copy(v, (igraph_complex_t*) COMPLEX(pv), 
-				  GET_LENGTH(pv));
-  return 0;
-}
-
-int R_SEXP_to_matrix_complex(SEXP pakl, igraph_matrix_complex_t *akl) {
-  R_SEXP_to_vector_complex(pakl, &akl->data);
-  akl->nrow=INTEGER(GET_DIM(pakl))[0];
-  akl->ncol=INTEGER(GET_DIM(pakl))[1];
-  return 0;
-}
-
-int R_SEXP_to_matrix_complex_copy(SEXP pakl, igraph_matrix_complex_t *akl) {
-  igraph_vector_complex_init_copy(&akl->data, 
-				  (igraph_complex_t*) COMPLEX(pakl),
-				  GET_LENGTH(pakl));
-  akl->nrow=INTEGER(GET_DIM(pakl))[0];
-  akl->ncol=INTEGER(GET_DIM(pakl))[1];
-  return 0;
-}
-
-int R_igraph_SEXP_to_array3(SEXP rval, igraph_array3_t *a) {
-  R_SEXP_to_vector(rval, &a->data);
-  a->n1=INTEGER(GET_DIM(rval))[0];
-  a->n2=INTEGER(GET_DIM(rval))[1];
-  a->n3=INTEGER(GET_DIM(rval))[2];
-  a->n1n2=(a->n1) * (a->n2);
-
-  return 0;
-}
-
-int R_igraph_SEXP_to_array3_copy(SEXP rval, igraph_array3_t *a) {
-  igraph_vector_init_copy(&a->data, REAL(rval), GET_LENGTH(rval));
-  a->n1=INTEGER(GET_DIM(rval))[0];
-  a->n2=INTEGER(GET_DIM(rval))[1];
-  a->n3=INTEGER(GET_DIM(rval))[2];
-  a->n1n2=(a->n1) * (a->n2);
-
-  return 0;
-}
-
-int R_SEXP_to_igraph(SEXP graph, igraph_t *res) {
-  
-  res->n=REAL(VECTOR_ELT(graph, 0))[0];
-  res->directed=LOGICAL(VECTOR_ELT(graph, 1))[0];
-  R_SEXP_to_vector(VECTOR_ELT(graph, 2), &res->from);
-  R_SEXP_to_vector(VECTOR_ELT(graph, 3), &res->to);
-  R_SEXP_to_vector(VECTOR_ELT(graph, 4), &res->oi);
-  R_SEXP_to_vector(VECTOR_ELT(graph, 5), &res->ii);
-  R_SEXP_to_vector(VECTOR_ELT(graph, 6), &res->os);
-  R_SEXP_to_vector(VECTOR_ELT(graph, 7), &res->is);
-  
-  /* attributes */
-  REAL(VECTOR_ELT(VECTOR_ELT(graph, 8), 0))[0] = 1; /* R objects refcount */
-  REAL(VECTOR_ELT(VECTOR_ELT(graph, 8), 0))[1] = 0; /* igraph_t objects */
-  res->attr=VECTOR_ELT(graph, 8);
-  
-  return 0;
-}
-
-int R_SEXP_to_igraph_copy(SEXP graph, igraph_t *res) {
-  
-  res->n=REAL(VECTOR_ELT(graph, 0))[0];
-  res->directed=LOGICAL(VECTOR_ELT(graph, 1))[0];
-  igraph_vector_init_copy(&res->from, REAL(VECTOR_ELT(graph, 2)), 
-		   GET_LENGTH(VECTOR_ELT(graph, 2)));
-  igraph_vector_init_copy(&res->to, REAL(VECTOR_ELT(graph, 3)), 
-		   GET_LENGTH(VECTOR_ELT(graph, 3)));
-  igraph_vector_init_copy(&res->oi, REAL(VECTOR_ELT(graph, 4)), 
-		   GET_LENGTH(VECTOR_ELT(graph, 4)));
-  igraph_vector_init_copy(&res->ii, REAL(VECTOR_ELT(graph, 5)), 
-		   GET_LENGTH(VECTOR_ELT(graph, 5)));
-  igraph_vector_init_copy(&res->os, REAL(VECTOR_ELT(graph, 6)), 
-		   GET_LENGTH(VECTOR_ELT(graph, 6)));
-  igraph_vector_init_copy(&res->is, REAL(VECTOR_ELT(graph, 7)),
-		   GET_LENGTH(VECTOR_ELT(graph, 7)));
-
-  /* attributes */
-  REAL(VECTOR_ELT(VECTOR_ELT(graph, 8), 0))[0] = 1; /* R objects */
-  REAL(VECTOR_ELT(VECTOR_ELT(graph, 8), 0))[1] = 1; /* igraph_t objects */
-  PROTECT(res->attr=VECTOR_ELT(graph, 8));  
-
-  return 0;
-}
-
-/* 
- * We have only vector type
- */
-
-int R_SEXP_to_igraph_vs(SEXP rit, igraph_t *graph, igraph_vs_t *it) {
-  
-  igraph_vector_t *tmpv=(igraph_vector_t*)R_alloc(1,sizeof(igraph_vector_t));
-  igraph_vs_vector(it, igraph_vector_view(tmpv, REAL(rit), 
-					  GET_LENGTH(rit)));
-  return 0;
-}
-
-/* 
- * We have only vector type
- */
-
-int R_SEXP_to_igraph_es(SEXP rit, igraph_t *graph, igraph_es_t *it) {
-
-  igraph_vector_t *tmpv=(igraph_vector_t*)R_alloc(1,sizeof(igraph_vector_t));
-  igraph_es_vector(it, igraph_vector_view(tmpv, REAL(rit),
-					  GET_LENGTH(rit)));
-  return 0;
-}
-
-int R_SEXP_to_igraph_layout_drl_options(SEXP in, igraph_layout_drl_options_t *opt) {
-  opt->edge_cut = REAL(AS_NUMERIC(R_igraph_getListElement(in, "edge.cut")))[0];
-  opt->init_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "init.iterations")))[0];
-  opt->init_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "init.temperature")))[0];
-  opt->init_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "init.attraction")))[0];
-  opt->init_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "init.damping.mult")))[0];
-  opt->liquid_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "liquid.iterations")))[0];
-  opt->liquid_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "liquid.temperature")))[0];
-  opt->liquid_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "liquid.attraction")))[0];
-  opt->liquid_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "liquid.damping.mult")))[0];
-  opt->expansion_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "expansion.iterations")))[0];
-  opt->expansion_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "expansion.temperature")))[0];
-  opt->expansion_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "expansion.attraction")))[0];
-  opt->expansion_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "expansion.damping.mult")))[0];
-  opt->cooldown_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "cooldown.iterations")))[0];
-  opt->cooldown_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "cooldown.temperature")))[0];
-  opt->cooldown_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "cooldown.attraction")))[0];
-  opt->cooldown_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "cooldown.damping.mult")))[0];
-  opt->crunch_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "crunch.iterations")))[0];
-  opt->crunch_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "crunch.temperature")))[0];
-  opt->crunch_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "crunch.attraction")))[0];
-  opt->crunch_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "crunch.damping.mult")))[0];
-  opt->simmer_iterations   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "simmer.iterations")))[0];
-  opt->simmer_temperature  = REAL(AS_NUMERIC(R_igraph_getListElement(in, "simmer.temperature")))[0];
-  opt->simmer_attraction   = REAL(AS_NUMERIC(R_igraph_getListElement(in, "simmer.attraction")))[0];
-  opt->simmer_damping_mult = REAL(AS_NUMERIC(R_igraph_getListElement(in, "simmer.damping.mult")))[0];
-
-  return 0;
-}
-
-int R_SEXP_to_igraph_arpack_options(SEXP in, igraph_arpack_options_t *opt) {
-  const char *tmpstr;
-  igraph_arpack_options_init(opt);
-  opt -> bmat[0] = CHAR(STRING_ELT(AS_CHARACTER
-				   (R_igraph_getListElement(in, "bmat")), 0))[0];
-  opt -> n = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "n")))[0];
-  tmpstr=CHAR(STRING_ELT(AS_CHARACTER(R_igraph_getListElement(in, "which")), 0));
-  opt -> which[0]=tmpstr[0]; opt -> which[1]=tmpstr[1];
-  opt -> nev = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "nev")))[0];
-  opt -> tol = REAL(AS_NUMERIC(R_igraph_getListElement(in, "tol")))[0];
-  opt -> ncv = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "ncv")))[0];
-  opt -> ldv = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "ldv")))[0];
-  opt -> ishift = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "ishift")))[0];
-  opt -> mxiter = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "maxiter")))[0];
-  opt -> nb = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "nb")))[0];
-  opt -> mode = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "mode")))[0];
-  opt -> start = INTEGER(AS_INTEGER(R_igraph_getListElement(in, "start")))[0];
-  opt -> lworkl = 0;
-  opt -> sigma = REAL(AS_NUMERIC(R_igraph_getListElement(in, "sigma")))[0];
-  opt -> sigmai = REAL(AS_NUMERIC(R_igraph_getListElement(in, "sigmai")))[0];
-  opt -> info = opt -> start;
-
-  opt->iparam[0]=opt->ishift;
-  opt->iparam[2]=opt->mxiter; 
-  opt->iparam[3]=opt->nb;
-  opt->iparam[6]=opt->mode;
-  
-  return 0;
-}
-
-SEXP R_igraph_arpack_options_to_SEXP(igraph_arpack_options_t *opt) {
-  SEXP result, names;
-  char bmat[2], which[3];
-
-  bmat[0]=opt->bmat[0]; bmat[1]='\0';
-  which[0]=opt->which[0]; which[1]=opt->which[1]; which[2]='\0';
-  
-  PROTECT(result = NEW_LIST(20));
-  SET_VECTOR_ELT(result, 0, ScalarString(CREATE_STRING_VECTOR(bmat)));
-  SET_VECTOR_ELT(result, 1, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 1))[0]=opt->n;
-  SET_VECTOR_ELT(result, 2, ScalarString(CREATE_STRING_VECTOR(which)));
-  SET_VECTOR_ELT(result, 3, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 3))[0]=opt->nev;
-  SET_VECTOR_ELT(result, 4, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 4))[0]=opt->tol;
-  SET_VECTOR_ELT(result, 5, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 5))[0]=opt->ncv;
-  SET_VECTOR_ELT(result, 6, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 6))[0]=opt->ldv;
-  SET_VECTOR_ELT(result, 7, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 7))[0]=opt->ishift;
-  SET_VECTOR_ELT(result, 8, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 8))[0]=opt->mxiter;
-  SET_VECTOR_ELT(result, 9, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 9))[0]=opt->nb;
-  SET_VECTOR_ELT(result, 10, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 10))[0]=opt->mode;
-  SET_VECTOR_ELT(result, 11, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 11))[0]=opt->start;
-  SET_VECTOR_ELT(result, 12, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 12))[0]=opt->sigma;
-  SET_VECTOR_ELT(result, 13, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 13))[0]=opt->sigmai;
-
-  SET_VECTOR_ELT(result, 14, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 14))[0]=opt->info;
-  SET_VECTOR_ELT(result, 15, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 15))[0]=opt->iparam[2];/* mxiter */
-  SET_VECTOR_ELT(result, 16, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 16))[0]=opt->iparam[4];/* nconv */
-  SET_VECTOR_ELT(result, 17, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 17))[0]=opt->iparam[8];/* numop */
-  SET_VECTOR_ELT(result, 18, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 18))[0]=opt->iparam[9];/* numopb */
-  SET_VECTOR_ELT(result, 19, NEW_INTEGER(1)); INTEGER(VECTOR_ELT(result, 19))[0]=opt->iparam[10];/* numreo */
-  
-  PROTECT(names=NEW_CHARACTER(20));
-  SET_STRING_ELT(names, 0, mkChar("bmat"));
-  SET_STRING_ELT(names, 1, mkChar("n"));
-  SET_STRING_ELT(names, 2, mkChar("which"));
-  SET_STRING_ELT(names, 3, mkChar("nev"));
-  SET_STRING_ELT(names, 4, mkChar("tol"));
-  SET_STRING_ELT(names, 5, mkChar("ncv"));
-  SET_STRING_ELT(names, 6, mkChar("ldv"));
-  SET_STRING_ELT(names, 7, mkChar("ishift"));
-  SET_STRING_ELT(names, 8, mkChar("maxiter"));
-  SET_STRING_ELT(names, 9, mkChar("nb"));
-  SET_STRING_ELT(names, 10, mkChar("mode"));
-  SET_STRING_ELT(names, 11, mkChar("start"));
-  SET_STRING_ELT(names, 12, mkChar("sigma"));
-  SET_STRING_ELT(names, 13, mkChar("sigmai"));
-  SET_STRING_ELT(names, 14, mkChar("info"));
-  SET_STRING_ELT(names, 15, mkChar("iter"));
-  SET_STRING_ELT(names, 16, mkChar("nconv"));
-  SET_STRING_ELT(names, 17, mkChar("numop"));
-  SET_STRING_ELT(names, 18, mkChar("numopb"));
-  SET_STRING_ELT(names, 19, mkChar("numreo"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;  
-}
-
-SEXP R_igraph_bliss_info_to_SEXP(igraph_bliss_info_t *info) {
-  SEXP result, names;
-  
-  PROTECT(result=NEW_LIST(6));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 0))[0]=info->nof_nodes;
-  SET_VECTOR_ELT(result, 1, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 1))[0]=info->nof_leaf_nodes;
-  SET_VECTOR_ELT(result, 2, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 2))[0]=info->nof_bad_nodes;
-  SET_VECTOR_ELT(result, 3, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 3))[0]=info->nof_canupdates;
-  SET_VECTOR_ELT(result, 4, NEW_NUMERIC(1)); REAL(VECTOR_ELT(result, 4))[0]=info->max_level;
-  if (info->group_size) {
-    SET_VECTOR_ELT(result, 5, NEW_CHARACTER(1));
-    SET_STRING_ELT(VECTOR_ELT(result, 5), 0, mkChar(info->group_size));
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  
-  PROTECT(names=NEW_CHARACTER(6));
-  SET_STRING_ELT(names, 0, mkChar("nof_nodes"));
-  SET_STRING_ELT(names, 1, mkChar("nof_leaf_nodes"));
-  SET_STRING_ELT(names, 2, mkChar("nof_bad_nodes"));
-  SET_STRING_ELT(names, 3, mkChar("nof_canupdates"));
-  SET_STRING_ELT(names, 4, mkChar("max_level"));
-  SET_STRING_ELT(names, 5, mkChar("group_size"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(2);
-  return result;
-}
-
-/*******************************************************************/
-
-SEXP R_igraph_named(SEXP attr) {
-  int named=NAMED(attr);
-  return R_NilValue;
-}
-
-SEXP R_igraph_mybracket(SEXP graph, SEXP pidx) {
-  int idx=INTEGER(pidx)[0]-1;
-  return VECTOR_ELT(graph, idx);
-}
-
-SEXP R_igraph_mybracket2(SEXP graph, SEXP pidx1, SEXP pidx2) {
-  int idx1=INTEGER(pidx1)[0]-1;
-  int idx2=INTEGER(pidx2)[0]-1;  
-  return VECTOR_ELT(VECTOR_ELT(graph, idx1), idx2);
-}
-
-SEXP R_igraph_mybracket2_set(SEXP graph, SEXP pidx1, SEXP pidx2,
-			     SEXP value) {
-  SEXP newgraph;
-  int idx1=INTEGER(pidx1)[0]-1;
-  int idx2=INTEGER(pidx2)[0]-1;
-  PROTECT(newgraph=duplicate(graph));
-  SET_VECTOR_ELT(VECTOR_ELT(newgraph, idx1), idx2, value);
-  UNPROTECT(1);
-  return newgraph;
-}
-
-SEXP R_igraph_mybracket3_set(SEXP graph, SEXP pidx1, SEXP pidx2, 
-			     SEXP pname, SEXP value) {
-  SEXP newgraph;
-  int idx1=INTEGER(pidx1)[0]-1;
-  int idx2=INTEGER(pidx2)[0]-1;
-  const char *name=CHAR(STRING_ELT(pname, 0));
-  SEXP attrs=VECTOR_ELT(VECTOR_ELT(graph, idx1), idx2);
-  SEXP names=getAttrib(attrs, R_NamesSymbol);
-  int i, n=length(attrs);
-  PROTECT(newgraph=duplicate(graph));
-  
-  for (i=0; i<n; i++) {
-    if (strcmp(CHAR(STRING_ELT(names, i)), name) == 0) { break; }    
-  }
-  if (i==n) {
-    /* New attribute, append it */
-    SEXP newattrs, newnames;
-    PROTECT(newattrs=NEW_LIST(n+1));
-    PROTECT(newnames=NEW_CHARACTER(n+1));
-    for (i=0; i<n; i++) {
-      SET_VECTOR_ELT(newattrs, i, VECTOR_ELT(attrs, i));
-      SET_STRING_ELT(newnames, i, STRING_ELT(names, i));
-    }
-    SET_VECTOR_ELT(newattrs, i, value);
-    SET_STRING_ELT(newnames, i, mkChar(name));
-    SET_NAMES(newattrs, newnames);
-    SET_VECTOR_ELT(VECTOR_ELT(newgraph, idx1), idx2, newattrs);
-    UNPROTECT(2);
-  } else {
-    /* Existing attribute, just set it */
-    SET_VECTOR_ELT(attrs, i, value);
-    SET_VECTOR_ELT(VECTOR_ELT(newgraph, idx1), idx2, attrs);
-  }
-  
-  UNPROTECT(1);
-  return newgraph;
-}
-
-SEXP R_igraph_add_edges(SEXP graph, SEXP edges) {
-  
-  igraph_vector_t v;			/* do NOT destroy! */
-  igraph_t g;
-  SEXP result;
-
-  R_SEXP_to_vector(edges, &v);
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_add_edges(&g, &v, 0);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_add_vertices(SEXP graph, SEXP pnv) {
-  
-  igraph_integer_t nv;
-  igraph_t g;
-  SEXP result;
-  
-  nv=REAL(pnv)[0];
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_add_vertices(&g, nv, 0);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_ecount(SEXP graph) {
-  
-  igraph_t g;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=igraph_ecount(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_neighbors(SEXP graph, SEXP pvid, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_vector_t neis;
-  SEXP result;
-  igraph_real_t vid;
-  igraph_integer_t mode;
-  
-  igraph_vector_init(&neis, 0);
-  vid=REAL(pvid)[0];
-  mode=REAL(pmode)[0];
-  R_SEXP_to_igraph(graph, &g);
-  igraph_neighbors(&g, &neis, vid, mode);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&neis)));
-  igraph_vector_copy_to(&neis, REAL(result));
-  igraph_vector_destroy(&neis);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_incident(SEXP graph, SEXP pvid, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_vector_t neis;
-  SEXP result;
-  igraph_real_t vid;
-  igraph_integer_t mode;
-  
-  igraph_vector_init(&neis, 0);
-  vid=REAL(pvid)[0];
-  mode=REAL(pmode)[0];
-  R_SEXP_to_igraph(graph, &g);
-  igraph_incident(&g, &neis, vid, mode);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&neis)));
-  igraph_vector_copy_to(&neis, REAL(result));
-  igraph_vector_destroy(&neis);
-
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_delete_edges(SEXP graph, SEXP edges) {
-  
-  igraph_es_t es;
-  igraph_t g;
-  SEXP result;
-  
-  R_SEXP_to_igraph_copy(graph, &g);
-  R_SEXP_to_igraph_es(edges, &g, &es);
-  igraph_delete_edges(&g, es);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_delete_vertices(SEXP graph, SEXP vertices) {
-  
-  igraph_vs_t vs;
-  igraph_t g;
-  SEXP result;
-  
-  R_SEXP_to_igraph_copy(graph, &g);
-  R_SEXP_to_igraph_vs(vertices, &g, &vs);
-  igraph_delete_vertices(&g, vs);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  igraph_vs_destroy(&vs);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_is_directed(SEXP graph) {
-  
-  igraph_t g;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  PROTECT(result=NEW_LOGICAL(1));
-  LOGICAL(result)[0]=igraph_is_directed(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_create(SEXP edges, SEXP pn, SEXP pdirected) {
-  
-  igraph_t g;
-  igraph_vector_t v;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-
-  R_SEXP_to_vector(edges, &v);
-  igraph_create(&g, &v, n, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_degree(SEXP graph, SEXP vids, SEXP pmode, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_vector_t res;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(vids, &g, &vs);
-  igraph_vector_init(&res, 0);
-  igraph_degree(&g, &res, vs, mode, loops);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_is_connected(SEXP graph, SEXP pmode) {
-
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_bool_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  igraph_is_connected(&g, &res, mode);
-  
-  PROTECT(result=NEW_LOGICAL(1));
-  LOGICAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_diameter(SEXP graph, SEXP pdirected, SEXP punconnected, 
-		       SEXP pweights) {
-  
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t unconnected=LOGICAL(punconnected)[0];
-  igraph_vector_t weights;
-  igraph_real_t res;  
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    R_SEXP_to_vector(pweights, &weights);
-  }
-  igraph_diameter_dijkstra(&g, isNull(pweights) ? 0 : &weights, 
-			   &res, 0, 0, 0, directed, unconnected);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_get_diameter(SEXP graph, SEXP pdirected, SEXP punconnected, 
-			   SEXP pweights) {
-  
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t unconnected=LOGICAL(punconnected)[0];
-  igraph_vector_t weights;
-  igraph_vector_t res;
-  igraph_real_t dialen;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    R_SEXP_to_vector(pweights, &weights);
-  }
-  igraph_vector_init(&res, 0);
-  igraph_diameter_dijkstra(&g, isNull(pweights) ? 0 : &weights, 
-			   &dialen, 0, 0, &res, directed, unconnected);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_farthest_points(SEXP graph, SEXP pdirected, SEXP punconnected, 
-			      SEXP pweights) {
-  
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t unconnected=LOGICAL(punconnected)[0];
-  igraph_vector_t weights;
-  igraph_real_t len;
-  igraph_integer_t from, to;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    R_SEXP_to_vector(pweights, &weights);
-  }
-  igraph_diameter_dijkstra(&g, isNull(pweights) ? 0 : &weights, 
-			   &len, &from, &to, 0, directed, unconnected);
-  
-  PROTECT(result=NEW_NUMERIC(3));
-  if (from < 0) {
-    REAL(result)[0]=REAL(result)[1]=REAL(result)[2]=NA_REAL;
-  } else {
-    REAL(result)[0]=from;
-    REAL(result)[1]=to;
-    REAL(result)[2]=len;
-  }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_subcomponent(SEXP graph, SEXP pvertex, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_real_t vertex=REAL(pvertex)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_subcomponent(&g, &res, vertex, mode);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_betweenness(SEXP graph, SEXP pvids, SEXP pdirected, 
-			  SEXP weights, SEXP pnobigint) {
-  
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t nobigint=LOGICAL(pnobigint)[0];
-  igraph_vector_t res;
-  igraph_vector_t v_weights, *pweights=0;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  igraph_vector_init(&res, 0);
-  if (!isNull(weights)) { 
-    pweights=&v_weights; R_SEXP_to_vector(weights, &v_weights);
-  }
-  igraph_betweenness(&g, &res, vs, directed, pweights, nobigint);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_running_mean(SEXP pdata, SEXP pbinwidth) {
-  
-  igraph_vector_t data;
-  igraph_integer_t binwidth=REAL(pbinwidth)[0];
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_vector(pdata, &data);
-  
-  igraph_vector_init(&res, 0);
-  igraph_running_mean(&data, &res, binwidth);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_cocitation(SEXP graph, SEXP pvids) {
-
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_matrix_t m;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  igraph_matrix_init(&m, 0, 0);
-  igraph_cocitation(&g, &m, vs);
-  
-  PROTECT(result=R_igraph_matrix_to_SEXP(&m));
-  igraph_matrix_destroy(&m);
-  igraph_vs_destroy(&vs);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_bibcoupling(SEXP graph, SEXP pvids) {
-
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_matrix_t m;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  igraph_matrix_init(&m, 0, 0);
-  igraph_bibcoupling(&g, &m, vs);
-  
-  PROTECT(result=R_igraph_matrix_to_SEXP(&m));
-  igraph_matrix_destroy(&m);
-  igraph_vs_destroy(&vs);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_growing_random_game(SEXP pn, SEXP pm, SEXP pdirected,
-				  SEXP pcitation) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_bool_t citation=LOGICAL(pcitation)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  igraph_growing_random_game(&g, n, m, directed, citation);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_shortest_paths(SEXP graph, SEXP pvids, SEXP pto,
-			     SEXP pmode, SEXP weights, 
-			     SEXP palgo) {
-  
-  igraph_t g;
-  igraph_vs_t vs, to;
-  igraph_integer_t mode=REAL(pmode)[0];
-  long int algo=REAL(palgo)[0];
-  igraph_matrix_t res;
-  igraph_vector_t w, *pw=&w;
-  igraph_bool_t negw=0;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  R_SEXP_to_igraph_vs(pto, &g, &to);
-  if (isNull(weights)) {
-    pw=0;
-  } else {
-    R_SEXP_to_vector(weights, &w);
-    negw = igraph_vector_min(&w) < 0;
-  }
-  igraph_matrix_init(&res, 0, 0);
-  switch (algo) {
-  case 0: 			/* automatic */
-    if (negw && mode==IGRAPH_OUT && GET_LENGTH(pvids)>100) {
-      igraph_shortest_paths_johnson(&g, &res, vs, to, pw);
-    } else if (negw) {
-      igraph_shortest_paths_bellman_ford(&g, &res, vs, to, pw, mode);
-    } else {
-      /* This one chooses 'unweighted' if there are no weights */
-      igraph_shortest_paths_dijkstra(&g, &res, vs, to, pw, mode);
-    }
-    break;
-  case 1:			/* unweighted */
-    igraph_shortest_paths(&g, &res, vs, to, mode);
-    break;
-  case 2:			/* dijkstra */
-    igraph_shortest_paths_dijkstra(&g, &res, vs, to, pw, mode);
-    break;
-  case 3:			/* bellman-ford */
-    igraph_shortest_paths_bellman_ford(&g, &res, vs, to, pw, mode);
-    break;
-  case 4:			/* johnson */
-    igraph_shortest_paths_johnson(&g, &res, vs, to, pw);
-    break;
-  }
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  igraph_vs_destroy(&vs);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_lattice(SEXP pdimvector, SEXP pnei, SEXP pdirected,
-		      SEXP pmutual, SEXP pcircular) {
-  
-  igraph_t g;
-  igraph_vector_t dimvector;
-  igraph_integer_t nei=REAL(pnei)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t mutual=LOGICAL(pmutual)[0];
-  igraph_bool_t circular=LOGICAL(pcircular)[0];  
-  SEXP result;
-  
-  R_SEXP_to_vector(pdimvector, &dimvector);
-  
-  igraph_lattice(&g, &dimvector, nei, directed, mutual, circular);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_barabasi_game(SEXP pn, SEXP ppower, SEXP pm, SEXP poutseq,
-			    SEXP poutpref, SEXP pA, SEXP pdirected, 
-			    SEXP palgo, SEXP pstart) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_real_t power=REAL(ppower)[0];
-  igraph_integer_t m=REAL(pm)[0]; 
-  igraph_vector_t outseq, *myoutseq=0;
-  igraph_bool_t outpref=LOGICAL(poutpref)[0];
-  igraph_real_t A=REAL(pA)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_integer_t algo=REAL(palgo)[0];
-  igraph_t start, *ppstart=0;
-  SEXP result;
-  
-  if (!isNull(poutseq)) {
-    R_SEXP_to_vector(poutseq, &outseq);
-    myoutseq=&outseq;
-  }
-  
-  if (!isNull(pstart)) {
-    R_SEXP_to_igraph(pstart, &start);
-    ppstart=&start;
-  }
-  
-  igraph_barabasi_game(&g, n, power, m, &outseq, outpref, 
-		       A, directed, algo, ppstart);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_recent_degree_game(SEXP pn, SEXP ppower, SEXP pwindow,
-				 SEXP pm, SEXP poutseq, SEXP poutpref,
-				 SEXP pzero_appeal,
-				 SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_real_t power=REAL(ppower)[0];
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_vector_t outseq;
-  igraph_bool_t outpref=LOGICAL(poutpref)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_real_t zero_appeal=REAL(pzero_appeal)[0];
-  SEXP result;
-
-  R_SEXP_to_vector(poutseq, &outseq);
-  
-  igraph_recent_degree_game(&g, n, power, window, m, &outseq, outpref, 
-			    zero_appeal, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_layout_kamada_kawai(SEXP graph, SEXP pniter, SEXP pinitemp, 
-				  SEXP pcoolexp, SEXP pkkconst, SEXP psigma, 
-				  SEXP start, SEXP pfixz, SEXP pminx, 
-				  SEXP pmaxx, SEXP pminy, SEXP pmaxy, 
-				  SEXP pminz, SEXP pmaxz) {
-  
-  igraph_t g;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t initemp=REAL(pinitemp)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t kkconst=REAL(pkkconst)[0];
-  igraph_real_t sigma=REAL(psigma)[0];
-  igraph_vector_t minx, maxx, *ppminx=0, *ppmaxx=0;
-  igraph_vector_t miny, maxy, *ppminy=0, *ppmaxy=0;
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (isNull(start)) {
-    igraph_matrix_init(&res, 0, 0);
-  } else {
-    R_SEXP_to_igraph_matrix_copy(start, &res);
-  }
-  if (!isNull(pminx)) { ppminx=&minx; R_SEXP_to_vector(pminx, &minx); }
-  if (!isNull(pmaxx)) { ppmaxx=&maxx; R_SEXP_to_vector(pmaxx, &maxx); }  
-  if (!isNull(pminy)) { ppminy=&miny; R_SEXP_to_vector(pminy, &miny); }
-  if (!isNull(pmaxy)) { ppmaxy=&maxy; R_SEXP_to_vector(pmaxy, &maxy); }  
-  igraph_layout_kamada_kawai(&g, &res, niter, sigma, 
-			     initemp, coolexp, kkconst, !isNull(start), 
-			     ppminx, ppmaxx, ppminy, ppmaxy);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_kamada_kawai_3d(SEXP graph, SEXP pniter, SEXP pinitemp,
-				     SEXP pcoolexp, SEXP pkkconst, 
-				     SEXP psigma, SEXP start, SEXP pfixz, 
-				     SEXP pminx, SEXP pmaxx, SEXP pminy, 
-				     SEXP pmaxy, SEXP pminz, SEXP pmaxz) {
-  igraph_t g;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t initemp=REAL(pinitemp)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t kkconst=REAL(pkkconst)[0];
-  igraph_real_t sigma=REAL(psigma)[0];
-  igraph_bool_t fixz=LOGICAL(pfixz)[0];
-  igraph_vector_t minx, maxx, *ppminx=0, *ppmaxx=0;
-  igraph_vector_t miny, maxy, *ppminy=0, *ppmaxy=0;
-  igraph_vector_t minz, maxz, *ppminz=0, *ppmaxz=0;
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (isNull(start)) {
-    igraph_matrix_init(&res, 0, 0);
-  } else {
-    R_SEXP_to_igraph_matrix_copy(start, &res);
-  }
-  if (!isNull(pminx)) { ppminx=&minx; R_SEXP_to_vector(pminx, &minx); }
-  if (!isNull(pmaxx)) { ppmaxx=&maxx; R_SEXP_to_vector(pmaxx, &maxx); }  
-  if (!isNull(pminy)) { ppminy=&miny; R_SEXP_to_vector(pminy, &miny); }
-  if (!isNull(pmaxy)) { ppmaxy=&maxy; R_SEXP_to_vector(pmaxy, &maxy); }  
-  if (!isNull(pminz)) { ppminz=&minz; R_SEXP_to_vector(pminz, &minz); }
-  if (!isNull(pmaxz)) { ppmaxz=&maxz; R_SEXP_to_vector(pmaxz, &maxz); }  
-  igraph_layout_kamada_kawai_3d(&g, &res, niter, sigma, 
-				initemp, coolexp, kkconst, !isNull(start), 
-				fixz, ppminx, ppmaxx, ppminy, ppmaxy, 
-				ppminz, ppmaxz);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_graphopt(SEXP graph, SEXP pniter, SEXP pcharge,
-			      SEXP pmass, SEXP pspring_length, 
-			      SEXP pspring_constant, SEXP pmax_sa_movement,
-			      SEXP start) {
-  igraph_t g;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t charge=REAL(pcharge)[0];
-  igraph_real_t mass=REAL(pmass)[0];
-  igraph_real_t spring_length=REAL(pspring_length)[0];
-  igraph_real_t spring_constant=REAL(pspring_constant)[0];
-  igraph_real_t max_sa_movement=REAL(pmax_sa_movement)[0];
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (isNull(start)) {
-    igraph_matrix_init(&res, 0, 0);
-  } else {
-    R_SEXP_to_igraph_matrix_copy(start, &res);
-  }
-  igraph_layout_graphopt(&g, &res, niter, charge, mass, spring_length,
-			 spring_constant, max_sa_movement, !isNull(start));
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_lgl(SEXP graph, SEXP pmaxiter, SEXP pmaxdelta,
-			 SEXP parea, SEXP pcoolexp, SEXP prepulserad,
-			 SEXP pcellsize, SEXP proot) {
-  
-  igraph_t g;
-  igraph_matrix_t res;
-  igraph_integer_t maxiter=REAL(pmaxiter)[0];
-  igraph_real_t maxdelta=REAL(pmaxdelta)[0];
-  igraph_real_t area=REAL(parea)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t repulserad=REAL(prepulserad)[0];
-  igraph_real_t cellsize=REAL(pcellsize)[0];
-  igraph_integer_t root=REAL(proot)[0];
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_lgl(&g, &res, maxiter, maxdelta, area, coolexp, repulserad,
-		    cellsize, root);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-
-  UNPROTECT(1);
-  return result;
-}  
-
-SEXP R_igraph_layout_fruchterman_reingold_grid(SEXP graph,
-					       SEXP pniter,
-					       SEXP pmaxdelta, SEXP parea,
-					       SEXP pcoolexp, SEXP prepulserad,
-					       SEXP pcellsize, SEXP start, 
-					       SEXP pweights) {
-
-  igraph_t g;
-  igraph_matrix_t res;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t maxdelta=REAL(pmaxdelta)[0];
-  igraph_real_t area=REAL(parea)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t repulserad=REAL(prepulserad)[0];
-  igraph_real_t cellsize=REAL(pcellsize)[0];
-  igraph_bool_t use_seed=!isNull(start);
-  igraph_vector_t weights, *ppweights=0;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) { R_SEXP_to_vector(pweights, &weights);ppweights=&weights; }
-  if (use_seed) {
-    R_SEXP_to_igraph_matrix_copy(start, &res);
-  } else {
-    igraph_matrix_init(&res, 0, 0);
-  }
-  igraph_layout_grid_fruchterman_reingold(&g, &res, niter, maxdelta, area,
-					  coolexp, repulserad, cellsize, 
-					  use_seed, ppweights);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_minimum_spanning_tree_unweighted(SEXP graph) {
-  
-  igraph_t g;
-  igraph_t mst;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_minimum_spanning_tree_unweighted(&g, &mst);
-  PROTECT(result=R_igraph_to_SEXP(&mst));
-  igraph_destroy(&mst);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_minimum_spanning_tree_prim(SEXP graph, SEXP pweights) {
-  
-  igraph_t g;
-  igraph_t mst;
-  igraph_vector_t weights;
-  SEXP result;
-  
-  R_SEXP_to_vector(pweights, &weights);
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_minimum_spanning_tree_prim(&g, &mst, &weights);
-  PROTECT(result=R_igraph_to_SEXP(&mst));
-  igraph_destroy(&mst);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_get_shortest_paths(SEXP graph, SEXP pfrom, SEXP pto, 
-				 SEXP pmode, SEXP pno, SEXP weights, 
-				 SEXP output) {
-
-  igraph_t g;
-  igraph_integer_t from=REAL(pfrom)[0];
-  igraph_vs_t to;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_t *vects, *evects;
-  long int i;
-  igraph_vector_ptr_t ptrvec, ptrevec;
-  igraph_vector_t w, *pw=&w;
-  SEXP result, result1, result2, names;
-  igraph_bool_t verts=REAL(output)[0]==0 || REAL(output)[0]==2;
-  igraph_bool_t edges=REAL(output)[0]==1 || REAL(output)[0]==2;
-  int tofree=1;
-  
-  long int no=REAL(pno)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pto, &g, &to);
-
-  if (verts) { 
-    igraph_vector_ptr_init(&ptrvec, no);
-    vects=(igraph_vector_t*) R_alloc(GET_LENGTH(pto), sizeof(igraph_vector_t));
-    for (i=0; i<no; i++) {
-      igraph_vector_init(&vects[i], 0);
-      VECTOR(ptrvec)[i]=&vects[i];
-    }
-  }
-  if (edges) { 
-    igraph_vector_ptr_init(&ptrevec, no);
-    evects=(igraph_vector_t*) R_alloc(GET_LENGTH(pto), sizeof(igraph_vector_t));
-    for (i=0; i<no; i++) {
-      igraph_vector_init(&evects[i], 0);
-      VECTOR(ptrevec)[i]=&evects[i];
-    }
-  }
-  
-  if (isNull(weights)) {
-    pw=0;
-  } else {
-    R_SEXP_to_vector(weights, &w);
-  }
-  igraph_get_shortest_paths_dijkstra(&g, 
-				     verts ? &ptrvec : 0, 
-				     edges ? &ptrevec : 0,
-				     from, to, pw, mode);
-  if (!verts && !edges) { 
-    /* nothing requested */
-    PROTECT(result=R_NilValue);
-  } 
-  if (verts) {
-    PROTECT(result1=NEW_LIST(no));
-    for (i=0; i<no; i++) {
-      SET_VECTOR_ELT(result1, i, NEW_NUMERIC(igraph_vector_size(&vects[i])));
-      igraph_vector_copy_to(&vects[i], REAL(VECTOR_ELT(result1, i)));
-      igraph_vector_destroy(&vects[i]);
-    }
-    igraph_vector_ptr_destroy(&ptrvec);
-  }
-  if (edges) {
-    PROTECT(result2=NEW_LIST(no));
-    for (i=0; i<no; i++) {
-      SET_VECTOR_ELT(result2, i, NEW_NUMERIC(igraph_vector_size(&evects[i])));
-      igraph_vector_copy_to(&evects[i], REAL(VECTOR_ELT(result2, i)));
-      igraph_vector_destroy(&evects[i]);
-    }
-    igraph_vector_ptr_destroy(&ptrevec);
-  }
-
-  if (verts && !edges) {
-    result=result1;
-  } else if (!verts && edges) {
-    result=result2;
-  } else {
-    PROTECT(result=NEW_LIST(2));
-    PROTECT(names=NEW_CHARACTER(2));
-    SET_VECTOR_ELT(result, 0, result1);
-    SET_VECTOR_ELT(result, 1, result2);
-    SET_STRING_ELT(names, 0, mkChar("vpath"));
-    SET_STRING_ELT(names, 1, mkChar("epath"));
-    SET_NAMES(result, names);
-    tofree=4;
-  }
-  
-  UNPROTECT(tofree);
-  return result;
-}
-
-SEXP R_igraph_are_connected(SEXP graph, SEXP pv1, SEXP pv2) {
-  
-  igraph_t g;
-  igraph_integer_t v1=REAL(pv1)[0];
-  igraph_integer_t v2=REAL(pv2)[0];
-  igraph_bool_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  PROTECT(result=NEW_LOGICAL(1));
-  igraph_are_connected(&g, v1, v2, &res);
-  LOGICAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_graph_adjacency(SEXP adjmatrix, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_matrix_t adjm;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-  
-  R_SEXP_to_matrix(adjmatrix, &adjm);
-  igraph_adjacency(&g, &adjm, mode);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_weighted_adjacency(SEXP adjmatrix, SEXP pmode,
-				 SEXP pattr, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_matrix_t adjm;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  const char *attr=CHAR(STRING_ELT(pattr, 0));
-  
-  R_SEXP_to_matrix(adjmatrix, &adjm);
-  igraph_weighted_adjacency(&g, &adjm, mode, attr, loops);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_average_path_length(SEXP graph, SEXP pdirected, 
-				  SEXP punconnected) {
-  
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t unconnected=LOGICAL(punconnected)[0];
-  igraph_real_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  igraph_average_path_length(&g, &res, directed, unconnected);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_star(SEXP pn, SEXP pmode, SEXP pcenter) {
-
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_integer_t center=REAL(pcenter)[0];
-  SEXP result;
-  
-  igraph_star(&g, n, mode, center);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_ring(SEXP pn, SEXP pdirected, SEXP pmutual, SEXP pcircular) {
-
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t mutual=LOGICAL(pmutual)[0];
-  igraph_bool_t circular=LOGICAL(pcircular)[0];
-  SEXP result;
-  
-  igraph_ring(&g, n, directed, mutual, circular);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_tree(SEXP pn, SEXP pchildren, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_integer_t children=REAL(pchildren)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-
-  igraph_tree(&g, n, children, mode);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_subgraph(SEXP graph, SEXP pvids) {
-  
-  igraph_t g;
-  igraph_t sub;
-  igraph_vs_t vs;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  igraph_subgraph(&g, &sub, vs);
-  PROTECT(result=R_igraph_to_SEXP(&sub));
-  igraph_destroy(&sub);
-  igraph_vs_destroy(&vs);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_random(SEXP graph) {
-  
-  igraph_t g;
-  igraph_matrix_t res;
-  SEXP result=R_NilValue;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_random(&g, &res);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_circle(SEXP graph) {
-  
-  igraph_t g;
-  igraph_matrix_t res;
-  SEXP result=R_NilValue;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_circle(&g, &res);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_erdos_renyi_game(SEXP pn, SEXP ptype,
-			       SEXP pporm, SEXP pdirected, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_integer_t type=REAL(ptype)[0];
-  igraph_real_t porm=REAL(pporm)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  
-  igraph_erdos_renyi_game(&g, type, n, porm, directed, loops);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_full(SEXP pn, SEXP pdirected, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  
-  igraph_full(&g, n, directed, loops);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_random_sample(SEXP plow, SEXP phigh, SEXP plength) {
-  
-  igraph_vector_t res;
-  igraph_integer_t low=REAL(plow)[0];
-  igraph_integer_t high=REAL(phigh)[0];
-  igraph_integer_t length=REAL(plength)[0];
-  SEXP result;
-
-  igraph_vector_init(&res, 0);
-  igraph_random_sample(&res, low, high, length);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_get_edgelist(SEXP graph, SEXP pbycol) {
-  
-  igraph_t g;
-  igraph_vector_t res;
-  igraph_bool_t bycol=LOGICAL(pbycol)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_get_edgelist(&g, &res, bycol);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_get_adjacency(SEXP graph, SEXP ptype, SEXP peids) {
-  
-  igraph_t g;
-  igraph_matrix_t res;
-  igraph_integer_t type=REAL(ptype)[0];
-  igraph_bool_t eids=LOGICAL(peids)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_get_adjacency(&g, &res, type, eids);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_layout_fruchterman_reingold(SEXP graph, SEXP pniter, 
-					  SEXP pmaxdelta, SEXP parea,
-					  SEXP pcoolexp, SEXP prepulserad,
-					  SEXP pweights, SEXP start,
-					  SEXP pminx, SEXP pmaxx,
-					  SEXP pminy, SEXP pmaxy, 
-					  SEXP pminz, SEXP pmaxz) {
-  igraph_t g;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t maxdelta=REAL(pmaxdelta)[0];
-  igraph_real_t area=REAL(parea)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t repulserad=REAL(prepulserad)[0];
-  igraph_vector_t weights, *ppweights=0;
-  igraph_matrix_t res;
-  igraph_vector_t minx, maxx, *ppminx=0, *ppmaxx=0;
-  igraph_vector_t miny, maxy, *ppminy=0, *ppmaxy=0;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) { R_SEXP_to_vector(pweights, &weights);ppweights=&weights; }
-  if (!isNull(pminx)) { ppminx=&minx; R_SEXP_to_vector(pminx, &minx); }
-  if (!isNull(pmaxx)) { ppmaxx=&maxx; R_SEXP_to_vector(pmaxx, &maxx); }  
-  if (!isNull(pminy)) { ppminy=&miny; R_SEXP_to_vector(pminy, &miny); }
-  if (!isNull(pmaxy)) { ppmaxy=&maxy; R_SEXP_to_vector(pmaxy, &maxy); }  
-  if (isNull(start)) {
-    igraph_matrix_init(&res, 0, 0);
-  } else {
-    R_SEXP_to_igraph_matrix_copy(start, &res);
-  }
-  igraph_layout_fruchterman_reingold(&g, &res, niter, maxdelta, area, 
-				     coolexp, repulserad, !isNull(start),
-				     ppweights, ppminx, ppmaxx, 
-				     ppminy, ppmaxy);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_fruchterman_reingold_3d(SEXP graph, SEXP pniter, 
-					     SEXP pmaxdelta, SEXP parea,
-					     SEXP pcoolexp, SEXP prepulserad,
-					     SEXP pweights, 
-					     SEXP pminx, SEXP pmaxx,
-					     SEXP pminy, SEXP pmaxy, 
-					     SEXP pminz, SEXP pmaxz) {
-  igraph_t g;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_real_t maxdelta=REAL(pmaxdelta)[0];
-  igraph_real_t area=REAL(parea)[0];
-  igraph_real_t coolexp=REAL(pcoolexp)[0];
-  igraph_real_t repulserad=REAL(prepulserad)[0];
-  igraph_vector_t weights, *ppweights=0;
-  igraph_vector_t minx, maxx, *ppminx=0, *ppmaxx=0;
-  igraph_vector_t miny, maxy, *ppminy=0, *ppmaxy=0;
-  igraph_vector_t minz, maxz, *ppminz=0, *ppmaxz=0;
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) { R_SEXP_to_vector(pweights, &weights);ppweights=&weights; }
-  if (!isNull(pminx)) { ppminx=&minx; R_SEXP_to_vector(pminx, &minx); }
-  if (!isNull(pmaxx)) { ppmaxx=&maxx; R_SEXP_to_vector(pmaxx, &maxx); }  
-  if (!isNull(pminy)) { ppminy=&miny; R_SEXP_to_vector(pminy, &miny); }
-  if (!isNull(pmaxy)) { ppmaxy=&maxy; R_SEXP_to_vector(pmaxy, &maxy); }  
-  if (!isNull(pminz)) { ppminz=&minz; R_SEXP_to_vector(pminz, &minz); }
-  if (!isNull(pmaxz)) { ppmaxz=&maxz; R_SEXP_to_vector(pmaxz, &maxz); }  
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_fruchterman_reingold_3d(&g, &res, niter, maxdelta, area, 
-					coolexp, repulserad, 0, ppweights, 
-					ppminx, ppmaxx, ppminy, ppmaxy, 
-					ppminz, ppmaxz);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_degree_sequence_game(SEXP pout_seq, SEXP pin_seq, 
-				   SEXP pmethod) {
-  igraph_t g;
-  igraph_vector_t outseq;
-  igraph_vector_t inseq;
-  igraph_integer_t method=REAL(pmethod)[0];
-  SEXP result;
-
-  R_SEXP_to_vector(pout_seq, &outseq);
-  if (!isNull(pin_seq)) { R_SEXP_to_vector(pin_seq, &inseq); }
-  igraph_degree_sequence_game(&g, &outseq, 
-			      isNull(pin_seq) ? 0 : &inseq, method);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_transitivity_undirected(SEXP graph, SEXP pisolates) {
-  
-  igraph_t g;
-  igraph_real_t res;
-  SEXP result;
-  igraph_transitivity_mode_t isolates=REAL(pisolates)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_transitivity_undirected(&g, &res, isolates);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_transitivity_avglocal_undirected(SEXP graph, SEXP pisolates) {
-  
-  igraph_t g;
-  igraph_real_t res;
-  SEXP result;
-  igraph_transitivity_mode_t isolates=REAL(pisolates)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_transitivity_avglocal_undirected(&g, &res, isolates);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_transitivity_local_undirected(SEXP graph, SEXP pvids, 
-					    SEXP pisolates) {
-  
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_vector_t res;
-  SEXP result;
-  igraph_transitivity_mode_t isolates=REAL(pisolates)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  igraph_vector_init(&res, 0);
-  igraph_transitivity_local_undirected(&g, &res, vs, isolates);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_transitivity_barrat(SEXP graph, SEXP pvids, 
-				  SEXP pweights, SEXP pisolates) {
-  
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_vector_t weights;
-  igraph_vector_t res;
-  SEXP result;
-  igraph_transitivity_mode_t isolates=REAL(pisolates)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vs);
-  R_SEXP_to_vector(pweights, &weights);
-  igraph_vector_init(&res, 0);  
-  igraph_transitivity_barrat(&g, &res, vs, &weights, isolates);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_transitivity_local_undirected_all(SEXP graph, SEXP pisolates) {
-  
-  igraph_t g;
-  igraph_vector_t res;
-  SEXP result;
-  igraph_transitivity_mode_t isolates=REAL(pisolates)[0];
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_transitivity_local_undirected(&g, &res, igraph_vss_all(), 
-				       isolates);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_read_graph_edgelist(SEXP pvfile, SEXP pn, SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  FILE *file;
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else 
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read edgelist", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_edgelist(&g, file, n, directed);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_read_graph_gml(SEXP pvfile) {
-
-  igraph_t g;
-  FILE *file;
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else 
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read GML file", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_gml(&g, file);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_read_graph_dl(SEXP pvfile, SEXP pdirected) {
-
-  igraph_t g;
-  FILE *file;
-  SEXP result;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else 
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read DL file", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_dl(&g, file, directed);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_read_graph_graphdb(SEXP pvfile, SEXP pdirected) {
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  FILE *file;
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "rb");
-#else
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "rb");
-#endif
-  if (file==0) { igraph_error("Cannot read graphdb file", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_graphdb(&g, file, directed);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_edgelist(SEXP graph, SEXP file) {
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write edgelist", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_edgelist(&g, stream);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else 
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_gml(SEXP graph, SEXP file, SEXP pid, SEXP pcreator) {
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  igraph_vector_t id, *ppid=0;
-  const char *creator=0;
-  SEXP result;
-  
-  if (!isNull(pid)) { R_SEXP_to_vector(pid, &id); ppid=&id; }
-  if (!isNull(pcreator)) { creator=CHAR(STRING_ELT(pcreator, 0)); } 
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write edgelist", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_gml(&g, stream, ppid, creator);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else 
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_dot(SEXP graph, SEXP file) {
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write edgelist", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_dot(&g, stream);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else 
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_leda(SEXP graph, SEXP file, SEXP va, SEXP ea) {
-  igraph_t g;
-  FILE *stream;
-  char *bp;
-  size_t size;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write edgelist", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_leda(&g, stream, 
-			  isNull(va) ? 0 : CHAR(STRING_ELT(va, 0)),
-			  isNull(ea) ? 0 : CHAR(STRING_ELT(ea, 0)));
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else 
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_pajek(SEXP graph, SEXP file) {
-  
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "wb");
-#endif
-  if (stream==0) { igraph_error("Cannot write oajek file", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_pajek(&g, stream);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else 
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_read_graph_ncol(SEXP pvfile, SEXP ppredef,
-			      SEXP pnames, SEXP pweights,
-			      SEXP pdirected) {
-  igraph_t g;
-  igraph_bool_t names=LOGICAL(pnames)[0];
-  igraph_add_weights_t weights=REAL(pweights)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  FILE *file;
-  igraph_strvector_t predef, *predefptr=0;  
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else 
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read edgelist", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  if (GET_LENGTH(ppredef)>0) {
-    R_igraph_SEXP_to_strvector(ppredef, &predef);
-    predefptr=&predef;
-  } 
-  igraph_read_graph_ncol(&g, file, predefptr, names, weights, directed);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_write_graph_ncol(SEXP graph, SEXP file, SEXP pnames, 
-			       SEXP pweights) {
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  const char *names, *weights;
-  SEXP result;
-
-  if (isNull(pnames)) {
-    names=0; 
-  } else {
-    names=CHAR(STRING_ELT(pnames, 0));
-  } 
-  if (isNull(pweights)) {
-    weights=0; 
-  } else {
-    weights=CHAR(STRING_ELT(pweights, 0));
-  }   
-
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else 
-  stream=fopen(CHAR(STRING_ELT(file,0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write .ncol file", __FILE__, __LINE__,
-				IGRAPH_EFILE); }
-  igraph_write_graph_ncol(&g, stream, names, weights);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_read_graph_lgl(SEXP pvfile, SEXP pnames, SEXP pweights, SEXP pdirected) {
-  igraph_t g;
-  igraph_bool_t names=LOGICAL(pnames)[0];
-  igraph_add_weights_t weights=REAL(pweights)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  FILE *file;
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else 
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read edgelist", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_lgl(&g, file, names, weights, directed);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_write_graph_lgl(SEXP graph, SEXP file, SEXP pnames, 
-			      SEXP pweights, SEXP pisolates) {
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  const char *names, *weights;
-  igraph_bool_t isolates=LOGICAL(pisolates)[0];
-  SEXP result;
-
-  if (isNull(pnames)) {
-    names=0; 
-  } else {
-    names=CHAR(STRING_ELT(pnames, 0));
-  } 
-  if (isNull(pweights)) {
-    weights=0; 
-  } else {
-    weights=CHAR(STRING_ELT(pweights, 0));
-  }   
-
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  igraph_write_graph_lgl(&g, stream, names, weights, isolates);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_read_graph_pajek(SEXP pvfile) {
-  igraph_t g;
-  FILE *file;  
-  SEXP result;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read Pajek file", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_pajek(&g, file);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-} 
-
-SEXP R_igraph_decompose(SEXP graph, SEXP pmode, SEXP pmaxcompno, 
-			SEXP pminelements) {
-
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_integer_t maxcompno=REAL(pmaxcompno)[0];
-  igraph_integer_t minelements=REAL(pminelements)[0];
-  igraph_vector_ptr_t comps;
-  SEXP result;
-  long int i;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&comps, 0);
-  IGRAPH_FINALLY(igraph_vector_ptr_destroy, &comps);
-  igraph_decompose(&g, &comps, mode, maxcompno, minelements);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&comps)));
-  for (i=0; i<igraph_vector_ptr_size(&comps); i++) {
-    SET_VECTOR_ELT(result, i, R_igraph_to_SEXP(VECTOR(comps)[i]));
-    igraph_destroy(VECTOR(comps)[i]);
-    igraph_free(VECTOR(comps)[i]);
-  }
-  igraph_vector_ptr_destroy(&comps);
-  IGRAPH_FINALLY_CLEAN(1);
-  
-  UNPROTECT(1);
-  return result;  
-}
-
-SEXP R_igraph_atlas(SEXP pno) {
-  
-  int no=REAL(pno)[0];
-  igraph_t g;
-  SEXP result;
-  
-  igraph_atlas(&g, no);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_random_3d(SEXP graph) {
-  
-  igraph_t g;
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_random_3d(&g, &res);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);  
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_sphere(SEXP graph) {
-
-  igraph_t g;
-  igraph_matrix_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_sphere(&g, &res);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_callaway_traits_game(SEXP pnodes, SEXP ptypes, 
-				  SEXP pepers, SEXP ptype_dist,
-				  SEXP pmatrix, SEXP pdirected) {
-
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t types=REAL(ptypes)[0];
-  igraph_integer_t epers=REAL(pepers)[0];
-  igraph_vector_t type_dist;
-  igraph_matrix_t matrix;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result; 
-
-  R_SEXP_to_vector(ptype_dist, &type_dist);
-  R_SEXP_to_matrix(pmatrix, &matrix);
-  igraph_callaway_traits_game(&g, nodes, types, epers, &type_dist,
-			      &matrix, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_establishment_game(SEXP pnodes, SEXP ptypes, SEXP pk,
-				 SEXP ptype_dist, SEXP pmatrix,
-				 SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t types=REAL(ptypes)[0];
-  igraph_integer_t k=REAL(pk)[0];
-  igraph_vector_t type_dist;
-  igraph_matrix_t matrix;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(ptype_dist, &type_dist);
-  R_SEXP_to_matrix(pmatrix, &matrix);
-  igraph_establishment_game(&g, nodes, types, k, &type_dist, &matrix,
-			    directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-			    
-SEXP R_igraph_motifs_randesu(SEXP graph, SEXP psize, SEXP pcutprob) {
-  igraph_t g;
-  igraph_integer_t size=INTEGER(psize)[0];
-  igraph_vector_t cutprob;
-  igraph_vector_t res;
-  SEXP result;
-
-  R_SEXP_to_vector(pcutprob, &cutprob);
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_motifs_randesu(&g, &res, size, &cutprob);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_motifs_randesu_no(SEXP graph, SEXP psize, SEXP pcutprob) {
-  igraph_t g;
-  igraph_integer_t size=INTEGER(psize)[0];
-  igraph_vector_t cutprob;
-  igraph_integer_t res;
-  SEXP result;
-
-  R_SEXP_to_vector(pcutprob, &cutprob);
-  R_SEXP_to_igraph(graph, &g);
-  igraph_motifs_randesu_no(&g, &res, size, &cutprob);
-  PROTECT(result=NEW_INTEGER(1));
-  INTEGER(result)[0]=res;
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_motifs_randesu_estimate(SEXP graph, SEXP psize, SEXP pcutprob,
-				      SEXP psamplesize, SEXP psample) {
-  igraph_t g;
-  igraph_integer_t size=INTEGER(psize)[0];
-  igraph_vector_t cutprob;
-  igraph_integer_t samplesize=INTEGER(psamplesize)[0];
-  igraph_vector_t sample;
-  igraph_vector_t *sampleptr=0;
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_vector(pcutprob, &cutprob);
-  if (GET_LENGTH(psample) != 0) {
-    R_SEXP_to_vector(psample, &sample);
-    sampleptr=&sample;
-  }
-  R_SEXP_to_igraph(graph, &g);
-  igraph_motifs_randesu_estimate(&g, &res, size, &cutprob, samplesize,
-				 sampleptr);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_layout_merge_dla(SEXP graphs, SEXP layouts) {
-
-  igraph_vector_ptr_t graphvec;
-  igraph_vector_ptr_t ptrvec;
-  igraph_t *gras;
-  igraph_matrix_t *mats;
-  igraph_matrix_t res;
-  long int i;
-  SEXP result;
-  
-  igraph_vector_ptr_init(&graphvec, GET_LENGTH(graphs));
-  igraph_vector_ptr_init(&ptrvec, GET_LENGTH(layouts));
-  gras=(igraph_t*)R_alloc(GET_LENGTH(graphs), sizeof(igraph_t));
-  mats=(igraph_matrix_t*)R_alloc(GET_LENGTH(layouts),
-				 sizeof(igraph_matrix_t));
-  for (i=0; i<GET_LENGTH(graphs); i++) {
-    R_SEXP_to_igraph(VECTOR_ELT(graphs, i), &gras[i]);
-    VECTOR(graphvec)[i]=&gras[i];
-  }
-  for (i=0; i<GET_LENGTH(layouts); i++) {
-    R_SEXP_to_matrix(VECTOR_ELT(layouts, i), &mats[i]);
-    VECTOR(ptrvec)[i]=&mats[i];
-  }
-  igraph_matrix_init(&res, 0, 0);
-  igraph_layout_merge_dla(&graphvec, &ptrvec, &res);
-  igraph_vector_ptr_destroy(&graphvec);
-  igraph_vector_ptr_destroy(&ptrvec);
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_disjoint_union(SEXP pgraphs) {
-  
-  igraph_vector_ptr_t ptrvec;
-  igraph_t *graphs;
-  igraph_t res;
-  long int i;
-  SEXP result;
-
-  igraph_vector_ptr_init(&ptrvec, GET_LENGTH(pgraphs));
-  graphs=(igraph_t *)R_alloc(GET_LENGTH(pgraphs),
-			     sizeof(igraph_t));
-  for (i=0; i<GET_LENGTH(pgraphs); i++) {
-    R_SEXP_to_igraph(VECTOR_ELT(pgraphs, i), &graphs[i]);
-    VECTOR(ptrvec)[i]=&graphs[i];
-  }
-  igraph_disjoint_union_many(&res, &ptrvec);
-  igraph_vector_ptr_destroy(&ptrvec);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_union(SEXP pgraphs) {
-  
-  igraph_vector_ptr_t ptrvec;
-  igraph_t *graphs;
-  igraph_t res;
-  long int i;
-  SEXP result;
-
-  igraph_vector_ptr_init(&ptrvec, GET_LENGTH(pgraphs));
-  graphs=(igraph_t *)R_alloc(GET_LENGTH(pgraphs),
-			     sizeof(igraph_t));
-  for (i=0; i<GET_LENGTH(pgraphs); i++) {
-    R_SEXP_to_igraph(VECTOR_ELT(pgraphs, i), &graphs[i]);
-    VECTOR(ptrvec)[i]=&graphs[i];
-  }
-  igraph_union_many(&res, &ptrvec);
-  igraph_vector_ptr_destroy(&ptrvec);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_intersection(SEXP pgraphs) {
-  
-  igraph_vector_ptr_t ptrvec;
-  igraph_t *graphs;
-  igraph_t res;
-  long int i;
-  SEXP result;
-  
-  igraph_vector_ptr_init(&ptrvec, GET_LENGTH(pgraphs));
-  graphs=(igraph_t *)R_alloc(GET_LENGTH(pgraphs),
-			     sizeof(igraph_t));
-  for (i=0; i<GET_LENGTH(pgraphs); i++) {
-    R_SEXP_to_igraph(VECTOR_ELT(pgraphs, i), &graphs[i]);
-    VECTOR(ptrvec)[i]=&graphs[i];
-  }
-  igraph_intersection_many(&res, &ptrvec);
-  igraph_vector_ptr_destroy(&ptrvec);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_difference(SEXP pleft, SEXP pright) {
-  
-  igraph_t left, right;
-  igraph_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(pleft, &left);
-  R_SEXP_to_igraph(pright, &right);
-  igraph_difference(&res, &left, &right);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_complementer(SEXP pgraph, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_t res;
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(pgraph, &g);
-  igraph_complementer(&res, &g, loops);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_compose(SEXP pleft, SEXP pright) {
-  
-  igraph_t left, right;
-  igraph_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(pleft, &left);
-  R_SEXP_to_igraph(pright, &right);
-  igraph_compose(&res, &left, &right);
-  PROTECT(result=R_igraph_to_SEXP(&res));
-  igraph_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_barabasi_aging_game(SEXP pn, SEXP ppa_exp, SEXP paging_exp,
-				  SEXP paging_bin, SEXP pm, SEXP pout_seq,
-				  SEXP pout_pref, SEXP pzero_deg_appeal,
-				  SEXP pzero_age_appeal, SEXP pdeg_coef,
-				  SEXP page_coef,
-				  SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_real_t pa_exp=REAL(ppa_exp)[0];
-  igraph_real_t aging_exp=REAL(paging_exp)[0];
-  igraph_integer_t aging_bin=REAL(paging_bin)[0];
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_vector_t out_seq;
-  igraph_bool_t out_pref=LOGICAL(pout_pref)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_real_t zero_deg_appeal=REAL(pzero_deg_appeal)[0];
-  igraph_real_t zero_age_appeal=REAL(pzero_age_appeal)[0];
-  igraph_real_t deg_coef=REAL(pdeg_coef)[0];
-  igraph_real_t age_coef=REAL(page_coef)[0];  
-  SEXP result;
-  
-  R_SEXP_to_vector(pout_seq, &out_seq);  
-  
-  igraph_barabasi_aging_game(&g, n, m, &out_seq, out_pref, pa_exp, aging_exp,
-			     aging_bin, zero_deg_appeal, zero_age_appeal,
-			     deg_coef, age_coef, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_recent_degree_aging_game(SEXP pn, SEXP ppa_exp, SEXP paging_exp,
-				       SEXP paging_bin, SEXP pm, SEXP pout_seq,
-				       SEXP pout_pref, SEXP pzero_appeal, 
-				       SEXP pdirected,
-				       SEXP ptime_window) {
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_real_t pa_exp=REAL(ppa_exp)[0];
-  igraph_real_t aging_exp=REAL(paging_exp)[0];
-  igraph_integer_t aging_bin=REAL(paging_bin)[0];
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_vector_t out_seq;
-  igraph_bool_t out_pref=LOGICAL(pout_pref)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_integer_t time_window=REAL(ptime_window)[0];
-  igraph_real_t zero_appeal=REAL(pzero_appeal)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(pout_seq, &out_seq);  
-  
-  igraph_recent_degree_aging_game(&g, n, m, &out_seq, out_pref, pa_exp, 
-				  aging_exp, aging_bin, time_window, 
-				  zero_appeal, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_get_edge(SEXP graph, SEXP peid) {
-  
-  igraph_t g;
-  igraph_integer_t eid=REAL(peid)[0];
-  igraph_integer_t from, to;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);  
-  igraph_edge(&g, eid, &from, &to);
-  PROTECT(result=NEW_NUMERIC(2));
-  REAL(result)[0]=from;
-  REAL(result)[1]=to;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_edges(SEXP graph, SEXP eids) {
-  igraph_t g;
-  igraph_es_t es;
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_es(eids, &g, &es);
-  igraph_vector_init(&res, 0);
-  igraph_edges(&g, es, &res);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_es_destroy(&es);
-  
-  UNPROTECT(1);
-  return result;
-}  
-
-SEXP R_igraph_constraint(SEXP graph, SEXP vids, SEXP pweights) {
-  
-  igraph_t g;
-  igraph_vs_t vs;
-  igraph_vector_t weights, *wptr=0;
-  igraph_vector_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(vids, &g, &vs);
-  if (GET_LENGTH(pweights) != 0) {
-    R_SEXP_to_vector(pweights, &weights);
-    wptr=&weights;
-  } 
-  igraph_vector_init(&res, 0);
-  igraph_constraint(&g, &res, vs, wptr);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_es_path(SEXP graph, SEXP pp, SEXP pdir) {
-  
-  igraph_t g;
-  igraph_vector_t p;
-  igraph_bool_t dir=LOGICAL(pdir)[0];
-  igraph_es_t es;
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pp, &p);
-  igraph_es_path(&es, &p, dir);
-  igraph_vector_init(&res, 0);
-  igraph_es_as_vector(&g, es, &res);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_es_destroy(&es);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_es_pairs(SEXP graph, SEXP pp, SEXP pdir) {
-
-  igraph_t g;
-  igraph_vector_t p;
-  igraph_bool_t dir=LOGICAL(pdir)[0];
-  igraph_es_t es;
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pp, &p);
-  igraph_es_pairs(&es, &p, dir);
-  igraph_vector_init(&res, 0);
-  igraph_es_as_vector(&g, es, &res);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_es_destroy(&es);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_reciprocity(SEXP graph, SEXP pignore_loops, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_bool_t ignore_loops=LOGICAL(pignore_loops)[0];
-  igraph_real_t res;
-  igraph_reciprocity_t mode=REAL(pmode)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_reciprocity(&g, &res, ignore_loops, mode);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_layout_reingold_tilford(SEXP graph, SEXP proot, 
-				      SEXP pmode, SEXP prootlevel, SEXP pcirc) {
-  
-  igraph_t g;
-  igraph_vector_t root;
-  igraph_matrix_t res;
-  igraph_bool_t circ=LOGICAL(pcirc)[0];
-  int mode=REAL(pmode)[0];
-  igraph_vector_t rootlevel;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(proot, &root);
-  R_SEXP_to_vector(prootlevel, &rootlevel);
-  igraph_matrix_init(&res, 0, 0);
-  if (!circ) {
-    igraph_layout_reingold_tilford(&g, &res, mode, &root, &rootlevel);
-  } else {
-    igraph_layout_reingold_tilford_circular(&g, &res, mode, &root, &rootlevel);
-  }
-  PROTECT(result=R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_rewire(SEXP graph, SEXP pn, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_rewiring_t mode=REAL(pmode)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_rewire(&g, n, mode);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-  
-SEXP R_igraph_to_directed(SEXP graph, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_to_directed(&g, mode);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_read_graph_graphml(SEXP pvfile, SEXP pindex) {
-  igraph_t g;
-  int index=REAL(pindex)[0];
-  FILE *file;
-  SEXP result;
-
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot open GraphML file", __FILE__, __LINE__,
-			      IGRAPH_EFILE); }
-  igraph_read_graph_graphml(&g, file, index);
-  fclose(file);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_graphml(SEXP graph, SEXP file) {
-  
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write GraphML file", __FILE__, 
-				__LINE__, IGRAPH_EFILE); }
-  igraph_write_graph_graphml(&g, stream);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vs_nei(SEXP graph, SEXP px, SEXP pv, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_vs_t v;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-
-  igraph_vit_t vv;
-  igraph_vector_t neis;
-  long int i;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pv, &g, &v);
-
-  igraph_vector_init(&neis, 0);  
-  igraph_vit_create(&g, v, &vv);
-  PROTECT(result=NEW_LOGICAL(igraph_vcount(&g)));
-  memset(LOGICAL(result), 0, sizeof(LOGICAL(result)[0])*igraph_vcount(&g));
-  
-  while (!IGRAPH_VIT_END(vv)) {
-    igraph_neighbors(&g, &neis, IGRAPH_VIT_GET(vv), mode);
-    for (i=0; i<igraph_vector_size(&neis); i++) {
-      long int nei=VECTOR(neis)[i];
-      LOGICAL(result)[nei]=1;
-    }
-    IGRAPH_VIT_NEXT(vv);
-  }
-
-  igraph_vit_destroy(&vv);
-  igraph_vector_destroy(&neis);
-  igraph_vs_destroy(&v);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vs_adj(SEXP graph, SEXP px, SEXP pe, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_es_t e;
-  int mode=REAL(pmode)[0];
-  SEXP result;
-
-  igraph_integer_t from, to;
-  igraph_eit_t ee;
-
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_es(pe, &g, &e);
-  
-  igraph_eit_create(&g, e, &ee);
-  PROTECT(result=NEW_LOGICAL(igraph_vcount(&g)));
-  memset(LOGICAL(result), 0, sizeof(LOGICAL(result)[0])*igraph_vcount(&g));
-
-  while (!IGRAPH_EIT_END(ee)) {
-    igraph_edge(&g, IGRAPH_EIT_GET(ee), &from, &to);
-    if (mode & 1) { 
-      LOGICAL(result)[ (long int)from]=1;
-    }
-    if (mode & 2) {
-      LOGICAL(result)[ (long int)to]=1;
-    }
-    IGRAPH_EIT_NEXT(ee);
-  }
-  
-  igraph_eit_destroy(&ee);
-  igraph_es_destroy(&e);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_es_adj(SEXP graph, SEXP x, SEXP pv, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_vs_t v;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-  
-  igraph_vector_t adje;
-  igraph_vit_t vv;
-  long int i;
-
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pv, &g, &v);
-  
-  igraph_vit_create(&g, v, &vv);
-  igraph_vector_init(&adje, 0);
-  PROTECT(result=NEW_LOGICAL(igraph_ecount(&g)));
-  memset(LOGICAL(result), 0, sizeof(LOGICAL(result)[0])*igraph_ecount(&g));
-  
-  while (!IGRAPH_VIT_END(vv)) {
-    igraph_incident(&g, &adje, IGRAPH_VIT_GET(vv), mode);
-    for (i=0; i<igraph_vector_size(&adje); i++) {
-      long int edge=VECTOR(adje)[i];
-      LOGICAL(result)[edge]=1;
-    }
-    IGRAPH_VIT_NEXT(vv);
-  }
-
-  igraph_vector_destroy(&adje);
-  igraph_vit_destroy(&vv);
-  igraph_vs_destroy(&v);
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_grg_game(SEXP pn, SEXP pradius, SEXP ptorus, 
-		       SEXP pcoords) {
-  
-  igraph_t g;
-  igraph_integer_t n=REAL(pn)[0];
-  igraph_real_t radius=REAL(pradius)[0];
-  igraph_bool_t torus=LOGICAL(ptorus)[0];
-  igraph_bool_t coords=LOGICAL(pcoords)[0];
-  igraph_vector_t x, y, *px=0, *py=0;
-  SEXP result;
-
-  if (coords) {
-    igraph_vector_init(&x, 0);  px=&x;
-    igraph_vector_init(&y, 0);  py=&y;
-  }
-  igraph_grg_game(&g, n, radius, torus, px, py);
-  PROTECT(result=NEW_LIST(3));
-  SET_VECTOR_ELT(result, 0, R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(px));
-  if (coords) { igraph_vector_destroy(px); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(py));
-  if (coords) { igraph_vector_destroy(py); }
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_density(SEXP graph, SEXP ploops) {
-  
-  igraph_t g;
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  igraph_real_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_density(&g, &res, loops);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_read_graph_dimacs(SEXP pvfile, SEXP pdirected) {
-  
-  igraph_t g;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  FILE *file;
-  igraph_vector_t label;
-  igraph_strvector_t problem;
-  igraph_integer_t source, target;
-  igraph_vector_t cap;
-  SEXP result=R_NilValue;
-  
-#if HAVE_FMEMOPEN == 1
-  file=fmemopen(RAW(pvfile), GET_LENGTH(pvfile), "r");
-#else
-  file=fopen(CHAR(STRING_ELT(pvfile, 0)), "r");
-#endif
-  if (file==0) { igraph_error("Cannot read edgelist", __FILE__, __LINE__,
-			      IGRAPH_EFILE); 
-  }
-  igraph_vector_init(&label, 0);
-  igraph_strvector_init(&problem, 0);
-  igraph_vector_init(&cap, 0);
-  igraph_read_graph_dimacs(&g, file, &problem, &label, 
-			   &source, &target, &cap, directed);
-  fclose(file);
-  if (!strcmp(STR(problem, 0), "max")) {
-    PROTECT(result=NEW_LIST(5));
-    SET_VECTOR_ELT(result, 0, R_igraph_strvector_to_SEXP(&problem));
-    igraph_strvector_destroy(&problem);
-    SET_VECTOR_ELT(result, 1, R_igraph_to_SEXP(&g));
-    igraph_destroy(&g);
-    SET_VECTOR_ELT(result, 2, NEW_NUMERIC(1));
-    REAL(VECTOR_ELT(result, 2))[0]=source;
-    SET_VECTOR_ELT(result, 3, NEW_NUMERIC(1));
-    REAL(VECTOR_ELT(result, 3))[0]=target;
-    SET_VECTOR_ELT(result, 4, NEW_NUMERIC(igraph_vector_size(&cap)));
-    igraph_vector_copy_to(&cap, REAL(VECTOR_ELT(result,4)));
-    igraph_vector_destroy(&cap);
-  } else if (!strcmp(STR(problem, 0), "edge")) {
-    PROTECT(result=NEW_LIST(3));
-    SET_VECTOR_ELT(result, 0, R_igraph_strvector_to_SEXP(&problem));    
-    igraph_strvector_destroy(&problem);
-    SET_VECTOR_ELT(result, 1, R_igraph_to_SEXP(&g));
-    igraph_destroy(&g);
-    SET_VECTOR_ELT(result, 2, R_igraph_vector_to_SEXP(&label));
-    igraph_vector_destroy(&label);
-  } else {
-    /* This shouldn't happen */
-    igraph_error("Invalid DIMACS file (problem) type", __FILE__, __LINE__,
-		 IGRAPH_PARSEERROR);
-  }
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_write_graph_dimacs(SEXP graph, SEXP file,
-				 SEXP psource, SEXP ptarget,
-				 SEXP pcap) {
-  
-  igraph_t g;
-  FILE *stream;
-#if HAVE_OPEN_MEMSTREAM == 1
-  char *bp;
-  size_t size;
-#endif
-  igraph_integer_t source=REAL(psource)[0];
-  igraph_integer_t target=REAL(ptarget)[0];
-  igraph_vector_t cap;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcap, &cap);
-#if HAVE_OPEN_MEMSTREAM == 1
-  stream=open_memstream(&bp, &size);
-#else
-  stream=fopen(CHAR(STRING_ELT(file, 0)), "w");
-#endif
-  if (stream==0) { igraph_error("Cannot write edgelist", __FILE__, __LINE__,
-				IGRAPH_EFILE); 
-  }
-  igraph_write_graph_dimacs(&g, stream, source, target, &cap);
-  fclose(stream);
-#if HAVE_OPEN_MEMSTREAM == 1
-  PROTECT(result=allocVector(RAWSXP, size));
-  memcpy(RAW(result), bp, sizeof(char)*size);
-  free(bp);
-#else
-  PROTECT(result=NEW_NUMERIC(0));
-#endif
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_mincut(SEXP graph, SEXP pcapacity) {
-
-  igraph_t g;
-  igraph_vector_t capacity, *ppcapacity=0;
-  igraph_real_t value;
-  igraph_vector_t partition;
-  igraph_vector_t partition2;
-  igraph_vector_t cut;
-  SEXP result, names;
-  
-  igraph_vector_init(&cut, 0);
-  igraph_vector_init(&partition, 0);
-  igraph_vector_init(&partition2, 0);
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pcapacity)) {
-    R_SEXP_to_vector(pcapacity, &capacity);
-    ppcapacity=&capacity;
-  }
-
-  igraph_mincut(&g, &value, &partition,
-		&partition2, &cut, ppcapacity);
-
-  PROTECT(result=NEW_LIST(4));
-  PROTECT(names=NEW_CHARACTER(4));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1));
-  REAL(VECTOR_ELT(result, 0))[0]=value;
-  SET_VECTOR_ELT(result, 1, R_igraph_vector_to_SEXP(&cut));
-  igraph_vector_destroy(&cut);
-  SET_VECTOR_ELT(result, 2, R_igraph_vector_to_SEXP(&partition));
-  igraph_vector_destroy(&partition);
-  SET_VECTOR_ELT(result, 3, R_igraph_vector_to_SEXP(&partition2));
-  igraph_vector_destroy(&partition2);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("value"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("cut"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("partition1"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("partition2"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(2);
-  return result;
-}  
-  
-SEXP R_igraph_mincut_value(SEXP graph, SEXP pcapacity) {
-  
-  igraph_t g;
-  igraph_vector_t capacity, *ppcapacity=0;
-  igraph_real_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pcapacity)) {
-    R_SEXP_to_vector(pcapacity, &capacity);
-    ppcapacity=&capacity;
-  }
-  igraph_mincut_value(&g, &res, ppcapacity);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_st_vertex_connectivity(SEXP graph, SEXP psource, 
-				     SEXP ptarget) {
-  
-  igraph_t g;
-  igraph_integer_t source=REAL(psource)[0], target=REAL(ptarget)[0];
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_st_vertex_connectivity(&g, &res, source, target, 
-				IGRAPH_VCONN_NEI_ERROR);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vertex_connectivity(SEXP graph, SEXP pchecks) {
-  
-  igraph_t g;
-  igraph_integer_t res;
-  igraph_bool_t checks=LOGICAL(pchecks)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vertex_connectivity(&g, &res, checks);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_st_edge_connectivity(SEXP graph, SEXP psource, SEXP ptarget) {
-  
-  igraph_t g;
-  igraph_integer_t source=REAL(psource)[0], target=REAL(ptarget)[0];
-  igraph_integer_t value;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_st_edge_connectivity(&g, &value, source, target);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=value;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_edge_connectivity(SEXP graph, SEXP pchecks) {
-  
-  igraph_t g;
-  igraph_integer_t res;
-  igraph_bool_t checks=LOGICAL(pchecks)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_edge_connectivity(&g, &res, checks);
-  
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_st_mincut_value(SEXP graph, SEXP psource, SEXP ptarget,
-			      SEXP pcapacity) {
-  igraph_t g;
-  igraph_integer_t source=REAL(psource)[0];
-  igraph_integer_t target=REAL(ptarget)[0];
-  igraph_vector_t capacity, *ppcapacity=0;
-  igraph_real_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pcapacity)) {
-    R_SEXP_to_vector(pcapacity, &capacity);
-    ppcapacity=&capacity;
-  }
-  igraph_st_mincut_value(&g, &res, source, target, ppcapacity);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_edge_disjoint_paths(SEXP graph, SEXP psource, SEXP ptarget) {
-  
-  igraph_t g;
-  igraph_integer_t source=REAL(psource)[0];
-  igraph_integer_t target=REAL(ptarget)[0];
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_edge_disjoint_paths(&g, &res, source, target);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_vertex_disjoint_paths(SEXP graph, SEXP psource, SEXP ptarget) {
-  
-  igraph_t g;
-  igraph_integer_t source=REAL(psource)[0];
-  igraph_integer_t target=REAL(ptarget)[0];
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vertex_disjoint_paths(&g, &res, source, target);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_adhesion(SEXP graph, SEXP pchecks) {
-  
-  igraph_t g;
-  igraph_integer_t res;
-  igraph_bool_t checks=LOGICAL(pchecks)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_adhesion(&g, &res, checks);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_cohesion(SEXP graph, SEXP pchecks) {
-  
-  igraph_t g;
-  igraph_integer_t res;
-  igraph_bool_t checks=LOGICAL(pchecks)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_cohesion(&g, &res, checks);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_spinglass_community(SEXP graph, SEXP weights,
-				  SEXP pspins, SEXP pparupdate,
-				  SEXP pstarttemp, SEXP pstoptemp,
-				  SEXP pcoolfact, SEXP pupdate_rule,
-				  SEXP pgamma, SEXP pimplementation, 
-				  SEXP plambda) {
-  igraph_t g;
-  igraph_vector_t v_weights, *pweights=0;
-  igraph_integer_t spins=REAL(pspins)[0];
-  igraph_bool_t parupdate=LOGICAL(pparupdate)[0];
-  igraph_real_t starttemp=REAL(pstarttemp)[0];
-  igraph_real_t stoptemp=REAL(pstoptemp)[0];
-  igraph_real_t coolfact=REAL(pcoolfact)[0];
-  igraph_spincomm_update_t update_rule=REAL(pupdate_rule)[0];
-  igraph_real_t gamma=REAL(pgamma)[0];
-  igraph_real_t implementation=REAL(pimplementation)[0];
-  igraph_real_t lambda=REAL(plambda)[0];
-  igraph_real_t modularity;
-  igraph_real_t temperature;
-  igraph_vector_t membership;
-  igraph_vector_t csize;
-  SEXP result, names;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(weights)) { 
-    pweights=&v_weights; R_SEXP_to_vector(weights, &v_weights);
-  }
-  igraph_vector_init(&membership, 0);
-  igraph_vector_init(&csize, 0);
-  igraph_community_spinglass(&g, pweights, 
-			     &modularity, &temperature, 
-			     &membership, &csize,
-			     spins, parupdate, starttemp, stoptemp,
-			     coolfact, update_rule, gamma,
-			     implementation, lambda);
-  
-  PROTECT(result=NEW_LIST(4));
-  PROTECT(names=NEW_CHARACTER(4));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(igraph_vector_size(&membership)));
-  SET_VECTOR_ELT(result, 1, NEW_NUMERIC(igraph_vector_size(&csize)));
-  SET_VECTOR_ELT(result, 2, NEW_NUMERIC(1));
-  SET_VECTOR_ELT(result, 3, NEW_NUMERIC(1));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("membership"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("csize"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("modularity"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("temperature"));
-  SET_NAMES(result, names);
-  igraph_vector_copy_to(&membership, REAL(VECTOR_ELT(result, 0)));
-  igraph_vector_copy_to(&csize, REAL(VECTOR_ELT(result, 1)));
-  REAL(VECTOR_ELT(result, 2))[0]=modularity;
-  REAL(VECTOR_ELT(result, 3))[0]=temperature;
-  
-  igraph_vector_destroy(&membership);
-  igraph_vector_destroy(&csize);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_spinglass_my_community(SEXP graph, SEXP weights,
-				     SEXP pvertex, SEXP pspins,
-				     SEXP pupdate_rule, SEXP pgamma) {
-  igraph_t g;
-  igraph_vector_t v_weights, *pweights=0;
-  igraph_integer_t vertex=REAL(pvertex)[0];
-  igraph_integer_t spins=REAL(pspins)[0];
-  igraph_spincomm_update_t update_rule=REAL(pupdate_rule)[0];
-  igraph_real_t gamma=REAL(pgamma)[0];
-  igraph_vector_t community;
-  igraph_real_t cohesion;
-  igraph_real_t adhesion;
-  igraph_integer_t inner_links;
-  igraph_integer_t outer_links;
-	
-  SEXP result, names;
-
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(weights)) { 
-    pweights=&v_weights; R_SEXP_to_vector(weights, &v_weights);
-  }
-  igraph_vector_init(&community, 0);
-  igraph_community_spinglass_single(&g, pweights, vertex, &community,
-				    &cohesion, &adhesion, &inner_links,
-				    &outer_links, spins, update_rule, gamma);
-  
-  PROTECT(result=NEW_LIST(5));
-  PROTECT(names=NEW_CHARACTER(5));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(igraph_vector_size(&community)));
-  SET_VECTOR_ELT(result, 1, NEW_NUMERIC(1));
-  SET_VECTOR_ELT(result, 2, NEW_NUMERIC(1));
-  SET_VECTOR_ELT(result, 3, NEW_NUMERIC(1));
-  SET_VECTOR_ELT(result, 4, NEW_NUMERIC(1));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("community"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("cohesion"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("adhesion"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("inner.links"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("outer.links"));
-  SET_NAMES(result, names);
-  igraph_vector_copy_to(&community, REAL(VECTOR_ELT(result, 0)));
-  REAL(VECTOR_ELT(result, 1))[0] = cohesion;
-  REAL(VECTOR_ELT(result, 2))[0] = adhesion;
-  REAL(VECTOR_ELT(result, 3))[0] = inner_links;
-  REAL(VECTOR_ELT(result, 4))[0] = outer_links;
-  
-  igraph_vector_destroy(&community);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_extended_chordal_ring(SEXP pnodes, SEXP pw) {
-
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_matrix_t w;
-  SEXP result;
-  
-  R_SEXP_to_matrix(pw, &w);
-  igraph_extended_chordal_ring(&g, nodes, &w);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_no_clusters(SEXP graph, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_integer_t res;
-  SEXP result;
-
-  R_SEXP_to_igraph(graph, &g);
-  igraph_clusters(&g, 0, 0, &res, mode);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_neighborhood_size(SEXP graph, SEXP pvids, SEXP porder, 
-				SEXP pmode) {
-  igraph_t g;
-  igraph_vs_t vids;
-  igraph_integer_t order=REAL(porder)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vids);
-  igraph_vector_init(&res, 0);
-  igraph_neighborhood_size(&g, &res, vids, order, mode);
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vids);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_neighborhood(SEXP graph, SEXP pvids, SEXP porder, 
-			   SEXP pmode) {
-  igraph_t g;
-  igraph_vs_t vids;
-  igraph_integer_t order=REAL(porder)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_ptr_t res;
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vids);
-  igraph_vector_ptr_init(&res, 0);
-  igraph_neighborhood(&g, &res, vids, order, mode);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&res)));
-  for (i=0; i<igraph_vector_ptr_size(&res); i++) {
-    igraph_vector_t *v=VECTOR(res)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(v)));
-    igraph_vector_copy_to(v, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(v);
-    igraph_free(v);
-  }
-  igraph_vector_ptr_destroy(&res);
-  igraph_vs_destroy(&vids);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_neighborhood_graphs(SEXP graph, SEXP pvids, SEXP porder, 
-				  SEXP pmode) {
-  igraph_t g;
-  igraph_vs_t vids;
-  igraph_integer_t order=REAL(porder)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_ptr_t res;
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_vs(pvids, &g, &vids);
-  igraph_vector_ptr_init(&res, 0);
-  igraph_neighborhood_graphs(&g, &res, vids, order, mode);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&res)));
-  for (i=0; i<igraph_vector_ptr_size(&res); i++) {
-    igraph_t *g=VECTOR(res)[i];
-    SET_VECTOR_ELT(result, i, R_igraph_to_SEXP(g));
-    igraph_destroy(g);
-    igraph_free(g);
-  }
-  igraph_vector_ptr_destroy(&res);
-  igraph_vs_destroy(&vids);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_preference_game(SEXP pnodes, SEXP ptypes, SEXP ptype_dist,
-			      SEXP pfixed_sizes, SEXP pmatrix,
-			      SEXP pdirected, SEXP ploops) {
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t types=REAL(ptypes)[0];
-  igraph_vector_t type_dist;
-  igraph_bool_t fixed_sizes=LOGICAL(pfixed_sizes)[0];
-  igraph_matrix_t matrix;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  igraph_vector_t vtypes;
-  SEXP result;
-  
-  R_SEXP_to_vector(ptype_dist, &type_dist);
-  R_SEXP_to_matrix(pmatrix, &matrix);
-  if (0!=igraph_vector_init(&vtypes, 0)) {
-    igraph_error("Cannot run preference game",
-		 __FILE__, __LINE__, IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_vector_destroy, &vtypes);
-  igraph_preference_game(&g, nodes, types, &type_dist, fixed_sizes, 
-			 &matrix, &vtypes,
-			 directed, loops);  
-  IGRAPH_FINALLY(igraph_destroy, &g);
-  PROTECT(result=NEW_LIST(2));
-  SET_VECTOR_ELT(result, 0, R_igraph_to_SEXP(&g));
-  SET_VECTOR_ELT(result, 1, R_igraph_vector_to_SEXP(&vtypes));
-  igraph_destroy(&g);
-  igraph_vector_destroy(&vtypes);
-  IGRAPH_FINALLY_CLEAN(2);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_asymmetric_preference_game(SEXP pnodes, SEXP ptypes,
-					 SEXP ptype_dist_matrix, SEXP pmatrix,
-					 SEXP ploops) {
-  
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t types=REAL(ptypes)[0];
-  igraph_matrix_t type_dist_matrix;
-  igraph_matrix_t matrix;
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  SEXP result;
-  
-  R_SEXP_to_matrix(ptype_dist_matrix, &type_dist_matrix);
-  R_SEXP_to_matrix(pmatrix, &matrix);
-  igraph_asymmetric_preference_game(&g, nodes, types, &type_dist_matrix,
-				    &matrix, 0, 0, loops);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_connect_neighborhood(SEXP graph, SEXP porder, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t order=REAL(porder)[0];
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_connect_neighborhood(&g, order, mode);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_rewire_edges(SEXP graph, SEXP pprob, SEXP ploops, 
-			   SEXP pmultiple) {
-  
-  igraph_t g;
-  igraph_real_t prob=REAL(pprob)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  igraph_bool_t multiple=LOGICAL(pmultiple)[0];
-  SEXP result;  
-  
-  R_SEXP_to_igraph_copy(graph, &g);
-  igraph_rewire_edges(&g, prob, loops, multiple);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_watts_strogatz_game(SEXP pdim, SEXP psize, SEXP pnei, SEXP pp,
-				  SEXP ploops, SEXP pmultiple) {
-  
-  igraph_t g;
-  igraph_integer_t dim=REAL(pdim)[0];
-  igraph_integer_t size=REAL(psize)[0];
-  igraph_integer_t nei=REAL(pnei)[0];
-  igraph_real_t p=REAL(pp)[0];
-  igraph_bool_t loops=LOGICAL(ploops)[0];
-  igraph_bool_t multiple=LOGICAL(pmultiple)[0];
-  SEXP result;
-  
-  igraph_watts_strogatz_game(&g, dim, size, nei, p, loops, multiple);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_coreness(SEXP graph, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_coreness(&g, &res, mode);
-  
-  PROTECT(result=NEW_NUMERIC(igraph_vector_size(&res)));
-  igraph_vector_copy_to(&res, REAL(result));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_cliques(SEXP graph, SEXP pminsize, SEXP pmaxsize) {
-  
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  igraph_integer_t minsize=REAL(pminsize)[0];
-  igraph_integer_t maxsize=REAL(pmaxsize)[0];
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec, 0);
-  igraph_cliques(&g, &ptrvec, minsize, maxsize);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_largest_cliques(SEXP graph) {
-  
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec,0);
-  igraph_largest_cliques(&g, &ptrvec);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_maximal_cliques(SEXP graph, SEXP pminsize, SEXP pmaxsize) {
-  
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  long int i;
-  igraph_integer_t minsize=REAL(pminsize)[0];
-  igraph_integer_t maxsize=REAL(pmaxsize)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec,0);
-  igraph_maximal_cliques(&g, &ptrvec, minsize, maxsize);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_clique_number(SEXP graph) {
-  
-  igraph_t g;
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_clique_number(&g, &res);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_independent_vertex_sets(SEXP graph, 
-				      SEXP pminsize, SEXP pmaxsize) {
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  igraph_integer_t minsize=REAL(pminsize)[0];
-  igraph_integer_t maxsize=REAL(pmaxsize)[0];
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec, 0);
-  igraph_independent_vertex_sets(&g, &ptrvec, minsize, maxsize);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_largest_independent_vertex_sets(SEXP graph) {
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec,0);
-  igraph_largest_independent_vertex_sets(&g, &ptrvec);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_maximal_independent_vertex_sets(SEXP graph) {
-  igraph_t g;
-  igraph_vector_ptr_t ptrvec;
-  long int i;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_ptr_init(&ptrvec,0);
-  igraph_maximal_independent_vertex_sets(&g, &ptrvec);
-  PROTECT(result=NEW_LIST(igraph_vector_ptr_size(&ptrvec)));
-  for (i=0; i<igraph_vector_ptr_size(&ptrvec); i++) {
-    igraph_vector_t *vec=VECTOR(ptrvec)[i];
-    SET_VECTOR_ELT(result, i, NEW_NUMERIC(igraph_vector_size(vec)));
-    igraph_vector_copy_to(vec, REAL(VECTOR_ELT(result, i)));
-    igraph_vector_destroy(vec);
-    igraph_free(vec);
-  }
-  igraph_vector_ptr_destroy(&ptrvec);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_independence_number(SEXP graph) {
-  igraph_t g;
-  igraph_integer_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_independence_number(&g, &res);
-  PROTECT(result=NEW_NUMERIC(1));
-  REAL(result)[0]=res;
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_lastcit_game(SEXP pnodes, SEXP pedges, SEXP pagebins,
-			   SEXP ppreference, SEXP pdirected) {
-  
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t edges=REAL(pedges)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_vector_t preference;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(ppreference, &preference);
-  igraph_lastcit_game(&g, nodes, edges, agebins, &preference, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_cited_type_game(SEXP pnodes, SEXP pedges, SEXP ptypes,
-			      SEXP ppref, SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t edges=REAL(pedges)[0];
-  igraph_vector_t types, pref;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(ptypes, &types);
-  R_SEXP_to_vector(ppref, &pref);
-  igraph_cited_type_game(&g, nodes, &types, &pref, edges, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-			      
-
-SEXP R_igraph_citing_cited_type_game(SEXP pnodes, SEXP ptypes, SEXP ppref,
-				     SEXP pedges, SEXP pdirected) {
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_integer_t edges=REAL(pedges)[0];
-  igraph_vector_t types;
-  igraph_matrix_t pref;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(ptypes, &types);
-  R_SEXP_to_matrix(ppref, &pref);
-  igraph_citing_cited_type_game(&g, nodes, &types, &pref, edges, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_walktrap_community(SEXP graph, SEXP pweights,
-				 SEXP psteps, SEXP pmerges, 
-				 SEXP pmodularity, SEXP pmembership) {
-  igraph_t g;
-  igraph_vector_t weights, *ppweights=0;
-  igraph_integer_t steps=REAL(psteps)[0];
-  igraph_matrix_t merges, *ppmerges=0;
-  igraph_vector_t modularity, *ppmodularity=0;
-  igraph_vector_t membership, *ppmembership=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    ppweights=&weights;
-    R_SEXP_to_vector(pweights, ppweights);
-  }        
-  if (LOGICAL(pmerges)[0]) {
-    ppmerges=&merges;
-    igraph_matrix_init(ppmerges, 0, 0);
-  }
-  if (LOGICAL(pmodularity)[0]) {
-    ppmodularity=&modularity;
-    igraph_vector_init(ppmodularity, 0);
-  }
-  if (LOGICAL(pmembership)[0]) {
-    ppmembership=&membership;
-    igraph_vector_init(ppmembership, 0);
-  }
-
-  igraph_community_walktrap(&g, ppweights, steps, ppmerges, ppmodularity,
-			    ppmembership);
-
-  PROTECT(result=NEW_LIST(3));
-  SET_VECTOR_ELT(result, 0, R_igraph_0ormatrix_to_SEXP(ppmerges));
-  if (ppmerges) { igraph_matrix_destroy(ppmerges); }
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppmodularity));
-  if (ppmodularity) { igraph_vector_destroy(ppmodularity); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(ppmembership));
-  if (ppmembership) { igraph_vector_destroy(ppmembership); }
-  PROTECT(names=NEW_CHARACTER(3));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("merges"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("modularity"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("membership"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-} 
-
-SEXP R_igraph_topological_sorting(SEXP graph, SEXP pneimode) {
-  igraph_t g;
-  igraph_vector_t res;
-  igraph_integer_t mode=REAL(pneimode)[0];
-  SEXP result;  
-
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&res, 0);
-  igraph_topological_sorting(&g, &res, mode);
-  
-  PROTECT(result=R_igraph_vector_to_SEXP(&res));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_community_edge_betweenness(SEXP graph, SEXP pweights,
-					 SEXP pdirected, 
-					 SEXP peb, SEXP pmerges, SEXP pbridges,
-					 SEXP pmodularity, SEXP pmembership) {
-  igraph_t g;
-  igraph_vector_t weights, *ppweights=0;
-  igraph_vector_t res;
-  igraph_vector_t eb, *ppeb=0;
-  igraph_matrix_t merges, *ppmerges=0;
-  igraph_vector_t bridges, *ppbridges=0;
-  igraph_vector_t modularity, *ppmodularity=0;
-  igraph_vector_t membership, *ppmembership=0;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    ppweights=&weights;
-    R_SEXP_to_vector(pweights, ppweights);
-  }        
-  igraph_vector_init(&res, 0);
-  if (LOGICAL(peb)[0]) {
-    ppeb=&eb;
-    igraph_vector_init(&eb, 0);
-  }
-  if (LOGICAL(pmerges)[0]) {
-    ppmerges=&merges;
-    igraph_matrix_init(&merges, 0, 0);
-  }
-  if (LOGICAL(pbridges)[0]) {
-    ppbridges=&bridges;
-    igraph_vector_init(&bridges, 0);
-  }
-  if (LOGICAL(pmodularity)[0]) {
-    ppmodularity=&modularity;
-    igraph_vector_init(&modularity, 0);
-  }
-  if (LOGICAL(pmembership)[0]) {
-    ppmembership=&membership;
-    igraph_vector_init(&membership, 0);
-  }
-  igraph_community_edge_betweenness(&g, &res, ppeb, ppmerges, ppbridges, 
-				    ppmodularity, ppmembership,
-				    directed, ppweights);
-  
-  PROTECT(result=NEW_LIST(6));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&res));
-  igraph_vector_destroy(&res);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppeb));
-  if (ppeb) { igraph_vector_destroy(ppeb); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppmerges));
-  if (ppmerges) { igraph_matrix_destroy(ppmerges); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(ppbridges));
-  if (ppbridges) { igraph_vector_destroy(ppbridges); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(ppmodularity));
-  if (ppmodularity) { igraph_vector_destroy(ppmodularity); }
-  SET_VECTOR_ELT(result, 5, R_igraph_0orvector_to_SEXP(ppmembership));
-  if (ppmembership) { igraph_vector_destroy(ppmembership); }
-  PROTECT(names=NEW_CHARACTER(6));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("removed.edges"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("edge.betweenness"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("merges"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("bridges"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("modularity"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("membership"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_community_eb_get_merges(SEXP graph, SEXP pweights,
-				      SEXP pedges) {
-  
-  igraph_t g;
-  igraph_vector_t weights, *ppweights=0;
-  igraph_vector_t edges;
-  igraph_vector_t bridges;
-  igraph_matrix_t res;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(pweights)) {
-    ppweights=&weights;
-    R_SEXP_to_vector(pweights, ppweights);
-  }        
-  R_SEXP_to_vector(pedges, &edges);
-  igraph_matrix_init(&res, 0, 0);
-  igraph_vector_init(&bridges, 0);
-  igraph_community_eb_get_merges(&g, &edges, &weights, &res, &bridges, 
-				 /*modularity=*/ 0, /*membership=*/ 0);
-  PROTECT(result=NEW_LIST(2));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&res));
-  igraph_matrix_destroy(&res);    
-  SET_VECTOR_ELT(result, 1, R_igraph_vector_to_SEXP(&bridges));
-  igraph_vector_destroy(&bridges);
-  PROTECT(names=NEW_CHARACTER(2));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("merges"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("bridges"));  
-  SET_NAMES(result, names);
-
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_community_fastgreedy(SEXP graph, SEXP pmerges, SEXP pmodularity, 
-				   SEXP pmembership, SEXP pweights) {
-  
-  igraph_t g;
-  igraph_matrix_t merges, *ppmerges=0;
-  igraph_vector_t modularity, *ppmodularity=0;
-  igraph_vector_t membership, *ppmembership=0;
-  igraph_vector_t weights, *ppweights=0;
-  SEXP result, names;
-  
-  if (!isNull(pweights)) {
-    ppweights=&weights;
-    R_SEXP_to_vector(pweights, ppweights);
-  }        
-  R_SEXP_to_igraph(graph, &g);
-  if (LOGICAL(pmerges)[0]) {
-    ppmerges=&merges;
-    igraph_matrix_init(&merges, 0, 0);
-  }
-  if (LOGICAL(pmodularity)[0]) {
-    ppmodularity=&modularity;
-    igraph_vector_init(&modularity, 0);
-  }
-  if (LOGICAL(pmembership)[0]) {
-    ppmembership=&membership;
-    igraph_vector_init(&membership, 0);
-  }
-  igraph_community_fastgreedy(&g, ppweights, ppmerges, ppmodularity, 
-			      ppmembership);
-  PROTECT(result=NEW_LIST(3));
-  SET_VECTOR_ELT(result, 0, R_igraph_0ormatrix_to_SEXP(ppmerges));
-  if (ppmerges) { igraph_matrix_destroy(ppmerges); }
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppmodularity));
-  if (ppmodularity) { igraph_vector_destroy(ppmodularity); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(ppmembership));
-  if (ppmembership) { igraph_vector_destroy(ppmembership); }
-  PROTECT(names=NEW_CHARACTER(3));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("merges"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("modularity"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("membership"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-} 
-
-SEXP R_igraph_community_to_membership(SEXP graph, SEXP pmerges, 
-				      SEXP psteps, SEXP pmembership,
-				      SEXP pcsize) {
-  igraph_t g;
-  igraph_integer_t nodes;
-  igraph_matrix_t merges;
-  igraph_integer_t steps=REAL(psteps)[0];
-  igraph_vector_t membership, *ppmembership=0;
-  igraph_vector_t csize, *ppcsize=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  nodes=igraph_vcount(&g);
-  R_SEXP_to_matrix(pmerges, &merges);
-  if (LOGICAL(pmembership)[0]) {
-    ppmembership=&membership;
-    igraph_vector_init(ppmembership, 0);
-  } 
-  if (LOGICAL(pcsize)[0]) {
-    ppcsize=&csize;
-    igraph_vector_init(ppcsize, 0);
-  }
-  igraph_community_to_membership(&merges, nodes, steps, ppmembership, ppcsize);
-  PROTECT(result=NEW_LIST(2));
-  SET_VECTOR_ELT(result, 0, R_igraph_0orvector_to_SEXP(ppmembership));
-  if (ppmembership) { igraph_vector_destroy(ppmembership); }
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppcsize)); 
-  if (ppcsize) { igraph_vector_destroy(ppcsize); }
-  PROTECT(names=NEW_CHARACTER(2));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("membership"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("csize"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_community_to_membership2(SEXP pmerges, SEXP pvcount,
-				       SEXP psteps) {
-
-  igraph_t g;
-  igraph_matrix_t merges;
-  igraph_integer_t vcount=REAL(pvcount)[0];
-  igraph_integer_t steps=REAL(psteps)[0];
-  igraph_vector_t membership;
-  SEXP result;
-  
-  R_SEXP_to_matrix(pmerges, &merges);
-  igraph_vector_init(&membership, 0);
-
-  igraph_community_to_membership(&merges, vcount, steps, &membership, 0);
-  PROTECT(result=R_igraph_vector_to_SEXP(&membership));
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_girth(SEXP graph, SEXP pcircle) {
-  
-  igraph_t g;
-  igraph_vector_t circle, *ppcircle=0;
-  igraph_integer_t girth;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (LOGICAL(pcircle)[0]) { igraph_vector_init(&circle, 0); ppcircle=&circle; }
-
-  igraph_girth(&g, &girth, ppcircle);
-
-  PROTECT(result=NEW_LIST(2));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1));
-  REAL(VECTOR_ELT(result, 0))[0]=girth;
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXPp1(ppcircle));
-  if (ppcircle) { igraph_vector_destroy(ppcircle); }
-  PROTECT(names=NEW_CHARACTER(2));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("girth"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("circle"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_line_graph(SEXP graph) {
-  
-  igraph_t g, lg;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_linegraph(&g, &lg);
-  PROTECT(result=R_igraph_to_SEXP(&lg));
-  igraph_destroy(&lg);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_de_bruijn(SEXP pm, SEXP pn) {
-
-  igraph_t g;
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_integer_t n=REAL(pn)[0];
-  SEXP result;
-  
-  igraph_de_bruijn(&g, m, n);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_kautz(SEXP pm, SEXP pn) {
-
-  igraph_t g;
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_integer_t n=REAL(pn)[0];
-  SEXP result;
-  
-  igraph_kautz(&g, m, n);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_is_loop(SEXP graph, SEXP edges) {
-  
-  igraph_es_t es;
-  igraph_t g;
-  igraph_vector_bool_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_es(edges, &g, &es);
-  igraph_vector_bool_init(&res, 0);
-  igraph_is_loop(&g, &res, es);
-  PROTECT(result=R_igraph_vector_bool_to_SEXP(&res));
-  igraph_vector_bool_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_is_multiple(SEXP graph, SEXP edges) {
-  
-  igraph_es_t es;
-  igraph_t g;
-  igraph_vector_bool_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_es(edges, &g, &es);
-  igraph_vector_bool_init(&res, 0);
-  igraph_is_multiple(&g, &res, es);
-  PROTECT(result=R_igraph_vector_bool_to_SEXP(&res));
-  igraph_vector_bool_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_count_multiple(SEXP graph, SEXP edges) {
-  
-  igraph_es_t es;
-  igraph_t g;
-  igraph_vector_t res;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_igraph_es(edges, &g, &es);
-  igraph_vector_init(&res, 0);
-  igraph_count_multiple(&g, &res, es);
-  PROTECT(result=R_igraph_vector_to_SEXP(&res));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_famous(SEXP name) {
-  
-  igraph_t g;
-  SEXP result;
-  
-  igraph_famous(&g, CHAR(STRING_ELT(name, 0)));
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_get_adjlist(SEXP graph, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-  long int i;
-  long int no_of_nodes;
-  igraph_vector_t neis;
-  
-  R_SEXP_to_igraph(graph, &g);
-  no_of_nodes=igraph_vcount(&g);
-  igraph_vector_init(&neis, 0);
-  PROTECT(result=NEW_LIST(no_of_nodes));
-  for (i=0; i<no_of_nodes; i++) {
-    igraph_neighbors(&g, &neis, i, mode);
-    SET_VECTOR_ELT(result, i, R_igraph_vector_to_SEXP(&neis));
-  }
-  igraph_vector_destroy(&neis);
-  
-  UNPROTECT(1);
-  return result;
-} 
-
-SEXP R_igraph_get_adjedgelist(SEXP graph, SEXP pmode) {
-  
-  igraph_t g;
-  igraph_integer_t mode=REAL(pmode)[0];
-  SEXP result;
-  long int i;
-  long int no_of_nodes;
-  igraph_vector_t neis;
-  
-  R_SEXP_to_igraph(graph, &g);
-  no_of_nodes=igraph_vcount(&g);
-  igraph_vector_init(&neis, 0);
-  PROTECT(result=NEW_LIST(no_of_nodes));
-  for (i=0; i<no_of_nodes; i++) {
-    igraph_incident(&g, &neis, i, mode);
-    SET_VECTOR_ELT(result, i, R_igraph_vector_to_SEXP(&neis));
-  }
-  igraph_vector_destroy(&neis);
-  
-  UNPROTECT(1);
-  return result;
-} 
-
-typedef struct R_igraph_i_arpack_data_t {
-  SEXP fun;
-  SEXP extra;
-  SEXP rho;
-} R_igraph_i_arpack_data_t;
-
-int R_igraph_i_arpack_callback(igraph_real_t *to, const igraph_real_t *from,
-			       int n, void *extra) {
-  SEXP s_from, s_to;
-  SEXP R_fcall;
-  R_igraph_i_arpack_data_t *data=extra;
-
-  PROTECT(s_from=NEW_NUMERIC(n));
-  memcpy(REAL(s_from), from, sizeof(igraph_real_t)*n);
-  
-  PROTECT(R_fcall = lang3(data->fun, s_from, data->extra));
-  PROTECT(s_to = eval(R_fcall, data->rho));
-  memcpy(to, REAL(s_to), sizeof(igraph_real_t)*n);
-  
-  UNPROTECT(3);
-  return 0;
-}
-
-SEXP R_igraph_arpack(SEXP function, SEXP extra, SEXP options, SEXP rho,
-		     SEXP sym) {
-  
-  igraph_vector_t values;
-  igraph_matrix_t vectors, values2;
-  R_igraph_i_arpack_data_t data;
-  igraph_arpack_options_t c_options;
-  SEXP result, names;
-
-  if (0 != igraph_matrix_init(&vectors, 0, 0)) {
-    igraph_error("Cannot run ARPACK", __FILE__, __LINE__, IGRAPH_ENOMEM);
-  }
-  IGRAPH_FINALLY(igraph_matrix_destroy, &vectors);
-  if (LOGICAL(sym)[0]) {
-    if (0 != igraph_vector_init(&values, 0)) {
-      igraph_error("Cannot run ARPACK", __FILE__, __LINE__, IGRAPH_ENOMEM);
-    }
-    IGRAPH_FINALLY(igraph_vector_destroy, &values);
-  } else {
-    if (0 != igraph_matrix_init(&values2, 0, 0)) {
-      igraph_error("Cannot run ARPACK", __FILE__, __LINE__, IGRAPH_ENOMEM);
-    }
-    IGRAPH_FINALLY(igraph_matrix_destroy, &values2);
-  }
-  
-  data.fun=function;
-  data.extra=extra;
-  data.rho=rho;
-  
-  R_SEXP_to_igraph_arpack_options(options, &c_options);
-  if (LOGICAL(sym)[0]) {
-    if (0 != igraph_arpack_rssolve(R_igraph_i_arpack_callback, &data,
-				   &c_options, 0, &values, &vectors)) {
-      igraph_error("ARPACK failed", __FILE__, __LINE__, IGRAPH_FAILURE);
-    }
-  } else {
-    if (0 != igraph_arpack_rnsolve(R_igraph_i_arpack_callback, &data,
-				   &c_options, 0, &values2, &vectors)) {
-      igraph_error("ARPACK failed", __FILE__, __LINE__, IGRAPH_FAILURE);
-    }
-  }    
-
-  PROTECT(result=NEW_LIST(3));
-  if (LOGICAL(sym)[0]) {
-    SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&values));
-    igraph_vector_destroy(&values); IGRAPH_FINALLY_CLEAN(1);
-  } else {
-    SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&values2));
-    igraph_matrix_destroy(&values2); IGRAPH_FINALLY_CLEAN(1);
-  }    
-  SET_VECTOR_ELT(result, 1, R_igraph_matrix_to_SEXP(&vectors));
-  igraph_matrix_destroy(&vectors); IGRAPH_FINALLY_CLEAN(1);
-  SET_VECTOR_ELT(result, 2, R_igraph_arpack_options_to_SEXP(&c_options));
-  PROTECT(names=NEW_CHARACTER(3));
-  SET_STRING_ELT(names, 0, mkChar("values"));
-  SET_STRING_ELT(names, 1, mkChar("vectors"));
-  SET_STRING_ELT(names, 2, mkChar("options"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_is_chordal(SEXP graph, SEXP alpha, SEXP alpham1, 
-			 SEXP pfillin, SEXP pnewgraph) {
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_vector_t c_alpha;
-  igraph_vector_t c_alpham1;
-  igraph_bool_t c_chordal;
-  igraph_vector_t c_fillin;
-  igraph_t c_newgraph;
-  SEXP chordal;
-  SEXP fillin;
-  SEXP newgraph;
-  int c_result;
-  SEXP result, names;
-                                        /* Convert input */
-  R_SEXP_to_igraph(graph, &c_graph);
-  if (!isNull(alpha)) { R_SEXP_to_vector(alpha, &c_alpha); }
-  if (!isNull(alpham1)) { R_SEXP_to_vector(alpham1, &c_alpham1); }
-  if (LOGICAL(pfillin)[0]) { 
-    if (0 != igraph_vector_init(&c_fillin, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-  }
-  IGRAPH_FINALLY(igraph_vector_destroy, &c_fillin); 
-  c_result=igraph_is_chordal(&c_graph, (isNull(alpha) ? 0 : &c_alpha),
-			     (isNull(alpham1) ? 0 : &c_alpham1), &c_chordal, 
-			     (LOGICAL(pfillin)[0] ? &c_fillin : 0), 
-			     (LOGICAL(pnewgraph)[0] ? &c_newgraph : 0));
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(3));
-  PROTECT(names=NEW_CHARACTER(3));
-  PROTECT(chordal=NEW_LOGICAL(1)); 
-  LOGICAL(chordal)[0]=c_chordal;
-  if (LOGICAL(pfillin)[0]) {
-    PROTECT(fillin=R_igraph_vector_to_SEXP(&c_fillin));
-    igraph_vector_destroy(&c_fillin); 
-    IGRAPH_FINALLY_CLEAN(1);
-  } else {
-    PROTECT(fillin=R_NilValue);
-  }
-  if (LOGICAL(pnewgraph)[0]) { 
-    IGRAPH_FINALLY(igraph_destroy, &c_newgraph); 
-    PROTECT(newgraph=R_igraph_to_SEXP(&c_newgraph));
-    igraph_destroy(&c_newgraph); 
-    IGRAPH_FINALLY_CLEAN(1);
-  } else {
-    PROTECT(newgraph=R_NilValue);
-  }
-  SET_VECTOR_ELT(result, 0, chordal);
-  SET_VECTOR_ELT(result, 1, fillin);
-  SET_VECTOR_ELT(result, 2, newgraph);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("chordal"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("fillin"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("newgraph"));
-  SET_NAMES(result, names);
-  UNPROTECT(4);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-typedef struct {
-  SEXP graph, fun, extra, rho;
-} R_igraph_i_bfs_data_t;
-
-igraph_bool_t R_igraph_bfshandler(const igraph_t *graph,
-				  igraph_integer_t vid,
-				  igraph_integer_t pred,
-				  igraph_integer_t succ,
-				  igraph_integer_t rank,
-				  igraph_integer_t dist,
-				  void *extra) {
-  
-  R_igraph_i_bfs_data_t *data=extra;
-  SEXP args, R_fcall, result, names;
-  igraph_bool_t cres;
-
-  PROTECT(args=NEW_NUMERIC(5));
-  PROTECT(names=NEW_CHARACTER(5));
-
-  SET_STRING_ELT(names, 0, mkChar("vid"));
-  SET_STRING_ELT(names, 1, mkChar("pred"));
-  SET_STRING_ELT(names, 2, mkChar("succ"));
-  SET_STRING_ELT(names, 3, mkChar("rank"));
-  SET_STRING_ELT(names, 4, mkChar("dist"));
-  REAL(args)[0]=vid;
-  REAL(args)[1]=pred;
-  REAL(args)[2]=succ;
-  REAL(args)[3]=rank;
-  REAL(args)[4]=dist;
-  SET_NAMES(args, names);
-
-  PROTECT(R_fcall = lang4(data->fun, data->graph, args, data->extra));
-  PROTECT(result = eval(R_fcall, data->rho));
-  
-  cres=LOGICAL(result)[0];
-
-  UNPROTECT(4);
-  return cres;
-}
-
-SEXP R_igraph_bfs(SEXP graph, SEXP proot, SEXP proots, SEXP pneimode,
-		  SEXP punreachable, SEXP prestricted,
-		  SEXP porder, SEXP prank, SEXP pfather,
-		  SEXP ppred, SEXP psucc, SEXP pdist, 
-		  SEXP pcallback, SEXP pextra, SEXP prho) {
-  
-  igraph_t g;
-  SEXP result, names;
-
-  igraph_integer_t root=REAL(proot)[0];
-  igraph_vector_t roots;
-  igraph_bool_t unreachable=LOGICAL(punreachable)[0];
-  igraph_vector_t restricted;
-  igraph_integer_t neimode=REAL(pneimode)[0];
-  igraph_vector_t order, rank, father, pred, succ, dist;
-  igraph_vector_t *p_order=0, *p_rank=0, *p_father=0, *p_pred=0, 
-    *p_succ=0, *p_dist=0;
-  void *callback=0;
-  R_igraph_i_bfs_data_t cb_data, *p_cb_data=0;
-  
-  R_SEXP_to_igraph(graph, &g);
-  if (!isNull(proots)) {
-    R_SEXP_to_vector(proots, &roots);
-  }
-  if (!isNull(prestricted)) {
-    R_SEXP_to_vector(prestricted, &restricted);
-  }
-
-  if (LOGICAL(porder)[0]) { 
-    igraph_vector_init(&order, 0); p_order=&order;
-  }
-  if (LOGICAL(prank)[0]) { 
-    igraph_vector_init(&rank, 0); p_rank=&rank;
-  }
-  if (LOGICAL(pfather)[0]) { 
-    igraph_vector_init(&father, 0); p_father=&father;
-  }
-  if (LOGICAL(ppred)[0]) { 
-    igraph_vector_init(&pred, 0); p_pred=&pred;
-  }
-  if (LOGICAL(psucc)[0]) { 
-    igraph_vector_init(&succ, 0); p_succ=&succ;
-  }
-  if (LOGICAL(pdist)[0]) { 
-    igraph_vector_init(&dist, 0); p_dist=&dist;
-  }
-
-  if (!isNull(pcallback)) {
-    cb_data.graph=graph;
-    cb_data.fun=pcallback;
-    cb_data.extra=pextra;
-    cb_data.rho=prho;
-    callback=R_igraph_bfshandler;
-    p_cb_data = &cb_data;
-  }
-
-  igraph_bfs(&g, root, isNull(proots) ? 0 : &roots, neimode, 
-	     unreachable, isNull(prestricted) ? 0 : &restricted,
-	     p_order, p_rank, p_father, p_pred, p_succ, p_dist, 
-	     (igraph_bfshandler_t*) callback, p_cb_data);
-
-  PROTECT(result=NEW_LIST(8));
-  PROTECT(names=NEW_CHARACTER(8));
-
-  SET_STRING_ELT(names, 0, mkChar("root"));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1));
-  REAL(VECTOR_ELT(result, 0))[0] = root+1;
-
-  SET_STRING_ELT(names, 1, mkChar("neimode"));
-  SET_VECTOR_ELT(result, 1, NEW_CHARACTER(1));
-  if (neimode==1) { 
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("out"));
-  } else if (neimode==2) {
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("in"));
-  } else {
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("all"));
-  }
-  
-  SET_STRING_ELT(names, 2, mkChar("order"));
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(p_order));
-  SET_STRING_ELT(names, 3, mkChar("rank"));
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(p_rank));
-  SET_STRING_ELT(names, 4, mkChar("father"));
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(p_father));
-  SET_STRING_ELT(names, 5, mkChar("pred"));
-  SET_VECTOR_ELT(result, 5, R_igraph_0orvector_to_SEXP(p_pred));
-  SET_STRING_ELT(names, 6, mkChar("succ"));
-  SET_VECTOR_ELT(result, 6, R_igraph_0orvector_to_SEXP(p_succ));
-  SET_STRING_ELT(names, 7, mkChar("dist"));
-  SET_VECTOR_ELT(result, 7, R_igraph_0orvector_to_SEXP(p_dist));
-
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-typedef struct {
-  SEXP graph, fun_in, fun_out, extra, rho;
-} R_igraph_i_dfs_data_t;
-
-igraph_bool_t R_igraph_dfshandler(const igraph_t *graph,
-				  igraph_integer_t vid,
-				  igraph_integer_t dist,
-				  void *extra,
-				  int which) {
-  
-  R_igraph_i_dfs_data_t *data=extra;
-  SEXP args, R_fcall, result, names;
-  igraph_bool_t cres;
-
-  PROTECT(args=NEW_NUMERIC(2));
-  PROTECT(names=NEW_CHARACTER(2));
-
-  SET_STRING_ELT(names, 0, mkChar("vid"));
-  SET_STRING_ELT(names, 1, mkChar("dist"));
-  REAL(args)[0]=vid;
-  REAL(args)[1]=dist;
-  SET_NAMES(args, names);
-
-  PROTECT(R_fcall = lang4(which==0 ? data->fun_in : data->fun_out, 
-			  data->graph, args, data->extra));
-  PROTECT(result = eval(R_fcall, data->rho));
-  
-  cres=LOGICAL(result)[0];
-
-  UNPROTECT(4);
-  return cres;
-}
-
-igraph_bool_t R_igraph_dfshandler_in(const igraph_t *graph,
-				     igraph_integer_t vid,
-				     igraph_integer_t dist,
-				     void *extra) {
-
-  return R_igraph_dfshandler(graph, vid, dist, extra, 0);
-}
-
-
-igraph_bool_t R_igraph_dfshandler_out(const igraph_t *graph,
-				      igraph_integer_t vid,
-				      igraph_integer_t dist,
-				      void *extra) {
-
-  return R_igraph_dfshandler(graph, vid, dist, extra, 1);
-}
-
-SEXP R_igraph_dfs(SEXP graph, SEXP proot, SEXP pneimode, SEXP punreachable,
-		  SEXP porder, SEXP porder_out, SEXP pfather, SEXP pdist, 
-		  SEXP pin_callback, SEXP pout_callback, 
-		  SEXP pextra, SEXP prho) {
-  
-  igraph_t g;
-  SEXP result, names;
-
-  igraph_integer_t root=REAL(proot)[0];
-  igraph_integer_t neimode=REAL(pneimode)[0];
-  igraph_bool_t unreachable=LOGICAL(punreachable)[0];
-  igraph_vector_t order, order_out, father, dist;
-  igraph_vector_t *p_order=0, *p_order_out=0, *p_father=0, *p_dist=0;
-  void *in_callback=0, *out_callback=0;
-  R_igraph_i_dfs_data_t cb_data, *p_cb_data=0;
-  
-  R_SEXP_to_igraph(graph, &g);
-
-  if (LOGICAL(porder)[0]) { 
-    igraph_vector_init(&order, 0); p_order=&order;
-  }
-  if (LOGICAL(porder_out)[0]) { 
-    igraph_vector_init(&order_out, 0); p_order_out=&order_out;
-  }
-  if (LOGICAL(pfather)[0]) { 
-    igraph_vector_init(&father, 0); p_father=&father;
-  }
-  if (LOGICAL(pdist)[0]) { 
-    igraph_vector_init(&dist, 0); p_dist=&dist;
-  }
-
-  if (!isNull(pin_callback) || !isNull(pout_callback)) {
-    cb_data.graph=graph;
-    cb_data.fun_in=pin_callback;
-    cb_data.fun_out=pout_callback;
-    cb_data.extra=pextra;
-    cb_data.rho=prho;
-    p_cb_data = &cb_data;
-  }
-  if (!isNull(pin_callback)) {
-    in_callback=R_igraph_dfshandler_in;
-  }
-  if (!isNull(pout_callback)) {
-    out_callback=R_igraph_dfshandler_out;
-  }
-
-  igraph_dfs(&g, root, neimode, unreachable,
-	     p_order, p_order_out, p_father, p_dist, 
-	     (igraph_dfshandler_t*) in_callback, 
-	     (igraph_dfshandler_t*) out_callback, p_cb_data);
-
-  PROTECT(result=NEW_LIST(6));
-  PROTECT(names=NEW_CHARACTER(6));
-
-  SET_STRING_ELT(names, 0, mkChar("root"));
-  SET_VECTOR_ELT(result, 0, NEW_NUMERIC(1));
-  REAL(VECTOR_ELT(result, 0))[0] = root;
-
-  SET_STRING_ELT(names, 1, mkChar("neimode"));
-  SET_VECTOR_ELT(result, 1, NEW_CHARACTER(1));
-  if (neimode==1) { 
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("out"));
-  } else if (neimode==2) {
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("in"));
-  } else {
-    SET_STRING_ELT(VECTOR_ELT(result, 1), 0, mkChar("all"));
-  }
-  
-  SET_STRING_ELT(names, 2, mkChar("order"));
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(p_order));
-  SET_STRING_ELT(names, 3, mkChar("order.out"));
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(p_order_out));
-  SET_STRING_ELT(names, 4, mkChar("father"));
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(p_father));
-  SET_STRING_ELT(names, 5, mkChar("dist"));
-  SET_VECTOR_ELT(result, 5, R_igraph_0orvector_to_SEXP(p_dist));
-
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-
-SEXP R_igraph_cohesive_blocks(SEXP graph) {
-  igraph_vector_ptr_t c_blocks;
-  igraph_vector_t c_cohesion;
-  igraph_vector_t c_parent;
-  igraph_t c_blockTree;
-  int c_result;
-  igraph_t c_graph;
-  SEXP blocks;
-  SEXP cohesion;
-  SEXP parent;
-  SEXP blockTree;
-  SEXP result;
-  SEXP names;
-
-  R_SEXP_to_igraph(graph, &c_graph);
-  if (0 != igraph_vector_ptr_init(&c_blocks, 0)) { 
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-  } 
-  IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &c_blocks);
-  if (0 != igraph_vector_init(&c_cohesion, 0)) { 
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-  } 
-  IGRAPH_FINALLY(igraph_vector_destroy, &c_cohesion);
-  if (0 != igraph_vector_init(&c_parent, 0)) { 
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-  } 
-  IGRAPH_FINALLY(igraph_vector_destroy, &c_parent);
-
-  c_result=igraph_cohesive_blocks(&c_graph, &c_blocks, &c_cohesion, &c_parent, &c_blockTree);
-
-  PROTECT(result=NEW_LIST(4));
-  PROTECT(names=NEW_CHARACTER(4));
-  PROTECT(blocks=R_igraph_vectorlist_to_SEXP_p1(&c_blocks)); 
-  R_igraph_vectorlist_destroy(&c_blocks); 
-  IGRAPH_FINALLY_CLEAN(1);
-  PROTECT(cohesion=R_igraph_vector_to_SEXP(&c_cohesion)); 
-  igraph_vector_destroy(&c_cohesion); 
-  IGRAPH_FINALLY_CLEAN(1);
-  PROTECT(parent=R_igraph_vector_to_SEXPp1(&c_parent)); 
-  igraph_vector_destroy(&c_parent); 
-  IGRAPH_FINALLY_CLEAN(1);
-  IGRAPH_FINALLY(igraph_destroy, &c_blockTree); 
-  PROTECT(blockTree=R_igraph_to_SEXP(&c_blockTree));  
-  igraph_destroy(&c_blockTree); 
-  IGRAPH_FINALLY_CLEAN(1);
-  SET_VECTOR_ELT(result, 0, blocks);
-  SET_VECTOR_ELT(result, 1, cohesion);
-  SET_VECTOR_ELT(result, 2, parent);
-  SET_VECTOR_ELT(result, 3, blockTree);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("blocks"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("cohesion"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("parent"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("blockTree"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(6);
-  return result;
-}
-
-SEXP R_igraph_i_levc_arp(SEXP extP, SEXP extE, SEXP pv) {
-  igraph_arpack_function_t *fun=R_ExternalPtrAddr(extP);
-  void *extra=R_ExternalPtrAddr(extE);
-  SEXP res;
-  
-  PROTECT(res=NEW_NUMERIC(GET_LENGTH(pv)));
-  fun(REAL(res), REAL(pv), GET_LENGTH(pv), extra);
-  
-  UNPROTECT(1);
-  return res;
-}
-
-typedef struct R_igraph_i_levc_data_t {
-  SEXP fun;
-  SEXP extra;
-  SEXP rho;
-  SEXP rho2;
-} R_igraph_i_levc_data_t;
-
-int R_igraph_i_levc_callback(const igraph_vector_t *membership,
-		     long int comm,
-		     igraph_real_t eigenvalue,
-		     const igraph_vector_t *eigenvector,
-		     igraph_arpack_function_t *arpack_multiplier,
-		     void *arpack_extra,
-		     void *extra) {
-
-  SEXP s_memb, s_comm, s_evalue, s_evector, s_multip;
-  SEXP R_fcall, R_multip_call;
-  SEXP res;
-  int result;
-  R_igraph_i_levc_data_t *data=extra;
-
-  PROTECT(s_memb=R_igraph_vector_to_SEXP(membership));
-  PROTECT(s_comm=NEW_NUMERIC(1)); REAL(s_comm)[0]=comm;
-  PROTECT(s_evalue=NEW_NUMERIC(1)); REAL(s_evalue)[0]=eigenvalue;
-  PROTECT(s_evector=R_igraph_vector_to_SEXP(eigenvector));
-  PROTECT(R_multip_call =
-	  lang3(install("igraph.i.levc.arp"), 
-		R_MakeExternalPtr(arpack_multiplier, R_NilValue, R_NilValue),
-		R_MakeExternalPtr(arpack_extra, R_NilValue, R_NilValue)));
-  PROTECT(s_multip = eval(R_multip_call, data->rho2));
-
-  PROTECT(R_fcall = R_igraph_i_lang7(data->fun, s_memb, s_comm, 
-				     s_evalue, s_evector, s_multip, 
-				     data->extra));
-  PROTECT(res = eval(R_fcall, data->rho));
-  
-  result=REAL(AS_NUMERIC(res))[0];
-	  
-  UNPROTECT(8);
-  return result;
-}
-
-SEXP R_igraph_community_leading_eigenvector(SEXP graph, SEXP steps, 
-					    SEXP options, SEXP pstart, 
-					    SEXP callback, 
-					    SEXP callback_extra,
-					    SEXP callback_env,
-					    SEXP callback_env2) {
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_matrix_t c_merges;
-  igraph_vector_t c_membership;
-  igraph_integer_t c_steps;
-  igraph_bool_t c_start=!isNull(pstart);
-  igraph_arpack_options_t c_options;
-  igraph_real_t c_modularity;
-  igraph_vector_t c_eigenvalues;
-  igraph_vector_ptr_t c_eigenvectors;
-  igraph_vector_t c_history;
-  SEXP merges;
-  SEXP membership;
-  SEXP modularity;
-  SEXP eigenvalues;
-  SEXP eigenvectors;
-  SEXP history;
-  int c_result;
-  SEXP result, names;
-
-  R_igraph_i_levc_data_t callback_data = { callback, callback_extra, 
-					   callback_env, callback_env2 };
-
-                                        /* Convert input */
-  R_SEXP_to_igraph(graph, &c_graph);
-  if (0 != igraph_matrix_init(&c_merges, 0, 0)) { 
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-  } 
-  IGRAPH_FINALLY(igraph_matrix_destroy, &c_merges);
-  if (c_start) {
-    R_SEXP_to_vector_copy(pstart, &c_membership);
-  } else {
-    if (0 != igraph_vector_init(&c_membership, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    }
-  }
-  IGRAPH_FINALLY(igraph_vector_destroy, &c_membership);
-  c_steps=INTEGER(steps)[0];
-  R_SEXP_to_igraph_arpack_options(options, &c_options);
-  if (0 != igraph_vector_init(&c_eigenvalues, 0)) {
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM);
-  }
-  if (0 != igraph_vector_ptr_init(&c_eigenvectors, 0)) {
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM);
-  }
-  if (0 != igraph_vector_init(&c_history, 0)) {
-  igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM);
-  }
-                                        /* Call igraph */
-  c_result=igraph_community_leading_eigenvector(&c_graph, &c_merges, 
-						&c_membership, c_steps, 
-						&c_options, &c_modularity, 
-						c_start, &c_eigenvalues,
-						&c_eigenvectors,
-						&c_history, 
-						isNull(callback) ? 0 : 
-						R_igraph_i_levc_callback,
-						&callback_data);
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(7));
-  PROTECT(names=NEW_CHARACTER(7));
-  PROTECT(merges=R_igraph_matrix_to_SEXP(&c_merges)); 
-  igraph_matrix_destroy(&c_merges); 
-  IGRAPH_FINALLY_CLEAN(1);
-  PROTECT(membership=R_igraph_vector_to_SEXP(&c_membership)); 
-  igraph_vector_destroy(&c_membership); 
-  IGRAPH_FINALLY_CLEAN(1);
-  PROTECT(options=R_igraph_arpack_options_to_SEXP(&c_options));
-  PROTECT(modularity=NEW_NUMERIC(1)); 
-  REAL(modularity)[0]=c_modularity;
-  PROTECT(eigenvalues=R_igraph_vector_to_SEXP(&c_eigenvalues));
-  igraph_vector_destroy(&c_eigenvalues);
-  PROTECT(eigenvectors=R_igraph_vectorlist_to_SEXP(&c_eigenvectors));
-  R_igraph_vectorlist_destroy(&c_eigenvectors);
-  PROTECT(history=R_igraph_vector_to_SEXP(&c_history));
-  igraph_vector_destroy(&c_history);
-  SET_VECTOR_ELT(result, 0, merges);
-  SET_VECTOR_ELT(result, 1, membership);
-  SET_VECTOR_ELT(result, 2, options);
-  SET_VECTOR_ELT(result, 3, modularity);
-  SET_VECTOR_ELT(result, 4, eigenvalues);
-  SET_VECTOR_ELT(result, 5, eigenvectors);
-  SET_VECTOR_ELT(result, 6, history);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("merges"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("membership"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("options"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("modularity"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("eigenvalues"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("eigenvectors"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("history"));
-  SET_NAMES(result, names);
-
-  UNPROTECT(8);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_get_eids(SEXP graph, SEXP pvp, SEXP pdirected,
-		       SEXP perror, SEXP pmulti) {
-  igraph_t g;
-  igraph_vector_t vp;
-  igraph_vector_t res;
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  igraph_bool_t error=LOGICAL(perror)[0];
-  igraph_bool_t multi=LOGICAL(pmulti)[0];
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pvp, &vp);
-  igraph_vector_init(&res, 0);
-  
-  if (multi) {
-    igraph_get_eids_multi(&g, &res, /*pairs=*/ &vp, /*path=*/ 0, directed, 
-			  error);
-  } else {
-    igraph_get_eids(&g, &res, /*pairs=*/ &vp, /*path=*/ 0, directed, error);
-  }
-  
-  PROTECT(result=R_igraph_vector_to_SEXP(&res));
-  igraph_vector_destroy(&res);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_scg_semiprojectors(SEXP groups, SEXP matrix_type, SEXP p, 
-				 SEXP norm, SEXP psparse) {
-                                        /* Declarations */
-  igraph_vector_t c_groups;
-  igraph_integer_t c_matrix_type;
-  igraph_matrix_t c_L;
-  igraph_matrix_t c_R;
-  igraph_sparsemat_t c_Lsparse;
-  igraph_sparsemat_t c_Rsparse;
-  igraph_vector_t c_p;
-  igraph_integer_t c_norm;
-  SEXP L;
-  SEXP R;
-  SEXP Lsparse;
-  SEXP Rsparse;
-  igraph_bool_t sparse=LOGICAL(psparse)[0];
-  int c_result;
-  SEXP result, names;
-                                        /* Convert input */
-  R_SEXP_to_vector(groups, &c_groups);
-  c_matrix_type=REAL(matrix_type)[0];
-  if (!sparse) {
-    if (0 != igraph_matrix_init(&c_L, 0, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-    IGRAPH_FINALLY(igraph_matrix_destroy, &c_L); 
-    if (0 != igraph_matrix_init(&c_R, 0, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-    IGRAPH_FINALLY(igraph_matrix_destroy, &c_R); 
-  } else {
-    if (0 != igraph_sparsemat_init(&c_Lsparse, 1, 1, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-    IGRAPH_FINALLY(igraph_sparsemat_destroy, &c_Lsparse); 
-    if (0 != igraph_sparsemat_init(&c_Rsparse, 1, 1, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-    IGRAPH_FINALLY(igraph_sparsemat_destroy, &c_Rsparse); 
-  }
-  if (!isNull(p)) { R_SEXP_to_vector(p, &c_p); }
-  c_norm=REAL(norm)[0];
-                                        /* Call igraph */
-  c_result=igraph_scg_semiprojectors(&c_groups, c_matrix_type, 
-				     (sparse ? 0 : &c_L), (sparse ? 0 : &c_R),
-				     (sparse ? &c_Lsparse : 0), 
-				     (sparse ? &c_Rsparse : 0), 
-				     (isNull(p) ? 0 : &c_p), c_norm);
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(2));
-  PROTECT(names=NEW_CHARACTER(2));
-  if (!sparse) { 
-    PROTECT(L=R_igraph_0ormatrix_to_SEXP(&c_L)); 
-    igraph_matrix_destroy(&c_L); 
-    IGRAPH_FINALLY_CLEAN(1);
-    PROTECT(R=R_igraph_0ormatrix_to_SEXP(&c_R)); 
-    igraph_matrix_destroy(&c_R); 
-    IGRAPH_FINALLY_CLEAN(1);
-    SET_VECTOR_ELT(result, 0, L);
-    SET_VECTOR_ELT(result, 1, R);
-  } else {
-    PROTECT(Lsparse=R_igraph_0orsparsemat_to_SEXP(&c_Lsparse)); 
-    igraph_sparsemat_destroy(&c_Lsparse); 
-    IGRAPH_FINALLY_CLEAN(1);
-    PROTECT(Rsparse=R_igraph_0orsparsemat_to_SEXP(&c_Rsparse)); 
-    igraph_sparsemat_destroy(&c_Rsparse); 
-    IGRAPH_FINALLY_CLEAN(1);
-    SET_VECTOR_ELT(result, 0, Lsparse);
-    SET_VECTOR_ELT(result, 1, Rsparse);
-  }
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("L"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("R"));
-  SET_NAMES(result, names);
-  UNPROTECT(3);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_laplacian(SEXP graph, SEXP normalized, SEXP weights,
-			SEXP psparse) {
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_matrix_t c_res;
-  igraph_sparsemat_t c_sparseres;
-  igraph_bool_t c_normalized;
-  igraph_vector_t c_weights;
-  igraph_bool_t c_sparse=LOGICAL(psparse)[0];
-  SEXP result;
-  int c_result;
-                                        /* Convert input */
-  R_SEXP_to_igraph(graph, &c_graph);
-  if (!c_sparse) {
-    if (0 != igraph_matrix_init(&c_res, 0, 0)) { 
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); 
-    } 
-    IGRAPH_FINALLY(igraph_matrix_destroy, &c_res); 
-  }
-  if (c_sparse) {
-    if (0 != igraph_sparsemat_init(&c_sparseres, 0, 0, 0)) {
-      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM);
-    }
-    IGRAPH_FINALLY(igraph_sparsemat_destroy, &c_sparseres);
-  }
-  c_normalized=LOGICAL(normalized)[0];
-  if (!isNull(weights)) { R_SEXP_to_vector(weights, &c_weights); }
-                                        /* Call igraph */
-  c_result=igraph_laplacian(&c_graph, (c_sparse ? 0 : &c_res), 
-			    (c_sparse ? &c_sparseres : 0),
-			    c_normalized, (isNull(weights) ? 0 : &c_weights));
-
-                                        /* Convert output */
-  if (!c_sparse) {
-    PROTECT(result=R_igraph_matrix_to_SEXP(&c_res)); 
-    igraph_matrix_destroy(&c_res); 
-    IGRAPH_FINALLY_CLEAN(1);
-  } else {
-    PROTECT(result=R_igraph_sparsemat_to_SEXP(&c_sparseres));
-    igraph_sparsemat_destroy(&c_sparseres);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_scg_adjacency(SEXP graph, SEXP matrix, SEXP sparsmat, SEXP ev,
-			    SEXP intervals_vector, 
-			    SEXP algorithm, SEXP evec,
-			    SEXP groups, SEXP use_arpack, SEXP maxiter, 
-			    SEXP sparse, SEXP output, SEXP semproj, 
-			    SEXP epairs) {
-
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_matrix_t c_matrix;
-  igraph_sparsemat_t c_sparsmat;
-  igraph_vector_t c_ev;
-  igraph_vector_t c_intervals_vector;
-  igraph_integer_t c_algorithm=REAL(algorithm)[0];
-  igraph_vector_t c_eval;
-  igraph_matrix_t c_evec;
-  igraph_vector_t c_groups;
-  igraph_bool_t c_use_arpack=LOGICAL(use_arpack)[0];
-  igraph_integer_t c_maxiter=INTEGER(maxiter)[0];
-  igraph_bool_t c_sparse=LOGICAL(sparse)[0];
-  igraph_real_t c_output=REAL(output)[0];
-  igraph_bool_t c_semproj=LOGICAL(semproj)[0];
-  igraph_bool_t c_epairs=LOGICAL(epairs)[0];
-  igraph_t c_scg_graph;
-  igraph_matrix_t c_scg_matrix;
-  igraph_sparsemat_t c_scg_sparsemat;
-  igraph_matrix_t c_L;
-  igraph_matrix_t c_R;
-  igraph_sparsemat_t c_Lsparse;
-  igraph_sparsemat_t c_Rsparse;
-  SEXP scg_graph;
-  SEXP scg_matrix;
-  SEXP scg_sparsemat;
-  SEXP L;
-  SEXP R;
-  SEXP Lsparse;
-  SEXP Rsparse;
-  int c_result;
-  SEXP result, names;
-  SEXP eval;
-                                        /* What to return */
-  igraph_bool_t do_scg_graph=
-    (!isNull(graph) && c_output==1 /*default*/) || c_output==3 /*graph*/;
-  igraph_bool_t do_scg_matrix=!c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_scg_sparsemat=c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_L=c_semproj && !c_sparse;
-  igraph_bool_t do_R=c_semproj && !c_sparse;
-  igraph_bool_t do_Lsparse=c_semproj && c_sparse;
-  igraph_bool_t do_Rsparse=c_semproj && c_sparse;
-  igraph_bool_t do_eval=c_epairs;
-  igraph_bool_t do_evec=c_epairs;
-
-                                        /* Convert input */
-  if (!isNull(graph)) { R_SEXP_to_igraph(graph, &c_graph); }
-  if (!isNull(matrix)) { R_SEXP_to_matrix(matrix, &c_matrix); }
-  if (!isNull(sparsmat)) { R_SEXP_to_sparsemat(sparsmat, &c_sparsmat); }
-
-  R_SEXP_to_vector(ev, &c_ev);
-  R_SEXP_to_vector(intervals_vector, &c_intervals_vector); 
-
-  if (do_eval) { igraph_vector_init(&c_eval, 0); }
-  if (!isNull(evec)) { 
-    R_SEXP_to_igraph_matrix_copy(evec, &c_evec);
-  } else if (do_evec) { 
-    igraph_matrix_init(&c_evec, 0, 0);
-  } 
-  if (!isNull(groups)) { 
-    R_SEXP_to_vector_copy(groups, &c_groups);
-  } else { 
-    igraph_vector_init(&c_groups, 0);
-  } 
-
-  if (do_scg_matrix) { igraph_matrix_init(&c_scg_matrix, 0, 0); }
-  if (do_L) { igraph_matrix_init(&c_L, 0, 0); }
-  if (do_R) { igraph_matrix_init(&c_R, 0, 0); }
-
-  if (do_scg_sparsemat) { igraph_sparsemat_init(&c_scg_sparsemat, 0, 0, 0); }
-  if (do_Lsparse) { igraph_sparsemat_init(&c_Lsparse, 0, 0, 0); }
-  if (do_Rsparse) { igraph_sparsemat_init(&c_Rsparse, 0, 0, 0); }
-
-                                        /* Call igraph */
-  c_result=igraph_scg_adjacency((isNull(graph) ? 0 : &c_graph), 
-				(isNull(matrix) ? 0 : &c_matrix), 
-				(isNull(sparsmat) ? 0 : &c_sparsmat), &c_ev, 
-				/*intervals=*/ 0, &c_intervals_vector, 
-				c_algorithm, (do_eval ? &c_eval : 0),
-				(!isNull(evec) || do_evec ? &c_evec : 0),
-				&c_groups, c_use_arpack, c_maxiter, 
-				(do_scg_graph ? &c_scg_graph : 0), 
-				(do_scg_matrix ? &c_scg_matrix : 0),
-				(do_scg_sparsemat ? &c_scg_sparsemat : 0),
-				(do_L ? &c_L : 0), (do_R ? &c_R : 0),
-				(do_Lsparse ? &c_Lsparse : 0),
-				(do_Rsparse ? &c_Rsparse : 0));
-
-  if (!isNull(sparsmat)) { igraph_free(c_sparsmat.cs); }
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(6));
-  PROTECT(names=NEW_CHARACTER(6));
-
-  if (do_eval) { 
-    PROTECT(eval=R_igraph_vector_to_SEXP(&c_eval));
-    igraph_vector_destroy(&c_eval); 
-  } else { 
-    PROTECT(eval=R_NilValue);
-  }
-  
-  if (do_evec) {
-    PROTECT(evec=R_igraph_matrix_to_SEXP(&c_evec)); 
-    igraph_matrix_destroy(&c_evec); 
-  } else {
-    PROTECT(evec=R_NilValue);
-  }
-  
-  PROTECT(groups=R_igraph_vector_to_SEXPp1(&c_groups)); 
-  igraph_vector_destroy(&c_groups); 
-
-  if (do_scg_graph) {
-    PROTECT(scg_graph=R_igraph_to_SEXP(&c_scg_graph));  
-    igraph_destroy(&c_scg_graph); 
-  } else {
-    PROTECT(scg_graph=R_NilValue);
-  }
-  if (do_scg_matrix) {
-    PROTECT(scg_matrix=R_igraph_matrix_to_SEXP(&c_scg_matrix)); 
-    igraph_matrix_destroy(&c_scg_matrix); 
-  } else {
-    PROTECT(scg_matrix=R_NilValue);
-  }
-  if (do_scg_sparsemat) { 
-    PROTECT(scg_sparsemat=R_igraph_sparsemat_to_SEXP(&c_scg_sparsemat)); 
-    igraph_sparsemat_destroy(&c_scg_sparsemat);
-  } else {
-    PROTECT(scg_sparsemat=R_NilValue);
-  }
-  if (do_L) {
-    PROTECT(L=R_igraph_matrix_to_SEXP(&c_L)); 
-    igraph_matrix_destroy(&c_L); 
-  } else {
-    PROTECT(L=R_NilValue);
-  }
-  if (do_R) {
-    PROTECT(R=R_igraph_matrix_to_SEXP(&c_R)); 
-    igraph_matrix_destroy(&c_R); 
-  } else {
-    PROTECT(R=R_NilValue);
-  }
-  if (do_Lsparse) {
-    PROTECT(Lsparse=R_igraph_sparsemat_to_SEXP(&c_Lsparse)); 
-    igraph_sparsemat_destroy(&c_Lsparse);
-  } else {
-    PROTECT(Lsparse=R_NilValue);
-  }
-  if (do_Rsparse) {    
-    PROTECT(Rsparse=R_igraph_sparsemat_to_SEXP(&c_Rsparse)); 
-    igraph_sparsemat_destroy(&c_Rsparse);
-  } else {
-    PROTECT(Rsparse=R_NilValue);
-  }
-
-  if (do_scg_graph) { SET_VECTOR_ELT(result, 0, scg_graph); }
-  if (do_scg_matrix) { SET_VECTOR_ELT(result, 0, scg_matrix); }
-  if (do_scg_sparsemat) { SET_VECTOR_ELT(result, 0, scg_sparsemat); }
-  SET_VECTOR_ELT(result, 1, groups);
-  if (do_L) { SET_VECTOR_ELT(result, 2, L); }
-  if (do_Lsparse) { SET_VECTOR_ELT(result, 2, Lsparse); }
-  if (do_R) { SET_VECTOR_ELT(result, 3, R); }
-  if (do_Rsparse) { SET_VECTOR_ELT(result, 3, Rsparse); }
-  SET_VECTOR_ELT(result, 4, eval);
-  SET_VECTOR_ELT(result, 5, evec);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("Xt"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("groups"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("L"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("R"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("values"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("vectors"));
-  SET_NAMES(result, names);
-  UNPROTECT(11);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_scg_stochastic(SEXP graph, SEXP matrix, SEXP sparsmat, SEXP ev,
-			     SEXP intervals_vector, SEXP algorithm, SEXP norm,
-			     SEXP evec, SEXP groups, SEXP p, SEXP use_arpack,
-			     SEXP maxiter, SEXP sparse, SEXP output, 
-			     SEXP semproj, SEXP epairs, SEXP stat_prob) {
-
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_matrix_t c_matrix;
-  igraph_sparsemat_t c_sparsmat;
-  igraph_vector_t c_ev;
-  igraph_vector_t c_intervals_vector;
-  igraph_integer_t c_algorithm=REAL(algorithm)[0];
-  igraph_integer_t c_norm=REAL(norm)[0];
-  igraph_vector_complex_t c_eval;
-  igraph_matrix_complex_t c_evec;
-  igraph_vector_t c_groups;
-  igraph_vector_t c_p;
-  igraph_bool_t c_use_arpack=LOGICAL(use_arpack)[0];
-  igraph_integer_t c_maxiter=INTEGER(maxiter)[0];
-  igraph_bool_t c_sparse=LOGICAL(sparse)[0];
-  igraph_real_t c_output=REAL(output)[0];
-  igraph_bool_t c_semproj=LOGICAL(semproj)[0];
-  igraph_bool_t c_epairs=LOGICAL(epairs)[0];
-  igraph_bool_t c_stat_prob=LOGICAL(stat_prob)[0];
-  igraph_t c_scg_graph;
-  igraph_matrix_t c_scg_matrix;
-  igraph_sparsemat_t c_scg_sparsemat;
-  igraph_matrix_t c_L;
-  igraph_matrix_t c_R;
-  igraph_sparsemat_t c_Lsparse;
-  igraph_sparsemat_t c_Rsparse;
-  SEXP scg_graph;
-  SEXP scg_matrix;
-  SEXP scg_sparsemat;
-  SEXP L;
-  SEXP R;
-  SEXP Lsparse;
-  SEXP Rsparse;
-  int c_result;
-  SEXP result, names;
-  SEXP eval;
-                                        /* What to return */
-  igraph_bool_t do_scg_graph=
-    (!isNull(graph) && c_output==1 /*default*/) || c_output==3 /*graph*/;
-  igraph_bool_t do_scg_matrix=!c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_scg_sparsemat=c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_L=c_semproj && !c_sparse;
-  igraph_bool_t do_R=c_semproj && !c_sparse;
-  igraph_bool_t do_Lsparse=c_semproj && c_sparse;
-  igraph_bool_t do_Rsparse=c_semproj && c_sparse;
-  igraph_bool_t do_eval=c_epairs;
-  igraph_bool_t do_evec=c_epairs;
-  igraph_bool_t do_p=c_stat_prob;
-
-                                        /* Convert input */
-  if (!isNull(graph)) { R_SEXP_to_igraph(graph, &c_graph); }
-  if (!isNull(matrix)) { R_SEXP_to_matrix(matrix, &c_matrix); }
-  if (!isNull(sparsmat)) { R_SEXP_to_sparsemat(sparsmat, &c_sparsmat); }
-
-  R_SEXP_to_vector(ev, &c_ev);
-  R_SEXP_to_vector(intervals_vector, &c_intervals_vector);
-  if (do_eval) { igraph_vector_complex_init(&c_eval, 0); }
-  if (!isNull(evec)) { 
-    R_SEXP_to_matrix_complex_copy(evec, &c_evec);
-  } else if (do_evec) { 
-    igraph_matrix_complex_init(&c_evec, 0, 0);
-  } 
-  if (!isNull(groups)) { 
-    R_SEXP_to_vector_copy(groups, &c_groups);
-  } else { 
-    igraph_vector_init(&c_groups, 0);
-  } 
-
-  if (!isNull(p)) { 
-    R_SEXP_to_vector_copy(p, &c_p);
-  } else if (do_p) { 
-    igraph_vector_init(&c_p, 0);
-  } 
-
-  if (do_scg_matrix) { igraph_matrix_init(&c_scg_matrix, 0, 0); }
-  if (do_L) { igraph_matrix_init(&c_L, 0, 0); }
-  if (do_R) { igraph_matrix_init(&c_R, 0, 0); }
-
-                                        /* Call igraph */
-  c_result=igraph_scg_stochastic((isNull(graph) ? 0 : &c_graph), 
-				 (isNull(matrix) ? 0 : &c_matrix),
-				 (isNull(sparsmat) ? 0 : &c_sparsmat), &c_ev,
-				 /*intervals=*/ 0, &c_intervals_vector,
-				 c_algorithm, c_norm, 
-				 (do_eval ? &c_eval : 0),
-				 (!isNull(evec) || do_evec ? &c_evec : 0), 
-				 &c_groups, (!isNull(p) || do_p ? &c_p : 0), 
-				 c_use_arpack, c_maxiter, 
-				 (do_scg_graph ? &c_scg_graph : 0),
-				 (do_scg_matrix ? &c_scg_matrix : 0),
-				 (do_scg_sparsemat ? &c_scg_sparsemat : 0),
-				 (do_L ? &c_L : 0), (do_R ? &c_R : 0),
-				 (do_Lsparse ? &c_Lsparse : 0),
-				 (do_Rsparse ? &c_Rsparse : 0));
-
-  if (!isNull(sparsmat)) { igraph_free(c_sparsmat.cs); }
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(7));
-  PROTECT(names=NEW_CHARACTER(7));
-
-  if (do_eval) { 
-    PROTECT(eval=R_igraph_vector_complex_to_SEXP(&c_eval));
-    igraph_vector_complex_destroy(&c_eval); 
-  } else { 
-    PROTECT(eval=R_NilValue);
-  }
-  
-  if (do_evec) {
-    PROTECT(evec=R_igraph_matrix_complex_to_SEXP(&c_evec)); 
-    igraph_matrix_complex_destroy(&c_evec); 
-  } else {
-    PROTECT(evec=R_NilValue);
-  }
-
-  if (do_p) { 
-    PROTECT(p=R_igraph_vector_to_SEXP(&c_p));
-    igraph_vector_destroy(&c_p);
-  } else {
-    PROTECT(p=R_NilValue);
-  }
-  
-  PROTECT(groups=R_igraph_vector_to_SEXPp1(&c_groups)); 
-  igraph_vector_destroy(&c_groups); 
-
-  if (do_scg_graph) {
-    PROTECT(scg_graph=R_igraph_to_SEXP(&c_scg_graph));  
-    igraph_destroy(&c_scg_graph); 
-  } else {
-    PROTECT(scg_graph=R_NilValue);
-  }
-  if (do_scg_matrix) {
-    PROTECT(scg_matrix=R_igraph_matrix_to_SEXP(&c_scg_matrix)); 
-    igraph_matrix_destroy(&c_scg_matrix); 
-  } else {
-    PROTECT(scg_matrix=R_NilValue);
-  }
-  if (do_scg_sparsemat) { 
-    PROTECT(scg_sparsemat=R_igraph_sparsemat_to_SEXP(&c_scg_sparsemat)); 
-    igraph_sparsemat_destroy(&c_scg_sparsemat);
-  } else {
-    PROTECT(scg_sparsemat=R_NilValue);
-  }
-  if (do_L) {
-    PROTECT(L=R_igraph_matrix_to_SEXP(&c_L)); 
-    igraph_matrix_destroy(&c_L); 
-  } else {
-    PROTECT(L=R_NilValue);
-  }
-  if (do_R) {
-    PROTECT(R=R_igraph_matrix_to_SEXP(&c_R)); 
-    igraph_matrix_destroy(&c_R); 
-  } else {
-    PROTECT(R=R_NilValue);
-  }
-  if (do_Lsparse) {
-    PROTECT(Lsparse=R_igraph_sparsemat_to_SEXP(&c_Lsparse)); 
-    igraph_sparsemat_destroy(&c_Lsparse);
-  } else {
-    PROTECT(Lsparse=R_NilValue);
-  }
-  if (do_Rsparse) {    
-    PROTECT(Rsparse=R_igraph_sparsemat_to_SEXP(&c_Rsparse)); 
-    igraph_sparsemat_destroy(&c_Rsparse);
-  } else {
-    PROTECT(Rsparse=R_NilValue);
-  }
-
-  if (do_scg_graph) { SET_VECTOR_ELT(result, 0, scg_graph); }
-  if (do_scg_matrix) { SET_VECTOR_ELT(result, 0, scg_matrix); }
-  if (do_scg_sparsemat) { SET_VECTOR_ELT(result, 0, scg_sparsemat); }
-  SET_VECTOR_ELT(result, 1, groups);
-  if (do_L) { SET_VECTOR_ELT(result, 2, L); }
-  if (do_Lsparse) { SET_VECTOR_ELT(result, 2, Lsparse); }
-  if (do_R) { SET_VECTOR_ELT(result, 3, R); }
-  if (do_Rsparse) { SET_VECTOR_ELT(result, 3, Rsparse); }
-  SET_VECTOR_ELT(result, 4, eval);
-  SET_VECTOR_ELT(result, 5, evec);
-  if (do_p) { SET_VECTOR_ELT(result, 6, p); }
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("Xt"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("groups"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("L"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("R"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("values"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("vectors"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("p"));
-  SET_NAMES(result, names);
-  UNPROTECT(12);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_scg_laplacian(SEXP graph, SEXP matrix, SEXP sparsmat, SEXP ev, 
-			    SEXP intervals_vector, SEXP algorithm, SEXP norm,
-			    SEXP direction, SEXP evec, SEXP groups, 
-			    SEXP use_arpack, SEXP maxiter, SEXP sparse,
-			    SEXP output, SEXP semproj, SEXP epairs) {
-
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_matrix_t c_matrix;
-  igraph_sparsemat_t c_sparsmat;
-  igraph_vector_t c_ev;
-  igraph_vector_t c_intervals_vector;
-  igraph_integer_t c_algorithm=REAL(algorithm)[0];
-  igraph_integer_t c_norm=REAL(norm)[0];
-  igraph_integer_t c_direction=REAL(direction)[0];
-  igraph_vector_complex_t c_eval;
-  igraph_matrix_complex_t c_evec;
-  igraph_vector_t c_groups;
-  igraph_bool_t c_use_arpack=LOGICAL(use_arpack)[0];
-  igraph_integer_t c_maxiter=INTEGER(maxiter)[0];
-  igraph_bool_t c_sparse=LOGICAL(sparse)[0];
-  igraph_real_t c_output=REAL(output)[0];
-  igraph_bool_t c_semproj=LOGICAL(semproj)[0];
-  igraph_bool_t c_epairs=LOGICAL(epairs)[0];
-  igraph_t c_scg_graph;
-  igraph_matrix_t c_scg_matrix;
-  igraph_sparsemat_t c_scg_sparsemat;
-  igraph_matrix_t c_L;
-  igraph_matrix_t c_R;
-  igraph_sparsemat_t c_Lsparse;
-  igraph_sparsemat_t c_Rsparse;
-  SEXP eval;
-  SEXP scg_graph;
-  SEXP scg_matrix;
-  SEXP scg_sparsemat;
-  SEXP L;
-  SEXP R;
-  SEXP Lsparse;
-  SEXP Rsparse;
-  int c_result;
-  SEXP result, names;
-                                        /* What to return */
-  igraph_bool_t do_scg_graph=
-    (!isNull(graph) && c_output==1 /*default*/) || c_output==3 /*graph*/;
-  igraph_bool_t do_scg_matrix=!c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_scg_sparsemat=c_sparse && 
-    ((isNull(graph) && c_output==1 /*default*/) || c_output==2 /*matrix*/);
-  igraph_bool_t do_L=c_semproj && !c_sparse;
-  igraph_bool_t do_R=c_semproj && !c_sparse;
-  igraph_bool_t do_Lsparse=c_semproj && c_sparse;
-  igraph_bool_t do_Rsparse=c_semproj && c_sparse;
-  igraph_bool_t do_eval=c_epairs;
-  igraph_bool_t do_evec=c_epairs;
-
-                                        /* Convert input */
-  if (!isNull(graph)) { R_SEXP_to_igraph(graph, &c_graph); }
-  if (!isNull(matrix)) { R_SEXP_to_matrix(matrix, &c_matrix); }
-  if (!isNull(sparsmat)) { R_SEXP_to_sparsemat(sparsmat, &c_sparsmat); }
-
-  R_SEXP_to_vector(ev, &c_ev);
-  R_SEXP_to_vector(intervals_vector, &c_intervals_vector);
-
-  if (do_eval) { igraph_vector_complex_init(&c_eval, 0); }
-  if (!isNull(evec)) { 
-    R_SEXP_to_matrix_complex_copy(evec, &c_evec);
-  } else if (do_evec) { 
-    igraph_matrix_complex_init(&c_evec, 0, 0);
-  } 
-  if (!isNull(groups)) { 
-    R_SEXP_to_vector_copy(groups, &c_groups);
-  } else { 
-    igraph_vector_init(&c_groups, 0);
-  } 
-
-  if (do_scg_matrix) { igraph_matrix_init(&c_scg_matrix, 0, 0); }
-  if (do_L) { igraph_matrix_init(&c_L, 0, 0); }
-  if (do_R) { igraph_matrix_init(&c_R, 0, 0); }
-
-                                        /* Call igraph */
-  c_result=igraph_scg_laplacian((isNull(graph) ? 0 : &c_graph), 
-				(isNull(matrix) ? 0 : &c_matrix), 
-				(isNull(sparsmat) ? 0 : &c_sparsmat), &c_ev, 
-				/*intervals=*/ 0, &c_intervals_vector, 
-				c_algorithm, c_norm, c_direction, 
-				(do_eval ? &c_eval : 0), 
-				(!isNull(evec) || do_evec ? &c_evec : 0), 
-				&c_groups, c_use_arpack, c_maxiter, 
-				(do_scg_graph ? &c_scg_graph : 0),
-				(do_scg_matrix ? &c_scg_matrix : 0),
-				(do_scg_sparsemat ? &c_scg_sparsemat : 0),
-				(do_L ? &c_L : 0), (do_R ? &c_R : 0),
-				(do_Lsparse ? &c_Lsparse : 0),
-				(do_Rsparse ? &c_Rsparse : 0));
-
-  if (!isNull(sparsmat)) { igraph_free(c_sparsmat.cs); }
-
-                                        /* Convert output */
-  PROTECT(result=NEW_LIST(6));
-  PROTECT(names=NEW_CHARACTER(6));
-
-  if (do_eval) { 
-    PROTECT(eval=R_igraph_vector_complex_to_SEXP(&c_eval));
-    igraph_vector_complex_destroy(&c_eval); 
-  } else { 
-    PROTECT(eval=R_NilValue);
-  }
-  
-  if (do_evec) {
-    PROTECT(evec=R_igraph_matrix_complex_to_SEXP(&c_evec)); 
-    igraph_matrix_complex_destroy(&c_evec); 
-  } else {
-    PROTECT(evec=R_NilValue);
-  }
-  
-  PROTECT(groups=R_igraph_vector_to_SEXPp1(&c_groups)); 
-  igraph_vector_destroy(&c_groups); 
-
-  if (do_scg_graph) {
-    PROTECT(scg_graph=R_igraph_to_SEXP(&c_scg_graph));  
-    igraph_destroy(&c_scg_graph); 
-  } else {
-    PROTECT(scg_graph=R_NilValue);
-  }
-  if (do_scg_matrix) {
-    PROTECT(scg_matrix=R_igraph_matrix_to_SEXP(&c_scg_matrix)); 
-    igraph_matrix_destroy(&c_scg_matrix); 
-  } else {
-    PROTECT(scg_matrix=R_NilValue);
-  }
-  if (do_scg_sparsemat) { 
-    PROTECT(scg_sparsemat=R_igraph_sparsemat_to_SEXP(&c_scg_sparsemat)); 
-    igraph_sparsemat_destroy(&c_scg_sparsemat);
-  } else {
-    PROTECT(scg_sparsemat=R_NilValue);
-  }
-  if (do_L) {
-    PROTECT(L=R_igraph_matrix_to_SEXP(&c_L)); 
-    igraph_matrix_destroy(&c_L); 
-  } else {
-    PROTECT(L=R_NilValue);
-  }
-  if (do_R) {
-    PROTECT(R=R_igraph_matrix_to_SEXP(&c_R)); 
-    igraph_matrix_destroy(&c_R); 
-  } else {
-    PROTECT(R=R_NilValue);
-  }
-  if (do_Lsparse) {
-    PROTECT(Lsparse=R_igraph_sparsemat_to_SEXP(&c_Lsparse)); 
-    igraph_sparsemat_destroy(&c_Lsparse);
-  } else {
-    PROTECT(Lsparse=R_NilValue);
-  }
-  if (do_Rsparse) {    
-    PROTECT(Rsparse=R_igraph_sparsemat_to_SEXP(&c_Rsparse)); 
-    igraph_sparsemat_destroy(&c_Rsparse);
-  } else {
-    PROTECT(Rsparse=R_NilValue);
-  }
-
-  if (do_scg_graph) { SET_VECTOR_ELT(result, 0, scg_graph); }
-  if (do_scg_matrix) { SET_VECTOR_ELT(result, 0, scg_matrix); }
-  if (do_scg_sparsemat) { SET_VECTOR_ELT(result, 0, scg_sparsemat); }
-  SET_VECTOR_ELT(result, 1, groups);
-  if (do_L) { SET_VECTOR_ELT(result, 2, L); }
-  if (do_Lsparse) { SET_VECTOR_ELT(result, 2, Lsparse); }
-  if (do_R) { SET_VECTOR_ELT(result, 3, R); }
-  if (do_Rsparse) { SET_VECTOR_ELT(result, 3, Rsparse); }
-  SET_VECTOR_ELT(result, 4, eval);
-  SET_VECTOR_ELT(result, 5, evec);
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("Xt"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("groups"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("L"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("R"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("values"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("vectors"));
-  SET_NAMES(result, names);
-  UNPROTECT(11);
-
-  UNPROTECT(1);
-  return(result);
-}
-
-SEXP R_igraph_revolver_d(SEXP graph, SEXP pniter, SEXP psd, SEXP pnorm,
-			 SEXP pcites, SEXP pexpected, SEXP perror, 
-			 SEXP pdebug) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_bool_t sd=LOGICAL(psd)[0];
-  igraph_bool_t norm=LOGICAL(pnorm)[0];
-  igraph_bool_t cites=LOGICAL(pcites)[0];
-  igraph_bool_t expected=LOGICAL(pexpected)[0];
-  igraph_vector_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_vector_t vsd, vnorm, vcites, vexpected;
-  igraph_vector_t *pvsd=0, *pvnorm=0, *pvcites=0, *pvexpected=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&kernel, 0);
-  if (sd) { igraph_vector_init(&vsd, 0); pvsd=&vsd; }
-  if (norm) { igraph_vector_init(&vnorm, 0); pvnorm=&vnorm; }
-  if (cites) { igraph_vector_init(&vcites, 0); pvcites=&vcites; }
-  if (expected) { igraph_vector_init(&vexpected, 0); pvexpected=&vexpected; }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_vector(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-
-  igraph_revolver_d(&g, niter, &kernel, pvsd, pvnorm, pvcites, pvexpected,
-		   pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&kernel));
-  igraph_vector_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(pvsd));
-  if (pvsd) { igraph_vector_destroy(pvsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(pvnorm));
-  if (pvnorm) { igraph_vector_destroy(pvnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(pvcites));
-  if (pvcites) { igraph_vector_destroy(pvcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(pvexpected));
-  if (pvexpected) { igraph_vector_destroy(pvexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_d(SEXP graph, SEXP pkernel) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pkernel, &kernel);
-  igraph_revolver_error2_d(&g, &kernel, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}   
-
-SEXP R_igraph_revolver_ad(SEXP graph, SEXP pniter, SEXP pagebins,
-			  SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			  SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_bool_t sd=LOGICAL(psd)[0];
-  igraph_bool_t norm=LOGICAL(pnorm)[0];
-  igraph_bool_t cites=LOGICAL(pcites)[0];
-  igraph_bool_t expected=LOGICAL(pexpected)[0];
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_matrix_t vsd, vnorm, vcites, vexpected;
-  igraph_matrix_t *pvsd=0, *pvnorm=0, *pvcites=0, *pvexpected=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (sd) { igraph_matrix_init(&vsd, 0, 0); pvsd=&vsd; }
-  if (norm) { igraph_matrix_init(&vnorm, 0, 0); pvnorm=&vnorm; }
-  if (cites) { igraph_matrix_init(&vcites, 0, 0); pvcites=&vcites; }
-  if (expected) { igraph_matrix_init(&vexpected, 0, 0); pvexpected=&vexpected; }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-
-  igraph_revolver_ad(&g, niter, agebins, &kernel, pvsd, pvnorm, pvcites,
-		     pvexpected, pplogprob, pplognull, pplogmax, 
-		     ppdebug, ppdebugres);
-
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(pvsd));
-  if (pvsd) { igraph_matrix_destroy(pvsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(pvnorm));
-  if (pvnorm) { igraph_matrix_destroy(pvnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(pvcites));
-  if (pvcites) { igraph_matrix_destroy(pvcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(pvexpected));
-  if (pvexpected) { igraph_matrix_destroy(pvexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-  
-}
-
-SEXP R_igraph_revolver_error2_ad(SEXP graph, SEXP pkernel) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_ad(&g, &kernel, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}   
-
-SEXP R_igraph_revolver_ade(SEXP graph, SEXP pcats, SEXP pniter, SEXP pagebins,
-			   SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			   SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_array3_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_array3_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_array3_init(&kernel, 0, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_array3_init(&vsd, 0, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_array3_init(&vnorm, 0, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_array3_init(&vcites, 0, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_array3_init(&vexpected, 0, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_ade(&g, niter, agebins, &cats, &kernel, ppsd, ppnorm,
-		     ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		     ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_array3_to_SEXP(&kernel));
-  igraph_array3_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orarray3_to_SEXP(ppsd));
-  if (ppsd) { igraph_array3_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orarray3_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_array3_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orarray3_to_SEXP(ppcites));
-  if (ppcites) { igraph_array3_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orarray3_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_array3_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_ade(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_array3_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_igraph_SEXP_to_array3(pkernel, &kernel);
-  igraph_revolver_error2_ade(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}   
-  
-SEXP R_igraph_revolver_e(SEXP graph, SEXP pcats, SEXP pniter, SEXP pst,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_vector_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_vector_t vst, *ppst=0;
-  igraph_vector_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_vector_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_vector_init(&kernel, 0);
-  if (LOGICAL(pst)[0]) { igraph_vector_init(&vst, 0); ppst=&vst; }
-  if (LOGICAL(psd)[0]) { igraph_vector_init(&vsd, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_vector_init(&vnorm, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_vector_init(&vcites, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_vector_init(&vexpected, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_vector(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_e(&g, niter, &cats, &kernel, ppst, ppsd, ppnorm, ppcites, ppexpected,
-		   pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(8));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&kernel));
-  igraph_vector_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppst));
-  if (ppst) { igraph_vector_destroy(ppst); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(ppsd));
-  if (ppsd) { igraph_vector_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_vector_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(ppcites));
-  if (ppcites) { igraph_vector_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 5, R_igraph_0orvector_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_vector_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 7, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 7))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 7))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 7))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(8));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("st"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 7, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_e(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_vector(pkernel, &kernel);
-  igraph_revolver_error2_e(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}   
-  
-SEXP R_igraph_revolver_de(SEXP graph, SEXP pcats, SEXP pniter,
-			  SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			  SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_de(&g, niter, &cats, &kernel, ppsd, ppnorm, ppcites,
-		    ppexpected, pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-  
-SEXP R_igraph_revolver_error2_de(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_de(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_l(SEXP graph, SEXP pniter, SEXP pagebins,
-			SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_vector_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_vector_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&kernel, 0);
-  if (LOGICAL(psd)[0]) { igraph_vector_init(&vsd, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_vector_init(&vnorm, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_vector_init(&vcites, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_vector_init(&vexpected, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_vector(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_l(&g, niter, agebins, &kernel, ppsd, ppnorm, 
-		   ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		   ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&kernel));
-  igraph_vector_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(ppsd));
-  if (ppsd) { igraph_vector_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_vector_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(ppcites));
-  if (ppcites) { igraph_vector_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_vector_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_l(SEXP graph, SEXP pkernel) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pkernel, &kernel);
-  igraph_revolver_error2_l(&g, &kernel, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_dl(SEXP graph, SEXP pniter, SEXP pagebins,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_dl(&g, niter, agebins, &kernel, ppsd, ppnorm, 
-		   ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		   ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-  
-SEXP R_igraph_revolver_error2_dl(SEXP graph, SEXP pkernel) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_dl(&g, &kernel, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_el(SEXP graph, SEXP pcats, SEXP pniter, SEXP pagebins,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_el(&g, niter, &cats, agebins, &kernel, ppsd, ppnorm, 
-		   ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		   ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_el(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_el(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_r(SEXP graph, SEXP pniter, SEXP pwindow,
-			 SEXP psd, SEXP pnorm,
-			 SEXP pcites, SEXP pexpected, SEXP perror, 
-			 SEXP pdebug) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_bool_t sd=LOGICAL(psd)[0];
-  igraph_bool_t norm=LOGICAL(pnorm)[0];
-  igraph_bool_t cites=LOGICAL(pcites)[0];
-  igraph_bool_t expected=LOGICAL(pexpected)[0];
-  igraph_vector_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_vector_t vsd, vnorm, vcites, vexpected;
-  igraph_vector_t *pvsd=0, *pvnorm=0, *pvcites=0, *pvexpected=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_vector_init(&kernel, 0);
-  if (sd) { igraph_vector_init(&vsd, 0); pvsd=&vsd; }
-  if (norm) { igraph_vector_init(&vnorm, 0); pvnorm=&vnorm; }
-  if (cites) { igraph_vector_init(&vcites, 0); pvcites=&vcites; }
-  if (expected) { igraph_vector_init(&vexpected, 0); pvexpected=&vexpected; }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_vector(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-
-  igraph_revolver_r(&g, niter, window, &kernel, pvsd, pvnorm, pvcites, pvexpected,
-		   pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_vector_to_SEXP(&kernel));
-  igraph_vector_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orvector_to_SEXP(pvsd));
-  if (pvsd) { igraph_vector_destroy(pvsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orvector_to_SEXP(pvnorm));
-  if (pvnorm) { igraph_vector_destroy(pvnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orvector_to_SEXP(pvcites));
-  if (pvcites) { igraph_vector_destroy(pvcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orvector_to_SEXP(pvexpected));
-  if (pvexpected) { igraph_vector_destroy(pvexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_r(SEXP graph, SEXP pkernel, SEXP pwindow) {
-
-  igraph_t g;
-  igraph_vector_t kernel;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pkernel, &kernel);
-  igraph_revolver_error2_r(&g, &kernel, window, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_ar(SEXP graph, SEXP pniter, SEXP pagebins, SEXP pwindow,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_matrix_t kernel;  
-  igraph_integer_t niter=REAL(pniter)[0];  
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_bool_t sd=LOGICAL(psd)[0];
-  igraph_bool_t norm=LOGICAL(pnorm)[0];
-  igraph_bool_t cites=LOGICAL(pcites)[0];
-  igraph_bool_t expected=LOGICAL(pexpected)[0];
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_matrix_t vsd, vnorm, vcites, vexpected;
-  igraph_matrix_t *pvsd=0, *pvnorm=0, *pvcites=0, *pvexpected=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (sd) { igraph_matrix_init(&vsd, 0, 0); pvsd=&vsd; }
-  if (norm) { igraph_matrix_init(&vnorm, 0, 0); pvnorm=&vnorm; }
-  if (cites) { igraph_matrix_init(&vcites, 0, 0); pvcites=&vcites; }
-  if (expected) { igraph_matrix_init(&vexpected, 0, 0); pvexpected=&vexpected; }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-
-  igraph_revolver_ar(&g, niter, agebins, window, &kernel, pvsd, pvnorm, pvcites,
-		    pvexpected, pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(pvsd));
-  if (pvsd) { igraph_matrix_destroy(pvsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(pvnorm));
-  if (pvnorm) { igraph_matrix_destroy(pvnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(pvcites));
-  if (pvcites) { igraph_matrix_destroy(pvcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(pvexpected));
-  if (pvexpected) { igraph_matrix_destroy(pvexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-  
-}
-
-SEXP R_igraph_revolver_error2_ar(SEXP graph, SEXP pkernel, SEXP pwindow) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_ar(&g, &kernel, window, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_di(SEXP graph, SEXP pcats, SEXP pniter,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_di(&g, niter, &cats, &kernel, ppsd, ppnorm, ppcites,
-		    ppexpected, pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_di(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_di(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_adi(SEXP graph, SEXP pcats, SEXP pniter, SEXP pagebins,
-			  SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			  SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_array3_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_array3_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_array3_init(&kernel, 0, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_array3_init(&vsd, 0, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_array3_init(&vnorm, 0, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_array3_init(&vcites, 0, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_array3_init(&vexpected, 0, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_adi(&g, niter, agebins, &cats, &kernel, ppsd, ppnorm,
-		     ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		     ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_array3_to_SEXP(&kernel));
-  igraph_array3_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orarray3_to_SEXP(ppsd));
-  if (ppsd) { igraph_array3_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orarray3_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_array3_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orarray3_to_SEXP(ppcites));
-  if (ppcites) { igraph_array3_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orarray3_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_array3_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_adi(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_array3_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_igraph_SEXP_to_array3(pkernel, &kernel);
-  igraph_revolver_error2_adi(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_il(SEXP graph, SEXP pcats, SEXP pniter, SEXP pagebins,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_il(&g, niter, agebins, &cats, &kernel, ppsd, ppnorm, 
-		    ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		    ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_il(SEXP graph, SEXP pkernel, SEXP pcats) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_vector_t cats;
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_il(&g, &kernel, &cats, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_ir(SEXP graph, SEXP pcats, SEXP pwindow, SEXP pniter,
-			 SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			 SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_matrix_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_ir(&g, niter, window, &cats, &kernel, ppsd, ppnorm, ppcites,
-		    ppexpected, pplogprob, pplognull, pplogmax, ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_ir(SEXP graph, SEXP pkernel, SEXP pcats, 
-				 SEXP pwindow) {
-
-  igraph_t g;
-  igraph_matrix_t kernel;
-  igraph_vector_t cats;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_SEXP_to_matrix(pkernel, &kernel);
-  igraph_revolver_error2_ir(&g, &kernel, &cats, window, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_air(SEXP graph, SEXP pcats, SEXP pwindow, 
-			  SEXP pniter, SEXP pagebins,
-			  SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			  SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t cats;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_array3_t kernel;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_integer_t agebins=REAL(pagebins)[0];
-  igraph_array3_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0, rlogmax, *pplogmax=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  igraph_array3_init(&kernel, 0, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_array3_init(&vsd, 0, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_array3_init(&vnorm, 0, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_array3_init(&vcites, 0, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_array3_init(&vexpected, 0, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; pplogmax=&rlogmax; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_air(&g, niter, window, agebins, &cats, &kernel, ppsd, ppnorm,
-		     ppcites, ppexpected, pplogprob, pplognull, pplogmax, ppdebug,
-		     ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_array3_to_SEXP(&kernel));
-  igraph_array3_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0orarray3_to_SEXP(ppsd));
-  if (ppsd) { igraph_array3_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0orarray3_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_array3_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0orarray3_to_SEXP(ppcites));
-  if (ppcites) { igraph_array3_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0orarray3_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_array3_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(3));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-    REAL(VECTOR_ELT(result, 6))[2]=*pplogmax;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_revolver_error2_air(SEXP graph, SEXP pkernel, SEXP pcats, 
-				  SEXP pwindow) {
-
-  igraph_t g;
-  igraph_array3_t kernel;
-  igraph_vector_t cats;
-  igraph_integer_t window=REAL(pwindow)[0];
-  igraph_real_t logprob, lognull;
-  SEXP result;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pcats, &cats);
-  R_igraph_SEXP_to_array3(pkernel, &kernel);
-  igraph_revolver_error2_air(&g, &kernel, &cats, window, &logprob, &lognull);
-  PROTECT(result=NEW_NUMERIC(2));  
-  REAL(result)[0]=logprob;
-  REAL(result)[1]=lognull;
-   
-  UNPROTECT(1);
-  return result;
-}
-
-SEXP R_igraph_revolver_d_d(SEXP graph, SEXP pniter, SEXP pvtime, SEXP petime,
-			   SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			   SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t vtime, etime;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_matrix_t kernel;
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pvtime, &vtime);
-  R_SEXP_to_vector(petime, &etime);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_d_d(&g, niter, &vtime, &etime, &kernel, ppsd, ppnorm,
-		      ppcites, ppexpected, pplogprob, pplognull,
-		      ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(2));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}
-
-SEXP R_igraph_evolver_d(SEXP pnodes, SEXP pkernel, SEXP poutseq, 
-			SEXP poutdist, SEXP pm, SEXP pdirected) {
-  
-  igraph_t g;
-  igraph_integer_t nodes=REAL(pnodes)[0];
-  igraph_vector_t kernel;
-  igraph_vector_t voutseq, *ppoutseq=0;
-  igraph_vector_t voutdist, *ppoutdist=0;
-  igraph_integer_t m=REAL(pm)[0];
-  igraph_bool_t directed=LOGICAL(pdirected)[0];
-  SEXP result;
-  
-  R_SEXP_to_vector(pkernel, &kernel);
-  if (!isNull(poutseq)) {
-    R_SEXP_to_vector(poutseq, &voutseq);
-    ppoutseq=&voutseq;
-  }
-  if (!isNull(poutdist)) {
-    R_SEXP_to_vector(poutdist, &voutdist);
-    ppoutdist=&voutdist;
-  }
-  
-  igraph_evolver_d(&g, nodes, &kernel, ppoutseq, ppoutdist, m, directed);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-		   
-SEXP R_igraph_revolver_p_p(SEXP graph, SEXP pniter, SEXP pvtime, SEXP petime,
-			   SEXP pauthors, SEXP peventsizes,
-			   SEXP psd, SEXP pnorm, SEXP pcites, SEXP pexpected,
-			   SEXP perror, SEXP pdebug) {
-  igraph_t g;
-  igraph_vector_t vtime, etime;
-  igraph_vector_t authors, eventsizes;
-  igraph_integer_t niter=REAL(pniter)[0];
-  igraph_matrix_t kernel;
-  igraph_matrix_t vsd, *ppsd=0, vnorm, *ppnorm=0, vcites, *ppcites=0,
-    vexpected, *ppexpected=0;
-  igraph_matrix_t debug, *ppdebug=0;
-  igraph_vector_ptr_t debugres, *ppdebugres=0;
-  igraph_real_t rlogprob, rlognull, *pplogprob=0, *pplognull=0;
-  SEXP result, names;
-  
-  R_SEXP_to_igraph(graph, &g);
-  R_SEXP_to_vector(pvtime, &vtime);
-  R_SEXP_to_vector(petime, &etime);
-  R_SEXP_to_vector(pauthors, &authors);
-  R_SEXP_to_vector(peventsizes, &eventsizes);
-  igraph_matrix_init(&kernel, 0, 0);
-  if (LOGICAL(psd)[0]) { igraph_matrix_init(&vsd, 0, 0); ppsd=&vsd; }
-  if (LOGICAL(pnorm)[0]) { igraph_matrix_init(&vnorm, 0, 0); ppnorm=&vnorm; }
-  if (LOGICAL(pcites)[0]) { igraph_matrix_init(&vcites, 0, 0); ppcites=&vcites; }
-  if (LOGICAL(pexpected)[0]) { 
-    igraph_matrix_init(&vexpected, 0, 0); 
-    ppexpected=&vexpected; 
-  }
-  if (LOGICAL(perror)[0]) { pplogprob=&rlogprob; pplognull=&rlognull; }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug)!=0) {
-    R_SEXP_to_matrix(pdebug, &debug); ppdebug=&debug; 
-    igraph_vector_ptr_init(&debugres, 0); ppdebugres=&debugres;
-  }
-  
-  igraph_revolver_p_p(&g, niter, &vtime, &etime, &authors, &eventsizes,
-		      &kernel, ppsd, ppnorm,
-		      ppcites, ppexpected, pplogprob, pplognull,
-		      ppdebug, ppdebugres);
-  
-  PROTECT(result=NEW_LIST(7));
-  SET_VECTOR_ELT(result, 0, R_igraph_matrix_to_SEXP(&kernel));
-  igraph_matrix_destroy(&kernel);
-  SET_VECTOR_ELT(result, 1, R_igraph_0ormatrix_to_SEXP(ppsd));
-  if (ppsd) { igraph_matrix_destroy(ppsd); }
-  SET_VECTOR_ELT(result, 2, R_igraph_0ormatrix_to_SEXP(ppnorm));
-  if (ppnorm) { igraph_matrix_destroy(ppnorm); }
-  SET_VECTOR_ELT(result, 3, R_igraph_0ormatrix_to_SEXP(ppcites));
-  if (ppcites) { igraph_matrix_destroy(ppcites); }
-  SET_VECTOR_ELT(result, 4, R_igraph_0ormatrix_to_SEXP(ppexpected));
-  if (ppexpected) { igraph_matrix_destroy(ppexpected); }
-  if (!isNull(pdebug) && GET_LENGTH(pdebug) != 0) {
-    /* TODO */
-  } else {
-    SET_VECTOR_ELT(result, 5, R_NilValue);
-  }
-  if (pplogprob) {
-    SET_VECTOR_ELT(result, 6, NEW_NUMERIC(2));
-    REAL(VECTOR_ELT(result, 6))[0]=*pplogprob;
-    REAL(VECTOR_ELT(result, 6))[1]=*pplognull;
-  } else {
-    SET_VECTOR_ELT(result, 6, R_NilValue);
-  }
-  PROTECT(names=NEW_CHARACTER(7));
-  SET_STRING_ELT(names, 0, CREATE_STRING_VECTOR("kernel"));
-  SET_STRING_ELT(names, 1, CREATE_STRING_VECTOR("sd"));
-  SET_STRING_ELT(names, 2, CREATE_STRING_VECTOR("norm"));
-  SET_STRING_ELT(names, 3, CREATE_STRING_VECTOR("cites"));
-  SET_STRING_ELT(names, 4, CREATE_STRING_VECTOR("expected"));
-  SET_STRING_ELT(names, 5, CREATE_STRING_VECTOR("debug"));
-  SET_STRING_ELT(names, 6, CREATE_STRING_VECTOR("error"));
-  SET_NAMES(result, names);
-  
-  UNPROTECT(2);
-  return result;
-}		   
-			 
-
-
-SEXP R_igraph_simple_interconnected_islands_game(SEXP islands_n, SEXP islands_size, SEXP islands_pin, SEXP n_inter) {
-  
-  igraph_t g;
-  igraph_integer_t a=INTEGER(islands_n)[0];
-  igraph_integer_t b=INTEGER(islands_size)[0];
-  igraph_real_t c=REAL(islands_pin)[0];
-  igraph_integer_t d=INTEGER(n_inter)[0];
-  SEXP result;
-  
-  igraph_simple_interconnected_islands_game(&g, a, b, c, d);
-  PROTECT(result=R_igraph_to_SEXP(&g));
-  igraph_destroy(&g);
-  
-  UNPROTECT(1);
-  return result;
-}
-
-
-/***********************************************/
-/* THE REST IS GENERATED BY inger.py           */
-/***********************************************/
diff -Nru igraph-0.6.5~quantal1/interfaces/R/src/rinterface.h igraph-0.6.5/interfaces/R/src/rinterface.h
--- igraph-0.6.5~quantal1/interfaces/R/src/rinterface.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/src/rinterface.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2010  Gabor Csardi <csardi.gabor@gmail.com>
-   Rue de l'Industrie 5, Lausanne 1005, Switzerland
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/add.edges.R igraph-0.6.5/interfaces/R/tests/add.edges.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/add.edges.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/add.edges.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.empty(10)
-g2 <- add.edges(g, c(1,2, 2,3, 3,4, 1,6, 1,7, 9,10) )
-g2
-
-g3 <- add.edges(g, c(1,5, 2,6, 3,10, 4,5), attr=list(weight=c(1,2,1,-1)) )
-g3
-E(g3)$weight
-
-g4 <- add.edges(g2, c(1,4, 4,6, 7,1), attr=list(weight=c(-1,1,-2.5)))
-g4
-E(g4)$weight
-
-g5 <- add.edges(g3, c(10,9, 10,10, 1,1), attr=list(weight=c(100,100,100)) )
-g5
-E(g5)$weight
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/add.edges.Rout.save igraph-0.6.5/interfaces/R/tests/add.edges.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/add.edges.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/add.edges.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.empty(10)
-> g2 <- add.edges(g, c(1,2, 2,3, 3,4, 1,6, 1,7, 9,10) )
-> g2
-IGRAPH D--- 10 6 -- 
-+ edges:
-[1] 1-> 2 2-> 3 3-> 4 1-> 6 1-> 7 9->10
-> 
-> g3 <- add.edges(g, c(1,5, 2,6, 3,10, 4,5), attr=list(weight=c(1,2,1,-1)) )
-> g3
-IGRAPH D-W- 10 4 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1-> 5 2-> 6 3->10 4-> 5
-> E(g3)$weight
-[1]  1  2  1 -1
-> 
-> g4 <- add.edges(g2, c(1,4, 4,6, 7,1), attr=list(weight=c(-1,1,-2.5)))
-> g4
-IGRAPH D-W- 10 9 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1-> 2 2-> 3 3-> 4 1-> 6 1-> 7 9->10 1-> 4 4-> 6 7-> 1
-> E(g4)$weight
-[1]   NA   NA   NA   NA   NA   NA -1.0  1.0 -2.5
-> 
-> g5 <- add.edges(g3, c(10,9, 10,10, 1,1), attr=list(weight=c(100,100,100)) )
-> g5
-IGRAPH D-W- 10 7 -- 
-+ attr: weight (e/n)
-+ edges:
-[1]  1-> 5  2-> 6  3->10  4-> 5 10-> 9 10->10  1-> 1
-> E(g5)$weight
-[1]   1   2   1  -1 100 100 100
-> 
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.296   0.038   0.322 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/add.vertices.R igraph-0.6.5/interfaces/R/tests/add.vertices.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/add.vertices.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/add.vertices.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.formula(A-B-C-D-E)
-g2 <- add.vertices(g, 4)
-g2
-
-g3 <- add.vertices(g, 3, attr=list(name=c("F","G","H"), weight=1:3))
-g3
-V(g3)
-V(g3)$weight
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/add.vertices.Rout.save igraph-0.6.5/interfaces/R/tests/add.vertices.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/add.vertices.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/add.vertices.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.formula(A-B-C-D-E)
-> g2 <- add.vertices(g, 4)
-> g2
-IGRAPH UN-- 9 4 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-[1] A--B B--C C--D D--E
-> 
-> g3 <- add.vertices(g, 3, attr=list(name=c("F","G","H"), weight=1:3))
-> g3
-IGRAPH UN-- 8 4 -- 
-+ attr: name (v/c), weight (v/n)
-+ edges (vertex names):
-[1] A--B B--C C--D D--E
-> V(g3)
-Vertex sequence:
-[1] "A" "B" "C" "D" "E" "F" "G" "H"
-> V(g3)$weight
-[1] NA NA NA NA NA  1  2  3
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.299   0.039   0.325 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/all.st.cuts.R igraph-0.6.5/interfaces/R/tests/all.st.cuts.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/all.st.cuts.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/all.st.cuts.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-
-library(igraph)
-
-g <- graph.formula( a -+ b -+ c -+ d -+ e )
-stCuts(g, source="a", target="e")
-
-g2 <- graph.formula( s -+ a:b -+ t, a -+ 1:2:3 -+ b )
-stCuts(g2, source="s", target="t")
-
-g3 <- graph.formula( s -+ a:b -+ t, a -+ 1:2:3:4:5 -+ b )
-stMincuts(g2, source="s", target="t")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/all.st.cuts.Rout.save igraph-0.6.5/interfaces/R/tests/all.st.cuts.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/all.st.cuts.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/all.st.cuts.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,154 +0,0 @@
-
-R version 2.14.1 (2011-12-22)
-Copyright (C) 2011 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.formula( a -+ b -+ c -+ d -+ e )
-> stCuts(g, source="a", target="e")
-$cuts
-$cuts[[1]]
-[1] 1
-
-$cuts[[2]]
-[1] 2
-
-$cuts[[3]]
-[1] 3
-
-$cuts[[4]]
-[1] 4
-
-
-$partition1s
-$partition1s[[1]]
-[1] 1
-
-$partition1s[[2]]
-[1] 1 2
-
-$partition1s[[3]]
-[1] 1 2 3
-
-$partition1s[[4]]
-[1] 1 2 3 4
-
-
-> 
-> g2 <- graph.formula( s -+ a:b -+ t, a -+ 1:2:3 -+ b )
-> stCuts(g2, source="s", target="t")
-$cuts
-$cuts[[1]]
-[1] 1 2
-
-$cuts[[2]]
-[1] 1 7
-
-$cuts[[3]]
-[1] 2 3 4 5 6
-
-$cuts[[4]]
-[1]  2  3  4  5 10
-
-$cuts[[5]]
-[1] 2 3 4 6 9
-
-$cuts[[6]]
-[1]  2  3  4  9 10
-
-$cuts[[7]]
-[1] 2 3 5 6 8
-
-$cuts[[8]]
-[1]  2  3  5  8 10
-
-$cuts[[9]]
-[1] 2 3 6 8 9
-
-$cuts[[10]]
-[1]  2  3  8  9 10
-
-$cuts[[11]]
-[1] 3 7
-
-
-$partition1s
-$partition1s[[1]]
-[1] 1
-
-$partition1s[[2]]
-[1] 1 3
-
-$partition1s[[3]]
-[1] 1 2
-
-$partition1s[[4]]
-[1] 1 2 7
-
-$partition1s[[5]]
-[1] 1 2 6
-
-$partition1s[[6]]
-[1] 1 2 6 7
-
-$partition1s[[7]]
-[1] 1 2 5
-
-$partition1s[[8]]
-[1] 1 2 5 7
-
-$partition1s[[9]]
-[1] 1 2 5 6
-
-$partition1s[[10]]
-[1] 1 2 5 6 7
-
-$partition1s[[11]]
-[1] 1 2 5 6 7 3
-
-
-> 
-> g3 <- graph.formula( s -+ a:b -+ t, a -+ 1:2:3:4:5 -+ b )
-> stMincuts(g2, source="s", target="t")
-$value
-[1] 2
-
-$cuts
-$cuts[[1]]
-[1] 1 2
-
-$cuts[[2]]
-[1] 1 7
-
-$cuts[[3]]
-[1] 3 7
-
-
-$partition1s
-$partition1s[[1]]
-[1] 1
-
-$partition1s[[2]]
-[1] 1 3
-
-$partition1s[[3]]
-[1] 1 3 2 7 6 5
-
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/alpha.centrality.R igraph-0.6.5/interfaces/R/tests/alpha.centrality.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/alpha.centrality.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/alpha.centrality.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-library(igraph)
-
-g.1 <- graph( c(1,3,2,3,3,4,4,5) )
-g.2 <- graph( c(2,1,3,1,4,1,5,1) )
-g.3 <- graph( c(1,2,2,3,3,4,4,1,5,1) )
-alpha.centrality(g.1)
-alpha.centrality(g.2)
-alpha.centrality(g.3,alpha=0.5)
-
-alpha.centrality(g.1, sparse=FALSE)
-alpha.centrality(g.2, sparse=FALSE)
-alpha.centrality(g.3, alpha=0.5, sparse=FALSE)
-
-##############################
-## weighted version
-
-set.seed(42)
-
-star <- graph.star(10)
-E(star)$weight <- runif(ecount(star))
-
-alpha.centrality(star, sparse=TRUE)
-alpha.centrality(star, sparse=FALSE)
-
-alpha.centrality(star, weights="weight", sparse=TRUE)
-alpha.centrality(star, weights="weight", sparse=FALSE)
-
-alpha.centrality(star, weights=NA, sparse=TRUE)
-alpha.centrality(star, weights=NA, sparse=FALSE)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/alpha.centrality.Rout.save igraph-0.6.5/interfaces/R/tests/alpha.centrality.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/alpha.centrality.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/alpha.centrality.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,70 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g.1 <- graph( c(1,3,2,3,3,4,4,5) )
-> g.2 <- graph( c(2,1,3,1,4,1,5,1) )
-> g.3 <- graph( c(1,2,2,3,3,4,4,1,5,1) )
-> alpha.centrality(g.1)
-Loading required package: Matrix
-Loading required package: lattice
-[1] 1 1 3 4 5
-> alpha.centrality(g.2)
-[1] 5 1 1 1 1
-> alpha.centrality(g.3,alpha=0.5)
-[1] 2.533333 2.266667 2.133333 2.066667 1.000000
-> 
-> alpha.centrality(g.1, sparse=FALSE)
-[1] 1 1 3 4 5
-> alpha.centrality(g.2, sparse=FALSE)
-[1] 5 1 1 1 1
-> alpha.centrality(g.3, alpha=0.5, sparse=FALSE)
-[1] 2.533333 2.266667 2.133333 2.066667 1.000000
-> 
-> ##############################
-> ## weighted version
-> 
-> set.seed(42)
-> 
-> star <- graph.star(10)
-> E(star)$weight <- runif(ecount(star))
-> 
-> alpha.centrality(star, sparse=TRUE)
- [1] 6.657557 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
- [9] 1.000000 1.000000
-> alpha.centrality(star, sparse=FALSE)
- [1] 6.657557 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
- [9] 1.000000 1.000000
-> 
-> alpha.centrality(star, weights="weight", sparse=TRUE)
- [1] 6.657557 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
- [9] 1.000000 1.000000
-> alpha.centrality(star, weights="weight", sparse=FALSE)
- [1] 6.657557 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000 1.000000
- [9] 1.000000 1.000000
-> 
-> alpha.centrality(star, weights=NA, sparse=TRUE)
- [1] 10  1  1  1  1  1  1  1  1  1
-> alpha.centrality(star, weights=NA, sparse=FALSE)
- [1] 10  1  1  1  1  1  1  1  1  1
-> 
-> proc.time()
-   user  system elapsed 
-  2.496   0.076   2.559 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/are.connected.R igraph-0.6.5/interfaces/R/tests/are.connected.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/are.connected.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/are.connected.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph)
-
-g <- graph.formula( A-B-C, B-D )
-are.connected(g, "A", "B")
-are.connected(g, "B", "A")
-are.connected(g, "A", "D")
-
-g2 <- graph( c(1,2, 2,3, 3,4), dir=FALSE )
-are.connected(g2, 1,2)
-are.connected(g2, 3,2)
-are.connected(g2, 4,1)
-
-g3 <- graph.formula( A-+B-+C, B-+D )
-are.connected(g3, "A", "C")
-are.connected(g3, "A", "B")
-are.connected(g3, "B", "A")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/are.connected.Rout.save igraph-0.6.5/interfaces/R/tests/are.connected.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/are.connected.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/are.connected.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.formula( A-B-C, B-D )
-> are.connected(g, "A", "B")
-[1] TRUE
-> are.connected(g, "B", "A")
-[1] TRUE
-> are.connected(g, "A", "D")
-[1] FALSE
-> 
-> g2 <- graph( c(1,2, 2,3, 3,4), dir=FALSE )
-> are.connected(g2, 1,2)
-[1] TRUE
-> are.connected(g2, 3,2)
-[1] TRUE
-> are.connected(g2, 4,1)
-[1] FALSE
-> 
-> g3 <- graph.formula( A-+B-+C, B-+D )
-> are.connected(g3, "A", "C")
-[1] FALSE
-> are.connected(g3, "A", "B")
-[1] TRUE
-> are.connected(g3, "B", "A")
-[1] FALSE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/arpack.R igraph-0.6.5/interfaces/R/tests/arpack.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/arpack.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/arpack.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-library(igraph)
-library(Matrix, warn.conflicts=FALSE)
-
-####
-
-f <- function(x, extra=NULL) x
-res <- arpack(f, options=list(n=10, nev=2, ncv=4), sym=TRUE)
-res$values
-
-####
-
-f <- function(x, extra=NULL) {
-  y <- x
-  y[1] <- (length(x)-1)*x[1] - sum(x[-1])
-  for (i in 2:length(x)) {
-    y[i] <- x[i] - x[1]
-  }
-  y
-}
-r1 <- arpack(f, options=list(n=10, nev=1, ncv=3), sym=TRUE)
-r2 <- eigen(graph.laplacian(graph.star(10, mode="undirected")))
-
-correctSign <- function(x) { if (x[1]<0) { -x } else { x } }
-max(abs(r1$values - r2$values[1])) < 1e-14
-max(abs(correctSign(r1$vectors) - correctSign(r2$vectors[,1]))) < 1e-14
-
-####
-# Complex case
-
-A <- structure(c(-6, -6, 7, 6, 1, -9, -3, 2, -9, -7, 0, 1, -7, 8, 
--7, 10, 0, 0, 1, 1, 10, 0, 8, -4, -4, -5, 8, 9, -6, 9, 3, 8, 
-6, -1, 9, -9, -6, -3, -1, -7, 8, -4, -4, 10, 0, 5, -2, 0, 7, 
-10, 1, 4, -8, 3, 5, 3, -7, -9, 10, -1, -4, -7, -1, 7, 5, -5, 
-1, -4, 9, -2, 10, 1, -7, 7, 6, 7, -3, 0, 9, -5, -8, 1, -3, -3, 
--8, -7, -8, 10, 8, 7, 0, 6, -7, -8, 10, 10, 1, 0, -2, 6), .Dim = c(10L, 
-10L))
-
-f <- function(x, extra=NULL) A %*% x
-res <- arpack(f, options=list(n=10, nev=3, ncv=7, sym=FALSE))
-res$values
-(res$values[1] * res$vectors[,1]) / (A %*% res$vectors[,1])
-(res$values[2] * res$vectors[,2]) / (A %*% res$vectors[,2])
-abs((res$values[3] * res$vectors[,3]) / (A %*% res$vectors[,3]))
-
-f <- function(x, extra=NULL) A %*% x
-res <- arpack(f, options=list(n=10, nev=4, ncv=9, sym=FALSE))
-res$values
-(res$values[1] * res$vectors[,1]) / (A %*% res$vectors[,1])
-(res$values[2] * res$vectors[,2]) / (A %*% res$vectors[,2])
-abs((res$values[3] * res$vectors[,3]) / (A %*% res$vectors[,3]))
-abs((res$values[4] * res$vectors[,4]) / (A %*% res$vectors[,4]))
-
-####
-
-# TODO: further tests for typically hard cases
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/arpack.Rout.save igraph-0.6.5/interfaces/R/tests/arpack.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/arpack.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/arpack.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,159 +0,0 @@
-
-R version 2.14.1 (2011-12-22)
-Copyright (C) 2011 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> library(Matrix, warn.conflicts=FALSE)
-Loading required package: lattice
-> 
-> ####
-> 
-> f <- function(x, extra=NULL) x
-> res <- arpack(f, options=list(n=10, nev=2, ncv=4), sym=TRUE)
-> res$values
-[1] 1 1
-> 
-> ####
-> 
-> f <- function(x, extra=NULL) {
-+   y <- x
-+   y[1] <- (length(x)-1)*x[1] - sum(x[-1])
-+   for (i in 2:length(x)) {
-+     y[i] <- x[i] - x[1]
-+   }
-+   y
-+ }
-> r1 <- arpack(f, options=list(n=10, nev=1, ncv=3), sym=TRUE)
-> r2 <- eigen(graph.laplacian(graph.star(10, mode="undirected")))
-> 
-> correctSign <- function(x) { if (x[1]<0) { -x } else { x } }
-> max(abs(r1$values - r2$values[1])) < 1e-14
-[1] TRUE
-> max(abs(correctSign(r1$vectors) - correctSign(r2$vectors[,1]))) < 1e-14
-[1] TRUE
-> 
-> ####
-> # Complex case
-> 
-> A <- structure(c(-6, -6, 7, 6, 1, -9, -3, 2, -9, -7, 0, 1, -7, 8, 
-+ -7, 10, 0, 0, 1, 1, 10, 0, 8, -4, -4, -5, 8, 9, -6, 9, 3, 8, 
-+ 6, -1, 9, -9, -6, -3, -1, -7, 8, -4, -4, 10, 0, 5, -2, 0, 7, 
-+ 10, 1, 4, -8, 3, 5, 3, -7, -9, 10, -1, -4, -7, -1, 7, 5, -5, 
-+ 1, -4, 9, -2, 10, 1, -7, 7, 6, 7, -3, 0, 9, -5, -8, 1, -3, -3, 
-+ -8, -7, -8, 10, 8, 7, 0, 6, -7, -8, 10, 10, 1, 0, -2, 6), .Dim = c(10L, 
-+ 10L))
-> 
-> f <- function(x, extra=NULL) A %*% x
-> res <- arpack(f, options=list(n=10, nev=3, ncv=7, sym=FALSE))
-> res$values
-[1]  22.04831+ 0.00000i -21.32812+ 0.00000i  -3.00735+19.29572i
-> (res$values[1] * res$vectors[,1]) / (A %*% res$vectors[,1])
-      [,1]
- [1,] 1+0i
- [2,] 1+0i
- [3,] 1+0i
- [4,] 1+0i
- [5,] 1+0i
- [6,] 1+0i
- [7,] 1+0i
- [8,] 1+0i
- [9,] 1+0i
-[10,] 1+0i
-> (res$values[2] * res$vectors[,2]) / (A %*% res$vectors[,2])
-      [,1]
- [1,] 1+0i
- [2,] 1+0i
- [3,] 1+0i
- [4,] 1+0i
- [5,] 1+0i
- [6,] 1+0i
- [7,] 1+0i
- [8,] 1+0i
- [9,] 1+0i
-[10,] 1+0i
-> abs((res$values[3] * res$vectors[,3]) / (A %*% res$vectors[,3]))
-      [,1]
- [1,]    1
- [2,]    1
- [3,]    1
- [4,]    1
- [5,]    1
- [6,]    1
- [7,]    1
- [8,]    1
- [9,]    1
-[10,]    1
-> 
-> f <- function(x, extra=NULL) A %*% x
-> res <- arpack(f, options=list(n=10, nev=4, ncv=9, sym=FALSE))
-> res$values
-[1]  22.04831+ 0.00000i -21.32812+ 0.00000i  -3.00735+19.29572i
-[4]  -3.00735-19.29572i
-> (res$values[1] * res$vectors[,1]) / (A %*% res$vectors[,1])
-      [,1]
- [1,] 1+0i
- [2,] 1+0i
- [3,] 1+0i
- [4,] 1+0i
- [5,] 1+0i
- [6,] 1+0i
- [7,] 1+0i
- [8,] 1+0i
- [9,] 1+0i
-[10,] 1+0i
-> (res$values[2] * res$vectors[,2]) / (A %*% res$vectors[,2])
-      [,1]
- [1,] 1+0i
- [2,] 1+0i
- [3,] 1+0i
- [4,] 1+0i
- [5,] 1+0i
- [6,] 1+0i
- [7,] 1+0i
- [8,] 1+0i
- [9,] 1+0i
-[10,] 1+0i
-> abs((res$values[3] * res$vectors[,3]) / (A %*% res$vectors[,3]))
-      [,1]
- [1,]    1
- [2,]    1
- [3,]    1
- [4,]    1
- [5,]    1
- [6,]    1
- [7,]    1
- [8,]    1
- [9,]    1
-[10,]    1
-> abs((res$values[4] * res$vectors[,4]) / (A %*% res$vectors[,4]))
-      [,1]
- [1,]    1
- [2,]    1
- [3,]    1
- [4,]    1
- [5,]    1
- [6,]    1
- [7,]    1
- [8,]    1
- [9,]    1
-[10,]    1
-> 
-> ####
-> 
-> # TODO: further tests for typically hard cases
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/articulation.points.R igraph-0.6.5/interfaces/R/tests/articulation.points.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/articulation.points.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/articulation.points.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-g <- graph.full(5) %du% graph.full(5)
-clu <- clusters(g)$membership
-g <- add.edges(g, c(match(1,clu), match(2,clu)) )
-
-ap <- articulation.points(g)
-deg <- degree(g)
-sort(which(deg==max(deg))) == sort(ap)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/articulation.points.Rout.save igraph-0.6.5/interfaces/R/tests/articulation.points.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/articulation.points.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/articulation.points.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.full(5) %du% graph.full(5)
-> clu <- clusters(g)$membership
-> g <- add.edges(g, c(match(1,clu), match(2,clu)) )
-> 
-> ap <- articulation.points(g)
-> deg <- degree(g)
-> sort(which(deg==max(deg))) == sort(ap)
-[1] TRUE TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/as.directed.R igraph-0.6.5/interfaces/R/tests/as.directed.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/as.directed.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/as.directed.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- erdos.renyi.game(100, 2/100)
-g2 <- as.directed(g, mode="mutual")
-g3 <- as.directed(g, mode="arbitrary")
-
-all(degree(g) == degree(g3))
-all(degree(g) == degree(g2) / 2)
-
-graph.isomorphic(g, as.undirected(g2))
-graph.isomorphic(g, as.undirected(g3))
-
-ge <- graph.empty(10)
-summary(as.directed(ge))
-summary(as.directed(ge, "arbitrary"))
-
-ge2 <- graph.empty()
-summary(as.directed(ge2))
-summary(as.directed(ge2, "arbitrary"))
-
-#### Keeping attributes
-
-g <- graph.formula( A-B-C, D-A, E )
-g$name <- "Small graph"
-g2 <- as.directed(g, mode="mutual")
-g3 <- as.directed(g, mode="arbitrary")
-g2
-g3
-g2$name
-g3$name
-
-set.seed(42)
-E(g)$weight <- runif(ecount(g))
-print(as.directed(g, "mutual"), e=TRUE)
-print(as.directed(g, "arbitrary"), e=TRUE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/as.directed.Rout.save igraph-0.6.5/interfaces/R/tests/as.directed.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/as.directed.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/as.directed.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,94 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- erdos.renyi.game(100, 2/100)
-> g2 <- as.directed(g, mode="mutual")
-> g3 <- as.directed(g, mode="arbitrary")
-> 
-> all(degree(g) == degree(g3))
-[1] TRUE
-> all(degree(g) == degree(g2) / 2)
-[1] TRUE
-> 
-> graph.isomorphic(g, as.undirected(g2))
-[1] TRUE
-> graph.isomorphic(g, as.undirected(g3))
-[1] TRUE
-> 
-> ge <- graph.empty(10)
-> summary(as.directed(ge))
-IGRAPH D--- 10 0 -- 
-> summary(as.directed(ge, "arbitrary"))
-IGRAPH D--- 10 0 -- 
-> 
-> ge2 <- graph.empty()
-> summary(as.directed(ge2))
-IGRAPH D--- 0 0 -- 
-> summary(as.directed(ge2, "arbitrary"))
-IGRAPH D--- 0 0 -- 
-> 
-> #### Keeping attributes
-> 
-> g <- graph.formula( A-B-C, D-A, E )
-> g$name <- "Small graph"
-> g2 <- as.directed(g, mode="mutual")
-> g3 <- as.directed(g, mode="arbitrary")
-> g2
-IGRAPH DN-- 5 6 -- Small graph
-+ attr: name (g/c), name (v/c)
-+ edges (vertex names):
-[1] A->B A->D B->C B->A D->A C->B
-> g3
-IGRAPH DN-- 5 3 -- Small graph
-+ attr: name (g/c), name (v/c)
-+ edges (vertex names):
-[1] A->B A->D B->C
-> g2$name
-[1] "Small graph"
-> g3$name
-[1] "Small graph"
-> 
-> set.seed(42)
-> E(g)$weight <- runif(ecount(g))
-> print(as.directed(g, "mutual"), e=TRUE)
-IGRAPH DNW- 5 6 -- Small graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ edges (vertex names) and their attributes:
-    edge    weight
-[1] A->B 0.9148060
-[2] A->D 0.9370754
-[3] B->C 0.2861395
-[4] B->A 0.9148060
-[5] D->A 0.9370754
-[6] C->B 0.2861395
-> print(as.directed(g, "arbitrary"), e=TRUE)
-IGRAPH DNW- 5 3 -- Small graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ edges (vertex names) and their attributes:
-    edge    weight
-[1] A->B 0.9148060
-[2] A->D 0.9370754
-[3] B->C 0.2861395
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.326   0.039   0.424 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/as.undirected.R igraph-0.6.5/interfaces/R/tests/as.undirected.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/as.undirected.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/as.undirected.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-set.seed(42)
-g <- graph.formula(A+-+B, A--+C, C+-+D)
-g$name <- "Tiny graph"
-E(g)$weight <- rnorm(ecount(g))
-
-g2 <- as.undirected(g, mode="collapse")
-g3 <- as.undirected(g, mode="each")
-g4 <- as.undirected(g, mode="mutual")
-
-print(g, e=TRUE, g=TRUE)
-print(g2, e=TRUE, g=TRUE)
-print(g3, e=TRUE, g=TRUE)
-print(g4, e=TRUE, g=TRUE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/as.undirected.Rout.save igraph-0.6.5/interfaces/R/tests/as.undirected.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/as.undirected.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/as.undirected.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,82 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> set.seed(42)
-> g <- graph.formula(A+-+B, A--+C, C+-+D)
-> g$name <- "Tiny graph"
-> E(g)$weight <- rnorm(ecount(g))
-> 
-> g2 <- as.undirected(g, mode="collapse")
-> g3 <- as.undirected(g, mode="each")
-> g4 <- as.undirected(g, mode="mutual")
-> 
-> print(g, e=TRUE, g=TRUE)
-IGRAPH DNW- 4 5 -- Tiny graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Tiny graph"
-+ edges (vertex names) and their attributes:
-    edge     weight
-[1] A->B  1.3709584
-[2] A->C -0.5646982
-[3] B->A  0.3631284
-[4] C->D  0.6328626
-[5] D->C  0.4042683
-> print(g2, e=TRUE, g=TRUE)
-IGRAPH UNW- 4 3 -- Tiny graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Tiny graph"
-+ edges (vertex names) and their attributes:
-    edge     weight
-[1] A--B  1.7340869
-[2] A--C -0.5646982
-[3] C--D  1.0371309
-> print(g3, e=TRUE, g=TRUE)
-IGRAPH UNW- 4 5 -- Tiny graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Tiny graph"
-+ edges (vertex names) and their attributes:
-    edge     weight
-[1] A--B  1.3709584
-[2] A--C -0.5646982
-[3] A--B  0.3631284
-[4] C--D  0.6328626
-[5] C--D  0.4042683
-> print(g4, e=TRUE, g=TRUE)
-IGRAPH UNW- 4 2 -- Tiny graph
-+ attr: name (g/c), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Tiny graph"
-+ edges (vertex names) and their attributes:
-    edge   weight
-[1] A--B 1.734087
-[2] C--D 1.037131
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.323   0.039   0.373 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/assortativity.R igraph-0.6.5/interfaces/R/tests/assortativity.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/assortativity.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/assortativity.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-
-library(igraph)
-
-g <- read.graph(f <- gzfile("celegansneural.gml.gz"), format="gml")
-assortativity.degree(g)
-as <- assortativity(g, degree(g, mode="out"), degree(g, mode="in"))
-as
-
-assR <- function(graph) { 
-  indeg <- degree(graph, mode="in")
-  outdeg <- degree(graph, mode="out")
-  el <- get.edgelist(graph, names=FALSE)
-  J <- outdeg[el[,1]]-1
-  K <- indeg[el[,2]]-1
-  num <- sum(J*K) - sum(J)*sum(K)/ecount(graph)
-  den1 <- sum(J*J) - sum(J)^2/ecount(graph)
-  den2 <- sum(K*K) - sum(K)^2/ecount(graph)
-  num / sqrt(den1) / sqrt(den2)
-}
-as2 <- assR(g)
-abs(as-as2) < 1e-14
-
-assortativity.degree(simplify(as.undirected(g, mode="collapse")))
-
-p <- read.graph(f <- gzfile("power.gml.gz"), format="gml")
-assortativity.degree(p)
-assortativity(p, degree(p))
-assR(as.directed(p, mode="mutual"))
-
-o <- read.graph(f <- gzfile("football.gml.gz"), format="gml")
-o <- simplify(o)
-an <- assortativity.nominal(o, V(o)$value+1)
-
-el <- get.edgelist(o, names=FALSE)
-etm <- matrix(0, nr=max(V(o)$value)+1, nc=max(V(o)$value)+1)
-for (e in 1:nrow(el)) {
-  t1 <- V(o)$value[ el[e,1] ]+1
-  t2 <- V(o)$value[ el[e,2] ]+1
-  etm[t1, t2] <- etm[t1, t2] + 1
-  etm[t2, t1] <- etm[t2, t1] + 1
-}
-etm <- etm/sum(etm)
-an2 <- ( sum(diag(etm))-sum(etm %*% etm) ) / ( 1-sum(etm %*% etm) )
-
-abs(an - an2) < 1e-14
-
-#####
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/assortativity.Rout.save igraph-0.6.5/interfaces/R/tests/assortativity.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/assortativity.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/assortativity.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- read.graph(f <- gzfile("celegansneural.gml.gz"), format="gml")
-> assortativity.degree(g)
-[1] -0.2257953
-> as <- assortativity(g, degree(g, mode="out"), degree(g, mode="in"))
-> as
-[1] -0.2257953
-> 
-> assR <- function(graph) { 
-+   indeg <- degree(graph, mode="in")
-+   outdeg <- degree(graph, mode="out")
-+   el <- get.edgelist(graph, names=FALSE)
-+   J <- outdeg[el[,1]]-1
-+   K <- indeg[el[,2]]-1
-+   num <- sum(J*K) - sum(J)*sum(K)/ecount(graph)
-+   den1 <- sum(J*J) - sum(J)^2/ecount(graph)
-+   den2 <- sum(K*K) - sum(K)^2/ecount(graph)
-+   num / sqrt(den1) / sqrt(den2)
-+ }
-> as2 <- assR(g)
-> abs(as-as2) < 1e-14
-[1] TRUE
-> 
-> assortativity.degree(simplify(as.undirected(g, mode="collapse")))
-[1] -0.1631992
-> 
-> p <- read.graph(f <- gzfile("power.gml.gz"), format="gml")
-> assortativity.degree(p)
-[1] 0.003456988
-> assortativity(p, degree(p))
-[1] 0.003456988
-> assR(as.directed(p, mode="mutual"))
-[1] 0.003456988
-> 
-> o <- read.graph(f <- gzfile("football.gml.gz"), format="gml")
-> o <- simplify(o)
-> an <- assortativity.nominal(o, V(o)$value+1)
-> 
-> el <- get.edgelist(o, names=FALSE)
-> etm <- matrix(0, nr=max(V(o)$value)+1, nc=max(V(o)$value)+1)
-> for (e in 1:nrow(el)) {
-+   t1 <- V(o)$value[ el[e,1] ]+1
-+   t2 <- V(o)$value[ el[e,2] ]+1
-+   etm[t1, t2] <- etm[t1, t2] + 1
-+   etm[t2, t1] <- etm[t2, t1] + 1
-+ }
-> etm <- etm/sum(etm)
-> an2 <- ( sum(diag(etm))-sum(etm %*% etm) ) / ( 1-sum(etm %*% etm) )
-> 
-> abs(an - an2) < 1e-14
-[1] TRUE
-> 
-> #####
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/attributes.R igraph-0.6.5/interfaces/R/tests/attributes.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/attributes.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/attributes.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-
-library(igraph)
-
-## Create a small ring graph, assign attributes
-ring <- graph.formula( A-B-C-D-E-F-G-A )
-E(ring)$weight <- seq_len(ecount(ring))
-
-## Query attributes
-V(ring)$name
-E(ring)$weight
-
-## TODO: subsetting
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/attributes.Rout.save igraph-0.6.5/interfaces/R/tests/attributes.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/attributes.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/attributes.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Create a small ring graph, assign attributes
-> ring <- graph.formula( A-B-C-D-E-F-G-A )
-> E(ring)$weight <- seq_len(ecount(ring))
-> 
-> ## Query attributes
-> V(ring)$name
-[1] "A" "B" "C" "D" "E" "F" "G"
-> E(ring)$weight
-[1] 1 2 3 4 5 6 7
-> 
-> ## TODO: subsetting
-> 
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/authority.score.R igraph-0.6.5/interfaces/R/tests/authority.score.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/authority.score.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/authority.score.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,67 +0,0 @@
-
-library(igraph)
-
-set.seed(42)                            # Shouldn't be here....
-
-ashs <- function(graph, as=TRUE) {
-  mscale <- function(x) {
-    if (sd(x)!=0) { x <- scale(x) }
-    if (x[1] < 0) { x <- -x       }
-    x
-  }
-  A <- get.adjacency(graph, sparse=FALSE)
-  if (as) { 
-    s1 <- eigen(t(A) %*% A)$vectors[,1]
-    s2 <- authority.score(graph)$vector
-  } else {
-    s1 <- eigen(A %*% t(A))$vectors[,1]
-    s2 <- hub.score(graph)$vector
-  }    
-  all(abs(mscale(s1) - mscale(s2)) < 1e-12)
-}
-
-g1 <- ba.game(100, m=10)
-ashs(g1)
-ashs(g1, as=FALSE)
-
-g2 <- erdos.renyi.game(100, 2/100)
-ashs(g2)
-ashs(g2, as=FALSE)
-
-g3 <- graph.ring(100)
-all(authority.score(g3)$vector == 1)
-all(hub.score(g3)$vector == 1)
-
-## Stress-test
-
-is.principal <- function(M, lambda, eps=1e-12) {
-  abs(eigen(M)$values[1] - lambda) < eps
-}
-
-is.ev <- function(M, v, lambda, eps=1e-12) {
-  max(abs(M %*% v - lambda * v)) < eps
-}
-
-is.good <- function(M, v, lambda, eps=1e-12) {
-  is.principal(M, lambda, eps) && is.ev(M, v, lambda, eps)
-}
-
-for (i in 1:1000) {
-  G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-  as <- authority.score(G)
-  M <- get.adjacency(G)
-  if (!is.good(t(M) %*% M, as$vector, as$value)) {
-    print("Foobar!")
-    break
-  }
-}
-
-for (i in 1:1000) {
-  G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-  hs <- hub.score(G)
-  M <- get.adjacency(G)
-  if (!is.good(M %*% t(M), hs$vector, hs$value)) {
-    print("Foobar!")
-    break
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/authority.score.Rout.save igraph-0.6.5/interfaces/R/tests/authority.score.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/authority.score.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/authority.score.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,97 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)                            # Shouldn't be here....
-> 
-> ashs <- function(graph, as=TRUE) {
-+   mscale <- function(x) {
-+     if (sd(x)!=0) { x <- scale(x) }
-+     if (x[1] < 0) { x <- -x       }
-+     x
-+   }
-+   A <- get.adjacency(graph, sparse=FALSE)
-+   if (as) { 
-+     s1 <- eigen(t(A) %*% A)$vectors[,1]
-+     s2 <- authority.score(graph)$vector
-+   } else {
-+     s1 <- eigen(A %*% t(A))$vectors[,1]
-+     s2 <- hub.score(graph)$vector
-+   }    
-+   all(abs(mscale(s1) - mscale(s2)) < 1e-12)
-+ }
-> 
-> g1 <- ba.game(100, m=10)
-> ashs(g1)
-[1] TRUE
-> ashs(g1, as=FALSE)
-[1] TRUE
-> 
-> g2 <- erdos.renyi.game(100, 2/100)
-> ashs(g2)
-[1] TRUE
-> ashs(g2, as=FALSE)
-[1] TRUE
-> 
-> g3 <- graph.ring(100)
-> all(authority.score(g3)$vector == 1)
-[1] TRUE
-> all(hub.score(g3)$vector == 1)
-[1] TRUE
-> 
-> ## Stress-test
-> 
-> is.principal <- function(M, lambda, eps=1e-12) {
-+   abs(eigen(M)$values[1] - lambda) < eps
-+ }
-> 
-> is.ev <- function(M, v, lambda, eps=1e-12) {
-+   max(abs(M %*% v - lambda * v)) < eps
-+ }
-> 
-> is.good <- function(M, v, lambda, eps=1e-12) {
-+   is.principal(M, lambda, eps) && is.ev(M, v, lambda, eps)
-+ }
-> 
-> for (i in 1:1000) {
-+   G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-+   as <- authority.score(G)
-+   M <- get.adjacency(G)
-+   if (!is.good(t(M) %*% M, as$vector, as$value)) {
-+     print("Foobar!")
-+     break
-+   }
-+ }
-Loading required package: Matrix
-Loading required package: lattice
-> 
-> for (i in 1:1000) {
-+   G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-+   hs <- hub.score(G)
-+   M <- get.adjacency(G)
-+   if (!is.good(M %*% t(M), hs$vector, hs$value)) {
-+     print("Foobar!")
-+     break
-+   }
-+ }
-> 
-> proc.time()
-   user  system elapsed 
- 12.043   0.244  12.284 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/average.path.length.R igraph-0.6.5/interfaces/R/tests/average.path.length.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/average.path.length.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/average.path.length.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-library(igraph)
-
-apl <- function(graph) {
-  sp <- shortest.paths(graph, mode="out")
-  if (is.directed(graph)) {
-    diag(sp) <- NA
-  } else {
-    sp[lower.tri(sp, diag=TRUE)] <- NA
-  }
-  sp[sp=="Inf"] <- NA
-  mean(sp, na.rm=TRUE)
-}
-
-giant.component <- function(graph, mode="weak") {
-  clu <- clusters(graph, mode=mode)
-  induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-}
-  
-g <- giant.component(erdos.renyi.game(100, 3/100))
-abs(apl(g) - average.path.length(g)) < 1e-14
-
-g <- giant.component(erdos.renyi.game(100, 6/100, dir=TRUE), mode="strong")
-abs(apl(g) - average.path.length(g)) < 1e-14
-
-g <- erdos.renyi.game(100, 2/100)
-abs(apl(g) - average.path.length(g)) < 1e-14
-
-g <- erdos.renyi.game(100, 4/100, dir=TRUE)
-abs(apl(g) - average.path.length(g)) < 1e-14
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/average.path.length.Rout.save igraph-0.6.5/interfaces/R/tests/average.path.length.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/average.path.length.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/average.path.length.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> apl <- function(graph) {
-+   sp <- shortest.paths(graph, mode="out")
-+   if (is.directed(graph)) {
-+     diag(sp) <- NA
-+   } else {
-+     sp[lower.tri(sp, diag=TRUE)] <- NA
-+   }
-+   sp[sp=="Inf"] <- NA
-+   mean(sp, na.rm=TRUE)
-+ }
-> 
-> giant.component <- function(graph, mode="weak") {
-+   clu <- clusters(graph, mode=mode)
-+   induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-+ }
->   
-> g <- giant.component(erdos.renyi.game(100, 3/100))
-> abs(apl(g) - average.path.length(g)) < 1e-14
-[1] TRUE
-> 
-> g <- giant.component(erdos.renyi.game(100, 6/100, dir=TRUE), mode="strong")
-> abs(apl(g) - average.path.length(g)) < 1e-14
-[1] TRUE
-> 
-> g <- erdos.renyi.game(100, 2/100)
-> abs(apl(g) - average.path.length(g)) < 1e-14
-[1] TRUE
-> 
-> g <- erdos.renyi.game(100, 4/100, dir=TRUE)
-> abs(apl(g) - average.path.length(g)) < 1e-14
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/ba.game.R igraph-0.6.5/interfaces/R/tests/ba.game.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/ba.game.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/ba.game.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-
-# sink("ba.game.Rout.save")
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- ba.game(100, m=2)
-ecount(g)
-vcount(g)
-is.simple(g)
-
-g2 <- ba.game(100, m=2, algorithm="psumtree-multiple")
-ecount(g2)
-vcount(g2)
-is.simple(g2)
-
-g3 <- ba.game(100, m=2, algorithm="bag")
-ecount(g3)
-vcount(g3)
-is.simple(g3)
-
-set.seed(1234)
-g4 <- ba.game(10, m=1, algorithm="bag", start.graph=graph.empty(5))
-ecount(g4)
-vcount(g4)
-degree(g4)
-
-g6 <- ba.game(10, m=1, algorithm="bag", start.graph=graph.star(10))
-g6
-
-g7 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-              start.graph=graph.empty(5))
-g7
-
-g8 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-              start.graph=graph.star(5))
-g8
-
-g9 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-              start.graph=graph.star(10))
-g9
-
-g10 <- ba.game(10, m=3, start.graph=graph.empty(5))
-g10
-
-g11 <- ba.game(10, m=3, start.graph=graph.star(5))
-g11
-
-g12 <- ba.game(10, m=3, start.graph=graph.star(10))
-g12
-
-# sink(NULL)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/ba.game.Rout.save igraph-0.6.5/interfaces/R/tests/ba.game.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/ba.game.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/ba.game.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,124 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> # sink("ba.game.Rout.save")
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- ba.game(100, m=2)
-> ecount(g)
-[1] 197
-> vcount(g)
-[1] 100
-> is.simple(g)
-[1] TRUE
-> 
-> g2 <- ba.game(100, m=2, algorithm="psumtree-multiple")
-> ecount(g2)
-[1] 198
-> vcount(g2)
-[1] 100
-> is.simple(g2)
-[1] FALSE
-> 
-> g3 <- ba.game(100, m=2, algorithm="bag")
-> ecount(g3)
-[1] 198
-> vcount(g3)
-[1] 100
-> is.simple(g3)
-[1] FALSE
-> 
-> set.seed(1234)
-> g4 <- ba.game(10, m=1, algorithm="bag", start.graph=graph.empty(5))
-> ecount(g4)
-[1] 5
-> vcount(g4)
-[1] 10
-> degree(g4)
- [1] 2 0 0 0 1 2 1 1 2 1
-> 
-> g6 <- ba.game(10, m=1, algorithm="bag", start.graph=graph.star(10))
-> g6
-IGRAPH D--- 10 9 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
-[1]  2->1  3->1  4->1  5->1  6->1  7->1  8->1  9->1 10->1
-> 
-> g7 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-+               start.graph=graph.empty(5))
-> g7
-IGRAPH D--- 10 15 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
- [1]  6->4  6->1  6->2  7->4  7->3  7->4  8->4  8->2  8->7  9->2  9->7  9->2
-[13] 10->2 10->2 10->2
-> 
-> g8 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-+               start.graph=graph.star(5))
-> g8
-IGRAPH D--- 10 19 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
- [1]  2->1  3->1  4->1  5->1  6->1  6->1  6->1  7->1  7->1  7->4  8->1  8->6
-[13]  8->5  9->1  9->1  9->1 10->1 10->1 10->1
-> 
-> g9 <- ba.game(10, m=3, algorithm="psumtree-multiple",
-+               start.graph=graph.star(10))
-> g9
-IGRAPH D--- 10 9 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
-[1]  2->1  3->1  4->1  5->1  6->1  7->1  8->1  9->1 10->1
-> 
-> g10 <- ba.game(10, m=3, start.graph=graph.empty(5))
-> g10
-IGRAPH D--- 10 15 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
- [1]  6->4  6->1  6->2  7->6  7->4  7->2  8->4  8->2  8->6  9->2  9->4  9->6
-[13] 10->4 10->2 10->7
-> 
-> g11 <- ba.game(10, m=3, start.graph=graph.star(5))
-> g11
-IGRAPH D--- 10 19 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
- [1]  2->1  3->1  4->1  5->1  6->1  6->3  6->5  7->2  7->1  7->5  8->2  8->5
-[13]  8->1  9->5  9->6  9->1 10->1 10->2 10->5
-> 
-> g12 <- ba.game(10, m=3, start.graph=graph.star(10))
-> g12
-IGRAPH D--- 10 9 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
-[1]  2->1  3->1  4->1  5->1  6->1  7->1  8->1  9->1 10->1
-> 
-> # sink(NULL)
-> 
-> proc.time()
-   user  system elapsed 
-  0.313   0.041   0.366 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/betweenness.R igraph-0.6.5/interfaces/R/tests/betweenness.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/betweenness.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/betweenness.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-
-library(igraph)
-
-## Plain
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-nf <- (vcount(kite)-1) * (vcount(kite)-2) /2
-bet <- structure(betweenness(kite) / nf, names=V(kite)$name)
-round(sort(bet, decreasing=TRUE), 3)
-
-bet2 <- structure(betweenness(kite, normalized=TRUE), names=V(kite)$name)
-round(sort(bet2, decreasing=TRUE), 3)
-
-## Weighted
-
-nontriv <- graph( c(0,19,0,16,0,20,1,19,2,5,3,7,3,8,
-                    4,15,4,11,5,8,5,19,6,7,6,10,6,8,
-                    6,9,7,20,9,10,9,20,10,19,
-                    11,12,11,20,12,15,13,15,
-                    14,18,14,16,14,17,15,16,17,18)+1, dir=FALSE )
-  
-E(nontriv)$weight <- c(0.5249, 1, 0.1934, 0.6274, 0.5249, 
-                       0.0029, 0.3831, 0.05, 0.6274, 0.3831, 
-                       0.5249, 0.0587, 0.0579, 0.0562, 0.0562, 
-                       0.1934, 0.6274, 0.6274, 0.6274, 0.0418, 
-                       0.6274, 0.3511, 0.3511, 0.1486, 1, 1, 
-                       0.0711, 0.2409)
-
-nontrivRes <- c(20,0,0,0,0,19,80,85,32,0,10,
-                75,70,0,36,81,60,0,19,19,86)
-
-bet <- betweenness(nontriv)
-all(bet == nontrivRes)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/betweenness.Rout.save igraph-0.6.5/interfaces/R/tests/betweenness.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/betweenness.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/betweenness.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Plain
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> nf <- (vcount(kite)-1) * (vcount(kite)-2) /2
-> bet <- structure(betweenness(kite) / nf, names=V(kite)$name)
-> round(sort(bet, decreasing=TRUE), 3)
- Heather Fernando    Garth      Ike    Diane    Andre  Beverly    Carol 
-   0.389    0.231    0.231    0.222    0.102    0.023    0.023    0.000 
-      Ed     Jane 
-   0.000    0.000 
-> 
-> bet2 <- structure(betweenness(kite, normalized=TRUE), names=V(kite)$name)
-> round(sort(bet2, decreasing=TRUE), 3)
- Heather Fernando    Garth      Ike    Diane    Andre  Beverly    Carol 
-   0.389    0.231    0.231    0.222    0.102    0.023    0.023    0.000 
-      Ed     Jane 
-   0.000    0.000 
-> 
-> ## Weighted
-> 
-> nontriv <- graph( c(0,19,0,16,0,20,1,19,2,5,3,7,3,8,
-+                     4,15,4,11,5,8,5,19,6,7,6,10,6,8,
-+                     6,9,7,20,9,10,9,20,10,19,
-+                     11,12,11,20,12,15,13,15,
-+                     14,18,14,16,14,17,15,16,17,18)+1, dir=FALSE )
->   
-> E(nontriv)$weight <- c(0.5249, 1, 0.1934, 0.6274, 0.5249, 
-+                        0.0029, 0.3831, 0.05, 0.6274, 0.3831, 
-+                        0.5249, 0.0587, 0.0579, 0.0562, 0.0562, 
-+                        0.1934, 0.6274, 0.6274, 0.6274, 0.0418, 
-+                        0.6274, 0.3511, 0.3511, 0.1486, 1, 1, 
-+                        0.0711, 0.2409)
-> 
-> nontrivRes <- c(20,0,0,0,0,19,80,85,32,0,10,
-+                 75,70,0,36,81,60,0,19,19,86)
-> 
-> bet <- betweenness(nontriv)
-> all(bet == nontrivRes)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/biconnected.components.R igraph-0.6.5/interfaces/R/tests/biconnected.components.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/biconnected.components.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/biconnected.components.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- graph.full(5) %du% graph.full(5)
-clu <- clusters(g)$membership
-g <- add.edges(g, c(match(1,clu), match(2,clu)) )
-
-biconnected.components(g)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/biconnected.components.Rout.save igraph-0.6.5/interfaces/R/tests/biconnected.components.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/biconnected.components.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/biconnected.components.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.full(5) %du% graph.full(5)
-> clu <- clusters(g)$membership
-> g <- add.edges(g, c(match(1,clu), match(2,clu)) )
-> 
-> biconnected.components(g)
-$no
-[1] 3
-
-$tree_edges
-$tree_edges[[1]]
-[1] 10  8  5  1
-
-$tree_edges[[2]]
-[1] 20 18 15 11
-
-$tree_edges[[3]]
-[1] 21
-
-
-$component_edges
-$component_edges[[1]]
- [1]  4  7  9 10  3  6  8  2  5  1
-
-$component_edges[[2]]
- [1] 14 17 19 20 13 16 18 12 15 11
-
-$component_edges[[3]]
-[1] 21
-
-
-$components
-$components[[1]]
-[1] 5 4 3 2 1
-
-$components[[2]]
-[1] 10  9  8  7  6
-
-$components[[3]]
-[1] 6 1
-
-
-$articulation_points
-[1] 6 1
-
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bipartite.projection.R igraph-0.6.5/interfaces/R/tests/bipartite.projection.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bipartite.projection.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bipartite.projection.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,22 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-set.seed(42)
-
-g <- graph.full.bipartite(10,5)
-proj <- bipartite.projection(g)
-graph.isomorphic(proj[[1]], graph.full(10))
-graph.isomorphic(proj[[2]], graph.full(5))
-
-M <- matrix(0, nr=5, nc=3)
-rownames(M) <- c("Alice", "Bob", "Cecil", "Dan", "Ethel")
-colnames(M) <- c("Party", "Skiing", "Badminton")
-M[] <- sample(0:1, length(M), replace=TRUE)
-M
-g2 <- graph.incidence(M)
-g2$name <- "Event network"
-proj2 <- bipartite.projection(g2)
-print(proj2[[1]], g=TRUE, e=TRUE)
-print(proj2[[2]], g=TRUE, e=TRUE)
-
-bipartite.projection.size(g2)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bipartite.projection.Rout.save igraph-0.6.5/interfaces/R/tests/bipartite.projection.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bipartite.projection.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bipartite.projection.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> set.seed(42)
-> 
-> g <- graph.full.bipartite(10,5)
-> proj <- bipartite.projection(g)
-> graph.isomorphic(proj[[1]], graph.full(10))
-[1] TRUE
-> graph.isomorphic(proj[[2]], graph.full(5))
-[1] TRUE
-> 
-> M <- matrix(0, nr=5, nc=3)
-> rownames(M) <- c("Alice", "Bob", "Cecil", "Dan", "Ethel")
-> colnames(M) <- c("Party", "Skiing", "Badminton")
-> M[] <- sample(0:1, length(M), replace=TRUE)
-> M
-      Party Skiing Badminton
-Alice     1      1         0
-Bob       1      1         1
-Cecil     0      0         1
-Dan       1      1         0
-Ethel     1      1         0
-> g2 <- graph.incidence(M)
-> g2$name <- "Event network"
-> proj2 <- bipartite.projection(g2)
-> print(proj2[[1]], g=TRUE, e=TRUE)
-IGRAPH UNWB 5 7 -- Event network
-+ attr: name (g/c), type (v/x), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Event network"
-+ edges (vertex names) and their attributes:
-            edge weight
-[1] Alice--Bob        2
-[2] Alice--Dan        2
-[3] Alice--Ethel      2
-[4] Bob  --Dan        2
-[5] Bob  --Ethel      2
-[6] Bob  --Cecil      1
-[7] Dan  --Ethel      2
-> print(proj2[[2]], g=TRUE, e=TRUE)
-IGRAPH UNWB 3 3 -- Event network
-+ attr: name (g/c), type (v/x), name (v/c), weight (e/n)
-+ graph attributes:
-[[name]]
-[1] "Event network"
-+ edges (vertex names) and their attributes:
-                    edge weight
-[1] Party    --Skiing         4
-[2] Party    --Badminton      1
-[3] Skiing   --Badminton      1
-> 
-> bipartite.projection.size(g2)
-$vcount1
-[1] 5
-
-$ecount1
-[1] 7
-
-$vcount2
-[1] 3
-
-$ecount2
-[1] 3
-
-> 
-> proc.time()
-   user  system elapsed 
-  0.303   0.038   0.343 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bonpow.R igraph-0.6.5/interfaces/R/tests/bonpow.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bonpow.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bonpow.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-library(igraph)
-
-## Generate some test data from Bonacich, 1987:
-
-fig1 <- graph.formula( A -+ B -+ C:D )
-for (beta in seq(0, 0.8, by=0.2)) {
-  print(round(bonpow(fig1, exp=beta), 2))
-}
-
-g.c <- graph( c(1,2,1,3,2,4,3,5), dir=FALSE)
-g.d <- graph( c(1,2,1,3,1,4,2,5,3,6,4,7), dir=FALSE)
-g.e <- graph( c(1,2,1,3,1,4,2,5,2,6,3,7,3,8,4,9,4,10), dir=FALSE)
-g.f <- graph( c(1,2,1,3,1,4,2,5,2,6,2,7,3,8,3,9,3,10,4,11,4,12,4,13),
-             dir=FALSE)
-
-## Compute Bonpow scores
-for (e in seq(-0.5,.5, by=0.1)) {
-  print(round(bonpow(g.c, exp=e)[c(1,2,4)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.d, exp=e)[c(1,2,5)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.e, exp=e)[c(1,2,5)], 2))
-}
-
-for (e in seq(-0.4,.4, by=0.1)) {
-  print(round(bonpow(g.f, exp=e)[c(1,2,5)], 2))
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bonpow.Rout.save igraph-0.6.5/interfaces/R/tests/bonpow.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bonpow.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bonpow.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,104 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Generate some test data from Bonacich, 1987:
-> 
-> fig1 <- graph.formula( A -+ B -+ C:D )
-> for (beta in seq(0, 0.8, by=0.2)) {
-+   print(round(bonpow(fig1, exp=beta), 2))
-+ }
-Loading required package: Matrix
-Loading required package: lattice
-   A    B    C    D 
-0.89 1.79 0.00 0.00 
-   A    B    C    D 
-1.15 1.64 0.00 0.00 
-   A    B    C    D 
-1.34 1.49 0.00 0.00 
-   A    B    C    D 
-1.48 1.35 0.00 0.00 
-   A    B    C    D 
-1.59 1.22 0.00 0.00 
-> 
-> g.c <- graph( c(1,2,1,3,2,4,3,5), dir=FALSE)
-> g.d <- graph( c(1,2,1,3,1,4,2,5,3,6,4,7), dir=FALSE)
-> g.e <- graph( c(1,2,1,3,1,4,2,5,2,6,3,7,3,8,4,9,4,10), dir=FALSE)
-> g.f <- graph( c(1,2,1,3,1,4,2,5,2,6,2,7,3,8,3,9,3,10,4,11,4,12,4,13),
-+              dir=FALSE)
-> 
-> ## Compute Bonpow scores
-> for (e in seq(-0.5,.5, by=0.1)) {
-+   print(round(bonpow(g.c, exp=e)[c(1,2,4)], 2))
-+ }
-[1] 0.00 1.58 0.00
-[1] 0.73 1.45 0.36
-[1] 0.97 1.34 0.49
-[1] 1.09 1.27 0.54
-[1] 1.15 1.23 0.58
-[1] 1.2 1.2 0.6
-[1] 1.22 1.17 0.61
-[1] 1.25 1.16 0.62
-[1] 1.26 1.14 0.63
-[1] 1.27 1.13 0.64
-[1] 1.28 1.12 0.64
-> 
-> for (e in seq(-0.4,.4, by=0.1)) {
-+   print(round(bonpow(g.d, exp=e)[c(1,2,5)], 2))
-+ }
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-[1] 1.62 1.08 0.54
-> 
-> for (e in seq(-0.4,.4, by=0.1)) {
-+   print(round(bonpow(g.e, exp=e)[c(1,2,5)], 2))
-+ }
-[1] -1.00  1.67 -0.33
-[1] 0.36 1.81 0.12
-[1] 1.00 1.67 0.33
-[1] 1.30 1.55 0.43
-[1] 1.46 1.46 0.49
-[1] 1.57 1.40 0.52
-[1] 1.63 1.36 0.54
-[1] 1.68 1.33 0.56
-[1] 1.72 1.30 0.57
-> 
-> for (e in seq(-0.4,.4, by=0.1)) {
-+   print(round(bonpow(g.f, exp=e)[c(1,2,5)], 2))
-+ }
-[1] -1.72  1.53 -0.57
-[1] -0.55  2.03 -0.18
-[1] 0.44 2.05 0.15
-[1] 1.01 1.91 0.34
-[1] 1.33 1.78 0.44
-[1] 1.52 1.67 0.51
-[1] 1.65 1.59 0.55
-[1] 1.74 1.53 0.58
-[1] 1.80 1.48 0.60
-> 
-> proc.time()
-   user  system elapsed 
-  3.356   0.099   3.443 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.R igraph-0.6.5/interfaces/R/tests/bug-1019624.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1019624.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-data <- read.table("bug-1019624.txt")
-data
-
-g <- graph.adjacency(as.matrix(data), weighted=TRUE)
-g
-E(g)$weight
-str(g)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.Rout.save igraph-0.6.5/interfaces/R/tests/bug-1019624.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1019624.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> data <- read.table("bug-1019624.txt")
-> data
-  V1 V2 V3 V4
-1  0  0  0  0
-2  0  0  0  1
-3  0  0  0  0
-4  2  0  2  0
-> 
-> g <- graph.adjacency(as.matrix(data), weighted=TRUE)
-> g
-IGRAPH DNW- 4 3 -- 
-+ attr: name (v/c), weight (e/n)
-> E(g)$weight
-[1] 1 2 2
-> str(g)
-IGRAPH DNW- 4 3 -- 
-+ attr: name (v/c), weight (e/n)
-+ edges (vertex names):
-[1] V2->V4 V4->V1 V4->V3
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.373   0.053   0.409 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.txt igraph-0.6.5/interfaces/R/tests/bug-1019624.txt
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1019624.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1019624.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,4 +0,0 @@
-0 0 0 0 
-0 0 0 1 
-0 0 0 0 
-2 0 2 0 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1032819.R igraph-0.6.5/interfaces/R/tests/bug-1032819.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1032819.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1032819.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- graph.full(3)
-path <- graph.ring(3, circular=F)
-V(g)$color <- c(1,1,2)
-V(path)$color <- c(1,2,1)
-graph.count.subisomorphisms.vf2(g, path)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1032819.Rout.save igraph-0.6.5/interfaces/R/tests/bug-1032819.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1032819.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1032819.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.full(3)
-> path <- graph.ring(3, circular=F)
-> V(g)$color <- c(1,1,2)
-> V(path)$color <- c(1,2,1)
-> graph.count.subisomorphisms.vf2(g, path)
-[1] 2
-> 
-> proc.time()
-   user  system elapsed 
-  0.282   0.039   0.308 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1033045.R igraph-0.6.5/interfaces/R/tests/bug-1033045.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1033045.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1033045.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-library(igraph)
-
-g <- graph.formula(a -- 1:3 -- 5 -- 2:4 -- b, 1 -- 2, 3 -- 4)
-stsep <- minimal.st.separators(g)
-sapply(stsep, is.minimal.separator, graph=g)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1033045.Rout.save igraph-0.6.5/interfaces/R/tests/bug-1033045.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1033045.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1033045.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.formula(a -- 1:3 -- 5 -- 2:4 -- b, 1 -- 2, 3 -- 4)
-> stsep <- minimal.st.separators(g)
-> sapply(stsep, is.minimal.separator, graph=g)
-[1] TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.288   0.039   0.314 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073705-indexing.R igraph-0.6.5/interfaces/R/tests/bug-1073705-indexing.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073705-indexing.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1073705-indexing.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-
-library(igraph)
-
-g <- graph.ring(10)
-g[1,2,attr="weight"] <- 0
-g
-g[]
-
-el <- get.edgelist(g)
-g[from=el[,1], to=el[,2], attr="sim"] <- rep(0:1, length=ecount(g))
-g
-g[attr="sim"]
-
-V(g)$name <- letters[seq_len(vcount(g))]
-el <- get.edgelist(g)
-g[from=el[,1], to=el[,2], attr="sim"] <- rep(1:0, length=ecount(g))
-g
-g[attr="sim"]
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073705-indexing.Rout.save igraph-0.6.5/interfaces/R/tests/bug-1073705-indexing.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073705-indexing.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1073705-indexing.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.ring(10)
-> g[1,2,attr="weight"] <- 0
-> g
-IGRAPH U-W- 10 10 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), weight (e/n)
-> g[]
-Loading required package: Matrix
-Loading required package: lattice
-10 x 10 sparse Matrix of class "dgCMatrix"
-                                   
- [1,]  .  0  .  .  .  .  .  .  . NA
- [2,]  0  . NA  .  .  .  .  .  .  .
- [3,]  . NA  . NA  .  .  .  .  .  .
- [4,]  .  . NA  . NA  .  .  .  .  .
- [5,]  .  .  . NA  . NA  .  .  .  .
- [6,]  .  .  .  . NA  . NA  .  .  .
- [7,]  .  .  .  .  . NA  . NA  .  .
- [8,]  .  .  .  .  .  . NA  . NA  .
- [9,]  .  .  .  .  .  .  . NA  . NA
-[10,] NA  .  .  .  .  .  .  . NA  .
-> 
-> el <- get.edgelist(g)
-> g[from=el[,1], to=el[,2], attr="sim"] <- rep(0:1, length=ecount(g))
-> g
-IGRAPH U-W- 10 10 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), weight (e/n), sim
-  (e/n)
-> g[attr="sim"]
-10 x 10 sparse Matrix of class "dgCMatrix"
-                         
- [1,] . 0 . . . . . . . 1
- [2,] 0 . 1 . . . . . . .
- [3,] . 1 . 0 . . . . . .
- [4,] . . 0 . 1 . . . . .
- [5,] . . . 1 . 0 . . . .
- [6,] . . . . 0 . 1 . . .
- [7,] . . . . . 1 . 0 . .
- [8,] . . . . . . 0 . 1 .
- [9,] . . . . . . . 1 . 0
-[10,] 1 . . . . . . . 0 .
-> 
-> V(g)$name <- letters[seq_len(vcount(g))]
-> el <- get.edgelist(g)
-> g[from=el[,1], to=el[,2], attr="sim"] <- rep(1:0, length=ecount(g))
-> g
-IGRAPH UNW- 10 10 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n), sim (e/n)
-> g[attr="sim"]
-10 x 10 sparse Matrix of class "dgCMatrix"
-   [[ suppressing 10 column names 'a', 'b', 'c' ... ]]
-                     
-a . 1 . . . . . . . 0
-b 1 . 0 . . . . . . .
-c . 0 . 1 . . . . . .
-d . . 1 . 0 . . . . .
-e . . . 0 . 1 . . . .
-f . . . . 1 . 0 . . .
-g . . . . . 0 . 1 . .
-h . . . . . . 1 . 0 .
-i . . . . . . . 0 . 1
-j 0 . . . . . . . 1 .
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  2.560   0.075   2.642 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073800-clique.R igraph-0.6.5/interfaces/R/tests/bug-1073800-clique.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073800-clique.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1073800-clique.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-library(igraph)
-
-adj <- matrix(1, nrow=11, ncol=11) - diag(11)
-g <- graph.adjacency(adj)
-suppressWarnings(largest.cliques(g))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073800-clique.Rout.save igraph-0.6.5/interfaces/R/tests/bug-1073800-clique.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/bug-1073800-clique.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/bug-1073800-clique.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> adj <- matrix(1, nrow=11, ncol=11) - diag(11)
-> g <- graph.adjacency(adj)
-> suppressWarnings(largest.cliques(g))
-[[1]]
- [1]  1  2  3  4  5  6  7  8  9 10 11
-
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.280   0.038   0.305 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/canonical.permutation.R igraph-0.6.5/interfaces/R/tests/canonical.permutation.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/canonical.permutation.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/canonical.permutation.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph)
-
-g1 <- erdos.renyi.game(10, 20, type="gnm")
-cp1 <- canonical.permutation(g1)
-cf1 <- permute.vertices(g1, cp1$labeling)
-     
-## Do the same with a random permutation of it
-g2 <- permute.vertices(g1, sample(vcount(g1)))
-cp2 <- canonical.permutation(g2)
-cf2 <- permute.vertices(g2, cp2$labeling)
-     
-## Check that they are the same
-el1 <- get.edgelist(cf1)
-el2 <- get.edgelist(cf2)
-el1 <- el1[ order(el1[,1], el1[,2]), ]
-el2 <- el2[ order(el2[,1], el2[,2]), ]
-all(el1 == el2)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/canonical.permutation.Rout.save igraph-0.6.5/interfaces/R/tests/canonical.permutation.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/canonical.permutation.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/canonical.permutation.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g1 <- erdos.renyi.game(10, 20, type="gnm")
-> cp1 <- canonical.permutation(g1)
-> cf1 <- permute.vertices(g1, cp1$labeling)
->      
-> ## Do the same with a random permutation of it
-> g2 <- permute.vertices(g1, sample(vcount(g1)))
-> cp2 <- canonical.permutation(g2)
-> cf2 <- permute.vertices(g2, cp2$labeling)
->      
-> ## Check that they are the same
-> el1 <- get.edgelist(cf1)
-> el2 <- get.edgelist(cf2)
-> el1 <- el1[ order(el1[,1], el1[,2]), ]
-> el2 <- el2[ order(el2[,1], el2[,2]), ]
-> all(el1 == el2)
-[1] TRUE
-> 
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/tests/celegansneural.gml.gz and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/tests/celegansneural.gml.gz differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/cliques.R igraph-0.6.5/interfaces/R/tests/cliques.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/cliques.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/cliques.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-check.clique <- function(graph, vids) {
-  s <- induced.subgraph(graph, vids)
-  ecount(s) == vcount(s) * (vcount(s)-1) / 2
-}
-
-g <- erdos.renyi.game(100, 0.3)
-clique.number(g)
-sapply(cliques(g, min=6), check.clique, graph=g)
-sapply(largest.cliques(g), check.clique, graph=g)
-
-## To have a bit less maximal cliques, about 100-200 usually
-g <- erdos.renyi.game(100, 0.03)
-all(sapply(maximal.cliques(g), check.clique, graph=g))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/cliques.Rout.save igraph-0.6.5/interfaces/R/tests/cliques.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/cliques.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/cliques.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> check.clique <- function(graph, vids) {
-+   s <- induced.subgraph(graph, vids)
-+   ecount(s) == vcount(s) * (vcount(s)-1) / 2
-+ }
-> 
-> g <- erdos.renyi.game(100, 0.3)
-> clique.number(g)
-[1] 6
-> sapply(cliques(g, min=6), check.clique, graph=g)
- [1] TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE
-[16] TRUE TRUE
-> sapply(largest.cliques(g), check.clique, graph=g)
- [1] TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE TRUE
-[16] TRUE TRUE
-> 
-> ## To have a bit less maximal cliques, about 100-200 usually
-> g <- erdos.renyi.game(100, 0.03)
-> all(sapply(maximal.cliques(g), check.clique, graph=g))
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/closeness.R igraph-0.6.5/interfaces/R/tests/closeness.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/closeness.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/closeness.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-
-library(igraph)
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-clo <- structure(closeness(kite) * (vcount(kite)-1), names=V(kite)$name)
-round(sort(clo, decreasing=TRUE), 3)
-
-clo2 <- closeness(kite, normalized=TRUE)
-all(clo==clo2)
-
-## TODO: weighted closeness
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/closeness.Rout.save igraph-0.6.5/interfaces/R/tests/closeness.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/closeness.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/closeness.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> clo <- structure(closeness(kite) * (vcount(kite)-1), names=V(kite)$name)
-> round(sort(clo, decreasing=TRUE), 3)
-Fernando    Garth    Diane  Heather    Andre  Beverly    Carol       Ed 
-   0.643    0.643    0.600    0.600    0.529    0.529    0.500    0.500 
-     Ike     Jane 
-   0.429    0.310 
-> 
-> clo2 <- closeness(kite, normalized=TRUE)
-> all(clo==clo2)
-[1] TRUE
-> 
-> ## TODO: weighted closeness
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/clusters.R igraph-0.6.5/interfaces/R/tests/clusters.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/clusters.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/clusters.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-gc <- function(graph) {
-  cl <- clusters(graph)
-  induced.subgraph(graph, which(cl$membership==which.max(cl$csize)))
-}
-
-rg <- function(n) {
-  gc(erdos.renyi.game(n, 1/n))
-}
-  
-G <- lapply(1:30, function(x) rg(sample(100, 1)))
-Gsize <- sapply(G, vcount)
-
-allg <- graph.disjoint.union(G)
-clu <- clusters(allg)
-all(table(clu$membership) == clu$csize)
-all(sort(clu$csize)==sort(Gsize))
-clu$no == length(G)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/clusters.Rout.save igraph-0.6.5/interfaces/R/tests/clusters.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/clusters.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/clusters.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> gc <- function(graph) {
-+   cl <- clusters(graph)
-+   induced.subgraph(graph, which(cl$membership==which.max(cl$csize)))
-+ }
-> 
-> rg <- function(n) {
-+   gc(erdos.renyi.game(n, 1/n))
-+ }
->   
-> G <- lapply(1:30, function(x) rg(sample(100, 1)))
-> Gsize <- sapply(G, vcount)
-> 
-> allg <- graph.disjoint.union(G)
-> clu <- clusters(allg)
-> all(table(clu$membership) == clu$csize)
-[1] TRUE
-> all(sort(clu$csize)==sort(Gsize))
-[1] TRUE
-> clu$no == length(G)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/cohesive.blocks.R igraph-0.6.5/interfaces/R/tests/cohesive.blocks.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/cohesive.blocks.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/cohesive.blocks.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,4 +0,0 @@
-
-library(igraph)
-
-## TODO
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/cohesive.blocks.Rout.save igraph-0.6.5/interfaces/R/tests/cohesive.blocks.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/cohesive.blocks.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/cohesive.blocks.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,22 +0,0 @@
-
-R version 2.11.1 (2010-05-31)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## TODO
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/communities.R igraph-0.6.5/interfaces/R/tests/communities.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/communities.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/communities.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-F <- list("edge.betweenness.community", "fastgreedy.community",
-          "label.propagation.community", "leading.eigenvector.community",
-          "multilevel.community", "optimal.community", "spinglass.community",
-          "walktrap.community")
-
-karate <- graph.famous("Zachary")
-
-for (f in F) {
-  print(f)
-  f <- get(f)
-  comm <- f(karate)
-  
-  c1 <- abs(modularity(comm) - modularity(karate, membership(comm))) < 1e-9
-  
-  cc <- communities(comm)
-  c2 <- all(!duplicated(unlist(cc)))
-  
-  c3 <- all(unlist(cc) <= vcount(karate) & unlist(cc) >= 1)
-
-  c4 <- length(comm) == max(membership(comm))
-  
-  print(c(c1, c2, c3, c4))
-}
-
-fc <- fastgreedy.community(karate)
-modularity(karate, cutat(fc, no=1))
-modularity(karate, cutat(fc, no=2))
-modularity(karate, cutat(fc, no=3))
-modularity(karate, cutat(fc, no=4))
-
-crossing(fc, karate)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/communities.Rout.save igraph-0.6.5/interfaces/R/tests/communities.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/communities.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/communities.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,83 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> F <- list("edge.betweenness.community", "fastgreedy.community",
-+           "label.propagation.community", "leading.eigenvector.community",
-+           "multilevel.community", "optimal.community", "spinglass.community",
-+           "walktrap.community")
-> 
-> karate <- graph.famous("Zachary")
-> 
-> for (f in F) {
-+   print(f)
-+   f <- get(f)
-+   comm <- f(karate)
-+   
-+   c1 <- abs(modularity(comm) - modularity(karate, membership(comm))) < 1e-9
-+   
-+   cc <- communities(comm)
-+   c2 <- all(!duplicated(unlist(cc)))
-+   
-+   c3 <- all(unlist(cc) <= vcount(karate) & unlist(cc) >= 1)
-+ 
-+   c4 <- length(comm) == max(membership(comm))
-+   
-+   print(c(c1, c2, c3, c4))
-+ }
-[1] "edge.betweenness.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "fastgreedy.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "label.propagation.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "leading.eigenvector.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "multilevel.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "optimal.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "spinglass.community"
-[1] TRUE TRUE TRUE TRUE
-[1] "walktrap.community"
-[1] TRUE TRUE TRUE TRUE
-> 
-> fc <- fastgreedy.community(karate)
-> modularity(karate, cutat(fc, no=1))
-[1] 0
-> modularity(karate, cutat(fc, no=2))
-[1] 0.3717949
-> modularity(karate, cutat(fc, no=3))
-[1] 0.3806706
-> modularity(karate, cutat(fc, no=4))
-[1] 0.3759862
-> 
-> crossing(fc, karate)
- [1]  TRUE  TRUE  TRUE FALSE FALSE FALSE  TRUE  TRUE FALSE FALSE  TRUE  TRUE
-[13]  TRUE FALSE  TRUE  TRUE FALSE FALSE FALSE FALSE FALSE  TRUE FALSE  TRUE
-[25] FALSE FALSE  TRUE  TRUE  TRUE FALSE  TRUE FALSE FALSE FALSE FALSE FALSE
-[37] FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE  TRUE  TRUE FALSE FALSE
-[49] FALSE FALSE FALSE FALSE  TRUE FALSE FALSE FALSE FALSE FALSE FALSE FALSE
-[61] FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE
-[73] FALSE FALSE FALSE FALSE FALSE FALSE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/constraint.R igraph-0.6.5/interfaces/R/tests/constraint.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/constraint.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/constraint.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-
-library(igraph)
-
-constraint.orig <- function(graph, nodes=V(graph), attr=NULL) {
-  if (!is.igraph(graph)) {
-    stop("Not a graph object")
-  }
-  idx <- degree(graph) != 0
-  A <- get.adjacency(graph, attr=attr, sparse=FALSE)
-  A <- A[idx, idx]
-  n <- sum(idx)
-  
-  one <- c(rep(1,n))
-  CZ <- A + t(A)
-  cs <- CZ %*% one                      # degree of vertices
-  ics <- 1/cs
-  CS <- ics %*% t(one)                  # 1/degree of vertices
-  P <- CZ * CS  #intermediate result: proportionate tie strengths
-  PSQ <- P%*%P #sum paths of length two
-  P.bi <- as.numeric(P>0)  #exclude paths to non-contacts (& reflexive):
-  PC <- (P + (PSQ*P.bi))^2  #dyadic constraint
-  ci <- PC %*% one      #overall constraint
-  dim(ci) <- NULL
-
-  ci2 <- numeric(vcount(graph))
-  ci2[idx] <- ci
-  ci2[!idx] <- NaN
-  ci2[nodes]
-}
-
-karate <- graph.famous("Zachary")
-
-c1 <- constraint(karate)
-c2 <- constraint.orig(karate)
-max(abs(c1 - c2)) < 1e-14
-
-set.seed(42)
-E(karate)$weight <- sample(1:10, replace=TRUE, ecount(karate))
-wc1 <- constraint(karate)
-wc2 <- constraint.orig(karate, attr="weight")
-max(abs(wc1 - wc2)) < 1e-14
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/constraint.Rout.save igraph-0.6.5/interfaces/R/tests/constraint.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/constraint.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/constraint.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> constraint.orig <- function(graph, nodes=V(graph), attr=NULL) {
-+   if (!is.igraph(graph)) {
-+     stop("Not a graph object")
-+   }
-+   idx <- degree(graph) != 0
-+   A <- get.adjacency(graph, attr=attr, sparse=FALSE)
-+   A <- A[idx, idx]
-+   n <- sum(idx)
-+   
-+   one <- c(rep(1,n))
-+   CZ <- A + t(A)
-+   cs <- CZ %*% one                      # degree of vertices
-+   ics <- 1/cs
-+   CS <- ics %*% t(one)                  # 1/degree of vertices
-+   P <- CZ * CS  #intermediate result: proportionate tie strengths
-+   PSQ <- P%*%P #sum paths of length two
-+   P.bi <- as.numeric(P>0)  #exclude paths to non-contacts (& reflexive):
-+   PC <- (P + (PSQ*P.bi))^2  #dyadic constraint
-+   ci <- PC %*% one      #overall constraint
-+   dim(ci) <- NULL
-+ 
-+   ci2 <- numeric(vcount(graph))
-+   ci2[idx] <- ci
-+   ci2[!idx] <- NaN
-+   ci2[nodes]
-+ }
-> 
-> karate <- graph.famous("Zachary")
-> 
-> c1 <- constraint(karate)
-> c2 <- constraint.orig(karate)
-> max(abs(c1 - c2)) < 1e-14
-[1] TRUE
-> 
-> set.seed(42)
-> E(karate)$weight <- sample(1:10, replace=TRUE, ecount(karate))
-> wc1 <- constraint(karate)
-> wc2 <- constraint.orig(karate, attr="weight")
-> max(abs(wc1 - wc2)) < 1e-14
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/contract.vertices.R igraph-0.6.5/interfaces/R/tests/contract.vertices.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/contract.vertices.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/contract.vertices.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-set.seed(42)
-
-g <- graph.ring(10)
-g$name <- "Ring"
-V(g)$name <- letters[1:vcount(g)]
-E(g)$weight <- runif(ecount(g))
-E(g)$weight
-
-g2 <- contract.vertices(g, rep(1:5, each=2),
-                        vertex.attr.comb=toString)
-
-## graph and edge attributes are kept, vertex attributes are
-## combined using the 'toString' function.
-print(g2, g=TRUE, v=TRUE, e=TRUE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/contract.vertices.Rout.save igraph-0.6.5/interfaces/R/tests/contract.vertices.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/contract.vertices.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/contract.vertices.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,71 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> set.seed(42)
-> 
-> g <- graph.ring(10)
-> g$name <- "Ring"
-> V(g)$name <- letters[1:vcount(g)]
-> E(g)$weight <- runif(ecount(g))
-> E(g)$weight
- [1] 0.9148060 0.9370754 0.2861395 0.8304476 0.6417455 0.5190959 0.7365883
- [8] 0.1346666 0.6569923 0.7050648
-> 
-> g2 <- contract.vertices(g, rep(1:5, each=2),
-+                         vertex.attr.comb=toString)
-> 
-> ## graph and edge attributes are kept, vertex attributes are
-> ## combined using the 'toString' function.
-> print(g2, g=TRUE, v=TRUE, e=TRUE)
-IGRAPH UNW- 5 10 -- Ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ graph attributes:
-[[name]]
-[1] "Ring"
-[[mutual]]
-[1] FALSE
-[[circular]]
-[1] TRUE
-+ vertex attributes:
-    name
-[1] a, b
-[2] c, d
-[3] e, f
-[4] g, h
-[5] i, j
-+ edges (vertex names) and their attributes:
-           edge    weight
-[1]  a, b--a, b 0.9148060
-[2]  a, b--c, d 0.9370754
-[3]  c, d--c, d 0.2861395
-[4]  c, d--e, f 0.8304476
-[5]  e, f--e, f 0.6417455
-[6]  e, f--g, h 0.5190959
-[7]  g, h--g, h 0.7365883
-[8]  g, h--i, j 0.1346666
-[9]  i, j--i, j 0.6569923
-[10] a, b--i, j 0.7050648
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.296   0.039   0.344 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/count.multiple.R igraph-0.6.5/interfaces/R/tests/count.multiple.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/count.multiple.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/count.multiple.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,22 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-g <- barabasi.game(10, m=3, algorithm="bag")
-is.multiple(g)
-count.multiple(g)
-is.multiple(simplify(g))
-all(count.multiple(simplify(g)) == 1)
-     
-## Direction of the edge is important
-is.multiple(graph( c(1,2, 2,1) ))
-is.multiple(graph( c(1,2, 2,1), dir=FALSE ))
-
-## Remove multiple edges but keep multiplicity
-g <- barabasi.game(10, m=3, algorithm="bag")
-E(g)$weight <- 1
-g <- simplify(g)
-any(is.multiple(g))
-E(g)$weight
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/count.multiple.Rout.save igraph-0.6.5/interfaces/R/tests/count.multiple.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/count.multiple.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/count.multiple.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> g <- barabasi.game(10, m=3, algorithm="bag")
-> is.multiple(g)
- [1] FALSE  TRUE  TRUE FALSE  TRUE  TRUE FALSE FALSE FALSE FALSE FALSE  TRUE
-[13] FALSE FALSE  TRUE FALSE FALSE  TRUE FALSE FALSE FALSE FALSE FALSE FALSE
-[25] FALSE FALSE  TRUE
-> count.multiple(g)
- [1] 3 3 3 3 3 3 1 1 1 2 1 2 1 2 2 2 1 2 1 1 1 1 1 1 2 1 2
-> is.multiple(simplify(g))
- [1] FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE FALSE
-[13] FALSE FALSE FALSE FALSE FALSE FALSE FALSE
-> all(count.multiple(simplify(g)) == 1)
-[1] TRUE
->      
-> ## Direction of the edge is important
-> is.multiple(graph( c(1,2, 2,1) ))
-[1] FALSE FALSE
-> is.multiple(graph( c(1,2, 2,1), dir=FALSE ))
-[1] FALSE  TRUE
-> 
-> ## Remove multiple edges but keep multiplicity
-> g <- barabasi.game(10, m=3, algorithm="bag")
-> E(g)$weight <- 1
-> g <- simplify(g)
-> any(is.multiple(g))
-[1] FALSE
-> E(g)$weight
- [1] 3 2 1 2 1 3 2 1 2 1 2 1 1 1 1 1 1 1
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/decompose.graph.R igraph-0.6.5/interfaces/R/tests/decompose.graph.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/decompose.graph.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/decompose.graph.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(1000, 1/1500)
-G <- decompose.graph(g)
-clu <- clusters(g)
-Gsizes <- sapply(G, vcount)
-all(sort(clu$csize) == sort(Gsizes))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/decompose.graph.Rout.save igraph-0.6.5/interfaces/R/tests/decompose.graph.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/decompose.graph.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/decompose.graph.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(1000, 1/1500)
-> G <- decompose.graph(g)
-> clu <- clusters(g)
-> Gsizes <- sapply(G, vcount)
-> all(sort(clu$csize) == sort(Gsizes))
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/degree.R igraph-0.6.5/interfaces/R/tests/degree.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/degree.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/degree.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(100, 1/100)
-d <- degree(g)
-el <- get.edgelist(g)
-all(table(el)==d[d!=0])
-
-all(degree(g) / (vcount(g)-1) == degree(g, normalized=TRUE))
-
-g2 <- erdos.renyi.game(100, 2/100, dir=TRUE)
-din <- degree(g2, mode="in")
-dout <- degree(g2, mode="out")
-el2 <- get.edgelist(g2)
-all(table(el2[,1]) == dout[dout!=0])
-all(table(el2[,2]) == din[din!=0])
-
-all(degree(g2, mode="in") / (vcount(g2)-1) ==
-    degree(g2, mode="in", normalized=TRUE))
-all(degree(g2, mode="out") / (vcount(g2)-1) ==
-    degree(g2, mode="out", normalized=TRUE))
-all(degree(g2, mode="all") / (vcount(g2)-1) ==
-    degree(g2, mode="all", normalized=TRUE))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/degree.Rout.save igraph-0.6.5/interfaces/R/tests/degree.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/degree.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/degree.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(100, 1/100)
-> d <- degree(g)
-> el <- get.edgelist(g)
-> all(table(el)==d[d!=0])
-[1] TRUE
-> 
-> all(degree(g) / (vcount(g)-1) == degree(g, normalized=TRUE))
-[1] TRUE
-> 
-> g2 <- erdos.renyi.game(100, 2/100, dir=TRUE)
-> din <- degree(g2, mode="in")
-> dout <- degree(g2, mode="out")
-> el2 <- get.edgelist(g2)
-> all(table(el2[,1]) == dout[dout!=0])
-[1] TRUE
-> all(table(el2[,2]) == din[din!=0])
-[1] TRUE
-> 
-> all(degree(g2, mode="in") / (vcount(g2)-1) ==
-+     degree(g2, mode="in", normalized=TRUE))
-[1] TRUE
-> all(degree(g2, mode="out") / (vcount(g2)-1) ==
-+     degree(g2, mode="out", normalized=TRUE))
-[1] TRUE
-> all(degree(g2, mode="all") / (vcount(g2)-1) ==
-+     degree(g2, mode="all", normalized=TRUE))
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/degree.sequence.game.R igraph-0.6.5/interfaces/R/tests/degree.sequence.game.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/degree.sequence.game.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/degree.sequence.game.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-
-library(igraph)
-
-gc <- function(graph) {
-  clu <- clusters(graph)
-  induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-}
-
-g <- gc(erdos.renyi.game(1000, 2/1000))
-
-nG <- degree.sequence.game(degree(g), method="simple")
-all(degree(nG) == degree(g))
-
-nG <- degree.sequence.game(degree(g), method="vl")
-all(degree(nG) == degree(g))
-is.connected(nG)
-is.simple(nG)
-
-#####
-
-g <- erdos.renyi.game(1000, 1/1000)
-
-nG <- degree.sequence.game(degree(g), method="simple")
-all(degree(nG) == degree(g))
-
-g2 <- erdos.renyi.game(1000, 2/1000, dir=TRUE)
-
-nG2 <- degree.sequence.game(degree(g, mode="out"),
-                            degree(g, mode="in"),
-                            method="simple")
-all(degree(nG, mode="out") == degree(g, mode="out"))
-all(degree(nG, mode="in") == degree(g, mode="in"))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/degree.sequence.game.Rout.save igraph-0.6.5/interfaces/R/tests/degree.sequence.game.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/degree.sequence.game.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/degree.sequence.game.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> gc <- function(graph) {
-+   clu <- clusters(graph)
-+   induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-+ }
-> 
-> g <- gc(erdos.renyi.game(1000, 2/1000))
-> 
-> nG <- degree.sequence.game(degree(g), method="simple")
-> all(degree(nG) == degree(g))
-[1] TRUE
-> 
-> nG <- degree.sequence.game(degree(g), method="vl")
-> all(degree(nG) == degree(g))
-[1] TRUE
-> is.connected(nG)
-[1] TRUE
-> is.simple(nG)
-[1] TRUE
-> 
-> #####
-> 
-> g <- erdos.renyi.game(1000, 1/1000)
-> 
-> nG <- degree.sequence.game(degree(g), method="simple")
-> all(degree(nG) == degree(g))
-[1] TRUE
-> 
-> g2 <- erdos.renyi.game(1000, 2/1000, dir=TRUE)
-> 
-> nG2 <- degree.sequence.game(degree(g, mode="out"),
-+                             degree(g, mode="in"),
-+                             method="simple")
-> all(degree(nG, mode="out") == degree(g, mode="out"))
-[1] TRUE
-> all(degree(nG, mode="in") == degree(g, mode="in"))
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/delete.edges.R igraph-0.6.5/interfaces/R/tests/delete.edges.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/delete.edges.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/delete.edges.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.formula(A:B:C - D:E:F, D-E-F)
-g2 <- delete.edges(g, E(g, P=c("D", "E")))
-g2
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/delete.edges.Rout.save igraph-0.6.5/interfaces/R/tests/delete.edges.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/delete.edges.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/delete.edges.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.formula(A:B:C - D:E:F, D-E-F)
-> g2 <- delete.edges(g, E(g, P=c("D", "E")))
-> g2
-IGRAPH UN-- 6 10 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-A -- D, E, F
-B -- D, E, F
-C -- D, E, F
-D -- A, B, C
-E -- A, B, C, F
-F -- A, B, C, E
-> 
-> proc.time()
-   user  system elapsed 
-  0.295   0.038   0.335 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/delete.vertices.R igraph-0.6.5/interfaces/R/tests/delete.vertices.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/delete.vertices.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/delete.vertices.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-
-library(igraph)
-
-g <- graph.formula(A:B:C - D:E:F, D-E-F)
-
-g2 <- delete.vertices(g, "A")
-g3 <- delete.vertices(g, match("A", V(g)$name))
-
-graph.isomorphic(g2, g3)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/delete.vertices.Rout.save igraph-0.6.5/interfaces/R/tests/delete.vertices.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/delete.vertices.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/delete.vertices.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.formula(A:B:C - D:E:F, D-E-F)
-> 
-> g2 <- delete.vertices(g, "A")
-> g3 <- delete.vertices(g, match("A", V(g)$name))
-> 
-> graph.isomorphic(g2, g3)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/diameter.R igraph-0.6.5/interfaces/R/tests/diameter.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/diameter.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/diameter.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-
-library(igraph)
-
-gc <- function(graph) {
-  clu <- clusters(graph)
-  induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-}
-
-#### Undirected
-
-g <- gc(erdos.renyi.game(30, 3/30))
-sp <- shortest.paths(g)
-max(sp) == diameter(g)
-
-g <- gc(erdos.renyi.game(100, 1/100))
-sp <- shortest.paths(g)
-sp[sp==Inf] <- NA
-max(sp, na.rm=TRUE) == diameter(g)
-
-#### Directed
-
-g <- erdos.renyi.game(30, 3/30, dir=TRUE)
-sp <- shortest.paths(g, mode="out")
-sp[sp==Inf] <- NA
-max(sp, na.rm=TRUE) == diameter(g, unconnected=TRUE)
-
-#### Weighted
-
-E(g)$weight <- sample(1:10, ecount(g), replace=TRUE)
-sp <- shortest.paths(g, mode="out")
-sp[sp==Inf] <- NA
-max(sp, na.rm=TRUE) == diameter(g, unconnected=TRUE)
-
-#### Bug #680538
-
-g <- graph.tree(30, mode="undirected")
-E(g)$weight <- 2
-diameter(g, unconnected=FALSE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/diameter.Rout.save igraph-0.6.5/interfaces/R/tests/diameter.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/diameter.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/diameter.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> gc <- function(graph) {
-+   clu <- clusters(graph)
-+   induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-+ }
-> 
-> #### Undirected
-> 
-> g <- gc(erdos.renyi.game(30, 3/30))
-> sp <- shortest.paths(g)
-> max(sp) == diameter(g)
-[1] TRUE
-> 
-> g <- gc(erdos.renyi.game(100, 1/100))
-> sp <- shortest.paths(g)
-> sp[sp==Inf] <- NA
-> max(sp, na.rm=TRUE) == diameter(g)
-[1] TRUE
-> 
-> #### Directed
-> 
-> g <- erdos.renyi.game(30, 3/30, dir=TRUE)
-> sp <- shortest.paths(g, mode="out")
-> sp[sp==Inf] <- NA
-> max(sp, na.rm=TRUE) == diameter(g, unconnected=TRUE)
-[1] TRUE
-> 
-> #### Weighted
-> 
-> E(g)$weight <- sample(1:10, ecount(g), replace=TRUE)
-> sp <- shortest.paths(g, mode="out")
-> sp[sp==Inf] <- NA
-> max(sp, na.rm=TRUE) == diameter(g, unconnected=TRUE)
-[1] TRUE
-> 
-> #### Bug #680538
-> 
-> g <- graph.tree(30, mode="undirected")
-> E(g)$weight <- 2
-> diameter(g, unconnected=FALSE)
-[1] 16
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/dominator.tree.R igraph-0.6.5/interfaces/R/tests/dominator.tree.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/dominator.tree.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/dominator.tree.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.formula(R-+A:B:C, A-+D, B-+A:D:E, C-+F:G, D-+L,
-                   E-+H, F-+I, G-+I:J, H-+E:K, I-+K, J-+I,
-                   K-+I:R, L-+H)
-dtree <- dominator.tree(g, root="R")
-
-dtree$dom <- V(g)$name[ dtree$dom ]
-dtree$leftout <- V(g)$name[ dtree$leftout ]
-dtree
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/dominator.tree.Rout.save igraph-0.6.5/interfaces/R/tests/dominator.tree.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/dominator.tree.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/dominator.tree.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.formula(R-+A:B:C, A-+D, B-+A:D:E, C-+F:G, D-+L,
-+                    E-+H, F-+I, G-+I:J, H-+E:K, I-+K, J-+I,
-+                    K-+I:R, L-+H)
-> dtree <- dominator.tree(g, root="R")
-> 
-> dtree$dom <- V(g)$name[ dtree$dom ]
-> dtree$leftout <- V(g)$name[ dtree$leftout ]
-> dtree
-$dom
- [1] "R" "R" "R" "R" "R" "C" "C" "D" "R" "R" "G" "R"
-
-$domtree
-IGRAPH DN-- 13 12 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
- [1] R->A R->B R->C R->D R->E C->F C->G D->L R->H R->I G->J R->K
-
-$leftout
-character(0)
-
-> 
-> proc.time()
-   user  system elapsed 
-  0.300   0.038   0.340 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/dyad.census.R igraph-0.6.5/interfaces/R/tests/dyad.census.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/dyad.census.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/dyad.census.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-ce <- simplify(read.graph(gzfile("celegansneural.gml.gz"), format="gml"))
-dc <- dyad.census(ce)
-
-round(sum(is.mutual(ce))) == round(dc$mut * 2)
-round(ecount(as.undirected(ce, mode="collapse")) - dc$mut) == round(dc$asym)
-sum(unlist(dc)) == vcount(ce) * (vcount(ce)-1) / 2
-
-dc
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/dyad.census.Rout.save igraph-0.6.5/interfaces/R/tests/dyad.census.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/dyad.census.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/dyad.census.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ce <- simplify(read.graph(gzfile("celegansneural.gml.gz"), format="gml"))
-> dc <- dyad.census(ce)
-> 
-> round(sum(is.mutual(ce))) == round(dc$mut * 2)
-[1] TRUE
-> round(ecount(as.undirected(ce, mode="collapse")) - dc$mut) == round(dc$asym)
-[1] TRUE
-> sum(unlist(dc)) == vcount(ce) * (vcount(ce)-1) / 2
-[1] TRUE
-> 
-> dc
-$mut
-[1] 197
-
-$asym
-[1] 1951
-
-$null
-[1] 41808
-
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.R igraph-0.6.5/interfaces/R/tests/edge.betweenness.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.betweenness.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-library(igraph)
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-
-bet <- betweenness(kite)
-ebet <- edge.betweenness(kite)
-
-bet2 <- sapply(1:vcount(kite), function(x) {
-  ae <- E(kite)[ adj(x) ]
-  (sum(ebet[ae])-vcount(kite)+1) / 2
-})
-
-max(abs(bet - bet2)) < 1e-14
-
-#### Weighted
-
-E(kite)$weight <- sample(1:10, ecount(kite), replace=TRUE)
-
-bet <- betweenness(kite)
-ebet <- edge.betweenness(kite)
-bet2 <- sapply(1:vcount(kite), function(x) {
-  ae <- E(kite)[ adj(x) ]
-  (sum(ebet[ae])-vcount(kite)+1) / 2
-})
-
-max(abs(bet - bet2)) < 1e-14
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.Rout.save igraph-0.6.5/interfaces/R/tests/edge.betweenness.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.betweenness.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> 
-> bet <- betweenness(kite)
-> ebet <- edge.betweenness(kite)
-> 
-> bet2 <- sapply(1:vcount(kite), function(x) {
-+   ae <- E(kite)[ adj(x) ]
-+   (sum(ebet[ae])-vcount(kite)+1) / 2
-+ })
-> 
-> max(abs(bet - bet2)) < 1e-14
-[1] TRUE
-> 
-> #### Weighted
-> 
-> E(kite)$weight <- sample(1:10, ecount(kite), replace=TRUE)
-> 
-> bet <- betweenness(kite)
-> ebet <- edge.betweenness(kite)
-> bet2 <- sapply(1:vcount(kite), function(x) {
-+   ae <- E(kite)[ adj(x) ]
-+   (sum(ebet[ae])-vcount(kite)+1) / 2
-+ })
-> 
-> max(abs(bet - bet2)) < 1e-14
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.community.R igraph-0.6.5/interfaces/R/tests/edge.betweenness.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.betweenness.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,16 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-ebc <- edge.betweenness.community(g)
-abs(max(ebc$modularity) - modularity(g, ebc$membership)) < 1e-14
-ebc
-membership(ebc)
-length(ebc)
-sizes(ebc)
-d <- as.dendrogram(ebc)
-d
-d[[1]]
-d[[2]]
-m2 <- cutat(ebc, no=3)
-abs(modularity(g, m2) - ebc$modularity[length(ebc$modularity)-2]) < 1e-14
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.community.Rout.save igraph-0.6.5/interfaces/R/tests/edge.betweenness.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.betweenness.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.betweenness.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-
-R version 2.14.1 (2011-12-22)
-Copyright (C) 2011 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> ebc <- edge.betweenness.community(g)
-> abs(max(ebc$modularity) - modularity(g, ebc$membership)) < 1e-14
-[1] TRUE
-> ebc
-Graph community structure calculated with the edge betweenness algorithm
-Number of communities (best split): 5 
-Modularity (best split): 0.4012985 
-Membership vector:
- [1] 1 1 2 1 3 3 3 1 4 5 3 1 1 1 4 4 3 1 4 1 4 1 4 4 2 2 4 2 2 4 4 2 4 4
-> membership(ebc)
- [1] 1 1 2 1 3 3 3 1 4 5 3 1 1 1 4 4 3 1 4 1 4 1 4 4 2 2 4 2 2 4 4 2 4 4
-> length(ebc)
-[1] 5
-> sizes(ebc)
-Community sizes
- 1  2  3  4  5 
-10  6  5 12  1 
-> d <- as.dendrogram(ebc)
-> d
-'dendrogram' with 2 branches and 34 members total, at height 33 
-> d[[1]]
-'dendrogram' with 2 branches and 15 members total, at height 31 
-> d[[2]]
-'dendrogram' with 2 branches and 19 members total, at height 32 
-> m2 <- cutat(ebc, no=3)
-> abs(modularity(g, m2) - ebc$modularity[length(ebc$modularity)-2]) < 1e-14
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.connectivity.R igraph-0.6.5/interfaces/R/tests/edge.connectivity.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.connectivity.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.connectivity.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-library(igraph)
-
-gc <- function(graph) {
-  clu <- clusters(graph)
-  induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-}
-
-g <- gc(erdos.renyi.game(30, 8/30))
-ec <- edge.connectivity(g)
-ecST <- Inf
-for (j in 1:(vcount(g)-1)) {
-  for (k in (j+1):vcount(g)) {
-    ec2 <- edge.connectivity(g, source=j, target=k)
-    if (ec2 < ecST) { ecST <- ec2 }
-  } 
-}
-ec == ecST
-
-####
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-edge.connectivity(kite, source="Heather", target="Andre")
-edge.connectivity(kite, source="Garth", target="Andre")
-edge.connectivity(kite, source="Garth", target="Ike")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edge.connectivity.Rout.save igraph-0.6.5/interfaces/R/tests/edge.connectivity.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/edge.connectivity.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edge.connectivity.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> gc <- function(graph) {
-+   clu <- clusters(graph)
-+   induced.subgraph(graph, which(clu$membership==which.max(clu$csize)))
-+ }
-> 
-> g <- gc(erdos.renyi.game(30, 8/30))
-> ec <- edge.connectivity(g)
-> ecST <- Inf
-> for (j in 1:(vcount(g)-1)) {
-+   for (k in (j+1):vcount(g)) {
-+     ec2 <- edge.connectivity(g, source=j, target=k)
-+     if (ec2 < ecST) { ecST <- ec2 }
-+   } 
-+ }
-> ec == ecST
-[1] TRUE
-> 
-> ####
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> edge.connectivity(kite, source="Heather", target="Andre")
-[1] 2
-> edge.connectivity(kite, source="Garth", target="Andre")
-[1] 4
-> edge.connectivity(kite, source="Garth", target="Ike")
-[1] 1
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edgenames.R igraph-0.6.5/interfaces/R/tests/edgenames.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/edgenames.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edgenames.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-## named edges
-igraph.options(print.edge.attributes = TRUE)
-g <- graph.ring(10)
-E(g)$name <- letters[1:ecount(g)]
-delete.edges(g, c("b", "d", "e"))
-
-## named vertices
-g <- graph.ring(10)
-V(g)$name <- letters[1:vcount(g)]
-delete.edges(g, c("a|b", "f|g", "c|b"))
-
-## no names at all, but select edges based on vertices
-g <- graph.ring(10)
-delete.edges(g, c("1|2", "8|7", "1|10"))
-
-## mix edge names and vertex names
-g <- graph.ring(10)
-V(g)$name <- letters[1:vcount(g)]
-E(g)$name <- LETTERS[1:ecount(g)]
-delete.edges(g, c("a|b", "F", "j|i"))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/edgenames.Rout.save igraph-0.6.5/interfaces/R/tests/edgenames.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/edgenames.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/edgenames.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,76 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> ## named edges
-> igraph.options(print.edge.attributes = TRUE)
-> g <- graph.ring(10)
-> E(g)$name <- letters[1:ecount(g)]
-> delete.edges(g, c("b", "d", "e"))
-IGRAPH U--- 10 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (e/c)
-+ edges and their attributes:
-        edge
-['a']  1-- 2
-['c']  3-- 4
-['f']  6-- 7
-['g']  7-- 8
-['h']  8-- 9
-['i']  9--10
-['j']  1--10
-> 
-> ## named vertices
-> g <- graph.ring(10)
-> V(g)$name <- letters[1:vcount(g)]
-> delete.edges(g, c("a|b", "f|g", "c|b"))
-IGRAPH UN-- 10 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-+ edges (vertex names):
-[1] c--d d--e e--f g--h h--i i--j a--j
-> 
-> ## no names at all, but select edges based on vertices
-> g <- graph.ring(10)
-> delete.edges(g, c("1|2", "8|7", "1|10"))
-IGRAPH U--- 10 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x)
-+ edges:
-[1] 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 8-- 9 9--10
-> 
-> ## mix edge names and vertex names
-> g <- graph.ring(10)
-> V(g)$name <- letters[1:vcount(g)]
-> E(g)$name <- LETTERS[1:ecount(g)]
-> delete.edges(g, c("a|b", "F", "j|i"))
-IGRAPH UN-- 10 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), name
-  (e/c)
-+ edges (vertex names) and their attributes:
-      edge
-['B'] b--c
-['C'] c--d
-['D'] d--e
-['E'] e--f
-['G'] g--h
-['H'] h--i
-['J'] a--j
-> 
-> proc.time()
-   user  system elapsed 
-  0.307   0.039   0.351 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/evcent.R igraph-0.6.5/interfaces/R/tests/evcent.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/evcent.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/evcent.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-
-library(igraph)
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-round(evcent(kite)$vector, 3)
-
-## Eigenvector-centrality, small stress-test
-
-is.principal <- function(M, lambda, eps=1e-12) {
-  abs(eigen(M)$values[1] - lambda) < eps
-}
-
-is.ev <- function(M, v, lambda, eps=1e-12) {
-  max(abs(M %*% v - lambda * v)) < eps
-}
-
-is.good <- function(M, v, lambda, eps=1e-12) {
-  is.principal(M, lambda, eps) && is.ev(M, v, lambda, eps)
-}
-
-for (i in 1:1000) {
-  G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-  ev <- evcent(G)
-  if (!is.good(get.adjacency(G, sparse=FALSE), ev$vector, ev$value)) {
-    print("Foobar!")
-    break
-  }
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/evcent.Rout.save igraph-0.6.5/interfaces/R/tests/evcent.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/evcent.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/evcent.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> round(evcent(kite)$vector, 3)
-   Andre  Beverly    Carol    Diane Fernando       Ed    Garth  Heather 
-   0.732    0.732    0.594    1.000    0.827    0.594    0.827    0.407 
-     Ike     Jane 
-   0.100    0.023 
-> 
-> ## Eigenvector-centrality, small stress-test
-> 
-> is.principal <- function(M, lambda, eps=1e-12) {
-+   abs(eigen(M)$values[1] - lambda) < eps
-+ }
-> 
-> is.ev <- function(M, v, lambda, eps=1e-12) {
-+   max(abs(M %*% v - lambda * v)) < eps
-+ }
-> 
-> is.good <- function(M, v, lambda, eps=1e-12) {
-+   is.principal(M, lambda, eps) && is.ev(M, v, lambda, eps)
-+ }
-> 
-> for (i in 1:1000) {
-+   G <- erdos.renyi.game(10, sample(1:20, 1), type="gnm")
-+   ev <- evcent(G)
-+   if (!is.good(get.adjacency(G, sparse=FALSE), ev$vector, ev$value)) {
-+     print("Foobar!")
-+     break
-+   }
-+ }
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  1.333   0.144   1.462 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/fartherst.nodes.R igraph-0.6.5/interfaces/R/tests/fartherst.nodes.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/fartherst.nodes.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/fartherst.nodes.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-
-library(igraph)
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-
-fn <- farthest.nodes(kite)
-fn
-
-shortest.paths(kite, v=fn[1], to=fn[2]) == fn[3]
-diameter(kite) == fn[3]
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/fartherst.nodes.Rout.save igraph-0.6.5/interfaces/R/tests/fartherst.nodes.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/fartherst.nodes.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/fartherst.nodes.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> 
-> fn <- farthest.nodes(kite)
-> fn
-[1]  1 10  4
-> 
-> shortest.paths(kite, v=fn[1], to=fn[2]) == fn[3]
-      Jane
-Andre TRUE
-> diameter(kite) == fn[3]
-[1] TRUE
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.295   0.040   0.321 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/fastgreedy.community.R igraph-0.6.5/interfaces/R/tests/fastgreedy.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/fastgreedy.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/fastgreedy.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-g <- graph.famous("Zachary")
-fc <- fastgreedy.community(g)
-fc
-abs(modularity(g, fc$membership) - max(fc$modularity)) < 1e-14
-membership(fc)
-length(fc)
-sizes(fc)
-d <- as.dendrogram(fc)
-d
-d[[1]]
-d[[2]]
-m2 <- cutat(fc, no=3)
-abs(modularity(g, m2) - fc$modularity[length(fc$modularity)-2]) < 1e-14
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/fastgreedy.community.Rout.save igraph-0.6.5/interfaces/R/tests/fastgreedy.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/fastgreedy.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/fastgreedy.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,52 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> g <- graph.famous("Zachary")
-> fc <- fastgreedy.community(g)
-> fc
-Graph community structure calculated with the fast greedy algorithm
-Number of communities (best split): 3 
-Modularity (best split): 0.3806706 
-Membership vector:
- [1] 1 3 3 3 1 1 1 3 2 3 1 1 3 3 2 2 1 3 2 1 2 3 2 2 2 2 2 2 2 2 2 2 2 2
-> abs(modularity(g, fc$membership) - max(fc$modularity)) < 1e-14
-[1] TRUE
-> membership(fc)
- [1] 1 3 3 3 1 1 1 3 2 3 1 1 3 3 2 2 1 3 2 1 2 3 2 2 2 2 2 2 2 2 2 2 2 2
-> length(fc)
-[1] 3
-> sizes(fc)
-Community sizes
- 1  2  3 
- 8 17  9 
-> d <- as.dendrogram(fc)
-> d
-'dendrogram' with 2 branches and 34 members total, at height 33 
-> d[[1]]
-'dendrogram' with 2 branches and 17 members total, at height 32 
-> d[[2]]
-'dendrogram' with 2 branches and 17 members total, at height 30 
-> m2 <- cutat(fc, no=3)
-> abs(modularity(g, m2) - fc$modularity[length(fc$modularity)-2]) < 1e-14
-[1] TRUE
-> 
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/tests/football.gml.gz and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/tests/football.gml.gz differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/forestfire.R igraph-0.6.5/interfaces/R/tests/forestfire.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/forestfire.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/forestfire.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-pars <- list(sparse=c(0.35, 0.2/0.35),
-             densifying=c(0.37, 0.32/0.37),
-             dense=c(0.38, 0.38/0.37))
-
-N <- 5000
-G <- lapply(pars, function(x) forest.fire.game(N, fw=x[1], bw=x[2]))
-
-xv <- log(2:N)
-
-co <- sapply(G, function(x) {
-  yv <- log(cumsum(degree(x, mode="out"))[-1])
-  coef(lm( yv ~ xv ))[2]
-})
-
-co
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/forestfire.Rout.save igraph-0.6.5/interfaces/R/tests/forestfire.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/forestfire.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/forestfire.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> pars <- list(sparse=c(0.35, 0.2/0.35),
-+              densifying=c(0.37, 0.32/0.37),
-+              dense=c(0.38, 0.38/0.37))
-> 
-> N <- 5000
-> G <- lapply(pars, function(x) forest.fire.game(N, fw=x[1], bw=x[2]))
-> 
-> xv <- log(2:N)
-> 
-> co <- sapply(G, function(x) {
-+   yv <- log(cumsum(degree(x, mode="out"))[-1])
-+   coef(lm( yv ~ xv ))[2]
-+ })
-> 
-> co
-    sparse.xv densifying.xv      dense.xv 
-     1.060455      1.228010      1.962341 
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.adjacency.R igraph-0.6.5/interfaces/R/tests/get.adjacency.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.adjacency.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.adjacency.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 1/50)
-A <- get.adjacency(g, sparse=FALSE)
-g2 <- graph.adjacency(A, mode="undirected")
-graph.isomorphic(g, g2)
-
-###
-
-A <- get.adjacency(g, sparse=TRUE)
-g2 <- graph.adjacency(A, mode="undirected")
-graph.isomorphic(g, g2)
-
-###
-
-g <- erdos.renyi.game(50, 2/50, directed=TRUE)
-A <- get.adjacency(g, sparse=FALSE)
-g2 <- graph.adjacency(A)
-graph.isomorphic(g, g2)
-
-###
-
-A <- get.adjacency(g, sparse=TRUE)
-g2 <- graph.adjacency(A)
-graph.isomorphic(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.adjacency.Rout.save igraph-0.6.5/interfaces/R/tests/get.adjacency.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.adjacency.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.adjacency.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,55 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 1/50)
-> A <- get.adjacency(g, sparse=FALSE)
-> g2 <- graph.adjacency(A, mode="undirected")
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ###
-> 
-> A <- get.adjacency(g, sparse=TRUE)
-Loading required package: Matrix
-Loading required package: lattice
-> g2 <- graph.adjacency(A, mode="undirected")
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ###
-> 
-> g <- erdos.renyi.game(50, 2/50, directed=TRUE)
-> A <- get.adjacency(g, sparse=FALSE)
-> g2 <- graph.adjacency(A)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ###
-> 
-> A <- get.adjacency(g, sparse=TRUE)
-> g2 <- graph.adjacency(A)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  2.767   0.094   2.848 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.adjlist.R igraph-0.6.5/interfaces/R/tests/get.adjlist.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.adjlist.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.adjlist.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 2/50)
-al <- get.adjlist(g)
-g2 <- graph.adjlist(al, mode="all")
-graph.isomorphic(g, g2)
-graph.isomorphic.vf2(g, g2, vertex.color1=1:vcount(g),
-                     vertex.color2=1:vcount(g2))
-
-####
-
-el <- get.adjedgelist(g)
-for (i in 1:vcount(g)) {
-  a <- as.numeric(E(g)[adj(i)])
-  if (length(a) != length(el[[i]]) ||
-      any(sort(el[[i]]) != sort(a))) { print("Foobar!"); break; }
-}
-
-g <- erdos.renyi.game(50, 4/50, directed=TRUE)
-el1 <- get.adjedgelist(g, mode="out")
-el2 <- get.adjedgelist(g, mode="in")
-for (i in 1:vcount(g)) {
-  a <- as.numeric(E(g)[from(i)])
-  if (length(a) != length(el1[[i]]) ||
-      any(sort(el1[[i]]) != sort(a))) { print("Foobar!"); break; }
-}
-for (i in 1:vcount(g)) {
-  a <- as.numeric(E(g)[to(i)])
-  if (length(a) != length(el2[[i]]) ||
-      any(sort(el2[[i]]) != sort(a))) { print("Foobar!"); break; }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.adjlist.Rout.save igraph-0.6.5/interfaces/R/tests/get.adjlist.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.adjlist.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.adjlist.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,63 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 2/50)
-> al <- get.adjlist(g)
-> g2 <- graph.adjlist(al, mode="all")
-> graph.isomorphic(g, g2)
-[1] TRUE
-> graph.isomorphic.vf2(g, g2, vertex.color1=1:vcount(g),
-+                      vertex.color2=1:vcount(g2))
-$iso
-[1] TRUE
-
-$map12
- [1]  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
-[26] 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
-
-$map21
- [1]  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
-[26] 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
-
-> 
-> ####
-> 
-> el <- get.adjedgelist(g)
-> for (i in 1:vcount(g)) {
-+   a <- as.numeric(E(g)[adj(i)])
-+   if (length(a) != length(el[[i]]) ||
-+       any(sort(el[[i]]) != sort(a))) { print("Foobar!"); break; }
-+ }
-> 
-> g <- erdos.renyi.game(50, 4/50, directed=TRUE)
-> el1 <- get.adjedgelist(g, mode="out")
-> el2 <- get.adjedgelist(g, mode="in")
-> for (i in 1:vcount(g)) {
-+   a <- as.numeric(E(g)[from(i)])
-+   if (length(a) != length(el1[[i]]) ||
-+       any(sort(el1[[i]]) != sort(a))) { print("Foobar!"); break; }
-+ }
-> for (i in 1:vcount(g)) {
-+   a <- as.numeric(E(g)[to(i)])
-+   if (length(a) != length(el2[[i]]) ||
-+       any(sort(el2[[i]]) != sort(a))) { print("Foobar!"); break; }
-+ }
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.all.shortest.paths.R igraph-0.6.5/interfaces/R/tests/get.all.shortest.paths.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.all.shortest.paths.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.all.shortest.paths.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-library(igraph)
-
-edges <- matrix(c("s", "a", 2,
-                  "s", "b", 4,
-                  "a", "t", 4,
-                  "b", "t", 2,
-                  "a", "1", 1,
-                  "a", "2", 1,
-                  "a", "3", 2,
-                  "1", "b", 1,
-                  "2", "b", 2,
-                  "3", "b", 1),
-                byrow=TRUE, ncol=3,
-                dimnames=list(NULL, c("from", "to", "weight")))
-edges <- as.data.frame(edges)
-edges[[3]] <- as.numeric(as.character(edges[[3]]))
-
-g <- graph.data.frame(as.data.frame(edges))
-
-get.all.shortest.paths(g, "s", "t", weights=NA)
-get.all.shortest.paths(g, "s", "t")
-
-## TODO
-
-## E(g)$weight <- E(g)$weight - 1
-## get.all.shortest.paths(g, "s", "t")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.all.shortest.paths.Rout.save igraph-0.6.5/interfaces/R/tests/get.all.shortest.paths.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.all.shortest.paths.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.all.shortest.paths.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> edges <- matrix(c("s", "a", 2,
-+                   "s", "b", 4,
-+                   "a", "t", 4,
-+                   "b", "t", 2,
-+                   "a", "1", 1,
-+                   "a", "2", 1,
-+                   "a", "3", 2,
-+                   "1", "b", 1,
-+                   "2", "b", 2,
-+                   "3", "b", 1),
-+                 byrow=TRUE, ncol=3,
-+                 dimnames=list(NULL, c("from", "to", "weight")))
-> edges <- as.data.frame(edges)
-> edges[[3]] <- as.numeric(as.character(edges[[3]]))
-> 
-> g <- graph.data.frame(as.data.frame(edges))
-> 
-> get.all.shortest.paths(g, "s", "t", weights=NA)
-$res
-$res[[1]]
-[1] 1 3 7
-
-$res[[2]]
-[1] 1 2 7
-
-
-$nrgeo
-[1] 1 1 1 1 1 1 2
-
-> get.all.shortest.paths(g, "s", "t")
-$res
-$res[[1]]
-[1] 1 2 7
-
-$res[[2]]
-[1] 1 3 7
-
-$res[[3]]
-[1] 1 2 4 3 7
-
-
-$nrgeo
-[1] 1 1 2 1 1 1 3
-
-> 
-> ## TODO
-> 
-> ## E(g)$weight <- E(g)$weight - 1
-> ## get.all.shortest.paths(g, "s", "t")
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.diameter.R igraph-0.6.5/interfaces/R/tests/get.diameter.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.diameter.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.diameter.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-
-library(igraph)
-
-g <- graph.ring(10)
-E(g)$weight <- sample(seq_len(ecount(g)))
-d <- diameter(g)
-gd <- get.diameter(g)
-sp <- shortest.paths(g)
-
-d == max(sp)
-sp[ gd[1], gd[length(gd)] ] == d
-
-d <- diameter(g, weights=NA)
-gd <- get.diameter(g, weights=NA)
-sp <- shortest.paths(g, weights=NA)
-
-d == max(sp)
-length(gd) == d + 1
-sp[ gd[1], gd[length(gd)] ] == d
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.diameter.Rout.save igraph-0.6.5/interfaces/R/tests/get.diameter.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.diameter.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.diameter.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.ring(10)
-> E(g)$weight <- sample(seq_len(ecount(g)))
-> d <- diameter(g)
-> gd <- get.diameter(g)
-> sp <- shortest.paths(g)
-> 
-> d == max(sp)
-[1] TRUE
-> sp[ gd[1], gd[length(gd)] ] == d
-[1] TRUE
-> 
-> d <- diameter(g, weights=NA)
-> gd <- get.diameter(g, weights=NA)
-> sp <- shortest.paths(g, weights=NA)
-> 
-> d == max(sp)
-[1] TRUE
-> length(gd) == d + 1
-[1] TRUE
-> sp[ gd[1], gd[length(gd)] ] == d
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.edge.R igraph-0.6.5/interfaces/R/tests/get.edge.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.edge.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.edge.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(100, 3/100)
-edges <- unlist(lapply(seq_len(ecount(g)), get.edge, graph=g))
-g2 <- graph(edges, dir=FALSE, n=vcount(g))
-graph.isomorphic(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.edge.Rout.save igraph-0.6.5/interfaces/R/tests/get.edge.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.edge.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.edge.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(100, 3/100)
-> edges <- unlist(lapply(seq_len(ecount(g)), get.edge, graph=g))
-> g2 <- graph(edges, dir=FALSE, n=vcount(g))
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.edgelist.R igraph-0.6.5/interfaces/R/tests/get.edgelist.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.edgelist.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.edgelist.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(100, 3/100)
-e <- get.edgelist(g)
-g2 <- graph(t(e), n=vcount(g), dir=FALSE)
-graph.isomorphic(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.edgelist.Rout.save igraph-0.6.5/interfaces/R/tests/get.edgelist.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.edgelist.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.edgelist.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(100, 3/100)
-> e <- get.edgelist(g)
-> g2 <- graph(t(e), n=vcount(g), dir=FALSE)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.incidence.R igraph-0.6.5/interfaces/R/tests/get.incidence.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.incidence.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.incidence.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph)
-
-## Dense
-
-I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-g <- graph.incidence(I)
-I2 <- get.incidence(g)
-all(I==I2)
-all(rownames(I2) == 1:7)
-all(colnames(I2) == 8:12)
-
-## Sparse
-
-I3 <- get.incidence(g, sparse=TRUE)
-all(I==I3)
-all(rownames(I3) == 1:7)
-all(colnames(I3) == 8:12)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.incidence.Rout.save igraph-0.6.5/interfaces/R/tests/get.incidence.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.incidence.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.incidence.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Dense
-> 
-> I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-> g <- graph.incidence(I)
-> I2 <- get.incidence(g)
-> all(I==I2)
-[1] TRUE
-> all(rownames(I2) == 1:7)
-[1] TRUE
-> all(colnames(I2) == 8:12)
-[1] TRUE
-> 
-> ## Sparse
-> 
-> I3 <- get.incidence(g, sparse=TRUE)
-Loading required package: Matrix
-Loading required package: lattice
-> all(I==I3)
-[1] TRUE
-> all(rownames(I3) == 1:7)
-[1] TRUE
-> all(colnames(I3) == 8:12)
-[1] TRUE
-> 
-> proc.time()
-   user  system elapsed 
-  2.773   0.094   2.854 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.shortest.paths.R igraph-0.6.5/interfaces/R/tests/get.shortest.paths.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.shortest.paths.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.shortest.paths.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,29 +0,0 @@
-
-library(igraph)
-
-edges <- matrix(c("s", "a", 2,
-                  "s", "b", 4,
-                  "a", "t", 4,
-                  "b", "t", 2,
-                  "a", "1", 1,
-                  "a", "2", 1,
-                  "a", "3", 2,
-                  "1", "b", 1,
-                  "2", "b", 2,
-                  "3", "b", 1),
-                byrow=TRUE, ncol=3,
-                dimnames=list(NULL, c("from", "to", "weight")))
-edges <- as.data.frame(edges)
-edges[[3]] <- as.numeric(as.character(edges[[3]]))
-
-g <- graph.data.frame(as.data.frame(edges))
-
-all1 <- get.all.shortest.paths(g, "s", "t", weights=NA)$res
-all2 <- get.all.shortest.paths(g, "s", "t")$res
-
-s1 <- get.shortest.paths(g, "s", "t", weights=NA)
-s2 <- get.shortest.paths(g, "s", "t")
-
-s1 %in% all1
-s2 %in% all2
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/get.shortest.paths.Rout.save igraph-0.6.5/interfaces/R/tests/get.shortest.paths.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/get.shortest.paths.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/get.shortest.paths.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> edges <- matrix(c("s", "a", 2,
-+                   "s", "b", 4,
-+                   "a", "t", 4,
-+                   "b", "t", 2,
-+                   "a", "1", 1,
-+                   "a", "2", 1,
-+                   "a", "3", 2,
-+                   "1", "b", 1,
-+                   "2", "b", 2,
-+                   "3", "b", 1),
-+                 byrow=TRUE, ncol=3,
-+                 dimnames=list(NULL, c("from", "to", "weight")))
-> edges <- as.data.frame(edges)
-> edges[[3]] <- as.numeric(as.character(edges[[3]]))
-> 
-> g <- graph.data.frame(as.data.frame(edges))
-> 
-> all1 <- get.all.shortest.paths(g, "s", "t", weights=NA)$res
-> all2 <- get.all.shortest.paths(g, "s", "t")$res
-> 
-> s1 <- get.shortest.paths(g, "s", "t", weights=NA)
-> s2 <- get.shortest.paths(g, "s", "t")
-> 
-> s1 %in% all1
-[1] TRUE
-> s2 %in% all2
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/girth.R igraph-0.6.5/interfaces/R/tests/girth.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/girth.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/girth.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-## No circle in a tree
-g <- graph.tree(1000, 3)
-girth(g)
-
-## The worst case running time is for a ring
-g <- graph.ring(100)
-girth(g)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/girth.Rout.save igraph-0.6.5/interfaces/R/tests/girth.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/girth.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/girth.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## No circle in a tree
-> g <- graph.tree(1000, 3)
-> girth(g)
-$girth
-[1] 0
-
-$circle
-numeric(0)
-
-> 
-> ## The worst case running time is for a ring
-> g <- graph.ring(100)
-> girth(g)
-$girth
-[1] 100
-
-$circle
-  [1]  51  52  53  54  55  56  57  58  59  60  61  62  63  64  65  66  67  68
- [19]  69  70  71  72  73  74  75  76  77  78  79  80  81  82  83  84  85  86
- [37]  87  88  89  90  91  92  93  94  95  96  97  98  99 100   1   2   3   4
- [55]   5   6   7   8   9  10  11  12  13  14  15  16  17  18  19  20  21  22
- [73]  23  24  25  26  27  28  29  30  31  32  33  34  35  36  37  38  39  40
- [91]  41  42  43  44  45  46  47  48  49  50
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adhesion.R igraph-0.6.5/interfaces/R/tests/graph.adhesion.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adhesion.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adhesion.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-graph.adhesion(g)
-graph.cohesion(g)
-
-kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-                      Beverly  - Andre:Diane:Ed:Garth,
-                      Carol    - Andre:Diane:Fernando,
-                      Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-                      Ed       - Beverly:Diane:Garth,
-                      Fernando - Andre:Carol:Diane:Garth:Heather,
-                      Garth    - Beverly:Diane:Ed:Fernando:Heather,
-                      Heather  - Fernando:Garth:Ike,
-                      Ike      - Heather:Jane,
-                      Jane     - Ike)
-kite <- simplify(kite)
-graph.adhesion(kite)
-graph.cohesion(kite)
-
-camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-                      Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-                      Holly   - Carol:Pat:Pam:Jennie:Bill,
-                      Bill    - Pauline:Michael:Lee:Holly,
-                      Pauline - Bill:Jennie:Ann,
-                      Jennie  - Holly:Michael:Lee:Ann:Pauline,
-                      Michael - Bill:Jennie:Ann:Lee:John,
-                      Ann     - Michael:Jennie:Pauline,
-                      Lee     - Michael:Bill:Jennie,
-                      Gery    - Pat:Steve:Russ:John,
-                      Russ    - Steve:Bert:Gery:John,
-                      John    - Gery:Russ:Michael)
-camp <- simplify(camp)
-graph.adhesion(camp)
-graph.cohesion(camp)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adhesion.Rout.save igraph-0.6.5/interfaces/R/tests/graph.adhesion.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adhesion.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adhesion.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> graph.adhesion(g)
-[1] 1
-> graph.cohesion(g)
-[1] 1
-> 
-> kite <- graph.formula(Andre    - Beverly:Carol:Diane:Fernando,
-+                       Beverly  - Andre:Diane:Ed:Garth,
-+                       Carol    - Andre:Diane:Fernando,
-+                       Diane    - Andre:Beverly:Carol:Ed:Fernando:Garth,
-+                       Ed       - Beverly:Diane:Garth,
-+                       Fernando - Andre:Carol:Diane:Garth:Heather,
-+                       Garth    - Beverly:Diane:Ed:Fernando:Heather,
-+                       Heather  - Fernando:Garth:Ike,
-+                       Ike      - Heather:Jane,
-+                       Jane     - Ike)
-> kite <- simplify(kite)
-> graph.adhesion(kite)
-[1] 1
-> graph.cohesion(kite)
-[1] 1
-> 
-> camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-+                       Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-+                       Holly   - Carol:Pat:Pam:Jennie:Bill,
-+                       Bill    - Pauline:Michael:Lee:Holly,
-+                       Pauline - Bill:Jennie:Ann,
-+                       Jennie  - Holly:Michael:Lee:Ann:Pauline,
-+                       Michael - Bill:Jennie:Ann:Lee:John,
-+                       Ann     - Michael:Jennie:Pauline,
-+                       Lee     - Michael:Bill:Jennie,
-+                       Gery    - Pat:Steve:Russ:John,
-+                       Russ    - Steve:Bert:Gery:John,
-+                       John    - Gery:Russ:Michael)
-> camp <- simplify(camp)
-> graph.adhesion(camp)
-[1] 2
-> graph.cohesion(camp)
-[1] 2
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjacency.R igraph-0.6.5/interfaces/R/tests/graph.adjacency.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjacency.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adjacency.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,118 +0,0 @@
-
-# sink("graph.adjacency.Rout.save")
-
-library(igraph)
-
-M1 <- rbind(c(0,0,1,1),
-            c(1,0,0,0),
-            c(0,1,0,1),
-            c(1,0,0,1))
-g1 <- graph.adjacency(M1)
-el1 <- get.edgelist(g1)
-el1[order(el1[,1], el1[,2]),]
-
-M2 <- rbind(c(0,1,1,1),
-            c(1,0,0,0),
-            c(1,0,0,1),
-            c(1,0,1,0))
-g2 <- graph.adjacency(M2, mode="undirected")
-el2 <- get.edgelist(g2)
-el2[order(el2[,1], el2[,2]),]
-
-M3 <- rbind(c(0,1,1,2),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,1,0))
-g3 <- graph.adjacency(M3, mode="min")
-el3 <- get.edgelist(g3)
-el3[order(el3[,1], el3[,2]),]
-
-M4 <- rbind(c(0,1,1,2),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,1,0))
-g4 <- graph.adjacency(M4, mode="max")
-el4 <- get.edgelist(g4)
-el4[order(el4[,1], el4[,2]),]
-
-M5 <- rbind(c(0,1,1,2),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,1,0))
-g5 <- graph.adjacency(M5, mode="upper")
-el5 <- get.edgelist(g5)
-el5[order(el5[,1], el5[,2]),]
-
-M6 <- rbind(c(0,1,1,2),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,1,0))
-g6 <- graph.adjacency(M6, mode="lower")
-el6 <- get.edgelist(g6)
-el6[order(el6[,1], el6[,2]),]
-
-M7 <- rbind(c(0,1,1,2),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,1,0))
-g7 <- graph.adjacency(M7, mode="plus")
-el7 <- get.edgelist(g7)
-el7[order(el7[,1], el7[,2]),]
-
-M8 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g8 <- graph.adjacency(M8, mode="directed", weighted=TRUE)
-el8 <- cbind(get.edgelist(g8), E(g8)$weight)
-el8[order(el8[,1], el8[,2]),]
-
-M9 <- rbind(c(0,1,1,3),
-            c(1,0,0,0),
-            c(1,0,0,2),
-            c(3,0,2,0))
-g9 <- graph.adjacency(M9, mode="undirected", weighted=TRUE)
-el9 <- cbind(get.edgelist(g9), E(g9)$weight)
-el9[order(el9[,1], el9[,2]),]
-
-M10 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g10 <- graph.adjacency(M10, mode="max", weighted=TRUE)
-el10 <- cbind(get.edgelist(g10), E(g10)$weight)
-el10[order(el10[,1], el10[,2]),]
-
-M11 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g11 <- graph.adjacency(M11, mode="min", weighted=TRUE)
-el11 <- cbind(get.edgelist(g11), E(g11)$weight)
-el11[order(el11[,1], el11[,2]),]
-
-M12 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g12 <- graph.adjacency(M12, mode="lower", weighted=TRUE)
-el12 <- cbind(get.edgelist(g12), E(g12)$weight)
-el12[order(el12[,1], el12[,2]),]
-
-M13 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g13 <- graph.adjacency(M13, mode="upper", weighted=TRUE)
-el13 <- cbind(get.edgelist(g13), E(g13)$weight)
-el13[order(el13[,1], el13[,2]),]
-
-M14 <- rbind(c(0,1,1,0.5),
-            c(1,0,0,0),
-            c(1,0,0,0),
-            c(1,0,2,0))
-g14 <- graph.adjacency(M14, mode="plus", weighted=TRUE)
-el14 <- cbind(get.edgelist(g14), E(g14)$weight)
-el14[order(el14[,1], el14[,2]),]
-
-# sink(NULL)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjacency.Rout.save igraph-0.6.5/interfaces/R/tests/graph.adjacency.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjacency.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adjacency.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,215 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> # sink("graph.adjacency.Rout.save")
-> 
-> library(igraph)
-> 
-> M1 <- rbind(c(0,0,1,1),
-+             c(1,0,0,0),
-+             c(0,1,0,1),
-+             c(1,0,0,1))
-> g1 <- graph.adjacency(M1)
-> el1 <- get.edgelist(g1)
-> el1[order(el1[,1], el1[,2]),]
-     [,1] [,2]
-[1,]    1    3
-[2,]    1    4
-[3,]    2    1
-[4,]    3    2
-[5,]    3    4
-[6,]    4    1
-[7,]    4    4
-> 
-> M2 <- rbind(c(0,1,1,1),
-+             c(1,0,0,0),
-+             c(1,0,0,1),
-+             c(1,0,1,0))
-> g2 <- graph.adjacency(M2, mode="undirected")
-> el2 <- get.edgelist(g2)
-> el2[order(el2[,1], el2[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    3
-[3,]    1    4
-[4,]    3    4
-> 
-> M3 <- rbind(c(0,1,1,2),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,1,0))
-> g3 <- graph.adjacency(M3, mode="min")
-> el3 <- get.edgelist(g3)
-> el3[order(el3[,1], el3[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    3
-[3,]    1    4
-> 
-> M4 <- rbind(c(0,1,1,2),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,1,0))
-> g4 <- graph.adjacency(M4, mode="max")
-> el4 <- get.edgelist(g4)
-> el4[order(el4[,1], el4[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    3
-[3,]    1    4
-[4,]    1    4
-[5,]    3    4
-> 
-> M5 <- rbind(c(0,1,1,2),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,1,0))
-> g5 <- graph.adjacency(M5, mode="upper")
-> el5 <- get.edgelist(g5)
-> el5[order(el5[,1], el5[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    3
-[3,]    1    4
-[4,]    1    4
-> 
-> M6 <- rbind(c(0,1,1,2),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,1,0))
-> g6 <- graph.adjacency(M6, mode="lower")
-> el6 <- get.edgelist(g6)
-> el6[order(el6[,1], el6[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    3
-[3,]    1    4
-[4,]    3    4
-> 
-> M7 <- rbind(c(0,1,1,2),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,1,0))
-> g7 <- graph.adjacency(M7, mode="plus")
-> el7 <- get.edgelist(g7)
-> el7[order(el7[,1], el7[,2]),]
-     [,1] [,2]
-[1,]    1    2
-[2,]    1    2
-[3,]    1    3
-[4,]    1    3
-[5,]    1    4
-[6,]    1    4
-[7,]    1    4
-[8,]    3    4
-> 
-> M8 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g8 <- graph.adjacency(M8, mode="directed", weighted=TRUE)
-> el8 <- cbind(get.edgelist(g8), E(g8)$weight)
-> el8[order(el8[,1], el8[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2  1.0
-[2,]    1    3  1.0
-[3,]    1    4  0.5
-[4,]    2    1  1.0
-[5,]    3    1  1.0
-[6,]    4    1  1.0
-[7,]    4    3  2.0
-> 
-> M9 <- rbind(c(0,1,1,3),
-+             c(1,0,0,0),
-+             c(1,0,0,2),
-+             c(3,0,2,0))
-> g9 <- graph.adjacency(M9, mode="undirected", weighted=TRUE)
-> el9 <- cbind(get.edgelist(g9), E(g9)$weight)
-> el9[order(el9[,1], el9[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2    1
-[2,]    1    3    1
-[3,]    1    4    3
-[4,]    3    4    2
-> 
-> M10 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g10 <- graph.adjacency(M10, mode="max", weighted=TRUE)
-> el10 <- cbind(get.edgelist(g10), E(g10)$weight)
-> el10[order(el10[,1], el10[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2    1
-[2,]    1    3    1
-[3,]    1    4    1
-[4,]    3    4    2
-> 
-> M11 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g11 <- graph.adjacency(M11, mode="min", weighted=TRUE)
-> el11 <- cbind(get.edgelist(g11), E(g11)$weight)
-> el11[order(el11[,1], el11[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2  1.0
-[2,]    1    3  1.0
-[3,]    1    4  0.5
-> 
-> M12 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g12 <- graph.adjacency(M12, mode="lower", weighted=TRUE)
-> el12 <- cbind(get.edgelist(g12), E(g12)$weight)
-> el12[order(el12[,1], el12[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2    1
-[2,]    1    3    1
-[3,]    1    4    1
-[4,]    3    4    2
-> 
-> M13 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g13 <- graph.adjacency(M13, mode="upper", weighted=TRUE)
-> el13 <- cbind(get.edgelist(g13), E(g13)$weight)
-> el13[order(el13[,1], el13[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2  1.0
-[2,]    1    3  1.0
-[3,]    1    4  0.5
-> 
-> M14 <- rbind(c(0,1,1,0.5),
-+             c(1,0,0,0),
-+             c(1,0,0,0),
-+             c(1,0,2,0))
-> g14 <- graph.adjacency(M14, mode="plus", weighted=TRUE)
-> el14 <- cbind(get.edgelist(g14), E(g14)$weight)
-> el14[order(el14[,1], el14[,2]),]
-     [,1] [,2] [,3]
-[1,]    1    2  2.0
-[2,]    1    3  2.0
-[3,]    1    4  1.5
-[4,]    3    4  2.0
-> 
-> # sink(NULL)
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjlist.R igraph-0.6.5/interfaces/R/tests/graph.adjlist.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjlist.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adjlist.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(100, 3/100)
-al <- get.adjlist(g)
-g2 <- graph.adjlist(al, mode="all")
-graph.isomorphic(g, g2)
-
-##
-
-g <- erdos.renyi.game(100, 3/100, dir=TRUE)
-al <- get.adjlist(g, mode="out")
-g2 <- graph.adjlist(al, mode="out")
-graph.isomorphic(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjlist.Rout.save igraph-0.6.5/interfaces/R/tests/graph.adjlist.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.adjlist.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.adjlist.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(100, 3/100)
-> al <- get.adjlist(g)
-> g2 <- graph.adjlist(al, mode="all")
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ##
-> 
-> g <- erdos.renyi.game(100, 3/100, dir=TRUE)
-> al <- get.adjlist(g, mode="out")
-> g2 <- graph.adjlist(al, mode="out")
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.atlas.R igraph-0.6.5/interfaces/R/tests/graph.atlas.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.atlas.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.atlas.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-graph.atlas(124)
-graph.atlas(234)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.atlas.Rout.save igraph-0.6.5/interfaces/R/tests/graph.atlas.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.atlas.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.atlas.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> graph.atlas(124)
-IGRAPH U--- 6 7 -- Graph from the Atlas #124
-+ attr: name (g/c), n (g/n)
-+ edges:
-[1] 1--2 2--3 3--4 4--5 1--5 1--3 2--6
-> graph.atlas(234)
-IGRAPH U--- 7 5 -- Graph from the Atlas #234
-+ attr: name (g/c), n (g/n)
-+ edges:
-[1] 2--6 1--6 3--6 4--6 5--6
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.290   0.038   0.331 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.bfs.R igraph-0.6.5/interfaces/R/tests/graph.bfs.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.bfs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.bfs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-
-library(igraph)
-
-## TODO
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.bfs.Rout.save igraph-0.6.5/interfaces/R/tests/graph.bfs.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.bfs.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.bfs.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## TODO
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.bipartite.R igraph-0.6.5/interfaces/R/tests/graph.bipartite.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.bipartite.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.bipartite.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-
-library(igraph)
-
-I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-g <- graph.incidence(I)
-
-edges <- unlist(sapply(seq_len(nrow(I)), function(x) {
-  w <- which(I[x,] != 0) + nrow(I)
-  if (length(w)!=0) { as.vector(rbind(x, w)) } else { numeric() }
-}))
-g2 <- graph.bipartite(seq_len(nrow(I)+ncol(I)) > nrow(I), edges)
-I2 <- get.incidence(g2)
-
-all(I2 == I)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.bipartite.Rout.save igraph-0.6.5/interfaces/R/tests/graph.bipartite.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.bipartite.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.bipartite.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-> g <- graph.incidence(I)
-> 
-> edges <- unlist(sapply(seq_len(nrow(I)), function(x) {
-+   w <- which(I[x,] != 0) + nrow(I)
-+   if (length(w)!=0) { as.vector(rbind(x, w)) } else { numeric() }
-+ }))
-> g2 <- graph.bipartite(seq_len(nrow(I)+ncol(I)) > nrow(I), edges)
-> I2 <- get.incidence(g2)
-> 
-> all(I2 == I)
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.complementer.R igraph-0.6.5/interfaces/R/tests/graph.complementer.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.complementer.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.complementer.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 3/50)
-g2 <- graph.complementer(g)
-g3 <- graph.complementer(g2)
-graph.isomorphic(g, g3)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.complementer.Rout.save igraph-0.6.5/interfaces/R/tests/graph.complementer.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.complementer.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.complementer.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 3/50)
-> g2 <- graph.complementer(g)
-> g3 <- graph.complementer(g2)
-> graph.isomorphic(g, g3)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.compose.R igraph-0.6.5/interfaces/R/tests/graph.compose.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.compose.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.compose.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-
-library(igraph)
-
-g1 <- erdos.renyi.game(50, 3/50, directed=TRUE)
-gi <- graph( rep(1:vcount(g1), each=2), dir=TRUE )
-
-g2 <- graph.compose(g1, gi)
-g3 <- graph.compose(gi, g1)
-
-graph.isomorphic(g1, g2)
-graph.isomorphic(g1, g3)
-
-############
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.compose.Rout.save igraph-0.6.5/interfaces/R/tests/graph.compose.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.compose.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.compose.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g1 <- erdos.renyi.game(50, 3/50, directed=TRUE)
-> gi <- graph( rep(1:vcount(g1), each=2), dir=TRUE )
-> 
-> g2 <- graph.compose(g1, gi)
-> g3 <- graph.compose(gi, g1)
-> 
-> graph.isomorphic(g1, g2)
-[1] TRUE
-> graph.isomorphic(g1, g3)
-[1] TRUE
-> 
-> ############
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.coreness.R igraph-0.6.5/interfaces/R/tests/graph.coreness.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.coreness.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.coreness.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-library(igraph)
-
-g <- graph.ring(10)
-g <- add.edges(g, c(1,2, 2,3, 1,3))
-graph.coreness(g)               
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.coreness.Rout.save igraph-0.6.5/interfaces/R/tests/graph.coreness.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.coreness.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.coreness.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.ring(10)
-> g <- add.edges(g, c(1,2, 2,3, 1,3))
-> graph.coreness(g)               
- [1] 3 3 3 2 2 2 2 2 2 2
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.data.frame.R igraph-0.6.5/interfaces/R/tests/graph.data.frame.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.data.frame.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.data.frame.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,16 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-actors <- data.frame(name=c("Alice", "Bob", "Cecil", "David",
-                       "Esmeralda"),
-                     age=c(48,33,45,34,21),
-                     gender=c("F","M","F","M","F"))
-relations <- data.frame(from=c("Bob", "Cecil", "Cecil", "David",
-                          "David", "Esmeralda"),
-                        to=c("Alice", "Bob", "Alice", "Alice",
-                          "Bob", "Alice"),
-                        same.dept=c(FALSE,FALSE,TRUE,FALSE,FALSE,TRUE),
-                        friendship=c(4,5,5,2,1,1), advice=c(4,5,5,4,2,3))
-g <- graph.data.frame(relations, directed=TRUE, vertices=actors)
-print(g, e=TRUE, v=TRUE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.data.frame.Rout.save igraph-0.6.5/interfaces/R/tests/graph.data.frame.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.data.frame.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.data.frame.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> actors <- data.frame(name=c("Alice", "Bob", "Cecil", "David",
-+                        "Esmeralda"),
-+                      age=c(48,33,45,34,21),
-+                      gender=c("F","M","F","M","F"))
-> relations <- data.frame(from=c("Bob", "Cecil", "Cecil", "David",
-+                           "David", "Esmeralda"),
-+                         to=c("Alice", "Bob", "Alice", "Alice",
-+                           "Bob", "Alice"),
-+                         same.dept=c(FALSE,FALSE,TRUE,FALSE,FALSE,TRUE),
-+                         friendship=c(4,5,5,2,1,1), advice=c(4,5,5,4,2,3))
-> g <- graph.data.frame(relations, directed=TRUE, vertices=actors)
-> print(g, e=TRUE, v=TRUE)
-IGRAPH DN-- 5 6 -- 
-+ attr: name (v/c), age (v/n), gender (v/c), same.dept (e/x),
-  friendship (e/n), advice (e/n)
-+ vertex attributes:
-         name age gender
-[1]     Alice  48      F
-[2]       Bob  33      M
-[3]     Cecil  45      F
-[4]     David  34      M
-[5] Esmeralda  21      F
-+ edges (vertex names) and their attributes:
-                    edge same.dept friendship advice
-[1] Bob      ->Alice         FALSE          4      4
-[2] Cecil    ->Bob           FALSE          5      5
-[3] Cecil    ->Alice          TRUE          5      5
-[4] David    ->Alice         FALSE          2      4
-[5] David    ->Bob           FALSE          1      2
-[6] Esmeralda->Alice          TRUE          1      3
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.305   0.038   0.345 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.de.bruijn.R igraph-0.6.5/interfaces/R/tests/graph.de.bruijn.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.de.bruijn.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.de.bruijn.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.de.bruijn(2,1)
-g2 <- graph.de.bruijn(2,2)
-g3 <- line.graph(g)
-g3
-graph.isomorphic(g2, g3)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.de.bruijn.Rout.save igraph-0.6.5/interfaces/R/tests/graph.de.bruijn.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.de.bruijn.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.de.bruijn.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.de.bruijn(2,1)
-> g2 <- graph.de.bruijn(2,2)
-> g3 <- line.graph(g)
-> g3
-IGRAPH D--- 4 8 -- Line graph
-+ attr: name (g/c)
-+ edges:
-[1] 1->1 3->1 1->2 3->2 2->3 4->3 2->4 4->4
-> graph.isomorphic(g2, g3)
-[1] TRUE
-> 
-> proc.time()
-   user  system elapsed 
-  0.293   0.037   0.339 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.density.R igraph-0.6.5/interfaces/R/tests/graph.density.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.density.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.density.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 4/50)
-gd <- graph.density(g)
-gd2 <- ecount(g) / vcount(g) / (vcount(g)-1) * 2
-abs(gd - gd2) < 1e-14
-
-####
-
-g <- erdos.renyi.game(50, 4/50, dir=TRUE)
-gd <- graph.density(g)
-gd2 <- ecount(g) / vcount(g) / (vcount(g)-1)
-abs(gd - gd2) < 1e-14
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.density.Rout.save igraph-0.6.5/interfaces/R/tests/graph.density.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.density.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.density.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 4/50)
-> gd <- graph.density(g)
-> gd2 <- ecount(g) / vcount(g) / (vcount(g)-1) * 2
-> abs(gd - gd2) < 1e-14
-[1] TRUE
-> 
-> ####
-> 
-> g <- erdos.renyi.game(50, 4/50, dir=TRUE)
-> gd <- graph.density(g)
-> gd2 <- ecount(g) / vcount(g) / (vcount(g)-1)
-> abs(gd - gd2) < 1e-14
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.edgelist.R igraph-0.6.5/interfaces/R/tests/graph.edgelist.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.edgelist.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.edgelist.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,26 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 5/50)
-el <- get.edgelist(g)
-g2 <- graph.edgelist(el, dir=FALSE)
-graph.isomorphic(g, g2)
-
-####
-
-g <- erdos.renyi.game(50, 5/50, dir=TRUE)
-el <- get.edgelist(g)
-g2 <- graph.edgelist(el, dir=TRUE)
-graph.isomorphic(g, g2)
-
-####
-
-g <- erdos.renyi.game(26, 5/26, dir=TRUE)
-el <- get.edgelist(g)
-n <- letters[1:26]
-names(n) <- 1:26
-mode(el) <- "character"
-el[] <- n[el]
-g2 <- graph.edgelist(el, dir=TRUE)
-graph.isomorphic(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.edgelist.Rout.save igraph-0.6.5/interfaces/R/tests/graph.edgelist.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.edgelist.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.edgelist.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 5/50)
-> el <- get.edgelist(g)
-> g2 <- graph.edgelist(el, dir=FALSE)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ####
-> 
-> g <- erdos.renyi.game(50, 5/50, dir=TRUE)
-> el <- get.edgelist(g)
-> g2 <- graph.edgelist(el, dir=TRUE)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> ####
-> 
-> g <- erdos.renyi.game(26, 5/26, dir=TRUE)
-> el <- get.edgelist(g)
-> n <- letters[1:26]
-> names(n) <- 1:26
-> mode(el) <- "character"
-> el[] <- n[el]
-> g2 <- graph.edgelist(el, dir=TRUE)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.isoclass.R igraph-0.6.5/interfaces/R/tests/graph.isoclass.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.isoclass.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.isoclass.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
-
-library(igraph)
-
-g1 <- graph.isocreate(3, 10)
-g2 <- graph.isocreate(3, 11)
-graph.isoclass(g1)
-graph.isoclass(g2)
-
-g1 <- add.vertices(g1, 3)
-graph.isoclass.subgraph(g1, 1:3)
-graph.isoclass.subgraph(g1 %du% g2, 1:3)
-graph.isoclass.subgraph(g1 %du% g2, 7:9)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.isoclass.Rout.save igraph-0.6.5/interfaces/R/tests/graph.isoclass.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.isoclass.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.isoclass.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g1 <- graph.isocreate(3, 10)
-> g2 <- graph.isocreate(3, 11)
-> graph.isoclass(g1)
-[1] 10
-> graph.isoclass(g2)
-[1] 11
-> 
-> g1 <- add.vertices(g1, 3)
-> graph.isoclass.subgraph(g1, 1:3)
-[1] 10
-> graph.isoclass.subgraph(g1 %du% g2, 1:3)
-[1] 10
-> graph.isoclass.subgraph(g1 %du% g2, 7:9)
-[1] 11
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.kautz.R igraph-0.6.5/interfaces/R/tests/graph.kautz.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.kautz.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.kautz.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-graph.kautz(2,3)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.kautz.Rout.save igraph-0.6.5/interfaces/R/tests/graph.kautz.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.kautz.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.kautz.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> graph.kautz(2,3)
-IGRAPH D--- 24 48 -- Kautz graph 2-3
-+ attr: name (g/c), m (g/n), n (g/n)
-+ edges:
- [1]  1-> 9  1->10  2->11  2->12  3->13  3->14  4->15  4->16  5->17  5->18
-[11]  6->19  6->20  7->21  7->22  8->23  8->24  9-> 1  9-> 2 10-> 3 10-> 4
-[21] 11-> 5 11-> 6 12-> 7 12-> 8 13->17 13->18 14->19 14->20 15->21 15->22
-[31] 16->23 16->24 17-> 1 17-> 2 18-> 3 18-> 4 19-> 5 19-> 6 20-> 7 20-> 8
-[41] 21-> 9 21->10 22->11 22->12 23->13 23->14 24->15 24->16
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.290   0.038   0.331 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.knn.R igraph-0.6.5/interfaces/R/tests/graph.knn.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.knn.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.knn.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-## Some trivial ones
-g <- graph.ring(10)
-graph.knn(g)
-g2 <- graph.star(10)
-graph.knn(g2)
-
-## A scale-free one, try to plot 'knnk'
-g3 <- simplify(ba.game(1000, m=5))
-graph.knn(g3)
-
-## A random graph
-g4 <- random.graph.game(1000, p=5/1000)
-graph.knn(g4)
-
-## A weighted graph
-g5 <- graph.star(10)
-E(g5)$weight <- seq(ecount(g5))
-graph.knn(g5)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.knn.Rout.save igraph-0.6.5/interfaces/R/tests/graph.knn.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.knn.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.knn.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,410 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> ## Some trivial ones
-> g <- graph.ring(10)
-> graph.knn(g)
-$knn
- [1] 2 2 2 2 2 2 2 2 2 2
-
-$knnk
-[1] NaN   2
-
-> g2 <- graph.star(10)
-> graph.knn(g2)
-$knn
- [1] 1 9 9 9 9 9 9 9 9 9
-
-$knnk
-[1]   9 NaN NaN NaN NaN NaN NaN NaN   1
-
-> 
-> ## A scale-free one, try to plot 'knnk'
-> g3 <- simplify(ba.game(1000, m=5))
-> graph.knn(g3)
-$knn
-   [1]  13.92758  14.66379  14.71010  16.11032  17.74874  14.41154  18.16092
-   [8]  16.82967  26.23077  19.09924  18.78000  67.15000  29.79688  22.38636
-  [15]  52.03846 144.60000  25.22093 122.54545  18.20482  97.61538  31.10169
-  [22]  68.86957  51.18182  80.40000 128.00000  20.27778  89.85714  24.02000
-  [29]  93.50000 203.20000 143.28571  29.82051  27.00000 142.85714 154.85714
-  [36]  49.00000  99.60000  92.84615 101.72727  62.96000 235.60000  29.38889
-  [43]  46.00000  18.85294  91.18750  44.62963 198.80000  52.75000 108.16667
-  [50] 123.16667 186.83333  60.87500 113.90909  37.64286 183.71429 147.62500
-  [57] 162.12500  81.41667  44.00000  30.17647  23.62069 139.00000  91.23077
-  [64] 135.45455 164.33333  30.57143  49.57692 166.57143  49.53571  32.45000
-  [71]  33.07317  18.08108 141.71429 101.27273 100.07692 102.28571 227.40000
-  [78]  36.95652  66.54545 134.14286 143.57143  61.05263 177.00000 226.40000
-  [85]  59.25000 122.57143  59.37500 152.00000 123.88889 133.77778  47.06667
-  [92]  93.20000  81.75000 125.90909 136.50000 115.11111 128.71429  84.88889
-  [99] 137.11111 156.50000 158.20000  85.00000 117.85714 188.42857 114.00000
- [106] 103.92308 194.50000  85.00000 150.14286 130.37500  55.90000  34.96875
- [113]  31.40000 125.50000  66.33333  49.52381  91.69231 107.42857  45.15152
- [120]  35.42308  75.26667 140.00000 104.62500  35.68750  38.35714 225.40000
- [127] 150.50000  48.15789 150.80000 133.62500 168.66667 177.00000 136.44444
- [134]  76.77778  33.32258 113.80000  94.50000 244.00000 135.80000  61.00000
- [141] 195.16667  86.21429  33.11111  91.88889  79.16667  61.44444 126.80000
- [148] 127.14286  47.25000 110.00000  78.40000  94.75000  64.81818  76.88889
- [155]  44.55556  78.54545 167.00000 154.00000  74.00000  61.09091 138.00000
- [162]  71.66667 152.40000 106.72727 108.28571  90.23077  79.57143 221.60000
- [169]  58.90909  84.09091  64.34783 157.37500 156.00000  92.88889  77.00000
- [176] 109.10000  86.22222  68.44444 111.00000 197.20000  79.00000  65.66667
- [183]  28.83333 150.71429 191.20000  70.00000 145.11111  65.60000 118.00000
- [190] 158.20000  38.92857 130.62500  49.20000 218.20000 198.00000 127.00000
- [197] 172.00000  40.70000 154.14286 185.80000 194.40000 208.80000 156.20000
- [204] 108.11111 155.20000 101.66667  58.72727 159.00000  54.00000  89.80000
- [211] 228.00000 139.00000 183.16667 111.85714  66.33333 119.66667 126.62500
- [218]  98.75000 226.20000  90.50000  96.22222 162.14286  69.00000 153.00000
- [225]  55.53846 114.33333  83.81818  66.14286 135.80000  80.30000  79.20000
- [232]  84.66667 143.50000 198.60000  67.57143 216.50000 102.60000  99.71429
- [239] 175.00000 145.71429 127.83333 114.00000 144.83333  99.00000  39.52941
- [246]  84.81818 169.80000  86.20000  75.75000  97.20000 109.42857 108.80000
- [253] 131.80000  68.08333  60.55556  86.16667 130.00000  96.66667  76.87500
- [260]  67.00000 129.00000  74.27273 205.66667  95.33333  91.54545 148.60000
- [267]  92.22222  49.83333 170.20000 135.40000  49.90000  44.40000  52.33333
- [274] 131.16667  54.54545 127.00000 202.20000 207.00000 102.66667 227.40000
- [281]  97.28571  93.90000 151.83333 188.50000 194.20000 157.50000 173.16667
- [288] 130.50000 197.28571  96.62500  89.60000  93.33333  73.00000 168.00000
- [295]  92.16667  58.00000 152.60000 216.80000 122.00000 133.37500  64.18182
- [302]  70.85714  84.11111 124.14286 187.60000 125.40000 164.40000 117.75000
- [309]  82.80000 145.20000  65.00000  69.60000  57.46667  81.62500  36.23810
- [316]  38.57143  63.87500 142.20000 146.83333 124.20000  87.18182 144.57143
- [323] 111.00000  93.87500 205.83333 181.60000 101.20000 128.80000 113.66667
- [330]  29.60000  67.27273  86.90000 208.60000 112.16667 174.00000  84.16667
- [337] 173.33333  63.16667  65.20000 153.50000 205.40000 101.90000 128.62500
- [344] 126.14286 115.70000 136.80000 147.50000 170.40000  99.80000 161.00000
- [351]  70.14286 116.83333  89.00000 125.62500 149.66667 120.28571  98.28571
- [358] 155.33333 136.83333  78.18182  34.80000  93.33333 132.57143  69.81818
- [365]  61.33333 149.57143  95.00000 138.40000 112.00000 165.00000  93.20000
- [372] 156.20000 119.66667  80.80000 137.80000  22.50000  67.00000  74.33333
- [379]  40.16667  48.75000  92.60000 246.50000 112.11111 130.50000 154.40000
- [386] 223.20000  99.20000 136.00000  77.42857  80.50000  85.00000 134.80000
- [393] 142.20000 131.20000 240.40000 113.14286  28.80000 182.16667  61.57143
- [400] 128.88889 119.33333  33.00000  89.00000  72.40000  74.20000 205.60000
- [407]  29.85714 113.80000  59.11111  76.60000 134.16667  40.55556 208.57143
- [414] 212.00000  61.62500 101.00000  70.42857 144.80000  77.71429 116.80000
- [421]  33.16667 126.00000 232.60000 199.33333 155.20000 107.71429  80.00000
- [428]  67.00000  15.16667 123.83333  63.44444 127.71429 190.80000  65.60000
- [435] 113.16667  92.80000 171.20000 131.42857 103.20000 132.00000 192.80000
- [442] 187.40000 115.33333 110.33333  52.66667 139.00000 128.12500 138.40000
- [449] 104.57143 137.20000  73.80000 123.60000  42.87500  25.71429 133.71429
- [456] 109.80000 107.37500  96.83333  79.40000 123.40000 114.85714  38.00000
- [463]  63.28571  56.60000 206.60000  85.14286  63.00000  14.40000  14.00000
- [470] 208.40000  70.50000  22.00000 192.83333 146.00000  74.16667 112.16667
- [477]  76.60000  84.80000 187.60000 152.57143 186.80000 180.57143  25.80000
- [484]  38.80000 191.20000  17.63636 147.00000  52.20000  82.16667  94.00000
- [491]  81.33333 146.40000 122.80000  55.20000  91.33333 185.66667  92.83333
- [498]  58.71429 107.60000  85.66667  46.57143 164.00000 116.00000 222.60000
- [505]  13.20000 120.42857  96.66667 141.20000 128.20000 132.00000 162.60000
- [512] 156.00000 138.14286 116.60000  93.12500 205.20000  60.00000  34.66667
- [519] 159.80000  85.20000 119.83333 144.16667  52.00000  48.40000 107.00000
- [526] 120.00000 117.60000  69.85714 105.60000 229.20000  96.60000 180.20000
- [533] 174.60000  42.16667  91.25000  96.00000 145.60000  71.83333 161.16667
- [540] 154.00000 198.20000  57.60000  79.16667 135.20000 173.28571  92.71429
- [547]  99.60000 118.40000 176.40000  71.71429 100.85714 178.20000  94.66667
- [554]  72.57143 147.00000  76.80000  85.66667 152.00000  99.83333  48.71429
- [561] 210.60000 133.33333 121.60000 117.66667 106.33333 204.80000  95.60000
- [568] 205.66667 104.00000 146.40000  73.80000 150.00000  89.00000  27.62500
- [575] 127.00000 148.20000  53.50000 132.80000 115.20000  25.60000  38.33333
- [582] 196.40000 116.20000 187.20000 175.00000  30.20000 121.40000 117.40000
- [589] 130.00000 121.20000 174.20000 136.33333  70.60000 195.60000 128.83333
- [596] 179.40000  91.28571 129.40000  85.25000 171.60000 101.85714 123.00000
- [603]  32.60000  26.80000 112.20000 100.71429 125.80000  90.85714  68.83333
- [610] 145.14286  58.00000 178.20000  86.40000 103.12500  59.14286  77.16667
- [617]  98.14286 206.60000 138.00000 186.80000  95.20000  90.20000 100.87500
- [624] 204.60000  70.00000 174.83333 154.00000 166.40000 126.20000 147.60000
- [631]  56.00000 130.40000  58.42857  85.80000 118.71429  48.50000  61.00000
- [638] 158.00000 160.16667 164.80000 210.40000 153.60000  65.60000 160.40000
- [645] 188.33333 200.40000 147.60000 138.40000 106.16667  40.80000 129.80000
- [652] 118.66667 140.66667 136.60000 137.16667 138.00000  71.00000 164.20000
- [659]  71.66667  31.88889  91.83333  96.60000 122.00000  67.33333  86.80000
- [666]  91.16667 144.80000 197.40000  63.83333  56.00000  23.60000  48.42857
- [673]  66.60000 171.40000 108.00000  32.83333 131.40000 124.40000 185.50000
- [680]  43.00000  51.00000  92.40000  79.00000  15.40000  61.00000 125.80000
- [687] 145.00000  86.40000  59.57143 102.40000 244.20000  96.80000 158.80000
- [694] 135.20000  74.20000 142.40000  85.00000 123.40000 152.42857 197.00000
- [701] 110.60000  43.87500 185.80000 110.00000 130.60000 152.20000 140.40000
- [708] 181.40000 125.80000 108.80000  67.80000 128.20000 135.40000  62.20000
- [715] 239.00000 147.40000 152.60000 116.60000  47.20000 118.80000 142.00000
- [722]  74.77778 166.00000  92.80000 164.60000 131.00000 117.00000 177.20000
- [729]  32.00000  59.66667 157.20000  67.50000 189.20000 209.00000 118.20000
- [736] 126.80000 149.00000 145.00000  53.00000 126.60000 111.20000  97.60000
- [743]  84.00000  75.40000  94.80000 130.60000  84.00000 104.20000  80.80000
- [750]  38.00000  65.00000  82.20000 166.83333 113.80000  44.71429 115.85714
- [757] 125.60000  60.00000  86.60000 103.20000 162.80000 111.80000 148.20000
- [764] 104.20000 104.80000 193.20000  88.60000 170.20000 143.20000 181.20000
- [771] 103.20000 128.20000 257.00000  26.42857 150.00000 144.00000 103.16667
- [778]  79.20000 141.20000 147.00000 119.33333 134.80000 102.80000 192.60000
- [785] 135.80000  77.40000 111.60000 112.60000 110.00000  91.80000  61.20000
- [792]  98.60000  57.16667  60.80000  54.60000 130.60000 136.40000 221.80000
- [799]  98.20000 139.00000  98.80000  82.80000  76.80000 131.83333 126.16667
- [806]  71.00000 105.20000 203.00000 139.40000  73.20000 107.00000 143.20000
- [813]   8.20000 110.00000 159.40000  30.00000  27.00000  96.60000 164.80000
- [820] 164.20000 112.60000  10.20000 129.80000 181.60000 229.40000  67.60000
- [827] 100.00000  98.60000 156.00000 117.66667  87.50000  98.40000  59.00000
- [834] 131.80000 155.20000  55.00000  71.20000  77.00000  73.20000 207.60000
- [841]  89.80000  33.20000  63.00000  19.80000 160.20000 164.60000 116.20000
- [848] 158.80000  67.20000 136.80000 186.00000 129.20000 182.60000 195.60000
- [855] 164.60000 107.60000  86.40000  49.20000 153.40000  55.40000 108.60000
- [862]  44.57143 241.00000 149.40000  24.40000  26.00000 146.83333  26.40000
- [869]  39.00000  81.60000 138.20000  80.60000 152.60000 147.66667 151.80000
- [876]  84.00000  51.80000 118.20000  97.20000 105.00000  87.80000 114.60000
- [883] 191.83333 145.00000  84.83333  67.66667  44.00000 184.40000 145.80000
- [890] 117.20000  79.83333 191.20000  63.00000 112.80000  95.20000  72.40000
- [897]  56.40000  81.60000 160.83333  93.80000 243.60000 109.40000  23.20000
- [904] 132.20000  36.00000 115.60000 141.40000 240.80000  82.00000  94.80000
- [911]  94.40000 160.80000 211.80000 181.80000 133.00000  79.40000 207.40000
- [918]  72.00000 144.20000 134.20000  96.40000 175.80000  66.60000 117.40000
- [925] 170.00000 103.60000 101.20000  78.50000 114.20000 144.40000 119.40000
- [932]  98.40000  62.60000 111.80000  39.00000 170.80000 134.00000  18.00000
- [939]  36.40000 119.20000  78.60000 106.20000 171.20000  98.40000  43.60000
- [946] 111.60000  58.40000  99.00000 157.20000  63.60000  87.60000 148.60000
- [953] 155.60000  21.80000 146.60000  42.00000 135.40000 134.00000 123.80000
- [960] 174.00000  75.40000 140.40000  68.80000 127.20000 127.40000  53.20000
- [967] 123.60000 114.00000  86.00000  67.40000 124.20000  66.20000  73.80000
- [974] 149.00000   8.40000  78.20000  89.00000  24.60000  57.60000 166.00000
- [981]  34.40000  90.80000  32.60000 156.60000  77.80000 119.60000  56.40000
- [988]  11.20000 112.40000 102.00000 151.40000 238.60000   9.20000 168.20000
- [995]  26.20000  93.80000 139.00000 108.40000 197.00000 192.40000
-
-$knnk
-  [1]       NaN       NaN       NaN       NaN 124.21181 114.26605 106.58763
-  [8] 104.83125  91.60000  87.16087  82.50168  78.63636  90.39423  59.91667
- [15]  64.76000  57.28125  39.52941  46.11111  54.60526  60.00000  43.92063
- [22]  51.18182  56.72464  52.90625  47.18000  45.67949  46.81481  43.58929
- [29]       NaN  27.00000  33.32258  34.96875  45.15152  30.17647       NaN
- [36]  29.38889  18.08108       NaN  29.82051       NaN  33.07317       NaN
- [43]       NaN       NaN       NaN       NaN       NaN       NaN  30.57143
- [50]  24.02000       NaN       NaN       NaN       NaN       NaN       NaN
- [57]       NaN  23.62069  31.10169       NaN       NaN       NaN       NaN
- [64]  29.79688       NaN       NaN       NaN  18.85294       NaN       NaN
- [71]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
- [78]       NaN       NaN       NaN       NaN       NaN  18.20482       NaN
- [85]       NaN  25.22093       NaN  22.38636       NaN  20.27778  26.23077
- [92]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
- [99]       NaN  18.78000       NaN       NaN       NaN       NaN       NaN
-[106]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[113]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[120]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[127]       NaN       NaN       NaN       NaN  19.09924       NaN       NaN
-[134]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[141]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[148]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[155]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[162]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[169]       NaN       NaN       NaN       NaN       NaN  18.16092       NaN
-[176]       NaN       NaN       NaN       NaN       NaN       NaN  16.82967
-[183]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[190]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[197]       NaN       NaN  17.74874       NaN       NaN       NaN       NaN
-[204]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[211]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[218]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[225]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[232]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[239]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[246]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[253]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[260]  14.41154       NaN       NaN       NaN       NaN       NaN       NaN
-[267]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[274]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[281]  16.11032       NaN       NaN       NaN       NaN       NaN       NaN
-[288]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[295]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[302]       NaN       NaN       NaN       NaN       NaN  14.71010       NaN
-[309]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[316]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[323]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[330]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[337]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[344]       NaN       NaN       NaN       NaN  14.66379       NaN       NaN
-[351]       NaN       NaN       NaN       NaN       NaN       NaN       NaN
-[358]       NaN  13.92758
-
-> 
-> ## A random graph
-> g4 <- random.graph.game(1000, p=5/1000)
-> graph.knn(g4)
-$knn
-   [1]  7.333333  6.000000  6.500000  6.000000  7.000000  5.250000  6.857143
-   [8]  6.666667  6.000000  7.833333  6.750000  7.500000       NaN  5.666667
-  [15]  6.500000  6.166667  4.800000  6.285714  6.625000  6.000000  6.166667
-  [22]  8.000000  7.000000  6.500000  6.500000  6.500000  5.250000  5.000000
-  [29]  6.500000  6.666667  3.600000  5.600000  7.333333  7.000000  5.000000
-  [36]  6.625000  5.500000       NaN  9.000000  6.666667  5.714286  7.000000
-  [43]  4.333333  6.750000  4.750000  6.857143  4.888889  8.800000  6.000000
-  [50]  5.250000  5.400000  6.666667  4.500000  5.000000  6.000000  7.000000
-  [57]  7.000000  6.666667  6.000000  4.333333  5.833333  6.000000  7.166667
-  [64]  6.111111  4.666667  6.250000  7.000000  5.600000  5.833333  7.000000
-  [71]  6.000000  5.625000  6.285714  8.000000  6.000000  7.750000  4.571429
-  [78]  6.000000  4.700000  6.000000  6.857143  6.600000  5.000000  5.000000
-  [85]  6.250000  5.500000  5.500000  6.285714  5.333333  6.142857  6.000000
-  [92]  5.666667  4.666667  6.500000  5.750000  8.750000  6.250000  5.666667
-  [99]  5.000000  7.333333  6.444444  7.666667  5.750000  6.000000  6.000000
- [106]  5.428571  5.666667  6.000000  6.500000  4.375000  4.666667  7.000000
- [113]  6.000000  5.800000  6.166667  6.000000  5.200000  7.600000  7.000000
- [120]  5.800000  4.250000  4.000000  5.666667  5.666667  6.285714  7.142857
- [127]  7.600000  4.400000  6.583333  6.000000  6.600000  5.428571  5.000000
- [134]  6.000000  7.600000  6.125000  6.200000  5.000000  5.800000  6.200000
- [141]  6.000000  7.000000  6.571429  6.000000  6.571429  7.500000  7.428571
- [148]  6.600000  7.000000  5.600000  6.625000  6.666667  6.666667  6.500000
- [155]  6.000000  8.333333  5.500000  6.500000  7.750000  5.000000  3.666667
- [162]  6.166667  7.200000  5.625000  5.666667  7.333333  6.333333  6.100000
- [169]  6.250000  5.250000  7.000000  7.333333  5.888889  5.000000  7.250000
- [176]  4.571429  6.000000 10.000000  3.500000  5.250000  4.833333  9.000000
- [183]  7.000000  5.600000  5.800000  7.000000  5.000000  4.500000  6.833333
- [190]  6.714286  5.000000  6.000000  5.600000  6.333333  5.400000  5.200000
- [197]  5.666667  5.250000  6.000000  5.000000  6.416667  7.600000  6.166667
- [204]  6.250000  7.000000  4.500000  4.000000  5.750000  5.666667  7.000000
- [211]  6.000000  5.750000  7.800000  6.333333  6.142857  4.000000  5.000000
- [218]  5.750000  6.750000  6.000000  6.375000  5.500000  6.500000  5.750000
- [225]  6.714286  7.666667  5.166667  5.833333  5.000000  5.666667  6.000000
- [232]  7.250000  6.000000  4.750000  6.111111  7.750000  6.142857  4.875000
- [239]  6.400000  4.333333  6.400000  4.500000  5.500000  5.500000  4.500000
- [246]  6.800000  6.000000  5.428571  5.000000  5.800000  6.000000  6.000000
- [253]  5.800000  5.000000  6.600000  5.666667  5.000000  5.800000  6.250000
- [260]  5.666667  6.750000  5.250000  6.666667  5.166667  5.600000  4.000000
- [267]  8.250000  5.125000  4.750000  6.200000  6.400000  9.500000  7.000000
- [274]  4.333333  6.000000  5.000000  7.000000  6.250000  6.000000  6.428571
- [281]  6.500000  4.500000  6.400000  2.500000  7.000000  6.500000  4.750000
- [288]  5.750000  5.000000  5.800000  5.400000  5.500000  6.000000  5.800000
- [295]  5.714286  4.600000  6.666667  7.000000  5.500000  5.625000  4.750000
- [302]  4.833333  5.000000  8.000000  6.666667  6.200000  8.833333  4.500000
- [309]  5.166667  6.000000  7.666667  4.000000  6.200000  4.400000  6.000000
- [316]  4.500000  5.666667  6.222222  5.666667  5.571429  6.333333  6.300000
- [323]  7.000000  4.500000  6.000000  4.571429  5.400000  7.600000  4.500000
- [330]  3.500000  8.666667  5.500000  6.600000  7.545455  7.375000  6.333333
- [337] 10.000000  5.266667  6.500000  6.428571  8.000000  4.000000  4.857143
- [344]  8.666667  6.142857  4.666667  6.000000  6.000000  8.000000  4.750000
- [351]  5.000000  6.000000  7.200000  6.166667  4.714286  6.333333  5.666667
- [358]  6.888889       NaN  8.750000  5.666667  5.600000  6.500000  4.000000
- [365]  7.428571  7.400000  7.000000  5.571429  4.166667  6.666667  5.250000
- [372]  9.000000  4.400000  6.000000  5.000000  6.500000  5.500000  5.500000
- [379]  4.714286  5.250000  5.857143  6.000000  4.333333  4.600000  5.800000
- [386]  5.500000  5.000000  7.285714  5.857143  5.000000  5.777778  5.000000
- [393]  5.166667  5.500000  5.200000  3.500000  7.000000  4.000000  4.400000
- [400]  7.000000  5.200000  4.666667  4.333333  7.000000  6.000000  7.600000
- [407]  6.200000  6.000000  7.000000  5.250000  6.500000  5.333333  5.333333
- [414]  6.500000  5.000000  5.200000  7.000000  6.142857  4.333333  6.714286
- [421]  7.222222  6.000000  9.000000  5.400000  5.142857  6.500000  5.600000
- [428]  7.000000  8.000000  6.625000  6.000000  5.800000  4.600000  5.333333
- [435]  7.750000  5.000000  7.600000  6.500000  5.500000  5.750000  7.000000
- [442]  4.666667  8.000000  9.500000  6.000000  5.000000  5.800000       NaN
- [449]  5.571429  7.000000  6.000000  5.636364  7.000000  6.714286  5.111111
- [456]  8.000000  6.800000  6.500000  5.800000  3.500000  5.000000  5.500000
- [463]  6.000000  5.666667  5.428571  5.857143  6.222222  7.000000  5.000000
- [470]  5.333333  4.750000  5.875000  6.200000  5.000000  5.166667  6.166667
- [477]  7.000000  3.000000  6.250000  5.200000  5.600000  5.000000  5.200000
- [484]  3.500000  5.666667  6.000000  5.285714  4.000000  6.428571  6.000000
- [491]  7.000000  6.000000  7.000000  4.500000  8.666667  5.500000  6.250000
- [498]       NaN  7.666667  6.666667  5.833333  6.250000  6.000000  6.300000
- [505]  7.166667  6.600000  5.857143  5.000000  5.800000  7.000000  5.000000
- [512]  3.666667  5.142857  6.777778  4.600000  6.166667  6.750000  6.666667
- [519]  5.250000  4.500000  3.750000  4.500000  5.000000       NaN  7.000000
- [526]  6.666667  5.166667  7.000000  6.000000  6.666667  8.000000  6.833333
- [533]  6.285714  4.000000  3.500000  4.750000  6.833333  5.333333  5.000000
- [540]  6.250000  6.875000  6.500000  6.375000  5.000000  4.250000  5.750000
- [547]  4.500000  6.142857  8.142857  3.000000  5.000000  6.200000  7.000000
- [554]  5.166667  7.166667  6.000000  4.666667  5.800000  4.400000  5.500000
- [561]  5.250000  8.000000  4.500000  5.200000  5.800000  5.250000  6.750000
- [568]  6.500000  5.428571  8.000000  5.000000  7.000000  4.600000  4.666667
- [575]  7.000000  6.500000  5.333333  6.000000  5.166667  8.000000  5.333333
- [582]  6.000000  6.333333  6.000000  6.272727  6.000000  8.000000  7.333333
- [589]  5.571429  5.000000  6.666667  7.500000  5.750000  4.333333       NaN
- [596]  6.000000  5.333333  6.000000  6.166667  7.375000  6.333333  4.000000
- [603]  6.500000  2.500000  6.000000  5.666667  5.666667  5.833333  5.000000
- [610]  8.000000  8.000000  6.833333  7.000000  6.400000  5.400000  7.666667
- [617]  6.222222  6.000000  6.500000  7.000000  6.000000  5.000000  6.666667
- [624]  4.666667  7.142857  5.000000  6.750000  6.600000  6.875000  7.000000
- [631]  7.000000  5.000000  5.571429  5.000000  6.000000  6.750000  7.333333
- [638]  5.333333  6.166667  5.000000  5.142857  3.000000  6.000000  6.285714
- [645]  8.333333  6.714286  7.400000  7.333333  6.375000  7.000000  5.428571
- [652]  4.833333  6.500000  4.750000  5.000000  9.000000  7.000000  6.142857
- [659]  7.400000  3.500000  6.750000  6.000000  6.125000  5.750000  4.222222
- [666]  6.285714  6.750000  4.666667  5.875000  5.800000  9.000000  6.600000
- [673]  5.333333  6.400000  4.666667  8.200000  6.500000  7.000000  5.200000
- [680]  5.750000  5.666667  6.166667  5.333333  5.285714  3.666667  5.333333
- [687]  4.833333  7.333333  6.666667  4.333333  7.250000  5.666667  7.000000
- [694]  5.000000  4.285714  5.000000  4.250000  5.500000  4.400000  5.285714
- [701]  4.700000  6.750000  6.750000  6.307692  5.000000  5.428571  5.857143
- [708]  5.000000  5.333333  5.333333  7.500000  7.333333  6.000000  5.400000
- [715]  6.250000  6.200000  5.750000  7.500000  6.000000  6.000000  4.333333
- [722]  8.000000  6.200000  6.333333  7.400000  7.000000  7.666667  5.500000
- [729]  5.750000  5.666667  7.000000  7.375000  5.250000  6.666667  4.000000
- [736]  6.000000  7.500000  6.428571  5.111111  5.714286  6.500000  6.222222
- [743]  4.000000  6.222222  8.000000  4.666667  5.000000  4.000000  6.857143
- [750]  5.166667  6.500000  6.000000  5.000000  5.500000  4.750000  8.200000
- [757]  7.000000  5.857143  5.142857  8.500000  6.250000  6.100000  6.500000
- [764]  4.600000  4.800000  6.111111  6.750000  7.500000       NaN  5.166667
- [771]  6.000000  8.600000  7.333333  6.750000  5.625000  7.750000  6.428571
- [778] 10.500000  6.500000  6.750000  6.250000  6.333333  5.714286  4.500000
- [785]  6.400000  3.000000  6.000000  6.000000  5.000000  7.000000  5.333333
- [792]  6.000000  5.000000  6.400000  5.875000  5.400000  3.000000  6.500000
- [799]  4.666667  6.000000  4.000000  5.800000  6.571429  5.750000  6.200000
- [806]  4.250000  6.400000  5.750000  6.111111  5.666667  6.166667  4.000000
- [813]  7.500000  4.000000  5.666667  7.500000  5.300000  7.000000  5.545455
- [820]  4.666667  5.000000  7.333333  4.600000  5.666667  4.250000  5.166667
- [827]  5.833333  6.500000  6.500000  5.250000  6.600000  5.285714  6.250000
- [834]  5.666667  5.833333  5.000000  9.000000  6.600000  6.571429  4.600000
- [841]  8.000000  7.333333  6.166667  5.375000  5.166667  7.400000  5.666667
- [848]  7.000000  6.250000  7.666667  4.500000  5.000000  4.888889  7.125000
- [855]  5.666667  5.666667  5.333333  5.285714  6.200000  5.142857  5.250000
- [862]  6.000000  7.166667  4.333333  6.000000  5.000000  6.000000  5.500000
- [869]  5.571429  5.500000  6.000000  6.500000  6.600000  5.181818  5.444444
- [876]  4.333333  5.000000  6.666667  5.625000  6.333333  5.500000  6.750000
- [883]  5.400000  6.000000  6.142857  5.800000  6.000000  4.285714  4.666667
- [890]  7.000000  5.000000  6.111111  7.000000  4.500000  4.750000  5.333333
- [897]  6.000000  5.000000  5.500000  6.714286  5.000000  5.666667  7.666667
- [904]  5.857143  4.250000  5.166667  6.333333  6.200000  4.500000  5.666667
- [911]  6.400000  6.285714  6.666667  5.888889  6.333333  6.750000  6.000000
- [918]  4.000000  5.333333  6.333333  5.000000  5.200000  6.000000  6.000000
- [925]  6.000000  7.000000  7.000000  6.333333  6.333333  6.400000  6.500000
- [932]  5.857143  6.333333  4.000000  6.142857  6.600000  6.750000  6.666667
- [939]  5.428571  6.333333  7.333333  6.900000  6.909091  5.500000  5.714286
- [946]  6.500000  5.000000  7.333333  6.833333  5.800000  5.000000  6.166667
- [953]  6.000000  4.333333  7.000000  6.333333  6.166667  5.200000  8.250000
- [960]  6.666667  6.900000  6.600000  6.800000  4.800000  5.857143  6.600000
- [967]  8.250000  6.000000  6.500000  6.750000  5.666667  6.333333  5.750000
- [974]  5.500000  6.600000  6.571429  3.857143  7.000000  5.000000  6.000000
- [981]  6.625000  4.000000  5.000000  3.000000  7.000000  5.777778  6.000000
- [988]  6.777778  5.750000  5.000000  5.666667  8.000000  5.571429  7.166667
- [995]  6.000000  7.000000  8.500000  6.400000  5.250000  6.666667
-
-$knnk
- [1] 6.097561 5.981707 6.029885 5.988032 6.057692 5.890380 5.840970 6.028846
- [9] 5.986772 5.860000 6.181818 6.333333 6.307692      NaN 5.266667
-
-> 
-> ## A weighted graph
-> g5 <- graph.star(10)
-> E(g5)$weight <- seq(ecount(g5))
-> graph.knn(g5)
-$knn
- [1]  1.000000 45.000000 22.500000 15.000000 11.250000  9.000000  7.500000
- [8]  6.428571  5.625000  5.000000
-
-$knnk
-[1] 14.14484      NaN      NaN      NaN      NaN      NaN      NaN      NaN
-[9]  1.00000
-
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.maxflow.R igraph-0.6.5/interfaces/R/tests/graph.maxflow.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.maxflow.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.maxflow.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-E <- rbind( c(1,3,3), c(3,4,1), c(4,2,2), c(1,5,1), c(5,6,2), c(6,2,10))
-colnames(E) <- c("from", "to", "capacity")
-g1 <- graph.data.frame(as.data.frame(E))
-graph.maxflow(g1, source="1", target="2")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.maxflow.Rout.save igraph-0.6.5/interfaces/R/tests/graph.maxflow.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.maxflow.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.maxflow.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> E <- rbind( c(1,3,3), c(3,4,1), c(4,2,2), c(1,5,1), c(5,6,2), c(6,2,10))
-> colnames(E) <- c("from", "to", "capacity")
-> g1 <- graph.data.frame(as.data.frame(E))
-> graph.maxflow(g1, source="1", target="2")
-$value
-[1] 2
-
-$flow
-[1] 1 1 1 1 1 1
-
-$cut
-[1] 2 4
-
-$partition1
-[1] 3 4 5 6
-
-$partition2
-[1] 1 2
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.mincut.R igraph-0.6.5/interfaces/R/tests/graph.mincut.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.mincut.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.mincut.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-library(igraph)
-
-g2 <- graph( c(1,2,2,3,3,4, 1,6,6,5,5,4, 4,1) )
-E(g2)$capacity <- c(3,1,2, 10,1,3, 2)
-graph.mincut(g2, value.only=FALSE)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.mincut.Rout.save igraph-0.6.5/interfaces/R/tests/graph.mincut.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.mincut.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.mincut.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g2 <- graph( c(1,2,2,3,3,4, 1,6,6,5,5,4, 4,1) )
-> E(g2)$capacity <- c(3,1,2, 10,1,3, 2)
-> graph.mincut(g2, value.only=FALSE)
-$value
-[1] 1
-
-$cut
-[1] 2
-
-$partition1
-[1] 1 3 4 5 6
-
-$partition2
-[1] 2
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.subisomorphic.vf2.R igraph-0.6.5/interfaces/R/tests/graph.subisomorphic.vf2.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.subisomorphic.vf2.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.subisomorphic.vf2.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-g1 <- erdos.renyi.game(20,6/20)
-g2 <- erdos.renyi.game(20,6/20)
-g <- g1 %du% g2
-
-graph.subisomorphic.vf2(g, g1)
-graph.subisomorphic.vf2(g, g2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graph.subisomorphic.vf2.Rout.save igraph-0.6.5/interfaces/R/tests/graph.subisomorphic.vf2.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graph.subisomorphic.vf2.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graph.subisomorphic.vf2.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> g1 <- erdos.renyi.game(20,6/20)
-> g2 <- erdos.renyi.game(20,6/20)
-> g <- g1 %du% g2
-> 
-> graph.subisomorphic.vf2(g, g1)
-$iso
-[1] TRUE
-
-$map12
- [1]  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20  0  0  0  0  0
-[26]  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0
-
-$map21
- [1]  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20
-
-> graph.subisomorphic.vf2(g, g2)
-$iso
-[1] TRUE
-
-$map12
- [1]  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  3  4  5
-[26]  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20
-
-$map21
- [1] 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graphNEL.R igraph-0.6.5/interfaces/R/tests/graphNEL.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/graphNEL.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graphNEL.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-
-library(igraph)
-library(graph, warn.conflicts=FALSE)
-
-g <- erdos.renyi.game(100, 5/100)
-N <- igraph.to.graphNEL(g)
-g2 <- igraph.from.graphNEL(N)
-graph.isomorphic.vf2(g, g2)
-
-## Attributes
-
-V(g)$name <- as.character(vcount(g):1)
-E(g)$weight <- sample(1:10, ecount(g), replace=TRUE)
-g$name <- "Foobar"
-
-N <- igraph.to.graphNEL(g)
-g2 <- igraph.from.graphNEL(N)
-graph.isomorphic(g, g2)
-
-all(V(g)$name == V(g2)$name)
-A <- get.adjacency(g, attr="weight", sparse=FALSE)
-A2 <- get.adjacency(g2, attr="weight", sparse=FALSE)
-all(A == A2)
-g$name == g2$name
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/graphNEL.Rout.save igraph-0.6.5/interfaces/R/tests/graphNEL.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/graphNEL.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/graphNEL.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,67 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> library(graph, warn.conflicts=FALSE)
-> 
-> g <- erdos.renyi.game(100, 5/100)
-> N <- igraph.to.graphNEL(g)
-> g2 <- igraph.from.graphNEL(N)
-> graph.isomorphic.vf2(g, g2)
-$iso
-[1] TRUE
-
-$map12
-  [1]   1   2   3   4   5   6   7   8   9  10  11  12  13  14  15  16  17  18
- [19]  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36
- [37]  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54
- [55]  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72
- [73]  73  74  75  76  77  78  79  80  81  82  83  84  85  86  87  88  89  90
- [91]  91  92  93  94  95  96  97  98  99 100
-
-$map21
-  [1]   1   2   3   4   5   6   7   8   9  10  11  12  13  14  15  16  17  18
- [19]  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36
- [37]  37  38  39  40  41  42  43  44  45  46  47  48  49  50  51  52  53  54
- [55]  55  56  57  58  59  60  61  62  63  64  65  66  67  68  69  70  71  72
- [73]  73  74  75  76  77  78  79  80  81  82  83  84  85  86  87  88  89  90
- [91]  91  92  93  94  95  96  97  98  99 100
-
-> 
-> ## Attributes
-> 
-> V(g)$name <- as.character(vcount(g):1)
-> E(g)$weight <- sample(1:10, ecount(g), replace=TRUE)
-> g$name <- "Foobar"
-> 
-> N <- igraph.to.graphNEL(g)
-> g2 <- igraph.from.graphNEL(N)
-> graph.isomorphic(g, g2)
-[1] TRUE
-> 
-> all(V(g)$name == V(g2)$name)
-[1] TRUE
-> A <- get.adjacency(g, attr="weight", sparse=FALSE)
-> A2 <- get.adjacency(g2, attr="weight", sparse=FALSE)
-> all(A == A2)
-[1] TRUE
-> g$name == g2$name
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/igraph.options.R igraph-0.6.5/interfaces/R/tests/igraph.options.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/igraph.options.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/igraph.options.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.ring(5)
-V(g)$name <- letters[1:5]
-E(g)$weight <- 5:1
-g$name <- "A small ring"
-
-g
-
-igraph.options(print.vertex.attributes=TRUE)
-getIgraphOpt("print.vertex.attributes")
-g
-
-igraph.options(print.edge.attributes=TRUE, print.vertex.attributes=FALSE)
-g
-
-igraph.options(print.graph.attributes=TRUE)
-g
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/igraph.options.Rout.save igraph-0.6.5/interfaces/R/tests/igraph.options.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/igraph.options.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/igraph.options.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.ring(5)
-> V(g)$name <- letters[1:5]
-> E(g)$weight <- 5:1
-> g$name <- "A small ring"
-> 
-> g
-IGRAPH UNW- 5 5 -- A small ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ edges (vertex names):
-[1] a--b b--c c--d d--e a--e
-> 
-> igraph.options(print.vertex.attributes=TRUE)
-> getIgraphOpt("print.vertex.attributes")
-[1] TRUE
-> g
-IGRAPH UNW- 5 5 -- A small ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ vertex attributes:
-    name
-[1]    a
-[2]    b
-[3]    c
-[4]    d
-[5]    e
-+ edges (vertex names):
-[1] a--b b--c c--d d--e a--e
-> 
-> igraph.options(print.edge.attributes=TRUE, print.vertex.attributes=FALSE)
-> g
-IGRAPH UNW- 5 5 -- A small ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ edges (vertex names) and their attributes:
-    edge weight
-[1] a--b      5
-[2] b--c      4
-[3] c--d      3
-[4] d--e      2
-[5] a--e      1
-> 
-> igraph.options(print.graph.attributes=TRUE)
-> g
-IGRAPH UNW- 5 5 -- A small ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ graph attributes:
-[[name]]
-[1] "A small ring"
-[[mutual]]
-[1] FALSE
-[[circular]]
-[1] TRUE
-+ edges (vertex names) and their attributes:
-    edge weight
-[1] a--b      5
-[2] b--c      4
-[3] c--d      3
-[4] d--e      2
-[5] a--e      1
-> 
-> proc.time()
-   user  system elapsed 
-  0.311   0.039   0.360 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/independent.vertex.sets.R igraph-0.6.5/interfaces/R/tests/independent.vertex.sets.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/independent.vertex.sets.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/independent.vertex.sets.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 0.8)
-ivs <- independent.vertex.sets(g, min=independence.number(g))
-ec <- sapply(seq_along(ivs), function(x)
-             ecount(induced.subgraph(g, ivs[[x]])))
-unique(ec)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/independent.vertex.sets.Rout.save igraph-0.6.5/interfaces/R/tests/independent.vertex.sets.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/independent.vertex.sets.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/independent.vertex.sets.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 0.8)
-> ivs <- independent.vertex.sets(g, min=independence.number(g))
-> ec <- sapply(seq_along(ivs), function(x)
-+              ecount(induced.subgraph(g, ivs[[x]])))
-> unique(ec)
-[1] 0
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/indexing.R igraph-0.6.5/interfaces/R/tests/indexing.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/indexing.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/indexing.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,121 +0,0 @@
-
-library(igraph)
-library(Matrix, quietly=TRUE, warn.conflicts=FALSE)
-
-## Are these vertices connected?
-g <- graph.tree(20)
-g[1,2]
-g[c(1,1,7), c(2,3,14)]
-g[c(1,1,7), c(5,3,12)]
-g[c(1,1,1,1), c(2,3,2,2)]
-g[c(8,17), c(17,8)]
-
-## The same with symbolic names
-V(g)$name <- letters[1:vcount(g)]
-g['a','b']
-g[c('a','a','g'), c('b','c','n')]
-g[c('a','a','g'), c('e','c','l')]
-g[c('a','a','a','a'), c('b','c','b','b')]
-g[c('h','q'), c('q','h')]
-
-## Logical vectors
-g[degree(g,mode="in")==0,2]
-g[2:3,TRUE]
-
-## Negative indices
-g[2:3,-1]
-
-## Weighted graphs
-el <- get.edgelist(g, names=FALSE)
-E(g)$weight <- el[,1] * el[,2]
-g[1,2]
-g[c(1,1,7), c(2,3,14)]
-g[c(1,1,7), c(5,3,12)]
-g[c(1,1,1,1), c(2,3,2,2)]
-g[c(8,17), c(17,8)]
-
-## Weighted graph, with symbolic names
-g['a','b']
-g[c('a','a','g'), c('b','c','n')]
-g[c('a','a','g'), c('e','c','l')]
-g[c('a','a','a','a'), c('b','c','b','b')]
-g[c('h','q'), c('q','h')]
-
-################################################################
-
-## Adjacent vertices
-g[[1, ]]
-g[[, 2]]
-g[[, 2, directed=FALSE]]
-g[[2, directed=FALSE]]
-
-g[[1:3, ]]
-g[[, 1:3]]
-
-# Same with vertex names
-g[['a', ]]
-g[[, 'b']]
-g[[, 'b', directed=FALSE]]
-g[['b', directed=FALSE]]
-
-g[[letters[1:3],]]
-g[[, letters[1:3]]]
-
-# Logical vectors
-g[[degree(g,mode="in")==0,]]
-
-# Filtering on both ends
-g[[1:10, 1:10]]
-
-################################################################
-
-## Query edge ids
-g[1,2, edges=TRUE]
-g[c(1,1,7), c(2,3,14), edges=TRUE]
-g[c(1,1,7), c(5,3,12), edges=TRUE]
-g[c(1,1,1,1), c(2,3,2,2), edges=TRUE]
-g[c(8,17), c(17,8), edges=TRUE]
-
-## The same with symbolic names
-g['a','b', edges=TRUE]
-g[c('a','a','g'), c('b','c','n'), edges=TRUE]
-g[c('a','a','g'), c('e','c','l'), edges=TRUE]
-g[c('a','a','a','a'), c('b','c','b','b'), edges=TRUE]
-g[c('h','q'), c('q','h'), edges=TRUE]
-
-################################################################
-
-## Incident edges of vertices
-g[[1, , edges=TRUE]]
-g[[, 2, edges=TRUE]]
-g[[, 2, directed=FALSE, edges=TRUE]]
-g[[2, directed=FALSE, edges=TRUE]]
-
-g[[1:3, , edges=TRUE]]
-g[[, 1:3, edges=TRUE]]
-
-# Same with vertex names
-g[['a', , edges=TRUE]]
-g[[, 'b', edges=TRUE]]
-g[[, 'b', directed=FALSE, edges=TRUE]]
-g[['b', directed=FALSE, edges=TRUE]]
-
-g[[letters[1:3],, edges=TRUE]]
-g[[, letters[1:3], edges=TRUE]]
-
-# Filtering on both ends
-g[[1:10, 1:10, edges=TRUE]]
-
-#################################################################
-
-## from & to
-g <- graph.tree(20)
-g[from=c(1,2,2,3), to=c(3,4,8,7)]
-
-V(g)$name <- letters[1:20]
-g[from=c("a","b","b","c"), to=c("c","d","h","g")]
-
-E(g)$weight <- (1:ecount(g)) ^ 2 
-g[from=c("a","b","b","c"), to=c("c","d","h","g")]
-
-g[from=c("a","b","b","c"), to=c("c","d","h","g"), edges=TRUE]
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/indexing.Rout.save igraph-0.6.5/interfaces/R/tests/indexing.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/indexing.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/indexing.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,464 +0,0 @@
-
-R version 2.14.1 (2011-12-22)
-Copyright (C) 2011 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> library(Matrix, quietly=TRUE, warn.conflicts=FALSE)
-> 
-> ## Are these vertices connected?
-> g <- graph.tree(20)
-> g[1,2]
-[1] 1
-> g[c(1,1,7), c(2,3,14)]
-3 x 3 sparse Matrix of class "dgCMatrix"
-          
-[1,] 1 1 .
-[2,] 1 1 .
-[3,] . . 1
-> g[c(1,1,7), c(5,3,12)]
-3 x 3 sparse Matrix of class "dgCMatrix"
-          
-[1,] . 1 .
-[2,] . 1 .
-[3,] . . .
-> g[c(1,1,1,1), c(2,3,2,2)]
-4 x 4 sparse Matrix of class "dgCMatrix"
-            
-[1,] 1 1 1 1
-[2,] 1 1 1 1
-[3,] 1 1 1 1
-[4,] 1 1 1 1
-> g[c(8,17), c(17,8)]
-2 x 2 sparse Matrix of class "dgCMatrix"
-        
-[1,] 1 .
-[2,] . .
-> 
-> ## The same with symbolic names
-> V(g)$name <- letters[1:vcount(g)]
-> g['a','b']
-[1] 1
-> g[c('a','a','g'), c('b','c','n')]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  b c n
-a 1 1 .
-a 1 1 .
-g . . 1
-> g[c('a','a','g'), c('e','c','l')]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  e c l
-a . 1 .
-a . 1 .
-g . . .
-> g[c('a','a','a','a'), c('b','c','b','b')]
-4 x 4 sparse Matrix of class "dgCMatrix"
-  b c b b
-a 1 1 1 1
-a 1 1 1 1
-a 1 1 1 1
-a 1 1 1 1
-> g[c('h','q'), c('q','h')]
-2 x 2 sparse Matrix of class "dgCMatrix"
-  q h
-h 1 .
-q . .
-> 
-> ## Logical vectors
-> g[degree(g,mode="in")==0,2]
-[1] 1
-> g[2:3,TRUE]
-2 x 20 sparse Matrix of class "dgCMatrix"
-   [[ suppressing 20 column names 'a', 'b', 'c' ... ]]
-                                         
-b . . . 1 1 . . . . . . . . . . . . . . .
-c . . . . . 1 1 . . . . . . . . . . . . .
-> 
-> ## Negative indices
-> g[2:3,-1]
-2 x 19 sparse Matrix of class "dgCMatrix"
-   [[ suppressing 19 column names 'b', 'c', 'd' ... ]]
-                                       
-b . . 1 1 . . . . . . . . . . . . . . .
-c . . . . 1 1 . . . . . . . . . . . . .
-> 
-> ## Weighted graphs
-> el <- get.edgelist(g, names=FALSE)
-> E(g)$weight <- el[,1] * el[,2]
-> g[1,2]
-[1] 2
-> g[c(1,1,7), c(2,3,14)]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  b c  n
-a 2 3  .
-a 2 3  .
-g . . 98
-> g[c(1,1,7), c(5,3,12)]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  e c l
-a . 3 .
-a . 3 .
-g . . .
-> g[c(1,1,1,1), c(2,3,2,2)]
-4 x 4 sparse Matrix of class "dgCMatrix"
-  b c b b
-a 2 3 2 2
-a 2 3 2 2
-a 2 3 2 2
-a 2 3 2 2
-> g[c(8,17), c(17,8)]
-2 x 2 sparse Matrix of class "dgCMatrix"
-    q h
-h 136 .
-q   . .
-> 
-> ## Weighted graph, with symbolic names
-> g['a','b']
-[1] 2
-> g[c('a','a','g'), c('b','c','n')]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  b c  n
-a 2 3  .
-a 2 3  .
-g . . 98
-> g[c('a','a','g'), c('e','c','l')]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  e c l
-a . 3 .
-a . 3 .
-g . . .
-> g[c('a','a','a','a'), c('b','c','b','b')]
-4 x 4 sparse Matrix of class "dgCMatrix"
-  b c b b
-a 2 3 2 2
-a 2 3 2 2
-a 2 3 2 2
-a 2 3 2 2
-> g[c('h','q'), c('q','h')]
-2 x 2 sparse Matrix of class "dgCMatrix"
-    q h
-h 136 .
-q   . .
-> 
-> ################################################################
-> 
-> ## Adjacent vertices
-> g[[1, ]]
-$a
-[1] 2 3
-
-> g[[, 2]]
-$b
-[1] 1
-
-> g[[, 2, directed=FALSE]]
-$b
-[1] 1 4 5
-
-> g[[2, directed=FALSE]]
-$b
-[1] 1 4 5
-
-> 
-> g[[1:3, ]]
-$a
-[1] 2 3
-
-$b
-[1] 4 5
-
-$c
-[1] 6 7
-
-> g[[, 1:3]]
-$a
-numeric(0)
-
-$b
-[1] 1
-
-$c
-[1] 1
-
-> 
-> # Same with vertex names
-> g[['a', ]]
-$a
-[1] 2 3
-
-> g[[, 'b']]
-$b
-[1] 1
-
-> g[[, 'b', directed=FALSE]]
-$b
-[1] 1 4 5
-
-> g[['b', directed=FALSE]]
-$b
-[1] 1 4 5
-
-> 
-> g[[letters[1:3],]]
-$a
-[1] 2 3
-
-$b
-[1] 4 5
-
-$c
-[1] 6 7
-
-> g[[, letters[1:3]]]
-$a
-numeric(0)
-
-$b
-[1] 1
-
-$c
-[1] 1
-
-> 
-> # Logical vectors
-> g[[degree(g,mode="in")==0,]]
-$a
-[1] 2 3
-
-> 
-> # Filtering on both ends
-> g[[1:10, 1:10]]
-$a
-[1] 2 3
-
-$b
-[1] 4 5
-
-$c
-[1] 6 7
-
-$d
-[1] 8 9
-
-$e
-[1] 10
-
-$f
-numeric(0)
-
-$g
-numeric(0)
-
-$h
-numeric(0)
-
-$i
-numeric(0)
-
-$j
-numeric(0)
-
-> 
-> ################################################################
-> 
-> ## Query edge ids
-> g[1,2, edges=TRUE]
-[1] 1
-> g[c(1,1,7), c(2,3,14), edges=TRUE]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  b c  n
-a 1 2  .
-a 1 2  .
-g . . 13
-> g[c(1,1,7), c(5,3,12), edges=TRUE]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  e c l
-a . 2 .
-a . 2 .
-g . . .
-> g[c(1,1,1,1), c(2,3,2,2), edges=TRUE]
-4 x 4 sparse Matrix of class "dgCMatrix"
-  b c b b
-a 1 2 1 1
-a 1 2 1 1
-a 1 2 1 1
-a 1 2 1 1
-> g[c(8,17), c(17,8), edges=TRUE]
-2 x 2 sparse Matrix of class "dgCMatrix"
-   q h
-h 16 .
-q  . .
-> 
-> ## The same with symbolic names
-> g['a','b', edges=TRUE]
-[1] 1
-> g[c('a','a','g'), c('b','c','n'), edges=TRUE]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  b c  n
-a 1 2  .
-a 1 2  .
-g . . 13
-> g[c('a','a','g'), c('e','c','l'), edges=TRUE]
-3 x 3 sparse Matrix of class "dgCMatrix"
-  e c l
-a . 2 .
-a . 2 .
-g . . .
-> g[c('a','a','a','a'), c('b','c','b','b'), edges=TRUE]
-4 x 4 sparse Matrix of class "dgCMatrix"
-  b c b b
-a 1 2 1 1
-a 1 2 1 1
-a 1 2 1 1
-a 1 2 1 1
-> g[c('h','q'), c('q','h'), edges=TRUE]
-2 x 2 sparse Matrix of class "dgCMatrix"
-   q h
-h 16 .
-q  . .
-> 
-> ################################################################
-> 
-> ## Incident edges of vertices
-> g[[1, , edges=TRUE]]
-$a
-[1] 1 2
-
-> g[[, 2, edges=TRUE]]
-$b
-[1] 1
-
-> g[[, 2, directed=FALSE, edges=TRUE]]
-$b
-[1] 3 4 1
-
-> g[[2, directed=FALSE, edges=TRUE]]
-$b
-[1] 3 4 1
-
-> 
-> g[[1:3, , edges=TRUE]]
-$a
-[1] 1 2
-
-$b
-[1] 3 4
-
-$c
-[1] 5 6
-
-> g[[, 1:3, edges=TRUE]]
-$a
-numeric(0)
-
-$b
-[1] 1
-
-$c
-[1] 2
-
-> 
-> # Same with vertex names
-> g[['a', , edges=TRUE]]
-$a
-[1] 1 2
-
-> g[[, 'b', edges=TRUE]]
-$b
-[1] 1
-
-> g[[, 'b', directed=FALSE, edges=TRUE]]
-$b
-[1] 3 4 1
-
-> g[['b', directed=FALSE, edges=TRUE]]
-$b
-[1] 3 4 1
-
-> 
-> g[[letters[1:3],, edges=TRUE]]
-$a
-[1] 1 2
-
-$b
-[1] 3 4
-
-$c
-[1] 5 6
-
-> g[[, letters[1:3], edges=TRUE]]
-$a
-numeric(0)
-
-$b
-[1] 1
-
-$c
-[1] 2
-
-> 
-> # Filtering on both ends
-> g[[1:10, 1:10, edges=TRUE]]
-[[1]]
-[1] 1 2
-
-[[2]]
-[1] 3 4
-
-[[3]]
-[1] 5 6
-
-[[4]]
-[1] 7 8
-
-[[5]]
-[1] 9
-
-[[6]]
-numeric(0)
-
-[[7]]
-numeric(0)
-
-[[8]]
-numeric(0)
-
-[[9]]
-numeric(0)
-
-[[10]]
-numeric(0)
-
-> 
-> #################################################################
-> 
-> ## from & to
-> g <- graph.tree(20)
-> g[from=c(1,2,2,3), to=c(3,4,8,7)]
-[1] 1 1 0 1
-> 
-> V(g)$name <- letters[1:20]
-> g[from=c("a","b","b","c"), to=c("c","d","h","g")]
-[1] 1 1 0 1
-> 
-> E(g)$weight <- (1:ecount(g)) ^ 2 
-> g[from=c("a","b","b","c"), to=c("c","d","h","g")]
-[1]  4  9  0 36
-> 
-> g[from=c("a","b","b","c"), to=c("c","d","h","g"), edges=TRUE]
-[1] 2 3 0 6
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/indexing2.R igraph-0.6.5/interfaces/R/tests/indexing2.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/indexing2.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/indexing2.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.empty(10)
-g[1,2] <- TRUE
-g
-g[2,1] <- TRUE
-g
-g[2,1] <- NULL
-g
-g[1,2] <- FALSE
-g
-
-g <- graph.empty(10)
-g[-1,1] <- 1
-g
-
-## Weighted graph
-
-igraph.options(print.edge.attributes=TRUE)
-g <- graph.empty(10)
-g <- set.edge.attribute(g, "weight", c(), 1)
-g[1,2] <- 1
-g
-g[2,1] <- 2
-g
-g[1,2] <- 3
-g
-g[1:2,2:3] <- -1
-g
-g[1,2] <- NULL
-g
-
-## Using vertex names
-
-g <- graph.empty(10)
-V(g)$name <- letters[1:vcount(g)]
-g['a','b'] <- TRUE
-g['b','c'] <- TRUE
-g
-g[c('a','f'),c('f','a')] <- TRUE
-g
-g[c('a','c','h'), c('a','b','c'), attr="weight"] <- 3
-print(g, e=T)
-
-## from-to
-
-g <- graph.empty(10)
-V(g)$name <- letters[1:vcount(g)]
-g[from=c('a','c','h'), to=c('a','b','c')] <- 1
-g[from=c('a','c','h','d'), to=c('a','b','c','e')]
-g
-
-g[from=c('a','c','h','a'), to=c('a','a','a','e'), attr="weight"] <- 3
-g[from=c('a','c','h','a','c','c'), to=c('a','a','a','e','f','b')]
-print(g, e=T)
-
-## from-to multiple values
-
-g <- graph.empty(10)
-V(g)$name <- letters[1:vcount(g)]
-g[from=c('a','c','h'), to=c('a','b','c')] <- 1
-g[from=c('a','c','h','a'), to=c('a','a','a','e'), attr="weight"] <- 5:8
-g[from=c('a','c','h','a','c','c'), to=c('a','a','a','e','f','b')]
-print(g, e=T)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/indexing2.Rout.save igraph-0.6.5/interfaces/R/tests/indexing2.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/indexing2.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/indexing2.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,186 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.empty(10)
-> g[1,2] <- TRUE
-> g
-IGRAPH D--- 10 1 -- 
-+ edges:
-[1] 1->2
-> g[2,1] <- TRUE
-> g
-IGRAPH D--- 10 2 -- 
-+ edges:
-[1] 1->2 2->1
-> g[2,1] <- NULL
-> g
-IGRAPH D--- 10 1 -- 
-+ edges:
-[1] 1->2
-> g[1,2] <- FALSE
-> g
-IGRAPH D--- 10 0 -- 
-> 
-> g <- graph.empty(10)
-> g[-1,1] <- 1
-> g
-IGRAPH D--- 10 9 -- 
-+ edges:
-[1]  2->1  3->1  4->1  5->1  6->1  7->1  8->1  9->1 10->1
-> 
-> ## Weighted graph
-> 
-> igraph.options(print.edge.attributes=TRUE)
-> g <- graph.empty(10)
-> g <- set.edge.attribute(g, "weight", c(), 1)
-> g[1,2] <- 1
-> g
-IGRAPH D-W- 10 1 -- 
-+ attr: weight (e/n)
-+ edges and their attributes:
-    edge weight
-[1] 1->2      1
-> g[2,1] <- 2
-> g
-IGRAPH D-W- 10 2 -- 
-+ attr: weight (e/n)
-+ edges and their attributes:
-    edge weight
-[1] 1->2      1
-[2] 2->1      2
-> g[1,2] <- 3
-> g
-IGRAPH D-W- 10 2 -- 
-+ attr: weight (e/n)
-+ edges and their attributes:
-    edge weight
-[1] 1->2      3
-[2] 2->1      2
-> g[1:2,2:3] <- -1
-> g
-IGRAPH D-W- 10 5 -- 
-+ attr: weight (e/n)
-+ edges and their attributes:
-    edge weight
-[1] 1->2     -1
-[2] 2->1      2
-[3] 1->3     -1
-[4] 2->2     -1
-[5] 2->3     -1
-> g[1,2] <- NULL
-> g
-IGRAPH D-W- 10 4 -- 
-+ attr: weight (e/n)
-+ edges and their attributes:
-    edge weight
-[1] 2->1      2
-[2] 1->3     -1
-[3] 2->2     -1
-[4] 2->3     -1
-> 
-> ## Using vertex names
-> 
-> g <- graph.empty(10)
-> V(g)$name <- letters[1:vcount(g)]
-> g['a','b'] <- TRUE
-> g['b','c'] <- TRUE
-> g
-IGRAPH DN-- 10 2 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-[1] a->b b->c
-> g[c('a','f'),c('f','a')] <- TRUE
-> g
-IGRAPH DN-- 10 6 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-[1] a->b b->c a->f a->a f->f f->a
-> g[c('a','c','h'), c('a','b','c'), attr="weight"] <- 3
-> print(g, e=T)
-IGRAPH DNW- 10 13 -- 
-+ attr: name (v/c), weight (e/n)
-+ edges (vertex names) and their attributes:
-     edge weight
-[1]  a->b      3
-[2]  b->c     NA
-[3]  a->f     NA
-[4]  a->a      3
-[5]  f->f     NA
-[6]  f->a     NA
-[7]  a->c      3
-[8]  c->a      3
-[9]  c->b      3
-[10] c->c      3
-[11] h->a      3
-[12] h->b      3
-[13] h->c      3
-> 
-> ## from-to
-> 
-> g <- graph.empty(10)
-> V(g)$name <- letters[1:vcount(g)]
-> g[from=c('a','c','h'), to=c('a','b','c')] <- 1
-> g[from=c('a','c','h','d'), to=c('a','b','c','e')]
-[1] 1 1 1 0
-> g
-IGRAPH DN-- 10 3 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-[1] a->a c->b h->c
-> 
-> g[from=c('a','c','h','a'), to=c('a','a','a','e'), attr="weight"] <- 3
-> g[from=c('a','c','h','a','c','c'), to=c('a','a','a','e','f','b')]
-[1]  3  3  3  3  0 NA
-> print(g, e=T)
-IGRAPH DNW- 10 6 -- 
-+ attr: name (v/c), weight (e/n)
-+ edges (vertex names) and their attributes:
-    edge weight
-[1] a->a      3
-[2] c->b     NA
-[3] h->c     NA
-[4] c->a      3
-[5] h->a      3
-[6] a->e      3
-> 
-> ## from-to multiple values
-> 
-> g <- graph.empty(10)
-> V(g)$name <- letters[1:vcount(g)]
-> g[from=c('a','c','h'), to=c('a','b','c')] <- 1
-> g[from=c('a','c','h','a'), to=c('a','a','a','e'), attr="weight"] <- 5:8
-> g[from=c('a','c','h','a','c','c'), to=c('a','a','a','e','f','b')]
-[1]  5  6  7  8  0 NA
-> print(g, e=T)
-IGRAPH DNW- 10 6 -- 
-+ attr: name (v/c), weight (e/n)
-+ edges (vertex names) and their attributes:
-    edge weight
-[1] a->a      5
-[2] c->b     NA
-[3] h->c     NA
-[4] c->a      6
-[5] h->a      7
-[6] a->e      8
-> 
-> proc.time()
-   user  system elapsed 
-  0.348   0.039   0.392 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/is.bipartite.R igraph-0.6.5/interfaces/R/tests/is.bipartite.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/is.bipartite.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/is.bipartite.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-
-library(igraph)
-
-I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-g <- graph.incidence(I)
-bipartite.mapping(g)$res
-
-set.seed(42)
-I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-g <- graph.incidence(I)
-bipartite.mapping(g)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/is.bipartite.Rout.save igraph-0.6.5/interfaces/R/tests/is.bipartite.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/is.bipartite.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/is.bipartite.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-> g <- graph.incidence(I)
-> bipartite.mapping(g)$res
-[1] TRUE
-> 
-> set.seed(42)
-> I <- matrix(sample(0:1, 35, replace=TRUE, prob=c(3,1)), nc=5)
-> g <- graph.incidence(I)
-> bipartite.mapping(g)
-$res
-[1] TRUE
-
-$type
- [1] FALSE FALSE FALSE FALSE FALSE FALSE FALSE  TRUE  TRUE  TRUE  TRUE  TRUE
-
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/is.chordal.R igraph-0.6.5/interfaces/R/tests/is.chordal.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/is.chordal.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/is.chordal.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-
-library(igraph)
-
-## The examples from the Tarjan-Yannakakis paper
-g1 <- graph.formula(A-B:C:I, B-A:C:D, C-A:B:E:H, D-B:E:F,
-                    E-C:D:F:H, F-D:E:G, G-F:H, H-C:E:G:I,
-                    I-A:H)
-g1 <- simplify(g1)
-maximum.cardinality.search(g1)
-is.chordal(g1, fillin=TRUE)
-
-g2 <- graph.formula(A-B:E, B-A:E:F:D, C-E:D:G, D-B:F:E:C:G,
-                    E-A:B:C:D:F, F-B:D:E, G-C:D:H:I, H-G:I:J,
-                    I-G:H:J, J-H:I)
-g2 <- simplify(g2)
-maximum.cardinality.search(g2)
-is.chordal(g2, fillin=TRUE)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/is.chordal.Rout.save igraph-0.6.5/interfaces/R/tests/is.chordal.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/is.chordal.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/is.chordal.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## The examples from the Tarjan-Yannakakis paper
-> g1 <- graph.formula(A-B:C:I, B-A:C:D, C-A:B:E:H, D-B:E:F,
-+                     E-C:D:F:H, F-D:E:G, G-F:H, H-C:E:G:I,
-+                     I-A:H)
-> g1 <- simplify(g1)
-> maximum.cardinality.search(g1)
-$alpha
-[1] 9 4 6 8 3 5 7 2 1
-
-$alpham1
-[1] 9 8 5 2 6 3 7 4 1
-
-> is.chordal(g1, fillin=TRUE)
-$chordal
-[1] FALSE
-
-$fillin
- [1] 2 6 8 7 5 7 2 7 6 1 7 1
-
-$newgraph
-NULL
-
-> 
-> g2 <- graph.formula(A-B:E, B-A:E:F:D, C-E:D:G, D-B:F:E:C:G,
-+                     E-A:B:C:D:F, F-B:D:E, G-C:D:H:I, H-G:I:J,
-+                     I-G:H:J, J-H:I)
-> g2 <- simplify(g2)
-> maximum.cardinality.search(g2)
-$alpha
- [1] 10  8  9  6  7  5  4  2  3  1
-
-$alpham1
- [1] 10  8  9  7  6  4  5  2  3  1
-
-> is.chordal(g2, fillin=TRUE)
-$chordal
-[1] TRUE
-
-$fillin
-numeric(0)
-
-$newgraph
-NULL
-
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/iterators.R igraph-0.6.5/interfaces/R/tests/iterators.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/iterators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/iterators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
-
-library(igraph)
-
-## Create a small ring graph, assign attributes
-ring <- graph.formula( A-B-C-D-E-F-G-A )
-E(ring)$weight <- seq_len(ecount(ring))
-
-## Selection based on attributes
-E(ring)[ weight < 4 ]
-V(ring)[ c("A", "C") ]
-
-## TODO: %--%, %->%, other special functions
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/iterators.Rout.save igraph-0.6.5/interfaces/R/tests/iterators.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/iterators.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/iterators.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Create a small ring graph, assign attributes
-> ring <- graph.formula( A-B-C-D-E-F-G-A )
-> E(ring)$weight <- seq_len(ecount(ring))
-> 
-> ## Selection based on attributes
-> E(ring)[ weight < 4 ]
-Edge sequence:
-          
-[1] B -- A
-[2] G -- A
-[3] C -- B
-> V(ring)[ c("A", "C") ]
-Vertex sequence:
-[1] "A" "C"
-> 
-> ## TODO: %--%, %->%, other special functions
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/label.propagation.community.R igraph-0.6.5/interfaces/R/tests/label.propagation.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/label.propagation.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/label.propagation.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-set.seed(42)
-lpc <- label.propagation.community(g)
-lpc
-lpc$modularity == modularity(g, lpc$membership)
-membership(lpc)
-length(lpc)
-sizes(lpc)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/label.propagation.community.Rout.save igraph-0.6.5/interfaces/R/tests/label.propagation.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/label.propagation.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/label.propagation.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> set.seed(42)
-> lpc <- label.propagation.community(g)
-> lpc
-Graph community structure calculated with the label propagation algorithm
-Number of communities: 3 
-Modularity: 0.3744247 
-Membership vector:
- [1] 1 1 2 1 3 3 3 1 2 2 3 1 1 1 2 2 3 1 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2
-> lpc$modularity == modularity(g, lpc$membership)
-[1] TRUE
-> membership(lpc)
- [1] 1 1 2 1 3 3 3 1 2 2 3 1 1 1 2 2 3 1 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 2
-> length(lpc)
-[1] 3
-> sizes(lpc)
-Community sizes
- 1  2  3 
-10 19  5 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/largest.cliques.R igraph-0.6.5/interfaces/R/tests/largest.cliques.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/largest.cliques.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/largest.cliques.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50,20/50)
-lc <- largest.cliques(g)
-unique(sapply(lc, function(x) graph.density(induced.subgraph(g, x))))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/largest.cliques.Rout.save igraph-0.6.5/interfaces/R/tests/largest.cliques.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/largest.cliques.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/largest.cliques.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,26 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50,20/50)
-> lc <- largest.cliques(g)
-> unique(sapply(lc, function(x) graph.density(induced.subgraph(g, x))))
-[1] 1
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/largest.independent.vertex.sets.R igraph-0.6.5/interfaces/R/tests/largest.independent.vertex.sets.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/largest.independent.vertex.sets.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/largest.independent.vertex.sets.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(50, 0.8)
-livs <- largest.independent.vertex.sets(g)
-unique(sapply(livs, length)) == independence.number(g)
-
-ec <- sapply(seq_along(livs), function(x)
-             ecount(induced.subgraph(g, livs[[x]])))
-unique(ec)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/largest.independent.vertex.sets.Rout.save igraph-0.6.5/interfaces/R/tests/largest.independent.vertex.sets.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/largest.independent.vertex.sets.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/largest.independent.vertex.sets.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(50, 0.8)
-> livs <- largest.independent.vertex.sets(g)
-> unique(sapply(livs, length)) == independence.number(g)
-[1] TRUE
-> 
-> ec <- sapply(seq_along(livs), function(x)
-+              ecount(induced.subgraph(g, livs[[x]])))
-> unique(ec)
-[1] 0
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/layout.mds.R igraph-0.6.5/interfaces/R/tests/layout.mds.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/layout.mds.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/layout.mds.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-library(igraph)
-
-## A tree
-
-g <- graph.tree(10, 2, "undirected")
-
-mymds <- function(g) { 
-  sp <- shortest.paths(g)
-  sp <- sp * sp
-  sp <- sp - rowMeans(sp) - rep(rowMeans(sp), each=nrow(sp)) + mean(sp)
-  sp <- sp / -2
-  ei <- eigen(sp)
-  va <- sqrt(abs(ei$values[1:2]))
-  ei$vectors[,1:2] * rep(va, each=nrow(sp))
-}
-
-all(abs(mymds(g) - layout.mds(g)) < 1e-10)
-
-## plot(g, layout=ll)
-
-## A graph with multiple components
-
-set.seed(42)
-g <- graph.ring(10) + graph.ring(3)
-layout.mds(g)
-    
-## Small stress test
-
-for (i in 1:10) {
-  cat(".")
-  g <- erdos.renyi.game(100, 2/100)
-  l <- layout.mds(g)
-}
-cat("\n")
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/layout.mds.Rout.save igraph-0.6.5/interfaces/R/tests/layout.mds.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/layout.mds.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/layout.mds.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## A tree
-> 
-> g <- graph.tree(10, 2, "undirected")
-> 
-> mymds <- function(g) { 
-+   sp <- shortest.paths(g)
-+   sp <- sp * sp
-+   sp <- sp - rowMeans(sp) - rep(rowMeans(sp), each=nrow(sp)) + mean(sp)
-+   sp <- sp / -2
-+   ei <- eigen(sp)
-+   va <- sqrt(abs(ei$values[1:2]))
-+   ei$vectors[,1:2] * rep(va, each=nrow(sp))
-+ }
-> 
-> all(abs(mymds(g) - layout.mds(g)) < 1e-10)
-[1] TRUE
-> 
-> ## plot(g, layout=ll)
-> 
-> ## A graph with multiple components
-> 
-> set.seed(42)
-> g <- graph.ring(10) + graph.ring(3)
-> layout.mds(g)
-            [,1]       [,2]
- [1,]  0.3471515  4.0208613
- [2,] -2.0825516  3.4569957
- [3,] -3.7167907  1.5726752
- [4,] -3.9313421 -0.9123538
- [5,] -2.6442545 -3.0488946
- [6,] -0.3471515 -4.0208613
- [7,]  2.0825516 -3.4569957
- [8,]  3.7167907 -1.5726752
- [9,]  3.9313421  0.9123538
-[10,]  2.6442545  3.0488946
-[11,] -5.3125527 -5.2388619
-[12,] -8.6330617 -5.7353967
-[13,] -7.4028189 -2.6114842
->     
-> ## Small stress test
-> 
-> for (i in 1:10) {
-+   cat(".")
-+   g <- erdos.renyi.game(100, 2/100)
-+   l <- layout.mds(g)
-+ }
-..........> cat("\n")
-
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  2.106   0.045   2.138 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/layout.merge.R igraph-0.6.5/interfaces/R/tests/layout.merge.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/layout.merge.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/layout.merge.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-
-library(igraph)
-
-set.seed(42)
-
-g <- list(graph.ring(10), graph.ring(5))
-l <- lapply(g, layout.mds)
-l
-
-layout.merge(g, l)
-
-##########
-# Stress test
-
-for (i in 1:100) {
-  g <- erdos.renyi.game(100, 2/100)
-  l <- layout.mds(g)
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/layout.merge.Rout.save igraph-0.6.5/interfaces/R/tests/layout.merge.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/layout.merge.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/layout.merge.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,78 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(42)
-> 
-> g <- list(graph.ring(10), graph.ring(5))
-> l <- lapply(g, layout.mds)
-> l
-[[1]]
-            [,1]       [,2]
- [1,] -1.5557755 -1.6779841
- [2,] -0.2723545 -2.2719795
- [3,]  1.1150967 -1.9981560
- [4,]  2.0766188 -0.9611048
- [5,]  2.2449431  0.4430558
- [6,]  1.5557755  1.6779841
- [7,]  0.2723545  2.2719795
- [8,] -1.1150967  1.9981560
- [9,] -2.0766188  0.9611048
-[10,] -2.2449431 -0.4430558
-
-[[2]]
-           [,1]        [,2]
-[1,] -0.4178872 -0.99809352
-[2,]  0.8201091 -0.70586221
-[3,]  0.9247425  0.56184668
-[4,] -0.2485868  1.05310256
-[5,] -1.0783776  0.08900649
-
-> 
-> layout.merge(g, l)
-            [,1]      [,2]
- [1,] -2.7391227 -2.954285
- [2,] -0.4795116 -4.000083
- [3,]  1.9632567 -3.517985
- [4,]  3.6561276 -1.692136
- [5,]  3.9524820  0.780051
- [6,]  2.7391227  2.954285
- [7,]  0.4795116  4.000083
- [8,] -1.9632567  3.517985
- [9,] -3.6561276  1.692136
-[10,] -3.9524820 -0.780051
-[11,]  6.9992775 -7.187556
-[12,]  9.8869218 -6.505923
-[13,] 10.1309808 -3.548973
-[14,]  7.3941731 -2.403112
-[15,]  5.4586741 -4.651880
-> 
-> ##########
-> # Stress test
-> 
-> for (i in 1:100) {
-+   g <- erdos.renyi.game(100, 2/100)
-+   l <- layout.mds(g)
-+ }
-> 
-> 
-> proc.time()
-   user  system elapsed 
- 15.626   0.076  15.699 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/leading.eigenvector.community.R igraph-0.6.5/interfaces/R/tests/leading.eigenvector.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/leading.eigenvector.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/leading.eigenvector.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-
-library(igraph)
-
-## Check-test
-
-f <- function(membership, community, value, vector, multiplier, extra) {
-  M <- sapply(1:length(vector), function(x) {
-    v <- rep(0, length(vector))
-    v[x] <- 1
-    multiplier(v)
-  })
-  ev <- eigen(M)
-  ret <- 0
-  if (abs(ev$values[1] - value) > 1e-10) { ret <- 1 }
-  if (sign(ev$vectors[1,1]) != sign(vector[1])) { ev$vectors <- -ev$vectors }
-  if (any(abs(ev$vectors[,1] - vector) > 1e-10)) { ret <- 1 }
-
-  if (ret) { stop("Error") }
-
-  0
-}
-
-g <- graph.famous("Zachary")
-lc <- leading.eigenvector.community(g, callback=f)
-lc
-lc$modularity == modularity(g, lc$membership)
-membership(lc)
-length(lc)
-sizes(lc)
-
-## Check that the modularity matrix is correct
-
-f <- function(membership, community, value, vector, multiplier, extra) {
-  M <- sapply(1:length(vector), function(x) {
-    v <- rep(0, length(vector))
-    v[x] <- 1
-    multiplier(v)
-  })
-  myc <- membership==community
-  B <- A[myc,myc] - (deg[myc] %*% t(deg[myc]))/2/ec
-  BG <- B-diag(rowSums(B))
-  
-  if (max(abs(M-BG)) > 1e-10) { stop("Error") }
-
-  0
-}
-
-g <- graph.famous("Zachary")
-A <- get.adjacency(g, sparse=FALSE)
-ec <- ecount(g)
-deg <- degree(g)
-lc <- leading.eigenvector.community(g, callback=f)
-
-## Stress-test
-
-for (i in 1:100) {
-  g <- erdos.renyi.game(20, sample(5:40, 1), type="gnm")
-  lec1 <- leading.eigenvector.community(g)
-  lec2 <- leading.eigenvector.community(g)
-  if (length(membership(lec1)) != length(membership(lec2)) ||
-      any(membership(lec1) != membership(lec2))) {
-    print("Foobar!")
-    break
-  }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/leading.eigenvector.community.Rout.save igraph-0.6.5/interfaces/R/tests/leading.eigenvector.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/leading.eigenvector.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/leading.eigenvector.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,95 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> ## Check-test
-> 
-> f <- function(membership, community, value, vector, multiplier, extra) {
-+   M <- sapply(1:length(vector), function(x) {
-+     v <- rep(0, length(vector))
-+     v[x] <- 1
-+     multiplier(v)
-+   })
-+   ev <- eigen(M)
-+   ret <- 0
-+   if (abs(ev$values[1] - value) > 1e-10) { ret <- 1 }
-+   if (sign(ev$vectors[1,1]) != sign(vector[1])) { ev$vectors <- -ev$vectors }
-+   if (any(abs(ev$vectors[,1] - vector) > 1e-10)) { ret <- 1 }
-+ 
-+   if (ret) { stop("Error") }
-+ 
-+   0
-+ }
-> 
-> g <- graph.famous("Zachary")
-> lc <- leading.eigenvector.community(g, callback=f)
-> lc
-Graph community structure calculated with the leading eigenvector algorithm
-Number of communities (best split): 4 
-Modularity (best split): 0.3934089 
-Membership vector:
- [1] 1 3 3 3 1 1 1 3 2 2 1 1 3 3 2 2 1 3 2 3 2 3 2 4 4 4 2 4 4 2 2 4 2 2
-> lc$modularity == modularity(g, lc$membership)
-[1] TRUE
-> membership(lc)
- [1] 1 3 3 3 1 1 1 3 2 2 1 1 3 3 2 2 1 3 2 3 2 3 2 4 4 4 2 4 4 2 2 4 2 2
-> length(lc)
-[1] 4
-> sizes(lc)
-Community sizes
- 1  2  3  4 
- 7 12  9  6 
-> 
-> ## Check that the modularity matrix is correct
-> 
-> f <- function(membership, community, value, vector, multiplier, extra) {
-+   M <- sapply(1:length(vector), function(x) {
-+     v <- rep(0, length(vector))
-+     v[x] <- 1
-+     multiplier(v)
-+   })
-+   myc <- membership==community
-+   B <- A[myc,myc] - (deg[myc] %*% t(deg[myc]))/2/ec
-+   BG <- B-diag(rowSums(B))
-+   
-+   if (max(abs(M-BG)) > 1e-10) { stop("Error") }
-+ 
-+   0
-+ }
-> 
-> g <- graph.famous("Zachary")
-> A <- get.adjacency(g, sparse=FALSE)
-> ec <- ecount(g)
-> deg <- degree(g)
-> lc <- leading.eigenvector.community(g, callback=f)
-> 
-> ## Stress-test
-> 
-> for (i in 1:100) {
-+   g <- erdos.renyi.game(20, sample(5:40, 1), type="gnm")
-+   lec1 <- leading.eigenvector.community(g)
-+   lec2 <- leading.eigenvector.community(g)
-+   if (length(membership(lec1)) != length(membership(lec2)) ||
-+       any(membership(lec1) != membership(lec2))) {
-+     print("Foobar!")
-+     break
-+   }
-+ }
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/minimal.st.separators.R igraph-0.6.5/interfaces/R/tests/minimal.st.separators.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/minimal.st.separators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/minimal.st.separators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-msts <- minimal.st.separators(g)
-all(sapply(msts, is.separator, graph=g))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/minimal.st.separators.Rout.save igraph-0.6.5/interfaces/R/tests/minimal.st.separators.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/minimal.st.separators.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/minimal.st.separators.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,26 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> msts <- minimal.st.separators(g)
-> all(sapply(msts, is.separator, graph=g))
-[1] TRUE
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/minimum.size.separators.R igraph-0.6.5/interfaces/R/tests/minimum.size.separators.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/minimum.size.separators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/minimum.size.separators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-
-library(igraph)
-
-camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-                      Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-                      Holly   - Carol:Pat:Pam:Jennie:Bill,
-                      Bill    - Pauline:Michael:Lee:Holly,
-                      Pauline - Bill:Jennie:Ann,
-                      Jennie  - Holly:Michael:Lee:Ann:Pauline,
-                      Michael - Bill:Jennie:Ann:Lee:John,
-                      Ann     - Michael:Jennie:Pauline,
-                      Lee     - Michael:Bill:Jennie,
-                      Gery    - Pat:Steve:Russ:John,
-                      Russ    - Steve:Bert:Gery:John,
-                      John    - Gery:Russ:Michael)
-camp <- simplify(camp)
-sep <- lapply(minimum.size.separators(camp), function(x) V(camp)[x])
-all(sapply(sep, is.minimal.separator, graph=camp))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/minimum.size.separators.Rout.save igraph-0.6.5/interfaces/R/tests/minimum.size.separators.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/minimum.size.separators.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/minimum.size.separators.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> camp <- graph.formula(Harry:Steve:Don:Bert - Harry:Steve:Don:Bert,
-+                       Pam:Brazey:Carol:Pat - Pam:Brazey:Carol:Pat,
-+                       Holly   - Carol:Pat:Pam:Jennie:Bill,
-+                       Bill    - Pauline:Michael:Lee:Holly,
-+                       Pauline - Bill:Jennie:Ann,
-+                       Jennie  - Holly:Michael:Lee:Ann:Pauline,
-+                       Michael - Bill:Jennie:Ann:Lee:John,
-+                       Ann     - Michael:Jennie:Pauline,
-+                       Lee     - Michael:Bill:Jennie,
-+                       Gery    - Pat:Steve:Russ:John,
-+                       Russ    - Steve:Bert:Gery:John,
-+                       John    - Gery:Russ:Michael)
-> camp <- simplify(camp)
-> sep <- lapply(minimum.size.separators(camp), function(x) V(camp)[x])
-> all(sapply(sep, is.minimal.separator, graph=camp))
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/motifs.R igraph-0.6.5/interfaces/R/tests/motifs.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/motifs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/motifs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-
-library(igraph)
-
-set.seed(123)
-b <- erdos.renyi.game(10000, 4/10000, directed=TRUE)
-
-mno <- graph.motifs.no(b)
-
-mno0 <- graph.motifs.no(b, cut.prob=c(1/3, 0, 0))
-mno1 <- graph.motifs.no(b, cut.prob=c(0, 0, 1/3))
-mno2 <- graph.motifs.no(b, cut.prob=c(0, 1/3, 0))
-c(mno0/mno, mno1/mno, mno2/mno)
-
-mno3 <- graph.motifs.no(b, cut.prob=c(0, 1/3, 1/3))
-mno4 <- graph.motifs.no(b, cut.prob=c(1/3, 0, 1/3))
-mno5 <- graph.motifs.no(b, cut.prob=c(1/3, 1/3, 0))
-c(mno3/mno, mno4/mno, mno5/mno)
-
-######################
-
-set.seed(123)
-b <- erdos.renyi.game(10000, 4/10000, directed=TRUE)
-
-m <- graph.motifs(b)
-
-m0 <- graph.motifs(b, cut.prob=c(1/3, 0, 0))
-m1 <- graph.motifs(b, cut.prob=c(0, 1/3, 0))
-m2 <- graph.motifs(b, cut.prob=c(0, 0, 1/3))
-m0/m
-m1/m
-m2/m
-
-m3 <- graph.motifs(b, cut.prob=c(0, 1/3, 1/3))
-m4 <- graph.motifs(b, cut.prob=c(1/3, 1/3, 0))
-m5 <- graph.motifs(b, cut.prob=c(1/3, 1/3, 0))
-m3/m
-m4/m
-m5/m
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/motifs.Rout.save igraph-0.6.5/interfaces/R/tests/motifs.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/motifs.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/motifs.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,81 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> set.seed(123)
-> b <- erdos.renyi.game(10000, 4/10000, directed=TRUE)
-> 
-> mno <- graph.motifs.no(b)
-> 
-> mno0 <- graph.motifs.no(b, cut.prob=c(1/3, 0, 0))
-> mno1 <- graph.motifs.no(b, cut.prob=c(0, 0, 1/3))
-> mno2 <- graph.motifs.no(b, cut.prob=c(0, 1/3, 0))
-> c(mno0/mno, mno1/mno, mno2/mno)
-[1] 0.6548219 0.6662891 0.6683938
-> 
-> mno3 <- graph.motifs.no(b, cut.prob=c(0, 1/3, 1/3))
-> mno4 <- graph.motifs.no(b, cut.prob=c(1/3, 0, 1/3))
-> mno5 <- graph.motifs.no(b, cut.prob=c(1/3, 1/3, 0))
-> c(mno3/mno, mno4/mno, mno5/mno)
-[1] 0.4439600 0.4419528 0.4460049
-> 
-> ######################
-> 
-> set.seed(123)
-> b <- erdos.renyi.game(10000, 4/10000, directed=TRUE)
-> 
-> m <- graph.motifs(b)
-> 
-> m0 <- graph.motifs(b, cut.prob=c(1/3, 0, 0))
-> m1 <- graph.motifs(b, cut.prob=c(0, 1/3, 0))
-> m2 <- graph.motifs(b, cut.prob=c(0, 0, 1/3))
-> m0/m
- [1]        NA        NA 0.6539721        NA 0.6539930 0.6122449 0.6575147
- [8] 0.6301370       NaN 0.5384615       NaN 0.5652174       NaN       NaN
-[15]       NaN       NaN
-> m1/m
- [1]        NA        NA 0.6695621        NA 0.6680816 0.7346939 0.6708190
- [8] 0.6575342       NaN 0.7692308       NaN 0.7391304       NaN       NaN
-[15]       NaN       NaN
-> m2/m
- [1]        NA        NA 0.6664517        NA 0.6652915 0.5918367 0.6666835
- [8] 0.6712329       NaN 0.7538462       NaN 0.5652174       NaN       NaN
-[15]       NaN       NaN
-> 
-> m3 <- graph.motifs(b, cut.prob=c(0, 1/3, 1/3))
-> m4 <- graph.motifs(b, cut.prob=c(1/3, 1/3, 0))
-> m5 <- graph.motifs(b, cut.prob=c(1/3, 1/3, 0))
-> m3/m
- [1]        NA        NA 0.4456119        NA 0.4427899 0.4489796 0.4446960
- [8] 0.4246575       NaN 0.3692308       NaN 0.6086957       NaN       NaN
-[15]       NaN       NaN
-> m4/m
- [1]        NA        NA 0.4392520        NA 0.4392850 0.7346939 0.4450880
- [8] 0.4657534       NaN 0.6307692       NaN 0.5652174       NaN       NaN
-[15]       NaN       NaN
-> m5/m
- [1]        NA        NA 0.4399853        NA 0.4402882 0.3469388 0.4415975
- [8] 0.4520548       NaN 0.3230769       NaN 0.3478261       NaN       NaN
-[15]       NaN       NaN
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.921   0.046   0.951 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/multilevel.community.R igraph-0.6.5/interfaces/R/tests/multilevel.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/multilevel.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/multilevel.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-mc <- multilevel.community(g)
-mc
-membership(mc)
-abs(modularity(g, mc$membership) - max(mc$modularity)) < 1e-14
-length(mc)
-sizes(mc)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/multilevel.community.Rout.save igraph-0.6.5/interfaces/R/tests/multilevel.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/multilevel.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/multilevel.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> mc <- multilevel.community(g)
-> mc
-Graph community structure calculated with the multi level algorithm
-Number of communities (best split): 4 
-Modularity (best split): 0.4188034 
-Membership vector:
- [1] 2 2 2 2 1 1 1 2 4 2 1 2 2 2 4 4 1 2 4 2 4 2 4 3 3 3 4 3 3 4 4 3 4 4
-> membership(mc)
- [1] 2 2 2 2 1 1 1 2 4 2 1 2 2 2 4 4 1 2 4 2 4 2 4 3 3 3 4 3 3 4 4 3 4 4
-> abs(modularity(g, mc$membership) - max(mc$modularity)) < 1e-14
-[1] TRUE
-> length(mc)
-[1] 4
-> sizes(mc)
-Community sizes
- 1  2  3  4 
- 5 12  6 11 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/neighborhood.R igraph-0.6.5/interfaces/R/tests/neighborhood.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/neighborhood.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/neighborhood.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-library(igraph)
-
-neig <- function(graph, order, vertices) {
-  sp <- shortest.paths(graph)
-  v <- unique(unlist(lapply(vertices, function(x) {
-    w <- which(sp[x,] <= order)
-  })))
-  induced.subgraph(graph, c(v,vertices))
-}
-
-g <- erdos.renyi.game(50, 5/50)
-
-v <- sample(vcount(g), 1)
-g1 <- graph.neighborhood(g, 2, v)[[1]]
-g2 <- neig(g, 2, v)
-graph.isomorphic(g1, g2)
-
-#########
-
-nei <- function(graph, order, vertices) {
-  sp <- shortest.paths(graph)
-  v <- unique(unlist(lapply(vertices, function(x) {
-    w <- which(sp[x,] <= order)
-  })))
-  v
-}
-
-v1 <- neighborhood(g, 2, v)[[1]]
-v2 <- nei(g, 2, v)
-length(v1)==length(v2) && all(sort(v1)==sort(v2))
-
-#########
-
-s <- neighborhood.size(g, 2, v)[[1]]
-s==length(v1)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/neighborhood.Rout.save igraph-0.6.5/interfaces/R/tests/neighborhood.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/neighborhood.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/neighborhood.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> neig <- function(graph, order, vertices) {
-+   sp <- shortest.paths(graph)
-+   v <- unique(unlist(lapply(vertices, function(x) {
-+     w <- which(sp[x,] <= order)
-+   })))
-+   induced.subgraph(graph, c(v,vertices))
-+ }
-> 
-> g <- erdos.renyi.game(50, 5/50)
-> 
-> v <- sample(vcount(g), 1)
-> g1 <- graph.neighborhood(g, 2, v)[[1]]
-> g2 <- neig(g, 2, v)
-> graph.isomorphic(g1, g2)
-[1] TRUE
-> 
-> #########
-> 
-> nei <- function(graph, order, vertices) {
-+   sp <- shortest.paths(graph)
-+   v <- unique(unlist(lapply(vertices, function(x) {
-+     w <- which(sp[x,] <= order)
-+   })))
-+   v
-+ }
-> 
-> v1 <- neighborhood(g, 2, v)[[1]]
-> v2 <- nei(g, 2, v)
-> length(v1)==length(v2) && all(sort(v1)==sort(v2))
-[1] TRUE
-> 
-> #########
-> 
-> s <- neighborhood.size(g, 2, v)[[1]]
-> s==length(v1)
-[1] TRUE
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/neighbors.R igraph-0.6.5/interfaces/R/tests/neighbors.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/neighbors.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/neighbors.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-
-library(igraph)
-
-g <- erdos.renyi.game(100, 20/100)
-al <- get.adjlist(g, mode="all")
-for (i in 1:length(al)) {
-  n <- neighbors(g, i, mode="out")
-  if (!all(sort(n) == al[[i]])) { print("foobar!"); break; }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/neighbors.Rout.save igraph-0.6.5/interfaces/R/tests/neighbors.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/neighbors.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/neighbors.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- erdos.renyi.game(100, 20/100)
-> al <- get.adjlist(g, mode="all")
-> for (i in 1:length(al)) {
-+   n <- neighbors(g, i, mode="out")
-+   if (!all(sort(n) == al[[i]])) { print("foobar!"); break; }
-+ }
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/operators.R igraph-0.6.5/interfaces/R/tests/operators.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/operators.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/operators.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g1 <- graph.ring(10)
-g2 <- graph.star(11, center=11, mode="undirected")
-gu <- graph.union(g1, g2)
-gu
-
-gdu <- graph.disjoint.union(g1, g2)
-gdu
-
-####
-
-graph.difference(gu, g1)
-
-####
-
-graph.intersection(gu, g2)
-
-####
-
-graph.complementer(g2)
-
-####
-
-graph.compose(gu, g1)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/operators.Rout.save igraph-0.6.5/interfaces/R/tests/operators.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/operators.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/operators.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,89 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g1 <- graph.ring(10)
-> g2 <- graph.star(11, center=11, mode="undirected")
-> gu <- graph.union(g1, g2)
-> gu
-IGRAPH U--- 11 20 -- 
-+ edges:
- 1 --  2 10 11                         2 --  1  3 11                     
- 3 --  2  4 11                         4 --  3  5 11                     
- 5 --  4  6 11                         6 --  5  7 11                     
- 7 --  6  8 11                         8 --  7  9 11                     
- 9 --  8 10 11                        10 --  1  9 11                     
-11 --  1  2  3  4  5  6  7  8  9 10
-> 
-> gdu <- graph.disjoint.union(g1, g2)
-> gdu
-IGRAPH U--- 21 20 -- 
-+ edges:
- [1]  1-- 2  2-- 3  3-- 4  4-- 5  5-- 6  6-- 7  7-- 8  8-- 9  9--10  1--10
-[11] 11--21 12--21 13--21 14--21 15--21 16--21 17--21 18--21 19--21 20--21
-> 
-> ####
-> 
-> graph.difference(gu, g1)
-IGRAPH U--- 11 10 -- 
-+ edges:
- [1]  1--11  2--11  3--11  4--11  5--11  6--11  7--11  8--11  9--11 10--11
-> 
-> ####
-> 
-> graph.intersection(gu, g2)
-IGRAPH U--- 11 10 -- 
-+ edges:
- [1]  1--11  2--11  3--11  4--11  5--11  6--11  7--11  8--11  9--11 10--11
-> 
-> ####
-> 
-> graph.complementer(g2)
-IGRAPH U--- 11 45 -- Star
-+ attr: name (g/c), mode (g/c), center (g/n)
-+ edges:
- 1 --  2  3  4  5  6  7  8  9 10    2 --  1  3  4  5  6  7  8  9 10
- 3 --  1  2  4  5  6  7  8  9 10    4 --  1  2  3  5  6  7  8  9 10
- 5 --  1  2  3  4  6  7  8  9 10    6 --  1  2  3  4  5  7  8  9 10
- 7 --  1  2  3  4  5  6  8  9 10    8 --  1  2  3  4  5  6  7  9 10
- 9 --  1  2  3  4  5  6  7  8 10   10 --  1  2  3  4  5  6  7  8  9
-11 --                           
-> 
-> ####
-> 
-> graph.compose(gu, g1)
-IGRAPH U--- 11 60 -- 
-+ edges:
- 1 --  1  1  1  1  3  3  9  9 11 11
- 2 --  2  2  2  2  4  4 10 10 11 11
- 3 --  1  1  3  3  3  3  5  5 11 11
- 4 --  2  2  4  4  4  4  6  6 11 11
- 5 --  3  3  5  5  5  5  7  7 11 11
- 6 --  4  4  6  6  6  6  8  8 11 11
- 7 --  5  5  7  7  7  7  9  9 11 11
- 8 --  6  6  8  8  8  8 10 10 11 11
- 9 --  1  1  7  7  9  9  9  9 11 11
-10 --  2  2  8  8 10 10 10 10 11 11
-11 --  1  1  2  2  3  3  4  4  5  5  6  6  7  7  8  8  9  9 10 10
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.323   0.041   0.394 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/operators2.Rout.save igraph-0.6.5/interfaces/R/tests/operators2.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/operators2.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/operators2.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,209 +0,0 @@
-
-R version 2.11.1 (2010-05-31)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.ring(5) + graph.ring(5)
-> g
-Vertices: 10 
-Edges: 10 
-Directed: FALSE 
-Edges:
-             
-[1]   1 --  2
-[2]   2 --  3
-[3]   3 --  4
-[4]   4 --  5
-[5]   1 --  5
-[6]   6 --  7
-[7]   7 --  8
-[8]   8 --  9
-[9]   9 -- 10
-[10]  6 -- 10
-> 
-> ########################
-> 
-> g <- graph.empty(5)
-> g
-Vertices: 5 
-Edges: 0 
-Directed: TRUE 
-> 
-> g <- g + 1
-> g
-Vertices: 6 
-Edges: 0 
-Directed: TRUE 
-> 
-> g <- g + 4
-> g
-Vertices: 10 
-Edges: 0 
-Directed: TRUE 
-> 
-> g <- g + "a"
-> V(g)
-Vertex sequence:
- [1] NA  NA  NA  NA  NA  NA  NA  NA  NA  NA  "a"
-> vcount(g)
-[1] 11
-> 
-> g <- g + c("b", "c", "d")
-> V(g)
-Vertex sequence:
- [1] NA  NA  NA  NA  NA  NA  NA  NA  NA  NA  "a" "b" "c" "d"
-> vcount(g)
-[1] 14
-> 
-> g <- graph.empty(2)
-> g <- g + vertex(shape="circle", color="red")
-> print(g, v=T)
-Vertices: 3 
-Edges: 0 
-Directed: TRUE 
-Vertex attributes:
-     shape color
-[1]   <NA>  <NA>
-[2]   <NA>  <NA>
-[3] circle   red
-> 
-> g <- g + vertex("foo", color="blue")
-> print(g, v=T)
-Vertices: 4 
-Edges: 0 
-Directed: TRUE 
-Vertex attributes:
-     shape color name
-[1]   <NA>  <NA> <NA>
-[2]   <NA>  <NA> <NA>
-[3] circle   red <NA>
-[4]   <NA>  blue  foo
-> 
-> g <- g + vertex("bar", "foobar")
-> print(g, v=T)
-Vertices: 6 
-Edges: 0 
-Directed: TRUE 
-Vertex attributes:
-     shape color   name
-[1]   <NA>  <NA>   <NA>
-[2]   <NA>  <NA>   <NA>
-[3] circle   red   <NA>
-[4]   <NA>  blue    foo
-[5]   <NA>  <NA>    bar
-[6]   <NA>  <NA> foobar
-> 
-> g <- g + vertices("bar2", "foobar2", color=1:2, shape="rectangle")
-> print(g, v=T)
-Vertices: 8 
-Edges: 0 
-Directed: TRUE 
-Vertex attributes:
-        shape color    name
-[1]      <NA>  <NA>    <NA>
-[2]      <NA>  <NA>    <NA>
-[3]    circle   red    <NA>
-[4]      <NA>  blue     foo
-[5]      <NA>  <NA>     bar
-[6]      <NA>  <NA>  foobar
-[7] rectangle     1    bar2
-[8] rectangle     2 foobar2
-> 
-> #########################
-> 
-> g <- graph.empty(0) + vertices(letters[1:10]) +
-+   vertices("foo", "bar", "bar2", "foobar2")
-> g <- g + edge("a", "b")
-> g
-Vertices: 14 
-Edges: 1 
-Directed: TRUE 
-Edges:
-              
-[1] 'a' -> 'b'
-> 
-> g <- g + edges("foo", "bar", "bar2", "foobar2")
-> g
-Vertices: 14 
-Edges: 3 
-Directed: TRUE 
-Edges:
-                          
-[1] 'a'       -> 'b'      
-[2] 'foo'     -> 'bar'    
-[3] 'bar2'    -> 'foobar2'
-> 
-> g <- g + edges(c("bar", "foo", "foobar2", "bar2"), color="red", weight=1:2)
-> print(g, e=T)
-Vertices: 14 
-Edges: 5 
-Directed: TRUE 
-Edges and their attributes:
-                           color weight
-[1] 'a'       -> 'b'        <NA>     NA
-[2] 'foo'     -> 'bar'      <NA>     NA
-[3] 'bar2'    -> 'foobar2'  <NA>     NA
-[4] 'bar'     -> 'foo'       red      1
-[5] 'foobar2' -> 'bar2'      red      2
-> 
-> #########################
-> 
-> g <- graph.empty() + vertices(letters[1:10])
-> g <- g + path("a", "b", "c", "d")
-> g
-Vertices: 10 
-Edges: 3 
-Directed: TRUE 
-Edges:
-              
-[1] 'a' -> 'b'
-[2] 'b' -> 'c'
-[3] 'c' -> 'd'
-> 
-> g <- g + path("e", "f", "g", weight=1:2, color="red")
-> print(g, e=T)
-Vertices: 10 
-Edges: 5 
-Directed: TRUE 
-Edges and their attributes:
-               weight color
-[1] 'a' -> 'b'     NA  <NA>
-[2] 'b' -> 'c'     NA  <NA>
-[3] 'c' -> 'd'     NA  <NA>
-[4] 'e' -> 'f'      1   red
-[5] 'f' -> 'g'      2   red
-> 
-> g <- g + path(c("f", "c", "j", "d"), width=1:3, color="green")
-> print(g, e=T)
-Vertices: 10 
-Edges: 8 
-Directed: TRUE 
-Edges and their attributes:
-               weight color width
-[1] 'a' -> 'b'     NA  <NA>    NA
-[2] 'b' -> 'c'     NA  <NA>    NA
-[3] 'c' -> 'd'     NA  <NA>    NA
-[4] 'e' -> 'f'      1   red    NA
-[5] 'f' -> 'g'      2   red    NA
-[6] 'f' -> 'c'     NA green     1
-[7] 'c' -> 'j'     NA green     2
-[8] 'j' -> 'd'     NA green     3
-> 
-> #########################
-> 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/operators3.R igraph-0.6.5/interfaces/R/tests/operators3.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/operators3.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/operators3.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.ring(10)
-V(g)$name <- letters[1:10]
-E(g)$name <- LETTERS[1:10]
-
-g <- g - c("a", "b")
-g
-
-g <- g - edge("e|f")
-g
-
-g <- g - edge("H")
-g
-
-g <- graph.ring(10)
-V(g)$name <- letters[1:10]
-
-g <- g - path("a", "b", "c", "d")
-g
-
-g - V(g)[c('d', 'g')]
-
-g - E(g)['f' %--% 'g']
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/operators3.Rout.save igraph-0.6.5/interfaces/R/tests/operators3.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/operators3.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/operators3.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.ring(10)
-> V(g)$name <- letters[1:10]
-> E(g)$name <- LETTERS[1:10]
-> 
-> g <- g - c("a", "b")
-> g
-IGRAPH UN-- 8 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), name
-  (e/c)
-+ edges (vertex names):
-[1] c--d d--e e--f f--g g--h h--i i--j
-> 
-> g <- g - edge("e|f")
-> g
-IGRAPH UN-- 8 6 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), name
-  (e/c)
-+ edges (vertex names):
-[1] c--d d--e f--g g--h h--i i--j
-> 
-> g <- g - edge("H")
-> g
-IGRAPH UN-- 8 5 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), name
-  (e/c)
-+ edges (vertex names):
-[1] c--d d--e f--g g--h i--j
-> 
-> g <- graph.ring(10)
-> V(g)$name <- letters[1:10]
-> 
-> g <- g - path("a", "b", "c", "d")
-> g
-IGRAPH UN-- 10 7 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-+ edges (vertex names):
-[1] d--e e--f f--g g--h h--i i--j a--j
-> 
-> g - V(g)[c('d', 'g')]
-IGRAPH UN-- 8 4 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-+ edges (vertex names):
-[1] e--f h--i i--j a--j
-> 
-> g - E(g)['f' %--% 'g']
-IGRAPH UN-- 10 6 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-+ edges (vertex names):
-[1] d--e e--f g--h h--i i--j a--j
-> 
-> proc.time()
-   user  system elapsed 
-  0.305   0.039   0.395 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/optimal.community.R igraph-0.6.5/interfaces/R/tests/optimal.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/optimal.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/optimal.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,10 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-oc <- optimal.community(g)
-oc
-membership(oc)
-abs(modularity(g, oc$membership) - oc$modularity) < 1e-14
-length(oc)
-sizes(oc)
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/optimal.community.Rout.save igraph-0.6.5/interfaces/R/tests/optimal.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/optimal.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/optimal.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> oc <- optimal.community(g)
-> oc
-Graph community structure calculated with the optimal algorithm
-Number of communities: 4 
-Modularity: 0.4197896 
-Membership vector:
- [1] 1 1 1 1 2 2 2 1 3 3 2 1 1 1 3 3 2 1 3 1 3 1 3 4 4 4 3 4 4 3 3 4 3 3
-> membership(oc)
- [1] 1 1 1 1 2 2 2 1 3 3 2 1 1 1 3 3 2 1 3 1 3 1 3 4 4 4 3 4 4 3 3 4 3 3
-> abs(modularity(g, oc$membership) - oc$modularity) < 1e-14
-[1] TRUE
-> length(oc)
-[1] 4
-> sizes(oc)
-Community sizes
- 1  2  3  4 
-11  5 12  6 
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/pajek.R igraph-0.6.5/interfaces/R/tests/pajek.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/pajek.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/pajek.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-
-library(igraph)
-
-g <- graph.ring(9)
-V(g)$color <- c("red", "green", "yellow")
-
-tc <- rawConnection(raw(0), "w")
-write.graph(g, format="pajek", file=tc)
-cat(rawToChar(rawConnectionValue(tc)))
-close(tc)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/pajek.Rout.save igraph-0.6.5/interfaces/R/tests/pajek.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/pajek.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/pajek.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-
-R version 2.15.1 (2012-06-22) -- "Roasted Marshmallows"
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.ring(9)
-> V(g)$color <- c("red", "green", "yellow")
-> 
-> tc <- rawConnection(raw(0), "w")
-> write.graph(g, format="pajek", file=tc)
-> cat(rawToChar(rawConnectionValue(tc)))
-*Vertices 9
-1 "1" ic "red"
-2 "2" ic "green"
-3 "3" ic "yellow"
-4 "4" ic "red"
-5 "5" ic "green"
-6 "6" ic "yellow"
-7 "7" ic "red"
-8 "8" ic "green"
-9 "9" ic "yellow"
-*Edges
-1 2
-2 3
-3 4
-4 5
-5 6
-6 7
-7 8
-8 9
-1 9
-> close(tc)
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.283   0.039   0.308 
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/R/tests/power.gml.gz and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/R/tests/power.gml.gz differ
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/print.R igraph-0.6.5/interfaces/R/tests/print.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/print.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/print.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.ring(5)
-summary(g)
-g
-
-V(g)$name <- letters[1:vcount(g)]
-summary(g)
-g
-
-set.seed(42)
-E(g)$weight <- runif(ecount(g))
-summary(g)
-g
-
-g$name <- "A ring"
-summary(g)
-print(g, v=T)
-print(g, e=T)
-
-set.seed(42)
-erdos.renyi.game(13, p=0.6, directed=TRUE)
-
-erdos.renyi.game(20, p=0.8)
-
-graph.star(100)
-
-graph.star(100, mode="out")
-
-ba.game(100, m=6, directed=FALSE)
-
-kite <- graph.empty(directed=FALSE) + LETTERS[1:10]
-kite <- kite + edges('A','B','A','C','A','D','A','F',
-                     'B','D','B','E','B','G', 'C','D','C','F', 
-                     'D','E','D','F','D','G', 'E','G', 
-                     'F','G','F','H', 'G','H', 'H','I','I','J')
-kite
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/print.Rout.save igraph-0.6.5/interfaces/R/tests/print.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/print.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/print.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,304 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.ring(5)
-> summary(g)
-IGRAPH U--- 5 5 -- Ring graph
-attr: name (g/c), mutual (g/x), circular (g/x)
-> g
-IGRAPH U--- 5 5 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x)
-+ edges:
-[1] 1--2 2--3 3--4 4--5 1--5
-> 
-> V(g)$name <- letters[1:vcount(g)]
-> summary(g)
-IGRAPH UN-- 5 5 -- Ring graph
-attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-> g
-IGRAPH UN-- 5 5 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c)
-+ edges (vertex names):
-[1] a--b b--c c--d d--e a--e
-> 
-> set.seed(42)
-> E(g)$weight <- runif(ecount(g))
-> summary(g)
-IGRAPH UNW- 5 5 -- Ring graph
-attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-> g
-IGRAPH UNW- 5 5 -- Ring graph
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ edges (vertex names):
-[1] a--b b--c c--d d--e a--e
-> 
-> g$name <- "A ring"
-> summary(g)
-IGRAPH UNW- 5 5 -- A ring
-attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-> print(g, v=T)
-IGRAPH UNW- 5 5 -- A ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ vertex attributes:
-    name
-[1]    a
-[2]    b
-[3]    c
-[4]    d
-[5]    e
-+ edges (vertex names):
-[1] a--b b--c c--d d--e a--e
-> print(g, e=T)
-IGRAPH UNW- 5 5 -- A ring
-+ attr: name (g/c), mutual (g/x), circular (g/x), name (v/c), weight
-  (e/n)
-+ edges (vertex names) and their attributes:
-    edge    weight
-[1] a--b 0.9148060
-[2] b--c 0.9370754
-[3] c--d 0.2861395
-[4] d--e 0.8304476
-[5] a--e 0.6417455
-> 
-> set.seed(42)
-> erdos.renyi.game(13, p=0.6, directed=TRUE)
-IGRAPH D--- 13 103 -- Erdos renyi (gnp) graph
-+ attr: name (g/c), type (g/c), loops (g/x), p (g/n)
-+ edges:
- 1 ->  3  4  8  9 10 11 12 13       2 ->  1  3  6  7  8 11 12      
- 3 ->  1  2  4  6  8 10 12          4 ->  1  2  3  5  6  8  9 10 13
- 5 ->  1  2  3  4  6  9 10          6 ->  1  4  5  7  8  9 10 12 13
- 7 ->  1  3  5  6  9 10 11 12 13    8 ->  1  2  5  7 10 12 13      
- 9 ->  1  2  3  5  6  7 10 12 13   10 ->  1  2  4  5  6  7  8  9 11
-11 ->  1  2  4  6  7  8 10 13      12 ->  1  2  3  4  6  9 10      
-13 ->  2  3  4  7  8  9 10      
-> 
-> erdos.renyi.game(20, p=0.8)
-IGRAPH U--- 20 160 -- Erdos renyi (gnp) graph
-+ attr: name (g/c), type (g/c), loops (g/x), p (g/n)
-+ edges:
- 1 --  2  4  5  6  7  8  9 10 11 13 14 15 16 18 19 20
- 2 --  1  3  4  5  6  7  8  9 10 11 12 14 16 17 18 19 20
- 3 --  2  5  6  7  8  9 10 11 12 14 15 16 18 19 20
- 4 --  1  2  6  8 10 12 13 15 16 17 18 19 20
- 5 --  1  2  3  6  7  8  9 10 12 13 14 15 16 17 18 19 20
- 6 --  1  2  3  4  5  7  8 11 12 13 14 15 16 17 18 19 20
- 7 --  1  2  3  5  6  8 10 11 12 13 14 15 16 17 18 19 20
- 8 --  1  2  3  4  5  6  7  9 10 11 12 13 14 15 16 17 18 19
- 9 --  1  2  3  5  8 11 12 15 16 17 18 19 20
-10 --  1  2  3  4  5  7  8 11 12 13 14 15 17 18 20
-11 --  1  2  3  6  7  8  9 10 12 13 14 15 16 18 19 20
-12 --  2  3  4  5  6  7  8  9 10 11 13 14 15 18 19 20
-13 --  1  4  5  6  7  8 10 11 12 14 15 16 19 20
-14 --  1  2  3  5  6  7  8 10 11 12 13 15 16 17 18 19 20
-15 --  1  3  4  5  6  7  8  9 10 11 12 13 14 18 19 20
-16 --  1  2  3  4  5  6  7  8  9 11 13 14 17 18 19 20
-17 --  2  4  5  6  7  8  9 10 14 16 18 19 20
-18 --  1  2  3  4  5  6  7  8  9 10 11 12 14 15 16 17 19 20
-19 --  1  2  3  4  5  6  7  8  9 11 12 13 14 15 16 17 18 20
-20 --  1  2  3  4  5  6  7  9 10 11 12 13 14 15 16 17 18 19
-> 
-> graph.star(100)
-IGRAPH D--- 100 99 -- In-star
-+ attr: name (g/c), mode (g/c), center (g/n)
-+ edges:
- [1]   2->1   3->1   4->1   5->1   6->1   7->1   8->1   9->1  10->1  11->1
-[11]  12->1  13->1  14->1  15->1  16->1  17->1  18->1  19->1  20->1  21->1
-[21]  22->1  23->1  24->1  25->1  26->1  27->1  28->1  29->1  30->1  31->1
-[31]  32->1  33->1  34->1  35->1  36->1  37->1  38->1  39->1  40->1  41->1
-[41]  42->1  43->1  44->1  45->1  46->1  47->1  48->1  49->1  50->1  51->1
-[51]  52->1  53->1  54->1  55->1  56->1  57->1  58->1  59->1  60->1  61->1
-[61]  62->1  63->1  64->1  65->1  66->1  67->1  68->1  69->1  70->1  71->1
-[71]  72->1  73->1  74->1  75->1  76->1  77->1  78->1  79->1  80->1  81->1
-[81]  82->1  83->1  84->1  85->1  86->1  87->1  88->1  89->1  90->1  91->1
-[91]  92->1  93->1  94->1  95->1  96->1  97->1  98->1  99->1 100->1
-> 
-> graph.star(100, mode="out")
-IGRAPH D--- 100 99 -- Out-star
-+ attr: name (g/c), mode (g/c), center (g/n)
-+ edges:
- [1] 1->  2 1->  3 1->  4 1->  5 1->  6 1->  7 1->  8 1->  9 1-> 10 1-> 11
-[11] 1-> 12 1-> 13 1-> 14 1-> 15 1-> 16 1-> 17 1-> 18 1-> 19 1-> 20 1-> 21
-[21] 1-> 22 1-> 23 1-> 24 1-> 25 1-> 26 1-> 27 1-> 28 1-> 29 1-> 30 1-> 31
-[31] 1-> 32 1-> 33 1-> 34 1-> 35 1-> 36 1-> 37 1-> 38 1-> 39 1-> 40 1-> 41
-[41] 1-> 42 1-> 43 1-> 44 1-> 45 1-> 46 1-> 47 1-> 48 1-> 49 1-> 50 1-> 51
-[51] 1-> 52 1-> 53 1-> 54 1-> 55 1-> 56 1-> 57 1-> 58 1-> 59 1-> 60 1-> 61
-[61] 1-> 62 1-> 63 1-> 64 1-> 65 1-> 66 1-> 67 1-> 68 1-> 69 1-> 70 1-> 71
-[71] 1-> 72 1-> 73 1-> 74 1-> 75 1-> 76 1-> 77 1-> 78 1-> 79 1-> 80 1-> 81
-[81] 1-> 82 1-> 83 1-> 84 1-> 85 1-> 86 1-> 87 1-> 88 1-> 89 1-> 90 1-> 91
-[91] 1-> 92 1-> 93 1-> 94 1-> 95 1-> 96 1-> 97 1-> 98 1-> 99 1->100
-> 
-> ba.game(100, m=6, directed=FALSE)
-IGRAPH U--- 100 579 -- Barabasi graph
-+ attr: name (g/c), power (g/n), m (g/n), zero.appeal (g/n), algorithm
-  (g/c)
-+ edges:
-  1 --   2   3   4   5   6   7   8   9  10  12  13  14  15  16  17  18  19  20
-        21  22  23  24  25  26  28  29  30  32  33  34  35  36  37  38  39  41
-        42  44  45  46  48  49  50  51  52  53  54  55  56  57  58  59  60  61
-        63  64  65  66  67  68  69  70  71  72  73  74  76  77  78  79  80  82
-        83  84  85  87  90  91  92  93  94  97
-  2 --   1   3   4   5   6   7   8   9  10  11  13  14  15  16  17  18  19  21
-        22  24  25  26  27  28  29  30  31  32  38  39  41  42  44  45  48  51
-        52  53  54  55  56  57  58  60  62  63  64  65  67  69  71  74  76  77
-        78  79  81  82  83  87  88  91  96  97  98  99 100
-  3 --   1   2   4   5   6   7   8   9  10  11  12  13  16  19  20  21  25  26
-        27  29  33  35  37  38  39  40  46  49  50  54  57  58  63  66  79  86
-        89  95 100
-  4 --   1   2   3   5   6   7   8   9  11  13  16  20  22  24  26  31  32  36
-        37  42  47  49  51  59  60  64  67  70  73  75  77  81  82  85  87  92
-        93  99
-  5 --   1   2   3   4   6   7   8   9  11  13  14  16  18  19  20  22  23  25
-        26  29  30  32  33  34  37  43  44  45  46  48  50  52  56  58  61  66
-        68  72  86  88  90  91  96
-  6 --   1   2   3   4   5   7   8   9  10  12  13  15  18  20  22  23  24  25
-        27  28  36  38  39  42  43  44  45  46  50  51  52  55  57  58  59  61
-        63  64  65  68  75  78  79  80  81  82  83  86  88  90  94  95  97  98
-  7 --   1   2   3   4   5   6  10  11  12  15  16  17  19  20  22  23  24  26
-        27  28  30  31  32  34  35  39  41  45  46  47  49  50  54  55  56  60
-        61  62  66  69  70  72  75  76  77  78  79  80  81  84  85  88  89  94
-       100
-  8 --   1   2   3   4   5   6  10  15  17  29  30  34  36  38  42  47  50  51
-        54  61  62  64  66  70  71  73  77  81  82  84  93  97  99
-  9 --   1   2   3   4   5   6  11  12  18  30  44  47  48  84  85  86
- 10 --   1   2   3   6   7   8  12  14  21  27  35  40  48  66  70  90  92  94
-        99
- 11 --   2   3   4   5   7   9  23  28  40  46  55
- 12 --   1   3   6   7   9  10  14  15  17  21  28  33  38  47  51  53  56  60
-        67  77
- 13 --   1   2   3   4   5   6  14  17  18  19  21  29  33  35  36  37  43  52
-        62  63  71  72  94  98
- 14 --   1   2   5  10  12  13  95
- 15 --   1   2   6   7   8  12  23  24  32  33  36  49  69  71  74  87  89  91
- 16 --   1   2   3   4   5   7  45  73 100
- 17 --   1   2   7   8  12  13  86
- 18 --   1   2   5   6   9  13  41  65  68  83  88  97 100
- 19 --   1   2   3   5   7  13  47  96  98
- 20 --   1   3   4   5   6   7  31  53  97  98
- 21 --   1   2   3  10  12  13  31  68  76  78  91  96
- 22 --   1   2   4   5   6   7  25  27  34  35  37  40  42  44  48  53  55  56
-        57  63  64  70  74  75  76  82  85  96 100
- 23 --   1   5   6   7  11  15  89
- 24 --   1   2   4   6   7  15  34  53  58  72  76  95
- 25 --   1   2   3   5   6  22
- 26 --   1   2   3   4   5   7  39  43  49  57  74  80  93  96
- 27 --   2   3   6   7  10  22  31  40  52  62  72  75  81  85  93
- 28 --   1   2   6   7  11  12
- 29 --   1   2   3   5   8  13  54
- 30 --   1   2   5   7   8   9  73  92
- 31 --   2   4   7  20  21  27  43  65  90
- 32 --   1   2   4   5   7  15
- 33 --   1   3   5  12  13  15
- 34 --   1   5   7   8  22  24  43
- 35 --   1   3   7  10  13  22  59
- 36 --   1   4   6   8  13  15
- 37 --   1   3   4   5  13  22  41  95
- 38 --   1   2   3   6   8  12  41  67  83
- 39 --   1   2   3   6   7  26  40  65  75
- 40 --   3  10  11  22  27  39
- 41 --   1   2   7  18  37  38  83  91  93
- 42 --   1   2   4   6   8  22
- 43 --   5   6  13  26  31  34  87  88
- 44 --   1   2   5   6   9  22
- 45 --   1   2   5   6   7  16  71
- 46 --   1   3   5   6   7  11
- 47 --   4   7   8   9  12  19  60  61  67  69  74  79  92  94  99
- 48 --   1   2   5   9  10  22  73  86
- 49 --   1   3   4   7  15  26
- 50 --   1   3   5   6   7   8  89
- 51 --   1   2   4   6   8  12  69
- 52 --   1   2   5   6  13  27  59
- 53 --   1   2  12  20  22  24
- 54 --   1   2   3   7   8  29
- 55 --   1   2   6   7  11  22  59  80
- 56 --   1   2   5   7  12  22  78
- 57 --   1   2   3   6  22  26  98
- 58 --   1   2   3   5   6  24  68  99
- 59 --   1   4   6  35  52  55  87
- 60 --   1   2   4   7  12  47
- 61 --   1   5   6   7   8  47  62
- 62 --   2   7   8  13  27  61  89
- 63 --   1   2   3   6  13  22
- 64 --   1   2   4   6   8  22
- 65 --   1   2   6  18  31  39
- 66 --   1   3   5   7   8  10  80
- 67 --   1   2   4  12  38  47
- 68 --   1   5   6  18  21  58
- 69 --   1   2   7  15  47  51
- 70 --   1   4   7   8  10  22  95
- 71 --   1   2   8  13  15  45
- 72 --   1   5   7  13  24  27  84
- 73 --   1   4   8  16  30  48
- 74 --   1   2  15  22  26  47
- 75 --   4   6   7  22  27  39
- 76 --   1   2   7  21  22  24
- 77 --   1   2   4   7   8  12
- 78 --   1   2   6   7  21  56
- 79 --   1   2   3   6   7  47  90
- 80 --   1   6   7  26  55  66
- 81 --   2   4   6   7   8  27  84
- 82 --   1   2   4   6   8  22
- 83 --   1   2   6  18  38  41
- 84 --   1   7   8   9  72  81  92
- 85 --   1   4   7   9  22  27
- 86 --   3   5   6   9  17  48
- 87 --   1   2   4  15  43  59
- 88 --   2   5   6   7  18  43
- 89 --   3   7  15  23  50  62
- 90 --   1   5   6  10  31  79
- 91 --   1   2   5  15  21  41
- 92 --   1   4  10  30  47  84
- 93 --   1   4   8  26  27  41
- 94 --   1   6   7  10  13  47
- 95 --   3   6  14  24  37  70
- 96 --   2   5  19  21  22  26
- 97 --   1   2   6   8  18  20
- 98 --   2   6  13  19  20  57
- 99 --   2   4   8  10  47  58
-100 --   2   3   7  16  18  22
-> 
-> kite <- graph.empty(directed=FALSE) + LETTERS[1:10]
-> kite <- kite + edges('A','B','A','C','A','D','A','F',
-+                      'B','D','B','E','B','G', 'C','D','C','F', 
-+                      'D','E','D','F','D','G', 'E','G', 
-+                      'F','G','F','H', 'G','H', 'H','I','I','J')
-> kite
-IGRAPH UN-- 10 18 -- 
-+ attr: name (v/c)
-+ edges (vertex names):
-A -- B, C, D, F
-B -- A, D, E, G
-C -- A, D, F
-D -- A, B, C, E, F, G
-E -- B, D, G
-F -- A, C, D, G, H
-G -- B, D, E, F, H
-H -- F, G, I
-I -- H, J
-J -- I
-> 
-> proc.time()
-   user  system elapsed 
-   0.39    0.04    0.44 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/scg.R igraph-0.6.5/interfaces/R/tests/scg.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/scg.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/scg.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-tree <- graph.tree(10, 3, "undirected")
-treeM <- get.adjacency(tree, sparse=TRUE)
-treeM2 <- get.adjacency(tree, sparse=FALSE)
-
-args <- list(ev=1, nt=3, mtype="symmetric", algo="exact_scg",
-             semproj=TRUE, epairs=TRUE)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- 3
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- c(1,3)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-###############################
-
-args <- list(ev=1, nt=2, mtype="stochastic", algo="exact_scg",
-             semproj=TRUE, epairs=TRUE, stat.prob=TRUE)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- 3
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- c(1,3)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-###############################
-
-args <- list(ev=1, nt=2, mtype="laplacian", algo="exact_scg",
-             semproj=TRUE, epairs=TRUE)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- 3
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
-
-args[["ev"]] <- c(1,3)
-do.call(scg, c(list(tree), args))
-do.call(scg, c(list(treeM), args))
-do.call(scg, c(list(treeM2), args))
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/scg.Rout.save igraph-0.6.5/interfaces/R/tests/scg.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/scg.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/scg.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,1349 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> tree <- graph.tree(10, 3, "undirected")
-> treeM <- get.adjacency(tree, sparse=TRUE)
-Loading required package: Matrix
-Loading required package: lattice
-> treeM2 <- get.adjacency(tree, sparse=FALSE)
-> 
-> args <- list(ev=1, nt=3, mtype="symmetric", algo="exact_scg",
-+              semproj=TRUE, epairs=TRUE)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH U-W- 4 3 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1--2 1--3 2--4
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.334414
-
-$vectors
-            [,1]
- [1,] -0.5000000
- [2,] -0.4765103
- [3,] -0.4765103
- [4,] -0.2141865
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.414214 1 .       
-[2,] 1.414214 .        . 1.732051
-[3,] 1.000000 .        . .       
-[4,] .        1.732051 . .       
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.334414
-
-$vectors
-            [,1]
- [1,] -0.5000000
- [2,] -0.4765103
- [3,] -0.4765103
- [4,] -0.2141865
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.414214 1 .       
-[2,] 1.414214 .        . 1.732051
-[3,] 1.000000 .        . .       
-[4,] .        1.732051 . .       
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.334414
-
-$vectors
-            [,1]
- [1,] -0.5000000
- [2,] -0.4765103
- [3,] -0.4765103
- [4,] -0.2141865
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> 
-> args[["ev"]] <- 3
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH U-W- 4 3 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1--2 2--3 3--4
-
-$groups
- [1] 3 2 2 4 1 1 1 1 1 1
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$values
-[1] 0.7419638
-
-$vectors
-            [,1]
- [1,]  0.5000000
- [2,] -0.1514527
- [3,] -0.1514527
- [4,]  0.6738873
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.732051 .        .
-[2,] 1.732051 .        1.414214 .
-[3,] .        1.414214 .        1
-[4,] .        .        1.000000 .
-
-$groups
- [1] 3 2 2 4 1 1 1 1 1 1
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$values
-[1] 0.7419638
-
-$vectors
-            [,1]
- [1,]  0.5000000
- [2,] -0.1514527
- [3,] -0.1514527
- [4,]  0.6738873
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.732051 .        .
-[2,] 1.732051 .        1.414214 .
-[3,] .        1.414214 .        1
-[4,] .        .        1.000000 .
-
-$groups
- [1] 3 2 2 4 1 1 1 1 1 1
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] 1 .         .         . .         .         .         .         .        
-[4,] . .         .         1 .         .         .         .         .        
-              
-[1,] 0.4082483
-[2,] .        
-[3,] .        
-[4,] .        
-
-$values
-[1] 0.7419638
-
-$vectors
-            [,1]
- [1,]  0.5000000
- [2,] -0.1514527
- [3,] -0.1514527
- [4,]  0.6738873
- [5,] -0.2041241
- [6,] -0.2041241
- [7,] -0.2041241
- [8,] -0.2041241
- [9,] -0.2041241
-[10,] -0.2041241
-
-> 
-> args[["ev"]] <- c(1,3)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH U-W- 4 3 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1--2 1--3 2--4
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.3344142 0.7419638
-
-$vectors
-            [,1]       [,2]
- [1,] -0.5000000  0.5000000
- [2,] -0.4765103 -0.1514527
- [3,] -0.4765103 -0.1514527
- [4,] -0.2141865  0.6738873
- [5,] -0.2041241 -0.2041241
- [6,] -0.2041241 -0.2041241
- [7,] -0.2041241 -0.2041241
- [8,] -0.2041241 -0.2041241
- [9,] -0.2041241 -0.2041241
-[10,] -0.2041241 -0.2041241
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.414214 1 .       
-[2,] 1.414214 .        . 1.732051
-[3,] 1.000000 .        . .       
-[4,] .        1.732051 . .       
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.3344142 0.7419638
-
-$vectors
-            [,1]       [,2]
- [1,] -0.5000000  0.5000000
- [2,] -0.4765103 -0.1514527
- [3,] -0.4765103 -0.1514527
- [4,] -0.2141865  0.6738873
- [5,] -0.2041241 -0.2041241
- [6,] -0.2041241 -0.2041241
- [7,] -0.2041241 -0.2041241
- [8,] -0.2041241 -0.2041241
- [9,] -0.2041241 -0.2041241
-[10,] -0.2041241 -0.2041241
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                                 
-[1,] .        1.414214 1 .       
-[2,] 1.414214 .        . 1.732051
-[3,] 1.000000 .        . .       
-[4,] .        1.732051 . .       
-
-$groups
- [1] 1 2 2 3 4 4 4 4 4 4
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 1 .         .         . .         .         .         .         .        
-[2,] . 0.7071068 0.7071068 . .         .         .         .         .        
-[3,] . .         .         1 .         .         .         .         .        
-[4,] . .         .         . 0.4082483 0.4082483 0.4082483 0.4082483 0.4082483
-              
-[1,] .        
-[2,] .        
-[3,] .        
-[4,] 0.4082483
-
-$values
-[1] 2.3344142 0.7419638
-
-$vectors
-            [,1]       [,2]
- [1,] -0.5000000  0.5000000
- [2,] -0.4765103 -0.1514527
- [3,] -0.4765103 -0.1514527
- [4,] -0.2141865  0.6738873
- [5,] -0.2041241 -0.2041241
- [6,] -0.2041241 -0.2041241
- [7,] -0.2041241 -0.2041241
- [8,] -0.2041241 -0.2041241
- [9,] -0.2041241 -0.2041241
-[10,] -0.2041241 -0.2041241
-
-> 
-> ###############################
-> 
-> args <- list(ev=1, nt=2, mtype="stochastic", algo="exact_scg",
-+              semproj=TRUE, epairs=TRUE, stat.prob=TRUE)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 1 1 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 1->1
-
-$groups
- [1] 1 1 1 1 1 1 1 1 1 1
-
-$L
-1 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 0.1666667 0.2222222 0.2222222 0.05555556 0.05555556 0.05555556 0.05555556
-                                     
-[1,] 0.05555556 0.05555556 0.05555556
-
-$R
-1 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 1 1 1 1 1 1 1 1 1
-
-$values
-[1] 1+0i
-
-$vectors
-               [,1]
- [1,] -0.3162278+0i
- [2,] -0.3162278+0i
- [3,] -0.3162278+0i
- [4,] -0.3162278+0i
- [5,] -0.3162278+0i
- [6,] -0.3162278+0i
- [7,] -0.3162278+0i
- [8,] -0.3162278+0i
- [9,] -0.3162278+0i
-[10,] -0.3162278+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-1 x 1 sparse Matrix of class "dgCMatrix"
-      
-[1,] 1
-
-$groups
- [1] 1 1 1 1 1 1 1 1 1 1
-
-$L
-1 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 0.1666667 0.2222222 0.2222222 0.05555556 0.05555556 0.05555556 0.05555556
-                                     
-[1,] 0.05555556 0.05555556 0.05555556
-
-$R
-1 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 1 1 1 1 1 1 1 1 1
-
-$values
-[1] 1+0i
-
-$vectors
-               [,1]
- [1,] -0.3162278+0i
- [2,] -0.3162278+0i
- [3,] -0.3162278+0i
- [4,] -0.3162278+0i
- [5,] -0.3162278+0i
- [6,] -0.3162278+0i
- [7,] -0.3162278+0i
- [8,] -0.3162278+0i
- [9,] -0.3162278+0i
-[10,] -0.3162278+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-1 x 1 sparse Matrix of class "dgCMatrix"
-      
-[1,] 1
-
-$groups
- [1] 1 1 1 1 1 1 1 1 1 1
-
-$L
-1 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] 0.1666667 0.2222222 0.2222222 0.05555556 0.05555556 0.05555556 0.05555556
-                                     
-[1,] 0.05555556 0.05555556 0.05555556
-
-$R
-1 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 1 1 1 1 1 1 1 1 1
-
-$values
-[1] 1+0i
-
-$vectors
-               [,1]
- [1,] -0.3162278+0i
- [2,] -0.3162278+0i
- [3,] -0.3162278+0i
- [4,] -0.3162278+0i
- [5,] -0.3162278+0i
- [6,] -0.3162278+0i
- [7,] -0.3162278+0i
- [8,] -0.3162278+0i
- [9,] -0.3162278+0i
-[10,] -0.3162278+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> 
-> args[["ev"]] <- 3
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 5 9 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 2->1 3->2 1->2 4->3 2->3 3->3 3->4 5->4 4->5
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 0.8660254+0i
-
-$vectors
-                  [,1]
- [1,] -3.142951e-16+0i
- [2,]  3.162278e-01+0i
- [3,] -3.162278e-01+0i
- [4,] -3.261343e-16+0i
- [5,]  3.651484e-01+0i
- [6,]  3.651484e-01+0i
- [7,]  3.651484e-01+0i
- [8,] -3.651484e-01+0i
- [9,] -3.651484e-01+0i
-[10,] -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-5 x 5 sparse Matrix of class "dgCMatrix"
-                             
-[1,] .    1.00 .    .    .   
-[2,] 0.75 .    0.25 .    .   
-[3,] .    0.25 0.50 0.25 .   
-[4,] .    .    0.25 .    0.75
-[5,] .    .    .    1.00 .   
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 0.8660254+0i
-
-$vectors
-                  [,1]
- [1,] -3.142951e-16+0i
- [2,]  3.162278e-01+0i
- [3,] -3.162278e-01+0i
- [4,] -3.261343e-16+0i
- [5,]  3.651484e-01+0i
- [6,]  3.651484e-01+0i
- [7,]  3.651484e-01+0i
- [8,] -3.651484e-01+0i
- [9,] -3.651484e-01+0i
-[10,] -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-5 x 5 sparse Matrix of class "dgCMatrix"
-                             
-[1,] .    1.00 .    .    .   
-[2,] 0.75 .    0.25 .    .   
-[3,] .    0.25 0.50 0.25 .   
-[4,] .    .    0.25 .    0.75
-[5,] .    .    .    1.00 .   
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 0.8660254+0i
-
-$vectors
-                  [,1]
- [1,] -3.142951e-16+0i
- [2,]  3.162278e-01+0i
- [3,] -3.162278e-01+0i
- [4,] -3.261343e-16+0i
- [5,]  3.651484e-01+0i
- [6,]  3.651484e-01+0i
- [7,]  3.651484e-01+0i
- [8,] -3.651484e-01+0i
- [9,] -3.651484e-01+0i
-[10,] -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> 
-> args[["ev"]] <- c(1,3)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 5 9 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 2->1 3->2 1->2 4->3 2->3 3->3 3->4 5->4 4->5
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 1.0000000+0i 0.8660254+0i
-
-$vectors
-               [,1]             [,2]
- [1,] -0.3162278+0i -3.142951e-16+0i
- [2,] -0.3162278+0i  3.162278e-01+0i
- [3,] -0.3162278+0i -3.162278e-01+0i
- [4,] -0.3162278+0i -3.261343e-16+0i
- [5,] -0.3162278+0i  3.651484e-01+0i
- [6,] -0.3162278+0i  3.651484e-01+0i
- [7,] -0.3162278+0i  3.651484e-01+0i
- [8,] -0.3162278+0i -3.651484e-01+0i
- [9,] -0.3162278+0i -3.651484e-01+0i
-[10,] -0.3162278+0i -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-5 x 5 sparse Matrix of class "dgCMatrix"
-                             
-[1,] .    1.00 .    .    .   
-[2,] 0.75 .    0.25 .    .   
-[3,] .    0.25 0.50 0.25 .   
-[4,] .    .    0.25 .    0.75
-[5,] .    .    .    1.00 .   
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 1.0000000+0i 0.8660254+0i
-
-$vectors
-               [,1]             [,2]
- [1,] -0.3162278+0i -3.142951e-16+0i
- [2,] -0.3162278+0i  3.162278e-01+0i
- [3,] -0.3162278+0i -3.162278e-01+0i
- [4,] -0.3162278+0i -3.261343e-16+0i
- [5,] -0.3162278+0i  3.651484e-01+0i
- [6,] -0.3162278+0i  3.651484e-01+0i
- [7,] -0.3162278+0i  3.651484e-01+0i
- [8,] -0.3162278+0i -3.651484e-01+0i
- [9,] -0.3162278+0i -3.651484e-01+0i
-[10,] -0.3162278+0i -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-5 x 5 sparse Matrix of class "dgCMatrix"
-                             
-[1,] .    1.00 .    .    .   
-[2,] 0.75 .    0.25 .    .   
-[3,] .    0.25 0.50 0.25 .   
-[4,] .    .    0.25 .    0.75
-[5,] .    .    .    1.00 .   
-
-$groups
- [1] 3 4 2 3 5 5 5 1 1 1
-
-$L
-5 x 10 sparse Matrix of class "dgCMatrix"
-                                                                              
-[1,] .    . . .    .         .         .         0.3333333 0.3333333 0.3333333
-[2,] .    . 1 .    .         .         .         .         .         .        
-[3,] 0.75 . . 0.25 .         .         .         .         .         .        
-[4,] .    1 . .    .         .         .         .         .         .        
-[5,] .    . . .    0.3333333 0.3333333 0.3333333 .         .         .        
-
-$R
-5 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . . . . . 1 1 1
-[2,] . . 1 . . . . . . .
-[3,] 1 . . 1 . . . . . .
-[4,] . 1 . . . . . . . .
-[5,] . . . . 1 1 1 . . .
-
-$values
-[1] 1.0000000+0i 0.8660254+0i
-
-$vectors
-               [,1]             [,2]
- [1,] -0.3162278+0i -3.142951e-16+0i
- [2,] -0.3162278+0i  3.162278e-01+0i
- [3,] -0.3162278+0i -3.162278e-01+0i
- [4,] -0.3162278+0i -3.261343e-16+0i
- [5,] -0.3162278+0i  3.651484e-01+0i
- [6,] -0.3162278+0i  3.651484e-01+0i
- [7,] -0.3162278+0i  3.651484e-01+0i
- [8,] -0.3162278+0i -3.651484e-01+0i
- [9,] -0.3162278+0i -3.651484e-01+0i
-[10,] -0.3162278+0i -3.651484e-01+0i
-
-$p
- [1] 0.4330127 0.5773503 0.5773503 0.1443376 0.1443376 0.1443376 0.1443376
- [8] 0.1443376 0.1443376 0.1443376
-
-> 
-> ###############################
-> 
-> args <- list(ev=1, nt=2, mtype="laplacian", algo="exact_scg",
-+              semproj=TRUE, epairs=TRUE)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 4 6 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 4->1 3->1 4->2 1->3 1->4 2->4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i
-
-$vectors
-               [,1]
- [1,] -0.4937414+0i
- [2,]  0.5698059+0i
- [3,]  0.5698059+0i
- [4,]  0.1090197+0i
- [5,] -0.1258150+0i
- [6,] -0.1258150+0i
- [7,] -0.1258150+0i
- [8,] -0.1258150+0i
- [9,] -0.1258150+0i
-[10,] -0.1258150+0i
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  3  . -1 -2
-[2,]  .  1  . -1
-[3,] -1  .  1  .
-[4,] -1 -3  .  4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i
-
-$vectors
-               [,1]
- [1,] -0.4937414+0i
- [2,]  0.5698059+0i
- [3,]  0.5698059+0i
- [4,]  0.1090197+0i
- [5,] -0.1258150+0i
- [6,] -0.1258150+0i
- [7,] -0.1258150+0i
- [8,] -0.1258150+0i
- [9,] -0.1258150+0i
-[10,] -0.1258150+0i
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  3  . -1 -2
-[2,]  .  1  . -1
-[3,] -1  .  1  .
-[4,] -1 -3  .  4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i
-
-$vectors
-               [,1]
- [1,] -0.4937414+0i
- [2,]  0.5698059+0i
- [3,]  0.5698059+0i
- [4,]  0.1090197+0i
- [5,] -0.1258150+0i
- [6,] -0.1258150+0i
- [7,] -0.1258150+0i
- [8,] -0.1258150+0i
- [9,] -0.1258150+0i
-[10,] -0.1258150+0i
-
-> 
-> args[["ev"]] <- 3
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 4 6 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 4->1 3->2 4->3 2->3 3->4 1->4
-
-$groups
- [1] 4 3 3 1 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] . .   .   1 .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . 0.5 0.5 . .         .         .         .         .         .        
-[4,] 1 .   .   . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . 1 . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . 1 1 . . . . . . .
-[4,] 1 . . . . . . . . .
-
-$values
-[1] 2.832551+0i
-
-$vectors
-               [,1]
- [1,]  0.7496974+0i
- [2,]  0.2673184+0i
- [3,]  0.2673184+0i
- [4,] -0.4091005+0i
- [5,] -0.1458723+0i
- [6,] -0.1458723+0i
- [7,] -0.1458723+0i
- [8,] -0.1458723+0i
- [9,] -0.1458723+0i
-[10,] -0.1458723+0i
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  1  .  . -1
-[2,]  .  1 -1  .
-[3,]  . -3  4 -1
-[4,] -1  . -2  3
-
-$groups
- [1] 4 3 3 1 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] . .   .   1 .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . 0.5 0.5 . .         .         .         .         .         .        
-[4,] 1 .   .   . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . 1 . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . 1 1 . . . . . . .
-[4,] 1 . . . . . . . . .
-
-$values
-[1] 2.832551+0i
-
-$vectors
-               [,1]
- [1,]  0.7496974+0i
- [2,]  0.2673184+0i
- [3,]  0.2673184+0i
- [4,] -0.4091005+0i
- [5,] -0.1458723+0i
- [6,] -0.1458723+0i
- [7,] -0.1458723+0i
- [8,] -0.1458723+0i
- [9,] -0.1458723+0i
-[10,] -0.1458723+0i
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  1  .  . -1
-[2,]  .  1 -1  .
-[3,]  . -3  4 -1
-[4,] -1  . -2  3
-
-$groups
- [1] 4 3 3 1 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] . .   .   1 .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . 0.5 0.5 . .         .         .         .         .         .        
-[4,] 1 .   .   . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] . . . 1 . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . 1 1 . . . . . . .
-[4,] 1 . . . . . . . . .
-
-$values
-[1] 2.832551+0i
-
-$vectors
-               [,1]
- [1,]  0.7496974+0i
- [2,]  0.2673184+0i
- [3,]  0.2673184+0i
- [4,] -0.4091005+0i
- [5,] -0.1458723+0i
- [6,] -0.1458723+0i
- [7,] -0.1458723+0i
- [8,] -0.1458723+0i
- [9,] -0.1458723+0i
-[10,] -0.1458723+0i
-
-> 
-> args[["ev"]] <- c(1,3)
-> do.call(scg, c(list(tree), args))
-$Xt
-IGRAPH D-W- 4 6 -- 
-+ attr: weight (e/n)
-+ edges:
-[1] 4->1 3->1 4->2 1->3 1->4 2->4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i 2.832551+0i
-
-$vectors
-               [,1]          [,2]
- [1,] -0.4937414+0i  0.7496974+0i
- [2,]  0.5698059+0i  0.2673184+0i
- [3,]  0.5698059+0i  0.2673184+0i
- [4,]  0.1090197+0i -0.4091005+0i
- [5,] -0.1258150+0i -0.1458723+0i
- [6,] -0.1258150+0i -0.1458723+0i
- [7,] -0.1258150+0i -0.1458723+0i
- [8,] -0.1258150+0i -0.1458723+0i
- [9,] -0.1258150+0i -0.1458723+0i
-[10,] -0.1258150+0i -0.1458723+0i
-
-> do.call(scg, c(list(treeM), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  3  . -1 -2
-[2,]  .  1  . -1
-[3,] -1  .  1  .
-[4,] -1 -3  .  4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i 2.832551+0i
-
-$vectors
-               [,1]          [,2]
- [1,] -0.4937414+0i  0.7496974+0i
- [2,]  0.5698059+0i  0.2673184+0i
- [3,]  0.5698059+0i  0.2673184+0i
- [4,]  0.1090197+0i -0.4091005+0i
- [5,] -0.1258150+0i -0.1458723+0i
- [6,] -0.1258150+0i -0.1458723+0i
- [7,] -0.1258150+0i -0.1458723+0i
- [8,] -0.1258150+0i -0.1458723+0i
- [9,] -0.1258150+0i -0.1458723+0i
-[10,] -0.1258150+0i -0.1458723+0i
-
-> do.call(scg, c(list(treeM2), args))
-$Xt
-4 x 4 sparse Matrix of class "dgCMatrix"
-                
-[1,]  3  . -1 -2
-[2,]  .  1  . -1
-[3,] -1  .  1  .
-[4,] -1 -3  .  4
-
-$groups
- [1] 1 4 4 3 2 2 2 2 2 2
-
-$L
-4 x 10 sparse Matrix of class "dgCMatrix"
-                                                                            
-[1,] 1 .   .   . .         .         .         .         .         .        
-[2,] . .   .   . 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667 0.1666667
-[3,] . .   .   1 .         .         .         .         .         .        
-[4,] . 0.5 0.5 . .         .         .         .         .         .        
-
-$R
-4 x 10 sparse Matrix of class "dgCMatrix"
-                        
-[1,] 1 . . . . . . . . .
-[2,] . . . . 1 1 1 1 1 1
-[3,] . . . 1 . . . . . .
-[4,] . 1 1 . . . . . . .
-
-$values
-[1] 5.528918+0i 2.832551+0i
-
-$vectors
-               [,1]          [,2]
- [1,] -0.4937414+0i  0.7496974+0i
- [2,]  0.5698059+0i  0.2673184+0i
- [3,]  0.5698059+0i  0.2673184+0i
- [4,]  0.1090197+0i -0.4091005+0i
- [5,] -0.1258150+0i -0.1458723+0i
- [6,] -0.1258150+0i -0.1458723+0i
- [7,] -0.1258150+0i -0.1458723+0i
- [8,] -0.1258150+0i -0.1458723+0i
- [9,] -0.1258150+0i -0.1458723+0i
-[10,] -0.1258150+0i -0.1458723+0i
-
-> 
-> proc.time()
-   user  system elapsed 
-  3.208   0.104   3.300 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/sdf.R igraph-0.6.5/interfaces/R/tests/sdf.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/sdf.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/sdf.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,38 +0,0 @@
-
-library(igraph)
-
-sdf <- igraph:::sdf(id=1:10, color="black")
-as.data.frame(sdf)
-
-## access
-
-sdf[1,"id"]
-sdf[1:4, "id"]
-sdf[, "id"]
-
-sdf[1, "color"]
-sdf[1:4, "color"]
-sdf[, "color"]
-
-## set
-
-sdf2 <- sdf
-sdf2[5, "id"] <- 100
-as.data.frame(sdf2)
-
-sdf2 <- sdf
-sdf2[, "id"] <- 0
-as.data.frame(sdf2)
-
-sdf2 <- sdf
-sdf2[2:10, "id"] <- 1
-as.data.frame(sdf2)
-
-sdf2 <- sdf
-sdf2[, "color"] <- "white"
-as.data.frame(sdf2)
-
-sdf2 <- sdf
-sdf2[5:6, "color"] <- "white"
-as.data.frame(sdf2)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/sdf.Rout.save igraph-0.6.5/interfaces/R/tests/sdf.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/sdf.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/sdf.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,133 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> sdf <- igraph:::sdf(id=1:10, color="black")
-> as.data.frame(sdf)
-   id color
-1   1 black
-2   2 black
-3   3 black
-4   4 black
-5   5 black
-6   6 black
-7   7 black
-8   8 black
-9   9 black
-10 10 black
-> 
-> ## access
-> 
-> sdf[1,"id"]
-[1] 1
-> sdf[1:4, "id"]
-[1] 1 2 3 4
-> sdf[, "id"]
- [1]  1  2  3  4  5  6  7  8  9 10
-> 
-> sdf[1, "color"]
-[1] "black"
-> sdf[1:4, "color"]
-[1] "black" "black" "black" "black"
-> sdf[, "color"]
- [1] "black" "black" "black" "black" "black" "black" "black" "black" "black"
-[10] "black"
-> 
-> ## set
-> 
-> sdf2 <- sdf
-> sdf2[5, "id"] <- 100
-> as.data.frame(sdf2)
-    id color
-1    1 black
-2    2 black
-3    3 black
-4    4 black
-5  100 black
-6    6 black
-7    7 black
-8    8 black
-9    9 black
-10  10 black
-> 
-> sdf2 <- sdf
-> sdf2[, "id"] <- 0
-> as.data.frame(sdf2)
-   id color
-1   0 black
-2   0 black
-3   0 black
-4   0 black
-5   0 black
-6   0 black
-7   0 black
-8   0 black
-9   0 black
-10  0 black
-> 
-> sdf2 <- sdf
-> sdf2[2:10, "id"] <- 1
-> as.data.frame(sdf2)
-   id color
-1   1 black
-2   1 black
-3   1 black
-4   1 black
-5   1 black
-6   1 black
-7   1 black
-8   1 black
-9   1 black
-10  1 black
-> 
-> sdf2 <- sdf
-> sdf2[, "color"] <- "white"
-> as.data.frame(sdf2)
-   id color
-1   1 white
-2   2 white
-3   3 white
-4   4 white
-5   5 white
-6   6 white
-7   7 white
-8   8 white
-9   9 white
-10 10 white
-> 
-> sdf2 <- sdf
-> sdf2[5:6, "color"] <- "white"
-> as.data.frame(sdf2)
-   id color
-1   1 black
-2   2 black
-3   3 black
-4   4 black
-5   5 white
-6   6 white
-7   7 black
-8   8 black
-9   9 black
-10 10 black
-> 
-> 
-> proc.time()
-   user  system elapsed 
-  0.300   0.040   0.326 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/unfold.tree.R igraph-0.6.5/interfaces/R/tests/unfold.tree.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/unfold.tree.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/unfold.tree.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-library(igraph) ; igraph.options(print.full=TRUE)
-
-g <- graph.tree(7, 2)
-g <- add.edges(g, c(2,7, 1,4))
-g2 <- unfold.tree(g, roots=1)
-g2
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/unfold.tree.Rout.save igraph-0.6.5/interfaces/R/tests/unfold.tree.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/unfold.tree.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/unfold.tree.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph) ; igraph.options(print.full=TRUE)
-> 
-> g <- graph.tree(7, 2)
-> g <- add.edges(g, c(2,7, 1,4))
-> g2 <- unfold.tree(g, roots=1)
-> g2
-$tree
-IGRAPH D--- 9 8 -- 
-+ edges:
-[1] 1->2 1->3 2->8 2->5 3->6 3->9 2->7 1->4
-
-$vertex_index
-[1] 1 2 3 4 5 6 7 4 7
-
-> 
-> proc.time()
-   user  system elapsed 
-  0.286   0.037   0.312 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/walktrap.community.R igraph-0.6.5/interfaces/R/tests/walktrap.community.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/walktrap.community.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/walktrap.community.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-
-library(igraph)
-
-g <- graph.famous("Zachary")
-set.seed(42)
-wc <- walktrap.community(g)
-wc
-abs(modularity(g, membership(wc)) - modularity(wc)) < 1e-7
-membership(wc)
-modularity(wc)
-length(wc)
-sizes(wc)
-d <- as.dendrogram(wc)
-d
-d[[1]]
-d[[2]]
-m2 <- cutat(wc, no=3)
-abs(modularity(g, m2) - wc$modularity[length(wc$modularity)-2]) < 1e-7
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/walktrap.community.Rout.save igraph-0.6.5/interfaces/R/tests/walktrap.community.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/walktrap.community.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/walktrap.community.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-R version 2.15.0 (2012-03-30)
-Copyright (C) 2012 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> g <- graph.famous("Zachary")
-> set.seed(42)
-> wc <- walktrap.community(g)
-> wc
-Graph community structure calculated with the walktrap algorithm
-Number of communities (best split): 5 
-Modularity (best split): 0.3532216 
-Membership vector:
- [1] 1 1 2 1 5 5 5 1 2 2 5 1 1 2 3 3 5 1 3 1 3 1 3 4 4 4 3 4 2 3 2 2 3 3
-> abs(modularity(g, membership(wc)) - modularity(wc)) < 1e-7
-[1] TRUE
-> membership(wc)
- [1] 1 1 2 1 5 5 5 1 2 2 5 1 1 2 3 3 5 1 3 1 3 1 3 4 4 4 3 4 2 3 2 2 3 3
-> modularity(wc)
-[1] 0.3532216
-> length(wc)
-[1] 5
-> sizes(wc)
-Community sizes
-1 2 3 4 5 
-9 7 9 4 5 
-> d <- as.dendrogram(wc)
-> d
-'dendrogram' with 2 branches and 34 members total, at height 33 
-> d[[1]]
-'dendrogram' with 2 branches and 20 members total, at height 31 
-> d[[2]]
-'dendrogram' with 2 branches and 14 members total, at height 32 
-> m2 <- cutat(wc, no=3)
-> abs(modularity(g, m2) - wc$modularity[length(wc$modularity)-2]) < 1e-7
-[1] TRUE
-> 
-> proc.time()
-   user  system elapsed 
-  0.368   0.053   0.429 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/watts.strogatz.game.R igraph-0.6.5/interfaces/R/tests/watts.strogatz.game.R
--- igraph-0.6.5~quantal1/interfaces/R/tests/watts.strogatz.game.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/watts.strogatz.game.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
-
-library(igraph)
-
-for (i in 1:50) {
-  p <- runif(1)
-  d <- sample(1:3, 1)
-  nei <- sample(2:5, 1)
-  g <- watts.strogatz.game(d, 10, nei, p, loops=FALSE)
-  if (any(is.loop(g))) { stop("foobar") }
-}
-
-
-  
diff -Nru igraph-0.6.5~quantal1/interfaces/R/tests/watts.strogatz.game.Rout.save igraph-0.6.5/interfaces/R/tests/watts.strogatz.game.Rout.save
--- igraph-0.6.5~quantal1/interfaces/R/tests/watts.strogatz.game.Rout.save	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/tests/watts.strogatz.game.Rout.save	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-R version 2.12.0 (2010-10-15)
-Copyright (C) 2010 The R Foundation for Statistical Computing
-ISBN 3-900051-07-0
-Platform: x86_64-apple-darwin9.8.0/x86_64 (64-bit)
-
-R is free software and comes with ABSOLUTELY NO WARRANTY.
-You are welcome to redistribute it under certain conditions.
-Type 'license()' or 'licence()' for distribution details.
-
-R is a collaborative project with many contributors.
-Type 'contributors()' for more information and
-'citation()' on how to cite R or R packages in publications.
-
-Type 'demo()' for some demos, 'help()' for on-line help, or
-'help.start()' for an HTML browser interface to help.
-Type 'q()' to quit R.
-
-> 
-> library(igraph)
-> 
-> for (i in 1:50) {
-+   p <- runif(1)
-+   d <- sample(1:3, 1)
-+   nei <- sample(2:5, 1)
-+   g <- watts.strogatz.game(d, 10, nei, p, loops=FALSE)
-+   if (any(is.loop(g))) { stop("foobar") }
-+ }
-> 
-> 
->   
-> 
diff -Nru igraph-0.6.5~quantal1/interfaces/R/types-C.def igraph-0.6.5/interfaces/R/types-C.def
--- igraph-0.6.5~quantal1/interfaces/R/types-C.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/types-C.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,919 +0,0 @@
-
-##################################
-# GRAPH
-
-GRAPH:
-  CTYPE: igraph_t
-  CALL:  &%C%
-  INCONV: 
-    IN: R_SEXP_to_igraph(%I%, &%C%);
-    INOUT: R_SEXP_to_igraph_copy(%I%, &%C%); \
-           IGRAPH_FINALLY(igraph_destroy, &%C%);
-  OUTCONV:
-    OUT: IGRAPH_FINALLY(igraph_destroy, &%C%); \
-         PROTECT(%I%=R_igraph_to_SEXP(&%C%));  \
-         igraph_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_to_SEXP(&%C%));  \
-           igraph_destroy(&%C%); \
-           IGRAPH_FINALLY_CLEAN(1);
-
-GRAPH_OR_0:
-  CTYPE: igraph_t
-  CALL:  (isNull(%I%) ? 0 : &%C%)
-  INCONV: 
-    IN: if (!isNull(%I%)) { R_SEXP_to_igraph(%I%, &%C%); }
-    INOUT: if (!isNull(%I%)) { R_SEXP_to_igraph_copy(%I%, &%C%); \
-             IGRAPH_FINALLY(igraph_destroy, &%C%); }
-    OUT: %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: IGRAPH_FINALLY(igraph_destroy, &%C%); \
-         PROTECT(%I%=R_igraph_to_SEXP(&%C%));  \
-         igraph_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: if (!isNull(%I%)) { PROTECT(%I%=R_igraph_to_SEXP(&%C%));  \
-           igraph_destroy(&%C%); \
-           IGRAPH_FINALLY_CLEAN(1); }
-
-##################################
-# INTEGER
-
-INTEGER:  
-  CTYPE: igraph_integer_t
-  INCONV: 
-    IN: %C%=INTEGER(%I%)[0];
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_INTEGER(1)); \
-         INTEGER(%I%)[0]=%C%;
-
-INTEGERPTR:
-  CTYPE: igraph_integer_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_INTEGER(1)); \
-         INTEGER(%I%)[0]=%C%;
-
-INTEGERPTR_OR_0:
-  CTYPE: igraph_integer_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_INTEGER(1)); \
-         INTEGER(%I%)[0]=%C%;
-
-INT:
-  CTYPE: int
-  INCONV:
-    IN: %C%=INTEGER(%I%)[0];
-
-##################################
-# REAL
-
-REAL:
-  CTYPE: igraph_real_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_NUMERIC(1)); \
-         REAL(%I%)[0]=%C%;
-
-REALPTR:
-  CTYPE: igraph_real_t
-  CALL: &%C%
-  INCONV:
-    INOUT: %C%=REAL(%I%)[0];
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_NUMERIC(1)); \
-         REAL(%I%)[0]=%C%;
-    INOUT: PROTECT(%I%=NEW_NUMERIC(1)); \
-         REAL(%I%)[0]=%C%;
-
-REALPTR_OR_0:
-  CTYPE: igraph_real_t
-  CALL: &%C%
-  INCONV:
-    INOUT: %C%=REAL(%I%)[0];
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_NUMERIC(1)); \
-         REAL(%I%)[0]=%C%;
-    INOUT: PROTECT(%I%=NEW_NUMERIC(1)); \
-         REAL(%I%)[0]=%C%;
-
-##################################
-# BOOLEAN
-
-BOOLEAN:
-  CTYPE: igraph_bool_t
-  INCONV:
-    IN: %C%=LOGICAL(%I%)[0];
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_LOGICAL(1)); \
-         LOGICAL(%I%)[0]=%C%;
-
-BOOLEANPTR:
-  CTYPE: igraph_bool_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_LOGICAL(1)); \
-         LOGICAL(%I%)[0]=%C%;
-
-BOOLEANPTR_OR_0:
-  CTYPE: igraph_bool_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: PROTECT(%I%=NEW_LOGICAL(1)); \
-         LOGICAL(%I%)[0]=%C%;
-
-##################################
-# ERROR, used as the return type usually
-
-ERROR:
-  CTYPE: int
-
-##################################
-# CONNECTEDNESS
-
-CONNECTEDNESS:
-  CTYPE: igraph_connectedness_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-NEIMODE:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-INOUTMODE:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-TOUNDIRECTED:
-  CTYPE: igraph_integer_t 
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-BLISSSH:
-  CTYPE: igraph_bliss_sh_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-ADD_WEIGHTS:
-  CTYPE: igraph_add_weights_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-##################################
-# VECTOR of real values
-
-VECTOR:
-  CTYPE: igraph_vector_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_vector(%I%, &%C%);
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-    INOUT: if (0 != R_SEXP_to_vector_copy(%I%, &%C%)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-           } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_vector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTORM1:
-  CTYPE: igraph_vector_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_vector(%I%, &%C%);
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-    INOUT: if (0 != R_SEXP_to_vector_copy(%I%, &%C%)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-           } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_to_SEXPp1(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_vector_to_SEXPp1(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTOR_BOOL:
-  CTYPE: igraph_vector_bool_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_vector_bool(%I%, &%C%);
-    OUT: if (0 != igraph_vector_bool_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_bool_destroy, &%C%);
-    INOUT: if (0 != R_SEXP_to_vector_bool_copy(%I%, &%C%)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_bool_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_bool_to_SEXP(&%C%)); \
-         igraph_vector_bool_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_vector_bool_to_SEXP(&%C%)); \
-         igraph_vector_bool_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTOR_LONG:
-  CTYPE: igraph_vector_long_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_vector_long_copy(%I%, &%C%);
-    OUT: if (0 != igraph_vector_long_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_long_destroy, &%C%);
-  OUTCONV:
-    IN: igraph_vector_long_destroy(&%C%);
-    OUT: PROTECT(%I%=R_igraph_vector_long_to_SEXP(&%C%)); \
-         igraph_vector_long_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTOR_LONG_M1:
-  CTYPE: igraph_vector_long_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_vector_long_copy(%I%, &%C%);
-    OUT: if (0 != igraph_vector_long_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_long_destroy, &%C%);
-  OUTCONV:
-    IN: igraph_vector_long_destroy(&%C%);
-    OUT: PROTECT(%I%=R_igraph_vector_long_to_SEXPp1(&%C%)); \
-         igraph_vector_long_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTORLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VERTEXSETLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP_p1(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-EDGESETLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP_p1(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTORLIST_OR_0:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VERTEXSETLIST_OR_0:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP_p1(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-EDGESETLIST_OR_0:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP_p1(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-ADJLIST:
-  CTYPE: igraph_adjlist_t
-  CALL: &%C%
-  INCONV:
-    IN:  if (0 != R_SEXP_to_igraph_adjlist(%I%, &%C%)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         }
-
-##################################
-# VECTOR that can be NULL
-# 'OUT' arguments are always returned now, in the 
-# future we should have a boolean R argument for them which
-# defines whether or not we want to return them, but this 
-# requires some stimulus development.
-
-VECTOR_OR_0:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-    INOUT: if (!isNull(%I%)) { \
-             if (0 != R_SEXP_to_vector_copy(%I%, &%C%)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } else { \
-             if (0 != igraph_vector_init(&%C%, 0)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } \
-           IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-           %I%=NEW_NUMERIC(0);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTORM1_OR_0:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-    INOUT: if (!isNull(%I%)) { \
-             if (0 != R_SEXP_to_vector_copy(%I%, &%C%)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } else { \
-             if (0 != igraph_vector_init(&%C%, 0)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } \
-           IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-           %I%=NEW_NUMERIC(0);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXPp1(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_0orvector_to_SEXPp1(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-# This is the same, some syntax would be needed to express it
-
-EDGEWEIGHTS:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VERTEXWEIGHTS:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-EDGECAPACITY:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTOR_BOOL_OR_0:
-  CTYPE: igraph_vector_bool_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_bool(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_bool_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_bool_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_bool_to_SEXP(&%C%)); \
-         igraph_vector_bool_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTOR_LONG_OR_0:
-  CTYPE: igraph_vector_long_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_long(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_long_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_long_destroy, &%C%); \
-         %I%=NEW_INTEGER(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_long_to_SEXP(&%C%)); \
-         igraph_vector_long_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# MATRIX of real values
-
-MATRIX:
-  CTYPE: igraph_matrix_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_matrix(%I%, &%C%);
-    OUT: if (0 != igraph_matrix_init(&%C%, 0, 0)) { \
-            igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_matrix_destroy, &%C%);
-    INOUT: if (0 != R_SEXP_to_igraph_matrix_copy(%I%, &%C%)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_matrix_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_matrix_to_SEXP(&%C%)); \
-         igraph_matrix_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_matrix_to_SEXP(&%C%)); \
-         igraph_matrix_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-MATRIX_OR_0:
-  CTYPE: igraph_matrix_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_matrix(%I%, &%C%); }
-    OUT: if (0 != igraph_matrix_init(&%C%, 0, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_matrix_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-    INOUT: if (!isNull(%I%)) { \
-             if (0 != R_SEXP_to_igraph_matrix_copy(%I%, &%C%)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } else { \
-             if (0 != igraph_matrix_init(&%C%, 0, 0)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } \
-           IGRAPH_FINALLY(igraph_matrix_destroy, &%C%); \
-           %I%=NEW_NUMERIC(0);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0ormatrix_to_SEXP(&%C%)); \
-         igraph_matrix_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_0ormatrix_to_SEXP(&%C%)); \
-         igraph_matrix_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# 3d array
-
-ARRAY3:
-  CTYPE: igraph_array3_t
-  CALL: &%C%
-  INCONV:
-    IN: R_igraph_SEXP_to_array3(%I%, &%C%);
-    OUT: if (0 != igraph_array3_init(&%C%, 0, 0, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_array3_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_array3_to_SEXP(&%C%)); \
-         igraph_array3_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-ARRAY3_OR_0:
-  CTYPE: igraph_array3_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_igraph_SEXP_to_array3(%I%, &%C%); }
-    OUT: if (0 != igraph_array3_init(&%C%, 0, 0, 0)) { \
-            igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_array3_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orarray3_to_SEXP(&%C%)); \
-         igraph_array3_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# 3d array
-
-
-##################################
-# A single vertex
-
-VERTEX:
-  CTYPE: igraph_integer_t
-  INCONV: 
-    IN: %C%=REAL(%I%)[0];
-
-##################################
-# Some vertices/edges of a graph
-
-VERTEXSET:
-  CTYPE: 
-    IN: igraph_vs_t
-    OUT: igraph_vector_t
-  CALL: 
-    IN: %C%
-    OUT: &%C%
-  INCONV:
-    IN: R_SEXP_to_igraph_vs(%I%, &%C1%, &%C%);
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    IN: igraph_vs_destroy(&%C%);
-    OUT: PROTECT(%I%=R_igraph_vector_to_SEXPp1(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-EDGESET:
-  CTYPE: igraph_es_t
-  INCONV:
-    IN: R_SEXP_to_igraph_es(%I%, &%C1%, &%C%);
-  OUTCONV:
-    IN: igraph_es_destroy(&%C%);
-
-##################################
-# NULL, this is supplied as an argument
-
-NULL:
-  CALL: 0
-  HEADER:
-
-##################################
-# Options to the ARPACK solver
-
-ARPACKOPT:
-  CTYPE: igraph_arpack_options_t
-  CALL: &%C%
-  INCONV:
-    INOUT: R_SEXP_to_igraph_arpack_options(%I%, &%C%);
-  OUTCONV:
-    INOUT: PROTECT(%I%=R_igraph_arpack_options_to_SEXP(&%C%));
-
-DRL_OPTIONS:
-  CTYPE: igraph_layout_drl_options_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_igraph_layout_drl_options(%I%, &%C%);
-
-BLISSINFO:
-  CTYPE: igraph_bliss_info_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_bliss_info_to_SEXP(&%C%)); \
-         if (%C%.group_size) { free(%C%.group_size); }
-
-##################################
-# String vector
-
-STRVECTOR:
-  CTYPE: igraph_strvector_t
-  CALL: &%C%
-  INCONV:
-    IN: R_igraph_SEXP_to_strvector(%I%, &%C%);
-    OUT: if (0 != igraph_strvector_init(&%C%, 0)) { \
-            igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_strvector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_strvector_to_SEXP(&%C%)); \
-         igraph_strvector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# Vertex types in a bipartite graph
-
-BIPARTITE_TYPES:
-  CTYPE: igraph_vector_bool_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_bool(%I%, &%C%); }
-
-BIPARTITE_TYPES_OR_0:
-  CTYPE: igraph_vector_bool_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_bool(%I%, &%C%); }
-
-##################################
-# Vertex colors
-
-VERTEX_COLOR:
-  CTYPE: igraph_vector_int_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV: 
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_int(%I%, &%C%); }
-
-##################################
-# Edge colors
-
-EDGE_COLOR:
-  CTYPE: igraph_vector_int_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV: 
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_int(%I%, &%C%); }
-
-##################################
-# Community comparison methods
-
-COMMCMP:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-##################################
-# Subgraph implementations
-
-SUBGRAPH_IMPL:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-##################################
-# Specification on what to do with the attributes
-
-VERTEX_ATTRIBUTE_COMBINATION:
-  CTYPE: igraph_attribute_combination_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_attr_comb(%I%, &%C%);
-
-EDGE_ATTRIBUTE_COMBINATION:
-  CTYPE: igraph_attribute_combination_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_attr_comb(%I%, &%C%);
-
-HRG:
-  CTYPE: igraph_hrg_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_hrg(%I%, &%C%);
-    OUT: if (0 != igraph_hrg_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_hrg_destroy, &%C%);
-    INOUT: if (0 != R_SEXP_to_hrg_copy(%I%, &%C%)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-           } \
-         IGRAPH_FINALLY(igraph_hrg_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_hrg_to_SEXP(&%C%)); \
-         igraph_hrg_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_hrg_to_SEXP(&%C%)); \
-         igraph_hrg_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-RECIP:
-  CTYPE: igraph_reciprocity_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-SCGMAT:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-SCGALGO:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-SCGNORM:
-  CTYPE: igraph_integer_t 
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-SCGDIR:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: %C%=REAL(%I%)[0];
-
-SPARSEMAT:
-  CTYPE: igraph_sparsemat_t
-  CALL: &%C%
-  INCONV: 
-    IN: R_SEXP_to_sparsemat(%I%, &%C%);
-    OUT: if (0 != igraph_sparsemat_init(&%C%, 0, 0, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_sparsemat_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_sparsemat_to_SEXP(&%C%)); \
-         igraph_sparsemat_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-SPARSEMAT_OR_0:
-  CTYPE: igraph_sparsemat_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_sparsemat(%I%, &%C%); }
-    OUT: if (0 != igraph_sparsemat_init(&%C%, 0, 0, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_sparsemat_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orsparsemat_to_SEXP(&%C%)); \
-         igraph_sparsemat_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-CVECTOR:
-  CTYPE: igraph_vector_complex_t
-  CALL: &%C%
-  INCONV: 
-    IN: R_SEXP_to_vector_complex(%I%, &%C%);
-    OUT: if (0 != igraph_vector_complex_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_complex_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_complex_to_SEXP(&%C%)); \
-         igraph_vector_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
- 
-CMATRIX:
-  CTYPE: igraph_matrix_complex_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_matrix_complex(%I%, &%C%);
-    OUT: if (0 != igraph_matrix_complex_init(&%C%, 0, 0)) { \
-            igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_matrix_complex_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_matrix_complex_to_SEXP(&%C%)); \
-         igraph_matrix_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-CVECTOR_OR_0:
-  CTYPE: igraph_vector_complex_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector_complex(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_complex_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_complex_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-    INOUT: if (!isNull(%I%)) { \
-             if (0 != R_SEXP_to_vector_complex_copy(%I%, &%C%)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } else {  \
-             if (0 != igraph_vector_complex_init(&%C%, 0)) { \
-	       igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-	     } \
-           } \
-           IGRAPH_FINALLY(igraph_vector_complex_destroy, &%C%); \
-           %I%=NEW_NUMERIC(0);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_complex_to_SEXP(&%C%)); \
-         igraph_vector_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_0orvector_complex_to_SEXP(&%C%)); \
-         igraph_vector_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-  
-
-CMATRIX_OR_0:
-  CTYPE: igraph_matrix_complex_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_matrix_complex(%I%, &%C%); }
-    OUT: if (0 != igraph_matrix_complex_init(&%C%, 0, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_matrix_complex_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-    INOUT: if (!isNull(%I%)) { \
-             if (0 != R_SEXP_to_matrix_complex_copy(%I%, &%C%)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } else { \
-             if (0 != igraph_matrix_complex_init(&%C%, 0, 0)) { \
-               igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-             } \
-           } \
-           IGRAPH_FINALLY(igraph_matrix_complex_destroy, &%C%); \
-           %I%=NEW_NUMERIC(0);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0ormatrix_complex_to_SEXP(&%C%)); \
-         igraph_matrix_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-    INOUT: PROTECT(%I%=R_igraph_0ormatrix_complex_to_SEXP(&%C%)); \
-         igraph_matrix_complex_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VERTEXINDEX:
-  CTYPE: igraph_vector_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VERTEXINDEX_OR_0:
-  CTYPE: igraph_vector_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-             igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-PLFIT:
-  CTYPE: igraph_plfit_result_t
-  CALL: &%C%
-  OUTCONV: 
-    OUT: PROTECT(%I%=R_igraph_plfit_result_to_SEXP(&%C%));
diff -Nru igraph-0.6.5~quantal1/interfaces/R/types-R.def igraph-0.6.5/interfaces/R/types-R.def
--- igraph-0.6.5~quantal1/interfaces/R/types-R.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/R/types-R.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,326 +0,0 @@
-
-GRAPH:
-    INCONV: if (!is.igraph(%I%)) { stop("Not a graph object") }
-
-GRAPH_OR_0:    
-    INCONV: if (!is.null(graph) && !is.igraph(%I%)) { stop("Not a graph object") }
-
-INTEGER:
-    INCONV: %I% <- as.integer(%I%)
-
-REAL:
-    INCONV: %I% <- as.numeric(%I%)
-
-BOOLEAN:
-    INCONV: %I% <- as.logical(%I%)
-    DEFAULT:
-       True: TRUE
-       False: FALSE
-
-VECTOR:
-    INCONV: %I% <- as.numeric(%I%)
-
-VERTEXINDEX:
-    OUTCONV: 
-        OUT:  if (getIgraphOpt("add.vertex.names") && is.named(%I1%)) { \
-                names(%I%) <- get.vertex.attribute(%I1%, "name", %I2%) \
-              }
-
-VERTEXINDEX_OR_0:
-    OUTCONV: 
-        OUT:  if (getIgraphOpt("add.vertex.names") && is.named(%I1%)) { \
-                names(%I%) <- get.vertex.attribute(%I1%, "name", %I2%) \
-              }
-
-VECTOR_LONG:
-    INCONV: %I% <- as.numeric(%I%)
-
-VECTORM1:
-    INCONV: %I% <- as.numeric(%I%)-1
-
-VECTOR_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- as.numeric(%I%)
-
-VECTORM1_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- as.numeric(%I%)-1
-
-VECTOR_LONG_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- as.numeric(%I%)
-
-VECTOR_LONG_M1:
-    INCONV: %I% <- as.numeric(%I%)-1
-
-VECTOR_BOOL:
-    INCONV: %I% <- as.logical(%I%)
-
-VECTOR_BOOL_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- as.logical(%I%)
-
-MATRIX:
-    INCONV: %I% <- as.matrix(structure(as.double(%I%), dim=dim(%I%)))
-
-MATRIX_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- structure(as.double(%I%), dim=dim(%I%))
-
-ARRAY3:
-    INCONV: %I% <- structure(as.double(%I%), dim=dim(%I%))
-
-ARRAY3_OR_0:
-    INCONV: if (!is.null(%I%)) %I% <- structure(as.double(%I%), dim=dim(%I%))
-
-ATTRIBUTES:
-
-CONNECTEDNESS:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "weak"=1, "strong"=2)
-    DEFAULT:
-       WEAK: c("weak", "strong")
-
-NEIMODE:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "out"=1, "in"=2, "all"=3, "total"=3)
-    DEFAULT:
-       ALL: c("all", "out", "in", "total")
-       TOTAL: c("total", "out", "in", "all")
-       OUT: c("out", "in", "all", "total")
-       IN: c("in", "out", "all", "total")
-
-INOUTMODE:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "out"=1, "in"=2)
-    DEFAULT:
-       OUT: c("out", "in")
-       IN: c("in", "out")
-
-TOUNDIRECTED:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "collapse"=1, "each"=0, "mutual"=2)
-    DEFAULT:
-       COLLAPSE: c("collapse", "each", "mutual")
-
-INTEGERPTR:
-    INCONV:
-       INOUT: %I% <- as.integer(%I%)
-
-INTEGERPTR_OR_0:
-    INCONV:
-       INOUT: %I% <- as.integer(%I%)
-
-BOOLEANPTR:
-
-BOOLEANPTR_OR_0:    
-
-REALPTR:
-    INCONV:
-       INOUT: %I% <- as.numeric(%I%)
-
-REALPTR_OR_0:
-    INCONV:
-       INOUT: %I% <- as.numeric(%I%)
-
-INT:
-    INCONV: %I% <- as.integer(%I%)
-
-VERTEXSET:
-    INCONV: %I% <- as.igraph.vs(%I1%, %I%)
-    CALL: %I%-1
-    DEFAULT:
-       ALL: V(%I1%)
-
-VERTEX:
-    INCONV: %I% <- as.igraph.vs(%I1%, %I%)
-    CALL: %I%-1
-
-EDGESET:
-    INCONV: %I% <- as.igraph.es(%I1%, %I%)
-    CALL: %I%-1
-    DEFAULT:
-       ALL: E(%I1%)
-
-EDGEWEIGHTS:
-    INCONV: if (is.null(%I%) && "weight" %in% list.edge.attributes(%I1%)) { \
-               %I% <- E(%I1%)$weight \
-            } \
-            if (!is.null(%I%) && any(!is.na(%I%))) { \
-               %I% <- as.numeric(%I%) \
-            } else { \
-               %I% <- NULL \
-            }
-
-VERTEXWEIGHTS:
-    INCONV: if (is.null(%I%) && "weight" %in% list.vertex.attributes(%I1%)) { \
-               %I% <- V(%I1%)$weight \
-            } \
-            if (!is.null(%I%) && any(!is.na(%I%))) { \
-               %I% <- as.numeric(%I%) \
-            } else { \
-               %I% <- NULL \
-            }
-
-EDGECAPACITY:
-    INCONV: if (is.null(%I%) && "capacity" %in% list.edge.attributes(%I1%)) { \
-               %I% <- E(%I1%)$capacity \
-            } \
-            if (!is.null(%I%) && any(!is.na(%I%))) { \
-               %I% <- as.numeric(%I%) \
-            } else { \
-               %I% <- NULL \
-            }
-
-
-BIPARTITE_TYPES:
-    INCONV: if (is.null(%I%) && "type" %in% list.vertex.attributes(%I1%)) { \
-               %I% <- V(%I1%)$type \
-	    } \
-            if (!is.null(%I%)) { \
-               %I% <- as.logical(%I%) \
-            } else { \
-               stop("Not a bipartite graph, supply `types' argument") \
-            }
-
-BIPARTITE_TYPES_OR_0:
-    INCONV: if (is.null(%I%) && "type" %in% list.vertex.attributes(%I1%)) { \
-               %I% <- V(%I1%)$type \
-	    } \
-            if (!is.null(%I%)) { \
-               %I% <- as.logical(%I%) \
-            }
-
-VERTEX_COLOR:
-    INCONV: if (missing(%I%)) { \
-               if ("color" %in% list.vertex.attributes(%I1%)) { \
-                 %I% <- V(%I1%)$color \
-               } else { \
-                 %I% <- NULL \
-               } \
-            } \
-            if (!is.null(%I%)) { \
-               %I% <- as.integer(%I%)-1L \
-            }
-
-EDGE_COLOR:
-    INCONV: if (missing(%I%)) { \
-               if ("color" %in% list.edge.attributes(%I1%)) { \
-                 %I% <- E(%I1%)$color \
-               } else { \
-                 %I% <- NULL \
-               } \
-            } \
-            if (!is.null(%I%)) { \
-               %I% <- as.integer(%I%)-1L \
-            }
-
-NULL:
-    CALL:
-    HEADER:
-
-VECTORLIST:
-
-VECTORLIST_OR_0:
-
-VERTEXSETLIST:
-
-VERTEXSETLIST_OR_0:
-
-EDGESETLIST:
-
-EDGESETLIST_OR_0:
-
-ARPACKOPT:
-    INCONV:
-      INOUT: %I%.tmp <- igraph.arpack.default; %I%.tmp[ names(%I%) ] <- %I% ; %I% <- %I%.tmp
-
-DRL_OPTIONS:
-    INCONV:
-      IN: %I%.tmp <- igraph.drl.default; %I%.tmp [names(%I%)] <- %I%; %I% <- %I%.tmp
-
-STRVECTOR:
-
-BLISSSH:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "f"=0, "fl"=1, "fs"=2, "fm"=3, "flm"=4, "fsm"=5)
-
-BLISSINFO:
-
-ADJLIST:
-    INCONV: %I% <- lapply(%I%, function(x) as.numeric(x)-1)
-
-COMMCMP:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "vi"=0, "nmi"=1, \
-                          "split.join"=2, "rand"=3, "adjusted.rand"=4)
-    DEFAULT:
-       VI: c("vi", "nmi", "split.join", "rand", "adjusted.rand")
-
-SUBGRAPH_IMPL:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "auto"=0, "copy_and_delete"=1, "create_from_scratch"=2)
-    DEFAULT:
-       AUTO: c("auto", "copy_and_delete", "create_from_scratch")
-
-EDGE_ATTRIBUTE_COMBINATION:
-    INCONV: %I% <- igraph.i.attribute.combination(%I%)
-    DEFAULT: 
-       Default: getIgraphOpt("edge.attr.comb")
-
-VERTEX_ATTRIBUTE_COMBINATION:
-    INCONV: %I% <- igraph.i.attribute.combination(%I%)
-    DEFAULT: 
-       Default: getIgraphOpt("vertex.attr.comb")
-
-ADD_WEIGHTS:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "no"=0, "yes"=1, "auto"=2)
-
-HRG:
-    INCONV: if (is.null(%I%)) { \
-            %I% <- list(left=c(), right=c(), prob=c(), edges=c(), \
-                        vertices=c()) \
-            } \
-            %I% <- lapply(%I%[c("left","right","prob","edges","vertices")], \
-                          as.numeric)
-    DEFAULT:
-       Default: NULL
-
-RECIP:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), 'default'=0, 'ratio'=1)
-    DEFAULT:
-       Default: c('default', 'ratio')
-
-SCGMAT:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "symmetric"=1, \
-                          "laplacian"=2, "stochastic"=3)
-    DEFAULT:
-      Default: c("symmetric", "laplacian", "stochastic")
-
-SCGALGO:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "optimum"=1, "interv_km"=2, \
-                          "interv"=3, "exact_scg"=4)
-    DEFAULT:
-      Default: c("optimum", "interv_km", "interv", "exact_scg")
-
-SCGNORM:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "row"=1, "col"=2)
-    DEFAULT:
-      Default: c("row", "col")
-
-SCGDIR:
-    INCONV: %I% <- switch(igraph.match.arg(%I%), "default"=1, "left"=2, "right"=3)
-    DEFAULT: 
-      Default: c("default", "left", "right")
-
-SPARSEMAT:
-    INCONV: require(Matrix); %I% <- as(%I%, "dgCMatrix")
-
-SPARSEMAT_OR_0:
-    INCONV: if (!is.null(%I%)) { \
-               require(Matrix); %I% <- as(%I%, "dgCMatrix") \
-            }
-
-CVECTOR:
-    INCONV: %I% <- as.complex(%I%)
-
-CMATRIX:
-    INCONV: %I% <- as.matrix(structure(as.complex(%I%), dim=dim(%I%)))
-
-CVECTOR_OR_0:
-    if (!is.null(%I%)) { INCONV: %I% <- as.complex(%I%) }
-
-CMATRIX_OR_0:
-    if (!is.null(%I%)) { \
-       INCONV: %I% <- as.matrix(structure(as.complex(%I%), dim=dim(%I%))) \
-    }
-
-PLFIT:
diff -Nru igraph-0.6.5~quantal1/interfaces/functions.def igraph-0.6.5/interfaces/functions.def
--- igraph-0.6.5~quantal1/interfaces/functions.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/functions.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,1957 +0,0 @@
-
-#######################################
-# The basic interface
-#######################################
-
-igraph_empty:
-        PARAMS: OUT GRAPH graph, INTEGER n=0, BOOLEAN directed=True
-
-igraph_add_edges:
-        PARAMS: INOUT GRAPH graph, VECTOR edges, ATTRIBUTES attr
-        NAME-R: add.edges
-        IGNORE: RR, RC
-
-igraph_add_vertices:
-        PARAMS: INOUT GRAPH graph, INTEGER nv, ATTRIBUTES attr
-        NAME-R: add.vertices
-        IGNORE: RR, RC, RNamespace
-
-igraph_delete_edges:
-        PARAMS: INOUT GRAPH graph, EDGESET edges
-        NAME-R: delete.edges
-        DEPS: edges ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_delete_vertices:
-        PARAMS: INOUT GRAPH graph, VERTEXSET vertices
-        NAME-R: delete.vertices
-        IGNORE: RR, RC, RNamespace
-
-igraph_vcount:
-        PARAMS: GRAPH graph
-        NAME-R: vcount
-        RETURN: INTEGER
-
-igraph_ecount:
-        PARAMS: GRAPH graph
-        NAME-R: ecount
-        RETURN: INTEGER
-        IGNORE: RR, RC, RNamespace
-
-igraph_neighbors:
-        PARAMS: GRAPH graph, OUT VECTOR neis, INTEGER vid, NEIMODE mode=ALL
-        NAME-R: neighbors
-        IGNORE: RR, RC, RNamespace
-
-igraph_is_directed:
-        PARAMS: GRAPH graph
-        NAME-R: is.directed
-        RETURN: BOOLEAN
-        IGNORE: RR, RC, RNamespace
-
-igraph_degree:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, NEIMODE mode=ALL, \ 
-                BOOLEAN loops
-        NAME-R: degree
-        IGNORE: RR, RC, RNamespace
-
-igraph_edge:
-        PARAMS: GRAPH graph, INTEGER eid, OUT INTEGERPTR from, OUT INTEGERPTR to
-        NAME-R: get.edge
-        IGNORE: RR, RC, RNamespace
-
-igraph_edges:
-        PARAMS: GRAPH graph, EDGESET eids, OUT VECTOR edges
-        NAME-R: get.edges
-        DEPS: eids ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_eid:
-        PARAMS: GRAPH graph, OUT INTEGERPTR eid, INTEGER from, \
-                INTEGER to, BOOLEAN directed=True, BOOLEAN error=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_eids:
-        PARAMS: GRAPH graph, OUT VECTOR eids, VECTOR pairs, \
-                BOOLEAN directed=True, BOOLEAN error=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_incident:
-        PARAMS: GRAPH graph, OUT VECTOR eids, INTEGER vid, NEIMODE mode=ALL
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Constructors, deterministic
-#######################################
-
-igraph_create:
-        PARAMS: OUT GRAPH graph, VECTOR edges, INTEGER n=0, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_adjacency:
-        PARAMS: OUT GRAPH graph, MATRIX adjmatrix, ADJACENCYMODE mode=DIRECTED
-        IGNORE: RR, RC, RNamespace
-
-igraph_weighted_adjacency:
-        PARAMS: OUT GRAPH graph, MATRIX adjmatrix, \
-                ADJACENCYMODE mode=DIRECTED, CSTRING attr="weight", \
-                BOOLEAN loops
-        IGNORE: RR, RC, RNamespace
-
-igraph_star:
-        PARAMS: OUT GRAPH graph, INTEGER n, STARMODE mode=OUT, INTEGER center=0
-        IGNORE: RR, RC, RNamespace
-
-igraph_lattice:
-        PARAMS: OUT GRAPH graph, VECTOR dimvector, INTEGER nei=1, \
-                BOOLEAN directed=False, BOOLEAN mutual=False, BOOLEAN circular=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_ring:
-        PARAMS: OUT GRAPH graph, INTEGER n, BOOLEAN directed=False, BOOLEAN mutual=False, \
-                BOOLEAN circular=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_tree:
-        PARAMS: OUT GRAPH graph, INTEGER n, INTEGER children=2, TREEMODE type=OUT
-        IGNORE: RR, RC, RNamespace
-
-igraph_full:
-        PARAMS: OUT GRAPH graph, INTEGER n, BOOLEAN directed=False, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_full_citation:
-        PARAMS: OUT GRAPH graph, INTEGER n, BOOLEAN directed=True
-        GATTR-R: name IS Full citation graph
-
-igraph_atlas:
-        PARAMS: OUT GRAPH graph, INT number=0
-        IGNORE: RR, RC, RNamespace
-
-igraph_extended_chordal_ring:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, MATRIX W
-        IGNORE: RR, RC, RNamespace
-
-igraph_connect_neighborhood:
-        PARAMS: INOUT GRAPH graph, INTEGER order=2, NEIMODE mode=ALL
-        IGNORE: RR, RC, RNamespace
-
-igraph_linegraph:
-        PARAMS: GRAPH graph, OUT GRAPH linegraph
-        IGNORE: RR, RC, RNamespace
-
-igraph_de_bruijn:
-        PARAMS: OUT GRAPH graph, INTEGER m, INTEGER n
-        IGNORE: RR, RC, RNamespace
-
-igraph_kautz:
-        PARAMS: OUT GRAPH graph, INTEGER m, INTEGER n
-        IGNORE: RR, RC, RNamespace
-
-igraph_famous:
-        PARAMS: OUT GRAPH graph, CSTRING name=""
-        IGNORE: RR, RC, RNamespace
-
-igraph_lcf_vector:
-        PARAMS: OUT GRAPH graph, INTEGER n, VECTOR shifts, INTEGER repeats=1
-        NAME-R: graph.lcf
-        GATTR-R: name IS LCF graph
-
-igraph_adjlist:
-        PARAMS: OUT GRAPH graph, ADJLIST adjlist, NEIMODE mode=OUT, \
-                BOOLEAN duplicate=True
-        NAME-R: graph.adjlist
-
-igraph_full_bipartite:
-        PARAMS: OUT GRAPH graph, OUT VECTOR_BOOL_OR_0 types, INTEGER n1, \
-                INTEGER n2, BOOLEAN directed=False, NEIMODE mode=ALL
-        IGNORE: RR
-
-#######################################
-# Constructors, games
-#######################################
-
-igraph_barabasi_game:
-        PARAMS: OUT GRAPH graph, INTEGER n, INTEGER m=1, REAL power=1.0, \
-                VECTOR_OR_0 outseq, BOOLEAN outpref=False, REAL A=1.0, \
-                BOOLEAN directed=True, BARABASI_ALGORITHM algo=BAG, \
-                GRAPH_OR_0 start_from=0
-        IGNORE: RR, RC, RNamespace
-
-igraph_erdos_renyi_game_gnp:
-        PARAMS: OUT GRAPH graph, INTEGER n, REAL p, BOOLEAN directed=False, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_erdos_renyi_game_gnm:
-        PARAMS: OUT GRAPH graph, INTEGER n, REAL m, BOOLEAN directed=False, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_degree_sequence_game:
-        PARAMS: OUT GRAPH graph, VECTOR out_deg, VECTOR_OR_0 in_deg, \
-                DEGSEQMODE method=SIMPLE
-        IGNORE: RR, RC, RNamespace
-
-igraph_growing_random_game:
-        PARAMS: OUT GRAPH graph, INTEGER n, INTEGER m=1, BOOLEAN directed=False, \
-                BOOLEAN citation=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_barabasi_aging_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER m=1, VECTOR_OR_0 outseq, \
-                BOOLEAN outpref=False, REAL pa_exp=1.0, REAL aging_exp=0.0, INTEGER aging_bin=1, \
-                REAL zero_deg_appeal=1.0, REAL zero_age_appeal=0.0, REAL deg_coef=1.0, \
-                REAL age_coef=1.0, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_recent_degree_game:
-        PARAMS: OUT GRAPH graph, INTEGER n, REAL power=1.0, INTEGER window=1, \
-                INTEGER m=1, VECTOR_OR_0 outseq, BOOLEAN outpref=False, \
-                REAL zero_appeal=1.0, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_recent_degree_aging_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER m=1, VECTOR_OR_0 outseq, \
-                BOOLEAN outpref=False, REAL pa_exp=1.0, REAL aging_exp=0.0, INTEGER aging_bin=1, \
-                INTEGER window=1, REAL zero_appeal=1.0, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_callaway_traits_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER types, \
-                INTEGER edges_per_step=1, VECTOR type_dist, MATRIX pref_matrix, \
-                BOOLEAN directed=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_establishment_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER types, INTEGER k=1, \
-                VECTOR type_dist, MATRIX pref_matrix, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_grg_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, REAL radius, BOOLEAN torus=False, VECTOR_OR_0 x, VECTOR_OR_0 y
-        IGNORE: RR, RC, RNamespace
-
-igraph_preference_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER types, \
-                VECTOR type_dist, BOOLEAN fixed_sizes=False, \
-                MATRIX pref_matrix, OUT VECTOR node_type_vec, \
-                BOOLEAN directed=False, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_asymmetric_preference_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER types, \
-                MATRIX type_dist_matrix, MATRIX pref_matrix, \
-                OUT VECTOR node_type_in_vec, OUT VECTOR node_type_out_vec, \
-                BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_rewire_edges:
-        PARAMS: INOUT GRAPH graph, REAL prob, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_watts_strogatz_game:
-        PARAMS: OUT GRAPH graph, INTEGER dim, INTEGER size, INTEGER nei, \
-                REAL p, BOOLEAN loops=False, BOOLEAN multiple=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_lastcit_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, INTEGER edges_per_node=1, \
-                INTEGER agebins=1, VECTOR preference, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_cited_type_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, VECTOR types, VECTOR pref, \
-                INTEGER edges_per_step=1, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_citing_cited_type_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, VECTOR types, MATRIX pref, \
-                INTEGER edges_per_step=1, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_forest_fire_game:
-        PARAMS: OUT GRAPH graph, INTEGER nodes, REAL fw_prob, REAL bw_factor=1, \
-                INTEGER ambs=1, BOOLEAN directed=True
-        NAME-R: forest.fire.game
-        GATTR-R: name IS Forest fire model
-        GATTR-PARAM-R: fw_prob, bw_factor, ambs
-        FLAGS: PROGRESS
-
-igraph_simple_interconnected_islands_game:
-        PARAMS: OUT GRAPH graph, INTEGER islands_n, INTEGER islands_size, \
-                REAL islands_pin, INTEGER n_inter
-        NAME-R: interconnected.islands.game
-        GATTR-R: name IS Interconnected islands model
-        GATTR-PARAM-R: islands_n, islands_size, islands_pin, n_inter
-        IGNORE: RC
-
-igraph_static_fitness_game:
-        PARAMS: OUT GRAPH graph, INTEGER no_of_edges, VECTOR fitness_out, \
-                VECTOR_OR_0 fitness_in=NULL, BOOLEAN loops=False, \
-                BOOLEAN multiple=False
-        NAME-R: static.fitness.game
-        GATTR-R: name IS Static fitness model
-        GATTR-PARAM-R: loops, multiple
-        FLAGS: PROGRESS
-
-igraph_static_power_law_game:
-        PARAMS: OUT GRAPH graph, INTEGER no_of_nodes, INTEGER no_of_edges, \
-                REAL exponent_out, REAL exponent_in=-1, \
-                BOOLEAN loops=False, BOOLEAN multiple=False, \
-		BOOLEAN finite_size_correction=True
-        NAME-R: static.power.law.game
-        GATTR-R: name IS Static power law model
-        GATTR-PARAM-R: exponent_out, exponent_in, loops, multiple, \
-                       finite_size_correction
-        FLAGS: PROGRESS
-                
-igraph_k_regular_game:
-        PARAMS: OUT GRAPH graph, INTEGER no_of_nodes, INTEGER k, \
-                BOOLEAN directed=False, BOOLEAN multiple=False
-        NAME-R: k.regular.game
-        GATTR-R: name IS k-regular graph
-        GATTR-PARAM-R: k
-
-#######################################
-# Basic query functions
-#######################################
-
-igraph_are_connected:
-        PARAMS: GRAPH graph, INTEGER v1, INTEGER v2, OUT BOOLEANPTR res
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Structural properties
-#######################################
-
-igraph_diameter:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, OUT INTEGERPTR from, \
-                OUT INTEGERPTR to, OUT VECTOR_OR_0 path, BOOLEAN directed=True, \
-                BOOLEAN unconnected=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_diameter_dijkstra:
-        PARAMS: GRAPH graph, EDGEWEIGHTS weights=NULL, \
-                OUT INTEGERPTR res, OUT INTEGERPTR from, \
-                OUT INTEGERPTR to, OUT VECTOR_OR_0 path, BOOLEAN directed=True, \
-                BOOLEAN unconnected=True
-        DEPS: weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_minimum_spanning_tree:
-        PARAMS: GRAPH graph, OUT VECTOR res, EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_minimum_spanning_tree_unweighted:
-        PARAMS: GRAPH graph, OUT GRAPH mst
-        IGNORE: RR, RC, RNamespace
-
-igraph_minimum_spanning_tree_prim:
-        PARAMS: GRAPH graph, OUT GRAPH mst, VECTOR weights
-        IGNORE: RR, RC, RNamespace
-
-igraph_closeness:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, \
-                NEIMODE mode=OUT, EDGEWEIGHTS weights=NULL
-        DEPS: vids ON graph, weights ON graph
-        NAME-R: closeness
-        IGNORE: RR
-
-igraph_closeness_estimate:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX res, VERTEXSET vids=ALL, \
-                NEIMODE mode=OUT, REAL cutoff, EDGEWEIGHTS weights=NULL
-        DEPS: vids ON graph, weights ON graph, res ON graph vids
-        NAME-R: closeness.estimate
-
-igraph_shortest_paths:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET from=ALL, \
-                VERTEXSET to=ALL, NEIMODE mode=OUT
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_shortest_paths:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST_OR_0 vertices, 
-                OUT EDGESETLIST_OR_0 edges, VERTEX from, VERTEXSET to=ALL, \
-                NEIMODE mode=OUT
-        DEPS: vertices ON graph, edges ON graph, from ON graph, to ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_all_shortest_paths:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res, OUT VECTOR nrgeo, \
-                VERTEX from, VERTEXSET to, NEIMODE mode=OUT
-        DEPS: res ON graph, from ON graph, to ON graph
-        IGNORE: RR, RNamespace
-
-igraph_shortest_paths_dijkstra:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET from=ALL, \
-                VERTEXSET to=ALL, EDGEWEIGHTS weights, NEIMODE mode=OUT
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_shortest_paths_dijkstra:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST_OR_0 vertices, \
-                OUT EDGESETLIST_OR_0 edges, VERTEX from, VERTEXSET to=ALL, \
-                EDGEWEIGHTS weights=NULL, NEIMODE mode=ALL
-        DEPS: vertices ON graph, edges ON graph, from ON graph, to ON graph,\
-              weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_all_shortest_paths_dijkstra:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res, OUT VECTOR nrgeo, \
-                VERTEX from, VERTEXSET to=ALL, EDGEWEIGHTS weights, \
-                NEIMODE mode=OUT
-        DEPS: weights ON graph, to ON graph, res ON graph, from ON graph
-        IGNORE: RR, RNamespace
-
-igraph_shortest_paths_bellman_ford:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET from=ALL, \
-                VERTEXSET to=ALL, EDGEWEIGHTS weights, NEIMODE mode=OUT
-        DEPS: from ON graph, to ON graph, weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_shortest_paths_johnson:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET from=ALL, \
-                VERTEXSET to=ALL, EDGEWEIGHTS weights
-        IGNORE: RR, RC, RNamespace
-
-igraph_subcomponent: 
-        PARAMS: GRAPH graph, OUT VERTEXSET res, VERTEX vid, NEIMODE mode=ALL
-        IGNORE: RR, RC, RNamespace
-
-igraph_betweenness:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, \
-                BOOLEAN directed=True, EDGEWEIGHTS weights=NULL, \
-                BOOLEAN nobigint=True
-        IGNORE: RR, RC, RNamespace
-        DEPS: weights ON graph
-        FLAGS: PROGRESS
-
-igraph_betweenness_estimate:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX res, VERTEXSET vids=ALL, \
-                BOOLEAN directed=True, REAL cutoff, EDGEWEIGHTS weights=NULL, \
-                BOOLEAN nobigint=True
-        DEPS: vids ON graph, weights ON graph, res ON graph vids
-        NAME-R: betweenness.estimate
-        FLAGS: PROGRESS
-
-igraph_edge_betweenness:
-        PARAMS: GRAPH graph, OUT VECTOR res, BOOLEAN directed=True, \
-                EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        NAME-R: edge.betweenness
-        IGNORE: RR
-
-igraph_edge_betweenness_estimate:
-        PARAMS: GRAPH graph, OUT VECTOR res, BOOLEAN directed=True, \
-                REAL cutoff, EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        NAME-R: edge.betweenness.estimate
-        IGNORE: RR
-
-igraph_pagerank_old:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX res, VERTEXSET vids=ALL, \
-                BOOLEAN directed=True, INTEGER niter=1000, REAL eps=0.001, \
-                REAL damping=0.85, BOOLEAN old=False
-        DEPS: vids ON graph, res ON graph vids
-        NAME-R: page.rank.old
-
-igraph_pagerank:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX vector, OUT REALPTR value, \
-                VERTEXSET vids=ALL, BOOLEAN directed=True, \
-                REAL damping=0.85, EDGEWEIGHTS weights=NULL, \
-                INOUT ARPACKOPT options=igraph.arpack.default
-        DEPS: vids ON graph, weights ON graph, vector ON graph vids
-        DEFAULT-R: options=igraph.arpack.default
-        NAME-R: page.rank
-        IGNORE: RR, RC, RNamespace
-
-igraph_personalized_pagerank:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX vector, OUT REALPTR value, \
-                VERTEXSET vids=ALL, BOOLEAN directed=True, \
-                REAL damping=0.85, VECTOR_OR_0 personalized=NULL, \
-                EDGEWEIGHTS weights=NULL, \
-                INOUT ARPACKOPT options=igraph.arpack.default
-        DEPS: vids ON graph, weights ON graph, vector ON graph vids
-        DEFAULT-R: options=igraph.arpack.default
-        NAME-R: page.rank
-
-igraph_rewire:
-        PARAMS: INOUT GRAPH rewire, INTEGER n, REWIRINGMODE mode=SIMPLE
-        IGNORE: RR, RC, RNamespace
-
-igraph_induced_subgraph:
-        PARAMS: GRAPH graph, OUT GRAPH res, VERTEXSET vids, SUBGRAPH_IMPL impl=AUTO
-        DEPS: vids ON graph
-        NAME-R: induced.subgraph
-
-igraph_subgraph:
-        PARAMS: GRAPH graph, OUT GRAPH res, VERTEXSET vids
-        IGNORE: RR, RC, RNamespace
-
-igraph_subgraph_edges:
-        PARAMS: GRAPH graph, OUT GRAPH res, EDGESET eids, BOOLEAN delete_vertices=True
-        DEPS: eids ON graph
-        NAME-R: subgraph.edges
-
-igraph_average_path_length:
-        PARAMS: GRAPH graph, OUT REALPTR res, BOOLEAN directed=True, BOOLEAN unconn=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_path_length_hist:
-        PARAMS: GRAPH graph, OUT VECTOR res, OUT REALPTR unconnected, \
-                BOOLEAN directed=True
-        NAME-R: path.length.hist
-        FLAGS: PROGRESS
-
-igraph_simplify:
-        PARAMS: INOUT GRAPH graph, BOOLEAN remove_multiple=True, \
-                BOOLEAN remove_loops=True, \
-		EDGE_ATTRIBUTE_COMBINATION edge_attr_comb=Default
-        NAME-R: simplify
-
-igraph_transitivity_undirected:
-        PARAMS: GRAPH graph, OUT REALPTR res, TRANSITIVITYMODE mode=NAN
-        IGNORE: RR, RC, RNamespace
-
-igraph_transitivity_local_undirected:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, TRANSITIVITYMODE mode=NAN
-        IGNORE: RR, RC, RNamespace
-
-igraph_transitivity_avglocal_undirected:
-        PARAMS: GRAPH graph, OUT REALPTR res, TRANSITIVITYMODE mode=NAN
-        IGNORE: RR, RC, RNamespace
-
-igraph_transitivity_barrat:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, \
-                EDGEWEIGHTS weights=NULL, TRANSITIVITYMODE mode=NAN
-        DEPENDS: weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_reciprocity:
-        PARAMS: GRAPH graph, OUT REALPTR res, BOOLEAN ignore_loops=True, \
-                RECIP mode=Default
-        IGNORE: RR, RC, RNamespace
-
-igraph_constraint:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids=ALL, VECTOR_OR_0 weights
-        IGNORE: RR, RC, RNamespace
-
-igraph_maxdegree:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, VERTEXSET vids=ALL, NEIMODE mode=ALL, \
-                BOOLEAN loops=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_density:
-        PARAMS: GRAPH graph, OUT REALPTR res, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_neighborhood_size:
-        PARAMS: GRAPH graph, OUT VECTOR res, VERTEXSET vids, INTEGER order, \
-                NEIMODE mode=ALL
-        DEPS: vids ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_neighborhood:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res, \
-                VERTEXSET vids, INTEGER order, \
-                NEIMODE mode=ALL
-        DEPS res ON graph, vids ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_neighborhood_graphs:
-        PARAMS: GRAPH graph, OUT GRAPHLIST res, VERTEXSET vids, \
-                INTEGER order, \
-                NEIMODE mode=ALL
-        DEPS: vids ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_topological_sorting:
-        PARAMS: GRAPH graph, OUT VECTOR res, NEIMODE mode=OUT
-        IGNORE: RR, RC, RNamespace
-
-igraph_is_loop:
-        PARAMS: GRAPH graph, OUT VECTOR_BOOL res, EDGESET es=ALL
-        DEPS: es ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_is_dag:
-        PARAMS: GRAPH graph, OUT BOOLEANPTR res
-        NAME-R: is.dag
-
-igraph_is_simple:
-        PARAMS: GRAPH graph, OUT BOOLEANPTR res
-        NAME-R: is.simple
-
-igraph_is_multiple:
-        PARAMS: GRAPH graph, OUT VECTOR_BOOL res, EDGESET es=ALL
-        DEPS: es ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_has_multiple:
-        PARAMS: GRAPH graph, OUT BOOLEANPTR res
-        NAME-R: has.multiple
-
-igraph_count_multiple:
-        PARAMS: GRAPH graph, OUT VECTOR res, EDGESET es=ALL
-        DEPS: es ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_girth:
-        PARAMS: GRAPH graph, OUT INTEGERPTR girth, OUT VERTEXSET circle
-        IGNORE: RR, RC, RNamespace
-
-igraph_add_edge:
-        PARAMS: INOUT GRAPH graph, INTEGER from, INTEGER to
-        IGNORE: RR, RC, RNamespace
-
-igraph_eigenvector_centrality:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX vector, OUT REALPTR value, \
-                BOOLEAN directed=False, BOOLEAN scale=True, \
-                EDGEWEIGHTS weights=NULL, \
-                INOUT ARPACKOPT options=igraph.arpack.default
-        DEPS: weights ON graph, vector ON graph
-        DEFAULT-R: options=igraph.arpack.default
-        NAME-R: evcent
-
-igraph_hub_score:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX vector, OUT REALPTR value, \
-                BOOLEAN scale=True, EDGEWEIGHTS weights=NULL, \
-                INOUT ARPACKOPT options=igraph.arpack.default
-        DEFAULT-R: options=igraph.arpack.default
-        DEPS: weights ON graph, vector ON graph
-        NAME-R: hub.score
-
-igraph_authority_score:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX vector, OUT REALPTR value, \
-                BOOLEAN scale=True, EDGEWEIGHTS weights=NULL, \
-                INOUT ARPACKOPT options=igraph.arpack.default
-        DEFAULT-R: options=igraph.arpack.default
-        DEPS: weights ON graph, vector ON graph
-        NAME-R: authority.score
-
-igraph_arpack_rssolve:
-        PARAMS: ARPFUNC fun, EXTRA extra, INOUT ARPACKOPT options=igraph.arpack.default, \
-                NULL storage, OUT VECTOR_OR_0 values, \
-                OUT MATRIX_OR_0 vectors
-        DEFAULT-R: options=igraph.arpack.default
-        IGNORE: RR, RC, RNamespace
-
-igraph_arpack_rnsolve:
-        PARAMS: ARPFUNC fun, EXTRA extra, INOUT ARPACKOPT options=igraph.arpack.default, \
-                NULL storage, OUT VECTOR_OR_0 values, \
-                OUT MATRIX_OR_0 vectors
-        DEFAULT-R: options=igraph.arpack.default
-        IGNORE: RR, RC, RNamespace
-
-igraph_arpack_unpack_complex:
-         PARAMS: INOUT MATRIX vectors, INOUT MATRIX values, REAL nev
-         NAME-R: arpack.unpack.complex
-
-igraph_unfold_tree:
-        PARAMS: GRAPH graph, OUT GRAPH tree, NEIMODE mode=ALL, VECTOR roots,\
-                OUT VECTORM1_OR_0 vertex_index
-        NAME-R: unfold.tree
-        IGNORE: RR
-
-igraph_is_mutual:
-        PARAMS: GRAPH graph, OUT VECTOR_BOOL res, EDGESET es=ALL
-        DEPS: es ON graph
-        NAME-R: is.mutual
-
-igraph_maximum_cardinality_search:
-        PARAMS: GRAPH graph, OUT VECTORM1 alpha, OUT VECTORM1_OR_0 alpham1
-        NAME-R: maximum.cardinality.search
-
-igraph_is_chordal:
-        PARAMS: GRAPH graph, VECTORM1_OR_0 alpha=NULL, VECTORM1_OR_0 alpham1=NULL, \
-                OUT BOOLEANPTR_OR_0 chordal, OUT VECTORM1_OR_0 fillin, \
-                OUT GRAPH_OR_0 newgraph
-        NAME-R: is.chordal
-        IGNORE: RR, RC
-
-igraph_avg_nearest_neighbor_degree:
-        PARAMS: GRAPH graph, VERTEXSET vids=ALL, OUT VERTEXINDEX_OR_0 knn, \
-                OUT VECTOR_OR_0 knnk, EDGEWEIGHTS weights=NULL
-        DEPS: vids ON graph, weights ON graph, knn ON graph vids
-        NAME-R: graph.knn
-
-igraph_strength:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX res, VERTEXSET vids=ALL, \
-                NEIMODE mode=ALL, BOOLEAN loops=True, EDGEWEIGHTS weights=NULL
-        DEPS: vids ON graph, weights ON graph, res ON graph vids
-
-igraph_centralization:
-        PARAMS: VECTOR scores, REAL theoretical_max=0, BOOLEAN normalized=True
-        RETURN: REAL
-        NAME-R: centralize.scores
-
-igraph_centralization_degree:
-        PARAMS: GRAPH graph, OUT VECTOR res, \
-                NEIMODE mode=ALL, BOOLEAN loops=True, \
-                OUT REALPTR centralization, OUT REALPTR theoretical_max, \
-                BOOLEAN normalized=True
-        NAME-R: centralization.degree
-
-igraph_centralization_degree_tmax:
-        PARAMS: GRAPH_OR_0 graph=NULL, INTEGER nodes=0, NEIMODE mode=ALL, \
-                BOOLEAN loops=False, OUT REALPTR res
-        NAME-R: centralization.degree.tmax
-
-igraph_centralization_betweenness:
-        PARAMS: GRAPH graph, OUT VECTOR res, \
-                BOOLEAN directed=True, BOOLEAN nobigint=True, \
-                OUT REALPTR centralization, \
-                OUT REALPTR theoretical_max, \
-                BOOLEAN normalized=True
-        NAME-R: centralization.betweenness
-
-igraph_centralization_betweenness_tmax:
-        PARAMS: GRAPH_OR_0 graph=NULL, INTEGER nodes=0, \
-                BOOLEAN directed=True, OUT REALPTR res
-        NAME-R: centralization.betweenness.tmax
-
-igraph_centralization_closeness:
-        PARAMS: GRAPH graph, OUT VECTOR res, \
-                NEIMODE mode=OUT, OUT REALPTR centralization, \
-                OUT REALPTR theoretical_max, \
-                BOOLEAN normalized=True
-        NAME-R: centralization.closeness
-
-igraph_centralization_closeness_tmax:
-        PARAMS: GRAPH_OR_0 graph=NULL, INTEGER nodes=0, \
-                BOOLEAN directed=True, OUT REALPTR res
-        NAME-R: centralization.closeness.tmax
-
-igraph_centralization_eigenvector_centrality:
-        PARAMS: GRAPH graph, OUT VECTOR vector, OUT REALPTR value, \
-                BOOLEAN directed=False, BOOLEAN scale=True, \
-                INOUT ARPACKOPT options=igraph.arpack.default, \
-                OUT REALPTR centralization, OUT REALPTR theoretical_max,\
-                BOOLEAN normalized=True
-        NAME-R: centralization.evcent
-
-igraph_centralization_eigenvector_centrality_tmax:
-        PARAMS: GRAPH_OR_0 graph=NULL, INTEGER nodes=0, \
-                BOOLEAN directed=False, BOOLEAN scale=True, \
-                OUT REALPTR res
-        NAME-R: centralization.evcent.tmax
-
-igraph_assortativity_nominal:
-        PARAMS: GRAPH graph, VECTORM1 types, OUT REALPTR res, \
-                BOOLEAN directed=True
-        NAME-R: assortativity.nominal
-
-igraph_assortativity:
-        PARAMS: GRAPH graph, VECTOR types1, VECTOR_OR_0 types2=NULL, \
-                OUT REALPTR res, BOOLEAN directed=True
-        NAME-R: assortativity
-
-igraph_assortativity_degree:
-        PARAMS: GRAPH graph, OUT REALPTR res, BOOLEAN directed=True
-        NAME-R: assortativity.degree
-
-igraph_contract_vertices:
-        PARAMS: INOUT GRAPH graph, VECTORM1 mapping, \
-                VERTEX_ATTRIBUTE_COMBINATION vertex_attr_comb=Default
-        NAME-R: contract.vertices
-
-igraph_eccentricity:
-        PARAMS: GRAPH graph, OUT VERTEXINDEX res, VERTEXSET vids=ALL, \
-                NEIMODE mode=ALL
-        DEPS: vids ON graph, res ON graph vids
-        NAME-R: eccentricity
-
-igraph_radius:
-        PARAMS: GRAPH graph, OUT REALPTR radius, NEIMODE mode=ALL
-        NAME-R: radius
-
-igraph_diversity:
-        PARAMS: GRAPH graph, EDGEWEIGHTS weights=NULL, OUT VERTEXINDEX res, \
-                VERTEXSET vids=ALL
-        DEPS: weights ON graph, vids ON graph, res ON graph vids
-
-#######################################
-# Degree sequences     
-#######################################
-
-igraph_is_degree_sequence:
-        PARAMS: VECTOR out_deg, VECTOR_OR_0 in_deg=NULL, OUT BOOLEANPTR res
-        NAME-R: is.degree.sequence
-
-igraph_is_graphical_degree_sequence:
-        PARAMS: VECTOR out_deg, VECTOR_OR_0 in_deg=NULL, OUT BOOLEANPTR res
-        NAME-R: is.graphical.degree.sequence
-
-#######################################
-# Visitors
-#######################################
-
-igraph_bfs:
-        PARAMS: GRAPH graph, INTEGER root, VECTOR_OR_0 roots, \
-                NEIMODE mode=OUT, BOOLEAN unreachable, \
-                VECTOR_OR_0 restricted, \
-                OUT VECTOR_OR_0 order, OUT VECTOR_OR_0 rank, \
-                OUT VECTOR_OR_0 father, \
-                OUT VECTOR_OR_0 pred, OUT VECTOR_OR_0 succ, \
-                OUT VECTOR_OR_0 dist, BFS_FUNC callback, NULL extra
-        IGNORE: RR, RC
-
-igraph_dfs:
-        PARAMS: GRAPH graph, INTEGER root, NEIMODE mode=OUT, \
-                BOOLEAN unreachable, \
-                OUT VECTOR_OR_0 order, OUT VECTOR_OR_0 order_out, \
-                OUT VECTOR_OR_0 dist, DFS_FUNC in_callback, \
-                DFS_FUNC out_callback, NULL extra
-        IGNORE: RR, RC
-
-#######################################
-# Bipartite graphs
-#######################################
-
-igraph_bipartite_projection_size:
-        PARAMS: GRAPH graph, BIPARTITE_TYPES types=NULL, \
-                OUT INTEGERPTR vcount1, OUT INTEGERPTR ecount1, \
-                OUT INTEGERPTR vcount2, OUT INTEGERPTR ecount2
-        DEPS: types ON graph
-        NAME-R: bipartite.projection.size
-
-igraph_bipartite_projection:
-        PARAMS: GRAPH graph, BIPARTITE_TYPES types=NULL, \
-                OUT GRAPH proj1, OUT GRAPH proj2, \
-                OUT VECTOR_OR_0 multiplicity1, \
-                OUT VECTOR_OR_0 multiplicity2, INTEGER probe1=-1
-        DEPS: types ON graph
-        NAME-R: bipartite.projection
-        IGNORE: RR
-
-igraph_create_bipartite:
-        PARAMS: OUT GRAPH graph, IN VECTOR_BOOL types, \
-                VECTORM1 edges, BOOLEAN directed=False
-        NAME-R: graph.bipartite
-        IGNORE: RR
-
-igraph_incidence:
-        PARAMS: OUT GRAPH graph, OUT VECTOR_BOOL types, MATRIX incidence, \
-                BOOLEAN directed=False, NEIMODE mode=ALL, \
-                BOOLEAN multiple=False
-        IGNORE: RR
-
-igraph_get_incidence:
-        PARAMS: GRAPH graph, BIPARTITE_TYPES types=NULL, OUT MATRIX res, \
-                OUT VECTOR_OR_0 row_ids, OUT VECTOR_OR_0 col_ids
-        DEPS: types ON graph
-        NAME-R: get.incidence
-        IGNORE: RR
-
-igraph_is_bipartite:
-        PARAMS: GRAPH graph, OUT BOOLEANPTR res, OUT VECTOR_BOOL_OR_0 type
-        NAME-R: bipartite.mapping
-
-#######################################
-# Spectral properties
-#######################################
-
-igraph_laplacian:
-        PARAMS: GRAPH graph, OUT MATRIX_OR_0 res, \
-                OUT SPARSEMAT_OR_0 sparseres, BOOLEAN normalized=False, \
-                EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        IGNORE: RR, RC
-
-#######################################
-# Components
-#######################################
-
-igraph_clusters:
-        PARAMS: GRAPH graph, OUT VECTOR membership, OUT VECTOR csize, \
-                OUT INTEGERPTR no, CONNECTEDNESS mode=WEAK
-        NAME-R: clusters
-        IGNORE: RR
-
-igraph_is_connected:
-        PARAMS: GRAPH graph, OUT BOOLEANPTR res, CONNECTEDNESS mode=WEAK
-        IGNORE: RR, RC, RNamespace
-
-igraph_decompose:
-        PARAMS: GRAPH graph, OUT GRAPHLIST components, CONNECTEDNESS mode=WEAK, \
-                LONGINT maxcompno=-1, LONGINT minelements=1
-        IGNORE: RR, RC, RNamespace
-
-igraph_articulation_points:
-        PARAMS: GRAPH graph, OUT VERTEXSET res
-        DEPS: res ON graph
-        NAME-R: articulation.points
-
-igraph_biconnected_components:
-        PARAMS: GRAPH graph, OUT INTEGERPTR no, \
-                OUT EDGESETLIST_OR_0 tree_edges, \
-                OUT EDGESETLIST_OR_0 component_edges, \
-                OUT VERTEXSETLIST_OR_0 components, \
-                OUT VERTEXSET articulation_points
-        DEPS: tree_edges ON graph, component_edges ON graph, \
-              components ON graph
-        NAME-R: biconnected.components
-
-#######################################
-# Cliques
-#######################################
-
-igraph_cliques:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res, INTEGER min_size=0, \
-                INTEGER max_size=0
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_largest_cliques:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_maximal_cliques:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_clique_number:
-        PARAMS: GRAPH graph, OUT INTEGERPTR no
-        IGNORE: RR, RC, RNamespace
-
-igraph_independent_vertex_sets:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res, INTEGER min_size=0, \
-                INTEGER max_size=0
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_largest_independent_vertex_sets:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_maximal_independent_vertex_sets:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST res
-        DEPS: res ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_independence_number:
-        PARAMS: GRAPH graph, OUT INTEGERPTR no
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Layouts
-#######################################
-
-igraph_layout_random:
-        PARAMS: GRAPH graph, OUT MATRIX res
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_circle:
-        PARAMS: GRAPH graph, OUT MATRIX res
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_star:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEX center=V(graph)[1], \
-                VECTORM1_OR_0 order=NULL
-        DEPS: center ON graph
-        NAME-R: layout.star
-
-igraph_layout_grid:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER width=0
-        NAME-R: layout.grid
-
-igraph_layout_grid_3d:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER width=0, INTEGER height=0
-        NAME-R: layout.grid.3d
-
-igraph_layout_fruchterman_reingold:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=500, \
-                REAL maxdelta=VCOUNT(graph), REAL area=VCOUNT(graph)^2, \
-                REAL coolexp=1.5, REAL repulserad=VCOUNT(graph)^3, \
-                NULL use_seed, VECTOR_OR_0 weight, \
-                VECTOR_OR_0 minx, VECTOR_OR_0 maxx, \
-                VECTOR_OR_0 miny, VECTOR_OR_0 maxy
-        NAME-R: layout.fruchterman.reingold
-        FLAGS: PROGRESS
-        IGNORE: RR, RC
-
-igraph_layout_grid_fruchterman_reingold:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=500, REAL maxdelta=VCOUNT(graph), \
-                REAL area=VCOUNT(graph)^2, REAL coolexp=1.5, REAL repulserad=VCOUNT(graph)^3, REAL cellsize=VCOUNT(graph), \
-                NULL use_seed, VECTOR_OR_0 weight
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_kamada_kawai:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=1000, \
-                REAL sigma=VCOUNT(graph)/4, REAL initemp=10, \
-                REAL coolexp=0.99, REAL kkconst=VCOUNT(graph)^2, \
-                VECTOR_OR_0 minx, VECTOR_OR_0 maxx, VECTOR_OR_0 miny, \
-                VECTOR_OR_0 maxy
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_lgl:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER maxiter=150, REAL maxdelta=VCOUNT(graph), \
-                REAL area=VCOUNT(graph)^2, REAL coolexp=1.5, REAL repulserad=VCOUNT(graph)^3, REAL cellsize=VCOUNT(graph), \
-                INTEGER root=-1
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_reingold_tilford:
-        PARAMS: GRAPH graph, OUT MATRIX res, NEIMODE mode=OUT, VECTOR roots
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_reingold_tilford_circular:
-        PARAMS: GRAPH graph, OUT MATRIX res, NEIMODE mode=OUT, VECTOR roots
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_random_3d:
-        PARAMS: GRAPH graph, OUT MATRIX res
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_sphere:
-        PARAMS: GRAPH graph, OUT MATRIX res
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_fruchterman_reingold_3d:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=500, \
-                REAL maxdelta=VCOUNT(graph), REAL volume=VCOUNT(graph)^2, \
-                REAL coolexp=1.5, REAL repulserad=VCOUNT(graph)^3, \
-                NULL use_seed, VECTOR_OR_0 weight, VECTOR_OR_0 minx, \
-                VECTOR_OR_0 maxx, VECTOR_OR_0 miny, VECTOR_OR_0 maxy, \
-                VECTOR_OR_0 minz, VECTOR_OR_0 maxz
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_kamada_kawai_3d:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=1000, \
-                REAL sigma=VCOUNT(graph)/4, REAL initemp=10, \
-                REAL coolexp=0.99, REAL kkconst=VCOUNT(graph)^2, \
-                BOOLEAN fixz, VECTOR_OR_0 minx, VECTOR_OR_0 maxx, \
-                VECTOR_OR_0 miny, VECTOR_OR_0 maxy, VECTOR_OR_0 minz, \
-                VECTOR_OR_0 maxz
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_graphopt:
-        PARAMS: GRAPH graph, OUT MATRIX res, INTEGER niter=500, \
-                REAL node_charge=0.001, REAL node_mass=30, \
-                INTEGER spring_length=0, REAL spring_constant=1, \
-                REAL max_sa_movement=5, NULL use_seed
-        NAME-R: layout.graphopt
-        FLAGS: PROGRESS
-        IGNORE: RR, RC
-
-igraph_layout_drl:
-        PARAMS: GRAPH graph, INOUT MATRIX res, BOOLEAN use_seed=False, \
-                DRL_OPTIONS options=igraph.drl.default, VECTOR_OR_0 weights=NULL, \
-                VECTOR_BOOL_OR_0 fixed=NULL
-        DEFAULT-R: options=igraph.drl.default
-        NAME-R: layout.drl
-        IGNORE: RR
-
-igraph_layout_drl_3d:
-        PARAMS: GRAPH graph, INOUT MATRIX res, BOOLEAN use_seed=False, \
-                DRL_OPTIONS options=igraph.drl.default, VECTOR_OR_0 weights=NULL, \
-                VECTOR_BOOL_OR_0 fixed=NULL
-        DEFAULT-R: options=igraph.drl.default
-        NAME-R: layout.drl
-        IGNORE: RR
-
-igraph_layout_merge_dla:
-        PARAMS: GRAPHLIST graphs, MATRIXLIST coords, OUT MATRIX res
-        IGNORE: RR, RC, RNamespace
-
-igraph_layout_sugiyama:
-        PARAMS: GRAPH graph, OUT MATRIX res, OUT GRAPH_OR_0 extd_graph, \
-                OUT VECTORM1_OR_0 extd_to_orig_eids, \
-                VECTORM1_OR_0 layers=NULL, \
-                REAL hgap=1, REAL vgap=1, INTEGER maxiter=100, \
-                EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        NAME-R: layout.sugiyama
-        IGNORE: RR
-
-igraph_layout_mds:
-        PARAMS: GRAPH graph, OUT MATRIX res, MATRIX_OR_0 dist=NULL, \
-                INTEGER dim=2, NULL options
-        IGNORE: RR
-        NAME-R: layout.mds
-
-#######################################
-# Cocitation and other similarity measures
-#######################################
-
-igraph_cocitation:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET vids=ALL
-        IGNORE: RR, RC, RNamespace
-
-igraph_bibcoupling:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET vids=ALL
-        IGNORE: RR, RC, RNamespace
-
-igraph_similarity_jaccard:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET vids=ALL, NEIMODE mode=ALL, \
-                BOOLEAN loops=False
-        DEPS: vids ON graph res, mode ON vids
-        NAME-R: similarity.jaccard
-
-igraph_similarity_dice:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET vids=ALL, NEIMODE mode=ALL, \
-                BOOLEAN loops=False
-        DEPS: vids ON graph
-        NAME-R: similarity.dice
-
-igraph_similarity_inverse_log_weighted:
-        PARAMS: GRAPH graph, OUT MATRIX res, VERTEXSET vids=ALL, NEIMODE mode=ALL
-        DEPS: vids ON graph
-        NAME-R: similarity.invlogweighted
-
-#######################################
-# Community structure
-#######################################
-
-igraph_compare_communities:
-        PARAMS: VECTOR comm1, VECTOR comm2, OUT REALPTR res, \
-                COMMCMP method=VI
-        IGNORE: RR, RNamespace
-
-igraph_community_spinglass:
-        PARAMS: GRAPH graph, VECTOR_OR_0 weights, OUT REALPTR modularity,  \
-                OUT REALPTR temperature, OUT VECTOR membership, OUT VECTOR csize, \
-                INTEGER spins=25, BOOLEAN parupdate=False, REAL starttemp=1, REAL stoptemp=0.01, \
-                REAL coolfact=0.99, SPINCOMMUPDATE update_rule=CONFIG, REAL gamma=1.0, \
-                REAL gamma_minus=0, REAL d_p=0, REAL d_n=0
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_spinglass_single:
-        PARAMS: GRAPH graph, VECTOR_OR_0 weights, INTEGER vertex, OUT VECTOR community, \
-                OUT REALPTR cohesion, OUT REALPTR adhesion, \
-                OUT INTEGERPTR inner_links, OUT INTEGERPTR outer_links, \
-                INTEGER spins=25, SPINCOMMUPDATE update_rule=CONFIG, REAL gamma=1.0
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_walktrap:
-        PARAMS: GRAPH graph, VECTOR weights, INT steps=4, OUT MATRIX merges, \
-                OUT VECTOR modularity, OUT VECTOR membership
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_edge_betweenness:
-        PARAMS: GRAPH graph, OUT VECTOR result, OUT VECTOR edge_betweenness, \
-                OUT MATRIX merges, OUT VECTOR bridges, \
-                OUT VECTOR_OR_0 modularity, OUT VECTOR_OR_0 membership, \
-                BOOLEAN directed=True, EDGEWEIGHTS weights=NULL
-        DEPS: weights ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_eb_get_merges:
-        PARAMS: GRAPH graph, VECTOR edges, EDGEWEIGHTS weights=NULL, \
-                OUT MATRIX merges, OUT VECTOR bridges, \
-                OUT VECTOR_OR_0 modularity, OUT VECTOR_OR_0 membership
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_fastgreedy:
-        PARAMS: GRAPH graph, VECTOR_OR_0 weights, OUT MATRIX merges, OUT VECTOR modularity, OUT VECTOR_OR_0 membership
-        IGNORE: RR, RC, RNamespace
-
-igraph_community_to_membership:
-        PARAMS: GRAPH graph, MATRIX merges, INTEGER steps, \
-                OUT VECTOR membership, OUT VECTOR csize
-        IGNORE: RR, RC, RNamespace
-
-igraph_le_community_to_membership:
-        PARAMS: MATRIX merges, INTEGER steps, INOUT VECTOR membership, \
-                OUT VECTOR_OR_0 csize
-        NAME-R: community.le.to.membership
-
-igraph_modularity:
-        PARAMS: GRAPH graph, VECTOR membership, OUT REALPTR modularity, \
-                IN VECTOR_OR_0 weights=NULL
-        NAME-R: modularity.igraph
-        IGNORE: RNamespace, RR
-
-igraph_reindex_membership:
-        PARAMS: INOUT VECTOR membership, OUT VECTOR_OR_0 new_to_old
-        NAME-R: reindex.membership
-        IGNORE: RNamespace
-
-igraph_community_leading_eigenvector:
-        PARAMS: GRAPH graph, OUT MATRIX merges, OUT VECTOR membership, \
-                INTEGER steps=-1, \
-                INOUT ARPACKOPT options=igraph.arpack.default, \
-                OUT REALPTR modularity, BOOLEAN start=False, \
-                OUT VECTOR_OR_0 eigenvalues, \
-                OUT VECTOR_OR_0 eigenvectors, \
-                OUT VECTOR_OR_0 history, \
-                LEVCFUNC callback, EXTRA callback_extra
-        DEFAULT-R: options=igraph.arpack.default
-        CLASS-R: igraph.eigenc
-        NAME-R: leading.eigenvector.community
-        IGNORE: RR, RC
-
-igraph_community_label_propagation:
-        PARAMS: GRAPH graph, OUT VECTOR membership, EDGEWEIGHTS weights=NULL, \
-                VECTOR_OR_0 initial=NULL, VECTOR_BOOL_OR_0 fixed=NULL, \
-                OUT REALPTR modularity
-        DEPS: weights ON graph
-        NAME-R: label.propagation.community
-        IGNORE: RR
-
-igraph_community_multilevel:
-        PARAMS: GRAPH graph, EDGEWEIGHTS weights=NULL, \
-                OUT VECTOR membership, \
-		OUT MATRIX_OR_0 memberships, OUT VECTOR_OR_0 modularity
-        DEPS: weights ON graph
-        NAME-R: multilevel.community
-        IGNORE: RR
-
-igraph_community_optimal_modularity:
-        PARAMS: GRAPH graph, OUT REALPTR modularity, \
-                OUT VECTOR_OR_0 membership, \
-                BOOLEAN verbose
-        NAME-R: optimal.community
-        IGNORE: RR
-
-igraph_split_join_distance:
-        PARAMS: VECTOR comm1, VECTOR comm2, OUT INTEGERPTR distance12, \
-		        OUT INTEGERPTR distance21
-        NAME-R: split.join.distance
-        IGNORE: RR, RC, RNamespace
-
-igraph_hrg_fit:
-        PARAMS: GRAPH graph, INOUT HRG hrg=Default, BOOLEAN start=False, \
-                INT steps=0
-        NAME-R: hrg.fit
-        CLASS-R: igraphHRG
-        IGNORE: RR
-
-igraph_hrg_game:
-        PARAMS: OUT GRAPH graph, HRG hrg
-        NAME-R: hrg.game
-        GATTR-R: name IS Hierarchical random graph model
-
-igraph_hrg_dendrogram:
-        PARAMS: OUT GRAPH graph, HRG hrg
-        NAME-R: hrg.dendrogram
-
-igraph_hrg_consensus:
-        PARAMS: GRAPH graph, OUT VECTOR parents, OUT VECTOR weights, \
-                INOUT HRG hrg=Default, BOOLEAN start=False, \
-                INT num_samples=10000
-        NAME-R: hrg.consensus
-
-igraph_hrg_predict:
-        PARAMS: GRAPH graph, OUT VERTEXSET edges, OUT VECTOR prob, \
-                INOUT HRG hrg=Default, BOOLEAN start=False, \
-                INT num_samples=10000, INT num_bins=25
-        NAME-R: hrg.predict
-        IGNORE: RR
-
-igraph_hrg_create:
-        PARAMS: OUT HRG hrg, GRAPH graph, VECTOR prob
-        NAME-R: hrg.create
-        DEPS: prob ON graph
-        CLASS-R: igraphHRG
-
-igraph_community_infomap:
-        PARAMS: GRAPH graph, EDGEWEIGHTS e_weights=NULL, \
-                VERTEXWEIGHTS v_weights=NULL, INT nb_trials=10, \
-                OUT VECTOR membership, OUT REALPTR codelength
-        NAME-R: infomap.community
-        DEPS: e_weights ON graph, v_weights ON graph
-        IGNORE: RR
-
-#######################################
-# Conversion
-#######################################
-
-igraph_get_adjacency:
-        PARAMS: GRAPH graph, OUT MATRIX res, GETADJACENCY type=BOTH, \
-                BOOLEAN eids=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_get_edgelist:
-        PARAMS: GRAPH graph, OUT VECTOR res, BOOLEAN bycol=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_to_directed:
-        PARAMS: INOUT GRAPH graph, TODIRECTED flags=MUTUAL
-        IGNORE: RR, RC, RNamespace
-
-igraph_to_undirected:
-        PARAMS: INOUT GRAPH graph, TOUNDIRECTED mode=COLLAPSE, \
-                EDGE_ATTRIBUTE_COMBINATION edge_attr_comb=Default
-        NAME-R: as.undirected
-
-igraph_get_stochastic:
-        PARAMS: GRAPH graph, OUT MATRIX res, BOOLEAN column_wise=False
-        NAME-R: get.stochastic
-        IGNORE: RR
-
-igraph_get_stochastic_sparsemat:
-        PARAMS: GRAPH graph, OUT SPARSEMAT sparsemat, \
-                BOOLEAN column_wise=False
-        IGNORE: RR, RNamespace
-
-#######################################
-# Read and write foreign formats
-#######################################
-
-igraph_read_graph_edgelist:
-        PARAMS: OUT GRAPH graph, INFILE instream, INTEGER n=0, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_ncol:
-        PARAMS: OUT GRAPH graph, INFILE instream, STRVECTOR_OR_0 predefnames, \
-                BOOLEAN names=True, ADD_WEIGHTS weights=True, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_lgl:
-        PARAMS: OUT GRAPH graph, INFILE instream, BOOLEAN names=True, \
-                ADD_WEIGHTS weights=True, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_pajek:
-        PARAMS: OUT GRAPH graph, INFILE instream
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_graphml:
-        PARAMS: OUT GRAPH graph, INFILE instream, INT index=0
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_dimacs:
-        PARAMS: OUT GRAPH graph, INFILE instream, OUT INTEGERPTR source, \
-                OUT INTEGERPTR target, OUT VECTOR capacity, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_graphdb:
-        PARAMS: OUT GRAPH graph, INFILE instream, BOOLEAN directed=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_gml:
-        PARAMS: OUT GRAPH graph, INFILE instream
-        IGNORE: RR, RC, RNamespace
-
-igraph_read_graph_dl:
-        PARAMS: OUT GRAPH graph, INFILE instream, BOOLEAN directed=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_edgelist:
-        PARAMS: GRAPH graph, OUTFILE outstream
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_ncol:
-        PARAMS: GRAPH graph, OUTFILE outstream, CSTRING names="name", CSTRING weights="weight"
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_lgl:
-        PARAMS: GRAPH graph, OUTFILE outstream, CSTRING names="name", CSTRING weights="weight", \
-                BOOLEAN isolates=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_leda:
-        PARAMS: GRAPH graph, OUTFILE outstream, CSTRING names="name", CSTRING weights="weight"
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_graphml:
-        PARAMS: GRAPH graph, OUTFILE outstream
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_pajek:
-        PARAMS: GRAPH graph, OUTFILE outstream
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_dimacs:
-        PARAMS: GRAPH graph, OUTFILE outstream, LONGINT source=0, LONGINT target=0, \
-                VECTOR capacity
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_gml:
-        PARAMS: GRAPH graph, OUTFILE outstream, VECTOR id, CSTRING creator="igraph"
-        IGNORE: RR, RC, RNamespace
-
-igraph_write_graph_dot:
-        PARAMS: GRAPH graph, OUTFILE outstream
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Motifs
-#######################################
-
-igraph_motifs_randesu:
-        PARAMS: GRAPH graph, OUT VECTOR hist, INT size=3, VECTOR cut_prob
-        IGNORE: RR, RC, RNamespace
-
-igraph_motifs_randesu_estimate:
-        PARAMS: GRAPH graph, OUT INTEGERPTR est, INT size=3, VECTOR cut_prob, \
-                INTEGER sample_size, VECTOR_OR_0 sample
-        IGNORE: RR, RC, RNamespace
-
-igraph_motifs_randesu_no:
-        PARAMS: GRAPH graph, OUT INTEGERPTR no, INT size=3, VECTOR cut_prob
-        IGNORE: RR, RC, RNamespace
-
-igraph_dyad_census:
-        PARAMS: GRAPH graph, OUT INTEGERPTR mut, OUT INTEGERPTR asym, OUT INTEGERPTR null
-        NAME-R: dyad.census
-        RETURN: ERROR
-
-igraph_triad_census:
-        PARAMS: GRAPH graph, OUT VECTOR res
-        NAME-R: triad.census
-        RETURN: ERROR
-
-#######################################
-# Graph operators
-#######################################
-
-igraph_disjoint_union:
-        PARAMS: OUT GRAPH res, GRAPH left, GRAPH right
-        IGNORE: RR, RC, RNamespace
-
-igraph_disjoint_union_many:
-        PARAMS: OUT GRAPH res, GRAPHLIST graphs
-        IGNORE: RR, RC, RNamespace
-
-igraph_union:
-        PARAMS: OUT GRAPH res, GRAPH left, GRAPH right
-        IGNORE: RR, RC, RNamespace
-
-igraph_union_many:
-        PARAMS: OUT GRAPH res, GRAPHLIST graphs
-        IGNORE: RR, RC, RNamespace
-
-igraph_intersection:
-        PARAMS: OUT GRAPH res, GRAPH left, GRAPH right
-        IGNORE: RR, RC, RNamespace
-
-igraph_intersection_many:
-        PARAMS: OUT GRAPH res, GRAPHLIST graphs
-        IGNORE: RR, RC, RNamespace
-
-igraph_difference:
-        PARAMS: OUT GRAPH res, GRAPH orig, GRAPH sub
-        IGNORE: RR, RC, RNamespace
-
-igraph_complementer:
-        PARAMS: OUT GRAPH res, GRAPH graph, BOOLEAN loops=False
-        IGNORE: RR, RC, RNamespace
-
-igraph_compose:
-        PARAMS: OUT GRAPH res, GRAPH g1, GRAPH g2
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Maximum flows, minimum cuts
-#######################################
-
-igraph_maxflow:
-        PARAMS: GRAPH graph, OUT REALPTR value, OUT VECTOR_OR_0 flow, \
-                OUT VECTORM1_OR_0 cut, OUT VECTORM1_OR_0 partition1, \
-                OUT VECTORM1_OR_0 partition2, VERTEX source, VERTEX target, \
-                EDGECAPACITY capacity=NULL
-        DEPS: capacity ON graph, source ON graph, target ON graph
-
-igraph_maxflow_value:
-        PARAMS: GRAPH graph, OUT REALPTR value, VERTEX source, VERTEX target, \
-                VECTOR_OR_0 capacity
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_mincut_value:
-        PARAMS: GRAPH graph, OUT REALPTR res, VECTOR_OR_0 capacity
-        IGNORE: RR, RC, RNamespace
-
-igraph_st_mincut_value:
-        PARAMS: GRAPH graph, OUT REALPTR res, VERTEX source, VERTEX target, \
-                VECTOR_OR_0 capacity
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_mincut:
-        PARAMS: GRAPH graph, OUT REALPTR value, OUT VECTORM1 partition1, \
-                OUT VECTORM1 partition2, OUT VECTORM1 cut, VECTOR_OR_0 capacity
-        IGNORE: RR, RC, RNamespace
-
-igraph_st_vertex_connectivity:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, VERTEX source, VERTEX target, \
-                VCONNNEI neighbors=NUMBER_OF_NODES
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_vertex_connectivity:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, BOOLEAN checks=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_st_edge_connectivity:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, VERTEX source, VERTEX target
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_edge_connectivity:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, BOOLEAN checks=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_edge_disjoint_paths:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, VERTEX source, VERTEX target
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_vertex_disjoint_paths:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, VERTEX source, VERTEX target
-        DEPS: source ON graph, target ON graph
-        IGNORE: RR, RC, RNamespace
-
-igraph_adhesion:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, BOOLEAN checks=True
-        IGNORE: RR, RC, RNamespace
-
-igraph_cohesion:
-        PARAMS: GRAPH graph, OUT INTEGERPTR res, BOOLEAN checks=True
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Listing s-t cuts, separators
-#######################################
-
-igraph_dominator_tree: 
-        PARAMS: GRAPH graph, VERTEX root, OUT VERTEXSET dom, \
-                OUT GRAPH_OR_0 domtree, OUT VERTEXSET leftout, \
-                INOUTMODE mode=OUT
-        DEPS: root ON graph
-        NAME-R: dominator.tree
-
-igraph_all_st_cuts:
-        PARAMS: GRAPH graph, OUT EDGESETLIST_OR_0 cuts, \
-                OUT VERTEXSETLIST_OR_0 partition1s, \
-                VERTEX source, VERTEX target
-        DEPS: source ON graph, target ON graph, cuts ON graph, \
-              partition1s ON graph
-        NAME-R: stCuts
-
-igraph_all_st_mincuts:
-        PARAMS: GRAPH graph, OUT REALPTR value, \
-                OUT EDGESETLIST_OR_0 cuts, \
-                OUT VERTEXSETLIST_OR_0 partition1s, \
-                VERTEX source, VERTEX target, EDGEWEIGHTS capacity=NULL
-        DEPS: capacity ON graph, source ON graph, target ON graph, \
-              cuts ON graph, partition1s ON graph
-        NAME-R: stMincuts
-
-igraph_is_separator:
-        PARAMS: GRAPH graph, VERTEXSET candidate, OUT BOOLEANPTR res
-        DEPS: candidate ON graph
-        NAME-R: is.separator
-
-igraph_is_minimal_separator:
-        PARAMS: GRAPH graph, VERTEXSET candidate, OUT BOOLEANPTR res
-        DEPS: candidate ON graph
-        NAME-R: is.minimal.separator
-
-igraph_all_minimal_st_separators:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST separators
-        DEPS: separators ON graph
-        NAME-R: minimal.st.separators
-
-igraph_minimum_size_separators:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST separators
-        DEPS: separators ON graph
-        NAME-R: minimum.size.separators
-
-igraph_cohesive_blocks:
-        PARAMS: GRAPH graph, OUT VERTEXSETLIST blocks, \
-                OUT VECTOR cohesion, OUT VECTORM1 parent, \
-                OUT GRAPH blockTree
-        DEPS: blocks ON graph
-        NAME-R: cohesive.blocks
-        CLASS-R: cohesiveBlocks
-        IGNORE: RR, RC
-
-#######################################
-# K-Cores
-#######################################
-
-igraph_coreness:
-        PARAMS: GRAPH graph, OUT VECTOR cores, NEIMODE mode=ALL
-        IGNORE: RR, RC, RNamespace
-
-#######################################
-# Graph isomorphism
-#######################################
-
-igraph_isoclass:
-        PARAMS: GRAPH graph, OUT INTEGERPTR isoclass
-
-igraph_isomorphic:
-        PARAMS: GRAPH graph1, GRAPH graph2, OUT BOOLEANPTR iso
-
-igraph_isoclass_subgraph:
-        PARAMS: GRAPH graph, VECTOR vids, OUT INTEGERPTR isoclass
-        DEPS: vids ON graph
-        IGNORE: RR
-
-igraph_isoclass_create:
-        PARAMS: OUT GRAPH graph, INTEGER size, INTEGER number, BOOLEAN directed=True
-        NAME-R: graph.isocreate
-
-igraph_isomorphic_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT BOOLEANPTR iso, \
-                OUT VECTORM1_OR_0 map12, OUT VECTORM1_OR_0 map21, \
-                NULL node_compat_fn, NULL edge_compat_fn, \
-                NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_count_isomorphisms_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT INTEGERPTR count, NULL node_compat_fn, \
-                NULL edge_compat_fn, NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_get_isomorphisms_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT VECTORLIST maps, NULL node_compat_fn, \
-                NULL edge_compat_fn, NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_subisomorphic_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT BOOLEANPTR iso, \
-                OUT VECTORM1_OR_0 map12, OUT VECTORM1_OR_0 map21, \
-                NULL node_compat_fn, NULL edge_compat_fn, \
-                NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_count_subisomorphisms_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT INTEGERPTR count, NULL node_compat_fn, \
-                NULL edge_compat_fn, NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_get_subisomorphisms_vf2:
-        PARAMS: GRAPH graph1, GRAPH graph2, \
-                VERTEX_COLOR vertex_color1, VERTEX_COLOR vertex_color2, \
-                EDGE_COLOR edge_color1, EDGE_COLOR edge_color2, \
-                OUT VECTORLIST maps, NULL node_compat_fn, \
-                NULL edge_compat_fn, NULL extra
-        DEPS: vertex_color1 ON graph1, vertex_color2 ON graph2, \
-              edge_color1 ON graph1, edge_color2 ON graph2
-
-igraph_isomorphic_34:
-        PARAMS: GRAPH graph1, GRAPH graph2, OUT BOOLEANPTR iso
-
-igraph_canonical_permutation:
-        PARAMS: GRAPH graph, OUT VECTORM1 labeling, BLISSSH sh="fm", OUT BLISSINFO info
-        NAME-R: canonical.permutation
-
-igraph_permute_vertices:
-        PARAMS: GRAPH graph, OUT GRAPH res, VECTORM1 permutation
-        NAME-R: permute.vertices
-
-igraph_isomorphic_bliss:
-        PARAMS: GRAPH graph1, GRAPH graph2, OUT BOOLEANPTR iso, \
-                OUT VECTORM1_OR_0 map12, OUT VECTORM1_OR_0 map21, \
-                BLISSSH sh1="fm", BLISSSH sh2="fm", OUT BLISSINFO info1, \
-                OUT BLISSINFO info2
-
-igraph_automorphisms:
-        PARAMS: GRAPH graph, BLISSSH sh="fm", OUT BLISSINFO info
-
-#######################################
-# SCG
-#######################################
-
-igraph_scg_grouping:
-        PARAMS: MATRIX V, OUT VECTORM1 groups, INTEGER nt, \
-                VECTOR_OR_0 nt_vec, SCGMAT mtype=Default, \
-                SCGALGO algo=Default, VECTOR_OR_0 p=NULL, \
-		INTEGER maxiter=100
-        NAME-R: scgGrouping
-        IGNORE: RR
-
-igraph_scg_semiprojectors:
-        PARAMS: VECTORM1 groups, SCGMAT mtype=Default, \
-                OUT MATRIX_OR_0 L, OUT MATRIX_OR_0 R, \
-                OUT SPARSEMAT_OR_0 Lsparse, OUT SPARSEMAT_OR_0 Rsparse, \
-                VECTOR_OR_0 p=NULL, SCGNORM norm=Default
-        NAME-R: scgSemiProjectors
-        IGNORE: RR, RC
-
-igraph_scg_norm_eps:
-        PARAMS: MATRIX V, VECTORM1 groups, OUT VECTOR eps, \
-                SCGMAT mtype=Default, VECTOR_OR_0 p=NULL, \
-                SCGNORM norm=Default
-        NAME-R: scgNormEps
-
-igraph_scg_adjacency:
-        PARAMS: GRAPH_OR_0 graph, MATRIX_OR_0 matrix, \
-                SPARSEMAT_OR_0 sparsemat, VECTOR ev, \
-                INTEGER nt, VECTOR_OR_0 ntvec, \
-                SCGALGO algo, INOUT VECTOR_OR_0 values, \
-                INOUT MATRIX_OR_0 vectors, INOUT VECTORM1_OR_0 groups, \
-                BOOLEAN use_arpack=False, INTEGER maxiter, \
-                OUT GRAPH_OR_0 scg_graph, OUT MATRIX_OR_0 scg_matrix, \
-                OUT SPARSEMAT_OR_0 scg_sparsemat, OUT MATRIX_OR_0 L, \
-                OUT MATRIX_OR_0 R, OUT SPARSEMAT_OR_0 Lsparse, \
-                OUT SPARSEMAT_OR_0 Rsparse
-        IGNORE: RR, RC, RNamespace
-
-igraph_scg_stochastic:
-        PARAMS: GRAPH_OR_0 graph, MATRIX_OR_0 matrix, \
-                SPARSEMAT_OR_0 sparsemat, VECTOR ev, \
-                INTEGER nt, VECTOR_OR_0 nt_vec, \
-                SCGALGO algo, SCGNORM norm=Default, \
-                INOUT CVECTOR_OR_0 values, INOUT CMATRIX_OR_0 vectors, \
-                INOUT VECTORM1_OR_0 groups, INOUT VECTOR_OR_0 p, \
-                BOOLEAN use_arpack=False, INTEGER maxiter, \
-                OUT GRAPH_OR_0 scg_graph, OUT MATRIX_OR_0 scg_matrix, \
-                OUT SPARSEMAT_OR_0 scg_sparsemat, OUT MATRIX_OR_0 L, \
-                OUT MATRIX_OR_0 R, OUT SPARSEMAT_OR_0 Lsparse, \
-                OUT SPARSEMAT_OR_0 Rsparse
-        IGNORE: RR, RC, RNamespace
-
-igraph_scg_laplacian:
-        PARAMS: GRAPH_OR_0 graph, MATRIX_OR_0 matrix, \
-                SPARSEMAT_OR_0 sparsemat, VECTOR ev, \
-                INTEGER nt, VECTOR_OR_0 nt_vec, \
-                SCGALGO algo, SCGNORM norm=Default, \
-                SCGDIR direction=Default, INOUT CVECTOR_OR_0 values, \
-                INOUT CMATRIX_OR_0 vectors, INOUT VECTORM1_OR_0 groups, \
-                BOOLEAN use_arpack=False, INTEGER maxiter, \
-                OUT GRAPH_OR_0 scg_graph, OUT MATRIX_OR_0 scg_matrix, \
-                OUT SPARSEMAT_OR_0 scg_sparsemat, OUT MATRIX_OR_0 L, \
-                OUT MATRIX_OR_0 R, OUT SPARSEMAT_OR_0 Lsparse, \
-                OUT SPARSEMAT_OR_0 Rsparse
-        IGNORE: RR, RC, RNamespace
-
-
-#######################################
-# Matching
-#######################################
-
-igraph_is_matching:
-       PARAMS: GRAPH graph, BIPARTITE_TYPES_OR_0 types=NULL, \
-               VECTOR_LONG_M1 matching, OUT BOOLEANPTR res
-       DEPS: types ON graph, matching ON graph
-       NAME-R: is.matching
-       IGNORE: RR
-
-igraph_is_maximal_matching:
-       PARAMS: GRAPH graph, BIPARTITE_TYPES_OR_0 types=NULL, \
-               VECTOR_LONG_M1 matching, OUT BOOLEANPTR res
-       DEPS: types ON graph
-       NAME-R: is.maximal.matching
-       IGNORE: RR
-
-igraph_maximum_bipartite_matching:
-       PARAMS: GRAPH graph, BIPARTITE_TYPES_OR_0 types=NULL, \
-               OUT INTEGERPTR_OR_0 matching_size, \
-               OUT REALPTR_OR_0 matching_weight, \
-               OUT VECTOR_LONG_M1 matching, \
-               EDGEWEIGHTS weights=NULL, REAL eps=.Machine$double.eps
-       DEPS: types ON graph, weights ON graph
-       NAME-R: maximum.bipartite.matching
-       IGNORE: RR
-
-#######################################
-# Fitting power laws
-#######################################
-
-igraph_power_law_fit:
-       PARAMS: VECTOR data, OUT PLFIT res, REAL xmin=-1, \
-               BOOLEAN force_continuous=False
-       NAME-R: power.law.fit.new
-       IGNORE: RNamespace
-
-#######################################
-# Other, not graph related
-#######################################
-
-igraph_running_mean:
-        PARAMS: VECTOR data, OUT VECTOR res, INTEGER binwidth
-        IGNORE: RR, RC, RNamespace
-
-igraph_random_sample:
-        PARAMS: OUT VECTOR res, INTEGER l, INTEGER h, INTEGER length
-        IGNORE: RR, RC, RNamespace
-
-igraph_convex_hull:
-        PARAMS: MATRIX data, OUT VECTOR resverts, OUT MATRIX rescoords
-        NAME-R: convex.hull
-
-#######################################
-# (R)evolver
-#######################################
-
-igraph_revolver_ml_d:
-        PARAMS: GRAPH graph, INTEGER niter, OUT VECTOR kernel, \
-                OUT VECTOR_OR_0 cites, REAL delta=1e-10, VECTOR_OR_0 filter=NULL, \
-                OUT REALPTR logprob, OUT REALPTR logmax
-        NAME-R: revolver.ml.d
-        FLAGS: PROGRESS
-
-igraph_revolver_probs_d:
-        PARAMS: GRAPH graph, VECTOR kernel, OUT VECTOR_OR_0 probs, \
-                OUT VECTOR_OR_0 citedprobs, OUT VECTOR_OR_0 citingprobs, \
-                BOOLEAN ntk=False
-        NAME-R: revolver.probs.d
-
-igraph_revolver_ml_de:
-        PARAMS: GRAPH graph, INTEGER niter, OUT MATRIX kernel, \
-                VECTOR cats, OUT MATRIX_OR_0 cites, REAL delta=1e-10, \
-                VECTOR_OR_0 filter=NULL, \
-                OUT REALPTR logprob, OUT REALPTR logmax
-        NAME-R: revolver.ml.de
-        FLAGS: PROGRESS
-
-igraph_revolver_probs_de:
-        PARAMS: GRAPH graph, MATRIX kernel, VECTOR cats, OUT VECTOR_OR_0 logprobs, \
-                OUT VECTOR_OR_0 logcited, OUT VECTOR_OR_0 logciting
-        NAME-R: revolver.probs.de
-
-igraph_revolver_ml_ade:
-        PARAMS: GRAPH graph, INTEGER niter, OUT ARRAY3 kernel, \
-                VECTOR cats, OUT ARRAY3_OR_0 cites, INTEGER agebins=300, \
-                REAL delta=1e-10, VECTOR_OR_0 filter=NULL, \
-                OUT REALPTR logprob, OUT REALPTR logmax
-        NAME-R: revolver.ml.ade
-        FLAGS: PROGRESS
-
-igraph_revolver_probs_ade:
-        PARAMS: GRAPH graph, ARRAY3 kernel, VECTOR cats, OUT VECTOR_OR_0 logprobs, \
-                OUT VECTOR_OR_0 logcited, OUT VECTOR_OR_0 logciting
-        NAME-R: revolver.probs.ade
-
-igraph_revolver_ml_f:
-        PARAMS: GRAPH graph, INTEGER niter, OUT VECTOR kernel, \
-                OUT VECTOR_OR_0 cites, REAL delta=1e-10, OUT REALPTR logprob, \
-                OUT REALPTR logmax
-        NAME-R: revolver.ml.f
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_df:
-        PARAMS: GRAPH graph, INTEGER niter, OUT MATRIX kernel, \
-                OUT MATRIX_OR_0 cites, REAL delta=1e-10, OUT REALPTR logprob, \
-                OUT REALPTR logmax
-        NAME-R: revolver.ml.df
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_l:
-        PARAMS: GRAPH graph, INTEGER niter, OUT VECTOR kernel, \
-                OUT VECTOR_OR_0 cites, INTEGER agebins=300, REAL delta=1e-10, \
-                OUT REALPTR logprob, OUT REALPTR logmax
-        NAME-R: revolver.ml.l
-
-igraph_revolver_ml_ad:
-        PARAMS: GRAPH graph, INTEGER niter, OUT MATRIX kernel, \
-                OUT MATRIX_OR_0 cites, INTEGER agebins=300, \
-                REAL delta=1e-10, VECTOR_OR_0 filter=NULL, \
-                OUT REALPTR logprob, OUT REALPTR logmax
-        NAME-R: revolver.ml.ad
-        FLAGS: PROGRESS
-
-igraph_revolver_probs_ad:
-        PARAMS: GRAPH graph, MATRIX kernel, OUT VECTOR_OR_0 probs, \
-                OUT VECTOR_OR_0 citedprobs, OUT VECTOR_OR_0 citingprobs, \
-                BOOLEAN ntk=False
-        NAME-R: revolver.probs.ad
-
-igraph_revolver_ml_D_alpha:
-        PARAMS: GRAPH graph, INOUT REALPTR alpha, OUT REALPTR Fmin, \
-                REAL abstol=1e-8, REAL reltol=1e-8, INT maxit=1000, \
-                VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.D.alpha
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_D_alpha_a:
-        PARAMS: GRAPH graph, INOUT REALPTR alpha, INOUT REALPTR a, \
-                OUT REALPTR Fmin, REAL abstol=1e-8, REAL reltol=1e-8, \
-                INT maxit=1000, VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.D.alpha.a
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_DE_alpha_a:
-        PARAMS: GRAPH graph, VECTOR cats, INOUT REALPTR alpha, \
-                INOUT REALPTR a, INOUT VECTOR coeffs, OUT REALPTR Fmin, \
-                REAL abstol=1e-8, REAL reltol=1e-8, INT maxit=1000, \
-                VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.DE.alpha.a
-
-igraph_revolver_ml_AD_alpha_a_beta:
-        PARAMS: GRAPH graph, INOUT REALPTR alpha, INOUT REALPTR a, \
-                INOUT REALPTR beta, OUT REALPTR Fmin, \
-                REAL abstol=1e-8, REAL reltol=1e-8, INT maxit=1000, INT agebins=300,\
-                VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.AD.alpha.a.beta
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_AD_dpareto:
-        PARAMS: GRAPH graph, INOUT REALPTR alpha, INOUT REALPTR a, \
-                INOUT REALPTR paralpha, INOUT REALPTR parbeta, \
-                INOUT REALPTR parscale, OUT REALPTR Fmin, \
-                REAL abstol=1e-8, REAL reltol=1e-8, INT maxit=1000, INT agebins=300,\
-                VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.AD.dpareto
-        FLAGS: PROGRESS
-
-igraph_revolver_ml_AD_dpareto_eval:
-        PARAMS: GRAPH graph, REAL alpha, REAL a, REAL paralpha, REAL parbeta, \
-                REAL parscale, OUT REALPTR value, OUT VECTOR deriv, \
-                INT agebins=300, VECTOR_OR_0 filter=NULL
-        NAME-R: revolver.ml.AD.dpareto.eval
-
-igraph_revolver_ml_ADE_alpha_a_beta:
-        PARAMS: GRAPH graph, VECTOR cats, INOUT REALPTR alpha, \
-                INOUT REALPTR a, INOUT REALPTR beta, INOUT VECTOR coeffs, \
-                OUT REALPTR Fmin, REAL abstol=1e-8, REAL reltol=1e-8, \
-                INT maxit=1000, INT agebins=300, \
-                VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.ADE.alpha.a.beta
-
-igraph_revolver_ml_ADE_dpareto:
-        PARAMS: GRAPH graph, VECTOR cats, INOUT REALPTR alpha, \
-                INOUT REALPTR a, INOUT REALPTR paralpha, \
-                INOUT REALPTR parbeta, INOUT REALPTR parscale, \
-                INOUT VECTOR coeffs, OUT REALPTR Fmin, \
-                REAL abstol=1e-8, REAL reltol=1e-8, INT maxit=1000, \
-                INT agebins=300, VECTOR_OR_0 filter=NULL, \
-                OUT INTEGERPTR fncount, OUT INTEGERPTR grcount
-        NAME-R: revolver.ml.ADE.dpareto
-
-igraph_revolver_ml_ADE_dpareto_eval:
-        PARAMS: GRAPH graph, VECTOR cats, REAL alpha, REAL a, REAL paralpha, \
-                REAL parbeta, REAL parscale, VECTOR coeffs, \
-                OUT REALPTR value, OUT VECTOR deriv, INT agebins=300, \
-                VECTOR_OR_0 filter=NULL
-        NAME-R: revolver.ml.ADE.dpareto.eval
-
-igraph_revolver_ml_ADE_dpareto_evalf:
-        PARAMS: GRAPH graph, VECTOR cats, MATRIX par, OUT VECTOR value, \
-                INT agebins, VECTOR_OR_0 filter=NULL
-        NAME-R: revolver.ml.ADE.dpareto.evalf
-
-igraph_revolver_probs_ADE_dpareto:
-        PARAMS: GRAPH graph, MATRIX par, VECTOR cats, VECTOR gcats, \
-                INT agebins, OUT VECTOR_OR_0 logprobs, \
-                OUT VECTOR_OR_0 logcited, OUT VECTOR_OR_0 logciting
-        NAME-R: revolver.probs.ADE.dpareto
-
-#######################################
-# Other, (yet) undocumented functions
-#######################################
-igraph_convergence_degree:
-        PARAMS: GRAPH graph, OUT VECTOR result, OUT VECTOR in, OUT VECTOR out
-        IGNORE: RR, RC, RNamespace
diff -Nru igraph-0.6.5~quantal1/interfaces/java/COPYING igraph-0.6.5/interfaces/java/COPYING
--- igraph-0.6.5~quantal1/interfaces/java/COPYING	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/COPYING	1970-01-01 00:00:00.000000000 +0000
@@ -1,340 +0,0 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-                       51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    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 2 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, write to the Free Software
-    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
diff -Nru igraph-0.6.5~quantal1/interfaces/java/README igraph-0.6.5/interfaces/java/README
--- igraph-0.6.5~quantal1/interfaces/java/README	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/README	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-igraph library Java interface
-=============================
-
-Preface
--------
-
-**ATTENTION**: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. `addEdges`) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-Requirements
-------------
-
-In order to compile the Java interface from scratch, you'll need the
-following:
-
-* A recent C compiler
-
-* A recent Java SDK (>= 1.5)
-
-* Python 2.4 or later if you want to use the interface generator called
-  Stimulus (found in tools/stimulus.py in the igraph distribution) to
-  generate `src/Graph.java` and `src/net_sf_igraph_Graph.c`
-
-* A GNU-compatible environment (e.g. Cygwin or MinGW on Windows,
-  practically anything on Linux, XCode Developer Tools on Mac OS X)
-
-* The `Apache Ant build tool <http://ant.apache.org>`_ for Java
-
-* `ant-contrib.jar` and `cpptasks.jar` somewhere in your Ant path.
-  You can get these from http://ant-contrib.sourceforge.net.
-
-* JUnit 4 if you want to run the unit tests. You can get it from
-  http://junit.org. Put the downloaded JAR file in the `lib`
-  subdirectory and rename it to `junit.jar`.
-
-
-Compilation steps
------------------
-
-First, compile and install the C core of igraph (see the corresponding
-[documentation](http://igraph.sourceforge.net). After that,
-change to `interfaces/java` and type `ant build`.
-This should generate two files in the `dist/` subdirectory:
-
-* `igraph-0.6.jar` (substitute the appropriate version number of course).
-  This contains the platform-independent compiled class files. Put it
-  wherever you want in your classpath.
-    
-* `igraph-java-wrapper.dll` on Windows, `libigraph-java-wrapper.so` on
-  Linux or `libigraph-java-wrapper.jnilib` on Mac OS X. This contains the
-  platform-dependent parts. Put it somewhere in the Java library path
-  so Java can find it. (The library path can be determined by
-  `System.out.println(System.getProperty("java.library.path"))` from
-  Java. If you want to keep it elsewhere, you can alter the library
-  path by passing `-Djava.library.path=whatever` to the Java
-  interpreter when executing an igraph-based program.
-  
-`ant` might fail stating that igraph is not installed on your
-system. In that case, you must specify explicitly where igraph is
-to be found by tweaking the appropriate properties in `build.xml`.
-
-Bugs, suggestions
------------------
-
-Drop me a mail at <tamas@cs.rhul.ac.uk> if something sucks. Contact
-me also if you find this a great idea and want to complete it for
-the benefit of the whole open source community :)
diff -Nru igraph-0.6.5~quantal1/interfaces/java/build.xml igraph-0.6.5/interfaces/java/build.xml
--- igraph-0.6.5~quantal1/interfaces/java/build.xml	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/build.xml	1970-01-01 00:00:00.000000000 +0000
@@ -1,228 +0,0 @@
-<?xml version="1.0"?>
-<project name="igraph Java interface" default="usage" basedir="."
-	xmlns:cpptasks="antlib:net.sf.antcontrib.cpptasks"
-	xmlns:antcontrib="antlib:net.sf.antcontrib">
-
-	<!-- Package name and version number -->
-	<property name="package.name" value="net.sf.igraph" />
-	<property name="package.slashed.name" value="net/sf/igraph" />
-	<property name="package.underscored.name" value="net_sf_igraph" />
-	<property name="package.version" value="0.6" />
-
-	<!-- Directories -->
-	<property name="build" location="build" />
-	<property name="dist" location="dist" />
-	<property name="etc" location="etc" />
-	<property name="lib" location="lib" />
-	<property name="src" location="src" />
-	<property name="reports" location="reports" />
-
-	<!-- Access to environment -->
-	<property environment="os" />
-
-	<!-- Include and library paths -->
-	<property name="igraph.include.path" location="../../include" />
-	<property name="igraph.library.path" location="${os.HOME}/lib" />
-
-	<!-- External tools -->
-	<property name="python.executable" value="python" />
-	<property name="stimulus.script" location="../../tools/stimulus.py" />
-	
-	<!-- Other configuration stuff -->
-	<property name="libtype" value="shared" />
-
-	<!-- DON'T CHANGE ANYTHING BELOW THIS LINE
-	     UNLESS YOU KNOW WHAT YOU'RE DOING -->
-	<condition property="jni.library.name" value="libigraph-java-wrapper.jnilib">
-		<and><os family="mac" /><os family="unix" /></and>
-	</condition>
-	<condition property="jni.library.name" value="libigraph-java-wrapper.dll">
-		<os family="windows" />
-	</condition>
-	<condition property="jni.library.name" value="libigraph-java-wrapper.so">
-		<os family="unix" />
-	</condition>
-	<path id="jni.include.path">
-		<pathelement path="${java.home}/include" />
-		<pathelement path="${java.home}/include/linux" />
-		<pathelement path="${java.home}/../include" />
-		<pathelement path="${java.home}/../include/linux" />
-	</path>
-
-	<property name="generated.enum.classes" value="Connectedness NeighborMode StarMode" />
-
-	<!-- Initializes the build tree, creates the necessary directories -->
-	<target name="-init" description="Initializes the build process">
-		<mkdir dir="${build}" />
-		<mkdir dir="${build}/c" />
-		<mkdir dir="${build}/java" />
-		<mkdir dir="${build}/tests" />
-		<mkdir dir="${dist}" />
-		<mkdir dir="${reports}" />
-	</target>
-
-	<!-- Deletes the existing build -->
-	<target name="clean" description="Cleans up the build directories">
-		<!-- Delete build directories -->
-		<delete dir="${build}/java" />
-		<delete dir="${build}/c" />
-		<delete dir="${build}" />
-		<delete dir="${dist}" />
-		<delete dir="${reports}" />
-		<!-- Delete generated Java source files -->
-		<delete file="${src}/java/Graph.java" />
-		<antcontrib:for param="classname" list="${generated.enum.classes}"
-			delimiter=" ">
-			<sequential>
-				<delete file="${src}/java/@{classname}.java" />
-			</sequential>
-		</antcontrib:for>
-		<!-- Delete generated C source files -->
-		<delete file="${src}/c/config.h" />
-		<delete file="${src}/c/net_sf_igraph_Graph.h" />
-	</target>
-
-	<!-- Generates some Java source files -->
-	<target name="generate_java_source">
-		<!-- Generate Graph.java -->
-		<exec executable="${python.executable}" failonerror="true">
-			<arg value="${stimulus.script}" />
-			<arg value="-f" />
-			<arg value="../functions.def" />
-			<arg value="-i" />
-			<arg value="${src}/java/Graph.java.in" />
-			<arg value="-o" />
-			<arg value="${src}/java/Graph.java" />
-			<arg value="-t" />
-			<arg value="types-Java.def" />
-			<arg value="-l" />
-			<arg value="JavaJava" />
-		</exec>
-
-		<!-- Generate enum classes -->
-		<antcontrib:for param="classname" delimiter=" "
-			list="${generated.enum.classes}">
-			<sequential>
-				<copy file="${src}/java/GenericEnum.java.in"
-					  tofile="${src}/java/@{classname}.java" />
-				<replace file="${src}/java/@{classname}.java"
-				 replacefilterfile="${etc}/enums/@{classname}.properties" />
-			</sequential>
-		</antcontrib:for>
-	</target>
-
-	<target name="-generate_java_enum_class">
-	</target>
-
-	<!-- Generates some C source files -->
-	<target name="generate_c_source">
-		<copy file="${src}/c/config.h.in" tofile="${src}/c/config.h" />
-		<replace file="${src}/c/config.h" token="@JAVA_PACKAGE_SLASH@"
-			value="${package.slashed.name}" />
-
-		<javah class="${package.name}.Graph" destdir="${src}/c" verbose="yes" force="yes">
-			<classpath location="${build}/java" />
-		</javah>
-
-		<exec executable="${python.executable}" failonerror="true">
-			<arg value="${stimulus.script}" />
-			<arg value="-f" />
-			<arg value="../functions.def" />
-			<arg value="-i" />
-			<arg value="${src}/c/${package.underscored.name}_Graph.c.in" />
-			<arg value="-o" />
-			<arg value="${src}/c/${package.underscored.name}_Graph.c" />
-			<arg value="-t" />
-			<arg value="types-C.def" />
-			<arg value="-l" />
-			<arg value="JavaC" />
-		</exec>
-	</target>
-
-	<!-- Compiles the Java source code -->
-	<target name="compile_java" depends="-init, generate_java_source"
-		description="--> compile Java code">
-		<javac srcdir="${src}/java" destdir="${build}/java" />
-	</target>
-
-	<!-- Compiles the Java tests -->
-	<target name="compile_tests" depends="-init"
-		description="--> compile Java tests">
-		<javac srcdir="${src}/tests" destdir="${build}/tests">
-			<classpath>
-				<pathelement location="${build}/java" />
-				<pathelement location="${lib}/junit.jar" />
-			</classpath>
-		</javac>
-	</target>
-
-	<!-- Compiles the C source code -->
-	<target name="compile_c" depends="-init, generate_c_source, compile_java"
-		description="--> compile C code">
-		<cpptasks:cc outtype="${libtype}" subsystem="console"
-			multithreaded="true" optimize="speed"
-			objdir="${build}/c"
-			outfile="${build}/igraph-java-wrapper"
-			outputfileproperty="jni.library.outfile">
-			<fileset dir="${src}/c" includes="*.c" />
-			<cpptasks:includepath>
-				<path path="${igraph.include.path}" />
-				<path refid="jni.include.path" />
-			</cpptasks:includepath>
-			<cpptasks:linker libtool="true">
-				<libset libs="igraph" type="shared" dir="${igraph.library.path}" />
-			</cpptasks:linker>
-		</cpptasks:cc>
-		<move file="${jni.library.outfile}" tofile="${build}/${jni.library.name}" />
-	</target>
-
-	<!-- Compiles the whole thing -->
-	<target name="compile" depends="compile_java, compile_c" description="Compiles all the source files">
-	</target>
-
-	<!-- Creates the JAR file -->
-	<target name="jar" depends="compile" description="Creates the JAR file">
-		<jar destfile="${dist}/igraph-${package.version}.jar" basedir="${build}/java">
-			<manifest>
-				<attribute name="Manifest-Version" value="1.0" />
-				<attribute name="Extension-Name" value="${package.name}" />
-				<attribute name="Implementation-Version" value="${package.version}" />
-				<attribute name="Main-Class" value="${package.name}.TestSuite" />
-			</manifest>
-		</jar>
-		<copy file="${build}/${jni.library.name}" todir="${dist}" />
-	</target>
-
-	<!-- Tests the whole thing -->
-	<target name="test" depends="compile, compile_tests" description="Runs JUnit tests in the distribution">
-		<junit printsummary="yes" fork="yes" haltonfailure="yes">
-			<classpath>
-				<pathelement location="${build}/tests" />
-				<pathelement location="${build}/java" />
-				<pathelement location="${lib}/junit.jar" />
-			</classpath>
-
-			<jvmarg value="-Djava.library.path=${build}" />
-
-			<formatter type="plain" />
-
-			<batchtest todir="${reports}">
-				<fileset dir="${build}/tests">
-					<include name="**/*Test*.class" />
-					<exclude name="**/AllTests.class" />
-				</fileset>
-			</batchtest>
-		</junit>
-	</target>
-
-	<!-- Main targets -->
-	<target name="build" depends="compile, jar" description="Builds the whole project" />
-	<target name="rebuild" depends="clean, build" description="Rebuilds the project from scratch" />
-
-	<!-- Usage information target -->
-	<target name="usage" description="Display usage information">
-		<echo message="  Execute 'ant -projecthelp' for build file help." />
-		<echo message="  Execute 'ant -help' for Ant hellp." />
-	</target>
-	<target name="help" depends="usage" />
-</project>
diff -Nru igraph-0.6.5~quantal1/interfaces/java/etc/enums/Connectedness.properties igraph-0.6.5/interfaces/java/etc/enums/Connectedness.properties
--- igraph-0.6.5~quantal1/interfaces/java/etc/enums/Connectedness.properties	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/etc/enums/Connectedness.properties	1970-01-01 00:00:00.000000000 +0000
@@ -1,3 +0,0 @@
-@ctype@=igraph_connectedness_t
-@javatype@=Connectedness
-@values@=WEAK(1), STRONG(2)
diff -Nru igraph-0.6.5~quantal1/interfaces/java/etc/enums/NeighborMode.properties igraph-0.6.5/interfaces/java/etc/enums/NeighborMode.properties
--- igraph-0.6.5~quantal1/interfaces/java/etc/enums/NeighborMode.properties	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/etc/enums/NeighborMode.properties	1970-01-01 00:00:00.000000000 +0000
@@ -1,3 +0,0 @@
-@ctype@=igraph_neimode_t
-@javatype@=NeighborMode
-@values@=OUT(1), IN(2), ALL(3), TOTAL(3)
diff -Nru igraph-0.6.5~quantal1/interfaces/java/etc/enums/StarMode.properties igraph-0.6.5/interfaces/java/etc/enums/StarMode.properties
--- igraph-0.6.5~quantal1/interfaces/java/etc/enums/StarMode.properties	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/etc/enums/StarMode.properties	1970-01-01 00:00:00.000000000 +0000
@@ -1,3 +0,0 @@
-@ctype@=igraph_star_mode_t
-@javatype@=StarMode
-@values@=OUT(0), IN(1), UNDIRECTED(2), MUTUAL(3)
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/config.h.in igraph-0.6.5/interfaces/java/src/c/config.h.in
--- igraph-0.6.5~quantal1/interfaces/java/src/c/config.h.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/config.h.in	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-#define JAVA_PACKAGE_PREFIX "@JAVA_PACKAGE_SLASH@"
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/conversion.c igraph-0.6.5/interfaces/java/src/c/conversion.c
--- igraph-0.6.5~quantal1/interfaces/java/src/c/conversion.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/conversion.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,105 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007-2009  Tamas Nepusz <tamas@cs.rhul.ac.uk>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "conversion.h"
-
-extern jfieldID net_sf_igraph_Graph_handle_fid;
-extern jmethodID net_sf_igraph_Graph_constructor_mid;
-
-/***** Conversion between jobject and igraph_t */
-
-/*
- * Converts a Java jobject to an igraph_t* if appropriate by casting
- * its private handle field to an igraph_t*
- *
- * @return: 0 if everything was OK, 1 otherwise
- */
-int Java_jobject_to_igraph(JNIEnv *env, jobject jobj, igraph_t** gptr) {
-  *gptr = (igraph_t*)(uintptr_t)((*env)->GetLongField(env, jobj, net_sf_igraph_Graph_handle_fid));
-  return (*gptr == 0 ? 1 : 0);
-}
-
-/*
- * Converts an igraph_t* to a new Java Graph object
- * @return: the new Java Graph object or NULL if there was an error
- */
-jobject Java_igraph_to_new_jobject(JNIEnv *env, igraph_t* gptr, jclass cls) {
-  /* Construct the object */
-  jobject result;
-  result = (*env)->NewObject(env, cls, net_sf_igraph_Graph_constructor_mid, gptr);
-  return result;
-}
-
-/***** Conversion between jdoubleArray and igraph_vector_t */
-
-/**
- * Converts a Java double[] to an igraph_vector_t* object.
- * The igraph_vector_t* that's passed in must be uninitialized.
- * @return: zero if everything was OK, an igraph error code otherwise
- */
-int Java_jdoubleArray_to_igraph_vector(JNIEnv *env, jdoubleArray array, igraph_vector_t* vector) {
-	jsize i, n = (*env)->GetArrayLength(env, array);
-	jdouble* elements = (*env)->GetDoubleArrayElements(env, array, 0);
-
-	IGRAPH_CHECK(igraph_vector_init(vector, n));
-	for (i=0; i < n; i++)
-		VECTOR(*vector)[i] = elements[i];
-
-	(*env)->ReleaseDoubleArrayElements(env, array, elements, JNI_ABORT);
-
-	return 0;
-}
-
-/**
- * Converts an igraph_vector_t* to a new Java double[] object
- * @return: the new Java double array or NULL if there was an error
- */
-jdoubleArray Java_igraph_vector_to_new_jdoubleArray(JNIEnv *env, igraph_vector_t* vector) {
-	long i, n;
-	jdoubleArray result;
-	jdouble* elements;
-
-	n = igraph_vector_size(vector);
-	result = (*env)->NewDoubleArray(env, n);
-	elements = (*env)->GetDoubleArrayElements(env, result, 0);
-
-	for (i=0; i < n; i++) {
-		elements[i] = VECTOR(*vector)[i];
-	}
-
-	(*env)->ReleaseDoubleArrayElements(env, result, elements, 0);
-
-	return result;
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/conversion.h igraph-0.6.5/interfaces/java/src/c/conversion.h
--- igraph-0.6.5~quantal1/interfaces/java/src/c/conversion.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/conversion.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007-2009  Tamas Nepusz <tamas@cs.rhul.ac.uk>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#ifndef _Included_net_sf_igraph_conversion
-#define _Included_net_sf_igraph_conversion
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <jni.h>
-#include <igraph/igraph.h>
-
-/************************ CONVERSION ROUTINES **************************/
-
-/* Conversion between jobject and igraph_t */
-int Java_jobject_to_igraph(JNIEnv *env, jobject jobj, igraph_t** gptr);
-jobject Java_igraph_to_new_jobject(JNIEnv *env, igraph_t* gptr, jclass cls);
-
-/* Conversion between jdoubleArray and igraph_vector_t */
-int Java_jdoubleArray_to_igraph_vector(JNIEnv *env, jdoubleArray array, igraph_vector_t* vector);
-jdoubleArray Java_igraph_vector_to_new_jdoubleArray(JNIEnv *env, igraph_vector_t* vector);
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/jni_utils.c igraph-0.6.5/interfaces/java/src/c/jni_utils.c
--- igraph-0.6.5~quantal1/interfaces/java/src/c/jni_utils.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/jni_utils.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,134 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "jni_utils.h"
-#include "config.h"
-#include <igraph/igraph.h>
-#include <string.h>          /* strlen */
-
-/************************** STATIC VARIABLES ***************************/
-
-static JavaVM *jvm;
-
-/*********************** INITIALIZER FUNCTION **************************/
-
-JNIEXPORT jint JNICALL JNI_OnLoad(JavaVM *this_jvm, void* reserved) {
-  JNIEnv *env;
-
-  jvm = this_jvm;
-  if ((*jvm)->GetEnv(jvm, (void**)&env, JNI_VERSION_1_2)) return JNI_ERR;
-
-  if (Java_net_sf_igraph_Graph_OnLoad(env) == JNI_ERR) return JNI_ERR;
-
-  if (Java_net_sf_igraph_Connectedness_OnLoad(env) == JNI_ERR) return JNI_ERR;
-  if (Java_net_sf_igraph_NeighborMode_OnLoad(env) == JNI_ERR) return JNI_ERR;
-  if (Java_net_sf_igraph_StarMode_OnLoad(env) == JNI_ERR) return JNI_ERR;
-
-  if (Java_net_sf_igraph_VertexSet_OnLoad(env) == JNI_ERR) return JNI_ERR;
-
-  return JNI_VERSION_1_2;
-}
-
-JNIEXPORT void JNICALL JNI_OnUnload(JavaVM *this_jvm, void* reserved) {
-  JNIEnv *env;
-
-  if ((*jvm)->GetEnv(jvm, (void**)&env, JNI_VERSION_1_2)) return;
-
-  Java_net_sf_igraph_Graph_OnUnload(env);
-
-  Java_net_sf_igraph_Connectedness_OnUnload(env);
-  Java_net_sf_igraph_NeighborMode_OnUnload(env);
-  Java_net_sf_igraph_StarMode_OnUnload(env);
-
-  Java_net_sf_igraph_VertexSet_OnUnload(env);
-}
-
-/************************ AUXILIARY FUNCTIONS **************************/
-
-/*
- * Returns the environment of the current thread using the cached JVM
- */
-JNIEnv *JNU_GetEnv() {
-  JNIEnv *env;
-  (*jvm)->GetEnv(jvm, (void**)&env, JNI_VERSION_1_2);
-  return env;
-}
-
-/*
- * Throws an exception by exception class name
- * Adapted from http://java.sun.com/docs/books/jni/html/exceptions.html#26050
- */
-void JNU_ThrowByName(JNIEnv *env, const char *name, const char *msg) {
-  jclass cls = (*env)->FindClass(env, name);
-  if (cls != 0)
-	(*env)->ThrowNew(env, cls, msg);
-  (*env)->DeleteLocalRef(env, cls);
-}
-
-/********** THINGS TO DO BEFORE ENTERING & AFTER LEAVING C LAYER ***********/
-
-static igraph_error_handler_t *Java_igraph_old_error_handler;
-static igraph_warning_handler_t *Java_igraph_old_warning_handler;
-
-void Java_igraph_error_handler(const char *reason, const char *file,
-  int line, int igraph_errno) {
-  JNIEnv *env = JNU_GetEnv();
-  char msg[8192], *p;
-  IGRAPH_FINALLY_FREE();
-
-  if ((*env)->ExceptionCheck(env)) {
-	/* We already have an exception, keep that and return */
-	return;
-  }
-
-  if (strlen(reason) > 2 && reason[0] == '_' && reason[1] == '_') {
-	/* Special case: throwing a Java exception by name */
-	JNU_ThrowByName(env, reason+2, "");
-  } else {
-    snprintf(msg, 8192, "%s, %s at %s:%i", reason, igraph_strerror(igraph_errno),
-      file, line);
-    JNU_ThrowByName(env, JAVA_PACKAGE_PREFIX "/CoreException", msg);
-  }
-}
-
-void Java_igraph_before() {
-  Java_igraph_old_error_handler=igraph_set_error_handler(Java_igraph_error_handler);
-  Java_igraph_old_warning_handler=igraph_set_warning_handler(0);
-}
-
-void Java_igraph_after() {
-  igraph_set_error_handler(Java_igraph_old_error_handler);
-  igraph_set_warning_handler(Java_igraph_old_warning_handler);
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/jni_utils.h igraph-0.6.5/interfaces/java/src/c/jni_utils.h
--- igraph-0.6.5~quantal1/interfaces/java/src/c/jni_utils.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/jni_utils.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,68 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#ifndef _Included_net_sf_igraph_jni_utils
-#define _Included_net_sf_igraph_jni_utils
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <jni.h>
-#include "config.h"
-
-/*********************** INITIALIZER FUNCTION **************************/
-
-JNIEXPORT jint JNICALL JNI_OnLoad(JavaVM *this_jvm, void* reserved);
-JNIEXPORT void JNICALL JNI_OnUnload(JavaVM *this_jvm, void* reserved);
-
-/************************ AUXILIARY FUNCTIONS **************************/
-
-/// Returns the environment of the current thread using the cached JVM
-JNIEnv *JNU_GetEnv();
-
-/// Throws an exception by exception class name
-void JNU_ThrowByName(JNIEnv *env, const char *name, const char *msg);
-
-/********** THINGS TO DO BEFORE ENTERING & AFTER LEAVING C LAYER ***********/
-
-void Java_igraph_error_handler(const char *reason, const char *file, int line, int igraph_errno);
-void Java_igraph_before();
-void Java_igraph_after();
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_Graph.c.in igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_Graph.c.in
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_Graph.c.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_Graph.c.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,84 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "net_sf_igraph_Graph.h"
-#include <igraph/igraph.h>
-#include "config.h"
-#include "conversion.h"
-#include "jni_utils.h"
-
-/************************** STATIC VARIABLES ***************************/
-
-jclass net_sf_igraph_Graph_class;
-jfieldID net_sf_igraph_Graph_handle_fid;
-jmethodID net_sf_igraph_Graph_constructor_mid;
-
-/*********************** INITIALIZER FUNCTION **************************/
-
-jint Java_net_sf_igraph_Graph_OnLoad(JNIEnv *env) {
-  jclass cls;
-
-  cls = (*env)->FindClass(env, JAVA_PACKAGE_PREFIX "/Graph");
-  if (cls == 0) return JNI_ERR;
-
-  net_sf_igraph_Graph_class = (*env)->NewWeakGlobalRef(env, cls);
-  if (net_sf_igraph_Graph_class == 0) return JNI_ERR;
-
-  net_sf_igraph_Graph_handle_fid = (*env)->GetFieldID(env, cls, "handle", "J");
-  if (net_sf_igraph_Graph_handle_fid == 0) return JNI_ERR;
-
-  net_sf_igraph_Graph_constructor_mid = (*env)->GetMethodID(env, cls, "<init>", "(J)V");
-  if (net_sf_igraph_Graph_constructor_mid == 0) return JNI_ERR;
-}
-
-void Java_net_sf_igraph_Graph_OnUnload(JNIEnv *env) {
-  (*env)->DeleteWeakGlobalRef(env, net_sf_igraph_Graph_class);
-  net_sf_igraph_Graph_class = 0;
-}
-
-/************************ DESTRUCTOR ROUTINES **************************/
-
-/*
- * Frees the underlying igraph_t object
- */
-void Java_net_sf_igraph_Graph_destroy(JNIEnv *env, jobject jobj) {
-  igraph_t *g;
-  if (Java_jobject_to_igraph(env, jobj, &g)) return;
-  if (g == 0) return;
-  igraph_destroy(g);
-  free(g);
-}
-
-/*********** THE REST OF THIS FILE IS GENERATED BY stimulus.py *************/
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_VertexSet.c igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_VertexSet.c
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_VertexSet.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_VertexSet.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "net_sf_igraph_VertexSet.h"
-
-/************************** STATIC VARIABLES ***************************/
-
-static jclass net_sf_igraph_VertexSet_class;
-static jmethodID net_sf_igraph_VertexSet_getIdArray_mid;
-static jmethodID net_sf_igraph_VertexSet_getTypeHint_mid;
-
-/************************ CONVERSION ROUTINES **************************/
-
-/*
- * Initializes the locally cached field IDs
- */
-jint Java_net_sf_igraph_VertexSet_OnLoad(JNIEnv *env) {
-  jclass cls;
-
-  cls = (*env)->FindClass(env, JAVA_PACKAGE_PREFIX "/VertexSet");
-  if (cls == 0) return JNI_ERR;
-  net_sf_igraph_VertexSet_class = (*env)->NewWeakGlobalRef(env, cls);
-  if (net_sf_igraph_VertexSet_class == 0) return JNI_ERR;
-
-  net_sf_igraph_VertexSet_getIdArray_mid =
-	  (*env)->GetMethodID(env, cls, "getIdArray", "()[J");
-  if (net_sf_igraph_VertexSet_getIdArray_mid == 0) return JNI_ERR;
-
-  net_sf_igraph_VertexSet_getTypeHint_mid =
-	  (*env)->GetMethodID(env, cls, "getTypeHint", "()I");
-  if (net_sf_igraph_VertexSet_getTypeHint_mid == 0) return JNI_ERR;
-
-  return JNI_OK;
-}
-
-/*
- * Releases the weak references held
- */
-void Java_net_sf_igraph_VertexSet_OnUnload(JNIEnv *env) {
-  /*
-  (*env)->DeleteWeakGlobalRef(env, net_sf_igraph_VertexSet_class);
-  net_sf_igraph_VertexSet_class = 0;
-  */
-}
-
-/*
- * Converts a Java VertexSet to an igraph_vs_t
- * @return:  zero if everything went fine, 1 if a null pointer was passed
- */
-int Java_net_sf_igraph_VertexSet_to_igraph_vs(JNIEnv *env, jobject jobj, igraph_vs_t *result) {
-  jint typeHint;
-  jobject idArray;
-
-  if (jobj == 0) {
-    IGRAPH_CHECK(igraph_vs_all(result));
-	return IGRAPH_SUCCESS;
-  }
-
-  typeHint = (*env)->CallIntMethod(env, jobj, net_sf_igraph_VertexSet_getTypeHint_mid);
-  if (typeHint != 1 && typeHint != 2) {
-    IGRAPH_CHECK(igraph_vs_all(result));
-    return IGRAPH_SUCCESS;
-  }
-  
-  idArray = (*env)->CallObjectMethod(env, jobj, net_sf_igraph_VertexSet_getIdArray_mid);
-  if ((*env)->ExceptionCheck(env)) {
-	return IGRAPH_EINVAL;
-  }
-
-  if (typeHint == 1) {
-    /* Single vertex */
-	jlong id[1];
-	(*env)->GetLongArrayRegion(env, idArray, 0, 1, id);
-	IGRAPH_CHECK(igraph_vs_1(result, (igraph_integer_t)id[0]));
-  } else if (typeHint == 2) {
-    /* List of vertices */
-	jlong* ids;
-	igraph_vector_t vec;
-	long i, n;
-
-	ids = (*env)->GetLongArrayElements(env, idArray, 0);
-	n = (*env)->GetArrayLength(env, idArray);
-
-	IGRAPH_VECTOR_INIT_FINALLY(&vec, n);
-	for (i = 0; i < n; i++)
-		VECTOR(vec)[i] = ids[i];
-	IGRAPH_CHECK(igraph_vs_vector_copy(result, &vec));
-	igraph_vector_destroy(&vec);
-	IGRAPH_FINALLY_CLEAN(1);
-
-	(*env)->ReleaseLongArrayElements(env, idArray, ids, JNI_ABORT);
-  }
-
-  (*env)->DeleteLocalRef(env, idArray);
-
-  return IGRAPH_SUCCESS;
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_VertexSet.h igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_VertexSet.h
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_VertexSet.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_VertexSet.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#ifndef _Included_net_sf_igraph_VertexSet
-#define _Included_net_sf_igraph_VertexSet
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include <jni.h>
-#include <igraph/igraph.h>
-#include "config.h"
-
-jint Java_net_sf_igraph_VertexSet_OnLoad(JNIEnv *env);
-void Java_net_sf_igraph_VertexSet_OnUnload(JNIEnv *env);
-int Java_net_sf_igraph_VertexSet_to_igraph_vs(JNIEnv *env, jobject jobj, igraph_vs_t *result);
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enum.pmt igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enum.pmt
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enum.pmt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enum.pmt	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include <jni.h>
-#include "config.h"
-#include <igraph/igraph_constants.h>
-#include "net_sf_igraph_pmt.h"
-
-jint FUNCTION(OnLoad)(JNIEnv *env);
-void FUNCTION(OnUnload)(JNIEnv *env);
-int FUNCTION(to_igraph)(JNIEnv *env, jobject jobj, C_TYPE *result);
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enum_impl.pmt igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enum_impl.pmt
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enum_impl.pmt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enum_impl.pmt	1970-01-01 00:00:00.000000000 +0000
@@ -1,82 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "net_sf_igraph_pmt.h"
-
-/************************** STATIC VARIABLES ***************************/
-
-#define CLASSVAR CONCAT3(igraph, JAVA_TYPE, class)
-#define FIELDVAR CONCAT3(igraph, JAVA_TYPE, numericValue_fid)
-
-static jclass CLASSVAR;
-static jfieldID FIELDVAR;
-
-/************************ CONVERSION ROUTINES **************************/
-
-/*
- * Initializes the locally cached field IDs
- */
-jint FUNCTION(OnLoad)(JNIEnv *env) {
-  jclass cls;
-
-  cls = (*env)->FindClass(env, JAVA_PACKAGE_PREFIX "/" JAVA_TYPE_STRING);
-  if (cls == 0) return JNI_ERR;
-  CLASSVAR = (*env)->NewWeakGlobalRef(env, cls);
-  if (CLASSVAR == 0) return JNI_ERR;
-  FIELDVAR = (*env)->GetFieldID(env, cls, "numericValue", "I");
-  if (FIELDVAR == 0) return JNI_ERR;
-
-  return JNI_OK;
-}
-
-/*
- * Releases the weak references held
- */
-void FUNCTION(OnUnload)(JNIEnv *env) {
-  (*env)->DeleteWeakGlobalRef(env, CLASSVAR);
-  CLASSVAR = 0;
-}
-
-/*
- * Converts a Java enum type to an igraph enum type
- * @return:  zero if everything went fine, 1 if a null pointer was passed
- */
-int FUNCTION(to_igraph)(JNIEnv *env, jobject jobj, C_TYPE *result) {
-  if (jobj == 0)
-    return 1;
-  *result = (*env)->GetIntField(env, jobj, FIELDVAR);
-  return 0;
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enums.c igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enums.c
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enums.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enums.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#include "net_sf_igraph_enums.h"
-
-#define JAVA_TYPE Connectedness
-#define JAVA_TYPE_STRING "Connectedness"
-#define C_TYPE igraph_connectedness_t
-#include "net_sf_igraph_enum_impl.pmt"
-#undef JAVA_TYPE_STRING
-#undef JAVA_TYPE
-#undef C_TYPE
-
-#define JAVA_TYPE NeighborMode
-#define JAVA_TYPE_STRING "NeighborMode"
-#define C_TYPE igraph_neimode_t
-#include "net_sf_igraph_enum_impl.pmt"
-#undef JAVA_TYPE_STRING
-#undef JAVA_TYPE
-#undef C_TYPE
-
-#define JAVA_TYPE StarMode
-#define JAVA_TYPE_STRING "StarMode"
-#define C_TYPE igraph_star_mode_t
-#include "net_sf_igraph_enum_impl.pmt"
-#undef JAVA_TYPE_STRING
-#undef JAVA_TYPE
-#undef C_TYPE
-
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enums.h igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enums.h
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_enums.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_enums.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#define JAVA_TYPE NeighborMode
-#define C_TYPE igraph_neimode_t
-#include "net_sf_igraph_enum.pmt"
-#undef JAVA_TYPE
-#undef C_TYPE
-
-#define JAVA_TYPE StarMode
-#define C_TYPE igraph_star_mode_t
-#include "net_sf_igraph_enum.pmt"
-#undef JAVA_TYPE
-#undef C_TYPE
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_pmt.h igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_pmt.h
--- igraph-0.6.5~quantal1/interfaces/java/src/c/net_sf_igraph_pmt.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/c/net_sf_igraph_pmt.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2007  Tamas Nepusz <ntamas@rmki.kfki.hu>
-   MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-#ifndef CONCAT2
-#  define CONCAT2x(a,b)     a ## _ ## b
-#  define CONCAT2(a,b)      CONCAT2x(a,b)
-#endif
-
-#ifndef CONCAT3
-#  define CONCAT3x(a,b,c)   a ## _ ## b ## _ ## c
-#  define CONCAT3(a,b,c)    CONCAT3x(a,b,c)
-#endif
-
-#ifndef CONCAT4
-#  define CONCAT4x(a,b,c,d) a ## _ ## b ## _ ## c ## _ ## d
-#  define CONCAT4(a,b,c,d)  CONCAT4x(a,b,c)
-#endif
-
-#define FUNCTION(a) CONCAT3(Java_net_sf_igraph, JAVA_TYPE, a)
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/java/CoreException.java igraph-0.6.5/interfaces/java/src/java/CoreException.java
--- igraph-0.6.5~quantal1/interfaces/java/src/java/CoreException.java	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/java/CoreException.java	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph;
-
-public class CoreException extends Exception {
-    public CoreException() { super(); }
-    public CoreException(String message) { super(message); }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/java/GenericEnum.java.in igraph-0.6.5/interfaces/java/src/java/GenericEnum.java.in
--- igraph-0.6.5~quantal1/interfaces/java/src/java/GenericEnum.java.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/java/GenericEnum.java.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph;
-
-/// Proxy class for @ctype@
-public enum @javatype@ {
-	@values@;
-
-	private final int numericValue;
-
-	@javatype@(int numericValue) { this.numericValue = numericValue; }
-	public int intValue() { return this.numericValue; }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/java/Graph.java.in igraph-0.6.5/interfaces/java/src/java/Graph.java.in
--- igraph-0.6.5~quantal1/interfaces/java/src/java/Graph.java.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/java/Graph.java.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph;
-
-public class Graph {
-    private long handle=0; // handle to the underlying igraph_t object
-  
-    private Graph(long handle) { this.handle = handle; }
-    private native void destroy();
-  
-    @Override protected void finalize() throws Throwable {
-        if (handle != 0) destroy();
-        super.finalize();
-    }
-
-	public static void test() {
-		System.out.println("OK");
-	}
-
-    /* stimulus.py generated part starts here */
-    %STIMULUS%
-    /* stimulus.py generated part ends here */
-  
-    static {
-        System.loadLibrary("igraph-java-wrapper");
-    }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/java/VertexSet.java igraph-0.6.5/interfaces/java/src/java/VertexSet.java
--- igraph-0.6.5~quantal1/interfaces/java/src/java/VertexSet.java	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/java/VertexSet.java	1970-01-01 00:00:00.000000000 +0000
@@ -1,186 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph;
-
-import java.util.Collection;
-import java.util.Iterator;
-import java.util.List;
-import java.util.Vector;
-import net.sf.igraph.util.LongRangeIterator;
-
-/// Class representing a vertex (sub)set of a graph
-public class VertexSet implements Iterable<Long> {
-    /// List of vertex IDs in this vertex (sub)set
-    protected List<Long> ids = null;
-
-    /// Graph object we are attached to (if any)
-    protected Graph graph = null;
-
-    /// Static instance variable that refers to a vertex set with all the vertices in a graph
-    static final VertexSet ALL = new VertexSet();
-
-    /// Constructor that creates a VertexSet referring to all the vertices with no attached graph
-    public VertexSet() {}
-
-    /// Constructor that creates a VertexSet referring to all the vertices attached to a given graph
-    public VertexSet(Graph graph) {
-        this.graph = graph;
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex attached to a given graph
-    public VertexSet(Long vertexID, Graph graph) {
-        this(graph);
-        this.ids = new Vector<Long>(1);
-        this.ids.add(vertexID);
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex with no attached graph
-    public VertexSet(Long vertexID) {
-        this(vertexID, null);
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex attached to a given graph
-    public VertexSet(Integer vertexID, Graph graph) {
-		this(Long.valueOf(vertexID), graph);
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex with no attached graph
-    public VertexSet(Integer vertexID) {
-        this(vertexID, null);
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex attached to a given graph
-    public VertexSet(long vertexID, Graph graph) {
-		this(Long.valueOf(vertexID), graph);
-    }
-
-    /// Constructor that creates a VertexSet referring to a single vertex with no attached graph
-    public VertexSet(long vertexID) {
-        this(vertexID, null);
-    }
-
-    /// Constructor that creates a VertexSet referring to a predefined set of vertices attached to a graph
-    public VertexSet(Collection<? extends Long> vertexIDs, Graph graph) {
-        this(graph);
-        this.ids = new Vector<Long>(vertexIDs);
-    }
-
-    /// Constructor that creates a VertexSet referring to a predefined set of vertices with no attached graph
-    public VertexSet(Collection<? extends Long> vertexIDs) {
-        this(vertexIDs, null);
-    }
-
-    /// Constructor that creates a VertexSet referring to a predefined set of vertices attached to a graph
-    public VertexSet(long[] vertexIDs, Graph graph) {
-        this(graph);
-        this.ids = new Vector<Long>(vertexIDs.length);
-        for (int i = 0; i < vertexIDs.length; i++)
-            this.ids.add(Long.valueOf(vertexIDs[i]));
-    }
-
-    /// Constructor that creates a VertexSet referring to a predefined set of vertices with no attached graph
-    public VertexSet(long[] vertexIDs) {
-        this(vertexIDs, null);
-    }
-
-    /// Returns an iterator for the vertex IDs (may change in the future!)
-    public Iterator<Long> iterator() {
-        if (ids == null) {
-            /* No IDs specified. If we are assigned to a graph, get the vertex
-             * count and iterate over all the vertices */
-            if (graph == null)
-                throw new UnsupportedOperationException("VertexSet is not assigned to a graph");
-
-            return new LongRangeIterator(0L, graph.vcount());
-        }
-
-        return this.ids.iterator();
-    }
-
-	/// Returns an array for the vertex IDs
-	public long[] getIdArray() {
-		if (this.ids == null) {
-            /* No IDs specified. If we are assigned to a graph, get the vertex
-             * count and return all the IDs */
-            if (graph == null)
-                throw new UnsupportedOperationException("VertexSet is not assigned to a graph");
-
-			long[] result = new long[(int)graph.vcount()];
-			for (int i = 0; i < result.length; i++)
-				result[i] = i;
-
-            return result;
-		}
-
-		long[] result = new long[this.ids.size()];
-		for (int i = 0; i < result.length; i++)
-			result[i] = this.ids.get(i);
-		return result;
-	}
-
-    /**
-     * Returns the type hint of this vertex set.
-     *
-     * This variable tells which igraph_vs_t constructor should be used in the C core
-     * of igraph. It is a non-negative integer with the following meanings:
-     *
-     * - 0 = igraph_vs_all
-     * - 1 = igraph_vs_1
-     * - 2 = igraph_vs_vector
-     *
-     * Other igraph_vs_t constructors are not supported yet.
-     */
-    public int getTypeHint() {
-        if (ids == null)
-            return 0;
-
-        if (ids.size() == 1)
-            return 1;
-
-        return 2;
-    }
-
-    /// Get the graph we are attached to
-    public Graph getGraph() { return this.graph; }
-
-    /// Set the graph we are attached to
-    public void setGraph(Graph graph) { this.graph = graph; }
-
-    /// Set the graph we are attached to
-    public void attach(Graph graph) { setGraph(graph); }
-
-    /// Detach from the graph we are attached to
-    public void detach() { this.graph = null; }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/java/util/LongRangeIterator.java igraph-0.6.5/interfaces/java/src/java/util/LongRangeIterator.java
--- igraph-0.6.5~quantal1/interfaces/java/src/java/util/LongRangeIterator.java	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/java/util/LongRangeIterator.java	1970-01-01 00:00:00.000000000 +0000
@@ -1,95 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph.util;
-
-import java.util.Iterator;
-import java.util.NoSuchElementException;
-
-/**
- * Iterator generating numbers in increasing order from min to max with a given step size.
- *
- * The interval is inclusive from the left (i.e. min will be included) but exclusive from
- * the right (i.e. max will not be included).
- */
-public class LongRangeIterator implements Iterator<Long> {
-    /// The next value to be returned
-    private long nextValue;
-
-    /// The maximum value
-    private final long max;
-
-    /// The step size
-    private final long step;
-
-    /// Constructor that creates a range iterator in [min..max) with a given step size
-    public LongRangeIterator(long min, long max, long step) {
-        if (min > max) {
-            throw new IllegalArgumentException("min must be <= max");
-        }
-        this.nextValue = min;
-        this.max = max;
-        this.step = step;
-    }
-
-    /// Constructor that creates a range iterator in [min..max) with step size 1
-    public LongRangeIterator(long min, long max) {
-        this(min, max, 1);
-    }
-
-    /// Constructor that creates an unlimited range iterator starting from min with step size 1
-    public LongRangeIterator(long min) {
-        this(min, Long.MAX_VALUE, 1);
-    }
-
-    /// Checks whether there are more elements left
-    public boolean hasNext() {
-        return nextValue < max;
-    }
-
-    /// Returns the next element
-    public Long next() {
-        if (!hasNext()) {
-            throw new NoSuchElementException();
-        }
-        Long result = Long.valueOf(nextValue);
-        nextValue = nextValue + step;
-        return result;
-    }
-
-    /// Removes the current element - not implemented of course
-    public void remove() {
-        throw new UnsupportedOperationException();
-    }
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/java/src/tests/BasicGraphTests.java igraph-0.6.5/interfaces/java/src/tests/BasicGraphTests.java
--- igraph-0.6.5~quantal1/interfaces/java/src/tests/BasicGraphTests.java	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/src/tests/BasicGraphTests.java	1970-01-01 00:00:00.000000000 +0000
@@ -1,158 +0,0 @@
-/* 
-   IGraph library Java interface.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA 
-
-*/
-
-/*
-
-ATTENTION: This is a highly experimental, proof-of-concept Java interface.
-Its main purpose was to convince me that it can be done in finite time :)
-The interface is highly incomplete, at the time of writing even some
-essential functions (e.g. addEdges) are missing. Since I don't use Java
-intensively, chances are that this interface gets finished only if there
-is substantial demand for it and/or someone takes the time to send patches
-or finish it completely.
-
-*/
-
-package net.sf.igraph;
-
-import org.junit.*;
-import static org.junit.Assert.*;
-
-public class BasicGraphTests {
-    @Test
-    public void testEmptyGraph() {
-        Graph graph = Graph.Empty(10, false);
-        assertEquals("empty graph should have ten vertices", 10, graph.vcount());
-        assertEquals("empty graph should have no edges", 0, graph.ecount());
-        assertFalse(graph.isDirected());
-
-        graph = Graph.Empty(5, true);
-        assertEquals("empty graph should have five vertices", 5, graph.vcount());
-        assertEquals("empty graph should have no edges", 0, graph.ecount());
-        assertTrue(graph.isDirected());
-    }
-
-    @Test(expected=CoreException.class)
-    public void testEmptyGraphException() {
-        Graph graph = Graph.Empty(-1, true);
-    }
-
-    @Test
-    public void testFullGraph() {
-        Graph graph = Graph.Full(10, false, false);
-        assertEquals("full graph should have 10 vertices", 10, graph.vcount());
-        assertEquals("full graph should have 45 edges", 45, graph.ecount());
-
-        graph = Graph.Full(10, true, false);
-        assertEquals("full directed graph should have 10 vertices", 10, graph.vcount());
-        assertEquals("full directed graph should have 90 edges", 90, graph.ecount());
-
-        graph = Graph.Full(10, false, true);
-        assertEquals("full graph with loops should have 10 vertices", 10, graph.vcount());
-        assertEquals("full graph with loops should have 45 edges", 55, graph.ecount());
-    }
-
-    @Test(expected=CoreException.class)
-    public void testFullGraphException() {
-        Graph graph = Graph.Full(-1, true, true);
-    }
-
-    @Test
-    public void testNeighbors() {
-        Graph graph = Graph.Full(10, false, false);
-        double[] neighbors = graph.neighbors(3, NeighborMode.OUT);
-        double[] expectedNeighbors = { 0, 1, 2, 4, 5, 6, 7, 8, 9 };
-
-        for (int i = 0; i < expectedNeighbors.length; i++)
-            assertEquals("neighbor list element "+i+" invalid for undirected full graph",
-                    expectedNeighbors[i], neighbors[i], 0.0);
-    }
-
-    @Test(expected=CoreException.class)
-    public void testNeighborsInvalidVertexID() {
-        Graph graph = Graph.Full(10, false, false);
-        double[] neighbors = graph.neighbors(-1, NeighborMode.OUT);
-    }
-
-    @Test(expected=NullPointerException.class)
-    public void testNeighborsInvalidNeighborMode() {
-        Graph graph = Graph.Empty(3, false);
-        double[] neighbors = graph.neighbors(2, null);
-    }
-
-    @Test
-    public void testGetEids() {
-        Graph graph = Graph.Full(10, false, false);
-        double[] pairs = {2, 7, 5, 1, 3, 4};
-        double[] eids = graph.getEids(pairs, false);
-        double[] expectedEids = { 21, 12, 24 };
-
-        for (int i = 0; i < expectedEids.length; i++)
-            assertEquals("edge ID list element "+i+" invalid for undirected full graph",
-                    expectedEids[i], eids[i], 0.0);
-    }
-
-    @Test
-    public void testDegreeAll1() {
-        Graph graph = Graph.Full(10, false, true);
-        double[] expectedDegrees = { 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 };
-        double[] degrees = graph.degree(null, NeighborMode.OUT, false);
-
-        for (int i = 0; i < expectedDegrees.length; i++) {
-            assertEquals("degree list element "+i+" invalid for undirected full graph (no loops)",
-                    expectedDegrees[i], degrees[i], 0.0);
-		}
-	}
-
-    @Test
-    public void testDegreeAll2() {
-        Graph graph = Graph.Full(10, false, true);
-        double[] expectedDegrees = { 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 };
-        double[] degrees = graph.degree(VertexSet.ALL, NeighborMode.OUT, false);
-
-        for (int i = 0; i < expectedDegrees.length; i++) {
-            assertEquals("degree list element "+i+" invalid for undirected full graph (no loops)",
-                    expectedDegrees[i], degrees[i], 0.0);
-		}
-	}
-
-	@Test
-	public void testDegreeSingle() {
-        Graph graph = Graph.Full(10, false, true);
-        double[] expectedDegrees = { 9 };
-        double[] degrees = graph.degree(new VertexSet(2), NeighborMode.OUT, false);
-        for (int i = 0; i < expectedDegrees.length; i++)
-            assertEquals("degree list element "+i+" invalid for undirected full graph (no loops)",
-                    expectedDegrees[i], degrees[i], 0.0);
-    }
-
-	@Test
-	public void testDegreeMultiple() {
-        Graph graph = Graph.Full(10, false, true);
-		long[] ids = { 2, 3, 7 };
-        double[] expectedDegrees = { 9, 9, 9 };
-        double[] degrees = graph.degree(new VertexSet(ids), NeighborMode.OUT, false);
-        for (int i = 0; i < expectedDegrees.length; i++)
-            assertEquals("degree list element "+i+" invalid for undirected full graph (no loops)",
-                    expectedDegrees[i], degrees[i], 0.0);
-    }
-};
diff -Nru igraph-0.6.5~quantal1/interfaces/java/types-C.def igraph-0.6.5/interfaces/java/types-C.def
--- igraph-0.6.5~quantal1/interfaces/java/types-C.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/types-C.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,232 +0,0 @@
-
-##################################
-# GRAPH
-
-GRAPH:
-  CTYPE: igraph_t*
-  JAVATYPE: jobject
-  INCONV: 
-    IN: if (Java_jobject_to_igraph(env, %I%, &%C%)) return 0;
-    OUT: %C% = (igraph_t*)calloc(1, sizeof(igraph_t));
-    INOUT: if (Java_jobject_to_igraph(env, %I%, &%C%)) return 0;
-  OUTCONV:
-    OUT: %I% = Java_igraph_to_new_jobject(env, %C%, cls);
-    INOUT: /* No conversion needed for INOUT GRAPH */
-
-##################################
-# INTEGER
-
-INTEGER:  
-  CTYPE: igraph_integer_t
-  JAVATYPE: jlong
-  INCONV: 
-    IN: %C% = (igraph_integer_t)%I%;
-  OUTCONV:
-    OUT: %I% = (jlong)%C%;
-
-INTEGERPTR:
-  CTYPE: igraph_integer_t
-  JAVATYPE: jlong
-  CALL: &%C%
-  OUTCONV:
-    OUT: %I% = (jlong)%C%;
-
-INT:
-  CTYPE: int
-  JAVATYPE: jint
-  INCONV:
-    IN: %C% = (int)%I%;
-
-##################################
-# REAL
-
-REAL:
-  CTYPE: igraph_real_t
-  JAVATYPE: jdouble
-  INCONV:
-    IN: %C% = (igraph_real_t)%I%;
-  OUTCONV:
-    OUT: %I% = (jdouble)%C%;
-
-REALPTR:
-  CTYPE: igraph_real_t
-  JAVATYPE: jdouble
-  CALL: &%C%
-  INCONV:
-    INOUT: %C% = (igraph_real_t)%I%;
-  OUTCONV:
-    OUT: %I% = (jdouble)%C%;
-
-##################################
-# BOOLEAN
-
-BOOLEAN:
-  CTYPE: igraph_bool_t
-  JAVATYPE: jboolean
-  INCONV:
-    IN: %C% = (igraph_bool_t)%I%;
-  OUTCONV:
-    OUT: %I% = (%C% ? JNI_TRUE : JNI_FALSE);
-
-BOOLEANPTR:
-  CTYPE: igraph_bool_t
-  JAVATYPE: jboolean
-  CALL: &%C%
-  OUTCONV:
-    OUT: %I% = (%C% ? JNI_TRUE : JNI_FALSE);
-
-##################################
-# ERROR, used as the return type usually
-
-ERROR:
-  CTYPE: int
-
-##################################
-# ENUMS
-
-CONNECTEDNESS:
-  CTYPE: igraph_connectedness_t
-  JAVATYPE: jobject
-  INCONV:
-    IN: if (Java_net_sf_igraph_Connectedness_to_igraph(env, %I%, &%C%)) { \
-	        igraph_error("__java/lang/NullPointerException", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-		}
-
-NEIMODE:
-  CTYPE: igraph_neimode_t
-  JAVATYPE: jobject
-  INCONV:
-    IN: if (Java_net_sf_igraph_NeighborMode_to_igraph(env, %I%, &%C%)) { \
-	        igraph_error("__java/lang/NullPointerException", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-		}
-
-STARMODE:
-  CTYPE: igraph_star_mode_t
-  JAVATYPE: jobject
-  INCONV:
-    IN: if (Java_net_sf_igraph_StarMode_to_igraph(env, %I%, &%C%)) { \
-	        igraph_error("__java/lang/NullPointerException", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-		}
-
-##################################
-# VECTOR of real values
-
-VECTOR:
-  CTYPE: igraph_vector_t
-  JAVATYPE: jdoubleArray
-  CALL: &%C%
-  INCONV:
-    IN:  Java_jdoubleArray_to_igraph_vector(env, %I%, &%C%); \
-	     IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-	       igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-		 } \
-		 IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    IN:  igraph_vector_destroy(&%C%); \
-	     IGRAPH_FINALLY_CLEAN(1);
-    OUT: %I% = Java_igraph_vector_to_new_jdoubleArray(env, &%C%); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-VECTORLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: if (0 != igraph_vector_ptr_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(R_igraph_vectorlist_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_vectorlist_to_SEXP(&%C%)); \
-         R_igraph_vectorlist_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# VECTOR that can be NULL
-# 'OUT' arguments are always returned now, in the 
-# future we should have a boolean R argument for them which
-# defines whether or not we want to return them, but this 
-# requires some stimulus development.
-
-VECTOR_OR_0:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-# This is the same, some syntax would be needed to express it
-
-EDGEWEIGHTS:
-  CTYPE: igraph_vector_t
-  CALL: (isNull(%I%) ? 0 : &%C%)
-  INCONV:
-    IN: if (!isNull(%I%)) { R_SEXP_to_vector(%I%, &%C%); }
-    OUT: if (0 != igraph_vector_init(&%C%, 0)) { \
-           igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%); \
-         %I%=NEW_NUMERIC(0); /* hack to have a non-NULL value */
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_0orvector_to_SEXP(&%C%)); \
-         igraph_vector_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# MATRIX of real values
-
-MATRIX:
-  CTYPE: igraph_matrix_t
-  CALL: &%C%
-  INCONV:
-    IN: R_SEXP_to_matrix(%I%, &%C%);
-    OUT: if (0 != igraph_matrix_init(&%C%, 0, 0)) { \
-            igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-         } \
-         IGRAPH_FINALLY(igraph_vector_destroy, &%C%);
-  OUTCONV:
-    OUT: PROTECT(%I%=R_igraph_matrix_to_SEXP(&%C%)); \
-         igraph_matrix_destroy(&%C%); \
-         IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# Some vertices of a graph
-
-VERTEXSET:
-  CTYPE: igraph_vs_t
-  JAVATYPE: jobject
-  INCONV:
-    IN: if (0 != Java_net_sf_igraph_VertexSet_to_igraph_vs(env, %I%, &%C%)) { \
-	      igraph_error("", __FILE__, __LINE__, IGRAPH_ENOMEM); \
-		} \
-	    IGRAPH_FINALLY(igraph_vs_destroy, &%C%);
-  OUTCONV:
-    IN: igraph_vs_destroy(&%C%); \
-	    IGRAPH_FINALLY_CLEAN(1);
-
-##################################
-# NULL, this is supplied as an argument
-
-NULL:
-  CALL: 0
-  HEADER:
-
-##################################
-# Options to the ARPACK solver
-
-ARPACKOPT:
-  CTYPE: igraph_arpack_options_t
-  CALL: &%C%
-  INCONV:
-    INOUT: R_SEXP_to_igraph_arpack_options(%I%, &%C%);
-  OUTCONV:
-    INOUT: PROTECT(%I%=R_igraph_arpack_options_to_SEXP(&%C%));
diff -Nru igraph-0.6.5~quantal1/interfaces/java/types-Java.def igraph-0.6.5/interfaces/java/types-Java.def
--- igraph-0.6.5~quantal1/interfaces/java/types-Java.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/java/types-Java.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-
-GRAPH:
-    JAVATYPE: Graph
-
-INTEGER:
-    JAVATYPE: long
-
-INTEGERPTR:
-    JAVATYPE: long
-
-INT:
-    JAVATYPE: int
-
-REAL:
-    JAVATYPE: double
-
-REALPTR:
-    JAVATYPE: double
-
-BOOLEAN:
-    JAVATYPE: boolean
-
-BOOLEANPTR:
-    JAVATYPE: boolean
-
-CSTRING:
-    JAVATYPE: String
-
-VECTOR:
-    JAVATYPE: double[]
-
-VECTOR_OR_0:
-    JAVATYPE: double[]
-
-MATRIX:
-    JAVATYPE: double[][]
-
-NEIMODE:
-    JAVATYPE: NeighborMode
-
-STARMODE:
-    JAVATYPE: StarMode
-
-CONNECTEDNESS:
-	JAVATYPE: Connectedness
-
-ATTRIBUTES:
-    JAVATYPE: Object
-
-VERTEXSET:
-    JAVATYPE: VertexSet
-
-TRANSITIVITYMODE:
-
-EDGEWEIGHTS:
-
-NULL:
-
-VECTORLIST:
-
-ARPACKOPT:
diff -Nru igraph-0.6.5~quantal1/interfaces/python/COPYING igraph-0.6.5/interfaces/python/COPYING
--- igraph-0.6.5~quantal1/interfaces/python/COPYING	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/COPYING	1970-01-01 00:00:00.000000000 +0000
@@ -1,340 +0,0 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-                       51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    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 2 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, write to the Free Software
-    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
diff -Nru igraph-0.6.5~quantal1/interfaces/python/LICENSE igraph-0.6.5/interfaces/python/LICENSE
--- igraph-0.6.5~quantal1/interfaces/python/LICENSE	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/LICENSE	1970-01-01 00:00:00.000000000 +0000
@@ -1,339 +0,0 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
- 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Lesser General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-		    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-			    NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-	    How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    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 2 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, write to the Free Software Foundation, Inc.,
-    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.
diff -Nru igraph-0.6.5~quantal1/interfaces/python/MANIFEST.in igraph-0.6.5/interfaces/python/MANIFEST.in
--- igraph-0.6.5~quantal1/interfaces/python/MANIFEST.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/MANIFEST.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-include setup.cfg
-include src/*.h
-include MANIFEST.in
-include COPYING
-include debian/changelog.in
-include debian/control.in
-include debian/copyright.in
-include debian/compat
-include debian/rules
-include debian/prepare
-include scripts/mkdoc.sh
-include test/*.py
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/changelog.in igraph-0.6.5/interfaces/python/debian/changelog.in
--- igraph-0.6.5~quantal1/interfaces/python/debian/changelog.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/changelog.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-python-igraph (@VERSION@) unstable; urgency=low
-
-  * Initial Release.
-
- -- Tamas Nepusz <ntamas@gmail.com>  @DATE@ 
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/compat igraph-0.6.5/interfaces/python/debian/compat
--- igraph-0.6.5~quantal1/interfaces/python/debian/compat	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/compat	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-7
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/control.in igraph-0.6.5/interfaces/python/debian/control.in
--- igraph-0.6.5~quantal1/interfaces/python/debian/control.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/control.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-Source: python-igraph
-Section: python
-Priority: optional
-Maintainer: Tamas Nepusz <ntamas@gmail.com>
-Build-Depends: cdbs (>= 0.4.42), debhelper (>= 7), python-all-dev (>= 2.3.5-11), libxml2-dev, libigraph0-dev (>= @VERSION@), python-epydoc, python-central
-Standards-Version: 3.8.3
-XS-Python-Version: >= 2.4
-Homepage: http://igraph.sourceforge.net
-
-Package: python-igraph
-Architecture: any
-Depends: ${python:Depends}, ${misc:Depends}, libigraph0 (>= @VERSION@)
-Suggests: python-igraph-doc, python-cairo
-Provides: ${python:Provides}
-XB-Python-Version: ${python:Versions}
-Description: Python interface for the igraph library
- igraph is a library for creating and manipulating graphs.
- It is intended to be as powerful (ie. fast) as possible to enable the
- analysis of large graphs.
- .
- This package contains the Python interface of igraph.
-
-Package: python-igraph-doc
-Architecture: all
-Section: doc
-Suggests: python-igraph, python-doc
-Depends: ${misc:Depends}
-Description: Documentation of the Python interface of the igraph library
- igraph is a library for creating and manipulating graphs.
- It is intended to be as powerful (ie. fast) as possible to enable the
- analysis of large graphs.
- .
- This package contains the API documentation of the Python interface of
- the igraph library.
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/copyright.in igraph-0.6.5/interfaces/python/debian/copyright.in
--- igraph-0.6.5~quantal1/interfaces/python/debian/copyright.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/copyright.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-This package was debianized by Tamas Nepusz <ntamas@gmail.com> on Tue, 10 Oct 2005 23:13:01 +0100.
-
-It was downloaded from http://pypi.python.org/packages/source/p/python-igraph/python-igraph-@VERSION@.tar.gz
-
-Upstream Authors: Gabor Csardi, Tamas Nepusz
-
-Copyright:
-
-Copyright (C) 2005-2009 Gabor Csardi, Tamas Nepusz
-
-License:
-
-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 2 of the License.
-
-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 with
-the Debian GNU/Linux distribution in file /usr/share/common-licenses/GPL;
-if not, write to the Free Software Foundation, Inc., 59 Temple Place,
-Suite 330, Boston, MA  02111-1307  USA
-
-On Debian systems, the complete text of the GNU General Public
-License, version 2, can be found in /usr/share/common-licenses/GPL-2.
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/prepare igraph-0.6.5/interfaces/python/debian/prepare
--- igraph-0.6.5~quantal1/interfaces/python/debian/prepare	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/prepare	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-#!/bin/sh
-
-DATE=`date -R`
-VER=`sed -n -e "s/^[ \t]*version *= *'\\(.*\\)', *$/\1/p" setup.py`
-
-if [ x$1 = xbzr -o x$1 = x--bzr ]; then
-  VER="${VER}~bzr"`date +%Y%m%d`
-fi
-
-for i in copyright.in changelog.in control.in; do
-  cat debian/$i | sed -e "s/@VERSION@/$VER/g" | sed -e "s/@DATE@/$DATE/g" >debian/`basename $i .in`
-done
-
-echo "Prepared Debian package files for version $VER."
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/pycompat igraph-0.6.5/interfaces/python/debian/pycompat
--- igraph-0.6.5~quantal1/interfaces/python/debian/pycompat	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/pycompat	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-2
diff -Nru igraph-0.6.5~quantal1/interfaces/python/debian/rules igraph-0.6.5/interfaces/python/debian/rules
--- igraph-0.6.5~quantal1/interfaces/python/debian/rules	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/debian/rules	1970-01-01 00:00:00.000000000 +0000
@@ -1,103 +0,0 @@
-#!/usr/bin/make -f
-
-# Uncomment this to turn on verbose mode.
-export DH_VERBOSE=1
-
-# This is to mark that the public modules installed differ between
-# Python version and they can't be shared
-export DH_PYCENTRAL=nomove
-
-# These are used for cross-compiling and for saving the configure script
-# from having to guess our platform (since we know it already)
-DEB_HOST_GNU_TYPE   ?= $(shell dpkg-architecture -qDEB_HOST_GNU_TYPE)
-DEB_BUILD_GNU_TYPE  ?= $(shell dpkg-architecture -qDEB_BUILD_GNU_TYPE)
-
-ifneq (,$(findstring noopt,$(DEB_BUILD_OPTIONS)))
-	CFLAGS += -O0
-else
-	CFLAGS += -O2
-endif
-ifeq (,$(findstring nostrip,$(DEB_BUILD_OPTIONS)))
-	INSTALL_PROGRAM += -s
-endif
-
-# Get Python version information
-PYDEF=$(shell pyversions -d)
-PYVERS=$(shell pyversions -r)
-
-configure: configure-stamp
-configure-stamp:
-	dh_testdir
-	touch configure-stamp
-
-build: configure-stamp build-stamp
-build-stamp:
-	dh_testdir
-	set -e; \
-	for python in $(PYVERS); do \
-	  python=$$(echo $$python | sed "s/$(PYDEF)/python/"); \
-	  $$python setup.py build --build-platlib=$(CURDIR)/build/lib; \
-	done
-	scripts/mkdoc.sh build/lib
-	touch build-stamp
-
-clean:
-	dh_testdir
-	dh_testroot
-	rm -rf doc/api/html/
-	for python in $(PYVERS); do \
-	  python=$$(echo $$python | sed "s/$(PYDEF)/python/"); \
-	  $$python setup.py clean; \
-	done
-	rm -f build-stamp configure-stamp
-	rm -rf build
-	dh_clean
-
-install: build
-	dh_testdir
-	dh_testroot
-	dh_prep
-	dh_installdirs
-	set -e; \
-	for python in $(PYVERS); do \
-	  python=$$(echo $$python | sed "s/$(PYDEF)/python/"); \
-	  $$python setup.py install --root=$(CURDIR)/debian/python-igraph --install-layout=deb; \
-	done
-	dh_installdocs -ppython-igraph-doc doc/api/html/*
-
-# Build architecture-independent files here.
-binary-indep: build install
-# We have nothing to do by default.
-
-# Build architecture-dependent files here.
-binary-arch: build install
-	dh_testdir
-	dh_testroot
-#	dh_installdebconf	
-	dh_installdocs
-	dh_installexamples
-#	dh_installmenu
-#	dh_installlogrotate
-#	dh_installemacsen
-#	dh_installpam
-#	dh_installmime
-#	dh_installinit
-#	dh_installcron
-	dh_installman
-	dh_installinfo
-#	dh_installchangelogs ChangeLog
-	dh_link
-	dh_strip
-	dh_compress
-	dh_fixperms
-	dh_makeshlibs
-	dh_shlibdeps
-#	dh_python
-	dh_pycentral
-	dh_gencontrol
-	dh_installdeb
-	dh_md5sums
-	dh_builddeb
-
-binary: binary-indep binary-arch
-.PHONY: build clean binary-indep binary-arch binary install configure
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/Makefile igraph-0.6.5/interfaces/python/doc/Makefile
--- igraph-0.6.5~quantal1/interfaces/python/doc/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-# Makefile for Sphinx documentation
-#
-
-# You can set these variables from the command line.
-SPHINXOPTS    =
-SPHINXBUILD   = sphinx-build
-PAPER         =
-BUILDDIR      = build
-
-# Internal variables.
-PAPEROPT_a4     = -D latex_paper_size=a4
-PAPEROPT_letter = -D latex_paper_size=letter
-ALLSPHINXOPTS   = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) source
-
-.PHONY: help clean html dirhtml singlehtml pickle json htmlhelp qthelp devhelp epub latex latexpdf text man changes linkcheck doctest
-
-help:
-	@echo "Please use \`make <target>' where <target> is one of"
-	@echo "  html       to make standalone HTML files"
-	@echo "  dirhtml    to make HTML files named index.html in directories"
-	@echo "  singlehtml to make a single large HTML file"
-	@echo "  pickle     to make pickle files"
-	@echo "  json       to make JSON files"
-	@echo "  htmlhelp   to make HTML files and a HTML help project"
-	@echo "  qthelp     to make HTML files and a qthelp project"
-	@echo "  devhelp    to make HTML files and a Devhelp project"
-	@echo "  epub       to make an epub"
-	@echo "  latex      to make LaTeX files, you can set PAPER=a4 or PAPER=letter"
-	@echo "  latexpdf   to make LaTeX files and run them through pdflatex"
-	@echo "  text       to make text files"
-	@echo "  man        to make manual pages"
-	@echo "  changes    to make an overview of all changed/added/deprecated items"
-	@echo "  linkcheck  to check all external links for integrity"
-	@echo "  doctest    to run all doctests embedded in the documentation (if enabled)"
-
-clean:
-	-rm -rf $(BUILDDIR)/*
-
-html:
-	$(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html
-	@echo
-	@echo "Build finished. The HTML pages are in $(BUILDDIR)/html."
-
-dirhtml:
-	$(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml
-	@echo
-	@echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml."
-
-singlehtml:
-	$(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml
-	@echo
-	@echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml."
-
-pickle:
-	$(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle
-	@echo
-	@echo "Build finished; now you can process the pickle files."
-
-json:
-	$(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json
-	@echo
-	@echo "Build finished; now you can process the JSON files."
-
-htmlhelp:
-	$(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp
-	@echo
-	@echo "Build finished; now you can run HTML Help Workshop with the" \
-	      ".hhp project file in $(BUILDDIR)/htmlhelp."
-
-qthelp:
-	$(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp
-	@echo
-	@echo "Build finished; now you can run "qcollectiongenerator" with the" \
-	      ".qhcp project file in $(BUILDDIR)/qthelp, like this:"
-	@echo "# qcollectiongenerator $(BUILDDIR)/qthelp/python-igraph.qhcp"
-	@echo "To view the help file:"
-	@echo "# assistant -collectionFile $(BUILDDIR)/qthelp/python-igraph.qhc"
-
-devhelp:
-	$(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp
-	@echo
-	@echo "Build finished."
-	@echo "To view the help file:"
-	@echo "# mkdir -p $$HOME/.local/share/devhelp/python-igraph"
-	@echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/python-igraph"
-	@echo "# devhelp"
-
-epub:
-	$(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub
-	@echo
-	@echo "Build finished. The epub file is in $(BUILDDIR)/epub."
-
-latex:
-	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
-	@echo
-	@echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex."
-	@echo "Run \`make' in that directory to run these through (pdf)latex" \
-	      "(use \`make latexpdf' here to do that automatically)."
-
-latexpdf:
-	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
-	@echo "Running LaTeX files through pdflatex..."
-	make -C $(BUILDDIR)/latex all-pdf
-	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
-
-text:
-	$(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text
-	@echo
-	@echo "Build finished. The text files are in $(BUILDDIR)/text."
-
-man:
-	$(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man
-	@echo
-	@echo "Build finished. The manual pages are in $(BUILDDIR)/man."
-
-changes:
-	$(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes
-	@echo
-	@echo "The overview file is in $(BUILDDIR)/changes."
-
-linkcheck:
-	$(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck
-	@echo
-	@echo "Link check complete; look for any errors in the above output " \
-	      "or in $(BUILDDIR)/linkcheck/output.txt."
-
-doctest:
-	$(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest
-	@echo "Testing of doctests in the sources finished, look at the " \
-	      "results in $(BUILDDIR)/doctest/output.txt."
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/conf.py igraph-0.6.5/interfaces/python/doc/source/conf.py
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/conf.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/conf.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,253 +0,0 @@
-# -*- coding: utf-8 -*-
-#
-# python-igraph documentation build configuration file, created by
-# sphinx-quickstart on Thu Jun 17 11:36:14 2010.
-#
-# This file is execfile()d with the current directory set to its containing dir.
-#
-# Note that not all possible configuration values are present in this
-# autogenerated file.
-#
-# All configuration values have a default; values that are commented out
-# serve to show the default.
-
-import sys, os
-
-# If extensions (or modules to document with autodoc) are in another directory,
-# add these directories to sys.path here. If the directory is relative to the
-# documentation root, use os.path.abspath to make it absolute, like shown here.
-#sys.path.append(os.path.abspath('.'))
-
-# -- General configuration -----------------------------------------------------
-
-# If your documentation needs a minimal Sphinx version, state it here.
-#needs_sphinx = '1.0'
-
-# Add any Sphinx extension module names here, as strings. They can be extensions
-# coming with Sphinx (named 'sphinx.ext.*') or your custom ones.
-extensions = ['sphinx.ext.coverage']
-
-# Add any paths that contain templates here, relative to this directory.
-templates_path = ['_templates']
-
-# The suffix of source filenames.
-source_suffix = '.rst'
-
-# The encoding of source files.
-#source_encoding = 'utf-8-sig'
-
-# The master toctree document.
-master_doc = 'index'
-
-# General information about the project.
-project = u'python-igraph'
-copyright = u'2010, Tamas Nepusz, Gabor Csardi'
-
-# The version info for the project you're documenting, acts as replacement for
-# |version| and |release|, also used in various other places throughout the
-# built documents.
-#
-# The short X.Y version.
-version = '0.6'
-# The full version, including alpha/beta/rc tags.
-release = '0.6'
-
-# The language for content autogenerated by Sphinx. Refer to documentation
-# for a list of supported languages.
-#language = None
-
-# There are two options for replacing |today|: either, you set today to some
-# non-false value, then it is used:
-#today = ''
-# Else, today_fmt is used as the format for a strftime call.
-#today_fmt = '%B %d, %Y'
-
-# List of patterns, relative to source directory, that match files and
-# directories to ignore when looking for source files.
-exclude_patterns = []
-
-# The reST default role (used for this markup: `text`) to use for all documents.
-#default_role = None
-
-# If true, '()' will be appended to :func: etc. cross-reference text.
-#add_function_parentheses = True
-
-# If true, the current module name will be prepended to all description
-# unit titles (such as .. function::).
-#add_module_names = True
-
-# If true, sectionauthor and moduleauthor directives will be shown in the
-# output. They are ignored by default.
-#show_authors = False
-
-# The name of the Pygments (syntax highlighting) style to use.
-pygments_style = 'sphinx'
-
-# A list of ignored prefixes for module index sorting.
-#modindex_common_prefix = []
-
-
-# -- Options for HTML output ---------------------------------------------------
-
-# The theme to use for HTML and HTML Help pages.  See the documentation for
-# a list of builtin themes.
-html_theme = 'default'
-
-# Theme options are theme-specific and customize the look and feel of a theme
-# further.  For a list of options available for each theme, see the
-# documentation.
-#html_theme_options = {}
-
-# Add any paths that contain custom themes here, relative to this directory.
-#html_theme_path = []
-
-# The name for this set of Sphinx documents.  If None, it defaults to
-# "<project> v<release> documentation".
-#html_title = None
-
-# A shorter title for the navigation bar.  Default is the same as html_title.
-#html_short_title = None
-
-# The name of an image file (relative to this directory) to place at the top
-# of the sidebar.
-#html_logo = None
-
-# The name of an image file (within the static path) to use as favicon of the
-# docs.  This file should be a Windows icon file (.ico) being 16x16 or 32x32
-# pixels large.
-#html_favicon = None
-
-# Add any paths that contain custom static files (such as style sheets) here,
-# relative to this directory. They are copied after the builtin static files,
-# so a file named "default.css" will overwrite the builtin "default.css".
-html_static_path = ['_static']
-
-# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
-# using the given strftime format.
-#html_last_updated_fmt = '%b %d, %Y'
-
-# If true, SmartyPants will be used to convert quotes and dashes to
-# typographically correct entities.
-#html_use_smartypants = True
-
-# Custom sidebar templates, maps document names to template names.
-#html_sidebars = {}
-
-# Additional templates that should be rendered to pages, maps page names to
-# template names.
-#html_additional_pages = {}
-
-# If false, no module index is generated.
-#html_domain_indices = True
-
-# If false, no index is generated.
-#html_use_index = True
-
-# If true, the index is split into individual pages for each letter.
-#html_split_index = False
-
-# If true, links to the reST sources are added to the pages.
-#html_show_sourcelink = True
-
-# If true, "Created using Sphinx" is shown in the HTML footer. Default is True.
-#html_show_sphinx = True
-
-# If true, "(C) Copyright ..." is shown in the HTML footer. Default is True.
-#html_show_copyright = True
-
-# If true, an OpenSearch description file will be output, and all pages will
-# contain a <link> tag referring to it.  The value of this option must be the
-# base URL from which the finished HTML is served.
-#html_use_opensearch = ''
-
-# If nonempty, this is the file name suffix for HTML files (e.g. ".xhtml").
-#html_file_suffix = ''
-
-# Output file base name for HTML help builder.
-htmlhelp_basename = 'python-igraphdoc'
-
-
-# -- Options for LaTeX output --------------------------------------------------
-
-# The paper size ('letter' or 'a4').
-#latex_paper_size = 'letter'
-
-# The font size ('10pt', '11pt' or '12pt').
-#latex_font_size = '10pt'
-
-# Grouping the document tree into LaTeX files. List of tuples
-# (source start file, target name, title, author, documentclass [howto/manual]).
-latex_documents = [
-  ('index', 'python-igraph.tex', u'python-igraph Documentation',
-   u'Tamas Nepusz, Gabor Csardi', 'manual'),
-]
-
-# The name of an image file (relative to this directory) to place at the top of
-# the title page.
-#latex_logo = None
-
-# For "manual" documents, if this is true, then toplevel headings are parts,
-# not chapters.
-#latex_use_parts = False
-
-# If true, show page references after internal links.
-#latex_show_pagerefs = False
-
-# If true, show URL addresses after external links.
-#latex_show_urls = False
-
-# Additional stuff for the LaTeX preamble.
-#latex_preamble = ''
-
-# Documents to append as an appendix to all manuals.
-#latex_appendices = []
-
-# If false, no module index is generated.
-#latex_domain_indices = True
-
-
-# -- Options for manual page output --------------------------------------------
-
-# One entry per manual page. List of tuples
-# (source start file, name, description, authors, manual section).
-man_pages = [
-    ('index', 'python-igraph', u'python-igraph Documentation',
-     [u'Tamas Nepusz, Gabor Csardi'], 1)
-]
-
-
-# -- Options for Epub output ---------------------------------------------------
-
-# Bibliographic Dublin Core info.
-epub_title = u'python-igraph'
-epub_author = u'Tamas Nepusz, Gabor Csardi'
-epub_publisher = u'Tamas Nepusz, Gabor Csardi'
-epub_copyright = u'2010, Tamas Nepusz, Gabor Csardi'
-
-# The language of the text. It defaults to the language option
-# or en if the language is not set.
-#epub_language = ''
-
-# The scheme of the identifier. Typical schemes are ISBN or URL.
-#epub_scheme = ''
-
-# The unique identifier of the text. This can be a ISBN number
-# or the project homepage.
-#epub_identifier = ''
-
-# A unique identification for the text.
-#epub_uid = ''
-
-# HTML files that should be inserted before the pages created by sphinx.
-# The format is a list of tuples containing the path and title.
-#epub_pre_files = []
-
-# HTML files shat should be inserted after the pages created by sphinx.
-# The format is a list of tuples containing the path and title.
-#epub_post_files = []
-
-# A list of files that should not be packed into the epub file.
-#epub_exclude_files = []
-
-# The depth of the table of contents in toc.ncx.
-#epub_tocdepth = 3
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/python/doc/source/figures/tutorial_social_network_1.png and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/python/doc/source/figures/tutorial_social_network_1.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/python/doc/source/figures/tutorial_social_network_2.png and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/python/doc/source/figures/tutorial_social_network_2.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/interfaces/python/doc/source/figures/tutorial_social_network_3.png and /tmp/mkpaUile3f/igraph-0.6.5/interfaces/python/doc/source/figures/tutorial_social_network_3.png differ
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/include/global.rst igraph-0.6.5/interfaces/python/doc/source/include/global.rst
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/include/global.rst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/include/global.rst	1970-01-01 00:00:00.000000000 +0000
@@ -1 +0,0 @@
-.. |igraph| replace:: *igraph*
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/index.rst igraph-0.6.5/interfaces/python/doc/source/index.rst
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/index.rst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/index.rst	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-.. python-igraph documentation master file, created by sphinx-quickstart on Thu Dec 11 16:02:35 2008.
-   You can adapt this file completely to your liking, but it should at least
-   contain the root `toctree` directive.
-
-.. include:: include/global.rst
-
-Welcome to python-igraph's documentation!
-=========================================
-
-Contents:
-
-.. toctree::
-   :maxdepth: 2
-
-   intro
-   install
-   tutorial
-   generation
-   analysis
-   visualisation
-   misc
-
-
-Indices and tables
-==================
-
-* :ref:`genindex`
-* :ref:`modindex`
-* :ref:`search`
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/install.rst igraph-0.6.5/interfaces/python/doc/source/install.rst
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/install.rst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/install.rst	1970-01-01 00:00:00.000000000 +0000
@@ -1,151 +0,0 @@
-.. include:: include/global.rst
-
-.. Installing igraph
-
-.. _installing-igraph:
-
-===================
-Installing |igraph|
-===================
-
-This chapter describes how to install the C core of |igraph| and its Python bindings
-on various operating systems.
-
-Which |igraph| is right for you?
-================================
-
-|igraph| is primarily a library written in C. It is *not* a standalone program, nor it is
-a Python package that you can just drop on your Python path to start using it. Therefore,
-if you would like to exploit |igraph|'s functionality in Python, you must install
-a few packages. Do not worry, though, there are precompiled packages for the major operating
-systems, so you will not have to compile |igraph| from source unless you use an esoteric
-operating system or you have specific requirements (i.e., adding a custom patch to |igraph|'s
-C core). Precompiled packages are often called *binary packages*, while the raw source code
-is usually referred to as the *source package*.
-
-In general, you should almost always opt for the binary package unless a binary package is not
-available for your platform or you have some local modifications that you want to incorporate
-into |igraph|'s source. `Installation from a binary package`_ tells you how to install |igraph|
-from a precompiled binary package on various platforms. `Compiling igraph from source`_ tells
-you how to compile |igraph| from the source package.
-
-Installation from a binary package
-==================================
-
-|igraph| on Windows
--------------------
-
-There is a Windows installer for |igraph|'s Python interface on the
-`Python Package Index <http://pypi.python.org/pypi/python-igraph>`_.
-Download the one that is suitable for your Python version (currently
-there are binary packages for Python 2.6, Python 2.7 and Python 3.2,
-though it might change in the future). To test the installed package, launch
-your favourite Python IDE and type the following:
-
-  >>> import igraph.test
-  >>> igraph.test.test()
-
-The above commands run the bundled test cases to ensure that everything
-is fine with your |igraph| installation.
-
-Graph plotting in |igraph| on Windows
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-Graph plotting in |igraph| is implemented using a third-party package
-called `Cairo <http://www.cairographics.org>`_. If you want to create
-publication-quality plots in |igraph| on Windows, you must also install
-Cairo and its Python bindings. The Cairo project does not provide
-pre-compiled binaries for Windows, but other projects depending on
-Cairo do, so the preferred way to install Cairo on Windows along with
-its Python bindings is as follows:
-
-1. Get the latest PyCairo for Windows installer from
-   http://ftp.gnome.org/pub/gnome/binaries/win32/pycairo/1.8. Make sure you
-   grab the one that matches your Python version. At the time of writing,
-   the above folder contained installers for Python 2.6 and 2.7 only. You may
-   also try and go one level up, then down then 1.4 subfolder -- these are
-   older versions, but they work with Python 2.5 and Python 2.6 as well.
-
-2. Install PyCairo using the installer. The installer extracts the necessary
-   files into ``Lib\site-packages\cairo`` within the folder where Python is
-   installed. Unfortunately there are some extra DLLs which are required to
-   make Cairo work, so we have to get these as well.
-
-3. Head to http://ftp.gnome.org/pub/gnome/binaries/win32/dependencies/ and get
-   the binary versions of Cairo (``cairo_1.8.10-3_win32.zip`` at the time of
-   writing), Fontconfig (``fontconfig_2.8.0-2_win32.zip``), Freetype
-   (``freetype_2.4.4-1_win32.zip``), Expat (``expat_2.0.1-1_win32.zip``),
-   ``libpng`` (``libpng_1.4.3-1_win32.zip``) and ``zlib``
-   (``zlib_1.2.5-2_win32.zip``).  Version numbers may vary, so be
-   adaptive! Each ZIP file will contain a ``bin`` subfolder with a DLL file in
-   it. Put the following DLLs in ``Lib\site-packages\cairo`` within your Python
-   installation:
-
-   - ``freetype6.dll`` (from ``freetype_2.4.4-1_win32.zip``)
-   - ``libcairo-2.dll`` (from ``cairo_1.8.10-3_win32.zip``)
-   - ``libexpat-1.dll`` (from ``expat_2.0.1-1_win32.zip``)
-   - ``libfontconfig-1.dll`` (from ``fontconfig_2.8.0-2_win32.zip``)
-   - ``libpng14-14.dll`` (from ``libpng_1.4.3-1_win32.zip``)
-   - ``zlib1.dll`` (from ``zlib_1.2.5-2_win32.zip``).
-
-Having done that, you can launch Python again and check if it worked:
-
-  >>> from igraph import * 
-  >>> g = Graph.Famous("petersen")
-  >>> plot(g)
-
-|igraph| on Linux
------------------
-
-|igraph| on Debian GNU/Linux
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-|igraph| on RedHat Linux
-^^^^^^^^^^^^^^^^^^^^^^^^
-
-|igraph| on other Linux distributions
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-|igraph| on Mac OS X
---------------------
-
-There is a Mac OS X installer for |igraph|'s Python interface on the
-`Python Package Index <http://pypi.python.org/pypi/python-igraph>`_
-which works for Intel-based Macs running OS X Lion. The default
-Python version in Leopard is Python 2.7, so the package is compiled
-for this specific version. PowerPC users should compile the package
-themselves (see `Compiling igraph from source`_). To test the
-installed package, launch your favourite Python IDE or the default
-command line interpreter and type the following:
-
-  >>> import igraph.test
-  >>> igraph.test.test()
-
-The above commands run the bundled test cases to ensure that everything
-is fine with your |igraph| installation.
-
-Graph plotting in |igraph| on Mac OS X
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-Graph plotting in |igraph| is implemented using a third-party package
-called `Cairo <http://www.cairographics.org>`_. If you want to create
-publication-quality plots in |igraph| on Mac OS X, you must also install
-Cairo and its Python bindings. The Cairo project does not provide
-pre-compiled binaries for Mac OS X, but `MacPorts <http://www.macports.org>`_
-and `Fink <http://www.finkproject.org>`_ does, so you can use them to
-install Cairo. The `Cairo homepage <http://www.cairographics.org>` gives
-you some installation instructions. However, this is only one half of the
-job, you will also need the Python bindings of Cairo from the
-`PyCairo homepage <http://www.cairographics.org/pycairo>`. At the moment
-there are no precompiled PyCairo packages for Mac OS X either.
-
-TODO: detailed compilation instructions for PyCairo
-
-|igraph| on other operating systems
------------------------------------
-
-Compiling |igraph| from source
-==============================
-
-Summary
-=======
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/intro.rst igraph-0.6.5/interfaces/python/doc/source/intro.rst
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/intro.rst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/intro.rst	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-.. include:: include/global.rst
-
-.. Introduction
-
-============
-Introduction
-============
-
-What is |igraph|?
-=================
-
-Things you should know before starting out
-==========================================
-
-Reporting bugs and providing feedback
-=====================================
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/doc/source/tutorial.rst igraph-0.6.5/interfaces/python/doc/source/tutorial.rst
--- igraph-0.6.5~quantal1/interfaces/python/doc/source/tutorial.rst	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/doc/source/tutorial.rst	1970-01-01 00:00:00.000000000 +0000
@@ -1,1047 +0,0 @@
-.. include:: include/global.rst
-
-.. Tutorial
-
-========
-Tutorial
-========
-
-This chapter contains a short overview of |igraph|'s capabilities. It is highly recommended
-to read it at least once if you are new to |igraph|. I assume that you have already installed
-|igraph|; if you did not, see :ref:`installing-igraph` first. Familiarity with the Python
-language is also assumed; if this is the first time you are trying to use Python, there are
-many good Python tutorials on the Internet to get you started. Mark Pilgrim's
-`Dive Into Python <http://www.diveintopython.net>`_ is one that I personally suggest.
-If this is the first time you ever try to use a programming language,
-`A Byte of Python <http://swaroopch.com/notes/Python>`_ is even better. If
-you already have a stable programming background in other languages and you just want a
-quick overview of Python, `Learn Python in 10 minutes
-<http://www.poromenos.org/tutorials/python>`_ is probably your best bet.
-
-
-Starting |igraph|
-=================
-
-|igraph| is a Python module, hence it can be imported exactly the same way as any other
-ordinary Python module at the Python prompt::
-
-  $ python
-  Python 2.7.1 (r271:86832, Jun 16 2011, 16:59:05)
-  [GCC 4.2.1 (Based on Apple Inc. build 5658) (LLVM build 2335.15.00)] on darwin
-  Type "help", "copyright", "credits" or "license" for more information.
-  >>> import igraph
-
-This imports |igraph|'s objects and methods inside an own namespace called :mod:`igraph`. Whenever
-you would like to call any of |igraph|'s methods, you will have to provide the appropriate
-namespace-qualification. E.g., to check which |igraph| version you are using, you could do the
-following:
-
->>> import igraph
->>> print igraph.__version__
-0.6
-
-Another way to make use of |igraph| is to import all its objects and methods into the main
-Python namespace (so you do not have to type the namespace-qualification every time).
-This is fine as long as none of your own objects and methods do not conflict with the ones
-provided by |igraph|:
-
->>> from igraph import *
-
-The third way to start |igraph| is to simply call the startup script that was supplied with
-the |igraph| package you installed. Not too surprisingly, the script is called :command:`igraph`,
-and provided that the script is on your path in the command line of your operating system
-(which is almost surely the case on Linux and OS X), you can simply type :command:`igraph` at the
-command line. Windows users will find the script inside the :file:`scripts` subdirectory of Python
-and you may have to add it manually to your path in order to be able to use the script from
-the command line without typing the whole path.
-
-When you start the script, you will see something like this::
-
-  $ igraph
-  No configuration file, using defaults
-  igraph 0.6 running inside Python 2.7.1 (r271:86832, Jun 16 2011, 16:59:05)
-  Type "copyright", "credits" or "license" for more information.
-  >>>
-
-The command-line startup script imports all of |igraph|'s methods and objects into the main
-namespace, so it is practically equivalent to ``from igraph import *``. The difference between
-the two approaches (apart from saving some typing) is that the command-line script checks
-whether you have any of Python's more advanced shells installed and uses that instead of the
-standard Python shell. Currently the module looks for `IPython <http://ipython.scipy.org>`_ and
-IDLE (the Tcl/Tk-based graphical shell supplied with Python). If neither IPython nor IDLE is
-installed, the startup script launches the default Python shell. You can also modify the
-order in which these shells are searched by tweaking |igraph|'s configuration file
-(see :ref:`configuring-igraph`).
-
-In general, it is advised to use the command line startup script when using |igraph|
-interactively (i.e., when you just want to quickly load or generate some graphs, calculate
-some basic properties and save the results somewhere). For non-disposable graph analysis
-routines that you intend to re-run from time to time, you should write a script separately
-in a ``.py`` source file and import |igraph| using one of the above methods at the start of
-the script, then launch the script using the Python interpreter.
-
-From now on, every example in the documentation will assume that |igraph|'s objects and
-methods are imported into the main namespace (i.e., we used ``from igraph import *``
-instead of ``import igraph``). If you let |igraph| take its own namespace, please adjust
-all the examples accordingly.
-
-
-Creating a graph from scratch
-=============================
-
-Assuming that you have started |igraph| successfully, it is time to create your first
-|igraph| graph. This is pretty simple:
-
->>> g = Graph()
-
-The above statement created an undirected graph with no vertices or edges and assigned it
-to the variable `g`. To confirm that it's really an |igraph| graph, we can
-print it:
-
->>> g
-<igraph.Graph object at 0x4c87a0>
-
-This tells us that `g` is an instance of |igraph|'s :class:`Graph` class and
-that it is currently living at the memory address ``0x4c87a0`` (the exact
-output will almost surely be different for your platform). To obtain a more
-user-friendly output, we can try to print the graph using Python's
-``print`` statement:
-
->>> print(g)
-IGRAPH U--- 0 0 --
-
-TODO: explain it
-
-This is not too exciting so far; a graph with a single vertex and no edges is not really useful
-for us. Let's add some vertices first!
-
->>> g.add_vertices(3)
-
-:meth:`Graph.add_vertices` (i.e., the :meth:`~Graph.add_vertices` method of the :class:`Graph`
-class) adds the given number of vertices to the graph.
-
-Now our graph has three vertices but no edges, so let's add some edges as well! You can
-add edges by calling :meth:`Graph.add_edges` - but in order to add edges, you have to refer to
-existing vertices somehow. |igraph| uses integer vertex IDs starting from zero, thus the
-first vertex of your graph has index zero, the second vertex has index 1 and so on.
-Edges are specified by pairs of integers, so ``[(0,1), (1,2)]`` denotes a list of two
-edges: one between the first and the second, and the other one between the second and the
-third vertices of the graph. Passing this list to :meth:`Graph.add_edges` adds these two edges
-to your graph:
-
->>> g.add_edges([(0,1), (1,2)])
-
-:meth:`~Graph.add_edges` is clever enough to figure out what you want to do in most of the
-cases: if you supply a single pair of integers, it will automatically assume that you want
-to add a single edge. However, if you try to add edges to vertices with invalid IDs (i.e.,
-you try to add an edge to vertex 5 when you only have three edges), you will get an
-exception:
-
->>> g.add_edges((5, 0))
-Traceback (most recent call last):
-  File "<stdin>", line 6, in <module>
-igraph.core.InternalError: Error at ../../src/type_indexededgelist.c:245: cannot add edges, invalid vertex id
-
-Most |igraph| functions will raise an :exc:`igraph.core.InternalError` if
-something goes wrong. The message corresponding to the exception gives you a
-short textual explanation of what went wrong (``cannot add edges, invalid
-vertex id``) along with the corresponding line in the C source where the error
-occurred. The exact filename and line number may not be too informative to you,
-but it is invaluable for |igraph| developers if you think you found an error in
-|igraph| and you want to report it.
-
-Let us go on with our graph ``g`` and add some more vertices and edges to it:
-
->>> g.add_edges((2,0))
->>> g.add_vertices(3)
->>> g.add_edges([(2,3),(3,4),(4,5),(5,3)])
->>> print g
-IGRAPH U---- 6 7 --
-+ edges:
-0--1 1--2 0--2 2--3 3--4 4--5 3--5
-
-Now, this is better. We have an undirected graph with six vertices and seven
-edges, and you can also see the list of edges in |igraph|'s output.  Edges also
-have IDs, similarly to vertices; they also start from zero and edges that were
-added later have higher IDs than edges that were added earlier. Vertex and edge
-IDs are always *continuous*, and a direct consequence of this fact is that if
-you happen to delete an edge, chances are that some (or all) of the edges will
-be renumbered. Moreover, if you delete a vertex, even the vertex IDs will
-change.  Edges can be deleted by :meth:`~Graph.delete_edges` and it requires a
-list of edge IDs to be deleted (or a single edge ID). Vertices can be deleted
-by :meth:`~Graph.delete_vertices` and you may have already guessed that it
-requires a list of vertex IDs to be deleted (or a single vertex ID). If you do
-not know the ID of an edge you wish to delete, but you know the IDs of the
-vertices at its two endpoints, you can use :meth:`~Graph.get_eid` to get the
-edge ID. Remember, all these are *methods* of the :class:`Graph` class and you
-must call them on the appropriate :class:`Graph` instance!
-
->>> g.get_eid(2,3)
-3
->>> g.delete_edges(3)
->>> summary(g)
-IGRAPH U--- 6 6 --
-
-:meth:`summary` is a new command that you haven't seen before; it is a member of |igraph|'s
-own namespace and it can be used to get an overview of a given graph object. Its output
-is similar to the output of ``print`` but it does not print the edge list to avoid
-cluttering up the display for large graphs. In general, you should use :meth:`summary`
-instead of ``print`` when working interactively with large graphs because printing the
-edge list of a graph with millions of vertices and edges could take quite a lot of time.
-
-Generating graphs
-=================
-
-|igraph| includes a large set of graph generators which can be divided into two groups:
-deterministic and stochastic graph generators. Deterministic generators produce the same
-graph if you call them with exactly the same parameters, while stochastic generators
-produce a different graph every time. Deterministic generators include methods for
-creating trees, regular lattices, rings, extended chordal rings, several famous graphs
-and so on, while stochastic generators are used to create Erdős-Rényi random networks,
-Barabási-Albert networks, geometric random graphs and such. |igraph| has too many
-generators to cover them all in this tutorial, so we will only try a
-deterministic and a stochastic generator instead:
-
->>> g = Graph.Tree(127, 2)
->>> summary(g)
-IGRAPH U--- 127 126 --
-
-:meth:`Graph.Tree` generates a regular tree graph. The one that we generated has 127
-vertices and each vertex (apart from the leaves) has two children (and of course one
-parent). No matter how many times you call :meth:`Graph.Tree`, the generated graph will
-always be the same if you use the same parameters:
-
->>> g2 = Graph.Tree(127, 2)
->>> g2.get_edgelist() == g.get_edgelist()
-True
-
-The above code snippet also shows you that the :meth:`~Graph.get_edgelist()` method
-of :class:`Graph` graph objects return a list that contains pairs of integers, one for
-each edge. The first member of the pair is the source vertex ID and the second member
-is the target vertex ID of the corresponding edge. This list is too long, so let's
-just print the first 10 elements!
-
->>> g2.get_edgelist()[0:10]
-[(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6), (3, 7), (3, 8), (4, 9), (4, 10)]
-
-Let's do the same with a stochastic generator!
-
->>> g = Graph.GRG(100, 0.2)
->>> summary(g)
-IGRAPH U---- 100 516 --
-+ attr: x (v), y (v)
-
-TODO: discuss what the ``+ attr`` line means.
-
-:meth:`Graph.GRG` generates a geometric random graph: *n* points are chosen randomly and
-uniformly inside the unit square and pairs of points closer to each other than a predefined
-distance *d* are connected by an edge. In our case, *n* is 100 and *d* is 0.2. Due to
-the random nature of the algorithm, chances are that the exact graph you got is different
-from the one that was generated when I wrote this tutorial, hence the values above in the
-summary will not match the ones you got. This is normal and expected. Even if you generate
-two geometric random graphs on the same machine, they will be different for the same parameter
-set:
-
->>> g2 = Graph.GRG(100, 0.2)
->>> g.get_edgelist() == g2.get_edgelist()
-False
->>> g.isomorphic(g2)
-False
-
-:meth:`~Graph.isomorphic()` tells you whether two graphs are isomorphic or not. In general,
-it might take quite a lot of time, especially for large graphs, but in our case, the
-answer can quickly be given by checking the degree distributions of the two graphs.
-
-
-Setting and retrieving attributes
-=================================
-
-|igraph| uses vertex and edge IDs in its core. These IDs are integers, starting from zero,
-and they are always continuous at any given time instance during the lifetime of the graph.
-This means that whenever vertices and edges are deleted, a large set of edge and possibly
-vertex IDs will be renumbered to ensure the continuiuty. Now, let us assume that our graph
-is a social network where vertices represent people and edges represent social connections
-between them. One way to maintain the association between vertex IDs and say, the corresponding
-names is to have an additional Python list that maps from vertex IDs to names. The drawback
-of this approach is that this additional list must be maintained in parallel to the
-modifications of the original graph. Luckily, |igraph| knows the concept of *attributes*,
-i.e., auxiliary objects associated to a given vertex or edge of a graph, or even to the
-graph as a whole. Every |igraph| :class:`Graph`, vertex and edge behaves as a standard
-Python dictionary in some sense: you can add key-value pairs to any of them, with the key
-representing the name of your attribute (the only restriction is that it must be a string)
-and the value representing the attribute itself.
-
-.. warning::
-   Attributes can be arbitrary Python objects, but if you are saving graphs to a
-   file, only string and numeric attributes will be kept. See the :mod:`pickle` module in
-   the standard Python library if you are looking for a way to save other attribute types.
-   You can either pickle your attributes individually, store them as strings and save them,
-   or you can pickle the whole :class:`Graph` if you know that you want to load the graph
-   back into Python only.
-
-
-Let us create a simple imaginary social network the usual way by hand.
-
->>> g = Graph([(0,1), (0,2), (2,3), (3,4), (4,2), (2,5), (5,0), (6,3), (5,6)])
-
-Now, let us assume that we want to store the names, ages and genders of people in this network as
-vertex attributes, and for every connection, we want to store whether this is an informal
-friendship tie or a formal tie. Every :class:`Graph` object contains two special members
-called :attr:`~Graph.vs` and :attr:`~Graph.es`, standing for the sequence of all vertices
-and all edges, respectively. If you try to use :attr:`~Graph.vs` or :attr:`~Graph.es` as
-a Python dictionary, you will manipulate the attribute storage area of the graph:
-
->>> g.vs
-<igraph.VertexSeq object at 0x1b23b90>
->>> g.vs["name"] = ["Alice", "Bob", "Claire", "Dennis", "Esther", "Frank", "George"]
->>> g.vs["age"] = [25, 31, 18, 47, 22, 23, 50]
->>> g.vs["gender"] = ["f", "m", "f", "m", "f", "m", "m"]
->>> g.es["is_formal"] = [False, False, True, True, True, False, True, False, False]
-
-Whenever you use :attr:`~Graph.vs` or :attr:`~Graph.es` as a dictionary, you are assigning
-attributes to *all* vertices/edges of the graph. However, you can simply alter the attributes
-of vertices and edges individually by *indexing* :attr:`~Graph.vs` or :attr:`~Graph.es`
-with integers as if they were lists (remember, they are sequences, they contain all the
-vertices or all the edges). When you index them, you obtain a :class:`Vertex` or
-:class:`Edge` object, which refers to (I am sure you already guessed that) a single vertex
-or a single edge of the graph. :class:`Vertex` and :class:`Edge` objects can also be used
-as dictionaries to alter the attributes of that single vertex or edge:
-
->>> g.es[0]
-igraph.Edge(<igraph.Graph object at 0x4c87a0>,0,{'is_formal': False})
->>> g.es[0].attributes()
-{'is_formal': False}
->>> g.es[0]["is_formal"] = True
->>> g.es[0]
-igraph.Edge(<igraph.Graph object at 0x4c87a0>,0,{'is_formal': True})
-
-The above snippet illustrates that indexing an :class:`EdgeSeq` object returns
-:class:`Edge` objects; the representation above shows the graph the object belongs to,
-the edge ID (zero in our case) and the dictionary of attributes assigned to that edge.
-:class:`Edge` objects have some useful attributes, too: the :attr:`~Edge.source` property
-gives you the source vertex of that edge, :attr:`~Edge.target` gives you the target vertex,
-:attr:`~Edge.index` gives you the corresponding edge ID, :attr:`~Edge.tuple` gives you a
-tuple containing the source and target vertices and :meth:`~Edge.attributes` gives you
-a dictionary containing the attributes of this edge. :class:`Vertex` instances only have
-:attr:`~Vertex.index` and :meth:`~Vertex.attributes`.
-
-Since :attr:`Graph.es` always represents all the edges in a graph, indexing it by
-*i* will always return the edge with ID *i*, and of course the same applies
-to :attr:`Graph.vs`. However, keep in mind that an :class:`EdgeSeq` object *in general*
-does not necessarily represent the whole edge sequence of a graph;
-:ref:`later in this tutorial <querying_vertices_and_edges>`
-we will see methods that can filter :class:`EdgeSeq` objects and return other
-:class:`EdgeSeq` objects that are restricted to a subset of edges, and of course the same
-applies to :class:`VertexSeq` objects. But before we dive into that, let's see how we
-can assign attributes to the whole graph. Not too surprisingly, :class:`Graph` objects
-themselves can also behave as dictionaries:
-
->>> g["date"] = "2009-01-10"
->>> print g["date"]
-2009-01-10
-
-Finally, it should be mentioned that attributes can be deleted by the Python keyword
-``del`` just as you would do with any member of an ordinary dictionary:
-
->>> g.vs[3]["foo"] = "bar"
->>> g.vs["foo"]
-[None, None, None, 'bar', None, None, None]
->>> del g.vs["foo"]
->>> g.vs["foo"]
-Traceback (most recent call last):
-  File "<stdin>", line 25, in <module>
-KeyError: 'Attribute does not exist'
-
-Structural properties of graphs
-===============================
-
-Besides the simple graph and attribute manipulation routines described above,
-|igraph| provides a large set of methods to calculate various structural properties
-of graphs. It is beyond the scope of this tutorial to document all of them, hence
-this section will only introduce a few of them for illustrative purposes.
-We will work on the small social network we built in the previous section.
-
-Probably the simplest property one can think of is the :dfn:`vertex degree`. The
-degree of a vertex equals the number of edges adjacent to it. In case of directed
-networks, we can also define :dfn:`in-degree` (the number of edges pointing towards
-the vertex) and :dfn:`out-degree` (the number of edges originating from the vertex).
-|igraph| is able to calculate all of them using a simple syntax:
-
->>> g.degree()
-[3, 1, 4, 3, 2, 3, 2]
-
-If the graph was directed, we would have been able to calculate the in- and out-degrees
-separately using ``g.degree(type="in")`` and ``g.degree(type="out")``. You can
-also pass a single vertex ID or a list of vertex IDs to :meth:`~Graph.degree` if you
-want to calculate the degrees for only a subset of vertices:
-
->>> g.degree(6)
-2
->>> g.degree([2,3,4])
-[4, 3, 2]
-
-This calling convention applies to most of the structural properties |igraph| can
-calculate. For vertex properties, the methods accept a vertex ID or a list of vertex IDs
-(and if they are omitted, the default is the set of all vertices). For edge properties,
-the methods accept a single edge ID or a list of edge IDs. Instead of a list of IDs,
-you can also supply a :class:`VertexSeq` or an :class:`EdgeSeq` instance appropriately.
-Later in the :ref:`next chapter <querying_vertices_and_edges>`, you will learn how to
-restrict them to exactly the vertices or edges you want.
-
-.. note::
-
-  For some measures, it does not make sense to calculate them only for a few vertices
-  or edges instead of the whole graph, as it would take the same time anyway. In this
-  case, the methods won't accept vertex or edge IDs, but you can still restrict the
-  resulting list later using standard list indexing and slicing operators. One such
-  example is eigenvector centrality (:meth:`Graph.evcent()`).
-
-Besides degree, |igraph| includes built-in routines to calculate many other centrality
-properties, including vertex and edge betweenness (:meth:`Graph.betweenness`,
-:meth:`Graph.edge_betweenness`) or Google's PageRank (:meth:`Graph.pagerank`)
-just to name a few. Here we just illustrate edge betweenness:
-
->>> g.edge_betweenness()
-[6.0, 6.0, 4.0, 2.0, 4.0, 3.0, 4.0, 3.0. 4.0]
-
-Now we can also figure out which connections have the highest betweenness centrality
-with some Python magic:
-
->>> ebs = g.edge_betweenness()
->>> max_eb = max(ebs)
->>> [g.es[idx].tuple for idx, eb in enumerate(ebs) if eb == max_eb]
-[(0, 1), (0, 2)]
-
-Most structural properties can also be retrieved for a subset of vertices or edges
-or for a single vertex or edge by calling the appropriate method on the
-:class:`VertexSeq`, :class:`EdgeSeq`, :class:`Vertex` or :class:`Edge` object of
-interest:
-
->>> g.vs.degree()
-[3, 1, 4, 3, 2, 3, 2]
->>> g.es.edge_betweenness()
-[6.0, 6.0, 4.0, 2.0, 4.0, 3.0, 4.0, 3.0. 4.0]
->>> g.vs[2].degree()
-4
-
-.. _querying_vertices_and_edges:
-
-Querying vertices and edges based on attributes
-===============================================
-
-Selecting vertices and edges
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-Imagine that in a given social network, you would like to find out who has the largest
-degree or betweenness centrality. You can do that with the tools presented so far and
-some basic Python knowledge, but since it is a common task to select vertices and edges
-based on attributes or structural properties, |igraph| gives you an easier way to do that:
-
->>> g.vs.select(_degree = g.maxdegree())["name"]
-["Alice", "Bob"]
-
-The syntax may seem a little bit awkward for the first sight, so let's try to interpret
-it step by step. :meth:`~VertexSeq.select` is a method of :class:`VertexSeq` and its
-sole purpose is to filter a :class:`VertexSeq` based on the properties of individual
-vertices. The way it filters the vertices depends on its positional and keyword
-arguments. Positional arguments (the ones without an explicit name like
-``_degree`` above) are always processed before keyword arguments as follows:
-
-- If the first positional argument is ``None``, an empty sequence (containing no
-  vertices) is returned:
-
-  >>> seq = g.vs.select(None)
-  >>> len(seq)
-  0
-
-- If the first positional argument is a callable object (i.e., a function, a bound
-  method or anything that behaves like a function), the object will be called for
-  every vertex that's currently in the sequence. If the function returns ``True``,
-  the vertex will be included, otherwise it will be excluded:
-
-  >>> graph = Graph.Full(10)
-  >>> only_odd_vertices = graph.vs.select(lambda vertex: vertex.index % 2 == 1)
-  >>> len(only_odd_vertices)
-  5
-
-- If the first positional argument is an iterable (i.e., a list, a generator or
-  anything that can be iterated over), it *must* return integers and these integers
-  will be considered as indices into the current vertex set (which is *not* necessarily
-  the whole graph). Only those vertices that match the given indices will be included
-  in the filtered vertex set. Floats, strings, invalid vertex IDs will silently be
-  ignored:
-
-  >>> seq = graph.vs.select([2, 3, 7])
-  >>> len(seq)
-  3
-  >>> [v.index for v in seq]
-  [2, 3, 7]
-  >>> seq = seq.select([0, 2])         # filtering an existing vertex set
-  >>> [v.index for v in seq]
-  [2, 7]
-  >>> seq = graph.vs.select([2, 3, 7, "foo", 3.5])
-  >>> len(seq)
-  3
-
-- If the first positional argument is an integer, all remaining arguments are also
-  expected to be integers and they are interpreted as indices into the current vertex
-  set. This is just syntactic sugar, you could achieve an equivalent effect by
-  passing a list as the first positional argument, but this way you can omit the
-  square brackets:
-
-  >>> seq = graph.vs.select(2, 3, 7)
-  >>> len(seq)
-  3
-
-Keyword arguments can be used to filter the vertices based on their attributes
-or their structural properties. The name of each keyword argument should consist
-of at most two parts: the name of the attribute or structural property and the
-filtering operator. The operator can be omitted; in that case, we automatically
-assume the equality operator. The possibilities are as follows (where
-*name* denotes the name of the attribute or property):
-
-================ ================================================================
-Keyword argument Meaning
-================ ================================================================
-``name_eq``      The attribute/property value must be *equal to* the value of the
-                 keyword argument
----------------- ----------------------------------------------------------------
-``name_ne``      The attribute/property value must *not be equal to* the value of
-                 the keyword argument
----------------- ----------------------------------------------------------------
-``name_lt``      The attribute/property value must be *less than* the value of
-                 the keyword argument
----------------- ----------------------------------------------------------------
-``name_le``      The attribute/property value must be *less than or equal to* the
-                 value of the keyword argument
----------------- ----------------------------------------------------------------
-``name_gt``      The attribute/property value must be *greater than* the value of
-                 the keyword argument
----------------- ----------------------------------------------------------------
-``name_ge``      The attribute/property value must be *greater than or equal to*
-                 the value of the keyword argument
----------------- ----------------------------------------------------------------
-``name_in``      The attribute/property value must be *included in* the value of
-                 the keyword argument, which must be a sequence in this case
----------------- ----------------------------------------------------------------
-``name_notin``   The attribute/property value must *not be included in* the value
-                 of the the keyword argument, which must be a sequence in this
-                 case
-================ ================================================================
-
-For instance, the following command gives you people younger than 30 years in
-our imaginary social network:
-
->>> g.vs.select(age_lt=30)
-
-.. note::
-   Due to the syntactical constraints of Python, you cannot use the admittedly
-   simpler syntax of ``g.vs.select(age < 30)`` as only the equality operator is
-   allowed to appear in an argument list in Python.
-
-To save you some typing, you can even omit the :meth:`~VertexSeq.select` method if
-you wish:
-
->>> g.vs(age_lt=30)
-
-Theoretically, it can happen that there exists an attribute and a structural property
-with the same name (e.g., you could have a vertex attribute named ``degree``). In that
-case, we would not be able to decide whether the user meant ``degree`` as a structural
-property or as a vertex attribute. To resolve this ambiguity, structural property names
-*must* always be preceded by an underscore (``_``) when used for filtering. For example, to
-find vertices with degree larger than 2:
-
->>> g.vs(_degree_gt=2)
-
-There are also a few special structural properties for selecting edges:
-
-- Using ``_source`` or ``_from`` in the keyword argument list of :meth:`EdgeSeq.select`
-  filters based on the source vertices of the edges. E.g., to select all the edges
-  originating from Claire (who has vertex index 2):
-
-  >>> g.es.select(_source=2)
-  
-- Using ``_target`` or ``_to`` filters based on the target vertices. This is different
-  from ``_source`` and ``_from`` if the graph is directed.
-
-- ``_within`` takes a :class:`VertexSeq` object or a list or set of vertex indices
-  and selects all the edges that originate and terminate in the given vertex
-  set. For instance, the following expression selects all the edges between
-  Claire (vertex index 2), Dennis (vertex index 3) and Esther (vertex index 4):
-
-  >>> g.es.select(_within=[2,3,4])
-
-  We could also have used a :class:`VertexSeq` object:
-
-  >>> g.es.select(_within=g.vs[2:5])
-
-- ``_between`` takes a tuple consisting of two :class:`VertexSeq` objects or lists
-  containing vertex indices or :class:`Vertex` objects and selects all the edges that
-  originate in one of the sets and terminate in the other. E.g., to select all the
-  edges that connect men to women:
-
-  >>> men = g.vs.select(gender="m")
-  >>> women = g.vs.select(gender="f")
-  >>> g.es.select(_between=(men, women))
-
-Finding a single vertex or edge with some properties
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-In many cases we are looking for a single vertex or edge of a graph with some properties,
-and either we do not care which one of the matches is returned if there are multiple
-matches, or we know in advance that there will be only one match. A typical example is
-looking up vertices by their names in the ``name`` property. :class:`VertexSeq` and
-:class:`EdgeSeq` objects provide the :meth:`~VertexSeq.find` method for such use-cases.
-:meth:`~VertexSeq.find` works similarly to :meth:`~VertexSeq.select`, but it returns
-only the first match if there are multiple matches, and throws an exception if no
-match is found. For instance, to look up the vertex corresponding to Claire, one can
-do this:
-
->>> claire = g.vs.find(name="Claire")
->>> type(claire)
-igraph.Vertex
->>> claire.index
-2
-
-Looking up an unknown name will yield an exception:
-
->>> g.vs.find(name="Joe")
-Traceback (most recent call last):
-  File "<stdin>", line 1, in <module>
-ValueError: no such vertex
-
-Looking up vertices by names
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-Looking up vertices by names is a very common operation, and it is usually much easier
-to remember the names of the vertices in a graph than their IDs. To this end, |igraph|
-treats the ``name`` attribute of vertices specially; they are indexed such that vertices
-can be looked up by their names in amortized constant time. To make things even easier,
-|igraph| accepts vertex names (almost) anywhere where it expects vertex IDs, and also
-accepts collections (list, tuples etc) of vertex names anywhere where it expects lists
-of vertex IDs or :class:`VertexSeq` instances. E.g, you can simply look up the degree
-(number of connections) of Dennis as follows:
-
->>> g.degree("Dennis")
-3
-
-or, alternatively:
-
->>> g.vs.find("Dennis").degree()
-3
-
-The mapping between vertex names and IDs is maintained transparently by |igraph| in
-the background; whenever the graph changes, |igraph| also updates the internal mapping.
-However, uniqueness of vertex names is *not* enforced; you can easily create a graph
-where two vertices have the same name, but |igraph| will return only one of them when
-you look them up by names, the other one will be available only by its index.
-
-Treating a graph as an adjacency matrix
-=======================================
-
-TODO
-
-Layouts and plotting
-====================
-
-A graph is an abstract mathematical object without a specific representation in 2D or
-3D space. This means that whenever we want to visualise a graph, we have to find a
-mapping from vertices to coordinates in two- or three-dimensional space first,
-preferably in a way that is pleasing for the eye. A separate branch of graph theory,
-namely graph drawing, tries to solve this problem via several graph layout algorithms.
-|igraph| implements quite a few layout algorithms and is also able to draw them onto
-the screen or to a PDF, PNG or SVG file using the `Cairo library <http://www.cairographics.org>`_.
-
-.. important::
-   To follow the examples of this subsection, you need the Python bindings of the
-   Cairo library. The previous chapter (:ref:`installing-igraph`) tells you more
-   about how to install Cairo's Python bindings.
-
-Layout algorithms
-^^^^^^^^^^^^^^^^^
-
-The layout methods in |igraph| are to be found in the :class:`Graph` object, and their
-always start with ``layout_``. The following table summarises them:
-
-==================================== =============== =============================================
-Method name                          Short name      Algorithm description
-==================================== =============== =============================================
-``layout_circle``                    ``circle``,     Deterministic layout that places the
-                                     ``circular``    vertices on a circle
------------------------------------- --------------- ---------------------------------------------
-``layout_drl``                       ``drl``         The `Distributed Recursive Layout`_ algorithm
-                                                     for large graphs
------------------------------------- --------------- ---------------------------------------------
-``layout_fruchterman_reingold``      ``fr``          Fruchterman-Reingold force-directed algorithm
------------------------------------- --------------- ---------------------------------------------
-``layout_fruchterman_reingold_3d``   ``fr3d``,       Fruchterman-Reingold force-directed algorithm
-                                     ``fr_3d``       in three dimensions
------------------------------------- --------------- ---------------------------------------------
-``layout_grid_fruchterman_reingold`` ``grid_fr``     Fruchterman-Reingold force-directed algorithm
-                                                     with grid heuristics for large graphs
------------------------------------- --------------- ---------------------------------------------
-``layout_kamada_kawai``              ``kk``          Kamada-Kawai force-directed algorithm
------------------------------------- --------------- ---------------------------------------------
-``layout_kamada_kawai_3d``           ``kk3d``,       Kamada-Kawai force-directed algorithm
-                                     ``kk_3d``       in three dimensions
------------------------------------- --------------- ---------------------------------------------
-``layout_lgl``                       ``large``,      The `Large Graph Layout`_ algorithm for
-                                     ``lgl``,        large graphs
-                                     ``large_graph``
------------------------------------- --------------- ---------------------------------------------
-``layout_random``                    ``random``      Places the vertices completely randomly
------------------------------------- --------------- ---------------------------------------------
-``layout_random_3d``                 ``random_3d``   Places the vertices completely randomly in 3D
------------------------------------- --------------- ---------------------------------------------
-``layout_reingold_tilford``          ``rt``,         Reingold-Tilford tree layout, useful for
-                                     ``tree``        (almost) tree-like graphs
------------------------------------- --------------- ---------------------------------------------
-``layout_reingold_tilford_circular`` ``rt_circular`` Reingold-Tilford tree layout with a polar
-                                                     coordinate post-transformation, useful for
-                                     ``tree``        (almost) tree-like graphs
------------------------------------- --------------- ---------------------------------------------
-``layout_sphere``                    ``sphere``,     Deterministic layout that places the vertices
-                                     ``spherical``,  evenly on the surface of a sphere
-                                     ``circular``,
-                                     ``circular_3d``
-==================================== =============== =============================================
-
-.. _Distributed Recursive Layout: http://www.cs.sandia.gov/~smartin/software.html
-.. _Large Graph Layout: http://sourceforge.net/projects/lgl/
-
-Layout algorithms can either be called directly or using the common layout method called
-:meth:`~Graph.layout`:
-
->>> layout = g.layout_kamada_kawai()
->>> layout = g.layout("kamada_kawai")
-
-The first argument of the :meth:`~Graph.layout` method must be the short name of the
-layout algorithm (see the table above). All the remaining positional and keyword arguments
-are passed intact to the chosen layout method. For instance, the following two calls are
-completely equivalent:
-
->>> layout = g.layout_reingold_tilford(root=2)
->>> layout = g.layout("rt", 2)
-
-Layout methods return a :class:`Layout` object which behaves mostly like a list of lists.
-Each list entry in a :class:`Layout` object corresponds to a vertex in the original graph
-and contains the vertex coordinates in the 2D or 3D space. :class:`Layout` objects also
-contain some useful methods to translate, scale or rotate the coordinates in a batch.
-However, the primary utility of :class:`Layout` objects is that you can pass them to the
-:func:`plot` function along with the graph to obtain a 2D drawing.
-
-Drawing a graph using a layout
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-For instance, we can plot our imaginary social network with the Kamada-Kawai
-layout algorithm as follows:
-
->>> layout = g.layout("kk")
->>> plot(g, layout = layout)
-
-This should open an external image viewer showing a visual representation of the network,
-something like the one on the following figure (although the exact placement of
-nodes may be different on your machine since the layout is not deterministic):
-
-.. figure:: figures/tutorial_social_network_1.png
-   :alt: The visual representation of our social network
-   :align: center
-
-   Our social network with the Kamada-Kawai layout algorithm
-
-Hmm, this is not too pretty so far. A trivial addition would be to use the names as the
-vertex labels and to color the vertices according to the gender. Vertex labels are taken
-from the ``label`` attribute by default and vertex colors are determined by the
-``color`` attribute, so we can simply create these attributes and re-plot the graph:
-
->>> g.vs["label"] = g.vs["name"]
->>> color_dict = {"m": "blue", "f": "pink"}
->>> g.vs["color"] = [color_dict[gender] for gender in g.vs["gender"]]
->>> plot(g, layout = layout, bbox = (300, 300), margin = 20)
-
-Note that we are simply re-using the previous layout object here, but we also specified
-that we need a smaller plot (300 x 300 pixels) and a larger margin around the graph
-to fit the labels (20 pixels). The result is:
-
-.. figure:: figures/tutorial_social_network_2.png
-   :alt: The visual representation of our social network - with names and genders
-   :align: center
-
-   Our social network - with names as labels and genders as colors
-
-Instead of specifying the visual properties as vertex and edge attributes, you can
-also give them as keyword arguments to :func:`plot`:
-
->>> color_dict = {"m": "blue", "f": "pink"}
->>> plot(g, layout = layout, vertex_color = [color_dict[gender] for gender in g.vs["gender"]])
-
-This latter approach is preferred if you want to keep the properties of the visual
-representation of your graph separate from the graph itself. You can simply set up
-a Python dictionary containing the keyword arguments you would pass to :func:`plot`
-and then use the double asterisk (``**``) operator to pass your specific styling
-attributes to :func:`plot`::
-
->>> visual_style = {}
->>> visual_style["vertex_size"] = 20
->>> visual_style["vertex_color"] = [color_dict[gender] for gender in g.vs["gender"]]
->>> visual_style["vertex_label"] = g.vs["name"]
->>> visual_style["edge_width"] = [1 + 2 * int(is_formal) for is_formal in g.es["is_formal"]]
->>> visual_style["layout"] = layout
->>> visual_style["bbox"] = (300, 300)
->>> visual_style["margin"] = 20
->>> plot(g, **visual_style)
-
-The final plot shows the formal ties with thick lines while informal ones with thin lines:
-
-.. figure:: figures/tutorial_social_network_3.png
-   :alt: The visual representation of our social network - with names, genders and formal ties
-   :align: center
-
-   Our social network - also showing which ties are formal
-
-To sum it all up: there are special vertex and edge properties that correspond to
-the visual representation of the graph. These attributes override the default settings
-of |igraph| (see :ref:`configuring-igraph` for overriding the system-wide defaults).
-Furthermore, appropriate keyword arguments supplied to :func:`plot` override the
-visual properties provided by the vertex and edge attributes. The following two
-tables summarise the most frequently used visual attributes for vertices and edges,
-respectively:
-
-Vertex attributes controlling graph plots
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-=============== ====================== ==========================================
-Attribute name  Keyword argument       Purpose
-=============== ====================== ==========================================
-``color``       ``vertex_color``       Color of the vertex
---------------- ---------------------- ------------------------------------------
-``label``       ``vertex_label``       Label of the vertex
---------------- ---------------------- ------------------------------------------
-``label_angle`` ``vertex_label_angle`` The placement of the vertex label on the
-                                       circle around the vertex. This is an angle
-                                       in radians, with zero belonging to the
-                                       right side of the vertex.
---------------- ---------------------- ------------------------------------------
-``label_color`` ``vertex_label_color`` Color of the vertex label
---------------- ---------------------- ------------------------------------------
-``label_dist``  ``vertex_label_dist``  Distance of the vertex label from the
-                                       vertex itself, relative to the vertex size
---------------- ---------------------- ------------------------------------------
-``label_size``  ``vertex_label_size``  Font size of the vertex label
---------------- ---------------------- ------------------------------------------
-``order``       ``vertex_order``       Drawing order of the vertices. Vertices
-                                       with a smaller order parameter will be
-                                       drawn first.
---------------- ---------------------- ------------------------------------------
-``shape``       ``vertex_shape``       Shape of the vertex. Known shapes are:
-                                       ``rectangle``, ``circle``, ``hidden``,
-                                       ``triangle-up``, ``triangle-down``.
-                                       Several aliases are also accepted, see
-                                       :data:`drawing.known_shapes`.
---------------- ---------------------- ------------------------------------------
-``size``        ``vertex_size``        Size of the vertex in pixels
-=============== ====================== ==========================================
-
-
-Edge attributes controlling graph plots
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-=============== ====================== ==========================================
-Attribute name  Keyword argument       Purpose
-=============== ====================== ==========================================
-``color``       ``edge_color``         Color of the edge
---------------- ---------------------- ------------------------------------------
-``curved``      ``edge_curved``        The curvature of the edge. Positive values
-                                       correspond to edges curved in CCW
-                                       direction, negative numbers correspond to
-                                       edges curved in clockwise (CW) direction.
-                                       Zero represents straight edges. ``True``
-                                       is interpreted as 0.5, ``False`` is
-                                       interpreted as zero. This is useful to
-                                       make multiple edges visible. See also the
-                                       ``autocurve`` keyword argument to
-                                       :func:`plot`.
---------------- ---------------------- ------------------------------------------
-``arrow_size``  ``edge_arrow_size``    Size (length) of the arrowhead on the edge
-                                       if the graph is directed, relative to 15
-                                       pixels.
---------------- ---------------------- ------------------------------------------
-``arrow_width`` ``edge_arrow_width``   Width of the arrowhead on the edge if the
-                                       graph is directed, relative to 10 pixels.
---------------- ---------------------- ------------------------------------------
-``width``       ``edge_width``         Width of the edge in pixels
-=============== ====================== ==========================================
-
-
-Generic keyword arguments of ``plot()``
-^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-These settings can be specified as keyword arguments to the ``plot()`` function
-to control the overall appearance of the plot.
-
-================ ================================================================
-Keyword argument Purpose
-================ ================================================================
-``autocurve``    Whether to determine the curvature of the edges automatically in
-                 graphs with multiple edges. The default is ``True`` for graphs
-                 with less than 10.000 edges and ``False`` otherwise.
----------------- ----------------------------------------------------------------
-``bbox``         The bounding box of the plot. This must be a tuple containing
-                 the desired width and height of the plot. The default plot is
-                 600 pixels wide and 600 pixels high.
----------------- ----------------------------------------------------------------
-``layout``       The layout to be used. It can be an instance of :class:`Layout`,
-                 a list of tuples containing X-Y coordinates, or the name of a
-                 layout algorithm. The default is ``auto``, which selects a
-                 layout algorithm automatically based on the size and
-                 connectedness of the graph.
----------------- ----------------------------------------------------------------
-``margin``       The top, right, bottom and left margins of the plot in pixels.
-                 This argument must be a list or tuple and its elements will be
-                 re-used if you specify a list or tuple with less than four
-                 elements.
-================ ================================================================
-
-Specifying colors in plots
-^^^^^^^^^^^^^^^^^^^^^^^^^^
-
-|igraph| understands the following color specifications wherever it expects a
-color (e.g., edge, vertex or label colors in the respective attributes):
-
-X11 color names
-    See the `list of X11 color names <http://en.wikipedia.org/wiki/X11_color_names>`_
-    in Wikipedia for the complete list.
-
-Color specification in CSS syntax
-    This is a string according to one of the following formats (where *R*, *G* and
-    *B* denote the red, green and blue components, respectively):
-
-      - ``#RRGGBB``, components range from 0 to 255 in hexadecimal format.
-        Example: ``"#0088ff"``.
-      - ``#RGB``, components range from 0 to 15 in hexadecimal format. Example:
-        ``"#08f"``.
-      - ``rgb(R, G, B)``, components range from 0 to 255 or from 0% to
-        100%. Example: ``"rgb(0, 127, 255)"`` or ``"rgb(0%, 50%, 100%)"``.
-
-List, tuple or whitespace-separated string of RGB values
-    Example: ``(255, 128, 0)``, ``[255, 128, 0]`` or ``"255, 128, 0"``.
-
-
-Saving plots
-^^^^^^^^^^^^
-
-|igraph| can be used to create publication-quality plots by asking the :func:`plot`
-function to save the plot into a file instead of showing it on a screen. This can
-be done simply by passing the target filename as an additional argument after the
-graph itself. The preferred format is inferred from the extension. |igraph| can
-save to anything that is supported by Cairo, including SVG, PDF and PNG files.
-SVG or PDF files can then later be converted to PostScript (``.ps``) or Encapsulated
-PostScript (``.eps``) format if you prefer that, while PNG files can be converted to
-TIF (``.tif``)::
-
->>> plot(g, "social_network.pdf", **visual_style)
-
-
-|igraph| and the outside world
-==============================
-
-No graph module would be complete without some kind of import/export functionality
-that enables the package to communicate with external programs and toolkits. |igraph|
-is no exception: it provides functions to read the most common graph formats and
-to save :class:`Graph` objects into files obeying these format specifications.
-The following table summarises the formats |igraph| can read or write:
-
-================ ============= ============================ =============================
-Format           Short name    Reader method                Writer method
-================ ============= ============================ =============================
-Adjacency list   ``lgl``       :meth:`Graph.Read_Lgl`       :meth:`Graph.write_lgl`
-(a.k.a. `LGL`_)
----------------- ------------- ---------------------------- -----------------------------
-Adjacency matrix ``adjacency`` :meth:`Graph.Read_Adjacency` :meth:`Graph.write_adjacency`
----------------- ------------- ---------------------------- -----------------------------
-DIMACS           ``dimacs``    :meth:`Graph.Read_DIMACS`    :meth:`Graph.write_dimacs`
----------------- ------------- ---------------------------- -----------------------------
-DL               ``dl``        :meth:`Graph.Read_DL`        not supported yet
----------------- ------------- ---------------------------- -----------------------------
-Edge list        ``edgelist``, :meth:`Graph.Read_Edgelist`  :meth:`Graph.write_edgelist`
-                 ``edges``,
-                 ``edge``
----------------- ------------- ---------------------------- -----------------------------
-`GraphViz`_      ``graphviz``, not supported yet            :meth:`Graph.write_dot`
-                 ``dot``
----------------- ------------- ---------------------------- -----------------------------
-GML              ``gml``       :meth:`Graph.Read_GML`       :meth:`Graph.write_gml`
----------------- ------------- ---------------------------- -----------------------------
-GraphML          ``graphml``   :meth:`Graph.Read_GraphML`   :meth:`Graph.write_graphml`
----------------- ------------- ---------------------------- -----------------------------
-Gzipped GraphML  ``graphmlz``  :meth:`Graph.Read_GraphMLz`  :meth:`Graph.write_graphmlz`
----------------- ------------- ---------------------------- -----------------------------
-LEDA             ``leda``      not supported yet            :meth:`Graph.write_leda`
----------------- ------------- ---------------------------- -----------------------------
-Labeled edgelist ``ncol``      :meth:`Graph.Read_Ncol`      :meth:`Graph.write_ncol`
-(a.k.a. `NCOL`_)
----------------- ------------- ---------------------------- -----------------------------
-`Pajek`_ format  ``pajek``,    :meth:`Graph.Read_Pajek`     :meth:`Graph.write_pajek`
-                 ``net``
----------------- ------------- ---------------------------- -----------------------------
-Pickled graph    ``pickle``    :meth:`Graph.Read_Pickle`    :meth:`Graph.write_pickle`
-================ ============= ============================ =============================
-
-.. _GraphViz: http://www.graphviz.org
-.. _LGL: http://lgl.sourceforge.net/#FileFormat
-.. _NCOL: http://lgl.sourceforge.net/#FileFormat
-.. _Pajek: http://pajek.imfm.si/doku.php
-
-As an exercise, download the graph representation of the well-known
-`Zachary karate club study <http://igraph.sourceforge.net/karate.net>`_, save it to
-a folder and try to load it into |igraph|. Since it is a Pajek network file, you
-must use the Pajek reader method from the table above (make sure you use the
-appropriate path to the downloaded file):
-
->>> karate = Graph.Read_Pajek("karate.net")
->>> summary(karate)
-IGRAPH UNW- 34 78 -- Zachary's karate club network
-+ attr: Author (g), Citation (g), name (g), Faction (v), id (v), name (v), weight (e)
-
-If you want to convert the very same graph into GraphML, you can do it with the
-GraphML writer method from the table above:
-
->>> karate.write_graphml("karate.graphml")
-
-.. note:: Most of the formats have their own limitations; for instance, not all of
-   them can store attributes. Your best bet is probably GraphML or GML if you
-   want to save |igraph| graphs in a format that can be read from an external
-   package and you want to preserve numeric and string attributes. Edge list and
-   NCOL is also fine if you don't have attributes (NCOL supports vertex names and
-   edge weights, though). If you don't want to use your graphs outside |igraph|
-   but you want to store them for a later session, the pickled graph format
-   ensures that you get exactly the same graph back. The pickled graph format
-   uses Python's ``pickle`` module to store and read graphs.
-
-There are two helper methods as well: :func:`load` is a generic entry point for
-reader methods which tries to infer the appropriate format from the file extension.
-:meth:`Graph.save` is the opposite of :func:`load`: it lets you save a graph where
-the preferred format is again inferred from the extension. The format detection of
-:func:`load` and :meth:`Graph.save` can be overridden by the ``format`` keyword
-argument which accepts the short names of the formats from the above table:
-
->>> karate = load("karate.net")
->>> karate.save("karate.graphml")
->>> karate.save("karate.my_extension", format="gml")
-
-
-Where to go next
-================
-
-This tutorial was only scratching the surface of what |igraph| can do.  My
-long-term plans are to extend this tutorial into a proper manual-style
-documentation to |igraph| in the next chapters. In the meanwhile, check out the
-full `API documentation`_ which should provide information about almost every
-|igraph| class, function or method. A good starting point is the documentation
-of the `Graph class`_. Should you get stuck, drop a mail to the `igraph mailing
-list`_ - maybe there is someone out there who can help you out immediately.
-
-.. _API documentation: http://igraph.sourceforge.net/doc/python/
-.. _Graph class: http://igraph.sourceforge.net/doc/python/igraph.Graph-class.html
-.. _igraph mailing list: http://lists.nongnu.org/mailman/listinfo/igraph-help
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/__init__.py igraph-0.6.5/interfaces/python/igraph/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,3870 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-IGraph library.
-
-@undocumented: deprecated, _graphmethod, _add_proxy_methods, _layout_method_wrapper,
-               _3d_version_for
-"""
-
-from __future__ import with_statement
-
-__license__ = u"""
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-# pylint: disable-msg=W0401
-# W0401: wildcard import
-from igraph._igraph import *
-from igraph._igraph import __version__, __build_date__
-from igraph.clustering import *
-from igraph.cut import *
-from igraph.configuration import Configuration
-from igraph.drawing import *
-from igraph.drawing.colors import *
-from igraph.datatypes import *
-from igraph.formula import *
-from igraph.layout import *
-from igraph.matching import *
-from igraph.nexus import *
-from igraph.remote import *
-from igraph.statistics import *
-from igraph.summary import *
-from igraph.utils import *
-
-import os
-import math
-import gzip
-import sys
-import operator
-
-from collections import defaultdict
-from itertools import izip
-from tempfile import mkstemp
-from warnings import warn
-
-def deprecated(message):
-    """Prints a warning message related to the deprecation of some igraph
-    feature."""
-    warn(message, DeprecationWarning, stacklevel=3)
-
-# pylint: disable-msg=E1101
-class Graph(GraphBase):
-    """Generic graph.
-    
-    This class is built on top of L{GraphBase}, so the order of the
-    methods in the Epydoc documentation is a little bit obscure:
-    inherited methods come after the ones implemented directly in the
-    subclass. L{Graph} provides many functions that L{GraphBase} does not,
-    mostly because these functions are not speed critical and they were
-    easier to implement in Python than in pure C. An example is the
-    attribute handling in the constructor: the constructor of L{Graph}
-    accepts three dictionaries corresponding to the graph, vertex and edge
-    attributes while the constructor of L{GraphBase} does not. This extension
-    was needed to make L{Graph} serializable through the C{pickle} module.
-    L{Graph} also overrides some functions from L{GraphBase} to provide a
-    more convenient interface; e.g., layout functions return a L{Layout}
-    instance from L{Graph} instead of a list of coordinate pairs.
-
-    Graphs can also be indexed by strings or pairs of vertex indices or vertex
-    names.  When a graph is indexed by a string, the operation translates to
-    the retrieval, creation, modification or deletion of a graph attribute:
-
-      >>> g = Graph.Full(3)
-      >>> g["name"] = "Triangle graph"
-      >>> g["name"]
-      'Triangle graph'
-      >>> del g["name"]
-
-    When a graph is indexed by a pair of vertex indices or names, the graph
-    itself is treated as an adjacency matrix and the corresponding cell of
-    the matrix is returned:
-
-      >>> g = Graph.Full(3)
-      >>> g.vs["name"] = ["A", "B", "C"]
-      >>> g[1, 2]
-      1
-      >>> g["A", "B"]
-      1
-      >>> g["A", "B"] = 0
-      >>> g.ecount()
-      2
-    
-    Assigning values different from zero or one to the adjacency matrix will
-    be translated to one, unless the graph is weighted, in which case the
-    numbers will be treated as weights:
-
-      >>> g.is_weighted()
-      False
-      >>> g["A", "B"] = 2
-      >>> g["A", "B"]
-      1
-      >>> g.es["weight"] = 1.0
-      >>> g.is_weighted()
-      True
-      >>> g["A", "B"] = 2
-      >>> g["A", "B"]
-      2
-      >>> g.es["weight"]
-      [1.0, 1.0, 2]
-    """
-
-    # Some useful aliases
-    omega = GraphBase.clique_number
-    alpha = GraphBase.independence_number
-    shell_index = GraphBase.coreness
-    cut_vertices = GraphBase.articulation_points
-    blocks = GraphBase.biconnected_components
-    evcent = GraphBase.eigenvector_centrality
-    vertex_disjoint_paths = GraphBase.vertex_connectivity
-    edge_disjoint_paths = GraphBase.edge_connectivity
-    cohesion = GraphBase.vertex_connectivity
-    adhesion = GraphBase.edge_connectivity
-
-    # Compatibility aliases
-    shortest_paths_dijkstra = GraphBase.shortest_paths
-    subgraph = GraphBase.induced_subgraph
-
-    def __init__(self, *args, **kwds):
-        """__init__(n=None, edges=None, directed=None, graph_attrs=None,
-        vertex_attrs=None, edge_attrs=None)
-        
-        Constructs a graph from scratch.
-
-        @keyword n: the number of vertices. Can be omitted, the default is
-          zero.
-        @keyword edges: the edge list where every list item is a pair of
-          integers. If any of the integers is larger than M{n-1}, the number
-          of vertices is adjusted accordingly.
-        @keyword directed: whether the graph should be directed
-        @keyword graph_attrs: the attributes of the graph as a dictionary.
-        @keyword vertex_attrs: the attributes of the vertices as a dictionary.
-          Every dictionary value must be an iterable with exactly M{n} items.
-        @keyword edge_attrs: the attributes of the edges as a dictionary. Every
-          dictionary value must be an iterable with exactly M{m} items where
-          M{m} is the number of edges.
-        """
-        # Set up default values for the parameters. This should match the order
-        # in *args
-        kwd_order = ["n", "edges", "directed", "graph_attrs", "vertex_attrs", \
-                "edge_attrs"]
-        params = [0, [], False, {}, {}, {}]
-        # If the first argument is a list, assume that the number of vertices
-        # were omitted
-        args = list(args)
-        if len(args) > 0:
-            if isinstance(args[0], list) or isinstance(args[0], tuple):
-                args.insert(0, params[0])
-        # Override default parameters from args
-        params[:len(args)] = args
-        # Override default parameters from keywords
-        for idx, k in enumerate(kwd_order):
-            if k in kwds:
-                params[idx] = kwds[k]
-        # Now, translate the params list to argument names
-        nverts, edges, directed, graph_attrs, vertex_attrs, edge_attrs = params
-
-        # Initialize the graph
-        GraphBase.__init__(self, nverts, edges, directed)
-        # Set the graph attributes
-        for key, value in graph_attrs.iteritems():
-            if isinstance(key, (int, long)):
-                key = str(key)
-            self[key] = value
-        # Set the vertex attributes
-        for key, value in vertex_attrs.iteritems():
-            if isinstance(key, (int, long)):
-                key = str(key)
-            self.vs[key] = value
-        # Set the edge attributes
-        for key, value in edge_attrs.iteritems():
-            if isinstance(key, (int, long)):
-                key = str(key)
-            self.es[key] = value
-
-    def add_edge(self, source, target, **kwds):
-        """add_edge(source, target, **kwds)
-
-        Adds a single edge to the graph.
-
-        Keyword arguments (except the source and target arguments) will be
-        assigned to the edge as attributes.
-
-        @param source: the source vertex of the edge or its name.
-        @param target: the target vertex of the edge or its name.
-        """
-        if not kwds:
-            return self.add_edges([(source, target)])
-
-        eid = self.ecount()
-        result = self.add_edges([(source, target)])
-        edge = self.es[eid]
-        for key, value in kwds.iteritems():
-            edge[key] = value
-        return result
-
-    def add_edges(self, es):
-        """add_edges(es)
-
-        Adds some edges to the graph.
-
-        @param es: the list of edges to be added. Every edge is represented
-          with a tuple containing the vertex IDs or names of the two
-          endpoints. Vertices are enumerated from zero. It is allowed to
-          use a single tuple containing two vertex IDs here instead of a
-          list, but this is deprecated from igraph 0.6 and will be removed
-          from 0.7.
-
-        @deprecated: this method will not accept a single pair of vertex IDs
-          as an argument from igraph 0.7. Use L{add_edge()} instead to add
-          a single edge.
-        """
-        if isinstance(es, tuple) and len(es) == 2:
-            deprecated("Graph.add_edges() will not accept a single integer pair "
-                    "from igraph 0.7. Use Graph.add_edge() instead.")
-
-            return GraphBase.add_edges(self, [es])
-        return GraphBase.add_edges(self, es)
-
-    def add_vertex(self, name=None, **kwds):
-        """add_vertex(name=None, **kwds)
-
-        Adds a single vertex to the graph. Keyword arguments will be assigned
-        as vertex attributes. Note that C{name} as a keyword argument is treated
-        specially; if a graph has C{name} as a vertex attribute, it allows one
-        to refer to vertices by their names in most places where igraph expects
-        a vertex ID.
-        """
-        if not kwds and name is None:
-            return self.add_vertices(1)
-
-        vid = self.vcount()
-        result = self.add_vertices(1)
-        vertex = self.vs[vid]
-        for key, value in kwds.iteritems():
-            vertex[key] = value
-        if name is not None:
-            vertex["name"] = name
-        return result
-
-    def add_vertices(self, n):
-        """add_vertices(n)
-
-        Adds some vertices to the graph.
-
-        @param n: the number of vertices to be added, or the name of a single
-          vertex to be added, or an iterable of strings, each corresponding to the
-          name of a vertex to be added. Names will be assigned to the C{name}
-          vertex attribute.
-        """
-        if isinstance(n, basestring):
-            # Adding a single vertex with a name
-            m = self.vcount()
-            result = GraphBase.add_vertices(self, 1)
-            self.vs[m]["name"] = n
-            return result
-        elif hasattr(n, "__iter__"):
-            m = self.vcount()
-            if not hasattr(n, "__len__"):
-                names = list(n)
-            else:
-                names = n
-            result = GraphBase.add_vertices(self, len(names))
-            self.vs[m:]["name"] = names
-            return result
-        return GraphBase.add_vertices(self, n)
-
-    def adjacent(self, *args, **kwds):
-        """adjacent(vertex, mode=OUT)
-
-        Returns the edges a given vertex is incident on.
-
-        @deprecated: replaced by L{Graph.incident()} since igraph 0.6
-        """
-        deprecated("Graph.adjacent() is deprecated since igraph 0.6, please use "
-                   "Graph.incident() instead")
-        return self.incident(*args, **kwds)
-
-    def as_directed(self, *args, **kwds):
-        """as_directed(*args, **kwds)
-
-        Returns a directed copy of this graph. Arguments are passed on
-        to L{Graph.to_directed()} that is invoked on the copy.
-        """
-        copy = self.copy()
-        copy.to_directed(*args, **kwds)
-        return copy
-
-    def as_undirected(self, *args, **kwds):
-        """as_undirected(*args, **kwds)
-
-        Returns an undirected copy of this graph. Arguments are passed on
-        to L{Graph.to_undirected()} that is invoked on the copy.
-        """
-        copy = self.copy()
-        copy.to_undirected(*args, **kwds)
-        return copy
-
-    def delete_edges(self, *args, **kwds):
-        """Deletes some edges from the graph.
-
-        The set of edges to be deleted is determined by the positional and
-        keyword arguments. If any keyword argument is present, or the
-        first positional argument is callable, an edge
-        sequence is derived by calling L{EdgeSeq.select} with the same
-        positional and keyword arguments. Edges in the derived edge sequence
-        will be removed. Otherwise the first positional argument is considered
-        as follows:
-
-          - C{None} - deletes all edges
-          - a single integer - deletes the edge with the given ID
-          - a list of integers - deletes the edges denoted by the given IDs
-          - a list of 2-tuples - deletes the edges denoted by the given
-            source-target vertex pairs. When multiple edges are present
-            between a given source-target vertex pair, only one is removed.
-        """
-        if len(args) == 0 and len(kwds) == 0:
-            raise ValueError("expected at least one argument")
-        if len(kwds)>0 or (hasattr(args[0], "__call__") and \
-                not isinstance(args[0], EdgeSeq)):
-            edge_seq = self.es(*args, **kwds)
-        else:
-            edge_seq = args[0]
-        return GraphBase.delete_edges(self, edge_seq)
-
-
-    def indegree(self, *args, **kwds):
-        """Returns the in-degrees in a list.
-        
-        See L{degree} for possible arguments.
-        """
-        kwds['mode'] = IN
-        return self.degree(*args, **kwds)
-
-    def outdegree(self, *args, **kwds):
-        """Returns the out-degrees in a list.
-        
-        See L{degree} for possible arguments.
-        """
-        kwds['mode'] = OUT
-        return self.degree(*args, **kwds)
-
-    def all_st_cuts(self, source, target):
-        """\
-        Returns all the cuts between the source and target vertices in a
-        directed graph.
-
-        This function lists all edge-cuts between a source and a target vertex.
-        Every cut is listed exactly once.
-
-        @param source: the source vertex ID
-        @param target: the target vertex ID
-        @return: a list of L{Cut} objects.
-
-        @newfield ref: Reference
-        @ref: JS Provan and DR Shier: A paradigm for listing (s,t)-cuts in
-          graphs. Algorithmica 15, 351--372, 1996.
-        """
-        return [Cut(self, cut=cut, partition=part)
-                for cut, part in izip(*GraphBase.all_st_cuts(self, source, target))]
-
-    def all_st_mincuts(self, source, target, capacity=None):
-        """\
-        Returns all the mincuts between the source and target vertices in a
-        directed graph.
-
-        This function lists all minimum edge-cuts between a source and a target
-        vertex.
-
-        @param source: the source vertex ID
-        @param target: the target vertex ID
-        @param capacity: the edge capacities (weights). If C{None}, all
-          edges have equal weight. May also be an attribute name.
-        @return: a list of L{Cut} objects.
-
-        @newfield ref: Reference
-        @ref: JS Provan and DR Shier: A paradigm for listing (s,t)-cuts in
-          graphs. Algorithmica 15, 351--372, 1996.
-        """
-        value, cuts, parts = GraphBase.all_st_mincuts(self, source, target, capacity)
-        return [Cut(self, value, cut=cut, partition=part)
-                for cut, part in izip(cuts, parts)]
-
-    def biconnected_components(self, return_articulation_points=False):
-        """\
-        Calculates the biconnected components of the graph.
-        
-        @param return_articulation_points: whether to return the articulation
-          points as well
-        @return: a L{VertexCover} object describing the biconnected components,
-          and optionally the list of articulation points as well
-        """
-        if return_articulation_points:
-            trees, aps = GraphBase.biconnected_components(self, True)
-        else:
-            trees = GraphBase.biconnected_components(self, False)
-
-        clusters = []
-        for tree in trees:
-            cluster = set()
-            for edge in self.es[tree]:
-                cluster.update(edge.tuple)
-            clusters.append(cluster)
-        clustering = VertexCover(self, clusters)
-
-        if return_articulation_points:
-            return clustering, aps
-        else:
-            return clustering
-    blocks = biconnected_components
-
-    def cohesive_blocks(self):
-        """cohesive_blocks()
-
-        Calculates the cohesive block structure of the graph.
-
-        Cohesive blocking is a method of determining hierarchical subsets of graph
-        vertices based on their structural cohesion (i.e. vertex connectivity).
-        For a given graph G, a subset of its vertices S is said to be maximally
-        k-cohesive if there is no superset of S with vertex connectivity greater
-        than or equal to k. Cohesive blocking is a process through which, given a
-        k-cohesive set of vertices, maximally l-cohesive subsets are recursively
-        identified with l > k. Thus a hierarchy of vertex subsets is obtained in
-        the end, with the entire graph G at its root.
-
-        @return: an instance of L{CohesiveBlocks}. See the documentation of
-          L{CohesiveBlocks} for more information.
-        @see: L{CohesiveBlocks}
-        """
-        return CohesiveBlocks(self, *GraphBase.cohesive_blocks(self))
-
-    def clusters(self, mode=STRONG):
-        """clusters(mode=STRONG)
-
-        Calculates the (strong or weak) clusters (connected components) for
-        a given graph.
-
-        @param mode: must be either C{STRONG} or C{WEAK}, depending on the
-          clusters being sought. Optional, defaults to C{STRONG}.
-        @return: a L{VertexClustering} object"""
-        return VertexClustering(self, GraphBase.clusters(self, mode))
-    components = clusters
-
-    def degree_distribution(self, bin_width = 1, *args, **kwds):
-        """degree_distribution(bin_width=1, ...)
-
-        Calculates the degree distribution of the graph.
-
-        Unknown keyword arguments are directly passed to L{degree()}.
-
-        @param bin_width: the bin width of the histogram
-        @return: a histogram representing the degree distribution of the
-          graph.
-        """
-        result = Histogram(bin_width, self.degree(*args, **kwds))
-        return result
-
-    def dyad_census(self, *args, **kwds):
-        """dyad_census()
-
-        Calculates the dyad census of the graph.
-
-        Dyad census means classifying each pair of vertices of a directed
-        graph into three categories: mutual (there is an edge from I{a} to
-        I{b} and also from I{b} to I{a}), asymmetric (there is an edge
-        from I{a} to I{b} or from I{b} to I{a} but not the other way round)
-        and null (there is no connection between I{a} and I{b}).
-
-        @return: a L{DyadCensus} object.
-        @newfield ref: Reference
-        @ref: Holland, P.W. and Leinhardt, S.  (1970).  A Method for Detecting
-          Structure in Sociometric Data.  American Journal of Sociology, 70,
-          492-513.
-        """
-        return DyadCensus(GraphBase.dyad_census(self, *args, **kwds))
-
-    def get_adjacency(self, type=GET_ADJACENCY_BOTH, attribute=None, \
-            default=0, eids=False):
-        """Returns the adjacency matrix of a graph.
-
-        @param type: either C{GET_ADJACENCY_LOWER} (uses the lower
-          triangle of the matrix) or C{GET_ADJACENCY_UPPER}
-          (uses the upper triangle) or C{GET_ADJACENCY_BOTH}
-          (uses both parts). Ignored for directed graphs.
-        @param attribute: if C{None}, returns the ordinary adjacency
-          matrix. When the name of a valid edge attribute is given
-          here, the matrix returned will contain the default value 
-          at the places where there is no edge or the value of the
-          given attribute where there is an edge. Multiple edges are
-          not supported, the value written in the matrix in this case
-          will be unpredictable. This parameter is ignored if
-          I{eids} is C{True}
-        @param default: the default value written to the cells in the
-          case of adjacency matrices with attributes.
-        @param eids: specifies whether the edge IDs should be returned
-          in the adjacency matrix. Since zero is a valid edge ID, the
-          cells in the matrix that correspond to unconnected vertex
-          pairs will contain -1 instead of 0 if I{eids} is C{True}.
-          If I{eids} is C{False}, the number of edges will be returned
-          in the matrix for each vertex pair.
-        @return: the adjacency matrix as a L{Matrix}.
-        """
-        if type != GET_ADJACENCY_LOWER and type != GET_ADJACENCY_UPPER and \
-          type != GET_ADJACENCY_BOTH:
-            # Maybe it was called with the first argument as the attribute name
-            type, attribute = attribute, type
-            if type is None:
-                type = GET_ADJACENCY_BOTH
-
-        if eids:
-            result = Matrix(GraphBase.get_adjacency(self, type, eids))
-            result -= 1
-            return result
-
-        if attribute is None: 
-            return Matrix(GraphBase.get_adjacency(self, type))
-
-        if attribute not in self.es.attribute_names():
-            raise ValueError("Attribute does not exist")
-
-        data = [[default] * self.vcount() for _ in xrange(self.vcount())]
-
-        if self.is_directed():
-            for edge in self.es:
-                data[edge.source][edge.target] = edge[attribute]
-            return Matrix(data)
-
-        if type == GET_ADJACENCY_BOTH:
-            for edge in self.es:
-                source, target = edge.tuple
-                data[source][target] = edge[attribute]
-                data[target][source] = edge[attribute]
-        elif type == GET_ADJACENCY_UPPER:
-            for edge in self.es:
-                data[min(edge.tuple)][max(edge.tuple)] = edge[attribute]
-        else:
-            for edge in self.es:
-                data[max(edge.tuple)][min(edge.tuple)] = edge[attribute]
-
-        return Matrix(data)
-
-
-    def get_adjlist(self, mode=OUT):
-        """get_adjlist(mode=OUT)
-
-        Returns the adjacency list representation of the graph.
-
-        The adjacency list representation is a list of lists. Each item of the
-        outer list belongs to a single vertex of the graph. The inner list
-        contains the neighbors of the given vertex.
-
-        @param mode: if L{OUT}, returns the successors of the vertex. If
-          L{IN}, returns the predecessors of the vertex. If L{ALL}, both
-          the predecessors and the successors will be returned. Ignored
-          for undirected graphs.
-        """
-        return [self.neighbors(idx, mode) for idx in xrange(self.vcount())]
-
-    def get_adjedgelist(self, *args, **kwds):
-        """get_adjedgelist(mode=OUT)
-
-        Returns the incidence list representation of the graph.
-
-        @deprecated: replaced by L{Graph.get_inclist()} since igraph 0.6
-        @see: Graph.get_inclist()
-        """
-        deprecated("Graph.get_adjedgelist() is deprecated since igraph 0.6, "
-                   "please use Graph.get_inclist() instead")
-        return self.get_inclist(*args, **kwds)
-
-    def get_inclist(self, mode=OUT):
-        """get_inclist(mode=OUT)
-
-        Returns the incidence list representation of the graph.
-
-        The incidence list representation is a list of lists. Each
-        item of the outer list belongs to a single vertex of the graph.
-        The inner list contains the IDs of the incident edges of the
-        given vertex.
-
-        @param mode: if L{OUT}, returns the successors of the vertex. If
-          L{IN}, returns the predecessors of the vertex. If L{ALL}, both
-          the predecessors and the successors will be returned. Ignored
-          for undirected graphs.
-        """
-        return [self.incident(idx, mode) for idx in xrange(self.vcount())]
-
-    def is_named(self):
-        """is_named()
-
-        Returns whether the graph is named, i.e. whether it has a "name"
-        vertex attribute.
-        """
-        return "name" in self.vertex_attributes()
-
-    def is_weighted(self):
-        """is_weighted()
-
-        Returns whether the graph is weighted, i.e. whether it has a "weight"
-        edge attribute.
-        """
-        return "weight" in self.edge_attributes()
-
-    def maxflow(self, source, target, capacity=None):
-        """maxflow(source, target, capacity=None)
-
-        Returns a maximum flow between the given source and target vertices
-        in a graph.
-
-        A maximum flow from I{source} to I{target} is an assignment of
-        non-negative real numbers to the edges of the graph, satisfying
-        two properties:
-
-            1. For each edge, the flow (i.e. the assigned number) is not
-               more than the capacity of the edge (see the I{capacity}
-               argument)
-
-            2. For every vertex except the source and the target, the
-               incoming flow is the same as the outgoing flow.
-               
-        The value of the flow is the incoming flow of the target or the
-        outgoing flow of the source (which are equal). The maximum flow
-        is the maximum possible such value.
-
-        @param capacity: the edge capacities (weights). If C{None}, all
-          edges have equal weight. May also be an attribute name.
-        @return: a L{Flow} object describing the maximum flow
-        """
-        return Flow(self, *GraphBase.maxflow(self, source, target, capacity))
-
-    def mincut(self, capacity=None):
-        """mincut(capacity=None)
-
-        Returns a minimum cut in a graph.
-
-        @param capacity: the edge capacities (weights). If C{None}, all
-          edges have equal weight. May also be an attribute name.
-        @return: a L{Cut} object describing the minimum cut
-        """
-        return Cut(self, *GraphBase.mincut(self, capacity))
-
-    def modularity(self, membership, weights=None):
-        """modularity(membership, weights=None)
-
-        Calculates the modularity score of the graph with respect to a given
-        clustering.
-        
-        The modularity of a graph w.r.t. some division measures how good the
-        division is, or how separated are the different vertex types from each
-        other. It's defined as M{Q=1/(2m)*sum(Aij-ki*kj/(2m)delta(ci,cj),i,j)}.
-        M{m} is the number of edges, M{Aij} is the element of the M{A}
-        adjacency matrix in row M{i} and column M{j}, M{ki} is the degree of
-        node M{i}, M{kj} is the degree of node M{j}, and M{Ci} and C{cj} are
-        the types of the two vertices (M{i} and M{j}). M{delta(x,y)} is one iff
-        M{x=y}, 0 otherwise.
-        
-        If edge weights are given, the definition of modularity is modified as
-        follows: M{Aij} becomes the weight of the corresponding edge, M{ki}
-        is the total weight of edges adjacent to vertex M{i}, M{kj} is the
-        total weight of edges adjacent to vertex M{j} and M{m} is the total
-        edge weight in the graph.
-        
-        @param membership: a membership list or a L{VertexClustering} object
-        @param weights: optional edge weights or C{None} if all edges are
-          weighed equally. Attribute names are also allowed.
-        @return: the modularity score
-        
-        @newfield ref: Reference
-        @ref: MEJ Newman and M Girvan: Finding and evaluating community
-          structure in networks. Phys Rev E 69 026113, 2004.
-        """
-        if isinstance(membership, VertexClustering):
-            if membership.graph != self:
-                raise ValueError("clustering object belongs to another graph")
-            return GraphBase.modularity(self, membership.membership, weights)
-        else:
-            return GraphBase.modularity(self, membership, weights)
-
-    def path_length_hist(self, directed=True):
-        """path_length_hist(directed=True)
-
-        Returns the path length histogram of the graph
-
-        @param directed: whether to consider directed paths. Ignored for
-          undirected graphs.
-        @return: a L{Histogram} object. The object will also have an
-          C{unconnected} attribute that stores the number of unconnected
-          vertex pairs (where the second vertex can not be reached from
-          the first one). The latter one will be of type long (and not
-          a simple integer), since this can be I{very} large.
-        """
-        data, unconn = GraphBase.path_length_hist(self, directed)
-        hist = Histogram(bin_width=1)
-        for i, length in enumerate(data):
-            hist.add(i+1, length)
-        hist.unconnected = long(unconn)
-        return hist
-
-    def pagerank(self, vertices=None, directed=True, damping=0.85,
-            weights=None, arpack_options=None):
-        """Calculates the Google PageRank values of a graph.
-        
-        @param vertices: the indices of the vertices being queried.
-          C{None} means all of the vertices.
-        @param directed: whether to consider directed paths.
-        @param damping: the damping factor. M{1-damping} is the PageRank value
-          for nodes with no incoming links. It is also the probability of
-          resetting the random walk to a uniform distribution in each step.
-        @param weights: edge weights to be used. Can be a sequence or iterable
-          or even an edge attribute name.
-        @param arpack_options: an L{ARPACKOptions} object used to fine-tune
-          the ARPACK eigenvector calculation. If omitted, the module-level
-          variable called C{arpack_options} is used.
-        @return: a list with the Google PageRank values of the specified
-          vertices."""
-        if arpack_options is None:
-            arpack_options = _igraph.arpack_options
-        return self.personalized_pagerank(vertices, directed, damping, None, \
-                None, weights, arpack_options)
-
-    def spanning_tree(self, weights=None, return_tree=True):
-        """Calculates a minimum spanning tree for a graph.
-
-        @param weights: a vector containing weights for every edge in
-          the graph. C{None} means that the graph is unweighted.
-        @param return_tree: whether to return the minimum spanning tree (when
-          C{return_tree} is C{True}) or to return the IDs of the edges in
-          the minimum spanning tree instead (when C{return_tree} is C{False}).
-          The default is C{True} for historical reasons as this argument was
-          introduced in igraph 0.6.
-        @return: the spanning tree as a L{Graph} object if C{return_tree}
-          is C{True} or the IDs of the edges that constitute the spanning
-          tree if C{return_tree} is C{False}.
-
-        @newfield ref: Reference
-        @ref: Prim, R.C.: I{Shortest connection networks and some
-          generalizations}. Bell System Technical Journal 36:1389-1401, 1957.
-        """
-        result = GraphBase._spanning_tree(self, weights)
-        if return_tree:
-            return self.subgraph_edges(result, delete_vertices=False)
-        return result
-
-    def transitivity_avglocal_undirected(self, mode="nan", weights=None):
-        """Calculates the average of the vertex transitivities of the graph.
-
-        In the unweighted case, the transitivity measures the probability that
-        two neighbors of a vertex are connected. In case of the average local
-        transitivity, this probability is calculated for each vertex and then
-        the average is taken. Vertices with less than two neighbors require
-        special treatment, they will either be left out from the calculation
-        or they will be considered as having zero transitivity, depending on
-        the I{mode} parameter. The calculation is slightly more involved for
-        weighted graphs; in this case, weights are taken into account according
-        to the formula of Barrat et al (see the references).
-
-        Note that this measure is different from the global transitivity
-        measure (see L{transitivity_undirected()}) as it simply takes the
-        average local transitivity across the whole network.
-
-        @param mode: defines how to treat vertices with degree less than two.
-          If C{TRANSITIVITY_ZERO} or C{"zero"}, these vertices will have zero
-          transitivity. If C{TRANSITIVITY_NAN} or C{"nan"}, these vertices
-          will be excluded from the average.
-        @param weights: edge weights to be used. Can be a sequence or iterable
-          or even an edge attribute name.
-        
-        @see: L{transitivity_undirected()}, L{transitivity_local_undirected()}
-        @newfield ref: Reference
-        @ref: Watts DJ and Strogatz S: I{Collective dynamics of small-world
-          networks}. Nature 393(6884):440-442, 1998.
-        @ref: Barrat A, Barthelemy M, Pastor-Satorras R and Vespignani A:
-          I{The architecture of complex weighted networks}. PNAS 101, 3747 (2004).
-          U{http://arxiv.org/abs/cond-mat/0311416}.
-        """
-        if weights is None:
-            return GraphBase.transitivity_avglocal_undirected(self, mode)
-
-        xs = self.transitivity_local_undirected(mode=mode, weights=weights)
-        return sum(xs) / float(len(xs))
-
-    def triad_census(self, *args, **kwds):
-        """triad_census()
-
-        Calculates the triad census of the graph.
-
-        @return: a L{TriadCensus} object.
-        @newfield ref: Reference
-        @ref: Davis, J.A. and Leinhardt, S.  (1972).  The Structure of
-          Positive Interpersonal Relations in Small Groups.  In:
-          J. Berger (Ed.), Sociological Theories in Progress, Volume 2,
-          218-251. Boston: Houghton Mifflin.
-        """
-        return TriadCensus(GraphBase.triad_census(self, *args, **kwds))
-
-    # Automorphisms
-    def count_automorphisms_vf2(self, color=None, edge_color=None,
-            node_compat_fn=None, edge_compat_fn=None):
-        """Returns the number of automorphisms of the graph.
-        
-        This function simply calls C{count_isomorphisms_vf2} with the graph
-        itself. See C{count_isomorphisms_vf2} for an explanation of the
-        parameters.
-        
-        @return: the number of automorphisms of the graph
-        @see: Graph.count_isomorphisms_vf2
-        """
-        return self.count_isomorphisms_vf2(self, color1=color, color2=color,
-                edge_color1=edge_color, edge_color2=edge_color,
-                node_compat_fn=node_compat_fn, edge_compat_fn=edge_compat_fn)
-
-    def get_automorphisms_vf2(self, color=None, edge_color=None,
-            node_compat_fn=None, edge_compat_fn=None):
-        """Returns all the automorphisms of the graph
-        
-        This function simply calls C{get_isomorphisms_vf2} with the graph
-        itself. See C{get_isomorphisms_vf2} for an explanation of the
-        parameters.
-        
-        @return: a list of lists, each item containing a possible mapping
-          of the graph vertices to itself according to the automorphism
-        @see: Graph.get_isomorphisms_vf2
-        """
-        return self.get_isomorphisms_vf2(self, color1=color, color2=color,
-                edge_color1=edge_color, edge_color2=edge_color,
-                node_compat_fn=node_compat_fn, edge_compat_fn=edge_compat_fn)
-
-    # Various clustering algorithms -- mostly wrappers around GraphBase
-    def community_fastgreedy(self, weights=None):
-        """Community structure based on the greedy optimization of modularity.
-
-        This algorithm merges individual nodes into communities in a way that
-        greedily maximizes the modularity score of the graph. It can be proven
-        that if no merge can increase the current modularity score, the
-        algorithm can be stopped since no further increase can be achieved.
-
-        This algorithm is said to run almost in linear time on sparse graphs.
-
-        @param weights: edge attribute name or a list containing edge
-          weights
-        @return: an appropriate L{VertexDendrogram} object.
-
-        @newfield ref: Reference
-        @ref: A Clauset, MEJ Newman and C Moore: Finding community structure
-          in very large networks. Phys Rev E 70, 066111 (2004).
-        """
-        merges, qs = GraphBase.community_fastgreedy(self, weights)
-
-        # qs may be shorter than |V|-1 if we are left with a few separated
-        # communities in the end; take this into account
-        diff = self.vcount() - len(qs)
-        qs.reverse()
-        if qs:
-            optimal_count = qs.index(max(qs)) + diff + 1
-        else:
-            optimal_count = diff
-
-        return VertexDendrogram(self, merges, optimal_count,
-                modularity_params=dict(weights=weights))
-
-    def community_infomap(self, edge_weights=None, vertex_weights=None, trials=10):
-        """Finds the community structure of the network according to the Infomap
-        method of Martin Rosvall and Carl T. Bergstrom.
-        
-        @param edge_weights: name of an edge attribute or a list containing
-          edge weights.
-        @param vertex_weights: name of an vertex attribute or a list containing
-          vertex weights.
-        @param trials: the number of attempts to partition the network.
-        @return: an appropriate L{VertexClustering} object with an extra attribute
-          called C{codelength} that stores the code length determined by the
-          algorithm.
-        
-        @newfield ref: Reference
-        @ref: M. Rosvall and C. T. Bergstrom: Maps of information flow reveal
-          community structure in complex networks, PNAS 105, 1118 (2008).
-          U{http://dx.doi.org/10.1073/pnas.0706851105},
-          U{http://arxiv.org/abs/0707.0609}.
-        @ref: M. Rosvall, D. Axelsson, and C. T. Bergstrom: The map equation,
-          Eur. Phys. J. Special Topics 178, 13 (2009).
-          U{http://dx.doi.org/10.1140/epjst/e2010-01179-1},
-          U{http://arxiv.org/abs/0906.1405}.
-        """
-        membership, codelength = \
-              GraphBase.community_infomap(self, edge_weights, vertex_weights, trials)
-        return VertexClustering(self, membership, \
-                                params={"codelength": codelength}, \
-                                modularity_params={"weights": edge_weights} )
-
-    def community_leading_eigenvector_naive(self, clusters = None, \
-            return_merges = False):
-        """community_leading_eigenvector_naive(clusters=None,
-        return_merges=False)
-
-        A naive implementation of Newman's eigenvector community structure
-        detection. This function splits the network into two components
-        according to the leading eigenvector of the modularity matrix and
-        then recursively takes the given number of steps by splitting the
-        communities as individual networks. This is not the correct way,
-        however, see the reference for explanation. Consider using the
-        correct L{community_leading_eigenvector} method instead.
-
-        @param clusters: the desired number of communities. If C{None}, the
-          algorithm tries to do as many splits as possible. Note that the
-          algorithm won't split a community further if the signs of the leading
-          eigenvector are all the same, so the actual number of discovered
-          communities can be less than the desired one.
-        @param return_merges: whether the returned object should be a
-          dendrogram instead of a single clustering.
-        @return: an appropriate L{VertexClustering} or L{VertexDendrogram}
-          object.
-        
-        @newfield ref: Reference
-        @ref: MEJ Newman: Finding community structure in networks using the
-        eigenvectors of matrices, arXiv:physics/0605087"""
-        if clusters is None:
-            clusters = -1
-        cl, merges, q = GraphBase.community_leading_eigenvector_naive(self, \
-                clusters, return_merges)
-        if merges is None:
-            return VertexClustering(self, cl, modularity = q)
-        else:
-            return VertexDendrogram(self, merges, safemax(cl)+1)
-
-
-    def community_leading_eigenvector(self, clusters=None):
-        """community_leading_eigenvector(clusters=None)
-        
-        Newman's leading eigenvector method for detecting community structure.
-        This is the proper implementation of the recursive, divisive algorithm:
-        each split is done by maximizing the modularity regarding the
-        original network.
-        
-        @param clusters: the desired number of communities. If C{None}, the
-          algorithm tries to do as many splits as possible. Note that the
-          algorithm won't split a community further if the signs of the leading
-          eigenvector are all the same, so the actual number of discovered
-          communities can be less than the desired one.
-        @return: an appropriate L{VertexClustering} object.
-        
-        @newfield ref: Reference
-        @ref: MEJ Newman: Finding community structure in networks using the
-        eigenvectors of matrices, arXiv:physics/0605087"""
-        if clusters is None:
-            clusters = -1
-        membership, _, q = GraphBase.community_leading_eigenvector(self, clusters)
-        return VertexClustering(self, membership, modularity = q)
-
-
-    def community_label_propagation(self, weights = None, initial = None, \
-            fixed = None):
-        """community_label_propagation(weights=None, initial=None, fixed=None)
-
-        Finds the community structure of the graph according to the label
-        propagation method of Raghavan et al.
-        Initially, each vertex is assigned a different label. After that,
-        each vertex chooses the dominant label in its neighbourhood in each
-        iteration. Ties are broken randomly and the order in which the
-        vertices are updated is randomized before every iteration. The
-        algorithm ends when vertices reach a consensus.
-        Note that since ties are broken randomly, there is no guarantee that
-        the algorithm returns the same community structure after each run.
-        In fact, they frequently differ. See the paper of Raghavan et al
-        on how to come up with an aggregated community structure.
-        @param weights: name of an edge attribute or a list containing
-          edge weights
-        @param initial: name of a vertex attribute or a list containing
-          the initial vertex labels. Labels are identified by integers from
-          zero to M{n-1} where M{n} is the number of vertices. Negative
-          numbers may also be present in this vector, they represent unlabeled
-          vertices.
-        @param fixed: a list of booleans for each vertex. C{True} corresponds
-          to vertices whose labeling should not change during the algorithm.
-          It only makes sense if initial labels are also given. Unlabeled
-          vertices cannot be fixed.
-        @return: an appropriate L{VertexClustering} object.
-
-        @newfield ref: Reference
-        @ref: Raghavan, U.N. and Albert, R. and Kumara, S. Near linear
-          time algorithm to detect community structures in large-scale
-          networks. Phys Rev E 76:036106, 2007.
-          U{http://arxiv.org/abs/0709.2938}.
-        """
-        if isinstance(fixed, basestring):
-            fixed = [bool(o) for o in g.vs[fixed]]
-        cl = GraphBase.community_label_propagation(self, \
-                weights, initial, fixed)
-        return VertexClustering(self, cl,
-                modularity_params=dict(weights=weights))
-
-
-    def community_multilevel(self, weights=None, return_levels=False):
-        """Community structure based on the multilevel algorithm of
-        Blondel et al.
-        
-        This is a bottom-up algorithm: initially every vertex belongs to a
-        separate community, and vertices are moved between communities
-        iteratively in a way that maximizes the vertices' local contribution
-        to the overall modularity score. When a consensus is reached (i.e. no
-        single move would increase the modularity score), every community in
-        the original graph is shrank to a single vertex (while keeping the
-        total weight of the adjacent edges) and the process continues on the
-        next level. The algorithm stops when it is not possible to increase
-        the modularity any more after shrinking the communities to vertices.
-
-        This algorithm is said to run almost in linear time on sparse graphs.
-
-        @param weights: edge attribute name or a list containing edge
-          weights
-        @param return_levels: if C{True}, the communities at each level are
-          returned in a list. If C{False}, only the community structure with
-          the best modularity is returned.
-        @return: a list of L{VertexClustering} objects, one corresponding to
-          each level (if C{return_levels} is C{True}), or a L{VertexClustering}
-          corresponding to the best modularity.
-
-        @newfield ref: Reference
-        @ref: VD Blondel, J-L Guillaume, R Lambiotte and E Lefebvre: Fast
-          unfolding of community hierarchies in large networks, J Stat Mech
-          P10008 (2008), http://arxiv.org/abs/0803.0476
-        """
-        if self.is_directed():
-            raise ValueError("input graph must be undirected")
-
-        if return_levels:
-            levels, qs = GraphBase.community_multilevel(self, weights, True)
-            result = []
-            for level, q in zip(levels, qs):
-                result.append(VertexClustering(self, level, q,
-                    modularity_params=dict(weights=weights)))
-        else:
-            membership = GraphBase.community_multilevel(self, weights, False)
-            result = VertexClustering(self, membership,
-                    modularity_params=dict(weights=weights))
-        return result
-
-    def community_optimal_modularity(self, *args, **kwds):
-        """Calculates the optimal modularity score of the graph and the
-        corresponding community structure.
-
-        This function uses the GNU Linear Programming Kit to solve a large
-        integer optimization problem in order to find the optimal modularity
-        score and the corresponding community structure, therefore it is
-        unlikely to work for graphs larger than a few (less than a hundred)
-        vertices. Consider using one of the heuristic approaches instead if
-        you have such a large graph.
-
-        @return: the calculated membership vector and the corresponding
-          modularity in a tuple."""
-        membership, modularity = \
-                GraphBase.community_optimal_modularity(self, *args, **kwds)
-        return VertexClustering(self, membership, modularity)
-
-    def community_edge_betweenness(self, clusters=None, directed=True,
-            weights=None):
-        """Community structure based on the betweenness of the edges in the
-        network.
-
-        The idea is that the betweenness of the edges connecting two
-        communities is typically high, as many of the shortest paths between
-        nodes in separate communities go through them. So we gradually remove
-        the edge with the highest betweenness and recalculate the betweennesses
-        after every removal. This way sooner or later the network falls of to
-        separate components. The result of the clustering will be represented
-        by a dendrogram.
-
-        @param clusters: the number of clusters we would like to see. This
-          practically defines the "level" where we "cut" the dendrogram to
-          get the membership vector of the vertices. If C{None}, the dendrogram
-          is cut at the level which maximizes the modularity.
-        @param directed: whether the directionality of the edges should be
-          taken into account or not.
-        @param weights: name of an edge attribute or a list containing
-          edge weights.
-        @return: a L{VertexDendrogram} object, initally cut at the maximum
-          modularity or at the desired number of clusters.
-        """
-        merges, qs = GraphBase.community_edge_betweenness(self, directed, weights)
-        qs.reverse()
-        if clusters is None:
-            if qs:
-                clusters = qs.index(max(qs))+1
-            else:
-                clusters = 1
-        return VertexDendrogram(self, merges, clusters,
-                modularity_params=dict(weights=weights))
-
-    def community_spinglass(self, *args, **kwds):
-        """community_spinglass(weights=None, spins=25, parupdate=False,
-        start_temp=1, stop_temp=0.01, cool_fact=0.99, update_rule="config",
-        gamma=1, implementation="orig", lambda_=1)
-
-        Finds the community structure of the graph according to the
-        spinglass community detection method of Reichardt & Bornholdt.
-
-        @keyword weights: edge weights to be used. Can be a sequence or
-          iterable or even an edge attribute name.
-        @keyword spins: integer, the number of spins to use. This is the
-          upper limit for the number of communities. It is not a problem
-          to supply a (reasonably) big number here, in which case some
-          spin states will be unpopulated.
-        @keyword parupdate: whether to update the spins of the vertices in
-          parallel (synchronously) or not
-        @keyword start_temp: the starting temperature
-        @keyword stop_temp: the stop temperature
-        @keyword cool_fact: cooling factor for the simulated annealing
-        @keyword update_rule: specifies the null model of the simulation.
-          Possible values are C{"config"} (a random graph with the same
-          vertex degrees as the input graph) or C{"simple"} (a random
-          graph with the same number of edges)
-        @keyword gamma: the gamma argument of the algorithm, specifying the
-          balance between the importance of present and missing edges
-          within a community. The default value of 1.0 assigns equal
-          importance to both of them.
-        @keyword implementation: currently igraph contains two implementations
-          of the spinglass community detection algorithm. The faster
-          original implementation is the default. The other implementation
-          is able to take into account negative weights, this can be
-          chosen by setting C{implementation} to C{"neg"}
-        @keyword lambda_: the lambda argument of the algorithm, which
-          specifies the balance between the importance of present and missing
-          negatively weighted edges within a community. Smaller values of
-          lambda lead to communities with less negative intra-connectivity.
-          If the argument is zero, the algorithm reduces to a graph coloring
-          algorithm, using the number of spins as colors. This argument is
-          ignored if the original implementation is used. Note the underscore
-          at the end of the argument name; this is due to the fact that
-          lambda is a reserved keyword in Python.
-        @return: an appropriate L{VertexClustering} object.
-
-        @newfield ref: Reference
-        @ref: Reichardt J and Bornholdt S: Statistical mechanics of
-          community detection. Phys Rev E 74:016110 (2006).
-          U{http://arxiv.org/abs/cond-mat/0603718}.
-        @ref: Traag VA and Bruggeman J: Community detection in networks
-          with positive and negative links. Phys Rev E 80:036115 (2009).
-          U{http://arxiv.org/abs/0811.2329}.
-        """
-        membership = GraphBase.community_spinglass(self, *args, **kwds)
-        if "weights" in kwds:
-            modularity_params=dict(weights=kwds["weights"])
-        else:
-            modularity_params={}
-        return VertexClustering(self, membership,
-                modularity_params=modularity_params)
-
-    def community_walktrap(self, weights=None, steps=4):
-        """Community detection algorithm of Latapy & Pons, based on random
-        walks.
-        
-        The basic idea of the algorithm is that short random walks tend to stay
-        in the same community. The result of the clustering will be represented
-        as a dendrogram.
-        
-        @param weights: name of an edge attribute or a list containing
-          edge weights
-        @param steps: length of random walks to perform
-        
-        @return: a L{VertexDendrogram} object, initially cut at the maximum
-          modularity.
-          
-        @newfield ref: Reference
-        @ref: Pascal Pons, Matthieu Latapy: Computing communities in large
-          networks using random walks, U{http://arxiv.org/abs/physics/0512106}.
-        """
-        merges, qs = GraphBase.community_walktrap(self, weights, steps)
-        qs.reverse()
-        if qs:
-            optimal_count = qs.index(max(qs))+1
-        else:
-            optimal_count = 1
-        return VertexDendrogram(self, merges, optimal_count,
-                modularity_params=dict(weights=weights))
-
-    def k_core(self, *args):
-        """Returns some k-cores of the graph.
-
-        The method accepts an arbitrary number of arguments representing
-        the desired indices of the M{k}-cores to be returned. The arguments
-        can also be lists or tuples. The result is a single L{Graph} object
-        if an only integer argument was given, otherwise the result is a
-        list of L{Graph} objects representing the desired k-cores in the
-        order the arguments were specified. If no argument is given, returns
-        all M{k}-cores in increasing order of M{k}.
-        """
-        if len(args) == 0:
-            indices = xrange(self.vcount())
-            return_single = False
-        else:
-            return_single = True
-            indices = []
-            for arg in args:
-                try:
-                    indices.extend(arg)
-                except:
-                    indices.append(arg)
-
-        if len(indices)>1 or hasattr(args[0], "__iter__"):
-            return_single = False
-
-        corenesses = self.coreness()
-        result = []
-        vidxs = xrange(self.vcount())
-        for idx in indices:
-            core_idxs = [vidx for vidx in vidxs if corenesses[vidx] >= idx]
-            result.append(self.subgraph(core_idxs))
-
-        if return_single: return result[0]
-        return result
-
-
-    def layout(self, layout=None, *args, **kwds):
-        """Returns the layout of the graph according to a layout algorithm.
-
-        Parameters and keyword arguments not specified here are passed to the
-        layout algorithm directly. See the documentation of the layout
-        algorithms for the explanation of these parameters.
-
-        Registered layout names understood by this method are:
-
-          - C{auto}, C{automatic}: automatic layout
-            (see L{Graph.layout_auto})
-
-          - C{circle}, C{circular}: circular layout
-            (see L{Graph.layout_circle})
-
-          - C{drl}: DrL layout for large graphs (see L{Graph.layout_drl})
-
-          - C{drl_3d}: 3D DrL layout for large graphs
-            (see L{Graph.layout_drl})
-
-          - C{fr}, C{fruchterman_reingold}: Fruchterman-Reingold layout
-            (see L{Graph.layout_fruchterman_reingold}).
-
-          - C{fr_3d}, C{fr3d}, C{fruchterman_reingold_3d}: 3D Fruchterman-
-            Reingold layout (see L{Graph.layout_fruchterman_reingold}).
-
-          - C{grid}: regular grid layout in 2D (see L{Graph.layout_grid}) 
-
-          - C{grid_3d}: regular grid layout in 3D (see L{Graph.layout_grid_3d})
-
-          - C{graphopt}: the graphopt algorithm (see L{Graph.layout_graphopt})
-
-          - C{gfr}, C{grid_fr}, C{grid_fruchterman_reingold}: grid-based
-            Fruchterman-Reingold layout
-            (see L{Graph.layout_grid_fruchterman_reingold})
-
-          - C{kk}, C{kamada_kawai}: Kamada-Kawai layout
-            (see L{Graph.layout_kamada_kawai})
-
-          - C{kk_3d}, C{kk3d}, C{kamada_kawai_3d}: 3D Kamada-Kawai layout
-            (see L{Graph.layout_kamada_kawai})
-
-          - C{lgl}, C{large}, C{large_graph}: Large Graph Layout
-            (see L{Graph.layout_lgl})
-
-          - C{mds}: multidimensional scaling layout (see L{Graph.layout_mds})
-
-          - C{random}: random layout (see L{Graph.layout_random})
-
-          - C{random_3d}: random 3D layout (see L{Graph.layout_random})
-
-          - C{rt}, C{tree}, C{reingold_tilford}: Reingold-Tilford tree
-            layout (see L{Graph.layout_reingold_tilford})
-
-          - C{rt_circular}, C{reingold_tilford_circular}: circular
-            Reingold-Tilford tree layout
-            (see L{Graph.layout_reingold_tilford_circular})
-
-          - C{sphere}, C{spherical}, C{circle_3d}, C{circular_3d}: spherical
-            layout (see L{Graph.layout_circle})
-
-          - C{star}: star layout (see L{Graph.layout_star})
-
-          - C{sugiyama}: Sugiyama layout (see L{Graph.layout_sugiyama})
-
-        @param layout: the layout to use. This can be one of the registered
-          layout names or a callable which returns either a L{Layout} object or
-          a list of lists containing the coordinates. If C{None}, uses the
-          value of the C{plotting.layout} configuration key.
-        @return: a L{Layout} object.
-        """
-        if layout is None:
-            layout = config["plotting.layout"]
-        if hasattr(layout, "__call__"):
-            method = layout
-        else:
-            layout = layout.lower()
-            if layout[-3:] == "_3d":
-                kwds["dim"] = 3
-                layout = layout[:-3]
-            elif layout[-2:] == "3d":
-                kwds["dim"] = 3
-                layout = layout[:-2]
-            method = getattr(self.__class__, self._layout_mapping[layout])
-        if not hasattr(method, "__call__"):
-            raise ValueError("layout method must be callable")
-        l = method(self, *args, **kwds)
-        if not isinstance(l, Layout):
-            l = Layout(l)
-        return l
-
-    def layout_auto(self, *args, **kwds):
-        """Chooses and runs a suitable layout function based on simple
-        topological properties of the graph.
-
-        This function tries to choose an appropriate layout function for
-        the graph using the following rules:
-
-          1. If the graph has an attribute called C{layout}, it will be
-             used. It may either be a L{Layout} instance, a list of
-             coordinate pairs, the name of a layout function, or a
-             callable function which generates the layout when called
-             with the graph as a parameter.
-
-          2. Otherwise, if the graph has vertex attributes called C{x}
-             and C{y}, these will be used as coordinates in the layout.
-             When a 3D layout is requested (by setting C{dim} to 3),
-             a vertex attribute named C{z} will also be needed.
-
-          3. Otherwise, if the graph is connected and has at most 100
-             vertices, the Kamada-Kawai layout will be used (see
-             L{Graph.layout_kamada_kawai()}).
-
-          4. Otherwise, if the graph has at most 1000 vertices, the
-             Fruchterman-Reingold layout will be used (see
-             L{Graph.layout_fruchterman_reingold()}).
-
-          5. If everything else above failed, the DrL layout algorithm
-             will be used (see L{Graph.layout_drl()}).
-
-        All the arguments of this function except C{dim} are passed on
-        to the chosen layout function (in case we have to call some layout
-        function).
-
-        @keyword dim: specifies whether we would like to obtain a 2D or a
-          3D layout.
-        @return: a L{Layout} object.
-        """
-        if "layout" in self.attributes():
-            layout = self["layout"]
-            if isinstance(layout, Layout):
-                # Layouts are used intact
-                return layout
-            if isinstance(layout, (list, tuple)):
-                # Lists/tuples are converted to layouts
-                return Layout(layout)
-            if hasattr(layout, "__call__"):
-                # Callables are called
-                return Layout(layout(*args, **kwds))
-            # Try Graph.layout()
-            return self.layout(layout, *args, **kwds)
-
-        dim = kwds.get("dim", 2)
-        vattrs = self.vertex_attributes()
-        if "x" in vattrs and "y" in vattrs:
-            if dim == 3 and "z" in vattrs:
-                return Layout(zip(self.vs["x"], self.vs["y"], self.vs["z"]))
-            else:
-                return Layout(zip(self.vs["x"], self.vs["y"]))
-
-        if self.vcount() <= 100 and self.is_connected():
-            algo = "kk"
-        elif self.vcount() <= 1000:
-            algo = "fr"
-        else:
-            algo = "drl"
-        return self.layout(algo, *args, **kwds)
-
-    def layout_sugiyama(self, layers=None, weights=None, hgap=1, vgap=1,
-            maxiter=100, return_extended_graph=False):
-        """layout_sugiyama(layers=None, weights=None, hgap=1, vgap=1, maxiter=100,
-                        return_extended_graph=False)
-
-        Places the vertices using a layered Sugiyama layout.
-
-        This is a layered layout that is most suitable for directed acyclic graphs,
-        although it works on undirected or cyclic graphs as well.
-
-        Each vertex is assigned to a layer and each layer is placed on a horizontal
-        line. Vertices within the same layer are then permuted using the barycenter
-        heuristic that tries to minimize edge crossings.
-
-        Dummy vertices will be added on edges that span more than one layer. The
-        returned layout therefore contains more rows than the number of nodes in
-        the original graph; the extra rows correspond to the dummy vertices.
-
-        @param layers: a vector specifying a non-negative integer layer index for
-          each vertex, or the name of a numeric vertex attribute that contains
-          the layer indices. If C{None}, a layering will be determined
-          automatically. For undirected graphs, a spanning tree will be extracted
-          and vertices will be assigned to layers using a breadth first search from
-          the node with the largest degree. For directed graphs, cycles are broken
-          by reversing the direction of edges in an approximate feedback arc set
-          using the heuristic of Eades, Lin and Smyth, and then using longest path
-          layering to place the vertices in layers.
-        @param weights: edge weights to be used. Can be a sequence or iterable or
-          even an edge attribute name.
-        @param hgap: minimum horizontal gap between vertices in the same layer.
-        @param vgap: vertical gap between layers. The layer index will be
-          multiplied by I{vgap} to obtain the Y coordinate.
-        @param maxiter: maximum number of iterations to take in the crossing
-          reduction step. Increase this if you feel that you are getting too many
-          edge crossings.
-        @param return_extended_graph: specifies that the extended graph with the
-          added dummy vertices should also be returned. When this is C{True}, the
-          result will be a tuple containing the layout and the extended graph. The
-          first |V| nodes of the extended graph will correspond to the nodes of the
-          original graph, the remaining ones are dummy nodes. Plotting the extended
-          graph with the returned layout and hidden dummy nodes will produce a layout
-          that is similar to the original graph, but with the added edge bends.
-          The extended graph also contains an edge attribute called C{_original_eid}
-          which specifies the ID of the edge in the original graph from which the
-          edge of the extended graph was created.
-        @return: the calculated layout, which may (and usually will) have more rows
-          than the number of vertices; the remaining rows correspond to the dummy
-          nodes introduced in the layering step. When C{return_extended_graph} is
-          C{True}, it will also contain the extended graph.
-
-        @newfield ref: Reference
-        @ref: K Sugiyama, S Tagawa, M Toda: Methods for visual understanding of
-          hierarchical system structures. IEEE Systems, Man and Cybernetics\
-          11(2):109-125, 1981.
-        @ref: P Eades, X Lin and WF Smyth: A fast effective heuristic for the
-          feedback arc set problem. Information Processing Letters 47:319-323, 1993.
-        """
-        if not return_extended_graph:
-            return Layout(GraphBase._layout_sugiyama(self, layers, weights, hgap,
-                    vgap, maxiter, return_extended_graph))
-
-        layout, extd_graph, extd_to_orig_eids = \
-                GraphBase._layout_sugiyama(self, layers, weights, hgap,
-                        vgap, maxiter, return_extended_graph)
-        extd_graph.es["_original_eid"] = extd_to_orig_eids
-        return Layout(layout), extd_graph
-
-    def maximum_bipartite_matching(self, types="type", weights=None, eps=None):
-        """Finds a maximum matching in a bipartite graph.
-        
-        A maximum matching is a set of edges such that each vertex is incident on
-        at most one matched edge and the number (or weight) of such edges in the
-        set is as large as possible.
-        
-        @param types: vertex types in a list or the name of a vertex attribute
-          holding vertex types. Types should be denoted by zeros and ones (or
-          C{False} and C{True}) for the two sides of the bipartite graph.
-          If omitted, it defaults to C{type}, which is the default vertex type
-          attribute for bipartite graphs.
-        @param weights: edge weights to be used. Can be a sequence or iterable or
-          even an edge attribute name.
-        @param eps: a small real number used in equality tests in the weighted
-          bipartite matching algorithm. Two real numbers are considered equal in
-          the algorithm if their difference is smaller than this value. This
-          is required to avoid the accumulation of numerical errors. If you
-          pass C{None} here, igraph will try to determine an appropriate value
-          automatically.
-        @return: an instance of L{Matching}."""
-        if eps is None:
-            eps = -1
-
-        matches = GraphBase._maximum_bipartite_matching(self, types, weights, eps)
-        return Matching(self, matches, types=types)
-
-    #############################################
-    # Auxiliary I/O functions
-
-    def write_adjacency(self, f, sep=" ", eol="\n", *args, **kwds):
-        """Writes the adjacency matrix of the graph to the given file
-
-        All the remaining arguments not mentioned here are passed intact
-        to L{Graph.get_adjacency}.
-
-        @param f: the name of the file to be written.
-        @param sep: the string that separates the matrix elements in a row
-        @param eol: the string that separates the rows of the matrix. Please
-          note that igraph is able to read back the written adjacency matrix
-          if and only if this is a single newline character
-        """
-        if isinstance(f, basestring):
-            f = open(f, "w")
-        matrix = self.get_adjacency(*args, **kwds)
-        for row in matrix:
-            f.write(sep.join(map(str, row)))
-            f.write(eol)
-        f.close()
-
-    @classmethod
-    def Read_Adjacency(klass, f, sep=None, comment_char = "#", attribute=None,
-        *args, **kwds):
-        """Constructs a graph based on an adjacency matrix from the given file
-
-        Additional positional and keyword arguments not mentioned here are
-        passed intact to L{Graph.Adjacency}.
-
-        @param f: the name of the file to be read or a file object
-        @param sep: the string that separates the matrix elements in a row.
-          C{None} means an arbitrary sequence of whitespace characters.
-        @param comment_char: lines starting with this string are treated
-          as comments.
-        @param attribute: an edge attribute name where the edge weights are
-          stored in the case of a weighted adjacency matrix. If C{None},
-          no weights are stored, values larger than 1 are considered as
-          edge multiplicities.
-        @return: the created graph"""
-        if isinstance(f, basestring):
-            f = open(f)
-        matrix, ri, weights = [], 0, {} 
-        for line in f:
-            line = line.strip()
-            if len(line) == 0: continue
-            if line.startswith(comment_char): continue
-            row = [float(x) for x in line.split(sep)]
-            matrix.append(row)
-            ri += 1
-
-        f.close()
-
-        if attribute is None:
-            graph=klass.Adjacency(matrix, *args, **kwds)
-        else:
-            kwds["attr"] = attribute
-            graph=klass.Weighted_Adjacency(matrix, *args, **kwds)
-
-        return graph
-
-    def write_dimacs(self, f, source=None, target=None, capacity="capacity"):
-        """Writes the graph in DIMACS format to the given file.
-
-        @param f: the name of the file to be written or a Python file handle.
-        @param source: the source vertex ID. If C{None}, igraph will try to
-          infer it from the C{source} graph attribute.
-        @param target: the target vertex ID. If C{None}, igraph will try to
-          infer it from the C{target} graph attribute.
-        @param capacity: the capacities of the edges in a list or the name of
-          an edge attribute that holds the capacities. If there is no such
-          edge attribute, every edge will have a capacity of 1.
-        """
-        if source is None:
-            source = self["source"]
-        if target is None:
-            target = self["target"]
-        if isinstance(capacity, basestring) and \
-                capacity not in self.edge_attributes():
-            warn("'%s' edge attribute does not exist" % capacity)
-            capacity = None
-        return GraphBase.write_dimacs(self, f, source, target, capacity)
-
-    def write_graphmlz(self, f, compresslevel=9):
-        """Writes the graph to a zipped GraphML file.
-
-        The library uses the gzip compression algorithm, so the resulting
-        file can be unzipped with regular gzip uncompression (like
-        C{gunzip} or C{zcat} from Unix command line) or the Python C{gzip}
-        module.
-
-        Uses a temporary file to store intermediate GraphML data, so
-        make sure you have enough free space to store the unzipped
-        GraphML file as well.
-
-        @param f: the name of the file to be written.
-        @param compresslevel: the level of compression. 1 is fastest and
-          produces the least compression, and 9 is slowest and produces
-          the most compression."""
-        from igraph.utils import named_temporary_file
-        with named_temporary_file(text=True) as tmpfile:
-            self.write_graphml(tmpfile)
-            outf = gzip.GzipFile(f, "wb", compresslevel)
-            for line in open(tmpfile):
-                outf.write(line)
-            outf.close()
-
-    @classmethod
-    def Read_DIMACS(cls, f, directed=False):
-        """Read_DIMACS(f, directed=False)
-
-        Reads a graph from a file conforming to the DIMACS minimum-cost flow
-        file format.
-
-        For the exact definition of the format, see
-        U{http://lpsolve.sourceforge.net/5.5/DIMACS.htm}.
-
-        Restrictions compared to the official description of the format are
-        as follows:
-
-          - igraph's DIMACS reader requires only three fields in an arc
-            definition, describing the edge's source and target node and
-            its capacity.
-          - Source vertices are identified by 's' in the FLOW field, target
-            vertices are identified by 't'.
-          - Node indices start from 1. Only a single source and target node
-            is allowed.
-
-        @param f: the name of the file or a Python file handle
-        @param directed: whether the generated graph should be directed.
-        @return: the generated graph. The indices of the source and target
-          vertices are attached as graph attributes C{source} and C{target},
-          the edge capacities are stored in the C{capacity} edge attribute.
-        """
-        graph, source, target, cap = super(Graph, cls).Read_DIMACS(f, directed)
-        graph.es["capacity"] = cap
-        graph["source"] = source
-        graph["target"] = target
-        return graph
-
-    @classmethod
-    def Read_GraphMLz(cls, f, *params, **kwds):
-        """Read_GraphMLz(f, directed=True, index=0)
-
-        Reads a graph from a zipped GraphML file.
-
-        @param f: the name of the file
-        @param index: if the GraphML file contains multiple graphs,
-          specified the one that should be loaded. Graph indices
-          start from zero, so if you want to load the first graph,
-          specify 0 here.
-        @return: the loaded graph object"""
-        from igraph.utils import named_temporary_file
-        with named_temporary_file(text=True) as tmpfile:
-            outf = open(tmpfile, "wt")
-            for line in gzip.GzipFile(f, "rb"):
-                outf.write(line)
-            outf.close()
-            return cls.Read_GraphML(tmpfile)
-
-    def write_pickle(self, fname=None, version=-1):
-        """Saves the graph in Python pickled format
-
-        @param fname: the name of the file or a stream to save to. If
-          C{None}, saves the graph to a string and returns the string.
-        @param version: pickle protocol version to be used. If -1, uses
-          the highest protocol available
-        @return: C{None} if the graph was saved successfully to the
-          given file, or a string if C{fname} was C{None}.
-        """
-        import cPickle as pickle
-        if fname is None:
-            return pickle.dumps(self, version)
-        if not hasattr(fname, "write"):
-            file_was_opened = True
-            fname = open(fname, 'wb')
-        else:
-            file_was_opened=False
-        result=pickle.dump(self, fname, version)
-        if file_was_opened:
-            fname.close()
-        return result
-
-    def write_picklez(self, fname=None, version=-1):
-        """Saves the graph in Python pickled format, compressed with
-        gzip.
-
-        Saving in this format is a bit slower than saving in a Python pickle
-        without compression, but the final file takes up much less space on
-        the hard drive.
-
-        @param fname: the name of the file or a stream to save to.
-        @param version: pickle protocol version to be used. If -1, uses
-          the highest protocol available
-        @return: C{None} if the graph was saved successfully to the
-          given file.
-        """
-        import cPickle as pickle
-        if not hasattr(fname, "write"):
-            file_was_opened = True
-            fname = gzip.open(fname, "wb")
-        elif not isinstance(fname, gzip.GzipFile):
-            file_was_opened = True
-            fname = gzip.GzipFile(mode="wb", fileobj=fname)
-        else:
-            file_Was_opened = False
-        result = pickle.dump(self, fname, version)
-        if file_was_opened:
-            fname.close()
-        return result
-
-    @classmethod
-    def Read_Pickle(klass, fname=None):
-        """Reads a graph from Python pickled format
-
-        @param fname: the name of the file, a stream to read from, or
-          a string containing the pickled data. The string is assumed to
-          hold pickled data if it is longer than 40 characters and
-          contains a substring that's peculiar to pickled versions
-          of an C{igraph} Graph object.
-        @return: the created graph object.
-        """
-        import cPickle as pickle
-        if hasattr(fname, "read"):
-            # Probably a file or a file-like object
-            result = pickle.load(fname)
-        else:
-            fp = None
-            try:
-                fp = open(fname, "rb")
-            except IOError:
-                # No file with the given name, try unpickling directly
-                result = pickle.loads(fname)
-            if fp is not None:
-                result = pickle.load(fp)
-                fp.close()
-        return result
-
-    @classmethod
-    def Read_Picklez(klass, fname, *args, **kwds):
-        """Reads a graph from compressed Python pickled format, uncompressing
-        it on-the-fly.
-
-        @param fname: the name of the file or a stream to read from.
-        @return: the created graph object.
-        """
-        import cPickle as pickle
-        if hasattr(fname, "read"):
-            # Probably a file or a file-like object
-            if isinstance(fname, gzip.GzipFile):
-                result = pickle.load(fname)
-            else:
-                result = pickle.load(gzip.GzipFile(mode="rb", fileobj=fname))
-        else:
-            result = pickle.load(gzip.open(fname, "rb"))
-        return result
-
-    @classmethod
-    def Read_Picklez(klass, fname, *args, **kwds):
-        """Reads a graph from compressed Python pickled format, uncompressing
-        it on-the-fly.
-
-        @param fname: the name of the file or a stream to read from.
-        @return: the created graph object.
-        """
-        import cPickle as pickle
-        if hasattr(fname, "read"):
-            # Probably a file or a file-like object
-            if isinstance(fname, gzip.GzipFile):
-                result = pickle.load(fname)
-            else:
-                result = pickle.load(gzip.GzipFile(mode="rb", fileobj=fname))
-        else:
-            result = pickle.load(gzip.open(fname, "rb"))
-        if not isinstance(result, klass):
-            raise TypeError("unpickled object is not a %s" % klass.__name__)
-        return result
-
-    # pylint: disable-msg=C0301,C0323
-    # C0301: line too long.
-    # C0323: operator not followed by a space - well, print >>f looks OK
-    def write_svg(self, fname, layout="auto", width=None, height=None, \
-                  labels="label", colors="color", shapes="shape", \
-                  vertex_size=10, edge_colors="color", \
-                  font_size=16, *args, **kwds):
-        """Saves the graph as an SVG (Scalable Vector Graphics) file
-        
-        The file will be Inkscape (http://inkscape.org) compatible.
-        In Inkscape, as nodes are rearranged, the edges auto-update.
-        
-        @param fname: the name of the file
-        @param layout: the layout of the graph. Can be either an
-          explicitly specified layout (using a list of coordinate
-          pairs) or the name of a layout algorithm (which should
-          refer to a method in the L{Graph} object, but without
-          the C{layout_} prefix.
-        @param width: the preferred width in pixels (default: 400)
-        @param height: the preferred height in pixels (default: 400)
-        @param labels: the vertex labels. Either it is the name of
-          a vertex attribute to use, or a list explicitly specifying
-          the labels. It can also be C{None}.
-        @param colors: the vertex colors. Either it is the name of
-          a vertex attribute to use, or a list explicitly specifying
-          the colors. A color can be anything acceptable in an SVG
-          file.
-        @param shapes: the vertex shapes. Either it is the name of
-          a vertex attribute to use, or a list explicitly specifying
-          the shapes as integers. Shape 0 means hidden (nothing is drawn),
-          shape 1 is a circle, shape 2 is a rectangle and shape 3 is a
-          rectangle that automatically sizes to the inner text.
-        @param vertex_size: vertex size in pixels
-        @param edge_colors: the edge colors. Either it is the name
-          of an edge attribute to use, or a list explicitly specifying
-          the colors. A color can be anything acceptable in an SVG
-          file.
-        @param font_size: font size. If it is a string, it is written into
-          the SVG file as-is (so you can specify anything which is valid
-          as the value of the C{font-size} style). If it is a number, it
-          is interpreted as pixel size and converted to the proper attribute
-          value accordingly.
-        """
-        if width is None and height is None:
-            width = 400
-            height = 400
-        elif width is None:
-            width = height
-        elif height is None:
-            height = width
-                
-        if width <= 0 or height <= 0:
-            raise ValueError("width and height must be positive")
-
-        if isinstance(layout, str):
-            layout = self.layout(layout, *args, **kwds)
-
-        if isinstance(labels, str):
-            try:
-                labels = self.vs.get_attribute_values(labels)
-            except KeyError:
-                labels = [x+1 for x in xrange(self.vcount())]
-        elif labels is None:
-            labels = [""] * self.vcount()
-
-        if isinstance(colors, str):
-            try:
-                colors = self.vs.get_attribute_values(colors)
-            except KeyError:
-                colors = ["red" for x in xrange(self.vcount())]
-
-        if isinstance(shapes, str):
-            try:
-                shapes = self.vs.get_attribute_values(shapes)
-            except KeyError:
-                shapes = [1] * self.vcount()
-        
-        if isinstance(edge_colors, str):
-            try:
-                edge_colors = self.es.get_attribute_values(edge_colors)
-            except KeyError:
-                edge_colors = ["black" for x in xrange(self.ecount())]
-
-        if not isinstance(font_size, str):
-            font_size = "%spx" % str(font_size)
-        else:
-            if ";" in font_size:
-                raise ValueError("font size can't contain a semicolon")
-
-        vcount = self.vcount()
-        labels.extend(str(i+1) for i in xrange(len(labels), vcount))
-        colors.extend(["red"] * (vcount - len(colors)))
-
-        f = open(fname, "w")
-
-        bbox = BoundingBox(layout.bounding_box())
-
-        sizes = [width-2*vertex_size, height-2*vertex_size]
-        w, h = bbox.width, bbox.height
-        
-        ratios = []
-        if w == 0:
-            ratios.append(1.0)
-        else:
-            ratios.append(sizes[0] / w)
-        if h == 0:
-            ratios.append(1.0)
-        else:
-            ratios.append(sizes[1] / h)
-        
-        layout = [[(row[0] - bbox.left) * ratios[0] + vertex_size, \
-                  (row[1] - bbox.top) * ratios[1] + vertex_size] \
-                  for row in layout]
-                
-        directed = self.is_directed()
-
-        print >> f, '<?xml version="1.0" encoding="UTF-8" standalone="no"?>'
-        print >> f, '<!-- Created by igraph (http://igraph.sourceforge.net/) for use in Inkscape (http://www.inkscape.org/) -->'
-        print >> f
-        print >> f, '<svg xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://creativecommons.org/ns#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:svg="http://www.w3.org/2000/svg" xmlns="http://www.w3.org/2000/svg" xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd" xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"'
-        print >> f, 'width="{0}px" height="{1}px">'.format(width, height),
-        
-        
-        edge_color_dict = {}
-        print >> f, '<defs id="defs3">'
-        for e_col in set(edge_colors):
-            if e_col == "#000000":
-                marker_index = ""
-            else:
-                marker_index = str(len(edge_color_dict))
-            # Print an arrow marker for each possible line color 
-            # This is a copy of Inkscape's standard Arrow 2 marker
-            print >> f, '<marker'
-            print >> f, '   inkscape:stockid="Arrow2Lend{0}"'.format(marker_index)
-            print >> f, '   orient="auto"'
-            print >> f, '   refY="0.0"'
-            print >> f, '   refX="0.0"'
-            print >> f, '   id="Arrow2Lend{0}"'.format(marker_index)
-            print >> f, '   style="overflow:visible;">'
-            print >> f, '  <path'
-            print >> f, '     id="pathArrow{0}"'.format(marker_index)
-            print >> f, '     style="font-size:12.0;fill-rule:evenodd;stroke-width:0.62500000;stroke-linejoin:round;fill:{0}"'.format(e_col)
-            print >> f, '     d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.9730900,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "'
-            print >> f, '     transform="scale(1.1) rotate(180) translate(1,0)" />'
-            print >> f, '</marker>'
-            
-            edge_color_dict[e_col] = "Arrow2Lend{0}".format(marker_index)
-        print >> f, '</defs>'
-        print >> f, '<g inkscape:groupmode="layer" id="layer2" inkscape:label="Lines" sodipodi:insensitive="true">'
-       
-        for eidx, edge in enumerate(self.es):
-            vidxs = edge.tuple
-            x1 = layout[vidxs[0]][0]
-            y1 = layout[vidxs[0]][1]
-            x2 = layout[vidxs[1]][0]
-            y2 = layout[vidxs[1]][1]
-            angle = math.atan2(y2 - y1, x2 - x1)
-            x2 = x2 - vertex_size * math.cos(angle)
-            y2 = y2 - vertex_size * math.sin(angle)
-            
-            print >> f, '<path'
-            print >> f, '    style="fill:none;stroke:{0};stroke-width:2;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none{1}"'\
-                        .format(edge_colors[eidx], ";marker-end:url(#{0})".\
-                                format(edge_color_dict[edge_colors[eidx]]) \
-                                if directed else "")
-            print >> f, '    d="M {0},{1} {2},{3}"'.format(x1, y1, x2, y2)
-            print >> f, '    id="path{0}"'.format(eidx)
-            print >> f, '    inkscape:connector-type="polyline"'
-            print >> f, '    inkscape:connector-curvature="0"'
-            print >> f, '    inkscape:connection-start="#g{0}"'.format(edge.source)
-            print >> f, '    inkscape:connection-start-point="d4"'
-            print >> f, '    inkscape:connection-end="#g{0}"'.format(edge.target)
-            print >> f, '    inkscape:connection-end-point="d4" />'
-
-        print >> f, "  </g>"
-        print >> f
-
-        print >> f, '  <g inkscape:label="Nodes" \
-                    inkscape:groupmode="layer" id="layer1">'
-        print >> f, '  <!-- Vertices -->'
-
-        if any(x == 3 for x in shapes):
-            # Only import tkFont if we really need it. Unfortunately, this will
-            # flash up an unneccesary Tk window in some cases        
-            import tkFont
-            import Tkinter as tk
-            # This allows us to dynamically size the width of the nodes
-            font = tkFont.Font(root=tk.Tk(), font=("Sans", font_size, tkFont.NORMAL))
-        
-        for vidx in range(self.vcount()):
-            print >> f, '    <g id="g{0}" transform="translate({1},{2})">'.\
-                        format(vidx, layout[vidx][0], layout[vidx][1])
-            if shapes[vidx] == 1:
-                # Undocumented feature: can handle two colors but only for circles
-                c = str(colors[vidx])
-                if " " in c:
-                    c = c.split(" ")
-                    vs = str(vertex_size)
-                    print >> f, '     <path d="M -{0},0 A{0},{0} 0 0,0 {0},0 L \
-                                -{0},0" fill="{1}"/>'.format(vs, c[0])
-                    print >> f, '     <path d="M -{0},0 A{0},{0} 0 0,1 {0},0 L \
-                                -{0},0" fill="{1}"/>'.format(vs, c[1])
-                    print >> f, '     <circle cx="0" cy="0" r="{0}" fill="none"/>'\
-                                .format(vs)
-                else:
-                    print >> f, '     <circle cx="0" cy="0" r="{0}" fill="{1}"/>'.\
-                        format(str(vertex_size), str(colors[vidx]))
-            elif shapes[vidx] == 2:
-                print >> f, '      <rect x="-{0}" y="-{0}" width="{1}" height="{1}" id="rect{2}" style="fill:{3};fill-opacity:1" />'.\
-                    format(vertex_size, vertex_size * 2, vidx, colors[vidx])
-            elif shapes[vidx] == 3:
-                (vertex_width, vertex_height) = (font.measure(str(labels[vidx])) + 2, font.metrics("linespace") + 2)
-                print >> f, '      <rect ry="5" rx="5" x="-{0}" y="-{1}" width="{2}" height="{3}" id="rect{4}" style="fill:{5};fill-opacity:1" />'.\
-                    format(vertex_width / 2., vertex_height / 2., vertex_width, vertex_height, vidx, colors[vidx])
-            
-            print >> f, '      <text sodipodi:linespacing="125%" y="{0}" x="0" id="text{1}" style="font-size:{2}px;font-style:normal;font-weight:normal;text-align:center;line-height:125%;letter-spacing:0px;word-spacing:0px;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;font-family:Sans">'.format(vertex_size / 2.,vidx, font_size)
-            print >> f, '<tspan y="{0}" x="0" id="tspan{1}" sodipodi:role="line">{2}</tspan></text>'.format(vertex_size / 2.,vidx, str(labels[vidx]))
-            print >> f, '    </g>'
-
-        print >> f, '</g>'
-        print >> f
-        print >> f, '</svg>'
-                
-        f.close()
-
-
-    @classmethod
-    def _identify_format(klass, filename):
-        """_identify_format(filename)
-
-        Tries to identify the format of the graph stored in the file with the
-        given filename. It identifies most file formats based on the extension
-        of the file (and not on syntactic evaluation). The only exception is
-        the adjacency matrix format and the edge list format: the first few
-        lines of the file are evaluated to decide between the two.
-
-        @note: Internal function, should not be called directly.
-
-        @param filename: the name of the file or a file object whose C{name}
-          attribute is set.
-        @return: the format of the file as a string.
-        """
-        import os.path
-        if hasattr(filename, "name") and hasattr(filename, "read"):
-            # It is most likely a file
-            try:
-                filename=filename.name
-            except:
-                return None
-
-        root, ext = os.path.splitext(filename)
-        ext = ext.lower()
-
-        if ext == ".gz":
-            _, ext2 = os.path.splitext(root)
-            ext2 = ext2.lower()
-            if ext2 == ".pickle":
-                return "picklez"
-            elif ext2 == ".graphml":
-                return "graphmlz"
-
-        if ext in [".graphml", ".graphmlz", ".lgl", ".ncol", ".pajek",
-            ".gml", ".dimacs", ".edgelist", ".edges", ".edge", ".net",
-            ".pickle", ".picklez", ".dot", ".gw", ".lgr"]:
-            return ext[1:]
-
-        if ext == ".txt" or ext == ".dat":
-            # Most probably an adjacency matrix or an edge list
-            f = open(filename, "r")
-            line = f.readline()
-            if line is None:
-                return "edges"
-            parts = line.strip().split()
-            if len(parts) == 2:
-                line = f.readline()
-                if line is None:
-                    return "edges"
-                parts = line.strip().split()
-                if len(parts) == 2:
-                    line = f.readline()
-                    if line is None:
-                        # This is a 2x2 matrix, it can be a matrix or an edge
-                        # list as well and we cannot decide
-                        return None
-                    else:
-                        parts = line.strip().split()
-                        if len(parts) == 0:
-                            return None
-                    return "edges"
-                else:
-                    # Not a matrix
-                    return None
-            else:
-                return "adjacency"
-
-    @classmethod
-    def Read(klass, f, format=None, *args, **kwds):
-        """Unified reading function for graphs.
-
-        This method tries to identify the format of the graph given in
-        the first parameter and calls the corresponding reader method.
-
-        The remaining arguments are passed to the reader method without
-        any changes.
-
-        @param f: the file containing the graph to be loaded
-        @param format: the format of the file (if known in advance).
-          C{None} means auto-detection. Possible values are: C{"ncol"}
-          (NCOL format), C{"lgl"} (LGL format), C{"graphdb"} (GraphDB
-          format), C{"graphml"}, C{"graphmlz"} (GraphML and gzipped
-          GraphML format), C{"gml"} (GML format), C{"net"}, C{"pajek"}
-          (Pajek format), C{"dimacs"} (DIMACS format), C{"edgelist"},
-          C{"edges"} or C{"edge"} (edge list), C{"adjacency"}
-          (adjacency matrix), C{"pickle"} (Python pickled format),
-          C{"picklez"} (gzipped Python pickled format)
-        @raises IOError: if the file format can't be identified and
-          none was given.
-        """
-        if format is None:
-            format = klass._identify_format(f)
-        try:
-            reader = klass._format_mapping[format][0]
-        except (KeyError, IndexError):
-            raise IOError("unknown file format: %s" % str(format))
-        if reader is None:
-            raise IOError("no reader method for file format: %s" % str(format))
-        reader = getattr(klass, reader)
-        return reader(f, *args, **kwds)
-    Load = Read
-
-    
-    def write(self, f, format=None, *args, **kwds):
-        """Unified writing function for graphs.
-
-        This method tries to identify the format of the graph given in
-        the first parameter (based on extension) and calls the corresponding
-        writer method.
-
-        The remaining arguments are passed to the writer method without
-        any changes.
-
-        @param f: the file containing the graph to be saved
-        @param format: the format of the file (if one wants to override the
-          format determined from the filename extension, or the filename itself
-          is a stream). C{None} means auto-detection. Possible values are:
-
-            - C{"adjacency"}: adjacency matrix format
-
-            - C{"dimacs"}: DIMACS format
-
-            - C{"dot"}, C{"graphviz"}: GraphViz DOT format
-
-            - C{"edgelist"}, C{"edges"} or C{"edge"}: numeric edge list format
-
-            - C{"gml"}: GML format
-
-            - C{"graphml"} and C{"graphmlz"}: standard and gzipped GraphML
-              format
-
-            - C{"gw"}, C{"leda"}, C{"lgr"}: LEDA native format
-
-            - C{"lgl"}: LGL format
-
-            - C{"ncol"}: NCOL format
-
-            - C{"net"}, C{"pajek"}: Pajek format
-
-            - C{"pickle"}, C{"picklez"}: standard and gzipped Python pickled
-              format
-
-            - C{"svg"}: SVG format
-
-        @raises IOError: if the file format can't be identified and
-          none was given.
-        """
-        if format is None:
-            format = self._identify_format(f)
-        try:
-            writer = self._format_mapping[format][1]
-        except (KeyError, IndexError):
-            raise IOError("unknown file format: %s" % str(format))
-        if writer is None:
-            raise IOError("no writer method for file format: %s" % str(format))
-        writer = getattr(self, writer)
-        return writer(f, *args, **kwds)
-    save = write
-
-    #####################################################
-    # Constructor for dict-like representation of graphs
-
-    @classmethod
-    def DictList(klass, vertices, edges, directed=False, \
-            vertex_name_attr="name", edge_foreign_keys=("source", "target"), \
-            iterative=False):
-        """Constructs a graph from a list-of-dictionaries representation.
-
-        This representation assumes that vertices and edges are encoded in
-        two lists, each list containing a Python dict for each vertex and
-        each edge, respectively. A distinguished element of the vertex dicts
-        contain a vertex ID which is used in the edge dicts to refer to
-        source and target vertices. All the remaining elements of the dict
-        are considered vertex and edge attributes. Note that the implementation
-        does not assume that the objects passed to this method are indeed
-        lists of dicts, but they should be iterable and they should yield
-        objects that behave as dicts. So, for instance, a database query
-        result is likely to be fit as long as it's iterable and yields
-        dict-like objects with every iteration.
-
-        @param vertices: the data source for the vertices or C{None} if
-          there are no special attributes assigned to vertices and we
-          should simply use the edge list of dicts to infer vertex names.
-        @param edges: the data source for the edges.
-        @param directed: whether the constructed graph will be directed
-        @param vertex_name_attr: the name of the distinguished key in the
-          dicts in the vertex data source that contains the vertex names.
-          Ignored if C{vertices} is C{None}.
-        @param edge_foreign_keys: the name of the attributes in the dicts
-          in the edge data source that contain the source and target
-          vertex names.
-        @param iterative: whether to add the edges to the graph one by one,
-          iteratively, or to build a large edge list first and use that to
-          construct the graph. The latter approach is faster but it may
-          not be suitable if your dataset is large. The default is to
-          add the edges in a batch from an edge list.
-        @return: the graph that was constructed
-        """
-        def create_list_from_indices(l, n):
-            result = [None] * n
-            for i, v in l:
-                result[i] = v
-            return result
-
-        # Construct the vertices
-        vertex_attrs, n = {}, 0
-        if vertices:
-            for idx, vertex_data in enumerate(vertices):
-                for k, v in vertex_data.iteritems():
-                    try:
-                        vertex_attrs[k].append((idx, v))
-                    except KeyError:
-                        vertex_attrs[k] = [(idx, v)]
-                n += 1
-            for k, v in vertex_attrs.iteritems():
-                vertex_attrs[k] = create_list_from_indices(v, n)
-        else:
-            vertex_attrs[vertex_name_attr] = []
-
-        vertex_names = vertex_attrs[vertex_name_attr]
-        # Check for duplicates in vertex_names
-        if len(vertex_names) != len(set(vertex_names)):
-            raise ValueError("vertex names are not unique")
-        # Create a reverse mapping from vertex names to indices
-        vertex_name_map = UniqueIdGenerator(initial = vertex_names)
-
-        # Construct the edges
-        efk_src, efk_dest = edge_foreign_keys
-        if iterative:
-            g = klass(n, [], directed, {}, vertex_attrs)
-            for idx, edge_data in enumerate(edges):
-                src_name, dst_name = edge_data[efk_src], edge_data[efk_dest]
-                v1 = vertex_name_map[src_name]
-                if v1 == n:
-                    g.add_vertices(1)
-                    g.vs[n][vertex_name_attr] = src_name
-                    n += 1
-                v2 = vertex_name_map[dst_name]
-                if v2 == n:
-                    g.add_vertices(1)
-                    g.vs[n][vertex_name_attr] = dst_name
-                    n += 1
-                g.add_edge(v1, v2)
-                for k, v in edge_data.iteritems():
-                    g.es[idx][k] = v
-
-            return g
-        else:
-            edge_list, edge_attrs, m = [], {}, 0
-            for idx, edge_data in enumerate(edges):
-                v1 = vertex_name_map[edge_data[efk_src]]
-                v2 = vertex_name_map[edge_data[efk_dest]]
-
-                edge_list.append((v1, v2))
-                for k, v in edge_data.iteritems():
-                    try:
-                        edge_attrs[k].append((idx, v))
-                    except KeyError:
-                        edge_attrs[k] = [(idx, v)]
-                m += 1
-            for k, v in edge_attrs.iteritems():
-                edge_attrs[k] = create_list_from_indices(v, m)
-
-            # It may have happened that some vertices were added during
-            # the process
-            if len(vertex_name_map) > n:
-                diff = len(vertex_name_map) - n
-                more = [None] * diff
-                for k, v in vertex_attrs.iteritems(): v.extend(more)
-                vertex_attrs[vertex_name_attr] = vertex_name_map.values()
-                n = len(vertex_name_map)
-
-            # Create the graph
-            return klass(n, edge_list, directed, {}, vertex_attrs, edge_attrs)
-
-    #####################################################
-    # Constructor for tuple-like representation of graphs
-
-    @classmethod
-    def TupleList(klass, edges, directed=False, \
-            vertex_name_attr="name", edge_attrs=None, weights=False):
-        """Constructs a graph from a list-of-tuples representation.
-
-        This representation assumes that the edges of the graph are encoded
-        in a list of tuples (or lists). Each item in the list must have at least
-        two elements, which specify the source and the target vertices of the edge.
-        The remaining elements (if any) specify the edge attributes of that edge,
-        where the names of the edge attributes originate from the C{edge_attrs}
-        list. The names of the vertices will be stored in the vertex attribute
-        given by C{vertex_name_attr}.
-
-        The default parameters of this function are suitable for creating
-        unweighted graphs from lists where each item contains the source vertex
-        and the target vertex. If you have a weighted graph, you can use items
-        where the third item contains the weight of the edge by setting
-        C{edge_attrs} to C{"weight"} or C{["weight"]}. If you have even more
-        edge attributes, add them to the end of each item in the C{edges}
-        list and also specify the corresponding edge attribute names in
-        C{edge_attrs} as a list.
-
-        @param edges: the data source for the edges. This must be a list
-          where each item is a tuple (or list) containing at least two
-          items: the name of the source and the target vertex. Note that
-          names will be assigned to the C{name} vertex attribute (or another
-          vertex attribute if C{vertex_name_attr} is specified), even if
-          all the vertex names in the list are in fact numbers.
-        @param directed: whether the constructed graph will be directed
-        @param vertex_name_attr: the name of the vertex attribute that will
-          contain the vertex names.
-        @param edge_attrs: the names of the edge attributes that are filled
-          with the extra items in the edge list (starting from index 2, since
-          the first two items are the source and target vertices). C{None}
-          means that only the source and target vertices will be extracted
-          from each item. If you pass a string here, it will be wrapped in
-          a list for convenience.
-        @param weights: alternative way to specify that the graph is
-          weighted. If you set C{weights} to C{true} and C{edge_attrs} is
-          not given, it will be assumed that C{edge_attrs} is C{["weight"]}
-          and igraph will parse the third element from each item into an
-          edge weight. If you set C{weights} to a string, it will be assumed
-          that C{edge_attrs} contains that string only, and igraph will
-          store the edge weights in that attribute.
-        @return: the graph that was constructed
-        """
-        if edge_attrs is None:
-            if not weights:
-                edge_attrs = ()
-            else:
-                if not isinstance(weights, basestring):
-                    weights = "weight"
-                edge_attrs = [weights]
-        else:
-            if weights:
-                raise ValueError("`weights` must be False if `edge_attrs` is "
-                        "not None")
-
-        if isinstance(edge_attrs, basestring):
-            edge_attrs = [edge_attrs]
-
-        # Set up a vertex ID generator
-        idgen = UniqueIdGenerator()
-
-        # Construct the edges and the edge attributes
-        edge_list = []
-        edge_attributes = {}
-        for name in edge_attrs:
-            edge_attributes[name] = []
-
-        for item in edges:
-            edge_list.append((idgen[item[0]], idgen[item[1]]))
-            for index, name in enumerate(edge_attrs, 2):
-                try:
-                    edge_attributes[name].append(item[index])
-                except IndexError:
-                    edge_attributes[name].append(None)
-
-        # Set up the "name" vertex attribute
-        vertex_attributes = {}
-        vertex_attributes[vertex_name_attr] = idgen.values()
-        n = len(idgen)
-
-        # Construct the graph
-        return klass(n, edge_list, directed, {}, vertex_attributes, edge_attributes)
-
-    #################################
-    # Constructor for graph formulae
-    Formula=classmethod(construct_graph_from_formula)
-
-    ###########################
-    # Vertex and edge sequence
-
-    @property
-    def vs(self):
-        """The vertex sequence of the graph"""
-        return VertexSeq(self)
-
-    @property
-    def es(self):
-        """The edge sequence of the graph"""
-        return EdgeSeq(self)
-
-    #############################################
-    # Friendlier interface for bipartite methods
-    @classmethod
-    def Bipartite(klass, types, *args, **kwds):
-        """Bipartite(types, edges, directed=False)
-
-        Creates a bipartite graph with the given vertex types and edges.
-        This is similar to the default constructor of the graph, the
-        only difference is that it checks whether all the edges go
-        between the two vertex classes and it assigns the type vector
-        to a C{type} attribute afterwards.
-
-        Examples:
-
-        >>> g = Graph.Bipartite([0, 1, 0, 1], [(0, 1), (2, 3), (0, 3)])
-        >>> g.is_bipartite()
-        True
-        >>> g.vs["type"]
-        [False, True, False, True]
-
-        @param types: the vertex types as a boolean list. Anything that
-          evaluates to C{False} will denote a vertex of the first kind,
-          anything that evaluates to C{True} will denote a vertex of the
-          second kind.
-        @param edges: the edges as a list of tuples.
-        @param directed: whether to create a directed graph. Bipartite
-          networks are usually undirected, so the default is C{False}
-
-        @return: the graph with a binary vertex attribute named C{"type"} that
-          stores the vertex classes.
-        """
-        result = klass._Bipartite(types, *args, **kwds)
-        result.vs["type"] = [bool(x) for x in types]
-        return result
-
-    @classmethod
-    def Full_Bipartite(klass, *args, **kwds):
-        """Full_Bipartite(n1, n2, directed=False, mode=ALL)
-
-        Generates a full bipartite graph (directed or undirected, with or
-        without loops).
-
-        >>> g = Graph.Full_Bipartite(2, 3)
-        >>> g.is_bipartite()
-        True
-        >>> g.vs["type"]
-        [False, False, True, True, True]
-
-        @param n1: the number of vertices of the first kind.
-        @param n2: the number of vertices of the second kind.
-        @param directed: whether tp generate a directed graph.
-        @param mode: if C{OUT}, then all vertices of the first kind are
-          connected to the others; C{IN} specifies the opposite direction,
-          C{ALL} creates mutual edges. Ignored for undirected graphs.
-
-        @return: the graph with a binary vertex attribute named C{"type"} that
-          stores the vertex classes.
-        """
-        result, types = klass._Full_Bipartite(*args, **kwds)
-        result.vs["type"] = types
-        return result
-
-    @classmethod
-    def GRG(klass, n, radius, torus=False, return_coordinates=False):
-        """GRG(n, radius, torus=False, return_coordinates=False)
-
-        Generates a random geometric graph.
-
-        The algorithm drops the vertices randomly on the 2D unit square and
-        connects them if they are closer to each other than the given radius.
-        The coordinates of the vertices are stored in the vertex attributes C{x}
-        and C{y}.
-
-        @param n: The number of vertices in the graph
-        @param radius: The given radius
-        @param torus: This should be C{True} if we want to use a torus instead of a
-          square.
-        @param return_coordinates: whether the X and Y coordinates of the
-          vertices should be returned. If C{True}, a list for each dimension
-          will be returned along with the graph, packed in a tuple. This keyword
-          argument is deprecated and will be removed in igraph 0.7.
-        """
-        result, xs, ys = klass._GRG(n, radius, torus)
-        result.vs["x"] = xs
-        result.vs["y"] = ys
-        if return_coordinates:
-            deprecated("The return_coordinates=... keyword argument of Graph.GRG() is "
-                       "deprecated. It will be removed in igraph 0.7.")
-            return result, xs, ys
-        return result
-
-    @classmethod
-    def Incidence(klass, *args, **kwds):
-        """Incidence(matrix, directed=False, mode=ALL, multiple=False)
-
-        Creates a bipartite graph from an incidence matrix.
-
-        Example:
-
-        >>> g = Graph.Incidence([[0, 1, 1], [1, 1, 0]])
-
-        @param matrix: the incidence matrix.
-        @param directed: whether to create a directed graph.
-        @param mode: defines the direction of edges in the graph. If
-          C{OUT}, then edges go from vertices of the first kind
-          (corresponding to rows of the matrix) to vertices of the
-          second kind (the columns of the matrix). If C{IN}, the
-          opposite direction is used. C{ALL} creates mutual edges.
-          Ignored for undirected graphs.
-        @param multiple: defines what to do with non-zero entries in the
-          matrix. If C{False}, non-zero entries will create an edge no matter
-          what the value is. If C{True}, non-zero entries are rounded up to
-          the nearest integer and this will be the number of multiple edges
-          created.
-
-        @return: the graph with a binary vertex attribute named C{"type"} that
-          stores the vertex classes.
-        """
-        result, types = klass._Incidence(*args, **kwds)
-        result.vs["type"] = types
-        return result
-
-    def bipartite_projection(self, types="type", multiplicity=True, \
-            *args, **kwds):
-        """bipartite_projection(types="type", multiplicity=True, probe1=-1)
-
-        Projects a bipartite graph into two one-mode graphs. Edge directions
-        are ignored while projecting.
-
-        Examples:
-
-        >>> g = Graph.Full_Bipartite(10, 5)
-        >>> g1, g2 = g.bipartite_projection()
-        >>> g1.isomorphic(Graph.Full(10))
-        True
-        >>> g2.isomorphic(Graph.Full(5))
-        True
-        
-        @param types: an igraph vector containing the vertex types, or an
-          attribute name. Anything that evalulates to C{False} corresponds to
-          vertices of the first kind, everything else to the second kind.
-        @param multiplicity: if C{True}, then igraph keeps the multiplicity of
-          the edges in the projection in an edge attribute called C{"weight"}.
-          E.g., if there is an A-C-B and an A-D-B triplet in the bipartite
-          graph and there is no other X (apart from X=B and X=D) for which an
-          A-X-B triplet would exist in the bipartite graph, the multiplicity
-          of the A-B edge in the projection will be 2.
-        @param probe1: this argument can be used to specify the order of the
-          projections in the resulting list. If given and non-negative, then
-          it is considered as a vertex ID; the projection containing the
-          vertex will be the first one in the result.
-        @return: a tuple containing the two projected one-mode graphs.
-        """
-        superclass_meth = super(Graph, self).bipartite_projection
-        if multiplicity:
-            g1, g2, w1, w2 = superclass_meth(types, True, *args, **kwds)
-            g1.es["weight"] = w1
-            g2.es["weight"] = w2
-            return g1, g2
-        else:
-            return superclass_meth(types, False, *args, **kwds)
-
-    def bipartite_projection_size(self, types="type", *args, **kwds):
-        """bipartite_projection(types="type")
-
-        Calculates the number of vertices and edges in the bipartite
-        projections of this graph according to the specified vertex types.
-        This is useful if you have a bipartite graph and you want to estimate
-        the amount of memory you would need to calculate the projections
-        themselves.
-        
-        @param types: an igraph vector containing the vertex types, or an
-          attribute name. Anything that evalulates to C{False} corresponds to
-          vertices of the first kind, everything else to the second kind.
-        @return: a 4-tuple containing the number of vertices and edges in the
-          first projection, followed by the number of vertices and edges in the
-          second projection.
-        """
-        return super(Graph, self).bipartite_projection_size(types, \
-                *args, **kwds)
-
-    def get_incidence(self, types="type", *args, **kwds):
-        """get_incidence(self, types="type")
-
-        Returns the incidence matrix of a bipartite graph. The incidence matrix
-        is an M{n} times M{m} matrix, where M{n} and M{m} are the number of
-        vertices in the two vertex classes.
-
-        @param types: an igraph vector containing the vertex types, or an
-          attribute name. Anything that evalulates to C{False} corresponds to
-          vertices of the first kind, everything else to the second kind.
-        @return: the incidence matrix and two lists in a triplet. The first
-          list defines the mapping between row indices of the matrix and the
-          original vertex IDs. The second list is the same for the column
-          indices.
-        """
-        return super(Graph, self).get_incidence(types, *args, **kwds)
-
-    ###################
-    # Custom operators
-
-    def __iadd__(self, other):
-        """In-place addition (disjoint union).
-
-        @see: L{__add__}
-        """
-        if isinstance(other, (int, basestring)):
-            self.add_vertices(other)
-            return self
-        elif isinstance(other, tuple) and len(other) == 2:
-            self.add_edges([other])
-            return self
-        elif isinstance(other, list):
-            if not other:
-                return self
-            if isinstance(other[0], tuple):
-                self.add_edges(other)
-                return self
-            if isinstance(other[0], basestring):
-                self.add_vertices(other)
-                return self
-        return NotImplemented
-
-
-    def __add__(self, other):
-        """Copies the graph and extends the copy depending on the type of
-        the other object given.
-
-        @param other: if it is an integer, the copy is extended by the given
-          number of vertices. If it is a string, the copy is extended by a
-          single vertex whose C{name} attribute will be equal to the given
-          string. If it is a tuple with two elements, the copy
-          is extended by a single edge. If it is a list of tuples, the copy
-          is extended by multiple edges. If it is a L{Graph}, a disjoint
-          union is performed.
-        """
-        if isinstance(other, (int, basestring)):
-            g = self.copy()
-            g.add_vertices(other)
-        elif isinstance(other, tuple) and len(other) == 2:
-            g = self.copy()
-            g.add_edges([other])
-        elif isinstance(other, list):
-            if len(other)>0:
-                if isinstance(other[0], tuple):
-                    g = self.copy()
-                    g.add_edges(other)
-                elif isinstance(other[0], basestring):
-                    g = self.copy()
-                    g.add_vertices(other)
-                elif isinstance(other[0], Graph):
-                    return self.disjoint_union(other)
-                else:
-                    return NotImplemented
-            else:
-                return self.copy()
-
-        elif isinstance(other, Graph):
-            return self.disjoint_union(other)
-        else:
-            return NotImplemented
-
-        return g
-
-
-    def __isub__(self, other):
-        """In-place subtraction (difference).
-
-        @see: L{__sub__}"""
-        if isinstance(other, int):
-            self.delete_vertices([other])
-        elif isinstance(other, tuple) and len(other) == 2:
-            self.delete_edges([other])
-        elif isinstance(other, list):
-            if len(other)>0:
-                if isinstance(other[0], tuple):
-                    self.delete_edges(other)
-                elif isinstance(other[0], (int, long, basestring)):
-                    self.delete_vertices(other)
-                else:
-                    return NotImplemented
-        elif isinstance(other, _igraph.Vertex):
-            self.delete_vertices(other)
-        elif isinstance(other, _igraph.VertexSeq):
-            self.delete_vertices(other)
-        elif isinstance(other, _igraph.Edge):
-            self.delete_edges(other)
-        elif isinstance(other, _igraph.EdgeSeq):
-            self.delete_edges(other)
-        else:
-            return NotImplemented
-        return self
-
-
-    def __sub__(self, other):
-        """Removes the given object(s) from the graph
-
-        @param other: if it is an integer, removes the vertex with the given
-          ID from the graph (note that the remaining vertices will get
-          re-indexed!). If it is a tuple, removes the given edge. If it is
-          a graph, takes the difference of the two graphs. Accepts
-          lists of integers or lists of tuples as well, but they can't be
-          mixed! Also accepts L{Edge} and L{EdgeSeq} objects.
-        """
-        if isinstance(other, Graph):
-            return self.difference(other)
-
-        result = self.copy()
-        if isinstance(other, (int, long, basestring)):
-            result.delete_vertices([other])
-        elif isinstance(other, tuple) and len(other) == 2:
-            result.delete_edges([other])
-        elif isinstance(other, list):
-            if len(other)>0:
-                if isinstance(other[0], tuple):
-                    result.delete_edges(other)
-                elif isinstance(other[0], (int, long, basestring)):
-                    result.delete_vertices(other)
-                else:
-                    return NotImplemented
-            else:
-                return result
-        elif isinstance(other, _igraph.Vertex):
-            result.delete_vertices(other)
-        elif isinstance(other, _igraph.VertexSeq):
-            result.delete_vertices(other)
-        elif isinstance(other, _igraph.Edge):
-            result.delete_edges(other)
-        elif isinstance(other, _igraph.EdgeSeq):
-            result.delete_edges(other)
-        else:
-            return NotImplemented
-
-        return result
-
-    def __mul__(self, other):
-        """Copies exact replicas of the original graph an arbitrary number of
-        times.
-
-        @param other: if it is an integer, multiplies the graph by creating the
-          given number of identical copies and taking the disjoint union of
-          them.
-        """
-        if isinstance(other, int):
-            if other == 0:
-                return Graph()
-            elif other == 1:
-                return self
-            elif other > 1:
-                return self.disjoint_union([self]*(other-1))
-            else:
-                return NotImplemented
-
-        return NotImplemented
-
-    def __nonzero__(self):
-        """Returns True if the graph has at least one vertex, False otherwise.
-        """
-        return self.vcount() > 0
-
-    def __coerce__(self, other):
-        """Coercion rules.
-
-        This method is needed to allow the graph to react to additions
-        with lists, tuples, integers, strings, vertices, edges and so on.
-        """
-        if isinstance(other, (int, tuple, list, basestring)):
-            return self, other
-        if isinstance(other, _igraph.Vertex):
-            return self, other
-        if isinstance(other, _igraph.VertexSeq):
-            return self, other
-        if isinstance(other, _igraph.Edge):
-            return self, other
-        if isinstance(other, _igraph.EdgeSeq):
-            return self, other
-        return NotImplemented
-
-    @classmethod
-    def _reconstruct(cls, attrs, *args, **kwds):
-        """Reconstructs a Graph object from Python's pickled format.
-
-        This method is for internal use only, it should not be called
-        directly."""
-        result = cls(*args, **kwds)
-        result.__dict__.update(attrs)
-        return result
-
-    def __reduce__(self):
-        """Support for pickling."""
-        constructor = self.__class__
-        gattrs, vattrs, eattrs = {}, {}, {}
-        for attr in self.attributes():
-            gattrs[attr] = self[attr]
-        for attr in self.vs.attribute_names():
-            vattrs[attr] = self.vs[attr]
-        for attr in self.es.attribute_names():
-            eattrs[attr] = self.es[attr]
-        parameters = (self.vcount(), self.get_edgelist(), \
-            self.is_directed(), gattrs, vattrs, eattrs)
-        return (constructor, parameters, self.__dict__)
-
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Plots the graph to the given Cairo context in the given bounding box
-       
-        The visual style of vertices and edges can be modified at three
-        places in the following order of precedence (lower indices override
-        higher indices):
-
-          1. Keyword arguments of this function (or of L{plot()} which is
-             passed intact to C{Graph.__plot__()}.
-
-          2. Vertex or edge attributes, specified later in the list of
-             keyword arguments.
-
-          3. igraph-wide plotting defaults (see
-             L{igraph.config.Configuration})
-
-          4. Built-in defaults.
-
-        E.g., if the C{vertex_size} keyword attribute is not present,
-        but there exists a vertex attribute named C{size}, the sizes of
-        the vertices will be specified by that attribute.
-
-        Besides the usual self-explanatory plotting parameters (C{context},
-        C{bbox}, C{palette}), it accepts the following keyword arguments:
-
-          - C{autocurve}: whether to use curves instead of straight lines for
-            multiple edges on the graph plot. This argument may be C{True}
-            or C{False}; when omitted, C{True} is assumed for graphs with
-            less than 10.000 edges and C{False} otherwise.
-
-          - C{drawer_factory}: a subclass of L{AbstractCairoGraphDrawer}
-            which will be used to draw the graph. You may also provide
-            a function here which takes two arguments: the Cairo context
-            to draw on and a bounding box (an instance of L{BoundingBox}).
-            If this keyword argument is missing, igraph will use the
-            default graph drawer which should be suitable for most purposes.
-            It is safe to omit this keyword argument unless you need to use
-            a specific graph drawer.
-
-          - C{layout}: the layout to be used. If not an instance of
-            L{Layout}, it will be passed to L{Graph.layout} to calculate
-            the layout. Note that if you want a deterministic layout that
-            does not change with every plot, you must either use a
-            deterministic layout function (like L{Graph.layout_circle}) or
-            calculate the layout in advance and pass a L{Layout} object here.
-            
-          - C{margin}: the top, right, bottom, left margins as a 4-tuple.
-            If it has less than 4 elements or is a single float, the elements
-            will be re-used until the length is at least 4.
-
-          - C{mark_groups}: whether to highlight some of the vertex groups by
-            colored polygons. This argument can be one of the following:
-            
-              - C{False}: no groups will be highlighted
-
-              - A dict mapping tuples of vertex indices to color names.
-                The given vertex groups will be highlighted by the given
-                colors.
-
-              - A list containing pairs or an iterable yielding pairs, where
-              the first element of each pair is a list of vertex indices and
-              the second element is a color.
-
-            In place of lists of vertex indices, you may also use L{VertexSeq}
-            instances.
-
-            In place of color names, you may also use color indices into the
-            current palette. C{None} as a color name will mean that the
-            corresponding group is ignored.
-
-          - C{vertex_size}: size of the vertices. The corresponding vertex
-            attribute is called C{size}. The default is 10. Vertex sizes
-            are measured in the unit of the Cairo context on which igraph
-            is drawing.
-
-          - C{vertex_color}: color of the vertices. The corresponding vertex
-            attribute is C{color}, the default is red.  Colors can be
-            specified either by common X11 color names (see the source
-            code of L{igraph.drawing.colors} for a list of known colors), by
-            3-tuples of floats (ranging between 0 and 255 for the R, G and
-            B components), by CSS-style string specifications (C{#rrggbb})
-            or by integer color indices of the specified palette.
-
-          - C{vertex_frame_color}: color of the frame (i.e. stroke) of the
-            vertices. The corresponding vertex attribute is C{frame_color},
-            the default is black. See C{vertex_color} for the possible ways
-            of specifying a color.
-
-          - C{vertex_frame_width}: the width of the frame (i.e. stroke) of the
-            vertices. The corresponding vertex attribute is C{frame_width}.
-            The default is 1. Vertex frame widths are measured in the unit of the
-            Cairo context on which igraph is drawing.
-
-          - C{vertex_shape}: shape of the vertices. Alternatively it can
-            be specified by the C{shape} vertex attribute. Possibilities
-            are: C{square}, {circle}, {triangle}, {triangle-down} or
-            C{hidden}. See the source code of L{igraph.drawing} for a
-            list of alternative shape names that are also accepted and
-            mapped to these.
-
-          - C{vertex_label}: labels drawn next to the vertices.
-            The corresponding vertex attribute is C{label}.
-
-          - C{vertex_label_dist}: distance of the midpoint of the vertex
-            label from the center of the corresponding vertex.
-            The corresponding vertex attribute is C{label_dist}.
-
-          - C{vertex_label_color}: color of the label. Corresponding
-            vertex attribute: C{label_color}. See C{vertex_color} for
-            color specification syntax.
-
-          - C{vertex_label_size}: font size of the label, specified
-            in the unit of the Cairo context on which we are drawing.
-            Corresponding vertex attribute: C{label_size}.
-
-          - C{vertex_label_angle}: the direction of the line connecting
-            the midpoint of the vertex with the midpoint of the label.
-            This can be used to position the labels relative to the
-            vertices themselves in conjunction with C{vertex_label_dist}.
-            Corresponding vertex attribute: C{label_angle}. The
-            default is C{-math.pi/2}.
-
-          - C{vertex_order}: drawing order of the vertices. This must be
-            a list or tuple containing vertex indices; vertices are then
-            drawn according to this order.
-
-          - C{vertex_order_by}: an alternative way to specify the drawing
-            order of the vertices; this attribute is interpreted as the name
-            of a vertex attribute, and vertices are drawn such that those
-            with a smaller attribute value are drawn first. You may also
-            reverse the order by passing a tuple here; the first element of
-            the tuple should be the name of the attribute, the second element
-            specifies whether the order is reversed (C{True}, C{False},
-            C{"asc"} and C{"desc"} are accepted values).
-
-          - C{edge_color}: color of the edges. The corresponding edge
-            attribute is C{color}, the default is red. See C{vertex_color}
-            for color specification syntax.
-
-          - C{edge_curved}: whether the edges should be curved. Positive
-            numbers correspond to edges curved in a counter-clockwise
-            direction, negative numbers correspond to edges curved in a
-            clockwise direction. Zero represents straight edges. C{True}
-            is interpreted as 0.5, C{False} is interpreted as 0. The
-            default is 0 which makes all the edges straight.
-
-          - C{edge_width}: width of the edges in the default unit of the
-            Cairo context on which we are drawing. The corresponding
-            edge attribute is C{width}, the default is 1.
-
-          - C{edge_arrow_size}: arrow size of the edges. The
-            corresponding edge attribute is C{arrow_size}, the default
-            is 1.
-
-          - C{edge_arrow_width}: width of the arrowhead on the edge. The
-            corresponding edge attribute is C{arrow_width}, the default
-            is 1.
-        """
-        drawer_factory = kwds.get("drawer_factory", DefaultGraphDrawer)
-        if "drawer_factory" in kwds:
-            del kwds["drawer_factory"]
-        drawer = drawer_factory(context, bbox)
-        drawer.draw(self, palette, *args, **kwds)
-
-    def __str__(self):
-        """Returns a string representation of the graph.
-
-        Behind the scenes, this method constructs a L{GraphSummary}
-        instance and invokes its C{__str__} method with a verbosity of 1
-        and attribute printing turned off.
-
-        See the documentation of L{GraphSummary} for more details about the
-        output.
-        """
-        params = dict(
-                verbosity=1,
-                width=78,
-                print_graph_attributes=False,
-                print_vertex_attributes=False,
-                print_edge_attributes=False
-        )
-        return self.summary(**params)
-
-    def summary(self, verbosity=0, width=None, *args, **kwds):
-        """Returns the summary of the graph.
-        
-        The output of this method is similar to the output of the
-        C{__str__} method. If I{verbosity} is zero, only the header line
-        is returned (see C{__str__} for more details), otherwise the
-        header line and the edge list is printed.
-
-        Behind the scenes, this method constructs a L{GraphSummary}
-        object and invokes its C{__str__} method.
-
-        @param verbosity: if zero, only the header line is returned
-          (see C{__str__} for more details), otherwise the header line
-          and the full edge list is printed.
-        @param width: the number of characters to use in one line.
-          If C{None}, no limit will be enforced on the line lengths.
-        @return: the summary of the graph.
-        """
-        return str(GraphSummary(self, verbosity, width, *args, **kwds))
-
-    _format_mapping = {
-          "ncol":       ("Read_Ncol", "write_ncol"),
-          "lgl":        ("Read_Lgl", "write_lgl"),
-          "graphdb":    ("Read_GraphDB", None),
-          "graphmlz":   ("Read_GraphMLz", "write_graphmlz"),
-          "graphml":    ("Read_GraphML", "write_graphml"),
-          "gml":        ("Read_GML", "write_gml"),
-          "dot":		(None, "write_dot"),
-          "graphviz":	(None, "write_dot"),
-          "net":        ("Read_Pajek", "write_pajek"),
-          "pajek":      ("Read_Pajek", "write_pajek"),
-          "dimacs":     ("Read_DIMACS", "write_dimacs"),
-          "adjacency":  ("Read_Adjacency", "write_adjacency"),
-          "adj":        ("Read_Adjacency", "write_adjacency"),
-          "edgelist":   ("Read_Edgelist", "write_edgelist"),
-          "edge":       ("Read_Edgelist", "write_edgelist"),
-          "edges":      ("Read_Edgelist", "write_edgelist"),
-          "pickle":     ("Read_Pickle", "write_pickle"),
-          "picklez":    ("Read_Picklez", "write_picklez"),
-          "svg":        (None, "write_svg"),
-          "gw":         (None, "write_leda"),
-          "leda":       (None, "write_leda"),
-          "lgr":        (None, "write_leda")
-    }
-
-    _layout_mapping = {
-        "auto": "layout_auto",
-        "automatic": "layout_auto",
-        "circle": "layout_circle",
-        "circular": "layout_circle",
-        "drl": "layout_drl",
-        "fr": "layout_fruchterman_reingold",
-        "fruchterman_reingold": "layout_fruchterman_reingold",
-        "gfr": "layout_grid_fruchterman_reingold",
-        "graphopt": "layout_graphopt",
-        "grid": "layout_grid",
-        "grid_fr": "layout_grid_fruchterman_reingold",
-        "grid_fruchterman_reingold": "layout_grid_fruchterman_reingold",
-        "kk": "layout_kamada_kawai",
-        "kamada_kawai": "layout_kamada_kawai",
-        "lgl": "layout_lgl",
-        "large": "layout_lgl",
-        "large_graph": "layout_lgl",
-        "mds": "layout_mds",
-        "random": "layout_random",
-        "rt": "layout_reingold_tilford",
-        "tree": "layout_reingold_tilford",
-        "reingold_tilford": "layout_reingold_tilford",
-        "rt_circular": "layout_reingold_tilford_circular",
-        "reingold_tilford_circular": "layout_reingold_tilford_circular",
-        "sphere": "layout_sphere",
-        "spherical": "layout_sphere",
-        "star": "layout_star",
-        "sugiyama": "layout_sugiyama",
-    }
-
-    # After adjusting something here, don't forget to update the docstring
-    # of Graph.layout if necessary!
-
-##############################################################
-
-class VertexSeq(_igraph.VertexSeq):
-    """Class representing a sequence of vertices in the graph.
-    
-    This class is most easily accessed by the C{vs} field of the
-    L{Graph} object, which returns an ordered sequence of all vertices in
-    the graph. The vertex sequence can be refined by invoking the
-    L{VertexSeq.select()} method. L{VertexSeq.select()} can also be
-    accessed by simply calling the L{VertexSeq} object.
-
-    An alternative way to create a vertex sequence referring to a given
-    graph is to use the constructor directly:
-    
-      >>> g = Graph.Full(3)
-      >>> vs = VertexSeq(g)
-      >>> restricted_vs = VertexSeq(g, [0, 1])
-
-    The individual vertices can be accessed by indexing the vertex sequence
-    object. It can be used as an iterable as well, or even in a list
-    comprehension:
-    
-      >>> g=Graph.Full(3)
-      >>> for v in g.vs:
-      ...   v["value"] = v.index ** 2
-      ...
-      >>> [v["value"] ** 0.5 for v in g.vs]
-      [0.0, 1.0, 2.0]
-      
-    The vertex set can also be used as a dictionary where the keys are the
-    attribute names. The values corresponding to the keys are the values
-    of the given attribute for every vertex selected by the sequence.
-    
-      >>> g=Graph.Full(3)
-      >>> for idx, v in enumerate(g.vs):
-      ...   v["weight"] = idx*(idx+1)
-      ...
-      >>> g.vs["weight"]
-      [0, 2, 6]
-      >>> g.vs.select(1,2)["weight"] = [10, 20]
-      >>> g.vs["weight"]
-      [0, 10, 20]
-
-    If you specify a sequence that is shorter than the number of vertices in
-    the VertexSeq, the sequence is reused:
-
-      >>> g = Graph.Tree(7, 2)
-      >>> g.vs["color"] = ["red", "green"]
-      >>> g.vs["color"]
-      ['red', 'green', 'red', 'green', 'red', 'green', 'red']
-
-    You can even pass a single string or integer, it will be considered as a
-    sequence of length 1:
-
-      >>> g.vs["color"] = "red"
-      >>> g.vs["color"]
-      ['red', 'red', 'red', 'red', 'red', 'red', 'red']
-
-    Some methods of the vertex sequences are simply proxy methods to the
-    corresponding methods in the L{Graph} object. One such example is
-    L{VertexSeq.degree()}:
-
-      >>> g=Graph.Tree(7, 2)
-      >>> g.vs.degree()
-      [2, 3, 3, 1, 1, 1, 1]
-      >>> g.vs.degree() == g.degree()
-      True
-    """
-
-    def attributes(self):
-        """Returns the list of all the vertex attributes in the graph
-        associated to this vertex sequence."""
-        return self.graph.vertex_attributes()
-
-    def find(self, *args, **kwds):
-        """Returns the first vertex of the vertex sequence that matches some
-        criteria.
-
-        The selection criteria are equal to the ones allowed by L{VertexSeq.select}.
-        See L{VertexSeq.select} for more details.
-
-        For instance, to find the first vertex with name C{foo} in graph C{g}:
-
-            >>> g.vs.find(name="foo")            #doctest:+SKIP
-
-        To find an arbitrary isolated vertex:
-
-            >>> g.vs.find(_degree=0)             #doctest:+SKIP
-        """
-        if args:
-            # Selecting first based on positional arguments, then checking
-            # the criteria specified by the keyword arguments
-            vertex = _igraph.VertexSeq.find(self, *args)
-            if not kwds:
-                return vertex
-            vs = self.graph.vs[vertex.index]
-        else:
-            vs = self
-
-        # Selecting based on positional arguments
-        vs = vs.select(**kwds)
-        if vs:
-            return vs[0]
-        raise ValueError("no such vertex")
-
-    def select(self, *args, **kwds):
-        """Selects a subset of the vertex sequence based on some criteria
-        
-        The selection criteria can be specified by the positional and the keyword
-        arguments. Positional arguments are always processed before keyword
-        arguments.
-        
-          - If the first positional argument is C{None}, an empty sequence is
-            returned.
-            
-          - If the first positional argument is a callable object, the object
-            will be called for every vertex in the sequence. If it returns
-            C{True}, the vertex will be included, otherwise it will
-            be excluded.
-            
-          - If the first positional argument is an iterable, it must return
-            integers and they will be considered as indices of the current
-            vertex set (NOT the whole vertex set of the graph -- the
-            difference matters when one filters a vertex set that has
-            already been filtered by a previous invocation of
-            L{VertexSeq.select()}. In this case, the indices do not refer
-            directly to the vertices of the graph but to the elements of
-            the filtered vertex sequence.
-            
-          - If the first positional argument is an integer, all remaining
-            arguments are expected to be integers. They are considered as
-            indices of the current vertex set again.
-
-        Keyword arguments can be used to filter the vertices based on their
-        attributes. The name of the keyword specifies the name of the attribute
-        and the filtering operator, they should be concatenated by an
-        underscore (C{_}) character. Attribute names can also contain
-        underscores, but operator names don't, so the operator is always the
-        largest trailing substring of the keyword name that does not contain
-        an underscore. Possible operators are:
-
-          - C{eq}: equal to
-
-          - C{ne}: not equal to
-
-          - C{lt}: less than
-          
-          - C{gt}: greater than
-
-          - C{le}: less than or equal to
-
-          - C{ge}: greater than or equal to
-
-          - C{in}: checks if the value of an attribute is in a given list
-
-          - C{notin}: checks if the value of an attribute is not in a given
-            list
-
-        For instance, if you want to filter vertices with a numeric C{age}
-        property larger than 200, you have to write:
-
-          >>> g.vs.select(age_gt=200)                   #doctest: +SKIP
-
-        Similarly, to filter vertices whose C{type} is in a list of predefined
-        types:
-
-          >>> list_of_types = ["HR", "Finance", "Management"]
-          >>> g.vs.select(type_in=list_of_types)        #doctest: +SKIP
-
-        If the operator is omitted, it defaults to C{eq}. For instance, the
-        following selector selects vertices whose C{cluster} property equals
-        to 2:
-
-          >>> g.vs.select(cluster=2)                    #doctest: +SKIP
-
-        In the case of an unknown operator, it is assumed that the
-        recognized operator is part of the attribute name and the actual
-        operator is C{eq}.
-
-        Attribute names inferred from keyword arguments are treated specially
-        if they start with an underscore (C{_}). These are not real attributes
-        but refer to specific properties of the vertices, e.g., its degree.
-        The rule is as follows: if an attribute name starts with an underscore,
-        the rest of the name is interpreted as a method of the L{Graph} object.
-        This method is called with the vertex sequence as its first argument
-        (all others left at default values) and vertices are filtered
-        according to the value returned by the method. For instance, if you
-        want to exclude isolated vertices:
-
-          >>> g = Graph.Famous("zachary")
-          >>> non_isolated = g.vs.select(_degree_gt=0)
-
-        For properties that take a long time to be computed (e.g., betweenness
-        centrality for large graphs), it is advised to calculate the values
-        in advance and store it in a graph attribute. The same applies when
-        you are selecting based on the same property more than once in the
-        same C{select()} call to avoid calculating it twice unnecessarily.
-        For instance, the following would calculate betweenness centralities
-        twice:
-
-          >>> edges = g.vs.select(_betweenness_gt=10, _betweenness_lt=30)
-
-        It is advised to use this instead:
-
-          >>> g.vs["bs"] = g.betweenness()
-          >>> edges = g.vs.select(bs_gt=10, bs_lt=30)
-
-        @return: the new, filtered vertex sequence"""
-        vs = _igraph.VertexSeq.select(self, *args)
-
-        operators = {
-            "lt": operator.lt, \
-            "gt": operator.gt, \
-            "le": operator.le, \
-            "ge": operator.ge, \
-            "eq": operator.eq, \
-            "ne": operator.ne, \
-            "in": lambda a, b: a in b, \
-            "notin": lambda a, b: a not in b }
-        for keyword, value in kwds.iteritems():
-            if "_" not in keyword or keyword.rindex("_") == 0:
-                keyword = keyword+"_eq"
-            attr, _, op = keyword.rpartition("_")
-            try:
-                func = operators[op]
-            except KeyError:
-                # No such operator, assume that it's part of the attribute name
-                attr, func = keyword, operators["eq"]
-
-            if attr[0] == '_':
-                # Method call, not an attribute
-                values = getattr(vs.graph, attr[1:])(vs) 
-            else:
-                values = vs[attr]
-            filtered_idxs=[i for i, v in enumerate(values) if func(v, value)]
-            vs = vs.select(filtered_idxs)
-
-        return vs
-
-    def __call__(self, *args, **kwds):
-        """Shorthand notation to select()
-
-        This method simply passes all its arguments to L{VertexSeq.select()}.
-        """
-        return self.select(*args, **kwds)
-
-##############################################################
-
-class EdgeSeq(_igraph.EdgeSeq):
-    """Class representing a sequence of edges in the graph.
-    
-    This class is most easily accessed by the C{es} field of the
-    L{Graph} object, which returns an ordered sequence of all edges in
-    the graph. The edge sequence can be refined by invoking the
-    L{EdgeSeq.select()} method. L{EdgeSeq.select()} can also be
-    accessed by simply calling the L{EdgeSeq} object.
-
-    An alternative way to create an edge sequence referring to a given
-    graph is to use the constructor directly:
-    
-      >>> g = Graph.Full(3)
-      >>> es = EdgeSeq(g)
-      >>> restricted_es = EdgeSeq(g, [0, 1])
-
-    The individual edges can be accessed by indexing the edge sequence
-    object. It can be used as an iterable as well, or even in a list
-    comprehension:
-    
-      >>> g=Graph.Full(3)
-      >>> for e in g.es:
-      ...   print e.tuple
-      ...
-      (0, 1)
-      (0, 2)
-      (1, 2)
-      >>> [max(e.tuple) for e in g.es]
-      [1, 2, 2]
-      
-    The edge sequence can also be used as a dictionary where the keys are the
-    attribute names. The values corresponding to the keys are the values
-    of the given attribute of every edge in the graph:
-    
-      >>> g=Graph.Full(3)
-      >>> for idx, e in enumerate(g.es):
-      ...   e["weight"] = idx*(idx+1)
-      ...
-      >>> g.es["weight"]
-      [0, 2, 6]
-      >>> g.es["weight"] = range(3)
-      >>> g.es["weight"]
-      [0, 1, 2]
-
-    If you specify a sequence that is shorter than the number of edges in
-    the EdgeSeq, the sequence is reused:
-
-      >>> g = Graph.Tree(7, 2)
-      >>> g.es["color"] = ["red", "green"]
-      >>> g.es["color"]
-      ['red', 'green', 'red', 'green', 'red', 'green']
-
-    You can even pass a single string or integer, it will be considered as a
-    sequence of length 1:
-
-      >>> g.es["color"] = "red"
-      >>> g.es["color"]
-      ['red', 'red', 'red', 'red', 'red', 'red']
-
-    Some methods of the edge sequences are simply proxy methods to the
-    corresponding methods in the L{Graph} object. One such example is
-    L{EdgeSeq.is_multiple()}:
-
-      >>> g=Graph(3, [(0,1), (1,0), (1,2)])
-      >>> g.es.is_multiple()
-      [False, True, False]
-      >>> g.es.is_multiple() == g.is_multiple()
-      True
-    """
-
-    def attributes(self):
-        """Returns the list of all the edge attributes in the graph
-        associated to this edge sequence."""
-        return self.graph.edge_attributes()
-
-    def find(self, *args, **kwds):
-        """Returns the first edge of the edge sequence that matches some
-        criteria.
-
-        The selection criteria are equal to the ones allowed by L{VertexSeq.select}.
-        See L{VertexSeq.select} for more details.
-
-        For instance, to find the first edge with weight larger than 5 in graph C{g}:
-
-            >>> g.es.find(weight_gt=5)           #doctest:+SKIP
-        """
-        if args:
-            # Selecting first based on positional arguments, then checking
-            # the criteria specified by the keyword arguments
-            edge = _igraph.EdgeSeq.find(self, *args)
-            if not kwds:
-                return edge
-            es = self.graph.es[edge.index]
-        else:
-            es = self
-
-        # Selecting based on positional arguments
-        es = es.select(**kwds)
-        if es:
-            return es[0]
-        raise ValueError("no such edge")
-
-    def select(self, *args, **kwds):
-        """Selects a subset of the edge sequence based on some criteria
-        
-        The selection criteria can be specified by the positional and the
-        keyword arguments. Positional arguments are always processed before
-        keyword arguments.
-        
-          - If the first positional argument is C{None}, an empty sequence is
-            returned.
-            
-          - If the first positional argument is a callable object, the object
-            will be called for every edge in the sequence. If it returns
-            C{True}, the edge will be included, otherwise it will
-            be excluded.
-            
-          - If the first positional argument is an iterable, it must return
-            integers and they will be considered as indices of the current
-            edge set (NOT the whole edge set of the graph -- the
-            difference matters when one filters an edge set that has
-            already been filtered by a previous invocation of
-            L{EdgeSeq.select()}. In this case, the indices do not refer
-            directly to the edges of the graph but to the elements of
-            the filtered edge sequence.
-            
-          - If the first positional argument is an integer, all remaining
-            arguments are expected to be integers. They are considered as
-            indices of the current edge set again.
-
-        Keyword arguments can be used to filter the edges based on their
-        attributes and properties. The name of the keyword specifies the name
-        of the attribute and the filtering operator, they should be
-        concatenated by an underscore (C{_}) character. Attribute names can
-        also contain underscores, but operator names don't, so the operator is
-        always the largest trailing substring of the keyword name that does not
-        contain an underscore. Possible operators are:
-
-          - C{eq}: equal to
-
-          - C{ne}: not equal to
-
-          - C{lt}: less than
-          
-          - C{gt}: greater than
-
-          - C{le}: less than or equal to
-
-          - C{ge}: greater than or equal to
-
-          - C{in}: checks if the value of an attribute is in a given list
-
-          - C{notin}: checks if the value of an attribute is not in a given
-            list
-
-        For instance, if you want to filter edges with a numeric C{weight}
-        property larger than 50, you have to write:
-
-          >>> g.es.select(weight_gt=50)            #doctest: +SKIP
-
-        Similarly, to filter edges whose C{type} is in a list of predefined
-        types:
-
-          >>> list_of_types = ["inhibitory", "excitatory"]
-          >>> g.es.select(type_in=list_of_types)   #doctest: +SKIP
-
-        If the operator is omitted, it defaults to C{eq}. For instance, the
-        following selector selects edges whose C{type} property is
-        C{intracluster}:
-
-          >>> g.es.select(type="intracluster")     #doctest: +SKIP
-
-        In the case of an unknown operator, it is assumed that the
-        recognized operator is part of the attribute name and the actual
-        operator is C{eq}.
-
-        Keyword arguments are treated specially if they start with an
-        underscore (C{_}). These are not real attributes but refer to specific
-        properties of the edges, e.g., their centrality.  The rules are as
-        follows:
-
-          1. C{_source} or {_from} means the source vertex of an edge.
-
-          2. C{_target} or {_to} means the target vertex of an edge.
-
-          3. C{_within} ignores the operator and checks whether both endpoints
-             of the edge lie within a specified set.
-
-          4. C{_between} ignores the operator and checks whether I{one}
-             endpoint of the edge lies within a specified set and the I{other}
-             endpoint lies within another specified set. The two sets must be
-             given as a tuple.
-
-          5. Otherwise, the rest of the name is interpreted as a method of the
-             L{Graph} object. This method is called with the edge sequence as
-             its first argument (all others left at default values) and edges
-             are filtered according to the value returned by the method.
-             
-        For instance, if you want to exclude edges with a betweenness
-        centrality less than 2:
-
-          >>> g = Graph.Famous("zachary")
-          >>> excl = g.es.select(_edge_betweenness_ge = 2)
-
-        To select edges originating from vertices 2 and 4:
-
-          >>> edges = g.es.select(_source_in = [2, 4]) 
-
-        To select edges lying entirely within the subgraph spanned by vertices
-        2, 3, 4 and 7:
-
-          >>> edges = g.es.select(_within = [2, 3, 4, 7])
-
-        To select edges with one endpoint in the vertex set containing vertices
-        2, 3, 4 and 7 and the other endpoint in the vertex set containing
-        vertices 8 and 9:
-
-          >>> edges = g.es.select(_between = ([2, 3, 4, 7], [8, 9]))
-
-        For properties that take a long time to be computed (e.g., betweenness
-        centrality for large graphs), it is advised to calculate the values
-        in advance and store it in a graph attribute. The same applies when
-        you are selecting based on the same property more than once in the
-        same C{select()} call to avoid calculating it twice unnecessarily.
-        For instance, the following would calculate betweenness centralities
-        twice:
-
-          >>> edges = g.es.select(_edge_betweenness_gt=10,       # doctest:+SKIP
-          ...                     _edge_betweenness_lt=30)
-
-        It is advised to use this instead:
-
-          >>> g.es["bs"] = g.edge_betweenness()
-          >>> edges = g.es.select(bs_gt=10, bs_lt=30)
-
-        @return: the new, filtered edge sequence"""
-        es = _igraph.EdgeSeq.select(self, *args)
-
-        def _ensure_set(value):
-            if isinstance(value, VertexSeq):
-                value = set(v.index for v in value)
-            elif not isinstance(value, (set, frozenset)):
-                value = set(value)
-            return value
-
-        operators = {
-            "lt": operator.lt, \
-            "gt": operator.gt, \
-            "le": operator.le, \
-            "ge": operator.ge, \
-            "eq": operator.eq, \
-            "ne": operator.ne, \
-            "in": lambda a, b: a in b, \
-            "notin": lambda a, b: a not in b }
-        for keyword, value in kwds.iteritems():
-            if "_" not in keyword or keyword.rindex("_") == 0:
-                keyword = keyword+"_eq"
-            pos = keyword.rindex("_")
-            attr, op = keyword[0:pos], keyword[pos+1:]
-            try:
-                func = operators[op]
-            except KeyError:
-                # No such operator, assume that it's part of the attribute name
-                attr = "%s_%s" % (attr,op)
-                func = operators["eq"]
-
-            if attr[0] == '_':
-                if attr == "_source" or attr == "_from":
-                    values = [e.source for e in es]
-                    if op == "in" or op == "notin":
-                        value = _ensure_set(value)
-                elif attr == "_target" or attr == "_to":
-                    values = [e.target for e in es]
-                    if op == "in" or op == "notin":
-                        value = _ensure_set(value)
-                elif attr == "_within":
-                    func = None          # ignoring function, filtering here
-                    value = _ensure_set(value)
-
-                    # Fetch all the edges that are incident on at least one of
-                    # the vertices specified
-                    candidates = set()
-                    for v in value:
-                        candidates.update(es.graph.incident(v))
-                    
-                    if not es.is_all():
-                        # Find those where both endpoints are OK
-                        filtered_idxs = [i for i, e in enumerate(es) if e.index in candidates
-                                and e.source in value and e.target in value]
-                    else:
-                        # Optimized version when the edge sequence contains all the edges
-                        # exactly once in increasing order of edge IDs
-                        filtered_idxs = [i for i in candidates
-                                if es[i].source in value and es[i].target in value]
-                elif attr == "_between":
-                    if len(value) != 2:
-                        raise ValueError("_between selector requires two vertex ID lists")
-                    func = None          # ignoring function, filtering here
-                    set1 = _ensure_set(value[0])
-                    set2 = _ensure_set(value[1])
-
-                    # Fetch all the edges that are incident on at least one of
-                    # the vertices specified
-                    candidates = set()
-                    for v in set1:
-                        candidates.update(es.graph.incident(v))
-                    for v in set2:
-                        candidates.update(es.graph.incident(v))
-
-                    if not es.is_all():
-                        # Find those where both endpoints are OK
-                        filtered_idxs = [i for i, e in enumerate(es)
-                                if (e.source in set1 and e.target in set2) or
-                                (e.target in set1 and e.source in set2)]
-                    else:
-                        # Optimized version when the edge sequence contains all the edges
-                        # exactly once in increasing order of edge IDs
-                        filtered_idxs = [i for i in candidates
-                                if (es[i].source in set1 and es[i].target in set2) or
-                                (es[i].target in set1 and es[i].source in set2)]
-                else:
-                    # Method call, not an attribute
-                    values = getattr(es.graph, attr[1:])(es) 
-            else:
-                values = es[attr]
-
-            # If we have a function to apply on the values, do that; otherwise
-            # we assume that filtered_idxs has already been calculated.
-            if func is not None:
-                filtered_idxs=[i for i, v in enumerate(values) \
-                               if func(v, value)]
-
-            es = es.select(filtered_idxs)
-
-        return es
-
-
-    def __call__(self, *args, **kwds):
-        """Shorthand notation to select()
-
-        This method simply passes all its arguments to L{EdgeSeq.select()}.
-        """
-        return self.select(*args, **kwds)
-
-##############################################################
-# Additional methods of VertexSeq and EdgeSeq that call Graph methods
-
-def _graphmethod(func=None, name=None):
-    """Auxiliary decorator
-    
-    This decorator allows some methods of L{VertexSeq} and L{EdgeSeq} to
-    call their respective counterparts in L{Graph} to avoid code duplication.
-
-    @param func: the function being decorated. This function will be
-      called on the results of the original L{Graph} method.
-      If C{None}, defaults to the identity function.
-    @param name: the name of the corresponding method in L{Graph}. If
-      C{None}, it defaults to the name of the decorated function.
-    @return: the decorated function
-    """
-    if name is None:
-        name = func.__name__
-    method = getattr(Graph, name)
-
-    if hasattr(func, "__call__"):
-        def decorated(*args, **kwds):
-            self = args[0].graph
-            return func(args[0], method(self, *args, **kwds))
-    else:
-        def decorated(*args, **kwds):
-            self = args[0].graph
-            return method(self, *args, **kwds)
-
-    decorated.__name__ = name
-    decorated.__doc__ = """Proxy method to L{Graph.%(name)s()}
-
-This method calls the C{%(name)s()} method of the L{Graph} class
-restricted to this sequence, and returns the result.
-
-@see: Graph.%(name)s() for details.
-""" % { "name": name }
-
-    return decorated
-
-def _add_proxy_methods():
-
-    # Proxy methods for VertexSeq and EdgeSeq that forward their arguments to
-    # the corresponding Graph method are constructed here. Proxy methods for
-    # Vertex and Edge are added in the C source code. Make sure that you update
-    # the C source whenever you add a proxy method here if that makes sense for
-    # an individual vertex or edge
-    decorated_methods = {}
-    decorated_methods[VertexSeq] = \
-        ["degree", "betweenness", "bibcoupling", "closeness", "cocitation",
-        "constraint", "diversity", "eccentricity", "get_shortest_paths", "maxdegree",
-        "pagerank", "personalized_pagerank", "shortest_paths", "similarity_dice",
-        "similarity_jaccard", "subgraph", "indegree", "outdegree", "isoclass",
-        "delete_vertices", "is_separator", "is_minimal_separator"]
-    decorated_methods[EdgeSeq] = \
-        ["count_multiple", "delete_edges", "is_loop", "is_multiple",
-        "is_mutual", "subgraph_edges"]
-
-    rename_methods = {}
-    rename_methods[VertexSeq] = {
-        "delete_vertices": "delete"
-    }
-    rename_methods[EdgeSeq] = {
-        "delete_edges": "delete",
-        "subgraph_edges": "subgraph"
-    }
-
-    for klass, methods in decorated_methods.iteritems():
-        for method in methods:
-            new_method_name = rename_methods[klass].get(method, method)
-            setattr(klass, new_method_name, _graphmethod(None, method))
-
-    setattr(EdgeSeq, "edge_betweenness", _graphmethod( \
-      lambda self, result: [result[i] for i in self.indices], "edge_betweenness"))
-
-_add_proxy_methods()
-
-##############################################################
-# Making sure that layout methods always return a Layout
-
-def _layout_method_wrapper(func):
-    """Wraps an existing layout method to ensure that it returns a Layout
-    instead of a list of lists.
-
-    @param func: the method to wrap. Must be a method of the Graph object.
-    @return: a new method
-    """
-    def result(*args, **kwds):
-        layout = func(*args, **kwds)
-        if not isinstance(layout, Layout):
-            layout = Layout(layout)
-        return layout
-    result.__name__ = func.__name__
-    result.__doc__  = func.__doc__
-    return result
-
-for name in dir(Graph):
-    if not name.startswith("layout_"):
-        continue
-    if name in ("layout_auto", "layout_sugiyama"):
-        continue
-    setattr(Graph, name, _layout_method_wrapper(getattr(Graph, name)))
-
-##############################################################
-# Adding aliases for the 3D versions of the layout methods
-
-def _3d_version_for(func):
-    """Creates an alias for the 3D version of the given layout algoritm.
-
-    This function is a decorator that creates a method which calls I{func} after
-    attaching C{dim=3} to the list of keyword arguments.
-
-    @param func: must be a method of the Graph object.
-    @return: a new method
-    """
-    def result(*args, **kwds):
-        kwds["dim"] = 3
-        return func(*args, **kwds)
-    result.__name__ = "%s_3d" % func.__name__
-    result.__doc__ = """Alias for L{%s()} with dim=3.\n\n@see: Graph.%s()""" \
-            % (func.__name__, func.__name__)
-    return result
-
-Graph.layout_fruchterman_reingold_3d=_3d_version_for(Graph.layout_fruchterman_reingold)
-Graph.layout_kamada_kawai_3d=_3d_version_for(Graph.layout_kamada_kawai)
-Graph.layout_random_3d=_3d_version_for(Graph.layout_random)
-Graph.layout_grid_3d=_3d_version_for(Graph.layout_grid)
-Graph.layout_sphere=_3d_version_for(Graph.layout_circle)
-
-##############################################################
-
-def autocurve(graph, attribute="curved", default=0):
-    """Calculates curvature values for each of the edges in the graph to make
-    sure that multiple edges are shown properly on a graph plot.
-
-    This function checks the multiplicity of each edge in the graph and
-    assigns curvature values (numbers between -1 and 1, corresponding to
-    CCW (-1), straight (0) and CW (1) curved edges) to them. The assigned
-    values are either stored in an edge attribute or returned as a list,
-    depending on the value of the I{attribute} argument.
-
-    @param graph: the graph on which the calculation will be run
-    @param attribute: the name of the edge attribute to save the curvature
-      values to. The default value is C{curved}, which is the name of the
-      edge attribute the default graph plotter checks to decide whether an
-      edge should be curved on the plot or not. If I{attribute} is C{None},
-      the result will not be stored.
-    @param default: the default curvature for single edges. Zero means that
-      single edges will be straight. If you want single edges to be curved
-      as well, try passing 0.5 or -0.5 here.
-    @return: the list of curvature values if I{attribute} is C{None},
-      otherwise C{None}.
-    """
-
-    # The following loop could be re-written in C if it turns out to be a
-    # bottleneck. Unfortunately we cannot use Graph.count_multiple() here
-    # because we have to ignore edge directions.
-    multiplicities = defaultdict(list)
-    for edge in graph.es:
-        u, v = edge.tuple
-        if u > v:
-            multiplicities[v, u].append(edge.index)
-        else:
-            multiplicities[u, v].append(edge.index)
-
-    result = [default] * graph.ecount()
-    for pair, eids in multiplicities.iteritems():
-        # Is it a single edge?
-        if len(eids) < 2:
-            continue
-
-        if len(eids) % 2 == 1:
-            # Odd number of edges; the last will be straight
-            result[eids.pop()] = 0
-
-        # Arrange the remaining edges
-        curve = 2.0 / (len(eids) + 2)
-        dcurve, sign = curve, 1
-        for idx, eid in enumerate(eids):
-            edge = graph.es[eid]
-            if edge.source > edge.target:
-                result[eid] = -sign*curve
-            else:
-                result[eid] = sign*curve
-            if idx % 2 == 1:
-                curve += dcurve
-            sign *= -1
-
-    if attribute is None:
-        return result
-
-    graph.es[attribute] = result
-
-
-def read(filename, *args, **kwds):
-    """Loads a graph from the given filename.
-
-    This is just a convenience function, calls L{Graph.Read} directly.
-    All arguments are passed unchanged to L{Graph.Read}
-    
-    @param filename: the name of the file to be loaded
-    """
-    return Graph.Read(filename, *args, **kwds)
-load=read
-
-def write(graph, filename, *args, **kwds):
-    """Saves a graph to the given file.
-
-    This is just a convenience function, calls L{Graph.write} directly.
-    All arguments are passed unchanged to L{Graph.write}
-
-    @param graph: the graph to be saved
-    @param filename: the name of the file to be written
-    """
-    return graph.write(filename, *args, **kwds)
-save=write
-
-def summary(obj, stream=None, *args, **kwds):
-    """Prints a summary of object o to a given stream
-
-    Positional and keyword arguments not explicitly mentioned here are passed
-    on to the underlying C{summary()} method of the object if it has any.
-
-    @param obj: the object about which a human-readable summary is requested.
-    @param stream: the stream to be used. If C{None}, the standard output
-      will be used.
-    """
-    if stream is None:
-        stream = sys.stdout
-    if hasattr(obj, "summary"):
-        stream.write(obj.summary(*args, **kwds))
-    else:
-        stream.write(str(obj))
-    stream.write("\n")
-
-config = configuration.init()
-del construct_graph_from_formula
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/app/__init__.py igraph-0.6.5/interfaces/python/igraph/app/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/app/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/app/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-"""User interfaces of igraph"""
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/app/shell.py igraph-0.6.5/interfaces/python/igraph/app/shell.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/app/shell.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/app/shell.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,502 +0,0 @@
-"""Command-line user interface of igraph
-
-The command-line interface launches a Python shell with the igraph
-module automatically imported into the main namespace. This is mostly a
-convenience module and it is used only by the C{igraph} command line
-script which executes a suitable Python shell and automatically imports
-C{igraph}'s classes and functions in the top-level namespace.
-
-Supported Python shells are:
-
-  - IDLE shell (class L{IDLEShell})
-  - IPython shell (class L{IPythonShell})
-  - Classic Python shell (class L{ClassicPythonShell})
-
-The shells are tried in the above mentioned preference order one by
-one, unless the C{global.shells} configuration key is set which
-overrides the default order. IDLE shell is only tried in Windows
-unless explicitly stated by C{global.shells}, since Linux and
-Mac OS X users are likely to invoke igraph from the command line.
-"""
-
-# pylint: disable-msg=W0401
-# W0401: wildcard import. That's exactly what we need for the shell.
-from igraph import __version__, set_progress_handler, set_status_handler
-from igraph.configuration import Configuration
-import sys, re
-
-# pylint: disable-msg=C0103,R0903
-# C0103: invalid name. Disabled because this is a third-party class.
-# R0903: too few public methods.
-class TerminalController:
-    """
-    A class that can be used to portably generate formatted output to
-    a terminal.  
-    
-    `TerminalController` defines a set of instance variables whose
-    values are initialized to the control sequence necessary to
-    perform a given action.  These can be simply included in normal
-    output to the terminal:
-
-        >>> term = TerminalController()
-        >>> print 'This is '+term.GREEN+'green'+term.NORMAL
-        This is green
-
-    Alternatively, the `render()` method can used, which replaces
-    '${action}' with the string required to perform 'action':
-
-        >>> term = TerminalController()
-        >>> print term.render('This is ${GREEN}green${NORMAL}')
-        This is green
-
-    If the terminal doesn't support a given action, then the value of
-    the corresponding instance variable will be set to ''.  As a
-    result, the above code will still work on terminals that do not
-    support color, except that their output will not be colored.
-    Also, this means that you can test whether the terminal supports a
-    given action by simply testing the truth value of the
-    corresponding instance variable:
-
-        >>> term = TerminalController()
-        >>> if term.CLEAR_SCREEN:
-        ...     print 'This terminal supports clearning the screen.'
-        ...
-
-    Finally, if the width and height of the terminal are known, then
-    they will be stored in the `COLS` and `LINES` attributes.
-    
-    @author: Edward Loper
-    """
-    # Cursor movement:
-    BOL = ''             #: Move the cursor to the beginning of the line
-    UP = ''              #: Move the cursor up one line
-    DOWN = ''            #: Move the cursor down one line
-    LEFT = ''            #: Move the cursor left one char
-    RIGHT = ''           #: Move the cursor right one char
-
-    # Deletion:
-    CLEAR_SCREEN = ''    #: Clear the screen and move to home position
-    CLEAR_EOL = ''       #: Clear to the end of the line.
-    CLEAR_BOL = ''       #: Clear to the beginning of the line.
-    CLEAR_EOS = ''       #: Clear to the end of the screen
-
-    # Output modes:
-    BOLD = ''            #: Turn on bold mode
-    BLINK = ''           #: Turn on blink mode
-    DIM = ''             #: Turn on half-bright mode
-    REVERSE = ''         #: Turn on reverse-video mode
-    NORMAL = ''          #: Turn off all modes
-
-    # Cursor display:
-    HIDE_CURSOR = ''     #: Make the cursor invisible
-    SHOW_CURSOR = ''     #: Make the cursor visible
-
-    # Terminal size:
-    COLS = None          #: Width of the terminal (None for unknown)
-    LINES = None         #: Height of the terminal (None for unknown)
-
-    # Foreground colors:
-    BLACK = BLUE = GREEN = CYAN = RED = MAGENTA = YELLOW = WHITE = ''
-    
-    # Background colors:
-    BG_BLACK = BG_BLUE = BG_GREEN = BG_CYAN = ''
-    BG_RED = BG_MAGENTA = BG_YELLOW = BG_WHITE = ''
-    
-    _STRING_CAPABILITIES = """
-    BOL=cr UP=cuu1 DOWN=cud1 LEFT=cub1 RIGHT=cuf1
-    CLEAR_SCREEN=clear CLEAR_EOL=el CLEAR_BOL=el1 CLEAR_EOS=ed BOLD=bold
-    BLINK=blink DIM=dim REVERSE=rev UNDERLINE=smul NORMAL=sgr0
-    HIDE_CURSOR=cinvis SHOW_CURSOR=cnorm""".split()
-    _COLORS = """BLACK BLUE GREEN CYAN RED MAGENTA YELLOW WHITE""".split()
-    _ANSICOLORS = "BLACK RED GREEN YELLOW BLUE MAGENTA CYAN WHITE".split()
-
-    def __init__(self, term_stream=sys.stdout):
-        """
-        Create a `TerminalController` and initialize its attributes
-        with appropriate values for the current terminal.
-        `term_stream` is the stream that will be used for terminal
-        output; if this stream is not a tty, then the terminal is
-        assumed to be a dumb terminal (i.e., have no capabilities).
-        """
-        # Curses isn't available on all platforms
-        try:
-            import curses
-        except ImportError:
-            return
-
-        # If the stream isn't a tty, then assume it has no capabilities.
-        if not term_stream.isatty():
-            return
-
-        # Check the terminal type.  If we fail, then assume that the
-        # terminal has no capabilities.
-        try:
-            curses.setupterm()
-        except StandardError:
-            return
-
-        # Look up numeric capabilities.
-        self.COLS = curses.tigetnum('cols')
-        self.LINES = curses.tigetnum('lines')
-        
-        # Look up string capabilities.
-        for capability in self._STRING_CAPABILITIES:
-            (attrib, cap_name) = capability.split('=')
-            setattr(self, attrib, self._tigetstr(cap_name) or '')
-
-        # Colors
-        set_fg = self._tigetstr('setf')
-        if set_fg:
-            for i, color in zip(range(len(self._COLORS)), self._COLORS):
-                setattr(self, color, curses.tparm(set_fg, i) or '')
-        set_fg_ansi = self._tigetstr('setaf')
-        if set_fg_ansi:
-            for i, color in zip(range(len(self._ANSICOLORS)), self._ANSICOLORS):
-                setattr(self, color, curses.tparm(set_fg_ansi, i) or '')
-        set_bg = self._tigetstr('setb')
-        if set_bg:
-            for i, color in zip(range(len(self._COLORS)), self._COLORS):
-                setattr(self, 'BG_'+color, curses.tparm(set_bg, i) or '')
-        set_bg_ansi = self._tigetstr('setab')
-        if set_bg_ansi:
-            for i, color in zip(range(len(self._ANSICOLORS)), self._ANSICOLORS):
-                setattr(self, 'BG_'+color, curses.tparm(set_bg_ansi, i) or '')
-
-    @staticmethod
-    def _tigetstr(cap_name):
-        """Rewrites string capabilities to remove "delays" which are not
-        required for modern terminals"""
-        # String capabilities can include "delays" of the form "$<2>".
-        # For any modern terminal, we should be able to just ignore
-        # these, so strip them out.
-        import curses
-        cap = curses.tigetstr(cap_name) or ''
-        return re.sub(r'\$<\d+>[/*]?', '', cap)
-
-    def render(self, template):
-        """
-        Replace each $-substitutions in the given template string with
-        the corresponding terminal control string (if it's defined) or
-        '' (if it's not).
-        """
-        return re.sub(r'\$\$|\${\w+}', self._render_sub, template)
-
-    def _render_sub(self, match):
-        """Helper function for L{render}"""
-        s = match.group()
-        if s == '$$':
-            return s
-        else:
-            return getattr(self, s[2:-1])
-
-
-class ProgressBar:
-    """
-    A 2-line progress bar, which looks like::
-    
-                                Header
-        20% [===========----------------------------------]
-
-    The progress bar is colored, if the terminal supports color
-    output; and adjusts to the width of the terminal.
-    """
-    BAR = '%3d%% ${GREEN}[${BOLD}%s%s${NORMAL}${GREEN}]${NORMAL}'
-    HEADER = '${BOLD}${CYAN}%s${NORMAL}\n'
-        
-    def __init__(self, term):
-        self.term = term
-        if not (self.term.CLEAR_EOL and self.term.UP and self.term.BOL):
-            raise ValueError("Terminal isn't capable enough -- you "
-                             "should use a simpler progress display.")
-        self.width = self.term.COLS or 75
-        self.progress_bar = term.render(self.BAR)
-        self.header = self.term.render(self.HEADER % "".center(self.width))
-        self.cleared = True #: true if we haven't drawn the bar yet.
-
-        self.last_percent = 0
-        self.last_message = ""
-
-    def update(self, percent=None, message=None):
-        """Updates the progress bar.
-
-        @param percent: the percentage to be shown. If C{None}, the previous
-          value will be used.
-        @param message: the message to be shown above the progress bar. If
-          C{None}, the previous message will be used.
-        """
-        if self.cleared:
-            sys.stdout.write("\n"+self.header)
-            self.cleared = False
-
-        if message is None:
-            message = self.last_message
-        else:
-            self.last_message = message
-
-        if percent is None:
-            percent = self.last_percent
-        else:
-            self.last_percent = percent
-
-        n = int((self.width-10)*(percent/100.0))
-        sys.stdout.write(
-            self.term.BOL + self.term.UP + self.term.UP + self.term.CLEAR_EOL +
-            self.term.render(self.HEADER % message.center(self.width)) +
-            (self.progress_bar % (percent, '='*n, '-'*(self.width-10-n))) + "\n"
-            )
-
-    def update_message(self, message):
-        """Updates the message of the progress bar.
-
-        @param message: the message to be shown above the progress bar
-        """
-        return self.update(message=message.strip())
-
-    def clear(self):
-        """Clears the progress bar (i.e. removes it from the screen)"""
-        if not self.cleared:
-            sys.stdout.write(self.term.BOL + self.term.CLEAR_EOL +
-                             self.term.UP + self.term.CLEAR_EOL +
-                             self.term.UP + self.term.CLEAR_EOL)
-            self.cleared = True
-            self.last_percent = 0
-            self.last_message = ""
-
-
-class Shell(object):
-    """Superclass of the embeddable shells supported by igraph"""
-
-    def __init__(self):
-        pass
-
-    def __call__(self):
-        raise NotImplementedError("abstract class")
-
-    def supports_progress_bar(self):
-        """Checks whether the shell supports progress bars.
-
-        This is done by checking for the existence of an attribute
-        called C{_progress_handler}."""
-        return hasattr(self, "_progress_handler")
-
-    def supports_status_messages(self):
-        """Checks whether the shell supports status messages.
-
-        This is done by checking for the existence of an attribute
-        called C{_status_handler}."""
-        return hasattr(self, "_status_handler")
-
-    # pylint: disable-msg=E1101
-    def get_progress_handler(self):
-        """Returns the progress handler (if exists) or None (if not)."""
-        if self.supports_progress_bar():
-            return self._progress_handler
-        return None
-
-    # pylint: disable-msg=E1101
-    def get_status_handler(self):
-        """Returns the status handler (if exists) or None (if not)."""
-        if self.supports_status_messages():
-            return self._status_handler
-        return None
-
-
-class IDLEShell(Shell):
-    """IDLE embedded shell interface.
-
-    This class allows igraph to be embedded in IDLE (the Tk Python IDE).
-    
-    @todo: no progress bar support yet. Shell/Restart Shell command should
-      re-import igraph again."""
-    
-    def __init__(self):
-        """Constructor.
-
-        Imports IDLE's embedded shell. The implementation of this method is
-        ripped from idlelib.PyShell.main() after removing the unnecessary
-        parts."""
-        Shell.__init__(self)
-
-        import idlelib.PyShell
-        
-        idlelib.PyShell.use_subprocess = True
-        
-        try:
-            sys.ps1
-        except AttributeError:
-            sys.ps1 = '>>> '
-
-        root = idlelib.PyShell.Tk(className="Idle")
-        idlelib.PyShell.fixwordbreaks(root)
-        root.withdraw()
-        flist = idlelib.PyShell.PyShellFileList(root)
-        if not flist.open_shell():
-            raise NotImplementedError
-        self._shell = flist.pyshell
-        self._root = root
-
-    def __call__(self):
-        """Starts the shell"""
-        self._shell.interp.execsource("from igraph import *")
-        self._root.mainloop()
-        self._root.destroy()
-
-
-class ConsoleProgressBarMixin(object):
-    """Mixin class for console shells that support a progress bar."""
-
-    def __init__(self):
-        try:
-            self.__class__.progress_bar = ProgressBar(TerminalController())
-        except ValueError:
-            # Terminal is not capable enough, disable progress handler
-            del self.__class__._progress_handler
-            del self.__class__._status_handler
-
-    @classmethod
-    def _progress_handler(cls, message, percentage):
-        """Progress bar handler, called when C{igraph} reports the progress
-        of an operation
-
-        @param message: message provided by C{igraph}
-        @param percentage: percentage provided by C{igraph}
-        """
-        if percentage >= 100:
-            cls.progress_bar.clear()
-        else:
-            cls.progress_bar.update(percentage, message)
-
-    @classmethod
-    def _status_handler(cls, message):
-        """Status message handler, called when C{igraph} sends a status
-        message to be displayed.
-
-        @param message: message provided by C{igraph}
-        """
-        cls.progress_bar.update_message(message)
-
-
-class IPythonShell(Shell, ConsoleProgressBarMixin):
-    """IPython embedded shell interface.
-
-    This class allows igraph to be embedded in IPython's interactive shell."""
-
-    def __init__(self):
-        """Constructor.
-
-        Imports IPython's embedded shell with separator lines removed."""
-        Shell.__init__(self)
-        ConsoleProgressBarMixin.__init__(self)
-
-        # We cannot use IPShellEmbed here because generator expressions do not
-        # work there (e.g., set(g.degree(x) for x in [1,2,3])) where g comes
-        # from an external context
-        import sys
-
-        from IPython import __version__ as ipython_version
-        self.ipython_version = ipython_version
-
-        try:
-            # IPython >= 0.11 supports this
-            from IPython.frontend.terminal.ipapp import TerminalIPythonApp
-            self._shell = TerminalIPythonApp.instance()
-            sys.argv.append("--nosep")
-        except ImportError:
-            # IPython 0.10 and earlier
-            import IPython.Shell
-            self._shell = IPython.Shell.start()
-            self._shell.IP.runsource("from igraph import *")
-            sys.argv.append("-nosep")
-
-    def __call__(self):
-        """Starts the embedded shell."""
-        print "igraph %s running inside " % __version__,
-        if self._shell.__class__.__name__ == "TerminalIPythonApp":
-            self._shell.initialize()
-            self._shell.shell.ex("from igraph import *")
-            self._shell.start()
-        else:
-            self._shell.mainloop()
-
-
-class ClassicPythonShell(Shell, ConsoleProgressBarMixin):
-    """Classic Python shell interface.
-
-    This class allows igraph to be embedded in Python's shell."""
-    
-    def __init__(self):
-        """Constructor.
-
-        Imports Python's classic shell"""
-        Shell.__init__(self)
-        self._shell = None
-
-        try:
-            self.__class__.progress_bar = ProgressBar(TerminalController())
-        except ValueError:
-            # Terminal is not capable enough, disable progress handler
-            del self.__class__._progress_handler
-
-    def __call__(self):
-        """Starts the embedded shell."""
-        if self._shell is None:
-            from code import InteractiveConsole
-            self._shell = InteractiveConsole()
-            print >> sys.stderr, "igraph %s running inside " % __version__,
-            self._shell.runsource("from igraph import *")
-
-        self._shell.interact()
-
-
-def main():
-    """The main entry point for igraph when invoked from the command
-    line shell"""
-    config = Configuration.instance()
-
-    if config.filename:
-        print >> sys.stderr, "Using configuration from %s" % config.filename
-    else:
-        print >> sys.stderr, "No configuration file, using defaults"
-
-    if config.has_key("shells"):
-        parts = [part.strip() for part in config["shells"].split(",")]
-        shell_classes = []
-        available_classes = dict([(k, v) for k, v in globals().iteritems() \
-            if isinstance(v, type) and issubclass(v, Shell)])
-        for part in parts:
-            klass = available_classes.get(part, None)
-            if klass is None:
-                print >> sys.stderr, "Warning: unknown shell class `%s'" % part
-                continue
-            shell_classes.append(klass)
-    else:
-        shell_classes = [IPythonShell, ClassicPythonShell]
-        import platform
-        if platform.system() == "Windows":
-            shell_classes.insert(0, IDLEShell)
-
-    shell = None
-    for shell_class in shell_classes:
-        # pylint: disable-msg=W0703
-        # W0703: catch "Exception"
-        try:
-            shell = shell_class()
-            break
-        except StandardError:
-            # Try the next one
-            pass
-
-    if isinstance(shell, Shell):
-        if config["verbose"]:
-            if shell.supports_progress_bar():
-                set_progress_handler(shell.get_progress_handler())
-            if shell.supports_status_messages():
-                set_status_handler(shell.get_status_handler())
-        shell()
-    else:
-        print >> sys.stderr, "No suitable Python shell was found."
-        print >> sys.stderr, "Check configuration variable `general.shells'."
-
-if __name__ == '__main__':
-    sys.exit(main())
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/clustering.py igraph-0.6.5/interfaces/python/igraph/clustering.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/clustering.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/clustering.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,1642 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Classes related to graph clustering.
-
-@undocumented: _handle_mark_groups_arg_for_clustering, _prepare_community_comparison"""
-
-__license__ = u"""
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-from copy import deepcopy
-from itertools import izip
-from math import pi
-from cStringIO import StringIO
-
-from igraph import community_to_membership
-from igraph.compat import property
-from igraph.configuration import Configuration
-from igraph.datatypes import UniqueIdGenerator
-from igraph.drawing.colors import ClusterColoringPalette
-from igraph.statistics import Histogram
-from igraph.summary import _get_wrapper_for_width
-from igraph.utils import str_to_orientation
-
-class Clustering(object):
-    """Class representing a clustering of an arbitrary ordered set.
-    
-    This is now used as a base for L{VertexClustering}, but it might be
-    useful for other purposes as well.
-    
-    Members of an individual cluster can be accessed by the C{[]} operator:
-    
-      >>> cl = Clustering([0,0,0,0,1,1,1,2,2,2,2])
-      >>> cl[0]
-      [0, 1, 2, 3]
-    
-    The membership vector can be accessed by the C{membership} property:
-
-      >>> cl.membership
-      [0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2]
-
-    The number of clusters can be retrieved by the C{len} function:
-
-      >>> len(cl)
-      3
-
-    You can iterate over the clustering object as if it were a regular list
-    of clusters:
-
-      >>> for cluster in cl:
-      ...     print " ".join(str(idx) for idx in cluster)
-      ...
-      0 1 2 3
-      4 5 6
-      7 8 9 10
-
-    If you need all the clusters at once as lists, you can simply convert
-    the clustering object to a list:
-
-      >>> cluster_list = list(cl)
-      >>> print cluster_list
-      [[0, 1, 2, 3], [4, 5, 6], [7, 8, 9, 10]]
-
-    @undocumented: _formatted_cluster_iterator
-    """
-
-    def __init__(self, membership, params = None):
-        """Constructor.
-
-        @param membership: the membership list -- that is, the cluster
-          index in which each element of the set belongs to.
-        @param params: additional parameters to be stored in this
-          object's dictionary."""
-        self._membership = list(membership)
-        if len(self._membership)>0:
-            self._len = max(m for m in self._membership if m is not None)+1
-        else:
-            self._len = 0
-
-        if params:
-            self.__dict__.update(params)
-    
-    def __getitem__(self, idx):
-        """Returns the members of the specified cluster.
-
-        @param idx: the index of the cluster
-        @return: the members of the specified cluster as a list
-        @raise IndexError: if the index is out of bounds"""
-        if idx < 0 or idx >= self._len:
-            raise IndexError("cluster index out of range")
-        return [i for i, e in enumerate(self._membership) if e == idx]
-
-    def __iter__(self):
-        """Iterates over the clusters in this clustering.
-
-        This method will return a generator that generates the clusters
-        one by one."""
-        clusters = [[] for _ in xrange(self._len)]
-        for idx, cluster in enumerate(self._membership):
-            clusters[cluster].append(idx)
-        return iter(clusters)
-
-    def __len__(self):
-        """Returns the number of clusters.
-
-        @return: the number of clusters
-        """
-        return self._len
-
-    def __str__(self):
-        return self.summary(verbosity=1, width=78)
-
-    def as_cover(self):
-        """Returns a L{Cover} that contains the same clusters as this clustering."""
-        return Cover(self._graph, self)
-
-    def compare_to(self, other, *args, **kwds):
-        """Compares this clustering to another one using some similarity or
-        distance metric.
-
-        This is a convenience method that simply calls L{compare_communities}
-        with the two clusterings as arguments. Any extra positional or keyword
-        argument is also forwarded to L{compare_communities}."""
-        return compare_communities(self, other, *args, **kwds)
-
-    @property
-    def membership(self):
-        """Returns the membership vector."""
-        return self._membership[:]
-
-    @property
-    def n(self):
-        """Returns the number of elements covered by this clustering."""
-        return len(self._membership)
-
-    def size(self, idx):
-        """Returns the size of a given cluster.
-
-        @param idx: the cluster in which we are interested.
-        """
-        return len(self[idx])
-
-    def sizes(self, *args):
-        """Returns the size of given clusters.
-        
-        The indices are given as positional arguments. If there are no
-        positional arguments, the function will return the sizes of all clusters.
-        """
-        counts = [0] * len(self)
-        for x in self._membership:
-            counts[x] += 1
-
-        if args:
-            return [counts[idx] for idx in args]
-
-        return counts
-    
-    def size_histogram(self, bin_width = 1):
-        """Returns the histogram of cluster sizes.
-
-        @param bin_width: the bin width of the histogram
-        @return: a L{Histogram} object
-        """
-        return Histogram(bin_width, self.sizes())
-
-    def summary(self, verbosity=0, width=None):
-        """Returns the summary of the clustering.
-        
-        The summary includes the number of items and clusters, and also the
-        list of members for each of the clusters if the verbosity is nonzero.
-        
-        @param verbosity: determines whether the cluster members should be
-          printed. Zero verbosity prints the number of items and clusters only.
-        @return: the summary of the clustering as a string.
-        """
-        out = StringIO()
-        print >>out, "Clustering with %d elements and %d clusters" % \
-                (len(self._membership), len(self))
-
-        if verbosity < 1:
-            return out.getvalue().strip()
-
-        ndigits = len(str(len(self)))
-        wrapper = _get_wrapper_for_width(width,
-                subsequent_indent = " " * (ndigits+3))
-
-        for idx, cluster in enumerate(self._formatted_cluster_iterator()):
-            wrapper.initial_indent = "[%*d] " % (ndigits, idx)
-            print >>out, "\n".join(wrapper.wrap(cluster))
-
-        return out.getvalue().strip()
-
-    def _formatted_cluster_iterator(self):
-        """Iterates over the clusters and formats them into a string to be
-        presented in the summary."""
-        for cluster in self:
-            yield ", ".join(str(member) for member in cluster)
-
-
-class VertexClustering(Clustering):
-    """The clustering of the vertex set of a graph.
-
-    This class extends L{Clustering} by linking it to a specific L{Graph} object
-    and by optionally storing the modularity score of the clustering.
-    It also provides some handy methods like getting the subgraph corresponding
-    to a cluster and such.
-
-    @note: since this class is linked to a L{Graph}, destroying the graph by the
-      C{del} operator does not free the memory occupied by the graph if there
-      exists a L{VertexClustering} that references the L{Graph}.
-
-    @undocumented: _formatted_cluster_iterator
-    """
-
-    # Allow None to be passed to __plot__ as the "palette" keyword argument
-    _default_palette = None
-
-    def __init__(self, graph, membership = None, modularity = None, \
-                 params = None, modularity_params = None):
-        """Creates a clustering object for a given graph.
-
-        @param graph: the graph that will be associated to the clustering
-        @param membership: the membership list. The length of the list must
-          be equal to the number of vertices in the graph. If C{None}, every
-          vertex is assumed to belong to the same cluster.
-        @param modularity: the modularity score of the clustering. If C{None},
-          it will be calculated when needed.
-        @param params: additional parameters to be stored in this object.
-        @param modularity_params: arguments that should be passed to
-          L{Graph.modularity} when the modularity is (re)calculated. If the
-          original graph was weighted, you should pass a dictionary
-          containing a C{weight} key with the appropriate value here.
-        """
-        if membership is None:
-            Clustering.__init__(self, [0]*graph.vcount(), params)
-        else:
-            if len(membership) != graph.vcount():
-                raise ValueError("membership list has invalid length")
-            Clustering.__init__(self, membership, params)
-
-        self._graph = graph
-        self._modularity = modularity
-        if modularity_params is None:
-            self._modularity_params = {}
-        else:
-            self._modularity_params = dict(modularity_params)
-
-    # pylint: disable-msg=C0103
-    @classmethod
-    def FromAttribute(cls, graph, attribute, intervals=None, params=None):
-        """Creates a vertex clustering based on the value of a vertex attribute.
-
-        Vertices having the same attribute will correspond to the same cluster.
-
-        @param graph: the graph on which we are working
-        @param attribute: name of the attribute on which the clustering
-            is based.
-        @param intervals: for numeric attributes, you can either pass a single
-            number or a list of numbers here. A single number means that the
-            vertices will be put in bins of that width and vertices ending up
-            in the same bin will be in the same cluster. A list of numbers
-            specify the bin positions explicitly; e.g., C{[10, 20, 30]} means
-            that there will be four categories: vertices with the attribute
-            value less than 10, between 10 and 20, between 20 and 30 and over 30.
-            Intervals are closed from the left and open from the right.
-        @param params: additional parameters to be stored in this object.
-
-        @return: a new VertexClustering object
-        """
-        from bisect import bisect
-
-        def safeintdiv(x, y):
-            """Safe integer division that handles None gracefully"""
-            if x is None:
-                return None
-            return int(x / y)
-
-        def safebisect(intervals, x):
-            """Safe list bisection that handles None gracefully"""
-            if x is None:
-                return None
-            return bisect(intervals, x)
-
-        try:
-            _ = iter(intervals)
-            iterable = True
-        except TypeError:
-            iterable = False
-        if intervals is None:
-            vec = graph.vs[attribute]
-        elif iterable:
-            intervals = list(intervals)
-            vec = [safebisect(intervals, x) for x in graph.vs[attribute]]
-        else:
-            intervals = float(intervals)
-            vec = [safeintdiv(x, intervals) for x in graph.vs[attribute]]
-
-        idgen = UniqueIdGenerator()
-        idgen[None] = None
-        vec = [idgen[i] for i in vec]
-        return cls(graph, vec, None, params)
-
-    def as_cover(self):
-        """Returns a L{VertexCover} that contains the same clusters as this
-        clustering."""
-        return VertexCover(self._graph, self)
-
-    def cluster_graph(self, combine_vertices=None, combine_edges=None):
-        """Returns a graph where each cluster is contracted into a single
-        vertex.
-
-        In the resulting graph, vertex M{i} represents cluster M{i} in this
-        clustering. Vertex M{i} and M{j} will be connected if there was
-        at least one connected vertex pair M{(a, b)} in the original graph such
-        that vertex M{a} was in cluster M{i} and vertex M{b} was in cluster
-        M{j}.
-
-        @param combine_vertices: specifies how to derive the attributes of
-          the vertices in the new graph from the attributes of the old ones.
-          See L{Graph.contract_vertices()} for more details.
-        @param combine_edges: specifies how to derive the attributes of the
-          edges in the new graph from the attributes of the old ones. See
-          L{Graph.simplify()} for more details. If you specify C{False}
-          here, edges will not be combined, and the number of edges between
-          the vertices representing the original clusters will be equal to
-          the number of edges between the members of those clusters in the
-          original graph.
-
-        @return: the new graph.
-        """
-        result = self.graph.copy()
-        result.contract_vertices(self.membership, combine_vertices)
-        if combine_edges != False:
-            result.simplify(combine_edges=combine_edges)
-        return result
-
-    def crossing(self):
-        """Returns a boolean vector where element M{i} is C{True} iff edge
-        M{i} lies between clusters, C{False} otherwise."""
-        membership = self.membership
-        return [membership[v1] != membership[v2] \
-                for v1, v2 in self.graph.get_edgelist()]
-
-    @property
-    def modularity(self):
-        """Returns the modularity score"""
-        if self._modularity is None:
-            return self.recalculate_modularity()
-        return self._modularity
-    q = modularity
-
-    @property
-    def graph(self):
-        """Returns the graph belonging to this object"""
-        return self._graph
-
-    def recalculate_modularity(self):
-        """Recalculates the stored modularity value.
-
-        This method must be called before querying the modularity score of the
-        clustering through the class member C{modularity} or C{q} if the
-        graph has been modified (edges have been added or removed) since the
-        creation of the L{VertexClustering} object.
-        
-        @return: the new modularity score
-        """
-        self._modularity = self._graph.modularity(self._membership,
-                **self._modularity_params)
-        return self._modularity
-
-
-    def subgraph(self, idx):
-        """Get the subgraph belonging to a given cluster.
-
-        @param idx: the cluster index
-        @return: a copy of the subgraph
-        @precondition: the vertex set of the graph hasn't been modified since
-          the moment the clustering was constructed.
-        """
-        return self._graph.subgraph(self[idx])
-
-
-    def subgraphs(self):
-        """Gets all the subgraphs belonging to each of the clusters.
-
-        @return: a list containing copies of the subgraphs
-        @precondition: the vertex set of the graph hasn't been modified since
-          the moment the clustering was constructed.
-        """
-        return [self._graph.subgraph(cl) for cl in self]
-
-
-    def giant(self):
-        """Returns the giant community of the clustered graph.
-
-        The giant component a community for which no larger community exists.
-        @note: there can be multiple giant communities, this method will return
-          the copy of an arbitrary one if there are multiple giant communities.
-
-        @return: a copy of the giant community.
-        @precondition: the vertex set of the graph hasn't been modified since
-          the moment the clustering was constructed.
-        """
-        ss = self.sizes()
-        max_size = max(ss)
-        return self.subgraph(ss.index(max_size))
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Plots the clustering to the given Cairo context in the given
-        bounding box.
-
-        This is done by calling L{Graph.__plot__()} with the same arguments, but
-        coloring the graph vertices according to the current clustering (unless
-        overridden by the C{vertex_color} argument explicitly).
-
-        This method understands all the positional and keyword arguments that
-        are understood by L{Graph.__plot__()}, only the differences will be
-        highlighted here:
-
-          - C{mark_groups}: whether to highlight some of the vertex groups by
-            colored polygons. Besides the values accepted by L{Graph.__plot__}
-            (i.e., a dict mapping colors to vertex indices, a list containing
-            lists of vertex indices, or C{False}), the following are also
-            accepted:
-
-              - C{True}: all the groups will be highlighted, the colors matching
-                the corresponding color indices from the current palette
-                (see the C{palette} keyword argument of L{Graph.__plot__}.
-
-              - A dict mapping cluster indices or tuples of vertex indices to
-                color names.  The given clusters or vertex groups will be
-                highlighted by the given colors.
-
-              - A list of cluster indices. This is equivalent to passing a
-                dict mapping numeric color indices from the current palette
-                to cluster indices; therefore, the cluster referred to by element
-                I{i} of the list will be highlighted by color I{i} from the
-                palette.
-
-            The value of the C{plotting.mark_groups} configuration key is also
-            taken into account here; if that configuration key is C{True} and
-            C{mark_groups} is not given explicitly, it will automatically be set
-            to C{True}.
-
-            In place of lists of vertex indices, you may also use L{VertexSeq}
-            instances.
-
-            In place of color names, you may also use color indices into the
-            current palette. C{None} as a color name will mean that the
-            corresponding group is ignored.
-
-          - C{palette}: the palette used to resolve numeric color indices to RGBA
-            values. By default, this is an instance of L{ClusterColoringPalette}.
-
-        @see: L{Graph.__plot__()} for more supported keyword arguments.
-        """
-        if "edge_color" not in kwds and "color" not in self.graph.edge_attributes():
-            # Set up a default edge coloring based on internal vs external edges
-            colors = ["grey20", "grey80"]
-            kwds["edge_color"] = [colors[is_crossing]
-                                  for is_crossing in self.crossing()]
-
-        if palette is None:
-            palette = ClusterColoringPalette(len(self))
-
-        if "mark_groups" not in kwds:
-            if Configuration.instance()["plotting.mark_groups"]:
-                kwds["mark_groups"] = (
-                    (group, color) for color, group in enumerate(self)
-                )
-        else:
-            kwds["mark_groups"] = _handle_mark_groups_arg_for_clustering(
-                    kwds["mark_groups"], self)
-
-        if "vertex_color" not in kwds:
-            kwds["vertex_color"] = self.membership
-
-        return self._graph.__plot__(context, bbox, palette, *args, **kwds)
-
-    def _formatted_cluster_iterator(self):
-        """Iterates over the clusters and formats them into a string to be
-        presented in the summary."""
-        if self._graph.is_named():
-            names = self._graph.vs["name"]
-            for cluster in self:
-                yield ", ".join(str(names[member]) for member in cluster)
-        else:
-            for cluster in self:
-                yield ", ".join(str(member) for member in cluster)
-
-
-###############################################################################
-
-class Dendrogram(object):
-    """The hierarchical clustering (dendrogram) of some dataset.
-
-    A hierarchical clustering means that we know not only the way the
-    elements are separated into groups, but also the exact history of
-    how individual elements were joined into larger subgroups.
-
-    This class internally represents the hierarchy by a matrix with n rows
-    and 2 columns -- or more precisely, a list of lists of size 2. This is
-    exactly the same as the original format used by C{igraph}'s C core.
-    The M{i}th row of the matrix contains the indices of the two clusters
-    being joined in time step M{i}. The joint group will be represented by
-    the ID M{n+i}, with M{i} starting from one. The ID of the joint group
-    will be referenced in the upcoming steps instead of any of its individual
-    members. So, IDs less than or equal to M{n} (where M{n} is the number of
-    rows in the matrix) mean the original members of the dataset (with ID
-    from 0 to M{n}), while IDs up from M{n+1} mean joint groups. As an
-    example, take a look at the dendrogram and the internal representation of
-    a given clustering of five nodes::
-
-      0 -+
-         |
-      1 -+-+
-           |
-      2 ---+-+        <====>   [[0, 1], [3, 4], [2, 5], [6, 7]]
-             |
-      3 -+   |
-         |   |
-      4 -+---+---
-
-    @undocumented: _item_box_size, _plot_item, _traverse_inorder
-    """
-
-    def __init__(self, merges):
-        """Creates a hierarchical clustering.
-
-        @param merges: the merge history either in matrix or tuple format"""
-        self._merges = [tuple(pair) for pair in merges]
-        self._nmerges = len(self._merges)
-        if self._nmerges:
-            self._nitems = max(self._merges[-1])-self._nmerges+2
-        else:
-            self._nitems = 0
-        self._names = None
-
-    @staticmethod
-    def _convert_matrix_to_tuple_repr(merges, n=None):
-        """Converts the matrix representation of a clustering to a tuple
-        representation.
-        
-        @param merges: the matrix representation of the clustering
-        @return: the tuple representation of the clustering
-        """
-        if n is None:
-            n = len(merges)+1
-        tuple_repr = range(n)
-        idxs = range(n)
-        for rowidx, row in enumerate(merges):
-            i, j = row
-            try:
-                idxi, idxj = idxs[i], idxs[j]
-                tuple_repr[idxi] = (tuple_repr[idxi], tuple_repr[idxj])
-                tuple_repr[idxj] = None
-            except IndexError:
-                raise ValueError("malformed matrix, subgroup referenced "+
-                                 "before being created in step %d" % rowidx)
-            idxs.append(j)
-        return [x for x in tuple_repr if x is not None]
-
-    def _traverse_inorder(self):
-        """Conducts an inorder traversal of the merge tree.
-
-        The inorder traversal returns the nodes on the last level in the order
-        they should be drawn so that no edges cross each other.
-
-        @return: the result of the inorder traversal in a list."""
-        stack = [self._merges[-1]]
-        result = []
-        while len(stack)>0:
-            last = stack[-1]
-            if len(last) == 0:
-                stack.pop()
-                continue
-            elif len(last) == 1:       # Right child
-                stack[-1] = ()
-                last = last[0]
-            else:                      # Left child
-                stack[-1] = (last[1],)
-                last = last[0]
-            if last < self._nitems: # This will be a regular node
-                result.append(last)
-            else:        # This is a merge node, proceed towards left
-                stack.append(self._merges[last-self._nitems])
-
-        return result
-
-    def __str__(self):
-        return self.summary(verbosity=1)
-
-    def format(self, format="newick"):
-        """Formats the dendrogram in a foreign format.
-
-        Currently only the Newick format is supported.
-        
-        Example:
-            
-            >>> d = Dendrogram([(2, 3), (0, 1), (4, 5)])
-            >>> d.format()
-            '((2,3)4,(0,1)5)6;'
-            >>> d.names = list("ABCDEFG")
-            >>> d.format()
-            '((C,D)E,(A,B)F)G;'
-        """
-        if format == "newick":
-            n = self._nitems + self._nmerges
-            if self._names is None:
-                nodes = range(n)
-            else:
-                nodes = list(self._names)
-            if len(nodes) < n:
-                nodes.extend("" for _ in xrange(n - len(nodes)))
-            for k, (i, j) in enumerate(self._merges, self._nitems):
-                nodes[k] = "(%s,%s)%s" % (nodes[i], nodes[j], nodes[k])
-                nodes[i] = nodes[j] = None
-            return nodes[-1] + ";"
-        raise ValueError("unsupported format: %r" % format)
-
-    def summary(self, verbosity=0, max_leaf_count=40):
-        """Returns the summary of the dendrogram.
-        
-        The summary includes the number of leafs and branches, and also an
-        ASCII art representation of the dendrogram unless it is too large.
-        
-        @param verbosity: determines whether the ASCII representation of the
-          dendrogram should be printed. Zero verbosity prints only the number
-          of leafs and branches.
-        @param max_leaf_count: the maximal number of leafs to print in the
-          ASCII representation. If the dendrogram has more leafs than this
-          limit, the ASCII representation will not be printed even if the
-          verbosity is larger than or equal to 1.
-        @return: the summary of the dendrogram as a string.
-        """
-        from array import array
-
-        out = StringIO()
-        print >>out, "Dendrogram, %d elements, %d merges" % \
-                (self._nitems, self._nmerges)
-
-        if self._nitems == 0 or verbosity < 1 or self._nitems > max_leaf_count:
-            return out.getvalue().strip()
-            
-        print >>out
-
-        positions = [None] * self._nitems
-        inorder = self._traverse_inorder()
-        distance = 2
-        level_distance = 2
-        nextp = 0
-        for idx, element in enumerate(inorder):
-            positions[element] = nextp
-            inorder[idx] = str(element)
-            nextp += max(distance, len(inorder[idx])+1)
-
-        width = max(positions)+1
-
-        # Print the nodes on the lowest level
-        print >>out, (" " * (distance-1)).join(inorder)
-        midx = 0
-        max_community_idx = self._nitems
-        while midx < self._nmerges:
-            char_array = array("c", " "*width)
-            for position in positions:
-                if position >= 0:
-                    char_array[position] = "|"
-            char_str = char_array.tostring()
-            for _ in xrange(level_distance-1):
-                print >>out, char_str # Print the lines
-            
-            cidx_incr = 0
-            while midx < self._nmerges:
-                id1, id2 = self._merges[midx]
-                if id1 >= max_community_idx or id2 >= max_community_idx:
-                    break
-                midx += 1
-
-                pos1, pos2 = positions[id1], positions[id2]
-                positions[id1], positions[id2] = -1, -1
-                positions.append((pos1+pos2)/2)
-
-                dashes = "-" * (pos2 - pos1 - 1)
-                char_array[pos1:(pos2+1)] = array("c", "`%s'" % dashes)
-
-                cidx_incr += 1
-            
-            max_community_idx += cidx_incr
-
-            print >>out, char_array.tostring()
-
-        return out.getvalue().strip()
-
-    def _item_box_size(self, context, horiz, idx):
-        """Calculates the amount of space needed for drawing an
-        individual vertex at the bottom of the dendrogram."""
-        if self._names is None or self._names[idx] is None:
-            x_bearing, _, _, height, x_advance, _ = context.text_extents("")
-        else:
-            x_bearing, _, _, height, x_advance, _ = context.text_extents(str(self._names[idx]))
-
-        if horiz:
-            return x_advance - x_bearing, height
-        return height, x_advance - x_bearing
-
-    # pylint: disable-msg=R0913
-    def _plot_item(self, context, horiz, idx, x, y):
-        """Plots a dendrogram item to the given Cairo context
-
-        @param context: the Cairo context we are plotting on
-        @param horiz: whether the dendrogram is horizontally oriented
-        @param idx: the index of the item
-        @param x: the X position of the item
-        @param y: the Y position of the item
-        """
-        if self._names is None or self._names[idx] is None:
-            return
-
-        height = self._item_box_size(context, True, idx)[1]
-        if horiz:
-            context.move_to(x, y+height)
-            context.show_text(str(self._names[idx]))
-        else:
-            context.save()
-            context.translate(x, y)
-            context.rotate(-pi/2.)
-            context.move_to(0, height)
-            context.show_text(str(self._names[idx]))
-            context.restore()
-
-    # pylint: disable-msg=C0103,W0613
-    # W0613 = unused argument 'palette'
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Draws the dendrogram on the given Cairo context
-
-        Supported keyword arguments are:
-
-          - C{orientation}: the orientation of the dendrogram. Must be one of
-            the following values: C{left-right}, C{bottom-top}, C{right-left}
-            or C{top-bottom}. Individual elements are always placed at the
-            former edge and merges are performed towards the latter edge.
-            Possible aliases: C{horizontal} = C{left-right},
-            C{vertical} = C{bottom-top}, C{lr} = C{left-right},
-            C{rl} = C{right-left}, C{tb} = C{top-bottom}, C{bt} = C{bottom-top}.
-            The default is C{left-right}.
-
-        """
-        from igraph.layout import Layout
-
-        if self._names is None:
-            self._names = [str(x) for x in xrange(self._nitems)]
-
-        orientation = str_to_orientation(kwds.get("orientation", "lr"),
-                reversed_vertical=True)
-        horiz = orientation in ("lr", "rl")
-
-        # Get the font height
-        font_height = context.font_extents()[2]
-
-        # Calculate space needed for individual items at the
-        # bottom of the dendrogram
-        item_boxes = [self._item_box_size(context, horiz, idx) \
-          for idx in xrange(self._nitems)]
-
-        # Small correction for cases when the right edge of the labels is
-        # aligned with the tips of the dendrogram branches
-        ygap = 2 if orientation == "bt" else 0
-        xgap = 2 if orientation == "lr" else 0
-        item_boxes = [(x+xgap, y+ygap) for x, y in item_boxes]
-
-        # Calculate coordinates
-        layout = Layout([(0, 0)] * self._nitems, dim=2)
-        inorder = self._traverse_inorder()
-        if not horiz:
-            x, y = 0, 0
-            for idx, element in enumerate(inorder):
-                layout[element] = (x, 0)
-                x += max(font_height, item_boxes[element][0])
-
-            for id1, id2 in self._merges:
-                y += 1
-                layout.append(((layout[id1][0]+layout[id2][0])/2., y))
-
-            # Mirror or rotate the layout if necessary
-            if orientation == "bt":
-                layout.mirror(1)
-        else:
-            x, y = 0, 0
-            for idx, element in enumerate(inorder):
-                layout[element] = (0, y)
-                y += max(font_height, item_boxes[element][1])
-
-            for id1, id2 in self._merges:
-                x += 1
-                layout.append((x, (layout[id1][1]+layout[id2][1])/2.))
-
-            # Mirror or rotate the layout if necessary
-            if orientation == "rl":
-                layout.mirror(0)
-        
-        # Rescale layout to the bounding box
-        maxw = max(e[0] for e in item_boxes)
-        maxh = max(e[1] for e in item_boxes)
-
-        # w, h: width and height of the area containing the dendrogram
-        # tree without the items.
-        # delta_x, delta_y: displacement of the dendrogram tree
-        width, height = float(bbox.width), float(bbox.height)
-        delta_x, delta_y = 0, 0
-        if horiz:
-            width -= maxw
-            if orientation == "lr":
-                delta_x = maxw
-        else:
-            height -= maxh
-            if orientation == "tb":
-                delta_y = maxh
-
-        if horiz:
-            delta_y += font_height / 2.
-        else:
-            delta_x += font_height / 2.
-        layout.fit_into((delta_x, delta_y, width - delta_x, height - delta_y),
-                        keep_aspect_ratio=False)
-
-        context.save()
-
-        context.translate(bbox.left, bbox.top)
-        context.set_source_rgb(0., 0., 0.)
-        context.set_line_width(1)
-        
-        # Draw items
-        if horiz:
-            sgn = 0 if orientation == "rl" else -1
-            for idx in xrange(self._nitems):
-                x = layout[idx][0] + sgn * item_boxes[idx][0]
-                y = layout[idx][1] - item_boxes[idx][1]/2.
-                self._plot_item(context, horiz, idx, x, y)
-        else:
-            sgn = 1 if orientation == "bt" else 0
-            for idx in xrange(self._nitems):
-                x = layout[idx][0] - item_boxes[idx][0]/2.
-                y = layout[idx][1] + sgn * item_boxes[idx][1]
-                self._plot_item(context, horiz, idx, x, y)
-
-        # Draw dendrogram lines
-        if not horiz:
-            for idx, (id1, id2) in enumerate(self._merges):
-                x0, y0 = layout[id1]
-                x1, y1 = layout[id2]
-                x2, y2 = layout[idx + self._nitems]
-                context.move_to(x0, y0)
-                context.line_to(x0, y2)
-                context.line_to(x1, y2)
-                context.line_to(x1, y1)
-                context.stroke()
-        else:
-            for idx, (id1, id2) in enumerate(self._merges):
-                x0, y0 = layout[id1]
-                x1, y1 = layout[id2]
-                x2, y2 = layout[idx + self._nitems]
-                context.move_to(x0, y0)
-                context.line_to(x2, y0)
-                context.line_to(x2, y1)
-                context.line_to(x1, y1)
-                context.stroke()
-
-        context.restore()
-
-    @property
-    def merges(self):
-        """Returns the performed merges in matrix format"""
-        return deepcopy(self._merges)
-
-    @property
-    def names(self):
-        """Returns the names of the nodes in the dendrogram"""
-        return self._names
-
-    @names.setter
-    def names(self, items):
-        """Sets the names of the nodes in the dendrogram"""
-        if items is None:
-            self._names = None
-            return
-
-        items = list(items)
-        if len(items) < self._nitems:
-            raise ValueError("must specify at least %d names" % self._nitems)
-
-        n = self._nitems + self._nmerges
-        self._names = items[:n]
-        if len(self._names) < n:
-            self._names.extend("" for _ in xrange(n-len(self._names)))
-
-
-class VertexDendrogram(Dendrogram):
-    """The dendrogram resulting from the hierarchical clustering of the
-    vertex set of a graph."""
-
-    def __init__(self, graph, merges, optimal_count = None, params = None,
-            modularity_params = None):
-        """Creates a dendrogram object for a given graph.
-
-        @param graph: the graph that will be associated to the clustering
-        @param merges: the merges performed given in matrix form.
-        @param optimal_count: the optimal number of clusters where the
-          dendrogram should be cut. This is a hint usually provided by the
-          clustering algorithm that produces the dendrogram. C{None} means
-          that such a hint is not available; the optimal count will then be
-          selected based on the modularity in such a case.
-        @param params: additional parameters to be stored in this object.
-        @param modularity_params: arguments that should be passed to
-          L{Graph.modularity} when the modularity is (re)calculated. If the
-          original graph was weighted, you should pass a dictionary
-          containing a C{weight} key with the appropriate value here.
-        """
-        Dendrogram.__init__(self, merges)
-        self._graph = graph
-        self._optimal_count = optimal_count
-        if modularity_params is None:
-            self._modularity_params = {}
-        else:
-            self._modularity_params = dict(modularity_params)
-
-    def as_clustering(self, n=None):
-        """Cuts the dendrogram at the given level and returns a corresponding
-        L{VertexClustering} object.
-
-        @param n: the desired number of clusters. Merges are replayed from the
-          beginning until the membership vector has exactly M{n} distinct elements
-          or until there are no more recorded merges, whichever happens first.
-          If C{None}, the optimal count hint given by the clustering algorithm
-          will be used If the optimal count was not given either, it will be
-          calculated by selecting the level where the modularity is maximal.
-        @return: a new L{VertexClustering} object.
-        """
-        if n is None:
-            n = self.optimal_count
-        num_elts = self._graph.vcount()
-        idgen = UniqueIdGenerator()
-        membership = community_to_membership(self._merges, num_elts, \
-                                             num_elts - n)
-        membership = [idgen[m] for m in membership]
-        return VertexClustering(self._graph, membership,
-                modularity_params=self._modularity_params)
-
-    @property
-    def optimal_count(self):
-        """Returns the optimal number of clusters for this dendrogram.
-
-        If an optimal count hint was given at construction time, this
-        property simply returns the hint. If such a count was not given,
-        this method calculates the optimal number of clusters by maximizing
-        the modularity along all the possible cuts in the dendrogram.
-        """
-        if self._optimal_count is not None:
-            return self._optimal_count
-
-        n = self._graph.vcount()
-        max_q, optimal_count = 0, 1
-        for step in xrange(min(n-1, len(self._merges))):
-            membs = community_to_membership(self._merges, n, step)
-            q = self._graph.modularity(membs, **self._modularity_params)
-            if q > max_q:
-                optimal_count = n-step
-                max_q = q
-        self._optimal_count = optimal_count
-
-    @optimal_count.setter
-    def optimal_count(self, value):
-        self._optimal_count = max(int(value), 1)
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Draws the vertex dendrogram on the given Cairo context
-
-        See L{Dendrogram.__plot__} for the list of supported keyword
-        arguments."""
-        from igraph.drawing.metamagic import AttributeCollectorBase
-
-        class VisualVertexBuilder(AttributeCollectorBase):
-            _kwds_prefix = "vertex_"
-            label = None
-
-        builder = VisualVertexBuilder(self._graph.vs, kwds)
-        self._names = [vertex.label for vertex in builder]
-        self._names = [name if name is not None else str(idx)
-                       for idx, name in enumerate(self._names)]
-        result = Dendrogram.__plot__(self, context, bbox, palette, \
-                *args, **kwds)
-        del self._names
-
-        return result
-
-###############################################################################
-
-class Cover(object):
-    """Class representing a cover of an arbitrary ordered set.
-
-    Covers are similar to clusterings, but each element of the set may
-    belong to more than one cluster in a cover, and elements not belonging
-    to any cluster are also allowed.
-
-    L{Cover} instances provide a similar API as L{Clustering} instances;
-    for instance, iterating over a L{Cover} will iterate over the clusters
-    just like with a regular L{Clustering} instance. However, they are not
-    derived from each other or from a common superclass, and there might
-    be functions that exist only in one of them or the other.
-
-    Clusters of an individual cover can be accessed by the C{[]} operator:
-    
-      >>> cl = Cover([[0,1,2,3], [2,3,4], [0,1,6]])
-      >>> cl[0]
-      [0, 1, 2, 3]
-    
-    The membership vector can be accessed by the C{membership} property.
-    Note that contrary to L{Clustering} instances, the membership vector
-    will contain lists that contain the cluster indices each item belongs
-    to:
-
-      >>> cl.membership
-      [[0, 2], [0, 2], [0, 1], [0, 1], [1], [], [2]]
-
-    The number of clusters can be retrieved by the C{len} function:
-
-      >>> len(cl)
-      3
-
-    You can iterate over the cover as if it were a regular list of
-    clusters:
-
-      >>> for cluster in cl:
-      ...     print " ".join(str(idx) for idx in cluster)
-      ...
-      0 1 2 3
-      2 3 4
-      0 1 6
-
-    If you need all the clusters at once as lists, you can simply convert
-    the cover to a list:
-
-      >>> cluster_list = list(cl)
-      >>> print cluster_list
-      [[0, 1, 2, 3], [2, 3, 4], [0, 1, 6]]
-
-    L{Clustering} objects can readily be converted to L{Cover} objects
-    using the constructor:
-
-      >>> clustering = Clustering([0, 0, 0, 0, 1, 1, 1, 2, 2, 2])
-      >>> cover = Cover(clustering)
-      >>> list(clustering) == list(cover)
-      True
-
-    @undocumented: _formatted_cluster_iterator
-    """
-
-    def __init__(self, clusters, n=0):
-        """Constructs a cover with the given clusters.
-
-        @param clusters: the clusters in this cover, as a list or iterable.
-          Each cluster is specified by a list or tuple that contains the
-          IDs of the items in this cluster. IDs start from zero.
-
-        @param n: the total number of elements in the set that is covered
-          by this cover. If it is less than the number of unique elements
-          found in all the clusters, we will simply use the number of unique
-          elements, so it is safe to leave this at zero. You only have to
-          specify this parameter if there are some elements that are covered
-          by none of the clusters.
-        """
-
-        self._clusters = [list(cluster) for cluster in clusters]
-        try:
-            self._n = max(max(cluster)+1 for cluster in self._clusters if cluster)
-        except ValueError:
-            self._n = 0
-        self._n = max(n, self._n)
-
-    def __getitem__(self, index):
-        """Returns the cluster with the given index."""
-        return self._clusters[index]
-
-    def __iter__(self):
-        """Iterates over the clusters in this cover."""
-        return iter(self._clusters)
-
-    def __len__(self):
-        """Returns the number of clusters in this cover."""
-        return len(self._clusters)
-
-    def __str__(self):
-        """Returns a string representation of the cover."""
-        return self.summary(verbosity=1, width=78)
-
-    @property
-    def membership(self):
-        """Returns the membership vector of this cover.
-
-        The membership vector of a cover covering I{n} elements is a list of
-        length I{n}, where element I{i} contains the cluster indices of the
-        I{i}th item.
-        """
-        result = [[] for _ in xrange(self._n)]
-        for idx, cluster in enumerate(self):
-            for item in cluster:
-                result[item].append(idx)
-        return result
-
-    @property
-    def n(self):
-        """Returns the number of elements in the set covered by this cover."""
-        return self._n
-
-    def size(self, idx):
-        """Returns the size of a given cluster.
-
-        @param idx: the cluster in which we are interested.
-        """
-        return len(self[idx])
-
-    def sizes(self, *args):
-        """Returns the size of given clusters.
-        
-        The indices are given as positional arguments. If there are no
-        positional arguments, the function will return the sizes of all clusters.
-        """
-        if args:
-            return [len(self._clusters[idx]) for idx in args]
-        return [len(cluster) for cluster in self]
-
-    def size_histogram(self, bin_width = 1):
-        """Returns the histogram of cluster sizes.
-
-        @param bin_width: the bin width of the histogram
-        @return: a L{Histogram} object
-        """
-        return Histogram(bin_width, self.sizes())
-
-    def summary(self, verbosity=0, width=None):
-        """Returns the summary of the cover.
-        
-        The summary includes the number of items and clusters, and also the
-        list of members for each of the clusters if the verbosity is nonzero.
-        
-        @param verbosity: determines whether the cluster members should be
-          printed. Zero verbosity prints the number of items and clusters only.
-        @return: the summary of the cover as a string.
-        """
-        out = StringIO()
-        print >>out, "Cover with %d clusters" % len(self)
-
-        if verbosity < 1:
-            return out.getvalue().strip()
-
-        ndigits = len(str(len(self)))
-        wrapper = _get_wrapper_for_width(width,
-                subsequent_indent = " " * (ndigits+3))
-
-        for idx, cluster in enumerate(self._formatted_cluster_iterator()):
-            wrapper.initial_indent = "[%*d] " % (ndigits, idx)
-            print >>out, "\n".join(wrapper.wrap(cluster))
-
-        return out.getvalue().strip()
-
-    def _formatted_cluster_iterator(self):
-        """Iterates over the clusters and formats them into a string to be
-        presented in the summary."""
-        for cluster in self:
-            yield ", ".join(str(member) for member in cluster)
-
-
-class VertexCover(Cover):
-    """The cover of the vertex set of a graph.
-
-    This class extends L{Cover} by linking it to a specific L{Graph} object.
-    It also provides some handy methods like getting the subgraph corresponding
-    to a cluster and such.
-
-    @note: since this class is linked to a L{Graph}, destroying the graph by the
-      C{del} operator does not free the memory occupied by the graph if there
-      exists a L{VertexCover} that references the L{Graph}.
-
-    @undocumented: _formatted_cluster_iterator
-    """
-
-    def __init__(self, graph, clusters = None):
-        """Creates a cover object for a given graph.
-
-        @param graph: the graph that will be associated to the cover
-        @param clusters: the list of clusters. If C{None}, it is assumed
-          that there is only a single cluster that covers the whole graph.
-        """
-        if clusters is None:
-            clusters = [range(graph.vcount())]
-
-        Cover.__init__(self, clusters, n = graph.vcount())
-        if self._n > graph.vcount():
-            raise ValueError("cluster list contains vertex ID larger than the "
-                             "number of vertices in the graph")
-
-        self._graph = graph
-
-    def crossing(self):
-        """Returns a boolean vector where element M{i} is C{True} iff edge
-        M{i} lies between clusters, C{False} otherwise."""
-        membership = [frozenset(cluster) for cluster in self.membership]
-        return [membership[v1].isdisjoint(membership[v2]) \
-                for v1, v2 in self.graph.get_edgelist()]
-
-    @property
-    def graph(self):
-        """Returns the graph belonging to this object"""
-        return self._graph
-
-    def subgraph(self, idx):
-        """Get the subgraph belonging to a given cluster.
-
-        @param idx: the cluster index
-        @return: a copy of the subgraph
-        @precondition: the vertex set of the graph hasn't been modified since
-          the moment the cover was constructed.
-        """
-        return self._graph.subgraph(self[idx])
-
-    def subgraphs(self):
-        """Gets all the subgraphs belonging to each of the clusters.
-
-        @return: a list containing copies of the subgraphs
-        @precondition: the vertex set of the graph hasn't been modified since
-          the moment the cover was constructed.
-        """
-        return [self._graph.subgraph(cl) for cl in self]
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Plots the cover to the given Cairo context in the given
-        bounding box.
-
-        This is done by calling L{Graph.__plot__()} with the same arguments, but
-        drawing nice colored blobs around the vertex groups.
-
-        This method understands all the positional and keyword arguments that
-        are understood by L{Graph.__plot__()}, only the differences will be
-        highlighted here:
-
-          - C{mark_groups}: whether to highlight the vertex clusters by
-            colored polygons. Besides the values accepted by L{Graph.__plot__}
-            (i.e., a dict mapping colors to vertex indices, a list containing
-            lists of vertex indices, or C{False}), the following are also
-            accepted:
-
-              - C{True}: all the clusters will be highlighted, the colors matching
-                the corresponding color indices from the current palette
-                (see the C{palette} keyword argument of L{Graph.__plot__}.
-
-              - A dict mapping cluster indices or tuples of vertex indices to
-                color names.  The given clusters or vertex groups will be
-                highlighted by the given colors.
-
-              - A list of cluster indices. This is equivalent to passing a
-                dict mapping numeric color indices from the current palette
-                to cluster indices; therefore, the cluster referred to by element
-                I{i} of the list will be highlighted by color I{i} from the
-                palette.
-
-            The value of the C{plotting.mark_groups} configuration key is also
-            taken into account here; if that configuration key is C{True} and
-            C{mark_groups} is not given explicitly, it will automatically be set
-            to C{True}.
-
-            In place of lists of vertex indices, you may also use L{VertexSeq}
-            instances.
-
-            In place of color names, you may also use color indices into the
-            current palette. C{None} as a color name will mean that the
-            corresponding group is ignored.
-
-          - C{palette}: the palette used to resolve numeric color indices to RGBA
-            values. By default, this is an instance of L{ClusterColoringPalette}.
-
-        @see: L{Graph.__plot__()} for more supported keyword arguments.
-        """
-        if "edge_color" not in kwds and "color" not in self.graph.edge_attributes():
-            # Set up a default edge coloring based on internal vs external edges
-            colors = ["grey20", "grey80"]
-            kwds["edge_color"] = [colors[is_crossing]
-                                  for is_crossing in self.crossing()]
-
-        if "palette" in kwds:
-            palette = kwds["palette"]
-        else:
-            palette = ClusterColoringPalette(len(self))
-
-        if "mark_groups" not in kwds:
-            if Configuration.instance()["plotting.mark_groups"]:
-                kwds["mark_groups"] = enumerate(self) 
-        else:
-            kwds["mark_groups"] = _handle_mark_groups_arg_for_clustering(
-                    kwds["mark_groups"], self)
-
-        return self._graph.__plot__(context, bbox, palette, *args, **kwds)
-
-    def _formatted_cluster_iterator(self):
-        """Iterates over the clusters and formats them into a string to be
-        presented in the summary."""
-        if self._graph.is_named():
-            names = self._graph.vs["name"]
-            for cluster in self:
-                yield ", ".join(str(names[member]) for member in cluster)
-        else:
-            for cluster in self:
-                yield ", ".join(str(member) for member in cluster)
-
-
-class CohesiveBlocks(VertexCover):
-    """The cohesive block structure of a graph.
-
-    Instances of this type are created by L{Graph.cohesive_blocks()}. See
-    the documentation of L{Graph.cohesive_blocks()} for an explanation of
-    what cohesive blocks are.
-
-    This class provides a few more methods that make handling of cohesive
-    block structures easier.
-    """
-
-    def __init__(self, graph, blocks = None, cohesion = None, parent = None):
-        """Constructs a new cohesive block structure for the given graph.
-
-        If any of I{blocks}, I{cohesion} or I{parent} is C{None}, all the
-        arguments will be ignored and L{Graph.cohesive_blocks()} will be
-        called to calculate the cohesive blocks. Otherwise, these three
-        variables should describe the *result* of a cohesive block structure
-        calculation. Chances are that you never have to construct L{CohesiveBlocks}
-        instances directly, just use L{Graph.cohesive_blocks()}.
-
-        @param graph: the graph itself
-        @param blocks: a list containing the blocks; each block is described
-          as a list containing vertex IDs.
-        @param cohesion: the cohesion of each block. The length of this list
-          must be equal to the length of I{blocks}.
-        @param parent: the parent block of each block. Negative values or
-          C{None} mean that there is no parent block for that block. There
-          should be only one parent block, which covers the entire graph.
-        @see: Graph.cohesive_blocks()
-        """
-        if blocks is None or cohesion is None or parent is None:
-            blocks, cohesion, parent = graph.cohesive_blocks()
-
-        VertexCover.__init__(self, graph, blocks)
-
-        self._cohesion = cohesion
-        self._parent = parent
-        for idx, p in enumerate(self._parent):
-            if p < 0:
-                self._parent[idx] = None
-
-    def cohesion(self, idx):
-        """Returns the cohesion of the group with the given index."""
-        return self._cohesion[idx]
-
-    def cohesions(self):
-        """Returns the list of cohesion values for each group."""
-        return self._cohesion[:]
-
-    def hierarchy(self):
-        """Returns a new graph that describes the hierarchical relationships
-        between the groups.
-
-        The new graph will be a directed tree; an edge will point from
-        vertex M{i} to vertex M{j} if group M{i} is a superset of group M{j}.
-        In other words, the edges point downwards.
-        """
-        from igraph import Graph
-        edges = [pair for pair in izip(self._parent, xrange(len(self)))
-                 if pair[0] is not None]
-        return Graph(edges, directed=True)
-
-    def max_cohesion(self, idx):
-        """Finds the maximum cohesion score among all the groups that contain
-        the given vertex."""
-        result = 0
-        for cohesion, cluster in izip(self._cohesion, self._clusters):
-            if idx in cluster:
-                result = max(result, cohesion)
-        return result
-
-    def max_cohesions(self):
-        """For each vertex in the graph, returns the maximum cohesion score
-        among all the groups that contain the vertex."""
-        result = [0] * self._graph.vcount()
-        for cohesion, cluster in izip(self._cohesion, self._clusters):
-            for idx in cluster:
-                result[idx] = max(result[idx], cohesion)
-        return result
-
-    def parent(self, idx):
-        """Returns the parent group index of the group with the given index
-        or C{None} if the given group is the root."""
-        return self._parent[idx]
-
-    def parents(self):
-        """Returns the list of parent group indices for each group or C{None}
-        if the given group is the root."""
-        return self._parent[:]
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Plots the cohesive block structure to the given Cairo context in
-        the given bounding box.
-
-        Since a L{CohesiveBlocks} instance is also a L{VertexCover}, keyword
-        arguments accepted by L{VertexCover.__plot__()} are also accepted here.
-        The only difference is that the vertices are colored according to their
-        maximal cohesions by default, and groups are marked by colored blobs
-        except the last group which encapsulates the whole graph.
-
-        See the documentation of L{VertexCover.__plot__()} for more details.
-        """
-        prepare_groups = False
-        if "mark_groups" not in kwds:
-            if Configuration.instance()["plotting.mark_groups"]:
-                prepare_groups = True
-        elif kwds["mark_groups"] == True:
-            prepare_groups = True
-
-        if prepare_groups:
-            colors = [pair for pair in enumerate(self.cohesions())
-                if pair[1] > 1]
-            kwds["mark_groups"] = colors
-
-        if "vertex_color" not in kwds:
-            kwds["vertex_color"] = self.max_cohesions()
-
-        return VertexCover.__plot__(self, context, bbox, palette, *args, **kwds)
-
-def _handle_mark_groups_arg_for_clustering(mark_groups, clustering):
-    """Handles the mark_groups=... keyword argument in plotting methods of
-    clusterings.
-
-    This is an internal method, you shouldn't need to mess around with it.
-    Its purpose is to handle the extended semantics of the mark_groups=...
-    keyword argument in the C{__plot__} method of L{VertexClustering} and
-    L{VertexCover} instances, namely the feature that numeric IDs are resolved
-    to clusters automatically.
-    """
-    # Handle the case of mark_groups = True, mark_groups containing a list or
-    # tuple of cluster IDs, and and mark_groups yielding (cluster ID, color)
-    # pairs
-    if mark_groups is True:
-        group_iter = ((group, color) for color, group in enumerate(clustering))
-    elif isinstance(mark_groups, dict):
-        group_iter = mark_groups.iteritems()
-    elif hasattr(mark_groups, "__getitem__") and hasattr(mark_groups, "__len__"):
-        # Lists, tuples
-        try:
-            first = mark_groups[0]
-        except:
-            # Hmm. Maybe not a list or tuple?
-            first = None
-        if first is not None:
-            # Okay. Is the first element of the list a single number?
-            if isinstance(first, (int, long)):
-                # Yes. Seems like we have a list of cluster indices.
-                # Assign color indices automatically.
-                group_iter = ((group, color)
-                        for color, group in enumerate(mark_groups))
-            else:
-                # No. Seems like we have good ol' group-color pairs.
-                group_iter = mark_groups
-        else:
-            group_iter = mark_groups
-    elif hasattr(mark_groups, "__iter__"):
-        # Iterators etc
-        group_iter = mark_groups
-    else:
-        group_iter = {}.iteritems()
-
-    def cluster_index_resolver():
-        for group, color in group_iter:
-            if isinstance(group, (int, long)):
-                group = clustering[group]
-            yield group, color
-
-    return cluster_index_resolver()
-
-##############################################################
-
-def _prepare_community_comparison(comm1, comm2, remove_none=False):
-    """Auxiliary method that takes two community structures either as
-    membership lists or instances of L{Clustering}, and returns a
-    tuple whose two elements are membership lists.
-
-    This is used by L{compare_communities} and L{split_join_distance}.
-
-    @param comm1: the first community structure as a membership list or
-      as a L{Clustering} object.
-    @param comm2: the second community structure as a membership list or
-      as a L{Clustering} object.
-    @param remove_none: whether to remove C{None} entries from the membership
-      lists. If C{remove_none} is C{False}, a C{None} entry in either C{comm1}
-      or C{comm2} will result in an exception. If C{remove_none} is C{True},
-      C{None} values are filtered away and only the remaining lists are
-      compared.
-    """
-    def _ensure_list(obj):
-        if isinstance(obj, Clustering):
-            return obj.membership
-        return list(obj)
-
-    vec1, vec2 = _ensure_list(comm1), _ensure_list(comm2)
-    if len(vec1) != len(vec2):
-        raise ValueError("the two membership vectors must be equal in length")
-
-    if remove_none and (None in vec1 or None in vec2):
-        idxs_to_remove = [i for i in xrange(len(vec1)) \
-                if vec1[i] is None or vec2[i] is None]
-        idxs_to_remove.reverse()
-        n = len(vec1)
-        for i in idxs_to_remove:
-            n -= 1
-            vec1[i], vec1[n] = vec1[n], vec1[i]
-            vec2[i], vec2[n] = vec2[n], vec2[i]
-        del vec1[n:]
-        del vec2[n:]
-
-    return vec1, vec2
-
-
-def compare_communities(comm1, comm2, method="vi", remove_none=False):
-    """Compares two community structures using various distance measures.
-
-    @param comm1: the first community structure as a membership list or
-      as a L{Clustering} object.
-    @param comm2: the second community structure as a membership list or
-      as a L{Clustering} object.
-    @param method: the measure to use. C{"vi"} or C{"meila"} means the
-      variation of information metric of Meila (2003), C{"nmi"} or C{"danon"}
-      means the normalized mutual information as defined by Danon et al (2005),
-      C{"split-join"} means the split-join distance of van Dongen (2000),
-      C{"rand"} means the Rand index of Rand (1971), C{"adjusted_rand"}
-      means the adjusted Rand index of Hubert and Arabie (1985).
-    @param remove_none: whether to remove C{None} entries from the membership
-      lists. This is handy if your L{Clustering} object was constructed using
-      L{VertexClustering.FromAttribute} using an attribute which was not defined
-      for all the vertices. If C{remove_none} is C{False}, a C{None} entry in
-      either C{comm1} or C{comm2} will result in an exception. If C{remove_none}
-      is C{True}, C{None} values are filtered away and only the remaining lists
-      are compared.
-
-    @return: the calculated measure.
-    @newfield ref: Reference
-    @ref: Meila M: Comparing clusterings by the variation of information.
-          In: Scholkopf B, Warmuth MK (eds). Learning Theory and Kernel
-          Machines: 16th Annual Conference on Computational Learning Theory
-          and 7th Kernel Workship, COLT/Kernel 2003, Washington, DC, USA.
-          Lecture Notes in Computer Science, vol. 2777, Springer, 2003.
-          ISBN: 978-3-540-40720-1.
-    @ref: Danon L, Diaz-Guilera A, Duch J, Arenas A: Comparing community
-          structure identification. J Stat Mech P09008, 2005.
-    @ref: van Dongen D: Performance criteria for graph clustering and Markov
-          cluster experiments. Technical Report INS-R0012, National Research
-          Institute for Mathematics and Computer Science in the Netherlands,
-          Amsterdam, May 2000.
-    @ref: Rand WM: Objective criteria for the evaluation of clustering
-          methods. J Am Stat Assoc 66(336):846-850, 1971.
-    @ref: Hubert L and Arabie P: Comparing partitions. Journal of
-          Classification 2:193-218, 1985.
-    """
-    import igraph._igraph
-    vec1, vec2 = _prepare_community_comparison(comm1, comm2, remove_none)
-    return igraph._igraph._compare_communities(vec1, vec2, method)
-
-
-def split_join_distance(comm1, comm2, remove_none=False):
-    """Calculates the split-join distance between two community structures.
-
-    The split-join distance is a distance measure defined on the space of
-    partitions of a given set. It is the sum of the projection distance of
-    one partition from the other and vice versa, where the projection
-    number of A from B is if calculated as follows:
-
-      1. For each set in A, find the set in B with which it has the
-         maximal overlap, and take note of the size of the overlap.
-
-      2. Take the sum of the maximal overlap sizes for each set in A.
-
-      3. Subtract the sum from M{n}, the number of elements in the
-         partition.
-
-    Note that the projection distance is asymmetric, that's why it has to be
-    calculated in both directions and then added together.  This function
-    returns the projection distance of C{comm1} from C{comm2} and the
-    projection distance of C{comm2} from C{comm1}, and returns them in a pair.
-    The actual split-join distance is the sum of the two distances. The reason
-    why it is presented this way is that one of the elements being zero then
-    implies that one of the partitions is a subpartition of the other (and if
-    it is close to zero, then one of the partitions is close to being a
-    subpartition of the other).
-
-    @param comm1: the first community structure as a membership list or
-      as a L{Clustering} object.
-    @param comm2: the second community structure as a membership list or
-      as a L{Clustering} object.
-    @param remove_none: whether to remove C{None} entries from the membership
-      lists. This is handy if your L{Clustering} object was constructed using
-      L{VertexClustering.FromAttribute} using an attribute which was not defined
-      for all the vertices. If C{remove_none} is C{False}, a C{None} entry in
-      either C{comm1} or C{comm2} will result in an exception. If C{remove_none}
-      is C{True}, C{None} values are filtered away and only the remaining lists
-      are compared.
-
-    @return: the projection distance of C{comm1} from C{comm2} and vice versa
-      in a tuple. The split-join distance is the sum of the two.
-    @newfield ref: Reference
-    @ref: van Dongen D: Performance criteria for graph clustering and Markov
-          cluster experiments. Technical Report INS-R0012, National Research
-          Institute for Mathematics and Computer Science in the Netherlands,
-          Amsterdam, May 2000.
-
-    @see: L{compare_communities()} with C{method = "split-join"} if you are
-      not interested in the individual projection distances but only the
-      sum of them.
-    """
-    import igraph._igraph
-    vec1, vec2 = _prepare_community_comparison(comm1, comm2, remove_none)
-    return igraph._igraph._split_join_distance(vec1, vec2)
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/compat.py igraph-0.6.5/interfaces/python/igraph/compat.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/compat.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/compat.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Compatibility methods and backported versions of newer Python features
-to enable igraph to run on Python 2.5.
-"""
-
-import sys
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-#############################################################################
-# Simulating math.isnan
-
-try:
-    from math import isnan
-except ImportError:
-    def isnan(num):
-        return num != num
-
-#############################################################################
-# Providing @property.setter syntax for Python 2.5
-
-if sys.version_info < (2, 6):
-    _property = property
-    class property(property):
-        def __init__(self, fget, *args, **kwds):
-            self.__doc__ = fget.__doc__
-            super(property, self).__init__(fget, *args, **kwds)
-
-        def setter(self, fset):
-            cls_ns = sys._getframe(1).f_locals
-            for k, v in cls_ns.iteritems():
-                if v == self:
-                    propname = k
-                    break
-            cls_ns[propname] = property(self.fget, fset, self.fdel,
-                    self.__doc__)
-            return cls_ns[propname]
-else:
-    property = __builtins__["property"]
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/configuration.py igraph-0.6.5/interfaces/python/igraph/configuration.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/configuration.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/configuration.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,425 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Configuration framework for igraph.
-
-igraph has some parameters which usually affect the behaviour of many functions.
-This module provides the framework for altering and querying igraph parameters
-as well as saving them to and retrieving them from disk.
-"""
-
-__license__ = """\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-from ConfigParser import SafeConfigParser
-import platform
-import os.path
-
-def get_platform_image_viewer():
-    """Returns the path of an image viewer on the given platform"""
-    plat = platform.system()
-    if plat == "Darwin":
-        # Most likely Mac OS X
-        return "open"
-    elif plat == "Linux":
-        # Linux has a whole lot of choices, try to find one
-        choices = ["eog", "gthumb", "gqview", "kuickshow", "xnview", "display",
-                "gpicview", "gwenview", "qiv", "gimv"]
-        paths = ["/usr/bin", "/bin"]
-        for path in paths:
-            for choice in choices:
-                full_path = os.path.join(path, choice)
-                if os.path.isfile(full_path): return full_path
-        return ""
-    elif plat == "Windows" or plat == "Microsoft":    # Thanks to Dale Hunscher
-        # Use the built-in Windows image viewer, if available
-        return "start"
-    else:
-        # Unknown system
-        return ""
-
-class Configuration(object):
-    """Class representing igraph configuration details.
-    
-    General ideas
-    =============
-
-    The configuration of igraph is stored in the form of name-value pairs.
-    This object provides an interface to the configuration data using the
-    syntax known from dict:
-    
-      >>> c=Configuration()
-      >>> c["general.verbose"] = True
-      >>> print c["general.verbose"]
-      True
-
-    Configuration keys are organized into sections, and the name to be used
-    for a given key is always in the form C{section.keyname}, like
-    C{general.verbose} in the example above. In that case, C{general} is the
-    name of the configuration section, and C{verbose} is the name of the key.
-    If the name of the section is omitted, it defaults to C{general}, so
-    C{general.verbose} can be referred to as C{verbose}:
-
-      >>> c=Configuration()
-      >>> c["verbose"] = True
-      >>> print c["general.verbose"]
-      True
-
-    User-level configuration is stored in C{~/.igraphrc} per default on Linux
-    and Mac OS X systems, or in C{C:\\Documents and Settings\\username\\.igraphrc}
-    on Windows systems. However, this configuration is read only when C{igraph}
-    is launched through its shell interface defined in L{igraph.app.shell}.
-    This behaviour might change before version 1.0.
-
-    Known configuration keys
-    ========================
-
-    The known configuration keys are presented below, sorted by section. When
-    referring to them in program code, don't forget to add the section name,
-    expect in the case of section C{general}.
-
-    General settings
-    ----------------
-
-    These settings are all stored in section C{general}.
-
-        - B{shells}: the list of preferred Python shells to be used with the
-          command-line C{igraph} script. The shells in the list are tried one
-          by one until any of them is found on the system. C{igraph} functions
-          are then imported into the main namespace of the shell and the shell
-          is launched. Known shells and their respective class names to be
-          used can be found in L{igraph.app.shell}. Example:
-          C{IPythonShell, ClassicPythonShell}. This is the default, by the way.
-        - B{verbose}: whether L{igraph} should talk more than really necessary.
-          For instance, if set to C{True}, some functions display progress bars.
-
-    Application settings
-    --------------------
-
-    These settings specify the external applications that are possibly
-    used by C{igraph}. They are all stored in section C{apps}.
-
-        - B{image_viewer}: image viewer application. If set to an empty string,
-          it will be determined automatically from the platform C{igraph} runs
-          on. On Mac OS X, it defaults to the Preview application. On Linux,
-          it chooses a viewer from several well-known Linux viewers like
-          C{gthumb}, C{kuickview} and so on (see the source code for the full
-          list). On Windows, it defaults to the system's built-in image viewer.
-
-    Plotting settings
-    -----------------
-
-    These settings specify the default values used by plotting functions.
-    They are all stored in section C{plotting}.
-
-        - B{layout}: default graph layout algorithm to be used.
-
-        - B{mark_groups}: whether to mark the clusters by polygons when
-          plotting a clustering object.
-
-        - B{palette}: default palette to be used for converting integer
-          numbers to colors. See L{colors.Palette} for more information.
-          Valid palette names are stored in C{colors.palettes}.
-
-        - B{wrap_labels}: whether to try to wrap the labels of the
-          vertices automatically if they don't fit within the vertex.
-          Default: C{False}.
-
-    Remote repository settings
-    --------------------------
-
-    These settings specify how igraph should access remote graph repositories.
-    Currently only the Nexus repository is supported. All these settings are
-    stored in section C{remote}.
-
-        - B{nexus.url}: the root URL of the Nexus repository. Default:
-          C{http://nexus.igraph.org}.
-
-    @undocumented: _item_to_section_key, _types, _sections, _definitions, _instance
-    """
-
-    # pylint: disable-msg=R0903
-    # R0903: too few public methods
-    class Types(object):
-        """Static class for the implementation of custom getter/setter functions
-        for configuration keys"""
-
-        def __init__(self):
-            pass
-
-        @staticmethod
-        def setboolean(obj, section, key, value):
-            """Sets a boolean value in the given configuration object.
-            
-            @param obj: a configuration object
-            @param section: the section of the value to be set
-            @param key: the key of the value to be set
-            @param value: the value itself. C{0}, C{false}, C{no} and C{off}
-              means false, C{1}, C{true}, C{yes} and C{on} means true,
-              everything else results in a C{ValueError} being thrown.
-              Values are case insensitive
-            """
-            value = str(value).lower()
-            if value in ("0", "false", "no", "off"):
-                value = "false"
-            elif value in ("1", "true", "yes", "on"):
-                value = "true"
-            else:
-                raise ValueError("value cannot be coerced to boolean type")
-            obj.set(section, key, value)
-
-        @staticmethod
-        def setint(obj, section, key, value):
-            """Sets an integer value in the given configuration object.
-            
-            @param obj: a configuration object
-            @param section: the section of the value to be set
-            @param key: the key of the value to be set
-            @param value: the value itself.
-            """
-            obj.set(section, key, str(int(value)))
-
-        @staticmethod
-        def setfloat(obj, section, key, value):
-            """Sets a float value in the given configuration object.
-
-            Note that float values are converted to strings in the configuration
-            object, which may lead to some precision loss.
-
-            @param obj: a configuration object
-            @param section: the section of the value to be set
-            @param key: the key of the value to be set
-            @param value: the value itself.
-            """
-            obj.set(section, key, str(float(value)))
-
-    _types = {
-        "boolean": {
-            "getter": SafeConfigParser.getboolean,
-            "setter": Types.setboolean
-        },
-        "int": {
-            "getter": SafeConfigParser.getint,
-            "setter": Types.setint
-        },
-        "float": {
-            "getter": SafeConfigParser.getfloat,
-            "setter": Types.setfloat
-        }
-    }
-
-    _sections = ("general", "apps", "plotting", "remote")
-    _definitions = {
-        "general.shells": { "default": "IPythonShell,ClassicPythonShell" },
-        "general.verbose": { "default": True, "type": "boolean" },
-
-        "apps.image_viewer": { "default": get_platform_image_viewer() },
-
-        "plotting.layout": { "default": "auto" },
-        "plotting.mark_groups": { "default": False, "type": "boolean" },
-        "plotting.palette": { "default": "gray" },
-        "plotting.wrap_labels": { "default": False, "type": "boolean" },
-
-        "remote.nexus.url": { "default": "http://nexus.igraph.org" }
-    }
-
-    # The singleton instance we are using throughout other modules
-    _instance = None
-
-    def __init__(self, filename=None):
-        """Creates a new configuration instance.
-
-        @param filename: file or file pointer to be read. Can be omitted.
-        """
-        self._config = SafeConfigParser()
-        self._filename = None
-
-        # Create default sections
-        for sec in self._sections:
-            self._config.add_section(sec)
-        # Create default values
-        for name, definition in self._definitions.iteritems():
-            if "default" in definition:
-                self[name] = definition["default"]
-
-        if filename is not None:
-            self.load(filename)
-
-    @property
-    def filename(self):
-        """Returns the filename associated to the object.
-
-        It is usually the name of the configuration file that was used when
-        creating the object. L{Configuration.load} always overwrites it with
-        the filename given to it. If C{None}, the configuration was either
-        created from scratch or it was updated from a stream without name
-        information."""
-        return self._filename
-
-    def _get(self, section, key):
-        """Internal function that returns the value of a given key in a
-        given section."""
-        definition = self._definitions.get("%s.%s" % (section, key), {})
-        getter = None
-        if "type" in definition:
-            getter = self._types[definition["type"]].get("getter")
-        if getter is None:
-            getter = self._config.__class__.get
-        return getter(self._config, section, key)
-
-    @staticmethod
-    def _item_to_section_key(item):
-        """Converts an item description to a section-key pair.
-        
-        @param item: the item to be converted
-        @return: if C{item} contains a period (C{.}), it is splitted into two parts
-          at the first period, then the two parts are returned, so the part before
-          the period is the section. If C{item} does not contain a period, the
-          section is assumed to be C{general}, and the second part of the returned
-          pair contains C{item} unchanged"""
-        if "." in item:
-            section, key = item.split(".", 1)
-        else:
-            section, key = "general", item
-        return section, key
-
-    def __contains__(self, item):
-        """Checks whether the given configuration item is set.
-
-        @param item: the configuration key to check.
-        @return: C{True} if the key has an associated value, C{False} otherwise.
-        """
-        section, key = self._item_to_section_key(item)
-        return self._config.has_option(section, key)
-
-    def __getitem__(self, item):
-        """Returns the given configuration item.
-
-        @param item: the configuration key to retrieve.
-        @return: the configuration value"""
-        section, key = self._item_to_section_key(item)
-        if key == "*":
-            # Special case: retrieving all the keys within a section and
-            # returning it in a dict
-            keys = self._config.items(section)
-            return dict((key, self._get(section, key)) for key, _ in keys)
-        else:
-            return self._get(section, key)
-
-    def __setitem__(self, item, value):
-        """Sets the given configuration item.
-
-        @param item: the configuration key to set
-        @param value: the new value of the configuration key
-        """
-        section, key = self._item_to_section_key(item)
-        definition = self._definitions.get("%s.%s" % (section, key), {})
-        setter = None
-        if "type" in definition:
-            setter = self._types[definition["type"]].get("setter", None)
-        if setter is None:
-            setter = self._config.__class__.set
-        return setter(self._config, section, key, value)
-
-    def __delitem__(self, item):
-        """Deletes the given item from the configuration.
-
-        If the item has a default value, the default value is written back instead
-        of the current value. Without a default value, the item is really deleted.
-        """
-        section, key = self._item_to_section_key(item)
-        definition = self._definitions.get("%s.%s" % (section, key), {})
-        if "default" in definition:
-            self[item] = definition["default"]
-        else:
-            self._config.remove_option(section, key)
-
-    def has_key(self, item):
-        """Checks if the configuration has a given key.
-
-        @param item: the key being sought"""
-        if "." in item:
-            section, key = item.split(".", 1)
-        else:
-            section, key = "general", item
-        return self._config.has_option(section, key)
-            
-    def load(self, stream=None):
-        """Loads the configuration from the given file.
-
-        @param stream: name of a file or a file object. The configuration will be loaded
-          from here. Can be omitted, in this case, the user-level configuration is
-          loaded.
-        """
-        stream = stream or get_user_config_file()
-        if isinstance(stream, basestring):
-            stream = open(stream, "r")
-            file_was_open = True
-        self._config.readfp(stream)
-        self._filename = getattr(stream, "name", None)
-        if file_was_open:
-            stream.close()
-
-    def save(self, stream=None):
-        """Saves the configuration.
-
-        @param stream: name of a file or a file object. The configuration will be saved
-          there. Can be omitted, in this case, the user-level configuration file will
-          be overwritten.
-        """
-        stream = stream or get_user_config_file()
-        if not hasattr(stream, "write") or not hasattr(stream, "close"):
-            stream = open(stream, "w")
-            file_was_open = True
-        self._config.write(stream)
-        if file_was_open:
-            stream.close()
-
-    @classmethod
-    def instance(cls):
-        """Returns the single instance of the configuration object."""
-        if cls._instance is None:
-            cfile = get_user_config_file()
-            try:
-                config = cls(cfile)
-            except IOError:
-                # No config file yet, whatever
-                config = cls()
-            cls._instance = config
-        return cls._instance
-
-
-def get_user_config_file():
-    """Returns the path where the user-level configuration file is stored"""
-    return os.path.expanduser("~/.igraphrc")
-
-
-def init():
-    """Default mechanism to initiate igraph configuration
-
-    This method loads the user-specific configuration file from the
-    user's home directory, or if it does not exist, creates a default
-    configuration.
-
-    The method is safe to be called multiple times, it will not parse
-    the configuration file twice.
-
-    @return: the L{Configuration} object loaded or created."""
-    return Configuration.instance()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/cut.py igraph-0.6.5/interfaces/python/igraph/cut.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/cut.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/cut.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,200 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Classes representing cuts and flows on graphs."""
-
-from igraph.clustering import VertexClustering
-
-__license__ = """\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-class Cut(VertexClustering):
-    """A cut of a given graph.
-
-    This is a simple class used to represent cuts returned by
-    L{Graph.mincut()}, L{Graph.all_st_cuts()} and other functions
-    that calculate cuts.
-    
-    A cut is a special vertex clustering with only two clusters.
-    Besides the usual L{VertexClustering} methods, it also has the
-    following attributes:
-
-      - C{value} - the value (capacity) of the cut. It is equal to
-        the number of edges if there are no capacities on the
-        edges.
-
-      - C{partition} - vertex IDs in the parts created
-        after removing edges in the cut
-
-      - C{cut} - edge IDs in the cut
-
-      - C{es} - an edge selector restricted to the edges
-        in the cut.
-
-    You can use indexing on this object to obtain lists of vertex IDs
-    for both sides of the partition.
-
-    This class is usually not instantiated directly, everything
-    is taken care of by the functions that return cuts.
-
-    Examples:
-
-      >>> from igraph import Graph
-      >>> g = Graph.Ring(20)
-      >>> mc = g.mincut()
-      >>> print mc.value
-      2.0
-      >>> print min(map(len, mc))
-      1
-      >>> mc.es["color"] = "red"
-    """
-
-    # pylint: disable-msg=R0913
-    def __init__(self, graph, value=None, cut=None, partition=None,
-            partition2=None):
-        """Initializes the cut.
-
-        This should not be called directly, everything is taken care of by
-        the functions that return cuts.
-        """
-        # Input validation
-        if partition is None or cut is None:
-            raise ValueError("partition and cut must be given")
-
-        # Set up a membership vector, initialize parent class
-        membership = [1] * graph.vcount()
-        for vid in partition:
-            membership[vid] = 0
-        VertexClustering.__init__(self, graph, membership)
-
-        if value is None:
-            # Value of the cut not given, count the number of edges
-            value = len(cut)
-        self._value = float(value)
-
-        self._partition = sorted(partition)
-        self._cut = cut
-
-    def __repr__(self):
-        return "%s(%r, %r, %r, %r)" % \
-          (self.__class__.__name__, self._graph, \
-           self._value, self._cut, self._partition)
-
-    def __str__(self):
-        return "Graph cut (%d edges, %d vs %d vertices, value=%.4f)" % \
-          (len(self._cut), len(self._partition),
-          self._graph.vcount() - len(self._partition), self._value)
-
-    # pylint: disable-msg=C0103
-    @property
-    def es(self):
-        """Returns an edge selector restricted to the cut"""
-        return self._graph.es.select(self.cut)
-
-    @property
-    def partition(self):
-        """Returns the vertex IDs partitioned according to the cut"""
-        return list(self)
-
-    @property
-    def cut(self):
-        """Returns the edge IDs in the cut"""
-        return self._cut
-
-    @property
-    def value(self):
-        """Returns the sum of edge capacities in the cut"""
-        return self._value
-
-
-class Flow(Cut):
-    """A flow of a given graph.
-
-    This is a simple class used to represent flows returned by
-    L{Graph.maxflow}. It has the following attributes:
-
-      - C{graph} - the graph on which this flow is defined
-
-      - C{value} - the value (capacity) of the flow 
-
-      - C{flow} - the flow values on each edge. For directed graphs,
-        this is simply a list where element M{i} corresponds to the
-        flow on edge M{i}. For undirected graphs, the direction of
-        the flow is not constrained (since the edges are undirected),
-        hence positive flow always means a flow from the smaller vertex
-        ID to the larger, while negative flow means a flow from the
-        larger vertex ID to the smaller.
-
-      - C{cut} - edge IDs in the minimal cut corresponding to
-        the flow.
-
-      - C{partition} - vertex IDs in the parts created
-        after removing edges in the cut
-
-      - C{es} - an edge selector restricted to the edges
-        in the cut.
-
-    This class is usually not instantiated directly, everything
-    is taken care of by L{Graph.maxflow}.
-
-    Examples:
-
-      >>> from igraph import Graph
-      >>> g = Graph.Ring(20)
-      >>> mf = g.maxflow(0, 10)
-      >>> print mf.value
-      2.0
-      >>> mf.es["color"] = "red"
-    """
-
-    # pylint: disable-msg=R0913
-    def __init__(self, graph, value, flow, cut, partition):
-        """Initializes the flow.
-
-        This should not be called directly, everything is
-        taken care of by L{Graph.maxflow}.
-        """
-        super(Flow, self).__init__(graph, value, cut, partition)
-        self._flow = flow
-
-    def __repr__(self):
-        return "%s(%r, %r, %r, %r, %r)" % \
-          (self.__class__.__name__, self._graph, \
-           self._value, self._flow, self._cut, self._partition)
-
-    def __str__(self):
-        return "Graph flow (%d edges, %d vs %d vertices, value=%.4f)" % \
-          (len(self._cut), len(self._partition),
-          self._graph.vcount() - len(self._partition), self._value)
-
-    @property
-    def flow(self):
-        """Returns the flow values for each edge.
-        
-        For directed graphs, this is simply a list where element M{i}
-        corresponds to the flow on edge M{i}. For undirected graphs, the
-        direction of the flow is not constrained (since the edges are
-        undirected), hence positive flow always means a flow from the smaller
-        vertex ID to the larger, while negative flow means a flow from the
-        larger vertex ID to the smaller.
-        """
-        return self._flow
-
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/datatypes.py igraph-0.6.5/interfaces/python/igraph/datatypes.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/datatypes.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/datatypes.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,734 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Additional auxiliary data types"""
-
-from itertools import islice
-
-__license__ = """\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-class Matrix(object):
-    """Simple matrix data type.
-
-    Of course there are much more advanced matrix data types for Python (for
-    instance, the C{ndarray} data type of Numeric Python) and this implementation
-    does not want to compete with them. The only role of this data type is to
-    provide a convenient interface for the matrices returned by the C{Graph}
-    object (for instance, allow indexing with tuples in the case of adjacency
-    matrices and so on).
-    """
-
-    def __init__(self, data=None):
-        """Initializes a matrix.
-
-        @param data: the elements of the matrix as a list of lists, or C{None} to
-          create a 0x0 matrix.
-        """
-        self._nrow, self._ncol, self._data = 0, 0, []
-        self.data = data
-
-    # pylint: disable-msg=C0103
-    @classmethod
-    def Fill(cls, value, *args):
-        """Creates a matrix filled with the given value
-
-        @param value: the value to be used
-        @keyword shape: the shape of the matrix. Can be a single integer,
-          two integers or a tuple. If a single integer is
-          given here, the matrix is assumed to be square-shaped.
-        """
-        if len(args) < 1:
-            raise TypeError("expected an integer or a tuple")
-        if len(args) == 1:
-            if hasattr(args[0], "__len__"):
-                height, width = int(args[0][0]), int(args[0][1])
-            else:
-                height, width = int(args[0]), int(args[0])
-        else:
-            height, width = int(args[0]), int(args[1])
-        mtrx = [[value]*width for _ in xrange(height)]
-        return cls(mtrx)
-
-    # pylint: disable-msg=C0103
-    @classmethod
-    def Zero(cls, *args):
-        """Creates a matrix filled with zeros.
-
-        @keyword shape: the shape of the matrix. Can be a single integer,
-          two integers or a tuple. If a single integer is
-          given here, the matrix is assumed to be square-shaped.
-        """
-        result = cls.Fill(0, *args)
-        return result
-
-    # pylint: disable-msg=C0103
-    @classmethod
-    def Identity(cls, *args):
-        """Creates an identity matrix.
-
-        @keyword shape: the shape of the matrix. Can be a single integer,
-          two integers or a tuple. If a single integer is
-          given here, the matrix is assumed to be square-shaped.
-        """
-        # pylint: disable-msg=W0212
-        result = cls.Fill(0, *args)
-        for i in xrange(min(result.shape)):
-            result._data[i][i] = 1
-        return result
-
-    def _set_data(self, data=None):
-        """Sets the data stored in the matrix"""
-        if data is not None:
-            self._data = [list(row) for row in data]
-            self._nrow = len(self._data)
-            if self._nrow > 0:
-                self._ncol = max(len(row) for row in self._data)
-            else:
-                self._ncol = 0
-            for row in self._data:
-                if len(row) < self._ncol:
-                    row.extend([0]*(self._ncol-len(row)))
-
-    def _get_data(self):
-        """Returns the data stored in the matrix as a list of lists"""
-        return [list(row) for row in self._data]
-    data = property(_get_data, _set_data)
-
-    @property
-    def shape(self):
-        """Returns the shape of the matrix as a tuple"""
-        return self._nrow, self._ncol
-
-    def __add__(self, other):
-        """Adds the given value to the matrix.
-
-        @param other: either a scalar or a matrix. Scalars will
-          be added to each element of the matrix. Matrices will
-          be added together elementwise.
-        @return: the result matrix
-        """
-        if isinstance(other, Matrix):
-            if self.shape != other.shape:
-                raise ValueError("matrix shapes do not match")
-            return self.__class__([
-                [a+b for a, b in izip(row_a, row_b)]
-                for row_a, row_b in izip(self, other)
-            ])
-        else:
-            return self.__class__([
-                [item+other for item in row] for row in self])
-
-    def __eq__(self, other):
-        """Checks whether a given matrix is equal to another one"""
-        return isinstance(other, Matrix) and \
-                self._nrow == other._nrow and \
-                self._ncol == other._ncol and \
-                self._data == other._data
-
-    def __getitem__(self, i):
-        """Returns a single item, a row or a column of the matrix
-
-        @param i: if a single integer, returns the M{i}th row as a list. If a
-          slice, returns the corresponding rows as another L{Matrix} object. If
-          a 2-tuple, the first element of the tuple is used to select a row and
-          the second is used to select a column.
-        """
-        if isinstance(i, int):
-            return list(self._data[i])
-        elif isinstance(i, slice):
-            return self.__class__(self._data[i])
-        elif isinstance(i, tuple):
-            try:
-                first = i[0]
-            except IndexError:
-                first = slice(None)
-            try:
-                second = i[1]
-            except IndexError:
-                second = slice(None)
-            if type(first) == slice and type(second) == slice:
-                return self.__class__(row[second] for row in self._data[first])
-            elif type(first) == slice:
-                return [row[second] for row in self._data[first]]
-            else:
-                return self._data[first][second]
-        else:
-            raise IndexError("invalid matrix index")
-
-    def __hash__(self):
-        """Returns a hash value for a matrix."""
-        return hash(self._nrow, self._ncol, self._data)
-
-    def __iadd__(self, other):
-        """In-place addition of a matrix or scalar."""
-        if isinstance(other, Matrix):
-            if self.shape != other.shape:
-                raise ValueError("matrix shapes do not match")
-            for row_a, row_b in izip(self._data, other):
-                for i in xrange(len(row_a)):
-                    row_a[i] += row_b[i]
-        else:
-            for row in self._data:
-                for i in xrange(len(row)):
-                    row[i] += other
-        return self
-
-    def __isub__(self, other):
-        """In-place subtraction of a matrix or scalar."""
-        if isinstance(other, Matrix):
-            if self.shape != other.shape:
-                raise ValueError("matrix shapes do not match")
-            for row_a, row_b in izip(self._data, other):
-                for i in xrange(len(row_a)):
-                    row_a[i] -= row_b[i]
-        else:
-            for row in self._data:
-                for i in xrange(len(row)):
-                    row[i] -= other
-        return self
-
-    def __ne__(self, other):
-        """Checks whether a given matrix is not equal to another one"""
-        return not self == other
-
-    def __setitem__(self, i, value):
-        """Sets a single item, a row or a column of the matrix
-
-        @param i: if a single integer, sets the M{i}th row as a list. If a
-          slice, sets the corresponding rows from another L{Matrix} object.
-          If a 2-tuple, the first element of the tuple is used to select a row
-          and the second is used to select a column.
-        @param value: the new value
-        """
-        if isinstance(i, int):
-            # Setting a row
-            if len(value) != len(self._data[i]):
-                raise ValueError("new value must have %d items" % self._ncol)
-            self._data[i] = list(value)
-        elif isinstance(i, slice):
-            # Setting multiple rows
-            if len(value) != len(self._data[i]):
-                raise ValueError("new value must have %d items" % self._ncol)
-            if any(len(row) != self._ncol for row in value):
-                raise ValueError("rows of new value must have %d items" % \
-                        self._ncol)
-            self._data[i] = [list(row) for row in value]
-        elif isinstance(i, tuple):
-            try:
-                first = i[0]
-            except IndexError:
-                first = slice(None)
-            try:
-                second = i[1]
-            except IndexError:
-                second = slice(None)
-            if type(first) == slice and type(second) == slice:
-                # Setting a submatrix
-                # TODO
-                raise NotImplementedError
-            elif type(first) == slice:
-                # Setting a submatrix
-                raise NotImplementedError
-            else:
-                # Setting a single element
-                self._data[first][second] = value
-        else:
-            raise IndexError("invalid matrix index")
-
-    def __sub__(self, other):
-        """Subtracts the given value from the matrix.
-
-        @param other: either a scalar or a matrix. Scalars will
-          be subtracted from each element of the matrix. Matrices will
-          be subtracted together elementwise.
-        @return: the result matrix
-        """
-        if isinstance(other, Matrix):
-            if self.shape != other.shape:
-                raise ValueError("matrix shapes do not match")
-            return self.__class__([
-                [a-b for a, b in izip(row_a, row_b)]
-                for row_a, row_b in izip(self, other)
-            ])
-        else:
-            return self.__class__([
-                [item-other for item in row] for row in self])
-
-    def __repr__(self):
-        class_name = self.__class__.__name__
-        rows = ("[%s]" % ", ".join(repr(item) for item in row) for row in self)
-        return "%s([%s])" % (class_name, ", ".join(rows))
-
-    def __str__(self):
-        rows = ("[%s]" % ", ".join(repr(item) for item in row) for row in self)
-        return "[%s]" % "\n ".join(rows)
-
-    def __iter__(self):
-        """Support for iteration.
-
-        This is actually implemented as a generator, so there is no need for a
-        separate iterator class. The generator returns I{copies} of the rows in
-        the matrix as lists to avoid messing around with the internals. Feel
-        free to do anything with the copies, the changes won't be reflected in
-        the original matrix."""
-        return (list(row) for row in self._data)
-
-    def __plot__(self, context, bbox, palette, **kwds):
-        """Plots the matrix to the given Cairo context in the given box
-
-        Besides the usual self-explanatory plotting parameters (C{context},
-        C{bbox}, C{palette}), it accepts the following keyword arguments:
-
-          - C{style}: the style of the plot. C{boolean} is useful for plotting
-            matrices with boolean (C{True}/C{False} or 0/1) values: C{False}
-            will be shown with a white box and C{True} with a black box.
-            C{palette} uses the given palette to represent numbers by colors,
-            the minimum will be assigned to palette color index 0 and the maximum
-            will be assigned to the length of the palette. C{None} draws transparent
-            cell backgrounds only. The default style is C{boolean} (but it may
-            change in the future). C{None} values in the matrix are treated
-            specially in both cases: nothing is drawn in the cell corresponding
-            to C{None}.
-
-          - C{square}: whether the cells of the matrix should be square or not.
-            Default is C{True}.
-
-          - C{grid_width}: line width of the grid shown on the matrix. If zero or
-            negative, the grid is turned off. The grid is also turned off if the size
-            of a cell is less than three times the given line width. Default is C{1}.
-            Fractional widths are also allowed.
-
-          - C{border_width}: line width of the border drawn around the matrix.
-            If zero or negative, the border is turned off. Default is C{1}.
-
-          - C{row_names}: the names of the rows
-
-          - C{col_names}: the names of the columns.
-
-          - C{values}: values to be displayed in the cells. If C{None} or
-            C{False}, no values are displayed. If C{True}, the values come
-            from the matrix being plotted. If it is another matrix, the
-            values of that matrix are shown in the cells. In this case,
-            the shape of the value matrix must match the shape of the
-            matrix being plotted.
-
-          - C{value_format}: a format string or a callable that specifies how
-            the values should be plotted. If it is a callable, it must be a
-            function that expects a single value and returns a string.
-            Example: C{"%#.2f"} for floating-point numbers with always exactly
-            two digits after the decimal point. See the Python documentation of
-            the C{%} operator for details on the format string. If the format
-            string is not given, it defaults to the C{str} function.
-
-        If only the row names or the column names are given and the matrix
-        is square-shaped, the same names are used for both column and row
-        names.
-        """
-        # pylint: disable-msg=W0142
-        # pylint: disable-msg=C0103
-        grid_width = float(kwds.get("grid_width", 1.))
-        border_width = float(kwds.get("border_width", 1.))
-        style = kwds.get("style", "boolean")
-        row_names = kwds.get("row_names")
-        col_names = kwds.get("col_names", row_names)
-        values = kwds.get("values")
-        value_format = kwds.get("value_format", str)
-
-        # Validations
-        if style not in ("boolean", "palette", "none", None):
-            raise ValueError("invalid style")
-        if style == "none":
-            style = None
-        if row_names is None and col_names is not None:
-            row_names = col_names
-        if row_names is not None:
-            row_names = [str(name) for name in islice(row_names, self._nrow)]
-            if len(row_names) < self._nrow:
-                row_names.extend([""]*(self._nrow-len(row_names)))
-        if col_names is not None:
-            col_names = [str(name) for name in islice(col_names, self._ncol)]
-            if len(col_names) < self._ncol:
-                col_names.extend([""]*(self._ncol-len(col_names)))
-        if values == False:
-            values = None
-        if values == True:
-            values = self
-        if isinstance(values, list):
-            values = Matrix(list)
-        if values is not None and not isinstance(values, Matrix):
-            raise TypeError("values must be None, False, True or a matrix")
-        if values is not None and values.shape != self.shape:
-            raise ValueError("values must be a matrix of size %s" % self.shape)
-
-        # Calculate text extents if needed
-        if row_names is not None or col_names is not None:
-            te = context.text_extents
-            space_width = te(" ")[4]
-            max_row_name_width = max([te(s)[4] for s in row_names])+space_width
-            max_col_name_width = max([te(s)[4] for s in col_names])+space_width
-        else:
-            max_row_name_width, max_col_name_width = 0, 0
-
-        # Calculate sizes
-        total_width = float(bbox.width)-max_row_name_width
-        total_height = float(bbox.height)-max_col_name_width
-        dx = total_width / self.shape[1]
-        dy = total_height / self.shape[0]
-        if kwds.get("square", True):
-            dx, dy = min(dx, dy), min(dx, dy)
-        total_width, total_height = dx*self.shape[1], dy*self.shape[0]
-        ox = bbox.left + (bbox.width - total_width - max_row_name_width) / 2.0
-        oy = bbox.top + (bbox.height - total_height - max_col_name_width) / 2.0
-        ox += max_row_name_width
-        oy += max_col_name_width
-
-        # Determine rescaling factors for the palette if needed
-        if style == "palette":
-            mi, ma = self.min(), self.max()
-            color_offset = mi
-            color_ratio = (len(palette)-1) / float(ma-mi)
-
-        # Validate grid width
-        if dx < 3*grid_width or dy < 3*grid_width:
-            grid_width = 0.
-        if grid_width > 0:
-            context.set_line_width(grid_width)
-        else:
-            # When the grid width is zero, we will still stroke the
-            # rectangles, but with the same color as the fill color
-            # of the cell - otherwise we would get thin white lines
-            # between the cells as a drawing artifact
-            context.set_line_width(1)
-
-        # Draw row names (if any)
-        context.set_source_rgb(0., 0., 0.)
-        if row_names is not None:
-            x, y = ox, oy 
-            for heading in row_names:
-                _, _, _, h, xa, _ = context.text_extents(heading)
-                context.move_to(x-xa-space_width, y + (dy+h)/2.)
-                context.show_text(heading)
-                y += dy
-
-        # Draw column names (if any)
-        if col_names is not None:
-            context.save()
-            context.translate(ox, oy)
-            context.rotate(-1.5707963285)   # pi/2
-            x, y = 0., 0.
-            for heading in col_names:
-                _, _, _, h, _, _ = context.text_extents(heading)
-                context.move_to(x+space_width, y + (dx+h)/2.)
-                context.show_text(heading)
-                y += dx
-            context.restore()
-
-        # Draw matrix
-        x, y = ox, oy
-        if style is None:
-            fill = lambda: None
-        else:
-            fill = context.fill_preserve
-        for row in self:
-            for item in row:
-                if item is None:
-                    x += dx
-                    continue
-                if style == "boolean":
-                    if item:
-                        context.set_source_rgb(0., 0., 0.)
-                    else:
-                        context.set_source_rgb(1., 1., 1.)
-                elif style == "palette":
-                    cidx = int((item-color_offset)*color_ratio)
-                    if cidx < 0:
-                        cidx = 0
-                    context.set_source_rgba(*palette.get(cidx))
-                context.rectangle(x, y, dx, dy)
-                if grid_width > 0:
-                    fill()
-                    context.set_source_rgb(0.5, 0.5, 0.5)
-                    context.stroke()
-                else:
-                    fill()
-                    context.stroke()
-                x += dx
-            x, y = ox, y+dy
-
-        # Draw cell values
-        if values is not None:
-            x, y = ox, oy
-            context.set_source_rgb(0., 0., 0.)
-            for row in values.data:
-                if hasattr(value_format, "__call__"):
-                    values = [value_format(item) for item in row]
-                else:
-                    values = [value_format % item for item in row]
-                for item in values:
-                    th, tw = context.text_extents(item)[3:5]
-                    context.move_to(x+(dx-tw)/2., y+(dy+th)/2.)
-                    context.show_text(item)
-                    x += dx
-                x, y = ox, y+dy
-
-        # Draw borders
-        if border_width > 0:
-            context.set_line_width(border_width)
-            context.set_source_rgb(0., 0., 0.)
-            context.rectangle(ox, oy, dx*self.shape[1], dy*self.shape[0])
-            context.stroke()
-
-
-    def min(self, dim=None):
-        """Returns the minimum of the matrix along the given dimension
-
-        @param dim: the dimension. 0 means determining the column minimums, 1 means
-          determining the row minimums. If C{None}, the global minimum is
-          returned.
-        """
-        if dim == 1:
-            return [min(row) for row in self._data]
-        if dim == 0:
-            return [min(row[idx] for row in self._data) \
-                        for idx in xrange(self._ncol)]
-        return min(min(row) for row in self._data)
-
-    def max(self, dim=None):
-        """Returns the maximum of the matrix along the given dimension
-
-        @param dim: the dimension. 0 means determining the column maximums, 1 means
-          determining the row maximums. If C{None}, the global maximum is
-          returned.
-        """
-        if dim == 1:
-            return [max(row) for row in self._data]
-        if dim == 0:
-            return [max(row[idx] for row in self._data) \
-                        for idx in xrange(self._ncol)]
-        return max(max(row) for row in self._data)
-
-
-class DyadCensus(tuple):
-    """Dyad census of a graph.
-
-    This is a pretty simple class - basically it is a tuple, but it allows
-    the user to refer to its individual items by the names C{mutual} (or
-    C{mut}), C{asymmetric} (or C{asy} or C{asym} or C{asymm}) and C{null}.
-
-    Examples:
-
-      >>> from igraph import Graph
-      >>> g=Graph.Erdos_Renyi(100, 0.2, directed=True)
-      >>> dc=g.dyad_census()
-      >>> print dc.mutual             #doctest:+SKIP
-      179
-      >>> print dc["asym"]            #doctest:+SKIP
-      1609
-      >>> print tuple(dc), list(dc)   #doctest:+SKIP
-      (179, 1609, 3162) [179, 1609, 3162]
-      >>> print sorted(dc.as_dict().items())   #doctest:+ELLIPSIS
-      [('asymmetric', ...), ('mutual', ...), ('null', ...)]
-
-    @undocumented: _remap
-    """
-    _remap = {"mutual": 0, "mut": 0, "sym": 0, "symm": 0,
-        "asy": 1, "asym": 1, "asymm": 1, "asymmetric": 1, "null": 2}
-
-    def __getitem__(self, idx):
-        return tuple.__getitem__(self, self._remap.get(idx, idx))
-
-    def __getattr__(self, attr):
-        if attr in self._remap:
-            return tuple.__getitem__(self, self._remap[attr])
-        raise AttributeError("no such attribute: %s" % attr)
-
-    def __repr__(self):
-        return "DyadCensus((%d, %d, %d))" % self
-
-    def __str__(self):
-        return "%d mutual, %d asymmetric, %d null dyads" % self
-
-    def as_dict(self):
-        """Converts the dyad census to a dict using the known dyad names."""
-        return {"mutual": self[0], "asymmetric": self[1], "null": self[2]}
-
-
-class TriadCensus(tuple):
-    """Triad census of a graph.
-
-    This is a pretty simple class - basically it is a tuple, but it allows
-    the user to refer to its individual items by the following triad names:
-
-      - C{003} -- the empty graph
-      - C{012} -- a graph with a single directed edge (C{A --> B, C})
-      - C{102} -- a graph with a single mutual edge (C{A <-> B, C})
-      - C{021D} -- the binary out-tree (C{A <-- B --> C})
-      - C{021U} -- the binary in-tree (C{A --> B <-- C})
-      - C{021C} -- the directed line (C{A --> B --> C})
-      - C{111D} -- C{A <-> B <-- C}
-      - C{111U} -- C{A <-> B --> C}
-      - C{030T} -- C{A --> B <-- C, A --> C}
-      - C{030C} -- C{A <-- B <-- C, A --> C}
-      - C{201} -- C{A <-> B <-> C}
-      - C{120D} -- C{A <-- B --> C, A <-> C}
-      - C{120U} -- C{A --> B <-- C, A <-> C}
-      - C{120C} -- C{A --> B --> C, A <-> C}
-      - C{210C} -- C{A --> B <-> C, A <-> C}
-      - C{300} -- the complete graph (C{A <-> B <-> C, A <-> C})
-
-    Attribute and item accessors are provided. Due to the syntax of Python,
-    attribute names are not allowed to start with a number, therefore the
-    triad names must be prepended with a lowercase C{t} when accessing
-    them as attributes. This is not necessary with the item accessor syntax.
-
-    Examples:
-
-      >>> from igraph import Graph
-      >>> g=Graph.Erdos_Renyi(100, 0.2, directed=True)
-      >>> tc=g.triad_census()
-      >>> print tc.t003                     #doctest:+SKIP
-      39864
-      >>> print tc["030C"]                  #doctest:+SKIP
-      1206
-    """
-    _remap = {"003": 0, "012": 1, "102": 2, "021D": 3, "021U": 4, "021C": 5, \
-        "111D": 6, "111U": 7, "030T": 8, "030C": 9, "201": 10, "120D": 11, \
-        "120U": 12, "120C": 13, "210": 14, "300": 15}
-
-    def __getitem__(self, idx):
-        if isinstance(idx, basestring):
-            idx = idx.upper()
-        return tuple.__getitem__(self, self._remap.get(idx, idx))
-
-    def __getattr__(self, attr):
-        if isinstance(attr, basestring) and attr[0] == 't' \
-                and attr[1:].upper() in self._remap:
-            return tuple.__getitem__(self, self._remap[attr[1:].upper()])
-        raise AttributeError("no such attribute: %s" % attr)
-
-    def __repr__(self):
-        return "TriadCensus((%s))" % ", ".join(str(item) for item in self)
-
-    def __str__(self):
-        maxidx = len(self)
-        maxcount = max(self)
-        numwidth = len(str(maxcount))
-        captionwidth = max(len(key) for key in self._remap)
-        colcount = 4
-
-        rowcount = maxidx / colcount
-        if rowcount * colcount < maxidx:
-            rowcount += 1
-
-        invmap = dict((v, k) for k, v in self._remap.iteritems())
-        result, row, idx = [], [], 0
-        for _ in xrange(rowcount):
-            for _ in xrange(colcount):
-                if idx >= maxidx:
-                    break 
-                row.append("%-*s: %*d" % (captionwidth, invmap.get(idx, ""),
-                  numwidth, self[idx]))
-                idx += 1
-            result.append(" | ".join(row))
-            row = []
-
-        return "\n".join(result)
-
-
-class UniqueIdGenerator(object):
-    """A dictionary-like class that can be used to assign unique IDs to
-    names (say, vertex names).
-
-    Usage:
-    
-    >>> gen = UniqueIdGenerator()
-    >>> gen["A"]
-    0
-    >>> gen["B"]
-    1
-    >>> gen["C"]
-    2
-    >>> gen["A"]      # Retrieving already existing ID
-    0
-    >>> gen.add("D")  # Synonym of gen["D"]
-    3
-    >>> len(gen)      # Number of already used IDs
-    4
-    >>> "C" in gen
-    True
-    >>> "E" in gen
-    False
-    """
-
-    def __init__(self, id_generator=None, initial=None):
-        """Creates a new unique ID generator. `id_generator` specifies how do we
-        assign new IDs to elements that do not have an ID yet. If it is `None`,
-        elements will be assigned integer identifiers starting from 0. If it is
-        an integer, elements will be assigned identifiers starting from the given
-        integer. If it is an iterator or generator, its `next` method will be
-        called every time a new ID is needed."""
-        if id_generator is None:
-            id_generator = 0
-        if isinstance(id_generator, int):
-            import itertools
-            self._generator = itertools.count(id_generator)
-        else:
-            self._generator = id_generator
-        self._ids = {}
-        if initial:
-            for value in initial:
-                self.add(value)
-
-    def __contains__(self, item):
-        """Checks whether `item` already has an ID or not."""
-        return item in self._ids
-
-    def __getitem__(self, item):
-        """Retrieves the ID corresponding to `item`. Generates a new ID for
-        `item` if it is the first time we request an ID for it."""
-        try:
-            return self._ids[item]
-        except KeyError:
-            self._ids[item] = self._generator.next()
-            return self._ids[item]
-
-    def __setitem__(self, item, value):
-        """Overrides the ID for `item`."""
-        self._ids[item] = value
-
-    def __len__(self):
-        """"Returns the number of items"""
-        return len(self._ids)
-
-    def reverse_dict(self):
-        """Returns the reverse mapping, i.e., the one that maps from generated
-        IDs to their corresponding objects"""
-        return dict((v, k) for k, v in self._ids.iteritems())
-
-    def values(self):
-        """Returns the values stored so far. If the generator generates items
-        according to the standard sorting order, the values returned will be
-        exactly in the order they were added. This holds for integer IDs for
-        instance (but for many other ID generators as well)."""
-        return sorted(self._ids.keys(), key = self._ids.__getitem__)
-
-    add = __getitem__
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/__init__.py igraph-0.6.5/interfaces/python/igraph/drawing/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,445 +0,0 @@
-"""
-Drawing and plotting routines for IGraph.
-
-Plotting is dependent on the C{pycairo} library which provides Python bindings
-to the popular U{Cairo library<http://www.cairographics.org>}. This means that
-if you don't have U{pycairo<http://www.cairographics.org/pycairo>} installed,
-you won't be able to use the plotting capabilities. However, you can still use
-L{Graph.write_svg} to save the graph to an SVG file and view it from
-U{Mozilla Firefox<http://www.mozilla.org/firefox>} (free) or edit it in
-U{Inkscape<http://www.inkscape.org>} (free), U{Skencil<http://www.skencil.org>}
-(formerly known as Sketch, also free) or Adobe Illustrator (not free, therefore
-I'm not linking to it :)).
-"""
-
-from __future__ import with_statement
-
-from warnings import warn
-
-import os
-import platform
-import time
-
-from igraph.compat import property
-from igraph.configuration import Configuration
-from igraph.drawing.colors import Palette, palettes
-from igraph.drawing.graph import DefaultGraphDrawer
-from igraph.drawing.utils import BoundingBox, Point, Rectangle
-from igraph.utils import named_temporary_file
-
-__all__ = ["BoundingBox", "DefaultGraphDrawer", "Plot", "Point", "Rectangle", "plot"]
-
-__license__ = "GPL"
-
-try:
-    import cairo
-except ImportError:
-    # No cairo support is installed. Create a fake module
-    # pylint: disable-msg=C0103
-    from igraph.drawing.utils import FakeModule
-    cairo = FakeModule()
-
-#####################################################################
-
-class Plot(object):
-    """Class representing an arbitrary plot
-
-    Every plot has an associated surface object where the plotting is done. The
-    surface is an instance of C{cairo.Surface}, a member of the C{pycairo}
-    library. The surface itself provides a unified API to various plotting
-    targets like SVG files, X11 windows, PostScript files, PNG files and so on.
-    C{igraph} usually does not know on which surface it is plotting right now,
-    since C{pycairo} takes care of the actual drawing. Everything that's supported
-    by C{pycairo} should be supported by this class as well.
-
-    Current Cairo surfaces that I'm aware of are:
-
-      - C{cairo.GlitzSurface} -- OpenGL accelerated surface for the X11
-        Window System.
-
-      - C{cairo.ImageSurface} -- memory buffer surface. Can be written to a
-        C{PNG} image file.
-
-      - C{cairo.PDFSurface} -- PDF document surface.
-
-      - C{cairo.PSSurface} -- PostScript document surface.
-
-      - C{cairo.SVGSurface} -- SVG (Scalable Vector Graphics) document surface.
-
-      - C{cairo.Win32Surface} -- Microsoft Windows screen rendering.
-
-      - C{cairo.XlibSurface} -- X11 Window System screen rendering.
-
-    If you create a C{Plot} object with a string given as the target surface,
-    the string will be treated as a filename, and its extension will decide
-    which surface class will be used. Please note that not all surfaces might
-    be available, depending on your C{pycairo} installation.
-
-    A C{Plot} has an assigned default palette (see L{igraph.drawing.colors.Palette})
-    which is used for plotting objects.
-
-    A C{Plot} object also has a list of objects to be plotted with their
-    respective bounding boxes, palettes and opacities. Palettes assigned
-    to an object override the default palette of the plot. Objects can be
-    added by the L{Plot.add} method and removed by the L{Plot.remove} method.
-    """
-
-    # pylint: disable-msg=E1101
-    # E1101: Module 'cairo' has no 'foo' member - of course it has! :)
-    def __init__(self, target=None, bbox=None, palette=None, background=None):
-        """Creates a new plot.
-
-        @param target: the target surface to write to. It can be one of the
-          following types:
-
-            - C{None} -- an appropriate surface will be created and the object
-              will be plotted there.
-
-            - C{cairo.Surface} -- the given Cairo surface will be used.
-
-            - C{string} -- a file with the given name will be created and an
-              appropriate Cairo surface will be attached to it.
-
-        @param bbox: the bounding box of the surface. It is interpreted
-          differently with different surfaces: PDF and PS surfaces will
-          treat it as points (1 point = 1/72 inch). Image surfaces will
-          treat it as pixels. SVG surfaces will treat it as an abstract
-          unit, but it will mostly be interpreted as pixels when viewing
-          the SVG file in Firefox.
-
-        @param palette: the palette primarily used on the plot if the
-          added objects do not specify a private palette. Must be either
-          an L{igraph.drawing.colors.Palette} object or a string referring
-          to a valid key of C{igraph.drawing.colors.palettes} (see module
-          L{igraph.drawing.colors}) or C{None}. In the latter case, the default
-          palette given by the configuration key C{plotting.palette} is used.
-
-        @param background: the background color. If C{None}, the background
-          will be transparent. You can use any color specification here that
-          is understood by L{igraph.drawing.colors.color_name_to_rgba}.
-        """
-        self._filename = None
-        self._surface_was_created = not isinstance(target, cairo.Surface)
-        self._need_tmpfile = False
-
-        # Several Windows-specific hacks will be used from now on, thanks
-        # to Dale Hunscher for debugging and fixing all that stuff
-        self._windows_hacks = "Windows" in platform.platform()
-
-        if bbox is None:
-            self.bbox = BoundingBox(600, 600)
-        elif isinstance(bbox, tuple) or isinstance(bbox, list):
-            self.bbox = BoundingBox(bbox)
-        else:
-            self.bbox = bbox
-
-        if palette is None:
-            config = Configuration.instance()
-            palette = config["plotting.palette"]
-        if not isinstance(palette, Palette):
-            palette = palettes[palette]
-        self._palette = palette
-
-        if target is None:
-            self._need_tmpfile = True
-            self._surface = cairo.ImageSurface(cairo.FORMAT_ARGB32, \
-                int(self.bbox.width), int(self.bbox.height))
-        elif isinstance(target, cairo.Surface):
-            self._surface = target
-        else:
-            self._filename = target
-            _, ext = os.path.splitext(target)
-            ext = ext.lower()
-            if ext == ".pdf":
-                self._surface = cairo.PDFSurface(target, self.bbox.width, \
-                                                 self.bbox.height)
-            elif ext == ".ps" or ext == ".eps":
-                self._surface = cairo.PSSurface(target, self.bbox.width, \
-                                                self.bbox.height)
-            elif ext == ".png":
-                self._surface = cairo.ImageSurface(cairo.FORMAT_ARGB32, \
-                    int(self.bbox.width), int(self.bbox.height))
-            elif ext == ".svg":
-                self._surface = cairo.SVGSurface(target, self.bbox.width, \
-                                                 self.bbox.height)
-            else:
-                raise ValueError("image format not handled by Cairo: %s" % ext)
-
-        self._ctx = cairo.Context(self._surface)
-        self._objects = []
-        self._is_dirty = False
-
-        self.background = background
-
-    def add(self, obj, bbox=None, palette=None, opacity=1.0, *args, **kwds):
-        """Adds an object to the plot.
-
-        Arguments not specified here are stored and passed to the object's
-        plotting function when necessary. Since you are most likely interested
-        in the arguments acceptable by graphs, see L{Graph.__plot__} for more
-        details.
-
-        @param obj: the object to be added
-        @param bbox: the bounding box of the object. If C{None}, the object
-          will fill the entire area of the plot.
-        @param palette: the color palette used for drawing the object. If the
-          object tries to get a color assigned to a positive integer, it
-          will use this palette. If C{None}, defaults to the global palette
-          of the plot.
-        @param opacity: the opacity of the object being plotted, in the range
-          0.0-1.0
-
-        @see: Graph.__plot__
-        """
-        if opacity < 0.0 or opacity > 1.0:
-            raise ValueError("opacity must be between 0.0 and 1.0")
-        if bbox is None:
-            bbox = self.bbox
-        if not isinstance(bbox, BoundingBox):
-            bbox = BoundingBox(bbox)
-        self._objects.append((obj, bbox, palette, opacity, args, kwds))
-        self.mark_dirty()
-
-    @property
-    def background(self):
-        """Returns the background color of the plot. C{None} means a
-        transparent background.
-        """
-        return self._background
-
-    @background.setter
-    def background(self, color):
-        """Sets the background color of the plot. C{None} means a
-        transparent background. You can use any color specification here
-        that is understood by the C{get} method of the current palette
-        or by L{igraph.colors.color_name_to_rgb}.
-        """
-        if color is None:
-            self._background = None
-        else:
-            self._background = self._palette.get(color)
-
-    def remove(self, obj, bbox=None, idx=1):
-        """Removes an object from the plot.
-
-        If the object has been added multiple times and no bounding box
-        was specified, it removes the instance which occurs M{idx}th
-        in the list of identical instances of the object.
-
-        @param obj: the object to be removed
-        @param bbox: optional bounding box specification for the object.
-          If given, only objects with exactly this bounding box will be
-          considered.
-        @param idx: if multiple objects match the specification given by
-          M{obj} and M{bbox}, only the M{idx}th occurrence will be removed.
-        @return: C{True} if the object has been removed successfully,
-          C{False} if the object was not on the plot at all or M{idx}
-          was larger than the count of occurrences
-        """
-        for i in xrange(len(self._objects)):
-            current_obj, current_bbox = self._objects[i][0:2]
-            if current_obj is obj and (bbox is None or current_bbox == bbox):
-                idx -= 1
-                if idx == 0:
-                    self._objects[i:(i+1)] = []
-                    self.mark_dirty()
-                    return True
-        return False
-
-    def mark_dirty(self):
-        """Marks the plot as dirty (should be redrawn)"""
-        self._is_dirty = True
-
-    # pylint: disable-msg=W0142
-    # W0142: used * or ** magic
-    def redraw(self, context=None):
-        """Redraws the plot"""
-        ctx = context or self._ctx
-        if self._background is not None:
-            ctx.set_source_rgba(*self._background)
-            ctx.rectangle(0, 0, self.bbox.width, self.bbox.height)
-            ctx.fill()
-
-        for obj, bbox, palette, opacity, args, kwds in self._objects:
-            if palette is None:
-                palette = getattr(obj, "_default_palette", self._palette)
-            plotter = getattr(obj, "__plot__", None)
-            if plotter is None:
-                warn("%s does not support plotting" % obj)
-            else:
-                if opacity < 1.0:
-                    ctx.push_group()
-                else:
-                    ctx.save()
-                plotter(ctx, bbox, palette, *args, **kwds)
-                if opacity < 1.0:
-                    ctx.pop_group_to_source()
-                    ctx.paint_with_alpha(opacity)
-                else:
-                    ctx.restore()
-
-        self._is_dirty = False
-
-    def save(self, fname=None):
-        """Saves the plot.
-
-        @param fname: the filename to save to. It is ignored if the surface
-          of the plot is not an C{ImageSurface}.
-        """
-        if self._is_dirty:
-            self.redraw()
-        if isinstance(self._surface, cairo.ImageSurface):
-            if fname is None and self._need_tmpfile:
-                with named_temporary_file(prefix="igraph", suffix=".png") as fname:
-                    self._surface.write_to_png(fname)
-                    return None
-
-            fname  = fname or self._filename
-            if fname is None:
-                raise ValueError("no file name is known for the surface " + \
-                                 "and none given")
-            return self._surface.write_to_png(fname)
-
-        if fname is not None:
-            warn("filename is ignored for surfaces other than ImageSurface")
-
-        self._ctx.show_page()
-        self._surface.finish()
-
-
-    def show(self):
-        """Saves the plot to a temporary file and shows it."""
-        if not isinstance(self._surface, cairo.ImageSurface):
-            sur = cairo.ImageSurface(cairo.FORMAT_ARGB32,
-                    int(self.bbox.width), int(self.bbox.height))
-            ctx = cairo.Context(sur)
-            self.redraw(ctx)
-        else:
-            sur = self._surface
-            ctx = self._ctx
-            if self._is_dirty:
-                self.redraw(ctx)
-
-        with named_temporary_file(prefix="igraph", suffix=".png") as tmpfile:
-            sur.write_to_png(tmpfile)
-            config = Configuration.instance()
-            imgviewer = config["apps.image_viewer"]
-            if not imgviewer:
-                # No image viewer was given and none was detected. This
-                # should only happen on unknown platforms.
-                plat = platform.system()
-                raise NotImplementedError("showing plots is not implemented " + \
-                                          "on this platform: %s" % plat)
-            else:
-                os.system("%s %s" % (imgviewer, tmpfile))
-                if platform.system() == "Darwin" or self._windows_hacks:
-                    # On Mac OS X and Windows, launched applications are likely to
-                    # fork and give control back to Python immediately.
-                    # Chances are that the temporary image file gets removed
-                    # before the image viewer has a chance to open it, so
-                    # we wait here a little bit. Yes, this is quite hackish :(
-                    time.sleep(5)
-
-
-    @property
-    def bounding_box(self):
-        """Returns the bounding box of the Cairo surface as a
-        L{BoundingBox} object"""
-        return BoundingBox(self.bbox)
-
-    @property
-    def height(self):
-        """Returns the height of the Cairo surface on which the plot
-        is drawn"""
-        return self.bbox.height
-
-    @property
-    def surface(self):
-        """Returns the Cairo surface on which the plot is drawn"""
-        return self._surface
-
-    @property
-    def width(self):
-        """Returns the width of the Cairo surface on which the plot
-        is drawn"""
-        return self.bbox.width
-
-#####################################################################
-
-def plot(obj, target=None, bbox=(0, 0, 600, 600), *args, **kwds):
-    """Plots the given object to the given target.
-
-    Positional and keyword arguments not explicitly mentioned here will be
-    passed down to the C{__plot__} method of the object being plotted.
-    Since you are most likely interested in the keyword arguments available
-    for graph plots, see L{Graph.__plot__} as well.
-
-    @param obj: the object to be plotted
-    @param target: the target where the object should be plotted. It can be one
-      of the following types:
-      
-        - C{None} -- an appropriate surface will be created and the object will
-          be plotted there.
-
-        - C{cairo.Surface} -- the given Cairo surface will be used. This can
-          refer to a PNG image, an arbitrary window, an SVG file, anything that
-          Cairo can handle.
-
-        - C{string} -- a file with the given name will be created and an
-          appropriate Cairo surface will be attached to it. The supported image
-          formats are: PNG, PDF, SVG and PostScript.
-          
-    @param bbox: the bounding box of the plot. It must be a tuple with either
-      two or four integers, or a L{BoundingBox} object. If this is a tuple
-      with two integers, it is interpreted as the width and height of the plot
-      (in pixels for PNG images and on-screen plots, or in points for PDF,
-      SVG and PostScript plots, where 72 pt = 1 inch = 2.54 cm). If this is
-      a tuple with four integers, the first two denotes the X and Y coordinates
-      of a corner and the latter two denoting the X and Y coordinates of the
-      opposite corner.
-
-    @keyword opacity: the opacity of the object being plotted. It can be
-      used to overlap several plots of the same graph if you use the same
-      layout for them -- for instance, you might plot a graph with opacity
-      0.5 and then plot its spanning tree over it with opacity 0.1. To
-      achieve this, you'll need to modify the L{Plot} object returned with
-      L{Plot.add}.
-
-    @keyword palette: the palette primarily used on the plot if the
-      added objects do not specify a private palette. Must be either
-      an L{igraph.drawing.colors.Palette} object or a string referring
-      to a valid key of C{igraph.drawing.colors.palettes} (see module
-      L{igraph.drawing.colors}) or C{None}. In the latter case, the default
-      palette given by the configuration key C{plotting.palette} is used.
-
-    @keyword margin: the top, right, bottom, left margins as a 4-tuple.
-      If it has less than 4 elements or is a single float, the elements
-      will be re-used until the length is at least 4. The default margin
-      is 20 on each side.
-
-    @return: an appropriate L{Plot} object.
-
-    @see: Graph.__plot__
-    """
-    if not isinstance(bbox, BoundingBox):
-        bbox = BoundingBox(bbox)
-
-    result = Plot(target, bbox, background="white")
-
-    if "margin" in kwds:
-        bbox = bbox.contract(kwds["margin"])
-        del kwds["margin"]
-    else:
-        bbox = bbox.contract(20)
-    result.add(obj, bbox, *args, **kwds)
-
-    if target is None:
-        result.show()
-
-    if isinstance(target, basestring):
-        result.save()
-
-    return result
-
-#####################################################################
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/baseclasses.py igraph-0.6.5/interfaces/python/igraph/drawing/baseclasses.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/baseclasses.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/baseclasses.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,144 +0,0 @@
-"""
-Abstract base classes for the drawing routines.
-"""
-
-from igraph.compat import property
-from igraph.drawing.utils import BoundingBox
-from math import pi
-
-#####################################################################
-
-# pylint: disable-msg=R0903
-# R0903: too few public methods
-class AbstractDrawer(object):
-    """Abstract class that serves as a base class for anything that
-    draws an igraph object."""
-
-    def draw(self, *args, **kwds):
-        """Abstract method, must be implemented in derived classes."""
-        raise NotImplementedError("abstract class")
-
-#####################################################################
-
-# pylint: disable-msg=R0903
-# R0903: too few public methods
-class AbstractCairoDrawer(AbstractDrawer):
-    """Abstract class that serves as a base class for anything that
-    draws on a Cairo context within a given bounding box.
-    
-    A subclass of L{AbstractCairoDrawer} is guaranteed to have an
-    attribute named C{context} that represents the Cairo context
-    to draw on, and an attribute named C{bbox} for the L{BoundingBox}
-    of the drawing area.
-    """
-
-    def __init__(self, context, bbox):
-        """Constructs the drawer and associates it to the given
-        Cairo context and the given L{BoundingBox}.
-
-        @param context: the context on which we will draw
-        @param bbox:    the bounding box within which we will draw.
-                        Can be anything accepted by the constructor
-                        of L{BoundingBox} (i.e., a 2-tuple, a 4-tuple
-                        or a L{BoundingBox} object).
-        """
-        self.context = context
-        self._bbox = None
-        self.bbox = bbox
-
-    @property
-    def bbox(self):
-        """The bounding box of the drawing area where this drawer will
-        draw."""
-        return self._bbox
-
-    @bbox.setter
-    def bbox(self, bbox):
-        """Sets the bounding box of the drawing area where this drawer
-        will draw."""
-        if not isinstance(bbox, BoundingBox):
-            self._bbox = BoundingBox(bbox)
-        else:
-            self._bbox = bbox
-
-    def draw(self, *args, **kwds):
-        """Abstract method, must be implemented in derived classes."""
-        raise NotImplementedError("abstract class")
-
-    def _mark_point(self, x, y, color=0, size=4):
-        """Marks the given point with a small circle on the canvas.
-        Used primarily for debugging purposes.
-
-        @param x: the X coordinate of the point to mark
-        @param y: the Y coordinate of the point to mark
-        @param color: the color of the marker. It can be a
-          3-tuple (RGB components, alpha=0.5), a 4-tuple
-          (RGBA components) or an index where zero means red, 1 means
-          green, 2 means blue and so on.
-        @param size: the diameter of the marker.
-        """
-        if isinstance(color, int):
-            colors = [(1, 0, 0), (0, 1, 0), (0, 0, 1), (1, 1, 0),
-                    (0, 1, 1), (1, 0, 1)]
-            color = colors[color % len(colors)]
-        if len(color) == 3:
-            color += (0.5, )
-
-        ctx = self.context
-        ctx.save()
-        ctx.set_source_rgba(*color)
-        ctx.arc(x, y, size / 2.0, 0, 2*pi)
-        ctx.fill()
-        ctx.restore()
-
-#####################################################################
-
-class AbstractXMLRPCDrawer(AbstractDrawer):
-    """Abstract drawer that uses a remote service via XML-RPC
-    to draw something on a remote display.
-    """
-
-    def __init__(self, url, service=None):
-        """Constructs an abstract drawer using the XML-RPC service
-        at the given URL.
-        
-        @param url: the URL where the XML-RPC calls for the service should
-          be addressed to.
-        @param service: the name of the service at the XML-RPC address. If
-          C{None}, requests will be directed to the server proxy object
-          constructed by C{xmlrpclib.ServerProxy}; if not C{None}, the
-          given attribute will be looked up in the server proxy object.
-        """
-        import xmlrpclib
-        url = self._resolve_hostname(url)
-        self.server = xmlrpclib.ServerProxy(url)
-        if service is None:
-            self.service = self.server
-        else:
-            self.service = getattr(self.server, service)
-
-    @staticmethod
-    def _resolve_hostname(url):
-        """Parses the given URL, resolves the hostname to an IP address
-        and returns a new URL with the resolved IP address. This speeds
-        up things big time on Mac OS X where an IP lookup would be
-        performed for every XML-RPC call otherwise."""
-        from urlparse import urlparse, urlunparse
-        import re
-
-        url_parts = urlparse(url)
-        hostname = url_parts.netloc
-        if re.match("[0-9.:]+$", hostname):
-            # the hostname is already an IP address, possibly with a port
-            return url
-
-        from socket import gethostbyname
-        if ":" in hostname:
-            hostname = hostname[0:hostname.index(":")]
-        hostname = gethostbyname(hostname)
-        if url_parts.port is not None:
-            hostname = "%s:%d" % (hostname, url_parts.port)
-        url_parts = list(url_parts)
-        url_parts[1] = hostname
-        return urlunparse(url_parts)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/colors.py igraph-0.6.5/interfaces/python/igraph/drawing/colors.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/colors.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/colors.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,3080 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Color handling functions.
-"""
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-from igraph.datatypes import Matrix
-from igraph.utils import str_to_orientation
-from math import ceil
-
-__all__ = ["Palette", "GradientPalette", "AdvancedGradientPalette", \
-    "RainbowPalette", "PrecalculatedPalette", "ClusterColoringPalette", \
-    "color_name_to_rgb", "color_name_to_rgba", \
-    "hsv_to_rgb", "hsva_to_rgba", "hsl_to_rgb", "hsla_to_rgba", \
-    "rgb_to_hsv", "rgba_to_hsva", "rgb_to_hsl", "rgba_to_hsla", \
-    "palettes", "known_colors"]
-
-class Palette(object):
-    """Base class of color palettes.
-
-    Color palettes are mappings that assign integers from the range
-    0..M{n-1} to colors (4-tuples). M{n} is called the size or length
-    of the palette. C{igraph} comes with a number of predefined palettes,
-    so this class is useful for you only if you want to define your
-    own palette. This can be done by subclassing this class and implementing
-    the L{Palette._get} method as necessary.
-
-    Palettes can also be used as lists or dicts, for the C{__getitem__}
-    method is overridden properly to call L{Palette.get}.
-    """
-    def __init__(self, n):
-        self._length = n
-        self._cache = {}
-
-    def clear_cache(self):
-        """Clears the result cache.
-        
-        The return values of L{Palette.get} are cached. Use this method
-        to clear the cache.
-        """
-        self._cache = {}
-
-    def get(self, v):
-        """Returns the given color from the palette.
-
-        Values are cached: if the specific value given has already been
-        looked up, its value will be returned from the cache instead of
-        calculating it again. Use L{Palette.clear_cache} to clear the cache
-        if necessary.
-
-        @note: you shouldn't override this method in subclasses, override
-          L{_get} instead. If you override this method, lookups in the
-          L{known_colors} dict won't work, so you won't be able to refer to
-          colors by names or RGBA quadruplets, only by integer indices. The
-          caching functionality will disappear as well. However,
-          feel free to override this method if this is exactly the behaviour
-          you want.
-
-        @param v: the color to be retrieved. If it is an integer, it is
-          passed to L{Palette._get} to be translated to an RGBA quadruplet.
-          Otherwise it is passed to L{color_name_to_rgb()} to determine the
-          RGBA values.
-
-        @return: the color as an RGBA quadruplet"""
-        if isinstance(v, list):
-            v = tuple(v)
-        try:
-            return self._cache[v]
-        except KeyError:
-            pass
-        if isinstance(v, (int, long)):
-            if v < 0:
-                raise IndexError("color index must be non-negative")
-            if v >= self._length:
-                raise IndexError("color index too large")
-            result = self._get(v)
-        else:
-            result = color_name_to_rgba(v)
-        self._cache[v] = result
-        return result
-
-    def get_many(self, colors):
-        """Returns multiple colors from the palette.
-
-        Values are cached: if the specific value given has already been
-        looked upon, its value will be returned from the cache instead of
-        calculating it again. Use L{Palette.clear_cache} to clear the cache
-        if necessary.
-
-        @param colors: the list of colors to be retrieved. The palette class
-          tries to make an educated guess here: if it is not possible to
-          interpret the value you passed here as a list of colors, the
-          class will simply try to interpret it as a single color by
-          forwarding the value to L{Palette.get}.
-        @return: the colors as a list of RGBA quadruplets. The result will
-          be a list even if you passed a single color index or color name.
-        """
-        if isinstance(colors, (basestring, int, long)):
-            # Single color name or index
-            return [self.get(colors)]
-        # Multiple colors
-        return [self.get(color) for color in colors]
-
-    def _get(self, v):
-        """Override this method in a subclass to create a custom palette.
-
-        You can safely assume that v is an integer in the range 0..M{n-1}
-        where M{n} is the size of the palette.
-
-        @param v: numerical index of the color to be retrieved
-        @return: a 4-tuple containing the RGBA values"""
-        raise NotImplementedError("abstract class")
-
-    __getitem__ = get
-
-    @property
-    def length(self):
-        """Returns the number of colors in this palette"""
-        return self._length
-
-    def __len__(self):
-        """Returns the number of colors in this palette"""
-        return self._length
-
-    def __plot__(self, context, bbox, palette, *args, **kwds):
-        """Plots the colors of the palette on the given Cairo context
-
-        Supported keyword arguments are:
-
-          - C{border_width}: line width of the border shown around the palette.
-            If zero or negative, the border is turned off. Default is C{1}.
-
-          - C{grid_width}: line width of the grid that separates palette cells.
-            If zero or negative, the grid is turned off. The grid is also
-            turned off if the size of a cell is less than three times the given
-            line width. Default is C{0}.  Fractional widths are also allowed.
-
-          - C{orientation}: the orientation of the palette. Must be one of
-            the following values: C{left-right}, C{bottom-top}, C{right-left}
-            or C{top-bottom}. Possible aliases: C{horizontal} = C{left-right},
-            C{vertical} = C{bottom-top}, C{lr} = C{left-right},
-            C{rl} = C{right-left}, C{tb} = C{top-bottom}, C{bt} = C{bottom-top}.
-            The default is C{left-right}.
-        """
-        border_width = float(kwds.get("border_width", 1.))
-        grid_width = float(kwds.get("grid_width", 0.))
-        orientation = str_to_orientation(kwds.get("orientation", "lr"))
-
-        # Construct a matrix and plot that
-        indices = range(len(self))
-        if orientation in ("rl", "bt"):
-            indices.reverse()
-        if orientation in ("lr", "rl"):
-            matrix = Matrix([indices])
-        else:
-            matrix = Matrix([[i] for i in indices])
-
-        return matrix.__plot__(context, bbox, self, style="palette",
-                square=False, grid_width=grid_width,
-                border_width=border_width)
-
-    def __repr__(self):
-        return "<%s with %d colors>" % (self.__class__.__name__, self._length)
-
-
-class GradientPalette(Palette):
-    """Base class for gradient palettes
-
-    Gradient palettes contain a gradient between two given colors.
-
-    Example:
-    
-      >>> pal = GradientPalette("red", "blue", 5)
-      >>> pal.get(0)
-      (1.0, 0.0, 0.0, 1.0)
-      >>> pal.get(2)
-      (0.5, 0.0, 0.5, 1.0)
-      >>> pal.get(4)
-      (0.0, 0.0, 1.0, 1.0)
-    """
-
-    def __init__(self, color1, color2, n=256):
-        """Creates a gradient palette.
-
-        @param color1: the color where the gradient starts.
-        @param color2: the color where the gradient ends.
-        @param n: the number of colors in the palette.
-        """
-        Palette.__init__(self, n)
-        self._color1 = color_name_to_rgba(color1)
-        self._color2 = color_name_to_rgba(color2)
-
-    def _get(self, v):
-        """Returns the color corresponding to the given color index.
-
-        @param v: numerical index of the color to be retrieved
-        @return: a 4-tuple containing the RGBA values"""
-        ratio = float(v)/(len(self)-1)
-        return tuple(self._color1[x]*(1-ratio) + \
-                     self._color2[x]*ratio for x in range(4))
-
-
-class AdvancedGradientPalette(Palette):
-    """Advanced gradient that consists of more than two base colors.
-    
-    Example:
-    
-      >>> pal = AdvancedGradientPalette(["red", "black", "blue"], n=9)
-      >>> pal.get(2)
-      (0.5, 0.0, 0.0, 1.0)
-      >>> pal.get(7)
-      (0.0, 0.0, 0.75, 1.0)
-    """
-
-    def __init__(self, colors, indices=None, n=256):
-        """Creates an advanced gradient palette
-
-        @param colors: the colors in the gradient.
-        @param indices: the color indices belonging to the given colors. If
-          C{None}, the colors are distributed equidistantly
-        @param n: the total number of colors in the palette
-        """
-        Palette.__init__(self, n)
-
-        if indices is None:
-            diff = float(n-1) / (len(colors)-1)
-            indices = [i * diff for i in xrange(len(colors))]
-        elif not hasattr(indices, "__iter__"):
-            indices = [float(x) for x in indices]
-        self._indices, self._colors = zip(*sorted(zip(indices, colors)))
-        self._colors = [color_name_to_rgba(color) for color in self._colors]
-        self._dists = [curr-prev for curr, prev in \
-                zip(self._indices[1:], self._indices)]
-
-    def _get(self, v):
-        """Returns the color corresponding to the given color index.
-
-        @param v: numerical index of the color to be retrieved
-        @return: a 4-tuple containing the RGBA values"""
-        colors = self._colors
-        for i in xrange(len(self._indices)-1):
-            if self._indices[i] <= v and self._indices[i+1] >= v:
-                dist = self._dists[i]
-                ratio = float(v-self._indices[i])/dist
-                return tuple([colors[i][x]*(1-ratio)+colors[i+1][x]*ratio \
-                        for x in range(4)])
-        return (0., 0., 0., 1.)
-
-class RainbowPalette(Palette):
-    """A palette that varies the hue of the colors along a scale.
-
-    Colors in a rainbow palette all have the same saturation, value and
-    alpha components, while the hue is varied between two given extremes
-    linearly. This palette has the advantage that it wraps around nicely
-    if the hue is varied between zero and one (which is the default).
-
-    Example:
-
-        >>> pal = RainbowPalette(n=120)
-        >>> pal.get(0)
-        (1.0, 0.0, 0.0, 1.0)
-        >>> pal.get(20)
-        (1.0, 1.0, 0.0, 1.0)
-        >>> pal.get(40)
-        (0.0, 1.0, 0.0, 1.0)
-        >>> pal = RainbowPalette(n=120, s=1, v=0.5, alpha=0.75)
-        >>> pal.get(60)
-        (0.0, 0.5, 0.5, 0.75)
-        >>> pal.get(80)
-        (0.0, 0.0, 0.5, 0.75)
-        >>> pal.get(100)
-        (0.5, 0.0, 0.5, 0.75)
-        >>> pal = RainbowPalette(n=120)
-        >>> pal2 = RainbowPalette(n=120, start=0.5, end=0.5)
-        >>> pal.get(60) == pal2.get(0)
-        True
-        >>> pal.get(90) == pal2.get(30)
-        True
-
-    This palette was modeled after the C{rainbow} command of R.
-    """
-
-    def __init__(self, n=256, s=1, v=1, start=0, end=1, alpha=1):
-        """Creates a rainbow palette.
-
-        @param n: the number of colors in the palette.
-        @param s: the saturation of the colors in the palette.
-        @param v: the value component of the colors in the palette.
-        @param start: the hue at which the rainbow begins (between 0 and 1).
-        @param end: the hue at which the rainbow ends (between 0 and 1).
-        @param alpha: the alpha component of the colors in the palette.
-        """
-        Palette.__init__(self, n)
-        self._s = float(clamp(s, 0, 1))
-        self._v = float(clamp(v, 0, 1))
-        self._alpha = float(clamp(alpha, 0, 1))
-        self._start = float(start)
-        if end == self._start:
-            end += 1
-        self._dh = (end - self._start) / n
-
-    def _get(self, v):
-        """Returns the color corresponding to the given color index.
-
-        @param v: numerical index of the color to be retrieved
-        @return: a 4-tuple containing the RGBA values"""
-        return hsva_to_rgba(self._start + v * self._dh,
-                self._s, self._v, self._alpha)
-
-
-class PrecalculatedPalette(Palette):
-    """A palette that returns colors from a pre-calculated list of colors"""
-
-    def __init__(self, l):
-        """Creates the palette backed by the given list. The list must contain
-        RGBA quadruplets or color names, which will be resolved first by
-        L{color_name_to_rgba()}. Anything that is understood by
-        L{color_name_to_rgba()} is OK here."""
-        Palette.__init__(self, len(l))
-        for idx, color in enumerate(l):
-            if isinstance(color, basestring):
-                color = color_name_to_rgba(color)
-            self._cache[idx] = color
-
-    def _get(self, v):
-        """This method will only be called if the requested color index is
-        outside the size of the palette. In that case, we throw an exception"""
-        raise ValueError("palette index outside bounds: %s" % v)
-
-
-class ClusterColoringPalette(PrecalculatedPalette):
-    """A palette suitable for coloring vertices when plotting a clustering.
-
-    This palette tries to make sure that the colors are easily distinguishable.
-    This is achieved by using a set of base colors and their lighter and darker
-    variants, depending on the number of elements in the palette.
-
-    When the desired size of the palette is less than or equal to the number of
-    base colors (denoted by M{n}), only the bsae colors will be used. When the
-    size of the palette is larger than M{n} but less than M{2*n}, the base colors
-    and their lighter variants will be used. Between M{2*n} and M{3*n}, the
-    base colors and their lighter and darker variants will be used. Above M{3*n},
-    more darker and lighter variants will be generated, but this makes the individual
-    colors less and less distinguishable.
-    """
-
-    def __init__(self, n):
-        base_colors = ["red", "green", "blue", "yellow", \
-                       "magenta", "cyan", "#808080"]
-        base_colors = [color_name_to_rgba(name) for name in base_colors]
-
-        num_base_colors = len(base_colors)
-        colors = base_colors[:]
-
-        blocks_to_add = ceil(float(n - num_base_colors) / num_base_colors)
-        ratio_increment = 1.0 / (ceil(blocks_to_add / 2.0) + 1)
-
-        adding_darker = True
-        ratio = ratio_increment
-        while len(colors) < n:
-            if adding_darker:
-                new_block = [darken(color, ratio) for color in base_colors]
-            else:
-                new_block = [lighten(color, ratio) for color in base_colors]
-                ratio += ratio_increment
-            colors.extend(new_block)
-            adding_darker = not adding_darker
-
-        colors = colors[0:n]
-        PrecalculatedPalette.__init__(self, colors)
-
-
-def clamp(value, min_value, max_value):
-    """Clamps the given value between min and max"""
-    if value > max_value:
-        return max_value
-    if value < min_value:
-        return min_value
-    return value
-
-def color_name_to_rgb(color, palette=None):
-    """Converts a color given in one of the supported color formats to
-    R-G-B values.
-
-    This is done by calling L{color_name_to_rgba} and then throwing away
-    the alpha value.
-
-    @see: color_name_to_rgba for more details about what formats are
-      understood by this function.
-    """
-    return color_name_to_rgba(color, palette)[:3]
-
-def color_name_to_rgba(color, palette=None):
-    """Converts a color given in one of the supported color formats to
-    R-G-B-A values.
-
-    Examples:
-
-      >>> color_name_to_rgba("red")
-      (1.0, 0.0, 0.0, 1.0)
-      >>> color_name_to_rgba("#ff8000") == (1.0, 128/255.0, 0.0, 1.0)
-      True
-      >>> color_name_to_rgba("#ff800080") == (1.0, 128/255.0, 0.0, 128/255.0)
-      True
-      >>> color_name_to_rgba("#08f") == (0.0, 136/255.0, 1.0, 1.0)
-      True
-      >>> color_name_to_rgba("rgb(100%, 50%, 0%)")
-      (1.0, 0.5, 0.0, 1.0)
-      >>> color_name_to_rgba("rgba(100%, 50%, 0%, 25%)")
-      (1.0, 0.5, 0.0, 0.25)
-      >>> color_name_to_rgba("hsla(120, 100%, 50%, 0.5)")
-      (0.0, 1.0, 0.0, 0.5)
-      >>> color_name_to_rgba("hsl(60, 100%, 50%)")
-      (1.0, 1.0, 0.0, 1.0)
-      >>> color_name_to_rgba("hsv(60, 100%, 100%)")
-      (1.0, 1.0, 0.0, 1.0)
-
-    @param color: the color to be converted in one of the following formats:
-      - B{CSS3 color specification}: C{#rrggbb}, C{#rgb}, C{#rrggbbaa}, C{#rgba},
-        C{rgb(red, green, blue)}, C{rgba(red, green, blue, alpha)},
-        C{hsl(hue, saturation, lightness)}, C{hsla(hue, saturation, lightness, alpha)},
-        C{hsv(hue, saturation, value)} and C{hsva(hue, saturation, value, alpha)}
-        where the components are given as hexadecimal numbers in the first four
-        cases and as decimals or percentages (0%-100%) in the remaining cases.
-        Red, green and blue components are between 0 and 255; hue is between 0
-        and 360; saturation, lightness and value is between 0 and 100; alpha is
-        between 0 and 1.
-      - B{Valid HTML color names}, i.e. those that are present in the HTML 4.0
-        specification
-      - B{Valid X11 color names}, see U{http://en.wikipedia.org/wiki/X11_color_names}
-      - B{Red-green-blue components} given separately in either a comma-, slash- or
-        whitespace-separated string or a list or a tuple, in the range of 0-255.
-        An alpha value of 255 (maximal opacity) will be assumed.
-      - B{Red-green-blue-alpha components} given separately in either a comma-, slash-
-        or whitespace-separated string or a list or a tuple, in the range of 0-255
-      - B{A single palette index} given either as a string or a number. Uses
-        the palette given in the C{palette} parameter of the method call.
-    @param palette: the palette to be used if a single number is passed to
-      the method. Must be an instance of L{colors.Palette}.
-
-    @return: the RGBA values corresponding to the given color in a 4-tuple.
-      Since these colors are primarily used by Cairo routines, the tuples
-      contain floats in the range 0.0-1.0
-    """
-    if not isinstance(color, basestring):
-        if hasattr(color, "__iter__"):
-            components = list(color)
-        else:
-            # A single index is given as a number
-            try:
-                components = palette.get(color)
-            except AttributeError:
-                raise ValueError("palette index used when no palette was given")
-        if len(components) < 4:
-            components += [1.] * (4 - len(components))
-    else:
-        if color[0] == '#':
-            color = color[1:]
-            if len(color) == 3:
-                components = [int(i, 16) * 17. / 255. for i in color]
-                components.append(1.0)
-            elif len(color) == 4:
-                components = [int(i, 16) * 17. / 255. for i in color]
-            elif len(color) == 6:
-                components = [int(color[i:i+2], 16) / 255. for i in (0, 2, 4)]
-                components.append(1.0)
-            elif len(color) == 8:
-                components = [int(color[i:i+2], 16) / 255. for i in (0, 2, 4, 6)]
-        else:
-            color_mode = "rgba"
-            maximums = (255.0, 255.0, 255.0, 1.0)
-            for mode in ["rgb(", "rgba(", "hsv(", "hsva(", "hsl(", "hsla("]:
-                if color.startswith(mode) and color[-1] == ")":
-                    color = color[len(mode):-1]
-                    color_mode = mode[:-1]
-                    if mode[0] == "h":
-                        maximums = (360.0, 100.0, 100.0, 1.0)
-                    break
-
-            if " " in color or "/" in color or "," in color:
-                color = color.replace(",", " ").replace("/", " ")
-                components = color.split()
-                for idx, comp in enumerate(components):
-                    if comp[-1] == "%":
-                        components[idx] = float(comp[:-1])/100.
-                    else:
-                        components[idx] = float(comp)/maximums[idx]
-                if len(components) < 4:
-                    components += [1.] * (4 - len(components))
-                if color_mode[:3] == "hsv":
-                    components = hsva_to_rgba(*components)
-                elif color_mode[:3] == "hsl":
-                    components = hsla_to_rgba(*components)
-            else:
-                try:
-                    components = palette.get(int(color))
-                except (ValueError, AttributeError):
-                    components = known_colors[color.lower()]
-
-    # At this point, the components are floats
-    return tuple(clamp(val, 0., 1.) for val in components)
-
-def color_to_html_format(color):
-    """Formats a color given as a 3-tuple or 4-tuple in HTML format.
-
-    The HTML format is simply given by C{#rrggbbaa}, where C{rr} gives
-    the red component in hexadecimal format, C{gg} gives the green
-    component C{bb} gives the blue component and C{gg} gives the
-    alpha level. The alpha level is optional.
-    """
-    color = [int(clamp(component * 256, 0, 255)) for component in color]
-    if len(color) == 4:
-        return "#{0:02X}{1:02X}{2:02X}{3:02X}".format(*color)
-    return "#{0:02X}{1:02X}{2:02X}".format(*color)
-
-def darken(color, ratio=0.5):
-    """Creates a darker version of a color given by an RGB triplet.
-    
-    This is done by mixing the original color with black using the given
-    ratio. A ratio of 1.0 will yield a completely black color, a ratio
-    of 0.0 will yield the original color. The alpha values are left intact.
-    """
-    ratio = 1.0 - ratio
-    red, green, blue, alpha = color
-    return (red * ratio, green * ratio, blue * ratio, alpha)
-
-def hsla_to_rgba(h, s, l, alpha = 1.0):
-    """Converts a color given by its HSLA coordinates (hue, saturation,
-    lightness, alpha) to RGBA coordinates.
-
-    Each of the HSLA coordinates must be in the range [0, 1].
-    """
-    # This is based on the formulae found at:
-    # http://en.wikipedia.org/wiki/HSL_and_HSV
-    c = s*(1 - 2*abs(l - 0.5))
-    h1 = (h*6) % 6
-    x = c*(1 - abs(h1 % 2 - 1))
-    m = l - c/2.
-    h1 = int(h1)
-    if h1 < 3:
-        if h1 < 1:
-            return (c+m, x+m, m, alpha)
-        elif h1 < 2:
-            return (x+m, c+m, m, alpha)
-        else:
-            return (m, c+m, x+m, alpha)
-    else:
-        if h1 < 4:
-            return (m, x+m, c+m, alpha)
-        elif h1 < 5:
-            return (x+m, m, c+m, alpha)
-        else:
-            return (c+m, m, x+m, alpha)
-
-def hsl_to_rgb(h, s, l):
-    """Converts a color given by its HSL coordinates (hue, saturation,
-    lightness) to RGB coordinates.
-
-    Each of the HSL coordinates must be in the range [0, 1].
-    """
-    return hsla_to_rgba(h, s, l)[:3]
-
-def hsva_to_rgba(h, s, v, alpha = 1.0):
-    """Converts a color given by its HSVA coordinates (hue, saturation,
-    value, alpha) to RGB coordinates.
-
-    Each of the HSVA coordinates must be in the range [0, 1].
-    """
-    # This is based on the formulae found at:
-    # http://en.wikipedia.org/wiki/HSL_and_HSV
-    c = v*s
-    h1 = (h*6) % 6
-    x = c*(1 - abs(h1 % 2 - 1))
-    m = v-c
-    h1 = int(h1)
-    if h1 < 3:
-        if h1 < 1:
-            return (c+m, x+m, m, alpha)
-        elif h1 < 2:
-            return (x+m, c+m, m, alpha)
-        else:
-            return (m, c+m, x+m, alpha)
-    else:
-        if h1 < 4:
-            return (m, x+m, c+m, alpha)
-        elif h1 < 5:
-            return (x+m, m, c+m, alpha)
-        else:
-            return (c+m, m, x+m, alpha)
-
-def hsv_to_rgb(h, s, v):
-    """Converts a color given by its HSV coordinates (hue, saturation,
-    value) to RGB coordinates.
-
-    Each of the HSV coordinates must be in the range [0, 1].
-    """
-    return hsva_to_rgba(h, s, v)[:3]
-
-def rgba_to_hsla(r, g, b, alpha=1.0):
-    """Converts a color given by its RGBA coordinates to HSLA coordinates
-    (hue, saturation, lightness, alpha).
-
-    Each of the RGBA coordinates must be in the range [0, 1].
-    """
-    alpha = float(alpha)
-    rgb_min, rgb_max = float(min(r, g, b)), float(max(r, g, b))
-
-    if rgb_min == rgb_max:
-        return 0.0, 0.0, rgb_min, alpha
-
-    lightness = (rgb_min + rgb_max) / 2.0
-    d = rgb_max - rgb_min
-    if lightness > 0.5:
-        sat = d / (2 - rgb_max - rgb_min)
-    else:
-        sat = d / (rgb_max + rgb_min)
-
-    d *= 6.0
-    if rgb_max == r:
-        hue = (g - b) / d
-        if g < b:
-            hue += 1
-    elif rgb_max == g:
-        hue = 1/3.0 + (b - r) / d
-    else:
-        hue = 2/3.0 + (r - g) / d
-    return hue, sat, lightness, alpha
-
-def rgba_to_hsva(r, g, b, alpha=1.0):
-    """Converts a color given by its RGBA coordinates to HSVA coordinates
-    (hue, saturation, value, alpha).
-
-    Each of the RGBA coordinates must be in the range [0, 1].
-    """
-    # This is based on the formulae found at:
-    # http://en.literateprograms.org/RGB_to_HSV_color_space_conversion_(C)
-    rgb_min, rgb_max = float(min(r, g, b)), float(max(r, g, b))
-    alpha = float(alpha)
-    value = float(rgb_max)
-    if value <= 0:
-        return 0.0, 0.0, 0.0, alpha
-    sat = 1.0 - rgb_min / value
-    if sat <= 0:
-        return 0.0, 0.0, value, alpha
-    d = rgb_max - rgb_min
-    r = (r - rgb_min) / d
-    g = (g - rgb_min) / d
-    b = (b - rgb_min) / d
-    rgb_max = max(r, g, b)
-    if rgb_max == r:
-        hue = 0.0 + (g - b) / 6.0
-        if hue < 0:
-            hue += 1
-    elif rgb_max == g:
-        hue = 1/3.0 + (b - r) / 6.0
-    else:
-        hue = 2/3.0 + (r - g) / 6.0
-    return hue, sat, value, alpha
-
-def rgb_to_hsl(r, g, b):
-    """Converts a color given by its RGB coordinates to HSL coordinates
-    (hue, saturation, lightness).
-
-    Each of the RGB coordinates must be in the range [0, 1].
-    """
-    return rgba_to_hsla(r, g, b)[:3]
-
-def rgb_to_hsv(r, g, b):
-    """Converts a color given by its RGB coordinates to HSV coordinates
-    (hue, saturation, value).
-
-    Each of the RGB coordinates must be in the range [0, 1].
-    """
-    return rgba_to_hsva(r, g, b)[:3]
-
-def lighten(color, ratio=0.5):
-    """Creates a lighter version of a color given by an RGB triplet.
-    
-    This is done by mixing the original color with white using the given
-    ratio. A ratio of 1.0 will yield a completely white color, a ratio
-    of 0.0 will yield the original color.
-    """
-    red, green, blue, alpha = color
-    return (red + (1.0 - red) * ratio, green + (1.0 - green) * ratio,
-            blue + (1.0 - blue) * ratio, alpha)
-
-known_colors = \
-{   'alice blue': (0.94117647058823528, 0.97254901960784312, 1.0, 1.0),
-    'aliceblue': (0.94117647058823528, 0.97254901960784312, 1.0, 1.0),
-    'antique white': (   0.98039215686274506,
-                         0.92156862745098034,
-                         0.84313725490196079,
-                         1.0),
-    'antiquewhite': (   0.98039215686274506,
-                        0.92156862745098034,
-                        0.84313725490196079,
-                        1.0),
-    'antiquewhite1': (1.0, 0.93725490196078431, 0.85882352941176465, 1.0),
-    'antiquewhite2': (   0.93333333333333335,
-                         0.87450980392156863,
-                         0.80000000000000004,
-                         1.0),
-    'antiquewhite3': (   0.80392156862745101,
-                         0.75294117647058822,
-                         0.69019607843137254,
-                         1.0),
-    'antiquewhite4': (   0.54509803921568623,
-                         0.51372549019607838,
-                         0.47058823529411764,
-                         1.0),
-    'aqua': (0.0, 1.0, 1.0, 1.0),
-    'aquamarine': (0.49803921568627452, 1.0, 0.83137254901960789, 1.0),
-    'aquamarine1': (0.49803921568627452, 1.0, 0.83137254901960789, 1.0),
-    'aquamarine2': (   0.46274509803921571,
-                       0.93333333333333335,
-                       0.77647058823529413,
-                       1.0),
-    'aquamarine3': (   0.40000000000000002,
-                       0.80392156862745101,
-                       0.66666666666666663,
-                       1.0),
-    'aquamarine4': (   0.27058823529411763,
-                       0.54509803921568623,
-                       0.45490196078431372,
-                       1.0),
-    'azure': (0.94117647058823528, 1.0, 1.0, 1.0),
-    'azure1': (0.94117647058823528, 1.0, 1.0, 1.0),
-    'azure2': (   0.8784313725490196,
-                  0.93333333333333335,
-                  0.93333333333333335,
-                  1.0),
-    'azure3': (   0.75686274509803919,
-                  0.80392156862745101,
-                  0.80392156862745101,
-                  1.0),
-    'azure4': (   0.51372549019607838,
-                  0.54509803921568623,
-                  0.54509803921568623,
-                  1.0),
-    'beige': (   0.96078431372549022,
-                 0.96078431372549022,
-                 0.86274509803921573,
-                 1.0),
-    'bisque': (1.0, 0.89411764705882357, 0.7686274509803922, 1.0),
-    'bisque1': (1.0, 0.89411764705882357, 0.7686274509803922, 1.0),
-    'bisque2': (   0.93333333333333335,
-                   0.83529411764705885,
-                   0.71764705882352942,
-                   1.0),
-    'bisque3': (   0.80392156862745101,
-                   0.71764705882352942,
-                   0.61960784313725492,
-                   1.0),
-    'bisque4': (   0.54509803921568623,
-                   0.49019607843137253,
-                   0.41960784313725491,
-                   1.0),
-    'black': (0.0, 0.0, 0.0, 1.0),
-    'blanched almond': (1.0, 0.92156862745098034, 0.80392156862745101, 1.0),
-    'blanchedalmond': (1.0, 0.92156862745098034, 0.80392156862745101, 1.0),
-    'blue': (0.0, 0.0, 1.0, 1.0),
-    'blue violet': (   0.54117647058823526,
-                       0.16862745098039217,
-                       0.88627450980392153,
-                       1.0),
-    'blue1': (0.0, 0.0, 1.0, 1.0),
-    'blue2': (0.0, 0.0, 0.93333333333333335, 1.0),
-    'blue3': (0.0, 0.0, 0.80392156862745101, 1.0),
-    'blue4': (0.0, 0.0, 0.54509803921568623, 1.0),
-    'blueviolet': (   0.54117647058823526,
-                      0.16862745098039217,
-                      0.88627450980392153,
-                      1.0),
-    'brown': (   0.6470588235294118,
-                 0.16470588235294117,
-                 0.16470588235294117,
-                 1.0),
-    'brown1': (1.0, 0.25098039215686274, 0.25098039215686274, 1.0),
-    'brown2': (   0.93333333333333335,
-                  0.23137254901960785,
-                  0.23137254901960785,
-                  1.0),
-    'brown3': (   0.80392156862745101,
-                  0.20000000000000001,
-                  0.20000000000000001,
-                  1.0),
-    'brown4': (   0.54509803921568623,
-                  0.13725490196078433,
-                  0.13725490196078433,
-                  1.0),
-    'burlywood': (   0.87058823529411766,
-                     0.72156862745098038,
-                     0.52941176470588236,
-                     1.0),
-    'burlywood1': (1.0, 0.82745098039215681, 0.60784313725490191, 1.0),
-    'burlywood2': (   0.93333333333333335,
-                      0.77254901960784317,
-                      0.56862745098039214,
-                      1.0),
-    'burlywood3': (   0.80392156862745101,
-                      0.66666666666666663,
-                      0.49019607843137253,
-                      1.0),
-    'burlywood4': (   0.54509803921568623,
-                      0.45098039215686275,
-                      0.33333333333333331,
-                      1.0),
-    'cadet blue': (   0.37254901960784315,
-                      0.61960784313725492,
-                      0.62745098039215685,
-                      1.0),
-    'cadetblue': (   0.37254901960784315,
-                     0.61960784313725492,
-                     0.62745098039215685,
-                     1.0),
-    'cadetblue1': (0.59607843137254901, 0.96078431372549022, 1.0, 1.0),
-    'cadetblue2': (   0.55686274509803924,
-                      0.89803921568627454,
-                      0.93333333333333335,
-                      1.0),
-    'cadetblue3': (   0.47843137254901963,
-                      0.77254901960784317,
-                      0.80392156862745101,
-                      1.0),
-    'cadetblue4': (   0.32549019607843138,
-                      0.52549019607843139,
-                      0.54509803921568623,
-                      1.0),
-    'chartreuse': (0.49803921568627452, 1.0, 0.0, 1.0),
-    'chartreuse1': (0.49803921568627452, 1.0, 0.0, 1.0),
-    'chartreuse2': (0.46274509803921571, 0.93333333333333335, 0.0, 1.0),
-    'chartreuse3': (0.40000000000000002, 0.80392156862745101, 0.0, 1.0),
-    'chartreuse4': (0.27058823529411763, 0.54509803921568623, 0.0, 1.0),
-    'chocolate': (   0.82352941176470584,
-                     0.41176470588235292,
-                     0.11764705882352941,
-                     1.0),
-    'chocolate1': (1.0, 0.49803921568627452, 0.14117647058823529, 1.0),
-    'chocolate2': (   0.93333333333333335,
-                      0.46274509803921571,
-                      0.12941176470588237,
-                      1.0),
-    'chocolate3': (   0.80392156862745101,
-                      0.40000000000000002,
-                      0.11372549019607843,
-                      1.0),
-    'chocolate4': (   0.54509803921568623,
-                      0.27058823529411763,
-                      0.074509803921568626,
-                      1.0),
-    'coral': (1.0, 0.49803921568627452, 0.31372549019607843, 1.0),
-    'coral1': (1.0, 0.44705882352941179, 0.33725490196078434, 1.0),
-    'coral2': (   0.93333333333333335,
-                  0.41568627450980394,
-                  0.31372549019607843,
-                  1.0),
-    'coral3': (   0.80392156862745101,
-                  0.35686274509803922,
-                  0.27058823529411763,
-                  1.0),
-    'coral4': (   0.54509803921568623,
-                  0.24313725490196078,
-                  0.18431372549019609,
-                  1.0),
-    'cornflower blue': (   0.39215686274509803,
-                           0.58431372549019611,
-                           0.92941176470588238,
-                           1.0),
-    'cornflowerblue': (   0.39215686274509803,
-                          0.58431372549019611,
-                          0.92941176470588238,
-                          1.0),
-    'cornsilk': (1.0, 0.97254901960784312, 0.86274509803921573, 1.0),
-    'cornsilk1': (1.0, 0.97254901960784312, 0.86274509803921573, 1.0),
-    'cornsilk2': (   0.93333333333333335,
-                     0.90980392156862744,
-                     0.80392156862745101,
-                     1.0),
-    'cornsilk3': (   0.80392156862745101,
-                     0.78431372549019607,
-                     0.69411764705882351,
-                     1.0),
-    'cornsilk4': (   0.54509803921568623,
-                     0.53333333333333333,
-                     0.47058823529411764,
-                     1.0),
-    'cyan': (0.0, 1.0, 1.0, 1.0),
-    'cyan1': (0.0, 1.0, 1.0, 1.0),
-    'cyan2': (0.0, 0.93333333333333335, 0.93333333333333335, 1.0),
-    'cyan3': (0.0, 0.80392156862745101, 0.80392156862745101, 1.0),
-    'cyan4': (0.0, 0.54509803921568623, 0.54509803921568623, 1.0),
-    'dark blue': (0.0, 0.0, 0.54509803921568623, 1.0),
-    'dark cyan': (0.0, 0.54509803921568623, 0.54509803921568623, 1.0),
-    'dark goldenrod': (   0.72156862745098038,
-                          0.52549019607843139,
-                          0.043137254901960784,
-                          1.0),
-    'dark gray': (   0.66274509803921566,
-                     0.66274509803921566,
-                     0.66274509803921566,
-                     1.0),
-    'dark green': (0.0, 0.39215686274509803, 0.0, 1.0),
-    'dark grey': (   0.66274509803921566,
-                     0.66274509803921566,
-                     0.66274509803921566,
-                     1.0),
-    'dark khaki': (   0.74117647058823533,
-                      0.71764705882352942,
-                      0.41960784313725491,
-                      1.0),
-    'dark magenta': (0.54509803921568623, 0.0, 0.54509803921568623, 1.0),
-    'dark olive green': (   0.33333333333333331,
-                            0.41960784313725491,
-                            0.18431372549019609,
-                            1.0),
-    'dark orange': (1.0, 0.5490196078431373, 0.0, 1.0),
-    'dark orchid': (   0.59999999999999998,
-                       0.19607843137254902,
-                       0.80000000000000004,
-                       1.0),
-    'dark red': (0.54509803921568623, 0.0, 0.0, 1.0),
-    'dark salmon': (   0.9137254901960784,
-                       0.58823529411764708,
-                       0.47843137254901963,
-                       1.0),
-    'dark sea green': (   0.5607843137254902,
-                          0.73725490196078436,
-                          0.5607843137254902,
-                          1.0),
-    'dark slate blue': (   0.28235294117647058,
-                           0.23921568627450981,
-                           0.54509803921568623,
-                           1.0),
-    'dark slate gray': (   0.18431372549019609,
-                           0.30980392156862746,
-                           0.30980392156862746,
-                           1.0),
-    'dark slate grey': (   0.18431372549019609,
-                           0.30980392156862746,
-                           0.30980392156862746,
-                           1.0),
-    'dark turquoise': (0.0, 0.80784313725490198, 0.81960784313725488, 1.0),
-    'dark violet': (0.58039215686274515, 0.0, 0.82745098039215681, 1.0),
-    'darkblue': (0.0, 0.0, 0.54509803921568623, 1.0),
-    'darkcyan': (0.0, 0.54509803921568623, 0.54509803921568623, 1.0),
-    'darkgoldenrod': (   0.72156862745098038,
-                         0.52549019607843139,
-                         0.043137254901960784,
-                         1.0),
-    'darkgoldenrod1': (1.0, 0.72549019607843135, 0.058823529411764705, 1.0),
-    'darkgoldenrod2': (   0.93333333333333335,
-                          0.67843137254901964,
-                          0.054901960784313725,
-                          1.0),
-    'darkgoldenrod3': (   0.80392156862745101,
-                          0.58431372549019611,
-                          0.047058823529411764,
-                          1.0),
-    'darkgoldenrod4': (   0.54509803921568623,
-                          0.396078431372549,
-                          0.031372549019607843,
-                          1.0),
-    'darkgray': (   0.66274509803921566,
-                    0.66274509803921566,
-                    0.66274509803921566,
-                    1.0),
-    'darkgreen': (0.0, 0.39215686274509803, 0.0, 1.0),
-    'darkgrey': (   0.66274509803921566,
-                    0.66274509803921566,
-                    0.66274509803921566,
-                    1.0),
-    'darkkhaki': (   0.74117647058823533,
-                     0.71764705882352942,
-                     0.41960784313725491,
-                     1.0),
-    'darkmagenta': (0.54509803921568623, 0.0, 0.54509803921568623, 1.0),
-    'darkolivegreen': (   0.33333333333333331,
-                          0.41960784313725491,
-                          0.18431372549019609,
-                          1.0),
-    'darkolivegreen1': (0.792156862745098, 1.0, 0.4392156862745098, 1.0),
-    'darkolivegreen2': (   0.73725490196078436,
-                           0.93333333333333335,
-                           0.40784313725490196,
-                           1.0),
-    'darkolivegreen3': (   0.63529411764705879,
-                           0.80392156862745101,
-                           0.35294117647058826,
-                           1.0),
-    'darkolivegreen4': (   0.43137254901960786,
-                           0.54509803921568623,
-                           0.23921568627450981,
-                           1.0),
-    'darkorange': (1.0, 0.5490196078431373, 0.0, 1.0),
-    'darkorange1': (1.0, 0.49803921568627452, 0.0, 1.0),
-    'darkorange2': (0.93333333333333335, 0.46274509803921571, 0.0, 1.0),
-    'darkorange3': (0.80392156862745101, 0.40000000000000002, 0.0, 1.0),
-    'darkorange4': (0.54509803921568623, 0.27058823529411763, 0.0, 1.0),
-    'darkorchid': (   0.59999999999999998,
-                      0.19607843137254902,
-                      0.80000000000000004,
-                      1.0),
-    'darkorchid1': (0.74901960784313726, 0.24313725490196078, 1.0, 1.0),
-    'darkorchid2': (   0.69803921568627447,
-                       0.22745098039215686,
-                       0.93333333333333335,
-                       1.0),
-    'darkorchid3': (   0.60392156862745094,
-                       0.19607843137254902,
-                       0.80392156862745101,
-                       1.0),
-    'darkorchid4': (   0.40784313725490196,
-                       0.13333333333333333,
-                       0.54509803921568623,
-                       1.0),
-    'darkred': (0.54509803921568623, 0.0, 0.0, 1.0),
-    'darksalmon': (   0.9137254901960784,
-                      0.58823529411764708,
-                      0.47843137254901963,
-                      1.0),
-    'darkseagreen': (   0.5607843137254902,
-                        0.73725490196078436,
-                        0.5607843137254902,
-                        1.0),
-    'darkseagreen1': (0.75686274509803919, 1.0, 0.75686274509803919, 1.0),
-    'darkseagreen2': (   0.70588235294117652,
-                         0.93333333333333335,
-                         0.70588235294117652,
-                         1.0),
-    'darkseagreen3': (   0.60784313725490191,
-                         0.80392156862745101,
-                         0.60784313725490191,
-                         1.0),
-    'darkseagreen4': (   0.41176470588235292,
-                         0.54509803921568623,
-                         0.41176470588235292,
-                         1.0),
-    'darkslateblue': (   0.28235294117647058,
-                         0.23921568627450981,
-                         0.54509803921568623,
-                         1.0),
-    'darkslategray': (   0.18431372549019609,
-                         0.30980392156862746,
-                         0.30980392156862746,
-                         1.0),
-    'darkslategray1': (0.59215686274509804, 1.0, 1.0, 1.0),
-    'darkslategray2': (   0.55294117647058827,
-                          0.93333333333333335,
-                          0.93333333333333335,
-                          1.0),
-    'darkslategray3': (   0.47450980392156861,
-                          0.80392156862745101,
-                          0.80392156862745101,
-                          1.0),
-    'darkslategray4': (   0.32156862745098042,
-                          0.54509803921568623,
-                          0.54509803921568623,
-                          1.0),
-    'darkslategrey': (   0.18431372549019609,
-                         0.30980392156862746,
-                         0.30980392156862746,
-                         1.0),
-    'darkturquoise': (0.0, 0.80784313725490198, 0.81960784313725488, 1.0),
-    'darkviolet': (0.58039215686274515, 0.0, 0.82745098039215681, 1.0),
-    'deep pink': (1.0, 0.078431372549019607, 0.57647058823529407, 1.0),
-    'deep sky blue': (0.0, 0.74901960784313726, 1.0, 1.0),
-    'deeppink': (1.0, 0.078431372549019607, 0.57647058823529407, 1.0),
-    'deeppink1': (1.0, 0.078431372549019607, 0.57647058823529407, 1.0),
-    'deeppink2': (   0.93333333333333335,
-                     0.070588235294117646,
-                     0.53725490196078429,
-                     1.0),
-    'deeppink3': (   0.80392156862745101,
-                     0.062745098039215685,
-                     0.46274509803921571,
-                     1.0),
-    'deeppink4': (   0.54509803921568623,
-                     0.039215686274509803,
-                     0.31372549019607843,
-                     1.0),
-    'deepskyblue': (0.0, 0.74901960784313726, 1.0, 1.0),
-    'deepskyblue1': (0.0, 0.74901960784313726, 1.0, 1.0),
-    'deepskyblue2': (0.0, 0.69803921568627447, 0.93333333333333335, 1.0),
-    'deepskyblue3': (0.0, 0.60392156862745094, 0.80392156862745101, 1.0),
-    'deepskyblue4': (0.0, 0.40784313725490196, 0.54509803921568623, 1.0),
-    'dim gray': (   0.41176470588235292,
-                    0.41176470588235292,
-                    0.41176470588235292,
-                    1.0),
-    'dim grey': (   0.41176470588235292,
-                    0.41176470588235292,
-                    0.41176470588235292,
-                    1.0),
-    'dimgray': (   0.41176470588235292,
-                   0.41176470588235292,
-                   0.41176470588235292,
-                   1.0),
-    'dimgrey': (   0.41176470588235292,
-                   0.41176470588235292,
-                   0.41176470588235292,
-                   1.0),
-    'dodger blue': (0.11764705882352941, 0.56470588235294117, 1.0, 1.0),
-    'dodgerblue': (0.11764705882352941, 0.56470588235294117, 1.0, 1.0),
-    'dodgerblue1': (0.11764705882352941, 0.56470588235294117, 1.0, 1.0),
-    'dodgerblue2': (   0.10980392156862745,
-                       0.52549019607843139,
-                       0.93333333333333335,
-                       1.0),
-    'dodgerblue3': (   0.094117647058823528,
-                       0.45490196078431372,
-                       0.80392156862745101,
-                       1.0),
-    'dodgerblue4': (   0.062745098039215685,
-                       0.30588235294117649,
-                       0.54509803921568623,
-                       1.0),
-    'firebrick': (   0.69803921568627447,
-                     0.13333333333333333,
-                     0.13333333333333333,
-                     1.0),
-    'firebrick1': (1.0, 0.18823529411764706, 0.18823529411764706, 1.0),
-    'firebrick2': (   0.93333333333333335,
-                      0.17254901960784313,
-                      0.17254901960784313,
-                      1.0),
-    'firebrick3': (   0.80392156862745101,
-                      0.14901960784313725,
-                      0.14901960784313725,
-                      1.0),
-    'firebrick4': (   0.54509803921568623,
-                      0.10196078431372549,
-                      0.10196078431372549,
-                      1.0),
-    'floral white': (1.0, 0.98039215686274506, 0.94117647058823528, 1.0),
-    'floralwhite': (1.0, 0.98039215686274506, 0.94117647058823528, 1.0),
-    'forest green': (   0.13333333333333333,
-                        0.54509803921568623,
-                        0.13333333333333333,
-                        1.0),
-    'forestgreen': (   0.13333333333333333,
-                       0.54509803921568623,
-                       0.13333333333333333,
-                       1.0),
-    'fuchsia': (1.0, 0.0, 1.0, 1.0),
-    'gainsboro': (   0.86274509803921573,
-                     0.86274509803921573,
-                     0.86274509803921573,
-                     1.0),
-    'ghost white': (0.97254901960784312, 0.97254901960784312, 1.0, 1.0),
-    'ghostwhite': (0.97254901960784312, 0.97254901960784312, 1.0, 1.0),
-    'gold': (1.0, 0.84313725490196079, 0.0, 1.0),
-    'gold1': (1.0, 0.84313725490196079, 0.0, 1.0),
-    'gold2': (0.93333333333333335, 0.78823529411764703, 0.0, 1.0),
-    'gold3': (0.80392156862745101, 0.67843137254901964, 0.0, 1.0),
-    'gold4': (0.54509803921568623, 0.45882352941176469, 0.0, 1.0),
-    'goldenrod': (   0.85490196078431369,
-                     0.6470588235294118,
-                     0.12549019607843137,
-                     1.0),
-    'goldenrod1': (1.0, 0.75686274509803919, 0.14509803921568629, 1.0),
-    'goldenrod2': (   0.93333333333333335,
-                      0.70588235294117652,
-                      0.13333333333333333,
-                      1.0),
-    'goldenrod3': (   0.80392156862745101,
-                      0.60784313725490191,
-                      0.11372549019607843,
-                      1.0),
-    'goldenrod4': (   0.54509803921568623,
-                      0.41176470588235292,
-                      0.078431372549019607,
-                      1.0),
-    'gray': (   0.74509803921568629,
-                0.74509803921568629,
-                0.74509803921568629,
-                1.0),
-    'gray0': (0.0, 0.0, 0.0, 1.0),
-    'gray1': (   0.011764705882352941,
-                 0.011764705882352941,
-                 0.011764705882352941,
-                 1.0),
-    'gray10': (   0.10196078431372549,
-                  0.10196078431372549,
-                  0.10196078431372549,
-                  1.0),
-    'gray100': (1.0, 1.0, 1.0, 1.0),
-    'gray11': (   0.10980392156862745,
-                  0.10980392156862745,
-                  0.10980392156862745,
-                  1.0),
-    'gray12': (   0.12156862745098039,
-                  0.12156862745098039,
-                  0.12156862745098039,
-                  1.0),
-    'gray13': (   0.12941176470588237,
-                  0.12941176470588237,
-                  0.12941176470588237,
-                  1.0),
-    'gray14': (   0.14117647058823529,
-                  0.14117647058823529,
-                  0.14117647058823529,
-                  1.0),
-    'gray15': (   0.14901960784313725,
-                  0.14901960784313725,
-                  0.14901960784313725,
-                  1.0),
-    'gray16': (   0.16078431372549021,
-                  0.16078431372549021,
-                  0.16078431372549021,
-                  1.0),
-    'gray17': (   0.16862745098039217,
-                  0.16862745098039217,
-                  0.16862745098039217,
-                  1.0),
-    'gray18': (   0.1803921568627451,
-                  0.1803921568627451,
-                  0.1803921568627451,
-                  1.0),
-    'gray19': (   0.18823529411764706,
-                  0.18823529411764706,
-                  0.18823529411764706,
-                  1.0),
-    'gray2': (   0.019607843137254902,
-                 0.019607843137254902,
-                 0.019607843137254902,
-                 1.0),
-    'gray20': (   0.20000000000000001,
-                  0.20000000000000001,
-                  0.20000000000000001,
-                  1.0),
-    'gray21': (   0.21176470588235294,
-                  0.21176470588235294,
-                  0.21176470588235294,
-                  1.0),
-    'gray22': (   0.2196078431372549,
-                  0.2196078431372549,
-                  0.2196078431372549,
-                  1.0),
-    'gray23': (   0.23137254901960785,
-                  0.23137254901960785,
-                  0.23137254901960785,
-                  1.0),
-    'gray24': (   0.23921568627450981,
-                  0.23921568627450981,
-                  0.23921568627450981,
-                  1.0),
-    'gray25': (   0.25098039215686274,
-                  0.25098039215686274,
-                  0.25098039215686274,
-                  1.0),
-    'gray26': (   0.25882352941176473,
-                  0.25882352941176473,
-                  0.25882352941176473,
-                  1.0),
-    'gray27': (   0.27058823529411763,
-                  0.27058823529411763,
-                  0.27058823529411763,
-                  1.0),
-    'gray28': (   0.27843137254901962,
-                  0.27843137254901962,
-                  0.27843137254901962,
-                  1.0),
-    'gray29': (   0.29019607843137257,
-                  0.29019607843137257,
-                  0.29019607843137257,
-                  1.0),
-    'gray3': (   0.031372549019607843,
-                 0.031372549019607843,
-                 0.031372549019607843,
-                 1.0),
-    'gray30': (   0.30196078431372547,
-                  0.30196078431372547,
-                  0.30196078431372547,
-                  1.0),
-    'gray31': (   0.30980392156862746,
-                  0.30980392156862746,
-                  0.30980392156862746,
-                  1.0),
-    'gray32': (   0.32156862745098042,
-                  0.32156862745098042,
-                  0.32156862745098042,
-                  1.0),
-    'gray33': (   0.32941176470588235,
-                  0.32941176470588235,
-                  0.32941176470588235,
-                  1.0),
-    'gray34': (   0.3411764705882353,
-                  0.3411764705882353,
-                  0.3411764705882353,
-                  1.0),
-    'gray35': (   0.34901960784313724,
-                  0.34901960784313724,
-                  0.34901960784313724,
-                  1.0),
-    'gray36': (   0.36078431372549019,
-                  0.36078431372549019,
-                  0.36078431372549019,
-                  1.0),
-    'gray37': (   0.36862745098039218,
-                  0.36862745098039218,
-                  0.36862745098039218,
-                  1.0),
-    'gray38': (   0.38039215686274508,
-                  0.38039215686274508,
-                  0.38039215686274508,
-                  1.0),
-    'gray39': (   0.38823529411764707,
-                  0.38823529411764707,
-                  0.38823529411764707,
-                  1.0),
-    'gray4': (   0.039215686274509803,
-                 0.039215686274509803,
-                 0.039215686274509803,
-                 1.0),
-    'gray40': (   0.40000000000000002,
-                  0.40000000000000002,
-                  0.40000000000000002,
-                  1.0),
-    'gray41': (   0.41176470588235292,
-                  0.41176470588235292,
-                  0.41176470588235292,
-                  1.0),
-    'gray42': (   0.41960784313725491,
-                  0.41960784313725491,
-                  0.41960784313725491,
-                  1.0),
-    'gray43': (   0.43137254901960786,
-                  0.43137254901960786,
-                  0.43137254901960786,
-                  1.0),
-    'gray44': (   0.4392156862745098,
-                  0.4392156862745098,
-                  0.4392156862745098,
-                  1.0),
-    'gray45': (   0.45098039215686275,
-                  0.45098039215686275,
-                  0.45098039215686275,
-                  1.0),
-    'gray46': (   0.45882352941176469,
-                  0.45882352941176469,
-                  0.45882352941176469,
-                  1.0),
-    'gray47': (   0.47058823529411764,
-                  0.47058823529411764,
-                  0.47058823529411764,
-                  1.0),
-    'gray48': (   0.47843137254901963,
-                  0.47843137254901963,
-                  0.47843137254901963,
-                  1.0),
-    'gray49': (   0.49019607843137253,
-                  0.49019607843137253,
-                  0.49019607843137253,
-                  1.0),
-    'gray5': (   0.050980392156862744,
-                 0.050980392156862744,
-                 0.050980392156862744,
-                 1.0),
-    'gray50': (   0.49803921568627452,
-                  0.49803921568627452,
-                  0.49803921568627452,
-                  1.0),
-    'gray51': (   0.50980392156862742,
-                  0.50980392156862742,
-                  0.50980392156862742,
-                  1.0),
-    'gray52': (   0.52156862745098043,
-                  0.52156862745098043,
-                  0.52156862745098043,
-                  1.0),
-    'gray53': (   0.52941176470588236,
-                  0.52941176470588236,
-                  0.52941176470588236,
-                  1.0),
-    'gray54': (   0.54117647058823526,
-                  0.54117647058823526,
-                  0.54117647058823526,
-                  1.0),
-    'gray55': (   0.5490196078431373,
-                  0.5490196078431373,
-                  0.5490196078431373,
-                  1.0),
-    'gray56': (   0.5607843137254902,
-                  0.5607843137254902,
-                  0.5607843137254902,
-                  1.0),
-    'gray57': (   0.56862745098039214,
-                  0.56862745098039214,
-                  0.56862745098039214,
-                  1.0),
-    'gray58': (   0.58039215686274515,
-                  0.58039215686274515,
-                  0.58039215686274515,
-                  1.0),
-    'gray59': (   0.58823529411764708,
-                  0.58823529411764708,
-                  0.58823529411764708,
-                  1.0),
-    'gray6': (   0.058823529411764705,
-                 0.058823529411764705,
-                 0.058823529411764705,
-                 1.0),
-    'gray60': (   0.59999999999999998,
-                  0.59999999999999998,
-                  0.59999999999999998,
-                  1.0),
-    'gray61': (   0.61176470588235299,
-                  0.61176470588235299,
-                  0.61176470588235299,
-                  1.0),
-    'gray62': (   0.61960784313725492,
-                  0.61960784313725492,
-                  0.61960784313725492,
-                  1.0),
-    'gray63': (   0.63137254901960782,
-                  0.63137254901960782,
-                  0.63137254901960782,
-                  1.0),
-    'gray64': (   0.63921568627450975,
-                  0.63921568627450975,
-                  0.63921568627450975,
-                  1.0),
-    'gray65': (   0.65098039215686276,
-                  0.65098039215686276,
-                  0.65098039215686276,
-                  1.0),
-    'gray66': (   0.6588235294117647,
-                  0.6588235294117647,
-                  0.6588235294117647,
-                  1.0),
-    'gray67': (   0.6705882352941176,
-                  0.6705882352941176,
-                  0.6705882352941176,
-                  1.0),
-    'gray68': (   0.67843137254901964,
-                  0.67843137254901964,
-                  0.67843137254901964,
-                  1.0),
-    'gray69': (   0.69019607843137254,
-                  0.69019607843137254,
-                  0.69019607843137254,
-                  1.0),
-    'gray7': (   0.070588235294117646,
-                 0.070588235294117646,
-                 0.070588235294117646,
-                 1.0),
-    'gray70': (   0.70196078431372544,
-                  0.70196078431372544,
-                  0.70196078431372544,
-                  1.0),
-    'gray71': (   0.70980392156862748,
-                  0.70980392156862748,
-                  0.70980392156862748,
-                  1.0),
-    'gray72': (   0.72156862745098038,
-                  0.72156862745098038,
-                  0.72156862745098038,
-                  1.0),
-    'gray73': (   0.72941176470588232,
-                  0.72941176470588232,
-                  0.72941176470588232,
-                  1.0),
-    'gray74': (   0.74117647058823533,
-                  0.74117647058823533,
-                  0.74117647058823533,
-                  1.0),
-    'gray75': (   0.74901960784313726,
-                  0.74901960784313726,
-                  0.74901960784313726,
-                  1.0),
-    'gray76': (   0.76078431372549016,
-                  0.76078431372549016,
-                  0.76078431372549016,
-                  1.0),
-    'gray77': (   0.7686274509803922,
-                  0.7686274509803922,
-                  0.7686274509803922,
-                  1.0),
-    'gray78': (   0.7803921568627451,
-                  0.7803921568627451,
-                  0.7803921568627451,
-                  1.0),
-    'gray79': (   0.78823529411764703,
-                  0.78823529411764703,
-                  0.78823529411764703,
-                  1.0),
-    'gray8': (   0.078431372549019607,
-                 0.078431372549019607,
-                 0.078431372549019607,
-                 1.0),
-    'gray80': (   0.80000000000000004,
-                  0.80000000000000004,
-                  0.80000000000000004,
-                  1.0),
-    'gray81': (   0.81176470588235294,
-                  0.81176470588235294,
-                  0.81176470588235294,
-                  1.0),
-    'gray82': (   0.81960784313725488,
-                  0.81960784313725488,
-                  0.81960784313725488,
-                  1.0),
-    'gray83': (   0.83137254901960789,
-                  0.83137254901960789,
-                  0.83137254901960789,
-                  1.0),
-    'gray84': (   0.83921568627450982,
-                  0.83921568627450982,
-                  0.83921568627450982,
-                  1.0),
-    'gray85': (   0.85098039215686272,
-                  0.85098039215686272,
-                  0.85098039215686272,
-                  1.0),
-    'gray86': (   0.85882352941176465,
-                  0.85882352941176465,
-                  0.85882352941176465,
-                  1.0),
-    'gray87': (   0.87058823529411766,
-                  0.87058823529411766,
-                  0.87058823529411766,
-                  1.0),
-    'gray88': (   0.8784313725490196,
-                  0.8784313725490196,
-                  0.8784313725490196,
-                  1.0),
-    'gray89': (   0.8901960784313725,
-                  0.8901960784313725,
-                  0.8901960784313725,
-                  1.0),
-    'gray9': (   0.090196078431372548,
-                 0.090196078431372548,
-                 0.090196078431372548,
-                 1.0),
-    'gray90': (   0.89803921568627454,
-                  0.89803921568627454,
-                  0.89803921568627454,
-                  1.0),
-    'gray91': (   0.90980392156862744,
-                  0.90980392156862744,
-                  0.90980392156862744,
-                  1.0),
-    'gray92': (   0.92156862745098034,
-                  0.92156862745098034,
-                  0.92156862745098034,
-                  1.0),
-    'gray93': (   0.92941176470588238,
-                  0.92941176470588238,
-                  0.92941176470588238,
-                  1.0),
-    'gray94': (   0.94117647058823528,
-                  0.94117647058823528,
-                  0.94117647058823528,
-                  1.0),
-    'gray95': (   0.94901960784313721,
-                  0.94901960784313721,
-                  0.94901960784313721,
-                  1.0),
-    'gray96': (   0.96078431372549022,
-                  0.96078431372549022,
-                  0.96078431372549022,
-                  1.0),
-    'gray97': (   0.96862745098039216,
-                  0.96862745098039216,
-                  0.96862745098039216,
-                  1.0),
-    'gray98': (   0.98039215686274506,
-                  0.98039215686274506,
-                  0.98039215686274506,
-                  1.0),
-    'gray99': (   0.9882352941176471,
-                  0.9882352941176471,
-                  0.9882352941176471,
-                  1.0),
-    'green': (0.0, 1.0, 0.0, 1.0),
-    'green yellow': (0.67843137254901964, 1.0, 0.18431372549019609, 1.0),
-    'green1': (0.0, 1.0, 0.0, 1.0),
-    'green2': (0.0, 0.93333333333333335, 0.0, 1.0),
-    'green3': (0.0, 0.80392156862745101, 0.0, 1.0),
-    'green4': (0.0, 0.54509803921568623, 0.0, 1.0),
-    'greenyellow': (0.67843137254901964, 1.0, 0.18431372549019609, 1.0),
-    'grey': (   0.74509803921568629,
-                0.74509803921568629,
-                0.74509803921568629,
-                1.0),
-    'grey0': (0.0, 0.0, 0.0, 1.0),
-    'grey1': (   0.011764705882352941,
-                 0.011764705882352941,
-                 0.011764705882352941,
-                 1.0),
-    'grey10': (   0.10196078431372549,
-                  0.10196078431372549,
-                  0.10196078431372549,
-                  1.0),
-    'grey100': (1.0, 1.0, 1.0, 1.0),
-    'grey11': (   0.10980392156862745,
-                  0.10980392156862745,
-                  0.10980392156862745,
-                  1.0),
-    'grey12': (   0.12156862745098039,
-                  0.12156862745098039,
-                  0.12156862745098039,
-                  1.0),
-    'grey13': (   0.12941176470588237,
-                  0.12941176470588237,
-                  0.12941176470588237,
-                  1.0),
-    'grey14': (   0.14117647058823529,
-                  0.14117647058823529,
-                  0.14117647058823529,
-                  1.0),
-    'grey15': (   0.14901960784313725,
-                  0.14901960784313725,
-                  0.14901960784313725,
-                  1.0),
-    'grey16': (   0.16078431372549021,
-                  0.16078431372549021,
-                  0.16078431372549021,
-                  1.0),
-    'grey17': (   0.16862745098039217,
-                  0.16862745098039217,
-                  0.16862745098039217,
-                  1.0),
-    'grey18': (   0.1803921568627451,
-                  0.1803921568627451,
-                  0.1803921568627451,
-                  1.0),
-    'grey19': (   0.18823529411764706,
-                  0.18823529411764706,
-                  0.18823529411764706,
-                  1.0),
-    'grey2': (   0.019607843137254902,
-                 0.019607843137254902,
-                 0.019607843137254902,
-                 1.0),
-    'grey20': (   0.20000000000000001,
-                  0.20000000000000001,
-                  0.20000000000000001,
-                  1.0),
-    'grey21': (   0.21176470588235294,
-                  0.21176470588235294,
-                  0.21176470588235294,
-                  1.0),
-    'grey22': (   0.2196078431372549,
-                  0.2196078431372549,
-                  0.2196078431372549,
-                  1.0),
-    'grey23': (   0.23137254901960785,
-                  0.23137254901960785,
-                  0.23137254901960785,
-                  1.0),
-    'grey24': (   0.23921568627450981,
-                  0.23921568627450981,
-                  0.23921568627450981,
-                  1.0),
-    'grey25': (   0.25098039215686274,
-                  0.25098039215686274,
-                  0.25098039215686274,
-                  1.0),
-    'grey26': (   0.25882352941176473,
-                  0.25882352941176473,
-                  0.25882352941176473,
-                  1.0),
-    'grey27': (   0.27058823529411763,
-                  0.27058823529411763,
-                  0.27058823529411763,
-                  1.0),
-    'grey28': (   0.27843137254901962,
-                  0.27843137254901962,
-                  0.27843137254901962,
-                  1.0),
-    'grey29': (   0.29019607843137257,
-                  0.29019607843137257,
-                  0.29019607843137257,
-                  1.0),
-    'grey3': (   0.031372549019607843,
-                 0.031372549019607843,
-                 0.031372549019607843,
-                 1.0),
-    'grey30': (   0.30196078431372547,
-                  0.30196078431372547,
-                  0.30196078431372547,
-                  1.0),
-    'grey31': (   0.30980392156862746,
-                  0.30980392156862746,
-                  0.30980392156862746,
-                  1.0),
-    'grey32': (   0.32156862745098042,
-                  0.32156862745098042,
-                  0.32156862745098042,
-                  1.0),
-    'grey33': (   0.32941176470588235,
-                  0.32941176470588235,
-                  0.32941176470588235,
-                  1.0),
-    'grey34': (   0.3411764705882353,
-                  0.3411764705882353,
-                  0.3411764705882353,
-                  1.0),
-    'grey35': (   0.34901960784313724,
-                  0.34901960784313724,
-                  0.34901960784313724,
-                  1.0),
-    'grey36': (   0.36078431372549019,
-                  0.36078431372549019,
-                  0.36078431372549019,
-                  1.0),
-    'grey37': (   0.36862745098039218,
-                  0.36862745098039218,
-                  0.36862745098039218,
-                  1.0),
-    'grey38': (   0.38039215686274508,
-                  0.38039215686274508,
-                  0.38039215686274508,
-                  1.0),
-    'grey39': (   0.38823529411764707,
-                  0.38823529411764707,
-                  0.38823529411764707,
-                  1.0),
-    'grey4': (   0.039215686274509803,
-                 0.039215686274509803,
-                 0.039215686274509803,
-                 1.0),
-    'grey40': (   0.40000000000000002,
-                  0.40000000000000002,
-                  0.40000000000000002,
-                  1.0),
-    'grey41': (   0.41176470588235292,
-                  0.41176470588235292,
-                  0.41176470588235292,
-                  1.0),
-    'grey42': (   0.41960784313725491,
-                  0.41960784313725491,
-                  0.41960784313725491,
-                  1.0),
-    'grey43': (   0.43137254901960786,
-                  0.43137254901960786,
-                  0.43137254901960786,
-                  1.0),
-    'grey44': (   0.4392156862745098,
-                  0.4392156862745098,
-                  0.4392156862745098,
-                  1.0),
-    'grey45': (   0.45098039215686275,
-                  0.45098039215686275,
-                  0.45098039215686275,
-                  1.0),
-    'grey46': (   0.45882352941176469,
-                  0.45882352941176469,
-                  0.45882352941176469,
-                  1.0),
-    'grey47': (   0.47058823529411764,
-                  0.47058823529411764,
-                  0.47058823529411764,
-                  1.0),
-    'grey48': (   0.47843137254901963,
-                  0.47843137254901963,
-                  0.47843137254901963,
-                  1.0),
-    'grey49': (   0.49019607843137253,
-                  0.49019607843137253,
-                  0.49019607843137253,
-                  1.0),
-    'grey5': (   0.050980392156862744,
-                 0.050980392156862744,
-                 0.050980392156862744,
-                 1.0),
-    'grey50': (   0.49803921568627452,
-                  0.49803921568627452,
-                  0.49803921568627452,
-                  1.0),
-    'grey51': (   0.50980392156862742,
-                  0.50980392156862742,
-                  0.50980392156862742,
-                  1.0),
-    'grey52': (   0.52156862745098043,
-                  0.52156862745098043,
-                  0.52156862745098043,
-                  1.0),
-    'grey53': (   0.52941176470588236,
-                  0.52941176470588236,
-                  0.52941176470588236,
-                  1.0),
-    'grey54': (   0.54117647058823526,
-                  0.54117647058823526,
-                  0.54117647058823526,
-                  1.0),
-    'grey55': (   0.5490196078431373,
-                  0.5490196078431373,
-                  0.5490196078431373,
-                  1.0),
-    'grey56': (   0.5607843137254902,
-                  0.5607843137254902,
-                  0.5607843137254902,
-                  1.0),
-    'grey57': (   0.56862745098039214,
-                  0.56862745098039214,
-                  0.56862745098039214,
-                  1.0),
-    'grey58': (   0.58039215686274515,
-                  0.58039215686274515,
-                  0.58039215686274515,
-                  1.0),
-    'grey59': (   0.58823529411764708,
-                  0.58823529411764708,
-                  0.58823529411764708,
-                  1.0),
-    'grey6': (   0.058823529411764705,
-                 0.058823529411764705,
-                 0.058823529411764705,
-                 1.0),
-    'grey60': (   0.59999999999999998,
-                  0.59999999999999998,
-                  0.59999999999999998,
-                  1.0),
-    'grey61': (   0.61176470588235299,
-                  0.61176470588235299,
-                  0.61176470588235299,
-                  1.0),
-    'grey62': (   0.61960784313725492,
-                  0.61960784313725492,
-                  0.61960784313725492,
-                  1.0),
-    'grey63': (   0.63137254901960782,
-                  0.63137254901960782,
-                  0.63137254901960782,
-                  1.0),
-    'grey64': (   0.63921568627450975,
-                  0.63921568627450975,
-                  0.63921568627450975,
-                  1.0),
-    'grey65': (   0.65098039215686276,
-                  0.65098039215686276,
-                  0.65098039215686276,
-                  1.0),
-    'grey66': (   0.6588235294117647,
-                  0.6588235294117647,
-                  0.6588235294117647,
-                  1.0),
-    'grey67': (   0.6705882352941176,
-                  0.6705882352941176,
-                  0.6705882352941176,
-                  1.0),
-    'grey68': (   0.67843137254901964,
-                  0.67843137254901964,
-                  0.67843137254901964,
-                  1.0),
-    'grey69': (   0.69019607843137254,
-                  0.69019607843137254,
-                  0.69019607843137254,
-                  1.0),
-    'grey7': (   0.070588235294117646,
-                 0.070588235294117646,
-                 0.070588235294117646,
-                 1.0),
-    'grey70': (   0.70196078431372544,
-                  0.70196078431372544,
-                  0.70196078431372544,
-                  1.0),
-    'grey71': (   0.70980392156862748,
-                  0.70980392156862748,
-                  0.70980392156862748,
-                  1.0),
-    'grey72': (   0.72156862745098038,
-                  0.72156862745098038,
-                  0.72156862745098038,
-                  1.0),
-    'grey73': (   0.72941176470588232,
-                  0.72941176470588232,
-                  0.72941176470588232,
-                  1.0),
-    'grey74': (   0.74117647058823533,
-                  0.74117647058823533,
-                  0.74117647058823533,
-                  1.0),
-    'grey75': (   0.74901960784313726,
-                  0.74901960784313726,
-                  0.74901960784313726,
-                  1.0),
-    'grey76': (   0.76078431372549016,
-                  0.76078431372549016,
-                  0.76078431372549016,
-                  1.0),
-    'grey77': (   0.7686274509803922,
-                  0.7686274509803922,
-                  0.7686274509803922,
-                  1.0),
-    'grey78': (   0.7803921568627451,
-                  0.7803921568627451,
-                  0.7803921568627451,
-                  1.0),
-    'grey79': (   0.78823529411764703,
-                  0.78823529411764703,
-                  0.78823529411764703,
-                  1.0),
-    'grey8': (   0.078431372549019607,
-                 0.078431372549019607,
-                 0.078431372549019607,
-                 1.0),
-    'grey80': (   0.80000000000000004,
-                  0.80000000000000004,
-                  0.80000000000000004,
-                  1.0),
-    'grey81': (   0.81176470588235294,
-                  0.81176470588235294,
-                  0.81176470588235294,
-                  1.0),
-    'grey82': (   0.81960784313725488,
-                  0.81960784313725488,
-                  0.81960784313725488,
-                  1.0),
-    'grey83': (   0.83137254901960789,
-                  0.83137254901960789,
-                  0.83137254901960789,
-                  1.0),
-    'grey84': (   0.83921568627450982,
-                  0.83921568627450982,
-                  0.83921568627450982,
-                  1.0),
-    'grey85': (   0.85098039215686272,
-                  0.85098039215686272,
-                  0.85098039215686272,
-                  1.0),
-    'grey86': (   0.85882352941176465,
-                  0.85882352941176465,
-                  0.85882352941176465,
-                  1.0),
-    'grey87': (   0.87058823529411766,
-                  0.87058823529411766,
-                  0.87058823529411766,
-                  1.0),
-    'grey88': (   0.8784313725490196,
-                  0.8784313725490196,
-                  0.8784313725490196,
-                  1.0),
-    'grey89': (   0.8901960784313725,
-                  0.8901960784313725,
-                  0.8901960784313725,
-                  1.0),
-    'grey9': (   0.090196078431372548,
-                 0.090196078431372548,
-                 0.090196078431372548,
-                 1.0),
-    'grey90': (   0.89803921568627454,
-                  0.89803921568627454,
-                  0.89803921568627454,
-                  1.0),
-    'grey91': (   0.90980392156862744,
-                  0.90980392156862744,
-                  0.90980392156862744,
-                  1.0),
-    'grey92': (   0.92156862745098034,
-                  0.92156862745098034,
-                  0.92156862745098034,
-                  1.0),
-    'grey93': (   0.92941176470588238,
-                  0.92941176470588238,
-                  0.92941176470588238,
-                  1.0),
-    'grey94': (   0.94117647058823528,
-                  0.94117647058823528,
-                  0.94117647058823528,
-                  1.0),
-    'grey95': (   0.94901960784313721,
-                  0.94901960784313721,
-                  0.94901960784313721,
-                  1.0),
-    'grey96': (   0.96078431372549022,
-                  0.96078431372549022,
-                  0.96078431372549022,
-                  1.0),
-    'grey97': (   0.96862745098039216,
-                  0.96862745098039216,
-                  0.96862745098039216,
-                  1.0),
-    'grey98': (   0.98039215686274506,
-                  0.98039215686274506,
-                  0.98039215686274506,
-                  1.0),
-    'grey99': (   0.9882352941176471,
-                  0.9882352941176471,
-                  0.9882352941176471,
-                  1.0),
-    'honeydew': (0.94117647058823528, 1.0, 0.94117647058823528, 1.0),
-    'honeydew1': (0.94117647058823528, 1.0, 0.94117647058823528, 1.0),
-    'honeydew2': (   0.8784313725490196,
-                     0.93333333333333335,
-                     0.8784313725490196,
-                     1.0),
-    'honeydew3': (   0.75686274509803919,
-                     0.80392156862745101,
-                     0.75686274509803919,
-                     1.0),
-    'honeydew4': (   0.51372549019607838,
-                     0.54509803921568623,
-                     0.51372549019607838,
-                     1.0),
-    'hot pink': (1.0, 0.41176470588235292, 0.70588235294117652, 1.0),
-    'hotpink': (1.0, 0.41176470588235292, 0.70588235294117652, 1.0),
-    'hotpink1': (1.0, 0.43137254901960786, 0.70588235294117652, 1.0),
-    'hotpink2': (   0.93333333333333335,
-                    0.41568627450980394,
-                    0.65490196078431373,
-                    1.0),
-    'hotpink3': (   0.80392156862745101,
-                    0.37647058823529411,
-                    0.56470588235294117,
-                    1.0),
-    'hotpink4': (   0.54509803921568623,
-                    0.22745098039215686,
-                    0.3843137254901961,
-                    1.0),
-    'indian red': (   0.80392156862745101,
-                      0.36078431372549019,
-                      0.36078431372549019,
-                      1.0),
-    'indianred': (   0.80392156862745101,
-                     0.36078431372549019,
-                     0.36078431372549019,
-                     1.0),
-    'indianred1': (1.0, 0.41568627450980394, 0.41568627450980394, 1.0),
-    'indianred2': (   0.93333333333333335,
-                      0.38823529411764707,
-                      0.38823529411764707,
-                      1.0),
-    'indianred3': (   0.80392156862745101,
-                      0.33333333333333331,
-                      0.33333333333333331,
-                      1.0),
-    'indianred4': (   0.54509803921568623,
-                      0.22745098039215686,
-                      0.22745098039215686,
-                      1.0),
-    'ivory': (1.0, 1.0, 0.94117647058823528, 1.0),
-    'ivory1': (1.0, 1.0, 0.94117647058823528, 1.0),
-    'ivory2': (   0.93333333333333335,
-                  0.93333333333333335,
-                  0.8784313725490196,
-                  1.0),
-    'ivory3': (   0.80392156862745101,
-                  0.80392156862745101,
-                  0.75686274509803919,
-                  1.0),
-    'ivory4': (   0.54509803921568623,
-                  0.54509803921568623,
-                  0.51372549019607838,
-                  1.0),
-    'khaki': (   0.94117647058823528,
-                 0.90196078431372551,
-                 0.5490196078431373,
-                 1.0),
-    'khaki1': (1.0, 0.96470588235294119, 0.5607843137254902, 1.0),
-    'khaki2': (   0.93333333333333335,
-                  0.90196078431372551,
-                  0.52156862745098043,
-                  1.0),
-    'khaki3': (   0.80392156862745101,
-                  0.77647058823529413,
-                  0.45098039215686275,
-                  1.0),
-    'khaki4': (   0.54509803921568623,
-                  0.52549019607843139,
-                  0.30588235294117649,
-                  1.0),
-    'lavender': (   0.90196078431372551,
-                    0.90196078431372551,
-                    0.98039215686274506,
-                    1.0),
-    'lavender blush': (1.0, 0.94117647058823528, 0.96078431372549022, 1.0),
-    'lavenderblush': (1.0, 0.94117647058823528, 0.96078431372549022, 1.0),
-    'lavenderblush1': (1.0, 0.94117647058823528, 0.96078431372549022, 1.0),
-    'lavenderblush2': (   0.93333333333333335,
-                          0.8784313725490196,
-                          0.89803921568627454,
-                          1.0),
-    'lavenderblush3': (   0.80392156862745101,
-                          0.75686274509803919,
-                          0.77254901960784317,
-                          1.0),
-    'lavenderblush4': (   0.54509803921568623,
-                          0.51372549019607838,
-                          0.52549019607843139,
-                          1.0),
-    'lawn green': (0.48627450980392156, 0.9882352941176471, 0.0, 1.0),
-    'lawngreen': (0.48627450980392156, 0.9882352941176471, 0.0, 1.0),
-    'lemon chiffon': (1.0, 0.98039215686274506, 0.80392156862745101, 1.0),
-    'lemonchiffon': (1.0, 0.98039215686274506, 0.80392156862745101, 1.0),
-    'lemonchiffon1': (1.0, 0.98039215686274506, 0.80392156862745101, 1.0),
-    'lemonchiffon2': (   0.93333333333333335,
-                         0.9137254901960784,
-                         0.74901960784313726,
-                         1.0),
-    'lemonchiffon3': (   0.80392156862745101,
-                         0.78823529411764703,
-                         0.6470588235294118,
-                         1.0),
-    'lemonchiffon4': (   0.54509803921568623,
-                         0.53725490196078429,
-                         0.4392156862745098,
-                         1.0),
-    'light blue': (   0.67843137254901964,
-                      0.84705882352941175,
-                      0.90196078431372551,
-                      1.0),
-    'light coral': (   0.94117647058823528,
-                       0.50196078431372548,
-                       0.50196078431372548,
-                       1.0),
-    'light cyan': (0.8784313725490196, 1.0, 1.0, 1.0),
-    'light goldenrod': (   0.93333333333333335,
-                           0.8666666666666667,
-                           0.50980392156862742,
-                           1.0),
-    'light goldenrod yellow': (   0.98039215686274506,
-                                  0.98039215686274506,
-                                  0.82352941176470584,
-                                  1.0),
-    'light gray': (   0.82745098039215681,
-                      0.82745098039215681,
-                      0.82745098039215681,
-                      1.0),
-    'light green': (   0.56470588235294117,
-                       0.93333333333333335,
-                       0.56470588235294117,
-                       1.0),
-    'light grey': (   0.82745098039215681,
-                      0.82745098039215681,
-                      0.82745098039215681,
-                      1.0),
-    'light pink': (1.0, 0.71372549019607845, 0.75686274509803919, 1.0),
-    'light salmon': (1.0, 0.62745098039215685, 0.47843137254901963, 1.0),
-    'light sea green': (   0.12549019607843137,
-                           0.69803921568627447,
-                           0.66666666666666663,
-                           1.0),
-    'light sky blue': (   0.52941176470588236,
-                          0.80784313725490198,
-                          0.98039215686274506,
-                          1.0),
-    'light slate blue': (0.51764705882352946, 0.4392156862745098, 1.0, 1.0),
-    'light slate gray': (   0.46666666666666667,
-                            0.53333333333333333,
-                            0.59999999999999998,
-                            1.0),
-    'light slate grey': (   0.46666666666666667,
-                            0.53333333333333333,
-                            0.59999999999999998,
-                            1.0),
-    'light steel blue': (   0.69019607843137254,
-                            0.7686274509803922,
-                            0.87058823529411766,
-                            1.0),
-    'light yellow': (1.0, 1.0, 0.8784313725490196, 1.0),
-    'lightblue': (   0.67843137254901964,
-                     0.84705882352941175,
-                     0.90196078431372551,
-                     1.0),
-    'lightblue1': (0.74901960784313726, 0.93725490196078431, 1.0, 1.0),
-    'lightblue2': (   0.69803921568627447,
-                      0.87450980392156863,
-                      0.93333333333333335,
-                      1.0),
-    'lightblue3': (   0.60392156862745094,
-                      0.75294117647058822,
-                      0.80392156862745101,
-                      1.0),
-    'lightblue4': (   0.40784313725490196,
-                      0.51372549019607838,
-                      0.54509803921568623,
-                      1.0),
-    'lightcoral': (   0.94117647058823528,
-                      0.50196078431372548,
-                      0.50196078431372548,
-                      1.0),
-    'lightcyan': (0.8784313725490196, 1.0, 1.0, 1.0),
-    'lightcyan1': (0.8784313725490196, 1.0, 1.0, 1.0),
-    'lightcyan2': (   0.81960784313725488,
-                      0.93333333333333335,
-                      0.93333333333333335,
-                      1.0),
-    'lightcyan3': (   0.70588235294117652,
-                      0.80392156862745101,
-                      0.80392156862745101,
-                      1.0),
-    'lightcyan4': (   0.47843137254901963,
-                      0.54509803921568623,
-                      0.54509803921568623,
-                      1.0),
-    'lightgoldenrod': (   0.93333333333333335,
-                          0.8666666666666667,
-                          0.50980392156862742,
-                          1.0),
-    'lightgoldenrod1': (1.0, 0.92549019607843142, 0.54509803921568623, 1.0),
-    'lightgoldenrod2': (   0.93333333333333335,
-                           0.86274509803921573,
-                           0.50980392156862742,
-                           1.0),
-    'lightgoldenrod3': (   0.80392156862745101,
-                           0.74509803921568629,
-                           0.4392156862745098,
-                           1.0),
-    'lightgoldenrod4': (   0.54509803921568623,
-                           0.50588235294117645,
-                           0.29803921568627451,
-                           1.0),
-    'lightgoldenrodyellow': (   0.98039215686274506,
-                                0.98039215686274506,
-                                0.82352941176470584,
-                                1.0),
-    'lightgray': (   0.82745098039215681,
-                     0.82745098039215681,
-                     0.82745098039215681,
-                     1.0),
-    'lightgreen': (   0.56470588235294117,
-                      0.93333333333333335,
-                      0.56470588235294117,
-                      1.0),
-    'lightgrey': (   0.82745098039215681,
-                     0.82745098039215681,
-                     0.82745098039215681,
-                     1.0),
-    'lightpink': (1.0, 0.71372549019607845, 0.75686274509803919, 1.0),
-    'lightpink1': (1.0, 0.68235294117647061, 0.72549019607843135, 1.0),
-    'lightpink2': (   0.93333333333333335,
-                      0.63529411764705879,
-                      0.67843137254901964,
-                      1.0),
-    'lightpink3': (   0.80392156862745101,
-                      0.5490196078431373,
-                      0.58431372549019611,
-                      1.0),
-    'lightpink4': (   0.54509803921568623,
-                      0.37254901960784315,
-                      0.396078431372549,
-                      1.0),
-    'lightsalmon': (1.0, 0.62745098039215685, 0.47843137254901963, 1.0),
-    'lightsalmon1': (1.0, 0.62745098039215685, 0.47843137254901963, 1.0),
-    'lightsalmon2': (   0.93333333333333335,
-                        0.58431372549019611,
-                        0.44705882352941179,
-                        1.0),
-    'lightsalmon3': (   0.80392156862745101,
-                        0.50588235294117645,
-                        0.3843137254901961,
-                        1.0),
-    'lightsalmon4': (   0.54509803921568623,
-                        0.3411764705882353,
-                        0.25882352941176473,
-                        1.0),
-    'lightseagreen': (   0.12549019607843137,
-                         0.69803921568627447,
-                         0.66666666666666663,
-                         1.0),
-    'lightskyblue': (   0.52941176470588236,
-                        0.80784313725490198,
-                        0.98039215686274506,
-                        1.0),
-    'lightskyblue1': (0.69019607843137254, 0.88627450980392153, 1.0, 1.0),
-    'lightskyblue2': (   0.64313725490196083,
-                         0.82745098039215681,
-                         0.93333333333333335,
-                         1.0),
-    'lightskyblue3': (   0.55294117647058827,
-                         0.71372549019607845,
-                         0.80392156862745101,
-                         1.0),
-    'lightskyblue4': (   0.37647058823529411,
-                         0.4823529411764706,
-                         0.54509803921568623,
-                         1.0),
-    'lightslateblue': (0.51764705882352946, 0.4392156862745098, 1.0, 1.0),
-    'lightslategray': (   0.46666666666666667,
-                          0.53333333333333333,
-                          0.59999999999999998,
-                          1.0),
-    'lightslategrey': (   0.46666666666666667,
-                          0.53333333333333333,
-                          0.59999999999999998,
-                          1.0),
-    'lightsteelblue': (   0.69019607843137254,
-                          0.7686274509803922,
-                          0.87058823529411766,
-                          1.0),
-    'lightsteelblue1': (0.792156862745098, 0.88235294117647056, 1.0, 1.0),
-    'lightsteelblue2': (   0.73725490196078436,
-                           0.82352941176470584,
-                           0.93333333333333335,
-                           1.0),
-    'lightsteelblue3': (   0.63529411764705879,
-                           0.70980392156862748,
-                           0.80392156862745101,
-                           1.0),
-    'lightsteelblue4': (   0.43137254901960786,
-                           0.4823529411764706,
-                           0.54509803921568623,
-                           1.0),
-    'lightyellow': (1.0, 1.0, 0.8784313725490196, 1.0),
-    'lightyellow1': (1.0, 1.0, 0.8784313725490196, 1.0),
-    'lightyellow2': (   0.93333333333333335,
-                        0.93333333333333335,
-                        0.81960784313725488,
-                        1.0),
-    'lightyellow3': (   0.80392156862745101,
-                        0.80392156862745101,
-                        0.70588235294117652,
-                        1.0),
-    'lightyellow4': (   0.54509803921568623,
-                        0.54509803921568623,
-                        0.47843137254901963,
-                        1.0),
-    'lime': (0.0, 1.0, 0.0, 1.0),
-    'lime green': (   0.19607843137254902,
-                      0.80392156862745101,
-                      0.19607843137254902,
-                      1.0),
-    'limegreen': (   0.19607843137254902,
-                     0.80392156862745101,
-                     0.19607843137254902,
-                     1.0),
-    'linen': (   0.98039215686274506,
-                 0.94117647058823528,
-                 0.90196078431372551,
-                 1.0),
-    'magenta': (1.0, 0.0, 1.0, 1.0),
-    'magenta1': (1.0, 0.0, 1.0, 1.0),
-    'magenta2': (0.93333333333333335, 0.0, 0.93333333333333335, 1.0),
-    'magenta3': (0.80392156862745101, 0.0, 0.80392156862745101, 1.0),
-    'magenta4': (0.54509803921568623, 0.0, 0.54509803921568623, 1.0),
-    'maroon': (   0.69019607843137254,
-                  0.18823529411764706,
-                  0.37647058823529411,
-                  1.0),
-    'maroon1': (1.0, 0.20392156862745098, 0.70196078431372544, 1.0),
-    'maroon2': (   0.93333333333333335,
-                   0.18823529411764706,
-                   0.65490196078431373,
-                   1.0),
-    'maroon3': (   0.80392156862745101,
-                   0.16078431372549021,
-                   0.56470588235294117,
-                   1.0),
-    'maroon4': (   0.54509803921568623,
-                   0.10980392156862745,
-                   0.3843137254901961,
-                   1.0),
-    'medium aquamarine': (   0.40000000000000002,
-                             0.80392156862745101,
-                             0.66666666666666663,
-                             1.0),
-    'medium blue': (0.0, 0.0, 0.80392156862745101, 1.0),
-    'medium orchid': (   0.72941176470588232,
-                         0.33333333333333331,
-                         0.82745098039215681,
-                         1.0),
-    'medium purple': (   0.57647058823529407,
-                         0.4392156862745098,
-                         0.85882352941176465,
-                         1.0),
-    'medium sea green': (   0.23529411764705882,
-                            0.70196078431372544,
-                            0.44313725490196076,
-                            1.0),
-    'medium slate blue': (   0.4823529411764706,
-                             0.40784313725490196,
-                             0.93333333333333335,
-                             1.0),
-    'medium spring green': (   0.0,
-                               0.98039215686274506,
-                               0.60392156862745094,
-                               1.0),
-    'medium turquoise': (   0.28235294117647058,
-                            0.81960784313725488,
-                            0.80000000000000004,
-                            1.0),
-    'medium violet red': (   0.7803921568627451,
-                             0.082352941176470587,
-                             0.52156862745098043,
-                             1.0),
-    'mediumaquamarine': (   0.40000000000000002,
-                            0.80392156862745101,
-                            0.66666666666666663,
-                            1.0),
-    'mediumblue': (0.0, 0.0, 0.80392156862745101, 1.0),
-    'mediumorchid': (   0.72941176470588232,
-                        0.33333333333333331,
-                        0.82745098039215681,
-                        1.0),
-    'mediumorchid1': (0.8784313725490196, 0.40000000000000002, 1.0, 1.0),
-    'mediumorchid2': (   0.81960784313725488,
-                         0.37254901960784315,
-                         0.93333333333333335,
-                         1.0),
-    'mediumorchid3': (   0.70588235294117652,
-                         0.32156862745098042,
-                         0.80392156862745101,
-                         1.0),
-    'mediumorchid4': (   0.47843137254901963,
-                         0.21568627450980393,
-                         0.54509803921568623,
-                         1.0),
-    'mediumpurple': (   0.57647058823529407,
-                        0.4392156862745098,
-                        0.85882352941176465,
-                        1.0),
-    'mediumpurple1': (0.6705882352941176, 0.50980392156862742, 1.0, 1.0),
-    'mediumpurple2': (   0.62352941176470589,
-                         0.47450980392156861,
-                         0.93333333333333335,
-                         1.0),
-    'mediumpurple3': (   0.53725490196078429,
-                         0.40784313725490196,
-                         0.80392156862745101,
-                         1.0),
-    'mediumpurple4': (   0.36470588235294116,
-                         0.27843137254901962,
-                         0.54509803921568623,
-                         1.0),
-    'mediumseagreen': (   0.23529411764705882,
-                          0.70196078431372544,
-                          0.44313725490196076,
-                          1.0),
-    'mediumslateblue': (   0.4823529411764706,
-                           0.40784313725490196,
-                           0.93333333333333335,
-                           1.0),
-    'mediumspringgreen': (0.0, 0.98039215686274506, 0.60392156862745094, 1.0),
-    'mediumturquoise': (   0.28235294117647058,
-                           0.81960784313725488,
-                           0.80000000000000004,
-                           1.0),
-    'mediumvioletred': (   0.7803921568627451,
-                           0.082352941176470587,
-                           0.52156862745098043,
-                           1.0),
-    'midnight blue': (   0.098039215686274508,
-                         0.098039215686274508,
-                         0.4392156862745098,
-                         1.0),
-    'midnightblue': (   0.098039215686274508,
-                        0.098039215686274508,
-                        0.4392156862745098,
-                        1.0),
-    'mint cream': (0.96078431372549022, 1.0, 0.98039215686274506, 1.0),
-    'mintcream': (0.96078431372549022, 1.0, 0.98039215686274506, 1.0),
-    'misty rose': (1.0, 0.89411764705882357, 0.88235294117647056, 1.0),
-    'mistyrose': (1.0, 0.89411764705882357, 0.88235294117647056, 1.0),
-    'mistyrose1': (1.0, 0.89411764705882357, 0.88235294117647056, 1.0),
-    'mistyrose2': (   0.93333333333333335,
-                      0.83529411764705885,
-                      0.82352941176470584,
-                      1.0),
-    'mistyrose3': (   0.80392156862745101,
-                      0.71764705882352942,
-                      0.70980392156862748,
-                      1.0),
-    'mistyrose4': (   0.54509803921568623,
-                      0.49019607843137253,
-                      0.4823529411764706,
-                      1.0),
-    'moccasin': (1.0, 0.89411764705882357, 0.70980392156862748, 1.0),
-    'navajo white': (1.0, 0.87058823529411766, 0.67843137254901964, 1.0),
-    'navajowhite': (1.0, 0.87058823529411766, 0.67843137254901964, 1.0),
-    'navajowhite1': (1.0, 0.87058823529411766, 0.67843137254901964, 1.0),
-    'navajowhite2': (   0.93333333333333335,
-                        0.81176470588235294,
-                        0.63137254901960782,
-                        1.0),
-    'navajowhite3': (   0.80392156862745101,
-                        0.70196078431372544,
-                        0.54509803921568623,
-                        1.0),
-    'navajowhite4': (   0.54509803921568623,
-                        0.47450980392156861,
-                        0.36862745098039218,
-                        1.0),
-    'navy': (0.0, 0.0, 0.50196078431372548, 1.0),
-    'navy blue': (0.0, 0.0, 0.50196078431372548, 1.0),
-    'navyblue': (0.0, 0.0, 0.50196078431372548, 1.0),
-    'old lace': (   0.99215686274509807,
-                    0.96078431372549022,
-                    0.90196078431372551,
-                    1.0),
-    'oldlace': (   0.99215686274509807,
-                   0.96078431372549022,
-                   0.90196078431372551,
-                   1.0),
-    'olive': (0.5, 0.5, 0.0, 1.0),
-    'olive drab': (   0.41960784313725491,
-                      0.55686274509803924,
-                      0.13725490196078433,
-                      1.0),
-    'olivedrab': (   0.41960784313725491,
-                     0.55686274509803924,
-                     0.13725490196078433,
-                     1.0),
-    'olivedrab1': (0.75294117647058822, 1.0, 0.24313725490196078, 1.0),
-    'olivedrab2': (   0.70196078431372544,
-                      0.93333333333333335,
-                      0.22745098039215686,
-                      1.0),
-    'olivedrab3': (   0.60392156862745094,
-                      0.80392156862745101,
-                      0.19607843137254902,
-                      1.0),
-    'olivedrab4': (   0.41176470588235292,
-                      0.54509803921568623,
-                      0.13333333333333333,
-                      1.0),
-    'orange': (1.0, 0.6470588235294118, 0.0, 1.0),
-    'orange red': (1.0, 0.27058823529411763, 0.0, 1.0),
-    'orange1': (1.0, 0.6470588235294118, 0.0, 1.0),
-    'orange2': (0.93333333333333335, 0.60392156862745094, 0.0, 1.0),
-    'orange3': (0.80392156862745101, 0.52156862745098043, 0.0, 1.0),
-    'orange4': (0.54509803921568623, 0.35294117647058826, 0.0, 1.0),
-    'orangered': (1.0, 0.27058823529411763, 0.0, 1.0),
-    'orangered1': (1.0, 0.27058823529411763, 0.0, 1.0),
-    'orangered2': (0.93333333333333335, 0.25098039215686274, 0.0, 1.0),
-    'orangered3': (0.80392156862745101, 0.21568627450980393, 0.0, 1.0),
-    'orangered4': (0.54509803921568623, 0.14509803921568629, 0.0, 1.0),
-    'orchid': (   0.85490196078431369,
-                  0.4392156862745098,
-                  0.83921568627450982,
-                  1.0),
-    'orchid1': (1.0, 0.51372549019607838, 0.98039215686274506, 1.0),
-    'orchid2': (   0.93333333333333335,
-                   0.47843137254901963,
-                   0.9137254901960784,
-                   1.0),
-    'orchid3': (   0.80392156862745101,
-                   0.41176470588235292,
-                   0.78823529411764703,
-                   1.0),
-    'orchid4': (   0.54509803921568623,
-                   0.27843137254901962,
-                   0.53725490196078429,
-                   1.0),
-    'pale goldenrod': (   0.93333333333333335,
-                          0.90980392156862744,
-                          0.66666666666666663,
-                          1.0),
-    'pale green': (   0.59607843137254901,
-                      0.98431372549019602,
-                      0.59607843137254901,
-                      1.0),
-    'pale turquoise': (   0.68627450980392157,
-                          0.93333333333333335,
-                          0.93333333333333335,
-                          1.0),
-    'pale violet red': (   0.85882352941176465,
-                           0.4392156862745098,
-                           0.57647058823529407,
-                           1.0),
-    'palegoldenrod': (   0.93333333333333335,
-                         0.90980392156862744,
-                         0.66666666666666663,
-                         1.0),
-    'palegreen': (   0.59607843137254901,
-                     0.98431372549019602,
-                     0.59607843137254901,
-                     1.0),
-    'palegreen1': (0.60392156862745094, 1.0, 0.60392156862745094, 1.0),
-    'palegreen2': (   0.56470588235294117,
-                      0.93333333333333335,
-                      0.56470588235294117,
-                      1.0),
-    'palegreen3': (   0.48627450980392156,
-                      0.80392156862745101,
-                      0.48627450980392156,
-                      1.0),
-    'palegreen4': (   0.32941176470588235,
-                      0.54509803921568623,
-                      0.32941176470588235,
-                      1.0),
-    'paleturquoise': (   0.68627450980392157,
-                         0.93333333333333335,
-                         0.93333333333333335,
-                         1.0),
-    'paleturquoise1': (0.73333333333333328, 1.0, 1.0, 1.0),
-    'paleturquoise2': (   0.68235294117647061,
-                          0.93333333333333335,
-                          0.93333333333333335,
-                          1.0),
-    'paleturquoise3': (   0.58823529411764708,
-                          0.80392156862745101,
-                          0.80392156862745101,
-                          1.0),
-    'paleturquoise4': (   0.40000000000000002,
-                          0.54509803921568623,
-                          0.54509803921568623,
-                          1.0),
-    'palevioletred': (   0.85882352941176465,
-                         0.4392156862745098,
-                         0.57647058823529407,
-                         1.0),
-    'palevioletred1': (1.0, 0.50980392156862742, 0.6705882352941176, 1.0),
-    'palevioletred2': (   0.93333333333333335,
-                          0.47450980392156861,
-                          0.62352941176470589,
-                          1.0),
-    'palevioletred3': (   0.80392156862745101,
-                          0.40784313725490196,
-                          0.53725490196078429,
-                          1.0),
-    'palevioletred4': (   0.54509803921568623,
-                          0.27843137254901962,
-                          0.36470588235294116,
-                          1.0),
-    'papaya whip': (1.0, 0.93725490196078431, 0.83529411764705885, 1.0),
-    'papayawhip': (1.0, 0.93725490196078431, 0.83529411764705885, 1.0),
-    'peach puff': (1.0, 0.85490196078431369, 0.72549019607843135, 1.0),
-    'peachpuff': (1.0, 0.85490196078431369, 0.72549019607843135, 1.0),
-    'peachpuff1': (1.0, 0.85490196078431369, 0.72549019607843135, 1.0),
-    'peachpuff2': (   0.93333333333333335,
-                      0.79607843137254897,
-                      0.67843137254901964,
-                      1.0),
-    'peachpuff3': (   0.80392156862745101,
-                      0.68627450980392157,
-                      0.58431372549019611,
-                      1.0),
-    'peachpuff4': (   0.54509803921568623,
-                      0.46666666666666667,
-                      0.396078431372549,
-                      1.0),
-    'peru': (   0.80392156862745101,
-                0.52156862745098043,
-                0.24705882352941178,
-                1.0),
-    'pink': (1.0, 0.75294117647058822, 0.79607843137254897, 1.0),
-    'pink1': (1.0, 0.70980392156862748, 0.77254901960784317, 1.0),
-    'pink2': (   0.93333333333333335,
-                 0.66274509803921566,
-                 0.72156862745098038,
-                 1.0),
-    'pink3': (   0.80392156862745101,
-                 0.56862745098039214,
-                 0.61960784313725492,
-                 1.0),
-    'pink4': (   0.54509803921568623,
-                 0.38823529411764707,
-                 0.42352941176470588,
-                 1.0),
-    'plum': (0.8666666666666667, 0.62745098039215685, 0.8666666666666667, 1.0),
-    'plum1': (1.0, 0.73333333333333328, 1.0, 1.0),
-    'plum2': (   0.93333333333333335,
-                 0.68235294117647061,
-                 0.93333333333333335,
-                 1.0),
-    'plum3': (   0.80392156862745101,
-                 0.58823529411764708,
-                 0.80392156862745101,
-                 1.0),
-    'plum4': (   0.54509803921568623,
-                 0.40000000000000002,
-                 0.54509803921568623,
-                 1.0),
-    'powder blue': (   0.69019607843137254,
-                       0.8784313725490196,
-                       0.90196078431372551,
-                       1.0),
-    'powderblue': (   0.69019607843137254,
-                      0.8784313725490196,
-                      0.90196078431372551,
-                      1.0),
-    'purple': (   0.62745098039215685,
-                  0.12549019607843137,
-                  0.94117647058823528,
-                  1.0),
-    'purple1': (0.60784313725490191, 0.18823529411764706, 1.0, 1.0),
-    'purple2': (   0.56862745098039214,
-                   0.17254901960784313,
-                   0.93333333333333335,
-                   1.0),
-    'purple3': (   0.49019607843137253,
-                   0.14901960784313725,
-                   0.80392156862745101,
-                   1.0),
-    'purple4': (   0.33333333333333331,
-                   0.10196078431372549,
-                   0.54509803921568623,
-                   1.0),
-    'red': (1.0, 0.0, 0.0, 1.0),
-    'red1': (1.0, 0.0, 0.0, 1.0),
-    'red2': (0.93333333333333335, 0.0, 0.0, 1.0),
-    'red3': (0.80392156862745101, 0.0, 0.0, 1.0),
-    'red4': (0.54509803921568623, 0.0, 0.0, 1.0),
-    'rosy brown': (   0.73725490196078436,
-                      0.5607843137254902,
-                      0.5607843137254902,
-                      1.0),
-    'rosybrown': (   0.73725490196078436,
-                     0.5607843137254902,
-                     0.5607843137254902,
-                     1.0),
-    'rosybrown1': (1.0, 0.75686274509803919, 0.75686274509803919, 1.0),
-    'rosybrown2': (   0.93333333333333335,
-                      0.70588235294117652,
-                      0.70588235294117652,
-                      1.0),
-    'rosybrown3': (   0.80392156862745101,
-                      0.60784313725490191,
-                      0.60784313725490191,
-                      1.0),
-    'rosybrown4': (   0.54509803921568623,
-                      0.41176470588235292,
-                      0.41176470588235292,
-                      1.0),
-    'royal blue': (   0.25490196078431371,
-                      0.41176470588235292,
-                      0.88235294117647056,
-                      1.0),
-    'royalblue': (   0.25490196078431371,
-                     0.41176470588235292,
-                     0.88235294117647056,
-                     1.0),
-    'royalblue1': (0.28235294117647058, 0.46274509803921571, 1.0, 1.0),
-    'royalblue2': (   0.2627450980392157,
-                      0.43137254901960786,
-                      0.93333333333333335,
-                      1.0),
-    'royalblue3': (   0.22745098039215686,
-                      0.37254901960784315,
-                      0.80392156862745101,
-                      1.0),
-    'royalblue4': (   0.15294117647058825,
-                      0.25098039215686274,
-                      0.54509803921568623,
-                      1.0),
-    'saddle brown': (   0.54509803921568623,
-                        0.27058823529411763,
-                        0.074509803921568626,
-                        1.0),
-    'saddlebrown': (   0.54509803921568623,
-                       0.27058823529411763,
-                       0.074509803921568626,
-                       1.0),
-    'salmon': (   0.98039215686274506,
-                  0.50196078431372548,
-                  0.44705882352941179,
-                  1.0),
-    'salmon1': (1.0, 0.5490196078431373, 0.41176470588235292, 1.0),
-    'salmon2': (   0.93333333333333335,
-                   0.50980392156862742,
-                   0.3843137254901961,
-                   1.0),
-    'salmon3': (   0.80392156862745101,
-                   0.4392156862745098,
-                   0.32941176470588235,
-                   1.0),
-    'salmon4': (   0.54509803921568623,
-                   0.29803921568627451,
-                   0.22352941176470589,
-                   1.0),
-    'sandy brown': (   0.95686274509803926,
-                       0.64313725490196083,
-                       0.37647058823529411,
-                       1.0),
-    'sandybrown': (   0.95686274509803926,
-                      0.64313725490196083,
-                      0.37647058823529411,
-                      1.0),
-    'sea green': (   0.1803921568627451,
-                     0.54509803921568623,
-                     0.3411764705882353,
-                     1.0),
-    'seagreen': (   0.1803921568627451,
-                    0.54509803921568623,
-                    0.3411764705882353,
-                    1.0),
-    'seagreen1': (0.32941176470588235, 1.0, 0.62352941176470589, 1.0),
-    'seagreen2': (   0.30588235294117649,
-                     0.93333333333333335,
-                     0.58039215686274515,
-                     1.0),
-    'seagreen3': (   0.2627450980392157,
-                     0.80392156862745101,
-                     0.50196078431372548,
-                     1.0),
-    'seagreen4': (   0.1803921568627451,
-                     0.54509803921568623,
-                     0.3411764705882353,
-                     1.0),
-    'seashell': (1.0, 0.96078431372549022, 0.93333333333333335, 1.0),
-    'seashell1': (1.0, 0.96078431372549022, 0.93333333333333335, 1.0),
-    'seashell2': (   0.93333333333333335,
-                     0.89803921568627454,
-                     0.87058823529411766,
-                     1.0),
-    'seashell3': (   0.80392156862745101,
-                     0.77254901960784317,
-                     0.74901960784313726,
-                     1.0),
-    'seashell4': (   0.54509803921568623,
-                     0.52549019607843139,
-                     0.50980392156862742,
-                     1.0),
-    'sienna': (   0.62745098039215685,
-                  0.32156862745098042,
-                  0.17647058823529413,
-                  1.0),
-    'sienna1': (1.0, 0.50980392156862742, 0.27843137254901962, 1.0),
-    'sienna2': (   0.93333333333333335,
-                   0.47450980392156861,
-                   0.25882352941176473,
-                   1.0),
-    'sienna3': (   0.80392156862745101,
-                   0.40784313725490196,
-                   0.22352941176470589,
-                   1.0),
-    'sienna4': (   0.54509803921568623,
-                   0.27843137254901962,
-                   0.14901960784313725,
-                   1.0),
-    'silver': (0.75, 0.75, 0.75, 1.0),
-    'sky blue': (   0.52941176470588236,
-                    0.80784313725490198,
-                    0.92156862745098034,
-                    1.0),
-    'skyblue': (   0.52941176470588236,
-                   0.80784313725490198,
-                   0.92156862745098034,
-                   1.0),
-    'skyblue1': (0.52941176470588236, 0.80784313725490198, 1.0, 1.0),
-    'skyblue2': (   0.49411764705882355,
-                    0.75294117647058822,
-                    0.93333333333333335,
-                    1.0),
-    'skyblue3': (   0.42352941176470588,
-                    0.65098039215686276,
-                    0.80392156862745101,
-                    1.0),
-    'skyblue4': (   0.29019607843137257,
-                    0.4392156862745098,
-                    0.54509803921568623,
-                    1.0),
-    'slate blue': (   0.41568627450980394,
-                      0.35294117647058826,
-                      0.80392156862745101,
-                      1.0),
-    'slate gray': (   0.4392156862745098,
-                      0.50196078431372548,
-                      0.56470588235294117,
-                      1.0),
-    'slate grey': (   0.4392156862745098,
-                      0.50196078431372548,
-                      0.56470588235294117,
-                      1.0),
-    'slateblue': (   0.41568627450980394,
-                     0.35294117647058826,
-                     0.80392156862745101,
-                     1.0),
-    'slateblue1': (0.51372549019607838, 0.43529411764705883, 1.0, 1.0),
-    'slateblue2': (   0.47843137254901963,
-                      0.40392156862745099,
-                      0.93333333333333335,
-                      1.0),
-    'slateblue3': (   0.41176470588235292,
-                      0.34901960784313724,
-                      0.80392156862745101,
-                      1.0),
-    'slateblue4': (   0.27843137254901962,
-                      0.23529411764705882,
-                      0.54509803921568623,
-                      1.0),
-    'slategray': (   0.4392156862745098,
-                     0.50196078431372548,
-                     0.56470588235294117,
-                     1.0),
-    'slategray1': (0.77647058823529413, 0.88627450980392153, 1.0, 1.0),
-    'slategray2': (   0.72549019607843135,
-                      0.82745098039215681,
-                      0.93333333333333335,
-                      1.0),
-    'slategray3': (   0.62352941176470589,
-                      0.71372549019607845,
-                      0.80392156862745101,
-                      1.0),
-    'slategray4': (   0.42352941176470588,
-                      0.4823529411764706,
-                      0.54509803921568623,
-                      1.0),
-    'slategrey': (   0.4392156862745098,
-                     0.50196078431372548,
-                     0.56470588235294117,
-                     1.0),
-    'snow': (1.0, 0.98039215686274506, 0.98039215686274506, 1.0),
-    'snow1': (1.0, 0.98039215686274506, 0.98039215686274506, 1.0),
-    'snow2': (   0.93333333333333335,
-                 0.9137254901960784,
-                 0.9137254901960784,
-                 1.0),
-    'snow3': (   0.80392156862745101,
-                 0.78823529411764703,
-                 0.78823529411764703,
-                 1.0),
-    'snow4': (   0.54509803921568623,
-                 0.53725490196078429,
-                 0.53725490196078429,
-                 1.0),
-    'spring green': (0.0, 1.0, 0.49803921568627452, 1.0),
-    'springgreen': (0.0, 1.0, 0.49803921568627452, 1.0),
-    'springgreen1': (0.0, 1.0, 0.49803921568627452, 1.0),
-    'springgreen2': (0.0, 0.93333333333333335, 0.46274509803921571, 1.0),
-    'springgreen3': (0.0, 0.80392156862745101, 0.40000000000000002, 1.0),
-    'springgreen4': (0.0, 0.54509803921568623, 0.27058823529411763, 1.0),
-    'steel blue': (   0.27450980392156865,
-                      0.50980392156862742,
-                      0.70588235294117652,
-                      1.0),
-    'steelblue': (   0.27450980392156865,
-                     0.50980392156862742,
-                     0.70588235294117652,
-                     1.0),
-    'steelblue1': (0.38823529411764707, 0.72156862745098038, 1.0, 1.0),
-    'steelblue2': (   0.36078431372549019,
-                      0.67450980392156867,
-                      0.93333333333333335,
-                      1.0),
-    'steelblue3': (   0.30980392156862746,
-                      0.58039215686274515,
-                      0.80392156862745101,
-                      1.0),
-    'steelblue4': (   0.21176470588235294,
-                      0.39215686274509803,
-                      0.54509803921568623,
-                      1.0),
-    'tan': (0.82352941176470584, 0.70588235294117652, 0.5490196078431373, 1.0),
-    'tan1': (1.0, 0.6470588235294118, 0.30980392156862746, 1.0),
-    'tan2': (   0.93333333333333335,
-                0.60392156862745094,
-                0.28627450980392155,
-                1.0),
-    'tan3': (   0.80392156862745101,
-                0.52156862745098043,
-                0.24705882352941178,
-                1.0),
-    'tan4': (   0.54509803921568623,
-                0.35294117647058826,
-                0.16862745098039217,
-                1.0),
-    'teal': (0.0, 0.5, 0.5, 1.0),
-    'thistle': (   0.84705882352941175,
-                   0.74901960784313726,
-                   0.84705882352941175,
-                   1.0),
-    'thistle1': (1.0, 0.88235294117647056, 1.0, 1.0),
-    'thistle2': (   0.93333333333333335,
-                    0.82352941176470584,
-                    0.93333333333333335,
-                    1.0),
-    'thistle3': (   0.80392156862745101,
-                    0.70980392156862748,
-                    0.80392156862745101,
-                    1.0),
-    'thistle4': (   0.54509803921568623,
-                    0.4823529411764706,
-                    0.54509803921568623,
-                    1.0),
-    'tomato': (1.0, 0.38823529411764707, 0.27843137254901962, 1.0),
-    'tomato1': (1.0, 0.38823529411764707, 0.27843137254901962, 1.0),
-    'tomato2': (   0.93333333333333335,
-                   0.36078431372549019,
-                   0.25882352941176473,
-                   1.0),
-    'tomato3': (   0.80392156862745101,
-                   0.30980392156862746,
-                   0.22352941176470589,
-                   1.0),
-    'tomato4': (   0.54509803921568623,
-                   0.21176470588235294,
-                   0.14901960784313725,
-                   1.0),
-    'turquoise': (   0.25098039215686274,
-                     0.8784313725490196,
-                     0.81568627450980391,
-                     1.0),
-    'turquoise1': (0.0, 0.96078431372549022, 1.0, 1.0),
-    'turquoise2': (0.0, 0.89803921568627454, 0.93333333333333335, 1.0),
-    'turquoise3': (0.0, 0.77254901960784317, 0.80392156862745101, 1.0),
-    'turquoise4': (0.0, 0.52549019607843139, 0.54509803921568623, 1.0),
-    'violet': (   0.93333333333333335,
-                  0.50980392156862742,
-                  0.93333333333333335,
-                  1.0),
-    'violet red': (   0.81568627450980391,
-                      0.12549019607843137,
-                      0.56470588235294117,
-                      1.0),
-    'violetred': (   0.81568627450980391,
-                     0.12549019607843137,
-                     0.56470588235294117,
-                     1.0),
-    'violetred1': (1.0, 0.24313725490196078, 0.58823529411764708, 1.0),
-    'violetred2': (   0.93333333333333335,
-                      0.22745098039215686,
-                      0.5490196078431373,
-                      1.0),
-    'violetred3': (   0.80392156862745101,
-                      0.19607843137254902,
-                      0.47058823529411764,
-                      1.0),
-    'violetred4': (   0.54509803921568623,
-                      0.13333333333333333,
-                      0.32156862745098042,
-                      1.0),
-    'wheat': (   0.96078431372549022,
-                 0.87058823529411766,
-                 0.70196078431372544,
-                 1.0),
-    'wheat1': (1.0, 0.90588235294117647, 0.72941176470588232, 1.0),
-    'wheat2': (   0.93333333333333335,
-                  0.84705882352941175,
-                  0.68235294117647061,
-                  1.0),
-    'wheat3': (   0.80392156862745101,
-                  0.72941176470588232,
-                  0.58823529411764708,
-                  1.0),
-    'wheat4': (   0.54509803921568623,
-                  0.49411764705882355,
-                  0.40000000000000002,
-                  1.0),
-    'white': (1.0, 1.0, 1.0, 1.0),
-    'white smoke': (   0.96078431372549022,
-                       0.96078431372549022,
-                       0.96078431372549022,
-                       1.0),
-    'whitesmoke': (   0.96078431372549022,
-                      0.96078431372549022,
-                      0.96078431372549022,
-                      1.0),
-    'yellow': (1.0, 1.0, 0.0, 1.0),
-    'yellow green': (   0.60392156862745094,
-                        0.80392156862745101,
-                        0.19607843137254902,
-                        1.0),
-    'yellow1': (1.0, 1.0, 0.0, 1.0),
-    'yellow2': (0.93333333333333335, 0.93333333333333335, 0.0, 1.0),
-    'yellow3': (0.80392156862745101, 0.80392156862745101, 0.0, 1.0),
-    'yellow4': (0.54509803921568623, 0.54509803921568623, 0.0, 1.0),
-    'yellowgreen': (   0.60392156862745094,
-                       0.80392156862745101,
-                       0.19607843137254902,
-                       1.0)}
-
-palettes = {
-    "gray": GradientPalette("black", "white"),
-    "red-blue": GradientPalette("red", "blue"),
-    "red-purple-blue": AdvancedGradientPalette(["red", "purple", "blue"]),
-    "red-green": GradientPalette("red", "green"),
-    "red-yellow-green": AdvancedGradientPalette(["red", "yellow", "green"]),
-    "red-black-green": AdvancedGradientPalette(["red", "black", "green"]),
-    "rainbow": RainbowPalette(),
-    "heat": AdvancedGradientPalette(["red", "yellow", "white"],
-        indices=[0, 192, 255]),
-    "terrain": AdvancedGradientPalette(["hsv(120, 100%, 65%)",
-        "hsv(60, 100%, 90%)", "hsv(0, 0%, 95%)"])
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/coord.py igraph-0.6.5/interfaces/python/igraph/drawing/coord.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/coord.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/coord.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,119 +0,0 @@
-"""
-Coordinate systems and related plotting routines
-"""
-
-from igraph.compat import property
-from igraph.drawing.baseclasses import AbstractCairoDrawer
-from igraph.drawing.utils import BoundingBox
-
-__license__ = "GPL"
-
-#####################################################################
-
-# pylint: disable-msg=R0922
-# R0922: Abstract class is only referenced 1 times
-class CoordinateSystem(AbstractCairoDrawer):
-    """Class implementing a coordinate system object.
-
-    Coordinate system objects are used when drawing plots which
-    2D or 3D coordinate system axes. This is an abstract class
-    which must be extended in order to use it. In general, you'll
-    only need the documentation of this class if you intend to
-    implement an own coordinate system not present in igraph yet.
-    """
-
-    def __init__(self, context, bbox):
-        """Initializes the coordinate system.
-
-        @param context: the context on which the coordinate system will
-          be drawn.
-        @param bbox: the bounding box that will contain the coordinate
-          system.
-        """
-        AbstractCairoDrawer.__init__(self, context, bbox)
-
-    def draw(self):
-        """Draws the coordinate system.
-
-        This method must be overridden in derived classes.
-        """
-        raise NotImplementedError("abstract class")
-
-    def local_to_context(self, x, y):
-        """Converts local coordinates to the context coordinate system (given
-        by the bounding box).
-        
-        This method must be overridden in derived classes."""
-        raise NotImplementedError("abstract class")
-
-
-class DescartesCoordinateSystem(CoordinateSystem):
-    """Class implementing a 2D Descartes coordinate system object."""
-
-    def __init__(self, context, bbox, bounds):
-        """Initializes the coordinate system.
-
-        @param context: the context on which the coordinate system will
-          be drawn.
-        @param bbox: the bounding box that will contain the coordinate
-          system.
-        @param bounds: minimum and maximum X and Y values in a 4-tuple.
-        """
-        self._bounds, self._bbox = None, None
-        self._sx, self._sy = None, None
-        self._ox, self._oy, self._ox2, self._oy2 = None, None, None, None
-
-        CoordinateSystem.__init__(self, context, bbox)
-
-        self.bbox = bbox
-        self.bounds = bounds
-
-    @property
-    def bbox(self):
-        """Returns the bounding box of the coordinate system"""
-        return BoundingBox(self._bbox.coords)
-
-    @bbox.setter
-    def bbox(self, bbox):
-        """Sets the bounding box of the coordinate system"""
-        self._bbox = bbox
-        self._recalc_scale_factors()
-
-    @property
-    def bounds(self):
-        """Returns the lower and upper bounds of the X and Y values"""
-        return self._bounds.coords
-
-    @bounds.setter
-    def bounds(self, bounds):
-        """Sets the lower and upper bounds of the X and Y values"""
-        self._bounds = BoundingBox(bounds)
-        self._recalc_scale_factors()
-
-    def _recalc_scale_factors(self):
-        """Recalculates some cached scale factors used within the class"""
-        if self._bounds is None:
-            return
-        self._sx = self._bbox.width / self._bounds.width
-        self._sy = self._bbox.height / self._bounds.height
-        self._ox = self._bounds.left
-        self._oy = self._bounds.top
-        self._ox2 = self._bbox.left
-        self._oy2 = self._bbox.bottom
-
-    def draw(self):
-        """Draws the coordinate system."""
-        # Draw the frame
-        coords = self.bbox.coords
-        self.context.set_source_rgb(0., 0., 0.)
-        self.context.set_line_width(1)
-        self.context.rectangle(coords[0], coords[1], \
-            coords[2]-coords[0], coords[3]-coords[1])
-        self.context.stroke()
-
-    def local_to_context(self, x, y):
-        """Converts local coordinates to the context coordinate system (given
-        by the bounding box).
-        """
-        return (x-self._ox)*self._sx+self._ox2, self._oy2-(y-self._oy)*self._sy
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/edge.py igraph-0.6.5/interfaces/python/igraph/drawing/edge.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/edge.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/edge.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,254 +0,0 @@
-"""
-Drawers for various edge styles in graph plots.
-"""
-
-__all__ = ["AbstractEdgeDrawer", "AlphaVaryingEdgeDrawer",
-           "ArrowEdgeDrawer", "DarkToLightEdgeDrawer",
-           "LightToDarkEdgeDrawer", "TaperedEdgeDrawer"]
-
-__license__ = "GPL"
-
-try:
-    from cairo import LinearGradient
-except ImportError:
-    # No cairo support is installed. Don't worry, there will
-    # be a fake Cairo module in igraph.drawing
-    pass
-
-from igraph.drawing.colors import clamp
-from math import atan2, cos, pi, sin
-
-class AbstractEdgeDrawer(object):
-    """Abstract edge drawer object from which all concrete edge drawer
-    implementations are derived."""
-
-    def __init__(self, context):
-        """Constructs the edge drawer.
-
-        @param context: a Cairo context on which the edges will be drawn.
-        """
-        self.context = context
-
-    @staticmethod
-    def _curvature_to_float(value):
-        """Converts values given to the 'curved' edge style argument
-        in plotting calls to floating point values."""
-        if value is None or value is False:
-            return 0.0
-        if value is True:
-            return 0.5
-        return float(value)
-
-    def draw_directed_edge(self, edge, src_vertex, dest_vertex):
-        """Draws a directed edge.
-
-        @param edge: the edge to be drawn. Visual properties of the edge
-          are defined by the attributes of this object.
-        @param src_vertex: the source vertex. Visual properties are given
-          again as attributes.
-        @param dest_vertex: the target vertex. Visual properties are given
-          again as attributes.
-        """
-        raise NotImplementedError()
-
-    def draw_loop_edge(self, edge, vertex):
-        """Draws a loop edge.
-
-        The default implementation draws a small circle.
-
-        @param edge: the edge to be drawn. Visual properties of the edge
-          are defined by the attributes of this object.
-        @param vertex: the vertex to which the edge is attached. Visual
-          properties are given again as attributes.
-        """
-        ctx = self.context
-        ctx.set_source_rgba(*edge.color)
-        ctx.set_line_width(edge.width)
-        radius = vertex.size * 1.5
-        center_x = vertex.position[0] + cos(pi/4) * radius / 2.
-        center_y = vertex.position[1] - sin(pi/4) * radius / 2.
-        ctx.arc(center_x, center_y, radius/2., 0, pi * 2)
-        ctx.stroke()
-
-    def draw_undirected_edge(self, edge, src_vertex, dest_vertex):
-        """Draws an undirected edge.
-
-        The default implementation of this method draws undirected edges
-        as straight lines. Loop edges are drawn as small circles.
-
-        @param edge: the edge to be drawn. Visual properties of the edge
-          are defined by the attributes of this object.
-        @param src_vertex: the source vertex. Visual properties are given
-          again as attributes.
-        @param dest_vertex: the target vertex. Visual properties are given
-          again as attributes.
-        """
-        if src_vertex == dest_vertex:    # TODO
-            return self.draw_loop_edge(edge, src_vertex)
-
-        ctx = self.context
-        ctx.set_source_rgba(*edge.color)
-        ctx.set_line_width(edge.width)
-        ctx.move_to(*src_vertex.position)
-
-        if edge.curved:
-            (x1, y1), (x2, y2) = src_vertex.position, dest_vertex.position
-            aux1 = (2*x1+x2) / 3.0 - edge.curved * 0.5 * (y2-y1), \
-                   (2*y1+y2) / 3.0 + edge.curved * 0.5 * (x2-x1)
-            aux2 = (x1+2*x2) / 3.0 - edge.curved * 0.5 * (y2-y1), \
-                   (y1+2*y2) / 3.0 + edge.curved * 0.5 * (x2-x1)
-            ctx.curve_to(aux1[0], aux1[1], aux2[0], aux2[1], *dest_vertex.position)
-        else:
-            ctx.line_to(*dest_vertex.position)
-
-        ctx.stroke()
-
-
-class ArrowEdgeDrawer(AbstractEdgeDrawer):
-    """Edge drawer implementation that draws undirected edges as
-    straight lines and directed edges as arrows.
-    """
-
-    def draw_directed_edge(self, edge, src_vertex, dest_vertex):
-        if src_vertex == dest_vertex:    # TODO
-            return self.draw_loop_edge(edge, src_vertex)
-
-        ctx = self.context
-        (x1, y1), (x2, y2) = src_vertex.position, dest_vertex.position
-
-
-        # Draw the edge
-        ctx.set_source_rgba(*edge.color)
-        ctx.set_line_width(edge.width)
-        ctx.move_to(x1, y1)
-
-        if edge.curved:
-            # Calculate the curve
-            aux1 = (2*x1+x2) / 3.0 - edge.curved * 0.5 * (y2-y1), \
-                   (2*y1+y2) / 3.0 + edge.curved * 0.5 * (x2-x1)
-            aux2 = (x1+2*x2) / 3.0 - edge.curved * 0.5 * (y2-y1), \
-                   (y1+2*y2) / 3.0 + edge.curved * 0.5 * (x2-x1)
-            ctx.curve_to(aux1[0], aux1[1], aux2[0], aux2[1], x2, y2)
-            x1, y1 = aux2
-        else:
-            # Draw the line
-            ctx.line_to(x2, y2)
-
-        # Determine where the edge intersects the circumference of the
-        # vertex shape.
-        x2, y2 = dest_vertex.shape.intersection_point(
-                x2, y2, x1, y1, dest_vertex.size)
-
-        ctx.stroke()
-
-        # Draw the arrowhead
-        angle = atan2(y2-y1, x2-x1)
-        arrow_size  = 15. * edge.arrow_size
-        arrow_width = 10. / edge.arrow_width
-        aux_points = [
-            (x2 - arrow_size * cos(angle - pi/arrow_width),
-             y2 - arrow_size * sin(angle - pi/arrow_width)),
-            (x2 - arrow_size * cos(angle + pi/arrow_width),
-             y2 - arrow_size * sin(angle + pi/arrow_width)),
-        ]
-        ctx.move_to(x2, y2)
-        ctx.line_to(*aux_points[0])
-        ctx.line_to(*aux_points[1])
-        ctx.line_to(x2, y2)
-        ctx.fill()
-
-
-class TaperedEdgeDrawer(AbstractEdgeDrawer):
-    """Edge drawer implementation that draws undirected edges as
-    straight lines and directed edges as tapered lines that are
-    wider at the source and narrow at the destination.
-    """
-
-    def draw_directed_edge(self, edge, src_vertex, dest_vertex):
-        if src_vertex == dest_vertex:    # TODO
-            return self.draw_loop_edge(edge, src_vertex)
-
-        # Determine where the edge intersects the circumference of the
-        # destination vertex.
-        src_pos, dest_pos = src_vertex.position, dest_vertex.position
-        dest_pos = dest_vertex.shape.intersection_point(
-                dest_pos[0], dest_pos[1], src_pos[0], src_pos[1],
-                dest_vertex.size
-        )
-
-        ctx = self.context
-
-        # Draw the edge
-        ctx.set_source_rgba(*edge.color)
-        ctx.set_line_width(edge.width)
-        angle = atan2(dest_pos[1]-src_pos[1], dest_pos[0]-src_pos[0])
-        arrow_size  = src_vertex.size / 4.
-        aux_points = [
-            (src_pos[0] + arrow_size * cos(angle + pi/2),
-             src_pos[1] + arrow_size * sin(angle + pi/2)),
-            (src_pos[0] + arrow_size * cos(angle - pi/2),
-             src_pos[1] + arrow_size * sin(angle - pi/2))
-        ]
-        ctx.move_to(*dest_pos)
-        ctx.line_to(*aux_points[0])
-        ctx.line_to(*aux_points[1])
-        ctx.line_to(*dest_pos)
-        ctx.fill()
-
-
-class AlphaVaryingEdgeDrawer(AbstractEdgeDrawer):
-    """Edge drawer implementation that draws undirected edges as
-    straight lines and directed edges by varying the alpha value
-    of the specified edge color between the source and the destination.
-    """
-
-    def __init__(self, context, alpha_at_src, alpha_at_dest):
-        super(AlphaVaryingEdgeDrawer, self).__init__(context)
-        self.alpha_at_src = (clamp(float(alpha_at_src), 0., 1.), )
-        self.alpha_at_dest = (clamp(float(alpha_at_dest), 0., 1.), )
-
-    def draw_directed_edge(self, edge, src_vertex, dest_vertex):
-        if src_vertex == dest_vertex:    # TODO
-            return self.draw_loop_edge(edge, src_vertex)
-
-        src_pos, dest_pos = src_vertex.position, dest_vertex.position
-        ctx = self.context
-
-        # Set up the gradient
-        lg = LinearGradient(src_pos[0], src_pos[1], dest_pos[0], dest_pos[1])
-        edge_color = edge.color[:3] + self.alpha_at_src
-        edge_color_end = edge_color[:3] + self.alpha_at_dest
-        lg.add_color_stop_rgba(0, *edge_color)
-        lg.add_color_stop_rgba(1, *edge_color_end)
-
-        # Draw the edge
-        ctx.set_source(lg)
-        ctx.set_line_width(edge.width)
-        ctx.move_to(*src_pos)
-        ctx.line_to(*dest_pos)
-        ctx.stroke()
-
-
-class LightToDarkEdgeDrawer(AlphaVaryingEdgeDrawer):
-    """Edge drawer implementation that draws undirected edges as
-    straight lines and directed edges by using an alpha value of
-    zero (total transparency) at the source and an alpha value of
-    one (full opacity) at the destination. The alpha value is
-    interpolated in-between.
-    """
-
-    def __init__(self, context):
-        super(LightToDarkEdgeDrawer, self).__init__(context, 0.0, 1.0)
-
-
-class DarkToLightEdgeDrawer(AlphaVaryingEdgeDrawer):
-    """Edge drawer implementation that draws undirected edges as
-    straight lines and directed edges by using an alpha value of
-    one (full opacity) at the source and an alpha value of zero
-    (total transparency) at the destination. The alpha value is
-    interpolated in-between.
-    """
-
-    def __init__(self, context):
-        super(DarkToLightEdgeDrawer, self).__init__(context, 1.0, 0.0)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/graph.py igraph-0.6.5/interfaces/python/igraph/drawing/graph.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/graph.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/graph.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,840 +0,0 @@
-"""
-Drawing routines to draw graphs.
-
-This module contains routines to draw graphs on:
-
-  - Cairo surfaces (L{DefaultGraphDrawer})
-  - UbiGraph displays (L{UbiGraphDrawer}, see U{http://ubietylab.net/ubigraph})
-
-It also contains routines to send an igraph graph directly to
-(U{Cytoscape<http://www.cytoscape.org>}) using the
-(U{CytoscapeRPC plugin<http://gforge.nbic.nl/projects/cytoscaperpc/>}), see
-L{CytoscapeGraphDrawer}. L{CytoscapeGraphDrawer} can also fetch the current
-network from Cytoscape and convert it to igraph format.
-"""
-
-from collections import defaultdict
-from itertools import izip
-from math import atan2, cos, pi, sin, tan
-from warnings import warn
-
-from igraph._igraph import convex_hull, VertexSeq
-from igraph.compat import property
-from igraph.configuration import Configuration
-from igraph.drawing.baseclasses import AbstractDrawer, AbstractCairoDrawer, \
-                                       AbstractXMLRPCDrawer
-from igraph.drawing.colors import color_to_html_format, color_name_to_rgb
-from igraph.drawing.edge import ArrowEdgeDrawer
-from igraph.drawing.text import TextDrawer
-from igraph.drawing.metamagic import AttributeCollectorBase, \
-                                     AttributeSpecification
-from igraph.drawing.shapes import ShapeDrawerDirectory, PolygonDrawer
-from igraph.drawing.utils import Point
-from igraph.layout import Layout
-
-__all__ = ["DefaultGraphDrawer", "UbiGraphDrawer", "CytoscapeGraphDrawer"]
-__license__ = "GPL"
-
-try:
-    import cairo
-except ImportError:
-    # No cairo support is installed. Create a fake module
-    # pylint: disable-msg=C0103
-    from igraph.drawing.utils import FakeModule
-    cairo = FakeModule()
-
-#####################################################################
-
-# pylint: disable-msg=R0903
-# R0903: too few public methods
-class AbstractGraphDrawer(AbstractDrawer):
-    """Abstract class that serves as a base class for anything that
-    draws an igraph.Graph."""
-
-    # pylint: disable-msg=W0221
-    # W0221: argument number differs from overridden method
-    # E1101: Module 'cairo' has no 'foo' member - of course it does :)
-    def draw(self, graph, *args, **kwds):
-        """Abstract method, must be implemented in derived classes."""
-        raise NotImplementedError("abstract class")
-
-    def ensure_layout(self, layout, graph = None):
-        """Helper method that ensures that I{layout} is an instance
-        of L{Layout}. If it is not, the method will try to convert
-        it to a L{Layout} according to the following rules:
-
-          - If I{layout} is a string, it is assumed to be a name
-            of an igraph layout, and it will be passed on to the
-            C{layout} method of the given I{graph} if I{graph} is
-            not C{None}.
-
-          - If I{layout} is C{None}, the C{layout} method of
-            I{graph} will be invoked with no parameters, which
-            will call the default layout algorithm.
-
-          - Otherwise, I{layout} will be passed on to the constructor
-            of L{Layout}. This handles lists of lists, lists of tuples
-            and such.
-
-        If I{layout} is already a L{Layout} instance, it will still
-        be copied and a copy will be returned. This is because graph
-        drawers are allowed to transform the layout for their purposes,
-        and we don't want the transformation to propagate back to the
-        caller.
-        """
-        if isinstance(layout, Layout):
-            layout = Layout(layout.coords)
-        elif isinstance(layout, str) or layout is None:
-            layout = graph.layout(layout)
-        else:
-            layout = Layout(layout)
-        return layout
-
-#####################################################################
-
-class AbstractCairoGraphDrawer(AbstractGraphDrawer, AbstractCairoDrawer):
-    """Abstract base class for graph drawers that draw on a Cairo canvas.
-    """
-
-    def __init__(self, context, bbox):
-        """Constructs the graph drawer and associates it to the given
-        Cairo context and the given L{BoundingBox}.
-
-        @param context: the context on which we will draw
-        @param bbox:    the bounding box within which we will draw.
-                        Can be anything accepted by the constructor
-                        of L{BoundingBox} (i.e., a 2-tuple, a 4-tuple
-                        or a L{BoundingBox} object).
-        """
-        AbstractCairoDrawer.__init__(self, context, bbox)
-        AbstractGraphDrawer.__init__(self)
-
-#####################################################################
-
-class DefaultGraphDrawer(AbstractCairoGraphDrawer):
-    """Class implementing the default visualisation of a graph.
-
-    The default visualisation of a graph draws the nodes on a 2D plane
-    according to a given L{Layout}, then draws a straight or curved
-    edge between nodes connected by edges. This is the visualisation
-    used when one invokes the L{plot()} function on a L{Graph} object.
-
-    See L{Graph.__plot__()} for the keyword arguments understood by
-    this drawer."""
-
-    def __init__(self, context, bbox, \
-                 edge_drawer_factory = ArrowEdgeDrawer,
-                 label_drawer_factory = TextDrawer):
-        """Constructs the graph drawer and associates it to the given
-        Cairo context and the given L{BoundingBox}.
-
-        @param context: the context on which we will draw
-        @param bbox:    the bounding box within which we will draw.
-                        Can be anything accepted by the constructor
-                        of L{BoundingBox} (i.e., a 2-tuple, a 4-tuple
-                        or a L{BoundingBox} object).
-        @param edge_drawer_factory: a factory method that returns an
-                        L{AbstractEdgeDrawer} instance bound to a
-                        given Cairo context. You can use any of the
-                        actual L{AbstractEdgeDrawer} implementations
-                        here to control the style of edges drawn by
-                        igraph. The default edge drawer is
-                        L{ArrowEdgeDrawer}.
-        @param label_drawer_factory: a factory method that returns a
-                        L{TextDrawer} instance bound to a given Cairo
-                        context. The default label drawer is L{TextDrawer}.
-        """
-        AbstractCairoGraphDrawer.__init__(self, context, bbox)
-        self.edge_drawer_factory = edge_drawer_factory
-        self.label_drawer_factory = label_drawer_factory
-
-    # pylint: disable-msg=W0142,W0221,E1101
-    # W0142: Used * or ** magic
-    # W0221: argument number differs from overridden method
-    # E1101: Module 'cairo' has no 'foo' member - of course it does :)
-    def draw(self, graph, palette, *args, **kwds):
-        # Some abbreviations for sake of simplicity
-        directed = graph.is_directed()
-        context = self.context
-
-        # Calculate/get the layout of the graph
-        layout = self.ensure_layout(kwds.get("layout", None), graph)
-
-        # Determine the size of the margin on each side
-        margin = kwds.get("margin", 0)
-        try:
-            margin = list(margin)
-        except TypeError:
-            margin = [margin]
-        while len(margin)<4:
-            margin.extend(margin)
-        # margin = [x + 20. for x in margin[:4]]
-
-        # Contract the drawing area by the margin and fit the layout
-        bbox = self.bbox.contract(margin)
-        layout.fit_into(bbox, keep_aspect_ratio=False)
-
-        # Decide whether we need to calculate the curvature of edges
-        # automatically -- and calculate them if needed.
-        autocurve = kwds.get("autocurve", None)
-        if autocurve or (autocurve is None and \
-                "edge_curved" not in kwds and "curved" not in graph.edge_attributes() \
-                and graph.ecount() < 10000):
-            from igraph import autocurve
-            default = kwds.get("edge_curved", 0)
-            if default is True:
-                default = 0.5
-            default = float(default)
-            kwds["edge_curved"] = autocurve(graph, attribute=None, default=default)
-
-        # Construct the visual vertex/edge builders
-        class VisualVertexBuilder(AttributeCollectorBase):
-            """Collects some visual properties of a vertex for drawing"""
-            _kwds_prefix = "vertex_"
-            color = ("red", palette.get)
-            frame_color = ("black", palette.get)
-            frame_width = 1.0
-            label = None
-            label_angle = -pi/2
-            label_dist  = 0.0
-            label_color = ("black", palette.get)
-            label_size  = 14.0
-            position = dict(func=layout.__getitem__)
-            shape = ("circle", ShapeDrawerDirectory.resolve_default)
-            size  = 20.0
-
-        class VisualEdgeBuilder(AttributeCollectorBase):
-            """Collects some visual properties of an edge for drawing"""
-            _kwds_prefix = "edge_"
-            arrow_size  = 1.0
-            arrow_width = 1.0
-            color       = ("#444", palette.get)
-            curved      = (0.0, ArrowEdgeDrawer._curvature_to_float)
-            width       = 1.0
-
-        vertex_builder = VisualVertexBuilder(graph.vs, kwds)
-        edge_builder = VisualEdgeBuilder(graph.es, kwds)
-
-        # Draw the highlighted groups (if any)
-        if "mark_groups" in kwds:
-            mark_groups = kwds["mark_groups"]
-
-            # Figure out what to do with mark_groups in order to be able to
-            # iterate over it and get memberlist-color pairs
-            if isinstance(mark_groups, dict):
-                group_iter = mark_groups.iteritems()
-            elif hasattr(mark_groups, "__iter__"):
-                # Lists, tuples, iterators etc
-                group_iter = iter(mark_groups)
-            else:
-                # False
-                group_iter = {}.iteritems()
-
-            # We will need a polygon drawer to draw the convex hulls
-            polygon_drawer = PolygonDrawer(context, bbox)
-
-            # Iterate over color-memberlist pairs
-            for group, color_id in group_iter:
-                if not group or color_id is None:
-                    continue
-
-                color = palette.get(color_id)
-
-                if isinstance(group, VertexSeq):
-                    group = [vertex.index for vertex in group]
-                if not hasattr(group, "__iter__"):
-                    raise TypeError("group membership list must be iterable")
-
-                # Get the vertex indices that constitute the convex hull
-                hull = [group[i] for i in convex_hull([layout[idx] for idx in group])]
-
-                # Calculate the preferred rounding radius for the corners
-                corner_radius = 1.25 * max(vertex_builder[idx].size for idx in hull)
-
-                # Construct the polygon
-                polygon = [layout[idx] for idx in hull]
-
-                if len(polygon) == 2:
-                    # Expand the polygon (which is a flat line otherwise)
-                    a, b = Point(*polygon[0]), Point(*polygon[1])
-                    c = corner_radius * (a-b).normalized()
-                    n = Point(-c[1], c[0])
-                    polygon = [a + n, b + n, b - c, b - n, a - n, a + c]
-                else:
-                    # Expand the polygon around its center of mass
-                    center = Point(*[sum(coords) / float(len(coords))
-                                      for coords in zip(*polygon)])
-                    polygon = [Point(*point).towards(center, -corner_radius)
-                               for point in polygon]
-
-                # Draw the hull
-                context.set_source_rgba(color[0], color[1], color[2],
-                                        color[3]*0.25)
-                polygon_drawer.draw_path(polygon, corner_radius=corner_radius)
-                context.fill_preserve()
-                context.set_source_rgba(*color)
-                context.stroke()
-
-        # Draw the edges
-        edge_drawer = self.edge_drawer_factory(context)
-        if directed:
-            drawer_method = edge_drawer.draw_directed_edge
-        else:
-            drawer_method = edge_drawer.draw_undirected_edge
-        for edge, visual_edge in izip(graph.es, edge_builder):
-            src, dest = edge.tuple
-            src_vertex, dest_vertex = vertex_builder[src], vertex_builder[dest]
-            drawer_method(visual_edge, src_vertex, dest_vertex)
-
-        # Calculate the desired vertex order
-        if "vertex_order" in kwds:
-            # Vertex order specified explicitly
-            vertex_order = kwds["vertex_order"]
-        elif kwds.get("vertex_order_by") is not None:
-            # Vertex order by another attribute
-            vertex_order_by = kwds["vertex_order_by"]
-            if isinstance(vertex_order_by, tuple):
-                vertex_order_by, reverse = vertex_order_by
-                if isinstance(reverse, basestring) and reverse.lower().startswith("asc"):
-                    reverse = False
-                else:
-                    reverse = bool(reversed)
-            else:
-                reverse = False
-            attrs = graph.vs[vertex_order_by]
-            vertex_order = sorted(range(graph.vcount()), key=attrs.__getitem__,
-                    reverse=reverse)
-            del attrs
-        else:
-            # Default vertex order
-            vertex_order = None
-
-        if vertex_order is None:
-            # Default vertex order
-            vertex_coord_iter = izip(vertex_builder, layout)
-        else:
-            # Specified vertex order
-            vertex_coord_iter = ((vertex_builder[i], layout[i])
-                    for i in vertex_order)
-
-        # Draw the vertices
-        context.set_line_width(1)
-        for vertex, coords in vertex_coord_iter:
-            vertex.shape.draw_path(context, \
-                    coords[0], coords[1], vertex.size)
-            context.set_source_rgba(*vertex.color)
-            context.fill_preserve()
-            context.set_source_rgba(*vertex.frame_color)
-            context.set_line_width(vertex.frame_width)
-            context.stroke()
-
-        # Draw the vertex labels
-        context.select_font_face("sans-serif", cairo.FONT_SLANT_NORMAL, \
-            cairo.FONT_WEIGHT_NORMAL)
-
-        wrap = kwds.get("wrap_labels", None)
-        if wrap is None:
-            wrap = Configuration.instance()["plotting.wrap_labels"]
-        else:
-            wrap = bool(wrap)
-
-        if vertex_order is None:
-            # Default vertex order
-            vertex_coord_iter = izip(vertex_builder, layout)
-        else:
-            # Specified vertex order
-            vertex_coord_iter = ((vertex_builder[i], layout[i])
-                    for i in vertex_order)
-
-        label_drawer = self.label_drawer_factory(context)
-        for vertex, coords in vertex_coord_iter:
-            if vertex.label is None:
-                continue
-
-            context.set_font_size(vertex.label_size)
-            context.set_source_rgba(*vertex.label_color)
-            label_drawer.text = vertex.label
-
-            if vertex.label_dist:
-                # Label is displaced from the center of the vertex.
-                _, yb, w, h, _, _ = label_drawer.text_extents()
-                w, h = w/2.0, h/2.0
-                radius = vertex.label_dist * vertex.size / 2.
-                # First we find the reference point that is at distance `radius'
-                # from the vertex in the direction given by `label_angle'.
-                # Then we place the label in a way that the line connecting the
-                # center of the bounding box of the label with the center of the
-                # vertex goes through the reference point and the reference
-                # point lies exactly on the bounding box of the vertex.
-                alpha = vertex.label_angle % (2*pi)
-                cx = coords[0] + radius * cos(alpha)
-                cy = coords[1] - radius * sin(alpha)
-                # Now we have the reference point. We have to decide which side
-                # of the label box will intersect with the line that connects
-                # the center of the label with the center of the vertex.
-                if w > 0:
-                    beta = atan2(h, w) % (2*pi)
-                else:
-                    beta = pi/2.
-                gamma = pi - beta
-                if alpha > 2*pi-beta or alpha <= beta:
-                    # Intersection at left edge of label
-                    cx += w
-                    cy -= tan(alpha) * w
-                elif alpha > beta and alpha <= gamma:
-                    # Intersection at bottom edge of label
-                    try:
-                        cx += h / tan(alpha)
-                    except:
-                        pass    # tan(alpha) == inf
-                    cy -= h
-                elif alpha > gamma and alpha <= gamma + 2*beta:
-                    # Intersection at right edge of label
-                    cx -= w
-                    cy += tan(alpha) * w
-                else:
-                    # Intersection at top edge of label
-                    try:
-                        cx -= h / tan(alpha)
-                    except:
-                        pass    # tan(alpha) == inf
-                    cy += h
-                # Draw the label
-                label_drawer.draw_at(cx-w, cy-h-yb, wrap=wrap)
-            else:
-                # Label is exactly in the center of the vertex
-                cx, cy = coords
-                half_size = vertex.size / 2.
-                label_drawer.bbox = (cx - half_size, cy - half_size,
-                                     cx + half_size, cy + half_size)
-                label_drawer.draw(wrap=wrap)
-
-#####################################################################
-
-class UbiGraphDrawer(AbstractXMLRPCDrawer, AbstractGraphDrawer):
-    """Graph drawer that draws a given graph on an UbiGraph display
-    using the XML-RPC API of UbiGraph.
-
-    The following vertex attributes are supported: C{color}, C{label},
-    C{shape}, C{size}. See the Ubigraph documentation for supported shape
-    names. Sizes are relative to the default Ubigraph size.
-
-    The following edge attributes are supported: C{color}, C{label},
-    C{width}. Edge widths are relative to the default Ubigraph width.
-
-    All color specifications supported by igraph (e.g., color names,
-    palette indices, RGB triplets, RGBA quadruplets, HTML format)
-    are understood by the Ubigraph graph drawer.
-
-    The drawer also has two attributes, C{vertex_defaults} and
-    C{edge_defaults}. These are dictionaries that can be used to
-    set default values for the vertex/edge attributes in Ubigraph.
-    """
-
-    def __init__(self, url="http://localhost:20738/RPC2"):
-        """Constructs an UbiGraph drawer using the display at the given
-        URL."""
-        super(UbiGraphDrawer, self).__init__(url, "ubigraph")
-        self.vertex_defaults = dict(
-            color="#ff0000",
-            shape="cube",
-            size=1.0
-        )
-        self.edge_defaults = dict(
-            color="#ffffff",
-            width=1.0
-        )
-
-    def draw(self, graph, *args, **kwds):
-        """Draws the given graph on an UbiGraph display.
-        
-        @keyword clear: whether to clear the current UbiGraph display before
-                        plotting. Default: C{True}."""
-        display = self.service
-
-        # Clear the display and set the default visual attributes
-        if kwds.get("clear", True):
-            display.clear()
-
-            for k, v in self.vertex_defaults.iteritems():
-                display.set_vertex_style_attribute(0, k, str(v))
-            for k, v in self.edge_defaults.iteritems():
-                display.set_edge_style_attribute(0, k, str(v))
-
-        # Custom color converter function
-        def color_conv(color):
-            return color_to_html_format(color_name_to_rgb(color))
-
-        # Construct the visual vertex/edge builders
-        class VisualVertexBuilder(AttributeCollectorBase):
-            """Collects some visual properties of a vertex for drawing"""
-            _kwds_prefix = "vertex_"
-            color = (str(self.vertex_defaults["color"]), color_conv)
-            label = None
-            shape = str(self.vertex_defaults["shape"])
-            size  = float(self.vertex_defaults["size"])
-
-        class VisualEdgeBuilder(AttributeCollectorBase):
-            """Collects some visual properties of an edge for drawing"""
-            _kwds_prefix = "edge_"
-            color = (str(self.edge_defaults["color"]), color_conv)
-            label = None
-            width = float(self.edge_defaults["width"])
-
-        vertex_builder = VisualVertexBuilder(graph.vs, kwds)
-        edge_builder = VisualEdgeBuilder(graph.es, kwds)
-
-        # Add the vertices
-        n = graph.vcount()
-        new_vertex = display.new_vertex
-        vertex_ids = [new_vertex() for _ in xrange(n)]
-
-        # Add the edges
-        new_edge = display.new_edge
-        eids = [new_edge(vertex_ids[edge.source], vertex_ids[edge.target]) \
-                for edge in graph.es]
-
-        # Add arrowheads if needed
-        if graph.is_directed():
-            display.set_edge_style_attribute(0, "arrow", "true")
-
-        # Set the vertex attributes
-        set_attr = display.set_vertex_attribute
-        vertex_defaults = self.vertex_defaults
-        for vertex_id, vertex in izip(vertex_ids, vertex_builder):
-            if vertex.color != vertex_defaults["color"]:
-                set_attr(vertex_id, "color", vertex.color)
-            if vertex.label:
-                set_attr(vertex_id, "label", str(vertex.label))
-            if vertex.shape != vertex_defaults["shape"]:
-                set_attr(vertex_id, "shape", vertex.shape)
-            if vertex.size != vertex_defaults["size"]:
-                set_attr(vertex_id, "size", str(vertex.size))
-
-        # Set the edge attributes
-        set_attr = display.set_edge_attribute
-        edge_defaults = self.edge_defaults
-        for edge_id, edge in izip(eids, edge_builder):
-            if edge.color != edge_defaults["color"]:
-                set_attr(edge_id, "color", edge.color)
-            if edge.label:
-                set_attr(edge_id, "label", edge.label)
-            if edge.width != edge_defaults["width"]:
-                set_attr(edge_id, "width", str(edge.width))
-
-#####################################################################
-
-class CytoscapeGraphDrawer(AbstractXMLRPCDrawer, AbstractGraphDrawer):
-    """Graph drawer that sends/receives graphs to/from Cytoscape using
-    CytoscapeRPC.
-    
-    This graph drawer cooperates with U{Cytoscape<http://www.cytoscape.org>}
-    using U{CytoscapeRPC<http://wiki.nbic.nl/index.php/CytoscapeRPC>}.
-    You need to install the CytoscapeRPC plugin first and start the
-    XML-RPC server on a given port (port 9000 by default) from the
-    appropriate Plugins submenu in Cytoscape.
-
-    Graph, vertex and edge attributes are transferred to Cytoscape whenever
-    possible (i.e. when a suitable mapping exists between a Python type
-    and a Cytoscape type). If there is no suitable Cytoscape type for a
-    Python type, the drawer will use a string attribute on the Cytoscape
-    side and invoke C{str()} on the Python attributes.
-
-    If an attribute to be created on the Cytoscape side already exists with
-    a different type, an underscore will be appended to the attribute name
-    to resolve the type conflict.
-
-    You can use the C{network_id} attribute of this class to figure out the
-    network ID of the last graph drawn with this drawer.
-    """
-
-    def __init__(self, url="http://localhost:9000/Cytoscape"):
-        """Constructs a Cytoscape graph drawer using the XML-RPC interface
-        of Cytoscape at the given URL."""
-        super(CytoscapeGraphDrawer, self).__init__(url, "Cytoscape")
-        self.network_id = None
-
-    def draw(self, graph, name="Network from igraph", create_view=True,
-            *args, **kwds):
-        """Sends the given graph to Cytoscape as a new network.
-        
-        @param name: the name of the network in Cytoscape.
-        @param create_view: whether to create a view for the network
-          in Cytoscape.The default is C{True}.
-        @keyword node_ids: specifies the identifiers of the nodes to
-          be used in Cytoscape. This must either be the name of a
-          vertex attribute or a list specifying the identifiers, one
-          for each node in the graph. The default is C{None}, which
-          simply uses the vertex index for each vertex."""
-        from xmlrpclib import Fault
-
-        cy = self.service
-
-        # Create the network
-        if not create_view:
-            try:
-                network_id = cy.createNetwork(name, False)
-            except Fault:
-                warn("CytoscapeRPC too old, cannot create network without view."
-                    " Consider upgrading CytoscapeRPC to use this feature.")
-                network_id = cy.createNetwork(name)
-        else:
-            network_id = cy.createNetwork(name)
-        self.network_id = network_id
-
-        # Create the nodes
-        if "node_ids" in kwds:
-            node_ids = kwds["node_ids"]
-            if isinstance(node_ids, basestring):
-                node_ids = graph.vs[node_ids]
-        else:
-            node_ids = xrange(graph.vcount())
-        node_ids = [str(identifier) for identifier in node_ids]
-        cy.createNodes(network_id, node_ids)
-
-        # Create the edges
-        edgelists = [[], []]
-        for v1, v2 in graph.get_edgelist():
-            edgelists[0].append(node_ids[v1])
-            edgelists[1].append(node_ids[v2])
-        edge_ids = cy.createEdges(network_id,
-                edgelists[0], edgelists[1],
-                ["unknown"] * graph.ecount(),
-                [graph.is_directed()] * graph.ecount(),
-                False
-        )
-
-        if "layout" in kwds:
-            # Calculate/get the layout of the graph
-            layout = self.ensure_layout(kwds["layout"], graph)
-            size = 100 * graph.vcount() ** 0.5
-            layout.fit_into((size, size), keep_aspect_ratio=True)
-            layout.translate(-size/2., -size/2.)
-            cy.setNodesPositions(network_id,
-                    node_ids, *zip(*list(layout)))
-        else:
-            # Ask Cytoscape to perform the default layout so the user can
-            # at least see something in Cytoscape while the attributes are
-            # being transferred
-            cy.performDefaultLayout(network_id)
-
-        # Send the network attributes
-        attr_names = set(cy.getNetworkAttributeNames())
-        for attr in graph.attributes():
-            cy_type, value = self.infer_cytoscape_type([graph[attr]])
-            value = value[0]
-            if value is None:
-                continue
-
-            # Resolve type conflicts (if any)
-            try:
-                while attr in attr_names and \
-                      cy.getNetworkAttributeType(attr) != cy_type:
-                    attr += "_"
-            except Fault:
-                # getNetworkAttributeType is not available in some older versions
-                # so we simply pass here
-                pass
-            cy.addNetworkAttributes(attr, cy_type, {network_id: value})
-
-        # Send the node attributes
-        attr_names = set(cy.getNodeAttributeNames())
-        for attr in graph.vertex_attributes():
-            cy_type, values = self.infer_cytoscape_type(graph.vs[attr])
-            values = dict(pair for pair in izip(node_ids, values)
-                    if pair[1] is not None)
-            # Resolve type conflicts (if any)
-            while attr in attr_names and \
-                  cy.getNodeAttributeType(attr) != cy_type:
-                attr += "_"
-            # Send the attribute values
-            cy.addNodeAttributes(attr, cy_type, values, True)
-
-        # Send the edge attributes
-        attr_names = set(cy.getEdgeAttributeNames())
-        for attr in graph.edge_attributes():
-            cy_type, values = self.infer_cytoscape_type(graph.es[attr])
-            values = dict(pair for pair in izip(edge_ids, values)
-                    if pair[1] is not None)
-            # Resolve type conflicts (if any)
-            while attr in attr_names and \
-                  cy.getEdgeAttributeType(attr) != cy_type:
-                attr += "_"
-            # Send the attribute values
-            cy.addEdgeAttributes(attr, cy_type, values)
-
-    def fetch(self, name = None, directed = False, keep_canonical_names = False):
-        """Fetches the network with the given name from Cytoscape.
-        
-        When fetching networks from Cytoscape, the C{canonicalName} attributes
-        of vertices and edges are not converted by default. Use the
-        C{keep_canonical_names} parameter to retrieve these attributes as well.
-
-        @param name: the name of the network in Cytoscape.
-        @param directed: whether the network is directed.
-        @param keep_canonical_names: whether to keep the C{canonicalName}
-            vertex/edge attributes that are added automatically by Cytoscape
-        @return: an appropriately constructed igraph L{Graph}."""
-        from igraph import Graph
-
-        cy = self.service
-
-        # Check the version number. Anything older than 1.3 is bad.
-        version = cy.version()
-        if " " in version:
-            version = version.split(" ")[0]
-        version = tuple(map(int, version.split(".")[:2]))
-        if version < (1, 3):
-            raise NotImplementedError("CytoscapeGraphDrawer requires "
-                                      "Cytoscape-RPC 1.3 or newer")
-
-        # Find out the ID of the network we are interested in
-        if name is None:
-            network_id = cy.getNetworkID()
-        else:
-            network_id = [k for k, v in cy.getNetworkList().iteritems()
-                          if v == name]
-            if not network_id:
-                raise ValueError("no such network: %r" % name)
-            elif len(network_id) > 1:
-                raise ValueError("more than one network exists with name: %r" % name)
-            network_id = network_id[0]
-
-        # Fetch the list of all the nodes and edges
-        vertices = cy.getNodes(network_id)
-        edges = cy.getEdges(network_id)
-        n, m = len(vertices), len(edges)
-
-        # Fetch the graph attributes
-        graph_attrs = cy.getNetworkAttributes(network_id)
-
-        # Fetch the vertex attributes
-        vertex_attr_names = cy.getNodeAttributeNames()
-        vertex_attrs = {}
-        for attr_name in vertex_attr_names:
-            if attr_name == "canonicalName" and not keep_canonical_names:
-                continue
-            has_attr = cy.nodesHaveAttribute(attr_name, vertices)
-            filtered = [idx for idx, ok in enumerate(has_attr) if ok]
-            values = cy.getNodesAttributes(attr_name,
-                    [name for name, ok in izip(vertices, has_attr) if ok]
-            )
-            attrs = [None] * n
-            for idx, value in izip(filtered, values):
-                attrs[idx] = value
-            vertex_attrs[attr_name] = attrs
-
-        # Fetch the edge attributes
-        edge_attr_names = cy.getEdgeAttributeNames()
-        edge_attrs = {}
-        for attr_name in edge_attr_names:
-            if attr_name == "canonicalName" and not keep_canonical_names:
-                continue
-            has_attr = cy.edgesHaveAttribute(attr_name, edges)
-            filtered = [idx for idx, ok in enumerate(has_attr) if ok]
-            values = cy.getEdgesAttributes(attr_name,
-                    [name for name, ok in izip(edges, has_attr) if ok]
-            )
-            attrs = [None] * m
-            for idx, value in izip(filtered, values):
-                attrs[idx] = value
-            edge_attrs[attr_name] = attrs
-
-        # Create a vertex name index
-        vertex_name_index = dict((v, k) for k, v in enumerate(vertices))
-        del vertices
-
-        # Remap the edges list to numeric IDs
-        edge_list = []
-        for edge in edges:
-            parts = edge.split()
-            edge_list.append((vertex_name_index[parts[0]], vertex_name_index[parts[2]]))
-        del edges
-
-        return Graph(n, edge_list, directed=directed,
-                graph_attrs=graph_attrs, vertex_attrs=vertex_attrs,
-                edge_attrs=edge_attrs)
-
-    @staticmethod
-    def infer_cytoscape_type(values):
-        """Returns a Cytoscape type that can be used to represent all the
-        values in `values` and an appropriately converted copy of `values` that
-        is suitable for an XML-RPC call.  Note that the string type in
-        Cytoscape is used as a catch-all type; if no other type fits, attribute
-        values will be converted to string and then posted to Cytoscape.
-        
-        ``None`` entries are allowed in `values`, they will be ignored on the
-        Cytoscape side.
-        """
-        types = [type(value) for value in values if value is not None]
-        if all(t == bool for t in types):
-            return "BOOLEAN", values
-        if all(issubclass(t, (int, long)) for t in types):
-            return "INTEGER", values
-        if all(issubclass(t, float) for t in types):
-            return "FLOATING", values
-        return "STRING", [
-                str(value) if not isinstance(value, basestring) else value
-                for value in values
-        ]
-
-#####################################################################
-
-class GephiGraphStreamingDrawer(AbstractGraphDrawer):
-    """Graph drawer that sends a graph to a file-like object (e.g., socket, URL
-    connection, file) using the Gephi graph streaming format.
-
-    The Gephi graph streaming format is a simple JSON-based format that can be used
-    to post mutations to a graph (i.e. node and edge additions, removals and updates)
-    to a remote component. For instance, one can open up Gephi (U{http://www.gephi.org}),
-    install the Gephi graph streaming plugin and then send a graph from igraph
-    straight into the Gephi window by using C{GephiGraphStreamingDrawer} with the
-    appropriate URL where Gephi is listening.
-
-    The C{connection} property exposes the L{GephiConnection} that the drawer
-    uses. The drawer also has a property called C{streamer} which exposes the underlying
-    L{GephiGraphStreamer} that is responsible for generating the JSON objects,
-    encoding them and writing them to a file-like object. If you want to customize
-    the encoding process, this is the object where you can tweak things to your taste.
-    """
-
-    def __init__(self, conn=None, *args, **kwds):
-        """Constructs a Gephi graph streaming drawer that will post graphs to the
-        given Gephi connection. If C{conn} is C{None}, the remaining arguments of
-        the constructor are forwarded intact to the constructor of
-        L{GephiConnection} in order to create a connection. This means that any of
-        the following are valid:
-
-          - C{GephiGraphStreamingDrawer()} will construct a drawer that connects to
-            workspace 0 of the local Gephi instance on port 8080.
-
-          - C{GephiGraphStreamingDrawer(workspace=2)} will connect to workspace 2
-            of the local Gephi instance on port 8080.
-
-          - C{GephiGraphStreamingDrawer(port=1234)} will connect to workspace 0
-            of the local Gephi instance on port 1234.
-
-          - C{GephiGraphStreamingDrawer(host="remote", port=1234, workspace=7)}
-            will connect to workspace 7 of the Gephi instance on host C{remote},
-            port 1234.
-
-          - C{GephiGraphStreamingDrawer(url="http://remote:1234/workspace7)} is
-            the same as above, but with an explicit URL.
-        """
-        super(GephiGraphStreamingDrawer, self).__init__()
-
-        from igraph.remote.gephi import GephiGraphStreamer, GephiConnection
-        self.connection = conn or GephiConnection(*args, **kwds)
-        self.streamer = GephiGraphStreamer()
-
-    def draw(self, graph, *args, **kwds):
-        """Draws (i.e. sends) the given graph to the destination of the drawer using
-        the Gephi graph streaming API.
-        
-        The following keyword arguments are allowed:
-            
-            - ``encoder`` lets one specify an instance of ``json.JSONEncoder`` that
-              will be used to encode the JSON objects.
-        """
-        self.streamer.post(graph, self.connection, encoder=kwds.get("encoder"))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/metamagic.py igraph-0.6.5/interfaces/python/igraph/drawing/metamagic.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/metamagic.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/metamagic.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,356 +0,0 @@
-"""Auxiliary classes for the default graph drawer in igraph.
-
-This module contains heavy metaclass magic. If you don't understand
-the logic behind these classes, probably you don't need them either.
-
-igraph's default graph drawer uses various data sources to determine
-the visual appearance of vertices and edges. These data sources
-are the following (in order of precedence):
-
-  - The keyword arguments passed to the L{igraph.plot()} function
-    (or to L{igraph.Graph.__plot__()} as a matter of fact, since
-    L{igraph.plot()} just passes these attributes on). For instance,
-    a keyword argument named C{vertex_label} can be used to set
-    the labels of vertices.
-
-  - The attributes of the vertices/edges being drawn. For instance,
-    a vertex that has a C{label} attribute will use that label when
-    drawn by the default graph drawer.
-
-  - The global configuration of igraph. For instance, if the global
-    L{igraph.config.Configuration} instance has a key called
-    C{plotting.vertex_color}, that will be used as a default color
-    for the vertices.
-
-  - If all else fails, there is a built-in default; for instance,
-    the default vertex color is C{"red"}. This is hard-wired in the
-    source code.
-
-The logic above can be useful in other graph drawers as well, not
-only in the default one, therefore it is refactored into the classes
-found in this module. Different graph drawers may inspect different
-vertex or edge attributes, hence the classes that collect the attributes
-from the various data sources are generated in run-time using a
-metaclass called L{AttributeCollectorMeta}. You don't have to use
-L{AttributeCollectorMeta} directly, just implement a subclass of
-L{AttributeCollectorBase} and it will ensure that the appropriate
-metaclass is used. With L{AttributeCollectorBase}, you can use a
-simple declarative syntax to specify which attributes you are
-interested in. For example::
-
-    class VisualEdgeBuilder(AttributeCollectorBase):
-        arrow_size = 1.0
-        arrow_width = 1.0
-        color = ("black", palette.get)
-        width = 1.0
-
-    for edge in VisualEdgeBuilder(graph.es):
-        print edge.color
-
-The above class is a visual edge builder -- a class that gives the
-visual attributes of the edges of a graph that is specified at
-construction time. It specifies that the attributes we are interested
-in are C{arrow_size}, C{arrow_width}, C{color} and C{width}; the
-default values are also given. For C{color}, we also specify that
-a method called {palette.get} should be called on every attribute
-value to translate color names to RGB values. For the other three
-attributes, C{float} will implicitly be called on all attribute values,
-this is inferred from the type of the default value itself.
-
-@see: AttributeCollectorMeta, AttributeCollectorBase
-"""
-
-from ConfigParser import NoOptionError
-from itertools import izip
-
-from igraph.configuration import Configuration
-
-__all__ = ["AttributeSpecification", "AttributeCollectorBase"]
-
-# pylint: disable-msg=R0903
-# R0903: too few public methods
-class AttributeSpecification(object):
-    """Class that describes how the value of a given attribute should be
-    retrieved.
-    
-    The class contains the following members:
-        
-        - C{name}: the name of the attribute. This is also used when we
-          are trying to get its value from a vertex/edge attribute of a
-          graph.
-          
-        - C{alt_name}: alternative name of the attribute. This is used
-          when we are trying to get its value from a Python dict or an
-          L{igraph.Configuration} object. If omitted at construction time,
-          it will be equal to C{name}.
-          
-        - C{default}: the default value of the attribute when none of
-          the sources we try can provide a meaningful value.
-          
-        - C{transform}: optional transformation to be performed on the
-          attribute value. If C{None} or omitted, it defaults to the
-          type of the default value.
-
-        - C{func}: when given, this function will be called with an
-          index in order to derive the value of the attribute.
-    """
-
-    __slots__ = ("name", "alt_name", "default", "transform", "accessor",
-                 "func")
-
-    def __init__(self, name, default=None, alt_name=None, transform=None,
-                 func=None):
-        if isinstance(default, tuple):
-            default, transform = default
-
-        self.name = name
-        self.default = default
-        self.alt_name = alt_name or name
-        self.transform = transform or None
-        self.func = func
-        self.accessor = None
-
-        if self.transform and not hasattr(self.transform, "__call__"):
-            raise TypeError, "transform must be callable"
-
-        if self.transform is None and self.default is not None:
-            self.transform = type(self.default)
-
-
-class AttributeCollectorMeta(type):
-    """Metaclass for attribute collector classes
-    
-    Classes that use this metaclass are intended to collect vertex/edge
-    attributes from various sources (a Python dict, a vertex/edge sequence,
-    default values from the igraph configuration and such) in a given
-    order of precedence. See the module documentation for more details.
-    This metaclass enables the user to use a simple declarative syntax
-    to specify which attributes he is interested in. For each vertex/edge
-    attribute, a corresponding class attribute must be defined with a
-    value that describes the default value of that attribute if no other
-    data source provides us with any suitable value. The default value
-    can also be a tuple; in that case, the first element of the tuple
-    is the actual default value, the second element is a converter
-    function that will convert the attribute values to a format expected
-    by the caller who uses the class being defined.
-
-    There is a special class attribute called C{_kwds_prefix}; this is
-    not used as an attribute declaration. It can contain a string which
-    will be used to derive alternative names for the attributes when
-    the attribute is accessed in a Python dict. This is useful in many
-    situations; for instance, the default graph drawer would want to access
-    the vertex colors using the C{color} vertex attribute, but when
-    it looks at the keyword arguments passed to the original call of
-    L{igraph.Graph.__plot__}, the C{vertex_color} keyword argument should
-    be looked up because we also have colors for the edges. C{_kwds_prefix}
-    will be prepended to the attribute names when they are looked up in
-    a dict of keyword arguments.
-
-    If you require a more fine-tuned behaviour, you can assign an
-    L{AttributeSpecification} instance to a class attribute directly.
-
-    @see: AttributeCollectorBase
-    """
-
-    def __new__(mcs, name, bases, attrs):
-        attr_specs = []
-        for attr, value in attrs.iteritems():
-            if attr.startswith("_") or hasattr(value, "__call__"):
-                continue
-            if isinstance(value, AttributeSpecification):
-                attr_spec = value
-            elif isinstance(value, dict):
-                attr_spec = AttributeSpecification(attr, **value)
-            else:
-                attr_spec = AttributeSpecification(attr, value)
-            attr_specs.append(attr_spec)
-
-        prefix = attrs.get("_kwds_prefix", None)
-        if prefix:
-            for attr_spec in attr_specs:
-                if attr_spec.name == attr_spec.alt_name:
-                    attr_spec.alt_name = "%s%s" % (prefix, attr_spec.name)
-
-        attrs["_attributes"] = attr_specs
-        attrs["Element"] = mcs.record_generator(
-                "%s.Element" % name,
-                (attr_spec.name for attr_spec in attr_specs)
-        )
-
-        return super(AttributeCollectorMeta, mcs).__new__(mcs, \
-                name, bases, attrs)
-
-    @classmethod
-    def record_generator(mcs, name, slots):
-        """Generates a simple class that has the given slots and nothing else"""
-        class Element(object):
-            """A simple class that holds the attributes collected by the
-            attribute collector"""
-            __slots__ = tuple(slots)
-            def __init__(self, attrs=()):
-                for attr, value in attrs:
-                    setattr(self, attr, value)
-        Element.__name__ = name
-        return Element
-
-
-class AttributeCollectorBase(object):
-    """Base class for attribute collector subclasses. Classes that inherit
-    this class may use a declarative syntax to specify which vertex or edge
-    attributes they intend to collect. See L{AttributeCollectorMeta} for
-    the details.
-    """
-
-    __metaclass__ = AttributeCollectorMeta
-
-    def __init__(self, seq, kwds = None):
-        """Constructs a new attribute collector that uses the given
-        vertex/edge sequence and the given dict as data sources.
-
-        @param seq: an L{igraph.VertexSeq} or L{igraph.EdgeSeq} class
-          that will be used as a data source for attributes.
-        @param kwds: a Python dict that will be used to override the
-          attributes collected from I{seq} if necessary.
-        """
-        elt = self.__class__.Element
-        self._cache = [elt() for _ in xrange(len(seq))]
-
-        self.seq = seq
-        self.kwds = kwds or {}
-
-        for attr_spec in self._attributes:
-            values = self._collect_attributes(attr_spec) 
-            attr_name = attr_spec.name
-            for cache_elt, val in izip(self._cache, values):
-                setattr(cache_elt, attr_name, val)
-
-    def _collect_attributes(self, attr_spec, config=None):
-        """Collects graph visualization attributes from various sources.
-
-        This method can be used to collect the attributes required for graph
-        visualization from various sources. Attribute value sources are:
-
-          - A specific value of a Python dict belonging to a given key. This dict
-            is given by the argument M{self.kwds} at construction time, and
-            the name of the key is determined by the argument specification
-            given in M{attr_spec}.
-
-          - A vertex or edge sequence of a graph, given in M{self.seq}
-
-          - The global configuration, given in M{config}
-
-          - A default value when all other sources fail to provide the value.
-            This is also given in M{attr_spec}.
-
-        @param  attr_spec: an L{AttributeSpecification} object which contains
-                           the name of the attribute when it is coming from a
-                           list of Python keyword arguments, the name of the
-                           attribute when it is coming from the graph attributes
-                           directly, the default value of the attribute and an
-                           optional callable transformation to call on the values.
-                           This can be used to ensure that the attributes are of
-                           a given type.
-        @param  config:    a L{Configuration} object to be used for determining the
-                           defaults if all else fails. If C{None}, the global
-                           igraph configuration will be used
-        @return: the collected attributes
-        """
-        kwds = self.kwds
-        seq = self.seq
-
-        n = len(seq)
-
-        # Special case if the attribute name is "label" 
-        if attr_spec.name == "label":
-            if attr_spec.alt_name in kwds and kwds[attr_spec.alt_name] is None:
-                return [None] * n
-
-        # If the attribute uses an external callable to derive the attribute
-        # values, call it and store the results
-        if attr_spec.func is not None:
-            func = attr_spec.func
-            result = [func(i) for i in xrange(n)]
-            return result
-
-        # Get the configuration object
-        if config is None:
-            config = Configuration.instance()
-
-        # Fetch the defaults from the vertex/edge sequence
-        try:
-            attrs = seq[attr_spec.name]
-        except KeyError:
-            attrs = None
-
-        # Override them from the keyword arguments (if any)
-        result = kwds.get(attr_spec.alt_name, None)
-        if attrs:
-            if not result:
-                result = attrs
-            else:
-                if isinstance(result, str):
-                    result = [result] * n
-                try:
-                    len(result)
-                except TypeError:
-                    result = [result] * n
-                result = [result[idx] or attrs[idx] \
-                          for idx in xrange(len(result))]
-
-        # Special case for string overrides, strings are not treated
-        # as sequences here
-        if isinstance(result, str):
-            result = [result] * n
-
-        # If the result is still not a sequence, make it one
-        try:
-            len(result)
-        except TypeError:
-            result = [result] * n
-
-        # If it is not a list, ensure that it is a list
-        if not hasattr(result, "extend"):
-            result = list(result)
-
-        # Ensure that the length is n
-        while len(result) < n:
-            if len(result) <= n/2:
-                result.extend(result)
-            else:
-                result.extend(result[0:(n-len(result))])
-
-        # By now, the length of the result vector should be n as requested
-        # Get the configuration defaults
-        try:
-            default = config["plotting.%s" % attr_spec.alt_name]
-        except NoOptionError:
-            default = None
-
-        if default is None:
-            default = attr_spec.default
-
-        # Fill the None values with the default values
-        for idx in xrange(len(result)):
-            if result[idx] is None:
-                result[idx] = default
-
-        # Finally, do the transformation
-        if attr_spec.transform is not None:
-            transform = attr_spec.transform
-            result = [transform(x) for x in result]
-
-        return result
-
-
-    def __getitem__(self, index):
-        """Returns the collected attributes of the vertex/edge with the
-        given index."""
-        # pylint: disable-msg=E1101
-        # E1101: instance has no '_attributes' member
-        return self._cache[index]
-
-    def __len__(self):
-        return len(self.seq)
-
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/shapes.py igraph-0.6.5/interfaces/python/igraph/drawing/shapes.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/shapes.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/shapes.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,458 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Shape drawing classes for igraph
-
-Vertex shapes in igraph are usually referred to by short names like
-C{"rect"} or C{"circle"}. This module contains the classes that
-implement the actual drawing routines for these shapes, and a
-resolver class that determines the appropriate shape drawer class
-given the short name.
-
-Classes that are derived from L{ShapeDrawer} in this module are
-automatically registered by L{ShapeDrawerDirectory}. If you
-implement a custom shape drawer, you must register it in
-L{ShapeDrawerDirectory} manually if you wish to refer to it by a
-name in the C{shape} attribute of vertices.
-"""
-
-from __future__ import division
-
-__all__ = ["ShapeDrawerDirectory"]
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-from math import atan2, copysign, cos, pi, sin
-import sys
-
-from igraph.drawing.baseclasses import AbstractCairoDrawer
-from igraph.drawing.utils import Point
-from igraph.utils import consecutive_pairs
-
-class ShapeDrawer(object):
-    """Static class, the ancestor of all vertex shape drawer classes.
-    
-    Custom shapes must implement at least the C{draw_path} method of the class.
-    The method I{must not} stroke or fill, it should just set up the current
-    Cairo path appropriately."""
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws the path of the shape on the given Cairo context, without
-        stroking or filling it.
-
-        This method must be overridden in derived classes implementing custom shapes
-        and declared as a static method using C{staticmethod(...)}.
-
-        @param ctx: the context to draw on
-        @param center_x: the X coordinate of the center of the object
-        @param center_y: the Y coordinate of the center of the object
-        @param width: the width of the object
-        @param height: the height of the object. If C{None}, equals to the width.
-        """
-        raise NotImplementedError("abstract class")
-
-    # pylint: disable-msg=W0613
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the shape centered at (center_x, center_y)
-        intersects with a line drawn from (source_x, source_y) to
-        (center_x, center_y).
-
-        Can be overridden in derived classes. Must always be defined as a static
-        method using C{staticmethod(...)}
-
-        @param width: the width of the shape
-        @param height: the height of the shape. If C{None}, defaults to the width
-        @return: the intersection point (the closest to (source_x, source_y) if
-            there are more than one) or (center_x, center_y) if there is no
-            intersection
-        """
-        return center_x, center_y
-
-
-class NullDrawer(ShapeDrawer):
-    """Static drawer class which draws nothing.
-
-    This class is used for graph vertices with unknown shapes"""
-    names = ["null", "none", "empty", "hidden", ""]
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws nothing."""
-        pass
-
-
-class RectangleDrawer(ShapeDrawer):
-    """Static class which draws rectangular vertices"""
-    names = "rectangle rect rectangular square box"
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws a rectangle-shaped path on the Cairo context without stroking
-        or filling it.
-        @see: ShapeDrawer.draw_path"""
-        height = height or width
-        ctx.rectangle(center_x - width/2, center_y - height/2,
-                width, height)
-
-    # pylint: disable-msg=C0103, R0911
-    # R0911: too many return statements
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the rectangle centered at (center_x, center_y)
-        having the given width and height intersects with a line drawn from
-        (source_x, source_y) to (center_x, center_y).
-
-        @see: ShapeDrawer.intersection_point"""
-        height = height or width
-        delta_x, delta_y = center_x-source_x, center_y-source_y
-
-        if delta_x == 0 and delta_y == 0:
-            return center_x, center_y
-
-        if delta_y > 0 and delta_x <= delta_y and delta_x >= -delta_y:
-            # this is the top edge
-            ry = center_y - height/2
-            ratio = (height/2) / delta_y
-            return center_x-ratio*delta_x, ry
-
-        if delta_y < 0 and delta_x <= -delta_y and delta_x >= delta_y:
-            # this is the bottom edge
-            ry = center_y + height/2
-            ratio = (height/2) / -delta_y
-            return center_x-ratio*delta_x, ry
-
-        if delta_x > 0 and delta_y <= delta_x and delta_y >= -delta_x:
-            # this is the left edge
-            rx = center_x - width/2
-            ratio = (width/2) / delta_x
-            return rx, center_y-ratio*delta_y
-
-        if delta_x < 0 and delta_y <= -delta_x and delta_y >= delta_x:
-            # this is the right edge
-            rx = center_x + width/2
-            ratio = (width/2) / -delta_x
-            return rx, center_y-ratio*delta_y
-
-        if delta_x == 0:
-            if delta_y > 0:
-                return center_x, center_y - height/2
-            return center_x, center_y + height/2
-
-        if delta_y == 0:
-            if delta_x > 0:
-                return center_x - width/2, center_y
-            return center_x + width/2, center_y
-
-
-class CircleDrawer(ShapeDrawer):
-    """Static class which draws circular vertices"""
-    names = "circle circular"
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws a circular path on the Cairo context without stroking or
-        filling it.
-
-        Height is ignored, it is the width that determines the diameter of the circle.
-
-        @see: ShapeDrawer.draw_path"""
-        ctx.arc(center_x, center_y, width/2, 0, 2*pi)
-
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the circle centered at (center_x, center_y)
-        intersects with a line drawn from (source_x, source_y) to
-        (center_x, center_y).
-
-        @see: ShapeDrawer.intersection_point"""
-        height = height or width
-        angle = atan2(center_y-source_y, center_x-source_x)
-        return center_x-width/2 * cos(angle), \
-               center_y-height/2* sin(angle)
-
-
-class UpTriangleDrawer(ShapeDrawer):
-    """Static class which draws upright triangles"""
-    names = "triangle triangle-up up-triangle arrow arrow-up up-arrow"
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws an upright triangle on the Cairo context without stroking or
-        filling it.
-        
-        @see: ShapeDrawer.draw_path"""
-        height = height or width
-        ctx.move_to(center_x-width/2, center_y+height/2)
-        ctx.line_to(center_x, center_y-height/2)
-        ctx.line_to(center_x+width/2, center_y+height/2)
-        ctx.close_path()
-
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the triangle centered at (center_x, center_y)
-        intersects with a line drawn from (source_x, source_y) to
-        (center_x, center_y).
-
-        @see: ShapeDrawer.intersection_point"""
-        # TODO: finish it properly
-        height = height or width
-        return center_x, center_y
-
-class DownTriangleDrawer(ShapeDrawer):
-    """Static class which draws triangles pointing down"""
-    names = "down-triangle triangle-down arrow-down down-arrow"
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws a triangle on the Cairo context without stroking or
-        filling it.
-        
-        @see: ShapeDrawer.draw_path"""
-        height = height or width
-        ctx.move_to(center_x-width/2, center_y-height/2)
-        ctx.line_to(center_x, center_y+height/2)
-        ctx.line_to(center_x+width/2, center_y-height/2)
-        ctx.close_path()
-
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the triangle centered at (center_x, center_y)
-        intersects with a line drawn from (source_x, source_y) to
-        (center_x, center_y).
-
-        @see: ShapeDrawer.intersection_point"""
-        # TODO: finish it properly
-        height = height or width
-        return center_x, center_y
-
-class DiamondDrawer(ShapeDrawer):
-    """Static class which draws diamonds (i.e. rhombuses)"""
-    names = "diamond rhombus"
-
-    @staticmethod
-    def draw_path(ctx, center_x, center_y, width, height=None):
-        """Draws a rhombus on the Cairo context without stroking or
-        filling it.
-        
-        @see: ShapeDrawer.draw_path"""
-        height = height or width
-        ctx.move_to(center_x-width/2, center_y)
-        ctx.line_to(center_x, center_y+height/2)
-        ctx.line_to(center_x+width/2, center_y)
-        ctx.line_to(center_x, center_y-height/2)
-        ctx.close_path()
-
-    @staticmethod
-    def intersection_point(center_x, center_y, source_x, source_y, \
-            width, height=None):
-        """Determines where the rhombus centered at (center_x, center_y)
-        intersects with a line drawn from (source_x, source_y) to
-        (center_x, center_y).
-
-        @see: ShapeDrawer.intersection_point"""
-        height = height or width
-
-        if height == 0 and width == 0:
-            return center_x, center_y
-
-        delta_x, delta_y = source_x - center_x, source_y - center_y
-
-        # Treat edge case when delta_x = 0
-        if delta_x == 0:
-            if delta_y == 0:
-                return center_x, center_y
-            else:
-                return center_x, center_y + copysign(height / 2, delta_y)
-
-        width = copysign(width, delta_x)
-        height = copysign(height, delta_y)
-
-        f = height / (height + width * delta_y / delta_x)
-        return center_x + f * width / 2, center_y + (1-f) * height / 2
-
-#####################################################################
-
-class PolygonDrawer(AbstractCairoDrawer):
-    """Class that is used to draw polygons.
-    
-    The corner points of the polygon can be set by the C{points}
-    property of the drawer, or passed at construction time. Most
-    drawing methods in this class also have an extra C{points}
-    argument that can be used to override the set of points in the
-    C{points} property."""
-
-    def __init__(self, context, bbox=(1, 1), points = []):
-        """Constructs a new polygon drawer that draws on the given
-        Cairo context.
-
-        @param  context: the Cairo context to draw on
-        @param  bbox:    ignored, leave it at its default value
-        @param  points:  the list of corner points
-        """
-        super(PolygonDrawer, self).__init__(context, bbox)
-        self.points = points
-
-    def draw_path(self, points=None, corner_radius=0):
-        """Sets up a Cairo path for the outline of a polygon on the given
-        Cairo context.
-
-        @param points: the coordinates of the corners of the polygon,
-          in clockwise or counter-clockwise order, or C{None} if we are
-          about to use the C{points} property of the class.
-        @param corner_radius: if zero, an ordinary polygon will be drawn.
-          If positive, the corners of the polygon will be rounded with
-          the given radius.
-        """
-        if points is None:
-            points = self.points
-
-        self.context.new_path()
-
-        if len(points) < 2:
-            # Well, a polygon must have at least two corner points
-            return
-
-        ctx = self.context
-        if corner_radius <= 0:
-            # No rounded corners, this is simple
-            ctx.move_to(*points[-1])
-            for point in points:
-                ctx.line_to(*point)
-            return
-
-        # Rounded corners. First, we will take each side of the
-        # polygon and find what the corner radius should be on
-        # each corner. If the side is longer than 2r (where r is
-        # equal to corner_radius), the radius allowed by that side
-        # is r; if the side is shorter, the radius is the length
-        # of the side / 2. For each corner, the final corner radius
-        # is the smaller of the radii on the two sides adjacent to
-        # the corner.
-        points = [Point(*point) for point in points]
-        side_vecs = [v-u for u, v in consecutive_pairs(points, circular=True)]
-        half_side_lengths = [side.length() / 2 for side in side_vecs]
-        corner_radii = [corner_radius] * len(points)
-        for idx in xrange(len(corner_radii)):
-            prev_idx = -1 if idx == 0 else idx - 1
-            radii = [corner_radius, half_side_lengths[prev_idx],
-                     half_side_lengths[idx]]
-            corner_radii[idx] = min(radii)
-
-        # Okay, move to the last corner, adjusted by corner_radii[-1]
-        # towards the first corner
-        ctx.move_to(*(points[-1].towards(points[0], corner_radii[-1])))
-        # Now, for each point in points, draw a line towards the
-        # corner, stopping before it in a distance of corner_radii[idx],
-        # then draw the corner
-        u = points[-1]
-        for idx, (v, w) in enumerate(consecutive_pairs(points, True)):
-            radius = corner_radii[idx]
-            ctx.line_to(*v.towards(u, radius))
-            aux1 = v.towards(u, radius / 2)
-            aux2 = v.towards(w, radius / 2)
-            ctx.curve_to(aux1.x, aux1.y, aux2.x, aux2.y,
-                         *v.towards(w, corner_radii[idx]))
-            u = v
-
-    def draw(self, points=None):
-        """Draws the polygon using the current stroke of the Cairo context.
-
-        @param points: the coordinates of the corners of the polygon,
-          in clockwise or counter-clockwise order, or C{None} if we are
-          about to use the C{points} property of the class.
-        """
-        self.draw_path(points)
-        self.context.stroke()
-
-#####################################################################
-
-class ShapeDrawerDirectory(object):
-    """Static class that resolves shape names to their corresponding
-    shape drawer classes.
-        
-    Classes that are derived from L{ShapeDrawer} in this module are
-    automatically registered by L{ShapeDrawerDirectory} when the module
-    is loaded for the first time.
-    """
-
-    known_shapes = {}
-
-    @classmethod
-    def register(cls, drawer_class):
-        """Registers the given shape drawer class under the given names.
-
-        @param drawer_class: the shape drawer class to be registered
-        """
-        names = drawer_class.names
-        if isinstance(names, (str, unicode)):
-            names = names.split()
-
-        for name in names:
-            cls.known_shapes[name] = drawer_class
-
-    @classmethod
-    def register_namespace(cls, namespace):
-        """Registers all L{ShapeDrawer} classes in the given namespace
-
-        @param namespace: a Python dict mapping names to Python objects."""
-        for name, value in namespace.iteritems():
-            if name.startswith("__"):
-                continue
-            if isinstance(value, type):
-                if issubclass(value, ShapeDrawer) and value != ShapeDrawer:
-                    cls.register(value)
-
-    @classmethod
-    def resolve(cls, shape):
-        """Given a shape name, returns the corresponding shape drawer class
-        
-        @param shape: the name of the shape
-        @return: the corresponding shape drawer class
-
-        @raise ValueError: if the shape is unknown
-        """
-        try:
-            return cls.known_shapes[shape]
-        except KeyError:
-            raise ValueError("unknown shape: %s" % shape)
-
-    @classmethod
-    def resolve_default(cls, shape, default=NullDrawer):
-        """Given a shape name, returns the corresponding shape drawer class
-        or the given default shape drawer if the shape name is unknown.
-        
-        @param shape: the name of the shape
-        @param default: the default shape drawer to return when the shape
-          is unknown
-        @return: the shape drawer class corresponding to the given name or
-          the default shape drawer class if the name is unknown
-        """
-        return cls.known_shapes.get(shape, default)
-
-ShapeDrawerDirectory.register_namespace(sys.modules[__name__].__dict__)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/text.py igraph-0.6.5/interfaces/python/igraph/drawing/text.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/text.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/text.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,366 +0,0 @@
-"""
-Drawers for labels on plots.
-
-@undocumented: test
-"""
-
-import re
-
-from igraph.compat import property
-from igraph.drawing.baseclasses import AbstractCairoDrawer
-from warnings import warn
-
-__all__ = ["TextDrawer"]
-__license__ = "GPL"
-
-__docformat__ = "restructuredtext en" 
-
-#####################################################################
-
-class TextDrawer(AbstractCairoDrawer):
-    """Class that draws text on a Cairo context.
-    
-    This class supports multi-line text unlike the original Cairo text
-    drawing methods."""
-
-    LEFT, CENTER, RIGHT = "left", "center", "right"
-    TOP, BOTTOM = "top", "bottom"
-
-    def __init__(self, context, text="", halign="center", valign="center"):
-        """Constructs a new instance that will draw the given `text` on
-        the given Cairo `context`."""
-        super(TextDrawer, self).__init__(context, (0, 0))
-        self.text = text
-        self.halign = halign
-        self.valign = valign
-
-    def draw(self, wrap=False):
-        """Draws the text in the current bounding box of the drawer.
-        
-        Since the class itself is an instance of `AbstractCairoDrawer`, it
-        has an attribute named ``bbox`` which will be used as a bounding
-        box.
-        
-        :Parameters:
-          wrap : boolean
-            whether to allow re-wrapping of the text if it does not fit
-            within the bounding box horizontally.
-        """
-        ctx = self.context
-        bbox = self.bbox
-
-        text_layout = self.get_text_layout(bbox.left, bbox.top, bbox.width, wrap)
-        if not text_layout:
-            return
-
-        _, font_descent, line_height = ctx.font_extents()[:3]
-        yb = ctx.text_extents(text_layout[0][2])[1]
-        total_height = len(text_layout) * line_height
-
-        if self.valign == self.BOTTOM:
-            # Bottom vertical alignment
-            dy = bbox.height - total_height - yb + font_descent
-        elif self.valign == self.CENTER:
-            # Centered vertical alignment
-            dy = (bbox.height - total_height - yb + font_descent + line_height) / 2.
-        else:
-            # Top vertical alignment
-            dy = line_height
-
-        for ref_x, ref_y, line in text_layout:
-            ctx.move_to(ref_x, ref_y + dy)
-            ctx.show_text(line)
-        ctx.new_path()
-
-    def get_text_layout(self, x = None, y = None, width = None, wrap = False):
-        """Calculates the layout of the current text. `x` and `y` denote the
-        coordinates where the drawing should start. If they are both ``None``,
-        the current position of the context will be used.
-
-        Vertical alignment settings are not taken into account in this method
-        as the text is not drawn within a box.
-        
-        :Parameters:
-          x : float or ``None``
-            The X coordinate of the reference point where the layout should
-            start.
-          y : float or ``None``
-            The Y coordinate of the reference point where the layout should
-            start.
-          width : float or ``None``
-            The width of the box in which the text will be fitted. It matters
-            only when the text is right-aligned or centered. The text will
-            overflow the box if any of the lines is longer than the box width
-            and `wrap` is ``False``.
-          wrap : boolean
-            whether to allow re-wrapping of the text if it does not fit
-            within the given width.
-
-        :Returns:
-          a list consisting of ``(x, y, line)`` tuples where ``x`` and ``y``
-          refer to reference points on the Cairo canvas and ``line`` refers
-          to the corresponding text that should be plotted there.
-        """
-        ctx = self.context
-
-        if x is None or y is None:
-            x, y = ctx.get_current_point()
-
-        line_height = ctx.font_extents()[2]
-
-        if wrap:
-            if width and width > 0:
-                iterlines = self._iterlines_wrapped(width)
-            else:
-                warn("ignoring wrap=True as no width was specified")
-        else:
-            iterlines = self._iterlines()
-
-        result = []
-
-        if self.halign == self.CENTER:
-            # Centered alignment
-            if width is None:
-                width = self.text_extents()[2]
-            for line, line_width, x_bearing in iterlines:
-                result.append((x + (width-line_width)/2. - x_bearing, y, line))
-                y += line_height
-
-        elif self.halign == self.RIGHT:
-            # Right alignment
-            if width is None:
-                width = self.text_extents()[2]
-            x += width
-            for line, line_width, x_bearing in iterlines:
-                result.append((x - line_width - x_bearing, y, line))
-                y += line_height
-
-        else:
-            # Left alignment
-            for line, _, x_bearing in iterlines:
-                result.append((x-x_bearing, y, line))
-                y += line_height
-
-        return result
-
-    def draw_at(self, x = None, y = None, width = None, wrap = False):
-        """Draws the text by setting up an appropriate path on the Cairo
-        context and filling it. `x` and `y` denote the coordinates where the
-        drawing should start. If they are both C{None}, the current position
-        of the context will be used.
-        
-        Vertical alignment settings are not taken into account in this method
-        as the text is not drawn within a box.
-        
-        :Parameters:
-          x : float or ``None``
-            The X coordinate of the reference point where the drawing should
-            start.
-          y : float or ``None``
-            The Y coordinate of the reference point where the drawing should
-            start.
-          width : float or ``None``
-            The width of the box in which the text will be fitted. It matters
-            only when the text is right-aligned or centered. The text will
-            overflow the box if any of the lines is longer than the box width.
-          wrap : boolean
-            whether to allow re-wrapping of the text if it does not fit
-            within the given width.
-        """
-        ctx = self.context
-        for ref_x, ref_y, line in self.get_text_layout(x, y, width, wrap):
-            ctx.move_to(ref_x, ref_y)
-            ctx.show_text(line)
-        ctx.new_path()
-
-    def _iterlines(self):
-        """Iterates over the label line by line and returns a tuple containing
-        the folloing for each line: the line itself, the width of the line and
-        the X-bearing of the line."""
-        ctx = self.context
-        for line in self._text.split("\n"):
-            xb, _, line_width, _, _, _ = ctx.text_extents(line)
-            yield (line, line_width, xb)
-
-    def _iterlines_wrapped(self, width):
-        """Iterates over the label line by line and returns a tuple containing
-        the folloing for each line: the line itself, the width of the line and
-        the X-bearing of the line.
-        
-        The difference between this method and `_iterlines()` is that this
-        method is allowed to re-wrap the line if necessary.
-
-        :Parameters:
-          width : float or ``None``
-            The width of the box in which the text will be fitted. Lines will
-            be wrapped if they are wider than this width.
-        """
-        ctx = self.context
-        for line in self._text.split("\n"):
-            xb, _, line_width, _, _, _ = ctx.text_extents(line)
-            if line_width <= width:
-                yield (line, line_width, xb)
-                continue
-
-            # We have to wrap the line
-            current_line, current_width, last_sep_width = [], 0, 0
-            for match in re.finditer(r"(\S+)(\s+)?", line):
-                word, sep = match.groups()
-                word_width = ctx.text_extents(word)[4]
-                if sep:
-                    sep_width = ctx.text_extents(sep)[4]
-                else:
-                    sep_width = 0
-                current_width += word_width
-                if current_width >= width and current_line:
-                    yield ("".join(current_line), current_width - word_width, 0)
-                    # Starting a new line
-                    current_line, current_width = [word], word_width
-                    if sep is not None:
-                        current_line.append(sep)
-                else:
-                    current_width += last_sep_width
-                    current_line.append(word)
-                    if sep is not None:
-                        current_line.append(sep)
-                last_sep_width = sep_width
-            if current_line:
-                yield ("".join(current_line), current_width, 0) 
-
-    @property
-    def text(self):
-        """Returns the text to be drawn."""
-        return self._text
-
-    @text.setter
-    def text(self, text):
-        """Sets the text that will be drawn.
-        
-        If `text` is ``None``, it will be mapped to an empty string; otherwise,
-        it will be converted to a string."""
-        if text is None:
-            self._text = ""
-        else:
-            self._text = str(text)
-
-    def text_extents(self):
-        """Returns the X-bearing, Y-bearing, width, height, X-advance and
-        Y-advance of the text.
-        
-        For multi-line text, the X-bearing and Y-bearing correspond to the
-        first line, while the X-advance is extracted from the last line.
-        and the Y-advance is the sum of all the Y-advances. The width and
-        height correspond to the entire bounding box of the text."""
-        lines = self.text.split("\n")
-        if len(lines) <= 1:
-            return self.context.text_extents(self.text)
-
-        x_bearing, y_bearing, width, height, x_advance, y_advance = \
-            self.context.text_extents(lines[0])
-
-        line_height = self.context.font_extents()[2]
-        for line in lines[1:]:
-            _, _, w, _, x_advance, ya = self.context.text_extents(line)
-            width = max(width, w)
-            height += line_height
-            y_advance += ya
-
-        return x_bearing, y_bearing, width, height, x_advance, y_advance
-
-def test():
-    """Testing routine for L{TextDrawer}"""
-    import cairo
-    import math
-
-    text = "The quick brown fox\njumps over a\nlazy dog"
-    width, height = (600, 1000)
-
-    surface = cairo.ImageSurface(cairo.FORMAT_ARGB32, width, height)
-    context = cairo.Context(surface)
-    drawer = TextDrawer(context, text)
-
-    context.set_source_rgb(1, 1, 1)
-    context.set_font_size(16.)
-    context.rectangle(0, 0, width, height)
-    context.fill()
-
-    context.set_source_rgb(0.5, 0.5, 0.5)
-    for i in range(200, width, 200):
-        context.move_to(i, 0)
-        context.line_to(i, height)
-        context.stroke()
-    for i in range(200, height, 200):
-        context.move_to(0, i)
-        context.line_to(width, i)
-        context.stroke()
-    context.set_source_rgb(0.75, 0.75, 0.75)
-    context.set_line_width(0.5)
-    for i in range(100, width, 200):
-        context.move_to(i, 0)
-        context.line_to(i, height)
-        context.stroke()
-    for i in range(100, height, 200):
-        context.move_to(0, i)
-        context.line_to(width, i)
-        context.stroke()
-
-    def mark_point(red, green, blue):
-        """Marks the current point on the canvas by the given color"""
-        x, y = context.get_current_point()
-        context.set_source_rgba(red, green, blue, 0.5)
-        context.arc(x, y, 4, 0, 2 * math.pi)
-        context.fill()
-
-    # Testing drawer.draw_at()
-    for i, halign in enumerate(("left", "center", "right")):
-        # Mark the reference points
-        context.move_to(i * 200, 40)
-        mark_point(0, 0, 1)
-        context.move_to(i * 200, 140)
-        mark_point(0, 0, 1)
-
-        # Draw the text
-        context.set_source_rgb(0, 0, 0)
-        drawer.halign = halign
-        drawer.draw_at(i * 200, 40)
-        drawer.draw_at(i * 200, 140, width=200)
-
-        # Mark the new reference point
-        mark_point(1, 0, 0)
-
-    # Testing TextDrawer.draw()
-    for i, halign in enumerate(("left", "center", "right")):
-        for j, valign in enumerate(("top", "center", "bottom")):
-            # Draw the text
-            context.set_source_rgb(0, 0, 0)
-            drawer.halign = halign
-            drawer.valign = valign
-            drawer.bbox = (i*200, j*200+200, i*200+200, j*200+400)
-            drawer.draw()
-            # Mark the new reference point
-            mark_point(1, 0, 0)
-
-    # Testing TextDrawer.wrap()
-    drawer.text = "Jackdaws love my big sphinx of quartz. Yay, wrapping! " + \
-                  "Jackdaws love my big sphinx of quartz.\n\n" + \
-                  "Jackdaws  love  my  big  sphinx  of  quartz."
-    drawer.valign = TextDrawer.TOP
-    for i, halign in enumerate(("left", "center", "right")):
-        context.move_to(i * 200, 840)
-
-        # Mark the reference point
-        mark_point(0, 0, 1)
-
-        # Draw the text
-        context.set_source_rgb(0, 0, 0)
-        drawer.halign = halign
-        drawer.draw_at(i * 200, 840, width=199, wrap=True)
-
-        # Mark the new reference point
-        mark_point(1, 0, 0)
-
-    surface.write_to_png("test.png")
-
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/utils.py igraph-0.6.5/interfaces/python/igraph/drawing/utils.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/drawing/utils.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/drawing/utils.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,534 +0,0 @@
-"""
-Utility classes for drawing routines.
-"""
-
-from igraph.compat import property
-from itertools import izip
-from math import atan2, cos, sin
-from operator import itemgetter
-
-__all__ = ["BoundingBox", "FakeModule", "Point", "Rectangle"]
-__license__ = "GPL"
-
-#####################################################################
-
-class Rectangle(object):
-    """Class representing a rectangle."""
-
-    __slots__ = ("_left", "_top", "_right", "_bottom")
-
-    def __init__(self, *args):
-        """Creates a rectangle.
-
-        The corners of the rectangle can be specified by either a tuple
-        (four items, two for each corner, respectively), four separate numbers
-        (X and Y coordinates for each corner) or two separate numbers (width
-        and height, the upper left corner is assumed to be at (0,0))"""
-        coords = None
-        if len(args) == 1:
-            if isinstance(args[0], Rectangle):
-                coords = args[0].coords
-            elif len(args[0]) >= 4:
-                coords = tuple(args[0])[0:4]
-            elif len(args[0]) == 2:
-                coords = (0, 0, args[0][0], args[0][1])
-        elif len(args) == 4:
-            coords = tuple(args)
-        elif len(args) == 2:
-            coords = (0, 0, args[0], args[1])
-        if coords is None:
-            raise ValueError("invalid coordinate format")
-
-        try:
-            coords = tuple(float(coord) for coord in coords)
-        except ValueError:
-            raise ValueError("invalid coordinate format, numbers expected")
-
-        self.coords = coords
-
-    @property
-    def coords(self):
-        """The coordinates of the corners.
-        
-        The coordinates are returned as a 4-tuple in the following order:
-        left edge, top edge, right edge, bottom edge.
-        """
-        return self._left, self._top, self._right, self._bottom
-
-    @coords.setter
-    def coords(self, coords):
-        """Sets the coordinates of the corners.
-
-        @param coords: a 4-tuple with the coordinates of the corners
-        """
-        self._left, self._top, self._right, self._bottom = coords
-        if self._left > self._right:
-            self._left, self._right = self._right, self._left
-        if self._top > self._bottom:
-            self._bottom, self._top = self._top, self._bottom
-
-    @property
-    def width(self):
-        """The width of the rectangle"""
-        return self._right - self._left
-
-    @width.setter
-    def width(self, value):
-        """Sets the width of the rectangle by adjusting the right edge."""
-        self._right = self._left + value
-
-    @property
-    def height(self):
-        """The height of the rectangle"""
-        return self._bottom - self._top
-
-    @height.setter
-    def height(self, value):
-        """Sets the height of the rectangle by adjusting the bottom edge."""
-        self._bottom = self._top + value
-
-    @property
-    def left(self):
-        """The X coordinate of the left side of the box"""
-        return self._left
-
-    @left.setter
-    def left(self, value):
-        """Sets the X coordinate of the left side of the box"""
-        self._left = float(value)
-        self._right = max(self._left, self._right)
-
-    @property
-    def right(self):
-        """The X coordinate of the right side of the box"""
-        return self._right
-
-    @right.setter
-    def right(self, value):
-        """Sets the X coordinate of the right side of the box"""
-        self._right = float(value)
-        self._left = min(self._left, self._right)
-
-    @property
-    def top(self):
-        """The Y coordinate of the top edge of the box"""
-        return self._top
-
-    @top.setter
-    def top(self, value):
-        """Sets the Y coordinate of the top edge of the box"""
-        self._top = value
-        self._bottom = max(self._bottom, self._top)
-
-    @property
-    def bottom(self):
-        """The Y coordinate of the bottom edge of the box"""
-        return self._bottom
-
-    @bottom.setter
-    def bottom(self, value):
-        """Sets the Y coordinate of the bottom edge of the box"""
-        self._bottom = value
-        self._top = min(self._bottom, self._top)
-
-    @property
-    def midx(self):
-        """The X coordinate of the center of the box"""
-        return (self._left + self._right) / 2.0
-
-    @midx.setter
-    def midx(self, value):
-        """Moves the center of the box to the given X coordinate"""
-        dx = value - (self._left + self._right) / 2.0
-        self._left += dx
-        self._right += dx
-
-    @property
-    def midy(self):
-        """The Y coordinate of the center of the box"""
-        return (self._top + self._bottom) / 2.0
-
-    @midy.setter
-    def midy(self, value):
-        """Moves the center of the box to the given Y coordinate"""
-        dy = value - (self._top + self._bottom) / 2.0
-        self._top += dy
-        self._bottom += dy
-
-    @property
-    def shape(self):
-        """The shape of the rectangle (width, height)"""
-        return self._right - self._left, self._bottom - self._top
-
-    @shape.setter
-    def shape(self, shape):
-        """Sets the shape of the rectangle (width, height)."""
-        self.width, self.height = shape
-
-    def contract(self, margins):
-        """Contracts the rectangle by the given margins.
-
-        @return: a new L{Rectangle} object.
-        """
-        if isinstance(margins, int) or isinstance(margins, float):
-            margins = [float(margins)] * 4
-        if len(margins) != 4:
-            raise ValueError("margins must be a 4-tuple or a single number")
-        nx1, ny1 = self._left+margins[0], self._top+margins[1]
-        nx2, ny2 = self._right-margins[2], self._bottom-margins[3]
-        if nx1 > nx2:
-            nx1 = (nx1+nx2)/2.
-            nx2 = nx1
-        if ny1 > ny2:
-            ny1 = (ny1+ny2)/2.
-            ny2 = ny1
-        return self.__class__(nx1, ny1, nx2, ny2)
-
-    def expand(self, margins):
-        """Expands the rectangle by the given margins.
-
-        @return: a new L{Rectangle} object.
-        """
-        if isinstance(margins, int) or isinstance(margins, float):
-            return self.contract(-float(margins))
-        return self.contract([-float(margin) for margin in margins])
-
-    def isdisjoint(self, other):
-        """Returns ``True`` if the two rectangles have no intersection.
-        
-        Example::
-            
-            >>> r1 = Rectangle(10, 10, 30, 30)
-            >>> r2 = Rectangle(20, 20, 50, 50)
-            >>> r3 = Rectangle(70, 70, 90, 90)
-            >>> r1.isdisjoint(r2)
-            False
-            >>> r2.isdisjoint(r1)
-            False
-            >>> r1.isdisjoint(r3)
-            True
-            >>> r3.isdisjoint(r1)
-            True
-        """
-        return self._left > other._right or self._right < other._left \
-                or self._top > other._bottom or self._bottom < other._top
-
-    def isempty(self):
-        """Returns ``True`` if the rectangle is empty (i.e. it has zero
-        width and height).
-
-        Example::
-
-            >>> r1 = Rectangle(10, 10, 30, 30)
-            >>> r2 = Rectangle(70, 70, 90, 90)
-            >>> r1.isempty()
-            False
-            >>> r2.isempty()
-            False
-            >>> r1.intersection(r2).isempty()
-            True
-        """
-        return self._left == self._right and self._top == self._bottom
-
-    def intersection(self, other):
-        """Returns the intersection of this rectangle with another.
-        
-        Example::
-            
-            >>> r1 = Rectangle(10, 10, 30, 30)
-            >>> r2 = Rectangle(20, 20, 50, 50)
-            >>> r3 = Rectangle(70, 70, 90, 90)
-            >>> r1.intersection(r2)
-            Rectangle(20.0, 20.0, 30.0, 30.0)
-            >>> r2 & r1
-            Rectangle(20.0, 20.0, 30.0, 30.0)
-            >>> r2.intersection(r1) == r1.intersection(r2)
-            True
-            >>> r1.intersection(r3)
-            Rectangle(0.0, 0.0, 0.0, 0.0)
-        """
-        if self.isdisjoint(other):
-            return Rectangle(0, 0, 0, 0)
-        return Rectangle(max(self._left, other._left),
-                max(self._top, other._top),
-                min(self._right, other._right),
-                min(self._bottom, other._bottom))
-    __and__ = intersection
-
-    def translate(self, dx, dy):
-        """Translates the rectangle in-place.
-
-        Example:
-
-            >>> r = Rectangle(10, 20, 50, 70)
-            >>> r.translate(30, -10)
-            >>> r
-            Rectangle(40.0, 10.0, 80.0, 60.0)
-
-        @param dx: the X coordinate of the translation vector
-        @param dy: the Y coordinate of the translation vector
-        """
-        self._left += dx
-        self._right += dx
-        self._top += dy
-        self._bottom += dy
-
-    def union(self, other):
-        """Returns the union of this rectangle with another.
-        
-        The resulting rectangle is the smallest rectangle that contains both
-        rectangles.
-
-        Example::
-
-            >>> r1 = Rectangle(10, 10, 30, 30)
-            >>> r2 = Rectangle(20, 20, 50, 50)
-            >>> r3 = Rectangle(70, 70, 90, 90)
-            >>> r1.union(r2)
-            Rectangle(10.0, 10.0, 50.0, 50.0)
-            >>> r2 | r1
-            Rectangle(10.0, 10.0, 50.0, 50.0)
-            >>> r2.union(r1) == r1.union(r2)
-            True
-            >>> r1.union(r3)
-            Rectangle(10.0, 10.0, 90.0, 90.0)
-        """
-        return Rectangle(min(self._left, other._left),
-                min(self._top, other._top),
-                max(self._right, other._right),
-                max(self._bottom, other._bottom))
-    __or__ = union
-
-    def __ior__(self, other):
-        """Expands this rectangle to include itself and another completely while
-        still being as small as possible.
-
-        Example::
-
-            >>> r1 = Rectangle(10, 10, 30, 30)
-            >>> r2 = Rectangle(20, 20, 50, 50)
-            >>> r3 = Rectangle(70, 70, 90, 90)
-            >>> r1 |= r2
-            >>> r1
-            Rectangle(10.0, 10.0, 50.0, 50.0)
-            >>> r1 |= r3
-            >>> r1
-            Rectangle(10.0, 10.0, 90.0, 90.0)
-        """
-        self._left   = min(self._left,   other._left)
-        self._top    = min(self._top,    other._top)
-        self._right  = max(self._right,  other._right)
-        self._bottom = max(self._bottom, other._bottom)
-        return self
-
-    def __repr__(self):
-        return "%s(%s, %s, %s, %s)" % (self.__class__.__name__, \
-            self._left, self._top, self._right, self._bottom)
-
-    def __eq__(self, other):
-        return self.coords == other.coords
-
-    def __ne__(self, other):
-        return self.coords != other.coords
-
-    def __bool__(self):
-        return self._left != self._right or self._top != self._bottom
-
-    def __nonzero__(self):
-        return self._left != self._right or self._top != self._bottom
-
-    def __hash__(self):
-        return hash(self.coords)
-
-#####################################################################
-
-class BoundingBox(Rectangle):
-    """Class representing a bounding box (a rectangular area) that
-    encloses some objects."""
-
-    def __ior__(self, other):
-        """Replaces this bounding box with the union of itself and
-        another.
-
-        Example::
-            
-            >>> box1 = BoundingBox(10, 20, 50, 60)
-            >>> box2 = BoundingBox(70, 40, 100, 90)
-            >>> box1 |= box2
-            >>> print(box1)
-            BoundingBox(10.0, 20.0, 100.0, 90.0)
-        """
-        self._left   = min(self._left, other._left)
-        self._top    = min(self._top, other._top)
-        self._right  = max(self._right, other._right)
-        self._bottom = max(self._bottom, other._bottom)
-        return self
-
-    def __or__(self, other):
-        """Takes the union of this bounding box with another.
-
-        The result is a bounding box which encloses both bounding
-        boxes.
-        
-        Example::
-            
-            >>> box1 = BoundingBox(10, 20, 50, 60)
-            >>> box2 = BoundingBox(70, 40, 100, 90)
-            >>> box1 | box2
-            BoundingBox(10.0, 20.0, 100.0, 90.0)
-        """
-        return self.__class__(
-                       min(self._left, other._left),
-                       min(self._top, other._top),
-                       max(self._right, other._right),
-                       max(self._bottom, other._bottom)
-        )
-
-
-#####################################################################
-
-# pylint: disable-msg=R0903
-# R0903: too few public methods
-class FakeModule(object):
-    """Fake module that raises an exception for everything"""
-
-    def __getattr__(self, _):
-        raise TypeError("plotting not available")
-    def __call__(self, _):
-        raise TypeError("plotting not available")
-    def __setattr__(self, key, value):
-        raise TypeError("plotting not available")
-
-#####################################################################
-
-class Point(tuple):
-    """Class representing a point on the 2D plane."""
-    __slots__ = ()
-    _fields = ('x', 'y')
-
-    def __new__(cls, x, y):
-        """Creates a new point with the given coordinates"""
-        return tuple.__new__(cls, (x, y))
-
-    # pylint: disable-msg=W0622
-    # W0622: redefining built-in 'len'
-    @classmethod
-    def _make(cls, iterable, new = tuple.__new__, len = len):
-        """Creates a new point from a sequence or iterable"""
-        result = new(cls, iterable)
-        if len(result) != 2:
-            raise TypeError('Expected 2 arguments, got %d' % len(result))
-        return result
-
-    def __repr__(self):
-        """Returns a nicely formatted representation of the point"""
-        return 'Point(x=%r, y=%r)' % self
-
-    def _asdict(self):
-        """Returns a new dict which maps field names to their values"""
-        return dict(zip(self._fields, self))
-
-    # pylint: disable-msg=W0141
-    # W0141: used builtin function 'map'
-    def _replace(self, **kwds):
-        """Returns a new point object replacing specified fields with new
-        values"""
-        result = self._make(map(kwds.pop, ('x', 'y'), self))
-        if kwds:
-            raise ValueError('Got unexpected field names: %r' % kwds.keys())
-        return result
-
-    def __getnewargs__(self):
-        """Return self as a plain tuple. Used by copy and pickle."""
-        return tuple(self)
-
-    x = property(itemgetter(0), doc="Alias for field number 0")
-    y = property(itemgetter(1), doc="Alias for field number 1")
-
-    def __add__(self, other):
-        """Adds the coordinates of a point to another one"""
-        return self.__class__(x = self.x + other.x, y = self.y + other.y)
-
-    def __sub__(self, other):
-        """Subtracts the coordinates of a point to another one"""
-        return self.__class__(x = self.x - other.x, y = self.y - other.y)
-
-    def __mul__(self, scalar):
-        """Multiplies the coordinates by a scalar"""
-        return self.__class__(x = self.x * scalar, y = self.y * scalar)
-    __rmul__ = __mul__
-
-    def __div__(self, scalar):
-        """Divides the coordinates by a scalar"""
-        return self.__class__(x = self.x / scalar, y = self.y / scalar)
-
-    def as_polar(self):
-        """Returns the polar coordinate representation of the point.
-
-        @return: the radius and the angle in a tuple.
-        """
-        return len(self), atan2(self.y, self.x)
-
-    def distance(self, other):
-        """Returns the distance of the point from another one.
-        
-        Example:
-            
-            >>> p1 = Point(5, 7)
-            >>> p2 = Point(8, 3)
-            >>> p1.distance(p2)
-            5.0
-        """
-        dx, dy = self.x - other.x, self.y - other.y
-        return (dx * dx + dy * dy) ** 0.5
-    
-    def interpolate(self, other, ratio = 0.5):
-        """Linearly interpolates between the coordinates of this point and
-        another one.
-
-        @param  other:  the other point
-        @param  ratio:  the interpolation ratio between 0 and 1. Zero will
-          return this point, 1 will return the other point.
-        """
-        ratio = float(ratio)
-        return Point(x = self.x * (1.0 - ratio) + other.x * ratio, \
-                     y = self.y * (1.0 - ratio) + other.y * ratio)
-
-    def length(self):
-        """Returns the length of the vector pointing from the origin to this
-        point."""
-        return (self.x ** 2 + self.y ** 2) ** 0.5
-
-    def normalized(self):
-        """Normalizes the coordinates of the point s.t. its length will be 1
-        after normalization. Returns the normalized point."""
-        len = self.length()
-        if len == 0:
-            return Point(x = self.x, y = self.y)
-        return Point(x = self.x / len, y = self.y / len)
-
-    def sq_length(self):
-        """Returns the squared length of the vector pointing from the origin
-        to this point."""
-        return (self.x ** 2 + self.y ** 2)
-
-    def towards(self, other, distance = 0):
-        """Returns the point that is at a given distance from this point
-        towards another one."""
-        if not distance:
-            return self
-
-        angle = atan2(other.y - self.y, other.x - self.x)
-        return Point(self.x + distance * cos(angle),
-                     self.y + distance * sin(angle))
-
-    @classmethod
-    def FromPolar(cls, radius, angle):
-        """Constructs a point from polar coordinates.
-
-        `radius` is the distance of the point from the origin; `angle` is the
-        angle between the X axis and the vector pointing to the point from
-        the origin.
-        """
-        return cls(radius * cos(angle), radius * sin(angle))
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/formula.py igraph-0.6.5/interfaces/python/igraph/formula.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/formula.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/formula.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,235 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Implementation of `igraph.Graph.Formula()`
-
-You should use this module directly only if you have a very strong reason
-to do so. In almost all cases, you are better off with calling
-`igraph.Graph.Formula()`.
-"""
-
-from cStringIO import StringIO
-from igraph.datatypes import UniqueIdGenerator
-
-import tokenize
-import token
-
-__all__ = ["construct_graph_from_formula"]
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-def generate_edges(formula):
-    """Parses an edge specification from the head of the given
-    formula part and yields the following:
-    
-      - startpoint(s) of the edge by vertex names
-      - endpoint(s) of the edge by names or an empty list if the vertices are isolated
-      - a pair of bools to denote whether we had arrowheads at the start and end vertices 
-    """
-    if formula == "":
-        yield [], [""], [False, False]
-        return
-
-    name_tokens = set([token.NAME, token.NUMBER, token.STRING])
-    edge_chars = "<>-+"
-    start_names, end_names, arrowheads = [], [], [False, False]
-    parsing_vertices = True
-
-    # Tokenize the formula
-    token_gen = tokenize.generate_tokens(StringIO(formula).next)
-    for token_info in token_gen:
-        # Do the state transitions
-        token_type, tok, _, _, _ = token_info
-        if parsing_vertices:
-            if all(ch in edge_chars for ch in tok) and token_type == token.OP:
-                parsing_vertices = False
-                # Check the edge we currently have
-                if start_names and end_names:
-                    # We have a whole edge
-                    yield start_names, end_names, arrowheads
-                start_names, end_names = end_names, []
-                arrowheads = [False, False]
-        else:
-            if any(ch not in edge_chars for ch in tok):
-                parsing_vertices = True
-
-        if parsing_vertices:
-            # We are parsing vertex names at the moment
-            if token_type in name_tokens:
-                # We found a vertex name
-                if token_type == token.STRING:
-                    end_names.append(eval(tok))
-                else:
-                    end_names.append(str(tok))
-            elif tok == ":" and token_type == token.OP:
-                # Separating semicolon between vertex names, we just go on
-                continue
-            elif token_type == token.ENDMARKER:
-                # End markers are fine
-                pass
-            else:
-                msg = "invalid token found in edge specification: %s" % formula
-                raise SyntaxError(msg)
-        else:
-            # We are parsing an edge operator
-            if "<" in tok:
-                if ">" in tok:
-                    arrowheads = [True, True]
-                else:
-                    arrowheads[0] = True
-            elif ">" in tok:
-                arrowheads[1] = True
-            elif "+" in tok:
-                if tok[0] == "+":
-                    arrowheads[0] = True
-                if len(tok) > 1 and tok[-1] == "+":
-                    arrowheads[1] = True
-
-    # The final edge
-    yield start_names, end_names, arrowheads
-
-
-def construct_graph_from_formula(cls, formula = None, attr = "name",
-        simplify = True):
-    """Graph.Formula(formula = None, attr = "name", simplify = True)
-    
-    Generates a graph from a graph formula
-
-    A graph formula is a simple string representation of a graph.
-    It is very handy for creating small graphs quickly. The string
-    consists of vertex names separated by edge operators. An edge
-    operator is a sequence of dashes (C{-}) that may or may not
-    start with an arrowhead (C{<} at the beginning of the sequence
-    or C{>} at the end of the sequence). The edge operators can
-    be arbitrarily long, i.e., you may use as many dashes to draw
-    them as you like. This makes a total of four different edge
-    operators:
-
-      - C{-----} makes an undirected edge
-      - C{<----} makes a directed edge pointing from the vertex
-        on the right hand side of the operator to the vertex on
-        the left hand side
-      - C{---->} is the opposite of C{<----}
-      - C{<--->} creates a mutual directed edge pair between
-        the two vertices
-
-    If you only use the undirected edge operator (C{-----}),
-    the graph will be undirected. Otherwise it will be directed.
-    Vertex names used in the formula will be assigned to the
-    C{name} vertex attribute of the graph.
-
-    Some simple examples:
-
-      >>> from igraph import Graph
-      >>> print Graph.Formula()           # empty graph
-      IGRAPH UN-- 0 0 --
-      + attr: name (v)
-      >>> g = Graph.Formula("A-B")        # undirected graph
-      >>> g.vs["name"]
-      ['A', 'B']
-      >>> print g
-      IGRAPH UN-- 2 1 --
-      + attr: name (v)
-      + edges (vertex names):
-      A--B
-      >>> g.get_edgelist()
-      [(0, 1)]
-      >>> g2 = Graph.Formula("A-----------B")
-      >>> g2.isomorphic(g)
-      True
-      >>> g = Graph.Formula("A  --->  B") # directed graph
-      >>> g.vs["name"]
-      ['A', 'B']
-      >>> print g
-      IGRAPH DN-- 2 1 --
-      + attr: name (v)
-      + edges (vertex names):
-      A->B
-      
-    If you have may disconnected componnets, you can separate them
-    with commas. You can also specify isolated vertices:
-
-      >>> g = Graph.Formula("A--B, C--D, E--F, G--H, I, J, K")
-      >>> print ", ".join(g.vs["name"])
-      A, B, C, D, E, F, G, H, I, J, K
-      >>> g.clusters().membership
-      [0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6]
-
-    The colon (C{:}) operator can be used to specify vertex sets.
-    If an edge operator connects two vertex sets, then every vertex
-    from the first vertex set will be connected to every vertex in
-    the second set:
-
-      >>> g = Graph.Formula("A:B:C:D --- E:F:G")
-      >>> g.isomorphic(Graph.Full_Bipartite(4, 3))
-      True
-
-    Note that you have to quote vertex names if they include spaces
-    or special characters:
-
-      >>> g = Graph.Formula('"this is" +- "a silly" -+ "graph here"')
-      >>> g.vs["name"]
-      ['this is', 'a silly', 'graph here']
-
-    @param formula: the formula itself
-    @param attr: name of the vertex attribute where the vertex names
-                 will be stored
-    @param simplify: whether the simplify the constructed graph
-    @return: the constructed graph:
-    """
-    
-    # If we have no formula, return an empty graph
-    if formula is None:
-        return cls(0, vertex_attrs = {attr: []})
-
-    vertex_ids, edges, directed = UniqueIdGenerator(), [], False
-    # Loop over each part in the formula
-    for part in formula.split(","):
-        # Drop newlines from the part
-        part = part.strip().replace("\n", "").replace("\t", "")
-        # Parse the first vertex specification from the formula
-        for start_names, end_names, arrowheads in generate_edges(part):
-            start_ids = [vertex_ids[name] for name in start_names]
-            end_ids   = [vertex_ids[name] for name in end_names]
-            if not arrowheads[0] and not arrowheads[1]:
-                # This is an undirected edge. Do we have a directed graph?
-                if not directed:
-                    # Nope, add the edge
-                    edges.extend((id1, id2) for id1 in start_ids \
-                                 for id2 in end_ids)
-            else:
-                # This is a directed edge
-                directed = True
-                if arrowheads[1]:
-                    edges.extend((id1, id2) for id1 in start_ids \
-                                 for id2 in end_ids)
-                if arrowheads[0]:
-                    edges.extend((id2, id1) for id1 in start_ids \
-                                 for id2 in end_ids)
-
-    # Grab the vertex names into a list
-    vertex_attrs = {}
-    vertex_attrs[attr] = vertex_ids.values()
-    # Construct and return the graph
-    result = cls(len(vertex_ids), edges, directed, vertex_attrs=vertex_attrs)
-    if simplify:
-        result.simplify()
-    return result
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/layout.py igraph-0.6.5/interfaces/python/igraph/layout.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/layout.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/layout.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,437 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Layout-related code in the IGraph library.
-
-This package contains the implementation of the L{Layout} object.
-"""
-
-from itertools import izip
-from math import sin, cos, pi
-
-from igraph.drawing.utils import BoundingBox
-from igraph.statistics import RunningMean
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-class Layout(object):
-    """Represents the layout of a graph.
-
-    A layout is practically a list of coordinates in an n-dimensional
-    space. This class is generic in the sense that it can store coordinates
-    in any n-dimensional space.
-
-    Layout objects are not associated directly with a graph. This is deliberate:
-    there were times when I worked with almost identical copies of the same
-    graph, the only difference was that they had different colors assigned to
-    the vertices. It was particularly convenient for me to use the same layout
-    for all of them, especially when I made figures for a paper. However,
-    C{igraph} will of course refuse to draw a graph with a layout that has
-    less coordinates than the node count of the graph.
-
-    Layouts behave exactly like lists when they are accessed using the item
-    index operator (C{[...]}). They can even be iterated through. Items
-    returned by the index operator are only copies of the coordinates,
-    but the stored coordinates can be modified by directly assigning to
-    an index.
-
-        >>> layout = Layout([(0, 1), (0, 2)])
-        >>> coords = layout[1]
-        >>> print coords
-        [0, 2]
-        >>> coords = (0, 3)
-        >>> print layout[1]
-        [0, 2]
-        >>> layout[1] = coords
-        >>> print layout[1]
-        [0, 3]
-    """
-    
-    def __init__(self, coords=None, dim=None):
-        """Constructor.
-
-        @param coords: the coordinates to be stored in the layout.
-        @param dim: the number of dimensions. If C{None}, the number of
-        dimensions is determined automatically from the length of the first
-        item of the coordinate list. If there are no entries in the coordinate
-        list, the default will be 2.  Generally, this should be given if the
-        length of the coordinate list is zero, otherwise it should be left as
-        is.
-        """
-        if coords:
-            self._coords = [list(coord) for coord in coords]
-        else:
-            self._coords = []
-
-        if dim is None:
-            if len(self._coords) == 0:
-                self._dim = 2
-            else:
-                self._dim = len(self._coords[0])
-        else:
-            self._dim = int(dim)
-            for row in self._coords:
-                if len(row) != self._dim:
-                    raise ValueError("all items in the coordinate list "+
-                                     "must have a length of %d" % self._dim)
-
-    def __len__(self):
-        return len(self._coords)
-
-    def __getitem__(self, idx):
-        return self._coords[idx]
-
-    def __setitem__(self, idx, value):
-        if len(value) != self._dim:
-            raise ValueError("assigned item must have %d elements" % self._dim)
-        self._coords[idx] = list(value)
-
-    def __delitem__(self, idx):
-        del self._coords[idx]
-
-    def __copy__(self):
-        return self.__class__(self.coords, self.dim)
-
-    def __repr__(self):
-        if not self.coords:
-            vertex_count = "no vertices"
-        elif len(self.coords) == 1:
-            vertex_count = "1 vertex"
-        else:
-            vertex_count = "%d vertices" % len(self.coords)
-        if self.dim == 1:
-            dim_count = "1 dimension"
-        else:
-            dim_count = "%d dimensions" % self.dim
-        return "<%s with %s and %s>" % (self.__class__.__name__,
-                vertex_count, dim_count)
-
-    @property
-    def dim(self):
-        """Returns the number of dimensions"""
-        return self._dim
-
-    @property
-    def coords(self):
-        """The coordinates as a list of lists"""
-        return [row[:] for row in self._coords]
-
-    def append(self, value):
-        """Appends a new point to the layout"""
-        if len(value) < self._dim:
-            raise ValueError("appended item must have %d elements" % self._dim)
-        self._coords.append([float(coord) for coord in value[0:self._dim]])
-
-    def mirror(self, dim):
-        """Mirrors the layout along the given dimension(s)
-
-        @param dim: the list of dimensions or a single dimension
-        """
-        if isinstance(dim, int):
-            dim = [dim]
-        else:
-            dim = [int(x) for x in dim]
-
-        for current_dim in dim:
-            for row in self._coords:
-                row[current_dim] *= -1
-
-
-    def rotate(self, angle, dim1=0, dim2=1, **kwds):
-        """Rotates the layout by the given degrees on the plane defined by
-        the given two dimensions.
-
-        @param angle: the angle of the rotation, specified in degrees.
-        @param dim1: the first axis of the plane of the rotation.
-        @param dim2: the second axis of the plane of the rotation.
-        @keyword origin: the origin of the rotation. If not specified, the
-          origin will be the origin of the coordinate system.
-        """
-
-        origin = list(kwds.get("origin", [0.]*self._dim))
-        if len(origin) != self._dim:
-            raise ValueError("origin must have %d dimensions" % self._dim)
-
-        radian = angle * pi / 180.
-        cos_alpha, sin_alpha = cos(radian), sin(radian)
-        
-        for idx, row in enumerate(self._coords): 
-            x, y = row[dim1] - origin[dim1], row[dim2] - origin[dim2]
-            row[dim1] = cos_alpha*x - sin_alpha*y + origin[dim1]
-            row[dim2] = sin_alpha*x + cos_alpha*y + origin[dim2]
-
-
-    def scale(self, *args, **kwds):
-        """Scales the layout.
-
-        Scaling parameters can be provided either through the C{scale} keyword
-        argument or through plain unnamed arguments. If a single integer or
-        float is given, it is interpreted as a uniform multiplier to be applied
-        on all dimensions. If it is a list or tuple, its length must be equal to
-        the number of dimensions in the layout, and each element must be an
-        integer or float describing the scaling coefficient in one of the
-        dimensions.
-
-        @keyword scale: scaling coefficients (integer, float, list or tuple)
-        @keyword origin: the origin of scaling (this point will stay in place).
-          Optional, defaults to the origin of the coordinate system being used.
-        """
-        origin = list(kwds.get("origin", [0.]*self._dim))
-        if len(origin) != self._dim:
-            raise ValueError("origin must have %d dimensions" % self._dim)
-
-        scaling = kwds.get("scale") or args
-        if isinstance(scaling, (int, float)):
-            scaling = [scaling]
-        if len(scaling) == 0:
-            raise ValueError("scaling factor must be given")
-        elif len(scaling) == 1:
-            if type(scaling[0]) == int or type(scaling[0]) == float:
-                scaling = scaling*self._dim
-            else:
-                scaling = scaling[0]
-        if len(scaling) != self._dim:
-            raise ValueError("scaling factor list must have %d elements" \
-                    % self._dim)
-
-        for idx, row in enumerate(self._coords):
-            self._coords[idx] = [(row[d]-origin[d])*scaling[d]+origin[d] \
-                                 for d in xrange(self._dim)]
-
-    def translate(self, *args, **kwds):
-        """Translates the layout.
-
-        The translation vector can be provided either through the C{v} keyword
-        argument or through plain unnamed arguments. If unnamed arguments are
-        used, the vector can be supplied as a single list (or tuple) or just as
-        a series of arguments. In all cases, the translation vector must have
-        the same number of dimensions as the layout.
-
-        @keyword v: the translation vector
-        """
-        v = kwds.get("v") or args
-        if len(v) == 0:
-            raise ValueError("translation vector must be given")
-        elif len(v) == 1 and type(v[0]) != int and type(v[0]) != float:
-            v = v[0]
-        if len(v) != self._dim:
-            raise ValueError("translation vector must have %d dimensions" \
-                    % self._dim)
-
-        for idx, row in enumerate(self._coords):
-            self._coords[idx] = [row[d]+v[d] for d in xrange(self._dim)]
-
-
-    def to_radial(self, min_angle = 100, max_angle = 80, \
-        min_radius=0.0, max_radius=1.0):
-        """Converts a planar layout to a radial one
-
-        This method applies only to 2D layouts. The X coordinate of the
-        layout is transformed to an angle, with min(x) corresponding to
-        the parameter called I{min_angle} and max(y) corresponding to
-        I{max_angle}. Angles are given in degrees, zero degree corresponds
-        to the direction pointing upwards. The Y coordinate is
-        interpreted as a radius, with min(y) belonging to the minimum and
-        max(y) to the maximum radius given in the arguments.
-
-        This is not a fully generic polar coordinate transformation, but
-        it is fairly useful in creating radial tree layouts from ordinary
-        top-down ones (that's why the Y coordinate belongs to the radius).
-        It can also be used in conjunction with the Fruchterman-Reingold
-        layout algorithm via its I{miny} and I{maxy} parameters (see
-        L{Graph.layout_fruchterman_reingold}) to produce radial layouts
-        where the radius belongs to some property of the vertices.
-
-        @param min_angle: the angle corresponding to the minimum X value
-        @param max_angle: the angle corresponding to the maximum X value
-        @param min_radius: the radius corresponding to the minimum Y value
-        @param max_radius: the radius corresponding to the maximum Y value
-        """
-        if self._dim != 2:
-            raise TypeError("implemented only for 2D layouts")
-        bbox = self.bounding_box()
-
-        while min_angle > max_angle:
-            max_angle += 360
-        while min_angle > 360:
-            min_angle -= 360
-            max_angle -= 360
-        while min_angle < 0:
-            min_angle += 360
-            max_angle += 360
-
-        ratio_x = (max_angle - min_angle) / bbox.width
-        ratio_x *= pi / 180.
-        min_angle *= pi / 180.
-        ratio_y = (max_radius - min_radius) / bbox.height
-        for idx, (x, y) in enumerate(self._coords):
-            alpha  = (x-bbox.left) * ratio_x + min_angle
-            radius = (y-bbox.top) * ratio_y + min_radius
-            self._coords[idx] = [cos(alpha)*radius, -sin(alpha)*radius]
-
-
-    def transform(self, function, *args, **kwds):
-        """Performs an arbitrary transformation on the layout
-
-        Additional positional and keyword arguments are passed intact to
-        the given function.
-
-        @param function: a function which receives the coordinates as a
-          tuple and returns the transformed tuple.
-        """
-        self._coords = [list(function(tuple(row), *args, **kwds)) \
-            for row in self._coords]
-
-
-    def centroid(self):
-        """Returns the centroid of the layout.
-
-        The centroid of the layout is the arithmetic mean of the points in
-        the layout.
-        
-        @return: the centroid as a list of floats"""
-        centroid = [RunningMean() for _ in xrange(self._dim)]
-        for row in self._coords:
-            for dim in xrange(self._dim):
-                centroid[dim].add(row[dim])
-        return [rm.mean for rm in centroid]
-
-    def boundaries(self, border=0):
-        """Returns the boundaries of the layout.
-
-        The boundaries are the minimum and maximum coordinates along all
-        dimensions.
-
-        @param border: this value gets subtracted from the minimum bounds
-          and gets added to the maximum bounds before returning the coordinates
-          of the box. Defaults to zero.
-        @return: the minimum and maximum coordinates along all dimensions,
-          in a tuple containing two lists, one for the minimum coordinates,
-          the other one for the maximum.
-        """
-        mins, maxs = [], []
-        for dim in xrange(self._dim):
-            col = [row[dim] for row in self._coords]
-            mins.append(min(col)-border)
-            maxs.append(max(col)+border)
-        return mins, maxs
-        
-    def bounding_box(self, border=0):
-        """Returns the bounding box of the layout.
-
-        The bounding box of the layout is the smallest box enclosing all the
-        points in the layout.
-
-        @param border: this value gets subtracted from the minimum bounds
-          and gets added to the maximum bounds before returning the coordinates
-          of the box. Defaults to zero.
-        @return: the coordinates of the lower left and the upper right corner
-          of the box. "Lower left" means the minimum coordinates and "upper right"
-          means the maximum. These are encapsulated in a L{BoundingBox} object.
-        """
-        if self._dim != 2:
-            raise ValueError("Layout.boundary_box() supports 2D layouts only")
-        (x0, y0), (x1, y1) = self.boundaries(border)
-        return BoundingBox(x0, y0, x1, y1)
-
-
-    def center(self, *args, **kwds):
-        """Centers the layout around the given point.
-
-        The point itself can be supplied as multiple unnamed arguments, as a
-        simple unnamed list or as a keyword argument. This operation moves
-        the centroid of the layout to the given point. If no point is supplied,
-        defaults to the origin of the coordinate system.
-
-        @keyword p: the point where the centroid of the layout will be after
-          the operation."""
-        center = kwds.get("p") or args
-        if len(center) == 0:
-            center = [0.] * self._dim
-        elif len(center) == 1 and type(center[0]) != int \
-            and type(center[0]) != float:
-            center = center[0]
-        if len(center) != self._dim:
-            raise ValueError("the given point must have %d dimensions" \
-                    % self._dim)
-        centroid = self.centroid()
-        vec = [center[d]-centroid[d] for d in xrange(self._dim)]
-        self.translate(vec)
-
-
-    def copy(self):
-        """Creates an exact copy of the layout."""
-        return self.__copy__()
-
-    def fit_into(self, bbox, keep_aspect_ratio=True):
-        """Fits the layout into the given bounding box.
-
-        The layout will be modified in-place.
-
-        @param bbox: the bounding box in which to fit the layout. If the
-          dimension of the layout is d, it can either be a d-tuple (defining
-          the sizes of the box), a 2d-tuple (defining the coordinates of the
-          top left and the bottom right point of the box), or a L{BoundingBox}
-          object (for 2D layouts only).
-        @param keep_aspect_ratio: whether to keep the aspect ratio of the current
-          layout. If C{False}, the layout will be rescaled to fit exactly into
-          the bounding box. If C{True}, the original aspect ratio of the layout
-          will be kept and it will be centered within the bounding box.
-        """
-        if isinstance(bbox, BoundingBox):
-            if self._dim != 2:
-                raise TypeError("bounding boxes work for 2D layouts only")
-            corner, target_sizes = [bbox.left, bbox.top], [bbox.width, bbox.height]
-        elif len(bbox) == self._dim:
-            corner, target_sizes = [0.] * self._dim, list(bbox)
-        elif len(bbox) == 2 * self._dim:
-            corner, opposite_corner = bbox[0:self._dim], bbox[self._dim:]
-            for i in xrange(self._dim):
-                if corner[i] > opposite_corner[i]:
-                    corner[i], opposite_corner[i] = opposite_corner[i], corner[i]
-            target_sizes = [max_val-min_val \
-                    for min_val, max_val in izip(corner, opposite_corner)]
-
-        mins, maxs = self.boundaries()
-        sizes = [max_val - min_val for min_val, max_val in izip(mins, maxs)]
-
-        for i, size in enumerate(sizes):
-            if size == 0:
-                sizes[i] = 2
-                mins[i] -= 1
-                maxs[i] += 1
-
-
-        ratios = [float(target_size) / current_size \
-                  for current_size, target_size in izip(sizes, target_sizes)]
-        if keep_aspect_ratio:
-            min_ratio = min(ratios)
-            ratios = [min_ratio] * self._dim
-
-        translations = []
-        for i in xrange(self._dim):
-            trans = (target_sizes[i] - ratios[i] * sizes[i]) / 2.
-            trans -= mins[i] * ratios[i] - corner[i]
-            translations.append(trans)
-
-        self.scale(*ratios)
-        self.translate(*translations)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/matching.py igraph-0.6.5/interfaces/python/igraph/matching.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/matching.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/matching.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,182 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Classes representing matchings on graphs."""
-
-from igraph.clustering import VertexClustering
-from igraph._igraph import Vertex
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-class Matching(object):
-    """A matching of vertices in a graph.
-
-    A matching of an undirected graph is a set of edges such that each
-    vertex is incident on at most one matched edge. When each vertex is
-    incident on I{exactly} one matched edge, the matching called
-    I{perfect}. This class is used in C{igraph} to represent non-perfect
-    and perfect matchings in undirected graphs.
-
-    This class is usually not instantiated directly, everything
-    is taken care of by the functions that return matchings.
-
-    Examples:
-
-      >>> from igraph import Graph
-      >>> g = Graph.Famous("noperfectmatching")
-      >>> matching = g.maximum_matching()
-    """
-
-    def __init__(self, graph, matching, types=None):
-        """Initializes the matching.
-
-        @param graph: the graph the matching belongs to
-        @param matching: a numeric vector where element I{i} corresponds to
-          vertex I{i} of the graph. Element I{i} is -1 or if the corresponding
-          vertex is unmatched, otherwise it contains the index of the vertex to
-          which vertex I{i} is matched.
-        @param types: the types of the vertices if the graph is bipartite.
-          It must either be the name of a vertex attribute (which will be
-          retrieved for all vertices) or a list. Elements in the list will be
-          converted to boolean values C{True} or C{False}, and this will
-          determine which part of the bipartite graph a given vertex belongs to.
-        @raise ValueError: if the matching vector supplied does not describe
-          a valid matching of the graph.
-        """
-        self._graph = graph
-        self._matching = None
-        self._num_matched = 0
-        self._types = None
-
-        if isinstance(types, basestring):
-            types = graph.vs[types]
-
-        self.types = types
-        self.matching = matching
-
-    def __len__(self):
-        return self._num_matched
-
-    def __repr__(self):
-        if self._types is not None:
-            return "%s(%r,%r,types=%r)" % \
-              (self.__class__.__name__, self._graph, self._matching, self._types)
-        else:
-            return "%s(%r,%r)" % \
-              (self.__class__.__name__, self._graph, self._matching)
-
-    def __str__(self):
-        if self._types is not None:
-            return "Bipartite graph matching (%d matched vertex pairs)" % len(self)
-        else:
-            return "Graph matching (%d matched vertex pairs)" % len(self)
-
-    def edges(self):
-        """Returns an edge sequence that contains the edges in the matching.
-
-        If there are multiple edges between a pair of matched vertices, only one
-        of them will be returned.
-        """
-        get_eid = self._graph.get_eid
-        eidxs = [get_eid(u, v, directed=False) \
-                for u, v in enumerate(self._matching) if v != -1 and u <= v]
-        return self._graph.es[eidxs]
-
-    @property
-    def graph(self):
-        """Returns the graph corresponding to the matching."""
-        return self._graph
-
-    def is_maximal(self):
-        """Returns whether the matching is maximal.
-
-        A matching is maximal when it is not possible to extend it any more
-        with extra edges; in other words, unmatched vertices in the graph
-        must be adjacent to matched vertices only.
-        """
-        return self._graph._is_maximal_matching(self._matching, types=self._types)
-
-    def is_matched(self, vertex):
-        """Returns whether the given vertex is matched to another one."""
-        if isinstance(vertex, Vertex):
-            vertex = vertex.index
-        return self._matching[vertex] >= 0
-
-    def match_of(self, vertex):
-        """Returns the vertex a given vertex is matched to.
-        
-        @param vertex: the vertex we are interested in; either an integer index
-          or an instance of L{Vertex}.
-        @return: the index of the vertex matched to the given vertex, either as
-          an integer index (if I{vertex} was integer) or as an instance of
-          L{Vertex}. When the vertex is unmatched, returns C{None}.
-        """
-        if isinstance(vertex, Vertex):
-            matched = self._matching[vertex.index]
-            if matched < 0:
-                return None
-            return self._graph.vs[matched]
-
-        matched = self._matching[vertex]
-        if matched < 0:
-            return None
-        return matched
-
-    @property
-    def matching(self):
-        """Returns the matching vector where element I{i} contains the ID of
-        the vertex that vertex I{i} is matched to.
-
-        The matching vector will contain C{-1} for unmatched vertices.
-        """
-        return self._matching
-
-    @matching.setter
-    def matching(self, value):
-        """Sets the matching vector.
-
-        @param value: the matching vector which must contain the ID of the
-          vertex matching vertex I{i} at the I{i}th position, or C{-1} if
-          the vertex is unmatched.
-        @raise ValueError: if the matching vector supplied does not describe
-          a valid matching of the graph.
-        """
-        if not self.graph._is_matching(value, types=self._types):
-            raise ValueError("not a valid matching")
-        self._matching = list(value)
-        self._num_matched = sum(1 for i in self._matching if i >= 0) // 2
-
-    @property
-    def types(self):
-        """Returns the type vector if the graph is bipartite.
-
-        Element I{i} of the type vector will be C{False} or C{True} depending
-        on which side of the bipartite graph vertex I{i} belongs to.
-
-        For non-bipartite graphs, this property returns C{None}.
-        """
-        return self._types
-
-    @types.setter
-    def types(self, value):
-        types = [bool(x) for x in value]
-        if len(types) < self._graph.vcount():
-            raise ValueError("type vector too short")
-        self._types = types
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/nexus.py igraph-0.6.5/interfaces/python/igraph/nexus.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/nexus.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/nexus.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,560 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Interface to the Nexus online graph repository.
-
-The classes in this file facilitate access to the Nexus online graph
-repository at U{http://nexus.igraph.org}.
-
-The main entry point of this package is the C{Nexus} variable, which is
-an instance of L{NexusConnection}. Use L{NexusConnection.get} to get a particular
-network from Nexus, L{NexusConnection.list} to list networks having a given set of
-tags, L{NexusConnection.search} to search in the dataset descriptions, or
-L{NexusConnection.info} to show the info sheet of a dataset."""
-
-from cStringIO import StringIO
-from gzip import GzipFile
-from itertools import izip
-from textwrap import TextWrapper
-from urllib import urlencode
-from urlparse import urlparse, urlunparse
-from textwrap import TextWrapper
-
-from igraph.compat import property
-from igraph.configuration import Configuration
-from igraph.utils import multidict
-
-import re
-import urllib2
-
-__all__ = ["Nexus", "NexusConnection"]
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-class NexusConnection(object):
-    """Connection to a remote Nexus server.
-
-    In most cases, you will not have to instantiate this object, just use
-    the global L{Nexus} variable which is an instance of L{NexusConnection}
-    and connects to the Nexus repository at U{http://nexus.igraph.org}.
-
-    Example:
-
-      >>> print Nexus.info("karate")              # doctest:+ELLIPSIS
-      Nexus dataset 'karate' (#1)
-      vertices/edges: 34/78
-      name: Zachary's karate club
-      tags: social network; undirected; weighted
-      ...
-      >>> karate = Nexus.get("karate")
-      >>> from igraph import summary
-      >>> summary(karate)
-      IGRAPH UNW- 34 78 -- Zachary's karate club network
-      + attr: Author (g), Citation (g), name (g), Faction (v), id (v), name (v), weight (e)
-
-    @undocumented: _get_response, _parse_dataset_id, _parse_text_response,
-      _ensure_uncompressed"""
-
-    def __init__(self, nexus_url=None):
-        """Constructs a connection to a remote Nexus server.
-
-        @param nexus_url: the root URL of the remote server. Leave it at its
-          default value (C{None}) unless you have set up your own Nexus server
-          and you want to connect to that. C{None} fetches the URL from
-          igraph's configuration file or uses the default URL if no URL
-          is specified in the configuration file.
-        """
-        self.debug = False
-        self.url = nexus_url
-        self._opener = urllib2.build_opener()
-
-    def get(self, id):
-        """Retrieves the dataset with the given ID from Nexus.
-
-        Dataset IDs are formatted as follows: the name of a dataset on its own
-        means that a single network should be returned if the dataset contains
-        a single network, or multiple networks should be returned if the dataset
-        contains multiple networks. When the name is followed by a dot and a
-        network ID, only a single network will be returned: the one that has the
-        given network ID. When the name is followed by a dot and a star, a
-        dictionary mapping network IDs to networks will be returned even if the
-        original dataset contains a single network only.
-
-        E.g., getting C{"karate"} would return a single network since the
-        Zachary karate club dataset contains one network only. Getting
-        C{"karate.*"} on the other hand would return a dictionary with one
-        entry that contains the Zachary karate club network.
-
-        @param id: the ID of the dataset to retrieve.
-        @return: an instance of L{Graph} (if a single graph has to be returned)
-          or a dictionary mapping network IDs to instances of L{Graph}.
-        """
-        from igraph import load
-
-        dataset_id, network_id = self._parse_dataset_id(id)
-
-        params = dict(format="Python-igraph", id=dataset_id)
-        response = self._get_response("/api/dataset", params, compressed=True)
-        response = self._ensure_uncompressed(response)
-        result = load(response, format="pickle")
-
-        if network_id is None:
-            # If result contains a single network only, return that network.
-            # Otherwise return the whole dictionary
-            if not isinstance(result, dict):
-                return result
-            if len(result) == 1:
-                return result[result.keys()[0]]
-            return result
-
-        if network_id == "*":
-            # Return a dict no matter what
-            if not isinstance(result, dict):
-                result = dict(dataset_id=result)
-            return result
-
-        return result[network_id]
-
-    def info(self, id):
-        """Retrieves informations about the dataset with the given numeric
-        or string ID from Nexus.
-
-        @param id: the numeric or string ID of the dataset to retrieve.
-        @return: an instance of L{NexusDatasetInfo}.
-        """
-        params = dict(format="text", id=id)
-        response = self._get_response("/api/dataset_info", params)
-        return NexusDatasetInfo.FromMultiDict(self._parse_text_response(response))
-
-    def list(self, tags=None, operator="or", order="date"):
-        """Retrieves a list of datasets matching a set of tags from Nexus.
-
-        @param tags: the tags the returned datasets should have. C{None}
-          retrieves all the datasets, a single string retrieves datasets
-          having that given tag. Multiple tags may also be specified as
-          a list, tuple or any other iterable.
-        @param operator: when multiple tags are given, this argument
-          specifies whether the retrieved datasets should match all
-          the tags (C{"and"}) or any of them (C{"or"}).
-        @param order: the order of entries; it must be one of C{"date"},
-          C{"name"} or C{"popularity"}.
-        @return: a L{NexusDatasetInfoList} object, which basically acts like a
-          list and yields L{NexusDatasetInfo} objects. The list is populated
-          lazily; i.e. the requests will be fired only when needed.
-        """
-        params = dict(format="text", order=order)
-        if tags is not None:
-            if not hasattr(tags, "__iter__") or isinstance(tags, basestring):
-                params["tag"] = str(tags)
-            else:
-                params["tag"] = "|".join(str(tag) for tag in tags)
-                params["operator"] = operator
-
-        return NexusDatasetInfoList(self, "/api/dataset_info", params)
-
-    def search(self, query, order="date"):
-        """Retrieves a list of datasets matching a query string from Nexus.
-
-        @param query: the query string. Searches are case insensitive and
-          Nexus searches for complete words only. The special word OR
-          can be used to find datasets that contain any of the given words
-          (instead of all of them). Exact phrases must be enclosed in
-          quotes in the search string. See the Nexus webpage for more
-          information at U{http://nexus.igraph.org/web/docs#searching}.
-        @param order: the order of entries; it must be one of C{"date"},
-          C{"name"} or C{"popularity"}.
-        @return: a L{NexusDatasetInfoList} object, which basically acts like a
-          list and yields L{NexusDatasetInfo} objects. The list is populated
-          lazily; i.e. the requests will be fired only when needed.
-        """
-        params = dict(q=query, order=order, format="text")
-        return NexusDatasetInfoList(self, "/api/search", params)
-
-    @staticmethod
-    def _ensure_uncompressed(response):
-        """Expects an HTTP response object, checks its Content-Encoding header,
-        decompresses the data and returns an in-memory buffer holding the
-        uncompressed data."""
-        compressed = response.headers.get("Content-Encoding") == "gzip"
-        if not compressed:
-            content_disp = response.headers.get("Content-Disposition", "")
-            compressed = bool(re.match(r'attachment; *filename=.*\.gz\"?$',
-                    content_disp))
-        if compressed:
-            return GzipFile(fileobj=StringIO(response.read()), mode="rb")
-        print response.headers
-        return response
-
-    def _get_response(self, path, params={}, compressed=False):
-        """Sends a request to Nexus at the given path with the given parameters
-        and returns a file-like object for the response. `compressed` denotes
-        whether we accept compressed responses."""
-        if self.url is None:
-            url = Configuration.instance()["remote.nexus.url"]
-        else:
-            url = self.url
-        url = "%s%s?%s" % (url, path, urlencode(params))
-        request = urllib2.Request(url)
-        if compressed:
-            request.add_header("Accept-Encoding", "gzip")
-        if self.debug:
-            print "[debug] Sending request: %s" % url
-        return self._opener.open(request)
-
-    @staticmethod
-    def _parse_dataset_id(id):
-        """Parses a dataset ID used in the `get` request.
-
-        Returns the dataset ID and the network ID (the latter being C{None}
-        if the original ID did not contain a network ID ).
-        """
-        dataset_id, _, network_id = str(id).partition(".")
-        if not network_id:
-            network_id = None
-        return dataset_id, network_id
-
-    @staticmethod
-    def _parse_text_response(response):
-        """Parses a plain text formatted response from Nexus.
-
-        Plain text formatted responses consist of key-value pairs, separated
-        by C{":"}. Values may span multiple lines; in this case, the key is
-        omitted after the first line and the extra lines start with
-        whitespace.
-
-        Examples:
-        
-            >>> d = Nexus._parse_text_response("Id: 17\\nName: foo")
-            >>> sorted(d.items())
-            [('Id', '17'), ('Name', 'foo')]
-            >>> d = Nexus._parse_text_response("Id: 42\\nName: foo\\n  .\\n bar")
-            >>> sorted(d.items())
-            [('Id', '42'), ('Name', 'foo\\n\\nbar')]
-        """
-        if isinstance(response, basestring):
-            response = response.split("\n")
-
-        result = multidict()
-        key, value = None, []
-        for line in response:
-            line = line.rstrip()
-            if not line:
-                continue
-            if key is not None and line[0] in ' \t':
-                # Line continuation
-                line = line.lstrip()
-                if line == '.':
-                    line = ''
-                value.append(line)
-            else:
-                # Key-value pair
-                if key is not None:
-                    result.add(key, "\n".join(value))
-                key, value = line.split(":", 1)
-                value = [value.strip()]
-
-        if key is not None:
-            result.add(key, "\n".join(value))
-
-        return result
-
-    @property
-    def url(self):
-        """Returns the root URL of the Nexus repository the connection is
-        communicating with."""
-        return self._url
-
-    @url.setter
-    def url(self, value):
-        """Sets the root URL of the Nexus repository the connection is
-        communicating with."""
-        if value is None:
-            self._url = None
-        else:
-            value = str(value)
-            parts = urlparse(value, "http", False)
-            self._url = urlunparse(parts)
-            if self._url and self._url[-1] == "/":
-                self._url = self._url[:-1]
-
-
-class NexusDatasetInfo(object):
-    """Information about a dataset in the Nexus repository.
-    
-    @undocumented: _update_from_multidict, vertices_edges"""
-
-    def __init__(self, id=None, sid=None, name=None, networks=None,
-            vertices=None, edges=None, tags=None, attributes=None, rest=None):
-        self._conn = None
-        self.id = id
-        self.sid = sid
-        self.name = name
-        self.vertices = vertices
-        self.edges = edges
-        self.tags = tags
-        self.attributes = attributes
-        if networks is None:
-            self.networks = []
-        elif not isinstance(networks, (str, unicode)):
-            self.networks = list(networks)
-        else:
-            self.networks = [networks]
-        if rest:
-            self.rest = multidict(rest)
-        else:
-            self.rest = None
-
-    @property
-    def vertices_edges(self):
-        if self.vertices is None or self.edges is None:
-            return ""
-        elif isinstance(self.vertices, (list, tuple)) and isinstance(self.edges, (list, tuple)):
-            return " ".join("%s/%s" % (v,e) for v, e in izip(self.vertices, self.edges))
-        else:
-            return "%s/%s" % (self.vertices, self.edges)
-
-    @vertices_edges.setter
-    def vertices_edges(self, value):
-        if value is None:
-            self.vertices, self.edges = None, None
-            return
-
-        value = value.strip().split(" ")
-        if len(value) == 0:
-            self.vertices, self.edges = None, None
-        elif len(value) == 1:
-            self.vertices, self.edges = map(int, value[0].split("/"))
-        else:
-            self.vertices = []
-            self.edges = []
-            for ve in value:
-                v, e = ve.split("/", 1)
-                self.vertices.append(int(v))
-                self.edges.append(int(e))
-
-    def __repr__(self):
-        params = "(id=%(id)r, sid=%(sid)r, name=%(name)r, networks=%(networks)r, "\
-                "vertices=%(vertices)r, edges=%(edges)r, tags=%(tags)r, "\
-                "attributes=%(attributes)r, rest=%(rest)r)" % self.__dict__
-        return "%s%s" % (self.__class__.__name__, params)
-
-    def __str__(self):
-        if self.networks and len(self.networks) > 1:
-            lines = ["Nexus dataset '%s' (#%s) with %d networks" % \
-                    (self.sid, self.id, len(self.networks))]
-        else:
-            lines = ["Nexus dataset '%(sid)s' (#%(id)s)" % self.__dict__]
-
-        lines.append("vertices/edges: %s" % self.vertices_edges)
-
-        if self.name:
-            lines.append("name: %s" % self.name)
-        if self.tags:
-            lines.append("tags: %s" % "; ".join(self.tags))
-
-        if self.rest:
-            wrapper = TextWrapper(width=76, subsequent_indent='  ')
-
-            keys = sorted(self.rest.iterkeys())
-            if "attribute" in self.rest:
-                keys.remove("attribute")
-                keys.append("attribute")
-
-            for key in keys:
-                for value in self.rest.getlist(key):
-                    paragraphs = str(value).splitlines()
-                    wrapper.initial_indent = "%s: " % key
-                    for paragraph in paragraphs:
-                        ls = wrapper.wrap(paragraph)
-                        if ls:
-                            lines.extend(wrapper.wrap(paragraph))
-                        else:
-                            lines.append("  .")
-                        wrapper.initial_indent = "  "
-
-        return "\n".join(lines)
-
-    def _update_from_multidict(self, params):
-        """Updates the dataset object from a multidict representation of
-        key-value pairs, similar to the ones provided by the Nexus API in
-        plain text response."""
-        self.id = params.get("id")
-        self.sid = params.get("sid")
-        self.name = params.get("name")
-        self.vertices = params.get("vertices")
-        self.edges = params.get("edges")
-        self.tags = params.get("tags")
-
-        networks = params.get("networks")
-        if networks:
-            self.networks = networks.split()
-
-        keys_to_ignore = set("id sid name vertices edges tags networks".split())
-
-        if self.vertices is None and self.edges is None:
-            # Try "vertices/edges"
-            self.vertices_edges = params.get("vertices/edges")
-            keys_to_ignore.add("vertices/edges")
-
-        if self.rest is None:
-            self.rest = multidict()
-        for k in set(params.iterkeys()) - keys_to_ignore:
-            for v in params.getlist(k):
-                self.rest.add(k, v)
-
-        if self.id:
-            self.id = int(self.id)
-        if self.vertices and not isinstance(self.vertices, (list, tuple)):
-            self.vertices = int(self.vertices)
-        if self.edges and not isinstance(self.edges, (list, tuple)):
-            self.edges = int(self.edges)
-        if self.tags is not None:
-            self.tags = self.tags.split(";")
-
-    @classmethod
-    def FromMultiDict(cls, dict):
-        """Constructs a Nexus dataset object from a multidict representation
-        of key-value pairs, similar to the ones provided by the Nexus API in
-        plain text response."""
-        result = cls()
-        result._update_from_multidict(dict)
-        return result
-
-    def download(self, network_id=None):
-        """Retrieves the actual dataset from Nexus.
-
-        @param network_id: if the dataset contains multiple networks, the ID
-          of the network to be retrieved. C{None} returns a single network if
-          the dataset contains a single network, or a dictionary of networks
-          if the dataset contains more than one network. C{"*"} retrieves
-          a dictionary even if the dataset contains a single network only.
-
-        @return: a L{Graph} instance or a dictionary mapping network names to
-          L{Graph} instances.
-        """
-        if self.id is None:
-            raise ValueError("dataset ID is empty")
-        conn = self._conn or Nexus
-        if network_id is None:
-            return conn.get(self.id)
-        return conn.get("%s.%s" % (self.id, network_id))
-
-    get = download
-
-
-class NexusDatasetInfoList(object):
-    """A read-only list-like object that can be used to retrieve the items
-    from a Nexus search result.
-    """
-
-    def __init__(self, connection, method, params):
-        """Constructs a Nexus dataset list that will use the given connection
-        and the given parameters to retrieve the search results.
-
-        @param connection: a Nexus connection object
-        @param method: the URL of the Nexus API method to call
-        @param params: the parameters to pass in the GET requests, in the
-          form of a Python dictionary.
-        """
-        self._conn = connection
-        self._method = str(method)
-        self._params = params
-        self._length = None
-        self._datasets = []
-        self._blocksize = 10
-
-    def _fetch_results(self, index):
-        """Fetches the results from Nexus such that the result item with the
-        given index will be available (unless the result list is shorter than
-        the given index of course)."""
-        # Calculate the start offset
-        page = index // self._blocksize
-        offset = page * self._blocksize
-        self._params["offset"] = offset
-        self._params["limit"] = self._blocksize
-
-        # Ensure that self._datasets has the necessary length
-        diff = (page+1) * self._blocksize - len(self._datasets)
-        if diff > 0:
-            self._datasets.extend([None] * diff)
-
-        response = self._conn._get_response(self._method, self._params)
-        current_dataset = None
-        for line in response:
-            key, value = line.strip().split(": ", 1)
-            key = key.lower()
-
-            if key == "totalsize":
-                # Total number of items in the search result
-                self._length = int(value)
-            elif key == "id":
-                # Starting a new dataset
-                if current_dataset:
-                    self._datasets[offset] = current_dataset
-                    offset += 1
-                current_dataset = NexusDatasetInfo(id=int(value))
-                current_dataset._conn = self._conn
-            elif key == "sid":
-                current_dataset.sid = value
-            elif key == "name":
-                current_dataset.name = value
-            elif key == "vertices":
-                current_dataset.vertices = int(value)
-            elif key == "edges":
-                current_dataset.edges = int(value)
-            elif key == "vertices/edges":
-                current_dataset.vertices_edges = value
-            elif key == "tags":
-                current_dataset.tags = value.split(";")
-
-        if current_dataset:
-            self._datasets[offset] = current_dataset
-
-
-    def __getitem__(self, index):
-        if len(self._datasets) <= index:
-            self._fetch_results(index)
-        elif self._datasets[index] is None:
-            self._fetch_results(index)
-        return self._datasets[index]
-
-    def __iter__(self):
-        for i in xrange(len(self)):
-            yield self[i]
-
-    def __len__(self):
-        """Returns the number of result items."""
-        if self._length is None:
-            self._fetch_results(0)
-        return self._length
-
-    def __str__(self):
-        """Converts the Nexus result list into a nice human-readable format."""
-        max_index_length = len(str(len(self))) + 2
-        indent = "\n" + " " * (max_index_length+1)
-
-        result = []
-        for index, item in enumerate(self):
-            formatted_item = ("[%d]" % index).rjust(max_index_length) + " " + \
-                str(item).replace("\n", indent)
-            result.append(formatted_item)
-        return "\n".join(result)
-
-Nexus = NexusConnection()
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/remote/__init__.py igraph-0.6.5/interfaces/python/igraph/remote/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/remote/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/remote/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-"""Classes that help igraph communicate with remote applications."""
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/remote/gephi.py igraph-0.6.5/interfaces/python/igraph/remote/gephi.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/remote/gephi.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/remote/gephi.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,288 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Classes that help igraph communicate with Gephi (http://www.gephi.org)."""
-
-from igraph.compat import property
-import urllib2
-
-try:
-    # JSON is optional so we don't blow up with Python < 2.6
-    import json
-except ImportError:
-    try:
-        # Try with simplejson for Python < 2.6
-        import simplejson as json
-    except ImportError:
-        # No simplejson either
-        from igraph.drawing.utils import FakeModule
-        json = FakeModule()
-
-__all__ = ["GephiConnection", "GephiGraphStreamer", "GephiGraphStreamingAPIFormat"]
-__docformat__ = "restructuredtext en"
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-
-class GephiConnection(object):
-    """Object that represents a connection to a Gephi master server."""
-    
-    def __init__(self, url=None, host="127.0.0.1", port=8080, workspace=0):
-        """Constructs a connection to a Gephi master server.
-
-        The connection object can be constructed either by specifying the `url`
-        directly, or by specifying the `host`, `port` and `workspace` arguments.
-        The latter three are evaluated only if `url` is None; otherwise the
-        `url` will take precedence.
-
-        The `url` argument does not have to include the operation (e.g.,
-        ``?operation=updateGraph``); the connection will take care of it.
-        E.g., if you wish to connect to workspace 2 in a local Gephi instance on
-        port 7341, the correct form to use for the `url` is as follows::
-
-            http://localhost:7341/workspace0
-        """
-        self._pending_operations = []
-        self._autoflush_threshold = 1024
-
-        self.url = url or self._construct_default_url(host, port, workspace)
-
-    def __del__(self):
-        try:
-            self.close()
-        except urllib2.URLError:
-            # Happens when Gephi is closed before the connection is destroyed
-            pass
-
-    def _construct_default_url(self, host, port, workspace):
-        return "http://%s:%d/workspace%d" % (host, port, workspace)
-
-    def close(self):
-        """Flushes all the pending operations to the Gephi master server in a
-        single request."""
-        self.flush()
-
-    def flush(self):
-        """Flushes all the pending operations to the Gephi master server in a
-        single request."""
-        data = "".join(self._pending_operations)
-        self._pending_operations = []
-        conn = urllib2.urlopen(self._update_url, data=data)
-        return conn.read()
-
-    @property
-    def url(self):
-        """The URL of the Gephi workspace where the data will be sent."""
-        return self._url_root
-
-    @url.setter
-    def url(self, value):
-        self._url_root = value
-        self._get_url = self._url_root + "?operation=getGraph"
-        self._update_url = self._url_root + "?operation=updateGraph"
-
-    def write(self, data):
-        """Sends the given raw data to the Gephi streaming master server in an HTTP
-        POST request."""
-        self._pending_operations.append(data)
-        if len(self._pending_operations) >= self._autoflush_threshold:
-            self.flush()
-
-    def __repr__(self):
-        return "%s(url=%r)" % (self.__class__.__name__, self.url)
-
-
-class GephiGraphStreamingAPIFormat(object):
-    """Object that implements the Gephi graph streaming API format and returns
-    Python objects corresponding to the events defined in the API.
-    """
-
-    def get_add_node_event(self, identifier, attributes={}):
-        """Generates a Python object corresponding to the event that adds a node
-        with the given identifier and attributes in the Gephi graph streaming API.
-
-        Example::
-
-            >>> api = GephiGraphStreamingAPIFormat()
-            >>> api.get_add_node_event("spam")
-            {'an': {'spam': {}}}
-            >>> api.get_add_node_event("spam", dict(ham="eggs"))
-            {'an': {'spam': {'ham': 'eggs'}}}
-        """
-        return {"an": {identifier: attributes}}
-
-    def get_add_edge_event(self, identifier, source, target, directed, attributes={}):
-        """Generates a Python object corresponding to the event that adds an edge
-        with the given source, target, directednessr and attributes in the Gephi
-        graph streaming API.
-        """
-        result = dict(attributes)
-        result["source"] = source
-        result["target"] = target
-        result["directed"] = bool(directed)
-        return {"ae": {identifier: result}}
-
-    def get_change_node_event(self, identifier, attributes):
-        """Generates a Python object corresponding to the event that changes the
-        attributes of some node in the Gephi graph streaming API. The given attributes
-        are merged into the existing ones; use C{None} as the attribute value to
-        delete a given attribute.
-
-        Example::
-
-            >>> api = GephiGraphStreamingAPIFormat()
-            >>> api.get_change_node_event("spam", dict(ham="eggs"))
-            {'cn': {'spam': {'ham': 'eggs'}}}
-            >>> api.get_change_node_event("spam", dict(ham=None))
-            {'cn': {'spam': {'ham': None}}}
-        """
-        return {"cn": {identifier: attributes}}
-
-    def get_change_edge_event(self, identifier, attributes):
-        """Generates a Python object corresponding to the event that changes the
-        attributes of some edge in the Gephi graph streaming API. The given attributes
-        are merged into the existing ones; use C{None} as the attribute value to
-        delete a given attribute.
-
-        Example::
-
-            >>> api = GephiGraphStreamingAPIFormat()
-            >>> api.get_change_edge_event("spam", dict(ham="eggs"))
-            {'ce': {'spam': {'ham': 'eggs'}}}
-            >>> api.get_change_edge_event("spam", dict(ham=None))
-            {'ce': {'spam': {'ham': None}}}
-        """
-        return {"ce": {identifier: attributes}}
-
-    def get_delete_node_event(self, identifier):
-        """Generates a Python object corresponding to the event that deletes a
-        node with the given identifier in the Gephi graph streaming API.
-
-        Example::
-
-            >>> api = GephiGraphStreamingAPIFormat()
-            >>> api.get_delete_node_event("spam")
-            {'dn': {'spam': {}}}
-        """
-        return {"dn": {identifier: {}}}
-
-    def get_delete_edge_event(self, identifier):
-        """Generates a Python object corresponding to the event that deletes an
-        edge with the given identifier in the Gephi graph streaming API.
-
-        Example::
-
-            >>> api = GephiGraphStreamingAPIFormat()
-            >>> api.get_delete_edge_event("spam:ham")
-            {'de': {'spam:ham': {}}}
-        """
-        return {"de": {identifier: {}}}
-
-
-class GephiGraphStreamer(object):
-    """Class that produces JSON event objects that stream an igraph graph to
-    Gephi using the Gephi Graph Streaming API.
-    
-    The Gephi graph streaming format is a simple JSON-based format that can be used
-    to post mutations to a graph (i.e. node and edge additions, removals and updates)
-    to a remote component. For instance, one can open up Gephi (http://www.gephi.org}),
-    install the Gephi graph streaming plugin and then send a graph from igraph
-    straight into the Gephi window by using `GephiGraphStreamer` with the
-    appropriate URL where Gephi is listening.
-
-    Example::
-
-        >>> from cStringIO import StringIO
-        >>> from igraph import Graph
-        >>> buf = StringIO()
-        >>> streamer = GephiGraphStreamer()
-        >>> graph = Graph.Formula("A --> B, B --> C")
-        >>> streamer.post(graph, buf)
-        >>> print buf.getvalue()         # doctest: +ELLIPSIS, +NORMALIZE_WHITESPACE
-        {"an": {"igraph:...:v:0": {"name": "A"}}}
-        {"an": {"igraph:...:v:1": {"name": "B"}}}
-        {"an": {"igraph:...:v:2": {"name": "C"}}}
-        {"ae": {"igraph:...:e:0:1": {...}}}
-        {"ae": {"igraph:...:e:1:2": {...}}}
-        <BLANKLINE>
-
-    """
-
-    def __init__(self, encoder=None):
-        """Constructs a Gephi graph streamer that will post graphs to a
-        given file-like object or a Gephi connection.
-
-        `encoder` must either be ``None`` or an instance of ``json.JSONEncoder``
-        and it must contain the JSON encoder to be used when posting JSON objects.
-        """
-        self.encoder = encoder or json.JSONEncoder(ensure_ascii=True)
-        self.format = GephiGraphStreamingAPIFormat()
-
-    def iterjsonobj(self, graph):
-        """Iterates over the JSON objects that build up the graph using the Gephi
-        graph streaming API. The objects returned from this function are Python
-        objects; they must be formatted with ``json.dumps`` before sending them
-        to the destination."""
-
-        # Construct a unique ID prefix
-        id_prefix = "igraph:%s" % (hex(id(graph)), )
-
-        # Add the vertices
-        add_node = self.format.get_add_node_event
-        for vertex in graph.vs:
-            yield add_node("%s:v:%d" % (id_prefix, vertex.index), vertex.attributes())
-
-        # Add the edges
-        add_edge = self.format.get_add_edge_event
-        directed = graph.is_directed()
-        for edge in graph.es:
-            yield add_edge("%s:e:%d:%d" % (id_prefix, edge.source, edge.target),
-                    "%s:v:%d" % (id_prefix, edge.source),
-                    "%s:v:%d" % (id_prefix, edge.target),
-                    directed, edge.attributes())
-
-    def post(self, graph, destination, encoder=None):
-        """Posts the given graph to the destination of the streamer using the
-        given JSON encoder. When `encoder` is ``None``, it falls back to the default
-        JSON encoder of the streamer in the `encoder` property.
-        
-        `destination` must be a file-like object or an instance of `GephiConnection`.
-        """
-        encoder = encoder or self.encoder
-        for jsonobj in self.iterjsonobj(graph):
-            self.send_event(jsonobj, destination, encoder=encoder, flush=False)
-        destination.flush()
-
-    def send_event(self, event, destination, encoder=None, flush=True):
-        """Sends a single JSON event to the given destination using the given
-        JSON encoder.  When `encoder` is ``None``, it falls back to the default
-        JSON encoder of the streamer in the `encoder` property.
-        
-        `destination` must be a file-like object or an instance of `GephiConnection`.
-
-        The method flushes the destination after sending the event. If you want to
-        avoid this (e.g., because you are sending many events), set `flush` to
-        ``False``.
-        """
-        encoder = encoder or self.encoder
-        destination.write(encoder.encode(event))
-        destination.write("\r\n")
-        if flush:
-            destination.flush()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/statistics.py igraph-0.6.5/interfaces/python/igraph/statistics.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/statistics.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/statistics.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,673 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""
-Statistics related stuff in igraph
-"""
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-import math
-
-__all__ = ["FittedPowerLaw", "Histogram", "RunningMean", "mean", "median", \
-        "percentile", "quantile", "power_law_fit"]
-
-
-class FittedPowerLaw(object):
-    """Result of fitting a power-law to a vector of samples
-
-    Example:
-
-        >>> result = power_law_fit([1, 2, 3, 4, 5, 6], return_alpha_only=False)
-        >>> result                   # doctest:+ELLIPSIS
-        FittedPowerLaw(continuous=False, alpha=2.425828..., xmin=3.0, L=-7.54633..., D=0.2138..., p=0.99311...)
-        >>> print result             # doctest:+ELLIPSIS
-        Fitted power-law distribution on discrete data
-        <BLANKLINE>
-        Exponent (alpha)  = 2.425828
-        Cutoff (xmin)     = 3.000000
-        <BLANKLINE>
-        Log-likelihood    = -7.546337
-        <BLANKLINE>
-        H0: data was drawn from the fitted distribution
-        <BLANKLINE>
-        KS test statistic = 0.213817
-        p-value           = 0.993111
-        <BLANKLINE>
-        H0 could not be rejected at significance level 0.05
-        >>> result.alpha             # doctest:+ELLIPSIS
-        2.425828...
-        >>> result.xmin
-        3.0
-        >>> result.continuous
-        False
-    """
-
-    def __init__(self, continuous, alpha, xmin, L, D, p):
-        self.continuous = continuous
-        self.xmin = xmin
-        self.alpha = alpha
-        self.L = L
-        self.D = D
-        self.p = p
-
-    def __repr__(self):
-        return "%s(continuous=%r, alpha=%r, xmin=%r, L=%r, D=%r, p=%r)" % \
-                (self.__class__.__name__, self.continuous, self.alpha, \
-                self.xmin, self.L, self.D, self.p)
-
-    def __str__(self):
-        return self.summary(significance=0.05)
-
-    def summary(self, significance=0.05):
-        """Returns the summary of the power law fit.
-
-        @param significance: the significance level of the Kolmogorov-Smirnov test
-          used to decide whether the input data could have come from the fitted
-          distribution
-        @return: the summary as a string
-        """
-        result = ["Fitted power-law distribution on %s data" % \
-                ("discrete", "continuous")[bool(self.continuous)]]
-        result.append("")
-        result.append("Exponent (alpha)  = %f" % self.alpha)
-        result.append("Cutoff (xmin)     = %f" % self.xmin)
-        result.append("")
-        result.append("Log-likelihood    = %f" % self.L)
-        result.append("")
-        result.append("H0: data was drawn from the fitted distribution")
-        result.append("")
-        result.append("KS test statistic = %f" % self.D)
-        result.append("p-value           = %f" % self.p)
-        result.append("")
-        if self.p < significance:
-            result.append("H0 rejected at significance level %g" \
-                    % significance)
-        else:
-            result.append("H0 could not be rejected at significance "\
-                    "level %g" % significance)
-
-        return "\n".join(result)
-
-
-class Histogram(object):
-    """Generic histogram class for real numbers
-    
-    Example:
-        
-        >>> h = Histogram(5)     # Initializing, bin width = 5
-        >>> h << [2,3,2,7,8,5,5,0,7,9]     # Adding more items
-        >>> print h
-        N = 10, mean +- sd: 4.8000 +- 2.9740
-        [ 0,  5): **** (4)
-        [ 5, 10): ****** (6)
-    """
-
-    def __init__(self, bin_width = 1, data = None):
-        """Initializes the histogram with the given data set.
-
-        @param bin_width: the bin width of the histogram.
-        @param data: the data set to be used. Must contain real numbers.
-        """
-        self._bin_width = float(bin_width)
-        self._bins = None
-        self._min, self._max = None, None
-        self._running_mean = RunningMean()
-        self.clear()
-
-        if data:
-            self.add_many(data)
-
-    def _get_bin(self, num, create = False):
-        """Returns the bin index corresponding to the given number.
-
-        @param num: the number for which the bin is being sought
-        @param create: whether to create a new bin if no bin exists yet.
-        @return: the index of the bin or C{None} if no bin exists yet and
-          {create} is C{False}."""
-        if len(self._bins) == 0:
-            if not create:
-                result = None
-            else: 
-                self._min = int(num/self._bin_width)*self._bin_width
-                self._max = self._min+self._bin_width
-                self._bins = [0]
-                result = 0
-            return result
-
-        if num >= self._min:
-            binidx = int((num-self._min)/self._bin_width)
-            if binidx < len(self._bins):
-                return binidx
-            if not create:
-                return None
-            extra_bins = binidx-len(self._bins)+1
-            self._bins.extend([0]*extra_bins)
-            self._max = self._min + len(self._bins)*self._bin_width
-            return binidx
-
-        if not create:
-            return None
-
-        extra_bins = int(math.ceil((self._min-num)/self._bin_width))
-        self._bins[0:0] = [0]*extra_bins
-        self._min -= extra_bins*self._bin_width
-        self._max = self._min + len(self._bins)*self._bin_width
-        return 0
-
-    @property
-    def n(self):
-        """Returns the number of elements in the histogram"""
-        return len(self._running_mean)
-
-    @property
-    def mean(self):
-        """Returns the mean of the elements in the histogram"""
-        return self._running_mean.mean
-
-    # pylint: disable-msg=C0103
-    @property
-    def sd(self):
-        """Returns the standard deviation of the elements in
-        the histogram"""
-        return self._running_mean.sd
-
-    @property
-    def var(self):
-        """Returns the variance of the elements in the histogram"""
-        return self._running_mean.var
-
-    def add(self, num, repeat=1):
-        """Adds a single number to the histogram.
-        
-        @param num: the number to be added
-        @param repeat: number of repeated additions
-        """
-        num = float(num)
-        binidx = self._get_bin(num, True)
-        self._bins[binidx] += repeat 
-        self._running_mean.add(num, repeat)
-
-    def add_many(self, data):
-        """Adds a single number or the elements of an iterable to the histogram.
-
-        @param data: the data to be added"""
-        try:
-            iterator = iter(data)
-        except TypeError:
-            iterator = iter([data])
-        for x in iterator:
-            self.add(x)
-    __lshift__ = add_many
-
-    def clear(self):
-        """Clears the collected data"""
-        self._bins = []
-        self._min, self._max = None, None
-        self._running_mean = RunningMean()
-
-    def bins(self):
-        """Generator returning the bins of the histogram in increasing order
-        
-        @return: a tuple with the following elements: left bound, right bound,
-          number of elements in the bin"""
-        x = self._min
-        for elem in self._bins:
-            yield (x, x+self._bin_width, elem)
-            x += self._bin_width
-
-    def __plot__(self, context, bbox, _, **kwds):
-        """Plotting support"""
-        from igraph.drawing.coord import DescartesCoordinateSystem
-        coord_system = DescartesCoordinateSystem(context, bbox, \
-            (kwds.get("min", self._min), 0, \
-             kwds.get("max", self._max), kwds.get("max_value", max(self._bins))
-            ))
-
-        # Draw the boxes
-        context.set_line_width(1)
-        context.set_source_rgb(1., 0., 0.)
-        x = self._min
-        for value in self._bins:
-            top_left_x, top_left_y = coord_system.local_to_context(x, value)
-            x += self._bin_width
-            bottom_right_x, bottom_right_y = coord_system.local_to_context(x, 0)
-            context.rectangle(top_left_x, top_left_y, \
-                              bottom_right_x - top_left_x, \
-                              bottom_right_y - top_left_y)
-            context.fill()
-
-        # Draw the axes
-        coord_system.draw()
-
-    def to_string(self, max_width=78, show_bars=True, show_counts=True):
-        """Returns the string representation of the histogram.
-
-        @param max_width: the maximal width of each line of the string
-          This value may not be obeyed if it is too small.
-        @param show_bars: specify whether the histogram bars should be shown
-        @param show_counts: specify whether the histogram counts should be
-          shown. If both I{show_bars} and I{show_counts} are C{False},
-          only a general descriptive statistics (number of elements, mean and
-          standard deviation) is shown.
-        """
-
-        if self._min is None or self._max is None:
-            return "N = 0"
-
-        # Determine how many decimal digits should we use
-        if int(self._min) == self._min and int(self._bin_width) == self._bin_width:
-            number_format = "%d"
-        else:
-            number_format = "%.3f"
-        num_length = max(len(number_format % self._min), \
-                         len(number_format % self._max))
-        number_format = "%" + str(num_length) + number_format[1:]
-        format_string = "[%s, %s): %%s" % (number_format, number_format)
-
-        # Calculate the scale of the bars on the histogram
-        if show_bars:
-            maxval = max(self._bins)
-            if show_counts:
-                maxval_length = len(str(maxval))
-                scale = maxval // (max_width-2*num_length-maxval_length-9)
-            else:
-                scale = maxval // (max_width-2*num_length-6)
-            scale = max(scale, 1)
-
-        result = ["N = %d, mean +- sd: %.4f +- %.4f" % \
-            (self.n, self.mean, self.sd)]
-
-        if show_bars:
-            # Print the bars
-            if scale > 1:
-                result.append("Each * represents %d items" % scale)
-            if show_counts:
-                format_string += " (%d)"
-                for left, right, cnt in self.bins():
-                    result.append(format_string % (left, right, '*'*(cnt//scale), cnt))
-            else:
-                for left, right, cnt in self.bins():
-                    result.append(format_string % (left, right, '*'*(cnt//scale)))
-        elif show_counts:
-            # Print the counts only
-            for left, right, cnt in self.bins():
-                result.append(format_string % (left, right, cnt))
-
-        return "\n".join(result)
-
-    def __str__(self):
-        return self.to_string()
-
-
-
-class RunningMean(object):
-    """Running mean calculator.
-    
-    This class can be used to calculate the mean of elements from a
-    list, tuple, iterable or any other data source. The mean is
-    calculated on the fly without explicitly summing the values,
-    so it can be used for data sets with arbitrary item count. Also
-    capable of returning the standard deviation (also calculated on
-    the fly)
-    """
-
-    # pylint: disable-msg=C0103
-    def __init__(self, items=None, n=0.0, mean=0.0, sd=0.0):
-        """RunningMean(items=None, n=0.0, mean=0.0, sd=0.0)
-        
-        Initializes the running mean calculator.
-        
-        There are two possible ways to initialize the calculator.
-        First, one can provide an iterable of items; alternatively,
-        one can specify the number of items, the mean and the
-        standard deviation if we want to continue an interrupted
-        calculation.
-
-        @param items: the items that are used to initialize the
-          running mean calcuator. If C{items} is given, C{n},
-          C{mean} and C{sd} must be zeros.
-        @param n: the initial number of elements already processed.
-          If this is given, C{items} must be C{None}.
-        @param mean: the initial mean. If this is given, C{items}
-          must be C{None}.
-        @param sd: the initial standard deviation. If this is given,
-          C{items} must be C{None}."""
-        if items is not None:
-            if n != 0 or mean != 0 or sd != 0:
-                raise ValueError("n, mean and sd must be zeros if items is not None")
-            self.clear()
-            self.add_many(items)
-        else:
-            self._nitems = float(n)
-            self._mean = float(mean)
-            if n > 1:
-                self._sqdiff = float(sd) ** 2 * float(n-1)
-                self._sd = float(sd)
-            else:
-                self._sqdiff = 0.0
-                self._sd = 0.0
-        
-    def add(self, value, repeat=1):
-        """RunningMean.add(value, repeat=1)
-        
-        Adds the given value to the elements from which we calculate
-        the mean and the standard deviation.
-
-        @param value: the element to be added
-        @param repeat: number of repeated additions
-        """
-        repeat = int(repeat)
-        self._nitems += repeat
-        delta = value - self._mean
-        self._mean += (repeat*delta / self._nitems)
-        self._sqdiff += (repeat*delta) * (value - self._mean)
-        if self._nitems > 1:
-            self._sd = (self._sqdiff / (self._nitems-1)) ** 0.5
-
-    def add_many(self, values):
-        """RunningMean.add(values)
-        
-        Adds the values in the given iterable to the elements from
-        which we calculate the mean. Can also accept a single number.
-        The left shift (C{<<}) operator is aliased to this function,
-        so you can use it to add elements as well:
-            
-          >>> rm=RunningMean()
-          >>> rm << [1,2,3,4] 
-          >>> rm.result               # doctest:+ELLIPSIS
-          (2.5, 1.290994...)
-        
-        @param values: the element(s) to be added
-        @type values: iterable"""
-        try:
-            iterator = iter(values)
-        except TypeError:
-            iterator = iter([values])
-        for value in iterator:
-            self.add(value)
-
-    def clear(self):
-        """Resets the running mean calculator."""
-        self._nitems, self._mean = 0.0, 0.0
-        self._sqdiff, self._sd = 0.0, 0.0
-
-    @property
-    def result(self):
-        """Returns the current mean and standard deviation as a tuple"""
-        return self._mean, self._sd
-
-    @property
-    def mean(self):
-        """Returns the current mean"""
-        return self._mean
-
-    @property
-    def sd(self):
-        """Returns the current standard deviation"""
-        return self._sd
-
-    @property
-    def var(self):
-        """Returns the current variation"""
-        return self._sd ** 2
-
-    def __repr__(self):
-        return "%s(n=%r, mean=%r, sd=%r)" % \
-                (self.__class__.__name__, int(self._nitems),
-                        self._mean, self._sd)
-
-    def __str__(self):
-        return "Running mean (N=%d, %f +- %f)" % \
-            (self._nitems, self._mean, self._sd)
-    
-    __lshift__ = add_many
-    
-    def __float__(self):
-        return float(self._mean)
-
-    def __int__(self):
-        return int(self._mean)
-
-    def __long__(self):
-        return long(self._mean)
-
-    def __complex__(self):
-        return complex(self._mean)
-
-    def __len__(self):
-        return self._nitems
-
-
-def mean(xs):
-    """Returns the mean of an iterable.
-
-    Example:
-
-        >>> mean([1, 4, 7, 11])
-        5.75
-
-    @param xs: an iterable yielding numbers.
-    @return: the mean of the numbers provided by the iterable.
-
-    @see: RunningMean() if you also need the variance or the standard deviation
-    """
-    return RunningMean(xs).mean
-
-def median(xs, sort=True):
-    """Returns the median of an unsorted or sorted numeric vector.
-
-    @param xs: the vector itself.
-    @param sort: whether to sort the vector. If you know that the vector is
-      sorted already, pass C{False} here.
-    @return: the median, which will always be a float, even if the vector
-      contained integers originally.
-    """
-    if sort:
-        xs = sorted(xs)
-
-    mid = int(len(xs) / 2)
-    if 2 * mid == len(xs):
-        return float(xs[mid-1] + xs[mid]) / 2
-    else:
-        return float(xs[mid])
-
-def percentile(xs, p=(25, 50, 75), sort=True):
-    """Returns the pth percentile of an unsorted or sorted numeric vector.
-
-    This is equivalent to calling quantile(xs, p/100.0); see L{quantile}
-    for more details on the calculation.
-
-    Example:
-
-        >>> round(percentile([15, 20, 40, 35, 50], 40), 2)
-        26.0
-        >>> for perc in percentile([15, 20, 40, 35, 50], (0, 25, 50, 75, 100)):
-        ...     print "%.2f" % perc
-        ...
-        15.00
-        17.50
-        35.00
-        45.00
-        50.00
-
-    @param xs: the vector itself.
-    @param p: the percentile we are looking for. It may also be a list if you
-      want to calculate multiple quantiles with a single call. The default
-      value calculates the 25th, 50th and 75th percentile.
-    @param sort: whether to sort the vector. If you know that the vector is
-      sorted already, pass C{False} here.
-    @return: the pth percentile, which will always be a float, even if the vector
-      contained integers originally. If p is a list, the result will also be a
-      list containing the percentiles for each item in the list.
-    """
-    if hasattr(p, "__iter__"):
-        return quantile(xs, (x/100.0 for x in p), sort)
-    return quantile(xs, p/100.0, sort)
-
-def power_law_fit(data, xmin=None, method="auto", return_alpha_only=True):
-    """Fitting a power-law distribution to empirical data
-
-    @param data: the data to fit, a list containing integer values
-    @param xmin: the lower bound for fitting the power-law. If C{None},
-      the optimal xmin value will be estimated as well. Zero means that
-      the smallest possible xmin value will be used.
-    @param method: the fitting method to use. The following methods are
-      implemented so far:
-
-        - C{continuous}, C{hill}: exact maximum likelihood estimation
-          when the input data comes from a continuous scale. This is
-          known as the Hill estimator. The statistical error of
-          this estimator is M{(alpha-1) / sqrt(n)}, where alpha is the
-          estimated exponent and M{n} is the number of data points above
-          M{xmin}. The estimator is known to exhibit a small finite
-          sample-size bias of order M{O(n^-1)}, which is small when
-          M{n > 100}. igraph will try to compensate for the finite sample
-          size if n is small.
-
-        - C{discrete}: exact maximum likelihood estimation when the
-          input comes from a discrete scale (see Clauset et al among the
-          references).
-
-        - C{auto}: exact maximum likelihood estimation where the continuous
-          method is used if the input vector contains at least one fractional
-          value and the discrete method is used if the input vector contains
-          integers only.
-
-    @param return_alpha_only: whether to return the fitted exponent only.
-      When this argument is C{True}, the function will return the fitted power-law
-      exponent only. When C{False}, the function will return a L{FittedPowerLaw}
-      object with much more details. The default value is C{True} for the time
-      being for sake of compatibility with earlier releases, but it will be changed
-      to C{False} from igraph 0.7 onwards.
-
-    @return: the fitted exponent or a L{FittedPowerLaw} object, depending on the
-      value of C{return_alpha_only}.
-    
-    @newfield ref: Reference
-    @ref: MEJ Newman: Power laws, Pareto distributions and Zipf's law.
-      Contemporary Physics 46, 323-351 (2005)
-    @ref: A Clauset, CR Shalizi, MEJ Newman: Power-law distributions
-      in empirical data. E-print (2007). arXiv:0706.1062"""
-    from igraph._igraph import _power_law_fit
-
-    if xmin is None or xmin < 0:
-        xmin = -1
-
-    method = method.lower()
-    if method not in ("continuous", "hill", "discrete", "auto"):
-        raise ValueError("unknown method: %s" % method)
-
-    force_continuous = method in ("continuous", "hill")
-    fit = FittedPowerLaw(*_power_law_fit(data, xmin, force_continuous))
-    if return_alpha_only:
-        from warnings import warn
-        warn("power_law_fit will return a FittedPowerLaw object from igraph "\
-                "0.7 onwards. Better prepare for that by setting return_alpha_only "\
-                "to False when calling power_law_fit()", PendingDeprecationWarning,
-                stacklevel=3)
-        return fit.alpha
-    else:
-        return fit
-
-def quantile(xs, q=(0.25, 0.5, 0.75), sort=True):
-    """Returns the qth quantile of an unsorted or sorted numeric vector.
-
-    There are a number of different ways to calculate the sample quantile. The
-    method implemented by igraph is the one recommended by NIST. First we
-    calculate a rank n as q(N+1), where N is the number of items in xs, then we
-    split n into its integer component k and decimal component d. If k <= 1,
-    we return the first element; if k >= N, we return the last element,
-    otherwise we return the linear interpolation between xs[k-1] and xs[k]
-    using a factor d.
-
-    Example:
-
-        >>> round(quantile([15, 20, 40, 35, 50], 0.4), 2)
-        26.0
-
-    @param xs: the vector itself.
-    @param q: the quantile we are looking for. It may also be a list if you
-      want to calculate multiple quantiles with a single call. The default
-      value calculates the 25th, 50th and 75th percentile.
-    @param sort: whether to sort the vector. If you know that the vector is
-      sorted already, pass C{False} here.
-    @return: the qth quantile, which will always be a float, even if the vector
-      contained integers originally. If q is a list, the result will also be a
-      list containing the quantiles for each item in the list.
-    """
-    if not xs:
-        raise ValueError("xs must not be empty")
-
-    if sort:
-        xs = sorted(xs)
-
-    if hasattr(q, "__iter__"):
-        qs = q
-        return_single = False
-    else:
-        qs = [q]
-        return_single = True
-
-    result = []
-    for q in qs:
-        if q < 0 or q > 1:
-            raise ValueError("q must be between 0 and 1")
-        n = float(q) * (len(xs)+1)
-        k, d = int(n), n-int(n)
-        if k >= len(xs):
-            result.append(xs[-1])
-        elif k < 1:
-            result.append(xs[0])
-        else:
-            result.append((1-d) * xs[k-1] + d * xs[k])
-    if return_single:
-        result = result[0]
-    return result
-
-def sd(xs):
-    """Returns the standard deviation of an iterable.
-
-    Example:
-
-        >>> sd([1, 4, 7, 11])       #doctest:+ELLIPSIS
-        4.2720...
-
-    @param xs: an iterable yielding numbers.
-    @return: the standard deviation of the numbers provided by the iterable.
-
-    @see: RunningMean() if you also need the mean
-    """
-    return RunningMean(xs).sd
-
-def var(xs):
-    """Returns the variance of an iterable.
-
-    Example:
-
-        >>> var([1, 4, 8, 11])            #doctest:+ELLIPSIS
-        19.333333...
-
-    @param xs: an iterable yielding numbers.
-    @return: the variance of the numbers provided by the iterable.
-
-    @see: RunningMean() if you also need the mean
-    """
-    return RunningMean(xs).var
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/summary.py igraph-0.6.5/interfaces/python/igraph/summary.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/summary.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/summary.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,375 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Summary representation of a graph.
-
-@undocumented: _get_wrapper_for_width, FakeWrapper
-"""
-
-from igraph.vendor import vendor_import
-from igraph.statistics import median
-from itertools import islice
-from math import ceil
-from textwrap import TextWrapper
-
-__all__ = ["GraphSummary"]
-
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-texttable = vendor_import("texttable")
-
-class FakeWrapper(object):
-    """Object whose interface is compatible with C{textwrap.TextWrapper}
-    but does no wrapping."""
-
-    def __init__(self, *args, **kwds):
-        pass
-
-    def fill(self, text):
-        return [text]
-
-    def wrap(self, text):
-        return [text]
-
-def _get_wrapper_for_width(width, *args, **kwds):
-    """Returns a text wrapper that wraps text for the given width.
-
-    @param width: the maximal width of each line that the text wrapper
-      produces. C{None} means that no wrapping will be performed.
-    """
-    if width is None:
-        return FakeWrapper(*args, **kwds)
-    return TextWrapper(width=width, *args, **kwds)
-
-class GraphSummary(object):
-    """Summary representation of a graph.
-
-    The summary representation includes a header line and the list of
-    edges. The header line consists of C{IGRAPH}, followed by a
-    four-character long code, the number of vertices, the number of
-    edges, two dashes (C{--}) and the name of the graph (i.e.
-    the contents of the C{name} attribute, if any). For instance,
-    a header line may look like this::
-
-        IGRAPH U--- 4 5 --
-
-    The four-character code describes some basic properties of the
-    graph. The first character is C{U} if the graph is undirected,
-    C{D} if it is directed. The second letter is C{N} if the graph
-    has a vertex attribute called C{name}, or a dash otherwise. The
-    third letter is C{W} if the graph is weighted (i.e. it has an
-    edge attribute called C{weight}), or a dash otherwise. The
-    fourth letter is C{B} if the graph has a vertex attribute called
-    C{type}; this is usually used for bipartite graphs.
-
-    Edges may be presented as an ordinary edge list or an adjacency
-    list. By default, this depends on the number of edges; however,
-    you can control it with the appropriate constructor arguments.
-
-    @undocumented: _construct_edgelist_adjlist, _construct_edgelist_compressed,
-      _construct_edgelist_edgelist, _construct_graph_attributes,
-      _construct_vertex_attributes, _construct_header, _edge_attribute_iterator,
-      _infer_column_alignment, _new_table, _vertex_attribute_iterator
-    """
-
-
-    def __init__(self, graph, verbosity=0, width=78,
-            edge_list_format="auto",
-            max_rows=99999,
-            print_graph_attributes=False,
-            print_vertex_attributes=False,
-            print_edge_attributes=False,
-            full=False):
-        """Constructs a summary representation of a graph.
-
-        @param verbosity: the verbosity of the summary. If zero, only
-          the header line will be returned. If one, the header line
-          and the list of edges will both be returned.
-        @param width: the maximal width of each line in the summary.
-          C{None} means that no limit will be enforced.
-        @param max_rows: the maximal number of rows to print in a single
-          table (e.g., vertex attribute table or edge attribute table)
-        @param edge_list_format: format of the edge list in the summary.
-          Supported formats are: C{compressed}, C{adjlist}, C{edgelist},
-          C{auto}, which selects automatically from the other three based
-          on some simple criteria.
-        @param print_graph_attributes: whether to print graph attributes
-          if there are any.
-        @param print_vertex_attributes: whether to print vertex attributes
-          if there are any.
-        @param print_edge_attributes: whether to print edge attributes
-          if there are any.
-        @param full: False has no effect; True turns on the attribute
-          printing for graph, vertex and edge attributes with verbosity 1.
-        """
-        if full:
-            print_graph_attributes = True
-            print_vertex_attributes = True
-            print_edge_attributes = True
-            verbosity = max(verbosity, 1)
-
-        self._graph = graph
-        self.edge_list_format = edge_list_format.lower()
-        self.max_rows = int(max_rows)
-        self.print_graph_attributes = print_graph_attributes
-        self.print_vertex_attributes = print_vertex_attributes
-        self.print_edge_attributes = print_edge_attributes
-        self.verbosity = verbosity
-        self.width = width
-        self.wrapper = _get_wrapper_for_width(self.width,
-                break_on_hyphens=False)
-
-        if self._graph.is_named():
-            self._edges_header = "+ edges (vertex names):"
-        else:
-            self._edges_header = "+ edges:"
-        self._arrow = ["--", "->"][self._graph.is_directed()]
-        self._arrow_format = "%%s%s%%s" % self._arrow
-
-    def _construct_edgelist_adjlist(self):
-        """Constructs the part in the summary that prints the edge list in an
-        adjacency list format."""
-        result = [self._edges_header]
-        arrow = self._arrow_format
-
-        if self._graph.vcount() == 0:
-            return
-
-        if self._graph.is_named():
-            names = self._graph.vs["name"]
-            maxlen = max(len(name) for name in names)
-            format_str = "%%%ds %s %%s" % (maxlen, self._arrow)
-            for v1, name in enumerate(names):
-                neis = self._graph.successors(v1)
-                neis = ", ".join(str(names[v2]) for v2 in neis)
-                result.append(format_str % (name, neis))
-        else:
-            maxlen = len(str(self._graph.vcount()))
-            num_format = "%%%dd" % maxlen
-            format_str = "%s %s %%s" % (num_format, self._arrow)
-            for v1 in xrange(self._graph.vcount()):
-                neis = self._graph.successors(v1)
-                neis = " ".join(num_format % v2 for v2 in neis)
-                result.append(format_str % (v1, neis))
-
-        # Try to wrap into multiple columns if that works with the given width
-        if self.width is not None:
-            maxlen = max(len(line) for line in result[1:])
-            colcount = int(self.width + 3) / int(maxlen + 3)
-            if colcount > 1:
-                # Rewrap to multiple columns
-                nrows = len(result) - 1
-                colheight = int(ceil(nrows / float(colcount)))
-                newrows = [[] for _ in xrange(colheight)]
-                for i, row in enumerate(result[1:]):
-                    newrows[i % colheight].append(row.ljust(maxlen))
-                result[1:] = ["   ".join(row) for row in newrows]
-
-        return result
-
-    def _construct_edgelist_compressed(self):
-        """Constructs the part in the summary that prints the edge list in a
-        compressed format suitable for graphs with mostly small degrees."""
-        result = [self._edges_header]
-        arrow = self._arrow_format
-
-        if self._graph.is_named():
-            names = self._graph.vs["name"]
-            edges = ", ".join(arrow % (names[edge.source], names[edge.target])
-                for edge in self._graph.es)
-        else:
-            edges = " ".join(arrow % edge.tuple for edge in self._graph.es)
-
-        result.append(edges)
-        return result
-
-    def _construct_edgelist_edgelist(self):
-        """Constructs the part in the summary that prints the edge list in a
-        full edge list format."""
-        attrs = sorted(self._graph.edge_attributes())
-
-        table = self._new_table(headers=["", "edge"] + attrs)
-        table.add_rows(islice(self._edge_attribute_iterator(attrs), 0, self.max_rows),
-                header=False)
-        table.set_cols_align(["l", "l"] + self._infer_column_alignment(edge_attrs=attrs))
-
-        result = [self._edges_header]
-        result.extend(table.draw().split("\n"))
-
-        return result
-
-    def _construct_graph_attributes(self):
-        """Constructs the part in the summary that lists the graph attributes."""
-        attrs = self._graph.attributes()
-        if not attrs:
-            return []
-        
-        result = ["+ graph attributes:"]
-        attrs.sort()
-        for attr in attrs:
-            result.append("[[%s]]" % (attr, ))
-            result.append(str(self._graph[attr]))
-        return result
-
-    def _construct_vertex_attributes(self):
-        """Constructs the part in the summary that lists the vertex attributes."""
-        attrs = sorted(self._graph.vertex_attributes())
-        if not attrs or (len(attrs) == 1 and "name" in attrs):
-            return []
-
-        table = self._new_table(headers=[""] + attrs)
-        table.add_rows(islice(self._vertex_attribute_iterator(attrs), 0, self.max_rows),
-                header=False)
-        table.set_cols_align(["l"] + self._infer_column_alignment(vertex_attrs=attrs))
-
-        result = ["+ vertex attributes:"]
-        result.extend(table.draw().split("\n"))
-
-        return result
-
-    def _construct_header(self):
-        """Constructs the header part of the summary."""
-        graph = self._graph
-        params = dict(
-                directed="UD"[graph.is_directed()],
-                named="-N"[graph.is_named()],
-                weighted="-W"[graph.is_weighted()],
-                typed="-T"["type" in graph.vertex_attributes()],
-                vcount=graph.vcount(),
-                ecount=graph.ecount(),
-        )
-        if "name" in graph.attributes():
-            params["name"] = graph["name"]
-        else:
-            params["name"] = ""
-        result = ["IGRAPH %(directed)s%(named)s%(weighted)s%(typed)s "\
-                  "%(vcount)d %(ecount)d -- %(name)s" % params]
-
-        attrs = ["%s (g)" % (name, ) for name in sorted(graph.attributes())]
-        attrs.extend("%s (v)" % (name, ) for name in sorted(graph.vertex_attributes()))
-        attrs.extend("%s (e)" % (name, ) for name in sorted(graph.edge_attributes()))
-        if attrs:
-            result.append("+ attr: %s" % ", ".join(attrs))
-            if self.wrapper is not None:
-                self.wrapper.subsequent_indent = '  '
-                result[-1:] = self.wrapper.wrap(result[-1])
-                self.wrapper.subsequent_indent = ''
-
-        return result
-
-    def _edge_attribute_iterator(self, attribute_order):
-        """Returns an iterator that yields the rows of the edge attribute table
-        in the summary. `attribute_order` must be a list containing the names of
-        the attributes to be presented in this table."""
-        arrow = self._arrow_format
-
-        if self._graph.is_named():
-            edges = ", ".join(arrow % (names[edge.source], names[edge.target])
-                for edge in self._graph.es)
-        else:
-            edges = " ".join(arrow % edge.tuple for edge in self._graph.es)
-
-        if self._graph.is_named():
-            names = self._graph.vs["name"]
-            for edge in self._graph.es:
-                formatted_edge = arrow % (names[edge.source], names[edge.target])
-                yield ["[%d]" % edge.index, formatted_edge] + \
-                        [edge[attr] for attr in attribute_order]
-        else:
-            for edge in self._graph.es:
-                formatted_edge = arrow % edge.tuple
-                yield ["[%d]" % edge.index, formatted_edge] + \
-                        [edge[attr] for attr in attribute_order]
-
-    def _infer_column_alignment(self, vertex_attrs=None, edge_attrs=None):
-        """Infers the preferred alignment for the given vertex and edge attributes
-        in the tables by peeking into the attribute values of the first 100 vertices
-        or edges. Numeric attributes will be aligned right, everything else will be
-        aligned left."""
-        values = []
-        if vertex_attrs is not None:
-            vs = self._graph.vs[:100]
-            values.extend(vs[attr] for attr in vertex_attrs)
-        if edge_attrs is not None:
-            es = self._graph.es[:100]
-            values.extend(es[attr] for attr in edge_attrs)
-
-        result = []
-        for vs in values:
-            is_numeric = True
-            try:
-                [float(x) for x in vs]
-            except ValueError:
-                is_numeric = False
-            if is_numeric:
-                result.append("r")
-            else:
-                result.append("l")
-
-        return result
-
-    def _new_table(self, headers=None):
-        """Constructs a new table to pretty-print vertex and edge attributes"""
-        table = texttable.Texttable(max_width=0)
-        table.set_deco(0)
-        if headers is not None:
-            table.header(headers)
-        return table
-
-    def _vertex_attribute_iterator(self, attribute_order):
-        """Returns an iterator that yields the rows of the vertex attribute table
-        in the summary. `attribute_order` must be a list containing the names of
-        the attributes to be presented in this table."""
-        for vertex in self._graph.vs:
-            yield ["[%d]" % vertex.index] + [vertex[attr] for attr in attribute_order]
-
-    def __str__(self):
-        """Returns the summary representation as a string."""
-        output = self._construct_header()
-
-        if self.print_graph_attributes:
-            output.extend(self._construct_graph_attributes())
-        if self.print_vertex_attributes:
-            output.extend(self._construct_vertex_attributes())
-
-        if self.verbosity <= 0:
-            return "\n".join(output)
-
-        if self._graph.ecount() > 0:
-            # Add the edge list
-            if self.edge_list_format == "auto":
-                if (self.print_edge_attributes and self._graph.edge_attributes()):
-                    format = "edgelist"
-                elif median(self._graph.degree(mode="out")) < 3:
-                    format = "compressed"
-                else:
-                    format = "adjlist"
-            else:
-                format = self.edge_list_format
-
-            method_name = "_construct_edgelist_%s" % format
-            if hasattr(self, method_name):
-                output.extend(getattr(self, method_name)())
-
-        if self.wrapper is not None:
-            return "\n".join("\n".join(self.wrapper.wrap(line)) for line in output)
-
-        return "\n".join(output)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/__init__.py igraph-0.6.5/interfaces/python/igraph/test/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-import unittest
-from igraph.test import basic, layouts, games, foreign, structural, flow, \
-    spectral, attributes, cliques, decomposition, operators, generators, \
-    isomorphism, colortests, vertexseq, edgeseq, iterators, bipartite, \
-    conversion, rng, separators, indexing, atlas, matching, homepage
-
-def suite():
-    return unittest.TestSuite( \
-        [basic.suite(),
-         layouts.suite(),
-         generators.suite(),
-         games.suite(),
-         foreign.suite(),
-         structural.suite(),
-         flow.suite(),
-         spectral.suite(),
-         attributes.suite(),
-         vertexseq.suite(),
-         edgeseq.suite(),
-         cliques.suite(),
-         decomposition.suite(),
-         conversion.suite(),
-         operators.suite(),
-         isomorphism.suite(),
-         iterators.suite(),
-         bipartite.suite(),
-         colortests.suite(),
-         rng.suite(),
-         separators.suite(),
-         indexing.suite(),
-         atlas.suite(),
-         matching.suite(),
-         homepage.suite()] \
-    )
-    
-def run_tests(verbosity=1):
-    try:
-        # Support for testoob to have nice colored output
-        import testoob
-        runner = testoob.main
-    except ImportError:
-        runner = unittest.TextTestRunner(verbosity=verbosity).run
-    runner(suite())
-
-# Make nosetest skip run_tests
-run_tests.__test__ = False
-
-if __name__ == "__main__":
-    run_tests(255)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/atlas.py igraph-0.6.5/interfaces/python/igraph/test/atlas.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/atlas.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/atlas.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,111 +0,0 @@
-from __future__ import division
-
-import warnings
-import unittest
-from igraph import *
-
-class TestBase(unittest.TestCase):
-    def testPageRank(self):
-        for idx, g in enumerate(self.__class__.graphs):
-            try:
-                pr = g.pagerank()
-            except Exception, ex:
-                self.assertTrue(False, msg="PageRank calculation threw exception for graph #%d: %s" % (idx, ex))
-                raise
-
-            if g.vcount() == 0:
-                self.assertEqual([], pr)
-                continue
-
-            self.assertAlmostEqual(1.0, sum(pr), places=5, \
-                    msg="PageRank sum is not 1.0 for graph #%d (%r)" % (idx, pr))
-            self.assertTrue(min(pr) >= 0, \
-                    msg="Minimum PageRank is less than 0 for graph #%d (%r)" % (idx, pr))
-
-    def testEigenvectorCentrality(self):
-        # Temporarily turn off the warning handler because g.evcent() will print
-        # a warning for DAGs
-        warnings.simplefilter("ignore")
-
-        try:
-            for idx, g in enumerate(self.__class__.graphs):
-                try:
-                    ec, eval = g.evcent(return_eigenvalue=True)
-                except Exception, ex:
-                    self.assertTrue(False, msg="Eigenvector centrality threw exception for graph #%d: %s" % (idx, ex))
-                    raise
-
-                if g.vcount() == 0:
-                    self.assertEqual([], ec)
-                    continue
-
-                if not g.is_connected():
-                    # Skip disconnected graphs; this will be fixed in igraph 0.7
-                    continue
-
-                n = g.vcount()
-                if abs(eval) < 1e-4:
-                    self.assertTrue(min(ec) >= -1e-10,
-                            msg="Minimum eigenvector centrality is smaller than 0 for graph #%d" % idx)
-                    self.assertTrue(max(ec) <= 1,
-                            msg="Maximum eigenvector centrality is greater than 1 for graph #%d" % idx)
-                    continue
-
-                self.assertAlmostEqual(max(ec), 1, places=7, \
-                        msg="Maximum eigenvector centrality is %r (not 1) for graph #%d (%r)" % \
-                        (max(ec), idx, ec))
-                self.assertTrue(min(ec) >= 0, \
-                        msg="Minimum eigenvector centrality is less than 0 for graph #%d" % idx)
-
-                ec2 = [sum(ec[u.index] for u in v.predecessors()) for v in g.vs]
-                for i in xrange(n):
-                    self.assertAlmostEqual(ec[i] * eval, ec2[i], places=7, \
-                            msg="Eigenvector centrality in graph #%d seems to be invalid "\
-                            "for vertex %d" % (idx, i))
-        finally:
-            # Reset the warning handler
-            warnings.resetwarnings()
-
-    def testHubScore(self):
-        for idx, g in enumerate(self.__class__.graphs):
-            sc = g.hub_score()
-            if g.vcount() == 0:
-                self.assertEqual([], sc)
-                continue
-
-            self.assertAlmostEqual(max(sc), 1, places=7, \
-                    msg="Maximum authority score is not 1 for graph #%d" % idx)
-            self.assertTrue(min(sc) >= 0, \
-                    msg="Minimum hub score is less than 0 for graph #%d" % idx)
-
-    def testAuthorityScore(self):
-        for idx, g in enumerate(self.__class__.graphs):
-            sc = g.authority_score()
-            if g.vcount() == 0:
-                self.assertEqual([], sc)
-                continue
-
-            self.assertAlmostEqual(max(sc), 1, places=7, \
-                    msg="Maximum authority score is not 1 for graph #%d" % idx)
-            self.assertTrue(min(sc) >= 0, \
-                    msg="Minimum authority score is less than 0 for graph #%d" % idx)
-
-class GraphAtlasTests(TestBase):
-    graphs = [Graph.Atlas(i) for i in xrange(1253)]
-
-class IsoclassTests(TestBase):
-    graphs = [Graph.Isoclass(3, i, directed=True) for i in xrange(16)] + \
-             [Graph.Isoclass(4, i, directed=True) for i in xrange(218)]
-
-def suite():
-    atlas_suite = unittest.makeSuite(GraphAtlasTests)
-    isoclass_suite = unittest.makeSuite(IsoclassTests)
-    return unittest.TestSuite([atlas_suite, isoclass_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/attributes.py igraph-0.6.5/interfaces/python/igraph/test/attributes.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/attributes.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/attributes.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,226 +0,0 @@
-# vim:ts=4 sw=4 sts=4:
-import unittest
-from igraph import *
-
-class AttributeTests(unittest.TestCase):
-    def testGraphAttributes(self):
-        g = Graph.Full(5)
-        g["date"] = "2005-12-17"
-        self.failUnless(g["date"] == "2005-12-17")
-        del g["date"]
-        self.assertRaises(KeyError, g.__getitem__, "date")
-
-    def testVertexAttributes(self):
-        g = Graph.Full(5)
-        g.vs[0]["name"] = "first"
-        self.failUnless(g.vs[0]["name"] == "first")
-        del g.vs["name"]
-        self.assertRaises(KeyError, g.vs.__getitem__, "name")
-
-        g.vs[0]["name"] = "second"
-        g.vs[0]["date"] = "2007-12-17"
-        ans = g.vs[0].attribute_names()
-        ans.sort()
-        self.failUnless(ans == ["date", "name"])
-        attrs = g.vs[0].attributes()
-        self.failUnless(attrs == {"name": "second", "date": "2007-12-17"})
-
-    def testEdgeAttributes(self):
-        g = Graph.Full(5)
-        g.es[0]["name"] = "first"
-        self.failUnless(g.es[0]["name"] == "first")
-        del g.es["name"]
-        self.assertRaises(KeyError, g.es.__getitem__, "name")
-
-        g.es[0]["name"] = "second"
-        g.es[0]["date"] = "2007-12-17"
-        ans = g.es[0].attribute_names()
-        ans.sort()
-        self.failUnless(ans == ["date", "name"])
-        attrs = g.es[0].attributes()
-        self.failUnless(attrs == {"name": "second", "date": "2007-12-17"})
-
-    def testMassVertexAttributeAssignment(self):
-        g = Graph.Full(5)
-        g.vs.set_attribute_values("name", range(5))
-        self.failUnless(g.vs.get_attribute_values("name") == range(5))
-        g.vs["name"] = range(5,10)
-        self.failUnless(g.vs["name"] == range(5,10))
-        g.vs["name2"] = (1,2,3,4,6) 
-        self.failUnless(g.vs["name2"] == [1,2,3,4,6])
-        g.vs.set_attribute_values("name", [2])
-        self.failUnless(g.vs["name"] == [2]*5)
-
-    def testMassEdgeAttributeAssignment(self):
-        g = Graph.Full(5)
-        g.es.set_attribute_values("name", range(10))
-        self.failUnless(g.es.get_attribute_values("name") == range(10))
-        g.es["name"] = range(10,20)
-        self.failUnless(g.es["name"] == range(10,20))
-        g.es["name2"] = (1,2,3,4,6,1,2,3,4,6) 
-        self.failUnless(g.es["name2"] == [1,2,3,4,6,1,2,3,4,6])
-        g.es.set_attribute_values("name", [2])
-        self.failUnless(g.es["name"] == [2]*10)
-
-    def testVertexNameIndexing(self):
-        g = Graph.Famous("bull")
-        g.vs["name"] = ["foo", "bar", "baz", "fred", "thud"]
-        self.failUnless(g.degree("bar") == 3)
-        self.failUnless(g.degree(["bar", "fred", 0]) == [3, 1, 2])
-        g.vs[2]["name"] = "quack"
-        self.assertRaises(ValueError, g.degree, "baz")
-        self.failUnless(g.degree("quack") == 3)
-        self.failUnless(g.degree(u"quack") == 3)
-        self.failUnless(g.degree([u"bar", u"thud", 0]) == [3, 1, 2])
-        del g.vs["name"]
-        self.assertRaises(ValueError, g.degree, [u"bar", u"thud", 0])
-
-
-class AttributeCombinationTests(unittest.TestCase):
-    def setUp(self):
-        el = [(0,1), (1,0), (1,2), (2,3), (2,3), (2,3), (3,3)] 
-        self.g = Graph(el)
-        self.g.es["weight"] = [1, 2, 3, 4, 5, 6, 7]
-        self.g.es["weight2"] = [1, 2, 3, 4, 5, 6, 7]
-
-    def testCombinationMax(self):
-        g = self.g
-        g.simplify(combine_edges="max")
-        self.failUnless(g.es["weight"] == [2, 3, 6])
-        self.failUnless(g.es["weight2"] == [2, 3, 6])
-
-    def testCombinationMin(self):
-        g = self.g
-        g.simplify(combine_edges="min")
-        self.failUnless(g.es["weight"] == [1, 3, 4])
-        self.failUnless(g.es["weight2"] == [1, 3, 4])
-
-    def testCombinationRandom(self):
-        g = self.g
-        g.simplify(combine_edges="random")
-        del g.es["weight2"]
-        for i in xrange(100):
-            self.failUnless(g.es[0]["weight"] in (1, 2))
-            self.failUnless(g.es[1]["weight"] == 3)
-            self.failUnless(g.es[2]["weight"] in (4, 5, 6))
-
-    def testCombinationMean(self):
-        g = self.g
-        g.simplify(combine_edges="mean")
-        self.failUnless(g.es["weight"] == [1.5, 3, 5])
-        self.failUnless(g.es["weight2"] == [1.5, 3, 5])
-
-    def testCombinationMedian(self):
-        g = self.g
-        g.es["weight2"] = [1, 0, 2, 4, 8, 6, 7]
-        g.simplify(combine_edges="median")
-        self.failUnless(g.es["weight"] == [1.5, 3, 5])
-        self.failUnless(g.es["weight2"] == [0.5, 2, 6])
-
-    def testCombinationSum(self):
-        g = self.g
-        g.simplify(combine_edges="sum")
-        self.failUnless(g.es["weight"] == [3, 3, 15])
-        self.failUnless(g.es["weight2"] == [3, 3, 15])
-
-    def testCombinationProd(self):
-        g = self.g
-        g.simplify(combine_edges="prod")
-        self.failUnless(g.es["weight"] == [2, 3, 120])
-        self.failUnless(g.es["weight2"] == [2, 3, 120])
-
-    def testCombinationMedian(self):
-        g = self.g
-        g.es["weight2"] = [1, 0, 2, 4, 8, 6, 7]
-        g.simplify(combine_edges="median")
-        self.failUnless(g.es["weight"] == [1.5, 3, 5])
-        self.failUnless(g.es["weight2"] == [0.5, 2, 6])
-
-    def testCombinationFirst(self):
-        g = self.g
-        g.es["weight2"] = [1, 0, 2, 6, 8, 4, 7]
-        g.simplify(combine_edges="first")
-        self.failUnless(g.es["weight"] == [1, 3, 4])
-        self.failUnless(g.es["weight2"] == [1, 2, 6])
-
-    def testCombinationLast(self):
-        g = self.g
-        g.es["weight2"] = [1, 0, 2, 6, 8, 4, 7]
-        g.simplify(combine_edges="last")
-        self.failUnless(g.es["weight"] == [2, 3, 6])
-        self.failUnless(g.es["weight2"] == [0, 2, 4])
-
-    def testCombinationConcat(self):
-        g = self.g
-        g.es["name"] = list("ABCDEFG")
-        g.simplify(combine_edges=dict(name="concat"))
-        self.failIf("weight" in g.edge_attributes())
-        self.failIf("weight2" in g.edge_attributes())
-        self.failUnless(g.es["name"] == ["AB", "C", "DEF"])
-
-    def testCombinationMaxMinIgnore(self):
-        g = self.g
-        g.es["name"] = list("ABCDEFG")
-        g.simplify(combine_edges={"weight": "min", "weight2": "max", "name": "ignore"})
-        self.failUnless(g.es["weight"] == [1, 3, 4])
-        self.failUnless(g.es["weight2"] == [2, 3, 6])
-        self.failIf("name" in g.edge_attributes())
-
-    def testCombinationIgnoreAsNone(self):
-        g = self.g
-        g.es["name"] = list("ABCDEFG")
-        g.simplify(combine_edges={"weight": "min", "name": None})
-        self.failUnless(g.es["weight"] == [1, 3, 4])
-        self.failIf("weight2" in g.edge_attributes())
-        self.failIf("name" in g.edge_attributes())
-
-    def testCombinationFunction(self):
-        g = self.g
-
-        def join_dash(l):
-            return "-".join(l)
-
-        g.es["name"] = list("ABCDEFG")
-        g.simplify(combine_edges={"weight": max, "name": join_dash})
-        self.failUnless(g.es["weight"] == [2, 3, 6])
-        self.failIf("weight2" in g.edge_attributes())
-        self.failUnless(g.es["name"] == ["A-B", "C", "D-E-F"])
-
-    def testCombinationDefault(self):
-        g = self.g
-        g.simplify(combine_edges={None: "max"})
-        self.failUnless(g.es["weight"] == [2, 3, 6])
-        self.failUnless(g.es["weight2"] == [2, 3, 6])
-
-    def testCombinationDefaultOverride(self):
-        g = self.g
-        g.simplify(combine_edges={None: "max", "weight": "sum"})
-        self.failUnless(g.es["weight"] == [3, 3, 15])
-        self.failUnless(g.es["weight2"] == [2, 3, 6])
-
-    def testCombinationTypeMismatch(self):
-        g = self.g
-        g.es["weight"] = list("ABCDEFG")
-        self.assertRaises(TypeError, g.simplify, combine_edges={"weight": "mean"})
-
-    def testCombinationNonexistentAttribute(self):
-        g = self.g
-        g.simplify(combine_edges={"nonexistent": max})
-        self.failUnless(g.edge_attributes() == [])
-
-    def testCombinationNone(self):
-        g = self.g
-        g.simplify()
-        self.failUnless(sorted(g.edge_attributes()) == [])
-
-def suite():
-    attribute_suite = unittest.makeSuite(AttributeTests)
-    attribute_combination_suite = unittest.makeSuite(AttributeCombinationTests)
-    return unittest.TestSuite([attribute_suite, attribute_combination_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/basic.py igraph-0.6.5/interfaces/python/igraph/test/basic.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/basic.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/basic.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,459 +0,0 @@
-import unittest
-from igraph import *
-
-class BasicTests(unittest.TestCase):
-    def testGraphCreation(self):
-        g = Graph()
-        self.failUnless(isinstance(g, Graph))
-        self.failUnless(g.vcount() == 0 and g.ecount() == 0 and g.is_directed() == False)
-
-        g=Graph(3, [(0,1), (1,2), (2,0)])
-        self.failUnless(g.vcount() == 3 and g.ecount() == 3 and g.is_directed() == False and g.is_simple() == True)
-        g=Graph(2, [(0,1), (1,2), (2,3)], True)
-        self.failUnless(g.vcount() == 4 and g.ecount() == 3 and g.is_directed() == True and g.is_simple())
-        g=Graph([(0,1), (1,2), (2,1)])
-        self.failUnless(g.vcount() == 3 and g.ecount() == 3 and g.is_directed() == False and g.is_simple() == False)
-        g=Graph([(0,1), (0,0), (1,2)])
-        self.failUnless(g.vcount() == 3 and g.ecount() == 3 and g.is_directed() == False and g.is_simple() == False)
-
-    def testAddVertex(self):
-        g = Graph()
-        g.add_vertex()
-        self.failUnless(g.vcount() == 1 and g.ecount() == 0)
-        self.failIf("name" in g.vertex_attributes())
-        g.add_vertex("foo")
-        self.failUnless(g.vcount() == 2 and g.ecount() == 0)
-        self.failUnless("name" in g.vertex_attributes())
-        self.assertEquals(g.vs["name"], [None, "foo"])
-        g.add_vertex(3)
-        self.failUnless(g.vcount() == 3 and g.ecount() == 0)
-        self.failUnless("name" in g.vertex_attributes())
-        self.assertEquals(g.vs["name"], [None, "foo", 3])
-        g.add_vertex(name="bar")
-        self.failUnless(g.vcount() == 4 and g.ecount() == 0)
-        self.failUnless("name" in g.vertex_attributes())
-        self.assertEquals(g.vs["name"], [None, "foo", 3, "bar"])
-        g.add_vertex(name="frob", spam="cheese", ham=42)
-        self.failUnless(g.vcount() == 5 and g.ecount() == 0)
-        self.assertEquals(sorted(g.vertex_attributes()), ["ham", "name", "spam"])
-        self.assertEquals(g.vs["spam"], [None]*4 + ["cheese"])
-        self.assertEquals(g.vs["ham"], [None]*4 + [42])
-
-    def testAddVertices(self):
-        g = Graph()
-        g.add_vertices(2)
-        self.failUnless(g.vcount() == 2 and g.ecount() == 0)
-        g.add_vertices("spam")
-        self.failUnless(g.vcount() == 3 and g.ecount() == 0)
-        self.assertEquals(g.vs[2]["name"], "spam")
-        g.add_vertices(["bacon", "eggs"])
-        self.failUnless(g.vcount() == 5 and g.ecount() == 0)
-        self.assertEquals(g.vs[2:]["name"], ["spam", "bacon", "eggs"])
-
-    def testDeleteVertices(self):
-        g = Graph([(0,1), (1,2), (2,3), (0,2), (3,4), (4,5)])
-        self.assertEquals(6, g.vcount())
-        self.assertEquals(6, g.ecount())
-
-        # Delete a single vertex
-        g.delete_vertices(4)
-        self.assertEquals(5, g.vcount())
-        self.assertEquals(4, g.ecount())
-
-        # Delete multiple vertices
-        g.delete_vertices([1,3])
-        self.assertEquals(3, g.vcount())
-        self.assertEquals(1, g.ecount())
-
-        # Delete a vertex sequence
-        g.delete_vertices(g.vs[:2])
-        self.assertEquals(1, g.vcount())
-        self.assertEquals(0, g.ecount())
-
-        # Delete a single vertex object
-        g.vs[0].delete()
-        self.assertEquals(0, g.vcount())
-        self.assertEquals(0, g.ecount())
-
-        # Delete vertices by name
-        g = Graph.Full(4)
-        g.vs["name"] = ["spam", "bacon", "eggs", "ham"]
-        self.assertEquals(4, g.vcount())
-        g.delete_vertices("spam")
-        self.assertEquals(3, g.vcount())
-        g.delete_vertices(["bacon", "ham"])
-        self.assertEquals(1, g.vcount())
-
-        # Deleting a nonexistent vertex
-        self.assertRaises(ValueError, g.delete_vertices, "no-such-vertex")
-        self.assertRaises(InternalError, g.delete_vertices, 2)
-
-    def testAddEdges(self):
-        g = Graph()
-        g.add_vertices(["spam", "bacon", "eggs", "ham"])
-
-        g.add_edges([(0, 1)])
-        self.assertEquals(g.vcount(), 4)
-        self.assertEquals(g.get_edgelist(), [(0, 1)])
-
-        g.add_edges([(1, 2), (2, 3), (1, 3)])
-        self.assertEquals(g.vcount(), 4)
-        self.assertEquals(g.get_edgelist(), [(0, 1), (1, 2), (2, 3), (1, 3)])
-
-        g.add_edges([("spam", "eggs"), ("spam", "ham")])
-        self.assertEquals(g.vcount(), 4)
-        self.assertEquals(g.get_edgelist(), [(0, 1), (1, 2), (2, 3), (1, 3), (0, 2), (0, 3)])
-
-    def testDeleteEdges(self):
-        g = Graph.Famous("petersen")
-        g.vs["name"] = list("ABCDEFGHIJ")
-        el = g.get_edgelist()
-
-        self.assertEquals(15, g.ecount())
-
-        # Deleting single edge
-        g.delete_edges(14)
-        el[14:] = []
-        self.assertEquals(14, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting multiple edges
-        g.delete_edges([2,5,7])
-        el[7:8] = []; el[5:6] = []; el[2:3] = []
-        self.assertEquals(11, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting edge object
-        g.es[6].delete()
-        el[6:7] = []
-        self.assertEquals(10, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting edge sequence object
-        g.es[1:4].delete()
-        el[1:4] = []
-        self.assertEquals(7, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting edges by IDs
-        g.delete_edges([(2,7), (5,8)])
-        el[4:5] = []; el[1:2] = []
-        self.assertEquals(5, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting edges by names
-        g.delete_edges([("D", "I"), ("G", "I")])
-        el[3:4] = []; el[1:2] = []
-        self.assertEquals(3, g.ecount())
-        self.assertEquals(el, g.get_edgelist())
-
-        # Deleting nonexistent edges
-        self.assertRaises(ValueError, g.delete_edges, [(0,2)])
-        self.assertRaises(ValueError, g.delete_edges, [("A", "C")])
-        self.assertRaises(ValueError, g.delete_edges, [(0,15)])
-
-    def testGraphGetEids(self):
-        g = Graph.Famous("petersen")
-        eids = g.get_eids(pairs=[(0,1), (0,5), (1, 6), (4, 9), (8, 6)])
-        self.failUnless(eids == [0, 2, 4, 9, 12])
-        eids = g.get_eids(path=[0, 1, 2, 3, 4])
-        self.failUnless(eids == [0, 3, 5, 7])
-        eids = g.get_eids(pairs=[(7,9), (9,6)], path = [7, 9, 6])
-        self.failUnless(eids == [14, 13, 14, 13])
-        self.assertRaises(InternalError, g.get_eids, pairs=[(0,1), (0,2)])
-
-    def testAdjacency(self):
-        g=Graph(4, [(0,1), (1,2), (2,0), (2,3)], directed=True)
-        self.failUnless(g.neighbors(2) == [0, 1, 3])
-        self.failUnless(g.predecessors(2) == [1])
-        self.failUnless(g.successors(2) == [0, 3])
-        self.failUnless(g.get_adjlist() == [[1], [2], [0,3], []])
-        self.failUnless(g.get_adjlist(IN) == [[2], [0], [1], [2]])
-        self.failUnless(g.get_adjlist(ALL) == [[1,2], [0,2], [0,1,3], [2]])
-        
-    def testEdgeIncidency(self):
-        g=Graph(4, [(0,1), (1,2), (2,0), (2,3)], directed=True)
-        self.failUnless(g.incident(2) == [2, 3])
-        self.failUnless(g.incident(2, IN) == [1])
-        self.failUnless(g.incident(2, ALL) == [2, 3, 1])
-        self.failUnless(g.get_inclist() == [[0], [1], [2,3], []])
-        self.failUnless(g.get_inclist(IN) == [[2], [0], [1], [3]])
-        self.failUnless(g.get_inclist(ALL) == [[0,2], [1,0], [2,3,1], [3]])
-
-
-    def testMultiplesLoops(self):
-        g=Graph.Tree(7, 2)
-
-        # has_multiple
-        self.failIf(g.has_multiple())
-
-        g.add_vertices(1)
-        g.add_edges([(0,1), (7,7), (6,6), (6,6), (6,6)])
-        
-        # is_loop
-        self.failUnless(g.is_loop() == [False, False, False, False, \
-            False, False, False, True, True, True, True])
-        self.failUnless(g.is_loop(g.ecount()-2))
-        self.failUnless(g.is_loop(range(6,8)) == [False, True])
-
-        # is_multiple
-        self.failUnless(g.is_multiple() == [False, False, False, False, \
-            False, False, True, False, False, True, True])
-
-        # has_multiple
-        self.failUnless(g.has_multiple())
-
-        # count_multiple
-        self.failUnless(g.count_multiple() == [2, 1, 1, 1, 1, 1, 2, 1, 3, 3, 3])
-        self.failUnless(g.count_multiple(g.ecount()-1) == 3)
-        self.failUnless(g.count_multiple(range(2,5)) == [1, 1, 1])
-
-        # check if a mutual directed edge pair is reported as multiple
-        g=Graph(2, [(0,1), (1,0)], directed=True)
-        self.failUnless(g.is_multiple() == [False, False])
-
-
-    def testPickling(self):
-        import pickle
-        g=Graph([(0,1), (1,2)])
-        g["data"]="abcdef"
-        g.vs["data"]=[3,4,5]
-        g.es["data"]=["A", "B"]
-        g.custom_data = None
-        pickled=pickle.dumps(g)
-
-        g2=pickle.loads(pickled)
-        self.failUnless(g["data"] == g2["data"])
-        self.failUnless(g.vs["data"] == g2.vs["data"])
-        self.failUnless(g.es["data"] == g2.es["data"])
-        self.failUnless(g.vcount() == g2.vcount())
-        self.failUnless(g.ecount() == g2.ecount())
-        self.failUnless(g.is_directed() == g2.is_directed())
-        self.failUnless(g2.custom_data == g.custom_data)
-
-
-class DatatypeTests(unittest.TestCase):
-    def testMatrix(self):
-        m = Matrix([[1,2,3], [4,5], [6,7,8]])
-        self.failUnless(m.shape == (3, 3))
-
-        # Reading data
-        self.failUnless(m.data == [[1,2,3], [4,5,0], [6,7,8]])
-        self.failUnless(m[1,1] == 5)
-        self.failUnless(m[0] == [1,2,3])
-        self.failUnless(m[0,:] == [1,2,3])
-        self.failUnless(m[:,0] == [1,4,6])
-        self.failUnless(m[2,0:2] == [6,7])
-        self.failUnless(m[:,:].data == [[1,2,3], [4,5,0], [6,7,8]])
-        self.failUnless(m[:,1:3].data == [[2,3], [5,0], [7,8]])
-
-        # Writing data
-        m[1,1] = 10
-        self.failUnless(m[1,1] == 10)
-        m[1] = (6,5,4)
-        self.failUnless(m[1] == [6,5,4])
-        m[1:3] = [[4,5,6], (7,8,9)]
-        self.failUnless(m[1:3].data == [[4,5,6], [7,8,9]])
-
-        # Minimums and maximums
-        self.failUnless(m.min() == 1)
-        self.failUnless(m.max() == 9)
-        self.failUnless(m.min(0) == [1,2,3])
-        self.failUnless(m.max(0) == [7,8,9])
-        self.failUnless(m.min(1) == [1,4,7])
-        self.failUnless(m.max(1) == [3,6,9])
-
-        # Special constructors
-        m=Matrix.Fill(2, (3,3))
-        self.failUnless(m.min() == 2 and m.max() == 2 and m.shape == (3,3))
-        m=Matrix.Zero(5, 4)
-        self.failUnless(m.min() == 0 and m.max() == 0 and m.shape == (5,4))
-        m=Matrix.Identity(3)
-        self.failUnless(m.data == [[1,0,0], [0,1,0], [0,0,1]])
-        m=Matrix.Identity(3, 2)
-        self.failUnless(m.data == [[1,0], [0,1], [0,0]])
-
-        # Conversion to string
-        m=Matrix.Identity(3)
-        self.failUnless(str(m) == "[[1, 0, 0]\n [0, 1, 0]\n [0, 0, 1]]")
-        self.failUnless(repr(m) == "Matrix([[1, 0, 0], [0, 1, 0], [0, 0, 1]])")
-
-
-class GraphDictListTests(unittest.TestCase):
-    def setUp(self):
-        self.vertices = [ \
-                {"name": "Alice", "age": 48, "gender": "F"},
-                {"name": "Bob",   "age": 33, "gender": "M"},
-                {"name": "Cecil", "age": 45, "gender": "F"},
-                {"name": "David", "age": 34, "gender": "M"}
-        ]
-        self.edges = [ \
-                {"source": "Alice", "target": "Bob",   "friendship": 4, "advice": 4},
-                {"source": "Cecil", "target": "Bob",   "friendship": 5, "advice": 5},
-                {"source": "Cecil", "target": "Alice", "friendship": 5, "advice": 5},
-                {"source": "David", "target": "Alice", "friendship": 2, "advice": 4},
-                {"source": "David", "target": "Bob",   "friendship": 1, "advice": 2}
-        ]
-
-    def testGraphFromDictList(self):
-        g = Graph.DictList(self.vertices, self.edges)
-        self.checkIfOK(g, "name")
-        g = Graph.DictList(self.vertices, self.edges, iterative=True)
-        self.checkIfOK(g, "name")
-
-    def testGraphFromDictIterator(self):
-        g = Graph.DictList(iter(self.vertices), iter(self.edges))
-        self.checkIfOK(g, "name")
-        g = Graph.DictList(iter(self.vertices), iter(self.edges), iterative=True)
-        self.checkIfOK(g, "name")
-
-    def testGraphFromDictIteratorNoVertices(self):
-        g = Graph.DictList(None, iter(self.edges))
-        self.checkIfOK(g, "name", check_vertex_attrs=False)
-        g = Graph.DictList(None, iter(self.edges), iterative=True)
-        self.checkIfOK(g, "name", check_vertex_attrs=False)
-
-    def testGraphFromDictListExtraVertexName(self):
-        del self.vertices[2:]      # No data for "Cecil" and "David"
-        g = Graph.DictList(self.vertices, self.edges)
-        self.failUnless(g.vcount() == 4 and g.ecount() == 5 and g.is_directed() == False)
-        self.failUnless(g.vs["name"] == ["Alice", "Bob", "Cecil", "David"])
-        self.failUnless(g.vs["age"] == [48, 33, None, None])
-        self.failUnless(g.vs["gender"] == ["F", "M", None, None])
-        self.failUnless(g.es["friendship"] == [4, 5, 5, 2, 1])
-        self.failUnless(g.es["advice"] == [4, 5, 5, 4, 2])
-        self.failUnless(g.get_edgelist() == [(0, 1), (1, 2), (0, 2), (0, 3), (1, 3)])
-
-    def testGraphFromDictListAlternativeName(self):
-        for vdata in self.vertices:
-            vdata["name_alternative"] = vdata["name"]
-            del vdata["name"]
-        g = Graph.DictList(self.vertices, self.edges, vertex_name_attr="name_alternative")
-        self.checkIfOK(g, "name_alternative")
-        g = Graph.DictList(self.vertices, self.edges, vertex_name_attr="name_alternative", \
-                iterative=True)
-        self.checkIfOK(g, "name_alternative")
-
-    def checkIfOK(self, g, name_attr, check_vertex_attrs=True):
-        self.failUnless(g.vcount() == 4 and g.ecount() == 5 and g.is_directed() == False)
-        self.failUnless(g.get_edgelist() == [(0, 1), (1, 2), (0, 2), (0, 3), (1, 3)])
-        self.failUnless(g.vs[name_attr] == ["Alice", "Bob", "Cecil", "David"])
-        if check_vertex_attrs:
-            self.failUnless(g.vs["age"] == [48, 33, 45, 34])
-            self.failUnless(g.vs["gender"] == ["F", "M", "F", "M"])
-        self.failUnless(g.es["friendship"] == [4, 5, 5, 2, 1])
-        self.failUnless(g.es["advice"] == [4, 5, 5, 4, 2])
-
-
-class GraphTupleListTests(unittest.TestCase):
-    def setUp(self):
-        self.edges = [ \
-                ("Alice", "Bob", 4, 4),
-                ("Cecil", "Bob", 5, 5),
-                ("Cecil", "Alice", 5, 5),
-                ("David", "Alice", 2, 4),
-                ("David", "Bob", 1, 2)
-        ]
-
-    def testGraphFromTupleList(self):
-        g = Graph.TupleList(self.edges)
-        self.checkIfOK(g, "name", ())
-
-    def testGraphFromTupleListWithEdgeAttributes(self):
-        g = Graph.TupleList(self.edges, edge_attrs=("friendship", "advice"))
-        self.checkIfOK(g, "name", ("friendship", "advice"))
-        g = Graph.TupleList(self.edges, edge_attrs=("friendship", ))
-        self.checkIfOK(g, "name", ("friendship", ))
-        g = Graph.TupleList(self.edges, edge_attrs="friendship")
-        self.checkIfOK(g, "name", ("friendship", ))
-
-    def testGraphFromTupleListWithDifferentNameAttribute(self):
-        g = Graph.TupleList(self.edges, vertex_name_attr="spam")
-        self.checkIfOK(g, "spam", ())
-
-    def testGraphFromTupleListWithWeights(self):
-        g = Graph.TupleList(self.edges, weights=True)
-        self.checkIfOK(g, "name", ("weight", ))
-        g = Graph.TupleList(self.edges, weights="friendship")
-        self.checkIfOK(g, "name", ("friendship", ))
-        g = Graph.TupleList(self.edges, weights=False)
-        self.checkIfOK(g, "name", ())
-        self.assertRaises(ValueError, Graph.TupleList,
-                [self.edges], weights=True, edge_attrs="friendship")
-
-    def testNoneForMissingAttributes(self):
-        g = Graph.TupleList(self.edges, edge_attrs=("friendship", "advice", "spam"))
-        self.checkIfOK(g, "name", ("friendship", "advice", "spam"))
-
-    def checkIfOK(self, g, name_attr, edge_attrs):
-        self.failUnless(g.vcount() == 4 and g.ecount() == 5 and g.is_directed() == False)
-        self.failUnless(g.get_edgelist() == [(0, 1), (1, 2), (0, 2), (0, 3), (1, 3)])
-        self.failUnless(g.attributes() == [])
-        self.failUnless(g.vertex_attributes() == [name_attr])
-        self.failUnless(g.vs[name_attr] == ["Alice", "Bob", "Cecil", "David"])
-        if edge_attrs:
-            self.failUnless(sorted(g.edge_attributes()) == sorted(edge_attrs))
-            self.failUnless(g.es[edge_attrs[0]] == [4, 5, 5, 2, 1])
-            if len(edge_attrs) > 1:
-                self.failUnless(g.es[edge_attrs[1]] == [4, 5, 5, 4, 2])
-            if len(edge_attrs) > 2:
-                self.failUnless(g.es[edge_attrs[2]] == [None] * 5)
-        else:
-            self.failUnless(g.edge_attributes() == [])
-
-
-class DegreeSequenceTests(unittest.TestCase):
-    def testIsDegreeSequence(self):
-        self.assertTrue(is_degree_sequence([]))
-        self.assertTrue(is_degree_sequence([], []))
-        self.assertTrue(is_degree_sequence([0]))
-        self.assertTrue(is_degree_sequence([0], [0]))
-        self.assertFalse(is_degree_sequence([1]))
-        self.assertTrue(is_degree_sequence([1], [1]))
-        self.assertTrue(is_degree_sequence([2]))
-        self.assertFalse(is_degree_sequence([2, 1, 1, 1]))
-        self.assertTrue(is_degree_sequence([2, 1, 1, 1], [1, 1, 1, 2]))
-        self.assertFalse(is_degree_sequence([2, 1, -2]))
-        self.assertFalse(is_degree_sequence([2, 1, 1, 1], [1, 1, 1, -2]))
-        self.assertTrue(is_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3]))
-        self.assertTrue(is_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3], None))
-        self.assertFalse(is_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]))
-        self.assertTrue(is_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3],
-            [4, 3, 2, 3, 4, 4, 2, 2, 4, 2]))
-
-    def testIsGraphicalSequence(self):
-        self.assertTrue(is_graphical_degree_sequence([]))
-        self.assertTrue(is_graphical_degree_sequence([], []))
-        self.assertTrue(is_graphical_degree_sequence([0]))
-        self.assertTrue(is_graphical_degree_sequence([0], [0]))
-        self.assertFalse(is_graphical_degree_sequence([1]))
-        self.assertTrue(is_graphical_degree_sequence([1], [1]))
-        self.assertFalse(is_graphical_degree_sequence([2]))
-        self.assertFalse(is_graphical_degree_sequence([2, 1, 1, 1]))
-        self.assertTrue(is_graphical_degree_sequence([2, 1, 1, 1], [1, 1, 1, 2]))
-        self.assertFalse(is_graphical_degree_sequence([2, 1, -2]))
-        self.assertFalse(is_graphical_degree_sequence([2, 1, 1, 1], [1, 1, 1, -2]))
-        self.assertTrue(is_graphical_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3]))
-        self.assertTrue(is_graphical_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3], None))
-        self.assertFalse(is_graphical_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]))
-        self.assertTrue(is_graphical_degree_sequence([3, 3, 3, 3, 3, 3, 3, 3, 3, 3],
-            [4, 3, 2, 3, 4, 4, 2, 2, 4, 2]))
-        self.assertTrue(is_graphical_degree_sequence([3, 3, 3, 3, 4]))
-
-
-def suite():
-    basic_suite = unittest.makeSuite(BasicTests)
-    datatype_suite = unittest.makeSuite(DatatypeTests)
-    graph_dict_list_suite = unittest.makeSuite(GraphDictListTests)
-    graph_tuple_list_suite = unittest.makeSuite(GraphTupleListTests)
-    degree_sequence_suite = unittest.makeSuite(DegreeSequenceTests)
-    return unittest.TestSuite([basic_suite, datatype_suite, graph_dict_list_suite,
-        graph_tuple_list_suite, degree_sequence_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/bipartite.py igraph-0.6.5/interfaces/python/igraph/test/bipartite.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/bipartite.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/bipartite.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,106 +0,0 @@
-import unittest
-from igraph import *
-
-class BipartiteTests(unittest.TestCase):
-    def testCreateBipartite(self):
-        g = Graph.Bipartite([0, 1]*5, [(0,1),(2,3),(4,5),(6,7),(8,9)])
-        self.failUnless(g.vcount() == 10 and g.ecount() == 5 and g.is_directed() == False)
-        self.failUnless(g.is_bipartite())
-        self.failUnless(g.vs["type"] == [False, True]*5)
-
-    def testFullBipartite(self):
-        g = Graph.Full_Bipartite(10, 5)
-        self.failUnless(g.vcount() == 15 and g.ecount() == 50 and g.is_directed() == False)
-        expected = sorted([(i, j) for i in xrange(10) for j in xrange(10, 15)])
-        self.failUnless(sorted(g.get_edgelist()) == expected)
-        self.failUnless(g.vs["type"] == [False]*10 + [True]*5)
-
-        g = Graph.Full_Bipartite(10, 5, directed=True, mode=OUT)
-        self.failUnless(g.vcount() == 15 and g.ecount() == 50 and g.is_directed() == True)
-        self.failUnless(sorted(g.get_edgelist()) == expected)
-        self.failUnless(g.vs["type"] == [False]*10 + [True]*5)
-
-        g = Graph.Full_Bipartite(10, 5, directed=True, mode=IN)
-        self.failUnless(g.vcount() == 15 and g.ecount() == 50 and g.is_directed() == True)
-        self.failUnless(sorted(g.get_edgelist()) == sorted([(i,j) for j, i in expected]))
-        self.failUnless(g.vs["type"] == [False]*10 + [True]*5)
-
-        g = Graph.Full_Bipartite(10, 5, directed=True)
-        self.failUnless(g.vcount() == 15 and g.ecount() == 100 and g.is_directed() == True)
-        expected.extend([(j, i) for i, j in expected])
-        expected.sort()
-        self.failUnless(sorted(g.get_edgelist()) == expected)
-        self.failUnless(g.vs["type"] == [False]*10 + [True]*5)
-
-    def testIncidence(self):
-        g = Graph.Incidence([[0, 1, 1], [1, 2, 0]])
-        self.failUnless(g.vcount() == 5 and g.ecount() == 4 and g.is_directed() == False)
-        self.failUnless(g.vs["type"] == [False]*2 + [True]*3)
-        self.failUnless(sorted(g.get_edgelist()) == [(0,3),(0,4),(1,2),(1,3)])
-
-        g = Graph.Incidence([[0, 1, 1], [1, 2, 0]], multiple=True)
-        self.failUnless(g.vcount() == 5 and g.ecount() == 5 and g.is_directed() == False)
-        self.failUnless(g.vs["type"] == [False]*2 + [True]*3)
-        self.failUnless(sorted(g.get_edgelist()) == [(0,3),(0,4),(1,2),(1,3),(1,3)])
-
-        g = Graph.Incidence([[0, 1, 1], [1, 2, 0]], directed=True)
-        self.failUnless(g.vcount() == 5 and g.ecount() == 4 and g.is_directed() == True)
-        self.failUnless(g.vs["type"] == [False]*2 + [True]*3)
-        self.failUnless(sorted(g.get_edgelist()) == [(0,3),(0,4),(1,2),(1,3)])
-
-        g = Graph.Incidence([[0, 1, 1], [1, 2, 0]], directed=True, mode="in")
-        self.failUnless(g.vcount() == 5 and g.ecount() == 4 and g.is_directed() == True)
-        self.failUnless(g.vs["type"] == [False]*2 + [True]*3)
-        self.failUnless(sorted(g.get_edgelist()) == [(2,1),(3,0),(3,1),(4,0)])
-
-    def testGetIncidence(self):
-        mat = [[0, 1, 1], [1, 1, 0]]
-        v1, v2 = [0, 1], [2, 3, 4]
-        g = Graph.Incidence(mat)
-        self.failUnless(g.get_incidence() == (mat, v1, v2))
-        g.vs["type2"] = g.vs["type"]
-        self.failUnless(g.get_incidence("type2") == (mat, v1, v2))
-        self.failUnless(g.get_incidence(g.vs["type2"]) == (mat, v1, v2))
-
-    def testBipartiteProjection(self):
-        g = Graph.Full_Bipartite(10, 5)
-        g1, g2 = g.bipartite_projection()
-        self.failUnless(g1.isomorphic(Graph.Full(10)))
-        self.failUnless(g2.isomorphic(Graph.Full(5)))
-        self.failUnless(g1.es["weight"] == [5] * 45)
-        self.failUnless(g2.es["weight"] == [10] * 10)
-        self.failUnless(g.bipartite_projection_size() == (10, 45, 5, 10))
-        g1, g2 = g.bipartite_projection(probe1=10)
-        self.failUnless(g1.isomorphic(Graph.Full(5)))
-        self.failUnless(g2.isomorphic(Graph.Full(10)))
-        g1, g2 = g.bipartite_projection(multiplicity=False)
-        self.failUnless(g1.isomorphic(Graph.Full(10)))
-        self.failUnless(g2.isomorphic(Graph.Full(5)))
-        self.failUnless("weight" not in g1.edge_attributes())
-        self.failUnless("weight" not in g2.edge_attributes())
-
-    def testIsBipartite(self):
-        g = Graph.Star(10)
-        self.failUnless(g.is_bipartite() == True)
-        self.failUnless(g.is_bipartite(True) == (True, [False] + [True]*9))
-        g = Graph.Tree(100, 3)
-        self.failUnless(g.is_bipartite() == True)
-        g = Graph.Ring(9)
-        self.failUnless(g.is_bipartite() == False)
-        self.failUnless(g.is_bipartite(True) == (False, None))
-        g = Graph.Ring(10)
-        self.failUnless(g.is_bipartite() == True)
-        g += (2, 0)
-        self.failUnless(g.is_bipartite(True) == (False, None))
-        
-def suite():
-    bipartite_suite = unittest.makeSuite(BipartiteTests)
-    return unittest.TestSuite([bipartite_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/cliques.py igraph-0.6.5/interfaces/python/igraph/test/cliques.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/cliques.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/cliques.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,201 +0,0 @@
-import unittest
-from igraph import *
-
-class CliqueTests(unittest.TestCase):
-    def setUp(self):
-        self.g=Graph.Full(6)
-        self.g.delete_edges([(0, 1), (0, 2), (3, 5)])
-
-    def testCliques(self):
-        tests = {(4, -1): [[1, 2, 3, 4], [1, 2, 4, 5]],
-                 (2, 2): [[0, 3], [0, 4], [0, 5],
-                          [1, 2], [1, 3], [1, 4], [1, 5],
-                          [2, 3], [2, 4], [2, 5], [3, 4], [4, 5]],
-                 (-1, -1): [[0], [1], [2], [3], [4], [5],
-                            [0, 3], [0, 4], [0, 5],
-                            [1, 2], [1, 3], [1, 4], [1, 5],
-                            [2, 3], [2, 4], [2, 5], [3, 4], [4, 5],
-                            [0, 3, 4], [0, 4, 5],
-                            [1, 2, 3], [1, 2, 4], [1, 2, 5],
-                            [1, 3, 4], [1, 4, 5], [2, 3, 4], [2, 4, 5],
-                            [1, 2, 3, 4], [1, 2, 4, 5]]}
-        for (lo, hi), exp in tests.iteritems():
-            self.assertEqual(sorted(exp), sorted(map(sorted, self.g.cliques(lo, hi))))
-
-    def testLargestCliques(self):
-        self.assertEqual(sorted(map(sorted, self.g.largest_cliques())),
-                         [[1, 2, 3, 4], [1, 2, 4, 5]])
-
-    def testMaximalCliques(self):
-        self.assertEqual(sorted(map(sorted, self.g.maximal_cliques())),
-                         [[0, 3, 4], [0, 4, 5],
-                          [1, 2, 3, 4], [1, 2, 4, 5]])
-        self.assertEqual(sorted(map(sorted, self.g.maximal_cliques(min=4))),
-                         [[1, 2, 3, 4], [1, 2, 4, 5]])
-        self.assertEqual(sorted(map(sorted, self.g.maximal_cliques(max=3))),
-                         [[0, 3, 4], [0, 4, 5]])
-
-    def testCliqueNumber(self):
-        self.assertEqual(self.g.clique_number(), 4)
-        self.assertEqual(self.g.omega(), 4)
-
-class IndependentVertexSetTests(unittest.TestCase):
-    def setUp(self):
-        self.g1=Graph.Tree(5, 2, TREE_UNDIRECTED)
-        self.g2=Graph.Tree(10, 2, TREE_UNDIRECTED)
-
-    def testIndependentVertexSets(self):
-        tests = {(4, -1): [],
-                 (2, 2): [(0, 3), (0, 4), (1, 2), (2, 3), (2, 4), (3, 4)],
-                 (-1, -1): [(0,), (1,), (2,), (3,), (4,),
-                            (0, 3), (0, 4), (1, 2), (2, 3), (2, 4),
-                            (3, 4), (0, 3, 4), (2, 3, 4)]}
-        for (lo, hi), exp in tests.iteritems():
-            self.assertEqual(exp, self.g1.independent_vertex_sets(lo, hi))
-
-    def testLargestIndependentVertexSets(self):
-        self.assertEqual(self.g1.largest_independent_vertex_sets(),
-                         [(0, 3, 4), (2, 3, 4)])
-
-    def testMaximalIndependentVertexSets(self):
-        self.assertEqual(self.g2.maximal_independent_vertex_sets(),
-                         [(0, 3, 4, 5, 6), (0, 3, 5, 6, 9),
-                          (0, 4, 5, 6, 7, 8), (0, 5, 6, 7, 8, 9),
-                          (1, 2, 7, 8, 9), (1, 5, 6, 7, 8, 9),
-                          (2, 3, 4), (2, 3, 9), (2, 4, 7, 8)])
-
-    def testIndependenceNumber(self):
-        self.assertEqual(self.g2.independence_number(), 6)
-        self.assertEqual(self.g2.alpha(), 6)
-
-
-class MotifTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph.Erdos_Renyi(100, 0.2, directed=True)
-
-    def testDyads(self):
-        """
-        @note: this test is not exhaustive, it only checks whether the
-          L{DyadCensus} objects "understand" attribute and item accessors
-        """
-        dc = self.g.dyad_census()
-        accessors = ["mut", "mutual", "asym", "asymm", "asymmetric", "null"]
-        for a in accessors:
-            self.failUnless(isinstance(getattr(dc, a), int))
-            self.failUnless(isinstance(dc[a], int))
-        self.failUnless(isinstance(list(dc), list))
-        self.failUnless(isinstance(tuple(dc), tuple))
-        self.failUnless(len(list(dc)) == 3)
-        self.failUnless(len(tuple(dc)) == 3)
-
-    def testTriads(self):
-        """
-        @note: this test is not exhaustive, it only checks whether the
-          L{TriadCensus} objects "understand" attribute and item accessors
-        """
-        tc = self.g.triad_census()
-        accessors = ["003", "012", "021d", "030C"]
-        for a in accessors:
-            self.failUnless(isinstance(getattr(tc, "t"+a), int))
-            self.failUnless(isinstance(tc[a], int))
-        self.failUnless(isinstance(list(tc), list))
-        self.failUnless(isinstance(tuple(tc), tuple))
-        self.failUnless(len(list(tc)) == 16)
-        self.failUnless(len(tuple(tc)) == 16)
-
-class CliqueBenchmark(object):
-    """This is a benchmark, not a real test case. You can run it
-    using:
-
-    >>> from igraph.test.clique import CliqueBenchmark
-    >>> CliqueBenchmark().run()
-    """
-
-    def __init__(self):
-        from time import time
-        import gc
-        self.time = time
-        self.gc_collect = gc.collect
-
-    def run(self):
-        self.printIntro()
-        self.testRandom()
-        self.testMoonMoser()
-        self.testGRG()
-
-    def printIntro(self):
-        print "n = number of vertices"
-        print "#cliques = number of maximal cliques found"
-        print "t1 = time required to determine the clique number"
-        print "t2 = time required to determine and save all maximal cliques"
-        print
-
-    def timeit(self, g):
-        start = self.time()
-        omega = g.clique_number()
-        mid = self.time()
-        cl = g.maximal_cliques()
-        end = self.time()
-        self.gc_collect()
-        return len(cl), mid-start, end-mid
-
-    def testRandom(self):
-        np = {100: [0.6, 0.7],
-              300: [0.1, 0.2, 0.3, 0.4],
-              500: [0.1, 0.2, 0.3],
-              700: [0.1, 0.2],
-              1000:[0.1, 0.2],
-              10000: [0.001, 0.003, 0.005, 0.01, 0.02]}
-
-        print
-        print "Erdos-Renyi random graphs"
-        print "       n        p #cliques        t1        t2"
-        for n in sorted(np.keys()):
-            for p in np[n]:
-                g = Graph.Erdos_Renyi(n, p)
-                result = self.timeit(g)
-                print "%8d %8.3f %8d %8.4fs %8.4fs" % \
-                    tuple([n, p] + list(result))
-
-    def testMoonMoser(self):
-        ns = [15, 27, 33]
-
-        print
-        print "Moon-Moser graphs"
-        print "       n exp_clqs #cliques        t1        t2"
-        for n in ns:
-            n3 = n/3
-            types = range(n3) * 3
-            el = [(i, j) for i in range(n) for j in range(i+1,n) if types[i] != types[j]]
-            g = Graph(n, el)
-            result = self.timeit(g)
-            print "%8d %8d %8d %8.4fs %8.4fs" % \
-                tuple([n, (3**(n/3))] + list(result))
-
-    def testGRG(self):
-        ns = [100, 1000, 5000, 10000, 25000, 50000]
-
-        print
-        print "Geometric random graphs"
-        print "       n        d #cliques        t1        t2"
-        for n in ns:
-            d = 2. / (n ** 0.5)
-            g = Graph.GRG(n, d)
-            result = self.timeit(g)
-            print "%8d %8.3f %8d %8.4fs %8.4fs" % \
-                tuple([n, d] + list(result))
-
-
-def suite():
-    clique_suite = unittest.makeSuite(CliqueTests)
-    indvset_suite = unittest.makeSuite(IndependentVertexSetTests)
-    motif_suite = unittest.makeSuite(MotifTests)
-    return unittest.TestSuite([clique_suite, indvset_suite, motif_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/colortests.py igraph-0.6.5/interfaces/python/igraph/test/colortests.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/colortests.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/colortests.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,98 +0,0 @@
-import unittest
-
-from itertools import izip
-from igraph import *
-
-class ColorTests(unittest.TestCase):
-    def assertAlmostEqualsMany(self, items1, items2, eps):
-        for idx, (item1, item2) in enumerate(izip(items1, items2)):
-            self.assertAlmostEqual(item1, item2, places=eps,
-                    msg="mismatch at index %d, %r != %r with %d digits"
-                    % (idx, items1, items2, eps))
-
-    def setUp(self):
-        columns = ["r", "g", "b", "h", "v", "l", "s_hsv", "s_hsl", "alpha"]
-        # Examples taken from http://en.wikipedia.org/wiki/HSL_and_HSV
-        values = [
-                (1, 1, 1, 0, 1, 1, 0, 0, 1),
-                (0.5, 0.5, 0.5, 0, 0.5, 0.5, 0, 0, 0.5),
-                (0, 0, 0, 0, 0, 0, 0, 0, 1),
-                (1, 0, 0, 0, 1, 0.5, 1, 1, 0.5),
-                (0.75, 0.75, 0, 60, 0.75, 0.375, 1, 1, 0.25),
-                (0, 0.5, 0, 120, 0.5, 0.25, 1, 1, 0.75),
-                (0.5, 1, 1, 180, 1, 0.75, 0.5, 1, 1),
-                (0.5, 0.5, 1, 240, 1, 0.75, 0.5, 1, 1),
-                (0.75, 0.25, 0.75, 300, 0.75, 0.5, 0.666666667, 0.5, 0.25),
-                (0.211, 0.149, 0.597, 248.3, 0.597, 0.373, 0.750, 0.601, 1),
-                (0.495, 0.493, 0.721, 240.5, 0.721, 0.607, 0.316, 0.290, 0.75),
-        ]
-        self.data = [dict(zip(columns, value)) for value in values]
-        for row in self.data:
-            row["h"] /= 360.
-
-    def _testGeneric(self, method, args1, args2=("r", "g", "b")):
-        if len(args1) == len(args2)+1:
-            args2 += ("alpha", )
-        for data in self.data:
-            vals1 = [data.get(arg, 0.0) for arg in args1]
-            vals2 = [data.get(arg, 0.0) for arg in args2]
-            self.assertAlmostEqualsMany(method(*vals1), vals2, 2)
-
-    def testHSVtoRGB(self):
-        self._testGeneric(hsv_to_rgb, "h s_hsv v".split())
-
-    def testHSVAtoRGBA(self):
-        self._testGeneric(hsva_to_rgba, "h s_hsv v alpha".split())
-
-    def testHSLtoRGB(self):
-        self._testGeneric(hsl_to_rgb, "h s_hsl l".split())
-
-    def testHSLAtoRGBA(self):
-        self._testGeneric(hsla_to_rgba, "h s_hsl l alpha".split())
-
-    def testRGBtoHSL(self):
-        self._testGeneric(rgb_to_hsl, "r g b".split(), "h s_hsl l".split())
-
-    def testRGBAtoHSLA(self):
-        self._testGeneric(rgba_to_hsla, "r g b alpha".split(), "h s_hsl l alpha".split())
-
-    def testRGBtoHSV(self):
-        self._testGeneric(rgb_to_hsv, "r g b".split(), "h s_hsv v".split())
-
-    def testRGBAtoHSVA(self):
-        self._testGeneric(rgba_to_hsva, "r g b alpha".split(), "h s_hsv v alpha".split())
-
-
-class PaletteTests(unittest.TestCase):
-    def testGradientPalette(self):
-        gp = GradientPalette("red", "blue", 3)
-        self.failUnless(gp.get(0) == (1., 0., 0., 1.))
-        self.failUnless(gp.get(1) == (0.5, 0., 0.5, 1.))
-        self.failUnless(gp.get(2) == (0., 0., 1., 1.))
-
-    def testAdvancedGradientPalette(self):
-        agp = AdvancedGradientPalette(["red", "black", "blue"], n=9)
-        self.failUnless(agp.get(0) == (1., 0., 0., 1.))
-        self.failUnless(agp.get(2) == (0.5, 0., 0., 1.))
-        self.failUnless(agp.get(4) == (0., 0., 0., 1.))
-        self.failUnless(agp.get(5) == (0., 0., 0.25, 1.))
-        self.failUnless(agp.get(8) == (0., 0., 1., 1.))
-
-        agp = AdvancedGradientPalette(["red", "black", "blue"], [0, 8, 2], 9)
-        self.failUnless(agp.get(0) == (1., 0., 0., 1.))
-        self.failUnless(agp.get(1) == (0.5, 0., 0.5, 1.))
-        self.failUnless(agp.get(5) == (0., 0., 0.5, 1.))
-
-
-def suite():
-    color_suite = unittest.makeSuite(ColorTests)
-    palette_suite = unittest.makeSuite(PaletteTests)
-    return unittest.TestSuite([color_suite, palette_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/conversion.py igraph-0.6.5/interfaces/python/igraph/test/conversion.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/conversion.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/conversion.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,102 +0,0 @@
-import unittest
-from igraph import *
-
-class DirectedUndirectedTests(unittest.TestCase):
-    def testToUndirected(self):
-        graph = Graph([(0,1), (0,2), (1,0)], directed=True)
-
-        graph2 = graph.copy()
-        graph2.to_undirected(mode=False)
-        self.failUnless(graph2.vcount() == graph.vcount())
-        self.failUnless(graph2.is_directed() == False)
-        self.failUnless(sorted(graph2.get_edgelist()) == [(0,1), (0,1), (0,2)])
-
-        graph2 = graph.copy()
-        graph2.to_undirected()
-        self.failUnless(graph2.vcount() == graph.vcount())
-        self.failUnless(graph2.is_directed() == False)
-        self.failUnless(sorted(graph2.get_edgelist()) == [(0,1), (0,2)])
-
-        graph2 = graph.copy()
-        graph2.es["weight"] = [1,2,3]
-        graph2.to_undirected(mode="collapse", combine_edges="sum")
-        self.failUnless(graph2.vcount() == graph.vcount())
-        self.failUnless(graph2.is_directed() == False)
-        self.failUnless(sorted(graph2.get_edgelist()) == [(0,1), (0,2)])
-        self.failUnless(graph2.es["weight"] == [4,2])
-
-        graph = Graph([(0,1),(1,0),(0,1),(1,0),(2,1),(1,2)], directed=True)
-        graph2 = graph.copy()
-        graph2.es["weight"] = [1,2,3,4,5,6]
-        graph2.to_undirected(mode="mutual", combine_edges="sum")
-        self.failUnless(graph2.vcount() == graph.vcount())
-        self.failUnless(graph2.is_directed() == False)
-        self.failUnless(sorted(graph2.get_edgelist()) == [(0,1), (0,1), (1,2)])
-        self.failUnless(graph2.es["weight"] == [7,3,11] or graph2.es["weight"] == [3,7,11])
-
-    def testToDirected(self):
-        graph = Graph([(0,1), (0,2), (2,3), (2,4)], directed=False)
-        graph.to_directed()
-        self.failUnless(graph.is_directed())
-        self.failUnless(graph.vcount() == 5)
-        self.failUnless(sorted(graph.get_edgelist()) == \
-                [(0,1), (0,2), (1,0), (2,0), (2,3), (2,4), (3,2), (4,2)]
-        )
-
-
-class GraphRepresentationTests(unittest.TestCase):
-    def testGetAdjacency(self):
-        # Undirected case
-        g = Graph.Tree(6, 3)
-        g.es["weight"] = range(5)
-        self.failUnless(g.get_adjacency() == Matrix([
-            [0, 1, 1, 1, 0, 0],
-            [1, 0, 0, 0, 1, 1],
-            [1, 0, 0, 0, 0, 0],
-            [1, 0, 0, 0, 0, 0],
-            [0, 1, 0, 0, 0, 0],
-            [0, 1, 0, 0, 0, 0]
-        ]))
-        self.failUnless(g.get_adjacency(attribute="weight") == Matrix([
-            [0, 0, 1, 2, 0, 0],
-            [0, 0, 0, 0, 3, 4],
-            [1, 0, 0, 0, 0, 0],
-            [2, 0, 0, 0, 0, 0],
-            [0, 3, 0, 0, 0, 0],
-            [0, 4, 0, 0, 0, 0]
-        ]))
-        self.failUnless(g.get_adjacency(eids=True) == Matrix([
-            [0, 1, 2, 3, 0, 0],
-            [1, 0, 0, 0, 4, 5],
-            [2, 0, 0, 0, 0, 0],
-            [3, 0, 0, 0, 0, 0],
-            [0, 4, 0, 0, 0, 0],
-            [0, 5, 0, 0, 0, 0]
-        ])-1)
-
-        # Directed case
-        g = Graph.Tree(6, 3, "tree_out")
-        g.add_edges([(0,1), (1,0)])
-        self.failUnless(g.get_adjacency() == Matrix([
-            [0, 2, 1, 1, 0, 0],
-            [1, 0, 0, 0, 1, 1],
-            [0, 0, 0, 0, 0, 0],
-            [0, 0, 0, 0, 0, 0],
-            [0, 0, 0, 0, 0, 0],
-            [0, 0, 0, 0, 0, 0]
-        ]))
-
-
-def suite():
-    direction_suite = unittest.makeSuite(DirectedUndirectedTests)
-    representation_suite = unittest.makeSuite(GraphRepresentationTests)
-    return unittest.TestSuite([direction_suite,
-        representation_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/decomposition.py igraph-0.6.5/interfaces/python/igraph/test/decomposition.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/decomposition.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/decomposition.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,404 +0,0 @@
-import random
-import unittest
-import math
-
-from igraph import *
-try:
-    set, frozenset
-except NameError:
-    import sets
-    set, frozenset = sets.Set, sets.ImmutableSet
-
-
-class SubgraphTests(unittest.TestCase):
-    def testSubgraph(self):
-        g = Graph.Lattice([10, 10], circular=False, mutual=False)
-        g.vs["id"] = range(g.vcount())
-
-        vs = [0, 1, 2, 10, 11, 12, 20, 21, 22]
-        sg = g.subgraph(vs)
-
-        self.failUnless(sg.isomorphic(Graph.Lattice([3, 3], circular=False, mutual=False)))
-        self.failUnless(sg.vs["id"] == vs)
-
-    def testSubgraphEdges(self):
-        g = Graph.Lattice([10, 10], circular=False, mutual=False)
-        g.es["id"] = range(g.ecount())
-
-        es = [0, 1, 2, 5, 20, 21, 22, 24, 38, 40]
-        sg = g.subgraph_edges(es)
-        exp = Graph.Lattice([3, 3], circular=False, mutual=False)
-        exp.delete_edges([7, 8])
-
-        self.failUnless(sg.isomorphic(exp))
-        self.failUnless(sg.es["id"] == es)
-
-
-class DecompositionTests(unittest.TestCase):
-    def testKCores(self):
-        g = Graph(11, [(0,1), (0,2), (0,3), (1,2), (1,3), (2,3),
-                       (2,4), (2,5), (3,6), (3,7), (1,7), (7,8),
-                       (1,9), (1,10), (9,10)])
-        self.failUnless(g.coreness() == [3,3,3,3,1,1,1,2,1,2,2])
-        self.failUnless(g.shell_index() == g.coreness())
-
-        l=g.k_core(3).get_edgelist()
-        l.sort()
-        self.failUnless(l == [(0,1), (0,2), (0,3), (1,2), (1,3), (2,3)])
-
-
-class ClusteringTests(unittest.TestCase):
-    def setUp(self):
-        self.cl = Clustering([0,0,0,1,1,2,1,1,4,4])
-
-    def testClusteringIndex(self):
-        self.failUnless(self.cl[0] == [0, 1, 2])
-        self.failUnless(self.cl[1] == [3, 4, 6, 7])
-        self.failUnless(self.cl[2] == [5])
-        self.failUnless(self.cl[3] == [])
-        self.failUnless(self.cl[4] == [8, 9])
-
-    def testClusteringLength(self):
-        self.failUnless(len(self.cl) == 5)
-
-    def testClusteringMembership(self):
-        self.failUnless(self.cl.membership == [0,0,0,1,1,2,1,1,4,4])
-
-    def testClusteringSizes(self):
-        self.failUnless(self.cl.sizes() == [3, 4, 1, 0, 2])
-        self.failUnless(self.cl.sizes(2, 4, 1) == [1, 2, 4])
-        self.failUnless(self.cl.size(2) == 1)
-
-    def testClusteringHistogram(self):
-        self.failUnless(isinstance(self.cl.size_histogram(), Histogram))
-
-
-class VertexClusteringTests(unittest.TestCase):
-    def setUp(self):
-        self.graph = Graph.Full(10)
-        self.graph.vs["string"] = list("aaabbcccab")
-        self.graph.vs["int"] = [17, 41, 23, 25, 64, 33, 3, 24, 47, 15]
-
-    def testFromStringAttribute(self):
-        cl = VertexClustering.FromAttribute(self.graph, "string")
-        self.failUnless(cl.membership == [0,0,0,1,1,2,2,2,0,1])
-
-    def testFromIntAttribute(self):
-        cl = VertexClustering.FromAttribute(self.graph, "int")
-        self.failUnless(cl.membership == list(range(10)))
-        cl = VertexClustering.FromAttribute(self.graph, "int", 15)
-        self.failUnless(cl.membership == [0, 1, 0, 0, 2, 1, 3, 0, 4, 0])
-        cl = VertexClustering.FromAttribute(self.graph, "int", [10, 20, 30])
-        self.failUnless(cl.membership == [0, 1, 2, 2, 1, 1, 3, 2, 1, 0])
-
-    def testClusterGraph(self):
-        cl = VertexClustering(self.graph, [0, 0, 0, 1, 1, 1, 2, 2, 2, 2])
-        self.graph.delete_edges(self.graph.es.select(_between=([0,1,2], [3,4,5])))
-        clg = cl.cluster_graph(dict(string="concat", int=max))
-
-        self.failUnless(sorted(clg.get_edgelist()) == [(0, 2), (1, 2)])
-        self.failUnless(not clg.is_directed())
-        self.failUnless(clg.vs["string"] == ["aaa", "bbc", "ccab"])
-        self.failUnless(clg.vs["int"] == [41, 64, 47])
-
-        clg = cl.cluster_graph(dict(string="concat", int=max), False)
-        self.failUnless(sorted(clg.get_edgelist()) == \
-            [(0, 0)]*3 + [(0, 2)]*12 + [(1, 1)]*3 + [(1, 2)]*12 + [(2, 2)]*6)
-        self.failUnless(not clg.is_directed())
-        self.failUnless(clg.vs["string"] == ["aaa", "bbc", "ccab"])
-        self.failUnless(clg.vs["int"] == [41, 64, 47])
-
-
-class CoverTests(unittest.TestCase):
-    def setUp(self):
-        self.cl = Cover([(0,1,2,3), (3,4,5,6,9), (), (8,9)])
-
-    def testCoverIndex(self):
-        self.failUnless(self.cl[0] == [0, 1, 2, 3])
-        self.failUnless(self.cl[1] == [3, 4, 5, 6, 9])
-        self.failUnless(self.cl[2] == [])
-        self.failUnless(self.cl[3] == [8, 9])
-
-    def testCoverLength(self):
-        self.failUnless(len(self.cl) == 4)
-
-    def testCoverSizes(self):
-        self.failUnless(self.cl.sizes() == [4, 5, 0, 2])
-        self.failUnless(self.cl.sizes(1, 3, 0) == [5, 2, 4])
-        self.failUnless(self.cl.size(1) == 5)
-        self.failUnless(self.cl.size(2) == 0)
-
-    def testCoverHistogram(self):
-        self.failUnless(isinstance(self.cl.size_histogram(), Histogram))
-
-    def testCoverConstructorWithN(self):
-        self.failUnless(self.cl.n == 10)
-        cl = Cover(self.cl, n = 15)
-        self.failUnless(cl.n == 15)
-        cl = Cover(self.cl, n = 1)
-        self.failUnless(cl.n == 10)
-
-
-class CommunityTests(unittest.TestCase):
-    def reindexMembership(self, cl):
-        idgen = UniqueIdGenerator()
-        return [idgen[i] for i in cl.membership]
-
-    def testClauset(self):
-        # Two cliques of size 5 with one connecting edge
-        g = Graph.Full(5) + Graph.Full(5)
-        g.add_edges([(0, 5)])
-        cl = g.community_fastgreedy().as_clustering()
-        self.assertEquals(cl.membership, [0,0,0,0,0,1,1,1,1,1])
-        self.assertAlmostEqual(cl.q, 0.4523, places=3)
-
-        # Lollipop, weighted
-        g = Graph.Full(4) + Graph.Full(2)
-        g.add_edges([(3,4)])
-        weights = [1, 1, 1, 1, 1, 1, 10, 10]
-        cl = g.community_fastgreedy(weights).as_clustering()
-        self.assertEquals(cl.membership, [0, 0, 0, 1, 1, 1])
-        self.assertAlmostEqual(cl.q, 0.1708, places=3)
-
-        # Same graph, different weights
-        g.es["weight"] = [3] * g.ecount()
-        cl = g.community_fastgreedy("weight").as_clustering()
-        self.assertEquals(cl.membership, [0, 0, 0, 0, 1, 1])
-        self.assertAlmostEqual(cl.q, 0.1796, places=3)
-
-        # Disconnected graph
-        g = Graph.Full(4) + Graph.Full(4) + Graph.Full(3) + Graph.Full(2)
-        cl = g.community_fastgreedy().as_clustering()
-        self.assertEquals(cl.membership, [0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3])
-
-        # Empty graph
-        g = Graph(20)
-        cl = g.community_fastgreedy().as_clustering()
-        self.assertEquals(cl.membership, range(g.vcount()))
-
-    def testEdgeBetweenness(self):
-        # Full graph, no weights
-        g = Graph.Full(5)
-        cl = g.community_edge_betweenness().as_clustering()
-        self.assertEquals(cl.membership, [0]*5)
-
-        # Full graph with weights
-        g.es["weight"] = 1
-        g[0,1] = g[1,2] = g[2,0] = g[3,4] = 10
-        cl = g.community_edge_betweenness(weights="weight").as_clustering()
-        self.assertEquals(cl.membership, [0,0,0,1,1])
-        self.assertAlmostEqual(cl.q, 0.2750, places=3)
-
-    def testEigenvector(self):
-        g = Graph.Full(5) + Graph.Full(5)
-        g.add_edges([(0, 5)])
-        cl = g.community_leading_eigenvector()
-        self.failUnless(cl.membership == [0,0,0,0,0,1,1,1,1,1])
-        self.assertAlmostEqual(cl.q, 0.4523, places=3)
-        cl = g.community_leading_eigenvector(2)
-        self.failUnless(cl.membership == [0,0,0,0,0,1,1,1,1,1])
-        self.assertAlmostEqual(cl.q, 0.4523, places=3)
-
-    def testInfomap(self):
-        g = Graph.Famous("zachary")
-        cl = g.community_infomap()
-        self.assertAlmostEqual(cl.codelength, 4.60605, places=3)
-        self.assertAlmostEqual(cl.q, 0.40203, places=3)
-        self.failUnless(cl.membership == [1,1,1,1,2,2,2,1,0,1,2,1,1,1,0,0,2,1,0,1,0,1] + [0]*12)
-
-        # Smoke testing with vertex and edge weights
-        v_weights = [random.randint(1, 5) for _ in xrange(g.vcount())]
-        e_weights = [random.randint(1, 5) for _ in xrange(g.ecount())]
-        cl = g.community_infomap(edge_weights=e_weights)
-        cl = g.community_infomap(vertex_weights=v_weights)
-        cl = g.community_infomap(edge_weights=e_weights, vertex_weights=v_weights)
-
-    def testLabelPropagation(self):
-        # Nothing to test there really, since the algorithm
-        # is pretty nondeterministic. We just do a quick smoke
-        # test.
-        g = Graph.GRG(100, 0.2)
-        cl = g.community_label_propagation()
-        g = Graph([(0,1),(1,2),(2,3)])
-        g.es["weight"] = [2, 1, 2]
-        g.vs["initial"] = [0, -1, -1, 1]
-        cl = g.community_label_propagation("weight", "initial", [1,0,0,1])
-        self.failUnless(cl.membership == [0, 0, 1, 1])
-        cl = g.community_label_propagation(initial="initial", fixed=[1,0,0,1])
-        self.failUnless(cl.membership == [0, 0, 1, 1] or \
-                        cl.membership == [0, 1, 1, 1] or \
-                        cl.membership == [0, 0, 0, 1])
-
-    def testMultilevel(self):
-        # Example graph from the paper
-        g = Graph(16)
-        g += [(0,2), (0,3), (0,4), (0,5),
-              (1,2), (1,4), (1,7), (2,4), (2,5), (2,6),
-              (3,7), (4,10), (5,7), (5,11), (6,7), (6,11),
-              (8,9), (8,10), (8,11), (8,14), (8,15),
-              (9,12), (9,14), (10,11), (10,12), (10,13),
-              (10,14), (11,13)]
-        cls = g.community_multilevel(return_levels=True)
-        self.failUnless(len(cls) == 2)
-        self.failUnless(cls[0].membership == [0,0,0,1,0,0,1,1,2,2,2,3,2,3,2,2])
-        self.failUnless(cls[1].membership == [0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1])
-        self.assertAlmostEqual(cls[0].q, 0.346301, places=5)
-        self.assertAlmostEqual(cls[1].q, 0.392219, places=5)
-
-    def testOptimalModularity(self):
-        try:
-            g = Graph.Famous("bull")
-            cl = g.community_optimal_modularity()
-            self.failUnless(len(cl) == 2)
-            self.failUnless(cl.membership == [0, 0, 1, 0, 1])
-            self.assertAlmostEqual(cl.q, 0.08, places=7)
-
-            g = Graph.Famous("zachary")
-            cl = g.community_optimal_modularity()
-            self.failUnless(len(cl) == 4)
-            self.failUnless(cl.membership == [0, 0, 0, 0, 1, 1, 1, 0, 2, 2, 1, \
-                    0, 0, 0, 2, 2, 1, 0, 2, 0, 2, 0, 2, 3, 3, 3, 2, 3, 3, \
-                    2, 2, 3, 2, 2])
-            self.assertAlmostEqual(cl.q, 0.4197896, places=7)
-        except NotImplementedError:
-            # Well, meh
-            pass
-
-    def testSpinglass(self):
-        g = Graph.Full(5) + Graph.Full(5) + Graph.Full(5)
-        g += [(0,5), (5,10), (10, 0)]
-
-        # Spinglass community detection is a bit unstable, so run it three times
-        ok = False
-        for i in xrange(3):
-            cl = g.community_spinglass()
-            if self.reindexMembership(cl) == [0,0,0,0,0,1,1,1,1,1,2,2,2,2,2]:
-                ok = True
-                break
-        self.failUnless(ok)
-        
-    def testWalktrap(self):
-        g = Graph.Full(5) + Graph.Full(5) + Graph.Full(5)
-        g += [(0,5), (5,10), (10, 0)]
-        cl = g.community_walktrap().as_clustering()
-        self.failUnless(cl.membership == [0,0,0,0,0,1,1,1,1,1,2,2,2,2,2])
-        cl = g.community_walktrap(steps=3).as_clustering()
-        self.failUnless(cl.membership == [0,0,0,0,0,1,1,1,1,1,2,2,2,2,2])
-       
-
-class CohesiveBlocksTests(unittest.TestCase):
-    def genericTests(self, cbs):
-        self.failUnless(isinstance(cbs, CohesiveBlocks))
-        self.failUnless(all(cbs.cohesion(i) == c
-                            for i, c in enumerate(cbs.cohesions())))
-        self.failUnless(all(cbs.parent(i) == c
-                            for i, c in enumerate(cbs.parents())))
-        self.failUnless(all(cbs.max_cohesion(i) == c
-                            for i, c in enumerate(cbs.max_cohesions())))
-
-    def testCohesiveBlocks1(self):
-        # Taken from the igraph R manual
-        g = Graph.Full(4) + Graph(2) + [(3, 4), (4, 5), (4, 2)]
-        g *= 3
-        g += [(0, 6), (1, 7), (0, 12), (4, 0), (4, 1)]
-
-        cbs = g.cohesive_blocks()
-        self.genericTests(cbs)
-        self.assertEquals(sorted(list(cbs)),
-                [range(0, 5), range(18), [0, 1, 2, 3, 4, 6, 7, 8, 9, 10],
-                 range(6, 10), range(12, 16), range(12, 17)])
-        self.assertEquals(cbs.cohesions(), [1, 2, 2, 4, 3, 3])
-        self.assertEquals(cbs.max_cohesions(), [4, 4, 4, 4, 4,
-            1, 3, 3, 3, 3, 2, 1, 3, 3, 3, 3, 2, 1])
-        self.assertEquals(cbs.parents(), [None, 0, 0, 1, 2, 1])
-
-    def testCohesiveBlocks2(self):
-        # Taken from the Moody-White paper
-        g = Graph.Formula("1-2:3:4:5:6, 2-3:4:5:7, 3-4:6:7, 4-5:6:7, "
-                          "5-6:7:21, 6-7, 7-8:11:14:19, 8-9:11:14, 9-10, "
-                          "10-12:13, 11-12:14, 12-16, 13-16, 14-15, 15-16, "
-                          "17-18:19:20, 18-20:21, 19-20:22:23, 20-21, "
-                          "21-22:23, 22-23")
-
-        cbs = g.cohesive_blocks()
-        self.genericTests(cbs)
-
-        expected_blocks = [range(7), range(23), range(7)+range(16, 23),
-                range(6, 16), [6, 7, 10, 13]]
-        observed_blocks = sorted(sorted(int(x)-1 for x in g.vs[bl]["name"]) for bl in cbs)
-        self.assertEquals(expected_blocks, observed_blocks)
-        self.failUnless(cbs.cohesions() == [1, 2, 2, 5, 3])
-        self.failUnless(cbs.parents() == [None, 0, 0, 1, 2])
-        self.failUnless(sorted(cbs.hierarchy().get_edgelist()) ==
-                [(0, 1), (0, 2), (1, 3), (2, 4)])
-
-    def testCohesiveBlockingErrors(self):
-        g = Graph.GRG(100, 0.2)
-        g.to_directed()
-        self.assertRaises(InternalError, g.cohesive_blocks)
-
-
-class ComparisonTests(unittest.TestCase):
-    def setUp(self):
-        self.clusterings = [
-            ([1, 1, 1, 2, 2, 2], [2, 2, 2, 1, 1, 1]),
-            ([1, 1, 1, 2, 2, 2], [1, 1, 2, 2, 3, 3]),
-            ([1, 1, 1, 1, 1, 1], [1, 2, 3, 5, 6, 7]),
-            ([1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3],
-             [3, 1, 2, 1, 3, 1, 3, 1, 2, 1, 4, 2])
-        ]
-
-    def _testMethod(self, method, expected): 
-        for clusters, result in zip(self.clusterings, expected):
-            self.assertAlmostEqual(compare_communities(method=method, *clusters),
-                    result, places=3)
-
-    def testCompareVI(self):
-        expected = [0, 0.8675, math.log(6)]
-        self._testMethod(None, expected)
-        self._testMethod("vi", expected)
-
-    def testCompareNMI(self):
-        expected = [1, 0.5158, 0]
-        self._testMethod("nmi", expected)
-
-    def testCompareSplitJoin(self):
-        expected = [0, 3, 5, 11]
-        self._testMethod("split", expected)
-        l1 = [1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3]
-        l2 = [3, 1, 2, 1, 3, 1, 3, 1, 2, 1, 4, 2]
-        self.assertEqual(split_join_distance(l1, l2), (6, 5))
-
-    def testCompareRand(self):
-        expected = [1, 2/3., 0, 0.590909]
-        self._testMethod("rand", expected)
-
-    def testCompareAdjustedRand(self):
-        expected = [1, 0.242424, 0, -0.04700353]
-        self._testMethod("adjusted_rand", expected)
-
-    def testRemoveNone(self):
-        l1 = Clustering([1, 1, 1, None, None, 2, 2, 2, 2])
-        l2 = Clustering([1, 1, 2,    2, None, 2, 3, 3, None])
-        self.assertAlmostEqual(compare_communities(l1, l2, "nmi", remove_none=True), \
-                0.5158, places=3)
-
-def suite():
-    decomposition_suite = unittest.makeSuite(DecompositionTests)
-    clustering_suite = unittest.makeSuite(ClusteringTests)
-    vertex_clustering_suite = unittest.makeSuite(VertexClusteringTests)
-    cover_suite = unittest.makeSuite(CoverTests)
-    community_suite = unittest.makeSuite(CommunityTests)
-    cohesive_blocks_suite = unittest.makeSuite(CohesiveBlocksTests)
-    comparison_suite = unittest.makeSuite(ComparisonTests)
-    return unittest.TestSuite([decomposition_suite, clustering_suite, \
-            vertex_clustering_suite, cover_suite, community_suite, \
-            cohesive_blocks_suite, comparison_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/edgeseq.py igraph-0.6.5/interfaces/python/igraph/test/edgeseq.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/edgeseq.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/edgeseq.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,222 +0,0 @@
-# vim:ts=4 sw=4 sts=4:
-import unittest
-from igraph import *
-
-class EdgeTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph.Full(10)
-
-    def testRepr(self):
-        output = repr(self.g.es[0])
-        self.assertEquals(output, "igraph.Edge(%r, 0, {})" % self.g)
-
-        self.g.es["weight"] = range(10, 0, -1)
-        output = repr(self.g.es[3])
-        self.assertEquals(output, "igraph.Edge(%r, 3, {'weight': 7})" % self.g)
-
-    def testUpdateAttributes(self):
-        e = self.g.es[0]
-
-        e.update_attributes(a=2)
-        self.assertEquals(e["a"], 2)
-
-        e.update_attributes([("a", 3), ("b", 4)], c=5, d=6)
-        self.assertEquals(e.attributes(), dict(a=3, b=4, c=5, d=6))
-
-        e.update_attributes(dict(b=44, c=55))
-        self.assertEquals(e.attributes(), dict(a=3, b=44, c=55, d=6))
-
-
-class EdgeSeqTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph.Full(10)
-        self.g.es["test"] = range(45)
-    
-    def testCreation(self):
-        self.failUnless(len(EdgeSeq(self.g)) == 45)
-        self.failUnless(len(EdgeSeq(self.g, 2)) == 1)
-        self.failUnless(len(EdgeSeq(self.g, [1,2,3])) == 3)
-        self.failUnless(EdgeSeq(self.g, [1,2,3]).indices == [1,2,3])
-        self.assertRaises(ValueError, EdgeSeq, self.g, 112)
-        self.assertRaises(ValueError, EdgeSeq, self.g, [112])
-        self.failUnless(self.g.es.graph == self.g)
-
-    def testPartialAttributeAssignment(self):
-        only_even = self.g.es.select(lambda e: (e.index % 2 == 0))
-        
-        only_even["test"] = [0]*len(only_even)
-        expected = [[0,i][i % 2] for i in xrange(self.g.ecount())]
-        self.failUnless(self.g.es["test"] == expected)
-        
-        only_even["test2"] = range(23)
-        expected = [[i//2, None][i % 2] for i in xrange(self.g.ecount())]
-        self.failUnless(self.g.es["test2"] == expected)
-
-    def testSequenceReusing(self):
-        if "test" in self.g.edge_attributes(): del self.g.es["test"]
-
-        self.g.es["test"] = ["A", "B", "C"]
-        self.failUnless(self.g.es["test"] == ["A", "B", "C"]*15)
-        self.g.es["test"] = "ABC"
-        self.failUnless(self.g.es["test"] == ["ABC"] * 45)
-
-        only_even = self.g.es.select(lambda e: (e.index % 2 == 0))
-        only_even["test"] = ["D", "E"]
-        expected = ["D", "ABC", "E", "ABC"] * 12
-        expected = expected[0:45]
-        self.failUnless(self.g.es["test"] == expected)
-        del self.g.es["test"]
-        only_even["test"] = ["D", "E"]
-        expected = ["D", None, "E", None] * 12
-        expected = expected[0:45]
-        self.failUnless(self.g.es["test"] == expected)
-
-    def testAllSequence(self):
-        self.failUnless(len(self.g.es) == 45)
-        self.failUnless(self.g.es["test"] == range(45))
-
-    def testEmptySequence(self):
-        empty_es = self.g.es.select(None)
-        self.failUnless(len(empty_es) == 0)
-        self.assertRaises(IndexError, empty_es.__getitem__, 0)
-        self.assertRaises(KeyError, empty_es.__getitem__, "nonexistent")
-        self.failUnless(empty_es["test"] == [])
-        empty_es = self.g.es[[]]
-        self.failUnless(len(empty_es) == 0)
-        empty_es = self.g.es[()]
-        self.failUnless(len(empty_es) == 0)
-
-    def testCallableFilteringFind(self):
-        edge = self.g.es.find(lambda e: (e.index % 2 == 1))
-        self.failUnless(edge.index == 1)
-        self.assertRaises(IndexError, self.g.es.find, lambda e: (e.index % 2 == 3))
-
-    def testCallableFilteringSelect(self):
-        only_even = self.g.es.select(lambda e: (e.index % 2 == 0))
-        self.failUnless(len(only_even) == 23)
-        self.assertRaises(KeyError, only_even.__getitem__, "nonexistent")
-        self.failUnless(only_even["test"] == [i*2 for i in xrange(23)])
-
-    def testChainedCallableFilteringSelect(self):
-        only_div_six = self.g.es.select(lambda e: (e.index % 2 == 0),
-          lambda e: (e.index % 3 == 0))
-        self.failUnless(len(only_div_six) == 8)
-        self.failUnless(only_div_six["test"] == [0, 6, 12, 18, 24, 30, 36, 42])
-
-        only_div_six = self.g.es.select(lambda e: (e.index % 2 == 0)).select(\
-          lambda e: (e.index % 3 == 0))
-        self.failUnless(len(only_div_six) == 8)
-        self.failUnless(only_div_six["test"] == [0, 6, 12, 18, 24, 30, 36, 42])
-
-    def testIntegerFilteringFind(self):
-        self.assertEquals(self.g.es.find(3).index, 3)
-        self.assertEquals(self.g.es.select(2,3,4,2).find(3).index, 2)
-        self.assertRaises(IndexError, self.g.es.find, 178)
-
-    def testIntegerFilteringSelect(self):
-        subset = self.g.es.select(2,3,4,2)
-        self.failUnless(len(subset) == 4)
-        self.failUnless(subset["test"] == [2,3,4,2])
-        self.assertRaises(TypeError, self.g.es.select, 2, 3, 4, 2, None)
-
-        subset = self.g.es[2,3,4,2]
-        self.failUnless(len(subset) == 4)
-        self.failUnless(subset["test"] == [2,3,4,2])
-
-    def testIterableFilteringSelect(self):
-        subset = self.g.es.select(xrange(5,8))
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [5,6,7])
-
-    def testSliceFilteringSelect(self):
-        subset = self.g.es.select(slice(5, 8))
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [5,6,7])
-        subset = self.g.es[40:56:2]
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [40,42,44])
-
-    def testKeywordFilteringSelect(self):
-        g = Graph.Barabasi(1000, 2)
-        g.es["betweenness"] = g.edge_betweenness()
-        g.es["parity"] = [i % 2 for i in xrange(g.ecount())]
-        self.failUnless(len(g.es(betweenness_gt=10)) < 2000)
-        self.failUnless(len(g.es(betweenness_gt=10, parity=0)) < 2000)
-
-    def testSourceTargetFiltering(self):
-        g = Graph.Barabasi(1000, 2)
-        es1 = set(e.source for e in g.es.select(_target_in = [2,4]))
-        es2 = set(v1 for v1, v2 in g.get_edgelist() if v2 in [2, 4])
-        self.failUnless(es1 == es2)
-
-    def testWithinFiltering(self):
-        g = Graph.Lattice([10, 10])
-        vs = [0, 1, 2, 10, 11, 12, 20, 21, 22] 
-        vs2 = (0, 1, 10, 11)
-
-        es1 = g.es.select(_within = vs)
-        es2 = g.es.select(_within = VertexSeq(g, vs))
-
-        for es in [es1, es2]:
-            self.failUnless(len(es) == 12)
-            self.failUnless(all(e.source in vs and e.target in vs for e in es))
-
-            es_filtered = es.select(_within = vs2)
-            self.failUnless(len(es_filtered) == 4)
-            self.failUnless(all(e.source in vs2 and e.target in vs2 for e in es_filtered))
-
-    def testBetweenFiltering(self):
-        g = Graph.Lattice([10, 10])
-        vs1, vs2 = [10, 11, 12], [20, 21, 22] 
-
-        es1 = g.es.select(_between = (vs1, vs2))
-        es2 = g.es.select(_between = (VertexSeq(g, vs1), VertexSeq(g, vs2)))
-
-        for es in [es1, es2]:
-            self.failUnless(len(es) == 3)
-            self.failUnless(all((e.source in vs1 and e.target in vs2) or \
-                                (e.target in vs1 and e.source in vs2) for e in es))
-
-    def testIndexOutOfBoundsSelect(self):
-        g = Graph.Full(3)
-        self.assertRaises(ValueError, g.es.select, 4)
-        self.assertRaises(ValueError, g.es.select, 4, 5)
-        self.assertRaises(ValueError, g.es.select, (4, 5))
-        self.assertRaises(ValueError, g.es.select, 2, -1)
-        self.assertRaises(ValueError, g.es.select, (2, -1))
-        self.assertRaises(ValueError, g.es.__getitem__, (0, 1000000))
- 
-    def testGraphMethodProxying(self):
-        idxs = [1, 3, 5, 7, 9]
-        g = Graph.Barabasi(100)
-        es = g.es(*idxs)
-        ebs = g.edge_betweenness()
-        self.assertEquals([ebs[i] for i in idxs], es.edge_betweenness())
-
-        idxs = [1, 3]
-        g = Graph([(0, 1), (1, 2), (2, 0), (1, 0)], directed=True)
-        es = g.es(*idxs)
-        mutual = g.is_mutual(es)
-        self.assertEquals(mutual, es.is_mutual())
-        for e, m in zip(es, mutual):
-            self.assertEquals(e.is_mutual(), m)
-
-    def testIsAll(self):
-        g = Graph.Full(5)
-        self.failUnless(g.es.is_all())
-        self.failIf(g.es.select(1,2,3).is_all())
-        self.failIf(g.es.select(_within=[1,2,3]).is_all())
-
-
-def suite():
-    edge_suite = unittest.makeSuite(EdgeTests)
-    es_suite = unittest.makeSuite(EdgeSeqTests)
-    return unittest.TestSuite([edge_suite, es_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/flow.py igraph-0.6.5/interfaces/python/igraph/test/flow.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/flow.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/flow.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,157 +0,0 @@
-import unittest
-from igraph import *
-
-class MaxFlowTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph(4, [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)])
-        self.capacities = [4, 2, 10, 2, 2]
-        self.g.es["capacity"] = self.capacities
-
-    def testCapacities(self):
-        self.failUnless(self.capacities == \
-            self.g.es.get_attribute_values("capacity"))
-
-    def testEdgeConnectivity(self):
-        self.failUnless(self.g.edge_connectivity(0, 3) == 2)
-        self.failUnless(Graph.Barabasi(50).edge_connectivity() == 1)
-        self.failUnless(self.g.adhesion() == 2)
-        self.failUnless(Graph.Tree(10, 3).adhesion() == 1)
-        self.failUnless(Graph.Tree(10, 3, TREE_OUT).adhesion() == 0)
-        self.assertRaises(ValueError, self.g.edge_connectivity, 0)
-
-    def testVertexConnectivity(self):
-        self.failUnless(self.g.vertex_connectivity(0, 3) == 2)
-        self.failUnless(Graph.Barabasi(50).vertex_connectivity() == 1)
-        self.failUnless(self.g.cohesion() == 2)
-        self.failUnless(Graph.Tree(10, 3).cohesion() == 1)
-        self.failUnless(Graph.Tree(10, 3, TREE_OUT).cohesion() == 0)
-        self.assertRaises(ValueError, self.g.vertex_connectivity, 0)
-        self.assertRaises(InternalError, self.g.vertex_connectivity, 0, 1)
-        self.failUnless(self.g.vertex_connectivity(0, 1, neighbors="nodes") == 4)
-        self.failUnless(self.g.vertex_connectivity(0, 1, neighbors="negative") == -1)
-
-    def testMaxFlowValue(self):
-        self.failUnless(self.g.maxflow_value(0, 3) == 2)
-        self.failUnless(self.g.maxflow_value(0, 3, self.capacities) == 4)
-        self.failUnless(self.g.maxflow_value(0, 3, "capacity") == 4)
-        self.assertRaises(KeyError, self.g.maxflow_value, 0, 3, "unknown")
-
-    def testMaxFlow(self):
-        flow = self.g.maxflow(0, 3)
-        self.assertEquals(flow.value, 2)
-        self.assertEquals(flow.flow, [1, 1, 0, 1, 1])
-
-        flow = self.g.maxflow(0, 3, "capacity")
-        self.assertEquals(flow.value, 4)
-        self.assertEquals(flow.cut, [3, 4])
-        self.assertEquals([e.index for e in flow.es], [3, 4])
-        self.failUnless(set(flow.partition[0]).union(flow.partition[1]) == \
-          set(range(self.g.vcount())))
-
-        self.assertRaises(KeyError, self.g.maxflow, 0, 3, "unknown")
-
-
-class CutTests(unittest.TestCase):
-    def constructSimpleGraph(self, directed=False):
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)], directed)
-        g.es["capacity"] = [4, 2, 10, 2, 2]
-        return g
-
-    def constructLadderGraph(self, directed=False):
-        el  = zip(range(0, 5), range(1, 6))
-        el += zip(range(6, 11), range(7, 12))
-        el += zip(range(0, 6), range(6, 12))
-        g = Graph(el, directed=directed)
-        return g
-
-    def testMinCutValue(self):
-        g = self.constructSimpleGraph()
-        self.failUnless(g.mincut_value(0, 3) == 2)
-        self.failUnless(g.mincut_value(0, 3, g.es["capacity"]) == 4)
-        self.failUnless(g.mincut_value(0, 3, "capacity") == 4)
-        self.assertRaises(KeyError, g.mincut_value, 0, 3, "unknown")
-        self.failUnless(g.mincut_value() == 2)
-        self.failUnless(g.mincut_value(source=0) == 2)
-        self.failUnless(g.mincut_value(target=2) == 2)
-
-    def testMinCut(self):
-        g = self.constructSimpleGraph()
-        mc = g.mincut()
-        self.failUnless(isinstance(mc, Cut))
-        self.failUnless(mc.value == 2)
-        self.failUnless(set(mc.partition[0]).union(mc.partition[1]) == \
-          set(range(g.vcount())))
-        self.failUnless(isinstance(str(mc), str))
-        self.failUnless(isinstance(repr(mc), str))
-        self.failUnless(isinstance(mc.es, EdgeSeq))
-        self.failUnless(len(mc.es) == 2)
-        mc = g.mincut("capacity")
-        self.failUnless(mc.value == 4)
-        self.assertRaises(KeyError, g.mincut, "unknown")
-
-    def testAllSTCuts1(self):
-        # Simple graph with four vertices
-        g = self.constructSimpleGraph(directed=True)
-        partitions = [((0, 1, 1, 1), 2), ((0, 0, 1, 1), 3),
-                      ((0, 1, 0, 1), 2), ((0, 0, 0, 1), 2)]
-        values = dict(partitions)
-        partitions = [partition for partition, _ in partitions]
-        for cut in g.all_st_cuts(0,3):
-            membership = tuple(cut.membership)
-            self.failUnless(membership in partitions,
-                "%r not found among expected partitions" % (membership,))
-            self.assertEquals(cut.value, values[membership])
-            self.assertEquals(len(cut.es), values[membership])
-            partitions.remove(membership)
-        self.failUnless(partitions == [],
-                "expected partitions not seen: %r" % (partitions, ))
-
-    def testAllSTCuts2(self):
-        # "Ladder graph"
-        g = self.constructLadderGraph(directed=True)
-        cuts = g.all_st_cuts(0, 11)
-        self.assertEquals(len(cuts), 36)
-        self.assertEquals(len(set(tuple(cut.membership) for cut in cuts)), 36)
-        for cut in cuts:
-            g2 = g.copy()
-            g2.delete_edges(cut.es)
-            self.failIf(g2.is_connected(),
-                "%r is not a real cut" % (cut.membership,))
-            self.failIf(cut.value < 2 or cut.value > 6)
-
-
-    def testAllSTMinCuts2(self):
-        # "Ladder graph"
-        g = self.constructLadderGraph()
-        g.to_directed("mutual")
-        cuts = g.all_st_mincuts(0, 11)
-        self.assertEquals(len(cuts), 7)
-        self.assertEquals(len(set(tuple(cut.membership) for cut in cuts)), 7)
-        for cut in cuts:
-            self.assertEquals(cut.value, 2)
-            g2 = g.copy()
-            g2.delete_edges(cut.es)
-            self.failIf(g2.is_connected(),
-                "%r is not a real cut" % (cut.membership,))
-
-        g.es["capacity"] = [2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1]
-        cuts = g.all_st_mincuts(0, 11, "capacity")
-        self.assertEquals(len(cuts), 2)
-        self.assertEquals(cuts[0].membership, [0,0,1,1,1,1,0,0,1,1,1,1])
-        self.assertEquals(cuts[1].membership, [0,0,0,0,1,1,0,0,0,0,1,1])
-        self.assertEquals(cuts[0].value, 2)
-        self.assertEquals(cuts[1].value, 2)
-
-
-def suite():
-    flow_suite = unittest.makeSuite(MaxFlowTests)
-    cut_suite = unittest.makeSuite(CutTests)
-    return unittest.TestSuite([flow_suite, cut_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/foreign.py igraph-0.6.5/interfaces/python/igraph/test/foreign.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/foreign.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/foreign.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,234 +0,0 @@
-from __future__ import with_statement
-
-import unittest
-from igraph import *
-import tempfile
-import os
-
-from contextlib import contextmanager
-from textwrap import dedent
-
-@contextmanager
-def temporary_file(content, mode="wb"):
-    tmpf, tmpfname = tempfile.mkstemp()
-    os.close(tmpf)
-    tmpf = open(tmpfname, mode)
-    if isinstance(content, unicode):
-        tmpf.write(dedent(content).encode("utf8"))
-    else:
-        tmpf.write(content)
-    tmpf.close()
-    yield tmpfname
-    os.unlink(tmpfname)
-
-
-class ForeignTests(unittest.TestCase):
-    def testDIMACS(self):
-        with temporary_file(u"""\
-        c
-        c        This is a simple example file to demonstrate the
-        c     DIMACS input file format for minimum-cost flow problems.
-        c 
-        c problem line :
-        p max 4 5
-        c
-        c node descriptor lines :
-        n 1 s
-        n 4 t
-        c
-        c arc descriptor lines :
-        a 1 2 4
-        a 1 3 2
-        a 2 3 2
-        a 2 4 3
-        a 3 4 5
-        """) as tmpfname:
-            graph = Graph.Read_DIMACS(tmpfname, False)
-            self.failUnless(isinstance(graph, Graph))
-            self.failUnless(graph.vcount() == 4 and graph.ecount() == 5)
-            self.failUnless(graph["source"] == 0 and graph["target"] == 3)
-            self.failUnless(graph.es["capacity"] == [4,2,2,3,5])
-            graph.write_dimacs(tmpfname)
-
-
-    def testDL(self):
-        with temporary_file(u"""\
-        dl n=5
-        format = fullmatrix
-        labels embedded
-        data:
-        larry david lin pat russ
-        Larry 0 1 1 1 0
-        david 1 0 0 0 1
-        Lin 1 0 0 1 0
-        Pat 1 0 1 0 1
-        russ 0 1 0 1 0
-        """) as tmpfname:
-            g = Graph.Read_DL(tmpfname)
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 5 and g.ecount() == 12)
-            self.failUnless(g.is_directed())
-            self.failUnless(sorted(g.get_edgelist()) == \
-                    [(0,1),(0,2),(0,3),(1,0),(1,4),(2,0),(2,3),(3,0),\
-                     (3,2),(3,4),(4,1),(4,3)])
-
-        with temporary_file(u"""\
-        dl n=5
-        format = fullmatrix
-        labels:
-        barry,david
-        lin,pat
-        russ
-        data:
-        0 1 1 1 0
-        1 0 0 0 1
-        1 0 0 1 0
-        1 0 1 0 1
-        0 1 0 1 0
-        """) as tmpfname:
-            g = Graph.Read_DL(tmpfname)
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 5 and g.ecount() == 12)
-            self.failUnless(g.is_directed())
-            self.failUnless(sorted(g.get_edgelist()) == \
-                    [(0,1),(0,2),(0,3),(1,0),(1,4),(2,0),(2,3),(3,0),\
-                     (3,2),(3,4),(4,1),(4,3)])
-        
-        with temporary_file(u"""\
-        DL n=5
-        format = edgelist1
-        labels:
-        george, sally, jim, billy, jane
-        labels embedded:
-        data:
-        george sally 2
-        george jim 3
-        sally jim 4
-        billy george 5
-        jane jim 6
-        """) as tmpfname:
-            g = Graph.Read_DL(tmpfname, False)
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 5 and g.ecount() == 5)
-            self.failUnless(not g.is_directed())
-            self.failUnless(sorted(g.get_edgelist()) == \
-                    [(0,1),(0,2),(0,3),(1,2),(2,4)])
-
-    def _testNCOLOrLGL(self, func, fname):
-        g = func(fname, names=False, weights=False, \
-                directed=False)
-        self.failUnless(isinstance(g, Graph))
-        self.failUnless(g.vcount() == 4 and g.ecount() == 5)
-        self.failUnless(not g.is_directed())
-        self.failUnless(sorted(g.get_edgelist()) == \
-                [(0,1),(0,2),(1,1),(1,3),(2,3)])
-        self.failUnless("name" not in g.vertex_attributes() and \
-                "weight" not in g.edge_attributes())
-
-        g = func(fname, names=False, \
-                directed=False)
-        self.failUnless("name" not in g.vertex_attributes() and \
-                "weight" in g.edge_attributes())
-        self.failUnless(g.es["weight"] == [1, 2, 0, 3, 0])
-
-        g = func(fname, directed=False)
-        self.failUnless("name" in g.vertex_attributes() and \
-                "weight" in g.edge_attributes())
-        self.failUnless(g.vs["name"] == ["eggs", "spam", "ham", "bacon"])
-        self.failUnless(g.es["weight"] == [1, 2, 0, 3, 0])
-
-    def testNCOL(self):
-        with temporary_file(u"""\
-        eggs spam 1
-        ham eggs 2
-        ham bacon
-        bacon spam 3
-        spam spam""") as tmpfname:
-            self._testNCOLOrLGL(func=Graph.Read_Ncol, fname=tmpfname)
-
-        with temporary_file(u"""\
-        eggs spam
-        ham eggs
-        ham bacon
-        bacon spam
-        spam spam""") as tmpfname:
-            g = Graph.Read_Ncol(tmpfname)
-            self.failUnless("name" in g.vertex_attributes() and \
-                "weight" not in g.edge_attributes())
-
-    def testLGL(self):
-        with temporary_file(u"""\
-        # eggs
-        spam 1
-        # ham
-        eggs 2
-        bacon
-        # bacon
-        spam 3
-        # spam
-        spam""") as tmpfname:
-            self._testNCOLOrLGL(func=Graph.Read_Lgl, fname=tmpfname)
-
-        with temporary_file(u"""\
-        # eggs
-        spam
-        # ham
-        eggs
-        bacon
-        # bacon
-        spam
-        # spam
-        spam""") as tmpfname:
-            g = Graph.Read_Lgl(tmpfname)
-            self.failUnless("name" in g.vertex_attributes() and \
-                "weight" not in g.edge_attributes())
-
-
-    def testAdjacency(self):
-        with temporary_file(u"""\
-        # Test comment line
-        0 1 1 0 0 0
-        1 0 1 0 0 0
-        1 1 0 0 0 0
-        0 0 0 0 2 2
-        0 0 0 2 0 2
-        0 0 0 2 2 0
-        """) as tmpfname:
-            g = Graph.Read_Adjacency(tmpfname)
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 6 and g.ecount() == 18 and
-                g.is_directed() and "weight" not in g.edge_attributes())
-            g = Graph.Read_Adjacency(tmpfname, attribute="weight")
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 6 and g.ecount() == 12 and
-                g.is_directed() and g.es["weight"] == [1,1,1,1,1,1,2,2,2,2,2,2])
-
-            g.write_adjacency(tmpfname)
-
-    def testPickle(self):
-        pickle = [128, 2, 99, 105, 103, 114, 97, 112, 104, 10, 71, 114, 97, 112,
-                  104, 10, 113, 1, 40, 75, 3, 93, 113, 2, 75, 1, 75, 2, 134, 113, 3, 97,
-                  137, 125, 125, 125, 116, 82, 113, 4, 125, 98, 46]
-        if sys.version_info > (3, 0):
-            pickle = bytes(pickle)
-        else:
-            pickle = "".join(map(chr, pickle))
-        with temporary_file(pickle, "wb") as tmpfname:
-            g = Graph.Read_Pickle(pickle)
-            self.failUnless(isinstance(g, Graph))
-            self.failUnless(g.vcount() == 3 and g.ecount() == 1 and
-                not g.is_directed())
-            g.write_pickle(tmpfname)
-
-
-def suite():
-    foreign_suite = unittest.makeSuite(ForeignTests)
-    return unittest.TestSuite([foreign_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/games.py igraph-0.6.5/interfaces/python/igraph/test/games.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/games.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/games.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,99 +0,0 @@
-import unittest
-from igraph import *
-
-class GameTests(unittest.TestCase):
-    def testGRG(self):
-        g = Graph.GRG(50, 0.2)
-        self.failUnless(isinstance(g, Graph))
-        g = Graph.GRG(50, 0.2, True)
-        self.failUnless(isinstance(g, Graph))
-        self.failUnless("x" in g.vertex_attributes())
-        self.failUnless("y" in g.vertex_attributes())
-        self.failUnless(isinstance(Layout(zip(g.vs["x"], g.vs["y"])), Layout))
-
-    def testForestFire(self):
-        g=Graph.Forest_Fire(100, 0.1)
-        self.failUnless(isinstance(g, Graph) and g.is_directed() == False)
-        g=Graph.Forest_Fire(100, 0.1, directed=True)
-        self.failUnless(isinstance(g, Graph) and g.is_directed() == True)
-
-    def testRecentDegree(self):
-        g=Graph.Recent_Degree(100, 5, 10)
-        self.failUnless(isinstance(g, Graph))
-
-    def testPreference(self):
-        g=Graph.Preference(100, [1, 1], [[1, 0], [0, 1]])
-        self.failUnless(isinstance(g, Graph) and len(g.clusters()) == 2)
-
-        g=Graph.Preference(100, [1, 1], [[1, 0], [0, 1]], attribute="type")
-        l=g.vs.get_attribute_values("type")
-        self.failUnless(min(l) == 0 and max(l) == 1)
-
-    def testAsymmetricPreference(self):
-        g=Graph.Asymmetric_Preference(100, [[0, 1], [1, 0]], [[0, 1], [1, 0]])
-        self.failUnless(isinstance(g, Graph) and len(g.clusters()) == 2)
-
-        g=Graph.Asymmetric_Preference(100, [[0, 1], [1, 0]], [[1, 0], [0, 1]],\
-                                      attribute="type")
-        l=g.vs.get_attribute_values("type")
-        l1=[i[0] for i in l]
-        l2=[i[1] for i in l]
-        self.failUnless(min(l1) == 0 and max(l1) == 1 and
-                        min(l2) == 0 and max(l2) == 1)
-
-        g=Graph.Asymmetric_Preference(100, [[0, 1], [1, 0]], [[1, 0], [0, 1]])
-        self.failUnless(isinstance(g, Graph) and len(g.clusters()) == 1)
-
-    def testWattsStrogatz(self):
-        g=Graph.Watts_Strogatz(1, 20, 1, 0.2)
-        self.failUnless(isinstance(g, Graph) and g.vcount()==20 and g.ecount()==20)
-
-    def testRewire(self):
-        # Undirected graph
-        g=Graph.GRG(25, 0.4)
-        degrees=g.degree()
-
-        # Rewiring without loops
-        g.rewire(10000)
-        self.assertEquals(degrees, g.degree())
-        self.assertTrue(g.is_simple())
-
-        # Rewiring with loops (1)
-        g.rewire(10000, mode="loops")
-        self.assertEquals(degrees, g.degree())
-        self.assertFalse(any(g.is_multiple()))
-
-        # Rewiring with loops (2)
-        g = Graph.Full(4)
-        g[1,3] = 0
-        degrees = g.degree()
-        g.rewire(100, mode="loops")
-        self.assertEquals(degrees, g.degree())
-        self.assertFalse(any(g.is_multiple()))
-
-        # Directed graph
-        g=Graph.GRG(25, 0.4)
-        g.to_directed("mutual")
-        indeg, outdeg = g.indegree(), g.outdegree()
-        g.rewire(10000)
-        self.assertEquals(indeg, g.indegree())
-        self.assertEquals(outdeg, g.outdegree())
-        self.assertTrue(g.is_simple())
-
-        # Directed graph with loops
-        g.rewire(10000, mode="loops")
-        self.assertEquals(indeg, g.indegree())
-        self.assertEquals(outdeg, g.outdegree())
-        self.assertFalse(any(g.is_multiple()))
-
-def suite():
-    game_suite = unittest.makeSuite(GameTests)
-    return unittest.TestSuite([game_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/generators.py igraph-0.6.5/interfaces/python/igraph/test/generators.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/generators.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/generators.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,146 +0,0 @@
-import unittest
-from igraph import *
-
-class GeneratorTests(unittest.TestCase):
-    def testStar(self):
-        g=Graph.Star(5, "in")
-        el=[(1,0),(2,0),(3,0),(4,0)]
-        self.failUnless(g.is_directed())
-        self.failUnless(g.get_edgelist() == el)
-        g=Graph.Star(5, "out", center=2)
-        el=[(2,0),(2,1),(2,3),(2,4)]
-        self.failUnless(g.is_directed())
-        self.failUnless(g.get_edgelist() == el)
-        g=Graph.Star(5, "mutual", center=2)
-        el=[(0,2),(1,2),(2,0),(2,1),(2,3),(2,4),(3,2),(4,2)]
-        self.failUnless(g.is_directed())
-        self.failUnless(sorted(g.get_edgelist()) == el)
-        g=Graph.Star(5, center=3)
-        el=[(0,3),(1,3),(2,3),(3,4)]
-        self.failUnless(not g.is_directed())
-        self.failUnless(sorted(g.get_edgelist()) == el)
-
-    def testFamous(self):
-        g=Graph.Famous("tutte")
-        self.failUnless(g.vcount() == 46 and g.ecount() == 69)
-        self.assertRaises(InternalError, Graph.Famous, "unknown")
-
-    def testFormula(self):
-        tests = [
-            (None, [], []),
-            ("", [""], []),
-            ("A", ["A"], []),
-            ("A-B", ["A", "B"], [(0, 1)]),
-            ("A --- B", ["A", "B"], [(0, 1)]),
-            ("A--B, C--D, E--F, G--H, I, J, K",
-                ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K"],
-                [(0,1), (2,3), (4,5), (6,7)]
-            ),
-            ("A:B:C:D -- A:B:C:D",
-                ["A", "B", "C", "D"],
-                [(0,1), (0,2), (0,3), (1,2), (1,3), (2,3)]
-            ),
-            ("A -> B -> C", ["A", "B", "C"], [(0,1), (1,2)]),
-            ("A <- B -> C", ["A", "B", "C"], [(1,0), (1,2)]),
-            ("A <- B -- C", ["A", "B", "C"], [(1,0)]),
-            ("A <-> B <---> C <> D", ["A", "B", "C", "D"],
-                [(0,1), (1,0), (1,2), (2,1), (2,3), (3,2)]),
-            ("'this is' <- 'a silly' -> 'graph here'",
-                ["this is", "a silly", "graph here"], [(1,0), (1,2)]),
-            ("Alice-Bob-Cecil-Alice, Daniel-Cecil-Eugene, Cecil-Gordon",
-                ["Alice", "Bob", "Cecil", "Daniel", "Eugene", "Gordon"],
-                [(0,1),(1,2),(0,2),(2,3),(2,4),(2,5)]
-            ),
-            ("Alice-Bob:Cecil:Daniel, Cecil:Daniel-Eugene:Gordon",
-                ["Alice", "Bob", "Cecil", "Daniel", "Eugene", "Gordon"],
-                [(0,1),(0,2),(0,3),(2,4),(2,5),(3,4),(3,5)]
-            ),
-            ("Alice <-> Bob --> Cecil <-- Daniel, Eugene --> Gordon:Helen",
-                ["Alice", "Bob", "Cecil", "Daniel", "Eugene", "Gordon", "Helen"],
-                [(0,1),(1,0),(1,2),(3,2),(4,5),(4,6)]
-            ),
-            ("Alice -- Bob -- Daniel, Cecil:Gordon, Helen",
-                ["Alice", "Bob", "Daniel", "Cecil", "Gordon", "Helen"],
-                [(0,1),(1,2)]
-            ),
-            ('"+" -- "-", "*" -- "/", "%%" -- "%/%"',
-                ["+", "-", "*", "/", "%%", "%/%"],
-                [(0,1),(2,3),(4,5)]
-            )
-        ]
-        for formula, names, edges in tests:
-            g = Graph.Formula(formula)
-            self.assertEquals(g.vs["name"], names)
-            self.assertEquals(g.get_edgelist(), sorted(edges))
-
-    def testFull(self):
-        g=Graph.Full(20, directed=True)
-        el=g.get_edgelist()
-        el.sort()
-        self.failUnless(g.get_edgelist() == [(x, y) for x in range(20) for y in range(20) if x!=y])
-
-    def testFullCitation(self):
-        g=Graph.Full_Citation(20)
-        el=g.get_edgelist()
-        el.sort()
-        self.failUnless(not g.is_directed())
-        self.failUnless(el == [(x, y) for x in xrange(19) for y in xrange(x+1, 20)])
-
-        g=Graph.Full_Citation(20, True)
-        el=g.get_edgelist()
-        el.sort()
-        self.failUnless(g.is_directed())
-        self.failUnless(el == [(x, y) for x in xrange(1, 20) for y in xrange(x)])
-
-        self.assertRaises(InternalError, Graph.Full_Citation, -2)
-
-    def testLCF(self):
-        g1=Graph.LCF(12, (5, -5), 6)
-        g2=Graph.Famous("Franklin")
-        self.failUnless(g1.isomorphic(g2))
-        self.assertRaises(InternalError, Graph.LCF, 12, (5, -5), -3)
-
-    def testKautz(self):
-        g=Graph.Kautz(2, 2)
-        deg_in=g.degree(mode=IN)
-        deg_out=g.degree(mode=OUT)
-        # This is not a proper test, but should spot most errors
-        self.failUnless(g.is_directed() and deg_in==[2]*12 and deg_out==[2]*12)
-
-    def testDeBruijn(self):
-        g=Graph.De_Bruijn(2, 3)
-        deg_in=g.degree(mode=IN, loops=True)
-        deg_out=g.degree(mode=OUT, loops=True)
-        # This is not a proper test, but should spot most errors
-        self.failUnless(g.is_directed() and deg_in==[2]*8 and deg_out==[2]*8)
-
-    def testWeightedAdjacency(self):
-        mat = [[0, 1, 2, 0], [2, 0, 0, 0], [0, 0, 2.5, 0], [0, 1, 0, 0]]
-
-        g = Graph.Weighted_Adjacency(mat, attr="w0")
-        el = g.get_edgelist()
-        self.failUnless(el == [(0,1), (0,2), (1,0), (2,2), (3,1)])
-        self.failUnless(g.es["w0"] == [1, 2, 2, 2.5, 1])
-
-        g = Graph.Weighted_Adjacency(mat, mode="plus")
-        el = g.get_edgelist()
-        self.failUnless(el == [(0,1), (0,2), (1,3), (2,2)])
-        self.failUnless(g.es["weight"] == [3, 2, 1, 2.5])
-
-        g = Graph.Weighted_Adjacency(mat, attr="w0", loops=False)
-        el = g.get_edgelist()
-        self.failUnless(el == [(0,1), (0,2), (1,0), (3,1)])
-        self.failUnless(g.es["w0"] == [1, 2, 2, 1])
-
-        
-def suite():
-    generator_suite = unittest.makeSuite(GeneratorTests)
-    return unittest.TestSuite([generator_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/homepage.py igraph-0.6.5/interfaces/python/igraph/test/homepage.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/homepage.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/homepage.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,50 +0,0 @@
-import unittest
-
-from igraph import *
-
-class HomepageExampleTests(unittest.TestCase):
-    """Smoke tests for the Python examples found on the homepage to ensure
-    that they do not break."""
-
-    def testErdosRenyiComponents(self):
-        g = Graph.Erdos_Renyi(n=300, m=250)
-        colors = ["lightgray", "cyan", "magenta", "yellow", "blue", "green", "red"]
-        components = g.components()
-        for component in components:
-            color = colors[min(6, len(components)-1)]
-            g.vs[component]["color"] = color
-
-        # No plotting here, but we calculate the FR layout
-        fr = g.layout("fr")
-
-    def testKautz(self):
-        g = Graph.Kautz(m=3, n=2)
-        adj = g.get_adjacency()
-        # Plotting omitted
-
-    def testMSTofGRG(self):
-        def distance(p1, p2):
-            return ((p1[0]-p2[0]) ** 2 + (p1[1]-p2[1]) ** 2) ** 0.5
-
-        g = Graph.GRG(100, 0.2)
-        layout = Layout(zip(g.vs["x"], g.vs["y"]))
-
-        weights = [distance(layout[edge.source], layout[edge.target]) \
-                for edge in g.es]
-        max_weight = max(weights)
-        g.es["width"] = [6 - 5*weight / max_weight for weight in weights]
-        mst = g.spanning_tree(weights)
-        # Plotting omitted
-
-def suite():
-    homepage_example_suite = unittest.makeSuite(HomepageExampleTests)
-    return unittest.TestSuite([homepage_example_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
-        
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/indexing.py igraph-0.6.5/interfaces/python/igraph/test/indexing.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/indexing.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/indexing.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,51 +0,0 @@
-# vim:ts=4 sw=4 sts=4:
-import unittest
-from igraph import *
-
-class GraphAdjacencyMatrixLikeIndexingTests(unittest.TestCase):
-    def testSingleEdgeRetrieval(self):
-        g = Graph.Famous("krackhardt_kite")
-        for v1, v2 in g.get_edgelist():
-            self.assertEquals(g[v1, v2], 1)
-            self.assertEquals(g[v2, v1], 1)
-        for v1 in xrange(g.vcount()):
-            for v2 in set(range(g.vcount())) - set(g.neighbors(v1)):
-                self.assertEquals(g[v1, v2], 0)
-                self.assertEquals(g[v2, v1], 0)
-
-        g.add_edge(1, 1)
-        self.assertEquals(g[1, 1], 1)
-
-    def testSingleEdgeRetrievalWeights(self):
-        g = Graph.Famous("krackhardt_kite")
-        g.es["weight"] = range(g.ecount())
-        for idx, (v1, v2) in enumerate(g.get_edgelist()):
-            self.assertEquals(g[v1, v2], idx)
-            self.assertEquals(g[v2, v1], idx)
-        for v1 in xrange(g.vcount()):
-            for v2 in set(range(g.vcount())) - set(g.neighbors(v1)):
-                self.assertEquals(g[v1, v2], 0)
-                self.assertEquals(g[v2, v1], 0)
-
-    def testSingleEdgeRetrievalAttrName(self):
-        g = Graph.Famous("krackhardt_kite")
-        g.es["value"] = range(20, g.ecount()+20)
-        for idx, (v1, v2) in enumerate(g.get_edgelist()):
-            self.assertEquals(g[v1, v2, "value"], idx+20)
-            self.assertEquals(g[v2, v1, "value"], idx+20)
-        for v1 in xrange(g.vcount()):
-            for v2 in set(range(g.vcount())) - set(g.neighbors(v1)):
-                self.assertEquals(g[v1, v2, "value"], 0)
-                self.assertEquals(g[v2, v1, "value"], 0)
-
-
-def suite():
-    adjacency_suite = unittest.makeSuite(GraphAdjacencyMatrixLikeIndexingTests)
-    return unittest.TestSuite([adjacency_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/isomorphism.py igraph-0.6.5/interfaces/python/igraph/test/isomorphism.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/isomorphism.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/isomorphism.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,180 +0,0 @@
-import unittest
-from igraph import *
-
-def node_compat(g1, g2, v1, v2):
-    """Node compatibility function for isomorphism tests"""
-    return g1.vs[v1]["color"] == g2.vs[v2]["color"]
-
-def edge_compat(g1, g2, e1, e2):
-    """Edge compatibility function for isomorphism tests"""
-    return g1.es[e1]["color"] == g2.es[e2]["color"]
-
-class IsomorphismTests(unittest.TestCase):
-    def testIsomorphic(self):
-        g1 = Graph(8, [(0, 4), (0, 5), (0, 6), \
-                       (1, 4), (1, 5), (1, 7), \
-                       (2, 4), (2, 6), (2, 7), \
-                       (3, 5), (3, 6), (3, 7)])
-        g2 = Graph(8, [(0, 1), (0, 3), (0, 4), \
-                       (2, 3), (2, 1), (2, 6), \
-                       (5, 1), (5, 4), (5, 6), \
-                       (7, 3), (7, 6), (7, 4)])
-
-        # Test the isomorphy of g1 and g2
-        self.failUnless(g1.isomorphic(g2))
-        self.failUnless(g2.isomorphic_vf2(g1, return_mapping_21=True) \
-          == (True, None, [0, 2, 5, 7, 1, 3, 4, 6]))
-        self.failUnless(g2.isomorphic_bliss(g1, return_mapping_21=True, sh2="fl")\
-          == (True, None, [0, 2, 5, 7, 1, 3, 4, 6]))
-        self.assertRaises(ValueError, g2.isomorphic_bliss, g1, sh2="nonexistent")
-
-        # Test the automorphy of g1
-        self.failUnless(g1.isomorphic())
-        self.failUnless(g1.isomorphic_vf2(return_mapping_21=True) \
-          == (True, None, [0, 1, 2, 3, 4, 5, 6, 7]))
-
-        # Test VF2 with colors
-        self.failUnless(g1.isomorphic_vf2(g2,
-            color1=[0,1,0,1,0,1,0,1],
-            color2=[0,0,1,1,0,0,1,1]))
-        g1.vs["color"] = [0,1,0,1,0,1,0,1]
-        g2.vs["color"] = [0,0,1,1,0,1,1,0]
-        self.failUnless(not g1.isomorphic_vf2(g2, "color", "color"))
-
-        # Test VF2 with vertex and edge colors
-        self.failUnless(g1.isomorphic_vf2(g2,
-            color1=[0,1,0,1,0,1,0,1],
-            color2=[0,0,1,1,0,0,1,1]))
-        g1.es["color"] = range(12)
-        g2.es["color"] = [0]*6 + [1]*6
-        self.failUnless(not g1.isomorphic_vf2(g2, "color", "color", "color", "color"))
-
-        # Test VF2 with node compatibility function
-        g2.vs["color"] = [0,0,1,1,0,0,1,1]
-        self.failUnless(g1.isomorphic_vf2(g2, node_compat_fn=node_compat))
-        g2.vs["color"] = [0,0,1,1,0,1,1,0]
-        self.failUnless(not g1.isomorphic_vf2(g2, node_compat_fn=node_compat))
-
-        # Test VF2 with node edge compatibility function
-        g2.vs["color"] = [0,0,1,1,0,0,1,1]
-        g1.es["color"] = range(12)
-        g2.es["color"] = [0]*6 + [1]*6
-        self.failUnless(not g1.isomorphic_vf2(g2, node_compat_fn=node_compat,
-            edge_compat_fn=edge_compat))
-
-    def testIsomorphicCallback(self):
-        maps = []
-        def callback(g1, g2, map1, map2):
-            maps.append(map1)
-            return True
-
-        # Test VF2 callback
-        g = Graph(6, [(0,1), (2,3), (4,5), (0,2), (2,4), (1,3), (3,5)])
-        g.isomorphic_vf2(g, callback=callback)
-        expected_maps = [[0,1,2,3,4,5], [1,0,3,2,5,4], [4,5,2,3,0,1], [5,4,3,2,1,0]]
-        self.failUnless(sorted(maps) == expected_maps)
-
-        maps[:] = []
-        g3 = Graph.Full(4)
-        g3.vs["color"] = [0,1,1,0]
-        g3.isomorphic_vf2(callback=callback, color1="color", color2="color")
-        expected_maps = [[0,1,2,3], [0,2,1,3], [3,1,2,0], [3,2,1,0]]
-        self.failUnless(sorted(maps) == expected_maps)
-
-    def testCountIsomorphisms(self):
-        g = Graph.Full(4)
-        self.failUnless(g.count_automorphisms_vf2() == 24)
-        g = Graph(6, [(0,1), (2,3), (4,5), (0,2), (2,4), (1,3), (3,5)])
-        self.failUnless(g.count_automorphisms_vf2() == 4)
-
-        # Some more tests with colors
-        g3 = Graph.Full(4)
-        g3.vs["color"] = [0,1,1,0]
-        self.failUnless(g3.count_isomorphisms_vf2() == 24)
-        self.failUnless(g3.count_isomorphisms_vf2(color1="color", color2="color") == 4)
-        self.failUnless(g3.count_isomorphisms_vf2(color1=[0,1,2,0], color2=(0,1,2,0)) == 2)
-        self.failUnless(g3.count_isomorphisms_vf2(edge_color1=[0,1,0,0,0,1],
-            edge_color2=[0,1,0,0,0,1]) == 2)
-
-        # Test VF2 with node/edge compatibility function
-        g3.vs["color"] = [0,1,1,0]
-        self.failUnless(g3.count_isomorphisms_vf2(node_compat_fn=node_compat) == 4)
-        g3.vs["color"] = [0,1,2,0]
-        self.failUnless(g3.count_isomorphisms_vf2(node_compat_fn=node_compat) == 2)
-        g3.es["color"] = [0,1,0,0,0,1]
-        self.failUnless(g3.count_isomorphisms_vf2(edge_compat_fn=edge_compat) == 2)
-
-    def testGetIsomorphisms(self):
-        g = Graph(6, [(0,1), (2,3), (4,5), (0,2), (2,4), (1,3), (3,5)])
-        maps = g.get_automorphisms_vf2()
-        expected_maps = [[0,1,2,3,4,5], [1,0,3,2,5,4], [4,5,2,3,0,1], [5,4,3,2,1,0]]
-        self.failUnless(maps == expected_maps)
-
-        g3 = Graph.Full(4)
-        g3.vs["color"] = [0,1,1,0]
-        expected_maps = [[0,1,2,3], [0,2,1,3], [3,1,2,0], [3,2,1,0]]
-        self.failUnless(sorted(g3.get_automorphisms_vf2(color="color")) == expected_maps)
-
-    def testSubisomorphic(self):
-        g = Graph.Lattice([3,3], circular=False)
-        g2 = Graph([(0,1), (1,2), (1,3)])
-        self.failUnless(g.subisomorphic_vf2(g2))
-        self.failUnless(not g2.subisomorphic_vf2(g))
-
-        # Test with vertex colors
-        g.vs["color"] = [0,0,0,0,1,0,0,0,0]
-        g2.vs["color"] = [1,0,0,0]
-        self.failUnless(g.subisomorphic_vf2(g2, node_compat_fn=node_compat))
-        g2.vs["color"] = [2,0,0,0]
-        self.failUnless(not g.subisomorphic_vf2(g2, node_compat_fn=node_compat))
-
-        # Test with edge colors
-        g.es["color"] = [1] + [0]*(g.ecount()-1)
-        g2.es["color"] = [1] + [0]*(g2.ecount()-1)
-        self.failUnless(g.subisomorphic_vf2(g2, edge_compat_fn=edge_compat))
-        g2.es[0]["color"] = [2]
-        self.failUnless(not g.subisomorphic_vf2(g2, node_compat_fn=node_compat))
-
-    def testCountSubisomorphisms(self):
-        g = Graph.Lattice([3,3], circular=False)
-        g2 = Graph.Lattice([2,2], circular=False)
-        self.failUnless(g.count_subisomorphisms_vf2(g2) == 4*4*2)
-        self.failUnless(g2.count_subisomorphisms_vf2(g) == 0)
-
-        # Test with vertex colors
-        g.vs["color"] = [0,0,0,0,1,0,0,0,0]
-        g2.vs["color"] = [1,0,0,0]
-        self.failUnless(g.count_subisomorphisms_vf2(g2, "color", "color") == 4*2)
-        self.failUnless(g.count_subisomorphisms_vf2(g2, node_compat_fn=node_compat) == 4*2)
-
-        # Test with edge colors
-        g.es["color"] = [1] + [0]*(g.ecount()-1)
-        g2.es["color"] = [1] + [0]*(g2.ecount()-1)
-        self.failUnless(g.count_subisomorphisms_vf2(g2, edge_color1="color", edge_color2="color") == 2)
-        self.failUnless(g.count_subisomorphisms_vf2(g2, edge_compat_fn=edge_compat) == 2)
-
-    def testPermuteVertices(self):
-        g1 = Graph(8, [(0, 4), (0, 5), (0, 6), \
-                       (1, 4), (1, 5), (1, 7), \
-                       (2, 4), (2, 6), (2, 7), \
-                       (3, 5), (3, 6), (3, 7)])
-        g2 = Graph(8, [(0, 1), (0, 3), (0, 4), \
-                       (2, 3), (2, 1), (2, 6), \
-                       (5, 1), (5, 4), (5, 6), \
-                       (7, 3), (7, 6), (7, 4)])
-        _, _, mapping = g1.isomorphic_vf2(g2, return_mapping_21=True)
-        g3 = g2.permute_vertices(mapping)
-        self.failUnless(g3.vcount() == g2.vcount() and g3.ecount() == g2.ecount())
-        self.failUnless(set(g3.get_edgelist()) == set(g1.get_edgelist()))
-
-def suite():
-    isomorphism_suite = unittest.makeSuite(IsomorphismTests)
-    return unittest.TestSuite([isomorphism_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/iterators.py igraph-0.6.5/interfaces/python/igraph/test/iterators.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/iterators.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/iterators.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-import unittest
-from igraph import *
-
-class IteratorTests(unittest.TestCase):
-    def testBFS(self):
-        g=Graph.Tree(10, 2)
-        vs=[v.index for v in g.bfsiter(0)]
-        self.assertEquals(vs, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
-        vs=[(v.index,dist,parent) for v,dist,parent in g.bfsiter(0, advanced=True)]
-        vs=[(v,d,p.index) for v,d,p in vs if p != None]
-        self.assertEquals(vs, [(1,1,0), (2,1,0), (3,2,1), (4,2,1), \
-          (5,2,2), (6,2,2), (7,3,3), (8,3,3), (9,3,4)])
-
-
-def suite():
-    iterator_suite = unittest.makeSuite(IteratorTests)
-    return unittest.TestSuite([iterator_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/layouts.py igraph-0.6.5/interfaces/python/igraph/test/layouts.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/layouts.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/layouts.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,230 +0,0 @@
-import unittest
-from igraph import Graph, Layout, BoundingBox
-
-class LayoutTests(unittest.TestCase):
-    def testConstructor(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0)])
-        self.assertEqual(layout.dim, 3)
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0)], 3)
-        self.assertEqual(layout.dim, 3)
-        self.assertRaises(ValueError, Layout, [(0,1), (1,0)], 3)
-
-    def testIndexing(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        self.assertEqual(len(layout), 4)
-        self.assertEqual(layout[1], [0, 1, 0])
-        self.assertEqual(layout[3], [2, 1, 3])
-        
-        row = layout[2]
-        row[2] = 1
-        self.assertEqual(layout[2], [1, 0, 1])
-
-        del layout[1]
-        self.assertEqual(len(layout), 3)
-
-    def testScaling(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        layout.scale(1.5)
-        self.assertEqual(layout.coords, [[0., 0., 1.5], \
-                                         [0., 1.5, 0.], \
-                                         [1.5, 0., 0.], \
-                                         [3., 1.5, 4.5]])
-
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        layout.scale(1, 1, 3)
-        self.assertEqual(layout.coords, [[0, 0, 3], \
-                                         [0, 1, 0], \
-                                         [1, 0, 0], \
-                                         [2, 1, 9]])
-
-
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        layout.scale((2, 2, 1))
-        self.assertEqual(layout.coords, [[0, 0, 1], \
-                                         [0, 2, 0], \
-                                         [2, 0, 0], \
-                                         [4, 2, 3]])
-
-        self.assertRaises(ValueError, layout.scale, 2, 3)
-
-
-    def testTranslation(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        layout2 = layout.copy()
-        
-        layout.translate(1,3,2)
-        self.assertEqual(layout.coords, [[1, 3, 3], \
-                                         [1, 4, 2], \
-                                         [2, 3, 2], \
-                                         [3, 4, 5]])
-        
-        layout.translate((-1,-3,-2))
-        self.assertEqual(layout.coords, layout2.coords)
-
-        self.assertRaises(ValueError, layout.translate, v=[3])
-        
-    def testCentroid(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        centroid = layout.centroid()
-        self.assertEqual(len(centroid), 3)
-        self.assertAlmostEqual(centroid[0], 0.75)
-        self.assertAlmostEqual(centroid[1], 0.5)
-        self.assertAlmostEqual(centroid[2], 1.)
-
-    def testBoundaries(self):
-        layout = Layout([(0,0,1), (0,1,0), (1,0,0), (2,1,3)])
-        self.assertEqual(layout.boundaries(), ([0,0,0],[2,1,3]))
-        self.assertEqual(layout.boundaries(1), ([-1,-1,-1],[3,2,4]))
-
-    def testBoundingBox(self):
-        layout = Layout([(0,1), (2,7)])
-        self.assertEqual(layout.bounding_box(), BoundingBox(0,1,2,7))
-        self.assertEqual(layout.bounding_box(1), BoundingBox(-1,0,3,8))
-
-    def testCenter(self):
-        layout = Layout([(-2,0), (-2,-2), (0,-2), (0,0)])
-        layout.center()
-        self.assertEqual(layout.coords, [[-1,1], [-1,-1], [1,-1], [1,1]])
-        layout.center(5,5)
-        self.assertEqual(layout.coords, [[4,6], [4,4], [6,4], [6,6]])
-        self.assertRaises(ValueError, layout.center, 3)
-        self.assertRaises(TypeError, layout.center, p=6)
-
-    def testFitInto(self):
-        layout = Layout([(-2,0), (-2,-2), (0,-2), (0,0)])
-        layout.fit_into(BoundingBox(5,5,8,10), keep_aspect_ratio=False)
-        self.assertEqual(layout.coords, [[5, 10], [5, 5], [8, 5], [8, 10]])
-        layout = Layout([(-2,0), (-2,-2), (0,-2), (0,0)])
-        layout.fit_into(BoundingBox(5,5,8,10))
-        self.assertEqual(layout.coords, [[5, 9], [5, 6], [8, 6], [8, 9]])
-
-        layout = Layout([(-1,-1,-1), (0,0,0), (1,1,1), (2,2,0), (3,3,-1)])
-        layout.fit_into((0,0,0,8,8,4))
-        self.assertEqual(layout.coords, \
-                [[0, 0, 0], [2, 2, 2], [4, 4, 4], [6, 6, 2], [8, 8, 0]]
-        )
-
-    def testToPolar(self):
-        import math
-        layout = Layout([(0, 0), (-1, 1), (0, 1), (1, 1)])
-        layout.to_radial(min_angle = 180, max_angle = 0, max_radius = 2)
-        exp = [[0., 0.], [-2., 0.], [0., 2.], [2, 0.]]
-        for idx in xrange(4):
-            self.assertAlmostEqual(layout.coords[idx][0], exp[idx][0], places=3)
-            self.assertAlmostEqual(layout.coords[idx][1], exp[idx][1], places=3)
-
-    def testTransform(self):
-        def tr(coord, dx, dy): return coord[0]+dx, coord[1]+dy
-        layout = Layout([(1, 2), (3, 4)])
-        layout.transform(tr, 2, -1)
-        self.assertEqual(layout.coords, [[3, 1], [5, 3]])
-
-
-class LayoutAlgorithmTests(unittest.TestCase):
-    def testAuto(self):
-        def layout_test(graph, test_with_dims=(2, 3)):
-            lo = graph.layout("auto")
-            self.failUnless(isinstance(lo, Layout))
-            self.assertEquals(len(lo[0]), 2)
-            for dim in test_with_dims:
-                lo = graph.layout("auto", dim=dim)
-                self.failUnless(isinstance(lo, Layout))
-                self.assertEquals(len(lo[0]), dim)
-            return lo
-
-        g = Graph.Barabasi(10)
-        layout_test(g)
-
-        g = Graph.GRG(101, 0.2)
-        del g.vs["x"]
-        del g.vs["y"]
-        layout_test(g)
-
-        g = Graph.Full(10) * 2
-        layout_test(g)
-
-        g["layout"] = "graphopt"
-        layout_test(g, test_with_dims=())
-
-        g.vs["x"] = range(20)
-        g.vs["y"] = range(20, 40)
-        layout_test(g, test_with_dims=())
-
-        del g["layout"]
-        lo = layout_test(g, test_with_dims=(2,))
-        self.assertEquals([tuple(item) for item in lo],
-                          zip(range(20), range(20, 40)))
-
-        g.vs["z"] = range(40, 60)
-        lo = layout_test(g)
-        self.assertEquals([tuple(item) for item in lo],
-                          zip(range(20), range(20, 40), range(40, 60)))
-
-    def testFruchtermanReingold(self):
-        g = Graph.Barabasi(100)
-        lo = g.layout("fr")
-        self.failUnless(isinstance(lo, Layout))
-        lo = g.layout("fr", miny=range(100))
-        self.failUnless(isinstance(lo, Layout))
-        lo = g.layout("fr", miny=range(100), maxy=range(100))
-        self.failUnless(isinstance(lo, Layout))
-        lo = g.layout("fr", miny=[2]*100, maxy=[3]*100, minx=[4]*100, maxx=[6]*100)
-        self.failUnless(isinstance(lo, Layout))
-        bbox = lo.bounding_box()
-        self.failUnless(bbox.top >= 2)
-        self.failUnless(bbox.bottom <= 3)
-        self.failUnless(bbox.left >= 4)
-        self.failUnless(bbox.right >= 6)
-
-    def testKamadaKawai(self):
-        g = Graph.Barabasi(100)
-        lo = g.layout("kk", miny=[2]*100, maxy=[3]*100, minx=[4]*100, maxx=[6]*100)
-        self.failUnless(isinstance(lo, Layout))
-        bbox = lo.bounding_box()
-        self.failUnless(bbox.top >= 2)
-        self.failUnless(bbox.bottom <= 3)
-        self.failUnless(bbox.left >= 4)
-        self.failUnless(bbox.right >= 6)
-
-    def testMDS(self):
-        g = Graph.Tree(10, 2)
-        lo = g.layout("mds")
-        self.failUnless(isinstance(lo, Layout))
-
-        dists = g.shortest_paths()
-        lo = g.layout("mds", dists)
-        self.failUnless(isinstance(lo, Layout))
-
-        g += Graph.Tree(10, 2)
-        lo = g.layout("mds")
-        self.failUnless(isinstance(lo, Layout))
-
-    def testReingoldTilford(self):
-        g = Graph.Barabasi(100)
-        lo = g.layout("rt")
-        ys = [coord[1] for coord in lo]
-        root = ys.index(0.0)
-        self.assertEqual(ys, g.shortest_paths(root)[0])
-        g = Graph.Barabasi(100) + Graph.Barabasi(50)
-        lo = g.layout("rt", root=[0, 100])
-        self.assertEqual(lo[100][1]-lo[0][1], 0)
-        lo = g.layout("rt", root=[0, 100], rootlevel = [2, 10])
-        self.assertEqual(lo[100][1]-lo[0][1], 8)
-
-    def testDRL(self):
-        # Regression test for bug #1091891
-        g = Graph.Ring(10, circular=False) + 1
-        lo = g.layout("drl")
-
-def suite():
-    layout_suite = unittest.makeSuite(LayoutTests)
-    layout_algorithm_suite = unittest.makeSuite(LayoutAlgorithmTests)
-    return unittest.TestSuite([layout_suite, layout_algorithm_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/matching.py igraph-0.6.5/interfaces/python/igraph/test/matching.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/matching.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/matching.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,79 +0,0 @@
-import unittest
-
-from igraph import *
-
-def powerset(iterable):
-    items_powers = [(item, 1 << i) for i, item in enumerate(iterable)]
-    for i in range(1 << len(items_powers)):
-        for item, power in items_powers:
-            if i & power:
-                yield item
-
-
-leda_graph = Graph([
-    (0,8),(0,12),(0,14),(1,9),(1,10),(1,13),
-    (2,8),(2,9),(3,10),(3,11),(3,13),(4,9),(4,14),
-    (5,14),(6,9),(6,14),(7,8),(7,12),(7,14)])
-leda_graph.vs["type"] = [0]*8+[1]*7
-
-class MatchingTests(unittest.TestCase):
-    def setUp(self):
-        self.matching = Matching(leda_graph,
-                [12, 10, 8, 13, -1, 14, 9, -1, 2, 6, 1, -1, 0, 3, 5],
-                "type")
-
-    def testIsMaximal(self):
-        self.assertTrue(self.matching.is_maximal())
-        self.matching.matching[0] = -1
-        self.matching.matching[12] = -1
-        self.assertFalse(self.matching.is_maximal())
-
-    def testMatchingRetrieval(self):
-        m = [12, 10, 8, 13, -1, 14, 9, -1, 2, 6, 1, -1, 0, 3, 5]
-        self.assertEqual(self.matching.matching, m)
-        for i, mate in enumerate(m):
-            if mate == -1:
-                self.assertFalse(self.matching.is_matched(i))
-                self.assertEqual(self.matching.match_of(i), None)
-            else:
-                self.assertTrue(self.matching.is_matched(i))
-                self.assertEqual(self.matching.match_of(i), mate)
-                self.assertEqual(self.matching.match_of(
-                    leda_graph.vs[i]).index, leda_graph.vs[mate].index)
-
-
-class MaximumBipartiteMatchingTests(unittest.TestCase):
-    def testBipartiteMatchingSimple(self):
-        # Specifying the "type" attribute explicitly
-        matching = leda_graph.maximum_bipartite_matching("type")
-        self.assertEqual(len(matching), 6)
-        self.assertTrue(matching.is_maximal())
-
-        # Using the default attribute
-        matching = leda_graph.maximum_bipartite_matching()
-        self.assertEqual(len(matching), 6)
-        self.assertTrue(matching.is_maximal())
-
-    def testBipartiteMatchingErrors(self):
-        # Type vector too short
-        g = Graph([(0, 1), (1, 2), (2, 3)])
-        self.assertRaises(InternalError, g.maximum_bipartite_matching,
-                types=[0,1,0])
-
-        # Graph not bipartite
-        self.assertRaises(ValueError, g.maximum_bipartite_matching,
-                types=[0,1,1,1])
-
-
-def suite():
-    matching_suite = unittest.makeSuite(MatchingTests)
-    bipartite_unweighted_suite = unittest.makeSuite(MaximumBipartiteMatchingTests)
-    return unittest.TestSuite([matching_suite, bipartite_unweighted_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/operators.py igraph-0.6.5/interfaces/python/igraph/test/operators.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/operators.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/operators.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,196 +0,0 @@
-import unittest
-from igraph import *
-
-class OperatorTests(unittest.TestCase):
-    def testMultiplication(self):
-        g = Graph.Full(3)*3
-        self.failUnless(g.vcount() == 9 and g.ecount() == 9
-                        and g.clusters().membership == [0,0,0,1,1,1,2,2,2])
-
-    def testIntersection(self):
-        g = Graph.Tree(7, 2) & Graph.Lattice([7])
-        self.failUnless(g.get_edgelist() == [(0, 1)])
-
-    def testUnion(self):
-        g = Graph.Tree(7, 2) | Graph.Lattice([7])
-        self.failUnless(g.vcount() == 7 and g.ecount() == 12)
-
-    def testInPlaceAddition(self):
-        g = Graph.Full(3)
-        orig = g
-
-        # Adding vertices
-        g += 2
-        self.failUnless(g.vcount() == 5 and g.ecount() == 3
-                        and g.clusters().membership == [0,0,0,1,2])
-
-        # Adding a vertex by name
-        g += "spam"
-        self.failUnless(g.vcount() == 6 and g.ecount() == 3
-                        and g.clusters().membership == [0,0,0,1,2,3])
-
-        # Adding a single edge
-        g += (2, 3)
-        self.failUnless(g.vcount() == 6 and g.ecount() == 4
-                        and g.clusters().membership == [0,0,0,0,1,2])
-
-        # Adding two edges
-        g += [(3, 4), (2, 4), (4, 5)]
-        self.failUnless(g.vcount() == 6 and g.ecount() == 7
-                        and g.clusters().membership == [0]*6)
-
-        # Adding two more vertices
-        g += ["eggs", "bacon"]
-        self.assertEquals(g.vs["name"], [None, None, None, None, None,
-            "spam", "eggs", "bacon"])
-
-        # Did we really use the original graph so far?
-        # TODO: disjoint union should be modified so that this assertion
-        # could be moved to the end
-        self.assert_(id(g) == id(orig))
-
-        # Adding another graph
-        g += Graph.Full(3)
-        self.failUnless(g.vcount() == 11 and g.ecount() == 10
-                        and g.clusters().membership == [0,0,0,0,0,0,1,2,3,3,3])
-
-        # Adding two graphs
-        g += [Graph.Full(3), Graph.Full(2)]
-        self.failUnless(g.vcount() == 16 and g.ecount() == 14
-                        and g.clusters().membership == [0,0,0,0,0,0,1,2,3,3,3,4,4,4,5,5])
-
-    def testAddition(self):
-        g0 = Graph.Full(3)
-
-        # Adding vertices
-        g = g0+2
-        self.failUnless(g.vcount() == 5 and g.ecount() == 3
-                        and g.clusters().membership == [0,0,0,1,2])
-        g0 = g
-
-        # Adding vertices by name
-        g = g0+"spam"
-        self.failUnless(g.vcount() == 6 and g.ecount() == 3
-                        and g.clusters().membership == [0,0,0,1,2,3])
-        g0 = g
-
-        # Adding a single edge
-        g = g0+(2,3)
-        self.failUnless(g.vcount() == 6 and g.ecount() == 4
-                        and g.clusters().membership == [0,0,0,0,1,2])
-        g0 = g
-
-        # Adding two edges
-        g = g0+[(3, 4), (2, 4), (4, 5)]
-        self.failUnless(g.vcount() == 6 and g.ecount() == 7
-                        and g.clusters().membership == [0]*6)
-        g0 = g
-
-        # Adding another graph
-        g = g0+Graph.Full(3)
-        self.failUnless(g.vcount() == 9 and g.ecount() == 10
-                        and g.clusters().membership == [0,0,0,0,0,0,1,1,1])
-
-    def testInPlaceSubtraction(self):
-        g = Graph.Full(8)
-        orig = g
-
-        # Deleting a vertex by vertex selector
-        g -= 7
-        self.failUnless(g.vcount() == 7 and g.ecount() == 21
-                        and g.clusters().membership == [0,0,0,0,0,0,0])
-
-        # Deleting a vertex
-        g -= g.vs[6]
-        self.failUnless(g.vcount() == 6 and g.ecount() == 15
-                        and g.clusters().membership == [0,0,0,0,0,0])
-
-        # Deleting two vertices
-        g -= [4, 5]
-        self.failUnless(g.vcount() == 4 and g.ecount() == 6
-                        and g.clusters().membership == [0,0,0,0])
-
-        # Deleting an edge
-        g -= (1, 2)
-        self.failUnless(g.vcount() == 4 and g.ecount() == 5
-                        and g.clusters().membership == [0,0,0,0])
-
-        # Deleting three more edges
-        g -= [(1, 3), (0, 2), (0, 3)]
-        self.failUnless(g.vcount() == 4 and g.ecount() == 2
-                        and g.clusters().membership == [0,0,1,1])
-        
-        # Did we really use the original graph so far?
-        self.assert_(id(g) == id(orig))
-
-        # Subtracting a graph
-        g2 = Graph.Tree(3, 2)
-        g -= g2
-        self.failUnless(g.vcount() == 4 and g.ecount() == 1
-                        and g.clusters().membership == [0,1,2,2])
-
-    def testNonzero(self):
-        self.failUnless(Graph(1))
-        self.failIf(Graph(0))
-
-    def testLength(self):
-        self.assertRaises(TypeError, len, Graph(15))
-        self.failUnless(len(Graph(15).vs) == 15)
-        self.failUnless(len(Graph.Full(5).es) == 10)
-
-    def testSimplify(self):
-        el = [(0,1), (1,0), (1,2), (2,3), (2,3), (2,3), (3,3)] 
-        g = Graph(el)
-        g.es["weight"] = [1, 2, 3, 4, 5, 6, 7]
-
-        g2 = g.copy()
-        g2.simplify()
-        self.failUnless(g2.vcount() == g.vcount())
-        self.failUnless(g2.ecount() == 3)
-
-        g2 = g.copy()
-        g2.simplify(loops=False)
-        self.failUnless(g2.vcount() == g.vcount())
-        self.failUnless(g2.ecount() == 4)
-
-        g2 = g.copy()
-        g2.simplify(multiple=False)
-        self.failUnless(g2.vcount() == g.vcount())
-        self.failUnless(g2.ecount() == g.ecount() - 1)
-
-    def testContractVertices(self):
-        g = Graph.Full(4) + Graph.Full(4) + [(0, 5), (1, 4)]
-
-        g2 = g.copy()
-        g2.contract_vertices([0, 1, 2, 3, 1, 0, 4, 5])
-        self.assertEquals(g2.vcount(), 6)
-        self.assertEquals(g2.ecount(), g.ecount())
-        self.assertEquals(sorted(g2.get_edgelist()),
-                [(0, 0), (0, 1), (0, 1), (0, 2), (0, 3), (0, 4), (0, 5),
-                 (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (4, 5)])
-
-        g2 = g.copy()
-        g2.contract_vertices([0, 1, 2, 3, 1, 0, 6, 7])
-        self.assertEquals(g2.vcount(), 8)
-        self.assertEquals(g2.ecount(), g.ecount())
-        self.assertEquals(sorted(g2.get_edgelist()),
-                [(0, 0), (0, 1), (0, 1), (0, 2), (0, 3), (0, 6), (0, 7),
-                 (1, 1), (1, 2), (1, 3), (1, 6), (1, 7), (2, 3), (6, 7)])
-
-        g2 = Graph(10)
-        g2.contract_vertices([0, 0, 1, 1, 2, 2, 3, 3, 4, 4])
-        self.assertEquals(g2.vcount(), 5)
-        self.assertEquals(g2.ecount(), 0)
-
-
-def suite():
-    operator_suite = unittest.makeSuite(OperatorTests)
-    return unittest.TestSuite([operator_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/rng.py igraph-0.6.5/interfaces/python/igraph/test/rng.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/rng.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/rng.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-import random
-import unittest
-from igraph import *
-
-
-class FakeRNG(object):
-    @staticmethod
-    def random():
-        return 0.1
-
-    @staticmethod
-    def randint(a, b):
-        return a
-
-    @staticmethod
-    def gauss(mu, sigma):
-        return 0.3
-
-class InvalidRNG(object):
-    pass
-
-
-class RandomNumberGeneratorTests(unittest.TestCase):
-    def tearDown(self):
-        set_random_number_generator(random)
-
-    def testSetRandomNumberGenerator(self):
-        set_random_number_generator(FakeRNG)
-        graph = Graph.GRG(10, 0.2)
-        self.assertEquals(graph.vs["x"], [0.1] * 10)
-        self.assertEquals(graph.vs["y"], [0.1] * 10)
-
-        self.assertRaises(AttributeError, set_random_number_generator,
-                InvalidRNG)
-
-    def testSeeding(self):
-        state = random.getstate()
-        g1 = Graph.Erdos_Renyi(n=1000, m=5000)
-        random.setstate(state)
-        g2 = Graph.Erdos_Renyi(n=1000, m=5000)
-        self.failUnless(g1.get_edgelist() == g2.get_edgelist())
-
-
-def suite():
-    random_suite = unittest.makeSuite(RandomNumberGeneratorTests)
-    return unittest.TestSuite([random_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/separators.py igraph-0.6.5/interfaces/python/igraph/test/separators.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/separators.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/separators.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,67 +0,0 @@
-import unittest
-
-from igraph import *
-
-def powerset(iterable):
-    items_powers = [(item, 1 << i) for i, item in enumerate(iterable)]
-    for i in range(1 << len(items_powers)):
-        for item, power in items_powers:
-            if i & power:
-                yield item
-
-class IsSeparatorTests(unittest.TestCase):
-    def testIsSeparator(self):
-        g = Graph.Lattice([8, 4], circular=False)
-        self.failUnless(g.is_separator([3, 11, 19, 27]))
-        self.failIf(g.is_separator([10, 11, 18, 19]))
-        self.failUnless(g.is_separator([29, 20, 11, 2]))
-        self.failUnless(g.is_separator([16, 25, 17]))
-
-        g = Graph.Lattice([8, 4], circular=True)
-        self.failIf(g.is_separator([3, 11, 19, 27]))
-        self.failIf(g.is_separator([29, 20, 11, 2]))
-
-        self.assertRaises(InternalError, g.is_separator, range(32))
-
-    def testIsMinimalSeparator(self):
-        g = Graph.Lattice([8, 4], circular=False)
-        self.failUnless(g.is_minimal_separator([3, 11, 19, 27]))
-        self.failIf(g.is_minimal_separator([3, 11, 19, 27, 28]))
-        self.failIf(g.is_minimal_separator([16, 25, 17]))
-        self.failUnless(g.is_minimal_separator([16, 25]))
-
-        self.assertRaises(InternalError, g.is_minimal_separator, range(32))
-
-    def testAllMinimalSTSeparators(self):
-        g = Graph.Famous("petersen")
-        min_st_seps = set(tuple(x) for x in g.all_minimal_st_separators())
-        for vs in powerset(range(g.vcount())):
-            if vs in min_st_seps:
-                self.failUnless(g.is_minimal_separator(vs))
-            else:
-                self.failIf(g.is_minimal_separator(vs))
-
-    def testMinimumSizeSeparators(self):
-        g = Graph.Famous("zachary")
-        min_st_seps = set(tuple(x) for x in g.all_minimal_st_separators())
-        min_size_seps = [tuple(x) for x in g.minimum_size_separators()]
-        self.failUnless(set(min_size_seps).issubset(min_st_seps))
-        self.failUnless(len(set(min_size_seps)) == len(min_size_seps))
-
-        size = len(min_size_seps[0])
-        self.failUnless(len(s) != size for s in min_size_seps)
-        self.failUnless(sum(1 for s in min_st_seps if len(s) == size) ==
-                        len(min_size_seps))
-
-
-def suite():
-    is_separator_suite = unittest.makeSuite(IsSeparatorTests)
-    return unittest.TestSuite([is_separator_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/spectral.py igraph-0.6.5/interfaces/python/igraph/test/spectral.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/spectral.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/spectral.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-# vim:set ts=4 sw=4 sts=4 et:
-import unittest
-from igraph import *
-
-class SpectralTests(unittest.TestCase):
-    def assertAlmostEqualsMatrix(self, mat1, mat2, eps = 1e-7):
-        self.failUnless(all(
-            abs(obs-exp) < eps
-            for obs, exp in zip(sum(mat1, []), sum(mat2, []))
-        ))
-
-    def testLaplacian(self):
-        g=Graph.Full(3)
-        g.es["weight"] = [1, 2, 3]
-        self.failUnless(g.laplacian() == [[ 2, -1, -1],\
-                                          [-1,  2, -1],\
-                                          [-1, -1,  2]])
-        self.assertAlmostEqualsMatrix(g.laplacian(normalized=True),
-                [[1, -0.5, -0.5], [-0.5, 1, -0.5], [-0.5, -0.5, 1]])
-
-        mx0 = [[1., -1/(12**0.5), -2/(15**0.5)],
-              [-1/(12**0.5), 1., -3/(20**0.5)],
-              [-2/(15**0.5), -3/(20**0.5), 1.]]
-        self.assertAlmostEqualsMatrix(g.laplacian("weight", True), mx0)
-
-        g=Graph.Tree(5, 2)
-        g.add_vertices(1)
-        self.failUnless(g.laplacian() == [[ 2, -1, -1,  0,  0, 0],\
-                                          [-1,  3,  0, -1, -1, 0],\
-                                          [-1,  0,  1,  0,  0, 0],\
-                                          [ 0, -1,  0,  1,  0, 0],\
-                                          [ 0, -1,  0,  0,  1, 0],\
-                                          [ 0,  0,  0,  0,  0, 0]])
-        
-def suite():
-    spectral_suite = unittest.makeSuite(SpectralTests)
-    return unittest.TestSuite([spectral_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/structural.py igraph-0.6.5/interfaces/python/igraph/test/structural.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/structural.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/structural.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,505 +0,0 @@
-import unittest
-
-from igraph import *
-from igraph.compat import isnan
-
-class SimplePropertiesTests(unittest.TestCase):
-    gfull  = Graph.Full(10)
-    gempty = Graph(10)
-    g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)])
-    gdir = Graph(4, [(0, 1), (0, 2), (1, 2), (2, 1), (0, 3), (1, 3), (3, 0)], directed=True)
-    tree = Graph.Tree(14, 3)
-
-    def testDensity(self):
-        self.failUnless(self.gfull.density() == 1.0)
-        self.failUnless(self.gempty.density() == 0.0)
-        self.failUnless(self.g.density() == 5.0/6.0)
-        self.failUnless(self.g.density(True) == 5.0/8.0)
-        self.failUnless(self.gdir.density() == 7.0/12.0)
-        self.failUnless(self.gdir.density(True) == 7.0/16.0)
-        self.assertAlmostEquals(self.tree.density(), 1/7., places=5)
-        
-    def testDiameter(self):
-        self.failUnless(self.gfull.diameter() == 1)
-        self.failUnless(self.gempty.diameter(unconn=False) == 10)
-        self.failUnless(self.gempty.diameter(unconn=False, weights=[]) \
-                == float('inf'))
-        self.failUnless(self.g.diameter() == 2)
-        self.failUnless(self.gdir.diameter(False) == 2)
-        self.failUnless(self.gdir.diameter() == 3)
-        self.failUnless(self.tree.diameter() == 5)
-        
-        s, t, d = self.tree.farthest_points()
-        self.failUnless((s == 13 or t == 13) and d == 5)
-        self.failUnless(self.gempty.farthest_points(unconn=False) == (None, None, 10))
-        
-        d = self.tree.get_diameter()
-        self.failUnless(d[0] == 13 or d[-1] == 13)
-
-        weights = [1, 1, 1, 5, 1, 5, 1, 1, 1, 1, 1, 1, 5]
-        self.failUnless(self.tree.diameter(weights=weights) == 15)
-
-        d = self.tree.farthest_points(weights=weights)
-        self.failUnless(d == (13, 6, 15) or d == (6, 13, 15))
-
-    def testEccentricity(self):
-        self.assertEquals(self.gfull.eccentricity(),
-                [1] * self.gfull.vcount())
-        self.assertEquals(self.gempty.eccentricity(),
-                [0] * self.gempty.vcount())
-        self.assertEquals(self.g.eccentricity(), [1, 1, 2, 2])
-        self.assertEquals(self.gdir.eccentricity(),
-                [1, 2, 3, 2])
-        self.assertEquals(self.tree.eccentricity(),
-                [3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5])
-        self.assertEquals(Graph().eccentricity(), [])
-
-    def testRadius(self):
-        self.assertEquals(self.gfull.radius(), 1)
-        self.assertEquals(self.gempty.radius(), 0)
-        self.assertEquals(self.g.radius(), 1)
-        self.assertEquals(self.gdir.radius(), 1)
-        self.assertEquals(self.tree.radius(), 3)
-        self.assertTrue(isnan(Graph().radius()))
-
-    def testTransitivity(self):
-        self.failUnless(self.gfull.transitivity_undirected() == 1.0)
-        self.failUnless(self.tree.transitivity_undirected() == 0.0)
-        self.failUnless(self.g.transitivity_undirected() == 0.75)
-
-    def testLocalTransitivity(self):
-        self.failUnless(self.gfull.transitivity_local_undirected() ==
-                [1.0] * self.gfull.vcount())
-        self.failUnless(self.tree.transitivity_local_undirected(mode="zero") ==
-                [0.0] * self.tree.vcount())
-
-        l = self.g.transitivity_local_undirected(mode="zero")
-        self.assertAlmostEqual(l[0], 2/3., places=4)
-        self.assertAlmostEqual(l[1], 2/3., places=4)
-        self.assertEquals(l[2], 1)
-        self.assertEquals(l[3], 1)
-
-        g = Graph.Full(4) + 1 + [(0, 4)]
-        g.es["weight"] = [1, 1, 1, 1, 1, 1, 5]
-        self.assertAlmostEqual(
-                g.transitivity_local_undirected(0, weights="weight"),
-                0.25, places=4)
-
-    def testAvgLocalTransitivity(self):
-        self.failUnless(self.gfull.transitivity_avglocal_undirected() == 1.0)
-        self.failUnless(self.tree.transitivity_avglocal_undirected() == 0.0)
-        self.assertAlmostEqual(self.g.transitivity_avglocal_undirected(), 5/6., places=4)
-
-    def testModularity(self):
-        g = Graph.Full(5)+Graph.Full(5)
-        g.add_edges([(0,5)])
-        cl = [0]*5+[1]*5
-        self.assertAlmostEquals(g.modularity(cl), 0.4523, places=3)
-        ws = [1]*21
-        self.assertAlmostEquals(g.modularity(cl, ws), 0.4523, places=3)
-        ws = [2]*21
-        self.assertAlmostEquals(g.modularity(cl, ws), 0.4523, places=3)
-        ws = [2]*10+[1]*11
-        self.assertAlmostEquals(g.modularity(cl, ws), 0.4157, places=3)
-        self.assertRaises(InternalError, g.modularity, cl, ws[0:20])
-
-class DegreeTests(unittest.TestCase):
-    gfull  = Graph.Full(10)
-    gempty = Graph(10)
-    g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (0, 0)])
-    gdir = Graph(4, [(0, 1), (0, 2), (1, 2), (2, 1), (0, 3), (1, 3), (3, 0)], directed=True)
-    tree = Graph.Tree(10, 3)
-
-    def testKnn(self):
-        knn, knnk = self.gfull.knn()
-        self.failUnless(knn == [9.] * 10)
-        self.assertAlmostEquals(knnk[8], 9.0, places=6)
-
-        # knn works for simple graphs only -- self.g is not simple
-        self.assertRaises(InternalError, self.g.knn)
-
-        # Okay, simplify it and then go on
-        g = self.g.copy()
-        g.simplify()
-
-        knn, knnk = g.knn()
-        diff = max(abs(a-b) for a, b in zip(knn, [7/3., 7/3., 3, 3]))
-        self.assertAlmostEquals(diff, 0., places=6)
-        self.assertEquals(len(knnk), 3)
-        self.assertAlmostEquals(knnk[1], 3, places=6)
-        self.assertAlmostEquals(knnk[2], 7/3., places=6)
-
-    def testDegree(self):
-        self.failUnless(self.gfull.degree() == [9] * 10)
-        self.failUnless(self.gempty.degree() == [0] * 10)
-        self.failUnless(self.g.degree(loops=False) == [3, 3, 2, 2])
-        self.failUnless(self.g.degree() == [5, 3, 2, 2])
-        self.failUnless(self.gdir.degree(mode=IN) == [1, 2, 2, 2])
-        self.failUnless(self.gdir.degree(mode=OUT) == [3, 2, 1, 1])
-        self.failUnless(self.gdir.degree(mode=ALL) == [4, 4, 3, 3])
-        vs = self.gdir.vs.select(0, 2)
-        self.failUnless(self.gdir.degree(vs, mode=ALL) == [4, 3])
-        self.failUnless(self.gdir.degree(self.gdir.vs[1], mode=ALL) == 4)
-
-    def testMaxDegree(self):
-        self.failUnless(self.gfull.maxdegree() == 9)
-        self.failUnless(self.gempty.maxdegree() == 0)
-        self.failUnless(self.g.maxdegree() == 3)
-        self.failUnless(self.g.maxdegree(loops=True) == 5)
-        self.failUnless(self.g.maxdegree([1, 2], loops=True) == 3)
-        self.failUnless(self.gdir.maxdegree(mode=IN) == 2)
-        self.failUnless(self.gdir.maxdegree(mode=OUT) == 3)
-        self.failUnless(self.gdir.maxdegree(mode=ALL) == 4)
-        
-    def testStrength(self):
-        # Turn off warnings about calling strength without weights
-        import warnings
-        warnings.filterwarnings("ignore", "No edge weights for strength calculation", \
-                RuntimeWarning)
-
-        # No weights
-        self.failUnless(self.gfull.strength() == [9] * 10)
-        self.failUnless(self.gempty.strength() == [0] * 10)
-        self.failUnless(self.g.degree(loops=False) == [3, 3, 2, 2])
-        self.failUnless(self.g.degree() == [5, 3, 2, 2])
-        # With weights
-        ws = [1, 2, 3, 4, 5, 6]
-        self.failUnless(self.g.strength(weights=ws, loops=False) == \
-                [7, 9, 5, 9])
-        self.failUnless(self.g.strength(weights=ws) == [19, 9, 5, 9])
-        ws = [1, 2, 3, 4, 5, 6, 7]
-        self.failUnless(self.gdir.strength(mode=IN, weights=ws) == \
-                [7, 5, 5, 11])
-        self.failUnless(self.gdir.strength(mode=OUT, weights=ws) == \
-                [8, 9, 4, 7])
-        self.failUnless(self.gdir.strength(mode=ALL, weights=ws) == \
-                [15, 14, 9, 18])
-        vs = self.gdir.vs.select(0, 2)
-        self.failUnless(self.gdir.strength(vs, mode=ALL, weights=ws) == \
-                [15, 9])
-        self.failUnless(self.gdir.strength(self.gdir.vs[1], \
-                mode=ALL, weights=ws) == 14)
-
-        
-
-class LocalTransitivityTests(unittest.TestCase):
-    def testLocalTransitivityFull(self):
-        trans = Graph.Full(10).transitivity_local_undirected()
-        self.failUnless(trans == [1.0]*10)
-        
-    def testLocalTransitivityTree(self):
-        trans = Graph.Tree(10, 3).transitivity_local_undirected()
-        self.failUnless(trans[0:3] == [0.0, 0.0, 0.0])
-
-    def testLocalTransitivityHalf(self):
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)])
-        trans = g.transitivity_local_undirected()
-        trans = [round(x, 3) for x in trans]
-        self.failUnless(trans == [0.667, 0.667, 1.0, 1.0])
-
-    def testLocalTransitivityPartial(self):
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)])
-        trans = g.transitivity_local_undirected([1,2])
-        trans = [round(x, 3) for x in trans]
-        self.failUnless(trans == [0.667, 1.0])
-
-
-class BiconnectedComponentTests(unittest.TestCase):
-    g1 = Graph.Full(10)
-    g2 = Graph(5, [(0,1),(1,2),(2,3),(3,4)])
-    g3 = Graph(6, [(0,1),(1,2),(2,3),(3,0),(2,4),(2,5),(4,5)])
-
-    def testBiconnectedComponents(self):
-        s = self.g1.biconnected_components()
-        self.failUnless(len(s) == 1 and s[0]==range(10))
-        s, ap = self.g1.biconnected_components(True)
-        self.failUnless(len(s) == 1 and s[0]==range(10))
-
-        s = self.g3.biconnected_components()
-        self.failUnless(len(s) == 2 and s[0]==[2,4,5] and s[1]==[0,1,2,3])
-        s, ap = self.g3.biconnected_components(True)
-        self.failUnless(len(s) == 2 and s[0]==[2,4,5] and \
-          s[1]==[0,1,2,3] and ap == [2])
-
-    def testArticulationPoints(self):
-        self.failUnless(self.g1.articulation_points() == [])
-        self.failUnless(self.g2.cut_vertices() == [1,2,3])
-        self.failUnless(self.g3.articulation_points() == [2])
-
-
-class CentralityTests(unittest.TestCase):
-    def testBetweennessCentrality(self):
-        g = Graph.Star(5)
-        self.failUnless(g.betweenness() == [6., 0., 0., 0., 0.])
-        g = Graph(5, [(0, 1), (0, 2), (0, 3), (1, 4)])
-        self.failUnless(g.betweenness() == [5., 3., 0., 0., 0.])
-        self.failUnless(g.betweenness(cutoff=2) == [3., 1., 0., 0., 0.])
-        self.failUnless(g.betweenness(cutoff=1) == [0., 0., 0., 0., 0.])
-        g = Graph.Lattice([3, 3], circular=False)
-        self.failUnless(g.betweenness(cutoff=2) == [0.5, 2.0, 0.5, 2.0, 4.0, 2.0, 0.5, 2.0, 0.5])
-
-    def testEdgeBetweennessCentrality(self):
-        g = Graph.Star(5)
-        self.failUnless(g.edge_betweenness() == [4., 4., 4., 4.])
-        g = Graph(5, [(0, 1), (0, 2), (0, 3), (1, 4)])
-        self.failUnless(g.edge_betweenness() == [6., 4., 4., 4.])
-        self.failUnless(g.edge_betweenness(cutoff=2) == [4., 3., 3., 2.])
-        self.failUnless(g.edge_betweenness(cutoff=1) == [1., 1., 1., 1.])
-        g = Graph.Ring(5)
-        self.failUnless(g.edge_betweenness() == [3., 3., 3., 3., 3.])
-        self.failUnless(g.edge_betweenness(weights=[4, 1, 1, 1, 1]) == \
-                [0.5, 3.5, 5.5, 5.5, 3.5])
-
-    def testClosenessCentrality(self):
-        g = Graph.Star(5)
-        cl = g.closeness()
-        cl2 = [1., 0.57142, 0.57142, 0.57142, 0.57142]
-        for idx in xrange(g.vcount()):
-            self.assertAlmostEqual(cl[idx], cl2[idx], places=3)
-
-        g = Graph.Star(5)
-        cl = g.closeness(cutoff=1)
-        cl2 = [1., 0.25, 0.25, 0.25, 0.25]
-        for idx in xrange(g.vcount()):
-            self.assertAlmostEqual(cl[idx], cl2[idx], places=3)
-
-        weights = [1] * 4
-
-        g = Graph.Star(5)
-        cl = g.closeness(weights=weights)
-        cl2 = [1., 0.57142, 0.57142, 0.57142, 0.57142]
-        for idx in xrange(g.vcount()):
-            self.assertAlmostEqual(cl[idx], cl2[idx], places=3)
-
-        g = Graph.Star(5)
-        cl = g.closeness(cutoff=1, weights=weights)
-        cl2 = [1., 0.25, 0.25, 0.25, 0.25]
-        for idx in xrange(g.vcount()):
-            self.assertAlmostEqual(cl[idx], cl2[idx], places=3)
-
-    def testPageRank(self):
-        g = Graph.Star(11)
-        cent = g.pagerank()
-        self.failUnless(cent.index(max(cent)) == 0)
-        self.assertAlmostEquals(max(cent), 0.4668, places=3)
-
-    def testPersonalizedPageRank(self):
-        g = Graph.Star(11)
-        self.assertRaises(InternalError, g.personalized_pagerank, reset=[0]*11)
-        cent = g.personalized_pagerank(reset=[0,10]+[0]*9, damping=0.5)
-        self.failUnless(cent.index(max(cent)) == 1)
-        self.assertAlmostEquals(cent[0], 0.3333, places=3)
-        self.assertAlmostEquals(cent[1], 0.5166, places=3)
-        self.assertAlmostEquals(cent[2], 0.0166, places=3)
-        cent2 = g.personalized_pagerank(reset_vertices=g.vs[1], damping=0.5)
-        self.failUnless(max(abs(x-y) for x, y in zip(cent, cent2)) < 0.001)
-
-    def testEigenvectorCentrality(self):
-        g = Graph.Star(11)
-        cent = g.evcent()
-        self.failUnless(cent.index(max(cent)) == 0)
-        self.assertAlmostEquals(max(cent), 1.0, places=3)
-        self.failUnless(min(cent) >= 0)
-        cent, ev = g.evcent(scale=False, return_eigenvalue=True)
-        if cent[0]<0: cent = [-x for x in cent]
-        self.failUnless(cent.index(max(cent)) == 0)
-        self.assertAlmostEquals(cent[1]/cent[0], 0.3162, places=3)
-        self.assertAlmostEquals(ev, 3.162, places=3)
-
-    def testAuthorityScore(self):
-        g = Graph.Tree(15, 2, TREE_IN)
-        asc = g.authority_score()
-        self.assertAlmostEquals(max(asc), 1.0, places=3)
-        asc, ev = g.hub_score(scale=False, return_eigenvalue=True)
-        if asc[0]<0: hs = [-x for x in asc]
-
-    def testHubScore(self):
-        g = Graph.Tree(15, 2, TREE_IN)
-        hsc = g.hub_score()
-        self.assertAlmostEquals(max(hsc), 1.0, places=3)
-        hsc, ev = g.hub_score(scale=False, return_eigenvalue=True)
-        if hsc[0]<0: hsc = [-x for x in hsc]
-
-    def testCoreness(self):
-        g = Graph.Full(4) + Graph(4) + [(0,4), (1,5), (2,6), (3,7)]
-        self.assertEquals(g.coreness("A"), [3,3,3,3,1,1,1,1])
-
-
-class NeighborhoodTests(unittest.TestCase):
-    def testNeighborhood(self):
-        g = Graph.Ring(10, circular=False)
-        self.failUnless(map(sorted, g.neighborhood()) == \
-                [[0,1], [0,1,2], [1,2,3], [2,3,4], [3,4,5], [4,5,6], \
-                    [5,6,7], [6,7,8], [7,8,9], [8,9]])
-        self.failUnless(map(sorted, g.neighborhood(order=3)) == \
-                [[0,1,2,3], [0,1,2,3,4], [0,1,2,3,4,5], [0,1,2,3,4,5,6], \
-                    [1,2,3,4,5,6,7], [2,3,4,5,6,7,8], [3,4,5,6,7,8,9], \
-                    [4,5,6,7,8,9], [5,6,7,8,9], [6,7,8,9]])
-
-    def testNeighborhoodSize(self):
-        g = Graph.Ring(10, circular=False)
-        self.failUnless(g.neighborhood_size() == [2,3,3,3,3,3,3,3,3,2])
-        self.failUnless(g.neighborhood_size(order=3) == [4,5,6,7,7,7,7,6,5,4])
-
-
-class MiscTests(unittest.TestCase):
-    def testConstraint(self):
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)])
-        self.failUnless(isinstance(g.constraint(), list)) # TODO check more
-
-    def testTopologicalSorting(self):
-        g = Graph(5, [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)], directed=True)
-        self.failUnless(g.topological_sorting() == [0, 4, 1, 2, 3])
-        self.failUnless(g.topological_sorting(IN) == [3, 4, 2, 1, 0])
-        g.to_undirected()
-        self.assertRaises(InternalError, g.topological_sorting)
-
-    def testIsDAG(self):
-        g = Graph(5, [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)], directed=True)
-        self.failUnless(g.is_dag())
-        g.to_undirected()
-        self.failIf(g.is_dag())
-        g = Graph.Barabasi(1000, 2, directed=True)
-        self.failUnless(g.is_dag())
-        g = Graph.GRG(100, 0.2)
-        self.failIf(g.is_dag())
-        g = Graph.Ring(10, directed=True, mutual=False)
-        self.failIf(g.is_dag())
-
-    def testLineGraph(self):
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)])
-        el = g.linegraph().get_edgelist()
-        el.sort()
-        self.failUnless(el == [(0, 1), (0, 2), (0, 3), (0, 4), (1, 2), (1, 3), (2, 4), (3, 4)])
-
-        g = Graph(4, [(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)], directed=True)
-        el = g.linegraph().get_edgelist()
-        el.sort()
-        self.failUnless(el == [(0, 2), (0, 4)])
-
-
-class PathTests(unittest.TestCase):
-    def testShortestPaths(self):
-        g = Graph(10, [(0,1), (0,2), (0,3), (1,2), (1,4), (1,5), (2,3), (2,6), \
-            (3,2), (3,6), (4,5), (4,7), (5,6), (5,8), (5,9), (7,5), (7,8), \
-            (8,9), (5,2), (2,1)], directed=True)
-        ws = [0,2,1,0,5,2,1,1,0,2,2,8,1,1,3,1,1,4,2,1]
-        g.es["weight"] = ws
-        inf = float('inf')
-        expected = [
-          [0, 0, 0, 1, 5, 2, 1, 13, 3, 5],
-          [inf, 0, 0, 1, 5, 2, 1, 13, 3, 5],
-          [inf, 1, 0, 1, 6, 3, 1, 14, 4, 6],
-          [inf, 1, 0, 0, 6, 3, 1, 14, 4, 6],
-          [inf, 5, 4, 5, 0, 2, 3, 8, 3, 5],
-          [inf, 3, 2, 3, 8, 0, 1, 16, 1, 3],
-          [inf, inf, inf, inf, inf, inf, 0, inf, inf, inf],
-          [inf, 4, 3, 4, 9, 1, 2, 0, 1, 4],
-          [inf, inf, inf, inf, inf, inf, inf, inf, 0, 4],
-          [inf, inf, inf, inf, inf, inf, inf, inf, inf, 0]
-        ]
-        self.failUnless(g.shortest_paths(weights=ws) == expected)
-        self.failUnless(g.shortest_paths(weights="weight") == expected)
-        self.failUnless(g.shortest_paths(weights="weight", target=[2,3]) ==
-                [row[2:4] for row in expected])
-
-    def testGetShortestPaths(self):
-        g = Graph(4, [(0,1), (0,2), (1,3), (3,2), (2,1)], directed=True)
-        sps = g.get_shortest_paths(0)
-        expected = [[0], [0, 1], [0, 2], [0, 1, 3]]
-        self.failUnless(sps == expected)
-        sps = g.get_shortest_paths(0, output="vpath")
-        expected = [[0], [0, 1], [0, 2], [0, 1, 3]]
-        self.failUnless(sps == expected)
-        sps = g.get_shortest_paths(0, output="epath")
-        expected = [[], [0], [1], [0, 2]]
-        self.failUnless(sps == expected)
-        self.assertRaises(ValueError, g.get_shortest_paths, 0, output="x")
-
-    def testGetAllShortestPaths(self):
-        g = Graph(4, [(0,1), (1, 2), (1, 3), (2, 4), (3, 4), (4, 5)], directed=True)
-
-        sps = sorted(g.get_all_shortest_paths(0, 0))
-        expected = [[0]]
-        self.assertEquals(expected, sps)
-
-        sps = sorted(g.get_all_shortest_paths(0, 5))
-        expected = [[0, 1, 2, 4, 5], [0, 1, 3, 4, 5]]
-        self.assertEquals(expected, sps)
-
-        sps = sorted(g.get_all_shortest_paths(1, 4))
-        expected = [[1, 2, 4], [1, 3, 4]]
-        self.assertEquals(expected, sps)
-
-        g = Graph.Lattice([5, 5], circular=False)
-        
-        sps = sorted(g.get_all_shortest_paths(0, 12))
-        expected = [[0, 1, 2, 7, 12], [0, 1, 6, 7, 12], [0, 1, 6, 11, 12], \
-                    [0, 5, 6, 7, 12], [0, 5, 6, 11, 12], [0, 5, 10, 11, 12]]
-        self.assertEquals(expected, sps)
-
-        g = Graph.Lattice([100, 100], circular=False)
-        sps = sorted(g.get_all_shortest_paths(0, 202))
-        expected = [[0, 1, 2, 102, 202], [0, 1, 101, 102, 202], [0, 1, 101, 201, 202], \
-                    [0, 100, 101, 102, 202], [0, 100, 101, 201, 202], [0, 100, 200, 201, 202]]
-        self.assertEquals(expected, sps)
-
-        g = Graph.Lattice([100, 100], circular=False)
-        sps = sorted(g.get_all_shortest_paths(0, [0, 202]))
-        self.assertEquals([[0]] + expected, sps)
-
-        g = Graph([(0,1), (1,2), (0,2)])
-        g.es["weight"] = [0.5, 0.5, 1]
-        sps = sorted(g.get_all_shortest_paths(0, weights="weight"))
-        self.assertEquals([[0], [0,1], [0,1,2], [0,2]], sps)
-
-        g = Graph.Lattice([4, 4], circular=False)
-        g.es["weight"] = 1
-        g.es[2,8]["weight"] = 100
-        sps = sorted(g.get_all_shortest_paths(0, [3, 12, 15], weights="weight"))
-        self.assertEquals(20, len(sps))
-        self.assertEquals(4, sum(1 for path in sps if path[-1] == 3))
-        self.assertEquals(4, sum(1 for path in sps if path[-1] == 12))
-        self.assertEquals(12, sum(1 for path in sps if path[-1] == 15))
-
-
-    def testPathLengthHist(self):
-        g = Graph.Tree(15, 2)
-        h = g.path_length_hist()
-        self.failUnless(h.unconnected == 0L)
-        self.failUnless([(int(l),x) for l,_,x in h.bins()] == \
-          [(1,14),(2,19),(3,20),(4,20),(5,16),(6,16)])
-        g = Graph.Full(5)+Graph.Full(4)
-        h = g.path_length_hist()
-        self.failUnless(h.unconnected == 20)
-        g.to_directed()
-        h = g.path_length_hist()
-        self.failUnless(h.unconnected == 40)
-        h = g.path_length_hist(False)
-        self.failUnless(h.unconnected == 20)
-
-def suite():
-    simple_suite = unittest.makeSuite(SimplePropertiesTests)
-    degree_suite = unittest.makeSuite(DegreeTests)
-    local_transitivity_suite = unittest.makeSuite(LocalTransitivityTests)
-    biconnected_suite = unittest.makeSuite(BiconnectedComponentTests)
-    centrality_suite = unittest.makeSuite(CentralityTests)
-    neighborhood_suite = unittest.makeSuite(NeighborhoodTests)
-    path_suite = unittest.makeSuite(PathTests)
-    misc_suite = unittest.makeSuite(MiscTests)
-    return unittest.TestSuite([simple_suite,
-                               degree_suite,
-                               local_transitivity_suite,
-                               biconnected_suite,
-                               centrality_suite,
-                               neighborhood_suite,
-                               path_suite,
-                               misc_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/test/vertexseq.py igraph-0.6.5/interfaces/python/igraph/test/vertexseq.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/test/vertexseq.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/test/vertexseq.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,172 +0,0 @@
-# vim:ts=4 sw=4 sts=4:
-import unittest
-from igraph import *
-
-class VertexTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph.Full(10)
-
-    def testUpdateAttributes(self):
-        v = self.g.vs[0]
-
-        v.update_attributes(a=2)
-        self.assertEquals(v["a"], 2)
-
-        v.update_attributes([("a", 3), ("b", 4)], c=5, d=6)
-        self.assertEquals(v.attributes(), dict(a=3, b=4, c=5, d=6))
-
-        v.update_attributes(dict(b=44, c=55))
-        self.assertEquals(v.attributes(), dict(a=3, b=44, c=55, d=6))
-
-
-class VertexSeqTests(unittest.TestCase):
-    def setUp(self):
-        self.g = Graph.Full(10)
-        self.g.vs["test"] = range(10)
-        self.g.vs["name"] = list("ABCDEFGHIJ")
-    
-    def testCreation(self):
-        self.failUnless(len(VertexSeq(self.g)) == 10)
-        self.failUnless(len(VertexSeq(self.g, 2)) == 1)
-        self.failUnless(len(VertexSeq(self.g, [1,2,3])) == 3)
-        self.failUnless(VertexSeq(self.g, [1,2,3]).indices == [1,2,3])
-        self.assertRaises(ValueError, VertexSeq, self.g, 12)
-        self.assertRaises(ValueError, VertexSeq, self.g, [12])
-        self.failUnless(self.g.vs.graph == self.g)
-
-    def testPartialAttributeAssignment(self):
-        only_even = self.g.vs.select(lambda v: (v.index % 2 == 0))
-        only_even["test"] = [0]*len(only_even)
-        self.failUnless(self.g.vs["test"] == [0,1,0,3,0,5,0,7,0,9])
-        only_even["test2"] = range(5)
-        self.failUnless(self.g.vs["test2"] == [0,None,1,None,2,None,3,None,4,None])
-
-    def testSequenceReusing(self):
-        if "test" in self.g.vertex_attributes():
-            del self.g.vs["test"]
-
-        self.g.vs["test"] = ["A", "B", "C"]
-        self.failUnless(self.g.vs["test"] == ["A", "B", "C", "A", "B", "C", "A", "B", "C", "A"])
-        self.g.vs["test"] = "ABC"
-        self.failUnless(self.g.vs["test"] == ["ABC"] * 10)
-
-        only_even = self.g.vs.select(lambda v: (v.index % 2 == 0))
-        only_even["test"] = ["D", "E"]
-        self.failUnless(self.g.vs["test"] == ["D", "ABC", "E", "ABC", "D", "ABC", "E", "ABC", "D", "ABC"])
-        del self.g.vs["test"]
-        only_even["test"] = ["D", "E"]
-        self.failUnless(self.g.vs["test"] == ["D", None, "E", None, "D", None, "E", None, "D", None])
-
-
-
-    def testAllSequence(self):
-        self.failUnless(len(self.g.vs) == 10)
-        self.failUnless(self.g.vs["test"] == range(10))
-
-    def testEmptySequence(self):
-        empty_vs = self.g.vs.select(None)
-        self.failUnless(len(empty_vs) == 0)
-        self.assertRaises(IndexError, empty_vs.__getitem__, 0)
-        self.assertRaises(KeyError, empty_vs.__getitem__, "nonexistent")
-        self.failUnless(empty_vs["test"] == [])
-        empty_vs = self.g.vs[[]]
-        self.failUnless(len(empty_vs) == 0)
-        empty_vs = self.g.vs[()]
-        self.failUnless(len(empty_vs) == 0)
-
-    def testCallableFilteringFind(self):
-        vertex = self.g.vs.find(lambda v: (v.index % 2 == 1))
-        self.failUnless(vertex.index == 1)
-        self.assertRaises(IndexError, self.g.vs.find, lambda v: (v.index % 2 == 3))
-
-    def testCallableFilteringSelect(self):
-        only_even = self.g.vs.select(lambda v: (v.index % 2 == 0))
-        self.failUnless(len(only_even) == 5)
-        self.assertRaises(KeyError, only_even.__getitem__, "nonexistent")
-        self.failUnless(only_even["test"] == [0, 2, 4, 6, 8])
-
-    def testChainedCallableFilteringSelect(self):
-        only_div_six = self.g.vs.select(lambda v: (v.index % 2 == 0),
-          lambda v: (v.index % 3 == 0))
-        self.failUnless(len(only_div_six) == 2)
-        self.failUnless(only_div_six["test"] == [0, 6])
-
-        only_div_six = self.g.vs.select(lambda v: (v.index % 2 == 0)).select(\
-          lambda v: (v.index % 3 == 0))
-        self.failUnless(len(only_div_six) == 2)
-        self.failUnless(only_div_six["test"] == [0, 6])
-
-    def testIntegerFilteringFind(self):
-        self.assertEquals(self.g.vs.find(3).index, 3)
-        self.assertEquals(self.g.vs.select(2,3,4,2).find(3).index, 2)
-        self.assertRaises(IndexError, self.g.vs.find, 17)
-
-    def testIntegerFilteringSelect(self):
-        subset = self.g.vs.select(2,3,4,2)
-        self.assertEquals(len(subset), 4)
-        self.assertEquals(subset["test"], [2,3,4,2])
-        self.assertRaises(TypeError, self.g.vs.select, 2, 3, 4, 2, None)
-
-        subset = self.g.vs[2,3,4,2]
-        self.failUnless(len(subset) == 4)
-        self.failUnless(subset["test"] == [2,3,4,2])
-
-    def testStringFilteringFind(self):
-        self.assertEquals(self.g.vs.find("D").index, 3)
-        self.assertEquals(self.g.vs.select(2,3,4,2).find("C").index, 2)
-        self.assertRaises(ValueError, self.g.vs.select(2,3,4,2).find, "F")
-        self.assertRaises(ValueError, self.g.vs.find, "NoSuchName")
-
-    def testIterableFilteringSelect(self):
-        subset = self.g.vs.select(xrange(5,8))
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [5,6,7])
-
-    def testSliceFilteringSelect(self):
-        subset = self.g.vs.select(slice(5, 8))
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [5,6,7])
-        subset = self.g.vs[5:16:2]
-        self.failUnless(len(subset) == 3)
-        self.failUnless(subset["test"] == [5,7,9])
-
-    def testKeywordFilteringSelect(self):
-        g = Graph.Barabasi(10000)
-        g.vs["degree"] = g.degree()
-        g.vs["parity"] = [i % 2 for i in xrange(g.vcount())]
-        l = len(g.vs(degree_gt=30))
-        self.failUnless(l < 1000)
-        self.failUnless(len(g.vs(degree_gt=30, parity=0)) <= 500)
-        del g.vs["degree"]
-        self.failUnless(len(g.vs(_degree_gt=30)) == l)
-
-    def testIndexOutOfBoundsSelect(self):
-        g = Graph.Full(3)
-        self.assertRaises(ValueError, g.vs.select, 4)
-        self.assertRaises(ValueError, g.vs.select, 4, 5)
-        self.assertRaises(ValueError, g.vs.select, (4, 5))
-        self.assertRaises(ValueError, g.vs.select, 2, -1)
-        self.assertRaises(ValueError, g.vs.select, (2, -1))
-        self.assertRaises(ValueError, g.vs.__getitem__, (0, 1000000))
- 
-    def testGraphMethodProxying(self):
-        g = Graph.Barabasi(100)
-        vs = g.vs(1,3,5,7,9)
-        self.assertEquals(vs.degree(), g.degree(vs))
-        self.assertEquals(g.degree(vs), g.degree(vs.indices))
-        for v, d in zip(vs, vs.degree()):
-            self.assertEquals(v.degree(), d)
-
-
-def suite():
-    vertex_suite = unittest.makeSuite(VertexTests)
-    vs_suite = unittest.makeSuite(VertexSeqTests)
-    return unittest.TestSuite([vertex_suite, vs_suite])
-
-def test():
-    runner = unittest.TextTestRunner()
-    runner.run(suite())
-    
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/utils.py igraph-0.6.5/interfaces/python/igraph/utils.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/utils.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/utils.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,372 +0,0 @@
-# vim:ts=4:sw=4:sts=4:et
-# -*- coding: utf-8 -*-
-"""Utility functions that cannot be categorised anywhere else"""
-
-from contextlib import contextmanager
-from collections import Mapping, MutableMapping
-from itertools import chain
-
-import os
-import tempfile
-
-__all__ = ["dbl_epsilon", "multidict", "named_temporary_file", "rescale", \
-        "safemin", "safemax"]
-__docformat__ = "restructuredtext en"
-__license__ = u"""\
-Copyright (C) 2006-2012  Tamás Nepusz <ntamas@gmail.com>
-Pázmány Péter sétány 1/a, 1117 Budapest, Hungary
-
-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 2 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, write to the Free Software
-Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-02110-1301 USA
-"""
-
-@contextmanager
-def named_temporary_file(*args, **kwds):
-    """Context manager that creates a named temporary file and
-    returns its name.
-
-    All parameters are passed on to ``tempfile.mkstemp``, see
-    its documentation for more info.
-    """
-    handle, tmpfile = tempfile.mkstemp(*args, **kwds)
-    os.close(handle)
-    try:
-        yield tmpfile
-    finally:
-        os.unlink(tmpfile)
-
-def rescale(values, out_range = (0., 1.), in_range = None, clamp = False,
-        scale = None):
-    """Rescales a list of numbers into a given range.
-
-    `out_range` gives the range of the output values; by default, the minimum
-    of the original numbers in the list will be mapped to the first element
-    in the output range and the maximum will be mapped to the second element.
-    Elements between the minimum and maximum values in the input list will be
-    interpolated linearly between the first and second values of the output
-    range.
-
-    `in_range` may be used to override which numbers are mapped to the first
-    and second values of the output range. This must also be a tuple, where
-    the first element will be mapped to the first element of the output range
-    and the second element to the second.
-
-    If `clamp` is ``True``, elements which are outside the given `out_range`
-    after rescaling are clamped to the output range to ensure that no number
-    will be outside `out_range` in the result.
-
-    If `scale` is not ``None``, it will be called for every element of `values`
-    and the rescaling will take place on the results instead. This can be used,
-    for instance, to transform the logarithm of the original values instead of
-    the actual values. A typical use-case is to map a range of values to color
-    identifiers on a logarithmic scale. Scaling also applies to the `in_range`
-    parameter if present.
-
-    Examples:
-        
-        >>> rescale(range(5), (0, 8))
-        [0.0, 2.0, 4.0, 6.0, 8.0]
-        >>> rescale(range(5), (2, 10))
-        [2.0, 4.0, 6.0, 8.0, 10.0]
-        >>> rescale(range(5), (0, 4), (1, 3))
-        [-2.0, 0.0, 2.0, 4.0, 6.0]
-        >>> rescale(range(5), (0, 4), (1, 3), clamp=True)
-        [0.0, 0.0, 2.0, 4.0, 4.0]
-        >>> rescale([0]*5, (1, 3))
-        [2.0, 2.0, 2.0, 2.0, 2.0]
-        >>> from math import log10
-        >>> rescale([1, 10, 100, 1000, 10000], (0, 8), scale=log10)
-        [0.0, 2.0, 4.0, 6.0, 8.0]
-        >>> rescale([1, 10, 100, 1000, 10000], (0, 4), (10, 1000), scale=log10)
-        [-2.0, 0.0, 2.0, 4.0, 6.0]
-    """
-    if scale is not None:
-        values = [scale(value) for value in values]
-
-    if in_range is None:
-        mi, ma = min(values), max(values)
-    else:
-        mi, ma = in_range
-        if scale is not None:
-            mi, ma = scale(mi), scale(ma)
-
-    ratio = float(ma - mi)
-    if not ratio:
-        return [(out_range[0] + out_range[1]) / 2.] * len(values)
-
-    min_out, max_out = map(float, out_range)
-    ratio = (max_out - min_out) / ratio
-    result = [(x - mi) * ratio + min_out for x in values]
-
-    if clamp:
-        return [max(min(x, max_out), min_out) for x in result]
-    else:
-        return result
-
-def str_to_orientation(value, reversed_horizontal=False, reversed_vertical=False):
-    """Tries to interpret a string as an orientation value.
-
-    The following basic values are understood: ``left-right``, ``bottom-top``,
-    ``right-left``, ``top-bottom``. Possible aliases are:
-    
-      - ``horizontal``, ``horiz``, ``h`` and ``lr`` for ``left-right``
-
-      - ``vertical``, ``vert``, ``v`` and ``tb`` for top-bottom.
-
-      - ``lr`` for ``left-right``.
-
-      - ``rl`` for ``right-left``.
-
-    ``reversed_horizontal`` reverses the meaning of ``horizontal``, ``horiz``
-    and ``h`` to ``rl`` (instead of ``lr``); similarly, ``reversed_vertical``
-    reverses the meaning of ``vertical``, ``vert`` and ``v`` to ``bt``
-    (instead of ``tb``).
-
-    Returns one of ``lr``, ``rl``, ``tb`` or ``bt``, or throws ``ValueError``
-    if the string cannot be interpreted as an orientation.
-    """
-
-    aliases = {"left-right": "lr", "right-left": "rl", "top-bottom": "tb",
-            "bottom-top": "bt", "top-down": "tb", "bottom-up": "bt",
-            "top-bottom": "tb", "bottom-top": "bt", "td": "tb", "bu": "bt"}
-
-    dir = ["lr", "rl"][reversed_horizontal]
-    aliases.update(horizontal=dir, horiz=dir, h=dir)
-
-    dir = ["tb", "bt"][reversed_vertical]
-    aliases.update(vertical=dir, vert=dir, v=dir)
-
-    result = aliases.get(value, value)
-    if result not in ("lr", "rl", "tb", "bt"):
-        raise ValueError("unknown orientation: %s" % result)
-    return result
-
-
-def consecutive_pairs(iterable, circular=False):
-    """Returns consecutive pairs of items from the given iterable.
-
-    When `circular` is ``True``, the pair consisting of the last
-    and first elements is also returned.
-
-    Example:
-        
-        >>> list(consecutive_pairs(range(5)))
-        [(0, 1), (1, 2), (2, 3), (3, 4)]
-        >>> list(consecutive_pairs(range(5), circular=True))
-        [(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)]
-        >>> list(consecutive_pairs([]))
-        []
-        >>> list(consecutive_pairs([], circular=True))
-        []
-        >>> list(consecutive_pairs([0]))
-        []
-        >>> list(consecutive_pairs([0], circular=True))
-        [(0, 0)]
-    """
-    it = iter(iterable)
-
-    try:
-        prev = it.next()
-    except StopIteration:
-        return
-    first = prev
-
-    for item in it:
-        yield prev, item
-        prev = item
-
-    if circular:
-        try:
-            yield item, first
-        except UnboundLocalError:
-            yield first, first
-
-class multidict(MutableMapping):
-    """A dictionary-like object that is customized to deal with multiple
-    values for the same key.
-
-    Each value in this dictionary will be a list. Methods which emulate
-    the methods of a standard Python `dict` object will return or manipulate
-    the first items of the lists only. Special methods are provided to
-    deal with keys having multiple values.
-    """
-
-    def __init__(self, *args, **kwds):
-        self._dict = {}
-        if len(args) > 1:
-            raise ValueError("%r expected at most 1 argument, got %d" % \
-                    (self.__class__.__name__, len(args)))
-        if args:
-            args = args[0]
-            self.update(args)
-        self.update(kwds)
-
-    def __contains__(self, key):
-        """Returns whether there are any items associated to the given `key`."""
-        try:
-            return len(self._dict[key]) > 0
-        except KeyError:
-            return False
-
-    def __delitem__(self, key):
-        """Removes all the items associated to the given `key`."""
-        del self._dict[key]
-
-    def __getitem__(self, key):
-        """Returns an arbitrary item associated to the given key. Raises ``KeyError``
-        if no such key exists.
-
-        Example:
-
-            >>> d = multidict([("spam", "eggs"), ("spam", "bacon")])
-            >>> d["spam"]
-            'eggs'
-        """
-        try:
-            return self._dict[key][0]
-        except IndexError:
-            raise KeyError(key)
-
-    def __iter__(self):
-        """Iterates over the keys of the multidict."""
-        return iter(self._dict)
-
-    def __len__(self):
-        """Returns the number of distinct keys in this multidict."""
-        return len(self._dict)
-
-    def __setitem__(self, key, value):
-        """Sets the item associated to the given `key`. Any values associated to the
-        key will be erased and replaced by `value`.
-        
-        Example:
-
-           >>> d = multidict([("spam", "eggs"), ("spam", "bacon")])
-           >>> d["spam"] = "ham"
-           >>> d["spam"]
-           'ham'
-        """
-        self._dict[key] = [value]
-
-    def add(self, key, value):
-        """Adds `value` to the list of items associated to `key`.
-
-        Example:
-
-            >>> d = multidict()
-            >>> d.add("spam", "ham")
-            >>> d["spam"]
-            'ham'
-            >>> d.add("spam", "eggs")
-            >>> d.getlist("spam")
-            ['ham', 'eggs']
-        """
-        try:
-            self._dict[key].append(value)
-        except KeyError:
-            self._dict[key] = [value]
-
-    def clear(self):
-        """Removes all the items from the multidict."""
-        self._dict.clear()
-
-    def get(self, key, default=None):
-        """Returns an arbitrary item associated to the given `key`. If `key`
-        does not exist or has zero associated items, `default` will be
-        returned."""
-        try:
-            items = self._dict[key]
-            return items[0]
-        except (KeyError, IndexError):
-            return default
-
-    def getlist(self, key):
-        """Returns the list of values for the given `key`. An empty list will
-        be returned if there is no such key."""
-        try:
-            return self._dict[key]
-        except KeyError:
-            return []
-
-    def iterlists(self):
-        """Iterates over ``(key, values)`` pairs where ``values`` is the list
-        of values associated with ``key``."""
-        return self._dict.iteritems()
-
-    def lists(self):
-        """Returns a list of ``(key, values)`` pairs where ``values`` is the list
-        of values associated with ``key``."""
-        return self._dict.items()
-
-    def update(self, arg, **kwds):
-        if hasattr(arg, "keys") and callable(arg.keys):
-            for key in arg.keys():
-                self.add(key, arg[key])
-        else:
-            for key, value in arg:
-                self.add(key, value)
-        for key, value in kwds.iteritems():
-            self.add(key, value)
-
-def safemax(iterable, default=0):
-    """Safer variant of ``max()`` that returns a default value if the iterable
-    is empty.
-    
-    Example:
-        
-        >>> safemax([-5, 6, 4])
-        6
-        >>> safemax([])
-        0
-        >>> safemax((), 2)
-        2
-    """
-    it = iter(iterable)
-    try:
-        first = it.next()
-    except StopIteration:
-        return default
-    else:
-        return max(chain([first], it))
-
-def safemin(iterable, default=0):
-    """Safer variant of ``min()`` that returns a default value if the iterable
-    is empty.
-    
-    Example:
-        
-        >>> safemin([-5, 6, 4])
-        -5
-        >>> safemin([])
-        0
-        >>> safemin((), 2)
-        2
-    """
-    it = iter(iterable)
-    try:
-        first = it.next()
-    except StopIteration:
-        return default
-    else:
-        return min(chain([first], it))
-
-def dbl_epsilon():
-    """Approximates the machine epsilon value for doubles."""
-    epsilon = 1.0
-    while 1.0 + epsilon / 2.0 != 1.0:
-        epsilon /= 2
-    return epsilon
-
-dbl_epsilon = dbl_epsilon()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/vendor/__init__.py igraph-0.6.5/interfaces/python/igraph/vendor/__init__.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/vendor/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/vendor/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-"""
-This package contains third party libraries that igraph depends on and that
-are small enough to be distributed with igraph itself.
-
-The primary entry point of this module is ``vendor_import``, a function that
-first tries to import a particular library using the standard Python mechanism
-and falls back to the version of the library provided within ``igraph.vendor``
-if the standard Python import fails.
-
-The libraries contained within igraph are as follows:
-
-	- `texttable`, a library to print ASCII tables, by Gerome Fournier.
-	  See <http://foutaise.org/code/>.
-"""
-
-__license__ = "GPL"
-
-__all__ = ["vendor_import"]
-__docformat__ = "restructuredtext en"
-
-def vendor_import(module_name):
-	"""Tries to import a module name ``module_name`` using the standard Python
-	`import` statement and return the imported module. If the import fails,
-	tries to import a module of the same name from within ``igraph.vendor``
-	and return that module instead.
-	"""
-
-	parts = module_name.split(".")
-
-	try:
-		result = __import__(module_name, level=0)
-	except ImportError:
-		result = __import__("igraph.vendor.%s" % module_name, level=0)
-		parts[0:0] = ["igraph", "vendor"]
-
-	parts.pop(0)
-	while parts:
-		result = getattr(result, parts.pop(0))
-
-	return result
diff -Nru igraph-0.6.5~quantal1/interfaces/python/igraph/vendor/texttable.py igraph-0.6.5/interfaces/python/igraph/vendor/texttable.py
--- igraph-0.6.5~quantal1/interfaces/python/igraph/vendor/texttable.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/igraph/vendor/texttable.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,586 +0,0 @@
-#!/usr/bin/env python
-#
-# texttable - module for creating simple ASCII tables
-# Copyright (C) 2003-2011 Gerome Fournier <jef(at)foutaise.org>
-#
-# This library is free software; you can redistribute it and/or
-# modify it under the terms of the GNU Lesser General Public
-# License as published by the Free Software Foundation; either
-# version 2.1 of the License, or (at your option) any later version.
-#
-# This library 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
-# Lesser General Public License for more details.
-#
-# You should have received a copy of the GNU Lesser General Public
-# License along with this library; if not, write to the Free Software
-# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
-
-"""module for creating simple ASCII tables
-
-
-Example:
-
-    table = Texttable()
-    table.set_cols_align(["l", "r", "c"])
-    table.set_cols_valign(["t", "m", "b"])
-    table.add_rows([ ["Name", "Age", "Nickname"], 
-                     ["Mr\\nXavier\\nHuon", 32, "Xav'"],
-                     ["Mr\\nBaptiste\\nClement", 1, "Baby"] ])
-    print table.draw() + "\\n"
-
-    table = Texttable()
-    table.set_deco(Texttable.HEADER)
-    table.set_cols_dtype(['t',  # text 
-                          'f',  # float (decimal)
-                          'e',  # float (exponent)
-                          'i',  # integer
-                          'a']) # automatic
-    table.set_cols_align(["l", "r", "r", "r", "l"])
-    table.add_rows([["text",    "float", "exp", "int", "auto"],
-                    ["abcd",    "67",    654,   89,    128.001],
-                    ["efghijk", 67.5434, .654,  89.6,  12800000000000000000000.00023],
-                    ["lmn",     5e-78,   5e-78, 89.4,  .000000000000128],
-                    ["opqrstu", .023,    5e+78, 92.,   12800000000000000000000]])
-    print table.draw()
-
-Result:
-
-    +----------+-----+----------+
-    |   Name   | Age | Nickname |
-    +==========+=====+==========+
-    | Mr       |     |          |
-    | Xavier   |  32 |          |
-    | Huon     |     |   Xav'   |
-    +----------+-----+----------+
-    | Mr       |     |          |
-    | Baptiste |   1 |          |
-    | Clement  |     |   Baby   |
-    +----------+-----+----------+
-
-    text   float       exp      int     auto
-    ===========================================
-    abcd   67.000   6.540e+02   89    128.001
-    efgh   67.543   6.540e-01   90    1.280e+22
-    ijkl   0.000    5.000e-78   89    0.000
-    mnop   0.023    5.000e+78   92    1.280e+22
-"""
-
-__all__ = ["Texttable", "ArraySizeError"]
-
-__author__ = 'Gerome Fournier <jef(at)foutaise.org>'
-__license__ = 'GPL'
-__version__ = '0.8.1'
-__credits__ = """\
-Jeff Kowalczyk:
-    - textwrap improved import
-    - comment concerning header output
-
-Anonymous:
-    - add_rows method, for adding rows in one go
-
-Sergey Simonenko:
-    - redefined len() function to deal with non-ASCII characters
-
-Roger Lew:
-    - columns datatype specifications
-
-Brian Peterson:
-    - better handling of unicode errors
-"""
-
-import sys
-import string
-
-try:
-    if sys.version >= '2.3':
-        import textwrap
-    elif sys.version >= '2.2':
-        from optparse import textwrap
-    else:
-        from optik import textwrap
-except ImportError:
-    sys.stderr.write("Can't import textwrap module!\n")
-    raise
-
-def len(iterable):
-    """Redefining len here so it will be able to work with non-ASCII characters
-    """
-    if not isinstance(iterable, str):
-        return iterable.__len__()
-    
-    try:
-        return len(unicode(iterable, 'utf'))
-    except:
-        return iterable.__len__()
-
-class ArraySizeError(Exception):
-    """Exception raised when specified rows don't fit the required size
-    """
-
-    def __init__(self, msg):
-        self.msg = msg
-        Exception.__init__(self, msg, '')
-
-    def __str__(self):
-        return self.msg
-
-class Texttable:
-
-    BORDER = 1
-    HEADER = 1 << 1
-    HLINES = 1 << 2
-    VLINES = 1 << 3
-
-    def __init__(self, max_width=80):
-        """Constructor
-
-        - max_width is an integer, specifying the maximum width of the table
-        - if set to 0, size is unlimited, therefore cells won't be wrapped
-        """
-
-        if max_width <= 0:
-            max_width = False
-        self._max_width = max_width
-        self._precision = 3
-
-        self._deco = Texttable.VLINES | Texttable.HLINES | Texttable.BORDER | \
-            Texttable.HEADER
-        self.set_chars(['-', '|', '+', '='])
-        self.reset()
-
-    def reset(self):
-        """Reset the instance
-
-        - reset rows and header
-        """
-
-        self._hline_string = None
-        self._row_size = None
-        self._header = []
-        self._rows = []
-
-    def set_chars(self, array):
-        """Set the characters used to draw lines between rows and columns
-
-        - the array should contain 4 fields:
-
-            [horizontal, vertical, corner, header]
-
-        - default is set to:
-
-            ['-', '|', '+', '=']
-        """
-
-        if len(array) != 4:
-            raise ArraySizeError, "array should contain 4 characters"
-        array = [ x[:1] for x in [ str(s) for s in array ] ]
-        (self._char_horiz, self._char_vert,
-            self._char_corner, self._char_header) = array
-
-    def set_deco(self, deco):
-        """Set the table decoration
-
-        - 'deco' can be a combinaison of:
-
-            Texttable.BORDER: Border around the table
-            Texttable.HEADER: Horizontal line below the header
-            Texttable.HLINES: Horizontal lines between rows
-            Texttable.VLINES: Vertical lines between columns
-
-           All of them are enabled by default
-
-        - example:
-
-            Texttable.BORDER | Texttable.HEADER
-        """
-
-        self._deco = deco
-
-    def set_cols_align(self, array):
-        """Set the desired columns alignment
-
-        - the elements of the array should be either "l", "c" or "r":
-
-            * "l": column flushed left
-            * "c": column centered
-            * "r": column flushed right
-        """
-
-        self._check_row_size(array)
-        self._align = array
-
-    def set_cols_valign(self, array):
-        """Set the desired columns vertical alignment
-
-        - the elements of the array should be either "t", "m" or "b":
-
-            * "t": column aligned on the top of the cell
-            * "m": column aligned on the middle of the cell
-            * "b": column aligned on the bottom of the cell
-        """
-
-        self._check_row_size(array)
-        self._valign = array
-
-    def set_cols_dtype(self, array):
-        """Set the desired columns datatype for the cols.
-
-        - the elements of the array should be either "a", "t", "f", "e" or "i":
-
-            * "a": automatic (try to use the most appropriate datatype)
-            * "t": treat as text
-            * "f": treat as float in decimal format
-            * "e": treat as float in exponential format
-            * "i": treat as int
-
-        - by default, automatic datatyping is used for each column
-        """
-
-        self._check_row_size(array)
-        self._dtype = array
-
-    def set_cols_width(self, array):
-        """Set the desired columns width
-
-        - the elements of the array should be integers, specifying the
-          width of each column. For example:
-
-                [10, 20, 5]
-        """
-
-        self._check_row_size(array)
-        try:
-            array = map(int, array)
-            if reduce(min, array) <= 0:
-                raise ValueError
-        except ValueError:
-            sys.stderr.write("Wrong argument in column width specification\n")
-            raise
-        self._width = array
-
-    def set_precision(self, width):
-        """Set the desired precision for float/exponential formats
-
-        - width must be an integer >= 0
-
-        - default value is set to 3
-        """
-
-        if not type(width) is int or width < 0:
-            raise ValueError('width must be an integer greater then 0')
-        self._precision = width
-
-    def header(self, array):
-        """Specify the header of the table
-        """
-
-        self._check_row_size(array)
-        self._header = map(str, array)
-
-    def add_row(self, array):
-        """Add a row in the rows stack
-
-        - cells can contain newlines and tabs
-        """
-
-        self._check_row_size(array)
-
-        if not hasattr(self, "_dtype"):
-            self._dtype = ["a"] * self._row_size
-            
-        cells = []
-        for i,x in enumerate(array):
-            cells.append(self._str(i,x))
-        self._rows.append(cells)
-
-    def add_rows(self, rows, header=True):
-        """Add several rows in the rows stack
-
-        - The 'rows' argument can be either an iterator returning arrays,
-          or a by-dimensional array
-        - 'header' specifies if the first row should be used as the header
-          of the table
-        """
-
-        # nb: don't use 'iter' on by-dimensional arrays, to get a 
-        #     usable code for python 2.1
-        if header:
-            if hasattr(rows, '__iter__') and hasattr(rows, 'next'):
-                self.header(rows.next())
-            else:
-                self.header(rows[0])
-                rows = rows[1:]
-        for row in rows:
-            self.add_row(row)
-
-    def draw(self):
-        """Draw the table
-
-        - the table is returned as a whole string
-        """
-
-        if not self._header and not self._rows:
-            return
-        self._compute_cols_width()
-        self._check_align()
-        out = ""
-        if self._has_border():
-            out += self._hline()
-        if self._header:
-            out += self._draw_line(self._header, isheader=True)
-            if self._has_header():
-                out += self._hline_header()
-        length = 0
-        for row in self._rows:
-            length += 1
-            out += self._draw_line(row)
-            if self._has_hlines() and length < len(self._rows):
-                out += self._hline()
-        if self._has_border():
-            out += self._hline()
-        return out[:-1]
-
-    def _str(self, i, x):
-        """Handles string formatting of cell data
-
-            i - index of the cell datatype in self._dtype 
-            x - cell data to format
-        """
-        try:
-            f = float(x)
-        except:
-            return str(x)
-
-        n = self._precision
-        dtype = self._dtype[i]
-
-        if dtype == 'i':
-            return str(int(round(f)))
-        elif dtype == 'f':
-            return '%.*f' % (n, f)
-        elif dtype == 'e':
-            return '%.*e' % (n, f)
-        elif dtype == 't':
-            return str(x)
-        else:
-            if f - round(f) == 0:
-                if abs(f) > 1e8:
-                    return '%.*e' % (n, f)
-                else:
-                    return str(int(round(f)))
-            else:
-                if abs(f) > 1e8:
-                    return '%.*e' % (n, f)
-                else:
-                    return '%.*f' % (n, f)
-
-    def _check_row_size(self, array):
-        """Check that the specified array fits the previous rows size
-        """
-
-        if not self._row_size:
-            self._row_size = len(array)
-        elif self._row_size != len(array):
-            raise ArraySizeError, "array should contain %d elements" \
-                % self._row_size
-
-    def _has_vlines(self):
-        """Return a boolean, if vlines are required or not
-        """
-
-        return self._deco & Texttable.VLINES > 0
-
-    def _has_hlines(self):
-        """Return a boolean, if hlines are required or not
-        """
-
-        return self._deco & Texttable.HLINES > 0
-
-    def _has_border(self):
-        """Return a boolean, if border is required or not
-        """
-
-        return self._deco & Texttable.BORDER > 0
-
-    def _has_header(self):
-        """Return a boolean, if header line is required or not
-        """
-
-        return self._deco & Texttable.HEADER > 0
-
-    def _hline_header(self):
-        """Print header's horizontal line
-        """
-
-        return self._build_hline(True)
-
-    def _hline(self):
-        """Print an horizontal line
-        """
-
-        if not self._hline_string:
-            self._hline_string = self._build_hline()
-        return self._hline_string
-
-    def _build_hline(self, is_header=False):
-        """Return a string used to separated rows or separate header from
-        rows
-        """
-        horiz = self._char_horiz
-        if (is_header):
-            horiz = self._char_header
-        # compute cell separator
-        s = "%s%s%s" % (horiz, [horiz, self._char_corner][self._has_vlines()],
-            horiz)
-        # build the line
-        l = string.join([horiz * n for n in self._width], s)
-        # add border if needed
-        if self._has_border():
-            l = "%s%s%s%s%s\n" % (self._char_corner, horiz, l, horiz,
-                self._char_corner)
-        else:
-            l += "\n"
-        return l
-
-    def _len_cell(self, cell):
-        """Return the width of the cell
-
-        Special characters are taken into account to return the width of the
-        cell, such like newlines and tabs
-        """
-
-        cell_lines = cell.split('\n')
-        maxi = 0
-        for line in cell_lines:
-            length = 0
-            parts = line.split('\t')
-            for part, i in zip(parts, range(1, len(parts) + 1)):
-                length = length + len(part)
-                if i < len(parts):
-                    length = (length/8 + 1) * 8
-            maxi = max(maxi, length)
-        return maxi
-
-    def _compute_cols_width(self):
-        """Return an array with the width of each column
-
-        If a specific width has been specified, exit. If the total of the
-        columns width exceed the table desired width, another width will be
-        computed to fit, and cells will be wrapped.
-        """
-
-        if hasattr(self, "_width"):
-            return
-        maxi = []
-        if self._header:
-            maxi = [ self._len_cell(x) for x in self._header ]
-        for row in self._rows:
-            for cell,i in zip(row, range(len(row))):
-                try:
-                    maxi[i] = max(maxi[i], self._len_cell(cell))
-                except (TypeError, IndexError):
-                    maxi.append(self._len_cell(cell))
-        items = len(maxi)
-        length = reduce(lambda x,y: x+y, maxi)
-        if self._max_width and length + items * 3 + 1 > self._max_width:
-            maxi = [(self._max_width - items * 3 -1) / items \
-                for n in range(items)]
-        self._width = maxi
-
-    def _check_align(self):
-        """Check if alignment has been specified, set default one if not
-        """
-
-        if not hasattr(self, "_align"):
-            self._align = ["l"] * self._row_size
-        if not hasattr(self, "_valign"):
-            self._valign = ["t"] * self._row_size
-
-    def _draw_line(self, line, isheader=False):
-        """Draw a line
-
-        Loop over a single cell length, over all the cells
-        """
-
-        line = self._splitit(line, isheader)
-        space = " "
-        out  = ""
-        for i in range(len(line[0])):
-            if self._has_border():
-                out += "%s " % self._char_vert
-            length = 0
-            for cell, width, align in zip(line, self._width, self._align):
-                length += 1
-                cell_line = cell[i]
-                fill = width - len(cell_line)
-                if isheader:
-                    align = "c"
-                if align == "r":
-                    out += "%s " % (fill * space + cell_line)
-                elif align == "c":
-                    out += "%s " % (fill/2 * space + cell_line \
-                            + (fill/2 + fill%2) * space)
-                else:
-                    out += "%s " % (cell_line + fill * space)
-                if length < len(line):
-                    out += "%s " % [space, self._char_vert][self._has_vlines()]
-            out += "%s\n" % ['', self._char_vert][self._has_border()]
-        return out
-
-    def _splitit(self, line, isheader):
-        """Split each element of line to fit the column width
-
-        Each element is turned into a list, result of the wrapping of the
-        string to the desired width
-        """
-
-        line_wrapped = []
-        for cell, width in zip(line, self._width):
-            array = []
-            for c in cell.split('\n'):
-                try:
-                    c = unicode(c, 'utf')
-                except UnicodeDecodeError, strerror:
-                    sys.stderr.write("UnicodeDecodeError exception for string '%s': %s\n" % (c, strerror))
-                    c = unicode(c, 'utf', 'replace')
-                array.extend(textwrap.wrap(c, width))
-            line_wrapped.append(array)
-        max_cell_lines = reduce(max, map(len, line_wrapped))
-        for cell, valign in zip(line_wrapped, self._valign):
-            if isheader:
-                valign = "t"
-            if valign == "m":
-                missing = max_cell_lines - len(cell)
-                cell[:0] = [""] * (missing / 2)
-                cell.extend([""] * (missing / 2 + missing % 2))
-            elif valign == "b":
-                cell[:0] = [""] * (max_cell_lines - len(cell))
-            else:
-                cell.extend([""] * (max_cell_lines - len(cell)))
-        return line_wrapped
-
-if __name__ == '__main__':
-    table = Texttable()
-    table.set_cols_align(["l", "r", "c"])
-    table.set_cols_valign(["t", "m", "b"])
-    table.add_rows([ ["Name", "Age", "Nickname"], 
-                     ["Mr\nXavier\nHuon", 32, "Xav'"],
-                     ["Mr\nBaptiste\nClement", 1, "Baby"] ])
-    print table.draw() + "\n"
-
-    table = Texttable()
-    table.set_deco(Texttable.HEADER)
-    table.set_cols_dtype(['t',  # text 
-                          'f',  # float (decimal)
-                          'e',  # float (exponent)
-                          'i',  # integer
-                          'a']) # automatic
-    table.set_cols_align(["l", "r", "r", "r", "l"])
-    table.add_rows([["text",    "float", "exp", "int", "auto"],
-                    ["abcd",    "67",    654,   89,    128.001],
-                    ["efghijk", 67.5434, .654,  89.6,  12800000000000000000000.00023],
-                    ["lmn",     5e-78,   5e-78, 89.4,  .000000000000128],
-                    ["opqrstu", .023,    5e+78, 92.,   12800000000000000000000]])
-    print table.draw()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/pylint.rc igraph-0.6.5/interfaces/python/pylint.rc
--- igraph-0.6.5~quantal1/interfaces/python/pylint.rc	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/pylint.rc	1970-01-01 00:00:00.000000000 +0000
@@ -1,310 +0,0 @@
-# lint Python modules using external checkers.
-# 
-# This is the main checker controlling the other ones and the reports
-# generation. It is itself both a raw checker and an astng checker in order
-# to:
-# * handle message activation / deactivation at the module level
-# * handle some basic but necessary stats'data (number of classes, methods...)
-# 
-[MASTER]
-
-# Specify a configuration file.
-#rcfile=
-
-# Python code to execute, usually for sys.path manipulation such as
-# pygtk.require().
-#init-hook=
-
-# Profiled execution.
-profile=no
-
-# Add <file or directory> to the black list. It should be a base name, not a
-# path. You may set this option multiple times.
-ignore=.bzr
-
-# Pickle collected data for later comparisons.
-persistent=yes
-
-# List of plugins (as comma separated values of python modules names) to load,
-# usually to register additional checkers.
-load-plugins=
-
-
-[MESSAGES CONTROL]
-
-# Enable only checker(s) with the given id(s). This option conflicts with the
-# disable-checker option
-#enable-checker=
-
-# Enable all checker(s) except those with the given id(s). This option
-# conflicts with the enable-checker option
-#disable-checker=
-
-# Enable all messages in the listed categories (IRCWEF).
-#enable-msg-cat=
-
-# Disable all messages in the listed categories (IRCWEF).
-disable-msg-cat=I
-
-# Enable the message(s) with the given id(s).
-#enable-msg=
-
-# Disable the message(s) with the given id(s).
-disable-msg=W0704
-
-
-[REPORTS]
-
-# Set the output format. Available formats are text, parseable, colorized, msvs
-# (visual studio) and html
-output-format=text
-
-# Include message's id in output
-include-ids=yes
-
-# Put messages in a separate file for each module / package specified on the
-# command line instead of printing them on stdout. Reports (if any) will be
-# written in a file name "pylint_global.[txt|html]".
-files-output=no
-
-# Tells whether to display a full report or only the messages
-reports=no
-
-# Python expression which should return a note less than 10 (10 is the highest
-# note). You have access to the variables errors warning, statement which
-# respectively contain the number of errors / warnings messages and the total
-# number of statements analyzed. This is used by the global evaluation report
-# (R0004).
-evaluation=10.0 - ((float(5 * error + warning + refactor + convention) / statement) * 10)
-
-# Add a comment according to your evaluation note. This is used by the global
-# evaluation report (R0004).
-comment=no
-
-# Enable the report(s) with the given id(s).
-#enable-report=
-
-# Disable the report(s) with the given id(s).
-#disable-report=
-
-
-# checks for :
-# * doc strings
-# * modules / classes / functions / methods / arguments / variables name
-# * number of arguments, local variables, branches, returns and statements in
-# functions, methods
-# * required module attributes
-# * dangerous default values as arguments
-# * redefinition of function / method / class
-# * uses of the global statement
-# 
-[BASIC]
-
-# Required attributes for module, separated by a comma
-required-attributes=
-
-# Regular expression which should only match functions or classes name which do
-# not require a docstring
-no-docstring-rgx=__.*__
-
-# Regular expression which should only match correct module names
-module-rgx=(([a-z_][a-z0-9_]*)|([A-Z][a-zA-Z0-9]+))$
-
-# Regular expression which should only match correct module level names
-const-rgx=(([A-Z_][A-Z0-9_]*)|(__.*__))$
-
-# Regular expression which should only match correct class names
-class-rgx=[A-Z_][a-zA-Z0-9]+$
-
-# Regular expression which should only match correct function names
-function-rgx=[a-z_][a-z0-9_]{2,30}$
-
-# Regular expression which should only match correct method names
-method-rgx=[a-z_][a-z0-9_]{2,30}$
-
-# Regular expression which should only match correct instance attribute names
-attr-rgx=[a-z_][a-z0-9_]{2,30}$
-
-# Regular expression which should only match correct argument names
-argument-rgx=[a-z_][a-z0-9_]{2,30}$
-
-# Regular expression which should only match correct variable names
-variable-rgx=[a-z_][a-z0-9_]{2,30}$
-
-# Regular expression which should only match correct list comprehension /
-# generator expression variable names
-inlinevar-rgx=[A-Za-z_][A-Za-z0-9_]*$
-
-# Good variable names which should always be accepted, separated by a comma
-good-names=i,j,k,l,m,n,x,y,v,e,ex,Run,_
-
-# Bad variable names which should always be refused, separated by a comma
-bad-names=foo,bar,baz,toto,tutu,tata
-
-# List of builtins function names that should not be used, separated by a comma
-bad-functions=map,filter,apply,input
-
-
-# try to find bugs in the code using type inference
-# 
-[TYPECHECK]
-
-# Tells whether missing members accessed in mixin class should be ignored. A
-# mixin class is detected if its name ends with "mixin" (case insensitive).
-ignore-mixin-members=yes
-
-# List of classes names for which member attributes should not be checked
-# (useful for classes with attributes dynamically set).
-ignored-classes=SQLObject
-
-# When zope mode is activated, add a predefined set of Zope acquired attributes
-# to generated-members.
-zope=no
-
-# List of members which are set dynamically and missed by pylint inference
-# system, and so shouldn't trigger E0201 when accessed.
-generated-members=REQUEST,acl_users,aq_parent
-
-
-# checks for
-# * unused variables / imports
-# * undefined variables
-# * redefinition of variable from builtins or from an outer scope
-# * use of variable before assignment
-# 
-[VARIABLES]
-
-# Tells whether we should check for unused import in __init__ files.
-init-import=no
-
-# A regular expression matching names used for dummy variables (i.e. not used).
-dummy-variables-rgx=_|dummy
-
-# List of additional names supposed to be defined in builtins. Remember that
-# you should avoid to define new builtins when possible.
-additional-builtins=
-
-
-# checks for :
-# * methods without self as first argument
-# * overridden methods signature
-# * access only to existent members via self
-# * attributes not defined in the __init__ method
-# * supported interfaces implementation
-# * unreachable code
-# 
-[CLASSES]
-
-# List of interface methods to ignore, separated by a comma. This is used for
-# instance to not check methods defines in Zope's Interface base class.
-ignore-iface-methods=isImplementedBy,deferred,extends,names,namesAndDescriptions,queryDescriptionFor,getBases,getDescriptionFor,getDoc,getName,getTaggedValue,getTaggedValueTags,isEqualOrExtendedBy,setTaggedValue,isImplementedByInstancesOf,adaptWith,is_implemented_by
-
-# List of method names used to declare (i.e. assign) instance attributes.
-defining-attr-methods=__init__,__new__,setUp
-
-
-# checks for sign of poor/misdesign:
-# * number of methods, attributes, local variables...
-# * size, complexity of functions, methods
-# 
-[DESIGN]
-
-# Maximum number of arguments for function / method
-max-args=5
-
-# Argument names that match this expression will be ignored. Default to name
-# with leading underscore
-ignored-argument-names=_.*
-
-# Maximum number of locals for function / method body
-max-locals=15
-
-# Maximum number of return / yield for function / method body
-max-returns=6
-
-# Maximum number of branch for function / method body
-max-branchs=12
-
-# Maximum number of statements in function / method body
-max-statements=50
-
-# Maximum number of parents for a class (see R0901).
-max-parents=7
-
-# Maximum number of attributes for a class (see R0902).
-max-attributes=7
-
-# Minimum number of public methods for a class (see R0903).
-min-public-methods=2
-
-# Maximum number of public methods for a class (see R0904).
-max-public-methods=20
-
-
-# checks for
-# * external modules dependencies
-# * relative / wildcard imports
-# * cyclic imports
-# * uses of deprecated modules
-# 
-[IMPORTS]
-
-# Deprecated modules which should not be used, separated by a comma
-deprecated-modules=regsub,string,TERMIOS,Bastion,rexec
-
-# Create a graph of every (i.e. internal and external) dependencies in the
-# given file (report R0402 must not be disabled)
-import-graph=
-
-# Create a graph of external dependencies in the given file (report R0402 must
-# not be disabled)
-ext-import-graph=
-
-# Create a graph of internal dependencies in the given file (report R0402 must
-# not be disabled)
-int-import-graph=
-
-
-# checks for :
-# * unauthorized constructions
-# * strict indentation
-# * line length
-# * use of <> instead of !=
-# 
-[FORMAT]
-
-# Maximum number of characters on a single line.
-max-line-length=80
-
-# Maximum number of lines in a module
-max-module-lines=1000
-
-# String used as indentation unit. This is usually " " (4 spaces) or "\t" (1
-# tab).
-indent-string='    '
-
-
-# checks for:
-# * warning notes in the code like FIXME, XXX
-# * PEP 263: source code with non ascii character but no encoding declaration
-# 
-[MISCELLANEOUS]
-
-# List of note tags to take in consideration, separated by a comma.
-notes=FIXME,XXX,TODO
-
-
-# checks for similarities and duplicated code. This computation may be
-# memory / CPU intensive, so you should disable it if you experiments some
-# problems.
-# 
-[SIMILARITIES]
-
-# Minimum lines number of a similarity.
-min-similarity-lines=4
-
-# Ignore comments when computing similarities.
-ignore-comments=yes
-
-# Ignore docstrings when computing similarities.
-ignore-docstrings=yes
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/epydoc-patched igraph-0.6.5/interfaces/python/scripts/epydoc-patched
--- igraph-0.6.5~quantal1/interfaces/python/scripts/epydoc-patched	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/epydoc-patched	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-#!/usr/bin/env python
-"""Patched version of Epydoc that does not blow up with `docutils`
-newer than 0.6 when reST is used as a markup language"""
-
-from epydoc.cli import cli
-from epydoc.markup.restructuredtext import parse_docstring
-
-# Check whether Epydoc needs patching
-doc = parse_docstring("aaa", [])
-try:
-	doc.summary()
-except AttributeError:
-	# Monkey-patching docutils so that Text nodes have a "data" property,
-	# which is always empty
-	from docutils.nodes import Text
-	Text.data=""
-
-cli()
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/epydoc.cfg igraph-0.6.5/interfaces/python/scripts/epydoc.cfg
--- igraph-0.6.5~quantal1/interfaces/python/scripts/epydoc.cfg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/epydoc.cfg	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-[epydoc]
-
-name: igraph library
-url: http://igraph.sourceforge.net
-
-modules: igraph, igraph.app, igraph.app.shell, igraph.statistics
-exclude: igraph.formula, igraph.test, igraph.vendor
-
-imports: yes
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/igraph igraph-0.6.5/interfaces/python/scripts/igraph
--- igraph-0.6.5~quantal1/interfaces/python/scripts/igraph	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/igraph	1970-01-01 00:00:00.000000000 +0000
@@ -1,4 +0,0 @@
-#!/usr/bin/env python
-"""Small script to execute the igraph command line interface"""
-from igraph.app.shell import main
-main()
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/mkdoc.sh igraph-0.6.5/interfaces/python/scripts/mkdoc.sh
--- igraph-0.6.5~quantal1/interfaces/python/scripts/mkdoc.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/mkdoc.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,65 +0,0 @@
-#!/bin/sh
-#
-# Creates documentation for igraph's Python interface using epydoc
-#
-# Usage: ./mkdoc.sh [--sync] [directory]
-
-SCRIPTS_FOLDER=`dirname $0`
-
-cd ${SCRIPTS_FOLDER}/..
-ROOT_FOLDER=`pwd`
-DOC_API_FOLDER=${ROOT_FOLDER}/doc/api
-CONFIG=${ROOT_FOLDER}/scripts/epydoc.cfg
-
-cd ${ROOT_FOLDER}
-mkdir -p ${DOC_API_FOLDER}/pdf
-mkdir -p ${DOC_API_FOLDER}/html
-
-EPYDOC="${ROOT_FOLDER}/scripts/epydoc-patched"
-python -m epydoc.__init__
-if [ $? -gt 0 ]; then
-  echo "Epydoc not installed, exiting..."
-  exit 1
-fi
-
-PWD=`pwd`
-
-SYNC=0
-if [ x$1 = x--sync ]; then
-  SYNC=1
-  shift
-fi
-if [ x$1 != x ]; then
-  cd $1 || exit 1
-fi
-
-echo "Checking symlinked _igraph.so in ${ROOT_FOLDER}/igraph..."
-if [ ! -e ${ROOT_FOLDER}/igraph/_igraph.so -o ! -L ${ROOT_FOLDER}/igraph/_igraph.so ]; then
-	rm -f ${ROOT_FOLDER}/igraph/_igraph.so
-	cd ${ROOT_FOLDER}/igraph
-	ln -s ../build/lib*/igraph/_igraph.so .
-	cd ${ROOT_FOLDER}
-fi
-
-echo "Removing existing documentation..."
-rm -rf html
-
-echo "Generating HTML documentation..."
-${EPYDOC} --html -v -o ${DOC_API_FOLDER}/html --config ${CONFIG}
-
-PDF=0
-which latex >/dev/null && PDF=1
-
-if [ $PDF -eq 1 ]; then
-  echo "Generating PDF documentation..."
-${EPYDOC} --pdf -v -o ${DOC_API_FOLDER}/pdf --config ${CONFIG}
-fi
-
-if [ $SYNC -eq 1 ]; then
-  echo "Syncing documentation to web"
-  cp ${DOC_API_FOLDER}/pdf/igraph.pdf ${DOC_API_FOLDER}/html
-  rsync --delete -avz ${DOC_API_FOLDER}/html/ ntamas,igraph@web.sourceforge.net:/home/groups/i/ig/igraph/htdocs/doc/python/
-  rm ${DOC_API_FOLDER}/html/igraph.pdf
-fi
-
-cd "$PWD"
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/release-osx.sh igraph-0.6.5/interfaces/python/scripts/release-osx.sh
--- igraph-0.6.5~quantal1/interfaces/python/scripts/release-osx.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/release-osx.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,98 +0,0 @@
-#!/bin/bash
-# Creates the OS X installer package and puts it in a disk image
-
-FATLIB=../../fatbuild/libigraph.dylib
-PYTHON_VERSIONS="2.5 2.6 2.7"
-
-function check_universal {
-	if [ `file $1 | grep -c "binary with 2 architectures"` -lt 1 ]; then
-		echo "$1 is not a universal binary"
-		exit 2
-	fi
-}
-
-function get_dependent_libraries {
-	local LIBS=`otool -L $1 | awk 'NR >= 2 { print }' | cut -f 2 | cut -d ' ' -f 1`
-	echo "$LIBS"
-}
-
-function check_library_paths {
-	local LIB
-	for LIB in $2; do
-		DIR=`dirname $LIB`
-		if [ x$DIR != x/usr/lib -a x$DIR != x/usr/local/lib ]; then
-			echo "$1 links to disallowed library: $LIB"
-			exit 3
-		fi
-	done
-}
-
-function check_mandatory_library_linkage {
-	local LIB
-	for LIB in $2; do
-		if [ x$LIB = x$3 ]; then
-			return
-		fi
-	done
-	echo "$1 does not link to required library: $3"
-	exit 4
-}
-
-# Check whether we are running the script on Mac OS X
-which hdiutil >/dev/null || ( echo "This script must be run on OS X"; exit 1 )
-
-# Find the directory with setup.py
-CWD=`pwd`
-while [ ! -f setup.py ]; do cd ..; done
-
-# Extract the version number from setup.py
-VERSION=`cat setup.py | grep "version =" | cut -d '=' -f 2 | tr -d "', "`
-
-# Ensure that the igraph library we are linking to is a fat binary
-if [ ! -f ${FATLIB} ]; then
-  pushd ../.. && tools/fatbuild.sh && popd
-  if [ ! -f ${FATLIB} ]; then
-    echo "Failed to build fat igraph library: ${FATLIB}"
-    exit 1
-  fi
-fi
-
-# Ensure that we are really linking to a fat binary and that it refers
-# to libxml2
-check_universal ${FATLIB}
-LIBS=$(get_dependent_libraries ${FATLIB})
-check_library_paths ${FATLIB} "${LIBS}"
-check_mandatory_library_linkage ${FATLIB} "${LIBS}" /usr/lib/libxml2.2.dylib
-
-# Clean up the previous build directory
-rm -rf build/
-
-# Set up ARCHFLAGS to ensure that we build a multi-arch Python extension
-export ARCHFLAGS="-arch i386 -arch x86_64"
-
-# For each Python version, build the .mpkg and the .dmg
-for PYVER in $PYTHON_VERSIONS; do
-  python$PYVER setup.py build_ext --no-pkg-config -I ../../include:../../build/include -L `dirname $FATLIB` || exit 3
-  python$PYVER setup.py bdist_mpkg --no-pkg-config || exit 4
-
-  # Ensure that the built library is really universal
-  LIB=build/lib.macosx-*-${PYVER}/igraph/_igraph.so
-  check_universal ${LIB}
-  DEPS=$(get_dependent_libraries ${LIB})
-  check_library_paths ${LIB} "${DEPS}"
-  check_mandatory_library_linkage ${LIB} "${DEPS}" /usr/local/lib/libigraph.0.dylib
-
-  MPKG="dist/python_igraph-${VERSION}-py${PYVER}-macosx10.5.mpkg"
-  if [ ! -f $MPKG ]; then
-    MPKG="dist/python_igraph-${VERSION}-py${PYVER}-macosx10.6.mpkg"
-    if [ ! -f $MPKG ]; then
-      MPKG="dist/python_igraph-${VERSION}-py${PYVER}-macosx10.7.mpkg"
-    fi
-  fi
-  DMG=dist/`basename $MPKG .mpkg`.dmg
-  rm -f ${DMG}
-  hdiutil create -volname "python-igraph ${VERSION}" -layout NONE -srcfolder $MPKG $DMG
-  rm -rf ${MPKG}
-done
-
-cd $CWD
diff -Nru igraph-0.6.5~quantal1/interfaces/python/scripts/x11torgb.py igraph-0.6.5/interfaces/python/scripts/x11torgb.py
--- igraph-0.6.5~quantal1/interfaces/python/scripts/x11torgb.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/scripts/x11torgb.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-#!/usr/bin/env python
-"""Converts X11 color files to RGB formatted Python dicts"""
-import sys
-import pprint
-
-if len(sys.argv)<2:
-    print "Usage: %s filename" % sys.argv[0]
-    sys.exit(1)
-
-colors = {
-  "black":    (0.  , 0.  , 0.  , 1.),
-  "silver":   (0.75, 0.75, 0.75, 1.),
-  "gray":     (0.5 , 0.5 , 0.5 , 1.),
-  "white":    (1.  , 1.  , 1.  , 1.),
-  "maroon":   (0.5 , 0.  , 0.  , 1.),
-  "red":      (1.  , 0.  , 0.  , 1.),
-  "purple":   (0.5 , 0.  , 0.5 , 1.),
-  "fuchsia":  (1.  , 0.  , 1.  , 1.),
-  "green":    (0.  , 0.5 , 0.  , 1.),
-  "lime":     (0.  , 1.  , 0.  , 1.),
-  "olive":    (0.5 , 0.5 , 0.  , 1.),
-  "yellow":   (1.  , 1.  , 0.  , 1.),
-  "navy":     (0.  , 0.  , 0.5 , 1.),
-  "blue":     (0.  , 0.  , 1.  , 1.),
-  "teal":     (0.  , 0.5 , 0.5 , 1.),
-  "aqua":     (0.  , 1.  , 1.  , 1.),
-}
-
-f = open(sys.argv[1])
-for line in f:
-    if line[0] == '!': continue
-    parts = line.strip().split(None, 3)
-    for x in xrange(3):
-        parts[x] = float(parts[x])/255.
-    parts[3:3] = [1.]
-    colors[parts[4].lower()] = tuple(parts[0:4])
-
-pp = pprint.PrettyPrinter(indent=4)
-pp.pprint(colors)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/setup.cfg igraph-0.6.5/interfaces/python/setup.cfg
--- igraph-0.6.5~quantal1/interfaces/python/setup.cfg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/setup.cfg	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-[build_ext]
-
-# Please set the INCLUDE and LIB directories where the C core of igraph
-# and the libxml2 and iconv libraries are to be found.
-#
-# On Linux and OS X, these are likely to be as follows
-include_dirs=../../build/include:../../include:/usr/local/include:/usr/include
-library_dirs=../../build/src/.libs:../../src/.libs:/usr/local/lib:/usr/lib
-
-# Alternative compiler to build the extension if you don't like the default
-# compiler=mingw32
diff -Nru igraph-0.6.5~quantal1/interfaces/python/setup.py igraph-0.6.5/interfaces/python/setup.py
--- igraph-0.6.5~quantal1/interfaces/python/setup.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/setup.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,166 +0,0 @@
-#!/usr/bin/env python
-try:
-    from setuptools import setup
-    build_py = None
-except ImportError:
-    from distutils.core import setup
-    try:
-        from distutils.command.build_py import build_py_2to3 as build_py
-    except ImportError:
-        from distutils.command.build_py import build_py
-
-from distutils.core import Extension
-from distutils.file_util import copy_file
-from distutils.util import get_platform
-from sys import argv, version_info, exit
-import os.path
-import glob
-from os import mkdir
-from shutil import copy2
-from subprocess import Popen, PIPE
-
-LIBIGRAPH_FALLBACK_INCLUDE_DIRS = ['/usr/include/igraph', '/usr/local/include/igraph']
-LIBIGRAPH_FALLBACK_LIBRARIES = ['igraph']
-LIBIGRAPH_FALLBACK_LIBRARY_DIRS = []
-
-if version_info < (2, 5):
-    print("This module requires Python >= 2.5")
-    exit(0)
-
-def get_output(command):
-    """Returns the output of a command returning a single line of output"""
-    p = Popen(command, shell=True, stdin=PIPE, stdout=PIPE, stderr=PIPE)
-    p.stdin.close()
-    p.stderr.close()
-    line=p.stdout.readline().strip()
-    p.wait()
-    if type(line).__name__ == "bytes":
-        line = str(line, encoding="utf-8")
-    return line, p.returncode
-    
-def detect_igraph_include_dirs(default = LIBIGRAPH_FALLBACK_INCLUDE_DIRS):
-    """Tries to detect the igraph include directory"""
-    line, exit_code = get_output("pkg-config igraph --cflags")
-    if exit_code > 0 or len(line) == 0:
-        return default
-    opts=line.split()
-    return [opt[2:] for opt in opts if opt.startswith("-I")]
-
-def detect_igraph_libraries(default = LIBIGRAPH_FALLBACK_LIBRARIES):
-    """Tries to detect the libraries that igraph uses"""
-    line, exit_code = get_output("pkg-config igraph --libs")
-    if exit_code>0 or len(line) == 0:
-        return default
-    opts=line.split()
-    return [opt[2:] for opt in opts if opt.startswith("-l")]
-    
-def detect_igraph_library_dirs(default = LIBIGRAPH_FALLBACK_LIBRARY_DIRS):
-    """Tries to detect the igraph library directory"""
-    line, exit_code = get_output("pkg-config igraph --libs")
-    if exit_code>0 or len(line) == 0: return default
-    opts=line.split()
-    return [opt[2:] for opt in opts if opt[0:2]=="-L"]
-
-sources=glob.glob(os.path.join('src', '*.c'))
-include_dirs=[]
-library_dirs=[]
-libraries=[]
-
-if "--no-pkg-config" in argv:
-    argv.remove("--no-pkg-config")
-    libraries.append("igraph")
-else:
-    line, exit_code = get_output("pkg-config igraph")
-    if exit_code>0:
-        print("Using default include and library paths for compilation")
-        print("If the compilation fails, please edit the LIBIGRAPH_FALLBACK_*")
-        print("variables in setup.py or include_dirs and library_dirs in ")
-        print("setup.cfg to point to the correct directories and libraries")
-        print("where the C core of igraph is installed")
-        print("")
-
-    include_dirs.extend(detect_igraph_include_dirs())
-    library_dirs.extend(detect_igraph_library_dirs())
-    libraries.extend(detect_igraph_libraries())
-
-print("Include path: %s" % " ".join(include_dirs))
-print("Library path: %s" % " ".join(library_dirs))
-
-igraph_extension = Extension('igraph._igraph', sources, \
-  library_dirs=library_dirs, libraries=libraries, \
-  include_dirs=include_dirs)
-       
-description = """Python interface to the igraph high performance graph
-library, primarily aimed at complex network research and analysis.
-
-Graph plotting functionality is provided by the Cairo library, so make
-sure you install the Python bindings of Cairo if you want to generate
-publication-quality graph plots.
-
-See the `Cairo homepage <http://cairographics.org/pycairo>`_ for details.
-
-From release 0.5, the C core of the igraph library is **not** included
-in the Python distribution - you must compile and install the C core
-separately. Windows installers already contain a compiled igraph DLL,
-so they should work out of the box. Linux users should refer to the
-`igraph homepage <http://igraph.sourceforge.net>`_ for
-compilation instructions (but check your distribution first, maybe
-there are pre-compiled packages available). OS X Snow Leopard users may
-benefit from the disk images in the Python Package Index.
-
-Unofficial installers for 64-bit Windows machines and/or different Python
-versions can also be found `here <http://www.lfd.uci.edu/~gohlke/pythonlibs>`_.
-Many thanks to the maintainers of this page!
-"""
-
-plat = get_platform()
-options = dict(
-    name = 'python-igraph',
-    version = '0.6.5',
-    description = 'High performance graph data structures and algorithms',
-    long_description = description,
-    license = 'GNU General Public License (GPL)',
-
-    author = 'Tamas Nepusz',
-    author_email = 'tamas@cs.rhul.ac.uk',
-
-    ext_modules = [igraph_extension],
-    package_dir = {'igraph': 'igraph'},
-    packages = ['igraph', 'igraph.test', 'igraph.app', 'igraph.drawing',
-        'igraph.remote', 'igraph.vendor'],
-    scripts = ['scripts/igraph'],
-    test_suite = "igraph.test.suite",
-
-    headers = ['src/igraphmodule_api.h'],
-
-    platforms = 'ALL',
-    keywords = ['graph', 'network', 'mathematics', 'math', 'graph theory', 'discrete mathematics'],
-    classifiers = [
-      'Development Status :: 4 - Beta',
-      'Intended Audience :: Developers',
-      'Intended Audience :: Science/Research',
-      'Operating System :: OS Independent',
-      'Programming Language :: C',
-      'Programming Language :: Python',
-      'Topic :: Scientific/Engineering',
-      'Topic :: Scientific/Engineering :: Information Analysis',
-      'Topic :: Scientific/Engineering :: Mathematics',
-      'Topic :: Scientific/Engineering :: Physics',
-      'Topic :: Scientific/Engineering :: Bio-Informatics',
-      'Topic :: Software Development :: Libraries :: Python Modules'
-    ]
-)
-
-if "macosx" in plat and "bdist_mpkg" in argv:
-    # OS X specific stuff to build the .mpkg installer
-    options["data_files"] = [ \
-            ('/usr/local/lib', [os.path.join('..', '..', 'fatbuild', 'libigraph.0.dylib')])
-    ]
-
-if version_info > (3, 0):
-    if build_py is None:
-        options["use_2to3"] = True
-    else:
-        options["cmdclass"] = { "build_py": build_py }
-
-setup(**options)
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/arpackobject.c igraph-0.6.5/interfaces/python/src/arpackobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/arpackobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/arpackobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,281 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library.
-   Copyright (C) 2007-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "arpackobject.h"
-#include "graphobject.h"
-#include "error.h"
-#include "py2compat.h"
-
-PyObject* igraphmodule_arpack_options_default;
-
-/**
- * \ingroup python_interface_arpack
- * \brief Checks if the object is an ARPACK parameter object
- */
-int igraphmodule_ARPACKOptions_Check(PyObject *ob) {
-  if (ob) return PyType_IsSubtype(ob->ob_type, &igraphmodule_ARPACKOptionsType);
-  return 0;
-}
-
-/**
- * \ingroup python_interface_arpack
- * \brief Allocates a new ARPACK parameters object
- */
-PyObject* igraphmodule_ARPACKOptions_new() {
-  igraphmodule_ARPACKOptionsObject* self;
-  self=PyObject_New(igraphmodule_ARPACKOptionsObject,
-    &igraphmodule_ARPACKOptionsType);
-  if (self) {
-    igraph_arpack_options_init(&self->params);
-    igraph_arpack_options_init(&self->params_out);
-  }
-  return (PyObject*)self;
-}
-
-/**
- * \ingroup python_interface_arpack
- * \brief Deallocates a Python representation of a given ARPACK parameters object
- */
-void igraphmodule_ARPACKOptions_dealloc(
-  igraphmodule_ARPACKOptionsObject* self) {
-  /*igraph_arpack_options_destroy(&self->params);*/
-  PyObject_Del((PyObject*)self);
-}
-
-/** \ingroup python_interface_arpack
- * \brief Returns one of the attributes of a given ARPACK parameters object
- */
-PyObject* igraphmodule_ARPACKOptions_getattr(
-  igraphmodule_ARPACKOptionsObject* self, char* attrname) {
-  PyObject *result = NULL;
-
-  if (strcmp(attrname, "bmat") == 0) {
-    char buf[2] = { self->params_out.bmat[0], 0 };
-    result=PyString_FromString(buf);
-  } else if (strcmp(attrname, "n") == 0) {
-    result=PyInt_FromLong(self->params_out.n);
-  } else if (strcmp(attrname, "which") == 0) {
-    char buf[3] = { self->params.which[0], self->params.which[1], 0 };
-    result=PyString_FromString(buf);
-  } else if (strcmp(attrname, "nev") == 0) {
-    result=PyInt_FromLong(self->params.nev);
-  } else if (strcmp(attrname, "tol") == 0) {
-    result=PyFloat_FromDouble((double)self->params.tol);
-  } else if (strcmp(attrname, "ncv") == 0) {
-    result=PyInt_FromLong(self->params.ncv);
-  } else if (strcmp(attrname, "ldv") == 0) {
-    result=PyInt_FromLong(self->params.ldv);
-  } else if (strcmp(attrname, "ishift") == 0) {
-    result=PyInt_FromLong(self->params.ishift);
-  } else if (strcmp(attrname, "maxiter") == 0 ||
-		     strcmp(attrname, "mxiter") == 0) {
-    result=PyInt_FromLong(self->params.mxiter);
-  } else if (strcmp(attrname, "nb") == 0) {
-    result=PyInt_FromLong(self->params.nb);
-  } else if (strcmp(attrname, "mode") == 0) {
-    result=PyInt_FromLong(self->params.mode);
-  } else if (strcmp(attrname, "start") == 0) {
-    result=PyInt_FromLong(self->params.start);
-  } else if (strcmp(attrname, "sigma") == 0) {
-    result=PyFloat_FromDouble((double)self->params.sigma);
-  } else if (strcmp(attrname, "info") == 0) {
-    result=PyInt_FromLong(self->params_out.info);
-  } else if (strcmp(attrname, "iter") == 0) {
-    result=PyInt_FromLong(self->params_out.iparam[2]);
-  } else if (strcmp(attrname, "nconv") == 0) {
-    result=PyInt_FromLong(self->params_out.iparam[4]);
-  } else if (strcmp(attrname, "numop") == 0) {
-    result=PyInt_FromLong(self->params_out.iparam[8]);
-  } else if (strcmp(attrname, "numopb") == 0) {
-    result=PyInt_FromLong(self->params_out.iparam[9]);
-  } else if (strcmp(attrname, "numreo") == 0) {
-    result=PyInt_FromLong(self->params_out.iparam[10]);
-  } else {
-    PyErr_SetString(PyExc_AttributeError, attrname);
-  }
-  return result;
-}
-
-/** \ingroup python_interface_arpack
- * \brief Sets one of the attributes of a given ARPACK parameters object
- */
-int igraphmodule_ARPACKOptions_setattr(
-  igraphmodule_ARPACKOptionsObject* self, char* attrname,
-  PyObject* value) {
-  if (value == 0) {
-    PyErr_SetString(PyExc_TypeError, "attribute can not be deleted");
-    return -1;
-  }
-  if (strcmp(attrname, "maxiter") == 0 ||
-      strcmp(attrname, "mxiter") == 0) {
-    if (PyInt_Check(value)) {
-      long int n=PyInt_AsLong(value);
-      if (n>0)
-          self->params.mxiter=(igraph_integer_t)n;
-      else {
-        PyErr_SetString(PyExc_ValueError, "maxiter must be positive");
-        return -1;
-      }
-    } else {
-      PyErr_SetString(PyExc_ValueError, "integer expected");
-      return -1;
-    }
-  } else if (strcmp(attrname, "tol") == 0) {
-    if (PyInt_Check(value)) {
-      self->params.tol = (igraph_real_t) PyInt_AsLong(value);
-    } else if (PyFloat_Check(value)) {
-      self->params.tol = (igraph_real_t) PyFloat_AsDouble(value);
-    } else {
-      PyErr_SetString(PyExc_ValueError, "integer or float expected");
-      return -1;
-    }
-  } else {
-    PyErr_SetString(PyExc_AttributeError, attrname);
-    return -1;
-  }
-
-  return 0;
-}
-
-/** \ingroup python_interface_arpack */
-igraph_arpack_options_t *igraphmodule_ARPACKOptions_get(
-  igraphmodule_ARPACKOptionsObject *self) {
-  self->params_out = self->params;
-  self->params_out.iparam[0] = self->params.ishift;
-  self->params_out.iparam[2] = self->params.mxiter;
-  self->params_out.iparam[3] = self->params.nb;
-  self->params_out.iparam[6] = self->params.mode;
-  self->params_out.lworkl = 0;
-  self->params_out.info = self->params.start;
-
-  return &self->params_out;
-}
-
-/** \ingroup python_interface_arpack
- * \brief Formats an \c igraph.ARPACKOptions object in a
- * human-consumable format.
- * 
- * \return the formatted textual representation as a \c PyObject
- */
-PyObject* igraphmodule_ARPACKOptions_str(
-  igraphmodule_ARPACKOptionsObject *self) {
-  PyObject *s;
-  
-  s=PyString_FromFormat("ARPACK parameters");
-  return s;
-}
-
-/**
- * \ingroup python_interface_arpack
- * Method table for the \c igraph.ARPACKOptions object
- */
-PyMethodDef igraphmodule_ARPACKOptions_methods[] = {
-  /*{"attributes", (PyCFunction)igraphmodule_Edge_attributes,
-      METH_NOARGS,
-      "attributes() -> list\n\n"
-      "Returns the attribute list of the graph's edges\n"
-  },*/
-  {NULL}
-};
-
-/**
- * \ingroup python_interface_edge
- * Getter/setter table for the \c igraph.ARPACKOptions object
- */
-PyGetSetDef igraphmodule_ARPACKOptions_getseters[] = {
-  /*{"tuple", (getter)igraphmodule_Edge_get_tuple, NULL,
-      "Source and target node index of this edge as a tuple", NULL
-  },*/
-  {NULL}
-};
-
-/** \ingroup python_interface_edge
- * Python type object referencing the methods Python calls when it performs
- * various operations on an ARPACK parameters object
- */
-PyTypeObject igraphmodule_ARPACKOptionsType = {
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.ARPACKOptions",                     /* tp_name */
-  sizeof(igraphmodule_ARPACKOptionsObject),   /* tp_basicsize */
-  0,                                          /* tp_itemsize */
-  (destructor)igraphmodule_ARPACKOptions_dealloc,      /* tp_dealloc */
-  0,                                          /* tp_print */
-  (getattrfunc)igraphmodule_ARPACKOptions_getattr,     /* tp_getattr */
-  (setattrfunc)igraphmodule_ARPACKOptions_setattr,     /* tp_setattr */
-  0,                                          /* tp_compare (2.x) / tp_reserved (3.x) */
-  0,                                          /* tp_repr */
-  0,                                          /* tp_as_number */
-  0,                                          /* tp_as_sequence */
-  0,                                          /* tp_as_mapping */
-  0,                                          /* tp_hash */
-  0,                                          /* tp_call */
-  (reprfunc)igraphmodule_ARPACKOptions_str,   /* tp_str */
-  0,                                          /* tp_getattro */
-  0,                                          /* tp_setattro */
-  0,                                          /* tp_as_buffer */
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,   /* tp_flags */
-  "Class representing the parameters of the ARPACK module.\n\n"
-  "ARPACK is a Fortran implementation of the implicitly restarted\n"
-  "Arnoldi method, an algorithm for calculating some of the\n"
-  "eigenvalues and eigenvectors of a given matrix. igraph uses this\n"
-  "package occasionally, and this class can be used to fine-tune the\n"
-  "behaviour of ARPACK in such cases.\n\n"
-  "The class has several attributes which are not documented here,\n"
-  "since they are usually of marginal use to the ordinary user.\n"
-  "See the source code of the original ARPACK Fortran package\n"
-  "(especially the file C{dsaupd.f}) for a detailed explanation of the\n"
-  "parameters. Only the most basic attributes are explained here. Most\n"
-  "of them are read only unless stated otherwise.\n\n"
-  " - C{bmat}: type of the eigenproblem solved. C{'I'} means standard\n"
-  "   eigenproblem (A*x = lambda*x), C{'G'} means generalized\n"
-  "   eigenproblem (A*x = lambda*B*x).\n\n"
-  " - C{n}: dimension of the eigenproblem\n\n"
-  " - C{tol}: precision. If less than or equal to zero, the standard\n"
-  "   machine precision is used as computed by the LAPACK utility\n"
-  "   called C{dlamch}. This can be modified.\n\n"
-  " - C{mxiter}: maximum number of update iterations to take. This\n"
-  "   can be modified. You can also use C{maxiter}.\n\n"
-  " - C{iter}: actual number of update iterations taken\n\n"
-  " - C{numop}: total number of OP*x operations\n\n"
-  " - C{numopb}: total number of B*x operations if C{bmat} is C{'G'}\n\n"
-  " - C{numreo}: total number of steps of re-orthogonalization\n\n"
-  "",                              /* tp_doc */
-  0,                                          /* tp_traverse */
-  0,                                          /* tp_clear */
-  0,                                          /* tp_richcompare */
-  0,                                          /* tp_weaklistoffset */
-  0,                                          /* tp_iter */
-  0,                                          /* tp_iternext */
-  igraphmodule_ARPACKOptions_methods,         /* tp_methods */
-  0,                                          /* tp_members */
-  igraphmodule_ARPACKOptions_getseters,       /* tp_getset */
-  0,                                          /* tp_base */
-  0,                                          /* tp_dict */
-  0,                                          /* tp_descr_get */
-  0,                                          /* tp_descr_set */
-  0,                                          /* tp_dictoffset */
-  0,                                          /* tp_init */
-  0,                                          /* tp_alloc */
-  (newfunc)igraphmodule_ARPACKOptions_new,    /* tp_new */
-  0,                                          /* tp_free */
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/arpackobject.h igraph-0.6.5/interfaces/python/src/arpackobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/arpackobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/arpackobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,55 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_ARPACKOBJECT_H
-#define PYTHON_ARPACKOBJECT_H
-
-#include <Python.h>
-#include <igraph_arpack.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_arpack ARPACK parameters object
- */
-extern PyTypeObject igraphmodule_ARPACKOptionsType;
-
-/**
- * \ingroup python_interface_arpack
- * \brief A structure representing ARPACK parameters
- */
-typedef struct {
-  PyObject_HEAD
-  igraph_arpack_options_t params;
-  igraph_arpack_options_t params_out;
-} igraphmodule_ARPACKOptionsObject;
-
-extern PyObject* igraphmodule_arpack_options_default;
-
-void igraphmodule_ARPACKOptions_dealloc(igraphmodule_ARPACKOptionsObject* self);
-
-PyObject* igraphmodule_ARPACKOptions_new(void);
-PyObject* igraphmodule_ARPACKOptions_str(igraphmodule_ARPACKOptionsObject *self);
-#define igraphmodule_ARPACKOptions_CheckExact(ob) ((ob)->ob_type == &igraphmodule_ARPACKOptionsType)
-igraph_arpack_options_t *igraphmodule_ARPACKOptions_get(igraphmodule_ARPACKOptionsObject *self);
-int igraphmodule_ARPACKOptions_Check(PyObject *ob);
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/attributes.c igraph-0.6.5/interfaces/python/src/attributes.c
--- igraph-0.6.5~quantal1/interfaces/python/src/attributes.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/attributes.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,1714 +0,0 @@
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include <Python.h>
-#include "attributes.h"
-#include "common.h"
-#include "convert.h"
-#include "py2compat.h"
-#include "pyhelpers.h"
-
-int igraphmodule_i_attribute_struct_init(igraphmodule_i_attribute_struct *attrs) {
-  int i;
-  for (i=0; i<3; i++) {
-    attrs->attrs[i] = PyDict_New();
-    if (PyErr_Occurred())
-      return 1;
-    RC_ALLOC("dict", attrs->attrs[i]);
-  }
-  attrs->vertex_name_index = 0;
-  return 0;
-}
-
-void igraphmodule_i_attribute_struct_destroy(igraphmodule_i_attribute_struct *attrs) {
-  int i;
-  for (i=0; i<3; i++) {
-    if (attrs->attrs[i]) {
-      RC_DEALLOC("dict", attrs->attrs[i]);
-      Py_DECREF(attrs->attrs[i]);
-    }
-  }
-  if (attrs->vertex_name_index) {
-    RC_DEALLOC("dict", attrs->vertex_name_index);
-    Py_DECREF(attrs->vertex_name_index);
-  }
-}
-
-int igraphmodule_i_attribute_struct_index_vertex_names(
-    igraphmodule_i_attribute_struct *attrs, igraph_bool_t force) {
-  Py_ssize_t n = 0;
-  PyObject *name_list, *key, *value;
-
-  if (attrs->vertex_name_index && !force)
-    return 0;
-
-  if (attrs->vertex_name_index == 0) {
-    attrs->vertex_name_index = PyDict_New();
-    if (attrs->vertex_name_index == 0) {
-      return 1;
-    }
-  } else
-    PyDict_Clear(attrs->vertex_name_index);
-
-  name_list = PyDict_GetItemString(attrs->attrs[1], "name");
-  if (name_list == 0)
-    return 0;    /* no name attribute */
-
-  n = PyList_Size(name_list) - 1;
-  while (n >= 0) {
-    key = PyList_GET_ITEM(name_list, n);    /* we don't own a reference to key */
-    value = PyInt_FromLong(n);              /* we do own a reference to value */
-    if (value == 0)
-      return 1;
-    PyDict_SetItem(attrs->vertex_name_index, key, value);
-    /* PyDict_SetItem did an INCREF for both the key and a value, therefore we
-     * have to drop our reference on value */
-    Py_DECREF(value);
-
-    n--;
-  }
-
-  return 0;
-}
-
-void igraphmodule_i_attribute_struct_invalidate_vertex_name_index(
-    igraphmodule_i_attribute_struct *attrs) {
-  if (attrs->vertex_name_index == 0)
-    return;
-
-  Py_DECREF(attrs->vertex_name_index);
-  attrs->vertex_name_index = 0;
-}
-
-void igraphmodule_invalidate_vertex_name_index(igraph_t *graph) {
-  igraphmodule_i_attribute_struct_invalidate_vertex_name_index(ATTR_STRUCT(graph));
-}
-
-void igraphmodule_index_vertex_names(igraph_t *graph, igraph_bool_t force) {
-  igraphmodule_i_attribute_struct_index_vertex_names(ATTR_STRUCT(graph), force);
-}
-
-int igraphmodule_get_vertex_id_by_name(igraph_t *graph, PyObject* o, igraph_integer_t* vid) {
-  igraphmodule_i_attribute_struct* attrs = ATTR_STRUCT(graph);
-  PyObject* o_vid = NULL;
-  int tmp;
-
-  if (graph) {
-    attrs = ATTR_STRUCT(graph);
-    if (igraphmodule_i_attribute_struct_index_vertex_names(attrs, 0))
-      return 1;
-    o_vid = PyDict_GetItem(attrs->vertex_name_index, o);
-  }
-
-  if (o_vid == NULL) {
-#ifdef IGRAPH_PYTHON3
-    PyErr_Format(PyExc_ValueError, "no such vertex: %R", o);
-#else
-    PyObject* s = PyObject_Repr(o);
-    if (s) {
-      PyErr_Format(PyExc_ValueError, "no such vertex: %s", PyString_AS_STRING(s));
-      Py_DECREF(s);
-    } else {
-      PyErr_Format(PyExc_ValueError, "no such vertex: %p", o);
-    }
-#endif
-    return 1;
-  }
-
-  if (!PyInt_Check(o_vid)) {
-    PyErr_SetString(PyExc_ValueError, "non-numeric vertex ID assigned to vertex name. This is most likely a bug.");
-    return 1;
-  }
-  
-  if (PyInt_AsInt(o_vid, &tmp))
-    return 1;
-  
-  *vid = tmp;
-
-  return 0;
-}
-
-/**
- * \brief Checks whether the given graph has the given graph attribute.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being searched for
- */
-igraph_bool_t igraphmodule_has_graph_attribute(const igraph_t *graph, const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_GRAPH];
-  return name != 0 && dict != 0 && PyDict_GetItemString(dict, name) != 0;
-}
-
-/**
- * \brief Checks whether the given graph has the given vertex attribute.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being searched for
- */
-igraph_bool_t igraphmodule_has_vertex_attribute(const igraph_t *graph, const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  return name != 0 && dict != 0 && PyDict_GetItemString(dict, name) != 0;
-}
-
-/**
- * \brief Checks whether the given graph has the given edge attribute.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being searched for
- */
-igraph_bool_t igraphmodule_has_edge_attribute(const igraph_t *graph, const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  return name != 0 && dict != 0 && PyDict_GetItemString(dict, name) != 0;
-}
-
-/**
- * \brief Creates a new edge attribute and sets the values to None.
- *
- * This returns the actual list that we use to store the edge attributes, so
- * be careful when modifying it - any modification will propagate back to the
- * graph itself. You have been warned.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being created
- * \returns  a Python list of the values or \c NULL if the given
- *           attribute exists already (no exception set). The returned
- *           reference is borrowed.
- */
-PyObject* igraphmodule_create_edge_attribute(const igraph_t* graph,
-    const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  PyObject *values;
-  Py_ssize_t i, n;
-
-  if (dict == 0) {
-    dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE] = PyDict_New();
-  }
-  if (PyDict_GetItemString(dict, name))
-    return 0;
-
-  n = igraph_ecount(graph);
-  values = PyList_New(n);
-  if (values == 0)
-    return 0;
-
-  for (i = 0; i < n; i++) {
-    Py_INCREF(Py_None);
-    PyList_SET_ITEM(values, i, Py_None);   /* reference stolen */
-  }
-
-  if (PyDict_SetItemString(dict, name, values)) {
-    Py_DECREF(values);
-    return 0;
-  }
-
-  Py_DECREF(values);
-  return values;
-}
-
-/**
- * \brief Returns the values of the given edge attribute for all edges in the
- *        given graph.
- *
- * This returns the actual list that we use to store the edge attributes, so
- * be careful when modifying it - any modification will propagate back to the
- * graph itself. You have been warned.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being searched for
- * \returns  a Python list or \c NULL if there is no such attribute
- *           (no exception set). The returned reference is borrowed.
- */
-PyObject* igraphmodule_get_edge_attribute_values(const igraph_t* graph,
-    const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  if (dict == 0)
-    return 0;
-  return PyDict_GetItemString(dict, name);
-}
-
-/**
- * \brief Returns the values of the given edge attribute for all edges in the
- *        given graph, optionally creating it if it does not exist.
- *
- * This returns the actual list that we use to store the edge attributes, so
- * be careful when modifying it - any modification will propagate back to the
- * graph itself. You have been warned.
- *
- * \param  graph  the graph
- * \param  name   the name of the attribute being searched for
- * \returns  a Python list (borrowed reference)
- */
-PyObject* igraphmodule_create_or_get_edge_attribute_values(const igraph_t* graph,
-    const char* name) {
-  PyObject *dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE], *result;
-  if (dict == 0)
-    return 0;
-  result = PyDict_GetItemString(dict, name);
-  if (result != 0)
-    return result;
-  return igraphmodule_create_edge_attribute(graph, name);
-}
-
-/* Attribute handlers for the Python interface */
-
-/* Initialization */ 
-static int igraphmodule_i_attribute_init(igraph_t *graph, igraph_vector_ptr_t *attr) {
-  igraphmodule_i_attribute_struct* attrs;
-  long int i, n;
-  
-  attrs=(igraphmodule_i_attribute_struct*)calloc(1, sizeof(igraphmodule_i_attribute_struct));
-  if (!attrs)
-    IGRAPH_ERROR("not enough memory to allocate attribute hashes", IGRAPH_ENOMEM);
-  if (igraphmodule_i_attribute_struct_init(attrs)) {
-    PyErr_Clear();
-    free(attrs);
-    IGRAPH_ERROR("not enough memory to allocate attribute hashes", IGRAPH_ENOMEM);
-  }
-  graph->attr=(void*)attrs;
-
-  /* See if we have graph attributes */
-  if (attr) {
-    PyObject *dict=attrs->attrs[0], *value;
-    char *s;
-    n = igraph_vector_ptr_size(attr);
-    for (i=0; i<n; i++) {
-      igraph_attribute_record_t *attr_rec;
-      attr_rec = VECTOR(*attr)[i];
-      switch (attr_rec->type) {
-      case IGRAPH_ATTRIBUTE_NUMERIC:
-        value=PyFloat_FromDouble((double)VECTOR(*(igraph_vector_t*)attr_rec->value)[0]);
-        break;
-      case IGRAPH_ATTRIBUTE_STRING:
-        igraph_strvector_get((igraph_strvector_t*)attr_rec->value, 0, &s);
-        if (s == 0)
-          value=PyString_FromString("");
-        else
-          value=PyString_FromString(s);
-        break;
-      default:
-        IGRAPH_WARNING("unsupported attribute type (not string and not numeric)");
-        value=0;
-        break;
-      }
-      if (value) {
-        if (PyDict_SetItemString(dict, attr_rec->name, value)) {
-          Py_DECREF(value);
-          igraphmodule_i_attribute_struct_destroy(attrs);
-          free(graph->attr); graph->attr = 0;
-          IGRAPH_ERROR("failed to add attributes to graph attribute hash",
-                       IGRAPH_FAILURE);
-        }
-        Py_DECREF(value);
-        value=0;
-      }
-    }
-  }
-
-  return IGRAPH_SUCCESS;
-}
-
-/* Destruction */
-static void igraphmodule_i_attribute_destroy(igraph_t *graph) {
-  igraphmodule_i_attribute_struct* attrs;
- 
-  /* printf("Destroying attribute table\n"); */
-  if (graph->attr) {
-    attrs=(igraphmodule_i_attribute_struct*)graph->attr;
-    igraphmodule_i_attribute_struct_destroy(attrs);
-    free(attrs);
-  }
-}
-
-/* Copying */
-static int igraphmodule_i_attribute_copy(igraph_t *to, const igraph_t *from,
-  igraph_bool_t ga, igraph_bool_t va, igraph_bool_t ea) {
-  igraphmodule_i_attribute_struct *fromattrs, *toattrs;
-  PyObject *key, *value, *newval, *o=NULL;
-  igraph_bool_t copy_attrs[3] = { ga, va, ea };
-  int i, j;
-  Py_ssize_t pos = 0;
- 
-  if (from->attr) {
-    fromattrs=ATTR_STRUCT(from);
-    /* what to do with the original value of toattrs? */
-    toattrs=(igraphmodule_i_attribute_struct*)calloc(1, sizeof(igraphmodule_i_attribute_struct));
-    if (!toattrs)
-      IGRAPH_ERROR("not enough memory to allocate attribute hashes", IGRAPH_ENOMEM);
-    if (igraphmodule_i_attribute_struct_init(toattrs)) {
-      PyErr_Clear();
-      free(toattrs);
-      IGRAPH_ERROR("not enough memory to allocate attribute hashes", IGRAPH_ENOMEM);
-    }
-    to->attr=toattrs;
-
-    for (i=0; i<3; i++) {
-      if (!copy_attrs[i])
-        continue;
-
-      if (!PyDict_Check(fromattrs->attrs[i])) {
-        toattrs->attrs[i]=fromattrs->attrs[i];
-        Py_XINCREF(fromattrs->attrs[i]);
-        continue;
-      }
-      
-      pos = 0;
-      while (PyDict_Next(fromattrs->attrs[i], &pos, &key, &value)) {
-        /* value is only borrowed, so copy it */
-        if (i>0) {
-          newval=PyList_New(PyList_GET_SIZE(value));
-          for (j=0; j<PyList_GET_SIZE(value); j++) {
-            o=PyList_GetItem(value, j);
-            Py_INCREF(o);
-            PyList_SetItem(newval, j, o);
-          }
-        } else {
-          newval=value;
-          Py_INCREF(newval);
-        }
-        PyDict_SetItem(toattrs->attrs[i], key, newval);
-        Py_DECREF(newval); /* compensate for PyDict_SetItem */
-      }
-    }
-  }
-  return IGRAPH_SUCCESS;
-}
-
-/* Adding vertices */
-static int igraphmodule_i_attribute_add_vertices(igraph_t *graph, long int nv, igraph_vector_ptr_t *attr) {
-  /* Extend the end of every value in the vertex hash with nv pieces of None */
-  PyObject *key, *value, *dict;
-  long int i, j, k, l;
-  igraph_attribute_record_t *attr_rec;
-  igraph_bool_t *added_attrs=0;
-  Py_ssize_t pos = 0;
-
-  if (!graph->attr) return IGRAPH_SUCCESS;
-  if (nv<0) return IGRAPH_SUCCESS;
-
-  if (attr) {
-    added_attrs = (igraph_bool_t*)calloc((size_t)igraph_vector_ptr_size(attr),
-                                         sizeof(igraph_bool_t));
-    if (!added_attrs)
-      IGRAPH_ERROR("can't add vertex attributes", IGRAPH_ENOMEM);
-    IGRAPH_FINALLY(free, added_attrs);
-  }
-
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  if (!PyDict_Check(dict)) 
-    IGRAPH_ERROR("vertex attribute hash type mismatch", IGRAPH_EINVAL);
-
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    if (!PyString_Check(key))
-      IGRAPH_ERROR("vertex attribute hash key is not a string", IGRAPH_EINVAL);
-    if (!PyList_Check(value))
-      IGRAPH_ERROR("vertex attribute hash member is not a list", IGRAPH_EINVAL);
-    /* Check if we have specific values for the given attribute */
-    attr_rec=0;
-    if (attr) {
-      j=igraph_vector_ptr_size(attr);
-      for (i=0; i<j; i++) {
-        attr_rec=VECTOR(*attr)[i];
-        if (PyString_IsEqualToASCIIString(key, attr_rec->name)) {
-          added_attrs[i]=1;
-          break;
-        }
-        attr_rec=0;
-      }
-    }
-    /* If we have specific values for the given attribute, attr_rec contains
-     * the appropriate vector. If not, it is null. */
-    if (attr_rec) {
-      for (i=0; i<nv; i++) {
-        char *s;
-        PyObject *o;
-        switch (attr_rec->type) {
-        case IGRAPH_ATTRIBUTE_NUMERIC:
-          o=PyFloat_FromDouble((double)VECTOR(*(igraph_vector_t*)attr_rec->value)[i]);
-          break;
-        case IGRAPH_ATTRIBUTE_STRING:
-          igraph_strvector_get((igraph_strvector_t*)attr_rec->value, i, &s);
-          o=PyString_FromString(s);
-          break;
-        default:
-          IGRAPH_WARNING("unsupported attribute type (not string and not numeric)");
-          o=0;
-          break;
-        }
-        if (o) {
-          if (PyList_Append(value, o) == -1)
-            IGRAPH_ERROR("can't extend a vertex attribute hash member", IGRAPH_FAILURE);
-          else Py_DECREF(o);
-        }
-      }
-
-      /* Invalidate the vertex name index if needed */
-      if (!strcmp(attr_rec->name, "name"))
-        igraphmodule_i_attribute_struct_invalidate_vertex_name_index(ATTR_STRUCT(graph));
-    } else {
-      for (i=0; i<nv; i++) {
-        if (PyList_Append(value, Py_None) == -1) {
-          IGRAPH_ERROR("can't extend a vertex attribute hash member", IGRAPH_FAILURE);
-        }
-      }
-    }
-  }
-
-  /* Okay, now we added the new attribute values for the already existing
-   * attribute keys. Let's see if we have something left */
-  if (attr) {
-    l=igraph_vector_ptr_size(attr);
-    j=igraph_vcount(graph)-nv;
-    /* j contains the number of vertices EXCLUDING the new ones! */
-    for (k=0; k<l; k++) {
-      if (added_attrs[k]) continue;
-      attr_rec=(igraph_attribute_record_t*)VECTOR(*attr)[k];
-
-      value=PyList_New(j + nv);
-      if (!value) {
-        IGRAPH_ERROR("can't add attributes", IGRAPH_ENOMEM);
-      }
-
-      for (i=0; i<j; i++) {
-        Py_INCREF(Py_None);
-        PyList_SET_ITEM(value, i, Py_None);
-      }
-
-      for (i=0; i<nv; i++) {
-        char *s;
-        PyObject *o;
-        switch (attr_rec->type) {
-        case IGRAPH_ATTRIBUTE_NUMERIC:
-          o=PyFloat_FromDouble((double)VECTOR(*(igraph_vector_t*)attr_rec->value)[i]);
-          break;
-        case IGRAPH_ATTRIBUTE_STRING:
-          igraph_strvector_get((igraph_strvector_t*)attr_rec->value, i, &s);
-          o=PyString_FromString(s);
-          break;
-        default:
-          IGRAPH_WARNING("unsupported attribute type (not string and not numeric)");
-          o=0;
-          break;
-        }
-        if (o) PyList_SET_ITEM(value, i+j, o);
-      }
-
-      /* Invalidate the vertex name index if needed */
-      if (!strcmp(attr_rec->name, "name"))
-        igraphmodule_i_attribute_struct_invalidate_vertex_name_index(ATTR_STRUCT(graph));
-
-      PyDict_SetItemString(dict, attr_rec->name, value);
-      Py_DECREF(value);   /* compensate for PyDict_SetItemString */
-    }
-    free(added_attrs);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return IGRAPH_SUCCESS;
-}
-
-/* Permuting vertices */
-static int igraphmodule_i_attribute_permute_vertices(const igraph_t *graph,
-    igraph_t *newgraph, const igraph_vector_t *idx) {
-  long int n, i;
-  PyObject *key, *value, *dict, *newdict, *newlist, *o;
-  Py_ssize_t pos=0;
-  
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  if (!PyDict_Check(dict)) return 1;
-
-  newdict=PyDict_New();
-  if (!newdict) return 1;
-
-  n=igraph_vector_size(idx);
-  pos=0;
-
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    newlist=PyList_New(n);
-    for (i=0; i<n; i++) {
-      o = PyList_GetItem(value, (Py_ssize_t)VECTOR(*idx)[i]);
-      if (!o) {
-        PyErr_Clear();
-        return 1;
-      }
-      Py_INCREF(o);
-      PyList_SET_ITEM(newlist, i, o);
-    }
-    PyDict_SetItem(newdict, key, newlist);
-    Py_DECREF(newlist);
-  }
-
-  dict = ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_VERTEX];
-  ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_VERTEX]=newdict;
-  Py_DECREF(dict);
-
-  /* Invalidate the vertex name index */
-  igraphmodule_i_attribute_struct_invalidate_vertex_name_index(ATTR_STRUCT(newgraph));
-
-  return 0;
-}
-
-/* Adding edges */
-static int igraphmodule_i_attribute_add_edges(igraph_t *graph, const igraph_vector_t *edges, igraph_vector_ptr_t *attr) {
-  /* Extend the end of every value in the edge hash with ne pieces of None */
-  PyObject *key, *value, *dict;
-  Py_ssize_t pos=0;
-  long int i, j, k, l, ne;
-  igraph_bool_t *added_attrs=0;
-  igraph_attribute_record_t *attr_rec;
-
-  ne=igraph_vector_size(edges)/2;
-  if (!graph->attr) return IGRAPH_SUCCESS;
-  if (ne<0) return IGRAPH_SUCCESS;
-  
-  if (attr) {
-    added_attrs = (igraph_bool_t*)calloc((size_t)igraph_vector_ptr_size(attr),
-                                         sizeof(igraph_bool_t));
-    if (!added_attrs)
-      IGRAPH_ERROR("can't add vertex attributes", IGRAPH_ENOMEM);
-    IGRAPH_FINALLY(free, added_attrs);
-  }
-
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  if (!PyDict_Check(dict)) 
-    IGRAPH_ERROR("edge attribute hash type mismatch", IGRAPH_EINVAL);
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    if (!PyString_Check(key))
-      IGRAPH_ERROR("edge attribute hash key is not a string", IGRAPH_EINVAL);
-    if (!PyList_Check(value))
-      IGRAPH_ERROR("edge attribute hash member is not a list", IGRAPH_EINVAL);
-
-    /* Check if we have specific values for the given attribute */
-    attr_rec=0;
-    if (attr) {
-      j=igraph_vector_ptr_size(attr);
-      for (i=0; i<j; i++) {
-        attr_rec=VECTOR(*attr)[i];
-        if (PyString_IsEqualToASCIIString(key, attr_rec->name)) {
-          added_attrs[i]=1;
-          break;
-        }
-        attr_rec=0;
-      }
-    }
-    /* If we have specific values for the given attribute, attr_rec contains
-     * the appropriate vector. If not, it is null. */
-    if (attr_rec) {
-      for (i=0; i<ne; i++) {
-        char *s;
-        PyObject *o;
-        switch (attr_rec->type) {
-        case IGRAPH_ATTRIBUTE_NUMERIC:
-          o=PyFloat_FromDouble((double)VECTOR(*(igraph_vector_t*)attr_rec->value)[i]);
-          break;
-        case IGRAPH_ATTRIBUTE_STRING:
-          igraph_strvector_get((igraph_strvector_t*)attr_rec->value, i, &s);
-          o=PyString_FromString(s);
-          break;
-        default:
-          IGRAPH_WARNING("unsupported attribute type (not string and not numeric)");
-          o=0;
-          break;
-        }
-        if (o) {
-          if (PyList_Append(value, o) == -1)
-            IGRAPH_ERROR("can't extend an edge attribute hash member", IGRAPH_FAILURE);
-          else Py_DECREF(o);
-        }
-      }
-    } else {
-      for (i=0; i<ne; i++) {
-        if (PyList_Append(value, Py_None) == -1) {
-          IGRAPH_ERROR("can't extend an edge attribute hash member", IGRAPH_FAILURE);
-        }
-      }
-    }
-  }
-  
-  /*pos=0;
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    printf("key: "); PyObject_Print(key, stdout, Py_PRINT_RAW); printf("\n");
-    printf("value: "); PyObject_Print(value, stdout, Py_PRINT_RAW); printf("\n");
-  }*/
-  
-  /* Okay, now we added the new attribute values for the already existing
-   * attribute keys. Let's see if we have something left */
-  if (attr) {
-    l=igraph_vector_ptr_size(attr);
-    j=igraph_ecount(graph)-ne;
-    /* j contains the number of edges EXCLUDING the new ones! */
-    for (k=0; k<l; k++) {
-      if (added_attrs[k]) continue;
-      attr_rec=(igraph_attribute_record_t*)VECTOR(*attr)[k];
-
-      value=PyList_New(j+ne);
-      if (!value) {
-        IGRAPH_ERROR("can't add attributes", IGRAPH_ENOMEM);
-      }
-
-      for (i=0; i<j; i++) {
-        Py_INCREF(Py_None);
-        PyList_SET_ITEM(value, i, Py_None);
-      }
-
-      for (i=0; i<ne; i++) {
-        char *s;
-        PyObject *o;
-        switch (attr_rec->type) {
-        case IGRAPH_ATTRIBUTE_NUMERIC:
-          o=PyFloat_FromDouble((double)VECTOR(*(igraph_vector_t*)attr_rec->value)[i]);
-          break;
-        case IGRAPH_ATTRIBUTE_STRING:
-          igraph_strvector_get((igraph_strvector_t*)attr_rec->value, i, &s);
-          o=PyString_FromString(s);
-          break;
-        default:
-          IGRAPH_WARNING("unsupported attribute type (not string and not numeric)");
-          o=0;
-          break;
-        }
-        if (o) PyList_SET_ITEM(value, i+j, o);
-      }
-
-      PyDict_SetItemString(dict, attr_rec->name, value);
-      Py_DECREF(value);   /* compensate for PyDict_SetItemString */
-    }
-    free(added_attrs);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return IGRAPH_SUCCESS;
-}
-
-/* Deleting edges, currently unused */
-/*
-static void igraphmodule_i_attribute_delete_edges(igraph_t *graph, const igraph_vector_t *idx) {
-  long int n, i, ndeleted=0;
-  PyObject *key, *value, *dict, *o;
-  Py_ssize_t pos=0;
-  
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  if (!PyDict_Check(dict)) return;
-
-  n=igraph_vector_size(idx);
-  for (i=0; i<n; i++) {
-    if (!VECTOR(*idx)[i]) {
-      ndeleted++;
-      continue;
-    }
-
-    pos=0;
-    while (PyDict_Next(dict, &pos, &key, &value)) {
-      o=PyList_GetItem(value, i);
-      if (!o) {
-        PyErr_Clear();
-        return;
-      }
-      Py_INCREF(o);
-      PyList_SetItem(value, VECTOR(*idx)[i]-1, o);
-    }
-  }
-  
-  pos=0;
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    n=PySequence_Size(value);
-    if (PySequence_DelSlice(value, n-ndeleted, n) == -1) return;
-  }
-  
-  return;
-}
-*/
-
-/* Permuting edges */
-static int igraphmodule_i_attribute_permute_edges(const igraph_t *graph,
-    igraph_t *newgraph, const igraph_vector_t *idx) { 
-  long int n, i;
-  PyObject *key, *value, *dict, *newdict, *newlist, *o;
-  Py_ssize_t pos=0;
-
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  if (!PyDict_Check(dict)) return 1;
-
-  newdict=PyDict_New();
-  if (!newdict) return 1;
-
-  n=igraph_vector_size(idx);
-  pos=0;
-
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    newlist=PyList_New(n);
-    for (i=0; i<n; i++) {
-      o=PyList_GetItem(value, (Py_ssize_t)VECTOR(*idx)[i]);
-      if (!o) {
-        PyErr_Clear();
-        return 1;
-      }
-      Py_INCREF(o);
-      PyList_SET_ITEM(newlist, i, o);
-    }
-    PyDict_SetItem(newdict, key, newlist);
-    Py_DECREF(newlist);
-  }
-
-  dict = ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_EDGE];
-  ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_EDGE]=newdict;
-  Py_DECREF(dict);
-
-  return 0;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged, the source
- * attribute values and a Python callable to be called for every merge,
- * returns a new list with the new attribute values. Each new attribute
- * is derived by calling func with the old attributes of the set of
- * merged vertices/edges as the first argument.
- */
-static PyObject* igraphmodule_i_ac_func(PyObject* values,
-    const igraph_vector_ptr_t *merges, PyObject* func) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *list, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    long int j, n = igraph_vector_size(v);
-    list = PyList_New(n);
-    for (j = 0; j < n; j++) {
-      item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[j]);
-      Py_INCREF(item);
-      PyList_SET_ITEM(list, j, item);   /* reference to item stolen */
-    }
-    item = PyObject_CallFunctionObjArgs(func, list, 0);
-    Py_DECREF(list);
-    if (item == 0) {
-      Py_DECREF(res);
-      return 0;
-    }
-    PyList_SET_ITEM(res, i, item);   /* reference to item stolen */
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged, the source
- * attribute values and a name of a Python builtin function,
- * returns a new list with the new attribute values. Each new attribute
- * is derived by calling the given builtin function with the old
- * attributes of the set of merged vertices/edges as the first argument.
- */
-static PyObject* igraphmodule_i_ac_builtin_func(PyObject* values,
-    const igraph_vector_ptr_t *merges, const char* func_name) {
-  static PyObject* builtin_module_dict = 0;
-  PyObject* func = 0;
-
-  if (builtin_module_dict == 0) {
-#ifdef IGRAPH_PYTHON3
-    PyObject* builtin_module = PyImport_ImportModule("builtins");
-#else
-    PyObject* builtin_module = PyImport_ImportModule("__builtin__");
-#endif
-    if (builtin_module == 0)
-      return 0;
-    builtin_module_dict = PyModule_GetDict(builtin_module);
-    Py_DECREF(builtin_module);
-    if (builtin_module_dict == 0)
-      return 0;
-  }
-
-  func = PyDict_GetItemString(builtin_module_dict, func_name);
-  if (func == 0) {
-    PyErr_Format(PyExc_NameError, "no such builtin function; %s", func_name);
-    return 0;
-  }
-
-  return igraphmodule_i_ac_func(values, merges, func);
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the sum of the attributes of
- * the merged vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_sum(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    igraph_real_t num = 0.0, sum = 0.0;
-    long int j, n = igraph_vector_size(v);
-
-    for (j = 0; j < n; j++) {
-      item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[j]);
-      if (igraphmodule_PyObject_to_real_t(item, &num)) {
-        PyErr_SetString(PyExc_TypeError, "product can only be invoked on numeric attributes");
-        Py_DECREF(res);
-        return 0;
-      }
-      sum += num;
-    }
-
-    /* reference to new float stolen */
-    PyList_SET_ITEM(res, i, PyFloat_FromDouble((double)sum));
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the product of the attributes of
- * the merged vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_prod(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    igraph_real_t num = 1.0, prod = 1.0;
-    long int j, n = igraph_vector_size(v);
-
-    for (j = 0; j < n; j++) {
-      item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[j]);
-      if (igraphmodule_PyObject_to_real_t(item, &num)) {
-        PyErr_SetString(PyExc_TypeError, "product can only be invoked on numeric attributes");
-        Py_DECREF(res);
-        return 0;
-      }
-      prod *= num;
-    }
-
-    /* reference to new float stolen */
-    PyList_SET_ITEM(res, i, PyFloat_FromDouble((double)prod));
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the first entry of the set of merged
- * vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_first(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    long int n = igraph_vector_size(v);
-
-    if (n == 0)
-      continue;
-
-    item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[0]);
-    Py_INCREF(item);
-    PyList_SET_ITEM(res, i, item);   /* reference to item stolen */
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from a randomly selected entry of the set of
- * merged vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_random(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item, *num;
-  PyObject *random_module = PyImport_ImportModule("random");
-  PyObject *random_func;
-
-  if (random_module == 0)
-    return 0;
-
-  random_func = PyObject_GetAttrString(random_module, "random");
-  Py_DECREF(random_module);
-
-  if (random_func == 0)
-    return 0;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    long int n = igraph_vector_size(v);
-
-    if (n == 0)
-      continue;
-
-    num = PyObject_CallObject(random_func, 0);
-    if (num == 0) {
-      Py_DECREF(random_func);
-      Py_DECREF(res);
-      return 0;
-    }
-
-    item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[(long int)(n*PyFloat_AsDouble(num))]);
-    Py_INCREF(item);
-    Py_DECREF(num);
-    PyList_SET_ITEM(res, i, item);   /* reference to item stolen */
-  }
-
-  Py_DECREF(random_func);
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the last entry of the set of merged
- * vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_last(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    long int n = igraph_vector_size(v);
-
-    if (n == 0)
-      continue;
-
-    item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[n-1]);
-    Py_INCREF(item);
-    PyList_SET_ITEM(res, i, item);   /* reference to item stolen */
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the mean of the attributes of
- * the merged vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_mean(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    igraph_real_t num = 0.0, mean = 0.0;
-    long int j, n = igraph_vector_size(v);
-
-    for (j = 0; j < n; ) {
-      item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[j]);
-      if (igraphmodule_PyObject_to_real_t(item, &num)) {
-        PyErr_SetString(PyExc_TypeError, "mean can only be invoked on numeric attributes");
-        Py_DECREF(res);
-        return 0;
-      }
-      j++;
-      num -= mean;
-      mean += num / j;
-    }
-
-    /* reference to new float stolen */
-    PyList_SET_ITEM(res, i, PyFloat_FromDouble((double)mean));
-  }
-
-  return res;
-}
-
-/* Auxiliary function for combining vertices/edges. Given a merge list
- * (which specifies the vertex/edge IDs that were merged and the source
- * attribute values, returns a new list with the new attribute values.
- * Each new attribute is derived from the median of the attributes of
- * the merged vertices/edges.
- */
-static PyObject* igraphmodule_i_ac_median(PyObject* values,
-    const igraph_vector_ptr_t *merges) {
-  long int i, len = igraph_vector_ptr_size(merges);
-  PyObject *res, *list, *item;
-
-  res = PyList_New(len);
-  for (i = 0; i < len; i++) {
-    igraph_vector_t *v = (igraph_vector_t*)VECTOR(*merges)[i];
-    long int j, n = igraph_vector_size(v);
-    list = PyList_New(n);
-    for (j = 0; j < n; j++) {
-      item = PyList_GET_ITEM(values, (Py_ssize_t)VECTOR(*v)[j]);
-      Py_INCREF(item);
-      PyList_SET_ITEM(list, j, item);   /* reference to item stolen */
-    }
-    /* sort the list */
-    if (PyList_Sort(list)) {
-      Py_DECREF(list);
-      Py_DECREF(res);
-      return 0;
-    }
-    if (n % 2 == 1) {
-      item = PyList_GET_ITEM(list, n / 2);
-    } else {
-      igraph_real_t num1, num2;
-      item = PyList_GET_ITEM(list, n / 2 - 1);
-      if (igraphmodule_PyObject_to_real_t(item, &num1)) {
-        Py_DECREF(list);
-        Py_DECREF(res);
-        return 0;
-      }
-      item = PyList_GET_ITEM(list, n / 2);
-      if (igraphmodule_PyObject_to_real_t(item, &num2)) {
-        Py_DECREF(list);
-        Py_DECREF(res);
-        return 0;
-      }
-      item = PyFloat_FromDouble((num1 + num2) / 2);
-    }
-    /* reference to item stolen */
-    PyList_SET_ITEM(res, i, item);
-  }
-
-  return res;
-}
-
-static void igraphmodule_i_free_attribute_combination_records(
-    igraph_attribute_combination_record_t* records) {
-  igraph_attribute_combination_record_t* ptr = records;
-  while (ptr->name != 0) {
-    free((char*)ptr->name);
-    ptr++;
-  }
-  free(records);
-}
-
-/* Auxiliary function for the common parts of
- * igraphmodule_i_attribute_combine_vertices and
- * igraphmodule_i_attribute_combine_edges
- */
-static int igraphmodule_i_attribute_combine_dicts(PyObject *dict,
-    PyObject *newdict, const igraph_vector_ptr_t *merges,
-    const igraph_attribute_combination_t *comb) {
-  PyObject *key, *value;
-  Py_ssize_t pos;
-  igraph_attribute_combination_record_t* todo;
-  Py_ssize_t i, n;
-  if (!PyDict_Check(dict) || !PyDict_Check(newdict)) return 1;
-
-  /* Allocate memory for the attribute_combination_records */
-  n = PyDict_Size(dict);
-  todo = (igraph_attribute_combination_record_t*)calloc(
-    n+1, sizeof(igraph_attribute_combination_record_t)
-  );
-  if (todo == 0) {
-    IGRAPH_ERROR("cannot allocate memory for attribute combination", IGRAPH_ENOMEM);
-  }
-  for (i = 0; i < n+1; i++)
-    todo[i].name = 0;       /* sentinel elements */
-  IGRAPH_FINALLY(igraphmodule_i_free_attribute_combination_records, todo);
-
-  /* Collect what to do for each attribute in the source dict */
-  pos = 0; i = 0;
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    todo[i].name = PyString_CopyAsString(key);
-    if (todo[i].name == 0)
-      IGRAPH_ERROR("PyString_CopyAsString failed", IGRAPH_FAILURE);
-    igraph_attribute_combination_query(comb, todo[i].name,
-        &todo[i].type, &todo[i].func);
-    i++;
-  }
-
-  /* Combine the attributes. Here we make use of the fact that PyDict_Next
-   * will iterate over the dict in the same order */
-  pos = 0; i = 0;
-  while (PyDict_Next(dict, &pos, &key, &value)) {
-    PyObject *empty_str;
-    PyObject *func;
-    PyObject *newvalue;
-
-    /* Safety check */
-    if (!PyString_IsEqualToASCIIString(key, todo[i].name)) {
-      IGRAPH_ERROR("PyDict_Next iteration order not consistent. "
-          "This should never happen. Please report the bug to the igraph "
-          "developers!", IGRAPH_FAILURE);
-    }
-
-    newvalue = 0;
-    switch (todo[i].type) {
-      case IGRAPH_ATTRIBUTE_COMBINE_DEFAULT:
-      case IGRAPH_ATTRIBUTE_COMBINE_IGNORE:
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_FUNCTION:
-        func = (PyObject*)todo[i].func;
-        newvalue = igraphmodule_i_ac_func(value, merges, func);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_SUM:
-        newvalue = igraphmodule_i_ac_sum(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_PROD:
-        newvalue = igraphmodule_i_ac_prod(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_MIN:
-        newvalue = igraphmodule_i_ac_builtin_func(value, merges, "min");
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_MAX:
-        newvalue = igraphmodule_i_ac_builtin_func(value, merges, "max");
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_RANDOM:
-        newvalue = igraphmodule_i_ac_random(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_FIRST:
-        newvalue = igraphmodule_i_ac_first(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_LAST:
-        newvalue = igraphmodule_i_ac_last(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_MEAN:
-        newvalue = igraphmodule_i_ac_mean(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_MEDIAN:
-        newvalue = igraphmodule_i_ac_median(value, merges);
-        break;
-
-      case IGRAPH_ATTRIBUTE_COMBINE_CONCAT:
-        empty_str = PyString_FromString("");
-        func = PyObject_GetAttrString(empty_str, "join");
-        newvalue = igraphmodule_i_ac_func(value, merges, func);
-        Py_DECREF(func);
-        Py_DECREF(empty_str);
-        break;
-
-      default:
-        IGRAPH_ERROR("Unsupported combination type. "
-            "This should never happen. Please report the bug to the igraph "
-            "developers!", IGRAPH_FAILURE);
-    }
-
-    if (newvalue) {
-      if (PyDict_SetItem(newdict, key, newvalue)) {
-        Py_DECREF(newvalue);  /* PyDict_SetItem does not steal reference */
-        IGRAPH_ERROR("PyDict_SetItem failed when combining attributes.", IGRAPH_FAILURE);
-      }
-      Py_DECREF(newvalue);    /* PyDict_SetItem does not steal reference */
-    } else {
-      /* We can arrive here for two reasons: first, if the attribute is to
-       * be ignored explicitly; second, if there was an error. */
-      if (PyErr_Occurred()) {
-        IGRAPH_ERROR("Unexpected failure when combining attributes", IGRAPH_FAILURE);
-      }
-    }
-
-    i++;
-  }
-
-  igraphmodule_i_free_attribute_combination_records(todo);
-  IGRAPH_FINALLY_CLEAN(1);
-
-  return 0;
-}
-
-/* Combining vertices */
-static int igraphmodule_i_attribute_combine_vertices(const igraph_t *graph,
-    igraph_t *newgraph, const igraph_vector_ptr_t *merges,
-    const igraph_attribute_combination_t *comb) {
-  PyObject *dict, *newdict;
-  int result;
-
-  /* Get the attribute dicts */
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  newdict=ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_VERTEX];
-
-  /* Combine the attribute dicts */
-  result = igraphmodule_i_attribute_combine_dicts(dict, newdict,
-      merges, comb);
-
-  /* Invalidate vertex name index */
-  igraphmodule_i_attribute_struct_invalidate_vertex_name_index(ATTR_STRUCT(graph));
-
-  return result;
-}
-
-/* Combining edges */
-static int igraphmodule_i_attribute_combine_edges(const igraph_t *graph,
-    igraph_t *newgraph, const igraph_vector_ptr_t *merges,
-    const igraph_attribute_combination_t *comb) {
-  PyObject *dict, *newdict;
-
-  /* Get the attribute dicts */
-  dict=ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  newdict=ATTR_STRUCT_DICT(newgraph)[ATTRHASH_IDX_EDGE];
-
-  return igraphmodule_i_attribute_combine_dicts(dict, newdict,
-      merges, comb);
-}
-
-/* Getting attribute names and types */
-static int igraphmodule_i_attribute_get_info(const igraph_t *graph,
-					     igraph_strvector_t *gnames,
-					     igraph_vector_t *gtypes,
-					     igraph_strvector_t *vnames,
-					     igraph_vector_t *vtypes,
-					     igraph_strvector_t *enames,
-					     igraph_vector_t *etypes) {
-  igraph_strvector_t *names[3] = { gnames, vnames, enames };
-  igraph_vector_t *types[3] = { gtypes, vtypes, etypes };
-  int retval;
-  long int i, j, k, l, m;
-  
-  for (i=0; i<3; i++) {
-    igraph_strvector_t *n = names[i];
-    igraph_vector_t *t = types[i];
-    PyObject *dict = ATTR_STRUCT_DICT(graph)[i];
-    PyObject *keys;
-    PyObject *values;
-    PyObject *o=0;
-    keys=PyDict_Keys(dict);
-    if (!keys) IGRAPH_ERROR("Internal error in PyDict_Keys", IGRAPH_FAILURE);
- 
-    if (n) {
-      retval = igraphmodule_PyList_to_strvector_t(keys, n);
-      if (retval)
-        return retval;
-    }
-    if (t) {
-      k=PyList_Size(keys);
-      igraph_vector_resize(t, k);
-      for (j=0; j<k; j++) {
-        int is_numeric = 1;
-        int is_string = 1;
-        values=PyDict_GetItem(dict, PyList_GetItem(keys, j));
-        if (PyList_Check(values)) {
-          m=PyList_Size(values);
-          for (l=0; l<m && is_numeric; l++) {
-            o=PyList_GetItem(values, l);
-            if (o != Py_None && !PyNumber_Check(o))
-              is_numeric=0;
-          }
-          for (l=0; l<m && is_string; l++) {
-            o=PyList_GetItem(values, l);
-            if (o != Py_None && !PyBaseString_Check(o))
-              is_string=0;
-          }
-        } else {
-          if (values != Py_None && !PyNumber_Check(values))
-            is_numeric=0;
-          if (values != Py_None && !PyBaseString_Check(values))
-            is_string=0;
-        }
-        if (is_numeric)
-          VECTOR(*t)[j] = IGRAPH_ATTRIBUTE_NUMERIC;
-        else if (is_string)
-          VECTOR(*t)[j] = IGRAPH_ATTRIBUTE_STRING;
-        else
-          VECTOR(*t)[j] = IGRAPH_ATTRIBUTE_PY_OBJECT;
-      }
-    }
-    
-    Py_DECREF(keys);
-  }
- 
-  return 0;
-}
-
-/* Checks whether the graph has a graph/vertex/edge attribute with the given name */
-igraph_bool_t igraphmodule_i_attribute_has_attr(const igraph_t *graph,
-						igraph_attribute_elemtype_t type,
-						const char* name) {
-  switch (type) {
-  case IGRAPH_ATTRIBUTE_GRAPH:
-    return igraphmodule_has_graph_attribute(graph, name);
-  case IGRAPH_ATTRIBUTE_VERTEX:
-    return igraphmodule_has_vertex_attribute(graph, name);
-  case IGRAPH_ATTRIBUTE_EDGE:
-    return igraphmodule_has_edge_attribute(graph, name);
-  default:
-    return 0;
-  }
-}
-
-/* Returns the type of a given attribute */
-int igraphmodule_i_attribute_get_type(const igraph_t *graph,
-				      igraph_attribute_type_t *type,
-				      igraph_attribute_elemtype_t elemtype,
-				      const char *name) {
-  long int attrnum, i, j;
-  int is_numeric, is_string;
-  PyObject *o, *dict;
-
-  switch (elemtype) {
-  case IGRAPH_ATTRIBUTE_GRAPH:  attrnum=ATTRHASH_IDX_GRAPH;  break;
-  case IGRAPH_ATTRIBUTE_VERTEX: attrnum=ATTRHASH_IDX_VERTEX; break;
-  case IGRAPH_ATTRIBUTE_EDGE:   attrnum=ATTRHASH_IDX_EDGE;   break;
-  default: IGRAPH_ERROR("No such attribute type", IGRAPH_EINVAL); break;
-  }
-
-  /* Get the attribute dict */
-  dict = ATTR_STRUCT_DICT(graph)[attrnum];
-
-  /* Check whether the attribute exists */
-  o = PyDict_GetItemString(dict, name);
-  if (o == 0) IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-
-  /* Basic type check */
-  if (!PyList_Check(o)) IGRAPH_ERROR("attribute hash type mismatch", IGRAPH_EINVAL);
-  j = PyList_Size(o);
-  if (j == 0) {
-    *type = IGRAPH_ATTRIBUTE_NUMERIC;
-    return 0;
-  }
-
-  /* Go on with the checks */
-  is_numeric = is_string = 1;
-  if (attrnum>0) {
-
-    for (i=0; i<j && is_numeric; i++) {
-      PyObject *item = PyList_GET_ITEM(o, i);
-      if (item != Py_None && !PyNumber_Check(item)) is_numeric=0;
-    }
-    for (i=0; i<j && is_string; i++) {
-      PyObject *item = PyList_GET_ITEM(o, i);
-      if (item != Py_None && !PyBaseString_Check(item))
-        is_string=0;
-    }
-  } else {
-    if (o != Py_None && !PyNumber_Check(o)) is_numeric=0;
-    if (o != Py_None && !PyBaseString_Check(o))
-      is_string=0;
-  }
-  if (is_numeric)
-    *type = IGRAPH_ATTRIBUTE_NUMERIC;
-  else if (is_string)
-    *type = IGRAPH_ATTRIBUTE_STRING;
-  else
-    *type = IGRAPH_ATTRIBUTE_PY_OBJECT;
-  return 0;
-}
-
-/* Getting numeric graph attributes */
-int igraphmodule_i_get_numeric_graph_attr(const igraph_t *graph,
-					  const char *name, igraph_vector_t *value) {
-  PyObject *dict, *o, *result;
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_GRAPH];
-  /* No error checking, if we get here, the type has already been checked by previous
-     attribute handler calls... hopefully :) Same applies for the other handlers. */
-  o = PyDict_GetItemString(dict, name);
-  if (!o) IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  IGRAPH_CHECK(igraph_vector_resize(value, 1));
-  if (o == Py_None) {
-    VECTOR(*value)[0] = IGRAPH_NAN;
-    return 0;
-  }
-  result = PyNumber_Float(o);
-  if (result) {
-    VECTOR(*value)[0] = PyFloat_AsDouble(o);
-    Py_DECREF(result);
-  } else IGRAPH_ERROR("Internal error in PyFloat_AsDouble", IGRAPH_EINVAL); 
-
-  return 0;
-}
-
-/* Getting string graph attributes */
-int igraphmodule_i_get_string_graph_attr(const igraph_t *graph,
-					 const char *name, igraph_strvector_t *value) {
-  PyObject *dict, *o, *str = 0;
-  const char* c_str;
-
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_GRAPH];
-  o = PyDict_GetItemString(dict, name);
-  if (!o)
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-  IGRAPH_CHECK(igraph_strvector_resize(value, 1));
-
-#ifdef IGRAPH_PYTHON3
-  /* For Python 3.x, we simply call PyObject_Str, which produces a
-   * Unicode string, then encode it into UTF-8, except when we
-   * already have a PyBytes object -- this is assumed to be in
-   * UTF-8.
-   */
-  if (PyBytes_Check(o)) {
-    str = o;
-    Py_INCREF(str);
-  } else {
-    PyObject* unicode = PyObject_Str(o);
-    if (unicode == 0)
-      IGRAPH_ERROR("Internal error in PyObject_Str", IGRAPH_EINVAL);
-    str = PyUnicode_AsEncodedString(unicode, "utf-8", "xmlcharrefreplace");
-    Py_DECREF(unicode);
-  }
-
-#else
-  /* For Python 2.x, we check whether we have received a string or a
-   * Unicode string. Unicode strings are encoded into UTF-8, strings
-   * are used intact.
-   */
-  if (PyUnicode_Check(o)) {
-    str = PyUnicode_AsEncodedString(o, "utf-8", "xmlcharrefreplace");
-  } else {
-    str = PyObject_Str(o);
-  }
-#endif
-
-  if (str == 0)
-    IGRAPH_ERROR("Internal error in PyObject_Str", IGRAPH_EINVAL);
-#ifdef IGRAPH_PYTHON3
-  c_str = PyBytes_AS_STRING(str);
-#else
-  c_str = PyString_AS_STRING(str);
-#endif
-  IGRAPH_CHECK(igraph_strvector_set(value, 0, c_str));
-  Py_XDECREF(str);
-
-  return 0;
-}
-
-/* Getting numeric vertex attributes */
-int igraphmodule_i_get_numeric_vertex_attr(const igraph_t *graph,
-					   const char *name,
-					   igraph_vs_t vs,
-					   igraph_vector_t *value) {
-  PyObject *dict, *list, *result, *o;
-  igraph_vector_t newvalue;
-
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  list = PyDict_GetItemString(dict, name);
-  if (!list) IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-
-  if (igraph_vs_is_all(&vs)) {
-    if (igraphmodule_PyObject_float_to_vector_t(list, &newvalue))
-      IGRAPH_ERROR("Internal error", IGRAPH_EINVAL);
-    igraph_vector_update(value, &newvalue);
-    igraph_vector_destroy(&newvalue);
-  } else {
-    igraph_vit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_vit_create(graph, vs, &it));
-    IGRAPH_FINALLY(igraph_vit_destroy, &it);
-    IGRAPH_CHECK(igraph_vector_resize(value, IGRAPH_VIT_SIZE(it)));
-    while (!IGRAPH_VIT_END(it)) {
-      o = PyList_GetItem(list, (Py_ssize_t)IGRAPH_VIT_GET(it));
-      if (o != Py_None) {
-        result = PyNumber_Float(o);
-        VECTOR(*value)[i] = PyFloat_AsDouble(result);
-        Py_XDECREF(result);
-      } else VECTOR(*value)[i] = IGRAPH_NAN;
-      IGRAPH_VIT_NEXT(it);
-      i++;
-    }
-    igraph_vit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return 0;
-}
-
-/* Getting string vertex attributes */
-int igraphmodule_i_get_string_vertex_attr(const igraph_t *graph,
-					  const char *name,
-					  igraph_vs_t vs,
-					  igraph_strvector_t *value) {
-  PyObject *dict, *list, *result;
-  igraph_strvector_t newvalue;
-
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_VERTEX];
-  list = PyDict_GetItemString(dict, name);
-  if (!list)
-    IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-
-  if (igraph_vs_is_all(&vs)) {
-    if (igraphmodule_PyList_to_strvector_t(list, &newvalue))
-      IGRAPH_ERROR("Internal error", IGRAPH_EINVAL);
-    igraph_strvector_destroy(value);
-    *value=newvalue;
-  } else {
-    igraph_vit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_vit_create(graph, vs, &it));
-    IGRAPH_FINALLY(igraph_vit_destroy, &it);
-    IGRAPH_CHECK(igraph_strvector_resize(value, IGRAPH_VIT_SIZE(it)));
-    while (!IGRAPH_VIT_END(it)) {
-      int v=(int)IGRAPH_VIT_GET(it);
-      char* str;
-
-      result = PyList_GetItem(list, v);
-      if (result == 0)
-        IGRAPH_ERROR("null element in PyList", IGRAPH_EINVAL);
-
-      str = PyObject_ConvertToCString(result);
-      if (str == 0)
-        IGRAPH_ERROR("error while calling PyObject_ConvertToCString", IGRAPH_EINVAL);
-
-      /* Note: this is a bit inefficient here, PyObject_ConvertToCString
-       * allocates a new string which could be copied into the string
-       * vector straight away. Instead of that, the string vector makes
-       * another copy. Probably the performance hit is not too severe.
-       */
-      igraph_strvector_set(value, i, str);
-      free(str);
-
-      IGRAPH_VIT_NEXT(it);
-      i++;
-    }
-    igraph_vit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return 0;
-}
-
-/* Getting numeric edge attributes */
-int igraphmodule_i_get_numeric_edge_attr(const igraph_t *graph,
-					 const char *name,
-					 igraph_es_t es,
-					 igraph_vector_t *value) {
-  PyObject *dict, *list, *result, *o;
-  igraph_vector_t newvalue;
-
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  list = PyDict_GetItemString(dict, name);
-  if (!list) IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-
-  if (igraph_es_is_all(&es)) {
-    if (igraphmodule_PyObject_float_to_vector_t(list, &newvalue))
-      IGRAPH_ERROR("Internal error", IGRAPH_EINVAL);
-    igraph_vector_update(value, &newvalue);
-    igraph_vector_destroy(&newvalue);
-  } else {
-    igraph_eit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_eit_create(graph, es, &it));
-    IGRAPH_FINALLY(igraph_eit_destroy, &it);
-    IGRAPH_CHECK(igraph_vector_resize(value, IGRAPH_EIT_SIZE(it)));
-    while (!IGRAPH_EIT_END(it)) {
-      o = PyList_GetItem(list, (Py_ssize_t)IGRAPH_EIT_GET(it));
-      if (o != Py_None) {
-        result = PyNumber_Float(o);
-        VECTOR(*value)[i] = PyFloat_AsDouble(result);
-        Py_XDECREF(result);
-      } else VECTOR(*value)[i] = IGRAPH_NAN;
-      IGRAPH_EIT_NEXT(it);
-      i++;
-    }
-    igraph_eit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return 0;
-}
-
-/* Getting string edge attributes */
-int igraphmodule_i_get_string_edge_attr(const igraph_t *graph,
-					const char *name,
-					igraph_es_t es,
-					igraph_strvector_t *value) {
-  PyObject *dict, *list, *result;
-  igraph_strvector_t newvalue;
-
-  dict = ATTR_STRUCT_DICT(graph)[ATTRHASH_IDX_EDGE];
-  list = PyDict_GetItemString(dict, name);
-  if (!list) IGRAPH_ERROR("No such attribute", IGRAPH_EINVAL);
-
-  if (igraph_es_is_all(&es)) {
-    if (igraphmodule_PyList_to_strvector_t(list, &newvalue))
-      IGRAPH_ERROR("Internal error", IGRAPH_EINVAL);
-    igraph_strvector_destroy(value);
-    *value=newvalue;
-  } else {
-    igraph_eit_t it;
-    long int i=0;
-    IGRAPH_CHECK(igraph_eit_create(graph, es, &it));
-    IGRAPH_FINALLY(igraph_eit_destroy, &it);
-    IGRAPH_CHECK(igraph_strvector_resize(value, IGRAPH_EIT_SIZE(it)));
-    while (!IGRAPH_EIT_END(it)) {
-      char* str;
-
-      result = PyList_GetItem(list, (Py_ssize_t)IGRAPH_EIT_GET(it));
-      if (result == 0)
-        IGRAPH_ERROR("null element in PyList", IGRAPH_EINVAL);
-
-      str = PyObject_ConvertToCString(result);
-      if (str == 0)
-        IGRAPH_ERROR("error while calling PyObject_ConvertToCString", IGRAPH_EINVAL);
-
-      /* Note: this is a bit inefficient here, PyObject_ConvertToCString
-       * allocates a new string which could be copied into the string
-       * vector straight away. Instead of that, the string vector makes
-       * another copy. Probably the performance hit is not too severe.
-       */
-      igraph_strvector_set(value, i, str);
-      free(str);
-
-      IGRAPH_EIT_NEXT(it);
-      i++;
-    }
-    igraph_eit_destroy(&it);
-    IGRAPH_FINALLY_CLEAN(1);
-  }
-
-  return 0;
-}
-
-static igraph_attribute_table_t igraphmodule_attribute_table = {
-  igraphmodule_i_attribute_init,
-  igraphmodule_i_attribute_destroy,
-  igraphmodule_i_attribute_copy,
-  igraphmodule_i_attribute_add_vertices,
-  igraphmodule_i_attribute_permute_vertices,
-  igraphmodule_i_attribute_combine_vertices,
-  igraphmodule_i_attribute_add_edges,
-  igraphmodule_i_attribute_permute_edges,
-  igraphmodule_i_attribute_combine_edges,
-  igraphmodule_i_attribute_get_info,
-  igraphmodule_i_attribute_has_attr,
-  igraphmodule_i_attribute_get_type,
-  igraphmodule_i_get_numeric_graph_attr,
-  igraphmodule_i_get_string_graph_attr,
-  igraphmodule_i_get_numeric_vertex_attr,
-  igraphmodule_i_get_string_vertex_attr,
-  igraphmodule_i_get_numeric_edge_attr,
-  igraphmodule_i_get_string_edge_attr,
-};
-
-void igraphmodule_initialize_attribute_handler(void) {
-  igraph_i_set_attribute_table(&igraphmodule_attribute_table);
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/attributes.h igraph-0.6.5/interfaces/python/src/attributes.h
--- igraph-0.6.5~quantal1/interfaces/python/src/attributes.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/attributes.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,88 +0,0 @@
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PY_IGRAPH_ATTRIBUTES_H
-#define PY_IGRAPH_ATTRIBUTES_H
-
-#include <Python.h>
-#include <igraph_attributes.h>
-#include <igraph_datatype.h>
-#include <igraph_iterators.h>
-#include <igraph_strvector.h>
-#include <igraph_vector.h>
-
-#define ATTRHASH_IDX_GRAPH  0
-#define ATTRHASH_IDX_VERTEX 1
-#define ATTRHASH_IDX_EDGE   2
-
-typedef struct {
-  PyObject* attrs[3];
-  PyObject* vertex_name_index;
-} igraphmodule_i_attribute_struct;
-
-#define ATTR_STRUCT(graph) ((igraphmodule_i_attribute_struct*)((graph)->attr))
-#define ATTR_STRUCT_DICT(graph) ((igraphmodule_i_attribute_struct*)((graph)->attr))->attrs
-#define ATTR_NAME_INDEX(graph) ((igraphmodule_i_attribute_struct*)((graph)->attr))->vertex_name_index
-
-int igraphmodule_i_attribute_get_type(const igraph_t *graph,
-				      igraph_attribute_type_t *type,
-				      igraph_attribute_elemtype_t elemtype,
-				      const char *name);
-int igraphmodule_i_get_numeric_graph_attr(const igraph_t *graph,
-					  const char *name, igraph_vector_t *value);
-int igraphmodule_i_get_numeric_vertex_attr(const igraph_t *graph,
-					   const char *name,
-					   igraph_vs_t vs,
-					   igraph_vector_t *value);
-int igraphmodule_i_get_numeric_edge_attr(const igraph_t *graph,
-					 const char *name,
-					 igraph_es_t es,
-					 igraph_vector_t *value);
-int igraphmodule_i_get_string_graph_attr(const igraph_t *graph,
-					 const char *name, igraph_strvector_t *value);
-int igraphmodule_i_get_string_vertex_attr(const igraph_t *graph,
-					  const char *name,
-					  igraph_vs_t vs,
-					  igraph_strvector_t *value);
-int igraphmodule_i_get_string_edge_attr(const igraph_t *graph,
-					const char *name,
-					igraph_es_t es,
-					igraph_strvector_t *value);
-
-void igraphmodule_initialize_attribute_handler(void);
-void igraphmodule_index_vertex_names(igraph_t *graph, igraph_bool_t force);
-void igraphmodule_invalidate_vertex_name_index(igraph_t *graph);
-int igraphmodule_get_vertex_id_by_name(igraph_t *graph, PyObject* o, igraph_integer_t* id);
-
-PyObject* igraphmodule_create_edge_attribute(const igraph_t* graph,
-    const char* name);
-PyObject* igraphmodule_create_or_get_edge_attribute_values(const igraph_t* graph,
-    const char* name);
-PyObject* igraphmodule_get_edge_attribute_values(const igraph_t* graph,
-    const char* name);
-
-igraph_bool_t igraphmodule_has_graph_attribute(const igraph_t *graph, const char* name);
-igraph_bool_t igraphmodule_has_vertex_attribute(const igraph_t *graph, const char* name);
-igraph_bool_t igraphmodule_has_edge_attribute(const igraph_t *graph, const char* name);
-
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/bfsiter.c igraph-0.6.5/interfaces/python/src/bfsiter.c
--- igraph-0.6.5~quantal1/interfaces/python/src/bfsiter.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/bfsiter.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,261 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "bfsiter.h"
-#include "common.h"
-#include "error.h"
-#include "py2compat.h"
-#include "vertexobject.h"
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_bfsiter BFS iterator object
- */
-
-PyTypeObject igraphmodule_BFSIterType;
-
-/**
- * \ingroup python_interface_bfsiter
- * \brief Allocate a new BFS iterator object for a given graph and a given root
- * \param g the graph object being referenced
- * \param vid the root vertex index
- * \param advanced whether the iterator should be advanced (returning distance and parent as well)
- * \return the allocated PyObject
- */
-PyObject* igraphmodule_BFSIter_new(igraphmodule_GraphObject *g, PyObject *root, igraph_neimode_t mode, igraph_bool_t advanced) {
-  igraphmodule_BFSIterObject* o;
-  long int no_of_nodes, r;
-  
-  o=PyObject_GC_New(igraphmodule_BFSIterObject, &igraphmodule_BFSIterType);
-  Py_INCREF(g);
-  o->gref=g;
-  o->graph=&g->g;
-  
-  if (!PyInt_Check(root) && !PyObject_IsInstance(root, (PyObject*)&igraphmodule_VertexType)) {
-    PyErr_SetString(PyExc_TypeError, "root must be integer or igraph.Vertex");
-    return NULL;
-  }
-  
-  no_of_nodes=igraph_vcount(&g->g);
-  o->visited=(char*)calloc(no_of_nodes, sizeof(char));
-  if (o->visited == 0) {
-    PyErr_SetString(PyExc_MemoryError, "out of memory");
-    return NULL;
-  }
-  
-  if (igraph_dqueue_init(&o->queue, 100)) {
-    PyErr_SetString(PyExc_MemoryError, "out of memory");
-    return NULL;
-  }
-  if (igraph_vector_init(&o->neis, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "out of memory");
-    igraph_dqueue_destroy(&o->queue);
-    return NULL;
-  }
-  
-  if (PyInt_Check(root)) {
-    r=PyInt_AsLong(root);
-  } else {
-    r=((igraphmodule_VertexObject*)root)->idx;
-  }
-  if (igraph_dqueue_push(&o->queue, r) ||
-      igraph_dqueue_push(&o->queue, 0) ||
-      igraph_dqueue_push(&o->queue, -1)) {
-    igraph_dqueue_destroy(&o->queue);
-    igraph_vector_destroy(&o->neis);
-    PyErr_SetString(PyExc_MemoryError, "out of memory");
-    return NULL;
-  }
-  o->visited[r]=1;
-  
-  if (!igraph_is_directed(&g->g)) mode=IGRAPH_ALL;
-  o->mode=mode;
-  o->advanced=advanced;
-  
-  PyObject_GC_Track(o);
-  
-  RC_ALLOC("BFSIter", o);
-  
-  return (PyObject*)o;
-}
-
-/**
- * \ingroup python_interface_bfsiter
- * \brief Support for cyclic garbage collection in Python
- * 
- * This is necessary because the \c igraph.BFSIter object contains several
- * other \c PyObject pointers and they might point back to itself.
- */
-int igraphmodule_BFSIter_traverse(igraphmodule_BFSIterObject *self,
-				  visitproc visit, void *arg) {
-  int vret;
-
-  RC_TRAVERSE("BFSIter", self);
-  
-  if (self->gref) {
-    vret=visit((PyObject*)self->gref, arg);
-    if (vret != 0) return vret;
-  }
-  
-  return 0;
-}
-
-/**
- * \ingroup python_interface_bfsiter
- * \brief Clears the iterator's subobject (before deallocation)
- */
-int igraphmodule_BFSIter_clear(igraphmodule_BFSIterObject *self) {
-  PyObject *tmp;
-
-  PyObject_GC_UnTrack(self);
-  
-  tmp=(PyObject*)self->gref;
-  self->gref=NULL;
-  Py_XDECREF(tmp);
-
-  igraph_dqueue_destroy(&self->queue);
-  igraph_vector_destroy(&self->neis);
-  free(self->visited);
-  self->visited=0;
-  
-  return 0;
-}
-
-/**
- * \ingroup python_interface_bfsiter
- * \brief Deallocates a Python representation of a given BFS iterator object
- */
-void igraphmodule_BFSIter_dealloc(igraphmodule_BFSIterObject* self) {
-  igraphmodule_BFSIter_clear(self);
-
-  RC_DEALLOC("BFSIter", self);
-  
-  PyObject_GC_Del(self);
-}
-
-PyObject* igraphmodule_BFSIter_iter(igraphmodule_BFSIterObject* self) {
-  Py_INCREF(self);
-  return (PyObject*)self;
-}
-
-PyObject* igraphmodule_BFSIter_iternext(igraphmodule_BFSIterObject* self) {
-  if (!igraph_dqueue_empty(&self->queue)) {
-    igraph_integer_t vid = (igraph_integer_t)igraph_dqueue_pop(&self->queue);
-    igraph_integer_t dist = (igraph_integer_t)igraph_dqueue_pop(&self->queue);
-    igraph_integer_t parent = (igraph_integer_t)igraph_dqueue_pop(&self->queue);
-    long int i;
-    
-    if (igraph_neighbors(self->graph, &self->neis, vid, self->mode)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-	
-    for (i=0; i<igraph_vector_size(&self->neis); i++) {
-      igraph_integer_t neighbor = (igraph_integer_t)VECTOR(self->neis)[i];
-      if (self->visited[neighbor]==0) {
-	self->visited[neighbor]=1;
-	if (igraph_dqueue_push(&self->queue, neighbor) ||
-	    igraph_dqueue_push(&self->queue, dist+1) ||
-	    igraph_dqueue_push(&self->queue, vid)) {
-	  igraphmodule_handle_igraph_error();
-	  return NULL;
-	}
-      }
-    }
-
-    if (self->advanced) {
-      PyObject *vertexobj, *parentobj;
-      vertexobj = igraphmodule_Vertex_New(self->gref, vid);
-      if (!vertexobj)
-        return NULL;
-      if (parent >= 0) {
-        parentobj = igraphmodule_Vertex_New(self->gref, parent);
-        if (!parentobj)
-            return NULL;
-      } else {
-        Py_INCREF(Py_None);
-        parentobj=Py_None;
-      }
-      return Py_BuildValue("NlN", vertexobj, (long int)dist, parentobj);
-    } else {
-      return igraphmodule_Vertex_New(self->gref, vid);
-    }
-  } else {
-    return NULL;
-  }
-}
-
-/**
- * \ingroup python_interface_bfsiter
- * Method table for the \c igraph.BFSIter object
- */
-PyMethodDef igraphmodule_BFSIter_methods[] = {
-  {NULL}
-};
-
-/** \ingroup python_interface_bfsiter
- * Python type object referencing the methods Python calls when it performs various operations on
- * a BFS iterator of a graph
- */
-PyTypeObject igraphmodule_BFSIterType =
-{
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.BFSIter",                         // tp_name
-  sizeof(igraphmodule_BFSIterObject),       // tp_basicsize
-  0,                                        // tp_itemsize
-  (destructor)igraphmodule_BFSIter_dealloc, // tp_dealloc
-  0,                                        // tp_print
-  0,                                        // tp_getattr
-  0,                                        // tp_setattr
-  0,                                        /* tp_compare (2.x) / tp_reserved (3.x) */
-  0,                                        // tp_repr
-  0,                                        // tp_as_number
-  0,                                        // tp_as_sequence
-  0,                                        // tp_as_mapping
-  0,                                        // tp_hash
-  0,                                        // tp_call
-  0,                                        // tp_str
-  0,                                        // tp_getattro
-  0,                                        // tp_setattro
-  0,                                        // tp_as_buffer
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_HAVE_GC, // tp_flags
-  "igraph BFS iterator object",             // tp_doc
-  (traverseproc) igraphmodule_BFSIter_traverse, /* tp_traverse */
-  (inquiry) igraphmodule_BFSIter_clear,     /* tp_clear */
-  0,                                        // tp_richcompare
-  0,                                        // tp_weaklistoffset
-  (getiterfunc)igraphmodule_BFSIter_iter,   /* tp_iter */
-  (iternextfunc)igraphmodule_BFSIter_iternext, /* tp_iternext */
-  0,                                        /* tp_methods */
-  0,                                        /* tp_members */
-  0,                                        /* tp_getset */
-  0,                                        /* tp_base */
-  0,                                        /* tp_dict */
-  0,                                        /* tp_descr_get */
-  0,                                        /* tp_descr_set */
-  0,                                        /* tp_dictoffset */
-  0,                                        /* tp_init */
-  0,                                        /* tp_alloc */
-  0,                                        /* tp_new */
-  0,                                        /* tp_free */
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/bfsiter.h igraph-0.6.5/interfaces/python/src/bfsiter.h
--- igraph-0.6.5~quantal1/interfaces/python/src/bfsiter.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/bfsiter.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_BFSITER_H
-#define PYTHON_BFSITER_H
-
-#include <Python.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface_bfsiter
- * \brief A structure representing a BFS iterator of a graph
- */
-typedef struct
-{
-  PyObject_HEAD
-  igraphmodule_GraphObject* gref;
-  igraph_dqueue_t queue;
-  igraph_vector_t neis;
-  igraph_t *graph;
-  char *visited;
-  igraph_neimode_t mode;
-  igraph_bool_t advanced;
-} igraphmodule_BFSIterObject;
-
-PyObject* igraphmodule_BFSIter_new(igraphmodule_GraphObject *g, PyObject *o, igraph_neimode_t mode, igraph_bool_t advanced);
-int igraphmodule_BFSIter_traverse(igraphmodule_BFSIterObject *self,
-				  visitproc visit, void *arg);
-int igraphmodule_BFSIter_clear(igraphmodule_BFSIterObject *self);
-void igraphmodule_BFSIter_dealloc(igraphmodule_BFSIterObject* self);
-
-extern PyTypeObject igraphmodule_BFSIterType;
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/common.c igraph-0.6.5/interfaces/python/src/common.c
--- igraph-0.6.5~quantal1/interfaces/python/src/common.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/common.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,68 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "common.h"
-#include "structmember.h"
-
-/**
- * \ingroup python_interface
- * \brief Handler function for all unimplemented \c igraph.Graph methods
- * 
- * This function is called whenever an unimplemented \c igraph.Graph method
- * is called ("unimplemented" meaning that there is a method name in the
- * method table of \c igraph.Graph , but there isn't any working implementation
- * either because the underlying \c igraph API might be subject to change
- * or because the calling format from Python is not decided yet (or maybe
- * because of laziness or lack of time ;))
- * 
- * All of the parameters are ignored, they are here just to make the
- * function satisfy the requirements of \c PyCFunction, thus allowing it
- * to be included in a method table.
- * 
- * \return NULL
- */
-PyObject* igraphmodule_unimplemented(PyObject* self, PyObject* args, PyObject* kwds)
-{
-   PyErr_SetString(PyExc_NotImplementedError, "This method is unimplemented.");
-   return NULL;
-}
-
-/**
- * \ingroup python_interface
- * \brief Resolves a weak reference to an \c igraph.Graph
- * \return the \c igraph.Graph object or NULL if the weak reference is dead.
- * Sets an exception in the latter case.
- */
-PyObject* igraphmodule_resolve_graph_weakref(PyObject* ref) {
-  PyObject *o;
-  
-  if (!PyWeakref_Check(ref)) {
-    PyErr_SetString(PyExc_TypeError, "weak reference expected");
-    return NULL;
-  }
-  o=PyWeakref_GetObject(ref);
-  if (o == Py_None) {
-    PyErr_SetString(PyExc_TypeError, "underlying graph has already been destroyed");
-    return NULL;
-  }
-  return o;
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/common.h igraph-0.6.5/interfaces/python/src/common.h
--- igraph-0.6.5~quantal1/interfaces/python/src/common.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/common.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,70 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_COMMON_H
-#define PYTHON_COMMON_H
-
-#include <Python.h>
-
-#ifdef RC_DEBUG
-#  define RC_ALLOC(T, P) fprintf(stderr, "[ alloc ] " T " @ %p\n", P)
-#  define RC_DECREF(T, P) fprintf(stderr, "[ ref - ] " T " @ %p (was: %d)\n", P, (int)P->ob_refcnt);
-#  define RC_INCREF(T, P) fprintf(stderr, "[ ref + ] " T " @ %p (was: %d)\n", P, (int)P->ob_refcnt);
-#  define RC_PRINT(P) fprintf(stderr, "[refcntr] %s @ %p = %d\n", ((PyTypeObject*)P->ob_type)->tp_name, P, (int)P->ob_refcnt);
-#  define RC_DEALLOC(T, P) fprintf(stderr, "[dealloc] " T " @ %p\n", P);
-#  define RC_TRAVERSE(T, P)
-#else
-#  define RC_ALLOC(T, P)
-#  define RC_DECREF(T, P)
-#  define RC_INCREF(T, P)
-#  define RC_PRINT(P)
-#  define RC_DEALLOC(T, P)
-#  define RC_TRAVERSE(T, P)
-#endif
-
-/* Compatibility stuff for Python 2.3 */
-#ifndef Py_RETURN_TRUE
-#define Py_RETURN_TRUE { Py_INCREF(Py_True); return Py_True; }
-#endif
-
-#ifndef Py_RETURN_FALSE
-#define Py_RETURN_FALSE { Py_INCREF(Py_False); return Py_False; }
-#endif
-
-#ifndef Py_RETURN_NONE
-#define Py_RETURN_NONE { Py_INCREF(Py_None); return Py_None; }
-#endif
-
-/* Compatibility stuff for Python 2.4 */
-#if (PY_MAJOR_VERSION <= 2) & (PY_MINOR_VERSION <= 4)
-#define lenfunc inquiry
-#define ssizeargfunc intargfunc
-#define ssizessizeargfunc intintargfunc
-#define Py_ssize_t int
-#endif
-
-#define ATTRIBUTE_TYPE_VERTEX 1
-#define ATTRIBUTE_TYPE_EDGE 2
-
-PyObject* igraphmodule_unimplemented(PyObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_resolve_graph_weakref(PyObject* ref);
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/convert.c igraph-0.6.5/interfaces/python/src/convert.c
--- igraph-0.6.5~quantal1/interfaces/python/src/convert.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/convert.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,2746 +0,0 @@
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-/************************ Miscellaneous functions *************************/
-
-#include <Python.h>
-#include <limits.h>
-#include "attributes.h"
-#include "graphobject.h"
-#include "vertexseqobject.h"
-#include "vertexobject.h"
-#include "edgeseqobject.h"
-#include "edgeobject.h"
-#include "convert.h"
-#include "error.h"
-#include "memory.h"
-#include "py2compat.h"
-
-/**
- * \brief Converts a Python integer to a C int
- *
- * This is similar to PyInt_AsLong, but it checks for overflow first and throws
- * an exception if necessary.
- *
- * Returns -1 if there was an error, 0 otherwise.
- */
-int PyInt_AsInt(PyObject* obj, int* result) {
-  long dummy = PyInt_AsLong(obj);
-  if (dummy < INT_MIN) {
-    PyErr_SetString(PyExc_OverflowError,
-        "integer too small for conversion to C int");
-    return -1;
-  }
-  if (dummy > INT_MAX) {
-    PyErr_SetString(PyExc_OverflowError,
-        "integer too large for conversion to C int");
-    return -1;
-  }
-  *result = (int)dummy;
-  return 0;
-}
-
-/**
- * \brief Converts a Python long to a C int
- *
- * This is similar to PyLong_AsLong, but it checks for overflow first and
- * throws an exception if necessary.
- *
- * Returns -1 if there was an error, 0 otherwise.
- */
-int PyLong_AsInt(PyObject* obj, int* result) {
-  long dummy = PyLong_AsLong(obj);
-  if (dummy < INT_MIN) {
-    PyErr_SetString(PyExc_OverflowError,
-        "long integer too small for conversion to C int");
-    return -1;
-  }
-  if (dummy > INT_MAX) {
-    PyErr_SetString(PyExc_OverflowError,
-        "long integer too large for conversion to C int");
-    return -1;
-  }
-  *result = (int)dummy;
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to a corresponding igraph enum.
- *
- * The numeric value is returned as an integer that must be converted
- * explicitly to the corresponding igraph enum type. This is to allow one
- * to use the same common conversion routine for multiple enum types.
- *
- * \param o a Python object to be converted
- * \param translation the translation table between strings and the
- *   enum values. Strings are treated as case-insensitive, but it is
- *   assumed that the translation table keys are lowercase. The last
- *   entry of the table must contain NULL values.
- * \param result the result is returned here. The default value must be
- *   passed in before calling this function, since this value is
- *   returned untouched if the given Python object is Py_None.
- * \return 0 if everything is OK, 1 otherwise. An appropriate exception
- *   is raised in this case.
- */
-int igraphmodule_PyObject_to_enum(PyObject *o,
-  igraphmodule_enum_translation_table_entry_t* table,
-  int *result) {
-    char *s, *s2;
-    int i, best, best_result, best_unique;
-    
-    if (o == 0 || o == Py_None)
-      return 0;
-    if (PyInt_Check(o))
-      return PyInt_AsInt(o, result);
-    if (PyLong_Check(o))
-      return PyLong_AsInt(o, result);
-    s = PyString_CopyAsString(o);
-    if (s == 0) {
-        PyErr_SetString(PyExc_TypeError, "int, long or string expected");
-        return -1;
-    }
-    /* Convert string to lowercase */
-    for (s2=s; *s2; s2++)
-      *s2 = tolower(*s2);
-    best = 0; best_unique = 0; best_result = -1;
-    /* Search for matches */
-    while (table->name != 0) {
-        if (strcmp(s, table->name) == 0) {
-          *result = table->value;
-          free(s);
-          return 0;
-        }
-        for (i=0; s[i] == table->name[i]; i++);
-        if (i > best) {
-            best = i; best_unique = 1; best_result = table->value;
-        } else if (i == best) best_unique = 0;
-        table++;
-    }
-    free(s);
-    if (best_unique) { *result = best_result; return 0; }
-    PyErr_SetObject(PyExc_ValueError, o);
-    return -1;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_neimode_t
- */
-int igraphmodule_PyObject_to_neimode_t(PyObject *o,
-  igraph_neimode_t *result) {
-  static igraphmodule_enum_translation_table_entry_t neimode_tt[] = {
-        {"in", IGRAPH_IN},
-        {"out", IGRAPH_OUT},
-        {"all", IGRAPH_ALL},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, neimode_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_add_weights_t
- */
-int igraphmodule_PyObject_to_add_weights_t(PyObject *o,
-  igraph_add_weights_t *result) {
-  static igraphmodule_enum_translation_table_entry_t add_weights_tt[] = {
-        {"true", IGRAPH_ADD_WEIGHTS_YES},
-        {"yes", IGRAPH_ADD_WEIGHTS_YES},
-        {"false", IGRAPH_ADD_WEIGHTS_NO},
-        {"no", IGRAPH_ADD_WEIGHTS_NO},
-        {"auto", IGRAPH_ADD_WEIGHTS_IF_PRESENT},
-        {"if_present", IGRAPH_ADD_WEIGHTS_IF_PRESENT},
-        {0,0}
-    };
-
-  if (o == Py_True) {
-    *result = IGRAPH_ADD_WEIGHTS_YES;
-    return 0;
-  }
-
-  if (o == Py_False) {
-    *result = IGRAPH_ADD_WEIGHTS_NO;
-    return 0;
-  }
-
-  return igraphmodule_PyObject_to_enum(o, add_weights_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_adjacency_t
- */
-int igraphmodule_PyObject_to_adjacency_t(PyObject *o,
-  igraph_adjacency_t *result) {
-  static igraphmodule_enum_translation_table_entry_t adjacency_tt[] = {
-        {"directed", IGRAPH_ADJ_DIRECTED},
-        {"undirected", IGRAPH_ADJ_UNDIRECTED},
-        {"upper", IGRAPH_ADJ_UPPER},
-        {"lower", IGRAPH_ADJ_LOWER},
-        {"minimum", IGRAPH_ADJ_MIN},
-        {"maximum", IGRAPH_ADJ_MAX},
-        {"plus", IGRAPH_ADJ_PLUS},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, adjacency_tt, (int*)result);
-}
-
-int igraphmodule_PyObject_to_attribute_combination_type_t(PyObject* o,
-    igraph_attribute_combination_type_t *result) {
-  static igraphmodule_enum_translation_table_entry_t attribute_combination_type_tt[] = {
-        {"ignore", IGRAPH_ATTRIBUTE_COMBINE_IGNORE},
-        {"sum", IGRAPH_ATTRIBUTE_COMBINE_SUM},
-        {"product", IGRAPH_ATTRIBUTE_COMBINE_PROD},
-        {"min", IGRAPH_ATTRIBUTE_COMBINE_MIN},
-        {"max", IGRAPH_ATTRIBUTE_COMBINE_MAX},
-        {"random", IGRAPH_ATTRIBUTE_COMBINE_RANDOM},
-        {"first", IGRAPH_ATTRIBUTE_COMBINE_FIRST},
-        {"last", IGRAPH_ATTRIBUTE_COMBINE_LAST},
-        {"mean", IGRAPH_ATTRIBUTE_COMBINE_MEAN},
-        {"median", IGRAPH_ATTRIBUTE_COMBINE_MEDIAN},
-        {"concatenate", IGRAPH_ATTRIBUTE_COMBINE_CONCAT},
-        {0, 0}
-  };
-
-  if (o == Py_None) {
-    *result = IGRAPH_ATTRIBUTE_COMBINE_IGNORE;
-    return 0;
-  }
-
-  if (PyCallable_Check(o)) {
-    *result = IGRAPH_ATTRIBUTE_COMBINE_FUNCTION;
-    return 0;
-  }
-
-  return igraphmodule_PyObject_to_enum(o, attribute_combination_type_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_barabasi_algorithm_t
- */
-int igraphmodule_PyObject_to_barabasi_algorithm_t(PyObject *o,
-  igraph_barabasi_algorithm_t *result) {
-  static igraphmodule_enum_translation_table_entry_t barabasi_algorithm_tt[] = {
-        {"bag", IGRAPH_BARABASI_BAG},
-        {"psumtree", IGRAPH_BARABASI_PSUMTREE},
-        {"psumtree_multiple", IGRAPH_BARABASI_PSUMTREE_MULTIPLE},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, barabasi_algorithm_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_connectedness_t
- */
-int igraphmodule_PyObject_to_connectedness_t(PyObject *o,
-  igraph_connectedness_t *result) {
-  static igraphmodule_enum_translation_table_entry_t connectedness_tt[] = {
-        {"weak", IGRAPH_WEAK},
-        {"string", IGRAPH_STRONG},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, connectedness_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_vconn_nei_t
- */
-int igraphmodule_PyObject_to_vconn_nei_t(PyObject *o,
-  igraph_vconn_nei_t *result) {
-  static igraphmodule_enum_translation_table_entry_t vconn_nei_tt[] = {
-        {"error", IGRAPH_VCONN_NEI_ERROR},
-        {"negative", IGRAPH_VCONN_NEI_NEGATIVE},
-        {"number_of_nodes", IGRAPH_VCONN_NEI_NUMBER_OF_NODES},
-        {"nodes", IGRAPH_VCONN_NEI_NUMBER_OF_NODES},
-        {"ignore", IGRAPH_VCONN_NEI_IGNORE},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, vconn_nei_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_bliss_sh_t
- */
-int igraphmodule_PyObject_to_bliss_sh_t(PyObject *o,
-  igraph_bliss_sh_t *result) {
-  static igraphmodule_enum_translation_table_entry_t bliss_sh_tt[] = {
-        {"f", IGRAPH_BLISS_F},
-        {"fl", IGRAPH_BLISS_FL},
-        {"fs", IGRAPH_BLISS_FS},
-        {"fm", IGRAPH_BLISS_FM},
-        {"flm", IGRAPH_BLISS_FLM},
-        {"fsm", IGRAPH_BLISS_FSM},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, bliss_sh_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_community_comparison_t
- */
-int igraphmodule_PyObject_to_community_comparison_t(PyObject *o,
-                  igraph_community_comparison_t *result) {
-  static igraphmodule_enum_translation_table_entry_t commcmp_tt[] = {
-        {"vi", IGRAPH_COMMCMP_VI},
-        {"meila", IGRAPH_COMMCMP_VI},
-        {"nmi", IGRAPH_COMMCMP_NMI},
-        {"danon", IGRAPH_COMMCMP_NMI},
-        {"split-join", IGRAPH_COMMCMP_SPLIT_JOIN},
-        {"rand", IGRAPH_COMMCMP_RAND},
-        {"adjusted_rand", IGRAPH_COMMCMP_ADJUSTED_RAND},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, commcmp_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_degseq_t
- */
-int igraphmodule_PyObject_to_degseq_t(PyObject *o,
-  igraph_degseq_t *result) {
-  static igraphmodule_enum_translation_table_entry_t degseq_tt[] = {
-        {"simple", IGRAPH_DEGSEQ_SIMPLE},
-        {"no_multiple", IGRAPH_DEGSEQ_SIMPLE_NO_MULTIPLE},
-        {"vl", IGRAPH_DEGSEQ_VL},
-        {"viger-latapy", IGRAPH_DEGSEQ_VL},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, degseq_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_fas_algorithm_t
- */
-int igraphmodule_PyObject_to_fas_algorithm_t(PyObject *o,
-  igraph_fas_algorithm_t *result) {
-  static igraphmodule_enum_translation_table_entry_t fas_algorithm_tt[] = {
-        {"approx_eades", IGRAPH_FAS_APPROX_EADES},
-        {"eades", IGRAPH_FAS_APPROX_EADES},
-        {"exact", IGRAPH_FAS_EXACT_IP},
-        {"exact_ip", IGRAPH_FAS_EXACT_IP},
-        {"ip", IGRAPH_FAS_EXACT_IP},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, fas_algorithm_tt, (int*)result);
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_reciprocity_t
- */
-int igraphmodule_PyObject_to_reciprocity_t(PyObject *o, igraph_reciprocity_t *result) {
-  static igraphmodule_enum_translation_table_entry_t reciprocity_tt[] = {
-    {"default", IGRAPH_RECIPROCITY_DEFAULT},
-    {"ratio", IGRAPH_RECIPROCITY_RATIO},
-    {0,0}
-  };
-
-  return igraphmodule_PyObject_to_enum(o, reciprocity_tt, (int*)result);
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_rewiring_t
- */
-int igraphmodule_PyObject_to_rewiring_t(PyObject *o, igraph_rewiring_t *result) {
-  static igraphmodule_enum_translation_table_entry_t rewiring_tt[] = {
-    {"simple", IGRAPH_REWIRING_SIMPLE},
-    {"simple_loops", IGRAPH_REWIRING_SIMPLE_LOOPS},
-    {"loops", IGRAPH_REWIRING_SIMPLE_LOOPS},
-    {0,0}
-  };
-
-  return igraphmodule_PyObject_to_enum(o, rewiring_tt, (int*)result);
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_spinglass_implementation_t
- */
-int igraphmodule_PyObject_to_spinglass_implementation_t(PyObject *o, igraph_spinglass_implementation_t *result) {
-  static igraphmodule_enum_translation_table_entry_t spinglass_implementation_tt[] = {
-    {"original", IGRAPH_SPINCOMM_IMP_ORIG},
-    {"negative", IGRAPH_SPINCOMM_IMP_NEG},
-    {0,0}
-  };
-
-  return igraphmodule_PyObject_to_enum(o, spinglass_implementation_tt, (int*)result);
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_spincomm_update_t
- */
-int igraphmodule_PyObject_to_spincomm_update_t(PyObject *o, igraph_spincomm_update_t *result) {
-  static igraphmodule_enum_translation_table_entry_t spincomm_update_tt[] = {
-    {"simple", IGRAPH_SPINCOMM_UPDATE_SIMPLE},
-    {"config", IGRAPH_SPINCOMM_UPDATE_CONFIG},
-    {0,0}
-  };
-
-  return igraphmodule_PyObject_to_enum(o, spincomm_update_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_star_mode_t
- */
-int igraphmodule_PyObject_to_star_mode_t(PyObject *o,
-  igraph_star_mode_t *result) {
-  static igraphmodule_enum_translation_table_entry_t star_mode_tt[] = {
-        {"in", IGRAPH_STAR_IN},
-        {"out", IGRAPH_STAR_OUT},
-        {"mutual", IGRAPH_STAR_MUTUAL},
-        {"undirected", IGRAPH_STAR_UNDIRECTED},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, star_mode_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_subgraph_implementation_t
- */
-int igraphmodule_PyObject_to_subgraph_implementation_t(PyObject *o,
-  igraph_subgraph_implementation_t *result) {
-  static igraphmodule_enum_translation_table_entry_t subgraph_impl_tt[] = {
-        {"auto", IGRAPH_SUBGRAPH_AUTO},
-        {"copy_and_delete", IGRAPH_SUBGRAPH_COPY_AND_DELETE},
-        {"old", IGRAPH_SUBGRAPH_COPY_AND_DELETE},
-        {"create_from_scratch", IGRAPH_SUBGRAPH_CREATE_FROM_SCRATCH},
-        {"new", IGRAPH_SUBGRAPH_CREATE_FROM_SCRATCH},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, subgraph_impl_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_to_undirected_t
- */
-int igraphmodule_PyObject_to_to_undirected_t(PyObject *o,
-  igraph_to_undirected_t *result) {
-  static igraphmodule_enum_translation_table_entry_t to_undirected_tt[] = {
-        {"each",     IGRAPH_TO_UNDIRECTED_EACH},
-        {"collapse", IGRAPH_TO_UNDIRECTED_COLLAPSE},
-        {"mutual",   IGRAPH_TO_UNDIRECTED_MUTUAL},
-        {0,0}
-  };
-
-  if (o == Py_True) {
-    *result = IGRAPH_TO_UNDIRECTED_COLLAPSE;
-    return 0;
-  } else if (o == Py_False) {
-    *result = IGRAPH_TO_UNDIRECTED_EACH;
-    return 0;
-  }
-
-  return igraphmodule_PyObject_to_enum(o, to_undirected_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an \c igraph_transitivity_mode_t
- */
-int igraphmodule_PyObject_to_transitivity_mode_t(PyObject *o,
-  igraph_transitivity_mode_t *result) {
-  static igraphmodule_enum_translation_table_entry_t transitivity_mode_tt[] = {
-        {"zero", IGRAPH_TRANSITIVITY_ZERO},
-        {"0", IGRAPH_TRANSITIVITY_ZERO},
-        {"nan", IGRAPH_TRANSITIVITY_NAN},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, transitivity_mode_tt, (int*)result);
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_tree_mode_t
- */
-int igraphmodule_PyObject_to_tree_mode_t(PyObject *o,
-  igraph_tree_mode_t *result) {
-  static igraphmodule_enum_translation_table_entry_t tree_mode_tt[] = {
-        {"in", IGRAPH_TREE_IN},
-        {"out", IGRAPH_TREE_OUT},
-        {"all", IGRAPH_TREE_UNDIRECTED},
-        {"undirected", IGRAPH_TREE_UNDIRECTED},
-        {"tree_in", IGRAPH_TREE_IN},
-        {"tree_out", IGRAPH_TREE_OUT},
-        {"tree_all", IGRAPH_TREE_UNDIRECTED},
-        {0,0}
-    };
-
-  return igraphmodule_PyObject_to_enum(o, tree_mode_tt, (int*)result);
-}
-
-/**
- * \brief Extracts a pointer to the internal \c igraph_t from a graph object
- *
- * Raises suitable Python exceptions when needed.
- *
- * \param object the Python object to be converted. If it is Py_None, the
- *               result pointer is untouched (so it should be null by default).
- * \param result the pointer is stored here
- *
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_igraph_t(PyObject *o, igraph_t **result) {
-  if (o == Py_None)
-    return 0;
-
-  if (!PyObject_TypeCheck(o, &igraphmodule_GraphType)) {
-    PyErr_Format(PyExc_TypeError,
-        "expected graph object, got %s", o->ob_type->tp_name);
-    return 1;
-  }
-
-  *result = &((igraphmodule_GraphObject*)o)->g;
-  return 0;
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_integer_t
- *
- * Raises suitable Python exceptions when needed.
- *
- * \param object the Python object to be converted
- * \param v the result is returned here
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_integer_t(PyObject *object, igraph_integer_t *v) {
-  int retval, num;
-
-  if (object == NULL) {
-  } else if (PyLong_Check(object)) {
-    retval = PyLong_AsInt(object, &num);
-    if (retval)
-      return retval;
-    *v = num;
-    return 0;
-#ifdef IGRAPH_PYTHON3
-  } else if (PyNumber_Check(object)) {
-    PyObject *i = PyNumber_Int(object);
-    if (i == NULL)
-      return 1;
-    retval = PyInt_AsInt(i, &num);
-    Py_DECREF(i);
-    if (retval)
-      return retval;
-    *v = num;
-    return 0;
-  }
-#else
-  } else if (PyInt_Check(object)) {
-    retval = PyInt_AsInt(object, &num);
-    if (retval)
-      return retval;
-    *v = num;
-    return 0;
-  } else if (PyNumber_Check(object)) {
-    PyObject *i = PyNumber_Int(object);
-    if (i == NULL)
-      return 1;
-    retval = PyInt_AsInt(i, &num);
-    Py_DECREF(i);
-    if (retval)
-      return retval;
-    *v = num;
-    return 0;
-  }
-#endif
-  PyErr_BadArgument();
-  return 1;
-}
-
-/**
- * \brief Converts a Python object to an igraph \c igraph_real_t
- *
- * Raises suitable Python exceptions when needed.
- *
- * \param object the Python object to be converted
- * \param v the result is returned here
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_real_t(PyObject *object, igraph_real_t *v) {
-  if (object == NULL) {
-  } else if (PyLong_Check(object)) {
-    double d = PyLong_AsDouble(object);
-    *v=(igraph_real_t)d;
-    return 0;
-#ifndef IGRAPH_PYTHON3
-  } else if (PyInt_Check(object)) {
-    long l = PyInt_AS_LONG((PyIntObject*)object);
-    *v=(igraph_real_t)l;
-    return 0;
-#endif
-  } else if (PyFloat_Check(object)) {
-    double d = PyFloat_AS_DOUBLE((PyFloatObject*)object);
-    *v=(igraph_real_t)d;
-    return 0;
-  } else if (PyNumber_Check(object)) {
-    PyObject *i = PyNumber_Float(object);
-    double d;
-    if (i == NULL) return 1;
-    d = PyFloat_AS_DOUBLE((PyFloatObject*)i);
-    Py_DECREF(i);
-    *v = (igraph_real_t)d;
-    return 0;
-  }
-  PyErr_BadArgument();
-  return 1;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python object to an igraph \c igraph_vector_t
- * The incoming \c igraph_vector_t should be uninitialized. Raises suitable
- * Python exceptions when needed.
- * 
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_t containing the result
- * \param need_non_negative if true, checks whether all elements are non-negative
- * \param pairs if true, assumes that every list element is a pair of integers
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vector_t(PyObject *list, igraph_vector_t *v, igraph_bool_t need_non_negative, igraph_bool_t pairs) {
-  PyObject *item, *i1, *i2;
-  Py_ssize_t i, j, k;
-  int ok;
-  long int idx=0, idx2=0;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    if (pairs)
-      PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing integer pairs");
-    else
-      PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing integers");
-    return 1;
-  }
-
-  if (PySequence_Check(list)) {
-    ok=1;
-    
-    if (pairs && PyTuple_Check(list) && PyTuple_Size(list)==2 &&
-        PyInt_Check(PyTuple_GetItem(list,0)) &&
-        PyInt_Check(PyTuple_GetItem(list,1))) {
-      /* a pair was given instead of a list */
-      /* Assume that the user meant a list consisting of this single pair */
-      i1=i2=NULL;
-      i1=PyTuple_GetItem(list, 0);
-      if (i1) i2=PyTuple_GetItem(list, 1);
-      if (i1 && i2) {
-        idx=PyInt_AsLong(i1); idx2=PyInt_AsLong(i2);
-        if (need_non_negative && (idx<0 || idx2<0)) ok=0;
-      } else ok=0;
-      if (ok) {
-        igraph_vector_init(v, 2);
-        VECTOR(*v)[0]=(igraph_real_t)idx;
-        VECTOR(*v)[1]=(igraph_real_t)idx2;
-        return 0;
-      } else if (!ok && need_non_negative) {
-        PyErr_SetString(PyExc_TypeError, "sequence elements must be non-negative integers");
-        return 1;
-      } else {
-        PyErr_SetString(PyExc_TypeError, "sequence elements must be integers");
-        return 1;
-      }
-    }
-  } else if (!pairs && PyInt_Check(list)) {
-    /* a single integer was given instead of a list */
-    /* Let's assume that the user meant a list consisting of this single item */
-    igraph_vector_init(v, 1);
-    VECTOR(*v)[0]=(igraph_real_t)PyInt_AsLong(list);
-    return 0;
-  } else if (!pairs && PyLong_Check(list)) {
-    /* a single long was given instead of a list */
-    /* Let's assume that the user meant a list consisting of this single item */
-    igraph_vector_init(v, 1);
-    VECTOR(*v)[0]=(igraph_real_t)PyLong_AsDouble(list);
-    return 0;
-  }
-
-  if (!PySequence_Check(list)) {
-    /* try to use an iterator */
-    PyObject *it = PyObject_GetIter(list);
-    if (it) {
-      PyObject *item;
-      igraph_vector_init(v, 0);
-      while ((item = PyIter_Next(it)) != 0) {
-        ok = 1;
-        if (pairs) {
-          if (!PySequence_Check(item) || PySequence_Size(item) != 2) {
-            PyErr_SetString(PyExc_TypeError, "iterable must return pairs of integers");
-            ok=0;
-          } else {
-            i1=i2=NULL;
-            i1=PySequence_GetItem(item, 0);
-            if (i1) i2=PySequence_GetItem(item, 1);
-            if (i1 && i2 && PyInt_Check(i1) && PyInt_Check(i2)) {
-              idx=PyInt_AsLong(i1); idx2=PyInt_AsLong(i2);
-              if (need_non_negative && (idx<0 || idx2<0)) {
-                PyErr_SetString(PyExc_ValueError, "iterable must return non-negative integer pairs");
-                ok=0;
-              }
-            } else {
-              PyErr_SetString(PyExc_ValueError, "iterable must return pairs of integers");
-              ok=0;
-            }
-            Py_XDECREF(i1); Py_XDECREF(i2); /* PySeq_GetItem returned new ref */
-          }
-        } else {
-          if (!PyInt_Check(item)) {
-            PyErr_SetString(PyExc_ValueError, "iterable must return integers");
-            ok=0;
-          } else {
-            idx=PyInt_AsLong(item);
-            if (need_non_negative && idx<0) {
-              PyErr_SetString(PyExc_ValueError, "iterable must return non-negative integers");
-              ok=0;
-            }
-          }
-        }
-       
-        if (ok == 0) {
-          igraph_vector_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        if (igraph_vector_push_back(v, idx)) {
-          igraphmodule_handle_igraph_error();
-          igraph_vector_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        if (pairs) {
-          if (igraph_vector_push_back(v, idx2)) {
-            igraphmodule_handle_igraph_error();
-            igraph_vector_destroy(v);
-            Py_DECREF(item);
-            Py_DECREF(it);
-            return 1;
-          }
-        }
-        Py_DECREF(item);
-      }
-      Py_DECREF(it);
-      return 0;
-    } else {
-      PyErr_SetString(PyExc_TypeError, "sequence or iterable expected");
-      return 1;
-    }
-    return 0;
-  }
-
-  j=PySequence_Size(list);
-  if (pairs)
-    igraph_vector_init(v, 2*j);
-  else
-    igraph_vector_init(v, j);
-  for (i=0, k=0; i<j; i++) {
-    item=PySequence_GetItem(list, i);
-    if (item) {
-      ok=1;
-      if (pairs) {
-        if (PySequence_Check(item) && PySequence_Size(item)==2) {
-          i1=NULL; i2=NULL;
-          i1=PySequence_GetItem(item, 0);
-          if (i1) i2=PySequence_GetItem(item, 1);
-          if (i1 && i2) {
-            if (PyInt_Check(i1) && PyInt_Check(i2)) {
-              idx=PyInt_AsLong(i1);
-              idx2=PyInt_AsLong(i2);
-              if (need_non_negative && (idx<0 || idx2<0)) {
-                PyErr_SetString(PyExc_TypeError, "sequence elements must be non-negative integer pairs");
-                ok=0;
-              }
-            } else {
-              PyErr_SetString(PyExc_TypeError, "sequence elements must be integer pairs");
-              ok=0;
-            }
-            Py_XDECREF(i1); Py_XDECREF(i2);
-          } else {
-            /* this should not happen, but we return anyway.
-             * An IndexError exception was set by PySequence_GetItem
-             * at this point */
-            igraph_vector_destroy(v);
-            Py_XDECREF(i1); Py_XDECREF(i2);
-            Py_XDECREF(item);
-            return 1;
-          }
-        } else {
-          PyErr_SetString(PyExc_TypeError, "sequence elements must be integer pairs");
-          ok=0;
-        }
-      } else {
-        if (PyInt_Check(item)) {
-          idx=PyInt_AsLong(item);
-          if (need_non_negative && idx<0) {
-            PyErr_SetString(PyExc_TypeError, "sequence elements must be non-negative integers");
-            ok=0;
-          }
-        } else {
-          PyErr_SetString(PyExc_TypeError, "sequence elements must be integers");
-          ok=0;
-        }
-        Py_XDECREF(item);
-      }
-         
-      if (!ok) {
-        igraph_vector_destroy(v);
-        return 1;
-      }
-          
-      /* add idx into index vector */
-      VECTOR(*v)[k]=(igraph_real_t)idx;
-      k++;
-      if (pairs) {
-        VECTOR(*v)[k]=(igraph_real_t)idx2;
-        k++;
-      }
-    } else {
-      /* this should not happen, but we return anyway.
-       * an IndexError exception was set by PyList_GetItem
-       * at this point */
-      igraph_vector_destroy(v);
-      return 1;
-    }
-  }
-   
-  return 0;
-}
-
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python list of floats to an igraph \c igraph_vector_t
- * The incoming \c igraph_vector_t should be uninitialized. Raises suitable
- * Python exceptions when needed.
- * 
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_t containing the result
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_float_to_vector_t(PyObject *list, igraph_vector_t *v) {
-  PyObject *item;
-  igraph_real_t value=0;
-  Py_ssize_t i, j, k;
-  int ok;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing floats");
-    return 1;
-  }
-
-  if (!PySequence_Check(list)) {
-    /* try to use an iterator */
-    PyObject *it = PyObject_GetIter(list);
-    if (it) {
-      PyObject *item;
-      igraph_vector_init(v, 0);
-      while ((item = PyIter_Next(it)) != 0) {
-        ok = 1;
-        if (!PyNumber_Check(item)) {
-          PyErr_SetString(PyExc_TypeError, "iterable must return numbers");
-          ok=0;
-        } else {
-          PyObject *item2 = PyNumber_Float(item);
-          if (item2 == 0) {
-            PyErr_SetString(PyExc_TypeError, "can't convert a list item to float");
-            ok = 0;
-          } else {
-            value=(igraph_real_t)PyFloat_AsDouble(item);
-            Py_DECREF(item2);
-          }
-        }
-       
-        if (ok == 0) {
-          igraph_vector_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        if (igraph_vector_push_back(v, value)) {
-          igraphmodule_handle_igraph_error();
-          igraph_vector_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        Py_DECREF(item);
-      }
-      Py_DECREF(it);
-      return 0;
-    } else {
-      PyErr_SetString(PyExc_TypeError, "sequence or iterable expected");
-      return 1;
-    }
-    return 0;
-  }
-
-  j=PySequence_Size(list);
-  igraph_vector_init(v, j);
-  for (i=0, k=0; i<j; i++) {
-    item=PySequence_GetItem(list, i);
-    if (item) {
-      ok=1;
-      if (!PyNumber_Check(item)) {
-        PyErr_SetString(PyExc_TypeError, "sequence elements must be integers");
-        ok=0;
-      } else {
-        PyObject *item2 = PyNumber_Float(item);
-        if (item2 == 0) {
-          PyErr_SetString(PyExc_TypeError, "can't convert sequence element to float");
-          ok=0;
-        } else {
-          value=(igraph_real_t)PyFloat_AsDouble(item2);
-          Py_DECREF(item2);
-        }
-      }
-      Py_XDECREF(item);
-      if (!ok) {
-        igraph_vector_destroy(v);
-        return 1;
-      }
-      VECTOR(*v)[k]=value;
-      k++;
-    } else {
-      /* this should not happen, but we return anyway.
-       * an IndexError exception was set by PyList_GetItem
-       * at this point */
-      igraph_vector_destroy(v);
-      return 1;
-    }
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python list of ints to an igraph \c igraph_vector_int_t
- * The incoming \c igraph_vector_int_t should be uninitialized.
- * Raises suitable Python exceptions when needed.
- *
- * This function is almost identical to
- * \ref igraphmodule_PyObject_to_vector_t . Make sure you fix bugs
- * in both cases (if any).
- *
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_int_t containing the result
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vector_int_t(PyObject *list, igraph_vector_int_t *v) {
-  PyObject *item;
-  int value=0;
-  Py_ssize_t i, j, k;
-  int ok, retval;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing integers");
-    return 1;
-  }
-
-  if (!PySequence_Check(list)) {
-    /* try to use an iterator */
-    PyObject *it = PyObject_GetIter(list);
-    if (it) {
-      PyObject *item;
-      igraph_vector_int_init(v, 0);
-      while ((item = PyIter_Next(it)) != 0) {
-        ok = 1;
-        if (!PyNumber_Check(item)) {
-          PyErr_SetString(PyExc_TypeError, "iterable must return numbers");
-          ok=0;
-        } else {
-          PyObject *item2 = PyNumber_Int(item);
-          if (item2 == 0) {
-            PyErr_SetString(PyExc_TypeError, "can't convert a list item to integer");
-            ok = 0;
-          } else {
-            ok = (PyInt_AsInt(item, &value) == 0);
-            Py_DECREF(item2);
-          }
-        }
-       
-        if (ok == 0) {
-          igraph_vector_int_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        if (igraph_vector_int_push_back(v, value)) {
-          igraphmodule_handle_igraph_error();
-          igraph_vector_int_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        Py_DECREF(item);
-      }
-      Py_DECREF(it);
-      return 0;
-    } else {
-      PyErr_SetString(PyExc_TypeError, "sequence or iterable expected");
-      return 1;
-    }
-    return 0;
-  }
-
-  j=PySequence_Size(list);
-  igraph_vector_int_init(v, j);
-  for (i=0, k=0; i<j; i++) {
-    item=PySequence_GetItem(list, i);
-    if (item) {
-      ok=1;
-      if (!PyNumber_Check(item)) {
-        PyErr_SetString(PyExc_TypeError, "sequence elements must be integers");
-        ok=0;
-      } else {
-        PyObject *item2 = PyNumber_Int(item);
-        if (item2 == 0) {
-          PyErr_SetString(PyExc_TypeError, "can't convert sequence element to int");
-          ok=0;
-        } else {
-          retval = PyInt_AsInt(item2, &value);
-          if (retval)
-            ok = 0;
-          Py_DECREF(item2);
-        }
-      }
-      Py_XDECREF(item);
-      if (!ok) {
-        igraph_vector_int_destroy(v);
-        return 1;
-      }
-      VECTOR(*v)[k]=value;
-      k++;
-    } else {
-      /* this should not happen, but we return anyway.
-       * an IndexError exception was set by PyList_GetItem
-       * at this point */
-      igraph_vector_int_destroy(v);
-      return 1;
-    }
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python list of ints to an igraph \c igraph_vector_long_t
- * The incoming \c igraph_vector_long_t should be uninitialized.
- * Raises suitable Python exceptions when needed.
- *
- * This function is almost identical to
- * \ref igraphmodule_PyObject_to_vector_t . Make sure you fix bugs
- * in both cases (if any).
- *
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_long_t containing the result
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vector_long_t(PyObject *list, igraph_vector_long_t *v) {
-  PyObject *item;
-  long value=0;
-  Py_ssize_t i, j, k;
-  int ok;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing integers");
-    return 1;
-  }
-
-  if (!PySequence_Check(list)) {
-    /* try to use an iterator */
-    PyObject *it = PyObject_GetIter(list);
-    if (it) {
-      PyObject *item;
-      igraph_vector_long_init(v, 0);
-      while ((item = PyIter_Next(it)) != 0) {
-        ok = 1;
-        if (!PyNumber_Check(item)) {
-          PyErr_SetString(PyExc_TypeError, "iterable must return numbers");
-          ok=0;
-        } else {
-          PyObject *item2 = PyNumber_Int(item);
-          if (item2 == 0) {
-            PyErr_SetString(PyExc_TypeError, "can't convert a list item to integer");
-            ok = 0;
-          } else {
-            value=(long)PyInt_AsLong(item);
-            Py_DECREF(item2);
-          }
-        }
-       
-        if (ok == 0) {
-          igraph_vector_long_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        if (igraph_vector_long_push_back(v, value)) {
-          igraphmodule_handle_igraph_error();
-          igraph_vector_long_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        Py_DECREF(item);
-      }
-      Py_DECREF(it);
-      return 0;
-    } else {
-      PyErr_SetString(PyExc_TypeError, "sequence or iterable expected");
-      return 1;
-    }
-    return 0;
-  }
-
-  j=PySequence_Size(list);
-  igraph_vector_long_init(v, j);
-  for (i=0, k=0; i<j; i++) {
-    item=PySequence_GetItem(list, i);
-    if (item) {
-      ok=1;
-      if (!PyNumber_Check(item)) {
-        PyErr_SetString(PyExc_TypeError, "sequence elements must be integers");
-        ok=0;
-      } else {
-        PyObject *item2 = PyNumber_Int(item);
-        if (item2 == 0) {
-          PyErr_SetString(PyExc_TypeError, "can't convert sequence element to integer");
-          ok=0;
-        } else {
-          value=(long)PyInt_AsLong(item2);
-          Py_DECREF(item2);
-        }
-      }
-      Py_XDECREF(item);
-      if (!ok) {
-        igraph_vector_long_destroy(v);
-        return 1;
-      }
-      VECTOR(*v)[k]=value;
-      k++;
-    } else {
-      /* this should not happen, but we return anyway.
-       * an IndexError exception was set by PyList_GetItem
-       * at this point */
-      igraph_vector_long_destroy(v);
-      return 1;
-    }
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python list of objects to an igraph \c igraph_vector_bool_t
- * The incoming \c igraph_vector_bool_t should be uninitialized. Raises suitable
- * Python exceptions when needed.
- * 
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_bool_t containing the result
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vector_bool_t(PyObject *list,
-    igraph_vector_bool_t *v) {
-  PyObject *item;
-  Py_ssize_t i, j;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable");
-    return 1;
-  }
-
-  if (!PySequence_Check(list)) {
-    /* try to use an iterator */
-    PyObject *it = PyObject_GetIter(list);
-    if (it) {
-      PyObject *item;
-      igraph_vector_bool_init(v, 0);
-      while ((item = PyIter_Next(it)) != 0) {
-        if (igraph_vector_bool_push_back(v, PyObject_IsTrue(item))) {
-          igraphmodule_handle_igraph_error();
-          igraph_vector_bool_destroy(v);
-          Py_DECREF(item);
-          Py_DECREF(it);
-          return 1;
-        }
-        Py_DECREF(item);
-      }
-      Py_DECREF(it);
-      return 0;
-    } else {
-      PyErr_SetString(PyExc_TypeError, "sequence or iterable expected");
-      return 1;
-    }
-    return 0;
-  }
-
-  j=PySequence_Size(list);
-  igraph_vector_bool_init(v, j);
-  for (i=0; i<j; i++) {
-    item=PySequence_GetItem(list, i);
-    if (item) {
-      VECTOR(*v)[i]=PyObject_IsTrue(item);
-	  Py_DECREF(item);
-    } else {
-      /* this should not happen, but we return anyway.
-       * an IndexError exception was set by PySequence_GetItem
-       * at this point */
-      igraph_vector_bool_destroy(v);
-      return 1;
-    }
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_bool_t to a Python boolean list
- * 
- * \param v the \c igraph_vector_bool_t containing the vector to be converted
- * \return the Python boolean list as a \c PyObject*, or \c NULL if an
- * error occurred
- */
-PyObject* igraphmodule_vector_bool_t_to_PyList(const igraph_vector_bool_t *v) {
-  PyObject *list, *item;
-  Py_ssize_t n, i;
-   
-  n=igraph_vector_bool_size(v);
-  if (n<0)
-    return igraphmodule_handle_igraph_error();
-
-  list=PyList_New(n);
-  for (i=0; i<n; i++) {
-    item = VECTOR(*v)[i] ? Py_True : Py_False;
-    Py_INCREF(item);
-    PyList_SET_ITEM(list, i, item);
-  }
-
-  return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_t to a Python integer list
- * 
- * \param v the \c igraph_vector_t containing the vector to be converted
- * \return the Python integer list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_t_to_PyList(const igraph_vector_t *v,
-    igraphmodule_conv_t type) {
-  PyObject *list, *item;
-  Py_ssize_t n, i;
-   
-  n=igraph_vector_size(v);
-  if (n<0) return igraphmodule_handle_igraph_error();
-
-  list=PyList_New(n);
-  for (i=0; i<n; i++) {
-    if (type == IGRAPHMODULE_TYPE_INT) {
-	  if (!igraph_finite(VECTOR(*v)[i]))
-		item=PyFloat_FromDouble((double)VECTOR(*v)[i]);
-	  else
-        item=PyInt_FromLong((long)VECTOR(*v)[i]);
-    } else if (type == IGRAPHMODULE_TYPE_FLOAT) {
-      item=PyFloat_FromDouble((double)VECTOR(*v)[i]);
-    } else {
-      item=Py_None;
-      Py_INCREF(item);
-    }
-    if (!item) {
-      Py_DECREF(list);
-      return NULL;
-    }
-    PyList_SET_ITEM(list, i, item);
-  }
-
-  return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_long_t to a Python integer list
- * 
- * \param v the \c igraph_vector_long_t containing the vector to be converted
- * \return the Python integer list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_long_t_to_PyList(const igraph_vector_long_t *v) {
-  PyObject *list, *item;
-  Py_ssize_t n, i;
-   
-  n = igraph_vector_long_size(v);
-  if (n<0)
-    return igraphmodule_handle_igraph_error();
-
-  list=PyList_New(n);
-  for (i=0; i<n; i++) {
-    item = PyInt_FromLong(VECTOR(*v)[i]);
-    if (!item) {
-      Py_DECREF(list);
-      return NULL;
-    }
-    PyList_SET_ITEM(list, i, item);
-  }
-
-  return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_t to a Python integer tuple
- * 
- * \param v the \c igraph_vector_t containing the vector to be converted
- * \return the Python integer tuple as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_t_to_PyTuple(const igraph_vector_t *v) {
-  PyObject* tuple;
-  Py_ssize_t n, i;
-  
-  n=igraph_vector_size(v);
-  if (n<0) return igraphmodule_handle_igraph_error();
-  
-  tuple=PyTuple_New(n);
-  for (i=0; i<n; i++) {
-    PyObject *item=PyInt_FromLong((long)VECTOR(*v)[i]);
-    if (!item) {
-      Py_DECREF(tuple);
-      return NULL;
-    }
-    PyTuple_SET_ITEM(tuple, i, item);
-  }
-
-  return tuple;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_t to a Python list of integer pairs
- * 
- * \param v the \c igraph_vector_t containing the vector to be converted
- * \return the Python integer pair list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_t_to_PyList_pairs(const igraph_vector_t *v) {
-   PyObject *list, *pair;
-   long n, i, j;
-   
-   n=igraph_vector_size(v);
-   if (n<0) return igraphmodule_handle_igraph_error();
-   if (n%2) return igraphmodule_handle_igraph_error();
-   
-   /* create a new Python list */
-   n>>=1;
-   list=PyList_New(n);
-   
-   /* populate the list with data */
-   for (i=0, j=0; i<n; i++, j+=2) {
-     pair=Py_BuildValue("(ll)", (long)VECTOR(*v)[j], (long)VECTOR(*v)[j+1]);
-     if (pair==NULL || PyList_SetItem(list, i, pair)) {
-       /* error occurred while populating the list, return immediately */
-       Py_DECREF(pair);
-       Py_DECREF(list);
-       return NULL;
-     }
-   }
-
-   return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python iterable of non-negative integer pairs (i.e. an
- * edge list) to an igraph \c igraph_vector_t
- *
- * The incoming \c igraph_vector_t should be uninitialized. Raises suitable
- * Python exceptions when needed.
- * 
- * \param list the Python list to be converted
- * \param v the \c igraph_vector_t containing the result
- * \param graph  the graph that will be used to interpret vertex names
- *               if a string is yielded by the Python iterable
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_edgelist(PyObject *list, igraph_vector_t *v,
-    igraph_t *graph) {
-  PyObject *item, *i1, *i2, *it;
-  int ok;
-  igraph_integer_t idx1=0, idx2=0;
-
-  if (PyBaseString_Check(list)) {
-    /* It is highly unlikely that a string (although it is a sequence) will
-     * provide us with integers or integer pairs */
-    PyErr_SetString(PyExc_TypeError, "expected a sequence or an iterable containing integer or string pairs");
-    return 1;
-  }
-
-  it = PyObject_GetIter(list);
-  if (!it)
-    return 1;
-
-  igraph_vector_init(v, 0);
-  while ((item = PyIter_Next(it)) != 0) {
-    ok = 1;
-    if (!PySequence_Check(item) || PySequence_Size(item) != 2) {
-      PyErr_SetString(PyExc_TypeError, "iterable must return pairs of integers or strings");
-      ok=0;
-    } else {
-      i1 = PySequence_ITEM(item, 0);
-      if (i1 == 0) {
-        i2 = 0;
-      } else {
-        i2 = PySequence_ITEM(item, 1);
-      }
-      ok = (i1 != 0 && i2 != 0);
-      ok = ok && !igraphmodule_PyObject_to_vid(i1, &idx1, graph);
-      ok = ok && !igraphmodule_PyObject_to_vid(i2, &idx2, graph);
-      Py_XDECREF(i1); Py_XDECREF(i2); /* PySequence_ITEM returned new ref */
-    }
-
-    Py_DECREF(item);
-
-    if (ok) {
-      if (igraph_vector_push_back(v, idx1)) {
-        igraphmodule_handle_igraph_error();
-        ok = 0;
-      }
-      if (ok && igraph_vector_push_back(v, idx2)) {
-        igraphmodule_handle_igraph_error();
-        ok = 0;
-      }
-    }
-
-    if (!ok) {
-      igraph_vector_destroy(v);
-      Py_DECREF(it);
-      return 1;
-    }
-  }
-
-  Py_DECREF(it);
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an attribute name or a sequence to a vector_t
- *
- * This function is useful for the interface of igraph C calls accepting
- * edge or vertex weights. The function checks the given Python object. If
- * it is None, returns a null pointer instead of an \c igraph_vector_t.
- * If it is a sequence, it converts the sequence to a newly allocated
- * \c igraph_vector_t and return a pointer to it. Otherwise it interprets the
- * object as an attribute name and returns the attribute values corresponding
- * to the name as an \c igraph_vector_t, or returns a null pointer if the attribute
- * does not exist.
- * 
- * Note that if the function returned a pointer to an \c igraph_vector_t,
- * it is the caller's responsibility to destroy the object and free its
- * pointer after having finished using it.
- *
- * \param o the Python object being converted.
- * \param self a Python Graph object being used when attributes are queried
- * \param vptr the pointer to the allocated vector is returned here.
- * \param attr_type the type of the attribute being handled
- * \return 0 if everything was OK, nonzero otherwise.
- */
-int igraphmodule_attrib_to_vector_t(PyObject *o, igraphmodule_GraphObject *self,
-    igraph_vector_t **vptr, int attr_type) {
-  igraph_vector_t *result;
-
-  *vptr = 0;
-  if (attr_type != ATTRIBUTE_TYPE_EDGE && attr_type != ATTRIBUTE_TYPE_VERTEX)
-    return 1;
-  if (o == Py_None) return 0;
-  if (PyString_Check(o)) {
-    /* Check whether the attribute exists and is numeric */
-    igraph_attribute_type_t at;
-    igraph_attribute_elemtype_t et;
-    long int n;
-    char *name = PyString_CopyAsString(o);
-
-    if (attr_type == ATTRIBUTE_TYPE_VERTEX) {
-      et = IGRAPH_ATTRIBUTE_VERTEX;
-      n = igraph_vcount(&self->g);
-    } else {
-      et = IGRAPH_ATTRIBUTE_EDGE;
-      n = igraph_ecount(&self->g);
-    }
-
-    if (igraphmodule_i_attribute_get_type(&self->g, &at, et, name)) {
-      /* exception was set by igraphmodule_i_attribute_get_type */
-      free(name);
-      return 1;
-    }
-    if (at != IGRAPH_ATTRIBUTE_NUMERIC) {
-      PyErr_SetString(PyExc_ValueError, "attribute values must be numeric");
-      free(name);
-      return 1;
-    }
-    /* Now that the attribute type has been checked, allocate the target
-     * vector */
-    result = (igraph_vector_t*)calloc(1, sizeof(igraph_vector_t));
-    if (result==0) {
-      PyErr_NoMemory();
-      free(name);
-      return 1;
-    }
-    igraph_vector_init(result, n);
-    if (attr_type == ATTRIBUTE_TYPE_VERTEX) {
-      if (igraphmodule_i_get_numeric_vertex_attr(&self->g, name,
-          igraph_vss_all(), result)) {
-        /* exception has already been set, so return */
-        igraph_vector_destroy(result);
-        free(name);
-        free(result);
-        return 1;
-      }
-    } else {
-      if (igraphmodule_i_get_numeric_edge_attr(&self->g, name,
-          igraph_ess_all(IGRAPH_EDGEORDER_ID), result)) {
-        /* exception has already been set, so return */
-        igraph_vector_destroy(result);
-        free(name);
-        free(result);
-        return 1;
-      }
-    }
-    free(name);
-    *vptr = result;
-  } else if (PySequence_Check(o)) {
-    result = (igraph_vector_t*)calloc(1, sizeof(igraph_vector_t));
-    if (result==0) {
-      PyErr_NoMemory();
-      return 1;
-    }
-    if (igraphmodule_PyObject_float_to_vector_t(o, result)) {
-      igraph_vector_destroy(result);
-      free(result);
-      return 1;
-    }
-    *vptr = result;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "unhandled type");
-    return 1;
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an attribute name or a sequence to a vector_int_t
- *
- * Similar to igraphmodule_attrib_to_vector_t and
- * igraphmodule_attrib_to_vector_long_t. Make sure you fix bugs
- * in all three places (if any).
- * 
- * Note that if the function returned a pointer to an \c igraph_vector_int_t,
- * it is the caller's responsibility to destroy the object and free its
- * pointer after having finished using it.
- *
- * \param o the Python object being converted.
- * \param self a Python Graph object being used when attributes are queried
- * \param vptr the pointer to the allocated vector is returned here.
- * \param attr_type the type of the attribute being handled
- * \return 0 if everything was OK, nonzero otherwise.
- */
-int igraphmodule_attrib_to_vector_int_t(PyObject *o, igraphmodule_GraphObject *self,
-    igraph_vector_int_t **vptr, int attr_type) {
-  igraph_vector_int_t *result;
-
-  *vptr = 0;
-
-  if (attr_type != ATTRIBUTE_TYPE_EDGE && attr_type != ATTRIBUTE_TYPE_VERTEX)
-    return 1;
-
-  if (o == Py_None)
-    return 0;
-
-  if (PyString_Check(o)) {
-    igraph_vector_t* dummy = 0;
-    long int i, n;
-
-    if (igraphmodule_attrib_to_vector_t(o, self, &dummy, attr_type))
-      return 1;
-
-    if (dummy == 0)
-      return 0;
-
-    n = igraph_vector_size(dummy);
-
-    result = (igraph_vector_int_t*)calloc(1, sizeof(igraph_vector_int_t));
-    igraph_vector_int_init(result, n);
-    if (result==0) {
-      igraph_vector_destroy(dummy); free(dummy);
-      PyErr_NoMemory();
-      return 1;
-    }
-    for (i=0; i<n; i++)
-      VECTOR(*result)[i] = (int)VECTOR(*dummy)[i];
-    igraph_vector_destroy(dummy); free(dummy);
-    *vptr = result;
-  } else if (PySequence_Check(o)) {
-    result = (igraph_vector_int_t*)calloc(1, sizeof(igraph_vector_int_t));
-    if (result==0) {
-      PyErr_NoMemory();
-      return 1;
-    }
-    if (igraphmodule_PyObject_to_vector_int_t(o, result)) {
-      igraph_vector_int_destroy(result);
-      free(result);
-      return 1;
-    }
-    *vptr = result;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "unhandled type");
-    return 1;
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an attribute name or a sequence to a vector_long_t
- *
- * Similar to igraphmodule_attrib_to_vector_t and
- * igraphmodule_attrib_to_vector_int_t. Make sure you fix bugs
- * in all three places (if any).
- * 
- * Note that if the function returned a pointer to an \c igraph_vector_long_t,
- * it is the caller's responsibility to destroy the object and free its
- * pointer after having finished using it.
- *
- * \param o the Python object being converted.
- * \param self a Python Graph object being used when attributes are queried
- * \param vptr the pointer to the allocated vector is returned here.
- * \param attr_type the type of the attribute being handled
- * \return 0 if everything was OK, nonzero otherwise.
- */
-int igraphmodule_attrib_to_vector_long_t(PyObject *o, igraphmodule_GraphObject *self,
-    igraph_vector_long_t **vptr, int attr_type) {
-  igraph_vector_long_t *result;
-
-  *vptr = 0;
-  if (attr_type != ATTRIBUTE_TYPE_EDGE && attr_type != ATTRIBUTE_TYPE_VERTEX)
-    return 1;
-  if (o == Py_None)
-    return 0;
-  if (PyString_Check(o)) {
-    igraph_vector_t* dummy = 0;
-    long int i, n;
-
-    if (igraphmodule_attrib_to_vector_t(o, self, &dummy, attr_type))
-      return 1;
-
-    if (dummy == 0)
-      return 0;
-
-    n = igraph_vector_size(dummy);
-
-    result = (igraph_vector_long_t*)calloc(1, sizeof(igraph_vector_long_t));
-    igraph_vector_long_init(result, n);
-    if (result==0) {
-      igraph_vector_destroy(dummy); free(dummy);
-      PyErr_NoMemory();
-      return 1;
-    }
-    for (i=0; i<n; i++)
-      VECTOR(*result)[i] = (long int)VECTOR(*dummy)[i];
-    igraph_vector_destroy(dummy); free(dummy);
-    *vptr = result;
-  } else if (PySequence_Check(o)) {
-    result = (igraph_vector_long_t*)calloc(1, sizeof(igraph_vector_long_t));
-    if (result==0) {
-      PyErr_NoMemory();
-      return 1;
-    }
-    if (igraphmodule_PyObject_to_vector_long_t(o, result)) {
-      igraph_vector_long_destroy(result);
-      free(result);
-      return 1;
-    }
-    *vptr = result;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "unhandled type");
-    return 1;
-  }
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an attribute name or a sequence to a vector_bool_t
- *
- * This function is useful for the interface of igraph C calls accepting
- * bipartite type vectors. The function checks the given Python object. If
- * it is None, returns a null pointer instead of an \c igraph_vector_bool_t.
- * If it is a sequence, it converts the sequence to a newly allocated
- * \c igraph_vector_bool_t and return a pointer to it. Otherwise it interprets the
- * object as an attribute name and returns the attribute values corresponding
- * to the name as an \c igraph_vector_bool_t, or returns a null pointer if the attribute
- * does not exist.
- *
- * Anything that evaluates to true using PyObject_IsTrue will be converted to
- * true in the resulting vector. Only numeric attributes are supported.
- * 
- * Note that if the function returned a pointer to an \c igraph_vector_bool_t,
- * it is the caller's responsibility to destroy the object and free its
- * pointer after having finished using it.
- *
- * \param o the Python object being converted.
- * \param self a Python Graph object being used when attributes are queried
- * \param vptr the pointer to the allocated vector is returned here.
- * \param attr_type the type of the attribute being handled
- * \return 0 if everything was OK, nonzero otherwise.
- */
-int igraphmodule_attrib_to_vector_bool_t(PyObject *o, igraphmodule_GraphObject *self,
-    igraph_vector_bool_t **vptr, int attr_type) {
-  igraph_vector_bool_t *result;
-
-  *vptr = 0;
-  if (attr_type != ATTRIBUTE_TYPE_EDGE && attr_type != ATTRIBUTE_TYPE_VERTEX)
-    return 1;
-  if (o == Py_None) return 0;
-  if (PyString_Check(o)) {
-    igraph_vector_t *dummy = 0;
-    long int i, n;
-
-    if (igraphmodule_attrib_to_vector_t(o, self, &dummy, attr_type))
-      return 1;
-
-    if (dummy == 0)
-      return 0;
-
-    n = igraph_vector_size(dummy);
-
-    result = (igraph_vector_bool_t*)calloc(1, sizeof(igraph_vector_bool_t));
-    igraph_vector_bool_init(result, n);
-    if (result==0) {
-      igraph_vector_destroy(dummy); free(dummy);
-      PyErr_NoMemory();
-      return 1;
-    }
-    for (i=0; i<n; i++)
-      VECTOR(*result)[i] = (VECTOR(*dummy)[i] != 0);
-    igraph_vector_destroy(dummy); free(dummy);
-    *vptr = result;
-  } else if (PySequence_Check(o)) {
-    result = (igraph_vector_bool_t*)calloc(1, sizeof(igraph_vector_bool_t));
-    if (result==0) {
-      PyErr_NoMemory();
-      return 1;
-    }
-    if (igraphmodule_PyObject_to_vector_bool_t(o, result)) {
-      free(result);
-      return 1;
-    }
-    *vptr = result;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "unhandled type");
-    return 1;
-  }
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts two igraph \c igraph_vector_t vectors to a Python list of integer pairs
- * 
- * \param v1 the \c igraph_vector_t containing the 1st vector to be converted
- * \param v2 the \c igraph_vector_t containing the 2nd vector to be converted
- * \return the Python integer pair list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_t_pair_to_PyList(const igraph_vector_t *v1,
-    const igraph_vector_t *v2) {
-   PyObject *list, *pair;
-   long n, i;
-   
-   n=igraph_vector_size(v1);
-   if (n<0) return igraphmodule_handle_igraph_error();
-   if (igraph_vector_size(v2) != n) return igraphmodule_handle_igraph_error();
-
-   /* create a new Python list */
-   list=PyList_New(n);
-   
-   /* populate the list with data */
-   for (i=0; i<n; i++) {
-     pair=Py_BuildValue("(ll)", (long)VECTOR(*v1)[i], (long)VECTOR(*v2)[i]);
-     if (pair==NULL || PyList_SetItem(list, i, pair)) {
-       /* error occurred while populating the list, return immediately */
-       Py_DECREF(pair);
-       Py_DECREF(list);
-       return NULL;
-     }
-   }
-
-   return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_matrix_t to a Python list of lists
- * 
- * \param m the \c igraph_matrix_t containing the matrix to be converted
- * \param type the type of conversion. If equals to IGRAPHMODULE_TYPE_INT,
- *        returns an integer matrix, else returns a float matrix.
- * \return the Python list of lists as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_matrix_t_to_PyList(const igraph_matrix_t *m,
-    igraphmodule_conv_t type) {
-   PyObject *list, *row, *item;
-   Py_ssize_t nr, nc, i, j;
-   
-   nr = igraph_matrix_nrow(m);
-   nc = igraph_matrix_ncol(m);
-   if (nr<0 || nc<0)
-     return igraphmodule_handle_igraph_error();
-
-   // create a new Python list
-   list=PyList_New(nr);
-   // populate the list with data
-   for (i=0; i<nr; i++) 
-     {
-    row=PyList_New(nc);
-    for (j=0; j<nc; j++) 
-      {
-         if (type==IGRAPHMODULE_TYPE_INT) {
-	       if (!igraph_finite(MATRIX(*m, i, j)))
-		     item=PyFloat_FromDouble((double)MATRIX(*m, i, j));
-	       else
-             item=PyInt_FromLong((long)MATRIX(*m, i, j));
-		 } else
-           item=PyFloat_FromDouble(MATRIX(*m, i, j));
-           
-         if (PyList_SetItem(row, j, item))
-           {
-          // error occurred while populating the list, return immediately
-          Py_DECREF(row);
-          Py_DECREF(list);
-          return NULL;
-           }
-      }
-    if (PyList_SetItem(list, i, row)) 
-      {
-         Py_DECREF(row);
-         Py_DECREF(list);
-         return NULL;
-      }
-     }
-   // return the list
-   return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an igraph \c igraph_vector_ptr_t to a Python list of lists
- * 
- * \param v the \c igraph_vector_ptr_t containing the vector to be converted
- * \return the Python list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_vector_ptr_t_to_PyList(const igraph_vector_ptr_t *v,
-    igraphmodule_conv_t type) {
-  PyObject *list, *item;
-  Py_ssize_t n, i;
-   
-  n=igraph_vector_ptr_size(v);
-  if (n<0)
-    return igraphmodule_handle_igraph_error();
-
-  list=PyList_New(n);
-  for (i=0; i<n; i++) {
-    item=igraphmodule_vector_t_to_PyList((igraph_vector_t*)VECTOR(*v)[i], type);
-    if (item == NULL) {
-      Py_DECREF(list);
-      return NULL;
-    }
-    PyList_SET_ITEM(list, i, item);
-  }
-
-  return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python list of lists to an \c igraph_matrix_t
- * 
- * \param o the Python object representing the list of lists
- * \param m the address of an uninitialized \c igraph_matrix_t
- * \return 0 if everything was OK, 1 otherwise. Sets appropriate exceptions.
- */
-int igraphmodule_PyList_to_matrix_t(PyObject* o, igraph_matrix_t *m) {
-  Py_ssize_t nr, nc, n, i, j;
-  PyObject *row, *item;
-  int was_warned=0;
-
-  /* calculate the matrix dimensions */
-  if (!PySequence_Check(o) || PyString_Check(o)) {
-    PyErr_SetString(PyExc_TypeError, "matrix expected (list of sequences)");
-    return 1;
-  }
-
-  nr = PySequence_Size(o);
-  nc = 0;
-  for (i=0; i<nr; i++) {
-    row=PySequence_GetItem(o, i);
-    if (!PySequence_Check(row)) {
-      Py_DECREF(row);
-      PyErr_SetString(PyExc_TypeError, "matrix expected (list of sequences)");
-      return 1;
-    }
-    n=PySequence_Size(row);
-    Py_DECREF(row);
-    if (n>nc) nc=n;
-  }
-  
-  igraph_matrix_init(m, nr, nc);
-  for (i=0; i<nr; i++) {
-    row=PySequence_GetItem(o, i);
-    n=PySequence_Size(row);
-    for (j=0; j<n; j++) {
-      item=PySequence_GetItem(row, j);
-      if (PyInt_Check(item)) {
-        MATRIX(*m, i, j) = (igraph_real_t)PyInt_AsLong(item);
-      } else if (PyLong_Check(item)) {
-        MATRIX(*m, i, j) = (igraph_real_t)PyLong_AsLong(item);
-      } else if (PyFloat_Check(item)) {
-        MATRIX(*m, i, j) = (igraph_real_t)PyFloat_AsDouble(item);
-      } else if (!was_warned) {
-        PyErr_Warn(PyExc_Warning, "non-numeric value in matrix ignored");
-        was_warned=1;
-      }
-      Py_DECREF(item);
-    }
-    Py_DECREF(row);
-  }
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts an \c igraph_strvector_t to a Python string list
- * 
- * \param v the \c igraph_strvector_t containing the vector to be converted
- * \return the Python string list as a \c PyObject*, or \c NULL if an error occurred
- */
-PyObject* igraphmodule_strvector_t_to_PyList(igraph_strvector_t *v) {
-  PyObject* list;
-  Py_ssize_t n, i;
-  char* ptr;
-  
-  n=igraph_strvector_size(v);
-  if (n<0)
-    return igraphmodule_handle_igraph_error();
-  
-  // create a new Python list
-  list=PyList_New(n);
-  /* populate the list with data */
-  for (i=0; i<n; i++) {
-    igraph_strvector_get(v, i, &ptr);
-    if (PyList_SetItem(list, i, PyString_FromString(ptr))) {
-      /* error occurred while populating the list, return immediately */
-      Py_DECREF(list);
-      return NULL;
-    }
-  }
-  
-   /* return the list */
-   return list;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Converts a Python string list to an \c igraph_strvector_t
- * 
- * \param v the Python list as a \c PyObject*
- * \param result an \c igraph_strvector_t containing the result
- * The incoming \c igraph_strvector_t should be uninitialized. Raises suitable
- * Python exceptions when needed.
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyList_to_strvector_t(PyObject* v, igraph_strvector_t *result) {
-  Py_ssize_t n, i;
-  PyObject *o;
-  
-  if (!PyList_Check(v)) {
-    PyErr_SetString(PyExc_TypeError, "expected list");
-    return 1;
-  }
-  
-  n=PyList_Size(v);
-
-  /* initialize the string vector */
-  if (igraph_strvector_init(result, n)) return 1;
-  
-  /* populate the vector with data */
-  for (i=0; i<n; i++) {
-    PyObject *item = PyList_GetItem(v, i);
-    char* ptr;
-    igraph_bool_t will_free = 0;
-
-    if (PyUnicode_Check(item)) {
-      ptr = PyString_CopyAsString(item);
-      if (ptr == 0) {
-        igraph_strvector_destroy(result);
-        return 1;
-      }
-      will_free = 1;
-#ifndef IGRAPH_PYTHON3
-    } else if (PyString_Check(item)) {
-      ptr = PyString_AS_STRING(item);
-#endif
-    } else {
-      o = PyObject_Str(item);
-      if (o == 0) {
-        igraph_strvector_destroy(result);
-        return 1;
-      }
-      ptr = PyString_CopyAsString(o);
-      Py_DECREF(o);
-      if (ptr == 0) {
-        igraph_strvector_destroy(result);
-        return 1;
-      }
-      will_free = 1;
-    }
-
-    if (igraph_strvector_set(result, i, ptr)) {
-      if (will_free)
-        free(ptr);
-      igraph_strvector_destroy(result);
-      return 1;
-    }
-    if (will_free)
-      free(ptr);
-  }
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Appends the contents of a Python iterator returning graphs to
- * an \c igraph_vectorptr_t
- *
- * The incoming \c igraph_vector_ptr_t should be INITIALIZED.
- * Raises suitable Python exceptions when needed.
- * 
- * \param it the Python iterator
- * \param v the \c igraph_vector_ptr_t which will contain the result
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_append_PyIter_to_vector_ptr_t(PyObject *it, igraph_vector_ptr_t *v) {
-  PyObject *t;
-  
-  while ((t=PyIter_Next(it))) {
-    if (!PyObject_TypeCheck(t, &igraphmodule_GraphType)) {
-      PyErr_SetString(PyExc_TypeError, "iterable argument must contain graphs");
-      Py_DECREF(t);
-      return 1;
-    }
-    igraph_vector_ptr_push_back(v, &((igraphmodule_GraphObject*)t)->g);
-    Py_DECREF(t);
-  }  
-  
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Tries to interpret a Python object as a single vertex ID
- * 
- * \param o      the Python object
- * \param vid    the vertex ID will be stored here
- * \param graph  the graph that will be used to interpret vertex names
- *               if a string was given in o. It may also be a null pointer
- *               if we don't need name lookups.
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vid(PyObject *o, igraph_integer_t *vid, igraph_t *graph) {
-  int retval, tmp;
-
-  if (o == Py_None || o == 0) {
-    *vid = 0;
-  } else if (PyInt_Check(o)) {
-    /* Single vertex ID */
-    if (PyInt_AsInt(o, &tmp))
-      return 1;
-    *vid = tmp;
-  } else if (PyLong_Check(o)) {
-    /* Single vertex ID */
-    if (PyLong_AsInt(o, &tmp))
-      return 1;
-    *vid = tmp;
-  } else if (graph != 0 && PyBaseString_Check(o)) {
-    /* Single vertex ID from vertex name */
-    if (igraphmodule_get_vertex_id_by_name(graph, o, vid))
-      return 1;
-  } else if (PyObject_IsInstance(o, (PyObject*)&igraphmodule_VertexType)) {
-    /* Single vertex ID from Vertex object */
-    igraphmodule_VertexObject *vo = (igraphmodule_VertexObject*)o;
-    *vid = igraphmodule_Vertex_get_index_igraph_integer(vo);
-  } else if (PyIndex_Check(o)) {
-    /* Other numeric type that can be converted to an index */
-    PyObject* num = PyNumber_Index(o);
-    if (num) {
-      if (PyInt_Check(num)) {
-        retval = PyInt_AsInt(num, &tmp);
-        if (retval) {
-          Py_DECREF(num);
-          return 1;
-        }
-        *vid = tmp;
-      } else if (PyLong_Check(num)) {
-        retval = PyLong_AsInt(num, &tmp);
-        if (retval) {
-          Py_DECREF(num);
-          return 1;
-        }
-        *vid = tmp;
-      } else {
-        PyErr_SetString(PyExc_TypeError, "PyNumber_Index returned invalid type");
-        Py_DECREF(num);
-        return 1;
-      }
-      Py_DECREF(num);
-    } else
-      return 1;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "only numbers, vertex names or igraph.Vertex objects can be converted to vertex IDs");
-    return 1;
-  }
-
-  if (*vid < 0) {
-    PyErr_Format(PyExc_ValueError, "vertex IDs must be positive, got: %ld", (long)(*vid));
-    return 1;
-  }
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Tries to interpret a Python object as a vertex selector
- * 
- * \param o      the Python object
- * \param vs     the \c igraph_vs_t which will contain the result
- * \param graph  an \c igraph_t object which will be used to interpret vertex
- *               names (if the supplied Python object contains strings)
- * \param return_single will be 1 if the selector selected only a single vertex,
- *                      0 otherwise
- * \param single_vid    if the selector selected only a single vertex, the ID
- *                      of the selected vertex will also be returned here.
- *
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_vs_t(PyObject *o, igraph_vs_t *vs,
-    igraph_t *graph, igraph_bool_t *return_single, igraph_integer_t *single_vid) {
-  igraph_integer_t vid;
-  igraph_vector_t vector;
-
-  if (o == 0 || o == Py_None) {
-    /* Returns a vertex sequence for all vertices */
-    if (return_single)
-      *return_single = 0;
-    igraph_vs_all(vs);
-    return 0;
-  }
-
-  if (PyObject_IsInstance(o, (PyObject*)&igraphmodule_VertexSeqType)) {
-    /* Returns a vertex sequence from a VertexSeq object */
-    igraphmodule_VertexSeqObject *vso = (igraphmodule_VertexSeqObject*)o;
-    if (igraph_vs_copy(vs, &vso->vs)) {
-      igraphmodule_handle_igraph_error();
-      return 1;
-    }
-    if (return_single)
-      *return_single = 0;
-    return 0;
-  }
-
-  if (PySlice_Check(o) && graph != 0) {
-    /* Returns a vertex sequence from a slice */
-    Py_ssize_t no_of_vertices = igraph_vcount(graph);
-    Py_ssize_t start, stop, step, slicelength, i;
-
-    /* Casting to void* because Python 2.x expects PySliceObject*
-     * but Python 3.x expects PyObject* */
-    if (PySlice_GetIndicesEx((void*)o, no_of_vertices,
-          &start, &stop, &step, &slicelength))
-      return 1;
-
-    if (start == 0 && slicelength == no_of_vertices) {
-      igraph_vs_all(vs);
-    } else {
-      IGRAPH_CHECK(igraph_vector_init(&vector, slicelength));
-      IGRAPH_FINALLY(igraph_vector_destroy, &vector);
-
-      for (i = 0; i < slicelength; i++, start += step) {
-        VECTOR(vector)[i] = start;
-      }
-
-      IGRAPH_CHECK(igraph_vs_vector_copy(vs, &vector));
-
-      igraph_vector_destroy(&vector);
-      IGRAPH_FINALLY_CLEAN(1);
-    }
-
-    if (return_single)
-      *return_single = 0;
-
-    return 0;
-  }
-
-  if (igraphmodule_PyObject_to_vid(o, &vid, graph)) {
-    /* Object cannot be converted to a single vertex ID,
-     * assume it is a sequence or iterable */
-
-    PyObject *iterator;
-    PyObject *item;
-
-    if (PyBaseString_Check(o)) {
-      /* Special case: strings and unicode objects are sequences, but they
-       * will not yield valid vertex IDs */
-      return 1;
-    }
-
-    /* Clear the exception set by igraphmodule_PyObject_to_vid */
-    PyErr_Clear();
-
-    iterator = PyObject_GetIter(o);
-
-    if (iterator == NULL) {
-      PyErr_SetString(PyExc_TypeError, "conversion to vertex sequence failed");
-      return 1;
-    }
-
-    IGRAPH_CHECK(igraph_vector_init(&vector, 0));
-    IGRAPH_FINALLY(igraph_vector_destroy, &vector);
-    IGRAPH_CHECK(igraph_vector_reserve(&vector, 20));
-
-    while ((item = PyIter_Next(iterator))) {
-      vid = -1;
-
-      if (igraphmodule_PyObject_to_vid(item, &vid, graph))
-        break;
-
-      Py_DECREF(item);
-      igraph_vector_push_back(&vector, vid);
-    }
-    Py_DECREF(iterator);
-
-    if (PyErr_Occurred()) {
-      igraph_vector_destroy(&vector);
-      IGRAPH_FINALLY_CLEAN(1);
-      return 1;
-    }
-
-    IGRAPH_CHECK(igraph_vs_vector_copy(vs, &vector));
-    igraph_vector_destroy(&vector);
-    IGRAPH_FINALLY_CLEAN(1);
-
-    if (return_single)
-      *return_single = 0;
-    
-    return 0;
-  }
-
-  /* The object can be converted into a single vertex ID */
-  if (return_single)
-    *return_single = 1;
-  if (single_vid)
-    *single_vid = vid;
-
-  igraph_vs_1(vs, vid);
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Tries to interpret a Python object as a single edge ID
- * 
- * \param o      the Python object
- * \param eid    the edge ID will be stored here
- * \param graph  the graph that will be used to interpret vertex names and
- *               indices if o is a tuple. It may also be a null pointer
- *               if we don't want to handle tuples.
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_eid(PyObject *o, igraph_integer_t *eid, igraph_t *graph) {
-  int retval, tmp;
-  igraph_integer_t vid1, vid2;
-
-  if (o == Py_None || o == 0) {
-    *eid = 0;
-  } else if (PyInt_Check(o)) {
-    /* Single edge ID */
-    if (PyInt_AsInt(o, &tmp))
-      return 1;
-    *eid = tmp;
-  } else if (PyLong_Check(o)) {
-    /* Single edge ID */
-    if (PyLong_AsInt(o, &tmp))
-      return 1;
-    *eid = tmp;
-  } else if (PyObject_IsInstance(o, (PyObject*)&igraphmodule_EdgeType)) {
-    /* Single edge ID from Edge object */
-    igraphmodule_EdgeObject *eo = (igraphmodule_EdgeObject*)o;
-    *eid = igraphmodule_Edge_get_index_igraph_integer(eo);
-  } else if (PyIndex_Check(o)) {
-    /* Other numeric type that can be converted to an index */
-    PyObject* num = PyNumber_Index(o);
-    if (num) {
-      if (PyInt_Check(num)) {
-        retval = PyInt_AsInt(num, &tmp);
-        if (retval) {
-          Py_DECREF(num);
-          return 1;
-        }
-        *eid = tmp;
-      } else if (PyLong_Check(num)) {
-        retval = PyLong_AsInt(num, &tmp);
-        if (retval) {
-          Py_DECREF(num);
-          return 1;
-        }
-        *eid = tmp;
-      } else {
-        PyErr_SetString(PyExc_TypeError, "PyNumber_Index returned invalid type");
-        Py_DECREF(num);
-        return 1;
-      }
-      Py_DECREF(num);
-    } else
-      return 1;
-  } else if (graph != 0 && PyTuple_Check(o)) {
-    PyObject *o1, *o2;
-    
-    o1 = PyTuple_GetItem(o, 0);
-    if (!o1)
-      return 1;
-
-    o2 = PyTuple_GetItem(o, 1);
-    if (!o2)
-      return 1;
-
-    if (igraphmodule_PyObject_to_vid(o1, &vid1, graph))
-      return 1;
-    if (igraphmodule_PyObject_to_vid(o2, &vid2, graph))
-      return 1;
-
-    igraph_get_eid(graph, eid, vid1, vid2, 1, 0);
-    if (*eid < 0) {
-      PyErr_Format(PyExc_ValueError, "no edge from vertex #%ld to #%ld",
-          (long int)vid1, (long int)vid2);
-      return 1;
-    }
-  } else {
-    PyErr_SetString(PyExc_TypeError,
-        "only numbers, igraph.Edge objects or tuples of vertex IDs can be "
-        "converted to edge IDs");
-    return 1;
-  }
-
-  if (*eid < 0) {
-    PyErr_Format(PyExc_ValueError, "edge IDs must be positive, got: %ld", (long)(*eid));
-    return 1;
-  }
-
-  return 0;
-}
-
-
-/**
- * \ingroup python_interface_conversion
- * \brief Tries to interpret a Python object as an edge selector
- * 
- * \param o the Python object
- * \param vs the \c igraph_es_t which will contain the result
- * \param graph  an \c igraph_t object which will be used to interpret vertex
- *               names and tuples (if the supplied Python object contains them)
- * \param return_single will be 1 if the selector selected only a single edge,
- * 0 otherwise
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_es_t(PyObject *o, igraph_es_t *es, igraph_t *graph,
-                  igraph_bool_t *return_single) {
-  igraph_integer_t eid;
-  igraph_vector_t vector;
-
-  if (o == 0 || o == Py_None) {
-    /* Returns an edge sequence for all edges */
-    if (return_single)
-      *return_single = 0;
-    igraph_es_all(es, IGRAPH_EDGEORDER_ID);
-    return 0;
-  }
-
-  if (PyObject_IsInstance(o, (PyObject*)&igraphmodule_EdgeSeqType)) {
-    /* Returns an edge sequence from an EdgeSeq object */
-    igraphmodule_EdgeSeqObject *eso = (igraphmodule_EdgeSeqObject*)o;
-    if (igraph_es_copy(es, &eso->es)) {
-      igraphmodule_handle_igraph_error();
-      return 1;
-    }
-    if (return_single)
-      *return_single = 0;
-    return 0;
-  }
-
-  if (igraphmodule_PyObject_to_eid(o, &eid, graph)) {
-    /* Object cannot be converted to a single edge ID,
-     * assume it is a sequence or iterable */
-
-    PyObject *iterator;
-    PyObject *item;
-
-    /* Clear the exception set by igraphmodule_PyObject_to_eid */
-    PyErr_Clear();
-
-    iterator = PyObject_GetIter(o);
-
-    if (iterator == NULL) {
-      PyErr_SetString(PyExc_TypeError, "conversion to edge sequene failed");
-      return 1;
-    }
-
-    IGRAPH_CHECK(igraph_vector_init(&vector, 0));
-    IGRAPH_FINALLY(igraph_vector_destroy, &vector);
-    IGRAPH_CHECK(igraph_vector_reserve(&vector, 20));
-
-    while ((item = PyIter_Next(iterator))) {
-      eid = -1;
-
-      if (igraphmodule_PyObject_to_eid(item, &eid, graph))
-        break;
-
-      Py_DECREF(item);
-      igraph_vector_push_back(&vector, eid);
-    }
-    Py_DECREF(iterator);
-
-    if (PyErr_Occurred()) {
-      igraph_vector_destroy(&vector);
-      IGRAPH_FINALLY_CLEAN(1);
-      return 1;
-    }
-    
-    if (igraph_vector_size(&vector) > 0) {
-      igraph_es_vector_copy(es, &vector);
-    } else {
-      igraph_es_none(es);
-    }
-
-    igraph_vector_destroy(&vector);
-    IGRAPH_FINALLY_CLEAN(1);
-
-    if (return_single)
-      *return_single = 0;
-    
-    return 0;
-  }
-
-  /* The object can be converted into a single edge ID */
-  if (return_single)
-    *return_single = 1;
-  /*
-  if (single_eid)
-    *single_eid = eid;
-  */
-
-  igraph_es_1(es, eid);
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_conversion
- * \brief Tries to interpret a Python object as a numeric attribute value list
- * 
- * \param o the Python object
- * \param v the \c igraph_vector_t which will contain the result
- * \param g a \c igraphmodule_GraphObject object or \c NULL - used when the
- * provided Python object is not a list and we're trying to interpret it as
- * an attribute name.
- * \param type the attribute type (graph = 0, vertex = 1, edge = 2) to be used
- * \param def default value if the attribute name supplied is \c None
- * if \c o is not a list.
- * \return 0 if everything was OK, 1 otherwise
- *
- * If the Python object is not a list, tries to interpret it as an attribute
- * name.
- */
-int igraphmodule_PyObject_to_attribute_values(PyObject *o,
-                          igraph_vector_t *v,
-                          igraphmodule_GraphObject* g,
-                          int type, igraph_real_t def) {
-  PyObject* list = o;
-  long i, n;
-
-  if (o==NULL) return 1;
-  
-  if (o == Py_None) {
-    if (type == ATTRHASH_IDX_VERTEX) n=igraph_vcount(&g->g);
-    else if (type == ATTRHASH_IDX_EDGE) n=igraph_ecount(&g->g);
-    else n=1;
-
-    if (igraph_vector_init(v, n)) return 1;
-    for (i=0; i<n; i++) VECTOR(*v)[i] = def;
-    return 0;
-  }
-
-  if (!PyList_Check(o)) {
-    list = PyDict_GetItem(((PyObject**)g->g.attr)[type], o);
-    if (!list) {
-      if (!PyErr_Occurred())
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-      return 1;
-    }
-  }
-
-  n=PyList_Size(list);
-  if (igraph_vector_init(v, n)) return 1;
-
-  for (i=0; i<n; i++) {
-    PyObject *item = PyList_GetItem(list, i);
-    if (!item) {
-      igraph_vector_destroy(v);
-      return 1;
-    }
-
-    if (PyInt_Check(item))
-      VECTOR(*v)[i] = PyInt_AsLong(item);
-    else if (PyLong_Check(item))
-      VECTOR(*v)[i] = PyLong_AsLong(item);
-    else if (PyFloat_Check(item))
-      VECTOR(*v)[i] = PyFloat_AsDouble(item);
-    else
-      VECTOR(*v)[i] = def;
-  }
-
-  return 0;
-}
-
-
-int igraphmodule_PyObject_to_drl_options_t(PyObject *obj,
-    igraph_layout_drl_options_t *options) {
-  if (obj == Py_None) {
-    igraph_layout_drl_options_init(options, IGRAPH_LAYOUT_DRL_DEFAULT);
-  } else if (PyString_Check(obj)) {
-    /* We have a string, so we are using a preset */
-    igraph_layout_drl_default_t def=IGRAPH_LAYOUT_DRL_DEFAULT;
-    if (PyString_IsEqualToASCIIString(obj, "default"))
-      def=IGRAPH_LAYOUT_DRL_DEFAULT;
-    else if (PyString_IsEqualToASCIIString(obj, "coarsen"))
-      def=IGRAPH_LAYOUT_DRL_COARSEN;
-    else if (PyString_IsEqualToASCIIString(obj, "coarsest"))
-      def=IGRAPH_LAYOUT_DRL_COARSEST;
-    else if (PyString_IsEqualToASCIIString(obj, "refine"))
-      def=IGRAPH_LAYOUT_DRL_REFINE;
-    else if (PyString_IsEqualToASCIIString(obj, "final"))
-      def=IGRAPH_LAYOUT_DRL_FINAL;
-    else {
-      PyErr_SetString(PyExc_ValueError, "unknown DrL template name. Must be one of: default, coarsen, coarsest, refine, final");
-      return 1;
-    }
-    if (igraph_layout_drl_options_init(options, def)) {
-      igraphmodule_handle_igraph_error();
-      return 1;
-    }
-  } else {
-    igraph_layout_drl_options_init(options, IGRAPH_LAYOUT_DRL_DEFAULT);
-#define CONVERT_DRL_OPTION(OPTION, TYPE) do { \
-      PyObject *o1; \
-      if (PyMapping_Check(obj)) { \
-        o1 = PyMapping_GetItemString(obj, #OPTION); \
-        igraphmodule_PyObject_to_##TYPE##_t(o1, &options->OPTION); \
-        Py_XDECREF(o1); \
-      } \
-      o1 = PyObject_GetAttrString(obj, #OPTION); \
-      igraphmodule_PyObject_to_##TYPE##_t(o1, &options->OPTION); \
-      Py_XDECREF(o1); \
-    } while (0)
-#define CONVERT_DRL_OPTION_BLOCK(NAME) do { \
-	  CONVERT_DRL_OPTION(NAME##_iterations, integer); \
-	  CONVERT_DRL_OPTION(NAME##_temperature, real); \
-	  CONVERT_DRL_OPTION(NAME##_attraction, real); \
-	  CONVERT_DRL_OPTION(NAME##_damping_mult, real); \
-    } while (0)
-	
-    CONVERT_DRL_OPTION(edge_cut, real);
-    CONVERT_DRL_OPTION_BLOCK(init);
-    CONVERT_DRL_OPTION_BLOCK(liquid);
-    CONVERT_DRL_OPTION_BLOCK(expansion);
-    CONVERT_DRL_OPTION_BLOCK(cooldown);
-    CONVERT_DRL_OPTION_BLOCK(crunch);
-    CONVERT_DRL_OPTION_BLOCK(simmer);
-
-#undef CONVERT_DRL_OPTION
-#undef CONVERT_DRL_OPTION_BLOCK
-
-    PyErr_Clear();
-	return 0;
-  }
-  return 0;
-}
-
-
-int igraphmodule_i_PyObject_pair_to_attribute_combination_record_t(
-    PyObject* name, PyObject* value,
-    igraph_attribute_combination_record_t *result) {
-  if (igraphmodule_PyObject_to_attribute_combination_type_t(value, &result->type))
-    return 1;
-
-  if (result->type == IGRAPH_ATTRIBUTE_COMBINE_FUNCTION) {
-    result->func = value;
-  } else {
-    result->func = 0;
-  }
-
-  if (name == Py_None)
-    result->name = 0;
-  else if (!PyString_Check(name)) {
-    PyErr_SetString(PyExc_TypeError, "keys must be strings or None in attribute combination specification dicts");
-    return 1;
-  } else {
-#ifdef IGRAPH_PYTHON3
-    result->name = PyString_CopyAsString(name);
-#else
-    result->name = PyString_AS_STRING(name);
-#endif
-  }
-
-  return 0;
-}
-
-/**
- * \brief Converts a Python object to an \c igraph_attribute_combination_t
- *
- * Raises suitable Python exceptions when needed.
- *
- * An \c igraph_attribute_combination_t specifies how the attributes of multiple
- * vertices/edges should be combined when they are collapsed into a single vertex
- * or edge (e.g., when simplifying a graph). For each attribute, one can specify
- * a Python callable object to call or one of a list of recognised strings which
- * map to simple functions. The recognised strings are as follows:
- *
- *   - \c "ignore"  - the attribute will be ignored
- *   - \c "sum"     - the attribute values will be added
- *   - \c "prod"    - the product of the attribute values will be taken
- *   - \c "min"     - the minimum attribute value will be used
- *   - \c "max"     - the maximum attribute value will be used
- *   - \c "random"  - a random value will be selected
- *   - \c "first"   - the first value encountered will be selected
- *   - \c "last"    - the last value encountered will be selected
- *   - \c "mean"    - the mean of the attributes will be selected
- *   - \c "median"  - the median of the attributes will be selected
- *   - \c "concat"  - the attribute values will be concatenated
- *
- * The Python object being converted must either be a string, a callable or a dict.
- * If a string is given, it is considered as an \c igraph_attribute_combination_t
- * object that combines all attributes according to the function given by that
- * string. If a callable is given, it is considered as an
- * \c igraph_attribute_combination_t that combines all attributes by calling the
- * callable and taking its return value. If a dict is given, its key-value pairs
- * are iterated, the keys specify the attribute names (a key of None means all
- * explicitly not specified attributes), the values specify the functions to
- * call for those attributes.
- *
- * \param object the Python object to be converted
- * \param result the result is returned here. It must be an uninitialized
- *   \c igraph_attribute_combination_t object, it will be initialized accordingly.
- *   It is the responsibility of the caller to 
- * \return 0 if everything was OK, 1 otherwise
- */
-int igraphmodule_PyObject_to_attribute_combination_t(PyObject* object,
-    igraph_attribute_combination_t *result) {
-  igraph_attribute_combination_record_t rec;
-
-  if (igraph_attribute_combination_init(result)) {
-    igraphmodule_handle_igraph_error();
-    return 1;
-  }
-
-  if (object == Py_None) {
-    return 0;
-  }
-
-  if (PyDict_Check(object)) {
-    /* a full-fledged dict was passed */
-    PyObject *key, *value;
-    Py_ssize_t pos = 0;
-
-    while (PyDict_Next(object, &pos, &key, &value)) {
-      if (igraphmodule_i_PyObject_pair_to_attribute_combination_record_t(key, value, &rec)) {
-        igraph_attribute_combination_destroy(result);
-        return 1;
-      }
-      igraph_attribute_combination_add(result, rec.name, rec.type, rec.func);
-#ifdef IGRAPH_PYTHON3
-      free((char*)rec.name);   /* was allocated in pair_to_attribute_combination_record_t above */
-#endif
-    }
-  } else {
-    /* assume it is a string or callable */
-    if (igraphmodule_i_PyObject_pair_to_attribute_combination_record_t(Py_None, object, &rec)) {
-      igraph_attribute_combination_destroy(result);
-      return 1;
-    }
-
-    igraph_attribute_combination_add(result, 0, rec.type, rec.func);
-#ifdef IGRAPH_PYTHON3
-    free((char*)rec.name);   /* was allocated in pair_to_attribute_combination_record_t above */
-#endif
-  }
-
-  return 0;
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/convert.h igraph-0.6.5/interfaces/python/src/convert.h
--- igraph-0.6.5~quantal1/interfaces/python/src/convert.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/convert.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,135 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-/************************ Miscellaneous functions *************************/
-
-/** \defgroup python_interface_conversion Converting between Python and igraph data types
- * \ingroup python_interface */
-
-#ifndef PYTHON_CONVERT_H
-#define PYTHON_CONVERT_H
-
-#include <Python.h>
-#include <igraph_constants.h>
-#include <igraph_types.h>
-#include "graphobject.h"
-
-typedef enum { IGRAPHMODULE_TYPE_INT=0, IGRAPHMODULE_TYPE_FLOAT }
-igraphmodule_conv_t;
-
-typedef struct {
-  const char* name;
-  int value;
-} igraphmodule_enum_translation_table_entry_t;
-
-int PyInt_AsInt(PyObject* obj, int* result);
-int PyLong_AsInt(PyObject* obj, int* result);
-
-/* Conversion from PyObject to enum types */
-
-int igraphmodule_PyObject_to_enum(PyObject *o,
-  igraphmodule_enum_translation_table_entry_t *table, int *result);
-int igraphmodule_PyObject_to_add_weights_t(PyObject *o, igraph_add_weights_t *result);
-int igraphmodule_PyObject_to_adjacency_t(PyObject *o, igraph_adjacency_t *result);
-int igraphmodule_PyObject_to_attribute_combination_type_t(PyObject* o,
-    igraph_attribute_combination_type_t *type);
-int igraphmodule_PyObject_to_barabasi_algorithm_t(PyObject *o,
-  igraph_barabasi_algorithm_t *result);
-int igraphmodule_PyObject_to_bliss_sh_t(PyObject *o, igraph_bliss_sh_t *result);
-int igraphmodule_PyObject_to_community_comparison_t(PyObject *obj,
-                  igraph_community_comparison_t *result); 
-int igraphmodule_PyObject_to_connectedness_t(PyObject *o, igraph_connectedness_t *result);
-int igraphmodule_PyObject_to_degseq_t(PyObject *o, igraph_degseq_t *result);
-int igraphmodule_PyObject_to_fas_algorithm_t(PyObject *o, igraph_fas_algorithm_t *result);
-int igraphmodule_PyObject_to_neimode_t(PyObject *o, igraph_neimode_t *result);
-int igraphmodule_PyObject_to_reciprocity_t(PyObject *o, igraph_reciprocity_t *result);
-int igraphmodule_PyObject_to_rewiring_t(PyObject *o, igraph_rewiring_t *result);
-int igraphmodule_PyObject_to_spinglass_implementation_t(PyObject *o, igraph_spinglass_implementation_t *result);
-int igraphmodule_PyObject_to_spincomm_update_t(PyObject *o, igraph_spincomm_update_t *result);
-int igraphmodule_PyObject_to_star_mode_t(PyObject *o, igraph_star_mode_t *result);
-int igraphmodule_PyObject_to_subgraph_implementation_t(PyObject *o, igraph_subgraph_implementation_t *result);
-int igraphmodule_PyObject_to_to_undirected_t(PyObject *o, igraph_to_undirected_t *result);
-int igraphmodule_PyObject_to_transitivity_mode_t(PyObject *o, igraph_transitivity_mode_t *result);
-int igraphmodule_PyObject_to_tree_mode_t(PyObject *o, igraph_tree_mode_t *result);
-int igraphmodule_PyObject_to_vconn_nei_t(PyObject *o, igraph_vconn_nei_t *result);
-
-/* Conversion from PyObject to igraph types */
-
-int igraphmodule_PyObject_to_integer_t(PyObject *object, igraph_integer_t *v);
-int igraphmodule_PyObject_to_real_t(PyObject *object, igraph_real_t *v);
-int igraphmodule_PyObject_to_igraph_t(PyObject *o, igraph_t **result);
-
-int igraphmodule_PyObject_to_vector_t(PyObject *list, igraph_vector_t *v, igraph_bool_t need_non_negative, igraph_bool_t pairs);
-int igraphmodule_PyObject_float_to_vector_t(PyObject *list, igraph_vector_t *v);
-int igraphmodule_PyObject_to_vector_int_t(PyObject *list, igraph_vector_int_t *v);
-int igraphmodule_PyObject_to_vector_long_t(PyObject *list, igraph_vector_long_t *v);
-int igraphmodule_PyObject_to_vector_bool_t(PyObject *list, igraph_vector_bool_t *v);
-
-int igraphmodule_PyObject_to_edgelist(PyObject *list, igraph_vector_t *v, igraph_t *graph);
-
-int igraphmodule_PyList_to_matrix_t(PyObject *o, igraph_matrix_t *m);
-PyObject* igraphmodule_strvector_t_to_PyList(igraph_strvector_t *v);
-int igraphmodule_PyList_to_strvector_t(PyObject* v, igraph_strvector_t *result);
-int igraphmodule_append_PyIter_to_vector_ptr_t(PyObject *it, igraph_vector_ptr_t *v);
-int igraphmodule_PyObject_to_vid(PyObject *o, igraph_integer_t *vid, igraph_t *graph);
-int igraphmodule_PyObject_to_vs_t(PyObject *o, igraph_vs_t *vs,
-                  igraph_t *graph, igraph_bool_t *return_single,
-				  igraph_integer_t *single_vid);
-int igraphmodule_PyObject_to_eid(PyObject *o, igraph_integer_t *eid, igraph_t *graph);
-int igraphmodule_PyObject_to_es_t(PyObject *o, igraph_es_t *es, igraph_t *graph,
-				  igraph_bool_t *return_single);
-int igraphmodule_PyObject_to_attribute_values(PyObject *o,
-					      igraph_vector_t *v,
-					      igraphmodule_GraphObject* g,
-					      int type,
-					      igraph_real_t def);
-int igraphmodule_PyObject_to_drl_options_t(PyObject *obj,
-                  igraph_layout_drl_options_t *options); 
-int igraphmodule_PyObject_to_attribute_combination_t(PyObject* object,
-    igraph_attribute_combination_t *type);
-
-/* Conversion from attributes to igraph types */
-
-int igraphmodule_attrib_to_vector_t(PyObject *o, igraphmodule_GraphObject *self,
-  igraph_vector_t **vptr, int attr_type);
-int igraphmodule_attrib_to_vector_int_t(PyObject *o, igraphmodule_GraphObject *self,
-  igraph_vector_int_t **vptr, int attr_type);
-int igraphmodule_attrib_to_vector_long_t(PyObject *o, igraphmodule_GraphObject *self,
-  igraph_vector_long_t **vptr, int attr_type);
-int igraphmodule_attrib_to_vector_bool_t(PyObject *o, igraphmodule_GraphObject *self,
-  igraph_vector_bool_t **vptr, int attr_type);
-
-/* Conversion from igraph types to PyObjects */
-
-PyObject* igraphmodule_vector_bool_t_to_PyList(const igraph_vector_bool_t *v);
-PyObject* igraphmodule_vector_t_to_PyList(const igraph_vector_t *v,
-        igraphmodule_conv_t type);
-PyObject* igraphmodule_vector_t_to_PyTuple(const igraph_vector_t *v);
-PyObject* igraphmodule_vector_t_pair_to_PyList(const igraph_vector_t *v1,
-        const igraph_vector_t *v2);
-PyObject* igraphmodule_vector_t_to_PyList_pairs(const igraph_vector_t *v);
-PyObject* igraphmodule_vector_ptr_t_to_PyList(const igraph_vector_ptr_t *v,
-        igraphmodule_conv_t type);
-PyObject* igraphmodule_vector_long_t_to_PyList(const igraph_vector_long_t *v);
-PyObject* igraphmodule_matrix_t_to_PyList(const igraph_matrix_t *m,
-        igraphmodule_conv_t type);
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/edgeobject.c igraph-0.6.5/interfaces/python/src/edgeobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/edgeobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/edgeobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,514 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sw=2 sts=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "attributes.h"
-#include "edgeobject.h"
-#include "graphobject.h"
-#include "vertexobject.h"
-#include "error.h"
-#include "py2compat.h"
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_edge Edge object
- */
-
-PyTypeObject igraphmodule_EdgeType;
-
-/**
- * \ingroup python_interface_edge
- * \brief Allocates a new Python edge object
- * \param gref weak reference of the \c igraph.Graph being referenced by the edge
- * \param idx the index of the edge
- * 
- * \warning \c igraph references its edges by indices, so if
- * you delete some edges from the graph, the edge indices will
- * change. Since the \c igraph.Edge objects do not follow these
- * changes, your existing edge objects will point to elsewhere
- * (or they might even get invalidated).
- */
-PyObject* igraphmodule_Edge_New(igraphmodule_GraphObject *gref, igraph_integer_t idx) {
-  igraphmodule_EdgeObject* self;
-  self=PyObject_New(igraphmodule_EdgeObject, &igraphmodule_EdgeType);
-  if (self) {
-    RC_ALLOC("Edge", self);
-    Py_INCREF(gref);
-    self->gref=gref;
-    self->idx=idx;
-  }
-  return (PyObject*)self;
-}
-
-/**
- * \ingroup python_interface_edge
- * \brief Clears the edge's subobject (before deallocation)
- */
-int igraphmodule_Edge_clear(igraphmodule_EdgeObject *self) {
-  PyObject *tmp;
-
-  tmp=(PyObject*)self->gref;
-  self->gref=NULL;
-  Py_XDECREF(tmp);
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_edge
- * \brief Deallocates a Python representation of a given edge object
- */
-void igraphmodule_Edge_dealloc(igraphmodule_EdgeObject* self) {
-  igraphmodule_Edge_clear(self);
-
-  RC_DEALLOC("Edge", self);
-
-  PyObject_Del((PyObject*)self);
-}
-
-/** \ingroup python_interface_edge
- * \brief Formats an \c igraph.Edge object as a string
- * 
- * \return the formatted textual representation as a \c PyObject
- */
-PyObject* igraphmodule_Edge_repr(igraphmodule_EdgeObject *self) {
-  PyObject *s;
-  PyObject *attrs;
-#ifndef IGRAPH_PYTHON3
-  PyObject *grepr, *drepr;
-#endif
-
-  attrs = igraphmodule_Edge_attributes(self);
-  if (attrs == 0)
-    return NULL;
-
-#ifdef IGRAPH_PYTHON3
-  s = PyUnicode_FromFormat("igraph.Edge(%R, %ld, %R)",
-      (PyObject*)self->gref, (long int)self->idx, attrs);
-  Py_DECREF(attrs);
-#else
-  grepr=PyObject_Repr((PyObject*)self->gref);
-  drepr=PyObject_Repr(attrs);
-  Py_DECREF(attrs);
-  if (!grepr || !drepr) {
-    Py_XDECREF(grepr);
-    Py_XDECREF(drepr);
-    return NULL;
-  }
-  s=PyString_FromFormat("igraph.Edge(%s, %ld, %s)", PyString_AsString(grepr),
-    (long int)self->idx, PyString_AsString(drepr));
-  Py_DECREF(grepr);
-  Py_DECREF(drepr);
-#endif
-  return s;
-}
-
-/** \ingroup python_interface_edge
- * \brief Returns the number of edge attributes
- */
-Py_ssize_t igraphmodule_Edge_attribute_count(igraphmodule_EdgeObject* self) {
-  igraphmodule_GraphObject *o = self->gref;
-  
-  if (!o) return 0;
-  if (!((PyObject**)o->g.attr)[1]) return 0;
-  return PyDict_Size(((PyObject**)o->g.attr)[1]);
-}
-
-/** \ingroup python_interface_edge
- * \brief Returns the list of attribute names
- */
-PyObject* igraphmodule_Edge_attribute_names(igraphmodule_EdgeObject* self) {
-  if (!self->gref) return NULL;
-  return igraphmodule_Graph_edge_attributes(self->gref);
-}
-
-/** \ingroup python_interface_edge
- * \brief Returns a dict with attribute names and values
- */
-PyObject* igraphmodule_Edge_attributes(igraphmodule_EdgeObject* self) {
-  igraphmodule_GraphObject *o = self->gref;
-  PyObject *names, *dict;
-  long int i, n;
-
-  dict=PyDict_New();
-  if (!dict)
-    return NULL;
-
-  names=igraphmodule_Graph_edge_attributes(o);
-  if (!names) {
-    Py_DECREF(dict);
-    return NULL;
-  }
-
-  n = PyList_Size(names);
-  for (i=0; i<n; i++) {
-    PyObject *name = PyList_GetItem(names, i);
-    if (name) {
-      PyObject *dictit;
-      dictit = PyDict_GetItem(((PyObject**)o->g.attr)[ATTRHASH_IDX_EDGE], name);
-      if (dictit) {
-        PyObject *value = PyList_GetItem(dictit, self->idx);
-        if (value) {
-          /* no need to Py_INCREF, PyDict_SetItem will do that */
-          PyDict_SetItem(dict, name, value);
-        }
-      }
-    }
-  }
-
-  return dict;
-}
-
-/**
- * \ingroup python_interface_edge
- * \brief Updates some attributes of an edge
- * 
- * \param self the edge object
- * \param args positional arguments
- * \param kwds keyword arguments
- */
-PyObject* igraphmodule_Edge_update_attributes(PyObject* self, PyObject* args,
-    PyObject* kwds) {
-  return igraphmodule_Vertex_update_attributes(self, args, kwds);
-}
-
-/** \ingroup python_interface_edge
- * \brief Returns the corresponding value to a given attribute of the edge
- * \param self the edge object
- * \param s the attribute name to be queried
- */
-PyObject* igraphmodule_Edge_get_attribute(igraphmodule_EdgeObject* self,
-                      PyObject* s) {
-  igraphmodule_GraphObject *o = self->gref;
-  PyObject* result;
-
-  result=PyDict_GetItem(((PyObject**)o->g.attr)[2], s);
-  if (result) {
-    /* result is a list, so get the element with index self->idx */
-    if (!PyList_Check(result)) {
-      PyErr_SetString(igraphmodule_InternalError, "Edge attribute dict member is not a list");
-      return NULL;
-    }
-    result=PyList_GetItem(result, self->idx);
-    Py_INCREF(result);
-    return result;
-  }
-  
-  /* result is NULL, check whether there was an error */
-  if (!PyErr_Occurred())
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-  return NULL;
-}
-
-/** \ingroup python_interface_edge
- * \brief Sets the corresponding value of a given attribute of the edge
- * \param self the edge object
- * \param k the attribute name to be set
- * \param v the value to be set
- * \return 0 if everything's ok, -1 in case of error
- */
-int igraphmodule_Edge_set_attribute(igraphmodule_EdgeObject* self, PyObject* k, PyObject* v) {
-  igraphmodule_GraphObject *o=self->gref;
-  PyObject* result;
-  int r;
-  
-  if (o==0) return -1;
-
-  if (v==NULL)
-    // we are deleting attribute
-    return PyDict_DelItem(((PyObject**)o->g.attr)[2], k);
-  
-  result=PyDict_GetItem(((PyObject**)o->g.attr)[2], k);
-  if (result) {
-    /* result is a list, so set the element with index self->idx */
-    if (!PyList_Check(result)) {
-      PyErr_SetString(igraphmodule_InternalError, "Vertex attribute dict member is not a list");
-      return -1;
-    }
-    /* we actually don't own a reference here to v, so we must increase
-     * its reference count, because PyList_SetItem will "steal" a reference!
-     * It took me 1.5 hours between London and Manchester to figure it out */
-    Py_INCREF(v);
-    r=PyList_SetItem(result, self->idx, v);
-    if (r == -1) { Py_DECREF(v); }
-    return r;
-  }
-  
-  /* result is NULL, check whether there was an error */
-  if (!PyErr_Occurred()) {
-    /* no, there wasn't, so we must simply add the attribute */
-    int n=(int)igraph_ecount(&o->g), i;
-    result=PyList_New(n);
-    for (i=0; i<n; i++) {
-      if (i != self->idx) {
-    Py_INCREF(Py_None);
-    if (PyList_SetItem(result, i, Py_None) == -1) {
-      Py_DECREF(Py_None);
-      Py_DECREF(result);
-      return -1;
-    }
-      } else {
-    /* Same game with the reference count here */
-    Py_INCREF(v);
-    if (PyList_SetItem(result, i, v) == -1) {
-      Py_DECREF(v);
-      Py_DECREF(result);
-      return -1;
-    }
-      }
-    }
-    if (PyDict_SetItem(((PyObject**)o->g.attr)[2], k, result) == -1) {
-      Py_DECREF(result); /* TODO: is it needed here? maybe not! */
-      return -1;
-    }
-    Py_DECREF(result); /* compensating for PyDict_SetItem */
-    return 0;
-  }
-  
-  return -1;
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the source node index of an edge
- */
-PyObject* igraphmodule_Edge_get_from(igraphmodule_EdgeObject* self, void* closure) {
-  igraphmodule_GraphObject *o = self->gref;
-  igraph_integer_t from, to;
-  
-  if (igraph_edge(&o->g, self->idx, &from, &to)) {
-    igraphmodule_handle_igraph_error(); return NULL;
-  }
-  return PyInt_FromLong((long int)from);
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the target node index of an edge
- */
-PyObject* igraphmodule_Edge_get_to(igraphmodule_EdgeObject* self, void* closure) {
-  igraphmodule_GraphObject *o = self->gref;
-  igraph_integer_t from, to;
-  
-  if (igraph_edge(&o->g, self->idx, &from, &to)) {
-    igraphmodule_handle_igraph_error(); return NULL;
-  }
-  return PyInt_FromLong((long)to);
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the edge index
- */
-PyObject* igraphmodule_Edge_get_index(igraphmodule_EdgeObject* self, void* closure) {
-  return PyInt_FromLong((long int)self->idx);
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the edge index as an igraph_integer_t
- */
-igraph_integer_t igraphmodule_Edge_get_index_igraph_integer(igraphmodule_EdgeObject* self) {
-  return self->idx;
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the edge index as an ordinary C long
- */
-long igraphmodule_Edge_get_index_long(igraphmodule_EdgeObject* self) {
-  return (long)self->idx;
-}
-
-/**
- * \ingroup python_interface_edge
- * Returns the target node index of an edge
- */
-PyObject* igraphmodule_Edge_get_tuple(igraphmodule_EdgeObject* self, void* closure) {
-  igraphmodule_GraphObject *o = self->gref;
-  igraph_integer_t from, to;
-  
-  if (igraph_edge(&o->g, self->idx, &from, &to)) {
-    igraphmodule_handle_igraph_error(); return NULL;
-  }
-  return Py_BuildValue("(ii)", (long)from, (long)to);
-}
-
-#define GRAPH_PROXY_METHOD(FUNC, METHODNAME) \
-    PyObject* igraphmodule_Edge_##FUNC(igraphmodule_EdgeObject* self, PyObject* args, PyObject* kwds) { \
-      PyObject *new_args, *item, *result;                     \
-      long int i, num_args = args ? PyTuple_Size(args)+1 : 1; \
-                                                              \
-      /* Prepend ourselves to args */                         \
-      new_args = PyTuple_New(num_args);                       \
-      Py_INCREF(self); PyTuple_SET_ITEM(new_args, 0, (PyObject*)self);   \
-      for (i = 1; i < num_args; i++) {                        \
-        item = PyTuple_GET_ITEM(args, i-1);                   \
-        Py_INCREF(item); PyTuple_SET_ITEM(new_args, i, item); \
-      }                                                       \
-                                                              \
-      /* Get the method instance */                           \
-      item = PyObject_GetAttrString((PyObject*)(self->gref), METHODNAME);  \
-      result = PyObject_Call(item, new_args, kwds);           \
-      Py_DECREF(item);                                        \
-      Py_DECREF(new_args);                                    \
-      return result;                                          \
-    }
-
-GRAPH_PROXY_METHOD(count_multiple, "count_multiple");
-GRAPH_PROXY_METHOD(delete, "delete_edges");
-GRAPH_PROXY_METHOD(is_loop, "is_loop");
-GRAPH_PROXY_METHOD(is_multiple, "is_multiple");
-GRAPH_PROXY_METHOD(is_mutual, "is_mutual");
-
-#undef GRAPH_PROXY_METHOD
-
-#define GRAPH_PROXY_METHOD_SPEC(FUNC, METHODNAME) \
-  {METHODNAME, (PyCFunction)igraphmodule_Edge_##FUNC, METH_VARARGS | METH_KEYWORDS, \
-    "Proxy method to L{Graph." METHODNAME "()}\n\n"              \
-    "This method calls the " METHODNAME " method of the L{Graph} class " \
-    "with this edge as the first argument, and returns the result.\n\n"\
-    "@see: Graph." METHODNAME "() for details."}
-#define GRAPH_PROXY_METHOD_SPEC_2(FUNC, METHODNAME, METHODNAME_IN_GRAPH) \
-  {METHODNAME, (PyCFunction)igraphmodule_Edge_##FUNC, METH_VARARGS | METH_KEYWORDS, \
-    "Proxy method to L{Graph." METHODNAME_IN_GRAPH "()}\n\n"              \
-    "This method calls the " METHODNAME_IN_GRAPH " method of the L{Graph} class " \
-    "with this edge as the first argument, and returns the result.\n\n"\
-    "@see: Graph." METHODNAME_IN_GRAPH "() for details."}
-
-/**
- * \ingroup python_interface_edge
- * Method table for the \c igraph.Edge object
- */
-PyMethodDef igraphmodule_Edge_methods[] = {
-  {"attributes", (PyCFunction)igraphmodule_Edge_attributes,
-    METH_NOARGS,
-    "attributes() -> dict\n\n"
-    "Returns a dict of attribute names and values for the edge\n"
-  },
-  {"attribute_names", (PyCFunction)igraphmodule_Edge_attribute_names,
-      METH_NOARGS,
-      "attribute_names() -> list\n\n"
-      "Returns the list of edge attribute names\n"
-  },
-  {"update_attributes", (PyCFunction)igraphmodule_Edge_update_attributes,
-    METH_VARARGS | METH_KEYWORDS,
-    "update_attributes(E, **F) -> None\n\n"
-    "Updates the attributes of the edge from dict/iterable E and F.\n\n"
-    "If E has a C{keys()} method, it does: C{for k in E: self[k] = E[k]}.\n"
-    "If E lacks a C{keys()} method, it does: C{for (k, v) in E: self[k] = v}.\n"
-    "In either case, this is followed by: C{for k in F: self[k] = F[k]}.\n\n"
-    "This method thus behaves similarly to the C{update()} method of Python\n"
-    "dictionaries."
-  },
-  GRAPH_PROXY_METHOD_SPEC(count_multiple, "count_multiple"),
-  GRAPH_PROXY_METHOD_SPEC_2(delete, "delete", "delete_edges"),
-  GRAPH_PROXY_METHOD_SPEC(is_loop, "is_loop"),
-  GRAPH_PROXY_METHOD_SPEC(is_multiple, "is_multiple"),
-  GRAPH_PROXY_METHOD_SPEC(is_mutual, "is_mutual"),
-  {NULL}
-};
-
-#undef GRAPH_PROXY_METHOD_SPEC
-#undef GRAPH_PROXY_METHOD_SPEC_2
-
-/**
- * \ingroup python_interface_edge
- * Getter/setter table for the \c igraph.Edge object
- */
-PyGetSetDef igraphmodule_Edge_getseters[] = {
-  {"source", (getter)igraphmodule_Edge_get_from, NULL,
-      "Source node index of this edge", NULL
-  },
-  {"target", (getter)igraphmodule_Edge_get_to, NULL,
-      "Target node index of this edge", NULL
-  },
-  {"tuple", (getter)igraphmodule_Edge_get_tuple, NULL,
-      "Source and target node index of this edge as a tuple", NULL
-  },
-  {"index", (getter)igraphmodule_Edge_get_index, NULL,
-      "Index of this edge", NULL,
-  },
-  {NULL}
-};
-
-/** \ingroup python_interface_edge
- * This structure is the collection of functions necessary to implement
- * the edge as a mapping (i.e. to allow the retrieval and setting of
- * igraph attributes in Python as if it were of a Python mapping type)
- */
-PyMappingMethods igraphmodule_Edge_as_mapping = {
-  // returns the number of edge attributes
-  (lenfunc)igraphmodule_Edge_attribute_count,
-  // returns an attribute by name
-  (binaryfunc)igraphmodule_Edge_get_attribute,
-  // sets an attribute by name
-  (objobjargproc)igraphmodule_Edge_set_attribute
-};
-
-/** \ingroup python_interface_edge
- * Python type object referencing the methods Python calls when it performs various operations on
- * an edge of a graph
- */
-PyTypeObject igraphmodule_EdgeType =
-{
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.Edge",                              // tp_name
-  sizeof(igraphmodule_EdgeObject),            // tp_basicsize
-  0,                                          // tp_itemsize
-  (destructor)igraphmodule_Edge_dealloc,      // tp_dealloc
-  0,                                          // tp_print
-  0,                                          // tp_getattr
-  0,                                          // tp_setattr
-  0,                                          /* tp_compare (2.x) / tp_reserved (3.x) */
-  (reprfunc)igraphmodule_Edge_repr,           // tp_repr
-  0,                                          // tp_as_number
-  0,                                          // tp_as_sequence
-  &igraphmodule_Edge_as_mapping,              // tp_as_mapping
-  0,                                          // tp_hash
-  0,                                          // tp_call
-  0,                                          // tp_str
-  0,                                          // tp_getattro
-  0,                                          // tp_setattro
-  0,                                          // tp_as_buffer
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,   // tp_flags
-  "Class representing a single edge in a graph.\n\n"
-  "The edge is referenced by its index, so if the underlying graph\n"
-  "changes, the semantics of the edge object might change as well\n"
-  "(if the edge indices are altered in the original graph).\n\n"
-  "The attributes of the edge can be accessed by using the edge\n"
-  "as a hash:\n\n"
-  "  >>> e[\"weight\"] = 2                  #doctest: +SKIP\n"
-  "  >>> print e[\"weight\"]                #doctest: +SKIP\n"
-  "  2\n", // tp_doc
-  0,                                          // tp_traverse
-  0,                                          // tp_clear
-  0,                                          // tp_richcompare
-  0,                                          // tp_weaklistoffset
-  0,                                          // tp_iter
-  0,                                          // tp_iternext
-  igraphmodule_Edge_methods,                  // tp_methods
-  0,                                          // tp_members
-  igraphmodule_Edge_getseters,                // tp_getset
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/edgeobject.h igraph-0.6.5/interfaces/python/src/edgeobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/edgeobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/edgeobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_EDGEOBJECT_H
-#define PYTHON_EDGEOBJECT_H
-
-#include <Python.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface_edge
- * \brief A structure representing an edge of a graph
- */
-typedef struct {
-  PyObject_HEAD
-  igraphmodule_GraphObject* gref;
-  igraph_integer_t idx;
-} igraphmodule_EdgeObject;
-
-int igraphmodule_Edge_clear(igraphmodule_EdgeObject *self);
-void igraphmodule_Edge_dealloc(igraphmodule_EdgeObject* self);
-
-PyObject* igraphmodule_Edge_New(igraphmodule_GraphObject *gref, igraph_integer_t idx);
-PyObject* igraphmodule_Edge_repr(igraphmodule_EdgeObject *self);
-PyObject* igraphmodule_Edge_attributes(igraphmodule_EdgeObject* self);
-PyObject* igraphmodule_Edge_attribute_names(igraphmodule_EdgeObject* self);
-igraph_integer_t igraphmodule_Edge_get_index_igraph_integer(igraphmodule_EdgeObject* self);
-long igraphmodule_Edge_get_index_long(igraphmodule_EdgeObject* self);
-PyObject* igraphmodule_Edge_update_attributes(PyObject* self, PyObject* args,
-    PyObject* kwds);
-
-extern PyTypeObject igraphmodule_EdgeType;
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/edgeseqobject.c igraph-0.6.5/interfaces/python/src/edgeseqobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/edgeseqobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/edgeseqobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,946 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sts=2 sw=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "attributes.h"
-#include "common.h"
-#include "convert.h"
-#include "edgeseqobject.h"
-#include "edgeobject.h"
-#include "error.h"
-#include "py2compat.h"
-
-#define GET_GRAPH(obj) (((igraphmodule_GraphObject*)obj->gref)->g)
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_edgeseq Edge sequence object
- */
-
-PyTypeObject igraphmodule_EdgeSeqType;
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Allocate a new edge sequence object for a given graph
- * \param g the graph object being referenced
- * \return the allocated PyObject
- */
-PyObject* igraphmodule_EdgeSeq_new(PyTypeObject *subtype,
-	PyObject *args, PyObject *kwds) {
-  igraphmodule_EdgeSeqObject* o;
-  
-  o=(igraphmodule_EdgeSeqObject*)PyType_GenericNew(subtype, args, kwds);
-  if (o == NULL) return NULL;
-
-  igraph_es_all(&o->es, IGRAPH_EDGEORDER_ID);
-  o->gref=0;
-  o->weakreflist=0;
-
-  RC_ALLOC("EdgeSeq", o);
-  
-  return (PyObject*)o;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Copies an edge sequence object
- * \return the copied PyObject
- */
-igraphmodule_EdgeSeqObject*
-igraphmodule_EdgeSeq_copy(igraphmodule_EdgeSeqObject* o) {
-  igraphmodule_EdgeSeqObject *copy;
-
-  copy=(igraphmodule_EdgeSeqObject*)PyType_GenericNew(Py_TYPE(o), 0, 0);
-  if (copy == NULL) return NULL;
- 
-  if (igraph_es_type(&o->es) == IGRAPH_ES_VECTOR) {
-    igraph_vector_t v;
-    if (igraph_vector_copy(&v, o->es.data.vecptr)) {
-      igraphmodule_handle_igraph_error();
-      return 0;
-    }
-    if (igraph_es_vector_copy(&copy->es, &v)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&v);
-      return 0;
-    }
-    igraph_vector_destroy(&v);
-  } else {
-    copy->es = o->es;
-  }
-
-  copy->gref = o->gref;
-  if (o->gref) Py_INCREF(o->gref);
-  RC_ALLOC("EdgeSeq(copy)", copy);
-
-  return copy;
-}
-
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Initialize a new edge sequence object for a given graph
- * \return the initialized PyObject
- */
-int igraphmodule_EdgeSeq_init(igraphmodule_EdgeSeqObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "graph", "edges", NULL };
-  PyObject *g, *esobj=Py_None;
-  igraph_es_t es;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O", kwlist,
-    &igraphmodule_GraphType, &g, &esobj))
-      return -1;
-
-  if (esobj == Py_None) {
-    /* If es is None, we are selecting all the edges */
-    igraph_es_all(&es, IGRAPH_EDGEORDER_ID);
-  } else if (PyInt_Check(esobj)) {
-    /* We selected a single edge */
-    long int idx = PyInt_AsLong(esobj);
-    if (idx < 0 || idx >= igraph_ecount(&((igraphmodule_GraphObject*)g)->g)) {
-      PyErr_SetString(PyExc_ValueError, "edge index out of range");
-      return -1;
-    }
-    igraph_es_1(&es, (igraph_integer_t)idx);
-  } else {
-	/* We selected multiple edges */
-    igraph_vector_t v;
-    igraph_integer_t n = igraph_ecount(&((igraphmodule_GraphObject*)g)->g);
-    if (igraphmodule_PyObject_to_vector_t(esobj, &v, 1, 0))
-      return -1;
-    if (!igraph_vector_isininterval(&v, 0, n-1)) {
-      igraph_vector_destroy(&v);
-      PyErr_SetString(PyExc_ValueError, "edge index out of range");
-      return -1;
-    }
-    if (igraph_es_vector_copy(&es, &v)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&v);
-      return -1;
-    }
-    igraph_vector_destroy(&v);
-  }
-
-  self->es = es;
-  Py_INCREF(g);
-  self->gref = (igraphmodule_GraphObject*)g;
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Deallocates a Python representation of a given edge sequence object
- */
-void igraphmodule_EdgeSeq_dealloc(igraphmodule_EdgeSeqObject* self) {
-  if (self->weakreflist != NULL)
-    PyObject_ClearWeakRefs((PyObject *)self);
-  if (self->gref) {
-    igraph_es_destroy(&self->es);
-    Py_DECREF(self->gref);
-    self->gref=0;
-  }
-  Py_TYPE(self)->tp_free((PyObject*)self);
-
-  RC_DEALLOC("EdgeSeq", self);
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Returns the length of the sequence (i.e. the number of edges in the graph)
- */
-int igraphmodule_EdgeSeq_sq_length(igraphmodule_EdgeSeqObject* self) {
-  igraph_t *g;
-  igraph_integer_t result;
-
-  g=&GET_GRAPH(self);
-  if (igraph_es_size(g, &self->es, &result)) {
-    igraphmodule_handle_igraph_error();
-    return -1;
-  }
-  return (int)result;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Returns the item at the given index in the sequence
- */
-PyObject* igraphmodule_EdgeSeq_sq_item(igraphmodule_EdgeSeqObject* self,
-                       Py_ssize_t i) {
-  igraph_t *g;
-  igraph_integer_t idx = -1;
-  
-  if (!self->gref) return NULL;
-  g=&GET_GRAPH(self);
-  switch (igraph_es_type(&self->es)) {
-    case IGRAPH_ES_ALL:
-      if (i >= 0 && i < igraph_ecount(g))
-        idx = (igraph_integer_t)i;
-      break;
-
-    case IGRAPH_ES_VECTOR:
-    case IGRAPH_ES_VECTORPTR:
-      if (i >= 0 && i < igraph_vector_size(self->es.data.vecptr))
-        idx = (igraph_integer_t)VECTOR(*self->es.data.vecptr)[i];
-      break;
-
-    case IGRAPH_ES_1:
-      if (i == 0)
-        idx = self->es.data.eid;
-      break;
-
-    case IGRAPH_ES_SEQ:
-      if (i >= 0 && i < self->es.data.seq.to - self->es.data.seq.from)
-        idx = self->es.data.seq.from + (igraph_integer_t)i;
-      break;
-
-    /* TODO: IGRAPH_ES_PAIRS, IGRAPH_ES_ADJ, IGRAPH_ES_PATH,
-       IGRAPH_ES_MULTIPATH - someday :) They are unused yet in the Python
-       interface */
-  }
-  if (idx < 0) {
-    PyErr_SetString(PyExc_IndexError, "edge index out of range");
-    return NULL;
-  }
-
-  return igraphmodule_Edge_New(self->gref, idx);
-}
-
-/** \ingroup python_interface_edgeseq
- * \brief Returns the list of attribute names
- */
-PyObject* igraphmodule_EdgeSeq_attribute_names(igraphmodule_EdgeSeqObject* self) {
-  return igraphmodule_Graph_edge_attributes(self->gref);
-}
-
-/** \ingroup python_interface_edgeseq
- * \brief Returns the list of values for a given attribute
- */
-PyObject* igraphmodule_EdgeSeq_get_attribute_values(igraphmodule_EdgeSeqObject* self, PyObject* o) {
-  igraphmodule_GraphObject *gr = self->gref;
-  PyObject *result=0, *values, *item;
-  long int i, n;
-
-  PyErr_Clear();
-  values=PyDict_GetItem(ATTR_STRUCT_DICT(&gr->g)[ATTRHASH_IDX_EDGE], o);
-  if (!values) {
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-    return NULL;
-  } else if (PyErr_Occurred()) return NULL;
-
-  switch (igraph_es_type(&self->es)) {
-    case IGRAPH_ES_NONE:
-      n = 0;
-      result = PyList_New(0);
-      break;
-
-    case IGRAPH_ES_ALL:
-      n = PyList_Size(values);
-      result = PyList_New(n);
-      if (!result) return 0;
-
-      for (i=0; i<n; i++) {
-          item = PyList_GET_ITEM(values, i);
-          Py_INCREF(item);
-          PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    case IGRAPH_ES_VECTOR:
-    case IGRAPH_ES_VECTORPTR:
-      n = igraph_vector_size(self->es.data.vecptr);
-      result = PyList_New(n);
-      if (!result) return 0;
-
-      for (i=0; i<n; i++) {
-        item = PyList_GET_ITEM(values, (long)VECTOR(*self->es.data.vecptr)[i]);
-        Py_INCREF(item);
-        PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    case IGRAPH_ES_SEQ:
-      n = self->es.data.seq.to - self->es.data.seq.from;
-      result = PyList_New(n);
-      if (!result) return 0;
-
-      for (i=0; i<n; i++) {
-        item = PyList_GET_ITEM(values, (long)self->es.data.seq.from+i);
-        Py_INCREF(item);
-        PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    default:
-      PyErr_SetString(PyExc_RuntimeError, "invalid edge selector");
-  }
-
-  return result;
-}
-
-PyObject* igraphmodule_EdgeSeq_is_all(igraphmodule_EdgeSeqObject* self) {
-  if (igraph_es_is_all(&self->es))
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-PyObject* igraphmodule_EdgeSeq_get_attribute_values_mapping(igraphmodule_EdgeSeqObject *self, PyObject *o) {
-  /* Handle integer indices according to the sequence protocol */
-  if (PyInt_Check(o))
-    return igraphmodule_EdgeSeq_sq_item(self, PyInt_AsLong(o));
-
-  /* Handle strings according to the mapping protocol */
-  if (PyBaseString_Check(o))
-    return igraphmodule_EdgeSeq_get_attribute_values(self, o);
-
-  /* Handle iterables and slices by calling the select() method */
-  if (PySlice_Check(o) || PyObject_HasAttrString(o, "__iter__")) {
-    PyObject *result, *args;
-    args = Py_BuildValue("(O)", o);
-    if (!args)
-      return NULL;
-    result = igraphmodule_EdgeSeq_select(self, args);
-    Py_DECREF(args);
-    return result;
-  }
-
-  /* Handle everything else according to the mapping protocol */
-  return igraphmodule_EdgeSeq_get_attribute_values(self, o);
-}
-
-/** \ingroup python_interface_edgeseq
- * \brief Sets the list of values for a given attribute
- */
-int igraphmodule_EdgeSeq_set_attribute_values_mapping(igraphmodule_EdgeSeqObject* self, PyObject* attrname, PyObject* values) {
-  PyObject *dict, *list, *item;
-  igraphmodule_GraphObject *gr=self->gref;
-  igraph_vector_t es;
-  long i, j, n, no_of_edges;
-  
-  dict = ATTR_STRUCT_DICT(&gr->g)[ATTRHASH_IDX_EDGE];
-
-  if (values == 0) {
-    if (igraph_es_type(&self->es) == IGRAPH_ES_ALL)
-      return PyDict_DelItem(dict, attrname);
-    PyErr_SetString(PyExc_TypeError, "can't delete attribute from an edge sequence not representing the whole graph");
-    return -1;
-  }
-
- if (PyString_Check(values) || !PySequence_Check(values)) {
-    /* If values is a string or not a sequence, we construct a list with a
-     * single element (the value itself) and then call ourselves again */
-    int result;
-    PyObject *newList = PyList_New(1);
-    if (newList == 0) return -1;
-    Py_INCREF(values);
-    PyList_SET_ITEM(newList, 0, values);    /* reference stolen here */
-    result = igraphmodule_EdgeSeq_set_attribute_values_mapping(self, attrname, newList);
-    Py_DECREF(newList);
-    return result;
-  }
-
-  n=PySequence_Size(values);
-  if (n<0) return -1;
-
-  if (igraph_es_type(&self->es) == IGRAPH_ES_ALL) {
-    no_of_edges = (long)igraph_ecount(&gr->g);
-    if (n == 0 && no_of_edges > 0) {
-      PyErr_SetString(PyExc_ValueError, "sequence must not be empty");
-      return -1;
-    }
-
-    /* Check if we already have attributes with the given name */
-    list = PyDict_GetItem(dict, attrname);
-    if (list != 0) {
-      /* Yes, we have. Modify its items to the items found in values */
-      for (i=0, j=0; i<no_of_edges; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) return -1;
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        if (PyList_SetItem(list, i, item)) {
-          Py_DECREF(item);
-          return -1;
-        } /* PyList_SetItem stole a reference to the item automatically */ 
-      }
-    } else if (values != 0) {
-      /* We don't have attributes with the given name yet. Create an entry
-       * in the dict, create a new list and copy everything */
-      list = PyList_New(no_of_edges);
-      if (list == 0) return -1;
-      for (i=0, j=0; i<no_of_edges; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) { Py_DECREF(list); return -1; }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        PyList_SET_ITEM(list, i, item);
-        /* PyList_SET_ITEM stole a reference to the item automatically */
-      }
-      if (PyDict_SetItem(dict, attrname, list)) {
-        Py_DECREF(list);
-        return -1;
-      }
-      Py_DECREF(list);   /* compensating for PyDict_SetItem */
-    }
-  } else {
-    /* We are working with a subset of the graph. Convert the sequence to a
-     * vector and loop through it */
-    if (igraph_vector_init(&es, 0)) {
-      igraphmodule_handle_igraph_error();
-      return -1;
-    } 
-    if (igraph_es_as_vector(&gr->g, self->es, &es)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&es);
-      return -1;
-    }
-    no_of_edges = (long)igraph_vector_size(&es);
-    if (n == 0 && no_of_edges > 0) {
-      PyErr_SetString(PyExc_ValueError, "sequence must not be empty");
-      igraph_vector_destroy(&es);
-      return -1;
-    }
-    /* Check if we already have attributes with the given name */
-    list = PyDict_GetItem(dict, attrname);
-    if (list != 0) {
-      /* Yes, we have. Modify its items to the items found in values */
-      for (i=0, j=0; i<no_of_edges; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) { igraph_vector_destroy(&es); return -1; }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        if (PyList_SetItem(list, (long)VECTOR(es)[i], item)) {
-          Py_DECREF(item);
-          igraph_vector_destroy(&es);
-          return -1;
-        } /* PyList_SetItem stole a reference to the item automatically */ 
-      }
-      igraph_vector_destroy(&es);
-    } else if (values != 0) {
-      /* We don't have attributes with the given name yet. Create an entry
-       * in the dict, create a new list, fill with None for vertices not in the
-       * sequence and copy the rest */
-      long n2 = igraph_ecount(&gr->g);
-      list = PyList_New(n2);
-      if (list == 0) { igraph_vector_destroy(&es); return -1; }
-      for (i=0; i<n2; i++) {
-        Py_INCREF(Py_None);
-        PyList_SET_ITEM(list, i, Py_None);
-      }
-      for (i=0, j=0; i<no_of_edges; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) {
-          igraph_vector_destroy(&es);
-          Py_DECREF(list); return -1;
-        }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        PyList_SET_ITEM(list, (long)VECTOR(es)[i], item);
-        /* PyList_SET_ITEM stole a reference to the item automatically */
-      }
-      igraph_vector_destroy(&es);
-      if (PyDict_SetItem(dict, attrname, list)) {
-        Py_DECREF(list);
-        return -1;
-      }
-      Py_DECREF(list);   /* compensating for PyDict_SetItem */
-    }
-  }
-  return 0;
-}
-
-PyObject* igraphmodule_EdgeSeq_set_attribute_values(igraphmodule_EdgeSeqObject *self,
-    PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "attrname", "values", NULL };
-  PyObject *attrname, *values;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO", kwlist,
-                   &attrname, &values))
-    return NULL;
-
-  if (igraphmodule_EdgeSeq_set_attribute_values_mapping(self, attrname, values))
-    return NULL;
-
-  Py_RETURN_NONE;
-}
-
-/**
- * \ingroup python_interface_edgqseq
- * \brief Selects a single edge from the edge sequence based on some criteria
- */
-PyObject* igraphmodule_EdgeSeq_find(igraphmodule_EdgeSeqObject *self, PyObject *args) {
-  PyObject *item;
-  long int i, n;
-
-  if (!PyArg_ParseTuple(args, "O", &item))
-    return NULL;
-
-  if (PyCallable_Check(item)) {
-    /* Call the callable for every edge in the current sequence and return
-     * the first one for which it evaluates to True */
-    n = PySequence_Size((PyObject*)self);
-    for (i=0; i<n; i++) {
-      PyObject *edge = PySequence_GetItem((PyObject*)self, i);
-      PyObject *call_result;
-      if (edge == 0)
-        return NULL;
-      call_result = PyObject_CallFunctionObjArgs(item, edge, NULL);
-      if (call_result == 0) {
-        Py_DECREF(edge);
-        return NULL;
-      }
-      if (PyObject_IsTrue(call_result)) {
-        Py_DECREF(call_result);
-        return edge;  /* reference passed to caller */
-      }
-      Py_DECREF(call_result);
-      Py_DECREF(edge);
-    }
-  } else if (PyInt_Check(item)) {
-    /* Integers are interpreted as indices on the edge set and NOT on the
-     * original, untouched edge sequence of the graph */
-    return PySequence_GetItem((PyObject*)self, PyInt_AsLong(item));
-  }
-
-  PyErr_SetString(PyExc_IndexError, "no such edge");
-  return NULL;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief Selects a subset of the edge sequence based on some criteria
- */
-PyObject* igraphmodule_EdgeSeq_select(igraphmodule_EdgeSeqObject *self, PyObject *args) {
-  igraphmodule_EdgeSeqObject *result;
-  igraphmodule_GraphObject *gr;
-  long i, j, n, m;
-
-  gr=self->gref;
-  result=igraphmodule_EdgeSeq_copy(self);
-  if (result == 0)
-    return NULL;
-
-  /* First, filter by positional arguments */
-  n = PyTuple_Size(args);
-  for (i=0; i<n; i++) {
-    PyObject *item = PyTuple_GET_ITEM(args, i);
-    if (item == Py_None) {
-      /* None means: select nothing */
-      igraph_es_destroy(&result->es);
-      igraph_es_none(&result->es);
-      /* We can simply bail out here */
-      return (PyObject*)result;
-    } else if (PyCallable_Check(item)) {
-      /* Call the callable for every edge in the current sequence to
-       * determine what's up */
-      igraph_bool_t was_excluded = 0;
-      igraph_vector_t v;
-
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-
-      m = PySequence_Size((PyObject*)result);
-      for (j=0; j<m; j++) {
-        PyObject *edge = PySequence_GetItem((PyObject*)result, j);
-        PyObject *call_result;
-        if (edge == 0) {
-          Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          return NULL;
-        }
-        call_result = PyObject_CallFunctionObjArgs(item, edge, NULL);
-        if (call_result == 0) {
-          Py_DECREF(edge); Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          return NULL;
-        }
-        if (PyObject_IsTrue(call_result))
-          igraph_vector_push_back(&v,
-            igraphmodule_Edge_get_index_long((igraphmodule_EdgeObject*)edge));
-        else was_excluded=1;
-        Py_DECREF(call_result);
-        Py_DECREF(edge);
-      }
-
-      if (was_excluded) {
-        igraph_es_destroy(&result->es);
-        if (igraph_es_vector_copy(&result->es, &v)) {
-          Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          igraphmodule_handle_igraph_error();
-          return NULL;
-        }
-      }
-
-      igraph_vector_destroy(&v);
-    } else if (PyInt_Check(item)) {
-      /* Integers are treated specially: from now on, all remaining items
-       * in the argument list must be integers and they will be used together
-       * to restrict the edge set. Integers are interpreted as indices on the
-       * edge set and NOT on the original, untouched edge sequence of the
-       * graph */
-      igraph_vector_t v, v2;
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_vector_init(&v2, 0)) {
-        igraph_vector_destroy(&v);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_es_as_vector(&gr->g, self->es, &v2)) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      m = igraph_vector_size(&v2);
-      for (; i<n; i++) {
-        PyObject *item2 = PyTuple_GET_ITEM(args, i);
-        long idx;
-        if (!PyInt_Check(item2)) {
-          Py_DECREF(result);
-          PyErr_SetString(PyExc_TypeError, "edge indices expected");
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-        idx = PyInt_AsLong(item2);
-        if (idx >= m || idx < 0) {
-          PyErr_SetString(PyExc_ValueError, "edge index out of range");
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-        if (igraph_vector_push_back(&v, VECTOR(v2)[idx])) {
-          Py_DECREF(result);
-          igraphmodule_handle_igraph_error();
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-      }
-      igraph_vector_destroy(&v2);
-      igraph_es_destroy(&result->es);
-      if (igraph_es_vector_copy(&result->es, &v)) {
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        igraph_vector_destroy(&v);
-        return NULL;
-      }
-      igraph_vector_destroy(&v);
-    } else {
-      /* Iterators and everything that was not handled directly */
-      PyObject *iter, *item2;
-      igraph_vector_t v, v2;
-      
-      /* Allocate stuff */
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_vector_init(&v2, 0)) {
-        igraph_vector_destroy(&v);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_es_as_vector(&gr->g, self->es, &v2)) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      m = igraph_vector_size(&v2);
-
-      /* Create an appropriate iterator */
-      if (PySlice_Check(item)) {
-        /* Create an iterator from the slice (which is not iterable by default )*/
-        Py_ssize_t start, stop, step, sl;
-        PyObject* range;
-        igraph_bool_t ok;
-
-        /* Casting to void* because Python 2.x expects PySliceObject*
-         * but Python 3.x expects PyObject* */
-        ok = (PySlice_GetIndicesEx((void*)item, igraph_vector_size(&v2),
-              &start, &stop, &step, &sl) == 0);
-        if (ok) {
-          range = PyObject_CallFunction((PyObject*)&PyRange_Type, "lll", start, stop, step);
-          ok = (range != 0);
-        }
-        if (ok) {
-          iter = PyObject_GetIter(range);
-          Py_DECREF(range);
-          ok = (iter != 0);
-        }
-        if (!ok) {
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          PyErr_SetString(PyExc_TypeError, "error while converting slice to iterator");
-          Py_DECREF(result);
-          return 0;
-        }
-      } else {
-        /* Simply create the iterator corresponding to the object */
-        iter = PyObject_GetIter(item);
-      }
-
-      /* Did we manage to get an iterator? */
-      if (iter == 0) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        PyErr_SetString(PyExc_TypeError, "invalid edge filter among positional arguments");
-        Py_DECREF(result);
-        return 0;
-      }
-      /* Do the iteration */
-      while ((item2=PyIter_Next(iter)) != 0) {
-        if (PyInt_Check(item2)) {
-          long idx = PyInt_AsLong(item2);
-          Py_DECREF(item2);
-          if (idx >= m || idx < 0) {
-            PyErr_SetString(PyExc_ValueError, "edge index out of range");
-            Py_DECREF(result);
-            Py_DECREF(iter);
-            igraph_vector_destroy(&v);
-            igraph_vector_destroy(&v2);
-            return NULL;
-          }
-          if (igraph_vector_push_back(&v, VECTOR(v2)[idx])) {
-            Py_DECREF(result);
-            Py_DECREF(iter);
-            igraphmodule_handle_igraph_error();
-            igraph_vector_destroy(&v);
-            igraph_vector_destroy(&v2);
-            return NULL;
-          }
-        } else {
-          /* We simply ignore elements that we don't know */
-          Py_DECREF(item2);
-        }
-      }
-      /* Deallocate stuff */
-      igraph_vector_destroy(&v2);
-      Py_DECREF(iter);
-      if (PyErr_Occurred()) {
-        igraph_vector_destroy(&v);
-        Py_DECREF(result);
-        return 0;
-      }
-      igraph_es_destroy(&result->es);
-      if (igraph_es_vector_copy(&result->es, &v)) {
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        igraph_vector_destroy(&v);
-        return NULL;
-      }
-      igraph_vector_destroy(&v);
-    }
-  }
-
-  return (PyObject*)result;
-}
-
-
-/**
- * \ingroup python_interface_edgeseq
- * Method table for the \c igraph.EdgeSeq object
- */
-PyMethodDef igraphmodule_EdgeSeq_methods[] = {
-  {"attribute_names", (PyCFunction)igraphmodule_EdgeSeq_attribute_names,
-   METH_NOARGS,
-   "attribute_names() -> list\n\n"
-   "Returns the attribute name list of the graph's edges\n"
-  },
-  {"find", (PyCFunction)igraphmodule_EdgeSeq_find,
-   METH_VARARGS,
-   "find(condition) -> Edge\n\n"
-   "For internal use only.\n"
-  },
-  {"get_attribute_values", (PyCFunction)igraphmodule_EdgeSeq_get_attribute_values,
-   METH_O,
-   "get_attribute_values(attrname) -> list\n\n"
-   "Returns the value of a given edge attribute for all edges.\n\n"
-   "@param attrname: the name of the attribute\n"
-  },
-  {"is_all", (PyCFunction)igraphmodule_EdgeSeq_is_all, METH_NOARGS,
-   "is_all() -> bool\n\n"
-   "Returns whether the edge sequence contains all the edges exactly once, in\n"
-   "the order of their edge IDs.\n\n"
-   "This is used for optimizations in some of the edge selector routines.\n"
-  },
-  {"set_attribute_values", (PyCFunction)igraphmodule_EdgeSeq_set_attribute_values,
-   METH_VARARGS | METH_KEYWORDS,
-   "set_attribute_values(attrname, values) -> list\n"
-   "Sets the value of a given edge attribute for all vertices\n"
-   "@param attrname: the name of the attribute\n"
-   "@param values: the new attribute values in a list\n"
-  },
-  {"select", (PyCFunction)igraphmodule_EdgeSeq_select,
-   METH_VARARGS,
-   "select(...) -> VertexSeq\n\n"
-   "For internal use only.\n"
-  },
-  {NULL}
-};
-
-/**
- * \ingroup python_interface_edgeseq
- * This is the collection of functions necessary to implement the
- * edge sequence as a real sequence (e.g. allowing to reference
- * edges by indices)
- */
-static PySequenceMethods igraphmodule_EdgeSeq_as_sequence = {
-  (lenfunc)igraphmodule_EdgeSeq_sq_length,
-  0,               /* sq_concat */
-  0,               /* sq_repeat */
-  (ssizeargfunc)igraphmodule_EdgeSeq_sq_item, /* sq_item */
-  0,                                          /* sq_slice */
-  0,                                          /* sq_ass_item */
-  0,                                          /* sq_ass_slice */
-  0,                                          /* sq_contains */
-  0,                                          /* sq_inplace_concat */
-  0,                                          /* sq_inplace_repeat */
-};
-
-/**
- * \ingroup python_interface_edgeseq
- * This is the collection of functions necessary to implement the
- * edge sequence as a mapping (which maps attribute names to values)
- */
-static PyMappingMethods igraphmodule_EdgeSeq_as_mapping = {
-    /* returns the number of edge attributes */
-    (lenfunc) 0,
-    /* returns the values of an attribute by name */
-    (binaryfunc) igraphmodule_EdgeSeq_get_attribute_values_mapping,
-    /* sets the values of an attribute by name */
-    (objobjargproc) igraphmodule_EdgeSeq_set_attribute_values_mapping,
-};
-
-/**
- * \ingroup python_interface_edgeseq
- * Returns the graph where the edge sequence belongs
- */
-PyObject* igraphmodule_EdgeSeq_get_graph(igraphmodule_EdgeSeqObject* self,
-  void* closure) {
-  Py_INCREF(self->gref);
-  return (PyObject*)self->gref;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * Returns the indices of the edges in this edge sequence 
- */
-PyObject* igraphmodule_EdgeSeq_get_indices(igraphmodule_EdgeSeqObject* self,
-  void* closure) {
-  igraphmodule_GraphObject *gr = self->gref;
-  igraph_vector_t es;
-  PyObject *result;
-
-  if (igraph_vector_init(&es, 0)) {
-    igraphmodule_handle_igraph_error();
-    return 0;
-  } 
-  if (igraph_es_as_vector(&gr->g, self->es, &es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&es);
-    return 0;
-  }
-
-  result = igraphmodule_vector_t_to_PyList(&es, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&es);
-
-  return result;
-}
-
-/**
- * \ingroup python_interface_edgeseq
- * Getter/setter table for the \c igraph.EdgeSeq object
- */
-PyGetSetDef igraphmodule_EdgeSeq_getseters[] = {
-  {"graph", (getter)igraphmodule_EdgeSeq_get_graph, NULL,
-      "The graph the edge sequence belongs to", NULL},
-  {"indices", (getter)igraphmodule_EdgeSeq_get_indices, NULL,
-      "The edge indices in this edge sequence", NULL,
-  },
-  {NULL}
-};
-
-/** \ingroup python_interface_edgeseq
- * Python type object referencing the methods Python calls when it performs various operations on
- * an edge sequence of a graph
- */
-PyTypeObject igraphmodule_EdgeSeqType =
-{
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.core.EdgeSeq",                    /* tp_name */
-  sizeof(igraphmodule_EdgeSeqObject),       /* tp_basicsize */
-  0,                                        /* tp_itemsize */
-  (destructor)igraphmodule_EdgeSeq_dealloc, /* tp_dealloc */
-  0,                                        /* tp_print */
-  0,                                        /* tp_getattr */
-  0,                                        /* tp_setattr */
-  0,                                        /* tp_compare (2.x) / tp_reserved (3.x) */
-  0,                                        /* tp_repr */
-  0,                                        /* tp_as_number */
-  &igraphmodule_EdgeSeq_as_sequence,        /* tp_as_sequence */
-  &igraphmodule_EdgeSeq_as_mapping,         /* tp_as_mapping */
-  0,                                        /* tp_hash */
-  0,                                        /* tp_call */
-  0,                                        /* tp_str */
-  0,                                        /* tp_getattro */
-  0,                                        /* tp_setattro */
-  0,                                        /* tp_as_buffer */
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /* tp_flags */
-  "Low-level representation of an edge sequence.\n\n" /* tp_doc */
-  "Don't use it directly, use L{igraph.EdgeSeq} instead.\n\n"
-  "@deffield ref: Reference",
-  0,                                          /* tp_traverse */
-  0,                                          /* tp_clear */
-  0,                                          /* tp_richcompare */
-  offsetof(igraphmodule_EdgeSeqObject, weakreflist), /* tp_weaklistoffset */
-  0,                                          /* tp_iter */
-  0,                                          /* tp_iternext */
-  igraphmodule_EdgeSeq_methods,               /* tp_methods */
-  0,                                          /* tp_members */
-  igraphmodule_EdgeSeq_getseters,             /* tp_getset */
-  0,                                          /* tp_base */
-  0,                                          /* tp_dict */
-  0,                                          /* tp_descr_get */
-  0,                                          /* tp_descr_set */
-  0,                                          /* tp_dictoffset */
-  (initproc) igraphmodule_EdgeSeq_init,       /* tp_init */
-  0,                                          /* tp_alloc */
-  (newfunc) igraphmodule_EdgeSeq_new,         /* tp_new */
-  0,                                          /* tp_free */
-  0,                                          /* tp_is_gc */
-  0,                                          /* tp_bases */
-  0,                                          /* tp_mro */
-  0,                                          /* tp_cache  */
-  0,                                          /* tp_subclasses */
-  0,                                          /* tp_weakreflist */
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/edgeseqobject.h igraph-0.6.5/interfaces/python/src/edgeseqobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/edgeseqobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/edgeseqobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_EDGESEQOBJECT_H
-#define PYTHON_EDGESEQOBJECT_H
-
-#include <Python.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface_edgeseq
- * \brief A structure representing the edge sequence of a graph
- */
-typedef struct
-{
-  PyObject_HEAD
-  igraphmodule_GraphObject* gref;
-  igraph_es_t es;
-  PyObject* weakreflist;
-} igraphmodule_EdgeSeqObject;
-
-PyObject* igraphmodule_EdgeSeq_new(PyTypeObject *subtype,
-  PyObject *args, PyObject *kwds);
-igraphmodule_EdgeSeqObject* igraphmodule_EdgeSeq_copy(
-  igraphmodule_EdgeSeqObject *o);
-int igraphmodule_EdgeSeq_init(igraphmodule_EdgeSeqObject *self,
-  PyObject *args, PyObject *kwds);
-void igraphmodule_EdgeSeq_dealloc(igraphmodule_EdgeSeqObject* self);
-
-int igraphmodule_EdgeSeq_sq_length(igraphmodule_EdgeSeqObject *self);
-
-PyObject* igraphmodule_EdgeSeq_find(igraphmodule_EdgeSeqObject *self,
-  PyObject *args);
-PyObject* igraphmodule_EdgeSeq_select(igraphmodule_EdgeSeqObject *self,
-  PyObject *args);
-
-PyObject* igraphmodule_EdgeSeq_get_graph(igraphmodule_EdgeSeqObject *self,
-  void* closure);
-
-extern PyTypeObject igraphmodule_EdgeSeqType;
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/error.c igraph-0.6.5/interfaces/python/src/error.c
--- igraph-0.6.5~quantal1/interfaces/python/src/error.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/error.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,87 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "error.h"
-#include <igraph.h>
-
-/** \ingroup python_interface_errors
- * \brief Exception type to be returned when an internal \c igraph error occurs.
- */
-PyObject* igraphmodule_InternalError;
-
-/**
- * \ingroup python_interface_errors
- * \brief Generic error handler for internal \c igraph errors.
- * 
- * Since now \c igraph supports error handler functions, a special
- * function called \c igraphmodule_igraph_error_hook is responsible
- * for providing a meaningful error message. If it fails (or it isn't
- * even called), this function will provide a default error message.
- * 
- * \return Always returns \c NULL, and all callers are advised to pass this
- * \c NULL value to their callers until it is propagated to the Python
- * interpreter.
- */
-PyObject* igraphmodule_handle_igraph_error() 
-{
-  if (!PyErr_Occurred()) {
-    PyErr_SetString(igraphmodule_InternalError,
-		    "Internal igraph error. Please contact the author!");
-  }
-
-  return NULL;
-}
-
-/**
- * \ingroup python_interface_errors
- * \brief Warning hook for \c igraph
- */
-void igraphmodule_igraph_warning_hook(const char *reason, const char *file,
-				    int line, int igraph_errno) {
-  char buf[4096];
-  sprintf(buf, "%s at %s:%i", reason, file, line);
-  PyErr_Warn(PyExc_RuntimeWarning, buf);
-}
-
-/**
- * \ingroup python_interface_errors
- * \brief Error hook for \c igraph
- */
-void igraphmodule_igraph_error_hook(const char *reason, const char *file,
-				    int line, int igraph_errno) {
-  char buf[4096];
-  PyObject *exc = igraphmodule_InternalError;
-
-  if (igraph_errno == IGRAPH_UNIMPLEMENTED)
-      exc = PyExc_NotImplementedError;
-
-  if (igraph_errno == IGRAPH_ENOMEM)
-      exc = PyExc_MemoryError;
-
-  sprintf(buf, "Error at %s:%i: %s, %s", file, line, reason,
-	  igraph_strerror(igraph_errno));
-  IGRAPH_FINALLY_FREE();
-
-  /* make sure we are not masking already thrown exceptions */
-  if (!PyErr_Occurred())
-    PyErr_SetString(exc, buf);
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/error.h igraph-0.6.5/interfaces/python/src/error.h
--- igraph-0.6.5~quantal1/interfaces/python/src/error.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/error.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,48 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_ERROR_H
-#define PYTHON_ERROR_H
-
-#include <Python.h>
-#include <igraph_error.h>
-
-/** \defgroup python_interface_errors Error handling
- * \ingroup python_interface */
-
-PyObject* igraphmodule_handle_igraph_error(void);
-void igraphmodule_igraph_warning_hook(const char *reason, const char *file,
-				    int line, int igraph_errno);
-void igraphmodule_igraph_error_hook(const char *reason, const char *file,
-				    int line, int igraph_errno);
-
-extern PyObject* igraphmodule_InternalError;
-
-#define IGRAPH_PYCHECK(a) do { \
-	int igraph_i_pyret=(a); \
-	if (IGRAPH_UNLIKELY(igraph_i_pyret != 0)) {\
-		igraphmodule_handle_igraph_error();  \
-		IGRAPH_FINALLY_FREE();               \
-		return 0;                            \
-	} } while (0)
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/filehandle.c igraph-0.6.5/interfaces/python/src/filehandle.c
--- igraph-0.6.5~quantal1/interfaces/python/src/filehandle.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/filehandle.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,112 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2010-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "filehandle.h"
-#include "py2compat.h"
-
-/**
- * \ingroup python_interface_filehandle
- * \brief Constructs a new file handle object from a Python object.
- *
- * \return 0 if everything was OK, 1 otherwise. An appropriate Python
- *   exception is raised in this case.
- */
-int igraphmodule_filehandle_init(igraphmodule_filehandle_t* handle,
-        PyObject* object, char* mode) {
-#ifdef IGRAPH_PYTHON3
-    int fp;
-    if (object == 0 || PyLong_Check(object)) {
-        PyErr_SetString(PyExc_TypeError, "string or file-like object expected");
-        return 1;
-    }
-#else
-    if (object == 0 ||
-        (!PyBaseString_Check(object) && !PyFile_Check(object))) {
-        PyErr_SetString(PyExc_TypeError, "string or file handle expected");
-        return 1;
-    }
-#endif
-
-    if (PyBaseString_Check(object)) {
-#ifdef IGRAPH_PYTHON3
-        handle->object = PyFile_FromObject(object, mode);
-#else
-        handle->object = PyFile_FromString(PyString_AsString(object), mode);
-#endif
-        if (handle->object == 0)
-            return 1;
-    } else {
-        handle->object = object;
-        Py_INCREF(handle->object);
-    }
-
-    /* At this stage, handle->object is something we can handle.
-     * In Python 2, we get here only if object is a file object. In
-     * Python 3, object can be anything, and PyFile_FromObject will
-     * complain if the object cannot be converted to a file handle.
-     */
-#ifdef IGRAPH_PYTHON3
-    fp = PyObject_AsFileDescriptor(handle->object);
-    if (fp == -1) {
-        Py_DECREF(handle->object);
-        return 1;
-    }
-    handle->fp = fdopen(fp, mode);
-    if (handle->fp == 0) {
-        Py_DECREF(handle->object);
-        PyErr_SetString(PyExc_RuntimeError, "fdopen() failed unexpectedly");
-        return 1;
-    }
-#else
-    handle->fp = PyFile_AsFile(handle->object);
-    if (handle->fp == 0) {
-        Py_DECREF(handle->object);
-        PyErr_SetString(PyExc_RuntimeError, "PyFile_AsFile() failed unexpectedly");
-        return 1;
-    }
-#endif
-
-    return 0;
-}
-
-/**
- * \ingroup python_interface_filehandle
- * \brief Destroys the file handle object.
- */
-void igraphmodule_filehandle_destroy(igraphmodule_filehandle_t* handle) {
-	if (handle->fp != 0) {
-		fflush(handle->fp);
-	}
-    handle->fp = 0;
-
-    Py_XDECREF(handle->object);
-    handle->object = 0;
-}
-
-/**
- * \ingroup python_interface_filehandle
- * \brief Returns the file encapsulated by the given \c igraphmodule_filehandle_t.
- */
-FILE* igraphmodule_filehandle_get(const igraphmodule_filehandle_t* handle) {
-    return handle->fp;
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/filehandle.h igraph-0.6.5/interfaces/python/src/filehandle.h
--- igraph-0.6.5~quantal1/interfaces/python/src/filehandle.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/filehandle.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2010-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_FILEHANDLE_H
-#define PYTHON_FILEHANDLE_H
-
-#include <Python.h>
-#include <stdio.h>
-
-/**
- * \defgroup python_interface_filehandle File handle object
- */
-
-/**
- * \ingroup python_interface_filehandle
- * \brief A structure encapsulating a Python object and a \c FILE* pointer
- * created out of it.
- */
-typedef struct {
-    PyObject* object;
-    FILE* fp;
-} igraphmodule_filehandle_t;
-
-
-int igraphmodule_filehandle_init(igraphmodule_filehandle_t* handle,
-        PyObject* object, char* mode);
-FILE* igraphmodule_filehandle_get(const igraphmodule_filehandle_t* handle);
-void igraphmodule_filehandle_destroy(igraphmodule_filehandle_t* handle);
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/graphobject.c igraph-0.6.5/interfaces/python/src/graphobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/graphobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/graphobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,14627 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "attributes.h"
-#include "arpackobject.h"
-#include "bfsiter.h"
-#include "common.h"
-#include "convert.h"
-#include "edgeseqobject.h"
-#include "error.h"
-#include "filehandle.h"
-#include "graphobject.h"
-#include "indexing.h"
-#include "memory.h"
-#include "py2compat.h"
-#include "pyhelpers.h"
-#include "vertexseqobject.h"
-#include <float.h>
-
-PyTypeObject igraphmodule_GraphType;
-
-#define CREATE_GRAPH(py_graph, c_graph) { \
-  py_graph = (igraphmodule_GraphObject *) Py_TYPE(self)->tp_alloc(Py_TYPE(self), 0); \
-  if (py_graph != NULL) { \
-    igraphmodule_Graph_init_internal(py_graph); \
-    py_graph->g = (c_graph); \
-  } \
-  RC_ALLOC("Graph", py_graph); \
-}
-#define CREATE_GRAPH_FROM_TYPE(py_graph, c_graph, py_type) { \
-  py_graph = (igraphmodule_GraphObject *) py_type->tp_alloc(py_type, 0); \
-  if (py_graph != NULL) { \
-    igraphmodule_Graph_init_internal(py_graph); \
-    py_graph->g = (c_graph); \
-  } \
-  RC_ALLOC("Graph", py_graph); \
-}
-
-/**********************************************************************
- * Basic implementation of igraph.Graph                               *
- **********************************************************************/
-
-/** \defgroup python_interface_graph Graph object
- * \ingroup python_interface */
-
-/**
- * \ingroup python_interface_internal
- * \brief Initializes the internal structures in an \c igraph.Graph object's
- * C representation.
- * 
- * This function must be called whenever we create a new Graph object with
- * \c tp_alloc
- */
-void igraphmodule_Graph_init_internal(igraphmodule_GraphObject * self)
-{
-  if (!self) return;
-  self->destructor = NULL;
-  self->weakreflist = NULL;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Creates a new igraph object in Python
- * 
- * This function is called whenever a new \c igraph.Graph object is created in
- * Python. An optional \c n parameter can be passed from Python,
- * representing the number of vertices in the graph. If it is omitted,
- * the default value is 0.
- * 
- * <b>Example call from Python:</b>
-\verbatim
-g = igraph.Graph(5);
-\endverbatim
- *
- * In fact, the parameters are processed by \c igraphmodule_Graph_init
- * 
- * \return the new \c igraph.Graph object or NULL if an error occurred.
- * 
- * \sa igraphmodule_Graph_init
- * \sa igraph_empty
- */
-PyObject *igraphmodule_Graph_new(PyTypeObject * type, PyObject * args,
-                                 PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-
-  self = (igraphmodule_GraphObject *) type->tp_alloc(type, 0);
-  RC_ALLOC("Graph", self);
-
-  /* don't need it, the constructor will do it */
-  /*if (self != NULL) {
-     igraph_empty(&self->g, 1, 0);
-     } */
-  igraphmodule_Graph_init_internal(self);
-
-  return (PyObject *) self;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Clears the graph object's subobject (before deallocation)
- */
-int igraphmodule_Graph_clear(igraphmodule_GraphObject * self)
-{
-  PyObject *tmp;
-  PyObject_GC_UnTrack(self);
-
-  tmp = self->destructor;
-  self->destructor = NULL;
-  Py_XDECREF(tmp);
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Support for cyclic garbage collection in Python
- * 
- * This is necessary because the \c igraph.Graph object contains several
- * other \c PyObject pointers and they might point back to itself.
- */
-int igraphmodule_Graph_traverse(igraphmodule_GraphObject * self,
-                                visitproc visit, void *arg)
-{
-  int vret, i;
-
-  RC_TRAVERSE("Graph", self);
-
-  if (self->destructor) {
-    vret = visit(self->destructor, arg);
-    if (vret != 0)
-      return vret;
-  }
-
-  if (self->g.attr) {
-    for (i = 0; i < 3; i++) {
-      vret = visit(((PyObject **) (self->g.attr))[i], arg);
-      if (vret != 0)
-        return vret;
-    }
-  }
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Deallocates a Python representation of a given igraph object
- */
-void igraphmodule_Graph_dealloc(igraphmodule_GraphObject * self)
-{
-  PyObject *r;
-
-  /* Clear weak references */
-  if (self->weakreflist != NULL)
-     PyObject_ClearWeakRefs((PyObject *) self);
-
-  igraph_destroy(&self->g);
-
-  if (PyCallable_Check(self->destructor)) {
-    r = PyObject_CallObject(self->destructor, NULL);
-    if (r) {
-      Py_DECREF(r);
-    }
-  }
-
-  igraphmodule_Graph_clear(self);
-
-  RC_DEALLOC("Graph", self);
-
-  Py_TYPE(self)->tp_free((PyObject*)self);
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Initializes a new \c igraph object in Python
- * 
- * This function is called whenever a new \c igraph.Graph object is initialized in
- * Python (note that initializing is not equal to creating: an object might
- * be created but not initialized when it is being recovered from a serialized
- * state).
- * 
- * Throws \c AssertionError in Python if \c vcount is less than or equal to zero.
- * \return the new \c igraph.Graph object or NULL if an error occurred.
- * 
- * \sa igraphmodule_Graph_new
- * \sa igraph_empty
- * \sa igraph_create
- */
-int igraphmodule_Graph_init(igraphmodule_GraphObject * self,
-                            PyObject * args, PyObject * kwds) {
-  static char *kwlist[] = { "n", "edges", "directed", NULL };
-  long int n = 0;
-  PyObject *edges = NULL, *dir = Py_False;
-  igraph_vector_t edges_vector;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lO!O", kwlist,
-                                   &n, &PyList_Type, &edges, &dir))
-    return -1;
-
-  if (edges && PyList_Check(edges)) {
-    /* Caller specified an edge list, so we use igraph_create */
-    /* We have to convert the Python list to a igraph_vector_t */
-    if (igraphmodule_PyObject_to_edgelist(edges, &edges_vector, 0)) {
-      igraphmodule_handle_igraph_error();
-      return -1;
-    }
-
-    if (igraph_create
-        (&self->g, &edges_vector, (igraph_integer_t) n, PyObject_IsTrue(dir))) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&edges_vector);
-      return -1;
-    }
-
-    igraph_vector_destroy(&edges_vector);
-  }
-  else {
-    /* No edge list was specified, let's use igraph_empty */
-    if (igraph_empty(&self->g, (igraph_integer_t) n, PyObject_IsTrue(dir))) {
-      igraphmodule_handle_igraph_error();
-      return -1;
-    }
-  }
-
-  return 0;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates an \c igraph.Graph object from an existing \c igraph_t
- *
- * The newly created \c igraph.Graph object will take ownership of the
- * given \c igraph_t. This function is not accessible from Python the
- * normal way, but it is exposed via the C API of the Python module.
- * See \c api.h for more details.
- */
-PyObject* igraphmodule_Graph_from_igraph_t(igraph_t *graph) {
-  igraphmodule_GraphObject* result;
-  PyTypeObject* type = &igraphmodule_GraphType;
-
-  CREATE_GRAPH_FROM_TYPE(result, *graph, type);
-
-  return (PyObject*)result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Formats an \c igraph.Graph object in a human-readable format.
- * 
- * This function is rather simple now, it returns the number of vertices
- * and edges in a string.
- * 
- * \return the formatted textual representation as a \c PyObject
- */
-PyObject *igraphmodule_Graph_str(igraphmodule_GraphObject * self)
-{
-  if (igraph_is_directed(&self->g))
-    return PyString_FromFormat("Directed graph (|V| = %ld, |E| = %ld)",
-                               (long)igraph_vcount(&self->g),
-                               (long)igraph_ecount(&self->g));
-  else
-    return PyString_FromFormat("Undirected graph (|V| = %ld, |E| = %ld)",
-                               (long)igraph_vcount(&self->g),
-                               (long)igraph_ecount(&self->g));
-}
-
-/** \ingroup python_interface_copy
- * \brief Creates an exact deep copy of the graph
- * \return the copy of the graph
- */
-PyObject *igraphmodule_Graph_copy(igraphmodule_GraphObject * self)
-{
-  igraphmodule_GraphObject *result;
-  igraph_t g;
-
-  if (igraph_copy(&g, &self->g)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/**********************************************************************
- * The most basic igraph interface                                    *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Returns the number of vertices in an \c igraph.Graph object.
- * \return the number of vertices as a \c PyObject
- * \sa igraph_vcount
- */
-PyObject *igraphmodule_Graph_vcount(igraphmodule_GraphObject * self)
-{
-  PyObject *result;
-  result = Py_BuildValue("l", (long)igraph_vcount(&self->g));
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the number of edges in an \c igraph.Graph object.
- * \return the number of edges as a \c PyObject
- * \sa igraph_ecount
- */
-PyObject *igraphmodule_Graph_ecount(igraphmodule_GraphObject * self)
-{
-  PyObject *result;
-  result = Py_BuildValue("l", (long)igraph_ecount(&self->g));
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an \c igraph.Graph object is a DAG.
- * \return \c True if the graph is directed, \c False otherwise.
- * \sa igraph_is_dag
- */
-PyObject *igraphmodule_Graph_is_dag(igraphmodule_GraphObject * self)
-{
-  igraph_bool_t res;
-
-  if (igraph_is_dag(&self->g, &res)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (res)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an \c igraph.Graph object is directed.
- * \return \c True if the graph is directed, \c False otherwise.
- * \sa igraph_is_directed
- */
-PyObject *igraphmodule_Graph_is_directed(igraphmodule_GraphObject * self)
-{
-  if (igraph_is_directed(&self->g))
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Checks whether a matching is valid in the context of an \c igraph.Graph
- * object.
- * \sa igraph_is_matching
- */
-PyObject *igraphmodule_Graph_is_matching(igraphmodule_GraphObject* self,
-    PyObject* args, PyObject* kwds) {
-  static char* kwlist[] = { "matching", "types", NULL };
-  PyObject *matching_o, *types_o = Py_None;
-  igraph_vector_long_t* matching = 0;
-  igraph_vector_bool_t* types = 0;
-  igraph_bool_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &matching_o,
-        &types_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_long_t(matching_o, self, &matching,
-        ATTRIBUTE_TYPE_VERTEX))
-	return NULL;
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX)) {
-    if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-	return NULL;
-  }
-
-  if (igraph_is_matching(&self->g, types, matching, &result)) {
-    if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-    if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-  if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-
-  if (result)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Checks whether a matching is valid and maximal in the context of an
- *        \c igraph.Graph object.
- * \sa igraph_is_maximal_matching
- */
-PyObject *igraphmodule_Graph_is_maximal_matching(igraphmodule_GraphObject* self,
-    PyObject* args, PyObject* kwds) {
-  static char* kwlist[] = { "matching", "types", NULL };
-  PyObject *matching_o, *types_o = Py_None;
-  igraph_vector_long_t* matching = 0;
-  igraph_vector_bool_t* types = 0;
-  igraph_bool_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &matching_o,
-        &types_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_long_t(matching_o, self, &matching,
-        ATTRIBUTE_TYPE_VERTEX))
-	return NULL;
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX)) {
-    if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-	return NULL;
-  }
-
-  if (igraph_is_maximal_matching(&self->g, types, matching, &result)) {
-    if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-    if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (matching != 0) { igraph_vector_long_destroy(matching); free(matching); }
-  if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-
-  if (result)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an \c igraph.Graph object is simple.
- * \return \c True if the graph is simple, \c False otherwise.
- * \sa igraph_is_simple
- */
-PyObject *igraphmodule_Graph_is_simple(igraphmodule_GraphObject *self) {
-  igraph_bool_t res;
-
-  if (igraph_is_simple(&self->g, &res)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (res)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Adds vertices to an \c igraph.Graph
- * \return the extended \c igraph.Graph object
- * \sa igraph_add_vertices
- */
-PyObject *igraphmodule_Graph_add_vertices(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds) {
-  long n;
-
-  if (!PyArg_ParseTuple(args, "l", &n))
-    return NULL;
-
-  if (igraph_add_vertices(&self->g, (igraph_integer_t) n, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Removes vertices from an \c igraph.Graph
- * \return the modified \c igraph.Graph object
- * 
- * \todo Need more error checking on vertex IDs. (igraph fails when an
- * invalid vertex ID is given)
- * \sa igraph_delete_vertices
- */
-PyObject *igraphmodule_Graph_delete_vertices(igraphmodule_GraphObject * self,
-                                             PyObject * args, PyObject * kwds) {
-  PyObject *list;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTuple(args, "O", &list)) return NULL;
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, 0, 0)) return NULL;
-
-  if (igraph_delete_vertices(&self->g, vs)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vs);
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Adds edges to an \c igraph.Graph
- * \return the extended \c igraph.Graph object
- * 
- * \todo Need more error checking on vertex IDs. (igraph fails when an
- * invalid vertex ID is given)
- * \sa igraph_add_edges
- */
-PyObject *igraphmodule_Graph_add_edges(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *list;
-  igraph_vector_t v;
-
-  if (!PyArg_ParseTuple(args, "O", &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_edgelist(list, &v, &self->g))
-    return NULL;
-
-  /* do the hard work :) */
-  if (igraph_add_edges(&self->g, &v, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&v);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&v);
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Deletes edges from an \c igraph.Graph
- * \return the extended \c igraph.Graph object
- * 
- * \todo Need more error checking on vertex IDs. (igraph fails when an
- * invalid vertex ID is given)
- * \sa igraph_delete_edges
- */
-PyObject *igraphmodule_Graph_delete_edges(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  PyObject *list;
-  igraph_es_t es;
-  static char *kwlist[] = { "edges", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &list))
-    return NULL;
-	
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, 0)) {
-    /* something bad happened during conversion, return immediately */
-    return NULL;
-  }
-
-  if (igraph_delete_edges(&self->g, es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  igraph_es_destroy(&es);
-  Py_RETURN_NONE;
-}
-
-/**********************************************************************
- * tructural properties                                              *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief The degree of some vertices in an \c igraph.Graph
- * \return the degree list as a Python object
- * \sa igraph_degree
- */
-PyObject *igraphmodule_Graph_degree(igraphmodule_GraphObject * self,
-                                    PyObject * args, PyObject * kwds)
-{
-  PyObject *list = Py_None;
-  PyObject *loops = Py_True;
-  PyObject *dtype_o = Py_None;
-  PyObject *dmode_o = Py_None;
-  igraph_neimode_t dmode = IGRAPH_ALL;
-  igraph_vector_t result;
-  igraph_vs_t vs;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "vertices", "mode", "loops", "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist,
-                                   &list, &dmode_o, &loops, &dtype_o))
-    return NULL;
-
-  if (dmode_o == Py_None && dtype_o != Py_None) {
-    dmode_o = dtype_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(dmode_o, &dmode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, &return_single, 0)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&result, 0)) {
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  if (igraph_degree(&self->g, &result, vs,
-                    dmode, PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  else
-    list = PyInt_FromLong((long int)VECTOR(result)[0]);
-
-  igraph_vector_destroy(&result);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Structural diversity index of some vertices in an \c igraph.Graph
- * \sa igraph_diversity
- */
-PyObject *igraphmodule_Graph_diversity(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds) {
-  PyObject *list = Py_None;
-  PyObject *weights_o = Py_None;
-  igraph_vector_t result, *weights = 0;
-  igraph_vs_t vs;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "vertices", "weights", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist,
-                                   &list, &weights_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&result, 0)) {
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (igraph_diversity(&self->g, weights, &result, vs)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(result)[0]);
-
-  igraph_vector_destroy(&result);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief The strength (weighted degree) of some vertices in an \c igraph.Graph
- * \return the strength list as a Python object
- * \sa igraph_strength
- */
-PyObject *igraphmodule_Graph_strength(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  PyObject *list = Py_None;
-  PyObject *loops = Py_True;
-  PyObject *dtype_o = Py_None;
-  PyObject *dmode_o = Py_None;
-  PyObject *weights_o = Py_None;
-  igraph_neimode_t dmode = IGRAPH_ALL;
-  igraph_vector_t result, *weights = 0;
-  igraph_vs_t vs;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "vertices", "mode", "loops", "weights",
-    "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOOO", kwlist,
-                                   &list, &dmode_o, &loops, &weights_o,
-                                   &dtype_o))
-    return NULL;
-
-  if (dmode_o == Py_None && dtype_o != Py_None) {
-    dmode_o = dtype_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(dmode_o, &dmode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&result, 0)) {
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (igraph_strength(&self->g, &result, vs, dmode,
-        PyObject_IsTrue(loops), weights)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(result)[0]);
-
-  igraph_vector_destroy(&result);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the graph density
- * \return the density
- * \sa igraph_density
- */
-PyObject *igraphmodule_Graph_density(igraphmodule_GraphObject * self,
-                                     PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "loops", NULL };
-  igraph_real_t result;
-  PyObject *loops = Py_False;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &loops))
-    return NULL;
-
-  if (igraph_density(&self->g, &result, PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return Py_BuildValue("d", (double)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief The maximum degree of some vertices in an \c igraph.Graph
- * \return the maxium degree as a Python object
- * \sa igraph_maxdegree
- */
-PyObject *igraphmodule_Graph_maxdegree(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *list = Py_None;
-  igraph_neimode_t dmode = IGRAPH_ALL;
-  PyObject *dtype_o = Py_None;
-  PyObject *dmode_o = Py_None;
-  PyObject *loops = Py_False;
-  igraph_integer_t result;
-  igraph_vs_t vs;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "vertices", "mode", "loops", "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist,
-                                   &list, &dmode_o, &loops, &dtype_o))
-    return NULL;
-
-  if (dmode_o == Py_None && dtype_o != Py_None) {
-    dmode_o = dtype_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(dmode_o, &dmode)) return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_maxdegree(&self->g, &result, vs,
-                       dmode, PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vs);
-
-  return PyInt_FromLong((long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an edge is a loop edge 
- * \return a boolean or a list of booleans
- * \sa igraph_is_loop
- */
-PyObject *igraphmodule_Graph_is_loop(igraphmodule_GraphObject *self,
-                                     PyObject *args, PyObject *kwds) {
-  PyObject *list = Py_None;
-  igraph_vector_bool_t result;
-  igraph_es_t es;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "edges", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, &return_single)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_bool_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  if (igraph_is_loop(&self->g, &result, es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    igraph_vector_bool_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_bool_t_to_PyList(&result);
-  else {
-    list = (VECTOR(result)[0]) ? Py_True : Py_False;
-    Py_INCREF(list);
-  }
-
-  igraph_vector_bool_destroy(&result);
-  igraph_es_destroy(&es);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an edge is a multiple edge 
- * \return a boolean or a list of booleans
- * \sa igraph_is_multiple
- */
-PyObject *igraphmodule_Graph_is_multiple(igraphmodule_GraphObject *self,
-                                         PyObject *args, PyObject *kwds) {
-  PyObject *list = Py_None;
-  igraph_vector_bool_t result;
-  igraph_es_t es;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "edges", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, &return_single)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_bool_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  if (igraph_is_multiple(&self->g, &result, es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    igraph_vector_bool_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_bool_t_to_PyList(&result);
-  else {
-    list = (VECTOR(result)[0]) ? Py_True : Py_False;
-    Py_INCREF(list);
-  }
-
-  igraph_vector_bool_destroy(&result);
-  igraph_es_destroy(&es);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an edge is mutual 
- * \return a boolean or a list of booleans
- * \sa igraph_is_mutual
- */
-PyObject *igraphmodule_Graph_is_mutual(igraphmodule_GraphObject *self,
-                                       PyObject *args, PyObject *kwds) {
-  PyObject *list = Py_None;
-  igraph_vector_bool_t result;
-  igraph_es_t es;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "edges", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, &return_single)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_bool_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  if (igraph_is_mutual(&self->g, &result, es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    igraph_vector_bool_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_bool_t_to_PyList(&result);
-  else {
-    list = (VECTOR(result)[0]) ? Py_True : Py_False;
-    Py_INCREF(list);
-  }
-
-  igraph_vector_bool_destroy(&result);
-  igraph_es_destroy(&es);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether an \c igraph.Graph object has multiple edges.
- * \return \c True if the graph has multiple edges, \c False otherwise.
- * \sa igraph_has_multiple
- */
-PyObject *igraphmodule_Graph_has_multiple(igraphmodule_GraphObject *self) {
-  igraph_bool_t res;
-
-  if (igraph_has_multiple(&self->g, &res)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (res)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks the multiplicity of the edges 
- * \return the edge multiplicities as a Python list
- * \sa igraph_count_multiple
- */
-PyObject *igraphmodule_Graph_count_multiple(igraphmodule_GraphObject *self,
-                                            PyObject *args, PyObject *kwds) {
-  PyObject *list = Py_None;
-  igraph_vector_t result;
-  igraph_es_t es;
-  igraph_bool_t return_single = 0;
-
-  static char *kwlist[] = { "edges", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, &return_single)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&result, 0)) {
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  if (igraph_count_multiple(&self->g, &result, es)) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  else
-    list = PyInt_FromLong((long int)VECTOR(result)[0]);
-
-  igraph_vector_destroy(&result);
-  igraph_es_destroy(&es);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief The neighbors of a given vertex in an \c igraph.Graph
- * This method accepts a single vertex ID as a parameter, and returns the
- * neighbors of the given vertex in the form of an integer list. A
- * second argument may be passed as well, meaning the type of neighbors to
- * be returned (\c OUT for successors, \c IN for predecessors or \c ALL
- * for both of them). This argument is ignored for undirected graphs.
- * 
- * \return the neighbor list as a Python list object
- * \sa igraph_neighbors
- */
-PyObject *igraphmodule_Graph_neighbors(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *list, *dtype_o=Py_None, *dmode_o=Py_None, *index_o;
-  igraph_neimode_t dmode = IGRAPH_ALL;
-  igraph_integer_t idx;
-  igraph_vector_t result;
-
-  static char *kwlist[] = { "vertex", "mode", "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OO", kwlist,
-        &index_o, &dmode_o, &dtype_o))
-    return NULL;
-
-  if (dmode_o == Py_None && dtype_o != Py_None) {
-    dmode_o = dtype_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(dmode_o, &dmode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(index_o, &idx, &self->g))
-    return NULL;
-
-  if (igraph_vector_init(&result, 1))
-    return igraphmodule_handle_igraph_error();
-
-  if (igraph_neighbors(&self->g, &result, idx, dmode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief The incident edges of a given vertex in an \c igraph.Graph
- * This method accepts a single vertex ID as a parameter, and returns the
- * IDs of the incident edges of the given vertex in the form of an integer list.
- * A second argument may be passed as well, meaning the type of neighbors to
- * be returned (\c OUT for successors, \c IN for predecessors or \c ALL
- * for both of them). This argument is ignored for undirected graphs.
- * 
- * \return the adjacency list as a Python list object
- * \sa igraph_incident
- */
-PyObject *igraphmodule_Graph_incident(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *list, *dmode_o = Py_None, *dtype_o = Py_None, *index_o;
-  igraph_neimode_t dmode = IGRAPH_OUT;
-  igraph_integer_t idx;
-  igraph_vector_t result;
-
-  static char *kwlist[] = { "vertex", "mode", "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OO", kwlist,
-        &index_o, &dmode_o, &dtype_o))
-    return NULL;
-
-  if (dmode_o == Py_None && dtype_o != Py_None) {
-    dmode_o = dtype_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(dmode_o, &dmode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(index_o, &idx, &self->g))
-    return NULL;
-
-  igraph_vector_init(&result, 1);
-  if (igraph_incident(&self->g, &result, idx, dmode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the graph reciprocity
- * \return the reciprocity
- * \sa igraph_reciprocity
- */
-PyObject *igraphmodule_Graph_reciprocity(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "ignore_loops", "mode", NULL };
-  igraph_real_t result;
-  igraph_reciprocity_t mode = IGRAPH_RECIPROCITY_DEFAULT;
-  PyObject *ignore_loops = Py_True, *mode_o = Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &ignore_loops, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_reciprocity_t(mode_o, &mode))
-    return NULL;
-
-  if (igraph_reciprocity(&self->g, &result, PyObject_IsTrue(ignore_loops), mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return Py_BuildValue("d", (double)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief The successors of a given vertex in an \c igraph.Graph
- * This method accepts a single vertex ID as a parameter, and returns the
- * successors of the given vertex in the form of an integer list. It
- * is equivalent to calling \c igraph.Graph.neighbors with \c type=OUT
- * 
- * \return the successor list as a Python list object
- * \sa igraph_neighbors
- */
-PyObject *igraphmodule_Graph_successors(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  PyObject *list, *index_o;
-  igraph_integer_t idx;
-  igraph_vector_t result;
-
-  static char *kwlist[] = { "vertex", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &index_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(index_o, &idx, &self->g))
-    return NULL;
-
-  igraph_vector_init(&result, 1);
-  if (igraph_neighbors(&self->g, &result, idx, IGRAPH_OUT)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief The predecessors of a given vertex in an \c igraph.Graph
- * This method accepts a single vertex ID as a parameter, and returns the
- * predecessors of the given vertex in the form of an integer list. It
- * is equivalent to calling \c igraph.Graph.neighbors with \c type=IN
- * 
- * \return the predecessor list as a Python list object
- * \sa igraph_neighbors
- */
-PyObject *igraphmodule_Graph_predecessors(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  PyObject *list, *index_o;
-  igraph_integer_t idx;
-  igraph_vector_t result;
-
-  static char *kwlist[] = { "vertex", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &index_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(index_o, &idx, &self->g))
-    return NULL;
-
-  igraph_vector_init(&result, 1);
-  if (igraph_neighbors(&self->g, &result, idx, IGRAPH_IN)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Decides whether a graph is connected.
- * \return Py_True if the graph is connected, Py_False otherwise
- * \sa igraph_is_connected
- */
-PyObject *igraphmodule_Graph_is_connected(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "mode", NULL };
-  igraph_connectedness_t mode = IGRAPH_STRONG;
-  igraph_bool_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|l", kwlist, &mode))
-    return NULL;
-
-  if (mode != IGRAPH_STRONG && mode != IGRAPH_WEAK) {
-    PyErr_SetString(PyExc_ValueError, "mode must be either STRONG or WEAK");
-    return NULL;
-  }
-
-  if (igraph_is_connected(&self->g, &res, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (res)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Decides whether there is an edge from a given vertex to an other one.
- * \return Py_True if the vertices are directly connected, Py_False otherwise
- * \sa igraph_are_connected
- */
-PyObject *igraphmodule_Graph_are_connected(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "v1", "v2", NULL };
-  PyObject *v1, *v2;
-  igraph_integer_t idx1, idx2;
-  igraph_bool_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO", kwlist, &v1, &v2))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(v1, &idx1, &self->g))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(v2, &idx2, &self->g))
-    return NULL;
-
-  if (igraph_are_connected(&self->g, idx1, idx2, &res))
-    return NULL;
-
-  if (res)
-    Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the ID of an arbitrary edge between the given two vertices
- * \sa igraph_get_eid
- */
-PyObject *igraphmodule_Graph_get_eid(igraphmodule_GraphObject * self,
-                                     PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "v1", "v2", "directed", "error", NULL };
-  long int v1, v2;
-  igraph_integer_t result;
-  PyObject *directed = Py_True;
-  PyObject *error = Py_True;
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|OO", kwlist, &v1, &v2,
-                                   &directed, &error))
-    return NULL;
-  if (igraph_get_eid(&self->g, &result, (igraph_integer_t) v1, (igraph_integer_t) v2,
-        PyObject_IsTrue(directed), PyObject_IsTrue(error)))
-    return igraphmodule_handle_igraph_error();
-
-  return Py_BuildValue("l", (long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the IDs of some edges between some vertices
- * \sa igraph_get_eids
- */
-PyObject *igraphmodule_Graph_get_eids(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "pairs", "path", "directed", "error", NULL };
-  PyObject *pairs_o = Py_None, *path_o = Py_None;
-  PyObject *directed = Py_True;
-  PyObject *error = Py_True;
-  PyObject *result = NULL;
-  igraph_vector_t pairs, path, res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist,
-                                   &pairs_o, &path_o, &directed,
-                                   &error))
-    return NULL;
-
-  if (igraph_vector_init(&res, 0))
-    return igraphmodule_handle_igraph_error();
-
-  if (pairs_o != Py_None) {
-    if (igraphmodule_PyObject_to_edgelist(pairs_o, &pairs, &self->g)) {
-      igraph_vector_destroy(&res);
-      return NULL;
-    }
-  }
-
-  if (path_o != Py_None) {
-    if (igraphmodule_PyObject_to_vector_t(path_o, &path, 1, 0)) {
-      igraph_vector_destroy(&res);
-      if (pairs_o != Py_None) igraph_vector_destroy(&pairs);
-      return NULL;
-    }
-  }
-
-  if (igraph_get_eids(&self->g, &res,
-        pairs_o == Py_None ? 0 : &pairs,
-        path_o  == Py_None ? 0 : &path,
-        PyObject_IsTrue(directed),
-        PyObject_IsTrue(error))) {
-    if (pairs_o != Py_None) igraph_vector_destroy(&pairs);
-    if (path_o != Py_None)  igraph_vector_destroy(&path);
-    igraph_vector_destroy(&res);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (pairs_o != Py_None) igraph_vector_destroy(&pairs);
-  if (path_o != Py_None)  igraph_vector_destroy(&path);
-
-  result = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the diameter of an \c igraph.Graph
- * This method accepts two optional parameters: the first one is
- * a boolean meaning whether to consider directed paths (and is
- * ignored for undirected graphs). The second one is only meaningful
- * in unconnected graphs: it is \c True if the longest geodesic
- * within a component should be returned and \c False if the number of
- * vertices should be returned. They both have a default value of \c False.
- * 
- * \return the diameter as a Python integer
- * \sa igraph_diameter
- */
-PyObject *igraphmodule_Graph_diameter(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  PyObject *dir = Py_True, *vcount_if_unconnected = Py_True;
-  PyObject *weights_o = Py_None;
-  igraph_vector_t *weights = 0;
-
-  static char *kwlist[] = {
-    "directed", "unconn", "weights", NULL
-  };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-                                   &dir, &vcount_if_unconnected,
-                                   &weights_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (weights) {
-    igraph_real_t i;
-    if (igraph_diameter_dijkstra(&self->g, weights, &i, 0, 0, 0,
-          PyObject_IsTrue(dir), PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(weights); free(weights);
-      return NULL;
-    }
-    igraph_vector_destroy(weights); free(weights);
-    return PyFloat_FromDouble((double)i);
-  } else {
-    igraph_integer_t i;
-    if (igraph_diameter(&self->g, &i, 0, 0, 0, PyObject_IsTrue(dir),
-                        PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-    return PyInt_FromLong((long)i);
-  }
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns a path of the actual diameter of the graph
- * \sa igraph_diameter
- */
-PyObject *igraphmodule_Graph_get_diameter(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  PyObject *dir = Py_True, *vcount_if_unconnected = Py_True, *result;
-  PyObject *weights_o = Py_None;
-  igraph_vector_t *weights = 0;
-  igraph_vector_t res;
-
-  static char *kwlist[] = { "directed", "unconn", "weights", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-                                   &dir, &vcount_if_unconnected,
-                                   &weights_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  igraph_vector_init(&res, 0);
-  if (weights) {
-    if (igraph_diameter_dijkstra(&self->g, weights, 0, 0, 0, &res,
-          PyObject_IsTrue(dir), PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(weights); free(weights);
-      igraph_vector_destroy(&res);
-      return NULL;
-    }
-    igraph_vector_destroy(weights); free(weights);
-  } else {
-    if (igraph_diameter(&self->g, 0, 0, 0, &res, PyObject_IsTrue(dir),
-                        PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  result = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the farthest points and their distances in the graph
- * \sa igraph_distance
- */
-PyObject *igraphmodule_Graph_farthest_points(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  PyObject *dir = Py_True, *vcount_if_unconnected = Py_True;
-  PyObject *weights_o = Py_None;
-  igraph_vector_t *weights = 0;
-  igraph_integer_t from, to, len;
-  igraph_real_t len_real;
-
-  static char *kwlist[] = { "directed", "unconn", "weights", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-                                   &dir, &vcount_if_unconnected,
-                                   &weights_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (weights) {
-    if (igraph_diameter_dijkstra(&self->g, weights, &len_real, &from, &to, 0,
-          PyObject_IsTrue(dir), PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(weights); free(weights);
-      return NULL;
-    }
-    igraph_vector_destroy(weights); free(weights);
-    if (from >= 0)
-      return Py_BuildValue("lld", (long)from, (long)to, (double)len_real);
-    return Py_BuildValue("OOd", Py_None, Py_None, (double)len_real);
-  } else {
-    if (igraph_diameter(&self->g, &len, &from, &to, 0, PyObject_IsTrue(dir),
-                        PyObject_IsTrue(vcount_if_unconnected))) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (from >= 0)
-      return Py_BuildValue("lll", (long)from, (long)to, (long)len);
-    return Py_BuildValue("OOl", Py_None, Py_None, (long)len);
-  }
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Calculates the girth of an \c igraph.Graph
- */
-PyObject *igraphmodule_Graph_girth(igraphmodule_GraphObject *self,
-                                   PyObject *args, PyObject *kwds)
-{
-  PyObject *sc = Py_False;
-  static char *kwlist[] = { "return_shortest_circle", NULL };
-  igraph_integer_t girth;
-  igraph_vector_t vids;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &sc))
-  return NULL;
-
-  igraph_vector_init(&vids, 0);
-  if (igraph_girth(&self->g, &girth, &vids)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&vids);
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(sc)) {
-    PyObject* o;
-    o=igraphmodule_vector_t_to_PyList(&vids, IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&vids);
-    return o;
-  }
-  return PyInt_FromLong((long)girth);
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Calculates the convergence degree of the edges in a graph 
- */
-PyObject *igraphmodule_Graph_convergence_degree(igraphmodule_GraphObject *self) {
-  igraph_vector_t result;
-	PyObject *o;
-
-  igraph_vector_init(&result, 0);
-  if (igraph_convergence_degree(&self->g, &result, 0, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  o=igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&result);
-  return o;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Calculates the sizes of the convergence fields in a graph 
- */
-PyObject *igraphmodule_Graph_convergence_field_size(igraphmodule_GraphObject *self) {
-  igraph_vector_t ins, outs;
-  PyObject *o1, *o2;
-
-  igraph_vector_init(&ins, 0);
-  igraph_vector_init(&outs, 0);
-  if (igraph_convergence_degree(&self->g, 0, &ins, &outs)) {
-	igraphmodule_handle_igraph_error();
-	igraph_vector_destroy(&ins);
-	igraph_vector_destroy(&outs);
-	return NULL;
-  }
-
-  o1=igraphmodule_vector_t_to_PyList(&ins, IGRAPHMODULE_TYPE_INT);
-  o2=igraphmodule_vector_t_to_PyList(&outs, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&ins);
-  igraph_vector_destroy(&outs);
-  return Py_BuildValue("NN", o1, o2);
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Calculates the average nearest neighbor degree of the vertices
- *   of a \c igraph.Graph
- */
-PyObject *igraphmodule_Graph_knn(igraphmodule_GraphObject *self,
-                                 PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "vids", "weights", NULL };
-  PyObject *vids_obj = Py_None, *weights_obj = Py_None;
-  PyObject *knn_obj, *knnk_obj;
-  igraph_vector_t *weights = 0;
-  igraph_vector_t knn, knnk;
-  igraph_vs_t vids;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &vids_obj, &weights_obj)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&knn, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&knnk, 0)) {
-    igraph_vector_destroy(&knn);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_vs_t(vids_obj, &vids, &self->g, 0, 0)) {
-    igraph_vector_destroy(&knn);
-    igraph_vector_destroy(&knnk);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_obj, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&vids);
-    igraph_vector_destroy(&knn);
-    igraph_vector_destroy(&knnk);
-    return NULL;
-  }
-
-  if (igraph_avg_nearest_neighbor_degree(&self->g, vids, &knn, &knnk, weights)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vids);
-    igraph_vector_destroy(&knn);
-    igraph_vector_destroy(&knnk);
-    if (weights) {
-      igraph_vector_destroy(weights);
-      free(weights);
-    }
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vids);
-  if (weights) {
-    igraph_vector_destroy(weights);
-    free(weights);
-  }
-
-  knn_obj = igraphmodule_vector_t_to_PyList(&knn, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&knn);
-  if (!knn_obj) {
-    igraph_vector_destroy(&knnk);
-    return NULL;
-  }
-
-  knnk_obj = igraphmodule_vector_t_to_PyList(&knnk, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&knnk);
-  if (!knnk_obj) {
-    Py_DECREF(knn_obj);
-    return NULL;
-  }
-
-  return Py_BuildValue("NN", knn_obj, knnk_obj);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the radius of an \c igraph.Graph
- * 
- * \return the radius as a Python integer
- * \sa igraph_radius
- */
-PyObject *igraphmodule_Graph_radius(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  PyObject *mode_o = Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  igraph_real_t radius;
-
-  static char *kwlist[] = { "mode", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist,
-                                   &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraph_radius(&self->g, &radius, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return PyFloat_FromDouble((double)radius);
-}
-
-/**********************************************************************
- * Deterministic and non-deterministic graph generators               *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph from its adjacency matrix
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_adjacency
- */
-PyObject *igraphmodule_Graph_Adjacency(PyTypeObject * type,
-                                       PyObject * args, PyObject * kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraph_matrix_t m;
-  PyObject *matrix, *mode_o = Py_None;
-  igraph_adjacency_t mode = IGRAPH_ADJ_DIRECTED;
-
-  static char *kwlist[] = { "matrix", "mode", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O", kwlist,
-                                   &PyList_Type, &matrix, &mode_o))
-    return NULL;
-  if (igraphmodule_PyObject_to_adjacency_t(mode_o, &mode)) return NULL;
-
-  if (igraphmodule_PyList_to_matrix_t(matrix, &m)) {
-    PyErr_SetString(PyExc_TypeError,
-                    "Error while converting adjacency matrix");
-    return NULL;
-  }
-
-  if (igraph_adjacency(&g, &m, mode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  igraph_matrix_destroy(&m);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph from the Graph Atlas
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_atlas
- */
-PyObject *igraphmodule_Graph_Atlas(PyTypeObject * type, PyObject * args)
-{
-  long n;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  if (!PyArg_ParseTuple(args, "l", &n))
-    return NULL;
-
-  if (igraph_atlas(&g, (igraph_integer_t) n)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on the Barabasi-Albert model
- * This is intended to be a class method in Python, so the first argument
- * is the type object and not the Python igraph object (because we have
- * to allocate that in this method).
- * 
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_barabasi_game
- */
-PyObject *igraphmodule_Graph_Barabasi(PyTypeObject * type,
-                                      PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, m = 1;
-  float power = 1.0f, zero_appeal = 1.0f;
-  igraph_vector_t outseq;
-  igraph_t *start_from = 0;
-  igraph_barabasi_algorithm_t algo = IGRAPH_BARABASI_PSUMTREE;
-  PyObject *m_obj = 0, *outpref = Py_False, *directed = Py_False;
-  PyObject *implementation_o = Py_None;
-  PyObject *start_from_o = Py_None;
-
-  static char *kwlist[] =
-    { "n", "m", "outpref", "directed", "power", "zero_appeal",
-      "implementation", "start_from", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|OOOffOO", kwlist,
-                                   &n, &m_obj, &outpref, &directed, &power,
-                                   &zero_appeal, &implementation_o,
-                                   &start_from_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_barabasi_algorithm_t(implementation_o,
-        &algo))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_igraph_t(start_from_o, &start_from))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (m_obj == 0) {
-    igraph_vector_init(&outseq, 0);
-    m = 1;
-  } else if (m_obj != 0) {
-    /* let's check whether we have a constant out-degree or a list */
-    if (PyInt_Check(m_obj)) {
-      m = PyInt_AsLong(m_obj);
-      igraph_vector_init(&outseq, 0);
-    } else if (PyList_Check(m_obj)) {
-      if (igraphmodule_PyObject_to_vector_t(m_obj, &outseq, 1, 0)) {
-        /* something bad happened during conversion */
-       return NULL;
-      }
-    } else {
-      PyErr_SetString(PyExc_TypeError, "m must be an integer or a list of integers");
-      return NULL;
-    }
-  }
-
-  if (igraph_barabasi_game(&g, (igraph_integer_t) n,
-                           (igraph_real_t) power,
-                           (igraph_integer_t) m,
-                           &outseq, PyObject_IsTrue(outpref),
-                           (igraph_real_t) zero_appeal,
-                           PyObject_IsTrue(directed), algo,
-                           start_from)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&outseq);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&outseq);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a bipartite graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_barabasi_game
- */
-PyObject *igraphmodule_Graph_Bipartite(PyTypeObject * type,
-                                       PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraph_vector_bool_t types;
-  igraph_vector_t edges;
-  PyObject *types_o, *edges_o, *directed = Py_False;
-
-  static char *kwlist[] = { "types", "edges", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO|O", kwlist,
-                                   &types_o, &edges_o, &directed))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_bool_t(types_o, &types))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_edgelist(edges_o, &edges, 0)) {
-    igraph_vector_bool_destroy(&types);
-    return NULL;
-  }
-
-  if (igraph_create_bipartite(&g, &types, &edges, PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&edges);
-    igraph_vector_bool_destroy(&types);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&edges);
-  igraph_vector_bool_destroy(&types);
-  
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a De Bruijn graph
- * \sa igraph_kautz
- */
-PyObject *igraphmodule_Graph_De_Bruijn(PyTypeObject *type, PyObject *args,
-  PyObject *kwds) {
-  long int m, n;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = {"m", "n", NULL};
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll", kwlist, &m, &n))
-    return NULL;
-
-  if (igraph_de_bruijn(&g, (igraph_integer_t) m, (igraph_integer_t) n)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject*)self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a random graph with a given degree sequence
- * This is intended to be a class method in Python, so the first argument
- * is the type object and not the Python igraph object (because we have
- * to allocate that in this method).
- * 
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_degree_sequence_game
- */
-PyObject *igraphmodule_Graph_Degree_Sequence(PyTypeObject * type,
-                                             PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraph_vector_t outseq, inseq;
-  igraph_degseq_t meth = IGRAPH_DEGSEQ_SIMPLE;
-  igraph_bool_t has_inseq = 0;
-  PyObject *outdeg = NULL, *indeg = NULL, *method = NULL;
-
-  static char *kwlist[] = { "out", "in", "method", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O!O", kwlist,
-                                   &PyList_Type, &outdeg,
-                                   &PyList_Type, &indeg,
-								   &method))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_degseq_t(method, &meth)) return NULL;
-  if (igraphmodule_PyObject_to_vector_t(outdeg, &outseq, 1, 0)) return NULL;
-  if (indeg) {
-    if (igraphmodule_PyObject_to_vector_t(indeg, &inseq, 1, 0)) {
-      igraph_vector_destroy(&outseq);
-      return NULL;
-    }
-    has_inseq=1;
-  }
-
-  if (igraph_degree_sequence_game(&g, &outseq, has_inseq ? &inseq : 0, meth)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&outseq);
-    if (has_inseq)
-      igraph_vector_destroy(&inseq);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&outseq);
-  if (has_inseq)
-    igraph_vector_destroy(&inseq);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on the Erdõs-Rényi model
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_erdos_renyi_game
- */
-PyObject *igraphmodule_Graph_Erdos_Renyi(PyTypeObject * type,
-                                         PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, m = -1;
-  double p = -1.0;
-  igraph_erdos_renyi_t t;
-  PyObject *loops = NULL, *directed = NULL;
-
-  static char *kwlist[] = { "n", "p", "m", "directed", "loops", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|dlO!O!", kwlist,
-                                   &n, &p, &m,
-                                   &PyBool_Type, &directed,
-                                   &PyBool_Type, &loops))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (m == -1 && p == -1.0) {
-    // no density parameters were given, throw exception
-    PyErr_SetString(PyExc_TypeError, "Either m or p must be given.");
-    return NULL;
-  }
-  if (m != -1 && p != -1.0) {
-    // both density parameters were given, throw exception
-    PyErr_SetString(PyExc_TypeError, "Only one must be given from m and p.");
-    return NULL;
-  }
-
-  t = (m == -1) ? IGRAPH_ERDOS_RENYI_GNP : IGRAPH_ERDOS_RENYI_GNM;
-
-  if (t == IGRAPH_ERDOS_RENYI_GNP) {
-    if (p < 0.0 || p > 1.0) {
-      // Invalid probability was given, throw exception
-      PyErr_SetString(PyExc_ValueError, "p must be between 0 and 1.");
-      return NULL;
-    }
-  } else {
-    if (m < 0 || ((double)m)/n > n ) {
-      // Invalid edge count was given, throw exception
-      PyErr_SetString(PyExc_ValueError, "m must be between 0 and n^2.");
-      return NULL;
-    }
-  }
-
-  if (igraph_erdos_renyi_game(&g, t, (igraph_integer_t) n,
-                              (igraph_real_t) ((t == IGRAPH_ERDOS_RENYI_GNM) ? m : p),
-							  (directed == Py_True), (loops == Py_True))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on a simple growing model with vertex types
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_establishment_game
- */
-PyObject *igraphmodule_Graph_Establishment(PyTypeObject * type,
-                                           PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, types, k;
-  PyObject *type_dist, *pref_matrix;
-  PyObject *directed = Py_False;
-  igraph_matrix_t pm;
-  igraph_vector_t td;
-
-  char *kwlist[] = { "n", "k", "type_dist", "pref_matrix", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "llO!O!|O", kwlist,
-                                   &n, &k, &PyList_Type, &type_dist,
-                                   &PyList_Type, &pref_matrix, &directed))
-    return NULL;
-
-  if (n <= 0 || k <= 0) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Number of vertices and the amount of connection trials per step must be positive.");
-    return NULL;
-  }
-  types = PyList_Size(type_dist);
-
-  if (igraphmodule_PyList_to_matrix_t(pref_matrix, &pm)) {
-    PyErr_SetString(PyExc_TypeError,
-                    "Error while converting preference matrix");
-    return NULL;
-  }
-  if (igraph_matrix_nrow(&pm) != igraph_matrix_ncol(&pm) ||
-      igraph_matrix_nrow(&pm) != types) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Preference matrix must have exactly the same rows and columns as the number of types");
-    igraph_matrix_destroy(&pm);
-    return NULL;
-  }
-  if (igraphmodule_PyObject_to_vector_t(type_dist, &td, 1, 0)) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Error while converting type distribution vector");
-    igraph_matrix_destroy(&pm);
-    return NULL;
-  }
-
-  if (igraph_establishment_game(&g, (igraph_integer_t) n,
-                                (igraph_integer_t) types,
-                                (igraph_integer_t) k, &td, &pm,
-                                PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&pm);
-    igraph_vector_destroy(&td);
-    return NULL;
-  }
-
-  igraph_matrix_destroy(&pm);
-  igraph_vector_destroy(&td);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a famous graph by name
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_famous
- */
-PyObject *igraphmodule_Graph_Famous(PyTypeObject * type,
-                                    PyObject * args, PyObject * kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  const char* name;
-
-  static char *kwlist[] = { "name", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "s", kwlist, &name))
-    return NULL;
-
-  if (igraph_famous(&g, name)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on the forest fire model
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_forest_fire_game
- */
-PyObject *igraphmodule_Graph_Forest_Fire(PyTypeObject * type,
-  PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, ambs=1;
-  double fw_prob, bw_factor=0.0;
-  PyObject *directed = Py_False;
-
-  static char *kwlist[] = {"n", "fw_prob", "bw_factor", "ambs", "directed", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ld|dlO", kwlist,
-                                   &n, &fw_prob, &bw_factor, &ambs, &directed))
-    return NULL;
-
-  if (igraph_forest_fire_game(&g, (igraph_integer_t)n,
-                              (igraph_real_t)fw_prob, (igraph_real_t)bw_factor,
-                              (igraph_integer_t)ambs,
-							  (igraph_bool_t)(PyObject_IsTrue(directed)))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Generates a full graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_full
- */
-PyObject *igraphmodule_Graph_Full(PyTypeObject * type,
-                                  PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n;
-  PyObject *loops = Py_False, *directed = Py_False;
-
-  char *kwlist[] = { "n", "directed", "loops", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|OO", kwlist, &n,
-                                   &directed, &loops))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (igraph_full(&g, (igraph_integer_t) n, PyObject_IsTrue(directed),
-			      PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a full bipartite graph
- * \sa igraph_full_bipartite
- */
-PyObject *igraphmodule_Graph_Full_Bipartite(PyTypeObject * type,
-                                            PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraph_vector_bool_t vertex_types;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  long int n1, n2;
-  PyObject *mode_o = Py_None, *directed = Py_False, *vertex_types_o = 0;
-
-  static char *kwlist[] = { "n1", "n2", "directed", "mode", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|OO", kwlist, &n1, &n2,
-                                   &directed, &mode_o))
-    return NULL;
-
-  if (n1 < 0 || n2 < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-	  return NULL;
-
-  if (igraph_vector_bool_init(&vertex_types, n1+n2)) {
-    igraphmodule_handle_igraph_error();
-	return NULL;
-  }
-
-  if (igraph_full_bipartite(&g, &vertex_types,
-        (igraph_integer_t) n1, (igraph_integer_t) n2,
-        PyObject_IsTrue(directed), mode)) {
-	igraph_vector_bool_destroy(&vertex_types);
-    igraphmodule_handle_igraph_error();
-	return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  vertex_types_o = igraphmodule_vector_bool_t_to_PyList(&vertex_types);
-  igraph_vector_bool_destroy(&vertex_types);
-  if (vertex_types_o == 0) return NULL;
-  return Py_BuildValue("NN", (PyObject *) self, vertex_types_o);
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a full citation graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_full
- */
-PyObject *igraphmodule_Graph_Full_Citation(PyTypeObject *type,
-    PyObject *args, PyObject *kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n;
-  PyObject *directed = Py_False;
-
-  char *kwlist[] = { "n", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|O", kwlist, &n, &directed))
-    return NULL;
-
-  if (igraph_full_citation(&g, (igraph_integer_t) n,
-                           (igraph_bool_t) PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on the geometric random model
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_grg_game
- */
-PyObject *igraphmodule_Graph_GRG(PyTypeObject * type,
-                                 PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n;
-  double r;
-  PyObject *torus = Py_False;
-  PyObject *o_xs, *o_ys;
-  igraph_vector_t xs, ys;
-
-  static char *kwlist[] = { "n", "radius", "torus", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ld|O", kwlist,
-                                   &n, &r, &torus))
-    return NULL;
-
-  if (igraph_vector_init(&xs, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  } else if (igraph_vector_init(&ys, 0)) {
-    igraph_vector_destroy(&xs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_grg_game(&g, (igraph_integer_t) n, (igraph_real_t) r,
-                      PyObject_IsTrue(torus), &xs, &ys)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&xs);
-    igraph_vector_destroy(&ys);
-    return NULL;
-  }
-
-  o_xs = igraphmodule_vector_t_to_PyList(&xs, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&xs);
-  if (!o_xs) {
-    igraph_destroy(&g);
-    igraph_vector_destroy(&ys);
-    return NULL;
-  }
-  o_ys = igraphmodule_vector_t_to_PyList(&ys, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&ys);
-  if (!o_ys) {
-    igraph_destroy(&g);
-    Py_DECREF(o_xs);
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-  return Py_BuildValue("NNN", (PyObject*)self, o_xs, o_ys);
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a growing random graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_growing_random_game
- */
-PyObject *igraphmodule_Graph_Growing_Random(PyTypeObject * type,
-                                            PyObject * args, PyObject * kwds)
-{
-  long n, m;
-  PyObject *directed = NULL, *citation = NULL;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "m", "directed", "citation", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|O!O!", kwlist, &n, &m,
-                                   &PyBool_Type, &directed,
-                                   &PyBool_Type, &citation))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (m < 0) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Number of new edges per iteration must be positive.");
-    return NULL;
-  }
-
-  if (igraph_growing_random_game(&g, (igraph_integer_t) n,
-                                 (igraph_integer_t) m,
-                                 (directed == Py_True),
-                                 (citation == Py_True))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a bipartite graph from an incidence matrix
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_incidence
- */
-PyObject *igraphmodule_Graph_Incidence(PyTypeObject * type,
-                                       PyObject * args, PyObject * kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_matrix_t matrix;
-  igraph_vector_bool_t vertex_types;
-  igraph_t g;
-  PyObject *matrix_o, *vertex_types_o;
-  PyObject *mode_o = Py_None, *directed = Py_False, *multiple = Py_False;
-  igraph_neimode_t mode = IGRAPH_OUT;
-
-  static char *kwlist[] = { "matrix", "directed", "mode", "multiple", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|OOO", kwlist, &PyList_Type, &matrix_o,
-			  &directed, &mode_o, &multiple))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-
-  if (igraph_vector_bool_init(&vertex_types, 0)) {
-    igraphmodule_handle_igraph_error();
-	return NULL;
-  }
-
-  if (igraphmodule_PyList_to_matrix_t(matrix_o, &matrix)) {
-	igraph_vector_bool_destroy(&vertex_types);
-    PyErr_SetString(PyExc_TypeError,
-                    "Error while converting incidence matrix");
-    return NULL;
-  }
-
-  if (igraph_incidence(&g, &vertex_types, &matrix,
-			  PyObject_IsTrue(directed), mode, PyObject_IsTrue(multiple))) {
-	igraphmodule_handle_igraph_error();
-	igraph_matrix_destroy(&matrix);
-	igraph_vector_bool_destroy(&vertex_types);
-	return NULL;
-  }
-
-  igraph_matrix_destroy(&matrix);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  vertex_types_o = igraphmodule_vector_bool_t_to_PyList(&vertex_types);
-  igraph_vector_bool_destroy(&vertex_types);
-  if (vertex_types_o == 0) return NULL;
-  return Py_BuildValue("NN", (PyObject *) self, vertex_types_o);
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph with a given isomorphy class
- * This is intended to be a class method in Python, so the first argument
- * is the type object and not the Python igraph object (because we have
- * to allocate that in this method).
- * 
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_isoclass_create
- */
-PyObject *igraphmodule_Graph_Isoclass(PyTypeObject * type,
-                                      PyObject * args, PyObject * kwds)
-{
-  long int n, isoclass;
-  PyObject *directed = Py_False;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "class", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|O", kwlist,
-                                   &n, &isoclass, &directed))
-    return NULL;
-
-  if (n < 3 || n > 4) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Only graphs with 3 or 4 vertices are supported");
-    return NULL;
-  }
-
-  if (igraph_isoclass_create(&g, (igraph_integer_t) n,
-        (igraph_integer_t) isoclass, PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a Kautz graph
- * \sa igraph_kautz
- */
-PyObject *igraphmodule_Graph_Kautz(PyTypeObject *type, PyObject *args,
-  PyObject *kwds) {
-  long int m, n;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = {"m", "n", NULL};
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll", kwlist, &m, &n))
-    return NULL;
-
-  if (igraph_kautz(&g, (igraph_integer_t) m, (igraph_integer_t) n)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject*)self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a k-regular random graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_k_regular_game
- */
-PyObject *igraphmodule_Graph_K_Regular(PyTypeObject * type,
-                                 PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long int n, k;
-  PyObject *directed_o = Py_False, *multiple_o = Py_False;
-
-  static char *kwlist[] = { "n", "k", "directed", "multiple", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|OO", kwlist,
-                                   &n, &k, &directed_o, &multiple_o))
-    return NULL;
-
-  if (igraph_k_regular_game(&g, (igraph_integer_t) n, (igraph_integer_t) k,
-                      PyObject_IsTrue(directed_o), PyObject_IsTrue(multiple_o))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject*)self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a regular lattice
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_lattice
- */
-PyObject *igraphmodule_Graph_Lattice(PyTypeObject * type,
-                                     PyObject * args, PyObject * kwds)
-{
-  igraph_vector_t dimvector;
-  long int nei = 1;
-  igraph_bool_t directed;
-  igraph_bool_t mutual;
-  igraph_bool_t circular;
-  PyObject *o_directed = Py_False, *o_mutual = Py_True, *o_circular = Py_True;
-  PyObject *o_dimvector = Py_None;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "dim", "nei", "directed", "mutual", "circular", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|lOOO", kwlist,
-                                   &PyList_Type, &o_dimvector,
-                                   &nei, &o_directed, &o_mutual, &o_circular))
-    return NULL;
-
-  directed = PyObject_IsTrue(o_directed);
-  mutual = PyObject_IsTrue(o_mutual);
-  circular = PyObject_IsTrue(o_circular);
-
-  if (igraphmodule_PyObject_to_vector_t(o_dimvector, &dimvector, 1, 0))
-    return NULL;
-
-  if (igraph_lattice(&g, &dimvector, (igraph_integer_t) nei,
-        directed, mutual, circular)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&dimvector);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&dimvector);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a 3-regular Hamiltonian graph from LCF notation
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_lattice
- */
-PyObject *igraphmodule_Graph_LCF(PyTypeObject *type,
-                                 PyObject *args, PyObject *kwds) {
-  igraph_vector_t shifts;
-  long int repeats, n;
-  PyObject *o_shifts;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "shifts", "repeats", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "lOl", kwlist,
-                                   &n, &o_shifts, &repeats))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(o_shifts, &shifts, 0, 0))
-    return NULL;
-
-  if (igraph_lcf_vector(&g, (igraph_integer_t) n, &shifts, (igraph_integer_t) repeats)) {
-    igraph_vector_destroy(&shifts);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  igraph_vector_destroy(&shifts);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on vertex types and connection preferences
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_preference_game
- */
-PyObject *igraphmodule_Graph_Preference(PyTypeObject * type,
-                                        PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, types;
-  PyObject *type_dist, *pref_matrix;
-  PyObject *directed = Py_False;
-  PyObject *loops = Py_False;
-  igraph_matrix_t pm;
-  igraph_vector_t td;
-  igraph_vector_t type_vec;
-  PyObject *type_vec_o;
-  PyObject *attribute_key = Py_None;
-  igraph_bool_t store_attribs;
-
-  char *kwlist[] =
-    { "n", "type_dist", "pref_matrix", "attribute", "directed", "loops",
-NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "lO!O!|OOO", kwlist,
-                                   &n, &PyList_Type, &type_dist,
-                                   &PyList_Type, &pref_matrix,
-                                   &attribute_key, &directed, &loops))
-    return NULL;
-
-  types = PyList_Size(type_dist);
-
-  if (igraphmodule_PyList_to_matrix_t(pref_matrix, &pm)) return NULL;
-  if (igraphmodule_PyObject_float_to_vector_t(type_dist, &td)) {
-    igraph_matrix_destroy(&pm);
-    return NULL;
-  }
-
-  store_attribs = (attribute_key && attribute_key != Py_None);
-  if (store_attribs && igraph_vector_init(&type_vec, (igraph_integer_t) n)) {
-    igraph_matrix_destroy(&pm);
-    igraph_vector_destroy(&td);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_preference_game(&g, (igraph_integer_t) n,
-                             (igraph_integer_t) types, &td, 0, &pm,
-                             store_attribs ? &type_vec : 0,
-                             PyObject_IsTrue(directed),
-                             PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&pm);
-    igraph_vector_destroy(&td);
-    if (store_attribs)
-      igraph_vector_destroy(&type_vec);
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  if (store_attribs) {
-    type_vec_o = igraphmodule_vector_t_to_PyList(&type_vec, IGRAPHMODULE_TYPE_INT);
-    if (type_vec_o == 0) {
-      igraph_matrix_destroy(&pm);
-      igraph_vector_destroy(&td);
-      igraph_vector_destroy(&type_vec);
-      Py_DECREF(self);
-      return NULL;
-    }
-    if (attribute_key != Py_None && attribute_key != 0) {
-      if (PyDict_SetItem(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_VERTEX],
-                         attribute_key, type_vec_o) == -1) {
-        Py_DECREF(type_vec_o);
-        igraph_matrix_destroy(&pm);
-        igraph_vector_destroy(&td);
-        igraph_vector_destroy(&type_vec);
-        Py_DECREF(self);
-        return NULL;
-      }
-    }
-
-    Py_DECREF(type_vec_o);
-    igraph_vector_destroy(&type_vec);
-  }
-
-  igraph_matrix_destroy(&pm);
-  igraph_vector_destroy(&td);
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on asymmetric vertex types and connection preferences
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_asymmetric_preference_game
- */
-PyObject *igraphmodule_Graph_Asymmetric_Preference(PyTypeObject * type,
-                                                   PyObject * args,
-                                                   PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, types;
-  PyObject *type_dist_matrix, *pref_matrix;
-  PyObject *loops = Py_False;
-  igraph_matrix_t pm;
-  igraph_matrix_t td;
-  igraph_vector_t in_type_vec, out_type_vec;
-  PyObject *type_vec_o;
-  PyObject *attribute_key = Py_None;
-  igraph_bool_t store_attribs;
-
-  char *kwlist[] =
-    { "n", "type_dist_matrix", "pref_matrix", "attribute", "loops", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "lO!O!|OO", kwlist,
-                                   &n, &PyList_Type, &type_dist_matrix,
-                                   &PyList_Type, &pref_matrix,
-                                   &attribute_key, &loops))
-    return NULL;
-
-  types = PyList_Size(type_dist_matrix);
-  if (igraphmodule_PyList_to_matrix_t(pref_matrix, &pm)) return NULL;
-  if (igraphmodule_PyList_to_matrix_t(type_dist_matrix, &td)) {
-    igraph_matrix_destroy(&pm);
-    return NULL;
-  }
-
-  store_attribs = (attribute_key && attribute_key != Py_None);
-  if (store_attribs) {
-    if (igraph_vector_init(&in_type_vec, (igraph_integer_t) n)) {
-      igraph_matrix_destroy(&pm);
-      igraph_matrix_destroy(&td);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-    if (igraph_vector_init(&out_type_vec, (igraph_integer_t) n)) {
-      igraph_matrix_destroy(&pm);
-      igraph_matrix_destroy(&td);
-      igraph_vector_destroy(&in_type_vec);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  if (igraph_asymmetric_preference_game(&g, (igraph_integer_t) n,
-                                        (igraph_integer_t) types, &td, &pm,
-                                        store_attribs ? &in_type_vec : 0,
-                                        store_attribs ? &out_type_vec : 0,
-                                        PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&in_type_vec);
-    igraph_vector_destroy(&out_type_vec);
-    igraph_matrix_destroy(&pm);
-    igraph_matrix_destroy(&td);
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  if (store_attribs) {
-    type_vec_o = igraphmodule_vector_t_pair_to_PyList(&in_type_vec,
-                                                      &out_type_vec);
-    if (type_vec_o == NULL) {
-      igraph_matrix_destroy(&pm);
-      igraph_matrix_destroy(&td);
-      igraph_vector_destroy(&in_type_vec);
-      igraph_vector_destroy(&out_type_vec);
-      Py_DECREF(self);
-      return NULL;
-    }
-    if (attribute_key != Py_None && attribute_key != 0) {
-      if (PyDict_SetItem(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_VERTEX],
-                         attribute_key, type_vec_o) == -1) {
-        Py_DECREF(type_vec_o);
-        igraph_matrix_destroy(&pm);
-        igraph_matrix_destroy(&td);
-        igraph_vector_destroy(&in_type_vec);
-        igraph_vector_destroy(&out_type_vec);
-        Py_DECREF(self);
-        return NULL;
-      }
-    }
-
-    Py_DECREF(type_vec_o);
-    igraph_vector_destroy(&in_type_vec);
-    igraph_vector_destroy(&out_type_vec);
-  }
-
-  igraph_matrix_destroy(&pm);
-  igraph_matrix_destroy(&td);
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on sort of a "windowed" Barabasi-Albert model
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_recent_degree_game
- */
-PyObject *igraphmodule_Graph_Recent_Degree(PyTypeObject * type,
-                                           PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long n, m = 0, window = 0;
-  float power = 0.0f, zero_appeal = 0.0f;
-  igraph_vector_t outseq;
-  PyObject *m_obj, *outpref = Py_False, *directed = Py_False;
-
-  char *kwlist[] =
-    { "n", "m", "window", "outpref", "directed", "power", "zero_appeal",
-NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "lOl|OOff", kwlist,
-                                   &n, &m_obj, &window, &outpref, &directed,
-                                   &power, &zero_appeal))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  // let's check whether we have a constant out-degree or a list
-  if (PyInt_Check(m_obj)) {
-    m = PyInt_AsLong(m_obj);
-    igraph_vector_init(&outseq, 0);
-  }
-  else if (PyList_Check(m_obj)) {
-    if (igraphmodule_PyObject_to_vector_t(m_obj, &outseq, 1, 0)) {
-      // something bad happened during conversion
-      return NULL;
-    }
-  }
-
-  if (igraph_recent_degree_game(&g, (igraph_integer_t) n,
-                                (igraph_real_t) power,
-                                (igraph_integer_t) window,
-                                (igraph_integer_t) m, &outseq,
-                                PyObject_IsTrue(outpref),
-                                (igraph_real_t) zero_appeal,
-                                PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&outseq);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&outseq);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a ring-shaped graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_ring
- */
-PyObject *igraphmodule_Graph_Ring(PyTypeObject * type,
-                                  PyObject * args, PyObject * kwds)
-{
-  long n;
-  PyObject *directed = Py_False, *mutual = Py_False, *circular = Py_True;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "directed", "mutual", "circular", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|O!O!O!", kwlist, &n,
-                                   &PyBool_Type, &directed,
-                                   &PyBool_Type, &mutual,
-                                   &PyBool_Type, &circular))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (igraph_ring(&g, (igraph_integer_t) n, (directed == Py_True),
-                  (mutual == Py_True), (circular == Py_True))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a star graph
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_star
- */
-PyObject *igraphmodule_Graph_Star(PyTypeObject * type,
-                                  PyObject * args, PyObject * kwds)
-{
-  long n, center = 0;
-  igraph_star_mode_t mode = IGRAPH_STAR_UNDIRECTED;
-  PyObject* mode_o = Py_None;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "mode", "center", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|Ol", kwlist,
-                                   &n, &mode_o, &center))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (center >= n || center < 0) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Central vertex ID should be between 0 and n-1");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_star_mode_t(mode_o, &mode)) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Mode should be either \"in\", \"out\", \"mutual\" or \"undirected\"");
-    return NULL;
-  }
-
-  if (igraph_star(&g, (igraph_integer_t) n, mode, (igraph_integer_t) center)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a non-growing random graph with edge probabilities
- *        proportional to node fitnesses.
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_static_fitness_game
- */
-PyObject *igraphmodule_Graph_Static_Fitness(PyTypeObject *type,
-    PyObject* args, PyObject* kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long int m;
-  PyObject *fitness_out_o = Py_None, *fitness_in_o = Py_None;
-  PyObject *fitness_o = Py_None;
-  PyObject *multiple = Py_False, *loops = Py_False;
-  igraph_vector_t fitness_out, fitness_in;
-
-  static char *kwlist[] = { "m", "fitness_out", "fitness_in",
-    "loops", "multiple", "fitness", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|OOOOO", kwlist,
-                                   &m, &fitness_out_o, &fitness_in_o,
-                                   &loops, &multiple, &fitness_o))
-    return NULL;
-
-  /* This trickery allows us to use "fitness" or "fitness_out" as
-   * keyword argument, with "fitness_out" taking precedence over
-   * "fitness" */
-  if (fitness_out_o == Py_None)
-    fitness_out_o = fitness_o;
-  if (fitness_out_o == Py_None) {
-    PyErr_SetString(PyExc_TypeError,
-        "Required argument 'fitness_out' (pos 2) not found");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_float_to_vector_t(fitness_out_o, &fitness_out))
-    return NULL;
-
-  if (fitness_in_o != Py_None) {
-    if (igraphmodule_PyObject_float_to_vector_t(fitness_in_o, &fitness_in)) {
-      igraph_vector_destroy(&fitness_out);
-      return NULL;
-    }
-  }
-
-  if (igraph_static_fitness_game(&g, (igraph_integer_t) m, &fitness_out,
-        fitness_in_o == Py_None ? 0 : &fitness_in,
-        PyObject_IsTrue(loops), PyObject_IsTrue(multiple))) {
-    igraph_vector_destroy(&fitness_out);
-    if (fitness_in_o != Py_None)
-      igraph_vector_destroy(&fitness_in);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  igraph_vector_destroy(&fitness_out);
-  if (fitness_in_o != Py_None)
-    igraph_vector_destroy(&fitness_in);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a non-growing random graph with prescribed power-law
- *        degree distributions.
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_static_power_law_game
- */
-PyObject *igraphmodule_Graph_Static_Power_Law(PyTypeObject *type,
-    PyObject* args, PyObject* kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  long int n, m;
-  float exponent_out = -1.0f, exponent_in = -1.0f, exponent = -1.0f;
-  PyObject *multiple = Py_False, *loops = Py_False;
-  PyObject *finite_size_correction = Py_True;
-
-  static char *kwlist[] = { "n", "m", "exponent_out", "exponent_in",
-    "loops", "multiple", "finite_size_correction", "exponent", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|ffOOOf", kwlist,
-                                   &n, &m, &exponent_out, &exponent_in,
-                                   &loops, &multiple, &finite_size_correction,
-                                   &exponent))
-    return NULL;
-
-  /* This trickery allows us to use "exponent" or "exponent_out" as
-   * keyword argument, with "exponent_out" taking precedence over
-   * "exponent" */
-  if (exponent_out == -1.0)
-    exponent_out = exponent;
-  if (exponent_out == -1.0) {
-    PyErr_SetString(PyExc_TypeError,
-        "Required argument 'exponent_out' (pos 3) not found");
-    return NULL;
-  }
-
-  if (igraph_static_power_law_game(&g, (igraph_integer_t) n, (igraph_integer_t) m,
-        exponent_out, exponent_in,
-        PyObject_IsTrue(loops), PyObject_IsTrue(multiple),
-        PyObject_IsTrue(finite_size_correction))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a tree graph where almost all vertices have an equal number of children
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_tree
- */
-PyObject *igraphmodule_Graph_Tree(PyTypeObject * type,
-                                  PyObject * args, PyObject * kwds)
-{
-  long int n, children;
-  PyObject *tree_mode_o = Py_None, *tree_type_o = Py_None;
-  igraph_tree_mode_t mode = IGRAPH_TREE_UNDIRECTED;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "n", "children", "mode", "type", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|OO", kwlist,
-                                   &n, &children,
-                                   &tree_mode_o, &tree_type_o))
-    return NULL;
-
-  if (n < 0) {
-    PyErr_SetString(PyExc_ValueError, "Number of vertices must be positive.");
-    return NULL;
-  }
-
-  if (tree_mode_o == Py_None && tree_type_o != Py_None) {
-    tree_mode_o = tree_type_o;
-    PY_IGRAPH_DEPRECATED("type=... keyword argument is deprecated since igraph 0.6, use mode=... instead");
-  }
-
-  if (igraphmodule_PyObject_to_tree_mode_t(tree_mode_o, &mode)) {
-    return NULL;
-  }
-
-  if (igraph_tree(&g, (igraph_integer_t) n, (igraph_integer_t) children, mode)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph based on the Watts-Strogatz model
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_watts_strogatz_game
- */
-PyObject *igraphmodule_Graph_Watts_Strogatz(PyTypeObject * type,
-                                            PyObject * args, PyObject * kwds)
-{
-  long int nei = 1, dim, size;
-  double p;
-  PyObject* loops = Py_False;
-  PyObject* multiple = Py_False;
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-
-  static char *kwlist[] = { "dim", "size", "nei", "p", "loops", "multiple", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "llld|OO", kwlist,
-                                   &dim, &size, &nei, &p, &loops, &multiple))
-    return NULL;
-
-  if (igraph_watts_strogatz_game(&g, (igraph_integer_t) dim,
-        (igraph_integer_t) size, (igraph_integer_t) nei, p,
-        PyObject_IsTrue(loops), PyObject_IsTrue(multiple))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Generates a graph from its weighted adjacency matrix
- * \return a reference to the newly generated Python igraph object
- * \sa igraph_weighted_adjacency
- */
-PyObject *igraphmodule_Graph_Weighted_Adjacency(PyTypeObject * type,
-                                       PyObject * args, PyObject * kwds) {
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraph_matrix_t m;
-  PyObject *matrix, *mode_o = Py_None, *attr_o = Py_None, *s = 0;
-  PyObject *loops = Py_True;
-  char* attr = 0;
-  igraph_adjacency_t mode = IGRAPH_ADJ_DIRECTED;
-
-  static char *kwlist[] = { "matrix", "mode", "attr", "loops", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|OOO", kwlist,
-                                   &PyList_Type, &matrix, &mode_o, &attr_o,
-                                   &loops))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_adjacency_t(mode_o, &mode))
-    return NULL;
-
-  if (attr_o != Py_None) {
-    s = PyObject_Str(attr_o);
-    if (s) {
-      attr = PyString_CopyAsString(s);
-      if (attr == 0)
-        return NULL;
-    } else return NULL;
-  }
-
-  if (igraphmodule_PyList_to_matrix_t(matrix, &m)) {
-    if (attr != 0)
-      free(attr);
-    PyErr_SetString(PyExc_TypeError,
-                    "Error while converting adjacency matrix");
-    return NULL;
-  }
-
-  if (igraph_weighted_adjacency(&g, &m, mode, attr ? attr : "weight",
-        PyObject_IsTrue(loops))) {
-    igraphmodule_handle_igraph_error();
-    if (attr != 0)
-      free(attr);
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  if (attr != 0)
-    free(attr);
-  igraph_matrix_destroy(&m);
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/**********************************************************************
- * Advanced structural properties of graphs                           *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates the articulation points of a graph.
- * \return the list of articulation points in a PyObject
- * \sa igraph_articulation_points
- */
-PyObject *igraphmodule_Graph_articulation_points(igraphmodule_GraphObject *self) {
-  igraph_vector_t res;
-  PyObject *o;
-  if (igraph_vector_init(&res, 0)) {
-	igraphmodule_handle_igraph_error();
-	return NULL;
-  }
-
-  if (igraph_articulation_points(&self->g, &res)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  igraph_vector_sort(&res);
-  o = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-  return o;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the nominal assortativity coefficient
- * \sa igraph_assortativity_nominal
- */
-PyObject *igraphmodule_Graph_assortativity_nominal(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] = { "types", "directed", NULL };
-  PyObject *types_o = Py_None, *directed = Py_True;
-  igraph_real_t res;
-  int ret;
-  igraph_vector_t *types = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &types_o, &directed))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX))
-    return NULL;
-
-  ret = igraph_assortativity_nominal(&self->g, types, &res, PyObject_IsTrue(directed));
-
-  if (types) {
-    igraph_vector_destroy(types); free(types);
-  }
-
-  if (ret) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return Py_BuildValue("d", (double)(res));
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the assortativity coefficient
- * \sa igraph_assortativity
- */
-PyObject *igraphmodule_Graph_assortativity(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] = { "types1", "types2", "directed", NULL };
-  PyObject *types1_o = Py_None, *types2_o = Py_None, *directed = Py_True;
-  igraph_real_t res;
-  int ret;
-  igraph_vector_t *types1 = 0, *types2 = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OO", kwlist, &types1_o, &types2_o, &directed))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(types1_o, self, &types1, ATTRIBUTE_TYPE_VERTEX))
-    return NULL;
-  if (igraphmodule_attrib_to_vector_t(types2_o, self, &types2, ATTRIBUTE_TYPE_VERTEX)) {
-    if (types1) { igraph_vector_destroy(types1); free(types1); }
-    return NULL;
-  }
-
-  ret = igraph_assortativity(&self->g, types1, types2, &res, PyObject_IsTrue(directed));
-
-  if (types1) { igraph_vector_destroy(types1); free(types1); }
-  if (types2) { igraph_vector_destroy(types2); free(types2); }
-
-  if (ret) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return Py_BuildValue("d", (double)(res));
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the assortativity coefficient for degrees
- * \sa igraph_assortativity_degree
- */
-PyObject *igraphmodule_Graph_assortativity_degree(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] = { "directed", NULL };
-  PyObject *directed = Py_True;
-  igraph_real_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &directed))
-    return NULL;
-
-  if (igraph_assortativity_degree(&self->g, &res, PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return Py_BuildValue("d", (double)(res));
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates Kleinberg's authority scores of the vertices in the graph
- * \sa igraph_authority_score
- */
-PyObject *igraphmodule_Graph_authority_score(
-  igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] =
-    { "weights", "scale", "arpack_options", "return_eigenvalue", NULL };
-  PyObject *scale_o = Py_True, *weights_o = Py_None;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  PyObject *return_eigenvalue = Py_False;
-  PyObject *res_o;
-  igraph_real_t value;
-  igraph_vector_t res, *weights = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO!O", kwlist, &weights_o,
-	                               &scale_o, &igraphmodule_ARPACKOptionsType,
-                                   &arpack_options_o, &return_eigenvalue))
-    return NULL;
-
-  if (igraph_vector_init(&res, 0)) return igraphmodule_handle_igraph_error();
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (igraph_authority_score(&self->g, &res, &value, PyObject_IsTrue(scale_o),
-      weights, igraphmodule_ARPACKOptions_get(arpack_options))) {
-    igraphmodule_handle_igraph_error();
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  res_o = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT); 
-  igraph_vector_destroy(&res);
-  if (res_o == NULL) return igraphmodule_handle_igraph_error();
-
-  if (PyObject_IsTrue(return_eigenvalue)) {
-    PyObject *ev_o = PyFloat_FromDouble((double)value);
-    if (ev_o == NULL) {
-      Py_DECREF(res_o);
-      return igraphmodule_handle_igraph_error();
-    }
-    return Py_BuildValue("NN", res_o, ev_o);
-  }
-
-  return res_o;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Calculates the average path length in a graph.
- * \return the average path length as a PyObject
- * \sa igraph_average_path_length
- */
-PyObject *igraphmodule_Graph_average_path_length(igraphmodule_GraphObject *
-                                                 self, PyObject * args,
-                                                 PyObject * kwds)
-{
-  char *kwlist[] = { "directed", "unconn", NULL };
-  PyObject *directed = Py_True, *unconn = Py_True;
-  igraph_real_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O!O!", kwlist,
-                                   &PyBool_Type, &directed,
-                                   &PyBool_Type, &unconn))
-    return NULL;
-
-  if (igraph_average_path_length(&self->g, &res, (directed == Py_True),
-                                 (unconn == Py_True))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  return PyFloat_FromDouble(res);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the betweennesses of some vertices in a graph.
- * \return the betweennesses as a list (or a single float)
- * \sa igraph_betweenness
- */
-PyObject *igraphmodule_Graph_betweenness(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "vertices", "directed", "cutoff", "weights",
-    "nobigint", NULL };
-  PyObject *directed = Py_True;
-  PyObject *vobj = Py_None, *list;
-  PyObject *cutoff = Py_None;
-  PyObject *weights_o = Py_None;
-  PyObject *nobigint = Py_True;
-  igraph_vector_t res, *weights = 0;
-  igraph_bool_t return_single = 0;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOOO", kwlist,
-                                   &vobj, &directed, &cutoff, &weights_o,
-                                   &nobigint)) {
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (cutoff == Py_None) {
-    if (igraph_betweenness(&self->g, &res, vs, PyObject_IsTrue(directed),
-          weights, PyObject_IsTrue(nobigint))) {
-      igraph_vs_destroy(&vs);
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else if (PyNumber_Check(cutoff)) {
-    PyObject *cutoff_num = PyNumber_Int(cutoff);
-    if (cutoff_num == NULL) {
-      igraph_vs_destroy(&vs);
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      return NULL;
-    }
-    if (igraph_betweenness_estimate(&self->g, &res, vs, PyObject_IsTrue(directed),
-        (igraph_integer_t)PyInt_AsLong(cutoff_num), weights,
-        PyObject_IsTrue(nobigint))) {
-      igraph_vs_destroy(&vs);
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      Py_DECREF(cutoff_num);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-    Py_DECREF(cutoff_num);
-  } else {
-    PyErr_SetString(PyExc_TypeError, "cutoff value must be None or integer");
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&res);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(res)[0]);
-
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the bibliographic coupling of some vertices in a graph.
- * \return the bibliographic coupling values in a matrix
- * \sa igraph_bibcoupling
- */
-PyObject *igraphmodule_Graph_bibcoupling(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "vertices", NULL };
-  PyObject *vobj = NULL, *list;
-  igraph_matrix_t res;
-  igraph_vs_t vs;
-  igraph_bool_t return_single = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &vobj))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&res, 1, igraph_vcount(&self->g))) {
-    igraph_vs_destroy(&vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_bibcoupling(&self->g, &res, vs)) {
-    igraph_vs_destroy(&vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* TODO: Return a single list instead of a matrix if only one vertex was given */
-  list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-
-  igraph_matrix_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the biconnected components of a graph.
- * \return the list of spanning trees of biconnected components in a PyObject
- * \sa igraph_biconnected_components
- */
-PyObject *igraphmodule_Graph_biconnected_components(igraphmodule_GraphObject *self,
-	PyObject *args, PyObject *kwds) {
-  igraph_vector_ptr_t components;
-  igraph_vector_t points;
-  igraph_bool_t return_articulation_points;
-  igraph_integer_t no;
-  PyObject *result, *aps=Py_False;
-
-  static char* kwlist[] = {"return_articulation_points", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &aps)) return NULL;
-  return_articulation_points = PyObject_IsTrue(aps);
-
-  if (igraph_vector_ptr_init(&components, 0)) {
-	igraphmodule_handle_igraph_error();
-	return NULL;
-  }
-  if (return_articulation_points) {
-	if (igraph_vector_init(&points, 0)) {
-	  igraphmodule_handle_igraph_error();
-	  igraph_vector_ptr_destroy(&components);
-	  return NULL;
-	}
-  }
-
-  if (igraph_biconnected_components(&self->g, &no, &components, 0, 0, return_articulation_points ? &points : 0)) {
-    igraphmodule_handle_igraph_error();
-	igraph_vector_ptr_destroy(&components);
-    if (return_articulation_points) igraph_vector_destroy(&points);
-    return NULL;
-  }
-
-  result = igraphmodule_vector_ptr_t_to_PyList(&components, IGRAPHMODULE_TYPE_INT);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&components, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&components);
-
-  if (return_articulation_points) {
-	PyObject *result2;
-	igraph_vector_sort(&points);
-	result2 = igraphmodule_vector_t_to_PyList(&points, IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&points);
-	return Py_BuildValue("NN", result, result2); /* references stolen */
-  }
-  
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the one-mode projections of a bipartite graph
- * \return the two projections as new igraph objects
- * \sa igraph_bipartite_projection
- */
-PyObject *igraphmodule_Graph_bipartite_projection(igraphmodule_GraphObject * self,
-		PyObject* args, PyObject* kwds) {
-  PyObject *types_o = Py_None, *multiplicity_o = Py_True, *mul1 = 0, *mul2 = 0;
-  igraphmodule_GraphObject *result1, *result2;
-  igraph_vector_bool_t* types = 0;
-  igraph_vector_t multiplicities[2];
-  igraph_t g1, g2;
-  long int probe1 = -1;
-
-  static char* kwlist[] = {"types", "multiplicity", "probe1", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|Ol", kwlist, &types_o, &multiplicity_o, &probe1))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX))
-	return NULL;
-
-  if (PyObject_IsTrue(multiplicity_o)) {
-    if (igraph_vector_init(&multiplicities[0], 0)) {
-      if (types) { igraph_vector_bool_destroy(types); free(types); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (igraph_vector_init(&multiplicities[1], 0)) {
-      igraph_vector_destroy(&multiplicities[0]);
-      if (types) { igraph_vector_bool_destroy(types); free(types); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (igraph_bipartite_projection(&self->g, types, &g1, &g2,
-        &multiplicities[0], &multiplicities[1], (igraph_integer_t) probe1)) {
-      igraph_vector_destroy(&multiplicities[0]);
-      igraph_vector_destroy(&multiplicities[1]);
-      if (types) { igraph_vector_bool_destroy(types); free(types); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-    if (igraph_bipartite_projection(&self->g, types, &g1, &g2, 0, 0,
-          (igraph_integer_t) probe1)) {
-      if (types) { igraph_vector_bool_destroy(types); free(types); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  if (types) { igraph_vector_bool_destroy(types); free(types); }
-
-  CREATE_GRAPH(result1, g1);
-  CREATE_GRAPH(result2, g2);
-
-  if (PyObject_IsTrue(multiplicity_o)) {
-    mul1 = igraphmodule_vector_t_to_PyList(&multiplicities[0], IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&multiplicities[0]);
-    if (mul1 == NULL) {
-      igraph_vector_destroy(&multiplicities[1]);
-      return NULL;
-    }
-    mul2 = igraphmodule_vector_t_to_PyList(&multiplicities[1], IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&multiplicities[1]);
-    if (mul2 == NULL)
-      return NULL;
-    return Py_BuildValue("NNNN", result1, result2, mul1, mul2);
-  } else {
-    return Py_BuildValue("NN", result1, result2);
-  }
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the sizes of the two one-mode projections of a bipartite graph
- * \return the two one-mode projections as new igraph objects
- * \sa igraph_bipartite_projection_size
- */
-PyObject *igraphmodule_Graph_bipartite_projection_size(igraphmodule_GraphObject * self,
-		PyObject* args, PyObject* kwds) {
-  PyObject *types_o = Py_None;
-  igraph_vector_bool_t* types = 0;
-  igraph_integer_t vcount1, vcount2, ecount1, ecount2;
-
-  static char* kwlist[] = {"types", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &types_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX))
-	return NULL;
-
-  if (igraph_bipartite_projection_size(&self->g, types,
-			  &vcount1, &ecount1, &vcount2, &ecount2)) {
-    if (types) { igraph_vector_bool_destroy(types); free(types); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (types) { igraph_vector_bool_destroy(types); free(types); }
-
-  return Py_BuildValue("llll", (long)vcount1, (long)ecount1, (long)vcount2, (long)ecount2);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the closeness centrality of some vertices in a graph.
- * \return the closeness centralities as a list (or a single float)
- * \sa igraph_betweenness
- */
-PyObject *igraphmodule_Graph_closeness(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "vertices", "mode", "cutoff", "weights", NULL };
-  PyObject *vobj = Py_None, *list = NULL, *cutoff = Py_None,
-           *mode_o = Py_None, *weights_o = Py_None;
-  igraph_vector_t res, *weights = 0;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  int return_single = 0;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist, &vobj,
-      &mode_o, &cutoff, &weights_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (cutoff == Py_None) {
-    if (igraph_closeness(&self->g, &res, vs, mode, weights)) {
-      igraph_vs_destroy(&vs);
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else if (PyNumber_Check(cutoff)) {
-    PyObject *cutoff_num = PyNumber_Int(cutoff);
-    if (cutoff_num == NULL) {
-      igraph_vs_destroy(&vs); igraph_vector_destroy(&res);
-      return NULL;
-    }
-    if (igraph_closeness_estimate(&self->g, &res, vs, mode,
-        (igraph_integer_t)PyInt_AsLong(cutoff_num), weights)) {
-      igraph_vs_destroy(&vs);
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      igraphmodule_handle_igraph_error();
-      Py_DECREF(cutoff_num);
-      return NULL;
-    }
-    Py_DECREF(cutoff_num);
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(res)[0]);
-
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the (weakly or strongly) connected components in a graph.
- * \return a list containing the cluster ID for every vertex in the graph
- * \sa igraph_clusters
- */
-PyObject *igraphmodule_Graph_clusters(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", NULL };
-  igraph_connectedness_t mode = IGRAPH_STRONG;
-  igraph_vector_t res1, res2;
-  igraph_integer_t no;
-  PyObject *list, *mode_o = Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_connectedness_t(mode_o, &mode)) return NULL;
-
-  if (mode != IGRAPH_STRONG && mode != IGRAPH_WEAK) {
-    PyErr_SetString(PyExc_ValueError, "mode must be either STRONG or WEAK");
-    return NULL;
-  }
-
-  igraph_vector_init(&res1, igraph_vcount(&self->g));
-  igraph_vector_init(&res2, 10);
-
-  if (igraph_clusters(&self->g, &res1, &res2, &no, mode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&res1);
-    igraph_vector_destroy(&res2);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&res1, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res1);
-  igraph_vector_destroy(&res2);
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates Burt's constraint scores for a given graph
- * \sa igraph_constraint
- */
-PyObject *igraphmodule_Graph_constraint(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "vertices", "weights", NULL };
-  PyObject *vids_obj = Py_None, *weight_obj = Py_None, *list;
-  igraph_vector_t result, weights;
-  igraph_vs_t vids;
-  igraph_bool_t return_single = 0;
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|OO", kwlist, &vids_obj, &weight_obj))
-    return NULL;
-
-  if (igraph_vector_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_attribute_values(weight_obj, &weights,
-                                                self, ATTRHASH_IDX_EDGE,
-                                                1.0)) {
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_vs_t(vids_obj, &vids, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    igraph_vector_destroy(&weights);
-    return NULL;
-  }
-
-  if (igraph_constraint(&self->g, &result, vids, &weights)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vids);
-    igraph_vector_destroy(&result);
-    igraph_vector_destroy(&weights);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vs_destroy(&vids);
-  igraph_vector_destroy(&result);
-  igraph_vector_destroy(&weights);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the cocitation scores of some vertices in a graph.
- * \return the cocitation scores in a matrix
- * \sa igraph_cocitation
- */
-PyObject *igraphmodule_Graph_cocitation(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "vertices", NULL };
-  PyObject *vobj = NULL, *list = NULL;
-  igraph_matrix_t res;
-  int return_single = 0;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &vobj))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&res, 1, igraph_vcount(&self->g))) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_cocitation(&self->g, &res, vs)) {
-    igraph_matrix_destroy(&res);
-    igraph_vs_destroy(&vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* TODO: Return a single list instead of a matrix if only one vertex was given */
-  list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-
-  igraph_matrix_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Replaces multiple vertices with a single one.
- * \return None.
- * \sa igraph_contract_vertices
- */
-PyObject *igraphmodule_Graph_contract_vertices(igraphmodule_GraphObject * self,
-	                                           PyObject * args, PyObject * kwds) {
-  static char* kwlist[] = {"mapping", "combine_attrs", NULL };
-  PyObject *mapping_o, *combination_o = Py_None;
-  igraph_vector_t mapping;
-  igraph_attribute_combination_t combination;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &mapping_o,
-		&combination_o))
-	return NULL;
-
-  if (igraphmodule_PyObject_to_attribute_combination_t(
-		combination_o, &combination))
-	return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(mapping_o, &mapping, 1, 0)) {
-    igraph_attribute_combination_destroy(&combination);
-    return NULL;
-  }
-
-  if (igraph_contract_vertices(&self->g, &mapping, &combination)) {
-    igraph_attribute_combination_destroy(&combination);
-    igraph_vector_destroy(&mapping);
-    return NULL;
-  }
-
-  igraph_attribute_combination_destroy(&combination);
-  igraph_vector_destroy(&mapping);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Decomposes a graph into components.
- * \return a list of graph objects, each containing a copy of a component in the original graph.
- * \sa igraph_components
- */
-PyObject *igraphmodule_Graph_decompose(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "mode", "maxcompno", "minelements", NULL };
-  igraph_connectedness_t mode = IGRAPH_STRONG;
-  PyObject *list;
-  igraphmodule_GraphObject *o;
-  long maxcompno = -1, minelements = -1, n, i;
-  igraph_vector_ptr_t components;
-  igraph_t *g;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lll", kwlist, &mode,
-                                   &maxcompno, &minelements))
-    return NULL;
-
-  if (mode != IGRAPH_STRONG && mode != IGRAPH_WEAK) {
-    PyErr_SetString(PyExc_ValueError, "mode must be either STRONG or WEAK");
-    return NULL;
-  }
-
-  igraph_vector_ptr_init(&components, 3);
-  if (igraph_decompose(&self->g, &components, mode, maxcompno, minelements)) {
-    igraph_vector_ptr_destroy(&components);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* We have to create a Python igraph object for every graph returned */
-  n = igraph_vector_ptr_size(&components);
-  list = PyList_New(n);
-  for (i = 0; i < n; i++) {
-    g = (igraph_t *) VECTOR(components)[i];
-    CREATE_GRAPH(o, *g);
-    PyList_SET_ITEM(list, i, (PyObject *) o);
-    /* reference has been transferred by PyList_SET_ITEM, no need to DECREF
-     *
-     * we mustn't call igraph_destroy here, because it would free the vertices
-     * and the edges as well, but we need them in o->g. So just call free */
-    free(g);
-  }
-
-  igraph_vector_ptr_destroy(&components);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the eccentricities of some vertices in a graph.
- * \return the eccentricities as a list (or a single float)
- * \sa igraph_eccentricity
- */
-PyObject *igraphmodule_Graph_eccentricity(igraphmodule_GraphObject* self,
-                                          PyObject* args, PyObject* kwds) {
-  static char *kwlist[] = { "vertices", "mode", NULL };
-  PyObject *vobj = Py_None, *list = NULL, *mode_o = Py_None;
-  igraph_vector_t res;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  int return_single = 0;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &vobj, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_eccentricity(&self->g, &res, vs, mode)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&res);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(res)[0]);
-
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the edge betweennesses in the graph
- * \return a list containing the edge betweenness for every edge
- * \sa igraph_edge_betweenness
- */
-PyObject *igraphmodule_Graph_edge_betweenness(igraphmodule_GraphObject * self,
-                                              PyObject * args,
-                                              PyObject * kwds)
-{
-  static char *kwlist[] = { "directed", "cutoff", "weights", NULL };
-  igraph_vector_t res, *weights = 0;
-  PyObject *list, *directed = Py_True, *cutoff = Py_None;
-  PyObject *weights_o = Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-                                   &directed, &cutoff, &weights_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  igraph_vector_init(&res, igraph_ecount(&self->g));
-
-  if (cutoff == Py_None) {
-    if (igraph_edge_betweenness(&self->g, &res, PyObject_IsTrue(directed), weights)) {
-      igraphmodule_handle_igraph_error();
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      igraph_vector_destroy(&res);
-      return NULL;
-    }
-  } else if (PyNumber_Check(cutoff)) {
-    PyObject *cutoff_num = PyNumber_Int(cutoff);
-    if (!cutoff_num) {
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      igraph_vector_destroy(&res); return NULL;
-    }
-    if (igraph_edge_betweenness_estimate(&self->g, &res, PyObject_IsTrue(directed),
-        (igraph_integer_t)PyInt_AsLong(cutoff_num), weights)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&res);
-      if (weights) { igraph_vector_destroy(weights); free(weights); }
-      Py_DECREF(cutoff_num);
-      return NULL;
-    }
-    Py_DECREF(cutoff_num);
-  } else {
-    PyErr_SetString(PyExc_TypeError, "cutoff value must be None or integer");
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&res);
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the edge connectivity of the graph
- * \return the edge connectivity
- * \sa igraph_edge_connectivity, igraph_st_edge_connectivity
- */
-PyObject *igraphmodule_Graph_edge_connectivity(igraphmodule_GraphObject *self,
-        PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "source", "target", "checks", NULL };
-  PyObject *checks = Py_True;
-  long int source = -1, target = -1, result;
-  igraph_integer_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|llO", kwlist,
-      &source, &target, &checks))
-    return NULL;
-
-  if (source < 0 && target < 0) {
-    if (igraph_edge_connectivity(&self->g, &res, PyObject_IsTrue(checks))) {
-      igraphmodule_handle_igraph_error();
-	  return NULL;
-    }
-  } else if (source >= 0 && target >= 0) {
-    if (igraph_st_edge_connectivity(&self->g, &res, (igraph_integer_t) source,
-          (igraph_integer_t) target)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-	PyErr_SetString(PyExc_ValueError, "if source or target is given, the other one must also be specified");
-	return NULL;
-  }
-
-  result = res;
-
-  return Py_BuildValue("l", result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the eigenvector centralities of the vertices in the graph
- * \sa igraph_eigenvector_centrality
- */
-PyObject *igraphmodule_Graph_eigenvector_centrality(
-  igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] =
-    { "directed", "scale", "weights", "arpack_options", "return_eigenvalue",
-      NULL };
-  PyObject *directed_o = Py_True;
-  PyObject *scale_o = Py_True;
-  PyObject *weights_o = Py_None;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  PyObject *return_eigenvalue = Py_False;
-  PyObject *res_o;
-  igraph_real_t value;
-  igraph_vector_t *weights=0, res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO!O", kwlist,
-                                   &directed_o, &scale_o, &weights_o,
-                                   &igraphmodule_ARPACKOptionsType,
-                                   &arpack_options, &return_eigenvalue))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (igraph_vector_init(&res, 0)) {
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return igraphmodule_handle_igraph_error();
-  }
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (igraph_eigenvector_centrality(&self->g, &res, &value,
-      PyObject_IsTrue(directed_o), PyObject_IsTrue(scale_o),
-      weights, igraphmodule_ARPACKOptions_get(arpack_options))) {
-    igraphmodule_handle_igraph_error();
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-  
-  res_o = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT); 
-  igraph_vector_destroy(&res);
-  if (res_o == NULL) return igraphmodule_handle_igraph_error();
-
-  if (PyObject_IsTrue(return_eigenvalue)) {
-    PyObject *ev_o = PyFloat_FromDouble((double)value);
-    if (ev_o == NULL) {
-      Py_DECREF(res_o);
-      return igraphmodule_handle_igraph_error();
-    }
-    return Py_BuildValue("NN", res_o, ev_o);
-  }
-
-  return res_o;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates a feedback arc set for a graph
- * \return a list containing the indices in the chosen feedback arc set
- * \sa igraph_feedback_arc_set
- */
-PyObject *igraphmodule_Graph_feedback_arc_set(
-    igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "weights", "method", NULL };
-  igraph_vector_t* weights = 0;
-  igraph_vector_t result;
-  igraph_fas_algorithm_t algo = IGRAPH_FAS_APPROX_EADES;
-  PyObject *weights_o = Py_None, *result_o = NULL, *algo_o = NULL;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &weights_o, &algo_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_fas_algorithm_t(algo_o, &algo))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE))
-    return NULL;
-
-  if (igraph_vector_init(&result, 0)) {
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-  }
-
-  if (igraph_feedback_arc_set(&self->g, &result, weights, algo)) {
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  result_o = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return result_o;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Calculates the shortest paths from/to a given node in the graph
- * \return a list containing shortest paths from/to the given node
- * \sa igraph_get_shortest_paths
- */
-PyObject *igraphmodule_Graph_get_shortest_paths(igraphmodule_GraphObject *
-                                                self, PyObject * args,
-                                                PyObject * kwds)
-{
-  static char *kwlist[] = { "v", "to", "weights", "mode", "output", NULL };
-  igraph_vector_t *res, *weights=0;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  long int i, j;
-  igraph_integer_t from, no_of_target_nodes;
-  igraph_vs_t to;
-  PyObject *list, *item, *mode_o=Py_None, *weights_o=Py_None,
-           *output_o=Py_None, *from_o = Py_None, *to_o=Py_None;
-  igraph_vector_ptr_t *ptrvec=0;
-  igraph_bool_t use_edges = 0;
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OOOO!", kwlist, &from_o,
-        &to_o, &weights_o, &mode_o, &PyString_Type, &output_o))
-    return NULL;
-
-  if (output_o == 0 || output_o == Py_None ||
-      PyString_IsEqualToASCIIString(output_o, "vpath")) {
-    use_edges = 0;
-  } else if (PyString_IsEqualToASCIIString(output_o, "epath")) {
-    use_edges = 1;
-  } else {
-    PyErr_SetString(PyExc_ValueError, "output argument must be \"vpath\" or \"epath\"");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_vid(from_o, &from, &self->g))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-  
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-      ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(to_o, &to, &self->g, 0, 0)) return NULL;
-
-  if (igraph_vs_size(&self->g, &to, &no_of_target_nodes)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  ptrvec = (igraph_vector_ptr_t *) calloc(1, sizeof(igraph_vector_ptr_t));
-  if (!ptrvec) {
-    PyErr_SetString(PyExc_MemoryError, "");
-	if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (igraph_vector_ptr_init(ptrvec, no_of_target_nodes)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    free(ptrvec);
-	if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  res = (igraph_vector_t *) calloc(no_of_target_nodes, sizeof(igraph_vector_t));
-  if (!res) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    igraph_vector_ptr_destroy(ptrvec); free(ptrvec);
-	if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  for (i = 0; i < no_of_target_nodes; i++) {
-    VECTOR(*ptrvec)[i] = &res[i];
-    igraph_vector_init(&res[i], 0);
-  }
-
-  if (igraph_get_shortest_paths_dijkstra(&self->g, use_edges ? 0 : ptrvec,
-        use_edges ? ptrvec : 0, from, to, weights, mode)) {
-    igraphmodule_handle_igraph_error();
-    for (j = 0; j < no_of_target_nodes; j++) igraph_vector_destroy(&res[j]);
-    free(res);
-	if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_ptr_destroy(ptrvec);
-    free(ptrvec);
-    return NULL;
-  }
-
-  igraph_vector_ptr_destroy(ptrvec);
-  free(ptrvec);
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  list = PyList_New(no_of_target_nodes);
-  if (!list) {
-    for (j = 0; j < no_of_target_nodes; j++) igraph_vector_destroy(&res[j]);
-    free(res);
-    return NULL;
-  }
-
-  for (i = 0; i < no_of_target_nodes; i++) {
-    item = igraphmodule_vector_t_to_PyList(&res[i], IGRAPHMODULE_TYPE_INT);
-    if (!item || PyList_SetItem(list, i, item)) {
-      if (item) {
-        Py_DECREF(item);
-      }
-      Py_DECREF(list);
-      for (j = 0; j < no_of_target_nodes; j++) igraph_vector_destroy(&res[j]);
-      free(res);
-      return NULL;
-    }
-  }
-
-  for (j = 0; j < no_of_target_nodes; j++) igraph_vector_destroy(&res[j]);
-  free(res);
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates all of the shortest paths from/to a given node in the graph
- * \return a list containing shortest paths from/to the given node
- * \sa igraph_get_shortest_paths
- */
-PyObject *igraphmodule_Graph_get_all_shortest_paths(igraphmodule_GraphObject *
-                                                    self, PyObject * args,
-                                                    PyObject * kwds)
-{
-  static char *kwlist[] = { "v", "to", "weights", "mode", NULL };
-  igraph_vector_ptr_t res;
-  igraph_vector_t *weights = 0;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  long int i, j;
-  igraph_integer_t from;
-  igraph_vs_t to;
-  PyObject *list, *item, *from_o, *mode_o=Py_None, *to_o=Py_None, *weights_o=Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OOO", kwlist, &from_o,
-        &to_o, &weights_o, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(from_o, &from, &self->g))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(to_o, &to, &self->g, 0, 0))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-      ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&to);
-    return NULL;
-  }
-
-  if (igraph_vector_ptr_init(&res, 1)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&to);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (igraph_get_all_shortest_paths_dijkstra(&self->g, &res,
-        NULL, from, to, weights, mode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_ptr_destroy(&res);
-    igraph_vs_destroy(&to);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  igraph_vs_destroy(&to);
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&res, igraph_vector_destroy);
-
-  j = igraph_vector_ptr_size(&res);
-  list = PyList_New(j);
-  if (!list) {
-    igraph_vector_ptr_destroy_all(&res);
-    return NULL;
-  }
-
-  for (i = 0; i < j; i++) {
-    item =
-      igraphmodule_vector_t_to_PyList((igraph_vector_t *)
-                                      igraph_vector_ptr_e(&res, i),
-                    IGRAPHMODULE_TYPE_INT);
-    if (!item) {
-      Py_DECREF(list);
-      igraph_vector_ptr_destroy_all(&res);
-      return NULL;
-    }
-    if (PyList_SetItem(list, i, item)) {
-      Py_DECREF(list);
-      Py_DECREF(item);
-      igraph_vector_ptr_destroy_all(&res);
-      return NULL;
-    }
-  }
-
-  igraph_vector_ptr_destroy_all(&res);
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates Kleinberg's hub scores of the vertices in the graph
- * \sa igraph_hub_score
- */
-PyObject *igraphmodule_Graph_hub_score(
-  igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] =
-    { "weights", "scale", "arpack_options", "return_eigenvalue", NULL };
-  PyObject *scale_o = Py_True, *weights_o = Py_None;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  PyObject *return_eigenvalue = Py_False;
-  PyObject *res_o;
-  igraph_real_t value;
-  igraph_vector_t res, *weights = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO!O", kwlist, &weights_o,
-                                   &scale_o, &igraphmodule_ARPACKOptionsType,
-                                   &arpack_options, &return_eigenvalue))
-    return NULL;
-
-  if (igraph_vector_init(&res, 0)) return igraphmodule_handle_igraph_error();
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (igraph_hub_score(&self->g, &res, &value, PyObject_IsTrue(scale_o),
-      weights, igraphmodule_ARPACKOptions_get(arpack_options))) {
-    igraphmodule_handle_igraph_error();
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  res_o = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT); 
-  igraph_vector_destroy(&res);
-  if (res_o == NULL) return igraphmodule_handle_igraph_error();
-
-  if (PyObject_IsTrue(return_eigenvalue)) {
-    PyObject *ev_o = PyFloat_FromDouble((double)value);
-    if (ev_o == NULL) {
-      Py_DECREF(res_o);
-      return igraphmodule_handle_igraph_error();
-    }
-    return Py_BuildValue("NN", res_o, ev_o);
-  }
-
-  return res_o;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Returns the line graph of the graph
- * \return the line graph as a new igraph object
- * \sa igraph_linegraph
- */
-PyObject *igraphmodule_Graph_linegraph(igraphmodule_GraphObject * self) {
-  igraph_t lg;
-  igraphmodule_GraphObject *result;
-
-  if (igraph_linegraph(&self->g, &lg)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  CREATE_GRAPH(result, lg);
-
-  return (PyObject *) result;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Returns the k-neighborhood of some vertices in the
- *   graph.
- * \sa igraph_neighborhood
- */
-PyObject *igraphmodule_Graph_neighborhood(igraphmodule_GraphObject *self,
-    PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "vertices", "order", "mode", NULL };
-  PyObject *vobj = Py_None;
-  PyObject *mode_o = 0;
-  PyObject *result;
-  long int order = 1;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  igraph_bool_t return_single = 0;
-  igraph_vs_t vs;
-  igraph_vector_ptr_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OlO", kwlist,
-        &vobj, &order, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_ptr_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_neighborhood(&self->g, &res, vs, (igraph_integer_t) order, mode)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vs_destroy(&vs);
-
-  if (!return_single)
-    result = igraphmodule_vector_ptr_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  else
-    result = igraphmodule_vector_t_to_PyList((igraph_vector_t*)VECTOR(res)[0],
-        IGRAPHMODULE_TYPE_INT);
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&res, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&res);
-
-  return result;
-}
-
-/**
- * \ingroup python_interface_graph
- * \brief Returns the size of the k-neighborhood of some vertices in the
- *   graph.
- * \sa igraph_neighborhood_size
- */
-PyObject *igraphmodule_Graph_neighborhood_size(igraphmodule_GraphObject *self,
-    PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "vertices", "order", "mode", NULL };
-  PyObject *vobj = Py_None;
-  PyObject *mode_o = 0;
-  PyObject *result;
-  long int order = 1;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  igraph_bool_t return_single = 0;
-  igraph_vs_t vs;
-  igraph_vector_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OlO", kwlist,
-        &vobj, &order, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_neighborhood_size(&self->g, &res, vs, (igraph_integer_t) order, mode)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vs_destroy(&vs);
-
-  if (!return_single)
-    result = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  else
-    result = PyInt_FromLong((long)VECTOR(res)[0]);
-
-  igraph_vector_destroy(&res);
-
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the Google personalized PageRank value of some vertices in the graph.
- * \return the personalized PageRank values
- * \sa igraph_personalized_pagerank
- */
-PyObject *igraphmodule_Graph_personalized_pagerank(igraphmodule_GraphObject *self,
-                                      PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] =
-    { "vertices", "directed", "damping", "reset", "reset_vertices", "weights",
-      "arpack_options", NULL };
-  PyObject *directed = Py_True;
-  PyObject *vobj = Py_None, *wobj = Py_None, *robj = Py_None, *rvsobj = Py_None;
-  PyObject *list;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  double damping = 0.85;
-  igraph_vector_t res;
-  igraph_vector_t *reset = 0;
-  igraph_vector_t weights;
-  igraph_bool_t return_single = 0;
-  igraph_vs_t vs, reset_vs;
-  int retval;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOdOOOO!", kwlist, &vobj,
-                                   &directed, &damping, &robj, &rvsobj, &wobj,
-                                   &igraphmodule_ARPACKOptionsType,
-                                   &arpack_options_o))
-    return NULL;
-
-  if (robj != Py_None && rvsobj != Py_None) {
-    PyErr_SetString(PyExc_ValueError, "only reset or reset_vs can be defined, not both");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (robj != Py_None) {
-    if (igraphmodule_attrib_to_vector_t(robj, self, &reset, ATTRIBUTE_TYPE_VERTEX)) {
-      igraph_vs_destroy(&vs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else if (rvsobj != Py_None) {
-    if (igraphmodule_PyObject_to_vs_t(rvsobj, &reset_vs, &self->g, 0, 0)) {
-      igraph_vs_destroy(&vs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  if (igraphmodule_PyObject_to_attribute_values(wobj, &weights,
-                                                self, ATTRHASH_IDX_EDGE,
-                                                1.0)) {
-    igraph_vs_destroy(&vs);
-    if (rvsobj != Py_None) igraph_vs_destroy(&reset_vs);
-    if (reset) { igraph_vector_destroy(reset); free(reset); }
-    return NULL;
-  }
-
-  if (igraph_vector_init(&res, 0)) {
-    igraph_vs_destroy(&vs);
-    if (rvsobj != Py_None) igraph_vs_destroy(&reset_vs);
-    if (reset) { igraph_vector_destroy(reset); free(reset); }
-    igraph_vector_destroy(&weights);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (rvsobj != Py_None)
-    retval = igraph_personalized_pagerank_vs(&self->g, &res, 0, vs, PyObject_IsTrue(directed),
-        damping, reset_vs, &weights, igraphmodule_ARPACKOptions_get(arpack_options));
-  else
-    retval = igraph_personalized_pagerank(&self->g, &res, 0, vs, PyObject_IsTrue(directed),
-        damping, reset, &weights, igraphmodule_ARPACKOptions_get(arpack_options));
-
-  if (retval) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    if (rvsobj != Py_None) igraph_vs_destroy(&reset_vs);
-    if (reset) { igraph_vector_destroy(reset); free(reset); }
-    igraph_vector_destroy(&weights);
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(res)[0]);
-
-  igraph_vector_destroy(&res);
-  igraph_vs_destroy(&vs);
-  if (rvsobj != Py_None) igraph_vs_destroy(&reset_vs);
-  igraph_vector_destroy(&weights);
-  if (reset) { igraph_vector_destroy(reset); free(reset); }
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the path length histogram of the graph
- * \sa igraph_path_length_hist
- */
-PyObject *igraphmodule_Graph_path_length_hist(igraphmodule_GraphObject *self,
-                                              PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "directed", NULL };
-  PyObject *directed = Py_True, *result;
-  igraph_real_t unconn;
-  igraph_vector_t res;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &directed))
-	return NULL;
-
-  if (igraph_vector_init(&res, 0))
-	return igraphmodule_handle_igraph_error();
-
-  if (igraph_path_length_hist(&self->g, &res, &unconn, PyObject_IsTrue(directed))) {
-	igraph_vector_destroy(&res);
-	return igraphmodule_handle_igraph_error();
-  }
-  
-  result=igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-  return Py_BuildValue("Nd", result, (double)unconn);
-}
-
-/** \ingroup python_interface_graph
- * \brief Permutes the vertices of the graph 
- * \return the new graph as a new igraph object
- * \sa igraph_permute_vertices
- */
-PyObject *igraphmodule_Graph_permute_vertices(igraphmodule_GraphObject *self,
-                                              PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "permutation", NULL };
-  igraph_t pg;
-  igraph_vector_t perm;
-  igraphmodule_GraphObject *result;
-  PyObject *list;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!", kwlist, &PyList_Type, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(list, &perm, 1, 0)) return NULL;
-
-  if (igraph_permute_vertices(&self->g, &pg, &perm)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&perm);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&perm);
-
-  CREATE_GRAPH(result, pg);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Rewires a graph while preserving degree distribution
- * \return the rewired graph
- * \sa igraph_rewire
- */
-PyObject *igraphmodule_Graph_rewire(igraphmodule_GraphObject * self,
-                                    PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "n", "mode", NULL };
-  long int n = 1000;
-  PyObject *mode_o = Py_None;
-  igraph_rewiring_t mode = IGRAPH_REWIRING_SIMPLE;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lO", kwlist, &n, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_rewiring_t(mode_o, &mode))
-    return NULL;
-
-  if (igraph_rewire(&self->g, (igraph_integer_t) n, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Rewires the edges of a graph wth constant probability
- * \return the rewired graph
- * \sa igraph_rewire_edges
- */
-PyObject *igraphmodule_Graph_rewire_edges(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "prob", "loops", "multiple", NULL };
-  double prob;
-  PyObject *loops_o = Py_False, *multiple_o = Py_False;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "d|OO", kwlist,
-        &prob, &loops_o, &multiple_o))
-    return NULL;
-
-  if (igraph_rewire_edges(&self->g, prob, PyObject_IsTrue(loops_o),
-        PyObject_IsTrue(multiple_o))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates shortest paths in a graph.
- * \return the shortest path lengths for the given vertices
- * \sa igraph_shortest_paths, igraph_shortest_paths_dijkstra,
- *     igraph_shortest_paths_bellman_ford, igraph_shortest_paths_johnson
- */
-PyObject *igraphmodule_Graph_shortest_paths(igraphmodule_GraphObject * self,
-                                            PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", "weights", "mode", NULL };
-  PyObject *from_o = NULL, *to_o = NULL, *mode_o = NULL, *weights_o = Py_None;
-  PyObject *list = NULL;
-  igraph_matrix_t res;
-  igraph_vector_t *weights=0;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  int return_single_from = 0, return_single_to = 0, e = 0;
-  igraph_vs_t from_vs, to_vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist,
-        &from_o, &to_o, &weights_o, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return 0;
-  if (igraphmodule_PyObject_to_vs_t(from_o, &from_vs, &self->g, &return_single_from, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_PyObject_to_vs_t(to_o, &to_vs, &self->g, &return_single_to, 0)) {
-    igraph_vs_destroy(&from_vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-      ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&from_vs);
-    igraph_vs_destroy(&to_vs);
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&res, 1, igraph_vcount(&self->g))) {
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vs_destroy(&from_vs);
-    igraph_vs_destroy(&to_vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  /* Select the most suitable algorithm */
-  if (weights) {
-    if (igraph_vector_min(weights) > 0) {
-      /* Only positive weights, use Dijkstra's algorithm */
-      e = igraph_shortest_paths_dijkstra(&self->g, &res, from_vs, to_vs, weights, mode);
-    } else {
-      /* There are negative weights. For a small number of sources, use Bellman-Ford.
-       * Otherwise, use Johnson's algorithm */
-      igraph_integer_t vs_size;
-      e = igraph_vs_size(&self->g, &from_vs, &vs_size);
-      if (!e) {
-        if (vs_size <= 100 || mode != IGRAPH_OUT) {
-          e = igraph_shortest_paths_bellman_ford(&self->g, &res, from_vs, to_vs, weights, mode);
-        } else {
-          e = igraph_shortest_paths_johnson(&self->g, &res, from_vs, to_vs, weights);
-        }
-      }
-    }
-  } else {
-    /* No weights, use a simple BFS */
-    e = igraph_shortest_paths(&self->g, &res, from_vs, to_vs, mode);
-  }
-
-  if (e) {
-    if (weights) igraph_vector_destroy(weights);
-    igraph_matrix_destroy(&res);
-    igraph_vs_destroy(&from_vs);
-    igraph_vs_destroy(&to_vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (weights) {
-    igraph_vector_destroy(weights);
-    list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-  } else {
-    list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-
-  igraph_matrix_destroy(&res);
-  igraph_vs_destroy(&from_vs);
-  igraph_vs_destroy(&to_vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the Jaccard similarities of some vertices in a graph.
- * \return the similarity scores in a matrix
- * \sa igraph_similarity_jaccard
- */
-PyObject *igraphmodule_Graph_similarity_jaccard(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds) {
-  static char *kwlist[] = { "vertices", "pairs", "mode", "loops", NULL };
-  PyObject *vertices_o = Py_None, *pairs_o = Py_None;
-  PyObject *list = NULL, *loops = Py_True, *mode_o = Py_None;
-  igraph_neimode_t mode = IGRAPH_ALL;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist, &vertices_o,
-        &pairs_o, &mode_o, &loops))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (vertices_o != Py_None && pairs_o != Py_None) {
-    PyErr_SetString(PyExc_ValueError, "at most one of `vertices` and `pairs` "
-        "must be given");
-    return NULL;
-  }
-
-  if (pairs_o == Py_None) {
-    /* Case #1: vertices, returning matrix */
-    igraph_matrix_t res;
-    igraph_vs_t vs;
-    int return_single = 0;
-
-    if (igraphmodule_PyObject_to_vs_t(vertices_o, &vs, &self->g, &return_single, 0))
-      return NULL;
-
-    if (igraph_matrix_init(&res, 0, 0)) {
-      igraph_vs_destroy(&vs);
-      return igraphmodule_handle_igraph_error();
-    }
-
-    if (igraph_similarity_jaccard(&self->g, &res, vs, mode, PyObject_IsTrue(loops))) {
-      igraph_matrix_destroy(&res);
-      igraph_vs_destroy(&vs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vs_destroy(&vs);
-
-    list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-    igraph_matrix_destroy(&res);
-  } else {
-    /* Case #2: vertex pairs or edges, returning list */
-    igraph_vector_t edges;
-    igraph_vector_t res;
-
-    if (igraphmodule_PyObject_to_vector_t(pairs_o, &edges, 1, 1))
-      return NULL;
-
-    if (igraph_vector_init(&res, igraph_vector_size(&edges) / 2)) {
-      igraph_vector_destroy(&edges);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (igraph_similarity_jaccard_pairs(&self->g, &res, &edges, mode,
-          PyObject_IsTrue(loops))) {
-      igraph_vector_destroy(&res);
-      igraph_vector_destroy(&edges);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vector_destroy(&edges);
-
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-    igraph_vector_destroy(&res);
-  }
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the Dice similarities of some vertices in a graph.
- * \return the similarity scores in a matrix
- * \sa igraph_similarity_dice
- */
-PyObject *igraphmodule_Graph_similarity_dice(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds) {
-  static char *kwlist[] = { "vertices", "pairs", "mode", "loops", NULL };
-  PyObject *vertices_o = Py_None, *pairs_o = Py_None;
-  PyObject *list = NULL, *loops = Py_True, *mode_o = Py_None;
-  igraph_neimode_t mode = IGRAPH_ALL;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOO", kwlist, &vertices_o,
-        &pairs_o, &mode_o, &loops))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (vertices_o != Py_None && pairs_o != Py_None) {
-    PyErr_SetString(PyExc_ValueError, "at most one of `vertices` and `pairs` "
-        "must be given");
-    return NULL;
-  }
-
-  if (pairs_o == Py_None) {
-    /* Case #1: vertices, returning matrix */
-    igraph_matrix_t res;
-    igraph_vs_t vs;
-    int return_single = 0;
-
-    if (igraphmodule_PyObject_to_vs_t(vertices_o, &vs, &self->g, &return_single, 0))
-      return NULL;
-
-    if (igraph_matrix_init(&res, 0, 0)) {
-      igraph_vs_destroy(&vs);
-      return igraphmodule_handle_igraph_error();
-    }
-
-    if (igraph_similarity_dice(&self->g, &res, vs, mode, PyObject_IsTrue(loops))) {
-      igraph_matrix_destroy(&res);
-      igraph_vs_destroy(&vs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vs_destroy(&vs);
-
-    list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-    igraph_matrix_destroy(&res);
-  } else {
-    /* Case #2: vertex pairs or edges, returning list */
-    igraph_vector_t edges;
-    igraph_vector_t res;
-
-    if (igraphmodule_PyObject_to_vector_t(pairs_o, &edges, 1, 1))
-      return NULL;
-
-    if (igraph_vector_init(&res, igraph_vector_size(&edges) / 2)) {
-      igraph_vector_destroy(&edges);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (igraph_similarity_dice_pairs(&self->g, &res, &edges, mode,
-          PyObject_IsTrue(loops))) {
-      igraph_vector_destroy(&res);
-      igraph_vector_destroy(&edges);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vector_destroy(&edges);
-
-    list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-    igraph_vector_destroy(&res);
-  }
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the inverse log-weighted similarities of some vertices in
- * a graph.
- * \return the similarity scores in a matrix
- * \sa igraph_similarity_inverse_log_weighted
- */
-PyObject *igraphmodule_Graph_similarity_inverse_log_weighted(
-  igraphmodule_GraphObject * self, PyObject * args, PyObject * kwds) {
-  static char *kwlist[] = { "vertices", "mode", NULL };
-  PyObject *vobj = NULL, *list = NULL, *mode_o = Py_None;
-  igraph_matrix_t res;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  int return_single = 0;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &vobj, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) return NULL; 
-
-  if (igraph_matrix_init(&res, 0, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_similarity_inverse_log_weighted(&self->g,&res,vs,mode)) {
-    igraph_matrix_destroy(&res);
-    igraph_vs_destroy(&vs);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  list = igraphmodule_matrix_t_to_PyList(&res, IGRAPHMODULE_TYPE_FLOAT);
-
-  igraph_matrix_destroy(&res);
-  igraph_vs_destroy(&vs);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates a spanning tree for a graph
- * \return the spanning tree or a list of edges participating in the spanning tree
- * \sa igraph_minimum_spanning_tree_unweighted
- * \sa igraph_minimum_spanning_tree_unweighted
- * \sa igraph_minimum_spanning_tree_prim
- */
-PyObject *igraphmodule_Graph_spanning_tree(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "weights", NULL };
-  igraph_vector_t* ws = 0;
-  igraph_vector_t res;
-  PyObject *weights_o = Py_None, *result = NULL;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &weights_o))
-    return NULL;
-
-  if (igraph_vector_init(&res, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &ws, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  if (igraph_minimum_spanning_tree(&self->g, &res, ws)) {
-	if (ws != 0) { igraph_vector_destroy(ws); free(ws); }
-    igraph_vector_destroy(&res);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (ws != 0) { igraph_vector_destroy(ws); free(ws); }
-  result = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Simplifies a graph by removing loops and/or multiple edges
- * \return the simplified graph.
- * \sa igraph_simplify
- */
-PyObject *igraphmodule_Graph_simplify(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "multiple", "loops", "combine_edges", NULL };
-  PyObject *multiple = Py_True, *loops = Py_True, *comb_o = Py_None;
-  igraph_attribute_combination_t comb;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-                                   &multiple, &loops, &comb_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_attribute_combination_t(comb_o, &comb))
-	return NULL;
-
-  if (igraph_simplify(&self->g, PyObject_IsTrue(multiple),
-                      PyObject_IsTrue(loops), &comb)) {
-	igraph_attribute_combination_destroy(&comb);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  igraph_attribute_combination_destroy(&comb);
-  Py_INCREF(self);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the vertex indices within the same component as a given vertex
- * \return the vertex indices in a list
- * \sa igraph_subcomponent
- */
-PyObject *igraphmodule_Graph_subcomponent(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "v", "mode", NULL };
-  igraph_vector_t res;
-  igraph_neimode_t mode = IGRAPH_ALL;
-  igraph_integer_t from;
-  PyObject *list = NULL, *mode_o = Py_None, *from_o = Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &from_o, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(from_o, &from, &self->g))
-    return NULL;
-
-  igraph_vector_init(&res, 0);
-  if (igraph_subcomponent(&self->g, &res, from, mode)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&res);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&res, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&res);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns an induced subgraph of the graph based on the given vertices
- * \return the subgraph as a new igraph object
- * \sa igraph_induced_subgraph
- */
-PyObject *igraphmodule_Graph_induced_subgraph(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "vertices", "implementation", NULL };
-  igraph_vs_t vs;
-  igraph_t sg;
-  igraphmodule_GraphObject *result;
-  PyObject *list, *impl_o = Py_None;
-  igraph_subgraph_implementation_t impl = IGRAPH_SUBGRAPH_AUTO;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &list, &impl_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_subgraph_implementation_t(impl_o, &impl))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, 0, 0))
-    return NULL;
-
-  if (igraph_induced_subgraph(&self->g, &sg, vs, impl)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vs);
-
-  CREATE_GRAPH(result, sg);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns a subgraph of the graph based on the given edges
- * \return the subgraph as a new igraph object
- * \sa igraph_subgraph_edges
- */
-PyObject *igraphmodule_Graph_subgraph_edges(igraphmodule_GraphObject * self,
-                                            PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "edges", "delete_vertices", NULL };
-  igraph_es_t es;
-  igraph_t sg;
-  igraphmodule_GraphObject *result;
-  PyObject *list, *delete_vertices = Py_True;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &list, &delete_vertices))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_es_t(list, &es, &self->g, 0))
-    return NULL;
-
-  if (igraph_subgraph_edges(&self->g, &sg, es, PyObject_IsTrue(delete_vertices))) {
-    igraphmodule_handle_igraph_error();
-    igraph_es_destroy(&es);
-    return NULL;
-  }
-
-  CREATE_GRAPH(result, sg);
-
-  igraph_es_destroy(&es);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the graph transitivity (a.k.a. clustering coefficient)
- * \return the clustering coefficient
- * \sa igraph_transitivity_undirected
- */
-PyObject *igraphmodule_Graph_transitivity_undirected(igraphmodule_GraphObject
-                                                     * self, PyObject * args,
-                                                     PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", NULL };
-  igraph_real_t res;
-  PyObject *r, *mode_o = Py_None;
-  igraph_transitivity_mode_t mode = IGRAPH_TRANSITIVITY_NAN;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_transitivity_mode_t(mode_o, &mode))
-    return NULL;
-
-
-  if (igraph_transitivity_undirected(&self->g, &res, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  r = Py_BuildValue("d", (double)(res));
-  return r;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the average of vertex transitivities over the graph
- * \sa igraph_transitivity_avglocal_undirected
- */
-PyObject *igraphmodule_Graph_transitivity_avglocal_undirected(igraphmodule_GraphObject
-                                                              * self, PyObject * args,
-                                                              PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", NULL };
-  igraph_real_t res;
-  PyObject *r, *mode_o = Py_None;
-  igraph_transitivity_mode_t mode = IGRAPH_TRANSITIVITY_NAN;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_transitivity_mode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraph_transitivity_avglocal_undirected(&self->g, &res, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  r = Py_BuildValue("d", (double)(res));
-  return r;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the local transitivity of given vertices
- * \return the transitivities in a list
- * \sa igraph_transitivity_local_undirected
- */
-PyObject
-  *igraphmodule_Graph_transitivity_local_undirected(igraphmodule_GraphObject *
-                                                    self, PyObject * args,
-                                                    PyObject * kwds)
-{
-  static char *kwlist[] = { "vertices", "mode", "weights", NULL };
-  PyObject *vobj = NULL, *mode_o = Py_None, *list = NULL;
-  PyObject *weights_o = Py_None;
-  igraph_vector_t result;
-  igraph_vector_t *weights = 0;
-  igraph_bool_t return_single = 0;
-  igraph_vs_t vs;
-  igraph_transitivity_mode_t mode = IGRAPH_TRANSITIVITY_NAN;
-  int retval;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist, &vobj, &mode_o, &weights_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_transitivity_mode_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(vobj, &vs, &self->g, &return_single, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&result, 0)) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (weights == 0) {
-    retval = igraph_transitivity_local_undirected(&self->g, &result, vs, mode);
-  } else {
-    retval = igraph_transitivity_barrat(&self->g, &result, vs, weights, mode);
-  }
-
-  igraph_vs_destroy(&vs);
-  if (weights) {
-    igraph_vector_destroy(weights); free(weights);
-  }
-
-  if (retval) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  if (!return_single)
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_FLOAT);
-  else
-    list = PyFloat_FromDouble(VECTOR(result)[0]);
-
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates a possible topological sorting
- * \return a possible topological sorting as a list
- * \sa igraph_topological_sorting
- */
-PyObject *igraphmodule_Graph_topological_sorting(igraphmodule_GraphObject *
-                                                 self, PyObject * args,
-                                                 PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", "warnings", NULL };
-  PyObject *list, *mode_o=Py_None;
-  PyObject *warnings_o=Py_True;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  igraph_vector_t result;
-  igraph_warning_handler_t* old_handler = 0;
-  int retval;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &mode_o, &warnings_o))
-    return NULL;
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-
-  if (igraph_vector_init(&result, 0)) 
-    return igraphmodule_handle_igraph_error();
-
-  if (!PyObject_IsTrue(warnings_o)) {
-    /* Turn off the warnings temporarily */
-    old_handler = igraph_set_warning_handler(igraph_warning_handler_ignore);
-  }
-
-  retval = igraph_topological_sorting(&self->g, &result, mode);
-
-  if (!PyObject_IsTrue(warnings_o)) {
-    /* Restore the warning handler */
-    igraph_set_warning_handler(old_handler);
-  }
-
-  if (retval) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the vertex connectivity of the graph
- * \return the vertex connectivity
- * \sa igraph_vertex_connectivity, igraph_st_vertex_connectivity
- */
-PyObject *igraphmodule_Graph_vertex_connectivity(igraphmodule_GraphObject *self,
-        PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "source", "target", "checks", "neighbors", NULL };
-  PyObject *checks = Py_True, *neis = Py_None;
-  long int source = -1, target = -1, result;
-  igraph_integer_t res;
-  igraph_vconn_nei_t neighbors = IGRAPH_VCONN_NEI_ERROR;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|llOO", kwlist,
-      &source, &target, &checks, &neis))
-    return NULL;
-
-  if (source < 0 && target < 0) {
-    if (igraph_vertex_connectivity(&self->g, &res, PyObject_IsTrue(checks))) {
-      igraphmodule_handle_igraph_error();
-	  return NULL;
-    }
-  } else if (source >= 0 && target >= 0) {
-    if (igraphmodule_PyObject_to_vconn_nei_t(neis, &neighbors))
-      return NULL;
-    if (igraph_st_vertex_connectivity(&self->g, &res,
-          (igraph_integer_t) source, (igraph_integer_t) target, neighbors)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-	PyErr_SetString(PyExc_ValueError, "if source or target is given, the other one must also be specified");
-	return NULL;
-  }
-
-  if (!IGRAPH_FINITE(res)) return Py_BuildValue("d", (double)res);
-  
-  result = (long)res;
-  return Py_BuildValue("l", result);
-}
-
-/**********************************************************************
- * Bipartite graphs                                                   *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Checks whether a graph is bipartite
- * \return a boolean or a (boolean, list of booleans) pair
- * \sa igraph_is_bipartite
- */
-PyObject *igraphmodule_Graph_is_bipartite(igraphmodule_GraphObject *self,
-                                          PyObject *args, PyObject *kwds) {
-  PyObject *types_o, *return_types_o = Py_False;
-  igraph_vector_bool_t types;
-  igraph_bool_t return_types = 0, result;
-
-  static char *kwlist[] = { "return_types", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &return_types_o))
-    return NULL;
-  return_types = PyObject_IsTrue(return_types_o);
-
-  if (return_types) {
-    if (igraph_vector_bool_init(&types, igraph_vcount(&self->g))) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (igraph_is_bipartite(&self->g, &result, &types)) {
-      igraph_vector_bool_destroy(&types);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (result) {
-      types_o = igraphmodule_vector_bool_t_to_PyList(&types);
-      if (!types_o) {
-        igraph_vector_bool_destroy(&types);
-        return NULL;
-      }
-      igraph_vector_bool_destroy(&types);
-      // reference to types_o will be stolen by Py_BuildValue
-      return Py_BuildValue("ON", Py_True, types_o);
-    } else {
-      igraph_vector_bool_destroy(&types);
-      return Py_BuildValue("OO", Py_False, Py_None);
-    }
-  } else {
-    if (igraph_is_bipartite(&self->g, &result, 0)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    if (result)
-      Py_RETURN_TRUE;
-    else
-      Py_RETURN_FALSE;
-  }
-}
-
-/**********************************************************************
- * Motifs, dyad and triad census                                      *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates the dyad census of the graph
- * \return the dyad census as a 3-tuple
- * \sa igraph_dyad_census
- */
-PyObject *igraphmodule_Graph_dyad_census(igraphmodule_GraphObject *self) {
-  igraph_integer_t mut, asym, nul;
-  PyObject *list;
-
-  if (igraph_dyad_census(&self->g, &mut, &asym, &nul)) {
-    return igraphmodule_handle_igraph_error();
-  }
-
-  list = Py_BuildValue("lll", (long)mut, (long)asym, (long)nul);
-  return list;
-}
-
-typedef struct {
-  PyObject* func;
-  PyObject* graph;
-} igraphmodule_i_Graph_motifs_randesu_callback_data_t;
-
-igraph_bool_t igraphmodule_i_Graph_motifs_randesu_callback(const igraph_t *graph,
-    igraph_vector_t *vids, int isoclass, void* extra) {
-  igraphmodule_i_Graph_motifs_randesu_callback_data_t* data =
-    (igraphmodule_i_Graph_motifs_randesu_callback_data_t*)extra;
-  PyObject* vector;
-  PyObject* result;
-  igraph_bool_t retval;
-
-  vector = igraphmodule_vector_t_to_PyList(vids, IGRAPHMODULE_TYPE_INT);
-  if (vector == NULL) {
-    /* Error in conversion, return 1 */
-    return 1;
-  }
-
-  result = PyObject_CallFunction(data->func, "OOi", data->graph, vector, isoclass);
-  Py_DECREF(vector);
-
-  if (result == NULL) {
-    /* Error in callback, return 1 */
-    return 1;
-  }
-
-  retval = PyObject_IsTrue(result);
-  Py_DECREF(result);
-
-  return retval;
-}
-
-/** \ingroup python_interface_graph
- * \brief Counts the motifs of the graph sorted by isomorphism classes 
- * \return the number of motifs found for each isomorphism class
- * \sa igraph_motifs_randesu
- */
-PyObject *igraphmodule_Graph_motifs_randesu(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_vector_t result, cut_prob;
-  long int size=3;
-  PyObject* cut_prob_list=Py_None;
-  PyObject* callback=Py_None;
-  PyObject *list;
-  static char* kwlist[] = {"size", "cut_prob", "callback", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lOO", kwlist, &size,
-        &cut_prob_list, &callback))
-    return NULL;
-
-  if (cut_prob_list == Py_None) {
-    if (igraph_vector_init(&cut_prob, size)) {
-      return igraphmodule_handle_igraph_error();
-    }
-    igraph_vector_fill(&cut_prob, 0);
-  } else {
-    if (igraphmodule_PyObject_float_to_vector_t(cut_prob_list, &cut_prob))
-      return NULL;
-  }
-
-  if (callback == Py_None) {
-    if (igraph_vector_init(&result, 1)) {
-      igraph_vector_destroy(&cut_prob);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraph_motifs_randesu(&self->g, &result, (igraph_integer_t) size, &cut_prob)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&result);
-      igraph_vector_destroy(&cut_prob);
-      return NULL;
-    }
-    igraph_vector_destroy(&cut_prob);
-
-    list = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&result);
-
-    return list;
-  } else if (PyCallable_Check(callback)) {
-    igraphmodule_i_Graph_motifs_randesu_callback_data_t data;
-    data.graph = (PyObject*)self;
-    data.func = callback;
-    if (igraph_motifs_randesu_callback(&self->g, (igraph_integer_t) size, &cut_prob,
-          igraphmodule_i_Graph_motifs_randesu_callback, &data)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&cut_prob);
-      return NULL;
-    }
-    igraph_vector_destroy(&cut_prob);
-    /* Don't let exceptions from the callback function go unnoticed */
-    if (PyErr_Occurred())
-      return NULL;
-    Py_RETURN_NONE;
-  } else {
-    PyErr_SetString(PyExc_TypeError, "callback must be callable or None");
-    return NULL;
-  }
-}
-
-/** \ingroup python_interface_graph
- * \brief Counts the total number of motifs of the graph
- * \return the total number of motifs
- * \sa igraph_motifs_randesu
- */
-PyObject *igraphmodule_Graph_motifs_randesu_no(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_vector_t cut_prob;
-  igraph_integer_t result;
-  long int size=3;
-  PyObject* cut_prob_list=Py_None;
-  static char* kwlist[] = {"size", "cut_prob", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lO", kwlist, &size, &cut_prob_list))
-    return NULL;
-
-  if (cut_prob_list == Py_None) {
-    if (igraph_vector_init(&cut_prob, size)) {
-      return igraphmodule_handle_igraph_error();
-    }
-    igraph_vector_fill(&cut_prob, 0);
-  } else {
-    if (igraphmodule_PyObject_float_to_vector_t(cut_prob_list, &cut_prob)) {
-      return NULL;
-    }
-  }
-  if (igraph_motifs_randesu_no(&self->g, &result, (igraph_integer_t) size, &cut_prob)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&cut_prob);
-    return NULL;
-  }
-  igraph_vector_destroy(&cut_prob);
-
-  return PyInt_FromLong((long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Estimates the total number of motifs of the graph
- * \return the estimated total number of motifs
- * \sa igraph_motifs_randesu_estimate
- */
-PyObject *igraphmodule_Graph_motifs_randesu_estimate(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_vector_t cut_prob;
-  igraph_integer_t result;
-  long size=3;
-  PyObject* cut_prob_list=Py_None;
-  PyObject *sample=Py_None;
-  static char* kwlist[] = {"size", "cut_prob", "sample", NULL};
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lOO", kwlist,
-      &size, &cut_prob_list, &sample))
-    return NULL;
-
-  if (sample == Py_None) {
-    PyErr_SetString(PyExc_TypeError, "sample size must be given");
-    return NULL;
-  }
-
-  if (cut_prob_list == Py_None) {
-    if (igraph_vector_init(&cut_prob, size)) {
-      return igraphmodule_handle_igraph_error();
-    }
-    igraph_vector_fill(&cut_prob, 0);
-  } else {
-    if (igraphmodule_PyObject_float_to_vector_t(cut_prob_list, &cut_prob)) {
-      return NULL;
-    }
-  }
-
-  if (PyInt_Check(sample)) {
-    /* samples chosen randomly */
-    long int ns = PyInt_AsLong(sample);
-    if (igraph_motifs_randesu_estimate(&self->g, &result, (igraph_integer_t) size,
-          &cut_prob, (igraph_integer_t) ns, 0)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&cut_prob);
-      return NULL;
-    }
-  } else {
-    /* samples given in advance */
-    igraph_vector_t samp;
-    if (igraphmodule_PyObject_to_vector_t(sample, &samp, 1, 0)) {
-      igraph_vector_destroy(&cut_prob);
-      return NULL;
-    }
-    if (igraph_motifs_randesu_estimate(&self->g, &result, (igraph_integer_t) size,
-          &cut_prob, 0, &samp)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&cut_prob);
-      return NULL;
-    }
-  }
-  igraph_vector_destroy(&cut_prob);
-
-  return PyInt_FromLong((long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the triad census of the graph
- * \return the triad census as a list
- * \sa igraph_triad_census
- */
-PyObject *igraphmodule_Graph_triad_census(igraphmodule_GraphObject *self) {
-  igraph_vector_t result;
-  PyObject *list;
-
-  if (igraph_vector_init(&result, 16)) {
-    return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_triad_census(&self->g, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    return NULL;
-  }
-
-  list = igraphmodule_vector_t_to_PyTuple(&result);
-  igraph_vector_destroy(&result);
-
-  return list;
-}
-
-/**********************************************************************
- * Graph layout algorithms                                            *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph uniformly on a circle.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_circle
- */
-PyObject *igraphmodule_Graph_layout_circle(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  igraph_matrix_t m;
-  int ret;
-  long dim = 2;
-  PyObject *result;
-  static char *kwlist[] = { "dim", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|l", kwlist, &dim))
-    return NULL;
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (dim == 2)
-    ret = igraph_layout_circle(&self->g, &m);
-  else
-    ret = igraph_layout_sphere(&self->g, &m);
-
-  if (ret) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-
-  igraph_matrix_destroy(&m);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph randomly.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_random
- */
-PyObject *igraphmodule_Graph_layout_random(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  igraph_matrix_t m;
-  int ret;
-  long dim = 2;
-  PyObject *result;
-  static char *kwlist[] = { "dim", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|l", kwlist, &dim))
-    return NULL;
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (dim == 2)
-    ret = igraph_layout_random(&self->g, &m);
-  else
-    ret = igraph_layout_random_3d(&self->g, &m);
-
-  if (ret) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a grid
- * \sa igraph_layout_grid, igraph_layout_grid_3d
- */
-PyObject *igraphmodule_Graph_layout_grid(igraphmodule_GraphObject* self,
-		PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "width", "height", "dim", NULL };
-
-  igraph_matrix_t m;
-  PyObject *result;
-  long int width = 0, height = 0, dim = 2;
-  int ret;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lll", kwlist,
-        &width, &height, &dim))
-    return NULL;
-
-  if (dim == 2 && height > 0) {
-    PyErr_SetString(PyExc_ValueError, "height must not be given if dim=2");
-    return NULL;
-  }
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (dim == 2)
-    ret = igraph_layout_grid(&self->g, &m, width);
-  else
-    ret = igraph_layout_grid_3d(&self->g, &m, width, height);
-
-  if (ret != IGRAPH_SUCCESS) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices in a star-like layout
- * \sa igraph_layout_star
- */
-PyObject *igraphmodule_Graph_layout_star(igraphmodule_GraphObject* self,
-		PyObject *args, PyObject *kwds) {
-  static char *kwlist[] =
-    { "center", "order", NULL };
-
-  igraph_matrix_t m;
-  PyObject *result, *order_o = Py_None, *center_o = Py_None;
-  igraph_integer_t center = 0;
-  igraph_vector_t* order = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist,
-        &center_o, &order_o))
-    return NULL;
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_vid(center_o, &center, &self->g))
-    return NULL;
-
-  if (order_o != Py_None) {
-    order = (igraph_vector_t*)calloc(1, sizeof(igraph_vector_t));
-    if (!order) {
-      igraph_matrix_destroy(&m);
-      PyErr_NoMemory();
-      return NULL;
-    }
-    if (igraphmodule_PyObject_to_vector_t(order_o, order, 1, 0)) {
-      igraph_matrix_destroy(&m);
-      free(order);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  if (igraph_layout_star(&self->g, &m, center, order)) {
-    if (order) {
-      igraph_vector_destroy(order); free(order);
-    }
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a plane according to the Kamada-Kawai algorithm.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_kamada_kawai
- */
-PyObject *igraphmodule_Graph_layout_kamada_kawai(igraphmodule_GraphObject *
-                                                 self, PyObject * args,
-                                                 PyObject * kwds)
-{
-  static char *kwlist[] =
-    { "maxiter", "sigma", "initemp", "coolexp", "kkconst", "seed", "minx", "maxx",
-      "miny", "maxy", "minz", "maxz", "dim", NULL };
-  igraph_matrix_t m;
-  igraph_bool_t use_seed=0;
-  int ret;
-  long int niter = 1000, dim = 2;
-  double sigma, initemp, coolexp, kkconst;
-  PyObject *result, *seed_o=Py_None;
-  PyObject *minx_o=Py_None, *maxx_o=Py_None;
-  PyObject *miny_o=Py_None, *maxy_o=Py_None;
-  PyObject *minz_o=Py_None, *maxz_o=Py_None;
-  igraph_vector_t *minx=0, *maxx=0;
-  igraph_vector_t *miny=0, *maxy=0;
-  igraph_vector_t *minz=0, *maxz=0;
-
-#define DESTROY_VECTORS { \
-  if (minx)    { igraph_vector_destroy(minx); free(minx); } \
-  if (maxx)    { igraph_vector_destroy(maxx); free(maxx); } \
-  if (miny)    { igraph_vector_destroy(miny); free(miny); } \
-  if (maxy)    { igraph_vector_destroy(maxy); free(maxy); } \
-  if (minz)    { igraph_vector_destroy(minz); free(minz); } \
-  if (maxz)    { igraph_vector_destroy(maxz); free(maxz); } \
-}
-
-  sigma = igraph_vcount(&self->g);
-  kkconst = sigma * sigma;
-  sigma = sigma / 4.0;
-  initemp = 10.0;
-  coolexp = 0.99;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lddddOOOOOOOl", kwlist,
-                                   &niter, &sigma, &initemp, &coolexp,
-                                   &kkconst, &seed_o,
-                                   &minx_o, &maxx_o,
-                                   &miny_o, &maxy_o,
-                                   &minz_o, &maxz_o, &dim))
-    return NULL;
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (seed_o == 0 || seed_o == Py_None) {
-    if (igraph_matrix_init(&m, 1, 1)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-    use_seed=1;
-	if (igraphmodule_PyList_to_matrix_t(seed_o, &m)) return NULL;
-  }
-
-  /* Convert minimum and maximum x-y-z values */
-  if (igraphmodule_attrib_to_vector_t(minx_o, self, &minx, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(maxx_o, self, &maxx, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(miny_o, self, &miny, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(maxy_o, self, &maxy, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (dim > 2) {
-    if (igraphmodule_attrib_to_vector_t(minz_o, self, &minz, ATTRIBUTE_TYPE_EDGE)) {
-      igraph_matrix_destroy(&m);
-      DESTROY_VECTORS;
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-    if (igraphmodule_attrib_to_vector_t(maxz_o, self, &maxz, ATTRIBUTE_TYPE_EDGE)) {
-      igraph_matrix_destroy(&m);
-      DESTROY_VECTORS;
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-  if (dim == 2)
-    ret = igraph_layout_kamada_kawai
-      (&self->g, &m, (igraph_integer_t) niter, sigma, initemp, coolexp, kkconst, use_seed,
-       /*bounds*/ minx, maxx, miny, maxy);
-  else
-    ret = igraph_layout_kamada_kawai_3d
-      (&self->g, &m, (igraph_integer_t) niter, sigma, initemp, coolexp, kkconst, use_seed, 0,
-       /*bounds*/ minx, maxx, miny, maxy, minz, maxz);
-
-  DESTROY_VECTORS;
-
-#undef DESTROY_VECTORS
-
-  if (ret) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a plane according to the DrL algorithm.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_drl
- */
-PyObject* igraphmodule_Graph_layout_drl(igraphmodule_GraphObject *self,
-          PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] =
-    { "weights", "seed", "fixed", "options", "dim", NULL };
-  igraph_matrix_t m;
-  igraph_bool_t use_seed=0;
-  igraph_vector_t *weights=0;
-  igraph_vector_bool_t *fixed=0;
-  igraph_layout_drl_options_t options;
-  PyObject *result;
-  PyObject *wobj=Py_None, *fixed_o=Py_None, *seed_o=Py_None, *options_o=Py_None;
-  long dim = 2;
-  int retval;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOOOl", kwlist,
-                                   &wobj, &seed_o, &fixed_o, &options_o, &dim))
-	  return NULL;
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_drl_options_t(options_o, &options))
-    return NULL;
-
-  if (igraph_layout_drl_options_init(&options, IGRAPH_LAYOUT_DRL_DEFAULT)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (fixed_o != 0 && fixed_o != Py_None) {
-    fixed = (igraph_vector_bool_t*)malloc(sizeof(igraph_vector_bool_t));
-    if (!fixed) {
-	  PyErr_NoMemory();
-	  return NULL;
-	}
-	if (igraphmodule_PyObject_to_vector_bool_t(fixed_o, fixed)) {
-	  free(fixed);
-	  return NULL;
-	}
-  }
-
-  if (seed_o == 0 || seed_o == Py_None) {
-    if (igraph_matrix_init(&m, 1, 1)) {
-      igraphmodule_handle_igraph_error();
-	  if (fixed) { igraph_vector_bool_destroy(fixed); free(fixed); }
-      return NULL;
-    }
-  } else {
-    if (igraphmodule_PyList_to_matrix_t(seed_o, &m)) {
-	  if (fixed) { igraph_vector_bool_destroy(fixed); free(fixed); }
-	  return NULL;
-	}
-	use_seed=1;
-  }
-
-  /* Convert the weight parameter to a vector */
-  if (igraphmodule_attrib_to_vector_t(wobj, self, &weights, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-	if (fixed) { igraph_vector_bool_destroy(fixed); free(fixed); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (dim == 2) {
-	retval = igraph_layout_drl(&self->g, &m, use_seed, &options, weights, fixed);
-  } else {
-	retval = igraph_layout_drl_3d(&self->g, &m, use_seed, &options, weights, fixed);
-  }
-
-  if (retval) {
-    igraph_matrix_destroy(&m);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-	if (fixed) { igraph_vector_bool_destroy(fixed); free(fixed); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-  if (fixed) { igraph_vector_bool_destroy(fixed); free(fixed); }
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a plane according to the Fruchterman-Reingold algorithm.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_fruchterman_reingold
- */
-PyObject
-  *igraphmodule_Graph_layout_fruchterman_reingold(igraphmodule_GraphObject *
-                                                  self, PyObject * args,
-                                                  PyObject * kwds)
-{
-  static char *kwlist[] =
-    { "weights", "maxiter", "maxdelta", "area", "coolexp", "repulserad",
-      "seed", "minx", "maxx", "miny", "maxy", "minz", "maxz", "dim", NULL };
-  igraph_matrix_t m;
-  igraph_bool_t use_seed=0;
-  igraph_vector_t *weights=0;
-  igraph_vector_t *minx=0, *maxx=0;
-  igraph_vector_t *miny=0, *maxy=0;
-  igraph_vector_t *minz=0, *maxz=0;
-  int ret;
-  long int niter = 500, dim = 2;
-  double maxdelta, area, coolexp, repulserad;
-  PyObject *result;
-  PyObject *wobj=Py_None, *seed_o=Py_None;
-  PyObject *minx_o=Py_None, *maxx_o=Py_None;
-  PyObject *miny_o=Py_None, *maxy_o=Py_None;
-  PyObject *minz_o=Py_None, *maxz_o=Py_None;
-
-#define DESTROY_VECTORS { \
-  if (weights) { igraph_vector_destroy(weights); free(weights); } \
-  if (minx)    { igraph_vector_destroy(minx); free(minx); } \
-  if (maxx)    { igraph_vector_destroy(maxx); free(maxx); } \
-  if (miny)    { igraph_vector_destroy(miny); free(miny); } \
-  if (maxy)    { igraph_vector_destroy(maxy); free(maxy); } \
-  if (minz)    { igraph_vector_destroy(minz); free(minz); } \
-  if (maxz)    { igraph_vector_destroy(maxz); free(maxz); } \
-}
-
-  maxdelta = igraph_vcount(&self->g);
-  coolexp = 1.5;
-  repulserad = -1;
-  area = -1;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OlddddOOOOOOOl", kwlist, &wobj,
-                                   &niter, &maxdelta, &area, &coolexp,
-                                   &repulserad, &seed_o, &minx_o, &maxx_o,
-                                   &miny_o, &maxy_o, &minz_o, &maxz_o,
-                                   &dim))
-    return NULL;
-
-  if (area <= 0) {
-    area = maxdelta * maxdelta;
-    if (dim == 3)
-      area *= maxdelta;
-  }
-  if (repulserad <= 0)
-    repulserad = area * maxdelta;
-
-  if (dim != 2 && dim != 3) {
-    PyErr_SetString(PyExc_ValueError, "number of dimensions must be either 2 or 3");
-    return NULL;
-  }
-
-  if (seed_o == 0 || seed_o == Py_None) {
-    if (igraph_matrix_init(&m, 1, 1)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-    if (igraphmodule_PyList_to_matrix_t(seed_o, &m)) return NULL;
-	use_seed=1;
-  }
-
-
-  /* Convert the weight parameter to a vector */
-  if (igraphmodule_attrib_to_vector_t(wobj, self, &weights, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  /* Convert minimum and maximum x-y-z values */
-  if (igraphmodule_attrib_to_vector_t(minx_o, self, &minx, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(maxx_o, self, &maxx, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(miny_o, self, &miny, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_t(maxy_o, self, &maxy, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    DESTROY_VECTORS;
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (dim > 2) {
-    if (igraphmodule_attrib_to_vector_t(minz_o, self, &minz, ATTRIBUTE_TYPE_EDGE)) {
-      igraph_matrix_destroy(&m);
-      DESTROY_VECTORS;
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-    if (igraphmodule_attrib_to_vector_t(maxz_o, self, &maxz, ATTRIBUTE_TYPE_EDGE)) {
-      igraph_matrix_destroy(&m);
-      DESTROY_VECTORS;
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  if (dim == 2)
-    ret = igraph_layout_fruchterman_reingold
-        (&self->g, &m, (igraph_integer_t) niter, maxdelta, area, coolexp, repulserad,
-         use_seed, weights, minx, maxx, miny, maxy);
-  else
-    ret = igraph_layout_fruchterman_reingold_3d
-      (&self->g, &m, (igraph_integer_t) niter, maxdelta, area, coolexp, repulserad,
-       use_seed, weights, minx, maxx, miny, maxy, minz, maxz);
-
-  DESTROY_VECTORS;
-
-  if (ret) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-#undef DESTROY_VECTORS
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a plane according to the layout algorithm in
- * graphopt 0.4.1
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_graphopt
- */
-PyObject *igraphmodule_Graph_layout_graphopt(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char *kwlist[] =
-    { "niter", "node_charge", "node_mass", "spring_length", "spring_constant",
-      "max_sa_movement", "seed", NULL };
-  igraph_matrix_t m;
-  long int niter = 500;
-  double node_charge = 0.001, node_mass = 30;
-  long spring_length = 0;
-  double spring_constant = 1, max_sa_movement = 5;
-  PyObject *result, *seed_o = Py_None;
-  igraph_bool_t use_seed=0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lddlddO", kwlist,
-                                   &niter, &node_charge, &node_mass,
-                                   &spring_length, &spring_constant,
-                                   &max_sa_movement, &seed_o))
-    return NULL;
-
-  if (seed_o == 0 || seed_o == Py_None) {
-    if (igraph_matrix_init(&m, 1, 1)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-    use_seed=1;
-    if (igraphmodule_PyList_to_matrix_t(seed_o, &m))
-			return NULL;
-  }
-
-  if (igraph_layout_graphopt(&self->g, &m, (igraph_integer_t) niter,
-        node_charge, node_mass, spring_length, spring_constant,
-        max_sa_movement, use_seed)) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices on a plane according to the Fruchterman-Reingold grid layout algorithm.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_grid_fruchterman_reingold
- */
-PyObject
-  *igraphmodule_Graph_layout_grid_fruchterman_reingold
-  (igraphmodule_GraphObject * self, PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] =
-    { "weights", "maxiter", "maxdelta", "area", "coolexp", "repulserad", "cellsize",
-	  "seed", NULL };
-  igraph_matrix_t m;
-  long int niter = 500;
-  double maxdelta, area, coolexp, repulserad, cellsize;
-  PyObject *result, *seed_o = Py_None, *wobj = Py_None;
-  igraph_bool_t use_seed=0;
-  igraph_vector_t *weights;
-
-  maxdelta = igraph_vcount(&self->g);
-  area = maxdelta * maxdelta;
-  coolexp = 1.5;
-  repulserad = area * igraph_vcount(&self->g); 
-  cellsize = sqrt(sqrt(area));
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OldddddO", kwlist, &wobj,
-                                   &niter, &maxdelta, &area, &coolexp,
-                                   &repulserad, &cellsize, &seed_o))
-    return NULL;
-
-  /* Interpret the seed matrix */
-  if (seed_o == 0 || seed_o == Py_None) {
-    if (igraph_matrix_init(&m, 1, 1)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  } else {
-    use_seed=1;
-	if (igraphmodule_PyList_to_matrix_t(seed_o, &m)) return NULL;
-  }
-
-  /* Convert the weight parameter to a vector */
-  if (igraphmodule_attrib_to_vector_t(wobj, self, &weights, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_layout_grid_fruchterman_reingold
-      (&self->g, &m, (igraph_integer_t) niter, maxdelta, area, coolexp, repulserad,
-       cellsize, use_seed, weights)) {
-    igraph_matrix_destroy(&m);
-    if (weights) {
-      igraph_vector_destroy(weights); free(weights);
-    }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (weights) {
-    igraph_vector_destroy(weights); free(weights);
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph according to the Large Graph Layout
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_lgl
- */
-PyObject *igraphmodule_Graph_layout_lgl(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] =
-    { "maxiter", "maxdelta", "area", "coolexp", "repulserad", "cellsize", "root",
-    NULL };
-  igraph_matrix_t m;
-  PyObject *result, *root_o = Py_None;
-  long int maxiter = 150;
-  igraph_integer_t proot = -1;
-  double maxdelta, area, coolexp, repulserad, cellsize;
-
-  maxdelta = igraph_vcount(&self->g);
-  area = -1;
-  coolexp = 1.5;
-  repulserad = -1;
-  cellsize = -1;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|ldddddO", kwlist,
-                                   &maxiter, &maxdelta, &area, &coolexp,
-                                   &repulserad, &cellsize, &root_o))
-    return NULL;
-
-  if (area <= 0)
-    area = igraph_vcount(&self->g)*igraph_vcount(&self->g);
-  if (repulserad <= 0)
-    repulserad = area*igraph_vcount(&self->g);
-  if (cellsize <= 0)
-    cellsize = sqrt(sqrt(area));
-
-  if (igraphmodule_PyObject_to_vid(root_o, &proot, &self->g))
-    return NULL;
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_layout_lgl(&self->g, &m, (igraph_integer_t) maxiter, maxdelta,
-                        area, coolexp, repulserad, cellsize, proot)) {
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph using multidimensional scaling
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_mds
- */
-PyObject *igraphmodule_Graph_layout_mds(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] =
-    { "dist", "dim", "arpack_options", NULL };
-  igraph_matrix_t m;
-  igraph_matrix_t *dist = 0;
-  long int dim = 2;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  PyObject *dist_o = Py_None;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-  PyObject *result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OlO!", kwlist, &dist_o,
-                                   &dim, &igraphmodule_ARPACKOptionsType,
-                                   &arpack_options_o))
-    return NULL;
-
-  if (dist_o != Py_None) {
-    dist = (igraph_matrix_t*)malloc(sizeof(igraph_matrix_t));
-    if (!dist) {
-      PyErr_NoMemory();
-      return NULL;
-    }
-	if (igraphmodule_PyList_to_matrix_t(dist_o, dist)) {
-      free(dist);
-      return NULL;
-    }
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    if (dist) {
-      igraph_matrix_destroy(dist); free(dist);
-    }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (igraph_layout_mds(&self->g, &m, dist, dim,
-                        igraphmodule_ARPACKOptions_get(arpack_options))) {
-    if (dist) {
-      igraph_matrix_destroy(dist); free(dist);
-    }
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (dist) {
-    igraph_matrix_destroy(dist); free(dist);
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph according to the Reingold-Tilford
- * tree layout algorithm
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_reingold_tilford
- */
-PyObject *igraphmodule_Graph_layout_reingold_tilford(igraphmodule_GraphObject
-                                                     * self, PyObject * args,
-                                                     PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", "root", "rootlevel", NULL };
-  igraph_matrix_t m;
-  igraph_vector_t roots, *roots_p = 0;
-  igraph_vector_t rootlevels, *rootlevels_p = 0;
-  PyObject *roots_o=Py_None, *rootlevels_o=Py_None, *mode_o=Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  PyObject *result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-    &mode_o, &roots_o, &rootlevels_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode))
-    return NULL;
-
-  if (roots_o != Py_None) {
-    roots_p = &roots;
-    if (igraphmodule_PyObject_to_vector_t(roots_o, roots_p, 1, 0)) return 0;
-  }
-  if (rootlevels_o != Py_None) {
-    rootlevels_p = &rootlevels;
-    if (igraphmodule_PyObject_to_vector_t(rootlevels_o, rootlevels_p, 1, 0)) {
-      if (roots_p) igraph_vector_destroy(roots_p);
-      return 0;
-    }
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    if (roots_p) igraph_vector_destroy(roots_p);
-    if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_layout_reingold_tilford(&self->g, &m, mode, roots_p, rootlevels_p)) {
-    igraph_matrix_destroy(&m);
-    if (roots_p) igraph_vector_destroy(roots_p);
-    if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (roots_p) igraph_vector_destroy(roots_p);
-  if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph according to the Reingold-Tilford
- * tree layout algorithm in a polar coordinate system
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_reingold_tilford
- */
-PyObject *igraphmodule_Graph_layout_reingold_tilford_circular(
-  igraphmodule_GraphObject * self, PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", "root", "rootlevel", NULL };
-  igraph_matrix_t m;
-  igraph_vector_t roots, *roots_p = 0;
-  igraph_vector_t rootlevels, *rootlevels_p = 0;
-  PyObject *roots_o=Py_None, *rootlevels_o=Py_None, *mode_o=Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  PyObject *result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist,
-    &mode_o, &roots_o, &rootlevels_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-
-  if (roots_o != Py_None) {
-    roots_p = &roots;
-    if (igraphmodule_PyObject_to_vector_t(roots_o, roots_p, 1, 0)) return 0;
-  }
-  if (rootlevels_o != Py_None) {
-    rootlevels_p = &rootlevels;
-    if (igraphmodule_PyObject_to_vector_t(rootlevels_o, rootlevels_p, 1, 0)) {
-      if (roots_p) igraph_vector_destroy(roots_p);
-      return 0;
-    }
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    if (roots_p) igraph_vector_destroy(roots_p);
-    if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_layout_reingold_tilford_circular(&self->g, &m, mode, roots_p,
-      rootlevels_p)) {
-    igraph_matrix_destroy(&m);
-    if (roots_p) igraph_vector_destroy(roots_p);
-    if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (roots_p) igraph_vector_destroy(roots_p);
-  if (rootlevels_p) igraph_vector_destroy(rootlevels_p);
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Places the vertices of a graph according to the Sugiyama layout.
- * \return the calculated coordinates as a Python list of lists
- * \sa igraph_layout_sugiyama
- */
-PyObject *igraphmodule_Graph_layout_sugiyama(
-  igraphmodule_GraphObject * self, PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "layers", "weights", "hgap", "vgap", "maxiter",
-    "return_extended_graph", NULL };
-  igraph_matrix_t m;
-  igraph_t extd_graph;
-  igraph_vector_t extd_to_orig_eids;
-  igraph_vector_t *weights = 0, *layers = 0;
-  double hgap = 1, vgap = 1;
-  long int maxiter = 100;
-  PyObject *layers_o = Py_None, *weights_o = Py_None, *extd_to_orig_eids_o = Py_None;
-  PyObject *return_extended_graph = Py_False;
-  PyObject *result;
-  igraphmodule_GraphObject *graph_o;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOddlO", kwlist,
-    &layers_o, &weights_o, &hgap, &vgap, &maxiter, &return_extended_graph))
-    return NULL;
-
-  if (igraph_vector_init(&extd_to_orig_eids, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_matrix_init(&m, 1, 1)) {
-    igraph_vector_destroy(&extd_to_orig_eids);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(layers_o, self, &layers,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    igraph_vector_destroy(&extd_to_orig_eids);
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (layers != 0) { igraph_vector_destroy(layers); free(layers); }
-    igraph_vector_destroy(&extd_to_orig_eids);
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  if (igraph_layout_sugiyama(&self->g, &m,
-        (PyObject_IsTrue(return_extended_graph) ? &extd_graph : 0),
-        (PyObject_IsTrue(return_extended_graph) ? &extd_to_orig_eids : 0),
-        layers, hgap, vgap, maxiter, weights)) {
-    if (layers != 0) { igraph_vector_destroy(layers); free(layers); }
-    if (weights != 0) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_destroy(&extd_to_orig_eids);
-    igraph_matrix_destroy(&m);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (layers != 0) { igraph_vector_destroy(layers); free(layers); }
-  if (weights != 0) { igraph_vector_destroy(weights); free(weights); }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_matrix_destroy(&m);
-
-  if (PyObject_IsTrue(return_extended_graph)) {
-    CREATE_GRAPH(graph_o, extd_graph);
-    extd_to_orig_eids_o = igraphmodule_vector_t_to_PyList(&extd_to_orig_eids,
-        IGRAPHMODULE_TYPE_INT);
-    result = Py_BuildValue("NNN", result, graph_o, extd_to_orig_eids_o);
-  }
-
-  igraph_vector_destroy(&extd_to_orig_eids);
-  return (PyObject *) result;
-}
-
-/**********************************************************************
- * Conversion between various graph representations                   *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Returns the adjacency matrix of a graph.
- * \return the adjacency matrix as a Python list of lists
- * \sa igraph_get_adjacency
- */
-PyObject *igraphmodule_Graph_get_adjacency(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "type", "eids", NULL };
-  igraph_get_adjacency_t t = IGRAPH_GET_ADJACENCY_BOTH;
-  igraph_matrix_t m;
-  PyObject *result, *eids = Py_False;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|iO", kwlist, &t, &eids))
-    return NULL;
-
-  if (t != IGRAPH_GET_ADJACENCY_UPPER && t != IGRAPH_GET_ADJACENCY_LOWER &&
-      t != IGRAPH_GET_ADJACENCY_BOTH) {
-    PyErr_SetString(PyExc_ValueError,
-                    "type must be either GET_ADJACENCY_LOWER or GET_ADJACENCY_UPPER or GET_ADJACENCY_BOTH");
-    return NULL;
-  }
-
-  if (igraph_matrix_init
-      (&m, igraph_vcount(&self->g), igraph_vcount(&self->g))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_get_adjacency(&self->g, &m, t, PyObject_IsTrue(eids))) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&m);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the incidence matrix of a bipartite graph.
- * \return the incidence matrix as a Python list of lists
- * \sa igraph_get_incidence
- */
-PyObject *igraphmodule_Graph_get_incidence(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "types", NULL };
-  igraph_matrix_t matrix;
-  igraph_vector_t row_ids, col_ids;
-  igraph_vector_bool_t *types;
-  PyObject *matrix_o, *row_ids_o, *col_ids_o, *types_o;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &types_o))
-    return NULL;
-
-  if (igraph_vector_init(&row_ids, 0))
-	return NULL;
-
-  if (igraph_vector_init(&col_ids, 0)) {
-    igraph_vector_destroy(&row_ids);
-	return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX)) {
-    igraph_vector_destroy(&row_ids);
-    igraph_vector_destroy(&col_ids);
-	return NULL;
-  }
-
-  if (igraph_matrix_init(&matrix, 1, 1)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&row_ids);
-    igraph_vector_destroy(&col_ids);
-    if (types) { igraph_vector_bool_destroy(types); free(types); }
-    return NULL;
-  }
-
-  if (igraph_get_incidence(&self->g, types, &matrix, &row_ids, &col_ids)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&row_ids);
-    igraph_vector_destroy(&col_ids);
-    if (types) { igraph_vector_bool_destroy(types); free(types); }
-    igraph_matrix_destroy(&matrix);
-    return NULL;
-  }
-  
-  if (types) { igraph_vector_bool_destroy(types); free(types); }
-
-  matrix_o = igraphmodule_matrix_t_to_PyList(&matrix, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&matrix);
-
-  row_ids_o = igraphmodule_vector_t_to_PyList(&row_ids, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&row_ids);
-  col_ids_o = igraphmodule_vector_t_to_PyList(&col_ids, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&col_ids);
-
-  return Py_BuildValue("NNN", matrix_o, row_ids_o, col_ids_o);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the Laplacian matrix of a graph.
- * \return the Laplacian matrix as a Python list of lists
- * \sa igraph_laplacian
- */
-PyObject *igraphmodule_Graph_laplacian(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "weights", "normalized", NULL };
-  igraph_matrix_t m;
-  PyObject *result;
-  PyObject *weights_o = Py_None;
-  PyObject *normalized = Py_False;
-  igraph_vector_t *weights = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist,
-        &weights_o, &normalized))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (igraph_matrix_init
-      (&m, igraph_vcount(&self->g), igraph_vcount(&self->g))) {
-    igraphmodule_handle_igraph_error();
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-
-  if (igraph_laplacian(&self->g, &m, /*sparseres=*/ 0, 
-		       PyObject_IsTrue(normalized), weights)) {
-    igraphmodule_handle_igraph_error();
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    igraph_matrix_destroy(&m);
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(normalized) || weights) {
-    result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_FLOAT);
-  }
-  else {
-    result = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_INT);
-  }
-
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-  igraph_matrix_destroy(&m);
-
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the list of edges in a graph.
- * \return the list of edges, every edge is represented by a pair
- * \sa igraph_get_edgelist
- */
-PyObject *igraphmodule_Graph_get_edgelist(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  igraph_vector_t edgelist;
-  PyObject *result;
-
-  igraph_vector_init(&edgelist, igraph_ecount(&self->g));
-  if (igraph_get_edgelist(&self->g, &edgelist, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&edgelist);
-    return NULL;
-  }
-
-  result = igraphmodule_vector_t_to_PyList_pairs(&edgelist);
-  igraph_vector_destroy(&edgelist);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \function igraphmodule_Graph_to_undirected
- * \brief Converts a directed graph to an undirected one.
- * \return The undirected graph.
- * \sa igraph_to_undirected
- */
-PyObject *igraphmodule_Graph_to_undirected(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  PyObject *mode_o = Py_None, *comb_o = Py_None;
-  igraph_to_undirected_t mode = IGRAPH_TO_UNDIRECTED_COLLAPSE;
-  igraph_attribute_combination_t comb;
-  static char *kwlist[] = { "mode", "combine_edges", NULL };
-
-  if (kwds && PyDict_GetItemString(kwds, "mode") && PyDict_GetItemString(kwds, "collapse"))
-    PyErr_SetString(PyExc_ValueError, "cannot specify mode=... and collapse=... at the same time");
-
-  if (kwds && PyDict_GetItemString(kwds, "collapse")) {
-    mode_o = PyDict_GetItemString(kwds, "collapse");
-    PY_IGRAPH_DEPRECATED("The collapse=... keyword argument of Graph.to_undirected() is deprecated, please use mode=... instead. This warning will be removed from igraph 0.7.");
-    PyDict_DelItemString(kwds, "collapse");
-  }
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &mode_o, &comb_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_to_undirected_t(mode_o, &mode))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_attribute_combination_t(comb_o, &comb))
-	return NULL;
-
-  if (igraph_to_undirected(&self->g, mode, &comb)) {
-    igraph_attribute_combination_destroy(&comb);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  igraph_attribute_combination_destroy(&comb);
-
-  Py_RETURN_NONE;
-}
-
-
-/** \ingroup python_interface_graph
- * \function igraphmodule_Graph_to_directed
- * \brief Converts an undirected graph to a directed one.
- * \return The directed graph.
- * \sa igraph_to_directed
- */
-PyObject *igraphmodule_Graph_to_directed(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  PyObject *mutual = Py_True;
-  igraph_to_directed_t mode = IGRAPH_TO_DIRECTED_MUTUAL;
-  static char *kwlist[] = { "mutual", NULL };
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &mutual))
-    return NULL;
-  mode =
-    (PyObject_IsTrue(mutual) ? IGRAPH_TO_DIRECTED_MUTUAL :
-     IGRAPH_TO_DIRECTED_ARBITRARY);
-  if (igraph_to_directed(&self->g, mode)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  Py_RETURN_NONE;
-}
-
-/**********************************************************************
- * Reading/writing foreing graph formats                              *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Reads a DIMACS file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_dimacs
- */
-PyObject *igraphmodule_Graph_Read_DIMACS(PyTypeObject * type,
-                                         PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraphmodule_filehandle_t fobj;
-  igraph_integer_t source = 0, target = 0;
-  igraph_vector_t capacity;
-  igraph_t g;
-  PyObject *fname = NULL, *directed = Py_False, *capacity_obj;
-
-  static char *kwlist[] = { "f", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O|O", kwlist, &fname, &directed))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_vector_init(&capacity, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  if (igraph_read_graph_dimacs(&g, igraphmodule_filehandle_get(&fobj),
-                               0, 0, &source, &target,
-                               &capacity, PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&capacity);
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-
-  capacity_obj = igraphmodule_vector_t_to_PyList(&capacity, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&capacity);
-  if (!capacity_obj)
-    return NULL;
-
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return Py_BuildValue("NiiN", (PyObject *) self, (long)source,
-                       (long)target, capacity_obj);
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads an UCINET DL file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_dl
- */
-PyObject *igraphmodule_Graph_Read_DL(PyTypeObject * type,
-                                     PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  igraph_t g;
-  igraphmodule_filehandle_t fobj;
-  PyObject *fname = NULL, *directed = Py_True;
-
-  static char *kwlist[] = { "f", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O|O", kwlist, &fname, &directed))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_dl(&g, igraphmodule_filehandle_get(&fobj),
-        PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject*)self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads an edge list from a file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_edgelist
- */
-PyObject *igraphmodule_Graph_Read_Edgelist(PyTypeObject * type,
-                                           PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *directed = Py_True, *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_t g;
-
-  static char *kwlist[] = { "f", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist,
-                                   &fname, &directed))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_edgelist(&g, igraphmodule_filehandle_get(&fobj),
-        0, PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads an edge list from an NCOL file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_ncol
- */
-PyObject *igraphmodule_Graph_Read_Ncol(PyTypeObject * type, PyObject * args,
-                                       PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *names = Py_True, *weights = Py_None, *directed = Py_True;
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_add_weights_t add_weights = IGRAPH_ADD_WEIGHTS_IF_PRESENT;
-  igraph_t g;
-
-  static char *kwlist[] = { "f", "names", "weights", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OOO", kwlist,
-                                   &fname, &names, &weights, &directed))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_add_weights_t(weights, &add_weights))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_ncol(&g, igraphmodule_filehandle_get(&fobj), 0,
-      PyObject_IsTrue(names), add_weights,
-      PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads an edge list from an LGL file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_lgl
- */
-PyObject *igraphmodule_Graph_Read_Lgl(PyTypeObject * type, PyObject * args,
-                                      PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *names = Py_True, *weights = Py_None, *directed = Py_True;
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_add_weights_t add_weights = IGRAPH_ADD_WEIGHTS_IF_PRESENT;
-  igraph_t g;
-
-  static char *kwlist[] = { "f", "names", "weights", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OOO", kwlist,
-                                   &fname, &names, &weights, &directed))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_add_weights_t(weights, &add_weights))
-    return NULL;
-
-  if (kwds && PyDict_Check(kwds) && \
-      PyDict_GetItemString(kwds, "directed") == NULL) {
-    if (PyErr_Occurred())
-      return NULL;
-    PY_IGRAPH_WARN("Graph.Read_Lgl creates directed networks by default from igraph 0.6. To get rid of this warning, specify directed=... explicitly. This warning will be removed from igraph 0.7.");
-  }
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_lgl(&g, igraphmodule_filehandle_get(&fobj),
-        PyObject_IsTrue(names), add_weights,
-        PyObject_IsTrue(directed))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads an edge list from a Pajek file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_pajek
- */
-PyObject *igraphmodule_Graph_Read_Pajek(PyTypeObject * type, PyObject * args,
-                                        PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_t g;
-
-  static char *kwlist[] = { "f", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_pajek(&g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads a GML file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_gml
- */
-PyObject *igraphmodule_Graph_Read_GML(PyTypeObject * type,
-                                      PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_t g;
-
-  static char *kwlist[] = { "f", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_gml(&g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads a GraphDB file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_graphdb
- */
-PyObject *igraphmodule_Graph_Read_GraphDB(PyTypeObject * type,
-                                          PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *fname = NULL, *directed_o = Py_False;
-  igraph_t g;
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = { "f", "directed", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &fname, &directed_o))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_graphdb(&g, igraphmodule_filehandle_get(&fobj),
-        PyObject_IsTrue(directed_o))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-  
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Reads a GraphML file and creates a graph from it.
- * \return the graph
- * \sa igraph_read_graph_graphml
- */
-PyObject *igraphmodule_Graph_Read_GraphML(PyTypeObject * type,
-                                          PyObject * args, PyObject * kwds)
-{
-  igraphmodule_GraphObject *self;
-  PyObject *fname = NULL;
-  long int index = 0;
-  igraph_t g;
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = { "f", "index", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|l", kwlist, &fname, &index))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "r"))
-    return NULL;
-
-  if (igraph_read_graph_graphml(&g, igraphmodule_filehandle_get(&fobj),
-        (igraph_integer_t) index)) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  
-  igraphmodule_filehandle_destroy(&fobj);
-  CREATE_GRAPH_FROM_TYPE(self, g, type);
-  
-  return (PyObject *) self;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the graph as a DIMACS file
- * \return none
- * \sa igraph_write_graph_dimacs
- */
-PyObject *igraphmodule_Graph_write_dimacs(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  long source = 0, target = 0;
-  PyObject *capacity_obj = Py_None, *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  igraph_vector_t* capacity = 0;
-
-  static char *kwlist[] = {
-    "f", "source", "target", "capacity", NULL
-  };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "Oll|O", kwlist, &fname,
-                                   &source, &target, &capacity_obj))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (capacity_obj == Py_None) {
-    capacity_obj = PyString_FromString("capacity");
-  } else {
-    Py_INCREF(capacity_obj);
-  }
-
-  if (igraphmodule_attrib_to_vector_t(capacity_obj, self, &capacity, ATTRIBUTE_TYPE_EDGE)) {
-    igraphmodule_filehandle_destroy(&fobj);
-    Py_DECREF(capacity_obj);
-    return NULL;
-  }
-
-  Py_DECREF(capacity_obj);
-
-  if (igraph_write_graph_dimacs(&self->g, igraphmodule_filehandle_get(&fobj),
-        source, target, capacity)) {
-    igraphmodule_handle_igraph_error();
-    if (capacity) {
-      igraph_vector_destroy(capacity); free(capacity);
-    }
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-
-  if (capacity) {
-    igraph_vector_destroy(capacity); free(capacity);
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Writes the graph as a DOT (GraphViz) file
- * \return none
- * \sa igraph_write_graph_dot
- */
-PyObject *igraphmodule_Graph_write_dot(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds) {
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  static char *kwlist[] = { "f", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_dot(&self->g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the edge list to a file
- * \return none
- * \sa igraph_write_graph_edgelist
- */
-PyObject *igraphmodule_Graph_write_edgelist(igraphmodule_GraphObject * self,
-                                            PyObject * args, PyObject * kwds)
-{
-  PyObject *fname = NULL;
-  igraphmodule_filehandle_t fobj;
-  static char *kwlist[] = { "f", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_edgelist(&self->g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-
-/** \ingroup python_interface_graph
- * \brief Writes the graph as a GML file
- * \return none
- * \sa igraph_write_graph_gml
- */
-PyObject *igraphmodule_Graph_write_gml(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *ids = Py_None, *fname = NULL;
-  PyObject *creator = Py_None;
-  igraph_vector_t idvec, *idvecptr=0;
-  char *creator_str=0;
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = {
-    "f", "creator", "ids", NULL
-  };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|OO", kwlist, &fname, &creator, &ids))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (PyList_Check(ids)) {
-    idvecptr = &idvec;
-    if (igraphmodule_PyObject_to_vector_t(ids, idvecptr, 0, 0)) {
-      igraphmodule_filehandle_destroy(&fobj);
-      return NULL;
-    }
-  }
-
-  if (creator != Py_None) {
-    PyObject* o = PyObject_Str(creator);
-    if (o == 0) {
-      if (idvecptr)
-        igraph_vector_destroy(idvecptr);
-      igraphmodule_filehandle_destroy(&fobj);
-    }
-
-    creator_str = PyString_CopyAsString(o);
-    Py_DECREF(o);
-
-    if (creator_str == 0) {
-      if (idvecptr)
-        igraph_vector_destroy(idvecptr);
-      igraphmodule_filehandle_destroy(&fobj);
-    }
-  }
-
-  if (igraph_write_graph_gml(&self->g, igraphmodule_filehandle_get(&fobj),
-        idvecptr, creator_str)) {
-    if (idvecptr) { igraph_vector_destroy(idvecptr); }
-    if (creator_str)
-      free(creator_str);
-    igraphmodule_filehandle_destroy(&fobj);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  if (idvecptr) { igraph_vector_destroy(idvecptr); }
-  if (creator_str)
-    free(creator_str);
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the edge list to a file in .ncol format
- * \return none
- * \sa igraph_write_graph_ncol
- */
-PyObject *igraphmodule_Graph_write_ncol(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  PyObject *fname = NULL;
-  char *names = "name";
-  char *weights = "weight";
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = { "f", "names", "weights", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|zz", kwlist,
-                                   &fname, &names, &weights))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_ncol(&self->g, igraphmodule_filehandle_get(&fobj),
-        names, weights)) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the edge list to a file in .lgl format
- * \return none
- * \sa igraph_write_graph_lgl
- */
-PyObject *igraphmodule_Graph_write_lgl(igraphmodule_GraphObject * self,
-                                       PyObject * args, PyObject * kwds)
-{
-  PyObject *fname = NULL;
-  char *names = "name";
-  char *weights = "weight";
-  PyObject *isolates = Py_True;
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = { "f", "names", "weights", "isolates", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|zzO", kwlist,
-                                   &fname, &names, &weights, &isolates))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_lgl(&self->g, igraphmodule_filehandle_get(&fobj),
-        names, weights, PyObject_IsTrue(isolates))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the graph as a Pajek .net file
- * \return none
- * \sa igraph_write_graph_pajek
- */
-PyObject *igraphmodule_Graph_write_pajek(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds) {
-  PyObject *fname = NULL;
-  static char *kwlist[] = { "f", NULL };
-  igraphmodule_filehandle_t fobj;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_pajek(&self->g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the graph to a GraphML file
- * \return none
- * \sa igraph_write_graph_graphml
- */
-PyObject *igraphmodule_Graph_write_graphml(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  PyObject *fname = NULL;
-  static char *kwlist[] = { "f", NULL };
-  igraphmodule_filehandle_t fobj;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &fname))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_graphml(&self->g, igraphmodule_filehandle_get(&fobj))) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Writes the edge list to a file in LEDA native format
- * \return none
- * \sa igraph_write_graph_leda
- */
-PyObject *igraphmodule_Graph_write_leda(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  PyObject *fname = NULL;
-  char *vertex_attr_name = "name";
-  char *edge_attr_name = "weight";
-  igraphmodule_filehandle_t fobj;
-
-  static char *kwlist[] = { "f", "names", "weights", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|zz", kwlist,
-                                   &fname, &vertex_attr_name,
-								   &edge_attr_name))
-    return NULL;
-
-  if (igraphmodule_filehandle_init(&fobj, fname, "w"))
-    return NULL;
-
-  if (igraph_write_graph_leda(&self->g, igraphmodule_filehandle_get(&fobj),
-        vertex_attr_name, edge_attr_name)) {
-    igraphmodule_handle_igraph_error();
-    igraphmodule_filehandle_destroy(&fobj);
-    return NULL;
-  }
-  igraphmodule_filehandle_destroy(&fobj);
-
-  Py_RETURN_NONE;
-}
-
-/**********************************************************************
- * Routines related to graph isomorphism                              *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates the isomorphy class of a graph or its subgraph
- * \sa igraph_isoclass, igraph_isoclass_subgraph
- */
-PyObject *igraphmodule_Graph_isoclass(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  Py_ssize_t n;
-  igraph_integer_t isoclass = 0;
-  PyObject *vids = 0;
-  char *kwlist[] = { "vertices", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|O!", kwlist, &PyList_Type, &vids))
-    return NULL;
-
-  n = vids ? PyList_Size(vids) : igraph_vcount(&self->g);
-  if (n < 3 || n > 4) {
-    PyErr_SetString(PyExc_ValueError,
-                    "Graph or subgraph must have 3 or 4 vertices.");
-    return NULL;
-  }
-
-  if (vids) {
-    igraph_vector_t vidsvec;
-    if (igraphmodule_PyObject_to_vector_t(vids, &vidsvec, 1, 0)) {
-      PyErr_SetString(PyExc_ValueError,
-                      "Error while converting PyList to igraph_vector_t");
-      return NULL;
-    }
-    if (igraph_isoclass_subgraph(&self->g, &vidsvec, &isoclass)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-  else {
-    if (igraph_isoclass(&self->g, &isoclass)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  return PyInt_FromLong((long)isoclass);
-}
-
-/** \ingroup python_interface_graph
- * \brief Determines whether the graph is isomorphic to another graph.
- *
- * \sa igraph_isomorphic
- */
-PyObject *igraphmodule_Graph_isomorphic(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  igraph_bool_t result = 0;
-  PyObject *o = Py_None;
-  igraphmodule_GraphObject *other;
-  static char *kwlist[] = { "other", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O!", kwlist,
-      &igraphmodule_GraphType, &o))
-    return NULL;
-  if (o == Py_None) other = self; else other = (igraphmodule_GraphObject *) o;
-
-  if (igraph_isomorphic(&self->g, &other->g, &result)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (result) Py_RETURN_TRUE;
-  Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Determines whether the graph is isomorphic to another graph,
- *   using the BLISS isomorphism algorithm
- *
- * The actual code is almost the same as igraphmodule_Graph_isomorphic_vf2.
- * Be sure to correct bugs in both interfaces if applicable!
- *
- * \sa igraph_isomorphic_bliss
- */
-PyObject *igraphmodule_Graph_isomorphic_bliss(igraphmodule_GraphObject * self,
-                                              PyObject * args, PyObject * kwds)
-{
-  igraph_bool_t result = 0;
-  PyObject *o=Py_None, *return1=Py_False, *return2=Py_False;
-  PyObject *sho1=Py_None, *sho2=Py_None;
-  igraphmodule_GraphObject *other;
-  igraph_vector_t mapping_12, mapping_21, *map12=0, *map21=0;
-  igraph_bliss_sh_t sh1=IGRAPH_BLISS_FM, sh2=IGRAPH_BLISS_FM;
-
-  static char *kwlist[] = { "other", "return_mapping_12",
-    "return_mapping_21", "sh1", "sh2", NULL };
-  /* TODO: convert igraph_bliss_info_t when needed */
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|O!OOOO", kwlist, &igraphmodule_GraphType, &o,
-       &return1, &return2, &sho1, &sho2))
-    return NULL;
-  if (igraphmodule_PyObject_to_bliss_sh_t(sho1, &sh1)) return NULL;
-  if (igraphmodule_PyObject_to_bliss_sh_t(sho2, &sh2)) return NULL;
-  if (o == Py_None) other = self; else other = (igraphmodule_GraphObject *) o;
-
-  if (PyObject_IsTrue(return1)) {
-	igraph_vector_init(&mapping_12, 0);
-	map12 = &mapping_12;
-  }
-  if (PyObject_IsTrue(return2)) {
-	igraph_vector_init(&mapping_21, 0);
-	map21 = &mapping_21;
-  }
-
-  if (igraph_isomorphic_bliss(&self->g, &other->g, &result, map12, map21,
-      sh1, sh2, 0, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (!map12 && !map21) {
-    if (result) Py_RETURN_TRUE;
-    Py_RETURN_FALSE;
-  } else {
-	PyObject *iso, *m1, *m2;
-	iso = result ? Py_True : Py_False;
-	Py_INCREF(iso);
-	if (map12) {
-	  m1 = igraphmodule_vector_t_to_PyList(map12, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map12);
-	  if (!m1) {
-	    Py_DECREF(iso);
-		if (map21) igraph_vector_destroy(map21);
-		return NULL;
-	  }
-	} else { m1 = Py_None; Py_INCREF(m1); }
-	if (map21) {
-	  m2 = igraphmodule_vector_t_to_PyList(map21, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map21);
-	  if (!m2) {
-	    Py_DECREF(iso); Py_DECREF(m1);
-		return NULL;
-	  }
-	} else { m2 = Py_None; Py_INCREF(m2); }
-	return Py_BuildValue("NNN", iso, m1, m2);
-  }
-}
-
-
-typedef struct {
-  PyObject* node_compat_fn;
-  PyObject* edge_compat_fn;
-  PyObject* callback_fn;
-  PyObject* graph1;
-  PyObject* graph2;
-} igraphmodule_i_Graph_isomorphic_vf2_callback_data_t;
-
-igraph_bool_t igraphmodule_i_Graph_isomorphic_vf2_callback_fn(
-    const igraph_vector_t *map12, const igraph_vector_t *map21,
-    void* extra) {
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t* data =
-    (igraphmodule_i_Graph_isomorphic_vf2_callback_data_t*)extra;
-  igraph_bool_t retval;
-  PyObject *map12_o, *map21_o;
-  PyObject *result;
-
-  map12_o = igraphmodule_vector_t_to_PyList(map12, IGRAPHMODULE_TYPE_INT);
-  if (map12_o == NULL) {
-    /* Error in conversion, return 0 to stop the search */
-    PyErr_WriteUnraisable(data->callback_fn);
-    return 0;
-  }
-
-  map21_o = igraphmodule_vector_t_to_PyList(map21, IGRAPHMODULE_TYPE_INT);
-  if (map21_o == NULL) {
-    /* Error in conversion, return 0 to stop the search */
-    PyErr_WriteUnraisable(data->callback_fn);
-    Py_DECREF(map21_o);
-    return 0;
-  }
-
-  result = PyObject_CallFunction(data->callback_fn, "OOOO", data->graph1, data->graph2,
-      map12_o, map21_o);
-  Py_DECREF(map12_o);
-  Py_DECREF(map21_o);
-
-  if (result == NULL) {
-    /* Error in callback, return 0 */
-    PyErr_WriteUnraisable(data->callback_fn);
-    return 0;
-  }
-
-  retval = PyObject_IsTrue(result);
-  Py_DECREF(result);
-
-  return retval;
-}
-
-igraph_bool_t igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn(
-    const igraph_t *graph1, const igraph_t *graph2,
-    const igraph_integer_t cand1, const igraph_integer_t cand2,
-    void* extra) {
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t* data =
-    (igraphmodule_i_Graph_isomorphic_vf2_callback_data_t*)extra;
-  igraph_bool_t retval;
-  PyObject *result;
-
-  result = PyObject_CallFunction(data->node_compat_fn, "OOll",
-      data->graph1, data->graph2, (long)cand1, (long)cand2);
-
-  if (result == NULL) {
-    /* Error in callback, return 0 */
-    PyErr_WriteUnraisable(data->node_compat_fn);
-    return 0;
-  }
-
-  retval = PyObject_IsTrue(result);
-  Py_DECREF(result);
-
-  return retval;
-}
-
-igraph_bool_t igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn(
-    const igraph_t *graph1, const igraph_t *graph2,
-    const igraph_integer_t cand1, const igraph_integer_t cand2,
-    void* extra) {
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t* data =
-    (igraphmodule_i_Graph_isomorphic_vf2_callback_data_t*)extra;
-  igraph_bool_t retval;
-  PyObject *result;
-
-  result = PyObject_CallFunction(data->edge_compat_fn, "OOll",
-      data->graph1, data->graph2, (long)cand1, (long)cand2);
-
-  if (result == NULL) {
-    /* Error in callback, return 0 */
-    PyErr_WriteUnraisable(data->edge_compat_fn);
-    return 0;
-  }
-
-  retval = PyObject_IsTrue(result);
-  Py_DECREF(result);
-
-  return retval;
-}
-
-/** \ingroup python_interface_graph
- * \brief Determines whether the graph is isomorphic to another graph,
- *   using the VF2 isomorphism algorithm
- *
- * The actual code is almost the same as igraphmodule_Graph_subisomorphic.
- * Be sure to correct bugs in both interfaces if applicable!
- *
- * \sa igraph_isomorphic_vf2
- */
-PyObject *igraphmodule_Graph_isomorphic_vf2(igraphmodule_GraphObject * self,
-                                            PyObject * args, PyObject * kwds)
-{
-  igraph_bool_t result = 0;
-  PyObject *o=Py_None, *return1=Py_False, *return2=Py_False;
-  PyObject *color1_o=Py_None, *color2_o=Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *callback_fn=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  igraphmodule_GraphObject *other;
-  igraph_vector_t mapping_12, mapping_21;
-  igraph_vector_t *map12=0, *map21=0;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-  int retval;
-
-  static char *kwlist[] = {
-    "other", "color1", "color2", "edge_color1", "edge_color2",
-    "return_mapping_12", "return_mapping_21", "callback",
-    "node_compat_fn", "edge_compat_fn", NULL
-  };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|O!OOOOOOOOO", kwlist, &igraphmodule_GraphType, &o,
-       &color1_o, &color2_o, &edge_color1, &edge_color2, &return1, &return2,
-       &callback_fn, &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  if (o == Py_None)
-    other=self;
-  else
-    other=(igraphmodule_GraphObject*)o;
-
-  if (callback_fn != Py_None && !PyCallable_Check(callback_fn)) {
-    PyErr_SetString(PyExc_TypeError, "callback must be None or callable");
-    return NULL;
-  }
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(return1)) {
-	igraph_vector_init(&mapping_12, 0);
-	map12 = &mapping_12;
-  }
-  if (PyObject_IsTrue(return2)) {
-	igraph_vector_init(&mapping_21, 0);
-	map21 = &mapping_21;
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = callback_fn == Py_None ? 0 : callback_fn;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (callback_data.callback_fn == 0) {
-    retval = igraph_isomorphic_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, &result, map12, map21,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data);
-  } else {
-    retval = igraph_isomorphic_function_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, map12, map21,
-        igraphmodule_i_Graph_isomorphic_vf2_callback_fn,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data);
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  if (retval) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (!map12 && !map21) {
-    if (result) Py_RETURN_TRUE;
-    Py_RETURN_FALSE;
-  } else {
-	PyObject *m1, *m2;
-	if (map12) {
-	  m1 = igraphmodule_vector_t_to_PyList(map12, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map12);
-	  if (!m1) {
-		if (map21) igraph_vector_destroy(map21);
-		return NULL;
-	  }
-	} else { m1 = Py_None; Py_INCREF(m1); }
-	if (map21) {
-	  m2 = igraphmodule_vector_t_to_PyList(map21, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map21);
-	  if (!m2) {
-	    Py_DECREF(m1);
-		return NULL;
-	  }
-	} else { m2 = Py_None; Py_INCREF(m2); }
-	return Py_BuildValue("ONN", result ? Py_True : Py_False, m1, m2);
-  }
-}
-
-/** \ingroup python_interface_graph
- * \brief Counts the number of isomorphisms of two given graphs 
- *
- * The actual code is almost the same as igraphmodule_Graph_count_subisomorphisms.
- * Make sure you correct bugs in both interfaces if applicable!
- *
- * \sa igraph_count_isomorphisms_vf2
- */
-PyObject *igraphmodule_Graph_count_isomorphisms_vf2(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_integer_t result = 0;
-  PyObject *o = Py_None;
-  PyObject *color1_o=Py_None, *color2_o=Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  igraphmodule_GraphObject *other;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-
-  static char *kwlist[] = { "other", "color1", "color2", "edge_color1", "edge_color2",
-    "node_compat_fn", "edge_compat_fn", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|O!OOOOOO", kwlist, &igraphmodule_GraphType, &o,
-       &color1_o, &color2_o, &edge_color1_o, &edge_color2_o,
-       &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  if (o == Py_None)
-    other=self;
-  else
-    other=(igraphmodule_GraphObject*)o;
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = 0;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (igraph_count_isomorphisms_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, &result,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  return Py_BuildValue("l", (long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns all isomorphisms of two given graphs 
- *
- * The actual code is almost the same as igraphmodule_Graph_get_subisomorphisms.
- * Make sure you correct bugs in both interfaces if applicable!
- *
- * \sa igraph_get_isomorphisms_vf2
- */
-PyObject *igraphmodule_Graph_get_isomorphisms_vf2(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_vector_ptr_t result;
-  PyObject *o = Py_None;
-  PyObject *color1_o = Py_None, *color2_o = Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  PyObject *res;
-  igraphmodule_GraphObject *other;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-
-  static char *kwlist[] = { "other", "color1", "color2",
-    "edge_color1", "edge_color2", "node_compat_fn", "edge_compat_fn", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "|O!OOOOOO", kwlist, &igraphmodule_GraphType, &o,
-         &color1_o, &color2_o, &edge_color1_o, &edge_color2_o,
-         &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  if (o == Py_None)
-    other=self;
-  else
-    other=(igraphmodule_GraphObject*)o;
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-    return igraphmodule_handle_igraph_error();
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = 0;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (igraph_get_isomorphisms_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, &result,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data)) {
-    igraphmodule_handle_igraph_error();
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-    igraph_vector_ptr_destroy(&result);
-    return NULL;
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  res = igraphmodule_vector_ptr_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&result, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&result);
-
-  return res;
-}
-
-/** \ingroup python_interface_graph
- * \brief Determines whether a subgraph of the graph is isomorphic to another graph
- *
- * The actual code is almost the same as igraphmodule_Graph_isomorphic. Make sure
- * you correct bugs in both interfaces if applicable!
- *
- * \sa igraph_subisomorphic_vf2
- */
-PyObject *igraphmodule_Graph_subisomorphic_vf2(igraphmodule_GraphObject * self,
-                                        PyObject * args, PyObject * kwds)
-{
-  igraph_bool_t result = 0;
-  PyObject *o, *return1=Py_False, *return2=Py_False;
-  PyObject *color1_o=Py_None, *color2_o=Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *callback_fn=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  igraphmodule_GraphObject *other;
-  igraph_vector_t mapping_12, mapping_21, *map12=0, *map21=0;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-  int retval;
-
-  static char *kwlist[] = { "other", "color1", "color2", "edge_color1", "edge_color2",
-    "return_mapping_12", "return_mapping_21",
-    "callback", "node_compat_fn", "edge_compat_fn",
-    NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O!|OOOOOOOOO", kwlist, &igraphmodule_GraphType, &o,
-       &color1_o, &color2_o, &edge_color1_o, &edge_color2_o, &return1, &return2,
-       &callback_fn, &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  other=(igraphmodule_GraphObject*)o;
-
-  if (callback_fn != Py_None && !PyCallable_Check(callback_fn)) {
-    PyErr_SetString(PyExc_TypeError, "callback must be None or callable");
-    return NULL;
-  }
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(return1)) {
-	igraph_vector_init(&mapping_12, 0);
-	map12 = &mapping_12;
-  }
-  if (PyObject_IsTrue(return2)) {
-	igraph_vector_init(&mapping_21, 0);
-	map21 = &mapping_21;
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = callback_fn == Py_None ? 0 : callback_fn;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (callback_data.callback_fn == 0) {
-    retval = igraph_subisomorphic_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, &result, map12, map21,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data);
-  } else {
-    retval = igraph_subisomorphic_function_vf2(&self->g, &other->g,
-        color1, color2, edge_color1, edge_color2, map12, map21,
-        igraphmodule_i_Graph_isomorphic_vf2_callback_fn,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data);
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  if (retval) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (!map12 && !map21) {
-    if (result)
-      Py_RETURN_TRUE;
-    Py_RETURN_FALSE;
-  } else {
-	PyObject *m1, *m2;
-	if (map12) {
-	  m1 = igraphmodule_vector_t_to_PyList(map12, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map12);
-	  if (!m1) {
-		if (map21) igraph_vector_destroy(map21);
-		return NULL;
-	  }
-	} else {
-      m1 = Py_None; Py_INCREF(m1);
-    }
-	if (map21) {
-	  m2 = igraphmodule_vector_t_to_PyList(map21, IGRAPHMODULE_TYPE_INT);
-	  igraph_vector_destroy(map21);
-	  if (!m2) {
-	    Py_DECREF(m1);
-		return NULL;
-	  }
-	} else {
-      m2 = Py_None; Py_INCREF(m2);
-    }
-	return Py_BuildValue("ONN", result ? Py_True : Py_False, m1, m2);
-  }
-}
-
-/** \ingroup python_interface_graph
- * \brief Counts the number of subisomorphisms of two given graphs 
- *
- * The actual code is almost the same as igraphmodule_Graph_count_isomorphisms.
- * Make sure you correct bugs in both interfaces if applicable!
- *
- * \sa igraph_count_subisomorphisms_vf2
- */
-PyObject *igraphmodule_Graph_count_subisomorphisms_vf2(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_integer_t result = 0;
-  PyObject *o = Py_None;
-  PyObject *color1_o = Py_None, *color2_o = Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_GraphObject *other;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-
-  static char *kwlist[] = { "other", "color1", "color2", "edge_color1",
-    "edge_color2", "node_compat_fn", "edge_compat_fn", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O!|OOOOOO", kwlist, &igraphmodule_GraphType, &o,
-         &color1_o, &color2_o, &edge_color1_o, &edge_color2_o,
-         &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  other=(igraphmodule_GraphObject*)o;
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = 0;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (igraph_count_subisomorphisms_vf2(&self->g, &other->g, color1, color2,
-        edge_color1, edge_color2, &result,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data)) {
-    igraphmodule_handle_igraph_error();
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-    return NULL;
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  return Py_BuildValue("l", (long)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns all subisomorphisms of two given graphs 
- *
- * The actual code is almost the same as igraphmodule_Graph_get_isomorphisms.
- * Make sure you correct bugs in both interfaces if applicable!
- *
- * \sa igraph_get_isomorphisms_vf2
- */
-PyObject *igraphmodule_Graph_get_subisomorphisms_vf2(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  igraph_vector_ptr_t result;
-  PyObject *o;
-  PyObject *color1_o=Py_None, *color2_o=Py_None;
-  PyObject *edge_color1_o=Py_None, *edge_color2_o=Py_None;
-  PyObject *node_compat_fn=Py_None, *edge_compat_fn=Py_None;
-  PyObject *res;
-  igraphmodule_GraphObject *other;
-  igraph_vector_int_t *color1=0, *color2=0;
-  igraph_vector_int_t *edge_color1=0, *edge_color2=0;
-  igraphmodule_i_Graph_isomorphic_vf2_callback_data_t callback_data;
-
-  static char *kwlist[] = { "other", "color1", "color2", "edge_color1",
-    "edge_color2", "node_compat_fn", "edge_compat_fn", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O!|OOOOOO", kwlist, &igraphmodule_GraphType, &o,
-       &color1_o, &color2_o, &edge_color1_o, &edge_color2_o,
-       &node_compat_fn, &edge_compat_fn))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    return igraphmodule_handle_igraph_error();
-  }
-
-  other=(igraphmodule_GraphObject*)o;
-
-  if (node_compat_fn != Py_None && !PyCallable_Check(node_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "node_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (edge_compat_fn != Py_None && !PyCallable_Check(edge_compat_fn)) {
-    PyErr_SetString(PyExc_TypeError, "edge_compat_fn must be None or callable");
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_int_t(color1_o, self, &color1,
-	  ATTRIBUTE_TYPE_VERTEX)) return NULL;
-  if (igraphmodule_attrib_to_vector_int_t(color2_o, other, &color2,
-	  ATTRIBUTE_TYPE_VERTEX)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color1_o, self, &edge_color1,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    return NULL;
-  }
-  if (igraphmodule_attrib_to_vector_int_t(edge_color2_o, other, &edge_color2,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    return NULL;
-  }
-
-  callback_data.graph1 = (PyObject*)self;
-  callback_data.graph2 = (PyObject*)other;
-  callback_data.callback_fn = 0;
-  callback_data.node_compat_fn = node_compat_fn == Py_None ? 0 : node_compat_fn;
-  callback_data.edge_compat_fn = edge_compat_fn == Py_None ? 0 : edge_compat_fn;
-
-  if (igraph_get_subisomorphisms_vf2(&self->g, &other->g, color1, color2,
-        edge_color1, edge_color2, &result,
-        node_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_node_compat_fn,
-        edge_compat_fn == Py_None ? 0 : igraphmodule_i_Graph_isomorphic_vf2_edge_compat_fn,
-        &callback_data)) {
-    igraphmodule_handle_igraph_error();
-    if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-    if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-    if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-    if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-    igraph_vector_ptr_destroy(&result);
-    return NULL;
-  }
-
-  if (color1) { igraph_vector_int_destroy(color1); free(color1); }
-  if (color2) { igraph_vector_int_destroy(color2); free(color2); }
-  if (edge_color1) { igraph_vector_int_destroy(edge_color1); free(edge_color1); }
-  if (edge_color2) { igraph_vector_int_destroy(edge_color2); free(edge_color2); }
-
-  res = igraphmodule_vector_ptr_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&result, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&result);
-
-  return res;
-}
-
-/**********************************************************************
- * Graph attribute handling                                           *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Returns the number of graph attributes
- */
-Py_ssize_t igraphmodule_Graph_attribute_count(igraphmodule_GraphObject * self)
-{
-  return PyDict_Size(((PyObject **) self->g.attr)[ATTRHASH_IDX_GRAPH]);
-}
-
-/** \ingroup python_interface_graph
- * \brief Handles the subscript operator on the graph.
- * 
- * When the subscript is a string, returns the corresponding value of the
- * given attribute in the graph. When the subscript is a tuple of length
- * 2, retrieves the adjacency matrix representation of the graph between
- * some vertices.
- */
-PyObject *igraphmodule_Graph_mp_subscript(igraphmodule_GraphObject * self,
-                                          PyObject * s)
-{
-  PyObject *result = 0;
-
-  if (PyTuple_Check(s) && PyTuple_Size(s) >= 2) {
-    /* Adjacency matrix representation */
-    PyObject *ri = PyTuple_GET_ITEM(s, 0);
-    PyObject *ci = PyTuple_GET_ITEM(s, 1);
-    PyObject *attr;
-    
-    if (PyTuple_Size(s) == 2) {
-      attr = 0;
-    } else if (PyTuple_Size(s) == 3) {
-      attr = PyTuple_GET_ITEM(s, 2);
-    } else {
-      PyErr_SetString(PyExc_TypeError, "adjacency matrix indexing must use at most three arguments");
-      return 0;
-    }
-
-    return igraphmodule_Graph_adjmatrix_get_index(&self->g, ri, ci, attr);
-  }
-
-  /* Ordinary attribute retrieval */
-  result = PyDict_GetItem(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_GRAPH], s);
-  if (result) {
-    Py_INCREF(result);
-    return result;
-  }
-
-  /* result is NULL, check whether there was an error */
-  if (!PyErr_Occurred())
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-
-  return NULL;
-}
-
-/** \ingroup python_interface_graph
- * \brief Handles the subscript assignment operator on the graph.
- * 
- * If k is a string, sets the value of the corresponding attribute of the graph.
- * If k is a tuple of length 2, sets part of the adjacency matrix.
- *
- * \return 0 if everything's ok, -1 in case of error
- */
-int igraphmodule_Graph_mp_assign_subscript(igraphmodule_GraphObject * self,
-                                     PyObject * k, PyObject * v)
-{
-  PyObject* dict = ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_GRAPH];
-
-  if (PyTuple_Check(k) && PyTuple_Size(k) >= 2) {
-    /* Adjacency matrix representation */
-    PyObject *ri, *ci, *attr;
-    
-    if (v == NULL) {
-      PyErr_SetString(PyExc_NotImplementedError, "cannot delete parts "
-          "of the adjacency matrix of a graph");
-      return -1;
-    }
-
-    ri = PyTuple_GET_ITEM(k, 0);
-    ci = PyTuple_GET_ITEM(k, 1);
-
-    if (PyTuple_Size(k) == 2) {
-      attr = 0;
-    } else if (PyTuple_Size(k) == 3) {
-      attr = PyTuple_GET_ITEM(k, 2);
-    } else {
-      PyErr_SetString(PyExc_TypeError, "adjacency matrix indexing must use at most three arguments");
-      return 0;
-    }
-
-    return igraphmodule_Graph_adjmatrix_set_index(&self->g, ri, ci, attr, v);
-  }
-
-  /* Ordinary attribute setting/deletion */
-  if (v == NULL)
-    return PyDict_DelItem(dict, k);
-
-  if (PyDict_SetItem(dict, k, v) == -1)
-    return -1;
-  return 0;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the attribute list of the graph
- */
-PyObject *igraphmodule_Graph_attributes(igraphmodule_GraphObject * self)
-{
-  return PyDict_Keys(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_GRAPH]);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the attribute list of the graph's vertices
- */
-PyObject *igraphmodule_Graph_vertex_attributes(igraphmodule_GraphObject *
-                                               self)
-{
-  return PyDict_Keys(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_VERTEX]);
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the attribute list of the graph's edges
- */
-PyObject *igraphmodule_Graph_edge_attributes(igraphmodule_GraphObject * self)
-{
-  return PyDict_Keys(ATTR_STRUCT_DICT(&self->g)[ATTRHASH_IDX_EDGE]);
-}
-
-/**********************************************************************
- * Graph operations (union, intersection etc)                         *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Creates the disjoint union of two graphs (operator version)
- */
-PyObject *igraphmodule_Graph_disjoint_union(igraphmodule_GraphObject * self,
-                                            PyObject * other)
-{
-  PyObject *it;
-  igraphmodule_GraphObject *o, *result;
-  igraph_t g;
-
-  /* Did we receive an iterable? */
-  it = PyObject_GetIter(other);
-  if (it) {
-    /* Get all elements, store the graphs in an igraph_vector_ptr */
-    igraph_vector_ptr_t gs;
-    if (igraph_vector_ptr_init(&gs, 0)) {
-      Py_DECREF(it);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraph_vector_ptr_push_back(&gs, &self->g)) {
-      Py_DECREF(it);
-      igraph_vector_ptr_destroy(&gs);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraphmodule_append_PyIter_to_vector_ptr_t(it, &gs)) {
-      igraph_vector_ptr_destroy(&gs);
-      Py_DECREF(it);
-      return NULL;
-    }
-    Py_DECREF(it);
-
-    /* Create disjoint union */
-    if (igraph_disjoint_union_many(&g, &gs)) {
-      igraph_vector_ptr_destroy(&gs);
-      return igraphmodule_handle_igraph_error();
-    }
-
-    igraph_vector_ptr_destroy(&gs);
-  }
-  else {
-    PyErr_Clear();
-    if (!PyObject_TypeCheck(other, &igraphmodule_GraphType)) {
-      Py_INCREF(Py_NotImplemented);
-      return Py_NotImplemented;
-    }
-    o = (igraphmodule_GraphObject *) other;
-
-    if (igraph_disjoint_union(&g, &self->g, &o->g)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the union of two graphs (operator version)
- */
-PyObject *igraphmodule_Graph_union(igraphmodule_GraphObject * self,
-                                   PyObject * other)
-{
-  PyObject *it;
-  igraphmodule_GraphObject *o, *result;
-  igraph_t g;
-
-  /* Did we receive an iterable? */
-  it = PyObject_GetIter(other);
-  if (it) {
-    /* Get all elements, store the graphs in an igraph_vector_ptr */
-    igraph_vector_ptr_t gs;
-    if (igraph_vector_ptr_init(&gs, 0)) {
-      Py_DECREF(it);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraph_vector_ptr_push_back(&gs, &self->g)) {
-      Py_DECREF(it);
-      igraph_vector_ptr_destroy(&gs);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraphmodule_append_PyIter_to_vector_ptr_t(it, &gs)) {
-      Py_DECREF(it);
-      igraph_vector_ptr_destroy(&gs);
-      return NULL;
-    }
-    Py_DECREF(it);
-
-    /* Create union */
-    if (igraph_union_many(&g, &gs)) {
-      igraph_vector_ptr_destroy(&gs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vector_ptr_destroy(&gs);
-  }
-  else {
-    PyErr_Clear();
-    if (!PyObject_TypeCheck(other, &igraphmodule_GraphType)) {
-      Py_INCREF(Py_NotImplemented);
-      return Py_NotImplemented;
-    }
-    o = (igraphmodule_GraphObject *) other;
-
-    if (igraph_union(&g, &self->g, &o->g)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the intersection of two graphs (operator version)
- */
-PyObject *igraphmodule_Graph_intersection(igraphmodule_GraphObject * self,
-                                          PyObject * other)
-{
-  PyObject *it;
-  igraphmodule_GraphObject *o, *result;
-  igraph_t g;
-
-  /* Did we receive an iterable? */
-  it = PyObject_GetIter(other);
-  if (it) {
-    /* Get all elements, store the graphs in an igraph_vector_ptr */
-    igraph_vector_ptr_t gs;
-    if (igraph_vector_ptr_init(&gs, 0)) {
-      Py_DECREF(it);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraph_vector_ptr_push_back(&gs, &self->g)) {
-      Py_DECREF(it);
-      igraph_vector_ptr_destroy(&gs);
-      return igraphmodule_handle_igraph_error();
-    }
-    if (igraphmodule_append_PyIter_to_vector_ptr_t(it, &gs)) {
-      Py_DECREF(it);
-      igraph_vector_ptr_destroy(&gs);
-      return NULL;
-    }
-    Py_DECREF(it);
-
-    /* Create union */
-    if (igraph_intersection_many(&g, &gs)) {
-      igraph_vector_ptr_destroy(&gs);
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    igraph_vector_ptr_destroy(&gs);
-  }
-  else {
-    PyErr_Clear();
-    if (!PyObject_TypeCheck(other, &igraphmodule_GraphType)) {
-      Py_INCREF(Py_NotImplemented);
-      return Py_NotImplemented;
-    }
-    o = (igraphmodule_GraphObject *) other;
-
-    if (igraph_intersection(&g, &self->g, &o->g)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the difference of two graphs (operator version)
- */
-PyObject *igraphmodule_Graph_difference(igraphmodule_GraphObject * self,
-                                        PyObject * other)
-{
-  igraphmodule_GraphObject *o, *result;
-  igraph_t g;
-
-  if (!PyObject_TypeCheck(other, &igraphmodule_GraphType)) {
-    Py_INCREF(Py_NotImplemented);
-    return Py_NotImplemented;
-  }
-  o = (igraphmodule_GraphObject *) other;
-
-  if (igraph_difference(&g, &self->g, &o->g)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the complementer of a graph
- */
-PyObject *igraphmodule_Graph_complementer(igraphmodule_GraphObject * self,
-                                          PyObject * args)
-{
-  igraphmodule_GraphObject *result;
-  PyObject *o = Py_True;
-  igraph_t g;
-
-  if (!PyArg_ParseTuple(args, "|O", &o))
-    return NULL;
-  if (igraph_complementer(&g, &self->g, PyObject_IsTrue(o))) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the complementer of a graph (operator version)
- */
-PyObject *igraphmodule_Graph_complementer_op(igraphmodule_GraphObject * self)
-{
-  igraphmodule_GraphObject *result;
-  igraph_t g;
-
-  if (igraph_complementer(&g, &self->g, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Creates the composition of two graphs
- */
-PyObject *igraphmodule_Graph_compose(igraphmodule_GraphObject * self,
-                                     PyObject * other)
-{
-  igraphmodule_GraphObject *o, *result;
-  igraph_t g;
-
-  if (!PyObject_TypeCheck(other, &igraphmodule_GraphType)) {
-    Py_INCREF(Py_NotImplemented);
-    return Py_NotImplemented;
-  }
-  o = (igraphmodule_GraphObject *) other;
-
-  if (igraph_compose(&g, &self->g, &o->g)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  /* this is correct as long as attributes are not copied by the
-   * operator. if they are copied, the initialization should not empty
-   * the attribute hashes */
-  CREATE_GRAPH(result, g);
-
-  return (PyObject *) result;
-}
-
-/**********************************************************************
- * Graph traversal algorithms                                         *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Conducts a breadth first search (BFS) on the graph
- */
-PyObject *igraphmodule_Graph_bfs(igraphmodule_GraphObject * self,
-                                 PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "vid", "mode", NULL };
-  long vid;
-  PyObject *l1, *l2, *l3, *result, *mode_o=Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  igraph_vector_t vids;
-  igraph_vector_t layers;
-  igraph_vector_t parents;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "l|O", kwlist, &vid, &mode_o))
-    return NULL;
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-
-  if (igraph_vector_init(&vids, igraph_vcount(&self->g))) 
-    return igraphmodule_handle_igraph_error();
-  if (igraph_vector_init(&layers, igraph_vcount(&self->g))) {
-    igraph_vector_destroy(&vids);
-    return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_vector_init(&parents, igraph_vcount(&self->g))) {
-    igraph_vector_destroy(&vids); igraph_vector_destroy(&parents);
-    return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_i_bfs
-      (&self->g, (igraph_integer_t) vid, mode, &vids, &layers, &parents)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  l1 = igraphmodule_vector_t_to_PyList(&vids, IGRAPHMODULE_TYPE_INT);
-  l2 = igraphmodule_vector_t_to_PyList(&layers, IGRAPHMODULE_TYPE_INT);
-  l3 = igraphmodule_vector_t_to_PyList(&parents, IGRAPHMODULE_TYPE_INT);
-  if (l1 && l2 && l3) {
-    result = Py_BuildValue("NNN", l1, l2, l3);    /* references stolen */
-  } else {
-    if (l1) { Py_DECREF(l1); }
-    if (l2) { Py_DECREF(l2); }
-    if (l3) { Py_DECREF(l3); }
-    result = NULL;
-  }
-  igraph_vector_destroy(&vids);
-  igraph_vector_destroy(&layers);
-  igraph_vector_destroy(&parents);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Constructs a breadth first search (BFS) iterator of the graph
- */
-PyObject *igraphmodule_Graph_bfsiter(igraphmodule_GraphObject * self,
-                                     PyObject * args, PyObject * kwds)
-{
-  char *kwlist[] = { "vid", "mode", "advanced", NULL };
-  PyObject *root, *adv = Py_False, *mode_o = Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-
-  if (!PyArg_ParseTupleAndKeywords
-      (args, kwds, "O|OO", kwlist, &root, &mode_o, &adv))
-    return NULL;
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-  return igraphmodule_BFSIter_new(self, root, mode, PyObject_IsTrue(adv));
-}
-
-/** \ingroup python_interface_graph
- * \brief Unfolds a graph into a tree using BFS
- */
-PyObject *igraphmodule_Graph_unfold_tree(igraphmodule_GraphObject * self,
-                                 PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "roots", "mode", NULL };
-  igraphmodule_GraphObject *result_o;
-  PyObject *mapping_o, *mode_o=Py_None, *roots_o=Py_None;
-  igraph_neimode_t mode = IGRAPH_OUT;
-  igraph_vs_t vs;
-  igraph_vector_t mapping, vids;
-  igraph_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &roots_o, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-  if (igraphmodule_PyObject_to_vs_t(roots_o, &vs, &self->g, 0, 0)) return NULL;
-
-  if (igraph_vector_init(&mapping, igraph_vcount(&self->g))) {
-    igraph_vs_destroy(&vs);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_init(&vids, 0)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&mapping);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vs_as_vector(&self->g, vs, &vids)) {
-    igraph_vs_destroy(&vs);
-    igraph_vector_destroy(&vids);
-    igraph_vector_destroy(&mapping);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vs_destroy(&vs);
-
-  if (igraph_unfold_tree(&self->g, &result, mode, &vids, &mapping)) {
-    igraph_vector_destroy(&vids);
-    igraph_vector_destroy(&mapping);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  igraph_vector_destroy(&vids);
-
-  mapping_o = igraphmodule_vector_t_to_PyList(&mapping, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&mapping);
-
-  if (!mapping_o) {
-    igraph_destroy(&result);
-    return NULL;
-  }
-
-  CREATE_GRAPH(result_o, result);
-
-  return Py_BuildValue("NN", result_o, mapping_o);
-}
-
-/**********************************************************************
- * Maximum flows                                                      *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates the value of the maximum flow in the graph
- */
-PyObject *igraphmodule_Graph_maxflow_value(igraphmodule_GraphObject * self,
-                                           PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", "capacity", NULL };
-  PyObject *capacity_object = Py_None;
-  igraph_vector_t capacity_vector;
-  igraph_real_t result;
-  long int vid1 = -1, vid2 = -1;
-  igraph_integer_t v1, v2;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|O", kwlist,
-                                   &vid1, &vid2, &capacity_object))
-    return NULL;
-
-  v1 = (igraph_integer_t) vid1;
-  v2 = (igraph_integer_t) vid2;
-  if (igraphmodule_PyObject_to_attribute_values(capacity_object,
-                                                &capacity_vector,
-                                                self, ATTRHASH_IDX_EDGE, 1.0))
-    return igraphmodule_handle_igraph_error();
-
-
-  if (igraph_maxflow_value(&self->g, &result, v1, v2, &capacity_vector)) {
-    igraph_vector_destroy(&capacity_vector);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vector_destroy(&capacity_vector);
-  return Py_BuildValue("d", (double)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the maximum flow of the graph
- */
-PyObject *igraphmodule_Graph_maxflow(igraphmodule_GraphObject * self,
-                                     PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", "capacity", NULL };
-  PyObject *capacity_object = Py_None, *flow_o, *cut_o, *partition_o;
-  igraph_vector_t capacity_vector;
-  igraph_real_t result;
-  long int vid1 = -1, vid2 = -1;
-  igraph_integer_t v1, v2;
-  igraph_vector_t flow, cut, partition;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "ll|O", kwlist,
-                                   &vid1, &vid2, &capacity_object))
-    return NULL;
-
-  v1 = (igraph_integer_t) vid1;
-  v2 = (igraph_integer_t) vid2;
-  if (igraphmodule_PyObject_to_attribute_values(capacity_object,
-                                                &capacity_vector,
-                                                self, ATTRHASH_IDX_EDGE, 1.0))
-    return igraphmodule_handle_igraph_error();
-
-  if (igraph_vector_init(&flow, 0)) {
-    igraph_vector_destroy(&capacity_vector);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_init(&cut, 0)) {
-    igraph_vector_destroy(&capacity_vector);
-    igraph_vector_destroy(&flow);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_init(&partition, 0)) {
-    igraph_vector_destroy(&capacity_vector);
-    igraph_vector_destroy(&flow);
-    igraph_vector_destroy(&cut);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_maxflow(&self->g, &result, &flow, &cut, &partition, 0,
-        v1, v2, &capacity_vector)) {
-    igraph_vector_destroy(&capacity_vector);
-    igraph_vector_destroy(&flow);
-    igraph_vector_destroy(&cut);
-    igraph_vector_destroy(&partition);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vector_destroy(&capacity_vector);
-
-  flow_o = igraphmodule_vector_t_to_PyList(&flow, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&flow);
-  
-  if (flow_o == NULL) {
-    igraph_vector_destroy(&cut);
-    igraph_vector_destroy(&partition);
-    return NULL;
-  }
-
-  cut_o = igraphmodule_vector_t_to_PyList(&cut, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&cut);
-  
-  if (cut_o == NULL) {
-    igraph_vector_destroy(&partition);
-    return NULL;
-  }
-
-  partition_o = igraphmodule_vector_t_to_PyList(&partition, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&partition);
-  
-  if (partition_o == NULL)
-    return NULL;
-
-  return Py_BuildValue("dOOO", (double)result, flow_o, cut_o, partition_o);
-}
-
-/**********************************************************************
- * Minimum cuts (edge separators)                                     *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates all s-t cuts in a graph
- */
-PyObject *igraphmodule_Graph_all_st_cuts(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", NULL };
-  igraph_integer_t source, target;
-  igraph_vector_ptr_t cuts, partition1s;
-  PyObject *source_o, *target_o;
-  PyObject *cuts_o, *partition1s_o;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO", kwlist,
-                                   &source_o, &target_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(source_o, &source, &self->g))
-    return NULL;
-  if (igraphmodule_PyObject_to_vid(target_o, &target, &self->g))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&partition1s, 0)) {
-	return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_vector_ptr_init(&cuts, 0)) {
-    igraph_vector_ptr_destroy(&partition1s);
-	return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_all_st_cuts(&self->g, &cuts, &partition1s,
-        source, target)) {
-    igraph_vector_ptr_destroy(&cuts);
-    igraph_vector_ptr_destroy(&partition1s);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&cuts, igraph_vector_destroy);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&partition1s, igraph_vector_destroy);
-
-  cuts_o = igraphmodule_vector_ptr_t_to_PyList(&cuts, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_ptr_destroy_all(&cuts);
-  if (cuts_o == NULL) {
-    igraph_vector_ptr_destroy_all(&partition1s);
-    return NULL;
-  }
-
-  partition1s_o = igraphmodule_vector_ptr_t_to_PyList(&partition1s, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_ptr_destroy_all(&partition1s);
-  if (partition1s_o == NULL)
-    return NULL;
-
-  return Py_BuildValue("NN", cuts_o, partition1s_o);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates all minimum s-t cuts in a graph
- */
-PyObject *igraphmodule_Graph_all_st_mincuts(igraphmodule_GraphObject * self,
-                                         PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", "capacity", NULL };
-  igraph_integer_t source, target;
-  igraph_real_t value;
-  igraph_vector_ptr_t cuts, partition1s;
-  igraph_vector_t capacity_vector;
-  PyObject *source_o, *target_o, *capacity_o = Py_None;
-  PyObject *cuts_o, *partition1s_o;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OOO", kwlist,
-                                   &source_o, &target_o, &capacity_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vid(source_o, &source, &self->g))
-    return NULL;
-  if (igraphmodule_PyObject_to_vid(target_o, &target, &self->g))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&partition1s, 0)) {
-	return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_vector_ptr_init(&cuts, 0)) {
-    igraph_vector_ptr_destroy(&partition1s);
-	return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraphmodule_PyObject_to_attribute_values(capacity_o,
-                                                &capacity_vector,
-                                                self, ATTRHASH_IDX_EDGE, 1.0)) {
-    igraph_vector_ptr_destroy(&cuts);
-    igraph_vector_ptr_destroy(&partition1s);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_all_st_mincuts(&self->g, &value, &cuts, &partition1s,
-        source, target, &capacity_vector)) {
-    igraph_vector_ptr_destroy(&cuts);
-    igraph_vector_ptr_destroy(&partition1s);
-    igraph_vector_destroy(&capacity_vector);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vector_destroy(&capacity_vector);
-
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&cuts, igraph_vector_destroy);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&partition1s, igraph_vector_destroy);
-
-  cuts_o = igraphmodule_vector_ptr_t_to_PyList(&cuts, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_ptr_destroy_all(&cuts);
-  if (cuts_o == NULL) {
-    igraph_vector_ptr_destroy_all(&partition1s);
-    return NULL;
-  }
-
-  partition1s_o = igraphmodule_vector_ptr_t_to_PyList(&partition1s, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_ptr_destroy_all(&partition1s);
-  if (partition1s_o == NULL)
-    return NULL;
-
-  return Py_BuildValue("dNN", (double)value, cuts_o, partition1s_o);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates the value of the minimum cut in the graph
- */
-PyObject *igraphmodule_Graph_mincut_value(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "source", "target", "capacity", NULL };
-  PyObject *capacity_object = Py_None;
-  igraph_vector_t capacity_vector;
-  igraph_real_t result, mincut;
-  igraph_integer_t v1, v2;
-  long vid1 = -1, vid2 = -1;
-  long n;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|llO", kwlist,
-                                   &vid1, &vid2, &capacity_object))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_attribute_values(capacity_object,
-                                                &capacity_vector,
-                                                self, ATTRHASH_IDX_EDGE, 1.0))
-    return igraphmodule_handle_igraph_error();
-
-  v1 = (igraph_integer_t) vid1;
-  v2 = (igraph_integer_t) vid2;
-  if (v1 == -1 && v2 == -1) {
-    if (igraph_mincut_value(&self->g, &result, &capacity_vector)) {
-      igraph_vector_destroy(&capacity_vector);
-      return igraphmodule_handle_igraph_error();
-    }
-  }
-  else if (v1 == -1) {
-    n = igraph_vcount(&self->g);
-    result = -1;
-    for (v1 = 0; v1 < n; v1++) {
-      if (v2 == v1)
-        continue;
-      if (igraph_st_mincut_value(&self->g, &mincut, v1, v2, &capacity_vector)) {
-        igraph_vector_destroy(&capacity_vector);
-        return igraphmodule_handle_igraph_error();
-      }
-      if (result < 0 || result > mincut)
-        result = mincut;
-    }
-    if (result < 0)
-      result = 0.0;
-  }
-  else if (v2 == -1) {
-    n = igraph_vcount(&self->g);
-    result = -1;
-    for (v2 = 0; v2 < n; v2++) {
-      if (v2 == v1)
-        continue;
-      if (igraph_st_mincut_value(&self->g, &mincut, v1, v2, &capacity_vector)) {
-        igraph_vector_destroy(&capacity_vector);
-        return igraphmodule_handle_igraph_error();
-      }
-      if (result < 0.0 || result > mincut)
-        result = mincut;
-    }
-    if (result < 0)
-      result = 0.0;
-  }
-  else {
-    if (igraph_st_mincut_value(&self->g, &result, v1, v2, &capacity_vector)) {
-      igraph_vector_destroy(&capacity_vector);
-      return igraphmodule_handle_igraph_error();
-    }
-  }
-
-  igraph_vector_destroy(&capacity_vector);
-  return Py_BuildValue("d", (double)result);
-}
-
-/** \ingroup python_interface_graph
- * \brief Calculates a minimum cut in a graph
- */
-PyObject *igraphmodule_Graph_mincut(igraphmodule_GraphObject * self,
-                                    PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "capacity", NULL };
-  PyObject *capacity_object = Py_None, *cut_o, *part_o, *part2_o, *result;
-  igraph_vector_t capacity_vector;
-  igraph_real_t value;
-  igraph_vector_t partition, partition2, cut;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist,
-                                   &capacity_object))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_attribute_values(capacity_object,
-                                                &capacity_vector,
-                                                self, ATTRHASH_IDX_EDGE, 1.0))
-    return igraphmodule_handle_igraph_error();
-
-  if (igraph_vector_init(&partition, 0)) {
-    igraph_vector_destroy(&capacity_vector);
-	return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_vector_init(&partition2, 0)) {
-    igraph_vector_destroy(&partition);
-    igraph_vector_destroy(&capacity_vector);
-	return igraphmodule_handle_igraph_error();
-  }
-  if (igraph_vector_init(&cut, 0)) {
-    igraph_vector_destroy(&partition);
-    igraph_vector_destroy(&partition2);
-    igraph_vector_destroy(&capacity_vector);
-	return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_mincut(&self->g, &value, &partition, &partition2,
-      &cut, &capacity_vector)) {
-    igraph_vector_destroy(&cut);
-    igraph_vector_destroy(&partition);
-    igraph_vector_destroy(&partition2);
-    igraph_vector_destroy(&capacity_vector);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  igraph_vector_destroy(&capacity_vector);
-
-  cut_o=igraphmodule_vector_t_to_PyList(&cut, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&cut);
-  if (!cut_o) {
-    igraph_vector_destroy(&partition);
-    igraph_vector_destroy(&partition2);
-	return 0;
-  }
-
-  part_o=igraphmodule_vector_t_to_PyList(&partition, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&partition);
-  if (!part_o) {
-    Py_DECREF(cut_o);
-    igraph_vector_destroy(&partition2);
-    return 0;
-  }
-
-  part2_o=igraphmodule_vector_t_to_PyList(&partition2, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&partition2);
-  if (!part2_o) {
-    Py_DECREF(part_o);
-	Py_DECREF(cut_o);
-    return 0;
-  }
-
-  result = Py_BuildValue("dNNN", (double)value, cut_o, part_o, part2_o);
-  return result;
-}
-
-/**********************************************************************
- * Vertex separators                                                  *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Returns all minimal s-t separators of a graph
- */
-PyObject *igraphmodule_Graph_all_minimal_st_separators(
-    igraphmodule_GraphObject * self) {
-  PyObject* result_o;
-  igraph_vector_ptr_t result;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_all_minimal_st_separators(&self->g, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_ptr_destroy(&result);
-    return NULL;
-  }
-
-  result_o = igraphmodule_vector_ptr_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&result, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&result);
-
-  return result_o;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether a given vertex set is a vertex separator
- */
-PyObject *igraphmodule_Graph_is_separator(igraphmodule_GraphObject * self,
-                                          PyObject * args, PyObject * kwds)
-{
-  PyObject* list = Py_None;
-  igraph_bool_t result;
-  igraph_vs_t vs;
-
-  static char *kwlist[] = { "vertices", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, 0, 0)) {
-    return NULL;
-  }
-
-  if (igraph_is_separator(&self->g, vs, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vs);
-
-  if (result)
-    Py_RETURN_TRUE;
-  else
-    Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Checks whether a given vertex set is a minimal vertex separator
- */
-PyObject *igraphmodule_Graph_is_minimal_separator(igraphmodule_GraphObject * self,
-                                                  PyObject * args, PyObject * kwds)
-{
-  PyObject* list = Py_None;
-  igraph_bool_t result;
-  igraph_vs_t vs;
-
-  static char *kwlist[] = { "vertices", NULL };
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &list))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vs_t(list, &vs, &self->g, 0, 0)) {
-    return NULL;
-  }
-
-  if (igraph_is_minimal_separator(&self->g, vs, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vs_destroy(&vs);
-    return NULL;
-  }
-
-  igraph_vs_destroy(&vs);
-
-  if (result)
-    Py_RETURN_TRUE;
-  else
-    Py_RETURN_FALSE;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the minimum size separators of the graph
- */
-PyObject *igraphmodule_Graph_minimum_size_separators(
-    igraphmodule_GraphObject * self) {
-  PyObject* result_o;
-  igraph_vector_ptr_t result;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_minimum_size_separators(&self->g, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_ptr_destroy(&result);
-    return NULL;
-  }
-
-  result_o = igraphmodule_vector_ptr_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&result, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&result);
-
-  return result_o;
-}
-
-/**********************************************************************
- * Cohesive blocks                                                    *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Calculates the cohesive block structure of a graph
- */
-PyObject *igraphmodule_Graph_cohesive_blocks(igraphmodule_GraphObject *self,
-    PyObject *args, PyObject *kwds) {
-  PyObject *blocks_o, *cohesion_o, *parents_o, *result_o;
-  igraph_vector_ptr_t blocks;
-  igraph_vector_t cohesion, parents;
-
-  if (igraph_vector_ptr_init(&blocks, 0)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&cohesion, 0)) {
-    igraph_vector_ptr_destroy(&blocks);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_vector_init(&parents, 0)) {
-    igraph_vector_ptr_destroy(&blocks);
-    igraph_vector_destroy(&cohesion);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_cohesive_blocks(&self->g, &blocks, &cohesion, &parents, 0)) {
-    igraph_vector_ptr_destroy(&blocks);
-    igraph_vector_destroy(&cohesion);
-    igraph_vector_destroy(&parents);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  blocks_o = igraphmodule_vector_ptr_t_to_PyList(&blocks, IGRAPHMODULE_TYPE_INT);
-  IGRAPH_VECTOR_PTR_SET_ITEM_DESTRUCTOR(&blocks, igraph_vector_destroy);
-  igraph_vector_ptr_destroy_all(&blocks);
-  if (blocks_o == NULL) {
-    igraph_vector_destroy(&parents);
-    igraph_vector_destroy(&cohesion);
-    return NULL;
-  }
-
-  cohesion_o = igraphmodule_vector_t_to_PyList(&cohesion, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&cohesion);
-  if (cohesion_o == NULL) {
-    Py_DECREF(blocks_o);
-    igraph_vector_destroy(&parents);
-    return NULL;
-  }
-
-  parents_o = igraphmodule_vector_t_to_PyList(&parents, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&parents); 
-
-  if (parents_o == NULL) {
-    Py_DECREF(blocks_o);
-    Py_DECREF(cohesion_o);
-    return NULL;
-  }
-
-  result_o = Py_BuildValue("NNN", blocks_o, cohesion_o, parents_o);
-  if (result_o == NULL) {
-    Py_DECREF(parents_o);
-    Py_DECREF(blocks_o);
-    Py_DECREF(cohesion_o);
-    return NULL;
-  }
-  return result_o;
-}
-
-/**********************************************************************
- * Cliques and independent sets                                       *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Find all or some cliques in a graph
- */
-PyObject *igraphmodule_Graph_cliques(igraphmodule_GraphObject * self,
-                                     PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "min", "max", NULL };
-  PyObject *list, *item;
-  long int min_size = 0, max_size = 0;
-  long int i, j, n;
-  igraph_vector_ptr_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|ll", kwlist,
-                                   &min_size, &max_size))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_cliques(&self->g, &result, (igraph_integer_t) min_size,
-        (igraph_integer_t) max_size)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (long)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Find all largest cliques in a graph
- */
-PyObject *igraphmodule_Graph_largest_cliques(igraphmodule_GraphObject * self)
-{
-  PyObject *list, *item;
-  long int i, j, n;
-  igraph_vector_ptr_t result;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_largest_cliques(&self->g, &result)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (long)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Finds a maximum matching in a bipartite graph
- */
-PyObject *igraphmodule_Graph_maximum_bipartite_matching(igraphmodule_GraphObject* self,
-    PyObject* args, PyObject* kwds) {
-  static char* kwlist[] = { "types", "weights", "eps", NULL };
-  PyObject *types_o = Py_None, *weights_o = Py_None, *result_o;
-  igraph_vector_bool_t* types = 0;
-  igraph_vector_t* weights = 0;
-  igraph_vector_long_t result;
-  double eps = -1;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|Od", kwlist, &types_o,
-        &weights_o, &eps))
-    return NULL;
-
-  if (eps < 0)
-    eps = DBL_EPSILON * 1000;
-
-  if (igraphmodule_attrib_to_vector_bool_t(types_o, self, &types, ATTRIBUTE_TYPE_VERTEX))
-	return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights, ATTRIBUTE_TYPE_EDGE)) {
-    if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-	return NULL;
-  }
-
-  if (igraph_vector_long_init(&result, 0)) {
-    if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-    if (weights != 0) { igraph_vector_destroy(weights); free(weights); }
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_maximum_bipartite_matching(&self->g, types, 0, 0, &result, weights, eps)) {
-    if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-    if (weights != 0) { igraph_vector_destroy(weights); free(weights); }
-    igraph_vector_long_destroy(&result);
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (types != 0) { igraph_vector_bool_destroy(types); free(types); }
-  if (weights != 0) { igraph_vector_destroy(weights); free(weights); }
-
-  result_o = igraphmodule_vector_long_t_to_PyList(&result);
-  igraph_vector_long_destroy(&result);
-
-  return result_o;
-}
-
-/** \ingroup python_interface_graph
- * \brief Find all maximal cliques in a graph
- */
-PyObject *igraphmodule_Graph_maximal_cliques(igraphmodule_GraphObject * self,
-    PyObject* args, PyObject* kwds) {
-  static char* kwlist[] = { "min", "max", NULL };
-  PyObject *list, *item;
-  long int i = 0, j = 0;
-  Py_ssize_t n;
-  igraph_vector_ptr_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|ll", kwlist, &i, &j))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_maximal_cliques(&self->g, &result, (igraph_integer_t) i, (igraph_integer_t) j)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (Py_ssize_t)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the clique number of the graph
- */
-PyObject *igraphmodule_Graph_clique_number(igraphmodule_GraphObject * self)
-{
-  PyObject *result;
-  igraph_integer_t i;
-
-  if (igraph_clique_number(&self->g, &i))
-    return igraphmodule_handle_igraph_error();
-
-  result = PyInt_FromLong((long)i);
-  return result;
-}
-
-/** \ingroup python_interface_graph
- * \brief Find all or some independent vertex sets in a graph
- */
-PyObject *igraphmodule_Graph_independent_vertex_sets(igraphmodule_GraphObject
-                                                     * self, PyObject * args,
-                                                     PyObject * kwds)
-{
-  static char *kwlist[] = { "min", "max", NULL };
-  PyObject *list, *item;
-  long int min_size = 0, max_size = 0;
-  long int i, j, n;
-  igraph_vector_ptr_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|ll", kwlist,
-                                   &min_size, &max_size))
-    return NULL;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_independent_vertex_sets(&self->g, &result,
-        (igraph_integer_t) min_size, (igraph_integer_t) max_size)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (long)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Find all largest independent_vertex_sets in a graph
- */
-PyObject
-  *igraphmodule_Graph_largest_independent_vertex_sets(igraphmodule_GraphObject
-                                                      * self)
-{
-  PyObject *list, *item;
-  long int i, j, n;
-  igraph_vector_ptr_t result;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_largest_independent_vertex_sets(&self->g, &result)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (long)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Find all maximal independent vertex sets in a graph
- */
-PyObject
-  *igraphmodule_Graph_maximal_independent_vertex_sets(igraphmodule_GraphObject
-                                                      * self)
-{
-  PyObject *list, *item;
-  long int i, j, n;
-  igraph_vector_ptr_t result;
-
-  if (igraph_vector_ptr_init(&result, 0)) {
-    PyErr_SetString(PyExc_MemoryError, "");
-    return NULL;
-  }
-
-  if (igraph_maximal_independent_vertex_sets(&self->g, &result)) {
-    igraph_vector_ptr_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  n = (long)igraph_vector_ptr_size(&result);
-  list = PyList_New(n);
-  if (!list)
-    return NULL;
-
-  for (i = 0; i < n; i++) {
-    igraph_vector_t *vec = (igraph_vector_t *) VECTOR(result)[i];
-    item = igraphmodule_vector_t_to_PyTuple(vec);
-    if (!item) {
-      for (j = i; j < n; j++)
-        igraph_vector_destroy((igraph_vector_t *) VECTOR(result)[j]);
-      igraph_vector_ptr_destroy_all(&result);
-      Py_DECREF(list);
-      return NULL;
-    }
-    else {
-      PyList_SET_ITEM(list, i, item);
-    }
-    igraph_vector_destroy(vec);
-  }
-  igraph_vector_ptr_destroy_all(&result);
-
-  return list;
-}
-
-/** \ingroup python_interface_graph
- * \brief Returns the independence number of the graph
- */
-PyObject *igraphmodule_Graph_independence_number(igraphmodule_GraphObject *
-                                                 self)
-{
-  PyObject *result;
-  igraph_integer_t i;
-
-  if (igraph_independence_number(&self->g, &i))
-    return igraphmodule_handle_igraph_error();
-
-  result = PyInt_FromLong((long)i);
-  return result;
-}
-
-/**********************************************************************
- * K-core decomposition                                               *
- **********************************************************************/
-
-/** \ingroup python_interface_graph
- * \brief Returns the corenesses of the graph vertices
- * \return a new PyCObject
- */
-PyObject *igraphmodule_Graph_coreness(igraphmodule_GraphObject * self,
-                                      PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "mode", NULL };
-  igraph_neimode_t mode = IGRAPH_ALL;
-  igraph_vector_t result;
-  PyObject *o, *mode_o = Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &mode_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_neimode_t(mode_o, &mode)) return NULL;
-
-  if (igraph_vector_init(&result, igraph_vcount(&self->g)))
-    return igraphmodule_handle_igraph_error();
-
-  if (igraph_coreness(&self->g, &result, mode)) {
-    igraph_vector_destroy(&result);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  o = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  return o;
-}
-
-/**********************************************************************
- * Community structure detection and related routines                 *
- **********************************************************************/
-
-/**
- * Modularity calculation
- */
-PyObject *igraphmodule_Graph_modularity(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = {"membership", "weights", 0};
-  igraph_vector_t membership;
-  igraph_vector_t *weights=0;
-  igraph_real_t modularity;
-  PyObject *mvec, *wvec=Py_None;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist, &mvec, &wvec))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(mvec, &membership, 1, 0)) return NULL;
-  if (igraphmodule_attrib_to_vector_t(wvec, self, &weights, ATTRIBUTE_TYPE_EDGE)){
-    igraph_vector_destroy(&membership);
-    return NULL;
-  }
-  if (igraph_modularity(&self->g, &membership, &modularity, weights)) {
-    igraph_vector_destroy(&membership);
-    if (weights) { igraph_vector_destroy(weights); free(weights); }
-    return NULL;
-  }
-  igraph_vector_destroy(&membership);
-  if (weights) { igraph_vector_destroy(weights); free(weights); }
-  return Py_BuildValue("d", (double)modularity);
-}
-
-/**
- * Newman's edge betweenness method
- */
-PyObject *igraphmodule_Graph_community_edge_betweenness(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "directed", "weights", NULL };
-  PyObject *directed = Py_True;
-  PyObject *weights_o = Py_None;
-  PyObject *res, *qs, *ms;
-  igraph_matrix_t merges;
-  igraph_vector_t q;
-  igraph_vector_t *weights = 0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &directed, &weights_o))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) return NULL;
-
-  if (igraph_matrix_init(&merges, 0, 0)) {
-    if (weights != 0) {
-      igraph_vector_destroy(weights); free(weights);
-    }
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_vector_init(&q, 0)) {
-    igraph_matrix_destroy(&merges);
-    if (weights != 0) {
-      igraph_vector_destroy(weights); free(weights);
-    }
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (igraph_community_edge_betweenness(&self->g,
-        /* removed_edges = */ 0,
-        /* edge_betweenness = */ 0,
-        /* merges = */ &merges,
-        /* bridges = */ 0,
-        /* modularity = */ &q,
-        /* membership = */ 0,
-        PyObject_IsTrue(directed),
-        weights)) {
-    igraphmodule_handle_igraph_error();
-    if (weights != 0) {
-      igraph_vector_destroy(weights); free(weights);
-    }
-    igraph_matrix_destroy(&merges);
-    igraph_vector_destroy(&q);
-    return NULL;
-  }
-
-  if (weights != 0) {
-    igraph_vector_destroy(weights); free(weights);
-  }
-
-  qs=igraphmodule_vector_t_to_PyList(&q, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&q);
-  if (!qs) {
-    igraph_matrix_destroy(&merges);
-    return NULL;
-  }
-
-  ms=igraphmodule_matrix_t_to_PyList(&merges, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&merges);
-
-  if (ms == NULL) {
-    Py_DECREF(qs);
-    return NULL;
-  }
-
-  res=Py_BuildValue("NN", ms, qs); /* steals references */
-
-  return res;
-}
-
-/**
- * Newman's leading eigenvector method, precise implementation
- */
-PyObject *igraphmodule_Graph_community_leading_eigenvector(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "n", "arpack_options", NULL };
-  long int n=-1;
-  PyObject *cl, *res, *merges;
-  igraph_vector_t members;
-  igraph_matrix_t m;
-  igraph_real_t q;
-  igraphmodule_ARPACKOptionsObject *arpack_options;
-  PyObject *arpack_options_o = igraphmodule_arpack_options_default;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|lO!", kwlist,
-    &n, &igraphmodule_ARPACKOptionsType, &arpack_options_o)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&members, 0))
-    return igraphmodule_handle_igraph_error();
-
-  if (igraph_matrix_init(&m, 0, 0))
-    return igraphmodule_handle_igraph_error();
-
-  if (n<0)
-    n = igraph_vcount(&self->g);
-  else
-    n -= 1;
-
-  arpack_options = (igraphmodule_ARPACKOptionsObject*)arpack_options_o;
-  if (igraph_community_leading_eigenvector(&self->g, &m, &members, (igraph_integer_t) n,
-      igraphmodule_ARPACKOptions_get(arpack_options), &q, 0, 0, 0, 0, 0, 0)){
-    igraph_matrix_destroy(&m);
-    igraph_vector_destroy(&members);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  cl = igraphmodule_vector_t_to_PyList(&members, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&members);
-  if (cl == 0) {
-    igraph_matrix_destroy(&m);
-    return 0;
-  }
-
-  merges = igraphmodule_matrix_t_to_PyList(&m, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&m);
-  if (merges == 0)
-    return 0;
-
-  res=Py_BuildValue("NNd", cl, merges, (double)q);
-
-  return res;
-}
-
-/**
- * Clauset et al's greedy modularity optimization algorithm
- */
-PyObject *igraphmodule_Graph_community_fastgreedy(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "weights", NULL };
-  PyObject *ms, *qs, *res, *weights = Py_None;
-  igraph_matrix_t merges;
-  igraph_vector_t q, *ws=0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &weights)) {
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights, self, &ws, ATTRIBUTE_TYPE_EDGE))
-    return NULL;
-
-  igraph_matrix_init(&merges, 0, 0);
-  igraph_vector_init(&q, 0);
-  if (igraph_community_fastgreedy(&self->g, ws, &merges, &q, 0)) {
-    if (ws) {
-      igraph_vector_destroy(ws); free(ws);
-    }
-    igraph_vector_destroy(&q);
-    igraph_matrix_destroy(&merges);
-    return igraphmodule_handle_igraph_error();
-  }
-  if (ws) {
-    igraph_vector_destroy(ws); free(ws);
-  }
-
-  qs=igraphmodule_vector_t_to_PyList(&q, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&q);
-  if (!qs) {
-    igraph_matrix_destroy(&merges);
-    return NULL;
-  }
-
-  ms=igraphmodule_matrix_t_to_PyList(&merges, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&merges);
-
-  if (ms == NULL) {
-    Py_DECREF(qs);
-    return NULL;
-  }
-
-  res=Py_BuildValue("NN", ms, qs); /* steals references */
-
-  return res;
-}
-
-/**
- * Infomap community detection algorithm of Martin Rosvall and Carl T. Bergstrom,
- */
-PyObject *igraphmodule_Graph_community_infomap(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds)
-{
-  static char *kwlist[] = { "edge_weights", "vertex_weights", "trials", NULL };
-  PyObject *e_weights = Py_None, *v_weights = Py_None;
-  unsigned int nb_trials = 10;
-  igraph_vector_t *e_ws = 0, *v_ws = 0;
-  
-  igraph_vector_t membership;
-  PyObject *res = Py_False;
-  igraph_real_t codelength;
-  
-  
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOI", kwlist, &e_weights,
-        &v_weights, &nb_trials)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&membership, igraph_vcount(&self->g))) {
-	igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(e_weights, self, &e_ws, ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vector_destroy(&membership);
-    return NULL;
-  }
-  
-  if (igraphmodule_attrib_to_vector_t(v_weights, self, &v_ws, ATTRIBUTE_TYPE_VERTEX)){
-    igraph_vector_destroy(&membership);
-    if (e_ws) {
-      igraph_vector_destroy(e_ws);
-      free(e_ws);
-    }
-    return NULL;
-  }
-  
-  if (igraph_community_infomap(/*in */ &self->g, 
-                                    /*e_weight=*/ e_ws, /*v_weight=*/ v_ws,
-                                    /*nb_trials=*/nb_trials,
-                              /*out*/ &membership, &codelength)) {
-	igraphmodule_handle_igraph_error();
-	igraph_vector_destroy(&membership);
-    if (e_ws) {
-      igraph_vector_destroy(e_ws);
-      free(e_ws);
-    }
-    if (v_ws) {
-      igraph_vector_destroy(v_ws);
-      free(v_ws);
-    }
-    return NULL;
-  }
-  
-  if (e_ws) {
-    igraph_vector_destroy(e_ws);
-    free(e_ws);
-  }
-  
-  if (v_ws) {
-    igraph_vector_destroy(v_ws);
-    free(v_ws);
-  }
-  
-  res = igraphmodule_vector_t_to_PyList(&membership, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&membership);
-  
-  if (!res)
-	return NULL;
-  
-  return Py_BuildValue("Nd", res, (double)codelength);
-}
-
-
-/**
- * The label propagation algorithm of Raghavan et al
- */
-PyObject *igraphmodule_Graph_community_label_propagation(
-    igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] = { "weights", "initial", "fixed", NULL };
-  PyObject *weights_o = Py_None, *initial_o = Py_None, *fixed_o = Py_None;
-  PyObject *result;
-  igraph_vector_t membership, *ws = 0, *initial = 0;
-  igraph_vector_bool_t fixed;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OOO", kwlist, &weights_o, &initial_o, &fixed_o)) {
-    return NULL;
-  }
-
-  if (fixed_o != Py_None) {
-    if (igraphmodule_PyObject_to_vector_bool_t(fixed_o, &fixed))
-      return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &ws, ATTRIBUTE_TYPE_EDGE)) {
-    if (fixed_o != Py_None) igraph_vector_bool_destroy(&fixed);
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(initial_o, self, &initial, ATTRIBUTE_TYPE_VERTEX)){
-    if (fixed_o != Py_None) igraph_vector_bool_destroy(&fixed);
-    if (ws) { igraph_vector_destroy(ws); free(ws); }
-    return NULL;
-  }
-
-  igraph_vector_init(&membership, igraph_vcount(&self->g));
-  if (igraph_community_label_propagation(&self->g, &membership,
-        ws, initial, (fixed_o != Py_None ? &fixed : 0), 0)) {
-    if (fixed_o != Py_None) igraph_vector_bool_destroy(&fixed);
-    if (ws) { igraph_vector_destroy(ws); free(ws); }
-    if (initial) { igraph_vector_destroy(initial); free(initial); }
-    igraph_vector_destroy(&membership);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (fixed_o != Py_None) igraph_vector_bool_destroy(&fixed);
-  if (ws) { igraph_vector_destroy(ws); free(ws); }
-  if (initial) { igraph_vector_destroy(initial); free(initial); }
-
-  result=igraphmodule_vector_t_to_PyList(&membership, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&membership);
-
-  return result;
-}
-
-/**
- * Multilevel algorithm of Blondel et al
- */
-PyObject *igraphmodule_Graph_community_multilevel(igraphmodule_GraphObject *self,
-  PyObject *args, PyObject *kwds)
-{
-  static char *kwlist[] = { "weights", "return_levels", NULL };
-  PyObject *return_levels = Py_False;
-  PyObject *mss, *qs, *res, *weights = Py_None;
-  igraph_matrix_t memberships;
-  igraph_vector_t membership, modularity;
-  igraph_vector_t *ws;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OO", kwlist, &weights, &return_levels)) {
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights, self, &ws, ATTRIBUTE_TYPE_EDGE))
-    return NULL;
-
-  igraph_matrix_init(&memberships, 0, 0);
-  igraph_vector_init(&membership, 0);
-  igraph_vector_init(&modularity, 0);
-
-  if (igraph_community_multilevel(&self->g, ws, &membership, &memberships,
-        &modularity)) {
-    if (ws) { igraph_vector_destroy(ws); free(ws); }
-    igraph_vector_destroy(&membership);
-    igraph_vector_destroy(&modularity);
-    igraph_matrix_destroy(&memberships);
-    return igraphmodule_handle_igraph_error();
-  }
-
-  if (ws) { igraph_vector_destroy(ws); free(ws); }
-
-  qs=igraphmodule_vector_t_to_PyList(&modularity, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&modularity);
-  if (!qs) {
-    igraph_vector_destroy(&membership);
-    igraph_matrix_destroy(&memberships);
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(return_levels)) {
-    mss=igraphmodule_matrix_t_to_PyList(&memberships, IGRAPHMODULE_TYPE_INT);
-    if (!mss) {
-      res = mss;
-    } else {
-      res=Py_BuildValue("NN", mss, qs); /* steals references */
-    }
-  } else {
-    res=igraphmodule_vector_t_to_PyList(&membership, IGRAPHMODULE_TYPE_INT);
-  }
-
-  igraph_vector_destroy(&membership);
-  igraph_matrix_destroy(&memberships);
-
-  return res;
-}
-
-/**
- * Optimal modularity by integer programming
- */
-PyObject *igraphmodule_Graph_community_optimal_modularity(
-	igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "verbose", NULL };
-  igraph_real_t modularity;
-  igraph_vector_t membership;
-  PyObject *res, *verbose_o = Py_False;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|O", kwlist, &verbose_o)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&membership, igraph_vcount(&self->g))) {
-	igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraph_community_optimal_modularity(&self->g, &modularity, &membership,
-        PyObject_IsTrue(verbose_o))) {
-	igraphmodule_handle_igraph_error();
-	igraph_vector_destroy(&membership);
-    return NULL;
-  }
-
-  res = igraphmodule_vector_t_to_PyList(&membership, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&membership);
-
-  if (!res)
-	return NULL;
-
-  return Py_BuildValue("Nd", res, (double)modularity);
-}
-
-/**
- * Spinglass community detection method of Reichardt & Bornholdt
- */
-PyObject *igraphmodule_Graph_community_spinglass(igraphmodule_GraphObject *self,
-        PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = {"weights", "spins", "parupdate",
-      "start_temp", "stop_temp", "cool_fact", "update_rule",
-      "gamma", "implementation", "lambda_", NULL};
-  PyObject *weights_o = Py_None;
-  PyObject *parupdate_o = Py_False;
-  PyObject *update_rule_o = Py_None;
-  PyObject *impl_o = Py_None;
-  PyObject *res;
-
-  long int spins = 25;
-  double start_temp = 1.0;
-  double stop_temp = 0.01;
-  double cool_fact = 0.99;
-  igraph_spinglass_implementation_t impl = IGRAPH_SPINCOMM_IMP_ORIG;
-  igraph_spincomm_update_t update_rule = IGRAPH_SPINCOMM_UPDATE_CONFIG;
-  double gamma = 1;
-  double lambda = 1;
-  igraph_vector_t *weights = 0, membership;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|OlOdddOdOd", kwlist,
-        &weights_o, &spins, &parupdate_o, &start_temp, &stop_temp,
-        &cool_fact, &update_rule_o, &gamma, &impl_o, &lambda))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_spincomm_update_t(update_rule_o, &update_rule)) {
-    return NULL;
-  }
-
-  if (igraphmodule_PyObject_to_spinglass_implementation_t(impl_o, &impl)) {
-    return NULL;
-  }
-
-  if (igraph_vector_init(&membership, igraph_vcount(&self->g))) {
-	igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-
-  if (igraphmodule_attrib_to_vector_t(weights_o, self, &weights,
-	  ATTRIBUTE_TYPE_EDGE)) {
-    igraph_vector_destroy(&membership);
-    return NULL;
-  }
-
-  if (igraph_community_spinglass(&self->g, weights,
-              0, 0, &membership, 0, (igraph_integer_t) spins,
-              PyObject_IsTrue(parupdate_o),
-              start_temp, stop_temp, cool_fact,
-              update_rule, gamma, impl, lambda)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&membership);
-    if (weights != 0) {
-      igraph_vector_destroy(weights);
-      free(weights);
-    }
-    return NULL;
-  }
-
-  if (weights != 0) {
-    igraph_vector_destroy(weights);
-    free(weights);
-  }
-
-  res = igraphmodule_vector_t_to_PyList(&membership, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&membership);
-
-  return res;
-}
-
-/**
- * Walktrap community detection of Latapy & Pons
- */
-PyObject *igraphmodule_Graph_community_walktrap(igraphmodule_GraphObject * self,
-  PyObject * args, PyObject * kwds) {
-  static char *kwlist[] = { "weights", "steps", NULL };
-  PyObject *ms, *qs, *res, *weights = Py_None;
-  igraph_matrix_t merges;
-  int steps=4;
-  igraph_vector_t q, *ws=0;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "|Oi", kwlist, &weights,
-      &steps))
-    return NULL;
-
-  if (igraphmodule_attrib_to_vector_t(weights, self, &ws, ATTRIBUTE_TYPE_EDGE))
-    return NULL;
-
-  igraph_matrix_init(&merges, 0, 0);
-  igraph_vector_init(&q, 0);
-
-  if (igraph_community_walktrap(&self->g, ws, steps, &merges, &q, 0)) {
-    if (ws) {
-      igraph_vector_destroy(ws); free(ws);
-    }
-    igraph_vector_destroy(&q);
-    igraph_matrix_destroy(&merges);
-    return igraphmodule_handle_igraph_error();
-  }
-  if (ws) {
-    igraph_vector_destroy(ws); free(ws);
-  }
-
-  qs = igraphmodule_vector_t_to_PyList(&q, IGRAPHMODULE_TYPE_FLOAT);
-  igraph_vector_destroy(&q);
-  if (!qs) {
-    igraph_matrix_destroy(&merges);
-    return NULL;
-  }
-
-  ms = igraphmodule_matrix_t_to_PyList(&merges, IGRAPHMODULE_TYPE_INT);
-  igraph_matrix_destroy(&merges);
-
-  if (ms == NULL) {
-    Py_DECREF(qs);
-    return NULL;
-  }
-
-  res=Py_BuildValue("NN", ms, qs); /* steals references */
-
-  return res;
-}
-
-/* }}} */
-
-/**********************************************************************
- * Special internal methods that you won't need to mess around with   *
- **********************************************************************/
-
-/** \defgroup python_interface_internal Internal functions
- * \ingroup python_interface */
-
-#ifdef IGRAPH_PYTHON3
-PyObject *igraphmodule_Graph___graph_as_capsule__(igraphmodule_GraphObject *
-                                                  self, PyObject * args,
-                                                  PyObject * kwds)
-{
-  return PyCapsule_New((void *)&self->g, 0, 0);
-}
-#else
-/** \ingroup python_interface_internal
- * \brief Returns the encapsulated igraph graph as a PyCObject
- * \return a new PyCObject
- */
-PyObject *igraphmodule_Graph___graph_as_cobject__(igraphmodule_GraphObject *
-                                                  self, PyObject * args,
-                                                  PyObject * kwds)
-{
-  return PyCObject_FromVoidPtr((void *)&self->g, 0);
-}
-#endif
-
-/** \ingroup python_interface_internal
- * \brief Registers a destructor to be called when the object is destroyed
- * \return the previous destructor (if any)
- * Unimplemented.
- */
-PyObject *igraphmodule_Graph___register_destructor__(igraphmodule_GraphObject
-                                                     * self, PyObject * args,
-                                                     PyObject * kwds)
-{
-  char *kwlist[] = { "destructor", NULL };
-  PyObject *destructor = NULL, *result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O", kwlist, &destructor))
-    return NULL;
-
-  if (!PyCallable_Check(destructor)) {
-    PyErr_SetString(PyExc_TypeError, "The destructor must be callable!");
-    return NULL;
-  }
-
-  result = self->destructor;
-  self->destructor = destructor;
-  Py_INCREF(self->destructor);
-
-  if (!result)
-    Py_RETURN_NONE;
-
-  return result;
-}
-
-/** \ingroup python_interface
- * \brief Member list of the \c igraph.Graph object type
- */
-#define OFF(x) offsetof(igraphmodule_GraphObject, x)
-
-/** \ingroup python_interface
- * \brief Method list of the \c igraph.Graph object type
- */
-struct PyMethodDef igraphmodule_Graph_methods[] = {
-  ////////////////////////////
-  // BASIC IGRAPH INTERFACE //
-  ////////////////////////////
-
-  // interface to igraph_vcount
-  {"vcount", (PyCFunction) igraphmodule_Graph_vcount,
-   METH_NOARGS,
-   "vcount()\n\n"
-   "Counts the number of vertices.\n"
-   "@return: the number of vertices in the graph.\n" "@rtype: integer"},
-
-  // interface to igraph_ecount
-  {"ecount", (PyCFunction) igraphmodule_Graph_ecount,
-   METH_NOARGS,
-   "ecount()\n\n"
-   "Counts the number of edges.\n"
-   "@return: the number of edges in the graph.\n" "@rtype: integer"},
-
-  // interface to igraph_is_dag
-  {"is_dag", (PyCFunction) igraphmodule_Graph_is_dag,
-   METH_NOARGS,
-   "is_dag()\n\n"
-   "Checks whether the graph is a DAG (directed acyclic graph).\n\n"
-   "A DAG is a directed graph with no directed cycles.\n\n"
-   "@return: C{True} if it is a DAG, C{False} otherwise.\n"
-   "@rtype: boolean"},
-
-  // interface to igraph_is_directed
-  {"is_directed", (PyCFunction) igraphmodule_Graph_is_directed,
-   METH_NOARGS,
-   "is_directed()\n\n"
-   "Checks whether the graph is directed.\n"
-   "@return: C{True} if it is directed, C{False} otherwise.\n"
-   "@rtype: boolean"},
-
-  // interface to igraph_is_simple
-  {"is_simple", (PyCFunction) igraphmodule_Graph_is_simple,
-   METH_NOARGS,
-   "is_simple()\n\n"
-   "Checks whether the graph is simple (no loop or multiple edges).\n\n"
-   "@return: C{True} if it is simple, C{False} otherwise.\n"
-   "@rtype: boolean"},
-
-  /* interface to igraph_add_vertices */
-  {"add_vertices", (PyCFunction) igraphmodule_Graph_add_vertices,
-   METH_VARARGS,
-   "add_vertices(n)\n\n"
-   "Adds vertices to the graph.\n\n"
-   "@param n: the number of vertices to be added\n"},
-
-  /* interface to igraph_delete_vertices */
-  {"delete_vertices", (PyCFunction) igraphmodule_Graph_delete_vertices,
-   METH_VARARGS,
-   "delete_vertices(vs)\n\n"
-   "Deletes vertices and all its edges from the graph.\n\n"
-   "@param vs: a single vertex ID or the list of vertex IDs\n"
-   "  to be deleted.\n"},
-
-  /* interface to igraph_add_edges */
-  {"add_edges", (PyCFunction) igraphmodule_Graph_add_edges,
-   METH_VARARGS,
-   "add_edges(es)\n\n"
-   "Adds edges to the graph.\n\n"
-   "@param es: the list of edges to be added. Every edge is\n"
-   "  represented with a tuple, containing the vertex IDs of the\n"
-   "  two endpoints. Vertices are enumerated from zero.\n"},
-
-  /* interface to igraph_delete_edges */
-  {"delete_edges", (PyCFunction) igraphmodule_Graph_delete_edges,
-   METH_VARARGS | METH_KEYWORDS,
-   "delete_edges(es)\n\n"
-   "Removes edges from the graph.\n\n"
-   "All vertices will be kept, even if they lose all their edges.\n"
-   "Nonexistent edges will be silently ignored.\n\n"
-   "@param es: the list of edges to be removed. Edges are identifed by\n"
-   "  edge IDs. L{EdgeSeq} objects are also accepted here.\n"},
-
-  /* interface to igraph_degree */
-  {"degree", (PyCFunction) igraphmodule_Graph_degree,
-   METH_VARARGS | METH_KEYWORDS,
-   "degree(vertices, mode=ALL, loops=True)\n\n"
-   "Returns some vertex degrees from the graph.\n\n"
-   "This method accepts a single vertex ID or a list of vertex IDs as a\n"
-   "parameter, and returns the degree of the given vertices (in the\n"
-   "form of a single integer or a list, depending on the input\n"
-   "parameter).\n"
-   "\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs\n"
-   "@param mode: the type of degree to be returned (L{OUT} for\n"
-   "  out-degrees, L{IN} IN for in-degrees or L{ALL} for the sum of\n"
-   "  them).\n" "@param loops: whether self-loops should be counted.\n"},
-
-  /* interface to igraph_strength */
-  {"strength", (PyCFunction) igraphmodule_Graph_strength,
-   METH_VARARGS | METH_KEYWORDS,
-   "strength(vertices, mode=ALL, loops=True, weights=None)\n\n"
-   "Returns the strength (weighted degree) of some vertices from the graph\n\n"
-   "This method accepts a single vertex ID or a list of vertex IDs as a\n"
-   "parameter, and returns the strength (that is, the sum of the weights\n"
-   "of all incident edges) of the given vertices (in the\n"
-   "form of a single integer or a list, depending on the input\n"
-   "parameter).\n"
-   "\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs\n"
-   "@param mode: the type of degree to be returned (L{OUT} for\n"
-   "  out-degrees, L{IN} IN for in-degrees or L{ALL} for the sum of\n"
-   "  them).\n"
-   "@param loops: whether self-loops should be counted.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-  },
-
-  /* interface to igraph_is_loop */
-  {"is_loop", (PyCFunction) igraphmodule_Graph_is_loop,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_loop(edges=None)\n\n"
-   "Checks whether a specific set of edges contain loop edges\n\n"
-   "@param edges: edge indices which we want to check. If C{None}, all\n"
-   "  edges are checked.\n"
-   "@return: a list of booleans, one for every edge given\n"},
-
-  /* interface to igraph_is_multiple */
-  {"is_multiple", (PyCFunction) igraphmodule_Graph_is_multiple,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_multiple(edges=None)\n\n"
-   "Checks whether an edge is a multiple edge.\n\n"
-   "Also works for a set of edges -- in this case, every edge is checked\n"
-   "one by one. Note that if there are multiple edges going between a\n"
-   "pair of vertices, there is always one of them that is I{not}\n"
-   "reported as multiple (only the others). This allows one to easily\n"
-   "detect the edges that have to be deleted in order to make the graph\n"
-   "free of multiple edges.\n\n"
-   "@param edges: edge indices which we want to check. If C{None}, all\n"
-   "  edges are checked.\n"
-   "@return: a list of booleans, one for every edge given\n"},
-
-  /* interface to igraph_has_multiple */
-  {"has_multiple", (PyCFunction) igraphmodule_Graph_has_multiple,
-   METH_NOARGS,
-   "has_multiple()\n\n"
-   "Checks whether the graph has multiple edges.\n\n"
-   "@return: C{True} if the graph has at least one multiple edge,\n"
-   "         C{False} otherwise.\n"
-   "@rtype: boolean"},
-
-  /* interface to igraph_is_mutual */
-  {"is_mutual", (PyCFunction) igraphmodule_Graph_is_mutual,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_mutual(edges=None)\n\n"
-   "Checks whether an edge has an opposite pair.\n\n"
-   "Also works for a set of edges -- in this case, every edge is checked\n"
-   "one by one. The result will be a list of booleans (or a single boolean\n"
-   "if only an edge index is supplied), every boolean corresponding to an\n"
-   "edge in the edge set supplied. C{True} is returned for a given edge\n"
-   "M{a} --> M{b} if there exists another edge M{b} --> M{a} in the\n"
-   "original graph (not the given edge set!). All edges in an undirected\n"
-   "graph are mutual. In case there are multiple edges between M{a}\n"
-   "and M{b}, it is enough to have at least one edge in either direction\n"
-   "to report all edges between them as mutual, so the multiplicity\n"
-   "of edges do not matter.\n\n"
-   "@param edges: edge indices which we want to check. If C{None}, all\n"
-   "  edges are checked.\n"
-   "@return: a list of booleans, one for every edge given\n"},
-
-  /* interface to igraph_count_multiple */
-  {"count_multiple", (PyCFunction) igraphmodule_Graph_count_multiple,
-   METH_VARARGS | METH_KEYWORDS,
-   "count_multiple(edges=None)\n\n"
-   "Counts the multiplicities of the given edges.\n\n"
-   "@param edges: edge indices for which we want to count their\n"
-   "  multiplicity. If C{None}, all edges are counted.\n"
-   "@return: the multiplicities of the given edges as a list.\n"},
-
-  /* interface to igraph_neighbors */
-  {"neighbors", (PyCFunction) igraphmodule_Graph_neighbors,
-   METH_VARARGS | METH_KEYWORDS,
-   "neighbors(vertex, mode=ALL)\n\n"
-   "Returns adjacent vertices to a given vertex.\n\n"
-   "@param vertex: a vertex ID\n"
-   "@param mode: whether to return only predecessors (L{OUT}),\n"
-   "  successors (L{IN}) or both (L{ALL}). Ignored for undirected\n"
-   "  graphs."},
-
-  {"successors", (PyCFunction) igraphmodule_Graph_successors,
-   METH_VARARGS | METH_KEYWORDS,
-   "successors(vertex)\n\n"
-   "Returns the successors of a given vertex.\n\n"
-   "Equivalent to calling the L{Graph.neighbors} method with type=L{OUT}."},
-
-  {"predecessors", (PyCFunction) igraphmodule_Graph_predecessors,
-   METH_VARARGS | METH_KEYWORDS,
-   "predecessors(vertex)\n\n"
-   "Returns the predecessors of a given vertex.\n\n"
-   "Equivalent to calling the L{Graph.neighbors} method with type=L{IN}."},
-
-  /* interface to igraph_get_eid */
-  {"get_eid", (PyCFunction) igraphmodule_Graph_get_eid,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_eid(v1, v2, directed=True, error=True)\n\n"
-   "Returns the edge ID of an arbitrary edge between vertices v1 and v2\n\n"
-   "@param v1: the first vertex ID\n"
-   "@param v2: the second vertex ID\n"
-   "@param directed: whether edge directions should be considered in\n"
-   "  directed graphs. The default is C{True}. Ignored for undirected\n"
-   "  graphs.\n"
-   "@param error: if C{True}, an exception will be raised when the\n"
-   "  given edge does not exist. If C{False}, -1 will be returned in\n"
-   "  that case.\n"
-   "@return: the edge ID of an arbitrary edge between vertices v1 and v2\n"},
-
-  /* interface to igraph_get_eids */
-  {"get_eids", (PyCFunction) igraphmodule_Graph_get_eids,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_eids(pairs=None, path=None, directed=True, error=True)\n\n"
-   "Returns the edge IDs of some edges between some vertices.\n\n"
-   "This method can operate in two different modes, depending on which\n"
-   "of the keyword arguments C{pairs} and C{path} are given.\n\n"
-   "The method does not consider multiple edges; if there are multiple\n"
-   "edges between a pair of vertices, only the ID of one of the edges\n"
-   "is returned.\n\n"
-   "@param pairs: a list of integer pairs. Each integer pair is considered\n"
-   "  as a source-target vertex pair; the corresponding edge is looked up\n"
-   "  in the graph and the edge ID is returned for each pair.\n"
-   "@param path: a list of vertex IDs. The list is considered as a\n"
-   "  continuous path from the first vertex to the last, passing\n"
-   "  through the intermediate vertices. The corresponding edge IDs\n"
-   "  between the first and the second, the second and the third and\n"
-   "  so on are looked up in the graph and the edge IDs are returned.\n"
-   "  If both C{path} and C{pairs} are given, the two lists are\n"
-   "  concatenated.\n"
-   "@param directed: whether edge directions should be considered in\n"
-   "  directed graphs. The default is C{True}. Ignored for undirected\n"
-   "  graphs.\n"
-   "@param error: if C{True}, an exception will be raised if a given\n"
-   "  edge does not exist. If C{False}, -1 will be returned in\n"
-   "  that case.\n"
-   "@return: the edge IDs in a list\n"},
-
-  /* interface to igraph_incident */
-  {"incident", (PyCFunction) igraphmodule_Graph_incident,
-   METH_VARARGS | METH_KEYWORDS,
-   "incident(vertex, mode=OUT)\n\n"
-   "Returns the edges a given vertex is incident on.\n\n"
-   "@param vertex: a vertex ID\n"
-   "@param mode: whether to return only predecessors (L{OUT}),\n"
-   "  successors (L{IN}) or both (L{ALL}). Ignored for undirected\n"
-   "  graphs."},
-
-  //////////////////////
-  // GRAPH GENERATORS //
-  //////////////////////
-
-  /* interface to igraph_adjacency */
-  {"Adjacency", (PyCFunction) igraphmodule_Graph_Adjacency,
-   METH_CLASS | METH_VARARGS | METH_KEYWORDS,
-   "Adjacency(matrix, mode=ADJ_DIRECTED)\n\n"
-   "Generates a graph from its adjacency matrix.\n\n"
-   "@param matrix: the adjacency matrix\n"
-   "@param mode: the mode to be used. Possible values are:\n"
-   "\n"
-   "  - C{ADJ_DIRECTED} - the graph will be directed and a matrix\n"
-   "    element gives the number of edges between two vertex.\n"
-   "  - C{ADJ_UNDIRECTED} - alias to C{ADJ_MAX} for convenience.\n"
-   "  - C{ADJ_MAX}   - undirected graph will be created and the number of\n"
-   "    edges between vertex M{i} and M{j} is M{max(A(i,j), A(j,i))}\n"
-   "  - C{ADJ_MIN}   - like C{ADJ_MAX}, but with M{min(A(i,j), A(j,i))}\n"
-   "  - C{ADJ_PLUS}  - like C{ADJ_MAX}, but with M{A(i,j) + A(j,i)}\n"
-   "  - C{ADJ_UPPER} - undirected graph with the upper right triangle of\n"
-   "    the matrix (including the diagonal)\n"
-   "  - C{ADJ_LOWER} - undirected graph with the lower left triangle of\n"
-   "    the matrix (including the diagonal)\n"
-   "\n"
-   "  These values can also be given as strings without the C{ADJ} prefix.\n"
-   },
-
-  /* interface to igraph_asymmetric_preference_game */
-  {"Asymmetric_Preference",
-   (PyCFunction) igraphmodule_Graph_Asymmetric_Preference,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Asymmetric_Preference(n, type_dist_matrix, pref_matrix, attribute=None, loops=False)\n\n"
-   "Generates a graph based on asymmetric vertex types and connection probabilities.\n\n"
-   "This is the asymmetric variant of L{Graph.Preference}.\n"
-   "A given number of vertices are generated. Every vertex is assigned to an\n"
-   "\"incoming\" and an \"outgoing\" vertex type according to the given joint\n"
-   "type probabilities. Finally, every vertex pair is evaluated and a\n"
-   "directed edge is created between them with a probability depending on\n"
-   "the \"outgoing\" type of the source vertex and the \"incoming\" type of\n"
-   "the target vertex.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param type_dist_matrix: matrix giving the joint distribution of vertex\n"
-   "  types\n"
-   "@param pref_matrix: matrix giving the connection probabilities for\n"
-   "  different vertex types.\n"
-   "@param attribute: the vertex attribute name used to store the vertex\n"
-   "  types. If C{None}, vertex types are not stored.\n"
-   "@param loops: whether loop edges are allowed.\n"},
-
-  // interface to igraph_atlas
-  {"Atlas", (PyCFunction) igraphmodule_Graph_Atlas,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Atlas(idx)\n\n"
-   "Generates a graph from the Graph Atlas.\n\n"
-   "@param idx: The index of the graph to be generated.\n"
-   "  Indices start from zero, graphs are listed:\n\n"
-   "    1. in increasing order of number of vertices;\n"
-   "    2. for a fixed number of vertices, in increasing order of the\n"
-   "       number of edges;\n"
-   "    3. for fixed numbers of vertices and edges, in increasing order\n"
-   "       of the degree sequence, for example 111223 < 112222;\n"
-   "    4. for fixed degree sequence, in increasing number of automorphisms.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: I{An Atlas of Graphs} by Ronald C. Read and Robin J. Wilson,\n"
-   "  Oxford University Press, 1998."},
-
-  // interface to igraph_barabasi_game
-  {"Barabasi", (PyCFunction) igraphmodule_Graph_Barabasi,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Barabasi(n, m, outpref=False, directed=False, power=1,\n"
-   "         zero_appeal=1, implementation=\"psumtree\", start_from=None)\n\n"
-   "Generates a graph based on the Barabasi-Albert model.\n\n"
-   "@param n: the number of vertices\n"
-   "@param m: either the number of outgoing edges generated for\n"
-   "  each vertex or a list containing the number of outgoing\n"
-   "  edges for each vertex explicitly.\n"
-   "@param outpref: C{True} if the out-degree of a given vertex\n"
-   "  should also increase its citation probability (as well as\n"
-   "  its in-degree), but it defaults to C{False}.\n"
-   "@param directed: C{True} if the generated graph should be\n"
-   "  directed (default: C{False}).\n"
-   "@param power: the power constant of the nonlinear model.\n"
-   "  It can be omitted, and in this case the usual linear model\n"
-   "  will be used.\n"
-   "@param zero_appeal: the attractivity of vertices with degree\n"
-   "  zero.\n\n"
-   "@param implementation: the algorithm to use to generate the\n"
-   "  network. Possible values are:\n\n"
-   "    - C{\"bag\"}: the algorithm that was the default in\n"
-   "      igraph before 0.6. It works by putting the ids of the\n"
-   "      vertices into a bag (multiset) exactly as many times\n"
-   "      as their in-degree, plus once more. The required number\n"
-   "      of cited vertices are then drawn from the bag with\n"
-   "      replacement. It works only for I{power}=1 and\n"
-   "      I{zero_appeal}=1.\n\n"
-   "    - C{\"psumtree\"}: this algorithm uses a partial prefix-sum\n"
-   "      tree to generate the graph. It does not generate multiple\n"
-   "      edges and it works for any values of I{power} and\n"
-   "      I{zero_appeal}.\n\n"
-   "    - C{\"psumtree_multiple\"}: similar to C{\"psumtree\"}, but\n"
-   "      it will generate multiple edges as well. igraph before\n"
-   "      0.6 used this algorithm for I{power}s other than 1.\n\n"
-   "@param start_from: if given and not C{None}, this must be another\n"
-   "      L{Graph} object. igraph will use this graph as a starting\n"
-   "      point for the preferential attachment model.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Barabasi, A-L and Albert, R. 1999. Emergence of scaling\n"
-   "  in random networks. Science, 286 509-512."},
-
-  /* interface to igraph_create_bipartite */
-  {"_Bipartite", (PyCFunction) igraphmodule_Graph_Bipartite,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "_Bipartite(types, edges, directed=False)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.Bipartite()\n\n"},
-
-  /* interface to igraph_de_bruijn */
-  {"De_Bruijn", (PyCFunction) igraphmodule_Graph_De_Bruijn,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "De_Bruijn(m, n)\n\n"
-   "Generates a de Bruijn graph with parameters (m, n)\n\n"
-   "A de Bruijn graph represents relationships between strings. An alphabet\n"
-   "of M{m} letters are used and strings of length M{n} are considered.\n"
-   "A vertex corresponds to every possible string and there is a directed edge\n"
-   "from vertex M{v} to vertex M{w} if the string of M{v} can be transformed into\n"
-   "the string of M{w} by removing its first letter and appending a letter to it.\n"
-   "\n"
-   "Please note that the graph will have M{m^n} vertices and even more edges,\n" 
-   "so probably you don't want to supply too big numbers for M{m} and M{n}.\n\n"
-   "@param m: the size of the alphabet\n"
-   "@param n: the length of the strings\n"
-  },
-
-  // interface to igraph_establishment_game
-  {"Establishment", (PyCFunction) igraphmodule_Graph_Establishment,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Establishment(n, k, type_dist, pref_matrix, directed=False)\n\n"
-   "Generates a graph based on a simple growing model with vertex types.\n\n"
-   "A single vertex is added at each time step. This new vertex tries to\n"
-   "connect to k vertices in the graph. The probability that such a\n"
-   "connection is realized depends on the types of the vertices involved.\n"
-   "\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param k: the number of connections tried in each step\n"
-   "@param type_dist: list giving the distribution of vertex types\n"
-   "@param pref_matrix: matrix (list of lists) giving the connection\n"
-   "  probabilities for different vertex types\n"
-   "@param directed: whether to generate a directed graph.\n"},
-
-  // interface to igraph_erdos_renyi_game
-  {"Erdos_Renyi", (PyCFunction) igraphmodule_Graph_Erdos_Renyi,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Erdos_Renyi(n, p, m, directed=False, loops=False)\n\n"
-   "Generates a graph based on the Erdos-Renyi model.\n\n"
-   "@param n: the number of vertices.\n"
-   "@param p: the probability of edges. If given, C{m} must be missing.\n"
-   "@param m: the number of edges. If given, C{p} must be missing.\n"
-   "@param directed: whether to generate a directed graph.\n"
-   "@param loops: whether self-loops are allowed.\n"},
-
-  /* interface to igraph_famous */
-	{"Famous", (PyCFunction) igraphmodule_Graph_Famous,
-	 METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-	 "Famous(name)\n\n"
-	 "Generates a famous graph based on its name.\n\n"
-	 "Several famous graphs are known to C{igraph} including (but not limited to)\n"
-	 "the Chvatal graph, the Petersen graph or the Tutte graph. This method\n"
-	 "generates one of them based on its name (case insensitive). See the\n"
-	 "documentation of the C interface of C{igraph} for the names available:\n"
-	 "U{http://igraph.sourceforge.net/doc/html/igraph_famous.html}.\n\n"
-	 "@param name: the name of the graph to be generated.\n"
-	},
-
-  /* interface to igraph_forest_fire_game */
-  {"Forest_Fire", (PyCFunction) igraphmodule_Graph_Forest_Fire,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Forest_Fire(n, fw_prob, bw_factor=0.0, ambs=1, directed=False)\n\n"
-   "Generates a graph based on the forest fire model\n\n"
-   "The forest fire model is a growin graph model. In every time step, a new\n"
-   "vertex is added to the graph. The new vertex chooses an ambassador (or\n"
-   "more than one if M{ambs>1}) and starts a simulated forest fire at its\n"
-   "ambassador(s). The fire spreads through the edges. The spreading probability\n"
-   "along an edge is given by M{fw_prob}. The fire may also spread backwards\n"
-   "on an edge by probability M{fw_prob * bw_factor}. When the fire ended, the\n"
-   "newly added vertex connects to the vertices ``burned'' in the previous\n"
-   "fire.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param fw_prob: forward burning probability\n"
-   "@param bw_factor: ratio of backward and forward burning probability\n"
-   "@param ambs: number of ambassadors chosen in each step\n"
-   "@param directed: whether the graph will be directed\n"
-  },
-
-  /* interface to igraph_full_citation */
-  {"Full_Citation", (PyCFunction) igraphmodule_Graph_Full_Citation,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Full_Citation(n, directed=False)\n\n"
-   "Generates a full citation graph\n\n"
-   "A full citation graph is a graph where the vertices are indexed from 0 to\n"
-   "M{n-1} and vertex M{i} has a directed edge towards all vertices with an\n"
-   "index less than M{i}.\n\n"
-   "@param n: the number of vertices.\n"
-   "@param directed: whether to generate a directed graph.\n"},
-
-  /* interface to igraph_full */
-  {"Full", (PyCFunction) igraphmodule_Graph_Full,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Full(n, directed=False, loops=False)\n\n"
-   "Generates a full graph (directed or undirected, with or without loops).\n\n"
-   "@param n: the number of vertices.\n"
-   "@param directed: whether to generate a directed graph.\n"
-   "@param loops: whether self-loops are allowed.\n"},
-
-  /* interface to igraph_full_bipartite */
-  {"_Full_Bipartite", (PyCFunction) igraphmodule_Graph_Full_Bipartite,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "_Full_Bipartite(n1, n2, directed=False, loops=False)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.Full_Bipartite()\n\n"},
-
-  /* interface to igraph_grg_game */
-  {"_GRG", (PyCFunction) igraphmodule_Graph_GRG,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "_GRG(n, radius, torus=False)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.GRG()\n\n"},
-
-  /* interface to igraph_growing_random_game */
-  {"Growing_Random", (PyCFunction) igraphmodule_Graph_Growing_Random,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Growing_Random(n, m, directed=False, citation=False)\n\n"
-   "Generates a growing random graph.\n\n"
-   "@param n: The number of vertices in the graph\n"
-   "@param m: The number of edges to add in each step (after adding a new vertex)\n"
-   "@param directed: whether the graph should be directed.\n"
-   "@param citation: whether the new edges should originate from the most\n"
-   "   recently added vertex.\n"},
-
-  /* interface to igraph_incidence */
-  {"_Incidence", (PyCFunction) igraphmodule_Graph_Incidence,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "_Incidence(matrix, directed=False, mode=ALL, multiple=False)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.Incidence()\n\n"},
-
-  /* interface to igraph_kautz */
-  {"Kautz", (PyCFunction) igraphmodule_Graph_Kautz,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Kautz(m, n)\n\n"
-   "Generates a Kautz graph with parameters (m, n)\n\n"
-   "A Kautz graph is a labeled graph, vertices are labeled by strings\n"
-   "of length M{n+1} above an alphabet with M{m+1} letters, with\n"
-   "the restriction that every two consecutive letters in the string\n"
-   "must be different. There is a directed edge from a vertex M{v} to\n"
-   "another vertex M{w} if it is possible to transform the string of\n"
-   "M{v} into the string of M{w} by removing the first letter and\n"
-   "appending a letter to it.\n\n"
-   "@param m: the size of the alphabet minus one\n"
-   "@param n: the length of the strings minus one\n"
-   },
-
-  /* interface to igraph_k_regular */
-  {"K_Regular", (PyCFunction) igraphmodule_Graph_K_Regular,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "K_Regular(n, k, directed=False, multiple=False)\n\n"
-   "Generates a k-regular random graph\n\n"
-   "A k-regular random graph is a random graph where each vertex has degree k.\n"
-   "If the graph is directed, both the in-degree and the out-degree of each vertex\n"
-   "will be k.\n\n"
-   "@param n: The number of vertices in the graph\n\n"
-   "@param k: The degree of each vertex if the graph is undirected, or the in-degree\n"
-   "  and out-degree of each vertex if the graph is directed\n"
-   "@param directed: whether the graph should be directed.\n"
-   "@param multiple: whether it is allowed to create multiple edges.\n"
-  },
-
-  /* interface to igraph_preference_game */
-  {"Preference", (PyCFunction) igraphmodule_Graph_Preference,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Preference(n, type_dist, pref_matrix, attribute=None, directed=False, loops=False)\n\n"
-   "Generates a graph based on vertex types and connection probabilities.\n\n"
-   "This is practically the nongrowing variant of L{Graph.Establishment}.\n"
-   "A given number of vertices are generated. Every vertex is assigned to a\n"
-   "vertex type according to the given type probabilities. Finally, every\n"
-   "vertex pair is evaluated and an edge is created between them with a\n"
-   "probability depending on the types of the vertices involved.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param type_dist: list giving the distribution of vertex types\n"
-   "@param pref_matrix: matrix giving the connection probabilities for\n"
-   "  different vertex types.\n"
-   "@param attribute: the vertex attribute name used to store the vertex\n"
-   "  types. If C{None}, vertex types are not stored.\n"
-   "@param directed: whether to generate a directed graph.\n"
-   "@param loops: whether loop edges are allowed.\n"},
-
-  /* interface to igraph_recent_degree_game */
-  {"Recent_Degree", (PyCFunction) igraphmodule_Graph_Recent_Degree,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Recent_Degree(n, m, window, outpref=False, directed=False, power=1)\n\n"
-   "Generates a graph based on a stochastic model where the probability\n"
-   "of an edge gaining a new node is proportional to the edges gained in\n"
-   "a given time window.\n\n"
-   "@param n: the number of vertices\n"
-   "@param m: either the number of outgoing edges generated for\n"
-   "  each vertex or a list containing the number of outgoing\n"
-   "  edges for each vertex explicitly.\n"
-   "@param window: size of the window in time steps\n"
-   "@param outpref: C{True} if the out-degree of a given vertex\n"
-   "  should also increase its citation probability (as well as\n"
-   "  its in-degree), but it defaults to C{False}.\n"
-   "@param directed: C{True} if the generated graph should be\n"
-   "  directed (default: C{False}).\n"
-   "@param power: the power constant of the nonlinear model.\n"
-   "  It can be omitted, and in this case the usual linear model\n"
-   "  will be used.\n"},
-
-  // interface to igraph_star
-  {"Star", (PyCFunction) igraphmodule_Graph_Star,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Star(n, mode=\"undirected\", center=0)\n\n"
-   "Generates a star graph.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param mode: Gives the type of the star graph to create. Should be\n"
-   "  either \"in\", \"out\", \"mutual\" or \"undirected\"\n"
-   "@param center: Vertex ID for the central vertex in the star.\n"},
-
-  // interface to igraph_lattice
-  {"Lattice", (PyCFunction) igraphmodule_Graph_Lattice,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Lattice(dim, nei=1, directed=False, mutual=True, circular=True)\n\n"
-   "Generates a regular lattice.\n\n"
-   "@param dim: list with the dimensions of the lattice\n"
-   "@param nei: value giving the distance (number of steps) within which\n"
-   "   two vertices will be connected.\n"
-   "@param directed: whether to create a directed graph.\n"
-   "@param mutual: whether to create all connections as mutual\n"
-   "    in case of a directed graph.\n"
-   "@param circular: whether the generated lattice is periodic.\n"},
-
-  /* interface to igraph_lcf */
-	{"LCF", (PyCFunction) igraphmodule_Graph_LCF,
-	 METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-	 "LCF(n, shifts, repeats)\n\n"
-	 "Generates a graph from LCF notation.\n\n"
-	 "LCF is short for Lederberg-Coxeter-Frucht, it is a concise notation\n"
-	 "for 3-regular Hamiltonian graphs. It consists of three parameters,\n"
-	 "the number of vertices in the graph, a list of shifts giving\n"
-	 "additional edges to a cycle backbone and another integer giving how\n"
-	 "many times the shifts should be performed. See\n"
-	 "U{http://mathworld.wolfram.com/LCFNotation.html} for details.\n\n" 
-	 "@param n: the number of vertices\n"
-	 "@param shifts: the shifts in a list or tuple\n"
-	 "@param repeats: the number of repeats\n"
-	},
-	 
-  // interface to igraph_ring
-  {"Ring", (PyCFunction) igraphmodule_Graph_Ring,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Ring(n, directed=False, mutual=False, circular=True)\n\n"
-   "Generates a ring graph.\n\n"
-   "@param n: the number of vertices in the ring\n"
-   "@param directed: whether to create a directed ring.\n"
-   "@param mutual: whether to create mutual edges in a directed ring.\n"
-   "@param circular: whether to create a closed ring.\n"},
-
-  /* interface to igraph_static_fitness_game */
-  {"Static_Fitness", (PyCFunction) igraphmodule_Graph_Static_Fitness,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Static_Fitness(m, fitness_out, fitness_in=None, loops=False, multiple=False)\n\n"
-   "Generates a non-growing graph with edge probabilities proportional to node\n"
-   "fitnesses.\n\n"
-   "The algorithm randomly selects vertex pairs and connects them until the given\n"
-   "number of edges are created. Each vertex is selected with a probability\n"
-   "proportional to its fitness; for directed graphs, a vertex is selected as a\n"
-   "source proportional to its out-fitness and as a target proportional to its\n"
-   "in-fitness.\n\n"
-   "@param m: the number of edges in the graph\n"
-   "@param fitness_out: a numeric vector with non-negative entries, one for each\n"
-   "  vertex. These values represent the fitness scores (out-fitness scores for\n"
-   "  directed graphs). I{fitness} is an alias of this keyword argument.\n"
-   "@param fitness_in: a numeric vector with non-negative entries, one for each\n"
-   "  vertex. These values represent the in-fitness scores for directed graphs.\n"
-   "  For undirected graphs, this argument must be C{None}.\n"
-   "@param loops: whether loop edges are allowed.\n"
-   "@param multiple: whether multiple edges are allowed.\n"
-   "@return: a directed or undirected graph with the prescribed power-law\n"
-   "  degree distributions.\n"
-  },
-
-  /* interface to igraph_static_power_law_game */
-  {"Static_Power_Law", (PyCFunction) igraphmodule_Graph_Static_Power_Law,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Static_Power_Law(n, m, exponent_out, exponent_in=-1, loops=False,\n"
-   "    multiple=False, finite_size_correction=True)\n\n"
-   "Generates a non-growing graph with prescribed power-law degree distributions.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param m: the number of edges in the graph\n"
-   "@param exponent_out: the exponent of the out-degree distribution, which\n"
-   "  must be between 2 and infinity (inclusive). When I{exponent_in} is\n"
-   "  not given or negative, the graph will be undirected and this parameter\n"
-   "  specifies the degree distribution. I{exponent} is an alias to this\n"
-   "  keyword argument.\n"
-   "@param exponent_in: the exponent of the in-degree distribution, which\n"
-   "  must be between 2 and infinity (inclusive) It can also be negative, in\n"
-   "  which case an undirected graph will be generated.\n"
-   "@param loops: whether loop edges are allowed.\n"
-   "@param multiple: whether multiple edges are allowed.\n"
-   "@param finite_size_correction: whether to apply a finite-size correction\n"
-   "  to the generated fitness values for exponents less than 3. See the\n"
-   "  paper of Cho et al for more details.\n"
-   "@return: a directed or undirected graph with the prescribed power-law\n"
-   "  degree distributions.\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: Goh K-I, Kahng B, Kim D: Universal behaviour of load distribution\n"
-   "  in scale-free networks. Phys Rev Lett 87(27):278701, 2001.\n"
-   "@ref: Cho YS, Kim JS, Park J, Kahng B, Kim D: Percolation transitions in\n"
-   "  scale-free networks under the Achlioptas process. Phys Rev Lett\n"
-   "  103:135702, 2009.\n"
-  },
-
-  // interface to igraph_tree
-  {"Tree", (PyCFunction) igraphmodule_Graph_Tree,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Tree(n, children, type=TREE_UNDIRECTED)\n\n"
-   "Generates a tree in which almost all vertices have the same number of children.\n\n"
-   "@param n: the number of vertices in the graph\n"
-   "@param children: the number of children of a vertex in the graph\n"
-   "@param type: determines whether the tree should be directed, and if\n"
-   "  this is the case, also its orientation. Must be one of\n"
-   "  C{TREE_IN}, C{TREE_OUT} and C{TREE_UNDIRECTED}.\n"},
-
-  /* interface to igraph_degree_sequence_game */
-  {"Degree_Sequence", (PyCFunction) igraphmodule_Graph_Degree_Sequence,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Degree_Sequence(out, in=None, method=\"simple\")\n\n"
-   "Generates a graph with a given degree sequence.\n\n"
-   "@param out: the out-degree sequence for a directed graph. If the\n"
-   "  in-degree sequence is omitted, the generated graph\n"
-   "  will be undirected, so this will be the in-degree\n"
-   "  sequence as well\n"
-   "@param in: the in-degree sequence for a directed graph.\n"
-   "  If omitted, the generated graph will be undirected.\n"
-   "@param method: the generation method to be used. One of the following:\n"
-   "  \n"
-   "    - C{\"simple\"} -- simple generator that sometimes generates\n"
-   "      loop edges and multiple edges. The generated graph is not\n"
-   "      guaranteed to be connected.\n"
-   "    - C{\"no_multiple\"} -- similar to C{\"simple\"} but avoids the\n"
-   "      generation of multiple and loop edges at the expense of increased\n"
-   "      time complexity. The method will re-start the generation every time\n"
-   "      it gets stuck in a configuration where it is not possible to insert\n"
-   "      any more edges without creating loops or multiple edges, and there\n"
-   "      is no upper bound on the number of iterations, but it will succeed\n"
-   "      eventually if the input degree sequence is graphical and throw an\n"
-   "      exception if the input degree sequence is not graphical.\n"
-   "    - C{\"vl\"} -- a more sophisticated generator that can sample\n"
-   "      undirected, connected simple graphs uniformly. It uses\n"
-   "      Monte-Carlo methods to randomize the graphs.\n"
-   "      This generator should be favoured if undirected and connected\n"
-   "      graphs are to be generated and execution time is not a concern.\n"
-   "      igraph uses the original implementation of Fabien Viger; see the\n"
-   "      following URL and the paper cited on it for the details of the\n"
-   "      algorithm: U{http://www-rp.lip6.fr/~latapy/FV/generation.html}.\n"
-  },
-
-  /* interface to igraph_isoclass_create */
-  {"Isoclass", (PyCFunction) igraphmodule_Graph_Isoclass,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Isoclass(n, class, directed=False)\n\n"
-   "Generates a graph with a given isomorphy class.\n\n"
-   "@param n: the number of vertices in the graph (3 or 4)\n"
-   "@param class: the isomorphy class\n"
-   "@param directed: whether the graph should be directed.\n"},
-
-  /* interface to igraph_watts_strogatz_game */
-  {"Watts_Strogatz", (PyCFunction) igraphmodule_Graph_Watts_Strogatz,
-   METH_VARARGS | METH_CLASS | METH_KEYWORDS,
-   "Watts_Strogatz(dim, size, nei, p, loops=False, multiple=False)\n\n"
-   "@param dim: the dimension of the lattice\n"
-   "@param size: the size of the lattice along all dimensions\n"
-   "@param nei: value giving the distance (number of steps) within which\n"
-   "   two vertices will be connected.\n"
-   "@param p: rewiring probability\n\n"
-   "@param loops: specifies whether loop edges are allowed\n"
-   "@param multiple: specifies whether multiple edges are allowed\n"
-   "@see: L{Lattice()}, L{rewire()}, L{rewire_edges()} if more flexibility is\n"
-   "  needed\n"
-   "@newfield ref: Reference\n"
-   "@ref: Duncan J Watts and Steven H Strogatz: I{Collective dynamics of\n"
-   "  small world networks}, Nature 393, 440-442, 1998\n"},
-
-  /* interface to igraph_weighted_adjacency */
-  {"Weighted_Adjacency", (PyCFunction) igraphmodule_Graph_Weighted_Adjacency,
-   METH_CLASS | METH_VARARGS | METH_KEYWORDS,
-   "Weighted_Adjacency(matrix, mode=ADJ_DIRECTED, attr=\"weight\", loops=True)\n\n"
-   "Generates a graph from its adjacency matrix.\n\n"
-   "@param matrix: the adjacency matrix\n"
-   "@param mode: the mode to be used. Possible values are:\n"
-   "\n"
-   "  - C{ADJ_DIRECTED} - the graph will be directed and a matrix\n"
-   "    element gives the number of edges between two vertex.\n"
-   "  - C{ADJ_UNDIRECTED} - alias to C{ADJ_MAX} for convenience.\n"
-   "  - C{ADJ_MAX}   - undirected graph will be created and the number of\n"
-   "    edges between vertex M{i} and M{j} is M{max(A(i,j), A(j,i))}\n"
-   "  - C{ADJ_MIN}   - like C{ADJ_MAX}, but with M{min(A(i,j), A(j,i))}\n"
-   "  - C{ADJ_PLUS}  - like C{ADJ_MAX}, but with M{A(i,j) + A(j,i)}\n"
-   "  - C{ADJ_UPPER} - undirected graph with the upper right triangle of\n"
-   "    the matrix (including the diagonal)\n"
-   "  - C{ADJ_LOWER} - undirected graph with the lower left triangle of\n"
-   "    the matrix (including the diagonal)\n"
-   "\n"
-   "  These values can also be given as strings without the C{ADJ} prefix.\n"
-   "@param attr: the name of the edge attribute that stores the edge\n"
-   "  weights.\n"
-   "@param loops: whether to include loop edges. When C{False}, the diagonal\n"
-   "  of the adjacency matrix will be ignored.\n"
-  },
-
-  /////////////////////////////////////
-  // STRUCTURAL PROPERTIES OF GRAPHS //
-  /////////////////////////////////////
-
-  // interface to igraph_are_connected
-  {"are_connected", (PyCFunction) igraphmodule_Graph_are_connected,
-   METH_VARARGS | METH_KEYWORDS,
-   "are_connected(v1, v2)\n\n"
-   "Decides whether two given vertices are directly connected.\n\n"
-   "@param v1: the first vertex\n"
-   "@param v2: the second vertex\n"
-   "@return: C{True} if there exists an edge from v1 to v2, C{False}\n"
-   "  otherwise.\n"},
-
-  /* interface to igraph_articulation_points */
-  {"articulation_points", (PyCFunction)igraphmodule_Graph_articulation_points,
-   METH_NOARGS,
-   "articulation_points()\n\n"
-   "Returns the list of articulation points in the graph.\n\n"
-   "A vertex is an articulation point if its removal increases the number of\n"
-   "connected components in the graph.\n"
-  },
-
-  /* interface to igraph_assortativity */
-  {"assortativity", (PyCFunction)igraphmodule_Graph_assortativity,
-   METH_VARARGS | METH_KEYWORDS,
-   "assortativity(types1, types2=None, directed=True)\n\n"
-   "Returns the assortativity of the graph based on numeric properties\n"
-   "of the vertices.\n\n"
-   "This coefficient is basically the correlation between the actual\n"
-   "connectivity patterns of the vertices and the pattern expected from the\n"
-   "disribution of the vertex types.\n\n"
-   "See equation (21) in Newman MEJ: Mixing patterns in networks, Phys Rev E\n"
-   "67:026126 (2003) for the proper definition. The actual calculation is\n"
-   "performed using equation (26) in the same paper for directed graphs, and\n"
-   "equation (4) in Newman MEJ: Assortative mixing in networks, Phys Rev Lett\n"
-   "89:208701 (2002) for undirected graphs.\n\n"
-   "@param types1: vertex types in a list or the name of a vertex attribute\n"
-   "  holding vertex types. Types are ideally denoted by numeric values.\n"
-   "@param types2: in directed assortativity calculations, each vertex can\n"
-   "  have an out-type and an in-type. In this case, I{types1} contains the\n"
-   "  out-types and this parameter contains the in-types in a list or the\n"
-   "  name of a vertex attribute. If C{None}, it is assumed to be equal\n"
-   "  to I{types1}.\n\n"
-   "@param directed: whether to consider edge directions or not.\n"
-   "@return: the assortativity coefficient\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Newman MEJ: Mixing patterns in networks, Phys Rev E 67:026126, 2003.\n"
-   "@ref: Newman MEJ: Assortative mixing in networks, Phys Rev Lett 89:208701,\n"
-   "  2002.\n"
-   "@see: L{assortativity_degree()} when the types are the vertex degrees\n"
-  },
-
-  /* interface to igraph_assortativity_degree */
-  {"assortativity_degree", (PyCFunction)igraphmodule_Graph_assortativity_degree,
-   METH_VARARGS | METH_KEYWORDS,
-   "assortativity_degree(directed=True)\n\n"
-   "Returns the assortativity of a graph based on vertex degrees.\n\n"
-   "See L{assortativity()} for the details. L{assortativity_degree()} simply\n"
-   "calls L{assortativity()} with the vertex degrees as types.\n\n"
-   "@param directed: whether to consider edge directions for directed graphs\n"
-   "  or not. This argument is ignored for undirected graphs.\n"
-   "@return: the assortativity coefficient\n\n"
-   "@see: L{assortativity()}\n"
-  },
-
-  /* interface to igraph_assortativity_nominal */
-  {"assortativity_nominal", (PyCFunction)igraphmodule_Graph_assortativity_nominal,
-   METH_VARARGS | METH_KEYWORDS,
-   "assortativity_nominal(types, directed=True)\n\n"
-   "Returns the assortativity of the graph based on vertex categories.\n\n"
-   "Assuming that the vertices belong to different categories, this\n"
-   "function calculates the assortativity coefficient, which specifies\n"
-   "the extent to which the connections stay within categories. The\n"
-   "assortativity coefficient is one if all the connections stay within\n"
-   "categories and minus one if all the connections join vertices of\n"
-   "different categories. For a randomly connected network, it is\n"
-   "asymptotically zero.\n\n"
-   "See equation (2) in Newman MEJ: Mixing patterns in networks, Phys Rev E\n"
-   "67:026126 (2003) for the proper definition.\n\n"
-   "@param types: vertex types in a list or the name of a vertex attribute\n"
-   "  holding vertex types. Types should be denoted by numeric values.\n"
-   "@param directed: whether to consider edge directions or not.\n"
-   "@return: the assortativity coefficient\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Newman MEJ: Mixing patterns in networks, Phys Rev E 67:026126, 2003.\n"
-  },
-
-  /* interface to igraph_average_path_length */
-  {"average_path_length",
-   (PyCFunction) igraphmodule_Graph_average_path_length,
-   METH_VARARGS | METH_KEYWORDS,
-   "average_path_length(directed=True, unconn=True)\n\n"
-   "Calculates the average path length in a graph.\n\n"
-   "@param directed: whether to consider directed paths in case of a\n"
-   "  directed graph. Ignored for undirected graphs.\n"
-   "@param unconn: what to do when the graph is unconnected. If C{True},\n"
-   "  the average of the geodesic lengths in the components is\n"
-   "  calculated. Otherwise for all unconnected vertex pairs,\n"
-   "  a path length equal to the number of vertices is used.\n"
-   "@return: the average path length in the graph\n"},
-
-  /* interface to igraph_authority_score */
-  {"authority_score", (PyCFunction)igraphmodule_Graph_authority_score,
-   METH_VARARGS | METH_KEYWORDS,
-   "authority_score(weights=None, scale=True, arpack_options=None, return_eigenvalue=False)\n\n"
-   "Calculates Kleinberg's authority score for the vertices of the graph\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param scale: whether to normalize the scores so that the largest one\n"
-   "  is 1.\n"
-   "@param arpack_options: an L{ARPACKOptions} object used to fine-tune\n"
-   "  the ARPACK eigenvector calculation. If omitted, the module-level\n"
-   "  variable called C{arpack_options} is used.\n"
-   "@param return_eigenvalue: whether to return the largest eigenvalue\n"
-   "@return: the authority scores in a list and optionally the largest eigenvalue\n"
-   "  as a second member of a tuple\n\n"
-   "@see: hub_score()\n"
-  },
-
-  /* interface to igraph_betweenness[_estimate] */
-  {"betweenness", (PyCFunction) igraphmodule_Graph_betweenness,
-   METH_VARARGS | METH_KEYWORDS,
-   "betweenness(vertices=None, directed=True, cutoff=None, weights=None, nobigint=True)\n\n"
-   "Calculates or estimates the betweenness of vertices in a graph.\n\n"
-   "Keyword arguments:\n"
-   "@param vertices: the vertices for which the betweennesses must be returned.\n"
-   "  If C{None}, assumes all of the vertices in the graph.\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param cutoff: if it is an integer, only paths less than or equal to this\n"
-   "  length are considered, effectively resulting in an estimation of the\n"
-   "  betweenness for the given vertices. If C{None}, the exact betweenness is\n"
-   "  returned.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param nobigint: if C{True}, igraph uses the longest available integer\n"
-   "  type on the current platform to count shortest paths. For some large\n"
-   "  networks that have a specific structure, the counters may overflow.\n"
-   "  To prevent this, use C{nobigint=False}, which forces igraph to use\n"
-   "  arbitrary precision integers at the expense of increased computation\n"
-   "  time.\n"
-   "@return: the (possibly estimated) betweenness of the given vertices in a list\n"},
-
-  /* interface to biconnected_components */
-  {"biconnected_components", (PyCFunction) igraphmodule_Graph_biconnected_components,
-   METH_VARARGS | METH_KEYWORDS,
-   "biconnected_components(return_articulation_points=True)\n\n"
-   "Calculates the biconnected components of the graph.\n\n"
-   "@param return_articulation_points: whether to return the articulation\n"
-   "  points as well\n"
-   "@return: a list of lists containing edge indices making up spanning trees\n"
-   "  of the biconnected components (one spanning tree for each component)\n"
-   "  and optionally the list of articulation points"
-  },
-
-  /* interface to igraph_bipartite_projection */
-  {"bipartite_projection", (PyCFunction) igraphmodule_Graph_bipartite_projection,
-   METH_VARARGS | METH_KEYWORDS,
-   "bipartite_projection(types, multiplicity=True, probe1=-1)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.bipartite_projection()\n"},
-
-  /* interface to igraph_bipartite_projection_size */
-  {"bipartite_projection_size", (PyCFunction) igraphmodule_Graph_bipartite_projection_size,
-   METH_VARARGS | METH_KEYWORDS,
-   "bipartite_projection_size(types)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.bipartite_projection_size()\n"},
-
-  /* interface to igraph_closeness */
-  {"closeness", (PyCFunction) igraphmodule_Graph_closeness,
-   METH_VARARGS | METH_KEYWORDS,
-   "closeness(vertices=None, mode=ALL, cutoff=None, weights=None)\n\n"
-   "Calculates the closeness centralities of given vertices in a graph.\n\n"
-   "The closeness centerality of a vertex measures how easily other\n"
-   "vertices can be reached from it (or the other way: how easily it\n"
-   "can be reached from the other vertices). It is defined as the\n"
-   "number of the number of vertices minus one divided by the sum of\n"
-   "the lengths of all geodesics from/to the given vertex.\n\n"
-   "If the graph is not connected, and there is no path between two\n"
-   "vertices, the number of vertices is used instead the length of\n"
-   "the geodesic. This is always longer than the longest possible\n"
-   "geodesic.\n\n"
-   "@param vertices: the vertices for which the closenesses must\n"
-   "  be returned. If C{None}, uses all of the vertices in the graph.\n"
-   "@param mode: must be one of L{IN}, L{OUT} and L{ALL}. L{IN} means\n"
-   "  that the length of the incoming paths, L{OUT} means that the\n"
-   "  length of the outgoing paths must be calculated. L{ALL} means\n"
-   "  that both of them must be calculated.\n"
-   "@param cutoff: if it is an integer, only paths less than or equal to this\n"
-   "  length are considered, effectively resulting in an estimation of the\n"
-   "  closeness for the given vertices (which is always an underestimation of the\n"
-   "  real closeness, since some vertex pairs will appear as disconnected even\n"
-   "  though they are connected).. If C{None}, the exact closeness is\n"
-   "  returned.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: the calculated closenesses in a list\n"},
-
-  /* interface to igraph_clusters */
-  {"clusters", (PyCFunction) igraphmodule_Graph_clusters,
-   METH_VARARGS | METH_KEYWORDS,
-   "clusters(mode=STRONG)\n\n"
-   "Calculates the (strong or weak) clusters for a given graph.\n\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{VertexClustering} object.\n"
-   "  It is advised to use that.\n"
-   "@param mode: must be either C{STRONG} or C{WEAK}, depending on\n"
-   "  the clusters being sought. Optional, defaults to C{STRONG}.\n"
-   "@return: the component index for every node in the graph.\n"},
-  {"copy", (PyCFunction) igraphmodule_Graph_copy,
-   METH_NOARGS,
-   "copy()\n\n" "Creates an exact deep copy of the graph."},
-  {"decompose", (PyCFunction) igraphmodule_Graph_decompose,
-   METH_VARARGS | METH_KEYWORDS,
-   "decompose(mode=STRONG, maxcompno=None, minelements=1)\n\n"
-   "Decomposes the graph into subgraphs.\n\n"
-   "@param mode: must be either STRONG or WEAK, depending on the\n"
-   "  clusters being sought.\n"
-   "@param maxcompno: maximum number of components to return.\n"
-   "  C{None} means all possible components.\n"
-   "@param minelements: minimum number of vertices in a component.\n"
-   "  By setting this to 2, isolated vertices are not returned\n"
-   "  as separate components.\n"
-   "@return: a list of the subgraphs. Every returned subgraph is a\n"
-   "  copy of the original.\n"},
-  /* interface to igraph_contract_vertices */
-  {"contract_vertices", (PyCFunction) igraphmodule_Graph_contract_vertices,
-   METH_VARARGS | METH_KEYWORDS,
-   "contract_vertices(mapping, combine_attrs=None)\n\n"
-   "Contracts some vertices in the graph, i.e. replaces groups of vertices\n"
-   "with single vertices. Edges are not affected.\n\n"
-   "@param mapping: numeric vector which gives the mapping between old and\n"
-   "  new vertex IDs. Vertices having the same new vertex ID in this vector\n"
-   "  will be remapped into a single new vertex. It is safe to pass the\n"
-   "  membership vector of a L{VertexClustering} object here.\n"
-   "@param combine_attrs: specifies how to combine the attributes of\n"
-   "  the vertices being collapsed into a single one. If it is C{None},\n"
-   "  all the attributes will be lost. If it is a function, the\n"
-   "  attributes of the vertices will be collected and passed on to\n"
-   "  that function which will return the new attribute value that has to\n"
-   "  be assigned to the single collapsed vertex. It can also be one of\n"
-   "  the following string constants which define built-in collapsing\n"
-   "  functions: C{sum}, C{prod}, C{mean}, C{median}, C{max}, C{min},\n"
-   "  C{first}, C{last}, C{random}. You can also specify different\n"
-   "  combination functions for different attributes by passing a dict\n"
-   "  here which maps attribute names to functions. See\n"
-   "  L{Graph.simplify()} for more details.\n"
-   "@return: C{None}.\n"
-   "@see: L{Graph.simplify()}\n"
-  },
-  /* interface to igraph_constraint */
-  {"constraint", (PyCFunction) igraphmodule_Graph_constraint,
-   METH_VARARGS | METH_KEYWORDS,
-   "constraint(vertices=None, weights=None)\n\n"
-   "Calculates Burt's constraint scores for given vertices in a graph.\n\n"
-   "Burt's constraint is higher if ego has less, or mutually stronger\n"
-   "related (i.e. more redundant) contacts. Burt's measure of\n"
-   "constraint, C[i], of vertex i's ego network V[i], is defined for\n"
-   "directed and valued graphs as follows:\n\n"
-   "C[i] = sum( sum( (p[i,q] p[q,j])^2, q in V[i], q != i,j ), j in V[], j != i)\n\n"
-   "for a graph of order (ie. number od vertices) N, where proportional\n"
-   "tie strengths are defined as follows:\n\n"
-   "p[i,j]=(a[i,j]+a[j,i]) / sum(a[i,k]+a[k,i], k in V[i], k != i),\n"
-   "a[i,j] are elements of A and the latter being the graph adjacency matrix.\n\n"
-   "For isolated vertices, constraint is undefined.\n\n"
-   "@param vertices: the vertices to be analysed or C{None} for all vertices.\n"
-   "@param weights: weights associated to the edges. Can be an attribute name\n"
-   "  as well. If C{None}, every edge will have the same weight.\n"
-   "@return: constraint scores for all given vertices in a matrix."},
-
-  /* interface to igraph_density */
-  {"density", (PyCFunction) igraphmodule_Graph_density,
-   METH_VARARGS | METH_KEYWORDS,
-   "density(loops=False)\n\n"
-   "Calculates the density of the graph.\n\n"
-   "@param loops: whether to take loops into consideration. If C{True},\n"
-   "  the algorithm assumes that there might be some loops in the graph\n"
-   "  and calculates the density accordingly. If C{False}, the algorithm\n"
-   "  assumes that there can't be any loops.\n"
-   "@return: the reciprocity of the graph."},
-
-  /* interfaces to igraph_diameter */
-  {"diameter", (PyCFunction) igraphmodule_Graph_diameter,
-   METH_VARARGS | METH_KEYWORDS,
-   "diameter(directed=True, unconn=True, weights=None)\n\n"
-   "Calculates the diameter of the graph.\n\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param unconn: if C{True} and the graph is unconnected, the\n"
-   "  longest geodesic within a component will be returned. If\n"
-   "  C{False} and the graph is unconnected, the result is the\n"
-   "  number of vertices if there are no weights or infinity\n"
-   "  if there are weights.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: the diameter"},
-  {"get_diameter", (PyCFunction) igraphmodule_Graph_get_diameter,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_diameter(directed=True, unconn=True, weights=None)\n\n"
-   "Returns a path with the actual diameter of the graph.\n\n"
-   "If there are many shortest paths with the length of the diameter,\n"
-   "it returns the first one it founds.\n\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param unconn: if C{True} and the graph is unconnected, the\n"
-   "  longest geodesic within a component will be returned. If\n"
-   "  C{False} and the graph is unconnected, the result is the\n"
-   "  number of vertices if there are no weights or infinity\n"
-   "  if there are weights.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: the vertices in the path in order."},
-  {"farthest_points", (PyCFunction) igraphmodule_Graph_farthest_points,
-   METH_VARARGS | METH_KEYWORDS,
-   "farthest_points(directed=True, unconn=True, weights=None)\n\n"
-   "Returns two vertex IDs whose distance equals the actual diameter\n"
-   "of the graph.\n\n"
-   "If there are many shortest paths with the length of the diameter,\n"
-   "it returns the first one it found.\n\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param unconn: if C{True} and the graph is unconnected, the\n"
-   "  longest geodesic within a component will be returned. If\n"
-   "  C{False} and the graph is unconnected, the result contains the\n"
-   "  number of vertices if there are no weights or infinity\n"
-   "  if there are weights.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: a triplet containing the two vertex IDs and their distance.\n"
-   "  The IDs are C{None} if the graph is unconnected and C{unconn}\n"
-   "  is C{False}."},
-
-  /* interface to igraph_diversity */
-  {"diversity", (PyCFunction) igraphmodule_Graph_diversity,
-   METH_VARARGS | METH_KEYWORDS,
-   "diversity(vertices=None, weights=None)\n\n"
-   "Calculates the structural diversity index of the vertices.\n\n"
-   "The structural diversity index of a vertex is simply the (normalized)\n"
-   "Shannon entropy of the weights of the edges incident on the vertex.\n\n"
-   "The measure is defined for undirected graphs only; edge directions are\n"
-   "ignored.\n\n"
-   "@param vertices: the vertices for which the diversity indices must\n"
-   "  be returned. If C{None}, uses all of the vertices in the graph.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: the calculated diversity indices in a list, or a single number if\n"
-   "  a single vertex was supplied.\n"
-   "@newfield ref: Reference\n"
-   "@ref: Eagle N, Macy M and Claxton R: Network diversity and economic\n"
-   "  development, Science 328, 1029--1031, 2010."
-  },
-
-  /* interface to igraph_eccentricity */
-  {"eccentricity", (PyCFunction) igraphmodule_Graph_eccentricity,
-   METH_VARARGS | METH_KEYWORDS,
-   "eccentricity(vertices=None, mode=ALL)\n\n"
-   "Calculates the eccentricities of given vertices in a graph.\n\n"
-   "The eccentricity of a vertex is calculated by measuring the\n"
-   "shortest distance from (or to) the vertex, to (or from) all other\n"
-   "vertices in the graph, and taking the maximum.\n\n"
-   "@param vertices: the vertices for which the eccentricity scores must\n"
-   "  be returned. If C{None}, uses all of the vertices in the graph.\n"
-   "@param mode: must be one of L{IN}, L{OUT} and L{ALL}. L{IN} means\n"
-   "  that edge directions are followed; C{OUT} means that edge directions\n"
-   "  are followed the opposite direction; C{ALL} means that directions are\n"
-   "  ignored. The argument has no effect for undirected graphs.\n"
-   "@return: the calculated eccentricities in a list, or a single number if\n"
-   "  a single vertex was supplied.\n"},
-
-  /* interface to igraph_edge_betweenness[_estimate] */
-  {"edge_betweenness", (PyCFunction) igraphmodule_Graph_edge_betweenness,
-   METH_VARARGS | METH_KEYWORDS,
-   "edge_betweenness(directed=True, cutoff=None, weights=None)\n\n"
-   "Calculates or estimates the edge betweennesses in a graph.\n\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param cutoff: if it is an integer, only paths less than or equal to this\n"
-   "  length are considered, effectively resulting in an estimation of the\n"
-   "  betweenness values. If C{None}, the exact betweennesses are\n"
-   "  returned.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: a list with the (exact or estimated) edge betweennesses of all\n"
-   "  edges.\n"},
-
-  /* interface to igraph_[st_]edge_connectivity */
-  {"edge_connectivity", (PyCFunction) igraphmodule_Graph_edge_connectivity,
-   METH_VARARGS | METH_KEYWORDS,
-   "edge_connectivity(source=-1, target=-1, checks=True)\n\n"
-   "Calculates the edge connectivity of the graph or between some vertices.\n\n"
-   "The edge connectivity between two given vertices is the number of edges\n"
-   "that have to be removed in order to disconnect the two vertices into two\n"
-   "separate components. This is also the number of edge disjoint directed\n"
-   "paths between the vertices. The edge connectivity of the graph is the minimal\n"
-   "edge connectivity over all vertex pairs.\n\n"
-   "This method calculates the edge connectivity of a given vertex pair if both\n"
-   "the source and target vertices are given. If none of them is given (or they\n"
-   "are both negative), the overall edge connectivity is returned.\n\n"
-   "@param source: the source vertex involved in the calculation.\n"
-   "@param target: the target vertex involved in the calculation.\n"
-   "@param checks: if the whole graph connectivity is calculated and this is\n"
-   "  C{True}, igraph performs some basic checks before calculation. If the\n"
-   "  graph is not strongly connected, then the connectivity is obviously\n"
-   "  zero. If the minimum degree is one, then the connectivity is\n"
-   "  also one. These simple checks are much faster than checking the entire\n"
-   "  graph, therefore it is advised to set this to C{True}. The parameter\n"
-   "  is ignored if the connectivity between two given vertices is computed.\n"
-   "@return: the edge connectivity\n"
-  },
-
-  /* interface to igraph_eigenvector_centrality */
-  {"eigenvector_centrality",
-   (PyCFunction) igraphmodule_Graph_eigenvector_centrality,
-   METH_VARARGS | METH_KEYWORDS,
-   "eigenvector_centrality(directed=True, scale=True, weights=None, return_eigenvalue=False, arpack_options=None)\n\n"
-   "Calculates the eigenvector centralities of the vertices in a graph.\n\n"
-   "@param directed: whether to consider edge directions in a directed\n"
-   "  graph. Ignored for undirected graphs.\n"
-   "@param scale: whether to normalize the centralities so the largest\n"
-   "  one will always be 1.\n"
-   "@param weights: edge weights given as a list or an edge attribute. If\n"
-   "  C{None}, all edges have equal weight.\n"
-   "@param return_eigenvalue: whether to return the actual largest\n"
-   "  eigenvalue along with the centralities\n"
-   "@param arpack_options: an L{ARPACKOptions} object that can be used\n"
-   "  to fine-tune the calculation. If it is omitted, the module-level\n"
-   "  variable called C{arpack_options} is used.\n"
-   "@return: the eigenvector centralities in a list and optionally the\n"
-   "  largest eigenvalue (as a second member of a tuple)"
-  },
-
-  /* interface to igraph_feedback_arc_set */
-  {"feedback_arc_set", (PyCFunction) igraphmodule_Graph_feedback_arc_set,
-   METH_VARARGS | METH_KEYWORDS,
-   "feedback_arc_set(weights=None, method=\"eades\")\n\n"
-   "Calculates an approximately or exactly minimal feedback arc set.\n\n"
-   "A feedback arc set is a set of edges whose removal makes the graph acyclic.\n"
-   "Since this is always possible by removing all the edges, we are in general\n"
-   "interested in removing the smallest possible number of edges, or an edge set\n"
-   "with as small total weight as possible. This method calculates one such edge\n"
-   "set. Note that the task is trivial for an undirected graph as it is enough\n"
-   "to find a spanning tree and then remove all the edges not in the spanning\n"
-   "tree. Of course it is more complicated for directed graphs.\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name. When given, the algorithm will strive to\n"
-   "  remove lightweight edges in order to minimize the total weight of the\n"
-   "  feedback arc set.\n"
-   "@param method: the algorithm to use. C{\"eades\"} uses the greedy cycle\n"
-   "  breaking heuristic of Eades, Lin and Smyth, which is linear in the number\n"
-   "  of edges but not necessarily optimal; however, it guarantees that the\n"
-   "  number of edges to be removed is smaller than |E|/2 - |V|/6. C{\"ip\"} uses\n"
-   "  an integer programming formulation which is guaranteed to yield an optimal\n"
-   "  result, but is too slow for large graphs.\n"
-   "@return: the IDs of the edges to be removed, in a list.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Eades P, Lin X and Smyth WF: A fast and effective heuristic for the\n"
-   "  feedback arc set problem. In: Proc Inf Process Lett 319-323, 1993.\n"
-  },
-
-  // interface to igraph_get_shortest_paths
-  {"get_shortest_paths", (PyCFunction) igraphmodule_Graph_get_shortest_paths,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_shortest_paths(v, to=None, weights=None, mode=OUT, output=\"vpath\")\n\n"
-   "Calculates the shortest paths from/to a given node in a graph.\n\n"
-   "@param v: the source/destination for the calculated paths\n"
-   "@param to: a vertex selector describing the destination/source for\n"
-   "  the calculated paths. This can be a single vertex ID, a list of\n"
-   "  vertex IDs, a single vertex name, a list of vertex names or a\n"
-   "  L{VertexSeq} object. C{None} means all the vertices.\n"
-   "@param weights: edge weights in a list or the name of an edge attribute\n"
-   "  holding edge weights. If C{None}, all edges are assumed to have\n"
-   "  equal weight.\n"
-   "@param mode: the directionality of the paths. L{IN} means to\n"
-   "  calculate incoming paths, L{OUT} means to calculate outgoing\n"
-   "  paths, L{ALL} means to calculate both ones.\n"
-   "@param output: determines what should be returned. If this is\n"
-   "  C{\"vpath\"}, a list of vertex IDs will be returned, one path\n"
-   "  for each target vertex. For unconnected graphs, some of the list\n"
-   "  elements may be empty. Note that in case of mode=L{IN}, the vertices\n"
-   "  in a path are returned in reversed order. If C{output=\"epath\"},\n"
-   "  edge IDs are returned instead of vertex IDs.\n"
-   "@return: see the documentation of the C{output} parameter.\n"},
-
-  // interface to igraph_get_all_shortest_paths
-  {"get_all_shortest_paths",
-   (PyCFunction) igraphmodule_Graph_get_all_shortest_paths,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_all_shortest_paths(v, to=None, weights=None, mode=OUT)\n\n"
-   "Calculates all of the shortest paths from/to a given node in a graph.\n\n"
-   "@param v: the source/destination for the calculated paths\n"
-   "@param to: a vertex selector describing the destination/source for\n"
-   "  the calculated paths. This can be a single vertex ID, a list of\n"
-   "  vertex IDs, a single vertex name, a list of vertex names or a\n"
-   "  L{VertexSeq} object. C{None} means all the vertices.\n"
-   "@param weights: edge weights in a list or the name of an edge attribute\n"
-   "  holding edge weights. If C{None}, all edges are assumed to have\n"
-   "  equal weight.\n"
-   "@param mode: the directionality of the paths. L{IN} means to calculate\n"
-   "  incoming paths, L{OUT} means to calculate outgoing paths,\n"
-   "  L{ALL} means to calculate both ones.\n"
-   "@return: all of the shortest path from the given node to every other\n"
-   "reachable node in the graph in a list. Note that in case of mode=L{IN},\n"
-   "the vertices in a path are returned in reversed order!"},
-
-  /* interface to igraph_girth */
-  {"girth", (PyCFunction)igraphmodule_Graph_girth,
-   METH_VARARGS | METH_KEYWORDS,
-   "girth(return_shortest_circle=False)\n\n"
-   "Returns the girth of the graph.\n\n"
-   "The girth of a graph is the length of the shortest circle in it.\n\n"
-   "@param return_shortest_circle: whether to return one of the shortest\n"
-   "  circles found in the graph.\n"
-   "@return: the length of the shortest circle or (if C{return_shortest_circle})\n"
-   "  is true, the shortest circle itself as a list\n"
-  },
-
-  /* interface to igraph_convergence_degree */
-  {"convergence_degree", (PyCFunction)igraphmodule_Graph_convergence_degree,
-    METH_NOARGS,
-    "convergence_degree()\n\n"
-	"Undocumented (yet)."
-  },
-
-  /* interface to igraph_convergence_field_size */
-  {"convergence_field_size", (PyCFunction)igraphmodule_Graph_convergence_field_size,
-    METH_NOARGS,
-    "convergence_field_size()\n\n"
-	"Undocumented (yet)."
-  },
-
-  /* interface to igraph_hub_score */
-  {"hub_score", (PyCFunction)igraphmodule_Graph_hub_score,
-   METH_VARARGS | METH_KEYWORDS,
-   "hub_score(weights=None, scale=True, arpack_options=None, return_eigenvalue=False)\n\n"
-   "Calculates Kleinberg's hub score for the vertices of the graph\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param scale: whether to normalize the scores so that the largest one\n"
-   "  is 1.\n"
-   "@param arpack_options: an L{ARPACKOptions} object used to fine-tune\n"
-   "  the ARPACK eigenvector calculation. If omitted, the module-level\n"
-   "  variable called C{arpack_options} is used.\n"
-   "@param return_eigenvalue: whether to return the largest eigenvalue\n"
-   "@return: the hub scores in a list and optionally the largest eigenvalue\n"
-   "  as a second member of a tuple\n\n"
-   "@see: authority_score()\n"
-  },
-
-  /* interface to igraph_induced_subgraph */
-  {"induced_subgraph", (PyCFunction) igraphmodule_Graph_induced_subgraph,
-   METH_VARARGS | METH_KEYWORDS,
-   "induced_subgraph(vertices, implementation=\"auto\")\n\n"
-   "Returns a subgraph spanned by the given vertices.\n\n"
-   "@param vertices: a list containing the vertex IDs which\n"
-   "  should be included in the result.\n"
-   "@param implementation: the implementation to use when constructing\n"
-   "  the new subgraph. igraph includes two implementations at the\n"
-   "  moment. C{\"copy_and_delete\"} copies the original graph and\n"
-   "  removes those vertices that are not in the given set. This is more\n"
-   "  efficient if the size of the subgraph is comparable to the original\n"
-   "  graph. The other implementation (C{\"create_from_scratch\"})\n"
-   "  constructs the result graph from scratch and then copies the\n"
-   "  attributes accordingly. This is a better solution if the subgraph\n"
-   "  is relatively small, compared to the original graph. C{\"auto\"}\n"
-   "  selects between the two implementations automatically, based on\n"
-   "  the ratio of the size of the subgraph and the size of the original\n"
-   "  graph.\n"
-   "@return: the subgraph\n"},
-
-  /* interface to igraph_is_bipartite */
-  {"is_bipartite", (PyCFunction) igraphmodule_Graph_is_bipartite,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_bipartite(return_types=False)\n\n"
-   "Decides whether the graph is bipartite or not.\n\n"
-   "Vertices of a bipartite graph can be partitioned into two groups A\n"
-   "and B in a way that all edges go between the two groups.\n\n"
-   "@param return_types: if C{False}, the method will simply\n"
-   "  return C{True} or C{False} depending on whether the graph is\n"
-   "  bipartite or not. If C{True}, the actual group assignments\n"
-   "  are also returned as a list of boolean values. (Note that\n"
-   "  the group assignment is not unique, especially if the graph\n"
-   "  consists of multiple components, since the assignments of\n"
-   "  components are independent from each other).\n"
-   "@return: C{True} if the graph is bipartite, C{False} if not.\n"
-   "  If C{return_types} is C{True}, the group assignment is also\n"
-   "  returned.\n"
-  },
-
-  /* interface to igraph_avg_nearest_neighbor_degree */
-  {"knn", (PyCFunction) igraphmodule_Graph_knn,
-   METH_VARARGS | METH_KEYWORDS,
-   "knn(vids=None, weights=None)\n\n"
-   "Calculates the average degree of the neighbors for each vertex, and\n"
-   "the same quantity as the function of vertex degree.\n\n"
-   "@param vids: the vertices for which the calculation is performed.\n"
-   "  C{None} means all vertices.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name. If this is given, the vertex strength\n"
-   "  will be used instead of the vertex degree in the calculations, but\n"
-   "  the \"ordinary\" vertex degree will be used for the second (degree-\n"
-   "  dependent) list in the result.\n"
-   "@return: two lists in a tuple. The first list contains the average\n"
-   "  degree of neighbors for each vertex, the second contains the average\n"
-   "  degree of neighbors as a function of vertex degree. The zeroth element\n"
-   "  of this list corresponds to vertices of degree 1.\n"
-  },
-
-  /* interface to igraph_is_connected */
-  {"is_connected", (PyCFunction) igraphmodule_Graph_is_connected,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_connected(mode=STRONG)\n\n"
-   "Decides whether the graph is connected.\n\n"
-   "@param mode: whether we should calculate strong or weak connectivity.\n"
-   "@return: C{True} if the graph is connected, C{False} otherwise.\n"},
-
-  /* interface to igraph_linegraph */
-  {"linegraph", (PyCFunction) igraphmodule_Graph_linegraph,
-   METH_VARARGS | METH_KEYWORDS,
-   "linegraph()\n\n"
-   "Returns the line graph of the graph.\n\n"
-   "The line graph M{L(G)} of an undirected graph is defined as follows:\n"
-   "M{L(G)} has one vertex for each edge in G and two vertices in M{L(G)}\n"
-   "are connected iff their corresponding edges in the original graph\n"
-   "share an end point.\n\n"
-   "The line graph of a directed graph is slightly different: two vertices\n"
-   "are connected by a directed edge iff the target of the first vertex's\n"
-   "corresponding edge is the same as the source of the second vertex's\n"
-   "corresponding edge.\n"
-  },
-
-  /* interface to igraph_maxdegree */
-  {"maxdegree", (PyCFunction) igraphmodule_Graph_maxdegree,
-   METH_VARARGS | METH_KEYWORDS,
-   "maxdegree(vertices=None, mode=ALL, loops=False)\n\n"
-   "Returns the maximum degree of a vertex set in the graph.\n\n"
-   "This method accepts a single vertex ID or a list of vertex IDs as a\n"
-   "parameter, and returns the degree of the given vertices (in the\n"
-   "form of a single integer or a list, depending on the input\n"
-   "parameter).\n"
-   "\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs, or\n"
-   "  C{None} meaning all the vertices in the graph.\n"
-   "@param mode: the type of degree to be returned (L{OUT} for\n"
-   "  out-degrees, L{IN} IN for in-degrees or L{ALL} for the sum of\n"
-   "  them).\n"
-   "@param loops: whether self-loops should be counted.\n"},
-
-  /* interface to igraph_neighborhood */
-  {"neighborhood", (PyCFunction) igraphmodule_Graph_neighborhood,
-   METH_VARARGS | METH_KEYWORDS,
-   "neighborhood(vertices=None, order=1, mode=ALL)\n\n"
-   "For each vertex specified by I{vertices}, returns the\n"
-   "vertices reachable from that vertex in at most I{order} steps.\n\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs, or\n"
-   "  C{None} meaning all the vertices in the graph.\n"
-   "@param mode: specifies how to take into account the direction of\n"
-   "  the edges if a directed graph is analyzed. C{\"out\"} means that\n"
-   "  only the outgoing edges are followed, so all vertices reachable\n"
-   "  from the source vertex in at most I{order} steps are counted.\n"
-   "  C{\"in\"} means that only the incoming edges are followed (in\n"
-   "  reverse direction of course), so all vertices from which the source\n"
-   "  vertex is reachable in at most I{order} steps are counted. C{\"all\"}\n"
-   "  treats directed edges as undirected.\n"
-   "@return: a single list specifying the neighborhood if I{vertices}\n"
-   "  was an integer specifying a single vertex index, or a list of lists\n"
-   "  if I{vertices} was a list or C{None}.\n"
-  },
-
-  /* interface to igraph_neighborhood_size */
-  {"neighborhood_size", (PyCFunction) igraphmodule_Graph_neighborhood_size,
-   METH_VARARGS | METH_KEYWORDS,
-   "neighborhood_size(vertices=None, order=1, mode=ALL)\n\n"
-   "For each vertex specified by I{vertices}, returns the number of\n"
-   "vertices reachable from that vertex in at most I{order} steps.\n\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs, or\n"
-   "  C{None} meaning all the vertices in the graph.\n"
-   "@param mode: specifies how to take into account the direction of\n"
-   "  the edges if a directed graph is analyzed. C{\"out\"} means that\n"
-   "  only the outgoing edges are followed, so all vertices reachable\n"
-   "  from the source vertex in at most I{order} steps are counted.\n"
-   "  C{\"in\"} means that only the incoming edges are followed (in\n"
-   "  reverse direction of course), so all vertices from which the source\n"
-   "  vertex is reachable in at most I{order} steps are counted. C{\"all\"}\n"
-   "  treats directed edges as undirected.\n"
-   "@return: a single number specifying the neighborhood size if I{vertices}\n"
-   "  was an integer specifying a single vertex index, or a list of sizes\n"
-   "  if I{vertices} was a list or C{None}.\n"
-  },
-
-  /* interface to igraph_personalized_pagerank */
-  {"personalized_pagerank", (PyCFunction) igraphmodule_Graph_personalized_pagerank,
-   METH_VARARGS | METH_KEYWORDS,
-   "personalized_pagerank(vertices=None, directed=True, damping=0.85, "
-   "reset=None, reset_vertices=None, weights=None, arpack_options=None)\n\n"
-   "Calculates the personalized PageRank values of a graph.\n\n"
-   "The personalized PageRank calculation is similar to the PageRank\n"
-   "calculation, but the random walk is reset to a non-uniform distribution\n"
-   "over the vertices in every step with probability M{1-damping} instead of a\n"
-   "uniform distribution.\n\n"
-   "@param vertices: the indices of the vertices being queried.\n"
-   "  C{None} means all of the vertices.\n"
-   "@param directed: whether to consider directed paths.\n"
-   "@param damping: the damping factor.\n"
-   "  M{1-damping} is the PageRank value for vertices with no\n"
-   "  incoming links.\n"
-   "@param reset: the distribution over the vertices to be used when resetting\n"
-   "  the random walk. Can be a sequence, an iterable or a vertex attribute\n"
-   "  name as long as they return a list of floats whose length is equal to\n"
-   "  the number of vertices. If C{None}, a uniform distribution is assumed,\n"
-   "  which makes the method equivalent to the original PageRank algorithm.\n"
-   "@param reset_vertices: an alternative way to specify the distribution\n"
-   "  over the vertices to be used when resetting the random walk. Simply\n"
-   "  supply a list of vertex IDs here, or a L{VertexSeq} or a L{Vertex}.\n"
-   "  Resetting will take place using a uniform distribution over the specified\n"
-   "  vertices.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param arpack_options: an L{ARPACKOptions} object used to fine-tune\n"
-   "  the ARPACK eigenvector calculation. If omitted, the module-level\n"
-   "  variable called C{arpack_options} is used.\n"
-   "@return: a list with the personalized PageRank values of the specified\n"
-   "  vertices.\n"},
-
-  /* interface to igraph_path_length_hist */
-  {"path_length_hist", (PyCFunction) igraphmodule_Graph_path_length_hist,
-   METH_VARARGS | METH_KEYWORDS,
-   "path_length_hist(directed=True)\n\n"
-   "Calculates the path length histogram of the graph\n"
-   "@attention: this function is wrapped in a more convenient syntax in the\n"
-   "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-   "@param directed: whether to consider directed paths\n"
-   "@return: a tuple. The first item of the tuple is a list of path lengths,\n"
-   "  the M{i}th element of the list contains the number of paths with length\n"
-   "  M{i+1}. The second item contains the number of unconnected vertex pairs\n"
-   "  as a float (since it might not fit into an integer)\n"
-  },
-
-  /* interface to igraph_permute_vertices */
-  {"permute_vertices", (PyCFunction) igraphmodule_Graph_permute_vertices,
-   METH_VARARGS | METH_KEYWORDS,
-   "permute_vertices(permutation)\n\n"
-   "Permutes the vertices of the graph according to the given permutation\n"
-   "and returns the new graph.\n\n"
-   "Vertex M{k} of the original graph will become vertex M{permutation[k]}\n"
-   "in the new graph. No validity checks are performed on the permutation\n"
-   "vector.\n\n"
-   "@return: the new graph\n"
-  },
-
-  /* interfaces to igraph_radius */
-  {"radius", (PyCFunction) igraphmodule_Graph_radius,
-   METH_VARARGS | METH_KEYWORDS,
-   "radius(mode=OUT)\n\n"
-   "Calculates the radius of the graph.\n\n"
-   "The radius of a graph is defined as the minimum eccentricity of\n"
-   "its vertices (see L{eccentricity()}).\n"
-   "@param mode: what kind of paths to consider for the calculation\n"
-   "  in case of directed graphs. C{OUT} considers paths that follow\n"
-   "  edge directions, C{IN} considers paths that follow the opposite\n"
-   "  edge directions, C{ALL} ignores edge directions. The argument is\n"
-   "  ignored for undirected graphs.\n"
-   "@return: the radius\n"
-   "@see: L{Graph.eccentricity()}"
-  },
-
-  /* interface to igraph_reciprocity */
-  {"reciprocity", (PyCFunction) igraphmodule_Graph_reciprocity,
-   METH_VARARGS | METH_KEYWORDS,
-   "reciprocity(ignore_loops=True, mode=\"default\")\n\n"
-   "Reciprocity defines the proportion of mutual connections in a\n"
-   "directed graph. It is most commonly defined as the probability\n"
-   "that the opposite counterpart of a directed edge is also included\n"
-   "in the graph. This measure is calculated if C{mode} is C{\"default\"}.\n"
-   "\n"
-   "Prior to igraph 0.6, another measure was implemented, defined as\n"
-   "the probability of mutual connection between a vertex pair if we\n"
-   "know that there is a (possibly non-mutual) connection between them.\n"
-   "In other words, (unordered) vertex pairs are classified into three\n"
-   "groups: (1) disconnected, (2) non-reciprocally connected and (3)\n"
-   "reciprocally connected. The result is the size of group (3), divided\n"
-   "by the sum of sizes of groups (2) and (3). This measure is calculated\n"
-   "if C{mode} is C{\"ratio\"}.\n"
-   "\n"
-   "@param ignore_loops: whether loop edges should be ignored.\n"
-   "@param mode: the algorithm to use to calculate the reciprocity; see\n"
-   "  above for more details.\n"
-   "@return: the reciprocity of the graph\n"
-  },
-
-  /* interface to igraph_rewire */
-  {"rewire", (PyCFunction) igraphmodule_Graph_rewire,
-   METH_VARARGS | METH_KEYWORDS,
-   "rewire(n=1000, mode=\"simple\")\n\n"
-   "Randomly rewires the graph while preserving the degree distribution.\n\n"
-   "Please note that the rewiring is done \"in-place\", so the original\n"
-   "graph will be modified. If you want to preserve the original graph,\n"
-   "use the L{copy} method before.\n\n"
-   "@param n: the number of rewiring trials.\n"
-   "@param mode: the rewiring algorithm to use. It can either be C{\"simple\"} or\n"
-   "  C{\"loops\"}; the former does not create or destroy loop edges while the\n"
-   "  latter does.\n"},
-
-  /* interface to igraph_rewire_edges */
-  {"rewire_edges", (PyCFunction) igraphmodule_Graph_rewire_edges,
-   METH_VARARGS | METH_KEYWORDS,
-   "rewire_edges(prob, loops=False, multiple=False)\n\n"
-   "Rewires the edges of a graph with constant probability.\n\n"
-   "Each endpoint of each edge of the graph will be rewired with a constant\n"
-   "probability, given in the first argument.\n\n"
-   "Please note that the rewiring is done \"in-place\", so the original\n"
-   "graph will be modified. If you want to preserve the original graph,\n"
-   "use the L{copy} method before.\n\n"
-   "@param prob: rewiring probability\n"
-   "@param loops: whether the algorithm is allowed to create loop edges\n"
-   "@param multiple: whether the algorithm is allowed to create multiple\n"
-   "  edges.\n"},
-
-  /* interface to igraph_shortest_paths */
-  {"shortest_paths", (PyCFunction) igraphmodule_Graph_shortest_paths,
-   METH_VARARGS | METH_KEYWORDS,
-   "shortest_paths(source=None, target=None, weights=None, mode=OUT)\n\n"
-   "Calculates shortest path lengths for given vertices in a graph.\n\n"
-   "The algorithm used for the calculations is selected automatically:\n"
-   "a simple BFS is used for unweighted graphs, Dijkstra's algorithm is\n"
-   "used when all the weights are positive. Otherwise, the Bellman-Ford\n"
-   "algorithm is used if the number of requested source vertices is larger\n"
-   "than 100 and Johnson's algorithm is used otherwise.\n\n"
-   "@param source: a list containing the source vertex IDs which should be\n"
-   "  included in the result. If C{None}, all vertices will be considered.\n"
-   "@param target: a list containing the target vertex IDs which should be\n"
-   "  included in the result. If C{None}, all vertices will be considered.\n"
-   "@param weights: a list containing the edge weights. It can also be\n"
-   "  an attribute name (edge weights are retrieved from the given\n"
-   "  attribute) or C{None} (all edges have equal weight).\n"
-   "@param mode: the type of shortest paths to be used for the\n"
-   "  calculation in directed graphs. L{OUT} means only outgoing,\n"
-   "  L{IN} means only incoming paths. L{ALL} means to consider\n"
-   "  the directed graph as an undirected one.\n"
-   "@return: the shortest path lengths for given vertices in a matrix\n"},
-
-  /* interface to igraph_simplify */
-  {"simplify", (PyCFunction) igraphmodule_Graph_simplify,
-   METH_VARARGS | METH_KEYWORDS,
-   "simplify(multiple=True, loops=True, combine_edges=None)\n\n"
-   "Simplifies a graph by removing self-loops and/or multiple edges.\n\n"
-   "\n"
-   "For example, suppose you have a graph with an edge attribute named\n"
-   "C{weight}. C{graph.simplify(combine_edges=max)} will take the\n"
-   "maximum of the weights of multiple edges and assign that weight to\n"
-   "the collapsed edge. C{graph.simplify(combine_edges=sum)} will\n"
-   "take the sum of the weights. You can also write\n"
-   "C{graph.simplify(combine_edges=dict(weight=\"sum\"))} or\n"
-   "C{graph.simplify(combine_edges=dict(weight=sum))}, since\n"
-   "C{sum} is recognised both as a Python built-in function and as\n"
-   "a string constant.\n\n"
-   "@param multiple: whether to remove multiple edges.\n"
-   "@param loops: whether to remove loops.\n"
-   "@param combine_edges: specifies how to combine the attributes of\n"
-   "  multiple edges between the same pair of vertices into a single\n"
-   "  attribute. If it is C{None}, only one of the edges will be kept\n"
-   "  and all the attributes will be lost. If it is a function, the\n"
-   "  attributes of multiple edges will be collected and passed on to\n"
-   "  that function which will return the new attribute value that has to\n"
-   "  be assigned to the single collapsed edge. It can also be one of\n"
-   "  the following string constants:\n\n"
-   "    - C{\"ignore\"}: all the edge attributes will be ignored.\n\n"
-   "    - C{\"sum\"}: the sum of the edge attribute values will be used for\n"
-   "      the new edge.\n\n"
-   "    - C{\"product\"}: the product of the edge attribute values will be used for\n"
-   "      the new edge.\n"
-   "    - C{\"mean\"}: the mean of the edge attribute values will be used for\n"
-   "      the new edge.\n\n"
-   "    - C{\"median\"}: the median of the edge attribute values will be used for\n"
-   "      the new edge.\n\n"
-   "    - C{\"min\"}: the minimum of the edge attribute values will be used for\n"
-   "      the new edge.\n\n"
-   "    - C{\"max\"}: the maximum of the edge attribute values will be used for\n"
-   "      the new edge.\n\n"
-   "    - C{\"first\"}: the attribute value of the first edge in the collapsed set\n"
-   "      will be used for the new edge.\n\n"
-   "    - C{\"last\"}: the attribute value of the last edge in the collapsed set\n"
-   "      will be used for the new edge.\n\n"
-   "    - C{\"random\"}: a randomly selected value will be used for the new edge\n\n"
-   "    - C{\"concat\"}: the attribute values will be concatenated for the new\n"
-   "      edge.\n\n"
-   "  You can also use a dict mapping edge attribute names to functions or\n"
-   "  the above string constants if you want to make the behaviour of the\n"
-   "  simplification process depend on the name of the attribute.\n"
-   "  C{None} is a special key in this dict, its value will be used for all\n"
-   "  the attributes not specified explicitly in the dictionary.\n"
-  },
-
-  /* interface to igraph_minimum_spanning_tree */
-  {"_spanning_tree", (PyCFunction) igraphmodule_Graph_spanning_tree,
-   METH_VARARGS | METH_KEYWORDS,
-   "_spanning_tree(weights=None)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.spanning_tree()"},
-
-  // interface to igraph_subcomponent
-  {"subcomponent", (PyCFunction) igraphmodule_Graph_subcomponent,
-   METH_VARARGS | METH_KEYWORDS,
-   "subcomponent(v, mode=ALL)\n\n"
-   "Determines the indices of vertices which are in the same component as a given vertex.\n\n"
-   "@param v: the index of the vertex used as the source/destination\n"
-   "@param mode: if equals to L{IN}, returns the vertex IDs from\n"
-   "  where the given vertex can be reached. If equals to L{OUT},\n"
-   "  returns the vertex IDs which are reachable from the given\n"
-   "  vertex. If equals to L{ALL}, returns all vertices within the\n"
-   "  same component as the given vertex, ignoring edge directions.\n"
-   "  Note that this is not equal to calculating the union of the \n"
-   "  results of L{IN} and L{OUT}.\n"
-   "@return: the indices of vertices which are in the same component as a given vertex.\n"},
-
-  /* interface to igraph_subgraph_edges */
-  {"subgraph_edges", (PyCFunction) igraphmodule_Graph_subgraph_edges,
-   METH_VARARGS | METH_KEYWORDS,
-   "subgraph_edges(edges, delete_vertices=True)\n\n"
-   "Returns a subgraph spanned by the given edges.\n\n"
-   "@param edges: a list containing the edge IDs which should\n"
-   "  be included in the result.\n"
-   "@param delete_vertices: if C{True}, vertices not incident on\n"
-   "  any of the specified edges will be deleted from the result.\n"
-   "  If C{False}, all vertices will be kept.\n"
-   "@return: the subgraph\n"},
-
-  /* interface to igraph_topological_sorting */
-  {"topological_sorting",
-   (PyCFunction) igraphmodule_Graph_topological_sorting,
-   METH_VARARGS | METH_KEYWORDS,
-   "topological_sorting(mode=OUT)\n\n"
-   "Calculates a possible topological sorting of the graph.\n\n"
-   "Returns a partial sorting and issues a warning if the graph is not\n"
-   "a directed acyclic graph.\n\n"
-   "@param mode: if L{OUT}, vertices are returned according to the\n"
-   "  forward topological order -- all vertices come before their\n"
-   "  successors. If L{IN}, all vertices come before their ancestors.\n"
-   "@return: a possible topological ordering as a list"},
-
-  // interface to igraph_transitivity_undirected
-  {"transitivity_undirected",
-   (PyCFunction) igraphmodule_Graph_transitivity_undirected,
-   METH_VARARGS | METH_KEYWORDS,
-   "transitivity_undirected(mode=\"nan\")\n\n"
-   "Calculates the global transitivity (clustering coefficient) of the\n"
-   "graph.\n\n"
-   "The transitivity measures the probability that two neighbors of a\n"
-   "vertex are connected. More precisely, this is the ratio of the\n"
-   "triangles and connected triplets in the graph. The result is a\n"
-   "single real number. Directed graphs are considered as undirected\n"
-   "ones.\n\n"
-   "Note that this measure is different from the local transitivity\n"
-   "measure (see L{transitivity_local_undirected()}) as it calculates\n"
-   "a single value for the whole graph.\n\n"
-   "@param mode: if C{TRANSITIVITY_ZERO} or C{\"zero\"}, the result will\n"
-   "  be zero if the graph does not have any triplets. If C{\"nan\"} or\n"
-   "  C{TRANSITIVITY_NAN}, the result will be C{NaN} (not a number).\n"
-   "@return: the transitivity\n"
-   "@see: L{transitivity_local_undirected()}, L{transitivity_avglocal_undirected()}\n"
-   "@newfield ref: Reference\n"
-   "@ref: S. Wasserman and K. Faust: I{Social Network Analysis: Methods and\n"
-   "  Applications}. Cambridge: Cambridge University Press, 1994."
-  },
-
-  /* interface to igraph_transitivity_local_undirected and
-   * igraph_transitivity_barrat */
-  {"transitivity_local_undirected",
-   (PyCFunction) igraphmodule_Graph_transitivity_local_undirected,
-   METH_VARARGS | METH_KEYWORDS,
-   "transitivity_local_undirected(vertices=None, mode=\"nan\", weights=None)\n\n"
-   "Calculates the local transitivity (clustering coefficient) of the\n"
-   "given vertices in the graph.\n\n"
-   "The transitivity measures the probability that two neighbors of a\n"
-   "vertex are connected. In case of the local transitivity, this\n"
-   "probability is calculated separately for each vertex.\n\n"
-   "Note that this measure is different from the global transitivity\n"
-   "measure (see L{transitivity_undirected()}) as it calculates\n"
-   "a transitivity value for each vertex individually.\n\n"
-   "The traditional local transitivity measure applies for unweighted graphs\n"
-   "only. When the C{weights} argument is given, this function calculates\n"
-   "the weighted local transitivity proposed by Barrat et al (see references).\n\n"
-   "@param vertices: a list containing the vertex IDs which should be\n"
-   "  included in the result. C{None} means all of the vertices.\n"
-   "@param mode: defines how to treat vertices with degree less than two.\n"
-   "  If C{TRANSITIVITT_ZERO} or C{\"zero\"}, these vertices will have\n"
-   "  zero transitivity. If C{TRANSITIVITY_NAN} or C{\"nan\"}, these\n"
-   "  vertices will have C{NaN} (not a number) as their transitivity.\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@return: the transitivities for the given vertices in a list\n"
-   "@see: L{transitivity_undirected()}, L{transitivity_avglocal_undirected()}\n"
-   "@newfield ref: Reference\n"
-   "@ref: Watts DJ and Strogatz S: I{Collective dynamics of small-world\n"
-   "  networks}. Nature 393(6884):440-442, 1998.\n"
-   "@ref: Barrat A, Barthelemy M, Pastor-Satorras R and Vespignani A:\n"
-   "  I{The architecture of complex weighted networks}. PNAS 101, 3747 (2004).\n"
-   "  U{http://arxiv.org/abs/cond-mat/0311416}."
-  },
-
-  /* interface to igraph_transitivity_avglocal_undirected */
-  {"transitivity_avglocal_undirected",
-   (PyCFunction) igraphmodule_Graph_transitivity_avglocal_undirected,
-   METH_VARARGS | METH_KEYWORDS,
-   "transitivity_avglocal_undirected(mode=\"nan\")\n\n"
-   "Calculates the average of the vertex transitivities of the graph.\n\n"
-   "The transitivity measures the probability that two neighbors of a\n"
-   "vertex are connected. In case of the average local transitivity,\n"
-   "this probability is calculated for each vertex and then the average\n"
-   "is taken. Vertices with less than two neighbors require special\n"
-   "treatment, they will either be left out from the calculation or\n"
-   "they will be considered as having zero transitivity, depending on\n"
-   "the I{mode} parameter.\n\n"
-   "Note that this measure is different from the global transitivity measure\n"
-   "(see L{transitivity_undirected()}) as it simply takes the average local\n"
-   "transitivity across the whole network.\n\n"
-   "@param mode: defines how to treat vertices with degree less than two.\n"
-   "  If C{TRANSITIVITT_ZERO} or C{\"zero\"}, these vertices will have\n"
-   "  zero transitivity. If C{TRANSITIVITY_NAN} or C{\"nan\"}, these\n"
-   "  vertices will be excluded from the average.\n"
-   "@see: L{transitivity_undirected()}, L{transitivity_local_undirected()}\n"
-   "@newfield ref: Reference\n"
-   "@ref: D. J. Watts and S. Strogatz: I{Collective dynamics of small-world\n"
-   "  networks}. Nature 393(6884):440-442, 1998."
-  },
-
-  /* interface to igraph_unfold_tree */
-  {"unfold_tree", (PyCFunction) igraphmodule_Graph_unfold_tree,
-   METH_VARARGS | METH_KEYWORDS,
-   "unfold_tree(sources=None, mode=OUT)\n\n"
-   "Unfolds the graph using a BFS to a tree by duplicating vertices as necessary.\n\n"
-   "@param sources: the source vertices to start the unfolding from. It should be a\n"
-   "  list of vertex indices, preferably one vertex from each connected component.\n"
-   "  You can use L{Graph.topological_sorting()} to determine a suitable set. A single\n"
-   "  vertex index is also accepted.\n"
-   "@param mode: which edges to follow during the BFS. C{OUT} follows outgoing edges,\n"
-   "  C{IN} follows incoming edges, C{ALL} follows both. Ignored for undirected\n"
-   "  graphs.\n"
-   "@return: the unfolded tree graph and a mapping from the new vertex indices to the\n"
-   "  old ones.\n"
-  },
-
-  /* interface to igraph_[st_]vertex_connectivity */
-  {"vertex_connectivity", (PyCFunction) igraphmodule_Graph_vertex_connectivity,
-   METH_VARARGS | METH_KEYWORDS,
-   "vertex_connectivity(source=-1, target=-1, checks=True, neighbors=\"error\")\n\n"
-   "Calculates the vertex connectivity of the graph or between some vertices.\n\n"
-   "The vertex connectivity between two given vertices is the number of vertices\n"
-   "that have to be removed in order to disconnect the two vertices into two\n"
-   "separate components. This is also the number of vertex disjoint directed\n"
-   "paths between the vertices (apart from the source and target vertices of\n"
-   "course). The vertex connectivity of the graph is the minimal vertex\n"
-   "connectivity over all vertex pairs.\n\n"
-   "This method calculates the vertex connectivity of a given vertex pair if both\n"
-   "the source and target vertices are given. If none of them is given (or they\n"
-   "are both negative), the overall vertex connectivity is returned.\n\n"
-   "@param source: the source vertex involved in the calculation.\n"
-   "@param target: the target vertex involved in the calculation.\n"
-   "@param checks: if the whole graph connectivity is calculated and this is\n"
-   "  C{True}, igraph performs some basic checks before calculation. If the\n"
-   "  graph is not strongly connected, then the connectivity is obviously\n"
-   "  zero. If the minimum degree is one, then the connectivity is\n"
-   "  also one. These simple checks are much faster than checking the entire\n"
-   "  graph, therefore it is advised to set this to C{True}. The parameter\n"
-   "  is ignored if the connectivity between two given vertices is computed.\n"
-   "@param neighbors: tells igraph what to do when the two vertices are\n"
-   "  connected. C{\"error\"} raises an exception, C{\"infinity\"} returns\n"
-   "  infinity, C{\"ignore\"} ignores the edge.\n"
-   "@return: the vertex connectivity\n"
-  },
-
-  /***********************/
-  /* SIMILARITY MEASURES */
-  /***********************/
-
-  /* interface to igraph_bibcoupling */
-  {"bibcoupling", (PyCFunction) igraphmodule_Graph_bibcoupling,
-   METH_VARARGS | METH_KEYWORDS,
-   "bibcoupling(vertices=None)\n\n"
-   "Calculates bibliographic coupling scores for given vertices in a graph.\n\n"
-   "@param vertices: the vertices to be analysed. If C{None}, all vertices\n"
-   "  will be considered.\n"
-   "@return: bibliographic coupling scores for all given vertices in a matrix."},
-  /* interface to igraph_cocitation */
-  {"cocitation", (PyCFunction) igraphmodule_Graph_cocitation,
-   METH_VARARGS | METH_KEYWORDS,
-   "cocitation(vertices=None)\n\n"
-   "Calculates cocitation scores for given vertices in a graph.\n\n"
-   "@param vertices: the vertices to be analysed. If C{None}, all vertices\n"
-   "  will be considered.\n"
-   "@return: cocitation scores for all given vertices in a matrix."},
-  /* interface to igraph_similarity_dice */
-  {"similarity_dice", (PyCFunction) igraphmodule_Graph_similarity_dice,
-   METH_VARARGS | METH_KEYWORDS,
-   "similarity_dice(vertices=None, pairs=None, mode=IGRAPH_ALL, loops=True)\n\n"
-   "Dice similarity coefficient of vertices.\n\n"
-   "The Dice similarity coefficient of two vertices is twice the number of\n"
-   "their common neighbors divided by the sum of their degrees. This\n"
-   "coefficient is very similar to the Jaccard coefficient, but usually\n"
-   "gives higher similarities than its counterpart.\n\n"
-   "@param vertices: the vertices to be analysed. If C{None} and I{pairs} is also\n"
-   "  C{None}, all vertices will be considered.\n"
-   "@param pairs: the vertex pairs to be analysed. If this is given, I{vertices}\n"
-   "  must be C{None}, and the similarity values will be calculated only for the\n"
-   "  given pairs. Vertex pairs must be specified as tuples of vertex IDs.\n"
-   "@param mode: which neighbors should be considered for directed graphs.\n"
-   "  Can be L{ALL}, L{IN} or L{OUT}, ignored for undirected graphs.\n"
-   "@param loops: whether vertices should be considered adjacent to\n"
-   "  themselves. Setting this to C{True} assumes a loop edge for all vertices\n"
-   "  even if none is present in the graph. Setting this to C{False} may\n"
-   "  result in strange results: nonadjacent vertices may have larger\n"
-   "  similarities compared to the case when an edge is added between them --\n"
-   "  however, this might be exactly the result you want to get.\n"
-   "@return: the pairwise similarity coefficients for the vertices specified,\n"
-   "  in the form of a matrix if C{pairs} is C{None} or in the form of a list\n"
-   "  if C{pairs} is not C{None}.\n"
-  },
-  /* interface to igraph_similarity_inverse_log_weighted */
-  {"similarity_inverse_log_weighted",
-    (PyCFunction) igraphmodule_Graph_similarity_inverse_log_weighted,
-   METH_VARARGS | METH_KEYWORDS,
-   "similarity_inverse_log_weighted(vertices=None, mode=IGRAPH_ALL)\n\n"
-   "Inverse log-weighted similarity coefficient of vertices.\n\n"
-   "Each vertex is assigned a weight which is 1 / log(degree). The\n"
-   "log-weighted similarity of two vertices is the sum of the weights\n"
-   "of their common neighbors.\n\n"
-   "@param vertices: the vertices to be analysed. If C{None}, all vertices\n"
-   "  will be considered.\n"
-   "@param mode: which neighbors should be considered for directed graphs.\n"
-   "  Can be L{ALL}, L{IN} or L{OUT}, ignored for undirected graphs.\n"
-   "  L{IN} means that the weights are determined by the out-degrees, L{OUT}\n"
-   "  means that the weights are determined by the in-degrees.\n"
-   "@return: the pairwise similarity coefficients for the vertices specified,\n"
-   "  in the form of a matrix (list of lists).\n"
-  },
-  /* interface to igraph_similarity_jaccard */
-  {"similarity_jaccard", (PyCFunction) igraphmodule_Graph_similarity_jaccard,
-   METH_VARARGS | METH_KEYWORDS,
-   "similarity_jaccard(vertices=None, pairs=None, mode=IGRAPH_ALL, loops=True)\n\n"
-   "Jaccard similarity coefficient of vertices.\n\n"
-   "The Jaccard similarity coefficient of two vertices is the number of their\n"
-   "common neighbors divided by the number of vertices that are adjacent to\n"
-   "at least one of them.\n\n"
-   "@param vertices: the vertices to be analysed. If C{None} and I{pairs} is also\n"
-   "  C{None}, all vertices will be considered.\n"
-   "@param pairs: the vertex pairs to be analysed. If this is given, I{vertices}\n"
-   "  must be C{None}, and the similarity values will be calculated only for the\n"
-   "  given pairs. Vertex pairs must be specified as tuples of vertex IDs.\n"
-   "@param mode: which neighbors should be considered for directed graphs.\n"
-   "  Can be L{ALL}, L{IN} or L{OUT}, ignored for undirected graphs.\n"
-   "@param loops: whether vertices should be considered adjacent to\n"
-   "  themselves. Setting this to C{True} assumes a loop edge for all vertices\n"
-   "  even if none is present in the graph. Setting this to C{False} may\n"
-   "  result in strange results: nonadjacent vertices may have larger\n"
-   "  similarities compared to the case when an edge is added between them --\n"
-   "  however, this might be exactly the result you want to get.\n"
-   "@return: the pairwise similarity coefficients for the vertices specified,\n"
-   "  in the form of a matrix if C{pairs} is C{None} or in the form of a list\n"
-   "  if C{pairs} is not C{None}.\n"
-  },
-
-  /******************/
-  /* MOTIF COUNTING */
-  /******************/
-  {"motifs_randesu", (PyCFunction) igraphmodule_Graph_motifs_randesu,
-   METH_VARARGS | METH_KEYWORDS,
-   "motifs_randesu(size=3, cut_prob=None, callback=None)\n\n"
-   "Counts the number of motifs in the graph\n\n"
-   "Motifs are small subgraphs of a given structure in a graph. It is\n"
-   "argued that the motif profile (ie. the number of different motifs in\n"
-   "the graph) is characteristic for different types of networks and\n"
-   "network function is related to the motifs in the graph.\n\n"
-   "This function is able to find the different motifs of size three\n"
-   "and four (ie. the number of different subgraphs with three and four\n"
-   "vertices) in the network.\n\n"
-   "In a big network the total number of motifs can be very large, so\n"
-   "it takes a lot of time to find all of them. In such cases, a sampling\n"
-   "method can be used. This function is capable of doing sampling via\n"
-   "the I{cut_prob} argument. This argument gives the probability that\n"
-   "a branch of the motif search tree will not be explored.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: S. Wernicke and F. Rasche: FANMOD: a tool for fast network\n"
-   "  motif detection, Bioinformatics 22(9), 1152--1153, 2006.\n\n"
-   "@param size: the size of the motifs (3 or 4).\n"
-   "@param cut_prob: the cut probabilities for different levels of the search\n"
-   "  tree. This must be a list of length I{size} or C{None} to find all\n"
-   "  motifs.\n"
-   "@param callback: C{None} or a callable that will be called for every motif\n"
-   "  found in the graph. The callable must accept three parameters: the graph\n"
-   "  itself, the list of vertices in the motif and the isomorphy class of the\n"
-   "  motif (see L{Graph.isoclass()}). The search will stop when the callback\n"
-   "  returns an object with a non-zero truth value or raises an exception.\n"
-   "@return: the list of motifs if I{callback} is C{None}, or C{None} otherwise\n"
-   "@see: Graph.motifs_randesu_no()\n"
-  },
-  {"motifs_randesu_no", (PyCFunction) igraphmodule_Graph_motifs_randesu_no,
-   METH_VARARGS | METH_KEYWORDS,
-   "motifs_randesu_no(size=3, cut_prob=None)\n\n"
-   "Counts the total number of motifs in the graph\n\n"
-   "Motifs are small subgraphs of a given structure in a graph.\n"
-   "This function counts the total number of motifs in a graph without\n"
-   "assigning isomorphism classes to them.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: S. Wernicke and F. Rasche: FANMOD: a tool for fast network\n"
-   "  motif detection, Bioinformatics 22(9), 1152--1153, 2006.\n\n"
-   "@param size: the size of the motifs (3 or 4).\n"
-   "@param cut_prob: the cut probabilities for different levels of the search\n"
-   "  tree. This must be a list of length I{size} or C{None} to find all\n"
-   "  motifs.\n"
-   "@see: Graph.motifs_randesu()\n"
-  },
-  {"motifs_randesu_estimate",
-   (PyCFunction) igraphmodule_Graph_motifs_randesu_estimate,
-   METH_VARARGS | METH_KEYWORDS,
-   "motifs_randesu_estimate(size=3, cut_prob=None, sample)\n\n"
-   "Counts the total number of motifs in the graph\n\n"
-   "Motifs are small subgraphs of a given structure in a graph.\n"
-   "This function estimates the total number of motifs in a graph without\n"
-   "assigning isomorphism classes to them by extrapolating from a random\n"
-   "sample of vertices.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: S. Wernicke and F. Rasche: FANMOD: a tool for fast network\n"
-   "  motif detection, Bioinformatics 22(9), 1152--1153, 2006.\n\n"
-   "@param size: the size of the motifs (3 or 4).\n"
-   "@param cut_prob: the cut probabilities for different levels of the search\n"
-   "  tree. This must be a list of length I{size} or C{None} to find all\n"
-   "  motifs.\n"
-   "@param sample: the size of the sample or the vertex IDs of the vertices\n"
-   "  to be used for sampling.\n"
-   "@see: Graph.motifs_randesu()\n"
-  },
-  {"dyad_census", (PyCFunction) igraphmodule_Graph_dyad_census,
-   METH_NOARGS,
-   "dyad_census()\n\n"
-   "Dyad census, as defined by Holland and Leinhardt\n\n"
-   "Dyad census means classifying each pair of vertices of a directed\n"
-   "graph into three categories: mutual, there is an edge from I{a} to\n"
-   "I{b} and also from I{b} to I{a}; asymmetric, there is an edge\n"
-   "either from I{a} to I{b} or from I{b} to I{a} but not the other way\n"
-   "and null, no edges between I{a} and I{b}.\n\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{DyadCensus} object.\n"
-   "  It is advised to use that.\n\n"
-   "@return: the number of mutual, asymmetric and null connections in a\n"
-   "  3-tuple."
-  },
-  {"triad_census", (PyCFunction) igraphmodule_Graph_triad_census,
-   METH_NOARGS,
-   "triad_census()\n\n"
-   "Triad census, as defined by Davis and Leinhardt\n\n"
-   "Calculating the triad census means classifying every triplets of\n"
-   "vertices in a directed graph. A triplet can be in one of 16 states,\n"
-   "these are listed in the documentation of the C interface of igraph.\n"
-   "\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{TriadCensus} object.\n"
-   "  It is advised to use that. The name of the triplet classes are\n"
-   "  also documented there.\n\n"
-  },
-
-  /********************/
-  /* LAYOUT FUNCTIONS */
-  /********************/
-
-  /* interface to igraph_layout_circle */
-  {"layout_circle", (PyCFunction) igraphmodule_Graph_layout_circle,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_circle(dim=2)\n\n"
-   "Places the vertices of the graph uniformly on a circle or a sphere.\n\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the calculated layout."},
-
-  /* interface to igraph_layout_grid */
-  {"layout_grid", (PyCFunction) igraphmodule_Graph_layout_grid,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_grid(width=0, height=0, dim=2)\n\n"
-   "Places the vertices of a graph in a 2D or 3D grid.\n\n"
-   "@param width: the number of vertices in a single row of the layout.\n"
-   "  Zero or negative numbers mean that the width should be determined\n"
-   "  automatically.\n"
-   "@param height: the number of vertices in a single column of the layout.\n"
-   "  Zero or negative numbers mean that the height should be determined\n"
-   "  automatically. It must not be given if the number of dimensions is 2.\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the calculated layout."},
-
-  /* interface to igraph_layout_star */
-  {"layout_star", (PyCFunction) igraphmodule_Graph_layout_star,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_star(center=0, order=None)\n\n"
-   "Calculates a star-like layout for the graph.\n\n"
-   "@param center: the ID of the vertex to put in the center\n"
-   "@param order: a numeric vector giving the order of the vertices\n"
-   "  (including the center vertex!). If it is C{None}, the vertices\n"
-   "  will be placed in increasing vertex ID order.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_kamada_kawai */
-  {"layout_kamada_kawai",
-   (PyCFunction) igraphmodule_Graph_layout_kamada_kawai,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_kamada_kawai(maxiter=1000, sigma=None, initemp=10, coolexp=0.99,\n"
-   "  kkconst=None, seed=None, minx=None, maxx=None, miny=None, maxy=None, \n"
-   "  minz=None, maxz=None, dim=2)\n\n"
-   "Places the vertices on a plane according to the Kamada-Kawai algorithm.\n\n"
-   "This is a force directed layout, see Kamada, T. and Kawai, S.:\n"
-   "An Algorithm for Drawing General Undirected Graphs.\n"
-   "Information Processing Letters, 31/1, 7--15, 1989.\n\n"
-   "@param maxiter: the number of iterations to perform.\n"
-   "@param sigma: the standard base deviation of the position\n"
-   "  change proposals. C{None} means the number of vertices / 4\n"
-   "@param initemp: initial temperature of the simulated annealing.\n"
-   "@param coolexp: cooling exponent of the simulated annealing.\n"
-   "@param kkconst: the Kamada-Kawai vertex attraction constant.\n"
-   "  C{None} means the square of the number of vertices.\n"
-   "@param minx: if not C{None}, it must be a vector with exactly as many\n"
-   "  elements as there are vertices in the graph. Each element is a\n"
-   "  minimum constraint on the X value of the vertex in the layout.\n"
-   "@param maxx: similar to I{minx}, but with maximum constraints\n"
-   "@param miny: similar to I{minx}, but with the Y coordinates\n"
-   "@param maxy: similar to I{maxx}, but with the Y coordinates\n"
-   "@param minz: similar to I{minx}, but with the Z coordinates. Use only\n"
-   "  for 3D layouts (C{dim}=3).\n"
-   "@param maxz: similar to I{maxx}, but with the Z coordinates. Use only\n"
-   "  for 3D layouts (C{dim}=3).\n"
-   "@param seed: if C{None}, uses a random starting layout for the\n"
-   "  algorithm. If a matrix (list of lists), uses the given matrix\n"
-   "  as the starting position.\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_drl */
-  {"layout_drl",
-   (PyCFunction) igraphmodule_Graph_layout_drl,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_drl(weights=None, fixed=None, seed=None, options=None, dim=2)\n\n"
-   "Places the vertices on a 2D plane or in the 3D space ccording to the DrL\n"
-   "layout algorithm.\n\n"
-   "This is an algorithm suitable for quite large graphs, but it can be\n"
-   "surprisingly slow for small ones (where the simpler force-based layouts\n"
-   "like C{layout_kamada_kawai()} or C{layout_fruchterman_reingold()} are\n"
-   "more useful.\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param seed: if C{None}, uses a random starting layout for the\n"
-   "  algorithm. If a matrix (list of lists), uses the given matrix\n"
-   "  as the starting position.\n"
-   "@param fixed: if a seed is given, you can specify some vertices to be\n"
-   "  kept fixed at their original position in the seed by passing an\n"
-   "  appropriate list here. The list must have exactly as many items as\n"
-   "  the number of vertices in the graph. Items of the list that evaluate\n"
-   "  to C{True} denote vertices that will not be moved.\n"
-   "@param options: if you give a string argument here, you can select from\n"
-   "  five default preset parameterisations: C{default}, C{coarsen} for a\n"
-   "  coarser layout, C{coarsest} for an even coarser layout, C{refine} for\n"
-   "  refining an existing layout and C{final} for finalizing a layout. If\n"
-   "  you supply an object that is not a string, the DrL layout parameters\n"
-   "  are retrieved from the respective keys of the object (so it should\n"
-   "  be a dict or something else that supports the mapping protocol).\n"
-   "  The following keys can be used:\n"
-   "  \n"
-   "    - C{edge_cut}: edge cutting is done in the late stages of the\n"
-   "      algorithm in order to achieve less dense layouts. Edges are\n"
-   "      cut if there is a lot of stress on them (a large value in the\n"
-   "      objective function sum). The edge cutting parameter is a value\n"
-   "      between 0 and 1 with 0 representing no edge cutting and 1\n"
-   "      representing maximal edge cutting.\n\n"
-   "    - C{init_iterations}: number of iterations in the initialization\n"
-   "      phase\n\n"
-   "    - C{init_temperature}: start temperature during initialization\n\n"
-   "    - C{init_attraction}: attraction during initialization\n\n"
-   "    - C{init_damping_mult}: damping multiplier during initialization\n\n"
-   "    - C{liquid_iterations}, C{liquid_temperature}, C{liquid_attraction},\n"
-   "      C{liquid_damping_mult}: same parameters for the liquid phase\n\n"
-   "    - C{expansion_iterations}, C{expansion_temperature},\n"
-   "      C{expansion_attraction}, C{expansion_damping_mult}:\n"
-   "      parameters for the expansion phase\n\n"
-   "    - C{cooldown_...}: parameters for the cooldown phase\n\n"
-   "    - C{crunch_...}: parameters for the crunch phase\n\n"
-   "    - C{simmer_...}: parameters for the simmer phase\n\n"
-   "  \n"
-   "  Instead of a mapping, you can also use an arbitrary Python object\n"
-   "  here: if the object does not support the mapping protocol, an\n"
-   "  attribute of the object with the same name is looked up instead. If\n"
-   "  a parameter cannot be found either as a key or an attribute, the\n"
-   "  default from the C{default} preset will be used.\n\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_fruchterman_reingold */
-  {"layout_fruchterman_reingold",
-   (PyCFunction) igraphmodule_Graph_layout_fruchterman_reingold,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_fruchterman_reingold(weights=None, maxiter=500, maxdelta=None, area=None,\n"
-   "  coolexp=1.5, repulserad=None, seed=None, minx=None, maxx=None, miny=None, \n"
-   "  maxy=None, minz=None, maxz=None, dim=2)\n\n"
-   "Places the vertices on a 2D plane or in the 3D space according to the\n"
-   "Fruchterman-Reingold algorithm.\n\n"
-   "This is a force directed layout, see Fruchterman, T. M. J. and Reingold, E. M.:\n"
-   "Graph Drawing by Force-directed Placement.\n"
-   "Software -- Practice and Experience, 21/11, 1129--1164, 1991\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param maxiter: the number of iterations to perform. The default\n"
-   "  is 500.\n"
-   "@param maxdelta: the maximum distance to move a vertex in\n"
-   "  an iteration. The default is the number of vertices.\n"
-   "@param area: the area of the square on which the vertices\n"
-   "  will be placed. The default is the square of the number of\n"
-   "  vertices.\n"
-   "@param coolexp: the cooling exponent of the simulated annealing.\n"
-   "  The default is 1.5.\n"
-   "@param repulserad: determines the radius at which vertex-vertex\n"
-   "  repulsion cancels out attraction of adjacent vertices.\n"
-   "  The default is the number of vertices^3.\n"
-   "@param minx: if not C{None}, it must be a vector with exactly as many\n"
-   "  elements as there are vertices in the graph. Each element is a\n"
-   "  minimum constraint on the X value of the vertex in the layout.\n"
-   "@param maxx: similar to I{minx}, but with maximum constraints\n"
-   "@param miny: similar to I{minx}, but with the Y coordinates\n"
-   "@param maxy: similar to I{maxx}, but with the Y coordinates\n"
-   "@param minz: similar to I{minx}, but with the Z coordinates. Use only\n"
-   "  for 3D layouts (C{dim}=3).\n"
-   "@param maxz: similar to I{maxx}, but with the Z coordinates. Use only\n"
-   "  for 3D layouts (C{dim}=3).\n"
-   "@param seed: if C{None}, uses a random starting layout for the\n"
-   "  algorithm. If a matrix (list of lists), uses the given matrix\n"
-   "  as the starting position.\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_graphopt */
-  {"layout_graphopt",
-   (PyCFunction) igraphmodule_Graph_layout_graphopt,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_graphopt(niter=500, node_charge=0.001, node_mass=30, spring_length=0, spring_constant=1, max_sa_movement=5, seed=None)\n\n"
-   "This is a port of the graphopt layout algorithm by Michael Schmuhl.\n"
-   "graphopt version 0.4.1 was rewritten in C and the support for layers\n"
-   "was removed.\n\n"
-   "graphopt uses physical analogies for defining attracting and repelling\n"
-   "forces among the vertices and then the physical system is simulated\n"
-   "until it reaches an equilibrium or the maximal number of iterations is\n"
-   "reached.\n\n"
-   "See U{http://www.schmuhl.org/graphopt/} for the original graphopt.\n\n"
-   "@param niter: the number of iterations to perform. Should be a couple\n"
-   "  of hundred in general.\n\n"
-   "@param node_charge: the charge of the vertices, used to calculate electric\n"
-   "  repulsion.\n"
-   "@param node_mass: the mass of the vertices, used for the spring forces\n"
-   "@param spring_length: the length of the springs\n"
-   "@param spring_constant: the spring constant\n"
-   "@param max_sa_movement: the maximum amount of movement allowed in a single\n"
-   "  step along a single axis.\n"
-   "@param seed: a matrix containing a seed layout from which the algorithm\n"
-   "  will be started. If C{None}, a random layout will be used.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_grid_fruchterman_reingold */
-  {"layout_grid_fruchterman_reingold",
-   (PyCFunction) igraphmodule_Graph_layout_grid_fruchterman_reingold,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_grid_fruchterman_reingold(maxiter=500, maxdelta=None, area=None, coolexp=0.99, repulserad=maxiter*maxdelta, cellsize=None, seed=None)\n\n"
-   "Places the vertices on a 2D plane according to the Fruchterman-Reingold\n"
-   "grid algorithm.\n\n"
-   "This is a modified version of a force directed layout, see\n"
-   "Fruchterman, T. M. J. and Reingold, E. M.:\n"
-   "Graph Drawing by Force-directed Placement.\n"
-   "Software -- Practice and Experience, 21/11, 1129--1164, 1991.\n"
-   "The algorithm partitions the 2D space to a grid and vertex\n"
-   "repulsion is then calculated only for vertices nearby.\n\n"
-   "@param maxiter: the number of iterations to perform.\n"
-   "@param maxdelta: the maximum distance to move a vertex in\n"
-   "  an iteration. C{None} means the number of vertices.\n"
-   "@param area: the area of the square on which the vertices\n"
-   "  will be placed. C{None} means the square of M{maxdelta}.\n"
-   "@param coolexp: the cooling exponent of the simulated annealing.\n"
-   "@param repulserad: determines the radius at which vertex-vertex\n"
-   "  repulsion cancels out attraction of adjacent vertices.\n"
-   "  C{None} means M{maxiter*maxdelta}.\n"
-   "@param cellsize: the size of the grid cells. When calculating the\n"
-   "  repulsion forces, only vertices in the same or neighboring\n"
-   "  grid cells are taken into account. Defaults to the fourth\n"
-   "  root of M{area}.\n"
-   "@param seed: if C{None}, uses a random starting layout for the\n"
-   "  algorithm. If a matrix (list of lists), uses the given matrix\n"
-   "  as the starting position.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_lgl */
-  {"layout_lgl", (PyCFunction) igraphmodule_Graph_layout_lgl,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_lgl(maxiter=150, maxdelta=-1, area=-1, coolexp=1.5, repulserad=-1, cellsize=-1, root=None)\n\n"
-   "Places the vertices on a 2D plane according to the Large Graph Layout.\n\n"
-   "@param maxiter: the number of iterations to perform.\n"
-   "@param maxdelta: the maximum distance to move a vertex in\n"
-   "  an iteration. If negative, defaults to the number of vertices.\n"
-   "@param area: the area of the square on which the vertices\n"
-   "  will be placed. If negative, defaults to the number of vertices\n"
-   "  squared.\n"
-   "@param coolexp: the cooling exponent of the simulated annealing.\n"
-   "@param repulserad: determines the radius at which vertex-vertex\n"
-   "  repulsion cancels out attraction of adjacent vertices.\n"
-   "  If negative, defaults to M{area} times the number of vertices.\n"
-   "@param cellsize: the size of the grid cells. When calculating the\n"
-   "  repulsion forces, only vertices in the same or neighboring\n"
-   "  grid cells are taken into account. Defaults to the fourth\n"
-   "  root of M{area}.\n"
-   "@param root: the root vertex, this is placed first, its neighbors\n"
-   "  in the first iteration, second neighbors in the second,\n"
-   "  etc. C{None} means that a random vertex will be chosen.\n"
-   "@return: the calculated layout."
-  },
-
-  /* interface to igraph_layout_mds */
-  {"layout_mds",
-   (PyCFunction) igraphmodule_Graph_layout_mds,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_mds(dist=None, dim=2, arpack_options=None)\n"
-   "Places the vertices in an Euclidean space with the given number of\n"
-   "dimensions using multidimensional scaling.\n\n"
-   "This layout requires a distance matrix, where the intersection of\n"
-   "row M{i} and column M{j} specifies the desired distance between\n"
-   "vertex M{i} and vertex M{j}. The algorithm will try to place the\n"
-   "vertices in a way that approximates the distance relations\n"
-   "prescribed in the distance matrix. igraph uses the classical\n"
-   "multidimensional scaling by Torgerson (see reference below).\n\n"
-   "For unconnected graphs, the method will decompose the graph into\n"
-   "weakly connected components and then lay out the components\n"
-   "individually using the appropriate parts of the distance matrix.\n\n"
-   "@param dist: the distance matrix. It must be symmetric and the\n"
-   "  symmetry is not checked -- results are unspecified when a\n"
-   "  non-symmetric distance matrix is used. If this parameter is\n"
-   "  C{None}, the shortest path lengths will be used as distances.\n"
-   "  Directed graphs are treated as undirected when calculating\n"
-   "  the shortest path lengths to ensure symmetry.\n"
-   "@param dim: the number of dimensions. For 2D layouts, supply\n"
-   "  2 here; for 3D layouts, supply 3.\n"
-   "@param arpack_options: an L{ARPACKOptions} object used to fine-tune\n"
-   "  the ARPACK eigenvector calculation. If omitted, the module-level\n"
-   "  variable called C{arpack_options} is used.\n"
-   "@return: the calculated layout.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Cox & Cox: Multidimensional Scaling (1994), Chapman and\n"
-   "  Hall, London.\n"
-  },
-
-  /* interface to igraph_layout_reingold_tilford */
-  {"layout_reingold_tilford",
-   (PyCFunction) igraphmodule_Graph_layout_reingold_tilford,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_reingold_tilford(mode=\"out\", root=None, rootlevel=None)\n"
-   "Places the vertices on a 2D plane according to the Reingold-Tilford\n"
-   "layout algorithm.\n\n"
-   "This is a tree layout. If the given graph is not a tree, a breadth-first\n"
-   "search is executed first to obtain a possible spanning tree.\n\n"
-   "@param mode: specifies which edges to consider when builing the tree.\n"
-   "  If it is C{OUT} then only the outgoing, if it is C{IN} then only the\n"
-   "  incoming edges of a parent are considered. If it is C{ALL} then all\n"
-   "  edges are used (this was the behaviour in igraph 0.5 and before).\n"
-   "  This parameter also influences how the root vertices are calculated\n"
-   "  if they are not given. See the I{root} parameter.\n"
-   "@param root: the index of the root vertex or root vertices.\n"
-   "  if this is a non-empty vector then the supplied vertex IDs are\n"
-   "  used as the roots of the trees (or a single tree if the graph is\n"
-   "  connected. If this is C{None} or an empty list, the root vertices\n"
-   "  are automatically calculated based on topological sorting,\n"
-   "  performed with the opposite of the I{mode} argument.\n"
-   "@param rootlevel: this argument is useful when drawing forests which are\n"
-   "  not trees. It specifies the level of the root vertices for every tree\n"
-   "  in the forest.\n"
-   "@return: the calculated layout.\n\n"
-   "@see: layout_reingold_tilford_circular\n"
-   "@newfield ref: Reference\n"
-   "@ref: EM Reingold, JS Tilford: I{Tidier Drawings of Trees.}\n"
-   "IEEE Transactions on Software Engineering 7:22, 223-228, 1981."},
-
-  /* interface to igraph_layout_reingold_tilford_circular */
-  {"layout_reingold_tilford_circular",
-   (PyCFunction) igraphmodule_Graph_layout_reingold_tilford_circular,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_reingold_tilford_circular(mode=\"out\", root=None, rootlevel=None)\n"
-   "Circular Reingold-Tilford layout for trees.\n\n"
-   "This layout is similar to the Reingold-Tilford layout, but the vertices\n"
-   "are placed in a circular way, with the root vertex in the center.\n\n"
-   "See L{layout_reingold_tilford} for the explanation of the parameters.\n\n"
-   "@return: the calculated layout.\n\n"
-   "@see: layout_reingold_tilford\n"
-   "@newfield ref: Reference\n"
-   "@ref: EM Reingold, JS Tilford: I{Tidier Drawings of Trees.}\n"
-   "IEEE Transactions on Software Engineering 7:22, 223-228, 1981."},
-
-  /* interface to igraph_layout_random */
-  {"layout_random", (PyCFunction) igraphmodule_Graph_layout_random,
-   METH_VARARGS | METH_KEYWORDS,
-   "layout_random(dim=2)\n"
-   "Places the vertices of the graph randomly.\n\n"
-   "@param dim: the desired number of dimensions for the layout. dim=2\n"
-   "  means a 2D layout, dim=3 means a 3D layout.\n"
-   "@return: the coordinate pairs in a list."},
-
-  /* interface to igraph_layout_sugiyama */
-  {"_layout_sugiyama",
-   (PyCFunction) igraphmodule_Graph_layout_sugiyama,
-   METH_VARARGS | METH_KEYWORDS,
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.layout_sugiyama()\n\n"},
-
-  ////////////////////////////
-  // VISITOR-LIKE FUNCTIONS //
-  ////////////////////////////
-  {"bfs", (PyCFunction) igraphmodule_Graph_bfs,
-   METH_VARARGS | METH_KEYWORDS,
-   "bfs(vid, mode=OUT)\n\n"
-   "Conducts a breadth first search (BFS) on the graph.\n\n"
-   "@param vid: the root vertex ID\n"
-   "@param mode: either L{IN} or L{OUT} or L{ALL}, ignored\n"
-   "  for undirected graphs.\n"
-   "@return: a tuple with the following items:\n"
-   "   - The vertex IDs visited (in order)\n"
-   "   - The start indices of the layers in the vertex list\n"
-   "   - The parent of every vertex in the BFS\n"},
-  {"bfsiter", (PyCFunction) igraphmodule_Graph_bfsiter,
-   METH_VARARGS | METH_KEYWORDS,
-   "bfsiter(vid, mode=OUT, advanced=False)\n\n"
-   "Constructs a breadth first search (BFS) iterator of the graph.\n\n"
-   "@param vid: the root vertex ID\n"
-   "@param mode: either L{IN} or L{OUT} or L{ALL}.\n"
-   "@param advanced: if C{False}, the iterator returns the next\n"
-   "  vertex in BFS order in every step. If C{True}, the iterator\n"
-   "  returns the distance of the vertex from the root and the\n"
-   "  parent of the vertex in the BFS tree as well.\n"
-   "@return: the BFS iterator as an L{igraph.BFSIter} object.\n"},
-
-  /////////////////
-  // CONVERSIONS //
-  /////////////////
-
-  // interface to igraph_get_adjacency
-  {"get_adjacency", (PyCFunction) igraphmodule_Graph_get_adjacency,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_adjacency(type=GET_ADJACENCY_BOTH, eids=False)\n\n"
-   "Returns the adjacency matrix of a graph.\n\n"
-   "@param type: either C{GET_ADJACENCY_LOWER} (uses the\n"
-   "  lower triangle of the matrix) or C{GET_ADJACENCY_UPPER}\n"
-   "  (uses the upper triangle) or C{GET_ADJACENCY_BOTH}\n"
-   "  (uses both parts). Ignored for directed graphs.\n"
-   "@param eids: if C{True}, the result matrix will contain\n"
-   "  zeros for non-edges and the ID of the edge plus one\n"
-   "  for edges in the appropriate cell. If C{False}, the\n"
-   "  result matrix will contain the number of edges for\n"
-   "  each vertex pair.\n"
-   "@return: the adjacency matrix.\n"},
-
-  // interface to igraph_get_edgelist
-  {"get_edgelist", (PyCFunction) igraphmodule_Graph_get_edgelist,
-   METH_NOARGS,
-   "get_edgelist()\n\n" "Returns the edge list of a graph."},
-
-  /* interface to igraph_get_incidence */
-  {"get_incidence", (PyCFunction) igraphmodule_Graph_get_incidence,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_incidence(types)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: Graph.get_incidence()\n\n"},
-
-  // interface to igraph_to_directed
-  {"to_directed", (PyCFunction) igraphmodule_Graph_to_directed,
-   METH_VARARGS | METH_KEYWORDS,
-   "to_directed(mutual=True)\n\n"
-   "Converts an undirected graph to directed.\n\n"
-   "@param mutual: C{True} if mutual directed edges should be\n"
-   "  created for every undirected edge. If C{False}, a directed\n"
-   "  edge with arbitrary direction is created.\n"},
-
-  // interface to igraph_to_undirected
-  {"to_undirected", (PyCFunction) igraphmodule_Graph_to_undirected,
-   METH_VARARGS | METH_KEYWORDS,
-   "to_undirected(mode=\"collapse\", combine_edges=None)\n\n"
-   "Converts a directed graph to undirected.\n\n"
-   "@param mode: specifies what to do with multiple directed edges\n"
-   "  going between the same vertex pair. C{True} or C{\"collapse\"}\n"
-   "  means that only a single edge should be created from multiple\n"
-   "  directed edges. C{False} or C{\"each\"} means that every edge\n"
-   "  will be kept (with the arrowheads removed). C{\"mutual\"}\n"
-   "  creates one undirected edge for each mutual directed edge pair.\n"
-   "@param combine_edges: specifies how to combine the attributes of\n"
-   "  multiple edges between the same pair of vertices into a single\n"
-   "  attribute. See L{Graph.simplify()} for more details.\n"
-  },
-
-  /* interface to igraph_laplacian */
-  {"laplacian", (PyCFunction) igraphmodule_Graph_laplacian,
-   METH_VARARGS | METH_KEYWORDS,
-   "laplacian(weights=None, normalized=False)\n\n"
-   "Returns the Laplacian matrix of a graph.\n\n"
-   "The Laplacian matrix is similar to the adjacency matrix, but the edges\n"
-   "are denoted with -1 and the diagonal contains the node degrees.\n\n"
-   "Normalized Laplacian matrices have 1 or 0 in their diagonals (0 for vertices\n"
-   "with no edges), edges are denoted by 1 / sqrt(d_i * d_j) where d_i is the\n"
-   "degree of node i.\n\n"
-   "Multiple edges and self-loops are silently ignored. Although it is\n"
-   "possible to calculate the Laplacian matrix of a directed graph, it does\n"
-   "not make much sense.\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name. When edge weights are used, the degree\n"
-   "  of a node is considered to be the weight of its incident edges.\n"
-   "@param normalized: whether to return the normalized Laplacian matrix.\n"
-   "@return: the Laplacian matrix.\n"},
-
-  ///////////////////////////////
-  // LOADING AND SAVING GRAPHS //
-  ///////////////////////////////
-
-  // interface to igraph_read_graph_dimacs
-  {"Read_DIMACS", (PyCFunction) igraphmodule_Graph_Read_DIMACS,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_DIMACS(f, directed=False)\n\n"
-   "Reads a graph from a file conforming to the DIMACS minimum-cost flow file format.\n\n"
-   "For the exact description of the format, see\n"
-   "U{http://lpsolve.sourceforge.net/5.5/DIMACS.htm}\n\n"
-   "Restrictions compared to the official description of the format:\n\n"
-   "  - igraph's DIMACS reader requires only three fields in an arc definition,\n"
-   "    describing the edge's source and target node and its capacity.\n"
-   "  - Source vertices are identified by 's' in the FLOW field, target vertices are\n"
-   "    identified by 't'.\n"
-   "  - Node indices start from 1. Only a single source and target node is allowed.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param directed: whether the generated graph should be directed.\n"
-   "@return: the generated graph, the source and the target of the flow and the edge\n"
-   "  capacities in a tuple\n"},
-
-  /* interface to igraph_read_graph_dl */
-  {"Read_DL", (PyCFunction) igraphmodule_Graph_Read_DL,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_DL(f, directed=True)\n\n"
-   "Reads an UCINET DL file and creates a graph based on it.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param directed: whether the generated graph should be directed.\n"},
-
-  /* interface to igraph_read_graph_edgelist */
-  {"Read_Edgelist", (PyCFunction) igraphmodule_Graph_Read_Edgelist,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_Edgelist(f, directed=True)\n\n"
-   "Reads an edge list from a file and creates a graph based on it.\n\n"
-   "Please note that the vertex indices are zero-based.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param directed: whether the generated graph should be directed.\n"},
-  /* interface to igraph_read_graph_graphdb */
-  {"Read_GraphDB", (PyCFunction) igraphmodule_Graph_Read_GraphDB,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_GraphDB(f, directed=False)\n\n"
-   "Reads a GraphDB format file and creates a graph based on it.\n\n"
-   "GraphDB is a binary format, used in the graph database for\n"
-   "isomorphism testing (see U{http://amalfi.dis.unina.it/graph/}).\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param directed: whether the generated graph should be directed.\n"},
-  /* interface to igraph_read_graph_graphml */
-  {"Read_GraphML", (PyCFunction) igraphmodule_Graph_Read_GraphML,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_GraphML(f, directed=True, index=0)\n\n"
-   "Reads a GraphML format file and creates a graph based on it.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param index: if the GraphML file contains multiple graphs,\n"
-   "  specifies the one that should be loaded. Graph indices\n"
-   "  start from zero, so if you want to load the first graph,\n"
-   "  specify 0 here.\n"},
-  /* interface to igraph_read_graph_gml */
-  {"Read_GML", (PyCFunction) igraphmodule_Graph_Read_GML,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_GML(f)\n\n"
-   "Reads a GML file and creates a graph based on it.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-  },
-  /* interface to igraph_read_graph_ncol */
-  {"Read_Ncol", (PyCFunction) igraphmodule_Graph_Read_Ncol,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_Ncol(f, names=True, weights=\"if_present\", directed=True)\n\n"
-   "Reads an .ncol file used by LGL.\n\n"
-   "It is also useful for creating graphs from \"named\" (and\n"
-   "optionally weighted) edge lists.\n\n"
-   "This format is used by the Large Graph Layout program. See the\n"
-   "U{documentation of LGL <http://bioinformatics.icmb.utexas.edu/lgl/>}\n"
-   "regarding the exact format description.\n\n"
-   "LGL originally cannot deal with graphs containing multiple or loop\n"
-   "edges, but this condition is not checked here, as igraph is happy\n"
-   "with these.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param names: If C{True}, the vertex names are added as a\n"
-   "  vertex attribute called 'name'.\n"
-   "@param weights: If True, the edge weights are added as an\n"
-   "  edge attribute called 'weight', even if there are no\n"
-   "  weights in the file. If False, the edge weights are never\n"
-   "  added, even if they are present. C{\"auto\"} or C{\"if_present\"}\n"
-   "  means that weights are added if there is at least one weighted\n"
-   "  edge in the input file, but they are not added otherwise.\n"
-   "@param directed: whether the graph being created should be\n"
-   "  directed\n"
-  },
-  /* interface to igraph_read_graph_lgl */
-  {"Read_Lgl", (PyCFunction) igraphmodule_Graph_Read_Lgl,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_Lgl(f, names=True, weights=\"if_present\", directed=True)\n\n"
-   "Reads an .lgl file used by LGL.\n\n"
-   "It is also useful for creating graphs from \"named\" (and\n"
-   "optionally weighted) edge lists.\n\n"
-   "This format is used by the Large Graph Layout program. See the\n"
-   "U{documentation of LGL <http://bioinformatics.icmb.utexas.edu/lgl/>}\n"
-   "regarding the exact format description.\n\n"
-   "LGL originally cannot deal with graphs containing multiple or loop\n"
-   "edges, but this condition is not checked here, as igraph is happy\n"
-   "with these.\n\n"
-   "@param f: the name of the file or a Python file handle\n"
-   "@param names: If C{True}, the vertex names are added as a\n"
-   "  vertex attribute called 'name'.\n"
-   "@param weights: If True, the edge weights are added as an\n"
-   "  edge attribute called 'weight', even if there are no\n"
-   "  weights in the file. If False, the edge weights are never\n"
-   "  added, even if they are present. C{\"auto\"} or C{\"if_present\"}\n"
-   "  means that weights are added if there is at least one weighted\n"
-   "  edge in the input file, but they are not added otherwise.\n"
-   "@param directed: whether the graph being created should be\n"
-   "  directed\n"
-  },
-  /* interface to igraph_read_graph_pajek */
-  {"Read_Pajek", (PyCFunction) igraphmodule_Graph_Read_Pajek,
-   METH_VARARGS | METH_KEYWORDS | METH_CLASS,
-   "Read_Pajek(f)\n\n"
-   "Reads a Pajek format file and creates a graph based on it.\n\n"
-   "@param f: the name of the file or a Python file handle\n"},
-  /* interface to igraph_write_graph_dimacs */
-  {"write_dimacs", (PyCFunction) igraphmodule_Graph_write_dimacs,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_dimacs(f, source, target, capacity=None)\n\n"
-   "Writes the graph in DIMACS format to the given file.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   "@param source: the source vertex ID\n"
-   "@param target: the target vertex ID\n"
-   "@param capacity: the capacities of the edges in a list. If it is not a\n"
-   "  list, the corresponding edge attribute will be used to retrieve\n"
-   "  capacities."},
-  /* interface to igraph_write_graph_dot */
-  {"write_dot", (PyCFunction) igraphmodule_Graph_write_dot,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_dot(f)\n\n"
-   "Writes the graph in DOT format to the given file.\n\n"
-   "DOT is the format used by the U{GraphViz <http://www.graphviz.org>}\n"
-   "software package.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   },
-  /* interface to igraph_write_graph_edgelist */
-  {"write_edgelist", (PyCFunction) igraphmodule_Graph_write_edgelist,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_edgelist(f)\n\n"
-   "Writes the edge list of a graph to a file.\n\n"
-   "Directed edges are written in (from, to) order.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"},
-  /* interface to igraph_write_graph_gml */
-  {"write_gml", (PyCFunction) igraphmodule_Graph_write_gml,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_gml(f, creator=None, ids=None)\n\n"
-   "Writes the graph in GML format to the given file.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   "@param creator: optional creator information to be written to the file.\n"
-   "  If C{None}, the current date and time is added.\n"
-   "@param ids: optional numeric vertex IDs to use in the file. This must\n"
-   "  be a list of integers or C{None}. If C{None}, the C{id} attribute of\n"
-   "  the vertices are used, or if they don't exist, numeric vertex IDs\n"
-   "  will be generated automatically."},
-  /* interface to igraph_write_graph_ncol */
-  {"write_ncol", (PyCFunction) igraphmodule_Graph_write_ncol,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_ncol(f, names=\"name\", weights=\"weights\")\n\n"
-   "Writes the edge list of a graph to a file in .ncol format.\n\n"
-   "Note that multiple edges and/or loops break the LGL software,\n"
-   "but igraph does not check for this condition. Unless you know\n"
-   "that the graph does not have multiple edges and/or loops, it\n"
-   "is wise to call L{simplify()} before saving.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   "@param names: the name of the vertex attribute containing the name\n"
-   "  of the vertices. If you don't want to store vertex names,\n"
-   "  supply C{None} here.\n"
-   "@param weights: the name of the edge attribute containing the weight\n"
-   "  of the vertices. If you don't want to store weights,\n"
-   "  supply C{None} here.\n"},
-  /* interface to igraph_write_graph_lgl */
-  {"write_lgl", (PyCFunction) igraphmodule_Graph_write_lgl,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_lgl(f, names=\"name\", weights=\"weights\", isolates=True)\n\n"
-   "Writes the edge list of a graph to a file in .lgl format.\n\n"
-   "Note that multiple edges and/or loops break the LGL software,\n"
-   "but igraph does not check for this condition. Unless you know\n"
-   "that the graph does not have multiple edges and/or loops, it\n"
-   "is wise to call L{simplify()} before saving.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   "@param names: the name of the vertex attribute containing the name\n"
-   "  of the vertices. If you don't want to store vertex names,\n"
-   "  supply C{None} here.\n"
-   "@param weights: the name of the edge attribute containing the weight\n"
-   "  of the vertices. If you don't want to store weights,\n"
-   "  supply C{None} here.\n"
-   "@param isolates: whether to include isolated vertices in the output.\n"},
-  /* interface to igraph_write_graph_pajek */
-  {"write_pajek", (PyCFunction) igraphmodule_Graph_write_pajek,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_pajek(f)\n\n"
-   "Writes the graph in Pajek format to the given file.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   },
-  /* interface to igraph_write_graph_edgelist */
-  {"write_graphml", (PyCFunction) igraphmodule_Graph_write_graphml,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_graphml(f)\n\n"
-   "Writes the graph to a GraphML file.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-  },
-  /* interface to igraph_write_graph_leda */
-  {"write_leda", (PyCFunction) igraphmodule_Graph_write_leda,
-   METH_VARARGS | METH_KEYWORDS,
-   "write_leda(f, names=\"name\", weights=\"weights\")\n\n"
-   "Writes the graph to a file in LEDA native format.\n\n"
-   "The LEDA format supports at most one attribute per vertex and edge. You can\n"
-   "specify which vertex and edge attribute you want to use. Note that the\n"
-   "name of the attribute is not saved in the LEDA file.\n\n"
-   "@param f: the name of the file to be written or a Python file handle\n"
-   "@param names: the name of the vertex attribute to be stored along with\n"
-   "  the vertices. It is usually used to store the vertex names (hence the\n"
-   "  name of the keyword argument), but you may also use a numeric attribute.\n"
-   "  If you don't want to store any vertex attributes, supply C{None} here.\n"
-   "@param weights: the name of the edge attribute to be stored along with\n"
-   "  the edges. It is usually used to store the edge weights (hence the\n"
-   "  name of the keyword argument), but you may also use a string attribute.\n"
-   "  If you don't want to store any edge attributes, supply C{None} here.\n"},
-
-  /////////////////
-  // ISOMORPHISM //
-  /////////////////
-  {"isoclass", (PyCFunction) igraphmodule_Graph_isoclass,
-   METH_VARARGS | METH_KEYWORDS,
-   "isoclass(vertices)\n\n"
-   "Returns the isomorphy class of the graph or its subgraph.\n\n"
-   "Isomorphy class calculations are implemented only for graphs with\n"
-   "3 or 4 vertices.\n\n"
-   "@param vertices: a list of vertices if we want to calculate the\n"
-   "  isomorphy class for only a subset of vertices. C{None} means to\n"
-   "  use the full graph.\n"
-   "@return: the isomorphy class of the (sub)graph\n\n"},
-  {"isomorphic", (PyCFunction) igraphmodule_Graph_isomorphic,
-   METH_VARARGS | METH_KEYWORDS,
-   "isomorphic(other)\n\n"
-   "Checks whether the graph is isomorphic to another graph.\n\n"
-   "The algorithm being used is selected using a simple heuristic:\n\n"
-   "  - If one graph is directed and the other undirected, an exception\n"
-   "    is thrown.\n\n"
-   "  - If the two graphs does not have the same number of vertices and\n"
-   "    edges, it returns with C{False}\n\n"
-   "  - If the graphs have three or four vertices, then an O(1) algorithm\n"
-   "    is used with precomputed data.\n\n"
-   "  - Otherwise if the graphs are directed, then the VF2 isomorphism\n"
-   "    algorithm is used (see L{Graph.isomorphic_vf2}).\n\n"
-   "  - Otherwise the BLISS isomorphism algorithm is used, see\n"
-   "    L{Graph.isomorphic_bliss}.\n\n"
-   "@return: C{True} if the graphs are isomorphic, C{False} otherwise.\n"
-  },
-  {"isomorphic_bliss", (PyCFunction) igraphmodule_Graph_isomorphic_bliss,
-   METH_VARARGS | METH_KEYWORDS,
-   "isomorphic_bliss(other, return_mapping_12=False, return_mapping_21=False,\n"
-   "  sh1=\"fm\", sh2=\"fm\")\n\n"
-   "Checks whether the graph is isomorphic to another graph, using the\n"
-   "BLISS isomorphism algorithm.\n\n"
-   "@param other: the other graph with which we want to compare the graph.\n"
-   "@param return_mapping_12: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the first graph to the second.\n"
-   "@param return_mapping_21: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the second graph to the first.\n"
-   "@param sh1: splitting heuristics for the first graph as a\n"
-   "  case-insensitive string, with the following possible values:\n\n"
-   "    - C{\"f\"}: first non-singleton cell\n\n"
-   "    - C{\"fl\"}: first largest non-singleton cell\n\n"
-   "    - C{\"fs\"}: first smallest non-singleton cell\n\n"
-   "    - C{\"fm\"}: first maximally non-trivially connected non-singleton\n"
-   "      cell\n\n"
-   "    - C{\"flm\"}: largest maximally non-trivially connected\n"
-   "      non-singleton cell\n\n"
-   "    - C{\"fsm\"}: smallest maximally non-trivially connected\n"
-   "      non-singleton cell\n\n"
-   "@param sh2: splitting heuristics to be used for the second graph.\n"
-   "  Accepted values are as above.\n"
-   "@return: if no mapping is calculated, the result is C{True} if the graphs\n"
-   "  are isomorphic, C{False} otherwise. If any or both mappings are\n"
-   "  calculated, the result is a 3-tuple, the first element being the\n"
-   "  above mentioned boolean, the second element being the 1 -> 2 mapping\n"
-   "  and the third element being the 2 -> 1 mapping. If the corresponding\n"
-   "  mapping was not calculated, C{None} is returned in the appropriate\n"
-   "  element of the 3-tuple.\n"},
-  {"isomorphic_vf2", (PyCFunction) igraphmodule_Graph_isomorphic_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "isomorphic_vf2(other=None, color1=None, color2=None, edge_color1=None,\n"
-   "  edge_color2=None, return_mapping_12=False, return_mapping_21=False,\n"
-   "  node_compat_fn=None, edge_compat_fn=None, callback=None)\n\n"
-   "Checks whether the graph is isomorphic to another graph, using the\n"
-   "VF2 isomorphism algorithm.\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph with which we want to compare the graph.\n"
-   "  If C{None}, the automorphjisms of the graph will be tested.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param return_mapping_12: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the first graph to the second.\n"
-   "@param return_mapping_21: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the second graph to the first.\n"
-   "@param callback: if not C{None}, the isomorphism search will not stop at\n"
-   "  the first match; it will call this callback function instead for every\n"
-   "  isomorphism found. The callback function must accept four arguments:\n"
-   "  the first graph, the second graph, a mapping from the nodes of the\n"
-   "  first graph to the second, and a mapping from the nodes of the second\n"
-   "  graph to the first. The function must return C{True} if the search\n"
-   "  should continue or C{False} otherwise.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: if no mapping is calculated, the result is C{True} if the graphs\n"
-   "  are isomorphic, C{False} otherwise. If any or both mappings are\n"
-   "  calculated, the result is a 3-tuple, the first element being the\n"
-   "  above mentioned boolean, the second element being the 1 -> 2 mapping\n"
-   "  and the third element being the 2 -> 1 mapping. If the corresponding\n"
-   "  mapping was not calculated, C{None} is returned in the appropriate\n"
-   "  element of the 3-tuple.\n"},
-  {"count_isomorphisms_vf2",
-   (PyCFunction) igraphmodule_Graph_count_isomorphisms_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "count_isomorphisms_vf2(other=None, color1=None, color2=None, edge_color1=None,\n"
-   "  edge_color2=None, node_compat_fn=None, edge_compat_fn=None)\n\n"
-   "Determines the number of isomorphisms between the graph and another one\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph. If C{None}, the number of automorphisms\n"
-   "  will be returned.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: the number of isomorphisms between the two given graphs (or the\n"
-   "  number of automorphisms if C{other} is C{None}.\n"},
-  {"get_isomorphisms_vf2", (PyCFunction) igraphmodule_Graph_get_isomorphisms_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_isomorphisms_vf2(other=None, color1=None, color2=None, edge_color1=None,\n"
-   "  edge_color2=None, node_compat_fn=None, edge_compat_fn=None)\n\n"
-   "Returns all isomorphisms between the graph and another one\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph. If C{None}, the automorphisms\n"
-   "  will be returned.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: a list of lists, each item of the list containing the mapping\n"
-   "  from vertices of the second graph to the vertices of the first one\n"},
-
-  {"subisomorphic_vf2", (PyCFunction) igraphmodule_Graph_subisomorphic_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "subisomorphic_vf2(other, color1=None, color2=None, edge_color1=None,\n"
-   "  edge_color2=None, return_mapping_12=False, return_mapping_21=False,\n"
-   "  callback=None, node_compat_fn=None, edge_compat_fn=None)\n\n"
-   "Checks whether a subgraph of the graph is isomorphic to another graph.\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph with which we want to compare the graph.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param return_mapping_12: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the first graph to the second. The mapping can contain\n"
-   "  -1 if a given node is not mapped.\n"
-   "@param return_mapping_21: if C{True}, calculates the mapping which maps\n"
-   "  the vertices of the second graph to the first. The mapping can contain\n"
-   "  -1 if a given node is not mapped.\n"
-   "@param callback: if not C{None}, the subisomorphism search will not stop at\n"
-   "  the first match; it will call this callback function instead for every\n"
-   "  subisomorphism found. The callback function must accept four arguments:\n"
-   "  the first graph, the second graph, a mapping from the nodes of the\n"
-   "  first graph to the second, and a mapping from the nodes of the second\n"
-   "  graph to the first. The function must return C{True} if the search\n"
-   "  should continue or C{False} otherwise.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: if no mapping is calculated, the result is C{True} if the graph\n"
-   "  contains a subgraph that's isomorphic to the given one, C{False}\n"
-   "  otherwise. If any or both mappings are calculated, the result is a\n"
-   "  3-tuple, the first element being the above mentioned boolean, the\n"
-   "  second element being the 1 -> 2 mapping and the third element being\n"
-   "  the 2 -> 1 mapping. If the corresponding mapping was not calculated,\n"
-   "  C{None} is returned in the appropriate element of the 3-tuple.\n"},
-  {"count_subisomorphisms_vf2",
-   (PyCFunction) igraphmodule_Graph_count_subisomorphisms_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "count_subisomorphisms_vf2(other, color1=None, color2=None,\n"
-   "  edge_color1=None, edge_color2=None, node_compat_fn=None,\n"
-   "  edge_compat_fn=None)\n\n"
-   "Determines the number of subisomorphisms between the graph and another one\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: the number of subisomorphisms between the two given graphs\n"},
-  {"get_subisomorphisms_vf2",
-   (PyCFunction) igraphmodule_Graph_get_subisomorphisms_vf2,
-   METH_VARARGS | METH_KEYWORDS,
-   "get_subisomorphisms_vf2(other, color1=None, color2=None,\n"
-   "  edge_color1=None, edge_color2=None, node_compat_fn=None,\n"
-   "  edge_compat_fn=None)\n\n"
-   "Returns all subisomorphisms between the graph and another one\n\n"
-   "Vertex and edge colors may be used to restrict the isomorphisms, as only\n"
-   "vertices and edges with the same color will be allowed to match each other.\n\n"
-   "@param other: the other graph.\n"
-   "@param color1: optional vector storing the coloring of the vertices of\n"
-   "  the first graph. If C{None}, all vertices have the same color.\n"
-   "@param color2: optional vector storing the coloring of the vertices of\n"
-   "  the second graph. If C{None}, all vertices have the same color.\n"
-   "@param edge_color1: optional vector storing the coloring of the edges of\n"
-   "  the first graph. If C{None}, all edges have the same color.\n"
-   "@param edge_color2: optional vector storing the coloring of the edges of\n"
-   "  the second graph. If C{None}, all edges have the same color.\n"
-   "@param node_compat_fn: a function that receives the two graphs and two\n"
-   "  node indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the nodes given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on node-specific\n"
-   "  criteria that are too complicated to be represented by node color\n"
-   "  vectors (i.e. the C{color1} and C{color2} parameters). C{None} means\n"
-   "  that every node is compatible with every other node.\n"
-   "@param edge_compat_fn: a function that receives the two graphs and two\n"
-   "  edge indices (one from the first graph, one from the second graph) and\n"
-   "  returns C{True} if the edges given by the two indices are compatible\n"
-   "  (i.e. they could be matched to each other) or C{False} otherwise. This\n"
-   "  can be used to restrict the set of isomorphisms based on edge-specific\n"
-   "  criteria that are too complicated to be represented by edge color\n"
-   "  vectors (i.e. the C{edge_color1} and C{edge_color2} parameters). C{None}\n"
-   "  means that every edge is compatible with every other node.\n"
-   "@return: a list of lists, each item of the list containing the mapping\n"
-   "  from vertices of the second graph to the vertices of the first one\n"},
-
-  ////////////////////////
-  // ATTRIBUTE HANDLING //
-  ////////////////////////
-  {"attributes", (PyCFunction) igraphmodule_Graph_attributes,
-   METH_NOARGS,
-   "attributes()\n\n" "@return: the attribute name list of the graph\n"},
-  {"vertex_attributes", (PyCFunction) igraphmodule_Graph_vertex_attributes,
-   METH_NOARGS,
-   "vertex_attributes()\n\n"
-   "@return: the attribute name list of the graph's vertices\n"},
-  {"edge_attributes", (PyCFunction) igraphmodule_Graph_edge_attributes,
-   METH_NOARGS,
-   "edge_attributes()\n\n"
-   "@return: the attribute name list of the graph's edges\n"},
-
-  ///////////////
-  // OPERATORS //
-  ///////////////
-  {"complementer", (PyCFunction) igraphmodule_Graph_complementer,
-   METH_VARARGS,
-   "complementer(loops=False)\n\n"
-   "Returns the complementer of the graph\n\n"
-   "@param loops: whether to include loop edges in the complementer.\n"
-   "@return: the complementer of the graph\n"},
-  {"compose", (PyCFunction) igraphmodule_Graph_compose,
-   METH_O, "compose(other)\n\nReturns the composition of two graphs."},
-  {"difference", (PyCFunction) igraphmodule_Graph_difference,
-   METH_O,
-   "difference(other)\n\nSubtracts the given graph from the original"},
-  {"disjoint_union", (PyCFunction) igraphmodule_Graph_disjoint_union,
-   METH_O,
-   "disjoint_union(graphs)\n\n"
-   "Creates the disjoint union of two (or more) graphs.\n\n"
-   "@param graphs: the list of graphs to be united with the current one.\n"},
-  {"intersection", (PyCFunction) igraphmodule_Graph_intersection,
-   METH_O,
-   "intersection(graphs)\n\n"
-   "Creates the intersection of two (or more) graphs.\n\n"
-   "@param graphs: the list of graphs to be intersected with\n"
-   "  the current one.\n"},
-  {"union", (PyCFunction) igraphmodule_Graph_union,
-   METH_O,
-   "union(graphs)\n\n"
-   "Creates the union of two (or more) graphs.\n\n"
-   "@param graphs: the list of graphs to be united with\n"
-   "  the current one.\n"},
-
-  /*****************/
-  /* MAXIMUM FLOWS */
-  /*****************/
-  {"maxflow_value", (PyCFunction) igraphmodule_Graph_maxflow_value,
-   METH_VARARGS | METH_KEYWORDS,
-   "maxflow_value(source, target, capacity=None)\n\n"
-   "Returns the value of the maximum flow between the source and target vertices.\n\n"
-   "@param source: the source vertex ID\n"
-   "@param target: the target vertex ID\n"
-   "@param capacity: the capacity of the edges. It must be a list or a valid\n"
-   "  attribute name or C{None}. In the latter case, every edge will have the\n"
-   "  same capacity.\n"
-   "@return: the value of the maximum flow between the given vertices\n"},
-
-  {"maxflow", (PyCFunction) igraphmodule_Graph_maxflow,
-   METH_VARARGS | METH_KEYWORDS,
-   "maxflow(source, target, capacity=None)\n\n"
-   "Returns the maximum flow between the source and target vertices.\n\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{Flow} object. It is advised\n"
-   "  to use that.\n"
-   "@param source: the source vertex ID\n"
-   "@param target: the target vertex ID\n"
-   "@param capacity: the capacity of the edges. It must be a list or a valid\n"
-   "  attribute name or C{None}. In the latter case, every edge will have the\n"
-   "  same capacity.\n"
-   "@return: a tuple containing the following: the value of the maximum flow\n"
-   "  between the given vertices, the flow value on all the edges, the edge\n"
-   "  IDs that are part of the corresponding minimum cut, and the vertex IDs\n"
-   "  on one side of the cut. For directed graphs, the flow value vector gives\n"
-   "  the flow value on each edge. For undirected graphs, the flow value is\n"
-   "  positive if the flow goes from the smaller vertex ID to the bigger one\n"
-   "  and negative if the flow goes from the bigger vertex ID to the smaller."
-  },
-
-  /**********************/
-  /* CUTS, MINIMUM CUTS */
-  /**********************/
-  {"all_st_cuts", (PyCFunction) igraphmodule_Graph_all_st_cuts,
-   METH_VARARGS | METH_KEYWORDS,
-   "all_st_cuts(source, target)\n\n"
-   "Returns all the cuts between the source and target vertices in a\n"
-   "directed graph.\n\n"
-   "This function lists all edge-cuts between a source and a target vertex.\n"
-   "Every cut is listed exactly once.\n\n"
-   "@param source: the source vertex ID\n"
-   "@param target: the target vertex ID\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a list of L{Cut} objects. It is\n"
-   "  advised to use that.\n"
-   "@return: a tuple where the first element is a list of lists of edge IDs\n"
-   "  representing a cut and the second element is a list of lists of vertex\n"
-   "  IDs representing the sets of vertices that were separated by the cuts.\n"
-  },
-  {"all_st_mincuts", (PyCFunction) igraphmodule_Graph_all_st_mincuts,
-   METH_VARARGS | METH_KEYWORDS,
-   "all_st_mincuts(source, target)\n\n"
-   "Returns all minimum cuts between the source and target vertices in a\n"
-   "directed graph.\n\n"
-   "@param source: the source vertex ID\n"
-   "@param target: the target vertex ID\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a list of L{Cut} objects. It is\n"
-   "  advised to use that.\n"
-  },
-  {"mincut_value", (PyCFunction) igraphmodule_Graph_mincut_value,
-   METH_VARARGS | METH_KEYWORDS,
-   "mincut_value(source=-1, target=-1, capacity=None)\n\n"
-   "Returns the minimum cut between the source and target vertices.\n\n"
-   "@param source: the source vertex ID. If negative, the calculation is\n"
-   "  done for every vertex except the target and the minimum is returned.\n"
-   "@param target: the target vertex ID. If negative, the calculation is\n"
-   "  done for every vertex except the source and the minimum is returned.\n"
-   "@param capacity: the capacity of the edges. It must be a list or a valid\n"
-   "  attribute name or C{None}. In the latter case, every edge will have the\n"
-   "  same capacity.\n"
-   "@return: the value of the minimum cut between the given vertices\n"},
-
-  {"mincut", (PyCFunction) igraphmodule_Graph_mincut,
-   METH_VARARGS | METH_KEYWORDS,
-   "mincut(capacity=None)\n\n"
-   "Calculates the minimum cut in a graph.\n\n"
-   "The minimum cut is the minimum set of edges which needs to be removed\n"
-   "to disconnect the graph. The minimum is calculated using the weights\n"
-   "(capacities) of the edges, so the cut with the minimum total capacity\n"
-   "is calculated.\n"
-   "For undirected graphs, it uses the Stoer-Wagner algorithm as described\n"
-   "in the reference given below.\n\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{Cut} object. It is advised\n"
-   "  to use that.\n"
-   "@return: the value of the minimum cut, the IDs of vertices in the\n"
-   "  first and second partition, and the IDs of edges in the cut,\n"
-   "  packed in a 4-tuple\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: M. Stoer, F. Wagner: A simple min-cut algorithm. Journal of\n"
-   "  the ACM 44(4):585-591, 1997.\n"
-   },
-
-  /*********************/
-  /* VERTEX SEPARATORS */
-  /*********************/
-  {"all_minimal_st_separators",
-   (PyCFunction) igraphmodule_Graph_all_minimal_st_separators, METH_NOARGS,
-   "all_minimal_st_separators()\n\n"
-   "Returns a list containing all the minimal s-t separators of a graph.\n\n"
-   "A minimal separator is a set of vertices whose removal disconnects the graph,\n"
-   "while the removal of any subset of the set keeps the graph connected.\n\n"
-   "@return: a list where each item lists the vertex indices of a given\n"
-   "  minimal s-t separator.\n"
-   "@newfield ref: Reference\n"
-   "@ref: Anne Berry, Jean-Paul Bordat and Olivier Cogis: Generating all the\n"
-   "  minimal separators of a graph. In: Peter Widmayer, Gabriele Neyer and\n"
-   "  Stephan Eidenbenz (eds.): Graph-theoretic concepts in computer science,\n"
-   "  1665, 167--172, 1999. Springer.\n"},
-
-  {"is_minimal_separator", (PyCFunction) igraphmodule_Graph_is_minimal_separator,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_minimal_separator(vertices)\n\n"
-   "Decides whether the given vertex set is a minimal separator.\n\n"
-   "A minimal separator is a set of vertices whose removal disconnects the graph,\n"
-   "while the removal of any subset of the set keeps the graph connected.\n\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs\n"
-   "@return: C{True} is the given vertex set is a minimal separator, C{False}\n"
-   "  otherwise.\n"},
-
-  {"is_separator", (PyCFunction) igraphmodule_Graph_is_separator,
-   METH_VARARGS | METH_KEYWORDS,
-   "is_separator(vertices)\n\n"
-   "Decides whether the removal of the given vertices disconnects the graph.\n\n"
-   "@param vertices: a single vertex ID or a list of vertex IDs\n"
-   "@return: C{True} is the given vertex set is a separator, C{False} if not.\n"},
-
-  {"minimum_size_separators",
-   (PyCFunction) igraphmodule_Graph_minimum_size_separators, METH_NOARGS,
-   "minimum_size_separators()\n\n"
-   "Returns a list containing all separator vertex sets of minimum size.\n\n"
-   "A vertex set is a separator if its removal disconnects the graph. This method\n"
-   "lists all the separators for which no smaller separator set exists in the\n"
-   "given graph.\n\n"
-   "@return: a list where each item lists the vertex indices of a given\n"
-   "  separator of minimum size.\n"
-   "@newfield ref: Reference\n"
-   "@ref: Arkady Kanevsky: Finding all minimum-size separating vertex sets\n"
-   "  in a graph. Networks 23:533--541, 1993.\n"},
-
-  /*******************/
-  /* COHESIVE BLOCKS */
-  /*******************/
-  {"cohesive_blocks", (PyCFunction) igraphmodule_Graph_cohesive_blocks,
-   METH_NOARGS,
-   "cohesive_blocks()\n\n"
-   "Calculates the cohesive block structure of the graph.\n\n"
-   "@attention: this function has a more convenient interface in class\n"
-   "  L{Graph} which wraps the result in a L{CohesiveBlocks} object.\n"
-   "  It is advised to use that.\n"
-  },
-
-  /********************************/
-  /* CLIQUES AND INDEPENDENT SETS */
-  /********************************/
-  {"cliques", (PyCFunction) igraphmodule_Graph_cliques,
-   METH_VARARGS | METH_KEYWORDS,
-   "cliques(min=0, max=0)\n\n"
-   "Returns some or all cliques of the graph as a list of tuples.\n\n"
-   "A clique is a complete subgraph -- a set of vertices where an edge\n"
-   "is present between any two of them (excluding loops)\n\n"
-   "@param min: the minimum size of cliques to be returned. If zero or\n"
-   "  negative, no lower bound will be used.\n"
-   "@param max: the maximum size of cliques to be returned. If zero or\n"
-   "  negative, no upper bound will be used."},
-  {"largest_cliques", (PyCFunction) igraphmodule_Graph_largest_cliques,
-   METH_NOARGS,
-   "largest_cliques()\n\n"
-   "Returns the largest cliques of the graph as a list of tuples.\n\n"
-   "Quite intuitively a clique is considered largest if there is no clique\n"
-   "with more vertices in the whole graph. All largest cliques are maximal\n"
-   "(i.e. nonextendable) but not all maximal cliques are largest.\n\n"
-   "@see: L{clique_number()} for the size of the largest cliques or\n"
-   "  L{maximal_cliques()} for the maximal cliques"},
-  {"maximal_cliques", (PyCFunction) igraphmodule_Graph_maximal_cliques,
-   METH_VARARGS | METH_KEYWORDS,
-   "maximal_cliques(min=0, max=0)\n\n"
-   "Returns the maximal cliques of the graph as a list of tuples.\n\n"
-   "A maximal clique is a clique which can't be extended by adding any other\n"
-   "vertex to it. A maximal clique is not necessarily one of the largest\n"
-   "cliques in the graph.\n\n"
-   "@param min: the minimum size of maximal cliques to be returned. If zero\n"
-   "  or negative, no lower bound will be used.\n\n"
-   "@param max: the maximum size of maximal cliques to be returned. If zero\n"
-   "  or negative, no upper bound will be used. If nonzero, the size of every\n"
-   "  maximal clique found will be compared to this value and a clique will\n"
-   "  be returned only if its size is smaller than this limit.\n\n"
-   "@see: L{largest_cliques()} for the largest cliques."},
-  {"clique_number", (PyCFunction) igraphmodule_Graph_clique_number,
-   METH_NOARGS,
-   "clique_number()\n\n"
-   "Returns the clique number of the graph.\n\n"
-   "The clique number of the graph is the size of the largest clique.\n\n"
-   "@see: L{largest_cliques()} for the largest cliques."},
-  {"independent_vertex_sets",
-   (PyCFunction) igraphmodule_Graph_independent_vertex_sets,
-   METH_VARARGS | METH_KEYWORDS,
-   "independent_vertex_sets(min=0, max=0)\n\n"
-   "Returns some or all independent vertex sets of the graph as a list of tuples.\n\n"
-   "Two vertices are independent if there is no edge between them. Members\n"
-   "of an independent vertex set are mutually independent.\n\n"
-   "@param min: the minimum size of sets to be returned. If zero or\n"
-   "  negative, no lower bound will be used.\n"
-   "@param max: the maximum size of sets to be returned. If zero or\n"
-   "  negative, no upper bound will be used."},
-  {"largest_independent_vertex_sets",
-   (PyCFunction) igraphmodule_Graph_largest_independent_vertex_sets,
-   METH_NOARGS,
-   "largest_independent_vertex_sets()\n\n"
-   "Returns the largest independent vertex sets of the graph as a list of tuples.\n\n"
-   "Quite intuitively an independent vertex set is considered largest if\n"
-   "there is no other set with more vertices in the whole graph. All largest\n"
-   "sets are maximal (i.e. nonextendable) but not all maximal sets\n"
-   "are largest.\n\n"
-   "@see: L{independence_number()} for the size of the largest independent\n"
-   "  vertex sets or L{maximal_independent_vertex_sets()} for the maximal\n"
-   "  (nonextendable) independent vertex sets"},
-  {"maximal_independent_vertex_sets",
-   (PyCFunction) igraphmodule_Graph_maximal_independent_vertex_sets,
-   METH_NOARGS,
-   "maximal_independent_vertex_sets()\n\n"
-   "Returns the maximal independent vertex sets of the graph as a list of tuples.\n\n"
-   "A maximal independent vertex set is an independent vertex set\n"
-   "which can't be extended by adding any other vertex to it. A maximal\n"
-   "independent vertex set is not necessarily one of the largest\n"
-   "independent vertex sets in the graph.\n\n"
-   "@see: L{largest_independent_vertex_sets()} for the largest independent\n"
-   "  vertex sets\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirawaka: I{A new\n"
-   "  algorithm for generating all the maximal independent sets}.\n"
-   "  SIAM J Computing, 6:505--517, 1977."},
-  {"independence_number",
-   (PyCFunction) igraphmodule_Graph_independence_number,
-   METH_NOARGS,
-   "independence_number()\n\n"
-   "Returns the independence number of the graph.\n\n"
-   "The independence number of the graph is the size of the largest\n"
-   "independent vertex set.\n\n"
-   "@see: L{largest_independent_vertex_sets()} for the largest independent\n"
-   "  vertex sets"},
-
-  /*********************************/
-  /* COMMUNITIES AND DECOMPOSITION */
-  /*********************************/
-  {"modularity", (PyCFunction) igraphmodule_Graph_modularity,
-   METH_VARARGS | METH_KEYWORDS,
-   "modularity(membership, weights=None)\n\n"
-   "Calculates the modularity of the graph with respect to some vertex types.\n\n"
-   "The modularity of a graph w.r.t. some division measures how good the\n"
-   "division is, or how separated are the different vertex types from each\n"
-   "other. It is defined as M{Q=1/(2m) * sum(Aij-ki*kj/(2m)delta(ci,cj),i,j)}.\n"
-   "M{m} is the number of edges, M{Aij} is the element of the M{A} adjacency\n"
-   "matrix in row M{i} and column M{j}, M{ki} is the degree of node M{i},\n"
-   "M{kj} is the degree of node M{j}, and M{Ci} and C{cj} are the types of\n"
-   "the two vertices (M{i} and M{j}). M{delta(x,y)} is one iff M{x=y}, 0\n"
-   "otherwise.\n\n"
-   "If edge weights are given, the definition of modularity is modified as\n"
-   "follows: M{Aij} becomes the weight of the corresponding edge, M{ki}\n"
-   "is the total weight of edges incident on vertex M{i}, M{kj} is the\n"
-   "total weight of edges incident on vertex M{j} and M{m} is the total\n"
-   "edge weight in the graph.\n\n"
-   "@attention: method overridden in L{Graph} to allow L{VertexClustering}\n"
-   "  objects as a parameter. This method is not strictly necessary, since\n"
-   "  the L{VertexClustering} class provides a variable called C{modularity}.\n"
-   "@param membership: the membership vector, e.g. the vertex type index for\n"
-   "  each vertex.\n"
-   "@param weights: optional edge weights or C{None} if all edges are weighed\n"
-   "  equally.\n"
-   "@return: the modularity score. Score larger than 0.3 usually indicates\n"
-   "  strong community structure.\n"
-   "@newfield ref: Reference\n"
-   "@ref: MEJ Newman and M Girvan: Finding and evaluating community structure\n"
-   "  in networks. Phys Rev E 69 026113, 2004.\n"
-  },
-  {"coreness", (PyCFunction) igraphmodule_Graph_coreness,
-   METH_VARARGS | METH_KEYWORDS,
-   "coreness(mode=ALL)\n\n"
-   "Finds the coreness (shell index) of the vertices of the network.\n\n"
-   "The M{k}-core of a graph is a maximal subgraph in which each vertex\n"
-   "has at least degree k. (Degree here means the degree in the\n"
-   "subgraph of course). The coreness of a vertex is M{k} if it\n"
-   "is a member of the M{k}-core but not a member of the M{k+1}-core.\n\n"
-   "@param mode: whether to compute the in-corenesses (L{IN}), the\n"
-   "  out-corenesses (L{OUT}) or the undirected corenesses (L{ALL}).\n"
-   "  Ignored and assumed to be L{ALL} for undirected graphs.\n"
-   "@return: the corenesses for each vertex.\n\n"
-   "@newfield ref: Reference\n"
-   "@ref: Vladimir Batagelj, Matjaz Zaversnik: I{An M{O(m)} Algorithm\n"
-   "  for Core Decomposition of Networks.}"},
-  {"community_fastgreedy",
-   (PyCFunction) igraphmodule_Graph_community_fastgreedy,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_fastgreedy(weights=None)\n\n"
-   "Finds the community structure of the graph according to the algorithm of\n"
-   "Clauset et al based on the greedy optimization of modularity.\n\n"
-   "This is a bottom-up algorithm: initially every vertex belongs to a separate\n"
-   "community, and communities are merged one by one. In every step, the two\n"
-   "communities being merged are the ones which result in the maximal increase\n"
-   "in modularity.\n\n"
-   "@attention: this function is wrapped in a more convenient syntax in the\n"
-   "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-   "@param weights: name of an edge attribute or a list containing\n"
-   "  edge weights\n"
-   "@return: a tuple with the following elements:\n"
-   "  1. The list of merges\n"
-   "  2. The modularity scores before each merge\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: A. Clauset, M. E. J. Newman and C. Moore: I{Finding community\n"
-   "  structure in very large networks.} Phys Rev E 70, 066111 (2004).\n"
-   "@see: modularity()\n"
-  },
-  {"community_infomap",
-   (PyCFunction) igraphmodule_Graph_community_infomap,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_infomap(edge_weights=None, vertex_weights=None, trials=10)\n\n"
-   "Finds the community structure of the network according to the Infomap\n"
-   "method of Martin Rosvall and Carl T. Bergstrom.\n\n"
-   "See U{http://www.mapequation.org} for a visualization of the algorithm\n"
-   "or one of the references provided below.\n\n"
-   "@param edge_weights: name of an edge attribute or a list containing\n"
-   "  edge weights.\n"
-   "@param vertex_weights: name of an vertex attribute or a list containing\n"
-   "  vertex weights.\n"
-   "@param trials: the number of attempts to partition the network.\n"
-   "@return: the calculated membership vector and the corresponding\n"
-   "  codelength in a tuple.\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: M. Rosvall and C. T. Bergstrom: I{Maps of information flow reveal\n"
-   "  community structure in complex networks}. PNAS 105, 1118 (2008).\n"
-   "  U{http://arxiv.org/abs/0707.0609}\n"
-   "@ref: M. Rosvall, D. Axelsson and C. T. Bergstrom: I{The map equation}.\n"
-   "  Eur Phys J Special Topics 178, 13 (2009). U{http://arxiv.org/abs/0906.1405}\n"
-  },
-  {"community_label_propagation",
-   (PyCFunction) igraphmodule_Graph_community_label_propagation,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_label_propagation(weights=None, initial=None, fixed=None)\n\n"
-   "Finds the community structure of the graph according to the label\n"
-   "propagation method of Raghavan et al.\n\n"
-   "Initially, each vertex is assigned a different label. After that,\n"
-   "each vertex chooses the dominant label in its neighbourhood in each\n"
-   "iteration. Ties are broken randomly and the order in which the\n"
-   "vertices are updated is randomized before every iteration. The algorithm\n"
-   "ends when vertices reach a consensus.\n\n"
-   "Note that since ties are broken randomly, there is no guarantee that\n"
-   "the algorithm returns the same community structure after each run.\n"
-   "In fact, they frequently differ. See the paper of Raghavan et al\n"
-   "on how to come up with an aggregated community structure.\n\n"
-   "@param weights: name of an edge attribute or a list containing\n"
-   "  edge weights\n"
-   "@param initial: name of a vertex attribute or a list containing\n"
-   "  the initial vertex labels. Labels are identified by integers from\n"
-   "  zero to M{n-1} where M{n} is the number of vertices. Negative\n"
-   "  numbers may also be present in this vector, they represent unlabeled\n"
-   "  vertices.\n"
-   "@param fixed: a list of booleans for each vertex. C{True} corresponds\n"
-   "  to vertices whose labeling should not change during the algorithm.\n"
-   "  It only makes sense if initial labels are also given. Unlabeled\n"
-   "  vertices cannot be fixed. Note that vertex attribute names are not\n"
-   "  accepted here.\n"
-   "@return: the resulting membership vector\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: Raghavan, U.N. and Albert, R. and Kumara, S. Near linear\n"
-   "  time algorithm to detect community structures in large-scale\n"
-   "  networks. Phys Rev E 76:036106, 2007. U{http://arxiv.org/abs/0709.2938}.\n"
-  },
-  {"community_leading_eigenvector", (PyCFunction) igraphmodule_Graph_community_leading_eigenvector,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_leading_eigenvector(n=-1)\n\n"
-   "A proper implementation of Newman's eigenvector community structure\n"
-   "detection. Each split is done by maximizing the modularity regarding\n"
-   "the original network. See the reference for details.\n\n"
-   "@attention: this function is wrapped in a more convenient syntax in the\n"
-   "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-   "@param n: the desired number of communities. If negative, the algorithm\n"
-   "  tries to do as many splits as possible. Note that the algorithm\n"
-   "  won't split a community further if the signs of the leading eigenvector\n"
-   "  are all the same.\n"
-   "@return: a tuple where the first element is the membership vector of the\n"
-   "  clustering and the second element is the merge matrix.\n\n"
-   "@newfield ref: Reference\n"
-  "@ref: MEJ Newman: Finding community structure in networks using the\n"
-  "  eigenvectors of matrices, arXiv:physics/0605087\n"
-  },
-  {"community_multilevel",
-   (PyCFunction) igraphmodule_Graph_community_multilevel,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_multilevel(weights=None, return_levels=True)\n\n"
-   "Finds the community structure of the graph according to the multilevel\n"
-   "algorithm of Blondel et al. This is a bottom-up algorithm: initially\n"
-   "every vertex belongs to a separate community, and vertices are moved\n"
-   "between communities iteratively in a way that maximizes the vertices'\n"
-   "local contribution to the overall modularity score. When a consensus is\n"
-   "reached (i.e. no single move would increase the modularity score), every\n"
-   "community in the original graph is shrank to a single vertex (while\n"
-   "keeping the total weight of the incident edges) and the process continues\n"
-   "on the next level. The algorithm stops when it is not possible to increase\n"
-   "the modularity any more after shrinking the communities to vertices.\n\n"
-   "@attention: this function is wrapped in a more convenient syntax in the\n"
-   "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-   "@param weights: name of an edge attribute or a list containing\n"
-   "  edge weights\n"
-   "@param return_levels: if C{True}, returns the multilevel result. If\n"
-   "  C{False}, only the best level (corresponding to the best modularity)\n"
-   "  is returned.\n"
-   "@return: either a single list describing the community membership of each\n"
-   "  vertex (if C{return_levels} is C{False}), or a list of community membership\n"
-   "  vectors, one corresponding to each level and a list of corresponding\n"
-   "  modularities (if C{return_levels} is C{True}).\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: VD Blondel, J-L Guillaume, R Lambiotte and E Lefebvre: Fast\n"
-   "  unfolding of community hierarchies in large networks. J Stat Mech\n"
-   "  P10008 (2008), http://arxiv.org/abs/0803.0476\n"
-   "@see: modularity()\n"
-  },
-  {"community_edge_betweenness",
-  (PyCFunction)igraphmodule_Graph_community_edge_betweenness,
-  METH_VARARGS | METH_KEYWORDS,
-  "community_edge_betweenness(directed=True, weights=None)\n\n"
-  "Community structure detection based on the betweenness of the edges in\n"
-  "the network. This algorithm was invented by M Girvan and MEJ Newman,\n"
-  "see: M Girvan and MEJ Newman: Community structure in social and biological\n"
-  "networks, Proc. Nat. Acad. Sci. USA 99, 7821-7826 (2002).\n\n"
-  "The idea is that the betweenness of the edges connecting two communities\n"
-  "is typically high. So we gradually remove the edge with the highest\n"
-  "betweenness from the network and recalculate edge betweenness after every\n"
-  "removal, as long as all edges are removed.\n\n"
-  "@attention: this function is wrapped in a more convenient syntax in the\n"
-  "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-  "@param directed: whether to take into account the directedness of the edges\n"
-  "  when we calculate the betweenness values.\n"
-  "@param weights: name of an edge attribute or a list containing\n"
-  "  edge weights.\n\n"
-  "@return: a tuple with the merge matrix that describes the dendrogram\n"
-  "  and the modularity scores before each merge. The modularity scores\n"
-  "  use the weights if the original graph was weighted.\n"
-  },
-  {"community_optimal_modularity",
-   (PyCFunction) igraphmodule_Graph_community_optimal_modularity,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_optimal_modularity(verbose=False)\n\n"
-   "Calculates the optimal modularity score of the graph and the\n"
-   "corresponding community structure.\n\n"
-   "This function uses the GNU Linear Programming Kit to solve a large\n"
-   "integer optimization problem in order to find the optimal modularity\n"
-   "score and the corresponding community structure, therefore it is\n"
-   "unlikely to work for graphs larger than a few (less than a hundred)\n"
-   "vertices. Consider using one of the heuristic approaches instead if\n"
-   "you have such a large graph.\n\n"
-   "@return: the calculated membership vector and the corresponding\n"
-   "  modularity in a tuple.\n"
-  },
-  {"community_spinglass",
-   (PyCFunction) igraphmodule_Graph_community_spinglass,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_spinglass(weights=None, spins=25, parupdate=False, "
-   "start_temp=1, stop_temp=0.01, cool_fact=0.99, update_rule=\"config\", "
-   "gamma=1, implementation=\"orig\", lambda=1)\n\n"
-   "Finds the community structure of the graph according to the spinglass\n"
-   "community detection method of Reichardt & Bornholdt.\n\n"
-   "@param weights: edge weights to be used. Can be a sequence or iterable or\n"
-   "  even an edge attribute name.\n"
-   "@param spins: integer, the number of spins to use. This is the upper limit\n"
-   "  for the number of communities. It is not a problem to supply a\n"
-   "  (reasonably) big number here, in which case some spin states will be\n"
-   "  unpopulated.\n"
-   "@param parupdate: whether to update the spins of the vertices in parallel\n"
-   "  (synchronously) or not\n"
-   "@param start_temp: the starting temperature\n"
-   "@param stop_temp: the stop temperature\n"
-   "@param cool_fact: cooling factor for the simulated annealing\n"
-   "@param update_rule: specifies the null model of the simulation. Possible\n"
-   "  values are C{\"config\"} (a random graph with the same vertex degrees\n"
-   "  as the input graph) or C{\"simple\"} (a random graph with the same number\n"
-   "  of edges)\n"
-   "@param gamma: the gamma argument of the algorithm, specifying the balance\n"
-   "  between the importance of present and missing edges within a community.\n"
-   "  The default value of 1.0 assigns equal importance to both of them.\n"
-   "@param implementation: currently igraph contains two implementations for\n"
-   "  the spinglass community detection algorithm. The faster original\n"
-   "  implementation is the default. The other implementation is able to take\n"
-   "  into account negative weights, this can be chosen by setting\n"
-   "  C{implementation} to C{\"neg\"}.\n"
-   "@param lambda: the lambda argument of the algorithm, which specifies the\n"
-   "  balance between the importance of present and missing negatively\n"
-   "  weighted edges within a community. Smaller values of lambda lead\n"
-   "  to communities with less negative intra-connectivity. If the argument\n"
-   "  is zero, the algorithm reduces to a graph coloring algorithm, using\n"
-   "  the number of spins as colors. This argument is ignored if the\n"
-   "  original implementation is used.\n"
-   "@return: the community membership vector.\n"
-  },
-  {"community_walktrap",
-   (PyCFunction) igraphmodule_Graph_community_walktrap,
-   METH_VARARGS | METH_KEYWORDS,
-   "community_walktrap(weights=None, steps=None)\n\n"
-   "Finds the community structure of the graph according to the random walk\n"
-   "method of Latapy & Pons.\n\n"
-   "The basic idea of the algorithm is that short random walks tend to stay\n"
-   "in the same community. The method provides a dendrogram.\n\n"
-   "@attention: this function is wrapped in a more convenient syntax in the\n"
-   "  derived class L{Graph}. It is advised to use that instead of this version.\n\n"
-   "@param weights: name of an edge attribute or a list containing\n"
-   "  edge weights\n"
-   "@return: a tuple with the list of merges and the modularity scores corresponding\n"
-   "  to each merge\n"
-   "\n"
-   "@newfield ref: Reference\n"
-   "@ref: Pascal Pons, Matthieu Latapy: Computing communities in large networks\n"
-   "  using random walks, U{http://arxiv.org/abs/physics/0512106}.\n"
-   "@see: modularity()\n"
-  },
-
-  /*************/
-  /* MATCHINGS */
-  /*************/
-  {"_is_matching", (PyCFunction)igraphmodule_Graph_is_matching,
-   METH_VARARGS | METH_KEYWORDS,
-   "_is_matching(matching, types=None)\n\n"
-   "Internal function, undocumented.\n\n"
-  },
-  {"_is_maximal_matching", (PyCFunction)igraphmodule_Graph_is_maximal_matching,
-   METH_VARARGS | METH_KEYWORDS,
-   "_is_maximal_matching(matching, types=None)\n\n"
-   "Internal function, undocumented.\n\n"
-   "Use L{Matching.is_maximal} instead.\n"
-  },
-  {"_maximum_bipartite_matching", (PyCFunction)igraphmodule_Graph_maximum_bipartite_matching,
-   METH_VARARGS | METH_KEYWORDS,
-   "_maximum_bipartite_matching(types, weights=None)\n\n"
-   "Internal function, undocumented.\n\n"
-   "@see: L{Graph.maximum_bipartite_matching}\n"
-  },
-
-  /**********************/
-  /* INTERNAL FUNCTIONS */
-  /**********************/
-#ifdef IGRAPH_PYTHON3
-  {"__graph_as_capsule",
-   (PyCFunction) igraphmodule_Graph___graph_as_capsule__,
-   METH_VARARGS | METH_KEYWORDS,
-   "__graph_as_capsule()\n\n"
-   "Returns the igraph graph encapsulated by the Python object as\n"
-   "a PyCapsule\n\n."
-   "A PyCapsule is practically a regular C pointer, wrapped in a\n"
-   "Python object. This function should not be used directly by igraph\n"
-   "users, it is useful only in the case when the underlying igraph object\n"
-   "must be passed to other C code through Python.\n\n"},
-#else
-  {"__graph_as_cobject",
-   (PyCFunction) igraphmodule_Graph___graph_as_cobject__,
-   METH_VARARGS | METH_KEYWORDS,
-   "__graph_as_cobject()\n\n"
-   "Returns the igraph graph encapsulated by the Python object as\n"
-   "a PyCObject\n\n."
-   "A PyCObject is practically a regular C pointer, wrapped in a\n"
-   "Python object. This function should not be used directly by igraph\n"
-   "users, it is useful only in the case when the underlying igraph object\n"
-   "must be passed to other C code through Python.\n\n"},
-#endif
-
-  {"__register_destructor",
-   (PyCFunction) igraphmodule_Graph___register_destructor__,
-   METH_VARARGS | METH_KEYWORDS,
-   "__register_destructor(destructor)\n\n"
-   "Registers a destructor to be called when the object is freed by\n"
-   "Python. This function should not be used directly by igraph users."},
-  {NULL}
-};
-
-/** \ingroup python_interface_graph
- * This structure is the collection of functions necessary to implement
- * the graph as a mapping (i.e. to allow the retrieval and setting of
- * igraph attributes in Python as if it were of a Python mapping type)
- */
-PyMappingMethods igraphmodule_Graph_as_mapping = {
-  /* __len__ function intentionally left unimplemented */
-  0,
-  /* returns an attribute by name or returns part of the adjacency matrix */
-  (binaryfunc) igraphmodule_Graph_mp_subscript,
-  /* sets an attribute by name or sets part of the adjacency matrix */
-  (objobjargproc) igraphmodule_Graph_mp_assign_subscript
-};
-
-/** \ingroup python_interface
- * \brief Collection of methods to allow numeric operators to be used on the graph
- */
-PyNumberMethods igraphmodule_Graph_as_number = {
-  0,                            /* nb_add */
-  0,                            /*nb_subtract */
-  0,                            /*nb_multiply */
-#ifndef IGRAPH_PYTHON3
-  0,                            /*nb_divide */
-#endif
-  0,                            /*nb_remainder */
-  0,                            /*nb_divmod */
-  0,                            /*nb_power */
-  0,                            /*nb_negative */
-  0,                            /*nb_positive */
-  0,                            /*nb_absolute */
-  0,                            /*nb_nonzero (2.x) / nb_bool (3.x) */
-  (unaryfunc) igraphmodule_Graph_complementer_op, /*nb_invert */
-  0,                            /*nb_lshift */
-  0,                            /*nb_rshift */
-  (binaryfunc) igraphmodule_Graph_intersection, /*nb_and */
-  0,                            /*nb_xor */
-  (binaryfunc) igraphmodule_Graph_union,  /*nb_or */
-#ifndef IGRAPH_PYTHON3
-  0,                            /*nb_coerce */
-#endif
-  0,                            /*nb_int */
-  0,                            /*nb_long (2.x) / nb_reserved (3.x)*/
-  0,                            /*nb_float */
-#ifndef IGRAPH_PYTHON3
-  0,                            /*nb_oct */
-  0,                            /*nb_hex */
-#endif
-  0,                            /*nb_inplace_add */
-  0,                            /*nb_inplace_subtract */
-  0,                            /*nb_inplace_multiply */
-#ifndef IGRAPH_PYTHON3
-  0,                            /*nb_inplace_divide */
-#endif
-  0,                            /*nb_inplace_remainder */
-  0,                            /*nb_inplace_power */
-  0,                            /*nb_inplace_lshift */
-  0,                            /*nb_inplace_rshift */
-  0,                            /*nb_inplace_and */
-  0,                            /*nb_inplace_xor */
-  0,                            /*nb_inplace_or */
-
-#ifdef IGRAPH_PYTHON3
-  0,                            /*nb_floor_divide */
-  0,                            /*nb_true_divide */
-  0,                            /*nb_inplace_floor_divide */
-  0,                            /*nb_inplace_true_divide */
-  0,                            /*nb_index */
-#endif
-};
-
-/** \ingroup python_interface_graph
- * Python type object referencing the methods Python calls when it performs various operations on an igraph (creating, printing and so on)
- */
-PyTypeObject igraphmodule_GraphType = {
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.Graph",               /* tp_name */
-  sizeof(igraphmodule_GraphObject), /* tp_basicsize */
-  0,                            /* tp_itemsize */
-  (destructor) igraphmodule_Graph_dealloc,  /* tp_dealloc */
-  0,                            /* tp_print */
-  0,                            /* tp_getattr */
-  0,                            /* tp_setattr */
-  0,                            /* tp_compare (2.x) / tp_reserved (3.x) */
-  0,                            /* tp_repr */
-  &igraphmodule_Graph_as_number,  /* tp_as_number */
-  0,                            /* tp_as_sequence */
-  &igraphmodule_Graph_as_mapping, /* tp_as_mapping */
-  0,                            /* tp_hash */
-  0,                            /* tp_call */
-  (reprfunc) igraphmodule_Graph_str,  /* tp_str */
-  0,                            /* tp_getattro */
-  0,                            /* tp_setattro */
-  0,                            /* tp_as_buffer */
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE | Py_TPFLAGS_HAVE_GC,  /* tp_flags */
-  "Low-level representation of a graph.\n\n"
-  "Don't use it directly, use L{igraph.Graph} instead.\n\n"
-  "@undocumented: _Bipartite, _Full_Bipartite, _GRG, _Incidence, _is_matching,\n"
-  "  _is_maximal_matching, _layout_sugiyama, _maximum_bipartite_matching,\n"
-  "  _spanning_tree\n"
-  "@deffield ref: Reference",  /* tp_doc */
-  (traverseproc) igraphmodule_Graph_traverse, /* tp_traverse */
-  (inquiry) igraphmodule_Graph_clear, /* tp_clear */
-  0,                            /* tp_richcompare */
-  offsetof(igraphmodule_GraphObject, weakreflist),  /* tp_weaklistoffset */
-  0,                            /* tp_iter */
-  0,                            /* tp_iternext */
-  igraphmodule_Graph_methods,   /* tp_methods */
-  0,                            /* tp_members */
-  0,                            /* tp_getset */
-  0,                            /* tp_base */
-  0,                            /* tp_dict */
-  0,                            /* tp_descr_get */
-  0,                            /* tp_descr_set */
-  0,                            /* tp_dictoffset */
-  (initproc) igraphmodule_Graph_init, /* tp_init */
-  0,                            /* tp_alloc */
-  igraphmodule_Graph_new,       /* tp_new */
-  0,                            /* tp_free */
-};
-
-#undef CREATE_GRAPH
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/graphobject.h igraph-0.6.5/interfaces/python/src/graphobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/graphobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/graphobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,226 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_GRAPHOBJECT_H
-#define PYTHON_GRAPHOBJECT_H
-
-#include <Python.h>
-#include <igraph.h>
-#include "structmember.h"
-#include "common.h"
-
-extern PyTypeObject igraphmodule_GraphType;
-
-/**
- * \ingroup python_interface
- * \brief A structure containing all the fields required to access an igraph from Python
- */
-typedef struct 
-{
-  PyObject_HEAD
-  // The graph object
-  igraph_t g;
-  // Python object to be called upon destruction
-  PyObject* destructor;
-  // Python object representing the sequence of vertices
-  PyObject* vseq;
-  // Python object representing the sequence of edges
-  PyObject* eseq;
-  // Python object of the weak reference list
-  PyObject* weakreflist;
-} igraphmodule_GraphObject;
-
-void igraphmodule_Graph_init_internal(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_new(PyTypeObject *type, PyObject *args, PyObject *kwds);
-int igraphmodule_Graph_clear(igraphmodule_GraphObject *self);
-int igraphmodule_Graph_traverse(igraphmodule_GraphObject *self, visitproc visit, void *arg);
-void igraphmodule_Graph_dealloc(igraphmodule_GraphObject* self);
-int igraphmodule_Graph_init(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_from_igraph_t(igraph_t *graph);
-PyObject* igraphmodule_Graph_str(igraphmodule_GraphObject *self);
-
-PyObject* igraphmodule_Graph_vcount(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_ecount(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_is_dag(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_is_directed(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_is_simple(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_add_vertices(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_delete_vertices(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_add_edges(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_delete_edges(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_degree(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_is_loop(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_count_multiple(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_neighbors(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_successors(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_predecessors(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_get_eid(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_Adjacency(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Asymmetric_Preference(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Atlas(PyTypeObject *type, PyObject *args);
-PyObject* igraphmodule_Graph_Barabasi(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Degree_Sequence(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Establishment(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Erdos_Renyi(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Famous(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Forest_Fire(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Full_Citation(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Full(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_GRG(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Growing_Random(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Isoclass(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Lattice(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_LCF(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Preference(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Recent_Degree(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Ring(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Star(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Tree(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Watts_Strogatz(PyTypeObject *type, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_is_connected(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_are_connected(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_articulation_points(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_average_path_length(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_betweenness(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_bibcoupling(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_closeness(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_clusters(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_cocitation(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_constraint(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_copy(igraphmodule_GraphObject *self);
-PyObject* igraphmodule_Graph_decompose(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_density(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_diameter(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_edge_betweenness(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_get_shortest_paths(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_get_all_shortest_paths(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_maxdegree(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_pagerank(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_path_length_hist(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_reciprocity(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_rewire(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_shortest_paths(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_spanning_tree(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_simplify(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_subcomponent(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_subgraph(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_transitivity_undirected(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_transitivity_local_undirected(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_layout_circle(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_sphere(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_random(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_random_3d(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_kamada_kawai(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_kamada_kawai_3d(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_drl(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_fruchterman_reingold(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_fruchterman_reingold_3d(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_grid_fruchterman_reingold(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_lgl(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_layout_reingold_tilford(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_get_adjacency(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_get_edgelist(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_to_undirected(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_to_directed(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_laplacian(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_Read_DIMACS(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_Edgelist(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_GML(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_Ncol(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_Lgl(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_Pajek(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_Read_GraphML(PyTypeObject *type, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_dimacs(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_dot(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_edgelist(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_ncol(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_lgl(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_gml(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_write_graphml(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph_isoclass(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_isomorphic(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_count_isomorphisms(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_get_isomorphisms(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_subisomorphic(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_count_subisomorphisms(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_get_subisomorphisms(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-
-Py_ssize_t igraphmodule_Graph_attribute_count(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_get_attribute(igraphmodule_GraphObject* self, PyObject* s);
-int igraphmodule_Graph_set_attribute(igraphmodule_GraphObject* self, PyObject* k, PyObject* v);
-PyObject* igraphmodule_Graph_attributes(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_vertex_attributes(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_edge_attributes(igraphmodule_GraphObject* self);
-
-PyObject* igraphmodule_Graph_get_vertices(igraphmodule_GraphObject* self, void* closure);
-PyObject* igraphmodule_Graph_get_edges(igraphmodule_GraphObject* self, void* closure);
-
-PyObject* igraphmodule_Graph_complementer(igraphmodule_GraphObject* self, PyObject* args);
-PyObject* igraphmodule_Graph_complementer_op(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_compose(igraphmodule_GraphObject* self, PyObject* other);
-PyObject* igraphmodule_Graph_difference(igraphmodule_GraphObject* self, PyObject* other);
-PyObject* igraphmodule_Graph_disjoint_union(igraphmodule_GraphObject* self, PyObject* other);
-PyObject* igraphmodule_Graph_intersection(igraphmodule_GraphObject* self, PyObject* other);
-PyObject* igraphmodule_Graph_union(igraphmodule_GraphObject* self, PyObject* other);
-
-PyObject* igraphmodule_Graph_bfs(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_bfsiter(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-
-PyObject* igraphmodule_Graph_maxflow(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_maxflow_value(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_mincut(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_mincut_value(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-
-PyObject* igraphmodule_Graph_cliques(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_maximal_cliques(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_largest_cliques(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_clique_number(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_independent_sets(igraphmodule_GraphObject* self, PyObject* args, PyObject* kwds);
-PyObject* igraphmodule_Graph_maximal_independent_sets(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_largest_independent_sets(igraphmodule_GraphObject* self);
-PyObject* igraphmodule_Graph_independence_number(igraphmodule_GraphObject* self);
-
-PyObject* igraphmodule_Graph_community_edge_betweenness(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_fastgreedy(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject *igraphmodule_Graph_community_infomap(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_label_propagation(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_leading_eigenvector(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_leading_eigenvector_naive(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject *igraphmodule_Graph_community_multilevel(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject *igraphmodule_Graph_community_optimal_modularity(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_spinglass(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_community_walktrap(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph_modularity(igraphmodule_GraphObject* self, PyObject *args, PyObject *kwds);
-
-PyObject *igraphmodule_Graph_is_bipartite(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-PyObject* igraphmodule_Graph___graph_as_cobject__(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-PyObject* igraphmodule_Graph___register_destructor__(igraphmodule_GraphObject *self, PyObject *args, PyObject *kwds);
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/igraphmodule.c igraph-0.6.5/interfaces/python/src/igraphmodule.c
--- igraph-0.6.5~quantal1/interfaces/python/src/igraphmodule.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/igraphmodule.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,880 +0,0 @@
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include <Python.h>
-#include <pythonrun.h>
-#include <igraph.h>
-#include "arpackobject.h"
-#include "attributes.h"
-#include "bfsiter.h"
-#include "common.h"
-#include "convert.h"
-#include "edgeobject.h"
-#include "edgeseqobject.h"
-#include "error.h"
-#include "graphobject.h"
-#include "py2compat.h"
-#include "random.h"
-#include "vertexobject.h"
-#include "vertexseqobject.h"
-
-#define IGRAPH_MODULE
-#include "igraphmodule_api.h"
-
-extern double igraph_i_fdiv(double, double);
-
-/**
- * \defgroup python_interface Python module implementation
- * \brief Functions implementing a Python interface to \a igraph
- * 
- * These functions provide a way to access \a igraph functions from Python.
- * It should be of interest of \a igraph developers only. Classes, functions
- * and methods exposed to Python are still to be documented. Until it is done,
- * just type the following to get help about \a igraph functions in Python
- * (assuming you have \c igraph.so somewhere in your Python library path):
- * 
- * \verbatim
-import igraph
-help(igraph)
-help(igraph.Graph)
-\endverbatim
- * 
- * Most of the functions provided here share the same calling conventions
- * (which are determined by the Python/C API). Since the role of the
- * arguments are the same across many functions, I won't explain them
- * everywhere, just give a quick overview of the common argument names here.
- * 
- * \param self the Python igraph.Graph object the method is working on
- * \param args pointer to the Python tuple containing the arguments
- * \param kwds pointer to the Python hash containing the keyword parameters
- * \param type the type object of a Python igraph.Graph object. Used usually
- * in constructors and class methods.
- * 
- * Any arguments not documented here should be mentioned at the documentation
- * of the appropriate method.
- * 
- * The functions which implement a Python method always return a pointer to
- * a \c PyObject. According to Python conventions, this is \c NULL if and
- * only if an exception was thrown by the method (or any of the functions
- * it has called). When I explain the return value of a function which
- * provides interface to an \a igraph function, I won't cover the case of
- * returning a \c NULL value, because this is the same for every such method.
- * The conclusion is that a method can return \c NULL even if I don't state
- * it explicitly.
- * 
- * Also please take into consideration that I'm documenting the C calls
- * with the abovementioned parameters here, and \em not the Python methods
- * which are presented to the user using the Python interface of \a igraph.
- * If you are looking for the documentation of the classes, methods and
- * functions exposed to Python, please use the \c help calls from Python
- * or use \c pydoc to generate a formatted version.
- *
- * \section weakrefs The usage of weak references in the Python interface
- * 
- * Many classes implemented in the Python interface (e.g. VertexSeq, Vertex...)
- * use weak references to keep track of the graph they are referencing to.
- * The use of weak references is twofold:
- * 
- * -# If we assign a VertexSeq or a Vertex of a given graph to a local
- *    variable and then destroy the graph, real references keep the graph
- *    alive and do not return the memory back to Python.
- * -# If we use real references, a Graph object will hold a reference
- *    to its VertexSeq (because we don't want to allocate a new VertexSeq
- *    object for the same graph every time it is requested), and the
- *    VertexSeq will also hold a reference to the Graph. This is a circular
- *    reference. Python does not reclaim the memory occupied by the Graph
- *    back when the Graph is destroyed, because the VertexSeq is holding a
- *    reference to it. Similarly, VertexSeq doesn't get freed because the
- *    Graph is holding a reference to it. These situations can only be
- *    resolved by the Python garbage collector which is invoked at regular
- *    intervals. Unfortunately, the garbage collector refuses to break
- *    circular references and free the objects participating in the circle
- *    when any of the objects has a \c __del__ method. In this case,
- *    \c igraph.Graph has one (which frees the underlying \c igraph_t
- *    graph), therefore our graphs never get freed when we use real
- *    references.
- */
-
-/**
- * Whether the module was initialized already
- */
-static igraph_bool_t igraphmodule_initialized = 0;
-
-/**
- * Module-specific global variables
- */
-struct module_state {
-  PyObject* progress_handler;
-  PyObject* status_handler;
-};
-static struct module_state _state = { 0, 0 };
-
-#define GETSTATE(m) (&_state)
-
-#ifdef IGRAPH_PYTHON3
-static int igraphmodule_traverse(PyObject *m, visitproc visit, void* arg) {
-  Py_VISIT(GETSTATE(m)->progress_handler);
-  Py_VISIT(GETSTATE(m)->status_handler);
-  return 0;
-}
-
-static int igraphmodule_clear(PyObject *m) {
-  Py_CLEAR(GETSTATE(m)->progress_handler);
-  Py_CLEAR(GETSTATE(m)->status_handler);
-  return 0;
-}
-#endif
-
-static int igraphmodule_igraph_interrupt_hook(void* data) {
-  if (PyErr_CheckSignals()) {
-    IGRAPH_FINALLY_FREE();
-    return IGRAPH_INTERRUPTED;
-  }
-  return IGRAPH_SUCCESS;
-}
-
-int igraphmodule_igraph_progress_hook(const char* message, igraph_real_t percent,
-				       void* data) {
-  PyObject* progress_handler = GETSTATE(0)->progress_handler;
-
-  if (progress_handler) {
-    PyObject *result;
-    if (PyCallable_Check(progress_handler)) {
-      result=PyObject_CallFunction(progress_handler,
-				   "sd", message, (double)percent);
-      if (result)
-        Py_DECREF(result);
-      else
-        return IGRAPH_INTERRUPTED;
-    }
-  }
-  
-  return IGRAPH_SUCCESS;
-}
-
-int igraphmodule_igraph_status_hook(const char* message, void*data) {
-  PyObject* status_handler = GETSTATE(0)->status_handler;
-
-  if (status_handler) {
-    PyObject *result;
-    if (PyCallable_Check(status_handler)) {
-      result = PyObject_CallFunction(status_handler, "s", message);
-      if (result)
-        Py_DECREF(result);
-      else
-        return IGRAPH_INTERRUPTED;
-    }
-  }
-  
-  return IGRAPH_SUCCESS;
-}
-
-PyObject* igraphmodule_set_progress_handler(PyObject* self, PyObject* o) {
-  PyObject* progress_handler;
-
-  if (!PyCallable_Check(o) && o != Py_None) {
-    PyErr_SetString(PyExc_TypeError, "Progress handler must be callable.");
-    return NULL;
-  }
-
-  progress_handler = GETSTATE(self)->progress_handler;
-  if (o == progress_handler)
-    Py_RETURN_NONE;
-
-  Py_XDECREF(progress_handler);
-  if (o == Py_None)
-    o = 0;
-  Py_XINCREF(o);
-  GETSTATE(self)->progress_handler=o;
-
-  Py_RETURN_NONE;
-}
-
-PyObject* igraphmodule_set_status_handler(PyObject* self, PyObject* o) {
-  PyObject* status_handler;
-
-  if (!PyCallable_Check(o) && o != Py_None) {
-    PyErr_SetString(PyExc_TypeError, "Status handler must be callable.");
-    return NULL;
-  }
-
-  status_handler = GETSTATE(self)->status_handler;
-  if (o == status_handler)
-    Py_RETURN_NONE;
-
-  Py_XDECREF(status_handler);
-  if (o == Py_None)
-    o = 0;
-  Py_INCREF(o);
-  GETSTATE(self)->status_handler = o;
-
-  Py_RETURN_NONE;
-}
-
-PyObject* igraphmodule_convex_hull(PyObject* self, PyObject* args, PyObject* kwds) {
-  static char* kwlist[] = {"vs", "coords", NULL};
-  PyObject *vs, *o, *o1=0, *o2=0, *coords = Py_False;
-  igraph_matrix_t mtrx;
-  igraph_vector_t result;
-  igraph_matrix_t resmat;
-  long no_of_nodes, i;
-  
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O", kwlist, &PyList_Type, &vs, &coords))
-    return NULL;
-  
-  no_of_nodes=PyList_Size(vs);
-  if (igraph_matrix_init(&mtrx, no_of_nodes, 2)) {
-    igraphmodule_handle_igraph_error();
-    return NULL;
-  }
-  for (i=0; i<no_of_nodes; i++) {
-    o=PyList_GetItem(vs, i);
-    if (PyList_Check(o)) {
-      if (PyList_Size(o) >= 2) {
-        o1=PyList_GetItem(o, 0);
-        o2=PyList_GetItem(o, 1);
-        if (PyList_Size(o) > 2)
-          PyErr_Warn(PyExc_Warning, "vertex with more than 2 coordinates found, considering only the first 2");
-      } else {
-        PyErr_SetString(PyExc_TypeError, "vertex with less than 2 coordinates found");
-        igraph_matrix_destroy(&mtrx);
-	    return NULL;
-      }
-    } else if (PyTuple_Check(o)) {
-      if (PyTuple_Size(o) >= 2) {
-	    o1=PyTuple_GetItem(o, 0);
-	    o2=PyTuple_GetItem(o, 1);
-	    if (PyTuple_Size(o) > 2)
-	      PyErr_Warn(PyExc_Warning, "vertex with more than 2 coordinates found, considering only the first 2");
-       } else {
-	      PyErr_SetString(PyExc_TypeError, "vertex with less than 2 coordinates found");
-	    igraph_matrix_destroy(&mtrx);
-	    return NULL;
-      }
-    }
-    
-    if (!PyNumber_Check(o1) || !PyNumber_Check(o2)) {
-      PyErr_SetString(PyExc_TypeError, "vertex coordinates must be numeric");
-      igraph_matrix_destroy(&mtrx);
-      return NULL;
-    }
-    /* o, o1 and o2 were borrowed, but now o1 and o2 are actual references! */
-    o1=PyNumber_Float(o1); o2=PyNumber_Float(o2);
-    if (!o1 || !o2) {
-      PyErr_SetString(PyExc_TypeError, "vertex coordinate conversion to float failed");
-      Py_XDECREF(o1);
-      Py_XDECREF(o2);
-      igraph_matrix_destroy(&mtrx);
-      return NULL;
-    }
-    MATRIX(mtrx, i, 0)=(igraph_real_t)PyFloat_AsDouble(o1);
-    MATRIX(mtrx, i, 1)=(igraph_real_t)PyFloat_AsDouble(o2);
-    Py_DECREF(o1);
-    Py_DECREF(o2);
-  }
-
-  if (!PyObject_IsTrue(coords)) {
-    if (igraph_vector_init(&result, 0)) {
-      igraphmodule_handle_igraph_error();
-      igraph_matrix_destroy(&mtrx);
-      return NULL;
-    }
-    if (igraph_convex_hull(&mtrx, &result, 0)) {
-      igraphmodule_handle_igraph_error();
-      igraph_matrix_destroy(&mtrx);
-      igraph_vector_destroy(&result);
-      return NULL;
-    }    
-    o=igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-    igraph_vector_destroy(&result);
-  } else {
-    if (igraph_matrix_init(&resmat, 0, 0)) {
-      igraphmodule_handle_igraph_error();
-      igraph_matrix_destroy(&mtrx);
-      return NULL;
-    }
-    if (igraph_convex_hull(&mtrx, 0, &resmat)) {
-      igraphmodule_handle_igraph_error();
-      igraph_matrix_destroy(&mtrx);
-      igraph_matrix_destroy(&resmat);
-      return NULL;
-    }        
-    o=igraphmodule_matrix_t_to_PyList(&resmat, IGRAPHMODULE_TYPE_FLOAT);
-    igraph_matrix_destroy(&resmat);
-  }
-  
-  igraph_matrix_destroy(&mtrx);
-
-  return o;
-}
-
-
-PyObject* igraphmodule_community_to_membership(PyObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "merges", "nodes", "steps", "return_csize", NULL };
-  PyObject *merges_o, *return_csize = Py_False, *result_o;
-  igraph_matrix_t merges;
-  igraph_vector_t result, csize, *csize_p = 0;
-  long int nodes, steps;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!ll|O", kwlist,
-      &PyList_Type, &merges_o, &nodes, &steps, &return_csize)) return NULL;
-
-  if (igraphmodule_PyList_to_matrix_t(merges_o, &merges)) return NULL;
-
-  if (igraph_vector_init(&result, nodes)) {
-    igraphmodule_handle_igraph_error();
-    igraph_matrix_destroy(&merges);
-    return NULL;
-  }
-
-  if (PyObject_IsTrue(return_csize)) {
-    igraph_vector_init(&csize, 0);
-    csize_p = &csize;
-  }
-
-  if (igraph_community_to_membership(&merges, (igraph_integer_t)nodes,
-        (igraph_integer_t)steps, &result, csize_p)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&result);
-    if (csize_p) igraph_vector_destroy(csize_p);
-    igraph_matrix_destroy(&merges);
-    return NULL;
-  }
-  igraph_matrix_destroy(&merges);
-
-  result_o = igraphmodule_vector_t_to_PyList(&result, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&result);
-
-  if (csize_p) {
-	PyObject* csize_o = igraphmodule_vector_t_to_PyList(csize_p, IGRAPHMODULE_TYPE_INT);
-	igraph_vector_destroy(csize_p);
-	if (csize_o) return Py_BuildValue("NN", result_o, csize_o);
-	Py_DECREF(result_o);
-	return NULL;
-  }
-
-  return result_o;
-}
-
-
-PyObject* igraphmodule_compare_communities(PyObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "comm1", "comm2", "method", NULL };
-  PyObject *comm1_o, *comm2_o, *method_o = Py_None;
-  igraph_vector_t comm1, comm2;
-  igraph_community_comparison_t method = IGRAPH_COMMCMP_VI;
-  igraph_real_t result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO|O", kwlist,
-      &comm1_o, &comm2_o, &method_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_community_comparison_t(method_o, &method))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(comm1_o, &comm1, 0, 0))
-    return NULL;
-  if (igraphmodule_PyObject_to_vector_t(comm2_o, &comm2, 0, 0)) {
-    igraph_vector_destroy(&comm1);
-    return NULL;
-  }
-
-  if (igraph_compare_communities(&comm1, &comm2, &result, method)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&comm1);
-    igraph_vector_destroy(&comm2);
-    return NULL;
-  }
-  igraph_vector_destroy(&comm1);
-  igraph_vector_destroy(&comm2);
-
-  return PyFloat_FromDouble((double)result);
-}
-
-
-PyObject* igraphmodule_is_degree_sequence(PyObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "out_deg", "in_deg", NULL };
-  PyObject *out_deg_o = 0, *in_deg_o = 0;
-  igraph_vector_t out_deg, in_deg;
-  igraph_bool_t is_directed, result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist,
-      &out_deg_o, &in_deg_o))
-    return NULL;
-
-  is_directed = (in_deg_o != 0 && in_deg_o != Py_None);
-
-  if (igraphmodule_PyObject_to_vector_t(out_deg_o, &out_deg, 0, 0))
-    return NULL;
-
-  if (is_directed && igraphmodule_PyObject_to_vector_t(in_deg_o, &in_deg, 0, 0)) {
-    igraph_vector_destroy(&out_deg);
-    return NULL;
-  }
-
-  if (igraph_is_degree_sequence(&out_deg, is_directed ? &in_deg : 0, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&out_deg);
-    if (is_directed)
-      igraph_vector_destroy(&in_deg);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&out_deg);
-  if (is_directed)
-    igraph_vector_destroy(&in_deg);
-
-  if (result)
-    Py_RETURN_TRUE;
-  else
-    Py_RETURN_FALSE;
-}
-
-
-PyObject* igraphmodule_is_graphical_degree_sequence(PyObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "out_deg", "in_deg", NULL };
-  PyObject *out_deg_o = 0, *in_deg_o = 0;
-  igraph_vector_t out_deg, in_deg;
-  igraph_bool_t is_directed, result;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|O", kwlist,
-      &out_deg_o, &in_deg_o))
-    return NULL;
-
-  is_directed = (in_deg_o != 0 && in_deg_o != Py_None);
-
-  if (igraphmodule_PyObject_to_vector_t(out_deg_o, &out_deg, 0, 0))
-    return NULL;
-
-  if (is_directed && igraphmodule_PyObject_to_vector_t(in_deg_o, &in_deg, 0, 0)) {
-    igraph_vector_destroy(&out_deg);
-    return NULL;
-  }
-
-  if (igraph_is_graphical_degree_sequence(&out_deg, is_directed ? &in_deg : 0, &result)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&out_deg);
-    if (is_directed)
-      igraph_vector_destroy(&in_deg);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&out_deg);
-  if (is_directed)
-    igraph_vector_destroy(&in_deg);
-
-  if (result)
-    Py_RETURN_TRUE;
-  else
-    Py_RETURN_FALSE;
-}
-
-
-PyObject* igraphmodule_power_law_fit(PyObject *self, PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "data", "xmin", "force_continuous", NULL };
-  PyObject *data_o, *force_continuous_o = Py_False;
-  igraph_vector_t data;
-  igraph_plfit_result_t result;
-  double xmin = -1;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O|dO", kwlist, &data_o,
-        &xmin, &force_continuous_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_float_to_vector_t(data_o, &data))
-    return NULL;
-
-  if (igraph_power_law_fit(&data, &result, xmin, PyObject_IsTrue(force_continuous_o))) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&data);
-    return NULL;
-  }
-
-  igraph_vector_destroy(&data);
-
-  return Py_BuildValue("Oddddd", result.continuous ? Py_True : Py_False,
-      result.alpha, result.xmin, result.L, result.D, result.p);
-}
-
-PyObject* igraphmodule_split_join_distance(PyObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "comm1", "comm2", NULL };
-  PyObject *comm1_o, *comm2_o;
-  igraph_vector_t comm1, comm2;
-  igraph_integer_t distance12, distance21;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO", kwlist,
-      &comm1_o, &comm2_o))
-    return NULL;
-
-  if (igraphmodule_PyObject_to_vector_t(comm1_o, &comm1, 0, 0))
-    return NULL;
-  if (igraphmodule_PyObject_to_vector_t(comm2_o, &comm2, 0, 0)) {
-    igraph_vector_destroy(&comm1);
-    return NULL;
-  }
-
-  if (igraph_split_join_distance(&comm1, &comm2, &distance12, &distance21)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&comm1);
-    igraph_vector_destroy(&comm2);
-    return NULL;
-  }
-  igraph_vector_destroy(&comm1);
-  igraph_vector_destroy(&comm2);
-
-  return Py_BuildValue("ll", (long)distance12, (long)distance21);
-}
-
-/** \ingroup python_interface
- * \brief Method table for the igraph Python module
- */
-static PyMethodDef igraphmodule_methods[] = 
-{
-  {"community_to_membership", (PyCFunction)igraphmodule_community_to_membership,
-    METH_VARARGS | METH_KEYWORDS,
-    "community_to_membership(merges, nodes, steps, return_csize=False)"
-  },
-  {"_compare_communities", (PyCFunction)igraphmodule_compare_communities,
-    METH_VARARGS | METH_KEYWORDS,
-    "_compare_communities(comm1, comm2, method=\"vi\")"
-  },
-  {"_power_law_fit", (PyCFunction)igraphmodule_power_law_fit,
-    METH_VARARGS | METH_KEYWORDS,
-    "_power_law_fit(data, xmin=-1, force_continuous=False)"
-  },
-  {"convex_hull", (PyCFunction)igraphmodule_convex_hull,
-    METH_VARARGS | METH_KEYWORDS,
-    "convex_hull(vs, coords=False)\n\n"
-    "Calculates the convex hull of a given point set.\n\n"
-    "@param vs: the point set as a list of lists\n"
-    "@param coords: if C{True}, the function returns the\n"
-    "  coordinates of the corners of the convex hull polygon,\n"
-    "  otherwise returns the corner indices.\n"
-    "@return: either the hull's corner coordinates or the point\n"
-    "  indices corresponding to them, depending on the C{coords}\n"
-    "  parameter."
-  },
-  {"is_degree_sequence", (PyCFunction)igraphmodule_is_degree_sequence,
-    METH_VARARGS | METH_KEYWORDS,
-    "is_degree_sequence(out_deg, in_deg=None)\n\n"
-    "Returns whether a list of degrees can be a degree sequence of some graph.\n\n"
-    "Note that it is not required for the graph to be simple; in other words,\n"
-    "this function may return C{True} for degree sequences that can be realized\n"
-    "using one or more multiple or loop edges only.\n\n"
-    "In particular, this function checks whether\n\n"
-    "  - all the degrees are non-negative\n"
-    "  - for undirected graphs, the sum of degrees are even\n"
-    "  - for directed graphs, the two degree sequences are of the same length and\n"
-    "    equal sums\n\n"
-    "@param out_deg: the list of degrees. For directed graphs, this list must\n"
-    "  contain the out-degrees of the vertices.\n"
-    "@param in_deg: the list of in-degrees for directed graphs. This parameter\n"
-    "  must be C{None} for undirected graphs.\n"
-    "@return: C{True} if there exists some graph that can realize the given degree\n"
-    "  sequence, C{False} otherwise."
-    "@see: L{is_graphical_degree_sequence()} if you do not want to allow multiple\n"
-    "  or loop edges.\n"
-  },
-  {"is_graphical_degree_sequence", (PyCFunction)igraphmodule_is_graphical_degree_sequence,
-    METH_VARARGS | METH_KEYWORDS,
-    "is_graphical_degree_sequence(out_deg, in_deg=None)\n\n"
-    "Returns whether a list of degrees can be a degree sequence of some simple graph.\n\n"
-    "Note that it is required for the graph to be simple; in other words,\n"
-    "this function will return C{False} for degree sequences that cannot be realized\n"
-    "without using one or more multiple or loop edges.\n\n"
-    "@param out_deg: the list of degrees. For directed graphs, this list must\n"
-    "  contain the out-degrees of the vertices.\n"
-    "@param in_deg: the list of in-degrees for directed graphs. This parameter\n"
-    "  must be C{None} for undirected graphs.\n"
-    "@return: C{True} if there exists some simple graph that can realize the given\n"
-    "  degree sequence, C{False} otherwise.\n"
-    "@see: L{is_degree_sequence()} if you want to allow multiple or loop edges.\n"
-  },
-  {"set_progress_handler", igraphmodule_set_progress_handler, METH_O,
-      "set_progress_handler(handler)\n\n"
-      "Sets the handler to be called when igraph is performing a long operation.\n"
-      "@param handler: the progress handler function. It must accept two\n"
-      "  arguments, the first is the message informing the user about\n"
-      "  what igraph is doing right now, the second is the actual\n"
-      "  progress information (a percentage).\n"
-  },
-  {"set_random_number_generator", igraph_rng_Python_set_generator, METH_O,
-      "set_random_number_generator(generator)\n\n"
-      "Sets the random number generator used by igraph.\n"
-      "@param generator: the generator to be used. It must be a Python object\n"
-      "  with at least three attributes: C{random}, C{randint} and C{gauss}.\n"
-      "  Each of them must be callable and their signature and behaviour\n"
-      "  must be identical to C{random.random}, C{random.randint} and\n"
-      "  C{random.gauss}. By default, igraph uses the C{random} module for\n"
-      "  random number generation, but you can supply your alternative\n"
-      "  implementation here. If the given generator is C{None}, igraph\n"
-      "  reverts to the default Mersenne twister generator implemented in the\n"
-      "  C layer, which might be slightly faster than calling back to Python\n"
-      "  for random numbers, but you cannot set its seed or save its state.\n"
-  },
-  {"set_status_handler", igraphmodule_set_status_handler, METH_O,
-      "set_status_handler(handler)\n\n"
-      "Sets the handler to be called when igraph tries to display a status\n"
-      "message.\n\n"
-      "This is used to communicate the progress of some calculations where\n"
-      "no reasonable progress percentage can be given (so it is not possible\n"
-      "to use the progress handler).\n\n"
-      "@param handler: the status handler function. It must accept a single\n"
-      "  argument, the message that informs the user about what igraph is\n"
-      "  doing right now.\n"
-  },
-  {"_split_join_distance", (PyCFunction)igraphmodule_split_join_distance,
-    METH_VARARGS | METH_KEYWORDS,
-    "_split_join_distance(comm1, comm2)"
-  },
-  {NULL, NULL, 0, NULL}
-};
-
-#define MODULE_DOCS \
-  "Low-level Python interface for the igraph library. " \
-  "Should not be used directly.\n\n"                    \
-  "@undocumented: community_to_membership, _compare_communities, _power_law_fit, " \
-  "_split_join_distance"
-
-/**
- * Module definition table (only for Python 3.x)
- */
-#ifdef IGRAPH_PYTHON3
-static struct PyModuleDef moduledef = {
-  PyModuleDef_HEAD_INIT,
-  "igraph._igraph",                   /* m_name */
-  MODULE_DOCS,                        /* m_doc */
-  sizeof(struct module_state),        /* m_size */
-  igraphmodule_methods,               /* m_methods */
-  0,                                  /* m_reload */
-  igraphmodule_traverse,              /* m_traverse */
-  igraphmodule_clear,                 /* m_clear */
-  0                                   /* m_free */
-};
-#endif
-
-/****************** Exported API functions *******************/
-
-/**
- * \brief Constructs a new Python Graph object from an existing igraph_t
- *
- * The newly created Graph object will take ownership of igraph_t and
- * it will destroy it when the Python object is destructed.
- *
- * Returns a null pointer in case of an error and sets the appropriate
- * Python exception.
- */
-PyObject* PyIGraph_FromCGraph(igraph_t* g) {
-  return igraphmodule_Graph_from_igraph_t(g);
-}
-
-/**
- * \brief Extracts the pointer to the \c igraph_t held by a Graph instance
- *
- * The ownership of the \c igraph_t object remains with the Graph instance,
- * so make sure you don't call \c igraph_destroy() on the extracted pointer.
- *
- * Returns a null pointer in case of an error and sets the appropriate
- * Python exception.
- */
-igraph_t* PyIGraph_ToCGraph(PyObject* graph) {
-  igraph_t *result = 0;
-
-  if (graph == Py_None) {
-    PyErr_SetString(PyExc_TypeError, "expected Graph, got None");
-    return 0;
-  }
-
-  if (igraphmodule_PyObject_to_igraph_t(graph, &result))
-    return 0;
-
-  if (result == 0)
-    PyErr_SetString(PyExc_ValueError, "null pointer stored inside a Graph "
-                                      "object. Probably a bug.");
-
-  return result;
-}
-
-extern PyObject* igraphmodule_InternalError;
-extern PyObject* igraphmodule_arpack_options_default;
-
-#ifdef IGRAPH_PYTHON3
-#  define INITERROR return NULL
-   PyObject* PyInit__igraph(void)
-#else
-#  define INITERROR return
-#  ifndef PyMODINIT_FUNC
-#    define PyMODINIT_FUNC void
-#  endif
-   PyMODINIT_FUNC init_igraph(void)
-#endif
-{
-  PyObject* m;
-  static void *PyIGraph_API[PyIGraph_API_pointers];
-  PyObject *c_api_object;
-
-  /* Check if the module is already initialized (possibly in another Python
-   * interpreter. If so, bail out as we don't support this. */
-  if (igraphmodule_initialized) {
-    PyErr_SetString(PyExc_RuntimeError, "igraph module is already initialized "
-        "in a different Python interpreter");
-    INITERROR;
-  }
-
-  /* Initialize VertexSeq, EdgeSeq */
-  if (PyType_Ready(&igraphmodule_VertexSeqType) < 0)
-    INITERROR;
-  if (PyType_Ready(&igraphmodule_EdgeSeqType) < 0)
-    INITERROR;
-  
-  /* Initialize Vertex, Edge */
-  igraphmodule_VertexType.tp_clear = (inquiry)igraphmodule_Vertex_clear;
-  if (PyType_Ready(&igraphmodule_VertexType) < 0)
-    INITERROR;
-  
-  igraphmodule_EdgeType.tp_clear = (inquiry)igraphmodule_Edge_clear;
-  if (PyType_Ready(&igraphmodule_EdgeType) < 0)
-    INITERROR;
-
-  /* Initialize Graph, BFSIter, ARPACKOptions etc */
-  if (PyType_Ready(&igraphmodule_GraphType) < 0)
-    INITERROR;
-  if (PyType_Ready(&igraphmodule_BFSIterType) < 0)
-    INITERROR;
-  if (PyType_Ready(&igraphmodule_ARPACKOptionsType) < 0)
-    INITERROR;
-
-  /* Initialize the core module */
-#ifdef IGRAPH_PYTHON3
-  m = PyModule_Create(&moduledef);
-#else
-  m = Py_InitModule3("igraph._igraph", igraphmodule_methods, MODULE_DOCS);
-#endif
-
-  if (m == NULL)
-    INITERROR;
-
-  /* Initialize random number generator */
-  igraphmodule_init_rng(m);
-
-  /* Add the types to the core module */
-  PyModule_AddObject(m, "GraphBase", (PyObject*)&igraphmodule_GraphType);
-  PyModule_AddObject(m, "BFSIter", (PyObject*)&igraphmodule_BFSIterType);
-  PyModule_AddObject(m, "ARPACKOptions", (PyObject*)&igraphmodule_ARPACKOptionsType);
-  PyModule_AddObject(m, "Edge", (PyObject*)&igraphmodule_EdgeType);
-  PyModule_AddObject(m, "EdgeSeq", (PyObject*)&igraphmodule_EdgeSeqType);
-  PyModule_AddObject(m, "Vertex", (PyObject*)&igraphmodule_VertexType);
-  PyModule_AddObject(m, "VertexSeq", (PyObject*)&igraphmodule_VertexSeqType);
- 
-  /* Internal error exception type */
-  igraphmodule_InternalError =
-    PyErr_NewException("igraph._igraph.InternalError", PyExc_Exception, NULL);
-  PyModule_AddObject(m, "InternalError", igraphmodule_InternalError);
-
-  /* ARPACK default options variable */
-  igraphmodule_arpack_options_default = igraphmodule_ARPACKOptions_new();
-  PyModule_AddObject(m, "arpack_options", igraphmodule_arpack_options_default);
-
-  /* Useful constants */
-  PyModule_AddIntConstant(m, "OUT", IGRAPH_OUT);
-  PyModule_AddIntConstant(m, "IN", IGRAPH_IN);
-  PyModule_AddIntConstant(m, "ALL", IGRAPH_ALL);
-
-  PyModule_AddIntConstant(m, "STAR_OUT", IGRAPH_STAR_OUT);
-  PyModule_AddIntConstant(m, "STAR_IN", IGRAPH_STAR_IN);
-  PyModule_AddIntConstant(m, "STAR_MUTUAL", IGRAPH_STAR_MUTUAL);
-  PyModule_AddIntConstant(m, "STAR_UNDIRECTED", IGRAPH_STAR_UNDIRECTED);
-
-  PyModule_AddIntConstant(m, "TREE_OUT", IGRAPH_TREE_OUT);
-  PyModule_AddIntConstant(m, "TREE_IN", IGRAPH_TREE_IN);
-  PyModule_AddIntConstant(m, "TREE_UNDIRECTED", IGRAPH_TREE_UNDIRECTED);
-
-  PyModule_AddIntConstant(m, "STRONG", IGRAPH_STRONG);
-  PyModule_AddIntConstant(m, "WEAK", IGRAPH_WEAK);
-
-  PyModule_AddIntConstant(m, "GET_ADJACENCY_UPPER", IGRAPH_GET_ADJACENCY_UPPER);
-  PyModule_AddIntConstant(m, "GET_ADJACENCY_LOWER", IGRAPH_GET_ADJACENCY_LOWER);
-  PyModule_AddIntConstant(m, "GET_ADJACENCY_BOTH", IGRAPH_GET_ADJACENCY_BOTH);
-
-  PyModule_AddIntConstant(m, "REWIRING_SIMPLE", IGRAPH_REWIRING_SIMPLE);
-  PyModule_AddIntConstant(m, "REWIRING_SIMPLE_LOOPS", IGRAPH_REWIRING_SIMPLE_LOOPS);
-
-  PyModule_AddIntConstant(m, "ADJ_DIRECTED", IGRAPH_ADJ_DIRECTED);
-  PyModule_AddIntConstant(m, "ADJ_UNDIRECTED", IGRAPH_ADJ_UNDIRECTED);
-  PyModule_AddIntConstant(m, "ADJ_MAX", IGRAPH_ADJ_MAX);
-  PyModule_AddIntConstant(m, "ADJ_MIN", IGRAPH_ADJ_MIN);
-  PyModule_AddIntConstant(m, "ADJ_PLUS", IGRAPH_ADJ_PLUS);
-  PyModule_AddIntConstant(m, "ADJ_UPPER", IGRAPH_ADJ_UPPER);
-  PyModule_AddIntConstant(m, "ADJ_LOWER", IGRAPH_ADJ_LOWER);
-
-  PyModule_AddIntConstant(m, "BLISS_F", IGRAPH_BLISS_F);
-  PyModule_AddIntConstant(m, "BLISS_FL", IGRAPH_BLISS_FL);
-  PyModule_AddIntConstant(m, "BLISS_FS", IGRAPH_BLISS_FS);
-  PyModule_AddIntConstant(m, "BLISS_FM", IGRAPH_BLISS_FM);
-  PyModule_AddIntConstant(m, "BLISS_FLM", IGRAPH_BLISS_FLM);
-  PyModule_AddIntConstant(m, "BLISS_FSM", IGRAPH_BLISS_FSM);
-
-  PyModule_AddIntConstant(m, "TRANSITIVITY_NAN", IGRAPH_TRANSITIVITY_NAN);
-  PyModule_AddIntConstant(m, "TRANSITIVITY_ZERO", IGRAPH_TRANSITIVITY_ZERO);
-
-  /* More useful constants */
-  {
-    const char* version;
-    igraph_version(&version, 0, 0, 0);
-    PyModule_AddStringConstant(m, "__version__", version);
-  }
-  PyModule_AddStringConstant(m, "__build_date__", __DATE__);
-
-  /* initialize error, progress, warning and interruption handler */
-  igraph_set_error_handler(igraphmodule_igraph_error_hook);
-  igraph_set_progress_handler(igraphmodule_igraph_progress_hook);
-  igraph_set_status_handler(igraphmodule_igraph_status_hook);
-  igraph_set_warning_handler(igraphmodule_igraph_warning_hook);
-  igraph_set_interruption_handler(igraphmodule_igraph_interrupt_hook);
-  
-  /* initialize attribute handlers */
-  igraphmodule_initialize_attribute_handler();
-
-  /* Initialize the C API pointer array */
-  PyIGraph_API[PyIGraph_FromCGraph_NUM] = (void *)PyIGraph_FromCGraph;
-  PyIGraph_API[PyIGraph_ToCGraph_NUM]   = (void *)PyIGraph_ToCGraph;
-
-  /* Create a CObject containing the API pointer array's address */
-#ifdef IGRAPH_PYTHON3
-  c_api_object = PyCapsule_New((void*)PyIGraph_API, "igraph._igraph._C_API", 0);
-#else
-  c_api_object = PyCObject_FromVoidPtr((void*)PyIGraph_API, 0);
-#endif
-  if (c_api_object != 0) {
-    PyModule_AddObject(m, "_C_API", c_api_object);
-  }
-
-  igraphmodule_initialized = 1;
-
-#ifdef IGRAPH_PYTHON3
-  return m;
-#endif
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/igraphmodule_api.h igraph-0.6.5/interfaces/python/src/igraphmodule_api.h
--- igraph-0.6.5~quantal1/interfaces/python/src/igraphmodule_api.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/igraphmodule_api.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef Py_IGRAPHMODULE_H
-#define Py_IGRAPHMODULE_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* C API functions */
-#define PyIGraph_FromCGraph_NUM 0
-#define PyIGraph_FromCGraph_RETURN PyObject*
-#define PyIGraph_FromCGraph_PROTO (igraph_t *graph)
-
-#define PyIGraph_ToCGraph_NUM 1
-#define PyIGraph_ToCGraph_RETURN igraph_t*
-#define PyIGraph_ToCGraph_PROTO (PyObject *graph)
-
-/* Total number of C API pointers */
-#define PyIGraph_API_pointers 2
-
-#ifdef IGRAPH_MODULE
-  /* This section is used when compiling igraphmodule.c */
-  static PyIGraph_FromCGraph_RETURN PyIGraph_FromCGraph PyIGraph_FromCGraph_PROTO;
-  static PyIGraph_ToCGraph_RETURN PyIGraph_ToCGraph PyIGraph_ToCGraph_PROTO;
-#else
-  /* This section is used in modules that use igraph's API */
-  static void** PyIGraph_API;
-# define PyIGraph_FromCGraph \
-         (*(PyIGraph_FromCGraph_RETURN (*)PyIGraph_FromCGraph_PROTO) \
-		 PyIGraph_API[PyIGraph_FromCGraph_NUM])
-# define PyIGraph_ToCGraph \
-         (*(PyIGraph_ToCGraph_RETURN (*)PyIGraph_ToCGraph_PROTO) \
-		 PyIGraph_API[PyIGraph_ToCGraph_NUM])
-
-  /* Return -1 and set exception on error, 0 on success */
-  static int import_igraph(void) {
-    PyObject *c_api_object;
-    PyObject *module;
-
-    module = PyImport_ImportModule("igraph._igraph");
-    if (module == 0)
-      return -1;
-
-    c_api_object = PyObject_GetAttrString(module, "_C_API");
-    if (c_api_object == 0) {
-      Py_DECREF(module);
-      return -1;
-    }
-
-    if (PyCObject_Check(c_api_object))
-      PyIGraph_API = (void**)PyCObject_AsVoidPtr(c_api_object);
-
-    Py_DECREF(c_api_object);
-    Py_DECREF(module);
-    return 0;
-  }
-
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif   /* !defined(Py_IGRAPHMODULE_H) */
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/indexing.c igraph-0.6.5/interfaces/python/src/indexing.c
--- igraph-0.6.5~quantal1/interfaces/python/src/indexing.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/indexing.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,544 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library - Python interface.
-   Copyright (C) 2006-2011  Tamas Nepusz <ntamas@gmail.com>
-   5 Avenue Road, Staines, Middlesex, TW18 3AW, United Kingdom
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "attributes.h"
-#include "convert.h"
-#include "error.h"
-#include "indexing.h"
-#include "platform.h"
-#include "py2compat.h"
-#include "pyhelpers.h"
-
-/***************************************************************************/
-
-static PyObject* igraphmodule_i_Graph_adjmatrix_indexing_get_value_for_vertex_pair(
-    igraph_t* graph, igraph_integer_t from, igraph_integer_t to, PyObject* values) {
-  igraph_integer_t eid;
-  PyObject* result;
-
-  /* Retrieving a single edge */
-  igraph_get_eid(graph, &eid, from, to, /* directed = */1, /* error = */0);
-  if (eid >= 0) {
-    /* Edge found, get the value of the attribute */
-    if (values == 0) {
-      return PyInt_FromLong(1L);
-    } else {
-      result = PyList_GetItem(values, eid);
-      Py_XINCREF(result);
-      return result;
-    }
-  } else {
-    /* No such edge, return zero */
-    return PyInt_FromLong(0L);
-  }
-}
-
-static PyObject* igraphmodule_i_Graph_adjmatrix_get_index_row(igraph_t* graph, 
-    igraph_integer_t from, igraph_vs_t* to, igraph_neimode_t neimode,
-    PyObject* values);
-
-PyObject* igraphmodule_Graph_adjmatrix_get_index(igraph_t* graph,
-        PyObject* row_index, PyObject* column_index, PyObject* attr_name) {
-    PyObject *result = 0, *values;
-    igraph_vs_t vs1, vs2;
-    igraph_integer_t vid1 = -1, vid2 = -1;
-    char* attr;
-
-    if (igraphmodule_PyObject_to_vs_t(row_index, &vs1, graph, 0, &vid1))
-      return NULL;
-    if (igraphmodule_PyObject_to_vs_t(column_index, &vs2, graph, 0, &vid2))
-      return NULL;
-
-    if (attr_name == 0) {
-      /* Using the "weight" attribute by default */
-      values = igraphmodule_get_edge_attribute_values(graph, "weight");
-    } else {
-      /* Specifying the name of the attribute */
-      attr = PyObject_ConvertToCString(attr_name);
-      values = igraphmodule_get_edge_attribute_values(graph, attr);
-      free(attr);
-    }
-
-    if (vid1 >= 0 && vid2 >= 0) {
-      /* Retrieving an edge between vid1 and vid2 */
-      result = igraphmodule_i_Graph_adjmatrix_indexing_get_value_for_vertex_pair(
-          graph, vid1, vid2, values);
-    } else if (vid1 >= 0) {
-      /* Retrieving the successors of vid1 */
-      result = igraphmodule_i_Graph_adjmatrix_get_index_row(
-          graph, vid1, &vs2, IGRAPH_OUT, values);
-    } else if (vid2 >= 0) {
-      /* Retrieving the predecessors of vid2 */
-      result = igraphmodule_i_Graph_adjmatrix_get_index_row(
-          graph, vid2, &vs1, IGRAPH_IN, values);
-    } else {
-      /* Retrieving a submatrix */
-      igraph_vit_t vit;
-      PyObject *item;
-
-      if (igraph_vit_create(graph, vs1, &vit)) {
-        igraphmodule_handle_igraph_error();
-        result = 0;
-      } else {
-        result = PyList_New(0);
-        if (result != 0) {
-          while (!IGRAPH_VIT_END(vit)) {
-            vid1 = IGRAPH_VIT_GET(vit);
-            item = igraphmodule_i_Graph_adjmatrix_get_index_row(graph, vid1, &vs2, IGRAPH_OUT, values);
-            if (item == 0) {
-              Py_DECREF(result);
-              result = 0;
-              break;
-            }
-            if (PyList_Append(result, item)) {
-              /* error while appending */
-              Py_DECREF(item);
-              Py_DECREF(result);
-              result = 0;
-              break;
-            }
-            Py_DECREF(item);
-            IGRAPH_VIT_NEXT(vit);
-          }
-        }
-        igraph_vit_destroy(&vit);
-      }
-    }
-
-    igraph_vs_destroy(&vs1);
-    igraph_vs_destroy(&vs2);
-
-    return result;
-}
-
-static PyObject* igraphmodule_i_Graph_adjmatrix_get_index_row(igraph_t* graph, 
-    igraph_integer_t from, igraph_vs_t* to, igraph_neimode_t neimode,
-    PyObject* values) {
-  igraph_vector_t eids;
-  igraph_integer_t eid;
-  igraph_vit_t vit;
-  PyObject *result = 0, *item;
-  long int i, n;
-  igraph_integer_t v;
-
-  if (igraph_vs_is_all(to)) {
-    /* Simple case: all edges */
-    IGRAPH_PYCHECK(igraph_vector_init(&eids, 0));
-    IGRAPH_FINALLY(igraph_vector_destroy, &eids);
-    IGRAPH_PYCHECK(igraph_incident(graph, &eids, from, neimode));
-    
-    n = igraph_vector_size(&eids);
-    result = PyList_Zeroes(igraph_vcount(graph));
-    if (result == 0) {
-      IGRAPH_FINALLY_FREE();
-      return 0;
-    }
-
-    for (i = 0; i < n; i++) {
-      eid = (igraph_integer_t)VECTOR(eids)[i];
-      v = IGRAPH_OTHER(graph, eid, from);
-      if (values)
-        item = PyList_GetItem(values, eid);
-      else
-        item = PyInt_FromLong(1);
-      Py_INCREF(item);
-      PyList_SetItem(result, v, item);   /* reference stolen here */
-    }
-
-    IGRAPH_FINALLY_CLEAN(1);
-    igraph_vector_destroy(&eids);
-
-    return result;
-  }
-
-  /* More complicated case: only some vertices */
-  IGRAPH_PYCHECK(igraph_vit_create(graph, *to, &vit));
-  IGRAPH_FINALLY(igraph_vit_destroy, &vit);
-
-  result = PyList_New(0);
-  if (result == 0) {
-    IGRAPH_FINALLY_FREE();
-    return 0;
-  }
-
-  while (!IGRAPH_VIT_END(vit)) {
-    v = IGRAPH_VIT_GET(vit);
-    if (neimode == IGRAPH_OUT) {
-      item = igraphmodule_i_Graph_adjmatrix_indexing_get_value_for_vertex_pair(
-          graph, from, v, values);
-    } else {
-      item = igraphmodule_i_Graph_adjmatrix_indexing_get_value_for_vertex_pair(
-          graph, v, from, values);
-    }
-    if (item == 0) {
-      IGRAPH_FINALLY_FREE();
-      Py_DECREF(result);
-      return 0;
-    }
-    if (PyList_Append(result, item)) {
-      /* error while appending */
-      Py_DECREF(item);
-      Py_DECREF(result);
-      result = 0;
-      break;
-    }
-    Py_DECREF(item);
-    IGRAPH_VIT_NEXT(vit);
-  }
-
-  igraph_vit_destroy(&vit);
-  IGRAPH_FINALLY_CLEAN(1);
-
-  return result;
-}
-
-/***************************************************************************/
-
-/**
- * Determines whether the given Python value means that the user would like
- * to delete the edge the value is being assigned to in the adjacency matrix
- * assignment syntax.
- */
-static INLINE igraph_bool_t deleting_edge(PyObject* value) {
-  return value == Py_None || value == Py_False ||
-      (PyInt_Check(value) && PyInt_AsLong(value) == 0);
-}
-
-/**
- * Structure to hold data related to newly added/removed edges during an
- * adjacency matrix assignment.
- */
-typedef struct {
-  igraph_vector_t to_add;
-  PyObject* to_add_values;
-  igraph_vector_t to_delete;
-} igraphmodule_i_Graph_adjmatrix_set_index_data_t;
-
-int igraphmodule_i_Graph_adjmatrix_set_index_data_init(
-    igraphmodule_i_Graph_adjmatrix_set_index_data_t* data) {
-  if (igraph_vector_init(&data->to_add, 0)) {
-    igraphmodule_handle_igraph_error();
-    return -1;
-  }
-
-  if (igraph_vector_init(&data->to_delete, 0)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&data->to_delete);
-    return -1;
-  }
-
-  data->to_add_values = PyList_New(0);
-  if (data->to_add_values == 0) {
-    igraph_vector_destroy(&data->to_add);
-    igraph_vector_destroy(&data->to_delete);
-    return -1;
-  }
-
-  return 0;
-}
-
-void igraphmodule_i_Graph_adjmatrix_set_index_data_destroy(
-    igraphmodule_i_Graph_adjmatrix_set_index_data_t* data) {
-  igraph_vector_destroy(&data->to_add);
-  igraph_vector_destroy(&data->to_delete);
-  Py_DECREF(data->to_add_values);
-}
-
-static int igraphmodule_i_Graph_adjmatrix_set_index_row(igraph_t* graph, 
-    igraph_integer_t from, igraph_vs_t* to, igraph_neimode_t neimode,
-    PyObject* values, PyObject* new_value,
-    igraphmodule_i_Graph_adjmatrix_set_index_data_t* data) {
-  PyObject *iter = 0, *item;
-  igraph_vit_t vit;
-  igraph_integer_t v, v1, v2, eid;
-  igraph_bool_t deleting, ok = 1;
-
-  /* Check whether new_value is an iterable (and not a string). If not,
-   * every assignment will use the same value (that is, new_value) */
-  if (!PyBaseString_Check(new_value)) {
-    iter = PyObject_GetIter(new_value);
-    if (PyErr_Occurred()) {
-      /* Object is not an iterable. Clear the exception */
-      iter = 0;
-      PyErr_Clear();
-    }
-  }
-
-  if (igraph_vit_create(graph, *to, &vit)) {
-    Py_XDECREF(iter);
-    igraphmodule_handle_igraph_error();
-    return -1;
-  }
-
-  v1 = from; v2 = from;
-
-  /* The two branches of the next `if' are almost the same; make sure
-   * you make changes to both branches if appropriate! */
-
-  if (iter != 0) {
-    /* The new value is an iterable, so it must have exactly as many elements
-     * as the number of vertices in the graph. If it has less, we simply
-     * skip the rest (with a warning) */
-    while (!IGRAPH_VIT_END(vit) && (item = PyIter_Next(iter)) != 0) {
-      v = IGRAPH_VIT_GET(vit);
-
-      /* Get the ID of the edge between from and v */
-      if (neimode == IGRAPH_OUT) {
-        v2 = v;
-      } else {
-        v1 = v;
-      }
-      igraph_get_eid(graph, &eid, v1, v2, /* directed = */1, /* error = */0);
-      if (deleting_edge(item)) {
-        /* Deleting edges if eid != -1 */
-        if (eid != -1) {
-          if (igraph_vector_push_back(&data->to_delete, eid)) {
-            igraphmodule_handle_igraph_error();
-            igraph_vector_clear(&data->to_delete);
-            ok = 0;
-            break;
-          }
-        }
-      } else {
-        if (eid == -1) {
-          /* Adding edges */
-          if (igraph_vector_push_back(&data->to_add, v1) ||
-              igraph_vector_push_back(&data->to_add, v2)) {
-            igraphmodule_handle_igraph_error();
-            igraph_vector_clear(&data->to_add);
-            ok = 0;
-            break;
-          }
-          if (values != 0) {
-            Py_INCREF(new_value);
-            if (PyList_Append(data->to_add_values, new_value)) {
-              Py_DECREF(new_value);
-              igraph_vector_clear(&data->to_add);
-              ok = 0;
-              break;
-            }
-          }
-        } else if (values != 0) {
-          /* Setting attribute */
-          Py_INCREF(item);
-          if (PyList_SetItem(values, eid, item)) {
-            Py_DECREF(item);
-            igraph_vector_clear(&data->to_add);
-          }
-        }
-      }
-      Py_DECREF(item);
-      IGRAPH_VIT_NEXT(vit);
-    }
-    if (!IGRAPH_VIT_END(vit)) {
-      PyErr_WarnEx(PyExc_RuntimeWarning,
-          "iterable was shorter than the number of vertices in the vertex "
-          "sequence", 1);
-    }
-  } else {
-    /* The new value is not an iterable; setting the same value for
-     * more than one edge */
-    deleting = deleting_edge(new_value);
-    while (!IGRAPH_VIT_END(vit)) {
-      v = IGRAPH_VIT_GET(vit);
-
-      /* Get the ID of the edge between from and v */
-      if (neimode == IGRAPH_OUT) {
-        v2 = v;
-      } else {
-        v1 = v;
-      }
-      igraph_get_eid(graph, &eid, v1, v2, /* directed = */1, /* error = */0);
-
-      if (deleting) {
-        /* Deleting edges if eid != -1 */
-        if (eid != -1) {
-          if (igraph_vector_push_back(&data->to_delete, eid)) {
-            igraphmodule_handle_igraph_error();
-            igraph_vector_clear(&data->to_delete);
-            ok = 0;
-            break;
-          }
-        }
-      } else {
-        if (eid == -1) {
-          /* Adding edges */
-          if (igraph_vector_push_back(&data->to_add, v1) ||
-              igraph_vector_push_back(&data->to_add, v2)) {
-            igraphmodule_handle_igraph_error();
-            igraph_vector_clear(&data->to_add);
-            ok = 0;
-            break;
-          }
-          if (values != 0) {
-            Py_INCREF(new_value);
-            if (PyList_Append(data->to_add_values, new_value)) {
-              Py_DECREF(new_value);
-              igraph_vector_clear(&data->to_add);
-              ok = 0;
-              break;
-            }
-          }
-        } else if (values != 0) {
-          /* Setting attribute */
-          Py_INCREF(new_value);
-          if (PyList_SetItem(values, eid, new_value)) {
-            Py_DECREF(new_value);
-            igraph_vector_clear(&data->to_add);
-          }
-        }
-      }
-      IGRAPH_VIT_NEXT(vit);
-    }
-  }
-
-  Py_XDECREF(iter);
-  igraph_vit_destroy(&vit);
-
-  return ok ? 0 : -1;
-}
-
-int igraphmodule_Graph_adjmatrix_set_index(igraph_t* graph,
-        PyObject* row_index, PyObject* column_index, PyObject* attr_name,
-        PyObject* new_value) {
-  PyObject *values;
-  igraph_vs_t vs1, vs2;
-  igraph_vit_t vit;
-  igraph_integer_t vid1 = -1, vid2 = -1, eid = -1;
-  igraph_bool_t ok = 1;
-  igraphmodule_i_Graph_adjmatrix_set_index_data_t data;
-  char* attr;
-
-  if (igraphmodule_PyObject_to_vs_t(row_index, &vs1, graph, 0, &vid1))
-    return -1;
-  if (igraphmodule_PyObject_to_vs_t(column_index, &vs2, graph, 0, &vid2))
-    return -1;
-
-  if (attr_name == 0) {
-    /* Using the "weight" attribute by default */
-    values = igraphmodule_get_edge_attribute_values(graph, "weight");
-  } else {
-    /* Specifying the name of the attribute */
-    attr = PyObject_ConvertToCString(attr_name);
-    values = igraphmodule_create_or_get_edge_attribute_values(graph, attr);
-    free(attr);
-  }
-
-  if (vid1 >= 0 && vid2 >= 0) {
-    /* Setting an edge between vid1 and vid2 */
-    igraph_get_eid(graph, &eid, vid1, vid2, /* directed = */1, /* error = */0);
-    if (deleting_edge(new_value)) {
-      if (eid != -1) {
-        /* Deleting the edge between vid1 and vid2 if it is there */
-        if (igraph_delete_edges(graph, igraph_ess_1(eid))) {
-          igraphmodule_handle_igraph_error();
-          ok = 0;
-        }
-      }
-    } else {
-      /* Adding the edge between vid1 and vid2 if it is not there */
-      if (eid == -1) {
-        eid = igraph_ecount(graph);
-        if (igraph_add_edge(graph, vid1, vid2)) {
-          igraphmodule_handle_igraph_error();
-          ok = 0;
-        }
-      }
-      if (ok && values != 0) {
-        /* Set the attribute value */
-        Py_INCREF(new_value);
-        PyList_SetItem(values, eid, new_value); /* reference stolen here */
-      }
-    }
-  } else {
-    /* In all the non-trivial cases, we do the modifications in three phases;
-     * in the first phase, we modify the attribute values of edges that are to
-     * stay (but possibly with a different attribute value) and collect the
-     * list of edges to be added (and their attribute values) and the list of
-     * edge to be deleted. In the second phase, we do the deletions in one
-     * batch. Finally, we add the edges to be added.
-     */
-    igraphmodule_i_Graph_adjmatrix_set_index_data_init(&data);
-
-    /* First phase */
-    if (vid1 >= 0) {
-      /* vs1 is a single vertex, vs2 is not */
-      ok = (igraphmodule_i_Graph_adjmatrix_set_index_row(
-              graph, vid1, &vs2, IGRAPH_OUT, values, new_value, &data) == 0);
-    } else if (vid2 >= 0) {
-      /* vs2 is a single vertex, vs1 is not */
-      ok = (igraphmodule_i_Graph_adjmatrix_set_index_row(
-              graph, vid2, &vs1, IGRAPH_IN, values, new_value, &data) == 0);
-    } else {
-      /* Complete submatrix */
-      if (igraph_vit_create(graph, vs1, &vit)) {
-        igraphmodule_handle_igraph_error();
-        ok = 0;
-      } else {
-        while (!IGRAPH_VIT_END(vit)) {
-          vid1 = IGRAPH_VIT_GET(vit);
-          if (igraphmodule_i_Graph_adjmatrix_set_index_row(
-                graph, vid1, &vs2, IGRAPH_OUT, values, new_value, &data) == 0) {
-            ok = 0;
-            break;
-          }
-          IGRAPH_VIT_NEXT(vit);
-        }
-        igraph_vit_destroy(&vit);
-      }
-    }
-
-    if (ok) {
-      /* Second phase: do the deletions in one batch */
-      if (igraph_delete_edges(graph, igraph_ess_vector(&data.to_delete))) {
-        igraphmodule_handle_igraph_error();
-        ok = 0;
-      }
-    }
-
-    if (ok) {
-      /* Third phase: add the new edges in one batch */
-      if (!igraph_vector_empty(&data.to_add)) {
-        eid = igraph_ecount(graph);
-        igraph_add_edges(graph, &data.to_add, 0);
-        if (values != 0) {
-          PyList_SetSlice(values, eid, eid+PyList_Size(data.to_add_values),
-              data.to_add_values);
-          if (PyList_Size(values) != igraph_ecount(graph)) {
-            PyErr_SetString(PyExc_ValueError, "hmmm, attribute value list "
-                "length mismatch, this is most likely a bug.");
-            ok = 0;
-          }
-        }
-      }
-    }
-
-    igraphmodule_i_Graph_adjmatrix_set_index_data_destroy(&data);
-  }
-
-  igraph_vs_destroy(&vs1);
-  igraph_vs_destroy(&vs2);
-
-  return ok ? 0 : -1;
-}
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/indexing.h igraph-0.6.5/interfaces/python/src/indexing.h
--- igraph-0.6.5~quantal1/interfaces/python/src/indexing.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/indexing.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library - Python interface.
-   Copyright (C) 2006-2011  Tamas Nepusz <ntamas@gmail.com>
-   5 Avenue Road, Staines, Middlesex, TW18 3AW, United Kingdom
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_INDEXING_H
-#define PYTHON_INDEXING_H
-
-#include <Python.h>
-#include <igraph_datatype.h>
-
-PyObject* igraphmodule_Graph_adjmatrix_get_index(igraph_t* graph,
-        PyObject* row_index, PyObject* column_index, PyObject* attr_name);
-int igraphmodule_Graph_adjmatrix_set_index(igraph_t* graph,
-        PyObject* row_index, PyObject* column_index, PyObject* attr_name,
-        PyObject* value);
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/platform.h igraph-0.6.5/interfaces/python/src/platform.h
--- igraph-0.6.5~quantal1/interfaces/python/src/platform.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/platform.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sw=2 sts=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_PLATFORM_H
-#define PYTHON_PLATFORM_H
-
-#ifdef _MSC_VER
-#  define INLINE __forceinline
-#else
-#  define INLINE inline
-#endif
-
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/py2compat.c igraph-0.6.5/interfaces/python/src/py2compat.c
--- igraph-0.6.5~quantal1/interfaces/python/src/py2compat.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/py2compat.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,108 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sw=2 sts=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "py2compat.h"
-
-#ifdef IGRAPH_PYTHON3
-
-/* Python 3.x functions */
-
-PyObject* PyFile_FromObject(PyObject* filename, const char* mode) {
-  PyObject *ioModule, *fileObj;
-
-  ioModule = PyImport_ImportModule("io");
-  if (ioModule == 0)
-    return 0;
-
-  fileObj = PyObject_CallMethod(ioModule, "open", "Os", filename, mode);
-  Py_DECREF(ioModule);
-
-  return fileObj;
-}
-
-char* PyString_CopyAsString(PyObject* string) {
-  PyObject* bytes;
-  char* result;
-
-  if (PyBytes_Check(string)) {
-    bytes = string;
-    Py_INCREF(bytes);
-  } else {
-    bytes = PyUnicode_AsUTF8String(string);
-  }
-
-  if (bytes == 0)
-    return 0;
-  
-  result = strdup(PyBytes_AS_STRING(bytes));
-  Py_DECREF(bytes);
-
-  if (result == 0)
-    PyErr_NoMemory();
-
-  return result;
-}
-
-int PyString_IsEqualToUTF8String(PyObject* py_string,
-		const char* c_string) {
-	PyObject* c_string_conv;
-	int result;
-
-	if (!PyUnicode_Check(py_string))
-		return 0;
-
-	c_string_conv = PyUnicode_FromString(c_string);
-	if (c_string_conv == 0)
-		return 0;
-
-	result = (PyUnicode_Compare(py_string, c_string_conv) == 0);
-	Py_DECREF(c_string_conv);
-
-	return result;
-}
-
-#else
-
-/* Python 2.x functions */
-
-char* PyString_CopyAsString(PyObject* string) {
-  char* result;
-
-  if (!PyBaseString_Check(string)) {
-    PyErr_SetString(PyExc_TypeError, "string or unicode object expected");
-    return 0;
-  }
-
-  result = PyString_AsString(string);
-  if (result == 0)
-    return 0;
-
-  result = strdup(result);
-  if (result == 0)
-    PyErr_NoMemory();
-
-  return result;
-}
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/py2compat.h igraph-0.6.5/interfaces/python/src/py2compat.h
--- igraph-0.6.5~quantal1/interfaces/python/src/py2compat.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/py2compat.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,83 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sw=2 sts=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PY_IGRAPH_PY2COMPAT_H
-#define PY_IGRAPH_PY2COMPAT_H
-
-#include <Python.h>
-
-#if PY_MAJOR_VERSION >= 3
-
-/* Python 3.x-specific part follows here */
-#define IGRAPH_PYTHON3
-
-#define PyBaseString_Check(o) PyUnicode_Check(o)
-
-PyObject* PyFile_FromObject(PyObject* filename, const char* mode);
-
-#define PyIntObject    PyLongObject
-#define PyInt_AsLong   PyLong_AsLong
-#define PyInt_Check    PyLong_Check
-#define PyInt_FromLong PyLong_FromLong
-
-#define PyNumber_Int   PyNumber_Long
-
-#define PyString_AS_STRING  PyUnicode_AS_UNICODE
-#define PyString_Check      PyUnicode_Check
-#define PyString_FromFormat PyUnicode_FromFormat
-#define PyString_FromString PyUnicode_FromString
-#define PyString_Type       PyUnicode_Type
-#define PyString_IsEqualToASCIIString(uni, string) \
-        (PyUnicode_CompareWithASCIIString(uni, string) == 0)
-
-#ifndef PyVarObject_HEAD_INIT
-#define PyVarObject_HEAD_INIT(type, size)            \
-        PyObject_HEAD_INIT(type) size,
-#endif
-
-int PyString_IsEqualToUTF8String(PyObject* py_string,
-    const char* c_string);
-
-#else
-
-/* Python 2.x-specific part follows here */
-
-#define PyBaseString_Check(o) (PyString_Check(o) || PyUnicode_Check(o))
-#define PyString_IsEqualToASCIIString(pystr, cstr) \
-        (PyString_Check(pystr) && strcmp(PyString_AS_STRING(pystr), (cstr)) == 0)
-
-#ifndef Py_TYPE
-#  define Py_TYPE(o) ((o)->ob_type)
-#endif
-
-#ifndef PyVarObject_HEAD_INIT
-#  define PyVarObject_HEAD_INIT(type, size) PyObject_HEAD_INIT(type) size,
-#endif
-
-#endif
-
-char* PyString_CopyAsString(PyObject* string);
-
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/pyhelpers.c igraph-0.6.5/interfaces/python/src/pyhelpers.c
--- igraph-0.6.5~quantal1/interfaces/python/src/pyhelpers.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/pyhelpers.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,91 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library - Python interface.
-   Copyright (C) 2006-2011  Tamas Nepusz <ntamas@gmail.com>
-   5 Avenue Road, Staines, Middlesex, TW18 3AW, United Kingdom
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "py2compat.h"
-#include "pyhelpers.h"
-
-/**
- * Creates a Python list and fills it with a pre-defined item.
- * 
- * \param  len   the length of the list to be created
- * \param  item  the item with which the list will be filled
- */
-PyObject* PyList_NewFill(Py_ssize_t len, PyObject* item) {
-	Py_ssize_t i;
-	PyObject* result = PyList_New(len);
-
-	if (result == 0)
-		return 0;
-
-	for (i = 0; i < len; i++) {
-		Py_INCREF(item);
-		PyList_SET_ITEM(result, i, item);  /* reference to item stolen */
-	}
-
-	return result;
-}
-
-/**
- * Creates a Python list and fills it with zeroes.
- * 
- * \param  len   the length of the list to be created
- */
-PyObject* PyList_Zeroes(Py_ssize_t len) {
-	PyObject* zero = PyInt_FromLong(0);
-	PyObject* result;
-
-	if (zero == 0)
-		return 0;
-
-	result = PyList_NewFill(len, zero);
-	Py_DECREF(zero);
-	return result;
-}
-
-/**
- * Converts a Python object to its string representation and returns it as
- * a C string.
- *
- * It is the responsibility of the caller to release the C string.
- */
-char* PyObject_ConvertToCString(PyObject* string) {
-  char* result;
-
-  if (string == 0)
-    return 0;
-
-  if (!PyBaseString_Check(string)) {
-    string = PyObject_Str(string);
-    if (string == 0)
-      return 0;
-  } else {
-    Py_INCREF(string);
-  }
-
-  result = PyString_CopyAsString(string);
-  Py_DECREF(string);
-
-  return result;
-}
-
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/pyhelpers.h igraph-0.6.5/interfaces/python/src/pyhelpers.h
--- igraph-0.6.5~quantal1/interfaces/python/src/pyhelpers.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/pyhelpers.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,39 +0,0 @@
-/* vim:set ts=4 sw=2 sts=2 et:  */
-/* 
-   IGraph library - Python interface.
-   Copyright (C) 2006-2011  Tamas Nepusz <ntamas@gmail.com>
-   5 Avenue Road, Staines, Middlesex, TW18 3AW, United Kingdom
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_HELPERS_H
-#define PYTHON_HELPERS_H
-
-#include <Python.h>
-
-PyObject* PyList_NewFill(Py_ssize_t len, PyObject* item);
-PyObject* PyList_Zeroes(Py_ssize_t len);
-
-char* PyObject_ConvertToCString(PyObject* string);
-
-#define PY_IGRAPH_DEPRECATED(msg) \
-  PyErr_WarnEx(PyExc_DeprecationWarning, (msg), 1)
-#define PY_IGRAPH_WARN(msg) \
-  PyErr_WarnEx(PyExc_RuntimeWarning, (msg), 1)
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/random.c igraph-0.6.5/interfaces/python/src/random.c
--- igraph-0.6.5~quantal1/interfaces/python/src/random.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/random.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,205 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim:set ts=2 sw=2 sts=2 et: */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "py2compat.h"
-#include "random.h"
-#include <limits.h>
-#include <igraph_random.h>
-
-/**
- * \ingroup python_interface_rng
- * \brief Internal data structure for storing references to the
- *        functions used from Python's random number generator.
- */
-typedef struct {
-  PyObject* randint_func;
-  PyObject* random_func;
-  PyObject* gauss_func;
-} igraph_i_rng_Python_state_t;
-
-static igraph_i_rng_Python_state_t igraph_rng_Python_state = {0, 0, 0};
-static igraph_rng_t igraph_rng_Python = {0, 0, 0};
-
-int igraph_rng_Python_init(void **state) {
-  IGRAPH_ERROR("Python RNG error, unsupported function called",
-      IGRAPH_EINTERNAL);
-  return 0;
-}
-
-void igraph_rng_Python_destroy(void *state) {
-  igraph_error("Python RNG error, unsupported function called",
-      __FILE__, __LINE__, IGRAPH_EINTERNAL);
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Sets the random number generator used by igraph.
- */
-PyObject* igraph_rng_Python_set_generator(PyObject* self, PyObject* object) {
-  igraph_i_rng_Python_state_t new_state, old_state;
-  PyObject* func;
-
-  if (object == Py_None) {
-    /* Reverting to the default igraph random number generator instead
-     * of the Python-based one */
-    igraph_rng_set_default(igraph_rng_default());
-    Py_RETURN_NONE;
-  }
-
-#define GET_FUNC(name) {\
-  func = PyObject_GetAttrString(object, name); \
-  if (func == 0) \
-    return NULL; \
-  if (!PyCallable_Check(func)) {\
-    PyErr_SetString(PyExc_TypeError, name "attribute must be callable"); \
-    return NULL; \
-  } \
-}
-
-  GET_FUNC("randint"); new_state.randint_func = func;
-  GET_FUNC("random"); new_state.random_func = func;
-  GET_FUNC("gauss"); new_state.gauss_func = func;
-
-  old_state = igraph_rng_Python_state;
-  igraph_rng_Python_state = new_state;
-  Py_XDECREF(old_state.randint_func);
-  Py_XDECREF(old_state.random_func);
-  Py_XDECREF(old_state.gauss_func);
-
-  igraph_rng_set_default(&igraph_rng_Python);
-
-  Py_RETURN_NONE;
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Sets the seed of the random generator.
- */
-int igraph_rng_Python_seed(void *state, unsigned long int seed) {
-  IGRAPH_ERROR("Python RNG error, unsupported function called",
-      IGRAPH_EINTERNAL);
-  return 0;
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Generates an unsigned long integer using the Python random number generator.
- */
-unsigned long int igraph_rng_Python_get(void *state) {
-  PyObject* result = PyObject_CallFunction(igraph_rng_Python_state.randint_func, "kk", 0, LONG_MAX);
-  unsigned long int retval;
-
-  if (result == 0) {
-    PyErr_WriteUnraisable(PyErr_Occurred());
-    PyErr_Clear();
-    /* Fallback to the C random generator */
-    return rand() * LONG_MAX;
-  }
-  retval = PyInt_AsLong(result);
-  Py_DECREF(result);
-  return retval;
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Generates a real number between 0 and 1 using the Python random number generator.
- */
-igraph_real_t igraph_rng_Python_get_real(void *state) {
-  PyObject* result = PyObject_CallFunction(igraph_rng_Python_state.random_func, NULL);
-  double retval;
-
-  if (result == 0) {
-    PyErr_WriteUnraisable(PyErr_Occurred());
-    PyErr_Clear();
-    /* Fallback to the C random generator */
-    return rand();
-  }
-
-  retval = PyFloat_AsDouble(result);
-  Py_DECREF(result);
-  return retval;
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Generates a real number distributed according to the normal distribution
- *        around zero with unit variance.
- */
-igraph_real_t igraph_rng_Python_get_norm(void *state) {
-  PyObject* result = PyObject_CallFunction(igraph_rng_Python_state.gauss_func, "dd", 0.0, 1.0);
-  double retval;
-
-  if (result == 0) {
-    PyErr_WriteUnraisable(PyErr_Occurred());
-    PyErr_Clear();
-    /* Fallback to the C random generator */
-    return 0;
-  }
-
-  retval = PyFloat_AsDouble(result);
-  Py_DECREF(result);
-  return retval;
-}
-
-/**
- * \ingroup python_interface_rng
- * \brief Specification table for Python's random number generator.
- *        This tells igraph which functions to call to obtain random numbers.
- */
-igraph_rng_type_t igraph_rngtype_Python = {
-  /* name= */      "Python random generator",
-  /* min=  */      0,
-  /* max=  */      LONG_MAX,
-  /* init= */      igraph_rng_Python_init,
-  /* destroy= */   igraph_rng_Python_destroy,
-  /* seed= */      igraph_rng_Python_seed,
-  /* get= */       igraph_rng_Python_get,
-  /* get_real */   igraph_rng_Python_get_real,
-  /* get_norm= */  igraph_rng_Python_get_norm,
-  /* get_geom= */  0,
-  /* get_binom= */ 0
-};
-
-void igraphmodule_init_rng(PyObject* igraph_module) {
-  PyObject* random_module;
-
-  if (igraph_rng_Python.state != 0)
-    return;
-
-  random_module = PyImport_ImportModule("random");
-  if (random_module == 0) {
-    PyErr_WriteUnraisable(PyErr_Occurred());
-    PyErr_Clear();
-    return;
-  }
-
-  igraph_rng_Python.type = &igraph_rngtype_Python;
-  igraph_rng_Python.state = &igraph_rng_Python_state;
-
-  if (igraph_rng_Python_set_generator(igraph_module, random_module) == 0) {
-    PyErr_WriteUnraisable(PyErr_Occurred());
-    PyErr_Clear();
-    return;
-  }
-  Py_DECREF(random_module);
-}
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/random.h igraph-0.6.5/interfaces/python/src/random.h
--- igraph-0.6.5~quantal1/interfaces/python/src/random.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/random.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_RANDOM_H
-#define PYTHON_RANDOM_H
-
-#include <Python.h>
-
-void igraphmodule_init_rng(PyObject*);
-PyObject* igraph_rng_Python_set_generator(PyObject* self, PyObject* object);
-
-#endif
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/vertexobject.c igraph-0.6.5/interfaces/python/src/vertexobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/vertexobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/vertexobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,639 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sw=2 sts=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include "attributes.h"
-#include "convert.h"
-#include "error.h"
-#include "graphobject.h"
-#include "py2compat.h"
-#include "vertexobject.h"
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_vertex Vertex object
- */
-
-PyTypeObject igraphmodule_VertexType;
-
-/**
- * \ingroup python_interface_vertex
- * \brief Allocates a new Python vertex object
- * \param gref the \c igraph.Graph being referenced by the vertex
- * \param idx the index of the vertex
- * 
- * \warning \c igraph references its vertices by indices, so if
- * you delete some vertices from the graph, the vertex indices will
- * change. Since the \c igraph.Vertex objects do not follow these
- * changes, your existing vertex objects will point to elsewhere
- * (or they might even get invalidated).
- */
-PyObject* igraphmodule_Vertex_New(igraphmodule_GraphObject *gref, igraph_integer_t idx) {
-  igraphmodule_VertexObject* self;
-  self=PyObject_New(igraphmodule_VertexObject, &igraphmodule_VertexType);
-  if (self) {
-    RC_ALLOC("Vertex", self);
-    Py_INCREF(gref);
-    self->gref=gref;
-    self->idx=idx;
-  }
-  return (PyObject*)self;
-}
-
-/**
- * \ingroup python_interface_vertex
- * \brief Clears the vertex's subobject (before deallocation)
- */
-int igraphmodule_Vertex_clear(igraphmodule_VertexObject *self) {
-  PyObject *tmp;
-
-  tmp=(PyObject*)self->gref;
-  self->gref=NULL;
-  Py_XDECREF(tmp);
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_vertex
- * \brief Deallocates a Python representation of a given vertex object
- */
-void igraphmodule_Vertex_dealloc(igraphmodule_VertexObject* self) {
-  igraphmodule_Vertex_clear(self);
-
-  RC_DEALLOC("Vertex", self);
-
-  PyObject_Del((PyObject*)self);
-}
-
-/** \ingroup python_interface_vertex
- * \brief Formats an \c igraph.Vertex object to a string
- * 
- * \return the formatted textual representation as a \c PyObject
- */
-PyObject* igraphmodule_Vertex_repr(igraphmodule_VertexObject *self) {
-  PyObject *s;
-  PyObject *attrs;
-#ifndef IGRAPH_PYTHON3
-  PyObject *grepr, *drepr;
-#endif
-
-  attrs = igraphmodule_Vertex_attributes(self);
-  if (attrs == 0)
-    return NULL;
-
-#ifdef IGRAPH_PYTHON3
-  s = PyUnicode_FromFormat("igraph.Vertex(%R, %ld, %R)",
-      (PyObject*)self->gref, (long int)self->idx, attrs);
-  Py_DECREF(attrs);
-#else
-  grepr=PyObject_Repr((PyObject*)self->gref);
-  drepr=PyObject_Repr(igraphmodule_Vertex_attributes(self));
-  Py_DECREF(attrs);
-  if (!grepr || !drepr) {
-    Py_XDECREF(grepr);
-    Py_XDECREF(drepr);
-    return NULL;
-  }
-  s=PyString_FromFormat("igraph.Vertex(%s,%ld,%s)", PyString_AsString(grepr),
-    (long int)self->idx, PyString_AsString(drepr));
-  Py_DECREF(grepr);
-  Py_DECREF(drepr);
-#endif
-  return s;
-}
-
-/** \ingroup python_interface_vertex
- * \brief Returns the number of vertex attributes
- */
-Py_ssize_t igraphmodule_Vertex_attribute_count(igraphmodule_VertexObject* self) {
-  igraphmodule_GraphObject *o = self->gref;
-  
-  if (!o) return 0;
-  if (!((PyObject**)o->g.attr)[1]) return 0;
-  return PyDict_Size(((PyObject**)o->g.attr)[1]);
-}
-
-/** \ingroup python_interface_vertex
- * \brief Returns the list of attribute names
- */
-PyObject* igraphmodule_Vertex_attribute_names(igraphmodule_VertexObject* self) {
-  if (!self->gref) return NULL;
-  return igraphmodule_Graph_vertex_attributes(self->gref);
-}
-
-/** \ingroup python_interface_vertex
- * \brief Returns a dict with attribue names and values
- */
-PyObject* igraphmodule_Vertex_attributes(igraphmodule_VertexObject* self) {
-  igraphmodule_GraphObject *o = self->gref;
-  PyObject *names, *dict;
-  long i, n;
-
-  dict=PyDict_New();
-  if (!dict) return NULL;
-
-  names=igraphmodule_Graph_vertex_attributes(o);
-  if (!names) { Py_DECREF(dict); return NULL; }
-
-  n=PyList_Size(names);
-  for (i=0; i<n; i++) {
-    PyObject *name = PyList_GetItem(names, i);
-    if (name) {
-      PyObject *dictit;
-      dictit = PyDict_GetItem(((PyObject**)o->g.attr)[ATTRHASH_IDX_VERTEX], name);
-      if (dictit) {
-        PyObject *value = PyList_GetItem(dictit, self->idx);
-        if (value) {
-          /* No need to Py_INCREF, PyDict_SetItem will do that */
-          PyDict_SetItem(dict, name, value);
-        }
-      }
-    }
-  }
-
-  return dict;
-}
-
-/**
- * \ingroup python_interface_vertex
- * \brief Updates some attributes of a vertex
- * 
- * Incidentally, this method is re-used intact in edgeobject.c for edges.
- *
- * \param self the vertex object
- * \param args positional arguments
- * \param kwds keyword arguments
- */
-PyObject* igraphmodule_Vertex_update_attributes(PyObject* self, PyObject* args,
-    PyObject* kwds) {
-  PyObject* items[] = { Py_None, kwds, 0 };
-  PyObject** pObj;
-  PyObject *key, *value, *it, *item, *keys;
-
-  igraph_bool_t ok = 1;
-
-  if (!PyArg_ParseTuple(args, "|O", &items[0]))
-    return NULL;
-
-  pObj = items;
-  for (pObj = items; ok && *pObj != 0; pObj++) {
-    PyObject* obj = *pObj;
-    PyObject* keys_func;
-
-    if (obj == Py_None)
-      continue;
-
-    keys_func = PyObject_GetAttrString(obj, "keys");
-    if (keys_func == 0)
-      PyErr_Clear();
-
-    if (keys_func != 0 && PyCallable_Check(keys_func)) {
-      /* Object has a "keys" method, so we iterate over the keys */
-      keys = PyObject_CallObject(keys_func, 0);
-      if (keys == 0) {
-        ok = 0;
-      } else {
-        /* Iterate over the keys */
-        it = PyObject_GetIter(keys);
-        if (it == 0) {
-          ok = 0;
-        } else {
-          while (ok && ((key = PyIter_Next(it)) != 0)) {
-            value = PyObject_GetItem(obj, key);
-            if (value == 0) {
-              ok = 0;
-            } else {
-              PyObject_SetItem((PyObject*)self, key, value);
-              Py_DECREF(value);
-            }
-            Py_DECREF(key);
-          }
-          Py_DECREF(it);
-          if (PyErr_Occurred())
-            ok = 0;
-        }
-        Py_DECREF(keys);
-      }
-    } else {
-      /* Object does not have a "keys" method; assume that it
-       * yields tuples when treated as an iterator */
-      it = PyObject_GetIter(obj);
-      if (!it) {
-        ok = 0;
-      } else {
-        while (ok && ((item = PyIter_Next(it)) != 0)) {
-          if (!PySequence_Check(item) || PyBaseString_Check(item)) {
-            PyErr_SetString(PyExc_TypeError, "cannot convert update sequence element to a sequence");
-            ok = 0;
-          } else {
-            key = PySequence_GetItem(item, 0);
-            if (key == 0) {
-              ok = 0;
-            } else {
-              value = PySequence_GetItem(item, 1);
-              if (value == 0) {
-                ok = 0;
-              } else {
-                PyObject_SetItem((PyObject*)self, key, value);
-                Py_DECREF(value);
-              }
-              Py_DECREF(key);
-            }
-          }
-          Py_DECREF(item);
-        }
-        Py_DECREF(it);
-        if (PyErr_Occurred())
-          ok = 0;
-      }
-    }
-
-    if (keys_func != 0) {
-      Py_DECREF(keys_func);
-    }
-  }
-
-  if (ok)
-    Py_RETURN_NONE;
-  return 0;
-}
-
-/** \ingroup python_interface_vertex
- * \brief Returns the corresponding value to a given attribute of the vertex
- * \param self the vertex object
- * \param s the attribute name to be queried
- */
-PyObject* igraphmodule_Vertex_get_attribute(igraphmodule_VertexObject* self,
-                       PyObject* s) {
-  igraphmodule_GraphObject *o = self->gref;
-  PyObject* result;
-  
-  result=PyDict_GetItem(((PyObject**)o->g.attr)[ATTRHASH_IDX_VERTEX], s);
-  if (result) {
-    /* result is a list, so get the element with index self->idx */
-    if (!PyList_Check(result)) {
-      PyErr_SetString(igraphmodule_InternalError, "Vertex attribute dict member is not a list");
-      return NULL;
-    }
-    result=PyList_GetItem(result, self->idx);
-    Py_INCREF(result);
-    return result;
-  }
-  
-  /* result is NULL, check whether there was an error */
-  if (!PyErr_Occurred())
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-  return NULL;
-}
-
-/** \ingroup python_interface_vertex
- * \brief Sets the corresponding value of a given attribute of the vertex
- * \param self the vertex object
- * \param k the attribute name to be set
- * \param v the value to be set
- * \return 0 if everything's ok, -1 in case of error
- */
-int igraphmodule_Vertex_set_attribute(igraphmodule_VertexObject* self, PyObject* k, PyObject* v) {
-  igraphmodule_GraphObject *o=self->gref;
-  PyObject* result;
-  int r;
-  
-  if (o==0) return -1;
-
-  if (PyString_IsEqualToASCIIString(k, "name"))
-    igraphmodule_invalidate_vertex_name_index(&o->g);
-
-  if (v==NULL)
-    // we are deleting attribute
-    return PyDict_DelItem(((PyObject**)o->g.attr)[ATTRHASH_IDX_VERTEX], k);
-  
-  result=PyDict_GetItem(((PyObject**)o->g.attr)[ATTRHASH_IDX_VERTEX], k);
-  if (result) {
-    /* result is a list, so set the element with index self->idx */
-    if (!PyList_Check(result)) {
-      PyErr_SetString(igraphmodule_InternalError, "Vertex attribute dict member is not a list");
-      return -1;
-    }
-    /* we actually don't own a reference here to v, so we must increase
-     * its reference count, because PyList_SetItem will "steal" a reference!
-     * It took me 1.5 hours between London and Manchester to figure it out */
-    Py_INCREF(v);
-    r=PyList_SetItem(result, self->idx, v);
-    if (r == -1) { Py_DECREF(v); }
-    return r;
-  }
-  
-  /* result is NULL, check whether there was an error */
-  if (!PyErr_Occurred()) {
-    /* no, there wasn't, so we must simply add the attribute */
-    int n=(int)igraph_vcount(&o->g), i;
-    result=PyList_New(n);
-    for (i=0; i<n; i++) {
-      if (i != self->idx) {
-    Py_INCREF(Py_None);
-    if (PyList_SetItem(result, i, Py_None) == -1) {
-      Py_DECREF(Py_None);
-      Py_DECREF(result);
-      return -1;
-    }
-      } else {
-    /* Same game with the reference count here */
-    Py_INCREF(v);
-    if (PyList_SetItem(result, i, v) == -1) {
-      Py_DECREF(v);
-      Py_DECREF(result);
-      return -1;
-    }
-      }
-    }
-    if (PyDict_SetItem(((PyObject**)o->g.attr)[1], k, result) == -1) {
-      Py_DECREF(result);
-      return -1;
-    }
-    Py_DECREF(result);   /* compensating for PyDict_SetItem */
-    return 0;
-  }
-  
-  return -1;
-}
-
-/**
- * \ingroup python_interface_vertex
- * Returns the vertex index
- */
-PyObject* igraphmodule_Vertex_get_index(igraphmodule_VertexObject* self, void* closure) {
-  return PyInt_FromLong((long int)self->idx);
-}
-
-/**
- * \ingroup python_interface_vertex
- * Returns the vertex index as an igraph_integer_t
- */
-igraph_integer_t igraphmodule_Vertex_get_index_igraph_integer(igraphmodule_VertexObject* self) {
-  return self->idx;
-}
-
-/**
- * \ingroup python_interface_vertex
- * Returns the vertex index as an ordinary C long
- */
-long igraphmodule_Vertex_get_index_long(igraphmodule_VertexObject* self) {
-  return (long)self->idx;
-}
-
-/**************************************************************************/
-/* Implementing proxy method in Vertex that just forward the call to the
- * appropriate Graph method.
- * 
- * These methods may also execute a postprocessing function on the result
- * of the Graph method; for instance, this mechanism is used to turn the
- * result of Graph.neighbors() (which is a list of vertex indices) into a
- * list of Vertex objects.
- */
-
-/* Dummy postprocessing function that does nothing. */
-static PyObject* _identity(igraphmodule_VertexObject* vertex, PyObject* obj) {
-  Py_INCREF(obj);
-  return obj;
-}
-
-/* Postprocessing function that converts a Python list of integers into a
- * list of vertices in-place. */
-static PyObject* _convert_to_vertex_list(igraphmodule_VertexObject* vertex, PyObject* obj) {
-  Py_ssize_t i, n;
-
-  if (!PyList_Check(obj)) {
-    PyErr_SetString(PyExc_TypeError, "_convert_to_vertex_list expected list of integers");
-    return NULL;
-  }
-
-  n = PyList_Size(obj);
-  for (i = 0; i < n; i++) {
-    PyObject* idx = PyList_GET_ITEM(obj, i);
-    PyObject* v;
-    int idx_int;
-
-    if (!PyInt_Check(idx)) {
-      PyErr_SetString(PyExc_TypeError, "_convert_to_vertex_list expected list of integers");
-      return NULL;
-    }
-
-    if (PyInt_AsInt(idx, &idx_int))
-      return NULL;
-
-    v = igraphmodule_Vertex_New(vertex->gref, idx_int);
-    PyList_SetItem(obj, i, v);   /* reference to v stolen, reference to idx discarded */
-  }
-
-  Py_INCREF(obj);
-  return obj;
-}
-
-#define GRAPH_PROXY_METHOD_PP(FUNC, METHODNAME, POSTPROCESS) \
-    PyObject* igraphmodule_Vertex_##FUNC(igraphmodule_VertexObject* self, PyObject* args, PyObject* kwds) { \
-      PyObject *new_args, *item, *result;                     \
-      long int i, num_args = args ? PyTuple_Size(args)+1 : 1; \
-                                                              \
-      /* Prepend ourselves to args */                         \
-      new_args = PyTuple_New(num_args);                       \
-      Py_INCREF(self); PyTuple_SET_ITEM(new_args, 0, (PyObject*)self);   \
-      for (i = 1; i < num_args; i++) {                        \
-        item = PyTuple_GET_ITEM(args, i-1);                   \
-        Py_INCREF(item); PyTuple_SET_ITEM(new_args, i, item); \
-      }                                                       \
-                                                              \
-      /* Get the method instance */                           \
-      item = PyObject_GetAttrString((PyObject*)(self->gref), METHODNAME);  \
-      result = PyObject_Call(item, new_args, kwds);           \
-      Py_DECREF(item);                                        \
-      Py_DECREF(new_args);                                    \
-                                                              \
-      /* Optional postprocessing */                           \
-      if (result) {                                           \
-        PyObject* pp_result = POSTPROCESS(self, result);      \
-        Py_DECREF(result);                                    \
-        return pp_result;                                     \
-      }                                                       \
-      return NULL;                                            \
-    }
-
-#define GRAPH_PROXY_METHOD(FUNC, METHODNAME) \
-        GRAPH_PROXY_METHOD_PP(FUNC, METHODNAME, _identity)
-
-GRAPH_PROXY_METHOD(betweenness, "betweenness");
-GRAPH_PROXY_METHOD(closeness, "closeness");
-GRAPH_PROXY_METHOD(constraint, "constraint");
-GRAPH_PROXY_METHOD(degree, "degree");
-GRAPH_PROXY_METHOD(delete, "delete_vertices");
-GRAPH_PROXY_METHOD(diversity, "diversity");
-GRAPH_PROXY_METHOD(eccentricity, "eccentricity");
-GRAPH_PROXY_METHOD(get_shortest_paths, "get_shortest_paths");
-GRAPH_PROXY_METHOD(indegree, "indegree");
-GRAPH_PROXY_METHOD(is_minimal_separator, "is_minimal_separator");
-GRAPH_PROXY_METHOD(is_separator, "is_separator");
-GRAPH_PROXY_METHOD_PP(neighbors, "neighbors", _convert_to_vertex_list);
-GRAPH_PROXY_METHOD(outdegree, "outdegree");
-GRAPH_PROXY_METHOD(pagerank, "pagerank");
-GRAPH_PROXY_METHOD_PP(predecessors, "predecessors", _convert_to_vertex_list);
-GRAPH_PROXY_METHOD(personalized_pagerank, "personalized_pagerank");
-GRAPH_PROXY_METHOD(shortest_paths, "shortest_paths");
-GRAPH_PROXY_METHOD(strength, "strength");
-GRAPH_PROXY_METHOD_PP(successors, "successors", _convert_to_vertex_list);
-
-#undef GRAPH_PROXY_METHOD
-
-#define GRAPH_PROXY_METHOD_SPEC(FUNC, METHODNAME) \
-  {METHODNAME, (PyCFunction)igraphmodule_Vertex_##FUNC, METH_VARARGS | METH_KEYWORDS, \
-    "Proxy method to L{Graph." METHODNAME "()}\n\n"              \
-    "This method calls the " METHODNAME " method of the L{Graph} class " \
-    "with this vertex as the first argument, and returns the result.\n\n"\
-    "@see: Graph." METHODNAME "() for details."}
-#define GRAPH_PROXY_METHOD_SPEC_2(FUNC, METHODNAME, METHODNAME_IN_GRAPH) \
-  {METHODNAME, (PyCFunction)igraphmodule_Vertex_##FUNC, METH_VARARGS | METH_KEYWORDS, \
-    "Proxy method to L{Graph." METHODNAME_IN_GRAPH "()}\n\n"              \
-    "This method calls the " METHODNAME_IN_GRAPH " method of the L{Graph} class " \
-    "with this vertex as the first argument, and returns the result.\n\n"\
-    "@see: Graph." METHODNAME_IN_GRAPH "() for details."}
-
-/**
- * \ingroup python_interface_vertex
- * Method table for the \c igraph.Vertex object
- */
-PyMethodDef igraphmodule_Vertex_methods[] = {
-  {"attributes", (PyCFunction)igraphmodule_Vertex_attributes,
-    METH_NOARGS,
-    "attributes() -> dict\n\n"
-    "Returns a dict of attribute names and values for the vertex\n"
-  },
-  {"attribute_names", (PyCFunction)igraphmodule_Vertex_attribute_names,
-    METH_NOARGS,
-    "attribute_names() -> list\n\n"
-    "Returns the list of vertex attribute names\n"
-  },
-  {"update_attributes", (PyCFunction)igraphmodule_Vertex_update_attributes,
-    METH_VARARGS | METH_KEYWORDS,
-    "update_attributes(E, **F) -> None\n\n"
-    "Updates the attributes of the vertex from dict/iterable E and F.\n\n"
-    "If E has a C{keys()} method, it does: C{for k in E: self[k] = E[k]}.\n"
-    "If E lacks a C{keys()} method, it does: C{for (k, v) in E: self[k] = v}.\n"
-    "In either case, this is followed by: C{for k in F: self[k] = F[k]}.\n\n"
-    "This method thus behaves similarly to the C{update()} method of Python\n"
-    "dictionaries."
-  },
-  GRAPH_PROXY_METHOD_SPEC(betweenness, "betweenness"),
-  GRAPH_PROXY_METHOD_SPEC(closeness, "closeness"),
-  GRAPH_PROXY_METHOD_SPEC(constraint, "constraint"),
-  GRAPH_PROXY_METHOD_SPEC(degree, "degree"),
-  GRAPH_PROXY_METHOD_SPEC_2(delete, "delete", "delete_vertices"),
-  GRAPH_PROXY_METHOD_SPEC(diversity, "diversity"),
-  GRAPH_PROXY_METHOD_SPEC(eccentricity, "eccentricity"),
-  GRAPH_PROXY_METHOD_SPEC(get_shortest_paths, "get_shortest_paths"),
-  GRAPH_PROXY_METHOD_SPEC(indegree, "indegree"),
-  GRAPH_PROXY_METHOD_SPEC(is_minimal_separator, "is_minimal_separator"),
-  GRAPH_PROXY_METHOD_SPEC(is_separator, "is_separator"),
-  GRAPH_PROXY_METHOD_SPEC(neighbors, "neighbors"),
-  GRAPH_PROXY_METHOD_SPEC(outdegree, "outdegree"),
-  GRAPH_PROXY_METHOD_SPEC(pagerank, "pagerank"),
-  GRAPH_PROXY_METHOD_SPEC(predecessors, "predecessors"),
-  GRAPH_PROXY_METHOD_SPEC(personalized_pagerank, "personalized_pagerank"),
-  GRAPH_PROXY_METHOD_SPEC(shortest_paths, "shortest_paths"),
-  GRAPH_PROXY_METHOD_SPEC(strength, "strength"),
-  GRAPH_PROXY_METHOD_SPEC(successors, "successors"),
-  {NULL}
-};
-
-#undef GRAPH_PROXY_METHOD_SPEC
-#undef GRAPH_PROXY_METHOD_SPEC_2
-
-/** \ingroup python_interface_vertex
- * This structure is the collection of functions necessary to implement
- * the vertex as a mapping (i.e. to allow the retrieval and setting of
- * igraph attributes in Python as if it were of a Python mapping type)
- */
-PyMappingMethods igraphmodule_Vertex_as_mapping = {
-  // returns the number of vertex attributes
-  (lenfunc)igraphmodule_Vertex_attribute_count,
-  // returns an attribute by name
-  (binaryfunc)igraphmodule_Vertex_get_attribute,
-  // sets an attribute by name
-  (objobjargproc)igraphmodule_Vertex_set_attribute
-};
-
-/**
- * \ingroup python_interface_vertex
- * Getter/setter table for the \c igraph.Vertex object
- */
-PyGetSetDef igraphmodule_Vertex_getseters[] = {
-  {"index", (getter)igraphmodule_Vertex_get_index, NULL,
-      "Index of the vertex", NULL
-  },
-  {NULL}
-};
-
-/** \ingroup python_interface_vertex
- * Python type object referencing the methods Python calls when it performs various operations on
- * a vertex of a graph
- */
-PyTypeObject igraphmodule_VertexType =
-{
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.Vertex",                            /* tp_name */
-  sizeof(igraphmodule_VertexObject),          /* tp_basicsize */
-  0,                                          /* tp_itemsize */
-  (destructor)igraphmodule_Vertex_dealloc,    /* tp_dealloc */
-  0,                                          /* tp_print */
-  0,                                          /* tp_getattr */
-  0,                                          /* tp_setattr */
-  0,                                          /* tp_compare (2.x) / tp_reserved (3.x) */
-  (reprfunc)igraphmodule_Vertex_repr,         /* tp_repr */
-  0,                                          /* tp_as_number */
-  0,                                          /* tp_as_sequence */
-  &igraphmodule_Vertex_as_mapping,            /* tp_as_mapping */
-  0,                                          /* tp_hash */
-  0,                                          /* tp_call */
-  0,                                          /* tp_str */
-  0,                                          /* tp_getattro */
-  0,                                          /* tp_setattro */
-  0,                                          /* tp_as_buffer */
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,   /* tp_flags */
-  "Class representing a single vertex in a graph.\n\n"
-  "The vertex is referenced by its index, so if the underlying graph\n"
-  "changes, the semantics of the vertex object might change as well\n"
-  "(if the vertex indices are altered in the original graph).\n\n"
-  "The attributes of the vertex can be accessed by using the vertex\n"
-  "as a hash:\n\n"
-  "  >>> v[\"color\"] = \"red\"                  #doctest: +SKIP\n"
-  "  >>> print v[\"color\"]                      #doctest: +SKIP\n"
-  "  red\n", /* tp_doc */
-  0,                                          /* tp_traverse */
-  0,                                          /* tp_clear */
-  0,                                          /* tp_richcompare */
-  0,                                          /* tp_weaklistoffset */
-  0,                                          /* tp_iter */
-  0,                                          /* tp_iternext */
-  igraphmodule_Vertex_methods,                /* tp_methods */
-  0,                                          /* tp_members */
-  igraphmodule_Vertex_getseters,              /* tp_getset */
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/vertexobject.h igraph-0.6.5/interfaces/python/src/vertexobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/vertexobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/vertexobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_VERTEXOBJECT_H
-#define PYTHON_VERTEXOBJECT_H
-
-#include <Python.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface_vertex
- * \brief A structure representing a vertex of a graph
- */
-typedef struct
-{
-  PyObject_HEAD
-  igraphmodule_GraphObject* gref;
-  igraph_integer_t idx;
-} igraphmodule_VertexObject;
-
-int igraphmodule_Vertex_clear(igraphmodule_VertexObject *self);
-void igraphmodule_Vertex_dealloc(igraphmodule_VertexObject* self);
-
-PyObject* igraphmodule_Vertex_New(igraphmodule_GraphObject *gref, igraph_integer_t idx);
-PyObject* igraphmodule_Vertex_repr(igraphmodule_VertexObject *self);
-PyObject* igraphmodule_Vertex_attributes(igraphmodule_VertexObject* self);
-PyObject* igraphmodule_Vertex_attribute_names(igraphmodule_VertexObject* self);
-igraph_integer_t igraphmodule_Vertex_get_index_igraph_integer(igraphmodule_VertexObject* self);
-long igraphmodule_Vertex_get_index_long(igraphmodule_VertexObject* self);
-PyObject* igraphmodule_Vertex_update_attributes(PyObject* self, PyObject* args,
-    PyObject* kwds);
-
-extern PyTypeObject igraphmodule_VertexType;
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/vertexseqobject.c igraph-0.6.5/interfaces/python/src/vertexseqobject.c
--- igraph-0.6.5~quantal1/interfaces/python/src/vertexseqobject.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/vertexseqobject.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,1018 +0,0 @@
-/* -*- mode: C -*-  */
-/* vim: set ts=2 sts=2 sw=2 et: */
-
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#include <Python.h>
-#include "attributes.h"
-#include "common.h"
-#include "convert.h"
-#include "error.h"
-#include "py2compat.h"
-#include "vertexseqobject.h"
-#include "vertexobject.h"
-
-#define GET_GRAPH(obj) (((igraphmodule_GraphObject*)obj->gref)->g)
-
-/**
- * \ingroup python_interface
- * \defgroup python_interface_vertexseq Vertex sequence object
- */
-
-PyTypeObject igraphmodule_VertexSeqType;
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Allocate a new vertex sequence object for a given graph
- * \return the allocated PyObject
- */
-PyObject* igraphmodule_VertexSeq_new(PyTypeObject *subtype,
-  PyObject *args, PyObject *kwds) {
-  igraphmodule_VertexSeqObject *o;
-
-  o=(igraphmodule_VertexSeqObject*)PyType_GenericNew(subtype, args, kwds);
-  if (o == NULL) return NULL;
-
-  igraph_vs_all(&o->vs);
-  o->gref=0;
-  o->weakreflist=0;
-
-  RC_ALLOC("VertexSeq", o);
-
-  return (PyObject*)o;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Copies a vertex sequence object
- * \return the copied PyObject
- */
-igraphmodule_VertexSeqObject*
-igraphmodule_VertexSeq_copy(igraphmodule_VertexSeqObject* o) {
-  igraphmodule_VertexSeqObject *copy;
-
-  copy=(igraphmodule_VertexSeqObject*)PyType_GenericNew(Py_TYPE(o), 0, 0);
-  if (copy == NULL) return NULL;
- 
-  if (igraph_vs_type(&o->vs) == IGRAPH_VS_VECTOR) {
-    igraph_vector_t v;
-    if (igraph_vector_copy(&v, o->vs.data.vecptr)) {
-      igraphmodule_handle_igraph_error();
-      return 0;
-    }
-    if (igraph_vs_vector_copy(&copy->vs, &v)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&v);
-      return 0;
-    }
-    igraph_vector_destroy(&v);
-  } else {
-    copy->vs = o->vs;
-  }
-
-  copy->gref = o->gref;
-  if (o->gref) Py_INCREF(o->gref);
-  RC_ALLOC("VertexSeq(copy)", copy);
-
-  return copy;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Initialize a new vertex sequence object for a given graph
- * \return the initialized PyObject
- */
-int igraphmodule_VertexSeq_init(igraphmodule_VertexSeqObject *self,
-  PyObject *args, PyObject *kwds) {
-  static char *kwlist[] = { "graph", "vertices", NULL };
-  PyObject *g, *vsobj=Py_None;
-  igraph_vs_t vs;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|O", kwlist,
-    &igraphmodule_GraphType, &g, &vsobj))
-      return -1;
-
-  if (vsobj == Py_None) {
-    /* If vs is None, we are selecting all the vertices */
-    igraph_vs_all(&vs);
-  } else if (PyInt_Check(vsobj)) {
-    /* We selected a single vertex */
-    long int idx = PyInt_AsLong(vsobj);
-    if (idx < 0 || idx >= igraph_vcount(&((igraphmodule_GraphObject*)g)->g)) {
-      PyErr_SetString(PyExc_ValueError, "vertex index out of range");
-      return -1;
-    }
-    igraph_vs_1(&vs, (igraph_integer_t)idx);
-  } else {
-    igraph_vector_t v;
-    igraph_integer_t n = igraph_vcount(&((igraphmodule_GraphObject*)g)->g);
-    if (igraphmodule_PyObject_to_vector_t(vsobj, &v, 1, 0))
-      return -1;
-    if (!igraph_vector_isininterval(&v, 0, n-1)) {
-      igraph_vector_destroy(&v);
-      PyErr_SetString(PyExc_ValueError, "vertex index out of range");
-      return -1;
-    }
-    if (igraph_vs_vector_copy(&vs, &v)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&v);
-      return -1;
-    }
-    igraph_vector_destroy(&v);
-  }
-
-  self->vs = vs;
-  Py_INCREF(g);
-  self->gref = (igraphmodule_GraphObject*)g;
-
-  return 0;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Deallocates a Python representation of a given vertex sequence object
- */
-void igraphmodule_VertexSeq_dealloc(igraphmodule_VertexSeqObject* self) {
-  if (self->weakreflist != NULL)
-    PyObject_ClearWeakRefs((PyObject *) self);
-  if (self->gref) {
-    igraph_vs_destroy(&self->vs);
-    Py_DECREF(self->gref);
-    self->gref=0;
-  }
-  Py_TYPE(self)->tp_free((PyObject*)self);
-  RC_DEALLOC("VertexSeq", self);
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Returns the length of the sequence
- */
-int igraphmodule_VertexSeq_sq_length(igraphmodule_VertexSeqObject* self) {
-  igraph_t *g;
-  igraph_integer_t result;
-  if (!self->gref) return -1;
-  g=&GET_GRAPH(self);
-  if (igraph_vs_size(g, &self->vs, &result)) {
-    igraphmodule_handle_igraph_error();
-    return -1;
-  }
-  return (int)result;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Returns the item at the given index in the sequence
- */
-PyObject* igraphmodule_VertexSeq_sq_item(igraphmodule_VertexSeqObject* self,
-                     Py_ssize_t i) {
-  igraph_t *g;
-  igraph_integer_t idx = -1;
-
-  if (!self->gref) return NULL;
-  g=&GET_GRAPH(self);
-  switch (igraph_vs_type(&self->vs)) {
-    case IGRAPH_VS_ALL:
-      if (i >= 0 && i < igraph_vcount(g))
-        idx = (igraph_integer_t)i;
-      break;
-    case IGRAPH_VS_VECTOR:
-    case IGRAPH_VS_VECTORPTR:
-      if (i >= 0 && i < igraph_vector_size(self->vs.data.vecptr))
-        idx = (igraph_integer_t)VECTOR(*self->vs.data.vecptr)[i];
-      break;
-    case IGRAPH_VS_1:
-      if (i == 0)
-        idx = self->vs.data.vid;
-      break;
-    case IGRAPH_VS_SEQ:
-      if (i >= 0 && i < self->vs.data.seq.to - self->vs.data.seq.from)
-        idx = self->vs.data.seq.from + (igraph_integer_t)i;
-      break;
-    /* TODO: IGRAPH_VS_ADJ, IGRAPH_VS_NONADJ - someday :) They are unused
-       yet in the Python interface */
-  }
-
-  if (idx < 0) {
-    PyErr_SetString(PyExc_IndexError, "vertex index out of range");
-    return NULL;
-  }
-
-  return igraphmodule_Vertex_New(self->gref, idx);
-}
-
-/** \ingroup python_interface_vertexseq
- * \brief Returns the list of attribute names
- */
-PyObject* igraphmodule_VertexSeq_attribute_names(igraphmodule_VertexSeqObject* self) {
-  return igraphmodule_Graph_vertex_attributes(self->gref);
-}
-
-/** \ingroup python_interface_vertexseq
- * \brief Returns the list of values for a given attribute
- */
-PyObject* igraphmodule_VertexSeq_get_attribute_values(igraphmodule_VertexSeqObject* self, PyObject* o) {
-  igraphmodule_GraphObject *gr = self->gref;
-  PyObject *result=0, *values, *item;
-  long int i, n;
-
-  PyErr_Clear();
-  values=PyDict_GetItem(ATTR_STRUCT_DICT(&gr->g)[ATTRHASH_IDX_VERTEX], o);
-  if (!values) {
-    PyErr_SetString(PyExc_KeyError, "Attribute does not exist");
-    return NULL;
-  } else if (PyErr_Occurred()) return NULL;
-  
-  switch (igraph_vs_type(&self->vs)) {
-    case IGRAPH_VS_NONE:
-      n = 0;
-      result = PyList_New(0);
-      break;
-
-    case IGRAPH_VS_ALL:
-      n = PyList_Size(values);
-      result = PyList_New(n);
-      if (!result) return 0;
-      
-      for (i=0; i<n; i++) {
-        item = PyList_GET_ITEM(values, i);
-        Py_INCREF(item);
-        PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    case IGRAPH_VS_VECTOR:
-    case IGRAPH_VS_VECTORPTR:
-      n = igraph_vector_size(self->vs.data.vecptr);
-      result = PyList_New(n);
-      if (!result) return 0;
-
-      for (i=0; i<n; i++) {
-        item = PyList_GET_ITEM(values, (long)VECTOR(*self->vs.data.vecptr)[i]);
-        Py_INCREF(item);
-        PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    case IGRAPH_VS_SEQ:
-      n = self->vs.data.seq.to - self->vs.data.seq.from;
-      result = PyList_New(n);
-      if (!result) return 0;
-
-      for (i=0; i<n; i++) {
-        item = PyList_GET_ITEM(values, (long)self->vs.data.seq.from+i);
-        Py_INCREF(item);
-        PyList_SET_ITEM(result, i, item);
-      }
-      break;
-
-    default:
-      PyErr_SetString(PyExc_RuntimeError, "invalid vertex selector");
-  }
-
-  return result;
-}
-
-PyObject* igraphmodule_VertexSeq_get_attribute_values_mapping(igraphmodule_VertexSeqObject *self, PyObject *o) {
-  /* Handle integer indices according to the sequence protocol */
-  if (PyInt_Check(o))
-    return igraphmodule_VertexSeq_sq_item(self, PyInt_AsLong(o));
-
-  /* Handle strings according to the mapping protocol */
-  if (PyBaseString_Check(o))
-    return igraphmodule_VertexSeq_get_attribute_values(self, o);
-
-  /* Handle iterables and slices by calling the select() method */
-  if (PySlice_Check(o) || PyObject_HasAttrString(o, "__iter__")) {
-    PyObject *result, *args;
-    args = Py_BuildValue("(O)", o);
-    if (!args)
-      return NULL;
-    result = igraphmodule_VertexSeq_select(self, args);
-    Py_DECREF(args);
-    return result;
-  }
-  
-  /* Handle everything else according to the mapping protocol */
-  return igraphmodule_VertexSeq_get_attribute_values(self, o);
-}
-
-/** \ingroup python_interface_vertexseq
- * \brief Sets the list of values for a given attribute
- */
-int igraphmodule_VertexSeq_set_attribute_values_mapping(igraphmodule_VertexSeqObject* self, PyObject* attrname, PyObject* values) {
-  PyObject *dict, *list, *item;
-  igraphmodule_GraphObject *gr;
-  igraph_vector_t vs;
-  long i, j, n, no_of_nodes;
-
-  gr = self->gref;
-  dict = ATTR_STRUCT_DICT(&gr->g)[ATTRHASH_IDX_VERTEX];
-
-  if (PyString_IsEqualToASCIIString(attrname, "name"))
-    igraphmodule_invalidate_vertex_name_index(&gr->g);
-
-  if (values == 0) {
-    if (igraph_vs_type(&self->vs) == IGRAPH_VS_ALL)
-      return PyDict_DelItem(dict, attrname);
-    PyErr_SetString(PyExc_TypeError, "can't delete attribute from a vertex sequence not representing the whole graph");
-    return -1;
-  }
-
- if (PyString_Check(values) || !PySequence_Check(values)) {
-    /* If values is a string or not a sequence, we construct a list with a
-     * single element (the value itself) and then call ourselves again */
-    int result;
-    PyObject *newList = PyList_New(1);
-    if (newList == 0) return -1;
-    Py_INCREF(values);
-    PyList_SET_ITEM(newList, 0, values);    /* reference stolen here */
-    result = igraphmodule_VertexSeq_set_attribute_values_mapping(self, attrname, newList);
-    Py_DECREF(newList);
-    return result;
-  }
-
-  n=PySequence_Size(values);
-  if (n<0) return -1;
-
-  if (igraph_vs_type(&self->vs) == IGRAPH_VS_ALL) {
-    no_of_nodes = (long)igraph_vcount(&gr->g);
-    if (n == 0 && no_of_nodes > 0) {
-      PyErr_SetString(PyExc_ValueError, "sequence must not be empty");
-      return -1;
-    }
-
-    /* Check if we already have attributes with the given name */
-    list = PyDict_GetItem(dict, attrname);
-    if (list != 0) {
-      /* Yes, we have. Modify its items to the items found in values */
-      for (i=0, j=0; i<no_of_nodes; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) return -1;
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        if (PyList_SetItem(list, i, item)) {
-          Py_DECREF(item);
-          return -1;
-        } /* PyList_SetItem stole a reference to the item automatically */
-      }
-    } else if (values != 0) {
-      /* We don't have attributes with the given name yet. Create an entry
-       * in the dict, create a new list and copy everything */
-      list = PyList_New(no_of_nodes);
-      if (list == 0) return -1;
-      for (i=0, j=0; i<no_of_nodes; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) { Py_DECREF(list); return -1; }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        PyList_SET_ITEM(list, i, item);
-        /* PyList_SET_ITEM stole a reference to the item automatically */
-      }
-      if (PyDict_SetItem(dict, attrname, list)) {
-        Py_DECREF(list);
-        return -1;
-      }
-      Py_DECREF(list);    /* PyDict_SetItem increased the refcount */
-    }
-  } else {
-    /* We are working with a subset of the graph. Convert the sequence to a
-     * vector and loop through it */
-    if (igraph_vector_init(&vs, 0)) {
-      igraphmodule_handle_igraph_error();
-      return -1;
-    } 
-    if (igraph_vs_as_vector(&gr->g, self->vs, &vs)) {
-      igraphmodule_handle_igraph_error();
-      igraph_vector_destroy(&vs);
-      return -1;
-    }
-    no_of_nodes = (long)igraph_vector_size(&vs);
-    if (n == 0 && no_of_nodes > 0) {
-      PyErr_SetString(PyExc_ValueError, "sequence must not be empty");
-      igraph_vector_destroy(&vs);
-      return -1;
-    }
-    /* Check if we already have attributes with the given name */
-    list = PyDict_GetItem(dict, attrname);
-    if (list != 0) {
-      /* Yes, we have. Modify its items to the items found in values */
-      for (i=0, j=0; i<no_of_nodes; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) {
-          igraph_vector_destroy(&vs);
-          return -1;
-        }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        if (PyList_SetItem(list, (long)VECTOR(vs)[i], item)) {
-          Py_DECREF(item);
-          igraph_vector_destroy(&vs);
-          return -1;
-        } /* PyList_SetItem stole a reference to the item automatically */ 
-      }
-      igraph_vector_destroy(&vs);
-    } else if (values != 0) {
-      /* We don't have attributes with the given name yet. Create an entry
-       * in the dict, create a new list, fill with None for vertices not in the
-       * sequence and copy the rest */
-      long n2 = igraph_vcount(&gr->g);
-      list = PyList_New(n2);
-      if (list == 0) {
-        igraph_vector_destroy(&vs);
-        return -1;
-      }
-      for (i=0; i<n2; i++) {
-        Py_INCREF(Py_None);
-        PyList_SET_ITEM(list, i, Py_None);
-      }
-      for (i=0, j=0; i<no_of_nodes; i++, j++) {
-        if (j == n) j = 0;
-        item = PySequence_GetItem(values, j);
-        if (item == 0) {
-          igraph_vector_destroy(&vs);
-          Py_DECREF(list); return -1;
-        }
-        /* No need to Py_INCREF(item), PySequence_GetItem returns a new reference */
-        PyList_SET_ITEM(list, (long)VECTOR(vs)[i], item);
-        /* PyList_SET_ITEM stole a reference to the item automatically */
-      }
-      igraph_vector_destroy(&vs);
-      if (PyDict_SetItem(dict, attrname, list)) {
-        Py_DECREF(list);
-        return -1;
-      }
-      Py_DECREF(list);    /* PyDict_SetItem increased the refcount */
-    }
-  }
-
-  return 0;
-}
-
-PyObject* igraphmodule_VertexSeq_set_attribute_values(igraphmodule_VertexSeqObject *self, PyObject *args, PyObject *kwds) {
-  static char* kwlist[] = { "attrname", "values", NULL };
-  PyObject *attrname, *values;
-
-  if (!PyArg_ParseTupleAndKeywords(args, kwds, "OO", kwlist,
-           &attrname, &values))
-  return NULL;
-
-  if (igraphmodule_VertexSeq_set_attribute_values_mapping(self, attrname, values))
-  return NULL;
-
-  Py_RETURN_NONE;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Selects a single vertex from the vertex sequence based on some criteria
- */
-PyObject* igraphmodule_VertexSeq_find(igraphmodule_VertexSeqObject *self, PyObject *args) {
-  PyObject *item;
-  igraph_integer_t i;
-  Py_ssize_t n;
-  igraph_vit_t vit;
-
-  if (!PyArg_ParseTuple(args, "O", &item))
-    return NULL;
-
-  if (PyCallable_Check(item)) {
-    /* Call the callable for every vertex in the current sequence and return
-     * the first one for which it evaluates to True */
-    n = PySequence_Size((PyObject*)self);
-    for (i=0; i<n; i++) {
-      PyObject *vertex = PySequence_GetItem((PyObject*)self, i);
-      PyObject *call_result;
-      if (vertex == 0)
-        return NULL;
-      call_result = PyObject_CallFunctionObjArgs(item, vertex, NULL);
-      if (call_result == 0) {
-        Py_DECREF(vertex);
-        return NULL;
-      }
-      if (PyObject_IsTrue(call_result)) {
-        Py_DECREF(call_result);
-        return vertex;  /* reference passed to caller */
-      }
-      Py_DECREF(call_result);
-      Py_DECREF(vertex);
-    }
-  } else if (PyInt_Check(item)) {
-    /* Integers are interpreted as indices on the vertex set and NOT on the
-     * original, untouched vertex sequence of the graph */
-    return PySequence_GetItem((PyObject*)self, PyInt_AsLong(item));
-  } else if (PyBaseString_Check(item)) {
-    /* Strings are interpreted as vertex names */
-    if (igraphmodule_get_vertex_id_by_name(&self->gref->g, item, &i))
-      return NULL;
-
-    /* We now have the ID of the vertex in the graph. If the vertex sequence
-     * itself represents the full vertex sequence of the graph, we can return
-     * here. If not, we have to check whether the vertex sequence contains this
-     * ID or not. */
-    if (igraph_vs_is_all(&self->vs))
-      return PySequence_GetItem((PyObject*)self, i);
-
-    if (igraph_vit_create(&self->gref->g, self->vs, &vit)) {
-      igraphmodule_handle_igraph_error();
-      return NULL;
-    }
-
-    for (n = 0; !IGRAPH_VIT_END(vit); IGRAPH_VIT_NEXT(vit), n++) {
-      if (IGRAPH_VIT_GET(vit) == i) {
-        igraph_vit_destroy(&vit);
-        return PySequence_GetItem((PyObject*)self, n);
-      }
-    }
-
-    igraph_vit_destroy(&vit);
-    PyErr_SetString(PyExc_ValueError, "vertex with the given name exists but not in the current sequence");
-    return NULL;
-  }
-
-  PyErr_SetString(PyExc_IndexError, "no such vertex");
-  return NULL;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief Selects a subset of the vertex sequence based on some criteria
- */
-PyObject* igraphmodule_VertexSeq_select(igraphmodule_VertexSeqObject *self,
-  PyObject *args) {
-  igraphmodule_VertexSeqObject *result;
-  igraphmodule_GraphObject *gr;
-  long i, j, n, m;
-
-  gr=self->gref;
-  result=igraphmodule_VertexSeq_copy(self);
-  if (result==0)
-    return NULL;
-
-  /* First, filter by positional arguments */
-  n = PyTuple_Size(args);
-
-  for (i=0; i<n; i++) {
-    PyObject *item = PyTuple_GET_ITEM(args, i);
-
-    if (item == Py_None) {
-      /* None means: select nothing */
-      igraph_vs_destroy(&result->vs);
-      igraph_vs_none(&result->vs);
-      /* We can simply bail out here */
-      return (PyObject*)result;
-    } else if (PyCallable_Check(item)) {
-      /* Call the callable for every vertex in the current sequence to
-       * determine what's up */
-      igraph_bool_t was_excluded = 0;
-      igraph_vector_t v;
-
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-
-      m = PySequence_Size((PyObject*)result);
-      for (j=0; j<m; j++) {
-        PyObject *vertex = PySequence_GetItem((PyObject*)result, j);
-        PyObject *call_result;
-        if (vertex == 0) {
-          Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          return NULL;
-        }
-        call_result = PyObject_CallFunctionObjArgs(item, vertex, NULL);
-        if (call_result == 0) {
-          Py_DECREF(vertex); Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          return NULL;
-        }
-        if (PyObject_IsTrue(call_result))
-          igraph_vector_push_back(&v,
-            igraphmodule_Vertex_get_index_long((igraphmodule_VertexObject*)vertex));
-        else was_excluded=1;
-        Py_DECREF(call_result);
-        Py_DECREF(vertex);
-      }
-
-      if (was_excluded) {
-        igraph_vs_destroy(&result->vs);
-        if (igraph_vs_vector_copy(&result->vs, &v)) {
-          Py_DECREF(result);
-          igraph_vector_destroy(&v);
-          igraphmodule_handle_igraph_error();
-          return NULL;
-        }
-      }
-
-      igraph_vector_destroy(&v);
-    } else if (PyInt_Check(item)) {
-      /* Integers are treated specially: from now on, all remaining items
-       * in the argument list must be integers and they will be used together
-       * to restrict the vertex set. Integers are interpreted as indices on the
-       * vertex set and NOT on the original, untouched vertex sequence of the
-       * graph */
-      igraph_vector_t v, v2;
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_vector_init(&v2, 0)) {
-        igraph_vector_destroy(&v);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_vs_as_vector(&gr->g, self->vs, &v2)) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      m = igraph_vector_size(&v2);
-      for (; i<n; i++) {
-        PyObject *item2 = PyTuple_GET_ITEM(args, i);
-        long idx;
-        if (!PyInt_Check(item2)) {
-          Py_DECREF(result);
-          PyErr_SetString(PyExc_TypeError, "vertex indices expected");
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-        idx = PyInt_AsLong(item2);
-        if (idx >= m || idx < 0) {
-          PyErr_SetString(PyExc_ValueError, "vertex index out of range");
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-        if (igraph_vector_push_back(&v, VECTOR(v2)[idx])) {
-          Py_DECREF(result);
-          igraphmodule_handle_igraph_error();
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          return NULL;
-        }
-      }
-      igraph_vector_destroy(&v2);
-      igraph_vs_destroy(&result->vs);
-      if (igraph_vs_vector_copy(&result->vs, &v)) {
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        igraph_vector_destroy(&v);
-        return NULL;
-      }
-      igraph_vector_destroy(&v);
-    } else {
-      /* Iterators, slices and everything that was not handled directly */
-      PyObject *iter=0, *item2;
-      igraph_vector_t v, v2;
-
-      /* Allocate stuff */
-      if (igraph_vector_init(&v, 0)) {
-        igraphmodule_handle_igraph_error();
-        Py_DECREF(result);
-        return 0;
-      }
-      if (igraph_vector_init(&v2, 0)) {
-        igraph_vector_destroy(&v);
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      if (igraph_vs_as_vector(&gr->g, self->vs, &v2)) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        return 0;
-      }
-      m = igraph_vector_size(&v2);
-
-      /* Create an appropriate iterator */
-      if (PySlice_Check(item)) {
-        /* Create an iterator from the slice (which is not iterable by default) */
-        Py_ssize_t start, stop, step, sl;
-        PyObject* range;
-        igraph_bool_t ok;
-
-        /* Casting to void* because Python 2.x expects PySliceObject*
-         * but Python 3.x expects PyObject* */
-        ok = (PySlice_GetIndicesEx((void*)item, igraph_vector_size(&v2),
-              &start, &stop, &step, &sl) == 0);
-        if (ok) {
-          range = PyObject_CallFunction((PyObject*)&PyRange_Type, "lll", start, stop, step);
-          ok = (range != 0);
-        }
-        if (ok) {
-          iter = PyObject_GetIter(range);
-          Py_DECREF(range);
-          ok = (iter != 0);
-        }
-        if (!ok) {
-          igraph_vector_destroy(&v);
-          igraph_vector_destroy(&v2);
-          PyErr_SetString(PyExc_TypeError, "error while converting slice to iterator");
-          Py_DECREF(result);
-          return 0;
-        }
-      } else {
-        /* Simply create the iterator corresponding to the object */
-        iter = PyObject_GetIter(item);
-      }
-
-      /* Did we manage to get an iterator? */
-      if (iter == 0) {
-        igraph_vector_destroy(&v);
-        igraph_vector_destroy(&v2);
-        PyErr_SetString(PyExc_TypeError, "invalid vertex filter among positional arguments");
-        Py_DECREF(result);
-        return 0;
-      }
-      /* Do the iteration */
-      while ((item2=PyIter_Next(iter)) != 0) {
-        if (PyInt_Check(item2)) {
-          long idx = PyInt_AsLong(item2);
-          Py_DECREF(item2);
-          if (idx >= m || idx < 0) {
-            PyErr_SetString(PyExc_ValueError, "vertex index out of range");
-            Py_DECREF(result);
-            Py_DECREF(iter);
-            igraph_vector_destroy(&v);
-            igraph_vector_destroy(&v2);
-            return NULL;
-          }
-          if (igraph_vector_push_back(&v, VECTOR(v2)[idx])) {
-            Py_DECREF(result);
-            Py_DECREF(iter);
-            igraphmodule_handle_igraph_error();
-            igraph_vector_destroy(&v);
-            igraph_vector_destroy(&v2);
-            return NULL;
-          }
-        } else {
-          /* We simply ignore elements that we don't know */
-          Py_DECREF(item2);
-        }
-      }
-      /* Deallocate stuff */
-      igraph_vector_destroy(&v2);
-      Py_DECREF(iter);
-      if (PyErr_Occurred()) {
-        igraph_vector_destroy(&v);
-        Py_DECREF(result);
-        return 0;
-      }
-      igraph_vs_destroy(&result->vs);
-      if (igraph_vs_vector_copy(&result->vs, &v)) {
-        Py_DECREF(result);
-        igraphmodule_handle_igraph_error();
-        igraph_vector_destroy(&v);
-        return NULL;
-      }
-      igraph_vector_destroy(&v);
-    }
-  }
-
-  return (PyObject*)result;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Converts a vertex sequence to an igraph vector containing the corresponding
- * vertex indices. The vector MUST be initialized and will be resized if needed.
- * \return 0 if everything was ok, 1 otherwise
- */
-int igraphmodule_VertexSeq_to_vector_t(igraphmodule_VertexSeqObject *self,
-  igraph_vector_t *v) {
-  return igraph_vs_as_vector(&self->gref->g, self->vs, v);
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Returns the graph where the vertex sequence belongs
- */
-PyObject* igraphmodule_VertexSeq_get_graph(igraphmodule_VertexSeqObject* self,
-  void* closure) {
-  Py_INCREF(self->gref);
-  return (PyObject*)self->gref;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Returns the indices of the vertices in this vertex sequence 
- */
-PyObject* igraphmodule_VertexSeq_get_indices(igraphmodule_VertexSeqObject* self,
-  void* closure) {
-  igraphmodule_GraphObject *gr = self->gref;
-  igraph_vector_t vs;
-  PyObject *result;
-
-  if (igraph_vector_init(&vs, 0)) {
-    igraphmodule_handle_igraph_error();
-    return 0;
-  } 
-  if (igraph_vs_as_vector(&gr->g, self->vs, &vs)) {
-    igraphmodule_handle_igraph_error();
-    igraph_vector_destroy(&vs);
-    return 0;
-  }
-
-  result = igraphmodule_vector_t_to_PyList(&vs, IGRAPHMODULE_TYPE_INT);
-  igraph_vector_destroy(&vs);
-
-  return result;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Returns the internal dictionary mapping vertex names to vertex IDs.
- */
-PyObject* igraphmodule_VertexSeq__name_index(igraphmodule_VertexSeqObject* self,
-  void* closure) {
-  igraphmodule_GraphObject *gr = self->gref;
-  PyObject* result = ATTR_NAME_INDEX(&gr->g);
-  if (result == 0)
-    Py_RETURN_NONE;
-  Py_INCREF(result);
-  return result;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Re-creates the dictionary that maps vertex names to vertex IDs.
- */
-PyObject* igraphmodule_VertexSeq__reindex_names(igraphmodule_VertexSeqObject* self) {
-  igraphmodule_index_vertex_names(&self->gref->g, 1);
-  Py_RETURN_NONE;
-}
-
-/**
- * \ingroup python_interface_vertexseq
- * Method table for the \c igraph.VertexSeq object
- */
-PyMethodDef igraphmodule_VertexSeq_methods[] = {
-  {"attribute_names", (PyCFunction)igraphmodule_VertexSeq_attribute_names,
-   METH_NOARGS,
-   "attribute_names() -> list\n\n"
-   "Returns the attribute name list of the graph's vertices\n"
-  },
-  {"find", (PyCFunction)igraphmodule_VertexSeq_find,
-   METH_VARARGS,
-   "find(condition) -> Vertex\n\n"
-   "For internal use only.\n"
-  },
-  {"get_attribute_values", (PyCFunction)igraphmodule_VertexSeq_get_attribute_values,
-   METH_O,
-   "get_attribute_values(attrname) -> list\n"
-   "Returns the value of a given vertex attribute for all vertices in a list.\n\n"
-   "The values stored in the list are exactly the same objects that are stored\n"
-   "in the vertex attribute, meaning that in the case of mutable objects,\n"
-   "the modification of the list element does affect the attribute stored in\n"
-   "the vertex. In the case of immutable objects, modification of the list\n"
-   "does not affect the attribute values.\n\n"
-   "@param attrname: the name of the attribute\n"
-  },
-  {"set_attribute_values", (PyCFunction)igraphmodule_VertexSeq_set_attribute_values,
-   METH_VARARGS | METH_KEYWORDS,
-   "set_attribute_values(attrname, values) -> list\n"
-   "Sets the value of a given vertex attribute for all vertices\n\n"
-   "@param attrname: the name of the attribute\n"
-   "@param values: the new attribute values in a list\n"
-  },
-  {"select", (PyCFunction)igraphmodule_VertexSeq_select,
-   METH_VARARGS,
-   "select(...) -> VertexSeq\n\n"
-   "For internal use only.\n"
-  },
-  {"_reindex_names", (PyCFunction)igraphmodule_VertexSeq__reindex_names, METH_NOARGS,
-   "Re-creates the dictionary that maps vertex names to IDs.\n\n"
-   "For internal use only.\n"
-  },
-  {NULL}
-};
-
-/**
- * \ingroup python_interface_vertexseq
- * This is the collection of functions necessary to implement the
- * vertex sequence as a real sequence (e.g. allowing to reference
- * vertices by indices)
- */
-static PySequenceMethods igraphmodule_VertexSeq_as_sequence = {
-  (lenfunc)igraphmodule_VertexSeq_sq_length,
-  0,               /* sq_concat */
-  0,               /* sq_repeat */
-  (ssizeargfunc)igraphmodule_VertexSeq_sq_item, /* sq_item */
-  0,                                          /* sq_slice */
-  0,                                          /* sq_ass_item */
-  0,                                          /* sq_ass_slice */
-  0,                                          /* sq_contains */
-  0,                                          /* sq_inplace_concat */
-  0,                                          /* sq_inplace_repeat */
-};
-
-/**
- * \ingroup python_interface_vertexseq
- * This is the collection of functions necessary to implement the
- * vertex sequence as a mapping (which maps attribute names to values)
- */
-static PyMappingMethods igraphmodule_VertexSeq_as_mapping = {
-  /* this must be null, otherwise it f.cks up sq_length when inherited */
-  (lenfunc) 0,
-  /* returns the values of an attribute by name */
-  (binaryfunc) igraphmodule_VertexSeq_get_attribute_values_mapping,
-  /* sets the values of an attribute by name */
-  (objobjargproc) igraphmodule_VertexSeq_set_attribute_values_mapping,
-};
-
-/**
- * \ingroup python_interface_vertexseq
- * Getter/setter table for the \c igraph.VertexSeq object
- */
-PyGetSetDef igraphmodule_VertexSeq_getseters[] = {
-  {"graph", (getter)igraphmodule_VertexSeq_get_graph, NULL,
-      "The graph the vertex sequence belongs to", NULL,
-  },
-  {"indices", (getter)igraphmodule_VertexSeq_get_indices, NULL,
-      "The vertex indices in this vertex sequence", NULL,
-  },
-  {"_name_index", (getter)igraphmodule_VertexSeq__name_index, NULL,
-      "The internal index mapping vertex names to IDs", NULL
-  },
-  {NULL}
-};
-
-/** \ingroup python_interface_vertexseq
- * Python type object referencing the methods Python calls when it performs various operations on
- * a vertex sequence of a graph
- */
-PyTypeObject igraphmodule_VertexSeqType =
-{
-  PyVarObject_HEAD_INIT(0, 0)
-  "igraph.core.VertexSeq",                    /* tp_name */
-  sizeof(igraphmodule_VertexSeqObject),       /* tp_basicsize */
-  0,                                          /* tp_itemsize */
-  (destructor)igraphmodule_VertexSeq_dealloc, /* tp_dealloc */
-  0,                                          /* tp_print */
-  0,                                          /* tp_getattr */
-  0,                                          /* tp_setattr */
-  0,                                          /* tp_compare (2.x) / tp_reserved (3.x) */
-  0,                                          /* tp_repr */
-  0,                                          /* tp_as_number */
-  &igraphmodule_VertexSeq_as_sequence,        /* tp_as_sequence */
-  &igraphmodule_VertexSeq_as_mapping,         /* tp_as_mapping */
-  0,                                          /* tp_hash */
-  0,                                          /* tp_call */
-  0,                                          /* tp_str */
-  0,                                          /* tp_getattro */
-  0,                                          /* tp_setattro */
-  0,                                          /* tp_as_buffer */
-  Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,   /* tp_flags */
-  "Low-level representation of a vertex sequence.\n\n" /* tp_doc */
-  "Don't use it directly, use L{igraph.VertexSeq} instead.\n\n"
-  "@deffield ref: Reference",
-  0,                                          /* tp_traverse */
-  0,                                          /* tp_clear */
-  0,                                          /* tp_richcompare */
-  offsetof(igraphmodule_VertexSeqObject, weakreflist),  /* tp_weaklistoffset */
-  0,                                          /* tp_iter */
-  0,                                          /* tp_iternext */
-  igraphmodule_VertexSeq_methods,             /* tp_methods */
-  0,                                          /* tp_members */
-  igraphmodule_VertexSeq_getseters,           /* tp_getset */
-  0,                                          /* tp_base */
-  0,                                          /* tp_dict */
-  0,                                          /* tp_descr_get */
-  0,                                          /* tp_descr_set */
-  0,                                          /* tp_dictoffset */
-  (initproc) igraphmodule_VertexSeq_init,     /* tp_init */
-  0,                                          /* tp_alloc */
-  (newfunc) igraphmodule_VertexSeq_new,       /* tp_new */
-  0,                                          /* tp_free */
-  0,                                          /* tp_is_gc */
-  0,                                          /* tp_bases */
-  0,                                          /* tp_mro */
-  0,                                          /* tp_cache  */
-  0,                                          /* tp_subclasses */
-  0,                                          /* tp_weakreflist */
-};
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/src/vertexseqobject.h igraph-0.6.5/interfaces/python/src/vertexseqobject.h
--- igraph-0.6.5~quantal1/interfaces/python/src/vertexseqobject.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/src/vertexseqobject.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2006-2012  Tamas Nepusz <ntamas@gmail.com>
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#ifndef PYTHON_VERTEXSEQOBJECT_H
-#define PYTHON_VERTEXSEQOBJECT_H
-
-#include <Python.h>
-#include "graphobject.h"
-
-/**
- * \ingroup python_interface_vertexseq
- * \brief A structure representing the vertex sequence of a graph
- */
-typedef struct {
-  PyObject_HEAD
-  igraphmodule_GraphObject* gref;
-  igraph_vs_t vs;
-  PyObject* weakreflist;
-} igraphmodule_VertexSeqObject;
-
-PyObject* igraphmodule_VertexSeq_new(PyTypeObject *subtype,
-  PyObject* args, PyObject* kwds);
-int igraphmodule_VertexSeq_init(igraphmodule_VertexSeqObject* self,
-  PyObject* args, PyObject* kwds);
-void igraphmodule_VertexSeq_dealloc(igraphmodule_VertexSeqObject* self);
-
-int igraphmodule_VertexSeq_sq_length(igraphmodule_VertexSeqObject *self);
-
-PyObject* igraphmodule_VertexSeq_find(igraphmodule_VertexSeqObject *self,
-  PyObject *args);
-PyObject* igraphmodule_VertexSeq_select(igraphmodule_VertexSeqObject *self,
-  PyObject *args);
-
-int igraphmodule_VertexSeq_to_vector_t(igraphmodule_VertexSeqObject *self,
-  igraph_vector_t *v);
-PyObject* igraphmodule_VertexSeq_get_graph(igraphmodule_VertexSeqObject *self,
-  void* closure);
-
-extern PyTypeObject igraphmodule_VertexSeqType;
-
-#endif
diff -Nru igraph-0.6.5~quantal1/interfaces/python/test/cytoscape_test.py igraph-0.6.5/interfaces/python/test/cytoscape_test.py
--- igraph-0.6.5~quantal1/interfaces/python/test/cytoscape_test.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/test/cytoscape_test.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,86 +0,0 @@
-#!/usr/bin/env python
-# -*- coding: utf-8 -*-
-"""Simple script that tests CytoscapeGraphDrawer.
-
-This script is kept separate from the unit tests as it is very
-hard to test for the correctness of CytoscapeGraphDrawer without
-a working instance of Cytoscape.
-
-Prerequisites for running this test:
-
-    1. Start Cytoscape
-    2. Activate the Cytoscape RPC plugin, listening at port 9000
-
-"""
-
-from igraph import Graph
-from igraph.drawing.graph import CytoscapeGraphDrawer
-
-def test():
-    g = Graph.GRG(100, 0.2)
-
-    ### Adding network attributes
-    g["name"] = "Network name"
-    g["version"] = 5
-    g["obsolete"] = False
-    g["density"] = g.density()
-
-    ### Adding vertex attributes
-    # String attribute
-    g.vs["name"] = ["Node %d" % (i+1) for i in xrange(g.vcount())]
-    # Integer attribute
-    g.vs["degree"] = g.degree()
-    # Float attribute
-    g.vs["pagerank"] = g.pagerank()
-    # Boolean attribute
-    g.vs["even"] = [i % 2 for i in xrange(g.vcount())]
-    # Mixed attribute
-    g.vs["mixed"] = ["abc", 123, None, 1.0] * ((g.vcount()+3) / 4)
-    # Special attribute with Hungarian accents
-    g.vs[0]["name"] = u"árvíztűrő tükörfúrógép �RV�ZTŰR� TÜKÖRFÚRÓGÉP"
-
-    ### Adding edge attributes
-    # String attribute
-    g.es["name"] = ["Edge %d -- %d" % edge.tuple for edge in g.es]
-    # Integer attribute
-    g.es["multiplicity"] = g.count_multiple()
-    # Float attribute
-    g.es["betweenness"] = g.edge_betweenness()
-    # Boolean attribute
-    g.es["even"] = [i % 2 for i in xrange(g.ecount())]
-    # Mixed attribute
-    g.es["mixed"] = [u"yay", 123, None, 0.7] * ((g.ecount()+3) / 4)
-
-    # Sending graph
-    drawer = CytoscapeGraphDrawer()
-    drawer.draw(g, layout="fr")
-
-    # Fetching graph
-    g2 = drawer.fetch()
-    del g2.vs["hiddenLabel"]
-    del g2.es["interaction"]
-
-    # Check isomorphism
-    result = g2.isomorphic(g)
-    if not result:
-        raise ValueError("g2 not isomorphic to g")
-
-    # Check the graph attributes
-    if set(g.attributes()) != set(g2.attributes()):
-        raise ValueError("Graph attribute name set mismatch")
-    for attr_name in g.attributes():
-        if g[attr_name] != g2[attr_name]:
-            raise ValueError("Graph attribute mismatch for %r" % attr_name)
-
-    # Check the vertex attribute names
-    if set(g.vertex_attributes()) != set(g2.vertex_attributes()):
-        raise ValueError("Vertex attribute name set mismatch")
-
-    # Check the edge attribute names
-    if set(g.edge_attributes()) != set(g2.edge_attributes()):
-        raise ValueError("Edge attribute name set mismatch")
-        
-
-if __name__ == "__main__":
-    test()
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/test/doctests.py igraph-0.6.5/interfaces/python/test/doctests.py
--- igraph-0.6.5~quantal1/interfaces/python/test/doctests.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/test/doctests.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,19 +0,0 @@
-#!/usr/bin/env python
-"""
-Runs all the doctests in the igraph module
-"""
-
-import doctest
-import igraph
-
-if __name__ == "__main__":
-    doctest.testmod(igraph)
-    doctest.testmod(igraph.clustering)
-    doctest.testmod(igraph.cut)
-    doctest.testmod(igraph.datatypes)
-    doctest.testmod(igraph.drawing.utils)
-    doctest.testmod(igraph.formula)
-    doctest.testmod(igraph.nexus)
-    doctest.testmod(igraph.statistics)
-    doctest.testmod(igraph.utils)
-
diff -Nru igraph-0.6.5~quantal1/interfaces/python/test/unittests.py igraph-0.6.5/interfaces/python/test/unittests.py
--- igraph-0.6.5~quantal1/interfaces/python/test/unittests.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/test/unittests.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-#!/usr/bin/env python
-"""
-Simple script that runs the unit tests of igraph.
-"""
-
-import sys
-from igraph.test import run_tests
-
-if __name__ == "__main__":
-    if "-v" in sys.argv:
-        verbosity = 2
-    else:
-        verbosity = 1
-    run_tests(verbosity=verbosity)
diff -Nru igraph-0.6.5~quantal1/interfaces/python/test.sh igraph-0.6.5/interfaces/python/test.sh
--- igraph-0.6.5~quantal1/interfaces/python/test.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/python/test.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,59 +0,0 @@
-#!/bin/bash
-if [ x$1 == x-d -a -x /usr/bin/valgrind ]; then
-  # Checking memory leaks with Valgrind
-  echo "Valgrind memory leak debugging enabled"
-  FNAME=/tmp/igraph_${RANDOM}.supp
-  cat /usr/lib/valgrind/python.supp >$FNAME
-  cat $0|awk 'BEGIN { ok=0 } /[S]UPPRESSIONS/ { first=1 } { if (first) { ok=1; first=0; } else if (ok) { print; } }' >>$FNAME
-  PRE="valgrind --tool=memcheck --leak-check=yes --trace-children=yes --suppressions=$FNAME"
-  shift
-else
-  PRE=""
-fi
-DYLD_LIBRARY_PATH=src/.libs LD_LIBRARY_PATH=src/.libs $PRE python $1 interfaces/python/setup.py test
-if [ x$FNAME != x ]; then rm -f $FNAME; fi
-
-exit 0
-################## SUPPRESSIONS for Valgrind ########################
-{
-   <insert a suppression name here>
-   Memcheck:Cond
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-}
-{
-   <insert a suppression name here>
-   Memcheck:Cond
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/tls/i686/cmov/libc-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   fun:_dl_open
-   obj:/lib/tls/i686/cmov/libdl-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/tls/i686/cmov/libdl-2.3.5.so
-   fun:dlopen
-   fun:_PyImport_GetDynLoadFunc
-   fun:_PyImport_LoadDynamicModule
-}
-{
-   <insert a suppression name here>
-   Memcheck:Cond
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/tls/i686/cmov/libc-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   fun:_dl_open
-   obj:/lib/tls/i686/cmov/libdl-2.3.5.so
-   obj:/lib/ld-2.3.5.so
-   obj:/lib/tls/i686/cmov/libdl-2.3.5.so
-   fun:dlopen
-   fun:_PyImport_GetDynLoadFunc
-   fun:_PyImport_LoadDynamicModule
-   obj:/usr/bin/python2.4
-   obj:/usr/bin/python2.4
-}
-					  
diff -Nru igraph-0.6.5~quantal1/interfaces/shell/Makefile.am igraph-0.6.5/interfaces/shell/Makefile.am
--- igraph-0.6.5~quantal1/interfaces/shell/Makefile.am	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/shell/Makefile.am	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-bin_PROGRAMS = igraph
-
-STIMULUS = $(top_srcdir)/tools/stimulus.py
-FUNCTIONS_DEF = $(top_srcdir)/interfaces/functions.def
-TYPES_DEF = $(top_srcdir)/interfaces/shell/types.def
-
-interface.c: interface.c.in $(TYPES_DEF) $(STIMULUS) $(FUNCTIONS_DEF)
-	$(STIMULUS) -f $(FUNCTIONS_DEF) \
-	  -i $(top_srcdir)/interfaces/shell/interface.c.in \
-	  -o interface.c \
-	  -t $(TYPES_DEF) \
-          -l Shell
-
-funcs.txt: interface.c.in $(STIMULUS) $(FUNCTIONS_DEF)
-	$(STIMULUS) -f $(FUNCTIONS_DEF) -o funcs.txt -l ShellLn
-
-igraph_CPPFLAGS = -I $(top_srcdir)/include/
-igraph_CFLAGS = -Wall -O2
-igraph_LDFLAGS = -L$(top_srcdir)/src/.libs -ligraph
-igraph_SOURCES = interface.c
-
-install-exec-hook: funcs.txt
-	for i in `cat funcs.txt`; do ln -sf igraph $(bindir)/$$i; done
diff -Nru igraph-0.6.5~quantal1/interfaces/shell/interface.c.in igraph-0.6.5/interfaces/shell/interface.c.in
--- igraph-0.6.5~quantal1/interfaces/shell/interface.c.in	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/shell/interface.c.in	1970-01-01 00:00:00.000000000 +0000
@@ -1,448 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
-   334 Harvard street, Cambridge, MA 02139 USA
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-#define _GNU_SOURCE
-
-#include <libgen.h>
-#include <string.h>
-#include <stdio.h>
-#include <getopt.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <errno.h>
-#include <limits.h>
-#include <ctype.h>
-
-#include "igraph.h"
-
-/* ------------------------------------------------------------------------ */
-/* Conversion & other common functions first                                */
-/* ------------------------------------------------------------------------ */
-
-
-int shell_igraph_usage(int argc, char **argv) {
-  printf("Command line interface to igraph\n");
-  return 0;
-}
-
-int shell_skip_whitespace(FILE *fin) {
-  int c;
-  c=fgetc(fin);
-  while (isspace(c)) {
-    c=fgetc(fin);
-  }
-  if (c!=EOF) { ungetc(c, fin); }
-  return 0;
-}
-
-FILE *shell_open_file(const char *where, const char *mode) {  
-  static const char *input="input";
-  static const char *output="output";
-  FILE *f;
-
-  if (!strcmp(where, "-")) {
-    if (!strcmp(mode, "r")) {
-      return stdin;
-    } else if (!strcmp(mode, "w")) {
-      return stdout;
-    }
-  }
-
-  f=fopen(where, mode);
-  if (!f) {
-    fprintf(stderr, "Cannot open %s file: `%s'\n", 
-	    !strcmp(mode, "r") ? input : output, where);
-    exit(1);
-  }
-  return f;
-} 
-
-int shell_read_graph(igraph_t *graph, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  igraph_read_graph_graphml(graph, fin, 0);
-  fclose(fin);
-  return 0;
-}
-
-int shell_write_graph(const igraph_t *graph, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  igraph_write_graph_graphml(graph, fout);
-  fclose(fout);
-  return 0;
-}
-
-int shell_read_vector(igraph_vector_t *v, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  igraph_real_t n;
-  int ret=1;
-  igraph_vector_init(v, 0);
-  while (ret > 0) {
-    ret=fscanf(fin, "%lf", &n);
-    if (ret > 0) { 
-      igraph_vector_push_back(v, n);
-    }
-  }
-  fclose(fin);
-  if (ret != EOF) {
-    fprintf(stderr, "Error reading vector from file: `%s'\n", where);
-    exit(1);
-  }
-
-  return 0;
-}
-
-int shell_write_a_vector(const igraph_vector_t *v, FILE *fout, const char *where) {
-  int ret=1;
-  long int i, n=igraph_vector_size(v);
-  if (n>0) { ret=fprintf(fout, "%g", VECTOR(*v)[0]); }
-  if (ret <= 0) { 
-    fprintf(stderr, "Cannot write vector to `%s'\n", where);
-    fclose(fout);
-    exit(1);
-  }
-  for (i=1; i<n; i++) {
-    ret=fprintf(fout, " %g", VECTOR(*v)[i]);
-    if (ret <= 0) { 
-      fprintf(stderr, "Cannot write vector to `%s'\n", where);
-      fclose(fout);
-      exit(1);
-    }
-  }
-  fprintf(fout, "\n");
-  return 0;
-}  
-
-int shell_write_vector(const igraph_vector_t *v, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  shell_write_a_vector(v, fout, where);
-  fclose(fout);  
-  return 0;
-}
-
-int shell_read_a_matrix(igraph_matrix_t *m, FILE *fin, const char *where) {
-  long int ncol, nrow, i, j;
-  igraph_real_t n;
-  int ret;
-  if (2 != fscanf(fin, "%li %li", &nrow, &ncol)) {
-    fprintf(stderr, "Error reading matrix from file '%s'\n", where);
-    fclose(fin);
-    exit(1);
-  }
-  igraph_matrix_init(m,nrow,ncol);
-  for (i=0; i<nrow; i++) {
-    for (j=0; j<ncol; j++) {
-      ret=fscanf(fin, "%lf", &n);
-      if (ret <= 0) { 
-	fprintf(stderr, "Error reading matrix from file '%s'\n", where);
-	fclose(fin);
-	exit(1);
-      }
-      MATRIX(*m, i, j)=n;
-    }
-  }
-  return 0;
-}
-
-int shell_read_matrix(igraph_matrix_t *m, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  shell_read_a_matrix(m, fin, where);
-  fclose(fin);      
-  return 0;
-}
-
-int shell_write_matrix(const igraph_matrix_t *m, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  long int nrow=igraph_matrix_nrow(m);
-  long int ncol=igraph_matrix_ncol(m);
-  long int i, j;
-    
-  if (0>fprintf(fout, "%li %li\n", nrow, ncol)) {
-    fprintf(stderr, "Error writing matrix to file '%s'.\n", where);
-    fclose(fout);
-    exit(1);
-  }
-
-  for (i=0; i<nrow; i++) {
-    for (j=0; j<ncol; j++) {
-      if (j!=0) { fprintf(fout, " "); }
-      if (0>fprintf(fout, "%g", MATRIX(*m, i, j))) {
-	fprintf(stderr, "Error writing matrix to file '%s'.\n", where);
-	fclose(fout);
-	exit(1);
-      }
-    }
-    fprintf(fout, "\n");
-  }
-  fclose(fout);
-  
-  return 0;
-}
-
-int shell_read_integer(igraph_integer_t *n, const char *where) {
-  long int nn;
-  int ret=sscanf(where, "%li", &nn);
-  if (ret == EOF || ret == 0) {
-    fprintf(stderr, "Error, cannot interpret '%s' as integer\n", where);
-    exit(1);
-  }
-  *n=nn;
-  return 0;
-}
-
-int shell_write_integer(igraph_integer_t n, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  int ret=fprintf(fout, "%li\n", (long int)n);
-  if (ret <= 0) { 
-    fprintf(stderr, "Cannot write integer to '%s'\n", where);
-    fclose(fout);
-    exit(1);
-  }
-  return 0;
-}
-
-int shell_read_boolean(igraph_bool_t *b, const char *where) {
-  if (strlen(where)==0 || 
-      where[0]=='0' ||
-      where[0]=='F' ||
-      where[0]=='f') {
-    *b=0;
-  } else {
-    *b=1;
-  }
-  return 0;
-}
-
-int shell_write_boolean(igraph_bool_t b, const char *where) {
-  int bb= b==0 ? 0 : 1;
-  FILE *fout=shell_open_file(where, "w");
-  int ret=fprintf(fout, "%i\n", bb);
-  if (ret <= 0) { 
-    fprintf(stderr, "Cannot write integer to '%s'\n", where);
-    fclose(fout);
-    exit(1);
-  }  
-  return 0;
-}
-
-int shell_read_real(igraph_real_t *b, const char *where) {
-  int ret=sscanf(where, "%lf", b);
-  if (ret == EOF || ret == 0) {
-    fprintf(stderr, "Error, cannot interpret '%s' as real\n", where);
-    exit(1);
-  }  
-  return 0;
-}
-
-int shell_write_real(igraph_real_t b, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  int ret=fprintf(fout, "%g\n", (double)b);
-  if (ret <= 0) { 
-    fprintf(stderr, "Cannot write real to `%s'\n", where);
-    fclose(fout);
-    exit(1);
-  }
-  return 0;
-}
-
-int shell_read_enum(void* value, const char *where, ...) {
-  int result=-1, *p=value;
-  va_list args;
-  va_start(args, where);
-  
-  while (1) {
-    char *name=va_arg(args, char*);
-    int code;
-    if (name) {
-      code=va_arg(args, int);
-      if (!strcmp(optarg, name)) {
-	result=code;
-	break;
-      }
-    } else {
-      break;
-    }
-  }
-  
-  if (result==-1) {
-    fprintf(stderr, "Cannot interpret argument: '%s'.\n", where);
-    exit(1);
-  }   
-
-  *p=result;
-
-  return 0;
-}
-
-int shell_read_int(int *value, const char *where) {
-  long int li=strtol(where, 0, 10);
-  if (errno || li<INT_MIN || li>INT_MAX) {
-    fprintf(stderr, "Integer too small/big: '%s'.\n", where);
-  }
-  *value=li;
-  return 0;
-}
-
-int shell_read_longint(long int *value, const char *where) {
-  long int li=strtol(where, 0, 10);
-  if (errno) {
-    fprintf(stderr, "Long integer too small/big: '%s'.\n", where);
-  }
-  *value=li;
-  return 0;
-}
-
-int shell_read_file(FILE **file, const char *where, const char *mode) {
-  *file=fopen(where, mode);
-  if (!*file) {
-    fprintf(stderr, "Cannot open file '%s'\n", where);
-  }
-  return 0;
-}
-
-int shell_read_matrixlist(igraph_vector_ptr_t *list, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  igraph_vector_ptr_init(list, 0);
-  shell_skip_whitespace(fin);
-  while (!feof(fin)) {
-    igraph_matrix_t *m=malloc(sizeof(igraph_matrix_t));
-    shell_read_a_matrix(m, fin, where);
-    igraph_vector_ptr_push_back(list, m);
-    shell_skip_whitespace(fin);
-  }
-  fclose(fin);
-  return 0;
-}
-
-int shell_read_graphlist(igraph_vector_ptr_t *list, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  igraph_vector_ptr_init(list, 0);
-  shell_skip_whitespace(fin);
-  while (!feof(fin)) {
-    igraph_t *g=malloc(sizeof(igraph_t));
-    igraph_read_graph_graphml(g, fin, 0);
-    igraph_vector_ptr_push_back(list, g);
-    shell_skip_whitespace(fin);
-  }
-  fclose(fin);
-  return 0;
-}
-
-int shell_read_strvector(igraph_strvector_t *str, const char *where) {
-  FILE *fin=shell_open_file(where, "r");
-  char *buffer=calloc(1000, sizeof(char));
-  size_t size;
-  int c;
-  igraph_strvector_init(str, 0);
-  while(1) {
-    getline(&buffer, &size, fin);
-    igraph_strvector_add(str, buffer);
-    c=getc(fin);
-    if (!feof(fin)) {
-      ungetc(c, fin);
-    } else {
-      break;
-    }
-  }
-  fclose(fin);
-  free(buffer);
-  
-  return 0;
-}
-
-int shell_write_vectorlist(igraph_vector_ptr_t *v, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  long int i, n=igraph_vector_ptr_size(v);
-  for (i=0; i<n; i++) {
-    shell_write_a_vector(VECTOR(*v)[i], fout, where);
-  }
-  fclose(fout);
-  return 0;
-}
-
-int shell_write_vector_bool(igraph_vector_bool_t *v, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  int ret=1;
-  long int i, n=igraph_vector_bool_size(v);
-  if (n>0) { ret=fprintf(fout, "%i", VECTOR(*v)[0]==0 ? 0 : 1); }
-  if (ret <= 0) { 
-    fprintf(stderr, "Cannot write vector to `%s'\n", where);
-    fclose(fout);
-    exit(1);
-  }
-  for (i=1; i<n; i++) {
-    ret=fprintf(fout, " %i", VECTOR(*v)[i]==0 ? 0 : 1);
-    if (ret <= 0) { 
-      fprintf(stderr, "Cannot write vector to `%s'\n", where);
-      fclose(fout);
-      exit(1);
-    }
-  }
-  fprintf(fout, "\n");
-  fclose(fout);
-  return 0;
-}  
-
-int shell_write_graphlist(igraph_vector_ptr_t *v, const char *where) {
-  FILE *fout=shell_open_file(where, "w");
-  long int i, n=igraph_vector_ptr_size(v);
-  for (i=0; i<n; i++) {
-    igraph_write_graph_graphml(VECTOR(*v)[i], fout);
-  }
-  fclose(fout);
-  return 0;
-}
-
-int shell_free_graphlist(igraph_vector_ptr_t *v) {
-  long int i, n=igraph_vector_ptr_size(v);
-  for (i=0; i<n; i++) {
-    igraph_destroy(VECTOR(*v)[i]);
-    free(VECTOR(*v)[i]);
-    VECTOR(*v)[i]=0;
-  }
-  return 0;
-}
-
-int shell_free_matrixlist(igraph_vector_ptr_t *v) {
-  long int i, n=igraph_vector_ptr_size(v);
-  for (i=0; i<n; i++) {
-    igraph_matrix_destroy(VECTOR(*v)[i]);
-    free(VECTOR(*v)[i]);
-    VECTOR(*v)[i]=0;
-  }
-  return 0;
-}
-
-int shell_free_vectorlist(igraph_vector_ptr_t *v) {
-  long int i, n=igraph_vector_ptr_size(v);
-  for (i=0; i<n; i++) {
-    igraph_vector_destroy(VECTOR(*v)[i]);
-    free(VECTOR(*v)[i]);
-    VECTOR(*v)[i]=0;
-  }
-  return 0;
-}
-
-/* ------------------------------------------------------------------------ */
-/* Stimulus generated interface next                                        */
-/* ------------------------------------------------------------------------ */
-
diff -Nru igraph-0.6.5~quantal1/interfaces/shell/types.def igraph-0.6.5/interfaces/shell/types.def
--- igraph-0.6.5~quantal1/interfaces/shell/types.def	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/interfaces/shell/types.def	1970-01-01 00:00:00.000000000 +0000
@@ -1,369 +0,0 @@
-GRAPH:
-  CTYPE: igraph_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_graph(&%C%, optarg);
-    OUT: shell_arg_%C%=strdup(optarg);
-  OUTCONV:
-    IN: igraph_destroy(&%C%);
-    OUT: shell_write_graph(&%C%, shell_arg_%C%); \
-         igraph_destroy(&%C%);
-
-INTEGER:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: shell_read_integer(&%C%, optarg);
-
-INTEGERPTR:
-  CTYPE: igraph_integer_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_integer(&%C%, optarg);
-    OUT: shell_arg_%C%=strdup(optarg);
-  OUTCONV:
-    OUT: shell_write_integer(%C%, shell_arg_%C%);
-
-REAL:
-  CTYPE: igraph_real_t
-  DEFAULT:
-    VCOUNT(graph): 100
-    VCOUNT(graph)^2: 1000
-    VCOUNT(graph)^3: 10000
-    VCOUNT(graph)/4: 10
-  INCONV:
-    IN: shell_read_real(&%C%, optarg);
-
-REALPTR:
-  CTYPE: igraph_real_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_real(&%C%, optarg);
-    OUT: shell_arg_%C%=strdup(optarg);
-  OUTCONV:
-    OUT: shell_write_real(%C%, shell_arg_%C%);
-
-BOOLEAN:
-  CTYPE: igraph_bool_t
-  INCONV:
-    IN: shell_read_boolean(&%C%, optarg);
-  DEFAULT:
-    True: 1
-    False: 0
-
-BOOLEANPTR:
-  CTYPE: igraph_bool_t
-  CALL: &%C%
-  OUTCONV:
-    OUT: shell_write_boolean(%C%, shell_arg_%C%);
-
-VECTOR:
-  CTYPE: igraph_vector_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_vector(&%C%, optarg);
-    OUT: shell_arg_%C%=strdup(optarg); \
-         igraph_vector_init(&%C%, 0);
-  OUTCONV:
-    OUT: shell_write_vector(&%C%, shell_arg_%C%); \
-         igraph_vector_destroy(&%C%);
-    IN: igraph_vector_destroy(&%C%);
-
-VECTOR_OR_0:
-  DECL: igraph_vector_t v_%C%; igraph_vector_t *%C%=0
-  INCONV: 
-    IN: %C%=&v_%C%; shell_read_vector(%C%, optarg);
-    OUT: %C%=&v_%C%; igraph_vector_init(%C%, 0); \
-         shell_arg_%C%=strdup(optarg);
-  OUTCONV:
-    IN: if (%C%) { igraph_vector_destroy(%C%); }    
-    OUT: if (%C%) { shell_write_vector(%C%, shell_arg_%C%); \
-                    igraph_vector_destroy(%C%); }
-
-MATRIX:
-  CTYPE: igraph_matrix_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_matrix(&%C%, optarg);
-    OUT: shell_arg_%C%=strdup(optarg); \
-         igraph_matrix_init(&%C%, 0, 0);
-  OUTCONV:
-    IN: igraph_matrix_destroy(&%C%);
-    OUT: shell_write_matrix(&%C%, shell_arg_%C%); \
-         igraph_matrix_destroy(&%C%);
-
-EDGESET:
-  CTYPE: igraph_es_t
-  DECL: igraph_vector_t v_%C%; igraph_es_t %C%
-  DEFAULT:
-    ALL: igraph_ess_all(IGRAPH_EDGEORDER_ID)
-  INCONV: 
-    IN: shell_read_vector(&v_%C%, optarg); igraph_es_vector(&%C%, &v_%C%);
-  OUTCONV:
-    IN: if (!igraph_es_is_all(&%C%)) { igraph_es_destroy(&%C%); }
-
-VERTEXSET:
-  CTYPE: igraph_vs_t
-  DECL: igraph_vector_t v_%C%; igraph_vs_t %C% 
-  DEFAULT:
-    ALL: igraph_vss_all()
-  INCONV:
-    IN: shell_read_vector(&v_%C%, optarg); igraph_vs_vector(&%C%, &v_%C%);
-  OUTCONV:
-    IN: if (!igraph_vs_is_all(&%C%)) { igraph_vector_destroy(&v_%C%); }
-
-CONNECTEDNESS:
-  CTYPE: igraph_connectedness_t
-  DEFAULT:
-    WEAK: IGRAPH_WEAK
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "weak", 1, "strong", 2, 0);
-
-NEIMODE:
-  CTYPE: igraph_neimode_t
-  DEFAULT:
-    OUT: IGRAPH_OUT
-    IN: IGRAPH_IN
-    ALL: IGRAPH_ALL
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "out", 1, "in", 2, "all", 3, "total", 3, 0);
-
-ADJACENCYMODE:
-  CTYPE: igraph_adjacency_t
-  DEFAULT:
-    DIRECTED: IGRAPH_ADJ_DIRECTED
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "directed", 0, "undirected", 1, \
-          "max", 1, "upper", 2, "lower", 3, "min", 4, "plus", 5, 0);
-
-STARMODE:
-  CTYPE: igraph_star_mode_t
-  DEFAULT:
-    OUT: IGRAPH_STAR_OUT
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "out", 0, "in", 1, "undirected", 2, 0);
-
-TREEMODE:
-  CTYPE: igraph_tree_mode_t
-  DEFAULT:
-    OUT: IGRAPH_TREE_OUT
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "out", 0, "in", 1, "undirected", 2, 0);
-
-DEGSEQMODE:
-  CTYPE: igraph_degseq_t
-  DEFAULT:
-    SIMPLE: IGRAPH_DEGSEQ_SIMPLE
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "simple", 0, 0);
-
-SPINCOMMUPDATE:
-  CTYPE: igraph_spincomm_update_t
-  DEFAULT:
-    CONFIG: IGRAPH_SPINCOMM_UPDATE_CONFIG
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "simple", 0, "config", 1, 0);
-
-GETADJACENCY:
-  CTYPE: igraph_get_adjacency_t
-  DEFAULT:
-    BOTH: IGRAPH_GET_ADJACENCY_BOTH
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "upper", 0, "lower", 1, "both", 2, 0);
-
-TODIRECTED:
-  CTYPE: igraph_to_directed_t
-  DEFAULT:
-    MUTUAL: IGRAPH_TO_DIRECTED_MUTUAL
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "arbitrary", 0, "mutual", 1, 0);
-
-TOUNDIRECTED:
-  CTYPE: igraph_to_undirected_t
-  DEFAULT:
-    COLLAPSE: IGRAPH_TO_UNDIRECTED_COLLAPSE
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "each", 0, "collapse", 0);
-
-COMMCMP:
-  CTYPE: igraph_community_comparison_t
-  DEFAULT:
-    VI: IGRAPH_COMMCMP_VI
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "vi", IGRAPH_COMMCMP_VI, "nmi", IGRAPH_COMMCMP_NMI);
-
-VCONNNEI:
-  CTYPE: igraph_vconn_nei_t
-  DEFAULT:
-    INFINITY: IGRAPH_VCONN_NEI_INFINITY
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "error", 0, "infinity", 1, "ignore", 2, 0);
-
-REWIRINGMODE:
-  CTYPE: igraph_rewiring_t
-  DEFAULT:
-    SIMPLE: IGRAPH_REWIRING_SIMPLE
-  INCONV:
-    IN: shell_read_enum(&%C%, optarg, "simple", 0, 0);
-
-CSTRING:
-  CTYPE: char *
-  INCONV:
-    IN: %C%=strdup(optarg);
-  OUTCONV:
-    IN: free(%C%);
-
-VECTORLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    OUT: igraph_vector_ptr_init(&%C%, 0);
-  OUTCONV:
-    OUT: shell_write_vectorlist(&%C%, shell_arg_%C%); \
-         shell_free_vectorlist(&%C%); \
-         igraph_vector_ptr_destroy(&%C%);
-
-GRAPHLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_graphlist(&%C%, optarg);
-    OUT: igraph_vector_ptr_init(&%C%, 0);
-  OUTCONV:
-    IN: shell_free_graphlist(&%C%); \
-        igraph_vector_ptr_destroy(&%C%);
-    OUT: shell_write_graphlist(&%C%, shell_arg_%C%); \
-         shell_free_graphlist(&%C%); \
-         igraph_vector_ptr_destroy(&%C%);
-
-VECTOR_BOOL:
-  CTYPE: igraph_vector_bool_t
-  CALL: &%C%
-  INCONV:
-    OUT: igraph_vector_bool_init(&%C%, 0);
-  OUTCONV:
-    OUT: shell_write_vector_bool(&%C%, shell_arg_%C%); \
-         igraph_vector_bool_destroy(&%C%);
-
-INT:
-  CTYPE: int
-  INCONV:
-    IN: shell_read_int(&%C%, optarg);
-
-LONGINT:
-  CTYPE: long int
-  DEFAULT:
-    VCOUNT(graph): 100
-  INCONV:
-    IN: shell_read_longint(&%C%, optarg);
-
-MATRIXLIST:
-  CTYPE: igraph_vector_ptr_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_matrixlist(&%C%, optarg);
-  OUTCONV:
-    IN: shell_free_matrixlist(&%C%); \
-        igraph_vector_ptr_destroy(&%C%);
-
-INFILE:
-  CTYPE: FILE*
-  DECL: FILE* %C%=0
-  INCONV:
-    IN: shell_read_file(&%C%, optarg, "r");
-  OUTCONV:
-    IN: fclose(%C%);
-
-OUTFILE:
-  CTYPE: FILE*
-  DECL: FILE* %C%=0
-  INCONV:
-    IN: shell_read_file(&%C%, optarg, "w");
-  OUTCONV:
-    IN: fclose(%C%);
-
-STRVECTOR:
-  CTYPE: igraph_strvector_t
-  CALL: &%C%
-  INCONV:
-    IN: shell_read_strvector(&%C%, optarg);
-  OUTCONV:
-    IN: igraph_strvector_destroy(&%C%);
-
-STRVECTOR_OR_0:
-  DECL: igraph_strvector_t v_%C%; igraph_strvector_t *%C%=0;
-  INCONV:
-    IN: %C%=&v_%C%; shell_read_strvector(%C%, optarg);
-  OUTCONV:
-    IN: if (%C%) { igraph_strvector_destroy(%C%); }
-
-ERROR:
-  CTYPE: int
-
-NULL:
-  CALL: 0
-  HEADER:
-
-ATTRIBUTES:
-  CALL: 0
-
-EDGEWEIGHTS:
-  CALL: 0
-
-ARPACKOPT:
-  CALL: 0
-
-ARPFUNC:
-  CALL: 0
-
-EXTRA:
-  CALL: 0
-
-MATRIX_OR_0:
-  CALL: 0
-
-BLISSSH:
-  CALL: 0
-
-BLISSINFO:
-  CALL: 0
-
-ARRAY3:
-  CALL: 0
-
-ARRAY3_OR_0:
-  CALL: 0
-
-ADJLIST:
-
-DRL_OPTIONS:
-
-VECTOR_BOOL_OR_0:
-
-BIPARTITE_TYPES:
-
-TRANSITIVITYMODE:
-
-BOOLEANPTR_OR_0:
-
-GRAPH_OR_0:
-
-VECTOR_LONG:
-
-BFS_FUNC:
-
-DFS_FUNC:
-
-VECTORLIST_OR_0:
-
-VERTEX_COLOR:
-
-EDGE_COLOR:
-
-VERTEX:
-  CTYPE: igraph_integer_t
-  INCONV:
-    IN: shell_read_integer(&%C%, optarg);
-
-
-VERTEX_ATTRIBUTE_COMBINATION:
-EDGE_ATTRIBUTE_COMBINATION:
diff -Nru igraph-0.6.5~quantal1/ltmain.sh igraph-0.6.5/ltmain.sh
--- igraph-0.6.5~quantal1/ltmain.sh	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/ltmain.sh	2013-03-03 01:30:04.000000000 +0000
@@ -0,0 +1,9661 @@
+
+# libtool (GNU libtool) 2.4.2
+# Written by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996
+
+# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006,
+# 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
+# This is free software; see the source for copying conditions.  There is NO
+# warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+
+# GNU Libtool 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 2 of the License, or
+# (at your option) any later version.
+#
+# As a special exception to the GNU General Public License,
+# if you distribute this file as part of a program or library that
+# is built using GNU Libtool, you may include this file under the
+# same distribution terms that you use for the rest of that program.
+#
+# GNU Libtool 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 GNU Libtool; see the file COPYING.  If not, a copy
+# can be downloaded from http://www.gnu.org/licenses/gpl.html,
+# or obtained by writing to the Free Software Foundation, Inc.,
+# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
+
+# Usage: $progname [OPTION]... [MODE-ARG]...
+#
+# Provide generalized library-building support services.
+#
+#       --config             show all configuration variables
+#       --debug              enable verbose shell tracing
+#   -n, --dry-run            display commands without modifying any files
+#       --features           display basic configuration information and exit
+#       --mode=MODE          use operation mode MODE
+#       --preserve-dup-deps  don't remove duplicate dependency libraries
+#       --quiet, --silent    don't print informational messages
+#       --no-quiet, --no-silent
+#                            print informational messages (default)
+#       --no-warn            don't display warning messages
+#       --tag=TAG            use configuration variables from tag TAG
+#   -v, --verbose            print more informational messages than default
+#       --no-verbose         don't print the extra informational messages
+#       --version            print version information
+#   -h, --help, --help-all   print short, long, or detailed help message
+#
+# MODE must be one of the following:
+#
+#         clean              remove files from the build directory
+#         compile            compile a source file into a libtool object
+#         execute            automatically set library path, then run a program
+#         finish             complete the installation of libtool libraries
+#         install            install libraries or executables
+#         link               create a library or an executable
+#         uninstall          remove libraries from an installed directory
+#
+# MODE-ARGS vary depending on the MODE.  When passed as first option,
+# `--mode=MODE' may be abbreviated as `MODE' or a unique abbreviation of that.
+# Try `$progname --help --mode=MODE' for a more detailed description of MODE.
+#
+# When reporting a bug, please describe a test case to reproduce it and
+# include the following information:
+#
+#         host-triplet:	$host
+#         shell:		$SHELL
+#         compiler:		$LTCC
+#         compiler flags:		$LTCFLAGS
+#         linker:		$LD (gnu? $with_gnu_ld)
+#         $progname:	(GNU libtool) 2.4.2 Debian-2.4.2-1ubuntu1
+#         automake:	$automake_version
+#         autoconf:	$autoconf_version
+#
+# Report bugs to <bug-libtool@gnu.org>.
+# GNU libtool home page: <http://www.gnu.org/software/libtool/>.
+# General help using GNU software: <http://www.gnu.org/gethelp/>.
+
+PROGRAM=libtool
+PACKAGE=libtool
+VERSION="2.4.2 Debian-2.4.2-1ubuntu1"
+TIMESTAMP=""
+package_revision=1.3337
+
+# Be Bourne compatible
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
+  emulate sh
+  NULLCMD=:
+  # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac
+fi
+BIN_SH=xpg4; export BIN_SH # for Tru64
+DUALCASE=1; export DUALCASE # for MKS sh
+
+# A function that is used when there is no print builtin or printf.
+func_fallback_echo ()
+{
+  eval 'cat <<_LTECHO_EOF
+$1
+_LTECHO_EOF'
+}
+
+# NLS nuisances: We save the old values to restore during execute mode.
+lt_user_locale=
+lt_safe_locale=
+for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES
+do
+  eval "if test \"\${$lt_var+set}\" = set; then
+          save_$lt_var=\$$lt_var
+          $lt_var=C
+	  export $lt_var
+	  lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\"
+	  lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\"
+	fi"
+done
+LC_ALL=C
+LANGUAGE=C
+export LANGUAGE LC_ALL
+
+$lt_unset CDPATH
+
+
+# Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh
+# is ksh but when the shell is invoked as "sh" and the current value of
+# the _XPG environment variable is not equal to 1 (one), the special
+# positional parameter $0, within a function call, is the name of the
+# function.
+progpath="$0"
+
+
+
+: ${CP="cp -f"}
+test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'}
+: ${MAKE="make"}
+: ${MKDIR="mkdir"}
+: ${MV="mv -f"}
+: ${RM="rm -f"}
+: ${SHELL="${CONFIG_SHELL-/bin/sh}"}
+: ${Xsed="$SED -e 1s/^X//"}
+
+# Global variables:
+EXIT_SUCCESS=0
+EXIT_FAILURE=1
+EXIT_MISMATCH=63  # $? = 63 is used to indicate version mismatch to missing.
+EXIT_SKIP=77	  # $? = 77 is used to indicate a skipped test to automake.
+
+exit_status=$EXIT_SUCCESS
+
+# Make sure IFS has a sensible default
+lt_nl='
+'
+IFS=" 	$lt_nl"
+
+dirname="s,/[^/]*$,,"
+basename="s,^.*/,,"
+
+# func_dirname file append nondir_replacement
+# Compute the dirname of FILE.  If nonempty, add APPEND to the result,
+# otherwise set result to NONDIR_REPLACEMENT.
+func_dirname ()
+{
+    func_dirname_result=`$ECHO "${1}" | $SED "$dirname"`
+    if test "X$func_dirname_result" = "X${1}"; then
+      func_dirname_result="${3}"
+    else
+      func_dirname_result="$func_dirname_result${2}"
+    fi
+} # func_dirname may be replaced by extended shell implementation
+
+
+# func_basename file
+func_basename ()
+{
+    func_basename_result=`$ECHO "${1}" | $SED "$basename"`
+} # func_basename may be replaced by extended shell implementation
+
+
+# func_dirname_and_basename file append nondir_replacement
+# perform func_basename and func_dirname in a single function
+# call:
+#   dirname:  Compute the dirname of FILE.  If nonempty,
+#             add APPEND to the result, otherwise set result
+#             to NONDIR_REPLACEMENT.
+#             value returned in "$func_dirname_result"
+#   basename: Compute filename of FILE.
+#             value retuned in "$func_basename_result"
+# Implementation must be kept synchronized with func_dirname
+# and func_basename. For efficiency, we do not delegate to
+# those functions but instead duplicate the functionality here.
+func_dirname_and_basename ()
+{
+    # Extract subdirectory from the argument.
+    func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"`
+    if test "X$func_dirname_result" = "X${1}"; then
+      func_dirname_result="${3}"
+    else
+      func_dirname_result="$func_dirname_result${2}"
+    fi
+    func_basename_result=`$ECHO "${1}" | $SED -e "$basename"`
+} # func_dirname_and_basename may be replaced by extended shell implementation
+
+
+# func_stripname prefix suffix name
+# strip PREFIX and SUFFIX off of NAME.
+# PREFIX and SUFFIX must not contain globbing or regex special
+# characters, hashes, percent signs, but SUFFIX may contain a leading
+# dot (in which case that matches only a dot).
+# func_strip_suffix prefix name
+func_stripname ()
+{
+    case ${2} in
+      .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;;
+      *)  func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;;
+    esac
+} # func_stripname may be replaced by extended shell implementation
+
+
+# These SED scripts presuppose an absolute path with a trailing slash.
+pathcar='s,^/\([^/]*\).*$,\1,'
+pathcdr='s,^/[^/]*,,'
+removedotparts=':dotsl
+		s@/\./@/@g
+		t dotsl
+		s,/\.$,/,'
+collapseslashes='s@/\{1,\}@/@g'
+finalslash='s,/*$,/,'
+
+# func_normal_abspath PATH
+# Remove doubled-up and trailing slashes, "." path components,
+# and cancel out any ".." path components in PATH after making
+# it an absolute path.
+#             value returned in "$func_normal_abspath_result"
+func_normal_abspath ()
+{
+  # Start from root dir and reassemble the path.
+  func_normal_abspath_result=
+  func_normal_abspath_tpath=$1
+  func_normal_abspath_altnamespace=
+  case $func_normal_abspath_tpath in
+    "")
+      # Empty path, that just means $cwd.
+      func_stripname '' '/' "`pwd`"
+      func_normal_abspath_result=$func_stripname_result
+      return
+    ;;
+    # The next three entries are used to spot a run of precisely
+    # two leading slashes without using negated character classes;
+    # we take advantage of case's first-match behaviour.
+    ///*)
+      # Unusual form of absolute path, do nothing.
+    ;;
+    //*)
+      # Not necessarily an ordinary path; POSIX reserves leading '//'
+      # and for example Cygwin uses it to access remote file shares
+      # over CIFS/SMB, so we conserve a leading double slash if found.
+      func_normal_abspath_altnamespace=/
+    ;;
+    /*)
+      # Absolute path, do nothing.
+    ;;
+    *)
+      # Relative path, prepend $cwd.
+      func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath
+    ;;
+  esac
+  # Cancel out all the simple stuff to save iterations.  We also want
+  # the path to end with a slash for ease of parsing, so make sure
+  # there is one (and only one) here.
+  func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \
+        -e "$removedotparts" -e "$collapseslashes" -e "$finalslash"`
+  while :; do
+    # Processed it all yet?
+    if test "$func_normal_abspath_tpath" = / ; then
+      # If we ascended to the root using ".." the result may be empty now.
+      if test -z "$func_normal_abspath_result" ; then
+        func_normal_abspath_result=/
+      fi
+      break
+    fi
+    func_normal_abspath_tcomponent=`$ECHO "$func_normal_abspath_tpath" | $SED \
+        -e "$pathcar"`
+    func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \
+        -e "$pathcdr"`
+    # Figure out what to do with it
+    case $func_normal_abspath_tcomponent in
+      "")
+        # Trailing empty path component, ignore it.
+      ;;
+      ..)
+        # Parent dir; strip last assembled component from result.
+        func_dirname "$func_normal_abspath_result"
+        func_normal_abspath_result=$func_dirname_result
+      ;;
+      *)
+        # Actual path component, append it.
+        func_normal_abspath_result=$func_normal_abspath_result/$func_normal_abspath_tcomponent
+      ;;
+    esac
+  done
+  # Restore leading double-slash if one was found on entry.
+  func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result
+}
+
+# func_relative_path SRCDIR DSTDIR
+# generates a relative path from SRCDIR to DSTDIR, with a trailing
+# slash if non-empty, suitable for immediately appending a filename
+# without needing to append a separator.
+#             value returned in "$func_relative_path_result"
+func_relative_path ()
+{
+  func_relative_path_result=
+  func_normal_abspath "$1"
+  func_relative_path_tlibdir=$func_normal_abspath_result
+  func_normal_abspath "$2"
+  func_relative_path_tbindir=$func_normal_abspath_result
+
+  # Ascend the tree starting from libdir
+  while :; do
+    # check if we have found a prefix of bindir
+    case $func_relative_path_tbindir in
+      $func_relative_path_tlibdir)
+        # found an exact match
+        func_relative_path_tcancelled=
+        break
+        ;;
+      $func_relative_path_tlibdir*)
+        # found a matching prefix
+        func_stripname "$func_relative_path_tlibdir" '' "$func_relative_path_tbindir"
+        func_relative_path_tcancelled=$func_stripname_result
+        if test -z "$func_relative_path_result"; then
+          func_relative_path_result=.
+        fi
+        break
+        ;;
+      *)
+        func_dirname $func_relative_path_tlibdir
+        func_relative_path_tlibdir=${func_dirname_result}
+        if test "x$func_relative_path_tlibdir" = x ; then
+          # Have to descend all the way to the root!
+          func_relative_path_result=../$func_relative_path_result
+          func_relative_path_tcancelled=$func_relative_path_tbindir
+          break
+        fi
+        func_relative_path_result=../$func_relative_path_result
+        ;;
+    esac
+  done
+
+  # Now calculate path; take care to avoid doubling-up slashes.
+  func_stripname '' '/' "$func_relative_path_result"
+  func_relative_path_result=$func_stripname_result
+  func_stripname '/' '/' "$func_relative_path_tcancelled"
+  if test "x$func_stripname_result" != x ; then
+    func_relative_path_result=${func_relative_path_result}/${func_stripname_result}
+  fi
+
+  # Normalisation. If bindir is libdir, return empty string,
+  # else relative path ending with a slash; either way, target
+  # file name can be directly appended.
+  if test ! -z "$func_relative_path_result"; then
+    func_stripname './' '' "$func_relative_path_result/"
+    func_relative_path_result=$func_stripname_result
+  fi
+}
+
+# The name of this program:
+func_dirname_and_basename "$progpath"
+progname=$func_basename_result
+
+# Make sure we have an absolute path for reexecution:
+case $progpath in
+  [\\/]*|[A-Za-z]:\\*) ;;
+  *[\\/]*)
+     progdir=$func_dirname_result
+     progdir=`cd "$progdir" && pwd`
+     progpath="$progdir/$progname"
+     ;;
+  *)
+     save_IFS="$IFS"
+     IFS=${PATH_SEPARATOR-:}
+     for progdir in $PATH; do
+       IFS="$save_IFS"
+       test -x "$progdir/$progname" && break
+     done
+     IFS="$save_IFS"
+     test -n "$progdir" || progdir=`pwd`
+     progpath="$progdir/$progname"
+     ;;
+esac
+
+# Sed substitution that helps us do robust quoting.  It backslashifies
+# metacharacters that are still active within double-quoted strings.
+Xsed="${SED}"' -e 1s/^X//'
+sed_quote_subst='s/\([`"$\\]\)/\\\1/g'
+
+# Same as above, but do not quote variable references.
+double_quote_subst='s/\(["`\\]\)/\\\1/g'
+
+# Sed substitution that turns a string into a regex matching for the
+# string literally.
+sed_make_literal_regex='s,[].[^$\\*\/],\\&,g'
+
+# Sed substitution that converts a w32 file name or path
+# which contains forward slashes, into one that contains
+# (escaped) backslashes.  A very naive implementation.
+lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g'
+
+# Re-`\' parameter expansions in output of double_quote_subst that were
+# `\'-ed in input to the same.  If an odd number of `\' preceded a '$'
+# in input to double_quote_subst, that '$' was protected from expansion.
+# Since each input `\' is now two `\'s, look for any number of runs of
+# four `\'s followed by two `\'s and then a '$'.  `\' that '$'.
+bs='\\'
+bs2='\\\\'
+bs4='\\\\\\\\'
+dollar='\$'
+sed_double_backslash="\
+  s/$bs4/&\\
+/g
+  s/^$bs2$dollar/$bs&/
+  s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g
+  s/\n//g"
+
+# Standard options:
+opt_dry_run=false
+opt_help=false
+opt_quiet=false
+opt_verbose=false
+opt_warning=:
+
+# func_echo arg...
+# Echo program name prefixed message, along with the current mode
+# name if it has been set yet.
+func_echo ()
+{
+    $ECHO "$progname: ${opt_mode+$opt_mode: }$*"
+}
+
+# func_verbose arg...
+# Echo program name prefixed message in verbose mode only.
+func_verbose ()
+{
+    $opt_verbose && func_echo ${1+"$@"}
+
+    # A bug in bash halts the script if the last line of a function
+    # fails when set -e is in force, so we need another command to
+    # work around that:
+    :
+}
+
+# func_echo_all arg...
+# Invoke $ECHO with all args, space-separated.
+func_echo_all ()
+{
+    $ECHO "$*"
+}
+
+# func_error arg...
+# Echo program name prefixed message to standard error.
+func_error ()
+{
+    $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2
+}
+
+# func_warning arg...
+# Echo program name prefixed warning message to standard error.
+func_warning ()
+{
+    $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2
+
+    # bash bug again:
+    :
+}
+
+# func_fatal_error arg...
+# Echo program name prefixed message to standard error, and exit.
+func_fatal_error ()
+{
+    func_error ${1+"$@"}
+    exit $EXIT_FAILURE
+}
+
+# func_fatal_help arg...
+# Echo program name prefixed message to standard error, followed by
+# a help hint, and exit.
+func_fatal_help ()
+{
+    func_error ${1+"$@"}
+    func_fatal_error "$help"
+}
+help="Try \`$progname --help' for more information."  ## default
+
+
+# func_grep expression filename
+# Check whether EXPRESSION matches any line of FILENAME, without output.
+func_grep ()
+{
+    $GREP "$1" "$2" >/dev/null 2>&1
+}
+
+
+# func_mkdir_p directory-path
+# Make sure the entire path to DIRECTORY-PATH is available.
+func_mkdir_p ()
+{
+    my_directory_path="$1"
+    my_dir_list=
+
+    if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then
+
+      # Protect directory names starting with `-'
+      case $my_directory_path in
+        -*) my_directory_path="./$my_directory_path" ;;
+      esac
+
+      # While some portion of DIR does not yet exist...
+      while test ! -d "$my_directory_path"; do
+        # ...make a list in topmost first order.  Use a colon delimited
+	# list incase some portion of path contains whitespace.
+        my_dir_list="$my_directory_path:$my_dir_list"
+
+        # If the last portion added has no slash in it, the list is done
+        case $my_directory_path in */*) ;; *) break ;; esac
+
+        # ...otherwise throw away the child directory and loop
+        my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"`
+      done
+      my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'`
+
+      save_mkdir_p_IFS="$IFS"; IFS=':'
+      for my_dir in $my_dir_list; do
+	IFS="$save_mkdir_p_IFS"
+        # mkdir can fail with a `File exist' error if two processes
+        # try to create one of the directories concurrently.  Don't
+        # stop in that case!
+        $MKDIR "$my_dir" 2>/dev/null || :
+      done
+      IFS="$save_mkdir_p_IFS"
+
+      # Bail out if we (or some other process) failed to create a directory.
+      test -d "$my_directory_path" || \
+        func_fatal_error "Failed to create \`$1'"
+    fi
+}
+
+
+# func_mktempdir [string]
+# Make a temporary directory that won't clash with other running
+# libtool processes, and avoids race conditions if possible.  If
+# given, STRING is the basename for that directory.
+func_mktempdir ()
+{
+    my_template="${TMPDIR-/tmp}/${1-$progname}"
+
+    if test "$opt_dry_run" = ":"; then
+      # Return a directory name, but don't create it in dry-run mode
+      my_tmpdir="${my_template}-$$"
+    else
+
+      # If mktemp works, use that first and foremost
+      my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null`
+
+      if test ! -d "$my_tmpdir"; then
+        # Failing that, at least try and use $RANDOM to avoid a race
+        my_tmpdir="${my_template}-${RANDOM-0}$$"
+
+        save_mktempdir_umask=`umask`
+        umask 0077
+        $MKDIR "$my_tmpdir"
+        umask $save_mktempdir_umask
+      fi
+
+      # If we're not in dry-run mode, bomb out on failure
+      test -d "$my_tmpdir" || \
+        func_fatal_error "cannot create temporary directory \`$my_tmpdir'"
+    fi
+
+    $ECHO "$my_tmpdir"
+}
+
+
+# func_quote_for_eval arg
+# Aesthetically quote ARG to be evaled later.
+# This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT
+# is double-quoted, suitable for a subsequent eval, whereas
+# FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters
+# which are still active within double quotes backslashified.
+func_quote_for_eval ()
+{
+    case $1 in
+      *[\\\`\"\$]*)
+	func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;;
+      *)
+        func_quote_for_eval_unquoted_result="$1" ;;
+    esac
+
+    case $func_quote_for_eval_unquoted_result in
+      # Double-quote args containing shell metacharacters to delay
+      # word splitting, command substitution and and variable
+      # expansion for a subsequent eval.
+      # Many Bourne shells cannot handle close brackets correctly
+      # in scan sets, so we specify it separately.
+      *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \	]*|*]*|"")
+        func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\""
+        ;;
+      *)
+        func_quote_for_eval_result="$func_quote_for_eval_unquoted_result"
+    esac
+}
+
+
+# func_quote_for_expand arg
+# Aesthetically quote ARG to be evaled later; same as above,
+# but do not quote variable references.
+func_quote_for_expand ()
+{
+    case $1 in
+      *[\\\`\"]*)
+	my_arg=`$ECHO "$1" | $SED \
+	    -e "$double_quote_subst" -e "$sed_double_backslash"` ;;
+      *)
+        my_arg="$1" ;;
+    esac
+
+    case $my_arg in
+      # Double-quote args containing shell metacharacters to delay
+      # word splitting and command substitution for a subsequent eval.
+      # Many Bourne shells cannot handle close brackets correctly
+      # in scan sets, so we specify it separately.
+      *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \	]*|*]*|"")
+        my_arg="\"$my_arg\""
+        ;;
+    esac
+
+    func_quote_for_expand_result="$my_arg"
+}
+
+
+# func_show_eval cmd [fail_exp]
+# Unless opt_silent is true, then output CMD.  Then, if opt_dryrun is
+# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP
+# is given, then evaluate it.
+func_show_eval ()
+{
+    my_cmd="$1"
+    my_fail_exp="${2-:}"
+
+    ${opt_silent-false} || {
+      func_quote_for_expand "$my_cmd"
+      eval "func_echo $func_quote_for_expand_result"
+    }
+
+    if ${opt_dry_run-false}; then :; else
+      eval "$my_cmd"
+      my_status=$?
+      if test "$my_status" -eq 0; then :; else
+	eval "(exit $my_status); $my_fail_exp"
+      fi
+    fi
+}
+
+
+# func_show_eval_locale cmd [fail_exp]
+# Unless opt_silent is true, then output CMD.  Then, if opt_dryrun is
+# not true, evaluate CMD.  If the evaluation of CMD fails, and FAIL_EXP
+# is given, then evaluate it.  Use the saved locale for evaluation.
+func_show_eval_locale ()
+{
+    my_cmd="$1"
+    my_fail_exp="${2-:}"
+
+    ${opt_silent-false} || {
+      func_quote_for_expand "$my_cmd"
+      eval "func_echo $func_quote_for_expand_result"
+    }
+
+    if ${opt_dry_run-false}; then :; else
+      eval "$lt_user_locale
+	    $my_cmd"
+      my_status=$?
+      eval "$lt_safe_locale"
+      if test "$my_status" -eq 0; then :; else
+	eval "(exit $my_status); $my_fail_exp"
+      fi
+    fi
+}
+
+# func_tr_sh
+# Turn $1 into a string suitable for a shell variable name.
+# Result is stored in $func_tr_sh_result.  All characters
+# not in the set a-zA-Z0-9_ are replaced with '_'. Further,
+# if $1 begins with a digit, a '_' is prepended as well.
+func_tr_sh ()
+{
+  case $1 in
+  [0-9]* | *[!a-zA-Z0-9_]*)
+    func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'`
+    ;;
+  * )
+    func_tr_sh_result=$1
+    ;;
+  esac
+}
+
+
+# func_version
+# Echo version message to standard output and exit.
+func_version ()
+{
+    $opt_debug
+
+    $SED -n '/(C)/!b go
+	:more
+	/\./!{
+	  N
+	  s/\n# / /
+	  b more
+	}
+	:go
+	/^# '$PROGRAM' (GNU /,/# warranty; / {
+        s/^# //
+	s/^# *$//
+        s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/
+        p
+     }' < "$progpath"
+     exit $?
+}
+
+# func_usage
+# Echo short help message to standard output and exit.
+func_usage ()
+{
+    $opt_debug
+
+    $SED -n '/^# Usage:/,/^#  *.*--help/ {
+        s/^# //
+	s/^# *$//
+	s/\$progname/'$progname'/
+	p
+    }' < "$progpath"
+    echo
+    $ECHO "run \`$progname --help | more' for full usage"
+    exit $?
+}
+
+# func_help [NOEXIT]
+# Echo long help message to standard output and exit,
+# unless 'noexit' is passed as argument.
+func_help ()
+{
+    $opt_debug
+
+    $SED -n '/^# Usage:/,/# Report bugs to/ {
+	:print
+        s/^# //
+	s/^# *$//
+	s*\$progname*'$progname'*
+	s*\$host*'"$host"'*
+	s*\$SHELL*'"$SHELL"'*
+	s*\$LTCC*'"$LTCC"'*
+	s*\$LTCFLAGS*'"$LTCFLAGS"'*
+	s*\$LD*'"$LD"'*
+	s/\$with_gnu_ld/'"$with_gnu_ld"'/
+	s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/
+	s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/
+	p
+	d
+     }
+     /^# .* home page:/b print
+     /^# General help using/b print
+     ' < "$progpath"
+    ret=$?
+    if test -z "$1"; then
+      exit $ret
+    fi
+}
+
+# func_missing_arg argname
+# Echo program name prefixed message to standard error and set global
+# exit_cmd.
+func_missing_arg ()
+{
+    $opt_debug
+
+    func_error "missing argument for $1."
+    exit_cmd=exit
+}
+
+
+# func_split_short_opt shortopt
+# Set func_split_short_opt_name and func_split_short_opt_arg shell
+# variables after splitting SHORTOPT after the 2nd character.
+func_split_short_opt ()
+{
+    my_sed_short_opt='1s/^\(..\).*$/\1/;q'
+    my_sed_short_rest='1s/^..\(.*\)$/\1/;q'
+
+    func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"`
+    func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"`
+} # func_split_short_opt may be replaced by extended shell implementation
+
+
+# func_split_long_opt longopt
+# Set func_split_long_opt_name and func_split_long_opt_arg shell
+# variables after splitting LONGOPT at the `=' sign.
+func_split_long_opt ()
+{
+    my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q'
+    my_sed_long_arg='1s/^--[^=]*=//'
+
+    func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"`
+    func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"`
+} # func_split_long_opt may be replaced by extended shell implementation
+
+exit_cmd=:
+
+
+
+
+
+magic="%%%MAGIC variable%%%"
+magic_exe="%%%MAGIC EXE variable%%%"
+
+# Global variables.
+nonopt=
+preserve_args=
+lo2o="s/\\.lo\$/.${objext}/"
+o2lo="s/\\.${objext}\$/.lo/"
+extracted_archives=
+extracted_serial=0
+
+# If this variable is set in any of the actions, the command in it
+# will be execed at the end.  This prevents here-documents from being
+# left over by shells.
+exec_cmd=
+
+# func_append var value
+# Append VALUE to the end of shell variable VAR.
+func_append ()
+{
+    eval "${1}=\$${1}\${2}"
+} # func_append may be replaced by extended shell implementation
+
+# func_append_quoted var value
+# Quote VALUE and append to the end of shell variable VAR, separated
+# by a space.
+func_append_quoted ()
+{
+    func_quote_for_eval "${2}"
+    eval "${1}=\$${1}\\ \$func_quote_for_eval_result"
+} # func_append_quoted may be replaced by extended shell implementation
+
+
+# func_arith arithmetic-term...
+func_arith ()
+{
+    func_arith_result=`expr "${@}"`
+} # func_arith may be replaced by extended shell implementation
+
+
+# func_len string
+# STRING may not start with a hyphen.
+func_len ()
+{
+    func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len`
+} # func_len may be replaced by extended shell implementation
+
+
+# func_lo2o object
+func_lo2o ()
+{
+    func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"`
+} # func_lo2o may be replaced by extended shell implementation
+
+
+# func_xform libobj-or-source
+func_xform ()
+{
+    func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'`
+} # func_xform may be replaced by extended shell implementation
+
+
+# func_fatal_configuration arg...
+# Echo program name prefixed message to standard error, followed by
+# a configuration failure hint, and exit.
+func_fatal_configuration ()
+{
+    func_error ${1+"$@"}
+    func_error "See the $PACKAGE documentation for more information."
+    func_fatal_error "Fatal configuration error."
+}
+
+
+# func_config
+# Display the configuration for all the tags in this script.
+func_config ()
+{
+    re_begincf='^# ### BEGIN LIBTOOL'
+    re_endcf='^# ### END LIBTOOL'
+
+    # Default configuration.
+    $SED "1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\$d" < "$progpath"
+
+    # Now print the configurations for the tags.
+    for tagname in $taglist; do
+      $SED -n "/$re_begincf TAG CONFIG: $tagname\$/,/$re_endcf TAG CONFIG: $tagname\$/p" < "$progpath"
+    done
+
+    exit $?
+}
+
+# func_features
+# Display the features supported by this script.
+func_features ()
+{
+    echo "host: $host"
+    if test "$build_libtool_libs" = yes; then
+      echo "enable shared libraries"
+    else
+      echo "disable shared libraries"
+    fi
+    if test "$build_old_libs" = yes; then
+      echo "enable static libraries"
+    else
+      echo "disable static libraries"
+    fi
+
+    exit $?
+}
+
+# func_enable_tag tagname
+# Verify that TAGNAME is valid, and either flag an error and exit, or
+# enable the TAGNAME tag.  We also add TAGNAME to the global $taglist
+# variable here.
+func_enable_tag ()
+{
+  # Global variable:
+  tagname="$1"
+
+  re_begincf="^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\$"
+  re_endcf="^# ### END LIBTOOL TAG CONFIG: $tagname\$"
+  sed_extractcf="/$re_begincf/,/$re_endcf/p"
+
+  # Validate tagname.
+  case $tagname in
+    *[!-_A-Za-z0-9,/]*)
+      func_fatal_error "invalid tag name: $tagname"
+      ;;
+  esac
+
+  # Don't test for the "default" C tag, as we know it's
+  # there but not specially marked.
+  case $tagname in
+    CC) ;;
+    *)
+      if $GREP "$re_begincf" "$progpath" >/dev/null 2>&1; then
+	taglist="$taglist $tagname"
+
+	# Evaluate the configuration.  Be careful to quote the path
+	# and the sed script, to avoid splitting on whitespace, but
+	# also don't use non-portable quotes within backquotes within
+	# quotes we have to do it in 2 steps:
+	extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"`
+	eval "$extractedcf"
+      else
+	func_error "ignoring unknown tag $tagname"
+      fi
+      ;;
+  esac
+}
+
+# func_check_version_match
+# Ensure that we are using m4 macros, and libtool script from the same
+# release of libtool.
+func_check_version_match ()
+{
+  if test "$package_revision" != "$macro_revision"; then
+    if test "$VERSION" != "$macro_version"; then
+      if test -z "$macro_version"; then
+        cat >&2 <<_LT_EOF
+$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the
+$progname: definition of this LT_INIT comes from an older release.
+$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION
+$progname: and run autoconf again.
+_LT_EOF
+      else
+        cat >&2 <<_LT_EOF
+$progname: Version mismatch error.  This is $PACKAGE $VERSION, but the
+$progname: definition of this LT_INIT comes from $PACKAGE $macro_version.
+$progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION
+$progname: and run autoconf again.
+_LT_EOF
+      fi
+    else
+      cat >&2 <<_LT_EOF
+$progname: Version mismatch error.  This is $PACKAGE $VERSION, revision $package_revision,
+$progname: but the definition of this LT_INIT comes from revision $macro_revision.
+$progname: You should recreate aclocal.m4 with macros from revision $package_revision
+$progname: of $PACKAGE $VERSION and run autoconf again.
+_LT_EOF
+    fi
+
+    exit $EXIT_MISMATCH
+  fi
+}
+
+
+# Shorthand for --mode=foo, only valid as the first argument
+case $1 in
+clean|clea|cle|cl)
+  shift; set dummy --mode clean ${1+"$@"}; shift
+  ;;
+compile|compil|compi|comp|com|co|c)
+  shift; set dummy --mode compile ${1+"$@"}; shift
+  ;;
+execute|execut|execu|exec|exe|ex|e)
+  shift; set dummy --mode execute ${1+"$@"}; shift
+  ;;
+finish|finis|fini|fin|fi|f)
+  shift; set dummy --mode finish ${1+"$@"}; shift
+  ;;
+install|instal|insta|inst|ins|in|i)
+  shift; set dummy --mode install ${1+"$@"}; shift
+  ;;
+link|lin|li|l)
+  shift; set dummy --mode link ${1+"$@"}; shift
+  ;;
+uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u)
+  shift; set dummy --mode uninstall ${1+"$@"}; shift
+  ;;
+esac
+
+
+
+# Option defaults:
+opt_debug=:
+opt_dry_run=false
+opt_config=false
+opt_preserve_dup_deps=false
+opt_features=false
+opt_finish=false
+opt_help=false
+opt_help_all=false
+opt_silent=:
+opt_warning=:
+opt_verbose=:
+opt_silent=false
+opt_verbose=false
+
+
+# Parse options once, thoroughly.  This comes as soon as possible in the
+# script to make things like `--version' happen as quickly as we can.
+{
+  # this just eases exit handling
+  while test $# -gt 0; do
+    opt="$1"
+    shift
+    case $opt in
+      --debug|-x)	opt_debug='set -x'
+			func_echo "enabling shell trace mode"
+			$opt_debug
+			;;
+      --dry-run|--dryrun|-n)
+			opt_dry_run=:
+			;;
+      --config)
+			opt_config=:
+func_config
+			;;
+      --dlopen|-dlopen)
+			optarg="$1"
+			opt_dlopen="${opt_dlopen+$opt_dlopen
+}$optarg"
+			shift
+			;;
+      --preserve-dup-deps)
+			opt_preserve_dup_deps=:
+			;;
+      --features)
+			opt_features=:
+func_features
+			;;
+      --finish)
+			opt_finish=:
+set dummy --mode finish ${1+"$@"}; shift
+			;;
+      --help)
+			opt_help=:
+			;;
+      --help-all)
+			opt_help_all=:
+opt_help=': help-all'
+			;;
+      --mode)
+			test $# = 0 && func_missing_arg $opt && break
+			optarg="$1"
+			opt_mode="$optarg"
+case $optarg in
+  # Valid mode arguments:
+  clean|compile|execute|finish|install|link|relink|uninstall) ;;
+
+  # Catch anything else as an error
+  *) func_error "invalid argument for $opt"
+     exit_cmd=exit
+     break
+     ;;
+esac
+			shift
+			;;
+      --no-silent|--no-quiet)
+			opt_silent=false
+func_append preserve_args " $opt"
+			;;
+      --no-warning|--no-warn)
+			opt_warning=false
+func_append preserve_args " $opt"
+			;;
+      --no-verbose)
+			opt_verbose=false
+func_append preserve_args " $opt"
+			;;
+      --silent|--quiet)
+			opt_silent=:
+func_append preserve_args " $opt"
+        opt_verbose=false
+			;;
+      --verbose|-v)
+			opt_verbose=:
+func_append preserve_args " $opt"
+opt_silent=false
+			;;
+      --tag)
+			test $# = 0 && func_missing_arg $opt && break
+			optarg="$1"
+			opt_tag="$optarg"
+func_append preserve_args " $opt $optarg"
+func_enable_tag "$optarg"
+			shift
+			;;
+
+      -\?|-h)		func_usage				;;
+      --help)		func_help				;;
+      --version)	func_version				;;
+
+      # Separate optargs to long options:
+      --*=*)
+			func_split_long_opt "$opt"
+			set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"}
+			shift
+			;;
+
+      # Separate non-argument short options:
+      -\?*|-h*|-n*|-v*)
+			func_split_short_opt "$opt"
+			set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"}
+			shift
+			;;
+
+      --)		break					;;
+      -*)		func_fatal_help "unrecognized option \`$opt'" ;;
+      *)		set dummy "$opt" ${1+"$@"};	shift; break  ;;
+    esac
+  done
+
+  # Validate options:
+
+  # save first non-option argument
+  if test "$#" -gt 0; then
+    nonopt="$opt"
+    shift
+  fi
+
+  # preserve --debug
+  test "$opt_debug" = : || func_append preserve_args " --debug"
+
+  case $host in
+    *cygwin* | *mingw* | *pw32* | *cegcc*)
+      # don't eliminate duplications in $postdeps and $predeps
+      opt_duplicate_compiler_generated_deps=:
+      ;;
+    *)
+      opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps
+      ;;
+  esac
+
+  $opt_help || {
+    # Sanity checks first:
+    func_check_version_match
+
+    if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then
+      func_fatal_configuration "not configured to build any kind of library"
+    fi
+
+    # Darwin sucks
+    eval std_shrext=\"$shrext_cmds\"
+
+    # Only execute mode is allowed to have -dlopen flags.
+    if test -n "$opt_dlopen" && test "$opt_mode" != execute; then
+      func_error "unrecognized option \`-dlopen'"
+      $ECHO "$help" 1>&2
+      exit $EXIT_FAILURE
+    fi
+
+    # Change the help message to a mode-specific one.
+    generic_help="$help"
+    help="Try \`$progname --help --mode=$opt_mode' for more information."
+  }
+
+
+  # Bail if the options were screwed
+  $exit_cmd $EXIT_FAILURE
+}
+
+
+
+
+## ----------- ##
+##    Main.    ##
+## ----------- ##
+
+# func_lalib_p file
+# True iff FILE is a libtool `.la' library or `.lo' object file.
+# This function is only a basic sanity check; it will hardly flush out
+# determined imposters.
+func_lalib_p ()
+{
+    test -f "$1" &&
+      $SED -e 4q "$1" 2>/dev/null \
+        | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1
+}
+
+# func_lalib_unsafe_p file
+# True iff FILE is a libtool `.la' library or `.lo' object file.
+# This function implements the same check as func_lalib_p without
+# resorting to external programs.  To this end, it redirects stdin and
+# closes it afterwards, without saving the original file descriptor.
+# As a safety measure, use it only where a negative result would be
+# fatal anyway.  Works if `file' does not exist.
+func_lalib_unsafe_p ()
+{
+    lalib_p=no
+    if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then
+	for lalib_p_l in 1 2 3 4
+	do
+	    read lalib_p_line
+	    case "$lalib_p_line" in
+		\#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;;
+	    esac
+	done
+	exec 0<&5 5<&-
+    fi
+    test "$lalib_p" = yes
+}
+
+# func_ltwrapper_script_p file
+# True iff FILE is a libtool wrapper script
+# This function is only a basic sanity check; it will hardly flush out
+# determined imposters.
+func_ltwrapper_script_p ()
+{
+    func_lalib_p "$1"
+}
+
+# func_ltwrapper_executable_p file
+# True iff FILE is a libtool wrapper executable
+# This function is only a basic sanity check; it will hardly flush out
+# determined imposters.
+func_ltwrapper_executable_p ()
+{
+    func_ltwrapper_exec_suffix=
+    case $1 in
+    *.exe) ;;
+    *) func_ltwrapper_exec_suffix=.exe ;;
+    esac
+    $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1
+}
+
+# func_ltwrapper_scriptname file
+# Assumes file is an ltwrapper_executable
+# uses $file to determine the appropriate filename for a
+# temporary ltwrapper_script.
+func_ltwrapper_scriptname ()
+{
+    func_dirname_and_basename "$1" "" "."
+    func_stripname '' '.exe' "$func_basename_result"
+    func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper"
+}
+
+# func_ltwrapper_p file
+# True iff FILE is a libtool wrapper script or wrapper executable
+# This function is only a basic sanity check; it will hardly flush out
+# determined imposters.
+func_ltwrapper_p ()
+{
+    func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1"
+}
+
+
+# func_execute_cmds commands fail_cmd
+# Execute tilde-delimited COMMANDS.
+# If FAIL_CMD is given, eval that upon failure.
+# FAIL_CMD may read-access the current command in variable CMD!
+func_execute_cmds ()
+{
+    $opt_debug
+    save_ifs=$IFS; IFS='~'
+    for cmd in $1; do
+      IFS=$save_ifs
+      eval cmd=\"$cmd\"
+      func_show_eval "$cmd" "${2-:}"
+    done
+    IFS=$save_ifs
+}
+
+
+# func_source file
+# Source FILE, adding directory component if necessary.
+# Note that it is not necessary on cygwin/mingw to append a dot to
+# FILE even if both FILE and FILE.exe exist: automatic-append-.exe
+# behavior happens only for exec(3), not for open(2)!  Also, sourcing
+# `FILE.' does not work on cygwin managed mounts.
+func_source ()
+{
+    $opt_debug
+    case $1 in
+    */* | *\\*)	. "$1" ;;
+    *)		. "./$1" ;;
+    esac
+}
+
+
+# func_resolve_sysroot PATH
+# Replace a leading = in PATH with a sysroot.  Store the result into
+# func_resolve_sysroot_result
+func_resolve_sysroot ()
+{
+  func_resolve_sysroot_result=$1
+  case $func_resolve_sysroot_result in
+  =*)
+    func_stripname '=' '' "$func_resolve_sysroot_result"
+    func_resolve_sysroot_result=$lt_sysroot$func_stripname_result
+    ;;
+  esac
+}
+
+# func_replace_sysroot PATH
+# If PATH begins with the sysroot, replace it with = and
+# store the result into func_replace_sysroot_result.
+func_replace_sysroot ()
+{
+  case "$lt_sysroot:$1" in
+  ?*:"$lt_sysroot"*)
+    func_stripname "$lt_sysroot" '' "$1"
+    func_replace_sysroot_result="=$func_stripname_result"
+    ;;
+  *)
+    # Including no sysroot.
+    func_replace_sysroot_result=$1
+    ;;
+  esac
+}
+
+# func_infer_tag arg
+# Infer tagged configuration to use if any are available and
+# if one wasn't chosen via the "--tag" command line option.
+# Only attempt this if the compiler in the base compile
+# command doesn't match the default compiler.
+# arg is usually of the form 'gcc ...'
+func_infer_tag ()
+{
+    $opt_debug
+    if test -n "$available_tags" && test -z "$tagname"; then
+      CC_quoted=
+      for arg in $CC; do
+	func_append_quoted CC_quoted "$arg"
+      done
+      CC_expanded=`func_echo_all $CC`
+      CC_quoted_expanded=`func_echo_all $CC_quoted`
+      case $@ in
+      # Blanks in the command may have been stripped by the calling shell,
+      # but not from the CC environment variable when configure was run.
+      " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \
+      " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) ;;
+      # Blanks at the start of $base_compile will cause this to fail
+      # if we don't check for them as well.
+      *)
+	for z in $available_tags; do
+	  if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then
+	    # Evaluate the configuration.
+	    eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`"
+	    CC_quoted=
+	    for arg in $CC; do
+	      # Double-quote args containing other shell metacharacters.
+	      func_append_quoted CC_quoted "$arg"
+	    done
+	    CC_expanded=`func_echo_all $CC`
+	    CC_quoted_expanded=`func_echo_all $CC_quoted`
+	    case "$@ " in
+	    " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \
+	    " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*)
+	      # The compiler in the base compile command matches
+	      # the one in the tagged configuration.
+	      # Assume this is the tagged configuration we want.
+	      tagname=$z
+	      break
+	      ;;
+	    esac
+	  fi
+	done
+	# If $tagname still isn't set, then no tagged configuration
+	# was found and let the user know that the "--tag" command
+	# line option must be used.
+	if test -z "$tagname"; then
+	  func_echo "unable to infer tagged configuration"
+	  func_fatal_error "specify a tag with \`--tag'"
+#	else
+#	  func_verbose "using $tagname tagged configuration"
+	fi
+	;;
+      esac
+    fi
+}
+
+
+
+# func_write_libtool_object output_name pic_name nonpic_name
+# Create a libtool object file (analogous to a ".la" file),
+# but don't create it if we're doing a dry run.
+func_write_libtool_object ()
+{
+    write_libobj=${1}
+    if test "$build_libtool_libs" = yes; then
+      write_lobj=\'${2}\'
+    else
+      write_lobj=none
+    fi
+
+    if test "$build_old_libs" = yes; then
+      write_oldobj=\'${3}\'
+    else
+      write_oldobj=none
+    fi
+
+    $opt_dry_run || {
+      cat >${write_libobj}T <<EOF
+# $write_libobj - a libtool object file
+# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# Name of the PIC object.
+pic_object=$write_lobj
+
+# Name of the non-PIC object
+non_pic_object=$write_oldobj
+
+EOF
+      $MV "${write_libobj}T" "${write_libobj}"
+    }
+}
+
+
+##################################################
+# FILE NAME AND PATH CONVERSION HELPER FUNCTIONS #
+##################################################
+
+# func_convert_core_file_wine_to_w32 ARG
+# Helper function used by file name conversion functions when $build is *nix,
+# and $host is mingw, cygwin, or some other w32 environment. Relies on a
+# correctly configured wine environment available, with the winepath program
+# in $build's $PATH.
+#
+# ARG is the $build file name to be converted to w32 format.
+# Result is available in $func_convert_core_file_wine_to_w32_result, and will
+# be empty on error (or when ARG is empty)
+func_convert_core_file_wine_to_w32 ()
+{
+  $opt_debug
+  func_convert_core_file_wine_to_w32_result="$1"
+  if test -n "$1"; then
+    # Unfortunately, winepath does not exit with a non-zero error code, so we
+    # are forced to check the contents of stdout. On the other hand, if the
+    # command is not found, the shell will set an exit code of 127 and print
+    # *an error message* to stdout. So we must check for both error code of
+    # zero AND non-empty stdout, which explains the odd construction:
+    func_convert_core_file_wine_to_w32_tmp=`winepath -w "$1" 2>/dev/null`
+    if test "$?" -eq 0 && test -n "${func_convert_core_file_wine_to_w32_tmp}"; then
+      func_convert_core_file_wine_to_w32_result=`$ECHO "$func_convert_core_file_wine_to_w32_tmp" |
+        $SED -e "$lt_sed_naive_backslashify"`
+    else
+      func_convert_core_file_wine_to_w32_result=
+    fi
+  fi
+}
+# end: func_convert_core_file_wine_to_w32
+
+
+# func_convert_core_path_wine_to_w32 ARG
+# Helper function used by path conversion functions when $build is *nix, and
+# $host is mingw, cygwin, or some other w32 environment. Relies on a correctly
+# configured wine environment available, with the winepath program in $build's
+# $PATH. Assumes ARG has no leading or trailing path separator characters.
+#
+# ARG is path to be converted from $build format to win32.
+# Result is available in $func_convert_core_path_wine_to_w32_result.
+# Unconvertible file (directory) names in ARG are skipped; if no directory names
+# are convertible, then the result may be empty.
+func_convert_core_path_wine_to_w32 ()
+{
+  $opt_debug
+  # unfortunately, winepath doesn't convert paths, only file names
+  func_convert_core_path_wine_to_w32_result=""
+  if test -n "$1"; then
+    oldIFS=$IFS
+    IFS=:
+    for func_convert_core_path_wine_to_w32_f in $1; do
+      IFS=$oldIFS
+      func_convert_core_file_wine_to_w32 "$func_convert_core_path_wine_to_w32_f"
+      if test -n "$func_convert_core_file_wine_to_w32_result" ; then
+        if test -z "$func_convert_core_path_wine_to_w32_result"; then
+          func_convert_core_path_wine_to_w32_result="$func_convert_core_file_wine_to_w32_result"
+        else
+          func_append func_convert_core_path_wine_to_w32_result ";$func_convert_core_file_wine_to_w32_result"
+        fi
+      fi
+    done
+    IFS=$oldIFS
+  fi
+}
+# end: func_convert_core_path_wine_to_w32
+
+
+# func_cygpath ARGS...
+# Wrapper around calling the cygpath program via LT_CYGPATH. This is used when
+# when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2)
+# $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or
+# (2), returns the Cygwin file name or path in func_cygpath_result (input
+# file name or path is assumed to be in w32 format, as previously converted
+# from $build's *nix or MSYS format). In case (3), returns the w32 file name
+# or path in func_cygpath_result (input file name or path is assumed to be in
+# Cygwin format). Returns an empty string on error.
+#
+# ARGS are passed to cygpath, with the last one being the file name or path to
+# be converted.
+#
+# Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH
+# environment variable; do not put it in $PATH.
+func_cygpath ()
+{
+  $opt_debug
+  if test -n "$LT_CYGPATH" && test -f "$LT_CYGPATH"; then
+    func_cygpath_result=`$LT_CYGPATH "$@" 2>/dev/null`
+    if test "$?" -ne 0; then
+      # on failure, ensure result is empty
+      func_cygpath_result=
+    fi
+  else
+    func_cygpath_result=
+    func_error "LT_CYGPATH is empty or specifies non-existent file: \`$LT_CYGPATH'"
+  fi
+}
+#end: func_cygpath
+
+
+# func_convert_core_msys_to_w32 ARG
+# Convert file name or path ARG from MSYS format to w32 format.  Return
+# result in func_convert_core_msys_to_w32_result.
+func_convert_core_msys_to_w32 ()
+{
+  $opt_debug
+  # awkward: cmd appends spaces to result
+  func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null |
+    $SED -e 's/[ ]*$//' -e "$lt_sed_naive_backslashify"`
+}
+#end: func_convert_core_msys_to_w32
+
+
+# func_convert_file_check ARG1 ARG2
+# Verify that ARG1 (a file name in $build format) was converted to $host
+# format in ARG2. Otherwise, emit an error message, but continue (resetting
+# func_to_host_file_result to ARG1).
+func_convert_file_check ()
+{
+  $opt_debug
+  if test -z "$2" && test -n "$1" ; then
+    func_error "Could not determine host file name corresponding to"
+    func_error "  \`$1'"
+    func_error "Continuing, but uninstalled executables may not work."
+    # Fallback:
+    func_to_host_file_result="$1"
+  fi
+}
+# end func_convert_file_check
+
+
+# func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH
+# Verify that FROM_PATH (a path in $build format) was converted to $host
+# format in TO_PATH. Otherwise, emit an error message, but continue, resetting
+# func_to_host_file_result to a simplistic fallback value (see below).
+func_convert_path_check ()
+{
+  $opt_debug
+  if test -z "$4" && test -n "$3"; then
+    func_error "Could not determine the host path corresponding to"
+    func_error "  \`$3'"
+    func_error "Continuing, but uninstalled executables may not work."
+    # Fallback.  This is a deliberately simplistic "conversion" and
+    # should not be "improved".  See libtool.info.
+    if test "x$1" != "x$2"; then
+      lt_replace_pathsep_chars="s|$1|$2|g"
+      func_to_host_path_result=`echo "$3" |
+        $SED -e "$lt_replace_pathsep_chars"`
+    else
+      func_to_host_path_result="$3"
+    fi
+  fi
+}
+# end func_convert_path_check
+
+
+# func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG
+# Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT
+# and appending REPL if ORIG matches BACKPAT.
+func_convert_path_front_back_pathsep ()
+{
+  $opt_debug
+  case $4 in
+  $1 ) func_to_host_path_result="$3$func_to_host_path_result"
+    ;;
+  esac
+  case $4 in
+  $2 ) func_append func_to_host_path_result "$3"
+    ;;
+  esac
+}
+# end func_convert_path_front_back_pathsep
+
+
+##################################################
+# $build to $host FILE NAME CONVERSION FUNCTIONS #
+##################################################
+# invoked via `$to_host_file_cmd ARG'
+#
+# In each case, ARG is the path to be converted from $build to $host format.
+# Result will be available in $func_to_host_file_result.
+
+
+# func_to_host_file ARG
+# Converts the file name ARG from $build format to $host format. Return result
+# in func_to_host_file_result.
+func_to_host_file ()
+{
+  $opt_debug
+  $to_host_file_cmd "$1"
+}
+# end func_to_host_file
+
+
+# func_to_tool_file ARG LAZY
+# converts the file name ARG from $build format to toolchain format. Return
+# result in func_to_tool_file_result.  If the conversion in use is listed
+# in (the comma separated) LAZY, no conversion takes place.
+func_to_tool_file ()
+{
+  $opt_debug
+  case ,$2, in
+    *,"$to_tool_file_cmd",*)
+      func_to_tool_file_result=$1
+      ;;
+    *)
+      $to_tool_file_cmd "$1"
+      func_to_tool_file_result=$func_to_host_file_result
+      ;;
+  esac
+}
+# end func_to_tool_file
+
+
+# func_convert_file_noop ARG
+# Copy ARG to func_to_host_file_result.
+func_convert_file_noop ()
+{
+  func_to_host_file_result="$1"
+}
+# end func_convert_file_noop
+
+
+# func_convert_file_msys_to_w32 ARG
+# Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic
+# conversion to w32 is not available inside the cwrapper.  Returns result in
+# func_to_host_file_result.
+func_convert_file_msys_to_w32 ()
+{
+  $opt_debug
+  func_to_host_file_result="$1"
+  if test -n "$1"; then
+    func_convert_core_msys_to_w32 "$1"
+    func_to_host_file_result="$func_convert_core_msys_to_w32_result"
+  fi
+  func_convert_file_check "$1" "$func_to_host_file_result"
+}
+# end func_convert_file_msys_to_w32
+
+
+# func_convert_file_cygwin_to_w32 ARG
+# Convert file name ARG from Cygwin to w32 format.  Returns result in
+# func_to_host_file_result.
+func_convert_file_cygwin_to_w32 ()
+{
+  $opt_debug
+  func_to_host_file_result="$1"
+  if test -n "$1"; then
+    # because $build is cygwin, we call "the" cygpath in $PATH; no need to use
+    # LT_CYGPATH in this case.
+    func_to_host_file_result=`cygpath -m "$1"`
+  fi
+  func_convert_file_check "$1" "$func_to_host_file_result"
+}
+# end func_convert_file_cygwin_to_w32
+
+
+# func_convert_file_nix_to_w32 ARG
+# Convert file name ARG from *nix to w32 format.  Requires a wine environment
+# and a working winepath. Returns result in func_to_host_file_result.
+func_convert_file_nix_to_w32 ()
+{
+  $opt_debug
+  func_to_host_file_result="$1"
+  if test -n "$1"; then
+    func_convert_core_file_wine_to_w32 "$1"
+    func_to_host_file_result="$func_convert_core_file_wine_to_w32_result"
+  fi
+  func_convert_file_check "$1" "$func_to_host_file_result"
+}
+# end func_convert_file_nix_to_w32
+
+
+# func_convert_file_msys_to_cygwin ARG
+# Convert file name ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.
+# Returns result in func_to_host_file_result.
+func_convert_file_msys_to_cygwin ()
+{
+  $opt_debug
+  func_to_host_file_result="$1"
+  if test -n "$1"; then
+    func_convert_core_msys_to_w32 "$1"
+    func_cygpath -u "$func_convert_core_msys_to_w32_result"
+    func_to_host_file_result="$func_cygpath_result"
+  fi
+  func_convert_file_check "$1" "$func_to_host_file_result"
+}
+# end func_convert_file_msys_to_cygwin
+
+
+# func_convert_file_nix_to_cygwin ARG
+# Convert file name ARG from *nix to Cygwin format.  Requires Cygwin installed
+# in a wine environment, working winepath, and LT_CYGPATH set.  Returns result
+# in func_to_host_file_result.
+func_convert_file_nix_to_cygwin ()
+{
+  $opt_debug
+  func_to_host_file_result="$1"
+  if test -n "$1"; then
+    # convert from *nix to w32, then use cygpath to convert from w32 to cygwin.
+    func_convert_core_file_wine_to_w32 "$1"
+    func_cygpath -u "$func_convert_core_file_wine_to_w32_result"
+    func_to_host_file_result="$func_cygpath_result"
+  fi
+  func_convert_file_check "$1" "$func_to_host_file_result"
+}
+# end func_convert_file_nix_to_cygwin
+
+
+#############################################
+# $build to $host PATH CONVERSION FUNCTIONS #
+#############################################
+# invoked via `$to_host_path_cmd ARG'
+#
+# In each case, ARG is the path to be converted from $build to $host format.
+# The result will be available in $func_to_host_path_result.
+#
+# Path separators are also converted from $build format to $host format.  If
+# ARG begins or ends with a path separator character, it is preserved (but
+# converted to $host format) on output.
+#
+# All path conversion functions are named using the following convention:
+#   file name conversion function    : func_convert_file_X_to_Y ()
+#   path conversion function         : func_convert_path_X_to_Y ()
+# where, for any given $build/$host combination the 'X_to_Y' value is the
+# same.  If conversion functions are added for new $build/$host combinations,
+# the two new functions must follow this pattern, or func_init_to_host_path_cmd
+# will break.
+
+
+# func_init_to_host_path_cmd
+# Ensures that function "pointer" variable $to_host_path_cmd is set to the
+# appropriate value, based on the value of $to_host_file_cmd.
+to_host_path_cmd=
+func_init_to_host_path_cmd ()
+{
+  $opt_debug
+  if test -z "$to_host_path_cmd"; then
+    func_stripname 'func_convert_file_' '' "$to_host_file_cmd"
+    to_host_path_cmd="func_convert_path_${func_stripname_result}"
+  fi
+}
+
+
+# func_to_host_path ARG
+# Converts the path ARG from $build format to $host format. Return result
+# in func_to_host_path_result.
+func_to_host_path ()
+{
+  $opt_debug
+  func_init_to_host_path_cmd
+  $to_host_path_cmd "$1"
+}
+# end func_to_host_path
+
+
+# func_convert_path_noop ARG
+# Copy ARG to func_to_host_path_result.
+func_convert_path_noop ()
+{
+  func_to_host_path_result="$1"
+}
+# end func_convert_path_noop
+
+
+# func_convert_path_msys_to_w32 ARG
+# Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic
+# conversion to w32 is not available inside the cwrapper.  Returns result in
+# func_to_host_path_result.
+func_convert_path_msys_to_w32 ()
+{
+  $opt_debug
+  func_to_host_path_result="$1"
+  if test -n "$1"; then
+    # Remove leading and trailing path separator characters from ARG.  MSYS
+    # behavior is inconsistent here; cygpath turns them into '.;' and ';.';
+    # and winepath ignores them completely.
+    func_stripname : : "$1"
+    func_to_host_path_tmp1=$func_stripname_result
+    func_convert_core_msys_to_w32 "$func_to_host_path_tmp1"
+    func_to_host_path_result="$func_convert_core_msys_to_w32_result"
+    func_convert_path_check : ";" \
+      "$func_to_host_path_tmp1" "$func_to_host_path_result"
+    func_convert_path_front_back_pathsep ":*" "*:" ";" "$1"
+  fi
+}
+# end func_convert_path_msys_to_w32
+
+
+# func_convert_path_cygwin_to_w32 ARG
+# Convert path ARG from Cygwin to w32 format.  Returns result in
+# func_to_host_file_result.
+func_convert_path_cygwin_to_w32 ()
+{
+  $opt_debug
+  func_to_host_path_result="$1"
+  if test -n "$1"; then
+    # See func_convert_path_msys_to_w32:
+    func_stripname : : "$1"
+    func_to_host_path_tmp1=$func_stripname_result
+    func_to_host_path_result=`cygpath -m -p "$func_to_host_path_tmp1"`
+    func_convert_path_check : ";" \
+      "$func_to_host_path_tmp1" "$func_to_host_path_result"
+    func_convert_path_front_back_pathsep ":*" "*:" ";" "$1"
+  fi
+}
+# end func_convert_path_cygwin_to_w32
+
+
+# func_convert_path_nix_to_w32 ARG
+# Convert path ARG from *nix to w32 format.  Requires a wine environment and
+# a working winepath.  Returns result in func_to_host_file_result.
+func_convert_path_nix_to_w32 ()
+{
+  $opt_debug
+  func_to_host_path_result="$1"
+  if test -n "$1"; then
+    # See func_convert_path_msys_to_w32:
+    func_stripname : : "$1"
+    func_to_host_path_tmp1=$func_stripname_result
+    func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1"
+    func_to_host_path_result="$func_convert_core_path_wine_to_w32_result"
+    func_convert_path_check : ";" \
+      "$func_to_host_path_tmp1" "$func_to_host_path_result"
+    func_convert_path_front_back_pathsep ":*" "*:" ";" "$1"
+  fi
+}
+# end func_convert_path_nix_to_w32
+
+
+# func_convert_path_msys_to_cygwin ARG
+# Convert path ARG from MSYS to Cygwin format.  Requires LT_CYGPATH set.
+# Returns result in func_to_host_file_result.
+func_convert_path_msys_to_cygwin ()
+{
+  $opt_debug
+  func_to_host_path_result="$1"
+  if test -n "$1"; then
+    # See func_convert_path_msys_to_w32:
+    func_stripname : : "$1"
+    func_to_host_path_tmp1=$func_stripname_result
+    func_convert_core_msys_to_w32 "$func_to_host_path_tmp1"
+    func_cygpath -u -p "$func_convert_core_msys_to_w32_result"
+    func_to_host_path_result="$func_cygpath_result"
+    func_convert_path_check : : \
+      "$func_to_host_path_tmp1" "$func_to_host_path_result"
+    func_convert_path_front_back_pathsep ":*" "*:" : "$1"
+  fi
+}
+# end func_convert_path_msys_to_cygwin
+
+
+# func_convert_path_nix_to_cygwin ARG
+# Convert path ARG from *nix to Cygwin format.  Requires Cygwin installed in a
+# a wine environment, working winepath, and LT_CYGPATH set.  Returns result in
+# func_to_host_file_result.
+func_convert_path_nix_to_cygwin ()
+{
+  $opt_debug
+  func_to_host_path_result="$1"
+  if test -n "$1"; then
+    # Remove leading and trailing path separator characters from
+    # ARG. msys behavior is inconsistent here, cygpath turns them
+    # into '.;' and ';.', and winepath ignores them completely.
+    func_stripname : : "$1"
+    func_to_host_path_tmp1=$func_stripname_result
+    func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1"
+    func_cygpath -u -p "$func_convert_core_path_wine_to_w32_result"
+    func_to_host_path_result="$func_cygpath_result"
+    func_convert_path_check : : \
+      "$func_to_host_path_tmp1" "$func_to_host_path_result"
+    func_convert_path_front_back_pathsep ":*" "*:" : "$1"
+  fi
+}
+# end func_convert_path_nix_to_cygwin
+
+
+# func_mode_compile arg...
+func_mode_compile ()
+{
+    $opt_debug
+    # Get the compilation command and the source file.
+    base_compile=
+    srcfile="$nonopt"  #  always keep a non-empty value in "srcfile"
+    suppress_opt=yes
+    suppress_output=
+    arg_mode=normal
+    libobj=
+    later=
+    pie_flag=
+
+    for arg
+    do
+      case $arg_mode in
+      arg  )
+	# do not "continue".  Instead, add this to base_compile
+	lastarg="$arg"
+	arg_mode=normal
+	;;
+
+      target )
+	libobj="$arg"
+	arg_mode=normal
+	continue
+	;;
+
+      normal )
+	# Accept any command-line options.
+	case $arg in
+	-o)
+	  test -n "$libobj" && \
+	    func_fatal_error "you cannot specify \`-o' more than once"
+	  arg_mode=target
+	  continue
+	  ;;
+
+	-pie | -fpie | -fPIE)
+          func_append pie_flag " $arg"
+	  continue
+	  ;;
+
+	-shared | -static | -prefer-pic | -prefer-non-pic)
+	  func_append later " $arg"
+	  continue
+	  ;;
+
+	-no-suppress)
+	  suppress_opt=no
+	  continue
+	  ;;
+
+	-Xcompiler)
+	  arg_mode=arg  #  the next one goes into the "base_compile" arg list
+	  continue      #  The current "srcfile" will either be retained or
+	  ;;            #  replaced later.  I would guess that would be a bug.
+
+	-Wc,*)
+	  func_stripname '-Wc,' '' "$arg"
+	  args=$func_stripname_result
+	  lastarg=
+	  save_ifs="$IFS"; IFS=','
+	  for arg in $args; do
+	    IFS="$save_ifs"
+	    func_append_quoted lastarg "$arg"
+	  done
+	  IFS="$save_ifs"
+	  func_stripname ' ' '' "$lastarg"
+	  lastarg=$func_stripname_result
+
+	  # Add the arguments to base_compile.
+	  func_append base_compile " $lastarg"
+	  continue
+	  ;;
+
+	*)
+	  # Accept the current argument as the source file.
+	  # The previous "srcfile" becomes the current argument.
+	  #
+	  lastarg="$srcfile"
+	  srcfile="$arg"
+	  ;;
+	esac  #  case $arg
+	;;
+      esac    #  case $arg_mode
+
+      # Aesthetically quote the previous argument.
+      func_append_quoted base_compile "$lastarg"
+    done # for arg
+
+    case $arg_mode in
+    arg)
+      func_fatal_error "you must specify an argument for -Xcompile"
+      ;;
+    target)
+      func_fatal_error "you must specify a target with \`-o'"
+      ;;
+    *)
+      # Get the name of the library object.
+      test -z "$libobj" && {
+	func_basename "$srcfile"
+	libobj="$func_basename_result"
+      }
+      ;;
+    esac
+
+    # Recognize several different file suffixes.
+    # If the user specifies -o file.o, it is replaced with file.lo
+    case $libobj in
+    *.[cCFSifmso] | \
+    *.ada | *.adb | *.ads | *.asm | \
+    *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \
+    *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup)
+      func_xform "$libobj"
+      libobj=$func_xform_result
+      ;;
+    esac
+
+    case $libobj in
+    *.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;;
+    *)
+      func_fatal_error "cannot determine name of library object from \`$libobj'"
+      ;;
+    esac
+
+    func_infer_tag $base_compile
+
+    for arg in $later; do
+      case $arg in
+      -shared)
+	test "$build_libtool_libs" != yes && \
+	  func_fatal_configuration "can not build a shared library"
+	build_old_libs=no
+	continue
+	;;
+
+      -static)
+	build_libtool_libs=no
+	build_old_libs=yes
+	continue
+	;;
+
+      -prefer-pic)
+	pic_mode=yes
+	continue
+	;;
+
+      -prefer-non-pic)
+	pic_mode=no
+	continue
+	;;
+      esac
+    done
+
+    func_quote_for_eval "$libobj"
+    test "X$libobj" != "X$func_quote_for_eval_result" \
+      && $ECHO "X$libobj" | $GREP '[]~#^*{};<>?"'"'"'	 &()|`$[]' \
+      && func_warning "libobj name \`$libobj' may not contain shell special characters."
+    func_dirname_and_basename "$obj" "/" ""
+    objname="$func_basename_result"
+    xdir="$func_dirname_result"
+    lobj=${xdir}$objdir/$objname
+
+    test -z "$base_compile" && \
+      func_fatal_help "you must specify a compilation command"
+
+    # Delete any leftover library objects.
+    if test "$build_old_libs" = yes; then
+      removelist="$obj $lobj $libobj ${libobj}T"
+    else
+      removelist="$lobj $libobj ${libobj}T"
+    fi
+
+    # On Cygwin there's no "real" PIC flag so we must build both object types
+    case $host_os in
+    cygwin* | mingw* | pw32* | os2* | cegcc*)
+      pic_mode=default
+      ;;
+    esac
+    if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then
+      # non-PIC code in shared libraries is not supported
+      pic_mode=default
+    fi
+
+    # Calculate the filename of the output object if compiler does
+    # not support -o with -c
+    if test "$compiler_c_o" = no; then
+      output_obj=`$ECHO "$srcfile" | $SED 's%^.*/%%; s%\.[^.]*$%%'`.${objext}
+      lockfile="$output_obj.lock"
+    else
+      output_obj=
+      need_locks=no
+      lockfile=
+    fi
+
+    # Lock this critical section if it is needed
+    # We use this script file to make the link, it avoids creating a new file
+    if test "$need_locks" = yes; then
+      until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do
+	func_echo "Waiting for $lockfile to be removed"
+	sleep 2
+      done
+    elif test "$need_locks" = warn; then
+      if test -f "$lockfile"; then
+	$ECHO "\
+*** ERROR, $lockfile exists and contains:
+`cat $lockfile 2>/dev/null`
+
+This indicates that another process is trying to use the same
+temporary object file, and libtool could not work around it because
+your compiler does not support \`-c' and \`-o' together.  If you
+repeat this compilation, it may succeed, by chance, but you had better
+avoid parallel builds (make -j) in this platform, or get a better
+compiler."
+
+	$opt_dry_run || $RM $removelist
+	exit $EXIT_FAILURE
+      fi
+      func_append removelist " $output_obj"
+      $ECHO "$srcfile" > "$lockfile"
+    fi
+
+    $opt_dry_run || $RM $removelist
+    func_append removelist " $lockfile"
+    trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15
+
+    func_to_tool_file "$srcfile" func_convert_file_msys_to_w32
+    srcfile=$func_to_tool_file_result
+    func_quote_for_eval "$srcfile"
+    qsrcfile=$func_quote_for_eval_result
+
+    # Only build a PIC object if we are building libtool libraries.
+    if test "$build_libtool_libs" = yes; then
+      # Without this assignment, base_compile gets emptied.
+      fbsd_hideous_sh_bug=$base_compile
+
+      if test "$pic_mode" != no; then
+	command="$base_compile $qsrcfile $pic_flag"
+      else
+	# Don't build PIC code
+	command="$base_compile $qsrcfile"
+      fi
+
+      func_mkdir_p "$xdir$objdir"
+
+      if test -z "$output_obj"; then
+	# Place PIC objects in $objdir
+	func_append command " -o $lobj"
+      fi
+
+      func_show_eval_locale "$command"	\
+          'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE'
+
+      if test "$need_locks" = warn &&
+	 test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
+	$ECHO "\
+*** ERROR, $lockfile contains:
+`cat $lockfile 2>/dev/null`
+
+but it should contain:
+$srcfile
+
+This indicates that another process is trying to use the same
+temporary object file, and libtool could not work around it because
+your compiler does not support \`-c' and \`-o' together.  If you
+repeat this compilation, it may succeed, by chance, but you had better
+avoid parallel builds (make -j) in this platform, or get a better
+compiler."
+
+	$opt_dry_run || $RM $removelist
+	exit $EXIT_FAILURE
+      fi
+
+      # Just move the object if needed, then go on to compile the next one
+      if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then
+	func_show_eval '$MV "$output_obj" "$lobj"' \
+	  'error=$?; $opt_dry_run || $RM $removelist; exit $error'
+      fi
+
+      # Allow error messages only from the first compilation.
+      if test "$suppress_opt" = yes; then
+	suppress_output=' >/dev/null 2>&1'
+      fi
+    fi
+
+    # Only build a position-dependent object if we build old libraries.
+    if test "$build_old_libs" = yes; then
+      if test "$pic_mode" != yes; then
+	# Don't build PIC code
+	command="$base_compile $qsrcfile$pie_flag"
+      else
+	command="$base_compile $qsrcfile $pic_flag"
+      fi
+      if test "$compiler_c_o" = yes; then
+	func_append command " -o $obj"
+      fi
+
+      # Suppress compiler output if we already did a PIC compilation.
+      func_append command "$suppress_output"
+      func_show_eval_locale "$command" \
+        '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE'
+
+      if test "$need_locks" = warn &&
+	 test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
+	$ECHO "\
+*** ERROR, $lockfile contains:
+`cat $lockfile 2>/dev/null`
+
+but it should contain:
+$srcfile
+
+This indicates that another process is trying to use the same
+temporary object file, and libtool could not work around it because
+your compiler does not support \`-c' and \`-o' together.  If you
+repeat this compilation, it may succeed, by chance, but you had better
+avoid parallel builds (make -j) in this platform, or get a better
+compiler."
+
+	$opt_dry_run || $RM $removelist
+	exit $EXIT_FAILURE
+      fi
+
+      # Just move the object if needed
+      if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then
+	func_show_eval '$MV "$output_obj" "$obj"' \
+	  'error=$?; $opt_dry_run || $RM $removelist; exit $error'
+      fi
+    fi
+
+    $opt_dry_run || {
+      func_write_libtool_object "$libobj" "$objdir/$objname" "$objname"
+
+      # Unlock the critical section if it was locked
+      if test "$need_locks" != no; then
+	removelist=$lockfile
+        $RM "$lockfile"
+      fi
+    }
+
+    exit $EXIT_SUCCESS
+}
+
+$opt_help || {
+  test "$opt_mode" = compile && func_mode_compile ${1+"$@"}
+}
+
+func_mode_help ()
+{
+    # We need to display help for each of the modes.
+    case $opt_mode in
+      "")
+        # Generic help is extracted from the usage comments
+        # at the start of this file.
+        func_help
+        ;;
+
+      clean)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE...
+
+Remove files from the build directory.
+
+RM is the name of the program to use to delete files associated with each FILE
+(typically \`/bin/rm').  RM-OPTIONS are options (such as \`-f') to be passed
+to RM.
+
+If FILE is a libtool library, object or program, all the files associated
+with it are deleted. Otherwise, only FILE itself is deleted using RM."
+        ;;
+
+      compile)
+      $ECHO \
+"Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE
+
+Compile a source file into a libtool library object.
+
+This mode accepts the following additional options:
+
+  -o OUTPUT-FILE    set the output file name to OUTPUT-FILE
+  -no-suppress      do not suppress compiler output for multiple passes
+  -prefer-pic       try to build PIC objects only
+  -prefer-non-pic   try to build non-PIC objects only
+  -shared           do not build a \`.o' file suitable for static linking
+  -static           only build a \`.o' file suitable for static linking
+  -Wc,FLAG          pass FLAG directly to the compiler
+
+COMPILE-COMMAND is a command to be used in creating a \`standard' object file
+from the given SOURCEFILE.
+
+The output file name is determined by removing the directory component from
+SOURCEFILE, then substituting the C source code suffix \`.c' with the
+library object suffix, \`.lo'."
+        ;;
+
+      execute)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]...
+
+Automatically set library path, then run a program.
+
+This mode accepts the following additional options:
+
+  -dlopen FILE      add the directory containing FILE to the library path
+
+This mode sets the library path environment variable according to \`-dlopen'
+flags.
+
+If any of the ARGS are libtool executable wrappers, then they are translated
+into their corresponding uninstalled binary, and any of their required library
+directories are added to the library path.
+
+Then, COMMAND is executed, with ARGS as arguments."
+        ;;
+
+      finish)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=finish [LIBDIR]...
+
+Complete the installation of libtool libraries.
+
+Each LIBDIR is a directory that contains libtool libraries.
+
+The commands that this mode executes may require superuser privileges.  Use
+the \`--dry-run' option if you just want to see what would be executed."
+        ;;
+
+      install)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND...
+
+Install executables or libraries.
+
+INSTALL-COMMAND is the installation command.  The first component should be
+either the \`install' or \`cp' program.
+
+The following components of INSTALL-COMMAND are treated specially:
+
+  -inst-prefix-dir PREFIX-DIR  Use PREFIX-DIR as a staging area for installation
+
+The rest of the components are interpreted as arguments to that command (only
+BSD-compatible install options are recognized)."
+        ;;
+
+      link)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=link LINK-COMMAND...
+
+Link object files or libraries together to form another library, or to
+create an executable program.
+
+LINK-COMMAND is a command using the C compiler that you would use to create
+a program from several object files.
+
+The following components of LINK-COMMAND are treated specially:
+
+  -all-static       do not do any dynamic linking at all
+  -avoid-version    do not add a version suffix if possible
+  -bindir BINDIR    specify path to binaries directory (for systems where
+                    libraries must be found in the PATH setting at runtime)
+  -dlopen FILE      \`-dlpreopen' FILE if it cannot be dlopened at runtime
+  -dlpreopen FILE   link in FILE and add its symbols to lt_preloaded_symbols
+  -export-dynamic   allow symbols from OUTPUT-FILE to be resolved with dlsym(3)
+  -export-symbols SYMFILE
+                    try to export only the symbols listed in SYMFILE
+  -export-symbols-regex REGEX
+                    try to export only the symbols matching REGEX
+  -LLIBDIR          search LIBDIR for required installed libraries
+  -lNAME            OUTPUT-FILE requires the installed library libNAME
+  -module           build a library that can dlopened
+  -no-fast-install  disable the fast-install mode
+  -no-install       link a not-installable executable
+  -no-undefined     declare that a library does not refer to external symbols
+  -o OUTPUT-FILE    create OUTPUT-FILE from the specified objects
+  -objectlist FILE  Use a list of object files found in FILE to specify objects
+  -precious-files-regex REGEX
+                    don't remove output files matching REGEX
+  -release RELEASE  specify package release information
+  -rpath LIBDIR     the created library will eventually be installed in LIBDIR
+  -R[ ]LIBDIR       add LIBDIR to the runtime path of programs and libraries
+  -shared           only do dynamic linking of libtool libraries
+  -shrext SUFFIX    override the standard shared library file extension
+  -static           do not do any dynamic linking of uninstalled libtool libraries
+  -static-libtool-libs
+                    do not do any dynamic linking of libtool libraries
+  -version-info CURRENT[:REVISION[:AGE]]
+                    specify library version info [each variable defaults to 0]
+  -weak LIBNAME     declare that the target provides the LIBNAME interface
+  -Wc,FLAG
+  -Xcompiler FLAG   pass linker-specific FLAG directly to the compiler
+  -Wl,FLAG
+  -Xlinker FLAG     pass linker-specific FLAG directly to the linker
+  -XCClinker FLAG   pass link-specific FLAG to the compiler driver (CC)
+
+All other options (arguments beginning with \`-') are ignored.
+
+Every other argument is treated as a filename.  Files ending in \`.la' are
+treated as uninstalled libtool libraries, other files are standard or library
+object files.
+
+If the OUTPUT-FILE ends in \`.la', then a libtool library is created,
+only library objects (\`.lo' files) may be specified, and \`-rpath' is
+required, except when creating a convenience library.
+
+If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created
+using \`ar' and \`ranlib', or on Windows using \`lib'.
+
+If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file
+is created, otherwise an executable program is created."
+        ;;
+
+      uninstall)
+        $ECHO \
+"Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE...
+
+Remove libraries from an installation directory.
+
+RM is the name of the program to use to delete files associated with each FILE
+(typically \`/bin/rm').  RM-OPTIONS are options (such as \`-f') to be passed
+to RM.
+
+If FILE is a libtool library, all the files associated with it are deleted.
+Otherwise, only FILE itself is deleted using RM."
+        ;;
+
+      *)
+        func_fatal_help "invalid operation mode \`$opt_mode'"
+        ;;
+    esac
+
+    echo
+    $ECHO "Try \`$progname --help' for more information about other modes."
+}
+
+# Now that we've collected a possible --mode arg, show help if necessary
+if $opt_help; then
+  if test "$opt_help" = :; then
+    func_mode_help
+  else
+    {
+      func_help noexit
+      for opt_mode in compile link execute install finish uninstall clean; do
+	func_mode_help
+      done
+    } | sed -n '1p; 2,$s/^Usage:/  or: /p'
+    {
+      func_help noexit
+      for opt_mode in compile link execute install finish uninstall clean; do
+	echo
+	func_mode_help
+      done
+    } |
+    sed '1d
+      /^When reporting/,/^Report/{
+	H
+	d
+      }
+      $x
+      /information about other modes/d
+      /more detailed .*MODE/d
+      s/^Usage:.*--mode=\([^ ]*\) .*/Description of \1 mode:/'
+  fi
+  exit $?
+fi
+
+
+# func_mode_execute arg...
+func_mode_execute ()
+{
+    $opt_debug
+    # The first argument is the command name.
+    cmd="$nonopt"
+    test -z "$cmd" && \
+      func_fatal_help "you must specify a COMMAND"
+
+    # Handle -dlopen flags immediately.
+    for file in $opt_dlopen; do
+      test -f "$file" \
+	|| func_fatal_help "\`$file' is not a file"
+
+      dir=
+      case $file in
+      *.la)
+	func_resolve_sysroot "$file"
+	file=$func_resolve_sysroot_result
+
+	# Check to see that this really is a libtool archive.
+	func_lalib_unsafe_p "$file" \
+	  || func_fatal_help "\`$lib' is not a valid libtool archive"
+
+	# Read the libtool library.
+	dlname=
+	library_names=
+	func_source "$file"
+
+	# Skip this library if it cannot be dlopened.
+	if test -z "$dlname"; then
+	  # Warn if it was a shared library.
+	  test -n "$library_names" && \
+	    func_warning "\`$file' was not linked with \`-export-dynamic'"
+	  continue
+	fi
+
+	func_dirname "$file" "" "."
+	dir="$func_dirname_result"
+
+	if test -f "$dir/$objdir/$dlname"; then
+	  func_append dir "/$objdir"
+	else
+	  if test ! -f "$dir/$dlname"; then
+	    func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'"
+	  fi
+	fi
+	;;
+
+      *.lo)
+	# Just add the directory containing the .lo file.
+	func_dirname "$file" "" "."
+	dir="$func_dirname_result"
+	;;
+
+      *)
+	func_warning "\`-dlopen' is ignored for non-libtool libraries and objects"
+	continue
+	;;
+      esac
+
+      # Get the absolute pathname.
+      absdir=`cd "$dir" && pwd`
+      test -n "$absdir" && dir="$absdir"
+
+      # Now add the directory to shlibpath_var.
+      if eval "test -z \"\$$shlibpath_var\""; then
+	eval "$shlibpath_var=\"\$dir\""
+      else
+	eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\""
+      fi
+    done
+
+    # This variable tells wrapper scripts just to set shlibpath_var
+    # rather than running their programs.
+    libtool_execute_magic="$magic"
+
+    # Check if any of the arguments is a wrapper script.
+    args=
+    for file
+    do
+      case $file in
+      -* | *.la | *.lo ) ;;
+      *)
+	# Do a test to see if this is really a libtool program.
+	if func_ltwrapper_script_p "$file"; then
+	  func_source "$file"
+	  # Transform arg to wrapped name.
+	  file="$progdir/$program"
+	elif func_ltwrapper_executable_p "$file"; then
+	  func_ltwrapper_scriptname "$file"
+	  func_source "$func_ltwrapper_scriptname_result"
+	  # Transform arg to wrapped name.
+	  file="$progdir/$program"
+	fi
+	;;
+      esac
+      # Quote arguments (to preserve shell metacharacters).
+      func_append_quoted args "$file"
+    done
+
+    if test "X$opt_dry_run" = Xfalse; then
+      if test -n "$shlibpath_var"; then
+	# Export the shlibpath_var.
+	eval "export $shlibpath_var"
+      fi
+
+      # Restore saved environment variables
+      for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES
+      do
+	eval "if test \"\${save_$lt_var+set}\" = set; then
+                $lt_var=\$save_$lt_var; export $lt_var
+	      else
+		$lt_unset $lt_var
+	      fi"
+      done
+
+      # Now prepare to actually exec the command.
+      exec_cmd="\$cmd$args"
+    else
+      # Display what would be done.
+      if test -n "$shlibpath_var"; then
+	eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\""
+	echo "export $shlibpath_var"
+      fi
+      $ECHO "$cmd$args"
+      exit $EXIT_SUCCESS
+    fi
+}
+
+test "$opt_mode" = execute && func_mode_execute ${1+"$@"}
+
+
+# func_mode_finish arg...
+func_mode_finish ()
+{
+    $opt_debug
+    libs=
+    libdirs=
+    admincmds=
+
+    for opt in "$nonopt" ${1+"$@"}
+    do
+      if test -d "$opt"; then
+	func_append libdirs " $opt"
+
+      elif test -f "$opt"; then
+	if func_lalib_unsafe_p "$opt"; then
+	  func_append libs " $opt"
+	else
+	  func_warning "\`$opt' is not a valid libtool archive"
+	fi
+
+      else
+	func_fatal_error "invalid argument \`$opt'"
+      fi
+    done
+
+    if test -n "$libs"; then
+      if test -n "$lt_sysroot"; then
+        sysroot_regex=`$ECHO "$lt_sysroot" | $SED "$sed_make_literal_regex"`
+        sysroot_cmd="s/\([ ']\)$sysroot_regex/\1/g;"
+      else
+        sysroot_cmd=
+      fi
+
+      # Remove sysroot references
+      if $opt_dry_run; then
+        for lib in $libs; do
+          echo "removing references to $lt_sysroot and \`=' prefixes from $lib"
+        done
+      else
+        tmpdir=`func_mktempdir`
+        for lib in $libs; do
+	  sed -e "${sysroot_cmd} s/\([ ']-[LR]\)=/\1/g; s/\([ ']\)=/\1/g" $lib \
+	    > $tmpdir/tmp-la
+	  mv -f $tmpdir/tmp-la $lib
+	done
+        ${RM}r "$tmpdir"
+      fi
+    fi
+
+    if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then
+      for libdir in $libdirs; do
+	if test -n "$finish_cmds"; then
+	  # Do each command in the finish commands.
+	  func_execute_cmds "$finish_cmds" 'admincmds="$admincmds
+'"$cmd"'"'
+	fi
+	if test -n "$finish_eval"; then
+	  # Do the single finish_eval.
+	  eval cmds=\"$finish_eval\"
+	  $opt_dry_run || eval "$cmds" || func_append admincmds "
+       $cmds"
+	fi
+      done
+    fi
+
+    # Exit here if they wanted silent mode.
+    $opt_silent && exit $EXIT_SUCCESS
+
+    if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then
+      echo "----------------------------------------------------------------------"
+      echo "Libraries have been installed in:"
+      for libdir in $libdirs; do
+	$ECHO "   $libdir"
+      done
+      echo
+      echo "If you ever happen to want to link against installed libraries"
+      echo "in a given directory, LIBDIR, you must either use libtool, and"
+      echo "specify the full pathname of the library, or use the \`-LLIBDIR'"
+      echo "flag during linking and do at least one of the following:"
+      if test -n "$shlibpath_var"; then
+	echo "   - add LIBDIR to the \`$shlibpath_var' environment variable"
+	echo "     during execution"
+      fi
+      if test -n "$runpath_var"; then
+	echo "   - add LIBDIR to the \`$runpath_var' environment variable"
+	echo "     during linking"
+      fi
+      if test -n "$hardcode_libdir_flag_spec"; then
+	libdir=LIBDIR
+	eval flag=\"$hardcode_libdir_flag_spec\"
+
+	$ECHO "   - use the \`$flag' linker flag"
+      fi
+      if test -n "$admincmds"; then
+	$ECHO "   - have your system administrator run these commands:$admincmds"
+      fi
+      if test -f /etc/ld.so.conf; then
+	echo "   - have your system administrator add LIBDIR to \`/etc/ld.so.conf'"
+      fi
+      echo
+
+      echo "See any operating system documentation about shared libraries for"
+      case $host in
+	solaris2.[6789]|solaris2.1[0-9])
+	  echo "more information, such as the ld(1), crle(1) and ld.so(8) manual"
+	  echo "pages."
+	  ;;
+	*)
+	  echo "more information, such as the ld(1) and ld.so(8) manual pages."
+	  ;;
+      esac
+      echo "----------------------------------------------------------------------"
+    fi
+    exit $EXIT_SUCCESS
+}
+
+test "$opt_mode" = finish && func_mode_finish ${1+"$@"}
+
+
+# func_mode_install arg...
+func_mode_install ()
+{
+    $opt_debug
+    # There may be an optional sh(1) argument at the beginning of
+    # install_prog (especially on Windows NT).
+    if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh ||
+       # Allow the use of GNU shtool's install command.
+       case $nonopt in *shtool*) :;; *) false;; esac; then
+      # Aesthetically quote it.
+      func_quote_for_eval "$nonopt"
+      install_prog="$func_quote_for_eval_result "
+      arg=$1
+      shift
+    else
+      install_prog=
+      arg=$nonopt
+    fi
+
+    # The real first argument should be the name of the installation program.
+    # Aesthetically quote it.
+    func_quote_for_eval "$arg"
+    func_append install_prog "$func_quote_for_eval_result"
+    install_shared_prog=$install_prog
+    case " $install_prog " in
+      *[\\\ /]cp\ *) install_cp=: ;;
+      *) install_cp=false ;;
+    esac
+
+    # We need to accept at least all the BSD install flags.
+    dest=
+    files=
+    opts=
+    prev=
+    install_type=
+    isdir=no
+    stripme=
+    no_mode=:
+    for arg
+    do
+      arg2=
+      if test -n "$dest"; then
+	func_append files " $dest"
+	dest=$arg
+	continue
+      fi
+
+      case $arg in
+      -d) isdir=yes ;;
+      -f)
+	if $install_cp; then :; else
+	  prev=$arg
+	fi
+	;;
+      -g | -m | -o)
+	prev=$arg
+	;;
+      -s)
+	stripme=" -s"
+	continue
+	;;
+      -*)
+	;;
+      *)
+	# If the previous option needed an argument, then skip it.
+	if test -n "$prev"; then
+	  if test "x$prev" = x-m && test -n "$install_override_mode"; then
+	    arg2=$install_override_mode
+	    no_mode=false
+	  fi
+	  prev=
+	else
+	  dest=$arg
+	  continue
+	fi
+	;;
+      esac
+
+      # Aesthetically quote the argument.
+      func_quote_for_eval "$arg"
+      func_append install_prog " $func_quote_for_eval_result"
+      if test -n "$arg2"; then
+	func_quote_for_eval "$arg2"
+      fi
+      func_append install_shared_prog " $func_quote_for_eval_result"
+    done
+
+    test -z "$install_prog" && \
+      func_fatal_help "you must specify an install program"
+
+    test -n "$prev" && \
+      func_fatal_help "the \`$prev' option requires an argument"
+
+    if test -n "$install_override_mode" && $no_mode; then
+      if $install_cp; then :; else
+	func_quote_for_eval "$install_override_mode"
+	func_append install_shared_prog " -m $func_quote_for_eval_result"
+      fi
+    fi
+
+    if test -z "$files"; then
+      if test -z "$dest"; then
+	func_fatal_help "no file or destination specified"
+      else
+	func_fatal_help "you must specify a destination"
+      fi
+    fi
+
+    # Strip any trailing slash from the destination.
+    func_stripname '' '/' "$dest"
+    dest=$func_stripname_result
+
+    # Check to see that the destination is a directory.
+    test -d "$dest" && isdir=yes
+    if test "$isdir" = yes; then
+      destdir="$dest"
+      destname=
+    else
+      func_dirname_and_basename "$dest" "" "."
+      destdir="$func_dirname_result"
+      destname="$func_basename_result"
+
+      # Not a directory, so check to see that there is only one file specified.
+      set dummy $files; shift
+      test "$#" -gt 1 && \
+	func_fatal_help "\`$dest' is not a directory"
+    fi
+    case $destdir in
+    [\\/]* | [A-Za-z]:[\\/]*) ;;
+    *)
+      for file in $files; do
+	case $file in
+	*.lo) ;;
+	*)
+	  func_fatal_help "\`$destdir' must be an absolute directory name"
+	  ;;
+	esac
+      done
+      ;;
+    esac
+
+    # This variable tells wrapper scripts just to set variables rather
+    # than running their programs.
+    libtool_install_magic="$magic"
+
+    staticlibs=
+    future_libdirs=
+    current_libdirs=
+    for file in $files; do
+
+      # Do each installation.
+      case $file in
+      *.$libext)
+	# Do the static libraries later.
+	func_append staticlibs " $file"
+	;;
+
+      *.la)
+	func_resolve_sysroot "$file"
+	file=$func_resolve_sysroot_result
+
+	# Check to see that this really is a libtool archive.
+	func_lalib_unsafe_p "$file" \
+	  || func_fatal_help "\`$file' is not a valid libtool archive"
+
+	library_names=
+	old_library=
+	relink_command=
+	func_source "$file"
+
+	# Add the libdir to current_libdirs if it is the destination.
+	if test "X$destdir" = "X$libdir"; then
+	  case "$current_libdirs " in
+	  *" $libdir "*) ;;
+	  *) func_append current_libdirs " $libdir" ;;
+	  esac
+	else
+	  # Note the libdir as a future libdir.
+	  case "$future_libdirs " in
+	  *" $libdir "*) ;;
+	  *) func_append future_libdirs " $libdir" ;;
+	  esac
+	fi
+
+	func_dirname "$file" "/" ""
+	dir="$func_dirname_result"
+	func_append dir "$objdir"
+
+	if test -n "$relink_command"; then
+	  # Determine the prefix the user has applied to our future dir.
+	  inst_prefix_dir=`$ECHO "$destdir" | $SED -e "s%$libdir\$%%"`
+
+	  # Don't allow the user to place us outside of our expected
+	  # location b/c this prevents finding dependent libraries that
+	  # are installed to the same prefix.
+	  # At present, this check doesn't affect windows .dll's that
+	  # are installed into $libdir/../bin (currently, that works fine)
+	  # but it's something to keep an eye on.
+	  test "$inst_prefix_dir" = "$destdir" && \
+	    func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir"
+
+	  if test -n "$inst_prefix_dir"; then
+	    # Stick the inst_prefix_dir data into the link command.
+	    relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"`
+	  else
+	    relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%%"`
+	  fi
+
+	  func_warning "relinking \`$file'"
+	  func_show_eval "$relink_command" \
+	    'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"'
+	fi
+
+	# See the names of the shared library.
+	set dummy $library_names; shift
+	if test -n "$1"; then
+	  realname="$1"
+	  shift
+
+	  srcname="$realname"
+	  test -n "$relink_command" && srcname="$realname"T
+
+	  # Install the shared library and build the symlinks.
+	  func_show_eval "$install_shared_prog $dir/$srcname $destdir/$realname" \
+	      'exit $?'
+	  tstripme="$stripme"
+	  case $host_os in
+	  cygwin* | mingw* | pw32* | cegcc*)
+	    case $realname in
+	    *.dll.a)
+	      tstripme=""
+	      ;;
+	    esac
+	    ;;
+	  esac
+	  if test -n "$tstripme" && test -n "$striplib"; then
+	    func_show_eval "$striplib $destdir/$realname" 'exit $?'
+	  fi
+
+	  if test "$#" -gt 0; then
+	    # Delete the old symlinks, and create new ones.
+	    # Try `ln -sf' first, because the `ln' binary might depend on
+	    # the symlink we replace!  Solaris /bin/ln does not understand -f,
+	    # so we also need to try rm && ln -s.
+	    for linkname
+	    do
+	      test "$linkname" != "$realname" \
+		&& func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })"
+	    done
+	  fi
+
+	  # Do each command in the postinstall commands.
+	  lib="$destdir/$realname"
+	  func_execute_cmds "$postinstall_cmds" 'exit $?'
+	fi
+
+	# Install the pseudo-library for information purposes.
+	func_basename "$file"
+	name="$func_basename_result"
+	instname="$dir/$name"i
+	func_show_eval "$install_prog $instname $destdir/$name" 'exit $?'
+
+	# Maybe install the static library, too.
+	test -n "$old_library" && func_append staticlibs " $dir/$old_library"
+	;;
+
+      *.lo)
+	# Install (i.e. copy) a libtool object.
+
+	# Figure out destination file name, if it wasn't already specified.
+	if test -n "$destname"; then
+	  destfile="$destdir/$destname"
+	else
+	  func_basename "$file"
+	  destfile="$func_basename_result"
+	  destfile="$destdir/$destfile"
+	fi
+
+	# Deduce the name of the destination old-style object file.
+	case $destfile in
+	*.lo)
+	  func_lo2o "$destfile"
+	  staticdest=$func_lo2o_result
+	  ;;
+	*.$objext)
+	  staticdest="$destfile"
+	  destfile=
+	  ;;
+	*)
+	  func_fatal_help "cannot copy a libtool object to \`$destfile'"
+	  ;;
+	esac
+
+	# Install the libtool object if requested.
+	test -n "$destfile" && \
+	  func_show_eval "$install_prog $file $destfile" 'exit $?'
+
+	# Install the old object if enabled.
+	if test "$build_old_libs" = yes; then
+	  # Deduce the name of the old-style object file.
+	  func_lo2o "$file"
+	  staticobj=$func_lo2o_result
+	  func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?'
+	fi
+	exit $EXIT_SUCCESS
+	;;
+
+      *)
+	# Figure out destination file name, if it wasn't already specified.
+	if test -n "$destname"; then
+	  destfile="$destdir/$destname"
+	else
+	  func_basename "$file"
+	  destfile="$func_basename_result"
+	  destfile="$destdir/$destfile"
+	fi
+
+	# If the file is missing, and there is a .exe on the end, strip it
+	# because it is most likely a libtool script we actually want to
+	# install
+	stripped_ext=""
+	case $file in
+	  *.exe)
+	    if test ! -f "$file"; then
+	      func_stripname '' '.exe' "$file"
+	      file=$func_stripname_result
+	      stripped_ext=".exe"
+	    fi
+	    ;;
+	esac
+
+	# Do a test to see if this is really a libtool program.
+	case $host in
+	*cygwin* | *mingw*)
+	    if func_ltwrapper_executable_p "$file"; then
+	      func_ltwrapper_scriptname "$file"
+	      wrapper=$func_ltwrapper_scriptname_result
+	    else
+	      func_stripname '' '.exe' "$file"
+	      wrapper=$func_stripname_result
+	    fi
+	    ;;
+	*)
+	    wrapper=$file
+	    ;;
+	esac
+	if func_ltwrapper_script_p "$wrapper"; then
+	  notinst_deplibs=
+	  relink_command=
+
+	  func_source "$wrapper"
+
+	  # Check the variables that should have been set.
+	  test -z "$generated_by_libtool_version" && \
+	    func_fatal_error "invalid libtool wrapper script \`$wrapper'"
+
+	  finalize=yes
+	  for lib in $notinst_deplibs; do
+	    # Check to see that each library is installed.
+	    libdir=
+	    if test -f "$lib"; then
+	      func_source "$lib"
+	    fi
+	    libfile="$libdir/"`$ECHO "$lib" | $SED 's%^.*/%%g'` ### testsuite: skip nested quoting test
+	    if test -n "$libdir" && test ! -f "$libfile"; then
+	      func_warning "\`$lib' has not been installed in \`$libdir'"
+	      finalize=no
+	    fi
+	  done
+
+	  relink_command=
+	  func_source "$wrapper"
+
+	  outputname=
+	  if test "$fast_install" = no && test -n "$relink_command"; then
+	    $opt_dry_run || {
+	      if test "$finalize" = yes; then
+	        tmpdir=`func_mktempdir`
+		func_basename "$file$stripped_ext"
+		file="$func_basename_result"
+	        outputname="$tmpdir/$file"
+	        # Replace the output file specification.
+	        relink_command=`$ECHO "$relink_command" | $SED 's%@OUTPUT@%'"$outputname"'%g'`
+
+	        $opt_silent || {
+	          func_quote_for_expand "$relink_command"
+		  eval "func_echo $func_quote_for_expand_result"
+	        }
+	        if eval "$relink_command"; then :
+	          else
+		  func_error "error: relink \`$file' with the above command before installing it"
+		  $opt_dry_run || ${RM}r "$tmpdir"
+		  continue
+	        fi
+	        file="$outputname"
+	      else
+	        func_warning "cannot relink \`$file'"
+	      fi
+	    }
+	  else
+	    # Install the binary that we compiled earlier.
+	    file=`$ECHO "$file$stripped_ext" | $SED "s%\([^/]*\)$%$objdir/\1%"`
+	  fi
+	fi
+
+	# remove .exe since cygwin /usr/bin/install will append another
+	# one anyway
+	case $install_prog,$host in
+	*/usr/bin/install*,*cygwin*)
+	  case $file:$destfile in
+	  *.exe:*.exe)
+	    # this is ok
+	    ;;
+	  *.exe:*)
+	    destfile=$destfile.exe
+	    ;;
+	  *:*.exe)
+	    func_stripname '' '.exe' "$destfile"
+	    destfile=$func_stripname_result
+	    ;;
+	  esac
+	  ;;
+	esac
+	func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?'
+	$opt_dry_run || if test -n "$outputname"; then
+	  ${RM}r "$tmpdir"
+	fi
+	;;
+      esac
+    done
+
+    for file in $staticlibs; do
+      func_basename "$file"
+      name="$func_basename_result"
+
+      # Set up the ranlib parameters.
+      oldlib="$destdir/$name"
+      func_to_tool_file "$oldlib" func_convert_file_msys_to_w32
+      tool_oldlib=$func_to_tool_file_result
+
+      func_show_eval "$install_prog \$file \$oldlib" 'exit $?'
+
+      if test -n "$stripme" && test -n "$old_striplib"; then
+	func_show_eval "$old_striplib $tool_oldlib" 'exit $?'
+      fi
+
+      # Do each command in the postinstall commands.
+      func_execute_cmds "$old_postinstall_cmds" 'exit $?'
+    done
+
+    test -n "$future_libdirs" && \
+      func_warning "remember to run \`$progname --finish$future_libdirs'"
+
+    if test -n "$current_libdirs"; then
+      # Maybe just do a dry run.
+      $opt_dry_run && current_libdirs=" -n$current_libdirs"
+      exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs'
+    else
+      exit $EXIT_SUCCESS
+    fi
+}
+
+test "$opt_mode" = install && func_mode_install ${1+"$@"}
+
+
+# func_generate_dlsyms outputname originator pic_p
+# Extract symbols from dlprefiles and create ${outputname}S.o with
+# a dlpreopen symbol table.
+func_generate_dlsyms ()
+{
+    $opt_debug
+    my_outputname="$1"
+    my_originator="$2"
+    my_pic_p="${3-no}"
+    my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'`
+    my_dlsyms=
+
+    if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then
+      if test -n "$NM" && test -n "$global_symbol_pipe"; then
+	my_dlsyms="${my_outputname}S.c"
+      else
+	func_error "not configured to extract global symbols from dlpreopened files"
+      fi
+    fi
+
+    if test -n "$my_dlsyms"; then
+      case $my_dlsyms in
+      "") ;;
+      *.c)
+	# Discover the nlist of each of the dlfiles.
+	nlist="$output_objdir/${my_outputname}.nm"
+
+	func_show_eval "$RM $nlist ${nlist}S ${nlist}T"
+
+	# Parse the name list into a source file.
+	func_verbose "creating $output_objdir/$my_dlsyms"
+
+	$opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\
+/* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */
+/* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */
+
+#ifdef __cplusplus
+extern \"C\" {
+#endif
+
+#if defined(__GNUC__) && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4))
+#pragma GCC diagnostic ignored \"-Wstrict-prototypes\"
+#endif
+
+/* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests.  */
+#if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE)
+/* DATA imports from DLLs on WIN32 con't be const, because runtime
+   relocations are performed -- see ld's documentation on pseudo-relocs.  */
+# define LT_DLSYM_CONST
+#elif defined(__osf__)
+/* This system does not cope well with relocations in const data.  */
+# define LT_DLSYM_CONST
+#else
+# define LT_DLSYM_CONST const
+#endif
+
+/* External symbol declarations for the compiler. */\
+"
+
+	if test "$dlself" = yes; then
+	  func_verbose "generating symbol list for \`$output'"
+
+	  $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist"
+
+	  # Add our own program objects to the symbol list.
+	  progfiles=`$ECHO "$objs$old_deplibs" | $SP2NL | $SED "$lo2o" | $NL2SP`
+	  for progfile in $progfiles; do
+	    func_to_tool_file "$progfile" func_convert_file_msys_to_w32
+	    func_verbose "extracting global C symbols from \`$func_to_tool_file_result'"
+	    $opt_dry_run || eval "$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'"
+	  done
+
+	  if test -n "$exclude_expsyms"; then
+	    $opt_dry_run || {
+	      eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T'
+	      eval '$MV "$nlist"T "$nlist"'
+	    }
+	  fi
+
+	  if test -n "$export_symbols_regex"; then
+	    $opt_dry_run || {
+	      eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T'
+	      eval '$MV "$nlist"T "$nlist"'
+	    }
+	  fi
+
+	  # Prepare the list of exported symbols
+	  if test -z "$export_symbols"; then
+	    export_symbols="$output_objdir/$outputname.exp"
+	    $opt_dry_run || {
+	      $RM $export_symbols
+	      eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"'
+	      case $host in
+	      *cygwin* | *mingw* | *cegcc* )
+                eval "echo EXPORTS "'> "$output_objdir/$outputname.def"'
+                eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"'
+	        ;;
+	      esac
+	    }
+	  else
+	    $opt_dry_run || {
+	      eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"'
+	      eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T'
+	      eval '$MV "$nlist"T "$nlist"'
+	      case $host in
+	        *cygwin* | *mingw* | *cegcc* )
+	          eval "echo EXPORTS "'> "$output_objdir/$outputname.def"'
+	          eval 'cat "$nlist" >> "$output_objdir/$outputname.def"'
+	          ;;
+	      esac
+	    }
+	  fi
+	fi
+
+	for dlprefile in $dlprefiles; do
+	  func_verbose "extracting global C symbols from \`$dlprefile'"
+	  func_basename "$dlprefile"
+	  name="$func_basename_result"
+          case $host in
+	    *cygwin* | *mingw* | *cegcc* )
+	      # if an import library, we need to obtain dlname
+	      if func_win32_import_lib_p "$dlprefile"; then
+	        func_tr_sh "$dlprefile"
+	        eval "curr_lafile=\$libfile_$func_tr_sh_result"
+	        dlprefile_dlbasename=""
+	        if test -n "$curr_lafile" && func_lalib_p "$curr_lafile"; then
+	          # Use subshell, to avoid clobbering current variable values
+	          dlprefile_dlname=`source "$curr_lafile" && echo "$dlname"`
+	          if test -n "$dlprefile_dlname" ; then
+	            func_basename "$dlprefile_dlname"
+	            dlprefile_dlbasename="$func_basename_result"
+	          else
+	            # no lafile. user explicitly requested -dlpreopen <import library>.
+	            $sharedlib_from_linklib_cmd "$dlprefile"
+	            dlprefile_dlbasename=$sharedlib_from_linklib_result
+	          fi
+	        fi
+	        $opt_dry_run || {
+	          if test -n "$dlprefile_dlbasename" ; then
+	            eval '$ECHO ": $dlprefile_dlbasename" >> "$nlist"'
+	          else
+	            func_warning "Could not compute DLL name from $name"
+	            eval '$ECHO ": $name " >> "$nlist"'
+	          fi
+	          func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32
+	          eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe |
+	            $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'"
+	        }
+	      else # not an import lib
+	        $opt_dry_run || {
+	          eval '$ECHO ": $name " >> "$nlist"'
+	          func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32
+	          eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'"
+	        }
+	      fi
+	    ;;
+	    *)
+	      $opt_dry_run || {
+	        eval '$ECHO ": $name " >> "$nlist"'
+	        func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32
+	        eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'"
+	      }
+	    ;;
+          esac
+	done
+
+	$opt_dry_run || {
+	  # Make sure we have at least an empty file.
+	  test -f "$nlist" || : > "$nlist"
+
+	  if test -n "$exclude_expsyms"; then
+	    $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T
+	    $MV "$nlist"T "$nlist"
+	  fi
+
+	  # Try sorting and uniquifying the output.
+	  if $GREP -v "^: " < "$nlist" |
+	      if sort -k 3 </dev/null >/dev/null 2>&1; then
+		sort -k 3
+	      else
+		sort +2
+	      fi |
+	      uniq > "$nlist"S; then
+	    :
+	  else
+	    $GREP -v "^: " < "$nlist" > "$nlist"S
+	  fi
+
+	  if test -f "$nlist"S; then
+	    eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"'
+	  else
+	    echo '/* NONE */' >> "$output_objdir/$my_dlsyms"
+	  fi
+
+	  echo >> "$output_objdir/$my_dlsyms" "\
+
+/* The mapping between symbol names and symbols.  */
+typedef struct {
+  const char *name;
+  void *address;
+} lt_dlsymlist;
+extern LT_DLSYM_CONST lt_dlsymlist
+lt_${my_prefix}_LTX_preloaded_symbols[];
+LT_DLSYM_CONST lt_dlsymlist
+lt_${my_prefix}_LTX_preloaded_symbols[] =
+{\
+  { \"$my_originator\", (void *) 0 },"
+
+	  case $need_lib_prefix in
+	  no)
+	    eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms"
+	    ;;
+	  *)
+	    eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms"
+	    ;;
+	  esac
+	  echo >> "$output_objdir/$my_dlsyms" "\
+  {0, (void *) 0}
+};
+
+/* This works around a problem in FreeBSD linker */
+#ifdef FREEBSD_WORKAROUND
+static const void *lt_preloaded_setup() {
+  return lt_${my_prefix}_LTX_preloaded_symbols;
+}
+#endif
+
+#ifdef __cplusplus
+}
+#endif\
+"
+	} # !$opt_dry_run
+
+	pic_flag_for_symtable=
+	case "$compile_command " in
+	*" -static "*) ;;
+	*)
+	  case $host in
+	  # compiling the symbol table file with pic_flag works around
+	  # a FreeBSD bug that causes programs to crash when -lm is
+	  # linked before any other PIC object.  But we must not use
+	  # pic_flag when linking with -static.  The problem exists in
+	  # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1.
+	  *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*)
+	    pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;;
+	  *-*-hpux*)
+	    pic_flag_for_symtable=" $pic_flag"  ;;
+	  *)
+	    if test "X$my_pic_p" != Xno; then
+	      pic_flag_for_symtable=" $pic_flag"
+	    fi
+	    ;;
+	  esac
+	  ;;
+	esac
+	symtab_cflags=
+	for arg in $LTCFLAGS; do
+	  case $arg in
+	  -pie | -fpie | -fPIE) ;;
+	  *) func_append symtab_cflags " $arg" ;;
+	  esac
+	done
+
+	# Now compile the dynamic symbol file.
+	func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?'
+
+	# Clean up the generated files.
+	func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"'
+
+	# Transform the symbol file into the correct name.
+	symfileobj="$output_objdir/${my_outputname}S.$objext"
+	case $host in
+	*cygwin* | *mingw* | *cegcc* )
+	  if test -f "$output_objdir/$my_outputname.def"; then
+	    compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"`
+	    finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"`
+	  else
+	    compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"`
+	    finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"`
+	  fi
+	  ;;
+	*)
+	  compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"`
+	  finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"`
+	  ;;
+	esac
+	;;
+      *)
+	func_fatal_error "unknown suffix for \`$my_dlsyms'"
+	;;
+      esac
+    else
+      # We keep going just in case the user didn't refer to
+      # lt_preloaded_symbols.  The linker will fail if global_symbol_pipe
+      # really was required.
+
+      # Nullify the symbol file.
+      compile_command=`$ECHO "$compile_command" | $SED "s% @SYMFILE@%%"`
+      finalize_command=`$ECHO "$finalize_command" | $SED "s% @SYMFILE@%%"`
+    fi
+}
+
+# func_win32_libid arg
+# return the library type of file 'arg'
+#
+# Need a lot of goo to handle *both* DLLs and import libs
+# Has to be a shell function in order to 'eat' the argument
+# that is supplied when $file_magic_command is called.
+# Despite the name, also deal with 64 bit binaries.
+func_win32_libid ()
+{
+  $opt_debug
+  win32_libid_type="unknown"
+  win32_fileres=`file -L $1 2>/dev/null`
+  case $win32_fileres in
+  *ar\ archive\ import\ library*) # definitely import
+    win32_libid_type="x86 archive import"
+    ;;
+  *ar\ archive*) # could be an import, or static
+    # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD.
+    if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null |
+       $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then
+      func_to_tool_file "$1" func_convert_file_msys_to_w32
+      win32_nmres=`eval $NM -f posix -A \"$func_to_tool_file_result\" |
+	$SED -n -e '
+	    1,100{
+		/ I /{
+		    s,.*,import,
+		    p
+		    q
+		}
+	    }'`
+      case $win32_nmres in
+      import*)  win32_libid_type="x86 archive import";;
+      *)        win32_libid_type="x86 archive static";;
+      esac
+    fi
+    ;;
+  *DLL*)
+    win32_libid_type="x86 DLL"
+    ;;
+  *executable*) # but shell scripts are "executable" too...
+    case $win32_fileres in
+    *MS\ Windows\ PE\ Intel*)
+      win32_libid_type="x86 DLL"
+      ;;
+    esac
+    ;;
+  esac
+  $ECHO "$win32_libid_type"
+}
+
+# func_cygming_dll_for_implib ARG
+#
+# Platform-specific function to extract the
+# name of the DLL associated with the specified
+# import library ARG.
+# Invoked by eval'ing the libtool variable
+#    $sharedlib_from_linklib_cmd
+# Result is available in the variable
+#    $sharedlib_from_linklib_result
+func_cygming_dll_for_implib ()
+{
+  $opt_debug
+  sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify "$1"`
+}
+
+# func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs
+#
+# The is the core of a fallback implementation of a
+# platform-specific function to extract the name of the
+# DLL associated with the specified import library LIBNAME.
+#
+# SECTION_NAME is either .idata$6 or .idata$7, depending
+# on the platform and compiler that created the implib.
+#
+# Echos the name of the DLL associated with the
+# specified import library.
+func_cygming_dll_for_implib_fallback_core ()
+{
+  $opt_debug
+  match_literal=`$ECHO "$1" | $SED "$sed_make_literal_regex"`
+  $OBJDUMP -s --section "$1" "$2" 2>/dev/null |
+    $SED '/^Contents of section '"$match_literal"':/{
+      # Place marker at beginning of archive member dllname section
+      s/.*/====MARK====/
+      p
+      d
+    }
+    # These lines can sometimes be longer than 43 characters, but
+    # are always uninteresting
+    /:[	 ]*file format pe[i]\{,1\}-/d
+    /^In archive [^:]*:/d
+    # Ensure marker is printed
+    /^====MARK====/p
+    # Remove all lines with less than 43 characters
+    /^.\{43\}/!d
+    # From remaining lines, remove first 43 characters
+    s/^.\{43\}//' |
+    $SED -n '
+      # Join marker and all lines until next marker into a single line
+      /^====MARK====/ b para
+      H
+      $ b para
+      b
+      :para
+      x
+      s/\n//g
+      # Remove the marker
+      s/^====MARK====//
+      # Remove trailing dots and whitespace
+      s/[\. \t]*$//
+      # Print
+      /./p' |
+    # we now have a list, one entry per line, of the stringified
+    # contents of the appropriate section of all members of the
+    # archive which possess that section. Heuristic: eliminate
+    # all those which have a first or second character that is
+    # a '.' (that is, objdump's representation of an unprintable
+    # character.) This should work for all archives with less than
+    # 0x302f exports -- but will fail for DLLs whose name actually
+    # begins with a literal '.' or a single character followed by
+    # a '.'.
+    #
+    # Of those that remain, print the first one.
+    $SED -e '/^\./d;/^.\./d;q'
+}
+
+# func_cygming_gnu_implib_p ARG
+# This predicate returns with zero status (TRUE) if
+# ARG is a GNU/binutils-style import library. Returns
+# with nonzero status (FALSE) otherwise.
+func_cygming_gnu_implib_p ()
+{
+  $opt_debug
+  func_to_tool_file "$1" func_convert_file_msys_to_w32
+  func_cygming_gnu_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'`
+  test -n "$func_cygming_gnu_implib_tmp"
+}
+
+# func_cygming_ms_implib_p ARG
+# This predicate returns with zero status (TRUE) if
+# ARG is an MS-style import library. Returns
+# with nonzero status (FALSE) otherwise.
+func_cygming_ms_implib_p ()
+{
+  $opt_debug
+  func_to_tool_file "$1" func_convert_file_msys_to_w32
+  func_cygming_ms_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $GREP '_NULL_IMPORT_DESCRIPTOR'`
+  test -n "$func_cygming_ms_implib_tmp"
+}
+
+# func_cygming_dll_for_implib_fallback ARG
+# Platform-specific function to extract the
+# name of the DLL associated with the specified
+# import library ARG.
+#
+# This fallback implementation is for use when $DLLTOOL
+# does not support the --identify-strict option.
+# Invoked by eval'ing the libtool variable
+#    $sharedlib_from_linklib_cmd
+# Result is available in the variable
+#    $sharedlib_from_linklib_result
+func_cygming_dll_for_implib_fallback ()
+{
+  $opt_debug
+  if func_cygming_gnu_implib_p "$1" ; then
+    # binutils import library
+    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' "$1"`
+  elif func_cygming_ms_implib_p "$1" ; then
+    # ms-generated import library
+    sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' "$1"`
+  else
+    # unknown
+    sharedlib_from_linklib_result=""
+  fi
+}
+
+
+# func_extract_an_archive dir oldlib
+func_extract_an_archive ()
+{
+    $opt_debug
+    f_ex_an_ar_dir="$1"; shift
+    f_ex_an_ar_oldlib="$1"
+    if test "$lock_old_archive_extraction" = yes; then
+      lockfile=$f_ex_an_ar_oldlib.lock
+      until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do
+	func_echo "Waiting for $lockfile to be removed"
+	sleep 2
+      done
+    fi
+    func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" \
+		   'stat=$?; rm -f "$lockfile"; exit $stat'
+    if test "$lock_old_archive_extraction" = yes; then
+      $opt_dry_run || rm -f "$lockfile"
+    fi
+    if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then
+     :
+    else
+      func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib"
+    fi
+}
+
+
+# func_extract_archives gentop oldlib ...
+func_extract_archives ()
+{
+    $opt_debug
+    my_gentop="$1"; shift
+    my_oldlibs=${1+"$@"}
+    my_oldobjs=""
+    my_xlib=""
+    my_xabs=""
+    my_xdir=""
+
+    for my_xlib in $my_oldlibs; do
+      # Extract the objects.
+      case $my_xlib in
+	[\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;;
+	*) my_xabs=`pwd`"/$my_xlib" ;;
+      esac
+      func_basename "$my_xlib"
+      my_xlib="$func_basename_result"
+      my_xlib_u=$my_xlib
+      while :; do
+        case " $extracted_archives " in
+	*" $my_xlib_u "*)
+	  func_arith $extracted_serial + 1
+	  extracted_serial=$func_arith_result
+	  my_xlib_u=lt$extracted_serial-$my_xlib ;;
+	*) break ;;
+	esac
+      done
+      extracted_archives="$extracted_archives $my_xlib_u"
+      my_xdir="$my_gentop/$my_xlib_u"
+
+      func_mkdir_p "$my_xdir"
+
+      case $host in
+      *-darwin*)
+	func_verbose "Extracting $my_xabs"
+	# Do not bother doing anything if just a dry run
+	$opt_dry_run || {
+	  darwin_orig_dir=`pwd`
+	  cd $my_xdir || exit $?
+	  darwin_archive=$my_xabs
+	  darwin_curdir=`pwd`
+	  darwin_base_archive=`basename "$darwin_archive"`
+	  darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true`
+	  if test -n "$darwin_arches"; then
+	    darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'`
+	    darwin_arch=
+	    func_verbose "$darwin_base_archive has multiple architectures $darwin_arches"
+	    for darwin_arch in  $darwin_arches ; do
+	      func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}"
+	      $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}"
+	      cd "unfat-$$/${darwin_base_archive}-${darwin_arch}"
+	      func_extract_an_archive "`pwd`" "${darwin_base_archive}"
+	      cd "$darwin_curdir"
+	      $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}"
+	    done # $darwin_arches
+            ## Okay now we've a bunch of thin objects, gotta fatten them up :)
+	    darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u`
+	    darwin_file=
+	    darwin_files=
+	    for darwin_file in $darwin_filelist; do
+	      darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP`
+	      $LIPO -create -output "$darwin_file" $darwin_files
+	    done # $darwin_filelist
+	    $RM -rf unfat-$$
+	    cd "$darwin_orig_dir"
+	  else
+	    cd $darwin_orig_dir
+	    func_extract_an_archive "$my_xdir" "$my_xabs"
+	  fi # $darwin_arches
+	} # !$opt_dry_run
+	;;
+      *)
+        func_extract_an_archive "$my_xdir" "$my_xabs"
+	;;
+      esac
+      my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP`
+    done
+
+    func_extract_archives_result="$my_oldobjs"
+}
+
+
+# func_emit_wrapper [arg=no]
+#
+# Emit a libtool wrapper script on stdout.
+# Don't directly open a file because we may want to
+# incorporate the script contents within a cygwin/mingw
+# wrapper executable.  Must ONLY be called from within
+# func_mode_link because it depends on a number of variables
+# set therein.
+#
+# ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR
+# variable will take.  If 'yes', then the emitted script
+# will assume that the directory in which it is stored is
+# the $objdir directory.  This is a cygwin/mingw-specific
+# behavior.
+func_emit_wrapper ()
+{
+	func_emit_wrapper_arg1=${1-no}
+
+	$ECHO "\
+#! $SHELL
+
+# $output - temporary wrapper script for $objdir/$outputname
+# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
+#
+# The $output program cannot be directly executed until all the libtool
+# libraries that it depends on are installed.
+#
+# This wrapper script should never be moved out of the build directory.
+# If it is, it will not operate correctly.
+
+# Sed substitution that helps us do robust quoting.  It backslashifies
+# metacharacters that are still active within double-quoted strings.
+sed_quote_subst='$sed_quote_subst'
+
+# Be Bourne compatible
+if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then
+  emulate sh
+  NULLCMD=:
+  # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac
+fi
+BIN_SH=xpg4; export BIN_SH # for Tru64
+DUALCASE=1; export DUALCASE # for MKS sh
+
+# The HP-UX ksh and POSIX shell print the target directory to stdout
+# if CDPATH is set.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+relink_command=\"$relink_command\"
+
+# This environment variable determines our operation mode.
+if test \"\$libtool_install_magic\" = \"$magic\"; then
+  # install mode needs the following variables:
+  generated_by_libtool_version='$macro_version'
+  notinst_deplibs='$notinst_deplibs'
+else
+  # When we are sourced in execute mode, \$file and \$ECHO are already set.
+  if test \"\$libtool_execute_magic\" != \"$magic\"; then
+    file=\"\$0\""
+
+    qECHO=`$ECHO "$ECHO" | $SED "$sed_quote_subst"`
+    $ECHO "\
+
+# A function that is used when there is no print builtin or printf.
+func_fallback_echo ()
+{
+  eval 'cat <<_LTECHO_EOF
+\$1
+_LTECHO_EOF'
+}
+    ECHO=\"$qECHO\"
+  fi
+
+# Very basic option parsing. These options are (a) specific to
+# the libtool wrapper, (b) are identical between the wrapper
+# /script/ and the wrapper /executable/ which is used only on
+# windows platforms, and (c) all begin with the string "--lt-"
+# (application programs are unlikely to have options which match
+# this pattern).
+#
+# There are only two supported options: --lt-debug and
+# --lt-dump-script. There is, deliberately, no --lt-help.
+#
+# The first argument to this parsing function should be the
+# script's $0 value, followed by "$@".
+lt_option_debug=
+func_parse_lt_options ()
+{
+  lt_script_arg0=\$0
+  shift
+  for lt_opt
+  do
+    case \"\$lt_opt\" in
+    --lt-debug) lt_option_debug=1 ;;
+    --lt-dump-script)
+        lt_dump_D=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\`
+        test \"X\$lt_dump_D\" = \"X\$lt_script_arg0\" && lt_dump_D=.
+        lt_dump_F=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%^.*/%%'\`
+        cat \"\$lt_dump_D/\$lt_dump_F\"
+        exit 0
+      ;;
+    --lt-*)
+        \$ECHO \"Unrecognized --lt- option: '\$lt_opt'\" 1>&2
+        exit 1
+      ;;
+    esac
+  done
+
+  # Print the debug banner immediately:
+  if test -n \"\$lt_option_debug\"; then
+    echo \"${outputname}:${output}:\${LINENO}: libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\" 1>&2
+  fi
+}
+
+# Used when --lt-debug. Prints its arguments to stdout
+# (redirection is the responsibility of the caller)
+func_lt_dump_args ()
+{
+  lt_dump_args_N=1;
+  for lt_arg
+  do
+    \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[\$lt_dump_args_N]: \$lt_arg\"
+    lt_dump_args_N=\`expr \$lt_dump_args_N + 1\`
+  done
+}
+
+# Core function for launching the target application
+func_exec_program_core ()
+{
+"
+  case $host in
+  # Backslashes separate directories on plain windows
+  *-*-mingw | *-*-os2* | *-cegcc*)
+    $ECHO "\
+      if test -n \"\$lt_option_debug\"; then
+        \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir\\\\\$program\" 1>&2
+        func_lt_dump_args \${1+\"\$@\"} 1>&2
+      fi
+      exec \"\$progdir\\\\\$program\" \${1+\"\$@\"}
+"
+    ;;
+
+  *)
+    $ECHO "\
+      if test -n \"\$lt_option_debug\"; then
+        \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir/\$program\" 1>&2
+        func_lt_dump_args \${1+\"\$@\"} 1>&2
+      fi
+      exec \"\$progdir/\$program\" \${1+\"\$@\"}
+"
+    ;;
+  esac
+  $ECHO "\
+      \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2
+      exit 1
+}
+
+# A function to encapsulate launching the target application
+# Strips options in the --lt-* namespace from \$@ and
+# launches target application with the remaining arguments.
+func_exec_program ()
+{
+  case \" \$* \" in
+  *\\ --lt-*)
+    for lt_wr_arg
+    do
+      case \$lt_wr_arg in
+      --lt-*) ;;
+      *) set x \"\$@\" \"\$lt_wr_arg\"; shift;;
+      esac
+      shift
+    done ;;
+  esac
+  func_exec_program_core \${1+\"\$@\"}
+}
+
+  # Parse options
+  func_parse_lt_options \"\$0\" \${1+\"\$@\"}
+
+  # Find the directory that this script lives in.
+  thisdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*$%%'\`
+  test \"x\$thisdir\" = \"x\$file\" && thisdir=.
+
+  # Follow symbolic links until we get to the real thisdir.
+  file=\`ls -ld \"\$file\" | $SED -n 's/.*-> //p'\`
+  while test -n \"\$file\"; do
+    destdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*\$%%'\`
+
+    # If there was a directory component, then change thisdir.
+    if test \"x\$destdir\" != \"x\$file\"; then
+      case \"\$destdir\" in
+      [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;;
+      *) thisdir=\"\$thisdir/\$destdir\" ;;
+      esac
+    fi
+
+    file=\`\$ECHO \"\$file\" | $SED 's%^.*/%%'\`
+    file=\`ls -ld \"\$thisdir/\$file\" | $SED -n 's/.*-> //p'\`
+  done
+
+  # Usually 'no', except on cygwin/mingw when embedded into
+  # the cwrapper.
+  WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1
+  if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then
+    # special case for '.'
+    if test \"\$thisdir\" = \".\"; then
+      thisdir=\`pwd\`
+    fi
+    # remove .libs from thisdir
+    case \"\$thisdir\" in
+    *[\\\\/]$objdir ) thisdir=\`\$ECHO \"\$thisdir\" | $SED 's%[\\\\/][^\\\\/]*$%%'\` ;;
+    $objdir )   thisdir=. ;;
+    esac
+  fi
+
+  # Try to get the absolute directory name.
+  absdir=\`cd \"\$thisdir\" && pwd\`
+  test -n \"\$absdir\" && thisdir=\"\$absdir\"
+"
+
+	if test "$fast_install" = yes; then
+	  $ECHO "\
+  program=lt-'$outputname'$exeext
+  progdir=\"\$thisdir/$objdir\"
+
+  if test ! -f \"\$progdir/\$program\" ||
+     { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\
+       test \"X\$file\" != \"X\$progdir/\$program\"; }; then
+
+    file=\"\$\$-\$program\"
+
+    if test ! -d \"\$progdir\"; then
+      $MKDIR \"\$progdir\"
+    else
+      $RM \"\$progdir/\$file\"
+    fi"
+
+	  $ECHO "\
+
+    # relink executable if necessary
+    if test -n \"\$relink_command\"; then
+      if relink_command_output=\`eval \$relink_command 2>&1\`; then :
+      else
+	$ECHO \"\$relink_command_output\" >&2
+	$RM \"\$progdir/\$file\"
+	exit 1
+      fi
+    fi
+
+    $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null ||
+    { $RM \"\$progdir/\$program\";
+      $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; }
+    $RM \"\$progdir/\$file\"
+  fi"
+	else
+	  $ECHO "\
+  program='$outputname'
+  progdir=\"\$thisdir/$objdir\"
+"
+	fi
+
+	$ECHO "\
+
+  if test -f \"\$progdir/\$program\"; then"
+
+	# fixup the dll searchpath if we need to.
+	#
+	# Fix the DLL searchpath if we need to.  Do this before prepending
+	# to shlibpath, because on Windows, both are PATH and uninstalled
+	# libraries must come first.
+	if test -n "$dllsearchpath"; then
+	  $ECHO "\
+    # Add the dll search path components to the executable PATH
+    PATH=$dllsearchpath:\$PATH
+"
+	fi
+
+	# Export our shlibpath_var if we have one.
+	if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then
+	  $ECHO "\
+    # Add our own library path to $shlibpath_var
+    $shlibpath_var=\"$temp_rpath\$$shlibpath_var\"
+
+    # Some systems cannot cope with colon-terminated $shlibpath_var
+    # The second colon is a workaround for a bug in BeOS R4 sed
+    $shlibpath_var=\`\$ECHO \"\$$shlibpath_var\" | $SED 's/::*\$//'\`
+
+    export $shlibpath_var
+"
+	fi
+
+	$ECHO "\
+    if test \"\$libtool_execute_magic\" != \"$magic\"; then
+      # Run the actual program with our arguments.
+      func_exec_program \${1+\"\$@\"}
+    fi
+  else
+    # The program doesn't exist.
+    \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2
+    \$ECHO \"This script is just a wrapper for \$program.\" 1>&2
+    \$ECHO \"See the $PACKAGE documentation for more information.\" 1>&2
+    exit 1
+  fi
+fi\
+"
+}
+
+
+# func_emit_cwrapperexe_src
+# emit the source code for a wrapper executable on stdout
+# Must ONLY be called from within func_mode_link because
+# it depends on a number of variable set therein.
+func_emit_cwrapperexe_src ()
+{
+	cat <<EOF
+
+/* $cwrappersource - temporary wrapper executable for $objdir/$outputname
+   Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
+
+   The $output program cannot be directly executed until all the libtool
+   libraries that it depends on are installed.
+
+   This wrapper executable should never be moved out of the build directory.
+   If it is, it will not operate correctly.
+*/
+EOF
+	    cat <<"EOF"
+#ifdef _MSC_VER
+# define _CRT_SECURE_NO_DEPRECATE 1
+#endif
+#include <stdio.h>
+#include <stdlib.h>
+#ifdef _MSC_VER
+# include <direct.h>
+# include <process.h>
+# include <io.h>
+#else
+# include <unistd.h>
+# include <stdint.h>
+# ifdef __CYGWIN__
+#  include <io.h>
+# endif
+#endif
+#include <malloc.h>
+#include <stdarg.h>
+#include <assert.h>
+#include <string.h>
+#include <ctype.h>
+#include <errno.h>
+#include <fcntl.h>
+#include <sys/stat.h>
+
+/* declarations of non-ANSI functions */
+#if defined(__MINGW32__)
+# ifdef __STRICT_ANSI__
+int _putenv (const char *);
+# endif
+#elif defined(__CYGWIN__)
+# ifdef __STRICT_ANSI__
+char *realpath (const char *, char *);
+int putenv (char *);
+int setenv (const char *, const char *, int);
+# endif
+/* #elif defined (other platforms) ... */
+#endif
+
+/* portability defines, excluding path handling macros */
+#if defined(_MSC_VER)
+# define setmode _setmode
+# define stat    _stat
+# define chmod   _chmod
+# define getcwd  _getcwd
+# define putenv  _putenv
+# define S_IXUSR _S_IEXEC
+# ifndef _INTPTR_T_DEFINED
+#  define _INTPTR_T_DEFINED
+#  define intptr_t int
+# endif
+#elif defined(__MINGW32__)
+# define setmode _setmode
+# define stat    _stat
+# define chmod   _chmod
+# define getcwd  _getcwd
+# define putenv  _putenv
+#elif defined(__CYGWIN__)
+# define HAVE_SETENV
+# define FOPEN_WB "wb"
+/* #elif defined (other platforms) ... */
+#endif
+
+#if defined(PATH_MAX)
+# define LT_PATHMAX PATH_MAX
+#elif defined(MAXPATHLEN)
+# define LT_PATHMAX MAXPATHLEN
+#else
+# define LT_PATHMAX 1024
+#endif
+
+#ifndef S_IXOTH
+# define S_IXOTH 0
+#endif
+#ifndef S_IXGRP
+# define S_IXGRP 0
+#endif
+
+/* path handling portability macros */
+#ifndef DIR_SEPARATOR
+# define DIR_SEPARATOR '/'
+# define PATH_SEPARATOR ':'
+#endif
+
+#if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \
+  defined (__OS2__)
+# define HAVE_DOS_BASED_FILE_SYSTEM
+# define FOPEN_WB "wb"
+# ifndef DIR_SEPARATOR_2
+#  define DIR_SEPARATOR_2 '\\'
+# endif
+# ifndef PATH_SEPARATOR_2
+#  define PATH_SEPARATOR_2 ';'
+# endif
+#endif
+
+#ifndef DIR_SEPARATOR_2
+# define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR)
+#else /* DIR_SEPARATOR_2 */
+# define IS_DIR_SEPARATOR(ch) \
+	(((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2))
+#endif /* DIR_SEPARATOR_2 */
+
+#ifndef PATH_SEPARATOR_2
+# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR)
+#else /* PATH_SEPARATOR_2 */
+# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2)
+#endif /* PATH_SEPARATOR_2 */
+
+#ifndef FOPEN_WB
+# define FOPEN_WB "w"
+#endif
+#ifndef _O_BINARY
+# define _O_BINARY 0
+#endif
+
+#define XMALLOC(type, num)      ((type *) xmalloc ((num) * sizeof(type)))
+#define XFREE(stale) do { \
+  if (stale) { free ((void *) stale); stale = 0; } \
+} while (0)
+
+#if defined(LT_DEBUGWRAPPER)
+static int lt_debug = 1;
+#else
+static int lt_debug = 0;
+#endif
+
+const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */
+
+void *xmalloc (size_t num);
+char *xstrdup (const char *string);
+const char *base_name (const char *name);
+char *find_executable (const char *wrapper);
+char *chase_symlinks (const char *pathspec);
+int make_executable (const char *path);
+int check_executable (const char *path);
+char *strendzap (char *str, const char *pat);
+void lt_debugprintf (const char *file, int line, const char *fmt, ...);
+void lt_fatal (const char *file, int line, const char *message, ...);
+static const char *nonnull (const char *s);
+static const char *nonempty (const char *s);
+void lt_setenv (const char *name, const char *value);
+char *lt_extend_str (const char *orig_value, const char *add, int to_end);
+void lt_update_exe_path (const char *name, const char *value);
+void lt_update_lib_path (const char *name, const char *value);
+char **prepare_spawn (char **argv);
+void lt_dump_script (FILE *f);
+EOF
+
+	    cat <<EOF
+volatile const char * MAGIC_EXE = "$magic_exe";
+const char * LIB_PATH_VARNAME = "$shlibpath_var";
+EOF
+
+	    if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then
+              func_to_host_path "$temp_rpath"
+	      cat <<EOF
+const char * LIB_PATH_VALUE   = "$func_to_host_path_result";
+EOF
+	    else
+	      cat <<"EOF"
+const char * LIB_PATH_VALUE   = "";
+EOF
+	    fi
+
+	    if test -n "$dllsearchpath"; then
+              func_to_host_path "$dllsearchpath:"
+	      cat <<EOF
+const char * EXE_PATH_VARNAME = "PATH";
+const char * EXE_PATH_VALUE   = "$func_to_host_path_result";
+EOF
+	    else
+	      cat <<"EOF"
+const char * EXE_PATH_VARNAME = "";
+const char * EXE_PATH_VALUE   = "";
+EOF
+	    fi
+
+	    if test "$fast_install" = yes; then
+	      cat <<EOF
+const char * TARGET_PROGRAM_NAME = "lt-$outputname"; /* hopefully, no .exe */
+EOF
+	    else
+	      cat <<EOF
+const char * TARGET_PROGRAM_NAME = "$outputname"; /* hopefully, no .exe */
+EOF
+	    fi
+
+
+	    cat <<"EOF"
+
+#define LTWRAPPER_OPTION_PREFIX         "--lt-"
+
+static const char *ltwrapper_option_prefix = LTWRAPPER_OPTION_PREFIX;
+static const char *dumpscript_opt       = LTWRAPPER_OPTION_PREFIX "dump-script";
+static const char *debug_opt            = LTWRAPPER_OPTION_PREFIX "debug";
+
+int
+main (int argc, char *argv[])
+{
+  char **newargz;
+  int  newargc;
+  char *tmp_pathspec;
+  char *actual_cwrapper_path;
+  char *actual_cwrapper_name;
+  char *target_name;
+  char *lt_argv_zero;
+  intptr_t rval = 127;
+
+  int i;
+
+  program_name = (char *) xstrdup (base_name (argv[0]));
+  newargz = XMALLOC (char *, argc + 1);
+
+  /* very simple arg parsing; don't want to rely on getopt
+   * also, copy all non cwrapper options to newargz, except
+   * argz[0], which is handled differently
+   */
+  newargc=0;
+  for (i = 1; i < argc; i++)
+    {
+      if (strcmp (argv[i], dumpscript_opt) == 0)
+	{
+EOF
+	    case "$host" in
+	      *mingw* | *cygwin* )
+		# make stdout use "unix" line endings
+		echo "          setmode(1,_O_BINARY);"
+		;;
+	      esac
+
+	    cat <<"EOF"
+	  lt_dump_script (stdout);
+	  return 0;
+	}
+      if (strcmp (argv[i], debug_opt) == 0)
+	{
+          lt_debug = 1;
+          continue;
+	}
+      if (strcmp (argv[i], ltwrapper_option_prefix) == 0)
+        {
+          /* however, if there is an option in the LTWRAPPER_OPTION_PREFIX
+             namespace, but it is not one of the ones we know about and
+             have already dealt with, above (inluding dump-script), then
+             report an error. Otherwise, targets might begin to believe
+             they are allowed to use options in the LTWRAPPER_OPTION_PREFIX
+             namespace. The first time any user complains about this, we'll
+             need to make LTWRAPPER_OPTION_PREFIX a configure-time option
+             or a configure.ac-settable value.
+           */
+          lt_fatal (__FILE__, __LINE__,
+		    "unrecognized %s option: '%s'",
+                    ltwrapper_option_prefix, argv[i]);
+        }
+      /* otherwise ... */
+      newargz[++newargc] = xstrdup (argv[i]);
+    }
+  newargz[++newargc] = NULL;
+
+EOF
+	    cat <<EOF
+  /* The GNU banner must be the first non-error debug message */
+  lt_debugprintf (__FILE__, __LINE__, "libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\n");
+EOF
+	    cat <<"EOF"
+  lt_debugprintf (__FILE__, __LINE__, "(main) argv[0]: %s\n", argv[0]);
+  lt_debugprintf (__FILE__, __LINE__, "(main) program_name: %s\n", program_name);
+
+  tmp_pathspec = find_executable (argv[0]);
+  if (tmp_pathspec == NULL)
+    lt_fatal (__FILE__, __LINE__, "couldn't find %s", argv[0]);
+  lt_debugprintf (__FILE__, __LINE__,
+                  "(main) found exe (before symlink chase) at: %s\n",
+		  tmp_pathspec);
+
+  actual_cwrapper_path = chase_symlinks (tmp_pathspec);
+  lt_debugprintf (__FILE__, __LINE__,
+                  "(main) found exe (after symlink chase) at: %s\n",
+		  actual_cwrapper_path);
+  XFREE (tmp_pathspec);
+
+  actual_cwrapper_name = xstrdup (base_name (actual_cwrapper_path));
+  strendzap (actual_cwrapper_path, actual_cwrapper_name);
+
+  /* wrapper name transforms */
+  strendzap (actual_cwrapper_name, ".exe");
+  tmp_pathspec = lt_extend_str (actual_cwrapper_name, ".exe", 1);
+  XFREE (actual_cwrapper_name);
+  actual_cwrapper_name = tmp_pathspec;
+  tmp_pathspec = 0;
+
+  /* target_name transforms -- use actual target program name; might have lt- prefix */
+  target_name = xstrdup (base_name (TARGET_PROGRAM_NAME));
+  strendzap (target_name, ".exe");
+  tmp_pathspec = lt_extend_str (target_name, ".exe", 1);
+  XFREE (target_name);
+  target_name = tmp_pathspec;
+  tmp_pathspec = 0;
+
+  lt_debugprintf (__FILE__, __LINE__,
+		  "(main) libtool target name: %s\n",
+		  target_name);
+EOF
+
+	    cat <<EOF
+  newargz[0] =
+    XMALLOC (char, (strlen (actual_cwrapper_path) +
+		    strlen ("$objdir") + 1 + strlen (actual_cwrapper_name) + 1));
+  strcpy (newargz[0], actual_cwrapper_path);
+  strcat (newargz[0], "$objdir");
+  strcat (newargz[0], "/");
+EOF
+
+	    cat <<"EOF"
+  /* stop here, and copy so we don't have to do this twice */
+  tmp_pathspec = xstrdup (newargz[0]);
+
+  /* do NOT want the lt- prefix here, so use actual_cwrapper_name */
+  strcat (newargz[0], actual_cwrapper_name);
+
+  /* DO want the lt- prefix here if it exists, so use target_name */
+  lt_argv_zero = lt_extend_str (tmp_pathspec, target_name, 1);
+  XFREE (tmp_pathspec);
+  tmp_pathspec = NULL;
+EOF
+
+	    case $host_os in
+	      mingw*)
+	    cat <<"EOF"
+  {
+    char* p;
+    while ((p = strchr (newargz[0], '\\')) != NULL)
+      {
+	*p = '/';
+      }
+    while ((p = strchr (lt_argv_zero, '\\')) != NULL)
+      {
+	*p = '/';
+      }
+  }
+EOF
+	    ;;
+	    esac
+
+	    cat <<"EOF"
+  XFREE (target_name);
+  XFREE (actual_cwrapper_path);
+  XFREE (actual_cwrapper_name);
+
+  lt_setenv ("BIN_SH", "xpg4"); /* for Tru64 */
+  lt_setenv ("DUALCASE", "1");  /* for MSK sh */
+  /* Update the DLL searchpath.  EXE_PATH_VALUE ($dllsearchpath) must
+     be prepended before (that is, appear after) LIB_PATH_VALUE ($temp_rpath)
+     because on Windows, both *_VARNAMEs are PATH but uninstalled
+     libraries must come first. */
+  lt_update_exe_path (EXE_PATH_VARNAME, EXE_PATH_VALUE);
+  lt_update_lib_path (LIB_PATH_VARNAME, LIB_PATH_VALUE);
+
+  lt_debugprintf (__FILE__, __LINE__, "(main) lt_argv_zero: %s\n",
+		  nonnull (lt_argv_zero));
+  for (i = 0; i < newargc; i++)
+    {
+      lt_debugprintf (__FILE__, __LINE__, "(main) newargz[%d]: %s\n",
+		      i, nonnull (newargz[i]));
+    }
+
+EOF
+
+	    case $host_os in
+	      mingw*)
+		cat <<"EOF"
+  /* execv doesn't actually work on mingw as expected on unix */
+  newargz = prepare_spawn (newargz);
+  rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz);
+  if (rval == -1)
+    {
+      /* failed to start process */
+      lt_debugprintf (__FILE__, __LINE__,
+		      "(main) failed to launch target \"%s\": %s\n",
+		      lt_argv_zero, nonnull (strerror (errno)));
+      return 127;
+    }
+  return rval;
+EOF
+		;;
+	      *)
+		cat <<"EOF"
+  execv (lt_argv_zero, newargz);
+  return rval; /* =127, but avoids unused variable warning */
+EOF
+		;;
+	    esac
+
+	    cat <<"EOF"
+}
+
+void *
+xmalloc (size_t num)
+{
+  void *p = (void *) malloc (num);
+  if (!p)
+    lt_fatal (__FILE__, __LINE__, "memory exhausted");
+
+  return p;
+}
+
+char *
+xstrdup (const char *string)
+{
+  return string ? strcpy ((char *) xmalloc (strlen (string) + 1),
+			  string) : NULL;
+}
+
+const char *
+base_name (const char *name)
+{
+  const char *base;
+
+#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
+  /* Skip over the disk name in MSDOS pathnames. */
+  if (isalpha ((unsigned char) name[0]) && name[1] == ':')
+    name += 2;
+#endif
+
+  for (base = name; *name; name++)
+    if (IS_DIR_SEPARATOR (*name))
+      base = name + 1;
+  return base;
+}
+
+int
+check_executable (const char *path)
+{
+  struct stat st;
+
+  lt_debugprintf (__FILE__, __LINE__, "(check_executable): %s\n",
+                  nonempty (path));
+  if ((!path) || (!*path))
+    return 0;
+
+  if ((stat (path, &st) >= 0)
+      && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH)))
+    return 1;
+  else
+    return 0;
+}
+
+int
+make_executable (const char *path)
+{
+  int rval = 0;
+  struct stat st;
+
+  lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n",
+                  nonempty (path));
+  if ((!path) || (!*path))
+    return 0;
+
+  if (stat (path, &st) >= 0)
+    {
+      rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR);
+    }
+  return rval;
+}
+
+/* Searches for the full path of the wrapper.  Returns
+   newly allocated full path name if found, NULL otherwise
+   Does not chase symlinks, even on platforms that support them.
+*/
+char *
+find_executable (const char *wrapper)
+{
+  int has_slash = 0;
+  const char *p;
+  const char *p_next;
+  /* static buffer for getcwd */
+  char tmp[LT_PATHMAX + 1];
+  int tmp_len;
+  char *concat_name;
+
+  lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n",
+                  nonempty (wrapper));
+
+  if ((wrapper == NULL) || (*wrapper == '\0'))
+    return NULL;
+
+  /* Absolute path? */
+#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
+  if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':')
+    {
+      concat_name = xstrdup (wrapper);
+      if (check_executable (concat_name))
+	return concat_name;
+      XFREE (concat_name);
+    }
+  else
+    {
+#endif
+      if (IS_DIR_SEPARATOR (wrapper[0]))
+	{
+	  concat_name = xstrdup (wrapper);
+	  if (check_executable (concat_name))
+	    return concat_name;
+	  XFREE (concat_name);
+	}
+#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
+    }
+#endif
+
+  for (p = wrapper; *p; p++)
+    if (*p == '/')
+      {
+	has_slash = 1;
+	break;
+      }
+  if (!has_slash)
+    {
+      /* no slashes; search PATH */
+      const char *path = getenv ("PATH");
+      if (path != NULL)
+	{
+	  for (p = path; *p; p = p_next)
+	    {
+	      const char *q;
+	      size_t p_len;
+	      for (q = p; *q; q++)
+		if (IS_PATH_SEPARATOR (*q))
+		  break;
+	      p_len = q - p;
+	      p_next = (*q == '\0' ? q : q + 1);
+	      if (p_len == 0)
+		{
+		  /* empty path: current directory */
+		  if (getcwd (tmp, LT_PATHMAX) == NULL)
+		    lt_fatal (__FILE__, __LINE__, "getcwd failed: %s",
+                              nonnull (strerror (errno)));
+		  tmp_len = strlen (tmp);
+		  concat_name =
+		    XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);
+		  memcpy (concat_name, tmp, tmp_len);
+		  concat_name[tmp_len] = '/';
+		  strcpy (concat_name + tmp_len + 1, wrapper);
+		}
+	      else
+		{
+		  concat_name =
+		    XMALLOC (char, p_len + 1 + strlen (wrapper) + 1);
+		  memcpy (concat_name, p, p_len);
+		  concat_name[p_len] = '/';
+		  strcpy (concat_name + p_len + 1, wrapper);
+		}
+	      if (check_executable (concat_name))
+		return concat_name;
+	      XFREE (concat_name);
+	    }
+	}
+      /* not found in PATH; assume curdir */
+    }
+  /* Relative path | not found in path: prepend cwd */
+  if (getcwd (tmp, LT_PATHMAX) == NULL)
+    lt_fatal (__FILE__, __LINE__, "getcwd failed: %s",
+              nonnull (strerror (errno)));
+  tmp_len = strlen (tmp);
+  concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);
+  memcpy (concat_name, tmp, tmp_len);
+  concat_name[tmp_len] = '/';
+  strcpy (concat_name + tmp_len + 1, wrapper);
+
+  if (check_executable (concat_name))
+    return concat_name;
+  XFREE (concat_name);
+  return NULL;
+}
+
+char *
+chase_symlinks (const char *pathspec)
+{
+#ifndef S_ISLNK
+  return xstrdup (pathspec);
+#else
+  char buf[LT_PATHMAX];
+  struct stat s;
+  char *tmp_pathspec = xstrdup (pathspec);
+  char *p;
+  int has_symlinks = 0;
+  while (strlen (tmp_pathspec) && !has_symlinks)
+    {
+      lt_debugprintf (__FILE__, __LINE__,
+		      "checking path component for symlinks: %s\n",
+		      tmp_pathspec);
+      if (lstat (tmp_pathspec, &s) == 0)
+	{
+	  if (S_ISLNK (s.st_mode) != 0)
+	    {
+	      has_symlinks = 1;
+	      break;
+	    }
+
+	  /* search backwards for last DIR_SEPARATOR */
+	  p = tmp_pathspec + strlen (tmp_pathspec) - 1;
+	  while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))
+	    p--;
+	  if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))
+	    {
+	      /* no more DIR_SEPARATORS left */
+	      break;
+	    }
+	  *p = '\0';
+	}
+      else
+	{
+	  lt_fatal (__FILE__, __LINE__,
+		    "error accessing file \"%s\": %s",
+		    tmp_pathspec, nonnull (strerror (errno)));
+	}
+    }
+  XFREE (tmp_pathspec);
+
+  if (!has_symlinks)
+    {
+      return xstrdup (pathspec);
+    }
+
+  tmp_pathspec = realpath (pathspec, buf);
+  if (tmp_pathspec == 0)
+    {
+      lt_fatal (__FILE__, __LINE__,
+		"could not follow symlinks for %s", pathspec);
+    }
+  return xstrdup (tmp_pathspec);
+#endif
+}
+
+char *
+strendzap (char *str, const char *pat)
+{
+  size_t len, patlen;
+
+  assert (str != NULL);
+  assert (pat != NULL);
+
+  len = strlen (str);
+  patlen = strlen (pat);
+
+  if (patlen <= len)
+    {
+      str += len - patlen;
+      if (strcmp (str, pat) == 0)
+	*str = '\0';
+    }
+  return str;
+}
+
+void
+lt_debugprintf (const char *file, int line, const char *fmt, ...)
+{
+  va_list args;
+  if (lt_debug)
+    {
+      (void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line);
+      va_start (args, fmt);
+      (void) vfprintf (stderr, fmt, args);
+      va_end (args);
+    }
+}
+
+static void
+lt_error_core (int exit_status, const char *file,
+	       int line, const char *mode,
+	       const char *message, va_list ap)
+{
+  fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode);
+  vfprintf (stderr, message, ap);
+  fprintf (stderr, ".\n");
+
+  if (exit_status >= 0)
+    exit (exit_status);
+}
+
+void
+lt_fatal (const char *file, int line, const char *message, ...)
+{
+  va_list ap;
+  va_start (ap, message);
+  lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap);
+  va_end (ap);
+}
+
+static const char *
+nonnull (const char *s)
+{
+  return s ? s : "(null)";
+}
+
+static const char *
+nonempty (const char *s)
+{
+  return (s && !*s) ? "(empty)" : nonnull (s);
+}
+
+void
+lt_setenv (const char *name, const char *value)
+{
+  lt_debugprintf (__FILE__, __LINE__,
+		  "(lt_setenv) setting '%s' to '%s'\n",
+                  nonnull (name), nonnull (value));
+  {
+#ifdef HAVE_SETENV
+    /* always make a copy, for consistency with !HAVE_SETENV */
+    char *str = xstrdup (value);
+    setenv (name, str, 1);
+#else
+    int len = strlen (name) + 1 + strlen (value) + 1;
+    char *str = XMALLOC (char, len);
+    sprintf (str, "%s=%s", name, value);
+    if (putenv (str) != EXIT_SUCCESS)
+      {
+        XFREE (str);
+      }
+#endif
+  }
+}
+
+char *
+lt_extend_str (const char *orig_value, const char *add, int to_end)
+{
+  char *new_value;
+  if (orig_value && *orig_value)
+    {
+      int orig_value_len = strlen (orig_value);
+      int add_len = strlen (add);
+      new_value = XMALLOC (char, add_len + orig_value_len + 1);
+      if (to_end)
+        {
+          strcpy (new_value, orig_value);
+          strcpy (new_value + orig_value_len, add);
+        }
+      else
+        {
+          strcpy (new_value, add);
+          strcpy (new_value + add_len, orig_value);
+        }
+    }
+  else
+    {
+      new_value = xstrdup (add);
+    }
+  return new_value;
+}
+
+void
+lt_update_exe_path (const char *name, const char *value)
+{
+  lt_debugprintf (__FILE__, __LINE__,
+		  "(lt_update_exe_path) modifying '%s' by prepending '%s'\n",
+                  nonnull (name), nonnull (value));
+
+  if (name && *name && value && *value)
+    {
+      char *new_value = lt_extend_str (getenv (name), value, 0);
+      /* some systems can't cope with a ':'-terminated path #' */
+      int len = strlen (new_value);
+      while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1]))
+        {
+          new_value[len-1] = '\0';
+        }
+      lt_setenv (name, new_value);
+      XFREE (new_value);
+    }
+}
+
+void
+lt_update_lib_path (const char *name, const char *value)
+{
+  lt_debugprintf (__FILE__, __LINE__,
+		  "(lt_update_lib_path) modifying '%s' by prepending '%s'\n",
+                  nonnull (name), nonnull (value));
+
+  if (name && *name && value && *value)
+    {
+      char *new_value = lt_extend_str (getenv (name), value, 0);
+      lt_setenv (name, new_value);
+      XFREE (new_value);
+    }
+}
+
+EOF
+	    case $host_os in
+	      mingw*)
+		cat <<"EOF"
+
+/* Prepares an argument vector before calling spawn().
+   Note that spawn() does not by itself call the command interpreter
+     (getenv ("COMSPEC") != NULL ? getenv ("COMSPEC") :
+      ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO);
+         GetVersionEx(&v);
+         v.dwPlatformId == VER_PLATFORM_WIN32_NT;
+      }) ? "cmd.exe" : "command.com").
+   Instead it simply concatenates the arguments, separated by ' ', and calls
+   CreateProcess().  We must quote the arguments since Win32 CreateProcess()
+   interprets characters like ' ', '\t', '\\', '"' (but not '<' and '>') in a
+   special way:
+   - Space and tab are interpreted as delimiters. They are not treated as
+     delimiters if they are surrounded by double quotes: "...".
+   - Unescaped double quotes are removed from the input. Their only effect is
+     that within double quotes, space and tab are treated like normal
+     characters.
+   - Backslashes not followed by double quotes are not special.
+   - But 2*n+1 backslashes followed by a double quote become
+     n backslashes followed by a double quote (n >= 0):
+       \" -> "
+       \\\" -> \"
+       \\\\\" -> \\"
+ */
+#define SHELL_SPECIAL_CHARS "\"\\ \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037"
+#define SHELL_SPACE_CHARS " \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037"
+char **
+prepare_spawn (char **argv)
+{
+  size_t argc;
+  char **new_argv;
+  size_t i;
+
+  /* Count number of arguments.  */
+  for (argc = 0; argv[argc] != NULL; argc++)
+    ;
+
+  /* Allocate new argument vector.  */
+  new_argv = XMALLOC (char *, argc + 1);
+
+  /* Put quoted arguments into the new argument vector.  */
+  for (i = 0; i < argc; i++)
+    {
+      const char *string = argv[i];
+
+      if (string[0] == '\0')
+	new_argv[i] = xstrdup ("\"\"");
+      else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL)
+	{
+	  int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL);
+	  size_t length;
+	  unsigned int backslashes;
+	  const char *s;
+	  char *quoted_string;
+	  char *p;
+
+	  length = 0;
+	  backslashes = 0;
+	  if (quote_around)
+	    length++;
+	  for (s = string; *s != '\0'; s++)
+	    {
+	      char c = *s;
+	      if (c == '"')
+		length += backslashes + 1;
+	      length++;
+	      if (c == '\\')
+		backslashes++;
+	      else
+		backslashes = 0;
+	    }
+	  if (quote_around)
+	    length += backslashes + 1;
+
+	  quoted_string = XMALLOC (char, length + 1);
+
+	  p = quoted_string;
+	  backslashes = 0;
+	  if (quote_around)
+	    *p++ = '"';
+	  for (s = string; *s != '\0'; s++)
+	    {
+	      char c = *s;
+	      if (c == '"')
+		{
+		  unsigned int j;
+		  for (j = backslashes + 1; j > 0; j--)
+		    *p++ = '\\';
+		}
+	      *p++ = c;
+	      if (c == '\\')
+		backslashes++;
+	      else
+		backslashes = 0;
+	    }
+	  if (quote_around)
+	    {
+	      unsigned int j;
+	      for (j = backslashes; j > 0; j--)
+		*p++ = '\\';
+	      *p++ = '"';
+	    }
+	  *p = '\0';
+
+	  new_argv[i] = quoted_string;
+	}
+      else
+	new_argv[i] = (char *) string;
+    }
+  new_argv[argc] = NULL;
+
+  return new_argv;
+}
+EOF
+		;;
+	    esac
+
+            cat <<"EOF"
+void lt_dump_script (FILE* f)
+{
+EOF
+	    func_emit_wrapper yes |
+	      $SED -n -e '
+s/^\(.\{79\}\)\(..*\)/\1\
+\2/
+h
+s/\([\\"]\)/\\\1/g
+s/$/\\n/
+s/\([^\n]*\).*/  fputs ("\1", f);/p
+g
+D'
+            cat <<"EOF"
+}
+EOF
+}
+# end: func_emit_cwrapperexe_src
+
+# func_win32_import_lib_p ARG
+# True if ARG is an import lib, as indicated by $file_magic_cmd
+func_win32_import_lib_p ()
+{
+    $opt_debug
+    case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in
+    *import*) : ;;
+    *) false ;;
+    esac
+}
+
+# func_mode_link arg...
+func_mode_link ()
+{
+    $opt_debug
+    case $host in
+    *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)
+      # It is impossible to link a dll without this setting, and
+      # we shouldn't force the makefile maintainer to figure out
+      # which system we are compiling for in order to pass an extra
+      # flag for every libtool invocation.
+      # allow_undefined=no
+
+      # FIXME: Unfortunately, there are problems with the above when trying
+      # to make a dll which has undefined symbols, in which case not
+      # even a static library is built.  For now, we need to specify
+      # -no-undefined on the libtool link line when we can be certain
+      # that all symbols are satisfied, otherwise we get a static library.
+      allow_undefined=yes
+      ;;
+    *)
+      allow_undefined=yes
+      ;;
+    esac
+    libtool_args=$nonopt
+    base_compile="$nonopt $@"
+    compile_command=$nonopt
+    finalize_command=$nonopt
+
+    compile_rpath=
+    finalize_rpath=
+    compile_shlibpath=
+    finalize_shlibpath=
+    convenience=
+    old_convenience=
+    deplibs=
+    old_deplibs=
+    compiler_flags=
+    linker_flags=
+    dllsearchpath=
+    lib_search_path=`pwd`
+    inst_prefix_dir=
+    new_inherited_linker_flags=
+
+    avoid_version=no
+    bindir=
+    dlfiles=
+    dlprefiles=
+    dlself=no
+    export_dynamic=no
+    export_symbols=
+    export_symbols_regex=
+    generated=
+    libobjs=
+    ltlibs=
+    module=no
+    no_install=no
+    objs=
+    non_pic_objects=
+    precious_files_regex=
+    prefer_static_libs=no
+    preload=no
+    prev=
+    prevarg=
+    release=
+    rpath=
+    xrpath=
+    perm_rpath=
+    temp_rpath=
+    thread_safe=no
+    vinfo=
+    vinfo_number=no
+    weak_libs=
+    single_module="${wl}-single_module"
+    func_infer_tag $base_compile
+
+    # We need to know -static, to get the right output filenames.
+    for arg
+    do
+      case $arg in
+      -shared)
+	test "$build_libtool_libs" != yes && \
+	  func_fatal_configuration "can not build a shared library"
+	build_old_libs=no
+	break
+	;;
+      -all-static | -static | -static-libtool-libs)
+	case $arg in
+	-all-static)
+	  if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then
+	    func_warning "complete static linking is impossible in this configuration"
+	  fi
+	  if test -n "$link_static_flag"; then
+	    dlopen_self=$dlopen_self_static
+	  fi
+	  prefer_static_libs=yes
+	  ;;
+	-static)
+	  if test -z "$pic_flag" && test -n "$link_static_flag"; then
+	    dlopen_self=$dlopen_self_static
+	  fi
+	  prefer_static_libs=built
+	  ;;
+	-static-libtool-libs)
+	  if test -z "$pic_flag" && test -n "$link_static_flag"; then
+	    dlopen_self=$dlopen_self_static
+	  fi
+	  prefer_static_libs=yes
+	  ;;
+	esac
+	build_libtool_libs=no
+	build_old_libs=yes
+	break
+	;;
+      esac
+    done
+
+    # See if our shared archives depend on static archives.
+    test -n "$old_archive_from_new_cmds" && build_old_libs=yes
+
+    # Go through the arguments, transforming them on the way.
+    while test "$#" -gt 0; do
+      arg="$1"
+      shift
+      func_quote_for_eval "$arg"
+      qarg=$func_quote_for_eval_unquoted_result
+      func_append libtool_args " $func_quote_for_eval_result"
+
+      # If the previous option needs an argument, assign it.
+      if test -n "$prev"; then
+	case $prev in
+	output)
+	  func_append compile_command " @OUTPUT@"
+	  func_append finalize_command " @OUTPUT@"
+	  ;;
+	esac
+
+	case $prev in
+	bindir)
+	  bindir="$arg"
+	  prev=
+	  continue
+	  ;;
+	dlfiles|dlprefiles)
+	  if test "$preload" = no; then
+	    # Add the symbol object into the linking commands.
+	    func_append compile_command " @SYMFILE@"
+	    func_append finalize_command " @SYMFILE@"
+	    preload=yes
+	  fi
+	  case $arg in
+	  *.la | *.lo) ;;  # We handle these cases below.
+	  force)
+	    if test "$dlself" = no; then
+	      dlself=needless
+	      export_dynamic=yes
+	    fi
+	    prev=
+	    continue
+	    ;;
+	  self)
+	    if test "$prev" = dlprefiles; then
+	      dlself=yes
+	    elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then
+	      dlself=yes
+	    else
+	      dlself=needless
+	      export_dynamic=yes
+	    fi
+	    prev=
+	    continue
+	    ;;
+	  *)
+	    if test "$prev" = dlfiles; then
+	      func_append dlfiles " $arg"
+	    else
+	      func_append dlprefiles " $arg"
+	    fi
+	    prev=
+	    continue
+	    ;;
+	  esac
+	  ;;
+	expsyms)
+	  export_symbols="$arg"
+	  test -f "$arg" \
+	    || func_fatal_error "symbol file \`$arg' does not exist"
+	  prev=
+	  continue
+	  ;;
+	expsyms_regex)
+	  export_symbols_regex="$arg"
+	  prev=
+	  continue
+	  ;;
+	framework)
+	  case $host in
+	    *-*-darwin*)
+	      case "$deplibs " in
+		*" $qarg.ltframework "*) ;;
+		*) func_append deplibs " $qarg.ltframework" # this is fixed later
+		   ;;
+	      esac
+	      ;;
+	  esac
+	  prev=
+	  continue
+	  ;;
+	inst_prefix)
+	  inst_prefix_dir="$arg"
+	  prev=
+	  continue
+	  ;;
+	objectlist)
+	  if test -f "$arg"; then
+	    save_arg=$arg
+	    moreargs=
+	    for fil in `cat "$save_arg"`
+	    do
+#	      func_append moreargs " $fil"
+	      arg=$fil
+	      # A libtool-controlled object.
+
+	      # Check to see that this really is a libtool object.
+	      if func_lalib_unsafe_p "$arg"; then
+		pic_object=
+		non_pic_object=
+
+		# Read the .lo file
+		func_source "$arg"
+
+		if test -z "$pic_object" ||
+		   test -z "$non_pic_object" ||
+		   test "$pic_object" = none &&
+		   test "$non_pic_object" = none; then
+		  func_fatal_error "cannot find name of object for \`$arg'"
+		fi
+
+		# Extract subdirectory from the argument.
+		func_dirname "$arg" "/" ""
+		xdir="$func_dirname_result"
+
+		if test "$pic_object" != none; then
+		  # Prepend the subdirectory the object is found in.
+		  pic_object="$xdir$pic_object"
+
+		  if test "$prev" = dlfiles; then
+		    if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then
+		      func_append dlfiles " $pic_object"
+		      prev=
+		      continue
+		    else
+		      # If libtool objects are unsupported, then we need to preload.
+		      prev=dlprefiles
+		    fi
+		  fi
+
+		  # CHECK ME:  I think I busted this.  -Ossama
+		  if test "$prev" = dlprefiles; then
+		    # Preload the old-style object.
+		    func_append dlprefiles " $pic_object"
+		    prev=
+		  fi
+
+		  # A PIC object.
+		  func_append libobjs " $pic_object"
+		  arg="$pic_object"
+		fi
+
+		# Non-PIC object.
+		if test "$non_pic_object" != none; then
+		  # Prepend the subdirectory the object is found in.
+		  non_pic_object="$xdir$non_pic_object"
+
+		  # A standard non-PIC object
+		  func_append non_pic_objects " $non_pic_object"
+		  if test -z "$pic_object" || test "$pic_object" = none ; then
+		    arg="$non_pic_object"
+		  fi
+		else
+		  # If the PIC object exists, use it instead.
+		  # $xdir was prepended to $pic_object above.
+		  non_pic_object="$pic_object"
+		  func_append non_pic_objects " $non_pic_object"
+		fi
+	      else
+		# Only an error if not doing a dry-run.
+		if $opt_dry_run; then
+		  # Extract subdirectory from the argument.
+		  func_dirname "$arg" "/" ""
+		  xdir="$func_dirname_result"
+
+		  func_lo2o "$arg"
+		  pic_object=$xdir$objdir/$func_lo2o_result
+		  non_pic_object=$xdir$func_lo2o_result
+		  func_append libobjs " $pic_object"
+		  func_append non_pic_objects " $non_pic_object"
+	        else
+		  func_fatal_error "\`$arg' is not a valid libtool object"
+		fi
+	      fi
+	    done
+	  else
+	    func_fatal_error "link input file \`$arg' does not exist"
+	  fi
+	  arg=$save_arg
+	  prev=
+	  continue
+	  ;;
+	precious_regex)
+	  precious_files_regex="$arg"
+	  prev=
+	  continue
+	  ;;
+	release)
+	  release="-$arg"
+	  prev=
+	  continue
+	  ;;
+	rpath | xrpath)
+	  # We need an absolute path.
+	  case $arg in
+	  [\\/]* | [A-Za-z]:[\\/]*) ;;
+	  *)
+	    func_fatal_error "only absolute run-paths are allowed"
+	    ;;
+	  esac
+	  if test "$prev" = rpath; then
+	    case "$rpath " in
+	    *" $arg "*) ;;
+	    *) func_append rpath " $arg" ;;
+	    esac
+	  else
+	    case "$xrpath " in
+	    *" $arg "*) ;;
+	    *) func_append xrpath " $arg" ;;
+	    esac
+	  fi
+	  prev=
+	  continue
+	  ;;
+	shrext)
+	  shrext_cmds="$arg"
+	  prev=
+	  continue
+	  ;;
+	weak)
+	  func_append weak_libs " $arg"
+	  prev=
+	  continue
+	  ;;
+	xcclinker)
+	  func_append linker_flags " $qarg"
+	  func_append compiler_flags " $qarg"
+	  prev=
+	  func_append compile_command " $qarg"
+	  func_append finalize_command " $qarg"
+	  continue
+	  ;;
+	xcompiler)
+	  func_append compiler_flags " $qarg"
+	  prev=
+	  func_append compile_command " $qarg"
+	  func_append finalize_command " $qarg"
+	  continue
+	  ;;
+	xlinker)
+	  func_append linker_flags " $qarg"
+	  func_append compiler_flags " $wl$qarg"
+	  prev=
+	  func_append compile_command " $wl$qarg"
+	  func_append finalize_command " $wl$qarg"
+	  continue
+	  ;;
+	*)
+	  eval "$prev=\"\$arg\""
+	  prev=
+	  continue
+	  ;;
+	esac
+      fi # test -n "$prev"
+
+      prevarg="$arg"
+
+      case $arg in
+      -all-static)
+	if test -n "$link_static_flag"; then
+	  # See comment for -static flag below, for more details.
+	  func_append compile_command " $link_static_flag"
+	  func_append finalize_command " $link_static_flag"
+	fi
+	continue
+	;;
+
+      -allow-undefined)
+	# FIXME: remove this flag sometime in the future.
+	func_fatal_error "\`-allow-undefined' must not be used because it is the default"
+	;;
+
+      -avoid-version)
+	avoid_version=yes
+	continue
+	;;
+
+      -bindir)
+	prev=bindir
+	continue
+	;;
+
+      -dlopen)
+	prev=dlfiles
+	continue
+	;;
+
+      -dlpreopen)
+	prev=dlprefiles
+	continue
+	;;
+
+      -export-dynamic)
+	export_dynamic=yes
+	continue
+	;;
+
+      -export-symbols | -export-symbols-regex)
+	if test -n "$export_symbols" || test -n "$export_symbols_regex"; then
+	  func_fatal_error "more than one -exported-symbols argument is not allowed"
+	fi
+	if test "X$arg" = "X-export-symbols"; then
+	  prev=expsyms
+	else
+	  prev=expsyms_regex
+	fi
+	continue
+	;;
+
+      -framework)
+	prev=framework
+	continue
+	;;
+
+      -inst-prefix-dir)
+	prev=inst_prefix
+	continue
+	;;
+
+      # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:*
+      # so, if we see these flags be careful not to treat them like -L
+      -L[A-Z][A-Z]*:*)
+	case $with_gcc/$host in
+	no/*-*-irix* | /*-*-irix*)
+	  func_append compile_command " $arg"
+	  func_append finalize_command " $arg"
+	  ;;
+	esac
+	continue
+	;;
+
+      -L*)
+	func_stripname "-L" '' "$arg"
+	if test -z "$func_stripname_result"; then
+	  if test "$#" -gt 0; then
+	    func_fatal_error "require no space between \`-L' and \`$1'"
+	  else
+	    func_fatal_error "need path for \`-L' option"
+	  fi
+	fi
+	func_resolve_sysroot "$func_stripname_result"
+	dir=$func_resolve_sysroot_result
+	# We need an absolute path.
+	case $dir in
+	[\\/]* | [A-Za-z]:[\\/]*) ;;
+	*)
+	  absdir=`cd "$dir" && pwd`
+	  test -z "$absdir" && \
+	    func_fatal_error "cannot determine absolute directory name of \`$dir'"
+	  dir="$absdir"
+	  ;;
+	esac
+	case "$deplibs " in
+	*" -L$dir "* | *" $arg "*)
+	  # Will only happen for absolute or sysroot arguments
+	  ;;
+	*)
+	  # Preserve sysroot, but never include relative directories
+	  case $dir in
+	    [\\/]* | [A-Za-z]:[\\/]* | =*) func_append deplibs " $arg" ;;
+	    *) func_append deplibs " -L$dir" ;;
+	  esac
+	  func_append lib_search_path " $dir"
+	  ;;
+	esac
+	case $host in
+	*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)
+	  testbindir=`$ECHO "$dir" | $SED 's*/lib$*/bin*'`
+	  case :$dllsearchpath: in
+	  *":$dir:"*) ;;
+	  ::) dllsearchpath=$dir;;
+	  *) func_append dllsearchpath ":$dir";;
+	  esac
+	  case :$dllsearchpath: in
+	  *":$testbindir:"*) ;;
+	  ::) dllsearchpath=$testbindir;;
+	  *) func_append dllsearchpath ":$testbindir";;
+	  esac
+	  ;;
+	esac
+	continue
+	;;
+
+      -l*)
+	if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then
+	  case $host in
+	  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*)
+	    # These systems don't actually have a C or math library (as such)
+	    continue
+	    ;;
+	  *-*-os2*)
+	    # These systems don't actually have a C library (as such)
+	    test "X$arg" = "X-lc" && continue
+	    ;;
+	  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)
+	    # Do not include libc due to us having libc/libc_r.
+	    test "X$arg" = "X-lc" && continue
+	    ;;
+	  *-*-rhapsody* | *-*-darwin1.[012])
+	    # Rhapsody C and math libraries are in the System framework
+	    func_append deplibs " System.ltframework"
+	    continue
+	    ;;
+	  *-*-sco3.2v5* | *-*-sco5v6*)
+	    # Causes problems with __ctype
+	    test "X$arg" = "X-lc" && continue
+	    ;;
+	  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)
+	    # Compiler inserts libc in the correct place for threads to work
+	    test "X$arg" = "X-lc" && continue
+	    ;;
+	  esac
+	elif test "X$arg" = "X-lc_r"; then
+	 case $host in
+	 *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)
+	   # Do not include libc_r directly, use -pthread flag.
+	   continue
+	   ;;
+	 esac
+	fi
+	func_append deplibs " $arg"
+	continue
+	;;
+
+      -module)
+	module=yes
+	continue
+	;;
+
+      # Tru64 UNIX uses -model [arg] to determine the layout of C++
+      # classes, name mangling, and exception handling.
+      # Darwin uses the -arch flag to determine output architecture.
+      -model|-arch|-isysroot|--sysroot)
+	func_append compiler_flags " $arg"
+	func_append compile_command " $arg"
+	func_append finalize_command " $arg"
+	prev=xcompiler
+	continue
+	;;
+
+      -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \
+      |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)
+	func_append compiler_flags " $arg"
+	func_append compile_command " $arg"
+	func_append finalize_command " $arg"
+	case "$new_inherited_linker_flags " in
+	    *" $arg "*) ;;
+	    * ) func_append new_inherited_linker_flags " $arg" ;;
+	esac
+	continue
+	;;
+
+      -multi_module)
+	single_module="${wl}-multi_module"
+	continue
+	;;
+
+      -no-fast-install)
+	fast_install=no
+	continue
+	;;
+
+      -no-install)
+	case $host in
+	*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*)
+	  # The PATH hackery in wrapper scripts is required on Windows
+	  # and Darwin in order for the loader to find any dlls it needs.
+	  func_warning "\`-no-install' is ignored for $host"
+	  func_warning "assuming \`-no-fast-install' instead"
+	  fast_install=no
+	  ;;
+	*) no_install=yes ;;
+	esac
+	continue
+	;;
+
+      -no-undefined)
+	allow_undefined=no
+	continue
+	;;
+
+      -objectlist)
+	prev=objectlist
+	continue
+	;;
+
+      -o) prev=output ;;
+
+      -precious-files-regex)
+	prev=precious_regex
+	continue
+	;;
+
+      -release)
+	prev=release
+	continue
+	;;
+
+      -rpath)
+	prev=rpath
+	continue
+	;;
+
+      -R)
+	prev=xrpath
+	continue
+	;;
+
+      -R*)
+	func_stripname '-R' '' "$arg"
+	dir=$func_stripname_result
+	# We need an absolute path.
+	case $dir in
+	[\\/]* | [A-Za-z]:[\\/]*) ;;
+	=*)
+	  func_stripname '=' '' "$dir"
+	  dir=$lt_sysroot$func_stripname_result
+	  ;;
+	*)
+	  func_fatal_error "only absolute run-paths are allowed"
+	  ;;
+	esac
+	case "$xrpath " in
+	*" $dir "*) ;;
+	*) func_append xrpath " $dir" ;;
+	esac
+	continue
+	;;
+
+      -shared)
+	# The effects of -shared are defined in a previous loop.
+	continue
+	;;
+
+      -shrext)
+	prev=shrext
+	continue
+	;;
+
+      -static | -static-libtool-libs)
+	# The effects of -static are defined in a previous loop.
+	# We used to do the same as -all-static on platforms that
+	# didn't have a PIC flag, but the assumption that the effects
+	# would be equivalent was wrong.  It would break on at least
+	# Digital Unix and AIX.
+	continue
+	;;
+
+      -thread-safe)
+	thread_safe=yes
+	continue
+	;;
+
+      -version-info)
+	prev=vinfo
+	continue
+	;;
+
+      -version-number)
+	prev=vinfo
+	vinfo_number=yes
+	continue
+	;;
+
+      -weak)
+        prev=weak
+	continue
+	;;
+
+      -Wc,*)
+	func_stripname '-Wc,' '' "$arg"
+	args=$func_stripname_result
+	arg=
+	save_ifs="$IFS"; IFS=','
+	for flag in $args; do
+	  IFS="$save_ifs"
+          func_quote_for_eval "$flag"
+	  func_append arg " $func_quote_for_eval_result"
+	  func_append compiler_flags " $func_quote_for_eval_result"
+	done
+	IFS="$save_ifs"
+	func_stripname ' ' '' "$arg"
+	arg=$func_stripname_result
+	;;
+
+      -Wl,*)
+	func_stripname '-Wl,' '' "$arg"
+	args=$func_stripname_result
+	arg=
+	save_ifs="$IFS"; IFS=','
+	for flag in $args; do
+	  IFS="$save_ifs"
+          func_quote_for_eval "$flag"
+	  func_append arg " $wl$func_quote_for_eval_result"
+	  func_append compiler_flags " $wl$func_quote_for_eval_result"
+	  func_append linker_flags " $func_quote_for_eval_result"
+	done
+	IFS="$save_ifs"
+	func_stripname ' ' '' "$arg"
+	arg=$func_stripname_result
+	;;
+
+      -Xcompiler)
+	prev=xcompiler
+	continue
+	;;
+
+      -Xlinker)
+	prev=xlinker
+	continue
+	;;
+
+      -XCClinker)
+	prev=xcclinker
+	continue
+	;;
+
+      # -msg_* for osf cc
+      -msg_*)
+	func_quote_for_eval "$arg"
+	arg="$func_quote_for_eval_result"
+	;;
+
+      # Flags to be passed through unchanged, with rationale:
+      # -64, -mips[0-9]      enable 64-bit mode for the SGI compiler
+      # -r[0-9][0-9]*        specify processor for the SGI compiler
+      # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler
+      # +DA*, +DD*           enable 64-bit mode for the HP compiler
+      # -q*                  compiler args for the IBM compiler
+      # -m*, -t[45]*, -txscale* architecture-specific flags for GCC
+      # -F/path              path to uninstalled frameworks, gcc on darwin
+      # -p, -pg, --coverage, -fprofile-*  profiling flags for GCC
+      # @file                GCC response files
+      # -tp=*                Portland pgcc target processor selection
+      # --sysroot=*          for sysroot support
+      # -O*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization
+      -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \
+      -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \
+      -O*|-flto*|-fwhopr*|-fuse-linker-plugin)
+        func_quote_for_eval "$arg"
+	arg="$func_quote_for_eval_result"
+        func_append compile_command " $arg"
+        func_append finalize_command " $arg"
+        func_append compiler_flags " $arg"
+        continue
+        ;;
+
+      # Some other compiler flag.
+      -* | +*)
+        func_quote_for_eval "$arg"
+	arg="$func_quote_for_eval_result"
+	;;
+
+      *.$objext)
+	# A standard object.
+	func_append objs " $arg"
+	;;
+
+      *.lo)
+	# A libtool-controlled object.
+
+	# Check to see that this really is a libtool object.
+	if func_lalib_unsafe_p "$arg"; then
+	  pic_object=
+	  non_pic_object=
+
+	  # Read the .lo file
+	  func_source "$arg"
+
+	  if test -z "$pic_object" ||
+	     test -z "$non_pic_object" ||
+	     test "$pic_object" = none &&
+	     test "$non_pic_object" = none; then
+	    func_fatal_error "cannot find name of object for \`$arg'"
+	  fi
+
+	  # Extract subdirectory from the argument.
+	  func_dirname "$arg" "/" ""
+	  xdir="$func_dirname_result"
+
+	  if test "$pic_object" != none; then
+	    # Prepend the subdirectory the object is found in.
+	    pic_object="$xdir$pic_object"
+
+	    if test "$prev" = dlfiles; then
+	      if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then
+		func_append dlfiles " $pic_object"
+		prev=
+		continue
+	      else
+		# If libtool objects are unsupported, then we need to preload.
+		prev=dlprefiles
+	      fi
+	    fi
+
+	    # CHECK ME:  I think I busted this.  -Ossama
+	    if test "$prev" = dlprefiles; then
+	      # Preload the old-style object.
+	      func_append dlprefiles " $pic_object"
+	      prev=
+	    fi
+
+	    # A PIC object.
+	    func_append libobjs " $pic_object"
+	    arg="$pic_object"
+	  fi
+
+	  # Non-PIC object.
+	  if test "$non_pic_object" != none; then
+	    # Prepend the subdirectory the object is found in.
+	    non_pic_object="$xdir$non_pic_object"
+
+	    # A standard non-PIC object
+	    func_append non_pic_objects " $non_pic_object"
+	    if test -z "$pic_object" || test "$pic_object" = none ; then
+	      arg="$non_pic_object"
+	    fi
+	  else
+	    # If the PIC object exists, use it instead.
+	    # $xdir was prepended to $pic_object above.
+	    non_pic_object="$pic_object"
+	    func_append non_pic_objects " $non_pic_object"
+	  fi
+	else
+	  # Only an error if not doing a dry-run.
+	  if $opt_dry_run; then
+	    # Extract subdirectory from the argument.
+	    func_dirname "$arg" "/" ""
+	    xdir="$func_dirname_result"
+
+	    func_lo2o "$arg"
+	    pic_object=$xdir$objdir/$func_lo2o_result
+	    non_pic_object=$xdir$func_lo2o_result
+	    func_append libobjs " $pic_object"
+	    func_append non_pic_objects " $non_pic_object"
+	  else
+	    func_fatal_error "\`$arg' is not a valid libtool object"
+	  fi
+	fi
+	;;
+
+      *.$libext)
+	# An archive.
+	func_append deplibs " $arg"
+	func_append old_deplibs " $arg"
+	continue
+	;;
+
+      *.la)
+	# A libtool-controlled library.
+
+	func_resolve_sysroot "$arg"
+	if test "$prev" = dlfiles; then
+	  # This library was specified with -dlopen.
+	  func_append dlfiles " $func_resolve_sysroot_result"
+	  prev=
+	elif test "$prev" = dlprefiles; then
+	  # The library was specified with -dlpreopen.
+	  func_append dlprefiles " $func_resolve_sysroot_result"
+	  prev=
+	else
+	  func_append deplibs " $func_resolve_sysroot_result"
+	fi
+	continue
+	;;
+
+      # Some other compiler argument.
+      *)
+	# Unknown arguments in both finalize_command and compile_command need
+	# to be aesthetically quoted because they are evaled later.
+	func_quote_for_eval "$arg"
+	arg="$func_quote_for_eval_result"
+	;;
+      esac # arg
+
+      # Now actually substitute the argument into the commands.
+      if test -n "$arg"; then
+	func_append compile_command " $arg"
+	func_append finalize_command " $arg"
+      fi
+    done # argument parsing loop
+
+    test -n "$prev" && \
+      func_fatal_help "the \`$prevarg' option requires an argument"
+
+    if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then
+      eval arg=\"$export_dynamic_flag_spec\"
+      func_append compile_command " $arg"
+      func_append finalize_command " $arg"
+    fi
+
+    oldlibs=
+    # calculate the name of the file, without its directory
+    func_basename "$output"
+    outputname="$func_basename_result"
+    libobjs_save="$libobjs"
+
+    if test -n "$shlibpath_var"; then
+      # get the directories listed in $shlibpath_var
+      eval shlib_search_path=\`\$ECHO \"\${$shlibpath_var}\" \| \$SED \'s/:/ /g\'\`
+    else
+      shlib_search_path=
+    fi
+    eval sys_lib_search_path=\"$sys_lib_search_path_spec\"
+    eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\"
+
+    func_dirname "$output" "/" ""
+    output_objdir="$func_dirname_result$objdir"
+    func_to_tool_file "$output_objdir/"
+    tool_output_objdir=$func_to_tool_file_result
+    # Create the object directory.
+    func_mkdir_p "$output_objdir"
+
+    # Determine the type of output
+    case $output in
+    "")
+      func_fatal_help "you must specify an output file"
+      ;;
+    *.$libext) linkmode=oldlib ;;
+    *.lo | *.$objext) linkmode=obj ;;
+    *.la) linkmode=lib ;;
+    *) linkmode=prog ;; # Anything else should be a program.
+    esac
+
+    specialdeplibs=
+
+    libs=
+    # Find all interdependent deplibs by searching for libraries
+    # that are linked more than once (e.g. -la -lb -la)
+    for deplib in $deplibs; do
+      if $opt_preserve_dup_deps ; then
+	case "$libs " in
+	*" $deplib "*) func_append specialdeplibs " $deplib" ;;
+	esac
+      fi
+      func_append libs " $deplib"
+    done
+
+    if test "$linkmode" = lib; then
+      libs="$predeps $libs $compiler_lib_search_path $postdeps"
+
+      # Compute libraries that are listed more than once in $predeps
+      # $postdeps and mark them as special (i.e., whose duplicates are
+      # not to be eliminated).
+      pre_post_deps=
+      if $opt_duplicate_compiler_generated_deps; then
+	for pre_post_dep in $predeps $postdeps; do
+	  case "$pre_post_deps " in
+	  *" $pre_post_dep "*) func_append specialdeplibs " $pre_post_deps" ;;
+	  esac
+	  func_append pre_post_deps " $pre_post_dep"
+	done
+      fi
+      pre_post_deps=
+    fi
+
+    deplibs=
+    newdependency_libs=
+    newlib_search_path=
+    need_relink=no # whether we're linking any uninstalled libtool libraries
+    notinst_deplibs= # not-installed libtool libraries
+    notinst_path= # paths that contain not-installed libtool libraries
+
+    case $linkmode in
+    lib)
+	passes="conv dlpreopen link"
+	for file in $dlfiles $dlprefiles; do
+	  case $file in
+	  *.la) ;;
+	  *)
+	    func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file"
+	    ;;
+	  esac
+	done
+	;;
+    prog)
+	compile_deplibs=
+	finalize_deplibs=
+	alldeplibs=no
+	newdlfiles=
+	newdlprefiles=
+	passes="conv scan dlopen dlpreopen link"
+	;;
+    *)  passes="conv"
+	;;
+    esac
+
+    for pass in $passes; do
+      # The preopen pass in lib mode reverses $deplibs; put it back here
+      # so that -L comes before libs that need it for instance...
+      if test "$linkmode,$pass" = "lib,link"; then
+	## FIXME: Find the place where the list is rebuilt in the wrong
+	##        order, and fix it there properly
+        tmp_deplibs=
+	for deplib in $deplibs; do
+	  tmp_deplibs="$deplib $tmp_deplibs"
+	done
+	deplibs="$tmp_deplibs"
+      fi
+
+      if test "$linkmode,$pass" = "lib,link" ||
+	 test "$linkmode,$pass" = "prog,scan"; then
+	libs="$deplibs"
+	deplibs=
+      fi
+      if test "$linkmode" = prog; then
+	case $pass in
+	dlopen) libs="$dlfiles" ;;
+	dlpreopen) libs="$dlprefiles" ;;
+	link)
+	  libs="$deplibs %DEPLIBS%"
+	  test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs"
+	  ;;
+	esac
+      fi
+      if test "$linkmode,$pass" = "lib,dlpreopen"; then
+	# Collect and forward deplibs of preopened libtool libs
+	for lib in $dlprefiles; do
+	  # Ignore non-libtool-libs
+	  dependency_libs=
+	  func_resolve_sysroot "$lib"
+	  case $lib in
+	  *.la)	func_source "$func_resolve_sysroot_result" ;;
+	  esac
+
+	  # Collect preopened libtool deplibs, except any this library
+	  # has declared as weak libs
+	  for deplib in $dependency_libs; do
+	    func_basename "$deplib"
+            deplib_base=$func_basename_result
+	    case " $weak_libs " in
+	    *" $deplib_base "*) ;;
+	    *) func_append deplibs " $deplib" ;;
+	    esac
+	  done
+	done
+	libs="$dlprefiles"
+      fi
+      if test "$pass" = dlopen; then
+	# Collect dlpreopened libraries
+	save_deplibs="$deplibs"
+	deplibs=
+      fi
+
+      for deplib in $libs; do
+	lib=
+	found=no
+	case $deplib in
+	-mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \
+        |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*)
+	  if test "$linkmode,$pass" = "prog,link"; then
+	    compile_deplibs="$deplib $compile_deplibs"
+	    finalize_deplibs="$deplib $finalize_deplibs"
+	  else
+	    func_append compiler_flags " $deplib"
+	    if test "$linkmode" = lib ; then
+		case "$new_inherited_linker_flags " in
+		    *" $deplib "*) ;;
+		    * ) func_append new_inherited_linker_flags " $deplib" ;;
+		esac
+	    fi
+	  fi
+	  continue
+	  ;;
+	-l*)
+	  if test "$linkmode" != lib && test "$linkmode" != prog; then
+	    func_warning "\`-l' is ignored for archives/objects"
+	    continue
+	  fi
+	  func_stripname '-l' '' "$deplib"
+	  name=$func_stripname_result
+	  if test "$linkmode" = lib; then
+	    searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path"
+	  else
+	    searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path"
+	  fi
+	  for searchdir in $searchdirs; do
+	    for search_ext in .la $std_shrext .so .a; do
+	      # Search the libtool library
+	      lib="$searchdir/lib${name}${search_ext}"
+	      if test -f "$lib"; then
+		if test "$search_ext" = ".la"; then
+		  found=yes
+		else
+		  found=no
+		fi
+		break 2
+	      fi
+	    done
+	  done
+	  if test "$found" != yes; then
+	    # deplib doesn't seem to be a libtool library
+	    if test "$linkmode,$pass" = "prog,link"; then
+	      compile_deplibs="$deplib $compile_deplibs"
+	      finalize_deplibs="$deplib $finalize_deplibs"
+	    else
+	      deplibs="$deplib $deplibs"
+	      test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs"
+	    fi
+	    continue
+	  else # deplib is a libtool library
+	    # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib,
+	    # We need to do some special things here, and not later.
+	    if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+	      case " $predeps $postdeps " in
+	      *" $deplib "*)
+		if func_lalib_p "$lib"; then
+		  library_names=
+		  old_library=
+		  func_source "$lib"
+		  for l in $old_library $library_names; do
+		    ll="$l"
+		  done
+		  if test "X$ll" = "X$old_library" ; then # only static version available
+		    found=no
+		    func_dirname "$lib" "" "."
+		    ladir="$func_dirname_result"
+		    lib=$ladir/$old_library
+		    if test "$linkmode,$pass" = "prog,link"; then
+		      compile_deplibs="$deplib $compile_deplibs"
+		      finalize_deplibs="$deplib $finalize_deplibs"
+		    else
+		      deplibs="$deplib $deplibs"
+		      test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs"
+		    fi
+		    continue
+		  fi
+		fi
+		;;
+	      *) ;;
+	      esac
+	    fi
+	  fi
+	  ;; # -l
+	*.ltframework)
+	  if test "$linkmode,$pass" = "prog,link"; then
+	    compile_deplibs="$deplib $compile_deplibs"
+	    finalize_deplibs="$deplib $finalize_deplibs"
+	  else
+	    deplibs="$deplib $deplibs"
+	    if test "$linkmode" = lib ; then
+		case "$new_inherited_linker_flags " in
+		    *" $deplib "*) ;;
+		    * ) func_append new_inherited_linker_flags " $deplib" ;;
+		esac
+	    fi
+	  fi
+	  continue
+	  ;;
+	-L*)
+	  case $linkmode in
+	  lib)
+	    deplibs="$deplib $deplibs"
+	    test "$pass" = conv && continue
+	    newdependency_libs="$deplib $newdependency_libs"
+	    func_stripname '-L' '' "$deplib"
+	    func_resolve_sysroot "$func_stripname_result"
+	    func_append newlib_search_path " $func_resolve_sysroot_result"
+	    ;;
+	  prog)
+	    if test "$pass" = conv; then
+	      deplibs="$deplib $deplibs"
+	      continue
+	    fi
+	    if test "$pass" = scan; then
+	      deplibs="$deplib $deplibs"
+	    else
+	      compile_deplibs="$deplib $compile_deplibs"
+	      finalize_deplibs="$deplib $finalize_deplibs"
+	    fi
+	    func_stripname '-L' '' "$deplib"
+	    func_resolve_sysroot "$func_stripname_result"
+	    func_append newlib_search_path " $func_resolve_sysroot_result"
+	    ;;
+	  *)
+	    func_warning "\`-L' is ignored for archives/objects"
+	    ;;
+	  esac # linkmode
+	  continue
+	  ;; # -L
+	-R*)
+	  if test "$pass" = link; then
+	    func_stripname '-R' '' "$deplib"
+	    func_resolve_sysroot "$func_stripname_result"
+	    dir=$func_resolve_sysroot_result
+	    # Make sure the xrpath contains only unique directories.
+	    case "$xrpath " in
+	    *" $dir "*) ;;
+	    *) func_append xrpath " $dir" ;;
+	    esac
+	  fi
+	  deplibs="$deplib $deplibs"
+	  continue
+	  ;;
+	*.la)
+	  func_resolve_sysroot "$deplib"
+	  lib=$func_resolve_sysroot_result
+	  ;;
+	*.$libext)
+	  if test "$pass" = conv; then
+	    deplibs="$deplib $deplibs"
+	    continue
+	  fi
+	  case $linkmode in
+	  lib)
+	    # Linking convenience modules into shared libraries is allowed,
+	    # but linking other static libraries is non-portable.
+	    case " $dlpreconveniencelibs " in
+	    *" $deplib "*) ;;
+	    *)
+	      valid_a_lib=no
+	      case $deplibs_check_method in
+		match_pattern*)
+		  set dummy $deplibs_check_method; shift
+		  match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"`
+		  if eval "\$ECHO \"$deplib\"" 2>/dev/null | $SED 10q \
+		    | $EGREP "$match_pattern_regex" > /dev/null; then
+		    valid_a_lib=yes
+		  fi
+		;;
+		pass_all)
+		  valid_a_lib=yes
+		;;
+	      esac
+	      if test "$valid_a_lib" != yes; then
+		echo
+		$ECHO "*** Warning: Trying to link with static lib archive $deplib."
+		echo "*** I have the capability to make that library automatically link in when"
+		echo "*** you link to this library.  But I can only do this if you have a"
+		echo "*** shared version of the library, which you do not appear to have"
+		echo "*** because the file extensions .$libext of this argument makes me believe"
+		echo "*** that it is just a static archive that I should not use here."
+	      else
+		echo
+		$ECHO "*** Warning: Linking the shared library $output against the"
+		$ECHO "*** static library $deplib is not portable!"
+		deplibs="$deplib $deplibs"
+	      fi
+	      ;;
+	    esac
+	    continue
+	    ;;
+	  prog)
+	    if test "$pass" != link; then
+	      deplibs="$deplib $deplibs"
+	    else
+	      compile_deplibs="$deplib $compile_deplibs"
+	      finalize_deplibs="$deplib $finalize_deplibs"
+	    fi
+	    continue
+	    ;;
+	  esac # linkmode
+	  ;; # *.$libext
+	*.lo | *.$objext)
+	  if test "$pass" = conv; then
+	    deplibs="$deplib $deplibs"
+	  elif test "$linkmode" = prog; then
+	    if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then
+	      # If there is no dlopen support or we're linking statically,
+	      # we need to preload.
+	      func_append newdlprefiles " $deplib"
+	      compile_deplibs="$deplib $compile_deplibs"
+	      finalize_deplibs="$deplib $finalize_deplibs"
+	    else
+	      func_append newdlfiles " $deplib"
+	    fi
+	  fi
+	  continue
+	  ;;
+	%DEPLIBS%)
+	  alldeplibs=yes
+	  continue
+	  ;;
+	esac # case $deplib
+
+	if test "$found" = yes || test -f "$lib"; then :
+	else
+	  func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'"
+	fi
+
+	# Check to see that this really is a libtool archive.
+	func_lalib_unsafe_p "$lib" \
+	  || func_fatal_error "\`$lib' is not a valid libtool archive"
+
+	func_dirname "$lib" "" "."
+	ladir="$func_dirname_result"
+
+	dlname=
+	dlopen=
+	dlpreopen=
+	libdir=
+	library_names=
+	old_library=
+	inherited_linker_flags=
+	# If the library was installed with an old release of libtool,
+	# it will not redefine variables installed, or shouldnotlink
+	installed=yes
+	shouldnotlink=no
+	avoidtemprpath=
+
+
+	# Read the .la file
+	func_source "$lib"
+
+	# Convert "-framework foo" to "foo.ltframework"
+	if test -n "$inherited_linker_flags"; then
+	  tmp_inherited_linker_flags=`$ECHO "$inherited_linker_flags" | $SED 's/-framework \([^ $]*\)/\1.ltframework/g'`
+	  for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do
+	    case " $new_inherited_linker_flags " in
+	      *" $tmp_inherited_linker_flag "*) ;;
+	      *) func_append new_inherited_linker_flags " $tmp_inherited_linker_flag";;
+	    esac
+	  done
+	fi
+	dependency_libs=`$ECHO " $dependency_libs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	if test "$linkmode,$pass" = "lib,link" ||
+	   test "$linkmode,$pass" = "prog,scan" ||
+	   { test "$linkmode" != prog && test "$linkmode" != lib; }; then
+	  test -n "$dlopen" && func_append dlfiles " $dlopen"
+	  test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen"
+	fi
+
+	if test "$pass" = conv; then
+	  # Only check for convenience libraries
+	  deplibs="$lib $deplibs"
+	  if test -z "$libdir"; then
+	    if test -z "$old_library"; then
+	      func_fatal_error "cannot find name of link library for \`$lib'"
+	    fi
+	    # It is a libtool convenience library, so add in its objects.
+	    func_append convenience " $ladir/$objdir/$old_library"
+	    func_append old_convenience " $ladir/$objdir/$old_library"
+	    tmp_libs=
+	    for deplib in $dependency_libs; do
+	      deplibs="$deplib $deplibs"
+	      if $opt_preserve_dup_deps ; then
+		case "$tmp_libs " in
+		*" $deplib "*) func_append specialdeplibs " $deplib" ;;
+		esac
+	      fi
+	      func_append tmp_libs " $deplib"
+	    done
+	  elif test "$linkmode" != prog && test "$linkmode" != lib; then
+	    func_fatal_error "\`$lib' is not a convenience library"
+	  fi
+	  continue
+	fi # $pass = conv
+
+
+	# Get the name of the library we link against.
+	linklib=
+	if test -n "$old_library" &&
+	   { test "$prefer_static_libs" = yes ||
+	     test "$prefer_static_libs,$installed" = "built,no"; }; then
+	  linklib=$old_library
+	else
+	  for l in $old_library $library_names; do
+	    linklib="$l"
+	  done
+	fi
+	if test -z "$linklib"; then
+	  func_fatal_error "cannot find name of link library for \`$lib'"
+	fi
+
+	# This library was specified with -dlopen.
+	if test "$pass" = dlopen; then
+	  if test -z "$libdir"; then
+	    func_fatal_error "cannot -dlopen a convenience library: \`$lib'"
+	  fi
+	  if test -z "$dlname" ||
+	     test "$dlopen_support" != yes ||
+	     test "$build_libtool_libs" = no; then
+	    # If there is no dlname, no dlopen support or we're linking
+	    # statically, we need to preload.  We also need to preload any
+	    # dependent libraries so libltdl's deplib preloader doesn't
+	    # bomb out in the load deplibs phase.
+	    func_append dlprefiles " $lib $dependency_libs"
+	  else
+	    func_append newdlfiles " $lib"
+	  fi
+	  continue
+	fi # $pass = dlopen
+
+	# We need an absolute path.
+	case $ladir in
+	[\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;;
+	*)
+	  abs_ladir=`cd "$ladir" && pwd`
+	  if test -z "$abs_ladir"; then
+	    func_warning "cannot determine absolute directory name of \`$ladir'"
+	    func_warning "passing it literally to the linker, although it might fail"
+	    abs_ladir="$ladir"
+	  fi
+	  ;;
+	esac
+	func_basename "$lib"
+	laname="$func_basename_result"
+
+	# Find the relevant object directory and library name.
+	if test "X$installed" = Xyes; then
+	  if test ! -f "$lt_sysroot$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then
+	    func_warning "library \`$lib' was moved."
+	    dir="$ladir"
+	    absdir="$abs_ladir"
+	    libdir="$abs_ladir"
+	  else
+	    dir="$lt_sysroot$libdir"
+	    absdir="$lt_sysroot$libdir"
+	  fi
+	  test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes
+	else
+	  if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then
+	    dir="$ladir"
+	    absdir="$abs_ladir"
+	    # Remove this search path later
+	    func_append notinst_path " $abs_ladir"
+	  else
+	    dir="$ladir/$objdir"
+	    absdir="$abs_ladir/$objdir"
+	    # Remove this search path later
+	    func_append notinst_path " $abs_ladir"
+	  fi
+	fi # $installed = yes
+	func_stripname 'lib' '.la' "$laname"
+	name=$func_stripname_result
+
+	# This library was specified with -dlpreopen.
+	if test "$pass" = dlpreopen; then
+	  if test -z "$libdir" && test "$linkmode" = prog; then
+	    func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'"
+	  fi
+	  case "$host" in
+	    # special handling for platforms with PE-DLLs.
+	    *cygwin* | *mingw* | *cegcc* )
+	      # Linker will automatically link against shared library if both
+	      # static and shared are present.  Therefore, ensure we extract
+	      # symbols from the import library if a shared library is present
+	      # (otherwise, the dlopen module name will be incorrect).  We do
+	      # this by putting the import library name into $newdlprefiles.
+	      # We recover the dlopen module name by 'saving' the la file
+	      # name in a special purpose variable, and (later) extracting the
+	      # dlname from the la file.
+	      if test -n "$dlname"; then
+	        func_tr_sh "$dir/$linklib"
+	        eval "libfile_$func_tr_sh_result=\$abs_ladir/\$laname"
+	        func_append newdlprefiles " $dir/$linklib"
+	      else
+	        func_append newdlprefiles " $dir/$old_library"
+	        # Keep a list of preopened convenience libraries to check
+	        # that they are being used correctly in the link pass.
+	        test -z "$libdir" && \
+	          func_append dlpreconveniencelibs " $dir/$old_library"
+	      fi
+	    ;;
+	    * )
+	      # Prefer using a static library (so that no silly _DYNAMIC symbols
+	      # are required to link).
+	      if test -n "$old_library"; then
+	        func_append newdlprefiles " $dir/$old_library"
+	        # Keep a list of preopened convenience libraries to check
+	        # that they are being used correctly in the link pass.
+	        test -z "$libdir" && \
+	          func_append dlpreconveniencelibs " $dir/$old_library"
+	      # Otherwise, use the dlname, so that lt_dlopen finds it.
+	      elif test -n "$dlname"; then
+	        func_append newdlprefiles " $dir/$dlname"
+	      else
+	        func_append newdlprefiles " $dir/$linklib"
+	      fi
+	    ;;
+	  esac
+	fi # $pass = dlpreopen
+
+	if test -z "$libdir"; then
+	  # Link the convenience library
+	  if test "$linkmode" = lib; then
+	    deplibs="$dir/$old_library $deplibs"
+	  elif test "$linkmode,$pass" = "prog,link"; then
+	    compile_deplibs="$dir/$old_library $compile_deplibs"
+	    finalize_deplibs="$dir/$old_library $finalize_deplibs"
+	  else
+	    deplibs="$lib $deplibs" # used for prog,scan pass
+	  fi
+	  continue
+	fi
+
+
+	if test "$linkmode" = prog && test "$pass" != link; then
+	  func_append newlib_search_path " $ladir"
+	  deplibs="$lib $deplibs"
+
+	  linkalldeplibs=no
+	  if test "$link_all_deplibs" != no || test -z "$library_names" ||
+	     test "$build_libtool_libs" = no; then
+	    linkalldeplibs=yes
+	  fi
+
+	  tmp_libs=
+	  for deplib in $dependency_libs; do
+	    case $deplib in
+	    -L*) func_stripname '-L' '' "$deplib"
+	         func_resolve_sysroot "$func_stripname_result"
+	         func_append newlib_search_path " $func_resolve_sysroot_result"
+		 ;;
+	    esac
+	    # Need to link against all dependency_libs?
+	    if test "$linkalldeplibs" = yes; then
+	      deplibs="$deplib $deplibs"
+	    else
+	      # Need to hardcode shared library paths
+	      # or/and link against static libraries
+	      newdependency_libs="$deplib $newdependency_libs"
+	    fi
+	    if $opt_preserve_dup_deps ; then
+	      case "$tmp_libs " in
+	      *" $deplib "*) func_append specialdeplibs " $deplib" ;;
+	      esac
+	    fi
+	    func_append tmp_libs " $deplib"
+	  done # for deplib
+	  continue
+	fi # $linkmode = prog...
+
+	if test "$linkmode,$pass" = "prog,link"; then
+	  if test -n "$library_names" &&
+	     { { test "$prefer_static_libs" = no ||
+	         test "$prefer_static_libs,$installed" = "built,yes"; } ||
+	       test -z "$old_library"; }; then
+	    # We need to hardcode the library path
+	    if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then
+	      # Make sure the rpath contains only unique directories.
+	      case "$temp_rpath:" in
+	      *"$absdir:"*) ;;
+	      *) func_append temp_rpath "$absdir:" ;;
+	      esac
+	    fi
+
+	    # Hardcode the library path.
+	    # Skip directories that are in the system default run-time
+	    # search path.
+	    case " $sys_lib_dlsearch_path " in
+	    *" $absdir "*) ;;
+	    *)
+	      case "$compile_rpath " in
+	      *" $absdir "*) ;;
+	      *) func_append compile_rpath " $absdir" ;;
+	      esac
+	      ;;
+	    esac
+	    case " $sys_lib_dlsearch_path " in
+	    *" $libdir "*) ;;
+	    *)
+	      case "$finalize_rpath " in
+	      *" $libdir "*) ;;
+	      *) func_append finalize_rpath " $libdir" ;;
+	      esac
+	      ;;
+	    esac
+	  fi # $linkmode,$pass = prog,link...
+
+	  if test "$alldeplibs" = yes &&
+	     { test "$deplibs_check_method" = pass_all ||
+	       { test "$build_libtool_libs" = yes &&
+		 test -n "$library_names"; }; }; then
+	    # We only need to search for static libraries
+	    continue
+	  fi
+	fi
+
+	link_static=no # Whether the deplib will be linked statically
+	use_static_libs=$prefer_static_libs
+	if test "$use_static_libs" = built && test "$installed" = yes; then
+	  use_static_libs=no
+	fi
+	if test -n "$library_names" &&
+	   { test "$use_static_libs" = no || test -z "$old_library"; }; then
+	  case $host in
+	  *cygwin* | *mingw* | *cegcc*)
+	      # No point in relinking DLLs because paths are not encoded
+	      func_append notinst_deplibs " $lib"
+	      need_relink=no
+	    ;;
+	  *)
+	    if test "$installed" = no; then
+	      func_append notinst_deplibs " $lib"
+	      need_relink=yes
+	    fi
+	    ;;
+	  esac
+	  # This is a shared library
+
+	  # Warn about portability, can't link against -module's on some
+	  # systems (darwin).  Don't bleat about dlopened modules though!
+	  dlopenmodule=""
+	  for dlpremoduletest in $dlprefiles; do
+	    if test "X$dlpremoduletest" = "X$lib"; then
+	      dlopenmodule="$dlpremoduletest"
+	      break
+	    fi
+	  done
+	  if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then
+	    echo
+	    if test "$linkmode" = prog; then
+	      $ECHO "*** Warning: Linking the executable $output against the loadable module"
+	    else
+	      $ECHO "*** Warning: Linking the shared library $output against the loadable module"
+	    fi
+	    $ECHO "*** $linklib is not portable!"
+	  fi
+	  if test "$linkmode" = lib &&
+	     test "$hardcode_into_libs" = yes; then
+	    # Hardcode the library path.
+	    # Skip directories that are in the system default run-time
+	    # search path.
+	    case " $sys_lib_dlsearch_path " in
+	    *" $absdir "*) ;;
+	    *)
+	      case "$compile_rpath " in
+	      *" $absdir "*) ;;
+	      *) func_append compile_rpath " $absdir" ;;
+	      esac
+	      ;;
+	    esac
+	    case " $sys_lib_dlsearch_path " in
+	    *" $libdir "*) ;;
+	    *)
+	      case "$finalize_rpath " in
+	      *" $libdir "*) ;;
+	      *) func_append finalize_rpath " $libdir" ;;
+	      esac
+	      ;;
+	    esac
+	  fi
+
+	  if test -n "$old_archive_from_expsyms_cmds"; then
+	    # figure out the soname
+	    set dummy $library_names
+	    shift
+	    realname="$1"
+	    shift
+	    libname=`eval "\\$ECHO \"$libname_spec\""`
+	    # use dlname if we got it. it's perfectly good, no?
+	    if test -n "$dlname"; then
+	      soname="$dlname"
+	    elif test -n "$soname_spec"; then
+	      # bleh windows
+	      case $host in
+	      *cygwin* | mingw* | *cegcc*)
+	        func_arith $current - $age
+		major=$func_arith_result
+		versuffix="-$major"
+		;;
+	      esac
+	      eval soname=\"$soname_spec\"
+	    else
+	      soname="$realname"
+	    fi
+
+	    # Make a new name for the extract_expsyms_cmds to use
+	    soroot="$soname"
+	    func_basename "$soroot"
+	    soname="$func_basename_result"
+	    func_stripname 'lib' '.dll' "$soname"
+	    newlib=libimp-$func_stripname_result.a
+
+	    # If the library has no export list, then create one now
+	    if test -f "$output_objdir/$soname-def"; then :
+	    else
+	      func_verbose "extracting exported symbol list from \`$soname'"
+	      func_execute_cmds "$extract_expsyms_cmds" 'exit $?'
+	    fi
+
+	    # Create $newlib
+	    if test -f "$output_objdir/$newlib"; then :; else
+	      func_verbose "generating import library for \`$soname'"
+	      func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?'
+	    fi
+	    # make sure the library variables are pointing to the new library
+	    dir=$output_objdir
+	    linklib=$newlib
+	  fi # test -n "$old_archive_from_expsyms_cmds"
+
+	  if test "$linkmode" = prog || test "$opt_mode" != relink; then
+	    add_shlibpath=
+	    add_dir=
+	    add=
+	    lib_linked=yes
+	    case $hardcode_action in
+	    immediate | unsupported)
+	      if test "$hardcode_direct" = no; then
+		add="$dir/$linklib"
+		case $host in
+		  *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;;
+		  *-*-sysv4*uw2*) add_dir="-L$dir" ;;
+		  *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \
+		    *-*-unixware7*) add_dir="-L$dir" ;;
+		  *-*-darwin* )
+		    # if the lib is a (non-dlopened) module then we can not
+		    # link against it, someone is ignoring the earlier warnings
+		    if /usr/bin/file -L $add 2> /dev/null |
+			 $GREP ": [^:]* bundle" >/dev/null ; then
+		      if test "X$dlopenmodule" != "X$lib"; then
+			$ECHO "*** Warning: lib $linklib is a module, not a shared library"
+			if test -z "$old_library" ; then
+			  echo
+			  echo "*** And there doesn't seem to be a static archive available"
+			  echo "*** The link will probably fail, sorry"
+			else
+			  add="$dir/$old_library"
+			fi
+		      elif test -n "$old_library"; then
+			add="$dir/$old_library"
+		      fi
+		    fi
+		esac
+	      elif test "$hardcode_minus_L" = no; then
+		case $host in
+		*-*-sunos*) add_shlibpath="$dir" ;;
+		esac
+		add_dir="-L$dir"
+		add="-l$name"
+	      elif test "$hardcode_shlibpath_var" = no; then
+		add_shlibpath="$dir"
+		add="-l$name"
+	      else
+		lib_linked=no
+	      fi
+	      ;;
+	    relink)
+	      if test "$hardcode_direct" = yes &&
+	         test "$hardcode_direct_absolute" = no; then
+		add="$dir/$linklib"
+	      elif test "$hardcode_minus_L" = yes; then
+		add_dir="-L$absdir"
+		# Try looking first in the location we're being installed to.
+		if test -n "$inst_prefix_dir"; then
+		  case $libdir in
+		    [\\/]*)
+		      func_append add_dir " -L$inst_prefix_dir$libdir"
+		      ;;
+		  esac
+		fi
+		add="-l$name"
+	      elif test "$hardcode_shlibpath_var" = yes; then
+		add_shlibpath="$dir"
+		add="-l$name"
+	      else
+		lib_linked=no
+	      fi
+	      ;;
+	    *) lib_linked=no ;;
+	    esac
+
+	    if test "$lib_linked" != yes; then
+	      func_fatal_configuration "unsupported hardcode properties"
+	    fi
+
+	    if test -n "$add_shlibpath"; then
+	      case :$compile_shlibpath: in
+	      *":$add_shlibpath:"*) ;;
+	      *) func_append compile_shlibpath "$add_shlibpath:" ;;
+	      esac
+	    fi
+	    if test "$linkmode" = prog; then
+	      test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs"
+	      test -n "$add" && compile_deplibs="$add $compile_deplibs"
+	    else
+	      test -n "$add_dir" && deplibs="$add_dir $deplibs"
+	      test -n "$add" && deplibs="$add $deplibs"
+	      if test "$hardcode_direct" != yes &&
+		 test "$hardcode_minus_L" != yes &&
+		 test "$hardcode_shlibpath_var" = yes; then
+		case :$finalize_shlibpath: in
+		*":$libdir:"*) ;;
+		*) func_append finalize_shlibpath "$libdir:" ;;
+		esac
+	      fi
+	    fi
+	  fi
+
+	  if test "$linkmode" = prog || test "$opt_mode" = relink; then
+	    add_shlibpath=
+	    add_dir=
+	    add=
+	    # Finalize command for both is simple: just hardcode it.
+	    if test "$hardcode_direct" = yes &&
+	       test "$hardcode_direct_absolute" = no; then
+	      add="$libdir/$linklib"
+	    elif test "$hardcode_minus_L" = yes; then
+	      add_dir="-L$libdir"
+	      add="-l$name"
+	    elif test "$hardcode_shlibpath_var" = yes; then
+	      case :$finalize_shlibpath: in
+	      *":$libdir:"*) ;;
+	      *) func_append finalize_shlibpath "$libdir:" ;;
+	      esac
+	      add="-l$name"
+	    elif test "$hardcode_automatic" = yes; then
+	      if test -n "$inst_prefix_dir" &&
+		 test -f "$inst_prefix_dir$libdir/$linklib" ; then
+		add="$inst_prefix_dir$libdir/$linklib"
+	      else
+		add="$libdir/$linklib"
+	      fi
+	    else
+	      # We cannot seem to hardcode it, guess we'll fake it.
+	      add_dir="-L$libdir"
+	      # Try looking first in the location we're being installed to.
+	      if test -n "$inst_prefix_dir"; then
+		case $libdir in
+		  [\\/]*)
+		    func_append add_dir " -L$inst_prefix_dir$libdir"
+		    ;;
+		esac
+	      fi
+	      add="-l$name"
+	    fi
+
+	    if test "$linkmode" = prog; then
+	      test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs"
+	      test -n "$add" && finalize_deplibs="$add $finalize_deplibs"
+	    else
+	      test -n "$add_dir" && deplibs="$add_dir $deplibs"
+	      test -n "$add" && deplibs="$add $deplibs"
+	    fi
+	  fi
+	elif test "$linkmode" = prog; then
+	  # Here we assume that one of hardcode_direct or hardcode_minus_L
+	  # is not unsupported.  This is valid on all known static and
+	  # shared platforms.
+	  if test "$hardcode_direct" != unsupported; then
+	    test -n "$old_library" && linklib="$old_library"
+	    compile_deplibs="$dir/$linklib $compile_deplibs"
+	    finalize_deplibs="$dir/$linklib $finalize_deplibs"
+	  else
+	    compile_deplibs="-l$name -L$dir $compile_deplibs"
+	    finalize_deplibs="-l$name -L$dir $finalize_deplibs"
+	  fi
+	elif test "$build_libtool_libs" = yes; then
+	  # Not a shared library
+	  if test "$deplibs_check_method" != pass_all; then
+	    # We're trying link a shared library against a static one
+	    # but the system doesn't support it.
+
+	    # Just print a warning and add the library to dependency_libs so
+	    # that the program can be linked against the static library.
+	    echo
+	    $ECHO "*** Warning: This system can not link to static lib archive $lib."
+	    echo "*** I have the capability to make that library automatically link in when"
+	    echo "*** you link to this library.  But I can only do this if you have a"
+	    echo "*** shared version of the library, which you do not appear to have."
+	    if test "$module" = yes; then
+	      echo "*** But as you try to build a module library, libtool will still create "
+	      echo "*** a static module, that should work as long as the dlopening application"
+	      echo "*** is linked with the -dlopen flag to resolve symbols at runtime."
+	      if test -z "$global_symbol_pipe"; then
+		echo
+		echo "*** However, this would only work if libtool was able to extract symbol"
+		echo "*** lists from a program, using \`nm' or equivalent, but libtool could"
+		echo "*** not find such a program.  So, this module is probably useless."
+		echo "*** \`nm' from GNU binutils and a full rebuild may help."
+	      fi
+	      if test "$build_old_libs" = no; then
+		build_libtool_libs=module
+		build_old_libs=yes
+	      else
+		build_libtool_libs=no
+	      fi
+	    fi
+	  else
+	    deplibs="$dir/$old_library $deplibs"
+	    link_static=yes
+	  fi
+	fi # link shared/static library?
+
+	if test "$linkmode" = lib; then
+	  if test -n "$dependency_libs" &&
+	     { test "$hardcode_into_libs" != yes ||
+	       test "$build_old_libs" = yes ||
+	       test "$link_static" = yes; }; then
+	    # Extract -R from dependency_libs
+	    temp_deplibs=
+	    for libdir in $dependency_libs; do
+	      case $libdir in
+	      -R*) func_stripname '-R' '' "$libdir"
+	           temp_xrpath=$func_stripname_result
+		   case " $xrpath " in
+		   *" $temp_xrpath "*) ;;
+		   *) func_append xrpath " $temp_xrpath";;
+		   esac;;
+	      *) func_append temp_deplibs " $libdir";;
+	      esac
+	    done
+	    dependency_libs="$temp_deplibs"
+	  fi
+
+	  func_append newlib_search_path " $absdir"
+	  # Link against this library
+	  test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs"
+	  # ... and its dependency_libs
+	  tmp_libs=
+	  for deplib in $dependency_libs; do
+	    newdependency_libs="$deplib $newdependency_libs"
+	    case $deplib in
+              -L*) func_stripname '-L' '' "$deplib"
+                   func_resolve_sysroot "$func_stripname_result";;
+              *) func_resolve_sysroot "$deplib" ;;
+            esac
+	    if $opt_preserve_dup_deps ; then
+	      case "$tmp_libs " in
+	      *" $func_resolve_sysroot_result "*)
+                func_append specialdeplibs " $func_resolve_sysroot_result" ;;
+	      esac
+	    fi
+	    func_append tmp_libs " $func_resolve_sysroot_result"
+	  done
+
+	  if test "$link_all_deplibs" != no; then
+	    # Add the search paths of all dependency libraries
+	    for deplib in $dependency_libs; do
+	      path=
+	      case $deplib in
+	      -L*) path="$deplib" ;;
+	      *.la)
+	        func_resolve_sysroot "$deplib"
+	        deplib=$func_resolve_sysroot_result
+	        func_dirname "$deplib" "" "."
+		dir=$func_dirname_result
+		# We need an absolute path.
+		case $dir in
+		[\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;;
+		*)
+		  absdir=`cd "$dir" && pwd`
+		  if test -z "$absdir"; then
+		    func_warning "cannot determine absolute directory name of \`$dir'"
+		    absdir="$dir"
+		  fi
+		  ;;
+		esac
+		if $GREP "^installed=no" $deplib > /dev/null; then
+		case $host in
+		*-*-darwin*)
+		  depdepl=
+		  eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib`
+		  if test -n "$deplibrary_names" ; then
+		    for tmp in $deplibrary_names ; do
+		      depdepl=$tmp
+		    done
+		    if test -f "$absdir/$objdir/$depdepl" ; then
+		      depdepl="$absdir/$objdir/$depdepl"
+		      darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'`
+                      if test -z "$darwin_install_name"; then
+                          darwin_install_name=`${OTOOL64} -L $depdepl  | awk '{if (NR == 2) {print $1;exit}}'`
+                      fi
+		      func_append compiler_flags " ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}"
+		      func_append linker_flags " -dylib_file ${darwin_install_name}:${depdepl}"
+		      path=
+		    fi
+		  fi
+		  ;;
+		*)
+		  path="-L$absdir/$objdir"
+		  ;;
+		esac
+		else
+		  eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib`
+		  test -z "$libdir" && \
+		    func_fatal_error "\`$deplib' is not a valid libtool archive"
+		  test "$absdir" != "$libdir" && \
+		    func_warning "\`$deplib' seems to be moved"
+
+		  path="-L$absdir"
+		fi
+		;;
+	      esac
+	      case " $deplibs " in
+	      *" $path "*) ;;
+	      *) deplibs="$path $deplibs" ;;
+	      esac
+	    done
+	  fi # link_all_deplibs != no
+	fi # linkmode = lib
+      done # for deplib in $libs
+      if test "$pass" = link; then
+	if test "$linkmode" = "prog"; then
+	  compile_deplibs="$new_inherited_linker_flags $compile_deplibs"
+	  finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs"
+	else
+	  compiler_flags="$compiler_flags "`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	fi
+      fi
+      dependency_libs="$newdependency_libs"
+      if test "$pass" = dlpreopen; then
+	# Link the dlpreopened libraries before other libraries
+	for deplib in $save_deplibs; do
+	  deplibs="$deplib $deplibs"
+	done
+      fi
+      if test "$pass" != dlopen; then
+	if test "$pass" != conv; then
+	  # Make sure lib_search_path contains only unique directories.
+	  lib_search_path=
+	  for dir in $newlib_search_path; do
+	    case "$lib_search_path " in
+	    *" $dir "*) ;;
+	    *) func_append lib_search_path " $dir" ;;
+	    esac
+	  done
+	  newlib_search_path=
+	fi
+
+	if test "$linkmode,$pass" != "prog,link"; then
+	  vars="deplibs"
+	else
+	  vars="compile_deplibs finalize_deplibs"
+	fi
+	for var in $vars dependency_libs; do
+	  # Add libraries to $var in reverse order
+	  eval tmp_libs=\"\$$var\"
+	  new_libs=
+	  for deplib in $tmp_libs; do
+	    # FIXME: Pedantically, this is the right thing to do, so
+	    #        that some nasty dependency loop isn't accidentally
+	    #        broken:
+	    #new_libs="$deplib $new_libs"
+	    # Pragmatically, this seems to cause very few problems in
+	    # practice:
+	    case $deplib in
+	    -L*) new_libs="$deplib $new_libs" ;;
+	    -R*) ;;
+	    *)
+	      # And here is the reason: when a library appears more
+	      # than once as an explicit dependence of a library, or
+	      # is implicitly linked in more than once by the
+	      # compiler, it is considered special, and multiple
+	      # occurrences thereof are not removed.  Compare this
+	      # with having the same library being listed as a
+	      # dependency of multiple other libraries: in this case,
+	      # we know (pedantically, we assume) the library does not
+	      # need to be listed more than once, so we keep only the
+	      # last copy.  This is not always right, but it is rare
+	      # enough that we require users that really mean to play
+	      # such unportable linking tricks to link the library
+	      # using -Wl,-lname, so that libtool does not consider it
+	      # for duplicate removal.
+	      case " $specialdeplibs " in
+	      *" $deplib "*) new_libs="$deplib $new_libs" ;;
+	      *)
+		case " $new_libs " in
+		*" $deplib "*) ;;
+		*) new_libs="$deplib $new_libs" ;;
+		esac
+		;;
+	      esac
+	      ;;
+	    esac
+	  done
+	  tmp_libs=
+	  for deplib in $new_libs; do
+	    case $deplib in
+	    -L*)
+	      case " $tmp_libs " in
+	      *" $deplib "*) ;;
+	      *) func_append tmp_libs " $deplib" ;;
+	      esac
+	      ;;
+	    *) func_append tmp_libs " $deplib" ;;
+	    esac
+	  done
+	  eval $var=\"$tmp_libs\"
+	done # for var
+      fi
+      # Last step: remove runtime libs from dependency_libs
+      # (they stay in deplibs)
+      tmp_libs=
+      for i in $dependency_libs ; do
+	case " $predeps $postdeps $compiler_lib_search_path " in
+	*" $i "*)
+	  i=""
+	  ;;
+	esac
+	if test -n "$i" ; then
+	  func_append tmp_libs " $i"
+	fi
+      done
+      dependency_libs=$tmp_libs
+    done # for pass
+    if test "$linkmode" = prog; then
+      dlfiles="$newdlfiles"
+    fi
+    if test "$linkmode" = prog || test "$linkmode" = lib; then
+      dlprefiles="$newdlprefiles"
+    fi
+
+    case $linkmode in
+    oldlib)
+      if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then
+	func_warning "\`-dlopen' is ignored for archives"
+      fi
+
+      case " $deplibs" in
+      *\ -l* | *\ -L*)
+	func_warning "\`-l' and \`-L' are ignored for archives" ;;
+      esac
+
+      test -n "$rpath" && \
+	func_warning "\`-rpath' is ignored for archives"
+
+      test -n "$xrpath" && \
+	func_warning "\`-R' is ignored for archives"
+
+      test -n "$vinfo" && \
+	func_warning "\`-version-info/-version-number' is ignored for archives"
+
+      test -n "$release" && \
+	func_warning "\`-release' is ignored for archives"
+
+      test -n "$export_symbols$export_symbols_regex" && \
+	func_warning "\`-export-symbols' is ignored for archives"
+
+      # Now set the variables for building old libraries.
+      build_libtool_libs=no
+      oldlibs="$output"
+      func_append objs "$old_deplibs"
+      ;;
+
+    lib)
+      # Make sure we only generate libraries of the form `libNAME.la'.
+      case $outputname in
+      lib*)
+	func_stripname 'lib' '.la' "$outputname"
+	name=$func_stripname_result
+	eval shared_ext=\"$shrext_cmds\"
+	eval libname=\"$libname_spec\"
+	;;
+      *)
+	test "$module" = no && \
+	  func_fatal_help "libtool library \`$output' must begin with \`lib'"
+
+	if test "$need_lib_prefix" != no; then
+	  # Add the "lib" prefix for modules if required
+	  func_stripname '' '.la' "$outputname"
+	  name=$func_stripname_result
+	  eval shared_ext=\"$shrext_cmds\"
+	  eval libname=\"$libname_spec\"
+	else
+	  func_stripname '' '.la' "$outputname"
+	  libname=$func_stripname_result
+	fi
+	;;
+      esac
+
+      if test -n "$objs"; then
+	if test "$deplibs_check_method" != pass_all; then
+	  func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs"
+	else
+	  echo
+	  $ECHO "*** Warning: Linking the shared library $output against the non-libtool"
+	  $ECHO "*** objects $objs is not portable!"
+	  func_append libobjs " $objs"
+	fi
+      fi
+
+      test "$dlself" != no && \
+	func_warning "\`-dlopen self' is ignored for libtool libraries"
+
+      set dummy $rpath
+      shift
+      test "$#" -gt 1 && \
+	func_warning "ignoring multiple \`-rpath's for a libtool library"
+
+      install_libdir="$1"
+
+      oldlibs=
+      if test -z "$rpath"; then
+	if test "$build_libtool_libs" = yes; then
+	  # Building a libtool convenience library.
+	  # Some compilers have problems with a `.al' extension so
+	  # convenience libraries should have the same extension an
+	  # archive normally would.
+	  oldlibs="$output_objdir/$libname.$libext $oldlibs"
+	  build_libtool_libs=convenience
+	  build_old_libs=yes
+	fi
+
+	test -n "$vinfo" && \
+	  func_warning "\`-version-info/-version-number' is ignored for convenience libraries"
+
+	test -n "$release" && \
+	  func_warning "\`-release' is ignored for convenience libraries"
+      else
+
+	# Parse the version information argument.
+	save_ifs="$IFS"; IFS=':'
+	set dummy $vinfo 0 0 0
+	shift
+	IFS="$save_ifs"
+
+	test -n "$7" && \
+	  func_fatal_help "too many parameters to \`-version-info'"
+
+	# convert absolute version numbers to libtool ages
+	# this retains compatibility with .la files and attempts
+	# to make the code below a bit more comprehensible
+
+	case $vinfo_number in
+	yes)
+	  number_major="$1"
+	  number_minor="$2"
+	  number_revision="$3"
+	  #
+	  # There are really only two kinds -- those that
+	  # use the current revision as the major version
+	  # and those that subtract age and use age as
+	  # a minor version.  But, then there is irix
+	  # which has an extra 1 added just for fun
+	  #
+	  case $version_type in
+	  # correct linux to gnu/linux during the next big refactor
+	  darwin|linux|osf|windows|none)
+	    func_arith $number_major + $number_minor
+	    current=$func_arith_result
+	    age="$number_minor"
+	    revision="$number_revision"
+	    ;;
+	  freebsd-aout|freebsd-elf|qnx|sunos)
+	    current="$number_major"
+	    revision="$number_minor"
+	    age="0"
+	    ;;
+	  irix|nonstopux)
+	    func_arith $number_major + $number_minor
+	    current=$func_arith_result
+	    age="$number_minor"
+	    revision="$number_minor"
+	    lt_irix_increment=no
+	    ;;
+	  *)
+	    func_fatal_configuration "$modename: unknown library version type \`$version_type'"
+	    ;;
+	  esac
+	  ;;
+	no)
+	  current="$1"
+	  revision="$2"
+	  age="$3"
+	  ;;
+	esac
+
+	# Check that each of the things are valid numbers.
+	case $current in
+	0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;
+	*)
+	  func_error "CURRENT \`$current' must be a nonnegative integer"
+	  func_fatal_error "\`$vinfo' is not valid version information"
+	  ;;
+	esac
+
+	case $revision in
+	0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;
+	*)
+	  func_error "REVISION \`$revision' must be a nonnegative integer"
+	  func_fatal_error "\`$vinfo' is not valid version information"
+	  ;;
+	esac
+
+	case $age in
+	0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;;
+	*)
+	  func_error "AGE \`$age' must be a nonnegative integer"
+	  func_fatal_error "\`$vinfo' is not valid version information"
+	  ;;
+	esac
+
+	if test "$age" -gt "$current"; then
+	  func_error "AGE \`$age' is greater than the current interface number \`$current'"
+	  func_fatal_error "\`$vinfo' is not valid version information"
+	fi
+
+	# Calculate the version variables.
+	major=
+	versuffix=
+	verstring=
+	case $version_type in
+	none) ;;
+
+	darwin)
+	  # Like Linux, but with the current version available in
+	  # verstring for coding it into the library header
+	  func_arith $current - $age
+	  major=.$func_arith_result
+	  versuffix="$major.$age.$revision"
+	  # Darwin ld doesn't like 0 for these options...
+	  func_arith $current + 1
+	  minor_current=$func_arith_result
+	  xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision"
+	  verstring="-compatibility_version $minor_current -current_version $minor_current.$revision"
+	  ;;
+
+	freebsd-aout)
+	  major=".$current"
+	  versuffix=".$current.$revision";
+	  ;;
+
+	freebsd-elf)
+	  major=".$current"
+	  versuffix=".$current"
+	  ;;
+
+	irix | nonstopux)
+	  if test "X$lt_irix_increment" = "Xno"; then
+	    func_arith $current - $age
+	  else
+	    func_arith $current - $age + 1
+	  fi
+	  major=$func_arith_result
+
+	  case $version_type in
+	    nonstopux) verstring_prefix=nonstopux ;;
+	    *)         verstring_prefix=sgi ;;
+	  esac
+	  verstring="$verstring_prefix$major.$revision"
+
+	  # Add in all the interfaces that we are compatible with.
+	  loop=$revision
+	  while test "$loop" -ne 0; do
+	    func_arith $revision - $loop
+	    iface=$func_arith_result
+	    func_arith $loop - 1
+	    loop=$func_arith_result
+	    verstring="$verstring_prefix$major.$iface:$verstring"
+	  done
+
+	  # Before this point, $major must not contain `.'.
+	  major=.$major
+	  versuffix="$major.$revision"
+	  ;;
+
+	linux) # correct to gnu/linux during the next big refactor
+	  func_arith $current - $age
+	  major=.$func_arith_result
+	  versuffix="$major.$age.$revision"
+	  ;;
+
+	osf)
+	  func_arith $current - $age
+	  major=.$func_arith_result
+	  versuffix=".$current.$age.$revision"
+	  verstring="$current.$age.$revision"
+
+	  # Add in all the interfaces that we are compatible with.
+	  loop=$age
+	  while test "$loop" -ne 0; do
+	    func_arith $current - $loop
+	    iface=$func_arith_result
+	    func_arith $loop - 1
+	    loop=$func_arith_result
+	    verstring="$verstring:${iface}.0"
+	  done
+
+	  # Make executables depend on our current version.
+	  func_append verstring ":${current}.0"
+	  ;;
+
+	qnx)
+	  major=".$current"
+	  versuffix=".$current"
+	  ;;
+
+	sunos)
+	  major=".$current"
+	  versuffix=".$current.$revision"
+	  ;;
+
+	windows)
+	  # Use '-' rather than '.', since we only want one
+	  # extension on DOS 8.3 filesystems.
+	  func_arith $current - $age
+	  major=$func_arith_result
+	  versuffix="-$major"
+	  ;;
+
+	*)
+	  func_fatal_configuration "unknown library version type \`$version_type'"
+	  ;;
+	esac
+
+	# Clear the version info if we defaulted, and they specified a release.
+	if test -z "$vinfo" && test -n "$release"; then
+	  major=
+	  case $version_type in
+	  darwin)
+	    # we can't check for "0.0" in archive_cmds due to quoting
+	    # problems, so we reset it completely
+	    verstring=
+	    ;;
+	  *)
+	    verstring="0.0"
+	    ;;
+	  esac
+	  if test "$need_version" = no; then
+	    versuffix=
+	  else
+	    versuffix=".0.0"
+	  fi
+	fi
+
+	# Remove version info from name if versioning should be avoided
+	if test "$avoid_version" = yes && test "$need_version" = no; then
+	  major=
+	  versuffix=
+	  verstring=""
+	fi
+
+	# Check to see if the archive will have undefined symbols.
+	if test "$allow_undefined" = yes; then
+	  if test "$allow_undefined_flag" = unsupported; then
+	    func_warning "undefined symbols not allowed in $host shared libraries"
+	    build_libtool_libs=no
+	    build_old_libs=yes
+	  fi
+	else
+	  # Don't allow undefined symbols.
+	  allow_undefined_flag="$no_undefined_flag"
+	fi
+
+      fi
+
+      func_generate_dlsyms "$libname" "$libname" "yes"
+      func_append libobjs " $symfileobj"
+      test "X$libobjs" = "X " && libobjs=
+
+      if test "$opt_mode" != relink; then
+	# Remove our outputs, but don't remove object files since they
+	# may have been created when compiling PIC objects.
+	removelist=
+	tempremovelist=`$ECHO "$output_objdir/*"`
+	for p in $tempremovelist; do
+	  case $p in
+	    *.$objext | *.gcno)
+	       ;;
+	    $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*)
+	       if test "X$precious_files_regex" != "X"; then
+		 if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1
+		 then
+		   continue
+		 fi
+	       fi
+	       func_append removelist " $p"
+	       ;;
+	    *) ;;
+	  esac
+	done
+	test -n "$removelist" && \
+	  func_show_eval "${RM}r \$removelist"
+      fi
+
+      # Now set the variables for building old libraries.
+      if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then
+	func_append oldlibs " $output_objdir/$libname.$libext"
+
+	# Transform .lo files to .o files.
+	oldobjs="$objs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; $lo2o" | $NL2SP`
+      fi
+
+      # Eliminate all temporary directories.
+      #for path in $notinst_path; do
+      #	lib_search_path=`$ECHO "$lib_search_path " | $SED "s% $path % %g"`
+      #	deplibs=`$ECHO "$deplibs " | $SED "s% -L$path % %g"`
+      #	dependency_libs=`$ECHO "$dependency_libs " | $SED "s% -L$path % %g"`
+      #done
+
+      if test -n "$xrpath"; then
+	# If the user specified any rpath flags, then add them.
+	temp_xrpath=
+	for libdir in $xrpath; do
+	  func_replace_sysroot "$libdir"
+	  func_append temp_xrpath " -R$func_replace_sysroot_result"
+	  case "$finalize_rpath " in
+	  *" $libdir "*) ;;
+	  *) func_append finalize_rpath " $libdir" ;;
+	  esac
+	done
+	if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then
+	  dependency_libs="$temp_xrpath $dependency_libs"
+	fi
+      fi
+
+      # Make sure dlfiles contains only unique files that won't be dlpreopened
+      old_dlfiles="$dlfiles"
+      dlfiles=
+      for lib in $old_dlfiles; do
+	case " $dlprefiles $dlfiles " in
+	*" $lib "*) ;;
+	*) func_append dlfiles " $lib" ;;
+	esac
+      done
+
+      # Make sure dlprefiles contains only unique files
+      old_dlprefiles="$dlprefiles"
+      dlprefiles=
+      for lib in $old_dlprefiles; do
+	case "$dlprefiles " in
+	*" $lib "*) ;;
+	*) func_append dlprefiles " $lib" ;;
+	esac
+      done
+
+      if test "$build_libtool_libs" = yes; then
+	if test -n "$rpath"; then
+	  case $host in
+	  *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*)
+	    # these systems don't actually have a c library (as such)!
+	    ;;
+	  *-*-rhapsody* | *-*-darwin1.[012])
+	    # Rhapsody C library is in the System framework
+	    func_append deplibs " System.ltframework"
+	    ;;
+	  *-*-netbsd*)
+	    # Don't link with libc until the a.out ld.so is fixed.
+	    ;;
+	  *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*)
+	    # Do not include libc due to us having libc/libc_r.
+	    ;;
+	  *-*-sco3.2v5* | *-*-sco5v6*)
+	    # Causes problems with __ctype
+	    ;;
+	  *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*)
+	    # Compiler inserts libc in the correct place for threads to work
+	    ;;
+	  *)
+	    # Add libc to deplibs on all other systems if necessary.
+	    if test "$build_libtool_need_lc" = "yes"; then
+	      func_append deplibs " -lc"
+	    fi
+	    ;;
+	  esac
+	fi
+
+	# Transform deplibs into only deplibs that can be linked in shared.
+	name_save=$name
+	libname_save=$libname
+	release_save=$release
+	versuffix_save=$versuffix
+	major_save=$major
+	# I'm not sure if I'm treating the release correctly.  I think
+	# release should show up in the -l (ie -lgmp5) so we don't want to
+	# add it in twice.  Is that correct?
+	release=""
+	versuffix=""
+	major=""
+	newdeplibs=
+	droppeddeps=no
+	case $deplibs_check_method in
+	pass_all)
+	  # Don't check for shared/static.  Everything works.
+	  # This might be a little naive.  We might want to check
+	  # whether the library exists or not.  But this is on
+	  # osf3 & osf4 and I'm not really sure... Just
+	  # implementing what was already the behavior.
+	  newdeplibs=$deplibs
+	  ;;
+	test_compile)
+	  # This code stresses the "libraries are programs" paradigm to its
+	  # limits. Maybe even breaks it.  We compile a program, linking it
+	  # against the deplibs as a proxy for the library.  Then we can check
+	  # whether they linked in statically or dynamically with ldd.
+	  $opt_dry_run || $RM conftest.c
+	  cat > conftest.c <<EOF
+	  int main() { return 0; }
+EOF
+	  $opt_dry_run || $RM conftest
+	  if $LTCC $LTCFLAGS -o conftest conftest.c $deplibs; then
+	    ldd_output=`ldd conftest`
+	    for i in $deplibs; do
+	      case $i in
+	      -l*)
+		func_stripname -l '' "$i"
+		name=$func_stripname_result
+		if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+		  case " $predeps $postdeps " in
+		  *" $i "*)
+		    func_append newdeplibs " $i"
+		    i=""
+		    ;;
+		  esac
+		fi
+		if test -n "$i" ; then
+		  libname=`eval "\\$ECHO \"$libname_spec\""`
+		  deplib_matches=`eval "\\$ECHO \"$library_names_spec\""`
+		  set dummy $deplib_matches; shift
+		  deplib_match=$1
+		  if test `expr "$ldd_output" : ".*$deplib_match"` -ne 0 ; then
+		    func_append newdeplibs " $i"
+		  else
+		    droppeddeps=yes
+		    echo
+		    $ECHO "*** Warning: dynamic linker does not accept needed library $i."
+		    echo "*** I have the capability to make that library automatically link in when"
+		    echo "*** you link to this library.  But I can only do this if you have a"
+		    echo "*** shared version of the library, which I believe you do not have"
+		    echo "*** because a test_compile did reveal that the linker did not use it for"
+		    echo "*** its dynamic dependency list that programs get resolved with at runtime."
+		  fi
+		fi
+		;;
+	      *)
+		func_append newdeplibs " $i"
+		;;
+	      esac
+	    done
+	  else
+	    # Error occurred in the first compile.  Let's try to salvage
+	    # the situation: Compile a separate program for each library.
+	    for i in $deplibs; do
+	      case $i in
+	      -l*)
+		func_stripname -l '' "$i"
+		name=$func_stripname_result
+		$opt_dry_run || $RM conftest
+		if $LTCC $LTCFLAGS -o conftest conftest.c $i; then
+		  ldd_output=`ldd conftest`
+		  if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+		    case " $predeps $postdeps " in
+		    *" $i "*)
+		      func_append newdeplibs " $i"
+		      i=""
+		      ;;
+		    esac
+		  fi
+		  if test -n "$i" ; then
+		    libname=`eval "\\$ECHO \"$libname_spec\""`
+		    deplib_matches=`eval "\\$ECHO \"$library_names_spec\""`
+		    set dummy $deplib_matches; shift
+		    deplib_match=$1
+		    if test `expr "$ldd_output" : ".*$deplib_match"` -ne 0 ; then
+		      func_append newdeplibs " $i"
+		    else
+		      droppeddeps=yes
+		      echo
+		      $ECHO "*** Warning: dynamic linker does not accept needed library $i."
+		      echo "*** I have the capability to make that library automatically link in when"
+		      echo "*** you link to this library.  But I can only do this if you have a"
+		      echo "*** shared version of the library, which you do not appear to have"
+		      echo "*** because a test_compile did reveal that the linker did not use this one"
+		      echo "*** as a dynamic dependency that programs can get resolved with at runtime."
+		    fi
+		  fi
+		else
+		  droppeddeps=yes
+		  echo
+		  $ECHO "*** Warning!  Library $i is needed by this library but I was not able to"
+		  echo "*** make it link in!  You will probably need to install it or some"
+		  echo "*** library that it depends on before this library will be fully"
+		  echo "*** functional.  Installing it before continuing would be even better."
+		fi
+		;;
+	      *)
+		func_append newdeplibs " $i"
+		;;
+	      esac
+	    done
+	  fi
+	  ;;
+	file_magic*)
+	  set dummy $deplibs_check_method; shift
+	  file_magic_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"`
+	  for a_deplib in $deplibs; do
+	    case $a_deplib in
+	    -l*)
+	      func_stripname -l '' "$a_deplib"
+	      name=$func_stripname_result
+	      if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+		case " $predeps $postdeps " in
+		*" $a_deplib "*)
+		  func_append newdeplibs " $a_deplib"
+		  a_deplib=""
+		  ;;
+		esac
+	      fi
+	      if test -n "$a_deplib" ; then
+		libname=`eval "\\$ECHO \"$libname_spec\""`
+		if test -n "$file_magic_glob"; then
+		  libnameglob=`func_echo_all "$libname" | $SED -e $file_magic_glob`
+		else
+		  libnameglob=$libname
+		fi
+		test "$want_nocaseglob" = yes && nocaseglob=`shopt -p nocaseglob`
+		for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do
+		  if test "$want_nocaseglob" = yes; then
+		    shopt -s nocaseglob
+		    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`
+		    $nocaseglob
+		  else
+		    potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null`
+		  fi
+		  for potent_lib in $potential_libs; do
+		      # Follow soft links.
+		      if ls -lLd "$potent_lib" 2>/dev/null |
+			 $GREP " -> " >/dev/null; then
+			continue
+		      fi
+		      # The statement above tries to avoid entering an
+		      # endless loop below, in case of cyclic links.
+		      # We might still enter an endless loop, since a link
+		      # loop can be closed while we follow links,
+		      # but so what?
+		      potlib="$potent_lib"
+		      while test -h "$potlib" 2>/dev/null; do
+			potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'`
+			case $potliblink in
+			[\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";;
+			*) potlib=`$ECHO "$potlib" | $SED 's,[^/]*$,,'`"$potliblink";;
+			esac
+		      done
+		      if eval $file_magic_cmd \"\$potlib\" 2>/dev/null |
+			 $SED -e 10q |
+			 $EGREP "$file_magic_regex" > /dev/null; then
+			func_append newdeplibs " $a_deplib"
+			a_deplib=""
+			break 2
+		      fi
+		  done
+		done
+	      fi
+	      if test -n "$a_deplib" ; then
+		droppeddeps=yes
+		echo
+		$ECHO "*** Warning: linker path does not have real file for library $a_deplib."
+		echo "*** I have the capability to make that library automatically link in when"
+		echo "*** you link to this library.  But I can only do this if you have a"
+		echo "*** shared version of the library, which you do not appear to have"
+		echo "*** because I did check the linker path looking for a file starting"
+		if test -z "$potlib" ; then
+		  $ECHO "*** with $libname but no candidates were found. (...for file magic test)"
+		else
+		  $ECHO "*** with $libname and none of the candidates passed a file format test"
+		  $ECHO "*** using a file magic. Last file checked: $potlib"
+		fi
+	      fi
+	      ;;
+	    *)
+	      # Add a -L argument.
+	      func_append newdeplibs " $a_deplib"
+	      ;;
+	    esac
+	  done # Gone through all deplibs.
+	  ;;
+	match_pattern*)
+	  set dummy $deplibs_check_method; shift
+	  match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"`
+	  for a_deplib in $deplibs; do
+	    case $a_deplib in
+	    -l*)
+	      func_stripname -l '' "$a_deplib"
+	      name=$func_stripname_result
+	      if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+		case " $predeps $postdeps " in
+		*" $a_deplib "*)
+		  func_append newdeplibs " $a_deplib"
+		  a_deplib=""
+		  ;;
+		esac
+	      fi
+	      if test -n "$a_deplib" ; then
+		libname=`eval "\\$ECHO \"$libname_spec\""`
+		for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do
+		  potential_libs=`ls $i/$libname[.-]* 2>/dev/null`
+		  for potent_lib in $potential_libs; do
+		    potlib="$potent_lib" # see symlink-check above in file_magic test
+		    if eval "\$ECHO \"$potent_lib\"" 2>/dev/null | $SED 10q | \
+		       $EGREP "$match_pattern_regex" > /dev/null; then
+		      func_append newdeplibs " $a_deplib"
+		      a_deplib=""
+		      break 2
+		    fi
+		  done
+		done
+	      fi
+	      if test -n "$a_deplib" ; then
+		droppeddeps=yes
+		echo
+		$ECHO "*** Warning: linker path does not have real file for library $a_deplib."
+		echo "*** I have the capability to make that library automatically link in when"
+		echo "*** you link to this library.  But I can only do this if you have a"
+		echo "*** shared version of the library, which you do not appear to have"
+		echo "*** because I did check the linker path looking for a file starting"
+		if test -z "$potlib" ; then
+		  $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)"
+		else
+		  $ECHO "*** with $libname and none of the candidates passed a file format test"
+		  $ECHO "*** using a regex pattern. Last file checked: $potlib"
+		fi
+	      fi
+	      ;;
+	    *)
+	      # Add a -L argument.
+	      func_append newdeplibs " $a_deplib"
+	      ;;
+	    esac
+	  done # Gone through all deplibs.
+	  ;;
+	none | unknown | *)
+	  newdeplibs=""
+	  tmp_deplibs=`$ECHO " $deplibs" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'`
+	  if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
+	    for i in $predeps $postdeps ; do
+	      # can't use Xsed below, because $i might contain '/'
+	      tmp_deplibs=`$ECHO " $tmp_deplibs" | $SED "s,$i,,"`
+	    done
+	  fi
+	  case $tmp_deplibs in
+	  *[!\	\ ]*)
+	    echo
+	    if test "X$deplibs_check_method" = "Xnone"; then
+	      echo "*** Warning: inter-library dependencies are not supported in this platform."
+	    else
+	      echo "*** Warning: inter-library dependencies are not known to be supported."
+	    fi
+	    echo "*** All declared inter-library dependencies are being dropped."
+	    droppeddeps=yes
+	    ;;
+	  esac
+	  ;;
+	esac
+	versuffix=$versuffix_save
+	major=$major_save
+	release=$release_save
+	libname=$libname_save
+	name=$name_save
+
+	case $host in
+	*-*-rhapsody* | *-*-darwin1.[012])
+	  # On Rhapsody replace the C library with the System framework
+	  newdeplibs=`$ECHO " $newdeplibs" | $SED 's/ -lc / System.ltframework /'`
+	  ;;
+	esac
+
+	if test "$droppeddeps" = yes; then
+	  if test "$module" = yes; then
+	    echo
+	    echo "*** Warning: libtool could not satisfy all declared inter-library"
+	    $ECHO "*** dependencies of module $libname.  Therefore, libtool will create"
+	    echo "*** a static module, that should work as long as the dlopening"
+	    echo "*** application is linked with the -dlopen flag."
+	    if test -z "$global_symbol_pipe"; then
+	      echo
+	      echo "*** However, this would only work if libtool was able to extract symbol"
+	      echo "*** lists from a program, using \`nm' or equivalent, but libtool could"
+	      echo "*** not find such a program.  So, this module is probably useless."
+	      echo "*** \`nm' from GNU binutils and a full rebuild may help."
+	    fi
+	    if test "$build_old_libs" = no; then
+	      oldlibs="$output_objdir/$libname.$libext"
+	      build_libtool_libs=module
+	      build_old_libs=yes
+	    else
+	      build_libtool_libs=no
+	    fi
+	  else
+	    echo "*** The inter-library dependencies that have been dropped here will be"
+	    echo "*** automatically added whenever a program is linked with this library"
+	    echo "*** or is declared to -dlopen it."
+
+	    if test "$allow_undefined" = no; then
+	      echo
+	      echo "*** Since this library must not contain undefined symbols,"
+	      echo "*** because either the platform does not support them or"
+	      echo "*** it was explicitly requested with -no-undefined,"
+	      echo "*** libtool will only create a static version of it."
+	      if test "$build_old_libs" = no; then
+		oldlibs="$output_objdir/$libname.$libext"
+		build_libtool_libs=module
+		build_old_libs=yes
+	      else
+		build_libtool_libs=no
+	      fi
+	    fi
+	  fi
+	fi
+	# Done checking deplibs!
+	deplibs=$newdeplibs
+      fi
+      # Time to change all our "foo.ltframework" stuff back to "-framework foo"
+      case $host in
+	*-*-darwin*)
+	  newdeplibs=`$ECHO " $newdeplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	  new_inherited_linker_flags=`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	  deplibs=`$ECHO " $deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	  ;;
+      esac
+
+      # move library search paths that coincide with paths to not yet
+      # installed libraries to the beginning of the library search list
+      new_libs=
+      for path in $notinst_path; do
+	case " $new_libs " in
+	*" -L$path/$objdir "*) ;;
+	*)
+	  case " $deplibs " in
+	  *" -L$path/$objdir "*)
+	    func_append new_libs " -L$path/$objdir" ;;
+	  esac
+	  ;;
+	esac
+      done
+      for deplib in $deplibs; do
+	case $deplib in
+	-L*)
+	  case " $new_libs " in
+	  *" $deplib "*) ;;
+	  *) func_append new_libs " $deplib" ;;
+	  esac
+	  ;;
+	*) func_append new_libs " $deplib" ;;
+	esac
+      done
+      deplibs="$new_libs"
+
+      # All the library-specific variables (install_libdir is set above).
+      library_names=
+      old_library=
+      dlname=
+
+      # Test again, we may have decided not to build it any more
+      if test "$build_libtool_libs" = yes; then
+	# Remove ${wl} instances when linking with ld.
+	# FIXME: should test the right _cmds variable.
+	case $archive_cmds in
+	  *\$LD\ *) wl= ;;
+        esac
+	if test "$hardcode_into_libs" = yes; then
+	  # Hardcode the library paths
+	  hardcode_libdirs=
+	  dep_rpath=
+	  rpath="$finalize_rpath"
+	  test "$opt_mode" != relink && rpath="$compile_rpath$rpath"
+	  for libdir in $rpath; do
+	    if test -n "$hardcode_libdir_flag_spec"; then
+	      if test -n "$hardcode_libdir_separator"; then
+		func_replace_sysroot "$libdir"
+		libdir=$func_replace_sysroot_result
+		if test -z "$hardcode_libdirs"; then
+		  hardcode_libdirs="$libdir"
+		else
+		  # Just accumulate the unique libdirs.
+		  case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in
+		  *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*)
+		    ;;
+		  *)
+		    func_append hardcode_libdirs "$hardcode_libdir_separator$libdir"
+		    ;;
+		  esac
+		fi
+	      else
+		eval flag=\"$hardcode_libdir_flag_spec\"
+		func_append dep_rpath " $flag"
+	      fi
+	    elif test -n "$runpath_var"; then
+	      case "$perm_rpath " in
+	      *" $libdir "*) ;;
+	      *) func_append perm_rpath " $libdir" ;;
+	      esac
+	    fi
+	  done
+	  # Substitute the hardcoded libdirs into the rpath.
+	  if test -n "$hardcode_libdir_separator" &&
+	     test -n "$hardcode_libdirs"; then
+	    libdir="$hardcode_libdirs"
+	    eval "dep_rpath=\"$hardcode_libdir_flag_spec\""
+	  fi
+	  if test -n "$runpath_var" && test -n "$perm_rpath"; then
+	    # We should set the runpath_var.
+	    rpath=
+	    for dir in $perm_rpath; do
+	      func_append rpath "$dir:"
+	    done
+	    eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var"
+	  fi
+	  test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs"
+	fi
+
+	shlibpath="$finalize_shlibpath"
+	test "$opt_mode" != relink && shlibpath="$compile_shlibpath$shlibpath"
+	if test -n "$shlibpath"; then
+	  eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var"
+	fi
+
+	# Get the real and link names of the library.
+	eval shared_ext=\"$shrext_cmds\"
+	eval library_names=\"$library_names_spec\"
+	set dummy $library_names
+	shift
+	realname="$1"
+	shift
+
+	if test -n "$soname_spec"; then
+	  eval soname=\"$soname_spec\"
+	else
+	  soname="$realname"
+	fi
+	if test -z "$dlname"; then
+	  dlname=$soname
+	fi
+
+	lib="$output_objdir/$realname"
+	linknames=
+	for link
+	do
+	  func_append linknames " $link"
+	done
+
+	# Use standard objects if they are pic
+	test -z "$pic_flag" && libobjs=`$ECHO "$libobjs" | $SP2NL | $SED "$lo2o" | $NL2SP`
+	test "X$libobjs" = "X " && libobjs=
+
+	delfiles=
+	if test -n "$export_symbols" && test -n "$include_expsyms"; then
+	  $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp"
+	  export_symbols="$output_objdir/$libname.uexp"
+	  func_append delfiles " $export_symbols"
+	fi
+
+	orig_export_symbols=
+	case $host_os in
+	cygwin* | mingw* | cegcc*)
+	  if test -n "$export_symbols" && test -z "$export_symbols_regex"; then
+	    # exporting using user supplied symfile
+	    if test "x`$SED 1q $export_symbols`" != xEXPORTS; then
+	      # and it's NOT already a .def file. Must figure out
+	      # which of the given symbols are data symbols and tag
+	      # them as such. So, trigger use of export_symbols_cmds.
+	      # export_symbols gets reassigned inside the "prepare
+	      # the list of exported symbols" if statement, so the
+	      # include_expsyms logic still works.
+	      orig_export_symbols="$export_symbols"
+	      export_symbols=
+	      always_export_symbols=yes
+	    fi
+	  fi
+	  ;;
+	esac
+
+	# Prepare the list of exported symbols
+	if test -z "$export_symbols"; then
+	  if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then
+	    func_verbose "generating symbol list for \`$libname.la'"
+	    export_symbols="$output_objdir/$libname.exp"
+	    $opt_dry_run || $RM $export_symbols
+	    cmds=$export_symbols_cmds
+	    save_ifs="$IFS"; IFS='~'
+	    for cmd1 in $cmds; do
+	      IFS="$save_ifs"
+	      # Take the normal branch if the nm_file_list_spec branch
+	      # doesn't work or if tool conversion is not needed.
+	      case $nm_file_list_spec~$to_tool_file_cmd in
+		*~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*)
+		  try_normal_branch=yes
+		  eval cmd=\"$cmd1\"
+		  func_len " $cmd"
+		  len=$func_len_result
+		  ;;
+		*)
+		  try_normal_branch=no
+		  ;;
+	      esac
+	      if test "$try_normal_branch" = yes \
+		 && { test "$len" -lt "$max_cmd_len" \
+		      || test "$max_cmd_len" -le -1; }
+	      then
+		func_show_eval "$cmd" 'exit $?'
+		skipped_export=false
+	      elif test -n "$nm_file_list_spec"; then
+		func_basename "$output"
+		output_la=$func_basename_result
+		save_libobjs=$libobjs
+		save_output=$output
+		output=${output_objdir}/${output_la}.nm
+		func_to_tool_file "$output"
+		libobjs=$nm_file_list_spec$func_to_tool_file_result
+		func_append delfiles " $output"
+		func_verbose "creating $NM input file list: $output"
+		for obj in $save_libobjs; do
+		  func_to_tool_file "$obj"
+		  $ECHO "$func_to_tool_file_result"
+		done > "$output"
+		eval cmd=\"$cmd1\"
+		func_show_eval "$cmd" 'exit $?'
+		output=$save_output
+		libobjs=$save_libobjs
+		skipped_export=false
+	      else
+		# The command line is too long to execute in one step.
+		func_verbose "using reloadable object file for export list..."
+		skipped_export=:
+		# Break out early, otherwise skipped_export may be
+		# set to false by a later but shorter cmd.
+		break
+	      fi
+	    done
+	    IFS="$save_ifs"
+	    if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then
+	      func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"'
+	      func_show_eval '$MV "${export_symbols}T" "$export_symbols"'
+	    fi
+	  fi
+	fi
+
+	if test -n "$export_symbols" && test -n "$include_expsyms"; then
+	  tmp_export_symbols="$export_symbols"
+	  test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols"
+	  $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"'
+	fi
+
+	if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then
+	  # The given exports_symbols file has to be filtered, so filter it.
+	  func_verbose "filter symbol list for \`$libname.la' to tag DATA exports"
+	  # FIXME: $output_objdir/$libname.filter potentially contains lots of
+	  # 's' commands which not all seds can handle. GNU sed should be fine
+	  # though. Also, the filter scales superlinearly with the number of
+	  # global variables. join(1) would be nice here, but unfortunately
+	  # isn't a blessed tool.
+	  $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter
+	  func_append delfiles " $export_symbols $output_objdir/$libname.filter"
+	  export_symbols=$output_objdir/$libname.def
+	  $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols
+	fi
+
+	tmp_deplibs=
+	for test_deplib in $deplibs; do
+	  case " $convenience " in
+	  *" $test_deplib "*) ;;
+	  *)
+	    func_append tmp_deplibs " $test_deplib"
+	    ;;
+	  esac
+	done
+	deplibs="$tmp_deplibs"
+
+	if test -n "$convenience"; then
+	  if test -n "$whole_archive_flag_spec" &&
+	    test "$compiler_needs_object" = yes &&
+	    test -z "$libobjs"; then
+	    # extract the archives, so we have objects to list.
+	    # TODO: could optimize this to just extract one archive.
+	    whole_archive_flag_spec=
+	  fi
+	  if test -n "$whole_archive_flag_spec"; then
+	    save_libobjs=$libobjs
+	    eval libobjs=\"\$libobjs $whole_archive_flag_spec\"
+	    test "X$libobjs" = "X " && libobjs=
+	  else
+	    gentop="$output_objdir/${outputname}x"
+	    func_append generated " $gentop"
+
+	    func_extract_archives $gentop $convenience
+	    func_append libobjs " $func_extract_archives_result"
+	    test "X$libobjs" = "X " && libobjs=
+	  fi
+	fi
+
+	if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then
+	  eval flag=\"$thread_safe_flag_spec\"
+	  func_append linker_flags " $flag"
+	fi
+
+	# Make a backup of the uninstalled library when relinking
+	if test "$opt_mode" = relink; then
+	  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $?
+	fi
+
+	# Do each of the archive commands.
+	if test "$module" = yes && test -n "$module_cmds" ; then
+	  if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then
+	    eval test_cmds=\"$module_expsym_cmds\"
+	    cmds=$module_expsym_cmds
+	  else
+	    eval test_cmds=\"$module_cmds\"
+	    cmds=$module_cmds
+	  fi
+	else
+	  if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then
+	    eval test_cmds=\"$archive_expsym_cmds\"
+	    cmds=$archive_expsym_cmds
+	  else
+	    eval test_cmds=\"$archive_cmds\"
+	    cmds=$archive_cmds
+	  fi
+	fi
+
+	if test "X$skipped_export" != "X:" &&
+	   func_len " $test_cmds" &&
+	   len=$func_len_result &&
+	   test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then
+	  :
+	else
+	  # The command line is too long to link in one step, link piecewise
+	  # or, if using GNU ld and skipped_export is not :, use a linker
+	  # script.
+
+	  # Save the value of $output and $libobjs because we want to
+	  # use them later.  If we have whole_archive_flag_spec, we
+	  # want to use save_libobjs as it was before
+	  # whole_archive_flag_spec was expanded, because we can't
+	  # assume the linker understands whole_archive_flag_spec.
+	  # This may have to be revisited, in case too many
+	  # convenience libraries get linked in and end up exceeding
+	  # the spec.
+	  if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then
+	    save_libobjs=$libobjs
+	  fi
+	  save_output=$output
+	  func_basename "$output"
+	  output_la=$func_basename_result
+
+	  # Clear the reloadable object creation command queue and
+	  # initialize k to one.
+	  test_cmds=
+	  concat_cmds=
+	  objlist=
+	  last_robj=
+	  k=1
+
+	  if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then
+	    output=${output_objdir}/${output_la}.lnkscript
+	    func_verbose "creating GNU ld script: $output"
+	    echo 'INPUT (' > $output
+	    for obj in $save_libobjs
+	    do
+	      func_to_tool_file "$obj"
+	      $ECHO "$func_to_tool_file_result" >> $output
+	    done
+	    echo ')' >> $output
+	    func_append delfiles " $output"
+	    func_to_tool_file "$output"
+	    output=$func_to_tool_file_result
+	  elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then
+	    output=${output_objdir}/${output_la}.lnk
+	    func_verbose "creating linker input file list: $output"
+	    : > $output
+	    set x $save_libobjs
+	    shift
+	    firstobj=
+	    if test "$compiler_needs_object" = yes; then
+	      firstobj="$1 "
+	      shift
+	    fi
+	    for obj
+	    do
+	      func_to_tool_file "$obj"
+	      $ECHO "$func_to_tool_file_result" >> $output
+	    done
+	    func_append delfiles " $output"
+	    func_to_tool_file "$output"
+	    output=$firstobj\"$file_list_spec$func_to_tool_file_result\"
+	  else
+	    if test -n "$save_libobjs"; then
+	      func_verbose "creating reloadable object files..."
+	      output=$output_objdir/$output_la-${k}.$objext
+	      eval test_cmds=\"$reload_cmds\"
+	      func_len " $test_cmds"
+	      len0=$func_len_result
+	      len=$len0
+
+	      # Loop over the list of objects to be linked.
+	      for obj in $save_libobjs
+	      do
+		func_len " $obj"
+		func_arith $len + $func_len_result
+		len=$func_arith_result
+		if test "X$objlist" = X ||
+		   test "$len" -lt "$max_cmd_len"; then
+		  func_append objlist " $obj"
+		else
+		  # The command $test_cmds is almost too long, add a
+		  # command to the queue.
+		  if test "$k" -eq 1 ; then
+		    # The first file doesn't have a previous command to add.
+		    reload_objs=$objlist
+		    eval concat_cmds=\"$reload_cmds\"
+		  else
+		    # All subsequent reloadable object files will link in
+		    # the last one created.
+		    reload_objs="$objlist $last_robj"
+		    eval concat_cmds=\"\$concat_cmds~$reload_cmds~\$RM $last_robj\"
+		  fi
+		  last_robj=$output_objdir/$output_la-${k}.$objext
+		  func_arith $k + 1
+		  k=$func_arith_result
+		  output=$output_objdir/$output_la-${k}.$objext
+		  objlist=" $obj"
+		  func_len " $last_robj"
+		  func_arith $len0 + $func_len_result
+		  len=$func_arith_result
+		fi
+	      done
+	      # Handle the remaining objects by creating one last
+	      # reloadable object file.  All subsequent reloadable object
+	      # files will link in the last one created.
+	      test -z "$concat_cmds" || concat_cmds=$concat_cmds~
+	      reload_objs="$objlist $last_robj"
+	      eval concat_cmds=\"\${concat_cmds}$reload_cmds\"
+	      if test -n "$last_robj"; then
+	        eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\"
+	      fi
+	      func_append delfiles " $output"
+
+	    else
+	      output=
+	    fi
+
+	    if ${skipped_export-false}; then
+	      func_verbose "generating symbol list for \`$libname.la'"
+	      export_symbols="$output_objdir/$libname.exp"
+	      $opt_dry_run || $RM $export_symbols
+	      libobjs=$output
+	      # Append the command to create the export file.
+	      test -z "$concat_cmds" || concat_cmds=$concat_cmds~
+	      eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\"
+	      if test -n "$last_robj"; then
+		eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\"
+	      fi
+	    fi
+
+	    test -n "$save_libobjs" &&
+	      func_verbose "creating a temporary reloadable object file: $output"
+
+	    # Loop through the commands generated above and execute them.
+	    save_ifs="$IFS"; IFS='~'
+	    for cmd in $concat_cmds; do
+	      IFS="$save_ifs"
+	      $opt_silent || {
+		  func_quote_for_expand "$cmd"
+		  eval "func_echo $func_quote_for_expand_result"
+	      }
+	      $opt_dry_run || eval "$cmd" || {
+		lt_exit=$?
+
+		# Restore the uninstalled library and exit
+		if test "$opt_mode" = relink; then
+		  ( cd "$output_objdir" && \
+		    $RM "${realname}T" && \
+		    $MV "${realname}U" "$realname" )
+		fi
+
+		exit $lt_exit
+	      }
+	    done
+	    IFS="$save_ifs"
+
+	    if test -n "$export_symbols_regex" && ${skipped_export-false}; then
+	      func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"'
+	      func_show_eval '$MV "${export_symbols}T" "$export_symbols"'
+	    fi
+	  fi
+
+          if ${skipped_export-false}; then
+	    if test -n "$export_symbols" && test -n "$include_expsyms"; then
+	      tmp_export_symbols="$export_symbols"
+	      test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols"
+	      $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"'
+	    fi
+
+	    if test -n "$orig_export_symbols"; then
+	      # The given exports_symbols file has to be filtered, so filter it.
+	      func_verbose "filter symbol list for \`$libname.la' to tag DATA exports"
+	      # FIXME: $output_objdir/$libname.filter potentially contains lots of
+	      # 's' commands which not all seds can handle. GNU sed should be fine
+	      # though. Also, the filter scales superlinearly with the number of
+	      # global variables. join(1) would be nice here, but unfortunately
+	      # isn't a blessed tool.
+	      $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter
+	      func_append delfiles " $export_symbols $output_objdir/$libname.filter"
+	      export_symbols=$output_objdir/$libname.def
+	      $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols
+	    fi
+	  fi
+
+	  libobjs=$output
+	  # Restore the value of output.
+	  output=$save_output
+
+	  if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then
+	    eval libobjs=\"\$libobjs $whole_archive_flag_spec\"
+	    test "X$libobjs" = "X " && libobjs=
+	  fi
+	  # Expand the library linking commands again to reset the
+	  # value of $libobjs for piecewise linking.
+
+	  # Do each of the archive commands.
+	  if test "$module" = yes && test -n "$module_cmds" ; then
+	    if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then
+	      cmds=$module_expsym_cmds
+	    else
+	      cmds=$module_cmds
+	    fi
+	  else
+	    if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then
+	      cmds=$archive_expsym_cmds
+	    else
+	      cmds=$archive_cmds
+	    fi
+	  fi
+	fi
+
+	if test -n "$delfiles"; then
+	  # Append the command to remove temporary files to $cmds.
+	  eval cmds=\"\$cmds~\$RM $delfiles\"
+	fi
+
+	# Add any objects from preloaded convenience libraries
+	if test -n "$dlprefiles"; then
+	  gentop="$output_objdir/${outputname}x"
+	  func_append generated " $gentop"
+
+	  func_extract_archives $gentop $dlprefiles
+	  func_append libobjs " $func_extract_archives_result"
+	  test "X$libobjs" = "X " && libobjs=
+	fi
+
+	save_ifs="$IFS"; IFS='~'
+	for cmd in $cmds; do
+	  IFS="$save_ifs"
+	  eval cmd=\"$cmd\"
+	  $opt_silent || {
+	    func_quote_for_expand "$cmd"
+	    eval "func_echo $func_quote_for_expand_result"
+	  }
+	  $opt_dry_run || eval "$cmd" || {
+	    lt_exit=$?
+
+	    # Restore the uninstalled library and exit
+	    if test "$opt_mode" = relink; then
+	      ( cd "$output_objdir" && \
+	        $RM "${realname}T" && \
+		$MV "${realname}U" "$realname" )
+	    fi
+
+	    exit $lt_exit
+	  }
+	done
+	IFS="$save_ifs"
+
+	# Restore the uninstalled library and exit
+	if test "$opt_mode" = relink; then
+	  $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $?
+
+	  if test -n "$convenience"; then
+	    if test -z "$whole_archive_flag_spec"; then
+	      func_show_eval '${RM}r "$gentop"'
+	    fi
+	  fi
+
+	  exit $EXIT_SUCCESS
+	fi
+
+	# Create links to the real library.
+	for linkname in $linknames; do
+	  if test "$realname" != "$linkname"; then
+	    func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?'
+	  fi
+	done
+
+	# If -module or -export-dynamic was specified, set the dlname.
+	if test "$module" = yes || test "$export_dynamic" = yes; then
+	  # On all known operating systems, these are identical.
+	  dlname="$soname"
+	fi
+      fi
+      ;;
+
+    obj)
+      if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then
+	func_warning "\`-dlopen' is ignored for objects"
+      fi
+
+      case " $deplibs" in
+      *\ -l* | *\ -L*)
+	func_warning "\`-l' and \`-L' are ignored for objects" ;;
+      esac
+
+      test -n "$rpath" && \
+	func_warning "\`-rpath' is ignored for objects"
+
+      test -n "$xrpath" && \
+	func_warning "\`-R' is ignored for objects"
+
+      test -n "$vinfo" && \
+	func_warning "\`-version-info' is ignored for objects"
+
+      test -n "$release" && \
+	func_warning "\`-release' is ignored for objects"
+
+      case $output in
+      *.lo)
+	test -n "$objs$old_deplibs" && \
+	  func_fatal_error "cannot build library object \`$output' from non-libtool objects"
+
+	libobj=$output
+	func_lo2o "$libobj"
+	obj=$func_lo2o_result
+	;;
+      *)
+	libobj=
+	obj="$output"
+	;;
+      esac
+
+      # Delete the old objects.
+      $opt_dry_run || $RM $obj $libobj
+
+      # Objects from convenience libraries.  This assumes
+      # single-version convenience libraries.  Whenever we create
+      # different ones for PIC/non-PIC, this we'll have to duplicate
+      # the extraction.
+      reload_conv_objs=
+      gentop=
+      # reload_cmds runs $LD directly, so let us get rid of
+      # -Wl from whole_archive_flag_spec and hope we can get by with
+      # turning comma into space..
+      wl=
+
+      if test -n "$convenience"; then
+	if test -n "$whole_archive_flag_spec"; then
+	  eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\"
+	  reload_conv_objs=$reload_objs\ `$ECHO "$tmp_whole_archive_flags" | $SED 's|,| |g'`
+	else
+	  gentop="$output_objdir/${obj}x"
+	  func_append generated " $gentop"
+
+	  func_extract_archives $gentop $convenience
+	  reload_conv_objs="$reload_objs $func_extract_archives_result"
+	fi
+      fi
+
+      # If we're not building shared, we need to use non_pic_objs
+      test "$build_libtool_libs" != yes && libobjs="$non_pic_objects"
+
+      # Create the old-style object.
+      reload_objs="$objs$old_deplibs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; /\.lib$/d; $lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test
+
+      output="$obj"
+      func_execute_cmds "$reload_cmds" 'exit $?'
+
+      # Exit if we aren't doing a library object file.
+      if test -z "$libobj"; then
+	if test -n "$gentop"; then
+	  func_show_eval '${RM}r "$gentop"'
+	fi
+
+	exit $EXIT_SUCCESS
+      fi
+
+      if test "$build_libtool_libs" != yes; then
+	if test -n "$gentop"; then
+	  func_show_eval '${RM}r "$gentop"'
+	fi
+
+	# Create an invalid libtool object if no PIC, so that we don't
+	# accidentally link it into a program.
+	# $show "echo timestamp > $libobj"
+	# $opt_dry_run || eval "echo timestamp > $libobj" || exit $?
+	exit $EXIT_SUCCESS
+      fi
+
+      if test -n "$pic_flag" || test "$pic_mode" != default; then
+	# Only do commands if we really have different PIC objects.
+	reload_objs="$libobjs $reload_conv_objs"
+	output="$libobj"
+	func_execute_cmds "$reload_cmds" 'exit $?'
+      fi
+
+      if test -n "$gentop"; then
+	func_show_eval '${RM}r "$gentop"'
+      fi
+
+      exit $EXIT_SUCCESS
+      ;;
+
+    prog)
+      case $host in
+	*cygwin*) func_stripname '' '.exe' "$output"
+	          output=$func_stripname_result.exe;;
+      esac
+      test -n "$vinfo" && \
+	func_warning "\`-version-info' is ignored for programs"
+
+      test -n "$release" && \
+	func_warning "\`-release' is ignored for programs"
+
+      test "$preload" = yes \
+        && test "$dlopen_support" = unknown \
+	&& test "$dlopen_self" = unknown \
+	&& test "$dlopen_self_static" = unknown && \
+	  func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support."
+
+      case $host in
+      *-*-rhapsody* | *-*-darwin1.[012])
+	# On Rhapsody replace the C library is the System framework
+	compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's/ -lc / System.ltframework /'`
+	finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's/ -lc / System.ltframework /'`
+	;;
+      esac
+
+      case $host in
+      *-*-darwin*)
+	# Don't allow lazy linking, it breaks C++ global constructors
+	# But is supposedly fixed on 10.4 or later (yay!).
+	if test "$tagname" = CXX ; then
+	  case ${MACOSX_DEPLOYMENT_TARGET-10.0} in
+	    10.[0123])
+	      func_append compile_command " ${wl}-bind_at_load"
+	      func_append finalize_command " ${wl}-bind_at_load"
+	    ;;
+	  esac
+	fi
+	# Time to change all our "foo.ltframework" stuff back to "-framework foo"
+	compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'`
+	;;
+      esac
+
+
+      # move library search paths that coincide with paths to not yet
+      # installed libraries to the beginning of the library search list
+      new_libs=
+      for path in $notinst_path; do
+	case " $new_libs " in
+	*" -L$path/$objdir "*) ;;
+	*)
+	  case " $compile_deplibs " in
+	  *" -L$path/$objdir "*)
+	    func_append new_libs " -L$path/$objdir" ;;
+	  esac
+	  ;;
+	esac
+      done
+      for deplib in $compile_deplibs; do
+	case $deplib in
+	-L*)
+	  case " $new_libs " in
+	  *" $deplib "*) ;;
+	  *) func_append new_libs " $deplib" ;;
+	  esac
+	  ;;
+	*) func_append new_libs " $deplib" ;;
+	esac
+      done
+      compile_deplibs="$new_libs"
+
+
+      func_append compile_command " $compile_deplibs"
+      func_append finalize_command " $finalize_deplibs"
+
+      if test -n "$rpath$xrpath"; then
+	# If the user specified any rpath flags, then add them.
+	for libdir in $rpath $xrpath; do
+	  # This is the magic to use -rpath.
+	  case "$finalize_rpath " in
+	  *" $libdir "*) ;;
+	  *) func_append finalize_rpath " $libdir" ;;
+	  esac
+	done
+      fi
+
+      # Now hardcode the library paths
+      rpath=
+      hardcode_libdirs=
+      for libdir in $compile_rpath $finalize_rpath; do
+	if test -n "$hardcode_libdir_flag_spec"; then
+	  if test -n "$hardcode_libdir_separator"; then
+	    if test -z "$hardcode_libdirs"; then
+	      hardcode_libdirs="$libdir"
+	    else
+	      # Just accumulate the unique libdirs.
+	      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in
+	      *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*)
+		;;
+	      *)
+		func_append hardcode_libdirs "$hardcode_libdir_separator$libdir"
+		;;
+	      esac
+	    fi
+	  else
+	    eval flag=\"$hardcode_libdir_flag_spec\"
+	    func_append rpath " $flag"
+	  fi
+	elif test -n "$runpath_var"; then
+	  case "$perm_rpath " in
+	  *" $libdir "*) ;;
+	  *) func_append perm_rpath " $libdir" ;;
+	  esac
+	fi
+	case $host in
+	*-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*)
+	  testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'`
+	  case :$dllsearchpath: in
+	  *":$libdir:"*) ;;
+	  ::) dllsearchpath=$libdir;;
+	  *) func_append dllsearchpath ":$libdir";;
+	  esac
+	  case :$dllsearchpath: in
+	  *":$testbindir:"*) ;;
+	  ::) dllsearchpath=$testbindir;;
+	  *) func_append dllsearchpath ":$testbindir";;
+	  esac
+	  ;;
+	esac
+      done
+      # Substitute the hardcoded libdirs into the rpath.
+      if test -n "$hardcode_libdir_separator" &&
+	 test -n "$hardcode_libdirs"; then
+	libdir="$hardcode_libdirs"
+	eval rpath=\" $hardcode_libdir_flag_spec\"
+      fi
+      compile_rpath="$rpath"
+
+      rpath=
+      hardcode_libdirs=
+      for libdir in $finalize_rpath; do
+	if test -n "$hardcode_libdir_flag_spec"; then
+	  if test -n "$hardcode_libdir_separator"; then
+	    if test -z "$hardcode_libdirs"; then
+	      hardcode_libdirs="$libdir"
+	    else
+	      # Just accumulate the unique libdirs.
+	      case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in
+	      *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*)
+		;;
+	      *)
+		func_append hardcode_libdirs "$hardcode_libdir_separator$libdir"
+		;;
+	      esac
+	    fi
+	  else
+	    eval flag=\"$hardcode_libdir_flag_spec\"
+	    func_append rpath " $flag"
+	  fi
+	elif test -n "$runpath_var"; then
+	  case "$finalize_perm_rpath " in
+	  *" $libdir "*) ;;
+	  *) func_append finalize_perm_rpath " $libdir" ;;
+	  esac
+	fi
+      done
+      # Substitute the hardcoded libdirs into the rpath.
+      if test -n "$hardcode_libdir_separator" &&
+	 test -n "$hardcode_libdirs"; then
+	libdir="$hardcode_libdirs"
+	eval rpath=\" $hardcode_libdir_flag_spec\"
+      fi
+      finalize_rpath="$rpath"
+
+      if test -n "$libobjs" && test "$build_old_libs" = yes; then
+	# Transform all the library objects into standard objects.
+	compile_command=`$ECHO "$compile_command" | $SP2NL | $SED "$lo2o" | $NL2SP`
+	finalize_command=`$ECHO "$finalize_command" | $SP2NL | $SED "$lo2o" | $NL2SP`
+      fi
+
+      func_generate_dlsyms "$outputname" "@PROGRAM@" "no"
+
+      # template prelinking step
+      if test -n "$prelink_cmds"; then
+	func_execute_cmds "$prelink_cmds" 'exit $?'
+      fi
+
+      wrappers_required=yes
+      case $host in
+      *cegcc* | *mingw32ce*)
+        # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway.
+        wrappers_required=no
+        ;;
+      *cygwin* | *mingw* )
+        if test "$build_libtool_libs" != yes; then
+          wrappers_required=no
+        fi
+        ;;
+      *)
+        if test "$need_relink" = no || test "$build_libtool_libs" != yes; then
+          wrappers_required=no
+        fi
+        ;;
+      esac
+      if test "$wrappers_required" = no; then
+	# Replace the output file specification.
+	compile_command=`$ECHO "$compile_command" | $SED 's%@OUTPUT@%'"$output"'%g'`
+	link_command="$compile_command$compile_rpath"
+
+	# We have no uninstalled library dependencies, so finalize right now.
+	exit_status=0
+	func_show_eval "$link_command" 'exit_status=$?'
+
+	if test -n "$postlink_cmds"; then
+	  func_to_tool_file "$output"
+	  postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'`
+	  func_execute_cmds "$postlink_cmds" 'exit $?'
+	fi
+
+	# Delete the generated files.
+	if test -f "$output_objdir/${outputname}S.${objext}"; then
+	  func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"'
+	fi
+
+	exit $exit_status
+      fi
+
+      if test -n "$compile_shlibpath$finalize_shlibpath"; then
+	compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command"
+      fi
+      if test -n "$finalize_shlibpath"; then
+	finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command"
+      fi
+
+      compile_var=
+      finalize_var=
+      if test -n "$runpath_var"; then
+	if test -n "$perm_rpath"; then
+	  # We should set the runpath_var.
+	  rpath=
+	  for dir in $perm_rpath; do
+	    func_append rpath "$dir:"
+	  done
+	  compile_var="$runpath_var=\"$rpath\$$runpath_var\" "
+	fi
+	if test -n "$finalize_perm_rpath"; then
+	  # We should set the runpath_var.
+	  rpath=
+	  for dir in $finalize_perm_rpath; do
+	    func_append rpath "$dir:"
+	  done
+	  finalize_var="$runpath_var=\"$rpath\$$runpath_var\" "
+	fi
+      fi
+
+      if test "$no_install" = yes; then
+	# We don't need to create a wrapper script.
+	link_command="$compile_var$compile_command$compile_rpath"
+	# Replace the output file specification.
+	link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output"'%g'`
+	# Delete the old output file.
+	$opt_dry_run || $RM $output
+	# Link the executable and exit
+	func_show_eval "$link_command" 'exit $?'
+
+	if test -n "$postlink_cmds"; then
+	  func_to_tool_file "$output"
+	  postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'`
+	  func_execute_cmds "$postlink_cmds" 'exit $?'
+	fi
+
+	exit $EXIT_SUCCESS
+      fi
+
+      if test "$hardcode_action" = relink; then
+	# Fast installation is not supported
+	link_command="$compile_var$compile_command$compile_rpath"
+	relink_command="$finalize_var$finalize_command$finalize_rpath"
+
+	func_warning "this platform does not like uninstalled shared libraries"
+	func_warning "\`$output' will be relinked during installation"
+      else
+	if test "$fast_install" != no; then
+	  link_command="$finalize_var$compile_command$finalize_rpath"
+	  if test "$fast_install" = yes; then
+	    relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'`
+	  else
+	    # fast_install is set to needless
+	    relink_command=
+	  fi
+	else
+	  link_command="$compile_var$compile_command$compile_rpath"
+	  relink_command="$finalize_var$finalize_command$finalize_rpath"
+	fi
+      fi
+
+      # Replace the output file specification.
+      link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'`
+
+      # Delete the old output files.
+      $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname
+
+      func_show_eval "$link_command" 'exit $?'
+
+      if test -n "$postlink_cmds"; then
+	func_to_tool_file "$output_objdir/$outputname"
+	postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'`
+	func_execute_cmds "$postlink_cmds" 'exit $?'
+      fi
+
+      # Now create the wrapper script.
+      func_verbose "creating $output"
+
+      # Quote the relink command for shipping.
+      if test -n "$relink_command"; then
+	# Preserve any variables that may affect compiler behavior
+	for var in $variables_saved_for_relink; do
+	  if eval test -z \"\${$var+set}\"; then
+	    relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command"
+	  elif eval var_value=\$$var; test -z "$var_value"; then
+	    relink_command="$var=; export $var; $relink_command"
+	  else
+	    func_quote_for_eval "$var_value"
+	    relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command"
+	  fi
+	done
+	relink_command="(cd `pwd`; $relink_command)"
+	relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"`
+      fi
+
+      # Only actually do things if not in dry run mode.
+      $opt_dry_run || {
+	# win32 will think the script is a binary if it has
+	# a .exe suffix, so we strip it off here.
+	case $output in
+	  *.exe) func_stripname '' '.exe' "$output"
+	         output=$func_stripname_result ;;
+	esac
+	# test for cygwin because mv fails w/o .exe extensions
+	case $host in
+	  *cygwin*)
+	    exeext=.exe
+	    func_stripname '' '.exe' "$outputname"
+	    outputname=$func_stripname_result ;;
+	  *) exeext= ;;
+	esac
+	case $host in
+	  *cygwin* | *mingw* )
+	    func_dirname_and_basename "$output" "" "."
+	    output_name=$func_basename_result
+	    output_path=$func_dirname_result
+	    cwrappersource="$output_path/$objdir/lt-$output_name.c"
+	    cwrapper="$output_path/$output_name.exe"
+	    $RM $cwrappersource $cwrapper
+	    trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15
+
+	    func_emit_cwrapperexe_src > $cwrappersource
+
+	    # The wrapper executable is built using the $host compiler,
+	    # because it contains $host paths and files. If cross-
+	    # compiling, it, like the target executable, must be
+	    # executed on the $host or under an emulation environment.
+	    $opt_dry_run || {
+	      $LTCC $LTCFLAGS -o $cwrapper $cwrappersource
+	      $STRIP $cwrapper
+	    }
+
+	    # Now, create the wrapper script for func_source use:
+	    func_ltwrapper_scriptname $cwrapper
+	    $RM $func_ltwrapper_scriptname_result
+	    trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15
+	    $opt_dry_run || {
+	      # note: this script will not be executed, so do not chmod.
+	      if test "x$build" = "x$host" ; then
+		$cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result
+	      else
+		func_emit_wrapper no > $func_ltwrapper_scriptname_result
+	      fi
+	    }
+	  ;;
+	  * )
+	    $RM $output
+	    trap "$RM $output; exit $EXIT_FAILURE" 1 2 15
+
+	    func_emit_wrapper no > $output
+	    chmod +x $output
+	  ;;
+	esac
+      }
+      exit $EXIT_SUCCESS
+      ;;
+    esac
+
+    # See if we need to build an old-fashioned archive.
+    for oldlib in $oldlibs; do
+
+      if test "$build_libtool_libs" = convenience; then
+	oldobjs="$libobjs_save $symfileobj"
+	addlibs="$convenience"
+	build_libtool_libs=no
+      else
+	if test "$build_libtool_libs" = module; then
+	  oldobjs="$libobjs_save"
+	  build_libtool_libs=no
+	else
+	  oldobjs="$old_deplibs $non_pic_objects"
+	  if test "$preload" = yes && test -f "$symfileobj"; then
+	    func_append oldobjs " $symfileobj"
+	  fi
+	fi
+	addlibs="$old_convenience"
+      fi
+
+      if test -n "$addlibs"; then
+	gentop="$output_objdir/${outputname}x"
+	func_append generated " $gentop"
+
+	func_extract_archives $gentop $addlibs
+	func_append oldobjs " $func_extract_archives_result"
+      fi
+
+      # Do each command in the archive commands.
+      if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then
+	cmds=$old_archive_from_new_cmds
+      else
+
+	# Add any objects from preloaded convenience libraries
+	if test -n "$dlprefiles"; then
+	  gentop="$output_objdir/${outputname}x"
+	  func_append generated " $gentop"
+
+	  func_extract_archives $gentop $dlprefiles
+	  func_append oldobjs " $func_extract_archives_result"
+	fi
+
+	# POSIX demands no paths to be encoded in archives.  We have
+	# to avoid creating archives with duplicate basenames if we
+	# might have to extract them afterwards, e.g., when creating a
+	# static archive out of a convenience library, or when linking
+	# the entirety of a libtool archive into another (currently
+	# not supported by libtool).
+	if (for obj in $oldobjs
+	    do
+	      func_basename "$obj"
+	      $ECHO "$func_basename_result"
+	    done | sort | sort -uc >/dev/null 2>&1); then
+	  :
+	else
+	  echo "copying selected object files to avoid basename conflicts..."
+	  gentop="$output_objdir/${outputname}x"
+	  func_append generated " $gentop"
+	  func_mkdir_p "$gentop"
+	  save_oldobjs=$oldobjs
+	  oldobjs=
+	  counter=1
+	  for obj in $save_oldobjs
+	  do
+	    func_basename "$obj"
+	    objbase="$func_basename_result"
+	    case " $oldobjs " in
+	    " ") oldobjs=$obj ;;
+	    *[\ /]"$objbase "*)
+	      while :; do
+		# Make sure we don't pick an alternate name that also
+		# overlaps.
+		newobj=lt$counter-$objbase
+		func_arith $counter + 1
+		counter=$func_arith_result
+		case " $oldobjs " in
+		*[\ /]"$newobj "*) ;;
+		*) if test ! -f "$gentop/$newobj"; then break; fi ;;
+		esac
+	      done
+	      func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj"
+	      func_append oldobjs " $gentop/$newobj"
+	      ;;
+	    *) func_append oldobjs " $obj" ;;
+	    esac
+	  done
+	fi
+	func_to_tool_file "$oldlib" func_convert_file_msys_to_w32
+	tool_oldlib=$func_to_tool_file_result
+	eval cmds=\"$old_archive_cmds\"
+
+	func_len " $cmds"
+	len=$func_len_result
+	if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then
+	  cmds=$old_archive_cmds
+	elif test -n "$archiver_list_spec"; then
+	  func_verbose "using command file archive linking..."
+	  for obj in $oldobjs
+	  do
+	    func_to_tool_file "$obj"
+	    $ECHO "$func_to_tool_file_result"
+	  done > $output_objdir/$libname.libcmd
+	  func_to_tool_file "$output_objdir/$libname.libcmd"
+	  oldobjs=" $archiver_list_spec$func_to_tool_file_result"
+	  cmds=$old_archive_cmds
+	else
+	  # the command line is too long to link in one step, link in parts
+	  func_verbose "using piecewise archive linking..."
+	  save_RANLIB=$RANLIB
+	  RANLIB=:
+	  objlist=
+	  concat_cmds=
+	  save_oldobjs=$oldobjs
+	  oldobjs=
+	  # Is there a better way of finding the last object in the list?
+	  for obj in $save_oldobjs
+	  do
+	    last_oldobj=$obj
+	  done
+	  eval test_cmds=\"$old_archive_cmds\"
+	  func_len " $test_cmds"
+	  len0=$func_len_result
+	  len=$len0
+	  for obj in $save_oldobjs
+	  do
+	    func_len " $obj"
+	    func_arith $len + $func_len_result
+	    len=$func_arith_result
+	    func_append objlist " $obj"
+	    if test "$len" -lt "$max_cmd_len"; then
+	      :
+	    else
+	      # the above command should be used before it gets too long
+	      oldobjs=$objlist
+	      if test "$obj" = "$last_oldobj" ; then
+		RANLIB=$save_RANLIB
+	      fi
+	      test -z "$concat_cmds" || concat_cmds=$concat_cmds~
+	      eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\"
+	      objlist=
+	      len=$len0
+	    fi
+	  done
+	  RANLIB=$save_RANLIB
+	  oldobjs=$objlist
+	  if test "X$oldobjs" = "X" ; then
+	    eval cmds=\"\$concat_cmds\"
+	  else
+	    eval cmds=\"\$concat_cmds~\$old_archive_cmds\"
+	  fi
+	fi
+      fi
+      func_execute_cmds "$cmds" 'exit $?'
+    done
+
+    test -n "$generated" && \
+      func_show_eval "${RM}r$generated"
+
+    # Now create the libtool archive.
+    case $output in
+    *.la)
+      old_library=
+      test "$build_old_libs" = yes && old_library="$libname.$libext"
+      func_verbose "creating $output"
+
+      # Preserve any variables that may affect compiler behavior
+      for var in $variables_saved_for_relink; do
+	if eval test -z \"\${$var+set}\"; then
+	  relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command"
+	elif eval var_value=\$$var; test -z "$var_value"; then
+	  relink_command="$var=; export $var; $relink_command"
+	else
+	  func_quote_for_eval "$var_value"
+	  relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command"
+	fi
+      done
+      # Quote the link command for shipping.
+      relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)"
+      relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"`
+      if test "$hardcode_automatic" = yes ; then
+	relink_command=
+      fi
+
+      # Only create the output if not a dry run.
+      $opt_dry_run || {
+	for installed in no yes; do
+	  if test "$installed" = yes; then
+	    if test -z "$install_libdir"; then
+	      break
+	    fi
+	    output="$output_objdir/$outputname"i
+	    # Replace all uninstalled libtool libraries with the installed ones
+	    newdependency_libs=
+	    for deplib in $dependency_libs; do
+	      case $deplib in
+	      *.la)
+		func_basename "$deplib"
+		name="$func_basename_result"
+		func_resolve_sysroot "$deplib"
+		eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $func_resolve_sysroot_result`
+		test -z "$libdir" && \
+		  func_fatal_error "\`$deplib' is not a valid libtool archive"
+		func_append newdependency_libs " ${lt_sysroot:+=}$libdir/$name"
+		;;
+	      -L*)
+		func_stripname -L '' "$deplib"
+		func_replace_sysroot "$func_stripname_result"
+		func_append newdependency_libs " -L$func_replace_sysroot_result"
+		;;
+	      -R*)
+		func_stripname -R '' "$deplib"
+		func_replace_sysroot "$func_stripname_result"
+		func_append newdependency_libs " -R$func_replace_sysroot_result"
+		;;
+	      *) func_append newdependency_libs " $deplib" ;;
+	      esac
+	    done
+	    dependency_libs="$newdependency_libs"
+	    newdlfiles=
+
+	    for lib in $dlfiles; do
+	      case $lib in
+	      *.la)
+	        func_basename "$lib"
+		name="$func_basename_result"
+		eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib`
+		test -z "$libdir" && \
+		  func_fatal_error "\`$lib' is not a valid libtool archive"
+		func_append newdlfiles " ${lt_sysroot:+=}$libdir/$name"
+		;;
+	      *) func_append newdlfiles " $lib" ;;
+	      esac
+	    done
+	    dlfiles="$newdlfiles"
+	    newdlprefiles=
+	    for lib in $dlprefiles; do
+	      case $lib in
+	      *.la)
+		# Only pass preopened files to the pseudo-archive (for
+		# eventual linking with the app. that links it) if we
+		# didn't already link the preopened objects directly into
+		# the library:
+		func_basename "$lib"
+		name="$func_basename_result"
+		eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib`
+		test -z "$libdir" && \
+		  func_fatal_error "\`$lib' is not a valid libtool archive"
+		func_append newdlprefiles " ${lt_sysroot:+=}$libdir/$name"
+		;;
+	      esac
+	    done
+	    dlprefiles="$newdlprefiles"
+	  else
+	    newdlfiles=
+	    for lib in $dlfiles; do
+	      case $lib in
+		[\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;;
+		*) abs=`pwd`"/$lib" ;;
+	      esac
+	      func_append newdlfiles " $abs"
+	    done
+	    dlfiles="$newdlfiles"
+	    newdlprefiles=
+	    for lib in $dlprefiles; do
+	      case $lib in
+		[\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;;
+		*) abs=`pwd`"/$lib" ;;
+	      esac
+	      func_append newdlprefiles " $abs"
+	    done
+	    dlprefiles="$newdlprefiles"
+	  fi
+	  $RM $output
+	  # place dlname in correct position for cygwin
+	  # In fact, it would be nice if we could use this code for all target
+	  # systems that can't hard-code library paths into their executables
+	  # and that have no shared library path variable independent of PATH,
+	  # but it turns out we can't easily determine that from inspecting
+	  # libtool variables, so we have to hard-code the OSs to which it
+	  # applies here; at the moment, that means platforms that use the PE
+	  # object format with DLL files.  See the long comment at the top of
+	  # tests/bindir.at for full details.
+	  tdlname=$dlname
+	  case $host,$output,$installed,$module,$dlname in
+	    *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll)
+	      # If a -bindir argument was supplied, place the dll there.
+	      if test "x$bindir" != x ;
+	      then
+		func_relative_path "$install_libdir" "$bindir"
+		tdlname=$func_relative_path_result$dlname
+	      else
+		# Otherwise fall back on heuristic.
+		tdlname=../bin/$dlname
+	      fi
+	      ;;
+	  esac
+	  $ECHO > $output "\
+# $outputname - a libtool library file
+# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# The name that we can dlopen(3).
+dlname='$tdlname'
+
+# Names of this library.
+library_names='$library_names'
+
+# The name of the static archive.
+old_library='$old_library'
+
+# Linker flags that can not go in dependency_libs.
+inherited_linker_flags='$new_inherited_linker_flags'
+
+# Libraries that this one depends upon.
+dependency_libs='$dependency_libs'
+
+# Names of additional weak libraries provided by this library
+weak_library_names='$weak_libs'
+
+# Version information for $libname.
+current=$current
+age=$age
+revision=$revision
+
+# Is this an already installed library?
+installed=$installed
+
+# Should we warn about portability when linking against -modules?
+shouldnotlink=$module
+
+# Files to dlopen/dlpreopen
+dlopen='$dlfiles'
+dlpreopen='$dlprefiles'
+
+# Directory that this library needs to be installed in:
+libdir='$install_libdir'"
+	  if test "$installed" = no && test "$need_relink" = yes; then
+	    $ECHO >> $output "\
+relink_command=\"$relink_command\""
+	  fi
+	done
+      }
+
+      # Do a symbolic link so that the libtool archive can be found in
+      # LD_LIBRARY_PATH before the program is installed.
+      func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?'
+      ;;
+    esac
+    exit $EXIT_SUCCESS
+}
+
+{ test "$opt_mode" = link || test "$opt_mode" = relink; } &&
+    func_mode_link ${1+"$@"}
+
+
+# func_mode_uninstall arg...
+func_mode_uninstall ()
+{
+    $opt_debug
+    RM="$nonopt"
+    files=
+    rmforce=
+    exit_status=0
+
+    # This variable tells wrapper scripts just to set variables rather
+    # than running their programs.
+    libtool_install_magic="$magic"
+
+    for arg
+    do
+      case $arg in
+      -f) func_append RM " $arg"; rmforce=yes ;;
+      -*) func_append RM " $arg" ;;
+      *) func_append files " $arg" ;;
+      esac
+    done
+
+    test -z "$RM" && \
+      func_fatal_help "you must specify an RM program"
+
+    rmdirs=
+
+    for file in $files; do
+      func_dirname "$file" "" "."
+      dir="$func_dirname_result"
+      if test "X$dir" = X.; then
+	odir="$objdir"
+      else
+	odir="$dir/$objdir"
+      fi
+      func_basename "$file"
+      name="$func_basename_result"
+      test "$opt_mode" = uninstall && odir="$dir"
+
+      # Remember odir for removal later, being careful to avoid duplicates
+      if test "$opt_mode" = clean; then
+	case " $rmdirs " in
+	  *" $odir "*) ;;
+	  *) func_append rmdirs " $odir" ;;
+	esac
+      fi
+
+      # Don't error if the file doesn't exist and rm -f was used.
+      if { test -L "$file"; } >/dev/null 2>&1 ||
+	 { test -h "$file"; } >/dev/null 2>&1 ||
+	 test -f "$file"; then
+	:
+      elif test -d "$file"; then
+	exit_status=1
+	continue
+      elif test "$rmforce" = yes; then
+	continue
+      fi
+
+      rmfiles="$file"
+
+      case $name in
+      *.la)
+	# Possibly a libtool archive, so verify it.
+	if func_lalib_p "$file"; then
+	  func_source $dir/$name
+
+	  # Delete the libtool libraries and symlinks.
+	  for n in $library_names; do
+	    func_append rmfiles " $odir/$n"
+	  done
+	  test -n "$old_library" && func_append rmfiles " $odir/$old_library"
+
+	  case "$opt_mode" in
+	  clean)
+	    case " $library_names " in
+	    *" $dlname "*) ;;
+	    *) test -n "$dlname" && func_append rmfiles " $odir/$dlname" ;;
+	    esac
+	    test -n "$libdir" && func_append rmfiles " $odir/$name $odir/${name}i"
+	    ;;
+	  uninstall)
+	    if test -n "$library_names"; then
+	      # Do each command in the postuninstall commands.
+	      func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1'
+	    fi
+
+	    if test -n "$old_library"; then
+	      # Do each command in the old_postuninstall commands.
+	      func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1'
+	    fi
+	    # FIXME: should reinstall the best remaining shared library.
+	    ;;
+	  esac
+	fi
+	;;
+
+      *.lo)
+	# Possibly a libtool object, so verify it.
+	if func_lalib_p "$file"; then
+
+	  # Read the .lo file
+	  func_source $dir/$name
+
+	  # Add PIC object to the list of files to remove.
+	  if test -n "$pic_object" &&
+	     test "$pic_object" != none; then
+	    func_append rmfiles " $dir/$pic_object"
+	  fi
+
+	  # Add non-PIC object to the list of files to remove.
+	  if test -n "$non_pic_object" &&
+	     test "$non_pic_object" != none; then
+	    func_append rmfiles " $dir/$non_pic_object"
+	  fi
+	fi
+	;;
+
+      *)
+	if test "$opt_mode" = clean ; then
+	  noexename=$name
+	  case $file in
+	  *.exe)
+	    func_stripname '' '.exe' "$file"
+	    file=$func_stripname_result
+	    func_stripname '' '.exe' "$name"
+	    noexename=$func_stripname_result
+	    # $file with .exe has already been added to rmfiles,
+	    # add $file without .exe
+	    func_append rmfiles " $file"
+	    ;;
+	  esac
+	  # Do a test to see if this is a libtool program.
+	  if func_ltwrapper_p "$file"; then
+	    if func_ltwrapper_executable_p "$file"; then
+	      func_ltwrapper_scriptname "$file"
+	      relink_command=
+	      func_source $func_ltwrapper_scriptname_result
+	      func_append rmfiles " $func_ltwrapper_scriptname_result"
+	    else
+	      relink_command=
+	      func_source $dir/$noexename
+	    fi
+
+	    # note $name still contains .exe if it was in $file originally
+	    # as does the version of $file that was added into $rmfiles
+	    func_append rmfiles " $odir/$name $odir/${name}S.${objext}"
+	    if test "$fast_install" = yes && test -n "$relink_command"; then
+	      func_append rmfiles " $odir/lt-$name"
+	    fi
+	    if test "X$noexename" != "X$name" ; then
+	      func_append rmfiles " $odir/lt-${noexename}.c"
+	    fi
+	  fi
+	fi
+	;;
+      esac
+      func_show_eval "$RM $rmfiles" 'exit_status=1'
+    done
+
+    # Try to remove the ${objdir}s in the directories where we deleted files
+    for dir in $rmdirs; do
+      if test -d "$dir"; then
+	func_show_eval "rmdir $dir >/dev/null 2>&1"
+      fi
+    done
+
+    exit $exit_status
+}
+
+{ test "$opt_mode" = uninstall || test "$opt_mode" = clean; } &&
+    func_mode_uninstall ${1+"$@"}
+
+test -z "$opt_mode" && {
+  help="$generic_help"
+  func_fatal_help "you must specify a MODE"
+}
+
+test -z "$exec_cmd" && \
+  func_fatal_help "invalid operation mode \`$opt_mode'"
+
+if test -n "$exec_cmd"; then
+  eval exec "$exec_cmd"
+  exit $EXIT_FAILURE
+fi
+
+exit $exit_status
+
+
+# The TAGs below are defined such that we never get into a situation
+# in which we disable both kinds of libraries.  Given conflicting
+# choices, we go for a static library, that is the most portable,
+# since we can't tell whether shared libraries were disabled because
+# the user asked for that or because the platform doesn't support
+# them.  This is particularly important on AIX, because we don't
+# support having both static and shared libraries enabled at the same
+# time on that platform, so we default to a shared-only configuration.
+# If a disable-shared tag is given, we'll fallback to a static-only
+# configuration.  But we'll never go from static-only to shared-only.
+
+# ### BEGIN LIBTOOL TAG CONFIG: disable-shared
+build_libtool_libs=no
+build_old_libs=yes
+# ### END LIBTOOL TAG CONFIG: disable-shared
+
+# ### BEGIN LIBTOOL TAG CONFIG: disable-static
+build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac`
+# ### END LIBTOOL TAG CONFIG: disable-static
+
+# Local Variables:
+# mode:shell-script
+# sh-indentation:2
+# End:
+# vi:sw=2
+
diff -Nru igraph-0.6.5~quantal1/missing igraph-0.6.5/missing
--- igraph-0.6.5~quantal1/missing	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/missing	2013-03-03 01:29:38.000000000 +0000
@@ -0,0 +1,331 @@
+#! /bin/sh
+# Common stub for a few missing GNU programs while installing.
+
+scriptversion=2012-01-06.13; # UTC
+
+# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006,
+# 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
+# Originally by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
+
+# 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 2, 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/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+if test $# -eq 0; then
+  echo 1>&2 "Try \`$0 --help' for more information"
+  exit 1
+fi
+
+run=:
+sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p'
+sed_minuso='s/.* -o \([^ ]*\).*/\1/p'
+
+# In the cases where this matters, `missing' is being run in the
+# srcdir already.
+if test -f configure.ac; then
+  configure_ac=configure.ac
+else
+  configure_ac=configure.in
+fi
+
+msg="missing on your system"
+
+case $1 in
+--run)
+  # Try to run requested program, and just exit if it succeeds.
+  run=
+  shift
+  "$@" && exit 0
+  # Exit code 63 means version mismatch.  This often happens
+  # when the user try to use an ancient version of a tool on
+  # a file that requires a minimum version.  In this case we
+  # we should proceed has if the program had been absent, or
+  # if --run hadn't been passed.
+  if test $? = 63; then
+    run=:
+    msg="probably too old"
+  fi
+  ;;
+
+  -h|--h|--he|--hel|--help)
+    echo "\
+$0 [OPTION]... PROGRAM [ARGUMENT]...
+
+Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an
+error status if there is no known handling for PROGRAM.
+
+Options:
+  -h, --help      display this help and exit
+  -v, --version   output version information and exit
+  --run           try to run the given command, and emulate it if it fails
+
+Supported PROGRAM values:
+  aclocal      touch file \`aclocal.m4'
+  autoconf     touch file \`configure'
+  autoheader   touch file \`config.h.in'
+  autom4te     touch the output file, or create a stub one
+  automake     touch all \`Makefile.in' files
+  bison        create \`y.tab.[ch]', if possible, from existing .[ch]
+  flex         create \`lex.yy.c', if possible, from existing .c
+  help2man     touch the output file
+  lex          create \`lex.yy.c', if possible, from existing .c
+  makeinfo     touch the output file
+  yacc         create \`y.tab.[ch]', if possible, from existing .[ch]
+
+Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and
+\`g' are ignored when checking the name.
+
+Send bug reports to <bug-automake@gnu.org>."
+    exit $?
+    ;;
+
+  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)
+    echo "missing $scriptversion (GNU Automake)"
+    exit $?
+    ;;
+
+  -*)
+    echo 1>&2 "$0: Unknown \`$1' option"
+    echo 1>&2 "Try \`$0 --help' for more information"
+    exit 1
+    ;;
+
+esac
+
+# normalize program name to check for.
+program=`echo "$1" | sed '
+  s/^gnu-//; t
+  s/^gnu//; t
+  s/^g//; t'`
+
+# Now exit if we have it, but it failed.  Also exit now if we
+# don't have it and --version was passed (most likely to detect
+# the program).  This is about non-GNU programs, so use $1 not
+# $program.
+case $1 in
+  lex*|yacc*)
+    # Not GNU programs, they don't have --version.
+    ;;
+
+  *)
+    if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
+       # We have it, but it failed.
+       exit 1
+    elif test "x$2" = "x--version" || test "x$2" = "x--help"; then
+       # Could not run --version or --help.  This is probably someone
+       # running `$TOOL --version' or `$TOOL --help' to check whether
+       # $TOOL exists and not knowing $TOOL uses missing.
+       exit 1
+    fi
+    ;;
+esac
+
+# If it does not exist, or fails to run (possibly an outdated version),
+# try to emulate it.
+case $program in
+  aclocal*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified \`acinclude.m4' or \`${configure_ac}'.  You might want
+         to install the \`Automake' and \`Perl' packages.  Grab them from
+         any GNU archive site."
+    touch aclocal.m4
+    ;;
+
+  autoconf*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified \`${configure_ac}'.  You might want to install the
+         \`Autoconf' and \`GNU m4' packages.  Grab them from any GNU
+         archive site."
+    touch configure
+    ;;
+
+  autoheader*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified \`acconfig.h' or \`${configure_ac}'.  You might want
+         to install the \`Autoconf' and \`GNU m4' packages.  Grab them
+         from any GNU archive site."
+    files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}`
+    test -z "$files" && files="config.h"
+    touch_files=
+    for f in $files; do
+      case $f in
+      *:*) touch_files="$touch_files "`echo "$f" |
+				       sed -e 's/^[^:]*://' -e 's/:.*//'`;;
+      *) touch_files="$touch_files $f.in";;
+      esac
+    done
+    touch $touch_files
+    ;;
+
+  automake*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'.
+         You might want to install the \`Automake' and \`Perl' packages.
+         Grab them from any GNU archive site."
+    find . -type f -name Makefile.am -print |
+	   sed 's/\.am$/.in/' |
+	   while read f; do touch "$f"; done
+    ;;
+
+  autom4te*)
+    echo 1>&2 "\
+WARNING: \`$1' is needed, but is $msg.
+         You might have modified some files without having the
+         proper tools for further handling them.
+         You can get \`$1' as part of \`Autoconf' from any GNU
+         archive site."
+
+    file=`echo "$*" | sed -n "$sed_output"`
+    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
+    if test -f "$file"; then
+	touch $file
+    else
+	test -z "$file" || exec >$file
+	echo "#! /bin/sh"
+	echo "# Created by GNU Automake missing as a replacement of"
+	echo "#  $ $@"
+	echo "exit 0"
+	chmod +x $file
+	exit 1
+    fi
+    ;;
+
+  bison*|yacc*)
+    echo 1>&2 "\
+WARNING: \`$1' $msg.  You should only need it if
+         you modified a \`.y' file.  You may need the \`Bison' package
+         in order for those modifications to take effect.  You can get
+         \`Bison' from any GNU archive site."
+    rm -f y.tab.c y.tab.h
+    if test $# -ne 1; then
+        eval LASTARG=\${$#}
+	case $LASTARG in
+	*.y)
+	    SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'`
+	    if test -f "$SRCFILE"; then
+	         cp "$SRCFILE" y.tab.c
+	    fi
+	    SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'`
+	    if test -f "$SRCFILE"; then
+	         cp "$SRCFILE" y.tab.h
+	    fi
+	  ;;
+	esac
+    fi
+    if test ! -f y.tab.h; then
+	echo >y.tab.h
+    fi
+    if test ! -f y.tab.c; then
+	echo 'main() { return 0; }' >y.tab.c
+    fi
+    ;;
+
+  lex*|flex*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified a \`.l' file.  You may need the \`Flex' package
+         in order for those modifications to take effect.  You can get
+         \`Flex' from any GNU archive site."
+    rm -f lex.yy.c
+    if test $# -ne 1; then
+        eval LASTARG=\${$#}
+	case $LASTARG in
+	*.l)
+	    SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'`
+	    if test -f "$SRCFILE"; then
+	         cp "$SRCFILE" lex.yy.c
+	    fi
+	  ;;
+	esac
+    fi
+    if test ! -f lex.yy.c; then
+	echo 'main() { return 0; }' >lex.yy.c
+    fi
+    ;;
+
+  help2man*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+	 you modified a dependency of a manual page.  You may need the
+	 \`Help2man' package in order for those modifications to take
+	 effect.  You can get \`Help2man' from any GNU archive site."
+
+    file=`echo "$*" | sed -n "$sed_output"`
+    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
+    if test -f "$file"; then
+	touch $file
+    else
+	test -z "$file" || exec >$file
+	echo ".ab help2man is required to generate this page"
+	exit $?
+    fi
+    ;;
+
+  makeinfo*)
+    echo 1>&2 "\
+WARNING: \`$1' is $msg.  You should only need it if
+         you modified a \`.texi' or \`.texinfo' file, or any other file
+         indirectly affecting the aspect of the manual.  The spurious
+         call might also be the consequence of using a buggy \`make' (AIX,
+         DU, IRIX).  You might want to install the \`Texinfo' package or
+         the \`GNU make' package.  Grab either from any GNU archive site."
+    # The file to touch is that specified with -o ...
+    file=`echo "$*" | sed -n "$sed_output"`
+    test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
+    if test -z "$file"; then
+      # ... or it is the one specified with @setfilename ...
+      infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'`
+      file=`sed -n '
+	/^@setfilename/{
+	  s/.* \([^ ]*\) *$/\1/
+	  p
+	  q
+	}' $infile`
+      # ... or it is derived from the source name (dir/f.texi becomes f.info)
+      test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info
+    fi
+    # If the file does not exist, the user really needs makeinfo;
+    # let's fail without touching anything.
+    test -f $file || exit 1
+    touch $file
+    ;;
+
+  *)
+    echo 1>&2 "\
+WARNING: \`$1' is needed, and is $msg.
+         You might have modified some files without having the
+         proper tools for further handling them.  Check the \`README' file,
+         it often tells you about the needed prerequisites for installing
+         this package.  You may also peek at any GNU archive site, in case
+         some other package would contain this missing \`$1' program."
+    exit 1
+    ;;
+esac
+
+exit 0
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:
diff -Nru igraph-0.6.5~quantal1/msvc/igraph.sln igraph-0.6.5/msvc/igraph.sln
--- igraph-0.6.5~quantal1/msvc/igraph.sln	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/igraph.sln	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-Microsoft Visual Studio Solution File, Format Version 8.00
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "igraph", "igraph.vcproj", "{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}"
-	ProjectSection(ProjectDependencies) = postProject
-	EndProjectSection
-EndProject
-Global
-	GlobalSection(SolutionConfiguration) = preSolution
-		Debug = Debug
-		Release = Release
-	EndGlobalSection
-	GlobalSection(ProjectConfiguration) = postSolution
-		{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}.Debug.ActiveCfg = Debug|Win32
-		{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}.Debug.Build.0 = Debug|Win32
-		{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}.Release.ActiveCfg = Release|Win32
-		{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}.Release.Build.0 = Release|Win32
-	EndGlobalSection
-	GlobalSection(ExtensibilityGlobals) = postSolution
-	EndGlobalSection
-	GlobalSection(ExtensibilityAddIns) = postSolution
-	EndGlobalSection
-EndGlobal
diff -Nru igraph-0.6.5~quantal1/msvc/igraph.vcproj igraph-0.6.5/msvc/igraph.vcproj
--- igraph-0.6.5~quantal1/msvc/igraph.vcproj	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/igraph.vcproj	1970-01-01 00:00:00.000000000 +0000
@@ -1,124 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="igraph"
-	ProjectGUID="{54FFF7B3-3249-4BBE-93D2-71C11ABF0A6C}"
-	RootNamespace="igraph"
-	Keyword="Win32Proj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="4"
-			UseOfMFC="0"
-			CharacterSet="0">
-			<Tool
-				Name="VCCLCompilerTool"
-				AdditionalIncludeDirectories="$(ProjectDir)src;$(ProjectDir)winclude;$(ProjectDir)include"
-				PreprocessorDefinitions="Win32;WIN32;_WINDOWS;_USRDLL;NCOMPLEX;IGRAPH_EXPORTS;USE_CLOCK"
-				RuntimeLibrary="2"
-				UsePrecompiledHeader="0"
-				WarningLevel="3"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="0"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLibrarianTool"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="4"
-			CharacterSet="0">
-			<Tool
-				Name="VCCLCompilerTool"
-				Optimization="0"
-				AdditionalIncludeDirectories="$(ProjectDir)src;$(ProjectDir)winclude;$(ProjectDir)include"
-				PreprocessorDefinitions="Win32;WIN32;_DEBUG;_WINDOWS;_USRDLL;NCOMPLEX;IGRAPH_EXPORTS;USE_CLOCK"
-				MinimalRebuild="TRUE"
-				BasicRuntimeChecks="3"
-				RuntimeLibrary="1"
-				UsePrecompiledHeader="0"
-				WarningLevel="3"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="4"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLibrarianTool"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-<!-- SOURCE-FILES -->
-		</Filter>
-		<Filter
-			Name="Header Files"
-			Filter="h;hpp;hxx;hm;inl;inc;xsd"
-			UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
-		  <File
-		        RelativePath=".\winclude\config.h">
-		  </File>
-		  <File
-		        RelativePath=".\winclude\unistd.h">
-		  </File>
-<!-- HEADER-FILES -->
-		</Filter>
-		<Filter
-			Name="Resource Files"
-			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx"
-			UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}">
-		</Filter>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>
diff -Nru igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.cpp igraph-0.6.5/msvc/igraphtest/igraphtest.cpp
--- igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.cpp	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/igraphtest/igraphtest.cpp	1970-01-01 00:00:00.000000000 +0000
@@ -1,22 +0,0 @@
-// igraphtest.cpp : Defines the entry point for the console application.
-
-#include <stdio.h>
-#include "igraph.h"
-
-int main(int argc, char* argv[])
-{
-	igraph_t g;
-	FILE *outfile;
-
-	igraph_barabasi_game(&g, 1000, /*power=*/ 1,/*m=*/2, /*outseq=*/0, 
-			     /*outpref=*/0, /*A=*/ 1, /*directed=*/1, 
-			     IGRAPH_BARABASI_PSUMTREE, 
-			     /*start_from=*/ 0);
-	igraph_simplify(&g, /*multiple=*/1, /*loops=*/0, /*edge_comb=*/ 0);
-	outfile=fopen("out.txt", "w");
-	igraph_write_graph_edgelist(&g, outfile);
-	fclose(outfile);
-	igraph_destroy(&g);
-	return 0;
-}
-
diff -Nru igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.sln igraph-0.6.5/msvc/igraphtest/igraphtest.sln
--- igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.sln	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/igraphtest/igraphtest.sln	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-Microsoft Visual Studio Solution File, Format Version 8.00
-Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "igraphtest", "igraphtest.vcproj", "{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}"
-	ProjectSection(ProjectDependencies) = postProject
-	EndProjectSection
-EndProject
-Global
-	GlobalSection(SolutionConfiguration) = preSolution
-		Debug = Debug
-		Release = Release
-	EndGlobalSection
-	GlobalSection(ProjectConfiguration) = postSolution
-		{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}.Debug.ActiveCfg = Debug|Win32
-		{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}.Debug.Build.0 = Debug|Win32
-		{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}.Release.ActiveCfg = Release|Win32
-		{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}.Release.Build.0 = Release|Win32
-	EndGlobalSection
-	GlobalSection(ExtensibilityGlobals) = postSolution
-	EndGlobalSection
-	GlobalSection(ExtensibilityAddIns) = postSolution
-	EndGlobalSection
-EndGlobal
diff -Nru igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.vcproj igraph-0.6.5/msvc/igraphtest/igraphtest.vcproj
--- igraph-0.6.5~quantal1/msvc/igraphtest/igraphtest.vcproj	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/igraphtest/igraphtest.vcproj	1970-01-01 00:00:00.000000000 +0000
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="Windows-1252"?>
-<VisualStudioProject
-	ProjectType="Visual C++"
-	Version="7.10"
-	Name="igraphtest"
-	ProjectGUID="{D385D685-E0A3-4DC4-97B2-0556D7FDCECF}"
-	Keyword="Win32Proj">
-	<Platforms>
-		<Platform
-			Name="Win32"/>
-	</Platforms>
-	<Configurations>
-		<Configuration
-			Name="Debug|Win32"
-			OutputDirectory="Debug"
-			IntermediateDirectory="Debug"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				Optimization="0"
-				AdditionalIncludeDirectories="&quot;..\igraph-0.6.4-msvc\include&quot;"
-				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
-				MinimalRebuild="TRUE"
-				BasicRuntimeChecks="3"
-				RuntimeLibrary="5"
-				UsePrecompiledHeader="0"
-				WarningLevel="3"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="4"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				AdditionalDependencies="igraph.lib"
-				OutputFile="$(OutDir)/igraphtest.exe"
-				LinkIncremental="2"
-				AdditionalLibraryDirectories="&quot;..\igraph-0.6.4-msvc\Debug&quot;"
-				IgnoreDefaultLibraryNames="LIBC.lib;LIBCMT.lib"
-				GenerateDebugInformation="TRUE"
-				ProgramDatabaseFile="$(OutDir)/igraphtest.pdb"
-				SubSystem="1"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-		<Configuration
-			Name="Release|Win32"
-			OutputDirectory="Release"
-			IntermediateDirectory="Release"
-			ConfigurationType="1"
-			CharacterSet="2">
-			<Tool
-				Name="VCCLCompilerTool"
-				AdditionalIncludeDirectories="&quot;..\igraph-0.6.4-msvc\include&quot;"
-				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
-				RuntimeLibrary="4"
-				UsePrecompiledHeader="0"
-				WarningLevel="3"
-				Detect64BitPortabilityProblems="TRUE"
-				DebugInformationFormat="3"/>
-			<Tool
-				Name="VCCustomBuildTool"/>
-			<Tool
-				Name="VCLinkerTool"
-				AdditionalDependencies="igraph.lib"
-				OutputFile="$(OutDir)/igraphtest.exe"
-				LinkIncremental="1"
-				AdditionalLibraryDirectories="..\igraph-0.6.4-msvc\Release"
-				IgnoreDefaultLibraryNames="LIBC.lib;LIBCMT.lib"
-				GenerateDebugInformation="TRUE"
-				SubSystem="1"
-				OptimizeReferences="2"
-				EnableCOMDATFolding="2"
-				TargetMachine="1"/>
-			<Tool
-				Name="VCMIDLTool"/>
-			<Tool
-				Name="VCPostBuildEventTool"/>
-			<Tool
-				Name="VCPreBuildEventTool"/>
-			<Tool
-				Name="VCPreLinkEventTool"/>
-			<Tool
-				Name="VCResourceCompilerTool"/>
-			<Tool
-				Name="VCWebServiceProxyGeneratorTool"/>
-			<Tool
-				Name="VCXMLDataGeneratorTool"/>
-			<Tool
-				Name="VCWebDeploymentTool"/>
-			<Tool
-				Name="VCManagedWrapperGeneratorTool"/>
-			<Tool
-				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
-		</Configuration>
-	</Configurations>
-	<References>
-	</References>
-	<Files>
-		<Filter
-			Name="Source Files"
-			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
-			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
-			<File
-				RelativePath=".\igraphtest.cpp">
-			</File>
-		</Filter>
-		<Filter
-			Name="Header Files"
-			Filter="h;hpp;hxx;hm;inl;inc;xsd"
-			UniqueIdentifier="{93995380-89BD-4b04-88EB-625FBE52EBFB}">
-		</Filter>
-		<Filter
-			Name="Resource Files"
-			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx"
-			UniqueIdentifier="{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}">
-		</Filter>
-	</Files>
-	<Globals>
-	</Globals>
-</VisualStudioProject>
diff -Nru igraph-0.6.5~quantal1/msvc/include/config.h igraph-0.6.5/msvc/include/config.h
--- igraph-0.6.5~quantal1/msvc/include/config.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/config.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,180 +0,0 @@
-/* config.h.  Generated from config.h.in by configure.  */
-/* config.h.in.  Generated from configure.in by autoheader.  */
-
-/* Define to 1 if you have the <dlfcn.h> header file. */
-/* #undef HAVE_DLFCN_H */
-
-/* Define to 1 if you have the `expm1' function. */
-/* #undef HAVE_EXPM1 */
-
-/* Define to 1 if you have the `fabsl' function. */
-#define HAVE_FABSL 1
-
-/* Define to 1 if you have the `finite' function. */
-#define HAVE_FINITE 1
-
-/* Define to 1 if you have the `fmin' function. */
-/* #undef HAVE_FMIN */
-
-/* Define to 1 if you have the `ftruncate' function. */
-/* #undef HAVE_FTRUNCATE */
-
-/* Define to 1 if you have the GLPK library */
-/* #undef HAVE_GLPK */
-
-/* Define to 1 if you have the GMP library */
-/* #undef HAVE_GMP */
-
-/* Define to 1 if you have the <inttypes.h> header file. */
-/* #undef HAVE_INTTYPES_H */
-
-/* Define to 1 if you have the `isnan' function. */
-#define HAVE_ISNAN 1
-
-/* Define to 1 if you have the `arpack' library (-larpack). */
-/* #undef HAVE_LIBARPACK */
-
-/* Define to 1 if you have the `blas' library (-lblas). */
-/* #undef HAVE_LIBBLAS */
-
-/* Define to 1 if you have the `f2c' library (-lf2c). */
-/* #undef HAVE_LIBF2C */
-
-/* Define to 1 if you have the `lapack' library (-llapack). */
-/* #undef HAVE_LIBLAPACK */
-
-/* Define to 1 if you have the libxml2 libraries installed */
-#define HAVE_LIBXML 0
-
-/* Define to 1 if you have the `log1p' function. */
-/* #undef HAVE_LOG1P */
-
-/* Define to 1 if you have the `log2' function. */
-/* #undef HAVE_LOG2 */
-
-/* Define to 1 if you have the `logbl' function. */
-/* #undef HAVE_LOGBL */
-
-/* Define to 1 if you have the <memory.h> header file. */
-#define HAVE_MEMORY_H 1
-
-/* Define to 1 if you have the `rint' function. */
-/* #undef HAVE_RINT */
-
-/* Define to 1 if you have the `rintf' function. */
-/* #undef HAVE_RINTF */
-
-/* Define to 1 if you have the `round' function. */
-/* #undef HAVE_ROUND */
-
-/* Define to 1 if you have the `snprintf' function. */
-#define HAVE_SNPRINTF 1
-
-/* Define to 1 if you have the <stdarg.h> header file. */
-#define HAVE_STDARG_H 1
-
-/* Define to 1 if you have the <stdint.h> header file. */
-/* #undef HAVE_STDINT_H */
-
-/* Define to 1 if you have the <stdlib.h> header file. */
-#define HAVE_STDLIB_H 1
-
-/* Define to 1 if you have the `strcasecmp' function. */
-#define HAVE_STRCASECMP 1
-
-/* Define to 1 if you have the `strdup' function. */
-/* #undef HAVE_STRDUP */
-
-/* Define to 1 if you have the <strings.h> header file. */
-/* #undef HAVE_STRINGS_H */
-
-/* Define to 1 if you have the <string.h> header file. */
-#define HAVE_STRING_H 1
-
-/* Define to 1 if you have the <sys/int_types.h> header file. */
-/* #undef HAVE_SYS_INT_TYPES_H */
-
-/* Define to 1 if you have the <sys/stat.h> header file. */
-#define HAVE_SYS_STAT_H 1
-
-/* Define to 1 if you have the <sys/types.h> header file. */
-#define HAVE_SYS_TYPES_H 1
-
-/* Define to 1 if you have the sys/times.h header */
-/* #undef HAVE_TIMES_H */
-
-/* Define to 1 if you have the <time.h> header file. */
-#define HAVE_TIME_H 1
-
-/* Define to 1 if you want to use thread-local storage for global igraph
-   structures */
-/* #undef HAVE_TLS */
-
-/* Define to 1 if you have the <unistd.h> header file. */
-/* #undef HAVE_UNISTD_H */
-
-/* Define to 1 if you have the `_strdup' function. */
-#define HAVE__STRDUP 1
-
-/* Keyword for thread local storage, or just static if not available */
-#define IGRAPH_F77_SAVE static
-
-/* Keyword for thread local storage, or empty if not available */
-#define IGRAPH_THREAD_LOCAL
-
-/* Define to 1 if you use the internal ARPACK library */
-#define INTERNAL_ARPACK 1
-
-/* Define to 1 if you use the internal BLAS library */
-#define INTERNAL_BLAS 1
-
-/* Define to 1 if you use the internal F2C library */
-#define INTERNAL_F2C 1
-
-/* Define to 1 if you use the internal GLPK library */
-#define INTERNAL_GLPK 1
-/* Define to 1 if you use the internal LAPACK library */
-#define INTERNAL_LAPACK 1
-
-/* Name of package */
-#define PACKAGE "igraph"
-
-/* Define to the address where bug reports for this package should be sent. */
-#define PACKAGE_BUGREPORT "csardi.gabor@gmail.com"
-
-/* Define to the full name of this package. */
-#define PACKAGE_NAME "igraph"
-
-/* Define to the full name and version of this package. */
-#define PACKAGE_STRING "igraph 0.6"
-
-/* Define to the one symbol short name of this package. */
-#define PACKAGE_TARNAME "igraph"
-
-/* Define to the version of this package. */
-#define PACKAGE_VERSION "0.6"
-
-/* Define to 1 if you have the ANSI C header files. */
-#define STDC_HEADERS 1
-
-/* Version number of package */
-#define VERSION "0.6"
-
-/* Define to 1 if `lex' declares `yytext' as a `char *' by default, not a
-   `char[]'. */
-#define YYTEXT_POINTER 1
-
-#pragma warning (disable:4244)
-
-#define strcasecmp _stricmp
-
-#define isnan _isnan
-#define finite _finite
-#define hypot _hypot
-#include <float.h>
-
-#define snprintf igraph_i_snprintf
-
-/* To turn off some warnings about fscanf, strcpy etc */
-#define _CRT_SECURE_NO_WARNINGS 1
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/iconv.h igraph-0.6.5/msvc/include/iconv.h
--- igraph-0.6.5~quantal1/msvc/include/iconv.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/iconv.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,134 +0,0 @@
-/* Copyright (C) 1999-2003 Free Software Foundation, Inc.
-   This file is part of the GNU LIBICONV Library.
-
-   The GNU LIBICONV Library is free software; you can redistribute it
-   and/or modify it under the terms of the GNU Library General Public
-   License as published by the Free Software Foundation; either version 2
-   of the License, or (at your option) any later version.
-
-   The GNU LIBICONV Library 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
-   Library General Public License for more details.
-
-   You should have received a copy of the GNU Library General Public
-   License along with the GNU LIBICONV Library; see the file COPYING.LIB.
-   If not, write to the Free Software Foundation, Inc., 59 Temple Place -
-   Suite 330, Boston, MA 02111-1307, USA.  */
-
-/* When installed, this file is called "iconv.h". */
-
-#ifndef _LIBICONV_H
-#define _LIBICONV_H
-
-#define _LIBICONV_VERSION 0x0109    /* version number: (major<<8) + minor */
-extern int _libiconv_version;       /* Likewise */
-
-/* We would like to #include any system header file which could define
-   iconv_t, 1. in order to eliminate the risk that the user gets compilation
-   errors because some other system header file includes /usr/include/iconv.h
-   which defines iconv_t or declares iconv after this file, 2. when compiling
-   for LIBICONV_PLUG, we need the proper iconv_t type in order to produce
-   binary compatible code.
-   But gcc's #include_next is not portable. Thus, once libiconv's iconv.h
-   has been installed in /usr/local/include, there is no way any more to
-   include the original /usr/include/iconv.h. We simply have to get away
-   without it.
-   Ad 1. The risk that a system header file does
-   #include "iconv.h"  or  #include_next "iconv.h"
-   is small. They all do #include <iconv.h>.
-   Ad 2. The iconv_t type is a pointer type in all cases I have seen. (It
-   has to be a scalar type because (iconv_t)(-1) is a possible return value
-   from iconv_open().) */
-
-/* Define iconv_t ourselves. */
-#undef iconv_t
-#define iconv_t libiconv_t
-typedef void* iconv_t;
-
-/* Get size_t declaration. */
-#include <stddef.h>
-
-/* Get errno declaration and values. */
-#include <errno.h>
-/* Some systems, like SunOS 4, don't have EILSEQ. Some systems, like BSD/OS,
-   have EILSEQ in a different header.  On these systems, define EILSEQ
-   ourselves. */
-#ifndef EILSEQ
-/* Igor: called upon EILSEQ from glibc, since autogeneration of this header
-	on Windows didn't do the job. */
-/* #define EILSEQ @EILSEQ@ */
-#define EILSEQ 84
-#endif
-
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-
-/* Allocates descriptor for code conversion from encoding `fromcode' to
-   encoding `tocode'. */
-#ifndef LIBICONV_PLUG
-#define iconv_open libiconv_open
-#endif
-extern iconv_t iconv_open (const char* tocode, const char* fromcode);
-
-/* Converts, using conversion descriptor `cd', at most `*inbytesleft' bytes
-   starting at `*inbuf', writing at most `*outbytesleft' bytes starting at
-   `*outbuf'.
-   Decrements `*inbytesleft' and increments `*inbuf' by the same amount.
-   Decrements `*outbytesleft' and increments `*outbuf' by the same amount. */
-#ifndef LIBICONV_PLUG
-#define iconv libiconv
-#endif
-extern size_t iconv (iconv_t cd, const char* * inbuf, size_t *inbytesleft, char* * outbuf, size_t *outbytesleft);
-
-/* Frees resources allocated for conversion descriptor `cd'. */
-#ifndef LIBICONV_PLUG
-#define iconv_close libiconv_close
-#endif
-extern int iconv_close (iconv_t cd);
-
-
-#ifndef LIBICONV_PLUG
-
-/* Nonstandard extensions. */
-
-/* Control of attributes. */
-#define iconvctl libiconvctl
-extern int iconvctl (iconv_t cd, int request, void* argument);
-
-/* Requests for iconvctl. */
-#define ICONV_TRIVIALP            0  /* int *argument */
-#define ICONV_GET_TRANSLITERATE   1  /* int *argument */
-#define ICONV_SET_TRANSLITERATE   2  /* const int *argument */
-#define ICONV_GET_DISCARD_ILSEQ   3  /* int *argument */
-#define ICONV_SET_DISCARD_ILSEQ   4  /* const int *argument */
-
-/* Listing of locale independent encodings. */
-#define iconvlist libiconvlist
-extern void iconvlist (int (*do_one) (unsigned int namescount,
-                                      const char * const * names,
-                                      void* data),
-                       void* data);
-
-/* Support for relocatable packages.  */
-
-/* Sets the original and the current installation prefix of the package.
-   Relocation simply replaces a pathname starting with the original prefix
-   by the corresponding pathname with the current prefix instead.  Both
-   prefixes should be directory names without trailing slash (i.e. use ""
-   instead of "/").  */
-extern void libiconv_set_relocation_prefix (const char *orig_prefix,
-					    const char *curr_prefix);
-
-#endif
-
-
-#ifdef __cplusplus
-}
-#endif
-
-
-#endif /* _LIBICONV_H */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/DOCBparser.h igraph-0.6.5/msvc/include/libxml/DOCBparser.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/DOCBparser.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/DOCBparser.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,96 +0,0 @@
-/*
- * Summary: old DocBook SGML parser
- * Description: interface for a DocBook SGML non-verifying parser
- * This code is DEPRECATED, and should not be used anymore.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __DOCB_PARSER_H__
-#define __DOCB_PARSER_H__
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_DOCB_ENABLED
-
-#include <libxml/parser.h>
-#include <libxml/parserInternals.h>
-
-#ifndef IN_LIBXML
-#ifdef __GNUC__
-#warning "The DOCBparser module has been deprecated in libxml2-2.6.0"
-#endif
-#endif
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Most of the back-end structures from XML and SGML are shared.
- */
-typedef xmlParserCtxt docbParserCtxt;
-typedef xmlParserCtxtPtr docbParserCtxtPtr;
-typedef xmlSAXHandler docbSAXHandler;
-typedef xmlSAXHandlerPtr docbSAXHandlerPtr;
-typedef xmlParserInput docbParserInput;
-typedef xmlParserInputPtr docbParserInputPtr;
-typedef xmlDocPtr docbDocPtr;
-
-/*
- * There is only few public functions.
- */
-XMLPUBFUN int XMLCALL
-		     docbEncodeEntities(unsigned char *out,
-                                        int *outlen,
-                                        const unsigned char *in,
-                                        int *inlen, int quoteChar);
-
-XMLPUBFUN docbDocPtr XMLCALL             
-		     docbSAXParseDoc   (xmlChar *cur,
-                                        const char *encoding,
-                                        docbSAXHandlerPtr sax,
-                                        void *userData);
-XMLPUBFUN docbDocPtr XMLCALL             
-		     docbParseDoc      (xmlChar *cur,
-                                        const char *encoding);
-XMLPUBFUN docbDocPtr XMLCALL             
-		     docbSAXParseFile  (const char *filename,
-                                        const char *encoding,
-                                        docbSAXHandlerPtr sax,
-                                        void *userData);
-XMLPUBFUN docbDocPtr XMLCALL             
-		     docbParseFile     (const char *filename,
-                                        const char *encoding);
-
-/**
- * Interfaces for the Push mode.
- */
-XMLPUBFUN void XMLCALL                  
-		     docbFreeParserCtxt      (docbParserCtxtPtr ctxt);
-XMLPUBFUN docbParserCtxtPtr XMLCALL     
-		     docbCreatePushParserCtxt(docbSAXHandlerPtr sax,
-                                              void *user_data,
-                                              const char *chunk,
-                                              int size,
-                                              const char *filename,
-                                              xmlCharEncoding enc);
-XMLPUBFUN int XMLCALL                   
-		     docbParseChunk          (docbParserCtxtPtr ctxt,
-                                              const char *chunk,
-                                              int size,
-                                              int terminate);
-XMLPUBFUN docbParserCtxtPtr XMLCALL       
-		     docbCreateFileParserCtxt(const char *filename,
-                                              const char *encoding);
-XMLPUBFUN int XMLCALL                   
-		     docbParseDocument       (docbParserCtxtPtr ctxt);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_DOCB_ENABLED */
-
-#endif /* __DOCB_PARSER_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/HTMLparser.h igraph-0.6.5/msvc/include/libxml/HTMLparser.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/HTMLparser.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/HTMLparser.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,303 +0,0 @@
-/*
- * Summary: interface for an HTML 4.0 non-verifying parser
- * Description: this module implements an HTML 4.0 non-verifying parser
- *              with API compatible with the XML parser ones. It should
- *              be able to parse "real world" HTML, even if severely
- *              broken from a specification point of view.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __HTML_PARSER_H__
-#define __HTML_PARSER_H__
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-
-#ifdef LIBXML_HTML_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Most of the back-end structures from XML and HTML are shared.
- */
-typedef xmlParserCtxt htmlParserCtxt;
-typedef xmlParserCtxtPtr htmlParserCtxtPtr;
-typedef xmlParserNodeInfo htmlParserNodeInfo;
-typedef xmlSAXHandler htmlSAXHandler;
-typedef xmlSAXHandlerPtr htmlSAXHandlerPtr;
-typedef xmlParserInput htmlParserInput;
-typedef xmlParserInputPtr htmlParserInputPtr;
-typedef xmlDocPtr htmlDocPtr;
-typedef xmlNodePtr htmlNodePtr;
-
-/*
- * Internal description of an HTML element, representing HTML 4.01
- * and XHTML 1.0 (which share the same structure).
- */
-typedef struct _htmlElemDesc htmlElemDesc;
-typedef htmlElemDesc *htmlElemDescPtr;
-struct _htmlElemDesc {
-    const char *name;	/* The tag name */
-    char startTag;      /* Whether the start tag can be implied */
-    char endTag;        /* Whether the end tag can be implied */
-    char saveEndTag;    /* Whether the end tag should be saved */
-    char empty;         /* Is this an empty element ? */
-    char depr;          /* Is this a deprecated element ? */
-    char dtd;           /* 1: only in Loose DTD, 2: only Frameset one */
-    char isinline;      /* is this a block 0 or inline 1 element */
-    const char *desc;   /* the description */
-
-/* NRK Jan.2003
- * New fields encapsulating HTML structure
- *
- * Bugs:
- *	This is a very limited representation.  It fails to tell us when
- *	an element *requires* subelements (we only have whether they're
- *	allowed or not), and it doesn't tell us where CDATA and PCDATA
- *	are allowed.  Some element relationships are not fully represented:
- *	these are flagged with the word MODIFIER
- */
-    const char** subelts;		/* allowed sub-elements of this element */
-    const char* defaultsubelt;	/* subelement for suggested auto-repair
-					   if necessary or NULL */
-    const char** attrs_opt;		/* Optional Attributes */
-    const char** attrs_depr;		/* Additional deprecated attributes */
-    const char** attrs_req;		/* Required attributes */
-};
-
-/*
- * Internal description of an HTML entity.
- */
-typedef struct _htmlEntityDesc htmlEntityDesc;
-typedef htmlEntityDesc *htmlEntityDescPtr;
-struct _htmlEntityDesc {
-    unsigned int value;	/* the UNICODE value for the character */
-    const char *name;	/* The entity name */
-    const char *desc;   /* the description */
-};
-
-/*
- * There is only few public functions.
- */
-XMLPUBFUN const htmlElemDesc * XMLCALL 	
-			htmlTagLookup	(const xmlChar *tag);
-XMLPUBFUN const htmlEntityDesc * XMLCALL 	
-			htmlEntityLookup(const xmlChar *name);
-XMLPUBFUN const htmlEntityDesc * XMLCALL 	
-			htmlEntityValueLookup(unsigned int value);
-
-XMLPUBFUN int XMLCALL			
-			htmlIsAutoClosed(htmlDocPtr doc,
-					 htmlNodePtr elem);
-XMLPUBFUN int XMLCALL			
-			htmlAutoCloseTag(htmlDocPtr doc,
-					 const xmlChar *name,
-					 htmlNodePtr elem);
-XMLPUBFUN const htmlEntityDesc * XMLCALL	
-			htmlParseEntityRef(htmlParserCtxtPtr ctxt,
-					 const xmlChar **str);
-XMLPUBFUN int XMLCALL			
-			htmlParseCharRef(htmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			htmlParseElement(htmlParserCtxtPtr ctxt);
-
-XMLPUBFUN htmlParserCtxtPtr XMLCALL	
-			htmlNewParserCtxt(void);
-
-XMLPUBFUN htmlParserCtxtPtr XMLCALL	
-			htmlCreateMemoryParserCtxt(const char *buffer,
-						   int size);
-
-XMLPUBFUN int XMLCALL			
-			htmlParseDocument(htmlParserCtxtPtr ctxt);
-XMLPUBFUN htmlDocPtr XMLCALL		
-			htmlSAXParseDoc	(xmlChar *cur,
-					 const char *encoding,
-					 htmlSAXHandlerPtr sax,
-					 void *userData);
-XMLPUBFUN htmlDocPtr XMLCALL		
-			htmlParseDoc	(xmlChar *cur,
-					 const char *encoding);
-XMLPUBFUN htmlDocPtr XMLCALL		
-			htmlSAXParseFile(const char *filename,
-					 const char *encoding,
-					 htmlSAXHandlerPtr sax,
-					 void *userData);
-XMLPUBFUN htmlDocPtr XMLCALL		
-			htmlParseFile	(const char *filename,
-					 const char *encoding);
-XMLPUBFUN int XMLCALL			
-			UTF8ToHtml	(unsigned char *out,
-					 int *outlen,
-					 const unsigned char *in,
-					 int *inlen);
-XMLPUBFUN int XMLCALL			
-			htmlEncodeEntities(unsigned char *out,
-					 int *outlen,
-					 const unsigned char *in,
-					 int *inlen, int quoteChar);
-XMLPUBFUN int XMLCALL			
-			htmlIsScriptAttribute(const xmlChar *name);
-XMLPUBFUN int XMLCALL			
-			htmlHandleOmittedElem(int val);
-
-#ifdef LIBXML_PUSH_ENABLED
-/**
- * Interfaces for the Push mode.
- */
-XMLPUBFUN htmlParserCtxtPtr XMLCALL	
-			htmlCreatePushParserCtxt(htmlSAXHandlerPtr sax,
-						 void *user_data,
-						 const char *chunk,
-						 int size,
-						 const char *filename,
-						 xmlCharEncoding enc);
-XMLPUBFUN int XMLCALL			
-			htmlParseChunk		(htmlParserCtxtPtr ctxt,
-						 const char *chunk,
-						 int size,
-						 int terminate);
-#endif /* LIBXML_PUSH_ENABLED */
-
-XMLPUBFUN void XMLCALL			
-			htmlFreeParserCtxt	(htmlParserCtxtPtr ctxt);
-
-/*
- * New set of simpler/more flexible APIs
- */
-/**
- * xmlParserOption:
- *
- * This is the set of XML parser options that can be passed down
- * to the xmlReadDoc() and similar calls.
- */
-typedef enum {
-    HTML_PARSE_RECOVER  = 1<<0, /* Relaxed parsing */
-    HTML_PARSE_NOERROR	= 1<<5,	/* suppress error reports */
-    HTML_PARSE_NOWARNING= 1<<6,	/* suppress warning reports */
-    HTML_PARSE_PEDANTIC	= 1<<7,	/* pedantic error reporting */
-    HTML_PARSE_NOBLANKS	= 1<<8,	/* remove blank nodes */
-    HTML_PARSE_NONET	= 1<<11,/* Forbid network access */
-    HTML_PARSE_COMPACT  = 1<<16 /* compact small text nodes */
-} htmlParserOption;
-
-XMLPUBFUN void XMLCALL
-		htmlCtxtReset		(htmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-		htmlCtxtUseOptions	(htmlParserCtxtPtr ctxt,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlReadDoc		(const xmlChar *cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlReadFile		(const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlReadMemory		(const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlReadFd		(int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlReadIO		(xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlCtxtReadDoc		(xmlParserCtxtPtr ctxt,
-					 const xmlChar *cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlCtxtReadFile		(xmlParserCtxtPtr ctxt,
-					 const char *filename,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlCtxtReadMemory		(xmlParserCtxtPtr ctxt,
-					 const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlCtxtReadFd		(xmlParserCtxtPtr ctxt,
-					 int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlCtxtReadIO		(xmlParserCtxtPtr ctxt,
-					 xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-
-/* NRK/Jan2003: further knowledge of HTML structure
- */
-typedef enum {
-  HTML_NA = 0 ,		/* something we don't check at all */
-  HTML_INVALID = 0x1 ,
-  HTML_DEPRECATED = 0x2 ,
-  HTML_VALID = 0x4 ,
-  HTML_REQUIRED = 0xc /* VALID bit set so ( & HTML_VALID ) is TRUE */
-} htmlStatus ;
-
-/* Using htmlElemDesc rather than name here, to emphasise the fact
-   that otherwise there's a lookup overhead
-*/
-XMLPUBFUN htmlStatus XMLCALL htmlAttrAllowed(const htmlElemDesc*, const xmlChar*, int) ;
-XMLPUBFUN int XMLCALL htmlElementAllowedHere(const htmlElemDesc*, const xmlChar*) ;
-XMLPUBFUN htmlStatus XMLCALL htmlElementStatusHere(const htmlElemDesc*, const htmlElemDesc*) ;
-XMLPUBFUN htmlStatus XMLCALL htmlNodeStatus(const htmlNodePtr, int) ;
-/**
- * htmlDefaultSubelement:
- * @elt: HTML element
- *
- * Returns the default subelement for this element
- */
-#define htmlDefaultSubelement(elt) elt->defaultsubelt
-/**
- * htmlElementAllowedHereDesc:
- * @parent: HTML parent element
- * @elt: HTML element
- *
- * Checks whether an HTML element description may be a
- * direct child of the specified element.
- *
- * Returns 1 if allowed; 0 otherwise.
- */
-#define htmlElementAllowedHereDesc(parent,elt) \
-	htmlElementAllowedHere((parent), (elt)->name)
-/**
- * htmlRequiredAttrs:
- * @elt: HTML element
- *
- * Returns the attributes required for the specified element.
- */
-#define htmlRequiredAttrs(elt) (elt)->attrs_req
-
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_HTML_ENABLED */
-#endif /* __HTML_PARSER_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/HTMLtree.h igraph-0.6.5/msvc/include/libxml/HTMLtree.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/HTMLtree.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/HTMLtree.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,147 +0,0 @@
-/*
- * Summary: specific APIs to process HTML tree, especially serialization
- * Description: this module implements a few function needed to process
- *              tree in an HTML specific way.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __HTML_TREE_H__
-#define __HTML_TREE_H__
-
-#include <stdio.h>
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/HTMLparser.h>
-
-#ifdef LIBXML_HTML_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-
-/**
- * HTML_TEXT_NODE:
- *
- * Macro. A text node in a HTML document is really implemented
- * the same way as a text node in an XML document.
- */
-#define HTML_TEXT_NODE		XML_TEXT_NODE
-/**
- * HTML_ENTITY_REF_NODE:
- *
- * Macro. An entity reference in a HTML document is really implemented
- * the same way as an entity reference in an XML document.
- */
-#define HTML_ENTITY_REF_NODE	XML_ENTITY_REF_NODE
-/**
- * HTML_COMMENT_NODE:
- *
- * Macro. A comment in a HTML document is really implemented
- * the same way as a comment in an XML document.
- */
-#define HTML_COMMENT_NODE	XML_COMMENT_NODE
-/**
- * HTML_PRESERVE_NODE:
- *
- * Macro. A preserved node in a HTML document is really implemented
- * the same way as a CDATA section in an XML document.
- */
-#define HTML_PRESERVE_NODE	XML_CDATA_SECTION_NODE
-/**
- * HTML_PI_NODE:
- *
- * Macro. A processing instruction in a HTML document is really implemented
- * the same way as a processing instruction in an XML document.
- */
-#define HTML_PI_NODE		XML_PI_NODE
-
-XMLPUBFUN htmlDocPtr XMLCALL
-		htmlNewDoc		(const xmlChar *URI,
-					 const xmlChar *ExternalID);
-XMLPUBFUN htmlDocPtr XMLCALL	
-		htmlNewDocNoDtD		(const xmlChar *URI,
-					 const xmlChar *ExternalID);
-XMLPUBFUN const xmlChar * XMLCALL	
-		htmlGetMetaEncoding	(htmlDocPtr doc);
-XMLPUBFUN int XMLCALL		
-		htmlSetMetaEncoding	(htmlDocPtr doc,
-					 const xmlChar *encoding);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL	    
-		htmlDocDumpMemory	(xmlDocPtr cur,
-					 xmlChar **mem,
-					 int *size);
-XMLPUBFUN void XMLCALL	    
-		htmlDocDumpMemoryFormat	(xmlDocPtr cur,
-					 xmlChar **mem,
-					 int *size,
-					 int format);
-XMLPUBFUN int XMLCALL		
-		htmlDocDump		(FILE *f,
-					 xmlDocPtr cur);
-XMLPUBFUN int XMLCALL		
-		htmlSaveFile		(const char *filename,
-					 xmlDocPtr cur);
-XMLPUBFUN int XMLCALL		
-		htmlNodeDump		(xmlBufferPtr buf,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur);
-XMLPUBFUN void XMLCALL		
-		htmlNodeDumpFile	(FILE *out,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur);
-XMLPUBFUN int XMLCALL		
-		htmlNodeDumpFileFormat	(FILE *out,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur,
-					 const char *encoding,
-					 int format);
-XMLPUBFUN int XMLCALL		
-		htmlSaveFileEnc		(const char *filename,
-					 xmlDocPtr cur,
-					 const char *encoding);
-XMLPUBFUN int XMLCALL		
-		htmlSaveFileFormat	(const char *filename,
-					 xmlDocPtr cur,
-					 const char *encoding,
-					 int format);
-
-XMLPUBFUN void XMLCALL		
-		htmlNodeDumpFormatOutput(xmlOutputBufferPtr buf,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur,
-					 const char *encoding,
-					 int format);
-XMLPUBFUN void XMLCALL		
-		htmlDocContentDumpOutput(xmlOutputBufferPtr buf,
-					 xmlDocPtr cur,
-					 const char *encoding);
-XMLPUBFUN void XMLCALL		
-		htmlDocContentDumpFormatOutput(xmlOutputBufferPtr buf,
-					 xmlDocPtr cur,
-					 const char *encoding,
-					 int format);
-XMLPUBFUN void XMLCALL 
-		htmlNodeDumpOutput	(xmlOutputBufferPtr buf, 
-					 xmlDocPtr doc,
-					 xmlNodePtr cur, 
-					 const char *encoding);
-
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-XMLPUBFUN int XMLCALL		
-		htmlIsBooleanAttr	(const xmlChar *name);
-
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_HTML_ENABLED */
-
-#endif /* __HTML_TREE_H__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/SAX.h igraph-0.6.5/msvc/include/libxml/SAX.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/SAX.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/SAX.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,173 +0,0 @@
-/*
- * Summary: Old SAX version 1 handler, deprecated
- * Description: DEPRECATED set of SAX version 1 interfaces used to
- *              build the DOM tree.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SAX_H__
-#define __XML_SAX_H__
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-#include <libxml/xlink.h>
-
-#ifdef LIBXML_LEGACY_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-XMLPUBFUN const xmlChar * XMLCALL
-		getPublicId			(void *ctx);
-XMLPUBFUN const xmlChar * XMLCALL	
-		getSystemId			(void *ctx);
-XMLPUBFUN void XMLCALL		
-		setDocumentLocator		(void *ctx,
-						 xmlSAXLocatorPtr loc);
-    
-XMLPUBFUN int XMLCALL		
-		getLineNumber			(void *ctx);
-XMLPUBFUN int XMLCALL		
-		getColumnNumber			(void *ctx);
-
-XMLPUBFUN int XMLCALL		
-		isStandalone			(void *ctx);
-XMLPUBFUN int XMLCALL		
-		hasInternalSubset		(void *ctx);
-XMLPUBFUN int XMLCALL		
-		hasExternalSubset		(void *ctx);
-
-XMLPUBFUN void XMLCALL		
-		internalSubset			(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID);
-XMLPUBFUN void XMLCALL		
-		externalSubset			(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID);
-XMLPUBFUN xmlEntityPtr XMLCALL	
-		getEntity			(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN xmlEntityPtr XMLCALL	
-		getParameterEntity		(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN xmlParserInputPtr XMLCALL 
-		resolveEntity			(void *ctx,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId);
-
-XMLPUBFUN void XMLCALL		
-		entityDecl			(void *ctx,
-						 const xmlChar *name,
-						 int type,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId,
-						 xmlChar *content);
-XMLPUBFUN void XMLCALL		
-		attributeDecl			(void *ctx,
-						 const xmlChar *elem,
-						 const xmlChar *fullname,
-						 int type,
-						 int def,
-						 const xmlChar *defaultValue,
-						 xmlEnumerationPtr tree);
-XMLPUBFUN void XMLCALL		
-		elementDecl			(void *ctx,
-						 const xmlChar *name,
-						 int type,
-						 xmlElementContentPtr content);
-XMLPUBFUN void XMLCALL		
-		notationDecl			(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId);
-XMLPUBFUN void XMLCALL		
-		unparsedEntityDecl		(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId,
-						 const xmlChar *notationName);
-
-XMLPUBFUN void XMLCALL		
-		startDocument			(void *ctx);
-XMLPUBFUN void XMLCALL		
-		endDocument			(void *ctx);
-XMLPUBFUN void XMLCALL		
-		attribute			(void *ctx,
-						 const xmlChar *fullname,
-						 const xmlChar *value);
-XMLPUBFUN void XMLCALL		
-		startElement			(void *ctx,
-						 const xmlChar *fullname,
-						 const xmlChar **atts);
-XMLPUBFUN void XMLCALL		
-		endElement			(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN void XMLCALL		
-		reference			(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN void XMLCALL		
-		characters			(void *ctx,
-						 const xmlChar *ch,
-						 int len);
-XMLPUBFUN void XMLCALL		
-		ignorableWhitespace		(void *ctx,
-						 const xmlChar *ch,
-						 int len);
-XMLPUBFUN void XMLCALL		
-		processingInstruction		(void *ctx,
-						 const xmlChar *target,
-						 const xmlChar *data);
-XMLPUBFUN void XMLCALL		
-		globalNamespace			(void *ctx,
-						 const xmlChar *href,
-						 const xmlChar *prefix);
-XMLPUBFUN void XMLCALL		
-		setNamespace			(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN xmlNsPtr XMLCALL	
-		getNamespace			(void *ctx);
-XMLPUBFUN int XMLCALL		
-		checkNamespace			(void *ctx,
-						 xmlChar *nameSpace);
-XMLPUBFUN void XMLCALL		
-		namespaceDecl			(void *ctx,
-						 const xmlChar *href,
-						 const xmlChar *prefix);
-XMLPUBFUN void XMLCALL		
-		comment				(void *ctx,
-						 const xmlChar *value);
-XMLPUBFUN void XMLCALL		
-		cdataBlock			(void *ctx,
-						 const xmlChar *value,
-						 int len);
-
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN void XMLCALL		
-		initxmlDefaultSAXHandler	(xmlSAXHandlerV1 *hdlr,
-						 int warning);
-#ifdef LIBXML_HTML_ENABLED
-XMLPUBFUN void XMLCALL		
-		inithtmlDefaultSAXHandler	(xmlSAXHandlerV1 *hdlr);
-#endif
-#ifdef LIBXML_DOCB_ENABLED
-XMLPUBFUN void XMLCALL		
-		initdocbDefaultSAXHandler	(xmlSAXHandlerV1 *hdlr);
-#endif
-#endif /* LIBXML_SAX1_ENABLED */
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_LEGACY_ENABLED */
-
-#endif /* __XML_SAX_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/SAX2.h igraph-0.6.5/msvc/include/libxml/SAX2.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/SAX2.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/SAX2.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,176 +0,0 @@
-/*
- * Summary: SAX2 parser interface used to build the DOM tree
- * Description: those are the default SAX2 interfaces used by
- *              the library when building DOM tree.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SAX2_H__
-#define __XML_SAX2_H__
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-#include <libxml/xlink.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-XMLPUBFUN const xmlChar * XMLCALL
-		xmlSAX2GetPublicId		(void *ctx);
-XMLPUBFUN const xmlChar * XMLCALL	
-		xmlSAX2GetSystemId		(void *ctx);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2SetDocumentLocator	(void *ctx,
-						 xmlSAXLocatorPtr loc);
-    
-XMLPUBFUN int XMLCALL		
-		xmlSAX2GetLineNumber		(void *ctx);
-XMLPUBFUN int XMLCALL		
-		xmlSAX2GetColumnNumber		(void *ctx);
-
-XMLPUBFUN int XMLCALL		
-		xmlSAX2IsStandalone		(void *ctx);
-XMLPUBFUN int XMLCALL		
-		xmlSAX2HasInternalSubset	(void *ctx);
-XMLPUBFUN int XMLCALL		
-		xmlSAX2HasExternalSubset	(void *ctx);
-
-XMLPUBFUN void XMLCALL		
-		xmlSAX2InternalSubset		(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2ExternalSubset		(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID);
-XMLPUBFUN xmlEntityPtr XMLCALL	
-		xmlSAX2GetEntity		(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN xmlEntityPtr XMLCALL	
-		xmlSAX2GetParameterEntity	(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN xmlParserInputPtr XMLCALL 
-		xmlSAX2ResolveEntity		(void *ctx,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId);
-
-XMLPUBFUN void XMLCALL		
-		xmlSAX2EntityDecl		(void *ctx,
-						 const xmlChar *name,
-						 int type,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId,
-						 xmlChar *content);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2AttributeDecl		(void *ctx,
-						 const xmlChar *elem,
-						 const xmlChar *fullname,
-						 int type,
-						 int def,
-						 const xmlChar *defaultValue,
-						 xmlEnumerationPtr tree);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2ElementDecl		(void *ctx,
-						 const xmlChar *name,
-						 int type,
-						 xmlElementContentPtr content);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2NotationDecl		(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2UnparsedEntityDecl	(void *ctx,
-						 const xmlChar *name,
-						 const xmlChar *publicId,
-						 const xmlChar *systemId,
-						 const xmlChar *notationName);
-
-XMLPUBFUN void XMLCALL		
-		xmlSAX2StartDocument		(void *ctx);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2EndDocument		(void *ctx);
-#if defined(LIBXML_SAX1_ENABLED) || defined(LIBXML_HTML_ENABLED) || defined(LIBXML_WRITER_ENABLED) || defined(LIBXML_DOCB_ENABLED)
-XMLPUBFUN void XMLCALL		
-		xmlSAX2StartElement		(void *ctx,
-						 const xmlChar *fullname,
-						 const xmlChar **atts);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2EndElement		(void *ctx,
-						 const xmlChar *name);
-#endif /* LIBXML_SAX1_ENABLED or LIBXML_HTML_ENABLED */
-XMLPUBFUN void XMLCALL
-		xmlSAX2StartElementNs		(void *ctx,
-						 const xmlChar *localname,
-						 const xmlChar *prefix,
-						 const xmlChar *URI,
-						 int nb_namespaces,
-						 const xmlChar **namespaces,
-						 int nb_attributes,
-						 int nb_defaulted,
-						 const xmlChar **attributes);
-XMLPUBFUN void XMLCALL
-		xmlSAX2EndElementNs		(void *ctx,
-						 const xmlChar *localname,
-						 const xmlChar *prefix,
-						 const xmlChar *URI);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2Reference		(void *ctx,
-						 const xmlChar *name);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2Characters		(void *ctx,
-						 const xmlChar *ch,
-						 int len);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2IgnorableWhitespace	(void *ctx,
-						 const xmlChar *ch,
-						 int len);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2ProcessingInstruction	(void *ctx,
-						 const xmlChar *target,
-						 const xmlChar *data);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2Comment			(void *ctx,
-						 const xmlChar *value);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2CDataBlock		(void *ctx,
-						 const xmlChar *value,
-						 int len);
-
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN int XMLCALL
-		xmlSAXDefaultVersion		(int version);
-#endif /* LIBXML_SAX1_ENABLED */
-
-XMLPUBFUN int XMLCALL
-		xmlSAXVersion			(xmlSAXHandler *hdlr,
-						 int version);
-XMLPUBFUN void XMLCALL		
-		xmlSAX2InitDefaultSAXHandler    (xmlSAXHandler *hdlr,
-						 int warning);
-#ifdef LIBXML_HTML_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlSAX2InitHtmlDefaultSAXHandler(xmlSAXHandler *hdlr);
-XMLPUBFUN void XMLCALL		
-		htmlDefaultSAXHandlerInit	(void);
-#endif
-#ifdef LIBXML_DOCB_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlSAX2InitDocbDefaultSAXHandler(xmlSAXHandler *hdlr);
-XMLPUBFUN void XMLCALL		
-		docbDefaultSAXHandlerInit	(void);
-#endif
-XMLPUBFUN void XMLCALL		
-		xmlDefaultSAXHandlerInit	(void);
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_SAX2_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/c14n.h igraph-0.6.5/msvc/include/libxml/c14n.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/c14n.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/c14n.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,115 +0,0 @@
-/*
- * Summary: Provide Canonical XML and Exclusive XML Canonicalization
- * Description: the c14n modules provides a
- *
- * "Canonical XML" implementation
- * http://www.w3.org/TR/xml-c14n
- *
- * and an
- *
- * "Exclusive XML Canonicalization" implementation
- * http://www.w3.org/TR/xml-exc-c14n
-
- * Copy: See Copyright for the status of this software.
- *
- * Author: Aleksey Sanin <aleksey@aleksey.com>
- */
-#ifndef __XML_C14N_H__
-#define __XML_C14N_H__
-#ifdef LIBXML_C14N_ENABLED
-#ifdef LIBXML_OUTPUT_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif /* __cplusplus */
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/xpath.h>
-
-/*
- * XML Canonicazation
- * http://www.w3.org/TR/xml-c14n
- *
- * Exclusive XML Canonicazation
- * http://www.w3.org/TR/xml-exc-c14n
- *
- * Canonical form of an XML document could be created if and only if
- *  a) default attributes (if any) are added to all nodes
- *  b) all character and parsed entity references are resolved
- * In order to achive this in libxml2 the document MUST be loaded with
- * following global setings:
- *
- *    xmlLoadExtDtdDefaultValue = XML_DETECT_IDS | XML_COMPLETE_ATTRS;
- *    xmlSubstituteEntitiesDefault(1);
- *
- * or corresponding parser context setting:
- *    xmlParserCtxtPtr ctxt;
- *
- *    ...
- *    ctxt->loadsubset = XML_DETECT_IDS | XML_COMPLETE_ATTRS;
- *    ctxt->replaceEntities = 1;
- *    ...
- */
-
-
-XMLPUBFUN int XMLCALL
-		xmlC14NDocSaveTo	(xmlDocPtr doc,
-					 xmlNodeSetPtr nodes,
-					 int exclusive,
-					 xmlChar **inclusive_ns_prefixes,
-					 int with_comments,
-					 xmlOutputBufferPtr buf);
-
-XMLPUBFUN int XMLCALL
-		xmlC14NDocDumpMemory	(xmlDocPtr doc,
-					 xmlNodeSetPtr nodes,
-					 int exclusive,
-					 xmlChar **inclusive_ns_prefixes,
-					 int with_comments,
-					 xmlChar **doc_txt_ptr);
-
-XMLPUBFUN int XMLCALL
-		xmlC14NDocSave		(xmlDocPtr doc,
-					 xmlNodeSetPtr nodes,
-					 int exclusive,
-					 xmlChar **inclusive_ns_prefixes,
-					 int with_comments,
-					 const char* filename,
-					 int compression);
-
-
-/**
- * This is the core C14N function
- */
-/**
- * xmlC14NIsVisibleCallback:
- * @user_data: user data
- * @node: the curent node
- * @parent: the parent node
- *
- * Signature for a C14N callback on visible nodes
- *
- * Returns 1 if the node should be included
- */
-typedef int (*xmlC14NIsVisibleCallback)	(void* user_data,
-					 xmlNodePtr node,
-					 xmlNodePtr parent);
-
-XMLPUBFUN int XMLCALL
-		xmlC14NExecute		(xmlDocPtr doc,
-					 xmlC14NIsVisibleCallback is_visible_callback,
-					 void* user_data,
-					 int exclusive,
-					 xmlChar **inclusive_ns_prefixes,
-					 int with_comments,
-					 xmlOutputBufferPtr buf);
-
-#ifdef __cplusplus
-}
-#endif /* __cplusplus */
-
-#endif /* LIBXML_OUTPUT_ENABLED */
-#endif /* LIBXML_C14N_ENABLED */
-#endif /* __XML_C14N_H__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/catalog.h igraph-0.6.5/msvc/include/libxml/catalog.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/catalog.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/catalog.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,182 +0,0 @@
-/**
- * Summary: interfaces to the Catalog handling system
- * Description: the catalog module implements the support for
- * XML Catalogs and SGML catalogs
- *
- * SGML Open Technical Resolution TR9401:1997.
- * http://www.jclark.com/sp/catalog.htm
- *
- * XML Catalogs Working Draft 06 August 2001
- * http://www.oasis-open.org/committees/entity/spec-2001-08-06.html
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_CATALOG_H__
-#define __XML_CATALOG_H__
-
-#include <stdio.h>
-
-#include <libxml/xmlversion.h>
-#include <libxml/xmlstring.h>
-#include <libxml/tree.h>
-
-#ifdef LIBXML_CATALOG_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * XML_CATALOGS_NAMESPACE:
- *
- * The namespace for the XML Catalogs elements.
- */
-#define XML_CATALOGS_NAMESPACE					\
-    (const xmlChar *) "urn:oasis:names:tc:entity:xmlns:xml:catalog"
-/**
- * XML_CATALOG_PI:
- *
- * The specific XML Catalog Processing Instuction name.
- */
-#define XML_CATALOG_PI						\
-    (const xmlChar *) "oasis-xml-catalog"
-
-/*
- * The API is voluntarily limited to general cataloging.
- */
-typedef enum {
-    XML_CATA_PREFER_NONE = 0,
-    XML_CATA_PREFER_PUBLIC = 1,
-    XML_CATA_PREFER_SYSTEM
-} xmlCatalogPrefer;
-
-typedef enum {
-    XML_CATA_ALLOW_NONE = 0,
-    XML_CATA_ALLOW_GLOBAL = 1,
-    XML_CATA_ALLOW_DOCUMENT = 2,
-    XML_CATA_ALLOW_ALL = 3
-} xmlCatalogAllow;
-
-typedef struct _xmlCatalog xmlCatalog;
-typedef xmlCatalog *xmlCatalogPtr;
-
-/*
- * Operations on a given catalog.
- */
-XMLPUBFUN xmlCatalogPtr XMLCALL
-		xmlNewCatalog		(int sgml);
-XMLPUBFUN xmlCatalogPtr XMLCALL	
-		xmlLoadACatalog		(const char *filename);
-XMLPUBFUN xmlCatalogPtr XMLCALL	
-		xmlLoadSGMLSuperCatalog	(const char *filename);
-XMLPUBFUN int XMLCALL		
-		xmlConvertSGMLCatalog	(xmlCatalogPtr catal);
-XMLPUBFUN int XMLCALL		
-		xmlACatalogAdd		(xmlCatalogPtr catal,
-					 const xmlChar *type,
-					 const xmlChar *orig,
-					 const xmlChar *replace);
-XMLPUBFUN int XMLCALL		
-		xmlACatalogRemove	(xmlCatalogPtr catal,
-					 const xmlChar *value);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlACatalogResolve	(xmlCatalogPtr catal,
-					 const xmlChar *pubID,
-	                                 const xmlChar *sysID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlACatalogResolveSystem(xmlCatalogPtr catal,
-					 const xmlChar *sysID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlACatalogResolvePublic(xmlCatalogPtr catal,
-					 const xmlChar *pubID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlACatalogResolveURI	(xmlCatalogPtr catal,
-					 const xmlChar *URI);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlACatalogDump		(xmlCatalogPtr catal,
-					 FILE *out);
-#endif /* LIBXML_OUTPUT_ENABLED */
-XMLPUBFUN void XMLCALL		
-		xmlFreeCatalog		(xmlCatalogPtr catal);
-XMLPUBFUN int XMLCALL		
-		xmlCatalogIsEmpty	(xmlCatalogPtr catal);
-
-/*
- * Global operations.
- */
-XMLPUBFUN void XMLCALL		
-		xmlInitializeCatalog	(void);
-XMLPUBFUN int XMLCALL		
-		xmlLoadCatalog		(const char *filename);
-XMLPUBFUN void XMLCALL		
-		xmlLoadCatalogs		(const char *paths);
-XMLPUBFUN void XMLCALL		
-		xmlCatalogCleanup	(void);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlCatalogDump		(FILE *out);
-#endif /* LIBXML_OUTPUT_ENABLED */
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogResolve	(const xmlChar *pubID,
-	                                 const xmlChar *sysID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogResolveSystem	(const xmlChar *sysID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogResolvePublic	(const xmlChar *pubID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogResolveURI	(const xmlChar *URI);
-XMLPUBFUN int XMLCALL		
-		xmlCatalogAdd		(const xmlChar *type,
-					 const xmlChar *orig,
-					 const xmlChar *replace);
-XMLPUBFUN int XMLCALL		
-		xmlCatalogRemove	(const xmlChar *value);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlParseCatalogFile	(const char *filename);
-XMLPUBFUN int XMLCALL		
-		xmlCatalogConvert	(void);
-
-/*
- * Strictly minimal interfaces for per-document catalogs used
- * by the parser.
- */
-XMLPUBFUN void XMLCALL		
-		xmlCatalogFreeLocal	(void *catalogs);
-XMLPUBFUN void * XMLCALL		
-		xmlCatalogAddLocal	(void *catalogs,
-					 const xmlChar *URL);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogLocalResolve	(void *catalogs,
-					 const xmlChar *pubID,
-	                                 const xmlChar *sysID);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlCatalogLocalResolveURI(void *catalogs,
-					 const xmlChar *URI);
-/*
- * Preference settings.
- */
-XMLPUBFUN int XMLCALL		
-		xmlCatalogSetDebug	(int level);
-XMLPUBFUN xmlCatalogPrefer XMLCALL 
-		xmlCatalogSetDefaultPrefer(xmlCatalogPrefer prefer);
-XMLPUBFUN void XMLCALL		
-		xmlCatalogSetDefaults	(xmlCatalogAllow allow);
-XMLPUBFUN xmlCatalogAllow XMLCALL	
-		xmlCatalogGetDefaults	(void);
-
-
-/* DEPRECATED interfaces */
-XMLPUBFUN const xmlChar * XMLCALL	
-		xmlCatalogGetSystem	(const xmlChar *sysID);
-XMLPUBFUN const xmlChar * XMLCALL	
-		xmlCatalogGetPublic	(const xmlChar *pubID);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* LIBXML_CATALOG_ENABLED */
-#endif /* __XML_CATALOG_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/chvalid.h igraph-0.6.5/msvc/include/libxml/chvalid.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/chvalid.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/chvalid.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,230 +0,0 @@
-/*
- * Summary: Unicode character range checking
- * Description: this module exports interfaces for the character
- *               range validation APIs
- *
- * This file is automatically generated from the cvs source
- * definition files using the genChRanges.py Python script
- *
- * Generation date: Mon Mar 27 11:09:48 2006
- * Sources: chvalid.def
- * Author: William Brack <wbrack@mmm.com.hk>
- */
-
-#ifndef __XML_CHVALID_H__
-#define __XML_CHVALID_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/xmlstring.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Define our typedefs and structures
- *
- */
-typedef struct _xmlChSRange xmlChSRange;
-typedef xmlChSRange *xmlChSRangePtr;
-struct _xmlChSRange {
-    unsigned short	low;
-    unsigned short	high;
-};
-
-typedef struct _xmlChLRange xmlChLRange;
-typedef xmlChLRange *xmlChLRangePtr;
-struct _xmlChLRange {
-    unsigned int	low;
-    unsigned int	high;
-};
-
-typedef struct _xmlChRangeGroup xmlChRangeGroup;
-typedef xmlChRangeGroup *xmlChRangeGroupPtr;
-struct _xmlChRangeGroup {
-    int			nbShortRange;
-    int			nbLongRange;
-    const xmlChSRange	*shortRange;	/* points to an array of ranges */
-    const xmlChLRange	*longRange;
-};
-
-/**
- * Range checking routine
- */
-XMLPUBFUN int XMLCALL
-		xmlCharInRange(unsigned int val, const xmlChRangeGroup *group);
-
-
-/**
- * xmlIsBaseChar_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsBaseChar_ch(c)	(((0x41 <= (c)) && ((c) <= 0x5a)) || \
-				 ((0x61 <= (c)) && ((c) <= 0x7a)) || \
-				 ((0xc0 <= (c)) && ((c) <= 0xd6)) || \
-				 ((0xd8 <= (c)) && ((c) <= 0xf6)) || \
-				  (0xf8 <= (c)))
-
-/**
- * xmlIsBaseCharQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsBaseCharQ(c)	(((c) < 0x100) ? \
-				 xmlIsBaseChar_ch((c)) : \
-				 xmlCharInRange((c), &xmlIsBaseCharGroup))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsBaseCharGroup;
-
-/**
- * xmlIsBlank_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsBlank_ch(c)	(((c) == 0x20) || \
-				 ((0x9 <= (c)) && ((c) <= 0xa)) || \
-				 ((c) == 0xd))
-
-/**
- * xmlIsBlankQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsBlankQ(c)		(((c) < 0x100) ? \
-				 xmlIsBlank_ch((c)) : 0)
-
-
-/**
- * xmlIsChar_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsChar_ch(c)		(((0x9 <= (c)) && ((c) <= 0xa)) || \
-				 ((c) == 0xd) || \
-				  (0x20 <= (c)))
-
-/**
- * xmlIsCharQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsCharQ(c)		(((c) < 0x100) ? \
-				 xmlIsChar_ch((c)) :\
-				(((0x100 <= (c)) && ((c) <= 0xd7ff)) || \
-				 ((0xe000 <= (c)) && ((c) <= 0xfffd)) || \
-				 ((0x10000 <= (c)) && ((c) <= 0x10ffff))))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsCharGroup;
-
-/**
- * xmlIsCombiningQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsCombiningQ(c)	(((c) < 0x100) ? \
-				 0 : \
-				 xmlCharInRange((c), &xmlIsCombiningGroup))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsCombiningGroup;
-
-/**
- * xmlIsDigit_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsDigit_ch(c)	(((0x30 <= (c)) && ((c) <= 0x39)))
-
-/**
- * xmlIsDigitQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsDigitQ(c)		(((c) < 0x100) ? \
-				 xmlIsDigit_ch((c)) : \
-				 xmlCharInRange((c), &xmlIsDigitGroup))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsDigitGroup;
-
-/**
- * xmlIsExtender_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsExtender_ch(c)	(((c) == 0xb7))
-
-/**
- * xmlIsExtenderQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsExtenderQ(c)	(((c) < 0x100) ? \
-				 xmlIsExtender_ch((c)) : \
-				 xmlCharInRange((c), &xmlIsExtenderGroup))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsExtenderGroup;
-
-/**
- * xmlIsIdeographicQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsIdeographicQ(c)	(((c) < 0x100) ? \
-				 0 :\
-				(((0x4e00 <= (c)) && ((c) <= 0x9fa5)) || \
-				 ((c) == 0x3007) || \
-				 ((0x3021 <= (c)) && ((c) <= 0x3029))))
-
-XMLPUBVAR const xmlChRangeGroup xmlIsIdeographicGroup;
-XMLPUBVAR const unsigned char xmlIsPubidChar_tab[256];
-
-/**
- * xmlIsPubidChar_ch:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsPubidChar_ch(c)	(xmlIsPubidChar_tab[(c)])
-
-/**
- * xmlIsPubidCharQ:
- * @c: char to validate
- *
- * Automatically generated by genChRanges.py
- */
-#define xmlIsPubidCharQ(c)	(((c) < 0x100) ? \
-				 xmlIsPubidChar_ch((c)) : 0)
-
-XMLPUBFUN int XMLCALL
-		xmlIsBaseChar(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsBlank(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsChar(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsCombining(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsDigit(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsExtender(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsIdeographic(unsigned int ch);
-XMLPUBFUN int XMLCALL
-		xmlIsPubidChar(unsigned int ch);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_CHVALID_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/debugXML.h igraph-0.6.5/msvc/include/libxml/debugXML.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/debugXML.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/debugXML.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,217 +0,0 @@
-/*
- * Summary: Tree debugging APIs
- * Description: Interfaces to a set of routines used for debugging the tree
- *              produced by the XML parser.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __DEBUG_XML__
-#define __DEBUG_XML__
-#include <stdio.h>
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef LIBXML_DEBUG_ENABLED
-
-#include <libxml/xpath.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The standard Dump routines.
- */
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpString	(FILE *output,
-				 const xmlChar *str);
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpAttr	(FILE *output,
-				 xmlAttrPtr attr,
-				 int depth);
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpAttrList	(FILE *output,
-				 xmlAttrPtr attr,
-				 int depth);
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpOneNode	(FILE *output,
-				 xmlNodePtr node,
-				 int depth);
-XMLPUBFUN void XMLCALL
-	xmlDebugDumpNode	(FILE *output,
-				 xmlNodePtr node,
-				 int depth);
-XMLPUBFUN void XMLCALL
-	xmlDebugDumpNodeList	(FILE *output,
-				 xmlNodePtr node,
-				 int depth);
-XMLPUBFUN void XMLCALL
-	xmlDebugDumpDocumentHead(FILE *output,
-				 xmlDocPtr doc);
-XMLPUBFUN void XMLCALL
-	xmlDebugDumpDocument	(FILE *output,
-				 xmlDocPtr doc);
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpDTD		(FILE *output,
-				 xmlDtdPtr dtd);
-XMLPUBFUN void XMLCALL	
-	xmlDebugDumpEntities	(FILE *output,
-				 xmlDocPtr doc);
-
-/****************************************************************
- *								*
- *	 		Checking routines			*
- *								*
- ****************************************************************/
-
-XMLPUBFUN int XMLCALL
-	xmlDebugCheckDocument	(FILE * output,
-				 xmlDocPtr doc);
-
-/****************************************************************
- *								*
- *	 		XML shell helpers			*
- *								*
- ****************************************************************/
-
-XMLPUBFUN void XMLCALL	
-	xmlLsOneNode		(FILE *output, xmlNodePtr node);
-XMLPUBFUN int XMLCALL	
-	xmlLsCountNode		(xmlNodePtr node);
-
-XMLPUBFUN const char * XMLCALL 
-	xmlBoolToText		(int boolval);
-
-/****************************************************************
- *								*
- *	 The XML shell related structures and functions		*
- *								*
- ****************************************************************/
-
-#ifdef LIBXML_XPATH_ENABLED
-/**
- * xmlShellReadlineFunc:
- * @prompt:  a string prompt
- *
- * This is a generic signature for the XML shell input function.
- *
- * Returns a string which will be freed by the Shell.
- */
-typedef char * (* xmlShellReadlineFunc)(char *prompt);
-
-/**
- * xmlShellCtxt:
- *
- * A debugging shell context.
- * TODO: add the defined function tables.
- */
-typedef struct _xmlShellCtxt xmlShellCtxt;
-typedef xmlShellCtxt *xmlShellCtxtPtr;
-struct _xmlShellCtxt {
-    char *filename;
-    xmlDocPtr doc;
-    xmlNodePtr node;
-    xmlXPathContextPtr pctxt;
-    int loaded;
-    FILE *output;
-    xmlShellReadlineFunc input;
-};
-
-/**
- * xmlShellCmd:
- * @ctxt:  a shell context
- * @arg:  a string argument
- * @node:  a first node
- * @node2:  a second node
- *
- * This is a generic signature for the XML shell functions.
- *
- * Returns an int, negative returns indicating errors.
- */
-typedef int (* xmlShellCmd) (xmlShellCtxtPtr ctxt,
-                             char *arg,
-			     xmlNodePtr node,
-			     xmlNodePtr node2);
-
-XMLPUBFUN void XMLCALL	
-	xmlShellPrintXPathError	(int errorType,
-				 const char *arg);
-XMLPUBFUN void XMLCALL	
-	xmlShellPrintXPathResult(xmlXPathObjectPtr list);
-XMLPUBFUN int XMLCALL	
-	xmlShellList		(xmlShellCtxtPtr ctxt,
-				 char *arg,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellBase		(xmlShellCtxtPtr ctxt,
-				 char *arg,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellDir		(xmlShellCtxtPtr ctxt,
-				 char *arg,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellLoad		(xmlShellCtxtPtr ctxt,
-				 char *filename,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL	
-	xmlShellPrintNode	(xmlNodePtr node);
-XMLPUBFUN int XMLCALL	
-	xmlShellCat		(xmlShellCtxtPtr ctxt,
-				 char *arg,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellWrite		(xmlShellCtxtPtr ctxt,
-				 char *filename,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellSave		(xmlShellCtxtPtr ctxt,
-				 char *filename,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-#endif /* LIBXML_OUTPUT_ENABLED */
-#ifdef LIBXML_VALID_ENABLED
-XMLPUBFUN int XMLCALL	
-	xmlShellValidate	(xmlShellCtxtPtr ctxt,
-				 char *dtd,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-#endif /* LIBXML_VALID_ENABLED */
-XMLPUBFUN int XMLCALL	
-	xmlShellDu		(xmlShellCtxtPtr ctxt,
-				 char *arg,
-				 xmlNodePtr tree,
-				 xmlNodePtr node2);
-XMLPUBFUN int XMLCALL	
-	xmlShellPwd		(xmlShellCtxtPtr ctxt,
-				 char *buffer,
-				 xmlNodePtr node,
-				 xmlNodePtr node2);
-
-/*
- * The Shell interface.
- */
-XMLPUBFUN void XMLCALL	
-	xmlShell		(xmlDocPtr doc,
-				 char *filename,
-				 xmlShellReadlineFunc input,
-				 FILE *output);
-			 
-#endif /* LIBXML_XPATH_ENABLED */
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_DEBUG_ENABLED */
-#endif /* __DEBUG_XML__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/dict.h igraph-0.6.5/msvc/include/libxml/dict.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/dict.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/dict.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,69 +0,0 @@
-/*
- * Summary: string dictionnary
- * Description: dictionary of reusable strings, just used to avoid allocation
- *         and freeing operations.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_DICT_H__
-#define __XML_DICT_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The dictionnary.
- */
-typedef struct _xmlDict xmlDict;
-typedef xmlDict *xmlDictPtr;
-
-/*
- * Constructor and destructor.
- */
-XMLPUBFUN xmlDictPtr XMLCALL
-			xmlDictCreate	(void);
-XMLPUBFUN xmlDictPtr XMLCALL
-			xmlDictCreateSub(xmlDictPtr sub);
-XMLPUBFUN int XMLCALL
-			xmlDictReference(xmlDictPtr dict);
-XMLPUBFUN void XMLCALL			
-			xmlDictFree	(xmlDictPtr dict);
-
-/*
- * Lookup of entry in the dictionnary.
- */
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlDictLookup	(xmlDictPtr dict,
-		                         const xmlChar *name,
-		                         int len);
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlDictExists	(xmlDictPtr dict,
-		                         const xmlChar *name,
-		                         int len);
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlDictQLookup	(xmlDictPtr dict,
-		                         const xmlChar *prefix,
-		                         const xmlChar *name);
-XMLPUBFUN int XMLCALL
-			xmlDictOwns	(xmlDictPtr dict,
-					 const xmlChar *str);
-XMLPUBFUN int XMLCALL			
-			xmlDictSize	(xmlDictPtr dict);
-
-/*
- * Cleanup function
- */
-XMLPUBFUN void XMLCALL
-                        xmlDictCleanup  (void);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* ! __XML_DICT_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/encoding.h igraph-0.6.5/msvc/include/libxml/encoding.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/encoding.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/encoding.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,226 +0,0 @@
-/*
- * Summary: interface for the encoding conversion functions
- * Description: interface for the encoding conversion functions needed for
- *              XML basic encoding and iconv() support.
- *
- * Related specs are
- * rfc2044        (UTF-8 and UTF-16) F. Yergeau Alis Technologies
- * [ISO-10646]    UTF-8 and UTF-16 in Annexes
- * [ISO-8859-1]   ISO Latin-1 characters codes.
- * [UNICODE]      The Unicode Consortium, "The Unicode Standard --
- *                Worldwide Character Encoding -- Version 1.0", Addison-
- *                Wesley, Volume 1, 1991, Volume 2, 1992.  UTF-8 is
- *                described in Unicode Technical Report #4.
- * [US-ASCII]     Coded Character Set--7-bit American Standard Code for
- *                Information Interchange, ANSI X3.4-1986.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_CHAR_ENCODING_H__
-#define __XML_CHAR_ENCODING_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_ICONV_ENABLED
-#include <iconv.h>
-#endif
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * xmlCharEncoding:
- *
- * Predefined values for some standard encodings.
- * Libxml does not do beforehand translation on UTF8 and ISOLatinX.
- * It also supports ASCII, ISO-8859-1, and UTF16 (LE and BE) by default.
- *
- * Anything else would have to be translated to UTF8 before being
- * given to the parser itself. The BOM for UTF16 and the encoding
- * declaration are looked at and a converter is looked for at that
- * point. If not found the parser stops here as asked by the XML REC. A
- * converter can be registered by the user using xmlRegisterCharEncodingHandler
- * but the current form doesn't allow stateful transcoding (a serious
- * problem agreed !). If iconv has been found it will be used
- * automatically and allow stateful transcoding, the simplest is then
- * to be sure to enable iconv and to provide iconv libs for the encoding
- * support needed.
- *
- * Note that the generic "UTF-16" is not a predefined value.  Instead, only
- * the specific UTF-16LE and UTF-16BE are present.
- */
-typedef enum {
-    XML_CHAR_ENCODING_ERROR=   -1, /* No char encoding detected */
-    XML_CHAR_ENCODING_NONE=	0, /* No char encoding detected */
-    XML_CHAR_ENCODING_UTF8=	1, /* UTF-8 */
-    XML_CHAR_ENCODING_UTF16LE=	2, /* UTF-16 little endian */
-    XML_CHAR_ENCODING_UTF16BE=	3, /* UTF-16 big endian */
-    XML_CHAR_ENCODING_UCS4LE=	4, /* UCS-4 little endian */
-    XML_CHAR_ENCODING_UCS4BE=	5, /* UCS-4 big endian */
-    XML_CHAR_ENCODING_EBCDIC=	6, /* EBCDIC uh! */
-    XML_CHAR_ENCODING_UCS4_2143=7, /* UCS-4 unusual ordering */
-    XML_CHAR_ENCODING_UCS4_3412=8, /* UCS-4 unusual ordering */
-    XML_CHAR_ENCODING_UCS2=	9, /* UCS-2 */
-    XML_CHAR_ENCODING_8859_1=	10,/* ISO-8859-1 ISO Latin 1 */
-    XML_CHAR_ENCODING_8859_2=	11,/* ISO-8859-2 ISO Latin 2 */
-    XML_CHAR_ENCODING_8859_3=	12,/* ISO-8859-3 */
-    XML_CHAR_ENCODING_8859_4=	13,/* ISO-8859-4 */
-    XML_CHAR_ENCODING_8859_5=	14,/* ISO-8859-5 */
-    XML_CHAR_ENCODING_8859_6=	15,/* ISO-8859-6 */
-    XML_CHAR_ENCODING_8859_7=	16,/* ISO-8859-7 */
-    XML_CHAR_ENCODING_8859_8=	17,/* ISO-8859-8 */
-    XML_CHAR_ENCODING_8859_9=	18,/* ISO-8859-9 */
-    XML_CHAR_ENCODING_2022_JP=  19,/* ISO-2022-JP */
-    XML_CHAR_ENCODING_SHIFT_JIS=20,/* Shift_JIS */
-    XML_CHAR_ENCODING_EUC_JP=   21,/* EUC-JP */
-    XML_CHAR_ENCODING_ASCII=    22 /* pure ASCII */
-} xmlCharEncoding;
-
-/**
- * xmlCharEncodingInputFunc:
- * @out:  a pointer to an array of bytes to store the UTF-8 result
- * @outlen:  the length of @out
- * @in:  a pointer to an array of chars in the original encoding
- * @inlen:  the length of @in
- *
- * Take a block of chars in the original encoding and try to convert
- * it to an UTF-8 block of chars out.
- *
- * Returns the number of bytes written, -1 if lack of space, or -2
- *     if the transcoding failed.
- * The value of @inlen after return is the number of octets consumed
- *     if the return value is positive, else unpredictiable.
- * The value of @outlen after return is the number of octets consumed.
- */
-typedef int (* xmlCharEncodingInputFunc)(unsigned char *out, int *outlen,
-                                         const unsigned char *in, int *inlen);
-
-
-/**
- * xmlCharEncodingOutputFunc:
- * @out:  a pointer to an array of bytes to store the result
- * @outlen:  the length of @out
- * @in:  a pointer to an array of UTF-8 chars
- * @inlen:  the length of @in
- *
- * Take a block of UTF-8 chars in and try to convert it to another
- * encoding.
- * Note: a first call designed to produce heading info is called with
- * in = NULL. If stateful this should also initialize the encoder state.
- *
- * Returns the number of bytes written, -1 if lack of space, or -2
- *     if the transcoding failed.
- * The value of @inlen after return is the number of octets consumed
- *     if the return value is positive, else unpredictiable.
- * The value of @outlen after return is the number of octets produced.
- */
-typedef int (* xmlCharEncodingOutputFunc)(unsigned char *out, int *outlen,
-                                          const unsigned char *in, int *inlen);
-
-
-/*
- * Block defining the handlers for non UTF-8 encodings.
- * If iconv is supported, there are two extra fields.
- */
-
-typedef struct _xmlCharEncodingHandler xmlCharEncodingHandler;
-typedef xmlCharEncodingHandler *xmlCharEncodingHandlerPtr;
-struct _xmlCharEncodingHandler {
-    char                       *name;
-    xmlCharEncodingInputFunc   input;
-    xmlCharEncodingOutputFunc  output;
-#ifdef LIBXML_ICONV_ENABLED
-    iconv_t                    iconv_in;
-    iconv_t                    iconv_out;
-#endif /* LIBXML_ICONV_ENABLED */
-};
-
-#ifdef __cplusplus
-}
-#endif
-#include <libxml/tree.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Interfaces for encoding handlers.
- */
-XMLPUBFUN void XMLCALL	
-	xmlInitCharEncodingHandlers	(void);
-XMLPUBFUN void XMLCALL	
-	xmlCleanupCharEncodingHandlers	(void);
-XMLPUBFUN void XMLCALL	
-	xmlRegisterCharEncodingHandler	(xmlCharEncodingHandlerPtr handler);
-XMLPUBFUN xmlCharEncodingHandlerPtr XMLCALL
-	xmlGetCharEncodingHandler	(xmlCharEncoding enc);
-XMLPUBFUN xmlCharEncodingHandlerPtr XMLCALL
-	xmlFindCharEncodingHandler	(const char *name);
-XMLPUBFUN xmlCharEncodingHandlerPtr XMLCALL
-	xmlNewCharEncodingHandler	(const char *name, 
-                          		 xmlCharEncodingInputFunc input,
-                          		 xmlCharEncodingOutputFunc output);
-
-/*
- * Interfaces for encoding names and aliases.
- */
-XMLPUBFUN int XMLCALL	
-	xmlAddEncodingAlias		(const char *name,
-					 const char *alias);
-XMLPUBFUN int XMLCALL	
-	xmlDelEncodingAlias		(const char *alias);
-XMLPUBFUN const char * XMLCALL
-	xmlGetEncodingAlias		(const char *alias);
-XMLPUBFUN void XMLCALL	
-	xmlCleanupEncodingAliases	(void);
-XMLPUBFUN xmlCharEncoding XMLCALL
-	xmlParseCharEncoding		(const char *name);
-XMLPUBFUN const char * XMLCALL
-	xmlGetCharEncodingName		(xmlCharEncoding enc);
-
-/*
- * Interfaces directly used by the parsers.
- */
-XMLPUBFUN xmlCharEncoding XMLCALL
-	xmlDetectCharEncoding		(const unsigned char *in,
-					 int len);
-
-XMLPUBFUN int XMLCALL	
-	xmlCharEncOutFunc		(xmlCharEncodingHandler *handler,
-					 xmlBufferPtr out,
-					 xmlBufferPtr in);
-
-XMLPUBFUN int XMLCALL	
-	xmlCharEncInFunc		(xmlCharEncodingHandler *handler,
-					 xmlBufferPtr out,
-					 xmlBufferPtr in);
-XMLPUBFUN int XMLCALL
-	xmlCharEncFirstLine		(xmlCharEncodingHandler *handler,
-					 xmlBufferPtr out,
-					 xmlBufferPtr in);
-XMLPUBFUN int XMLCALL	
-	xmlCharEncCloseFunc		(xmlCharEncodingHandler *handler);
-
-/*
- * Export a few useful functions
- */
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN int XMLCALL	
-	UTF8Toisolat1			(unsigned char *out,
-					 int *outlen,
-					 const unsigned char *in,
-					 int *inlen);
-#endif /* LIBXML_OUTPUT_ENABLED */
-XMLPUBFUN int XMLCALL	
-	isolat1ToUTF8			(unsigned char *out,
-					 int *outlen,
-					 const unsigned char *in,
-					 int *inlen);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* __XML_CHAR_ENCODING_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/entities.h igraph-0.6.5/msvc/include/libxml/entities.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/entities.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/entities.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,140 +0,0 @@
-/*
- * Summary: interface for the XML entities handling
- * Description: this module provides some of the entity API needed
- *              for the parser and applications.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_ENTITIES_H__
-#define __XML_ENTITIES_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The different valid entity types.
- */
-typedef enum {
-    XML_INTERNAL_GENERAL_ENTITY = 1,
-    XML_EXTERNAL_GENERAL_PARSED_ENTITY = 2,
-    XML_EXTERNAL_GENERAL_UNPARSED_ENTITY = 3,
-    XML_INTERNAL_PARAMETER_ENTITY = 4,
-    XML_EXTERNAL_PARAMETER_ENTITY = 5,
-    XML_INTERNAL_PREDEFINED_ENTITY = 6
-} xmlEntityType;
-
-/*
- * An unit of storage for an entity, contains the string, the value
- * and the linkind data needed for the linking in the hash table.
- */
-
-struct _xmlEntity {
-    void           *_private;	        /* application data */
-    xmlElementType          type;       /* XML_ENTITY_DECL, must be second ! */
-    const xmlChar          *name;	/* Entity name */
-    struct _xmlNode    *children;	/* First child link */
-    struct _xmlNode        *last;	/* Last child link */
-    struct _xmlDtd       *parent;	/* -> DTD */
-    struct _xmlNode        *next;	/* next sibling link  */
-    struct _xmlNode        *prev;	/* previous sibling link  */
-    struct _xmlDoc          *doc;       /* the containing document */
-
-    xmlChar                *orig;	/* content without ref substitution */
-    xmlChar             *content;	/* content or ndata if unparsed */
-    int                   length;	/* the content length */
-    xmlEntityType          etype;	/* The entity type */
-    const xmlChar    *ExternalID;	/* External identifier for PUBLIC */
-    const xmlChar      *SystemID;	/* URI for a SYSTEM or PUBLIC Entity */
-
-    struct _xmlEntity     *nexte;	/* unused */
-    const xmlChar           *URI;	/* the full URI as computed */
-    int                    owner;	/* does the entity own the childrens */
-    int			 checked;	/* was the entity content checked */
-};
-
-/*
- * All entities are stored in an hash table.
- * There is 2 separate hash tables for global and parameter entities.
- */
-
-typedef struct _xmlHashTable xmlEntitiesTable;
-typedef xmlEntitiesTable *xmlEntitiesTablePtr;
-
-/*
- * External functions:
- */
-
-#ifdef LIBXML_LEGACY_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlInitializePredefinedEntities	(void);
-#endif /* LIBXML_LEGACY_ENABLED */
-XMLPUBFUN xmlEntityPtr XMLCALL
-			xmlAddDocEntity		(xmlDocPtr doc,
-						 const xmlChar *name,
-						 int type,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID,
-						 const xmlChar *content);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlAddDtdEntity		(xmlDocPtr doc,
-						 const xmlChar *name,
-						 int type,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID,
-						 const xmlChar *content);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlGetPredefinedEntity	(const xmlChar *name);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlGetDocEntity		(xmlDocPtr doc,
-						 const xmlChar *name);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlGetDtdEntity		(xmlDocPtr doc,
-						 const xmlChar *name);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlGetParameterEntity	(xmlDocPtr doc,
-						 const xmlChar *name);
-#ifdef LIBXML_LEGACY_ENABLED
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlEncodeEntities	(xmlDocPtr doc,
-						 const xmlChar *input);
-#endif /* LIBXML_LEGACY_ENABLED */
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlEncodeEntitiesReentrant(xmlDocPtr doc,
-						 const xmlChar *input);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlEncodeSpecialChars	(xmlDocPtr doc,
-						 const xmlChar *input);
-XMLPUBFUN xmlEntitiesTablePtr XMLCALL	
-			xmlCreateEntitiesTable	(void);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlEntitiesTablePtr XMLCALL	
-			xmlCopyEntitiesTable	(xmlEntitiesTablePtr table);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL			
-			xmlFreeEntitiesTable	(xmlEntitiesTablePtr table);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL			
-			xmlDumpEntitiesTable	(xmlBufferPtr buf,
-						 xmlEntitiesTablePtr table);
-XMLPUBFUN void XMLCALL			
-			xmlDumpEntityDecl	(xmlBufferPtr buf,
-						 xmlEntityPtr ent);
-#endif /* LIBXML_OUTPUT_ENABLED */
-#ifdef LIBXML_LEGACY_ENABLED
-XMLPUBFUN void XMLCALL			
-			xmlCleanupPredefinedEntities(void);
-#endif /* LIBXML_LEGACY_ENABLED */
-
-
-#ifdef __cplusplus
-}
-#endif
-
-# endif /* __XML_ENTITIES_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/globals.h igraph-0.6.5/msvc/include/libxml/globals.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/globals.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/globals.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,491 +0,0 @@
-/*
- * Summary: interface for all global variables of the library
- * Description: all the global variables and thread handling for
- *              those variables is handled by this module.
- *
- * The bottom of this file is automatically generated by build_glob.py
- * based on the description file global.data
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Gary Pennington <Gary.Pennington@uk.sun.com>, Daniel Veillard
- */
-
-#ifndef __XML_GLOBALS_H
-#define __XML_GLOBALS_H
-
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-#include <libxml/xmlerror.h>
-#include <libxml/SAX.h>
-#include <libxml/SAX2.h>
-#include <libxml/xmlmemory.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-XMLPUBFUN void XMLCALL xmlInitGlobals(void);
-XMLPUBFUN void XMLCALL xmlCleanupGlobals(void);
-
-/**
- * xmlParserInputBufferCreateFilenameFunc:
- * @URI: the URI to read from
- * @enc: the requested source encoding
- *
- * Signature for the function doing the lookup for a suitable input method
- * corresponding to an URI.
- *
- * Returns the new xmlParserInputBufferPtr in case of success or NULL if no
- *         method was found.
- */
-typedef xmlParserInputBufferPtr (*xmlParserInputBufferCreateFilenameFunc) (const char *URI, xmlCharEncoding enc);
-
-/**
- * xmlOutputBufferCreateFilenameFunc:
- * @URI: the URI to write to
- * @enc: the requested target encoding
- *
- * Signature for the function doing the lookup for a suitable output method
- * corresponding to an URI.
- *
- * Returns the new xmlOutputBufferPtr in case of success or NULL if no
- *         method was found.
- */
-typedef xmlOutputBufferPtr (*xmlOutputBufferCreateFilenameFunc) (const char *URI, xmlCharEncodingHandlerPtr encoder, int compression);
-
-XMLPUBFUN xmlParserInputBufferCreateFilenameFunc
-XMLCALL xmlParserInputBufferCreateFilenameDefault (xmlParserInputBufferCreateFilenameFunc func);
-XMLPUBFUN xmlOutputBufferCreateFilenameFunc
-XMLCALL xmlOutputBufferCreateFilenameDefault (xmlOutputBufferCreateFilenameFunc func);
-
-/*
- * Externally global symbols which need to be protected for backwards
- * compatibility support.
- */
-
-#undef	docbDefaultSAXHandler
-#undef	htmlDefaultSAXHandler
-#undef	oldXMLWDcompatibility
-#undef	xmlBufferAllocScheme
-#undef	xmlDefaultBufferSize
-#undef	xmlDefaultSAXHandler
-#undef	xmlDefaultSAXLocator
-#undef	xmlDoValidityCheckingDefaultValue
-#undef	xmlFree
-#undef	xmlGenericError
-#undef	xmlStructuredError
-#undef	xmlGenericErrorContext
-#undef	xmlGetWarningsDefaultValue
-#undef	xmlIndentTreeOutput
-#undef  xmlTreeIndentString
-#undef	xmlKeepBlanksDefaultValue
-#undef	xmlLineNumbersDefaultValue
-#undef	xmlLoadExtDtdDefaultValue
-#undef	xmlMalloc
-#undef	xmlMallocAtomic
-#undef	xmlMemStrdup
-#undef	xmlParserDebugEntities
-#undef	xmlParserVersion
-#undef	xmlPedanticParserDefaultValue
-#undef	xmlRealloc
-#undef	xmlSaveNoEmptyTags
-#undef	xmlSubstituteEntitiesDefaultValue
-#undef  xmlRegisterNodeDefaultValue
-#undef  xmlDeregisterNodeDefaultValue
-#undef  xmlLastError
-#undef  xmlParserInputBufferCreateFilenameValue
-#undef  xmlOutputBufferCreateFilenameValue
-
-/**
- * xmlRegisterNodeFunc:
- * @node: the current node
- *
- * Signature for the registration callback of a created node
- */
-typedef void (*xmlRegisterNodeFunc) (xmlNodePtr node);
-/**
- * xmlDeregisterNodeFunc:
- * @node: the current node
- *
- * Signature for the deregistration callback of a discarded node
- */
-typedef void (*xmlDeregisterNodeFunc) (xmlNodePtr node);
-
-typedef struct _xmlGlobalState xmlGlobalState;
-typedef xmlGlobalState *xmlGlobalStatePtr;
-struct _xmlGlobalState
-{
-	const char *xmlParserVersion;
-
-	xmlSAXLocator xmlDefaultSAXLocator;
-	xmlSAXHandlerV1 xmlDefaultSAXHandler;
-	xmlSAXHandlerV1 docbDefaultSAXHandler;
-	xmlSAXHandlerV1 htmlDefaultSAXHandler;
-
-	xmlFreeFunc xmlFree;
-	xmlMallocFunc xmlMalloc;
-	xmlStrdupFunc xmlMemStrdup;
-	xmlReallocFunc xmlRealloc;
-
-	xmlGenericErrorFunc xmlGenericError;
-	xmlStructuredErrorFunc xmlStructuredError;
-	void *xmlGenericErrorContext;
-
-	int oldXMLWDcompatibility;
-
-	xmlBufferAllocationScheme xmlBufferAllocScheme;
-	int xmlDefaultBufferSize;
-
-	int xmlSubstituteEntitiesDefaultValue;
-	int xmlDoValidityCheckingDefaultValue;
-	int xmlGetWarningsDefaultValue;
-	int xmlKeepBlanksDefaultValue;
-	int xmlLineNumbersDefaultValue;
-	int xmlLoadExtDtdDefaultValue;
-	int xmlParserDebugEntities;
-	int xmlPedanticParserDefaultValue;
-
-	int xmlSaveNoEmptyTags;
-	int xmlIndentTreeOutput;
-	const char *xmlTreeIndentString;
-
-	xmlRegisterNodeFunc xmlRegisterNodeDefaultValue;
-	xmlDeregisterNodeFunc xmlDeregisterNodeDefaultValue;
-
-	xmlMallocFunc xmlMallocAtomic;
-	xmlError xmlLastError;
-
-	xmlParserInputBufferCreateFilenameFunc xmlParserInputBufferCreateFilenameValue;
-	xmlOutputBufferCreateFilenameFunc xmlOutputBufferCreateFilenameValue;
-};
-
-#ifdef __cplusplus
-}
-#endif
-#include <libxml/threads.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-XMLPUBFUN void XMLCALL	xmlInitializeGlobalState(xmlGlobalStatePtr gs);
-
-XMLPUBFUN void XMLCALL xmlThrDefSetGenericErrorFunc(void *ctx, xmlGenericErrorFunc handler);
-
-XMLPUBFUN void XMLCALL xmlThrDefSetStructuredErrorFunc(void *ctx, xmlStructuredErrorFunc handler);
-
-XMLPUBFUN xmlRegisterNodeFunc XMLCALL xmlRegisterNodeDefault(xmlRegisterNodeFunc func);
-XMLPUBFUN xmlRegisterNodeFunc XMLCALL xmlThrDefRegisterNodeDefault(xmlRegisterNodeFunc func);
-XMLPUBFUN xmlDeregisterNodeFunc XMLCALL xmlDeregisterNodeDefault(xmlDeregisterNodeFunc func);
-XMLPUBFUN xmlDeregisterNodeFunc XMLCALL xmlThrDefDeregisterNodeDefault(xmlDeregisterNodeFunc func);
-
-XMLPUBFUN xmlOutputBufferCreateFilenameFunc XMLCALL
-	xmlThrDefOutputBufferCreateFilenameDefault(xmlOutputBufferCreateFilenameFunc func);
-XMLPUBFUN xmlParserInputBufferCreateFilenameFunc XMLCALL
-	xmlThrDefParserInputBufferCreateFilenameDefault(xmlParserInputBufferCreateFilenameFunc func);
-
-/** DOC_DISABLE */
-/*
- * In general the memory allocation entry points are not kept
- * thread specific but this can be overridden by LIBXML_THREAD_ALLOC_ENABLED
- *    - xmlMalloc
- *    - xmlMallocAtomic
- *    - xmlRealloc
- *    - xmlMemStrdup
- *    - xmlFree
- */
-
-#ifdef LIBXML_THREAD_ALLOC_ENABLED
-#ifdef LIBXML_THREAD_ENABLED
-XMLPUBFUN  xmlMallocFunc * XMLCALL __xmlMalloc(void);
-#define xmlMalloc \
-(*(__xmlMalloc()))
-#else
-XMLPUBVAR xmlMallocFunc xmlMalloc;
-#endif
-
-#ifdef LIBXML_THREAD_ENABLED
-XMLPUBFUN  xmlMallocFunc * XMLCALL __xmlMallocAtomic(void);
-#define xmlMallocAtomic \
-(*(__xmlMallocAtomic()))
-#else
-XMLPUBVAR xmlMallocFunc xmlMallocAtomic;
-#endif
-
-#ifdef LIBXML_THREAD_ENABLED
-XMLPUBFUN  xmlReallocFunc * XMLCALL __xmlRealloc(void);
-#define xmlRealloc \
-(*(__xmlRealloc()))
-#else
-XMLPUBVAR xmlReallocFunc xmlRealloc;
-#endif
-
-#ifdef LIBXML_THREAD_ENABLED
-XMLPUBFUN  xmlFreeFunc * XMLCALL __xmlFree(void);
-#define xmlFree \
-(*(__xmlFree()))
-#else
-XMLPUBVAR xmlFreeFunc xmlFree;
-#endif
-
-#ifdef LIBXML_THREAD_ENABLED
-XMLPUBFUN  xmlStrdupFunc * XMLCALL __xmlMemStrdup(void);
-#define xmlMemStrdup \
-(*(__xmlMemStrdup()))
-#else
-XMLPUBVAR xmlStrdupFunc xmlMemStrdup;
-#endif
-
-#else /* !LIBXML_THREAD_ALLOC_ENABLED */
-XMLPUBVAR xmlMallocFunc xmlMalloc;
-XMLPUBVAR xmlMallocFunc xmlMallocAtomic;
-XMLPUBVAR xmlReallocFunc xmlRealloc;
-XMLPUBVAR xmlFreeFunc xmlFree;
-XMLPUBVAR xmlStrdupFunc xmlMemStrdup;
-#endif /* LIBXML_THREAD_ALLOC_ENABLED */
-
-#ifdef LIBXML_DOCB_ENABLED
-XMLPUBFUN  xmlSAXHandlerV1 * XMLCALL __docbDefaultSAXHandler(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define docbDefaultSAXHandler \
-(*(__docbDefaultSAXHandler()))
-#else
-XMLPUBVAR xmlSAXHandlerV1 docbDefaultSAXHandler;
-#endif
-#endif
-
-#ifdef LIBXML_HTML_ENABLED
-XMLPUBFUN xmlSAXHandlerV1 * XMLCALL __htmlDefaultSAXHandler(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define htmlDefaultSAXHandler \
-(*(__htmlDefaultSAXHandler()))
-#else
-XMLPUBVAR xmlSAXHandlerV1 htmlDefaultSAXHandler;
-#endif
-#endif
-
-XMLPUBFUN xmlError * XMLCALL __xmlLastError(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlLastError \
-(*(__xmlLastError()))
-#else
-XMLPUBVAR xmlError xmlLastError;
-#endif
-
-/*
- * Everything starting from the line below is
- * Automatically generated by build_glob.py.
- * Do not modify the previous line.
- */
-
-
-XMLPUBFUN int * XMLCALL __oldXMLWDcompatibility(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define oldXMLWDcompatibility \
-(*(__oldXMLWDcompatibility()))
-#else
-XMLPUBVAR int oldXMLWDcompatibility;
-#endif
-
-XMLPUBFUN xmlBufferAllocationScheme * XMLCALL __xmlBufferAllocScheme(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlBufferAllocScheme \
-(*(__xmlBufferAllocScheme()))
-#else
-XMLPUBVAR xmlBufferAllocationScheme xmlBufferAllocScheme;
-#endif
-XMLPUBFUN xmlBufferAllocationScheme XMLCALL xmlThrDefBufferAllocScheme(xmlBufferAllocationScheme v);
-
-XMLPUBFUN int * XMLCALL __xmlDefaultBufferSize(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlDefaultBufferSize \
-(*(__xmlDefaultBufferSize()))
-#else
-XMLPUBVAR int xmlDefaultBufferSize;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefDefaultBufferSize(int v);
-
-XMLPUBFUN xmlSAXHandlerV1 * XMLCALL __xmlDefaultSAXHandler(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlDefaultSAXHandler \
-(*(__xmlDefaultSAXHandler()))
-#else
-XMLPUBVAR xmlSAXHandlerV1 xmlDefaultSAXHandler;
-#endif
-
-XMLPUBFUN xmlSAXLocator * XMLCALL __xmlDefaultSAXLocator(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlDefaultSAXLocator \
-(*(__xmlDefaultSAXLocator()))
-#else
-XMLPUBVAR xmlSAXLocator xmlDefaultSAXLocator;
-#endif
-
-XMLPUBFUN int * XMLCALL __xmlDoValidityCheckingDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlDoValidityCheckingDefaultValue \
-(*(__xmlDoValidityCheckingDefaultValue()))
-#else
-XMLPUBVAR int xmlDoValidityCheckingDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefDoValidityCheckingDefaultValue(int v);
-
-XMLPUBFUN xmlGenericErrorFunc * XMLCALL __xmlGenericError(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlGenericError \
-(*(__xmlGenericError()))
-#else
-XMLPUBVAR xmlGenericErrorFunc xmlGenericError;
-#endif
-
-XMLPUBFUN xmlStructuredErrorFunc * XMLCALL __xmlStructuredError(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlStructuredError \
-(*(__xmlStructuredError()))
-#else
-XMLPUBVAR xmlStructuredErrorFunc xmlStructuredError;
-#endif
-
-XMLPUBFUN void * * XMLCALL __xmlGenericErrorContext(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlGenericErrorContext \
-(*(__xmlGenericErrorContext()))
-#else
-XMLPUBVAR void * xmlGenericErrorContext;
-#endif
-
-XMLPUBFUN int * XMLCALL __xmlGetWarningsDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlGetWarningsDefaultValue \
-(*(__xmlGetWarningsDefaultValue()))
-#else
-XMLPUBVAR int xmlGetWarningsDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefGetWarningsDefaultValue(int v);
-
-XMLPUBFUN int * XMLCALL __xmlIndentTreeOutput(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlIndentTreeOutput \
-(*(__xmlIndentTreeOutput()))
-#else
-XMLPUBVAR int xmlIndentTreeOutput;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefIndentTreeOutput(int v);
-
-XMLPUBFUN const char * * XMLCALL __xmlTreeIndentString(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlTreeIndentString \
-(*(__xmlTreeIndentString()))
-#else
-XMLPUBVAR const char * xmlTreeIndentString;
-#endif
-XMLPUBFUN const char * XMLCALL xmlThrDefTreeIndentString(const char * v);
-
-XMLPUBFUN int * XMLCALL __xmlKeepBlanksDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlKeepBlanksDefaultValue \
-(*(__xmlKeepBlanksDefaultValue()))
-#else
-XMLPUBVAR int xmlKeepBlanksDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefKeepBlanksDefaultValue(int v);
-
-XMLPUBFUN int * XMLCALL __xmlLineNumbersDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlLineNumbersDefaultValue \
-(*(__xmlLineNumbersDefaultValue()))
-#else
-XMLPUBVAR int xmlLineNumbersDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefLineNumbersDefaultValue(int v);
-
-XMLPUBFUN int * XMLCALL __xmlLoadExtDtdDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlLoadExtDtdDefaultValue \
-(*(__xmlLoadExtDtdDefaultValue()))
-#else
-XMLPUBVAR int xmlLoadExtDtdDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefLoadExtDtdDefaultValue(int v);
-
-XMLPUBFUN int * XMLCALL __xmlParserDebugEntities(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlParserDebugEntities \
-(*(__xmlParserDebugEntities()))
-#else
-XMLPUBVAR int xmlParserDebugEntities;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefParserDebugEntities(int v);
-
-XMLPUBFUN const char * * XMLCALL __xmlParserVersion(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlParserVersion \
-(*(__xmlParserVersion()))
-#else
-XMLPUBVAR const char * xmlParserVersion;
-#endif
-
-XMLPUBFUN int * XMLCALL __xmlPedanticParserDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlPedanticParserDefaultValue \
-(*(__xmlPedanticParserDefaultValue()))
-#else
-XMLPUBVAR int xmlPedanticParserDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefPedanticParserDefaultValue(int v);
-
-XMLPUBFUN int * XMLCALL __xmlSaveNoEmptyTags(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlSaveNoEmptyTags \
-(*(__xmlSaveNoEmptyTags()))
-#else
-XMLPUBVAR int xmlSaveNoEmptyTags;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefSaveNoEmptyTags(int v);
-
-XMLPUBFUN int * XMLCALL __xmlSubstituteEntitiesDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlSubstituteEntitiesDefaultValue \
-(*(__xmlSubstituteEntitiesDefaultValue()))
-#else
-XMLPUBVAR int xmlSubstituteEntitiesDefaultValue;
-#endif
-XMLPUBFUN int XMLCALL xmlThrDefSubstituteEntitiesDefaultValue(int v);
-
-XMLPUBFUN xmlRegisterNodeFunc * XMLCALL __xmlRegisterNodeDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlRegisterNodeDefaultValue \
-(*(__xmlRegisterNodeDefaultValue()))
-#else
-XMLPUBVAR xmlRegisterNodeFunc xmlRegisterNodeDefaultValue;
-#endif
-
-XMLPUBFUN xmlDeregisterNodeFunc * XMLCALL __xmlDeregisterNodeDefaultValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlDeregisterNodeDefaultValue \
-(*(__xmlDeregisterNodeDefaultValue()))
-#else
-XMLPUBVAR xmlDeregisterNodeFunc xmlDeregisterNodeDefaultValue;
-#endif
-
-XMLPUBFUN xmlParserInputBufferCreateFilenameFunc * XMLCALL __xmlParserInputBufferCreateFilenameValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlParserInputBufferCreateFilenameValue \
-(*(__xmlParserInputBufferCreateFilenameValue()))
-#else
-XMLPUBVAR xmlParserInputBufferCreateFilenameFunc xmlParserInputBufferCreateFilenameValue;
-#endif
-
-XMLPUBFUN xmlOutputBufferCreateFilenameFunc * XMLCALL __xmlOutputBufferCreateFilenameValue(void);
-#ifdef LIBXML_THREAD_ENABLED
-#define xmlOutputBufferCreateFilenameValue \
-(*(__xmlOutputBufferCreateFilenameValue()))
-#else
-XMLPUBVAR xmlOutputBufferCreateFilenameFunc xmlOutputBufferCreateFilenameValue;
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* __XML_GLOBALS_H */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/hash.h igraph-0.6.5/msvc/include/libxml/hash.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/hash.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/hash.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,233 +0,0 @@
-/*
- * Summary: Chained hash tables
- * Description: This module implements the hash table support used in 
- * 		various places in the library.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Bjorn Reese <bjorn.reese@systematic.dk>
- */
-
-#ifndef __XML_HASH_H__
-#define __XML_HASH_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The hash table.
- */
-typedef struct _xmlHashTable xmlHashTable;
-typedef xmlHashTable *xmlHashTablePtr;
-
-#ifdef __cplusplus
-}
-#endif
-
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-#include <libxml/dict.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Recent version of gcc produce a warning when a function pointer is assigned
- * to an object pointer, or vice versa.  The following macro is a dirty hack
- * to allow suppression of the warning.  If your architecture has function
- * pointers which are a different size than a void pointer, there may be some
- * serious trouble within the library.
- */
-/**
- * XML_CAST_FPTR:
- * @fptr:  pointer to a function
- *
- * Macro to do a casting from an object pointer to a
- * function pointer without encountering a warning from
- * gcc
- *
- * #define XML_CAST_FPTR(fptr) (*(void **)(&fptr))
- * This macro violated ISO C aliasing rules (gcc4 on s390 broke)
- * so it is disabled now
- */
-
-#define XML_CAST_FPTR(fptr) fptr
-
-
-/*
- * function types:
- */
-/**
- * xmlHashDeallocator:
- * @payload:  the data in the hash
- * @name:  the name associated
- *
- * Callback to free data from a hash.
- */
-typedef void (*xmlHashDeallocator)(void *payload, xmlChar *name);
-/**
- * xmlHashCopier:
- * @payload:  the data in the hash
- * @name:  the name associated
- *
- * Callback to copy data from a hash.
- *
- * Returns a copy of the data or NULL in case of error.
- */
-typedef void *(*xmlHashCopier)(void *payload, xmlChar *name);
-/**
- * xmlHashScanner:
- * @payload:  the data in the hash
- * @data:  extra scannner data
- * @name:  the name associated
- *
- * Callback when scanning data in a hash with the simple scanner.
- */
-typedef void (*xmlHashScanner)(void *payload, void *data, xmlChar *name);
-/**
- * xmlHashScannerFull:
- * @payload:  the data in the hash
- * @data:  extra scannner data
- * @name:  the name associated
- * @name2:  the second name associated
- * @name3:  the third name associated
- *
- * Callback when scanning data in a hash with the full scanner.
- */
-typedef void (*xmlHashScannerFull)(void *payload, void *data,
-				   const xmlChar *name, const xmlChar *name2,
-				   const xmlChar *name3);
-
-/*
- * Constructor and destructor.
- */
-XMLPUBFUN xmlHashTablePtr XMLCALL
-			xmlHashCreate	(int size);
-XMLPUBFUN xmlHashTablePtr XMLCALL
-			xmlHashCreateDict(int size,
-					 xmlDictPtr dict);
-XMLPUBFUN void XMLCALL			
-			xmlHashFree	(xmlHashTablePtr table,
-					 xmlHashDeallocator f);
-
-/*
- * Add a new entry to the hash table.
- */
-XMLPUBFUN int XMLCALL			
-			xmlHashAddEntry	(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         void *userdata);
-XMLPUBFUN int XMLCALL			
-			xmlHashUpdateEntry(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         void *userdata,
-					 xmlHashDeallocator f);
-XMLPUBFUN int XMLCALL		    
-			xmlHashAddEntry2(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         const xmlChar *name2,
-		                         void *userdata);
-XMLPUBFUN int XMLCALL			
-			xmlHashUpdateEntry2(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         const xmlChar *name2,
-		                         void *userdata,
-					 xmlHashDeallocator f);
-XMLPUBFUN int XMLCALL			
-			xmlHashAddEntry3(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         const xmlChar *name2,
-		                         const xmlChar *name3,
-		                         void *userdata);
-XMLPUBFUN int XMLCALL			
-			xmlHashUpdateEntry3(xmlHashTablePtr table,
-		                         const xmlChar *name,
-		                         const xmlChar *name2,
-		                         const xmlChar *name3,
-		                         void *userdata,
-					 xmlHashDeallocator f);
-
-/*
- * Remove an entry from the hash table.
- */
-XMLPUBFUN int XMLCALL     
-			xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name,
-                           xmlHashDeallocator f);
-XMLPUBFUN int XMLCALL     
-			xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name,
-                            const xmlChar *name2, xmlHashDeallocator f);
-XMLPUBFUN int  XMLCALL    
-			xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name,
-                            const xmlChar *name2, const xmlChar *name3,
-                            xmlHashDeallocator f);
-
-/*
- * Retrieve the userdata.
- */
-XMLPUBFUN void * XMLCALL			
-			xmlHashLookup	(xmlHashTablePtr table,
-					 const xmlChar *name);
-XMLPUBFUN void * XMLCALL			
-			xmlHashLookup2	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *name2);
-XMLPUBFUN void * XMLCALL			
-			xmlHashLookup3	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *name2,
-					 const xmlChar *name3);
-XMLPUBFUN void * XMLCALL			
-			xmlHashQLookup	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *prefix);
-XMLPUBFUN void * XMLCALL			
-			xmlHashQLookup2	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *prefix,
-					 const xmlChar *name2,
-					 const xmlChar *prefix2);
-XMLPUBFUN void * XMLCALL			
-			xmlHashQLookup3	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *prefix,
-					 const xmlChar *name2,
-					 const xmlChar *prefix2,
-					 const xmlChar *name3,
-					 const xmlChar *prefix3);
-
-/*
- * Helpers.
- */
-XMLPUBFUN xmlHashTablePtr XMLCALL		
-			xmlHashCopy	(xmlHashTablePtr table,
-					 xmlHashCopier f);
-XMLPUBFUN int XMLCALL			
-			xmlHashSize	(xmlHashTablePtr table);
-XMLPUBFUN void XMLCALL			
-			xmlHashScan	(xmlHashTablePtr table,
-					 xmlHashScanner f,
-					 void *data);
-XMLPUBFUN void XMLCALL			
-			xmlHashScan3	(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *name2,
-					 const xmlChar *name3,
-					 xmlHashScanner f,
-					 void *data);
-XMLPUBFUN void XMLCALL			
-			xmlHashScanFull	(xmlHashTablePtr table,
-					 xmlHashScannerFull f,
-					 void *data);
-XMLPUBFUN void XMLCALL			
-			xmlHashScanFull3(xmlHashTablePtr table,
-					 const xmlChar *name,
-					 const xmlChar *name2,
-					 const xmlChar *name3,
-					 xmlHashScannerFull f,
-					 void *data);
-#ifdef __cplusplus
-}
-#endif
-#endif /* ! __XML_HASH_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/list.h igraph-0.6.5/msvc/include/libxml/list.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/list.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/list.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,137 +0,0 @@
-/*
- * Summary: lists interfaces
- * Description: this module implement the list support used in 
- * various place in the library.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Gary Pennington <Gary.Pennington@uk.sun.com>
- */
-
-#ifndef __XML_LINK_INCLUDE__
-#define __XML_LINK_INCLUDE__
-
-#include <libxml/xmlversion.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct _xmlLink xmlLink;
-typedef xmlLink *xmlLinkPtr;
-
-typedef struct _xmlList xmlList;
-typedef xmlList *xmlListPtr;
-
-/**
- * xmlListDeallocator:
- * @lk:  the data to deallocate
- *
- * Callback function used to free data from a list.
- */
-typedef void (*xmlListDeallocator) (xmlLinkPtr lk);
-/**
- * xmlListDataCompare:
- * @data0: the first data
- * @data1: the second data
- *
- * Callback function used to compare 2 data.
- *
- * Returns 0 is equality, -1 or 1 otherwise depending on the ordering.
- */
-typedef int  (*xmlListDataCompare) (const void *data0, const void *data1);
-/**
- * xmlListWalker:
- * @data: the data found in the list
- * @user: extra user provided data to the walker
- *
- * Callback function used when walking a list with xmlListWalk().
- *
- * Returns 0 to stop walking the list, 1 otherwise.
- */
-typedef int (*xmlListWalker) (const void *data, const void *user);
-
-/* Creation/Deletion */
-XMLPUBFUN xmlListPtr XMLCALL
-		xmlListCreate		(xmlListDeallocator deallocator,
-	                                 xmlListDataCompare compare);
-XMLPUBFUN void XMLCALL		
-		xmlListDelete		(xmlListPtr l);
-
-/* Basic Operators */
-XMLPUBFUN void * XMLCALL		
-		xmlListSearch		(xmlListPtr l,
-					 void *data);
-XMLPUBFUN void * XMLCALL		
-		xmlListReverseSearch	(xmlListPtr l,
-					 void *data);
-XMLPUBFUN int XMLCALL		
-		xmlListInsert		(xmlListPtr l,
-					 void *data) ;
-XMLPUBFUN int XMLCALL		
-		xmlListAppend		(xmlListPtr l,
-					 void *data) ;
-XMLPUBFUN int XMLCALL		
-		xmlListRemoveFirst	(xmlListPtr l,
-					 void *data);
-XMLPUBFUN int XMLCALL		
-		xmlListRemoveLast	(xmlListPtr l,
-					 void *data);
-XMLPUBFUN int XMLCALL		
-		xmlListRemoveAll	(xmlListPtr l,
-					 void *data);
-XMLPUBFUN void XMLCALL		
-		xmlListClear		(xmlListPtr l);
-XMLPUBFUN int XMLCALL		
-		xmlListEmpty		(xmlListPtr l);
-XMLPUBFUN xmlLinkPtr XMLCALL	
-		xmlListFront		(xmlListPtr l);
-XMLPUBFUN xmlLinkPtr XMLCALL	
-		xmlListEnd		(xmlListPtr l);
-XMLPUBFUN int XMLCALL		
-		xmlListSize		(xmlListPtr l);
-
-XMLPUBFUN void XMLCALL		
-		xmlListPopFront		(xmlListPtr l);
-XMLPUBFUN void XMLCALL		
-		xmlListPopBack		(xmlListPtr l);
-XMLPUBFUN int XMLCALL		
-		xmlListPushFront	(xmlListPtr l,
-					 void *data);
-XMLPUBFUN int XMLCALL		
-		xmlListPushBack		(xmlListPtr l,
-					 void *data);
-
-/* Advanced Operators */
-XMLPUBFUN void XMLCALL		
-		xmlListReverse		(xmlListPtr l);
-XMLPUBFUN void XMLCALL		
-		xmlListSort		(xmlListPtr l);
-XMLPUBFUN void XMLCALL		
-		xmlListWalk		(xmlListPtr l,
-					 xmlListWalker walker,
-					 const void *user);
-XMLPUBFUN void XMLCALL		
-		xmlListReverseWalk	(xmlListPtr l,
-					 xmlListWalker walker,
-					 const void *user);
-XMLPUBFUN void XMLCALL		
-		xmlListMerge		(xmlListPtr l1,
-					 xmlListPtr l2);
-XMLPUBFUN xmlListPtr XMLCALL	
-		xmlListDup		(const xmlListPtr old);
-XMLPUBFUN int XMLCALL		
-		xmlListCopy		(xmlListPtr cur,
-					 const xmlListPtr old);
-/* Link operators */
-XMLPUBFUN void * XMLCALL          
-		xmlLinkGetData          (xmlLinkPtr lk);
-
-/* xmlListUnique() */
-/* xmlListSwap */
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* __XML_LINK_INCLUDE__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/nanoftp.h igraph-0.6.5/msvc/include/libxml/nanoftp.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/nanoftp.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/nanoftp.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,143 +0,0 @@
-/*
- * Summary: minimal FTP implementation
- * Description: minimal FTP implementation allowing to fetch resources
- *              like external subset.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
- 
-#ifndef __NANO_FTP_H__
-#define __NANO_FTP_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_FTP_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * ftpListCallback: 
- * @userData:  user provided data for the callback
- * @filename:  the file name (including "->" when links are shown)
- * @attrib:  the attribute string
- * @owner:  the owner string
- * @group:  the group string
- * @size:  the file size
- * @links:  the link count
- * @year:  the year
- * @month:  the month
- * @day:  the day
- * @hour:  the hour
- * @minute:  the minute
- *
- * A callback for the xmlNanoFTPList command.
- * Note that only one of year and day:minute are specified.
- */
-typedef void (*ftpListCallback) (void *userData,
-	                         const char *filename, const char *attrib,
-	                         const char *owner, const char *group,
-				 unsigned long size, int links, int year,
-				 const char *month, int day, int hour,
-				 int minute);
-/**
- * ftpDataCallback: 
- * @userData: the user provided context
- * @data: the data received
- * @len: its size in bytes
- *
- * A callback for the xmlNanoFTPGet command.
- */
-typedef void (*ftpDataCallback) (void *userData,
-				 const char *data,
-				 int len);
-
-/*
- * Init
- */
-XMLPUBFUN void XMLCALL
-	xmlNanoFTPInit		(void);
-XMLPUBFUN void XMLCALL	
-	xmlNanoFTPCleanup	(void);
-
-/*
- * Creating/freeing contexts.
- */
-XMLPUBFUN void * XMLCALL	
-	xmlNanoFTPNewCtxt	(const char *URL);
-XMLPUBFUN void XMLCALL	
-	xmlNanoFTPFreeCtxt	(void * ctx);
-XMLPUBFUN void * XMLCALL 	
-	xmlNanoFTPConnectTo	(const char *server,
-				 int port);
-/*
- * Opening/closing session connections.
- */
-XMLPUBFUN void * XMLCALL 	
-	xmlNanoFTPOpen		(const char *URL);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPConnect	(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPClose		(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPQuit		(void *ctx);
-XMLPUBFUN void XMLCALL	
-	xmlNanoFTPScanProxy	(const char *URL);
-XMLPUBFUN void XMLCALL	
-	xmlNanoFTPProxy		(const char *host,
-				 int port,
-				 const char *user,
-				 const char *passwd,
-				 int type);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPUpdateURL	(void *ctx,
-				 const char *URL);
-
-/*
- * Rather internal commands.
- */
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPGetResponse	(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPCheckResponse	(void *ctx);
-
-/*
- * CD/DIR/GET handlers.
- */
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPCwd		(void *ctx,
-				 const char *directory);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPDele		(void *ctx,
-				 const char *file);
-
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPGetConnection	(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPCloseConnection(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPList		(void *ctx,
-				 ftpListCallback callback,
-				 void *userData,
-				 const char *filename);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPGetSocket	(void *ctx,
-				 const char *filename);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPGet		(void *ctx,
-				 ftpDataCallback callback,
-				 void *userData,
-				 const char *filename);
-XMLPUBFUN int XMLCALL	
-	xmlNanoFTPRead		(void *ctx,
-				 void *dest,
-				 int len);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* LIBXML_FTP_ENABLED */
-#endif /* __NANO_FTP_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/nanohttp.h igraph-0.6.5/msvc/include/libxml/nanohttp.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/nanohttp.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/nanohttp.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,81 +0,0 @@
-/*
- * Summary: minimal HTTP implementation
- * Description: minimal HTTP implementation allowing to fetch resources
- *              like external subset.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
- 
-#ifndef __NANO_HTTP_H__
-#define __NANO_HTTP_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_HTTP_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-XMLPUBFUN void XMLCALL
-	xmlNanoHTTPInit		(void);
-XMLPUBFUN void XMLCALL	
-	xmlNanoHTTPCleanup	(void);
-XMLPUBFUN void XMLCALL	
-	xmlNanoHTTPScanProxy	(const char *URL);
-XMLPUBFUN int XMLCALL	
-	xmlNanoHTTPFetch	(const char *URL,
-				 const char *filename,
-				 char **contentType);
-XMLPUBFUN void * XMLCALL	
-	xmlNanoHTTPMethod	(const char *URL,
-				 const char *method,
-				 const char *input,
-				 char **contentType,
-				 const char *headers,
-				 int   ilen);
-XMLPUBFUN void * XMLCALL	
-	xmlNanoHTTPMethodRedir	(const char *URL,
-				 const char *method,
-				 const char *input,
-				 char **contentType,
-				 char **redir,
-				 const char *headers,
-				 int   ilen);
-XMLPUBFUN void * XMLCALL	
-	xmlNanoHTTPOpen		(const char *URL,
-				 char **contentType);
-XMLPUBFUN void * XMLCALL	
-	xmlNanoHTTPOpenRedir	(const char *URL,
-				 char **contentType,
-				 char **redir);
-XMLPUBFUN int XMLCALL	
-	xmlNanoHTTPReturnCode	(void *ctx);
-XMLPUBFUN const char * XMLCALL 
-	xmlNanoHTTPAuthHeader	(void *ctx);
-XMLPUBFUN const char * XMLCALL
-	xmlNanoHTTPRedir	(void *ctx);
-XMLPUBFUN int XMLCALL
-	xmlNanoHTTPContentLength( void * ctx );
-XMLPUBFUN const char * XMLCALL
-	xmlNanoHTTPEncoding	(void *ctx);
-XMLPUBFUN const char * XMLCALL
-	xmlNanoHTTPMimeType	(void *ctx);
-XMLPUBFUN int XMLCALL	
-	xmlNanoHTTPRead		(void *ctx,
-				 void *dest,
-				 int len);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN int XMLCALL	
-	xmlNanoHTTPSave		(void *ctxt,
-				 const char *filename);
-#endif /* LIBXML_OUTPUT_ENABLED */
-XMLPUBFUN void XMLCALL	
-	xmlNanoHTTPClose	(void *ctx);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_HTTP_ENABLED */
-#endif /* __NANO_HTTP_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/parser.h igraph-0.6.5/msvc/include/libxml/parser.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/parser.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/parser.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,1220 +0,0 @@
-/*
- * Summary: the core parser module
- * Description: Interfaces, constants and types related to the XML parser
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_PARSER_H__
-#define __XML_PARSER_H__
-
-#include <stdarg.h>
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/dict.h>
-#include <libxml/hash.h>
-#include <libxml/valid.h>
-#include <libxml/entities.h>
-#include <libxml/xmlerror.h>
-#include <libxml/xmlstring.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * XML_DEFAULT_VERSION:
- *
- * The default version of XML used: 1.0
- */
-#define XML_DEFAULT_VERSION	"1.0"
-
-/**
- * xmlParserInput:
- *
- * An xmlParserInput is an input flow for the XML processor.
- * Each entity parsed is associated an xmlParserInput (except the
- * few predefined ones). This is the case both for internal entities
- * - in which case the flow is already completely in memory - or
- * external entities - in which case we use the buf structure for
- * progressive reading and I18N conversions to the internal UTF-8 format.
- */
-
-/**
- * xmlParserInputDeallocate:
- * @str:  the string to deallocate
- *
- * Callback for freeing some parser input allocations.
- */
-typedef void (* xmlParserInputDeallocate)(xmlChar *str);
-
-struct _xmlParserInput {
-    /* Input buffer */
-    xmlParserInputBufferPtr buf;      /* UTF-8 encoded buffer */
-
-    const char *filename;             /* The file analyzed, if any */
-    const char *directory;            /* the directory/base of the file */
-    const xmlChar *base;              /* Base of the array to parse */
-    const xmlChar *cur;               /* Current char being parsed */
-    const xmlChar *end;               /* end of the array to parse */
-    int length;                       /* length if known */
-    int line;                         /* Current line */
-    int col;                          /* Current column */
-    /*
-     * NOTE: consumed is only tested for equality in the parser code,
-     *       so even if there is an overflow this should not give troubles
-     *       for parsing very large instances.
-     */
-    unsigned long consumed;           /* How many xmlChars already consumed */
-    xmlParserInputDeallocate free;    /* function to deallocate the base */
-    const xmlChar *encoding;          /* the encoding string for entity */
-    const xmlChar *version;           /* the version string for entity */
-    int standalone;                   /* Was that entity marked standalone */
-    int id;                           /* an unique identifier for the entity */
-};
-
-/**
- * xmlParserNodeInfo:
- *
- * The parser can be asked to collect Node informations, i.e. at what
- * place in the file they were detected. 
- * NOTE: This is off by default and not very well tested.
- */
-typedef struct _xmlParserNodeInfo xmlParserNodeInfo;
-typedef xmlParserNodeInfo *xmlParserNodeInfoPtr;
-
-struct _xmlParserNodeInfo {
-  const struct _xmlNode* node;
-  /* Position & line # that text that created the node begins & ends on */
-  unsigned long begin_pos;
-  unsigned long begin_line;
-  unsigned long end_pos;
-  unsigned long end_line;
-};
-
-typedef struct _xmlParserNodeInfoSeq xmlParserNodeInfoSeq;
-typedef xmlParserNodeInfoSeq *xmlParserNodeInfoSeqPtr;
-struct _xmlParserNodeInfoSeq {
-  unsigned long maximum;
-  unsigned long length;
-  xmlParserNodeInfo* buffer;
-};
-
-/**
- * xmlParserInputState:
- *
- * The parser is now working also as a state based parser.
- * The recursive one use the state info for entities processing.
- */
-typedef enum {
-    XML_PARSER_EOF = -1,	/* nothing is to be parsed */
-    XML_PARSER_START = 0,	/* nothing has been parsed */
-    XML_PARSER_MISC,		/* Misc* before int subset */
-    XML_PARSER_PI,		/* Within a processing instruction */
-    XML_PARSER_DTD,		/* within some DTD content */
-    XML_PARSER_PROLOG,		/* Misc* after internal subset */
-    XML_PARSER_COMMENT,		/* within a comment */
-    XML_PARSER_START_TAG,	/* within a start tag */
-    XML_PARSER_CONTENT,		/* within the content */
-    XML_PARSER_CDATA_SECTION,	/* within a CDATA section */
-    XML_PARSER_END_TAG,		/* within a closing tag */
-    XML_PARSER_ENTITY_DECL,	/* within an entity declaration */
-    XML_PARSER_ENTITY_VALUE,	/* within an entity value in a decl */
-    XML_PARSER_ATTRIBUTE_VALUE,	/* within an attribute value */
-    XML_PARSER_SYSTEM_LITERAL,	/* within a SYSTEM value */
-    XML_PARSER_EPILOG, 		/* the Misc* after the last end tag */
-    XML_PARSER_IGNORE,		/* within an IGNORED section */
-    XML_PARSER_PUBLIC_LITERAL 	/* within a PUBLIC value */
-} xmlParserInputState;
-
-/**
- * XML_DETECT_IDS:
- *
- * Bit in the loadsubset context field to tell to do ID/REFs lookups.
- * Use it to initialize xmlLoadExtDtdDefaultValue.
- */
-#define XML_DETECT_IDS		2
-
-/**
- * XML_COMPLETE_ATTRS:
- *
- * Bit in the loadsubset context field to tell to do complete the
- * elements attributes lists with the ones defaulted from the DTDs.
- * Use it to initialize xmlLoadExtDtdDefaultValue.
- */
-#define XML_COMPLETE_ATTRS	4
-
-/**
- * XML_SKIP_IDS:
- *
- * Bit in the loadsubset context field to tell to not do ID/REFs registration.
- * Used to initialize xmlLoadExtDtdDefaultValue in some special cases.
- */
-#define XML_SKIP_IDS		8
-
-/**
- * xmlParserMode:
- *
- * A parser can operate in various modes
- */
-typedef enum {
-    XML_PARSE_UNKNOWN = 0,
-    XML_PARSE_DOM = 1,
-    XML_PARSE_SAX = 2,
-    XML_PARSE_PUSH_DOM = 3,
-    XML_PARSE_PUSH_SAX = 4,
-    XML_PARSE_READER = 5
-} xmlParserMode;
-
-/**
- * xmlParserCtxt:
- *
- * The parser context.
- * NOTE This doesn't completely define the parser state, the (current ?)
- *      design of the parser uses recursive function calls since this allow
- *      and easy mapping from the production rules of the specification
- *      to the actual code. The drawback is that the actual function call
- *      also reflect the parser state. However most of the parsing routines
- *      takes as the only argument the parser context pointer, so migrating
- *      to a state based parser for progressive parsing shouldn't be too hard.
- */
-struct _xmlParserCtxt {
-    struct _xmlSAXHandler *sax;       /* The SAX handler */
-    void            *userData;        /* For SAX interface only, used by DOM build */
-    xmlDocPtr           myDoc;        /* the document being built */
-    int            wellFormed;        /* is the document well formed */
-    int       replaceEntities;        /* shall we replace entities ? */
-    const xmlChar    *version;        /* the XML version string */
-    const xmlChar   *encoding;        /* the declared encoding, if any */
-    int            standalone;        /* standalone document */
-    int                  html;        /* an HTML(1)/Docbook(2) document */
-
-    /* Input stream stack */
-    xmlParserInputPtr  input;         /* Current input stream */
-    int                inputNr;       /* Number of current input streams */
-    int                inputMax;      /* Max number of input streams */
-    xmlParserInputPtr *inputTab;      /* stack of inputs */
-
-    /* Node analysis stack only used for DOM building */
-    xmlNodePtr         node;          /* Current parsed Node */
-    int                nodeNr;        /* Depth of the parsing stack */
-    int                nodeMax;       /* Max depth of the parsing stack */
-    xmlNodePtr        *nodeTab;       /* array of nodes */
-
-    int record_info;                  /* Whether node info should be kept */
-    xmlParserNodeInfoSeq node_seq;    /* info about each node parsed */
-
-    int errNo;                        /* error code */
-
-    int     hasExternalSubset;        /* reference and external subset */
-    int             hasPErefs;        /* the internal subset has PE refs */
-    int              external;        /* are we parsing an external entity */
-
-    int                 valid;        /* is the document valid */
-    int              validate;        /* shall we try to validate ? */
-    xmlValidCtxt        vctxt;        /* The validity context */
-
-    xmlParserInputState instate;      /* current type of input */
-    int                 token;        /* next char look-ahead */    
-
-    char           *directory;        /* the data directory */
-
-    /* Node name stack */
-    const xmlChar     *name;          /* Current parsed Node */
-    int                nameNr;        /* Depth of the parsing stack */
-    int                nameMax;       /* Max depth of the parsing stack */
-    const xmlChar *   *nameTab;       /* array of nodes */
-
-    long               nbChars;       /* number of xmlChar processed */
-    long            checkIndex;       /* used by progressive parsing lookup */
-    int             keepBlanks;       /* ugly but ... */
-    int             disableSAX;       /* SAX callbacks are disabled */
-    int               inSubset;       /* Parsing is in int 1/ext 2 subset */
-    const xmlChar *    intSubName;    /* name of subset */
-    xmlChar *          extSubURI;     /* URI of external subset */
-    xmlChar *          extSubSystem;  /* SYSTEM ID of external subset */
-
-    /* xml:space values */
-    int *              space;         /* Should the parser preserve spaces */
-    int                spaceNr;       /* Depth of the parsing stack */
-    int                spaceMax;      /* Max depth of the parsing stack */
-    int *              spaceTab;      /* array of space infos */
-
-    int                depth;         /* to prevent entity substitution loops */
-    xmlParserInputPtr  entity;        /* used to check entities boundaries */
-    int                charset;       /* encoding of the in-memory content
-				         actually an xmlCharEncoding */
-    int                nodelen;       /* Those two fields are there to */
-    int                nodemem;       /* Speed up large node parsing */
-    int                pedantic;      /* signal pedantic warnings */
-    void              *_private;      /* For user data, libxml won't touch it */
-
-    int                loadsubset;    /* should the external subset be loaded */
-    int                linenumbers;   /* set line number in element content */
-    void              *catalogs;      /* document's own catalog */
-    int                recovery;      /* run in recovery mode */
-    int                progressive;   /* is this a progressive parsing */
-    xmlDictPtr         dict;          /* dictionnary for the parser */
-    const xmlChar *   *atts;          /* array for the attributes callbacks */
-    int                maxatts;       /* the size of the array */
-    int                docdict;       /* use strings from dict to build tree */
-
-    /*
-     * pre-interned strings
-     */
-    const xmlChar *str_xml;
-    const xmlChar *str_xmlns;
-    const xmlChar *str_xml_ns;
-
-    /*
-     * Everything below is used only by the new SAX mode
-     */
-    int                sax2;          /* operating in the new SAX mode */
-    int                nsNr;          /* the number of inherited namespaces */
-    int                nsMax;         /* the size of the arrays */
-    const xmlChar *   *nsTab;         /* the array of prefix/namespace name */
-    int               *attallocs;     /* which attribute were allocated */
-    void *            *pushTab;       /* array of data for push */
-    xmlHashTablePtr    attsDefault;   /* defaulted attributes if any */
-    xmlHashTablePtr    attsSpecial;   /* non-CDATA attributes if any */
-    int                nsWellFormed;  /* is the document XML Nanespace okay */
-    int                options;       /* Extra options */
-
-    /*
-     * Those fields are needed only for treaming parsing so far
-     */
-    int               dictNames;    /* Use dictionary names for the tree */
-    int               freeElemsNr;  /* number of freed element nodes */
-    xmlNodePtr        freeElems;    /* List of freed element nodes */
-    int               freeAttrsNr;  /* number of freed attributes nodes */
-    xmlAttrPtr        freeAttrs;    /* List of freed attributes nodes */
-
-    /*
-     * the complete error informations for the last error.
-     */
-    xmlError          lastError;
-    xmlParserMode     parseMode;    /* the parser mode */
-};
-
-/**
- * xmlSAXLocator:
- *
- * A SAX Locator.
- */
-struct _xmlSAXLocator {
-    const xmlChar *(*getPublicId)(void *ctx);
-    const xmlChar *(*getSystemId)(void *ctx);
-    int (*getLineNumber)(void *ctx);
-    int (*getColumnNumber)(void *ctx);
-};
-
-/**
- * xmlSAXHandler:
- *
- * A SAX handler is bunch of callbacks called by the parser when processing
- * of the input generate data or structure informations.
- */
-
-/**
- * resolveEntitySAXFunc:
- * @ctx:  the user data (XML parser context)
- * @publicId: The public ID of the entity
- * @systemId: The system ID of the entity
- *
- * Callback:
- * The entity loader, to control the loading of external entities,
- * the application can either:
- *    - override this resolveEntity() callback in the SAX block
- *    - or better use the xmlSetExternalEntityLoader() function to
- *      set up it's own entity resolution routine
- *
- * Returns the xmlParserInputPtr if inlined or NULL for DOM behaviour.
- */
-typedef xmlParserInputPtr (*resolveEntitySAXFunc) (void *ctx,
-				const xmlChar *publicId,
-				const xmlChar *systemId);
-/**
- * internalSubsetSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  the root element name
- * @ExternalID:  the external ID
- * @SystemID:  the SYSTEM ID (e.g. filename or URL)
- *
- * Callback on internal subset declaration.
- */
-typedef void (*internalSubsetSAXFunc) (void *ctx,
-				const xmlChar *name,
-				const xmlChar *ExternalID,
-				const xmlChar *SystemID);
-/**
- * externalSubsetSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  the root element name
- * @ExternalID:  the external ID
- * @SystemID:  the SYSTEM ID (e.g. filename or URL)
- *
- * Callback on external subset declaration.
- */
-typedef void (*externalSubsetSAXFunc) (void *ctx,
-				const xmlChar *name,
-				const xmlChar *ExternalID,
-				const xmlChar *SystemID);
-/**
- * getEntitySAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name: The entity name
- *
- * Get an entity by name.
- *
- * Returns the xmlEntityPtr if found.
- */
-typedef xmlEntityPtr (*getEntitySAXFunc) (void *ctx,
-				const xmlChar *name);
-/**
- * getParameterEntitySAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name: The entity name
- *
- * Get a parameter entity by name.
- *
- * Returns the xmlEntityPtr if found.
- */
-typedef xmlEntityPtr (*getParameterEntitySAXFunc) (void *ctx,
-				const xmlChar *name);
-/**
- * entityDeclSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  the entity name 
- * @type:  the entity type 
- * @publicId: The public ID of the entity
- * @systemId: The system ID of the entity
- * @content: the entity value (without processing).
- *
- * An entity definition has been parsed.
- */
-typedef void (*entityDeclSAXFunc) (void *ctx,
-				const xmlChar *name,
-				int type,
-				const xmlChar *publicId,
-				const xmlChar *systemId,
-				xmlChar *content);
-/**
- * notationDeclSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name: The name of the notation
- * @publicId: The public ID of the entity
- * @systemId: The system ID of the entity
- *
- * What to do when a notation declaration has been parsed.
- */
-typedef void (*notationDeclSAXFunc)(void *ctx,
-				const xmlChar *name,
-				const xmlChar *publicId,
-				const xmlChar *systemId);
-/**
- * attributeDeclSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @elem:  the name of the element
- * @fullname:  the attribute name 
- * @type:  the attribute type 
- * @def:  the type of default value
- * @defaultValue: the attribute default value
- * @tree:  the tree of enumerated value set
- *
- * An attribute definition has been parsed.
- */
-typedef void (*attributeDeclSAXFunc)(void *ctx,
-				const xmlChar *elem,
-				const xmlChar *fullname,
-				int type,
-				int def,
-				const xmlChar *defaultValue,
-				xmlEnumerationPtr tree);
-/**
- * elementDeclSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  the element name 
- * @type:  the element type 
- * @content: the element value tree
- *
- * An element definition has been parsed.
- */
-typedef void (*elementDeclSAXFunc)(void *ctx,
-				const xmlChar *name,
-				int type,
-				xmlElementContentPtr content);
-/**
- * unparsedEntityDeclSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name: The name of the entity
- * @publicId: The public ID of the entity
- * @systemId: The system ID of the entity
- * @notationName: the name of the notation
- *
- * What to do when an unparsed entity declaration is parsed.
- */
-typedef void (*unparsedEntityDeclSAXFunc)(void *ctx,
-				const xmlChar *name,
-				const xmlChar *publicId,
-				const xmlChar *systemId,
-				const xmlChar *notationName);
-/**
- * setDocumentLocatorSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @loc: A SAX Locator
- *
- * Receive the document locator at startup, actually xmlDefaultSAXLocator.
- * Everything is available on the context, so this is useless in our case.
- */
-typedef void (*setDocumentLocatorSAXFunc) (void *ctx,
-				xmlSAXLocatorPtr loc);
-/**
- * startDocumentSAXFunc:
- * @ctx:  the user data (XML parser context)
- *
- * Called when the document start being processed.
- */
-typedef void (*startDocumentSAXFunc) (void *ctx);
-/**
- * endDocumentSAXFunc:
- * @ctx:  the user data (XML parser context)
- *
- * Called when the document end has been detected.
- */
-typedef void (*endDocumentSAXFunc) (void *ctx);
-/**
- * startElementSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  The element name, including namespace prefix
- * @atts:  An array of name/value attributes pairs, NULL terminated
- *
- * Called when an opening tag has been processed.
- */
-typedef void (*startElementSAXFunc) (void *ctx,
-				const xmlChar *name,
-				const xmlChar **atts);
-/**
- * endElementSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  The element name
- *
- * Called when the end of an element has been detected.
- */
-typedef void (*endElementSAXFunc) (void *ctx,
-				const xmlChar *name);
-/**
- * attributeSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  The attribute name, including namespace prefix
- * @value:  The attribute value
- *
- * Handle an attribute that has been read by the parser.
- * The default handling is to convert the attribute into an
- * DOM subtree and past it in a new xmlAttr element added to
- * the element.
- */
-typedef void (*attributeSAXFunc) (void *ctx,
-				const xmlChar *name,
-				const xmlChar *value);
-/**
- * referenceSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @name:  The entity name
- *
- * Called when an entity reference is detected. 
- */
-typedef void (*referenceSAXFunc) (void *ctx,
-				const xmlChar *name);
-/**
- * charactersSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @ch:  a xmlChar string
- * @len: the number of xmlChar
- *
- * Receiving some chars from the parser.
- */
-typedef void (*charactersSAXFunc) (void *ctx,
-				const xmlChar *ch,
-				int len);
-/**
- * ignorableWhitespaceSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @ch:  a xmlChar string
- * @len: the number of xmlChar
- *
- * Receiving some ignorable whitespaces from the parser.
- * UNUSED: by default the DOM building will use characters.
- */
-typedef void (*ignorableWhitespaceSAXFunc) (void *ctx,
-				const xmlChar *ch,
-				int len);
-/**
- * processingInstructionSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @target:  the target name
- * @data: the PI data's
- *
- * A processing instruction has been parsed.
- */
-typedef void (*processingInstructionSAXFunc) (void *ctx,
-				const xmlChar *target,
-				const xmlChar *data);
-/**
- * commentSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @value:  the comment content
- *
- * A comment has been parsed.
- */
-typedef void (*commentSAXFunc) (void *ctx,
-				const xmlChar *value);
-/**
- * cdataBlockSAXFunc:
- * @ctx:  the user data (XML parser context)
- * @value:  The pcdata content
- * @len:  the block length
- *
- * Called when a pcdata block has been parsed.
- */
-typedef void (*cdataBlockSAXFunc) (
-	                        void *ctx,
-				const xmlChar *value,
-				int len);
-/**
- * warningSAXFunc:
- * @ctx:  an XML parser context
- * @msg:  the message to display/transmit
- * @...:  extra parameters for the message display
- * 
- * Display and format a warning messages, callback.
- */
-typedef void (XMLCDECL *warningSAXFunc) (void *ctx,
-				const char *msg, ...);
-/**
- * errorSAXFunc:
- * @ctx:  an XML parser context
- * @msg:  the message to display/transmit
- * @...:  extra parameters for the message display
- * 
- * Display and format an error messages, callback.
- */
-typedef void (XMLCDECL *errorSAXFunc) (void *ctx,
-				const char *msg, ...);
-/**
- * fatalErrorSAXFunc:
- * @ctx:  an XML parser context
- * @msg:  the message to display/transmit
- * @...:  extra parameters for the message display
- * 
- * Display and format fatal error messages, callback.
- * Note: so far fatalError() SAX callbacks are not used, error()
- *       get all the callbacks for errors.
- */
-typedef void (XMLCDECL *fatalErrorSAXFunc) (void *ctx,
-				const char *msg, ...);
-/**
- * isStandaloneSAXFunc:
- * @ctx:  the user data (XML parser context)
- *
- * Is this document tagged standalone?
- *
- * Returns 1 if true
- */
-typedef int (*isStandaloneSAXFunc) (void *ctx);
-/**
- * hasInternalSubsetSAXFunc:
- * @ctx:  the user data (XML parser context)
- *
- * Does this document has an internal subset.
- *
- * Returns 1 if true
- */
-typedef int (*hasInternalSubsetSAXFunc) (void *ctx);
-
-/**
- * hasExternalSubsetSAXFunc:
- * @ctx:  the user data (XML parser context)
- *
- * Does this document has an external subset?
- *
- * Returns 1 if true
- */
-typedef int (*hasExternalSubsetSAXFunc) (void *ctx);
-
-/************************************************************************
- *									*
- *			The SAX version 2 API extensions		*
- *									*
- ************************************************************************/
-/**
- * XML_SAX2_MAGIC:
- *
- * Special constant found in SAX2 blocks initialized fields
- */
-#define XML_SAX2_MAGIC 0xDEEDBEAF
-
-/**
- * startElementNsSAX2Func:
- * @ctx:  the user data (XML parser context)
- * @localname:  the local name of the element
- * @prefix:  the element namespace prefix if available
- * @URI:  the element namespace name if available
- * @nb_namespaces:  number of namespace definitions on that node
- * @namespaces:  pointer to the array of prefix/URI pairs namespace definitions
- * @nb_attributes:  the number of attributes on that node
- * @nb_defaulted:  the number of defaulted attributes. The defaulted
- *                  ones are at the end of the array
- * @attributes:  pointer to the array of (localname/prefix/URI/value/end)
- *               attribute values.
- *
- * SAX2 callback when an element start has been detected by the parser.
- * It provides the namespace informations for the element, as well as
- * the new namespace declarations on the element.
- */
-
-typedef void (*startElementNsSAX2Func) (void *ctx,
-					const xmlChar *localname,
-					const xmlChar *prefix,
-					const xmlChar *URI,
-					int nb_namespaces,
-					const xmlChar **namespaces,
-					int nb_attributes,
-					int nb_defaulted,
-					const xmlChar **attributes);
- 
-/**
- * endElementNsSAX2Func:
- * @ctx:  the user data (XML parser context)
- * @localname:  the local name of the element
- * @prefix:  the element namespace prefix if available
- * @URI:  the element namespace name if available
- *
- * SAX2 callback when an element end has been detected by the parser.
- * It provides the namespace informations for the element.
- */
-
-typedef void (*endElementNsSAX2Func)   (void *ctx,
-					const xmlChar *localname,
-					const xmlChar *prefix,
-					const xmlChar *URI);
-
-
-struct _xmlSAXHandler {
-    internalSubsetSAXFunc internalSubset;
-    isStandaloneSAXFunc isStandalone;
-    hasInternalSubsetSAXFunc hasInternalSubset;
-    hasExternalSubsetSAXFunc hasExternalSubset;
-    resolveEntitySAXFunc resolveEntity;
-    getEntitySAXFunc getEntity;
-    entityDeclSAXFunc entityDecl;
-    notationDeclSAXFunc notationDecl;
-    attributeDeclSAXFunc attributeDecl;
-    elementDeclSAXFunc elementDecl;
-    unparsedEntityDeclSAXFunc unparsedEntityDecl;
-    setDocumentLocatorSAXFunc setDocumentLocator;
-    startDocumentSAXFunc startDocument;
-    endDocumentSAXFunc endDocument;
-    startElementSAXFunc startElement;
-    endElementSAXFunc endElement;
-    referenceSAXFunc reference;
-    charactersSAXFunc characters;
-    ignorableWhitespaceSAXFunc ignorableWhitespace;
-    processingInstructionSAXFunc processingInstruction;
-    commentSAXFunc comment;
-    warningSAXFunc warning;
-    errorSAXFunc error;
-    fatalErrorSAXFunc fatalError; /* unused error() get all the errors */
-    getParameterEntitySAXFunc getParameterEntity;
-    cdataBlockSAXFunc cdataBlock;
-    externalSubsetSAXFunc externalSubset;
-    unsigned int initialized;
-    /* The following fields are extensions available only on version 2 */
-    void *_private;
-    startElementNsSAX2Func startElementNs;
-    endElementNsSAX2Func endElementNs;
-    xmlStructuredErrorFunc serror;
-};
-
-/*
- * SAX Version 1
- */
-typedef struct _xmlSAXHandlerV1 xmlSAXHandlerV1;
-typedef xmlSAXHandlerV1 *xmlSAXHandlerV1Ptr;
-struct _xmlSAXHandlerV1 {
-    internalSubsetSAXFunc internalSubset;
-    isStandaloneSAXFunc isStandalone;
-    hasInternalSubsetSAXFunc hasInternalSubset;
-    hasExternalSubsetSAXFunc hasExternalSubset;
-    resolveEntitySAXFunc resolveEntity;
-    getEntitySAXFunc getEntity;
-    entityDeclSAXFunc entityDecl;
-    notationDeclSAXFunc notationDecl;
-    attributeDeclSAXFunc attributeDecl;
-    elementDeclSAXFunc elementDecl;
-    unparsedEntityDeclSAXFunc unparsedEntityDecl;
-    setDocumentLocatorSAXFunc setDocumentLocator;
-    startDocumentSAXFunc startDocument;
-    endDocumentSAXFunc endDocument;
-    startElementSAXFunc startElement;
-    endElementSAXFunc endElement;
-    referenceSAXFunc reference;
-    charactersSAXFunc characters;
-    ignorableWhitespaceSAXFunc ignorableWhitespace;
-    processingInstructionSAXFunc processingInstruction;
-    commentSAXFunc comment;
-    warningSAXFunc warning;
-    errorSAXFunc error;
-    fatalErrorSAXFunc fatalError; /* unused error() get all the errors */
-    getParameterEntitySAXFunc getParameterEntity;
-    cdataBlockSAXFunc cdataBlock;
-    externalSubsetSAXFunc externalSubset;
-    unsigned int initialized;
-};
-
-
-/**
- * xmlExternalEntityLoader:
- * @URL: The System ID of the resource requested
- * @ID: The Public ID of the resource requested
- * @context: the XML parser context 
- *
- * External entity loaders types.
- *
- * Returns the entity input parser.
- */
-typedef xmlParserInputPtr (*xmlExternalEntityLoader) (const char *URL,
-					 const char *ID,
-					 xmlParserCtxtPtr context);
-
-#ifdef __cplusplus
-}
-#endif
-
-#include <libxml/encoding.h>
-#include <libxml/xmlIO.h>
-#include <libxml/globals.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-
-/*
- * Init/Cleanup
- */
-XMLPUBFUN void XMLCALL		
-		xmlInitParser		(void);
-XMLPUBFUN void XMLCALL		
-		xmlCleanupParser	(void);
-
-/*
- * Input functions
- */
-XMLPUBFUN int XMLCALL		
-		xmlParserInputRead	(xmlParserInputPtr in,
-					 int len);
-XMLPUBFUN int XMLCALL		
-		xmlParserInputGrow	(xmlParserInputPtr in,
-					 int len);
-
-/*
- * Basic parsing Interfaces
- */
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlParseDoc		(const xmlChar *cur);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlParseFile		(const char *filename);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlParseMemory		(const char *buffer,
-					 int size);
-#endif /* LIBXML_SAX1_ENABLED */
-XMLPUBFUN int XMLCALL		
-		xmlSubstituteEntitiesDefault(int val);
-XMLPUBFUN int XMLCALL		
-		xmlKeepBlanksDefault	(int val);
-XMLPUBFUN void XMLCALL		
-		xmlStopParser		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL		
-		xmlPedanticParserDefault(int val);
-XMLPUBFUN int XMLCALL		
-		xmlLineNumbersDefault	(int val);
-
-#ifdef LIBXML_SAX1_ENABLED
-/*
- * Recovery mode 
- */
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlRecoverDoc		(xmlChar *cur);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlRecoverMemory	(const char *buffer,
-					 int size);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlRecoverFile		(const char *filename);
-#endif /* LIBXML_SAX1_ENABLED */
-
-/*
- * Less common routines and SAX interfaces
- */
-XMLPUBFUN int XMLCALL		
-		xmlParseDocument	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL		
-		xmlParseExtParsedEnt	(xmlParserCtxtPtr ctxt);
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN int XMLCALL		
-		xmlSAXUserParseFile	(xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 const char *filename);
-XMLPUBFUN int XMLCALL		
-		xmlSAXUserParseMemory	(xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 const char *buffer,
-					 int size);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseDoc		(xmlSAXHandlerPtr sax,
-					 const xmlChar *cur,
-					 int recovery);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseMemory	(xmlSAXHandlerPtr sax,
-					 const char *buffer,
-                                   	 int size,
-					 int recovery);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseMemoryWithData (xmlSAXHandlerPtr sax,
-					 const char *buffer,
-                                   	 int size,
-					 int recovery,
-					 void *data);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseFile		(xmlSAXHandlerPtr sax,
-					 const char *filename,
-					 int recovery);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseFileWithData	(xmlSAXHandlerPtr sax,
-					 const char *filename,
-					 int recovery,
-					 void *data);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlSAXParseEntity	(xmlSAXHandlerPtr sax,
-					 const char *filename);
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlParseEntity		(const char *filename);
-#endif /* LIBXML_SAX1_ENABLED */
-
-#ifdef LIBXML_VALID_ENABLED
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlSAXParseDTD		(xmlSAXHandlerPtr sax,
-					 const xmlChar *ExternalID,
-					 const xmlChar *SystemID);
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlParseDTD		(const xmlChar *ExternalID,
-					 const xmlChar *SystemID);
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlIOParseDTD		(xmlSAXHandlerPtr sax,
-					 xmlParserInputBufferPtr input,
-					 xmlCharEncoding enc);
-#endif /* LIBXML_VALID_ENABLE */
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN int XMLCALL	
-		xmlParseBalancedChunkMemory(xmlDocPtr doc,
-					 xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 int depth,
-					 const xmlChar *string,
-					 xmlNodePtr *lst);
-#endif /* LIBXML_SAX1_ENABLED */
-XMLPUBFUN xmlParserErrors XMLCALL
-		xmlParseInNodeContext	(xmlNodePtr node,
-					 const char *data,
-					 int datalen,
-					 int options,
-					 xmlNodePtr *lst);
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN int XMLCALL          
-		xmlParseBalancedChunkMemoryRecover(xmlDocPtr doc,
-                     xmlSAXHandlerPtr sax,
-                     void *user_data,
-                     int depth,
-                     const xmlChar *string,
-                     xmlNodePtr *lst,
-                     int recover);
-XMLPUBFUN int XMLCALL		
-		xmlParseExternalEntity	(xmlDocPtr doc,
-					 xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 int depth,
-					 const xmlChar *URL,
-					 const xmlChar *ID,
-					 xmlNodePtr *lst);
-#endif /* LIBXML_SAX1_ENABLED */
-XMLPUBFUN int XMLCALL		
-		xmlParseCtxtExternalEntity(xmlParserCtxtPtr ctx,
-					 const xmlChar *URL,
-					 const xmlChar *ID,
-					 xmlNodePtr *lst);
-
-/*
- * Parser contexts handling.
- */
-XMLPUBFUN xmlParserCtxtPtr XMLCALL	
-		xmlNewParserCtxt	(void);
-XMLPUBFUN int XMLCALL		
-		xmlInitParserCtxt	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL		
-		xmlClearParserCtxt	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL		
-		xmlFreeParserCtxt	(xmlParserCtxtPtr ctxt);
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlSetupParserForBuffer	(xmlParserCtxtPtr ctxt,
-					 const xmlChar* buffer,
-					 const char *filename);
-#endif /* LIBXML_SAX1_ENABLED */
-XMLPUBFUN xmlParserCtxtPtr XMLCALL 
-		xmlCreateDocParserCtxt	(const xmlChar *cur);
-
-#ifdef LIBXML_LEGACY_ENABLED
-/*
- * Reading/setting optional parsing features.
- */
-XMLPUBFUN int XMLCALL		
-		xmlGetFeaturesList	(int *len,
-					 const char **result);
-XMLPUBFUN int XMLCALL		
-		xmlGetFeature		(xmlParserCtxtPtr ctxt,
-					 const char *name,
-					 void *result);
-XMLPUBFUN int XMLCALL		
-		xmlSetFeature		(xmlParserCtxtPtr ctxt,
-					 const char *name,
-					 void *value);
-#endif /* LIBXML_LEGACY_ENABLED */
-
-#ifdef LIBXML_PUSH_ENABLED
-/*
- * Interfaces for the Push mode.
- */
-XMLPUBFUN xmlParserCtxtPtr XMLCALL 
-		xmlCreatePushParserCtxt(xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 const char *chunk,
-					 int size,
-					 const char *filename);
-XMLPUBFUN int XMLCALL		 
-		xmlParseChunk		(xmlParserCtxtPtr ctxt,
-					 const char *chunk,
-					 int size,
-					 int terminate);
-#endif /* LIBXML_PUSH_ENABLED */
-
-/*
- * Special I/O mode.
- */
-
-XMLPUBFUN xmlParserCtxtPtr XMLCALL 
-		xmlCreateIOParserCtxt	(xmlSAXHandlerPtr sax,
-					 void *user_data,
-					 xmlInputReadCallback   ioread,
-					 xmlInputCloseCallback  ioclose,
-					 void *ioctx,
-					 xmlCharEncoding enc);
-
-XMLPUBFUN xmlParserInputPtr XMLCALL 
-		xmlNewIOInputStream	(xmlParserCtxtPtr ctxt,
-					 xmlParserInputBufferPtr input,
-					 xmlCharEncoding enc);
-
-/*
- * Node infos.
- */
-XMLPUBFUN const xmlParserNodeInfo* XMLCALL
-		xmlParserFindNodeInfo	(const xmlParserCtxtPtr ctxt,
-				         const xmlNodePtr node);
-XMLPUBFUN void XMLCALL		
-		xmlInitNodeInfoSeq	(xmlParserNodeInfoSeqPtr seq);
-XMLPUBFUN void XMLCALL		
-		xmlClearNodeInfoSeq	(xmlParserNodeInfoSeqPtr seq);
-XMLPUBFUN unsigned long XMLCALL 
-		xmlParserFindNodeInfoIndex(const xmlParserNodeInfoSeqPtr seq,
-                                         const xmlNodePtr node);
-XMLPUBFUN void XMLCALL		
-		xmlParserAddNodeInfo	(xmlParserCtxtPtr ctxt,
-					 const xmlParserNodeInfoPtr info);
-
-/*
- * External entities handling actually implemented in xmlIO.
- */
-
-XMLPUBFUN void XMLCALL		
-		xmlSetExternalEntityLoader(xmlExternalEntityLoader f);
-XMLPUBFUN xmlExternalEntityLoader XMLCALL
-		xmlGetExternalEntityLoader(void);
-XMLPUBFUN xmlParserInputPtr XMLCALL
-		xmlLoadExternalEntity	(const char *URL,
-					 const char *ID,
-					 xmlParserCtxtPtr ctxt);
-
-/*
- * Index lookup, actually implemented in the encoding module
- */
-XMLPUBFUN long XMLCALL
-		xmlByteConsumed		(xmlParserCtxtPtr ctxt);
-
-/*
- * New set of simpler/more flexible APIs
- */
-/**
- * xmlParserOption:
- *
- * This is the set of XML parser options that can be passed down
- * to the xmlReadDoc() and similar calls.
- */
-typedef enum {
-    XML_PARSE_RECOVER	= 1<<0,	/* recover on errors */
-    XML_PARSE_NOENT	= 1<<1,	/* substitute entities */
-    XML_PARSE_DTDLOAD	= 1<<2,	/* load the external subset */
-    XML_PARSE_DTDATTR	= 1<<3,	/* default DTD attributes */
-    XML_PARSE_DTDVALID	= 1<<4,	/* validate with the DTD */
-    XML_PARSE_NOERROR	= 1<<5,	/* suppress error reports */
-    XML_PARSE_NOWARNING	= 1<<6,	/* suppress warning reports */
-    XML_PARSE_PEDANTIC	= 1<<7,	/* pedantic error reporting */
-    XML_PARSE_NOBLANKS	= 1<<8,	/* remove blank nodes */
-    XML_PARSE_SAX1	= 1<<9,	/* use the SAX1 interface internally */
-    XML_PARSE_XINCLUDE	= 1<<10,/* Implement XInclude substitition  */
-    XML_PARSE_NONET	= 1<<11,/* Forbid network access */
-    XML_PARSE_NODICT	= 1<<12,/* Do not reuse the context dictionnary */
-    XML_PARSE_NSCLEAN	= 1<<13,/* remove redundant namespaces declarations */
-    XML_PARSE_NOCDATA	= 1<<14,/* merge CDATA as text nodes */
-    XML_PARSE_NOXINCNODE= 1<<15,/* do not generate XINCLUDE START/END nodes */
-    XML_PARSE_COMPACT   = 1<<16 /* compact small text nodes; no modification of
-                                   the tree allowed afterwards (will possibly
-				   crash if you try to modify the tree) */
-} xmlParserOption;
-
-XMLPUBFUN void XMLCALL
-		xmlCtxtReset		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-		xmlCtxtResetPush	(xmlParserCtxtPtr ctxt,
-					 const char *chunk,
-					 int size,
-					 const char *filename,
-					 const char *encoding);
-XMLPUBFUN int XMLCALL
-		xmlCtxtUseOptions	(xmlParserCtxtPtr ctxt,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlReadDoc		(const xmlChar *cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlReadFile		(const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlReadMemory		(const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlReadFd		(int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlReadIO		(xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlCtxtReadDoc		(xmlParserCtxtPtr ctxt,
-					 const xmlChar *cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlCtxtReadFile		(xmlParserCtxtPtr ctxt,
-					 const char *filename,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlCtxtReadMemory		(xmlParserCtxtPtr ctxt,
-					 const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlCtxtReadFd		(xmlParserCtxtPtr ctxt,
-					 int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlDocPtr XMLCALL
-		xmlCtxtReadIO		(xmlParserCtxtPtr ctxt,
-					 xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-
-/*
- * Library wide options
- */
-/**
- * xmlFeature:
- *
- * Used to examine the existance of features that can be enabled
- * or disabled at compile-time.
- * They used to be called XML_FEATURE_xxx but this clashed with Expat
- */
-typedef enum {
-    XML_WITH_THREAD = 1,
-    XML_WITH_TREE = 2,
-    XML_WITH_OUTPUT = 3,
-    XML_WITH_PUSH = 4,
-    XML_WITH_READER = 5,
-    XML_WITH_PATTERN = 6,
-    XML_WITH_WRITER = 7,
-    XML_WITH_SAX1 = 8,
-    XML_WITH_FTP = 9,
-    XML_WITH_HTTP = 10,
-    XML_WITH_VALID = 11,
-    XML_WITH_HTML = 12,
-    XML_WITH_LEGACY = 13,
-    XML_WITH_C14N = 14,
-    XML_WITH_CATALOG = 15,
-    XML_WITH_XPATH = 16,
-    XML_WITH_XPTR = 17,
-    XML_WITH_XINCLUDE = 18,
-    XML_WITH_ICONV = 19,
-    XML_WITH_ISO8859X = 20,
-    XML_WITH_UNICODE = 21,
-    XML_WITH_REGEXP = 22,
-    XML_WITH_AUTOMATA = 23,
-    XML_WITH_EXPR = 24,
-    XML_WITH_SCHEMAS = 25,
-    XML_WITH_SCHEMATRON = 26,
-    XML_WITH_MODULES = 27,
-    XML_WITH_DEBUG = 28,
-    XML_WITH_DEBUG_MEM = 29,
-    XML_WITH_DEBUG_RUN = 30,
-    XML_WITH_ZLIB = 31,
-    XML_WITH_NONE = 99999 /* just to be sure of allocation size */
-} xmlFeature;
-
-XMLPUBFUN int XMLCALL
-		xmlHasFeature		(xmlFeature feature);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_PARSER_H__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/parserInternals.h igraph-0.6.5/msvc/include/libxml/parserInternals.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/parserInternals.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/parserInternals.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,602 +0,0 @@
-/*
- * Summary: internals routines exported by the parser.
- * Description: this module exports a number of internal parsing routines
- *              they are not really all intended for applications but
- *              can prove useful doing low level processing.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_PARSER_INTERNALS_H__
-#define __XML_PARSER_INTERNALS_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/parser.h>
-#include <libxml/HTMLparser.h>
-#include <libxml/chvalid.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlParserMaxDepth:
- *
- * arbitrary depth limit for the XML documents that we allow to 
- * process. This is not a limitation of the parser but a safety 
- * boundary feature.
- */
-XMLPUBVAR unsigned int xmlParserMaxDepth;
-
- /**
-  * XML_MAX_NAMELEN:
-  *
-  * Identifiers can be longer, but this will be more costly
-  * at runtime.
-  */
-#define XML_MAX_NAMELEN 100
-
-/**
- * INPUT_CHUNK:
- *
- * The parser tries to always have that amount of input ready.
- * One of the point is providing context when reporting errors.
- */
-#define INPUT_CHUNK	250
-
-/************************************************************************
- *									*
- * UNICODE version of the macros.      					*
- *									*
- ************************************************************************/
-/**
- * IS_BYTE_CHAR:
- * @c:  an byte value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [2] Char ::= #x9 | #xA | #xD | [#x20...]
- * any byte character in the accepted range
- */
-#define IS_BYTE_CHAR(c)	 xmlIsChar_ch(c)
-
-/**
- * IS_CHAR:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [2] Char ::= #x9 | #xA | #xD | [#x20-#xD7FF] | [#xE000-#xFFFD]
- *                  | [#x10000-#x10FFFF]
- * any Unicode character, excluding the surrogate blocks, FFFE, and FFFF.
- */
-#define IS_CHAR(c)   xmlIsCharQ(c)
-
-/**
- * IS_CHAR_CH:
- * @c: an xmlChar (usually an unsigned char)
- *
- * Behaves like IS_CHAR on single-byte value
- */
-#define IS_CHAR_CH(c)  xmlIsChar_ch(c)
-
-/**
- * IS_BLANK:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [3] S ::= (#x20 | #x9 | #xD | #xA)+
- */
-#define IS_BLANK(c)  xmlIsBlankQ(c)
-
-/**
- * IS_BLANK_CH:
- * @c:  an xmlChar value (normally unsigned char)
- *
- * Behaviour same as IS_BLANK
- */
-#define IS_BLANK_CH(c)  xmlIsBlank_ch(c)
-
-/**
- * IS_BASECHAR:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [85] BaseChar ::= ... long list see REC ...
- */
-#define IS_BASECHAR(c) xmlIsBaseCharQ(c)
-
-/**
- * IS_DIGIT:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [88] Digit ::= ... long list see REC ...
- */
-#define IS_DIGIT(c) xmlIsDigitQ(c)
-
-/**
- * IS_DIGIT_CH:
- * @c:  an xmlChar value (usually an unsigned char)
- *
- * Behaves like IS_DIGIT but with a single byte argument
- */
-#define IS_DIGIT_CH(c)  xmlIsDigit_ch(c)
-
-/**
- * IS_COMBINING:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- * [87] CombiningChar ::= ... long list see REC ...
- */
-#define IS_COMBINING(c) xmlIsCombiningQ(c)
-
-/**
- * IS_COMBINING_CH:
- * @c:  an xmlChar (usually an unsigned char)
- *
- * Always false (all combining chars > 0xff)
- */
-#define IS_COMBINING_CH(c) 0 
-
-/**
- * IS_EXTENDER:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- *
- * [89] Extender ::= #x00B7 | #x02D0 | #x02D1 | #x0387 | #x0640 |
- *                   #x0E46 | #x0EC6 | #x3005 | [#x3031-#x3035] |
- *                   [#x309D-#x309E] | [#x30FC-#x30FE]
- */
-#define IS_EXTENDER(c) xmlIsExtenderQ(c)
-
-/**
- * IS_EXTENDER_CH:
- * @c:  an xmlChar value (usually an unsigned char)
- *
- * Behaves like IS_EXTENDER but with a single-byte argument
- */
-#define IS_EXTENDER_CH(c)  xmlIsExtender_ch(c)
-
-/**
- * IS_IDEOGRAPHIC:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- *
- * [86] Ideographic ::= [#x4E00-#x9FA5] | #x3007 | [#x3021-#x3029]
- */
-#define IS_IDEOGRAPHIC(c) xmlIsIdeographicQ(c)
-
-/**
- * IS_LETTER:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- *
- * [84] Letter ::= BaseChar | Ideographic 
- */
-#define IS_LETTER(c) (IS_BASECHAR(c) || IS_IDEOGRAPHIC(c))
-
-/**
- * IS_LETTER_CH:
- * @c:  an xmlChar value (normally unsigned char)
- *
- * Macro behaves like IS_LETTER, but only check base chars
- *
- */
-#define IS_LETTER_CH(c) xmlIsBaseChar_ch(c)
-
-/**
- * IS_ASCII_LETTER:
- * @c: an xmlChar value
- *
- * Macro to check [a-zA-Z]
- *
- */
-#define IS_ASCII_LETTER(c)	(((0x41 <= (c)) && ((c) <= 0x5a)) || \
-				 ((0x61 <= (c)) && ((c) <= 0x7a)))
-
-/**
- * IS_ASCII_DIGIT:
- * @c: an xmlChar value
- *
- * Macro to check [0-9]
- *
- */
-#define IS_ASCII_DIGIT(c)	((0x30 <= (c)) && ((c) <= 0x39))
-
-/**
- * IS_PUBIDCHAR:
- * @c:  an UNICODE value (int)
- *
- * Macro to check the following production in the XML spec:
- *
- *
- * [13] PubidChar ::= #x20 | #xD | #xA | [a-zA-Z0-9] | [-'()+,./:=?;!*#@$_%]
- */
-#define IS_PUBIDCHAR(c)	xmlIsPubidCharQ(c)
-
-/**
- * IS_PUBIDCHAR_CH:
- * @c:  an xmlChar value (normally unsigned char)
- *
- * Same as IS_PUBIDCHAR but for single-byte value
- */
-#define IS_PUBIDCHAR_CH(c) xmlIsPubidChar_ch(c)
-
-/**
- * SKIP_EOL:
- * @p:  and UTF8 string pointer
- *
- * Skips the end of line chars.
- */
-#define SKIP_EOL(p) 							\
-    if (*(p) == 0x13) { p++ ; if (*(p) == 0x10) p++; }			\
-    if (*(p) == 0x10) { p++ ; if (*(p) == 0x13) p++; }
-
-/**
- * MOVETO_ENDTAG:
- * @p:  and UTF8 string pointer
- *
- * Skips to the next '>' char.
- */
-#define MOVETO_ENDTAG(p)						\
-    while ((*p) && (*(p) != '>')) (p)++
-
-/**
- * MOVETO_STARTTAG:
- * @p:  and UTF8 string pointer
- *
- * Skips to the next '<' char.
- */
-#define MOVETO_STARTTAG(p)						\
-    while ((*p) && (*(p) != '<')) (p)++
-
-/**
- * Global variables used for predefined strings.
- */
-XMLPUBVAR const xmlChar xmlStringText[];
-XMLPUBVAR const xmlChar xmlStringTextNoenc[];
-XMLPUBVAR const xmlChar xmlStringComment[];
-
-/*
- * Function to finish the work of the macros where needed.
- */
-XMLPUBFUN int XMLCALL                   xmlIsLetter     (int c);
-
-/**
- * Parser context.
- */
-XMLPUBFUN xmlParserCtxtPtr XMLCALL	
-			xmlCreateFileParserCtxt	(const char *filename);
-XMLPUBFUN xmlParserCtxtPtr XMLCALL	
-			xmlCreateURLParserCtxt	(const char *filename,
-						 int options);
-XMLPUBFUN xmlParserCtxtPtr XMLCALL	
-			xmlCreateMemoryParserCtxt(const char *buffer,
-						 int size);
-XMLPUBFUN xmlParserCtxtPtr XMLCALL	
-			xmlCreateEntityParserCtxt(const xmlChar *URL,
-						 const xmlChar *ID,
-						 const xmlChar *base);
-XMLPUBFUN int XMLCALL			
-			xmlSwitchEncoding	(xmlParserCtxtPtr ctxt,
-						 xmlCharEncoding enc);
-XMLPUBFUN int XMLCALL			
-			xmlSwitchToEncoding	(xmlParserCtxtPtr ctxt,
-					 xmlCharEncodingHandlerPtr handler);
-XMLPUBFUN int XMLCALL			
-			xmlSwitchInputEncoding	(xmlParserCtxtPtr ctxt,
-						 xmlParserInputPtr input,
-					 xmlCharEncodingHandlerPtr handler);
-
-#ifdef IN_LIBXML
-/* internal error reporting */
-XMLPUBFUN void XMLCALL
-			__xmlErrEncoding	(xmlParserCtxtPtr ctxt,
-						 xmlParserErrors xmlerr,
-						 const char *msg,
-						 const xmlChar * str1,
-						 const xmlChar * str2);
-#endif
-
-/**
- * Input Streams.
- */
-XMLPUBFUN xmlParserInputPtr XMLCALL	
-			xmlNewStringInputStream	(xmlParserCtxtPtr ctxt,
-						 const xmlChar *buffer);
-XMLPUBFUN xmlParserInputPtr XMLCALL	
-			xmlNewEntityInputStream	(xmlParserCtxtPtr ctxt,
-						 xmlEntityPtr entity);
-XMLPUBFUN void XMLCALL			
-			xmlPushInput		(xmlParserCtxtPtr ctxt,
-						 xmlParserInputPtr input);
-XMLPUBFUN xmlChar XMLCALL			
-			xmlPopInput		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlFreeInputStream	(xmlParserInputPtr input);
-XMLPUBFUN xmlParserInputPtr XMLCALL	
-			xmlNewInputFromFile	(xmlParserCtxtPtr ctxt,
-						 const char *filename);
-XMLPUBFUN xmlParserInputPtr XMLCALL	
-			xmlNewInputStream	(xmlParserCtxtPtr ctxt);
-
-/**
- * Namespaces.
- */
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlSplitQName		(xmlParserCtxtPtr ctxt,
-						 const xmlChar *name,
-						 xmlChar **prefix);
-
-/**
- * Generic production rules.
- */
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlParseName		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseNmtoken		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseEntityValue	(xmlParserCtxtPtr ctxt,
-						 xmlChar **orig);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseAttValue	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseSystemLiteral	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParsePubidLiteral	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseCharData	(xmlParserCtxtPtr ctxt,
-						 int cdata);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseExternalID	(xmlParserCtxtPtr ctxt,
-						 xmlChar **publicID,
-						 int strict);
-XMLPUBFUN void XMLCALL			
-			xmlParseComment		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlParsePITarget	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParsePI		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseNotationDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseEntityDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-			xmlParseDefaultDecl	(xmlParserCtxtPtr ctxt,
-						 xmlChar **value);
-XMLPUBFUN xmlEnumerationPtr XMLCALL	
-			xmlParseNotationType	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlEnumerationPtr XMLCALL	
-			xmlParseEnumerationType	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-			xmlParseEnumeratedType	(xmlParserCtxtPtr ctxt,
-						 xmlEnumerationPtr *tree);
-XMLPUBFUN int XMLCALL			
-			xmlParseAttributeType	(xmlParserCtxtPtr ctxt,
-						 xmlEnumerationPtr *tree);
-XMLPUBFUN void XMLCALL			
-			xmlParseAttributeListDecl(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlElementContentPtr XMLCALL	
-			xmlParseElementMixedContentDecl
-						(xmlParserCtxtPtr ctxt,
-						 int inputchk);
-XMLPUBFUN xmlElementContentPtr XMLCALL	
-			xmlParseElementChildrenContentDecl
-						(xmlParserCtxtPtr ctxt,
-						 int inputchk);
-XMLPUBFUN int XMLCALL			
-			xmlParseElementContentDecl(xmlParserCtxtPtr ctxt,
-						 const xmlChar *name,
-						 xmlElementContentPtr *result);
-XMLPUBFUN int XMLCALL			
-			xmlParseElementDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseMarkupDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-			xmlParseCharRef		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlEntityPtr XMLCALL		
-			xmlParseEntityRef	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseReference	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParsePEReference	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseDocTypeDecl	(xmlParserCtxtPtr ctxt);
-#ifdef LIBXML_SAX1_ENABLED
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlParseAttribute	(xmlParserCtxtPtr ctxt,
-						 xmlChar **value);
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlParseStartTag	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseEndTag		(xmlParserCtxtPtr ctxt);
-#endif /* LIBXML_SAX1_ENABLED */
-XMLPUBFUN void XMLCALL			
-			xmlParseCDSect		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseContent		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseElement		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseVersionNum	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseVersionInfo	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseEncName		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN const xmlChar * XMLCALL		
-			xmlParseEncodingDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-			xmlParseSDDecl		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseXMLDecl		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseTextDecl	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseMisc		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-			xmlParseExternalSubset	(xmlParserCtxtPtr ctxt,
-						 const xmlChar *ExternalID,
-						 const xmlChar *SystemID); 
-/**
- * XML_SUBSTITUTE_NONE:
- *
- * If no entities need to be substituted.
- */
-#define XML_SUBSTITUTE_NONE	0
-/**
- * XML_SUBSTITUTE_REF:
- *
- * Whether general entities need to be substituted.
- */
-#define XML_SUBSTITUTE_REF	1
-/**
- * XML_SUBSTITUTE_PEREF:
- *
- * Whether parameter entities need to be substituted.
- */
-#define XML_SUBSTITUTE_PEREF	2
-/**
- * XML_SUBSTITUTE_BOTH:
- *
- * Both general and parameter entities need to be substituted.
- */
-#define XML_SUBSTITUTE_BOTH 	3
-
-XMLPUBFUN xmlChar * XMLCALL
-		xmlStringDecodeEntities		(xmlParserCtxtPtr ctxt,
-						 const xmlChar *str,
-						 int what,
-						 xmlChar end,
-						 xmlChar  end2,
-						 xmlChar end3);
-XMLPUBFUN xmlChar * XMLCALL
-		xmlStringLenDecodeEntities	(xmlParserCtxtPtr ctxt,
-						 const xmlChar *str,
-						 int len,
-						 int what,
-						 xmlChar end,
-						 xmlChar  end2,
-						 xmlChar end3);
-
-/*
- * Generated by MACROS on top of parser.c c.f. PUSH_AND_POP.
- */
-XMLPUBFUN int XMLCALL			nodePush		(xmlParserCtxtPtr ctxt,
-						 xmlNodePtr value);
-XMLPUBFUN xmlNodePtr XMLCALL		nodePop			(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			inputPush		(xmlParserCtxtPtr ctxt,
-						 xmlParserInputPtr value);
-XMLPUBFUN xmlParserInputPtr XMLCALL	inputPop		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN const xmlChar * XMLCALL	namePop			(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			namePush		(xmlParserCtxtPtr ctxt,
-						 const xmlChar *value);
-
-/*
- * other commodities shared between parser.c and parserInternals.
- */
-XMLPUBFUN int XMLCALL			xmlSkipBlankChars	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			xmlStringCurrentChar	(xmlParserCtxtPtr ctxt,
-						 const xmlChar *cur,
-						 int *len);
-XMLPUBFUN void XMLCALL			xmlParserHandlePEReference(xmlParserCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			xmlCheckLanguageID	(const xmlChar *lang);
-
-/*
- * Really core function shared with HTML parser.
- */
-XMLPUBFUN int XMLCALL			xmlCurrentChar		(xmlParserCtxtPtr ctxt,
-						 int *len);
-XMLPUBFUN int XMLCALL		xmlCopyCharMultiByte	(xmlChar *out,
-						 int val);
-XMLPUBFUN int XMLCALL			xmlCopyChar		(int len,
-						 xmlChar *out,
-						 int val);
-XMLPUBFUN void XMLCALL			xmlNextChar		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			xmlParserInputShrink	(xmlParserInputPtr in);
-
-#ifdef LIBXML_HTML_ENABLED
-/*
- * Actually comes from the HTML parser but launched from the init stuff.
- */
-XMLPUBFUN void XMLCALL			htmlInitAutoClose	(void);
-XMLPUBFUN htmlParserCtxtPtr XMLCALL	htmlCreateFileParserCtxt(const char *filename,
-	                                         const char *encoding);
-#endif
-
-/*
- * Specific function to keep track of entities references
- * and used by the XSLT debugger.
- */
-#ifdef LIBXML_LEGACY_ENABLED
-/**
- * xmlEntityReferenceFunc:
- * @ent: the entity
- * @firstNode:  the fist node in the chunk
- * @lastNode:  the last nod in the chunk
- *
- * Callback function used when one needs to be able to track back the
- * provenance of a chunk of nodes inherited from an entity replacement.
- */
-typedef	void	(*xmlEntityReferenceFunc)	(xmlEntityPtr ent,
-						 xmlNodePtr firstNode,
-						 xmlNodePtr lastNode);
-  
-XMLPUBFUN void XMLCALL		xmlSetEntityReferenceFunc	(xmlEntityReferenceFunc func);
-
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlParseQuotedString	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL
-                        xmlParseNamespace       (xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlNamespaceParseNSDef	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlScanName		(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlNamespaceParseNCName	(xmlParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL	xmlParserHandleReference(xmlParserCtxtPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL		
-			xmlNamespaceParseQName	(xmlParserCtxtPtr ctxt,
-						 xmlChar **prefix);
-/**
- * Entities
- */
-XMLPUBFUN xmlChar * XMLCALL
-		xmlDecodeEntities		(xmlParserCtxtPtr ctxt,
-						 int len,
-						 int what,
-						 xmlChar end,
-						 xmlChar  end2,
-						 xmlChar end3);
-XMLPUBFUN void XMLCALL			
-			xmlHandleEntity		(xmlParserCtxtPtr ctxt,
-						 xmlEntityPtr entity);
-
-#endif /* LIBXML_LEGACY_ENABLED */
-
-#ifdef IN_LIBXML
-/*
- * internal only
- */
-XMLPUBFUN void XMLCALL
-	xmlErrMemory		(xmlParserCtxtPtr ctxt,
-				 const char *extra);
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_PARSER_INTERNALS_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/pattern.h igraph-0.6.5/msvc/include/libxml/pattern.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/pattern.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/pattern.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,100 +0,0 @@
-/*
- * Summary: pattern expression handling
- * Description: allows to compile and test pattern expressions for nodes
- *              either in a tree or based on a parser state.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_PATTERN_H__
-#define __XML_PATTERN_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/dict.h>
-
-#ifdef LIBXML_PATTERN_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlPattern:
- *
- * A compiled (XPath based) pattern to select nodes
- */
-typedef struct _xmlPattern xmlPattern;
-typedef xmlPattern *xmlPatternPtr;
-
-/**
- * xmlPatternFlags:
- *
- * This is the set of options affecting the behaviour of pattern
- * matching with this module
- *
- */
-typedef enum {
-    XML_PATTERN_DEFAULT		= 0,	/* simple pattern match */
-    XML_PATTERN_XPATH		= 1<<0,	/* standard XPath pattern */
-    XML_PATTERN_XSSEL		= 1<<1,	/* XPath subset for schema selector */
-    XML_PATTERN_XSFIELD		= 1<<2	/* XPath subset for schema field */
-} xmlPatternFlags;
-
-XMLPUBFUN void XMLCALL
-			xmlFreePattern		(xmlPatternPtr comp);
-
-XMLPUBFUN void XMLCALL
-			xmlFreePatternList	(xmlPatternPtr comp);
-
-XMLPUBFUN xmlPatternPtr XMLCALL
-			xmlPatterncompile	(const xmlChar *pattern,
-						 xmlDict *dict,
-						 int flags,
-						 const xmlChar **namespaces);
-XMLPUBFUN int XMLCALL
-			xmlPatternMatch		(xmlPatternPtr comp,
-						 xmlNodePtr node);
-
-/* streaming interfaces */
-typedef struct _xmlStreamCtxt xmlStreamCtxt;
-typedef xmlStreamCtxt *xmlStreamCtxtPtr;
-
-XMLPUBFUN int XMLCALL
-			xmlPatternStreamable	(xmlPatternPtr comp);
-XMLPUBFUN int XMLCALL
-			xmlPatternMaxDepth	(xmlPatternPtr comp);
-XMLPUBFUN int XMLCALL
-			xmlPatternMinDepth	(xmlPatternPtr comp);
-XMLPUBFUN int XMLCALL
-			xmlPatternFromRoot	(xmlPatternPtr comp);
-XMLPUBFUN xmlStreamCtxtPtr XMLCALL
-			xmlPatternGetStreamCtxt	(xmlPatternPtr comp);
-XMLPUBFUN void XMLCALL
-			xmlFreeStreamCtxt	(xmlStreamCtxtPtr stream);
-XMLPUBFUN int XMLCALL
-			xmlStreamPushNode	(xmlStreamCtxtPtr stream,
-						 const xmlChar *name,
-						 const xmlChar *ns,
-						 int nodeType);
-XMLPUBFUN int XMLCALL
-			xmlStreamPush		(xmlStreamCtxtPtr stream,
-						 const xmlChar *name,
-						 const xmlChar *ns);
-XMLPUBFUN int XMLCALL
-			xmlStreamPushAttr	(xmlStreamCtxtPtr stream,
-						 const xmlChar *name,
-						 const xmlChar *ns);
-XMLPUBFUN int XMLCALL
-			xmlStreamPop		(xmlStreamCtxtPtr stream);
-XMLPUBFUN int XMLCALL
-			xmlStreamWantsAnyNode	(xmlStreamCtxtPtr stream);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_PATTERN_ENABLED */
-
-#endif /* __XML_PATTERN_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/relaxng.h igraph-0.6.5/msvc/include/libxml/relaxng.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/relaxng.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/relaxng.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,213 +0,0 @@
-/*
- * Summary: implementation of the Relax-NG validation
- * Description: implementation of the Relax-NG validation
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_RELAX_NG__
-#define __XML_RELAX_NG__
-
-#include <libxml/xmlversion.h>
-#include <libxml/hash.h>
-#include <libxml/xmlstring.h>
-
-#ifdef LIBXML_SCHEMAS_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct _xmlRelaxNG xmlRelaxNG;
-typedef xmlRelaxNG *xmlRelaxNGPtr;
-
-
-/**
- * xmlRelaxNGValidityErrorFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of an error callback from a Relax-NG validation
- */
-typedef void (XMLCDECL *xmlRelaxNGValidityErrorFunc) (void *ctx, const char *msg, ...);
-
-/**
- * xmlRelaxNGValidityWarningFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of a warning callback from a Relax-NG validation
- */
-typedef void (XMLCDECL *xmlRelaxNGValidityWarningFunc) (void *ctx, const char *msg, ...);
-
-/**
- * A schemas validation context
- */
-typedef struct _xmlRelaxNGParserCtxt xmlRelaxNGParserCtxt;
-typedef xmlRelaxNGParserCtxt *xmlRelaxNGParserCtxtPtr;
-
-typedef struct _xmlRelaxNGValidCtxt xmlRelaxNGValidCtxt;
-typedef xmlRelaxNGValidCtxt *xmlRelaxNGValidCtxtPtr;
-
-/*
- * xmlRelaxNGValidErr:
- *
- * List of possible Relax NG validation errors
- */
-typedef enum {
-    XML_RELAXNG_OK = 0,
-    XML_RELAXNG_ERR_MEMORY,
-    XML_RELAXNG_ERR_TYPE,
-    XML_RELAXNG_ERR_TYPEVAL,
-    XML_RELAXNG_ERR_DUPID,
-    XML_RELAXNG_ERR_TYPECMP,
-    XML_RELAXNG_ERR_NOSTATE,
-    XML_RELAXNG_ERR_NODEFINE,
-    XML_RELAXNG_ERR_LISTEXTRA,
-    XML_RELAXNG_ERR_LISTEMPTY,
-    XML_RELAXNG_ERR_INTERNODATA,
-    XML_RELAXNG_ERR_INTERSEQ,
-    XML_RELAXNG_ERR_INTEREXTRA,
-    XML_RELAXNG_ERR_ELEMNAME,
-    XML_RELAXNG_ERR_ATTRNAME,
-    XML_RELAXNG_ERR_ELEMNONS,
-    XML_RELAXNG_ERR_ATTRNONS,
-    XML_RELAXNG_ERR_ELEMWRONGNS,
-    XML_RELAXNG_ERR_ATTRWRONGNS,
-    XML_RELAXNG_ERR_ELEMEXTRANS,
-    XML_RELAXNG_ERR_ATTREXTRANS,
-    XML_RELAXNG_ERR_ELEMNOTEMPTY,
-    XML_RELAXNG_ERR_NOELEM,
-    XML_RELAXNG_ERR_NOTELEM,
-    XML_RELAXNG_ERR_ATTRVALID,
-    XML_RELAXNG_ERR_CONTENTVALID,
-    XML_RELAXNG_ERR_EXTRACONTENT,
-    XML_RELAXNG_ERR_INVALIDATTR,
-    XML_RELAXNG_ERR_DATAELEM,
-    XML_RELAXNG_ERR_VALELEM,
-    XML_RELAXNG_ERR_LISTELEM,
-    XML_RELAXNG_ERR_DATATYPE,
-    XML_RELAXNG_ERR_VALUE,
-    XML_RELAXNG_ERR_LIST,
-    XML_RELAXNG_ERR_NOGRAMMAR,
-    XML_RELAXNG_ERR_EXTRADATA,
-    XML_RELAXNG_ERR_LACKDATA,
-    XML_RELAXNG_ERR_INTERNAL,
-    XML_RELAXNG_ERR_ELEMWRONG,
-    XML_RELAXNG_ERR_TEXTWRONG
-} xmlRelaxNGValidErr;
-
-/*
- * xmlRelaxNGParserFlags:
- *
- * List of possible Relax NG Parser flags
- */
-typedef enum {
-    XML_RELAXNGP_NONE = 0,
-    XML_RELAXNGP_FREE_DOC = 1,
-    XML_RELAXNGP_CRNG = 2
-} xmlRelaxNGParserFlag;
-
-XMLPUBFUN int XMLCALL
-		    xmlRelaxNGInitTypes		(void);
-XMLPUBFUN void XMLCALL			
-		    xmlRelaxNGCleanupTypes	(void);
-
-/*
- * Interfaces for parsing.
- */
-XMLPUBFUN xmlRelaxNGParserCtxtPtr XMLCALL 
-		    xmlRelaxNGNewParserCtxt	(const char *URL);
-XMLPUBFUN xmlRelaxNGParserCtxtPtr XMLCALL 
-		    xmlRelaxNGNewMemParserCtxt	(const char *buffer,
-						 int size);
-XMLPUBFUN xmlRelaxNGParserCtxtPtr XMLCALL   
-		    xmlRelaxNGNewDocParserCtxt	(xmlDocPtr doc);
-
-XMLPUBFUN int XMLCALL
-		    xmlRelaxParserSetFlag	(xmlRelaxNGParserCtxtPtr ctxt,
-		    				 int flag);
-
-XMLPUBFUN void XMLCALL		
-		    xmlRelaxNGFreeParserCtxt	(xmlRelaxNGParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL			
-		    xmlRelaxNGSetParserErrors(xmlRelaxNGParserCtxtPtr ctxt,
-					 xmlRelaxNGValidityErrorFunc err,
-					 xmlRelaxNGValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN int XMLCALL
-		    xmlRelaxNGGetParserErrors(xmlRelaxNGParserCtxtPtr ctxt,
-					 xmlRelaxNGValidityErrorFunc *err,
-					 xmlRelaxNGValidityWarningFunc *warn,
-					 void **ctx);
-XMLPUBFUN void XMLCALL
-		    xmlRelaxNGSetParserStructuredErrors(
-					 xmlRelaxNGParserCtxtPtr ctxt,
-					 xmlStructuredErrorFunc serror,
-					 void *ctx);
-XMLPUBFUN xmlRelaxNGPtr XMLCALL	
-		    xmlRelaxNGParse		(xmlRelaxNGParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL		
-		    xmlRelaxNGFree		(xmlRelaxNGPtr schema);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		
-		    xmlRelaxNGDump		(FILE *output,
-					 xmlRelaxNGPtr schema);
-XMLPUBFUN void XMLCALL
-		    xmlRelaxNGDumpTree	(FILE * output,
-					 xmlRelaxNGPtr schema);
-#endif /* LIBXML_OUTPUT_ENABLED */
-/*
- * Interfaces for validating
- */
-XMLPUBFUN void XMLCALL		
-		    xmlRelaxNGSetValidErrors(xmlRelaxNGValidCtxtPtr ctxt,
-					 xmlRelaxNGValidityErrorFunc err,
-					 xmlRelaxNGValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN int XMLCALL	
-		    xmlRelaxNGGetValidErrors(xmlRelaxNGValidCtxtPtr ctxt,
-					 xmlRelaxNGValidityErrorFunc *err,
-					 xmlRelaxNGValidityWarningFunc *warn,
-					 void **ctx);
-XMLPUBFUN void XMLCALL
-			xmlRelaxNGSetValidStructuredErrors(xmlRelaxNGValidCtxtPtr ctxt,
-					  xmlStructuredErrorFunc serror, void *ctx);
-XMLPUBFUN xmlRelaxNGValidCtxtPtr XMLCALL	
-		    xmlRelaxNGNewValidCtxt	(xmlRelaxNGPtr schema);
-XMLPUBFUN void XMLCALL			
-		    xmlRelaxNGFreeValidCtxt	(xmlRelaxNGValidCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-		    xmlRelaxNGValidateDoc	(xmlRelaxNGValidCtxtPtr ctxt,
-					 	 xmlDocPtr doc);
-/*
- * Interfaces for progressive validation when possible
- */
-XMLPUBFUN int XMLCALL	
-		    xmlRelaxNGValidatePushElement	(xmlRelaxNGValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem);
-XMLPUBFUN int XMLCALL	
-		    xmlRelaxNGValidatePushCData	(xmlRelaxNGValidCtxtPtr ctxt,
-					 const xmlChar *data,
-					 int len);
-XMLPUBFUN int XMLCALL	
-		    xmlRelaxNGValidatePopElement	(xmlRelaxNGValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem);
-XMLPUBFUN int XMLCALL	
-		    xmlRelaxNGValidateFullElement	(xmlRelaxNGValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_SCHEMAS_ENABLED */
-
-#endif /* __XML_RELAX_NG__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/schemasInternals.h igraph-0.6.5/msvc/include/libxml/schemasInternals.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/schemasInternals.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/schemasInternals.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,958 +0,0 @@
-/*
- * Summary: internal interfaces for XML Schemas
- * Description: internal interfaces for the XML Schemas handling
- *              and schema validity checking
- *		The Schemas development is a Work In Progress.
- *              Some of those interfaces are not garanteed to be API or ABI stable !
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SCHEMA_INTERNALS_H__
-#define __XML_SCHEMA_INTERNALS_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_SCHEMAS_ENABLED
-
-#include <libxml/xmlregexp.h>
-#include <libxml/hash.h>
-#include <libxml/dict.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef enum {
-    XML_SCHEMAS_UNKNOWN = 0,
-    XML_SCHEMAS_STRING,
-    XML_SCHEMAS_NORMSTRING,
-    XML_SCHEMAS_DECIMAL,
-    XML_SCHEMAS_TIME,
-    XML_SCHEMAS_GDAY,
-    XML_SCHEMAS_GMONTH,
-    XML_SCHEMAS_GMONTHDAY,
-    XML_SCHEMAS_GYEAR,
-    XML_SCHEMAS_GYEARMONTH,
-    XML_SCHEMAS_DATE,
-    XML_SCHEMAS_DATETIME,
-    XML_SCHEMAS_DURATION,
-    XML_SCHEMAS_FLOAT,
-    XML_SCHEMAS_DOUBLE,
-    XML_SCHEMAS_BOOLEAN,
-    XML_SCHEMAS_TOKEN,
-    XML_SCHEMAS_LANGUAGE,
-    XML_SCHEMAS_NMTOKEN,
-    XML_SCHEMAS_NMTOKENS,
-    XML_SCHEMAS_NAME,
-    XML_SCHEMAS_QNAME,
-    XML_SCHEMAS_NCNAME,
-    XML_SCHEMAS_ID,
-    XML_SCHEMAS_IDREF,
-    XML_SCHEMAS_IDREFS,
-    XML_SCHEMAS_ENTITY,
-    XML_SCHEMAS_ENTITIES,
-    XML_SCHEMAS_NOTATION,
-    XML_SCHEMAS_ANYURI,
-    XML_SCHEMAS_INTEGER,
-    XML_SCHEMAS_NPINTEGER,
-    XML_SCHEMAS_NINTEGER,
-    XML_SCHEMAS_NNINTEGER,
-    XML_SCHEMAS_PINTEGER,
-    XML_SCHEMAS_INT,
-    XML_SCHEMAS_UINT,
-    XML_SCHEMAS_LONG,
-    XML_SCHEMAS_ULONG,
-    XML_SCHEMAS_SHORT,
-    XML_SCHEMAS_USHORT,
-    XML_SCHEMAS_BYTE,
-    XML_SCHEMAS_UBYTE,
-    XML_SCHEMAS_HEXBINARY,
-    XML_SCHEMAS_BASE64BINARY,
-    XML_SCHEMAS_ANYTYPE,
-    XML_SCHEMAS_ANYSIMPLETYPE
-} xmlSchemaValType;
-
-/*
- * XML Schemas defines multiple type of types.
- */
-typedef enum {
-    XML_SCHEMA_TYPE_BASIC = 1, /* A built-in datatype */
-    XML_SCHEMA_TYPE_ANY,
-    XML_SCHEMA_TYPE_FACET,
-    XML_SCHEMA_TYPE_SIMPLE,
-    XML_SCHEMA_TYPE_COMPLEX,
-    XML_SCHEMA_TYPE_SEQUENCE = 6,
-    XML_SCHEMA_TYPE_CHOICE,
-    XML_SCHEMA_TYPE_ALL,
-    XML_SCHEMA_TYPE_SIMPLE_CONTENT,
-    XML_SCHEMA_TYPE_COMPLEX_CONTENT,
-    XML_SCHEMA_TYPE_UR,
-    XML_SCHEMA_TYPE_RESTRICTION,
-    XML_SCHEMA_TYPE_EXTENSION,
-    XML_SCHEMA_TYPE_ELEMENT,
-    XML_SCHEMA_TYPE_ATTRIBUTE,
-    XML_SCHEMA_TYPE_ATTRIBUTEGROUP,
-    XML_SCHEMA_TYPE_GROUP,
-    XML_SCHEMA_TYPE_NOTATION,
-    XML_SCHEMA_TYPE_LIST,
-    XML_SCHEMA_TYPE_UNION,
-    XML_SCHEMA_TYPE_ANY_ATTRIBUTE,
-    XML_SCHEMA_TYPE_IDC_UNIQUE,
-    XML_SCHEMA_TYPE_IDC_KEY,
-    XML_SCHEMA_TYPE_IDC_KEYREF,
-    XML_SCHEMA_TYPE_PARTICLE = 25, 
-    XML_SCHEMA_TYPE_ATTRIBUTE_USE, 
-    XML_SCHEMA_FACET_MININCLUSIVE = 1000,
-    XML_SCHEMA_FACET_MINEXCLUSIVE,
-    XML_SCHEMA_FACET_MAXINCLUSIVE,
-    XML_SCHEMA_FACET_MAXEXCLUSIVE,
-    XML_SCHEMA_FACET_TOTALDIGITS,
-    XML_SCHEMA_FACET_FRACTIONDIGITS,
-    XML_SCHEMA_FACET_PATTERN,
-    XML_SCHEMA_FACET_ENUMERATION,
-    XML_SCHEMA_FACET_WHITESPACE,
-    XML_SCHEMA_FACET_LENGTH,
-    XML_SCHEMA_FACET_MAXLENGTH,
-    XML_SCHEMA_FACET_MINLENGTH,
-    XML_SCHEMA_EXTRA_QNAMEREF = 2000,
-    XML_SCHEMA_EXTRA_ATTR_USE_PROHIB
-} xmlSchemaTypeType;
-
-typedef enum {
-    XML_SCHEMA_CONTENT_UNKNOWN = 0,
-    XML_SCHEMA_CONTENT_EMPTY = 1,
-    XML_SCHEMA_CONTENT_ELEMENTS,
-    XML_SCHEMA_CONTENT_MIXED,
-    XML_SCHEMA_CONTENT_SIMPLE,
-    XML_SCHEMA_CONTENT_MIXED_OR_ELEMENTS, /* Obsolete */
-    XML_SCHEMA_CONTENT_BASIC,
-    XML_SCHEMA_CONTENT_ANY
-} xmlSchemaContentType;
-
-typedef struct _xmlSchemaVal xmlSchemaVal;
-typedef xmlSchemaVal *xmlSchemaValPtr;
-
-typedef struct _xmlSchemaType xmlSchemaType;
-typedef xmlSchemaType *xmlSchemaTypePtr;
-
-typedef struct _xmlSchemaFacet xmlSchemaFacet;
-typedef xmlSchemaFacet *xmlSchemaFacetPtr;
-
-/**
- * Annotation
- */
-typedef struct _xmlSchemaAnnot xmlSchemaAnnot;
-typedef xmlSchemaAnnot *xmlSchemaAnnotPtr;
-struct _xmlSchemaAnnot {
-    struct _xmlSchemaAnnot *next;
-    xmlNodePtr content;         /* the annotation */
-};
-
-/**
- * XML_SCHEMAS_ANYATTR_SKIP:
- *
- * Skip unknown attribute from validation
- * Obsolete, not used anymore.
- */
-#define XML_SCHEMAS_ANYATTR_SKIP        1
-/**
- * XML_SCHEMAS_ANYATTR_LAX:
- *
- * Ignore validation non definition on attributes
- * Obsolete, not used anymore.
- */
-#define XML_SCHEMAS_ANYATTR_LAX                2
-/**
- * XML_SCHEMAS_ANYATTR_STRICT:
- *
- * Apply strict validation rules on attributes
- * Obsolete, not used anymore.
- */
-#define XML_SCHEMAS_ANYATTR_STRICT        3
-/**
- * XML_SCHEMAS_ANY_SKIP:
- *
- * Skip unknown attribute from validation
- */
-#define XML_SCHEMAS_ANY_SKIP        1
-/**
- * XML_SCHEMAS_ANY_LAX:
- *
- * Used by wildcards.
- * Validate if type found, don't worry if not found
- */
-#define XML_SCHEMAS_ANY_LAX                2
-/**
- * XML_SCHEMAS_ANY_STRICT:
- *
- * Used by wildcards.
- * Apply strict validation rules
- */
-#define XML_SCHEMAS_ANY_STRICT        3
-/**
- * XML_SCHEMAS_ATTR_USE_PROHIBITED:
- *
- * Used by wildcards.
- * The attribute is prohibited.
- */
-#define XML_SCHEMAS_ATTR_USE_PROHIBITED 0
-/**
- * XML_SCHEMAS_ATTR_USE_REQUIRED:
- *
- * The attribute is required.
- */
-#define XML_SCHEMAS_ATTR_USE_REQUIRED 1
-/**
- * XML_SCHEMAS_ATTR_USE_OPTIONAL:
- *
- * The attribute is optional.
- */
-#define XML_SCHEMAS_ATTR_USE_OPTIONAL 2
-/**
- * XML_SCHEMAS_ATTR_GLOBAL:
- *
- * allow elements in no namespace
- */
-#define XML_SCHEMAS_ATTR_GLOBAL        1 << 0
-/**
- * XML_SCHEMAS_ATTR_NSDEFAULT:
- *
- * allow elements in no namespace
- */
-#define XML_SCHEMAS_ATTR_NSDEFAULT        1 << 7
-/**
- * XML_SCHEMAS_ATTR_INTERNAL_RESOLVED:
- *
- * this is set when the "type" and "ref" references
- * have been resolved.
- */
-#define XML_SCHEMAS_ATTR_INTERNAL_RESOLVED        1 << 8
-/**
- * XML_SCHEMAS_ATTR_FIXED:
- *
- * the attribute has a fixed value
- */
-#define XML_SCHEMAS_ATTR_FIXED        1 << 9
-
-/**
- * xmlSchemaAttribute:
- * An attribute definition.
- */
-
-typedef struct _xmlSchemaAttribute xmlSchemaAttribute;
-typedef xmlSchemaAttribute *xmlSchemaAttributePtr;
-struct _xmlSchemaAttribute {
-    xmlSchemaTypeType type;
-    struct _xmlSchemaAttribute *next; /* the next attribute (not used?) */
-    const xmlChar *name; /* the name of the declaration */
-    const xmlChar *id; /* Deprecated; not used */
-    const xmlChar *ref; /* Deprecated; not used */
-    const xmlChar *refNs; /* Deprecated; not used */
-    const xmlChar *typeName; /* the local name of the type definition */
-    const xmlChar *typeNs; /* the ns URI of the type definition */
-    xmlSchemaAnnotPtr annot;
-
-    xmlSchemaTypePtr base; /* Deprecated; not used */
-    int occurs; /* Deprecated; not used */
-    const xmlChar *defValue; /* The initial value of the value constraint */
-    xmlSchemaTypePtr subtypes; /* the type definition */
-    xmlNodePtr node;
-    const xmlChar *targetNamespace;
-    int flags;
-    const xmlChar *refPrefix; /* Deprecated; not used */
-    xmlSchemaValPtr defVal; /* The compiled value constraint */
-    xmlSchemaAttributePtr refDecl; /* Deprecated; not used */
-};
-
-/**
- * xmlSchemaAttributeLink:
- * Used to build a list of attribute uses on complexType definitions.
- * WARNING: Deprecated; not used.
- */
-typedef struct _xmlSchemaAttributeLink xmlSchemaAttributeLink;
-typedef xmlSchemaAttributeLink *xmlSchemaAttributeLinkPtr;
-struct _xmlSchemaAttributeLink {
-    struct _xmlSchemaAttributeLink *next;/* the next attribute link ... */
-    struct _xmlSchemaAttribute *attr;/* the linked attribute */
-};
-
-/**
- * XML_SCHEMAS_WILDCARD_COMPLETE:
- *
- * If the wildcard is complete.
- */
-#define XML_SCHEMAS_WILDCARD_COMPLETE 1 << 0
-
-/**
- * xmlSchemaCharValueLink:
- * Used to build a list of namespaces on wildcards.
- */
-typedef struct _xmlSchemaWildcardNs xmlSchemaWildcardNs;
-typedef xmlSchemaWildcardNs *xmlSchemaWildcardNsPtr;
-struct _xmlSchemaWildcardNs {
-    struct _xmlSchemaWildcardNs *next;/* the next constraint link ... */
-    const xmlChar *value;/* the value */
-};
-
-/**
- * xmlSchemaWildcard.
- * A wildcard.
- */
-typedef struct _xmlSchemaWildcard xmlSchemaWildcard;
-typedef xmlSchemaWildcard *xmlSchemaWildcardPtr;
-struct _xmlSchemaWildcard {
-    xmlSchemaTypeType type;        /* The kind of type */
-    const xmlChar *id; /* Deprecated; not used */
-    xmlSchemaAnnotPtr annot;
-    xmlNodePtr node;
-    int minOccurs; /* Deprecated; not used */
-    int maxOccurs; /* Deprecated; not used */
-    int processContents;
-    int any; /* Indicates if the ns constraint is of ##any */
-    xmlSchemaWildcardNsPtr nsSet; /* The list of allowed namespaces */
-    xmlSchemaWildcardNsPtr negNsSet; /* The negated namespace */
-    int flags;
-};
-
-/**
- * XML_SCHEMAS_ATTRGROUP_WILDCARD_BUILDED:
- *
- * The attribute wildcard has been already builded.
- */
-#define XML_SCHEMAS_ATTRGROUP_WILDCARD_BUILDED 1 << 0
-/**
- * XML_SCHEMAS_ATTRGROUP_GLOBAL:
- *
- * The attribute wildcard has been already builded.
- */
-#define XML_SCHEMAS_ATTRGROUP_GLOBAL 1 << 1
-/**
- * XML_SCHEMAS_ATTRGROUP_MARKED:
- *
- * Marks the attr group as marked; used for circular checks.
- */
-#define XML_SCHEMAS_ATTRGROUP_MARKED 1 << 2
-
-/**
- * XML_SCHEMAS_ATTRGROUP_REDEFINED:
- *
- * The attr group was redefined.
- */
-#define XML_SCHEMAS_ATTRGROUP_REDEFINED 1 << 3
-/**
- * XML_SCHEMAS_ATTRGROUP_HAS_REFS:
- *
- * Whether this attr. group contains attr. group references.
- */
-#define XML_SCHEMAS_ATTRGROUP_HAS_REFS 1 << 4
-
-/**
- * An attribute group definition.
- *
- * xmlSchemaAttribute and xmlSchemaAttributeGroup start of structures
- * must be kept similar
- */
-typedef struct _xmlSchemaAttributeGroup xmlSchemaAttributeGroup;
-typedef xmlSchemaAttributeGroup *xmlSchemaAttributeGroupPtr;
-struct _xmlSchemaAttributeGroup {
-    xmlSchemaTypeType type;        /* The kind of type */
-    struct _xmlSchemaAttribute *next;/* the next attribute if in a group ... */
-    const xmlChar *name;
-    const xmlChar *id;
-    const xmlChar *ref; /* Deprecated; not used */
-    const xmlChar *refNs; /* Deprecated; not used */
-    xmlSchemaAnnotPtr annot;
-
-    xmlSchemaAttributePtr attributes; /* Deprecated; not used */
-    xmlNodePtr node;
-    int flags;
-    xmlSchemaWildcardPtr attributeWildcard;
-    const xmlChar *refPrefix; /* Deprecated; not used */
-    xmlSchemaAttributeGroupPtr refItem; /* Deprecated; not used */
-    const xmlChar *targetNamespace;
-    void *attrUses;
-};
-
-/**
- * xmlSchemaTypeLink:
- * Used to build a list of types (e.g. member types of
- * simpleType with variety "union").
- */
-typedef struct _xmlSchemaTypeLink xmlSchemaTypeLink;
-typedef xmlSchemaTypeLink *xmlSchemaTypeLinkPtr;
-struct _xmlSchemaTypeLink {
-    struct _xmlSchemaTypeLink *next;/* the next type link ... */
-    xmlSchemaTypePtr type;/* the linked type */
-};
-
-/**
- * xmlSchemaFacetLink:
- * Used to build a list of facets.
- */
-typedef struct _xmlSchemaFacetLink xmlSchemaFacetLink;
-typedef xmlSchemaFacetLink *xmlSchemaFacetLinkPtr;
-struct _xmlSchemaFacetLink {
-    struct _xmlSchemaFacetLink *next;/* the next facet link ... */
-    xmlSchemaFacetPtr facet;/* the linked facet */
-};
-
-/**
- * XML_SCHEMAS_TYPE_MIXED:
- *
- * the element content type is mixed
- */
-#define XML_SCHEMAS_TYPE_MIXED                1 << 0
-/**
- * XML_SCHEMAS_TYPE_DERIVATION_METHOD_EXTENSION:
- *
- * the simple or complex type has a derivation method of "extension".
- */
-#define XML_SCHEMAS_TYPE_DERIVATION_METHOD_EXTENSION                1 << 1
-/**
- * XML_SCHEMAS_TYPE_DERIVATION_METHOD_RESTRICTION:
- *
- * the simple or complex type has a derivation method of "restriction".
- */
-#define XML_SCHEMAS_TYPE_DERIVATION_METHOD_RESTRICTION                1 << 2
-/**
- * XML_SCHEMAS_TYPE_GLOBAL:
- *
- * the type is global
- */
-#define XML_SCHEMAS_TYPE_GLOBAL                1 << 3
-/**
- * XML_SCHEMAS_TYPE_OWNED_ATTR_WILDCARD:
- *
- * the complexType owns an attribute wildcard, i.e.
- * it can be freed by the complexType
- */
-#define XML_SCHEMAS_TYPE_OWNED_ATTR_WILDCARD    1 << 4 /* Obsolete. */
-/**
- * XML_SCHEMAS_TYPE_VARIETY_ABSENT:
- *
- * the simpleType has a variety of "absent".
- * TODO: Actually not necessary :-/, since if
- * none of the variety flags occur then it's
- * automatically absent.
- */
-#define XML_SCHEMAS_TYPE_VARIETY_ABSENT    1 << 5
-/**
- * XML_SCHEMAS_TYPE_VARIETY_LIST:
- *
- * the simpleType has a variety of "list".
- */
-#define XML_SCHEMAS_TYPE_VARIETY_LIST    1 << 6
-/**
- * XML_SCHEMAS_TYPE_VARIETY_UNION:
- *
- * the simpleType has a variety of "union".
- */
-#define XML_SCHEMAS_TYPE_VARIETY_UNION    1 << 7
-/**
- * XML_SCHEMAS_TYPE_VARIETY_ATOMIC:
- *
- * the simpleType has a variety of "union".
- */
-#define XML_SCHEMAS_TYPE_VARIETY_ATOMIC    1 << 8
-/**
- * XML_SCHEMAS_TYPE_FINAL_EXTENSION:
- *
- * the complexType has a final of "extension".
- */
-#define XML_SCHEMAS_TYPE_FINAL_EXTENSION    1 << 9
-/**
- * XML_SCHEMAS_TYPE_FINAL_RESTRICTION:
- *
- * the simpleType/complexType has a final of "restriction".
- */
-#define XML_SCHEMAS_TYPE_FINAL_RESTRICTION    1 << 10
-/**
- * XML_SCHEMAS_TYPE_FINAL_LIST:
- *
- * the simpleType has a final of "list".
- */
-#define XML_SCHEMAS_TYPE_FINAL_LIST    1 << 11
-/**
- * XML_SCHEMAS_TYPE_FINAL_UNION:
- *
- * the simpleType has a final of "union".
- */
-#define XML_SCHEMAS_TYPE_FINAL_UNION    1 << 12
-/**
- * XML_SCHEMAS_TYPE_FINAL_DEFAULT:
- *
- * the simpleType has a final of "default".
- */
-#define XML_SCHEMAS_TYPE_FINAL_DEFAULT    1 << 13
-/**
- * XML_SCHEMAS_TYPE_BUILTIN_PRIMITIVE:
- *
- * Marks the item as a builtin primitive.
- */
-#define XML_SCHEMAS_TYPE_BUILTIN_PRIMITIVE    1 << 14
-/**
- * XML_SCHEMAS_TYPE_MARKED:
- *
- * Marks the item as marked; used for circular checks.
- */
-#define XML_SCHEMAS_TYPE_MARKED        1 << 16
-/**
- * XML_SCHEMAS_TYPE_BLOCK_DEFAULT:
- *
- * the complexType did not specify 'block' so use the default of the
- * <schema> item.
- */
-#define XML_SCHEMAS_TYPE_BLOCK_DEFAULT    1 << 17
-/**
- * XML_SCHEMAS_TYPE_BLOCK_EXTENSION:
- *
- * the complexType has a 'block' of "extension".
- */
-#define XML_SCHEMAS_TYPE_BLOCK_EXTENSION    1 << 18
-/**
- * XML_SCHEMAS_TYPE_BLOCK_RESTRICTION:
- *
- * the complexType has a 'block' of "restriction".
- */
-#define XML_SCHEMAS_TYPE_BLOCK_RESTRICTION    1 << 19
-/**
- * XML_SCHEMAS_TYPE_ABSTRACT:
- *
- * the simple/complexType is abstract.
- */
-#define XML_SCHEMAS_TYPE_ABSTRACT    1 << 20
-/**
- * XML_SCHEMAS_TYPE_FACETSNEEDVALUE:
- *
- * indicates if the facets need a computed value
- */
-#define XML_SCHEMAS_TYPE_FACETSNEEDVALUE    1 << 21
-/**
- * XML_SCHEMAS_TYPE_INTERNAL_RESOLVED:
- *
- * indicates that the type was typefixed
- */
-#define XML_SCHEMAS_TYPE_INTERNAL_RESOLVED    1 << 22
-/**
- * XML_SCHEMAS_TYPE_INTERNAL_INVALID:
- *
- * indicates that the type is invalid
- */
-#define XML_SCHEMAS_TYPE_INTERNAL_INVALID    1 << 23
-/**
- * XML_SCHEMAS_TYPE_WHITESPACE_PRESERVE:
- *
- * a whitespace-facet value of "preserve"
- */
-#define XML_SCHEMAS_TYPE_WHITESPACE_PRESERVE    1 << 24
-/**
- * XML_SCHEMAS_TYPE_WHITESPACE_REPLACE:
- *
- * a whitespace-facet value of "replace"
- */
-#define XML_SCHEMAS_TYPE_WHITESPACE_REPLACE    1 << 25
-/**
- * XML_SCHEMAS_TYPE_WHITESPACE_COLLAPSE:
- *
- * a whitespace-facet value of "collapse"
- */
-#define XML_SCHEMAS_TYPE_WHITESPACE_COLLAPSE    1 << 26
-/**
- * XML_SCHEMAS_TYPE_HAS_FACETS:
- *
- * has facets
- */
-#define XML_SCHEMAS_TYPE_HAS_FACETS    1 << 27
-/**
- * XML_SCHEMAS_TYPE_NORMVALUENEEDED:
- *
- * indicates if the facets (pattern) need a normalized value
- */
-#define XML_SCHEMAS_TYPE_NORMVALUENEEDED    1 << 28
-
-/**
- * XML_SCHEMAS_TYPE_FIXUP_1:
- *
- * First stage of fixup was done.
- */
-#define XML_SCHEMAS_TYPE_FIXUP_1    1 << 29
-
-/**
- * XML_SCHEMAS_TYPE_REDEFINED:
- *
- * The type was redefined.
- */
-#define XML_SCHEMAS_TYPE_REDEFINED    1 << 30
-/**
- * XML_SCHEMAS_TYPE_REDEFINING:
- *
- * The type redefines an other type.
- */
-/* #define XML_SCHEMAS_TYPE_REDEFINING    1 << 31 */
-
-/**
- * _xmlSchemaType:
- *
- * Schemas type definition.
- */
-struct _xmlSchemaType {
-    xmlSchemaTypeType type; /* The kind of type */
-    struct _xmlSchemaType *next; /* the next type if in a sequence ... */
-    const xmlChar *name;
-    const xmlChar *id ; /* Deprecated; not used */
-    const xmlChar *ref; /* Deprecated; not used */
-    const xmlChar *refNs; /* Deprecated; not used */
-    xmlSchemaAnnotPtr annot;
-    xmlSchemaTypePtr subtypes;
-    xmlSchemaAttributePtr attributes; /* Deprecated; not used */
-    xmlNodePtr node;
-    int minOccurs; /* Deprecated; not used */
-    int maxOccurs; /* Deprecated; not used */
-
-    int flags;
-    xmlSchemaContentType contentType;
-    const xmlChar *base; /* Base type's local name */
-    const xmlChar *baseNs; /* Base type's target namespace */
-    xmlSchemaTypePtr baseType; /* The base type component */
-    xmlSchemaFacetPtr facets; /* Local facets */
-    struct _xmlSchemaType *redef; /* Deprecated; not used */
-    int recurse; /* Obsolete */
-    xmlSchemaAttributeLinkPtr *attributeUses; /* Deprecated; not used */
-    xmlSchemaWildcardPtr attributeWildcard;
-    int builtInType; /* Type of built-in types. */
-    xmlSchemaTypeLinkPtr memberTypes; /* member-types if a union type. */
-    xmlSchemaFacetLinkPtr facetSet; /* All facets (incl. inherited) */
-    const xmlChar *refPrefix; /* Deprecated; not used */
-    xmlSchemaTypePtr contentTypeDef; /* Used for the simple content of complex types.
-                                        Could we use @subtypes for this? */
-    xmlRegexpPtr contModel; /* Holds the automaton of the content model */
-    const xmlChar *targetNamespace;
-    void *attrUses;
-};
-
-/*
- * xmlSchemaElement:
- * An element definition.
- *
- * xmlSchemaType, xmlSchemaFacet and xmlSchemaElement start of
- * structures must be kept similar
- */
-/**
- * XML_SCHEMAS_ELEM_NILLABLE:
- *
- * the element is nillable
- */
-#define XML_SCHEMAS_ELEM_NILLABLE        1 << 0
-/**
- * XML_SCHEMAS_ELEM_GLOBAL:
- *
- * the element is global
- */
-#define XML_SCHEMAS_ELEM_GLOBAL                1 << 1
-/**
- * XML_SCHEMAS_ELEM_DEFAULT:
- *
- * the element has a default value
- */
-#define XML_SCHEMAS_ELEM_DEFAULT        1 << 2
-/**
- * XML_SCHEMAS_ELEM_FIXED:
- *
- * the element has a fixed value
- */
-#define XML_SCHEMAS_ELEM_FIXED                1 << 3
-/**
- * XML_SCHEMAS_ELEM_ABSTRACT:
- *
- * the element is abstract
- */
-#define XML_SCHEMAS_ELEM_ABSTRACT        1 << 4
-/**
- * XML_SCHEMAS_ELEM_TOPLEVEL:
- *
- * the element is top level
- * obsolete: use XML_SCHEMAS_ELEM_GLOBAL instead
- */
-#define XML_SCHEMAS_ELEM_TOPLEVEL        1 << 5
-/**
- * XML_SCHEMAS_ELEM_REF:
- *
- * the element is a reference to a type
- */
-#define XML_SCHEMAS_ELEM_REF                1 << 6
-/**
- * XML_SCHEMAS_ELEM_NSDEFAULT:
- *
- * allow elements in no namespace
- * Obsolete, not used anymore.
- */
-#define XML_SCHEMAS_ELEM_NSDEFAULT        1 << 7
-/**
- * XML_SCHEMAS_ELEM_INTERNAL_RESOLVED:
- *
- * this is set when "type", "ref", "substitutionGroup"
- * references have been resolved.
- */
-#define XML_SCHEMAS_ELEM_INTERNAL_RESOLVED        1 << 8
- /**
- * XML_SCHEMAS_ELEM_CIRCULAR:
- *
- * a helper flag for the search of circular references.
- */
-#define XML_SCHEMAS_ELEM_CIRCULAR        1 << 9
-/**
- * XML_SCHEMAS_ELEM_BLOCK_ABSENT:
- *
- * the "block" attribute is absent
- */
-#define XML_SCHEMAS_ELEM_BLOCK_ABSENT        1 << 10
-/**
- * XML_SCHEMAS_ELEM_BLOCK_EXTENSION:
- *
- * disallowed substitutions are absent
- */
-#define XML_SCHEMAS_ELEM_BLOCK_EXTENSION        1 << 11
-/**
- * XML_SCHEMAS_ELEM_BLOCK_RESTRICTION:
- *
- * disallowed substitutions: "restriction"
- */
-#define XML_SCHEMAS_ELEM_BLOCK_RESTRICTION        1 << 12
-/**
- * XML_SCHEMAS_ELEM_BLOCK_SUBSTITUTION:
- *
- * disallowed substitutions: "substituion"
- */
-#define XML_SCHEMAS_ELEM_BLOCK_SUBSTITUTION        1 << 13
-/**
- * XML_SCHEMAS_ELEM_FINAL_ABSENT:
- *
- * substitution group exclusions are absent
- */
-#define XML_SCHEMAS_ELEM_FINAL_ABSENT        1 << 14
-/**
- * XML_SCHEMAS_ELEM_FINAL_EXTENSION:
- *
- * substitution group exclusions: "extension"
- */
-#define XML_SCHEMAS_ELEM_FINAL_EXTENSION        1 << 15
-/**
- * XML_SCHEMAS_ELEM_FINAL_RESTRICTION:
- *
- * substitution group exclusions: "restriction"
- */
-#define XML_SCHEMAS_ELEM_FINAL_RESTRICTION        1 << 16
-/**
- * XML_SCHEMAS_ELEM_SUBST_GROUP_HEAD:
- *
- * the declaration is a substitution group head
- */
-#define XML_SCHEMAS_ELEM_SUBST_GROUP_HEAD        1 << 17
-/**
- * XML_SCHEMAS_ELEM_INTERNAL_CHECKED:
- *
- * this is set when the elem decl has been checked against
- * all constraints
- */
-#define XML_SCHEMAS_ELEM_INTERNAL_CHECKED        1 << 18
-
-typedef struct _xmlSchemaElement xmlSchemaElement;
-typedef xmlSchemaElement *xmlSchemaElementPtr;
-struct _xmlSchemaElement {
-    xmlSchemaTypeType type; /* The kind of type */
-    struct _xmlSchemaType *next; /* Not used? */
-    const xmlChar *name;
-    const xmlChar *id; /* Deprecated; not used */
-    const xmlChar *ref; /* Deprecated; not used */
-    const xmlChar *refNs; /* Deprecated; not used */
-    xmlSchemaAnnotPtr annot;
-    xmlSchemaTypePtr subtypes; /* the type definition */
-    xmlSchemaAttributePtr attributes;
-    xmlNodePtr node;
-    int minOccurs; /* Deprecated; not used */
-    int maxOccurs; /* Deprecated; not used */
-
-    int flags;
-    const xmlChar *targetNamespace;
-    const xmlChar *namedType;
-    const xmlChar *namedTypeNs;
-    const xmlChar *substGroup;
-    const xmlChar *substGroupNs;
-    const xmlChar *scope;
-    const xmlChar *value; /* The original value of the value constraint. */
-    struct _xmlSchemaElement *refDecl; /* This will now be used for the
-                                          substitution group affiliation */
-    xmlRegexpPtr contModel; /* Obsolete for WXS, maybe used for RelaxNG */
-    xmlSchemaContentType contentType;
-    const xmlChar *refPrefix; /* Deprecated; not used */
-    xmlSchemaValPtr defVal; /* The compiled value contraint. */
-    void *idcs; /* The identity-constraint defs */
-};
-
-/*
- * XML_SCHEMAS_FACET_UNKNOWN:
- *
- * unknown facet handling
- */
-#define XML_SCHEMAS_FACET_UNKNOWN        0
-/*
- * XML_SCHEMAS_FACET_PRESERVE:
- *
- * preserve the type of the facet
- */
-#define XML_SCHEMAS_FACET_PRESERVE        1
-/*
- * XML_SCHEMAS_FACET_REPLACE:
- *
- * replace the type of the facet
- */
-#define XML_SCHEMAS_FACET_REPLACE        2
-/*
- * XML_SCHEMAS_FACET_COLLAPSE:
- *
- * collapse the types of the facet
- */
-#define XML_SCHEMAS_FACET_COLLAPSE        3
-/**
- * A facet definition.
- */
-struct _xmlSchemaFacet {
-    xmlSchemaTypeType type;        /* The kind of type */
-    struct _xmlSchemaFacet *next;/* the next type if in a sequence ... */
-    const xmlChar *value; /* The original value */
-    const xmlChar *id; /* Obsolete */
-    xmlSchemaAnnotPtr annot;
-    xmlNodePtr node;
-    int fixed; /* XML_SCHEMAS_FACET_PRESERVE, etc. */
-    int whitespace;
-    xmlSchemaValPtr val; /* The compiled value */
-    xmlRegexpPtr    regexp; /* The regex for patterns */
-};
-
-/**
- * A notation definition.
- */
-typedef struct _xmlSchemaNotation xmlSchemaNotation;
-typedef xmlSchemaNotation *xmlSchemaNotationPtr;
-struct _xmlSchemaNotation {
-    xmlSchemaTypeType type; /* The kind of type */
-    const xmlChar *name;
-    xmlSchemaAnnotPtr annot;
-    const xmlChar *identifier;
-    const xmlChar *targetNamespace;
-};
-
-/*
-* TODO: Actually all those flags used for the schema should sit
-* on the schema parser context, since they are used only
-* during parsing an XML schema document, and not available
-* on the component level as per spec.
-*/
-/**
- * XML_SCHEMAS_QUALIF_ELEM:
- *
- * Reflects elementFormDefault == qualified in
- * an XML schema document.
- */
-#define XML_SCHEMAS_QUALIF_ELEM                1 << 0
-/**
- * XML_SCHEMAS_QUALIF_ATTR:
- *
- * Reflects attributeFormDefault == qualified in
- * an XML schema document.
- */
-#define XML_SCHEMAS_QUALIF_ATTR            1 << 1
-/**
- * XML_SCHEMAS_FINAL_DEFAULT_EXTENSION:
- *
- * the schema has "extension" in the set of finalDefault.
- */
-#define XML_SCHEMAS_FINAL_DEFAULT_EXTENSION        1 << 2
-/**
- * XML_SCHEMAS_FINAL_DEFAULT_RESTRICTION:
- *
- * the schema has "restriction" in the set of finalDefault.
- */
-#define XML_SCHEMAS_FINAL_DEFAULT_RESTRICTION            1 << 3
-/**
- * XML_SCHEMAS_FINAL_DEFAULT_LIST:
- *
- * the cshema has "list" in the set of finalDefault.
- */
-#define XML_SCHEMAS_FINAL_DEFAULT_LIST            1 << 4
-/**
- * XML_SCHEMAS_FINAL_DEFAULT_UNION:
- *
- * the schema has "union" in the set of finalDefault.
- */
-#define XML_SCHEMAS_FINAL_DEFAULT_UNION            1 << 5
-/**
- * XML_SCHEMAS_BLOCK_DEFAULT_EXTENSION:
- *
- * the schema has "extension" in the set of blockDefault.
- */
-#define XML_SCHEMAS_BLOCK_DEFAULT_EXTENSION            1 << 6
-/**
- * XML_SCHEMAS_BLOCK_DEFAULT_RESTRICTION:
- *
- * the schema has "restriction" in the set of blockDefault.
- */
-#define XML_SCHEMAS_BLOCK_DEFAULT_RESTRICTION            1 << 7
-/**
- * XML_SCHEMAS_BLOCK_DEFAULT_SUBSTITUTION:
- *
- * the schema has "substitution" in the set of blockDefault.
- */
-#define XML_SCHEMAS_BLOCK_DEFAULT_SUBSTITUTION            1 << 8
-/**
- * XML_SCHEMAS_INCLUDING_CONVERT_NS:
- *
- * the schema is currently including an other schema with
- * no target namespace.
- */
-#define XML_SCHEMAS_INCLUDING_CONVERT_NS            1 << 9
-/**
- * _xmlSchema:
- *
- * A Schemas definition
- */
-struct _xmlSchema {
-    const xmlChar *name; /* schema name */
-    const xmlChar *targetNamespace; /* the target namespace */
-    const xmlChar *version;
-    const xmlChar *id; /* Obsolete */
-    xmlDocPtr doc;
-    xmlSchemaAnnotPtr annot;
-    int flags;
-
-    xmlHashTablePtr typeDecl;
-    xmlHashTablePtr attrDecl;
-    xmlHashTablePtr attrgrpDecl;
-    xmlHashTablePtr elemDecl;
-    xmlHashTablePtr notaDecl;
-
-    xmlHashTablePtr schemasImports;
-
-    void *_private;        /* unused by the library for users or bindings */
-    xmlHashTablePtr groupDecl;
-    xmlDictPtr      dict;
-    void *includes;     /* the includes, this is opaque for now */
-    int preserve;        /* whether to free the document */
-    int counter; /* used to give ononymous components unique names */
-    xmlHashTablePtr idcDef; /* All identity-constraint defs. */
-    void *volatiles; /* Obsolete */
-};
-
-XMLPUBFUN void XMLCALL         xmlSchemaFreeType        (xmlSchemaTypePtr type);
-XMLPUBFUN void XMLCALL         xmlSchemaFreeWildcard(xmlSchemaWildcardPtr wildcard);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_SCHEMAS_ENABLED */
-#endif /* __XML_SCHEMA_INTERNALS_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/schematron.h igraph-0.6.5/msvc/include/libxml/schematron.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/schematron.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/schematron.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,142 +0,0 @@
-/*
- * Summary: XML Schemastron implementation
- * Description: interface to the XML Schematron validity checking.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SCHEMATRON_H__
-#define __XML_SCHEMATRON_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_SCHEMATRON_ENABLED
-
-#include <libxml/tree.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef enum {
-    XML_SCHEMATRON_OUT_QUIET = 1 << 0,	/* quiet no report */
-    XML_SCHEMATRON_OUT_TEXT = 1 << 1,	/* build a textual report */
-    XML_SCHEMATRON_OUT_XML = 1 << 2,	/* output SVRL */
-    XML_SCHEMATRON_OUT_ERROR = 1 << 3,  /* output via xmlStructuredErrorFunc */
-    XML_SCHEMATRON_OUT_FILE = 1 << 8,	/* output to a file descriptor */
-    XML_SCHEMATRON_OUT_BUFFER = 1 << 9,	/* output to a buffer */
-    XML_SCHEMATRON_OUT_IO = 1 << 10	/* output to I/O mechanism */
-} xmlSchematronValidOptions;
-
-/**
- * The schemas related types are kept internal
- */
-typedef struct _xmlSchematron xmlSchematron;
-typedef xmlSchematron *xmlSchematronPtr;
-
-/**
- * xmlSchematronValidityErrorFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of an error callback from a Schematron validation
- */
-typedef void (*xmlSchematronValidityErrorFunc) (void *ctx, const char *msg, ...);
-
-/**
- * xmlSchematronValidityWarningFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of a warning callback from a Schematron validation
- */
-typedef void (*xmlSchematronValidityWarningFunc) (void *ctx, const char *msg, ...);
-
-/**
- * A schemas validation context
- */
-typedef struct _xmlSchematronParserCtxt xmlSchematronParserCtxt;
-typedef xmlSchematronParserCtxt *xmlSchematronParserCtxtPtr;
-
-typedef struct _xmlSchematronValidCtxt xmlSchematronValidCtxt;
-typedef xmlSchematronValidCtxt *xmlSchematronValidCtxtPtr;
-
-/*
- * Interfaces for parsing.
- */
-XMLPUBFUN xmlSchematronParserCtxtPtr XMLCALL 
-	    xmlSchematronNewParserCtxt	(const char *URL);
-XMLPUBFUN xmlSchematronParserCtxtPtr XMLCALL 
-	    xmlSchematronNewMemParserCtxt(const char *buffer,
-					 int size);
-XMLPUBFUN xmlSchematronParserCtxtPtr XMLCALL
-	    xmlSchematronNewDocParserCtxt(xmlDocPtr doc);
-XMLPUBFUN void XMLCALL		
-	    xmlSchematronFreeParserCtxt	(xmlSchematronParserCtxtPtr ctxt);
-/*****
-XMLPUBFUN void XMLCALL		
-	    xmlSchematronSetParserErrors(xmlSchematronParserCtxtPtr ctxt,
-					 xmlSchematronValidityErrorFunc err,
-					 xmlSchematronValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN int XMLCALL
-		xmlSchematronGetParserErrors(xmlSchematronParserCtxtPtr ctxt,
-					xmlSchematronValidityErrorFunc * err,
-					xmlSchematronValidityWarningFunc * warn,
-					void **ctx);
-XMLPUBFUN int XMLCALL
-		xmlSchematronIsValid	(xmlSchematronValidCtxtPtr ctxt);
- *****/
-XMLPUBFUN xmlSchematronPtr XMLCALL	
-	    xmlSchematronParse		(xmlSchematronParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL		
-	    xmlSchematronFree		(xmlSchematronPtr schema);
-/*
- * Interfaces for validating
- */
-XMLPUBFUN void XMLCALL
-	    xmlSchematronSetValidStructuredErrors(
-	                                  xmlSchematronValidCtxtPtr ctxt,
-					  xmlStructuredErrorFunc serror,
-					  void *ctx);
-/******
-XMLPUBFUN void XMLCALL		
-	    xmlSchematronSetValidErrors	(xmlSchematronValidCtxtPtr ctxt,
-					 xmlSchematronValidityErrorFunc err,
-					 xmlSchematronValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN int XMLCALL
-	    xmlSchematronGetValidErrors	(xmlSchematronValidCtxtPtr ctxt,
-					 xmlSchematronValidityErrorFunc *err,
-					 xmlSchematronValidityWarningFunc *warn,
-					 void **ctx);
-XMLPUBFUN int XMLCALL
-	    xmlSchematronSetValidOptions(xmlSchematronValidCtxtPtr ctxt,
-					 int options);
-XMLPUBFUN int XMLCALL
-	    xmlSchematronValidCtxtGetOptions(xmlSchematronValidCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-            xmlSchematronValidateOneElement (xmlSchematronValidCtxtPtr ctxt,
-			                 xmlNodePtr elem);
- *******/
-
-XMLPUBFUN xmlSchematronValidCtxtPtr XMLCALL	
-	    xmlSchematronNewValidCtxt	(xmlSchematronPtr schema,
-	    				 int options);
-XMLPUBFUN void XMLCALL			
-	    xmlSchematronFreeValidCtxt	(xmlSchematronValidCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL			
-	    xmlSchematronValidateDoc	(xmlSchematronValidCtxtPtr ctxt,
-					 xmlDocPtr instance);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_SCHEMATRON_ENABLED */
-#endif /* __XML_SCHEMATRON_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/threads.h igraph-0.6.5/msvc/include/libxml/threads.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/threads.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/threads.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,84 +0,0 @@
-/**
- * Summary: interfaces for thread handling
- * Description: set of generic threading related routines
- *              should work with pthreads, Windows native or TLS threads
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_THREADS_H__
-#define __XML_THREADS_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * xmlMutex are a simple mutual exception locks.
- */
-typedef struct _xmlMutex xmlMutex;
-typedef xmlMutex *xmlMutexPtr;
-
-/*
- * xmlRMutex are reentrant mutual exception locks.
- */
-typedef struct _xmlRMutex xmlRMutex;
-typedef xmlRMutex *xmlRMutexPtr;
-
-#ifdef __cplusplus
-}
-#endif
-#include <libxml/globals.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-XMLPUBFUN xmlMutexPtr XMLCALL
-			xmlNewMutex	(void);
-XMLPUBFUN void XMLCALL
-			xmlMutexLock	(xmlMutexPtr tok);
-XMLPUBFUN void XMLCALL
-			xmlMutexUnlock	(xmlMutexPtr tok);
-XMLPUBFUN void XMLCALL
-			xmlFreeMutex	(xmlMutexPtr tok);
-
-XMLPUBFUN xmlRMutexPtr XMLCALL
-			xmlNewRMutex	(void);
-XMLPUBFUN void XMLCALL
-			xmlRMutexLock	(xmlRMutexPtr tok);
-XMLPUBFUN void XMLCALL
-			xmlRMutexUnlock	(xmlRMutexPtr tok);
-XMLPUBFUN void XMLCALL
-			xmlFreeRMutex	(xmlRMutexPtr tok);
-
-/*
- * Library wide APIs.
- */
-XMLPUBFUN void XMLCALL
-			xmlInitThreads	(void);
-XMLPUBFUN void XMLCALL
-			xmlLockLibrary	(void);
-XMLPUBFUN void XMLCALL
-			xmlUnlockLibrary(void);
-XMLPUBFUN int XMLCALL
-			xmlGetThreadId	(void);
-XMLPUBFUN int XMLCALL
-			xmlIsMainThread	(void);
-XMLPUBFUN void XMLCALL
-			xmlCleanupThreads(void);
-XMLPUBFUN xmlGlobalStatePtr XMLCALL
-			xmlGetGlobalState(void);
-
-#if defined(HAVE_WIN32_THREADS) && !defined(HAVE_COMPILER_TLS) && defined(LIBXML_STATIC_FOR_DLL)
-int XMLCALL xmlDllMain(void *hinstDLL, unsigned long fdwReason, void *lpvReserved);
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-
-
-#endif /* __XML_THREADS_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/tree.h igraph-0.6.5/msvc/include/libxml/tree.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/tree.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/tree.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,1213 +0,0 @@
-/*
- * Summary: interfaces for tree manipulation
- * Description: this module describes the structures found in an tree resulting
- *              from an XML or HTML parsing, as well as the API provided for
- *              various processing on that tree
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_TREE_H__
-#define __XML_TREE_H__
-
-#include <stdio.h>
-#include <libxml/xmlversion.h>
-#include <libxml/xmlstring.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Some of the basic types pointer to structures:
- */
-/* xmlIO.h */
-typedef struct _xmlParserInputBuffer xmlParserInputBuffer;
-typedef xmlParserInputBuffer *xmlParserInputBufferPtr;
-
-typedef struct _xmlOutputBuffer xmlOutputBuffer;
-typedef xmlOutputBuffer *xmlOutputBufferPtr;
-
-/* parser.h */
-typedef struct _xmlParserInput xmlParserInput;
-typedef xmlParserInput *xmlParserInputPtr;
-
-typedef struct _xmlParserCtxt xmlParserCtxt;
-typedef xmlParserCtxt *xmlParserCtxtPtr;
-
-typedef struct _xmlSAXLocator xmlSAXLocator;
-typedef xmlSAXLocator *xmlSAXLocatorPtr;
-
-typedef struct _xmlSAXHandler xmlSAXHandler;
-typedef xmlSAXHandler *xmlSAXHandlerPtr;
-
-/* entities.h */
-typedef struct _xmlEntity xmlEntity;
-typedef xmlEntity *xmlEntityPtr;
-
-/**
- * BASE_BUFFER_SIZE:
- *
- * default buffer size 4000.
- */
-#define BASE_BUFFER_SIZE 4096
-
-/**
- * LIBXML_NAMESPACE_DICT:
- *
- * Defines experimental behaviour:
- * 1) xmlNs gets an additional field @context (a xmlDoc)
- * 2) when creating a tree, xmlNs->href is stored in the dict of xmlDoc.
- */
-/* #define LIBXML_NAMESPACE_DICT */
-
-/**
- * xmlBufferAllocationScheme:
- *
- * A buffer allocation scheme can be defined to either match exactly the
- * need or double it's allocated size each time it is found too small.
- */
-
-typedef enum {
-    XML_BUFFER_ALLOC_DOUBLEIT,
-    XML_BUFFER_ALLOC_EXACT,
-    XML_BUFFER_ALLOC_IMMUTABLE
-} xmlBufferAllocationScheme;
-
-/**
- * xmlBuffer:
- *
- * A buffer structure.
- */
-typedef struct _xmlBuffer xmlBuffer;
-typedef xmlBuffer *xmlBufferPtr;
-struct _xmlBuffer {
-    xmlChar *content;		/* The buffer content UTF8 */
-    unsigned int use;		/* The buffer size used */
-    unsigned int size;		/* The buffer size */
-    xmlBufferAllocationScheme alloc; /* The realloc method */
-};
-
-/**
- * XML_XML_NAMESPACE:
- *
- * This is the namespace for the special xml: prefix predefined in the
- * XML Namespace specification.
- */
-#define XML_XML_NAMESPACE \
-    (const xmlChar *) "http://www.w3.org/XML/1998/namespace"
-
-/**
- * XML_XML_ID:
- *
- * This is the name for the special xml:id attribute
- */
-#define XML_XML_ID (const xmlChar *) "xml:id"
-
-/*
- * The different element types carried by an XML tree.
- *
- * NOTE: This is synchronized with DOM Level1 values
- *       See http://www.w3.org/TR/REC-DOM-Level-1/
- *
- * Actually this had diverged a bit, and now XML_DOCUMENT_TYPE_NODE should
- * be deprecated to use an XML_DTD_NODE.
- */
-typedef enum {
-    XML_ELEMENT_NODE=		1,
-    XML_ATTRIBUTE_NODE=		2,
-    XML_TEXT_NODE=		3,
-    XML_CDATA_SECTION_NODE=	4,
-    XML_ENTITY_REF_NODE=	5,
-    XML_ENTITY_NODE=		6,
-    XML_PI_NODE=		7,
-    XML_COMMENT_NODE=		8,
-    XML_DOCUMENT_NODE=		9,
-    XML_DOCUMENT_TYPE_NODE=	10,
-    XML_DOCUMENT_FRAG_NODE=	11,
-    XML_NOTATION_NODE=		12,
-    XML_HTML_DOCUMENT_NODE=	13,
-    XML_DTD_NODE=		14,
-    XML_ELEMENT_DECL=		15,
-    XML_ATTRIBUTE_DECL=		16,
-    XML_ENTITY_DECL=		17,
-    XML_NAMESPACE_DECL=		18,
-    XML_XINCLUDE_START=		19,
-    XML_XINCLUDE_END=		20
-#ifdef LIBXML_DOCB_ENABLED
-   ,XML_DOCB_DOCUMENT_NODE=	21
-#endif
-} xmlElementType;
-
-
-/**
- * xmlNotation:
- *
- * A DTD Notation definition.
- */
-
-typedef struct _xmlNotation xmlNotation;
-typedef xmlNotation *xmlNotationPtr;
-struct _xmlNotation {
-    const xmlChar               *name;	        /* Notation name */
-    const xmlChar               *PublicID;	/* Public identifier, if any */
-    const xmlChar               *SystemID;	/* System identifier, if any */
-};
-
-/**
- * xmlAttributeType:
- *
- * A DTD Attribute type definition.
- */
-
-typedef enum {
-    XML_ATTRIBUTE_CDATA = 1,
-    XML_ATTRIBUTE_ID,
-    XML_ATTRIBUTE_IDREF	,
-    XML_ATTRIBUTE_IDREFS,
-    XML_ATTRIBUTE_ENTITY,
-    XML_ATTRIBUTE_ENTITIES,
-    XML_ATTRIBUTE_NMTOKEN,
-    XML_ATTRIBUTE_NMTOKENS,
-    XML_ATTRIBUTE_ENUMERATION,
-    XML_ATTRIBUTE_NOTATION
-} xmlAttributeType;
-
-/**
- * xmlAttributeDefault:
- *
- * A DTD Attribute default definition.
- */
-
-typedef enum {
-    XML_ATTRIBUTE_NONE = 1,
-    XML_ATTRIBUTE_REQUIRED,
-    XML_ATTRIBUTE_IMPLIED,
-    XML_ATTRIBUTE_FIXED
-} xmlAttributeDefault;
-
-/**
- * xmlEnumeration:
- *
- * List structure used when there is an enumeration in DTDs.
- */
-
-typedef struct _xmlEnumeration xmlEnumeration;
-typedef xmlEnumeration *xmlEnumerationPtr;
-struct _xmlEnumeration {
-    struct _xmlEnumeration    *next;	/* next one */
-    const xmlChar            *name;	/* Enumeration name */
-};
-
-/**
- * xmlAttribute:
- *
- * An Attribute declaration in a DTD.
- */
-
-typedef struct _xmlAttribute xmlAttribute;
-typedef xmlAttribute *xmlAttributePtr;
-struct _xmlAttribute {
-    void           *_private;	        /* application data */
-    xmlElementType          type;       /* XML_ATTRIBUTE_DECL, must be second ! */
-    const xmlChar          *name;	/* Attribute name */
-    struct _xmlNode    *children;	/* NULL */
-    struct _xmlNode        *last;	/* NULL */
-    struct _xmlDtd       *parent;	/* -> DTD */
-    struct _xmlNode        *next;	/* next sibling link  */
-    struct _xmlNode        *prev;	/* previous sibling link  */
-    struct _xmlDoc          *doc;       /* the containing document */
-
-    struct _xmlAttribute  *nexth;	/* next in hash table */
-    xmlAttributeType       atype;	/* The attribute type */
-    xmlAttributeDefault      def;	/* the default */
-    const xmlChar  *defaultValue;	/* or the default value */
-    xmlEnumerationPtr       tree;       /* or the enumeration tree if any */
-    const xmlChar        *prefix;	/* the namespace prefix if any */
-    const xmlChar          *elem;	/* Element holding the attribute */
-};
-
-/**
- * xmlElementContentType:
- *
- * Possible definitions of element content types.
- */
-typedef enum {
-    XML_ELEMENT_CONTENT_PCDATA = 1,
-    XML_ELEMENT_CONTENT_ELEMENT,
-    XML_ELEMENT_CONTENT_SEQ,
-    XML_ELEMENT_CONTENT_OR
-} xmlElementContentType;
-
-/**
- * xmlElementContentOccur:
- *
- * Possible definitions of element content occurrences.
- */
-typedef enum {
-    XML_ELEMENT_CONTENT_ONCE = 1,
-    XML_ELEMENT_CONTENT_OPT,
-    XML_ELEMENT_CONTENT_MULT,
-    XML_ELEMENT_CONTENT_PLUS
-} xmlElementContentOccur;
-
-/**
- * xmlElementContent:
- *
- * An XML Element content as stored after parsing an element definition
- * in a DTD.
- */
-
-typedef struct _xmlElementContent xmlElementContent;
-typedef xmlElementContent *xmlElementContentPtr;
-struct _xmlElementContent {
-    xmlElementContentType     type;	/* PCDATA, ELEMENT, SEQ or OR */
-    xmlElementContentOccur    ocur;	/* ONCE, OPT, MULT or PLUS */
-    const xmlChar             *name;	/* Element name */
-    struct _xmlElementContent *c1;	/* first child */
-    struct _xmlElementContent *c2;	/* second child */
-    struct _xmlElementContent *parent;	/* parent */
-    const xmlChar             *prefix;	/* Namespace prefix */
-};
-
-/**
- * xmlElementTypeVal:
- *
- * The different possibilities for an element content type.
- */
-
-typedef enum {
-    XML_ELEMENT_TYPE_UNDEFINED = 0,
-    XML_ELEMENT_TYPE_EMPTY = 1,
-    XML_ELEMENT_TYPE_ANY,
-    XML_ELEMENT_TYPE_MIXED,
-    XML_ELEMENT_TYPE_ELEMENT
-} xmlElementTypeVal;
-
-#ifdef __cplusplus
-}
-#endif
-#include <libxml/xmlregexp.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlElement:
- *
- * An XML Element declaration from a DTD.
- */
-
-typedef struct _xmlElement xmlElement;
-typedef xmlElement *xmlElementPtr;
-struct _xmlElement {
-    void           *_private;	        /* application data */
-    xmlElementType          type;       /* XML_ELEMENT_DECL, must be second ! */
-    const xmlChar          *name;	/* Element name */
-    struct _xmlNode    *children;	/* NULL */
-    struct _xmlNode        *last;	/* NULL */
-    struct _xmlDtd       *parent;	/* -> DTD */
-    struct _xmlNode        *next;	/* next sibling link  */
-    struct _xmlNode        *prev;	/* previous sibling link  */
-    struct _xmlDoc          *doc;       /* the containing document */
-
-    xmlElementTypeVal      etype;	/* The type */
-    xmlElementContentPtr content;	/* the allowed element content */
-    xmlAttributePtr   attributes;	/* List of the declared attributes */
-    const xmlChar        *prefix;	/* the namespace prefix if any */
-#ifdef LIBXML_REGEXP_ENABLED
-    xmlRegexpPtr       contModel;	/* the validating regexp */
-#else
-    void	      *contModel;
-#endif
-};
-
-
-/**
- * XML_LOCAL_NAMESPACE:
- *
- * A namespace declaration node.
- */
-#define XML_LOCAL_NAMESPACE XML_NAMESPACE_DECL
-typedef xmlElementType xmlNsType;
-
-/**
- * xmlNs:
- *
- * An XML namespace.
- * Note that prefix == NULL is valid, it defines the default namespace
- * within the subtree (until overridden).
- *
- * xmlNsType is unified with xmlElementType.
- */
-
-typedef struct _xmlNs xmlNs;
-typedef xmlNs *xmlNsPtr;
-struct _xmlNs {
-    struct _xmlNs  *next;	/* next Ns link for this node  */
-    xmlNsType      type;	/* global or local */
-    const xmlChar *href;	/* URL for the namespace */
-    const xmlChar *prefix;	/* prefix for the namespace */
-    void           *_private;   /* application data */
-    struct _xmlDoc *context;		/* normally an xmlDoc */
-};
-
-/**
- * xmlDtd:
- *
- * An XML DTD, as defined by <!DOCTYPE ... There is actually one for
- * the internal subset and for the external subset.
- */
-typedef struct _xmlDtd xmlDtd;
-typedef xmlDtd *xmlDtdPtr;
-struct _xmlDtd {
-    void           *_private;	/* application data */
-    xmlElementType  type;       /* XML_DTD_NODE, must be second ! */
-    const xmlChar *name;	/* Name of the DTD */
-    struct _xmlNode *children;	/* the value of the property link */
-    struct _xmlNode *last;	/* last child link */
-    struct _xmlDoc  *parent;	/* child->parent link */
-    struct _xmlNode *next;	/* next sibling link  */
-    struct _xmlNode *prev;	/* previous sibling link  */
-    struct _xmlDoc  *doc;	/* the containing document */
-
-    /* End of common part */
-    void          *notations;   /* Hash table for notations if any */
-    void          *elements;    /* Hash table for elements if any */
-    void          *attributes;  /* Hash table for attributes if any */
-    void          *entities;    /* Hash table for entities if any */
-    const xmlChar *ExternalID;	/* External identifier for PUBLIC DTD */
-    const xmlChar *SystemID;	/* URI for a SYSTEM or PUBLIC DTD */
-    void          *pentities;   /* Hash table for param entities if any */
-};
-
-/**
- * xmlAttr:
- *
- * An attribute on an XML node.
- */
-typedef struct _xmlAttr xmlAttr;
-typedef xmlAttr *xmlAttrPtr;
-struct _xmlAttr {
-    void           *_private;	/* application data */
-    xmlElementType   type;      /* XML_ATTRIBUTE_NODE, must be second ! */
-    const xmlChar   *name;      /* the name of the property */
-    struct _xmlNode *children;	/* the value of the property */
-    struct _xmlNode *last;	/* NULL */
-    struct _xmlNode *parent;	/* child->parent link */
-    struct _xmlAttr *next;	/* next sibling link  */
-    struct _xmlAttr *prev;	/* previous sibling link  */
-    struct _xmlDoc  *doc;	/* the containing document */
-    xmlNs           *ns;        /* pointer to the associated namespace */
-    xmlAttributeType atype;     /* the attribute type if validating */
-    void            *psvi;	/* for type/PSVI informations */
-};
-
-/**
- * xmlID:
- *
- * An XML ID instance.
- */
-
-typedef struct _xmlID xmlID;
-typedef xmlID *xmlIDPtr;
-struct _xmlID {
-    struct _xmlID    *next;	/* next ID */
-    const xmlChar    *value;	/* The ID name */
-    xmlAttrPtr        attr;	/* The attribute holding it */
-    const xmlChar    *name;	/* The attribute if attr is not available */
-    int               lineno;	/* The line number if attr is not available */
-    struct _xmlDoc   *doc;	/* The document holding the ID */
-};
-
-/**
- * xmlRef:
- *
- * An XML IDREF instance.
- */
-
-typedef struct _xmlRef xmlRef;
-typedef xmlRef *xmlRefPtr;
-struct _xmlRef {
-    struct _xmlRef    *next;	/* next Ref */
-    const xmlChar     *value;	/* The Ref name */
-    xmlAttrPtr        attr;	/* The attribute holding it */
-    const xmlChar    *name;	/* The attribute if attr is not available */
-    int               lineno;	/* The line number if attr is not available */
-};
-
-/**
- * xmlNode:
- *
- * A node in an XML tree.
- */
-typedef struct _xmlNode xmlNode;
-typedef xmlNode *xmlNodePtr;
-struct _xmlNode {
-    void           *_private;	/* application data */
-    xmlElementType   type;	/* type number, must be second ! */
-    const xmlChar   *name;      /* the name of the node, or the entity */
-    struct _xmlNode *children;	/* parent->childs link */
-    struct _xmlNode *last;	/* last child link */
-    struct _xmlNode *parent;	/* child->parent link */
-    struct _xmlNode *next;	/* next sibling link  */
-    struct _xmlNode *prev;	/* previous sibling link  */
-    struct _xmlDoc  *doc;	/* the containing document */
-
-    /* End of common part */
-    xmlNs           *ns;        /* pointer to the associated namespace */
-    xmlChar         *content;   /* the content */
-    struct _xmlAttr *properties;/* properties list */
-    xmlNs           *nsDef;     /* namespace definitions on this node */
-    void            *psvi;	/* for type/PSVI informations */
-    unsigned short   line;	/* line number */
-    unsigned short   extra;	/* extra data for XPath/XSLT */
-};
-
-/**
- * XML_GET_CONTENT:
- *
- * Macro to extract the content pointer of a node.
- */
-#define XML_GET_CONTENT(n)					\
-    ((n)->type == XML_ELEMENT_NODE ? NULL : (n)->content)
-
-/**
- * XML_GET_LINE:
- *
- * Macro to extract the line number of an element node. 
- */
-#define XML_GET_LINE(n)						\
-    (xmlGetLineNo(n))
-
-
-/**
- * xmlDoc:
- *
- * An XML document.
- */
-typedef struct _xmlDoc xmlDoc;
-typedef xmlDoc *xmlDocPtr;
-struct _xmlDoc {
-    void           *_private;	/* application data */
-    xmlElementType  type;       /* XML_DOCUMENT_NODE, must be second ! */
-    char           *name;	/* name/filename/URI of the document */
-    struct _xmlNode *children;	/* the document tree */
-    struct _xmlNode *last;	/* last child link */
-    struct _xmlNode *parent;	/* child->parent link */
-    struct _xmlNode *next;	/* next sibling link  */
-    struct _xmlNode *prev;	/* previous sibling link  */
-    struct _xmlDoc  *doc;	/* autoreference to itself */
-
-    /* End of common part */
-    int             compression;/* level of zlib compression */
-    int             standalone; /* standalone document (no external refs) 
-				     1 if standalone="yes"
-				     0 if standalone="no"
-				    -1 if there is no XML declaration
-				    -2 if there is an XML declaration, but no
-					standalone attribute was specified */
-    struct _xmlDtd  *intSubset;	/* the document internal subset */
-    struct _xmlDtd  *extSubset;	/* the document external subset */
-    struct _xmlNs   *oldNs;	/* Global namespace, the old way */
-    const xmlChar  *version;	/* the XML version string */
-    const xmlChar  *encoding;   /* external initial encoding, if any */
-    void           *ids;        /* Hash table for ID attributes if any */
-    void           *refs;       /* Hash table for IDREFs attributes if any */
-    const xmlChar  *URL;	/* The URI for that document */
-    int             charset;    /* encoding of the in-memory content
-				   actually an xmlCharEncoding */
-    struct _xmlDict *dict;      /* dict used to allocate names or NULL */
-    void           *psvi;	/* for type/PSVI informations */
-};
-
-
-typedef struct _xmlDOMWrapCtxt xmlDOMWrapCtxt;
-typedef xmlDOMWrapCtxt *xmlDOMWrapCtxtPtr;
-
-/**
- * xmlDOMWrapAcquireNsFunction:
- * @ctxt:  a DOM wrapper context
- * @node:  the context node (element or attribute) 
- * @nsName:  the requested namespace name
- * @nsPrefix:  the requested namespace prefix 
- *
- * A function called to acquire namespaces (xmlNs) from the wrapper.
- *
- * Returns an xmlNsPtr or NULL in case of an error.
- */
-typedef xmlNsPtr (*xmlDOMWrapAcquireNsFunction) (xmlDOMWrapCtxtPtr ctxt,
-						 xmlNodePtr node,
-						 const xmlChar *nsName,
-						 const xmlChar *nsPrefix);
-
-/**
- * xmlDOMWrapCtxt:
- *
- * Context for DOM wrapper-operations.
- */
-struct _xmlDOMWrapCtxt {
-    void * _private;
-    /*
-    * The type of this context, just in case we need specialized
-    * contexts in the future.
-    */
-    int type;
-    /*
-    * Internal namespace map used for various operations.
-    */
-    void * namespaceMap;
-    /*
-    * Use this one to acquire an xmlNsPtr intended for node->ns.
-    * (Note that this is not intended for elem->nsDef).
-    */
-    xmlDOMWrapAcquireNsFunction getNsForNodeFunc;
-};
-
-/**
- * xmlChildrenNode:
- *
- * Macro for compatibility naming layer with libxml1. Maps
- * to "children."
- */
-#ifndef xmlChildrenNode
-#define xmlChildrenNode children
-#endif
-
-/**
- * xmlRootNode:
- *
- * Macro for compatibility naming layer with libxml1. Maps 
- * to "children".
- */
-#ifndef xmlRootNode
-#define xmlRootNode children
-#endif
-
-/*
- * Variables.
- */
-
-/*
- * Some helper functions
- */
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_DEBUG_ENABLED) || defined (LIBXML_HTML_ENABLED) || defined(LIBXML_SAX1_ENABLED) || defined(LIBXML_HTML_ENABLED) || defined(LIBXML_WRITER_ENABLED) || defined(LIBXML_DOCB_ENABLED)
-XMLPUBFUN int XMLCALL
-		xmlValidateNCName	(const xmlChar *value,
-					 int space);
-#endif
-
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN int XMLCALL		
-		xmlValidateQName	(const xmlChar *value,
-					 int space);
-XMLPUBFUN int XMLCALL		
-		xmlValidateName		(const xmlChar *value,
-					 int space);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNMToken	(const xmlChar *value,
-					 int space);
-#endif
-
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlBuildQName		(const xmlChar *ncname,
-					 const xmlChar *prefix,
-					 xmlChar *memory,
-					 int len);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlSplitQName2		(const xmlChar *name,
-					 xmlChar **prefix);
-XMLPUBFUN const xmlChar * XMLCALL	
-		xmlSplitQName3		(const xmlChar *name,
-					 int *len);
-
-/*
- * Handling Buffers.
- */
-
-XMLPUBFUN void XMLCALL		
-		xmlSetBufferAllocationScheme(xmlBufferAllocationScheme scheme);
-XMLPUBFUN xmlBufferAllocationScheme XMLCALL	 
-		xmlGetBufferAllocationScheme(void);
-
-XMLPUBFUN xmlBufferPtr XMLCALL	
-		xmlBufferCreate		(void);
-XMLPUBFUN xmlBufferPtr XMLCALL	
-		xmlBufferCreateSize	(size_t size);
-XMLPUBFUN xmlBufferPtr XMLCALL	
-		xmlBufferCreateStatic	(void *mem,
-					 size_t size);
-XMLPUBFUN int XMLCALL		
-		xmlBufferResize		(xmlBufferPtr buf,
-					 unsigned int size);
-XMLPUBFUN void XMLCALL		
-		xmlBufferFree		(xmlBufferPtr buf);
-XMLPUBFUN int XMLCALL		
-		xmlBufferDump		(FILE *file,
-					 xmlBufferPtr buf);
-XMLPUBFUN int XMLCALL		
-		xmlBufferAdd		(xmlBufferPtr buf,
-					 const xmlChar *str,
-					 int len);
-XMLPUBFUN int XMLCALL		
-		xmlBufferAddHead	(xmlBufferPtr buf,
-					 const xmlChar *str,
-					 int len);
-XMLPUBFUN int XMLCALL		
-		xmlBufferCat		(xmlBufferPtr buf,
-					 const xmlChar *str);
-XMLPUBFUN int XMLCALL	
-		xmlBufferCCat		(xmlBufferPtr buf,
-					 const char *str);
-XMLPUBFUN int XMLCALL		
-		xmlBufferShrink		(xmlBufferPtr buf,
-					 unsigned int len);
-XMLPUBFUN int XMLCALL		
-		xmlBufferGrow		(xmlBufferPtr buf,
-					 unsigned int len);
-XMLPUBFUN void XMLCALL		
-		xmlBufferEmpty		(xmlBufferPtr buf);
-XMLPUBFUN const xmlChar* XMLCALL	
-		xmlBufferContent	(const xmlBufferPtr buf);
-XMLPUBFUN void XMLCALL		
-		xmlBufferSetAllocationScheme(xmlBufferPtr buf,
-					 xmlBufferAllocationScheme scheme);
-XMLPUBFUN int XMLCALL		
-		xmlBufferLength		(const xmlBufferPtr buf);
-
-/*
- * Creating/freeing new structures.
- */
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlCreateIntSubset	(xmlDocPtr doc,
-					 const xmlChar *name,
-					 const xmlChar *ExternalID,
-					 const xmlChar *SystemID);
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlNewDtd		(xmlDocPtr doc,
-					 const xmlChar *name,
-					 const xmlChar *ExternalID,
-					 const xmlChar *SystemID);
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlGetIntSubset		(xmlDocPtr doc);
-XMLPUBFUN void XMLCALL		
-		xmlFreeDtd		(xmlDtdPtr cur);
-#ifdef LIBXML_LEGACY_ENABLED
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlNewGlobalNs		(xmlDocPtr doc,
-					 const xmlChar *href,
-					 const xmlChar *prefix);
-#endif /* LIBXML_LEGACY_ENABLED */
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlNewNs		(xmlNodePtr node,
-					 const xmlChar *href,
-					 const xmlChar *prefix);
-XMLPUBFUN void XMLCALL		
-		xmlFreeNs		(xmlNsPtr cur);
-XMLPUBFUN void XMLCALL		
-		xmlFreeNsList		(xmlNsPtr cur);
-XMLPUBFUN xmlDocPtr XMLCALL 	
-		xmlNewDoc		(const xmlChar *version);
-XMLPUBFUN void XMLCALL		
-		xmlFreeDoc		(xmlDocPtr cur);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlNewDocProp		(xmlDocPtr doc,
-					 const xmlChar *name,
-					 const xmlChar *value);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_HTML_ENABLED) || \
-    defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlNewProp		(xmlNodePtr node,
-					 const xmlChar *name,
-					 const xmlChar *value);
-#endif
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlNewNsProp		(xmlNodePtr node,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *value);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlNewNsPropEatName	(xmlNodePtr node,
-					 xmlNsPtr ns,
-					 xmlChar *name,
-					 const xmlChar *value);
-XMLPUBFUN void XMLCALL		
-		xmlFreePropList		(xmlAttrPtr cur);
-XMLPUBFUN void XMLCALL		
-		xmlFreeProp		(xmlAttrPtr cur);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlCopyProp		(xmlNodePtr target,
-					 xmlAttrPtr cur);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlCopyPropList		(xmlNodePtr target,
-					 xmlAttrPtr cur);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlDtdPtr XMLCALL	
-		xmlCopyDtd		(xmlDtdPtr dtd);
-#endif /* LIBXML_TREE_ENABLED */
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN xmlDocPtr XMLCALL	
-		xmlCopyDoc		(xmlDocPtr doc,
-					 int recursive);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) */
-/*
- * Creating new nodes.
- */
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocNode		(xmlDocPtr doc,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocNodeEatName	(xmlDocPtr doc,
-					 xmlNsPtr ns,
-					 xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewNode		(xmlNsPtr ns,
-					 const xmlChar *name);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewNodeEatName	(xmlNsPtr ns,
-					 xmlChar *name);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewChild		(xmlNodePtr parent,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *content);
-#endif
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocText		(xmlDocPtr doc,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewText		(const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocPI		(xmlDocPtr doc,
-					 const xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewPI		(const xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocTextLen	(xmlDocPtr doc,
-					 const xmlChar *content,
-					 int len);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewTextLen		(const xmlChar *content,
-					 int len);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocComment	(xmlDocPtr doc,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewComment		(const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewCDataBlock	(xmlDocPtr doc,
-					 const xmlChar *content,
-					 int len);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewCharRef		(xmlDocPtr doc,
-					 const xmlChar *name);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewReference		(xmlDocPtr doc,
-					 const xmlChar *name);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlCopyNode		(const xmlNodePtr node,
-					 int recursive);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlDocCopyNode		(const xmlNodePtr node,
-					 xmlDocPtr doc,
-					 int recursive);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlDocCopyNodeList	(xmlDocPtr doc,
-					 const xmlNodePtr node);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlCopyNodeList		(const xmlNodePtr node);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewTextChild		(xmlNodePtr parent,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocRawNode	(xmlDocPtr doc,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *content);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlNewDocFragment	(xmlDocPtr doc);
-#endif /* LIBXML_TREE_ENABLED */
-
-/*
- * Navigating.
- */
-XMLPUBFUN long XMLCALL		
-		xmlGetLineNo		(xmlNodePtr node);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_DEBUG_ENABLED)
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlGetNodePath		(xmlNodePtr node);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_DEBUG_ENABLED) */
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlDocGetRootElement	(xmlDocPtr doc);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlGetLastChild		(xmlNodePtr parent);
-XMLPUBFUN int XMLCALL		
-		xmlNodeIsText		(xmlNodePtr node);
-XMLPUBFUN int XMLCALL		
-		xmlIsBlankNode		(xmlNodePtr node);
-
-/*
- * Changing the structure.
- */
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED)
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlDocSetRootElement	(xmlDocPtr doc,
-					 xmlNodePtr root);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED) */
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetName		(xmlNodePtr cur,
-					 const xmlChar *name);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlAddChild		(xmlNodePtr parent,
-					 xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlAddChildList		(xmlNodePtr parent,
-					 xmlNodePtr cur);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED)
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlReplaceNode		(xmlNodePtr old,
-					 xmlNodePtr cur);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_WRITER_ENABLED) */
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_HTML_ENABLED) || \
-    defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlAddPrevSibling	(xmlNodePtr cur,
-					 xmlNodePtr elem);
-#endif /* LIBXML_TREE_ENABLED || LIBXML_HTML_ENABLED || LIBXML_SCHEMAS_ENABLED */
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlAddSibling		(xmlNodePtr cur,
-					 xmlNodePtr elem);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlAddNextSibling	(xmlNodePtr cur,
-					 xmlNodePtr elem);
-XMLPUBFUN void XMLCALL		
-		xmlUnlinkNode		(xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlTextMerge		(xmlNodePtr first,
-					 xmlNodePtr second);
-XMLPUBFUN int XMLCALL		
-		xmlTextConcat		(xmlNodePtr node,
-					 const xmlChar *content,
-					 int len);
-XMLPUBFUN void XMLCALL		
-		xmlFreeNodeList		(xmlNodePtr cur);
-XMLPUBFUN void XMLCALL		
-		xmlFreeNode		(xmlNodePtr cur);
-XMLPUBFUN void XMLCALL		
-		xmlSetTreeDoc		(xmlNodePtr tree,
-					 xmlDocPtr doc);
-XMLPUBFUN void XMLCALL		
-		xmlSetListDoc		(xmlNodePtr list,
-					 xmlDocPtr doc);
-/*
- * Namespaces.
- */
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlSearchNs		(xmlDocPtr doc,
-					 xmlNodePtr node,
-					 const xmlChar *nameSpace);
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlSearchNsByHref	(xmlDocPtr doc,
-					 xmlNodePtr node,
-					 const xmlChar *href);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN xmlNsPtr * XMLCALL	
-		xmlGetNsList		(xmlDocPtr doc,
-					 xmlNodePtr node);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XPATH_ENABLED) */
-
-XMLPUBFUN void XMLCALL		
-		xmlSetNs		(xmlNodePtr node,
-					 xmlNsPtr ns);
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlCopyNamespace	(xmlNsPtr cur);
-XMLPUBFUN xmlNsPtr XMLCALL	
-		xmlCopyNamespaceList	(xmlNsPtr cur);
-
-/*
- * Changing the content.
- */
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_HTML_ENABLED)
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlSetProp		(xmlNodePtr node,
-					 const xmlChar *name,
-					 const xmlChar *value);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlSetNsProp		(xmlNodePtr node,
-					 xmlNsPtr ns,
-					 const xmlChar *name,
-					 const xmlChar *value);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) || defined(LIBXML_HTML_ENABLED) */
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlGetNoNsProp		(xmlNodePtr node,
-					 const xmlChar *name);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlGetProp		(xmlNodePtr node,
-					 const xmlChar *name);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlHasProp		(xmlNodePtr node,
-					 const xmlChar *name);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlHasNsProp		(xmlNodePtr node,
-					 const xmlChar *name,
-					 const xmlChar *nameSpace);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlGetNsProp		(xmlNodePtr node,
-					 const xmlChar *name,
-					 const xmlChar *nameSpace);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlStringGetNodeList	(xmlDocPtr doc,
-					 const xmlChar *value);
-XMLPUBFUN xmlNodePtr XMLCALL	
-		xmlStringLenGetNodeList	(xmlDocPtr doc,
-					 const xmlChar *value,
-					 int len);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlNodeListGetString	(xmlDocPtr doc,
-					 xmlNodePtr list,
-					 int inLine);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlNodeListGetRawString	(xmlDocPtr doc,
-					 xmlNodePtr list,
-					 int inLine);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetContent	(xmlNodePtr cur,
-					 const xmlChar *content);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetContentLen	(xmlNodePtr cur,
-					 const xmlChar *content,
-					 int len);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL		
-		xmlNodeAddContent	(xmlNodePtr cur,
-					 const xmlChar *content);
-XMLPUBFUN void XMLCALL		
-		xmlNodeAddContentLen	(xmlNodePtr cur,
-					 const xmlChar *content,
-					 int len);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlNodeGetContent	(xmlNodePtr cur);
-XMLPUBFUN int XMLCALL
-		xmlNodeBufGetContent	(xmlBufferPtr buffer,
-					 xmlNodePtr cur);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlNodeGetLang		(xmlNodePtr cur);
-XMLPUBFUN int XMLCALL		
-		xmlNodeGetSpacePreserve	(xmlNodePtr cur);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetLang		(xmlNodePtr cur,
-					 const xmlChar *lang);
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetSpacePreserve (xmlNodePtr cur,
-					 int val);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlNodeGetBase		(xmlDocPtr doc,
-					 xmlNodePtr cur);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_XINCLUDE_ENABLED)
-XMLPUBFUN void XMLCALL		
-		xmlNodeSetBase		(xmlNodePtr cur,
-					 const xmlChar *uri);
-#endif
-
-/*
- * Removing content.
- */
-XMLPUBFUN int XMLCALL		
-		xmlRemoveProp		(xmlAttrPtr cur);
-#if defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN int XMLCALL		
-		xmlUnsetNsProp		(xmlNodePtr node,
-					 xmlNsPtr ns,
-					 const xmlChar *name);
-XMLPUBFUN int XMLCALL		
-		xmlUnsetProp		(xmlNodePtr node,
-					 const xmlChar *name);
-#endif /* defined(LIBXML_TREE_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED) */
-
-/*
- * Internal, don't use.
- */
-XMLPUBFUN void XMLCALL		
-		xmlBufferWriteCHAR	(xmlBufferPtr buf,
-					 const xmlChar *string);
-XMLPUBFUN void XMLCALL		
-		xmlBufferWriteChar	(xmlBufferPtr buf,
-					 const char *string);
-XMLPUBFUN void XMLCALL		
-		xmlBufferWriteQuotedString(xmlBufferPtr buf,
-					 const xmlChar *string);
-
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void xmlAttrSerializeTxtContent(xmlBufferPtr buf,
-					 xmlDocPtr doc,
-					 xmlAttrPtr attr,
-					 const xmlChar *string);
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-#ifdef LIBXML_TREE_ENABLED
-/*
- * Namespace handling.
- */
-XMLPUBFUN int XMLCALL		
-		xmlReconciliateNs	(xmlDocPtr doc,
-					 xmlNodePtr tree);
-#endif
-
-#ifdef LIBXML_OUTPUT_ENABLED
-/*
- * Saving.
- */
-XMLPUBFUN void XMLCALL		
-		xmlDocDumpFormatMemory	(xmlDocPtr cur,
-					 xmlChar **mem,
-					 int *size,
-					 int format);
-XMLPUBFUN void XMLCALL		
-		xmlDocDumpMemory	(xmlDocPtr cur,
-					 xmlChar **mem,
-					 int *size);
-XMLPUBFUN void XMLCALL		
-		xmlDocDumpMemoryEnc	(xmlDocPtr out_doc,
-					 xmlChar **doc_txt_ptr,
-					 int * doc_txt_len,
-					 const char *txt_encoding);
-XMLPUBFUN void XMLCALL		
-		xmlDocDumpFormatMemoryEnc(xmlDocPtr out_doc,
-					 xmlChar **doc_txt_ptr,
-					 int * doc_txt_len,
-					 const char *txt_encoding,
-					 int format);
-XMLPUBFUN int XMLCALL		
-		xmlDocFormatDump	(FILE *f,
-					 xmlDocPtr cur,
-					 int format);
-XMLPUBFUN int XMLCALL	
-		xmlDocDump		(FILE *f,
-					 xmlDocPtr cur);
-XMLPUBFUN void XMLCALL		
-		xmlElemDump		(FILE *f,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur);
-XMLPUBFUN int XMLCALL		
-		xmlSaveFile		(const char *filename,
-					 xmlDocPtr cur);
-XMLPUBFUN int XMLCALL		
-		xmlSaveFormatFile	(const char *filename,
-					 xmlDocPtr cur,
-					 int format);
-XMLPUBFUN int XMLCALL		
-		xmlNodeDump		(xmlBufferPtr buf,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur,
-					 int level,
-					 int format);
-
-XMLPUBFUN int XMLCALL		
-		xmlSaveFileTo		(xmlOutputBufferPtr buf,
-					 xmlDocPtr cur,
-					 const char *encoding);
-XMLPUBFUN int XMLCALL             
-		xmlSaveFormatFileTo     (xmlOutputBufferPtr buf,
-					 xmlDocPtr cur,
-				         const char *encoding,
-				         int format);
-XMLPUBFUN void XMLCALL		
-		xmlNodeDumpOutput	(xmlOutputBufferPtr buf,
-					 xmlDocPtr doc,
-					 xmlNodePtr cur,
-					 int level,
-					 int format,
-					 const char *encoding);
-
-XMLPUBFUN int XMLCALL		
-		xmlSaveFormatFileEnc    (const char *filename,
-					 xmlDocPtr cur,
-					 const char *encoding,
-					 int format);
-
-XMLPUBFUN int XMLCALL		
-		xmlSaveFileEnc		(const char *filename,
-					 xmlDocPtr cur,
-					 const char *encoding);
-
-#endif /* LIBXML_OUTPUT_ENABLED */
-/*
- * XHTML
- */
-XMLPUBFUN int XMLCALL		
-		xmlIsXHTML		(const xmlChar *systemID,
-					 const xmlChar *publicID);
-
-/*
- * Compression.
- */
-XMLPUBFUN int XMLCALL		
-		xmlGetDocCompressMode	(xmlDocPtr doc);
-XMLPUBFUN void XMLCALL		
-		xmlSetDocCompressMode	(xmlDocPtr doc,
-					 int mode);
-XMLPUBFUN int XMLCALL		
-		xmlGetCompressMode	(void);
-XMLPUBFUN void XMLCALL		
-		xmlSetCompressMode	(int mode);
-
-/*
-* DOM-wrapper helper functions.
-*/
-XMLPUBFUN xmlDOMWrapCtxtPtr XMLCALL
-		xmlDOMWrapNewCtxt	(void);
-XMLPUBFUN void XMLCALL
-		xmlDOMWrapFreeCtxt	(xmlDOMWrapCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-	    xmlDOMWrapReconcileNamespaces(xmlDOMWrapCtxtPtr ctxt,
-					 xmlNodePtr elem,
-					 int options);
-XMLPUBFUN int XMLCALL
-	    xmlDOMWrapAdoptNode		(xmlDOMWrapCtxtPtr ctxt,
-					 xmlDocPtr sourceDoc,
-					 xmlNodePtr node,
-					 xmlDocPtr destDoc,		    
-					 xmlNodePtr destParent,
-					 int options);
-XMLPUBFUN int XMLCALL
-	    xmlDOMWrapRemoveNode	(xmlDOMWrapCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr node,
-					 int options);
-XMLPUBFUN int XMLCALL
-	    xmlDOMWrapCloneNode		(xmlDOMWrapCtxtPtr ctxt,
-					 xmlDocPtr sourceDoc,
-					 xmlNodePtr node,
-					 xmlNodePtr *clonedNode,
-					 xmlDocPtr destDoc,
-					 xmlNodePtr destParent,
-					 int deep,
-					 int options);
-
-#ifdef __cplusplus
-}
-#endif
-#ifndef __XML_PARSER_H__
-#include <libxml/xmlmemory.h>
-#endif
-
-#endif /* __XML_TREE_H__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/uri.h igraph-0.6.5/msvc/include/libxml/uri.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/uri.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/uri.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,94 +0,0 @@
-/**
- * Summary: library of generic URI related routines
- * Description: library of generic URI related routines
- *              Implements RFC 2396
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_URI_H__
-#define __XML_URI_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlURI:
- *
- * A parsed URI reference. This is a struct containing the various fields
- * as described in RFC 2396 but separated for further processing.
- *
- * Note: query is a deprecated field which is incorrectly unescaped.
- * query_raw takes precedence over query if the former is set.
- * See: http://mail.gnome.org/archives/xml/2007-April/thread.html#00127
- */
-typedef struct _xmlURI xmlURI;
-typedef xmlURI *xmlURIPtr;
-struct _xmlURI {
-    char *scheme;	/* the URI scheme */
-    char *opaque;	/* opaque part */
-    char *authority;	/* the authority part */
-    char *server;	/* the server part */
-    char *user;		/* the user part */
-    int port;		/* the port number */
-    char *path;		/* the path string */
-    char *query;	/* the query string (deprecated - use with caution) */
-    char *fragment;	/* the fragment identifier */
-    int  cleanup;	/* parsing potentially unclean URI */
-    char *query_raw;	/* the query string (as it appears in the URI) */
-};
-
-/*
- * This function is in tree.h:
- * xmlChar *	xmlNodeGetBase	(xmlDocPtr doc,
- *                               xmlNodePtr cur);
- */
-XMLPUBFUN xmlURIPtr XMLCALL	
-		xmlCreateURI		(void);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlBuildURI		(const xmlChar *URI,
-	                         	 const xmlChar *base);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlBuildRelativeURI	(const xmlChar *URI,
-	                         	 const xmlChar *base);
-XMLPUBFUN xmlURIPtr XMLCALL	
-		xmlParseURI		(const char *str);
-XMLPUBFUN xmlURIPtr XMLCALL	
-		xmlParseURIRaw		(const char *str,
-					 int raw);
-XMLPUBFUN int XMLCALL		
-		xmlParseURIReference	(xmlURIPtr uri,
-					 const char *str);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlSaveUri		(xmlURIPtr uri);
-XMLPUBFUN void XMLCALL		
-		xmlPrintURI		(FILE *stream,
-					 xmlURIPtr uri);
-XMLPUBFUN xmlChar * XMLCALL       
-		xmlURIEscapeStr         (const xmlChar *str,
- 					 const xmlChar *list);
-XMLPUBFUN char * XMLCALL		
-		xmlURIUnescapeString	(const char *str,
-					 int len,
-					 char *target);
-XMLPUBFUN int XMLCALL		
-		xmlNormalizeURIPath	(char *path);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlURIEscape		(const xmlChar *str);
-XMLPUBFUN void XMLCALL		
-		xmlFreeURI		(xmlURIPtr uri);
-XMLPUBFUN xmlChar* XMLCALL	
-		xmlCanonicPath		(const xmlChar *path);
-XMLPUBFUN xmlChar* XMLCALL	
-		xmlPathToURI		(const xmlChar *path);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_URI_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/valid.h igraph-0.6.5/msvc/include/libxml/valid.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/valid.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/valid.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,458 +0,0 @@
-/*
- * Summary: The DTD validation
- * Description: API for the DTD handling and the validity checking
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_VALID_H__
-#define __XML_VALID_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/xmlerror.h>
-#include <libxml/tree.h>
-#include <libxml/list.h>
-#include <libxml/xmlautomata.h>
-#include <libxml/xmlregexp.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Validation state added for non-determinist content model.
- */
-typedef struct _xmlValidState xmlValidState;
-typedef xmlValidState *xmlValidStatePtr;
-
-/**
- * xmlValidityErrorFunc:
- * @ctx:  usually an xmlValidCtxtPtr to a validity error context,
- *        but comes from ctxt->userData (which normally contains such
- *        a pointer); ctxt->userData can be changed by the user.
- * @msg:  the string to format *printf like vararg
- * @...:  remaining arguments to the format
- *
- * Callback called when a validity error is found. This is a message
- * oriented function similar to an *printf function.
- */
-typedef void (XMLCDECL *xmlValidityErrorFunc) (void *ctx,
-			     const char *msg,
-			     ...);
-
-/**
- * xmlValidityWarningFunc:
- * @ctx:  usually an xmlValidCtxtPtr to a validity error context,
- *        but comes from ctxt->userData (which normally contains such
- *        a pointer); ctxt->userData can be changed by the user.
- * @msg:  the string to format *printf like vararg
- * @...:  remaining arguments to the format
- *
- * Callback called when a validity warning is found. This is a message
- * oriented function similar to an *printf function.
- */
-typedef void (XMLCDECL *xmlValidityWarningFunc) (void *ctx,
-			       const char *msg,
-			       ...);
-
-#ifdef IN_LIBXML
-/**
- * XML_CTXT_FINISH_DTD_0:
- *
- * Special value for finishDtd field when embedded in an xmlParserCtxt
- */
-#define XML_CTXT_FINISH_DTD_0 0xabcd1234
-/**
- * XML_CTXT_FINISH_DTD_1:
- *
- * Special value for finishDtd field when embedded in an xmlParserCtxt
- */
-#define XML_CTXT_FINISH_DTD_1 0xabcd1235
-#endif
-
-/*
- * xmlValidCtxt:
- * An xmlValidCtxt is used for error reporting when validating.
- */
-typedef struct _xmlValidCtxt xmlValidCtxt;
-typedef xmlValidCtxt *xmlValidCtxtPtr;
-struct _xmlValidCtxt {
-    void *userData;			/* user specific data block */
-    xmlValidityErrorFunc error;		/* the callback in case of errors */
-    xmlValidityWarningFunc warning;	/* the callback in case of warning */
-
-    /* Node analysis stack used when validating within entities */
-    xmlNodePtr         node;          /* Current parsed Node */
-    int                nodeNr;        /* Depth of the parsing stack */
-    int                nodeMax;       /* Max depth of the parsing stack */
-    xmlNodePtr        *nodeTab;       /* array of nodes */
-
-    unsigned int     finishDtd;       /* finished validating the Dtd ? */
-    xmlDocPtr              doc;       /* the document */
-    int                  valid;       /* temporary validity check result */
-
-    /* state state used for non-determinist content validation */
-    xmlValidState     *vstate;        /* current state */
-    int                vstateNr;      /* Depth of the validation stack */
-    int                vstateMax;     /* Max depth of the validation stack */
-    xmlValidState     *vstateTab;     /* array of validation states */
-
-#ifdef LIBXML_REGEXP_ENABLED
-    xmlAutomataPtr            am;     /* the automata */
-    xmlAutomataStatePtr    state;     /* used to build the automata */
-#else
-    void                     *am;
-    void                  *state;
-#endif
-};
-
-/*
- * ALL notation declarations are stored in a table.
- * There is one table per DTD.
- */
-
-typedef struct _xmlHashTable xmlNotationTable;
-typedef xmlNotationTable *xmlNotationTablePtr;
-
-/*
- * ALL element declarations are stored in a table.
- * There is one table per DTD.
- */
-
-typedef struct _xmlHashTable xmlElementTable;
-typedef xmlElementTable *xmlElementTablePtr;
-
-/*
- * ALL attribute declarations are stored in a table.
- * There is one table per DTD.
- */
-
-typedef struct _xmlHashTable xmlAttributeTable;
-typedef xmlAttributeTable *xmlAttributeTablePtr;
-
-/*
- * ALL IDs attributes are stored in a table.
- * There is one table per document.
- */
-
-typedef struct _xmlHashTable xmlIDTable;
-typedef xmlIDTable *xmlIDTablePtr;
-
-/*
- * ALL Refs attributes are stored in a table.
- * There is one table per document.
- */
-
-typedef struct _xmlHashTable xmlRefTable;
-typedef xmlRefTable *xmlRefTablePtr;
-
-/* Notation */
-XMLPUBFUN xmlNotationPtr XMLCALL	    
-		xmlAddNotationDecl	(xmlValidCtxtPtr ctxt,
-					 xmlDtdPtr dtd,
-					 const xmlChar *name,
-					 const xmlChar *PublicID,
-					 const xmlChar *SystemID);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlNotationTablePtr XMLCALL 
-		xmlCopyNotationTable	(xmlNotationTablePtr table);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL		    
-		xmlFreeNotationTable	(xmlNotationTablePtr table);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		    
-		xmlDumpNotationDecl	(xmlBufferPtr buf,
-					 xmlNotationPtr nota);
-XMLPUBFUN void XMLCALL		    
-		xmlDumpNotationTable	(xmlBufferPtr buf,
-					 xmlNotationTablePtr table);
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-/* Element Content */
-/* the non Doc version are being deprecated */
-XMLPUBFUN xmlElementContentPtr XMLCALL 
-		xmlNewElementContent	(const xmlChar *name,
-					 xmlElementContentType type);
-XMLPUBFUN xmlElementContentPtr XMLCALL 
-		xmlCopyElementContent	(xmlElementContentPtr content);
-XMLPUBFUN void XMLCALL		     
-		xmlFreeElementContent	(xmlElementContentPtr cur);
-/* the new versions with doc argument */
-XMLPUBFUN xmlElementContentPtr XMLCALL 
-		xmlNewDocElementContent	(xmlDocPtr doc,
-					 const xmlChar *name,
-					 xmlElementContentType type);
-XMLPUBFUN xmlElementContentPtr XMLCALL 
-		xmlCopyDocElementContent(xmlDocPtr doc,
-					 xmlElementContentPtr content);
-XMLPUBFUN void XMLCALL		     
-		xmlFreeDocElementContent(xmlDocPtr doc,
-					 xmlElementContentPtr cur);
-XMLPUBFUN void XMLCALL		     
-		xmlSnprintfElementContent(char *buf,
-					 int size,
-	                                 xmlElementContentPtr content,
-					 int englob);
-#ifdef LIBXML_OUTPUT_ENABLED
-/* DEPRECATED */
-XMLPUBFUN void XMLCALL		     
-		xmlSprintfElementContent(char *buf,
-	                                 xmlElementContentPtr content,
-					 int englob);
-#endif /* LIBXML_OUTPUT_ENABLED */
-/* DEPRECATED */
-
-/* Element */
-XMLPUBFUN xmlElementPtr XMLCALL	   
-		xmlAddElementDecl	(xmlValidCtxtPtr ctxt,
-					 xmlDtdPtr dtd,
-					 const xmlChar *name,
-					 xmlElementTypeVal type,
-					 xmlElementContentPtr content);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlElementTablePtr XMLCALL 
-		xmlCopyElementTable	(xmlElementTablePtr table);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL		   
-		xmlFreeElementTable	(xmlElementTablePtr table);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		   
-		xmlDumpElementTable	(xmlBufferPtr buf,
-					 xmlElementTablePtr table);
-XMLPUBFUN void XMLCALL		   
-		xmlDumpElementDecl	(xmlBufferPtr buf,
-					 xmlElementPtr elem);
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-/* Enumeration */
-XMLPUBFUN xmlEnumerationPtr XMLCALL 
-		xmlCreateEnumeration	(const xmlChar *name);
-XMLPUBFUN void XMLCALL		   
-		xmlFreeEnumeration	(xmlEnumerationPtr cur);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlEnumerationPtr XMLCALL  
-		xmlCopyEnumeration	(xmlEnumerationPtr cur);
-#endif /* LIBXML_TREE_ENABLED */
-
-/* Attribute */
-XMLPUBFUN xmlAttributePtr XMLCALL	    
-		xmlAddAttributeDecl	(xmlValidCtxtPtr ctxt,
-					 xmlDtdPtr dtd,
-					 const xmlChar *elem,
-					 const xmlChar *name,
-					 const xmlChar *ns,
-					 xmlAttributeType type,
-					 xmlAttributeDefault def,
-					 const xmlChar *defaultValue,
-					 xmlEnumerationPtr tree);
-#ifdef LIBXML_TREE_ENABLED
-XMLPUBFUN xmlAttributeTablePtr XMLCALL 
-		xmlCopyAttributeTable  (xmlAttributeTablePtr table);
-#endif /* LIBXML_TREE_ENABLED */
-XMLPUBFUN void XMLCALL		     
-		xmlFreeAttributeTable  (xmlAttributeTablePtr table);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL		     
-		xmlDumpAttributeTable  (xmlBufferPtr buf,
-					xmlAttributeTablePtr table);
-XMLPUBFUN void XMLCALL		     
-		xmlDumpAttributeDecl   (xmlBufferPtr buf,
-					xmlAttributePtr attr);
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-/* IDs */
-XMLPUBFUN xmlIDPtr XMLCALL	
-		xmlAddID	       (xmlValidCtxtPtr ctxt,
-					xmlDocPtr doc,
-					const xmlChar *value,
-					xmlAttrPtr attr);
-XMLPUBFUN void XMLCALL		
-		xmlFreeIDTable	       (xmlIDTablePtr table);
-XMLPUBFUN xmlAttrPtr XMLCALL	
-		xmlGetID	       (xmlDocPtr doc,
-					const xmlChar *ID);
-XMLPUBFUN int XMLCALL		
-		xmlIsID		       (xmlDocPtr doc,
-					xmlNodePtr elem,
-					xmlAttrPtr attr);
-XMLPUBFUN int XMLCALL		
-		xmlRemoveID	       (xmlDocPtr doc, 
-					xmlAttrPtr attr);
-
-/* IDREFs */
-XMLPUBFUN xmlRefPtr XMLCALL	
-		xmlAddRef	       (xmlValidCtxtPtr ctxt,
-					xmlDocPtr doc,
-					const xmlChar *value,
-					xmlAttrPtr attr);
-XMLPUBFUN void XMLCALL		
-		xmlFreeRefTable	       (xmlRefTablePtr table);
-XMLPUBFUN int XMLCALL		
-		xmlIsRef	       (xmlDocPtr doc,
-					xmlNodePtr elem,
-					xmlAttrPtr attr);
-XMLPUBFUN int XMLCALL		
-		xmlRemoveRef	       (xmlDocPtr doc, 
-					xmlAttrPtr attr);
-XMLPUBFUN xmlListPtr XMLCALL	
-		xmlGetRefs	       (xmlDocPtr doc,
-					const xmlChar *ID);
-
-/**
- * The public function calls related to validity checking.
- */
-#ifdef LIBXML_VALID_ENABLED
-/* Allocate/Release Validation Contexts */
-XMLPUBFUN xmlValidCtxtPtr XMLCALL	    
-		xmlNewValidCtxt(void);
-XMLPUBFUN void XMLCALL		    
-		xmlFreeValidCtxt(xmlValidCtxtPtr);
-
-XMLPUBFUN int XMLCALL		
-		xmlValidateRoot		(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc);
-XMLPUBFUN int XMLCALL		
-		xmlValidateElementDecl	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-		                         xmlElementPtr elem);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlValidNormalizeAttributeValue(xmlDocPtr doc,
-					 xmlNodePtr elem,
-					 const xmlChar *name,
-					 const xmlChar *value);
-XMLPUBFUN xmlChar * XMLCALL	
-		xmlValidCtxtNormalizeAttributeValue(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem,
-					 const xmlChar *name,
-					 const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateAttributeDecl(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-		                         xmlAttributePtr attr);
-XMLPUBFUN int XMLCALL		
-		xmlValidateAttributeValue(xmlAttributeType type,
-					 const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNotationDecl	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-		                         xmlNotationPtr nota);
-XMLPUBFUN int XMLCALL		
-		xmlValidateDtd		(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlDtdPtr dtd);
-XMLPUBFUN int XMLCALL		
-		xmlValidateDtdFinal	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc);
-XMLPUBFUN int XMLCALL		
-		xmlValidateDocument	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc);
-XMLPUBFUN int XMLCALL		
-		xmlValidateElement	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem);
-XMLPUBFUN int XMLCALL		
-		xmlValidateOneElement	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-		                         xmlNodePtr elem);
-XMLPUBFUN int XMLCALL	
-		xmlValidateOneAttribute	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr	elem,
-					 xmlAttrPtr attr,
-					 const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateOneNamespace	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem,
-					 const xmlChar *prefix,
-					 xmlNsPtr ns,
-					 const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateDocumentFinal(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc);
-#endif /* LIBXML_VALID_ENABLED */
-
-#if defined(LIBXML_VALID_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN int XMLCALL		
-		xmlValidateNotationUse	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 const xmlChar *notationName);
-#endif /* LIBXML_VALID_ENABLED or LIBXML_SCHEMAS_ENABLED */
-
-XMLPUBFUN int XMLCALL		
-		xmlIsMixedElement	(xmlDocPtr doc,
-					 const xmlChar *name);
-XMLPUBFUN xmlAttributePtr XMLCALL	
-		xmlGetDtdAttrDesc	(xmlDtdPtr dtd,
-					 const xmlChar *elem,
-					 const xmlChar *name);
-XMLPUBFUN xmlAttributePtr XMLCALL	
-		xmlGetDtdQAttrDesc	(xmlDtdPtr dtd,
-					 const xmlChar *elem,
-					 const xmlChar *name,
-					 const xmlChar *prefix);
-XMLPUBFUN xmlNotationPtr XMLCALL	
-		xmlGetDtdNotationDesc	(xmlDtdPtr dtd,
-					 const xmlChar *name);
-XMLPUBFUN xmlElementPtr XMLCALL	
-		xmlGetDtdQElementDesc	(xmlDtdPtr dtd,
-					 const xmlChar *name,
-					 const xmlChar *prefix);
-XMLPUBFUN xmlElementPtr XMLCALL	
-		xmlGetDtdElementDesc	(xmlDtdPtr dtd,
-					 const xmlChar *name);
-
-#ifdef LIBXML_VALID_ENABLED
-
-XMLPUBFUN int XMLCALL		
-		xmlValidGetPotentialChildren(xmlElementContent *ctree,
-					 const xmlChar **names,
-					 int *len,
-					 int max);
-
-XMLPUBFUN int XMLCALL		
-		xmlValidGetValidElements(xmlNode *prev,
-					 xmlNode *next,
-					 const xmlChar **names,
-					 int max);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNameValue	(const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNamesValue	(const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNmtokenValue	(const xmlChar *value);
-XMLPUBFUN int XMLCALL		
-		xmlValidateNmtokensValue(const xmlChar *value);
-
-#ifdef LIBXML_REGEXP_ENABLED
-/*
- * Validation based on the regexp support
- */
-XMLPUBFUN int XMLCALL		
-		xmlValidBuildContentModel(xmlValidCtxtPtr ctxt,
-					 xmlElementPtr elem);
-
-XMLPUBFUN int XMLCALL		
-		xmlValidatePushElement	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem,
-					 const xmlChar *qname);
-XMLPUBFUN int XMLCALL		
-		xmlValidatePushCData	(xmlValidCtxtPtr ctxt,
-					 const xmlChar *data,
-					 int len);
-XMLPUBFUN int XMLCALL		
-		xmlValidatePopElement	(xmlValidCtxtPtr ctxt,
-					 xmlDocPtr doc,
-					 xmlNodePtr elem,
-					 const xmlChar *qname);
-#endif /* LIBXML_REGEXP_ENABLED */
-#endif /* LIBXML_VALID_ENABLED */
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_VALID_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xinclude.h igraph-0.6.5/msvc/include/libxml/xinclude.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xinclude.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xinclude.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,125 +0,0 @@
-/*
- * Summary: implementation of XInclude
- * Description: API to handle XInclude processing,
- * implements the
- * World Wide Web Consortium Last Call Working Draft 10 November 2003
- * http://www.w3.org/TR/2003/WD-xinclude-20031110
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XINCLUDE_H__
-#define __XML_XINCLUDE_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef LIBXML_XINCLUDE_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * XINCLUDE_NS:
- *
- * Macro defining the Xinclude namespace: http://www.w3.org/2003/XInclude
- */
-#define XINCLUDE_NS (const xmlChar *) "http://www.w3.org/2003/XInclude"
-/**
- * XINCLUDE_OLD_NS:
- *
- * Macro defining the draft Xinclude namespace: http://www.w3.org/2001/XInclude
- */
-#define XINCLUDE_OLD_NS (const xmlChar *) "http://www.w3.org/2001/XInclude"
-/**
- * XINCLUDE_NODE:
- *
- * Macro defining "include"
- */
-#define XINCLUDE_NODE (const xmlChar *) "include"
-/**
- * XINCLUDE_FALLBACK:
- *
- * Macro defining "fallback"
- */
-#define XINCLUDE_FALLBACK (const xmlChar *) "fallback"
-/**
- * XINCLUDE_HREF:
- *
- * Macro defining "href"
- */
-#define XINCLUDE_HREF (const xmlChar *) "href"
-/**
- * XINCLUDE_PARSE:
- *
- * Macro defining "parse"
- */
-#define XINCLUDE_PARSE (const xmlChar *) "parse"
-/**
- * XINCLUDE_PARSE_XML:
- *
- * Macro defining "xml"
- */
-#define XINCLUDE_PARSE_XML (const xmlChar *) "xml"
-/**
- * XINCLUDE_PARSE_TEXT:
- *
- * Macro defining "text"
- */
-#define XINCLUDE_PARSE_TEXT (const xmlChar *) "text"
-/**
- * XINCLUDE_PARSE_ENCODING:
- *
- * Macro defining "encoding"
- */
-#define XINCLUDE_PARSE_ENCODING (const xmlChar *) "encoding"
-/**
- * XINCLUDE_PARSE_XPOINTER:
- *
- * Macro defining "xpointer"
- */
-#define XINCLUDE_PARSE_XPOINTER (const xmlChar *) "xpointer"
-
-typedef struct _xmlXIncludeCtxt xmlXIncludeCtxt;
-typedef xmlXIncludeCtxt *xmlXIncludeCtxtPtr;
-
-/*
- * standalone processing
- */
-XMLPUBFUN int XMLCALL	
-		xmlXIncludeProcess	(xmlDocPtr doc);
-XMLPUBFUN int XMLCALL	
-		xmlXIncludeProcessFlags	(xmlDocPtr doc,
-					 int flags);
-XMLPUBFUN int XMLCALL	
-		xmlXIncludeProcessFlagsData(xmlDocPtr doc,
-					 int flags,
-					 void *data);
-XMLPUBFUN int XMLCALL	
-		xmlXIncludeProcessTree	(xmlNodePtr tree);
-XMLPUBFUN int XMLCALL	
-		xmlXIncludeProcessTreeFlags(xmlNodePtr tree,
-					 int flags);
-/*
- * contextual processing
- */
-XMLPUBFUN xmlXIncludeCtxtPtr XMLCALL
-		xmlXIncludeNewContext	(xmlDocPtr doc);
-XMLPUBFUN int XMLCALL
-		xmlXIncludeSetFlags	(xmlXIncludeCtxtPtr ctxt,
-					 int flags);
-XMLPUBFUN void XMLCALL
-		xmlXIncludeFreeContext	(xmlXIncludeCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-		xmlXIncludeProcessNode	(xmlXIncludeCtxtPtr ctxt,
-					 xmlNodePtr tree);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_XINCLUDE_ENABLED */
-
-#endif /* __XML_XINCLUDE_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xlink.h igraph-0.6.5/msvc/include/libxml/xlink.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xlink.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xlink.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,189 +0,0 @@
-/*
- * Summary: unfinished XLink detection module
- * Description: unfinished XLink detection module
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XLINK_H__
-#define __XML_XLINK_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef LIBXML_XPTR_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * Various defines for the various Link properties.
- *
- * NOTE: the link detection layer will try to resolve QName expansion
- *       of namespaces. If "foo" is the prefix for "http://foo.com/"
- *       then the link detection layer will expand role="foo:myrole"
- *       to "http://foo.com/:myrole".
- * NOTE: the link detection layer will expand URI-Refences found on
- *       href attributes by using the base mechanism if found.
- */
-typedef xmlChar *xlinkHRef;
-typedef xmlChar *xlinkRole;
-typedef xmlChar *xlinkTitle;
-
-typedef enum {
-    XLINK_TYPE_NONE = 0,
-    XLINK_TYPE_SIMPLE,
-    XLINK_TYPE_EXTENDED,
-    XLINK_TYPE_EXTENDED_SET
-} xlinkType;
-
-typedef enum {
-    XLINK_SHOW_NONE = 0,
-    XLINK_SHOW_NEW,
-    XLINK_SHOW_EMBED,
-    XLINK_SHOW_REPLACE
-} xlinkShow;
-
-typedef enum {
-    XLINK_ACTUATE_NONE = 0,
-    XLINK_ACTUATE_AUTO,
-    XLINK_ACTUATE_ONREQUEST
-} xlinkActuate;
-
-/**
- * xlinkNodeDetectFunc:
- * @ctx:  user data pointer
- * @node:  the node to check
- * 
- * This is the prototype for the link detection routine.
- * It calls the default link detection callbacks upon link detection.
- */
-typedef void (*xlinkNodeDetectFunc) (void *ctx, xmlNodePtr node);
-
-/*
- * The link detection module interact with the upper layers using
- * a set of callback registered at parsing time.
- */
-
-/**
- * xlinkSimpleLinkFunk:
- * @ctx:  user data pointer
- * @node:  the node carrying the link
- * @href:  the target of the link
- * @role:  the role string
- * @title:  the link title
- *
- * This is the prototype for a simple link detection callback.
- */
-typedef void
-(*xlinkSimpleLinkFunk)	(void *ctx,
-			 xmlNodePtr node,
-			 const xlinkHRef href,
-			 const xlinkRole role,
-			 const xlinkTitle title);
-
-/**
- * xlinkExtendedLinkFunk:
- * @ctx:  user data pointer
- * @node:  the node carrying the link
- * @nbLocators: the number of locators detected on the link
- * @hrefs:  pointer to the array of locator hrefs
- * @roles:  pointer to the array of locator roles
- * @nbArcs: the number of arcs detected on the link
- * @from:  pointer to the array of source roles found on the arcs
- * @to:  pointer to the array of target roles found on the arcs
- * @show:  array of values for the show attributes found on the arcs
- * @actuate:  array of values for the actuate attributes found on the arcs
- * @nbTitles: the number of titles detected on the link
- * @title:  array of titles detected on the link
- * @langs:  array of xml:lang values for the titles
- *
- * This is the prototype for a extended link detection callback.
- */
-typedef void
-(*xlinkExtendedLinkFunk)(void *ctx,
-			 xmlNodePtr node,
-			 int nbLocators,
-			 const xlinkHRef *hrefs,
-			 const xlinkRole *roles,
-			 int nbArcs,
-			 const xlinkRole *from,
-			 const xlinkRole *to,
-			 xlinkShow *show,
-			 xlinkActuate *actuate,
-			 int nbTitles,
-			 const xlinkTitle *titles,
-			 const xmlChar **langs);
-
-/**
- * xlinkExtendedLinkSetFunk:
- * @ctx:  user data pointer
- * @node:  the node carrying the link
- * @nbLocators: the number of locators detected on the link
- * @hrefs:  pointer to the array of locator hrefs
- * @roles:  pointer to the array of locator roles
- * @nbTitles: the number of titles detected on the link
- * @title:  array of titles detected on the link
- * @langs:  array of xml:lang values for the titles
- *
- * This is the prototype for a extended link set detection callback.
- */
-typedef void
-(*xlinkExtendedLinkSetFunk)	(void *ctx,
-				 xmlNodePtr node,
-				 int nbLocators,
-				 const xlinkHRef *hrefs,
-				 const xlinkRole *roles,
-				 int nbTitles,
-				 const xlinkTitle *titles,
-				 const xmlChar **langs);
-
-/**
- * This is the structure containing a set of Links detection callbacks.
- *
- * There is no default xlink callbacks, if one want to get link
- * recognition activated, those call backs must be provided before parsing.
- */
-typedef struct _xlinkHandler xlinkHandler;
-typedef xlinkHandler *xlinkHandlerPtr;
-struct _xlinkHandler {
-    xlinkSimpleLinkFunk simple;
-    xlinkExtendedLinkFunk extended;
-    xlinkExtendedLinkSetFunk set;
-};
-
-/*
- * The default detection routine, can be overridden, they call the default
- * detection callbacks. 
- */
-
-XMLPUBFUN xlinkNodeDetectFunc XMLCALL	
-		xlinkGetDefaultDetect	(void);
-XMLPUBFUN void XMLCALL			
-		xlinkSetDefaultDetect	(xlinkNodeDetectFunc func);
-
-/*
- * Routines to set/get the default handlers.
- */
-XMLPUBFUN xlinkHandlerPtr XMLCALL	
-		xlinkGetDefaultHandler	(void);
-XMLPUBFUN void XMLCALL		
-		xlinkSetDefaultHandler	(xlinkHandlerPtr handler);
-
-/*
- * Link detection module itself.
- */
-XMLPUBFUN xlinkType XMLCALL	 
-		xlinkIsLink		(xmlDocPtr doc,
-					 xmlNodePtr node);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_XPTR_ENABLED */
-
-#endif /* __XML_XLINK_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlIO.h igraph-0.6.5/msvc/include/libxml/xmlIO.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlIO.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlIO.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,360 +0,0 @@
-/*
- * Summary: interface for the I/O interfaces used by the parser
- * Description: interface for the I/O interfaces used by the parser
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_IO_H__
-#define __XML_IO_H__
-
-#include <stdio.h>
-#include <libxml/xmlversion.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * Those are the functions and datatypes for the parser input
- * I/O structures.
- */
-
-/**
- * xmlInputMatchCallback:
- * @filename: the filename or URI
- *
- * Callback used in the I/O Input API to detect if the current handler 
- * can provide input fonctionnalities for this resource.
- *
- * Returns 1 if yes and 0 if another Input module should be used
- */
-typedef int (XMLCALL *xmlInputMatchCallback) (char const *filename);
-/**
- * xmlInputOpenCallback:
- * @filename: the filename or URI
- *
- * Callback used in the I/O Input API to open the resource
- *
- * Returns an Input context or NULL in case or error
- */
-typedef void * (XMLCALL *xmlInputOpenCallback) (char const *filename);
-/**
- * xmlInputReadCallback:
- * @context:  an Input context
- * @buffer:  the buffer to store data read
- * @len:  the length of the buffer in bytes
- *
- * Callback used in the I/O Input API to read the resource
- *
- * Returns the number of bytes read or -1 in case of error
- */
-typedef int (XMLCALL *xmlInputReadCallback) (void * context, char * buffer, int len);
-/**
- * xmlInputCloseCallback:
- * @context:  an Input context
- *
- * Callback used in the I/O Input API to close the resource
- *
- * Returns 0 or -1 in case of error
- */
-typedef int (XMLCALL *xmlInputCloseCallback) (void * context);
-
-#ifdef LIBXML_OUTPUT_ENABLED
-/*
- * Those are the functions and datatypes for the library output
- * I/O structures.
- */
-
-/**
- * xmlOutputMatchCallback:
- * @filename: the filename or URI
- *
- * Callback used in the I/O Output API to detect if the current handler 
- * can provide output fonctionnalities for this resource.
- *
- * Returns 1 if yes and 0 if another Output module should be used
- */
-typedef int (XMLCALL *xmlOutputMatchCallback) (char const *filename);
-/**
- * xmlOutputOpenCallback:
- * @filename: the filename or URI
- *
- * Callback used in the I/O Output API to open the resource
- *
- * Returns an Output context or NULL in case or error
- */
-typedef void * (XMLCALL *xmlOutputOpenCallback) (char const *filename);
-/**
- * xmlOutputWriteCallback:
- * @context:  an Output context
- * @buffer:  the buffer of data to write
- * @len:  the length of the buffer in bytes
- *
- * Callback used in the I/O Output API to write to the resource
- *
- * Returns the number of bytes written or -1 in case of error
- */
-typedef int (XMLCALL *xmlOutputWriteCallback) (void * context, const char * buffer,
-                                       int len);
-/**
- * xmlOutputCloseCallback:
- * @context:  an Output context
- *
- * Callback used in the I/O Output API to close the resource
- *
- * Returns 0 or -1 in case of error
- */
-typedef int (XMLCALL *xmlOutputCloseCallback) (void * context);
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-#ifdef __cplusplus
-}
-#endif
-
-#include <libxml/globals.h>
-#include <libxml/tree.h>
-#include <libxml/parser.h>
-#include <libxml/encoding.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-struct _xmlParserInputBuffer {
-    void*                  context;
-    xmlInputReadCallback   readcallback;
-    xmlInputCloseCallback  closecallback;
-    
-    xmlCharEncodingHandlerPtr encoder; /* I18N conversions to UTF-8 */
-    
-    xmlBufferPtr buffer;    /* Local buffer encoded in UTF-8 */
-    xmlBufferPtr raw;       /* if encoder != NULL buffer for raw input */
-    int	compressed;	    /* -1=unknown, 0=not compressed, 1=compressed */
-    int error;
-    unsigned long rawconsumed;/* amount consumed from raw */
-};
-
-
-#ifdef LIBXML_OUTPUT_ENABLED
-struct _xmlOutputBuffer {
-    void*                   context;
-    xmlOutputWriteCallback  writecallback;
-    xmlOutputCloseCallback  closecallback;
-    
-    xmlCharEncodingHandlerPtr encoder; /* I18N conversions to UTF-8 */
-    
-    xmlBufferPtr buffer;    /* Local buffer encoded in UTF-8 or ISOLatin */
-    xmlBufferPtr conv;      /* if encoder != NULL buffer for output */
-    int written;            /* total number of byte written */
-    int error;
-};
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-/*
- * Interfaces for input
- */
-XMLPUBFUN void XMLCALL	
-	xmlCleanupInputCallbacks		(void);
-
-XMLPUBFUN int XMLCALL
-	xmlPopInputCallbacks			(void);
-
-XMLPUBFUN void XMLCALL	
-	xmlRegisterDefaultInputCallbacks	(void);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlAllocParserInputBuffer		(xmlCharEncoding enc);
-
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateFilename	(const char *URI,
-                                                 xmlCharEncoding enc);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateFile		(FILE *file,
-                                                 xmlCharEncoding enc);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateFd		(int fd,
-	                                         xmlCharEncoding enc);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateMem		(const char *mem, int size,
-	                                         xmlCharEncoding enc);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateStatic	(const char *mem, int size,
-	                                         xmlCharEncoding enc);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-	xmlParserInputBufferCreateIO		(xmlInputReadCallback   ioread,
-						 xmlInputCloseCallback  ioclose,
-						 void *ioctx,
-	                                         xmlCharEncoding enc);
-XMLPUBFUN int XMLCALL	
-	xmlParserInputBufferRead		(xmlParserInputBufferPtr in,
-						 int len);
-XMLPUBFUN int XMLCALL	
-	xmlParserInputBufferGrow		(xmlParserInputBufferPtr in,
-						 int len);
-XMLPUBFUN int XMLCALL	
-	xmlParserInputBufferPush		(xmlParserInputBufferPtr in,
-						 int len,
-						 const char *buf);
-XMLPUBFUN void XMLCALL	
-	xmlFreeParserInputBuffer		(xmlParserInputBufferPtr in);
-XMLPUBFUN char * XMLCALL	
-	xmlParserGetDirectory			(const char *filename);
-
-XMLPUBFUN int XMLCALL     
-	xmlRegisterInputCallbacks		(xmlInputMatchCallback matchFunc,
-						 xmlInputOpenCallback openFunc,
-						 xmlInputReadCallback readFunc,
-						 xmlInputCloseCallback closeFunc);
-
-xmlParserInputBufferPtr
-	__xmlParserInputBufferCreateFilename(const char *URI,
-										xmlCharEncoding enc);
-
-#ifdef LIBXML_OUTPUT_ENABLED
-/*
- * Interfaces for output
- */
-XMLPUBFUN void XMLCALL	
-	xmlCleanupOutputCallbacks		(void);
-XMLPUBFUN void XMLCALL	
-	xmlRegisterDefaultOutputCallbacks(void);
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlAllocOutputBuffer		(xmlCharEncodingHandlerPtr encoder);
-
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlOutputBufferCreateFilename	(const char *URI,
-					 xmlCharEncodingHandlerPtr encoder,
-					 int compression);
-
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlOutputBufferCreateFile	(FILE *file,
-					 xmlCharEncodingHandlerPtr encoder);
-
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlOutputBufferCreateBuffer	(xmlBufferPtr buffer,
-					 xmlCharEncodingHandlerPtr encoder);
-
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlOutputBufferCreateFd		(int fd,
-					 xmlCharEncodingHandlerPtr encoder);
-
-XMLPUBFUN xmlOutputBufferPtr XMLCALL
-	xmlOutputBufferCreateIO		(xmlOutputWriteCallback   iowrite,
-					 xmlOutputCloseCallback  ioclose,
-					 void *ioctx,
-					 xmlCharEncodingHandlerPtr encoder);
-
-XMLPUBFUN int XMLCALL	
-	xmlOutputBufferWrite		(xmlOutputBufferPtr out,
-					 int len,
-					 const char *buf);
-XMLPUBFUN int XMLCALL	
-	xmlOutputBufferWriteString	(xmlOutputBufferPtr out,
-					 const char *str);
-XMLPUBFUN int XMLCALL	
-	xmlOutputBufferWriteEscape	(xmlOutputBufferPtr out,
-					 const xmlChar *str,
-					 xmlCharEncodingOutputFunc escaping);
-
-XMLPUBFUN int XMLCALL	
-	xmlOutputBufferFlush		(xmlOutputBufferPtr out);
-XMLPUBFUN int XMLCALL	
-	xmlOutputBufferClose		(xmlOutputBufferPtr out);
-
-XMLPUBFUN int XMLCALL     
-	xmlRegisterOutputCallbacks	(xmlOutputMatchCallback matchFunc,
-					 xmlOutputOpenCallback openFunc,
-					 xmlOutputWriteCallback writeFunc,
-					 xmlOutputCloseCallback closeFunc);
-
-xmlOutputBufferPtr
-	__xmlOutputBufferCreateFilename(const char *URI,
-                              xmlCharEncodingHandlerPtr encoder,
-                              int compression);
-
-#ifdef LIBXML_HTTP_ENABLED
-/*  This function only exists if HTTP support built into the library  */
-XMLPUBFUN void XMLCALL	
-	xmlRegisterHTTPPostCallbacks	(void );
-#endif /* LIBXML_HTTP_ENABLED */
-	
-#endif /* LIBXML_OUTPUT_ENABLED */
-
-XMLPUBFUN xmlParserInputPtr XMLCALL
-	xmlCheckHTTPInput		(xmlParserCtxtPtr ctxt,
-					 xmlParserInputPtr ret);
-
-/*
- * A predefined entity loader disabling network accesses
- */
-XMLPUBFUN xmlParserInputPtr XMLCALL 
-	xmlNoNetExternalEntityLoader	(const char *URL,
-					 const char *ID,
-					 xmlParserCtxtPtr ctxt);
-
-/* 
- * xmlNormalizeWindowsPath is obsolete, don't use it. 
- * Check xmlCanonicPath in uri.h for a better alternative.
- */
-XMLPUBFUN xmlChar * XMLCALL 
-	xmlNormalizeWindowsPath		(const xmlChar *path);
-
-XMLPUBFUN int XMLCALL	
-	xmlCheckFilename		(const char *path);
-/**
- * Default 'file://' protocol callbacks 
- */
-XMLPUBFUN int XMLCALL	
-	xmlFileMatch 			(const char *filename);
-XMLPUBFUN void * XMLCALL	
-	xmlFileOpen 			(const char *filename);
-XMLPUBFUN int XMLCALL	
-	xmlFileRead 			(void * context, 
-					 char * buffer, 
-					 int len);
-XMLPUBFUN int XMLCALL	
-	xmlFileClose 			(void * context);
-
-/**
- * Default 'http://' protocol callbacks 
- */
-#ifdef LIBXML_HTTP_ENABLED
-XMLPUBFUN int XMLCALL	
-	xmlIOHTTPMatch 			(const char *filename);
-XMLPUBFUN void * XMLCALL	
-	xmlIOHTTPOpen 			(const char *filename);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void * XMLCALL	
-	xmlIOHTTPOpenW			(const char * post_uri,
-					 int   compression );
-#endif /* LIBXML_OUTPUT_ENABLED */
-XMLPUBFUN int XMLCALL 	
-	xmlIOHTTPRead			(void * context, 
-					 char * buffer, 
-					 int len);
-XMLPUBFUN int XMLCALL	
-	xmlIOHTTPClose 			(void * context);
-#endif /* LIBXML_HTTP_ENABLED */
-
-/**
- * Default 'ftp://' protocol callbacks 
- */
-#ifdef LIBXML_FTP_ENABLED 
-XMLPUBFUN int XMLCALL	
-	xmlIOFTPMatch 			(const char *filename);
-XMLPUBFUN void * XMLCALL	
-	xmlIOFTPOpen 			(const char *filename);
-XMLPUBFUN int XMLCALL 	
-	xmlIOFTPRead			(void * context, 
-					 char * buffer, 
-					 int len);
-XMLPUBFUN int XMLCALL 	
-	xmlIOFTPClose 			(void * context);
-#endif /* LIBXML_FTP_ENABLED */
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* __XML_IO_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlautomata.h igraph-0.6.5/msvc/include/libxml/xmlautomata.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlautomata.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlautomata.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,146 +0,0 @@
-/*
- * Summary: API to build regexp automata
- * Description: the API to build regexp automata
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_AUTOMATA_H__
-#define __XML_AUTOMATA_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-
-#ifdef LIBXML_REGEXP_ENABLED
-#ifdef LIBXML_AUTOMATA_ENABLED
-#include <libxml/xmlregexp.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlAutomataPtr:
- *
- * A libxml automata description, It can be compiled into a regexp
- */
-typedef struct _xmlAutomata xmlAutomata;
-typedef xmlAutomata *xmlAutomataPtr;
-
-/**
- * xmlAutomataStatePtr:
- *
- * A state int the automata description,
- */
-typedef struct _xmlAutomataState xmlAutomataState;
-typedef xmlAutomataState *xmlAutomataStatePtr;
-
-/*
- * Building API
- */
-XMLPUBFUN xmlAutomataPtr XMLCALL		
-		    xmlNewAutomata		(void);
-XMLPUBFUN void XMLCALL			
-		    xmlFreeAutomata		(xmlAutomataPtr am);
-
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataGetInitState	(xmlAutomataPtr am);
-XMLPUBFUN int XMLCALL			
-		    xmlAutomataSetFinalState	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr state);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewState		(xmlAutomataPtr am);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewTransition	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewTransition2	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 const xmlChar *token2,
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL
-                    xmlAutomataNewNegTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 const xmlChar *token2,
-						 void *data);
-
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewCountTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 int min,
-						 int max,
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewCountTrans2	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 const xmlChar *token2,
-						 int min,
-						 int max,
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewOnceTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 const xmlChar *token,
-						 int min,
-						 int max,
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL
-		    xmlAutomataNewOnceTrans2	(xmlAutomataPtr am, 
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to, 
-						 const xmlChar *token,
-						 const xmlChar *token2,
-						 int min, 
-						 int max, 
-						 void *data);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewAllTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 int lax);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewEpsilon	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewCountedTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 int counter);
-XMLPUBFUN xmlAutomataStatePtr XMLCALL	
-		    xmlAutomataNewCounterTrans	(xmlAutomataPtr am,
-						 xmlAutomataStatePtr from,
-						 xmlAutomataStatePtr to,
-						 int counter);
-XMLPUBFUN int XMLCALL			
-		    xmlAutomataNewCounter	(xmlAutomataPtr am,
-						 int min,
-						 int max);
-
-XMLPUBFUN xmlRegexpPtr XMLCALL		
-		    xmlAutomataCompile		(xmlAutomataPtr am);
-XMLPUBFUN int XMLCALL	    		
-		    xmlAutomataIsDeterminist	(xmlAutomataPtr am);
-
-#ifdef __cplusplus
-}
-#endif 
-
-#endif /* LIBXML_AUTOMATA_ENABLED */
-#endif /* LIBXML_REGEXP_ENABLED */
-
-#endif /* __XML_AUTOMATA_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlerror.h igraph-0.6.5/msvc/include/libxml/xmlerror.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlerror.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlerror.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,940 +0,0 @@
-/*
- * Summary: error handling
- * Description: the API used to report errors
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#include <libxml/parser.h>
-
-#ifndef __XML_ERROR_H__
-#define __XML_ERROR_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlErrorLevel:
- *
- * Indicates the level of an error
- */
-typedef enum {
-    XML_ERR_NONE = 0,
-    XML_ERR_WARNING = 1,	/* A simple warning */
-    XML_ERR_ERROR = 2,		/* A recoverable error */
-    XML_ERR_FATAL = 3		/* A fatal error */
-} xmlErrorLevel;
-
-/**
- * xmlErrorDomain:
- *
- * Indicates where an error may have come from
- */
-typedef enum {
-    XML_FROM_NONE = 0,
-    XML_FROM_PARSER,	/* The XML parser */
-    XML_FROM_TREE,	/* The tree module */
-    XML_FROM_NAMESPACE,	/* The XML Namespace module */
-    XML_FROM_DTD,	/* The XML DTD validation with parser context*/
-    XML_FROM_HTML,	/* The HTML parser */
-    XML_FROM_MEMORY,	/* The memory allocator */
-    XML_FROM_OUTPUT,	/* The serialization code */
-    XML_FROM_IO,	/* The Input/Output stack */
-    XML_FROM_FTP,	/* The FTP module */
-    XML_FROM_HTTP,	/* The HTTP module */
-    XML_FROM_XINCLUDE,	/* The XInclude processing */
-    XML_FROM_XPATH,	/* The XPath module */
-    XML_FROM_XPOINTER,	/* The XPointer module */
-    XML_FROM_REGEXP,	/* The regular expressions module */
-    XML_FROM_DATATYPE,	/* The W3C XML Schemas Datatype module */
-    XML_FROM_SCHEMASP,	/* The W3C XML Schemas parser module */
-    XML_FROM_SCHEMASV,	/* The W3C XML Schemas validation module */
-    XML_FROM_RELAXNGP,	/* The Relax-NG parser module */
-    XML_FROM_RELAXNGV,	/* The Relax-NG validator module */
-    XML_FROM_CATALOG,	/* The Catalog module */
-    XML_FROM_C14N,	/* The Canonicalization module */
-    XML_FROM_XSLT,	/* The XSLT engine from libxslt */
-    XML_FROM_VALID,	/* The XML DTD validation with valid context */
-    XML_FROM_CHECK,	/* The error checking module */
-    XML_FROM_WRITER,	/* The xmlwriter module */
-    XML_FROM_MODULE,	/* The dynamically loaded module module*/
-    XML_FROM_I18N, 	/* The module handling character conversion */
-    XML_FROM_SCHEMATRONV	/* The Schematron validator module */
-} xmlErrorDomain;
-
-/**
- * xmlError:
- *
- * An XML Error instance.
- */
-
-typedef struct _xmlError xmlError;
-typedef xmlError *xmlErrorPtr;
-struct _xmlError {
-    int		domain;	/* What part of the library raised this error */
-    int		code;	/* The error code, e.g. an xmlParserError */
-    char       *message;/* human-readable informative error message */
-    xmlErrorLevel level;/* how consequent is the error */
-    char       *file;	/* the filename */
-    int		line;	/* the line number if available */
-    char       *str1;	/* extra string information */
-    char       *str2;	/* extra string information */
-    char       *str3;	/* extra string information */
-    int		int1;	/* extra number information */
-    int		int2;	/* column number of the error or 0 if N/A (todo: rename this field when we would break ABI) */
-    void       *ctxt;   /* the parser context if available */
-    void       *node;   /* the node in the tree */
-};
-
-/**
- * xmlParserError:
- *
- * This is an error that the XML (or HTML) parser can generate
- */
-typedef enum {
-    XML_ERR_OK = 0,
-    XML_ERR_INTERNAL_ERROR, /* 1 */
-    XML_ERR_NO_MEMORY, /* 2 */
-    XML_ERR_DOCUMENT_START, /* 3 */
-    XML_ERR_DOCUMENT_EMPTY, /* 4 */
-    XML_ERR_DOCUMENT_END, /* 5 */
-    XML_ERR_INVALID_HEX_CHARREF, /* 6 */
-    XML_ERR_INVALID_DEC_CHARREF, /* 7 */
-    XML_ERR_INVALID_CHARREF, /* 8 */
-    XML_ERR_INVALID_CHAR, /* 9 */
-    XML_ERR_CHARREF_AT_EOF, /* 10 */
-    XML_ERR_CHARREF_IN_PROLOG, /* 11 */
-    XML_ERR_CHARREF_IN_EPILOG, /* 12 */
-    XML_ERR_CHARREF_IN_DTD, /* 13 */
-    XML_ERR_ENTITYREF_AT_EOF, /* 14 */
-    XML_ERR_ENTITYREF_IN_PROLOG, /* 15 */
-    XML_ERR_ENTITYREF_IN_EPILOG, /* 16 */
-    XML_ERR_ENTITYREF_IN_DTD, /* 17 */
-    XML_ERR_PEREF_AT_EOF, /* 18 */
-    XML_ERR_PEREF_IN_PROLOG, /* 19 */
-    XML_ERR_PEREF_IN_EPILOG, /* 20 */
-    XML_ERR_PEREF_IN_INT_SUBSET, /* 21 */
-    XML_ERR_ENTITYREF_NO_NAME, /* 22 */
-    XML_ERR_ENTITYREF_SEMICOL_MISSING, /* 23 */
-    XML_ERR_PEREF_NO_NAME, /* 24 */
-    XML_ERR_PEREF_SEMICOL_MISSING, /* 25 */
-    XML_ERR_UNDECLARED_ENTITY, /* 26 */
-    XML_WAR_UNDECLARED_ENTITY, /* 27 */
-    XML_ERR_UNPARSED_ENTITY, /* 28 */
-    XML_ERR_ENTITY_IS_EXTERNAL, /* 29 */
-    XML_ERR_ENTITY_IS_PARAMETER, /* 30 */
-    XML_ERR_UNKNOWN_ENCODING, /* 31 */
-    XML_ERR_UNSUPPORTED_ENCODING, /* 32 */
-    XML_ERR_STRING_NOT_STARTED, /* 33 */
-    XML_ERR_STRING_NOT_CLOSED, /* 34 */
-    XML_ERR_NS_DECL_ERROR, /* 35 */
-    XML_ERR_ENTITY_NOT_STARTED, /* 36 */
-    XML_ERR_ENTITY_NOT_FINISHED, /* 37 */
-    XML_ERR_LT_IN_ATTRIBUTE, /* 38 */
-    XML_ERR_ATTRIBUTE_NOT_STARTED, /* 39 */
-    XML_ERR_ATTRIBUTE_NOT_FINISHED, /* 40 */
-    XML_ERR_ATTRIBUTE_WITHOUT_VALUE, /* 41 */
-    XML_ERR_ATTRIBUTE_REDEFINED, /* 42 */
-    XML_ERR_LITERAL_NOT_STARTED, /* 43 */
-    XML_ERR_LITERAL_NOT_FINISHED, /* 44 */
-    XML_ERR_COMMENT_NOT_FINISHED, /* 45 */
-    XML_ERR_PI_NOT_STARTED, /* 46 */
-    XML_ERR_PI_NOT_FINISHED, /* 47 */
-    XML_ERR_NOTATION_NOT_STARTED, /* 48 */
-    XML_ERR_NOTATION_NOT_FINISHED, /* 49 */
-    XML_ERR_ATTLIST_NOT_STARTED, /* 50 */
-    XML_ERR_ATTLIST_NOT_FINISHED, /* 51 */
-    XML_ERR_MIXED_NOT_STARTED, /* 52 */
-    XML_ERR_MIXED_NOT_FINISHED, /* 53 */
-    XML_ERR_ELEMCONTENT_NOT_STARTED, /* 54 */
-    XML_ERR_ELEMCONTENT_NOT_FINISHED, /* 55 */
-    XML_ERR_XMLDECL_NOT_STARTED, /* 56 */
-    XML_ERR_XMLDECL_NOT_FINISHED, /* 57 */
-    XML_ERR_CONDSEC_NOT_STARTED, /* 58 */
-    XML_ERR_CONDSEC_NOT_FINISHED, /* 59 */
-    XML_ERR_EXT_SUBSET_NOT_FINISHED, /* 60 */
-    XML_ERR_DOCTYPE_NOT_FINISHED, /* 61 */
-    XML_ERR_MISPLACED_CDATA_END, /* 62 */
-    XML_ERR_CDATA_NOT_FINISHED, /* 63 */
-    XML_ERR_RESERVED_XML_NAME, /* 64 */
-    XML_ERR_SPACE_REQUIRED, /* 65 */
-    XML_ERR_SEPARATOR_REQUIRED, /* 66 */
-    XML_ERR_NMTOKEN_REQUIRED, /* 67 */
-    XML_ERR_NAME_REQUIRED, /* 68 */
-    XML_ERR_PCDATA_REQUIRED, /* 69 */
-    XML_ERR_URI_REQUIRED, /* 70 */
-    XML_ERR_PUBID_REQUIRED, /* 71 */
-    XML_ERR_LT_REQUIRED, /* 72 */
-    XML_ERR_GT_REQUIRED, /* 73 */
-    XML_ERR_LTSLASH_REQUIRED, /* 74 */
-    XML_ERR_EQUAL_REQUIRED, /* 75 */
-    XML_ERR_TAG_NAME_MISMATCH, /* 76 */
-    XML_ERR_TAG_NOT_FINISHED, /* 77 */
-    XML_ERR_STANDALONE_VALUE, /* 78 */
-    XML_ERR_ENCODING_NAME, /* 79 */
-    XML_ERR_HYPHEN_IN_COMMENT, /* 80 */
-    XML_ERR_INVALID_ENCODING, /* 81 */
-    XML_ERR_EXT_ENTITY_STANDALONE, /* 82 */
-    XML_ERR_CONDSEC_INVALID, /* 83 */
-    XML_ERR_VALUE_REQUIRED, /* 84 */
-    XML_ERR_NOT_WELL_BALANCED, /* 85 */
-    XML_ERR_EXTRA_CONTENT, /* 86 */
-    XML_ERR_ENTITY_CHAR_ERROR, /* 87 */
-    XML_ERR_ENTITY_PE_INTERNAL, /* 88 */
-    XML_ERR_ENTITY_LOOP, /* 89 */
-    XML_ERR_ENTITY_BOUNDARY, /* 90 */
-    XML_ERR_INVALID_URI, /* 91 */
-    XML_ERR_URI_FRAGMENT, /* 92 */
-    XML_WAR_CATALOG_PI, /* 93 */
-    XML_ERR_NO_DTD, /* 94 */
-    XML_ERR_CONDSEC_INVALID_KEYWORD, /* 95 */
-    XML_ERR_VERSION_MISSING, /* 96 */
-    XML_WAR_UNKNOWN_VERSION, /* 97 */
-    XML_WAR_LANG_VALUE, /* 98 */
-    XML_WAR_NS_URI, /* 99 */
-    XML_WAR_NS_URI_RELATIVE, /* 100 */
-    XML_ERR_MISSING_ENCODING, /* 101 */
-    XML_WAR_SPACE_VALUE, /* 102 */
-    XML_ERR_NOT_STANDALONE, /* 103 */
-    XML_ERR_ENTITY_PROCESSING, /* 104 */
-    XML_ERR_NOTATION_PROCESSING, /* 105 */
-    XML_WAR_NS_COLUMN, /* 106 */
-    XML_WAR_ENTITY_REDEFINED, /* 107 */
-    XML_NS_ERR_XML_NAMESPACE = 200,
-    XML_NS_ERR_UNDEFINED_NAMESPACE, /* 201 */
-    XML_NS_ERR_QNAME, /* 202 */
-    XML_NS_ERR_ATTRIBUTE_REDEFINED, /* 203 */
-    XML_NS_ERR_EMPTY, /* 204 */
-    XML_DTD_ATTRIBUTE_DEFAULT = 500,
-    XML_DTD_ATTRIBUTE_REDEFINED, /* 501 */
-    XML_DTD_ATTRIBUTE_VALUE, /* 502 */
-    XML_DTD_CONTENT_ERROR, /* 503 */
-    XML_DTD_CONTENT_MODEL, /* 504 */
-    XML_DTD_CONTENT_NOT_DETERMINIST, /* 505 */
-    XML_DTD_DIFFERENT_PREFIX, /* 506 */
-    XML_DTD_ELEM_DEFAULT_NAMESPACE, /* 507 */
-    XML_DTD_ELEM_NAMESPACE, /* 508 */
-    XML_DTD_ELEM_REDEFINED, /* 509 */
-    XML_DTD_EMPTY_NOTATION, /* 510 */
-    XML_DTD_ENTITY_TYPE, /* 511 */
-    XML_DTD_ID_FIXED, /* 512 */
-    XML_DTD_ID_REDEFINED, /* 513 */
-    XML_DTD_ID_SUBSET, /* 514 */
-    XML_DTD_INVALID_CHILD, /* 515 */
-    XML_DTD_INVALID_DEFAULT, /* 516 */
-    XML_DTD_LOAD_ERROR, /* 517 */
-    XML_DTD_MISSING_ATTRIBUTE, /* 518 */
-    XML_DTD_MIXED_CORRUPT, /* 519 */
-    XML_DTD_MULTIPLE_ID, /* 520 */
-    XML_DTD_NO_DOC, /* 521 */
-    XML_DTD_NO_DTD, /* 522 */
-    XML_DTD_NO_ELEM_NAME, /* 523 */
-    XML_DTD_NO_PREFIX, /* 524 */
-    XML_DTD_NO_ROOT, /* 525 */
-    XML_DTD_NOTATION_REDEFINED, /* 526 */
-    XML_DTD_NOTATION_VALUE, /* 527 */
-    XML_DTD_NOT_EMPTY, /* 528 */
-    XML_DTD_NOT_PCDATA, /* 529 */
-    XML_DTD_NOT_STANDALONE, /* 530 */
-    XML_DTD_ROOT_NAME, /* 531 */
-    XML_DTD_STANDALONE_WHITE_SPACE, /* 532 */
-    XML_DTD_UNKNOWN_ATTRIBUTE, /* 533 */
-    XML_DTD_UNKNOWN_ELEM, /* 534 */
-    XML_DTD_UNKNOWN_ENTITY, /* 535 */
-    XML_DTD_UNKNOWN_ID, /* 536 */
-    XML_DTD_UNKNOWN_NOTATION, /* 537 */
-    XML_DTD_STANDALONE_DEFAULTED, /* 538 */
-    XML_DTD_XMLID_VALUE, /* 539 */
-    XML_DTD_XMLID_TYPE, /* 540 */
-    XML_HTML_STRUCURE_ERROR = 800,
-    XML_HTML_UNKNOWN_TAG, /* 801 */
-    XML_RNGP_ANYNAME_ATTR_ANCESTOR = 1000,
-    XML_RNGP_ATTR_CONFLICT, /* 1001 */
-    XML_RNGP_ATTRIBUTE_CHILDREN, /* 1002 */
-    XML_RNGP_ATTRIBUTE_CONTENT, /* 1003 */
-    XML_RNGP_ATTRIBUTE_EMPTY, /* 1004 */
-    XML_RNGP_ATTRIBUTE_NOOP, /* 1005 */
-    XML_RNGP_CHOICE_CONTENT, /* 1006 */
-    XML_RNGP_CHOICE_EMPTY, /* 1007 */
-    XML_RNGP_CREATE_FAILURE, /* 1008 */
-    XML_RNGP_DATA_CONTENT, /* 1009 */
-    XML_RNGP_DEF_CHOICE_AND_INTERLEAVE, /* 1010 */
-    XML_RNGP_DEFINE_CREATE_FAILED, /* 1011 */
-    XML_RNGP_DEFINE_EMPTY, /* 1012 */
-    XML_RNGP_DEFINE_MISSING, /* 1013 */
-    XML_RNGP_DEFINE_NAME_MISSING, /* 1014 */
-    XML_RNGP_ELEM_CONTENT_EMPTY, /* 1015 */
-    XML_RNGP_ELEM_CONTENT_ERROR, /* 1016 */
-    XML_RNGP_ELEMENT_EMPTY, /* 1017 */
-    XML_RNGP_ELEMENT_CONTENT, /* 1018 */
-    XML_RNGP_ELEMENT_NAME, /* 1019 */
-    XML_RNGP_ELEMENT_NO_CONTENT, /* 1020 */
-    XML_RNGP_ELEM_TEXT_CONFLICT, /* 1021 */
-    XML_RNGP_EMPTY, /* 1022 */
-    XML_RNGP_EMPTY_CONSTRUCT, /* 1023 */
-    XML_RNGP_EMPTY_CONTENT, /* 1024 */
-    XML_RNGP_EMPTY_NOT_EMPTY, /* 1025 */
-    XML_RNGP_ERROR_TYPE_LIB, /* 1026 */
-    XML_RNGP_EXCEPT_EMPTY, /* 1027 */
-    XML_RNGP_EXCEPT_MISSING, /* 1028 */
-    XML_RNGP_EXCEPT_MULTIPLE, /* 1029 */
-    XML_RNGP_EXCEPT_NO_CONTENT, /* 1030 */
-    XML_RNGP_EXTERNALREF_EMTPY, /* 1031 */
-    XML_RNGP_EXTERNAL_REF_FAILURE, /* 1032 */
-    XML_RNGP_EXTERNALREF_RECURSE, /* 1033 */
-    XML_RNGP_FORBIDDEN_ATTRIBUTE, /* 1034 */
-    XML_RNGP_FOREIGN_ELEMENT, /* 1035 */
-    XML_RNGP_GRAMMAR_CONTENT, /* 1036 */
-    XML_RNGP_GRAMMAR_EMPTY, /* 1037 */
-    XML_RNGP_GRAMMAR_MISSING, /* 1038 */
-    XML_RNGP_GRAMMAR_NO_START, /* 1039 */
-    XML_RNGP_GROUP_ATTR_CONFLICT, /* 1040 */
-    XML_RNGP_HREF_ERROR, /* 1041 */
-    XML_RNGP_INCLUDE_EMPTY, /* 1042 */
-    XML_RNGP_INCLUDE_FAILURE, /* 1043 */
-    XML_RNGP_INCLUDE_RECURSE, /* 1044 */
-    XML_RNGP_INTERLEAVE_ADD, /* 1045 */
-    XML_RNGP_INTERLEAVE_CREATE_FAILED, /* 1046 */
-    XML_RNGP_INTERLEAVE_EMPTY, /* 1047 */
-    XML_RNGP_INTERLEAVE_NO_CONTENT, /* 1048 */
-    XML_RNGP_INVALID_DEFINE_NAME, /* 1049 */
-    XML_RNGP_INVALID_URI, /* 1050 */
-    XML_RNGP_INVALID_VALUE, /* 1051 */
-    XML_RNGP_MISSING_HREF, /* 1052 */
-    XML_RNGP_NAME_MISSING, /* 1053 */
-    XML_RNGP_NEED_COMBINE, /* 1054 */
-    XML_RNGP_NOTALLOWED_NOT_EMPTY, /* 1055 */
-    XML_RNGP_NSNAME_ATTR_ANCESTOR, /* 1056 */
-    XML_RNGP_NSNAME_NO_NS, /* 1057 */
-    XML_RNGP_PARAM_FORBIDDEN, /* 1058 */
-    XML_RNGP_PARAM_NAME_MISSING, /* 1059 */
-    XML_RNGP_PARENTREF_CREATE_FAILED, /* 1060 */
-    XML_RNGP_PARENTREF_NAME_INVALID, /* 1061 */
-    XML_RNGP_PARENTREF_NO_NAME, /* 1062 */
-    XML_RNGP_PARENTREF_NO_PARENT, /* 1063 */
-    XML_RNGP_PARENTREF_NOT_EMPTY, /* 1064 */
-    XML_RNGP_PARSE_ERROR, /* 1065 */
-    XML_RNGP_PAT_ANYNAME_EXCEPT_ANYNAME, /* 1066 */
-    XML_RNGP_PAT_ATTR_ATTR, /* 1067 */
-    XML_RNGP_PAT_ATTR_ELEM, /* 1068 */
-    XML_RNGP_PAT_DATA_EXCEPT_ATTR, /* 1069 */
-    XML_RNGP_PAT_DATA_EXCEPT_ELEM, /* 1070 */
-    XML_RNGP_PAT_DATA_EXCEPT_EMPTY, /* 1071 */
-    XML_RNGP_PAT_DATA_EXCEPT_GROUP, /* 1072 */
-    XML_RNGP_PAT_DATA_EXCEPT_INTERLEAVE, /* 1073 */
-    XML_RNGP_PAT_DATA_EXCEPT_LIST, /* 1074 */
-    XML_RNGP_PAT_DATA_EXCEPT_ONEMORE, /* 1075 */
-    XML_RNGP_PAT_DATA_EXCEPT_REF, /* 1076 */
-    XML_RNGP_PAT_DATA_EXCEPT_TEXT, /* 1077 */
-    XML_RNGP_PAT_LIST_ATTR, /* 1078 */
-    XML_RNGP_PAT_LIST_ELEM, /* 1079 */
-    XML_RNGP_PAT_LIST_INTERLEAVE, /* 1080 */
-    XML_RNGP_PAT_LIST_LIST, /* 1081 */
-    XML_RNGP_PAT_LIST_REF, /* 1082 */
-    XML_RNGP_PAT_LIST_TEXT, /* 1083 */
-    XML_RNGP_PAT_NSNAME_EXCEPT_ANYNAME, /* 1084 */
-    XML_RNGP_PAT_NSNAME_EXCEPT_NSNAME, /* 1085 */
-    XML_RNGP_PAT_ONEMORE_GROUP_ATTR, /* 1086 */
-    XML_RNGP_PAT_ONEMORE_INTERLEAVE_ATTR, /* 1087 */
-    XML_RNGP_PAT_START_ATTR, /* 1088 */
-    XML_RNGP_PAT_START_DATA, /* 1089 */
-    XML_RNGP_PAT_START_EMPTY, /* 1090 */
-    XML_RNGP_PAT_START_GROUP, /* 1091 */
-    XML_RNGP_PAT_START_INTERLEAVE, /* 1092 */
-    XML_RNGP_PAT_START_LIST, /* 1093 */
-    XML_RNGP_PAT_START_ONEMORE, /* 1094 */
-    XML_RNGP_PAT_START_TEXT, /* 1095 */
-    XML_RNGP_PAT_START_VALUE, /* 1096 */
-    XML_RNGP_PREFIX_UNDEFINED, /* 1097 */
-    XML_RNGP_REF_CREATE_FAILED, /* 1098 */
-    XML_RNGP_REF_CYCLE, /* 1099 */
-    XML_RNGP_REF_NAME_INVALID, /* 1100 */
-    XML_RNGP_REF_NO_DEF, /* 1101 */
-    XML_RNGP_REF_NO_NAME, /* 1102 */
-    XML_RNGP_REF_NOT_EMPTY, /* 1103 */
-    XML_RNGP_START_CHOICE_AND_INTERLEAVE, /* 1104 */
-    XML_RNGP_START_CONTENT, /* 1105 */
-    XML_RNGP_START_EMPTY, /* 1106 */
-    XML_RNGP_START_MISSING, /* 1107 */
-    XML_RNGP_TEXT_EXPECTED, /* 1108 */
-    XML_RNGP_TEXT_HAS_CHILD, /* 1109 */
-    XML_RNGP_TYPE_MISSING, /* 1110 */
-    XML_RNGP_TYPE_NOT_FOUND, /* 1111 */
-    XML_RNGP_TYPE_VALUE, /* 1112 */
-    XML_RNGP_UNKNOWN_ATTRIBUTE, /* 1113 */
-    XML_RNGP_UNKNOWN_COMBINE, /* 1114 */
-    XML_RNGP_UNKNOWN_CONSTRUCT, /* 1115 */
-    XML_RNGP_UNKNOWN_TYPE_LIB, /* 1116 */
-    XML_RNGP_URI_FRAGMENT, /* 1117 */
-    XML_RNGP_URI_NOT_ABSOLUTE, /* 1118 */
-    XML_RNGP_VALUE_EMPTY, /* 1119 */
-    XML_RNGP_VALUE_NO_CONTENT, /* 1120 */
-    XML_RNGP_XMLNS_NAME, /* 1121 */
-    XML_RNGP_XML_NS, /* 1122 */
-    XML_XPATH_EXPRESSION_OK = 1200,
-    XML_XPATH_NUMBER_ERROR, /* 1201 */
-    XML_XPATH_UNFINISHED_LITERAL_ERROR, /* 1202 */
-    XML_XPATH_START_LITERAL_ERROR, /* 1203 */
-    XML_XPATH_VARIABLE_REF_ERROR, /* 1204 */
-    XML_XPATH_UNDEF_VARIABLE_ERROR, /* 1205 */
-    XML_XPATH_INVALID_PREDICATE_ERROR, /* 1206 */
-    XML_XPATH_EXPR_ERROR, /* 1207 */
-    XML_XPATH_UNCLOSED_ERROR, /* 1208 */
-    XML_XPATH_UNKNOWN_FUNC_ERROR, /* 1209 */
-    XML_XPATH_INVALID_OPERAND, /* 1210 */
-    XML_XPATH_INVALID_TYPE, /* 1211 */
-    XML_XPATH_INVALID_ARITY, /* 1212 */
-    XML_XPATH_INVALID_CTXT_SIZE, /* 1213 */
-    XML_XPATH_INVALID_CTXT_POSITION, /* 1214 */
-    XML_XPATH_MEMORY_ERROR, /* 1215 */
-    XML_XPTR_SYNTAX_ERROR, /* 1216 */
-    XML_XPTR_RESOURCE_ERROR, /* 1217 */
-    XML_XPTR_SUB_RESOURCE_ERROR, /* 1218 */
-    XML_XPATH_UNDEF_PREFIX_ERROR, /* 1219 */
-    XML_XPATH_ENCODING_ERROR, /* 1220 */
-    XML_XPATH_INVALID_CHAR_ERROR, /* 1221 */
-    XML_TREE_INVALID_HEX = 1300,
-    XML_TREE_INVALID_DEC, /* 1301 */
-    XML_TREE_UNTERMINATED_ENTITY, /* 1302 */
-    XML_TREE_NOT_UTF8, /* 1303 */
-    XML_SAVE_NOT_UTF8 = 1400,
-    XML_SAVE_CHAR_INVALID, /* 1401 */
-    XML_SAVE_NO_DOCTYPE, /* 1402 */
-    XML_SAVE_UNKNOWN_ENCODING, /* 1403 */
-    XML_REGEXP_COMPILE_ERROR = 1450,
-    XML_IO_UNKNOWN = 1500,
-    XML_IO_EACCES, /* 1501 */
-    XML_IO_EAGAIN, /* 1502 */
-    XML_IO_EBADF, /* 1503 */
-    XML_IO_EBADMSG, /* 1504 */
-    XML_IO_EBUSY, /* 1505 */
-    XML_IO_ECANCELED, /* 1506 */
-    XML_IO_ECHILD, /* 1507 */
-    XML_IO_EDEADLK, /* 1508 */
-    XML_IO_EDOM, /* 1509 */
-    XML_IO_EEXIST, /* 1510 */
-    XML_IO_EFAULT, /* 1511 */
-    XML_IO_EFBIG, /* 1512 */
-    XML_IO_EINPROGRESS, /* 1513 */
-    XML_IO_EINTR, /* 1514 */
-    XML_IO_EINVAL, /* 1515 */
-    XML_IO_EIO, /* 1516 */
-    XML_IO_EISDIR, /* 1517 */
-    XML_IO_EMFILE, /* 1518 */
-    XML_IO_EMLINK, /* 1519 */
-    XML_IO_EMSGSIZE, /* 1520 */
-    XML_IO_ENAMETOOLONG, /* 1521 */
-    XML_IO_ENFILE, /* 1522 */
-    XML_IO_ENODEV, /* 1523 */
-    XML_IO_ENOENT, /* 1524 */
-    XML_IO_ENOEXEC, /* 1525 */
-    XML_IO_ENOLCK, /* 1526 */
-    XML_IO_ENOMEM, /* 1527 */
-    XML_IO_ENOSPC, /* 1528 */
-    XML_IO_ENOSYS, /* 1529 */
-    XML_IO_ENOTDIR, /* 1530 */
-    XML_IO_ENOTEMPTY, /* 1531 */
-    XML_IO_ENOTSUP, /* 1532 */
-    XML_IO_ENOTTY, /* 1533 */
-    XML_IO_ENXIO, /* 1534 */
-    XML_IO_EPERM, /* 1535 */
-    XML_IO_EPIPE, /* 1536 */
-    XML_IO_ERANGE, /* 1537 */
-    XML_IO_EROFS, /* 1538 */
-    XML_IO_ESPIPE, /* 1539 */
-    XML_IO_ESRCH, /* 1540 */
-    XML_IO_ETIMEDOUT, /* 1541 */
-    XML_IO_EXDEV, /* 1542 */
-    XML_IO_NETWORK_ATTEMPT, /* 1543 */
-    XML_IO_ENCODER, /* 1544 */
-    XML_IO_FLUSH, /* 1545 */
-    XML_IO_WRITE, /* 1546 */
-    XML_IO_NO_INPUT, /* 1547 */
-    XML_IO_BUFFER_FULL, /* 1548 */
-    XML_IO_LOAD_ERROR, /* 1549 */
-    XML_IO_ENOTSOCK, /* 1550 */
-    XML_IO_EISCONN, /* 1551 */
-    XML_IO_ECONNREFUSED, /* 1552 */
-    XML_IO_ENETUNREACH, /* 1553 */
-    XML_IO_EADDRINUSE, /* 1554 */
-    XML_IO_EALREADY, /* 1555 */
-    XML_IO_EAFNOSUPPORT, /* 1556 */
-    XML_XINCLUDE_RECURSION=1600,
-    XML_XINCLUDE_PARSE_VALUE, /* 1601 */
-    XML_XINCLUDE_ENTITY_DEF_MISMATCH, /* 1602 */
-    XML_XINCLUDE_NO_HREF, /* 1603 */
-    XML_XINCLUDE_NO_FALLBACK, /* 1604 */
-    XML_XINCLUDE_HREF_URI, /* 1605 */
-    XML_XINCLUDE_TEXT_FRAGMENT, /* 1606 */
-    XML_XINCLUDE_TEXT_DOCUMENT, /* 1607 */
-    XML_XINCLUDE_INVALID_CHAR, /* 1608 */
-    XML_XINCLUDE_BUILD_FAILED, /* 1609 */
-    XML_XINCLUDE_UNKNOWN_ENCODING, /* 1610 */
-    XML_XINCLUDE_MULTIPLE_ROOT, /* 1611 */
-    XML_XINCLUDE_XPTR_FAILED, /* 1612 */
-    XML_XINCLUDE_XPTR_RESULT, /* 1613 */
-    XML_XINCLUDE_INCLUDE_IN_INCLUDE, /* 1614 */
-    XML_XINCLUDE_FALLBACKS_IN_INCLUDE, /* 1615 */
-    XML_XINCLUDE_FALLBACK_NOT_IN_INCLUDE, /* 1616 */
-    XML_XINCLUDE_DEPRECATED_NS, /* 1617 */
-    XML_XINCLUDE_FRAGMENT_ID, /* 1618 */
-    XML_CATALOG_MISSING_ATTR = 1650,
-    XML_CATALOG_ENTRY_BROKEN, /* 1651 */
-    XML_CATALOG_PREFER_VALUE, /* 1652 */
-    XML_CATALOG_NOT_CATALOG, /* 1653 */
-    XML_CATALOG_RECURSION, /* 1654 */
-    XML_SCHEMAP_PREFIX_UNDEFINED = 1700,
-    XML_SCHEMAP_ATTRFORMDEFAULT_VALUE, /* 1701 */
-    XML_SCHEMAP_ATTRGRP_NONAME_NOREF, /* 1702 */
-    XML_SCHEMAP_ATTR_NONAME_NOREF, /* 1703 */
-    XML_SCHEMAP_COMPLEXTYPE_NONAME_NOREF, /* 1704 */
-    XML_SCHEMAP_ELEMFORMDEFAULT_VALUE, /* 1705 */
-    XML_SCHEMAP_ELEM_NONAME_NOREF, /* 1706 */
-    XML_SCHEMAP_EXTENSION_NO_BASE, /* 1707 */
-    XML_SCHEMAP_FACET_NO_VALUE, /* 1708 */
-    XML_SCHEMAP_FAILED_BUILD_IMPORT, /* 1709 */
-    XML_SCHEMAP_GROUP_NONAME_NOREF, /* 1710 */
-    XML_SCHEMAP_IMPORT_NAMESPACE_NOT_URI, /* 1711 */
-    XML_SCHEMAP_IMPORT_REDEFINE_NSNAME, /* 1712 */
-    XML_SCHEMAP_IMPORT_SCHEMA_NOT_URI, /* 1713 */
-    XML_SCHEMAP_INVALID_BOOLEAN, /* 1714 */
-    XML_SCHEMAP_INVALID_ENUM, /* 1715 */
-    XML_SCHEMAP_INVALID_FACET, /* 1716 */
-    XML_SCHEMAP_INVALID_FACET_VALUE, /* 1717 */
-    XML_SCHEMAP_INVALID_MAXOCCURS, /* 1718 */
-    XML_SCHEMAP_INVALID_MINOCCURS, /* 1719 */
-    XML_SCHEMAP_INVALID_REF_AND_SUBTYPE, /* 1720 */
-    XML_SCHEMAP_INVALID_WHITE_SPACE, /* 1721 */
-    XML_SCHEMAP_NOATTR_NOREF, /* 1722 */
-    XML_SCHEMAP_NOTATION_NO_NAME, /* 1723 */
-    XML_SCHEMAP_NOTYPE_NOREF, /* 1724 */
-    XML_SCHEMAP_REF_AND_SUBTYPE, /* 1725 */
-    XML_SCHEMAP_RESTRICTION_NONAME_NOREF, /* 1726 */
-    XML_SCHEMAP_SIMPLETYPE_NONAME, /* 1727 */
-    XML_SCHEMAP_TYPE_AND_SUBTYPE, /* 1728 */
-    XML_SCHEMAP_UNKNOWN_ALL_CHILD, /* 1729 */
-    XML_SCHEMAP_UNKNOWN_ANYATTRIBUTE_CHILD, /* 1730 */
-    XML_SCHEMAP_UNKNOWN_ATTR_CHILD, /* 1731 */
-    XML_SCHEMAP_UNKNOWN_ATTRGRP_CHILD, /* 1732 */
-    XML_SCHEMAP_UNKNOWN_ATTRIBUTE_GROUP, /* 1733 */
-    XML_SCHEMAP_UNKNOWN_BASE_TYPE, /* 1734 */
-    XML_SCHEMAP_UNKNOWN_CHOICE_CHILD, /* 1735 */
-    XML_SCHEMAP_UNKNOWN_COMPLEXCONTENT_CHILD, /* 1736 */
-    XML_SCHEMAP_UNKNOWN_COMPLEXTYPE_CHILD, /* 1737 */
-    XML_SCHEMAP_UNKNOWN_ELEM_CHILD, /* 1738 */
-    XML_SCHEMAP_UNKNOWN_EXTENSION_CHILD, /* 1739 */
-    XML_SCHEMAP_UNKNOWN_FACET_CHILD, /* 1740 */
-    XML_SCHEMAP_UNKNOWN_FACET_TYPE, /* 1741 */
-    XML_SCHEMAP_UNKNOWN_GROUP_CHILD, /* 1742 */
-    XML_SCHEMAP_UNKNOWN_IMPORT_CHILD, /* 1743 */
-    XML_SCHEMAP_UNKNOWN_LIST_CHILD, /* 1744 */
-    XML_SCHEMAP_UNKNOWN_NOTATION_CHILD, /* 1745 */
-    XML_SCHEMAP_UNKNOWN_PROCESSCONTENT_CHILD, /* 1746 */
-    XML_SCHEMAP_UNKNOWN_REF, /* 1747 */
-    XML_SCHEMAP_UNKNOWN_RESTRICTION_CHILD, /* 1748 */
-    XML_SCHEMAP_UNKNOWN_SCHEMAS_CHILD, /* 1749 */
-    XML_SCHEMAP_UNKNOWN_SEQUENCE_CHILD, /* 1750 */
-    XML_SCHEMAP_UNKNOWN_SIMPLECONTENT_CHILD, /* 1751 */
-    XML_SCHEMAP_UNKNOWN_SIMPLETYPE_CHILD, /* 1752 */
-    XML_SCHEMAP_UNKNOWN_TYPE, /* 1753 */
-    XML_SCHEMAP_UNKNOWN_UNION_CHILD, /* 1754 */
-    XML_SCHEMAP_ELEM_DEFAULT_FIXED, /* 1755 */
-    XML_SCHEMAP_REGEXP_INVALID, /* 1756 */
-    XML_SCHEMAP_FAILED_LOAD, /* 1757 */
-    XML_SCHEMAP_NOTHING_TO_PARSE, /* 1758 */
-    XML_SCHEMAP_NOROOT, /* 1759 */
-    XML_SCHEMAP_REDEFINED_GROUP, /* 1760 */
-    XML_SCHEMAP_REDEFINED_TYPE, /* 1761 */
-    XML_SCHEMAP_REDEFINED_ELEMENT, /* 1762 */
-    XML_SCHEMAP_REDEFINED_ATTRGROUP, /* 1763 */
-    XML_SCHEMAP_REDEFINED_ATTR, /* 1764 */
-    XML_SCHEMAP_REDEFINED_NOTATION, /* 1765 */
-    XML_SCHEMAP_FAILED_PARSE, /* 1766 */
-    XML_SCHEMAP_UNKNOWN_PREFIX, /* 1767 */
-    XML_SCHEMAP_DEF_AND_PREFIX, /* 1768 */
-    XML_SCHEMAP_UNKNOWN_INCLUDE_CHILD, /* 1769 */
-    XML_SCHEMAP_INCLUDE_SCHEMA_NOT_URI, /* 1770 */
-    XML_SCHEMAP_INCLUDE_SCHEMA_NO_URI, /* 1771 */
-    XML_SCHEMAP_NOT_SCHEMA, /* 1772 */
-    XML_SCHEMAP_UNKNOWN_MEMBER_TYPE, /* 1773 */
-    XML_SCHEMAP_INVALID_ATTR_USE, /* 1774 */
-    XML_SCHEMAP_RECURSIVE, /* 1775 */
-    XML_SCHEMAP_SUPERNUMEROUS_LIST_ITEM_TYPE, /* 1776 */
-    XML_SCHEMAP_INVALID_ATTR_COMBINATION, /* 1777 */
-    XML_SCHEMAP_INVALID_ATTR_INLINE_COMBINATION, /* 1778 */
-    XML_SCHEMAP_MISSING_SIMPLETYPE_CHILD, /* 1779 */
-    XML_SCHEMAP_INVALID_ATTR_NAME, /* 1780 */
-    XML_SCHEMAP_REF_AND_CONTENT, /* 1781 */
-    XML_SCHEMAP_CT_PROPS_CORRECT_1, /* 1782 */
-    XML_SCHEMAP_CT_PROPS_CORRECT_2, /* 1783 */
-    XML_SCHEMAP_CT_PROPS_CORRECT_3, /* 1784 */
-    XML_SCHEMAP_CT_PROPS_CORRECT_4, /* 1785 */
-    XML_SCHEMAP_CT_PROPS_CORRECT_5, /* 1786 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_1, /* 1787 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_2_1_1, /* 1788 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_2_1_2, /* 1789 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_2_2, /* 1790 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_3, /* 1791 */
-    XML_SCHEMAP_WILDCARD_INVALID_NS_MEMBER, /* 1792 */
-    XML_SCHEMAP_INTERSECTION_NOT_EXPRESSIBLE, /* 1793 */
-    XML_SCHEMAP_UNION_NOT_EXPRESSIBLE, /* 1794 */
-    XML_SCHEMAP_SRC_IMPORT_3_1, /* 1795 */
-    XML_SCHEMAP_SRC_IMPORT_3_2, /* 1796 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_4_1, /* 1797 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_4_2, /* 1798 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_4_3, /* 1799 */
-    XML_SCHEMAP_COS_CT_EXTENDS_1_3, /* 1800 */
-    XML_SCHEMAV_NOROOT = 1801,
-    XML_SCHEMAV_UNDECLAREDELEM, /* 1802 */
-    XML_SCHEMAV_NOTTOPLEVEL, /* 1803 */
-    XML_SCHEMAV_MISSING, /* 1804 */
-    XML_SCHEMAV_WRONGELEM, /* 1805 */
-    XML_SCHEMAV_NOTYPE, /* 1806 */
-    XML_SCHEMAV_NOROLLBACK, /* 1807 */
-    XML_SCHEMAV_ISABSTRACT, /* 1808 */
-    XML_SCHEMAV_NOTEMPTY, /* 1809 */
-    XML_SCHEMAV_ELEMCONT, /* 1810 */
-    XML_SCHEMAV_HAVEDEFAULT, /* 1811 */
-    XML_SCHEMAV_NOTNILLABLE, /* 1812 */
-    XML_SCHEMAV_EXTRACONTENT, /* 1813 */
-    XML_SCHEMAV_INVALIDATTR, /* 1814 */
-    XML_SCHEMAV_INVALIDELEM, /* 1815 */
-    XML_SCHEMAV_NOTDETERMINIST, /* 1816 */
-    XML_SCHEMAV_CONSTRUCT, /* 1817 */
-    XML_SCHEMAV_INTERNAL, /* 1818 */
-    XML_SCHEMAV_NOTSIMPLE, /* 1819 */
-    XML_SCHEMAV_ATTRUNKNOWN, /* 1820 */
-    XML_SCHEMAV_ATTRINVALID, /* 1821 */
-    XML_SCHEMAV_VALUE, /* 1822 */
-    XML_SCHEMAV_FACET, /* 1823 */
-    XML_SCHEMAV_CVC_DATATYPE_VALID_1_2_1, /* 1824 */
-    XML_SCHEMAV_CVC_DATATYPE_VALID_1_2_2, /* 1825 */
-    XML_SCHEMAV_CVC_DATATYPE_VALID_1_2_3, /* 1826 */
-    XML_SCHEMAV_CVC_TYPE_3_1_1, /* 1827 */
-    XML_SCHEMAV_CVC_TYPE_3_1_2, /* 1828 */
-    XML_SCHEMAV_CVC_FACET_VALID, /* 1829 */
-    XML_SCHEMAV_CVC_LENGTH_VALID, /* 1830 */
-    XML_SCHEMAV_CVC_MINLENGTH_VALID, /* 1831 */
-    XML_SCHEMAV_CVC_MAXLENGTH_VALID, /* 1832 */
-    XML_SCHEMAV_CVC_MININCLUSIVE_VALID, /* 1833 */
-    XML_SCHEMAV_CVC_MAXINCLUSIVE_VALID, /* 1834 */
-    XML_SCHEMAV_CVC_MINEXCLUSIVE_VALID, /* 1835 */
-    XML_SCHEMAV_CVC_MAXEXCLUSIVE_VALID, /* 1836 */
-    XML_SCHEMAV_CVC_TOTALDIGITS_VALID, /* 1837 */
-    XML_SCHEMAV_CVC_FRACTIONDIGITS_VALID, /* 1838 */
-    XML_SCHEMAV_CVC_PATTERN_VALID, /* 1839 */
-    XML_SCHEMAV_CVC_ENUMERATION_VALID, /* 1840 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_2_1, /* 1841 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_2_2, /* 1842 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_2_3, /* 1843 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_2_4, /* 1844 */
-    XML_SCHEMAV_CVC_ELT_1, /* 1845 */
-    XML_SCHEMAV_CVC_ELT_2, /* 1846 */
-    XML_SCHEMAV_CVC_ELT_3_1, /* 1847 */
-    XML_SCHEMAV_CVC_ELT_3_2_1, /* 1848 */
-    XML_SCHEMAV_CVC_ELT_3_2_2, /* 1849 */
-    XML_SCHEMAV_CVC_ELT_4_1, /* 1850 */
-    XML_SCHEMAV_CVC_ELT_4_2, /* 1851 */
-    XML_SCHEMAV_CVC_ELT_4_3, /* 1852 */
-    XML_SCHEMAV_CVC_ELT_5_1_1, /* 1853 */
-    XML_SCHEMAV_CVC_ELT_5_1_2, /* 1854 */
-    XML_SCHEMAV_CVC_ELT_5_2_1, /* 1855 */  
-    XML_SCHEMAV_CVC_ELT_5_2_2_1, /* 1856 */
-    XML_SCHEMAV_CVC_ELT_5_2_2_2_1, /* 1857 */
-    XML_SCHEMAV_CVC_ELT_5_2_2_2_2, /* 1858 */
-    XML_SCHEMAV_CVC_ELT_6, /* 1859 */
-    XML_SCHEMAV_CVC_ELT_7, /* 1860 */
-    XML_SCHEMAV_CVC_ATTRIBUTE_1, /* 1861 */
-    XML_SCHEMAV_CVC_ATTRIBUTE_2, /* 1862 */
-    XML_SCHEMAV_CVC_ATTRIBUTE_3, /* 1863 */
-    XML_SCHEMAV_CVC_ATTRIBUTE_4, /* 1864 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_3_1, /* 1865 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_3_2_1, /* 1866 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_3_2_2, /* 1867 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_4, /* 1868 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_5_1, /* 1869 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_5_2, /* 1870 */
-    XML_SCHEMAV_ELEMENT_CONTENT, /* 1871 */
-    XML_SCHEMAV_DOCUMENT_ELEMENT_MISSING, /* 1872 */
-    XML_SCHEMAV_CVC_COMPLEX_TYPE_1, /* 1873 */
-    XML_SCHEMAV_CVC_AU, /* 1874 */
-    XML_SCHEMAV_CVC_TYPE_1, /* 1875 */
-    XML_SCHEMAV_CVC_TYPE_2, /* 1876 */
-    XML_SCHEMAV_CVC_IDC, /* 1877 */
-    XML_SCHEMAV_CVC_WILDCARD, /* 1878 */
-    XML_SCHEMAV_MISC, /* 1879 */
-    XML_XPTR_UNKNOWN_SCHEME = 1900, 
-    XML_XPTR_CHILDSEQ_START, /* 1901 */
-    XML_XPTR_EVAL_FAILED, /* 1902 */
-    XML_XPTR_EXTRA_OBJECTS, /* 1903 */
-    XML_C14N_CREATE_CTXT = 1950,
-    XML_C14N_REQUIRES_UTF8, /* 1951 */
-    XML_C14N_CREATE_STACK, /* 1952 */
-    XML_C14N_INVALID_NODE, /* 1953 */
-    XML_C14N_UNKNOW_NODE, /* 1954 */
-    XML_C14N_RELATIVE_NAMESPACE, /* 1955 */
-    XML_FTP_PASV_ANSWER = 2000,
-    XML_FTP_EPSV_ANSWER, /* 2001 */
-    XML_FTP_ACCNT, /* 2002 */
-    XML_FTP_URL_SYNTAX, /* 2003 */
-    XML_HTTP_URL_SYNTAX = 2020,
-    XML_HTTP_USE_IP, /* 2021 */
-    XML_HTTP_UNKNOWN_HOST, /* 2022 */
-    XML_SCHEMAP_SRC_SIMPLE_TYPE_1 = 3000,
-    XML_SCHEMAP_SRC_SIMPLE_TYPE_2, /* 3001 */
-    XML_SCHEMAP_SRC_SIMPLE_TYPE_3, /* 3002 */
-    XML_SCHEMAP_SRC_SIMPLE_TYPE_4, /* 3003 */
-    XML_SCHEMAP_SRC_RESOLVE, /* 3004 */ 
-    XML_SCHEMAP_SRC_RESTRICTION_BASE_OR_SIMPLETYPE, /* 3005 */
-    XML_SCHEMAP_SRC_LIST_ITEMTYPE_OR_SIMPLETYPE, /* 3006 */
-    XML_SCHEMAP_SRC_UNION_MEMBERTYPES_OR_SIMPLETYPES, /* 3007 */
-    XML_SCHEMAP_ST_PROPS_CORRECT_1, /* 3008 */
-    XML_SCHEMAP_ST_PROPS_CORRECT_2, /* 3009 */
-    XML_SCHEMAP_ST_PROPS_CORRECT_3, /* 3010 */     
-    XML_SCHEMAP_COS_ST_RESTRICTS_1_1, /* 3011 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_1_2, /* 3012 */    
-    XML_SCHEMAP_COS_ST_RESTRICTS_1_3_1, /* 3013 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_1_3_2, /* 3014 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_1, /* 3015 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_1_1, /* 3016 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_1_2, /* 3017 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_2_1, /* 3018 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_2_2, /* 3019 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_2_3, /* 3020 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_2_4, /* 3021 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_2_3_2_5, /* 3022 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_1, /* 3023 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_1, /* 3024 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_1_2, /* 3025 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_2_2, /* 3026 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_2_1, /* 3027 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_2_3, /* 3028 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_2_4, /* 3029 */
-    XML_SCHEMAP_COS_ST_RESTRICTS_3_3_2_5, /* 3030 */
-    XML_SCHEMAP_COS_ST_DERIVED_OK_2_1, /* 3031 */ 
-    XML_SCHEMAP_COS_ST_DERIVED_OK_2_2, /* 3032 */
-    XML_SCHEMAP_S4S_ELEM_NOT_ALLOWED, /* 3033 */
-    XML_SCHEMAP_S4S_ELEM_MISSING, /* 3034 */
-    XML_SCHEMAP_S4S_ATTR_NOT_ALLOWED, /* 3035 */
-    XML_SCHEMAP_S4S_ATTR_MISSING, /* 3036 */
-    XML_SCHEMAP_S4S_ATTR_INVALID_VALUE, /* 3037 */
-    XML_SCHEMAP_SRC_ELEMENT_1, /* 3038 */
-    XML_SCHEMAP_SRC_ELEMENT_2_1, /* 3039 */
-    XML_SCHEMAP_SRC_ELEMENT_2_2, /* 3040 */
-    XML_SCHEMAP_SRC_ELEMENT_3, /* 3041 */
-    XML_SCHEMAP_P_PROPS_CORRECT_1, /* 3042 */
-    XML_SCHEMAP_P_PROPS_CORRECT_2_1, /* 3043 */
-    XML_SCHEMAP_P_PROPS_CORRECT_2_2, /* 3044 */
-    XML_SCHEMAP_E_PROPS_CORRECT_2, /* 3045 */
-    XML_SCHEMAP_E_PROPS_CORRECT_3, /* 3046 */
-    XML_SCHEMAP_E_PROPS_CORRECT_4, /* 3047 */
-    XML_SCHEMAP_E_PROPS_CORRECT_5, /* 3048 */
-    XML_SCHEMAP_E_PROPS_CORRECT_6, /* 3049 */
-    XML_SCHEMAP_SRC_INCLUDE, /* 3050 */    
-    XML_SCHEMAP_SRC_ATTRIBUTE_1, /* 3051 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_2, /* 3052 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_3_1, /* 3053 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_3_2, /* 3054 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_4, /* 3055 */
-    XML_SCHEMAP_NO_XMLNS, /* 3056 */
-    XML_SCHEMAP_NO_XSI, /* 3057 */      
-    XML_SCHEMAP_COS_VALID_DEFAULT_1, /* 3058 */
-    XML_SCHEMAP_COS_VALID_DEFAULT_2_1, /* 3059 */
-    XML_SCHEMAP_COS_VALID_DEFAULT_2_2_1, /* 3060 */
-    XML_SCHEMAP_COS_VALID_DEFAULT_2_2_2, /* 3061 */
-    XML_SCHEMAP_CVC_SIMPLE_TYPE, /* 3062 */
-    XML_SCHEMAP_COS_CT_EXTENDS_1_1, /* 3063 */
-    XML_SCHEMAP_SRC_IMPORT_1_1, /* 3064 */
-    XML_SCHEMAP_SRC_IMPORT_1_2, /* 3065 */
-    XML_SCHEMAP_SRC_IMPORT_2, /* 3066 */
-    XML_SCHEMAP_SRC_IMPORT_2_1, /* 3067 */
-    XML_SCHEMAP_SRC_IMPORT_2_2, /* 3068 */
-    XML_SCHEMAP_INTERNAL, /* 3069 non-W3C */
-    XML_SCHEMAP_NOT_DETERMINISTIC, /* 3070 non-W3C */
-    XML_SCHEMAP_SRC_ATTRIBUTE_GROUP_1, /* 3071 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_GROUP_2, /* 3072 */
-    XML_SCHEMAP_SRC_ATTRIBUTE_GROUP_3, /* 3073 */
-    XML_SCHEMAP_MG_PROPS_CORRECT_1, /* 3074 */
-    XML_SCHEMAP_MG_PROPS_CORRECT_2, /* 3075 */
-    XML_SCHEMAP_SRC_CT_1, /* 3076 */
-    XML_SCHEMAP_DERIVATION_OK_RESTRICTION_2_1_3, /* 3077 */
-    XML_SCHEMAP_AU_PROPS_CORRECT_2, /* 3078 */
-    XML_SCHEMAP_A_PROPS_CORRECT_2, /* 3079 */
-    XML_SCHEMAP_C_PROPS_CORRECT, /* 3080 */
-    XML_SCHEMAP_SRC_REDEFINE, /* 3081 */
-    XML_SCHEMAP_SRC_IMPORT, /* 3082 */
-    XML_SCHEMAP_WARN_SKIP_SCHEMA, /* 3083 */
-    XML_SCHEMAP_WARN_UNLOCATED_SCHEMA, /* 3084 */
-    XML_SCHEMAP_WARN_ATTR_REDECL_PROH, /* 3085 */
-    XML_SCHEMAP_WARN_ATTR_POINTLESS_PROH, /* 3085 */
-    XML_SCHEMAP_AG_PROPS_CORRECT, /* 3086 */
-    XML_SCHEMAP_COS_CT_EXTENDS_1_2, /* 3087 */
-    XML_SCHEMAP_AU_PROPS_CORRECT, /* 3088 */
-    XML_SCHEMAP_A_PROPS_CORRECT_3, /* 3089 */
-    XML_SCHEMAP_COS_ALL_LIMITED, /* 3090 */
-    XML_SCHEMATRONV_ASSERT = 4000, /* 4000 */
-    XML_SCHEMATRONV_REPORT,
-    XML_MODULE_OPEN = 4900, /* 4900 */
-    XML_MODULE_CLOSE, /* 4901 */
-    XML_CHECK_FOUND_ELEMENT = 5000,
-    XML_CHECK_FOUND_ATTRIBUTE, /* 5001 */
-    XML_CHECK_FOUND_TEXT, /* 5002 */
-    XML_CHECK_FOUND_CDATA, /* 5003 */
-    XML_CHECK_FOUND_ENTITYREF, /* 5004 */
-    XML_CHECK_FOUND_ENTITY, /* 5005 */
-    XML_CHECK_FOUND_PI, /* 5006 */
-    XML_CHECK_FOUND_COMMENT, /* 5007 */
-    XML_CHECK_FOUND_DOCTYPE, /* 5008 */
-    XML_CHECK_FOUND_FRAGMENT, /* 5009 */
-    XML_CHECK_FOUND_NOTATION, /* 5010 */
-    XML_CHECK_UNKNOWN_NODE, /* 5011 */
-    XML_CHECK_ENTITY_TYPE, /* 5012 */
-    XML_CHECK_NO_PARENT, /* 5013 */
-    XML_CHECK_NO_DOC, /* 5014 */
-    XML_CHECK_NO_NAME, /* 5015 */
-    XML_CHECK_NO_ELEM, /* 5016 */
-    XML_CHECK_WRONG_DOC, /* 5017 */
-    XML_CHECK_NO_PREV, /* 5018 */
-    XML_CHECK_WRONG_PREV, /* 5019 */
-    XML_CHECK_NO_NEXT, /* 5020 */
-    XML_CHECK_WRONG_NEXT, /* 5021 */
-    XML_CHECK_NOT_DTD, /* 5022 */
-    XML_CHECK_NOT_ATTR, /* 5023 */
-    XML_CHECK_NOT_ATTR_DECL, /* 5024 */
-    XML_CHECK_NOT_ELEM_DECL, /* 5025 */
-    XML_CHECK_NOT_ENTITY_DECL, /* 5026 */
-    XML_CHECK_NOT_NS_DECL, /* 5027 */
-    XML_CHECK_NO_HREF, /* 5028 */
-    XML_CHECK_WRONG_PARENT,/* 5029 */
-    XML_CHECK_NS_SCOPE, /* 5030 */
-    XML_CHECK_NS_ANCESTOR, /* 5031 */
-    XML_CHECK_NOT_UTF8, /* 5032 */
-    XML_CHECK_NO_DICT, /* 5033 */
-    XML_CHECK_NOT_NCNAME, /* 5034 */
-    XML_CHECK_OUTSIDE_DICT, /* 5035 */
-    XML_CHECK_WRONG_NAME, /* 5036 */
-    XML_CHECK_NAME_NOT_NULL, /* 5037 */
-    XML_I18N_NO_NAME = 6000,
-    XML_I18N_NO_HANDLER, /* 6001 */
-    XML_I18N_EXCESS_HANDLER, /* 6002 */
-    XML_I18N_CONV_FAILED, /* 6003 */
-    XML_I18N_NO_OUTPUT /* 6004 */
-#if 0
-    XML_CHECK_, /* 5033 */
-    XML_CHECK_X /* 503 */
-#endif
-} xmlParserErrors;
-
-/**
- * xmlGenericErrorFunc:
- * @ctx:  a parsing context
- * @msg:  the message
- * @...:  the extra arguments of the varags to format the message
- *
- * Signature of the function to use when there is an error and
- * no parsing or validity context available .
- */
-typedef void (XMLCDECL *xmlGenericErrorFunc) (void *ctx,
-				 const char *msg,
-	 			 ...);
-/**
- * xmlStructuredErrorFunc:
- * @userData:  user provided data for the error callback
- * @error:  the error being raised.
- *
- * Signature of the function to use when there is an error and
- * the module handles the new error reporting mechanism.
- */
-typedef void (XMLCALL *xmlStructuredErrorFunc) (void *userData, xmlErrorPtr error);
-
-/*
- * Use the following function to reset the two global variables
- * xmlGenericError and xmlGenericErrorContext.
- */
-XMLPUBFUN void XMLCALL	
-    xmlSetGenericErrorFunc	(void *ctx,
-				 xmlGenericErrorFunc handler);
-XMLPUBFUN void XMLCALL	
-    initGenericErrorDefaultFunc	(xmlGenericErrorFunc *handler);
-
-XMLPUBFUN void XMLCALL	
-    xmlSetStructuredErrorFunc	(void *ctx,
-				 xmlStructuredErrorFunc handler);
-/*
- * Default message routines used by SAX and Valid context for error
- * and warning reporting.
- */
-XMLPUBFUN void XMLCDECL	
-    xmlParserError		(void *ctx,
-				 const char *msg,
-				 ...);
-XMLPUBFUN void XMLCDECL	
-    xmlParserWarning		(void *ctx,
-				 const char *msg,
-				 ...);
-XMLPUBFUN void XMLCDECL	
-    xmlParserValidityError	(void *ctx,
-				 const char *msg,
-				 ...);
-XMLPUBFUN void XMLCDECL	
-    xmlParserValidityWarning	(void *ctx,
-				 const char *msg,
-				 ...);
-XMLPUBFUN void XMLCALL	
-    xmlParserPrintFileInfo	(xmlParserInputPtr input);
-XMLPUBFUN void XMLCALL	
-    xmlParserPrintFileContext	(xmlParserInputPtr input);
-
-/*
- * Extended error information routines
- */
-XMLPUBFUN xmlErrorPtr XMLCALL
-    xmlGetLastError		(void);
-XMLPUBFUN void XMLCALL
-    xmlResetLastError		(void);
-XMLPUBFUN xmlErrorPtr XMLCALL
-    xmlCtxtGetLastError		(void *ctx);
-XMLPUBFUN void XMLCALL
-    xmlCtxtResetLastError	(void *ctx);
-XMLPUBFUN void XMLCALL
-    xmlResetError		(xmlErrorPtr err);
-XMLPUBFUN int XMLCALL
-    xmlCopyError		(xmlErrorPtr from,
-    				 xmlErrorPtr to);
-
-#ifdef IN_LIBXML
-/*
- * Internal callback reporting routine
- */
-XMLPUBFUN void XMLCALL 
-    __xmlRaiseError		(xmlStructuredErrorFunc schannel,
-    				 xmlGenericErrorFunc channel,
-    				 void *data,
-                                 void *ctx,
-    				 void *node,
-    				 int domain,
-				 int code,
-				 xmlErrorLevel level,
-				 const char *file,
-				 int line,
-				 const char *str1,
-				 const char *str2,
-				 const char *str3,
-				 int int1,
-				 int col,
-				 const char *msg,
-				 ...);
-XMLPUBFUN void XMLCALL 
-    __xmlSimpleError		(int domain,
-    				 int code,
-				 xmlNodePtr node,
-				 const char *msg,
-				 const char *extra);
-#endif
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_ERROR_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlexports.h igraph-0.6.5/msvc/include/libxml/xmlexports.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlexports.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlexports.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,157 +0,0 @@
-/*
- * Summary: macros for marking symbols as exportable/importable.
- * Description: macros for marking symbols as exportable/importable.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Igor Zlatovic <igor@zlatkovic.com>
- */
-
-#ifndef __XML_EXPORTS_H__
-#define __XML_EXPORTS_H__
-
-/**
- * XMLPUBFUN, XMLPUBVAR, XMLCALL
- *
- * Macros which declare an exportable function, an exportable variable and
- * the calling convention used for functions.
- *
- * Please use an extra block for every platform/compiler combination when
- * modifying this, rather than overlong #ifdef lines. This helps
- * readability as well as the fact that different compilers on the same
- * platform might need different definitions.
- */
-
-/**
- * XMLPUBFUN:
- *
- * Macros which declare an exportable function
- */
-#define XMLPUBFUN
-/**
- * XMLPUBVAR:
- *
- * Macros which declare an exportable variable
- */
-#define XMLPUBVAR extern
-/**
- * XMLCALL:
- *
- * Macros which declare the called convention for exported functions
- */
-#define XMLCALL
-/**
- * XMLCDECL:
- *
- * Macro which declares the calling convention for exported functions that 
- * use '...'.
- */
-#define XMLCDECL
-
-/** DOC_DISABLE */
-
-/* Windows platform with MS compiler */
-#if defined(_WIN32) && defined(_MSC_VER)
-  #undef XMLPUBFUN
-  #undef XMLPUBVAR
-  #undef XMLCALL
-  #undef XMLCDECL
-  #if defined(IN_LIBXML) && !defined(LIBXML_STATIC)
-    #define XMLPUBFUN __declspec(dllexport)
-    #define XMLPUBVAR __declspec(dllexport)
-  #else
-    #define XMLPUBFUN
-    #if !defined(LIBXML_STATIC)
-      #define XMLPUBVAR __declspec(dllimport) extern
-    #else
-      #define XMLPUBVAR extern
-    #endif
-  #endif
-  #if defined(LIBXML_FASTCALL)
-    #define XMLCALL __fastcall
-  #else
-    #define XMLCALL __cdecl
-  #endif
-  #define XMLCDECL __cdecl
-  #if !defined _REENTRANT
-    #define _REENTRANT
-  #endif
-#endif
-
-/* Windows platform with Borland compiler */
-#if defined(_WIN32) && defined(__BORLANDC__)
-  #undef XMLPUBFUN
-  #undef XMLPUBVAR
-  #undef XMLCALL
-  #undef XMLCDECL
-  #if defined(IN_LIBXML) && !defined(LIBXML_STATIC)
-    #define XMLPUBFUN __declspec(dllexport)
-    #define XMLPUBVAR __declspec(dllexport) extern
-  #else
-    #define XMLPUBFUN
-    #if !defined(LIBXML_STATIC)
-      #define XMLPUBVAR __declspec(dllimport) extern
-    #else
-      #define XMLPUBVAR extern
-    #endif
-  #endif
-  #define XMLCALL __cdecl
-  #define XMLCDECL __cdecl
-  #if !defined _REENTRANT
-    #define _REENTRANT
-  #endif
-#endif
-
-/* Windows platform with GNU compiler (Mingw) */
-#if defined(_WIN32) && defined(__MINGW32__)
-  #undef XMLPUBFUN
-  #undef XMLPUBVAR
-  #undef XMLCALL
-  #undef XMLCDECL
-  #if defined(IN_LIBXML) && !defined(LIBXML_STATIC)
-    #define XMLPUBFUN __declspec(dllexport)
-    #define XMLPUBVAR __declspec(dllexport)
-  #else
-    #define XMLPUBFUN
-    #if !defined(LIBXML_STATIC)
-      #define XMLPUBVAR __declspec(dllimport) extern
-    #else
-      #define XMLPUBVAR extern
-    #endif
-  #endif
-  #define XMLCALL __cdecl
-  #define XMLCDECL __cdecl
-  #if !defined _REENTRANT
-    #define _REENTRANT
-  #endif
-#endif
-
-/* Cygwin platform, GNU compiler */
-#if defined(_WIN32) && defined(__CYGWIN__)
-  #undef XMLPUBFUN
-  #undef XMLPUBVAR
-  #undef XMLCALL
-  #undef XMLCDECL
-  #if defined(IN_LIBXML) && !defined(LIBXML_STATIC)
-    #define XMLPUBFUN __declspec(dllexport)
-    #define XMLPUBVAR __declspec(dllexport)
-  #else
-    #define XMLPUBFUN
-    #if !defined(LIBXML_STATIC)
-      #define XMLPUBVAR __declspec(dllimport) extern
-    #else
-      #define XMLPUBVAR
-    #endif
-  #endif
-  #define XMLCALL __cdecl
-  #define XMLCDECL __cdecl
-#endif
-
-/* Compatibility */
-#if !defined(LIBXML_DLL_IMPORT)
-#define LIBXML_DLL_IMPORT XMLPUBVAR
-#endif
-
-#endif /* __XML_EXPORTS_H__ */
-
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlmemory.h igraph-0.6.5/msvc/include/libxml/xmlmemory.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlmemory.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlmemory.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,222 +0,0 @@
-/*
- * Summary: interface for the memory allocator
- * Description: provides interfaces for the memory allocator,
- *              including debugging capabilities.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __DEBUG_MEMORY_ALLOC__
-#define __DEBUG_MEMORY_ALLOC__
-
-#include <stdio.h>
-#include <libxml/xmlversion.h>
-
-/**
- * DEBUG_MEMORY:
- *
- * DEBUG_MEMORY replaces the allocator with a collect and debug
- * shell to the libc allocator.
- * DEBUG_MEMORY should only be activated when debugging 
- * libxml i.e. if libxml has been configured with --with-debug-mem too.
- */
-/* #define DEBUG_MEMORY_FREED */
-/* #define DEBUG_MEMORY_LOCATION */
-
-#ifdef DEBUG
-#ifndef DEBUG_MEMORY
-#define DEBUG_MEMORY
-#endif
-#endif
-
-/**
- * DEBUG_MEMORY_LOCATION:
- *
- * DEBUG_MEMORY_LOCATION should be activated only when debugging 
- * libxml i.e. if libxml has been configured with --with-debug-mem too.
- */
-#ifdef DEBUG_MEMORY_LOCATION
-#endif
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The XML memory wrapper support 4 basic overloadable functions.
- */
-/**
- * xmlFreeFunc:
- * @mem: an already allocated block of memory
- *
- * Signature for a free() implementation.
- */
-typedef void (XMLCALL *xmlFreeFunc)(void *mem);
-/**
- * xmlMallocFunc:
- * @size:  the size requested in bytes
- *
- * Signature for a malloc() implementation.
- *
- * Returns a pointer to the newly allocated block or NULL in case of error.
- */
-typedef void *(XMLCALL *xmlMallocFunc)(size_t size);
-
-/**
- * xmlReallocFunc:
- * @mem: an already allocated block of memory
- * @size:  the new size requested in bytes
- *
- * Signature for a realloc() implementation.
- *
- * Returns a pointer to the newly reallocated block or NULL in case of error.
- */
-typedef void *(XMLCALL *xmlReallocFunc)(void *mem, size_t size);
-
-/**
- * xmlStrdupFunc:
- * @str: a zero terminated string
- *
- * Signature for an strdup() implementation.
- *
- * Returns the copy of the string or NULL in case of error.
- */
-typedef char *(XMLCALL *xmlStrdupFunc)(const char *str);
-
-/*
- * The 4 interfaces used for all memory handling within libxml.
-LIBXML_DLL_IMPORT extern xmlFreeFunc xmlFree;
-LIBXML_DLL_IMPORT extern xmlMallocFunc xmlMalloc;
-LIBXML_DLL_IMPORT extern xmlMallocFunc xmlMallocAtomic;
-LIBXML_DLL_IMPORT extern xmlReallocFunc xmlRealloc;
-LIBXML_DLL_IMPORT extern xmlStrdupFunc xmlMemStrdup;
- */
-
-/*
- * The way to overload the existing functions.
- * The xmlGc function have an extra entry for atomic block
- * allocations useful for garbage collected memory allocators
- */
-XMLPUBFUN int XMLCALL
-	xmlMemSetup	(xmlFreeFunc freeFunc,
-			 xmlMallocFunc mallocFunc,
-			 xmlReallocFunc reallocFunc,
-			 xmlStrdupFunc strdupFunc);
-XMLPUBFUN int XMLCALL     
-	xmlMemGet	(xmlFreeFunc *freeFunc,
-			 xmlMallocFunc *mallocFunc,
-			 xmlReallocFunc *reallocFunc,
-			 xmlStrdupFunc *strdupFunc);
-XMLPUBFUN int XMLCALL     
-	xmlGcMemSetup	(xmlFreeFunc freeFunc,
-			 xmlMallocFunc mallocFunc,
-			 xmlMallocFunc mallocAtomicFunc,
-			 xmlReallocFunc reallocFunc,
-			 xmlStrdupFunc strdupFunc);
-XMLPUBFUN int XMLCALL     
-	xmlGcMemGet	(xmlFreeFunc *freeFunc,
-			 xmlMallocFunc *mallocFunc,
-			 xmlMallocFunc *mallocAtomicFunc,
-			 xmlReallocFunc *reallocFunc,
-			 xmlStrdupFunc *strdupFunc);
-
-/*
- * Initialization of the memory layer.
- */
-XMLPUBFUN int XMLCALL	
-	xmlInitMemory	(void);
-
-/* 
- * Cleanup of the memory layer.
- */
-XMLPUBFUN void XMLCALL                
-                xmlCleanupMemory        (void);
-/*
- * These are specific to the XML debug memory wrapper.
- */
-XMLPUBFUN int XMLCALL	
-	xmlMemUsed	(void);
-XMLPUBFUN int XMLCALL	
-	xmlMemBlocks	(void);
-XMLPUBFUN void XMLCALL	
-	xmlMemDisplay	(FILE *fp);
-XMLPUBFUN void XMLCALL	
-	xmlMemShow	(FILE *fp, int nr);
-XMLPUBFUN void XMLCALL	
-	xmlMemoryDump	(void);
-XMLPUBFUN void * XMLCALL	
-	xmlMemMalloc	(size_t size);
-XMLPUBFUN void * XMLCALL	
-	xmlMemRealloc	(void *ptr,size_t size);
-XMLPUBFUN void XMLCALL	
-	xmlMemFree	(void *ptr);
-XMLPUBFUN char * XMLCALL	
-	xmlMemoryStrdup	(const char *str);
-XMLPUBFUN void * XMLCALL  
-	xmlMallocLoc	(size_t size, const char *file, int line);
-XMLPUBFUN void * XMLCALL	
-	xmlReallocLoc	(void *ptr, size_t size, const char *file, int line);
-XMLPUBFUN void * XMLCALL	
-	xmlMallocAtomicLoc (size_t size, const char *file, int line);
-XMLPUBFUN char * XMLCALL	
-	xmlMemStrdupLoc	(const char *str, const char *file, int line);
-
-
-#ifdef DEBUG_MEMORY_LOCATION
-/**
- * xmlMalloc:
- * @size:  number of bytes to allocate
- *
- * Wrapper for the malloc() function used in the XML library.
- *
- * Returns the pointer to the allocated area or NULL in case of error.
- */
-#define xmlMalloc(size) xmlMallocLoc((size), __FILE__, __LINE__)
-/**
- * xmlMallocAtomic:
- * @size:  number of bytes to allocate
- *
- * Wrapper for the malloc() function used in the XML library for allocation
- * of block not containing pointers to other areas.
- *
- * Returns the pointer to the allocated area or NULL in case of error.
- */
-#define xmlMallocAtomic(size) xmlMallocAtomicLoc((size), __FILE__, __LINE__)
-/**
- * xmlRealloc:
- * @ptr:  pointer to the existing allocated area
- * @size:  number of bytes to allocate
- *
- * Wrapper for the realloc() function used in the XML library.
- *
- * Returns the pointer to the allocated area or NULL in case of error.
- */
-#define xmlRealloc(ptr, size) xmlReallocLoc((ptr), (size), __FILE__, __LINE__)
-/**
- * xmlMemStrdup:
- * @str:  pointer to the existing string
- *
- * Wrapper for the strdup() function, xmlStrdup() is usually preferred.
- *
- * Returns the pointer to the allocated area or NULL in case of error.
- */
-#define xmlMemStrdup(str) xmlMemStrdupLoc((str), __FILE__, __LINE__)
-
-#endif /* DEBUG_MEMORY_LOCATION */
-
-#ifdef __cplusplus
-}
-#endif /* __cplusplus */
-
-#ifndef __XML_GLOBALS_H
-#ifndef __XML_THREADS_H__
-#include <libxml/threads.h>
-#include <libxml/globals.h>
-#endif
-#endif
-
-#endif  /* __DEBUG_MEMORY_ALLOC__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlmodule.h igraph-0.6.5/msvc/include/libxml/xmlmodule.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlmodule.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlmodule.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,57 +0,0 @@
-/*
- * Summary: dynamic module loading
- * Description: basic API for dynamic module loading, used by
- *              libexslt added in 2.6.17
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Joel W. Reed
- */
-
-#ifndef __XML_MODULE_H__
-#define __XML_MODULE_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_MODULES_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlModulePtr:
- *
- * A handle to a dynamically loaded module
- */
-typedef struct _xmlModule xmlModule;
-typedef xmlModule *xmlModulePtr;
-
-/**
- * xmlModuleOption:
- *
- * enumeration of options that can be passed down to xmlModuleOpen()
- */
-typedef enum {
-    XML_MODULE_LAZY = 1,	/* lazy binding */
-    XML_MODULE_LOCAL= 2		/* local binding */
-} xmlModuleOption;
-
-XMLPUBFUN xmlModulePtr XMLCALL xmlModuleOpen	(const char *filename,
-						 int options);
-
-XMLPUBFUN int XMLCALL xmlModuleSymbol		(xmlModulePtr module,
-						 const char* name,
-						 void **result);
-
-XMLPUBFUN int XMLCALL xmlModuleClose		(xmlModulePtr module);
-
-XMLPUBFUN int XMLCALL xmlModuleFree		(xmlModulePtr module);
-
-#ifdef __cplusplus
-}
-#endif 
-
-#endif /* LIBXML_MODULES_ENABLED */
-
-#endif /*__XML_MODULE_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlreader.h igraph-0.6.5/msvc/include/libxml/xmlreader.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlreader.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlreader.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,424 +0,0 @@
-/*
- * Summary: the XMLReader implementation
- * Description: API of the XML streaming API based on C# interfaces.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XMLREADER_H__
-#define __XML_XMLREADER_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/xmlIO.h>
-#ifdef LIBXML_SCHEMAS_ENABLED
-#include <libxml/relaxng.h>
-#include <libxml/xmlschemas.h>
-#endif
-
-#ifdef LIBXML_READER_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlTextReaderMode:
- *
- * Internal state values for the reader.
- */
-typedef enum {
-    XML_TEXTREADER_MODE_INITIAL = 0,
-    XML_TEXTREADER_MODE_INTERACTIVE = 1,
-    XML_TEXTREADER_MODE_ERROR = 2,
-    XML_TEXTREADER_MODE_EOF =3,
-    XML_TEXTREADER_MODE_CLOSED = 4,
-    XML_TEXTREADER_MODE_READING = 5
-} xmlTextReaderMode;
-
-/**
- * xmlParserProperties:
- *
- * Some common options to use with xmlTextReaderSetParserProp, but it
- * is better to use xmlParserOption and the xmlReaderNewxxx and
- * xmlReaderForxxx APIs now.
- */
-typedef enum {
-    XML_PARSER_LOADDTD = 1,
-    XML_PARSER_DEFAULTATTRS = 2,
-    XML_PARSER_VALIDATE = 3,
-    XML_PARSER_SUBST_ENTITIES = 4
-} xmlParserProperties;
-
-/**
- * xmlParserSeverities:
- *
- * How severe an error callback is when the per-reader error callback API
- * is used.
- */
-typedef enum {
-    XML_PARSER_SEVERITY_VALIDITY_WARNING = 1,
-    XML_PARSER_SEVERITY_VALIDITY_ERROR = 2,
-    XML_PARSER_SEVERITY_WARNING = 3,
-    XML_PARSER_SEVERITY_ERROR = 4
-} xmlParserSeverities;
-
-/**
- * xmlReaderTypes:
- *
- * Predefined constants for the different types of nodes.
- */
-typedef enum {
-    XML_READER_TYPE_NONE = 0,
-    XML_READER_TYPE_ELEMENT = 1,
-    XML_READER_TYPE_ATTRIBUTE = 2,
-    XML_READER_TYPE_TEXT = 3,
-    XML_READER_TYPE_CDATA = 4,
-    XML_READER_TYPE_ENTITY_REFERENCE = 5,
-    XML_READER_TYPE_ENTITY = 6,
-    XML_READER_TYPE_PROCESSING_INSTRUCTION = 7,
-    XML_READER_TYPE_COMMENT = 8,
-    XML_READER_TYPE_DOCUMENT = 9,
-    XML_READER_TYPE_DOCUMENT_TYPE = 10,
-    XML_READER_TYPE_DOCUMENT_FRAGMENT = 11,
-    XML_READER_TYPE_NOTATION = 12,
-    XML_READER_TYPE_WHITESPACE = 13,
-    XML_READER_TYPE_SIGNIFICANT_WHITESPACE = 14,
-    XML_READER_TYPE_END_ELEMENT = 15,
-    XML_READER_TYPE_END_ENTITY = 16,
-    XML_READER_TYPE_XML_DECLARATION = 17
-} xmlReaderTypes;
-
-/**
- * xmlTextReader:
- *
- * Structure for an xmlReader context.
- */
-typedef struct _xmlTextReader xmlTextReader;
-
-/**
- * xmlTextReaderPtr:
- *
- * Pointer to an xmlReader context.
- */
-typedef xmlTextReader *xmlTextReaderPtr;
-
-/*
- * Constructors & Destructor
- */
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-			xmlNewTextReader	(xmlParserInputBufferPtr input,
-	                                         const char *URI);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-			xmlNewTextReaderFilename(const char *URI);
-
-XMLPUBFUN void XMLCALL
-			xmlFreeTextReader	(xmlTextReaderPtr reader);
-
-XMLPUBFUN int XMLCALL
-            xmlTextReaderSetup(xmlTextReaderPtr reader,
-                   xmlParserInputBufferPtr input, const char *URL,
-                   const char *encoding, int options);
-
-/*
- * Iterators
- */
-XMLPUBFUN int XMLCALL
-			xmlTextReaderRead	(xmlTextReaderPtr reader);
-
-#ifdef LIBXML_WRITER_ENABLED
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderReadInnerXml	(xmlTextReaderPtr reader);
-
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderReadOuterXml	(xmlTextReaderPtr reader);
-#endif
-
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderReadString		(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderReadAttributeValue	(xmlTextReaderPtr reader);
-
-/*
- * Attributes of the node
- */
-XMLPUBFUN int XMLCALL
-			xmlTextReaderAttributeCount(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderDepth	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderHasAttributes(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderHasValue(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderIsDefault	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderIsEmptyElement(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderNodeType	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderQuoteChar	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-			xmlTextReaderReadState	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-                        xmlTextReaderIsNamespaceDecl(xmlTextReaderPtr reader);
-
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstBaseUri	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstLocalName	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstName	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstNamespaceUri(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstPrefix	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstXmlLang	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstString	(xmlTextReaderPtr reader,
-						 const xmlChar *str);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstValue	(xmlTextReaderPtr reader);
-
-/*
- * use the Const version of the routine for
- * better performance and simpler code
- */
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderBaseUri	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderLocalName	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderName	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderNamespaceUri(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderPrefix	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderXmlLang	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-			xmlTextReaderValue	(xmlTextReaderPtr reader);
-
-/*
- * Methods of the XmlTextReader
- */
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderClose		(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-		    xmlTextReaderGetAttributeNo	(xmlTextReaderPtr reader,
-						 int no);
-XMLPUBFUN xmlChar * XMLCALL
-		    xmlTextReaderGetAttribute	(xmlTextReaderPtr reader,
-						 const xmlChar *name);
-XMLPUBFUN xmlChar * XMLCALL
-		    xmlTextReaderGetAttributeNs	(xmlTextReaderPtr reader,
-						 const xmlChar *localName,
-						 const xmlChar *namespaceURI);
-XMLPUBFUN xmlParserInputBufferPtr XMLCALL
-		    xmlTextReaderGetRemainder	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlChar * XMLCALL
-		    xmlTextReaderLookupNamespace(xmlTextReaderPtr reader,
-						 const xmlChar *prefix);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToAttributeNo(xmlTextReaderPtr reader,
-						 int no);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToAttribute(xmlTextReaderPtr reader,
-						 const xmlChar *name);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToAttributeNs(xmlTextReaderPtr reader,
-						 const xmlChar *localName,
-						 const xmlChar *namespaceURI);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToFirstAttribute(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToNextAttribute(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderMoveToElement	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderNormalization	(xmlTextReaderPtr reader);
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstEncoding  (xmlTextReaderPtr reader);
-
-/*
- * Extensions
- */
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderSetParserProp	(xmlTextReaderPtr reader,
-						 int prop,
-						 int value);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderGetParserProp	(xmlTextReaderPtr reader,
-						 int prop);
-XMLPUBFUN xmlNodePtr XMLCALL
-		    xmlTextReaderCurrentNode	(xmlTextReaderPtr reader);
-
-XMLPUBFUN int XMLCALL
-            xmlTextReaderGetParserLineNumber(xmlTextReaderPtr reader);
-
-XMLPUBFUN int XMLCALL
-            xmlTextReaderGetParserColumnNumber(xmlTextReaderPtr reader);
-
-XMLPUBFUN xmlNodePtr XMLCALL
-		    xmlTextReaderPreserve	(xmlTextReaderPtr reader);
-#ifdef LIBXML_PATTERN_ENABLED
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderPreservePattern(xmlTextReaderPtr reader,
-						 const xmlChar *pattern,
-						 const xmlChar **namespaces);
-#endif /* LIBXML_PATTERN_ENABLED */
-XMLPUBFUN xmlDocPtr XMLCALL
-		    xmlTextReaderCurrentDoc	(xmlTextReaderPtr reader);
-XMLPUBFUN xmlNodePtr XMLCALL
-		    xmlTextReaderExpand		(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderNext		(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderNextSibling	(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderIsValid	(xmlTextReaderPtr reader);
-#ifdef LIBXML_SCHEMAS_ENABLED
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderRelaxNGValidate(xmlTextReaderPtr reader,
-						 const char *rng);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderRelaxNGSetSchema(xmlTextReaderPtr reader,
-						 xmlRelaxNGPtr schema);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderSchemaValidate	(xmlTextReaderPtr reader,
-						 const char *xsd);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderSchemaValidateCtxt(xmlTextReaderPtr reader,
-						 xmlSchemaValidCtxtPtr ctxt,
-						 int options);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderSetSchema	(xmlTextReaderPtr reader,
-						 xmlSchemaPtr schema);
-#endif
-XMLPUBFUN const xmlChar * XMLCALL
-		    xmlTextReaderConstXmlVersion(xmlTextReaderPtr reader);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderStandalone     (xmlTextReaderPtr reader);
-
-
-/*
- * Index lookup
- */
-XMLPUBFUN long XMLCALL
-		xmlTextReaderByteConsumed	(xmlTextReaderPtr reader);
-
-/*
- * New more complete APIs for simpler creation and reuse of readers
- */
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderWalker		(xmlDocPtr doc);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderForDoc		(const xmlChar * cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderForFile	(const char *filename,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderForMemory	(const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderForFd		(int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlTextReaderPtr XMLCALL
-		xmlReaderForIO		(xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-
-XMLPUBFUN int XMLCALL
-		xmlReaderNewWalker	(xmlTextReaderPtr reader,
-					 xmlDocPtr doc);
-XMLPUBFUN int XMLCALL
-		xmlReaderNewDoc		(xmlTextReaderPtr reader,
-					 const xmlChar * cur,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN int XMLCALL
-		xmlReaderNewFile	(xmlTextReaderPtr reader,
-					 const char *filename,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN int XMLCALL
-		xmlReaderNewMemory	(xmlTextReaderPtr reader,
-					 const char *buffer,
-					 int size,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN int XMLCALL
-		xmlReaderNewFd		(xmlTextReaderPtr reader,
-					 int fd,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN int XMLCALL
-		xmlReaderNewIO		(xmlTextReaderPtr reader,
-					 xmlInputReadCallback ioread,
-					 xmlInputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *URL,
-					 const char *encoding,
-					 int options);
-/*
- * Error handling extensions
- */
-typedef void *  xmlTextReaderLocatorPtr;
-
-/**
- * xmlTextReaderErrorFunc:
- * @arg: the user argument
- * @msg: the message
- * @severity: the severity of the error
- * @locator: a locator indicating where the error occured
- *
- * Signature of an error callback from a reader parser
- */
-typedef void   (XMLCALL *xmlTextReaderErrorFunc)(void *arg,
-						 const char *msg,
-						 xmlParserSeverities severity,
-						 xmlTextReaderLocatorPtr locator);
-XMLPUBFUN int XMLCALL
-		    xmlTextReaderLocatorLineNumber(xmlTextReaderLocatorPtr locator);
-/*int             xmlTextReaderLocatorLinePosition(xmlTextReaderLocatorPtr locator);*/
-XMLPUBFUN xmlChar * XMLCALL
-		    xmlTextReaderLocatorBaseURI (xmlTextReaderLocatorPtr locator);
-XMLPUBFUN void XMLCALL
-		    xmlTextReaderSetErrorHandler(xmlTextReaderPtr reader,
-						 xmlTextReaderErrorFunc f,
-						 void *arg);
-XMLPUBFUN void XMLCALL
-		    xmlTextReaderSetStructuredErrorHandler(xmlTextReaderPtr reader,
-							   xmlStructuredErrorFunc f,
-							   void *arg);
-XMLPUBFUN void XMLCALL
-		    xmlTextReaderGetErrorHandler(xmlTextReaderPtr reader,
-						 xmlTextReaderErrorFunc *f,
-						 void **arg);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_READER_ENABLED */
-
-#endif /* __XML_XMLREADER_H__ */
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlregexp.h igraph-0.6.5/msvc/include/libxml/xmlregexp.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlregexp.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlregexp.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,222 +0,0 @@
-/*
- * Summary: regular expressions handling
- * Description: basic API for libxml regular expressions handling used
- *              for XML Schemas and validation.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_REGEXP_H__
-#define __XML_REGEXP_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_REGEXP_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlRegexpPtr:
- *
- * A libxml regular expression, they can actually be far more complex
- * thank the POSIX regex expressions.
- */
-typedef struct _xmlRegexp xmlRegexp;
-typedef xmlRegexp *xmlRegexpPtr;
-
-/**
- * xmlRegExecCtxtPtr:
- *
- * A libxml progressive regular expression evaluation context
- */
-typedef struct _xmlRegExecCtxt xmlRegExecCtxt;
-typedef xmlRegExecCtxt *xmlRegExecCtxtPtr;
-
-#ifdef __cplusplus
-}
-#endif
-#include <libxml/tree.h>
-#include <libxml/dict.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * The POSIX like API
- */
-XMLPUBFUN xmlRegexpPtr XMLCALL
-		    xmlRegexpCompile	(const xmlChar *regexp);
-XMLPUBFUN void XMLCALL			 xmlRegFreeRegexp(xmlRegexpPtr regexp);
-XMLPUBFUN int XMLCALL
-		    xmlRegexpExec	(xmlRegexpPtr comp,
-					 const xmlChar *value);
-XMLPUBFUN void XMLCALL
-		    xmlRegexpPrint	(FILE *output,
-					 xmlRegexpPtr regexp);
-XMLPUBFUN int XMLCALL
-		    xmlRegexpIsDeterminist(xmlRegexpPtr comp);
-
-/**
- * xmlRegExecCallbacks:
- * @exec: the regular expression context
- * @token: the current token string
- * @transdata: transition data
- * @inputdata: input data
- *
- * Callback function when doing a transition in the automata
- */
-typedef void (*xmlRegExecCallbacks) (xmlRegExecCtxtPtr exec,
-	                             const xmlChar *token,
-				     void *transdata,
-				     void *inputdata);
-
-/*
- * The progressive API
- */
-XMLPUBFUN xmlRegExecCtxtPtr XMLCALL
-		    xmlRegNewExecCtxt	(xmlRegexpPtr comp,
-					 xmlRegExecCallbacks callback,
-					 void *data);
-XMLPUBFUN void XMLCALL
-		    xmlRegFreeExecCtxt	(xmlRegExecCtxtPtr exec);
-XMLPUBFUN int XMLCALL
-		    xmlRegExecPushString(xmlRegExecCtxtPtr exec,
-					 const xmlChar *value,
-					 void *data);
-XMLPUBFUN int XMLCALL
-		    xmlRegExecPushString2(xmlRegExecCtxtPtr exec,
-					 const xmlChar *value,
-					 const xmlChar *value2,
-					 void *data);
-
-XMLPUBFUN int XMLCALL
-		    xmlRegExecNextValues(xmlRegExecCtxtPtr exec,
-					 int *nbval,
-					 int *nbneg,
-					 xmlChar **values,
-					 int *terminal);
-XMLPUBFUN int XMLCALL
-		    xmlRegExecErrInfo	(xmlRegExecCtxtPtr exec,
-					 const xmlChar **string,
-					 int *nbval,
-					 int *nbneg,
-					 xmlChar **values,
-					 int *terminal);
-#ifdef LIBXML_EXPR_ENABLED
-/*
- * Formal regular expression handling
- * Its goal is to do some formal work on content models
- */
-
-/* expressions are used within a context */
-typedef struct _xmlExpCtxt xmlExpCtxt;
-typedef xmlExpCtxt *xmlExpCtxtPtr;
-
-XMLPUBFUN void XMLCALL
-			xmlExpFreeCtxt	(xmlExpCtxtPtr ctxt);
-XMLPUBFUN xmlExpCtxtPtr XMLCALL
-			xmlExpNewCtxt	(int maxNodes,
-					 xmlDictPtr dict);
-
-XMLPUBFUN int XMLCALL
-			xmlExpCtxtNbNodes(xmlExpCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-			xmlExpCtxtNbCons(xmlExpCtxtPtr ctxt);
-
-/* Expressions are trees but the tree is opaque */
-typedef struct _xmlExpNode xmlExpNode;
-typedef xmlExpNode *xmlExpNodePtr;
-
-typedef enum {
-    XML_EXP_EMPTY = 0,
-    XML_EXP_FORBID = 1,
-    XML_EXP_ATOM = 2,
-    XML_EXP_SEQ = 3,
-    XML_EXP_OR = 4,
-    XML_EXP_COUNT = 5
-} xmlExpNodeType;
-
-/*
- * 2 core expressions shared by all for the empty language set
- * and for the set with just the empty token
- */
-XMLPUBVAR xmlExpNodePtr forbiddenExp;
-XMLPUBVAR xmlExpNodePtr emptyExp;
-
-/*
- * Expressions are reference counted internally
- */
-XMLPUBFUN void XMLCALL
-			xmlExpFree	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr);
-XMLPUBFUN void XMLCALL
-			xmlExpRef	(xmlExpNodePtr expr);
-
-/*
- * constructors can be either manual or from a string
- */
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpParse	(xmlExpCtxtPtr ctxt,
-					 const char *expr);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpNewAtom	(xmlExpCtxtPtr ctxt,
-					 const xmlChar *name,
-					 int len);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpNewOr	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr left,
-					 xmlExpNodePtr right);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpNewSeq	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr left,
-					 xmlExpNodePtr right);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpNewRange	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr subset,
-					 int min,
-					 int max);
-/*
- * The really interesting APIs
- */
-XMLPUBFUN int XMLCALL
-			xmlExpIsNillable(xmlExpNodePtr expr);
-XMLPUBFUN int XMLCALL
-			xmlExpMaxToken	(xmlExpNodePtr expr);
-XMLPUBFUN int XMLCALL
-			xmlExpGetLanguage(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr,
-					 const xmlChar**langList,
-					 int len);
-XMLPUBFUN int XMLCALL
-			xmlExpGetStart	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr,
-					 const xmlChar**tokList,
-					 int len);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpStringDerive(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr,
-					 const xmlChar *str,
-					 int len);
-XMLPUBFUN xmlExpNodePtr XMLCALL
-			xmlExpExpDerive	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr,
-					 xmlExpNodePtr sub);
-XMLPUBFUN int XMLCALL
-			xmlExpSubsume	(xmlExpCtxtPtr ctxt,
-					 xmlExpNodePtr expr,
-					 xmlExpNodePtr sub);
-XMLPUBFUN void XMLCALL
-			xmlExpDump	(xmlBufferPtr buf,
-					 xmlExpNodePtr expr);
-#endif /* LIBXML_EXPR_ENABLED */
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_REGEXP_ENABLED */
-
-#endif /*__XML_REGEXP_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlsave.h igraph-0.6.5/msvc/include/libxml/xmlsave.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlsave.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlsave.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,84 +0,0 @@
-/*
- * Summary: the XML document serializer
- * Description: API to save document or subtree of document
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XMLSAVE_H__
-#define __XML_XMLSAVE_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/tree.h>
-#include <libxml/encoding.h>
-#include <libxml/xmlIO.h>
-
-#ifdef LIBXML_OUTPUT_ENABLED
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlSaveOption:
- *
- * This is the set of XML save options that can be passed down
- * to the xmlSaveToFd() and similar calls.
- */
-typedef enum {
-    XML_SAVE_FORMAT     = 1<<0,	/* format save output */
-    XML_SAVE_NO_DECL    = 1<<1,	/* drop the xml declaration */
-    XML_SAVE_NO_EMPTY	= 1<<2, /* no empty tags */
-    XML_SAVE_NO_XHTML	= 1<<3  /* disable XHTML1 specific rules */
-} xmlSaveOption;
-
-
-typedef struct _xmlSaveCtxt xmlSaveCtxt;
-typedef xmlSaveCtxt *xmlSaveCtxtPtr;
-
-XMLPUBFUN xmlSaveCtxtPtr XMLCALL
-		xmlSaveToFd		(int fd,
-					 const char *encoding,
-					 int options);
-XMLPUBFUN xmlSaveCtxtPtr XMLCALL
-		xmlSaveToFilename	(const char *filename,
-					 const char *encoding,
-					 int options);
-
-XMLPUBFUN xmlSaveCtxtPtr XMLCALL
-		xmlSaveToBuffer		(xmlBufferPtr buffer,
-					 const char *encoding,
-					 int options);
-
-XMLPUBFUN xmlSaveCtxtPtr XMLCALL
-		xmlSaveToIO		(xmlOutputWriteCallback iowrite,
-					 xmlOutputCloseCallback ioclose,
-					 void *ioctx,
-					 const char *encoding,
-					 int options);
-
-XMLPUBFUN long XMLCALL
-		xmlSaveDoc		(xmlSaveCtxtPtr ctxt,
-					 xmlDocPtr doc);
-XMLPUBFUN long XMLCALL
-		xmlSaveTree		(xmlSaveCtxtPtr ctxt,
-					 xmlNodePtr node);
-
-XMLPUBFUN int XMLCALL
-		xmlSaveFlush		(xmlSaveCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-		xmlSaveClose		(xmlSaveCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-		xmlSaveSetEscape	(xmlSaveCtxtPtr ctxt,
-					 xmlCharEncodingOutputFunc escape);
-XMLPUBFUN int XMLCALL
-		xmlSaveSetAttrEscape	(xmlSaveCtxtPtr ctxt,
-					 xmlCharEncodingOutputFunc escape);
-#ifdef __cplusplus
-}
-#endif
-#endif /* LIBXML_OUTPUT_ENABLED */
-#endif /* __XML_XMLSAVE_H__ */
-
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlschemas.h igraph-0.6.5/msvc/include/libxml/xmlschemas.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlschemas.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlschemas.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,218 +0,0 @@
-/*
- * Summary: incomplete XML Schemas structure implementation
- * Description: interface to the XML Schemas handling and schema validity
- *              checking, it is incomplete right now.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SCHEMA_H__
-#define __XML_SCHEMA_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_SCHEMAS_ENABLED
-
-#include <libxml/tree.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * This error codes are obsolete; not used any more.
- */
-typedef enum {
-    XML_SCHEMAS_ERR_OK		= 0,
-    XML_SCHEMAS_ERR_NOROOT	= 1,
-    XML_SCHEMAS_ERR_UNDECLAREDELEM,
-    XML_SCHEMAS_ERR_NOTTOPLEVEL,
-    XML_SCHEMAS_ERR_MISSING,
-    XML_SCHEMAS_ERR_WRONGELEM,
-    XML_SCHEMAS_ERR_NOTYPE,
-    XML_SCHEMAS_ERR_NOROLLBACK,
-    XML_SCHEMAS_ERR_ISABSTRACT,
-    XML_SCHEMAS_ERR_NOTEMPTY,
-    XML_SCHEMAS_ERR_ELEMCONT,
-    XML_SCHEMAS_ERR_HAVEDEFAULT,
-    XML_SCHEMAS_ERR_NOTNILLABLE,
-    XML_SCHEMAS_ERR_EXTRACONTENT,
-    XML_SCHEMAS_ERR_INVALIDATTR,
-    XML_SCHEMAS_ERR_INVALIDELEM,
-    XML_SCHEMAS_ERR_NOTDETERMINIST,
-    XML_SCHEMAS_ERR_CONSTRUCT,
-    XML_SCHEMAS_ERR_INTERNAL,
-    XML_SCHEMAS_ERR_NOTSIMPLE,
-    XML_SCHEMAS_ERR_ATTRUNKNOWN,
-    XML_SCHEMAS_ERR_ATTRINVALID,
-    XML_SCHEMAS_ERR_VALUE,
-    XML_SCHEMAS_ERR_FACET,
-    XML_SCHEMAS_ERR_,
-    XML_SCHEMAS_ERR_XXX
-} xmlSchemaValidError;
-
-/*
-* ATTENTION: Change xmlSchemaSetValidOptions's check
-* for invalid values, if adding to the validation
-* options below.
-*/
-/**
- * xmlSchemaValidOption:
- *
- * This is the set of XML Schema validation options.
- */
-typedef enum {
-    XML_SCHEMA_VAL_VC_I_CREATE			= 1<<0
-	/* Default/fixed: create an attribute node
-	* or an element's text node on the instance.
-	*/
-} xmlSchemaValidOption;
-
-/*
-    XML_SCHEMA_VAL_XSI_ASSEMBLE			= 1<<1,
-	* assemble schemata using
-	* xsi:schemaLocation and
-	* xsi:noNamespaceSchemaLocation
-*/
-
-/**
- * The schemas related types are kept internal
- */
-typedef struct _xmlSchema xmlSchema;
-typedef xmlSchema *xmlSchemaPtr;
-
-/**
- * xmlSchemaValidityErrorFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of an error callback from an XSD validation
- */
-typedef void (XMLCDECL *xmlSchemaValidityErrorFunc) (void *ctx, const char *msg, ...);
-
-/**
- * xmlSchemaValidityWarningFunc:
- * @ctx: the validation context
- * @msg: the message
- * @...: extra arguments
- *
- * Signature of a warning callback from an XSD validation
- */
-typedef void (XMLCDECL *xmlSchemaValidityWarningFunc) (void *ctx, const char *msg, ...);
-
-/**
- * A schemas validation context
- */
-typedef struct _xmlSchemaParserCtxt xmlSchemaParserCtxt;
-typedef xmlSchemaParserCtxt *xmlSchemaParserCtxtPtr;
-
-typedef struct _xmlSchemaValidCtxt xmlSchemaValidCtxt;
-typedef xmlSchemaValidCtxt *xmlSchemaValidCtxtPtr;
-
-/*
- * Interfaces for parsing.
- */
-XMLPUBFUN xmlSchemaParserCtxtPtr XMLCALL
-	    xmlSchemaNewParserCtxt	(const char *URL);
-XMLPUBFUN xmlSchemaParserCtxtPtr XMLCALL
-	    xmlSchemaNewMemParserCtxt	(const char *buffer,
-					 int size);
-XMLPUBFUN xmlSchemaParserCtxtPtr XMLCALL
-	    xmlSchemaNewDocParserCtxt	(xmlDocPtr doc);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaFreeParserCtxt	(xmlSchemaParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaSetParserErrors	(xmlSchemaParserCtxtPtr ctxt,
-					 xmlSchemaValidityErrorFunc err,
-					 xmlSchemaValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaSetParserStructuredErrors(xmlSchemaParserCtxtPtr ctxt,
-					 xmlStructuredErrorFunc serror,
-					 void *ctx);
-XMLPUBFUN int XMLCALL
-		xmlSchemaGetParserErrors(xmlSchemaParserCtxtPtr ctxt,
-					xmlSchemaValidityErrorFunc * err,
-					xmlSchemaValidityWarningFunc * warn,
-					void **ctx);
-XMLPUBFUN int XMLCALL
-		xmlSchemaIsValid	(xmlSchemaValidCtxtPtr ctxt);
-
-XMLPUBFUN xmlSchemaPtr XMLCALL
-	    xmlSchemaParse		(xmlSchemaParserCtxtPtr ctxt);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaFree		(xmlSchemaPtr schema);
-#ifdef LIBXML_OUTPUT_ENABLED
-XMLPUBFUN void XMLCALL
-	    xmlSchemaDump		(FILE *output,
-					 xmlSchemaPtr schema);
-#endif /* LIBXML_OUTPUT_ENABLED */
-/*
- * Interfaces for validating
- */
-XMLPUBFUN void XMLCALL
-	    xmlSchemaSetValidErrors	(xmlSchemaValidCtxtPtr ctxt,
-					 xmlSchemaValidityErrorFunc err,
-					 xmlSchemaValidityWarningFunc warn,
-					 void *ctx);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaSetValidStructuredErrors(xmlSchemaValidCtxtPtr ctxt,
-					 xmlStructuredErrorFunc serror,
-					 void *ctx);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaGetValidErrors	(xmlSchemaValidCtxtPtr ctxt,
-					 xmlSchemaValidityErrorFunc *err,
-					 xmlSchemaValidityWarningFunc *warn,
-					 void **ctx);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaSetValidOptions	(xmlSchemaValidCtxtPtr ctxt,
-					 int options);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaValidCtxtGetOptions(xmlSchemaValidCtxtPtr ctxt);
-
-XMLPUBFUN xmlSchemaValidCtxtPtr XMLCALL
-	    xmlSchemaNewValidCtxt	(xmlSchemaPtr schema);
-XMLPUBFUN void XMLCALL
-	    xmlSchemaFreeValidCtxt	(xmlSchemaValidCtxtPtr ctxt);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaValidateDoc	(xmlSchemaValidCtxtPtr ctxt,
-					 xmlDocPtr instance);
-XMLPUBFUN int XMLCALL
-            xmlSchemaValidateOneElement (xmlSchemaValidCtxtPtr ctxt,
-			                 xmlNodePtr elem);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaValidateStream	(xmlSchemaValidCtxtPtr ctxt,
-					 xmlParserInputBufferPtr input,
-					 xmlCharEncoding enc,
-					 xmlSAXHandlerPtr sax,
-					 void *user_data);
-XMLPUBFUN int XMLCALL
-	    xmlSchemaValidateFile	(xmlSchemaValidCtxtPtr ctxt,
-					 const char * filename,
-					 int options);
-
-XMLPUBFUN xmlParserCtxtPtr XMLCALL
-	    xmlSchemaValidCtxtGetParserCtxt(xmlSchemaValidCtxtPtr ctxt);
-
-/*
- * Interface to insert Schemas SAX validation in a SAX stream
- */
-typedef struct _xmlSchemaSAXPlug xmlSchemaSAXPlugStruct;
-typedef xmlSchemaSAXPlugStruct *xmlSchemaSAXPlugPtr;
-
-XMLPUBFUN xmlSchemaSAXPlugPtr XMLCALL
-            xmlSchemaSAXPlug		(xmlSchemaValidCtxtPtr ctxt,
-					 xmlSAXHandlerPtr *sax,
-					 void **user_data);
-XMLPUBFUN int XMLCALL
-            xmlSchemaSAXUnplug		(xmlSchemaSAXPlugPtr plug);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_SCHEMAS_ENABLED */
-#endif /* __XML_SCHEMA_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlschemastypes.h igraph-0.6.5/msvc/include/libxml/xmlschemastypes.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlschemastypes.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlschemastypes.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,151 +0,0 @@
-/*
- * Summary: implementation of XML Schema Datatypes
- * Description: module providing the XML Schema Datatypes implementation
- *              both definition and validity checking
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-
-#ifndef __XML_SCHEMA_TYPES_H__
-#define __XML_SCHEMA_TYPES_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_SCHEMAS_ENABLED
-
-#include <libxml/schemasInternals.h>
-#include <libxml/xmlschemas.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef enum {
-    XML_SCHEMA_WHITESPACE_UNKNOWN = 0,
-    XML_SCHEMA_WHITESPACE_PRESERVE = 1,
-    XML_SCHEMA_WHITESPACE_REPLACE = 2,
-    XML_SCHEMA_WHITESPACE_COLLAPSE = 3
-} xmlSchemaWhitespaceValueType;
-
-XMLPUBFUN void XMLCALL		
-    		xmlSchemaInitTypes		(void);
-XMLPUBFUN void XMLCALL		
-		xmlSchemaCleanupTypes		(void);
-XMLPUBFUN xmlSchemaTypePtr XMLCALL 
-		xmlSchemaGetPredefinedType	(const xmlChar *name,
-						 const xmlChar *ns);
-XMLPUBFUN int XMLCALL		
-		xmlSchemaValidatePredefinedType	(xmlSchemaTypePtr type,
-						 const xmlChar *value,
-						 xmlSchemaValPtr *val);
-XMLPUBFUN int XMLCALL		
-		xmlSchemaValPredefTypeNode	(xmlSchemaTypePtr type,
-						 const xmlChar *value,
-						 xmlSchemaValPtr *val,
-						 xmlNodePtr node);
-XMLPUBFUN int XMLCALL		
-		xmlSchemaValidateFacet		(xmlSchemaTypePtr base,
-						 xmlSchemaFacetPtr facet,
-						 const xmlChar *value,
-						 xmlSchemaValPtr val);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValidateFacetWhtsp	(xmlSchemaFacetPtr facet,
-						 xmlSchemaWhitespaceValueType fws,
-						 xmlSchemaValType valType,						 
-						 const xmlChar *value,
-						 xmlSchemaValPtr val,
-						 xmlSchemaWhitespaceValueType ws);
-XMLPUBFUN void XMLCALL		
-		xmlSchemaFreeValue		(xmlSchemaValPtr val);
-XMLPUBFUN xmlSchemaFacetPtr XMLCALL 
-		xmlSchemaNewFacet		(void);
-XMLPUBFUN int XMLCALL		
-		xmlSchemaCheckFacet		(xmlSchemaFacetPtr facet,
-						 xmlSchemaTypePtr typeDecl,
-						 xmlSchemaParserCtxtPtr ctxt,
-						 const xmlChar *name);
-XMLPUBFUN void XMLCALL		
-		xmlSchemaFreeFacet		(xmlSchemaFacetPtr facet);
-XMLPUBFUN int XMLCALL		
-		xmlSchemaCompareValues		(xmlSchemaValPtr x,
-						 xmlSchemaValPtr y);
-XMLPUBFUN xmlSchemaTypePtr XMLCALL		
-    xmlSchemaGetBuiltInListSimpleTypeItemType	(xmlSchemaTypePtr type);
-XMLPUBFUN int XMLCALL
-    xmlSchemaValidateListSimpleTypeFacet	(xmlSchemaFacetPtr facet,
-						 const xmlChar *value,
-						 unsigned long actualLen,
-						 unsigned long *expectedLen);
-XMLPUBFUN xmlSchemaTypePtr XMLCALL
-		xmlSchemaGetBuiltInType		(xmlSchemaValType type);
-XMLPUBFUN int XMLCALL
-		xmlSchemaIsBuiltInTypeFacet	(xmlSchemaTypePtr type, 
-						 int facetType);
-XMLPUBFUN xmlChar * XMLCALL
-		xmlSchemaCollapseString		(const xmlChar *value);
-XMLPUBFUN xmlChar * XMLCALL
-		xmlSchemaWhiteSpaceReplace	(const xmlChar *value);
-XMLPUBFUN unsigned long  XMLCALL
-		xmlSchemaGetFacetValueAsULong	(xmlSchemaFacetPtr facet);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValidateLengthFacet	(xmlSchemaTypePtr type, 
-						 xmlSchemaFacetPtr facet,
-						 const xmlChar *value,
-						 xmlSchemaValPtr val,
-						 unsigned long *length);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValidateLengthFacetWhtsp(xmlSchemaFacetPtr facet,
-						  xmlSchemaValType valType,
-						  const xmlChar *value,
-						  xmlSchemaValPtr val,						  
-						  unsigned long *length,
-						  xmlSchemaWhitespaceValueType ws);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValPredefTypeNodeNoNorm(xmlSchemaTypePtr type, 
-						 const xmlChar *value,
-						 xmlSchemaValPtr *val, 
-						 xmlNodePtr node);
-XMLPUBFUN int XMLCALL
-		xmlSchemaGetCanonValue		(xmlSchemaValPtr val,
-						 const xmlChar **retValue);
-XMLPUBFUN int XMLCALL
-		xmlSchemaGetCanonValueWhtsp	(xmlSchemaValPtr val,						 
-						 const xmlChar **retValue,
-						 xmlSchemaWhitespaceValueType ws);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValueAppend		(xmlSchemaValPtr prev,
-						 xmlSchemaValPtr cur);
-XMLPUBFUN xmlSchemaValPtr XMLCALL
-		xmlSchemaValueGetNext		(xmlSchemaValPtr cur);
-XMLPUBFUN const xmlChar * XMLCALL
-		xmlSchemaValueGetAsString	(xmlSchemaValPtr val);
-XMLPUBFUN int XMLCALL
-		xmlSchemaValueGetAsBoolean	(xmlSchemaValPtr val);
-XMLPUBFUN xmlSchemaValPtr XMLCALL
-		xmlSchemaNewStringValue		(xmlSchemaValType type,
-						 const xmlChar *value);
-XMLPUBFUN xmlSchemaValPtr XMLCALL
-		xmlSchemaNewNOTATIONValue	(const xmlChar *name,
-						 const xmlChar *ns);
-XMLPUBFUN xmlSchemaValPtr XMLCALL
-		xmlSchemaNewQNameValue		(const xmlChar *namespaceName,
-						 const xmlChar *localName);
-XMLPUBFUN int XMLCALL
-		xmlSchemaCompareValuesWhtsp	(xmlSchemaValPtr x,
-						 xmlSchemaWhitespaceValueType xws,
-						 xmlSchemaValPtr y,
-						 xmlSchemaWhitespaceValueType yws);
-XMLPUBFUN xmlSchemaValPtr XMLCALL
-		xmlSchemaCopyValue		(xmlSchemaValPtr val);
-XMLPUBFUN xmlSchemaValType XMLCALL
-		xmlSchemaGetValType		(xmlSchemaValPtr val);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_SCHEMAS_ENABLED */
-#endif /* __XML_SCHEMA_TYPES_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlstring.h igraph-0.6.5/msvc/include/libxml/xmlstring.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlstring.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlstring.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,140 +0,0 @@
-/*
- * Summary: set of routines to process strings
- * Description: type and interfaces needed for the internal string handling
- *              of the library, especially UTF8 processing.
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_STRING_H__
-#define __XML_STRING_H__
-
-#include <stdarg.h>
-#include <libxml/xmlversion.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * xmlChar:
- *
- * This is a basic byte in an UTF-8 encoded string.
- * It's unsigned allowing to pinpoint case where char * are assigned
- * to xmlChar * (possibly making serialization back impossible).
- */
-typedef unsigned char xmlChar;
-
-/**
- * BAD_CAST:
- *
- * Macro to cast a string to an xmlChar * when one know its safe.
- */
-#define BAD_CAST (xmlChar *)
-
-/*
- * xmlChar handling
- */
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrdup                (const xmlChar *cur);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrndup               (const xmlChar *cur,
-                                         int len);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlCharStrndup           (const char *cur,
-                                         int len);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlCharStrdup            (const char *cur);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrsub                (const xmlChar *str,
-                                         int start,
-                                         int len);
-XMLPUBFUN const xmlChar * XMLCALL
-                xmlStrchr                (const xmlChar *str,
-                                         xmlChar val);
-XMLPUBFUN const xmlChar * XMLCALL
-                xmlStrstr                (const xmlChar *str,
-                                         const xmlChar *val);
-XMLPUBFUN const xmlChar * XMLCALL
-                xmlStrcasestr            (const xmlChar *str,
-                                         xmlChar *val);
-XMLPUBFUN int XMLCALL
-                xmlStrcmp                (const xmlChar *str1,
-                                         const xmlChar *str2);
-XMLPUBFUN int XMLCALL
-                xmlStrncmp               (const xmlChar *str1,
-                                         const xmlChar *str2,
-                                         int len);
-XMLPUBFUN int XMLCALL
-                xmlStrcasecmp            (const xmlChar *str1,
-                                         const xmlChar *str2);
-XMLPUBFUN int XMLCALL
-                xmlStrncasecmp           (const xmlChar *str1,
-                                         const xmlChar *str2,
-                                         int len);
-XMLPUBFUN int XMLCALL
-                xmlStrEqual              (const xmlChar *str1,
-                                         const xmlChar *str2);
-XMLPUBFUN int XMLCALL
-                xmlStrQEqual             (const xmlChar *pref,
-                                         const xmlChar *name,
-                                         const xmlChar *str);
-XMLPUBFUN int XMLCALL
-                xmlStrlen                (const xmlChar *str);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrcat                (xmlChar *cur,
-                                         const xmlChar *add);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrncat               (xmlChar *cur,
-                                         const xmlChar *add,
-                                         int len);
-XMLPUBFUN xmlChar * XMLCALL
-                xmlStrncatNew            (const xmlChar *str1,
-                                         const xmlChar *str2,
-                                         int len);
-XMLPUBFUN int XMLCALL
-                xmlStrPrintf             (xmlChar *buf,
-                                         int len,
-                                         const xmlChar *msg,
-                                         ...);
-XMLPUBFUN int XMLCALL
-                xmlStrVPrintf                (xmlChar *buf,
-                                         int len,
-                                         const xmlChar *msg,
-                                         va_list ap);
-
-XMLPUBFUN int XMLCALL
-        xmlGetUTF8Char                   (const unsigned char *utf,
-                                         int *len);
-XMLPUBFUN int XMLCALL
-        xmlCheckUTF8                     (const unsigned char *utf);
-XMLPUBFUN int XMLCALL
-        xmlUTF8Strsize                   (const xmlChar *utf,
-                                         int len);
-XMLPUBFUN xmlChar * XMLCALL 
-        xmlUTF8Strndup                   (const xmlChar *utf,
-                                         int len);
-XMLPUBFUN const xmlChar * XMLCALL 
-        xmlUTF8Strpos                    (const xmlChar *utf,
-                                         int pos);
-XMLPUBFUN int XMLCALL
-        xmlUTF8Strloc                    (const xmlChar *utf,
-                                         const xmlChar *utfchar);
-XMLPUBFUN xmlChar * XMLCALL 
-        xmlUTF8Strsub                    (const xmlChar *utf,
-                                         int start,
-                                         int len);
-XMLPUBFUN int XMLCALL
-        xmlUTF8Strlen                    (const xmlChar *utf);
-XMLPUBFUN int XMLCALL
-        xmlUTF8Size                      (const xmlChar *utf);
-XMLPUBFUN int XMLCALL
-        xmlUTF8Charcmp                   (const xmlChar *utf1,
-                                         const xmlChar *utf2);
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* __XML_STRING_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlunicode.h igraph-0.6.5/msvc/include/libxml/xmlunicode.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlunicode.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlunicode.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,202 +0,0 @@
-/*
- * Summary: Unicode character APIs
- * Description: API for the Unicode character APIs
- *
- * This file is automatically generated from the
- * UCS description files of the Unicode Character Database
- * http://www.unicode.org/Public/4.0-Update1/UCD-4.0.1.html
- * using the genUnicode.py Python script.
- *
- * Generation date: Mon Mar 27 11:09:52 2006
- * Sources: Blocks-4.0.1.txt UnicodeData-4.0.1.txt
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_UNICODE_H__
-#define __XML_UNICODE_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_UNICODE_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-XMLPUBFUN int XMLCALL xmlUCSIsAegeanNumbers	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsAlphabeticPresentationForms	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsArabic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsArabicPresentationFormsA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsArabicPresentationFormsB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsArmenian	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsArrows	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBasicLatin	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBengali	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBlockElements	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBopomofo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBopomofoExtended	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBoxDrawing	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBraillePatterns	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsBuhid	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsByzantineMusicalSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKCompatibility	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKCompatibilityForms	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKCompatibilityIdeographs	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKCompatibilityIdeographsSupplement	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKRadicalsSupplement	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKSymbolsandPunctuation	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKUnifiedIdeographs	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKUnifiedIdeographsExtensionA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCJKUnifiedIdeographsExtensionB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCherokee	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCombiningDiacriticalMarks	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCombiningDiacriticalMarksforSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCombiningHalfMarks	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCombiningMarksforSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsControlPictures	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCurrencySymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCypriotSyllabary	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCyrillic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCyrillicSupplement	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsDeseret	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsDevanagari	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsDingbats	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsEnclosedAlphanumerics	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsEnclosedCJKLettersandMonths	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsEthiopic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGeneralPunctuation	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGeometricShapes	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGeorgian	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGothic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGreek	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGreekExtended	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGreekandCoptic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGujarati	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsGurmukhi	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHalfwidthandFullwidthForms	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHangulCompatibilityJamo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHangulJamo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHangulSyllables	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHanunoo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHebrew	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHighPrivateUseSurrogates	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHighSurrogates	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsHiragana	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsIPAExtensions	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsIdeographicDescriptionCharacters	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKanbun	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKangxiRadicals	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKannada	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKatakana	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKatakanaPhoneticExtensions	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKhmer	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsKhmerSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLao	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLatin1Supplement	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLatinExtendedA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLatinExtendedB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLatinExtendedAdditional	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLetterlikeSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLimbu	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLinearBIdeograms	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLinearBSyllabary	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsLowSurrogates	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMalayalam	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMathematicalAlphanumericSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMathematicalOperators	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMiscellaneousMathematicalSymbolsA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMiscellaneousMathematicalSymbolsB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMiscellaneousSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMiscellaneousSymbolsandArrows	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMiscellaneousTechnical	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMongolian	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMusicalSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsMyanmar	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsNumberForms	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsOgham	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsOldItalic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsOpticalCharacterRecognition	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsOriya	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsOsmanya	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsPhoneticExtensions	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsPrivateUse	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsPrivateUseArea	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsRunic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsShavian	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSinhala	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSmallFormVariants	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSpacingModifierLetters	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSpecials	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSuperscriptsandSubscripts	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSupplementalArrowsA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSupplementalArrowsB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSupplementalMathematicalOperators	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSupplementaryPrivateUseAreaA	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSupplementaryPrivateUseAreaB	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsSyriac	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTagalog	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTagbanwa	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTags	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTaiLe	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTaiXuanJingSymbols	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTamil	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTelugu	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsThaana	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsThai	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsTibetan	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsUgaritic	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsUnifiedCanadianAboriginalSyllabics	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsVariationSelectors	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsVariationSelectorsSupplement	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsYiRadicals	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsYiSyllables	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsYijingHexagramSymbols	(int code);
-
-XMLPUBFUN int XMLCALL xmlUCSIsBlock	(int code, const char *block);
-
-XMLPUBFUN int XMLCALL xmlUCSIsCatC	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatCc	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatCf	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatCo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatCs	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatL	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatLl	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatLm	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatLo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatLt	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatLu	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatM	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatMc	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatMe	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatMn	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatN	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatNd	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatNl	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatNo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatP	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPc	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPd	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPe	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPf	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPi	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatPs	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatS	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatSc	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatSk	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatSm	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatSo	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatZ	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatZl	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatZp	(int code);
-XMLPUBFUN int XMLCALL xmlUCSIsCatZs	(int code);
-
-XMLPUBFUN int XMLCALL xmlUCSIsCat	(int code, const char *cat);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_UNICODE_ENABLED */
-
-#endif /* __XML_UNICODE_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlversion.h igraph-0.6.5/msvc/include/libxml/xmlversion.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlversion.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlversion.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,406 +0,0 @@
-/*
- * Summary: compile-time version informations
- * Description: compile-time version informations for the XML library
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_VERSION_H__
-#define __XML_VERSION_H__
-
-#include <libxml/xmlexports.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * use those to be sure nothing nasty will happen if
- * your library and includes mismatch
- */
-#ifndef LIBXML2_COMPILING_MSCCDEF
-XMLPUBFUN void XMLCALL xmlCheckVersion(int version);
-#endif /* LIBXML2_COMPILING_MSCCDEF */
-
-/**
- * LIBXML_DOTTED_VERSION:
- *
- * the version string like "1.2.3"
- */
-#define LIBXML_DOTTED_VERSION "2.6.32"
-
-/**
- * LIBXML_VERSION:
- *
- * the version number: 1.2.3 value is 10203
- */
-#define LIBXML_VERSION 20632
-
-/**
- * LIBXML_VERSION_STRING:
- *
- * the version number string, 1.2.3 value is "10203"
- */
-#define LIBXML_VERSION_STRING "20632"
-
-/**
- * LIBXML_VERSION_EXTRA:
- *
- * extra version information, used to show a CVS compilation
- */
-#define LIBXML_VERSION_EXTRA ""
-
-/**
- * LIBXML_TEST_VERSION:
- *
- * Macro to check that the libxml version in use is compatible with
- * the version the software has been compiled against
- */
-#define LIBXML_TEST_VERSION xmlCheckVersion(20632);
-
-#ifndef VMS
-#if 0
-/**
- * WITH_TRIO:
- *
- * defined if the trio support need to be configured in
- */
-#define WITH_TRIO
-#else
-/**
- * WITHOUT_TRIO:
- *
- * defined if the trio support should not be configured in
- */
-#define WITHOUT_TRIO
-#endif
-#else /* VMS */
-/**
- * WITH_TRIO:
- *
- * defined if the trio support need to be configured in
- */
-#define WITH_TRIO 1
-#endif /* VMS */
-
-/**
- * LIBXML_THREAD_ENABLED:
- *
- * Whether the thread support is configured in
- */
-#if 1
-#if defined(_REENTRANT) || defined(__MT__) || \
-    (defined(_POSIX_C_SOURCE) && (_POSIX_C_SOURCE - 0 >= 199506L))
-#define LIBXML_THREAD_ENABLED
-#endif
-#endif
-
-/**
- * LIBXML_TREE_ENABLED:
- *
- * Whether the DOM like tree manipulation API support is configured in
- */
-#if 1
-#define LIBXML_TREE_ENABLED
-#endif
-
-/**
- * LIBXML_OUTPUT_ENABLED:
- *
- * Whether the serialization/saving support is configured in
- */
-#if 1
-#define LIBXML_OUTPUT_ENABLED
-#endif
-
-/**
- * LIBXML_PUSH_ENABLED:
- *
- * Whether the push parsing interfaces are configured in
- */
-#if 1
-#define LIBXML_PUSH_ENABLED
-#endif
-
-/**
- * LIBXML_READER_ENABLED:
- *
- * Whether the xmlReader parsing interface is configured in
- */
-#if 1
-#define LIBXML_READER_ENABLED
-#endif
-
-/**
- * LIBXML_PATTERN_ENABLED:
- *
- * Whether the xmlPattern node selection interface is configured in
- */
-#if 1
-#define LIBXML_PATTERN_ENABLED
-#endif
-
-/**
- * LIBXML_WRITER_ENABLED:
- *
- * Whether the xmlWriter saving interface is configured in
- */
-#if 1
-#define LIBXML_WRITER_ENABLED
-#endif
-
-/**
- * LIBXML_SAX1_ENABLED:
- *
- * Whether the older SAX1 interface is configured in
- */
-#if 1
-#define LIBXML_SAX1_ENABLED
-#endif
-
-/**
- * LIBXML_FTP_ENABLED:
- *
- * Whether the FTP support is configured in
- */
-#if 1
-#define LIBXML_FTP_ENABLED
-#endif
-
-/**
- * LIBXML_HTTP_ENABLED:
- *
- * Whether the HTTP support is configured in
- */
-#if 1
-#define LIBXML_HTTP_ENABLED
-#endif
-
-/**
- * LIBXML_VALID_ENABLED:
- *
- * Whether the DTD validation support is configured in
- */
-#if 1
-#define LIBXML_VALID_ENABLED
-#endif
-
-/**
- * LIBXML_HTML_ENABLED:
- *
- * Whether the HTML support is configured in
- */
-#if 1
-#define LIBXML_HTML_ENABLED
-#endif
-
-/**
- * LIBXML_LEGACY_ENABLED:
- *
- * Whether the deprecated APIs are compiled in for compatibility
- */
-#if 1
-#define LIBXML_LEGACY_ENABLED
-#endif
-
-/**
- * LIBXML_C14N_ENABLED:
- *
- * Whether the Canonicalization support is configured in
- */
-#if 1
-#define LIBXML_C14N_ENABLED
-#endif
-
-/**
- * LIBXML_CATALOG_ENABLED:
- *
- * Whether the Catalog support is configured in
- */
-#if 1
-#define LIBXML_CATALOG_ENABLED
-#endif
-
-/**
- * LIBXML_DOCB_ENABLED:
- *
- * Whether the SGML Docbook support is configured in
- */
-#if 1
-#define LIBXML_DOCB_ENABLED
-#endif
-
-/**
- * LIBXML_XPATH_ENABLED:
- *
- * Whether XPath is configured in
- */
-#if 1
-#define LIBXML_XPATH_ENABLED
-#endif
-
-/**
- * LIBXML_XPTR_ENABLED:
- *
- * Whether XPointer is configured in
- */
-#if 1
-#define LIBXML_XPTR_ENABLED
-#endif
-
-/**
- * LIBXML_XINCLUDE_ENABLED:
- *
- * Whether XInclude is configured in
- */
-#if 1
-#define LIBXML_XINCLUDE_ENABLED
-#endif
-
-/**
- * LIBXML_ICONV_ENABLED:
- *
- * Whether iconv support is available
- */
-#if 1
-#define LIBXML_ICONV_ENABLED
-#endif
-
-/**
- * LIBXML_ISO8859X_ENABLED:
- *
- * Whether ISO-8859-* support is made available in case iconv is not
- */
-#if 0
-#define LIBXML_ISO8859X_ENABLED
-#endif
-
-/**
- * LIBXML_DEBUG_ENABLED:
- *
- * Whether Debugging module is configured in
- */
-#if 1
-#define LIBXML_DEBUG_ENABLED
-#endif
-
-/**
- * DEBUG_MEMORY_LOCATION:
- *
- * Whether the memory debugging is configured in
- */
-#if 0
-#define DEBUG_MEMORY_LOCATION
-#endif
-
-/**
- * LIBXML_DEBUG_RUNTIME:
- *
- * Whether the runtime debugging is configured in
- */
-#if 0
-#define LIBXML_DEBUG_RUNTIME
-#endif
-
-/**
- * LIBXML_UNICODE_ENABLED:
- *
- * Whether the Unicode related interfaces are compiled in
- */
-#if 1
-#define LIBXML_UNICODE_ENABLED
-#endif
-
-/**
- * LIBXML_REGEXP_ENABLED:
- *
- * Whether the regular expressions interfaces are compiled in
- */
-#if 1
-#define LIBXML_REGEXP_ENABLED
-#endif
-
-/**
- * LIBXML_AUTOMATA_ENABLED:
- *
- * Whether the automata interfaces are compiled in
- */
-#if 1
-#define LIBXML_AUTOMATA_ENABLED
-#endif
-
-/**
- * LIBXML_EXPR_ENABLED:
- *
- * Whether the formal expressions interfaces are compiled in
- */
-#if 1
-#define LIBXML_EXPR_ENABLED
-#endif
-
-/**
- * LIBXML_SCHEMAS_ENABLED:
- *
- * Whether the Schemas validation interfaces are compiled in
- */
-#if 1
-#define LIBXML_SCHEMAS_ENABLED
-#endif
-
-/**
- * LIBXML_SCHEMATRON_ENABLED:
- *
- * Whether the Schematron validation interfaces are compiled in
- */
-#if 1
-#define LIBXML_SCHEMATRON_ENABLED
-#endif
-
-/**
- * LIBXML_MODULES_ENABLED:
- *
- * Whether the module interfaces are compiled in
- */
-#if 1
-#define LIBXML_MODULES_ENABLED
-/**
- * LIBXML_MODULE_EXTENSION:
- *
- * the string suffix used by dynamic modules (usually shared libraries)
- */
-#define LIBXML_MODULE_EXTENSION ".dll" 
-#endif
-
-/**
- * LIBXML_ZLIB_ENABLED:
- *
- * Whether the Zlib support is compiled in
- */
-#if 1
-#define LIBXML_ZLIB_ENABLED
-#endif
-
-/**
- * ATTRIBUTE_UNUSED:
- *
- * Macro used to signal to GCC unused function parameters
- */
-#ifdef __GNUC__
-#ifdef HAVE_ANSIDECL_H
-#include <ansidecl.h>
-#endif
-#ifndef ATTRIBUTE_UNUSED
-#define ATTRIBUTE_UNUSED __attribute__((unused))
-#endif
-#else
-#define ATTRIBUTE_UNUSED
-#endif
-
-#ifdef __cplusplus
-}
-#endif /* __cplusplus */
-#endif
-
-
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlwin32version.h igraph-0.6.5/msvc/include/libxml/xmlwin32version.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlwin32version.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlwin32version.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,242 +0,0 @@
-/*
- * Summary: compile-time version informations on Windows
- * Description: compile-time version informations for the XML library
- *              when compiled on the Windows platform
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_VERSION_H__
-#define __XML_VERSION_H__
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * use those to be sure nothing nasty will happen if
- * your library and includes mismatch
- */
-#ifndef LIBXML2_COMPILING_MSCCDEF
-extern void xmlCheckVersion(int version);
-#endif /* LIBXML2_COMPILING_MSCCDEF */
-
-/**
- * LIBXML_DOTTED_VERSION:
- *
- * the version string like "1.2.3"
- */
-#define LIBXML_DOTTED_VERSION "2.4.26"
-
-/**
- * LIBXML_VERSION:
- *
- * the version number: 1.2.3 value is 1002003
- */
-#define LIBXML_VERSION 20426
-
-/**
- * LIBXML_VERSION_STRING:
- *
- * the version number string, 1.2.3 value is "1002003"
- */
-#define LIBXML_VERSION_STRING "20426"
-
-/**
- * LIBXML_TEST_VERSION:
- *
- * Macro to check that the libxml version in use is compatible with
- * the version the software has been compiled against
- */
-#define LIBXML_TEST_VERSION xmlCheckVersion(20426);
-
-#if 0
-/**
- * WITH_TRIO:
- *
- * defined if the trio support need to be configured in
- */
-#define WITH_TRIO
-#else
-/**
- * WITHOUT_TRIO:
- *
- * defined if the trio support should not be configured in
- */
-#define WITHOUT_TRIO
-#endif
-
-/**
- * LIBXML_THREAD_ENABLED:
- *
- * Whether the thread support is configured in
- */
-#if 0
-#define LIBXML_THREAD_ENABLED
-#endif
-
-/**
- * LIBXML_FTP_ENABLED:
- *
- * Whether the FTP support is configured in
- */
-#if 1
-#define LIBXML_FTP_ENABLED
-#endif
-
-/**
- * LIBXML_HTTP_ENABLED:
- *
- * Whether the HTTP support is configured in
- */
-#if 1
-#define LIBXML_HTTP_ENABLED
-#endif
-
-/**
- * LIBXML_HTML_ENABLED:
- *
- * Whether the HTML support is configured in
- */
-#if 1
-#define LIBXML_HTML_ENABLED
-#endif
-
-/**
- * LIBXML_CATALOG_ENABLED:
- *
- * Whether the Catalog support is configured in
- */
-#if 1
-#define LIBXML_CATALOG_ENABLED
-#endif
-
-/**
- * LIBXML_DOCB_ENABLED:
- *
- * Whether the SGML Docbook support is configured in
- */
-#if 1
-#define LIBXML_DOCB_ENABLED
-#endif
-
-/**
- * LIBXML_XPATH_ENABLED:
- *
- * Whether XPath is configured in
- */
-#if 1
-#define LIBXML_XPATH_ENABLED
-#endif
-
-/**
- * LIBXML_XPTR_ENABLED:
- *
- * Whether XPointer is configured in
- */
-#if 1
-#define LIBXML_XPTR_ENABLED
-#endif
-
-/**
- * LIBXML_C14N_ENABLED:
- *
- * Whether the Canonicalization support is configured in
- */
-#if 0
-#define LIBXML_C14N_ENABLED
-#endif
-
-/**
- * LIBXML_XINCLUDE_ENABLED:
- *
- * Whether XInclude is configured in
- */
-#if 1
-#define LIBXML_XINCLUDE_ENABLED
-#endif
-
-/**
- * LIBXML_ICONV_ENABLED:
- *
- * Whether iconv support is available
- */
-#if 0
-#define LIBXML_ICONV_ENABLED
-#endif
-
-/**
- * LIBXML_DEBUG_ENABLED:
- *
- * Whether Debugging module is configured in
- */
-#if 1
-#define LIBXML_DEBUG_ENABLED
-#endif
-
-/**
- * DEBUG_MEMORY_LOCATION:
- *
- * Whether the memory debugging is configured in
- */
-#if 0
-#define DEBUG_MEMORY_LOCATION
-#endif
-
-/**
- * LIBXML_DLL_IMPORT:
- *
- * Used on Windows (MS C compiler only) to declare a variable as 
- * imported from the library. This macro should be empty when compiling
- * libxml itself. It should expand to __declspec(dllimport)
- * when the client code includes this header, and that only if the client
- * links dynamically against libxml.
- * For this to work, we need three macros. One tells us which compiler is
- * being used and luckily the compiler defines such a thing: _MSC_VER. The
- * second macro tells us if we are compiling libxml or the client code and
- * we define the macro IN_LIBXML on the compiler's command line for this 
- * purpose. The third macro, LIBXML_STATIC, must be defined by any client 
- * code which links against libxml statically. 
- */
-#ifndef LIBXML_DLL_IMPORT
-#if defined(_MSC_VER) && !defined(IN_LIBXML) && !defined(LIBXML_STATIC)
-#define LIBXML_DLL_IMPORT __declspec(dllimport)
-#else
-#define LIBXML_DLL_IMPORT
-#endif
-#endif
-
-/**
- * ATTRIBUTE_UNUSED:
- *
- * Macro used to signal to GCC unused function parameters
- */
-#ifdef __GNUC__
-#ifdef HAVE_ANSIDECL_H
-#include <ansidecl.h>
-#endif
-#ifndef ATTRIBUTE_UNUSED
-#define ATTRIBUTE_UNUSED
-#endif
-#else
-#define ATTRIBUTE_UNUSED
-#endif
-
-/*
- * #pragma comment(lib, "iconv.lib")
- *
- * pragma understood my MS compiler which enables a conditional link with
- * iconv.
- */
-#ifdef _MSC_VER
-#if defined LIBXML_ICONV_ENABLED && !defined LIBXML2_COMPILING_MSCCDEF
-#pragma comment(lib, "iconv.lib")
-#endif
-#endif
-
-#ifdef __cplusplus
-}
-#endif /* __cplusplus */
-#endif
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xmlwriter.h igraph-0.6.5/msvc/include/libxml/xmlwriter.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xmlwriter.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xmlwriter.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,459 +0,0 @@
-
-/*
- * Summary: text writing API for XML
- * Description: text writing API for XML
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Alfred Mickautsch <alfred@mickautsch.de>
- */
-
-#ifndef __XML_XMLWRITER_H__
-#define __XML_XMLWRITER_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_WRITER_ENABLED
-
-#include <stdarg.h>
-#include <libxml/xmlIO.h>
-#include <libxml/list.h>
-#include <libxml/xmlstring.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-    typedef struct _xmlTextWriter xmlTextWriter;
-    typedef xmlTextWriter *xmlTextWriterPtr;
-
-/*
- * Constructors & Destructor
- */
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriter(xmlOutputBufferPtr out);
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriterFilename(const char *uri, int compression);
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriterMemory(xmlBufferPtr buf, int compression);
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriterPushParser(xmlParserCtxtPtr ctxt, int compression);
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriterDoc(xmlDocPtr * doc, int compression);
-    XMLPUBFUN xmlTextWriterPtr XMLCALL
-        xmlNewTextWriterTree(xmlDocPtr doc, xmlNodePtr node,
-                             int compression);
-    XMLPUBFUN void XMLCALL xmlFreeTextWriter(xmlTextWriterPtr writer);
-
-/*
- * Functions
- */
-
-
-/*
- * Document
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartDocument(xmlTextWriterPtr writer,
-                                   const char *version,
-                                   const char *encoding,
-                                   const char *standalone);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndDocument(xmlTextWriterPtr
-                                                   writer);
-
-/*
- * Comments
- */
-    XMLPUBFUN int XMLCALL xmlTextWriterStartComment(xmlTextWriterPtr
-                                                    writer);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndComment(xmlTextWriterPtr writer);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatComment(xmlTextWriterPtr writer,
-                                        const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatComment(xmlTextWriterPtr writer,
-                                         const char *format,
-                                         va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteComment(xmlTextWriterPtr
-                                                    writer,
-                                                    const xmlChar *
-                                                    content);
-
-/*
- * Elements
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartElement(xmlTextWriterPtr writer,
-                                  const xmlChar * name);
-    XMLPUBFUN int XMLCALL xmlTextWriterStartElementNS(xmlTextWriterPtr
-                                                      writer,
-                                                      const xmlChar *
-                                                      prefix,
-                                                      const xmlChar * name,
-                                                      const xmlChar *
-                                                      namespaceURI);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndElement(xmlTextWriterPtr writer);
-    XMLPUBFUN int XMLCALL xmlTextWriterFullEndElement(xmlTextWriterPtr
-                                                      writer);
-
-/*
- * Elements conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatElement(xmlTextWriterPtr writer,
-                                        const xmlChar * name,
-                                        const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatElement(xmlTextWriterPtr writer,
-                                         const xmlChar * name,
-                                         const char *format,
-                                         va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteElement(xmlTextWriterPtr
-                                                    writer,
-                                                    const xmlChar * name,
-                                                    const xmlChar *
-                                                    content);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatElementNS(xmlTextWriterPtr writer,
-                                          const xmlChar * prefix,
-                                          const xmlChar * name,
-                                          const xmlChar * namespaceURI,
-                                          const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatElementNS(xmlTextWriterPtr writer,
-                                           const xmlChar * prefix,
-                                           const xmlChar * name,
-                                           const xmlChar * namespaceURI,
-                                           const char *format,
-                                           va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteElementNS(xmlTextWriterPtr
-                                                      writer,
-                                                      const xmlChar *
-                                                      prefix,
-                                                      const xmlChar * name,
-                                                      const xmlChar *
-                                                      namespaceURI,
-                                                      const xmlChar *
-                                                      content);
-
-/*
- * Text
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatRaw(xmlTextWriterPtr writer,
-                                    const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatRaw(xmlTextWriterPtr writer,
-                                     const char *format, va_list argptr);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteRawLen(xmlTextWriterPtr writer,
-                                 const xmlChar * content, int len);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteRaw(xmlTextWriterPtr writer,
-                              const xmlChar * content);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteFormatString(xmlTextWriterPtr
-                                                         writer,
-                                                         const char
-                                                         *format, ...);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteVFormatString(xmlTextWriterPtr
-                                                          writer,
-                                                          const char
-                                                          *format,
-                                                          va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteString(xmlTextWriterPtr writer,
-                                                   const xmlChar *
-                                                   content);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteBase64(xmlTextWriterPtr writer,
-                                                   const char *data,
-                                                   int start, int len);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteBinHex(xmlTextWriterPtr writer,
-                                                   const char *data,
-                                                   int start, int len);
-
-/*
- * Attributes
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartAttribute(xmlTextWriterPtr writer,
-                                    const xmlChar * name);
-    XMLPUBFUN int XMLCALL xmlTextWriterStartAttributeNS(xmlTextWriterPtr
-                                                        writer,
-                                                        const xmlChar *
-                                                        prefix,
-                                                        const xmlChar *
-                                                        name,
-                                                        const xmlChar *
-                                                        namespaceURI);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndAttribute(xmlTextWriterPtr
-                                                    writer);
-
-/*
- * Attributes conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatAttribute(xmlTextWriterPtr writer,
-                                          const xmlChar * name,
-                                          const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatAttribute(xmlTextWriterPtr writer,
-                                           const xmlChar * name,
-                                           const char *format,
-                                           va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteAttribute(xmlTextWriterPtr
-                                                      writer,
-                                                      const xmlChar * name,
-                                                      const xmlChar *
-                                                      content);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatAttributeNS(xmlTextWriterPtr writer,
-                                            const xmlChar * prefix,
-                                            const xmlChar * name,
-                                            const xmlChar * namespaceURI,
-                                            const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatAttributeNS(xmlTextWriterPtr writer,
-                                             const xmlChar * prefix,
-                                             const xmlChar * name,
-                                             const xmlChar * namespaceURI,
-                                             const char *format,
-                                             va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteAttributeNS(xmlTextWriterPtr
-                                                        writer,
-                                                        const xmlChar *
-                                                        prefix,
-                                                        const xmlChar *
-                                                        name,
-                                                        const xmlChar *
-                                                        namespaceURI,
-                                                        const xmlChar *
-                                                        content);
-
-/*
- * PI's
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartPI(xmlTextWriterPtr writer,
-                             const xmlChar * target);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndPI(xmlTextWriterPtr writer);
-
-/*
- * PI conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatPI(xmlTextWriterPtr writer,
-                                   const xmlChar * target,
-                                   const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatPI(xmlTextWriterPtr writer,
-                                    const xmlChar * target,
-                                    const char *format, va_list argptr);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWritePI(xmlTextWriterPtr writer,
-                             const xmlChar * target,
-                             const xmlChar * content);
-
-/**
- * xmlTextWriterWriteProcessingInstruction:
- *
- * This macro maps to xmlTextWriterWritePI
- */
-#define xmlTextWriterWriteProcessingInstruction xmlTextWriterWritePI
-
-/*
- * CDATA
- */
-    XMLPUBFUN int XMLCALL xmlTextWriterStartCDATA(xmlTextWriterPtr writer);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndCDATA(xmlTextWriterPtr writer);
-
-/*
- * CDATA conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatCDATA(xmlTextWriterPtr writer,
-                                      const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatCDATA(xmlTextWriterPtr writer,
-                                       const char *format, va_list argptr);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteCDATA(xmlTextWriterPtr writer,
-                                const xmlChar * content);
-
-/*
- * DTD
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartDTD(xmlTextWriterPtr writer,
-                              const xmlChar * name,
-                              const xmlChar * pubid,
-                              const xmlChar * sysid);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndDTD(xmlTextWriterPtr writer);
-
-/*
- * DTD conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatDTD(xmlTextWriterPtr writer,
-                                    const xmlChar * name,
-                                    const xmlChar * pubid,
-                                    const xmlChar * sysid,
-                                    const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatDTD(xmlTextWriterPtr writer,
-                                     const xmlChar * name,
-                                     const xmlChar * pubid,
-                                     const xmlChar * sysid,
-                                     const char *format, va_list argptr);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteDTD(xmlTextWriterPtr writer,
-                              const xmlChar * name,
-                              const xmlChar * pubid,
-                              const xmlChar * sysid,
-                              const xmlChar * subset);
-
-/**
- * xmlTextWriterWriteDocType:
- *
- * this macro maps to xmlTextWriterWriteDTD
- */
-#define xmlTextWriterWriteDocType xmlTextWriterWriteDTD
-
-/*
- * DTD element definition
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartDTDElement(xmlTextWriterPtr writer,
-                                     const xmlChar * name);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndDTDElement(xmlTextWriterPtr
-                                                     writer);
-
-/*
- * DTD element definition conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatDTDElement(xmlTextWriterPtr writer,
-                                           const xmlChar * name,
-                                           const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatDTDElement(xmlTextWriterPtr writer,
-                                            const xmlChar * name,
-                                            const char *format,
-                                            va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteDTDElement(xmlTextWriterPtr
-                                                       writer,
-                                                       const xmlChar *
-                                                       name,
-                                                       const xmlChar *
-                                                       content);
-
-/*
- * DTD attribute list definition
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartDTDAttlist(xmlTextWriterPtr writer,
-                                     const xmlChar * name);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndDTDAttlist(xmlTextWriterPtr
-                                                     writer);
-
-/*
- * DTD attribute list definition conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatDTDAttlist(xmlTextWriterPtr writer,
-                                           const xmlChar * name,
-                                           const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatDTDAttlist(xmlTextWriterPtr writer,
-                                            const xmlChar * name,
-                                            const char *format,
-                                            va_list argptr);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteDTDAttlist(xmlTextWriterPtr
-                                                       writer,
-                                                       const xmlChar *
-                                                       name,
-                                                       const xmlChar *
-                                                       content);
-
-/*
- * DTD entity definition
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterStartDTDEntity(xmlTextWriterPtr writer,
-                                    int pe, const xmlChar * name);
-    XMLPUBFUN int XMLCALL xmlTextWriterEndDTDEntity(xmlTextWriterPtr
-                                                    writer);
-
-/*
- * DTD entity definition conveniency functions
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteFormatDTDInternalEntity(xmlTextWriterPtr writer,
-                                                  int pe,
-                                                  const xmlChar * name,
-                                                  const char *format, ...);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteVFormatDTDInternalEntity(xmlTextWriterPtr writer,
-                                                   int pe,
-                                                   const xmlChar * name,
-                                                   const char *format,
-                                                   va_list argptr);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteDTDInternalEntity(xmlTextWriterPtr writer,
-                                            int pe,
-                                            const xmlChar * name,
-                                            const xmlChar * content);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteDTDExternalEntity(xmlTextWriterPtr writer,
-                                            int pe,
-                                            const xmlChar * name,
-                                            const xmlChar * pubid,
-                                            const xmlChar * sysid,
-                                            const xmlChar * ndataid);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteDTDExternalEntityContents(xmlTextWriterPtr
-                                                    writer,
-                                                    const xmlChar * pubid,
-                                                    const xmlChar * sysid,
-                                                    const xmlChar *
-                                                    ndataid);
-    XMLPUBFUN int XMLCALL xmlTextWriterWriteDTDEntity(xmlTextWriterPtr
-                                                      writer, int pe,
-                                                      const xmlChar * name,
-                                                      const xmlChar *
-                                                      pubid,
-                                                      const xmlChar *
-                                                      sysid,
-                                                      const xmlChar *
-                                                      ndataid,
-                                                      const xmlChar *
-                                                      content);
-
-/*
- * DTD notation definition
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterWriteDTDNotation(xmlTextWriterPtr writer,
-                                      const xmlChar * name,
-                                      const xmlChar * pubid,
-                                      const xmlChar * sysid);
-
-/*
- * Indentation
- */
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterSetIndent(xmlTextWriterPtr writer, int indent);
-    XMLPUBFUN int XMLCALL
-        xmlTextWriterSetIndentString(xmlTextWriterPtr writer,
-                                     const xmlChar * str);
-
-/*
- * misc
- */
-    XMLPUBFUN int XMLCALL xmlTextWriterFlush(xmlTextWriterPtr writer);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_WRITER_ENABLED */
-
-#endif                          /* __XML_XMLWRITER_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xpath.h igraph-0.6.5/msvc/include/libxml/xpath.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xpath.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xpath.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,546 +0,0 @@
-/*
- * Summary: XML Path Language implementation
- * Description: API for the XML Path Language implementation
- *
- * XML Path Language implementation
- * XPath is a language for addressing parts of an XML document,
- * designed to be used by both XSLT and XPointer
- *     http://www.w3.org/TR/xpath
- *
- * Implements
- * W3C Recommendation 16 November 1999
- *     http://www.w3.org/TR/1999/REC-xpath-19991116
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XPATH_H__
-#define __XML_XPATH_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_XPATH_ENABLED
-
-#include <libxml/xmlerror.h>
-#include <libxml/tree.h>
-#include <libxml/hash.h>
-#endif /* LIBXML_XPATH_ENABLED */
-
-#if defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-#ifdef __cplusplus
-extern "C" {
-#endif
-#endif /* LIBXML_XPATH_ENABLED or LIBXML_SCHEMAS_ENABLED */
-	
-#ifdef LIBXML_XPATH_ENABLED
-
-typedef struct _xmlXPathContext xmlXPathContext;
-typedef xmlXPathContext *xmlXPathContextPtr;
-typedef struct _xmlXPathParserContext xmlXPathParserContext;
-typedef xmlXPathParserContext *xmlXPathParserContextPtr;
-
-/**
- * The set of XPath error codes.
- */
-
-typedef enum {
-    XPATH_EXPRESSION_OK = 0,
-    XPATH_NUMBER_ERROR,
-    XPATH_UNFINISHED_LITERAL_ERROR,
-    XPATH_START_LITERAL_ERROR,
-    XPATH_VARIABLE_REF_ERROR,
-    XPATH_UNDEF_VARIABLE_ERROR,
-    XPATH_INVALID_PREDICATE_ERROR,
-    XPATH_EXPR_ERROR,
-    XPATH_UNCLOSED_ERROR,
-    XPATH_UNKNOWN_FUNC_ERROR,
-    XPATH_INVALID_OPERAND,
-    XPATH_INVALID_TYPE,
-    XPATH_INVALID_ARITY,
-    XPATH_INVALID_CTXT_SIZE,
-    XPATH_INVALID_CTXT_POSITION,
-    XPATH_MEMORY_ERROR,
-    XPTR_SYNTAX_ERROR,
-    XPTR_RESOURCE_ERROR,
-    XPTR_SUB_RESOURCE_ERROR,
-    XPATH_UNDEF_PREFIX_ERROR,
-    XPATH_ENCODING_ERROR,
-    XPATH_INVALID_CHAR_ERROR,
-    XPATH_INVALID_CTXT
-} xmlXPathError;
-
-/*
- * A node-set (an unordered collection of nodes without duplicates).
- */
-typedef struct _xmlNodeSet xmlNodeSet;
-typedef xmlNodeSet *xmlNodeSetPtr;
-struct _xmlNodeSet {
-    int nodeNr;			/* number of nodes in the set */
-    int nodeMax;		/* size of the array as allocated */
-    xmlNodePtr *nodeTab;	/* array of nodes in no particular order */
-    /* @@ with_ns to check wether namespace nodes should be looked at @@ */
-};
-
-/*
- * An expression is evaluated to yield an object, which
- * has one of the following four basic types:
- *   - node-set
- *   - boolean
- *   - number
- *   - string
- *
- * @@ XPointer will add more types !
- */
-
-typedef enum {
-    XPATH_UNDEFINED = 0,
-    XPATH_NODESET = 1,
-    XPATH_BOOLEAN = 2,
-    XPATH_NUMBER = 3,
-    XPATH_STRING = 4,
-    XPATH_POINT = 5,
-    XPATH_RANGE = 6,
-    XPATH_LOCATIONSET = 7,
-    XPATH_USERS = 8,
-    XPATH_XSLT_TREE = 9  /* An XSLT value tree, non modifiable */
-} xmlXPathObjectType;
-
-typedef struct _xmlXPathObject xmlXPathObject;
-typedef xmlXPathObject *xmlXPathObjectPtr;
-struct _xmlXPathObject {
-    xmlXPathObjectType type;
-    xmlNodeSetPtr nodesetval;
-    int boolval;
-    double floatval;
-    xmlChar *stringval;
-    void *user;
-    int index;
-    void *user2;
-    int index2;
-};
-
-/**
- * xmlXPathConvertFunc:
- * @obj:  an XPath object
- * @type:  the number of the target type
- *
- * A conversion function is associated to a type and used to cast
- * the new type to primitive values.
- *
- * Returns -1 in case of error, 0 otherwise
- */
-typedef int (*xmlXPathConvertFunc) (xmlXPathObjectPtr obj, int type);
-
-/*
- * Extra type: a name and a conversion function.
- */
-
-typedef struct _xmlXPathType xmlXPathType;
-typedef xmlXPathType *xmlXPathTypePtr;
-struct _xmlXPathType {
-    const xmlChar         *name;		/* the type name */
-    xmlXPathConvertFunc func;		/* the conversion function */
-};
-
-/*
- * Extra variable: a name and a value.
- */
-
-typedef struct _xmlXPathVariable xmlXPathVariable;
-typedef xmlXPathVariable *xmlXPathVariablePtr;
-struct _xmlXPathVariable {
-    const xmlChar       *name;		/* the variable name */
-    xmlXPathObjectPtr value;		/* the value */
-};
-
-/**
- * xmlXPathEvalFunc:
- * @ctxt: an XPath parser context
- * @nargs: the number of arguments passed to the function
- *
- * An XPath evaluation function, the parameters are on the XPath context stack.
- */
-
-typedef void (*xmlXPathEvalFunc)(xmlXPathParserContextPtr ctxt,
-	                         int nargs);
-
-/*
- * Extra function: a name and a evaluation function.
- */
-
-typedef struct _xmlXPathFunct xmlXPathFunct;
-typedef xmlXPathFunct *xmlXPathFuncPtr;
-struct _xmlXPathFunct {
-    const xmlChar      *name;		/* the function name */
-    xmlXPathEvalFunc func;		/* the evaluation function */
-};
-
-/**
- * xmlXPathAxisFunc:
- * @ctxt:  the XPath interpreter context
- * @cur:  the previous node being explored on that axis
- *
- * An axis traversal function. To traverse an axis, the engine calls
- * the first time with cur == NULL and repeat until the function returns
- * NULL indicating the end of the axis traversal.
- *
- * Returns the next node in that axis or NULL if at the end of the axis.
- */
-
-typedef xmlXPathObjectPtr (*xmlXPathAxisFunc) (xmlXPathParserContextPtr ctxt,
-				 xmlXPathObjectPtr cur);
-
-/*
- * Extra axis: a name and an axis function.
- */
-
-typedef struct _xmlXPathAxis xmlXPathAxis;
-typedef xmlXPathAxis *xmlXPathAxisPtr;
-struct _xmlXPathAxis {
-    const xmlChar      *name;		/* the axis name */
-    xmlXPathAxisFunc func;		/* the search function */
-};
-
-/**
- * xmlXPathFunction:
- * @ctxt:  the XPath interprestation context
- * @nargs:  the number of arguments
- *
- * An XPath function.
- * The arguments (if any) are popped out from the context stack
- * and the result is pushed on the stack.
- */
-
-typedef void (*xmlXPathFunction) (xmlXPathParserContextPtr ctxt, int nargs);
-
-/*
- * Function and Variable Lookup.
- */
-
-/**
- * xmlXPathVariableLookupFunc:
- * @ctxt:  an XPath context
- * @name:  name of the variable
- * @ns_uri:  the namespace name hosting this variable
- *
- * Prototype for callbacks used to plug variable lookup in the XPath
- * engine.
- *
- * Returns the XPath object value or NULL if not found.
- */
-typedef xmlXPathObjectPtr (*xmlXPathVariableLookupFunc) (void *ctxt,
-                                         const xmlChar *name,
-                                         const xmlChar *ns_uri);
-
-/**
- * xmlXPathFuncLookupFunc:
- * @ctxt:  an XPath context
- * @name:  name of the function
- * @ns_uri:  the namespace name hosting this function
- *
- * Prototype for callbacks used to plug function lookup in the XPath
- * engine.
- *
- * Returns the XPath function or NULL if not found.
- */
-typedef xmlXPathFunction (*xmlXPathFuncLookupFunc) (void *ctxt,
-					 const xmlChar *name,
-					 const xmlChar *ns_uri);
-
-/**
- * xmlXPathFlags:
- * Flags for XPath engine compilation and runtime
- */
-/**
- * XML_XPATH_CHECKNS:
- *
- * check namespaces at compilation
- */
-#define XML_XPATH_CHECKNS (1<<0)
-/**
- * XML_XPATH_NOVAR:
- *
- * forbid variables in expression
- */
-#define XML_XPATH_NOVAR	  (1<<1)
-
-/**
- * xmlXPathContext:
- *
- * Expression evaluation occurs with respect to a context.
- * he context consists of:
- *    - a node (the context node) 
- *    - a node list (the context node list) 
- *    - a set of variable bindings 
- *    - a function library 
- *    - the set of namespace declarations in scope for the expression 
- * Following the switch to hash tables, this need to be trimmed up at
- * the next binary incompatible release.
- * The node may be modified when the context is passed to libxml2
- * for an XPath evaluation so you may need to initialize it again
- * before the next call.
- */
-
-struct _xmlXPathContext {
-    xmlDocPtr doc;			/* The current document */
-    xmlNodePtr node;			/* The current node */
-
-    int nb_variables_unused;		/* unused (hash table) */
-    int max_variables_unused;		/* unused (hash table) */
-    xmlHashTablePtr varHash;		/* Hash table of defined variables */
-
-    int nb_types;			/* number of defined types */
-    int max_types;			/* max number of types */
-    xmlXPathTypePtr types;		/* Array of defined types */
-
-    int nb_funcs_unused;		/* unused (hash table) */
-    int max_funcs_unused;		/* unused (hash table) */
-    xmlHashTablePtr funcHash;		/* Hash table of defined funcs */
-
-    int nb_axis;			/* number of defined axis */
-    int max_axis;			/* max number of axis */
-    xmlXPathAxisPtr axis;		/* Array of defined axis */
-
-    /* the namespace nodes of the context node */
-    xmlNsPtr *namespaces;		/* Array of namespaces */
-    int nsNr;				/* number of namespace in scope */
-    void *user;				/* function to free */
-
-    /* extra variables */
-    int contextSize;			/* the context size */
-    int proximityPosition;		/* the proximity position */
-
-    /* extra stuff for XPointer */
-    int xptr;				/* is this an XPointer context? */
-    xmlNodePtr here;			/* for here() */
-    xmlNodePtr origin;			/* for origin() */
-
-    /* the set of namespace declarations in scope for the expression */
-    xmlHashTablePtr nsHash;		/* The namespaces hash table */
-    xmlXPathVariableLookupFunc varLookupFunc;/* variable lookup func */
-    void *varLookupData;		/* variable lookup data */
-
-    /* Possibility to link in an extra item */
-    void *extra;                        /* needed for XSLT */
-
-    /* The function name and URI when calling a function */
-    const xmlChar *function;
-    const xmlChar *functionURI;
-
-    /* function lookup function and data */
-    xmlXPathFuncLookupFunc funcLookupFunc;/* function lookup func */
-    void *funcLookupData;		/* function lookup data */
-
-    /* temporary namespace lists kept for walking the namespace axis */
-    xmlNsPtr *tmpNsList;		/* Array of namespaces */
-    int tmpNsNr;			/* number of namespaces in scope */
-
-    /* error reporting mechanism */
-    void *userData;                     /* user specific data block */
-    xmlStructuredErrorFunc error;       /* the callback in case of errors */
-    xmlError lastError;			/* the last error */
-    xmlNodePtr debugNode;		/* the source node XSLT */
-
-    /* dictionary */
-    xmlDictPtr dict;			/* dictionary if any */
-
-    int flags;				/* flags to control compilation */
-
-    /* Cache for reusal of XPath objects */
-    void *cache;
-};
-
-/*
- * The structure of a compiled expression form is not public.
- */
-
-typedef struct _xmlXPathCompExpr xmlXPathCompExpr;
-typedef xmlXPathCompExpr *xmlXPathCompExprPtr;
-
-/**
- * xmlXPathParserContext:
- *
- * An XPath parser context. It contains pure parsing informations,
- * an xmlXPathContext, and the stack of objects.
- */
-struct _xmlXPathParserContext {
-    const xmlChar *cur;			/* the current char being parsed */
-    const xmlChar *base;			/* the full expression */
-
-    int error;				/* error code */
-
-    xmlXPathContextPtr  context;	/* the evaluation context */
-    xmlXPathObjectPtr     value;	/* the current value */
-    int                 valueNr;	/* number of values stacked */
-    int                valueMax;	/* max number of values stacked */
-    xmlXPathObjectPtr *valueTab;	/* stack of values */
-
-    xmlXPathCompExprPtr comp;		/* the precompiled expression */
-    int xptr;				/* it this an XPointer expression */
-    xmlNodePtr         ancestor;	/* used for walking preceding axis */
-};
-
-/************************************************************************
- *									*
- *			Public API					*
- *									*
- ************************************************************************/
-
-/**
- * Objects and Nodesets handling
- */
-
-XMLPUBVAR double xmlXPathNAN;
-XMLPUBVAR double xmlXPathPINF;
-XMLPUBVAR double xmlXPathNINF;
-
-/* These macros may later turn into functions */
-/**
- * xmlXPathNodeSetGetLength:
- * @ns:  a node-set
- *
- * Implement a functionality similar to the DOM NodeList.length.
- *
- * Returns the number of nodes in the node-set.
- */
-#define xmlXPathNodeSetGetLength(ns) ((ns) ? (ns)->nodeNr : 0)
-/**
- * xmlXPathNodeSetItem:
- * @ns:  a node-set
- * @index:  index of a node in the set
- *
- * Implements a functionality similar to the DOM NodeList.item().
- *
- * Returns the xmlNodePtr at the given @index in @ns or NULL if
- *         @index is out of range (0 to length-1)
- */
-#define xmlXPathNodeSetItem(ns, index)				\
-		((((ns) != NULL) && 				\
-		  ((index) >= 0) && ((index) < (ns)->nodeNr)) ?	\
-		 (ns)->nodeTab[(index)]				\
-		 : NULL)
-/**
- * xmlXPathNodeSetIsEmpty:
- * @ns: a node-set
- *
- * Checks whether @ns is empty or not.
- *
- * Returns %TRUE if @ns is an empty node-set.
- */
-#define xmlXPathNodeSetIsEmpty(ns)                                      \
-    (((ns) == NULL) || ((ns)->nodeNr == 0) || ((ns)->nodeTab == NULL))
-
-
-XMLPUBFUN void XMLCALL		   
-		    xmlXPathFreeObject		(xmlXPathObjectPtr obj);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	   
-		    xmlXPathNodeSetCreate	(xmlNodePtr val);
-XMLPUBFUN void XMLCALL		   
-		    xmlXPathFreeNodeSetList	(xmlXPathObjectPtr obj);
-XMLPUBFUN void XMLCALL		   
-		    xmlXPathFreeNodeSet		(xmlNodeSetPtr obj);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathObjectCopy		(xmlXPathObjectPtr val);
-XMLPUBFUN int XMLCALL		   
-		    xmlXPathCmpNodes		(xmlNodePtr node1,
-						 xmlNodePtr node2);
-/**
- * Conversion functions to basic types.
- */
-XMLPUBFUN int XMLCALL		   
-		    xmlXPathCastNumberToBoolean	(double val);
-XMLPUBFUN int XMLCALL		   
-		    xmlXPathCastStringToBoolean	(const xmlChar * val);
-XMLPUBFUN int XMLCALL		   
-		    xmlXPathCastNodeSetToBoolean(xmlNodeSetPtr ns);
-XMLPUBFUN int XMLCALL		   
-		    xmlXPathCastToBoolean	(xmlXPathObjectPtr val);
-
-XMLPUBFUN double XMLCALL		   
-		    xmlXPathCastBooleanToNumber	(int val);
-XMLPUBFUN double XMLCALL		   
-		    xmlXPathCastStringToNumber	(const xmlChar * val);
-XMLPUBFUN double XMLCALL		   
-		    xmlXPathCastNodeToNumber	(xmlNodePtr node);
-XMLPUBFUN double XMLCALL		   
-		    xmlXPathCastNodeSetToNumber	(xmlNodeSetPtr ns);
-XMLPUBFUN double XMLCALL		   
-		    xmlXPathCastToNumber	(xmlXPathObjectPtr val);
-
-XMLPUBFUN xmlChar * XMLCALL	   
-		    xmlXPathCastBooleanToString	(int val);
-XMLPUBFUN xmlChar * XMLCALL	   
-		    xmlXPathCastNumberToString	(double val);
-XMLPUBFUN xmlChar * XMLCALL	   
-		    xmlXPathCastNodeToString	(xmlNodePtr node);
-XMLPUBFUN xmlChar * XMLCALL	   
-		    xmlXPathCastNodeSetToString	(xmlNodeSetPtr ns);
-XMLPUBFUN xmlChar * XMLCALL	   
-		    xmlXPathCastToString	(xmlXPathObjectPtr val);
-
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathConvertBoolean	(xmlXPathObjectPtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathConvertNumber	(xmlXPathObjectPtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathConvertString	(xmlXPathObjectPtr val);
-
-/**
- * Context handling.
- */
-XMLPUBFUN xmlXPathContextPtr XMLCALL 
-		    xmlXPathNewContext		(xmlDocPtr doc);
-XMLPUBFUN void XMLCALL
-		    xmlXPathFreeContext		(xmlXPathContextPtr ctxt);
-XMLPUBFUN int XMLCALL
-		    xmlXPathContextSetCache(xmlXPathContextPtr ctxt,
-				            int active,
-					    int value,
-					    int options);
-/**
- * Evaluation functions.
- */
-XMLPUBFUN long XMLCALL               
-		    xmlXPathOrderDocElems	(xmlDocPtr doc);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathEval		(const xmlChar *str,
-						 xmlXPathContextPtr ctx);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		    xmlXPathEvalExpression	(const xmlChar *str,
-						 xmlXPathContextPtr ctxt);
-XMLPUBFUN int XMLCALL                
-		    xmlXPathEvalPredicate	(xmlXPathContextPtr ctxt,
-						 xmlXPathObjectPtr res);
-/**
- * Separate compilation/evaluation entry points.
- */
-XMLPUBFUN xmlXPathCompExprPtr XMLCALL 
-		    xmlXPathCompile		(const xmlChar *str);
-XMLPUBFUN xmlXPathCompExprPtr XMLCALL 
-		    xmlXPathCtxtCompile		(xmlXPathContextPtr ctxt,
-		    				 const xmlChar *str);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL   
-		    xmlXPathCompiledEval	(xmlXPathCompExprPtr comp,
-						 xmlXPathContextPtr ctx);
-XMLPUBFUN int XMLCALL   
-		    xmlXPathCompiledEvalToBoolean(xmlXPathCompExprPtr comp,
-						 xmlXPathContextPtr ctxt);
-XMLPUBFUN void XMLCALL                
-		    xmlXPathFreeCompExpr	(xmlXPathCompExprPtr comp);
-#endif /* LIBXML_XPATH_ENABLED */
-#if defined(LIBXML_XPATH_ENABLED) || defined(LIBXML_SCHEMAS_ENABLED)
-XMLPUBFUN void XMLCALL		   
-		    xmlXPathInit		(void);
-XMLPUBFUN int XMLCALL
-		xmlXPathIsNaN	(double val);
-XMLPUBFUN int XMLCALL
-		xmlXPathIsInf	(double val);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_XPATH_ENABLED or LIBXML_SCHEMAS_ENABLED*/
-#endif /* ! __XML_XPATH_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xpathInternals.h igraph-0.6.5/msvc/include/libxml/xpathInternals.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xpathInternals.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xpathInternals.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,630 +0,0 @@
-/*
- * Summary: internal interfaces for XML Path Language implementation
- * Description: internal interfaces for XML Path Language implementation
- *              used to build new modules on top of XPath like XPointer and
- *              XSLT
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XPATH_INTERNALS_H__
-#define __XML_XPATH_INTERNALS_H__
-
-#include <libxml/xmlversion.h>
-#include <libxml/xpath.h>
-
-#ifdef LIBXML_XPATH_ENABLED
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/************************************************************************
- *									*
- *			Helpers						*
- *									*
- ************************************************************************/
-
-/*
- * Many of these macros may later turn into functions. They
- * shouldn't be used in #ifdef's preprocessor instructions.
- */
-/**
- * xmlXPathSetError:
- * @ctxt:  an XPath parser context
- * @err:  an xmlXPathError code
- *
- * Raises an error.
- */
-#define xmlXPathSetError(ctxt, err)					\
-    { xmlXPatherror((ctxt), __FILE__, __LINE__, (err));			\
-      if ((ctxt) != NULL) (ctxt)->error = (err); }
-
-/**
- * xmlXPathSetArityError:
- * @ctxt:  an XPath parser context
- *
- * Raises an XPATH_INVALID_ARITY error.
- */
-#define xmlXPathSetArityError(ctxt)					\
-    xmlXPathSetError((ctxt), XPATH_INVALID_ARITY)
-
-/**
- * xmlXPathSetTypeError:
- * @ctxt:  an XPath parser context
- *
- * Raises an XPATH_INVALID_TYPE error.
- */
-#define xmlXPathSetTypeError(ctxt)					\
-    xmlXPathSetError((ctxt), XPATH_INVALID_TYPE)
-
-/**
- * xmlXPathGetError:
- * @ctxt:  an XPath parser context
- *
- * Get the error code of an XPath context.
- *
- * Returns the context error.
- */
-#define xmlXPathGetError(ctxt)	  ((ctxt)->error)
-
-/**
- * xmlXPathCheckError:
- * @ctxt:  an XPath parser context
- *
- * Check if an XPath error was raised.
- *
- * Returns true if an error has been raised, false otherwise.
- */
-#define xmlXPathCheckError(ctxt)  ((ctxt)->error != XPATH_EXPRESSION_OK)
-
-/**
- * xmlXPathGetDocument:
- * @ctxt:  an XPath parser context
- *
- * Get the document of an XPath context.
- *
- * Returns the context document.
- */
-#define xmlXPathGetDocument(ctxt)	((ctxt)->context->doc)
-
-/**
- * xmlXPathGetContextNode:
- * @ctxt: an XPath parser context
- *
- * Get the context node of an XPath context.
- *
- * Returns the context node.
- */
-#define xmlXPathGetContextNode(ctxt)	((ctxt)->context->node)
-
-XMLPUBFUN int XMLCALL		
-		xmlXPathPopBoolean	(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN double XMLCALL		
-    		xmlXPathPopNumber	(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL	
-    		xmlXPathPopString	(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-    		xmlXPathPopNodeSet	(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void * XMLCALL		
-    		xmlXPathPopExternal	(xmlXPathParserContextPtr ctxt);
-
-/**
- * xmlXPathReturnBoolean:
- * @ctxt:  an XPath parser context
- * @val:  a boolean
- *
- * Pushes the boolean @val on the context stack.
- */
-#define xmlXPathReturnBoolean(ctxt, val)				\
-    valuePush((ctxt), xmlXPathNewBoolean(val))
-
-/**
- * xmlXPathReturnTrue:
- * @ctxt:  an XPath parser context
- *
- * Pushes true on the context stack.
- */
-#define xmlXPathReturnTrue(ctxt)   xmlXPathReturnBoolean((ctxt), 1)
-
-/**
- * xmlXPathReturnFalse:
- * @ctxt:  an XPath parser context
- *
- * Pushes false on the context stack.
- */
-#define xmlXPathReturnFalse(ctxt)  xmlXPathReturnBoolean((ctxt), 0)
-
-/**
- * xmlXPathReturnNumber:
- * @ctxt:  an XPath parser context
- * @val:  a double
- *
- * Pushes the double @val on the context stack.
- */
-#define xmlXPathReturnNumber(ctxt, val)					\
-    valuePush((ctxt), xmlXPathNewFloat(val))
-
-/**
- * xmlXPathReturnString:
- * @ctxt:  an XPath parser context
- * @str:  a string
- *
- * Pushes the string @str on the context stack.
- */
-#define xmlXPathReturnString(ctxt, str)					\
-    valuePush((ctxt), xmlXPathWrapString(str))
-
-/**
- * xmlXPathReturnEmptyString:
- * @ctxt:  an XPath parser context
- *
- * Pushes an empty string on the stack.
- */
-#define xmlXPathReturnEmptyString(ctxt)					\
-    valuePush((ctxt), xmlXPathNewCString(""))
-
-/**
- * xmlXPathReturnNodeSet:
- * @ctxt:  an XPath parser context
- * @ns:  a node-set
- *
- * Pushes the node-set @ns on the context stack.
- */
-#define xmlXPathReturnNodeSet(ctxt, ns)					\
-    valuePush((ctxt), xmlXPathWrapNodeSet(ns))
-
-/**
- * xmlXPathReturnEmptyNodeSet:
- * @ctxt:  an XPath parser context
- *
- * Pushes an empty node-set on the context stack.
- */
-#define xmlXPathReturnEmptyNodeSet(ctxt)				\
-    valuePush((ctxt), xmlXPathNewNodeSet(NULL))
-
-/**
- * xmlXPathReturnExternal:
- * @ctxt:  an XPath parser context
- * @val:  user data
- *
- * Pushes user data on the context stack.
- */
-#define xmlXPathReturnExternal(ctxt, val)				\
-    valuePush((ctxt), xmlXPathWrapExternal(val))
-
-/**
- * xmlXPathStackIsNodeSet:
- * @ctxt: an XPath parser context
- *
- * Check if the current value on the XPath stack is a node set or
- * an XSLT value tree.
- *
- * Returns true if the current object on the stack is a node-set.
- */
-#define xmlXPathStackIsNodeSet(ctxt)					\
-    (((ctxt)->value != NULL)						\
-     && (((ctxt)->value->type == XPATH_NODESET)				\
-         || ((ctxt)->value->type == XPATH_XSLT_TREE)))
-
-/**
- * xmlXPathStackIsExternal:
- * @ctxt: an XPath parser context
- *
- * Checks if the current value on the XPath stack is an external
- * object.
- *
- * Returns true if the current object on the stack is an external
- * object.
- */
-#define xmlXPathStackIsExternal(ctxt)					\
-	((ctxt->value != NULL) && (ctxt->value->type == XPATH_USERS))
-
-/**
- * xmlXPathEmptyNodeSet:
- * @ns:  a node-set
- *
- * Empties a node-set.
- */
-#define xmlXPathEmptyNodeSet(ns)					\
-    { while ((ns)->nodeNr > 0) (ns)->nodeTab[(ns)->nodeNr--] = NULL; }
-
-/**
- * CHECK_ERROR:
- *
- * Macro to return from the function if an XPath error was detected.
- */
-#define CHECK_ERROR							\
-    if (ctxt->error != XPATH_EXPRESSION_OK) return
-
-/**
- * CHECK_ERROR0:
- *
- * Macro to return 0 from the function if an XPath error was detected.
- */
-#define CHECK_ERROR0							\
-    if (ctxt->error != XPATH_EXPRESSION_OK) return(0)
-
-/**
- * XP_ERROR:
- * @X:  the error code
- *
- * Macro to raise an XPath error and return.
- */
-#define XP_ERROR(X)							\
-    { xmlXPathErr(ctxt, X); return; }
-
-/**
- * XP_ERROR0:
- * @X:  the error code
- *
- * Macro to raise an XPath error and return 0.
- */
-#define XP_ERROR0(X)							\
-    { xmlXPathErr(ctxt, X); return(0); }
-
-/**
- * CHECK_TYPE:
- * @typeval:  the XPath type
- *
- * Macro to check that the value on top of the XPath stack is of a given
- * type.
- */
-#define CHECK_TYPE(typeval)						\
-    if ((ctxt->value == NULL) || (ctxt->value->type != typeval))	\
-        XP_ERROR(XPATH_INVALID_TYPE)
-
-/**
- * CHECK_TYPE0:
- * @typeval:  the XPath type
- *
- * Macro to check that the value on top of the XPath stack is of a given
- * type. Return(0) in case of failure
- */
-#define CHECK_TYPE0(typeval)						\
-    if ((ctxt->value == NULL) || (ctxt->value->type != typeval))	\
-        XP_ERROR0(XPATH_INVALID_TYPE)
-
-/**
- * CHECK_ARITY:
- * @x:  the number of expected args
- *
- * Macro to check that the number of args passed to an XPath function matches.
- */
-#define CHECK_ARITY(x)							\
-    if (ctxt == NULL) return;						\
-    if (nargs != (x))							\
-        XP_ERROR(XPATH_INVALID_ARITY);
-
-/**
- * CAST_TO_STRING:
- *
- * Macro to try to cast the value on the top of the XPath stack to a string.
- */
-#define CAST_TO_STRING							\
-    if ((ctxt->value != NULL) && (ctxt->value->type != XPATH_STRING))	\
-        xmlXPathStringFunction(ctxt, 1);
-
-/**
- * CAST_TO_NUMBER:
- *
- * Macro to try to cast the value on the top of the XPath stack to a number.
- */
-#define CAST_TO_NUMBER							\
-    if ((ctxt->value != NULL) && (ctxt->value->type != XPATH_NUMBER))	\
-        xmlXPathNumberFunction(ctxt, 1);
-
-/**
- * CAST_TO_BOOLEAN:
- *
- * Macro to try to cast the value on the top of the XPath stack to a boolean.
- */
-#define CAST_TO_BOOLEAN							\
-    if ((ctxt->value != NULL) && (ctxt->value->type != XPATH_BOOLEAN))	\
-        xmlXPathBooleanFunction(ctxt, 1);
-
-/*
- * Variable Lookup forwarding.
- */
-
-XMLPUBFUN void XMLCALL	
-	xmlXPathRegisterVariableLookup	(xmlXPathContextPtr ctxt,
-					 xmlXPathVariableLookupFunc f,
-					 void *data);
-
-/*
- * Function Lookup forwarding.
- */
-
-XMLPUBFUN void XMLCALL	
-	    xmlXPathRegisterFuncLookup	(xmlXPathContextPtr ctxt,
-					 xmlXPathFuncLookupFunc f,
-					 void *funcCtxt);
-
-/*
- * Error reporting.
- */
-XMLPUBFUN void XMLCALL		
-		xmlXPatherror	(xmlXPathParserContextPtr ctxt,
-				 const char *file,
-				 int line,
-				 int no);
-
-XMLPUBFUN void XMLCALL
-		xmlXPathErr	(xmlXPathParserContextPtr ctxt,
-				 int error);
-
-#ifdef LIBXML_DEBUG_ENABLED
-XMLPUBFUN void XMLCALL		
-		xmlXPathDebugDumpObject	(FILE *output,
-					 xmlXPathObjectPtr cur,
-					 int depth);
-XMLPUBFUN void XMLCALL		
-	    xmlXPathDebugDumpCompExpr(FILE *output,
-					 xmlXPathCompExprPtr comp,
-					 int depth);
-#endif
-/**
- * NodeSet handling.
- */
-XMLPUBFUN int XMLCALL		
-		xmlXPathNodeSetContains		(xmlNodeSetPtr cur,
-						 xmlNodePtr val);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathDifference		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathIntersection		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathDistinctSorted		(xmlNodeSetPtr nodes);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathDistinct		(xmlNodeSetPtr nodes);
-
-XMLPUBFUN int XMLCALL		
-		xmlXPathHasSameNodes		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathNodeLeadingSorted	(xmlNodeSetPtr nodes,
-						 xmlNodePtr node);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathLeadingSorted		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathNodeLeading		(xmlNodeSetPtr nodes,
-						 xmlNodePtr node);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathLeading			(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathNodeTrailingSorted	(xmlNodeSetPtr nodes,
-						 xmlNodePtr node);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathTrailingSorted		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathNodeTrailing		(xmlNodeSetPtr nodes,
-						 xmlNodePtr node);
-XMLPUBFUN xmlNodeSetPtr XMLCALL	
-		xmlXPathTrailing		(xmlNodeSetPtr nodes1,
-						 xmlNodeSetPtr nodes2);
-
-
-/**
- * Extending a context.
- */
-
-XMLPUBFUN int XMLCALL		   
-		xmlXPathRegisterNs		(xmlXPathContextPtr ctxt,
-						 const xmlChar *prefix,
-						 const xmlChar *ns_uri);
-XMLPUBFUN const xmlChar * XMLCALL	   
-		xmlXPathNsLookup		(xmlXPathContextPtr ctxt,
-						 const xmlChar *prefix);
-XMLPUBFUN void XMLCALL		   
-		xmlXPathRegisteredNsCleanup	(xmlXPathContextPtr ctxt);
-
-XMLPUBFUN int XMLCALL		   
-		xmlXPathRegisterFunc		(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 xmlXPathFunction f);
-XMLPUBFUN int XMLCALL		   
-		xmlXPathRegisterFuncNS		(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 const xmlChar *ns_uri,
-						 xmlXPathFunction f);
-XMLPUBFUN int XMLCALL		   
-		xmlXPathRegisterVariable	(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 xmlXPathObjectPtr value);
-XMLPUBFUN int XMLCALL		   
-		xmlXPathRegisterVariableNS	(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 const xmlChar *ns_uri,
-						 xmlXPathObjectPtr value);
-XMLPUBFUN xmlXPathFunction XMLCALL   
-		xmlXPathFunctionLookup		(xmlXPathContextPtr ctxt,
-						 const xmlChar *name);
-XMLPUBFUN xmlXPathFunction XMLCALL   
-		xmlXPathFunctionLookupNS	(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 const xmlChar *ns_uri);
-XMLPUBFUN void XMLCALL		   
-		xmlXPathRegisteredFuncsCleanup	(xmlXPathContextPtr ctxt);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		xmlXPathVariableLookup		(xmlXPathContextPtr ctxt,
-						 const xmlChar *name);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL  
-		xmlXPathVariableLookupNS	(xmlXPathContextPtr ctxt,
-						 const xmlChar *name,
-						 const xmlChar *ns_uri);
-XMLPUBFUN void XMLCALL		   
-		xmlXPathRegisteredVariablesCleanup(xmlXPathContextPtr ctxt);
-
-/**
- * Utilities to extend XPath.
- */
-XMLPUBFUN xmlXPathParserContextPtr XMLCALL
-		  xmlXPathNewParserContext	(const xmlChar *str,
-			  			 xmlXPathContextPtr ctxt);
-XMLPUBFUN void XMLCALL		  
-		xmlXPathFreeParserContext	(xmlXPathParserContextPtr ctxt);
-
-/* TODO: remap to xmlXPathValuePop and Push. */
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		valuePop			(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN int XMLCALL		  
-		valuePush			(xmlXPathParserContextPtr ctxt,
-					 	 xmlXPathObjectPtr value);
-
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewString		(const xmlChar *val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewCString		(const char *val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathWrapString		(xmlChar *val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathWrapCString		(char * val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewFloat		(double val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewBoolean		(int val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewNodeSet		(xmlNodePtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewValueTree		(xmlNodePtr val);
-XMLPUBFUN void XMLCALL		  
-		xmlXPathNodeSetAdd		(xmlNodeSetPtr cur,
-						 xmlNodePtr val);
-XMLPUBFUN void XMLCALL              
-		xmlXPathNodeSetAddUnique	(xmlNodeSetPtr cur,
-						 xmlNodePtr val);
-XMLPUBFUN void XMLCALL		  
-		xmlXPathNodeSetAddNs		(xmlNodeSetPtr cur, 
-						 xmlNodePtr node, 
-						 xmlNsPtr ns);
-XMLPUBFUN void XMLCALL              
-		xmlXPathNodeSetSort		(xmlNodeSetPtr set);
-
-XMLPUBFUN void XMLCALL		  
-		xmlXPathRoot			(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL		  
-		xmlXPathEvalExpr		(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL	  
-		xmlXPathParseName		(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN xmlChar * XMLCALL	  
-		xmlXPathParseNCName		(xmlXPathParserContextPtr ctxt);
-
-/*
- * Existing functions.
- */
-XMLPUBFUN double XMLCALL 
-		xmlXPathStringEvalNumber	(const xmlChar *str);
-XMLPUBFUN int XMLCALL 
-		xmlXPathEvaluatePredicateResult (xmlXPathParserContextPtr ctxt, 
-						 xmlXPathObjectPtr res);
-XMLPUBFUN void XMLCALL 
-		xmlXPathRegisterAllFunctions	(xmlXPathContextPtr ctxt);
-XMLPUBFUN xmlNodeSetPtr XMLCALL 
-		xmlXPathNodeSetMerge		(xmlNodeSetPtr val1, 
-						 xmlNodeSetPtr val2);
-XMLPUBFUN void XMLCALL 
-		xmlXPathNodeSetDel		(xmlNodeSetPtr cur, 
-						 xmlNodePtr val);
-XMLPUBFUN void XMLCALL 
-		xmlXPathNodeSetRemove		(xmlNodeSetPtr cur, 
-						 int val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathNewNodeSetList		(xmlNodeSetPtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathWrapNodeSet		(xmlNodeSetPtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL 
-		xmlXPathWrapExternal		(void *val);
-
-XMLPUBFUN int XMLCALL xmlXPathEqualValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN int XMLCALL xmlXPathNotEqualValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN int XMLCALL xmlXPathCompareValues(xmlXPathParserContextPtr ctxt, int inf, int strict);
-XMLPUBFUN void XMLCALL xmlXPathValueFlipSign(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL xmlXPathAddValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL xmlXPathSubValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL xmlXPathMultValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL xmlXPathDivValues(xmlXPathParserContextPtr ctxt);
-XMLPUBFUN void XMLCALL xmlXPathModValues(xmlXPathParserContextPtr ctxt);
-
-XMLPUBFUN int XMLCALL xmlXPathIsNodeType(const xmlChar *name);
-
-/*
- * Some of the axis navigation routines.
- */
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextSelf(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextChild(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextDescendant(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextDescendantOrSelf(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextParent(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextAncestorOrSelf(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextFollowingSibling(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextFollowing(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextNamespace(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextAttribute(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextPreceding(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextAncestor(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-XMLPUBFUN xmlNodePtr XMLCALL xmlXPathNextPrecedingSibling(xmlXPathParserContextPtr ctxt,
-			xmlNodePtr cur);
-/*
- * The official core of XPath functions.
- */
-XMLPUBFUN void XMLCALL xmlXPathLastFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathPositionFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathCountFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathIdFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathLocalNameFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathNamespaceURIFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathStringFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathStringLengthFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathConcatFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathContainsFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathStartsWithFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathSubstringFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathSubstringBeforeFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathSubstringAfterFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathNormalizeFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathTranslateFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathNotFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathTrueFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathFalseFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathLangFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathNumberFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathSumFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathFloorFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathCeilingFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathRoundFunction(xmlXPathParserContextPtr ctxt, int nargs);
-XMLPUBFUN void XMLCALL xmlXPathBooleanFunction(xmlXPathParserContextPtr ctxt, int nargs);
-
-/**
- * Really internal functions
- */
-XMLPUBFUN void XMLCALL xmlXPathNodeSetFreeNs(xmlNsPtr ns);
- 
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_XPATH_ENABLED */
-#endif /* ! __XML_XPATH_INTERNALS_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/libxml/xpointer.h igraph-0.6.5/msvc/include/libxml/xpointer.h
--- igraph-0.6.5~quantal1/msvc/include/libxml/xpointer.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/libxml/xpointer.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,114 +0,0 @@
-/*
- * Summary: API to handle XML Pointers
- * Description: API to handle XML Pointers
- * Base implementation was made accordingly to
- * W3C Candidate Recommendation 7 June 2000
- * http://www.w3.org/TR/2000/CR-xptr-20000607
- *
- * Added support for the element() scheme described in:
- * W3C Proposed Recommendation 13 November 2002
- * http://www.w3.org/TR/2002/PR-xptr-element-20021113/  
- *
- * Copy: See Copyright for the status of this software.
- *
- * Author: Daniel Veillard
- */
-
-#ifndef __XML_XPTR_H__
-#define __XML_XPTR_H__
-
-#include <libxml/xmlversion.h>
-
-#ifdef LIBXML_XPTR_ENABLED
-
-#include <libxml/tree.h>
-#include <libxml/xpath.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * A Location Set
- */
-typedef struct _xmlLocationSet xmlLocationSet;
-typedef xmlLocationSet *xmlLocationSetPtr;
-struct _xmlLocationSet {
-    int locNr;		      /* number of locations in the set */
-    int locMax;		      /* size of the array as allocated */
-    xmlXPathObjectPtr *locTab;/* array of locations */
-};
-
-/*
- * Handling of location sets.
- */
-
-XMLPUBFUN xmlLocationSetPtr XMLCALL			
-		    xmlXPtrLocationSetCreate	(xmlXPathObjectPtr val);
-XMLPUBFUN void XMLCALL			
-		    xmlXPtrFreeLocationSet	(xmlLocationSetPtr obj);
-XMLPUBFUN xmlLocationSetPtr XMLCALL	
-		    xmlXPtrLocationSetMerge	(xmlLocationSetPtr val1,
-						 xmlLocationSetPtr val2);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewRange		(xmlNodePtr start,
-						 int startindex,
-						 xmlNodePtr end,
-						 int endindex);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewRangePoints	(xmlXPathObjectPtr start,
-						 xmlXPathObjectPtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewRangeNodePoint	(xmlNodePtr start,
-						 xmlXPathObjectPtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewRangePointNode	(xmlXPathObjectPtr start,
-						 xmlNodePtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL			
-		    xmlXPtrNewRangeNodes	(xmlNodePtr start,
-						 xmlNodePtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewLocationSetNodes	(xmlNodePtr start,
-						 xmlNodePtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewLocationSetNodeSet(xmlNodeSetPtr set);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewRangeNodeObject	(xmlNodePtr start,
-						 xmlXPathObjectPtr end);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrNewCollapsedRange	(xmlNodePtr start);
-XMLPUBFUN void XMLCALL			
-		    xmlXPtrLocationSetAdd	(xmlLocationSetPtr cur,
-						 xmlXPathObjectPtr val);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrWrapLocationSet	(xmlLocationSetPtr val);
-XMLPUBFUN void XMLCALL			
-		    xmlXPtrLocationSetDel	(xmlLocationSetPtr cur,
-						 xmlXPathObjectPtr val);
-XMLPUBFUN void XMLCALL			
-		    xmlXPtrLocationSetRemove	(xmlLocationSetPtr cur,
-						 int val);
-
-/*
- * Functions.
- */
-XMLPUBFUN xmlXPathContextPtr XMLCALL	
-		    xmlXPtrNewContext		(xmlDocPtr doc,
-						 xmlNodePtr here,
-						 xmlNodePtr origin);
-XMLPUBFUN xmlXPathObjectPtr XMLCALL	
-		    xmlXPtrEval			(const xmlChar *str,
-						 xmlXPathContextPtr ctx);
-XMLPUBFUN void XMLCALL					    
-		    xmlXPtrRangeToFunction	(xmlXPathParserContextPtr ctxt,
-       						 int nargs);
-XMLPUBFUN xmlNodePtr XMLCALL		
-		    xmlXPtrBuildNodeList	(xmlXPathObjectPtr obj);
-XMLPUBFUN void XMLCALL		
-		    xmlXPtrEvalRangePredicate	(xmlXPathParserContextPtr ctxt);
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* LIBXML_XPTR_ENABLED */
-#endif /* __XML_XPTR_H__ */
diff -Nru igraph-0.6.5~quantal1/msvc/include/zconf.h igraph-0.6.5/msvc/include/zconf.h
--- igraph-0.6.5~quantal1/msvc/include/zconf.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/zconf.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,332 +0,0 @@
-/* zconf.h -- configuration of the zlib compression library
- * Copyright (C) 1995-2005 Jean-loup Gailly.
- * For conditions of distribution and use, see copyright notice in zlib.h
- */
-
-/* @(#) $Id$ */
-
-#ifndef ZCONF_H
-#define ZCONF_H
-
-/*
- * If you *really* need a unique prefix for all types and library functions,
- * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
- */
-#ifdef Z_PREFIX
-#  define deflateInit_          z_deflateInit_
-#  define deflate               z_deflate
-#  define deflateEnd            z_deflateEnd
-#  define inflateInit_          z_inflateInit_
-#  define inflate               z_inflate
-#  define inflateEnd            z_inflateEnd
-#  define deflateInit2_         z_deflateInit2_
-#  define deflateSetDictionary  z_deflateSetDictionary
-#  define deflateCopy           z_deflateCopy
-#  define deflateReset          z_deflateReset
-#  define deflateParams         z_deflateParams
-#  define deflateBound          z_deflateBound
-#  define deflatePrime          z_deflatePrime
-#  define inflateInit2_         z_inflateInit2_
-#  define inflateSetDictionary  z_inflateSetDictionary
-#  define inflateSync           z_inflateSync
-#  define inflateSyncPoint      z_inflateSyncPoint
-#  define inflateCopy           z_inflateCopy
-#  define inflateReset          z_inflateReset
-#  define inflateBack           z_inflateBack
-#  define inflateBackEnd        z_inflateBackEnd
-#  define compress              z_compress
-#  define compress2             z_compress2
-#  define compressBound         z_compressBound
-#  define uncompress            z_uncompress
-#  define adler32               z_adler32
-#  define crc32                 z_crc32
-#  define get_crc_table         z_get_crc_table
-#  define zError                z_zError
-
-#  define alloc_func            z_alloc_func
-#  define free_func             z_free_func
-#  define in_func               z_in_func
-#  define out_func              z_out_func
-#  define Byte                  z_Byte
-#  define uInt                  z_uInt
-#  define uLong                 z_uLong
-#  define Bytef                 z_Bytef
-#  define charf                 z_charf
-#  define intf                  z_intf
-#  define uIntf                 z_uIntf
-#  define uLongf                z_uLongf
-#  define voidpf                z_voidpf
-#  define voidp                 z_voidp
-#endif
-
-#if defined(__MSDOS__) && !defined(MSDOS)
-#  define MSDOS
-#endif
-#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
-#  define OS2
-#endif
-#if defined(_WINDOWS) && !defined(WINDOWS)
-#  define WINDOWS
-#endif
-#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
-#  ifndef WIN32
-#    define WIN32
-#  endif
-#endif
-#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
-#  if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
-#    ifndef SYS16BIT
-#      define SYS16BIT
-#    endif
-#  endif
-#endif
-
-/*
- * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
- * than 64k bytes at a time (needed on systems with 16-bit int).
- */
-#ifdef SYS16BIT
-#  define MAXSEG_64K
-#endif
-#ifdef MSDOS
-#  define UNALIGNED_OK
-#endif
-
-#ifdef __STDC_VERSION__
-#  ifndef STDC
-#    define STDC
-#  endif
-#  if __STDC_VERSION__ >= 199901L
-#    ifndef STDC99
-#      define STDC99
-#    endif
-#  endif
-#endif
-#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
-#  define STDC
-#endif
-#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
-#  define STDC
-#endif
-#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
-#  define STDC
-#endif
-#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
-#  define STDC
-#endif
-
-#if defined(__OS400__) && !defined(STDC)    /* iSeries (formerly AS/400). */
-#  define STDC
-#endif
-
-#ifndef STDC
-#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
-#    define const       /* note: need a more gentle solution here */
-#  endif
-#endif
-
-/* Some Mac compilers merge all .h files incorrectly: */
-#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)
-#  define NO_DUMMY_DECL
-#endif
-
-/* Maximum value for memLevel in deflateInit2 */
-#ifndef MAX_MEM_LEVEL
-#  ifdef MAXSEG_64K
-#    define MAX_MEM_LEVEL 8
-#  else
-#    define MAX_MEM_LEVEL 9
-#  endif
-#endif
-
-/* Maximum value for windowBits in deflateInit2 and inflateInit2.
- * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
- * created by gzip. (Files created by minigzip can still be extracted by
- * gzip.)
- */
-#ifndef MAX_WBITS
-#  define MAX_WBITS   15 /* 32K LZ77 window */
-#endif
-
-/* The memory requirements for deflate are (in bytes):
-            (1 << (windowBits+2)) +  (1 << (memLevel+9))
- that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
- plus a few kilobytes for small objects. For example, if you want to reduce
- the default memory requirements from 256K to 128K, compile with
-     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
- Of course this will generally degrade compression (there's no free lunch).
-
-   The memory requirements for inflate are (in bytes) 1 << windowBits
- that is, 32K for windowBits=15 (default value) plus a few kilobytes
- for small objects.
-*/
-
-                        /* Type declarations */
-
-#ifndef OF /* function prototypes */
-#  ifdef STDC
-#    define OF(args)  args
-#  else
-#    define OF(args)  ()
-#  endif
-#endif
-
-/* The following definitions for FAR are needed only for MSDOS mixed
- * model programming (small or medium model with some far allocations).
- * This was tested only with MSC; for other MSDOS compilers you may have
- * to define NO_MEMCPY in zutil.h.  If you don't need the mixed model,
- * just define FAR to be empty.
- */
-#ifdef SYS16BIT
-#  if defined(M_I86SM) || defined(M_I86MM)
-     /* MSC small or medium model */
-#    define SMALL_MEDIUM
-#    ifdef _MSC_VER
-#      define FAR _far
-#    else
-#      define FAR far
-#    endif
-#  endif
-#  if (defined(__SMALL__) || defined(__MEDIUM__))
-     /* Turbo C small or medium model */
-#    define SMALL_MEDIUM
-#    ifdef __BORLANDC__
-#      define FAR _far
-#    else
-#      define FAR far
-#    endif
-#  endif
-#endif
-
-#if defined(WINDOWS) || defined(WIN32)
-   /* If building or using zlib as a DLL, define ZLIB_DLL.
-    * This is not mandatory, but it offers a little performance increase.
-    */
-#  ifdef ZLIB_DLL
-#    if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
-#      ifdef ZLIB_INTERNAL
-#        define ZEXTERN extern __declspec(dllexport)
-#      else
-#        define ZEXTERN extern __declspec(dllimport)
-#      endif
-#    endif
-#  endif  /* ZLIB_DLL */
-   /* If building or using zlib with the WINAPI/WINAPIV calling convention,
-    * define ZLIB_WINAPI.
-    * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
-    */
-#  ifdef ZLIB_WINAPI
-#    ifdef FAR
-#      undef FAR
-#    endif
-#    include <windows.h>
-     /* No need for _export, use ZLIB.DEF instead. */
-     /* For complete Windows compatibility, use WINAPI, not __stdcall. */
-#    define ZEXPORT WINAPI
-#    ifdef WIN32
-#      define ZEXPORTVA WINAPIV
-#    else
-#      define ZEXPORTVA FAR CDECL
-#    endif
-#  endif
-#endif
-
-#if defined (__BEOS__)
-#  ifdef ZLIB_DLL
-#    ifdef ZLIB_INTERNAL
-#      define ZEXPORT   __declspec(dllexport)
-#      define ZEXPORTVA __declspec(dllexport)
-#    else
-#      define ZEXPORT   __declspec(dllimport)
-#      define ZEXPORTVA __declspec(dllimport)
-#    endif
-#  endif
-#endif
-
-#ifndef ZEXTERN
-#  define ZEXTERN extern
-#endif
-#ifndef ZEXPORT
-#  define ZEXPORT
-#endif
-#ifndef ZEXPORTVA
-#  define ZEXPORTVA
-#endif
-
-#ifndef FAR
-#  define FAR
-#endif
-
-#if !defined(__MACTYPES__)
-typedef unsigned char  Byte;  /* 8 bits */
-#endif
-typedef unsigned int   uInt;  /* 16 bits or more */
-typedef unsigned long  uLong; /* 32 bits or more */
-
-#ifdef SMALL_MEDIUM
-   /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
-#  define Bytef Byte FAR
-#else
-   typedef Byte  FAR Bytef;
-#endif
-typedef char  FAR charf;
-typedef int   FAR intf;
-typedef uInt  FAR uIntf;
-typedef uLong FAR uLongf;
-
-#ifdef STDC
-   typedef void const *voidpc;
-   typedef void FAR   *voidpf;
-   typedef void       *voidp;
-#else
-   typedef Byte const *voidpc;
-   typedef Byte FAR   *voidpf;
-   typedef Byte       *voidp;
-#endif
-
-#if 0           /* HAVE_UNISTD_H -- this line is updated by ./configure */
-#  include <sys/types.h> /* for off_t */
-#  include <unistd.h>    /* for SEEK_* and off_t */
-#  ifdef VMS
-#    include <unixio.h>   /* for off_t */
-#  endif
-#  define z_off_t off_t
-#endif
-#ifndef SEEK_SET
-#  define SEEK_SET        0       /* Seek from beginning of file.  */
-#  define SEEK_CUR        1       /* Seek from current position.  */
-#  define SEEK_END        2       /* Set file pointer to EOF plus "offset" */
-#endif
-#ifndef z_off_t
-#  define z_off_t long
-#endif
-
-#if defined(__OS400__)
-#  define NO_vsnprintf
-#endif
-
-#if defined(__MVS__)
-#  define NO_vsnprintf
-#  ifdef FAR
-#    undef FAR
-#  endif
-#endif
-
-/* MVS linker does not support external names larger than 8 bytes */
-#if defined(__MVS__)
-#   pragma map(deflateInit_,"DEIN")
-#   pragma map(deflateInit2_,"DEIN2")
-#   pragma map(deflateEnd,"DEEND")
-#   pragma map(deflateBound,"DEBND")
-#   pragma map(inflateInit_,"ININ")
-#   pragma map(inflateInit2_,"ININ2")
-#   pragma map(inflateEnd,"INEND")
-#   pragma map(inflateSync,"INSY")
-#   pragma map(inflateSetDictionary,"INSEDI")
-#   pragma map(compressBound,"CMBND")
-#   pragma map(inflate_table,"INTABL")
-#   pragma map(inflate_fast,"INFA")
-#   pragma map(inflate_copyright,"INCOPY")
-#endif
-
-#endif /* ZCONF_H */
diff -Nru igraph-0.6.5~quantal1/msvc/include/zlib.h igraph-0.6.5/msvc/include/zlib.h
--- igraph-0.6.5~quantal1/msvc/include/zlib.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/msvc/include/zlib.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,1357 +0,0 @@
-/* zlib.h -- interface of the 'zlib' general purpose compression library
-  version 1.2.3, July 18th, 2005
-
-  Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the authors be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  Jean-loup Gailly        Mark Adler
-  jloup@gzip.org          madler@alumni.caltech.edu
-
-
-  The data format used by the zlib library is described by RFCs (Request for
-  Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt
-  (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
-*/
-
-#ifndef ZLIB_H
-#define ZLIB_H
-
-#include "zconf.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#define ZLIB_VERSION "1.2.3"
-#define ZLIB_VERNUM 0x1230
-
-/*
-     The 'zlib' compression library provides in-memory compression and
-  decompression functions, including integrity checks of the uncompressed
-  data.  This version of the library supports only one compression method
-  (deflation) but other algorithms will be added later and will have the same
-  stream interface.
-
-     Compression can be done in a single step if the buffers are large
-  enough (for example if an input file is mmap'ed), or can be done by
-  repeated calls of the compression function.  In the latter case, the
-  application must provide more input and/or consume the output
-  (providing more output space) before each call.
-
-     The compressed data format used by default by the in-memory functions is
-  the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped
-  around a deflate stream, which is itself documented in RFC 1951.
-
-     The library also supports reading and writing files in gzip (.gz) format
-  with an interface similar to that of stdio using the functions that start
-  with "gz".  The gzip format is different from the zlib format.  gzip is a
-  gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.
-
-     This library can optionally read and write gzip streams in memory as well.
-
-     The zlib format was designed to be compact and fast for use in memory
-  and on communications channels.  The gzip format was designed for single-
-  file compression on file systems, has a larger header than zlib to maintain
-  directory information, and uses a different, slower check method than zlib.
-
-     The library does not install any signal handler. The decoder checks
-  the consistency of the compressed data, so the library should never
-  crash even in case of corrupted input.
-*/
-
-typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
-typedef void   (*free_func)  OF((voidpf opaque, voidpf address));
-
-struct internal_state;
-
-typedef struct z_stream_s {
-    Bytef    *next_in;  /* next input byte */
-    uInt     avail_in;  /* number of bytes available at next_in */
-    uLong    total_in;  /* total nb of input bytes read so far */
-
-    Bytef    *next_out; /* next output byte should be put there */
-    uInt     avail_out; /* remaining free space at next_out */
-    uLong    total_out; /* total nb of bytes output so far */
-
-    char     *msg;      /* last error message, NULL if no error */
-    struct internal_state FAR *state; /* not visible by applications */
-
-    alloc_func zalloc;  /* used to allocate the internal state */
-    free_func  zfree;   /* used to free the internal state */
-    voidpf     opaque;  /* private data object passed to zalloc and zfree */
-
-    int     data_type;  /* best guess about the data type: binary or text */
-    uLong   adler;      /* adler32 value of the uncompressed data */
-    uLong   reserved;   /* reserved for future use */
-} z_stream;
-
-typedef z_stream FAR *z_streamp;
-
-/*
-     gzip header information passed to and from zlib routines.  See RFC 1952
-  for more details on the meanings of these fields.
-*/
-typedef struct gz_header_s {
-    int     text;       /* true if compressed data believed to be text */
-    uLong   time;       /* modification time */
-    int     xflags;     /* extra flags (not used when writing a gzip file) */
-    int     os;         /* operating system */
-    Bytef   *extra;     /* pointer to extra field or Z_NULL if none */
-    uInt    extra_len;  /* extra field length (valid if extra != Z_NULL) */
-    uInt    extra_max;  /* space at extra (only when reading header) */
-    Bytef   *name;      /* pointer to zero-terminated file name or Z_NULL */
-    uInt    name_max;   /* space at name (only when reading header) */
-    Bytef   *comment;   /* pointer to zero-terminated comment or Z_NULL */
-    uInt    comm_max;   /* space at comment (only when reading header) */
-    int     hcrc;       /* true if there was or will be a header crc */
-    int     done;       /* true when done reading gzip header (not used
-                           when writing a gzip file) */
-} gz_header;
-
-typedef gz_header FAR *gz_headerp;
-
-/*
-   The application must update next_in and avail_in when avail_in has
-   dropped to zero. It must update next_out and avail_out when avail_out
-   has dropped to zero. The application must initialize zalloc, zfree and
-   opaque before calling the init function. All other fields are set by the
-   compression library and must not be updated by the application.
-
-   The opaque value provided by the application will be passed as the first
-   parameter for calls of zalloc and zfree. This can be useful for custom
-   memory management. The compression library attaches no meaning to the
-   opaque value.
-
-   zalloc must return Z_NULL if there is not enough memory for the object.
-   If zlib is used in a multi-threaded application, zalloc and zfree must be
-   thread safe.
-
-   On 16-bit systems, the functions zalloc and zfree must be able to allocate
-   exactly 65536 bytes, but will not be required to allocate more than this
-   if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,
-   pointers returned by zalloc for objects of exactly 65536 bytes *must*
-   have their offset normalized to zero. The default allocation function
-   provided by this library ensures this (see zutil.c). To reduce memory
-   requirements and avoid any allocation of 64K objects, at the expense of
-   compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).
-
-   The fields total_in and total_out can be used for statistics or
-   progress reports. After compression, total_in holds the total size of
-   the uncompressed data and may be saved for use in the decompressor
-   (particularly if the decompressor wants to decompress everything in
-   a single step).
-*/
-
-                        /* constants */
-
-#define Z_NO_FLUSH      0
-#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */
-#define Z_SYNC_FLUSH    2
-#define Z_FULL_FLUSH    3
-#define Z_FINISH        4
-#define Z_BLOCK         5
-/* Allowed flush values; see deflate() and inflate() below for details */
-
-#define Z_OK            0
-#define Z_STREAM_END    1
-#define Z_NEED_DICT     2
-#define Z_ERRNO        (-1)
-#define Z_STREAM_ERROR (-2)
-#define Z_DATA_ERROR   (-3)
-#define Z_MEM_ERROR    (-4)
-#define Z_BUF_ERROR    (-5)
-#define Z_VERSION_ERROR (-6)
-/* Return codes for the compression/decompression functions. Negative
- * values are errors, positive values are used for special but normal events.
- */
-
-#define Z_NO_COMPRESSION         0
-#define Z_BEST_SPEED             1
-#define Z_BEST_COMPRESSION       9
-#define Z_DEFAULT_COMPRESSION  (-1)
-/* compression levels */
-
-#define Z_FILTERED            1
-#define Z_HUFFMAN_ONLY        2
-#define Z_RLE                 3
-#define Z_FIXED               4
-#define Z_DEFAULT_STRATEGY    0
-/* compression strategy; see deflateInit2() below for details */
-
-#define Z_BINARY   0
-#define Z_TEXT     1
-#define Z_ASCII    Z_TEXT   /* for compatibility with 1.2.2 and earlier */
-#define Z_UNKNOWN  2
-/* Possible values of the data_type field (though see inflate()) */
-
-#define Z_DEFLATED   8
-/* The deflate compression method (the only one supported in this version) */
-
-#define Z_NULL  0  /* for initializing zalloc, zfree, opaque */
-
-#define zlib_version zlibVersion()
-/* for compatibility with versions < 1.0.2 */
-
-                        /* basic functions */
-
-ZEXTERN const char * ZEXPORT zlibVersion OF((void));
-/* The application can compare zlibVersion and ZLIB_VERSION for consistency.
-   If the first character differs, the library code actually used is
-   not compatible with the zlib.h header file used by the application.
-   This check is automatically made by deflateInit and inflateInit.
- */
-
-/*
-ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));
-
-     Initializes the internal stream state for compression. The fields
-   zalloc, zfree and opaque must be initialized before by the caller.
-   If zalloc and zfree are set to Z_NULL, deflateInit updates them to
-   use default allocation functions.
-
-     The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:
-   1 gives best speed, 9 gives best compression, 0 gives no compression at
-   all (the input data is simply copied a block at a time).
-   Z_DEFAULT_COMPRESSION requests a default compromise between speed and
-   compression (currently equivalent to level 6).
-
-     deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not
-   enough memory, Z_STREAM_ERROR if level is not a valid compression level,
-   Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible
-   with the version assumed by the caller (ZLIB_VERSION).
-   msg is set to null if there is no error message.  deflateInit does not
-   perform any compression: this will be done by deflate().
-*/
-
-
-ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));
-/*
-    deflate compresses as much data as possible, and stops when the input
-  buffer becomes empty or the output buffer becomes full. It may introduce some
-  output latency (reading input without producing any output) except when
-  forced to flush.
-
-    The detailed semantics are as follows. deflate performs one or both of the
-  following actions:
-
-  - Compress more input starting at next_in and update next_in and avail_in
-    accordingly. If not all input can be processed (because there is not
-    enough room in the output buffer), next_in and avail_in are updated and
-    processing will resume at this point for the next call of deflate().
-
-  - Provide more output starting at next_out and update next_out and avail_out
-    accordingly. This action is forced if the parameter flush is non zero.
-    Forcing flush frequently degrades the compression ratio, so this parameter
-    should be set only when necessary (in interactive applications).
-    Some output may be provided even if flush is not set.
-
-  Before the call of deflate(), the application should ensure that at least
-  one of the actions is possible, by providing more input and/or consuming
-  more output, and updating avail_in or avail_out accordingly; avail_out
-  should never be zero before the call. The application can consume the
-  compressed output when it wants, for example when the output buffer is full
-  (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK
-  and with zero avail_out, it must be called again after making room in the
-  output buffer because there might be more output pending.
-
-    Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to
-  decide how much data to accumualte before producing output, in order to
-  maximize compression.
-
-    If the parameter flush is set to Z_SYNC_FLUSH, all pending output is
-  flushed to the output buffer and the output is aligned on a byte boundary, so
-  that the decompressor can get all input data available so far. (In particular
-  avail_in is zero after the call if enough output space has been provided
-  before the call.)  Flushing may degrade compression for some compression
-  algorithms and so it should be used only when necessary.
-
-    If flush is set to Z_FULL_FLUSH, all output is flushed as with
-  Z_SYNC_FLUSH, and the compression state is reset so that decompression can
-  restart from this point if previous compressed data has been damaged or if
-  random access is desired. Using Z_FULL_FLUSH too often can seriously degrade
-  compression.
-
-    If deflate returns with avail_out == 0, this function must be called again
-  with the same value of the flush parameter and more output space (updated
-  avail_out), until the flush is complete (deflate returns with non-zero
-  avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that
-  avail_out is greater than six to avoid repeated flush markers due to
-  avail_out == 0 on return.
-
-    If the parameter flush is set to Z_FINISH, pending input is processed,
-  pending output is flushed and deflate returns with Z_STREAM_END if there
-  was enough output space; if deflate returns with Z_OK, this function must be
-  called again with Z_FINISH and more output space (updated avail_out) but no
-  more input data, until it returns with Z_STREAM_END or an error. After
-  deflate has returned Z_STREAM_END, the only possible operations on the
-  stream are deflateReset or deflateEnd.
-
-    Z_FINISH can be used immediately after deflateInit if all the compression
-  is to be done in a single step. In this case, avail_out must be at least
-  the value returned by deflateBound (see below). If deflate does not return
-  Z_STREAM_END, then it must be called again as described above.
-
-    deflate() sets strm->adler to the adler32 checksum of all input read
-  so far (that is, total_in bytes).
-
-    deflate() may update strm->data_type if it can make a good guess about
-  the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered
-  binary. This field is only for information purposes and does not affect
-  the compression algorithm in any manner.
-
-    deflate() returns Z_OK if some progress has been made (more input
-  processed or more output produced), Z_STREAM_END if all input has been
-  consumed and all output has been produced (only when flush is set to
-  Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example
-  if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible
-  (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not
-  fatal, and deflate() can be called again with more input and more output
-  space to continue compressing.
-*/
-
-
-ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));
-/*
-     All dynamically allocated data structures for this stream are freed.
-   This function discards any unprocessed input and does not flush any
-   pending output.
-
-     deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the
-   stream state was inconsistent, Z_DATA_ERROR if the stream was freed
-   prematurely (some input or output was discarded). In the error case,
-   msg may be set but then points to a static string (which must not be
-   deallocated).
-*/
-
-
-/*
-ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));
-
-     Initializes the internal stream state for decompression. The fields
-   next_in, avail_in, zalloc, zfree and opaque must be initialized before by
-   the caller. If next_in is not Z_NULL and avail_in is large enough (the exact
-   value depends on the compression method), inflateInit determines the
-   compression method from the zlib header and allocates all data structures
-   accordingly; otherwise the allocation will be deferred to the first call of
-   inflate.  If zalloc and zfree are set to Z_NULL, inflateInit updates them to
-   use default allocation functions.
-
-     inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough
-   memory, Z_VERSION_ERROR if the zlib library version is incompatible with the
-   version assumed by the caller.  msg is set to null if there is no error
-   message. inflateInit does not perform any decompression apart from reading
-   the zlib header if present: this will be done by inflate().  (So next_in and
-   avail_in may be modified, but next_out and avail_out are unchanged.)
-*/
-
-
-ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));
-/*
-    inflate decompresses as much data as possible, and stops when the input
-  buffer becomes empty or the output buffer becomes full. It may introduce
-  some output latency (reading input without producing any output) except when
-  forced to flush.
-
-  The detailed semantics are as follows. inflate performs one or both of the
-  following actions:
-
-  - Decompress more input starting at next_in and update next_in and avail_in
-    accordingly. If not all input can be processed (because there is not
-    enough room in the output buffer), next_in is updated and processing
-    will resume at this point for the next call of inflate().
-
-  - Provide more output starting at next_out and update next_out and avail_out
-    accordingly.  inflate() provides as much output as possible, until there
-    is no more input data or no more space in the output buffer (see below
-    about the flush parameter).
-
-  Before the call of inflate(), the application should ensure that at least
-  one of the actions is possible, by providing more input and/or consuming
-  more output, and updating the next_* and avail_* values accordingly.
-  The application can consume the uncompressed output when it wants, for
-  example when the output buffer is full (avail_out == 0), or after each
-  call of inflate(). If inflate returns Z_OK and with zero avail_out, it
-  must be called again after making room in the output buffer because there
-  might be more output pending.
-
-    The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH,
-  Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much
-  output as possible to the output buffer. Z_BLOCK requests that inflate() stop
-  if and when it gets to the next deflate block boundary. When decoding the
-  zlib or gzip format, this will cause inflate() to return immediately after
-  the header and before the first block. When doing a raw inflate, inflate()
-  will go ahead and process the first block, and will return when it gets to
-  the end of that block, or when it runs out of data.
-
-    The Z_BLOCK option assists in appending to or combining deflate streams.
-  Also to assist in this, on return inflate() will set strm->data_type to the
-  number of unused bits in the last byte taken from strm->next_in, plus 64
-  if inflate() is currently decoding the last block in the deflate stream,
-  plus 128 if inflate() returned immediately after decoding an end-of-block
-  code or decoding the complete header up to just before the first byte of the
-  deflate stream. The end-of-block will not be indicated until all of the
-  uncompressed data from that block has been written to strm->next_out.  The
-  number of unused bits may in general be greater than seven, except when
-  bit 7 of data_type is set, in which case the number of unused bits will be
-  less than eight.
-
-    inflate() should normally be called until it returns Z_STREAM_END or an
-  error. However if all decompression is to be performed in a single step
-  (a single call of inflate), the parameter flush should be set to
-  Z_FINISH. In this case all pending input is processed and all pending
-  output is flushed; avail_out must be large enough to hold all the
-  uncompressed data. (The size of the uncompressed data may have been saved
-  by the compressor for this purpose.) The next operation on this stream must
-  be inflateEnd to deallocate the decompression state. The use of Z_FINISH
-  is never required, but can be used to inform inflate that a faster approach
-  may be used for the single inflate() call.
-
-     In this implementation, inflate() always flushes as much output as
-  possible to the output buffer, and always uses the faster approach on the
-  first call. So the only effect of the flush parameter in this implementation
-  is on the return value of inflate(), as noted below, or when it returns early
-  because Z_BLOCK is used.
-
-     If a preset dictionary is needed after this call (see inflateSetDictionary
-  below), inflate sets strm->adler to the adler32 checksum of the dictionary
-  chosen by the compressor and returns Z_NEED_DICT; otherwise it sets
-  strm->adler to the adler32 checksum of all output produced so far (that is,
-  total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described
-  below. At the end of the stream, inflate() checks that its computed adler32
-  checksum is equal to that saved by the compressor and returns Z_STREAM_END
-  only if the checksum is correct.
-
-    inflate() will decompress and check either zlib-wrapped or gzip-wrapped
-  deflate data.  The header type is detected automatically.  Any information
-  contained in the gzip header is not retained, so applications that need that
-  information should instead use raw inflate, see inflateInit2() below, or
-  inflateBack() and perform their own processing of the gzip header and
-  trailer.
-
-    inflate() returns Z_OK if some progress has been made (more input processed
-  or more output produced), Z_STREAM_END if the end of the compressed data has
-  been reached and all uncompressed output has been produced, Z_NEED_DICT if a
-  preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
-  corrupted (input stream not conforming to the zlib format or incorrect check
-  value), Z_STREAM_ERROR if the stream structure was inconsistent (for example
-  if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory,
-  Z_BUF_ERROR if no progress is possible or if there was not enough room in the
-  output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and
-  inflate() can be called again with more input and more output space to
-  continue decompressing. If Z_DATA_ERROR is returned, the application may then
-  call inflateSync() to look for a good compression block if a partial recovery
-  of the data is desired.
-*/
-
-
-ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));
-/*
-     All dynamically allocated data structures for this stream are freed.
-   This function discards any unprocessed input and does not flush any
-   pending output.
-
-     inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
-   was inconsistent. In the error case, msg may be set but then points to a
-   static string (which must not be deallocated).
-*/
-
-                        /* Advanced functions */
-
-/*
-    The following functions are needed only in some special applications.
-*/
-
-/*
-ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,
-                                     int  level,
-                                     int  method,
-                                     int  windowBits,
-                                     int  memLevel,
-                                     int  strategy));
-
-     This is another version of deflateInit with more compression options. The
-   fields next_in, zalloc, zfree and opaque must be initialized before by
-   the caller.
-
-     The method parameter is the compression method. It must be Z_DEFLATED in
-   this version of the library.
-
-     The windowBits parameter is the base two logarithm of the window size
-   (the size of the history buffer). It should be in the range 8..15 for this
-   version of the library. Larger values of this parameter result in better
-   compression at the expense of memory usage. The default value is 15 if
-   deflateInit is used instead.
-
-     windowBits can also be -8..-15 for raw deflate. In this case, -windowBits
-   determines the window size. deflate() will then generate raw deflate data
-   with no zlib header or trailer, and will not compute an adler32 check value.
-
-     windowBits can also be greater than 15 for optional gzip encoding. Add
-   16 to windowBits to write a simple gzip header and trailer around the
-   compressed data instead of a zlib wrapper. The gzip header will have no
-   file name, no extra data, no comment, no modification time (set to zero),
-   no header crc, and the operating system will be set to 255 (unknown).  If a
-   gzip stream is being written, strm->adler is a crc32 instead of an adler32.
-
-     The memLevel parameter specifies how much memory should be allocated
-   for the internal compression state. memLevel=1 uses minimum memory but
-   is slow and reduces compression ratio; memLevel=9 uses maximum memory
-   for optimal speed. The default value is 8. See zconf.h for total memory
-   usage as a function of windowBits and memLevel.
-
-     The strategy parameter is used to tune the compression algorithm. Use the
-   value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a
-   filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no
-   string match), or Z_RLE to limit match distances to one (run-length
-   encoding). Filtered data consists mostly of small values with a somewhat
-   random distribution. In this case, the compression algorithm is tuned to
-   compress them better. The effect of Z_FILTERED is to force more Huffman
-   coding and less string matching; it is somewhat intermediate between
-   Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as
-   Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy
-   parameter only affects the compression ratio but not the correctness of the
-   compressed output even if it is not set appropriately.  Z_FIXED prevents the
-   use of dynamic Huffman codes, allowing for a simpler decoder for special
-   applications.
-
-      deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
-   memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid
-   method). msg is set to null if there is no error message.  deflateInit2 does
-   not perform any compression: this will be done by deflate().
-*/
-
-ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,
-                                             const Bytef *dictionary,
-                                             uInt  dictLength));
-/*
-     Initializes the compression dictionary from the given byte sequence
-   without producing any compressed output. This function must be called
-   immediately after deflateInit, deflateInit2 or deflateReset, before any
-   call of deflate. The compressor and decompressor must use exactly the same
-   dictionary (see inflateSetDictionary).
-
-     The dictionary should consist of strings (byte sequences) that are likely
-   to be encountered later in the data to be compressed, with the most commonly
-   used strings preferably put towards the end of the dictionary. Using a
-   dictionary is most useful when the data to be compressed is short and can be
-   predicted with good accuracy; the data can then be compressed better than
-   with the default empty dictionary.
-
-     Depending on the size of the compression data structures selected by
-   deflateInit or deflateInit2, a part of the dictionary may in effect be
-   discarded, for example if the dictionary is larger than the window size in
-   deflate or deflate2. Thus the strings most likely to be useful should be
-   put at the end of the dictionary, not at the front. In addition, the
-   current implementation of deflate will use at most the window size minus
-   262 bytes of the provided dictionary.
-
-     Upon return of this function, strm->adler is set to the adler32 value
-   of the dictionary; the decompressor may later use this value to determine
-   which dictionary has been used by the compressor. (The adler32 value
-   applies to the whole dictionary even if only a subset of the dictionary is
-   actually used by the compressor.) If a raw deflate was requested, then the
-   adler32 value is not computed and strm->adler is not set.
-
-     deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a
-   parameter is invalid (such as NULL dictionary) or the stream state is
-   inconsistent (for example if deflate has already been called for this stream
-   or if the compression method is bsort). deflateSetDictionary does not
-   perform any compression: this will be done by deflate().
-*/
-
-ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,
-                                    z_streamp source));
-/*
-     Sets the destination stream as a complete copy of the source stream.
-
-     This function can be useful when several compression strategies will be
-   tried, for example when there are several ways of pre-processing the input
-   data with a filter. The streams that will be discarded should then be freed
-   by calling deflateEnd.  Note that deflateCopy duplicates the internal
-   compression state which can be quite large, so this strategy is slow and
-   can consume lots of memory.
-
-     deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
-   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
-   (such as zalloc being NULL). msg is left unchanged in both source and
-   destination.
-*/
-
-ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));
-/*
-     This function is equivalent to deflateEnd followed by deflateInit,
-   but does not free and reallocate all the internal compression state.
-   The stream will keep the same compression level and any other attributes
-   that may have been set by deflateInit2.
-
-      deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent (such as zalloc or state being NULL).
-*/
-
-ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
-                                      int level,
-                                      int strategy));
-/*
-     Dynamically update the compression level and compression strategy.  The
-   interpretation of level and strategy is as in deflateInit2.  This can be
-   used to switch between compression and straight copy of the input data, or
-   to switch to a different kind of input data requiring a different
-   strategy. If the compression level is changed, the input available so far
-   is compressed with the old level (and may be flushed); the new level will
-   take effect only at the next call of deflate().
-
-     Before the call of deflateParams, the stream state must be set as for
-   a call of deflate(), since the currently available input may have to
-   be compressed and flushed. In particular, strm->avail_out must be non-zero.
-
-     deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source
-   stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR
-   if strm->avail_out was zero.
-*/
-
-ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,
-                                    int good_length,
-                                    int max_lazy,
-                                    int nice_length,
-                                    int max_chain));
-/*
-     Fine tune deflate's internal compression parameters.  This should only be
-   used by someone who understands the algorithm used by zlib's deflate for
-   searching for the best matching string, and even then only by the most
-   fanatic optimizer trying to squeeze out the last compressed bit for their
-   specific input data.  Read the deflate.c source code for the meaning of the
-   max_lazy, good_length, nice_length, and max_chain parameters.
-
-     deflateTune() can be called after deflateInit() or deflateInit2(), and
-   returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.
- */
-
-ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
-                                       uLong sourceLen));
-/*
-     deflateBound() returns an upper bound on the compressed size after
-   deflation of sourceLen bytes.  It must be called after deflateInit()
-   or deflateInit2().  This would be used to allocate an output buffer
-   for deflation in a single pass, and so would be called before deflate().
-*/
-
-ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
-                                     int bits,
-                                     int value));
-/*
-     deflatePrime() inserts bits in the deflate output stream.  The intent
-  is that this function is used to start off the deflate output with the
-  bits leftover from a previous deflate stream when appending to it.  As such,
-  this function can only be used for raw deflate, and must be used before the
-  first deflate() call after a deflateInit2() or deflateReset().  bits must be
-  less than or equal to 16, and that many of the least significant bits of
-  value will be inserted in the output.
-
-      deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent.
-*/
-
-ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
-                                         gz_headerp head));
-/*
-      deflateSetHeader() provides gzip header information for when a gzip
-   stream is requested by deflateInit2().  deflateSetHeader() may be called
-   after deflateInit2() or deflateReset() and before the first call of
-   deflate().  The text, time, os, extra field, name, and comment information
-   in the provided gz_header structure are written to the gzip header (xflag is
-   ignored -- the extra flags are set according to the compression level).  The
-   caller must assure that, if not Z_NULL, name and comment are terminated with
-   a zero byte, and that if extra is not Z_NULL, that extra_len bytes are
-   available there.  If hcrc is true, a gzip header crc is included.  Note that
-   the current versions of the command-line version of gzip (up through version
-   1.3.x) do not support header crc's, and will report that it is a "multi-part
-   gzip file" and give up.
-
-      If deflateSetHeader is not used, the default gzip header has text false,
-   the time set to zero, and os set to 255, with no extra, name, or comment
-   fields.  The gzip header is returned to the default state by deflateReset().
-
-      deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent.
-*/
-
-/*
-ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,
-                                     int  windowBits));
-
-     This is another version of inflateInit with an extra parameter. The
-   fields next_in, avail_in, zalloc, zfree and opaque must be initialized
-   before by the caller.
-
-     The windowBits parameter is the base two logarithm of the maximum window
-   size (the size of the history buffer).  It should be in the range 8..15 for
-   this version of the library. The default value is 15 if inflateInit is used
-   instead. windowBits must be greater than or equal to the windowBits value
-   provided to deflateInit2() while compressing, or it must be equal to 15 if
-   deflateInit2() was not used. If a compressed stream with a larger window
-   size is given as input, inflate() will return with the error code
-   Z_DATA_ERROR instead of trying to allocate a larger window.
-
-     windowBits can also be -8..-15 for raw inflate. In this case, -windowBits
-   determines the window size. inflate() will then process raw deflate data,
-   not looking for a zlib or gzip header, not generating a check value, and not
-   looking for any check values for comparison at the end of the stream. This
-   is for use with other formats that use the deflate compressed data format
-   such as zip.  Those formats provide their own check values. If a custom
-   format is developed using the raw deflate format for compressed data, it is
-   recommended that a check value such as an adler32 or a crc32 be applied to
-   the uncompressed data as is done in the zlib, gzip, and zip formats.  For
-   most applications, the zlib format should be used as is. Note that comments
-   above on the use in deflateInit2() applies to the magnitude of windowBits.
-
-     windowBits can also be greater than 15 for optional gzip decoding. Add
-   32 to windowBits to enable zlib and gzip decoding with automatic header
-   detection, or add 16 to decode only the gzip format (the zlib format will
-   return a Z_DATA_ERROR).  If a gzip stream is being decoded, strm->adler is
-   a crc32 instead of an adler32.
-
-     inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
-   memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg
-   is set to null if there is no error message.  inflateInit2 does not perform
-   any decompression apart from reading the zlib header if present: this will
-   be done by inflate(). (So next_in and avail_in may be modified, but next_out
-   and avail_out are unchanged.)
-*/
-
-ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,
-                                             const Bytef *dictionary,
-                                             uInt  dictLength));
-/*
-     Initializes the decompression dictionary from the given uncompressed byte
-   sequence. This function must be called immediately after a call of inflate,
-   if that call returned Z_NEED_DICT. The dictionary chosen by the compressor
-   can be determined from the adler32 value returned by that call of inflate.
-   The compressor and decompressor must use exactly the same dictionary (see
-   deflateSetDictionary).  For raw inflate, this function can be called
-   immediately after inflateInit2() or inflateReset() and before any call of
-   inflate() to set the dictionary.  The application must insure that the
-   dictionary that was used for compression is provided.
-
-     inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
-   parameter is invalid (such as NULL dictionary) or the stream state is
-   inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
-   expected one (incorrect adler32 value). inflateSetDictionary does not
-   perform any decompression: this will be done by subsequent calls of
-   inflate().
-*/
-
-ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));
-/*
-    Skips invalid compressed data until a full flush point (see above the
-  description of deflate with Z_FULL_FLUSH) can be found, or until all
-  available input is skipped. No output is provided.
-
-    inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
-  if no more input was provided, Z_DATA_ERROR if no flush point has been found,
-  or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
-  case, the application may save the current current value of total_in which
-  indicates where valid compressed data was found. In the error case, the
-  application may repeatedly call inflateSync, providing more input each time,
-  until success or end of the input data.
-*/
-
-ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,
-                                    z_streamp source));
-/*
-     Sets the destination stream as a complete copy of the source stream.
-
-     This function can be useful when randomly accessing a large stream.  The
-   first pass through the stream can periodically record the inflate state,
-   allowing restarting inflate at those points when randomly accessing the
-   stream.
-
-     inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
-   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
-   (such as zalloc being NULL). msg is left unchanged in both source and
-   destination.
-*/
-
-ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));
-/*
-     This function is equivalent to inflateEnd followed by inflateInit,
-   but does not free and reallocate all the internal decompression state.
-   The stream will keep attributes that may have been set by inflateInit2.
-
-      inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent (such as zalloc or state being NULL).
-*/
-
-ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
-                                     int bits,
-                                     int value));
-/*
-     This function inserts bits in the inflate input stream.  The intent is
-  that this function is used to start inflating at a bit position in the
-  middle of a byte.  The provided bits will be used before any bytes are used
-  from next_in.  This function should only be used with raw inflate, and
-  should be used before the first inflate() call after inflateInit2() or
-  inflateReset().  bits must be less than or equal to 16, and that many of the
-  least significant bits of value will be inserted in the input.
-
-      inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent.
-*/
-
-ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
-                                         gz_headerp head));
-/*
-      inflateGetHeader() requests that gzip header information be stored in the
-   provided gz_header structure.  inflateGetHeader() may be called after
-   inflateInit2() or inflateReset(), and before the first call of inflate().
-   As inflate() processes the gzip stream, head->done is zero until the header
-   is completed, at which time head->done is set to one.  If a zlib stream is
-   being decoded, then head->done is set to -1 to indicate that there will be
-   no gzip header information forthcoming.  Note that Z_BLOCK can be used to
-   force inflate() to return immediately after header processing is complete
-   and before any actual data is decompressed.
-
-      The text, time, xflags, and os fields are filled in with the gzip header
-   contents.  hcrc is set to true if there is a header CRC.  (The header CRC
-   was valid if done is set to one.)  If extra is not Z_NULL, then extra_max
-   contains the maximum number of bytes to write to extra.  Once done is true,
-   extra_len contains the actual extra field length, and extra contains the
-   extra field, or that field truncated if extra_max is less than extra_len.
-   If name is not Z_NULL, then up to name_max characters are written there,
-   terminated with a zero unless the length is greater than name_max.  If
-   comment is not Z_NULL, then up to comm_max characters are written there,
-   terminated with a zero unless the length is greater than comm_max.  When
-   any of extra, name, or comment are not Z_NULL and the respective field is
-   not present in the header, then that field is set to Z_NULL to signal its
-   absence.  This allows the use of deflateSetHeader() with the returned
-   structure to duplicate the header.  However if those fields are set to
-   allocated memory, then the application will need to save those pointers
-   elsewhere so that they can be eventually freed.
-
-      If inflateGetHeader is not used, then the header information is simply
-   discarded.  The header is always checked for validity, including the header
-   CRC if present.  inflateReset() will reset the process to discard the header
-   information.  The application would need to call inflateGetHeader() again to
-   retrieve the header from the next gzip stream.
-
-      inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
-   stream state was inconsistent.
-*/
-
-/*
-ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
-                                        unsigned char FAR *window));
-
-     Initialize the internal stream state for decompression using inflateBack()
-   calls.  The fields zalloc, zfree and opaque in strm must be initialized
-   before the call.  If zalloc and zfree are Z_NULL, then the default library-
-   derived memory allocation routines are used.  windowBits is the base two
-   logarithm of the window size, in the range 8..15.  window is a caller
-   supplied buffer of that size.  Except for special applications where it is
-   assured that deflate was used with small window sizes, windowBits must be 15
-   and a 32K byte window must be supplied to be able to decompress general
-   deflate streams.
-
-     See inflateBack() for the usage of these routines.
-
-     inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of
-   the paramaters are invalid, Z_MEM_ERROR if the internal state could not
-   be allocated, or Z_VERSION_ERROR if the version of the library does not
-   match the version of the header file.
-*/
-
-typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));
-typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));
-
-ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
-                                    in_func in, void FAR *in_desc,
-                                    out_func out, void FAR *out_desc));
-/*
-     inflateBack() does a raw inflate with a single call using a call-back
-   interface for input and output.  This is more efficient than inflate() for
-   file i/o applications in that it avoids copying between the output and the
-   sliding window by simply making the window itself the output buffer.  This
-   function trusts the application to not change the output buffer passed by
-   the output function, at least until inflateBack() returns.
-
-     inflateBackInit() must be called first to allocate the internal state
-   and to initialize the state with the user-provided window buffer.
-   inflateBack() may then be used multiple times to inflate a complete, raw
-   deflate stream with each call.  inflateBackEnd() is then called to free
-   the allocated state.
-
-     A raw deflate stream is one with no zlib or gzip header or trailer.
-   This routine would normally be used in a utility that reads zip or gzip
-   files and writes out uncompressed files.  The utility would decode the
-   header and process the trailer on its own, hence this routine expects
-   only the raw deflate stream to decompress.  This is different from the
-   normal behavior of inflate(), which expects either a zlib or gzip header and
-   trailer around the deflate stream.
-
-     inflateBack() uses two subroutines supplied by the caller that are then
-   called by inflateBack() for input and output.  inflateBack() calls those
-   routines until it reads a complete deflate stream and writes out all of the
-   uncompressed data, or until it encounters an error.  The function's
-   parameters and return types are defined above in the in_func and out_func
-   typedefs.  inflateBack() will call in(in_desc, &buf) which should return the
-   number of bytes of provided input, and a pointer to that input in buf.  If
-   there is no input available, in() must return zero--buf is ignored in that
-   case--and inflateBack() will return a buffer error.  inflateBack() will call
-   out(out_desc, buf, len) to write the uncompressed data buf[0..len-1].  out()
-   should return zero on success, or non-zero on failure.  If out() returns
-   non-zero, inflateBack() will return with an error.  Neither in() nor out()
-   are permitted to change the contents of the window provided to
-   inflateBackInit(), which is also the buffer that out() uses to write from.
-   The length written by out() will be at most the window size.  Any non-zero
-   amount of input may be provided by in().
-
-     For convenience, inflateBack() can be provided input on the first call by
-   setting strm->next_in and strm->avail_in.  If that input is exhausted, then
-   in() will be called.  Therefore strm->next_in must be initialized before
-   calling inflateBack().  If strm->next_in is Z_NULL, then in() will be called
-   immediately for input.  If strm->next_in is not Z_NULL, then strm->avail_in
-   must also be initialized, and then if strm->avail_in is not zero, input will
-   initially be taken from strm->next_in[0 .. strm->avail_in - 1].
-
-     The in_desc and out_desc parameters of inflateBack() is passed as the
-   first parameter of in() and out() respectively when they are called.  These
-   descriptors can be optionally used to pass any information that the caller-
-   supplied in() and out() functions need to do their job.
-
-     On return, inflateBack() will set strm->next_in and strm->avail_in to
-   pass back any unused input that was provided by the last in() call.  The
-   return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR
-   if in() or out() returned an error, Z_DATA_ERROR if there was a format
-   error in the deflate stream (in which case strm->msg is set to indicate the
-   nature of the error), or Z_STREAM_ERROR if the stream was not properly
-   initialized.  In the case of Z_BUF_ERROR, an input or output error can be
-   distinguished using strm->next_in which will be Z_NULL only if in() returned
-   an error.  If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to
-   out() returning non-zero.  (in() will always be called before out(), so
-   strm->next_in is assured to be defined if out() returns non-zero.)  Note
-   that inflateBack() cannot return Z_OK.
-*/
-
-ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
-/*
-     All memory allocated by inflateBackInit() is freed.
-
-     inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream
-   state was inconsistent.
-*/
-
-ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
-/* Return flags indicating compile-time options.
-
-    Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
-     1.0: size of uInt
-     3.2: size of uLong
-     5.4: size of voidpf (pointer)
-     7.6: size of z_off_t
-
-    Compiler, assembler, and debug options:
-     8: DEBUG
-     9: ASMV or ASMINF -- use ASM code
-     10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention
-     11: 0 (reserved)
-
-    One-time table building (smaller code, but not thread-safe if true):
-     12: BUILDFIXED -- build static block decoding tables when needed
-     13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed
-     14,15: 0 (reserved)
-
-    Library content (indicates missing functionality):
-     16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking
-                          deflate code when not needed)
-     17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect
-                    and decode gzip streams (to avoid linking crc code)
-     18-19: 0 (reserved)
-
-    Operation variations (changes in library functionality):
-     20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate
-     21: FASTEST -- deflate algorithm with only one, lowest compression level
-     22,23: 0 (reserved)
-
-    The sprintf variant used by gzprintf (zero is best):
-     24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format
-     25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!
-     26: 0 = returns value, 1 = void -- 1 means inferred string length returned
-
-    Remainder:
-     27-31: 0 (reserved)
- */
-
-
-                        /* utility functions */
-
-/*
-     The following utility functions are implemented on top of the
-   basic stream-oriented functions. To simplify the interface, some
-   default options are assumed (compression level and memory usage,
-   standard memory allocation functions). The source code of these
-   utility functions can easily be modified if you need special options.
-*/
-
-ZEXTERN int ZEXPORT compress OF((Bytef *dest,   uLongf *destLen,
-                                 const Bytef *source, uLong sourceLen));
-/*
-     Compresses the source buffer into the destination buffer.  sourceLen is
-   the byte length of the source buffer. Upon entry, destLen is the total
-   size of the destination buffer, which must be at least the value returned
-   by compressBound(sourceLen). Upon exit, destLen is the actual size of the
-   compressed buffer.
-     This function can be used to compress a whole file at once if the
-   input file is mmap'ed.
-     compress returns Z_OK if success, Z_MEM_ERROR if there was not
-   enough memory, Z_BUF_ERROR if there was not enough room in the output
-   buffer.
-*/
-
-ZEXTERN int ZEXPORT compress2 OF((Bytef *dest,   uLongf *destLen,
-                                  const Bytef *source, uLong sourceLen,
-                                  int level));
-/*
-     Compresses the source buffer into the destination buffer. The level
-   parameter has the same meaning as in deflateInit.  sourceLen is the byte
-   length of the source buffer. Upon entry, destLen is the total size of the
-   destination buffer, which must be at least the value returned by
-   compressBound(sourceLen). Upon exit, destLen is the actual size of the
-   compressed buffer.
-
-     compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
-   memory, Z_BUF_ERROR if there was not enough room in the output buffer,
-   Z_STREAM_ERROR if the level parameter is invalid.
-*/
-
-ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));
-/*
-     compressBound() returns an upper bound on the compressed size after
-   compress() or compress2() on sourceLen bytes.  It would be used before
-   a compress() or compress2() call to allocate the destination buffer.
-*/
-
-ZEXTERN int ZEXPORT uncompress OF((Bytef *dest,   uLongf *destLen,
-                                   const Bytef *source, uLong sourceLen));
-/*
-     Decompresses the source buffer into the destination buffer.  sourceLen is
-   the byte length of the source buffer. Upon entry, destLen is the total
-   size of the destination buffer, which must be large enough to hold the
-   entire uncompressed data. (The size of the uncompressed data must have
-   been saved previously by the compressor and transmitted to the decompressor
-   by some mechanism outside the scope of this compression library.)
-   Upon exit, destLen is the actual size of the compressed buffer.
-     This function can be used to decompress a whole file at once if the
-   input file is mmap'ed.
-
-     uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
-   enough memory, Z_BUF_ERROR if there was not enough room in the output
-   buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete.
-*/
-
-
-typedef voidp gzFile;
-
-ZEXTERN gzFile ZEXPORT gzopen  OF((const char *path, const char *mode));
-/*
-     Opens a gzip (.gz) file for reading or writing. The mode parameter
-   is as in fopen ("rb" or "wb") but can also include a compression level
-   ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for
-   Huffman only compression as in "wb1h", or 'R' for run-length encoding
-   as in "wb1R". (See the description of deflateInit2 for more information
-   about the strategy parameter.)
-
-     gzopen can be used to read a file which is not in gzip format; in this
-   case gzread will directly read from the file without decompression.
-
-     gzopen returns NULL if the file could not be opened or if there was
-   insufficient memory to allocate the (de)compression state; errno
-   can be checked to distinguish the two cases (if errno is zero, the
-   zlib error is Z_MEM_ERROR).  */
-
-ZEXTERN gzFile ZEXPORT gzdopen  OF((int fd, const char *mode));
-/*
-     gzdopen() associates a gzFile with the file descriptor fd.  File
-   descriptors are obtained from calls like open, dup, creat, pipe or
-   fileno (in the file has been previously opened with fopen).
-   The mode parameter is as in gzopen.
-     The next call of gzclose on the returned gzFile will also close the
-   file descriptor fd, just like fclose(fdopen(fd), mode) closes the file
-   descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode).
-     gzdopen returns NULL if there was insufficient memory to allocate
-   the (de)compression state.
-*/
-
-ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));
-/*
-     Dynamically update the compression level or strategy. See the description
-   of deflateInit2 for the meaning of these parameters.
-     gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not
-   opened for writing.
-*/
-
-ZEXTERN int ZEXPORT    gzread  OF((gzFile file, voidp buf, unsigned len));
-/*
-     Reads the given number of uncompressed bytes from the compressed file.
-   If the input file was not in gzip format, gzread copies the given number
-   of bytes into the buffer.
-     gzread returns the number of uncompressed bytes actually read (0 for
-   end of file, -1 for error). */
-
-ZEXTERN int ZEXPORT    gzwrite OF((gzFile file,
-                                   voidpc buf, unsigned len));
-/*
-     Writes the given number of uncompressed bytes into the compressed file.
-   gzwrite returns the number of uncompressed bytes actually written
-   (0 in case of error).
-*/
-
-ZEXTERN int ZEXPORTVA   gzprintf OF((gzFile file, const char *format, ...));
-/*
-     Converts, formats, and writes the args to the compressed file under
-   control of the format string, as in fprintf. gzprintf returns the number of
-   uncompressed bytes actually written (0 in case of error).  The number of
-   uncompressed bytes written is limited to 4095. The caller should assure that
-   this limit is not exceeded. If it is exceeded, then gzprintf() will return
-   return an error (0) with nothing written. In this case, there may also be a
-   buffer overflow with unpredictable consequences, which is possible only if
-   zlib was compiled with the insecure functions sprintf() or vsprintf()
-   because the secure snprintf() or vsnprintf() functions were not available.
-*/
-
-ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));
-/*
-      Writes the given null-terminated string to the compressed file, excluding
-   the terminating null character.
-      gzputs returns the number of characters written, or -1 in case of error.
-*/
-
-ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));
-/*
-      Reads bytes from the compressed file until len-1 characters are read, or
-   a newline character is read and transferred to buf, or an end-of-file
-   condition is encountered.  The string is then terminated with a null
-   character.
-      gzgets returns buf, or Z_NULL in case of error.
-*/
-
-ZEXTERN int ZEXPORT    gzputc OF((gzFile file, int c));
-/*
-      Writes c, converted to an unsigned char, into the compressed file.
-   gzputc returns the value that was written, or -1 in case of error.
-*/
-
-ZEXTERN int ZEXPORT    gzgetc OF((gzFile file));
-/*
-      Reads one byte from the compressed file. gzgetc returns this byte
-   or -1 in case of end of file or error.
-*/
-
-ZEXTERN int ZEXPORT    gzungetc OF((int c, gzFile file));
-/*
-      Push one character back onto the stream to be read again later.
-   Only one character of push-back is allowed.  gzungetc() returns the
-   character pushed, or -1 on failure.  gzungetc() will fail if a
-   character has been pushed but not read yet, or if c is -1. The pushed
-   character will be discarded if the stream is repositioned with gzseek()
-   or gzrewind().
-*/
-
-ZEXTERN int ZEXPORT    gzflush OF((gzFile file, int flush));
-/*
-     Flushes all pending output into the compressed file. The parameter
-   flush is as in the deflate() function. The return value is the zlib
-   error number (see function gzerror below). gzflush returns Z_OK if
-   the flush parameter is Z_FINISH and all output could be flushed.
-     gzflush should be called only when strictly necessary because it can
-   degrade compression.
-*/
-
-ZEXTERN z_off_t ZEXPORT    gzseek OF((gzFile file,
-                                      z_off_t offset, int whence));
-/*
-      Sets the starting position for the next gzread or gzwrite on the
-   given compressed file. The offset represents a number of bytes in the
-   uncompressed data stream. The whence parameter is defined as in lseek(2);
-   the value SEEK_END is not supported.
-     If the file is opened for reading, this function is emulated but can be
-   extremely slow. If the file is opened for writing, only forward seeks are
-   supported; gzseek then compresses a sequence of zeroes up to the new
-   starting position.
-
-      gzseek returns the resulting offset location as measured in bytes from
-   the beginning of the uncompressed stream, or -1 in case of error, in
-   particular if the file is opened for writing and the new starting position
-   would be before the current position.
-*/
-
-ZEXTERN int ZEXPORT    gzrewind OF((gzFile file));
-/*
-     Rewinds the given file. This function is supported only for reading.
-
-   gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)
-*/
-
-ZEXTERN z_off_t ZEXPORT    gztell OF((gzFile file));
-/*
-     Returns the starting position for the next gzread or gzwrite on the
-   given compressed file. This position represents a number of bytes in the
-   uncompressed data stream.
-
-   gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)
-*/
-
-ZEXTERN int ZEXPORT gzeof OF((gzFile file));
-/*
-     Returns 1 when EOF has previously been detected reading the given
-   input stream, otherwise zero.
-*/
-
-ZEXTERN int ZEXPORT gzdirect OF((gzFile file));
-/*
-     Returns 1 if file is being read directly without decompression, otherwise
-   zero.
-*/
-
-ZEXTERN int ZEXPORT    gzclose OF((gzFile file));
-/*
-     Flushes all pending output if necessary, closes the compressed file
-   and deallocates all the (de)compression state. The return value is the zlib
-   error number (see function gzerror below).
-*/
-
-ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));
-/*
-     Returns the error message for the last error which occurred on the
-   given compressed file. errnum is set to zlib error number. If an
-   error occurred in the file system and not in the compression library,
-   errnum is set to Z_ERRNO and the application may consult errno
-   to get the exact error code.
-*/
-
-ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
-/*
-     Clears the error and end-of-file flags for file. This is analogous to the
-   clearerr() function in stdio. This is useful for continuing to read a gzip
-   file that is being written concurrently.
-*/
-
-                        /* checksum functions */
-
-/*
-     These functions are not related to compression but are exported
-   anyway because they might be useful in applications using the
-   compression library.
-*/
-
-ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
-/*
-     Update a running Adler-32 checksum with the bytes buf[0..len-1] and
-   return the updated checksum. If buf is NULL, this function returns
-   the required initial value for the checksum.
-   An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
-   much faster. Usage example:
-
-     uLong adler = adler32(0L, Z_NULL, 0);
-
-     while (read_buffer(buffer, length) != EOF) {
-       adler = adler32(adler, buffer, length);
-     }
-     if (adler != original_adler) error();
-*/
-
-ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,
-                                          z_off_t len2));
-/*
-     Combine two Adler-32 checksums into one.  For two sequences of bytes, seq1
-   and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
-   each, adler1 and adler2.  adler32_combine() returns the Adler-32 checksum of
-   seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.
-*/
-
-ZEXTERN uLong ZEXPORT crc32   OF((uLong crc, const Bytef *buf, uInt len));
-/*
-     Update a running CRC-32 with the bytes buf[0..len-1] and return the
-   updated CRC-32. If buf is NULL, this function returns the required initial
-   value for the for the crc. Pre- and post-conditioning (one's complement) is
-   performed within this function so it shouldn't be done by the application.
-   Usage example:
-
-     uLong crc = crc32(0L, Z_NULL, 0);
-
-     while (read_buffer(buffer, length) != EOF) {
-       crc = crc32(crc, buffer, length);
-     }
-     if (crc != original_crc) error();
-*/
-
-ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));
-
-/*
-     Combine two CRC-32 check values into one.  For two sequences of bytes,
-   seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
-   calculated for each, crc1 and crc2.  crc32_combine() returns the CRC-32
-   check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and
-   len2.
-*/
-
-
-                        /* various hacks, don't look :) */
-
-/* deflateInit and inflateInit are macros to allow checking the zlib version
- * and the compiler's view of z_stream:
- */
-ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,
-                                     const char *version, int stream_size));
-ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,
-                                     const char *version, int stream_size));
-ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int  level, int  method,
-                                      int windowBits, int memLevel,
-                                      int strategy, const char *version,
-                                      int stream_size));
-ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int  windowBits,
-                                      const char *version, int stream_size));
-ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,
-                                         unsigned char FAR *window,
-                                         const char *version,
-                                         int stream_size));
-#define deflateInit(strm, level) \
-        deflateInit_((strm), (level),       ZLIB_VERSION, sizeof(z_stream))
-#define inflateInit(strm) \
-        inflateInit_((strm),                ZLIB_VERSION, sizeof(z_stream))
-#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \
-        deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\
-                      (strategy),           ZLIB_VERSION, sizeof(z_stream))
-#define inflateInit2(strm, windowBits) \
-        inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream))
-#define inflateBackInit(strm, windowBits, window) \
-        inflateBackInit_((strm), (windowBits), (window), \
-        ZLIB_VERSION, sizeof(z_stream))
-
-
-#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)
-    struct internal_state {int dummy;}; /* hack for buggy compilers */
-#endif
-
-ZEXTERN const char   * ZEXPORT zError           OF((int));
-ZEXTERN int            ZEXPORT inflateSyncPoint OF((z_streamp z));
-ZEXTERN const uLongf * ZEXPORT get_crc_table    OF((void));
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif /* ZLIB_H */
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/docs.py igraph-0.6.5/nexus/cgi-bin/docs.py
--- igraph-0.6.5~quantal1/nexus/cgi-bin/docs.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/docs.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,329 +0,0 @@
-docs='''
-<span>
-# Contents
-</span>
-
-1. [Atom and RSS feeds](#feeds)
-1. [The Nexus API](#api)
-    1. [Basics](#basics)
-    1. [Data set queries](#dsq)
-    1. [Data set downloads](#dsd)
-    1. [Searching](#searching)
-    1. [Data formats](#dformat)
-    1. [Licences](#licence)
-    1. [XML schemas](#schema)
-
-<a name="feeds"></a>
-# Atom and RSS feeds
-
-Nexus provides [Atom][6] and [RSS 2.0][7] feeds, these are handy if
-you want to get notified about new data sets. There is a feed for all
-data sets, but you can also use feeds for data set tags, or even
-combination of tags. To subscribe to the non-specific feed, click on
-the yellow feed icon at the top right corner of any Nexus page, in the
-'What's new?' box.
-
-## Browser support
-
-Not all browsers support Atom and RSS feeds out of the box, e.g. for
-the current version of Google Chrome, you need to install an extension
-first. 
-
-## Tag feeds
-
-For subscribing to feeds of data set tags, e.g. if you are only
-interested in weighted networks, click on the tag first in the tag
-cloud at the top right corner of any Nexus page, in the 'Data tags'
-box. Then click on the big yellow feed icon at the top of the page.
-
-## Arbitrary search feeds
-
-In addition to data set tags, Nexus provides Atom feeds for arbitrary
-Nexus searches (see [Searching](#searching) below). E.g. it is
-possible to create feed that contains only data sets related to
-football. One has to enter the necessary keywords in the search box at
-the top right of any Nexus page, press enter, and then on the list of
-results, click on the big yellow feed icon at the top of the page.
-
-## RSS feeds instead of Atom
-
-If you want to use RSS feeds instead of Atom feeds, then copy the feed
-URL and replace the '<code>format=atom</code>' part with
-'<code>format=rss</code>'.
-
-<a name="api"></a>
-# The Nexus API
-
-Nexus features a web service an an API that allows programatic queries
-and data downloads. The API is supposed to be [RESTful][1].
-
-<a name="basics"></a>
-## Basics
-
-All queries can be supplied as HTTP GET methods, i.e. simple HTTP
-downloads. A Nexus query has the following parts:
-
-<table>
-  <tr><td></td><td>Example</td></tr>
-  <tr><td>Base URI</td><td><code>http://nexus.igraph.org/api/</code></td></tr>
-  <tr><td>Service</td><td><code>dataset_info?</code></td></tr>
-  <tr><td>Format</td><td><code>format=xml</code></td></tr>
-  <tr><td>Arguments</td><td><code>&id=1</code></td></tr>
-</table>
-
-This gives the URI:
-<code>http://nexus.igraph.org/api/dataset_info?format=xml&id=1</code>.
-
-Currently Nexus supports the followingservices: 
-
-<table>
-  <tr><td><code>dataset_info?</code></td><td>Information about one or
-    more data sets.</td></tr>
-  <tr><td><code>dataset?</code></td><td>Download a data set.</td></tr>
-  <tr><td><code>format?</code></td><td>Information about data formats.
-    </td></tr>
-  <tr><td><code>licence?</code></td><td>Information about data set
-    licences.</td></tr>
-  <tr><td><code>search?</code></td><td>Search Nexus</tr></tr>
-</table>
-
-and two response formats, XML and plain text.
-
-<a name="dsq"></a>
-## Data set queries
-
-### Parameters
-
-Data set information can be queried using the
-'<code>dataset_info?</code>' service. It has the following parameters:
-
-<table>
-  <tr><td>id</td><td>The numeric or string id of the data set to
-    query. If not present, then a list is returned, with basic
-    information about all data sets. (Or a subset of them, if the
-    '<code>tag</code>' parameter is present.) If '<code>id</code>' is
-    given, then detailed information is returned about a single
-    dataset. See examples below.</td></tr> 
-  <tr><td>tag</td><td>Tag or tags separated by a '<code>|</code>'
-    character. Only data sets with these tag(s) are listed. You cannot
-    give both '<code>id</code>', and '<code>tag</code>', this results an
-    error.</td></tr>
-  <tr><td>operator</td><td>Specifies whether only one or all tags are
-    required. If it is not given or '<code>or</code>' then all data sets
-    are listed that have at least one of the given tags. If it is
-    '<code>and</code>', then all tags are required for a data set to
-    include it in the result.</td></tr>
-  <tr><td>order</td><td>Specifies the order of the data sets, in the
-    result. Possible values are in the table below.</td></tr>
-  <tr><td>offset</td><td>An offset to select part of the results. Results 
-    are listed from <code>offset</code>+1. Defaults to zero, i.e. results 
-    are listed from the beginning by default.</td></tr>
-  <tr><td>limit</td><td>Limit for the number of data sets returned.
-    By default it is 10.</td></tr>
-</table>
-
-Possible values for the '<code>order</code>' parameter:
-
-<table>
-  <tr><td>date</td><td>This is the default, newest data sets are
-    first. If two data sets were added on the same day, then the one
-    with the highest id is first. (This is most likely the newer of
-    the two.)</td></tr>
-  <tr><td>name</td><td>Alphabetical ordering, according to data sets
-    name.</td></tr>
-  <tr><td>popularity</td><td>Data sets that were downloaded many times
-    are first.</td></tr>
-</table>
-
-### Examples
-
-We give a couple of example Nexus queries here. You can click on the
-URIs to see the actual response of the Nexus server. Note that some
-browsers tend not to show the actual XML code of the response, in this
-case try saving the response to a file. Please refer to the XML
-schemas below for the exact syntax.
-
-#### List all data sets, XML format
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=xml](http://nexus.igraph.org/api/dataset_info?format=xml)</code>
-
-#### Information about data set #2, XML format
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=xml&id=2](http://nexus.igraph.org/api/dataset_info?format=xml&id=2)</code>
-
-#### List all data sets tagged as '<code>weighted</code>' and '<code>directed</code>', XML format
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=xml&tag=weighted|directed&operator=and](http://nexus.igraph.org/api/dataset_info?format=xml&tag=weighted|directed&operator=and)</code>
-
-#### List all data sets, plain text format, order by popularity
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=text&order=popularity](http://nexus.igraph.org/api/dataset_info?format=text&order=popularity)</code>
-
-#### Information about data set #2, plain text format
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=text&id=2](http://nexus.igraph.org/api/dataset_info?format=text&id=2)</code>
-
-#### List all data sets tagged as '<code>weighted</code>' and '<code>directed</code>', plain text format
-
-<code>[http://nexus.igraph.org/api/dataset_info?format=text&tag=weighted|directed&operator=and](http://nexus.igraph.org/api/dataset_info?format=text&tag=weighted|directed&operator=and)</code>
-
-<a name="dsd"></a>
-## Data set downloads
-
-### Parameters
-
-For downloading a data set, one has to use the '<code>dataset?</code>'
-service. Parameters:
-
-<table>
-  <tr><td>id</td><td>Numeric id of the data set to download. This must
-    be given.</td></tr>
-  <tr><td>format</td><td>The data format. Nexus supports downloads in
-    different formats. For an up to date list, see the
-    '<code>format?</code>' service in the next Section.</td></tr>
-</table>
-
-### Examples
-
-#### Download data set #1 in Excel format
-
-<code>[http://nexus.igraph.org/api/dataset?format=Excel&id=1](http://nexus.igraph.org/api/dataset?format=Excel&id=1)</code>
-
-<a name="searching"></a>
-## Searching Nexus
-
-The Nexus API provides a flexible search interface to facilitate the
-quick finding of interesting data sets.
-
-### Parameters
-
-The search service has the following parameters:
-
-<table>
-  <tr><td>q</td><td>The search query string, see details below.</td></tr>
-  <tr><td>order</td><td>The order of the data sets, possible values
-    are the same as for data set queries.</td></tr>
-  <tr><td>offset</td><td>An offset to select part of the results. Results 
-    are listed from <code>offset</code>+1. Defaults to zero, i.e. results 
-    are listed from the beginning by default.</td></tr>
-  <tr><td>limit</td><td>Limit for the number of data sets returned.
-    By default it is 10.</td></tr>
-</table>
-
-The following rules apply for the search query string:
-
-- All searches are case-insensitive.
-- Nexus search for complete words only, words are separated by
-  non-alphabetical characters in the search string:
-  <p>'<code>social network</code>'</p>
-- The special word 'OR' can be used to find data sets that contain
-  any of the given words:
-  <p>'<code>friendship OR social</code>'</p>
-- By default Nexus search for the given word(s) in the name and 
-  description of the data sets. It is possible to restrict the search 
-  to a given field, by using the name of the field (name,
-  shortdescription or description) as a prefix of the search term, and
-  a separating colon:
-  <p>'<code>name:karate</code>'<p>
-- Negative searches are also possible, one must prefix the search term 
-  with a minus sign, to find data sets that are _not_ related to the
-  search term:
-  <p>'<code>-social</code>'</p>
-- Negative and restricted searches can be combined:
-  <p>'<code>-name:2003 collaboration</code>'</p>
-- Search terms containing white space can be given, by quoting them:
-  <p>'<code>"social network"</code>'</p>
-
-<a name="dformat"></a>
-## Data formats
-
-### Supported formats
-
-See the current list of supported formats [here][8]. Note that not all 
-formats are supported for all data sets, because some formats have 
-limitations. E.g. the 'Excel' data format does not support graphs with more
-than 65,535 edges.
-
-### Parameters
-
-This service returns the data formats supported by Nexus. It has one
-optional parameter:
-
-<table>
-  <tr><td>dataformat</td><td>The data format to query. If this is not
-    given then information is returned about all data formats.</td></tr>
-</table>
-
-### Examples
-
-#### Information about all supported data formats
-
-<code>[http://nexus.igraph.org/api/format?format=xml](http://nexus.igraph.org/api/format?format=xml)</code>
-
-#### Information about a single format, in plain text
-
-<code>[http://nexus.igraph.org/api/format?format=text&dataformat=Excel](http://nexus.igraph.org/api/format?format=text&dataformat=Excel)</code>
-
-<a name="licence"></a>
-## Licences
-
-### List of licences
-
-The actual list of licences can be found [here][9].
-
-### Parameters
-
-This service returns information about the different data set
-licences. It has one optional parameter:
-
-<table>
-  <tr><td>id</td><td>The id of the licence to query. If not given,
-    then all licences are listed.</td></tr>
-</table>
-
-### Examples
-
-#### All licences, plain text format
-
-<code>[http://nexus.igraph.org/api/licence?format=text](http://nexus.igraph.org/api/licence?format=text)</code>
-
-#### A single licence, XML format
-
-<code>[http://nexus.igraph.org/api/licence?format=xml&id=1](http://nexus.igraph.org/api/licence?format=xml&id=1)</code>
-
-<a name="schema"></a>
-## XML schemas
-
-### Basic data set information
-
-Basic data set information, for many data sets. The
-'<code>dataset_info?</code>' service returns this format, if the
-'<code>id</code>' parameter is not given. The schema is [here][2].
-
-### Detailed data set information
- 
-All available information about a single data set, including a long
-description. The '<code>dataset_info?</code>' service returns this
-format, if the '<code>id</code>' parameter is given. The schema is
-[here][3].
-
-### Data formats
-
-The '<code>format?</code>' service returns this format. The schema is
-[here][4].
-
-### Licences
-
-The '<code>licence?</code>' service returns this format. The schema is
-[here][5].
-
-[1]: http://en.wikipedia.org/wiki/Representational_State_Transfer 
-[2]: /static/index_schema.xsl
-[3]: /static/dataset_schema.xsl
-[4]: /static/format_schema.xsl
-[5]: /static/licence_schema.xsl
-[6]: http://en.wikipedia.org/wiki/Atom_(standard)
-[7]: http://en.wikipedia.org/wiki/RSS
-[8]: /api/format
-[9]: /api/licence
-'''
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/nexus.py igraph-0.6.5/nexus/cgi-bin/nexus.py
--- igraph-0.6.5~quantal1/nexus/cgi-bin/nexus.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/nexus.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,1834 +0,0 @@
-#! /bin/env /home/csardi/software/bin/mypython
-# vim:set ts=4 sw=4 sts=4 et
-
-import sys
-sys.path.append("../python")
-
-import web
-import model
-import math
-import random
-import os
-import url_helper
-import odict
-import subprocess
-import markdown
-import igraph
-import xlwt
-import xlrd
-import pickle
-import re
-import tempfile
-import gzip
-import shutil
-import hashlib
-import sqlite3
-
-from datetime import datetime
-from functools import wraps
-from itertools import izip, chain
-from operator import attrgetter
-from recaptcha.client import captcha
-from textwrap import dedent
-
-httpsserver = 'secure1298.hostgator.com'
-httpshome = '/~csardi/nexus'
-
-web.config.debug = False
-web.config.smtp_server = '173.192.111.8'
-web.config.smtp_port = 26
-web.config.smtp_username = 'csardi@mail.igraph.org'
-web.config.smtp_password = \
-    file(os.path.join("..", "config", "emailpass")).read().strip()
-web.config.smtp_starttls = True
-
-formwidth=65
-datadir=os.path.join("..", "data")
-
-urls = (
-    '/?',                                  'About',
-    '/api/dataset_info',                   'Index',
-    '/api/dataset',                        'Dataset',
-    '/api/format',                         'Format',
-    '/api/licence',                        'Licence',
-    '/api/search',                         'Search',
-    '/web/about',                          'About',
-    '/web/addblog',                        'AddBlog',
-    '/web/addlicence',                     'AddLicence',
-    '/web/add',                            'Add',
-    '/web/admin',                          'Admin',
-    '/web/blog',                           'Blog',
-    '/web/checkall2',                      'Check',
-    '/web/checkall',                       'CheckAll',
-    '/web/check/(\d+)',                    'Check',
-    '/web/delete/(\d+)',                   'Delete',
-    '/web/docs',                           'Docs',
-    '/web/donate',                         'Donate',
-    '/web/editblog/(\d+)',                 'EditBlog',
-    '/web/editlicence/(\d+)',              'EditLicence',
-    '/web/edit/(\d+)',                     'Edit',
-    '/web/feedback',                       'Feedback',
-    '/web/recreateall/(.+)',               'RecreateAll',
-    '/web/recreate/(\d+)',                 'Recreate',
-    '/web/updatefilesize',                 'UpdateFilesize',
-    '/web/search',                         'Searchpage',
-    '/web/login',                          'Login',
-    '/web/logout',                         'Logout',
-    '/error/(\d+)',                        'Error',
-    '.*',                                  'Error'
-    )
-
-# reCAPTCHA keys
-recaptcha_pubkey = "6Lfqjb8SAAAAAJyGZQrvqgs7JWjpNp_Vf9dpTMxy"
-
-# Text to be included in the HTML output whenever a reCAPTCHA is needed
-recaptcha_text = """
-<div class="recaptcha">
-<script type="text/javascript">
-   var RecaptchaOptions = {
-      theme : 'white'
-   };
-</script>
-<script type="text/javascript"
-        src="http://www.google.com/recaptcha/api/challenge?k=%s">
-</script>
-<noscript>
-  <iframe src="http://www.google.com/recaptcha/api/noscript?k=%s"
-          height="300" width="500" frameborder="0"></iframe><br>
-  <textarea name="recaptcha_challenge_field" rows="3" cols="40">
-  </textarea>
-  <input type="hidden" name="recaptcha_response_field"
-         value="manual_challenge">
-</noscript>
-</div>
-""" % (recaptcha_pubkey, recaptcha_pubkey)
-
-# List of supported webpage formats
-formats = ('html', 'xml', 'text', 'rss', 'atom')
-
-def unique(seq):
-    # Not order preserving
-    keys = {}
-    for e in seq:
-        keys[e] = 1
-    return keys.keys()
-
-def get_current_url():
-    """Returns the URL of the current page being produced"""
-    return web.ctx.fullpath
-
-def get_whatsnew():
-    """Retrieves the new datasets from the model and renders it."""
-    w=model.whatsnew()
-    return render_plain.whatsnew(w)
-
-def get_datatags():
-    """Retrieves the list of tags and tag counts in the model and renders a
-    nice tag cloud."""
-    tags = [tag for tag in model.datatags()]
-    counts = [tag.count for tag in tags]
-    max_count = max(counts)
-    sizes = [ int(math.log(count+1) / math.log(max_count+1) * 5) for count in counts]
-    for tag, size in izip(tags, sizes):
-        tag.count = size
-    tags.sort(key = attrgetter("tag"))
-    return render_plain.datatags(tags)
-
-def mymarkdown(text, limit=4):
-    if text.count("\n") <= limit:
-        return markdown.markdown(text)
-    else:
-        res="\n".join(text.split("\n")[0:limit])
-        return markdown.markdown(res) + '&hellip;'
-
-def get_motto():
-    tot=model.get_totals()
-    if tot.downloads is not None:
-        return "%s data sets, downloaded %s times" % (tot.count, tot.downloads)
-    return "%s data sets" % tot.count
-
-def get_available_formats(id, sid=None):
-    """Data formats that are available for a given data set"""
-    allf=model.get_formats()
-    fname=model.get_dataset_filename(id)
-    def fileexists(formatrec, filename, sid):
-        if sid is None:
-            ff=os.path.join(datadir, id, filename + formatrec.extension)
-        else:
-            ff=os.path.join(datadir, id, filename + "-" + sid + 
-                            formatrec.extension)
-        if os.path.isfile(ff):
-            return os.path.getsize(ff)
-        else:
-            return 0
-    tests=[ (f, fileexists(f, fname, sid)) for f in allf ]
-    tests=[ f for f in tests if f[1] ]
-    for i in enumerate(tests):
-        tests[i[0]][0].size=tests[i[0]][1]
-    return dict( (f[0].name, f[0]) for f in tests)
-
-def make_link(keys, **extra):
-    def ex(k,v):
-        if k in extra:
-            return (k, extra[k])
-        else:
-            return (k,v)
-    args=[ '%s=%s' % ex(k,v) for k, v in keys.items() if v is not None ]
-    return "?" + "&".join(args)
-
-def getbase():
-    servername = web.ctx.environ['SERVER_NAME']
-    if servername == httpsserver:
-        return httpshome
-    else:
-        return ''
-
-## TODO: what if there are too many pages. Currently not a problem,
-## only if we'll have hundreds of data sets.
-def prevnexttable(nohits, start, end, limit, user_input):
-
-    start=int(start)
-    end=int(end)
-    limit=int(limit)
-
-    prevtext='<span class="prevpage">&lt;&lt;</span>'
-    nexttext='<span class="nextpage">&gt;&gt;</span>'
-
-    if start == 1:
-        prev=prevtext
-    else:
-        prev='<a href="%s">%s</a>' % (make_link(user_input, 
-                                                offset=start-limit-1),
-                                      prevtext)
-
-    if start+limit < nohits:
-        next='<a href="%s">%s</a>' % (make_link(user_input, 
-                                                offset=start+limit-1),
-                                      nexttext)
-    else:
-        next=nexttext
-    
-    if limit==0:
-        pages=0
-        actual=0
-    else:
-        pages=int(math.ceil(float(nohits) / limit))
-        actual=int(math.ceil(float(start) / limit))
-
-    pagelinks=[ '<a href="%s">%s</a>' % (make_link(user_input,
-                                                   offset=n*limit), n+1) 
-                for n in range(pages) ]
-    if actual != 0:
-        pagelinks[actual-1] = '<span class="actualpage">%s</span>' % (actual)
-
-    return prev + " " + " ".join(pagelinks) + " " + next
-
-def makelinks(text):
-    return re.sub(r'(http://[^ \n\t]+)', r'<a href="\1">\1</a>', text)
-
-def redirect_to(location):
-    headers = { 
-        'Content-Type': 'text/html',
-        'Location': location
-        }
-    raise web.HTTPError("303 See Other", headers, "")
-    
-def errorpage():
-    error_url = web.ctx.protocol + '://' + web.ctx.host + \
-        getbase() + '/error/404'
-    redirect_to(error_url)
-
-def redirect_to_main():
-    redirect_to(web.ctx.protocol + '://' + web.ctx.host + getbase())
-
-def check_admin(redirect=True):
-    '''Check if the current user is authenticated and admin.
-    If a redirect is requested, then we redirect to a 404 page.'''
-
-    safe = check_safe(redirect=redirect)
-    if not safe:
-        if redirect:
-            errorpage()
-        else:
-            return False
-    else:
-        if session.loggedin and session.admin:
-            return True
-        else:
-            if redirect:
-                errorpage()
-            else:
-                return False
-
-def check_loggedin():
-    if not check_safe(redirect=False):
-        return False
-    return session.loggedin
-
-def check_safe(redirect=True):
-    '''Check whether we are on HTTPS or connecting locally.
-    If a redirect is requested, then we redirect to a 404 page.'''
-
-    good = web.ctx.protocol == "https" or \
-        web.ctx.environ['REMOTE_ADDR'] == '127.0.0.1'
-    if not good and redirect:
-        errorpage()
-
-    return good
-
-def pretty_size(bytes):
-    if bytes < 10**3:
-        return str(bytes) + ' bytes'
-    elif bytes < 10**6:
-        return str(round(bytes/(10**3.0),1)) + ' Kbytes'
-    elif bytes < 10**9:
-        return str(round(bytes/(10**6.0),1)) + ' Mbytes'
-    else:
-        return str(round(bytes/(10**9.0),1)) + ' Gbytes'
-
-add_form=web.form.Form(
-    web.form.Textbox("sid", description="Id:", id="focused", size=formwidth),
-    web.form.Textbox("name", description="Name:", size=formwidth),
-    web.form.Textarea("shortdescription", description="Short description:",
-                      rows=5, cols=formwidth),
-    web.form.Textarea("description", description="Description:",
-                      rows=10, cols=formwidth),
-    web.form.Textbox("tags", description="Tags:",
-                     post="<br/> (comma separated)", size=formwidth),
-    web.form.Dropdown("licence", description="Licence:", args=[]),
-    web.form.Textbox("source", description="Source:", size=formwidth),
-    web.form.Textarea("papers", description="Publication(s):", 
-                      rows=8, cols=formwidth)
-    )
-
-def add_net_form(no):
-    return web.form.Form(
-        web.form.Textbox("net%ssid" % no, description="Id:", size=formwidth),
-        web.form.Textbox('net%svertices' % no, description='Vertices:', 
-                         size=formwidth),
-        web.form.Textbox('net%sedges' % no, description='Edges:', 
-                         size=formwidth),
-        web.form.Textbox('net%sfilename' % no, description='Filename:', 
-                         size=formwidth),
-        web.form.Checkbox("net%sdirected" % no, description="Directed:", 
-                          value="True"),
-        web.form.Checkbox("net%sweighted" % no, description="Weighted:", 
-                          value="True"),
-        web.form.Checkbox("net%sbipartite" % no, description="Bipartite:", 
-                          value="True"),
-        web.form.Textarea('net%sdescription' % no,  rows=5, cols=formwidth,
-                          description="Short description:"),
-        web.form.Button('Delete network', 
-                        onClick="delNet('%s'); return false;" % no)
-        )
-
-def add_meta_form(no):
-    return web.form.Form(
-        web.form.Textbox("meta%sname" % no, description="Name:", 
-                         size=formwidth),
-        web.form.Dropdown("meta%stype" % no, description="Type:", 
-                          args=['graph', 'vertex', 'edge']),
-        web.form.Dropdown("meta%sdatatype" % no, description="Datatype:",
-                          args=['numeric', 'string', 'logical']),
-        web.form.Textbox("meta%snetwork" % no, description="Network:", 
-                         size=formwidth),
-        web.form.Textarea("meta%sdescription" % no, 
-                          description="Short description:", 
-                          rows=5, cols=formwidth),
-        web.form.Button('Delete attribute',
-                        onClick="delMeta('%s'); return false;" % no)
-        )
-
-tempglob = { 'dataformats': model.get_format_extensions(),
-             'getusername': model.get_username,
-             'currenturl': get_current_url,
-             'get_whatsnew': get_whatsnew,
-             'get_datatags': get_datatags,
-             'get_motto': get_motto,
-             'mymarkdown': mymarkdown,
-             'markdown': markdown.markdown,
-             'type': type,
-             'prevnexttable': prevnexttable,
-             'add_net_form': add_net_form,
-             'add_meta_form': add_meta_form,
-             'check_admin': check_admin,
-             'makelinks': makelinks,
-             'getbase': getbase,
-             'check_safe': check_safe,
-             'check_loggedin': check_loggedin,
-             'pretty_size': pretty_size }
-
-for name in url_helper.__all__:
-    tempglob[name] = getattr(url_helper, name)
-
-render = web.template.render('templates', base='base', globals=tempglob)
-render_plain = web.template.render('templates', globals=tempglob)
-
-class Donate:
-    """Handler class for the "Donate data" page."""
-
-    donate_form=web.form.Form(
-        web.form.Textbox("name", description="Your name:", id="focused"),
-        web.form.Textbox("email", description="Your email address:"),
-        web.form.Textbox("url", description="FTP or Web URL:"),
-        web.form.Checkbox("directed", description="Directed:", 
-                          value="True"),
-        web.form.Checkbox("weighted", description="Weighted:",
-                          value="True"),
-        web.form.Checkbox("bipartite", description="Two-mode:",
-                          value="True"),
-        web.form.Checkbox("dynamic", description="Dynamic:", 
-                          value="True"),
-        web.form.Textbox("tags", description="Tags:"),
-        web.form.Dropdown("licence", description="Licence:", args=[]),
-        web.form.Textarea("description", 
-                          description="Data format description:", 
-                          cols=formwidth, rows=10),
-        web.form.Textarea("papers", description="Publication(s):", 
-                          cols=formwidth, rows=10),
-        web.form.Button("Donate!", pre=recaptcha_text)
-        )
-    
-    def GET(self):
-        form=self.donate_form()
-        lic=model.get_licences('id,name')
-        form.licence.args=[(l.id,  l.name) for l in lic]        
-        return render.donate(form, False, False, False)
-
-    def POST(self):
-        form=self.donate_form()
-        if not form.validates():
-            ## TODO
-            None
-        
-        user_input=web.input()
-        recaptcha_private_key = \
-            file(os.path.join("..", "config", 
-                              "recaptcha_private_key")).read().strip()
-        valid=captcha.submit(user_input.recaptcha_challenge_field,
-                             user_input.recaptcha_response_field,
-                             recaptcha_private_key,
-                             web.ctx.ip)
-
-        if not valid.is_valid:
-            return render.donate(form, True, False, False)
-
-        try:
-            web.sendmail('nexus@igraph.org', 'nexus@igraph.org', 
-                         'Nexus donation', 
-                         'Name:        ' + form.d.name        + '\n'   +
-                         'Email:       ' + form.d.email       + '\n'   +
-                         'URL:         ' + form.d.url         + '\n'   +
-                         'Directed:    ' + str(form.d.directed) + '\n' + 
-                         'Weighted:    ' + str(form.d.weighted) + '\n' +
-                         'Bipartite:   ' + str(form.d.bipartite)+ '\n' + 
-                         'Dynamic:     ' + str(form.d.dynamic)  + '\n' + 
-                         'Tags:        ' + form.d.tags        + '\n'   + 
-                         'Licence:     ' + form.d.licence     + '\n\n' + 
-                         'Description: ' + form.d.description + '\n\n' +
-                         'Publication: ' + form.d.papers      + '\n\n')
-            return render.donate(form, True, True, True)
-        except:
-            return render.donate(form, True, True, False)
-
-class About:
-    """Renders the contents of the About page."""
-
-    def GET(self):
-        return render.about()
-
-class Feedback:
-    """Renders the feedback form."""
-
-    feedback_form = web.form.Form(
-        web.form.Textbox("name", description="Your name (optional):"),
-        web.form.Textbox("email", description="Your email (optional):"), 
-        web.form.Textarea("message", description="Your message:", 
-                          cols=formwidth, rows=10),
-        web.form.Button("Send message", pre=recaptcha_text)
-        )
-
-    def GET(self):
-        form=self.feedback_form()
-        return render.feedback(form)
-
-    def POST(self):
-        form=self.feedback_form()
-        if not form.validates():
-            ## TODO
-            pass
-
-        user_input=web.input()
-        recaptcha_private_key = \
-            file(os.path.join("..", "config",
-                              "recaptcha_private_key")).read().strip()
-        valid=captcha.submit(user_input.recaptcha_challenge_field,
-                             user_input.recaptcha_response_field,
-                             recaptcha_private_key,
-                             web.ctx.ip)
-
-        if not valid.is_valid:
-            return render.feedback_ok(form, False, False)
-
-        try:
-            web.sendmail('nexus@igraph.org', 'nexus@igraph.org', 
-                         'Nexus feedback', 
-                         form.d.message + "\n\nEmail:" + form.d.email)
-            return render.feedback_ok(form, True, True)
-        except Exception, x:
-            return render.feedback_ok(form, True, False)
-
-class Index:
-    """Renders the index page."""
-
-    def list_datasets(self, user_input):
-        format=user_input.format
-
-        datasets, co=list(model.get_list_of_datasets(order=user_input.order,
-                                                    limit=user_input.limit,
-                                                    offset=user_input.offset))
-        ids=[d.id for d in datasets]
-        tags={}
-        for i in ids:
-            tags[i] = list(model.get_tags(i))
-
-        if format=='html':
-            feed=getbase() + '/api/dataset_info?format=atom'
-            return render.index(datasets, tags, "All data sets", feed,
-                                co, int(user_input.offset)+1, 
-                                int(user_input.offset)+len(datasets), 
-                                int(user_input.limit), user_input, None)
-        elif format=='xml':
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_index(datasets, tags,
-                                          len(datasets), co,
-                                          int(user_input.offset),
-                                          int(user_input.limit),
-                                          'All data sets', networks)
-        elif format=='text':
-            for k, t in tags.iteritems():
-                tags[k]=";".join(x.tag for x in t)
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/plain')
-            return render_plain.text_index(datasets, tags,
-                                           len(datasets), co,
-                                           int(user_input.offset),
-                                           int(user_input.limit),
-                                           'All data sets', networks)
-        elif format=='rss':
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/rss+xml')
-            return render_plain.rss_index(datasets, tags, 
-                                          "All data sets", 
-                                          date, web.ctx.homedomain, getbase())
-        elif format=='atom':
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/atom+xml')
-            return render_plain.atom_index(datasets, tags, 
-                                           "All data sets", 
-                                           date, web.ctx.homedomain, 
-                                           getbase())
-
-    def format_text(self, dataset, tags, meta, formats, papers):
-
-        def format_attr(attr):
-            return "attribute: %s %s %s\n  %s" % \
-                (attr.type, attr.datatype, attr.name, attr.description)
-
-        nets=model.get_networks(dataset.id)
-        networks=" ".join([ "%s/%s" % (n.id, n.sid) for n in nets ])
-        vertedges=" ".join([ "%s/%s" % (n.vertices, n.edges) for n in nets ])
-
-        tags=";".join([x.tag for x in tags])
-        papers=[p.citation.replace("\n", "\n  ").strip() for p in papers]
-        papers="\n  ".join(papers)
-        desc=dataset.description.replace("\n\r\n", "\n.\n")
-        desc=desc.replace("\n", "\n  ").strip()
-        main=dedent("""\
-                id: %i
-                sid: %s
-                name: %s
-                networks: %s
-                vertices/edges: %s
-                tags: %s
-                date: %s
-                licence: %s
-                licence url: %s
-                summary: %s
-                description: %s
-                formats: %s
-                citation: %s""") % \
-                (dataset.id, dataset.sid, dataset.name, networks, 
-                 vertedges, tags, dataset.date[0:10],
-                 dataset.licence_name, dataset.licence_url,
-                 dataset.shortdescription.replace("\n", "\n  ").strip(),
-                 desc, ";".join(n+'('+str(v.size)+')' 
-                                for n,v in formats.items()),
-                 papers)
-        meta="\n".join(format_attr(m) for m in meta)
-        if meta != "": meta = "\n" + meta
-        return main + meta
-
-    def dataset(self, user_input):
-        id=user_input.id
-        if not re.match('^[0-9]+$', id):
-            id=model.get_id_from_sid(id)
-
-        if id is None:
-            return web.notfound()
-
-        format=user_input.format
-        dataset=[d for d in model.get_dataset(id)][0]
-        if not dataset:
-            return web.notfound()        
-        tags=list(model.get_tags(id))
-        meta=list(model.get_metadata(id))
-        formats=get_available_formats(id)
-        papers=list(model.get_papers(id))
-        networks=model.get_networks(id)
-
-        if format=='html':
-            return render.dataset(dataset, tags, meta, formats, papers, 
-                                  networks)
-        elif format=='xml':
-            networks=model.get_networks(id)
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_dataset(dataset, tags, meta,
-                                            formats, papers, networks)
-        elif format=='text':
-            formatted=self.format_text(dataset, tags, meta, formats, papers)
-            web.header('Content-Type', 'text/plain')
-            return render_plain.text_dataset(formatted)
-
-    def list_tagged(self, user_input):
-        tagname=user_input.tag.split("|")
-        format=user_input.format
-        if user_input.operator not in ("and", "or"):
-            return web.notfound()
-        datasets, co=list(model.get_list_tagged_as(tagname,
-                                                   user_input.operator, 
-                                                   limit=user_input.limit,
-                                                   offset=user_input.offset))
-        ids=[d.id for d in datasets]
-        tags={}
-        for i in ids:
-            tags[i] = list(model.get_tags(i))
-
-        tagname=["'%s'" % t for t in tagname]
-        tagname=(" " + user_input.operator + " ").join(tagname)
-
-        if format=='html':
-            feed=getbase() + \
-                '/api/dataset_info?format=atom&tag=%s&operator=%s' % \
-                (user_input.tag, user_input.operator)
-            return render.index(datasets, tags, 
-                                "Data sets tagged %s" % tagname, feed,
-                                co, int(user_input.offset)+1, 
-                                int(user_input.offset)+len(datasets),
-                                int(user_input.limit), user_input, None)
-        elif format=='xml':
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_index(datasets, tags, 
-                                          len(datasets), co,
-                                          int(user_input.offset),
-                                          int(user_input.limit),
-                                          "Data sets tagged %s" 
-                                          % tagname, networks)
-        elif format=='text':
-            for k,t in tags.items():
-                tags[k]=";".join([x.tag for x in t])
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/plain')
-            return render_plain.text_index(datasets, tags, 
-                                           len(datasets), co,
-                                           int(user_input.offset),
-                                           int(user_input.limit),
-                                           "Data sets tagged '%s'" 
-                                           % tagname, networks)
-        elif format=="rss":
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/rss+xml')
-            return render_plain.rss_index(datasets, tags, 
-                                          "Nexus data sets tagged %s" 
-                                          % tagname, date,
-                                          web.ctx.homedomain, 'tagged/%s' 
-                                          % tagname)
-        elif format=="atom":
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/atom+xml')
-            return render_plain.atom_index(datasets, tags, 
-                                           "Nexus data sets tagged %s" 
-                                           % tagname, date,
-                                           web.ctx.homedomain, 'tagged/%s' 
-                                           % tagname)        
-
-    def GET(self):
-        user_input=web.input(format="html", id=None, tag=None,
-                             operator="or", order="date", offset=0,
-                             limit=10)
-        if user_input.order not in ('date', 'name', 'popularity'):
-            return web.notfound()
-        if user_input.tag is not None and user_input.id is not None:
-            return web.notfound()
-        if user_input.id is not None:
-            return self.dataset(user_input)
-        elif user_input.tag is not None:
-            return self.list_tagged(user_input)
-        else:
-            return self.list_datasets(user_input)
-
-def support_gzip():
-    if 'HTTP_ACCEPT_ENCODING' not in web.ctx.environ:
-        return False
-    else:
-        enc=web.ctx.environ['HTTP_ACCEPT_ENCODING']
-        encodings = [ e.strip() for e in enc.split(",") ]
-        return 'gzip' in encodings or 'x-gzip' in encodings
-
-class Dataset:
-    
-    def GET(self):
-        user_input=web.input(id=None)
-        format=user_input.format
-
-        if user_input.id is None:
-            return web.notfound()
-        
-        if re.match('^[0-9]+.?[0-9]*$', user_input.id):
-            id=user_input.id.split(".")
-            if len(id)==1:
-                id=id[0]
-                subid=None
-            else:
-                id=id[0]
-                subid=id[1]
-        else:
-            sid=user_input.id.split(".", 1)
-            if len(sid)==1:
-                id=model.get_id_from_sid(sid[0])
-                subid=None
-            else:
-                id=model.get_id_from_sid(sid[0])
-                subid=model.get_netid_from_netsid(sid[1])
-
-        if id is None:
-            return web.notfound()
-
-        datafile=model.get_dataset_filename(id)
-
-        if not datafile:
-            return web.notfound()
-
-        basename=datafile
-        ext=model.get_format_extension(format)
-        filename=os.path.join(datadir, id, basename + ext)
-        web.header('Content-Type', 'application/octet-stream')
-        web.header('Content-Disposition', 
-                   'attachment; filename="%s%s"' % (basename,ext))
-        model.increase_downloads(id)
-        try:
-            f=open(filename)
-            data=f.read()
-            f.close()
-            return data
-        except Exception, x:
-#            print str(x)
-            return web.notfound()
-
-class Format:
-
-    def format_one(self, format):
-        return """Name: %s
-Short description: %s
-Description: %s
-URL: %s""" % (format.name, format.shortdesc, 
-              format.description.replace("\n\r\n", "\n  .\n").strip(),
-              format.link)
-
-    def format_text(self, formats):
-        return "\n\n".join([ self.format_one(f) for f in formats ])
-
-    def GET(self):
-        user_input=web.input(format="html", dataformat=None)
-        format=user_input.format
-        dataformat=user_input.dataformat
-
-        if dataformat:
-            data=[d for d in model.get_format(dataformat)]
-            if not data:
-                return web.notfound()
-        else:
-            data=[d for d in model.get_formats()]
-
-        if format=='html':
-            return render.format(data)
-        elif format=='xml':
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_formats(data)
-        elif format=='text':
-            formatted=self.format_text(data)
-            web.header('Content-Type', 'text/plain')
-            return render_plain.text_formats(formatted)
-
-class Add:
-
-    def GET(self):
-        check_admin()
-        form=add_form()
-        lic=model.get_licences('id,name')
-        form.licence.args=[(l.id,  l.name) for l in lic]
-        return render.add(form, False, False, None)
-    
-    def POST(self):
-        check_admin()
-        form=add_form()
-        input=web.input()
-        form.validates()
-
-        ## TODO: validate
-
-        ## data set
-        did=model.new_dataset(sid=input['sid'], name=input['name'].strip(),
-                              shortdescription=\
-                                  input['shortdescription'].strip(),
-                              description=input['description'].strip(),
-                              licence=int(input['licence']),
-                              source=input['source'].strip(),
-                              date=web.SQLLiteral("CURRENT_DATE"),
-                              downloads=0)
-        
-        ## tags
-        if input['tags']=="":
-            tags=[]
-        else:
-            tags=[t.strip() for t in input['tags'].split(",")]
-
-        ## network(s)
-        netids=[ int(n[3:][:-3]) for n in input.keys() if 
-                 re.match('^net[0-9]+sid$', n) is not None ]
-        for i, no in enumerate(netids):
-            directed=('net%sdirected' % no) in input
-            if directed and 'directed' not in tags:
-                tags.append('directed')
-            if not directed and 'undirected' not in tags:
-                tags.append('undirected')
-            weighted=('net%sweighted' % no) in input
-            if weighted and 'weighted' not in tags:
-                tags.append('weighted')
-            bipartite=('net%sbipartite' % no) in input
-            if bipartite and 'bipartite' not in tags:
-                tags.append('bipartite')
-            model.new_network(dataset=did, id=i+1, 
-                              sid=input['net'+str(no)+'sid'].strip(),
-                              description=\
-                                  input['net'+str(no)+'description'].strip(),
-                              vertices=int(input['net'+str(no)+'vertices']),
-                              edges=int(input['net'+str(no)+'edges']),
-                              filename=input['net'+str(no)+'filename'],
-                              date=web.SQLLiteral("CURRENT_DATE"),
-                              directed=directed, weighted=weighted,
-                              bipartite=bipartite)
-
-        ## citations
-        cits=input['papers'].split("\r\n\r\n")
-        for cit in cits:
-            model.new_citation(dataset=did, citation=cit.strip())
-            
-        ## add the tags
-        for tag in tags:
-            model.new_dataset_tag(dataset=did, tag=tag.strip())
-        
-        ## attributes
-        netnames=[ input['net%ssid' % no] for no in netids ]
-        attrids=[ int(n[4:][:-4]) for n in input.keys() if 
-                  re.match('^meta[0-9]+name$', n) ]
-        for no in attrids:
-            netname=input['meta%snetwork' % no]
-            if netname == "":
-                net=web.db.sqlify(None)
-            else:
-                net=netnames.index(input['meta%snetwork' % no])
-            model.add_meta(id=did, network=net,
-                           type=input['meta%stype' % no],
-                           name=input['meta%sname' % no],
-                           datatype=input['meta%sdatatype' % no],
-                           description=\
-                               input['meta%sdescription' % no].strip())
-
-        return render.add(form, True, False, did)
-
-class Edit:
-    
-    def GET(self, id):
-        check_admin()
-        form=add_form()
-        lic=model.get_licences('id,name')
-        form.licence.args=[(l.id,  l.name) for l in lic]
-        
-        ds=list(model.get_dataset(id))[0]
-        form.fill(ds)
-        papers=[p.citation for p in model.get_papers(id)]
-        form.papers.value="\n\n".join(papers)
-        tags=set(t.tag for t in model.get_tags(id))
-        tags -= set(("weighted", "bipartite", "directed", "undirected"))
-        form.tags.value=", ".join(sorted(tags))
-        
-        nets=model.get_networks(id)
-        def netform(no, net):
-            f=add_net_form(no)()
-            f['net%ssid' % no].set_value(net.sid)
-            f['net%svertices' % no].set_value(net.vertices)
-            f['net%sedges' % no].set_value(net.edges)
-            f['net%sfilename' % no].set_value(net.filename)
-            f['net%sdirected' % no].set_value(net.directed)
-            f['net%sweighted' % no].set_value(net.weighted)
-            f['net%sbipartite' % no].set_value(net.bipartite)
-            f['net%sdescription' %no].set_value(net.description)
-            return f
-        netforms=[ netform(i+1,n) for i,n in enumerate(nets) ]
-
-        meta=model.get_metadata(id)
-        def metaform(no, meta):
-            f=add_meta_form(no)()
-            f['meta%sname' % no].set_value(meta.name)
-            netname=model.get_net_sid_from_id(id, meta.network)
-            f['meta%snetwork' % no].set_value(netname)
-            f['meta%sdescription' % no].set_value(meta.description)
-            f['meta%stype' % no].set_value(meta.type)
-            f['meta%sdatatype' % no].set_value(meta.datatype)
-            return f
-        metaforms=[ metaform(i+1,n) for i,n in enumerate(meta) ]
-
-        return render.add(form, False, True, int(id), netforms, metaforms)
-
-    def POST(self, id):
-        check_admin()
-        form=add_form()
-        input=web.input()
-        form.validates()
-
-        # TODO: validate
-
-        if form.d.tags.strip()=="":
-            tags=[]
-        else:
-            tags=[t.strip() for t in form.d.tags.split(',')]
-
-        oldnets=model.get_networks(id)
-        oldsids=[ o.sid for o in oldnets ]
-        
-        netids=[ int(n[3:][:-3]) for n in input.keys() if 
-                 re.match("^net[0-9]+sid$", n) is not None ]
-        sids=[ input['net%ssid' % no] for no in netids ]
-        for i,no in enumerate(sorted(netids)):
-            directed=('net%sdirected' % no) in input
-            if directed and 'directed' not in tags:
-                tags.append('directed')
-            if not directed and 'undirected' not in tags:
-                tags.append('undirected')
-            weighted=('net%sweighted' % no) in input
-            if weighted and 'weighted' not in tags:
-                tags.append('weighted')
-            bipartite=('net%sbipartite' % no) in input
-            if bipartite and 'bipartite' not in tags:
-                tags.append('bipartite')
-            
-            sid=input['net%ssid' % no]
-            if sid in oldsids:
-                model.update_network(dataset=id, 
-                                     id=model.get_net_id_from_sid(id, sid),
-                                     description=input['net%sdescription' % no],
-                                     vertices=input['net%svertices' % no],
-                                     edges=input['net%sedges' % no],
-                                     filename=input['net%sfilename' % no],
-                                     directed=directed,
-                                     bipartite=bipartite,
-                                     weighted=weighted)
-            else:
-                model.new_network(dataset=id, sid=sid,
-                                  id=model.get_net_id_from_sid(id, sid),
-                                  description=input['net%sdescription' % no],
-                                  vertices=input['net%svertices' % no],
-                                  edges=input['net%sedges' % no],
-                                  filename=input['net%sfilename' % no],
-                                  directed=directed,
-                                  bipartite=bipartite,
-                                  weighted=weighted)
-
-        for s in set(oldsids)-set(sids):
-            model.delete_network(dataset=id, 
-                                 id=model.get_net_id_from_sid(id, s))
-
-        papers=[p.strip() for p in form.d.papers.split("\r\n\r\n")]
-
-        model.update_dataset(id=id, sid=form.d.sid, name=form.d.name, 
-                             shortdescription=form.d.shortdescription,
-                             description=form.d.description,
-                             licence=form.d.licence, 
-                             source=form.d.source,
-                             papers=papers)
-
-        model.delete_tags(id)
-        for t in tags:
-            model.new_dataset_tag(dataset=id, tag=t)
-
-        ## Metadata
-        oldmeta = model.get_metadata(id)
-        for m in oldmeta:
-            model.delete_meta(id, m.type, m.name)
-
-        netnames=[ input['net%ssid' % no] for no in netids ]
-        attrids=[ int(n[4:][:-4]) for n in input.keys() if 
-                  re.match('^meta[0-9]+name$', n) ]
-        for no in attrids:
-            netname=input['meta%snetwork' % no]
-            if netname == "":
-                net=web.db.sqlify(None)
-            else:
-                net=netnames.index(input['meta%snetwork' % no])
-            model.add_meta(id=id, network=net,
-                           type=input['meta%stype' % no],
-                           name=input['meta%sname' % no],
-                           datatype=input['meta%sdatatype' % no],
-                           description=\
-                               input['meta%sdescription' % no].strip())
-
-        return render.add(form, True, True, int(id))
-
-add_licence_form=web.form.Form(
-    web.form.Textbox("name", description="Name:", id="focused", size=formwidth),
-    web.form.Textarea("text", description="Text:", cols=formwidth, rows=2),
-    web.form.Textarea("fulltext", description="Full text:", cols=formwidth, 
-                      rows=10),
-    web.form.Textbox("link", description="URL:", size=formwidth),
-    web.form.Button("Add")
-    )
-
-class AddLicence:
-    
-    def GET(self):
-        check_admin()
-        form=add_licence_form()
-        return render.addlicence(form, False, False, False)
-
-    def POST(self):
-        check_admin()
-        form=add_licence_form()
-        if not form.validates():
-            # TODO
-            None
-            
-        lid=model.new_licence(name=form.d.name, text=form.d.text, 
-                              fulltext=form.d.fulltext, link=form.d.link)
-
-        return render.addlicence(form, True, False, lid)
-
-class EditLicence:
-    def GET(self, id):
-        check_admin()
-        form=add_licence_form()
-        form.Add.name='Submit'
-        lic=model.get_licence(id)
-        lic=list(lic)[0]
-        form.fill(lic)
-        return render.addlicence(form, False, False, False)
-
-    def POST(self, id):
-        check_admin()        
-        form=add_licence_form()
-        if not form.validates():
-            ## TODO
-            pass
-
-        model.update_licence(id=id, name=form.d.name, text=form.d.text,
-                             fulltext=form.d.fulltext, link=form.d.link)
-
-        return render.addlicence(form, True, True, int(id))
-
-class Admin:
-    def GET(self):
-        check_admin()
-        return render.admin()
-
-def run_r(cmd):
-    Rscript=file(os.path.join("..", "config", "Rscript")).read().strip()
-    args=[Rscript, "-e", cmd]
-    p=subprocess.Popen(args, stdout=subprocess.PIPE)
-    ret=p.wait()
-    out=p.stdout.read()
-    return [ret, out]
-
-def tmpungzip(filename):
-    tmp=tempfile.NamedTemporaryFile(delete=False)
-    tmpname=tmp.name
-    tmp.close()
-    os.system('gzip -cd %s > %s' % (filename, tmpname))
-    return tmpname    
-
-class Check:
-
-    def check_r_igraph(self, ds, networks, filename, tags, meta):
-        res=odict.odict()
-
-        tagstr=";".join(t.tag for t in tags)
-        netnames=";".join(n.sid for n in networks)
-        netno=";".join(str(n.id) for n in networks)
-        metastr=";;".join("%s;%s;%s" % (m.type, m.name, m.network) 
-                          for m in meta)
-
-        rcode=dedent('source("../scripts/rutils.R") ; \
-                      r.check("%s","%s","%s","%s","%s") ; \
-                     ') % (filename, tagstr, netnames, netno, metastr)
-        ret, out=run_r(rcode)
-        out=[ o.split(":", 1) for o in out.strip().split("\n") ]
-        for k,v in out:
-            if v=='TRUE':
-                res[k]=True
-            else:
-                res[k]=v
-        v=";".join(str(n.vertices) for n in networks)
-        e=";".join(str(n.edges) for n in networks)
-        res['Vertices'] = (res['Vertices'] == v)
-        res['Edges'] = (res['Edges'] == e)
-
-        return res
-
-    def _check_igraph_graph(self, g, ds, networks, filename, tags, meta):
-        res = odict.odict()
-
-        ## Number of vertices and edges
-        res['Number of vertices'] = all([ g[n.sid].vcount() == n.vertices
-                                          for n in networks ])
-        res['Number of edges'] = [ g[n.sid].ecount() == n.edges
-                                   for n in networks ]
-        
-        vattr=dict( (i, j.vs.attribute_names()) for i, j in g.items() )
-        eattr=dict( (i, j.es.attribute_names()) for i, j in g.items() )
-
-        print vattr
-        print eattr
-
-        ## Tags 
-        tags=[t.tag for t in tags]
-        if 'directed' in tags:
-            res['Tags, directed'] = any(i.is_directed() for i in g.values())
-        if 'undirected' in tags:
-            res['Tags, undirected'] = any([ not i.is_directed()
-                                            for i in g.values()])
-        if 'weighted' in tags:
-            res['Tags, weighted'] = any(['weight' in e 
-                                         for e in eattr.values()])
-        if 'bipartite' in tags:
-            res['Tags, bipartite'] = any(['type' in v 
-                                          for v in vattr.values()])
-
-        ## Metadata
-        nets=dict( (n.id, n) for n in networks )
-        for m in meta:
-            if m.type == "vertex":
-                att=vattr
-            elif m.type == "edge":
-                att=eattr
-            if m.network=="NULL":
-                res["Metadata, %s, '%s'" % (m.type, m.name)] = \
-                    all(m.name in a for a in att.values())
-            else:
-                res["Metadata, %s, '%s'" % (m.type, m.name)] = \
-                    m.name in att[nets[m.network].sid]
-
-        return res
-
-    def check_python_igraph(self, ds, networks, filename, tags, meta):
-        res=odict.odict()
-        
-        ## File exists
-        ex=os.path.exists(filename)
-        res['Data file exists'] = ex
-        if not ex:
-            return res
-
-        ## File can be loaded
-        try:
-            g=pickle.load(gzip.GzipFile(filename))
-            res['Data file can be loaded'] = True
-        except Exception, x:
-#            print str(x)
-            res['Data file can be loaded'] = False
-            return res
-
-        res.update(self._check_igraph_graph(g, ds, networks, filename, 
-                                            tags, meta))
-        return res
-
-    def check_graphml(self, ds, networks, filename, tags, meta):
-        res=odict.odict()
-
-        ## File exists
-        ex=os.path.exists(filename)
-        res['Data file exists'] = ex
-        if not ex:
-            return res
-
-        ## File can be loaded
-        try:
-            tmp=os.path.join(tempfile.gettempdir(), "nexus")
-            shutil.rmtree(tmp, ignore_errors=True)
-            os.mkdir(tmp)
-            os.system("unzip -d %s %s" % (tmp, filename))
-            g=dict((n.sid, igraph.Graph.Read_GraphML('%s/%s.GraphML' % 
-                                                     (tmp, n.sid)))
-                   for n in networks)
-            res['Data file can be loaded'] = True
-            shutil.rmtree(tmp)
-        except Exception, x:
-            print str(x)
-            res['Data file can be loaded'] = False
-            return res
-
-        res.update(self._check_igraph_graph(g, ds, networks, filename, 
-                                            tags, meta))
-        return res
-
-    def check_pajek(self, ds, networks, filename, tags, meta):
-        res=odict.odict()
-
-        ## File exists
-        ex=os.path.exists(filename)
-        res['Data file exists'] = ex
-        if not ex:
-            return res
-
-        ## File can be loaded
-        try:
-            f=tmpungzip(filename)
-            g=igraph.Graph.Read_Pajek(f)
-            res['Data file can be loaded'] = True
-            os.unlink(f)
-        except Exception, x:
-#            print str(x)
-            res['Data file can be loaded'] = False
-            return res
-
-        res.update(self._check_igraph_graph(g, ds, networks, filename, 
-                                            tags, meta))
-        return res
-
-    def check_excel(self, ds, networks, filename, tags, meta):
-        res=odict.odict()
-
-        ## File exists
-        ex=os.path.exists(filename)
-        res['Data file exists'] = ex
-        if not ex:
-            return res
-
-        ## File can be loaded
-        try:
-            f=tmpungzip(filename)
-            wb=xlrd.open_workbook(f)
-            res['Data file can be loaded'] = True
-            os.unlink(f)
-        except Exception, x:
-            res['Data file can be loaded'] = False
-            return res
-
-        ## Number of sheets
-        res['Number of sheets'] = wb.nsheets in (2,3)        
-
-        ## Sheet names
-        shnames=wb.sheet_names()        
-        res['Sheet names'] = shnames[0] == 'Network' and \
-            shnames[1] == 'Edges' and shnames[2] == 'Vertices'
-
-        ## Number of vertices and edges
-        sh1=wb.sheet_by_index(0)
-        res['Number of vertices'] = int(sh1.cell_value(1,1)) == ds.minv
-        res['Number of edges'] = int(sh1.cell_value(2,1)) == ds.mine
-
-        ## Tags
-        mytags=sh1.row(4)[1:]
-        mytags=[ t.value for t in mytags ]
-        tags=[ t.tag for t in tags ]
-        res['Tags'] = len(set(mytags) & set(tags)) == len(mytags)
-
-        ## Metadata
-        sh2=wb.sheet_by_index(1)
-        eattr=[ c.value for c in sh2.row(0)[2:] ]
-        if wb.nsheets == 3: 
-            sh3=wb.sheet_by_index(2)
-            vattr=[ c.value for c in sh3.row(0) ]
-        else:
-            vattr=[]
-        for m in meta:
-            if m.type == "vertex":
-                res["Metadata, vertex, '%s'" % m.name] = m.name in vattr
-            elif m.type == "edge":
-                res["Metadata, edge, '%s'" % m.name] = m.name in eattr
-
-        return res
-
-    def check(self, ds, networks, format, tags, meta, filename):
-        if format=="R-igraph":
-            return self.check_r_igraph(ds, networks, filename, tags, meta)
-        elif format=="GraphML":
-            return self.check_graphml(ds, networks, filename, tags, meta)
-        elif format=="Pajek":
-            return self.check_pajek(ds, networks, filename, tags, meta)
-        elif format=="Excel":
-            return self.check_excel(ds, networks, filename, tags, meta)
-        elif format=="Python-igraph":
-            return self.check_python_igraph(ds, networks, filename, 
-                                            tags, meta)
-        return None
-
-    def check_all_formats(self, id):
-        ds=list(model.get_dataset(int(id)))[0]
-        checkres=odict.odict()
-        networks=model.get_networks(ds.id)
-        tags=list(model.get_tags(ds.id))
-        meta=list(model.get_metadata(ds.id))
-        for k,v in model.get_format_extensions().items():
-            try: 
-                if k in ('R-igraph', 'GraphML', 'Python-igraph'):
-                    checkres[k] = self.check(ds, networks, k, tags, meta,
-                                             os.path.join("..", "data",
-                                                          str(id), 
-                                                          ds.sid + v))
-            except Exception, x:
-                checkres[k] = { "Cannot run check": str(x) }
-
-        return checkres
-
-    def GET(self, id=None):
-        check_admin()
-
-        if id is None:
-            ids=model.get_dataset_ids()
-            web.header('Content-type','text/html')
-            web.header('Transfer-Encoding','chunked')
-            yield ('<html><head><title>Checking datasets...</title>' +
-                   '<link rel="stylesheet" href="' + getbase() + \
-                       '/static/general.css"' + \
-                       'type="text/css"/>' + 
-                   '<link rel="icon" type="image/png" href="' + \
-                       getbase() + '/static/nexus_logo_black_small.png" />' +
-                   '</head><body>')
-            for id in ids:
-                ds=list(model.get_dataset(id.id))[0]
-                yield render_plain.check(id.id, ds,
-                                         self.check_all_formats(id.id))
-            yield '<h1>Done</h1></body></html>'
-        else:
-            ds=list(model.get_dataset(id))[0]
-            yield render.check(id, ds, self.check_all_formats(id))
-
-class CheckAll:
-
-    def GET(self):
-        check_admin()
-        return render.checkall()
-
-class Licence:
-
-    def format_text(self, licences):
-        
-        def format_one(lic):
-            return dedent('''\
-                     Id: %s
-                     Name: %s
-                     Short Description: %s
-                     URL: %s''' % (lic.id, lic.name, lic.text, lic.link))
-        
-        return "\n".join(format_one(l) for l in licences)
-
-    def GET(self):
-        user_input=web.input(id=None, format="html")
-        format=user_input.format
-
-        if user_input.id is None:
-            lic=model.get_licences("*")
-        else:
-            lic=model.get_licence(user_input.id)
-        
-        if format=='html':
-            return render.licence(lic)
-        elif format=='xml':
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_licence(lic)
-        elif format=='text':
-            web.header('Content-Type', 'text/plain')
-            return self.format_text(lic)
-
-class Blog:
-    
-    def GET(self):
-        user_input=web.input(id=None, admin=False)
-        unpublished = check_admin()
-        if user_input.id is None:
-            entries=model.get_blog(unpublished=unpublished)
-        else:
-            entries=model.get_blog(ids=[user_input.id], 
-                                   unpublished=unpublished)
-        return render.blog(entries, user_input.id)
-
-add_blog_form=web.form.Form(
-    web.form.Textbox('title', description='Title:', id='focused', size=formwidth),
-    web.form.Textbox('date', description='Date:', size=formwidth),
-    web.form.Textarea('entry', description='Text:', rows=20, cols=formwidth),
-    web.form.Checkbox('published', description="Published?", value="True"),
-    web.form.Button("Add")
-    )
-
-class AddBlog:
-    
-    def GET(self):
-        check_admin()
-        form=add_blog_form()
-        return render.addblog(form, None, added=False, edit=False)
-
-    def POST(self):
-        check_admin()
-        form=add_blog_form()
-        if not form.validates():
-            pass
-        
-        bid=model.new_blog_entry(title=form.d.title, 
-                                 date=form.d.date,
-                                 entry=form.d.entry,
-                                 published=form.d.published)
-        
-        return render.addblog(form, bid, added=True, edit=False)
-
-class EditBlog:
-    
-    def GET(self, id):
-        check_admin()
-        form=add_blog_form()        
-        form.Add.name='Submit'
-        blog=model.get_blog(ids=[id], unpublished=True)
-        form.fill(blog[0])
-        return render.addblog(form, id, added=False, edit=True)
-
-    def POST(self, id):
-        check_admin()
-        form=add_blog_form()
-        if not form.validates():
-            # TODO
-            pass
-        
-        model.update_blog(id=id, title=form.d.title, date=form.d.date,
-                          entry=form.d.entry, published=form.d.published)
-        
-        return render.addblog(form, id, added=True, edit=True)
-
-class Docs:
-    
-    def GET(self):
-        import docs
-        cc=markdown.markdown(docs.docs)
-        return render.docs(cc)
-
-class Delete:
-
-    def GET(self, id):
-        check_admin()
-        model.delete_dataset(int(id))
-        return render.delete()
-
-def ungzip(filename):
-    os.system('gzip -dc %s > %s' % (filename, filename))
-
-def gzipout(filename):
-    os.system('gzip -f %s' % filename)
-
-class RecreateBase:
-
-    def r_to_graphml(self, id):
-        nets=model.get_networks(id)
-        rext=model.get_format_extension('R-igraph')
-        outext=model.get_format_extension('GraphML')
-        inputfile = model.get_dataset_filename(id)
-        inputfile = os.path.join("..", "data", id, 
-                                 os.path.basename(inputfile))
-        rcode = dedent('source("../scripts/rutils.R") ; \
-                        r.to.graphml("%s%s", "%s%s") ; \
-                  ') % (inputfile, rext, inputfile, outext)
-        ret, out=run_r(rcode)
-
-    def r_to_pajek(self, id):
-        rext=model.get_format_extension('R-igraph')
-        outext=model.get_format_extension('Pajek')
-        inputfile = model.get_dataset_filename(id)
-        inputfile = os.path.join("..", "data", id, 
-                                 os.path.basename(inputfile))
-        rcode = dedent('source("../scripts/rutils.R") ; \
-                        r.to.pajek("%s%s", "%s%s") ; \
-                  ') % (inputfile, rext, inputfile, outext)
-        ret, out=run_r(rcode)
-                           
-    def graphml_to_excel(self, id):
-        return
-        nets=model.get_networks(id)
-        if len(nets) > 1:
-            return              # TODO
-        if nets[0].vertices >= 65536 or nets[0].edges >= 65536:
-            return
-        inputfile = model.get_dataset_filename(id)
-        inputfile = os.path.join("..", "data", id, 
-                                 os.path.basename(inputfile))
-        graphmlext=model.get_format_extension('GraphML')
-        excelext=model.get_format_extension('Excel')
-        ungzip('%s%s' % (inputfile, graphmlext))
-        g=igraph.Graph.Read_GraphML(inputfile + graphmlext)
-        os.unlink('%s%s' % (inputfile, graphmlext))
-
-        ds=list(model.get_dataset(id))[0]
-        
-        wb=xlwt.Workbook()
-
-        ## The network
-        tags=list(model.get_tags(id))
-        papers=list(model.get_papers(id))
-        sh1=wb.add_sheet('Network')
-        sh1.write(0, 0, 'Name')
-        sh1.write(0, 1, ds.name)
-        sh1.write(1, 0, 'Vertices')
-        sh1.write(1, 1, ds.minv)
-        sh1.write(2, 0, 'Edges')
-        sh1.write(2, 1, ds.mine)
-        sh1.write(3, 0, 'Type')
-        if 'directed' in tags:
-            sh1.write(3, 1, 'directed')
-        else:
-            sh1.write(3, 1, 'undirected')
-        sh1.write(4, 0, 'Tags')
-        for n, t in enumerate(tags):
-            sh1.write(4, n+1, t.tag)
-        sh1.write(5, 0, 'Licence')
-        sh1.write(5, 1, ds.licence_name)
-        sh1.write(6, 0, 'Licence URL')
-        sh1.write(6, 1, ds.licence_url)
-        sh1.write(7, 0, 'Short description')
-        sh1.write(7, 1, ds.shortdescription)
-        sh1.write(8, 0, 'Description')
-        sh1.write(8, 1, ds.description)
-        for n, p in enumerate(papers):
-            sh1.write(9+n, 0, 'Paper')
-            sh1.write(9+n, 1, p.citation)
-
-        ## The edges
-        el=g.get_edgelist()
-        if 'name' in g.vs.attribute_names():
-            n=g.vs['name']
-            el=[ (n[e[0]], n[e[1]]) for e in el]
-        sh2=wb.add_sheet('Edges')
-        sh2.write(0, 0, 'From')
-        sh2.write(0, 1, 'To')
-        for n, e in enumerate(el):
-            sh2.write(n+1, 0, e[0])
-            sh2.write(n+1, 1, e[1])
-
-        ## Edge attributes
-        ea=g.es.attribute_names()
-        for n, attr in enumerate(ea):
-            sh2.write(0, n+2, attr)
-            for r, v in enumerate(g.es[attr]):
-                sh2.write(r+1, n+2, v)
-
-        ## Vertex attributes
-        va=g.vs.attribute_names()
-        if len(va) != 0:
-            sh3=wb.add_sheet('Vertices')
-            for n, attr in enumerate(va):
-                sh3.write(0, n, attr)
-                for r, v in enumerate(g.vs[attr]):
-                    sh3.write(r+1, n, v)
-            
-        outputfile=inputfile + excelext
-        wb.save(outputfile)
-        
-        
-    def graphml_to_pickle(self, id):
-        nets=model.get_networks(id)
-        basename = model.get_dataset_filename(id)
-        basename = os.path.join("..", "data", id, 
-                                os.path.basename(basename))
-        graphmlext=model.get_format_extension('GraphML')
-        outext = model.get_format_extension('Python-igraph')        
-        inputfile = basename + graphmlext
-        outputfile = basename + outext[:-3]
-
-        tmp=os.path.join(tempfile.gettempdir(), "nexus")
-        shutil.rmtree(tmp, ignore_errors=True)
-        os.mkdir(tmp)
-        os.system("unzip -d %s %s" % (tmp, inputfile))
-        graphs=dict((n.sid, igraph.Graph.Read_GraphML('%s/%s.GraphML'
-                                                      % (tmp, n.sid)))
-                    for n in nets)
-        pickle.dump(graphs, open(outputfile, "w"), protocol=-1)
-        shutil.rmtree(tmp)
-        gzipout(outputfile)
-
-class Recreate(RecreateBase):    
-
-    def GET(self, id=None):
-        check_admin()
-        self.r_to_graphml(id)
-        self.r_to_pajek(id)
-        self.graphml_to_excel(id)
-        self.graphml_to_pickle(id)
-        return render.recreate(id)    
-
-class RecreateAll(RecreateBase):
-    
-    def GET(self, format):
-        check_admin()
-        web.header('Content-type','text/html')
-        web.header('Transfer-Encoding','chunked')
-        if format[0]!='!':
-            yield render.recreateall(format)
-        
-        format=format[1:]
-        ids=model.get_dataset_ids()
-        format=format.lower()
-
-        def to_excel(id):
-            self.r_to_graphml(id)
-            self.graphml_to_excel(id)
-
-        def to_pickle(id):
-            self.r_to_graphml(id)
-            self.graphml_to_pickle(id)
-            
-        def to_r(id):
-            pass
-
-        funcs= { 'graphml': self.r_to_graphml, 
-                 'pajek': self.r_to_pajek, 
-                 'excel': to_excel,
-                 'python-igraph': to_pickle,
-                 'r-igraph': to_r }
-        for id in ids:
-            funcs[format](str(id.id))
-            ds=list(model.get_dataset(id.id))[0]
-            yield render_plain.recreate(id.id, "'" + ds.name + "'")
-
-def update_filesize(id):
-    formats=model.get_formats()
-    basename=model.get_dataset_filename(id)
-    for f in formats:
-        ext=f.extension
-        filename=os.path.join(datadir, str(id), basename + ext)
-        try:
-            size=os.path.getsize(filename)
-            model.update_filesize(id, f.name, size)
-        except:
-            pass
-    return True
-
-
-class UpdateFilesize:    
-
-    def GET(self, which=None):
-        check_admin()
-        ids=model.get_dataset_ids()
-        st=[ str(id.id) + ' ' + str(update_filesize(id.id)) + '\n' 
-             for id in ids ]
-        return render.common('File sizes updated.\n' + str(st))
-
-def flatten(iterables):
-    return (elem for iterable in iterables for elem in iterable)
-
-class search_clause:
-    def __init__(key, field, neg):
-        self.key=key
-        self.field=field
-        self.neg=neg
-
-def parse_query(qstr):
-
-    ## Tokenize search string
-    state={ 'pos': 0, 'inquote': False, 'current': '', 
-            'infield': False, 'tokens': [] }    
-    while state['pos'] < len(qstr):
-        c=qstr[state['pos']]
-        if c=='"' and not state['inquote']:
-            state['inquote'] = True
-            state['current'] = ''
-        elif c=='"' and state['inquote']:
-            state['inquote'] = False
-            state['tokens'].append(state['current'])
-            state['current'] = ''
-        elif c=='-' and state['current']=='':
-            state['tokens'].append(u'-')
-        elif c==' ' and not state['inquote'] and state['current'] != '':
-            state['tokens'].append(state['current'])
-            state['current'] = ''
-        elif c==' ' and state['current'] == '':
-            pass
-        elif c==':' and state['current'] != '':
-            state['tokens'].append(state['current'] + ':')
-            state['current'] = ''            
-        elif c==':' and state['currnet'] == '':
-            pass
-        else:
-            state['current'] += c
-
-        state['pos'] += 1
-        
-    if state['current'] != '':
-        state['tokens'].append(state['current'])
-
-    ## Split search expression at 'OR' keywords
-    OR=[ n for n,v in enumerate(state['tokens']) if v.lower() == 'or' ]
-    tokens=[]
-    for s, e in izip([-1]+OR, OR+[len(state['tokens'])]):
-        tokens.append(state['tokens'][s+1:e])
-
-    return tokens
-
-class Search:
-    
-    def GET(self):
-        user_input=web.input(q="", order="date", format='html',
-                             offset=0, limit=10)
-        q=parse_query(user_input.q)
-        ids=unique(reduce(lambda a,b: a+b, 
-                          [model.do_search_query(t) for t in q]))
-
-        ds, co=model.get_list_of_datasets(ids=ids, 
-                                          order=user_input.order,
-                                          limit=user_input.limit,
-                                          offset=user_input.offset)
-        tags={}
-        for i in ids:
-            tags[i] = list(model.get_tags(i))
-
-        title="Nexus search results for '%s'" % user_input.q
-        if user_input.format=='html':
-            title="Nexus search results for '<code>%s</code>'" % user_input.q
-            feed=getbase() + '/api/search?q=%s&format=atom' % user_input.q
-            return render.index(ds, tags, title, feed,
-                                co, int(user_input.offset)+1, 
-                                int(user_input.offset)+len(ds),
-                                int(user_input.limit), user_input, 
-                                user_input.q)
-        elif user_input.format=='xml':
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/xml')
-            return render_plain.xml_index(ds, tags, len(ds), co, 
-                                          int(user_input.offset),
-                                          int(user_input.limit),
-                                          title, networks)
-        elif user_input.format=='text':
-            for k, t in tags.iteritems():
-                tags[k]=";".join(x.tag for x in t)
-            networks={}
-            for i in ids:
-                networks[i] = model.get_networks(i)
-            web.header('Content-Type', 'text/plain')
-            return render_plain.text_index(ds, tags,
-                                           len(ds), co,
-                                           int(user_input.offset),
-                                           int(user_input.limit),
-                                           title, networks)
-        elif user_input.format=='rss':
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/rss+xml')
-            return render_plain.rss_index(ds, tags, title,
-                                          date, web.ctx.homedomain, '')
-        elif user_input.format=='atom':
-            date=datetime.today().strftime("%a, %d %b %Y %H:%M:%S +0200")
-            web.header('Content-Type', 'application/atom+xml')
-            return render_plain.atom_index(ds, tags, title,
-                                           date, web.ctx.homedomain, '')
-
-class Searchpage:
-    
-    def GET(self):
-        pass
-
-class Login:
-    """Login form"""
-    
-    login_form = web.form.Form(
-        web.form.Textbox("user", description="Username"),
-        web.form.Password("passw", description="Password"),
-        web.form.Button("Login")
-        )
-
-    def GET(self):
-        check_safe()
-        form=self.login_form()
-        return render.login(form)
-    
-    def POST(self):
-        check_safe()
-        form=self.login_form()
-        if not form.validates():
-            # TODO
-            pass
-
-        user_input=web.input()
-        authdb=sqlite3.connect("../db/users.db")
-        pwdhash=hashlib.md5(user_input.passw).hexdigest()
-        cur=authdb.execute('''select * from users where 
-                              username=? and password=?''', 
-                           (user_input.user, pwdhash))
-        check=cur.fetchone()
-        if check is not None:
-            session.loggedin = True
-            session.username = user_input.user
-            session.admin = check[2] == 1
-            print(session)
-            redirect_to_main()
-        else:
-            return render.login(form)
-
-class Logout:
-    
-    def GET(self):
-        session.kill()
-        redirect_to_main()
-
-class Error:
-    """HTTP errors"""
-    
-    def GET(self, code=404):
-        return render.error(code)
-
-app = web.application(urls, globals())
-
-web.config.session_parameters['cookie_name'] = 'nexus_igraph_org'
-web.config.session_parameters['cookie_domain'] = None
-web.config.session_parameters['timeout'] = 20*86400,
-web.config.session_parameters['ignore_expiry'] = False
-web.config.session_parameters['ignore_change_ip'] = True
-web.config.session_parameters['secret_key'] = '2bdbc71869ec0f268d6be1e'
-web.config.session_parameters['expired_message'] = 'Session expired'
-
-session_db = web.database(dbn="sqlite", db="../db/users.db")
-store = web.session.DBStore(session_db, 'session')
-session = web.session.Session(app, store, 
-                              initializer={'loggedin': False, 
-                                           'username': None,
-                                           'admin': False })
-
-if __name__ == '__main__':
-    try:
-        app.run()
-    except Exception, x:
-        web.header('Content-Type', 'text/plain')
-        print str(x)
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/dataset_schema.xsl igraph-0.6.5/nexus/cgi-bin/static/dataset_schema.xsl
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/dataset_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/dataset_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, dataset information
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="dataset" type="datasetType"/>
-
-  <xsd:complexType name="datasetType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="networks" type="networksType" />
-      <xsd:element name="tags" type="tagsType" minOccurs="0" />
-      <xsd:element name="attributes" type="attributesType" />
-      <xsd:element name="date" type="xsd:date" />
-      <xsd:element name="licence" type="xsd:string" />
-      <xsd:element name="licenceurl" type="xsd:anyURI" />
-      <xsd:element name="papers" type="papersType" />
-      <xsd:element name="formats" type="formatsType" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networksType">
-    <xsd:sequence>
-      <xsd:element name="network" type="networkType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networkType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="vertices" type="xsd:nonNegativeInteger" />
-      <xsd:element name="edges" type="xsd:nonNegativeInteger" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="tagsType">
-    <xsd:sequence>
-      <xsd:element name="tag" type="xsd:string" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="attributesType">
-    <xsd:sequence>
-      <xsd:element name="attribute" type="attributeType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="attributeType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="type" type="xsd:string" />
-      <xsd:element name="datatype" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="papersType">
-    <xsd:sequence>
-      <xsd:element name="paper" type="xsd:string" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>  
-
-  <xsd:complexType name="formatsType">
-    <xsd:sequence>
-      <xsd:element name="format" type="formatType" minOccurs="0"
-	maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>  
-
-  <xsd:complexType name="formatType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" minOccurs="0"
-		   maxOccurs="unbounded" />
-      <xsd:element name="size" type="xsd:nonNegativeInteger" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/format_schema.xsl igraph-0.6.5/nexus/cgi-bin/static/format_schema.xsl
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/format_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/format_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,29 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, data format(s)
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="dataformats" type="dataformatsType" />
-  
-  <xsd:complexType name="dataformatsType">
-    <xsd:sequence>
-      <xsd:element name="dataformat" type="dataformatType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-  <xsd:complexType name="dataformatType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="url" type="xsd:anyURI" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/general.css igraph-0.6.5/nexus/cgi-bin/static/general.css
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/general.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/general.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,1575 +0,0 @@
-/*
-Theme Name: Twenty Ten
-Theme URI: http://wordpress.org/
-Description: The 2010 theme for WordPress is stylish, customizable, simple, and readable -- make it yours with a custom menu, header image, and background. Twenty Ten supports six widgetized areas (two in the sidebar, four in the footer) and featured images (thumbnails for gallery posts and custom header images for posts and pages). It includes stylesheets for print and the admin Visual Editor, special styles for posts in the "Asides" and "Gallery" categories, and has an optional one-column page template that removes the sidebar.
-Author: the WordPress team
-Version: 1.1
-Tags: black, blue, white, two-columns, fixed-width, custom-header, custom-background, threaded-comments, sticky-post, translation-ready, microformats, rtl-language-support, editor-style
-*/
-
-
-/* =Reset default browser CSS. Based on work by Eric Meyer: http://meyerweb.com/eric/tools/css/reset/index.html
--------------------------------------------------------------- */
-
-html, body, div, span, applet, object, iframe,
-h1, h2, h3, h4, h5, h6, p, blockquote, pre,
-a, abbr, acronym, address, big, cite, code,
-del, dfn, em, font, img, ins, kbd, q, s, samp,
-small, strike, strong, sub, sup, tt, var,
-b, u, i, center,
-dl, dt, dd, ol, ul, li,
-fieldset, form, label, legend,
-table, caption, tbody, tfoot, thead, tr, th, td {
-	background: transparent;
-	border: 0;
-	margin: 0;
-	padding: 0;
-	vertical-align: baseline;
-}
-body {
-}
-h1, h2, h3, h4, h5, h6 {
-	clear: both;
-	font-weight: bf;
-}
-ol, ul {
-	list-style: none;
-}
-blockquote {
-	quotes: none;
-}
-blockquote:before, blockquote:after {
-	content: '';
-	content: none;
-}
-del {
-	text-decoration: line-through;
-}
-/* tables still need 'cellspacing="0"' in the markup */
-table {
-	border-collapse: collapse;
-	border-spacing: 0;
-}
-a img {
-	border: none;
-}
-
-/* =Layout
--------------------------------------------------------------- */
-
-/*
-LAYOUT: Two columns
-DESCRIPTION: Two-column fixed layout with one sidebar right of content
-*/
-
-#container {
-	float: left;
-	margin: 0 -240px 0 0;
-	width: 100%;
-}
-#content {
-	margin: 0 280px 0 20px;
-}
-#primary {
-	float: right;
-	width: 233px;
-	padding: 0px;
-	margin-top: 0px;
-}
-#search,
-#secondary,
-#tertiary {
-	float: right;
-	overflow: hidden;
-	width: 220px;
-	border: 1px solid #bebebe;
-	padding: 5px;
-	margin-top: 5px;
-	margin-bottom: 10px;
-	background: #f0f0fa;
-}
-#search,
-#secondary,
-#tertiary {
-	clear: right;
-}
-#footer {
-	clear: both;
-	width: 100%;
-}
-
-/*
-LAYOUT: One column, no sidebar
-DESCRIPTION: One centered column with no sidebar
-*/
-
-.one-column #content {
-	margin: 0 auto;
-	width: 640px;
-}
-
-/*
-LAYOUT: Full width, no sidebar
-DESCRIPTION: Full width content with no sidebar; used for attachment pages
-*/
-
-.single-attachment #content {
-	margin: 0 auto;
-	width: 900px;
-}
-
-
-/* =Fonts
--------------------------------------------------------------- */
-body,
-input,
-textarea,
-.page-title span,
-.pingback a.url {
-	font-family: Georgia, "Bitstream Charter", serif;
-}
-h3#comments-title,
-h3#reply-title,
-#access .menu,
-#access div.menu ul,
-#cancel-comment-reply-link,
-.form-allowed-tags,
-#site-info,
-#site-title,
-#wp-calendar,
-.comment-meta,
-.comment-body tr th,
-.comment-body thead th,
-.entry-content label,
-.entry-content tr th,
-.entry-content thead th,
-.entry-meta,
-.entry-title,
-.entry-utility,
-#respond label,
-.navigation,
-.page-title,
-.pingback p,
-.reply,
-.widget-title,
-.wp-caption-text,
-input[type=submit] {
-	font-family: "Helvetica Neue", Helvetica, Arial, "Nimbus Sans L", sans-serif;
-}
-pre {
-	font-family: "Courier 10 Pitch", Courier, monospace;
-}
-code {
-	font-family: Monaco, Consolas, "Andale Mono", "DejaVu Sans Mono", monospace;
-}
-
-
-/* =Structure
--------------------------------------------------------------- */
-
-/* The main theme structure */
-#access .menu-header,
-div.menu,
-#colophon,
-#branding,
-#main,
-#wrapper {
-	margin: 0 auto;
-	width: 940px;
-}
-#wrapper {
-	background: #fff;
-	margin-top: 0px;
-	padding: 0 20px;
-}
-
-/* Structure the footer area */
-#footer-widget-area {
-	overflow: hidden;
-}
-#footer-widget-area .widget-area {
-	float: left;
-	margin-right: 20px;
-	width: 220px;
-}
-#footer-widget-area #fourth {
-	margin-right: 0;
-}
-#site-info {
-	float: left;
-	font-size: 14px;
-	font-weight: bold;
-	width: 700px;
-}
-#site-generator {
-	float: right;
-	width: 220px;
-}
-
-
-/* =Global Elements
--------------------------------------------------------------- */
-
-/* Main global 'theme' and typographic styles */
-body {
-	background: #f1f1f1;
-}
-body,
-input,
-textarea {
-	color: #666;
-	font-size: 12px;
-	line-height: 18px;
-}
-hr {
-	background-color: #e7e7e7;
-	border: 0;
-	clear: both;
-	height: 1px;
-	margin-bottom: 18px;
-}
-
-/* Text elements */
-p {
-    margin: 0px;
-}
-ul {
-	list-style: square;
-	margin: 0 0 18px 1.5em;
-}
-ol {
-	list-style: decimal;
-	margin: 0 0 18px 1.5em;
-}
-ol ol {
-	list-style: upper-alpha;
-}
-ol ol ol {
-	list-style: lower-roman;
-}
-ol ol ol ol {
-	list-style: lower-alpha;
-}
-ul ul,
-ol ol,
-ul ol,
-ol ul {
-	margin-bottom: 0;
-}
-dl {
-	margin: 0 0 24px 0;
-}
-dt {
-        font-size: 0.9em;
-	font-weight: bold;
-}
-dd {
-        font-size: 0.9em;
-	margin-bottom: 18px;
-}
-strong {
-	font-weight: bold;
-}
-cite,
-em,
-i {
-	font-style: italic;
-}
-big {
-	font-size: 131.25%;
-}
-ins {
-	background: #ffc;
-	text-decoration: none;
-}
-blockquote {
-	font-style: italic;
-	padding: 0 3em;
-}
-blockquote cite,
-blockquote em,
-blockquote i {
-	font-style: normal;
-}
-pre {
-	background: #f7f7f7;
-	color: #222;
-	line-height: 18px;
-	margin-bottom: 18px;
-	padding: 1.5em;
-}
-abbr,
-acronym {
-	border-bottom: 1px dotted #666;
-	cursor: help;
-}
-sup,
-sub {
-	height: 0;
-	line-height: 1;
-	position: relative;
-	vertical-align: baseline;
-}
-sup {
-	bottom: 1ex;
-}
-sub {
-	top: .5ex;
-}
-input[type="text"],
-textarea {
-	background: #f9f9f9;
-	border: 1px solid #ccc;
-	box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	-moz-box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	-webkit-box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	padding: 2px;
-}
-a:link {
-	color: #0066cc;
-}
-a:visited {
-	color: #743399;
-}
-a:active,
-a:hover {
-	color: #ff4b33;
-}
-
-/* Text meant only for screen readers */
-.screen-reader-text {
-	position: absolute;
-	left: -9000px;
-}
-
-
-/* =Header
--------------------------------------------------------------- */
-
-#header {
-	padding: 10px 0 0 0;
-}
-#site-title {
-	float: left;
-	font-size: 4.5em;
-	line-height: 46px;
-	margin: 0 0 0px 0;
-	width: 700px;
-}
-#site-title a {
-	color: #000;
-	font-weight: bold;
-	text-decoration: none;
-}
-#site-description {
-	clear: left;
-	float: left;
-	margin: 0px 0 5px 0;
-	width: 220px;
-}
-
-/* This is the custom header image */
-#branding img {
-	border-top: 4px solid #000;
-	border-bottom: 1px solid #000;
-	clear: both;
-	display: block;
-}
-
-#branding #site-motto {
-    float: right;
-}
-
-/* =Menu
--------------------------------------------------------------- */
-
-#access {
-	background: #000;
-	display: block;
-	float: left;
-	margin: 0 auto;
-	width: 940px;
-}
-#access .menu-header,
-div.menu {
-	font-size: 13px;
-	font-weight: bold;
-	margin-left: 12px;
-	width: 928px;
-}
-#access .menu-header ul,
-div.menu ul {
-	list-style: none;
-	margin: 0;
-}
-#access .menu-header li,
-div.menu li {
-	float: left;
-	position: relative;
-}
-#access a {
-	color: #aaa;
-	display: block;
-	line-height: 38px;
-	padding: 0 10px;
-	text-decoration: none;
-}
-#access ul ul {
-	box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	-moz-box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	-webkit-box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	display: none;
-	position: absolute;
-	top: 38px;
-	left: 0;
-	float: left;
-	width: 180px;
-	z-index: 99999;
-}
-#access ul ul li {
-	min-width: 180px;
-}
-#access ul ul ul {
-	left: 100%;
-	top: 0;
-}
-#access ul ul a {
-	background: #333;
-	line-height: 1em;
-	padding: 10px;
-	width: 160px;
-	height: auto;
-}
-#access li:hover > a,
-#access ul ul :hover > a {
-	background: #333;
-	color: #fff;
-}
-#access ul li:hover > ul {
-	display: block;
-}
-#access ul li.current_page_item > a,
-#access ul li.current-menu-ancestor > a,
-#access ul li.current-menu-item > a,
-#access ul li.current-menu-parent > a {
-	color: #fff;
-}
-* html #access ul li.current_page_item a,
-* html #access ul li.current-menu-ancestor a,
-* html #access ul li.current-menu-item a,
-* html #access ul li.current-menu-parent a,
-* html #access ul li a:hover {
-	color: #fff;
-}
-
-
-/* =Content
--------------------------------------------------------------- */
-
-#main {
-	clear: both;
-	overflow: hidden;
-	padding: 20px 0 0 0;
-}
-#content {
-	margin-bottom: 36px;
-}
-#content,
-#content input,
-#content textarea {
-	color: #333;
-	font-size: 16px;
-	line-height: 24px;
-}
-#content p,
-#content ul,
-#content ol,
-#content dd,
-#content pre,
-#content hr {
-	margin-bottom: 10px;
-}
-#content ul ul,
-#content ol ol,
-#content ul ol,
-#content ol ul {
-	margin-bottom: 0;
-}
-#content pre,
-#content kbd,
-#content tt,
-#content var {
-	font-size: 15px;
-	line-height: 21px;
-}
-#content code {
-	font-size: 13px;
-}
-#content dt,
-#content th {
-	color: #000;
-}
-#content h1,
-#content h2,
-#content h3 {
-	color: #000;
-	line-height: 1.5em;
-	margin: 0 0 10px -10px;
-}
-#content h4,
-#content h5,
-#content h6 {
-	color: #000;
-	line-height: 1.5em;
-	margin: 0 0 0px 0;
-}
-#content table {
-	border: 0px solid #e7e7e7;
-	margin: 0 -1px 24px 0;
-	text-align: left;
-	width: auto;
-}
-#content tr th,
-#content thead th {
-	color: #888;
-	font-size: 12px;
-	font-weight: bold;
-	line-height: 18px;
-	padding: 9px 24px;
-}
-#content tr td {
-	border-top: 0px solid #e7e7e7;
-	padding: 6px 26px 0px 0px;
-}
-#content tr.odd td {
-	background: #f2f7fc;
-}
-.hentry {
-	margin: 0 0 48px 0;
-}
-.home .sticky {
-	background: #f2f7fc;
-	border-top: 4px solid #000;
-	margin-left: -20px;
-	margin-right: -20px;
-	padding: 18px 20px;
-}
-.single .hentry {
-	margin: 0 0 36px 0;
-}
-.page-title {
-	color: #000;
-	font-size: 14px;
-	font-weight: bold;
-	margin: 0 0 36px 0;
-}
-.page-title span {
-	color: #333;
-	font-size: 16px;
-	font-style: italic;
-	font-weight: normal;
-}
-.page-title a:link,
-.page-title a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.page-title a:active,
-.page-title a:hover {
-	color: #ff4b33;
-}
-#content .entry-title {
-	color: #000;
-	font-size: 21px;
-	font-weight: bold;
-	line-height: 1.3em;
-	margin-bottom: 0;
-}
-.entry-title a:link,
-.entry-title a:visited {
-	color: #000;
-	text-decoration: none;
-}
-.entry-title a:active,
-.entry-title a:hover {
-	color: #ff4b33;
-}
-.entry-meta {
-	color: #888;
-	font-size: 12px;
-}
-.entry-meta abbr,
-.entry-utility abbr {
-	border: none;
-}
-.entry-meta abbr:hover,
-.entry-utility abbr:hover {
-	border-bottom: 1px dotted #666;
-}
-.entry-content,
-.entry-summary {
-	clear: both;
-	padding: 12px 0 0 0;
-}
-#content .entry-summary p:last-child {
-	margin-bottom: 12px;
-}
-.entry-content fieldset {
-	border: 1px solid #e7e7e7;
-	margin: 0 0 24px 0;
-	padding: 24px;
-}
-.entry-content fieldset legend {
-	background: #fff;
-	color: #000;
-	font-weight: bold;
-	padding: 0 24px;
-}
-.entry-content input {
-	margin: 0 0 24px 0;
-}
-.entry-content input.file,
-.entry-content input.button {
-	margin-right: 24px;
-}
-.entry-content label {
-	color: #888;
-	font-size: 12px;
-}
-.entry-content select {
-	margin: 0 0 24px 0;
-}
-.entry-content sup,
-.entry-content sub {
-	font-size: 10px;
-}
-.entry-content blockquote.left {
-	float: left;
-	margin-left: 0;
-	margin-right: 24px;
-	text-align: right;
-	width: 33%;
-}
-.entry-content blockquote.right {
-	float: right;
-	margin-left: 24px;
-	margin-right: 0;
-	text-align: left;
-	width: 33%;
-}
-.page-link {
-	color: #000;
-	font-weight: bold;
-	margin: 0 0 22px 0;
-	word-spacing: 0.5em;
-}
-.page-link a:link,
-.page-link a:visited {
-	background: #f1f1f1;
-	color: #333;
-	font-weight: normal;
-	padding: 0.5em 0.75em;
-	text-decoration: none;
-}
-.home .sticky .page-link a {
-	background: #d9e8f7;
-}
-.page-link a:active,
-.page-link a:hover {
-	color: #ff4b33;
-}
-body.page .edit-link {
-	clear: both;
-	display: block;
-}
-#entry-author-info {
-	background: #f2f7fc;
-	border-top: 4px solid #000;
-	clear: both;
-	font-size: 14px;
-	line-height: 20px;
-	margin: 24px 0;
-	overflow: hidden;
-	padding: 18px 20px;
-}
-#entry-author-info #author-avatar {
-	background: #fff;
-	border: 1px solid #e7e7e7;
-	float: left;
-	height: 60px;
-	margin: 0 -104px 0 0;
-	padding: 11px;
-}
-#entry-author-info #author-description {
-	float: left;
-	margin: 0 0 0 104px;
-}
-#entry-author-info h2 {
-	color: #000;
-	font-size: 100%;
-	font-weight: bold;
-	margin-bottom: 0;
-}
-.entry-utility {
-	clear: both;
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-}
-.entry-meta a,
-.entry-utility a {
-	color: #888;
-}
-.entry-meta a:hover,
-.entry-utility a:hover {
-	color: #ff4b33;
-}
-#content .video-player {
-	padding: 0;
-}
-
-
-/* =Asides
--------------------------------------------------------------- */
-
-.home #content .category-asides p {
-	font-size: 14px;
-	line-height: 20px;
-	margin-bottom: 10px;
-	margin-top: 0;
-}
-.home .hentry.category-asides {
-	padding: 0;
-}
-.home #content .category-asides .entry-content {
-	padding-top: 0;
-}
-
-
-/* =Gallery listing
--------------------------------------------------------------- */
-
-.category-gallery .size-thumbnail img {
-	border: 10px solid #f1f1f1;
-	margin-bottom: 0;
-}
-.category-gallery .gallery-thumb {
-	float: left;
-	margin-right: 20px;
-	margin-top: -4px;
-}
-.home #content .category-gallery .entry-utility {
-	padding-top: 4px;
-}
-
-
-/* =Attachment pages
--------------------------------------------------------------- */
-
-.attachment .entry-content .entry-caption {
-	font-size: 140%;
-	margin-top: 24px;
-}
-.attachment .entry-content .nav-previous a:before {
-	content: '\2190\00a0';
-}
-.attachment .entry-content .nav-next a:after {
-	content: '\00a0\2192';
-}
-
-
-/* =Images
--------------------------------------------------------------- */
-
-#content img {
-	margin: 0;
-	height: auto;
-	max-width: 640px;
-	width: auto;
-}
-#content .attachment img {
-	max-width: 900px;
-}
-#content .alignleft,
-#content img.alignleft {
-	display: inline;
-	float: left;
-	margin-right: 24px;
-	margin-top: 4px;
-}
-#content .alignright,
-#content img.alignright {
-	display: inline;
-	float: right;
-	margin-left: 24px;
-	margin-top: 4px;
-}
-#content .aligncenter,
-#content img.aligncenter {
-	clear: both;
-	display: block;
-	margin-left: auto;
-	margin-right: auto;
-}
-#content img.alignleft,
-#content img.alignright,
-#content img.aligncenter {
-	margin-bottom: 12px;
-}
-#content .wp-caption {
-	background: #f1f1f1;
-	line-height: 18px;
-	margin-bottom: 20px;
-	padding: 4px;
-	text-align: center;
-}
-#content .wp-caption img {
-	margin: 5px 5px 0;
-}
-#content .wp-caption p.wp-caption-text {
-	color: #888;
-	font-size: 12px;
-	margin: 5px;
-}
-#content .wp-smiley {
-	margin: 0;
-}
-#content .gallery {
-	margin: 0 auto 18px;
-}
-#content .gallery .gallery-item {
-	float: left;
-	margin-top: 0;
-	text-align: center;
-	width: 33%;
-}
-#content .gallery img {
-	border: 2px solid #cfcfcf;
-}
-#content .gallery .gallery-caption {
-	color: #888;
-	font-size: 12px;
-	margin: 0 0 12px;
-}
-#content .gallery dl {
-	margin: 0;
-}
-#content .gallery img {
-	border: 10px solid #f1f1f1;
-}
-#content .gallery br+br {
-	display: none;
-}
-#content .attachment img { /* single attachment images should be centered */
-	display: block;
-	margin: 0 auto;
-}
-
-
-/* =Navigation
--------------------------------------------------------------- */
-
-.navigation {
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-	overflow: hidden;
-}
-.navigation a:link,
-.navigation a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.navigation a:active,
-.navigation a:hover {
-	color: #ff4b33;
-}
-.nav-previous {
-	float: left;
-	width: 50%;
-}
-.nav-next {
-	float: right;
-	text-align: right;
-	width: 50%;
-}
-#nav-above {
-	margin: 0 0 18px 0;
-}
-#nav-above {
-	display: none;
-}
-.paged #nav-above,
-.single #nav-above {
-	display: block;
-}
-#nav-below {
-	margin: -18px 0 0 0;
-}
-
-
-/* =Comments
--------------------------------------------------------------- */
-#comments {
-	clear: both;
-}
-#comments .navigation {
-	padding: 0 0 18px 0;
-}
-h3#comments-title,
-h3#reply-title {
-	color: #000;
-	font-size: 20px;
-	font-weight: bold;
-	margin-bottom: 0;
-}
-h3#comments-title {
-	padding: 24px 0;
-}
-.commentlist {
-	list-style: none;
-	margin: 0;
-}
-.commentlist li.comment {
-	border-bottom: 1px solid #e7e7e7;
-	line-height: 24px;
-	margin: 0 0 24px 0;
-	padding: 0 0 0 56px;
-	position: relative;
-}
-.commentlist li:last-child {
-	border-bottom: none;
-	margin-bottom: 0;
-}
-#comments .comment-body ul,
-#comments .comment-body ol {
-	margin-bottom: 18px;
-}
-#comments .comment-body p:last-child {
-	margin-bottom: 6px;
-}
-#comments .comment-body blockquote p:last-child {
-	margin-bottom: 24px;
-}
-.commentlist ol {
-	list-style: decimal;
-}
-.commentlist .avatar {
-	position: absolute;
-	top: 4px;
-	left: 0;
-}
-.comment-author {
-}
-.comment-author cite {
-	color: #000;
-	font-style: normal;
-	font-weight: bold;
-}
-.comment-author .says {
-	font-style: italic;
-}
-.comment-meta {
-	font-size: 12px;
-	margin: 0 0 18px 0;
-}
-.comment-meta a:link,
-.comment-meta a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.comment-meta a:active,
-.comment-meta a:hover {
-	color: #ff4b33;
-}
-.commentlist .even {
-}
-.commentlist .bypostauthor {
-}
-.reply {
-	font-size: 12px;
-	padding: 0 0 24px 0;
-}
-.reply a,
-a.comment-edit-link {
-	color: #888;
-}
-.reply a:hover,
-a.comment-edit-link:hover {
-	color: #ff4b33;
-}
-.commentlist .children {
-	list-style: none;
-	margin: 0;
-}
-.commentlist .children li {
-	border: none;
-	margin: 0;
-}
-.nopassword,
-.nocomments {
-	display: none;
-}
-#comments .pingback {
-	border-bottom: 1px solid #e7e7e7;
-	margin-bottom: 18px;
-	padding-bottom: 18px;
-}
-.commentlist li.comment+li.pingback {
-	margin-top: -6px;
-}
-#comments .pingback p {
-	color: #888;
-	display: block;
-	font-size: 12px;
-	line-height: 18px;
-	margin: 0;
-}
-#comments .pingback .url {
-	font-size: 13px;
-	font-style: italic;
-}
-
-/* Comments form */
-input[type=submit] {
-	color: #333;
-}
-#respond {
-	border-top: 1px solid #e7e7e7;
-	margin: 24px 0;
-	overflow: hidden;
-	position: relative;
-}
-#respond p {
-	margin: 0;
-}
-#respond .comment-notes {
-	margin-bottom: 1em;
-}
-.form-allowed-tags {
-	line-height: 1em;
-}
-.children #respond {
-	margin: 0 48px 0 0;
-}
-h3#reply-title {
-	margin: 18px 0;
-}
-#comments-list #respond {
-	margin: 0 0 18px 0;
-}
-#comments-list ul #respond {
-	margin: 0;
-}
-#cancel-comment-reply-link {
-	font-size: 12px;
-	font-weight: normal;
-	line-height: 18px;
-}
-#respond .required {
-	color: #ff4b33;
-	font-weight: bold;
-}
-#respond label {
-	color: #888;
-	font-size: 12px;
-}
-#respond input {
-	margin: 0 0 9px;
-	width: 98%;
-}
-#respond textarea {
-	width: 98%;
-}
-#respond .form-allowed-tags {
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-}
-#respond .form-allowed-tags code {
-	font-size: 11px;
-}
-#respond .form-submit {
-	margin: 12px 0;
-}
-#respond .form-submit input {
-	font-size: 14px;
-	width: auto;
-}
-
-
-/* =Widget Areas
--------------------------------------------------------------- */
-
-.widget-area ul {
-	list-style: none;
-	margin-left: 0;
-}
-.widget-area ul ul {
-	list-style: square;
-	margin-left: 1.3em;
-}
-.widget_search #s {/* This keeps the search inputs in line */
-	width: 60%;
-}
-.widget_search label {
-	display: none;
-}
-.widget-container {
-	margin: 0 0 18px 0;
-}
-.widget-title {
-	color: #222;
-	font-weight: bold;
-}
-.widget-area a:link,
-.widget-area a:visited {
-	text-decoration: none;
-}
-.widget-area a:active,
-.widget-area a:hover {
-	text-decoration: underline;
-}
-.widget-area .entry-meta {
-	font-size: 11px;
-}
-#wp_tag_cloud div {
-	line-height: 1.6em;
-}
-#wp-calendar {
-	width: 100%;
-}
-#wp-calendar caption {
-	color: #222;
-	font-size: 14px;
-	font-weight: bold;
-	padding-bottom: 4px;
-	text-align: left;
-}
-#wp-calendar thead {
-	font-size: 11px;
-}
-#wp-calendar thead th {
-}
-#wp-calendar tbody {
-	color: #aaa;
-}
-#wp-calendar tbody td {
-	background: #f5f5f5;
-	border: 1px solid #fff;
-	padding: 3px 0 2px;
-	text-align: center;
-}
-#wp-calendar tbody .pad {
-	background: none;
-}
-#wp-calendar tfoot #next {
-	text-align: right;
-}
-.widget_rss a.rsswidget {
-	color: #000;
-}
-.widget_rss a.rsswidget:hover {
-	color: #ff4b33;
-}
-.widget_rss .widget-title img {
-	width: 11px;
-	height: 11px;
-}
-
-/* Main sidebars */
-#main .widget-area ul {
-	margin-left: 0;
-	padding: 0 20px 0 0;
-}
-#main .widget-area ul ul {
-	border: none;
-	margin-left: 1.3em;
-	padding: 0;
-}
-
-/* Footer widget areas */
-#footer-widget-area {
-}
-
-
-/* =Footer
--------------------------------------------------------------- */
-
-#footer {
-	margin-bottom: 20px;
-}
-#colophon {
-	border-top: 4px solid #000;
-	margin-top: -4px;
-	overflow: hidden;
-	padding: 18px 0;
-}
-#site-info {
-	font-weight: bold;
-}
-#site-info a {
-	color: #000;
-	text-decoration: none;
-}
-#site-generator {
-	font-style: italic;
-	position: relative;
-}
-#site-generator a {
-	background: url(images/wordpress.png) center left no-repeat;
-	color: #666;
-	display: inline-block;
-	line-height: 16px;
-	padding-left: 20px;
-	text-decoration: none;
-}
-#site-generator a:hover {
-	text-decoration: underline;
-}
-img#wpstats {
-	display: block;
-	margin: 0 auto 10px;
-}
-
-
-/* =Mobile Safari ( iPad, iPhone and iPod Touch )
--------------------------------------------------------------- */
-
-pre {
-	-webkit-text-size-adjust: 140%;
-}
-code {
-	-webkit-text-size-adjust: 160%;
-}
-#access,
-.entry-meta,
-.entry-utility,
-.navigation,
-.widget-area {
-	-webkit-text-size-adjust: 120%;
-}
-#site-description {
-	-webkit-text-size-adjust: none;
-}
-
-
-/* =Print Style
--------------------------------------------------------------- */
-
-@media print {
-	body {
-		background: none !important;
-	}
-	#wrapper {
-		clear: both !important;
-		display: block !important;
-		float: none !important;
-		position: relative !important;
-	}
-	#header {
-		border-bottom: 2pt solid #000;
-		padding-bottom: 18pt;
-	}
-	#colophon {
-		border-top: 2pt solid #000;
-	}
-	#site-title,
-	#site-description {
-		float: none;
-		line-height: 1.4em;
-		margin: 0;
-		padding: 0;
-	}
-	#site-title {
-		font-size: 13pt;
-	}
-	.entry-content {
-		font-size: 14pt;
-		line-height: 1.6em;
-	}
-	.entry-title {
-		font-size: 21pt;
-	}
-	#access,
-	#branding img,
-	#respond,
-	.comment-edit-link,
-	.edit-link,
-	.navigation,
-	.page-link,
-	.widget-area {
-		display: none !important;
-	}
-	#container,
-	#header,
-	#footer {
-		margin: 0;
-		width: 100%;
-	}
-	#content,
-	.one-column #content {
-		margin: 24pt 0 0;
-		width: 100%;
-	}
-	.wp-caption p {
-		font-size: 11pt;
-	}
-	#site-info,
-	#site-generator {
-		float: none;
-		width: auto;
-	}
-	#colophon {
-		width: auto;
-	}
-	img#wpstats {
-		display: none;
-	}
-	#site-generator a {
-		margin: 0;
-		padding: 0;
-	}
-	#entry-author-info {
-		border: 1px solid #e7e7e7;
-	}
-	#main {
-		display: inline;
-	}
-	.home .sticky {
-		border: none;
-	}
-}
-
-p.searchexamples {
-    font-size: 0.8em;
-}
-
-div.whatsnew {
-    margin-top: 30px;
-    margin-bottom: 0px;
-}
-ul.whatsnew {
-    list-style: square;
-    margin-bottom: 0px;
-}
-
-ul.whatsnew li {
-    margin-top: 10px;
-}
-
-ul.whatsnew p {
-    margin: 0px;
-}
-div.tags {
-    margin-top: 5px;
-}
-div.recaptcha {
-    margin-bottom: 20px;
-}
-form.failedcaptcha div.recaptcha {
-    border: 1px solid #f00;
-}
-.error {
-    color: #f00;
-}
-form.donateform th {
-    vertical-align: top;
-}
-#content ul.datasets {
-    list-style: none;
-    margin-bottom: 0px;
-    margin-left: 0px;
-    clear: both;
-}
-ul.datasets li {
-    padding: 0px;
-    margin-bottom: 20px;
-    margin-top: 0px;
-}
-#content ul.datasets p {
-    margin-bottom: 0px;
-    padding: 0px;
-}
-div.datasetdescription {
-    margin-left: 0px;
-    margin-top: 5px;
-}
-div.datasetdescription p {
-}
-div.datasetdescription ol {
-    margin-top: 0px;
-    margin-left: 30px;
-}
-p.datasettags {
-    font-size: 0.9em;
-    text-align: left;
-    font-style: italic;
-    margin-top: 0px;
-    margin-left: 20px;
-    margin-bottom: 10px;
-}
-a { 
-    text-decoration: none;
-}
-p.datasetdate {
-    font-size: 0.8em;
-    text-align: right;
-    color: #888;
-    font-style: italic;
-    margin-top: 3px;
-}
-#content h2.dataset {
-    margin-bottom: 0px;
-}
-#content p.datasettags2 {
-    font-size: 0.9em;
-    font-style: italic;
-    margin-bottom: 0px;
-}
-p.datasetdate2 {
-    font-size: 0.8em;
-    text-align: left;
-    color: #888;
-    font-style: italic;
-    margin-top: 3px;
-}
-span.tag1 {
-    font-size: 1em;
-}
-span.tag2 {
-    font-size: 1.2em;
-}
-span.tag3 {
-    font-size: 1.5em;
-}
-span.tag4 {
-    font-size: 2em;
-}
-span.tag5 {
-    font-size: 2.5em;
-}
-input.openid {
-    background: url(http://openid.net/login-bg.gif) no-repeat; 
-    padding-left: 18px; 
-    background-position: 0 50%;
-}
-span.username {
-    color: green;
-}
-div.feed {
-    float: right;
-    width: 50px;
-    text-align: right;
-}
-div.loginbox {
-    float: right;
-}
-div.title {
-    float:left;
-    margin-bottom: 0px;
-}
-div.dataset {
-    clear: both;
-}
-div.licence {
-    clear: both;
-}
-span.checkvalue {
-    font-weight: bold;
-}
-span.failure {
-    color: red;
-}
-span.edit a {
-    font-size: 0.6em;
-}
-p.wndate {
-    font-style: italic;
-}
-div.blogentry {
-    clear: both;
-}
-ul.download {
-    list-style: none;
-    margin: 0px;
-    margin-top: 0px;
-    margin-bottom: 0px;
-}
-
-#content div.docs table {
-    background: #eaeaea;
-    padding-left: 20px;
-    border: 1px solid;
-}
-#content div.docs table td {
-    padding:10px;
-}
-div.docs > ol {
-    list-style-type: none;
-    counter-reset: contents;
-}
-div.docs > ol > li {
-    counter-increment: contents;
-}
-div.docs > ol > li:before { 
-    content: counters(contents, ".") " ";
-}
-div.docs > ol > li > ol {
-    list-style-type: none;
-    counter-reset: contents2;
-}
-div.docs > ol > li > ol > li{
-    counter-increment: contents2;
-}
-div.docs > ol > li > ol > li:before { 
-    content: counters(contents, ".") "." counters(contents2, ".") " ";
-}
-div.docs {
-    counter-reset: section;
-}
-div.docs > h1 {
-    counter-increment: section;
-    counter-reset: subsection;
-}
-div.docs > h1:before {   
-    content: counters(section, ".") " ";
-}
-div.docs > h2 {
-    counter-increment: subsection;
-    counter-reset: subsubsection;
-}
-div.docs > h2:before {   
-    content: counters(section, ".") "." counters(subsection, ".") " ";
-}
-div.docs > h3 {
-    counter-increment: subsubsection;
-    counter-reset: subsubsubsection;
-}
-div.docs > h3:before {   
-    content: counters(section, ".") "." counters(subsection, ".") "." counters(subsubsection, ".") " ";
-}
-div.docs > h4 {
-    counter-increment: subsubsubsection;
-}
-div.docs > h4:before {   
-    content: counters(section, ".") "." counters(subsection, ".") "."
-    counters(subsubsection, ".") "." counters(subsubsubsection, ".") " ";
-}
-
-div.prevnexttable {
-    text-align: center;
-}
-span.actualpage {
-    font-size: 1.3em;
-    font-weight: bold;
-}
-span.prevpage {
-    margin-right: 20px;
-}
-span.nextpage {
-    margin-left: 20px;
-}
-#searchform {
-    margin-top: 27px;
-}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/feed-icon-14x14.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/feed-icon-14x14.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/feed-icon-28x28.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/feed-icon-28x28.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/Excel.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/formats/Excel.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/GraphML.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/formats/GraphML.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/GraphML.svg igraph-0.6.5/nexus/cgi-bin/static/images/formats/GraphML.svg
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/GraphML.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/images/formats/GraphML.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,81 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   width="15.15625"
-   height="15.15625"
-   id="svg2"
-   version="1.1"
-   inkscape:version="0.48+devel r9931"
-   sodipodi:docname="GraphML.svg">
-  <defs
-     id="defs4" />
-  <sodipodi:namedview
-     id="base"
-     pagecolor="#ffffff"
-     bordercolor="#666666"
-     borderopacity="1.0"
-     inkscape:pageopacity="0.0"
-     inkscape:pageshadow="2"
-     inkscape:zoom="15.222146"
-     inkscape:cx="13.859872"
-     inkscape:cy="-0.43672206"
-     inkscape:document-units="px"
-     inkscape:current-layer="layer1"
-     showgrid="false"
-     fit-margin-top="0"
-     fit-margin-left="0"
-     fit-margin-right="0"
-     fit-margin-bottom="0"
-     inkscape:window-width="1680"
-     inkscape:window-height="1002"
-     inkscape:window-x="0"
-     inkscape:window-y="0"
-     inkscape:window-maximized="1" />
-  <metadata
-     id="metadata7">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-        <dc:title />
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <g
-     inkscape:label="Layer 1"
-     inkscape:groupmode="layer"
-     id="layer1"
-     transform="translate(-192.1875,-293.09375)">
-    <g
-       id="g3838">
-      <text
-         sodipodi:linespacing="125%"
-         id="text3069"
-         y="306.64789"
-         x="194.28571"
-         style="font-size:18px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;letter-spacing:0px;word-spacing:0px;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;font-family:Andale Mono;-inkscape-font-specification:Andale Mono Bold"
-         xml:space="preserve"><tspan
-           y="306.64789"
-           x="194.28571"
-           id="tspan3071"
-           sodipodi:role="line">G</tspan></text>
-      <rect
-         y="293.35229"
-         x="192.44569"
-         height="14.65"
-         width="14.65"
-         id="rect3068"
-         style="fill:none;stroke:#000000;stroke-width:0.5;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0" />
-    </g>
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/Pajek.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/formats/Pajek.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/Python-igraph.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/formats/Python-igraph.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/Python-igraph.svg igraph-0.6.5/nexus/cgi-bin/static/images/formats/Python-igraph.svg
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/Python-igraph.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/images/formats/Python-igraph.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,282 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:xlink="http://www.w3.org/1999/xlink"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   version="1.0"
-   id="svg2"
-   sodipodi:version="0.32"
-   inkscape:version="0.48+devel r9931"
-   sodipodi:docname="python-logo-inkscape.svg"
-   width="111.16135"
-   height="112.389">
-  <metadata
-     id="metadata371">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-        <dc:title></dc:title>
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <sodipodi:namedview
-     inkscape:window-height="882"
-     inkscape:window-width="1233"
-     inkscape:pageshadow="2"
-     inkscape:pageopacity="0.0"
-     guidetolerance="10.0"
-     gridtolerance="10.0"
-     objecttolerance="10.0"
-     borderopacity="1.0"
-     bordercolor="#666666"
-     pagecolor="#ffffff"
-     id="base"
-     inkscape:zoom="2.2672565"
-     inkscape:cx="-9.5609258"
-     inkscape:cy="46.898555"
-     inkscape:window-x="0"
-     inkscape:window-y="6"
-     inkscape:current-layer="svg2"
-     width="210mm"
-     height="40mm"
-     units="mm"
-     showgrid="false"
-     fit-margin-top="0"
-     fit-margin-left="0"
-     fit-margin-right="0"
-     fit-margin-bottom="0"
-     inkscape:window-maximized="0" />
-  <defs
-     id="defs4">
-    <linearGradient
-       id="linearGradient2795">
-      <stop
-         style="stop-color:#b8b8b8;stop-opacity:0.49803922;"
-         offset="0"
-         id="stop2797" />
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0;"
-         offset="1"
-         id="stop2799" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient2787">
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0.5;"
-         offset="0"
-         id="stop2789" />
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0;"
-         offset="1"
-         id="stop2791" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient3676">
-      <stop
-         style="stop-color:#b2b2b2;stop-opacity:0.5;"
-         offset="0"
-         id="stop3678" />
-      <stop
-         style="stop-color:#b3b3b3;stop-opacity:0;"
-         offset="1"
-         id="stop3680" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient3236">
-      <stop
-         style="stop-color:#f4f4f4;stop-opacity:1"
-         offset="0"
-         id="stop3244" />
-      <stop
-         style="stop-color:white;stop-opacity:1"
-         offset="1"
-         id="stop3240" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient4671">
-      <stop
-         style="stop-color:#ffd43b;stop-opacity:1;"
-         offset="0"
-         id="stop4673" />
-      <stop
-         style="stop-color:#ffe873;stop-opacity:1"
-         offset="1"
-         id="stop4675" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient4689">
-      <stop
-         style="stop-color:#5a9fd4;stop-opacity:1;"
-         offset="0"
-         id="stop4691" />
-      <stop
-         style="stop-color:#306998;stop-opacity:1;"
-         offset="1"
-         id="stop4693" />
-    </linearGradient>
-    <linearGradient
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717"
-       id="linearGradient2987"
-       xlink:href="#linearGradient4671"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)" />
-    <linearGradient
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133"
-       id="linearGradient2990"
-       xlink:href="#linearGradient4689"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2587"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2589"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2248"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2250"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2255"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-11.5974,-7.60954)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2258"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-11.5974,-7.60954)"
-       x1="172.94208"
-       y1="76.176224"
-       x2="26.670298"
-       y2="76.313133" />
-    <radialGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient2795"
-       id="radialGradient2801"
-       cx="61.518883"
-       cy="132.28575"
-       fx="61.518883"
-       fy="132.28575"
-       r="29.036913"
-       gradientTransform="matrix(1,0,0,0.177966,0,108.7434)"
-       gradientUnits="userSpaceOnUse" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient1475"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-9.399749,-5.305317)"
-       x1="150.96111"
-       y1="192.35176"
-       x2="112.03144"
-       y2="137.27299" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient1478"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-9.399749,-5.305317)"
-       x1="26.648937"
-       y1="20.603781"
-       x2="135.66525"
-       y2="114.39767" />
-    <radialGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient2795"
-       id="radialGradient1480"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(2.382716e-8,-0.296405,1.43676,4.683673e-7,-128.544,150.5202)"
-       cx="61.518883"
-       cy="132.28575"
-       fx="61.518883"
-       fy="132.28575"
-       r="29.036913" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient3109"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-3.8083784,1.0917366)"
-       x1="26.648937"
-       y1="20.603781"
-       x2="135.66525"
-       y2="114.39767" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient3111"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-3.8083784,1.0917366)"
-       x1="150.96111"
-       y1="192.35176"
-       x2="112.03144"
-       y2="137.27299" />
-  </defs>
-  <g
-     id="g3105"
-     transform="translate(-5.5913706,-6.3970536)">
-    <path
-       id="path1948"
-       d="m 60.510156,6.3979729 c -4.583653,0.021298 -8.960939,0.4122177 -12.8125,1.09375 C 36.35144,9.4962267 34.291407,13.691825 34.291406,21.429223 l 0,10.21875 26.8125,0 0,3.40625 -26.8125,0 -10.0625,0 c -7.792459,0 -14.6157592,4.683717 -16.7500002,13.59375 -2.46182,10.212966 -2.5710151,16.586023 0,27.25 1.9059283,7.937852 6.4575432,13.593748 14.2500002,13.59375 l 9.21875,0 0,-12.25 c 0,-8.849902 7.657144,-16.656248 16.75,-16.65625 l 26.78125,0 c 7.454951,0 13.406253,-6.138164 13.40625,-13.625 l 0,-25.53125 c 0,-7.266339 -6.12998,-12.7247775 -13.40625,-13.9375001 -4.605987,-0.7667253 -9.385097,-1.1150483 -13.96875,-1.09375 z m -14.5,8.2187501 c 2.769547,0 5.03125,2.298646 5.03125,5.125 -2e-6,2.816336 -2.261703,5.09375 -5.03125,5.09375 -2.779476,-1e-6 -5.03125,-2.277415 -5.03125,-5.09375 -1e-6,-2.826353 2.251774,-5.125 5.03125,-5.125 z"
-       style="fill:url(#linearGradient3109);fill-opacity:1"
-       inkscape:connector-curvature="0" />
-    <path
-       id="path1950"
-       d="m 91.228906,35.054223 0,11.90625 c 0,9.230755 -7.825895,16.999999 -16.75,17 l -26.78125,0 c -7.335833,0 -13.406249,6.278483 -13.40625,13.625 l 0,25.531247 c 0,7.26634 6.318588,11.54032 13.40625,13.625 8.487331,2.49561 16.626237,2.94663 26.78125,0 6.750155,-1.95439 13.406253,-5.88761 13.40625,-13.625 l 0,-10.218747 -26.78125,0 0,-3.40625 26.78125,0 13.406254,0 c 7.79246,0 10.69625,-5.435408 13.40624,-13.59375 2.79933,-8.398886 2.68022,-16.475776 0,-27.25 -1.92578,-7.757441 -5.60387,-13.59375 -13.40624,-13.59375 l -10.062504,0 z m -15.0625,64.65625 c 2.779478,3e-6 5.03125,2.277417 5.03125,5.093747 -2e-6,2.82635 -2.251775,5.125 -5.03125,5.125 -2.76955,0 -5.03125,-2.29865 -5.03125,-5.125 2e-6,-2.81633 2.261697,-5.093747 5.03125,-5.093747 z"
-       style="fill:url(#linearGradient3111);fill-opacity:1"
-       inkscape:connector-curvature="0" />
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/images/formats/R-igraph.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/images/formats/R-igraph.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/index_schema.xsl igraph-0.6.5/nexus/cgi-bin/static/index_schema.xsl
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/index_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/index_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, dataset list
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="datasets" type="datasetsType" />
-
-  <xsd:complexType name="datasetsType">
-    <xsd:sequence>
-      <xsd:element name="size" type="xsd:nonNegativeInteger" />
-      <xsd:element name="totalsize" type="xsd:nonNegativeInteger" />
-      <xsd:element name="offset" type="xsd:nonNegativeInteger" />
-      <xsd:element name="limit" type="xsd:nonNegativeInteger" />
-      <xsd:element name="dataset" type="datasetSummaryType" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="datasetSummaryType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="networks" type="networksType" />
-      <xsd:element name="tags" type="tagsType" />
-      <xsd:element name="date" type="xsd:date" />      
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networksType">
-    <xsd:sequence>
-      <xsd:element name="network" type="networkType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networkType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="vertices" type="xsd:nonNegativeInteger" />
-      <xsd:element name="edges" type="xsd:nonNegativeInteger" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="tagsType">
-    <xsd:sequence>
-      <xsd:element name="tag" type="xsd:string" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/licence_schema.xsl igraph-0.6.5/nexus/cgi-bin/static/licence_schema.xsl
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/licence_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/licence_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, licence information
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="licences" type="licencesType" />
-
-  <xsd:complexType name="licencesType">
-    <xsd:sequence>
-      <xsd:element name="licence" type="licenceType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-  <xsd:complexType name="licenceType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="url" type="xsd:anyURI" />
-      <xsd:element name="text" type="xsd:string" minOccurs="0" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-</xsd:schema>
-
-      
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo.R igraph-0.6.5/nexus/cgi-bin/static/nexus_logo.R
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/nexus_logo.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-library(igraph)
-
-g <- graph.star(5, mode="undirected")
-g$layout <- rbind( c(0,0), c(-1,1), c(1,1), c(1,-1), c(-1,-1) )
-V(g)$size <- 80
-E(g)$width <- 30
-E(g)$color <- "black"
-V(g)$label <- c("X", "N", "E", "S", "U")
-V(g)$color <- "gold"
-V(g)$label.cex <- 7
-
-pdf("nexus_logo.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g)
-dev.off()
-
-pdf("nexus_logo_small.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g, vertex.label=NA)
-dev.off()
-
-pdf("nexus_logo_black.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g, vertex.color="black", vertex.label.color="white")
-dev.off()
-
-pdf("nexus_logo_black_small.pdf")
-par(mar=c(0,0,0,0), bg=rgb(0.9,0.9,0.9))
-plot(g, vertex.color="black", vertex.label.color="white", vertex.label=NA)
-dev.off()
-
-png("nexus_logo_black_small.png", width=160, height=160)
-par(mar=c(0,0,0,0), bg="transparent")
-plot(g, vertex.color="black", vertex.label.color="white", vertex.label=NA)
-dev.off()
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo.pdf igraph-0.6.5/nexus/cgi-bin/static/nexus_logo.pdf
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/nexus_logo.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,155 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-1.000 0.843 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q q
-BT
-0.000 0.000 0.545 rg
-/F7 1 Tf 84.00 0.00 -0.00 84.00 221.68 224.20 Tm (X) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 391.32 Tm (N) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 393.00 390.86 Tm (E) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 395.31 57.53 Tm (S) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 58.12 Tm (U) Tj
-ET
-Q
-endstream
-endobj
-7 0 obj
-1606
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <</F7 9 0 R >>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-9 0 obj <<
-/Type /Font
-/Subtype /Type1
-/Name /F7
-/BaseFont /Times-Roman
-/Encoding 8 0 R
->> endobj
-xref
-0 10
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001972 00000 n 
-0000002055 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001952 00000 n 
-0000002136 00000 n 
-0000002393 00000 n 
-trailer
-<<
-/Size 10
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2491
-%%EOF
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_black.pdf igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_black.pdf
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_black.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_black.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,155 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-0.000 0.000 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q q
-BT
-1.000 1.000 1.000 rg
-/F7 1 Tf 84.00 0.00 -0.00 84.00 221.68 224.20 Tm (X) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 391.32 Tm (N) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 393.00 390.86 Tm (E) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 395.31 57.53 Tm (S) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 58.12 Tm (U) Tj
-ET
-Q
-endstream
-endobj
-7 0 obj
-1606
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <</F7 9 0 R >>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-9 0 obj <<
-/Type /Font
-/Subtype /Type1
-/Name /F7
-/BaseFont /Times-Roman
-/Encoding 8 0 R
->> endobj
-xref
-0 10
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001972 00000 n 
-0000002055 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001952 00000 n 
-0000002136 00000 n 
-0000002393 00000 n 
-trailer
-<<
-/Size 10
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2491
-%%EOF
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_black_small.pdf igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_black_small.pdf
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_black_small.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_black_small.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130120019)
-/ModDate (D:20110130120019)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.902 0.902 0.902 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-0.000 0.000 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q
-endstream
-endobj
-7 0 obj
-1275
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <<>>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-xref
-0 9
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001641 00000 n 
-0000001724 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001621 00000 n 
-0000001795 00000 n 
-trailer
-<<
-/Size 9
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2052
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_black_small.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_black_small.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_small.pdf igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_small.pdf
--- igraph-0.6.5~quantal1/nexus/cgi-bin/static/nexus_logo_small.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/static/nexus_logo_small.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-1.000 0.843 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q
-endstream
-endobj
-7 0 obj
-1275
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <<>>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-xref
-0 9
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001641 00000 n 
-0000001724 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001621 00000 n 
-0000001795 00000 n 
-trailer
-<<
-/Size 9
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2052
-%%EOF
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/about.html igraph-0.6.5/nexus/cgi-bin/templates/about.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/about.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/about.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,61 +0,0 @@
-$def with ()
-
-<h2>About Nexus</h2>
-
-<h3>What is Nexus?</h3>
-
-<p>
-Nexus is a repository of freely available (see license below) network
-data sets, to promote network science research and
-education. Real-world data is essential for the testing of hypotheses
-and the development of algorithms. 
-</p>
-
-<h3>Ease of use</h3>
-
-<p>
-The principal aim of Nexus is make network data sets available with
-the least effort possible from the user. You can download data that is
-ready to use, in <a href="$:getbase()/api/format">various
-    formats</a>. We also <a href="$:getbase()/web/docs">provide an
-    API</a> to allow importing data into 
-your analysis software directly and possibly programmatically. Nexus
-is supported by the <a href="http://igraph.sourceforge.net">igraph
-  network analysis library</a>, that you can use in your Python, R or
-C/C++ programs.
-</p>
-
-<p>
-We put an effort into carefully annotating the data sets and providing
-the most complete possible meta-information within the data set
-itself.
-</p>
-
-<h3>License</h3>
-
-<p>
-The different data sets are available
-under <a href="$:getbase()/api/licence">different licenses</a>, 
-please be sure to check the license of the particular data set you are
-using. In general, all data sets are available for non-commercial
-research and education purposes, provided you cite the appropriate
-publications in your papers using them. Many data sets are available
-for commercial use as well. 
-<p>
-
-<h3>Donate data sets</h3>
-
-<p>
-A database without data is nothing. Please
-consider <a href="$:getbase()/web/donate">sharing your data
-sets</a> to facilitate network science research. Not only will your
-donation help other researchers and students, but it will also promote
-reproducible research.
-</p>
-
-<p>
-It is important, that if you donate your data, you still retain the
-ownership and copyright on it. Obviously, you can also decide on the
-terms of use for your data set.
-<p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/add.html igraph-0.6.5/nexus/cgi-bin/templates/add.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/add.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/add.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,99 +0,0 @@
-$def with (form, post, edit, id, netforms=[], metaforms=[])
-
-<script type="text/javascript">
-
-  function addOneNet(no) {
-      html='$:add_net_form("XXX").render().replace("\n", " ")';
-      html=html.replace(/XXX/g, no);
-      return html;
-  }
-  
-  function delNet(no) {
-      div=document.getElementById("net" + no);
-      removeElement(div);
-      return false;
-  }
-
-  function addNet() {
-      if (typeof addNet.netno == 'undefined') {
-	  addNet.netno = 0;
-      }
-      addNet.netno += 1;
-      netdiv=document.getElementById("networks");
-      newtab=document.createElement('div');
-      newtab.id = 'net' + addNet.netno;
-      newtab.innerHTML = addOneNet(addNet.netno);
-      netdiv.appendChild(newtab);
-      return false;
-  }
-
-  function addOneMeta(no) {
-      html='$:add_meta_form("XXX").render().replace("\n", " ")';
-      html=html.replace(/XXX/g, no);
-      return html;
-  }
-  
-  function delMeta(no) {
-      div=document.getElementById("meta" + no);
-      removeElement(div);
-      return false;
-  }
-
-  function addMeta() {
-      if (typeof addMeta.metano == 'undefined') {
-	  addMeta.metano = 0;
-      }
-      addMeta.metano += 1;
-      metadiv=document.getElementById("meta");
-      newtab=document.createElement('div');
-      newtab.id = 'meta' + addMeta.metano;
-      newtab.innerHTML = addOneMeta(addMeta.metano);
-      metadiv.appendChild(newtab);
-      return false;
-  }
-
-  function removeElement(node) {
-      node.parentNode.removeChild(node);
-  }
-
-</script>
-
-$if edit:
-  <h2>Editing a dataset</h2>
-$else:
-  <h2>Add new dataset</h2>
-
-$if post and edit:
-  <p>Thank you for the update. You can look at this dataset
-  $:link_to_dataset_id(getbase(), id, "here").</p>
-$elif post:
-  <p>Thank you for the addition. You can look at this dataset
-  $:link_to_dataset_id(getbase(), id, "here").</p>
-$else:
-  <p>
-    <form action="" method="post" class="donateform" name="form">
-      <h4>Data set properties</h4>
-      $:form.render()
-      <hr/>
-      <h4>Networks</h4>
-      <div id="networks">
-	$for f in netforms:
-          $:f.render()
-      </div>
-      <p><button id="addnet" onClick="addNet(); return false;">
-	  Add network</button></p>
-      <hr/>
-      <h4>Attributes</h4>
-      <div id="meta">
-      $for f in metaforms:
-        $:f.render()
-      </div>
-      <p><button id="addmeta" onClick="addMeta(); return false;">
-	  Add attribute</button></p>
-      <hr/>
-      <button id="Add">Add/update data set</button>
-    </form>
-    <script type="text/javascript">
-      document.form.focused.focus();
-    </script>
-  </p>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/addblog.html igraph-0.6.5/nexus/cgi-bin/templates/addblog.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/addblog.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/addblog.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-$def with (form, id, added, edit)
-
-$if edit and not added:
-  <h3>Editing blog entry</h3>
-  <form action="" method="post" class="donateform" name="form">
-    $:form.render()
-  </form>
-
-$if not edit and not added:
-  <h3>Add new blog entry</h3>
-  <form action="" method="post" class="donateform" name="form">
-    $:form.render()
-  </form>
-
-$if edit and added:
-  <p>Thank you for your edit, you can look at this blog entry
-    <a href="$:getbase()/web/blog?id=$id&admin=true">here</a>.
-  </p>
-
-$if not edit and added:
-  <p>Thank you for your blog entry, you can look at it 
-    <a href="$:getbase()/web/blog?id=$id&admin=true">here</a>.
-  </p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/addlicence.html igraph-0.6.5/nexus/cgi-bin/templates/addlicence.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/addlicence.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/addlicence.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-$def with (form, post, edit, id)
-
-$if edit:
-  <h2>Editing a licence</h2>
-$else:
-  <h2>Add new licence</h2>
-
-$if post and edit:
-  <p>Licence was updated. You can look at it 
-    $:link_to_licence(getbase(), id, 'here').</p>
-$elif post:
-  <p>Licence was added. You can look at it 
-    $:link_to_licence(getbase(), id, 'here').</p>
-$else:
-  <p>
-    <form action="" method="post" class="donateform" name="form">
-      $:form.render()
-    </form>
-    <script type="text/javascript">
-      document.form.focused.focus();
-    </script>
-  </p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/admin.html igraph-0.6.5/nexus/cgi-bin/templates/admin.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/admin.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/admin.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-$def with ()
-
-<h2>Administration</h2>
-<h3>Datasets</h3>
-<h4><a href="$:getbase()/web/add">Add a new dataset</a></h4>
-<h4><a href="$:getbase()/web/checkall">Check all data sets</a></h4>
-<h4><a href="$:getbase()/web/recreateall/graphml">Recreate GraphML 
-    files</a></h4>
-<h4><a href="$:getbase()/web/recreateall/python-igraph">Recreate 
-    Python-igraph files</a></h4>
-<h4><a href="$:getbase()/web/updatefilesize">Update file size information
-    </a></h4>
-
-<h3>Licences</h3>
-<h4><a href="$:getbase()/api/licence">List and edit licences</a></h4>
-<h4><a href="$:getbase()/web/addlicence">Add a new licence</a></h4>
-
-<h3>Data formats</h3>
-<h4><a href="$:getbase()/api/format">List and edit data formats</a></h4>
-
-<h3>Blog</h3>
-<h4><a href="$:getbase()/web/addblog">Add a blog entry</a></h4>
-<h4><a href="$:getbase()/web/blog?admin=true">Unpublished blog 
-    entries</a></h4>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/atom_index.html igraph-0.6.5/nexus/cgi-bin/templates/atom_index.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/atom_index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/atom_index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-$def with (datasets, tags, title, date, home, link)
-<?xml version="1.0" encoding="utf-8"?>
-<feed xmlns="http://www.w3.org/2005/Atom">
-  <title>$title</title>
-  <link href="$home/$link"/>
-  <updated>$date</updated>
-  <author>
-    <name>The Nexus team</name>
-    <email>nexus@igraph.org</email>
-  </author>
-  
-  $for ds in datasets:
-  <entry>
-    <title>$ds.name [$ds.sid]</title>
-    <link href="$home$url_for_dataset(getbase(), ds)"/>
-    <id>tag:nexus.igraph.org,${ds.date[0:10]}:/dataset/$ds.id</id>
-    <updated>$ds.date</updated>
-    <content><![CDATA[$ds.description]]></content>
-  </entry>
-</feed>
-  
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/base.html igraph-0.6.5/nexus/cgi-bin/templates/base.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/base.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/base.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,139 +0,0 @@
-$def with (page)
-
-<html>
-<head>
-    $if page.has_key('title'):
-        <title>$page.title</title>
-    $else:
-        <title>Nexus</title>
-    <link rel="stylesheet" href="$:getbase()/static/general.css" 
-	  type="text/css"/>
-    <link rel="icon" type="image/png" 
-	  href="$:getbase()/static/nexus_logo_black_small.png" />
-</head>
-<body class="home">
-  <div id="wrapper" class="hfeed">
-    <div id="header">
-      <div id="masthead">
-	<div id="branding" role="banner">
-	  <h1 id="site-title">
-	    <span>	      
-	      <a href="$:getbase()/" title="Nexus" rel="home">Nexus</a>
-	    </span>
-	  </h1>
-	  <div id="site-description">THE NETWORK REPOSITORY</div>
-	  <div id="site-motto">$:get_motto()</div>
-	</div><!-- #branding -->
-	<div id="access" role="navigation">
-	  <div class="skip-link screen-reader-text">
-	    <a href="#content" title="Skip to content">
-	      Skip to content
-	    </a>
-	  </div>
-	  <div class="menu"><ul>
-	      <!-- <li class="page_item"> -->
-	      <!-- 	<a href="$:getbase()/web/search" title="Search">Search</a> -->
-	      <!-- </li> -->
-	      <li class="page_item">
-		<a href="$:getbase()/api/dataset_info" 
-		   title="Browse data sets">Browse
-		</a>
-	      </li>
-	      <!-- <li class="page_item"> -->
-	      <!-- 	<a href="$:getbase()/advanced" title="Advanced search"> -->
-	      <!-- 	Advanced search</a> -->
-	      <!-- </li> -->
-	      <li class="page_item">
-		<a href="$:getbase()/web/donate" title="Help Nexus">
-		  Donate data</a>
-	      </li>
-	      <li class="page_item">
-	      	<a href="$:getbase()/web/blog" 
-		   title="What are we working on?">Blog</a>
-	      </li>
-	      <!-- <li class="page_item"> -->
-	      <!-- 	<a href="$:getbase()/about" title="What is Nexus?">About</a> -->
-	      <!-- </li> -->
-	      <li class="page_item">
-		<a href="$:getbase()/web/docs" title="The Nexus API">
-		  Documentation</a>
-	      </li>
-	      <li class="page_item">
-		<a href="$:getbase()/web/feedback" title="Write to us">
-		  Feedback</a>
-	      </li>
-	      $if check_safe(redirect=False) and not check_loggedin():
-	        <li class="page_item">
-		  <a href="$:getbase()/web/login" title="Login">
-		    Login
-		  </a>
-		</li>
-	      $if check_admin(redirect=False):
-	        <li class="page_item">
-		  <a href="$:getbase()/web/admin" title="Admin">
-		    Admin
-		  </a>
-		</li>
-	      $if check_safe(redirect=False) and check_loggedin():
-	        <li class="page_item">
-		  <a href="$:getbase()/web/logout" title="Logout">
-		    Logout
-		  </a>
-		</li>
-	  </ul></div>	 
-	</div><!-- #access -->
-      </div><!-- #masthead -->
-    </div><!-- #header -->
-    
-    <div id="main">
-      <div id="container">
-	<div id="content" role="main">
-	  <div id="post-34" class="post-34 page type-page hentry">
-		$:page
-	    </div><!-- entry-content -->
-	  </div><!-- post-34 -->
-	</div><!-- content -->
-	<div class="search" id="search">
-	    <div class="title">
-	      <h2>Search Nexus</h2>
-	    </div>
-	    <form action="$:getbase()/api/search" method="get"
-		  id="searchform">
-	      <input type="text" name="q" size="31" 
-		     $if page.has_key('searchvalue'):
-		       value="$page['searchvalue']"
-		     />
-	      <button id="Go">Go</button>
-	    </form>
-	</div>
-      <div id="secondary" class="widget-area" role="complementary">
-	<div class="feed">
-	  <a href="$:getbase()/api/dataset_info?format=atom">
-	    <img src="$:getbase()/static/images/feed-icon-14x14.png" />
-	  </a>
-	</div>
-	<div class="title">
-	  <h2> What's new? </h2>
-	</div>
-	<div class="whatsnew">
-	  $:get_whatsnew()
-	</div>
-      </div><!-- #secondary .widget-area -->
-      <div id="tertiary" class="widget-area" role="complementary">
-	<h2> Data tags </h2>
-	$:get_datatags()
-      </div>
-    </div><!-- main -->
-    <div id="footer" role="contentinfo">
-      <div id="colophon">
-	<div id="site-info">
-	  <a href="$:getbase()/" title="Nexus" rel="home">
-	    &copy; 2011-2012 The Nexus team
-	  </a>
-	</div><!-- #site-info -->
-      </div><!-- #colophon -->
-    </div><!-- #footer -->
-  </div><!-- wrapper -->
-
-</body>
-</html>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/blog.html igraph-0.6.5/nexus/cgi-bin/templates/blog.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/blog.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/blog.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-$def with (entries, id)
-
-<h2>Blog</h2>
-
-$for e in entries:
-  <div class="title"><h3>$e.title
-      $if openid.status():
-        <span class="edit">
-	  <a href="$:getbase()/web/editblog/$e.id">[edit]</a>
-	</span>
-  </h3></div>
-  <div class="blogentry">
-    <p class="blogauthor">$e.author</p>
-    <p class="blogdate">$e.date</p>
-    <p class="blogsummary">
-      $if id is None:
-        $:mymarkdown(e.entry, 20)
-      $else:
-        $:markdown(e.entry)
-    </p>
-  </div>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/check.html igraph-0.6.5/nexus/cgi-bin/templates/check.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/check.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/check.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,21 +0,0 @@
-$def with (id, ds, checkres)
-
-<h2>Checking dataset '$:{link_to_dataset(getbase(), ds)}'</h2>
-
-$for format, result in checkres.items():
-  <h3>$format</h3>
-
-  $if result is None:
-    <span class="checkvalue failure">No check routine implemented for this format</span>.
-  $else:
-    <ul>
-    $for key, value in result.items():
-      <li>$key: 
-        $if type(value) == type('a'):
-          <span class="checkvalue failure">$value</span>.
-        $elif value:
-          <span class="checkvalue">OK</span>.
-        $else:
-          <span class="checkvalue failure">Error</span>.
-      </li>
-    </ul>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/checkall.html igraph-0.6.5/nexus/cgi-bin/templates/checkall.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/checkall.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/checkall.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-$def with ()
-
-<h1>Checking all data sets</h1>
-
-<iframe src="$:getbase()/web/checkall2" width="100%" height="100%"></iframe>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/dataset.html igraph-0.6.5/nexus/cgi-bin/templates/dataset.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/dataset.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/dataset.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,90 +0,0 @@
-$def with (ds, tags, meta, formats, papers, networks=[])
-
-<div class="title"><h2>$ds.name [$ds.sid]
-$if check_admin(redirect=False):
-    <span class="edit">
-      <a href="$:getbase()/web/edit/$ds.id">[edit]</a>
-      <a href="$:getbase()/web/check/$ds.id">[check]</a>
-      <a href="$:getbase()/web/delete/$ds.id">[delete]</a>
-      <a href="$:getbase()/web/recreate/$ds.id">[recreate]</a>
-    </span>
-</h2></div>
-
-<div class="dataset">
-<p class="datasettags2">
-  $if ds.nnets > 1:
-    $ds.nnets networks,
-  $if ds.minv==ds.maxv:
-    $ds.minv
-  $else:
-    $ds.minv-$ds.maxv
-  vertices, 
-  $if ds.mine==ds.maxe:
-    $ds.mine
-  $else:
-    $ds.mine-$ds.maxe 
-  edges.
-  Tags:
-  $:", ".join(link_to_tag(getbase(), tag) for tag in tags)
-<p class="datasetdate2">$ds.date</p>
-
-<p>$ds.shortdescription</p>
-
-<h3>Download</h3>
-<ul class="download">
-$for k,f in dataformats.items():
-  <li>
-  <span style="width:35px;float:left;">
-    $if k in formats.keys():
-      <a href="$:getbase()/api/dataset?id=${ds.id}&format=$k">
-      <img src="$:getbase()/static/images/formats/${k}.png" 
-	   style="display:block;height:20px;margin-left:auto;margin-right:auto;" 
-	   alt="" title="Download in $k format" /></a>
-  </span>
-  $if k in formats.keys():
-    <a href="$:getbase()/api/dataset?id=${ds.id}&format=$k">${k} format</a> 
-    ($pretty_size(formats[k].size)) &ndash; $formats[k].shortdesc,
-    <a href="$:getbase()/api/format?dataformat=$k&format=html">more...</a>
-  </li>
-  
-</ul>
-
-<h3>Description</h3>
-<div class="datasetdescription">
-$:markdown(ds.description)
-</div>
-
-$if ds.nnets > 1 and len(networks) > 1:
-  <h3>Networks</h3>
-  <dl class="networks">
-  $for net in networks:
-    <dt>($net.id) '$net.sid'</dt>
-    <dd>$net.vertices vertices, $net.edges edges. $net.description</dd>
-    
-
-$if len(meta) > 0:
-  <h3>Metadata</h3>
-  <dl class="metadata">
-  $for m in meta:
-    <dt>$m.type.capitalize() attribute '$m.name'</dt>
-    <dd>
-      $if m.network=='NULL' and len(networks) > 1:
-        (all)
-      $elif len(networks) > 1:
-        ($m.network)
-      $m.description
-    </dd>
-  </dl>
-
-$if len(papers) > 0:
-  <h3>Publication(s)</h3>
-  $for p in papers:
-    <p>$p.citation</p>
-
-<h3>Source</h3>
-<p>$:makelinks(ds.source)</p>
-
-<h3>Licence</h3>
-<p><a href="$ds.licence_url">$ds.licence_name</a></p>
-
-</div>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/datatags.html igraph-0.6.5/nexus/cgi-bin/templates/datatags.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/datatags.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/datatags.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-$def with (tags)
-
-<div class="tags">
-$for t in tags:
-  <span class="tag$t.count">
-    $:link_to_tag(getbase(), t)
-  </span>
-</div>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/delete.html igraph-0.6.5/nexus/cgi-bin/templates/delete.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/delete.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/delete.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-$def with ()
-Dataset was deleted.
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/docs.html igraph-0.6.5/nexus/cgi-bin/templates/docs.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/docs.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/docs.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-$def with (cc)
-
-<div class="docs">
-$:cc
-</div>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/donate.html igraph-0.6.5/nexus/cgi-bin/templates/donate.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/donate.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/donate.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-$def with (form, post, captchaok, sentok)
-
-<h2>Donate data</h2>
-
-$if not post:
-  <p>
-    Your contribution is very important for us. Please only donate a
-    data set that you are allowed to share, either because it is yours,
-    or the original author published it under a licence that permits
-    it.
-  </p>
-
-  <p>
-    Please fill the following form to donate your data set. The data
-    itself must be placed on an FTP or web server, and you will be asked
-    to provide its FTP or Web address below. If you want to send your data
-    in email, please leave this field empty and we will contact you.
-  </p>
-
-  <p>
-    <form action="" method="post" class="donateform" name="form">
-      $:form.render()
-    </form>
-    <script type="text/javascript">
-      document.form.focused.focus();
-    </script>
-  </p>
-$else:
-  $if not captchaok:
-    <p class="error">
-      Please type in the two words at the bottom of the form correctly.
-      This is required for sending your messsage.
-    </p>
-    <p>
-      <form action="" method="post" class="failedcaptcha">
-	$:form.render()
-      </form>
-    </p>
-  $else:
-    $if sentok:
-      <p>
-        Thank you very much for your contribution! We will contact you
-        via email once your data set has been added to our database.
-      </p>
-      <p><a href="$:getbase()/">Return to the start page.</a></p>
-    $else:
-      <p>
-        We experience some technical difficulties right now and cannot send
-        your message. Your contribution is very important for us, so please try
-        sending it again in a couple of minutes.
-      </p>
-      <p>
-        <form action="" method="post">
-       	  $:form.render()
-        </form>
-      </p>
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/error.html igraph-0.6.5/nexus/cgi-bin/templates/error.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/error.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/error.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-$def with (code)
-
-<p>
-Page not found. Sorry about that.
-</p>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/feedback.html igraph-0.6.5/nexus/cgi-bin/templates/feedback.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/feedback.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/feedback.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-$def with (form)
-
-<h2>Feedback</h2>
-
-<p>
-  Do you have a comment or a question? Have you noticed a mistake in the data?
-  Please let us know!
-</p>
-
-<p>
-<form action="" method="post" class="donateform">
-  $:form.render()
-</form>
-</p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/feedback_ok.html igraph-0.6.5/nexus/cgi-bin/templates/feedback_ok.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/feedback_ok.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/feedback_ok.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-$def with (form, captcha, success)
-
-<h2>Feedback</h2>
-
-$if captcha:
-  $if success:
-    <p> 
-      Your message has been successfully sent. Thank you for your
-      feedback!
-    </p>
-    <p><a href="$:getbase()/">Return to the start page.</a></p>
-  $else:
-    <p>
-      We experience some technical difficulties right now and cannot
-      send your message. Your feedback is important for us, please try
-      sending it again in a couple of minutes.
-    </p>
-    <p>
-      <form action="" method="post" class="donateform">
-	$:form.render()
-      </form>
-    </p>
-$else:
-  <p class="error">
-    Please type in correctly the two words at the bottom of the
-    form. This is required for sending your messsage.
-  </p>
-  <p>
-    <form action="" method="post" class="failedcaptcha donateform">
-      $:form.render()
-    </form>
-  </p>
-
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/format.html igraph-0.6.5/nexus/cgi-bin/templates/format.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/format.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/format.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,13 +0,0 @@
-$def with (formats)
-
-$if formats:
-  $for data in formats:
-    <h2>$data.name data format</h2>
-    <p>$data.shortdesc</p>
-    <h3>Description</h3>
-    <p>$data.description</p>
-    <h3>More information</h3>
-    <p><a href="$data.link">$data.link</a></p>
-$else:
-  <p>Unknown data format.</p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/index.html igraph-0.6.5/nexus/cgi-bin/templates/index.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,53 +0,0 @@
-$def with (datasets, tags, title, feed, nohits, start, end, limit, user_input, searchvalue)
-
-$if searchvalue is not None:
-  $var searchvalue: $searchvalue
-
-$if feed:
-  <div class="feed">
-    <a href="$feed">
-      <img src="$:getbase()/static/images/feed-icon-28x28.png" />
-    </a>
-  </div>
-
-<div class="title">
-<h3>$:title</h3>
-</div>
-
-<div style="clear:left"></div>
-
-$if len(datasets)==0:
-  <p>No data sets found.</p>
-$else:
-  <p>Results $start - $end out of $nohits.</p>
-  <ul class="datasets">
-  $for ds in datasets:
-    <li>
-      <h4>$:link_to_dataset(getbase(), ds, caption=u"\u25b6 %s [%s]" % (ds.name, ds.sid))
-      </h4>
-      <p class="datasettags">
-	$ds.date,
-	$if ds.nnets > 1:
-	  $ds.nnets networks,
-	$if ds.minv==ds.maxv:
-	  $ds.minv
-	$else:
-	  $ds.minv-$ds.maxv
-	vertices, 
-	$if ds.mine==ds.maxe:
-	  $ds.mine
-	$else:
-	  $ds.mine-$ds.maxe 
-	edges.
-	Tags:
-	$:", ".join(link_to_tag(getbase(), tag) for tag in tags[ds.id])
-      </p>
-      <div class="datasetdescription">
-	$:mymarkdown(ds.shortdescription)
-      </div>
-    </li>
-  </ul>
-
-  <div class="prevnexttable">
-    $:prevnexttable(nohits, start, end, limit, user_input)
-  </div>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/licence.html igraph-0.6.5/nexus/cgi-bin/templates/licence.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/licence.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/licence.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-$def with (licences)
-
-<h2>Licence(s)</h2>
-
-$if licences:
-  $for lic in licences:
-    <div class="title"><h3>$lic.name
-	$if openid.status():
-	  <span class="edit">
-	    <a href="$:getbase()/web/editlicence/$lic.id">[edit]</a>
-	  </span>
-    </h3></div>
-    <div class="licence">
-      <p>$lic.text</p>
-      $if lic.fulltext:
-        <h4>Full text</h4>
-        <p>$lic.fulltext</p>
-      $if lic.link:
-        <p><a href="$lic.link">$lic.link</a></p>
-    </div>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/login.html igraph-0.6.5/nexus/cgi-bin/templates/login.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/login.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/login.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-$def with (form)
-
-<p>
-<form action="" method="post" class="loginform">
-  $:form.render()
-</form>
-</p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/loginfailed.html igraph-0.6.5/nexus/cgi-bin/templates/loginfailed.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/loginfailed.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/loginfailed.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-$def with ()
-
-
-<h2>Log in failure</h2>
-
-<p>Log in failed. Either this is not a proper OpenID, or it is not
-  registered at Nexus.</p>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/logout.html igraph-0.6.5/nexus/cgi-bin/templates/logout.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/logout.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/logout.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,4 +0,0 @@
-$def with ()
-
-<p>You have been logged out.</p>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/recreate.html igraph-0.6.5/nexus/cgi-bin/templates/recreate.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/recreate.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/recreate.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-$def with (id, name="")
-
-<p>
-  Dataset $name was recreated, you take a look at it 
-  $:link_to_dataset_id(getbase(), int(id), "here").
-</p>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/recreateall.html igraph-0.6.5/nexus/cgi-bin/templates/recreateall.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/recreateall.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/recreateall.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-$def with (format)
-
-<h1>Recreating all data sets (format $format)</h1>
-
-<iframe src="$:getbase()/web/recreateall/!$format" width="100%" 
-	height="100%"></iframe>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/rss_index.html igraph-0.6.5/nexus/cgi-bin/templates/rss_index.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/rss_index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/rss_index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,24 +0,0 @@
-$def with (datasets, tags, title, date, home, link)
-<?xml version="1.0"?>
-<rss version="2.0">
-   <channel>
-      <title>$title</title>
-      <link>$home/$link</link>
-      <description>Repository of network data sets.</description>
-      <language>en-us</language>
-      <pubDate>$date</pubDate>
-
-      <lastBuildDate>$date</lastBuildDate>
-      <generator>Nexus repository</generator>
-      <managingEditor>nexus@igraph.org</managingEditor>
-      <webMaster>webmaster@igraph.org</webMaster>
-
-      $for ds in datasets
-      <item>
-         <title>$ds.name [$ds.sid]</title>
-         <link>$home/$url_for_dataset(getbase(), ds)</link>
-         <description><![CDATA[$ds.description]]></description>
-         <pubDate>$ds.date</pubDate>
-      </item>
-    </channel>
-</rss>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_dataset.html igraph-0.6.5/nexus/cgi-bin/templates/text_dataset.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_dataset.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/text_dataset.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-$def with (ds)
-$:ds
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_formats.html igraph-0.6.5/nexus/cgi-bin/templates/text_formats.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_formats.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/text_formats.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-$def with (formats)
-$:formats
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_index.html igraph-0.6.5/nexus/cgi-bin/templates/text_index.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/text_index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/text_index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,12 +0,0 @@
-$def with (datasets, tags, length, count, offset, limit, title, networks)
-size: $length
-totalsize: $count
-offset: $offset
-limit: $limit
-$for ds in datasets:
-  id: $ds.id
-  sid: $ds.sid
-  name: $:ds.name
-  networks: $:{" ".join("%s/%s" % (n.id,n.sid) for n in networks[ds.id])}
-  vertices/edges: $:{" ".join("%s/%s" % (n.vertices,n.edges) for n in networks[ds.id])}
-  tags: $tags[ds.id]
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/whatsnew.html igraph-0.6.5/nexus/cgi-bin/templates/whatsnew.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/whatsnew.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/whatsnew.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,8 +0,0 @@
-$def with (what)
-
-<ul class="whatsnew">
-$for t in what:
-  <li><h4>$:link_to_dataset(getbase(), t)</h4>
-    <p class="wndate">$t.date</p>
-    $:mymarkdown(t.shortdescription, 2)</li>
-</ul>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_dataset.html igraph-0.6.5/nexus/cgi-bin/templates/xml_dataset.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_dataset.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/xml_dataset.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-$def with (ds, tags, meta, formats, papers, networks)
-<?xml version="1.0"?>
-<dataset>
-  <id>$ds.id</id>
-  <sid>$ds.sid</sid>
-  <name>$ds.name</name>
-  <shortdescription>
-    $ds.shortdescription
-  </shortdescription>
-  <description>$ds.description</description>
-  <networks>
-    $for net in networks:
-      <network>
-	<id>$net.id</id>
-	<sid>$net.sid</sid>
-	<vertices>$net.vertices</vertices>
-	<edges>$net.edges</edges>
-	<description>$net.description</description>
-      </network>
-  </networks>
-  <tags>
-    $for t in tags:
-      <tag>$t.tag</tag>
-  </tags>
-  <attributes>
-    $for m in meta:
-      <attribute>
-	<name>$m.name</name>
-	<type>$m.type</type>
-	<datatype>$m.datatype</datatype>
-	<description>
-	  $m.description
-	</description>
-      </attribute>
-  </attributes>
-  <date>${ds.date[0:10]}</date>
-  <licence>$ds.licence</licence>
-  <licenceurl>$ds.licence_url</licenceurl>
-  <papers>
-    $for p in papers:
-      <paper>$p.citation</paper>
-  </papers>
-  <formats>
-    $for f,fv in formats.items():
-    <format><name>$f</name><size>$fv.size</size></format>
-  </formats>
-</dataset>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_formats.html igraph-0.6.5/nexus/cgi-bin/templates/xml_formats.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_formats.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/xml_formats.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,11 +0,0 @@
-$def with (formats)
-<?xml version="1.0"?>
-<dataformats>
-$for ds in formats:
-  <dataformat>
-    <name>$ds.name</name>
-    <shortdescription>$ds.shortdesc</shortdescription>
-    <description>$ds.description</description>
-    <url>$ds.link</url>
-  </dataformat>
-</dataformats>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_index.html igraph-0.6.5/nexus/cgi-bin/templates/xml_index.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_index.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/xml_index.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-$def with (datasets, tags, length, count, offset, limit, title, networks)
-<?xml version="1.0"?>
-<datasets>
-  <size>$length</size>
-  <totalsize>$count</totalsize>
-  <offset>$offset</offset>
-  <limit>$limit</limit>
-$for ds in datasets:
-  <dataset>
-    <id>$ds.id</id>
-    <sid>$ds.sid</sid>
-    <name>$ds.name</name>
-    <description>$ds.shortdescription</description>
-    <networks>
-      $for net in networks[ds.id]:
-        <network>
-	  <id>$net.id</id>
-          <sid>$net.sid</sid>
-          <vertices>$net.vertices</vertices>
-          <edges>$net.edges</edges>
-	  <description>$net.description</description>
-	</network>
-    </networks>
-    <tags>
-    $for t in tags[ds.id]:
-      <tag>$t.tag</tag>
-    </tags>
-    <date>${ds.date[0:10]}</date>
-  </dataset>
-</datasets>
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_licence.html igraph-0.6.5/nexus/cgi-bin/templates/xml_licence.html
--- igraph-0.6.5~quantal1/nexus/cgi-bin/templates/xml_licence.html	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/templates/xml_licence.html	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-$def with (licences)
-<?xml version="1.0"?>
-<licences>
-$for lic in licences:
-  <licence>
-    <id>$lic.id</id>
-    <name>$lic.name</name>
-    <shortdescription>
-      $lic.text
-    </shortdescription>
-    <url>
-      $lic.link
-    </url>
-  $if lic.fulltext:
-    <text>
-      $lic.fulltext
-    </text>
-  </licence>
-</licences>
-
diff -Nru igraph-0.6.5~quantal1/nexus/cgi-bin/url_helper.py igraph-0.6.5/nexus/cgi-bin/url_helper.py
--- igraph-0.6.5~quantal1/nexus/cgi-bin/url_helper.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/cgi-bin/url_helper.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,72 +0,0 @@
-"""
-Helper functions for generating URLs and links.
-"""
-
-# List of symbols to be exported from this module
-__all__ = [
-    "link_to", "link_to_dataset", "link_to_dataset_id", "link_to_tag",
-    "link_to_licence", "url_for_dataset", "url_for_tag", "url_for_licence"
-]
-
-from web import websafe
-
-def link_to(url, caption):
-    """Generates a link to the given URL. `caption` is optional and may
-    specify the caption of the URL. If `caption` is ``None``, the URL itself
-    is used."""
-    if caption is None:
-        caption = url
-    return '<a href="%s">%s</a>' % (websafe(url), websafe(caption))
-
-def link_to_dataset(base, dataset, caption=None, bullet=""):
-    """Generates a link to the given dataset. `caption` is optional and may
-    specify the caption of the URL. If `caption` is ``None``, the name of
-    the dataset is used. `bullet` specifies the bullet to be shown before
-    the caption."""
-    if caption is None:
-        caption = dataset.name
-    if bullet:
-        caption = u"%s%s" % (bullet, caption)
-    return link_to(url_for_dataset(base, dataset.id), caption)
-
-def link_to_licence(base, licence, caption=None, bullet=""):
-    if caption is None:
-        caption = ""
-    if bullet:
-        caption = u"%s%s" % (bullet, caption)
-    return link_to(url_for_licence(base, licence), caption)
-
-def link_to_dataset_id(base, dataset_id, caption):
-    """Generates a link to the dataset with the given ID. `caption` specifies
-    the caption of the URL."""
-    return link_to(url_for_dataset(base, dataset_id), caption)
-
-def link_to_tag(base, tag, caption=None):
-    """Generates a link to the page of the given tag. `caption` is optional
-    and may specify the caption of the URL. If `caption` is ``None``, the
-    tag itself is used."""
-    if caption is None:
-        caption = tag.tag
-    caption = websafe(caption)
-    return link_to(url_for_tag(base, tag), caption)
-
-def url_for_dataset(base, dataset, format="html"):
-    """Returns the URL where a given dataset is to be found.
-    `dataset` is the ID of the dataset or the dataset itself, `format`
-    is the format of the dataset."""
-    if not isinstance(dataset, int):
-        dataset = dataset.id
-    return "%s/api/dataset_info?id=%s&format=%s" % (base, dataset, format)
-
-def url_for_licence(base, licence, format="html"):
-    return getbase() + "/api/licence?id=%s&format=%s" % (base, 
-                                                         licence, format)
-
-def url_for_tag(base, tag, format="html"):
-    """Returns the URL where the list of datasets with a given tag are
-    to be found. `tag` is the tag itself or any object with a ``tag``
-    attribute). `format` is the desired format of the result."""
-    if hasattr(tag, "tag"):
-        tag = tag.tag
-    return "%s/api/dataset_info?tag=%s&format=%s" % (base, tag, format)
-
diff -Nru igraph-0.6.5~quantal1/nexus/db/schema.sql igraph-0.6.5/nexus/db/schema.sql
--- igraph-0.6.5~quantal1/nexus/db/schema.sql	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/db/schema.sql	1970-01-01 00:00:00.000000000 +0000
@@ -1,114 +0,0 @@
-CREATE TABLE licence (
-       id INTEGER,
-       name TEXT,
-       text TEXT,	
-       fulltext TEXT,
-       link TEXT,
-       PRIMARY KEY(id)
-);
-
-CREATE TABLE dataset (
-       id INTEGER,
-       sid TEXT,
-       name TEXT,
-       shortdescription TEXT,
-       description TEXT,
-       licence INTEGER,
-       source TEXT,
-       date TIMESTAMP DEFAULT CURRENT_TIMESTAMP,
-       downloads INTEGER,
-       PRIMARY KEY(id),
-       UNIQUE(sid),
-       FOREIGN KEY(licence) REFERENCES licence(id)
-);
-
-CREATE TABLE network (
-       dataset INTEGER,
-       id INTEGER,       
-       description TEXT,
-       vertices INTEGER,
-       edges INTEGER,
-       directed BOOLEAN,
-       bipartite BOOLEAN,
-       weighted BOOLEAN,
-       filename TEXT,
-       date TIMESTAMP DEFAULT CURRENT_TIMESTAMP,
-       PRIMARY KEY(dataset, id)
-);
-
-CREATE TABLE citation (
-       id TEXT,
-       citation TEXT,
-       PRIMARY KEY (id)
-);
-
-CREATE TABLE dataset_citation (
-       dataset INTEGER,
-       citation TEXT,
-       PRIMARY KEY(dataset, citation),
-       FOREIGN KEY(dataset) REFERENCES dataset(id),
-       FOREIGN KEY(citation) REFERENCES citation(id)
-);
-
-CREATE TABLE tag (
-       id INTEGER,
-       tag TEXT,
-       description TEXT,
-       PRIMARY KEY(id)
-);
-
-CREATE TABLE dataset_tag (
-       dataset INTEGER,
-       tag INTEGER,
-       PRIMARY KEY(dataset, tag),
-       FOREIGN KEY(dataset) REFERENCES dataset(id),
-       FOREIGN KEY(tag) REFERENCES tag(id)
-);
-
-CREATE TABLE format (
-       name VARCHAR(20),
-       shortdesc VARCHAR(100),
-       description TEXT,
-       link VARCHAR(200),
-       extension VARCHAR(20),
-       PRIMARY KEY(name)
-);
-
-CREATE TABLE metadata (
-       dataset INTEGER,
-       network INTEGER,
-       type VARCHAR(10),
-       datatype VARCHAR(10),
-       name VARCHAR(30),
-       description TEXT,
-       PRIMARY KEY(dataset, network, type, name),
-       FOREIGN KEY(dataset, network) REFERENCES network(dataset, network)
-);
-
-CREATE TABLE filesize (
-       dataset INTEGER,
-       format VARCHAR(20),
-       size INTEGER,
-       PRIMARY KEY(dataset, format),
-       FOREIGN KEY(dataset) REFERENCES dataset(id),
-       FOREIGN KEY(format) REFERENCES format(name)
-);
-
-CREATE TABLE user (
-       name TEXT,
-       openid TEXT,
-       admin BOOLEAN,
-       PRIMARY KEY(openid),
-       UNIQUE(name)
-);
-
-CREATE TABLE blog (
-       id INTEGER,
-       date TIMESTAMP DEFAULT CURRENT_TIMESTAMP,
-       author TEXT,
-       title TEXT,
-       entry TEXT,
-       published INTEGER,
-       PRIMARY KEY(id),
-       FOREIGN KEY(author) REFERENCES user(name)
-);
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/db/test.db and /tmp/mkpaUile3f/igraph-0.6.5/nexus/db/test.db differ
diff -Nru igraph-0.6.5~quantal1/nexus/db/testdata.sql igraph-0.6.5/nexus/db/testdata.sql
--- igraph-0.6.5~quantal1/nexus/db/testdata.sql	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/db/testdata.sql	1970-01-01 00:00:00.000000000 +0000
@@ -1,83 +0,0 @@
--- Test data
-
-INSERT INTO licence (id, name, text, link) VALUES(1, 'CC-ASA 2.0 UK', 
-       'Creative Commons Attribution-ShareAlike 2.0 UK: England & Wales',
-       'http://creativecommons.org/licenses/by-sa/2.0/uk/');
-INSERT INTO licence (id, name, text, link) VALUES(2, 'Public Domain',
-       'In the Public Domain', 'http://en.wikipedia.org/wiki/Public_domain');
-
-INSERT INTO dataset (id, sid, name, shortdescription, description, licence, 
-                     source) 
-       VALUES(1, 'karate', 'Zachary''s karate club',
-       'Social network of a karate club',
-       'Social network of a karate club', 2, 'Publication');
-INSERT INTO dataset (id, sid, name, shortdescription, description, licence, 
-                     source) 
-       VALUES(2, 'UKfaculty', 'UK faculty social network',
-       'Social network among faculty members at a UK university',
-       'Social network among faculty members at a UK university', 1,
-       'http://www.cs.rhul.ac.uk/home/tamas/research/datasets/');
-
-INSERT INTO network (dataset, id, description, vertices, edges, filename)
-       VALUES(1, 1, NULL, 34, 78, 'karate');
-INSERT INTO network (dataset, id, description, vertices, edges, filename)
-       VALUES(2, 1, NULL, 81, 817, 'UKfaculty');
-
-INSERT INTO citation VALUES(1, 'W. W. Zachary, An information flow model for conflict and fission in small groups, Journal of Anthropological Research 33, 452-473 (1977)');
-
-INSERT INTO citation VALUES(2, 'Nepusz T., Petróczi A., Négyessy L., Bazsó F.: Fuzzy communities and the concept of bridgeness in complex networks. Physical Review E 77:016107, (2008)');
-
-INSERT INTO dataset_citation VALUES(1, 1);
-INSERT INTO dataset_citation VALUES(2, 2);
-
-INSERT INTO tag VALUES(1, 'weighted', 'The network has weighted edges.');
-INSERT INTO tag VALUES(2, 'bipartite', 
-       'Bipartite, in other words, two-mode network.');
-INSERT INTO tag VALUES(3, 'undirected', 'Edges do not have directions.');
-INSERT INTO tag VALUES(4, 'directed', 'Edges have directions.');
-
-INSERT INTO dataset_tag VALUES(1, 1);
-INSERT INTO dataset_tag VALUES(1, 3);
-INSERT INTO dataset_tag VALUES(2, 1);
-INSERT INTO dataset_tag VALUES(2, 4);
-
-INSERT INTO metadata values (1, 1, 'vertex', 'string', 'name', 
-       'Names of the actors. These are pseudonyms and only serve to identify the two distinguished actors of the network: Mr Hi and John A.');
-INSERT INTO metadata values (1, 1, 'vertex', 'numeric', 'Faction',
-       'Either 1 or 2, giving the faction of the actor after the split of the club.');
-INSERT INTO metadata values (1, 1, 'edge', 'numeric', 'weight', 
-       'Edge weights, the number of common activities the two club members took part of.');
-
-INSERT INTO metadata values (2, 1, 'vertex', 'numeric', 'Group',
-       'The numeric ID of the school affiliation');
-INSERT INTO metadata values (2, 1, 'edge', 'numeric', 'weight',
-       'Edge weights, based on the questionnaire');
-
-INSERT INTO format VALUES('R-igraph', 
-       'Rdata file for use with the igraph R package',
-       'igraph is an R package for network analysis, with support for large graphs. This data file can be loaded into an R session via the ''load'' function, after loading the igraph package itself using the ''library'' function. See the igraph homepage for details.', 
-       'http://igraph.sourceforge.net', '.Rdata');
-
-INSERT INTO format VALUES('GraphML',
-       'XML-based graph description language',
-       'GraphML is an XML-based file format (an XML application in the XML terminology) to describe graphs. It is a modern format, and can store graphs with an extensible set of vertex and edge attributes', 
-       'http://graphml.graphdrawing.org', '.graphml');
-
-INSERT INTO format VALUES('Pajek',
-       'File format of the program Pajek',
-       'Pajek it a popular network analysis program for Windows. Note that the Pajek data format does not support arbitrary attributes, so some of the metadata might be missing from the data file if you choose this format.',
-       'http://vlado.fmf.uni-lj.si/pub/networks/pajek/', '.net');
-
-INSERT INTO format VALUES('Excel',
-       'Excel workbook containing all network and metadata',
-       'This is a standard file for MS Excel, and other tools capable of reading it, e.g. LibreOffice. The first worksheet includes the network itself and the edge metadata. The second worksheet contains the vertex metadata, if available. The third worksheet contains graph-level data.',
-       'http://office.microsoft.com/en-us/excel/', '.xls');
-
-INSERT INTO format VALUES('Python-igraph',
-       'Pickled Python object for use with the igraph Python module',
-       'igraph is a Python module for network analysis, with support for large graphs. This file can be loaded from a Python script using the ''load'' function of the ''pickle'' module if you have installed the ''igraph'' module before. See the igraph homepage for details.',
-       'http://igraph.sourceforge.net', '.pickle');
-
-INSERT INTO user VALUES('gabor.csardi', 
-       'https://launchpad.net/~gabor.csardi', 1);
-INSERT INTO user VALUES('ntamas', 'https://launchpad.net/~ntamas', 1);
diff -Nru igraph-0.6.5~quantal1/nexus/db/users-schema.sql igraph-0.6.5/nexus/db/users-schema.sql
--- igraph-0.6.5~quantal1/nexus/db/users-schema.sql	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/db/users-schema.sql	1970-01-01 00:00:00.000000000 +0000
@@ -1,18 +0,0 @@
-CREATE TABLE session (
-       session_id CHAR(128) UNIQUE NOT NULL,
-       atime TIMESTAMP NOT NULL DEFAULT CURRENT_TIMESTAMP,
-       data TEXT
-);
-
-CREATE TABLE users (
-       username TEXT UNIQUE NOT NULL,
-       password CHAR(32) NOT NULL,
-       admin BOOLEAN NOT NULL DEFAULT False
-);
-
-INSERT INTO users (username, password, admin) 
-       VALUES ('csardi', '', 1);
-
-INSERT INTO users (username, password, admin)
-       VALUES ('testuser', '', 0);
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/adjnoun.R igraph-0.6.5/nexus/download/adjnoun.R
--- igraph-0.6.5~quantal1/nexus/download/adjnoun.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/adjnoun.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/adjnoun.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "adjnoun.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip adjnoun.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/adjnoun.txt"))
-gml <- paste(sep="", tmp, "/adjnoun.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$Adjnoun <- V(g)$value
-g <- remove.vertex.attribute(g, "value")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-g$name <- "Word adjacencies from David Copperfield"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)"
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- "The network of common adjective and noun adjacencies for the novel 'David Copperfield' by Charles Dickens, as described by M. Newman.  Nodes represent the most commonly occurring adjectives and nouns in the book.  Node values are 0 for adjectives and 1 for nouns.  Edges connect any pair of words that occur in adjacent position in the text of the book.  Please cite M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E 74, 036104 (2006)"
-
-adjnoun <- g
-save(adjnoun, file="/tmp/adjnoun.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/anna.R igraph-0.6.5/nexus/download/anna.R
--- igraph-0.6.5~quantal1/nexus/download/anna.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/anna.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-
-source("sgb-coappearance.R")
-
-tmp <- tempdir()
-annakarenina <-
-  getnet("http://mirror.switch.ch/ftp/mirror/tex/support/graphbase/anna.dat")
-
-annakarenina$name <- "Anna Karenina coappearance network"
-save(annakarenina, file="/tmp/annakarenina.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/astro.R igraph-0.6.5/nexus/download/astro.R
--- igraph-0.6.5~quantal1/nexus/download/astro.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/astro.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/astro-ph.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "astro-ph.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip astro-ph.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/astro-ph.txt"))
-gml <- paste(sep="", tmp, "/astro-ph.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "Astrophysics collaborations"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-astrocollab <- g
-save(astrocollab, file="/tmp/astrocollab.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/bkfrat.R igraph-0.6.5/nexus/download/bkfrat.R
--- igraph-0.6.5~quantal1/nexus/download/bkfrat.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/bkfrat.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/bkfrat.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "bkfrat.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/bkfrat.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat1 <- mat[1:(length(mat)/2)]
-mat2 <- mat[(length(mat)/2+1):length(mat)]
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-
-library(igraph)
-g1 <- graph.adjacency(mat1, weighted=TRUE, mode="undirected")
-g2 <- graph.adjacency(mat1, weighted=TRUE, mode="directed")
-
-g1$name <- "Bernard & Killworth fraternity, BKFRAB"
-g2$name <- "Bernard & Killworth fraternity, BKFRAC"
-g1$Author <- g2$Author <- "H. Bernard H and P. Killworth"
-g1$Citation <- g2$Citation <- "Bernard H, Killworth P and Sailer L. (1980). Informant accuracy in social network data IV. Social Networks, 2, 191-218.\n\nBernard H, Killworth P and Sailer L. (1982). Informant accuracy in social network data V. Social Science Research, 11, 30-66.\n\nRomney K and Weller S. (1984). Predicting informant accuracy from patterns of recall among individuals. Social Networks, 6, 59-78."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-bkfrat <- list(BKFRAB=g1, BKFRAC=g2)
-save(bkfrat, file="/tmp/bkfrat.Rdata.gz")
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/bkham.R igraph-0.6.5/nexus/download/bkham.R
--- igraph-0.6.5~quantal1/nexus/download/bkham.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/bkham.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/bkham.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "bkham.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/bkham.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat1 <- mat[1:(length(mat)/2)]
-mat2 <- mat[(length(mat)/2+1):length(mat)]+1
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-diag(mat2) <- 0
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="undirected", weighted=TRUE)
-g2 <- graph.adjacency(mat2, mode="directed", weighted=TRUE)
-
-g1$name <- "Bernard & Killworth HAM radio, BKHAMB"
-g2$name <- "Bernard & Killworth HAM radio, BKHAMC"
-g1$Author <- g2$Author <- "H. Bernard H and P. Killworth"
-g1$Citation <- g2$Citation <- "Killworth B and Bernard H. (1976). Informant accuracy in social network data. Human Organization, 35, 269-286.\n\nBernard H and Killworth P. (1977). Informant accuracy in social network data II. Human Communication Research, 4, 3-18.\n\nKillworth P and Bernard H. (1979). Informant accuracy in social network data III. Social Networks, 2, 19-46."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-bkham <- list(BKHAMB=g1, BKHAMC=g2)
-save(bkham, file="/tmp/bkham.Rdata.gz")
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/bkoffice.R igraph-0.6.5/nexus/download/bkoffice.R
--- igraph-0.6.5~quantal1/nexus/download/bkoffice.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/bkoffice.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/bkoff.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "bkoff.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/bkoff.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat1 <- mat[1:(length(mat)/2)]
-mat2 <- mat[(length(mat)/2+1):length(mat)]
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-diag(mat2) <- 0
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="undirected", weighted=TRUE)
-g2 <- graph.adjacency(mat2, mode="directed", weighted=TRUE)
-
-g1$name <- "Bernard & Killworth office, BKOFFB"
-g2$name <- "Bernard & Killworth office, BKOFFC"
-g1$Author <- g2$Author <- "H. Bernard H and P. Killworth"
-g1$Citation <- g2$Citation <- "Killworth B and Bernard H. (1976). Informant accuracy in social network data. Human Organization, 35, 269-286.\n\nBernard H and Killworth P. (1977). Informant accuracy in social network data II. Human Communication Research, 4, 3-18.\n\nKillworth P and Bernard H. (1979). Informant accuracy in social network data III. Social Networks, 2, 19-46."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-bkoff <- list(BKOFFB=g1, BKOFFC=g2)
-save(bkoff, file="/tmp/bkoff.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/bktechnical.R igraph-0.6.5/nexus/download/bktechnical.R
--- igraph-0.6.5~quantal1/nexus/download/bktechnical.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/bktechnical.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/bktec.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "bktec.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/bktec.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat1 <- mat[1:(length(mat)/2)]
-mat2 <- mat[(length(mat)/2+1):length(mat)]
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-diag(mat2) <- 0
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="undirected", weighted=TRUE)
-g2 <- graph.adjacency(mat2, mode="directed", weighted=TRUE)
-
-g1$name <- "Bernard & Killworth technical research group, BKTECB"
-g2$name <- "Bernard & Killworth technical research group, BKTECC"
-g1$Author <- g2$Author <- "H. Bernard H and P. Killworth"
-g1$Citation <- g2$Citation <- "Killworth B and Bernard H. (1976). Informant accuracy in social network data. Human Organization, 35, 269-286.\n\nBernard H and Killworth P. (1977). Informant accuracy in social network data II. Human Communication Research, 4, 3-18.\n\nKillworth P and Bernard H. (1979). Informant accuracy in social network data III. Social Networks, 2, 19-46."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-bktec <- list(BKTECB=g1, BKTECC=g2)
-save(bktec, file="/tmp/bktec.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/celegans.R igraph-0.6.5/nexus/download/celegans.R
--- igraph-0.6.5~quantal1/nexus/download/celegans.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/celegans.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/celegansneural.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "celegansneural.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip celegansneural.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/celegansneural.txt"))
-gml <- paste(sep="", tmp, "/celegansneural.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "C. Elegans neural network"
-g$Author <- "Duncan Watts and Steven Strogatz from original experimental
-data by White et al."
-g$Citation <- "J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, The structure of the nervous system of the nematode C. Elegans, Phil. Trans. R. Soc. London 314, 1-340 (1986).\n\nD. J. Watts and S. H. Strogatz, Collective dynamics of `small-world' networks, Nature 393, 440-442 (1998)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-celegansneural <- g
-save(celegansneural, file="/tmp/celegansneural.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/condmat-coauthors-2003.R igraph-0.6.5/nexus/download/condmat-coauthors-2003.R
--- igraph-0.6.5~quantal1/nexus/download/condmat-coauthors-2003.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/condmat-coauthors-2003.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/cond-mat-2003.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "cond-mat-2003.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip cond-mat-2003.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/cond-mat-2003.txt"))
-gml <- paste(sep="", tmp, "/cond-mat-2003.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "Condensed matter collaborations, 2003"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).\n\nM. E. J. Newman, Fast algorithm for detecting community structure in networks, Phys. Rev. E 69, 066133 (2004)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-condmatcollab2003 <- g
-save(condmatcollab2003, file="/tmp/condmatcollab2003.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/condmat-coauthors-2005.R igraph-0.6.5/nexus/download/condmat-coauthors-2005.R
--- igraph-0.6.5~quantal1/nexus/download/condmat-coauthors-2005.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/condmat-coauthors-2005.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/cond-mat-2005.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "cond-mat-2005.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip cond-mat-2005.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/cond-mat-2005.txt"))
-gml <- paste(sep="", tmp, "/cond-mat-2005.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "Condensed matter collaborations, 2005"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).\n\nM. E. J. Newman, Fast algorithm for detecting community structure in networks, Phys. Rev. E 69, 066133 (2004)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-condmatcollab2005 <- g
-save(condmatcollab2005, file="/tmp/condmatcollab2005.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/condmat-coauthors.R igraph-0.6.5/nexus/download/condmat-coauthors.R
--- igraph-0.6.5~quantal1/nexus/download/condmat-coauthors.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/condmat-coauthors.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/cond-mat.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "cond-mat.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip cond-mat.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/cond-mat.txt"))
-gml <- paste(sep="", tmp, "/cond-mat.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "Condensed matter collaborations"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001).\n\nM. E. J. Newman, Scientific collaboration networks: I. Network construction and fundamental results, Phys. Rev. E 64, 016131 (2001).\n\nM. E. J. Newman, Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality, Phys. Rev. E 64, 016132 (2001)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-condmatcollab <- g
-save(condmatcollab, file="/tmp/condmatcollab.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/david.R igraph-0.6.5/nexus/download/david.R
--- igraph-0.6.5~quantal1/nexus/download/david.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/david.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,7 +0,0 @@
-
-source("sgb-coappearance.R")
-copperfield <-
-  getnet("http://mirror.switch.ch/ftp/mirror/tex/support/graphbase/david.dat")
-
-copperfield$name <- "David Copperfield coappearance network"
-save(copperfield, file="/tmp/copperfield.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/davis.R igraph-0.6.5/nexus/download/davis.R
--- igraph-0.6.5~quantal1/nexus/download/davis.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/davis.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/davis.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "davis.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/davis.dat"))
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^DATA:", l)-1) ]
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- as.matrix(read.table(tc))
-close(tc)
-
-rownames(mat) <- rowlab
-colnames(mat) <- collab
-
-library(igraph)
-g <- graph.incidence(mat)
-
-g$name <- "Davis's Southern club women"
-g$Author <- "Allison Davis"
-g$Citation <- "Allison Davis, Burleigh Bradford Gardner, Mary R. Gardner, Deep south: a social anthropological study of caste and class, University of Chicago Press (1941)."
-g$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-g$Description <- "These data were collected by Davis et al in the 1930s. They represent observed attendance at 14 social events by 18 Southern women."
-
-V(g)$type <- as.numeric(grepl("^E[0-9][0-9]?$", V(g)$name))
-
-Davis <- g
-save(Davis, file="/tmp/Davis.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/dolphins.R igraph-0.6.5/nexus/download/dolphins.R
--- igraph-0.6.5~quantal1/nexus/download/dolphins.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/dolphins.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/dolphins.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "dolphins.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip dolphins.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/dolphins.txt"))
-gml <- paste(sep="", tmp, "/dolphins.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-g$name <- "Dophin social network"
-g$Author <- "D. Lusseau et al."
-g$Citation <- "D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology 54, 396-405 (2003)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-dolphins <- g
-save(dolphins, file="/tmp/dolphins.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/enron.R igraph-0.6.5/nexus/download/enron.R
--- igraph-0.6.5~quantal1/nexus/download/enron.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/enron.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,103 +0,0 @@
-
-base <- "~/Downloads/enron/maildir"
-
-## Check that every maildir has a _sent-mail folder, with at least
-## one message
-
-sentFiles <- c("sent", "sent_items", "_sent_mail", "chris_stokley/sent")
-
-checkSentMail <- function(x) {
-  d <- paste(sep="", base, "/", x)
-  f <- list.files(d)
-  sf <- ifelse(grepl("/", sentFiles), dirname(sentFiles), sentFiles)
-  any(sf %in% f)
-}
-
-dirs <- list.files(base)
-sentmail <- sapply(dirs, checkSentMail)
-
-## One person did not have a sent-mail folder, (s)he did not send
-## any mail, apparently
-
-getEmailAddress <- function(x) {
-  d <- paste(sep="", base, "/", x)
-
-  for (s in sentFiles) {
-    f <- paste(sep="", d, "/", s)
-    if (file.exists(f)) {
-      mailfile <- list.files(f, full.names=TRUE)[1]
-      l <- readLines(mailfile, warn=FALSE)
-      from <- l[grep("^From:", l)[1]]
-      return(sub(".*[ :]([^: ]+@[^ >]+).*", "\\1", from))
-    }
-  }
-  as.character(NA)
-}
-
-email <- sapply(dirs, getEmailAddress)
-email[ is.na(email) ] <- "steven.harris@enron.com"
-
-getAllEdges <- function(x) {
-  print(x)
-  folders <- list.files(paste(sep="", base, "/", x), full.names=TRUE)
-  e <- list()
-  for (f in folders) {
-    mailfiles <- list.files(f, full.names=TRUE)
-    e <- c(e, lapply(mailfiles, getEdges))
-  }
-  e
-}
-
-getEdges <- function(x) {
-  cat('.')
-
-  addl <- function(i) {
-    r <- l[i]
-    i <- i+1
-    while (grepl("^[ \t]", l[i])) {
-      r <- c(r, l[i])
-      i <- i+1
-    }
-    r <- paste(r, collapse=" ")
-    r <- strsplit(r, ",?[ \t]+")[[1]][-1]
-  }
-  
-  l <- readLines(x, warn=FALSE)
-  from <- addl(grep("^From:", l)[1])
-  to <- addl(grep("^To:", l)[1])
-  cc <- addl(grep("^Cc:", l)[1])
-  bcc <- addl(grep("^Bcc:", l)[1])
-  date <- l[grep("^Date:", l)[1]]
-  
-  bcc <- setdiff(bcc, c(from, to, cc))
-  cc <- setdiff(cc, c(from, to))
-  to <- setdiff(to, from)
-  
-  list(from=from, date=date, to=to, cc=cc, bcc=bcc)
-}
-
-edges <- lapply(dirs, getAllEdges)
-edges <- unlist(edges, recursive=FALSE)
-
-## Try to filter out messages appearing multiple times...
-
-encode <- function(e) {
-  f <- e$from
-  d <- e$date
-  t <- paste(sort(e$to), collapse=";")
-  paste(f, d, t, sep=";")
-}
-
-edgecodes <- sapply(edges, encode)
-dup <- duplicated(edgecodes)
-
-uniEdges <- edges[!dup]
-
-people <- unique(c(unique(unlist(sapply(uniEdges, "[[", "from"))),
-                   unique(unlist(sapply(uniEdges, "[[", "to"))),
-                   unique(unlist(sapply(uniEdges, "[[", "cc")))))
-
-people <- sort(people)
-
-## This is a big mess, it should be cleaned up, but
-## of course I don't have the time for this....
diff -Nru igraph-0.6.5~quantal1/nexus/download/facebook.R igraph-0.6.5/nexus/download/facebook.R
--- igraph-0.6.5~quantal1/nexus/download/facebook.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/facebook.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,40 +0,0 @@
-
-url <- "http://people.maths.ox.ac.uk/~porterm/data/facebook5.zip"
-urlfull <- "http://people.maths.ox.ac.uk/~porterm/data/facebook100.zip"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "facebook5.zip")
-destfull <- paste(sep="", tmp, "/", "facebook100.zip")
-download.file(url, dest)
-download.file(urlfull, destfull)
-
-system(paste("cd", tmp, ";", "unzip", destfull))
-
-library(R.matlab)
-
-matfiles <- grep("\\.mat$", list.files(paste(sep="", tmp, "/facebook100")),
-                 value=TRUE)
-
-nullna <- function(x) {
-  ifelse(x==0, NA, x)
-}
-
-dofile <- function(mfile) {
-  u <- sub("[0-9]+\\.mat", "", mfile)
-  M <- readMat(paste(sep="", tmp, "/facebook100/", mfile))
-  g <- graph.adjacency(M[[1]], mode="undirected")
-  V(g)$SFStatus   <- nullna(M[[2]][,1])
-  V(g)$Gender     <- nullna(M[[2]][,2])
-  V(g)$Major      <- nullna(M[[2]][,3])
-  V(g)$Minor      <- nullna(M[[2]][,4])
-  V(g)$Dorm       <- nullna(M[[2]][,5])
-  V(g)$Year       <- nullna(M[[2]][,6])
-  V(g)$HighSchool <- nullna(M[[2]][,7])
-  g$name <- paste("Facebook network,", u)
-  g$Author <- "Mason A. Porter"
-  g$Citation <- "Amanda L. Traud, Eric D. Kelsic, Peter J. Mucha, and Mason A. Porter,Comparing Community Structure to Characteristics in Online Collegiate Social Networks, SIAM Review, in press (arXiv:0809.0690)."
-  g$URL <- "http://www.insna.org/member/profiles/356.html"
-
-  g
-}
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/football.R igraph-0.6.5/nexus/download/football.R
--- igraph-0.6.5~quantal1/nexus/download/football.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/football.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/football.zip"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "football.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip football.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/football.txt"))
-gml <- paste(sep="", tmp, "/football.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-V(g)$Conference <- V(g)$value
-g <- remove.vertex.attribute(g, "value")
-
-g$name <- "Network of American college football games"
-g$Author <- "Michelle Girvan and Mark EJ Newman"
-g$Citation <- "M. Girvan and M. E. J. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(txt, collapse="\n"), "\n", sep="")
-
-football <- g
-save(football, file="/tmp/football.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/freeassoc.R igraph-0.6.5/nexus/download/freeassoc.R
--- igraph-0.6.5~quantal1/nexus/download/freeassoc.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/freeassoc.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,141 +0,0 @@
-
-urls <- paste(sep="",
-              "http://w3.usf.edu/FreeAssociation/AppendixA/Cue_Target_Pairs.",
-              c("A-B", "C", "D-F", "G-K", "L-O", "P-R", "S", "T-Z"))
-
-tmp <- tempdir()
-for (u in seq_along(urls)) {
-  dest <- paste(sep="", tmp, "/", u, ".dat")
-  download.file(urls[u], dest)
-}
-
-tables <- lapply(seq_along(urls), function(u) {
-  dest <- paste(sep="", tmp, "/", u, ".dat")
-  lines <- gsub("\xa5", "", readLines(dest))
-  read.csv(textConnection(lines), comment.char="<")
-})
-
-## Columns:
-## CUE      edge source
-## TARGET   edge target
-## NORMED.  YES/NO
-## X.G      number of participant serving in the group norming the word
-## X.P      number of participants producing the response
-## FSG      forward strength, X.P / X.G
-## BSG      backward strength
-## MSG      mediated strength (two-step strength)
-## OSG      overlapping strength
-## X.M      number of mediated connections linking cue and target
-## MMIAS    number of potential mediators that were not normed
-## X.O      number of overlapping associates shared
-## OMIAS    overlaps not normed
-## QSS      number of neighbors of cue
-## QFR      printed frequency of the cue
-## QCON     concreteness rating, 1-7, many missing
-## QH       homograph, according to various sources
-## QPS      part of the speech classification
-## QMC      mean connectivity among the associates of the normed word
-## QPR      probability that each associate in the set produces
-##          the normed cue as an associate
-## QRSG     resonance strength of the cue
-## QUC      Use Code value for the cue, whether all important associated were
-##          normed
-## TSS      The rest is the same, but for the target word
-## TFR
-## TCON
-## TH
-## TPS
-## TMC
-## TPR
-## TRSG
-
-## First put the tables together
-
-for (i in seq_along(tables)) {
-  colnames(tables[[i]]) <- colnames(tables[[1]])
-}
-tables <- do.call(rbind, tables)
-
-edges <- data.frame(from=tables$CUE, to=sub("^[ ]+", "", tables$TARGET),
-                    Normed=as.numeric(tables$NORMED.=="YES"),
-                    GroupSize=tables$X.P,
-                    NormingSize=tables$X.G)
-
-vertices1 <- data.frame(id=tables$CUE, PrintedFreq=tables$QFR,
-                        Concreteness=tables$QCON,
-                        Homograph=sub("^[ ]+", "", tables$QH),
-                        PartOfSpeech=sub("^[ ]+", "", tables$QPS))
-vertices1 <- vertices1[ !duplicated(vertices1), ]
-
-vertices2 <- data.frame(id=sub("^[ ]+", "", tables$TARGET),
-                        PrintedFreq=tables$TFR,
-                        Concreteness=tables$TCON,
-                        Homograph=sub("^[ ]+", "", tables$TH),
-                        PartOfSpeech=sub("^[ ]+", "", tables$TPS))
-vertices2 <- vertices2[ !duplicated(vertices2), ]                        
-
-vertices <- rbind(vertices1, vertices2)
-vertices <- vertices[ !duplicated(vertices), ]
-vertices <- vertices[ order(vertices$id), ]
-
-## Fix errors
-
-eqorna <- function(x, y) {
-  if (is.na(x) && is.na(y)) {
-    TRUE
-  } else if ( (is.na(x) && !is.na(y)) || (!is.na(x) && is.na(y)) ) {
-    FALSE
-  } else {
-    x==y
-  }
-}
-
-## Word is twice, because can be different parts of speech
-
-dupids <- vertices$id[duplicated(vertices$id)]
-for (id in dupids) {
-  rr <- vertices[vertices$id==id,]
-  nps <- setdiff(colnames(vertices), "PartOfSpeech")
-  eq <- sapply(nps, function(x) eqorna(rr[[x]][1], rr[[x]][2]))
-  if (all(eq)) {
-    vertices[vertices$id==id,]$PartOfSpeech <- rr$PartOfSpeech[1]
-  }
-}
-vertices <- vertices[ !duplicated(vertices), ]
-
-## Homograph entry is different
-
-hord <- c("N", "P", "W", "T", "G", "C", "")
-dupids <- vertices$id[duplicated(vertices$id)]
-for (id in dupids) {
-  rr <- vertices[vertices$id==id,]
-  nh <- setdiff(colnames(vertices), "Homograph")
-  eq <- sapply(nh, function(x) eqorna(rr[[x]][1], rr[[x]][2]))
-  if (all(eq)) {
-    h <- rr$Homograph    
-    vertices[vertices$id==id,]$Homograph <- hord[which(hord %in% h)[1]]
-  }
-}
-vertices <- vertices[ !duplicated(vertices), ]
-
-## BANDANNA
-
-vertices[ vertices$id=="BANDANNA", ]$PrintedFreq <- 0
-vertices[ vertices$id=="BANDANNA", ]$PartOfSpeech <- "N"
-vertices <- vertices[ !duplicated(vertices), ]
-
-## Final check
-
-dupids <- vertices$id[duplicated(vertices$id)]
-if (length(dupids) != 0) { stop("GEBASZ") }
-
-library(igraph)
-freeassoc <- graph.data.frame(edges, vertices=vertices, directed=TRUE)
-
-freeassoc$name <- "University of South Florida Free Association Norms"
-freeassoc$Author <- "Douglas L. Nelson and Cathy L. McEvoy"
-freeassoc$Citation <- "Nelson, D. L., McEvoy, C. L., & Schreiber, T. A. (1998). The University of South Florida word association, rhyme, and word fragment norms. http://www.usf.edu/FreeAssociation/."
-freeassoc$URL <- "http://w3.usf.edu/FreeAssociation"
-
-save(freeassoc, file="/tmp/freeassoc.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/gama.R igraph-0.6.5/nexus/download/gama.R
--- igraph-0.6.5~quantal1/nexus/download/gama.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/gama.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/gama.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "gama.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/gama.dat"))
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^LEVEL LABELS:", l)-1) ]
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nc=16, byrow=TRUE)
-close(tc)
-
-mat <- mat[1:16,] - mat[17:32,]
-rownames(mat) <- colnames(mat) <- rowlab
-
-library(igraph)
-gama <- graph.adjacency(mat, weighted=TRUE, mode="undirected")
-
-gama$name <- "Read highland tribes"
-gama$Author <- "K. Read"
-gama$Citation <- "Hage P. and Harary F. (1983). Structural models in anthropology. Cambridge: Cambridge University Press. (See p 56-60).\n\nRead K. (1954). Cultures of the central highlands, New Guinea. Southwestern Journal of Anthropology, 10, 1-43."
-gama$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-save(gama, file="/tmp/gama.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/hep-th.R igraph-0.6.5/nexus/download/hep-th.R
--- igraph-0.6.5~quantal1/nexus/download/hep-th.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/hep-th.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,30 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/hep-th.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "hep-th.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip hep-th.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/hep-th.txt"))
-gml <- paste(sep="", tmp, "/hep-th.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "High energy physics collaborations"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, The structure of scientific collaboration networks, Proc. Natl. Acad. Sci. USA 98, 404-409 (2001)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-hepcollab <- g
-save(hepcollab, file="/tmp/hepcollab.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/huck.R igraph-0.6.5/nexus/download/huck.R
--- igraph-0.6.5~quantal1/nexus/download/huck.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/huck.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-
-
-source("sgb-coappearance.R")
-huckleberry <- 
-  getnet("http://mirror.switch.ch/ftp/mirror/tex/support/graphbase/huck.dat")
-
-huckleberry$name <- "Huckleberry Finn coappearance network"
-save(huckleberry, file="/tmp/huckleberry.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/internet.R igraph-0.6.5/nexus/download/internet.R
--- igraph-0.6.5~quantal1/nexus/download/internet.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/internet.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/as-22july06.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "as-22july06.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip as-22july06.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/as-22july06.txt"))
-gml <- paste(sep="", tmp, "/as-22july06.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-g <- remove.vertex.attribute(g, "label")
-
-g$name <- "Internet at the AS level, July 22, 2006"
-g$Author <- "Mark E. J. Newman"
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-as2006 <- g
-save(as2006, file="/tmp/as2006.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/kapmine.R igraph-0.6.5/nexus/download/kapmine.R
--- igraph-0.6.5~quantal1/nexus/download/kapmine.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/kapmine.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,33 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/kapmine.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "kapmine.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/kapmine.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-adata <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat1 <- mat[1:(length(mat)/2)]
-mat2 <- mat[(length(mat)/2+1):length(mat)]
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-colnames(mat1) <- rownames(mat1) <- colnames(mat2) <- rownames(mat2) <- adata
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="undirected")
-g2 <- graph.adjacency(mat2, mode="undirected")
-
-g1$name <- "Kapferer mine, KAPFMM"
-g2$name <- "Kapferer mine, KAPFMU"
-g1$Author <- g2$Author <- "Bruce Kapferer"
-g1$Citation <- g2$Citation <- "Kapferer B. (1969). Norms and the manipulation of relationships in a work context. In J Mitchell (ed), Social networks in urban situations. Manchester: Manchester University Press.\n\nDoreian P. (1974). On the connectivity of social networks. Journal of Mathematical Sociology, 3, 245-258."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-kapmine <- list(KAPFMM=g1, KAPFMU=g2)
-save(kapmine, file="/tmp/kapmine.Rdata.gz")
diff -Nru igraph-0.6.5~quantal1/nexus/download/kaptail.R igraph-0.6.5/nexus/download/kaptail.R
--- igraph-0.6.5~quantal1/nexus/download/kaptail.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/kaptail.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/kaptail.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "kaptail.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/kaptail.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-labs <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-netlabs <- l[ (grep("^LEVEL LABELS:", l)+1):(grep("^DATA:", l)-1) ]
-  
-mat1 <- mat[1:(length(mat)/4)]
-mat2 <- mat[(length(mat)/4+1):(length(mat)/4*2)]
-mat3 <- mat[(length(mat)/4*2+1):(length(mat)/4*3)]
-mat4 <- mat[(length(mat)/4*3+1):length(mat)]
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-mat3 <- matrix(mat3, sqrt(length(mat3)), byrow=TRUE)
-mat4 <- matrix(mat4, sqrt(length(mat4)), byrow=TRUE)
-
-library(igraph)
-kaptail <- list(graph.adjacency(mat1, mode="undirected"),
-                graph.adjacency(mat2, mode="undirected"),
-                graph.adjacency(mat3, mode="directed"),
-                graph.adjacency(mat4, mode="directed"))
-names(kaptail) <- netlabs
-for (i in seq_along(kaptail)) V(kaptail[[i]])$name <- labs
-for (i in seq_along(kaptail)) {
-  kaptail[[i]]$name <- paste("Kapferer tailor shop,", netlabs[[i]])
-  kaptail[[i]]$Author <- "Bruce Kapferer"
-  kaptail[[i]]$Citation <- "Kapferer B. (1972). Strategy and transaction in an African factory. Manchester: Manchester University Press."
-  kaptail[[i]]$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-}
-
-save(kaptail, file="/tmp/kaptail.Rdata.gz")
diff -Nru igraph-0.6.5~quantal1/nexus/download/kiel-email.R igraph-0.6.5/nexus/download/kiel-email.R
--- igraph-0.6.5~quantal1/nexus/download/kiel-email.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/kiel-email.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,35 +0,0 @@
-
-url <- "http://www.itp.uni-bremen.de/complex/ebel_bornholdt_email.net.gz"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "kielemail.txt.gz")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; zcat kielemail.txt.gz | sed -e 's/  */ /g' >kielemail.txt"))
-
-df <- read.table(paste(sep="", tmp, "/kielemail.txt"), header=FALSE,
-                 sep=" ", row.names=NULL, colClasses="character",
-                 as.is=TRUE, stringsAsFactors=FALSE)
-
-edges <- data.frame(source=I(paste(sep="", df$V5, df$V6, df$V7)),
-                    target=I(paste(sep="", df$V9, df$V10, df$V11)),
-                    Date=I(paste(df$V1, df$V2, df$V3)))
-vertices <- data.frame(id=I(c(edges$source, edges$target)),
-                       Internal=c(df$V4, df$V8))
-vertices <- aggregate(vertices$Internal,
-    by=list(id=vertices$id), FUN=function(xs) { paste(unique(xs), collapse=" ") })
-names(vertices) <- c("id", "Internal")
-vertices$Internal <- vertices$Internal == "s"
-
-library(igraph)
-g <- graph.data.frame(edges, vertices=vertices)
-E(g)$weight <- 1
-g <- simplify(g, edge.attr.comb=list(weight="sum"), remove.loops=FALSE)
-
-g$Name <- "University of Kiel email dataset"
-g$Author <- "Holger Ebel, Lutz-Ingo Mielsch and Stefan Bornholdt"
-g$Citation <- "H. Ebel, L-I. Mielsch and S. Bornholdt: Scale-free topology of e-mail networks. Phys. Rev. E 66, 035103(R) (2002)."
-g$URL <- "http://www.itp.uni-bremen.de/complex/email_net.html"
-
-kielemail <- g
-save(kielemail, file="/tmp/kielemail.Rdata.gz")
diff -Nru igraph-0.6.5~quantal1/nexus/download/knokbur.R igraph-0.6.5/nexus/download/knokbur.R
--- igraph-0.6.5~quantal1/nexus/download/knokbur.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/knokbur.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/knokbur.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "knokbur.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/knokbur.dat"))
-
-names <- strsplit(l[ grep("^information", l)+2 ], ",")[[1]]
-data1 <- l[ (grep("^information", l)+3):(grep("\032", l)[1]-1) ]
-data2 <- l[ (grep("^money", l)+3):(grep("\032", l)[2]-1) ]
-data3 <- l[ (grep("ID,", l)+1):(grep("\032", l)[3]-1) ]
-data3 <- gsub("[ ]", "", data3)
-
-tc <- textConnection(data1)
-mat1 <- scan(tc)
-close(tc)
-tc <- textConnection(data2)
-mat2 <- scan(tc)
-close(tc)
-tc <- textConnection(data3)
-met <- read.delim(tc, header=FALSE)
-close(tc)
-colnames(met) <- c("Id", "Sector", "Rating")
-
-mat1 <- matrix(mat1, sqrt(length(mat1)), byrow=TRUE)
-mat2 <- matrix(mat2, sqrt(length(mat2)), byrow=TRUE)
-colnames(mat1) <- rownames(mat1) <- colnames(mat2) <- rownames(mat2) <- names
-
-library(igraph)
-g1 <- graph.adjacency(mat1)
-g2 <- graph.adjacency(mat2)
-V(g1)$Sector <- V(g2)$Sector <- as.character(met$Sector)
-V(g1)$Rating <- V(g2)$Rating <- met$Rating
-
-g1$name <- "Knoke bureaucracies, KNOKM"
-g2$name <- "Knoke bureaucracies, KNOKI"
-g1$Author <- g2$Author <- "D. Knoke and J. Wood"
-g1$Citation <- g2$Citation <- "Knoke D. and Wood J. (1981). Organized for action: Commitment in voluntary associations. New Brunswick, NJ: Rutgers University Press.\n\n
-Knoke D. and Kuklinski J. (1982). Network analysis, Beverly Hills, CA: Sage."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-knokbur <- list(KNOKM=g1, KNOKI=g2)
-save(knokbur, file="/tmp/knokbur.Rdata.gz")
diff -Nru igraph-0.6.5~quantal1/nexus/download/krackoffice.R igraph-0.6.5/nexus/download/krackoffice.R
--- igraph-0.6.5~quantal1/nexus/download/krackoffice.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/krackoffice.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,84 +0,0 @@
-
-url1 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/krackad.dat"
-url2 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/krackfr.dat"
-
-tmp <- tempdir()
-
-dest <- paste(sep="", tmp, "/", "krackad.dat")
-download.file(url1, dest)
-l1 <- readLines(paste(sep="", tmp, "/krackad.dat"))
-
-dest <- paste(sep="", tmp, "/", "krackfr.dat")
-download.file(url2, dest)
-l2 <- readLines(paste(sep="", tmp, "/krackfr.dat"))
-
-data1 <- l1[ (grep("^DATA:", l1)+1):length(l1) ]
-data2 <- l2[ (grep("^DATA:", l2)+1):length(l2) ]
-
-tc <- textConnection(data1)
-mat1 <- scan(tc)
-close(tc)
-
-tc <- textConnection(data2)
-mat2 <- scan(tc)
-close(tc)
-
-mat1 <- apply(matrix(mat1, nrow=21, byrow=TRUE), 1, list)
-mat2 <- apply(matrix(mat2, nrow=21, byrow=TRUE), 1, list)
-
-mat1 <- lapply(mat1, "[[", 1)
-mat2 <- lapply(mat2, "[[", 1)
-
-mat1 <- lapply(mat1, matrix, nc=21, byrow=TRUE)
-mat2 <- lapply(mat2, matrix, nc=21, byrow=TRUE)
-
-library(igraph)
-KRACKAD <- lapply(mat1, graph.adjacency, mode="directed")
-KRACKFR <- lapply(mat2, graph.adjacency, mode="directed")
-
-for (i in seq_along(KRACKAD)) {
-  KRACKAD[[i]]$name <- paste(sep="", "Krackhardt office CSS, advice, #", i)
-  KRACKFR[[i]]$name <-
-    paste(sep="", "Krackhardt office CSS, friendship, #", i)
-  KRACKAD[[i]]$Author <- KRACKFR[[i]]$Author <- "David Krackhardt"
-  KRACKAD[[i]]$Citation <- KRACKFR[[i]]$Citation <- "Krackhardt D. (1987). Cognitive social structures. Social Networks, 9, 104-134."
-  KRACKAD[[i]]$URL <- KRACKFR[[i]]$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-}
-
-names(KRACKAD) <- paste(sep="", "KRACKAD-", seq_along(KRACKAD))
-names(KRACKFR) <- paste(sep="", "KRACKFR-", seq_along(KRACKFR))
-
-krackoffice <- c(KRACKAD, KRACKFR)
-
-save(krackoffice, file="/tmp/krackoffice.Rdata.gz")
-
-stop()
-
-library(RSQLite)
-con <- dbConnect("SQLite", dbname="../db/test.db")
-for (i in seq_along(KRACKAD)) {
-  
-  sid <- paste(sep="", "'KRACKAD-", i, "'")
-  desc <- paste(sep="", "'Advice, as viewed by actor #", i, "'")
-  values <- paste(sep=",", 36, i, sid, desc, vcount(KRACKAD[[i]]),
-                  ecount(KRACKAD[[i]]), sid, 1, 0, 0)
-  dbSendQuery(con, paste(sep="",
-                    'INSERT INTO network (dataset, id, sid, description,
-                                    vertices, edges, filename, directed,
-                                    bipartite, weighted)
-                     VALUES (', values, ')'))
-}
-
-for (i in seq_along(KRACKFR)) {
-  
-  sid <- paste(sep="", "'KRACKFR-", i, "'")
-  desc <- paste(sep="", "'Friendship, as viewed by actor #", i, "'")
-  values <- paste(sep=",", 36, i+21, sid, desc, vcount(KRACKFR[[i]]),
-                  ecount(KRACKFR[[i]]), sid, 1, 0, 0)
-  dbSendQuery(con, paste(sep="",
-                    'INSERT INTO network (dataset, id, sid, description,
-                                    vertices, edges, filename, directed,
-                                    bipartite, weighted)
-                     VALUES (', values, ')'))
-}
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/miserables.R igraph-0.6.5/nexus/download/miserables.R
--- igraph-0.6.5~quantal1/nexus/download/miserables.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/miserables.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-
-source("sgb-coappearance.R")
-tmp <- tempdir()
-miserables <-
-  getnet("http://mirror.switch.ch/ftp/mirror/tex/support/graphbase/jean.dat")
-
-miserables$name <- "Les Miserables coappearance network"
-save(miserables, file="miserables.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/netscience.R igraph-0.6.5/nexus/download/netscience.R
--- igraph-0.6.5~quantal1/nexus/download/netscience.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/netscience.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,31 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/netscience.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "netscience.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip netscience.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/netscience.txt"))
-gml <- paste(sep="", tmp, "/netscience.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-E(g)$weight <- E(g)$value
-g <- remove.edge.attribute(g, "value")
-
-g$name <- "Coauthorships in network science"
-g$Author <- "Mark E. J. Newman"
-g$Citation <- "M. E. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E 74, 036104 (2006)"
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-netscience <- g
-save(netscience, file="/tmp/netscience.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/newfrat.R igraph-0.6.5/nexus/download/newfrat.R
--- igraph-0.6.5~quantal1/nexus/download/newfrat.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/newfrat.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/newfrat.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "newfrat.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/newfrat.dat"))
-
-lab <- l[ (grep("^LEVEL LABELS:", l)+1):(grep("^DATA", l)-1) ]
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat <- apply(matrix(mat, nrow=15, byrow=TRUE), 1, list)
-mat <- lapply(mat, "[[", 1)
-mat <- lapply(mat, matrix, nc=17, byrow=TRUE)
-
-library(igraph)
-newfrat <- lapply(mat, graph.adjacency, mode="directed", weighted=TRUE)
-names(newfrat) <- lab
-
-for (i in seq_along(newfrat)) {
-  newfrat[[i]]$name <- paste(sep="", "Newcomb fraternity, ", lab[i])
-  newfrat[[i]]$Author <- "Theodore Newcomb"
-  newfrat[[i]]$Citation <- "Newcomb T. (1961). The acquaintance process. New York: Holt, Reinhard & Winston"
-  newfrat[[i]]$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-}
-
-save(newfrat, file="/tmp/newfrat.Rdata.gz")
-
-stop()
-
-library(RSQLite)
-con <- dbConnect("SQLite", dbname="../db/test.db")
-
-for (i in seq_along(newfrat)) {
-  
-  sid <- paste(sep="", "'", lab[i], "'")
-  values <- paste(sep=",", 37, i, sid, vcount(newfrat[[i]]),
-                  ecount(newfrat[[i]]), sid, 1, 0, 1)
-  dbSendQuery(con, paste(sep="",
-                    'INSERT INTO network (dataset, id, sid, 
-                                    vertices, edges, filename, directed,
-                                    bipartite, weighted)
-                     VALUES (', values, ')'))
-}
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/padgett.R igraph-0.6.5/nexus/download/padgett.R
--- igraph-0.6.5~quantal1/nexus/download/padgett.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/padgett.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/padgett.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "padgett.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/padgett.dat"))
-
-url2 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/padgw.dat"
-dest <- paste(sep="", tmp, "/", "padgw.dat")
-download.file(url2, dest)
-l2 <- readLines(paste(sep="", tmp, "/padgw.dat"))
-
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^LEVEL LABELS:", l)-1) ]
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- as.matrix(read.table(tc))
-close(tc)
-
-mat1 <- mat[1:16,]
-mat2 <- mat[17:32,]
-colnames(mat1) <- rownames(mat1) <- colnames(mat2) <- rownames(mat2) <- rowlab
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="undirected")
-g2 <- graph.adjacency(mat2, mode="undirected")
-
-mlabs <- l2[ (grep("^COLUMN LABELS:", l2)+1):(grep("^DATA", l2)-1) ]
-alabs <- l2[ (grep("^ROW LABELS:", l2)+1):(grep("^COLUMN LABELS", l2)-1) ]
-data2 <- l2[ (grep("^DATA:", l2)+1):length(l2)]
-data2 <- paste(data2, collapse="\n")
-
-tc <- textConnection(data2)
-meta <- as.matrix(read.table(tc))
-close(tc)
-
-rownames(meta) <- alabs
-colnames(meta) <- mlabs
-meta <- meta[V(g1)$name,]
-
-g1$name <- "Padgett Frorentine families, business"
-g2$name <- "Padgett Frorentine families, marriage"
-g1$Author <- g2$Author <- "John Padgett"
-g1$Citation <- g2$Citation <- "Kent D. (1978). The rise of the Medici: Faction in Florence, 1426-1434. Oxford: Oxford University Press."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-V(g1)$Wealth <- V(g2)$Wealth <- meta[,1]
-V(g1)$Priors <- V(g2)$Priors <- meta[,2]
-V(g1)$Ties <- V(g2)$Ties <- meta[,3]
-
-padgett <- list(PADGB=g1, PADGM=g2)
-save(padgett, file="/tmp/padgett.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/polblogs.R igraph-0.6.5/nexus/download/polblogs.R
--- igraph-0.6.5~quantal1/nexus/download/polblogs.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/polblogs.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,34 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/polblogs.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "polblogs.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip polblogs.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/polblogs.txt"))
-gml <- paste(sep="", tmp, "/polblogs.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-V(g)$name <- V(g)$label
-g <- remove.vertex.attribute(g, "label")
-
-V(g)$LeftRight <- V(g)$value
-g <- remove.vertex.attribute(g, "value")
-
-V(g)$Source <- V(g)$source
-g <- remove.vertex.attribute(g, "source")
-
-g$name <- "US politics blog network"
-g$Author <- "L. A. Adamic and N. Glance"
-g$Citation <- "L. A. Adamic and N. Glance, The political blogosphere and the 2004 US Election, in Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem (2005)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-polblogs <- g
-save(polblogs, file="/tmp/polblogs.Rdata")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/powergrid.R igraph-0.6.5/nexus/download/powergrid.R
--- igraph-0.6.5~quantal1/nexus/download/powergrid.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/powergrid.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,26 +0,0 @@
-
-url <- "http://www-personal.umich.edu/~mejn/netdata/power.zip"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "power.zip")
-
-download.file(url, dest)
-system(paste("cd ", tmp, "; unzip power.zip"))
-
-txt <- readLines(paste(sep="", tmp, "/power.txt"))
-gml <- paste(sep="", tmp, "/power.gml")
-
-library(igraph)
-g <- read.graph(gml, format="gml")
-
-g <- remove.vertex.attribute(g, "id")
-
-g$name <- "Western states power grid"
-g$Author <- "Duncan Watts and Steven Strogatz"
-g$Citation <- "D. J. Watts and S. H. Strogatz, Collective dynamics of `small-world' networks, Nature 393, 440-442 (1998)."
-g$URL <- "http://www-personal.umich.edu/~mejn/netdata/"
-g$Description <- paste(paste(collapse="\n", txt), sep="", "\n")
-
-powergrid <- g
-save(powergrid, file="/tmp/powergrid.Rdata")
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/prison.R igraph-0.6.5/nexus/download/prison.R
--- igraph-0.6.5~quantal1/nexus/download/prison.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/prison.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/prison.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "prison.dat")
-download.file(url, dest)
-l <- readLines(paste(sep="", tmp, "/prison.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-
-tc <- textConnection(data)
-mat <- scan(tc)
-close(tc)
-
-mat <- matrix(mat, sqrt(length(mat)), byrow=TRUE)
-
-library(igraph)
-g <- graph.adjacency(mat)
-
-g$name <- "Gagnon & MacRae prison"
-g$Author <- "John Gagnon"
-g$Citation <- "MacRae J. (1960). Direct factor analysis of sociometric data. Sociometry, 23, 360-371."
-g$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-prison <- g
-save(prison, file="/tmp/prison.Rdata.gz")
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/sampson.R igraph-0.6.5/nexus/download/sampson.R
--- igraph-0.6.5~quantal1/nexus/download/sampson.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/sampson.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,44 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/sampson.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "sampson.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/sampson.dat"))
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^LEVEL LABELS:", l)-1) ]
-llab <- l[ (grep("^LEVEL LABELS:", l)+1):(grep("^DATA:$", l)-1)]
-llab[10] <- "SAMPNPR"
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nr=length(llab), byrow=TRUE)
-close(tc)
-
-mat <- apply(mat, 1, list)
-mat <- lapply(mat, "[[", 1)
-mat <- lapply(mat, matrix, nc=18, byrow=TRUE)
-
-for (i in seq_along(mat)) {
-  rownames(mat[[i]]) <- colnames(mat[[i]]) <- rowlab
-}
-
-library(igraph)
-mat <- lapply(mat, graph.adjacency, weighted=TRUE)
-names(mat) <- llab
-
-for (i in seq_along(mat)) {
-  mat[[i]]$name <- paste("Sampson monastery,", llab[i])
-  mat[[i]]$Author <- "S. Sampson"
-  mat[[i]]$Citation <- "Breiger R., Boorman S. and Arabie P. (1975). An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. Journal of Mathematical Psychology, 12, 328-383.\n\nSampson, S. (1969). Crisis in a cloister. Unpublished doctoral dissertation, Cornell University."
-  mat[[i]]$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-}
-
-sampson <- mat
-
-save(sampson, file="/tmp/sampson.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/sgb-coappearance.R igraph-0.6.5/nexus/download/sgb-coappearance.R
--- igraph-0.6.5~quantal1/nexus/download/sgb-coappearance.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/sgb-coappearance.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-
-getnet <- function(url) {
-  tmp <- tempdir()
-  dest <- paste(sep="", tmp, "/", "anna.dat")
-
-  download.file(url, dest)
-  l <- readLines(dest)
-  l <- l[!grepl("^\\*", l)]
-  
-  emptyline <- grep("^$", l)
-  name <- l[1:(emptyline-1)]
-  secs <- l[(emptyline+1):length(l)]
-  
-  mon <- sub(" .*$", "", name)
-  name <- sub("^.. ", "", name)
-  
-  meet <- strsplit(sub("^[0-9\\.]+:?", "", secs), ";")
-  meet2 <- lapply(meet, strsplit, ",")
-  
-  edges <- character()
-  for (i in seq_along(meet)) {
-    for (j in seq_along(meet[[i]])) {
-      ev <- meet2[[i]][[j]]
-      if (length(ev) >= 2) {
-        edges <- c(edges, combn(ev, 2))
-      }
-    }
-  }
-  
-  edges <- matrix(edges, ncol=2, byrow=TRUE)
-  
-  names(meet2) <- sub("([0-9\\.]+).*$", "\\1", secs)
-  
-  library(igraph)
-  g <- graph.edgelist(edges, directed=FALSE)
-  E(g)$weight <- 1
-  g <- simplify(g)
-
-  V(g)$Description <- name[match(V(g)$name, mon)]
-  g$Citation <- "Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA (1993)"
-  g$Author <- "Donald E. Knuth"
-  g$URL <- "http://www.ctan.org/tex-archive/support/graphbase/"
-
-  g$Coappearance <- meet2
-
-  g
-}
diff -Nru igraph-0.6.5~quantal1/nexus/download/szci.R igraph-0.6.5/nexus/download/szci.R
--- igraph-0.6.5~quantal1/nexus/download/szci.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/szci.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-
-urls <- c("http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/szcid.dat",
-          "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/szcig.dat")
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "szcid.dat")
-download.file(urls[1], dest)
-l1 <- readLines(dest)
-dest <- paste(sep="", tmp, "/", "szcig.dat")
-download.file(urls[2], dest)
-l2 <- readLines(dest)
-
-getnet <- function(l) {
-  n <- as.numeric(sub("^N=", "", l[grep("^N=", l)]))
-  rl <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-  cl <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^DATA:", l)-1) ]
-  if (length(rl) != length(cl) || any(rl != cl)) {
-    stop("Row and column names no not match")
-  }
-  data <- l[ (grep("^DATA:", l)+1):length(l) ]
-  tc <- textConnection(data)
-  mat <- matrix(scan(tc), nc=n, byrow=TRUE)
-  colnames(mat) <- rownames(mat) <- rl
-  graph.adjacency(mat, mode="undirected", weighted=TRUE)
-}
-
-library(igraph)
-szcid <- getnet(l1)
-szcig <- getnet(l2)
-
-szcid$name <- "Stokman-Ziegler corporate interlocks, Holland"
-szcig$name <- "Stokman-Ziegler corporate interlocks, Germany"
-szcid$Author <- szcig$Author <- "F. Stokman and R. Ziegler"
-szcid$Citation <- szcig$Citation <- "Ziegler R., Bender R. and Biehler H. (1985). Industry and banking in the German corporate network. In F. Stokman, R. Ziegler & J. Scott (eds), Networks of corporate power. Cambridge: Polity Press, 1985.\n\nStokman F., Wasseur F. and Elsas D. (1985). The Dutch network: Types of interlocks and network structure. In F. Stokman, R. Ziegler & J. Scott (eds), Networks of corporate power. Cambridge: Polity Press, 1985."
-szcid$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-szci <- list(SZCID=szcid, SZCIG=szcig)
-save(szci, file="/tmp/szci.Rdata.gz")
-
-
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/taro.R igraph-0.6.5/nexus/download/taro.R
--- igraph-0.6.5~quantal1/nexus/download/taro.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/taro.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,27 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/taro.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "taro.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/taro.dat"))
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nc=22, byrow=TRUE)
-close(tc)
-
-library(igraph)
-taro <- graph.adjacency(mat, mode="undirected")
-
-taro$name <- "Schwimmer taro exchange"
-taro$Author <- "E. Schwimmer"
-taro$Citation <- "Hage P. and Harary F. (1983). Structural models in anthropology. Cambridge: Cambridge University Press.\n\nSchwimmer E. (1973). Exchange in the social structure of the Orokaiva. New York: St Martins."
-taro$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-save(taro, file="/tmp/taro.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/thuroff.R igraph-0.6.5/nexus/download/thuroff.R
--- igraph-0.6.5~quantal1/nexus/download/thuroff.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/thuroff.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,37 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/thuroff.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "thuroff.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/thuroff.dat"))
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^LEVEL LABELS:", l)-1) ]
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nc=length(rowlab), byrow=TRUE)
-close(tc)
-
-mat1 <- mat[1:15,]
-mat2 <- mat[16:30,]
-colnames(mat1) <- rownames(mat1) <- colnames(mat2) <- rownames(mat2) <- rowlab
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="directed")
-g2 <- graph.adjacency(mat2, mode="undirected")
-
-g1$name <- "Thurman office, organizational chart"
-g2$name <- "Thurman office, multiplex ties"
-
-g1$Author <- g2$Author <- "B. Thurman"
-g1$Citation <- g2$Citation <- "Thurman B. (1979). In the office: Networks and coalitions. Social Networks, 2, 47-63."
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm" 
-
-thuroff <- list(THURA=g1, THURM=g2)
-save(thuroff, file="/tmp/thuroff.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/us-airport.R igraph-0.6.5/nexus/download/us-airport.R
--- igraph-0.6.5~quantal1/nexus/download/us-airport.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/us-airport.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,16 +0,0 @@
-
-url <- "http://sites.google.com/site/cxnets/US_largest500_airportnetwork.txt"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "usairport.txt")
-
-download.file(url, dest)
-
-library(igraph)
-usairport <- read.graph(dest, format="ncol")
-usairport$name <- "US air transportation network"
-usairport$Author <- "V. Colizza, R. Pastor-Satorras and A. Vespignani"
-usairport$Citation <- "V. Colizza, R. Pastor-Satorras and A. Vespignani. Reaction-diffusion processes and metapopulation models in heterogeneous networks. Nature Physics 3, 276-282 (2007)."
-usairport$URL <- "http://sites.google.com/site/cxnets/usairtransportationnetwork"
-
-save(air, file="/tmp/usairport.Rdata")
diff -Nru igraph-0.6.5~quantal1/nexus/download/wiring.R igraph-0.6.5/nexus/download/wiring.R
--- igraph-0.6.5~quantal1/nexus/download/wiring.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/wiring.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,45 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/wiring.dat"
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "wiring.dat")
-
-download.file(url, dest)
-
-l <- readLines(paste(sep="", tmp, "/wiring.dat"))
-rowlab <- l[ (grep("^ROW LABELS:", l)+1):(grep("^COLUMN LABELS:", l)-1) ]
-collab <- l[ (grep("^COLUMN LABELS:", l)+1):(grep("^LEVEL LABELS:", l)-1) ]
-llab <- l[ (grep("^LEVEL LABELS:", l)+1):(grep("^DATA:", l)-1) ]
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nc=14, byrow=TRUE)
-close(tc)
-
-wiring <- list(mat[1:14,], mat[15:28,], mat[29:42,], mat[43:56,],
-               mat[57:70,], mat[71:84,])
-
-for (i in seq_along(wiring)) {
-  rownames(wiring[[i]]) <- colnames(wiring[[i]]) <- rowlab
-}
-
-library(igraph)
-wiring <- list(graph.adjacency(wiring[[1]], mode="undirected"),
-               graph.adjacency(wiring[[2]], mode="undirected"),
-               graph.adjacency(wiring[[3]], mode="undirected"),
-               graph.adjacency(wiring[[4]], mode="undirected"),
-               graph.adjacency(wiring[[5]], mode="directed"),
-               graph.adjacency(wiring[[3]], mode="directed", weighted=TRUE))
-names(wiring) <- llab
-
-for (i in seq_along(wiring)) {
-  wiring[[i]]$name <- paste("Roethlisberger & Dickson bank wiring room,",
-                            llab[i])
-  wiring[[i]]$Author <- "Roethlisberger F. and Dickson W."
-  wiring[[i]]$Citation <- "Breiger R., Boorman S. and Arabie P. (1975). An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. Journal of Mathematical Psychology, 12, 328-383.\n\nHomans G. (1950). The human group. New York: Harcourt-Brace.\n\nRoethlisberger F. and Dickson W. (1939). Management and the worker. Cambridge: Cambridge University Press."
-  wiring[[i]]$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-}
-
-save(wiring, file="/tmp/wiring.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/download/wolfe.R igraph-0.6.5/nexus/download/wolfe.R
--- igraph-0.6.5~quantal1/nexus/download/wolfe.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/download/wolfe.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,46 +0,0 @@
-
-url <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/wolf.dat"
-url2 <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/wolfi.dat"
-
-tmp <- tempdir()
-dest <- paste(sep="", tmp, "/", "wolf.dat")
-download.file(url, dest)
-l <- readLines(dest)
-
-dest <- paste(sep="", tmp, "/", "wolfi.dat")
-download.file(url2, dest)
-l2 <- readLines(dest)
-
-data <- l[ (grep("^DATA:", l)+1):length(l) ]
-data <- paste(data, collapse="\n")
-
-tc <- textConnection(data)
-mat <- matrix(scan(tc), nc=20, byrow=TRUE)
-close(tc)
-
-mat1 <- mat[1:20,]
-mat2 <- mat[21:40,]
-
-library(igraph)
-g1 <- graph.adjacency(mat1, mode="directed")
-g2 <- graph.adjacency(mat2, mode="undirected", weighted=TRUE)
-
-g1$name <- "Wolfe primates, putative kin relationships"
-g2$name <- "Wolfe primates, interactions"
-g1$Author <- g2$Author <- "Linda Wolfe"
-g1$URL <- g2$URL <- "http://vlado.fmf.uni-lj.si/pub/networks/data/ucinet/ucidata.htm"
-
-sex <- l2[ (grep("^ROW LABELS:", l2)+1):(grep("^COLUMN LABELS:", l2)-1) ]
-sex <- sub("^[0-9]+ ", "", sex)
-age <- l2[ (grep("^DATA:", l2)+1):length(l2) ]
-age <- as.numeric(sub("[ ][0-9]+$", "", sub("^[ ]*", "", age)))
-rank <- l2[ (grep("^DATA:", l2)+1):length(l2) ]
-rank <- as.numeric(sub("^[ ]*[0-9]+[ ]*", "", rank))
-
-V(g1)$Sex <- V(g2)$Sex <- sex
-V(g1)$Age <- V(g2)$Age <- age
-V(g1)$Rank <- V(g2)$Rank <- rank
-
-wolfe <- list(WOLFK=g1, WOLFN=g2)
-save(wolfe, file="/tmp/wolfe.Rdata.gz")
-
diff -Nru igraph-0.6.5~quantal1/nexus/python/model.py igraph-0.6.5/nexus/python/model.py
--- igraph-0.6.5~quantal1/nexus/python/model.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/python/model.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,404 +0,0 @@
-import web
-import re
-import os.path
-from web import websafe
-from itertools import izip
-
-if os.path.exists("../db/nexus.db"):
-    dbfile='../db/nexus.db'
-elif os.path.exists("../db/test.db"):
-    dbfile='../db/test.db'
-db = web.database(dbn='sqlite', db=dbfile)
-
-def get_list_tagged_as(tagname, operator="or", order="date", limit=10, 
-                       offset=0):
-    ord={ 'date': 'd.date DESC, d.id DESC',
-          'name': 'd.name',
-          'popularity': 'd.downloads DESC, d.date DESC, d.id DESC' }
-    tagstr=["'%s'" % websafe(t) for t in tagname]
-    tagstr='(' + ",".join(tagstr) + ")"
-    if operator=="or":
-        table='dataset d, dataset_tag dt, tag t, network n'
-        what='''DISTINCT d.id id, d.sid sid, d.name name,
-                         d.description description,
-                         d.shortdescription shortdescription,
-                         d.licence licence, d.date date, 
-                         d.source source,
-                         COUNT(n.vertices) nnets,
-                         MIN(n.vertices) minv, MAX(n.vertices) maxv, 
-                         MIN(n.edges) mine, MAX(n.edges) maxe'''
-        where='''d.id=dt.dataset 
-                 AND n.dataset=d.id
-                 AND dt.tag=t.id 
-                 AND t.tag IN %s''' % tagstr
-        group="d.id"
-        res=db.select(table, what=what, where=where, order=ord[order],
-                      offset=offset, limit=limit, group=group)
-        count=list(db.select(table, what='COUNT(DISTINCT d.id) c',
-                             where=where))[0].c
-    else:
-        table="dataset d, network n"
-        what='''d.id id, d.sid sid, d.name name,
-                d.description description, 
-                d.shortdescription shortdescription,
-                d.licence licence, d.date date, d.source source,
-                COUNT(n.vertices) nnets,
-                MIN(n.vertices) minv, MAX(n.vertices) maxv, 
-                MIN(n.edges) mine, MAX(n.edges) maxe'''
-        where='''d.id IN (SELECT id FROM 
-                                    (SELECT dt.dataset id, COUNT(*) count
-                                     FROM dataset_tag dt, tag t
-                                     WHERE dt.tag=t.id AND t.tag IN %s
-                                     GROUP BY dt.dataset)
-                                 WHERE count=%s)
-                 AND n.dataset=d.id
-                 ''' % (tagstr, len(tagname))
-        group="d.id"
-        res=db.select(table, what=what, where=where, order=ord[order],
-                      offset=offset, limit=limit, group=group)
-        count=list(db.select(table, what='COUNT(*) c', where=where))[0].c
-    
-    return list(res), count
-
-def get_list_of_datasets(ids=None, order="date", limit=10, offset=0):
-
-    ord={ 'date': 'd.date DESC, d.id DESC',
-          'name': 'd.name',
-          'popularity': 'd.downloads DESC, d.date DESC, d.id DESC' }
-
-    if ids is None:
-        where=''
-        where2=None
-    else:
-        ids=[str(i) for i in ids]
-        where='AND d.id IN (' + ','.join(ids) + ')'
-        where2='id IN (' + ','.join(ids) + ')'
-
-    count=list(db.select('dataset', what='COUNT(id) count', 
-                         where=where2))[0].count
-
-    res=db.query('''SELECT d.id id, d.sid sid, d.name name, 
-                           d.description description, 
-                           d.shortdescription shortdescription,
-                           d.licence licence, d.date date, d.source source,
-                           COUNT(n.vertices) nnets,
-                           MIN(n.vertices) minv, MAX(n.vertices) maxv, 
-                           MIN(n.edges) mine, MAX(n.edges) maxe
-                    FROM dataset d, network n
-                    WHERE n.dataset=d.id %s
-                    GROUP BY d.id
-                    ORDER BY %s
-                    LIMIT %s 
-                    OFFSET %s''' % (where, ord[order], 
-                                    int(limit), int(offset)))
-    res=list(res)
-    return res, count
-
-def get_dataset_ids():
-    return list(db.select('dataset', what='id', order='id'))
-
-def get_tags(id):
-    return db.query('''SELECT t.id, t.tag 
-                       FROM tag t, dataset_tag d
-                       WHERE t.id=d.tag AND dataset=$id
-                       ORDER BY t.tag''', 
-                    vars={'id': id})
-
-def get_dataset(id):
-    return db.query('''SELECT d.id id, d.sid sid, d.name name, 
-                              d.description description, 
-                              d.shortdescription shortdescription,
-                              l.id licence,
-                              l.name licence_name,
-                              l.link licence_url,
-                              d.date date, d.source source,
-                              COUNT(n.vertices) nnets,
-                              MIN(n.vertices) minv, MAX(n.vertices) maxv, 
-                              MIN(n.edges) mine, MAX(n.edges) maxe
-                       FROM dataset d, licence l, network n
-                       WHERE d.licence=l.id
-                         AND d.id=n.dataset
-                         AND d.id=$id''',
-                    vars={'id': id})
-
-def delete_dataset(id):
-    db.delete('dataset', where='id=%s' % int(id))
-    db.delete('network', where='dataset=%s' % int(id))
-    db.delete('dataset_citation', where='dataset=%s' % int(id))
-    db.delete('dataset_tag', where='dataset=%s' % int(id))
-    db.delete('metadata', where='dataset=%s' % int(id))
-
-def delete_network(dataset, id):
-    where='dataset=%s AND id=%s' % (websafe(dataset), websafe(id))
-    db.delete('network', where=where)
-
-def get_dataset_filename(id):
-    res=list(db.select('dataset', what='sid', where='id=%s' % websafe(id)))
-    return res[0].sid
-
-def whatsnew():
-    return db.select('dataset', limit=5, order="date DESC, id DESC")
-
-def datatags():
-    return db.query('''SELECT t.tag tag, COUNT(*) count
-                       FROM dataset_tag dt, tag t 
-                       WHERE dt.tag=t.id 
-                       GROUP BY dt.tag
-                       ORDER BY count DESC;''')
-
-def get_formats():
-    return list(db.select('format'))
-
-def get_papers(id):
-    return db.query('''SELECT c.citation citation
-                       FROM citation c, dataset_citation d
-                       WHERE c.id=d.citation 
-                       AND d.dataset=%s''' % websafe(id))
-
-def get_format(name):
-    return db.select('format', where="name='%s'" % websafe(name))
-
-def get_licences(what=None):
-    return db.select('licence', what=what, order="name")
-
-def new_dataset(**args):
-    return db.insert('dataset', seqname='id', **args)
-
-def new_network(**args):
-    db.insert('network', seqname=None, **args)
-
-def new_citation(dataset, citation):
-    ex=list(db.select('citation', what='id', where='citation=$citation',
-                      vars={ 'citation': citation}))
-    if not ex:        
-        citid=db.insert('citation', seqname=None, citation=citation)
-    else:
-        citid=ex[0].id
-    db.insert('dataset_citation', seqname='id', 
-              dataset=dataset, citation=citid)
-
-def new_dataset_tag(dataset, tag):
-    ex=db.select('tag', what='id', where='tag=$tag', 
-                 vars={ 'tag': tag })
-    ex=[e for e in ex]
-    if not ex:
-        tagid=db.insert('tag', seqname='id', tag=tag)
-    else:
-        tagid=ex[0].id
-    db.insert('dataset_tag', seqname=None, dataset=dataset, tag=tagid)
-
-def delete_tags(id):
-    db.delete('dataset_tag', where='dataset=%s' % websafe(id))    
-
-def new_licence(**args):
-    return db.insert('licence', seqname="id", **args)
-
-def update_dataset(id, sid, name, shortdescription,
-                   description, licence, source, papers):
-
-    db.update('dataset', where='id=%s' % int(id), sid=sid, name=name,
-              shortdescription=shortdescription,
-              description=description, licence=int(licence), 
-              source=source)
-
-    db.delete('dataset_tag', where='dataset=%s' % int(id))
-
-    db.delete('dataset_citation', where='dataset=%s' % int(id))
-    for p in papers:
-        new_citation(id, p)
-    
-    return True
-
-def update_network(dataset, id, **args):
-    where='dataset=%s AND id=%s' % (websafe(dataset), websafe(id))
-    db.update('network', where=where, **args)
-    return True
-
-def get_username(openid=None):
-    if not openid:
-        openid=web.webopenid.status()
-    user=db.select('user', what='name', 
-                   where="openid='%s'" % websafe(openid))
-    if user:
-        return [u for u in user][0].name
-    else:
-        return None
-
-def get_licence(id):
-    return db.select('licence', where="id='%s'" % int(id))
-
-def update_licence(id, **args):
-    db.update('licence', where='id=%s' % int(id), **args)
-    return True
-
-def get_metadata(id):
-    what="DISTINCT dataset, type, name, description, datatype, network"
-    res=db.select('metadata', what=what,
-                  where='dataset=%s' % int(id), order="type")
-    return list(res)
-
-def delete_meta(id, type, name):
-    res=db.delete('metadata', where="dataset=%s AND type='%s' AND name='%s'" %
-                  (websafe(id), websafe(type), websafe(name)))
-
-def update_meta(id, type, name, **args):
-    res=db.update('metadata', where="dataset=%s AND type='%s' AND name='%s'" %
-                  (websafe(str(id)), websafe(type), websafe(name)),
-                  type=type, name=name, **args)
-
-def add_meta(id, type, name, **args):
-    res=db.insert('metadata', dataset=id, type=type, name=name,
-                  **args)
-
-def get_blog(ids=None, unpublished=False):
-    if ids is None:
-        limit=5
-        order='date DESC'
-        where='1=1'
-    else:
-        limit=None
-        order='id'
-        where="id in (" + ",".join(ids) + ")"
-
-    if not unpublished:
-        where=where + " AND published=1"
-
-    return list(db.select('blog', limit=limit, order=order, where=where))
-
-def new_blog_entry(**args):
-    return db.insert('blog', seqname='id', **args)
-
-def update_blog(id, **args):
-    db.update('blog', where='id=%s' % int(id), **args)
-
-def increase_downloads(id):
-    db.query('''UPDATE dataset SET downloads=downloads+1 WHERE id=%s''' % \
-                 int(id))
-
-def get_totals():
-    res=db.select('dataset', 
-                  what='COUNT(*) AS count, SUM(downloads) AS downloads')
-    return list(res)[0]
-
-def get_format_extensions():
-    res=db.select('format', what='name,extension')
-    return dict( (f.name,f.extension) for f in res )
-
-def get_format_extension(format):
-    res=db.select('format', what='extension', 
-                  where="name='%s'" % websafe(format))
-    return list(res)[0].extension
-
-def regexp(expr, item):
-    return int(re.search(expr, item, re.IGNORECASE) is not None)
-
-def install_regexp():
-    db._getctx().db.create_function('REGEXP', 2, regexp)
-
-## TODO: search in other fields: publication, metadata, number of vertices
-def do_search_query(tokens, offset=0, limit=10):
-
-    tokens=[ websafe(t) for t in tokens ]
-
-    if len(tokens)==0:
-        return range(1, get_totals().count+1)
-
-    install_regexp()
-
-    searchfields=['name', 'shortdescription', 'description']
-
-    recs=[]
-    i=0
-    while i < len(tokens):
-        if tokens[i] == '-' and i+1 < len(tokens) and tokens[i+1][-1] != ':':
-            recs.append( (None, tokens[i+1], True) )
-            i += 2
-        elif tokens[i] == '-' and i+2 < len(tokens) and \
-                tokens[i+1][-1] == ':':
-            recs.append( (tokens[i+1][:-1], tokens[i+2], True) )
-            i += 3
-        elif tokens[i] == '-':
-            i += 1
-        elif tokens[i][-1] == ':' and i+1 < len(tokens):
-            if tokens[i][:-1] in searchfields:
-                recs.append( (tokens[i][:-1], tokens[i+1]) )
-                i += 2
-            else:
-                recs.append( (None, tokens[i+1]) )
-                i += 2
-        else:
-            recs.append( (None, tokens[i]) )
-            i += 1
-
-    clause="%s %s REGEXP '\\b%s\\b'"
-
-    def allfields(rec):
-        if len(rec)>=3 and rec[2]:
-            n='NOT'
-            op=' AND '
-        else:
-            n=''
-            op=' OR '
-        return '(' + op.join([ clause % (f,n,rec[1]) 
-                               for f in searchfields]) + ')'
-
-    def term(rec):
-        if rec[0] is None:
-            return allfields(rec)
-        else:
-            if len(rec)>=3 and rec[2]:
-                n='NOT'
-            else:
-                n=''
-            return clause % (rec[0], n, rec[1])
-
-    where=' AND '.join([ term(r) for r in recs ])
-    
-    res=db.select('dataset', what='id', where=where)
-    return [r.id for r in res]
-
-def get_id_from_sid(sid):
-    res=list(db.select('dataset', what='id', 
-                       where="sid='%s'" % websafe(sid)))
-    if len(res)==0:
-        return None
-    else:
-        return str(res[0].id)
-
-def get_networks(dataset):
-    return list(db.select('network', where='dataset=%s' % websafe(dataset),
-                          order="id"))
-
-def get_net_id_from_sid(dataset, sid):
-    where="dataset=%s AND sid='%s'" % (websafe(dataset), websafe(sid))
-    res=list(db.select('network', what='id', where=where))
-    if len(res)==0:
-        return None
-    else:
-        return str(res[0].id)    
-
-def get_net_sid_from_id(dataset, id):
-    where="dataset=%s AND id=%s" % (websafe(dataset), websafe(id))
-    res=list(db.select('network', what='sid', where=where))
-    if len(res)==0:
-        return None
-    else:
-        return str(res[0].sid)
-
-def get_networks(id):
-    res=db.select('network', where='dataset=%s' % websafe(str(id)), 
-                  order='id')
-    return list(res)
-
-def get_sids():
-    res=db.select('dataset', what='id,sid')
-    return list(res)
-
-def update_filesize(id, format, size):
-    try:
-        db.insert('filesize', dataset=int(id), format=websafe(format), 
-                  size=int(size))
-    except:
-        db.update('filesize', where='dataset=%s AND format="%s"' %
-                  (int(id), websafe(format)), size=size)
-    return True
diff -Nru igraph-0.6.5~quantal1/nexus/python/odict.py igraph-0.6.5/nexus/python/odict.py
--- igraph-0.6.5~quantal1/nexus/python/odict.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/python/odict.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,54 +0,0 @@
-## {{{ http://code.activestate.com/recipes/107747/ (r3)
-from UserDict import UserDict
-
-class odict(UserDict):
-    def __init__(self, dict = None):
-        self._keys = []
-        UserDict.__init__(self, dict)
-
-    def __delitem__(self, key):
-        UserDict.__delitem__(self, key)
-        self._keys.remove(key)
-
-    def __setitem__(self, key, item):
-        UserDict.__setitem__(self, key, item)
-        if key not in self._keys: self._keys.append(key)
-
-    def clear(self):
-        UserDict.clear(self)
-        self._keys = []
-
-    def copy(self):
-        dict = UserDict.copy(self)
-        dict._keys = self._keys[:]
-        return dict
-
-    def items(self):
-        return zip(self._keys, self.values())
-
-    def keys(self):
-        return self._keys
-
-    def popitem(self):
-        try:
-            key = self._keys[-1]
-        except IndexError:
-            raise KeyError('dictionary is empty')
-
-        val = self[key]
-        del self[key]
-
-        return (key, val)
-
-    def setdefault(self, key, failobj = None):
-        UserDict.setdefault(self, key, failobj)
-        if key not in self._keys: self._keys.append(key)
-
-    def update(self, dict):
-        UserDict.update(self, dict)
-        for key in dict.keys():
-            if key not in self._keys: self._keys.append(key)
-
-    def values(self):
-        return map(self.get, self._keys)
-## end of http://code.activestate.com/recipes/107747/ }}}
diff -Nru igraph-0.6.5~quantal1/nexus/scripts/convert_db.py igraph-0.6.5/nexus/scripts/convert_db.py
--- igraph-0.6.5~quantal1/nexus/scripts/convert_db.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/scripts/convert_db.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,20 +0,0 @@
-#! /bin/env /home/csardi/software/bin/mypython
-
-import sqlite3
-import sys
-
-if len(sys.argv) <= 1:
-    print 'Give database file as argument'
-    sys.exit(1)
-
-con=sqlite3.connect(sys.argv[1])
-cur=con.cursor()
-
-con.execute('ALTER TABLE network ADD COLUMN directed BOOLEAN;')
-con.execute('ALTER TABLE network ADD COLUMN bipartite BOOLEAN;')
-con.execute('ALTER TABLE network ADD COLUMN weighted BOOLEAN;')
-con.execute('ALTER TABLE network ADD COLUMN sid TEXT;')
-
-con.execute('UPDATE network SET directed=0;')
-con.execute('UPDATE network SET bipartite=0;')
-con.execute('UPDATE network SET weighted=0;')
diff -Nru igraph-0.6.5~quantal1/nexus/scripts/rutils.R igraph-0.6.5/nexus/scripts/rutils.R
--- igraph-0.6.5~quantal1/nexus/scripts/rutils.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/scripts/rutils.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,141 +0,0 @@
-
-library(igraph)
-
-get.graph.list <- function(input_file) {
-  E <- new.env()
-  load(input_file, envir=E)
-  g <- get(ls(E), envir=E)
-  if (is.igraph(g)) {
-    g <- list(g)
-    names(g) <- strsplit(basename(input_file), ".", fixed=TRUE)[[1]][1]
-  }
-  g
-}
-
-zip.output <- function(tmp, output_file) {
-  system(paste(sep="", "cd ", tmp, ";", "zip ", basename(output_file), " *"))
-  file.copy(paste(sep="", tmp, "/", basename(output_file)), output_file)
-  NULL
-}
-
-create.tmp <- function() {
-  tmp <- tempdir()
-  ntmp <- paste(sep="", tmp, "/nexus")
-  unlink(ntmp, recursive=TRUE)
-  dir.create(ntmp)
-  ntmp
-}
-
-r.to.graphml <- function(input_file, output_file) {
-
-  g <- get.graph.list(input_file)
-
-  tmp <- create.tmp()
-  sapply(names(g), function(n) {
-    f <- paste(sep="", tmp, "/", n, ".GraphML")
-    write.graph(g[[n]], file=f, format="GraphML")
-  })
-
-  zip.output(tmp, output_file)
-  
-  NULL
-}
- 
-r.to.pajek <- function(input_file, output_file) {
-  g <- get.graph.list(input_file)
-
-  tmp <- create.tmp()
-  sapply(names(g), function(n) {
-    f <- paste(sep="", tmp, "/", n, ".net")
-    write.graph(g[[n]], file=f, format="Pajek")
-  })
-
-  zip.output(tmp, output_file)  
-  NULL
-}
-
-print_check <- function(res) {
-  sapply(names(res), function(x) {
-    cat(sep="", x, ":", paste(res[[x]], collapse=";"), "\n")
-  })
-  invisible(NULL)
-}
-
-r.check <- function(input_file, tags, netnames, netno, meta) {
-
-  res <- list()
-
-  ## Parse input
-  tags=strsplit(tags, ";")[[1]]
-  
-  ## File exists
-  if (! (res$`Data file exists` <- file.exists(input_file)) ) {
-    return(print_check(res))
-  }
-
-  ## Can be loaded
-  env <- new.env()
-  r <- try( { load(input_file, envir=env) }, silent=TRUE )
-  if (! (res$`Data file can be loaded` <- ! inherits(r, "try-error")) ) {
-    return(print_check(res))
-  }
-  
-  ## Contains a single object, an igraph graph or a list of igraph graphs
-  r <- length(ls(env)) == 1
-  if (r) {
-    G <- get(ls(env), envir=env)
-    r <- r && (is.igraph(G) || is.list(G))
-    if (r && !is.igraph(G)) { r <- r && all(sapply(G, is.igraph)) }
-  }
-  if (! (res$`File contains proper data` <- r) ) {
-    return(print_check(res))
-  }
-
-  ## Number of vertices and edges
-  if (is.igraph(G)) {
-    G <- list(G)
-  } else {
-    G <- G[strsplit(netnames, ";")[[1]]]
-  }
-  res$`Vertices` <- sapply(G, vcount)
-  res$`Edges` <- sapply(G, ecount)
-  
-  ## Tags
-  if ('directed' %in% tags) {
-    res$`Tags, directed` <- any(sapply(G, is.directed))
-  }
-  if ('undirected' %in% tags) {
-    res$`Tags, undirected` <- any(!sapply(G, is.directed))
-  }
-  if ('weighted' %in% tags) {
-    res$`Tags, weighted` <- any(sapply(G, function(x)
-                                       'weight' %in% list.edge.attributes(x)))
-  }
-  if ('bipartite' %in% tags) {
-    res$`Tags, bipartite` <-any(sapply(G, function(x)
-                                       'type' %in% list.vertex.attributes(x)))
-  }
-
-  ## Network properties, directed, weighted and bipartite, TODO
-  
-  ## Metadata
-  meta <- lapply(strsplit(meta, ";;")[[1]],
-                 function(x) strsplit(x, ";")[[1]])
-  va <- lapply(G, list.vertex.attributes)
-  ea <- lapply(G, list.edge.attributes)
-  ga <- lapply(G, list.graph.attributes)
-  netids <- strsplit(netno, ";")[[1]]
-  for (m in meta) {
-    aa <- switch(m[[1]], "vertex"=va, "edge"=ea, "graph"=ga)
-    res[[paste(sep="", "Metadata, ", m[[1]], ", ", m[[2]])]] <-
-      if (m[[3]] == "NULL") {
-        all(sapply(aa, function(x) m[[2]] %in% x))
-      } else {
-        m[[2]] %in% aa[[ match(m[[3]], netids) ]]
-      }
-    
-  }
-  
-  ## Finished
-  print_check(res)
-}
diff -Nru igraph-0.6.5~quantal1/nexus/static/dataset_schema.xsl igraph-0.6.5/nexus/static/dataset_schema.xsl
--- igraph-0.6.5~quantal1/nexus/static/dataset_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/dataset_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, dataset information
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="dataset" type="datasetType"/>
-
-  <xsd:complexType name="datasetType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="networks" type="networksType" />
-      <xsd:element name="tags" type="tagsType" minOccurs="0" />
-      <xsd:element name="attributes" type="attributesType" />
-      <xsd:element name="date" type="xsd:date" />
-      <xsd:element name="licence" type="xsd:string" />
-      <xsd:element name="licenceurl" type="xsd:anyURI" />
-      <xsd:element name="papers" type="papersType" />
-      <xsd:element name="formats" type="formatsType" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networksType">
-    <xsd:sequence>
-      <xsd:element name="network" type="networkType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networkType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="vertices" type="xsd:nonNegativeInteger" />
-      <xsd:element name="edges" type="xsd:nonNegativeInteger" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="tagsType">
-    <xsd:sequence>
-      <xsd:element name="tag" type="xsd:string" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="attributesType">
-    <xsd:sequence>
-      <xsd:element name="attribute" type="attributeType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="attributeType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="type" type="xsd:string" />
-      <xsd:element name="datatype" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="papersType">
-    <xsd:sequence>
-      <xsd:element name="paper" type="xsd:string" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>  
-
-  <xsd:complexType name="formatsType">
-    <xsd:sequence>
-      <xsd:element name="format" type="formatType" minOccurs="0"
-	maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>  
-
-  <xsd:complexType name="formatType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" minOccurs="0"
-		   maxOccurs="unbounded" />
-      <xsd:element name="size" type="xsd:nonNegativeInteger" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/static/format_schema.xsl igraph-0.6.5/nexus/static/format_schema.xsl
--- igraph-0.6.5~quantal1/nexus/static/format_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/format_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,29 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, data format(s)
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="dataformats" type="dataformatsType" />
-  
-  <xsd:complexType name="dataformatsType">
-    <xsd:sequence>
-      <xsd:element name="dataformat" type="dataformatType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-  <xsd:complexType name="dataformatType">
-    <xsd:sequence>
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="url" type="xsd:anyURI" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/static/general.css igraph-0.6.5/nexus/static/general.css
--- igraph-0.6.5~quantal1/nexus/static/general.css	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/general.css	1970-01-01 00:00:00.000000000 +0000
@@ -1,1575 +0,0 @@
-/*
-Theme Name: Twenty Ten
-Theme URI: http://wordpress.org/
-Description: The 2010 theme for WordPress is stylish, customizable, simple, and readable -- make it yours with a custom menu, header image, and background. Twenty Ten supports six widgetized areas (two in the sidebar, four in the footer) and featured images (thumbnails for gallery posts and custom header images for posts and pages). It includes stylesheets for print and the admin Visual Editor, special styles for posts in the "Asides" and "Gallery" categories, and has an optional one-column page template that removes the sidebar.
-Author: the WordPress team
-Version: 1.1
-Tags: black, blue, white, two-columns, fixed-width, custom-header, custom-background, threaded-comments, sticky-post, translation-ready, microformats, rtl-language-support, editor-style
-*/
-
-
-/* =Reset default browser CSS. Based on work by Eric Meyer: http://meyerweb.com/eric/tools/css/reset/index.html
--------------------------------------------------------------- */
-
-html, body, div, span, applet, object, iframe,
-h1, h2, h3, h4, h5, h6, p, blockquote, pre,
-a, abbr, acronym, address, big, cite, code,
-del, dfn, em, font, img, ins, kbd, q, s, samp,
-small, strike, strong, sub, sup, tt, var,
-b, u, i, center,
-dl, dt, dd, ol, ul, li,
-fieldset, form, label, legend,
-table, caption, tbody, tfoot, thead, tr, th, td {
-	background: transparent;
-	border: 0;
-	margin: 0;
-	padding: 0;
-	vertical-align: baseline;
-}
-body {
-}
-h1, h2, h3, h4, h5, h6 {
-	clear: both;
-	font-weight: bf;
-}
-ol, ul {
-	list-style: none;
-}
-blockquote {
-	quotes: none;
-}
-blockquote:before, blockquote:after {
-	content: '';
-	content: none;
-}
-del {
-	text-decoration: line-through;
-}
-/* tables still need 'cellspacing="0"' in the markup */
-table {
-	border-collapse: collapse;
-	border-spacing: 0;
-}
-a img {
-	border: none;
-}
-
-/* =Layout
--------------------------------------------------------------- */
-
-/*
-LAYOUT: Two columns
-DESCRIPTION: Two-column fixed layout with one sidebar right of content
-*/
-
-#container {
-	float: left;
-	margin: 0 -240px 0 0;
-	width: 100%;
-}
-#content {
-	margin: 0 280px 0 20px;
-}
-#primary {
-	float: right;
-	width: 233px;
-	padding: 0px;
-	margin-top: 0px;
-}
-#search,
-#secondary,
-#tertiary {
-	float: right;
-	overflow: hidden;
-	width: 220px;
-	border: 1px solid #bebebe;
-	padding: 5px;
-	margin-top: 5px;
-	margin-bottom: 10px;
-	background: #f0f0fa;
-}
-#search,
-#secondary,
-#tertiary {
-	clear: right;
-}
-#footer {
-	clear: both;
-	width: 100%;
-}
-
-/*
-LAYOUT: One column, no sidebar
-DESCRIPTION: One centered column with no sidebar
-*/
-
-.one-column #content {
-	margin: 0 auto;
-	width: 640px;
-}
-
-/*
-LAYOUT: Full width, no sidebar
-DESCRIPTION: Full width content with no sidebar; used for attachment pages
-*/
-
-.single-attachment #content {
-	margin: 0 auto;
-	width: 900px;
-}
-
-
-/* =Fonts
--------------------------------------------------------------- */
-body,
-input,
-textarea,
-.page-title span,
-.pingback a.url {
-	font-family: Georgia, "Bitstream Charter", serif;
-}
-h3#comments-title,
-h3#reply-title,
-#access .menu,
-#access div.menu ul,
-#cancel-comment-reply-link,
-.form-allowed-tags,
-#site-info,
-#site-title,
-#wp-calendar,
-.comment-meta,
-.comment-body tr th,
-.comment-body thead th,
-.entry-content label,
-.entry-content tr th,
-.entry-content thead th,
-.entry-meta,
-.entry-title,
-.entry-utility,
-#respond label,
-.navigation,
-.page-title,
-.pingback p,
-.reply,
-.widget-title,
-.wp-caption-text,
-input[type=submit] {
-	font-family: "Helvetica Neue", Helvetica, Arial, "Nimbus Sans L", sans-serif;
-}
-pre {
-	font-family: "Courier 10 Pitch", Courier, monospace;
-}
-code {
-	font-family: Monaco, Consolas, "Andale Mono", "DejaVu Sans Mono", monospace;
-}
-
-
-/* =Structure
--------------------------------------------------------------- */
-
-/* The main theme structure */
-#access .menu-header,
-div.menu,
-#colophon,
-#branding,
-#main,
-#wrapper {
-	margin: 0 auto;
-	width: 940px;
-}
-#wrapper {
-	background: #fff;
-	margin-top: 0px;
-	padding: 0 20px;
-}
-
-/* Structure the footer area */
-#footer-widget-area {
-	overflow: hidden;
-}
-#footer-widget-area .widget-area {
-	float: left;
-	margin-right: 20px;
-	width: 220px;
-}
-#footer-widget-area #fourth {
-	margin-right: 0;
-}
-#site-info {
-	float: left;
-	font-size: 14px;
-	font-weight: bold;
-	width: 700px;
-}
-#site-generator {
-	float: right;
-	width: 220px;
-}
-
-
-/* =Global Elements
--------------------------------------------------------------- */
-
-/* Main global 'theme' and typographic styles */
-body {
-	background: #f1f1f1;
-}
-body,
-input,
-textarea {
-	color: #666;
-	font-size: 12px;
-	line-height: 18px;
-}
-hr {
-	background-color: #e7e7e7;
-	border: 0;
-	clear: both;
-	height: 1px;
-	margin-bottom: 18px;
-}
-
-/* Text elements */
-p {
-    margin: 0px;
-}
-ul {
-	list-style: square;
-	margin: 0 0 18px 1.5em;
-}
-ol {
-	list-style: decimal;
-	margin: 0 0 18px 1.5em;
-}
-ol ol {
-	list-style: upper-alpha;
-}
-ol ol ol {
-	list-style: lower-roman;
-}
-ol ol ol ol {
-	list-style: lower-alpha;
-}
-ul ul,
-ol ol,
-ul ol,
-ol ul {
-	margin-bottom: 0;
-}
-dl {
-	margin: 0 0 24px 0;
-}
-dt {
-        font-size: 0.9em;
-	font-weight: bold;
-}
-dd {
-        font-size: 0.9em;
-	margin-bottom: 18px;
-}
-strong {
-	font-weight: bold;
-}
-cite,
-em,
-i {
-	font-style: italic;
-}
-big {
-	font-size: 131.25%;
-}
-ins {
-	background: #ffc;
-	text-decoration: none;
-}
-blockquote {
-	font-style: italic;
-	padding: 0 3em;
-}
-blockquote cite,
-blockquote em,
-blockquote i {
-	font-style: normal;
-}
-pre {
-	background: #f7f7f7;
-	color: #222;
-	line-height: 18px;
-	margin-bottom: 18px;
-	padding: 1.5em;
-}
-abbr,
-acronym {
-	border-bottom: 1px dotted #666;
-	cursor: help;
-}
-sup,
-sub {
-	height: 0;
-	line-height: 1;
-	position: relative;
-	vertical-align: baseline;
-}
-sup {
-	bottom: 1ex;
-}
-sub {
-	top: .5ex;
-}
-input[type="text"],
-textarea {
-	background: #f9f9f9;
-	border: 1px solid #ccc;
-	box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	-moz-box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	-webkit-box-shadow: inset 1px 1px 1px rgba(0,0,0,0.1);
-	padding: 2px;
-}
-a:link {
-	color: #0066cc;
-}
-a:visited {
-	color: #743399;
-}
-a:active,
-a:hover {
-	color: #ff4b33;
-}
-
-/* Text meant only for screen readers */
-.screen-reader-text {
-	position: absolute;
-	left: -9000px;
-}
-
-
-/* =Header
--------------------------------------------------------------- */
-
-#header {
-	padding: 10px 0 0 0;
-}
-#site-title {
-	float: left;
-	font-size: 4.5em;
-	line-height: 46px;
-	margin: 0 0 0px 0;
-	width: 700px;
-}
-#site-title a {
-	color: #000;
-	font-weight: bold;
-	text-decoration: none;
-}
-#site-description {
-	clear: left;
-	float: left;
-	margin: 0px 0 5px 0;
-	width: 220px;
-}
-
-/* This is the custom header image */
-#branding img {
-	border-top: 4px solid #000;
-	border-bottom: 1px solid #000;
-	clear: both;
-	display: block;
-}
-
-#branding #site-motto {
-    float: right;
-}
-
-/* =Menu
--------------------------------------------------------------- */
-
-#access {
-	background: #000;
-	display: block;
-	float: left;
-	margin: 0 auto;
-	width: 940px;
-}
-#access .menu-header,
-div.menu {
-	font-size: 13px;
-	font-weight: bold;
-	margin-left: 12px;
-	width: 928px;
-}
-#access .menu-header ul,
-div.menu ul {
-	list-style: none;
-	margin: 0;
-}
-#access .menu-header li,
-div.menu li {
-	float: left;
-	position: relative;
-}
-#access a {
-	color: #aaa;
-	display: block;
-	line-height: 38px;
-	padding: 0 10px;
-	text-decoration: none;
-}
-#access ul ul {
-	box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	-moz-box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	-webkit-box-shadow: 0px 3px 3px rgba(0,0,0,0.2);
-	display: none;
-	position: absolute;
-	top: 38px;
-	left: 0;
-	float: left;
-	width: 180px;
-	z-index: 99999;
-}
-#access ul ul li {
-	min-width: 180px;
-}
-#access ul ul ul {
-	left: 100%;
-	top: 0;
-}
-#access ul ul a {
-	background: #333;
-	line-height: 1em;
-	padding: 10px;
-	width: 160px;
-	height: auto;
-}
-#access li:hover > a,
-#access ul ul :hover > a {
-	background: #333;
-	color: #fff;
-}
-#access ul li:hover > ul {
-	display: block;
-}
-#access ul li.current_page_item > a,
-#access ul li.current-menu-ancestor > a,
-#access ul li.current-menu-item > a,
-#access ul li.current-menu-parent > a {
-	color: #fff;
-}
-* html #access ul li.current_page_item a,
-* html #access ul li.current-menu-ancestor a,
-* html #access ul li.current-menu-item a,
-* html #access ul li.current-menu-parent a,
-* html #access ul li a:hover {
-	color: #fff;
-}
-
-
-/* =Content
--------------------------------------------------------------- */
-
-#main {
-	clear: both;
-	overflow: hidden;
-	padding: 20px 0 0 0;
-}
-#content {
-	margin-bottom: 36px;
-}
-#content,
-#content input,
-#content textarea {
-	color: #333;
-	font-size: 16px;
-	line-height: 24px;
-}
-#content p,
-#content ul,
-#content ol,
-#content dd,
-#content pre,
-#content hr {
-	margin-bottom: 10px;
-}
-#content ul ul,
-#content ol ol,
-#content ul ol,
-#content ol ul {
-	margin-bottom: 0;
-}
-#content pre,
-#content kbd,
-#content tt,
-#content var {
-	font-size: 15px;
-	line-height: 21px;
-}
-#content code {
-	font-size: 13px;
-}
-#content dt,
-#content th {
-	color: #000;
-}
-#content h1,
-#content h2,
-#content h3 {
-	color: #000;
-	line-height: 1.5em;
-	margin: 0 0 10px -10px;
-}
-#content h4,
-#content h5,
-#content h6 {
-	color: #000;
-	line-height: 1.5em;
-	margin: 0 0 0px 0;
-}
-#content table {
-	border: 0px solid #e7e7e7;
-	margin: 0 -1px 24px 0;
-	text-align: left;
-	width: auto;
-}
-#content tr th,
-#content thead th {
-	color: #888;
-	font-size: 12px;
-	font-weight: bold;
-	line-height: 18px;
-	padding: 9px 24px;
-}
-#content tr td {
-	border-top: 0px solid #e7e7e7;
-	padding: 6px 26px 0px 0px;
-}
-#content tr.odd td {
-	background: #f2f7fc;
-}
-.hentry {
-	margin: 0 0 48px 0;
-}
-.home .sticky {
-	background: #f2f7fc;
-	border-top: 4px solid #000;
-	margin-left: -20px;
-	margin-right: -20px;
-	padding: 18px 20px;
-}
-.single .hentry {
-	margin: 0 0 36px 0;
-}
-.page-title {
-	color: #000;
-	font-size: 14px;
-	font-weight: bold;
-	margin: 0 0 36px 0;
-}
-.page-title span {
-	color: #333;
-	font-size: 16px;
-	font-style: italic;
-	font-weight: normal;
-}
-.page-title a:link,
-.page-title a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.page-title a:active,
-.page-title a:hover {
-	color: #ff4b33;
-}
-#content .entry-title {
-	color: #000;
-	font-size: 21px;
-	font-weight: bold;
-	line-height: 1.3em;
-	margin-bottom: 0;
-}
-.entry-title a:link,
-.entry-title a:visited {
-	color: #000;
-	text-decoration: none;
-}
-.entry-title a:active,
-.entry-title a:hover {
-	color: #ff4b33;
-}
-.entry-meta {
-	color: #888;
-	font-size: 12px;
-}
-.entry-meta abbr,
-.entry-utility abbr {
-	border: none;
-}
-.entry-meta abbr:hover,
-.entry-utility abbr:hover {
-	border-bottom: 1px dotted #666;
-}
-.entry-content,
-.entry-summary {
-	clear: both;
-	padding: 12px 0 0 0;
-}
-#content .entry-summary p:last-child {
-	margin-bottom: 12px;
-}
-.entry-content fieldset {
-	border: 1px solid #e7e7e7;
-	margin: 0 0 24px 0;
-	padding: 24px;
-}
-.entry-content fieldset legend {
-	background: #fff;
-	color: #000;
-	font-weight: bold;
-	padding: 0 24px;
-}
-.entry-content input {
-	margin: 0 0 24px 0;
-}
-.entry-content input.file,
-.entry-content input.button {
-	margin-right: 24px;
-}
-.entry-content label {
-	color: #888;
-	font-size: 12px;
-}
-.entry-content select {
-	margin: 0 0 24px 0;
-}
-.entry-content sup,
-.entry-content sub {
-	font-size: 10px;
-}
-.entry-content blockquote.left {
-	float: left;
-	margin-left: 0;
-	margin-right: 24px;
-	text-align: right;
-	width: 33%;
-}
-.entry-content blockquote.right {
-	float: right;
-	margin-left: 24px;
-	margin-right: 0;
-	text-align: left;
-	width: 33%;
-}
-.page-link {
-	color: #000;
-	font-weight: bold;
-	margin: 0 0 22px 0;
-	word-spacing: 0.5em;
-}
-.page-link a:link,
-.page-link a:visited {
-	background: #f1f1f1;
-	color: #333;
-	font-weight: normal;
-	padding: 0.5em 0.75em;
-	text-decoration: none;
-}
-.home .sticky .page-link a {
-	background: #d9e8f7;
-}
-.page-link a:active,
-.page-link a:hover {
-	color: #ff4b33;
-}
-body.page .edit-link {
-	clear: both;
-	display: block;
-}
-#entry-author-info {
-	background: #f2f7fc;
-	border-top: 4px solid #000;
-	clear: both;
-	font-size: 14px;
-	line-height: 20px;
-	margin: 24px 0;
-	overflow: hidden;
-	padding: 18px 20px;
-}
-#entry-author-info #author-avatar {
-	background: #fff;
-	border: 1px solid #e7e7e7;
-	float: left;
-	height: 60px;
-	margin: 0 -104px 0 0;
-	padding: 11px;
-}
-#entry-author-info #author-description {
-	float: left;
-	margin: 0 0 0 104px;
-}
-#entry-author-info h2 {
-	color: #000;
-	font-size: 100%;
-	font-weight: bold;
-	margin-bottom: 0;
-}
-.entry-utility {
-	clear: both;
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-}
-.entry-meta a,
-.entry-utility a {
-	color: #888;
-}
-.entry-meta a:hover,
-.entry-utility a:hover {
-	color: #ff4b33;
-}
-#content .video-player {
-	padding: 0;
-}
-
-
-/* =Asides
--------------------------------------------------------------- */
-
-.home #content .category-asides p {
-	font-size: 14px;
-	line-height: 20px;
-	margin-bottom: 10px;
-	margin-top: 0;
-}
-.home .hentry.category-asides {
-	padding: 0;
-}
-.home #content .category-asides .entry-content {
-	padding-top: 0;
-}
-
-
-/* =Gallery listing
--------------------------------------------------------------- */
-
-.category-gallery .size-thumbnail img {
-	border: 10px solid #f1f1f1;
-	margin-bottom: 0;
-}
-.category-gallery .gallery-thumb {
-	float: left;
-	margin-right: 20px;
-	margin-top: -4px;
-}
-.home #content .category-gallery .entry-utility {
-	padding-top: 4px;
-}
-
-
-/* =Attachment pages
--------------------------------------------------------------- */
-
-.attachment .entry-content .entry-caption {
-	font-size: 140%;
-	margin-top: 24px;
-}
-.attachment .entry-content .nav-previous a:before {
-	content: '\2190\00a0';
-}
-.attachment .entry-content .nav-next a:after {
-	content: '\00a0\2192';
-}
-
-
-/* =Images
--------------------------------------------------------------- */
-
-#content img {
-	margin: 0;
-	height: auto;
-	max-width: 640px;
-	width: auto;
-}
-#content .attachment img {
-	max-width: 900px;
-}
-#content .alignleft,
-#content img.alignleft {
-	display: inline;
-	float: left;
-	margin-right: 24px;
-	margin-top: 4px;
-}
-#content .alignright,
-#content img.alignright {
-	display: inline;
-	float: right;
-	margin-left: 24px;
-	margin-top: 4px;
-}
-#content .aligncenter,
-#content img.aligncenter {
-	clear: both;
-	display: block;
-	margin-left: auto;
-	margin-right: auto;
-}
-#content img.alignleft,
-#content img.alignright,
-#content img.aligncenter {
-	margin-bottom: 12px;
-}
-#content .wp-caption {
-	background: #f1f1f1;
-	line-height: 18px;
-	margin-bottom: 20px;
-	padding: 4px;
-	text-align: center;
-}
-#content .wp-caption img {
-	margin: 5px 5px 0;
-}
-#content .wp-caption p.wp-caption-text {
-	color: #888;
-	font-size: 12px;
-	margin: 5px;
-}
-#content .wp-smiley {
-	margin: 0;
-}
-#content .gallery {
-	margin: 0 auto 18px;
-}
-#content .gallery .gallery-item {
-	float: left;
-	margin-top: 0;
-	text-align: center;
-	width: 33%;
-}
-#content .gallery img {
-	border: 2px solid #cfcfcf;
-}
-#content .gallery .gallery-caption {
-	color: #888;
-	font-size: 12px;
-	margin: 0 0 12px;
-}
-#content .gallery dl {
-	margin: 0;
-}
-#content .gallery img {
-	border: 10px solid #f1f1f1;
-}
-#content .gallery br+br {
-	display: none;
-}
-#content .attachment img { /* single attachment images should be centered */
-	display: block;
-	margin: 0 auto;
-}
-
-
-/* =Navigation
--------------------------------------------------------------- */
-
-.navigation {
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-	overflow: hidden;
-}
-.navigation a:link,
-.navigation a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.navigation a:active,
-.navigation a:hover {
-	color: #ff4b33;
-}
-.nav-previous {
-	float: left;
-	width: 50%;
-}
-.nav-next {
-	float: right;
-	text-align: right;
-	width: 50%;
-}
-#nav-above {
-	margin: 0 0 18px 0;
-}
-#nav-above {
-	display: none;
-}
-.paged #nav-above,
-.single #nav-above {
-	display: block;
-}
-#nav-below {
-	margin: -18px 0 0 0;
-}
-
-
-/* =Comments
--------------------------------------------------------------- */
-#comments {
-	clear: both;
-}
-#comments .navigation {
-	padding: 0 0 18px 0;
-}
-h3#comments-title,
-h3#reply-title {
-	color: #000;
-	font-size: 20px;
-	font-weight: bold;
-	margin-bottom: 0;
-}
-h3#comments-title {
-	padding: 24px 0;
-}
-.commentlist {
-	list-style: none;
-	margin: 0;
-}
-.commentlist li.comment {
-	border-bottom: 1px solid #e7e7e7;
-	line-height: 24px;
-	margin: 0 0 24px 0;
-	padding: 0 0 0 56px;
-	position: relative;
-}
-.commentlist li:last-child {
-	border-bottom: none;
-	margin-bottom: 0;
-}
-#comments .comment-body ul,
-#comments .comment-body ol {
-	margin-bottom: 18px;
-}
-#comments .comment-body p:last-child {
-	margin-bottom: 6px;
-}
-#comments .comment-body blockquote p:last-child {
-	margin-bottom: 24px;
-}
-.commentlist ol {
-	list-style: decimal;
-}
-.commentlist .avatar {
-	position: absolute;
-	top: 4px;
-	left: 0;
-}
-.comment-author {
-}
-.comment-author cite {
-	color: #000;
-	font-style: normal;
-	font-weight: bold;
-}
-.comment-author .says {
-	font-style: italic;
-}
-.comment-meta {
-	font-size: 12px;
-	margin: 0 0 18px 0;
-}
-.comment-meta a:link,
-.comment-meta a:visited {
-	color: #888;
-	text-decoration: none;
-}
-.comment-meta a:active,
-.comment-meta a:hover {
-	color: #ff4b33;
-}
-.commentlist .even {
-}
-.commentlist .bypostauthor {
-}
-.reply {
-	font-size: 12px;
-	padding: 0 0 24px 0;
-}
-.reply a,
-a.comment-edit-link {
-	color: #888;
-}
-.reply a:hover,
-a.comment-edit-link:hover {
-	color: #ff4b33;
-}
-.commentlist .children {
-	list-style: none;
-	margin: 0;
-}
-.commentlist .children li {
-	border: none;
-	margin: 0;
-}
-.nopassword,
-.nocomments {
-	display: none;
-}
-#comments .pingback {
-	border-bottom: 1px solid #e7e7e7;
-	margin-bottom: 18px;
-	padding-bottom: 18px;
-}
-.commentlist li.comment+li.pingback {
-	margin-top: -6px;
-}
-#comments .pingback p {
-	color: #888;
-	display: block;
-	font-size: 12px;
-	line-height: 18px;
-	margin: 0;
-}
-#comments .pingback .url {
-	font-size: 13px;
-	font-style: italic;
-}
-
-/* Comments form */
-input[type=submit] {
-	color: #333;
-}
-#respond {
-	border-top: 1px solid #e7e7e7;
-	margin: 24px 0;
-	overflow: hidden;
-	position: relative;
-}
-#respond p {
-	margin: 0;
-}
-#respond .comment-notes {
-	margin-bottom: 1em;
-}
-.form-allowed-tags {
-	line-height: 1em;
-}
-.children #respond {
-	margin: 0 48px 0 0;
-}
-h3#reply-title {
-	margin: 18px 0;
-}
-#comments-list #respond {
-	margin: 0 0 18px 0;
-}
-#comments-list ul #respond {
-	margin: 0;
-}
-#cancel-comment-reply-link {
-	font-size: 12px;
-	font-weight: normal;
-	line-height: 18px;
-}
-#respond .required {
-	color: #ff4b33;
-	font-weight: bold;
-}
-#respond label {
-	color: #888;
-	font-size: 12px;
-}
-#respond input {
-	margin: 0 0 9px;
-	width: 98%;
-}
-#respond textarea {
-	width: 98%;
-}
-#respond .form-allowed-tags {
-	color: #888;
-	font-size: 12px;
-	line-height: 18px;
-}
-#respond .form-allowed-tags code {
-	font-size: 11px;
-}
-#respond .form-submit {
-	margin: 12px 0;
-}
-#respond .form-submit input {
-	font-size: 14px;
-	width: auto;
-}
-
-
-/* =Widget Areas
--------------------------------------------------------------- */
-
-.widget-area ul {
-	list-style: none;
-	margin-left: 0;
-}
-.widget-area ul ul {
-	list-style: square;
-	margin-left: 1.3em;
-}
-.widget_search #s {/* This keeps the search inputs in line */
-	width: 60%;
-}
-.widget_search label {
-	display: none;
-}
-.widget-container {
-	margin: 0 0 18px 0;
-}
-.widget-title {
-	color: #222;
-	font-weight: bold;
-}
-.widget-area a:link,
-.widget-area a:visited {
-	text-decoration: none;
-}
-.widget-area a:active,
-.widget-area a:hover {
-	text-decoration: underline;
-}
-.widget-area .entry-meta {
-	font-size: 11px;
-}
-#wp_tag_cloud div {
-	line-height: 1.6em;
-}
-#wp-calendar {
-	width: 100%;
-}
-#wp-calendar caption {
-	color: #222;
-	font-size: 14px;
-	font-weight: bold;
-	padding-bottom: 4px;
-	text-align: left;
-}
-#wp-calendar thead {
-	font-size: 11px;
-}
-#wp-calendar thead th {
-}
-#wp-calendar tbody {
-	color: #aaa;
-}
-#wp-calendar tbody td {
-	background: #f5f5f5;
-	border: 1px solid #fff;
-	padding: 3px 0 2px;
-	text-align: center;
-}
-#wp-calendar tbody .pad {
-	background: none;
-}
-#wp-calendar tfoot #next {
-	text-align: right;
-}
-.widget_rss a.rsswidget {
-	color: #000;
-}
-.widget_rss a.rsswidget:hover {
-	color: #ff4b33;
-}
-.widget_rss .widget-title img {
-	width: 11px;
-	height: 11px;
-}
-
-/* Main sidebars */
-#main .widget-area ul {
-	margin-left: 0;
-	padding: 0 20px 0 0;
-}
-#main .widget-area ul ul {
-	border: none;
-	margin-left: 1.3em;
-	padding: 0;
-}
-
-/* Footer widget areas */
-#footer-widget-area {
-}
-
-
-/* =Footer
--------------------------------------------------------------- */
-
-#footer {
-	margin-bottom: 20px;
-}
-#colophon {
-	border-top: 4px solid #000;
-	margin-top: -4px;
-	overflow: hidden;
-	padding: 18px 0;
-}
-#site-info {
-	font-weight: bold;
-}
-#site-info a {
-	color: #000;
-	text-decoration: none;
-}
-#site-generator {
-	font-style: italic;
-	position: relative;
-}
-#site-generator a {
-	background: url(images/wordpress.png) center left no-repeat;
-	color: #666;
-	display: inline-block;
-	line-height: 16px;
-	padding-left: 20px;
-	text-decoration: none;
-}
-#site-generator a:hover {
-	text-decoration: underline;
-}
-img#wpstats {
-	display: block;
-	margin: 0 auto 10px;
-}
-
-
-/* =Mobile Safari ( iPad, iPhone and iPod Touch )
--------------------------------------------------------------- */
-
-pre {
-	-webkit-text-size-adjust: 140%;
-}
-code {
-	-webkit-text-size-adjust: 160%;
-}
-#access,
-.entry-meta,
-.entry-utility,
-.navigation,
-.widget-area {
-	-webkit-text-size-adjust: 120%;
-}
-#site-description {
-	-webkit-text-size-adjust: none;
-}
-
-
-/* =Print Style
--------------------------------------------------------------- */
-
-@media print {
-	body {
-		background: none !important;
-	}
-	#wrapper {
-		clear: both !important;
-		display: block !important;
-		float: none !important;
-		position: relative !important;
-	}
-	#header {
-		border-bottom: 2pt solid #000;
-		padding-bottom: 18pt;
-	}
-	#colophon {
-		border-top: 2pt solid #000;
-	}
-	#site-title,
-	#site-description {
-		float: none;
-		line-height: 1.4em;
-		margin: 0;
-		padding: 0;
-	}
-	#site-title {
-		font-size: 13pt;
-	}
-	.entry-content {
-		font-size: 14pt;
-		line-height: 1.6em;
-	}
-	.entry-title {
-		font-size: 21pt;
-	}
-	#access,
-	#branding img,
-	#respond,
-	.comment-edit-link,
-	.edit-link,
-	.navigation,
-	.page-link,
-	.widget-area {
-		display: none !important;
-	}
-	#container,
-	#header,
-	#footer {
-		margin: 0;
-		width: 100%;
-	}
-	#content,
-	.one-column #content {
-		margin: 24pt 0 0;
-		width: 100%;
-	}
-	.wp-caption p {
-		font-size: 11pt;
-	}
-	#site-info,
-	#site-generator {
-		float: none;
-		width: auto;
-	}
-	#colophon {
-		width: auto;
-	}
-	img#wpstats {
-		display: none;
-	}
-	#site-generator a {
-		margin: 0;
-		padding: 0;
-	}
-	#entry-author-info {
-		border: 1px solid #e7e7e7;
-	}
-	#main {
-		display: inline;
-	}
-	.home .sticky {
-		border: none;
-	}
-}
-
-p.searchexamples {
-    font-size: 0.8em;
-}
-
-div.whatsnew {
-    margin-top: 30px;
-    margin-bottom: 0px;
-}
-ul.whatsnew {
-    list-style: square;
-    margin-bottom: 0px;
-}
-
-ul.whatsnew li {
-    margin-top: 10px;
-}
-
-ul.whatsnew p {
-    margin: 0px;
-}
-div.tags {
-    margin-top: 5px;
-}
-div.recaptcha {
-    margin-bottom: 20px;
-}
-form.failedcaptcha div.recaptcha {
-    border: 1px solid #f00;
-}
-.error {
-    color: #f00;
-}
-form.donateform th {
-    vertical-align: top;
-}
-#content ul.datasets {
-    list-style: none;
-    margin-bottom: 0px;
-    margin-left: 0px;
-    clear: both;
-}
-ul.datasets li {
-    padding: 0px;
-    margin-bottom: 20px;
-    margin-top: 0px;
-}
-#content ul.datasets p {
-    margin-bottom: 0px;
-    padding: 0px;
-}
-div.datasetdescription {
-    margin-left: 0px;
-    margin-top: 5px;
-}
-div.datasetdescription p {
-}
-div.datasetdescription ol {
-    margin-top: 0px;
-    margin-left: 30px;
-}
-p.datasettags {
-    font-size: 0.9em;
-    text-align: left;
-    font-style: italic;
-    margin-top: 0px;
-    margin-left: 20px;
-    margin-bottom: 10px;
-}
-a { 
-    text-decoration: none;
-}
-p.datasetdate {
-    font-size: 0.8em;
-    text-align: right;
-    color: #888;
-    font-style: italic;
-    margin-top: 3px;
-}
-#content h2.dataset {
-    margin-bottom: 0px;
-}
-#content p.datasettags2 {
-    font-size: 0.9em;
-    font-style: italic;
-    margin-bottom: 0px;
-}
-p.datasetdate2 {
-    font-size: 0.8em;
-    text-align: left;
-    color: #888;
-    font-style: italic;
-    margin-top: 3px;
-}
-span.tag1 {
-    font-size: 1em;
-}
-span.tag2 {
-    font-size: 1.2em;
-}
-span.tag3 {
-    font-size: 1.5em;
-}
-span.tag4 {
-    font-size: 2em;
-}
-span.tag5 {
-    font-size: 2.5em;
-}
-input.openid {
-    background: url(http://openid.net/login-bg.gif) no-repeat; 
-    padding-left: 18px; 
-    background-position: 0 50%;
-}
-span.username {
-    color: green;
-}
-div.feed {
-    float: right;
-    width: 50px;
-    text-align: right;
-}
-div.loginbox {
-    float: right;
-}
-div.title {
-    float:left;
-    margin-bottom: 0px;
-}
-div.dataset {
-    clear: both;
-}
-div.licence {
-    clear: both;
-}
-span.checkvalue {
-    font-weight: bold;
-}
-span.failure {
-    color: red;
-}
-span.edit a {
-    font-size: 0.6em;
-}
-p.wndate {
-    font-style: italic;
-}
-div.blogentry {
-    clear: both;
-}
-ul.download {
-    list-style: none;
-    margin: 0px;
-    margin-top: 0px;
-    margin-bottom: 0px;
-}
-
-#content div.docs table {
-    background: #eaeaea;
-    padding-left: 20px;
-    border: 1px solid;
-}
-#content div.docs table td {
-    padding:10px;
-}
-div.docs > ol {
-    list-style-type: none;
-    counter-reset: contents;
-}
-div.docs > ol > li {
-    counter-increment: contents;
-}
-div.docs > ol > li:before { 
-    content: counters(contents, ".") " ";
-}
-div.docs > ol > li > ol {
-    list-style-type: none;
-    counter-reset: contents2;
-}
-div.docs > ol > li > ol > li{
-    counter-increment: contents2;
-}
-div.docs > ol > li > ol > li:before { 
-    content: counters(contents, ".") "." counters(contents2, ".") " ";
-}
-div.docs {
-    counter-reset: section;
-}
-div.docs > h1 {
-    counter-increment: section;
-    counter-reset: subsection;
-}
-div.docs > h1:before {   
-    content: counters(section, ".") " ";
-}
-div.docs > h2 {
-    counter-increment: subsection;
-    counter-reset: subsubsection;
-}
-div.docs > h2:before {   
-    content: counters(section, ".") "." counters(subsection, ".") " ";
-}
-div.docs > h3 {
-    counter-increment: subsubsection;
-    counter-reset: subsubsubsection;
-}
-div.docs > h3:before {   
-    content: counters(section, ".") "." counters(subsection, ".") "." counters(subsubsection, ".") " ";
-}
-div.docs > h4 {
-    counter-increment: subsubsubsection;
-}
-div.docs > h4:before {   
-    content: counters(section, ".") "." counters(subsection, ".") "."
-    counters(subsubsection, ".") "." counters(subsubsubsection, ".") " ";
-}
-
-div.prevnexttable {
-    text-align: center;
-}
-span.actualpage {
-    font-size: 1.3em;
-    font-weight: bold;
-}
-span.prevpage {
-    margin-right: 20px;
-}
-span.nextpage {
-    margin-left: 20px;
-}
-#searchform {
-    margin-top: 27px;
-}
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/feed-icon-14x14.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/feed-icon-14x14.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/feed-icon-28x28.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/feed-icon-28x28.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/formats/Excel.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/formats/Excel.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/formats/GraphML.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/formats/GraphML.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/static/images/formats/GraphML.svg igraph-0.6.5/nexus/static/images/formats/GraphML.svg
--- igraph-0.6.5~quantal1/nexus/static/images/formats/GraphML.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/images/formats/GraphML.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,81 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   width="15.15625"
-   height="15.15625"
-   id="svg2"
-   version="1.1"
-   inkscape:version="0.48+devel r9931"
-   sodipodi:docname="GraphML.svg">
-  <defs
-     id="defs4" />
-  <sodipodi:namedview
-     id="base"
-     pagecolor="#ffffff"
-     bordercolor="#666666"
-     borderopacity="1.0"
-     inkscape:pageopacity="0.0"
-     inkscape:pageshadow="2"
-     inkscape:zoom="15.222146"
-     inkscape:cx="13.859872"
-     inkscape:cy="-0.43672206"
-     inkscape:document-units="px"
-     inkscape:current-layer="layer1"
-     showgrid="false"
-     fit-margin-top="0"
-     fit-margin-left="0"
-     fit-margin-right="0"
-     fit-margin-bottom="0"
-     inkscape:window-width="1680"
-     inkscape:window-height="1002"
-     inkscape:window-x="0"
-     inkscape:window-y="0"
-     inkscape:window-maximized="1" />
-  <metadata
-     id="metadata7">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-        <dc:title />
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <g
-     inkscape:label="Layer 1"
-     inkscape:groupmode="layer"
-     id="layer1"
-     transform="translate(-192.1875,-293.09375)">
-    <g
-       id="g3838">
-      <text
-         sodipodi:linespacing="125%"
-         id="text3069"
-         y="306.64789"
-         x="194.28571"
-         style="font-size:18px;font-style:normal;font-variant:normal;font-weight:bold;font-stretch:normal;text-align:start;line-height:125%;letter-spacing:0px;word-spacing:0px;writing-mode:lr-tb;text-anchor:start;fill:#000000;fill-opacity:1;stroke:none;font-family:Andale Mono;-inkscape-font-specification:Andale Mono Bold"
-         xml:space="preserve"><tspan
-           y="306.64789"
-           x="194.28571"
-           id="tspan3071"
-           sodipodi:role="line">G</tspan></text>
-      <rect
-         y="293.35229"
-         x="192.44569"
-         height="14.65"
-         width="14.65"
-         id="rect3068"
-         style="fill:none;stroke:#000000;stroke-width:0.5;stroke-miterlimit:4;stroke-opacity:1;stroke-dasharray:none;stroke-dashoffset:0" />
-    </g>
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/formats/Pajek.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/formats/Pajek.png differ
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/formats/Python-igraph.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/formats/Python-igraph.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/static/images/formats/Python-igraph.svg igraph-0.6.5/nexus/static/images/formats/Python-igraph.svg
--- igraph-0.6.5~quantal1/nexus/static/images/formats/Python-igraph.svg	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/images/formats/Python-igraph.svg	1970-01-01 00:00:00.000000000 +0000
@@ -1,282 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!-- Created with Inkscape (http://www.inkscape.org/) -->
-
-<svg
-   xmlns:dc="http://purl.org/dc/elements/1.1/"
-   xmlns:cc="http://creativecommons.org/ns#"
-   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
-   xmlns:svg="http://www.w3.org/2000/svg"
-   xmlns="http://www.w3.org/2000/svg"
-   xmlns:xlink="http://www.w3.org/1999/xlink"
-   xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
-   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
-   version="1.0"
-   id="svg2"
-   sodipodi:version="0.32"
-   inkscape:version="0.48+devel r9931"
-   sodipodi:docname="python-logo-inkscape.svg"
-   width="111.16135"
-   height="112.389">
-  <metadata
-     id="metadata371">
-    <rdf:RDF>
-      <cc:Work
-         rdf:about="">
-        <dc:format>image/svg+xml</dc:format>
-        <dc:type
-           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
-        <dc:title></dc:title>
-      </cc:Work>
-    </rdf:RDF>
-  </metadata>
-  <sodipodi:namedview
-     inkscape:window-height="882"
-     inkscape:window-width="1233"
-     inkscape:pageshadow="2"
-     inkscape:pageopacity="0.0"
-     guidetolerance="10.0"
-     gridtolerance="10.0"
-     objecttolerance="10.0"
-     borderopacity="1.0"
-     bordercolor="#666666"
-     pagecolor="#ffffff"
-     id="base"
-     inkscape:zoom="2.2672565"
-     inkscape:cx="-9.5609258"
-     inkscape:cy="46.898555"
-     inkscape:window-x="0"
-     inkscape:window-y="6"
-     inkscape:current-layer="svg2"
-     width="210mm"
-     height="40mm"
-     units="mm"
-     showgrid="false"
-     fit-margin-top="0"
-     fit-margin-left="0"
-     fit-margin-right="0"
-     fit-margin-bottom="0"
-     inkscape:window-maximized="0" />
-  <defs
-     id="defs4">
-    <linearGradient
-       id="linearGradient2795">
-      <stop
-         style="stop-color:#b8b8b8;stop-opacity:0.49803922;"
-         offset="0"
-         id="stop2797" />
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0;"
-         offset="1"
-         id="stop2799" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient2787">
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0.5;"
-         offset="0"
-         id="stop2789" />
-      <stop
-         style="stop-color:#7f7f7f;stop-opacity:0;"
-         offset="1"
-         id="stop2791" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient3676">
-      <stop
-         style="stop-color:#b2b2b2;stop-opacity:0.5;"
-         offset="0"
-         id="stop3678" />
-      <stop
-         style="stop-color:#b3b3b3;stop-opacity:0;"
-         offset="1"
-         id="stop3680" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient3236">
-      <stop
-         style="stop-color:#f4f4f4;stop-opacity:1"
-         offset="0"
-         id="stop3244" />
-      <stop
-         style="stop-color:white;stop-opacity:1"
-         offset="1"
-         id="stop3240" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient4671">
-      <stop
-         style="stop-color:#ffd43b;stop-opacity:1;"
-         offset="0"
-         id="stop4673" />
-      <stop
-         style="stop-color:#ffe873;stop-opacity:1"
-         offset="1"
-         id="stop4675" />
-    </linearGradient>
-    <linearGradient
-       id="linearGradient4689">
-      <stop
-         style="stop-color:#5a9fd4;stop-opacity:1;"
-         offset="0"
-         id="stop4691" />
-      <stop
-         style="stop-color:#306998;stop-opacity:1;"
-         offset="1"
-         id="stop4693" />
-    </linearGradient>
-    <linearGradient
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717"
-       id="linearGradient2987"
-       xlink:href="#linearGradient4671"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)" />
-    <linearGradient
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133"
-       id="linearGradient2990"
-       xlink:href="#linearGradient4689"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2587"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2589"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2248"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="172.94208"
-       y1="77.475983"
-       x2="26.670298"
-       y2="76.313133" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2250"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="translate(100.2702,99.61116)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient2255"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-11.5974,-7.60954)"
-       x1="224.23996"
-       y1="144.75717"
-       x2="-65.308502"
-       y2="144.75717" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient2258"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-11.5974,-7.60954)"
-       x1="172.94208"
-       y1="76.176224"
-       x2="26.670298"
-       y2="76.313133" />
-    <radialGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient2795"
-       id="radialGradient2801"
-       cx="61.518883"
-       cy="132.28575"
-       fx="61.518883"
-       fy="132.28575"
-       r="29.036913"
-       gradientTransform="matrix(1,0,0,0.177966,0,108.7434)"
-       gradientUnits="userSpaceOnUse" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient1475"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-9.399749,-5.305317)"
-       x1="150.96111"
-       y1="192.35176"
-       x2="112.03144"
-       y2="137.27299" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient1478"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-9.399749,-5.305317)"
-       x1="26.648937"
-       y1="20.603781"
-       x2="135.66525"
-       y2="114.39767" />
-    <radialGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient2795"
-       id="radialGradient1480"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(2.382716e-8,-0.296405,1.43676,4.683673e-7,-128.544,150.5202)"
-       cx="61.518883"
-       cy="132.28575"
-       fx="61.518883"
-       fy="132.28575"
-       r="29.036913" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4689"
-       id="linearGradient3109"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-3.8083784,1.0917366)"
-       x1="26.648937"
-       y1="20.603781"
-       x2="135.66525"
-       y2="114.39767" />
-    <linearGradient
-       inkscape:collect="always"
-       xlink:href="#linearGradient4671"
-       id="linearGradient3111"
-       gradientUnits="userSpaceOnUse"
-       gradientTransform="matrix(0.562541,0,0,0.567972,-3.8083784,1.0917366)"
-       x1="150.96111"
-       y1="192.35176"
-       x2="112.03144"
-       y2="137.27299" />
-  </defs>
-  <g
-     id="g3105"
-     transform="translate(-5.5913706,-6.3970536)">
-    <path
-       id="path1948"
-       d="m 60.510156,6.3979729 c -4.583653,0.021298 -8.960939,0.4122177 -12.8125,1.09375 C 36.35144,9.4962267 34.291407,13.691825 34.291406,21.429223 l 0,10.21875 26.8125,0 0,3.40625 -26.8125,0 -10.0625,0 c -7.792459,0 -14.6157592,4.683717 -16.7500002,13.59375 -2.46182,10.212966 -2.5710151,16.586023 0,27.25 1.9059283,7.937852 6.4575432,13.593748 14.2500002,13.59375 l 9.21875,0 0,-12.25 c 0,-8.849902 7.657144,-16.656248 16.75,-16.65625 l 26.78125,0 c 7.454951,0 13.406253,-6.138164 13.40625,-13.625 l 0,-25.53125 c 0,-7.266339 -6.12998,-12.7247775 -13.40625,-13.9375001 -4.605987,-0.7667253 -9.385097,-1.1150483 -13.96875,-1.09375 z m -14.5,8.2187501 c 2.769547,0 5.03125,2.298646 5.03125,5.125 -2e-6,2.816336 -2.261703,5.09375 -5.03125,5.09375 -2.779476,-1e-6 -5.03125,-2.277415 -5.03125,-5.09375 -1e-6,-2.826353 2.251774,-5.125 5.03125,-5.125 z"
-       style="fill:url(#linearGradient3109);fill-opacity:1"
-       inkscape:connector-curvature="0" />
-    <path
-       id="path1950"
-       d="m 91.228906,35.054223 0,11.90625 c 0,9.230755 -7.825895,16.999999 -16.75,17 l -26.78125,0 c -7.335833,0 -13.406249,6.278483 -13.40625,13.625 l 0,25.531247 c 0,7.26634 6.318588,11.54032 13.40625,13.625 8.487331,2.49561 16.626237,2.94663 26.78125,0 6.750155,-1.95439 13.406253,-5.88761 13.40625,-13.625 l 0,-10.218747 -26.78125,0 0,-3.40625 26.78125,0 13.406254,0 c 7.79246,0 10.69625,-5.435408 13.40624,-13.59375 2.79933,-8.398886 2.68022,-16.475776 0,-27.25 -1.92578,-7.757441 -5.60387,-13.59375 -13.40624,-13.59375 l -10.062504,0 z m -15.0625,64.65625 c 2.779478,3e-6 5.03125,2.277417 5.03125,5.093747 -2e-6,2.82635 -2.251775,5.125 -5.03125,5.125 -2.76955,0 -5.03125,-2.29865 -5.03125,-5.125 2e-6,-2.81633 2.261697,-5.093747 5.03125,-5.093747 z"
-       style="fill:url(#linearGradient3111);fill-opacity:1"
-       inkscape:connector-curvature="0" />
-  </g>
-</svg>
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/images/formats/R-igraph.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/images/formats/R-igraph.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/static/index_schema.xsl igraph-0.6.5/nexus/static/index_schema.xsl
--- igraph-0.6.5~quantal1/nexus/static/index_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/index_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, dataset list
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="datasets" type="datasetsType" />
-
-  <xsd:complexType name="datasetsType">
-    <xsd:sequence>
-      <xsd:element name="size" type="xsd:nonNegativeInteger" />
-      <xsd:element name="totalsize" type="xsd:nonNegativeInteger" />
-      <xsd:element name="offset" type="xsd:nonNegativeInteger" />
-      <xsd:element name="limit" type="xsd:nonNegativeInteger" />
-      <xsd:element name="dataset" type="datasetSummaryType" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="datasetSummaryType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="description" type="xsd:string" />
-      <xsd:element name="networks" type="networksType" />
-      <xsd:element name="tags" type="tagsType" />
-      <xsd:element name="date" type="xsd:date" />      
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networksType">
-    <xsd:sequence>
-      <xsd:element name="network" type="networkType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="networkType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="sid" type="xsd:string" />
-      <xsd:element name="vertices" type="xsd:nonNegativeInteger" />
-      <xsd:element name="edges" type="xsd:nonNegativeInteger" />
-      <xsd:element name="description" type="xsd:string" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-  <xsd:complexType name="tagsType">
-    <xsd:sequence>
-      <xsd:element name="tag" type="xsd:string" minOccurs="0" 
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-
-</xsd:schema>
diff -Nru igraph-0.6.5~quantal1/nexus/static/licence_schema.xsl igraph-0.6.5/nexus/static/licence_schema.xsl
--- igraph-0.6.5~quantal1/nexus/static/licence_schema.xsl	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/licence_schema.xsl	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" ?>
-<xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema">
-
-  <xsd:annotation>
-    <xsd:documentation xml:lang="en">
-      Nexus network repository, licence information
-      http://nexus.igraph.org 
-    </xsd:documentation>
-  </xsd:annotation>
-
-  <xsd:element name="licences" type="licencesType" />
-
-  <xsd:complexType name="licencesType">
-    <xsd:sequence>
-      <xsd:element name="licence" type="licenceType" minOccurs="0"
-		   maxOccurs="unbounded" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-  <xsd:complexType name="licenceType">
-    <xsd:sequence>
-      <xsd:element name="id" type="xsd:positiveInteger" />
-      <xsd:element name="name" type="xsd:string" />
-      <xsd:element name="shortdescription" type="xsd:string" />
-      <xsd:element name="url" type="xsd:anyURI" />
-      <xsd:element name="text" type="xsd:string" minOccurs="0" />
-    </xsd:sequence>
-  </xsd:complexType>
-  
-</xsd:schema>
-
-      
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/nexus/static/nexus_logo.R igraph-0.6.5/nexus/static/nexus_logo.R
--- igraph-0.6.5~quantal1/nexus/static/nexus_logo.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/nexus_logo.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-
-library(igraph)
-
-g <- graph.star(5, mode="undirected")
-g$layout <- rbind( c(0,0), c(-1,1), c(1,1), c(1,-1), c(-1,-1) )
-V(g)$size <- 80
-E(g)$width <- 30
-E(g)$color <- "black"
-V(g)$label <- c("X", "N", "E", "S", "U")
-V(g)$color <- "gold"
-V(g)$label.cex <- 7
-
-pdf("nexus_logo.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g)
-dev.off()
-
-pdf("nexus_logo_small.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g, vertex.label=NA)
-dev.off()
-
-pdf("nexus_logo_black.pdf")
-par(mar=c(0,0,0,0), bg="lightgrey")
-plot(g, vertex.color="black", vertex.label.color="white")
-dev.off()
-
-pdf("nexus_logo_black_small.pdf")
-par(mar=c(0,0,0,0), bg=rgb(0.9,0.9,0.9))
-plot(g, vertex.color="black", vertex.label.color="white", vertex.label=NA)
-dev.off()
-
-png("nexus_logo_black_small.png", width=160, height=160)
-par(mar=c(0,0,0,0), bg="transparent")
-plot(g, vertex.color="black", vertex.label.color="white", vertex.label=NA)
-dev.off()
diff -Nru igraph-0.6.5~quantal1/nexus/static/nexus_logo.pdf igraph-0.6.5/nexus/static/nexus_logo.pdf
--- igraph-0.6.5~quantal1/nexus/static/nexus_logo.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/nexus_logo.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,155 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-1.000 0.843 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q q
-BT
-0.000 0.000 0.545 rg
-/F7 1 Tf 84.00 0.00 -0.00 84.00 221.68 224.20 Tm (X) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 391.32 Tm (N) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 393.00 390.86 Tm (E) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 395.31 57.53 Tm (S) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 58.12 Tm (U) Tj
-ET
-Q
-endstream
-endobj
-7 0 obj
-1606
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <</F7 9 0 R >>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-9 0 obj <<
-/Type /Font
-/Subtype /Type1
-/Name /F7
-/BaseFont /Times-Roman
-/Encoding 8 0 R
->> endobj
-xref
-0 10
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001972 00000 n 
-0000002055 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001952 00000 n 
-0000002136 00000 n 
-0000002393 00000 n 
-trailer
-<<
-/Size 10
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2491
-%%EOF
diff -Nru igraph-0.6.5~quantal1/nexus/static/nexus_logo_black.pdf igraph-0.6.5/nexus/static/nexus_logo_black.pdf
--- igraph-0.6.5~quantal1/nexus/static/nexus_logo_black.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/nexus_logo_black.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,155 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-0.000 0.000 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q q
-BT
-1.000 1.000 1.000 rg
-/F7 1 Tf 84.00 0.00 -0.00 84.00 221.68 224.20 Tm (X) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 391.32 Tm (N) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 393.00 390.86 Tm (E) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 395.31 57.53 Tm (S) Tj
-ET
-BT
-/F7 1 Tf 84.00 0.00 -0.00 84.00 55.01 58.12 Tm (U) Tj
-ET
-Q
-endstream
-endobj
-7 0 obj
-1606
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <</F7 9 0 R >>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-9 0 obj <<
-/Type /Font
-/Subtype /Type1
-/Name /F7
-/BaseFont /Times-Roman
-/Encoding 8 0 R
->> endobj
-xref
-0 10
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001972 00000 n 
-0000002055 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001952 00000 n 
-0000002136 00000 n 
-0000002393 00000 n 
-trailer
-<<
-/Size 10
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2491
-%%EOF
diff -Nru igraph-0.6.5~quantal1/nexus/static/nexus_logo_black_small.pdf igraph-0.6.5/nexus/static/nexus_logo_black_small.pdf
--- igraph-0.6.5~quantal1/nexus/static/nexus_logo_black_small.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/nexus_logo_black_small.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130120019)
-/ModDate (D:20110130120019)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.902 0.902 0.902 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-0.000 0.000 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q
-endstream
-endobj
-7 0 obj
-1275
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <<>>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-xref
-0 9
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001641 00000 n 
-0000001724 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001621 00000 n 
-0000001795 00000 n 
-trailer
-<<
-/Size 9
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2052
-%%EOF
Binary files /tmp/XqPRvCTKfk/igraph-0.6.5~quantal1/nexus/static/nexus_logo_black_small.png and /tmp/mkpaUile3f/igraph-0.6.5/nexus/static/nexus_logo_black_small.png differ
diff -Nru igraph-0.6.5~quantal1/nexus/static/nexus_logo_small.pdf igraph-0.6.5/nexus/static/nexus_logo_small.pdf
--- igraph-0.6.5~quantal1/nexus/static/nexus_logo_small.pdf	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/nexus/static/nexus_logo_small.pdf	1970-01-01 00:00:00.000000000 +0000
@@ -1,130 +0,0 @@
-%PDF-1.4
-%�â�ã�Ï�Ó\r
-1 0 obj
-<<
-/CreationDate (D:20110130115413)
-/ModDate (D:20110130115413)
-/Title (R Graphics Output)
-/Producer (R 2.12.0)
-/Creator (R)
->>
-endobj
-2 0 obj
-<<
-/Type /Catalog
-/Pages 3 0 R
->>
-endobj
-5 0 obj
-<<
-/Type /Page
-/Parent 3 0 R
-/Contents 6 0 R
-/Resources 4 0 R
->>
-endobj
-6 0 obj
-<<
-/Length 7 0 R
->>
-stream
-1 J 1 j q
-0.827 0.827 0.827 rg
-0 0 504.00 504.00 re f
-Q q
-Q q
-0.000 0.000 0.000 RG
-22.50 w
-[] 0 d
-1 J
-1 j
-10.00 M
-204.86 299.14 m 133.49 370.51 l S
-299.14 299.14 m 370.51 370.51 l S
-299.14 204.86 m 370.51 133.49 l S
-204.86 204.86 m 133.49 133.49 l S
-1.000 0.843 0.000 rg
-0.75 w
-[] 0 d
-  185.33 252.00 m
-  185.33 288.67 215.33 318.67 252.00 318.67 c
-  288.67 318.67 318.67 288.67 318.67 252.00 c
-  318.67 215.33 288.67 185.33 252.00 185.33 c
-  215.33 185.33 185.33 215.33 185.33 252.00 c
-B
-  18.67 418.67 m
-  18.67 455.33 48.67 485.33 85.33 485.33 c
-  122.00 485.33 152.00 455.33 152.00 418.67 c
-  152.00 382.00 122.00 352.00 85.33 352.00 c
-  48.67 352.00 18.67 382.00 18.67 418.67 c
-B
-  352.00 418.67 m
-  352.00 455.33 382.00 485.33 418.67 485.33 c
-  455.33 485.33 485.33 455.33 485.33 418.67 c
-  485.33 382.00 455.33 352.00 418.67 352.00 c
-  382.00 352.00 352.00 382.00 352.00 418.67 c
-B
-  352.00 85.33 m
-  352.00 122.00 382.00 152.00 418.67 152.00 c
-  455.33 152.00 485.33 122.00 485.33 85.33 c
-  485.33 48.67 455.33 18.67 418.67 18.67 c
-  382.00 18.67 352.00 48.67 352.00 85.33 c
-B
-  18.67 85.33 m
-  18.67 122.00 48.67 152.00 85.33 152.00 c
-  122.00 152.00 152.00 122.00 152.00 85.33 c
-  152.00 48.67 122.00 18.67 85.33 18.67 c
-  48.67 18.67 18.67 48.67 18.67 85.33 c
-B
-Q
-endstream
-endobj
-7 0 obj
-1275
-endobj
-3 0 obj
-<<
-/Type /Pages
-/Kids [
-5 0 R
-]
-/Count 1
-/MediaBox [0 0 504 504]
->>
-endobj
-4 0 obj
-<<
-/ProcSet [/PDF /Text]
-/Font <<>>
-/ExtGState << >>
->>
-endobj
-8 0 obj
-<<
-/Type /Encoding
-/BaseEncoding /WinAnsiEncoding
-/Differences [ 45/minus 96/quoteleft
-144/dotlessi /grave /acute /circumflex /tilde /macron /breve /dotaccent
-/dieresis /.notdef /ring /cedilla /.notdef /hungarumlaut /ogonek /caron /space]
->>
-endobj
-xref
-0 9
-0000000000 65535 f 
-0000000021 00000 n 
-0000000164 00000 n 
-0000001641 00000 n 
-0000001724 00000 n 
-0000000213 00000 n 
-0000000293 00000 n 
-0000001621 00000 n 
-0000001795 00000 n 
-trailer
-<<
-/Size 9
-/Info 1 0 R
-/Root 2 0 R
->>
-startxref
-2052
-%%EOF
diff -Nru igraph-0.6.5~quantal1/src/Makefile.in igraph-0.6.5/src/Makefile.in
--- igraph-0.6.5~quantal1/src/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/Makefile.in	2013-03-03 01:30:06.000000000 +0000
@@ -0,0 +1,6478 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+DIST_COMMON = $(include_HEADERS) $(srcdir)/../optional/glpk/glpk.inc \
+	$(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(srcdir)/lapack/arpack.inc $(srcdir)/lapack/blas.inc \
+	$(srcdir)/lapack/lapack.inc $(srcdir)/plfit/plfit.inc \
+	foreign-dl-lexer.c foreign-dl-parser.c foreign-dl-parser.h \
+	foreign-gml-lexer.c foreign-gml-parser.c foreign-gml-parser.h \
+	foreign-lgl-lexer.c foreign-lgl-parser.c foreign-lgl-parser.h \
+	foreign-ncol-lexer.c foreign-ncol-parser.c \
+	foreign-ncol-parser.h foreign-pajek-lexer.c \
+	foreign-pajek-parser.c foreign-pajek-parser.h
+@INTERNAL_F2C_TRUE@am__append_1 = f2c/arith.h
+@INTERNAL_GLPK_TRUE@am__append_2 = -I$(top_srcdir)/optional/glpk
+@INTERNAL_GLPK_TRUE@am__append_3 = -I$(top_srcdir)/optional/glpk
+subdir = src
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"
+LTLIBRARIES = $(lib_LTLIBRARIES) $(noinst_LTLIBRARIES)
+libarpack_la_LIBADD =
+am__libarpack_la_SOURCES_DIST = f2c.h lapack/dnaupd.c lapack/dnaup2.c \
+	lapack/dgetv0.c lapack/dvout.c lapack/second.c lapack/dmout.c \
+	lapack/dnaitr.c lapack/ivout.c lapack/dnapps.c lapack/dnconv.c \
+	lapack/dneigh.c lapack/dlaqrb.c lapack/dngets.c \
+	lapack/dsortc.c lapack/dstatn.c lapack/dneupd.c \
+	lapack/dsaupd.c lapack/dsaup2.c lapack/dsaitr.c \
+	lapack/dsapps.c lapack/dsconv.c lapack/dseigt.c \
+	lapack/dstqrb.c lapack/dsgets.c lapack/dsortr.c \
+	lapack/dstats.c lapack/dseupd.c lapack/dsesrt.c
+am__objects_1 = libarpack_la-dnaupd.lo libarpack_la-dnaup2.lo \
+	libarpack_la-dgetv0.lo libarpack_la-dvout.lo \
+	libarpack_la-second.lo libarpack_la-dmout.lo \
+	libarpack_la-dnaitr.lo libarpack_la-ivout.lo \
+	libarpack_la-dnapps.lo libarpack_la-dnconv.lo \
+	libarpack_la-dneigh.lo libarpack_la-dlaqrb.lo \
+	libarpack_la-dngets.lo libarpack_la-dsortc.lo \
+	libarpack_la-dstatn.lo libarpack_la-dneupd.lo \
+	libarpack_la-dsaupd.lo libarpack_la-dsaup2.lo \
+	libarpack_la-dsaitr.lo libarpack_la-dsapps.lo \
+	libarpack_la-dsconv.lo libarpack_la-dseigt.lo \
+	libarpack_la-dstqrb.lo libarpack_la-dsgets.lo \
+	libarpack_la-dsortr.lo libarpack_la-dstats.lo \
+	libarpack_la-dseupd.lo libarpack_la-dsesrt.lo
+@INTERNAL_ARPACK_TRUE@am_libarpack_la_OBJECTS = $(am__objects_1)
+libarpack_la_OBJECTS = $(am_libarpack_la_OBJECTS)
+libarpack_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(libarpack_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_ARPACK_TRUE@am_libarpack_la_rpath =
+libblas_la_LIBADD =
+am__libblas_la_SOURCES_DIST = f2c.h lapack/dscal.c lapack/dswap.c \
+	lapack/lsame.c lapack/idamax.c lapack/daxpy.c lapack/dgemv.c \
+	lapack/dger.c lapack/dnrm2.c lapack/dgemm.c lapack/dcopy.c \
+	lapack/dtrmm.c lapack/dtrmv.c lapack/drot.c lapack/ddot.c \
+	lapack/dasum.c lapack/dsymv.c lapack/dsyr2k.c lapack/dsyr2.c \
+	lapack/dtrsm.c
+am__objects_2 = libblas_la-dscal.lo libblas_la-dswap.lo \
+	libblas_la-lsame.lo libblas_la-idamax.lo libblas_la-daxpy.lo \
+	libblas_la-dgemv.lo libblas_la-dger.lo libblas_la-dnrm2.lo \
+	libblas_la-dgemm.lo libblas_la-dcopy.lo libblas_la-dtrmm.lo \
+	libblas_la-dtrmv.lo libblas_la-drot.lo libblas_la-ddot.lo \
+	libblas_la-dasum.lo libblas_la-dsymv.lo libblas_la-dsyr2k.lo \
+	libblas_la-dsyr2.lo libblas_la-dtrsm.lo
+@INTERNAL_BLAS_TRUE@am_libblas_la_OBJECTS = $(am__objects_2)
+libblas_la_OBJECTS = $(am_libblas_la_OBJECTS)
+libblas_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(libblas_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_BLAS_TRUE@am_libblas_la_rpath =
+libdlamch_la_LIBADD =
+am__libdlamch_la_SOURCES_DIST = lapack/dlamch.c
+@INTERNAL_LAPACK_TRUE@am_libdlamch_la_OBJECTS =  \
+@INTERNAL_LAPACK_TRUE@	libdlamch_la-dlamch.lo
+libdlamch_la_OBJECTS = $(am_libdlamch_la_OBJECTS)
+libdlamch_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(libdlamch_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_LAPACK_TRUE@am_libdlamch_la_rpath =
+libf2c_la_LIBADD =
+am__libf2c_la_SOURCES_DIST = f2c.h f2c/fio.h f2c/fmt.h f2c/sysdep1.h \
+	f2c/sysdep1.h0 f2c/lio.h f2c/fp.h f2c/signal1.h f2c/signal1.h0 \
+	f2c/abort_.c f2c/dolio.c f2c/r_sin.c f2c/dummy.c f2c/dtime_.c \
+	f2c/iio.c f2c/r_sinh.c f2c/backspac.c f2c/due.c f2c/ilnw.c \
+	f2c/r_sqrt.c f2c/c_abs.c f2c/ef1asc_.c f2c/inquire.c \
+	f2c/r_tan.c f2c/c_cos.c f2c/ef1cmc_.c f2c/l_ge.c f2c/r_tanh.c \
+	f2c/c_div.c f2c/endfile.c f2c/l_gt.c f2c/rdfmt.c f2c/c_exp.c \
+	f2c/erf_.c f2c/l_le.c f2c/rewind.c f2c/c_log.c f2c/erfc_.c \
+	f2c/l_lt.c f2c/rsfe.c f2c/c_sin.c f2c/err.c f2c/lbitbits.c \
+	f2c/rsli.c f2c/c_sqrt.c f2c/etime_.c f2c/lbitshft.c f2c/rsne.c \
+	f2c/cabs.c f2c/exit_.c f2c/lread.c f2c/s_cat.c f2c/close.c \
+	f2c/f77_aloc.c f2c/lwrite.c f2c/s_cmp.c f2c/ctype.c \
+	f2c/f77vers.c f2c/s_copy.c f2c/d_abs.c f2c/fmt.c f2c/open.c \
+	f2c/s_paus.c f2c/d_acos.c f2c/fmtlib.c f2c/pow_ci.c \
+	f2c/s_rnge.c f2c/d_asin.c f2c/ftell_.c f2c/pow_dd.c \
+	f2c/s_stop.c f2c/d_atan.c f2c/pow_di.c f2c/sfe.c f2c/d_atn2.c \
+	f2c/getenv_.c f2c/pow_hh.c f2c/sig_die.c f2c/d_cnjg.c \
+	f2c/h_abs.c f2c/pow_ii.c f2c/signal_.c f2c/d_cos.c f2c/h_dim.c \
+	f2c/pow_ri.c f2c/signbit.c f2c/d_cosh.c f2c/h_dnnt.c \
+	f2c/pow_zi.c f2c/sue.c f2c/d_dim.c f2c/h_indx.c f2c/pow_zz.c \
+	f2c/system_.c f2c/d_exp.c f2c/h_len.c f2c/r_abs.c \
+	f2c/typesize.c f2c/d_imag.c f2c/h_mod.c f2c/r_acos.c f2c/uio.c \
+	f2c/d_int.c f2c/h_nint.c f2c/r_asin.c f2c/uninit.c \
+	f2c/d_lg10.c f2c/h_sign.c f2c/r_atan.c f2c/util.c f2c/d_log.c \
+	f2c/hl_ge.c f2c/r_atn2.c f2c/wref.c f2c/d_mod.c f2c/hl_gt.c \
+	f2c/r_cnjg.c f2c/wrtfmt.c f2c/d_nint.c f2c/hl_le.c f2c/r_cos.c \
+	f2c/wsfe.c f2c/d_prod.c f2c/hl_lt.c f2c/r_cosh.c f2c/wsle.c \
+	f2c/d_sign.c f2c/i77vers.c f2c/r_dim.c f2c/wsne.c f2c/d_sin.c \
+	f2c/i_abs.c f2c/r_exp.c f2c/xwsne.c f2c/d_sinh.c f2c/i_dim.c \
+	f2c/r_imag.c f2c/z_abs.c f2c/d_sqrt.c f2c/i_dnnt.c f2c/r_int.c \
+	f2c/z_cos.c f2c/d_tan.c f2c/i_indx.c f2c/r_lg10.c f2c/z_div.c \
+	f2c/d_tanh.c f2c/i_len.c f2c/r_log.c f2c/z_exp.c f2c/derf_.c \
+	f2c/i_mod.c f2c/r_mod.c f2c/z_log.c f2c/derfc_.c f2c/i_nint.c \
+	f2c/r_nint.c f2c/z_sin.c f2c/dfe.c f2c/i_sign.c f2c/r_sign.c \
+	f2c/z_sqrt.c
+am__objects_3 = libf2c_la-abort_.lo libf2c_la-dolio.lo \
+	libf2c_la-r_sin.lo libf2c_la-dummy.lo libf2c_la-dtime_.lo \
+	libf2c_la-iio.lo libf2c_la-r_sinh.lo libf2c_la-backspac.lo \
+	libf2c_la-due.lo libf2c_la-ilnw.lo libf2c_la-r_sqrt.lo \
+	libf2c_la-c_abs.lo libf2c_la-ef1asc_.lo libf2c_la-inquire.lo \
+	libf2c_la-r_tan.lo libf2c_la-c_cos.lo libf2c_la-ef1cmc_.lo \
+	libf2c_la-l_ge.lo libf2c_la-r_tanh.lo libf2c_la-c_div.lo \
+	libf2c_la-endfile.lo libf2c_la-l_gt.lo libf2c_la-rdfmt.lo \
+	libf2c_la-c_exp.lo libf2c_la-erf_.lo libf2c_la-l_le.lo \
+	libf2c_la-rewind.lo libf2c_la-c_log.lo libf2c_la-erfc_.lo \
+	libf2c_la-l_lt.lo libf2c_la-rsfe.lo libf2c_la-c_sin.lo \
+	libf2c_la-err.lo libf2c_la-lbitbits.lo libf2c_la-rsli.lo \
+	libf2c_la-c_sqrt.lo libf2c_la-etime_.lo libf2c_la-lbitshft.lo \
+	libf2c_la-rsne.lo libf2c_la-cabs.lo libf2c_la-exit_.lo \
+	libf2c_la-lread.lo libf2c_la-s_cat.lo libf2c_la-close.lo \
+	libf2c_la-f77_aloc.lo libf2c_la-lwrite.lo libf2c_la-s_cmp.lo \
+	libf2c_la-ctype.lo libf2c_la-f77vers.lo libf2c_la-s_copy.lo \
+	libf2c_la-d_abs.lo libf2c_la-fmt.lo libf2c_la-open.lo \
+	libf2c_la-s_paus.lo libf2c_la-d_acos.lo libf2c_la-fmtlib.lo \
+	libf2c_la-pow_ci.lo libf2c_la-s_rnge.lo libf2c_la-d_asin.lo \
+	libf2c_la-ftell_.lo libf2c_la-pow_dd.lo libf2c_la-s_stop.lo \
+	libf2c_la-d_atan.lo libf2c_la-pow_di.lo libf2c_la-sfe.lo \
+	libf2c_la-d_atn2.lo libf2c_la-getenv_.lo libf2c_la-pow_hh.lo \
+	libf2c_la-sig_die.lo libf2c_la-d_cnjg.lo libf2c_la-h_abs.lo \
+	libf2c_la-pow_ii.lo libf2c_la-signal_.lo libf2c_la-d_cos.lo \
+	libf2c_la-h_dim.lo libf2c_la-pow_ri.lo libf2c_la-signbit.lo \
+	libf2c_la-d_cosh.lo libf2c_la-h_dnnt.lo libf2c_la-pow_zi.lo \
+	libf2c_la-sue.lo libf2c_la-d_dim.lo libf2c_la-h_indx.lo \
+	libf2c_la-pow_zz.lo libf2c_la-system_.lo libf2c_la-d_exp.lo \
+	libf2c_la-h_len.lo libf2c_la-r_abs.lo libf2c_la-typesize.lo \
+	libf2c_la-d_imag.lo libf2c_la-h_mod.lo libf2c_la-r_acos.lo \
+	libf2c_la-uio.lo libf2c_la-d_int.lo libf2c_la-h_nint.lo \
+	libf2c_la-r_asin.lo libf2c_la-uninit.lo libf2c_la-d_lg10.lo \
+	libf2c_la-h_sign.lo libf2c_la-r_atan.lo libf2c_la-util.lo \
+	libf2c_la-d_log.lo libf2c_la-hl_ge.lo libf2c_la-r_atn2.lo \
+	libf2c_la-wref.lo libf2c_la-d_mod.lo libf2c_la-hl_gt.lo \
+	libf2c_la-r_cnjg.lo libf2c_la-wrtfmt.lo libf2c_la-d_nint.lo \
+	libf2c_la-hl_le.lo libf2c_la-r_cos.lo libf2c_la-wsfe.lo \
+	libf2c_la-d_prod.lo libf2c_la-hl_lt.lo libf2c_la-r_cosh.lo \
+	libf2c_la-wsle.lo libf2c_la-d_sign.lo libf2c_la-i77vers.lo \
+	libf2c_la-r_dim.lo libf2c_la-wsne.lo libf2c_la-d_sin.lo \
+	libf2c_la-i_abs.lo libf2c_la-r_exp.lo libf2c_la-xwsne.lo \
+	libf2c_la-d_sinh.lo libf2c_la-i_dim.lo libf2c_la-r_imag.lo \
+	libf2c_la-z_abs.lo libf2c_la-d_sqrt.lo libf2c_la-i_dnnt.lo \
+	libf2c_la-r_int.lo libf2c_la-z_cos.lo libf2c_la-d_tan.lo \
+	libf2c_la-i_indx.lo libf2c_la-r_lg10.lo libf2c_la-z_div.lo \
+	libf2c_la-d_tanh.lo libf2c_la-i_len.lo libf2c_la-r_log.lo \
+	libf2c_la-z_exp.lo libf2c_la-derf_.lo libf2c_la-i_mod.lo \
+	libf2c_la-r_mod.lo libf2c_la-z_log.lo libf2c_la-derfc_.lo \
+	libf2c_la-i_nint.lo libf2c_la-r_nint.lo libf2c_la-z_sin.lo \
+	libf2c_la-dfe.lo libf2c_la-i_sign.lo libf2c_la-r_sign.lo \
+	libf2c_la-z_sqrt.lo
+@INTERNAL_F2C_TRUE@am_libf2c_la_OBJECTS = $(am__objects_3)
+libf2c_la_OBJECTS = $(am_libf2c_la_OBJECTS)
+libf2c_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(libf2c_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_F2C_TRUE@am_libf2c_la_rpath =
+libglpk_la_LIBADD =
+am__libglpk_la_SOURCES_DIST = ../optional/glpk/glpapi.h \
+	../optional/glpk/glpapi01.c ../optional/glpk/glpapi02.c \
+	../optional/glpk/glpapi03.c ../optional/glpk/glpapi04.c \
+	../optional/glpk/glpapi05.c ../optional/glpk/glpapi06.c \
+	../optional/glpk/glpapi07.c ../optional/glpk/glpapi08.c \
+	../optional/glpk/glpapi09.c ../optional/glpk/glpapi10.c \
+	../optional/glpk/glpapi11.c ../optional/glpk/glpapi12.c \
+	../optional/glpk/glpapi13.c ../optional/glpk/glpapi14.c \
+	../optional/glpk/glpapi15.c ../optional/glpk/glpapi16.c \
+	../optional/glpk/glpapi17.c ../optional/glpk/glpapi18.c \
+	../optional/glpk/glpapi19.c ../optional/glpk/glpavl.c \
+	../optional/glpk/glpavl.h ../optional/glpk/glpbfd.c \
+	../optional/glpk/glpbfd.h ../optional/glpk/glpbfx.c \
+	../optional/glpk/glpbfx.h ../optional/glpk/glpcpx.c \
+	../optional/glpk/glpdmp.c ../optional/glpk/glpdmp.h \
+	../optional/glpk/glpdmx.c ../optional/glpk/glpenv.h \
+	../optional/glpk/glpenv01.c ../optional/glpk/glpenv02.c \
+	../optional/glpk/glpenv03.c ../optional/glpk/glpenv04.c \
+	../optional/glpk/glpenv05.c ../optional/glpk/glpenv06.c \
+	../optional/glpk/glpenv07.c ../optional/glpk/glpenv08.c \
+	../optional/glpk/glpfhv.c ../optional/glpk/glpfhv.h \
+	../optional/glpk/glpgmp.c ../optional/glpk/glpgmp.h \
+	../optional/glpk/glphbm.c ../optional/glpk/glphbm.h \
+	../optional/glpk/glpini01.c ../optional/glpk/glpini02.c \
+	../optional/glpk/glpios.h ../optional/glpk/glpios01.c \
+	../optional/glpk/glpios02.c ../optional/glpk/glpios03.c \
+	../optional/glpk/glpios04.c ../optional/glpk/glpios05.c \
+	../optional/glpk/glpios06.c ../optional/glpk/glpios07.c \
+	../optional/glpk/glpios08.c ../optional/glpk/glpios09.c \
+	../optional/glpk/glpios10.c ../optional/glpk/glpios11.c \
+	../optional/glpk/glpios12.c ../optional/glpk/glpipm.c \
+	../optional/glpk/glpipm.h ../optional/glpk/glpk.h \
+	../optional/glpk/glplib.h ../optional/glpk/glplib01.c \
+	../optional/glpk/glplib02.c ../optional/glpk/glplib03.c \
+	../optional/glpk/glplpf.c ../optional/glpk/glplpf.h \
+	../optional/glpk/glplpx01.c ../optional/glpk/glplpx02.c \
+	../optional/glpk/glplpx03.c ../optional/glpk/glpluf.c \
+	../optional/glpk/glpluf.h ../optional/glpk/glplux.c \
+	../optional/glpk/glplux.h ../optional/glpk/glpmat.c \
+	../optional/glpk/glpmat.h ../optional/glpk/glpmpl.h \
+	../optional/glpk/glpmpl01.c ../optional/glpk/glpmpl02.c \
+	../optional/glpk/glpmpl03.c ../optional/glpk/glpmpl04.c \
+	../optional/glpk/glpmpl05.c ../optional/glpk/glpmpl06.c \
+	../optional/glpk/glpmps.c ../optional/glpk/glpnet.h \
+	../optional/glpk/glpnet01.c ../optional/glpk/glpnet02.c \
+	../optional/glpk/glpnet03.c ../optional/glpk/glpnet04.c \
+	../optional/glpk/glpnet05.c ../optional/glpk/glpnet06.c \
+	../optional/glpk/glpnet07.c ../optional/glpk/glpnet08.c \
+	../optional/glpk/glpnet09.c ../optional/glpk/glpnpp.h \
+	../optional/glpk/glpnpp01.c ../optional/glpk/glpnpp02.c \
+	../optional/glpk/glpnpp03.c ../optional/glpk/glpnpp04.c \
+	../optional/glpk/glpnpp05.c ../optional/glpk/glpqmd.c \
+	../optional/glpk/glpqmd.h ../optional/glpk/glprgr.c \
+	../optional/glpk/glprgr.h ../optional/glpk/glprng.h \
+	../optional/glpk/glprng01.c ../optional/glpk/glprng02.c \
+	../optional/glpk/glpscf.c ../optional/glpk/glpscf.h \
+	../optional/glpk/glpscl.c ../optional/glpk/glpsdf.c \
+	../optional/glpk/glpspm.c ../optional/glpk/glpspm.h \
+	../optional/glpk/glpspx.h ../optional/glpk/glpspx01.c \
+	../optional/glpk/glpspx02.c ../optional/glpk/glpsql.c \
+	../optional/glpk/glpsql.h ../optional/glpk/glpssx.h \
+	../optional/glpk/glpssx01.c ../optional/glpk/glpssx02.c \
+	../optional/glpk/glpstd.h ../optional/glpk/glptsp.c \
+	../optional/glpk/glptsp.h ../optional/glpk/amd/amd.h \
+	../optional/glpk/amd/amd_1.c ../optional/glpk/amd/amd_2.c \
+	../optional/glpk/amd/amd_aat.c \
+	../optional/glpk/amd/amd_control.c \
+	../optional/glpk/amd/amd_defaults.c \
+	../optional/glpk/amd/amd_dump.c \
+	../optional/glpk/amd/amd_info.c \
+	../optional/glpk/amd/amd_internal.h \
+	../optional/glpk/amd/amd_order.c \
+	../optional/glpk/amd/amd_post_tree.c \
+	../optional/glpk/amd/amd_postorder.c \
+	../optional/glpk/amd/amd_preprocess.c \
+	../optional/glpk/amd/amd_valid.c \
+	../optional/glpk/colamd/colamd.c \
+	../optional/glpk/colamd/colamd.h
+am__objects_4 = libglpk_la-glpapi01.lo libglpk_la-glpapi02.lo \
+	libglpk_la-glpapi03.lo libglpk_la-glpapi04.lo \
+	libglpk_la-glpapi05.lo libglpk_la-glpapi06.lo \
+	libglpk_la-glpapi07.lo libglpk_la-glpapi08.lo \
+	libglpk_la-glpapi09.lo libglpk_la-glpapi10.lo \
+	libglpk_la-glpapi11.lo libglpk_la-glpapi12.lo \
+	libglpk_la-glpapi13.lo libglpk_la-glpapi14.lo \
+	libglpk_la-glpapi15.lo libglpk_la-glpapi16.lo \
+	libglpk_la-glpapi17.lo libglpk_la-glpapi18.lo \
+	libglpk_la-glpapi19.lo libglpk_la-glpavl.lo \
+	libglpk_la-glpbfd.lo libglpk_la-glpbfx.lo libglpk_la-glpcpx.lo \
+	libglpk_la-glpdmp.lo libglpk_la-glpdmx.lo \
+	libglpk_la-glpenv01.lo libglpk_la-glpenv02.lo \
+	libglpk_la-glpenv03.lo libglpk_la-glpenv04.lo \
+	libglpk_la-glpenv05.lo libglpk_la-glpenv06.lo \
+	libglpk_la-glpenv07.lo libglpk_la-glpenv08.lo \
+	libglpk_la-glpfhv.lo libglpk_la-glpgmp.lo libglpk_la-glphbm.lo \
+	libglpk_la-glpini01.lo libglpk_la-glpini02.lo \
+	libglpk_la-glpios01.lo libglpk_la-glpios02.lo \
+	libglpk_la-glpios03.lo libglpk_la-glpios04.lo \
+	libglpk_la-glpios05.lo libglpk_la-glpios06.lo \
+	libglpk_la-glpios07.lo libglpk_la-glpios08.lo \
+	libglpk_la-glpios09.lo libglpk_la-glpios10.lo \
+	libglpk_la-glpios11.lo libglpk_la-glpios12.lo \
+	libglpk_la-glpipm.lo libglpk_la-glplib01.lo \
+	libglpk_la-glplib02.lo libglpk_la-glplib03.lo \
+	libglpk_la-glplpf.lo libglpk_la-glplpx01.lo \
+	libglpk_la-glplpx02.lo libglpk_la-glplpx03.lo \
+	libglpk_la-glpluf.lo libglpk_la-glplux.lo libglpk_la-glpmat.lo \
+	libglpk_la-glpmpl01.lo libglpk_la-glpmpl02.lo \
+	libglpk_la-glpmpl03.lo libglpk_la-glpmpl04.lo \
+	libglpk_la-glpmpl05.lo libglpk_la-glpmpl06.lo \
+	libglpk_la-glpmps.lo libglpk_la-glpnet01.lo \
+	libglpk_la-glpnet02.lo libglpk_la-glpnet03.lo \
+	libglpk_la-glpnet04.lo libglpk_la-glpnet05.lo \
+	libglpk_la-glpnet06.lo libglpk_la-glpnet07.lo \
+	libglpk_la-glpnet08.lo libglpk_la-glpnet09.lo \
+	libglpk_la-glpnpp01.lo libglpk_la-glpnpp02.lo \
+	libglpk_la-glpnpp03.lo libglpk_la-glpnpp04.lo \
+	libglpk_la-glpnpp05.lo libglpk_la-glpqmd.lo \
+	libglpk_la-glprgr.lo libglpk_la-glprng01.lo \
+	libglpk_la-glprng02.lo libglpk_la-glpscf.lo \
+	libglpk_la-glpscl.lo libglpk_la-glpsdf.lo libglpk_la-glpspm.lo \
+	libglpk_la-glpspx01.lo libglpk_la-glpspx02.lo \
+	libglpk_la-glpsql.lo libglpk_la-glpssx01.lo \
+	libglpk_la-glpssx02.lo libglpk_la-glptsp.lo \
+	libglpk_la-amd_1.lo libglpk_la-amd_2.lo libglpk_la-amd_aat.lo \
+	libglpk_la-amd_control.lo libglpk_la-amd_defaults.lo \
+	libglpk_la-amd_dump.lo libglpk_la-amd_info.lo \
+	libglpk_la-amd_order.lo libglpk_la-amd_post_tree.lo \
+	libglpk_la-amd_postorder.lo libglpk_la-amd_preprocess.lo \
+	libglpk_la-amd_valid.lo libglpk_la-colamd.lo
+@INTERNAL_GLPK_TRUE@am_libglpk_la_OBJECTS = $(am__objects_4)
+libglpk_la_OBJECTS = $(am_libglpk_la_OBJECTS)
+libglpk_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(libglpk_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_GLPK_TRUE@am_libglpk_la_rpath =
+am__DEPENDENCIES_1 =
+libigraph_la_DEPENDENCIES = $(am__DEPENDENCIES_1) $(F2C_LIB) \
+	$(BLAS_LIB) $(LAPACK_LIB) $(ARPACK_LIB) $(GLPK_LIB) \
+	$(PLFIT_LIB)
+am__objects_5 = libigraph_la-cs_add.lo libigraph_la-cs_happly.lo \
+	libigraph_la-cs_pvec.lo libigraph_la-cs_amd.lo \
+	libigraph_la-cs_house.lo libigraph_la-cs_qr.lo \
+	libigraph_la-cs_chol.lo libigraph_la-cs_ipvec.lo \
+	libigraph_la-cs_qrsol.lo libigraph_la-cs_cholsol.lo \
+	libigraph_la-cs_leaf.lo libigraph_la-cs_randperm.lo \
+	libigraph_la-cs_compress.lo libigraph_la-cs_load.lo \
+	libigraph_la-cs_reach.lo libigraph_la-cs_counts.lo \
+	libigraph_la-cs_lsolve.lo libigraph_la-cs_scatter.lo \
+	libigraph_la-cs_cumsum.lo libigraph_la-cs_ltsolve.lo \
+	libigraph_la-cs_scc.lo libigraph_la-cs_dfs.lo \
+	libigraph_la-cs_lu.lo libigraph_la-cs_schol.lo \
+	libigraph_la-cs_dmperm.lo libigraph_la-cs_lusol.lo \
+	libigraph_la-cs_spsolve.lo libigraph_la-cs_droptol.lo \
+	libigraph_la-cs_malloc.lo libigraph_la-cs_sqr.lo \
+	libigraph_la-cs_dropzeros.lo libigraph_la-cs_maxtrans.lo \
+	libigraph_la-cs_symperm.lo libigraph_la-cs_dupl.lo \
+	libigraph_la-cs_multiply.lo libigraph_la-cs_tdfs.lo \
+	libigraph_la-cs_entry.lo libigraph_la-cs_norm.lo \
+	libigraph_la-cs_transpose.lo libigraph_la-cs_ereach.lo \
+	libigraph_la-cs_permute.lo libigraph_la-cs_updown.lo \
+	libigraph_la-cs_etree.lo libigraph_la-cs_pinv.lo \
+	libigraph_la-cs_usolve.lo libigraph_la-cs_fkeep.lo \
+	libigraph_la-cs_post.lo libigraph_la-cs_util.lo \
+	libigraph_la-cs_gaxpy.lo libigraph_la-cs_print.lo \
+	libigraph_la-cs_utsolve.lo
+am__objects_6 = libigraph_la-basic_query.lo libigraph_la-games.lo \
+	libigraph_la-cocitation.lo libigraph_la-iterators.lo \
+	libigraph_la-structural_properties.lo \
+	libigraph_la-components.lo libigraph_la-layout.lo \
+	libigraph_la-structure_generators.lo \
+	libigraph_la-conversion.lo \
+	libigraph_la-type_indexededgelist.lo \
+	libigraph_la-spanning_trees.lo libigraph_la-igraph_error.lo \
+	libigraph_la-interrupt.lo libigraph_la-other.lo \
+	libigraph_la-foreign.lo libigraph_la-random.lo \
+	libigraph_la-attributes.lo libigraph_la-foreign-ncol-parser.lo \
+	libigraph_la-foreign-ncol-lexer.lo \
+	libigraph_la-foreign-lgl-parser.lo \
+	libigraph_la-foreign-lgl-lexer.lo \
+	libigraph_la-foreign-pajek-parser.lo \
+	libigraph_la-foreign-pajek-lexer.lo \
+	libigraph_la-foreign-gml-parser.lo \
+	libigraph_la-foreign-gml-lexer.lo libigraph_la-dqueue.lo \
+	libigraph_la-heap.lo libigraph_la-igraph_heap.lo \
+	libigraph_la-igraph_stack.lo libigraph_la-igraph_strvector.lo \
+	libigraph_la-igraph_trie.lo libigraph_la-matrix.lo \
+	libigraph_la-vector.lo libigraph_la-vector_ptr.lo \
+	libigraph_la-memory.lo libigraph_la-adjlist.lo \
+	libigraph_la-visitors.lo libigraph_la-igraph_grid.lo \
+	libigraph_la-atlas.lo libigraph_la-topology.lo \
+	libigraph_la-motifs.lo libigraph_la-progress.lo \
+	libigraph_la-operators.lo libigraph_la-igraph_psumtree.lo \
+	libigraph_la-array.lo libigraph_la-igraph_hashtable.lo \
+	libigraph_la-foreign-graphml.lo libigraph_la-flow.lo \
+	libigraph_la-igraph_buckets.lo libigraph_la-NetDataTypes.lo \
+	libigraph_la-NetRoutines.lo libigraph_la-clustertool.lo \
+	libigraph_la-pottsmodel_2.lo \
+	libigraph_la-spectral_properties.lo libigraph_la-cores.lo \
+	libigraph_la-igraph_set.lo libigraph_la-cliques.lo \
+	libigraph_la-revolver_cit.lo libigraph_la-revolver_grow.lo \
+	libigraph_la-walktrap.lo libigraph_la-walktrap_heap.lo \
+	libigraph_la-walktrap_graph.lo \
+	libigraph_la-walktrap_communities.lo libigraph_la-infomap.lo \
+	libigraph_la-infomap_Greedy.lo libigraph_la-infomap_Node.lo \
+	libigraph_la-infomap_FlowGraph.lo libigraph_la-spmatrix.lo \
+	libigraph_la-community.lo libigraph_la-fast_community.lo \
+	libigraph_la-evolver_cit.lo libigraph_la-gml_tree.lo \
+	libigraph_la-bliss_orbit.lo libigraph_la-bliss_eqrefhash.lo \
+	libigraph_la-bliss_partition.lo libigraph_la-bliss_graph.lo \
+	libigraph_la-bliss_timer.lo libigraph_la-bliss_heap.lo \
+	libigraph_la-bliss_utils.lo libigraph_la-bliss.lo \
+	libigraph_la-cattributes.lo libigraph_la-revolver_ml_cit.lo \
+	libigraph_la-zeroin.lo libigraph_la-bfgs.lo \
+	libigraph_la-math.lo libigraph_la-forestfire.lo \
+	libigraph_la-microscopic_update.lo libigraph_la-blas.lo \
+	libigraph_la-arpack.lo libigraph_la-centrality.lo \
+	libigraph_la-drl_layout.lo libigraph_la-drl_parse.lo \
+	libigraph_la-drl_graph.lo libigraph_la-DensityGrid.lo \
+	libigraph_la-gengraph_box_list.lo \
+	libigraph_la-gengraph_degree_sequence.lo \
+	libigraph_la-gengraph_graph_molloy_hash.lo \
+	libigraph_la-gengraph_graph_molloy_optimized.lo \
+	libigraph_la-gengraph_mr-connected.lo \
+	libigraph_la-gengraph_powerlaw.lo \
+	libigraph_la-gengraph_random.lo libigraph_la-decomposition.lo \
+	libigraph_la-bipartite.lo libigraph_la-drl_layout_3d.lo \
+	libigraph_la-drl_graph_3d.lo libigraph_la-DensityGrid_3d.lo \
+	libigraph_la-foreign-dl-parser.lo \
+	libigraph_la-foreign-dl-lexer.lo $(am__objects_5) \
+	libigraph_la-sparsemat.lo libigraph_la-mixing.lo \
+	libigraph_la-bigint.lo libigraph_la-bignum.lo \
+	libigraph_la-version.lo libigraph_la-optimal_modularity.lo \
+	libigraph_la-igraph_fixed_vectorlist.lo \
+	libigraph_la-separators.lo libigraph_la-igraph_marked_queue.lo \
+	libigraph_la-igraph_estack.lo libigraph_la-st-cuts.lo \
+	libigraph_la-cohesive_blocks.lo libigraph_la-statusbar.lo \
+	libigraph_la-lapack.lo libigraph_la-complex.lo \
+	libigraph_la-eigen.lo libigraph_la-feedback_arc_set.lo \
+	libigraph_la-sugiyama.lo libigraph_la-glpk_support.lo \
+	libigraph_la-igraph_hrg_types.lo libigraph_la-igraph_hrg.lo \
+	libigraph_la-distances.lo libigraph_la-fortran_intrinsics.lo \
+	libigraph_la-matching.lo libigraph_la-scg.lo \
+	libigraph_la-scg_approximate_methods.lo \
+	libigraph_la-scg_exact_scg.lo libigraph_la-scg_kmeans.lo \
+	libigraph_la-scg_utils.lo libigraph_la-scg_optimal_method.lo \
+	libigraph_la-qsort.lo libigraph_la-qsort_r.lo \
+	libigraph_la-types.lo libigraph_la-hacks.lo
+am__objects_7 =
+am_libigraph_la_OBJECTS = $(am__objects_6) $(am__objects_7)
+libigraph_la_OBJECTS = $(am_libigraph_la_OBJECTS)
+libigraph_la_LINK = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CXXLD) $(libigraph_la_CXXFLAGS) \
+	$(CXXFLAGS) $(libigraph_la_LDFLAGS) $(LDFLAGS) -o $@
+liblapack_la_LIBADD =
+am__liblapack_la_SOURCES_DIST = f2c.h lapack/dgeev.c lapack/dgebak.c \
+	lapack/xerbla.c lapack/dgebal.c lapack/disnan.c \
+	lapack/dlaisnan.c lapack/dgehrd.c lapack/dgehd2.c \
+	lapack/dlarf.c lapack/iladlc.c lapack/iladlr.c lapack/dlarfg.c \
+	lapack/dlapy2.c lapack/dlahr2.c lapack/dlacpy.c \
+	lapack/dlarfb.c lapack/ilaenv.c lapack/ieeeck.c \
+	lapack/iparmq.c lapack/dhseqr.c lapack/dlahqr.c \
+	lapack/dlabad.c lapack/dlanv2.c lapack/dlaqr0.c \
+	lapack/dlaqr3.c lapack/dlaqr4.c lapack/dlaqr2.c \
+	lapack/dlaset.c lapack/dormhr.c lapack/dormqr.c \
+	lapack/dlarft.c lapack/dorm2r.c lapack/dtrexc.c \
+	lapack/dlaexc.c lapack/dlange.c lapack/dlassq.c \
+	lapack/dlarfx.c lapack/dlartg.c lapack/dlasy2.c \
+	lapack/dlaqr5.c lapack/dlaqr1.c lapack/dlascl.c \
+	lapack/dorghr.c lapack/dorgqr.c lapack/dorg2r.c \
+	lapack/dtrevc.c lapack/dlaln2.c lapack/dladiv.c \
+	lapack/dsyevr.c lapack/dlansy.c lapack/dormtr.c \
+	lapack/dormql.c lapack/dorm2l.c lapack/dstebz.c \
+	lapack/dlaebz.c lapack/dstein.c lapack/dlagtf.c \
+	lapack/dlagts.c lapack/dlarnv.c lapack/dlaruv.c \
+	lapack/dstemr.c lapack/dlae2.c lapack/dlaev2.c lapack/dlanst.c \
+	lapack/dlarrc.c lapack/dlarre.c lapack/dlarra.c \
+	lapack/dlarrb.c lapack/dlaneg.c lapack/dlarrd.c \
+	lapack/dlarrk.c lapack/dlasq2.c lapack/dlasq3.c \
+	lapack/dlasq4.c lapack/dlasq5.c lapack/dlasq6.c \
+	lapack/dlasrt.c lapack/dlarrj.c lapack/dlarrr.c \
+	lapack/dlarrv.c lapack/dlar1v.c lapack/dlarrf.c \
+	lapack/dsterf.c lapack/dsytrd.c lapack/dlatrd.c \
+	lapack/dsytd2.c lapack/dlanhs.c lapack/dgeqr2.c \
+	lapack/dtrsen.c lapack/dlacn2.c lapack/dtrsyl.c lapack/dlasr.c \
+	lapack/dsteqr.c lapack/dgeevx.c lapack/dtrsna.c \
+	lapack/dlaqtr.c lapack/dgetrf.c lapack/dgetf2.c \
+	lapack/dlaswp.c lapack/dgetrs.c lapack/dgesv.c \
+	lapack/len_trim.c
+am__objects_8 = liblapack_la-dgeev.lo liblapack_la-dgebak.lo \
+	liblapack_la-xerbla.lo liblapack_la-dgebal.lo \
+	liblapack_la-disnan.lo liblapack_la-dlaisnan.lo \
+	liblapack_la-dgehrd.lo liblapack_la-dgehd2.lo \
+	liblapack_la-dlarf.lo liblapack_la-iladlc.lo \
+	liblapack_la-iladlr.lo liblapack_la-dlarfg.lo \
+	liblapack_la-dlapy2.lo liblapack_la-dlahr2.lo \
+	liblapack_la-dlacpy.lo liblapack_la-dlarfb.lo \
+	liblapack_la-ilaenv.lo liblapack_la-ieeeck.lo \
+	liblapack_la-iparmq.lo liblapack_la-dhseqr.lo \
+	liblapack_la-dlahqr.lo liblapack_la-dlabad.lo \
+	liblapack_la-dlanv2.lo liblapack_la-dlaqr0.lo \
+	liblapack_la-dlaqr3.lo liblapack_la-dlaqr4.lo \
+	liblapack_la-dlaqr2.lo liblapack_la-dlaset.lo \
+	liblapack_la-dormhr.lo liblapack_la-dormqr.lo \
+	liblapack_la-dlarft.lo liblapack_la-dorm2r.lo \
+	liblapack_la-dtrexc.lo liblapack_la-dlaexc.lo \
+	liblapack_la-dlange.lo liblapack_la-dlassq.lo \
+	liblapack_la-dlarfx.lo liblapack_la-dlartg.lo \
+	liblapack_la-dlasy2.lo liblapack_la-dlaqr5.lo \
+	liblapack_la-dlaqr1.lo liblapack_la-dlascl.lo \
+	liblapack_la-dorghr.lo liblapack_la-dorgqr.lo \
+	liblapack_la-dorg2r.lo liblapack_la-dtrevc.lo \
+	liblapack_la-dlaln2.lo liblapack_la-dladiv.lo \
+	liblapack_la-dsyevr.lo liblapack_la-dlansy.lo \
+	liblapack_la-dormtr.lo liblapack_la-dormql.lo \
+	liblapack_la-dorm2l.lo liblapack_la-dstebz.lo \
+	liblapack_la-dlaebz.lo liblapack_la-dstein.lo \
+	liblapack_la-dlagtf.lo liblapack_la-dlagts.lo \
+	liblapack_la-dlarnv.lo liblapack_la-dlaruv.lo \
+	liblapack_la-dstemr.lo liblapack_la-dlae2.lo \
+	liblapack_la-dlaev2.lo liblapack_la-dlanst.lo \
+	liblapack_la-dlarrc.lo liblapack_la-dlarre.lo \
+	liblapack_la-dlarra.lo liblapack_la-dlarrb.lo \
+	liblapack_la-dlaneg.lo liblapack_la-dlarrd.lo \
+	liblapack_la-dlarrk.lo liblapack_la-dlasq2.lo \
+	liblapack_la-dlasq3.lo liblapack_la-dlasq4.lo \
+	liblapack_la-dlasq5.lo liblapack_la-dlasq6.lo \
+	liblapack_la-dlasrt.lo liblapack_la-dlarrj.lo \
+	liblapack_la-dlarrr.lo liblapack_la-dlarrv.lo \
+	liblapack_la-dlar1v.lo liblapack_la-dlarrf.lo \
+	liblapack_la-dsterf.lo liblapack_la-dsytrd.lo \
+	liblapack_la-dlatrd.lo liblapack_la-dsytd2.lo \
+	liblapack_la-dlanhs.lo liblapack_la-dgeqr2.lo \
+	liblapack_la-dtrsen.lo liblapack_la-dlacn2.lo \
+	liblapack_la-dtrsyl.lo liblapack_la-dlasr.lo \
+	liblapack_la-dsteqr.lo liblapack_la-dgeevx.lo \
+	liblapack_la-dtrsna.lo liblapack_la-dlaqtr.lo \
+	liblapack_la-dgetrf.lo liblapack_la-dgetf2.lo \
+	liblapack_la-dlaswp.lo liblapack_la-dgetrs.lo \
+	liblapack_la-dgesv.lo liblapack_la-len_trim.lo
+@INTERNAL_LAPACK_TRUE@am_liblapack_la_OBJECTS = $(am__objects_8)
+liblapack_la_OBJECTS = $(am_liblapack_la_OBJECTS)
+liblapack_la_LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) \
+	$(LIBTOOLFLAGS) --mode=link $(CCLD) $(liblapack_la_CFLAGS) \
+	$(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+@INTERNAL_LAPACK_TRUE@am_liblapack_la_rpath =
+libplfit_la_LIBADD =
+am__objects_9 = error.lo gss.lo kolmogorov.lo lbfgs.lo options.lo \
+	plfit.lo zeta.lo
+am_libplfit_la_OBJECTS = $(am__objects_9)
+libplfit_la_OBJECTS = $(am_libplfit_la_OBJECTS)
+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)
+LTCOMPILE = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
+	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
+CCLD = $(CC)
+LINK = $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) \
+	$(LDFLAGS) -o $@
+CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
+	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
+LTCXXCOMPILE = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
+	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
+CXXLD = $(CXX)
+CXXLINK = $(LIBTOOL) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=link $(CXXLD) $(AM_CXXFLAGS) $(CXXFLAGS) $(AM_LDFLAGS) \
+	$(LDFLAGS) -o $@
+LEXCOMPILE = $(LEX) $(AM_LFLAGS) $(LFLAGS)
+LTLEXCOMPILE = $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=compile $(LEX) $(AM_LFLAGS) $(LFLAGS)
+YLWRAP = $(top_srcdir)/ylwrap
+YACCCOMPILE = $(YACC) $(AM_YFLAGS) $(YFLAGS)
+LTYACCCOMPILE = $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) \
+	--mode=compile $(YACC) $(AM_YFLAGS) $(YFLAGS)
+DIST_SOURCES = $(am__libarpack_la_SOURCES_DIST) \
+	$(am__libblas_la_SOURCES_DIST) \
+	$(am__libdlamch_la_SOURCES_DIST) $(am__libf2c_la_SOURCES_DIST) \
+	$(am__libglpk_la_SOURCES_DIST) $(libigraph_la_SOURCES) \
+	$(am__liblapack_la_SOURCES_DIST) $(libplfit_la_SOURCES)
+HEADERS = $(include_HEADERS)
+ETAGS = etags
+CTAGS = ctags
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+htmldir = @htmldir@
+includedir = $(prefix)/include/igraph
+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@
+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@
+
+# This is to make sure that the headers get built before they are included
+BUILT_SOURCES = foreign-ncol-parser.h foreign-lgl-parser.h \
+	foreign-dl-parser.h foreign-gml-parser.h \
+	foreign-pajek-parser.h $(am__append_1)
+
+# This is needed to ensure that yacc (or bison) builds the header files
+# Unfortunately this is not the default behaviour in MinGW/MSYS
+AM_YFLAGS = -d
+lib_LTLIBRARIES = libigraph.la
+BLAS = lapack/dscal.c lapack/dswap.c lapack/lsame.c lapack/idamax.c lapack/daxpy.c lapack/dgemv.c lapack/dger.c lapack/dnrm2.c lapack/dgemm.c lapack/dcopy.c lapack/dtrmm.c lapack/dtrmv.c lapack/drot.c lapack/ddot.c lapack/dasum.c lapack/dsymv.c lapack/dsyr2k.c lapack/dsyr2.c lapack/dtrsm.c 
+LAPACK = lapack/dgeev.c lapack/dgebak.c lapack/xerbla.c \
+	lapack/dgebal.c lapack/disnan.c lapack/dlaisnan.c \
+	lapack/dgehrd.c lapack/dgehd2.c lapack/dlarf.c lapack/iladlc.c \
+	lapack/iladlr.c lapack/dlarfg.c lapack/dlapy2.c \
+	lapack/dlahr2.c lapack/dlacpy.c lapack/dlarfb.c \
+	lapack/ilaenv.c lapack/ieeeck.c lapack/iparmq.c \
+	lapack/dhseqr.c lapack/dlahqr.c lapack/dlabad.c \
+	lapack/dlanv2.c lapack/dlaqr0.c lapack/dlaqr3.c \
+	lapack/dlaqr4.c lapack/dlaqr2.c lapack/dlaset.c \
+	lapack/dormhr.c lapack/dormqr.c lapack/dlarft.c \
+	lapack/dorm2r.c lapack/dtrexc.c lapack/dlaexc.c \
+	lapack/dlange.c lapack/dlassq.c lapack/dlarfx.c \
+	lapack/dlartg.c lapack/dlasy2.c lapack/dlaqr5.c \
+	lapack/dlaqr1.c lapack/dlascl.c lapack/dorghr.c \
+	lapack/dorgqr.c lapack/dorg2r.c lapack/dtrevc.c \
+	lapack/dlaln2.c lapack/dladiv.c lapack/dsyevr.c \
+	lapack/dlansy.c lapack/dormtr.c lapack/dormql.c \
+	lapack/dorm2l.c lapack/dstebz.c lapack/dlaebz.c \
+	lapack/dstein.c lapack/dlagtf.c lapack/dlagts.c \
+	lapack/dlarnv.c lapack/dlaruv.c lapack/dstemr.c lapack/dlae2.c \
+	lapack/dlaev2.c lapack/dlanst.c lapack/dlarrc.c \
+	lapack/dlarre.c lapack/dlarra.c lapack/dlarrb.c \
+	lapack/dlaneg.c lapack/dlarrd.c lapack/dlarrk.c \
+	lapack/dlasq2.c lapack/dlasq3.c lapack/dlasq4.c \
+	lapack/dlasq5.c lapack/dlasq6.c lapack/dlasrt.c \
+	lapack/dlarrj.c lapack/dlarrr.c lapack/dlarrv.c \
+	lapack/dlar1v.c lapack/dlarrf.c lapack/dsterf.c \
+	lapack/dsytrd.c lapack/dlatrd.c lapack/dsytd2.c \
+	lapack/dlanhs.c lapack/dgeqr2.c lapack/dtrsen.c \
+	lapack/dlacn2.c lapack/dtrsyl.c lapack/dlasr.c lapack/dsteqr.c \
+	lapack/dgeevx.c lapack/dtrsna.c lapack/dlaqtr.c \
+	lapack/dgetrf.c lapack/dgetf2.c lapack/dlaswp.c \
+	lapack/dgetrs.c lapack/dgesv.c lapack/len_trim.c
+ARPACK = lapack/dnaupd.c lapack/dnaup2.c lapack/dgetv0.c lapack/dvout.c lapack/second.c lapack/dmout.c lapack/dnaitr.c lapack/ivout.c lapack/dnapps.c lapack/dnconv.c lapack/dneigh.c lapack/dlaqrb.c lapack/dngets.c lapack/dsortc.c lapack/dstatn.c lapack/dneupd.c lapack/dsaupd.c lapack/dsaup2.c lapack/dsaitr.c lapack/dsapps.c lapack/dsconv.c lapack/dseigt.c lapack/dstqrb.c lapack/dsgets.c lapack/dsortr.c lapack/dstats.c lapack/dseupd.c lapack/dsesrt.c 
+PLFIT = plfit/error.c     plfit/gss.c       plfit/kolmogorov.c \
+        plfit/lbfgs.c     plfit/options.c   plfit/plfit.c      \
+		plfit/zeta.c      \
+		plfit/arithmetic_ansi.h plfit/arithmetic_sse_double.h plfit/arithmetic_sse_float.h \
+		plfit/error.h     plfit/gss.h       plfit/kolmogorov.h \
+		plfit/lbfgs.h     plfit/platform.h  plfit/plfit.h      \
+		plfit/zeta.h
+
+F2C = f2c/abort_.c	  f2c/dolio.c	    f2c/r_sin.c\
+	f2c/dummy.c	  f2c/dtime_.c	    f2c/iio.c	      f2c/r_sinh.c\
+	f2c/backspac.c	  f2c/due.c	    f2c/ilnw.c	      f2c/r_sqrt.c\
+	f2c/c_abs.c	  f2c/ef1asc_.c	    f2c/inquire.c     f2c/r_tan.c\
+	f2c/c_cos.c	  f2c/ef1cmc_.c	    f2c/l_ge.c	      f2c/r_tanh.c\
+	f2c/c_div.c	  f2c/endfile.c	    f2c/l_gt.c	      f2c/rdfmt.c\
+	f2c/c_exp.c	  f2c/erf_.c	    f2c/l_le.c	      f2c/rewind.c\
+	f2c/c_log.c	  f2c/erfc_.c	    f2c/l_lt.c	      f2c/rsfe.c\
+	f2c/c_sin.c	  f2c/err.c	    f2c/lbitbits.c    f2c/rsli.c\
+	f2c/c_sqrt.c	  f2c/etime_.c	    f2c/lbitshft.c    f2c/rsne.c\
+	f2c/cabs.c	  f2c/exit_.c	    f2c/lread.c	      f2c/s_cat.c\
+	f2c/close.c	  f2c/f77_aloc.c    f2c/lwrite.c      f2c/s_cmp.c\
+	f2c/ctype.c	  f2c/f77vers.c	    f2c/s_copy.c\
+	f2c/d_abs.c	  f2c/fmt.c	    f2c/open.c	      f2c/s_paus.c\
+	f2c/d_acos.c	  f2c/fmtlib.c	    f2c/pow_ci.c      f2c/s_rnge.c\
+	f2c/d_asin.c	  f2c/ftell_.c	    f2c/pow_dd.c      f2c/s_stop.c\
+	f2c/d_atan.c	  f2c/pow_di.c      f2c/sfe.c\
+	f2c/d_atn2.c	  f2c/getenv_.c	    f2c/pow_hh.c      f2c/sig_die.c\
+	f2c/d_cnjg.c	  f2c/h_abs.c	    f2c/pow_ii.c      f2c/signal_.c\
+	f2c/d_cos.c	  f2c/h_dim.c	    f2c/pow_ri.c      f2c/signbit.c\
+	f2c/d_cosh.c	  f2c/h_dnnt.c	    f2c/pow_zi.c      f2c/sue.c\
+	f2c/d_dim.c	  f2c/h_indx.c	    f2c/pow_zz.c      f2c/system_.c\
+	f2c/d_exp.c	  f2c/h_len.c	    f2c/r_abs.c	      f2c/typesize.c\
+	f2c/d_imag.c	  f2c/h_mod.c	    f2c/r_acos.c      f2c/uio.c\
+	f2c/d_int.c	  f2c/h_nint.c	    f2c/r_asin.c      f2c/uninit.c\
+	f2c/d_lg10.c	  f2c/h_sign.c	    f2c/r_atan.c      f2c/util.c\
+	f2c/d_log.c	  f2c/hl_ge.c	    f2c/r_atn2.c      f2c/wref.c\
+	f2c/d_mod.c	  f2c/hl_gt.c	    f2c/r_cnjg.c      f2c/wrtfmt.c\
+	f2c/d_nint.c	  f2c/hl_le.c	    f2c/r_cos.c	      f2c/wsfe.c\
+	f2c/d_prod.c	  f2c/hl_lt.c	    f2c/r_cosh.c      f2c/wsle.c\
+	f2c/d_sign.c	  f2c/i77vers.c	    f2c/r_dim.c	      f2c/wsne.c\
+	f2c/d_sin.c	  f2c/i_abs.c	    f2c/r_exp.c	      f2c/xwsne.c\
+	f2c/d_sinh.c	  f2c/i_dim.c	    f2c/r_imag.c      f2c/z_abs.c\
+	f2c/d_sqrt.c	  f2c/i_dnnt.c	    f2c/r_int.c	      f2c/z_cos.c\
+	f2c/d_tan.c	  f2c/i_indx.c	    f2c/r_lg10.c      f2c/z_div.c\
+	f2c/d_tanh.c	  f2c/i_len.c	    f2c/r_log.c	      f2c/z_exp.c\
+	f2c/derf_.c	  f2c/i_mod.c	    f2c/r_mod.c	      f2c/z_log.c\
+	f2c/derfc_.c	  f2c/i_nint.c	    f2c/r_nint.c      f2c/z_sin.c\
+	f2c/dfe.c	  f2c/i_sign.c	    f2c/r_sign.c      f2c/z_sqrt.c
+
+
+# We also have to pack f2c/arithchk.c in the distribution in case the
+# user wants to compile it using the internal f2c. f2c/arithchk.c is
+# not linked into libf2c.la (hence we cannot add it to libf2c_la_SOURCES)
+# but is needed to build f2c/arith.h
+EXTRA_DIST = f2c/arithchk.c
+@INTERNAL_F2C_TRUE@libf2c_la_SOURCES = f2c.h f2c/fio.h f2c/fmt.h f2c/sysdep1.h\
+@INTERNAL_F2C_TRUE@					  f2c/sysdep1.h0 f2c/lio.h f2c/fp.h f2c/signal1.h\
+@INTERNAL_F2C_TRUE@					  f2c/signal1.h0 $(F2C)
+
+@INTERNAL_F2C_TRUE@libf2c_la_CFLAGS = -DSkip_f2c_Undefs -I. -I$(top_srcdir)/include -I$(top_builddir)/include $(WARNING_CFLAGS)
+@INTERNAL_F2C_TRUE@F2C_LIB = libf2c.la
+@INTERNAL_BLAS_TRUE@libblas_la_SOURCES = f2c.h $(BLAS)
+@INTERNAL_BLAS_TRUE@libblas_la_CFLAGS = -I. -I$(top_srcdir)/include -I$(top_builddir)/include $(WARNING_CFLAGS)
+@INTERNAL_BLAS_TRUE@BLAS_LIB = libblas.la
+@INTERNAL_LAPACK_TRUE@liblapack_la_SOURCES = f2c.h $(LAPACK)
+@INTERNAL_LAPACK_TRUE@liblapack_la_CFLAGS = -I. -I$(top_srcdir)/include -I$(top_builddir)/include $(WARNING_CFLAGS)
+@INTERNAL_LAPACK_TRUE@libdlamch_la_SOURCES = lapack/dlamch.c
+@INTERNAL_LAPACK_TRUE@libdlamch_la_CFLAGS = $(FLOATSTORE) -I. -I$(top_srcdir)/include -I$(top_builddir)/include $(WARNING_CFLAGS)
+@INTERNAL_LAPACK_TRUE@LAPACK_LIB = liblapack.la libdlamch.la
+@INTERNAL_ARPACK_TRUE@libarpack_la_SOURCES = f2c.h $(ARPACK)
+@INTERNAL_ARPACK_TRUE@libarpack_la_CFLAGS = -I. -I$(top_srcdir)/include -I$(top_builddir)/include $(WARNING_CFLAGS)
+@INTERNAL_ARPACK_TRUE@ARPACK_LIB = libarpack.la
+GLPK = ../optional/glpk/glpapi.h ../optional/glpk/glpapi01.c \
+	../optional/glpk/glpapi02.c ../optional/glpk/glpapi03.c \
+	../optional/glpk/glpapi04.c ../optional/glpk/glpapi05.c \
+	../optional/glpk/glpapi06.c ../optional/glpk/glpapi07.c \
+	../optional/glpk/glpapi08.c ../optional/glpk/glpapi09.c \
+	../optional/glpk/glpapi10.c ../optional/glpk/glpapi11.c \
+	../optional/glpk/glpapi12.c ../optional/glpk/glpapi13.c \
+	../optional/glpk/glpapi14.c ../optional/glpk/glpapi15.c \
+	../optional/glpk/glpapi16.c ../optional/glpk/glpapi17.c \
+	../optional/glpk/glpapi18.c ../optional/glpk/glpapi19.c \
+	../optional/glpk/glpavl.c ../optional/glpk/glpavl.h \
+	../optional/glpk/glpbfd.c ../optional/glpk/glpbfd.h \
+	../optional/glpk/glpbfx.c ../optional/glpk/glpbfx.h \
+	../optional/glpk/glpcpx.c ../optional/glpk/glpdmp.c \
+	../optional/glpk/glpdmp.h ../optional/glpk/glpdmx.c \
+	../optional/glpk/glpenv.h ../optional/glpk/glpenv01.c \
+	../optional/glpk/glpenv02.c ../optional/glpk/glpenv03.c \
+	../optional/glpk/glpenv04.c ../optional/glpk/glpenv05.c \
+	../optional/glpk/glpenv06.c ../optional/glpk/glpenv07.c \
+	../optional/glpk/glpenv08.c ../optional/glpk/glpfhv.c \
+	../optional/glpk/glpfhv.h ../optional/glpk/glpgmp.c \
+	../optional/glpk/glpgmp.h ../optional/glpk/glphbm.c \
+	../optional/glpk/glphbm.h ../optional/glpk/glpini01.c \
+	../optional/glpk/glpini02.c ../optional/glpk/glpios.h \
+	../optional/glpk/glpios01.c ../optional/glpk/glpios02.c \
+	../optional/glpk/glpios03.c ../optional/glpk/glpios04.c \
+	../optional/glpk/glpios05.c ../optional/glpk/glpios06.c \
+	../optional/glpk/glpios07.c ../optional/glpk/glpios08.c \
+	../optional/glpk/glpios09.c ../optional/glpk/glpios10.c \
+	../optional/glpk/glpios11.c ../optional/glpk/glpios12.c \
+	../optional/glpk/glpipm.c ../optional/glpk/glpipm.h \
+	../optional/glpk/glpk.h ../optional/glpk/glplib.h \
+	../optional/glpk/glplib01.c ../optional/glpk/glplib02.c \
+	../optional/glpk/glplib03.c ../optional/glpk/glplpf.c \
+	../optional/glpk/glplpf.h ../optional/glpk/glplpx01.c \
+	../optional/glpk/glplpx02.c ../optional/glpk/glplpx03.c \
+	../optional/glpk/glpluf.c ../optional/glpk/glpluf.h \
+	../optional/glpk/glplux.c ../optional/glpk/glplux.h \
+	../optional/glpk/glpmat.c ../optional/glpk/glpmat.h \
+	../optional/glpk/glpmpl.h ../optional/glpk/glpmpl01.c \
+	../optional/glpk/glpmpl02.c ../optional/glpk/glpmpl03.c \
+	../optional/glpk/glpmpl04.c ../optional/glpk/glpmpl05.c \
+	../optional/glpk/glpmpl06.c ../optional/glpk/glpmps.c \
+	../optional/glpk/glpnet.h ../optional/glpk/glpnet01.c \
+	../optional/glpk/glpnet02.c ../optional/glpk/glpnet03.c \
+	../optional/glpk/glpnet04.c ../optional/glpk/glpnet05.c \
+	../optional/glpk/glpnet06.c ../optional/glpk/glpnet07.c \
+	../optional/glpk/glpnet08.c ../optional/glpk/glpnet09.c \
+	../optional/glpk/glpnpp.h ../optional/glpk/glpnpp01.c \
+	../optional/glpk/glpnpp02.c ../optional/glpk/glpnpp03.c \
+	../optional/glpk/glpnpp04.c ../optional/glpk/glpnpp05.c \
+	../optional/glpk/glpqmd.c ../optional/glpk/glpqmd.h \
+	../optional/glpk/glprgr.c ../optional/glpk/glprgr.h \
+	../optional/glpk/glprng.h ../optional/glpk/glprng01.c \
+	../optional/glpk/glprng02.c ../optional/glpk/glpscf.c \
+	../optional/glpk/glpscf.h ../optional/glpk/glpscl.c \
+	../optional/glpk/glpsdf.c ../optional/glpk/glpspm.c \
+	../optional/glpk/glpspm.h ../optional/glpk/glpspx.h \
+	../optional/glpk/glpspx01.c ../optional/glpk/glpspx02.c \
+	../optional/glpk/glpsql.c ../optional/glpk/glpsql.h \
+	../optional/glpk/glpssx.h ../optional/glpk/glpssx01.c \
+	../optional/glpk/glpssx02.c ../optional/glpk/glpstd.h \
+	../optional/glpk/glptsp.c ../optional/glpk/glptsp.h \
+	../optional/glpk/amd/amd.h ../optional/glpk/amd/amd_1.c \
+	../optional/glpk/amd/amd_2.c ../optional/glpk/amd/amd_aat.c \
+	../optional/glpk/amd/amd_control.c \
+	../optional/glpk/amd/amd_defaults.c \
+	../optional/glpk/amd/amd_dump.c \
+	../optional/glpk/amd/amd_info.c \
+	../optional/glpk/amd/amd_internal.h \
+	../optional/glpk/amd/amd_order.c \
+	../optional/glpk/amd/amd_post_tree.c \
+	../optional/glpk/amd/amd_postorder.c \
+	../optional/glpk/amd/amd_preprocess.c \
+	../optional/glpk/amd/amd_valid.c \
+	../optional/glpk/colamd/colamd.c \
+	../optional/glpk/colamd/colamd.h
+@INTERNAL_GLPK_TRUE@libglpk_la_SOURCES = $(GLPK)
+@INTERNAL_GLPK_TRUE@libglpk_la_CFLAGS = -I$(top_srcdir)/optional/glpk
+@INTERNAL_GLPK_TRUE@libglpk_la_CPPFLAGS = -I$(top_srcdir)/include
+@INTERNAL_GLPK_TRUE@GLPK_LIB = libglpk.la
+libplfit_la_SOURCES = $(PLFIT)
+PLFIT_LIB = libplfit.la
+noinst_LTLIBRARIES = $(F2C_LIB) $(BLAS_LIB) $(LAPACK_LIB) $(ARPACK_LIB) \
+					 $(GLPK_LIB) $(PLFIT_LIB)
+
+CS = cs/cs_add.c       cs/cs_happly.c    cs/cs_pvec.c         \
+	cs/cs_amd.c       cs/cs_house.c     cs/cs_qr.c        \
+	cs/cs_chol.c      cs/cs_ipvec.c     cs/cs_qrsol.c     \
+	cs/cs_cholsol.c   cs/cs_leaf.c      cs/cs_randperm.c  \
+	cs/cs_compress.c  cs/cs_load.c      cs/cs_reach.c     \
+	cs/cs_counts.c    cs/cs_lsolve.c    cs/cs_scatter.c   \
+	cs/cs_cumsum.c    cs/cs_ltsolve.c   cs/cs_scc.c       \
+	cs/cs_dfs.c       cs/cs_lu.c        cs/cs_schol.c     \
+	cs/cs_dmperm.c    cs/cs_lusol.c     cs/cs_spsolve.c   \
+	cs/cs_droptol.c   cs/cs_malloc.c    cs/cs_sqr.c       \
+	cs/cs_dropzeros.c cs/cs_maxtrans.c  cs/cs_symperm.c   \
+	cs/cs_dupl.c      cs/cs_multiply.c  cs/cs_tdfs.c      \
+	cs/cs_entry.c     cs/cs_norm.c      cs/cs_transpose.c \
+	cs/cs_ereach.c    cs/cs_permute.c   cs/cs_updown.c    \
+	cs/cs_etree.c     cs/cs_pinv.c      cs/cs_usolve.c    \
+	cs/cs_fkeep.c     cs/cs_post.c      cs/cs_util.c      \
+	cs/cs_gaxpy.c     cs/cs_print.c     cs/cs_utsolve.c   \
+	cs/cs.h	    cs/UFconfig.h
+
+HEADERS_PRIVATE = atlas-edges.h \
+		bliss_bignum.hh		bliss_defs.hh \
+		bliss_eqrefhash.hh	bliss_graph.hh \
+		bliss_heap.hh		bliss_kqueue.hh \
+		bliss_kstack.hh		bliss_orbit.hh \
+		bliss_partition.hh	bliss_timer.hh \
+		bliss_utils.hh \
+		NetDataTypes.h		NetRoutines.h \
+		pottsmodel_2.h \
+		igraph_gml_tree.h \
+		walktrap_graph.h	walktrap_communities.h \
+		walktrap_heap.h \
+		infomap_Greedy.h infomap_Node.h infomap_Greedy.h infomap_FlowGraph.h \
+		igraph_math.h \
+		drl_layout.h drl_parse.h drl_graph.h \
+		drl_graph_3d.h		drl_layout_3d.h \
+		drl_Node.h	drl_Node_3d.h \
+		DensityGrid.h	DensityGrid_3d.h \
+		igraph_flow_internal.h \
+		vector.pmt matrix.pmt stack.pmt dqueue.pmt heap.pmt array.pmt \
+		igraph_types_internal.h \
+		foreign-dl-header.h bignum.h bigint.h \
+		gengraph_box_list.h gengraph_definitions.h \
+		gengraph_degree_sequence.h gengraph_graph_molloy_hash.h \
+		gengraph_graph_molloy_optimized.h \
+		gengraph_hash.h gengraph_header.h gengraph_powerlaw.h \
+		gengraph_qsort.h gengraph_random.h gengraph_vertex_cover.h \
+		igraph_blas_internal.h igraph_arpack_internal.h \
+		igraph_lapack_internal.h igraph_glpk_support.h \
+		igraph_marked_queue.h igraph_estack.h \
+		hrg_dendro.h hrg_graph.h hrg_rbtree.h hrg_splittree_eq.h \
+		hrg_graph_simp.h foreign-gml-header.h \
+		foreign-ncol-header.h foreign-lgl-header.h \
+		foreign-pajek-header.h igraph_interrupt_internal.h \
+		scg_headers.h igraph_hacks_internal.h
+
+HEADERS_PUBLIC = ../include/igraph.h 		../include/igraph_memory.h    \
+		../include/igraph_random.h 	../include/igraph_types.h     \
+		../include/igraph_vector.h 	../include/igraph_matrix.h    \
+		../include/igraph_array.h 	../include/igraph_dqueue.h    \
+		../include/igraph_stack.h 	../include/igraph_heap.h      \
+		../include/igraph_arpack.h 	\
+		../include/igraph_attributes.h 	../include/igraph_error.h     \
+		../include/igraph_pmt.h 	../include/igraph_pmt_off.h   \
+		../include/igraph_adjlist.h	../include/igraph_iterators.h \
+		../include/igraph_bipartite.h	../include/igraph_layout.h    \
+		../include/igraph_centrality.h	../include/igraph_motifs.h    \
+		../include/igraph_cliques.h	../include/igraph_neighborhood.h \
+		../include/igraph_cocitation.h	../include/igraph_nongraph.h  \
+		../include/igraph_community.h	../include/igraph_operators.h \
+		../include/igraph_components.h	../include/igraph_paths.h     \
+		../include/igraph_constructors.h ../include/igraph_progress.h \
+		../include/igraph_conversion.h	../include/igraph_revolver.h  \
+		../include/igraph_datatype.h	../include/igraph_structural.h\
+		../include/igraph_flow.h	../include/igraph_topology.h  \
+		../include/igraph_foreign.h	../include/igraph_transitivity.h \
+		../include/igraph_games.h	../include/igraph_visitor.h   \
+		../include/igraph_interface.h	../include/igraph_constants.h \
+		../include/igraph_vector_pmt.h	../include/igraph_matrix_pmt.h\
+		../include/igraph_array_pmt.h	../include/igraph_dqueue_pmt.h\
+		../include/igraph_stack_pmt.h	../include/igraph_heap_pmt.h  \
+		../include/igraph_vector_ptr.h	../include/igraph_spmatrix.h  \
+		../include/igraph_strvector.h	../include/igraph_psumtree.h  \
+		../include/igraph_sparsemat.h   ../include/igraph_mixing.h    \
+		../include/igraph_version.h     ../include/igraph_blas.h      \
+		../include/igraph_separators.h  ../include/igraph_cohesive_blocks.h \
+		../include/igraph_lapack.h	../include/igraph_complex.h   \
+		../include/igraph_eigen.h	../include/igraph_statusbar.h \
+		../include/igraph_hrg.h         ../include/igraph_microscopic_update.h \
+		../include/igraph_interrupt.h   ../include/igraph_threading.h \
+		../include/igraph_scg.h		../include/igraph_qsort.h \
+		../include/igraph_matching.h
+
+SOURCES = basic_query.c games.c cocitation.c iterators.c \
+			     structural_properties.c components.c layout.c \
+			     structure_generators.c conversion.c \
+			     type_indexededgelist.c spanning_trees.c \
+			     igraph_error.c interrupt.c other.c foreign.c random.c \
+			     attributes.c \
+			     foreign-ncol-parser.y foreign-ncol-lexer.l \
+			     foreign-lgl-parser.y foreign-lgl-lexer.l \
+			     foreign-pajek-parser.y foreign-pajek-lexer.l \
+			     foreign-gml-parser.y foreign-gml-lexer.l \
+			     dqueue.c heap.c igraph_heap.c igraph_stack.c \
+			     igraph_strvector.c igraph_trie.c matrix.c \
+			     vector.c vector_ptr.c memory.c adjlist.c \
+			     visitors.c igraph_grid.c atlas.c topology.c \
+			     motifs.c progress.c operators.c \
+			     igraph_psumtree.c array.c igraph_hashtable.c \
+			     foreign-graphml.c flow.c igraph_buckets.c \
+			     NetDataTypes.cpp NetRoutines.cpp clustertool.cpp \
+			     pottsmodel_2.cpp spectral_properties.c cores.c \
+			     igraph_set.c cliques.c revolver_cit.c revolver_grow.c\
+			     walktrap.cpp walktrap_heap.cpp \
+			     walktrap_graph.cpp walktrap_communities.cpp \
+			     infomap.cc infomap_Greedy.cc infomap_Node.cc infomap_FlowGraph.cc \
+			     spmatrix.c community.c fast_community.c \
+			     evolver_cit.c gml_tree.c \
+			     bliss_orbit.cc bliss_eqrefhash.cc \
+			     bliss_partition.cc bliss_graph.cc bliss_timer.cc \
+			     bliss_heap.cc bliss_utils.cc bliss.cc \
+			     cattributes.c revolver_ml_cit.c zeroin.c bfgs.c math.c \
+			     forestfire.c microscopic_update.c \
+			     blas.c arpack.c centrality.c drl_layout.cpp drl_parse.cpp \
+			     drl_graph.cpp DensityGrid.cpp \
+			     gengraph_box_list.cpp gengraph_degree_sequence.cpp \
+			     gengraph_graph_molloy_hash.cpp \
+			     gengraph_graph_molloy_optimized.cpp \
+			     gengraph_mr-connected.cpp gengraph_powerlaw.cpp \
+			     gengraph_random.cpp decomposition.c bipartite.c \
+			     drl_layout_3d.cpp drl_graph_3d.cpp \
+			     DensityGrid_3d.cpp \
+			     foreign-dl-parser.y foreign-dl-lexer.l \
+			     $(CS) sparsemat.c mixing.c bigint.c bignum.c \
+			     version.c optimal_modularity.c \
+			     igraph_fixed_vectorlist.c separators.c \
+			     igraph_marked_queue.c igraph_estack.c st-cuts.c \
+			     cohesive_blocks.c statusbar.c \
+			     lapack.c complex.c eigen.c feedback_arc_set.c \
+			     sugiyama.c glpk_support.c \
+				 igraph_hrg_types.cc igraph_hrg.cc \
+			     distances.c fortran_intrinsics.c matching.c \
+			     scg.c scg_approximate_methods.c scg_exact_scg.c \
+			     scg_kmeans.c scg_utils.c scg_optimal_method.c \
+			     qsort.c qsort_r.c types.c hacks.c
+
+libigraph_la_SOURCES = $(SOURCES) $(HEADERS_PRIVATE)
+libigraph_la_CFLAGS = -I$(top_srcdir)/include \
+	-I$(top_builddir)/include $(WARNING_CFLAGS) $(am__append_2)
+libigraph_la_CXXFLAGS = -I$(top_srcdir)/include \
+	-I$(top_builddir)/include $(WARNING_CFLAGS) $(am__append_3)
+libigraph_la_LDFLAGS = -no-undefined
+libigraph_la_LIBADD = -lm $(XML2_LIBS) $(F2C_LIB) $(BLAS_LIB) \
+				 $(LAPACK_LIB) $(ARPACK_LIB) $(GLPK_LIB) $(PLFIT_LIB)
+
+include_HEADERS = $(HEADERS_PUBLIC)
+MAINTAINERCLEANFILES = Makefile.in foreign-lgl-parser.h foreign-ncol-parser.h
+all: $(BUILT_SOURCES)
+	$(MAKE) $(AM_MAKEFLAGS) all-am
+
+.SUFFIXES:
+.SUFFIXES: .c .cc .cpp .l .lo .o .obj .y
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am $(srcdir)/lapack/blas.inc $(srcdir)/lapack/lapack.inc $(srcdir)/lapack/arpack.inc $(srcdir)/plfit/plfit.inc $(srcdir)/../optional/glpk/glpk.inc $(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) --gnu src/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu src/Makefile
+.PRECIOUS: 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)/lapack/blas.inc $(srcdir)/lapack/lapack.inc $(srcdir)/lapack/arpack.inc $(srcdir)/plfit/plfit.inc $(srcdir)/../optional/glpk/glpk.inc:
+
+$(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-libLTLIBRARIES: $(lib_LTLIBRARIES)
+	@$(NORMAL_INSTALL)
+	test -z "$(libdir)" || $(MKDIR_P) "$(DESTDIR)$(libdir)"
+	@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
+	list2=; for p in $$list; do \
+	  if test -f $$p; then \
+	    list2="$$list2 $$p"; \
+	  else :; fi; \
+	done; \
+	test -z "$$list2" || { \
+	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \
+	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \
+	}
+
+uninstall-libLTLIBRARIES:
+	@$(NORMAL_UNINSTALL)
+	@list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \
+	for p in $$list; do \
+	  $(am__strip_dir) \
+	  echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \
+	  $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \
+	done
+
+clean-libLTLIBRARIES:
+	-test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES)
+	@list='$(lib_LTLIBRARIES)'; for p in $$list; do \
+	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
+	  test "$$dir" != "$$p" || dir=.; \
+	  echo "rm -f \"$${dir}/so_locations\""; \
+	  rm -f "$${dir}/so_locations"; \
+	done
+
+clean-noinstLTLIBRARIES:
+	-test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES)
+	@list='$(noinst_LTLIBRARIES)'; for p in $$list; do \
+	  dir="`echo $$p | sed -e 's|/[^/]*$$||'`"; \
+	  test "$$dir" != "$$p" || dir=.; \
+	  echo "rm -f \"$${dir}/so_locations\""; \
+	  rm -f "$${dir}/so_locations"; \
+	done
+libarpack.la: $(libarpack_la_OBJECTS) $(libarpack_la_DEPENDENCIES) $(EXTRA_libarpack_la_DEPENDENCIES) 
+	$(libarpack_la_LINK) $(am_libarpack_la_rpath) $(libarpack_la_OBJECTS) $(libarpack_la_LIBADD) $(LIBS)
+libblas.la: $(libblas_la_OBJECTS) $(libblas_la_DEPENDENCIES) $(EXTRA_libblas_la_DEPENDENCIES) 
+	$(libblas_la_LINK) $(am_libblas_la_rpath) $(libblas_la_OBJECTS) $(libblas_la_LIBADD) $(LIBS)
+libdlamch.la: $(libdlamch_la_OBJECTS) $(libdlamch_la_DEPENDENCIES) $(EXTRA_libdlamch_la_DEPENDENCIES) 
+	$(libdlamch_la_LINK) $(am_libdlamch_la_rpath) $(libdlamch_la_OBJECTS) $(libdlamch_la_LIBADD) $(LIBS)
+libf2c.la: $(libf2c_la_OBJECTS) $(libf2c_la_DEPENDENCIES) $(EXTRA_libf2c_la_DEPENDENCIES) 
+	$(libf2c_la_LINK) $(am_libf2c_la_rpath) $(libf2c_la_OBJECTS) $(libf2c_la_LIBADD) $(LIBS)
+libglpk.la: $(libglpk_la_OBJECTS) $(libglpk_la_DEPENDENCIES) $(EXTRA_libglpk_la_DEPENDENCIES) 
+	$(libglpk_la_LINK) $(am_libglpk_la_rpath) $(libglpk_la_OBJECTS) $(libglpk_la_LIBADD) $(LIBS)
+foreign-ncol-parser.h: foreign-ncol-parser.c
+	@if test ! -f $@; then rm -f foreign-ncol-parser.c; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) foreign-ncol-parser.c; else :; fi
+foreign-lgl-parser.h: foreign-lgl-parser.c
+	@if test ! -f $@; then rm -f foreign-lgl-parser.c; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) foreign-lgl-parser.c; else :; fi
+foreign-pajek-parser.h: foreign-pajek-parser.c
+	@if test ! -f $@; then rm -f foreign-pajek-parser.c; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) foreign-pajek-parser.c; else :; fi
+foreign-gml-parser.h: foreign-gml-parser.c
+	@if test ! -f $@; then rm -f foreign-gml-parser.c; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) foreign-gml-parser.c; else :; fi
+foreign-dl-parser.h: foreign-dl-parser.c
+	@if test ! -f $@; then rm -f foreign-dl-parser.c; else :; fi
+	@if test ! -f $@; then $(MAKE) $(AM_MAKEFLAGS) foreign-dl-parser.c; else :; fi
+libigraph.la: $(libigraph_la_OBJECTS) $(libigraph_la_DEPENDENCIES) $(EXTRA_libigraph_la_DEPENDENCIES) 
+	$(libigraph_la_LINK) -rpath $(libdir) $(libigraph_la_OBJECTS) $(libigraph_la_LIBADD) $(LIBS)
+liblapack.la: $(liblapack_la_OBJECTS) $(liblapack_la_DEPENDENCIES) $(EXTRA_liblapack_la_DEPENDENCIES) 
+	$(liblapack_la_LINK) $(am_liblapack_la_rpath) $(liblapack_la_OBJECTS) $(liblapack_la_LIBADD) $(LIBS)
+libplfit.la: $(libplfit_la_OBJECTS) $(libplfit_la_DEPENDENCIES) $(EXTRA_libplfit_la_DEPENDENCIES) 
+	$(LINK)  $(libplfit_la_OBJECTS) $(libplfit_la_LIBADD) $(LIBS)
+
+mostlyclean-compile:
+	-rm -f *.$(OBJEXT)
+
+distclean-compile:
+	-rm -f *.tab.c
+
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/error.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/gss.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/kolmogorov.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lbfgs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dgetv0.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dlaqrb.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dmout.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dnaitr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dnapps.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dnaup2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dnaupd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dnconv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dneigh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dneupd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dngets.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsaitr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsapps.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsaup2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsaupd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsconv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dseigt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsesrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dseupd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsgets.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsortc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dsortr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dstatn.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dstats.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dstqrb.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-dvout.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-ivout.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libarpack_la-second.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dasum.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-daxpy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dcopy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-ddot.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dgemm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dgemv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dger.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dnrm2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-drot.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dscal.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dswap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dsymv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dsyr2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dsyr2k.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dtrmm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dtrmv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-dtrsm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-idamax.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libblas_la-lsame.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libdlamch_la-dlamch.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-abort_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-backspac.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_cos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_div.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_exp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_log.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_sin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-c_sqrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-cabs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-close.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-ctype.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_acos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_asin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_atan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_atn2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_cnjg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_cos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_cosh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_dim.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_exp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_imag.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_int.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_lg10.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_log.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_mod.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_nint.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_prod.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_sign.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_sin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_sinh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_sqrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_tan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-d_tanh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-derf_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-derfc_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-dfe.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-dolio.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-dtime_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-due.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-dummy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-ef1asc_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-ef1cmc_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-endfile.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-erf_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-erfc_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-err.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-etime_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-exit_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-f77_aloc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-f77vers.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-fmt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-fmtlib.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-ftell_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-getenv_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_dim.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_dnnt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_indx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_len.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_mod.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_nint.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-h_sign.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-hl_ge.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-hl_gt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-hl_le.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-hl_lt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i77vers.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_dim.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_dnnt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_indx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_len.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_mod.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_nint.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-i_sign.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-iio.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-ilnw.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-inquire.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-l_ge.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-l_gt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-l_le.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-l_lt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-lbitbits.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-lbitshft.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-lread.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-lwrite.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-open.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_ci.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_dd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_di.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_hh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_ii.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_ri.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_zi.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-pow_zz.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_acos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_asin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_atan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_atn2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_cnjg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_cos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_cosh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_dim.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_exp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_imag.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_int.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_lg10.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_log.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_mod.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_nint.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_sign.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_sin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_sinh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_sqrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_tan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-r_tanh.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-rdfmt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-rewind.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-rsfe.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-rsli.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-rsne.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_cat.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_cmp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_copy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_paus.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_rnge.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-s_stop.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-sfe.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-sig_die.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-signal_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-signbit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-sue.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-system_.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-typesize.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-uio.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-uninit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-util.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-wref.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-wrtfmt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-wsfe.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-wsle.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-wsne.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-xwsne.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_abs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_cos.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_div.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_exp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_log.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_sin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libf2c_la-z_sqrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_1.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_aat.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_control.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_defaults.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_dump.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_info.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_order.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_post_tree.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_postorder.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_preprocess.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-amd_valid.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-colamd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi06.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi07.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi08.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi09.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi10.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi11.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi12.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi13.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi14.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi15.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi16.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi17.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi18.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpapi19.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpavl.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpbfd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpbfx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpcpx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpdmp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpdmx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv06.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv07.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpenv08.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpfhv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpgmp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glphbm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpini01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpini02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios06.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios07.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios08.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios09.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios10.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios11.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpios12.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpipm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplib01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplib02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplib03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplpf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplpx01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplpx02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplpx03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpluf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glplux.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmat.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmpl06.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpmps.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet06.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet07.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet08.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnet09.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnpp01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnpp02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnpp03.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnpp04.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpnpp05.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpqmd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glprgr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glprng01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glprng02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpscf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpscl.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpsdf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpspm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpspx01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpspx02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpsql.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpssx01.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glpssx02.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libglpk_la-glptsp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-DensityGrid.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-DensityGrid_3d.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-NetDataTypes.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-NetRoutines.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-adjlist.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-arpack.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-array.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-atlas.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-attributes.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-basic_query.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bfgs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bigint.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bignum.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bipartite.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-blas.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_eqrefhash.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_graph.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_heap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_orbit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_partition.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_timer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-bliss_utils.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cattributes.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-centrality.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cliques.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-clustertool.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cocitation.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cohesive_blocks.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-community.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-complex.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-components.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-conversion.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cores.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_add.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_amd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_chol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_cholsol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_compress.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_counts.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_cumsum.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_dfs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_dmperm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_droptol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_dropzeros.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_dupl.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_entry.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_ereach.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_etree.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_fkeep.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_gaxpy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_happly.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_house.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_ipvec.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_leaf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_load.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_lsolve.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_ltsolve.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_lu.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_lusol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_malloc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_maxtrans.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_multiply.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_norm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_permute.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_pinv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_post.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_print.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_pvec.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_qr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_qrsol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_randperm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_reach.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_scatter.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_scc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_schol.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_spsolve.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_sqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_symperm.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_tdfs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_transpose.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_updown.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_usolve.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_util.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-cs_utsolve.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-decomposition.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-distances.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-dqueue.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-drl_graph.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-drl_graph_3d.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-drl_layout.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-drl_layout_3d.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-drl_parse.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-eigen.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-evolver_cit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-fast_community.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-feedback_arc_set.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-flow.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-dl-lexer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-dl-parser.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-gml-lexer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-gml-parser.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-graphml.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-lgl-lexer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-lgl-parser.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-ncol-lexer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-ncol-parser.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-pajek-lexer.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign-pajek-parser.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-foreign.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-forestfire.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-fortran_intrinsics.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-games.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_box_list.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_degree_sequence.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_graph_molloy_hash.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_graph_molloy_optimized.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_mr-connected.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_powerlaw.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gengraph_random.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-glpk_support.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-gml_tree.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-hacks.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-heap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_buckets.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_error.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_estack.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_fixed_vectorlist.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_grid.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_hashtable.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_heap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_hrg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_hrg_types.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_marked_queue.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_psumtree.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_set.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_stack.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_strvector.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-igraph_trie.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-infomap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-infomap_FlowGraph.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-infomap_Greedy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-infomap_Node.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-interrupt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-iterators.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-lapack.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-layout.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-matching.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-math.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-matrix.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-memory.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-microscopic_update.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-mixing.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-motifs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-operators.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-optimal_modularity.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-other.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-pottsmodel_2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-progress.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-qsort.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-qsort_r.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-random.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-revolver_cit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-revolver_grow.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-revolver_ml_cit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg_approximate_methods.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg_exact_scg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg_kmeans.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg_optimal_method.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-scg_utils.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-separators.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-spanning_trees.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-sparsemat.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-spectral_properties.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-spmatrix.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-st-cuts.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-statusbar.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-structural_properties.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-structure_generators.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-sugiyama.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-topology.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-type_indexededgelist.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-types.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-vector.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-vector_ptr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-version.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-visitors.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-walktrap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-walktrap_communities.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-walktrap_graph.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-walktrap_heap.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libigraph_la-zeroin.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgebak.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgebal.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgeev.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgeevx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgehd2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgehrd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgeqr2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgesv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgetf2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgetrf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dgetrs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dhseqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-disnan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlabad.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlacn2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlacpy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dladiv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlae2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaebz.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaev2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaexc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlagtf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlagts.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlahqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlahr2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaisnan.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaln2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaneg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlange.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlanhs.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlanst.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlansy.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlanv2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlapy2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr0.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr1.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr3.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr4.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqr5.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaqtr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlar1v.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarfb.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarfg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarft.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarfx.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarnv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarra.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrb.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarre.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrj.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrk.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlarrv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlartg.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaruv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlascl.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaset.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasq2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasq3.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasq4.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasq5.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasq6.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasrt.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlassq.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlaswp.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlasy2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dlatrd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dorg2r.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dorghr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dorgqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dorm2l.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dorm2r.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dormhr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dormql.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dormqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dormtr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dstebz.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dstein.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dstemr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dsteqr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dsterf.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dsyevr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dsytd2.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dsytrd.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dtrevc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dtrexc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dtrsen.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dtrsna.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-dtrsyl.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-ieeeck.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-iladlc.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-iladlr.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-ilaenv.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-iparmq.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-len_trim.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/liblapack_la-xerbla.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/options.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/plfit.Plo@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/zeta.Plo@am__quote@
+
+.c.o:
+@am__fastdepCC_TRUE@	$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(COMPILE) -c $<
+
+.c.obj:
+@am__fastdepCC_TRUE@	$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(COMPILE) -c `$(CYGPATH_W) '$<'`
+
+.c.lo:
+@am__fastdepCC_TRUE@	$(LTCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LTCOMPILE) -c -o $@ $<
+
+libarpack_la-dnaupd.lo: lapack/dnaupd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dnaupd.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dnaupd.Tpo -c -o libarpack_la-dnaupd.lo `test -f 'lapack/dnaupd.c' || echo '$(srcdir)/'`lapack/dnaupd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dnaupd.Tpo $(DEPDIR)/libarpack_la-dnaupd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnaupd.c' object='libarpack_la-dnaupd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dnaupd.lo `test -f 'lapack/dnaupd.c' || echo '$(srcdir)/'`lapack/dnaupd.c
+
+libarpack_la-dnaup2.lo: lapack/dnaup2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dnaup2.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dnaup2.Tpo -c -o libarpack_la-dnaup2.lo `test -f 'lapack/dnaup2.c' || echo '$(srcdir)/'`lapack/dnaup2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dnaup2.Tpo $(DEPDIR)/libarpack_la-dnaup2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnaup2.c' object='libarpack_la-dnaup2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dnaup2.lo `test -f 'lapack/dnaup2.c' || echo '$(srcdir)/'`lapack/dnaup2.c
+
+libarpack_la-dgetv0.lo: lapack/dgetv0.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dgetv0.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dgetv0.Tpo -c -o libarpack_la-dgetv0.lo `test -f 'lapack/dgetv0.c' || echo '$(srcdir)/'`lapack/dgetv0.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dgetv0.Tpo $(DEPDIR)/libarpack_la-dgetv0.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgetv0.c' object='libarpack_la-dgetv0.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dgetv0.lo `test -f 'lapack/dgetv0.c' || echo '$(srcdir)/'`lapack/dgetv0.c
+
+libarpack_la-dvout.lo: lapack/dvout.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dvout.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dvout.Tpo -c -o libarpack_la-dvout.lo `test -f 'lapack/dvout.c' || echo '$(srcdir)/'`lapack/dvout.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dvout.Tpo $(DEPDIR)/libarpack_la-dvout.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dvout.c' object='libarpack_la-dvout.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dvout.lo `test -f 'lapack/dvout.c' || echo '$(srcdir)/'`lapack/dvout.c
+
+libarpack_la-second.lo: lapack/second.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-second.lo -MD -MP -MF $(DEPDIR)/libarpack_la-second.Tpo -c -o libarpack_la-second.lo `test -f 'lapack/second.c' || echo '$(srcdir)/'`lapack/second.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-second.Tpo $(DEPDIR)/libarpack_la-second.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/second.c' object='libarpack_la-second.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-second.lo `test -f 'lapack/second.c' || echo '$(srcdir)/'`lapack/second.c
+
+libarpack_la-dmout.lo: lapack/dmout.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dmout.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dmout.Tpo -c -o libarpack_la-dmout.lo `test -f 'lapack/dmout.c' || echo '$(srcdir)/'`lapack/dmout.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dmout.Tpo $(DEPDIR)/libarpack_la-dmout.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dmout.c' object='libarpack_la-dmout.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dmout.lo `test -f 'lapack/dmout.c' || echo '$(srcdir)/'`lapack/dmout.c
+
+libarpack_la-dnaitr.lo: lapack/dnaitr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dnaitr.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dnaitr.Tpo -c -o libarpack_la-dnaitr.lo `test -f 'lapack/dnaitr.c' || echo '$(srcdir)/'`lapack/dnaitr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dnaitr.Tpo $(DEPDIR)/libarpack_la-dnaitr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnaitr.c' object='libarpack_la-dnaitr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dnaitr.lo `test -f 'lapack/dnaitr.c' || echo '$(srcdir)/'`lapack/dnaitr.c
+
+libarpack_la-ivout.lo: lapack/ivout.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-ivout.lo -MD -MP -MF $(DEPDIR)/libarpack_la-ivout.Tpo -c -o libarpack_la-ivout.lo `test -f 'lapack/ivout.c' || echo '$(srcdir)/'`lapack/ivout.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-ivout.Tpo $(DEPDIR)/libarpack_la-ivout.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/ivout.c' object='libarpack_la-ivout.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-ivout.lo `test -f 'lapack/ivout.c' || echo '$(srcdir)/'`lapack/ivout.c
+
+libarpack_la-dnapps.lo: lapack/dnapps.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dnapps.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dnapps.Tpo -c -o libarpack_la-dnapps.lo `test -f 'lapack/dnapps.c' || echo '$(srcdir)/'`lapack/dnapps.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dnapps.Tpo $(DEPDIR)/libarpack_la-dnapps.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnapps.c' object='libarpack_la-dnapps.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dnapps.lo `test -f 'lapack/dnapps.c' || echo '$(srcdir)/'`lapack/dnapps.c
+
+libarpack_la-dnconv.lo: lapack/dnconv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dnconv.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dnconv.Tpo -c -o libarpack_la-dnconv.lo `test -f 'lapack/dnconv.c' || echo '$(srcdir)/'`lapack/dnconv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dnconv.Tpo $(DEPDIR)/libarpack_la-dnconv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnconv.c' object='libarpack_la-dnconv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dnconv.lo `test -f 'lapack/dnconv.c' || echo '$(srcdir)/'`lapack/dnconv.c
+
+libarpack_la-dneigh.lo: lapack/dneigh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dneigh.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dneigh.Tpo -c -o libarpack_la-dneigh.lo `test -f 'lapack/dneigh.c' || echo '$(srcdir)/'`lapack/dneigh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dneigh.Tpo $(DEPDIR)/libarpack_la-dneigh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dneigh.c' object='libarpack_la-dneigh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dneigh.lo `test -f 'lapack/dneigh.c' || echo '$(srcdir)/'`lapack/dneigh.c
+
+libarpack_la-dlaqrb.lo: lapack/dlaqrb.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dlaqrb.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dlaqrb.Tpo -c -o libarpack_la-dlaqrb.lo `test -f 'lapack/dlaqrb.c' || echo '$(srcdir)/'`lapack/dlaqrb.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dlaqrb.Tpo $(DEPDIR)/libarpack_la-dlaqrb.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqrb.c' object='libarpack_la-dlaqrb.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dlaqrb.lo `test -f 'lapack/dlaqrb.c' || echo '$(srcdir)/'`lapack/dlaqrb.c
+
+libarpack_la-dngets.lo: lapack/dngets.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dngets.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dngets.Tpo -c -o libarpack_la-dngets.lo `test -f 'lapack/dngets.c' || echo '$(srcdir)/'`lapack/dngets.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dngets.Tpo $(DEPDIR)/libarpack_la-dngets.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dngets.c' object='libarpack_la-dngets.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dngets.lo `test -f 'lapack/dngets.c' || echo '$(srcdir)/'`lapack/dngets.c
+
+libarpack_la-dsortc.lo: lapack/dsortc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsortc.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsortc.Tpo -c -o libarpack_la-dsortc.lo `test -f 'lapack/dsortc.c' || echo '$(srcdir)/'`lapack/dsortc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsortc.Tpo $(DEPDIR)/libarpack_la-dsortc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsortc.c' object='libarpack_la-dsortc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsortc.lo `test -f 'lapack/dsortc.c' || echo '$(srcdir)/'`lapack/dsortc.c
+
+libarpack_la-dstatn.lo: lapack/dstatn.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dstatn.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dstatn.Tpo -c -o libarpack_la-dstatn.lo `test -f 'lapack/dstatn.c' || echo '$(srcdir)/'`lapack/dstatn.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dstatn.Tpo $(DEPDIR)/libarpack_la-dstatn.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstatn.c' object='libarpack_la-dstatn.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dstatn.lo `test -f 'lapack/dstatn.c' || echo '$(srcdir)/'`lapack/dstatn.c
+
+libarpack_la-dneupd.lo: lapack/dneupd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dneupd.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dneupd.Tpo -c -o libarpack_la-dneupd.lo `test -f 'lapack/dneupd.c' || echo '$(srcdir)/'`lapack/dneupd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dneupd.Tpo $(DEPDIR)/libarpack_la-dneupd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dneupd.c' object='libarpack_la-dneupd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dneupd.lo `test -f 'lapack/dneupd.c' || echo '$(srcdir)/'`lapack/dneupd.c
+
+libarpack_la-dsaupd.lo: lapack/dsaupd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsaupd.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsaupd.Tpo -c -o libarpack_la-dsaupd.lo `test -f 'lapack/dsaupd.c' || echo '$(srcdir)/'`lapack/dsaupd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsaupd.Tpo $(DEPDIR)/libarpack_la-dsaupd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsaupd.c' object='libarpack_la-dsaupd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsaupd.lo `test -f 'lapack/dsaupd.c' || echo '$(srcdir)/'`lapack/dsaupd.c
+
+libarpack_la-dsaup2.lo: lapack/dsaup2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsaup2.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsaup2.Tpo -c -o libarpack_la-dsaup2.lo `test -f 'lapack/dsaup2.c' || echo '$(srcdir)/'`lapack/dsaup2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsaup2.Tpo $(DEPDIR)/libarpack_la-dsaup2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsaup2.c' object='libarpack_la-dsaup2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsaup2.lo `test -f 'lapack/dsaup2.c' || echo '$(srcdir)/'`lapack/dsaup2.c
+
+libarpack_la-dsaitr.lo: lapack/dsaitr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsaitr.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsaitr.Tpo -c -o libarpack_la-dsaitr.lo `test -f 'lapack/dsaitr.c' || echo '$(srcdir)/'`lapack/dsaitr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsaitr.Tpo $(DEPDIR)/libarpack_la-dsaitr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsaitr.c' object='libarpack_la-dsaitr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsaitr.lo `test -f 'lapack/dsaitr.c' || echo '$(srcdir)/'`lapack/dsaitr.c
+
+libarpack_la-dsapps.lo: lapack/dsapps.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsapps.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsapps.Tpo -c -o libarpack_la-dsapps.lo `test -f 'lapack/dsapps.c' || echo '$(srcdir)/'`lapack/dsapps.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsapps.Tpo $(DEPDIR)/libarpack_la-dsapps.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsapps.c' object='libarpack_la-dsapps.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsapps.lo `test -f 'lapack/dsapps.c' || echo '$(srcdir)/'`lapack/dsapps.c
+
+libarpack_la-dsconv.lo: lapack/dsconv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsconv.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsconv.Tpo -c -o libarpack_la-dsconv.lo `test -f 'lapack/dsconv.c' || echo '$(srcdir)/'`lapack/dsconv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsconv.Tpo $(DEPDIR)/libarpack_la-dsconv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsconv.c' object='libarpack_la-dsconv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsconv.lo `test -f 'lapack/dsconv.c' || echo '$(srcdir)/'`lapack/dsconv.c
+
+libarpack_la-dseigt.lo: lapack/dseigt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dseigt.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dseigt.Tpo -c -o libarpack_la-dseigt.lo `test -f 'lapack/dseigt.c' || echo '$(srcdir)/'`lapack/dseigt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dseigt.Tpo $(DEPDIR)/libarpack_la-dseigt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dseigt.c' object='libarpack_la-dseigt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dseigt.lo `test -f 'lapack/dseigt.c' || echo '$(srcdir)/'`lapack/dseigt.c
+
+libarpack_la-dstqrb.lo: lapack/dstqrb.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dstqrb.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dstqrb.Tpo -c -o libarpack_la-dstqrb.lo `test -f 'lapack/dstqrb.c' || echo '$(srcdir)/'`lapack/dstqrb.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dstqrb.Tpo $(DEPDIR)/libarpack_la-dstqrb.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstqrb.c' object='libarpack_la-dstqrb.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dstqrb.lo `test -f 'lapack/dstqrb.c' || echo '$(srcdir)/'`lapack/dstqrb.c
+
+libarpack_la-dsgets.lo: lapack/dsgets.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsgets.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsgets.Tpo -c -o libarpack_la-dsgets.lo `test -f 'lapack/dsgets.c' || echo '$(srcdir)/'`lapack/dsgets.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsgets.Tpo $(DEPDIR)/libarpack_la-dsgets.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsgets.c' object='libarpack_la-dsgets.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsgets.lo `test -f 'lapack/dsgets.c' || echo '$(srcdir)/'`lapack/dsgets.c
+
+libarpack_la-dsortr.lo: lapack/dsortr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsortr.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsortr.Tpo -c -o libarpack_la-dsortr.lo `test -f 'lapack/dsortr.c' || echo '$(srcdir)/'`lapack/dsortr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsortr.Tpo $(DEPDIR)/libarpack_la-dsortr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsortr.c' object='libarpack_la-dsortr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsortr.lo `test -f 'lapack/dsortr.c' || echo '$(srcdir)/'`lapack/dsortr.c
+
+libarpack_la-dstats.lo: lapack/dstats.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dstats.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dstats.Tpo -c -o libarpack_la-dstats.lo `test -f 'lapack/dstats.c' || echo '$(srcdir)/'`lapack/dstats.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dstats.Tpo $(DEPDIR)/libarpack_la-dstats.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstats.c' object='libarpack_la-dstats.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dstats.lo `test -f 'lapack/dstats.c' || echo '$(srcdir)/'`lapack/dstats.c
+
+libarpack_la-dseupd.lo: lapack/dseupd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dseupd.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dseupd.Tpo -c -o libarpack_la-dseupd.lo `test -f 'lapack/dseupd.c' || echo '$(srcdir)/'`lapack/dseupd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dseupd.Tpo $(DEPDIR)/libarpack_la-dseupd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dseupd.c' object='libarpack_la-dseupd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dseupd.lo `test -f 'lapack/dseupd.c' || echo '$(srcdir)/'`lapack/dseupd.c
+
+libarpack_la-dsesrt.lo: lapack/dsesrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -MT libarpack_la-dsesrt.lo -MD -MP -MF $(DEPDIR)/libarpack_la-dsesrt.Tpo -c -o libarpack_la-dsesrt.lo `test -f 'lapack/dsesrt.c' || echo '$(srcdir)/'`lapack/dsesrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libarpack_la-dsesrt.Tpo $(DEPDIR)/libarpack_la-dsesrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsesrt.c' object='libarpack_la-dsesrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libarpack_la_CFLAGS) $(CFLAGS) -c -o libarpack_la-dsesrt.lo `test -f 'lapack/dsesrt.c' || echo '$(srcdir)/'`lapack/dsesrt.c
+
+libblas_la-dscal.lo: lapack/dscal.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dscal.lo -MD -MP -MF $(DEPDIR)/libblas_la-dscal.Tpo -c -o libblas_la-dscal.lo `test -f 'lapack/dscal.c' || echo '$(srcdir)/'`lapack/dscal.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dscal.Tpo $(DEPDIR)/libblas_la-dscal.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dscal.c' object='libblas_la-dscal.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dscal.lo `test -f 'lapack/dscal.c' || echo '$(srcdir)/'`lapack/dscal.c
+
+libblas_la-dswap.lo: lapack/dswap.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dswap.lo -MD -MP -MF $(DEPDIR)/libblas_la-dswap.Tpo -c -o libblas_la-dswap.lo `test -f 'lapack/dswap.c' || echo '$(srcdir)/'`lapack/dswap.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dswap.Tpo $(DEPDIR)/libblas_la-dswap.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dswap.c' object='libblas_la-dswap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dswap.lo `test -f 'lapack/dswap.c' || echo '$(srcdir)/'`lapack/dswap.c
+
+libblas_la-lsame.lo: lapack/lsame.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-lsame.lo -MD -MP -MF $(DEPDIR)/libblas_la-lsame.Tpo -c -o libblas_la-lsame.lo `test -f 'lapack/lsame.c' || echo '$(srcdir)/'`lapack/lsame.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-lsame.Tpo $(DEPDIR)/libblas_la-lsame.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/lsame.c' object='libblas_la-lsame.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-lsame.lo `test -f 'lapack/lsame.c' || echo '$(srcdir)/'`lapack/lsame.c
+
+libblas_la-idamax.lo: lapack/idamax.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-idamax.lo -MD -MP -MF $(DEPDIR)/libblas_la-idamax.Tpo -c -o libblas_la-idamax.lo `test -f 'lapack/idamax.c' || echo '$(srcdir)/'`lapack/idamax.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-idamax.Tpo $(DEPDIR)/libblas_la-idamax.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/idamax.c' object='libblas_la-idamax.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-idamax.lo `test -f 'lapack/idamax.c' || echo '$(srcdir)/'`lapack/idamax.c
+
+libblas_la-daxpy.lo: lapack/daxpy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-daxpy.lo -MD -MP -MF $(DEPDIR)/libblas_la-daxpy.Tpo -c -o libblas_la-daxpy.lo `test -f 'lapack/daxpy.c' || echo '$(srcdir)/'`lapack/daxpy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-daxpy.Tpo $(DEPDIR)/libblas_la-daxpy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/daxpy.c' object='libblas_la-daxpy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-daxpy.lo `test -f 'lapack/daxpy.c' || echo '$(srcdir)/'`lapack/daxpy.c
+
+libblas_la-dgemv.lo: lapack/dgemv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dgemv.lo -MD -MP -MF $(DEPDIR)/libblas_la-dgemv.Tpo -c -o libblas_la-dgemv.lo `test -f 'lapack/dgemv.c' || echo '$(srcdir)/'`lapack/dgemv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dgemv.Tpo $(DEPDIR)/libblas_la-dgemv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgemv.c' object='libblas_la-dgemv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dgemv.lo `test -f 'lapack/dgemv.c' || echo '$(srcdir)/'`lapack/dgemv.c
+
+libblas_la-dger.lo: lapack/dger.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dger.lo -MD -MP -MF $(DEPDIR)/libblas_la-dger.Tpo -c -o libblas_la-dger.lo `test -f 'lapack/dger.c' || echo '$(srcdir)/'`lapack/dger.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dger.Tpo $(DEPDIR)/libblas_la-dger.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dger.c' object='libblas_la-dger.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dger.lo `test -f 'lapack/dger.c' || echo '$(srcdir)/'`lapack/dger.c
+
+libblas_la-dnrm2.lo: lapack/dnrm2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dnrm2.lo -MD -MP -MF $(DEPDIR)/libblas_la-dnrm2.Tpo -c -o libblas_la-dnrm2.lo `test -f 'lapack/dnrm2.c' || echo '$(srcdir)/'`lapack/dnrm2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dnrm2.Tpo $(DEPDIR)/libblas_la-dnrm2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dnrm2.c' object='libblas_la-dnrm2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dnrm2.lo `test -f 'lapack/dnrm2.c' || echo '$(srcdir)/'`lapack/dnrm2.c
+
+libblas_la-dgemm.lo: lapack/dgemm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dgemm.lo -MD -MP -MF $(DEPDIR)/libblas_la-dgemm.Tpo -c -o libblas_la-dgemm.lo `test -f 'lapack/dgemm.c' || echo '$(srcdir)/'`lapack/dgemm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dgemm.Tpo $(DEPDIR)/libblas_la-dgemm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgemm.c' object='libblas_la-dgemm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dgemm.lo `test -f 'lapack/dgemm.c' || echo '$(srcdir)/'`lapack/dgemm.c
+
+libblas_la-dcopy.lo: lapack/dcopy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dcopy.lo -MD -MP -MF $(DEPDIR)/libblas_la-dcopy.Tpo -c -o libblas_la-dcopy.lo `test -f 'lapack/dcopy.c' || echo '$(srcdir)/'`lapack/dcopy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dcopy.Tpo $(DEPDIR)/libblas_la-dcopy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dcopy.c' object='libblas_la-dcopy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dcopy.lo `test -f 'lapack/dcopy.c' || echo '$(srcdir)/'`lapack/dcopy.c
+
+libblas_la-dtrmm.lo: lapack/dtrmm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dtrmm.lo -MD -MP -MF $(DEPDIR)/libblas_la-dtrmm.Tpo -c -o libblas_la-dtrmm.lo `test -f 'lapack/dtrmm.c' || echo '$(srcdir)/'`lapack/dtrmm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dtrmm.Tpo $(DEPDIR)/libblas_la-dtrmm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrmm.c' object='libblas_la-dtrmm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dtrmm.lo `test -f 'lapack/dtrmm.c' || echo '$(srcdir)/'`lapack/dtrmm.c
+
+libblas_la-dtrmv.lo: lapack/dtrmv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dtrmv.lo -MD -MP -MF $(DEPDIR)/libblas_la-dtrmv.Tpo -c -o libblas_la-dtrmv.lo `test -f 'lapack/dtrmv.c' || echo '$(srcdir)/'`lapack/dtrmv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dtrmv.Tpo $(DEPDIR)/libblas_la-dtrmv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrmv.c' object='libblas_la-dtrmv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dtrmv.lo `test -f 'lapack/dtrmv.c' || echo '$(srcdir)/'`lapack/dtrmv.c
+
+libblas_la-drot.lo: lapack/drot.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-drot.lo -MD -MP -MF $(DEPDIR)/libblas_la-drot.Tpo -c -o libblas_la-drot.lo `test -f 'lapack/drot.c' || echo '$(srcdir)/'`lapack/drot.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-drot.Tpo $(DEPDIR)/libblas_la-drot.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/drot.c' object='libblas_la-drot.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-drot.lo `test -f 'lapack/drot.c' || echo '$(srcdir)/'`lapack/drot.c
+
+libblas_la-ddot.lo: lapack/ddot.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-ddot.lo -MD -MP -MF $(DEPDIR)/libblas_la-ddot.Tpo -c -o libblas_la-ddot.lo `test -f 'lapack/ddot.c' || echo '$(srcdir)/'`lapack/ddot.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-ddot.Tpo $(DEPDIR)/libblas_la-ddot.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/ddot.c' object='libblas_la-ddot.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-ddot.lo `test -f 'lapack/ddot.c' || echo '$(srcdir)/'`lapack/ddot.c
+
+libblas_la-dasum.lo: lapack/dasum.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dasum.lo -MD -MP -MF $(DEPDIR)/libblas_la-dasum.Tpo -c -o libblas_la-dasum.lo `test -f 'lapack/dasum.c' || echo '$(srcdir)/'`lapack/dasum.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dasum.Tpo $(DEPDIR)/libblas_la-dasum.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dasum.c' object='libblas_la-dasum.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dasum.lo `test -f 'lapack/dasum.c' || echo '$(srcdir)/'`lapack/dasum.c
+
+libblas_la-dsymv.lo: lapack/dsymv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dsymv.lo -MD -MP -MF $(DEPDIR)/libblas_la-dsymv.Tpo -c -o libblas_la-dsymv.lo `test -f 'lapack/dsymv.c' || echo '$(srcdir)/'`lapack/dsymv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dsymv.Tpo $(DEPDIR)/libblas_la-dsymv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsymv.c' object='libblas_la-dsymv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dsymv.lo `test -f 'lapack/dsymv.c' || echo '$(srcdir)/'`lapack/dsymv.c
+
+libblas_la-dsyr2k.lo: lapack/dsyr2k.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dsyr2k.lo -MD -MP -MF $(DEPDIR)/libblas_la-dsyr2k.Tpo -c -o libblas_la-dsyr2k.lo `test -f 'lapack/dsyr2k.c' || echo '$(srcdir)/'`lapack/dsyr2k.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dsyr2k.Tpo $(DEPDIR)/libblas_la-dsyr2k.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsyr2k.c' object='libblas_la-dsyr2k.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dsyr2k.lo `test -f 'lapack/dsyr2k.c' || echo '$(srcdir)/'`lapack/dsyr2k.c
+
+libblas_la-dsyr2.lo: lapack/dsyr2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dsyr2.lo -MD -MP -MF $(DEPDIR)/libblas_la-dsyr2.Tpo -c -o libblas_la-dsyr2.lo `test -f 'lapack/dsyr2.c' || echo '$(srcdir)/'`lapack/dsyr2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dsyr2.Tpo $(DEPDIR)/libblas_la-dsyr2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsyr2.c' object='libblas_la-dsyr2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dsyr2.lo `test -f 'lapack/dsyr2.c' || echo '$(srcdir)/'`lapack/dsyr2.c
+
+libblas_la-dtrsm.lo: lapack/dtrsm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -MT libblas_la-dtrsm.lo -MD -MP -MF $(DEPDIR)/libblas_la-dtrsm.Tpo -c -o libblas_la-dtrsm.lo `test -f 'lapack/dtrsm.c' || echo '$(srcdir)/'`lapack/dtrsm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libblas_la-dtrsm.Tpo $(DEPDIR)/libblas_la-dtrsm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrsm.c' object='libblas_la-dtrsm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libblas_la_CFLAGS) $(CFLAGS) -c -o libblas_la-dtrsm.lo `test -f 'lapack/dtrsm.c' || echo '$(srcdir)/'`lapack/dtrsm.c
+
+libdlamch_la-dlamch.lo: lapack/dlamch.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libdlamch_la_CFLAGS) $(CFLAGS) -MT libdlamch_la-dlamch.lo -MD -MP -MF $(DEPDIR)/libdlamch_la-dlamch.Tpo -c -o libdlamch_la-dlamch.lo `test -f 'lapack/dlamch.c' || echo '$(srcdir)/'`lapack/dlamch.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libdlamch_la-dlamch.Tpo $(DEPDIR)/libdlamch_la-dlamch.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlamch.c' object='libdlamch_la-dlamch.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libdlamch_la_CFLAGS) $(CFLAGS) -c -o libdlamch_la-dlamch.lo `test -f 'lapack/dlamch.c' || echo '$(srcdir)/'`lapack/dlamch.c
+
+libf2c_la-abort_.lo: f2c/abort_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-abort_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-abort_.Tpo -c -o libf2c_la-abort_.lo `test -f 'f2c/abort_.c' || echo '$(srcdir)/'`f2c/abort_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-abort_.Tpo $(DEPDIR)/libf2c_la-abort_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/abort_.c' object='libf2c_la-abort_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-abort_.lo `test -f 'f2c/abort_.c' || echo '$(srcdir)/'`f2c/abort_.c
+
+libf2c_la-dolio.lo: f2c/dolio.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-dolio.lo -MD -MP -MF $(DEPDIR)/libf2c_la-dolio.Tpo -c -o libf2c_la-dolio.lo `test -f 'f2c/dolio.c' || echo '$(srcdir)/'`f2c/dolio.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-dolio.Tpo $(DEPDIR)/libf2c_la-dolio.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/dolio.c' object='libf2c_la-dolio.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-dolio.lo `test -f 'f2c/dolio.c' || echo '$(srcdir)/'`f2c/dolio.c
+
+libf2c_la-r_sin.lo: f2c/r_sin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_sin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_sin.Tpo -c -o libf2c_la-r_sin.lo `test -f 'f2c/r_sin.c' || echo '$(srcdir)/'`f2c/r_sin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_sin.Tpo $(DEPDIR)/libf2c_la-r_sin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_sin.c' object='libf2c_la-r_sin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_sin.lo `test -f 'f2c/r_sin.c' || echo '$(srcdir)/'`f2c/r_sin.c
+
+libf2c_la-dummy.lo: f2c/dummy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-dummy.lo -MD -MP -MF $(DEPDIR)/libf2c_la-dummy.Tpo -c -o libf2c_la-dummy.lo `test -f 'f2c/dummy.c' || echo '$(srcdir)/'`f2c/dummy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-dummy.Tpo $(DEPDIR)/libf2c_la-dummy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/dummy.c' object='libf2c_la-dummy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-dummy.lo `test -f 'f2c/dummy.c' || echo '$(srcdir)/'`f2c/dummy.c
+
+libf2c_la-dtime_.lo: f2c/dtime_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-dtime_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-dtime_.Tpo -c -o libf2c_la-dtime_.lo `test -f 'f2c/dtime_.c' || echo '$(srcdir)/'`f2c/dtime_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-dtime_.Tpo $(DEPDIR)/libf2c_la-dtime_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/dtime_.c' object='libf2c_la-dtime_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-dtime_.lo `test -f 'f2c/dtime_.c' || echo '$(srcdir)/'`f2c/dtime_.c
+
+libf2c_la-iio.lo: f2c/iio.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-iio.lo -MD -MP -MF $(DEPDIR)/libf2c_la-iio.Tpo -c -o libf2c_la-iio.lo `test -f 'f2c/iio.c' || echo '$(srcdir)/'`f2c/iio.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-iio.Tpo $(DEPDIR)/libf2c_la-iio.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/iio.c' object='libf2c_la-iio.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-iio.lo `test -f 'f2c/iio.c' || echo '$(srcdir)/'`f2c/iio.c
+
+libf2c_la-r_sinh.lo: f2c/r_sinh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_sinh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_sinh.Tpo -c -o libf2c_la-r_sinh.lo `test -f 'f2c/r_sinh.c' || echo '$(srcdir)/'`f2c/r_sinh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_sinh.Tpo $(DEPDIR)/libf2c_la-r_sinh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_sinh.c' object='libf2c_la-r_sinh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_sinh.lo `test -f 'f2c/r_sinh.c' || echo '$(srcdir)/'`f2c/r_sinh.c
+
+libf2c_la-backspac.lo: f2c/backspac.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-backspac.lo -MD -MP -MF $(DEPDIR)/libf2c_la-backspac.Tpo -c -o libf2c_la-backspac.lo `test -f 'f2c/backspac.c' || echo '$(srcdir)/'`f2c/backspac.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-backspac.Tpo $(DEPDIR)/libf2c_la-backspac.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/backspac.c' object='libf2c_la-backspac.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-backspac.lo `test -f 'f2c/backspac.c' || echo '$(srcdir)/'`f2c/backspac.c
+
+libf2c_la-due.lo: f2c/due.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-due.lo -MD -MP -MF $(DEPDIR)/libf2c_la-due.Tpo -c -o libf2c_la-due.lo `test -f 'f2c/due.c' || echo '$(srcdir)/'`f2c/due.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-due.Tpo $(DEPDIR)/libf2c_la-due.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/due.c' object='libf2c_la-due.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-due.lo `test -f 'f2c/due.c' || echo '$(srcdir)/'`f2c/due.c
+
+libf2c_la-ilnw.lo: f2c/ilnw.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-ilnw.lo -MD -MP -MF $(DEPDIR)/libf2c_la-ilnw.Tpo -c -o libf2c_la-ilnw.lo `test -f 'f2c/ilnw.c' || echo '$(srcdir)/'`f2c/ilnw.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-ilnw.Tpo $(DEPDIR)/libf2c_la-ilnw.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/ilnw.c' object='libf2c_la-ilnw.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-ilnw.lo `test -f 'f2c/ilnw.c' || echo '$(srcdir)/'`f2c/ilnw.c
+
+libf2c_la-r_sqrt.lo: f2c/r_sqrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_sqrt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_sqrt.Tpo -c -o libf2c_la-r_sqrt.lo `test -f 'f2c/r_sqrt.c' || echo '$(srcdir)/'`f2c/r_sqrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_sqrt.Tpo $(DEPDIR)/libf2c_la-r_sqrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_sqrt.c' object='libf2c_la-r_sqrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_sqrt.lo `test -f 'f2c/r_sqrt.c' || echo '$(srcdir)/'`f2c/r_sqrt.c
+
+libf2c_la-c_abs.lo: f2c/c_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_abs.Tpo -c -o libf2c_la-c_abs.lo `test -f 'f2c/c_abs.c' || echo '$(srcdir)/'`f2c/c_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_abs.Tpo $(DEPDIR)/libf2c_la-c_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_abs.c' object='libf2c_la-c_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_abs.lo `test -f 'f2c/c_abs.c' || echo '$(srcdir)/'`f2c/c_abs.c
+
+libf2c_la-ef1asc_.lo: f2c/ef1asc_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-ef1asc_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-ef1asc_.Tpo -c -o libf2c_la-ef1asc_.lo `test -f 'f2c/ef1asc_.c' || echo '$(srcdir)/'`f2c/ef1asc_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-ef1asc_.Tpo $(DEPDIR)/libf2c_la-ef1asc_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/ef1asc_.c' object='libf2c_la-ef1asc_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-ef1asc_.lo `test -f 'f2c/ef1asc_.c' || echo '$(srcdir)/'`f2c/ef1asc_.c
+
+libf2c_la-inquire.lo: f2c/inquire.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-inquire.lo -MD -MP -MF $(DEPDIR)/libf2c_la-inquire.Tpo -c -o libf2c_la-inquire.lo `test -f 'f2c/inquire.c' || echo '$(srcdir)/'`f2c/inquire.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-inquire.Tpo $(DEPDIR)/libf2c_la-inquire.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/inquire.c' object='libf2c_la-inquire.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-inquire.lo `test -f 'f2c/inquire.c' || echo '$(srcdir)/'`f2c/inquire.c
+
+libf2c_la-r_tan.lo: f2c/r_tan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_tan.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_tan.Tpo -c -o libf2c_la-r_tan.lo `test -f 'f2c/r_tan.c' || echo '$(srcdir)/'`f2c/r_tan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_tan.Tpo $(DEPDIR)/libf2c_la-r_tan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_tan.c' object='libf2c_la-r_tan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_tan.lo `test -f 'f2c/r_tan.c' || echo '$(srcdir)/'`f2c/r_tan.c
+
+libf2c_la-c_cos.lo: f2c/c_cos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_cos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_cos.Tpo -c -o libf2c_la-c_cos.lo `test -f 'f2c/c_cos.c' || echo '$(srcdir)/'`f2c/c_cos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_cos.Tpo $(DEPDIR)/libf2c_la-c_cos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_cos.c' object='libf2c_la-c_cos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_cos.lo `test -f 'f2c/c_cos.c' || echo '$(srcdir)/'`f2c/c_cos.c
+
+libf2c_la-ef1cmc_.lo: f2c/ef1cmc_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-ef1cmc_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-ef1cmc_.Tpo -c -o libf2c_la-ef1cmc_.lo `test -f 'f2c/ef1cmc_.c' || echo '$(srcdir)/'`f2c/ef1cmc_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-ef1cmc_.Tpo $(DEPDIR)/libf2c_la-ef1cmc_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/ef1cmc_.c' object='libf2c_la-ef1cmc_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-ef1cmc_.lo `test -f 'f2c/ef1cmc_.c' || echo '$(srcdir)/'`f2c/ef1cmc_.c
+
+libf2c_la-l_ge.lo: f2c/l_ge.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-l_ge.lo -MD -MP -MF $(DEPDIR)/libf2c_la-l_ge.Tpo -c -o libf2c_la-l_ge.lo `test -f 'f2c/l_ge.c' || echo '$(srcdir)/'`f2c/l_ge.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-l_ge.Tpo $(DEPDIR)/libf2c_la-l_ge.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/l_ge.c' object='libf2c_la-l_ge.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-l_ge.lo `test -f 'f2c/l_ge.c' || echo '$(srcdir)/'`f2c/l_ge.c
+
+libf2c_la-r_tanh.lo: f2c/r_tanh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_tanh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_tanh.Tpo -c -o libf2c_la-r_tanh.lo `test -f 'f2c/r_tanh.c' || echo '$(srcdir)/'`f2c/r_tanh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_tanh.Tpo $(DEPDIR)/libf2c_la-r_tanh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_tanh.c' object='libf2c_la-r_tanh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_tanh.lo `test -f 'f2c/r_tanh.c' || echo '$(srcdir)/'`f2c/r_tanh.c
+
+libf2c_la-c_div.lo: f2c/c_div.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_div.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_div.Tpo -c -o libf2c_la-c_div.lo `test -f 'f2c/c_div.c' || echo '$(srcdir)/'`f2c/c_div.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_div.Tpo $(DEPDIR)/libf2c_la-c_div.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_div.c' object='libf2c_la-c_div.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_div.lo `test -f 'f2c/c_div.c' || echo '$(srcdir)/'`f2c/c_div.c
+
+libf2c_la-endfile.lo: f2c/endfile.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-endfile.lo -MD -MP -MF $(DEPDIR)/libf2c_la-endfile.Tpo -c -o libf2c_la-endfile.lo `test -f 'f2c/endfile.c' || echo '$(srcdir)/'`f2c/endfile.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-endfile.Tpo $(DEPDIR)/libf2c_la-endfile.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/endfile.c' object='libf2c_la-endfile.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-endfile.lo `test -f 'f2c/endfile.c' || echo '$(srcdir)/'`f2c/endfile.c
+
+libf2c_la-l_gt.lo: f2c/l_gt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-l_gt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-l_gt.Tpo -c -o libf2c_la-l_gt.lo `test -f 'f2c/l_gt.c' || echo '$(srcdir)/'`f2c/l_gt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-l_gt.Tpo $(DEPDIR)/libf2c_la-l_gt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/l_gt.c' object='libf2c_la-l_gt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-l_gt.lo `test -f 'f2c/l_gt.c' || echo '$(srcdir)/'`f2c/l_gt.c
+
+libf2c_la-rdfmt.lo: f2c/rdfmt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-rdfmt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-rdfmt.Tpo -c -o libf2c_la-rdfmt.lo `test -f 'f2c/rdfmt.c' || echo '$(srcdir)/'`f2c/rdfmt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-rdfmt.Tpo $(DEPDIR)/libf2c_la-rdfmt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/rdfmt.c' object='libf2c_la-rdfmt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-rdfmt.lo `test -f 'f2c/rdfmt.c' || echo '$(srcdir)/'`f2c/rdfmt.c
+
+libf2c_la-c_exp.lo: f2c/c_exp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_exp.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_exp.Tpo -c -o libf2c_la-c_exp.lo `test -f 'f2c/c_exp.c' || echo '$(srcdir)/'`f2c/c_exp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_exp.Tpo $(DEPDIR)/libf2c_la-c_exp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_exp.c' object='libf2c_la-c_exp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_exp.lo `test -f 'f2c/c_exp.c' || echo '$(srcdir)/'`f2c/c_exp.c
+
+libf2c_la-erf_.lo: f2c/erf_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-erf_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-erf_.Tpo -c -o libf2c_la-erf_.lo `test -f 'f2c/erf_.c' || echo '$(srcdir)/'`f2c/erf_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-erf_.Tpo $(DEPDIR)/libf2c_la-erf_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/erf_.c' object='libf2c_la-erf_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-erf_.lo `test -f 'f2c/erf_.c' || echo '$(srcdir)/'`f2c/erf_.c
+
+libf2c_la-l_le.lo: f2c/l_le.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-l_le.lo -MD -MP -MF $(DEPDIR)/libf2c_la-l_le.Tpo -c -o libf2c_la-l_le.lo `test -f 'f2c/l_le.c' || echo '$(srcdir)/'`f2c/l_le.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-l_le.Tpo $(DEPDIR)/libf2c_la-l_le.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/l_le.c' object='libf2c_la-l_le.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-l_le.lo `test -f 'f2c/l_le.c' || echo '$(srcdir)/'`f2c/l_le.c
+
+libf2c_la-rewind.lo: f2c/rewind.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-rewind.lo -MD -MP -MF $(DEPDIR)/libf2c_la-rewind.Tpo -c -o libf2c_la-rewind.lo `test -f 'f2c/rewind.c' || echo '$(srcdir)/'`f2c/rewind.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-rewind.Tpo $(DEPDIR)/libf2c_la-rewind.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/rewind.c' object='libf2c_la-rewind.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-rewind.lo `test -f 'f2c/rewind.c' || echo '$(srcdir)/'`f2c/rewind.c
+
+libf2c_la-c_log.lo: f2c/c_log.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_log.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_log.Tpo -c -o libf2c_la-c_log.lo `test -f 'f2c/c_log.c' || echo '$(srcdir)/'`f2c/c_log.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_log.Tpo $(DEPDIR)/libf2c_la-c_log.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_log.c' object='libf2c_la-c_log.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_log.lo `test -f 'f2c/c_log.c' || echo '$(srcdir)/'`f2c/c_log.c
+
+libf2c_la-erfc_.lo: f2c/erfc_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-erfc_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-erfc_.Tpo -c -o libf2c_la-erfc_.lo `test -f 'f2c/erfc_.c' || echo '$(srcdir)/'`f2c/erfc_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-erfc_.Tpo $(DEPDIR)/libf2c_la-erfc_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/erfc_.c' object='libf2c_la-erfc_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-erfc_.lo `test -f 'f2c/erfc_.c' || echo '$(srcdir)/'`f2c/erfc_.c
+
+libf2c_la-l_lt.lo: f2c/l_lt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-l_lt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-l_lt.Tpo -c -o libf2c_la-l_lt.lo `test -f 'f2c/l_lt.c' || echo '$(srcdir)/'`f2c/l_lt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-l_lt.Tpo $(DEPDIR)/libf2c_la-l_lt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/l_lt.c' object='libf2c_la-l_lt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-l_lt.lo `test -f 'f2c/l_lt.c' || echo '$(srcdir)/'`f2c/l_lt.c
+
+libf2c_la-rsfe.lo: f2c/rsfe.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-rsfe.lo -MD -MP -MF $(DEPDIR)/libf2c_la-rsfe.Tpo -c -o libf2c_la-rsfe.lo `test -f 'f2c/rsfe.c' || echo '$(srcdir)/'`f2c/rsfe.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-rsfe.Tpo $(DEPDIR)/libf2c_la-rsfe.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/rsfe.c' object='libf2c_la-rsfe.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-rsfe.lo `test -f 'f2c/rsfe.c' || echo '$(srcdir)/'`f2c/rsfe.c
+
+libf2c_la-c_sin.lo: f2c/c_sin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_sin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_sin.Tpo -c -o libf2c_la-c_sin.lo `test -f 'f2c/c_sin.c' || echo '$(srcdir)/'`f2c/c_sin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_sin.Tpo $(DEPDIR)/libf2c_la-c_sin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_sin.c' object='libf2c_la-c_sin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_sin.lo `test -f 'f2c/c_sin.c' || echo '$(srcdir)/'`f2c/c_sin.c
+
+libf2c_la-err.lo: f2c/err.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-err.lo -MD -MP -MF $(DEPDIR)/libf2c_la-err.Tpo -c -o libf2c_la-err.lo `test -f 'f2c/err.c' || echo '$(srcdir)/'`f2c/err.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-err.Tpo $(DEPDIR)/libf2c_la-err.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/err.c' object='libf2c_la-err.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-err.lo `test -f 'f2c/err.c' || echo '$(srcdir)/'`f2c/err.c
+
+libf2c_la-lbitbits.lo: f2c/lbitbits.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-lbitbits.lo -MD -MP -MF $(DEPDIR)/libf2c_la-lbitbits.Tpo -c -o libf2c_la-lbitbits.lo `test -f 'f2c/lbitbits.c' || echo '$(srcdir)/'`f2c/lbitbits.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-lbitbits.Tpo $(DEPDIR)/libf2c_la-lbitbits.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/lbitbits.c' object='libf2c_la-lbitbits.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-lbitbits.lo `test -f 'f2c/lbitbits.c' || echo '$(srcdir)/'`f2c/lbitbits.c
+
+libf2c_la-rsli.lo: f2c/rsli.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-rsli.lo -MD -MP -MF $(DEPDIR)/libf2c_la-rsli.Tpo -c -o libf2c_la-rsli.lo `test -f 'f2c/rsli.c' || echo '$(srcdir)/'`f2c/rsli.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-rsli.Tpo $(DEPDIR)/libf2c_la-rsli.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/rsli.c' object='libf2c_la-rsli.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-rsli.lo `test -f 'f2c/rsli.c' || echo '$(srcdir)/'`f2c/rsli.c
+
+libf2c_la-c_sqrt.lo: f2c/c_sqrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-c_sqrt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-c_sqrt.Tpo -c -o libf2c_la-c_sqrt.lo `test -f 'f2c/c_sqrt.c' || echo '$(srcdir)/'`f2c/c_sqrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-c_sqrt.Tpo $(DEPDIR)/libf2c_la-c_sqrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/c_sqrt.c' object='libf2c_la-c_sqrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-c_sqrt.lo `test -f 'f2c/c_sqrt.c' || echo '$(srcdir)/'`f2c/c_sqrt.c
+
+libf2c_la-etime_.lo: f2c/etime_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-etime_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-etime_.Tpo -c -o libf2c_la-etime_.lo `test -f 'f2c/etime_.c' || echo '$(srcdir)/'`f2c/etime_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-etime_.Tpo $(DEPDIR)/libf2c_la-etime_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/etime_.c' object='libf2c_la-etime_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-etime_.lo `test -f 'f2c/etime_.c' || echo '$(srcdir)/'`f2c/etime_.c
+
+libf2c_la-lbitshft.lo: f2c/lbitshft.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-lbitshft.lo -MD -MP -MF $(DEPDIR)/libf2c_la-lbitshft.Tpo -c -o libf2c_la-lbitshft.lo `test -f 'f2c/lbitshft.c' || echo '$(srcdir)/'`f2c/lbitshft.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-lbitshft.Tpo $(DEPDIR)/libf2c_la-lbitshft.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/lbitshft.c' object='libf2c_la-lbitshft.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-lbitshft.lo `test -f 'f2c/lbitshft.c' || echo '$(srcdir)/'`f2c/lbitshft.c
+
+libf2c_la-rsne.lo: f2c/rsne.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-rsne.lo -MD -MP -MF $(DEPDIR)/libf2c_la-rsne.Tpo -c -o libf2c_la-rsne.lo `test -f 'f2c/rsne.c' || echo '$(srcdir)/'`f2c/rsne.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-rsne.Tpo $(DEPDIR)/libf2c_la-rsne.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/rsne.c' object='libf2c_la-rsne.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-rsne.lo `test -f 'f2c/rsne.c' || echo '$(srcdir)/'`f2c/rsne.c
+
+libf2c_la-cabs.lo: f2c/cabs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-cabs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-cabs.Tpo -c -o libf2c_la-cabs.lo `test -f 'f2c/cabs.c' || echo '$(srcdir)/'`f2c/cabs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-cabs.Tpo $(DEPDIR)/libf2c_la-cabs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/cabs.c' object='libf2c_la-cabs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-cabs.lo `test -f 'f2c/cabs.c' || echo '$(srcdir)/'`f2c/cabs.c
+
+libf2c_la-exit_.lo: f2c/exit_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-exit_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-exit_.Tpo -c -o libf2c_la-exit_.lo `test -f 'f2c/exit_.c' || echo '$(srcdir)/'`f2c/exit_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-exit_.Tpo $(DEPDIR)/libf2c_la-exit_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/exit_.c' object='libf2c_la-exit_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-exit_.lo `test -f 'f2c/exit_.c' || echo '$(srcdir)/'`f2c/exit_.c
+
+libf2c_la-lread.lo: f2c/lread.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-lread.lo -MD -MP -MF $(DEPDIR)/libf2c_la-lread.Tpo -c -o libf2c_la-lread.lo `test -f 'f2c/lread.c' || echo '$(srcdir)/'`f2c/lread.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-lread.Tpo $(DEPDIR)/libf2c_la-lread.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/lread.c' object='libf2c_la-lread.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-lread.lo `test -f 'f2c/lread.c' || echo '$(srcdir)/'`f2c/lread.c
+
+libf2c_la-s_cat.lo: f2c/s_cat.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_cat.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_cat.Tpo -c -o libf2c_la-s_cat.lo `test -f 'f2c/s_cat.c' || echo '$(srcdir)/'`f2c/s_cat.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_cat.Tpo $(DEPDIR)/libf2c_la-s_cat.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_cat.c' object='libf2c_la-s_cat.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_cat.lo `test -f 'f2c/s_cat.c' || echo '$(srcdir)/'`f2c/s_cat.c
+
+libf2c_la-close.lo: f2c/close.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-close.lo -MD -MP -MF $(DEPDIR)/libf2c_la-close.Tpo -c -o libf2c_la-close.lo `test -f 'f2c/close.c' || echo '$(srcdir)/'`f2c/close.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-close.Tpo $(DEPDIR)/libf2c_la-close.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/close.c' object='libf2c_la-close.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-close.lo `test -f 'f2c/close.c' || echo '$(srcdir)/'`f2c/close.c
+
+libf2c_la-f77_aloc.lo: f2c/f77_aloc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-f77_aloc.lo -MD -MP -MF $(DEPDIR)/libf2c_la-f77_aloc.Tpo -c -o libf2c_la-f77_aloc.lo `test -f 'f2c/f77_aloc.c' || echo '$(srcdir)/'`f2c/f77_aloc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-f77_aloc.Tpo $(DEPDIR)/libf2c_la-f77_aloc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/f77_aloc.c' object='libf2c_la-f77_aloc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-f77_aloc.lo `test -f 'f2c/f77_aloc.c' || echo '$(srcdir)/'`f2c/f77_aloc.c
+
+libf2c_la-lwrite.lo: f2c/lwrite.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-lwrite.lo -MD -MP -MF $(DEPDIR)/libf2c_la-lwrite.Tpo -c -o libf2c_la-lwrite.lo `test -f 'f2c/lwrite.c' || echo '$(srcdir)/'`f2c/lwrite.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-lwrite.Tpo $(DEPDIR)/libf2c_la-lwrite.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/lwrite.c' object='libf2c_la-lwrite.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-lwrite.lo `test -f 'f2c/lwrite.c' || echo '$(srcdir)/'`f2c/lwrite.c
+
+libf2c_la-s_cmp.lo: f2c/s_cmp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_cmp.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_cmp.Tpo -c -o libf2c_la-s_cmp.lo `test -f 'f2c/s_cmp.c' || echo '$(srcdir)/'`f2c/s_cmp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_cmp.Tpo $(DEPDIR)/libf2c_la-s_cmp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_cmp.c' object='libf2c_la-s_cmp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_cmp.lo `test -f 'f2c/s_cmp.c' || echo '$(srcdir)/'`f2c/s_cmp.c
+
+libf2c_la-ctype.lo: f2c/ctype.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-ctype.lo -MD -MP -MF $(DEPDIR)/libf2c_la-ctype.Tpo -c -o libf2c_la-ctype.lo `test -f 'f2c/ctype.c' || echo '$(srcdir)/'`f2c/ctype.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-ctype.Tpo $(DEPDIR)/libf2c_la-ctype.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/ctype.c' object='libf2c_la-ctype.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-ctype.lo `test -f 'f2c/ctype.c' || echo '$(srcdir)/'`f2c/ctype.c
+
+libf2c_la-f77vers.lo: f2c/f77vers.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-f77vers.lo -MD -MP -MF $(DEPDIR)/libf2c_la-f77vers.Tpo -c -o libf2c_la-f77vers.lo `test -f 'f2c/f77vers.c' || echo '$(srcdir)/'`f2c/f77vers.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-f77vers.Tpo $(DEPDIR)/libf2c_la-f77vers.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/f77vers.c' object='libf2c_la-f77vers.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-f77vers.lo `test -f 'f2c/f77vers.c' || echo '$(srcdir)/'`f2c/f77vers.c
+
+libf2c_la-s_copy.lo: f2c/s_copy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_copy.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_copy.Tpo -c -o libf2c_la-s_copy.lo `test -f 'f2c/s_copy.c' || echo '$(srcdir)/'`f2c/s_copy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_copy.Tpo $(DEPDIR)/libf2c_la-s_copy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_copy.c' object='libf2c_la-s_copy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_copy.lo `test -f 'f2c/s_copy.c' || echo '$(srcdir)/'`f2c/s_copy.c
+
+libf2c_la-d_abs.lo: f2c/d_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_abs.Tpo -c -o libf2c_la-d_abs.lo `test -f 'f2c/d_abs.c' || echo '$(srcdir)/'`f2c/d_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_abs.Tpo $(DEPDIR)/libf2c_la-d_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_abs.c' object='libf2c_la-d_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_abs.lo `test -f 'f2c/d_abs.c' || echo '$(srcdir)/'`f2c/d_abs.c
+
+libf2c_la-fmt.lo: f2c/fmt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-fmt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-fmt.Tpo -c -o libf2c_la-fmt.lo `test -f 'f2c/fmt.c' || echo '$(srcdir)/'`f2c/fmt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-fmt.Tpo $(DEPDIR)/libf2c_la-fmt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/fmt.c' object='libf2c_la-fmt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-fmt.lo `test -f 'f2c/fmt.c' || echo '$(srcdir)/'`f2c/fmt.c
+
+libf2c_la-open.lo: f2c/open.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-open.lo -MD -MP -MF $(DEPDIR)/libf2c_la-open.Tpo -c -o libf2c_la-open.lo `test -f 'f2c/open.c' || echo '$(srcdir)/'`f2c/open.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-open.Tpo $(DEPDIR)/libf2c_la-open.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/open.c' object='libf2c_la-open.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-open.lo `test -f 'f2c/open.c' || echo '$(srcdir)/'`f2c/open.c
+
+libf2c_la-s_paus.lo: f2c/s_paus.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_paus.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_paus.Tpo -c -o libf2c_la-s_paus.lo `test -f 'f2c/s_paus.c' || echo '$(srcdir)/'`f2c/s_paus.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_paus.Tpo $(DEPDIR)/libf2c_la-s_paus.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_paus.c' object='libf2c_la-s_paus.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_paus.lo `test -f 'f2c/s_paus.c' || echo '$(srcdir)/'`f2c/s_paus.c
+
+libf2c_la-d_acos.lo: f2c/d_acos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_acos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_acos.Tpo -c -o libf2c_la-d_acos.lo `test -f 'f2c/d_acos.c' || echo '$(srcdir)/'`f2c/d_acos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_acos.Tpo $(DEPDIR)/libf2c_la-d_acos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_acos.c' object='libf2c_la-d_acos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_acos.lo `test -f 'f2c/d_acos.c' || echo '$(srcdir)/'`f2c/d_acos.c
+
+libf2c_la-fmtlib.lo: f2c/fmtlib.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-fmtlib.lo -MD -MP -MF $(DEPDIR)/libf2c_la-fmtlib.Tpo -c -o libf2c_la-fmtlib.lo `test -f 'f2c/fmtlib.c' || echo '$(srcdir)/'`f2c/fmtlib.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-fmtlib.Tpo $(DEPDIR)/libf2c_la-fmtlib.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/fmtlib.c' object='libf2c_la-fmtlib.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-fmtlib.lo `test -f 'f2c/fmtlib.c' || echo '$(srcdir)/'`f2c/fmtlib.c
+
+libf2c_la-pow_ci.lo: f2c/pow_ci.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_ci.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_ci.Tpo -c -o libf2c_la-pow_ci.lo `test -f 'f2c/pow_ci.c' || echo '$(srcdir)/'`f2c/pow_ci.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_ci.Tpo $(DEPDIR)/libf2c_la-pow_ci.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_ci.c' object='libf2c_la-pow_ci.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_ci.lo `test -f 'f2c/pow_ci.c' || echo '$(srcdir)/'`f2c/pow_ci.c
+
+libf2c_la-s_rnge.lo: f2c/s_rnge.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_rnge.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_rnge.Tpo -c -o libf2c_la-s_rnge.lo `test -f 'f2c/s_rnge.c' || echo '$(srcdir)/'`f2c/s_rnge.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_rnge.Tpo $(DEPDIR)/libf2c_la-s_rnge.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_rnge.c' object='libf2c_la-s_rnge.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_rnge.lo `test -f 'f2c/s_rnge.c' || echo '$(srcdir)/'`f2c/s_rnge.c
+
+libf2c_la-d_asin.lo: f2c/d_asin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_asin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_asin.Tpo -c -o libf2c_la-d_asin.lo `test -f 'f2c/d_asin.c' || echo '$(srcdir)/'`f2c/d_asin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_asin.Tpo $(DEPDIR)/libf2c_la-d_asin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_asin.c' object='libf2c_la-d_asin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_asin.lo `test -f 'f2c/d_asin.c' || echo '$(srcdir)/'`f2c/d_asin.c
+
+libf2c_la-ftell_.lo: f2c/ftell_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-ftell_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-ftell_.Tpo -c -o libf2c_la-ftell_.lo `test -f 'f2c/ftell_.c' || echo '$(srcdir)/'`f2c/ftell_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-ftell_.Tpo $(DEPDIR)/libf2c_la-ftell_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/ftell_.c' object='libf2c_la-ftell_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-ftell_.lo `test -f 'f2c/ftell_.c' || echo '$(srcdir)/'`f2c/ftell_.c
+
+libf2c_la-pow_dd.lo: f2c/pow_dd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_dd.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_dd.Tpo -c -o libf2c_la-pow_dd.lo `test -f 'f2c/pow_dd.c' || echo '$(srcdir)/'`f2c/pow_dd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_dd.Tpo $(DEPDIR)/libf2c_la-pow_dd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_dd.c' object='libf2c_la-pow_dd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_dd.lo `test -f 'f2c/pow_dd.c' || echo '$(srcdir)/'`f2c/pow_dd.c
+
+libf2c_la-s_stop.lo: f2c/s_stop.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-s_stop.lo -MD -MP -MF $(DEPDIR)/libf2c_la-s_stop.Tpo -c -o libf2c_la-s_stop.lo `test -f 'f2c/s_stop.c' || echo '$(srcdir)/'`f2c/s_stop.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-s_stop.Tpo $(DEPDIR)/libf2c_la-s_stop.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/s_stop.c' object='libf2c_la-s_stop.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-s_stop.lo `test -f 'f2c/s_stop.c' || echo '$(srcdir)/'`f2c/s_stop.c
+
+libf2c_la-d_atan.lo: f2c/d_atan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_atan.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_atan.Tpo -c -o libf2c_la-d_atan.lo `test -f 'f2c/d_atan.c' || echo '$(srcdir)/'`f2c/d_atan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_atan.Tpo $(DEPDIR)/libf2c_la-d_atan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_atan.c' object='libf2c_la-d_atan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_atan.lo `test -f 'f2c/d_atan.c' || echo '$(srcdir)/'`f2c/d_atan.c
+
+libf2c_la-pow_di.lo: f2c/pow_di.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_di.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_di.Tpo -c -o libf2c_la-pow_di.lo `test -f 'f2c/pow_di.c' || echo '$(srcdir)/'`f2c/pow_di.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_di.Tpo $(DEPDIR)/libf2c_la-pow_di.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_di.c' object='libf2c_la-pow_di.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_di.lo `test -f 'f2c/pow_di.c' || echo '$(srcdir)/'`f2c/pow_di.c
+
+libf2c_la-sfe.lo: f2c/sfe.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-sfe.lo -MD -MP -MF $(DEPDIR)/libf2c_la-sfe.Tpo -c -o libf2c_la-sfe.lo `test -f 'f2c/sfe.c' || echo '$(srcdir)/'`f2c/sfe.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-sfe.Tpo $(DEPDIR)/libf2c_la-sfe.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/sfe.c' object='libf2c_la-sfe.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-sfe.lo `test -f 'f2c/sfe.c' || echo '$(srcdir)/'`f2c/sfe.c
+
+libf2c_la-d_atn2.lo: f2c/d_atn2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_atn2.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_atn2.Tpo -c -o libf2c_la-d_atn2.lo `test -f 'f2c/d_atn2.c' || echo '$(srcdir)/'`f2c/d_atn2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_atn2.Tpo $(DEPDIR)/libf2c_la-d_atn2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_atn2.c' object='libf2c_la-d_atn2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_atn2.lo `test -f 'f2c/d_atn2.c' || echo '$(srcdir)/'`f2c/d_atn2.c
+
+libf2c_la-getenv_.lo: f2c/getenv_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-getenv_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-getenv_.Tpo -c -o libf2c_la-getenv_.lo `test -f 'f2c/getenv_.c' || echo '$(srcdir)/'`f2c/getenv_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-getenv_.Tpo $(DEPDIR)/libf2c_la-getenv_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/getenv_.c' object='libf2c_la-getenv_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-getenv_.lo `test -f 'f2c/getenv_.c' || echo '$(srcdir)/'`f2c/getenv_.c
+
+libf2c_la-pow_hh.lo: f2c/pow_hh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_hh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_hh.Tpo -c -o libf2c_la-pow_hh.lo `test -f 'f2c/pow_hh.c' || echo '$(srcdir)/'`f2c/pow_hh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_hh.Tpo $(DEPDIR)/libf2c_la-pow_hh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_hh.c' object='libf2c_la-pow_hh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_hh.lo `test -f 'f2c/pow_hh.c' || echo '$(srcdir)/'`f2c/pow_hh.c
+
+libf2c_la-sig_die.lo: f2c/sig_die.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-sig_die.lo -MD -MP -MF $(DEPDIR)/libf2c_la-sig_die.Tpo -c -o libf2c_la-sig_die.lo `test -f 'f2c/sig_die.c' || echo '$(srcdir)/'`f2c/sig_die.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-sig_die.Tpo $(DEPDIR)/libf2c_la-sig_die.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/sig_die.c' object='libf2c_la-sig_die.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-sig_die.lo `test -f 'f2c/sig_die.c' || echo '$(srcdir)/'`f2c/sig_die.c
+
+libf2c_la-d_cnjg.lo: f2c/d_cnjg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_cnjg.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_cnjg.Tpo -c -o libf2c_la-d_cnjg.lo `test -f 'f2c/d_cnjg.c' || echo '$(srcdir)/'`f2c/d_cnjg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_cnjg.Tpo $(DEPDIR)/libf2c_la-d_cnjg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_cnjg.c' object='libf2c_la-d_cnjg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_cnjg.lo `test -f 'f2c/d_cnjg.c' || echo '$(srcdir)/'`f2c/d_cnjg.c
+
+libf2c_la-h_abs.lo: f2c/h_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_abs.Tpo -c -o libf2c_la-h_abs.lo `test -f 'f2c/h_abs.c' || echo '$(srcdir)/'`f2c/h_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_abs.Tpo $(DEPDIR)/libf2c_la-h_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_abs.c' object='libf2c_la-h_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_abs.lo `test -f 'f2c/h_abs.c' || echo '$(srcdir)/'`f2c/h_abs.c
+
+libf2c_la-pow_ii.lo: f2c/pow_ii.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_ii.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_ii.Tpo -c -o libf2c_la-pow_ii.lo `test -f 'f2c/pow_ii.c' || echo '$(srcdir)/'`f2c/pow_ii.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_ii.Tpo $(DEPDIR)/libf2c_la-pow_ii.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_ii.c' object='libf2c_la-pow_ii.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_ii.lo `test -f 'f2c/pow_ii.c' || echo '$(srcdir)/'`f2c/pow_ii.c
+
+libf2c_la-signal_.lo: f2c/signal_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-signal_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-signal_.Tpo -c -o libf2c_la-signal_.lo `test -f 'f2c/signal_.c' || echo '$(srcdir)/'`f2c/signal_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-signal_.Tpo $(DEPDIR)/libf2c_la-signal_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/signal_.c' object='libf2c_la-signal_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-signal_.lo `test -f 'f2c/signal_.c' || echo '$(srcdir)/'`f2c/signal_.c
+
+libf2c_la-d_cos.lo: f2c/d_cos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_cos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_cos.Tpo -c -o libf2c_la-d_cos.lo `test -f 'f2c/d_cos.c' || echo '$(srcdir)/'`f2c/d_cos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_cos.Tpo $(DEPDIR)/libf2c_la-d_cos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_cos.c' object='libf2c_la-d_cos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_cos.lo `test -f 'f2c/d_cos.c' || echo '$(srcdir)/'`f2c/d_cos.c
+
+libf2c_la-h_dim.lo: f2c/h_dim.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_dim.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_dim.Tpo -c -o libf2c_la-h_dim.lo `test -f 'f2c/h_dim.c' || echo '$(srcdir)/'`f2c/h_dim.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_dim.Tpo $(DEPDIR)/libf2c_la-h_dim.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_dim.c' object='libf2c_la-h_dim.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_dim.lo `test -f 'f2c/h_dim.c' || echo '$(srcdir)/'`f2c/h_dim.c
+
+libf2c_la-pow_ri.lo: f2c/pow_ri.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_ri.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_ri.Tpo -c -o libf2c_la-pow_ri.lo `test -f 'f2c/pow_ri.c' || echo '$(srcdir)/'`f2c/pow_ri.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_ri.Tpo $(DEPDIR)/libf2c_la-pow_ri.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_ri.c' object='libf2c_la-pow_ri.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_ri.lo `test -f 'f2c/pow_ri.c' || echo '$(srcdir)/'`f2c/pow_ri.c
+
+libf2c_la-signbit.lo: f2c/signbit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-signbit.lo -MD -MP -MF $(DEPDIR)/libf2c_la-signbit.Tpo -c -o libf2c_la-signbit.lo `test -f 'f2c/signbit.c' || echo '$(srcdir)/'`f2c/signbit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-signbit.Tpo $(DEPDIR)/libf2c_la-signbit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/signbit.c' object='libf2c_la-signbit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-signbit.lo `test -f 'f2c/signbit.c' || echo '$(srcdir)/'`f2c/signbit.c
+
+libf2c_la-d_cosh.lo: f2c/d_cosh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_cosh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_cosh.Tpo -c -o libf2c_la-d_cosh.lo `test -f 'f2c/d_cosh.c' || echo '$(srcdir)/'`f2c/d_cosh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_cosh.Tpo $(DEPDIR)/libf2c_la-d_cosh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_cosh.c' object='libf2c_la-d_cosh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_cosh.lo `test -f 'f2c/d_cosh.c' || echo '$(srcdir)/'`f2c/d_cosh.c
+
+libf2c_la-h_dnnt.lo: f2c/h_dnnt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_dnnt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_dnnt.Tpo -c -o libf2c_la-h_dnnt.lo `test -f 'f2c/h_dnnt.c' || echo '$(srcdir)/'`f2c/h_dnnt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_dnnt.Tpo $(DEPDIR)/libf2c_la-h_dnnt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_dnnt.c' object='libf2c_la-h_dnnt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_dnnt.lo `test -f 'f2c/h_dnnt.c' || echo '$(srcdir)/'`f2c/h_dnnt.c
+
+libf2c_la-pow_zi.lo: f2c/pow_zi.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_zi.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_zi.Tpo -c -o libf2c_la-pow_zi.lo `test -f 'f2c/pow_zi.c' || echo '$(srcdir)/'`f2c/pow_zi.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_zi.Tpo $(DEPDIR)/libf2c_la-pow_zi.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_zi.c' object='libf2c_la-pow_zi.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_zi.lo `test -f 'f2c/pow_zi.c' || echo '$(srcdir)/'`f2c/pow_zi.c
+
+libf2c_la-sue.lo: f2c/sue.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-sue.lo -MD -MP -MF $(DEPDIR)/libf2c_la-sue.Tpo -c -o libf2c_la-sue.lo `test -f 'f2c/sue.c' || echo '$(srcdir)/'`f2c/sue.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-sue.Tpo $(DEPDIR)/libf2c_la-sue.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/sue.c' object='libf2c_la-sue.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-sue.lo `test -f 'f2c/sue.c' || echo '$(srcdir)/'`f2c/sue.c
+
+libf2c_la-d_dim.lo: f2c/d_dim.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_dim.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_dim.Tpo -c -o libf2c_la-d_dim.lo `test -f 'f2c/d_dim.c' || echo '$(srcdir)/'`f2c/d_dim.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_dim.Tpo $(DEPDIR)/libf2c_la-d_dim.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_dim.c' object='libf2c_la-d_dim.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_dim.lo `test -f 'f2c/d_dim.c' || echo '$(srcdir)/'`f2c/d_dim.c
+
+libf2c_la-h_indx.lo: f2c/h_indx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_indx.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_indx.Tpo -c -o libf2c_la-h_indx.lo `test -f 'f2c/h_indx.c' || echo '$(srcdir)/'`f2c/h_indx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_indx.Tpo $(DEPDIR)/libf2c_la-h_indx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_indx.c' object='libf2c_la-h_indx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_indx.lo `test -f 'f2c/h_indx.c' || echo '$(srcdir)/'`f2c/h_indx.c
+
+libf2c_la-pow_zz.lo: f2c/pow_zz.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-pow_zz.lo -MD -MP -MF $(DEPDIR)/libf2c_la-pow_zz.Tpo -c -o libf2c_la-pow_zz.lo `test -f 'f2c/pow_zz.c' || echo '$(srcdir)/'`f2c/pow_zz.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-pow_zz.Tpo $(DEPDIR)/libf2c_la-pow_zz.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/pow_zz.c' object='libf2c_la-pow_zz.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-pow_zz.lo `test -f 'f2c/pow_zz.c' || echo '$(srcdir)/'`f2c/pow_zz.c
+
+libf2c_la-system_.lo: f2c/system_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-system_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-system_.Tpo -c -o libf2c_la-system_.lo `test -f 'f2c/system_.c' || echo '$(srcdir)/'`f2c/system_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-system_.Tpo $(DEPDIR)/libf2c_la-system_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/system_.c' object='libf2c_la-system_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-system_.lo `test -f 'f2c/system_.c' || echo '$(srcdir)/'`f2c/system_.c
+
+libf2c_la-d_exp.lo: f2c/d_exp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_exp.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_exp.Tpo -c -o libf2c_la-d_exp.lo `test -f 'f2c/d_exp.c' || echo '$(srcdir)/'`f2c/d_exp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_exp.Tpo $(DEPDIR)/libf2c_la-d_exp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_exp.c' object='libf2c_la-d_exp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_exp.lo `test -f 'f2c/d_exp.c' || echo '$(srcdir)/'`f2c/d_exp.c
+
+libf2c_la-h_len.lo: f2c/h_len.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_len.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_len.Tpo -c -o libf2c_la-h_len.lo `test -f 'f2c/h_len.c' || echo '$(srcdir)/'`f2c/h_len.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_len.Tpo $(DEPDIR)/libf2c_la-h_len.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_len.c' object='libf2c_la-h_len.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_len.lo `test -f 'f2c/h_len.c' || echo '$(srcdir)/'`f2c/h_len.c
+
+libf2c_la-r_abs.lo: f2c/r_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_abs.Tpo -c -o libf2c_la-r_abs.lo `test -f 'f2c/r_abs.c' || echo '$(srcdir)/'`f2c/r_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_abs.Tpo $(DEPDIR)/libf2c_la-r_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_abs.c' object='libf2c_la-r_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_abs.lo `test -f 'f2c/r_abs.c' || echo '$(srcdir)/'`f2c/r_abs.c
+
+libf2c_la-typesize.lo: f2c/typesize.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-typesize.lo -MD -MP -MF $(DEPDIR)/libf2c_la-typesize.Tpo -c -o libf2c_la-typesize.lo `test -f 'f2c/typesize.c' || echo '$(srcdir)/'`f2c/typesize.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-typesize.Tpo $(DEPDIR)/libf2c_la-typesize.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/typesize.c' object='libf2c_la-typesize.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-typesize.lo `test -f 'f2c/typesize.c' || echo '$(srcdir)/'`f2c/typesize.c
+
+libf2c_la-d_imag.lo: f2c/d_imag.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_imag.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_imag.Tpo -c -o libf2c_la-d_imag.lo `test -f 'f2c/d_imag.c' || echo '$(srcdir)/'`f2c/d_imag.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_imag.Tpo $(DEPDIR)/libf2c_la-d_imag.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_imag.c' object='libf2c_la-d_imag.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_imag.lo `test -f 'f2c/d_imag.c' || echo '$(srcdir)/'`f2c/d_imag.c
+
+libf2c_la-h_mod.lo: f2c/h_mod.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_mod.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_mod.Tpo -c -o libf2c_la-h_mod.lo `test -f 'f2c/h_mod.c' || echo '$(srcdir)/'`f2c/h_mod.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_mod.Tpo $(DEPDIR)/libf2c_la-h_mod.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_mod.c' object='libf2c_la-h_mod.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_mod.lo `test -f 'f2c/h_mod.c' || echo '$(srcdir)/'`f2c/h_mod.c
+
+libf2c_la-r_acos.lo: f2c/r_acos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_acos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_acos.Tpo -c -o libf2c_la-r_acos.lo `test -f 'f2c/r_acos.c' || echo '$(srcdir)/'`f2c/r_acos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_acos.Tpo $(DEPDIR)/libf2c_la-r_acos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_acos.c' object='libf2c_la-r_acos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_acos.lo `test -f 'f2c/r_acos.c' || echo '$(srcdir)/'`f2c/r_acos.c
+
+libf2c_la-uio.lo: f2c/uio.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-uio.lo -MD -MP -MF $(DEPDIR)/libf2c_la-uio.Tpo -c -o libf2c_la-uio.lo `test -f 'f2c/uio.c' || echo '$(srcdir)/'`f2c/uio.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-uio.Tpo $(DEPDIR)/libf2c_la-uio.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/uio.c' object='libf2c_la-uio.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-uio.lo `test -f 'f2c/uio.c' || echo '$(srcdir)/'`f2c/uio.c
+
+libf2c_la-d_int.lo: f2c/d_int.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_int.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_int.Tpo -c -o libf2c_la-d_int.lo `test -f 'f2c/d_int.c' || echo '$(srcdir)/'`f2c/d_int.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_int.Tpo $(DEPDIR)/libf2c_la-d_int.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_int.c' object='libf2c_la-d_int.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_int.lo `test -f 'f2c/d_int.c' || echo '$(srcdir)/'`f2c/d_int.c
+
+libf2c_la-h_nint.lo: f2c/h_nint.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_nint.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_nint.Tpo -c -o libf2c_la-h_nint.lo `test -f 'f2c/h_nint.c' || echo '$(srcdir)/'`f2c/h_nint.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_nint.Tpo $(DEPDIR)/libf2c_la-h_nint.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_nint.c' object='libf2c_la-h_nint.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_nint.lo `test -f 'f2c/h_nint.c' || echo '$(srcdir)/'`f2c/h_nint.c
+
+libf2c_la-r_asin.lo: f2c/r_asin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_asin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_asin.Tpo -c -o libf2c_la-r_asin.lo `test -f 'f2c/r_asin.c' || echo '$(srcdir)/'`f2c/r_asin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_asin.Tpo $(DEPDIR)/libf2c_la-r_asin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_asin.c' object='libf2c_la-r_asin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_asin.lo `test -f 'f2c/r_asin.c' || echo '$(srcdir)/'`f2c/r_asin.c
+
+libf2c_la-uninit.lo: f2c/uninit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-uninit.lo -MD -MP -MF $(DEPDIR)/libf2c_la-uninit.Tpo -c -o libf2c_la-uninit.lo `test -f 'f2c/uninit.c' || echo '$(srcdir)/'`f2c/uninit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-uninit.Tpo $(DEPDIR)/libf2c_la-uninit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/uninit.c' object='libf2c_la-uninit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-uninit.lo `test -f 'f2c/uninit.c' || echo '$(srcdir)/'`f2c/uninit.c
+
+libf2c_la-d_lg10.lo: f2c/d_lg10.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_lg10.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_lg10.Tpo -c -o libf2c_la-d_lg10.lo `test -f 'f2c/d_lg10.c' || echo '$(srcdir)/'`f2c/d_lg10.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_lg10.Tpo $(DEPDIR)/libf2c_la-d_lg10.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_lg10.c' object='libf2c_la-d_lg10.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_lg10.lo `test -f 'f2c/d_lg10.c' || echo '$(srcdir)/'`f2c/d_lg10.c
+
+libf2c_la-h_sign.lo: f2c/h_sign.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-h_sign.lo -MD -MP -MF $(DEPDIR)/libf2c_la-h_sign.Tpo -c -o libf2c_la-h_sign.lo `test -f 'f2c/h_sign.c' || echo '$(srcdir)/'`f2c/h_sign.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-h_sign.Tpo $(DEPDIR)/libf2c_la-h_sign.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/h_sign.c' object='libf2c_la-h_sign.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-h_sign.lo `test -f 'f2c/h_sign.c' || echo '$(srcdir)/'`f2c/h_sign.c
+
+libf2c_la-r_atan.lo: f2c/r_atan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_atan.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_atan.Tpo -c -o libf2c_la-r_atan.lo `test -f 'f2c/r_atan.c' || echo '$(srcdir)/'`f2c/r_atan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_atan.Tpo $(DEPDIR)/libf2c_la-r_atan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_atan.c' object='libf2c_la-r_atan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_atan.lo `test -f 'f2c/r_atan.c' || echo '$(srcdir)/'`f2c/r_atan.c
+
+libf2c_la-util.lo: f2c/util.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-util.lo -MD -MP -MF $(DEPDIR)/libf2c_la-util.Tpo -c -o libf2c_la-util.lo `test -f 'f2c/util.c' || echo '$(srcdir)/'`f2c/util.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-util.Tpo $(DEPDIR)/libf2c_la-util.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/util.c' object='libf2c_la-util.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-util.lo `test -f 'f2c/util.c' || echo '$(srcdir)/'`f2c/util.c
+
+libf2c_la-d_log.lo: f2c/d_log.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_log.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_log.Tpo -c -o libf2c_la-d_log.lo `test -f 'f2c/d_log.c' || echo '$(srcdir)/'`f2c/d_log.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_log.Tpo $(DEPDIR)/libf2c_la-d_log.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_log.c' object='libf2c_la-d_log.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_log.lo `test -f 'f2c/d_log.c' || echo '$(srcdir)/'`f2c/d_log.c
+
+libf2c_la-hl_ge.lo: f2c/hl_ge.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-hl_ge.lo -MD -MP -MF $(DEPDIR)/libf2c_la-hl_ge.Tpo -c -o libf2c_la-hl_ge.lo `test -f 'f2c/hl_ge.c' || echo '$(srcdir)/'`f2c/hl_ge.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-hl_ge.Tpo $(DEPDIR)/libf2c_la-hl_ge.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/hl_ge.c' object='libf2c_la-hl_ge.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-hl_ge.lo `test -f 'f2c/hl_ge.c' || echo '$(srcdir)/'`f2c/hl_ge.c
+
+libf2c_la-r_atn2.lo: f2c/r_atn2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_atn2.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_atn2.Tpo -c -o libf2c_la-r_atn2.lo `test -f 'f2c/r_atn2.c' || echo '$(srcdir)/'`f2c/r_atn2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_atn2.Tpo $(DEPDIR)/libf2c_la-r_atn2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_atn2.c' object='libf2c_la-r_atn2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_atn2.lo `test -f 'f2c/r_atn2.c' || echo '$(srcdir)/'`f2c/r_atn2.c
+
+libf2c_la-wref.lo: f2c/wref.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-wref.lo -MD -MP -MF $(DEPDIR)/libf2c_la-wref.Tpo -c -o libf2c_la-wref.lo `test -f 'f2c/wref.c' || echo '$(srcdir)/'`f2c/wref.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-wref.Tpo $(DEPDIR)/libf2c_la-wref.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/wref.c' object='libf2c_la-wref.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-wref.lo `test -f 'f2c/wref.c' || echo '$(srcdir)/'`f2c/wref.c
+
+libf2c_la-d_mod.lo: f2c/d_mod.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_mod.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_mod.Tpo -c -o libf2c_la-d_mod.lo `test -f 'f2c/d_mod.c' || echo '$(srcdir)/'`f2c/d_mod.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_mod.Tpo $(DEPDIR)/libf2c_la-d_mod.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_mod.c' object='libf2c_la-d_mod.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_mod.lo `test -f 'f2c/d_mod.c' || echo '$(srcdir)/'`f2c/d_mod.c
+
+libf2c_la-hl_gt.lo: f2c/hl_gt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-hl_gt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-hl_gt.Tpo -c -o libf2c_la-hl_gt.lo `test -f 'f2c/hl_gt.c' || echo '$(srcdir)/'`f2c/hl_gt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-hl_gt.Tpo $(DEPDIR)/libf2c_la-hl_gt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/hl_gt.c' object='libf2c_la-hl_gt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-hl_gt.lo `test -f 'f2c/hl_gt.c' || echo '$(srcdir)/'`f2c/hl_gt.c
+
+libf2c_la-r_cnjg.lo: f2c/r_cnjg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_cnjg.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_cnjg.Tpo -c -o libf2c_la-r_cnjg.lo `test -f 'f2c/r_cnjg.c' || echo '$(srcdir)/'`f2c/r_cnjg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_cnjg.Tpo $(DEPDIR)/libf2c_la-r_cnjg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_cnjg.c' object='libf2c_la-r_cnjg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_cnjg.lo `test -f 'f2c/r_cnjg.c' || echo '$(srcdir)/'`f2c/r_cnjg.c
+
+libf2c_la-wrtfmt.lo: f2c/wrtfmt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-wrtfmt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-wrtfmt.Tpo -c -o libf2c_la-wrtfmt.lo `test -f 'f2c/wrtfmt.c' || echo '$(srcdir)/'`f2c/wrtfmt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-wrtfmt.Tpo $(DEPDIR)/libf2c_la-wrtfmt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/wrtfmt.c' object='libf2c_la-wrtfmt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-wrtfmt.lo `test -f 'f2c/wrtfmt.c' || echo '$(srcdir)/'`f2c/wrtfmt.c
+
+libf2c_la-d_nint.lo: f2c/d_nint.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_nint.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_nint.Tpo -c -o libf2c_la-d_nint.lo `test -f 'f2c/d_nint.c' || echo '$(srcdir)/'`f2c/d_nint.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_nint.Tpo $(DEPDIR)/libf2c_la-d_nint.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_nint.c' object='libf2c_la-d_nint.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_nint.lo `test -f 'f2c/d_nint.c' || echo '$(srcdir)/'`f2c/d_nint.c
+
+libf2c_la-hl_le.lo: f2c/hl_le.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-hl_le.lo -MD -MP -MF $(DEPDIR)/libf2c_la-hl_le.Tpo -c -o libf2c_la-hl_le.lo `test -f 'f2c/hl_le.c' || echo '$(srcdir)/'`f2c/hl_le.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-hl_le.Tpo $(DEPDIR)/libf2c_la-hl_le.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/hl_le.c' object='libf2c_la-hl_le.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-hl_le.lo `test -f 'f2c/hl_le.c' || echo '$(srcdir)/'`f2c/hl_le.c
+
+libf2c_la-r_cos.lo: f2c/r_cos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_cos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_cos.Tpo -c -o libf2c_la-r_cos.lo `test -f 'f2c/r_cos.c' || echo '$(srcdir)/'`f2c/r_cos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_cos.Tpo $(DEPDIR)/libf2c_la-r_cos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_cos.c' object='libf2c_la-r_cos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_cos.lo `test -f 'f2c/r_cos.c' || echo '$(srcdir)/'`f2c/r_cos.c
+
+libf2c_la-wsfe.lo: f2c/wsfe.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-wsfe.lo -MD -MP -MF $(DEPDIR)/libf2c_la-wsfe.Tpo -c -o libf2c_la-wsfe.lo `test -f 'f2c/wsfe.c' || echo '$(srcdir)/'`f2c/wsfe.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-wsfe.Tpo $(DEPDIR)/libf2c_la-wsfe.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/wsfe.c' object='libf2c_la-wsfe.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-wsfe.lo `test -f 'f2c/wsfe.c' || echo '$(srcdir)/'`f2c/wsfe.c
+
+libf2c_la-d_prod.lo: f2c/d_prod.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_prod.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_prod.Tpo -c -o libf2c_la-d_prod.lo `test -f 'f2c/d_prod.c' || echo '$(srcdir)/'`f2c/d_prod.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_prod.Tpo $(DEPDIR)/libf2c_la-d_prod.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_prod.c' object='libf2c_la-d_prod.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_prod.lo `test -f 'f2c/d_prod.c' || echo '$(srcdir)/'`f2c/d_prod.c
+
+libf2c_la-hl_lt.lo: f2c/hl_lt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-hl_lt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-hl_lt.Tpo -c -o libf2c_la-hl_lt.lo `test -f 'f2c/hl_lt.c' || echo '$(srcdir)/'`f2c/hl_lt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-hl_lt.Tpo $(DEPDIR)/libf2c_la-hl_lt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/hl_lt.c' object='libf2c_la-hl_lt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-hl_lt.lo `test -f 'f2c/hl_lt.c' || echo '$(srcdir)/'`f2c/hl_lt.c
+
+libf2c_la-r_cosh.lo: f2c/r_cosh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_cosh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_cosh.Tpo -c -o libf2c_la-r_cosh.lo `test -f 'f2c/r_cosh.c' || echo '$(srcdir)/'`f2c/r_cosh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_cosh.Tpo $(DEPDIR)/libf2c_la-r_cosh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_cosh.c' object='libf2c_la-r_cosh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_cosh.lo `test -f 'f2c/r_cosh.c' || echo '$(srcdir)/'`f2c/r_cosh.c
+
+libf2c_la-wsle.lo: f2c/wsle.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-wsle.lo -MD -MP -MF $(DEPDIR)/libf2c_la-wsle.Tpo -c -o libf2c_la-wsle.lo `test -f 'f2c/wsle.c' || echo '$(srcdir)/'`f2c/wsle.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-wsle.Tpo $(DEPDIR)/libf2c_la-wsle.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/wsle.c' object='libf2c_la-wsle.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-wsle.lo `test -f 'f2c/wsle.c' || echo '$(srcdir)/'`f2c/wsle.c
+
+libf2c_la-d_sign.lo: f2c/d_sign.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_sign.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_sign.Tpo -c -o libf2c_la-d_sign.lo `test -f 'f2c/d_sign.c' || echo '$(srcdir)/'`f2c/d_sign.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_sign.Tpo $(DEPDIR)/libf2c_la-d_sign.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_sign.c' object='libf2c_la-d_sign.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_sign.lo `test -f 'f2c/d_sign.c' || echo '$(srcdir)/'`f2c/d_sign.c
+
+libf2c_la-i77vers.lo: f2c/i77vers.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i77vers.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i77vers.Tpo -c -o libf2c_la-i77vers.lo `test -f 'f2c/i77vers.c' || echo '$(srcdir)/'`f2c/i77vers.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i77vers.Tpo $(DEPDIR)/libf2c_la-i77vers.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i77vers.c' object='libf2c_la-i77vers.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i77vers.lo `test -f 'f2c/i77vers.c' || echo '$(srcdir)/'`f2c/i77vers.c
+
+libf2c_la-r_dim.lo: f2c/r_dim.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_dim.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_dim.Tpo -c -o libf2c_la-r_dim.lo `test -f 'f2c/r_dim.c' || echo '$(srcdir)/'`f2c/r_dim.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_dim.Tpo $(DEPDIR)/libf2c_la-r_dim.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_dim.c' object='libf2c_la-r_dim.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_dim.lo `test -f 'f2c/r_dim.c' || echo '$(srcdir)/'`f2c/r_dim.c
+
+libf2c_la-wsne.lo: f2c/wsne.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-wsne.lo -MD -MP -MF $(DEPDIR)/libf2c_la-wsne.Tpo -c -o libf2c_la-wsne.lo `test -f 'f2c/wsne.c' || echo '$(srcdir)/'`f2c/wsne.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-wsne.Tpo $(DEPDIR)/libf2c_la-wsne.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/wsne.c' object='libf2c_la-wsne.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-wsne.lo `test -f 'f2c/wsne.c' || echo '$(srcdir)/'`f2c/wsne.c
+
+libf2c_la-d_sin.lo: f2c/d_sin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_sin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_sin.Tpo -c -o libf2c_la-d_sin.lo `test -f 'f2c/d_sin.c' || echo '$(srcdir)/'`f2c/d_sin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_sin.Tpo $(DEPDIR)/libf2c_la-d_sin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_sin.c' object='libf2c_la-d_sin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_sin.lo `test -f 'f2c/d_sin.c' || echo '$(srcdir)/'`f2c/d_sin.c
+
+libf2c_la-i_abs.lo: f2c/i_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_abs.Tpo -c -o libf2c_la-i_abs.lo `test -f 'f2c/i_abs.c' || echo '$(srcdir)/'`f2c/i_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_abs.Tpo $(DEPDIR)/libf2c_la-i_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_abs.c' object='libf2c_la-i_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_abs.lo `test -f 'f2c/i_abs.c' || echo '$(srcdir)/'`f2c/i_abs.c
+
+libf2c_la-r_exp.lo: f2c/r_exp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_exp.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_exp.Tpo -c -o libf2c_la-r_exp.lo `test -f 'f2c/r_exp.c' || echo '$(srcdir)/'`f2c/r_exp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_exp.Tpo $(DEPDIR)/libf2c_la-r_exp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_exp.c' object='libf2c_la-r_exp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_exp.lo `test -f 'f2c/r_exp.c' || echo '$(srcdir)/'`f2c/r_exp.c
+
+libf2c_la-xwsne.lo: f2c/xwsne.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-xwsne.lo -MD -MP -MF $(DEPDIR)/libf2c_la-xwsne.Tpo -c -o libf2c_la-xwsne.lo `test -f 'f2c/xwsne.c' || echo '$(srcdir)/'`f2c/xwsne.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-xwsne.Tpo $(DEPDIR)/libf2c_la-xwsne.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/xwsne.c' object='libf2c_la-xwsne.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-xwsne.lo `test -f 'f2c/xwsne.c' || echo '$(srcdir)/'`f2c/xwsne.c
+
+libf2c_la-d_sinh.lo: f2c/d_sinh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_sinh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_sinh.Tpo -c -o libf2c_la-d_sinh.lo `test -f 'f2c/d_sinh.c' || echo '$(srcdir)/'`f2c/d_sinh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_sinh.Tpo $(DEPDIR)/libf2c_la-d_sinh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_sinh.c' object='libf2c_la-d_sinh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_sinh.lo `test -f 'f2c/d_sinh.c' || echo '$(srcdir)/'`f2c/d_sinh.c
+
+libf2c_la-i_dim.lo: f2c/i_dim.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_dim.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_dim.Tpo -c -o libf2c_la-i_dim.lo `test -f 'f2c/i_dim.c' || echo '$(srcdir)/'`f2c/i_dim.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_dim.Tpo $(DEPDIR)/libf2c_la-i_dim.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_dim.c' object='libf2c_la-i_dim.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_dim.lo `test -f 'f2c/i_dim.c' || echo '$(srcdir)/'`f2c/i_dim.c
+
+libf2c_la-r_imag.lo: f2c/r_imag.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_imag.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_imag.Tpo -c -o libf2c_la-r_imag.lo `test -f 'f2c/r_imag.c' || echo '$(srcdir)/'`f2c/r_imag.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_imag.Tpo $(DEPDIR)/libf2c_la-r_imag.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_imag.c' object='libf2c_la-r_imag.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_imag.lo `test -f 'f2c/r_imag.c' || echo '$(srcdir)/'`f2c/r_imag.c
+
+libf2c_la-z_abs.lo: f2c/z_abs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_abs.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_abs.Tpo -c -o libf2c_la-z_abs.lo `test -f 'f2c/z_abs.c' || echo '$(srcdir)/'`f2c/z_abs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_abs.Tpo $(DEPDIR)/libf2c_la-z_abs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_abs.c' object='libf2c_la-z_abs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_abs.lo `test -f 'f2c/z_abs.c' || echo '$(srcdir)/'`f2c/z_abs.c
+
+libf2c_la-d_sqrt.lo: f2c/d_sqrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_sqrt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_sqrt.Tpo -c -o libf2c_la-d_sqrt.lo `test -f 'f2c/d_sqrt.c' || echo '$(srcdir)/'`f2c/d_sqrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_sqrt.Tpo $(DEPDIR)/libf2c_la-d_sqrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_sqrt.c' object='libf2c_la-d_sqrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_sqrt.lo `test -f 'f2c/d_sqrt.c' || echo '$(srcdir)/'`f2c/d_sqrt.c
+
+libf2c_la-i_dnnt.lo: f2c/i_dnnt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_dnnt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_dnnt.Tpo -c -o libf2c_la-i_dnnt.lo `test -f 'f2c/i_dnnt.c' || echo '$(srcdir)/'`f2c/i_dnnt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_dnnt.Tpo $(DEPDIR)/libf2c_la-i_dnnt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_dnnt.c' object='libf2c_la-i_dnnt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_dnnt.lo `test -f 'f2c/i_dnnt.c' || echo '$(srcdir)/'`f2c/i_dnnt.c
+
+libf2c_la-r_int.lo: f2c/r_int.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_int.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_int.Tpo -c -o libf2c_la-r_int.lo `test -f 'f2c/r_int.c' || echo '$(srcdir)/'`f2c/r_int.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_int.Tpo $(DEPDIR)/libf2c_la-r_int.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_int.c' object='libf2c_la-r_int.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_int.lo `test -f 'f2c/r_int.c' || echo '$(srcdir)/'`f2c/r_int.c
+
+libf2c_la-z_cos.lo: f2c/z_cos.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_cos.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_cos.Tpo -c -o libf2c_la-z_cos.lo `test -f 'f2c/z_cos.c' || echo '$(srcdir)/'`f2c/z_cos.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_cos.Tpo $(DEPDIR)/libf2c_la-z_cos.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_cos.c' object='libf2c_la-z_cos.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_cos.lo `test -f 'f2c/z_cos.c' || echo '$(srcdir)/'`f2c/z_cos.c
+
+libf2c_la-d_tan.lo: f2c/d_tan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_tan.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_tan.Tpo -c -o libf2c_la-d_tan.lo `test -f 'f2c/d_tan.c' || echo '$(srcdir)/'`f2c/d_tan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_tan.Tpo $(DEPDIR)/libf2c_la-d_tan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_tan.c' object='libf2c_la-d_tan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_tan.lo `test -f 'f2c/d_tan.c' || echo '$(srcdir)/'`f2c/d_tan.c
+
+libf2c_la-i_indx.lo: f2c/i_indx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_indx.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_indx.Tpo -c -o libf2c_la-i_indx.lo `test -f 'f2c/i_indx.c' || echo '$(srcdir)/'`f2c/i_indx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_indx.Tpo $(DEPDIR)/libf2c_la-i_indx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_indx.c' object='libf2c_la-i_indx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_indx.lo `test -f 'f2c/i_indx.c' || echo '$(srcdir)/'`f2c/i_indx.c
+
+libf2c_la-r_lg10.lo: f2c/r_lg10.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_lg10.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_lg10.Tpo -c -o libf2c_la-r_lg10.lo `test -f 'f2c/r_lg10.c' || echo '$(srcdir)/'`f2c/r_lg10.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_lg10.Tpo $(DEPDIR)/libf2c_la-r_lg10.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_lg10.c' object='libf2c_la-r_lg10.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_lg10.lo `test -f 'f2c/r_lg10.c' || echo '$(srcdir)/'`f2c/r_lg10.c
+
+libf2c_la-z_div.lo: f2c/z_div.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_div.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_div.Tpo -c -o libf2c_la-z_div.lo `test -f 'f2c/z_div.c' || echo '$(srcdir)/'`f2c/z_div.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_div.Tpo $(DEPDIR)/libf2c_la-z_div.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_div.c' object='libf2c_la-z_div.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_div.lo `test -f 'f2c/z_div.c' || echo '$(srcdir)/'`f2c/z_div.c
+
+libf2c_la-d_tanh.lo: f2c/d_tanh.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-d_tanh.lo -MD -MP -MF $(DEPDIR)/libf2c_la-d_tanh.Tpo -c -o libf2c_la-d_tanh.lo `test -f 'f2c/d_tanh.c' || echo '$(srcdir)/'`f2c/d_tanh.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-d_tanh.Tpo $(DEPDIR)/libf2c_la-d_tanh.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/d_tanh.c' object='libf2c_la-d_tanh.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-d_tanh.lo `test -f 'f2c/d_tanh.c' || echo '$(srcdir)/'`f2c/d_tanh.c
+
+libf2c_la-i_len.lo: f2c/i_len.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_len.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_len.Tpo -c -o libf2c_la-i_len.lo `test -f 'f2c/i_len.c' || echo '$(srcdir)/'`f2c/i_len.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_len.Tpo $(DEPDIR)/libf2c_la-i_len.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_len.c' object='libf2c_la-i_len.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_len.lo `test -f 'f2c/i_len.c' || echo '$(srcdir)/'`f2c/i_len.c
+
+libf2c_la-r_log.lo: f2c/r_log.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_log.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_log.Tpo -c -o libf2c_la-r_log.lo `test -f 'f2c/r_log.c' || echo '$(srcdir)/'`f2c/r_log.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_log.Tpo $(DEPDIR)/libf2c_la-r_log.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_log.c' object='libf2c_la-r_log.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_log.lo `test -f 'f2c/r_log.c' || echo '$(srcdir)/'`f2c/r_log.c
+
+libf2c_la-z_exp.lo: f2c/z_exp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_exp.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_exp.Tpo -c -o libf2c_la-z_exp.lo `test -f 'f2c/z_exp.c' || echo '$(srcdir)/'`f2c/z_exp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_exp.Tpo $(DEPDIR)/libf2c_la-z_exp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_exp.c' object='libf2c_la-z_exp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_exp.lo `test -f 'f2c/z_exp.c' || echo '$(srcdir)/'`f2c/z_exp.c
+
+libf2c_la-derf_.lo: f2c/derf_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-derf_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-derf_.Tpo -c -o libf2c_la-derf_.lo `test -f 'f2c/derf_.c' || echo '$(srcdir)/'`f2c/derf_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-derf_.Tpo $(DEPDIR)/libf2c_la-derf_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/derf_.c' object='libf2c_la-derf_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-derf_.lo `test -f 'f2c/derf_.c' || echo '$(srcdir)/'`f2c/derf_.c
+
+libf2c_la-i_mod.lo: f2c/i_mod.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_mod.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_mod.Tpo -c -o libf2c_la-i_mod.lo `test -f 'f2c/i_mod.c' || echo '$(srcdir)/'`f2c/i_mod.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_mod.Tpo $(DEPDIR)/libf2c_la-i_mod.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_mod.c' object='libf2c_la-i_mod.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_mod.lo `test -f 'f2c/i_mod.c' || echo '$(srcdir)/'`f2c/i_mod.c
+
+libf2c_la-r_mod.lo: f2c/r_mod.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_mod.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_mod.Tpo -c -o libf2c_la-r_mod.lo `test -f 'f2c/r_mod.c' || echo '$(srcdir)/'`f2c/r_mod.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_mod.Tpo $(DEPDIR)/libf2c_la-r_mod.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_mod.c' object='libf2c_la-r_mod.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_mod.lo `test -f 'f2c/r_mod.c' || echo '$(srcdir)/'`f2c/r_mod.c
+
+libf2c_la-z_log.lo: f2c/z_log.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_log.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_log.Tpo -c -o libf2c_la-z_log.lo `test -f 'f2c/z_log.c' || echo '$(srcdir)/'`f2c/z_log.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_log.Tpo $(DEPDIR)/libf2c_la-z_log.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_log.c' object='libf2c_la-z_log.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_log.lo `test -f 'f2c/z_log.c' || echo '$(srcdir)/'`f2c/z_log.c
+
+libf2c_la-derfc_.lo: f2c/derfc_.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-derfc_.lo -MD -MP -MF $(DEPDIR)/libf2c_la-derfc_.Tpo -c -o libf2c_la-derfc_.lo `test -f 'f2c/derfc_.c' || echo '$(srcdir)/'`f2c/derfc_.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-derfc_.Tpo $(DEPDIR)/libf2c_la-derfc_.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/derfc_.c' object='libf2c_la-derfc_.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-derfc_.lo `test -f 'f2c/derfc_.c' || echo '$(srcdir)/'`f2c/derfc_.c
+
+libf2c_la-i_nint.lo: f2c/i_nint.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_nint.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_nint.Tpo -c -o libf2c_la-i_nint.lo `test -f 'f2c/i_nint.c' || echo '$(srcdir)/'`f2c/i_nint.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_nint.Tpo $(DEPDIR)/libf2c_la-i_nint.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_nint.c' object='libf2c_la-i_nint.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_nint.lo `test -f 'f2c/i_nint.c' || echo '$(srcdir)/'`f2c/i_nint.c
+
+libf2c_la-r_nint.lo: f2c/r_nint.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_nint.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_nint.Tpo -c -o libf2c_la-r_nint.lo `test -f 'f2c/r_nint.c' || echo '$(srcdir)/'`f2c/r_nint.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_nint.Tpo $(DEPDIR)/libf2c_la-r_nint.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_nint.c' object='libf2c_la-r_nint.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_nint.lo `test -f 'f2c/r_nint.c' || echo '$(srcdir)/'`f2c/r_nint.c
+
+libf2c_la-z_sin.lo: f2c/z_sin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_sin.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_sin.Tpo -c -o libf2c_la-z_sin.lo `test -f 'f2c/z_sin.c' || echo '$(srcdir)/'`f2c/z_sin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_sin.Tpo $(DEPDIR)/libf2c_la-z_sin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_sin.c' object='libf2c_la-z_sin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_sin.lo `test -f 'f2c/z_sin.c' || echo '$(srcdir)/'`f2c/z_sin.c
+
+libf2c_la-dfe.lo: f2c/dfe.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-dfe.lo -MD -MP -MF $(DEPDIR)/libf2c_la-dfe.Tpo -c -o libf2c_la-dfe.lo `test -f 'f2c/dfe.c' || echo '$(srcdir)/'`f2c/dfe.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-dfe.Tpo $(DEPDIR)/libf2c_la-dfe.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/dfe.c' object='libf2c_la-dfe.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-dfe.lo `test -f 'f2c/dfe.c' || echo '$(srcdir)/'`f2c/dfe.c
+
+libf2c_la-i_sign.lo: f2c/i_sign.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-i_sign.lo -MD -MP -MF $(DEPDIR)/libf2c_la-i_sign.Tpo -c -o libf2c_la-i_sign.lo `test -f 'f2c/i_sign.c' || echo '$(srcdir)/'`f2c/i_sign.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-i_sign.Tpo $(DEPDIR)/libf2c_la-i_sign.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/i_sign.c' object='libf2c_la-i_sign.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-i_sign.lo `test -f 'f2c/i_sign.c' || echo '$(srcdir)/'`f2c/i_sign.c
+
+libf2c_la-r_sign.lo: f2c/r_sign.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-r_sign.lo -MD -MP -MF $(DEPDIR)/libf2c_la-r_sign.Tpo -c -o libf2c_la-r_sign.lo `test -f 'f2c/r_sign.c' || echo '$(srcdir)/'`f2c/r_sign.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-r_sign.Tpo $(DEPDIR)/libf2c_la-r_sign.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/r_sign.c' object='libf2c_la-r_sign.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-r_sign.lo `test -f 'f2c/r_sign.c' || echo '$(srcdir)/'`f2c/r_sign.c
+
+libf2c_la-z_sqrt.lo: f2c/z_sqrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -MT libf2c_la-z_sqrt.lo -MD -MP -MF $(DEPDIR)/libf2c_la-z_sqrt.Tpo -c -o libf2c_la-z_sqrt.lo `test -f 'f2c/z_sqrt.c' || echo '$(srcdir)/'`f2c/z_sqrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libf2c_la-z_sqrt.Tpo $(DEPDIR)/libf2c_la-z_sqrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='f2c/z_sqrt.c' object='libf2c_la-z_sqrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libf2c_la_CFLAGS) $(CFLAGS) -c -o libf2c_la-z_sqrt.lo `test -f 'f2c/z_sqrt.c' || echo '$(srcdir)/'`f2c/z_sqrt.c
+
+libglpk_la-glpapi01.lo: ../optional/glpk/glpapi01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi01.Tpo -c -o libglpk_la-glpapi01.lo `test -f '../optional/glpk/glpapi01.c' || echo '$(srcdir)/'`../optional/glpk/glpapi01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi01.Tpo $(DEPDIR)/libglpk_la-glpapi01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi01.c' object='libglpk_la-glpapi01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi01.lo `test -f '../optional/glpk/glpapi01.c' || echo '$(srcdir)/'`../optional/glpk/glpapi01.c
+
+libglpk_la-glpapi02.lo: ../optional/glpk/glpapi02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi02.Tpo -c -o libglpk_la-glpapi02.lo `test -f '../optional/glpk/glpapi02.c' || echo '$(srcdir)/'`../optional/glpk/glpapi02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi02.Tpo $(DEPDIR)/libglpk_la-glpapi02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi02.c' object='libglpk_la-glpapi02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi02.lo `test -f '../optional/glpk/glpapi02.c' || echo '$(srcdir)/'`../optional/glpk/glpapi02.c
+
+libglpk_la-glpapi03.lo: ../optional/glpk/glpapi03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi03.Tpo -c -o libglpk_la-glpapi03.lo `test -f '../optional/glpk/glpapi03.c' || echo '$(srcdir)/'`../optional/glpk/glpapi03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi03.Tpo $(DEPDIR)/libglpk_la-glpapi03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi03.c' object='libglpk_la-glpapi03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi03.lo `test -f '../optional/glpk/glpapi03.c' || echo '$(srcdir)/'`../optional/glpk/glpapi03.c
+
+libglpk_la-glpapi04.lo: ../optional/glpk/glpapi04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi04.Tpo -c -o libglpk_la-glpapi04.lo `test -f '../optional/glpk/glpapi04.c' || echo '$(srcdir)/'`../optional/glpk/glpapi04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi04.Tpo $(DEPDIR)/libglpk_la-glpapi04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi04.c' object='libglpk_la-glpapi04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi04.lo `test -f '../optional/glpk/glpapi04.c' || echo '$(srcdir)/'`../optional/glpk/glpapi04.c
+
+libglpk_la-glpapi05.lo: ../optional/glpk/glpapi05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi05.Tpo -c -o libglpk_la-glpapi05.lo `test -f '../optional/glpk/glpapi05.c' || echo '$(srcdir)/'`../optional/glpk/glpapi05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi05.Tpo $(DEPDIR)/libglpk_la-glpapi05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi05.c' object='libglpk_la-glpapi05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi05.lo `test -f '../optional/glpk/glpapi05.c' || echo '$(srcdir)/'`../optional/glpk/glpapi05.c
+
+libglpk_la-glpapi06.lo: ../optional/glpk/glpapi06.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi06.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi06.Tpo -c -o libglpk_la-glpapi06.lo `test -f '../optional/glpk/glpapi06.c' || echo '$(srcdir)/'`../optional/glpk/glpapi06.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi06.Tpo $(DEPDIR)/libglpk_la-glpapi06.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi06.c' object='libglpk_la-glpapi06.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi06.lo `test -f '../optional/glpk/glpapi06.c' || echo '$(srcdir)/'`../optional/glpk/glpapi06.c
+
+libglpk_la-glpapi07.lo: ../optional/glpk/glpapi07.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi07.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi07.Tpo -c -o libglpk_la-glpapi07.lo `test -f '../optional/glpk/glpapi07.c' || echo '$(srcdir)/'`../optional/glpk/glpapi07.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi07.Tpo $(DEPDIR)/libglpk_la-glpapi07.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi07.c' object='libglpk_la-glpapi07.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi07.lo `test -f '../optional/glpk/glpapi07.c' || echo '$(srcdir)/'`../optional/glpk/glpapi07.c
+
+libglpk_la-glpapi08.lo: ../optional/glpk/glpapi08.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi08.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi08.Tpo -c -o libglpk_la-glpapi08.lo `test -f '../optional/glpk/glpapi08.c' || echo '$(srcdir)/'`../optional/glpk/glpapi08.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi08.Tpo $(DEPDIR)/libglpk_la-glpapi08.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi08.c' object='libglpk_la-glpapi08.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi08.lo `test -f '../optional/glpk/glpapi08.c' || echo '$(srcdir)/'`../optional/glpk/glpapi08.c
+
+libglpk_la-glpapi09.lo: ../optional/glpk/glpapi09.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi09.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi09.Tpo -c -o libglpk_la-glpapi09.lo `test -f '../optional/glpk/glpapi09.c' || echo '$(srcdir)/'`../optional/glpk/glpapi09.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi09.Tpo $(DEPDIR)/libglpk_la-glpapi09.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi09.c' object='libglpk_la-glpapi09.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi09.lo `test -f '../optional/glpk/glpapi09.c' || echo '$(srcdir)/'`../optional/glpk/glpapi09.c
+
+libglpk_la-glpapi10.lo: ../optional/glpk/glpapi10.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi10.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi10.Tpo -c -o libglpk_la-glpapi10.lo `test -f '../optional/glpk/glpapi10.c' || echo '$(srcdir)/'`../optional/glpk/glpapi10.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi10.Tpo $(DEPDIR)/libglpk_la-glpapi10.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi10.c' object='libglpk_la-glpapi10.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi10.lo `test -f '../optional/glpk/glpapi10.c' || echo '$(srcdir)/'`../optional/glpk/glpapi10.c
+
+libglpk_la-glpapi11.lo: ../optional/glpk/glpapi11.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi11.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi11.Tpo -c -o libglpk_la-glpapi11.lo `test -f '../optional/glpk/glpapi11.c' || echo '$(srcdir)/'`../optional/glpk/glpapi11.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi11.Tpo $(DEPDIR)/libglpk_la-glpapi11.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi11.c' object='libglpk_la-glpapi11.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi11.lo `test -f '../optional/glpk/glpapi11.c' || echo '$(srcdir)/'`../optional/glpk/glpapi11.c
+
+libglpk_la-glpapi12.lo: ../optional/glpk/glpapi12.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi12.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi12.Tpo -c -o libglpk_la-glpapi12.lo `test -f '../optional/glpk/glpapi12.c' || echo '$(srcdir)/'`../optional/glpk/glpapi12.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi12.Tpo $(DEPDIR)/libglpk_la-glpapi12.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi12.c' object='libglpk_la-glpapi12.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi12.lo `test -f '../optional/glpk/glpapi12.c' || echo '$(srcdir)/'`../optional/glpk/glpapi12.c
+
+libglpk_la-glpapi13.lo: ../optional/glpk/glpapi13.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi13.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi13.Tpo -c -o libglpk_la-glpapi13.lo `test -f '../optional/glpk/glpapi13.c' || echo '$(srcdir)/'`../optional/glpk/glpapi13.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi13.Tpo $(DEPDIR)/libglpk_la-glpapi13.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi13.c' object='libglpk_la-glpapi13.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi13.lo `test -f '../optional/glpk/glpapi13.c' || echo '$(srcdir)/'`../optional/glpk/glpapi13.c
+
+libglpk_la-glpapi14.lo: ../optional/glpk/glpapi14.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi14.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi14.Tpo -c -o libglpk_la-glpapi14.lo `test -f '../optional/glpk/glpapi14.c' || echo '$(srcdir)/'`../optional/glpk/glpapi14.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi14.Tpo $(DEPDIR)/libglpk_la-glpapi14.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi14.c' object='libglpk_la-glpapi14.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi14.lo `test -f '../optional/glpk/glpapi14.c' || echo '$(srcdir)/'`../optional/glpk/glpapi14.c
+
+libglpk_la-glpapi15.lo: ../optional/glpk/glpapi15.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi15.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi15.Tpo -c -o libglpk_la-glpapi15.lo `test -f '../optional/glpk/glpapi15.c' || echo '$(srcdir)/'`../optional/glpk/glpapi15.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi15.Tpo $(DEPDIR)/libglpk_la-glpapi15.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi15.c' object='libglpk_la-glpapi15.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi15.lo `test -f '../optional/glpk/glpapi15.c' || echo '$(srcdir)/'`../optional/glpk/glpapi15.c
+
+libglpk_la-glpapi16.lo: ../optional/glpk/glpapi16.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi16.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi16.Tpo -c -o libglpk_la-glpapi16.lo `test -f '../optional/glpk/glpapi16.c' || echo '$(srcdir)/'`../optional/glpk/glpapi16.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi16.Tpo $(DEPDIR)/libglpk_la-glpapi16.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi16.c' object='libglpk_la-glpapi16.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi16.lo `test -f '../optional/glpk/glpapi16.c' || echo '$(srcdir)/'`../optional/glpk/glpapi16.c
+
+libglpk_la-glpapi17.lo: ../optional/glpk/glpapi17.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi17.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi17.Tpo -c -o libglpk_la-glpapi17.lo `test -f '../optional/glpk/glpapi17.c' || echo '$(srcdir)/'`../optional/glpk/glpapi17.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi17.Tpo $(DEPDIR)/libglpk_la-glpapi17.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi17.c' object='libglpk_la-glpapi17.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi17.lo `test -f '../optional/glpk/glpapi17.c' || echo '$(srcdir)/'`../optional/glpk/glpapi17.c
+
+libglpk_la-glpapi18.lo: ../optional/glpk/glpapi18.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi18.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi18.Tpo -c -o libglpk_la-glpapi18.lo `test -f '../optional/glpk/glpapi18.c' || echo '$(srcdir)/'`../optional/glpk/glpapi18.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi18.Tpo $(DEPDIR)/libglpk_la-glpapi18.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi18.c' object='libglpk_la-glpapi18.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi18.lo `test -f '../optional/glpk/glpapi18.c' || echo '$(srcdir)/'`../optional/glpk/glpapi18.c
+
+libglpk_la-glpapi19.lo: ../optional/glpk/glpapi19.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpapi19.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpapi19.Tpo -c -o libglpk_la-glpapi19.lo `test -f '../optional/glpk/glpapi19.c' || echo '$(srcdir)/'`../optional/glpk/glpapi19.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpapi19.Tpo $(DEPDIR)/libglpk_la-glpapi19.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpapi19.c' object='libglpk_la-glpapi19.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpapi19.lo `test -f '../optional/glpk/glpapi19.c' || echo '$(srcdir)/'`../optional/glpk/glpapi19.c
+
+libglpk_la-glpavl.lo: ../optional/glpk/glpavl.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpavl.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpavl.Tpo -c -o libglpk_la-glpavl.lo `test -f '../optional/glpk/glpavl.c' || echo '$(srcdir)/'`../optional/glpk/glpavl.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpavl.Tpo $(DEPDIR)/libglpk_la-glpavl.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpavl.c' object='libglpk_la-glpavl.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpavl.lo `test -f '../optional/glpk/glpavl.c' || echo '$(srcdir)/'`../optional/glpk/glpavl.c
+
+libglpk_la-glpbfd.lo: ../optional/glpk/glpbfd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpbfd.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpbfd.Tpo -c -o libglpk_la-glpbfd.lo `test -f '../optional/glpk/glpbfd.c' || echo '$(srcdir)/'`../optional/glpk/glpbfd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpbfd.Tpo $(DEPDIR)/libglpk_la-glpbfd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpbfd.c' object='libglpk_la-glpbfd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpbfd.lo `test -f '../optional/glpk/glpbfd.c' || echo '$(srcdir)/'`../optional/glpk/glpbfd.c
+
+libglpk_la-glpbfx.lo: ../optional/glpk/glpbfx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpbfx.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpbfx.Tpo -c -o libglpk_la-glpbfx.lo `test -f '../optional/glpk/glpbfx.c' || echo '$(srcdir)/'`../optional/glpk/glpbfx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpbfx.Tpo $(DEPDIR)/libglpk_la-glpbfx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpbfx.c' object='libglpk_la-glpbfx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpbfx.lo `test -f '../optional/glpk/glpbfx.c' || echo '$(srcdir)/'`../optional/glpk/glpbfx.c
+
+libglpk_la-glpcpx.lo: ../optional/glpk/glpcpx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpcpx.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpcpx.Tpo -c -o libglpk_la-glpcpx.lo `test -f '../optional/glpk/glpcpx.c' || echo '$(srcdir)/'`../optional/glpk/glpcpx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpcpx.Tpo $(DEPDIR)/libglpk_la-glpcpx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpcpx.c' object='libglpk_la-glpcpx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpcpx.lo `test -f '../optional/glpk/glpcpx.c' || echo '$(srcdir)/'`../optional/glpk/glpcpx.c
+
+libglpk_la-glpdmp.lo: ../optional/glpk/glpdmp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpdmp.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpdmp.Tpo -c -o libglpk_la-glpdmp.lo `test -f '../optional/glpk/glpdmp.c' || echo '$(srcdir)/'`../optional/glpk/glpdmp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpdmp.Tpo $(DEPDIR)/libglpk_la-glpdmp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpdmp.c' object='libglpk_la-glpdmp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpdmp.lo `test -f '../optional/glpk/glpdmp.c' || echo '$(srcdir)/'`../optional/glpk/glpdmp.c
+
+libglpk_la-glpdmx.lo: ../optional/glpk/glpdmx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpdmx.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpdmx.Tpo -c -o libglpk_la-glpdmx.lo `test -f '../optional/glpk/glpdmx.c' || echo '$(srcdir)/'`../optional/glpk/glpdmx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpdmx.Tpo $(DEPDIR)/libglpk_la-glpdmx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpdmx.c' object='libglpk_la-glpdmx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpdmx.lo `test -f '../optional/glpk/glpdmx.c' || echo '$(srcdir)/'`../optional/glpk/glpdmx.c
+
+libglpk_la-glpenv01.lo: ../optional/glpk/glpenv01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv01.Tpo -c -o libglpk_la-glpenv01.lo `test -f '../optional/glpk/glpenv01.c' || echo '$(srcdir)/'`../optional/glpk/glpenv01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv01.Tpo $(DEPDIR)/libglpk_la-glpenv01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv01.c' object='libglpk_la-glpenv01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv01.lo `test -f '../optional/glpk/glpenv01.c' || echo '$(srcdir)/'`../optional/glpk/glpenv01.c
+
+libglpk_la-glpenv02.lo: ../optional/glpk/glpenv02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv02.Tpo -c -o libglpk_la-glpenv02.lo `test -f '../optional/glpk/glpenv02.c' || echo '$(srcdir)/'`../optional/glpk/glpenv02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv02.Tpo $(DEPDIR)/libglpk_la-glpenv02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv02.c' object='libglpk_la-glpenv02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv02.lo `test -f '../optional/glpk/glpenv02.c' || echo '$(srcdir)/'`../optional/glpk/glpenv02.c
+
+libglpk_la-glpenv03.lo: ../optional/glpk/glpenv03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv03.Tpo -c -o libglpk_la-glpenv03.lo `test -f '../optional/glpk/glpenv03.c' || echo '$(srcdir)/'`../optional/glpk/glpenv03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv03.Tpo $(DEPDIR)/libglpk_la-glpenv03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv03.c' object='libglpk_la-glpenv03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv03.lo `test -f '../optional/glpk/glpenv03.c' || echo '$(srcdir)/'`../optional/glpk/glpenv03.c
+
+libglpk_la-glpenv04.lo: ../optional/glpk/glpenv04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv04.Tpo -c -o libglpk_la-glpenv04.lo `test -f '../optional/glpk/glpenv04.c' || echo '$(srcdir)/'`../optional/glpk/glpenv04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv04.Tpo $(DEPDIR)/libglpk_la-glpenv04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv04.c' object='libglpk_la-glpenv04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv04.lo `test -f '../optional/glpk/glpenv04.c' || echo '$(srcdir)/'`../optional/glpk/glpenv04.c
+
+libglpk_la-glpenv05.lo: ../optional/glpk/glpenv05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv05.Tpo -c -o libglpk_la-glpenv05.lo `test -f '../optional/glpk/glpenv05.c' || echo '$(srcdir)/'`../optional/glpk/glpenv05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv05.Tpo $(DEPDIR)/libglpk_la-glpenv05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv05.c' object='libglpk_la-glpenv05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv05.lo `test -f '../optional/glpk/glpenv05.c' || echo '$(srcdir)/'`../optional/glpk/glpenv05.c
+
+libglpk_la-glpenv06.lo: ../optional/glpk/glpenv06.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv06.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv06.Tpo -c -o libglpk_la-glpenv06.lo `test -f '../optional/glpk/glpenv06.c' || echo '$(srcdir)/'`../optional/glpk/glpenv06.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv06.Tpo $(DEPDIR)/libglpk_la-glpenv06.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv06.c' object='libglpk_la-glpenv06.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv06.lo `test -f '../optional/glpk/glpenv06.c' || echo '$(srcdir)/'`../optional/glpk/glpenv06.c
+
+libglpk_la-glpenv07.lo: ../optional/glpk/glpenv07.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv07.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv07.Tpo -c -o libglpk_la-glpenv07.lo `test -f '../optional/glpk/glpenv07.c' || echo '$(srcdir)/'`../optional/glpk/glpenv07.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv07.Tpo $(DEPDIR)/libglpk_la-glpenv07.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv07.c' object='libglpk_la-glpenv07.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv07.lo `test -f '../optional/glpk/glpenv07.c' || echo '$(srcdir)/'`../optional/glpk/glpenv07.c
+
+libglpk_la-glpenv08.lo: ../optional/glpk/glpenv08.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpenv08.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpenv08.Tpo -c -o libglpk_la-glpenv08.lo `test -f '../optional/glpk/glpenv08.c' || echo '$(srcdir)/'`../optional/glpk/glpenv08.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpenv08.Tpo $(DEPDIR)/libglpk_la-glpenv08.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpenv08.c' object='libglpk_la-glpenv08.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpenv08.lo `test -f '../optional/glpk/glpenv08.c' || echo '$(srcdir)/'`../optional/glpk/glpenv08.c
+
+libglpk_la-glpfhv.lo: ../optional/glpk/glpfhv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpfhv.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpfhv.Tpo -c -o libglpk_la-glpfhv.lo `test -f '../optional/glpk/glpfhv.c' || echo '$(srcdir)/'`../optional/glpk/glpfhv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpfhv.Tpo $(DEPDIR)/libglpk_la-glpfhv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpfhv.c' object='libglpk_la-glpfhv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpfhv.lo `test -f '../optional/glpk/glpfhv.c' || echo '$(srcdir)/'`../optional/glpk/glpfhv.c
+
+libglpk_la-glpgmp.lo: ../optional/glpk/glpgmp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpgmp.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpgmp.Tpo -c -o libglpk_la-glpgmp.lo `test -f '../optional/glpk/glpgmp.c' || echo '$(srcdir)/'`../optional/glpk/glpgmp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpgmp.Tpo $(DEPDIR)/libglpk_la-glpgmp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpgmp.c' object='libglpk_la-glpgmp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpgmp.lo `test -f '../optional/glpk/glpgmp.c' || echo '$(srcdir)/'`../optional/glpk/glpgmp.c
+
+libglpk_la-glphbm.lo: ../optional/glpk/glphbm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glphbm.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glphbm.Tpo -c -o libglpk_la-glphbm.lo `test -f '../optional/glpk/glphbm.c' || echo '$(srcdir)/'`../optional/glpk/glphbm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glphbm.Tpo $(DEPDIR)/libglpk_la-glphbm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glphbm.c' object='libglpk_la-glphbm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glphbm.lo `test -f '../optional/glpk/glphbm.c' || echo '$(srcdir)/'`../optional/glpk/glphbm.c
+
+libglpk_la-glpini01.lo: ../optional/glpk/glpini01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpini01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpini01.Tpo -c -o libglpk_la-glpini01.lo `test -f '../optional/glpk/glpini01.c' || echo '$(srcdir)/'`../optional/glpk/glpini01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpini01.Tpo $(DEPDIR)/libglpk_la-glpini01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpini01.c' object='libglpk_la-glpini01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpini01.lo `test -f '../optional/glpk/glpini01.c' || echo '$(srcdir)/'`../optional/glpk/glpini01.c
+
+libglpk_la-glpini02.lo: ../optional/glpk/glpini02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpini02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpini02.Tpo -c -o libglpk_la-glpini02.lo `test -f '../optional/glpk/glpini02.c' || echo '$(srcdir)/'`../optional/glpk/glpini02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpini02.Tpo $(DEPDIR)/libglpk_la-glpini02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpini02.c' object='libglpk_la-glpini02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpini02.lo `test -f '../optional/glpk/glpini02.c' || echo '$(srcdir)/'`../optional/glpk/glpini02.c
+
+libglpk_la-glpios01.lo: ../optional/glpk/glpios01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios01.Tpo -c -o libglpk_la-glpios01.lo `test -f '../optional/glpk/glpios01.c' || echo '$(srcdir)/'`../optional/glpk/glpios01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios01.Tpo $(DEPDIR)/libglpk_la-glpios01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios01.c' object='libglpk_la-glpios01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios01.lo `test -f '../optional/glpk/glpios01.c' || echo '$(srcdir)/'`../optional/glpk/glpios01.c
+
+libglpk_la-glpios02.lo: ../optional/glpk/glpios02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios02.Tpo -c -o libglpk_la-glpios02.lo `test -f '../optional/glpk/glpios02.c' || echo '$(srcdir)/'`../optional/glpk/glpios02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios02.Tpo $(DEPDIR)/libglpk_la-glpios02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios02.c' object='libglpk_la-glpios02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios02.lo `test -f '../optional/glpk/glpios02.c' || echo '$(srcdir)/'`../optional/glpk/glpios02.c
+
+libglpk_la-glpios03.lo: ../optional/glpk/glpios03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios03.Tpo -c -o libglpk_la-glpios03.lo `test -f '../optional/glpk/glpios03.c' || echo '$(srcdir)/'`../optional/glpk/glpios03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios03.Tpo $(DEPDIR)/libglpk_la-glpios03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios03.c' object='libglpk_la-glpios03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios03.lo `test -f '../optional/glpk/glpios03.c' || echo '$(srcdir)/'`../optional/glpk/glpios03.c
+
+libglpk_la-glpios04.lo: ../optional/glpk/glpios04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios04.Tpo -c -o libglpk_la-glpios04.lo `test -f '../optional/glpk/glpios04.c' || echo '$(srcdir)/'`../optional/glpk/glpios04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios04.Tpo $(DEPDIR)/libglpk_la-glpios04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios04.c' object='libglpk_la-glpios04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios04.lo `test -f '../optional/glpk/glpios04.c' || echo '$(srcdir)/'`../optional/glpk/glpios04.c
+
+libglpk_la-glpios05.lo: ../optional/glpk/glpios05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios05.Tpo -c -o libglpk_la-glpios05.lo `test -f '../optional/glpk/glpios05.c' || echo '$(srcdir)/'`../optional/glpk/glpios05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios05.Tpo $(DEPDIR)/libglpk_la-glpios05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios05.c' object='libglpk_la-glpios05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios05.lo `test -f '../optional/glpk/glpios05.c' || echo '$(srcdir)/'`../optional/glpk/glpios05.c
+
+libglpk_la-glpios06.lo: ../optional/glpk/glpios06.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios06.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios06.Tpo -c -o libglpk_la-glpios06.lo `test -f '../optional/glpk/glpios06.c' || echo '$(srcdir)/'`../optional/glpk/glpios06.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios06.Tpo $(DEPDIR)/libglpk_la-glpios06.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios06.c' object='libglpk_la-glpios06.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios06.lo `test -f '../optional/glpk/glpios06.c' || echo '$(srcdir)/'`../optional/glpk/glpios06.c
+
+libglpk_la-glpios07.lo: ../optional/glpk/glpios07.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios07.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios07.Tpo -c -o libglpk_la-glpios07.lo `test -f '../optional/glpk/glpios07.c' || echo '$(srcdir)/'`../optional/glpk/glpios07.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios07.Tpo $(DEPDIR)/libglpk_la-glpios07.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios07.c' object='libglpk_la-glpios07.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios07.lo `test -f '../optional/glpk/glpios07.c' || echo '$(srcdir)/'`../optional/glpk/glpios07.c
+
+libglpk_la-glpios08.lo: ../optional/glpk/glpios08.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios08.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios08.Tpo -c -o libglpk_la-glpios08.lo `test -f '../optional/glpk/glpios08.c' || echo '$(srcdir)/'`../optional/glpk/glpios08.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios08.Tpo $(DEPDIR)/libglpk_la-glpios08.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios08.c' object='libglpk_la-glpios08.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios08.lo `test -f '../optional/glpk/glpios08.c' || echo '$(srcdir)/'`../optional/glpk/glpios08.c
+
+libglpk_la-glpios09.lo: ../optional/glpk/glpios09.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios09.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios09.Tpo -c -o libglpk_la-glpios09.lo `test -f '../optional/glpk/glpios09.c' || echo '$(srcdir)/'`../optional/glpk/glpios09.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios09.Tpo $(DEPDIR)/libglpk_la-glpios09.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios09.c' object='libglpk_la-glpios09.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios09.lo `test -f '../optional/glpk/glpios09.c' || echo '$(srcdir)/'`../optional/glpk/glpios09.c
+
+libglpk_la-glpios10.lo: ../optional/glpk/glpios10.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios10.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios10.Tpo -c -o libglpk_la-glpios10.lo `test -f '../optional/glpk/glpios10.c' || echo '$(srcdir)/'`../optional/glpk/glpios10.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios10.Tpo $(DEPDIR)/libglpk_la-glpios10.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios10.c' object='libglpk_la-glpios10.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios10.lo `test -f '../optional/glpk/glpios10.c' || echo '$(srcdir)/'`../optional/glpk/glpios10.c
+
+libglpk_la-glpios11.lo: ../optional/glpk/glpios11.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios11.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios11.Tpo -c -o libglpk_la-glpios11.lo `test -f '../optional/glpk/glpios11.c' || echo '$(srcdir)/'`../optional/glpk/glpios11.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios11.Tpo $(DEPDIR)/libglpk_la-glpios11.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios11.c' object='libglpk_la-glpios11.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios11.lo `test -f '../optional/glpk/glpios11.c' || echo '$(srcdir)/'`../optional/glpk/glpios11.c
+
+libglpk_la-glpios12.lo: ../optional/glpk/glpios12.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpios12.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpios12.Tpo -c -o libglpk_la-glpios12.lo `test -f '../optional/glpk/glpios12.c' || echo '$(srcdir)/'`../optional/glpk/glpios12.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpios12.Tpo $(DEPDIR)/libglpk_la-glpios12.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpios12.c' object='libglpk_la-glpios12.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpios12.lo `test -f '../optional/glpk/glpios12.c' || echo '$(srcdir)/'`../optional/glpk/glpios12.c
+
+libglpk_la-glpipm.lo: ../optional/glpk/glpipm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpipm.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpipm.Tpo -c -o libglpk_la-glpipm.lo `test -f '../optional/glpk/glpipm.c' || echo '$(srcdir)/'`../optional/glpk/glpipm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpipm.Tpo $(DEPDIR)/libglpk_la-glpipm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpipm.c' object='libglpk_la-glpipm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpipm.lo `test -f '../optional/glpk/glpipm.c' || echo '$(srcdir)/'`../optional/glpk/glpipm.c
+
+libglpk_la-glplib01.lo: ../optional/glpk/glplib01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplib01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplib01.Tpo -c -o libglpk_la-glplib01.lo `test -f '../optional/glpk/glplib01.c' || echo '$(srcdir)/'`../optional/glpk/glplib01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplib01.Tpo $(DEPDIR)/libglpk_la-glplib01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplib01.c' object='libglpk_la-glplib01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplib01.lo `test -f '../optional/glpk/glplib01.c' || echo '$(srcdir)/'`../optional/glpk/glplib01.c
+
+libglpk_la-glplib02.lo: ../optional/glpk/glplib02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplib02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplib02.Tpo -c -o libglpk_la-glplib02.lo `test -f '../optional/glpk/glplib02.c' || echo '$(srcdir)/'`../optional/glpk/glplib02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplib02.Tpo $(DEPDIR)/libglpk_la-glplib02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplib02.c' object='libglpk_la-glplib02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplib02.lo `test -f '../optional/glpk/glplib02.c' || echo '$(srcdir)/'`../optional/glpk/glplib02.c
+
+libglpk_la-glplib03.lo: ../optional/glpk/glplib03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplib03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplib03.Tpo -c -o libglpk_la-glplib03.lo `test -f '../optional/glpk/glplib03.c' || echo '$(srcdir)/'`../optional/glpk/glplib03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplib03.Tpo $(DEPDIR)/libglpk_la-glplib03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplib03.c' object='libglpk_la-glplib03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplib03.lo `test -f '../optional/glpk/glplib03.c' || echo '$(srcdir)/'`../optional/glpk/glplib03.c
+
+libglpk_la-glplpf.lo: ../optional/glpk/glplpf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplpf.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplpf.Tpo -c -o libglpk_la-glplpf.lo `test -f '../optional/glpk/glplpf.c' || echo '$(srcdir)/'`../optional/glpk/glplpf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplpf.Tpo $(DEPDIR)/libglpk_la-glplpf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplpf.c' object='libglpk_la-glplpf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplpf.lo `test -f '../optional/glpk/glplpf.c' || echo '$(srcdir)/'`../optional/glpk/glplpf.c
+
+libglpk_la-glplpx01.lo: ../optional/glpk/glplpx01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplpx01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplpx01.Tpo -c -o libglpk_la-glplpx01.lo `test -f '../optional/glpk/glplpx01.c' || echo '$(srcdir)/'`../optional/glpk/glplpx01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplpx01.Tpo $(DEPDIR)/libglpk_la-glplpx01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplpx01.c' object='libglpk_la-glplpx01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplpx01.lo `test -f '../optional/glpk/glplpx01.c' || echo '$(srcdir)/'`../optional/glpk/glplpx01.c
+
+libglpk_la-glplpx02.lo: ../optional/glpk/glplpx02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplpx02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplpx02.Tpo -c -o libglpk_la-glplpx02.lo `test -f '../optional/glpk/glplpx02.c' || echo '$(srcdir)/'`../optional/glpk/glplpx02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplpx02.Tpo $(DEPDIR)/libglpk_la-glplpx02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplpx02.c' object='libglpk_la-glplpx02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplpx02.lo `test -f '../optional/glpk/glplpx02.c' || echo '$(srcdir)/'`../optional/glpk/glplpx02.c
+
+libglpk_la-glplpx03.lo: ../optional/glpk/glplpx03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplpx03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplpx03.Tpo -c -o libglpk_la-glplpx03.lo `test -f '../optional/glpk/glplpx03.c' || echo '$(srcdir)/'`../optional/glpk/glplpx03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplpx03.Tpo $(DEPDIR)/libglpk_la-glplpx03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplpx03.c' object='libglpk_la-glplpx03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplpx03.lo `test -f '../optional/glpk/glplpx03.c' || echo '$(srcdir)/'`../optional/glpk/glplpx03.c
+
+libglpk_la-glpluf.lo: ../optional/glpk/glpluf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpluf.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpluf.Tpo -c -o libglpk_la-glpluf.lo `test -f '../optional/glpk/glpluf.c' || echo '$(srcdir)/'`../optional/glpk/glpluf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpluf.Tpo $(DEPDIR)/libglpk_la-glpluf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpluf.c' object='libglpk_la-glpluf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpluf.lo `test -f '../optional/glpk/glpluf.c' || echo '$(srcdir)/'`../optional/glpk/glpluf.c
+
+libglpk_la-glplux.lo: ../optional/glpk/glplux.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glplux.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glplux.Tpo -c -o libglpk_la-glplux.lo `test -f '../optional/glpk/glplux.c' || echo '$(srcdir)/'`../optional/glpk/glplux.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glplux.Tpo $(DEPDIR)/libglpk_la-glplux.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glplux.c' object='libglpk_la-glplux.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glplux.lo `test -f '../optional/glpk/glplux.c' || echo '$(srcdir)/'`../optional/glpk/glplux.c
+
+libglpk_la-glpmat.lo: ../optional/glpk/glpmat.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmat.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmat.Tpo -c -o libglpk_la-glpmat.lo `test -f '../optional/glpk/glpmat.c' || echo '$(srcdir)/'`../optional/glpk/glpmat.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmat.Tpo $(DEPDIR)/libglpk_la-glpmat.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmat.c' object='libglpk_la-glpmat.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmat.lo `test -f '../optional/glpk/glpmat.c' || echo '$(srcdir)/'`../optional/glpk/glpmat.c
+
+libglpk_la-glpmpl01.lo: ../optional/glpk/glpmpl01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl01.Tpo -c -o libglpk_la-glpmpl01.lo `test -f '../optional/glpk/glpmpl01.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl01.Tpo $(DEPDIR)/libglpk_la-glpmpl01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl01.c' object='libglpk_la-glpmpl01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl01.lo `test -f '../optional/glpk/glpmpl01.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl01.c
+
+libglpk_la-glpmpl02.lo: ../optional/glpk/glpmpl02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl02.Tpo -c -o libglpk_la-glpmpl02.lo `test -f '../optional/glpk/glpmpl02.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl02.Tpo $(DEPDIR)/libglpk_la-glpmpl02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl02.c' object='libglpk_la-glpmpl02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl02.lo `test -f '../optional/glpk/glpmpl02.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl02.c
+
+libglpk_la-glpmpl03.lo: ../optional/glpk/glpmpl03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl03.Tpo -c -o libglpk_la-glpmpl03.lo `test -f '../optional/glpk/glpmpl03.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl03.Tpo $(DEPDIR)/libglpk_la-glpmpl03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl03.c' object='libglpk_la-glpmpl03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl03.lo `test -f '../optional/glpk/glpmpl03.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl03.c
+
+libglpk_la-glpmpl04.lo: ../optional/glpk/glpmpl04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl04.Tpo -c -o libglpk_la-glpmpl04.lo `test -f '../optional/glpk/glpmpl04.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl04.Tpo $(DEPDIR)/libglpk_la-glpmpl04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl04.c' object='libglpk_la-glpmpl04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl04.lo `test -f '../optional/glpk/glpmpl04.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl04.c
+
+libglpk_la-glpmpl05.lo: ../optional/glpk/glpmpl05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl05.Tpo -c -o libglpk_la-glpmpl05.lo `test -f '../optional/glpk/glpmpl05.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl05.Tpo $(DEPDIR)/libglpk_la-glpmpl05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl05.c' object='libglpk_la-glpmpl05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl05.lo `test -f '../optional/glpk/glpmpl05.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl05.c
+
+libglpk_la-glpmpl06.lo: ../optional/glpk/glpmpl06.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmpl06.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmpl06.Tpo -c -o libglpk_la-glpmpl06.lo `test -f '../optional/glpk/glpmpl06.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl06.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmpl06.Tpo $(DEPDIR)/libglpk_la-glpmpl06.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmpl06.c' object='libglpk_la-glpmpl06.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmpl06.lo `test -f '../optional/glpk/glpmpl06.c' || echo '$(srcdir)/'`../optional/glpk/glpmpl06.c
+
+libglpk_la-glpmps.lo: ../optional/glpk/glpmps.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpmps.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpmps.Tpo -c -o libglpk_la-glpmps.lo `test -f '../optional/glpk/glpmps.c' || echo '$(srcdir)/'`../optional/glpk/glpmps.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpmps.Tpo $(DEPDIR)/libglpk_la-glpmps.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpmps.c' object='libglpk_la-glpmps.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpmps.lo `test -f '../optional/glpk/glpmps.c' || echo '$(srcdir)/'`../optional/glpk/glpmps.c
+
+libglpk_la-glpnet01.lo: ../optional/glpk/glpnet01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet01.Tpo -c -o libglpk_la-glpnet01.lo `test -f '../optional/glpk/glpnet01.c' || echo '$(srcdir)/'`../optional/glpk/glpnet01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet01.Tpo $(DEPDIR)/libglpk_la-glpnet01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet01.c' object='libglpk_la-glpnet01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet01.lo `test -f '../optional/glpk/glpnet01.c' || echo '$(srcdir)/'`../optional/glpk/glpnet01.c
+
+libglpk_la-glpnet02.lo: ../optional/glpk/glpnet02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet02.Tpo -c -o libglpk_la-glpnet02.lo `test -f '../optional/glpk/glpnet02.c' || echo '$(srcdir)/'`../optional/glpk/glpnet02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet02.Tpo $(DEPDIR)/libglpk_la-glpnet02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet02.c' object='libglpk_la-glpnet02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet02.lo `test -f '../optional/glpk/glpnet02.c' || echo '$(srcdir)/'`../optional/glpk/glpnet02.c
+
+libglpk_la-glpnet03.lo: ../optional/glpk/glpnet03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet03.Tpo -c -o libglpk_la-glpnet03.lo `test -f '../optional/glpk/glpnet03.c' || echo '$(srcdir)/'`../optional/glpk/glpnet03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet03.Tpo $(DEPDIR)/libglpk_la-glpnet03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet03.c' object='libglpk_la-glpnet03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet03.lo `test -f '../optional/glpk/glpnet03.c' || echo '$(srcdir)/'`../optional/glpk/glpnet03.c
+
+libglpk_la-glpnet04.lo: ../optional/glpk/glpnet04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet04.Tpo -c -o libglpk_la-glpnet04.lo `test -f '../optional/glpk/glpnet04.c' || echo '$(srcdir)/'`../optional/glpk/glpnet04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet04.Tpo $(DEPDIR)/libglpk_la-glpnet04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet04.c' object='libglpk_la-glpnet04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet04.lo `test -f '../optional/glpk/glpnet04.c' || echo '$(srcdir)/'`../optional/glpk/glpnet04.c
+
+libglpk_la-glpnet05.lo: ../optional/glpk/glpnet05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet05.Tpo -c -o libglpk_la-glpnet05.lo `test -f '../optional/glpk/glpnet05.c' || echo '$(srcdir)/'`../optional/glpk/glpnet05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet05.Tpo $(DEPDIR)/libglpk_la-glpnet05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet05.c' object='libglpk_la-glpnet05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet05.lo `test -f '../optional/glpk/glpnet05.c' || echo '$(srcdir)/'`../optional/glpk/glpnet05.c
+
+libglpk_la-glpnet06.lo: ../optional/glpk/glpnet06.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet06.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet06.Tpo -c -o libglpk_la-glpnet06.lo `test -f '../optional/glpk/glpnet06.c' || echo '$(srcdir)/'`../optional/glpk/glpnet06.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet06.Tpo $(DEPDIR)/libglpk_la-glpnet06.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet06.c' object='libglpk_la-glpnet06.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet06.lo `test -f '../optional/glpk/glpnet06.c' || echo '$(srcdir)/'`../optional/glpk/glpnet06.c
+
+libglpk_la-glpnet07.lo: ../optional/glpk/glpnet07.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet07.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet07.Tpo -c -o libglpk_la-glpnet07.lo `test -f '../optional/glpk/glpnet07.c' || echo '$(srcdir)/'`../optional/glpk/glpnet07.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet07.Tpo $(DEPDIR)/libglpk_la-glpnet07.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet07.c' object='libglpk_la-glpnet07.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet07.lo `test -f '../optional/glpk/glpnet07.c' || echo '$(srcdir)/'`../optional/glpk/glpnet07.c
+
+libglpk_la-glpnet08.lo: ../optional/glpk/glpnet08.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet08.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet08.Tpo -c -o libglpk_la-glpnet08.lo `test -f '../optional/glpk/glpnet08.c' || echo '$(srcdir)/'`../optional/glpk/glpnet08.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet08.Tpo $(DEPDIR)/libglpk_la-glpnet08.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet08.c' object='libglpk_la-glpnet08.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet08.lo `test -f '../optional/glpk/glpnet08.c' || echo '$(srcdir)/'`../optional/glpk/glpnet08.c
+
+libglpk_la-glpnet09.lo: ../optional/glpk/glpnet09.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnet09.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnet09.Tpo -c -o libglpk_la-glpnet09.lo `test -f '../optional/glpk/glpnet09.c' || echo '$(srcdir)/'`../optional/glpk/glpnet09.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnet09.Tpo $(DEPDIR)/libglpk_la-glpnet09.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnet09.c' object='libglpk_la-glpnet09.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnet09.lo `test -f '../optional/glpk/glpnet09.c' || echo '$(srcdir)/'`../optional/glpk/glpnet09.c
+
+libglpk_la-glpnpp01.lo: ../optional/glpk/glpnpp01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnpp01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnpp01.Tpo -c -o libglpk_la-glpnpp01.lo `test -f '../optional/glpk/glpnpp01.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnpp01.Tpo $(DEPDIR)/libglpk_la-glpnpp01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnpp01.c' object='libglpk_la-glpnpp01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnpp01.lo `test -f '../optional/glpk/glpnpp01.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp01.c
+
+libglpk_la-glpnpp02.lo: ../optional/glpk/glpnpp02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnpp02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnpp02.Tpo -c -o libglpk_la-glpnpp02.lo `test -f '../optional/glpk/glpnpp02.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnpp02.Tpo $(DEPDIR)/libglpk_la-glpnpp02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnpp02.c' object='libglpk_la-glpnpp02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnpp02.lo `test -f '../optional/glpk/glpnpp02.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp02.c
+
+libglpk_la-glpnpp03.lo: ../optional/glpk/glpnpp03.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnpp03.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnpp03.Tpo -c -o libglpk_la-glpnpp03.lo `test -f '../optional/glpk/glpnpp03.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp03.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnpp03.Tpo $(DEPDIR)/libglpk_la-glpnpp03.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnpp03.c' object='libglpk_la-glpnpp03.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnpp03.lo `test -f '../optional/glpk/glpnpp03.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp03.c
+
+libglpk_la-glpnpp04.lo: ../optional/glpk/glpnpp04.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnpp04.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnpp04.Tpo -c -o libglpk_la-glpnpp04.lo `test -f '../optional/glpk/glpnpp04.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp04.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnpp04.Tpo $(DEPDIR)/libglpk_la-glpnpp04.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnpp04.c' object='libglpk_la-glpnpp04.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnpp04.lo `test -f '../optional/glpk/glpnpp04.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp04.c
+
+libglpk_la-glpnpp05.lo: ../optional/glpk/glpnpp05.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpnpp05.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpnpp05.Tpo -c -o libglpk_la-glpnpp05.lo `test -f '../optional/glpk/glpnpp05.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp05.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpnpp05.Tpo $(DEPDIR)/libglpk_la-glpnpp05.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpnpp05.c' object='libglpk_la-glpnpp05.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpnpp05.lo `test -f '../optional/glpk/glpnpp05.c' || echo '$(srcdir)/'`../optional/glpk/glpnpp05.c
+
+libglpk_la-glpqmd.lo: ../optional/glpk/glpqmd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpqmd.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpqmd.Tpo -c -o libglpk_la-glpqmd.lo `test -f '../optional/glpk/glpqmd.c' || echo '$(srcdir)/'`../optional/glpk/glpqmd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpqmd.Tpo $(DEPDIR)/libglpk_la-glpqmd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpqmd.c' object='libglpk_la-glpqmd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpqmd.lo `test -f '../optional/glpk/glpqmd.c' || echo '$(srcdir)/'`../optional/glpk/glpqmd.c
+
+libglpk_la-glprgr.lo: ../optional/glpk/glprgr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glprgr.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glprgr.Tpo -c -o libglpk_la-glprgr.lo `test -f '../optional/glpk/glprgr.c' || echo '$(srcdir)/'`../optional/glpk/glprgr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glprgr.Tpo $(DEPDIR)/libglpk_la-glprgr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glprgr.c' object='libglpk_la-glprgr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glprgr.lo `test -f '../optional/glpk/glprgr.c' || echo '$(srcdir)/'`../optional/glpk/glprgr.c
+
+libglpk_la-glprng01.lo: ../optional/glpk/glprng01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glprng01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glprng01.Tpo -c -o libglpk_la-glprng01.lo `test -f '../optional/glpk/glprng01.c' || echo '$(srcdir)/'`../optional/glpk/glprng01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glprng01.Tpo $(DEPDIR)/libglpk_la-glprng01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glprng01.c' object='libglpk_la-glprng01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glprng01.lo `test -f '../optional/glpk/glprng01.c' || echo '$(srcdir)/'`../optional/glpk/glprng01.c
+
+libglpk_la-glprng02.lo: ../optional/glpk/glprng02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glprng02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glprng02.Tpo -c -o libglpk_la-glprng02.lo `test -f '../optional/glpk/glprng02.c' || echo '$(srcdir)/'`../optional/glpk/glprng02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glprng02.Tpo $(DEPDIR)/libglpk_la-glprng02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glprng02.c' object='libglpk_la-glprng02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glprng02.lo `test -f '../optional/glpk/glprng02.c' || echo '$(srcdir)/'`../optional/glpk/glprng02.c
+
+libglpk_la-glpscf.lo: ../optional/glpk/glpscf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpscf.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpscf.Tpo -c -o libglpk_la-glpscf.lo `test -f '../optional/glpk/glpscf.c' || echo '$(srcdir)/'`../optional/glpk/glpscf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpscf.Tpo $(DEPDIR)/libglpk_la-glpscf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpscf.c' object='libglpk_la-glpscf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpscf.lo `test -f '../optional/glpk/glpscf.c' || echo '$(srcdir)/'`../optional/glpk/glpscf.c
+
+libglpk_la-glpscl.lo: ../optional/glpk/glpscl.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpscl.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpscl.Tpo -c -o libglpk_la-glpscl.lo `test -f '../optional/glpk/glpscl.c' || echo '$(srcdir)/'`../optional/glpk/glpscl.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpscl.Tpo $(DEPDIR)/libglpk_la-glpscl.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpscl.c' object='libglpk_la-glpscl.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpscl.lo `test -f '../optional/glpk/glpscl.c' || echo '$(srcdir)/'`../optional/glpk/glpscl.c
+
+libglpk_la-glpsdf.lo: ../optional/glpk/glpsdf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpsdf.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpsdf.Tpo -c -o libglpk_la-glpsdf.lo `test -f '../optional/glpk/glpsdf.c' || echo '$(srcdir)/'`../optional/glpk/glpsdf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpsdf.Tpo $(DEPDIR)/libglpk_la-glpsdf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpsdf.c' object='libglpk_la-glpsdf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpsdf.lo `test -f '../optional/glpk/glpsdf.c' || echo '$(srcdir)/'`../optional/glpk/glpsdf.c
+
+libglpk_la-glpspm.lo: ../optional/glpk/glpspm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpspm.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpspm.Tpo -c -o libglpk_la-glpspm.lo `test -f '../optional/glpk/glpspm.c' || echo '$(srcdir)/'`../optional/glpk/glpspm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpspm.Tpo $(DEPDIR)/libglpk_la-glpspm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpspm.c' object='libglpk_la-glpspm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpspm.lo `test -f '../optional/glpk/glpspm.c' || echo '$(srcdir)/'`../optional/glpk/glpspm.c
+
+libglpk_la-glpspx01.lo: ../optional/glpk/glpspx01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpspx01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpspx01.Tpo -c -o libglpk_la-glpspx01.lo `test -f '../optional/glpk/glpspx01.c' || echo '$(srcdir)/'`../optional/glpk/glpspx01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpspx01.Tpo $(DEPDIR)/libglpk_la-glpspx01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpspx01.c' object='libglpk_la-glpspx01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpspx01.lo `test -f '../optional/glpk/glpspx01.c' || echo '$(srcdir)/'`../optional/glpk/glpspx01.c
+
+libglpk_la-glpspx02.lo: ../optional/glpk/glpspx02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpspx02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpspx02.Tpo -c -o libglpk_la-glpspx02.lo `test -f '../optional/glpk/glpspx02.c' || echo '$(srcdir)/'`../optional/glpk/glpspx02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpspx02.Tpo $(DEPDIR)/libglpk_la-glpspx02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpspx02.c' object='libglpk_la-glpspx02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpspx02.lo `test -f '../optional/glpk/glpspx02.c' || echo '$(srcdir)/'`../optional/glpk/glpspx02.c
+
+libglpk_la-glpsql.lo: ../optional/glpk/glpsql.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpsql.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpsql.Tpo -c -o libglpk_la-glpsql.lo `test -f '../optional/glpk/glpsql.c' || echo '$(srcdir)/'`../optional/glpk/glpsql.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpsql.Tpo $(DEPDIR)/libglpk_la-glpsql.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpsql.c' object='libglpk_la-glpsql.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpsql.lo `test -f '../optional/glpk/glpsql.c' || echo '$(srcdir)/'`../optional/glpk/glpsql.c
+
+libglpk_la-glpssx01.lo: ../optional/glpk/glpssx01.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpssx01.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpssx01.Tpo -c -o libglpk_la-glpssx01.lo `test -f '../optional/glpk/glpssx01.c' || echo '$(srcdir)/'`../optional/glpk/glpssx01.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpssx01.Tpo $(DEPDIR)/libglpk_la-glpssx01.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpssx01.c' object='libglpk_la-glpssx01.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpssx01.lo `test -f '../optional/glpk/glpssx01.c' || echo '$(srcdir)/'`../optional/glpk/glpssx01.c
+
+libglpk_la-glpssx02.lo: ../optional/glpk/glpssx02.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glpssx02.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glpssx02.Tpo -c -o libglpk_la-glpssx02.lo `test -f '../optional/glpk/glpssx02.c' || echo '$(srcdir)/'`../optional/glpk/glpssx02.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glpssx02.Tpo $(DEPDIR)/libglpk_la-glpssx02.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glpssx02.c' object='libglpk_la-glpssx02.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glpssx02.lo `test -f '../optional/glpk/glpssx02.c' || echo '$(srcdir)/'`../optional/glpk/glpssx02.c
+
+libglpk_la-glptsp.lo: ../optional/glpk/glptsp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-glptsp.lo -MD -MP -MF $(DEPDIR)/libglpk_la-glptsp.Tpo -c -o libglpk_la-glptsp.lo `test -f '../optional/glpk/glptsp.c' || echo '$(srcdir)/'`../optional/glpk/glptsp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-glptsp.Tpo $(DEPDIR)/libglpk_la-glptsp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/glptsp.c' object='libglpk_la-glptsp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-glptsp.lo `test -f '../optional/glpk/glptsp.c' || echo '$(srcdir)/'`../optional/glpk/glptsp.c
+
+libglpk_la-amd_1.lo: ../optional/glpk/amd/amd_1.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_1.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_1.Tpo -c -o libglpk_la-amd_1.lo `test -f '../optional/glpk/amd/amd_1.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_1.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_1.Tpo $(DEPDIR)/libglpk_la-amd_1.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_1.c' object='libglpk_la-amd_1.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_1.lo `test -f '../optional/glpk/amd/amd_1.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_1.c
+
+libglpk_la-amd_2.lo: ../optional/glpk/amd/amd_2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_2.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_2.Tpo -c -o libglpk_la-amd_2.lo `test -f '../optional/glpk/amd/amd_2.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_2.Tpo $(DEPDIR)/libglpk_la-amd_2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_2.c' object='libglpk_la-amd_2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_2.lo `test -f '../optional/glpk/amd/amd_2.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_2.c
+
+libglpk_la-amd_aat.lo: ../optional/glpk/amd/amd_aat.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_aat.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_aat.Tpo -c -o libglpk_la-amd_aat.lo `test -f '../optional/glpk/amd/amd_aat.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_aat.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_aat.Tpo $(DEPDIR)/libglpk_la-amd_aat.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_aat.c' object='libglpk_la-amd_aat.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_aat.lo `test -f '../optional/glpk/amd/amd_aat.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_aat.c
+
+libglpk_la-amd_control.lo: ../optional/glpk/amd/amd_control.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_control.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_control.Tpo -c -o libglpk_la-amd_control.lo `test -f '../optional/glpk/amd/amd_control.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_control.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_control.Tpo $(DEPDIR)/libglpk_la-amd_control.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_control.c' object='libglpk_la-amd_control.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_control.lo `test -f '../optional/glpk/amd/amd_control.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_control.c
+
+libglpk_la-amd_defaults.lo: ../optional/glpk/amd/amd_defaults.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_defaults.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_defaults.Tpo -c -o libglpk_la-amd_defaults.lo `test -f '../optional/glpk/amd/amd_defaults.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_defaults.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_defaults.Tpo $(DEPDIR)/libglpk_la-amd_defaults.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_defaults.c' object='libglpk_la-amd_defaults.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_defaults.lo `test -f '../optional/glpk/amd/amd_defaults.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_defaults.c
+
+libglpk_la-amd_dump.lo: ../optional/glpk/amd/amd_dump.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_dump.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_dump.Tpo -c -o libglpk_la-amd_dump.lo `test -f '../optional/glpk/amd/amd_dump.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_dump.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_dump.Tpo $(DEPDIR)/libglpk_la-amd_dump.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_dump.c' object='libglpk_la-amd_dump.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_dump.lo `test -f '../optional/glpk/amd/amd_dump.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_dump.c
+
+libglpk_la-amd_info.lo: ../optional/glpk/amd/amd_info.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_info.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_info.Tpo -c -o libglpk_la-amd_info.lo `test -f '../optional/glpk/amd/amd_info.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_info.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_info.Tpo $(DEPDIR)/libglpk_la-amd_info.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_info.c' object='libglpk_la-amd_info.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_info.lo `test -f '../optional/glpk/amd/amd_info.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_info.c
+
+libglpk_la-amd_order.lo: ../optional/glpk/amd/amd_order.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_order.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_order.Tpo -c -o libglpk_la-amd_order.lo `test -f '../optional/glpk/amd/amd_order.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_order.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_order.Tpo $(DEPDIR)/libglpk_la-amd_order.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_order.c' object='libglpk_la-amd_order.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_order.lo `test -f '../optional/glpk/amd/amd_order.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_order.c
+
+libglpk_la-amd_post_tree.lo: ../optional/glpk/amd/amd_post_tree.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_post_tree.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_post_tree.Tpo -c -o libglpk_la-amd_post_tree.lo `test -f '../optional/glpk/amd/amd_post_tree.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_post_tree.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_post_tree.Tpo $(DEPDIR)/libglpk_la-amd_post_tree.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_post_tree.c' object='libglpk_la-amd_post_tree.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_post_tree.lo `test -f '../optional/glpk/amd/amd_post_tree.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_post_tree.c
+
+libglpk_la-amd_postorder.lo: ../optional/glpk/amd/amd_postorder.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_postorder.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_postorder.Tpo -c -o libglpk_la-amd_postorder.lo `test -f '../optional/glpk/amd/amd_postorder.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_postorder.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_postorder.Tpo $(DEPDIR)/libglpk_la-amd_postorder.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_postorder.c' object='libglpk_la-amd_postorder.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_postorder.lo `test -f '../optional/glpk/amd/amd_postorder.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_postorder.c
+
+libglpk_la-amd_preprocess.lo: ../optional/glpk/amd/amd_preprocess.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_preprocess.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_preprocess.Tpo -c -o libglpk_la-amd_preprocess.lo `test -f '../optional/glpk/amd/amd_preprocess.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_preprocess.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_preprocess.Tpo $(DEPDIR)/libglpk_la-amd_preprocess.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_preprocess.c' object='libglpk_la-amd_preprocess.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_preprocess.lo `test -f '../optional/glpk/amd/amd_preprocess.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_preprocess.c
+
+libglpk_la-amd_valid.lo: ../optional/glpk/amd/amd_valid.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-amd_valid.lo -MD -MP -MF $(DEPDIR)/libglpk_la-amd_valid.Tpo -c -o libglpk_la-amd_valid.lo `test -f '../optional/glpk/amd/amd_valid.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_valid.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-amd_valid.Tpo $(DEPDIR)/libglpk_la-amd_valid.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/amd/amd_valid.c' object='libglpk_la-amd_valid.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-amd_valid.lo `test -f '../optional/glpk/amd/amd_valid.c' || echo '$(srcdir)/'`../optional/glpk/amd/amd_valid.c
+
+libglpk_la-colamd.lo: ../optional/glpk/colamd/colamd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -MT libglpk_la-colamd.lo -MD -MP -MF $(DEPDIR)/libglpk_la-colamd.Tpo -c -o libglpk_la-colamd.lo `test -f '../optional/glpk/colamd/colamd.c' || echo '$(srcdir)/'`../optional/glpk/colamd/colamd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libglpk_la-colamd.Tpo $(DEPDIR)/libglpk_la-colamd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='../optional/glpk/colamd/colamd.c' object='libglpk_la-colamd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libglpk_la_CPPFLAGS) $(CPPFLAGS) $(libglpk_la_CFLAGS) $(CFLAGS) -c -o libglpk_la-colamd.lo `test -f '../optional/glpk/colamd/colamd.c' || echo '$(srcdir)/'`../optional/glpk/colamd/colamd.c
+
+libigraph_la-basic_query.lo: basic_query.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-basic_query.lo -MD -MP -MF $(DEPDIR)/libigraph_la-basic_query.Tpo -c -o libigraph_la-basic_query.lo `test -f 'basic_query.c' || echo '$(srcdir)/'`basic_query.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-basic_query.Tpo $(DEPDIR)/libigraph_la-basic_query.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='basic_query.c' object='libigraph_la-basic_query.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-basic_query.lo `test -f 'basic_query.c' || echo '$(srcdir)/'`basic_query.c
+
+libigraph_la-games.lo: games.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-games.lo -MD -MP -MF $(DEPDIR)/libigraph_la-games.Tpo -c -o libigraph_la-games.lo `test -f 'games.c' || echo '$(srcdir)/'`games.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-games.Tpo $(DEPDIR)/libigraph_la-games.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='games.c' object='libigraph_la-games.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-games.lo `test -f 'games.c' || echo '$(srcdir)/'`games.c
+
+libigraph_la-cocitation.lo: cocitation.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cocitation.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cocitation.Tpo -c -o libigraph_la-cocitation.lo `test -f 'cocitation.c' || echo '$(srcdir)/'`cocitation.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cocitation.Tpo $(DEPDIR)/libigraph_la-cocitation.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cocitation.c' object='libigraph_la-cocitation.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cocitation.lo `test -f 'cocitation.c' || echo '$(srcdir)/'`cocitation.c
+
+libigraph_la-iterators.lo: iterators.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-iterators.lo -MD -MP -MF $(DEPDIR)/libigraph_la-iterators.Tpo -c -o libigraph_la-iterators.lo `test -f 'iterators.c' || echo '$(srcdir)/'`iterators.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-iterators.Tpo $(DEPDIR)/libigraph_la-iterators.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='iterators.c' object='libigraph_la-iterators.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-iterators.lo `test -f 'iterators.c' || echo '$(srcdir)/'`iterators.c
+
+libigraph_la-structural_properties.lo: structural_properties.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-structural_properties.lo -MD -MP -MF $(DEPDIR)/libigraph_la-structural_properties.Tpo -c -o libigraph_la-structural_properties.lo `test -f 'structural_properties.c' || echo '$(srcdir)/'`structural_properties.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-structural_properties.Tpo $(DEPDIR)/libigraph_la-structural_properties.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='structural_properties.c' object='libigraph_la-structural_properties.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-structural_properties.lo `test -f 'structural_properties.c' || echo '$(srcdir)/'`structural_properties.c
+
+libigraph_la-components.lo: components.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-components.lo -MD -MP -MF $(DEPDIR)/libigraph_la-components.Tpo -c -o libigraph_la-components.lo `test -f 'components.c' || echo '$(srcdir)/'`components.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-components.Tpo $(DEPDIR)/libigraph_la-components.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='components.c' object='libigraph_la-components.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-components.lo `test -f 'components.c' || echo '$(srcdir)/'`components.c
+
+libigraph_la-layout.lo: layout.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-layout.lo -MD -MP -MF $(DEPDIR)/libigraph_la-layout.Tpo -c -o libigraph_la-layout.lo `test -f 'layout.c' || echo '$(srcdir)/'`layout.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-layout.Tpo $(DEPDIR)/libigraph_la-layout.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='layout.c' object='libigraph_la-layout.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-layout.lo `test -f 'layout.c' || echo '$(srcdir)/'`layout.c
+
+libigraph_la-structure_generators.lo: structure_generators.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-structure_generators.lo -MD -MP -MF $(DEPDIR)/libigraph_la-structure_generators.Tpo -c -o libigraph_la-structure_generators.lo `test -f 'structure_generators.c' || echo '$(srcdir)/'`structure_generators.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-structure_generators.Tpo $(DEPDIR)/libigraph_la-structure_generators.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='structure_generators.c' object='libigraph_la-structure_generators.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-structure_generators.lo `test -f 'structure_generators.c' || echo '$(srcdir)/'`structure_generators.c
+
+libigraph_la-conversion.lo: conversion.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-conversion.lo -MD -MP -MF $(DEPDIR)/libigraph_la-conversion.Tpo -c -o libigraph_la-conversion.lo `test -f 'conversion.c' || echo '$(srcdir)/'`conversion.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-conversion.Tpo $(DEPDIR)/libigraph_la-conversion.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='conversion.c' object='libigraph_la-conversion.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-conversion.lo `test -f 'conversion.c' || echo '$(srcdir)/'`conversion.c
+
+libigraph_la-type_indexededgelist.lo: type_indexededgelist.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-type_indexededgelist.lo -MD -MP -MF $(DEPDIR)/libigraph_la-type_indexededgelist.Tpo -c -o libigraph_la-type_indexededgelist.lo `test -f 'type_indexededgelist.c' || echo '$(srcdir)/'`type_indexededgelist.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-type_indexededgelist.Tpo $(DEPDIR)/libigraph_la-type_indexededgelist.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='type_indexededgelist.c' object='libigraph_la-type_indexededgelist.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-type_indexededgelist.lo `test -f 'type_indexededgelist.c' || echo '$(srcdir)/'`type_indexededgelist.c
+
+libigraph_la-spanning_trees.lo: spanning_trees.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-spanning_trees.lo -MD -MP -MF $(DEPDIR)/libigraph_la-spanning_trees.Tpo -c -o libigraph_la-spanning_trees.lo `test -f 'spanning_trees.c' || echo '$(srcdir)/'`spanning_trees.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-spanning_trees.Tpo $(DEPDIR)/libigraph_la-spanning_trees.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='spanning_trees.c' object='libigraph_la-spanning_trees.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-spanning_trees.lo `test -f 'spanning_trees.c' || echo '$(srcdir)/'`spanning_trees.c
+
+libigraph_la-igraph_error.lo: igraph_error.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_error.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_error.Tpo -c -o libigraph_la-igraph_error.lo `test -f 'igraph_error.c' || echo '$(srcdir)/'`igraph_error.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_error.Tpo $(DEPDIR)/libigraph_la-igraph_error.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_error.c' object='libigraph_la-igraph_error.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_error.lo `test -f 'igraph_error.c' || echo '$(srcdir)/'`igraph_error.c
+
+libigraph_la-interrupt.lo: interrupt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-interrupt.lo -MD -MP -MF $(DEPDIR)/libigraph_la-interrupt.Tpo -c -o libigraph_la-interrupt.lo `test -f 'interrupt.c' || echo '$(srcdir)/'`interrupt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-interrupt.Tpo $(DEPDIR)/libigraph_la-interrupt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='interrupt.c' object='libigraph_la-interrupt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-interrupt.lo `test -f 'interrupt.c' || echo '$(srcdir)/'`interrupt.c
+
+libigraph_la-other.lo: other.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-other.lo -MD -MP -MF $(DEPDIR)/libigraph_la-other.Tpo -c -o libigraph_la-other.lo `test -f 'other.c' || echo '$(srcdir)/'`other.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-other.Tpo $(DEPDIR)/libigraph_la-other.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='other.c' object='libigraph_la-other.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-other.lo `test -f 'other.c' || echo '$(srcdir)/'`other.c
+
+libigraph_la-foreign.lo: foreign.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign.Tpo -c -o libigraph_la-foreign.lo `test -f 'foreign.c' || echo '$(srcdir)/'`foreign.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign.Tpo $(DEPDIR)/libigraph_la-foreign.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign.c' object='libigraph_la-foreign.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign.lo `test -f 'foreign.c' || echo '$(srcdir)/'`foreign.c
+
+libigraph_la-random.lo: random.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-random.lo -MD -MP -MF $(DEPDIR)/libigraph_la-random.Tpo -c -o libigraph_la-random.lo `test -f 'random.c' || echo '$(srcdir)/'`random.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-random.Tpo $(DEPDIR)/libigraph_la-random.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='random.c' object='libigraph_la-random.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-random.lo `test -f 'random.c' || echo '$(srcdir)/'`random.c
+
+libigraph_la-attributes.lo: attributes.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-attributes.lo -MD -MP -MF $(DEPDIR)/libigraph_la-attributes.Tpo -c -o libigraph_la-attributes.lo `test -f 'attributes.c' || echo '$(srcdir)/'`attributes.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-attributes.Tpo $(DEPDIR)/libigraph_la-attributes.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='attributes.c' object='libigraph_la-attributes.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-attributes.lo `test -f 'attributes.c' || echo '$(srcdir)/'`attributes.c
+
+libigraph_la-foreign-ncol-parser.lo: foreign-ncol-parser.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-ncol-parser.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-ncol-parser.Tpo -c -o libigraph_la-foreign-ncol-parser.lo `test -f 'foreign-ncol-parser.c' || echo '$(srcdir)/'`foreign-ncol-parser.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-ncol-parser.Tpo $(DEPDIR)/libigraph_la-foreign-ncol-parser.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-ncol-parser.c' object='libigraph_la-foreign-ncol-parser.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-ncol-parser.lo `test -f 'foreign-ncol-parser.c' || echo '$(srcdir)/'`foreign-ncol-parser.c
+
+libigraph_la-foreign-ncol-lexer.lo: foreign-ncol-lexer.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-ncol-lexer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-ncol-lexer.Tpo -c -o libigraph_la-foreign-ncol-lexer.lo `test -f 'foreign-ncol-lexer.c' || echo '$(srcdir)/'`foreign-ncol-lexer.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-ncol-lexer.Tpo $(DEPDIR)/libigraph_la-foreign-ncol-lexer.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-ncol-lexer.c' object='libigraph_la-foreign-ncol-lexer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-ncol-lexer.lo `test -f 'foreign-ncol-lexer.c' || echo '$(srcdir)/'`foreign-ncol-lexer.c
+
+libigraph_la-foreign-lgl-parser.lo: foreign-lgl-parser.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-lgl-parser.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-lgl-parser.Tpo -c -o libigraph_la-foreign-lgl-parser.lo `test -f 'foreign-lgl-parser.c' || echo '$(srcdir)/'`foreign-lgl-parser.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-lgl-parser.Tpo $(DEPDIR)/libigraph_la-foreign-lgl-parser.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-lgl-parser.c' object='libigraph_la-foreign-lgl-parser.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-lgl-parser.lo `test -f 'foreign-lgl-parser.c' || echo '$(srcdir)/'`foreign-lgl-parser.c
+
+libigraph_la-foreign-lgl-lexer.lo: foreign-lgl-lexer.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-lgl-lexer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-lgl-lexer.Tpo -c -o libigraph_la-foreign-lgl-lexer.lo `test -f 'foreign-lgl-lexer.c' || echo '$(srcdir)/'`foreign-lgl-lexer.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-lgl-lexer.Tpo $(DEPDIR)/libigraph_la-foreign-lgl-lexer.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-lgl-lexer.c' object='libigraph_la-foreign-lgl-lexer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-lgl-lexer.lo `test -f 'foreign-lgl-lexer.c' || echo '$(srcdir)/'`foreign-lgl-lexer.c
+
+libigraph_la-foreign-pajek-parser.lo: foreign-pajek-parser.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-pajek-parser.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-pajek-parser.Tpo -c -o libigraph_la-foreign-pajek-parser.lo `test -f 'foreign-pajek-parser.c' || echo '$(srcdir)/'`foreign-pajek-parser.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-pajek-parser.Tpo $(DEPDIR)/libigraph_la-foreign-pajek-parser.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-pajek-parser.c' object='libigraph_la-foreign-pajek-parser.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-pajek-parser.lo `test -f 'foreign-pajek-parser.c' || echo '$(srcdir)/'`foreign-pajek-parser.c
+
+libigraph_la-foreign-pajek-lexer.lo: foreign-pajek-lexer.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-pajek-lexer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-pajek-lexer.Tpo -c -o libigraph_la-foreign-pajek-lexer.lo `test -f 'foreign-pajek-lexer.c' || echo '$(srcdir)/'`foreign-pajek-lexer.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-pajek-lexer.Tpo $(DEPDIR)/libigraph_la-foreign-pajek-lexer.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-pajek-lexer.c' object='libigraph_la-foreign-pajek-lexer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-pajek-lexer.lo `test -f 'foreign-pajek-lexer.c' || echo '$(srcdir)/'`foreign-pajek-lexer.c
+
+libigraph_la-foreign-gml-parser.lo: foreign-gml-parser.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-gml-parser.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-gml-parser.Tpo -c -o libigraph_la-foreign-gml-parser.lo `test -f 'foreign-gml-parser.c' || echo '$(srcdir)/'`foreign-gml-parser.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-gml-parser.Tpo $(DEPDIR)/libigraph_la-foreign-gml-parser.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-gml-parser.c' object='libigraph_la-foreign-gml-parser.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-gml-parser.lo `test -f 'foreign-gml-parser.c' || echo '$(srcdir)/'`foreign-gml-parser.c
+
+libigraph_la-foreign-gml-lexer.lo: foreign-gml-lexer.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-gml-lexer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-gml-lexer.Tpo -c -o libigraph_la-foreign-gml-lexer.lo `test -f 'foreign-gml-lexer.c' || echo '$(srcdir)/'`foreign-gml-lexer.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-gml-lexer.Tpo $(DEPDIR)/libigraph_la-foreign-gml-lexer.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-gml-lexer.c' object='libigraph_la-foreign-gml-lexer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-gml-lexer.lo `test -f 'foreign-gml-lexer.c' || echo '$(srcdir)/'`foreign-gml-lexer.c
+
+libigraph_la-dqueue.lo: dqueue.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-dqueue.lo -MD -MP -MF $(DEPDIR)/libigraph_la-dqueue.Tpo -c -o libigraph_la-dqueue.lo `test -f 'dqueue.c' || echo '$(srcdir)/'`dqueue.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-dqueue.Tpo $(DEPDIR)/libigraph_la-dqueue.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='dqueue.c' object='libigraph_la-dqueue.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-dqueue.lo `test -f 'dqueue.c' || echo '$(srcdir)/'`dqueue.c
+
+libigraph_la-heap.lo: heap.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-heap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-heap.Tpo -c -o libigraph_la-heap.lo `test -f 'heap.c' || echo '$(srcdir)/'`heap.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-heap.Tpo $(DEPDIR)/libigraph_la-heap.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='heap.c' object='libigraph_la-heap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-heap.lo `test -f 'heap.c' || echo '$(srcdir)/'`heap.c
+
+libigraph_la-igraph_heap.lo: igraph_heap.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_heap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_heap.Tpo -c -o libigraph_la-igraph_heap.lo `test -f 'igraph_heap.c' || echo '$(srcdir)/'`igraph_heap.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_heap.Tpo $(DEPDIR)/libigraph_la-igraph_heap.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_heap.c' object='libigraph_la-igraph_heap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_heap.lo `test -f 'igraph_heap.c' || echo '$(srcdir)/'`igraph_heap.c
+
+libigraph_la-igraph_stack.lo: igraph_stack.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_stack.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_stack.Tpo -c -o libigraph_la-igraph_stack.lo `test -f 'igraph_stack.c' || echo '$(srcdir)/'`igraph_stack.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_stack.Tpo $(DEPDIR)/libigraph_la-igraph_stack.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_stack.c' object='libigraph_la-igraph_stack.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_stack.lo `test -f 'igraph_stack.c' || echo '$(srcdir)/'`igraph_stack.c
+
+libigraph_la-igraph_strvector.lo: igraph_strvector.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_strvector.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_strvector.Tpo -c -o libigraph_la-igraph_strvector.lo `test -f 'igraph_strvector.c' || echo '$(srcdir)/'`igraph_strvector.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_strvector.Tpo $(DEPDIR)/libigraph_la-igraph_strvector.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_strvector.c' object='libigraph_la-igraph_strvector.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_strvector.lo `test -f 'igraph_strvector.c' || echo '$(srcdir)/'`igraph_strvector.c
+
+libigraph_la-igraph_trie.lo: igraph_trie.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_trie.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_trie.Tpo -c -o libigraph_la-igraph_trie.lo `test -f 'igraph_trie.c' || echo '$(srcdir)/'`igraph_trie.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_trie.Tpo $(DEPDIR)/libigraph_la-igraph_trie.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_trie.c' object='libigraph_la-igraph_trie.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_trie.lo `test -f 'igraph_trie.c' || echo '$(srcdir)/'`igraph_trie.c
+
+libigraph_la-matrix.lo: matrix.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-matrix.lo -MD -MP -MF $(DEPDIR)/libigraph_la-matrix.Tpo -c -o libigraph_la-matrix.lo `test -f 'matrix.c' || echo '$(srcdir)/'`matrix.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-matrix.Tpo $(DEPDIR)/libigraph_la-matrix.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='matrix.c' object='libigraph_la-matrix.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-matrix.lo `test -f 'matrix.c' || echo '$(srcdir)/'`matrix.c
+
+libigraph_la-vector.lo: vector.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-vector.lo -MD -MP -MF $(DEPDIR)/libigraph_la-vector.Tpo -c -o libigraph_la-vector.lo `test -f 'vector.c' || echo '$(srcdir)/'`vector.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-vector.Tpo $(DEPDIR)/libigraph_la-vector.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='vector.c' object='libigraph_la-vector.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-vector.lo `test -f 'vector.c' || echo '$(srcdir)/'`vector.c
+
+libigraph_la-vector_ptr.lo: vector_ptr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-vector_ptr.lo -MD -MP -MF $(DEPDIR)/libigraph_la-vector_ptr.Tpo -c -o libigraph_la-vector_ptr.lo `test -f 'vector_ptr.c' || echo '$(srcdir)/'`vector_ptr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-vector_ptr.Tpo $(DEPDIR)/libigraph_la-vector_ptr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='vector_ptr.c' object='libigraph_la-vector_ptr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-vector_ptr.lo `test -f 'vector_ptr.c' || echo '$(srcdir)/'`vector_ptr.c
+
+libigraph_la-memory.lo: memory.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-memory.lo -MD -MP -MF $(DEPDIR)/libigraph_la-memory.Tpo -c -o libigraph_la-memory.lo `test -f 'memory.c' || echo '$(srcdir)/'`memory.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-memory.Tpo $(DEPDIR)/libigraph_la-memory.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='memory.c' object='libigraph_la-memory.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-memory.lo `test -f 'memory.c' || echo '$(srcdir)/'`memory.c
+
+libigraph_la-adjlist.lo: adjlist.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-adjlist.lo -MD -MP -MF $(DEPDIR)/libigraph_la-adjlist.Tpo -c -o libigraph_la-adjlist.lo `test -f 'adjlist.c' || echo '$(srcdir)/'`adjlist.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-adjlist.Tpo $(DEPDIR)/libigraph_la-adjlist.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='adjlist.c' object='libigraph_la-adjlist.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-adjlist.lo `test -f 'adjlist.c' || echo '$(srcdir)/'`adjlist.c
+
+libigraph_la-visitors.lo: visitors.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-visitors.lo -MD -MP -MF $(DEPDIR)/libigraph_la-visitors.Tpo -c -o libigraph_la-visitors.lo `test -f 'visitors.c' || echo '$(srcdir)/'`visitors.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-visitors.Tpo $(DEPDIR)/libigraph_la-visitors.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='visitors.c' object='libigraph_la-visitors.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-visitors.lo `test -f 'visitors.c' || echo '$(srcdir)/'`visitors.c
+
+libigraph_la-igraph_grid.lo: igraph_grid.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_grid.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_grid.Tpo -c -o libigraph_la-igraph_grid.lo `test -f 'igraph_grid.c' || echo '$(srcdir)/'`igraph_grid.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_grid.Tpo $(DEPDIR)/libigraph_la-igraph_grid.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_grid.c' object='libigraph_la-igraph_grid.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_grid.lo `test -f 'igraph_grid.c' || echo '$(srcdir)/'`igraph_grid.c
+
+libigraph_la-atlas.lo: atlas.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-atlas.lo -MD -MP -MF $(DEPDIR)/libigraph_la-atlas.Tpo -c -o libigraph_la-atlas.lo `test -f 'atlas.c' || echo '$(srcdir)/'`atlas.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-atlas.Tpo $(DEPDIR)/libigraph_la-atlas.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='atlas.c' object='libigraph_la-atlas.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-atlas.lo `test -f 'atlas.c' || echo '$(srcdir)/'`atlas.c
+
+libigraph_la-topology.lo: topology.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-topology.lo -MD -MP -MF $(DEPDIR)/libigraph_la-topology.Tpo -c -o libigraph_la-topology.lo `test -f 'topology.c' || echo '$(srcdir)/'`topology.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-topology.Tpo $(DEPDIR)/libigraph_la-topology.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='topology.c' object='libigraph_la-topology.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-topology.lo `test -f 'topology.c' || echo '$(srcdir)/'`topology.c
+
+libigraph_la-motifs.lo: motifs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-motifs.lo -MD -MP -MF $(DEPDIR)/libigraph_la-motifs.Tpo -c -o libigraph_la-motifs.lo `test -f 'motifs.c' || echo '$(srcdir)/'`motifs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-motifs.Tpo $(DEPDIR)/libigraph_la-motifs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='motifs.c' object='libigraph_la-motifs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-motifs.lo `test -f 'motifs.c' || echo '$(srcdir)/'`motifs.c
+
+libigraph_la-progress.lo: progress.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-progress.lo -MD -MP -MF $(DEPDIR)/libigraph_la-progress.Tpo -c -o libigraph_la-progress.lo `test -f 'progress.c' || echo '$(srcdir)/'`progress.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-progress.Tpo $(DEPDIR)/libigraph_la-progress.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='progress.c' object='libigraph_la-progress.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-progress.lo `test -f 'progress.c' || echo '$(srcdir)/'`progress.c
+
+libigraph_la-operators.lo: operators.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-operators.lo -MD -MP -MF $(DEPDIR)/libigraph_la-operators.Tpo -c -o libigraph_la-operators.lo `test -f 'operators.c' || echo '$(srcdir)/'`operators.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-operators.Tpo $(DEPDIR)/libigraph_la-operators.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='operators.c' object='libigraph_la-operators.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-operators.lo `test -f 'operators.c' || echo '$(srcdir)/'`operators.c
+
+libigraph_la-igraph_psumtree.lo: igraph_psumtree.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_psumtree.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_psumtree.Tpo -c -o libigraph_la-igraph_psumtree.lo `test -f 'igraph_psumtree.c' || echo '$(srcdir)/'`igraph_psumtree.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_psumtree.Tpo $(DEPDIR)/libigraph_la-igraph_psumtree.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_psumtree.c' object='libigraph_la-igraph_psumtree.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_psumtree.lo `test -f 'igraph_psumtree.c' || echo '$(srcdir)/'`igraph_psumtree.c
+
+libigraph_la-array.lo: array.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-array.lo -MD -MP -MF $(DEPDIR)/libigraph_la-array.Tpo -c -o libigraph_la-array.lo `test -f 'array.c' || echo '$(srcdir)/'`array.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-array.Tpo $(DEPDIR)/libigraph_la-array.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='array.c' object='libigraph_la-array.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-array.lo `test -f 'array.c' || echo '$(srcdir)/'`array.c
+
+libigraph_la-igraph_hashtable.lo: igraph_hashtable.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_hashtable.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_hashtable.Tpo -c -o libigraph_la-igraph_hashtable.lo `test -f 'igraph_hashtable.c' || echo '$(srcdir)/'`igraph_hashtable.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_hashtable.Tpo $(DEPDIR)/libigraph_la-igraph_hashtable.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_hashtable.c' object='libigraph_la-igraph_hashtable.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_hashtable.lo `test -f 'igraph_hashtable.c' || echo '$(srcdir)/'`igraph_hashtable.c
+
+libigraph_la-foreign-graphml.lo: foreign-graphml.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-graphml.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-graphml.Tpo -c -o libigraph_la-foreign-graphml.lo `test -f 'foreign-graphml.c' || echo '$(srcdir)/'`foreign-graphml.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-graphml.Tpo $(DEPDIR)/libigraph_la-foreign-graphml.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-graphml.c' object='libigraph_la-foreign-graphml.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-graphml.lo `test -f 'foreign-graphml.c' || echo '$(srcdir)/'`foreign-graphml.c
+
+libigraph_la-flow.lo: flow.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-flow.lo -MD -MP -MF $(DEPDIR)/libigraph_la-flow.Tpo -c -o libigraph_la-flow.lo `test -f 'flow.c' || echo '$(srcdir)/'`flow.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-flow.Tpo $(DEPDIR)/libigraph_la-flow.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='flow.c' object='libigraph_la-flow.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-flow.lo `test -f 'flow.c' || echo '$(srcdir)/'`flow.c
+
+libigraph_la-igraph_buckets.lo: igraph_buckets.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_buckets.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_buckets.Tpo -c -o libigraph_la-igraph_buckets.lo `test -f 'igraph_buckets.c' || echo '$(srcdir)/'`igraph_buckets.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_buckets.Tpo $(DEPDIR)/libigraph_la-igraph_buckets.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_buckets.c' object='libigraph_la-igraph_buckets.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_buckets.lo `test -f 'igraph_buckets.c' || echo '$(srcdir)/'`igraph_buckets.c
+
+libigraph_la-spectral_properties.lo: spectral_properties.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-spectral_properties.lo -MD -MP -MF $(DEPDIR)/libigraph_la-spectral_properties.Tpo -c -o libigraph_la-spectral_properties.lo `test -f 'spectral_properties.c' || echo '$(srcdir)/'`spectral_properties.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-spectral_properties.Tpo $(DEPDIR)/libigraph_la-spectral_properties.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='spectral_properties.c' object='libigraph_la-spectral_properties.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-spectral_properties.lo `test -f 'spectral_properties.c' || echo '$(srcdir)/'`spectral_properties.c
+
+libigraph_la-cores.lo: cores.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cores.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cores.Tpo -c -o libigraph_la-cores.lo `test -f 'cores.c' || echo '$(srcdir)/'`cores.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cores.Tpo $(DEPDIR)/libigraph_la-cores.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cores.c' object='libigraph_la-cores.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cores.lo `test -f 'cores.c' || echo '$(srcdir)/'`cores.c
+
+libigraph_la-igraph_set.lo: igraph_set.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_set.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_set.Tpo -c -o libigraph_la-igraph_set.lo `test -f 'igraph_set.c' || echo '$(srcdir)/'`igraph_set.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_set.Tpo $(DEPDIR)/libigraph_la-igraph_set.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_set.c' object='libigraph_la-igraph_set.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_set.lo `test -f 'igraph_set.c' || echo '$(srcdir)/'`igraph_set.c
+
+libigraph_la-cliques.lo: cliques.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cliques.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cliques.Tpo -c -o libigraph_la-cliques.lo `test -f 'cliques.c' || echo '$(srcdir)/'`cliques.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cliques.Tpo $(DEPDIR)/libigraph_la-cliques.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cliques.c' object='libigraph_la-cliques.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cliques.lo `test -f 'cliques.c' || echo '$(srcdir)/'`cliques.c
+
+libigraph_la-revolver_cit.lo: revolver_cit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-revolver_cit.lo -MD -MP -MF $(DEPDIR)/libigraph_la-revolver_cit.Tpo -c -o libigraph_la-revolver_cit.lo `test -f 'revolver_cit.c' || echo '$(srcdir)/'`revolver_cit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-revolver_cit.Tpo $(DEPDIR)/libigraph_la-revolver_cit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='revolver_cit.c' object='libigraph_la-revolver_cit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-revolver_cit.lo `test -f 'revolver_cit.c' || echo '$(srcdir)/'`revolver_cit.c
+
+libigraph_la-revolver_grow.lo: revolver_grow.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-revolver_grow.lo -MD -MP -MF $(DEPDIR)/libigraph_la-revolver_grow.Tpo -c -o libigraph_la-revolver_grow.lo `test -f 'revolver_grow.c' || echo '$(srcdir)/'`revolver_grow.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-revolver_grow.Tpo $(DEPDIR)/libigraph_la-revolver_grow.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='revolver_grow.c' object='libigraph_la-revolver_grow.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-revolver_grow.lo `test -f 'revolver_grow.c' || echo '$(srcdir)/'`revolver_grow.c
+
+libigraph_la-spmatrix.lo: spmatrix.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-spmatrix.lo -MD -MP -MF $(DEPDIR)/libigraph_la-spmatrix.Tpo -c -o libigraph_la-spmatrix.lo `test -f 'spmatrix.c' || echo '$(srcdir)/'`spmatrix.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-spmatrix.Tpo $(DEPDIR)/libigraph_la-spmatrix.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='spmatrix.c' object='libigraph_la-spmatrix.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-spmatrix.lo `test -f 'spmatrix.c' || echo '$(srcdir)/'`spmatrix.c
+
+libigraph_la-community.lo: community.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-community.lo -MD -MP -MF $(DEPDIR)/libigraph_la-community.Tpo -c -o libigraph_la-community.lo `test -f 'community.c' || echo '$(srcdir)/'`community.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-community.Tpo $(DEPDIR)/libigraph_la-community.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='community.c' object='libigraph_la-community.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-community.lo `test -f 'community.c' || echo '$(srcdir)/'`community.c
+
+libigraph_la-fast_community.lo: fast_community.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-fast_community.lo -MD -MP -MF $(DEPDIR)/libigraph_la-fast_community.Tpo -c -o libigraph_la-fast_community.lo `test -f 'fast_community.c' || echo '$(srcdir)/'`fast_community.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-fast_community.Tpo $(DEPDIR)/libigraph_la-fast_community.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='fast_community.c' object='libigraph_la-fast_community.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-fast_community.lo `test -f 'fast_community.c' || echo '$(srcdir)/'`fast_community.c
+
+libigraph_la-evolver_cit.lo: evolver_cit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-evolver_cit.lo -MD -MP -MF $(DEPDIR)/libigraph_la-evolver_cit.Tpo -c -o libigraph_la-evolver_cit.lo `test -f 'evolver_cit.c' || echo '$(srcdir)/'`evolver_cit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-evolver_cit.Tpo $(DEPDIR)/libigraph_la-evolver_cit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='evolver_cit.c' object='libigraph_la-evolver_cit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-evolver_cit.lo `test -f 'evolver_cit.c' || echo '$(srcdir)/'`evolver_cit.c
+
+libigraph_la-gml_tree.lo: gml_tree.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-gml_tree.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gml_tree.Tpo -c -o libigraph_la-gml_tree.lo `test -f 'gml_tree.c' || echo '$(srcdir)/'`gml_tree.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gml_tree.Tpo $(DEPDIR)/libigraph_la-gml_tree.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='gml_tree.c' object='libigraph_la-gml_tree.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-gml_tree.lo `test -f 'gml_tree.c' || echo '$(srcdir)/'`gml_tree.c
+
+libigraph_la-cattributes.lo: cattributes.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cattributes.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cattributes.Tpo -c -o libigraph_la-cattributes.lo `test -f 'cattributes.c' || echo '$(srcdir)/'`cattributes.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cattributes.Tpo $(DEPDIR)/libigraph_la-cattributes.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cattributes.c' object='libigraph_la-cattributes.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cattributes.lo `test -f 'cattributes.c' || echo '$(srcdir)/'`cattributes.c
+
+libigraph_la-revolver_ml_cit.lo: revolver_ml_cit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-revolver_ml_cit.lo -MD -MP -MF $(DEPDIR)/libigraph_la-revolver_ml_cit.Tpo -c -o libigraph_la-revolver_ml_cit.lo `test -f 'revolver_ml_cit.c' || echo '$(srcdir)/'`revolver_ml_cit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-revolver_ml_cit.Tpo $(DEPDIR)/libigraph_la-revolver_ml_cit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='revolver_ml_cit.c' object='libigraph_la-revolver_ml_cit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-revolver_ml_cit.lo `test -f 'revolver_ml_cit.c' || echo '$(srcdir)/'`revolver_ml_cit.c
+
+libigraph_la-zeroin.lo: zeroin.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-zeroin.lo -MD -MP -MF $(DEPDIR)/libigraph_la-zeroin.Tpo -c -o libigraph_la-zeroin.lo `test -f 'zeroin.c' || echo '$(srcdir)/'`zeroin.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-zeroin.Tpo $(DEPDIR)/libigraph_la-zeroin.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='zeroin.c' object='libigraph_la-zeroin.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-zeroin.lo `test -f 'zeroin.c' || echo '$(srcdir)/'`zeroin.c
+
+libigraph_la-bfgs.lo: bfgs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-bfgs.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bfgs.Tpo -c -o libigraph_la-bfgs.lo `test -f 'bfgs.c' || echo '$(srcdir)/'`bfgs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bfgs.Tpo $(DEPDIR)/libigraph_la-bfgs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='bfgs.c' object='libigraph_la-bfgs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-bfgs.lo `test -f 'bfgs.c' || echo '$(srcdir)/'`bfgs.c
+
+libigraph_la-math.lo: math.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-math.lo -MD -MP -MF $(DEPDIR)/libigraph_la-math.Tpo -c -o libigraph_la-math.lo `test -f 'math.c' || echo '$(srcdir)/'`math.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-math.Tpo $(DEPDIR)/libigraph_la-math.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='math.c' object='libigraph_la-math.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-math.lo `test -f 'math.c' || echo '$(srcdir)/'`math.c
+
+libigraph_la-forestfire.lo: forestfire.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-forestfire.lo -MD -MP -MF $(DEPDIR)/libigraph_la-forestfire.Tpo -c -o libigraph_la-forestfire.lo `test -f 'forestfire.c' || echo '$(srcdir)/'`forestfire.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-forestfire.Tpo $(DEPDIR)/libigraph_la-forestfire.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='forestfire.c' object='libigraph_la-forestfire.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-forestfire.lo `test -f 'forestfire.c' || echo '$(srcdir)/'`forestfire.c
+
+libigraph_la-microscopic_update.lo: microscopic_update.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-microscopic_update.lo -MD -MP -MF $(DEPDIR)/libigraph_la-microscopic_update.Tpo -c -o libigraph_la-microscopic_update.lo `test -f 'microscopic_update.c' || echo '$(srcdir)/'`microscopic_update.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-microscopic_update.Tpo $(DEPDIR)/libigraph_la-microscopic_update.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='microscopic_update.c' object='libigraph_la-microscopic_update.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-microscopic_update.lo `test -f 'microscopic_update.c' || echo '$(srcdir)/'`microscopic_update.c
+
+libigraph_la-blas.lo: blas.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-blas.lo -MD -MP -MF $(DEPDIR)/libigraph_la-blas.Tpo -c -o libigraph_la-blas.lo `test -f 'blas.c' || echo '$(srcdir)/'`blas.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-blas.Tpo $(DEPDIR)/libigraph_la-blas.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='blas.c' object='libigraph_la-blas.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-blas.lo `test -f 'blas.c' || echo '$(srcdir)/'`blas.c
+
+libigraph_la-arpack.lo: arpack.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-arpack.lo -MD -MP -MF $(DEPDIR)/libigraph_la-arpack.Tpo -c -o libigraph_la-arpack.lo `test -f 'arpack.c' || echo '$(srcdir)/'`arpack.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-arpack.Tpo $(DEPDIR)/libigraph_la-arpack.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='arpack.c' object='libigraph_la-arpack.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-arpack.lo `test -f 'arpack.c' || echo '$(srcdir)/'`arpack.c
+
+libigraph_la-centrality.lo: centrality.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-centrality.lo -MD -MP -MF $(DEPDIR)/libigraph_la-centrality.Tpo -c -o libigraph_la-centrality.lo `test -f 'centrality.c' || echo '$(srcdir)/'`centrality.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-centrality.Tpo $(DEPDIR)/libigraph_la-centrality.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='centrality.c' object='libigraph_la-centrality.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-centrality.lo `test -f 'centrality.c' || echo '$(srcdir)/'`centrality.c
+
+libigraph_la-decomposition.lo: decomposition.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-decomposition.lo -MD -MP -MF $(DEPDIR)/libigraph_la-decomposition.Tpo -c -o libigraph_la-decomposition.lo `test -f 'decomposition.c' || echo '$(srcdir)/'`decomposition.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-decomposition.Tpo $(DEPDIR)/libigraph_la-decomposition.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='decomposition.c' object='libigraph_la-decomposition.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-decomposition.lo `test -f 'decomposition.c' || echo '$(srcdir)/'`decomposition.c
+
+libigraph_la-bipartite.lo: bipartite.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-bipartite.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bipartite.Tpo -c -o libigraph_la-bipartite.lo `test -f 'bipartite.c' || echo '$(srcdir)/'`bipartite.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bipartite.Tpo $(DEPDIR)/libigraph_la-bipartite.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='bipartite.c' object='libigraph_la-bipartite.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-bipartite.lo `test -f 'bipartite.c' || echo '$(srcdir)/'`bipartite.c
+
+libigraph_la-foreign-dl-parser.lo: foreign-dl-parser.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-dl-parser.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-dl-parser.Tpo -c -o libigraph_la-foreign-dl-parser.lo `test -f 'foreign-dl-parser.c' || echo '$(srcdir)/'`foreign-dl-parser.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-dl-parser.Tpo $(DEPDIR)/libigraph_la-foreign-dl-parser.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-dl-parser.c' object='libigraph_la-foreign-dl-parser.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-dl-parser.lo `test -f 'foreign-dl-parser.c' || echo '$(srcdir)/'`foreign-dl-parser.c
+
+libigraph_la-foreign-dl-lexer.lo: foreign-dl-lexer.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-foreign-dl-lexer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-foreign-dl-lexer.Tpo -c -o libigraph_la-foreign-dl-lexer.lo `test -f 'foreign-dl-lexer.c' || echo '$(srcdir)/'`foreign-dl-lexer.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-foreign-dl-lexer.Tpo $(DEPDIR)/libigraph_la-foreign-dl-lexer.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='foreign-dl-lexer.c' object='libigraph_la-foreign-dl-lexer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-foreign-dl-lexer.lo `test -f 'foreign-dl-lexer.c' || echo '$(srcdir)/'`foreign-dl-lexer.c
+
+libigraph_la-cs_add.lo: cs/cs_add.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_add.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_add.Tpo -c -o libigraph_la-cs_add.lo `test -f 'cs/cs_add.c' || echo '$(srcdir)/'`cs/cs_add.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_add.Tpo $(DEPDIR)/libigraph_la-cs_add.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_add.c' object='libigraph_la-cs_add.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_add.lo `test -f 'cs/cs_add.c' || echo '$(srcdir)/'`cs/cs_add.c
+
+libigraph_la-cs_happly.lo: cs/cs_happly.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_happly.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_happly.Tpo -c -o libigraph_la-cs_happly.lo `test -f 'cs/cs_happly.c' || echo '$(srcdir)/'`cs/cs_happly.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_happly.Tpo $(DEPDIR)/libigraph_la-cs_happly.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_happly.c' object='libigraph_la-cs_happly.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_happly.lo `test -f 'cs/cs_happly.c' || echo '$(srcdir)/'`cs/cs_happly.c
+
+libigraph_la-cs_pvec.lo: cs/cs_pvec.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_pvec.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_pvec.Tpo -c -o libigraph_la-cs_pvec.lo `test -f 'cs/cs_pvec.c' || echo '$(srcdir)/'`cs/cs_pvec.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_pvec.Tpo $(DEPDIR)/libigraph_la-cs_pvec.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_pvec.c' object='libigraph_la-cs_pvec.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_pvec.lo `test -f 'cs/cs_pvec.c' || echo '$(srcdir)/'`cs/cs_pvec.c
+
+libigraph_la-cs_amd.lo: cs/cs_amd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_amd.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_amd.Tpo -c -o libigraph_la-cs_amd.lo `test -f 'cs/cs_amd.c' || echo '$(srcdir)/'`cs/cs_amd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_amd.Tpo $(DEPDIR)/libigraph_la-cs_amd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_amd.c' object='libigraph_la-cs_amd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_amd.lo `test -f 'cs/cs_amd.c' || echo '$(srcdir)/'`cs/cs_amd.c
+
+libigraph_la-cs_house.lo: cs/cs_house.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_house.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_house.Tpo -c -o libigraph_la-cs_house.lo `test -f 'cs/cs_house.c' || echo '$(srcdir)/'`cs/cs_house.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_house.Tpo $(DEPDIR)/libigraph_la-cs_house.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_house.c' object='libigraph_la-cs_house.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_house.lo `test -f 'cs/cs_house.c' || echo '$(srcdir)/'`cs/cs_house.c
+
+libigraph_la-cs_qr.lo: cs/cs_qr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_qr.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_qr.Tpo -c -o libigraph_la-cs_qr.lo `test -f 'cs/cs_qr.c' || echo '$(srcdir)/'`cs/cs_qr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_qr.Tpo $(DEPDIR)/libigraph_la-cs_qr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_qr.c' object='libigraph_la-cs_qr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_qr.lo `test -f 'cs/cs_qr.c' || echo '$(srcdir)/'`cs/cs_qr.c
+
+libigraph_la-cs_chol.lo: cs/cs_chol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_chol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_chol.Tpo -c -o libigraph_la-cs_chol.lo `test -f 'cs/cs_chol.c' || echo '$(srcdir)/'`cs/cs_chol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_chol.Tpo $(DEPDIR)/libigraph_la-cs_chol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_chol.c' object='libigraph_la-cs_chol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_chol.lo `test -f 'cs/cs_chol.c' || echo '$(srcdir)/'`cs/cs_chol.c
+
+libigraph_la-cs_ipvec.lo: cs/cs_ipvec.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_ipvec.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_ipvec.Tpo -c -o libigraph_la-cs_ipvec.lo `test -f 'cs/cs_ipvec.c' || echo '$(srcdir)/'`cs/cs_ipvec.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_ipvec.Tpo $(DEPDIR)/libigraph_la-cs_ipvec.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_ipvec.c' object='libigraph_la-cs_ipvec.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_ipvec.lo `test -f 'cs/cs_ipvec.c' || echo '$(srcdir)/'`cs/cs_ipvec.c
+
+libigraph_la-cs_qrsol.lo: cs/cs_qrsol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_qrsol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_qrsol.Tpo -c -o libigraph_la-cs_qrsol.lo `test -f 'cs/cs_qrsol.c' || echo '$(srcdir)/'`cs/cs_qrsol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_qrsol.Tpo $(DEPDIR)/libigraph_la-cs_qrsol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_qrsol.c' object='libigraph_la-cs_qrsol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_qrsol.lo `test -f 'cs/cs_qrsol.c' || echo '$(srcdir)/'`cs/cs_qrsol.c
+
+libigraph_la-cs_cholsol.lo: cs/cs_cholsol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_cholsol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_cholsol.Tpo -c -o libigraph_la-cs_cholsol.lo `test -f 'cs/cs_cholsol.c' || echo '$(srcdir)/'`cs/cs_cholsol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_cholsol.Tpo $(DEPDIR)/libigraph_la-cs_cholsol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_cholsol.c' object='libigraph_la-cs_cholsol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_cholsol.lo `test -f 'cs/cs_cholsol.c' || echo '$(srcdir)/'`cs/cs_cholsol.c
+
+libigraph_la-cs_leaf.lo: cs/cs_leaf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_leaf.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_leaf.Tpo -c -o libigraph_la-cs_leaf.lo `test -f 'cs/cs_leaf.c' || echo '$(srcdir)/'`cs/cs_leaf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_leaf.Tpo $(DEPDIR)/libigraph_la-cs_leaf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_leaf.c' object='libigraph_la-cs_leaf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_leaf.lo `test -f 'cs/cs_leaf.c' || echo '$(srcdir)/'`cs/cs_leaf.c
+
+libigraph_la-cs_randperm.lo: cs/cs_randperm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_randperm.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_randperm.Tpo -c -o libigraph_la-cs_randperm.lo `test -f 'cs/cs_randperm.c' || echo '$(srcdir)/'`cs/cs_randperm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_randperm.Tpo $(DEPDIR)/libigraph_la-cs_randperm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_randperm.c' object='libigraph_la-cs_randperm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_randperm.lo `test -f 'cs/cs_randperm.c' || echo '$(srcdir)/'`cs/cs_randperm.c
+
+libigraph_la-cs_compress.lo: cs/cs_compress.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_compress.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_compress.Tpo -c -o libigraph_la-cs_compress.lo `test -f 'cs/cs_compress.c' || echo '$(srcdir)/'`cs/cs_compress.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_compress.Tpo $(DEPDIR)/libigraph_la-cs_compress.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_compress.c' object='libigraph_la-cs_compress.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_compress.lo `test -f 'cs/cs_compress.c' || echo '$(srcdir)/'`cs/cs_compress.c
+
+libigraph_la-cs_load.lo: cs/cs_load.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_load.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_load.Tpo -c -o libigraph_la-cs_load.lo `test -f 'cs/cs_load.c' || echo '$(srcdir)/'`cs/cs_load.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_load.Tpo $(DEPDIR)/libigraph_la-cs_load.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_load.c' object='libigraph_la-cs_load.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_load.lo `test -f 'cs/cs_load.c' || echo '$(srcdir)/'`cs/cs_load.c
+
+libigraph_la-cs_reach.lo: cs/cs_reach.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_reach.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_reach.Tpo -c -o libigraph_la-cs_reach.lo `test -f 'cs/cs_reach.c' || echo '$(srcdir)/'`cs/cs_reach.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_reach.Tpo $(DEPDIR)/libigraph_la-cs_reach.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_reach.c' object='libigraph_la-cs_reach.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_reach.lo `test -f 'cs/cs_reach.c' || echo '$(srcdir)/'`cs/cs_reach.c
+
+libigraph_la-cs_counts.lo: cs/cs_counts.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_counts.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_counts.Tpo -c -o libigraph_la-cs_counts.lo `test -f 'cs/cs_counts.c' || echo '$(srcdir)/'`cs/cs_counts.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_counts.Tpo $(DEPDIR)/libigraph_la-cs_counts.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_counts.c' object='libigraph_la-cs_counts.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_counts.lo `test -f 'cs/cs_counts.c' || echo '$(srcdir)/'`cs/cs_counts.c
+
+libigraph_la-cs_lsolve.lo: cs/cs_lsolve.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_lsolve.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_lsolve.Tpo -c -o libigraph_la-cs_lsolve.lo `test -f 'cs/cs_lsolve.c' || echo '$(srcdir)/'`cs/cs_lsolve.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_lsolve.Tpo $(DEPDIR)/libigraph_la-cs_lsolve.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_lsolve.c' object='libigraph_la-cs_lsolve.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_lsolve.lo `test -f 'cs/cs_lsolve.c' || echo '$(srcdir)/'`cs/cs_lsolve.c
+
+libigraph_la-cs_scatter.lo: cs/cs_scatter.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_scatter.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_scatter.Tpo -c -o libigraph_la-cs_scatter.lo `test -f 'cs/cs_scatter.c' || echo '$(srcdir)/'`cs/cs_scatter.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_scatter.Tpo $(DEPDIR)/libigraph_la-cs_scatter.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_scatter.c' object='libigraph_la-cs_scatter.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_scatter.lo `test -f 'cs/cs_scatter.c' || echo '$(srcdir)/'`cs/cs_scatter.c
+
+libigraph_la-cs_cumsum.lo: cs/cs_cumsum.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_cumsum.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_cumsum.Tpo -c -o libigraph_la-cs_cumsum.lo `test -f 'cs/cs_cumsum.c' || echo '$(srcdir)/'`cs/cs_cumsum.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_cumsum.Tpo $(DEPDIR)/libigraph_la-cs_cumsum.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_cumsum.c' object='libigraph_la-cs_cumsum.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_cumsum.lo `test -f 'cs/cs_cumsum.c' || echo '$(srcdir)/'`cs/cs_cumsum.c
+
+libigraph_la-cs_ltsolve.lo: cs/cs_ltsolve.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_ltsolve.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_ltsolve.Tpo -c -o libigraph_la-cs_ltsolve.lo `test -f 'cs/cs_ltsolve.c' || echo '$(srcdir)/'`cs/cs_ltsolve.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_ltsolve.Tpo $(DEPDIR)/libigraph_la-cs_ltsolve.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_ltsolve.c' object='libigraph_la-cs_ltsolve.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_ltsolve.lo `test -f 'cs/cs_ltsolve.c' || echo '$(srcdir)/'`cs/cs_ltsolve.c
+
+libigraph_la-cs_scc.lo: cs/cs_scc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_scc.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_scc.Tpo -c -o libigraph_la-cs_scc.lo `test -f 'cs/cs_scc.c' || echo '$(srcdir)/'`cs/cs_scc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_scc.Tpo $(DEPDIR)/libigraph_la-cs_scc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_scc.c' object='libigraph_la-cs_scc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_scc.lo `test -f 'cs/cs_scc.c' || echo '$(srcdir)/'`cs/cs_scc.c
+
+libigraph_la-cs_dfs.lo: cs/cs_dfs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_dfs.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_dfs.Tpo -c -o libigraph_la-cs_dfs.lo `test -f 'cs/cs_dfs.c' || echo '$(srcdir)/'`cs/cs_dfs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_dfs.Tpo $(DEPDIR)/libigraph_la-cs_dfs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_dfs.c' object='libigraph_la-cs_dfs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_dfs.lo `test -f 'cs/cs_dfs.c' || echo '$(srcdir)/'`cs/cs_dfs.c
+
+libigraph_la-cs_lu.lo: cs/cs_lu.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_lu.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_lu.Tpo -c -o libigraph_la-cs_lu.lo `test -f 'cs/cs_lu.c' || echo '$(srcdir)/'`cs/cs_lu.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_lu.Tpo $(DEPDIR)/libigraph_la-cs_lu.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_lu.c' object='libigraph_la-cs_lu.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_lu.lo `test -f 'cs/cs_lu.c' || echo '$(srcdir)/'`cs/cs_lu.c
+
+libigraph_la-cs_schol.lo: cs/cs_schol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_schol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_schol.Tpo -c -o libigraph_la-cs_schol.lo `test -f 'cs/cs_schol.c' || echo '$(srcdir)/'`cs/cs_schol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_schol.Tpo $(DEPDIR)/libigraph_la-cs_schol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_schol.c' object='libigraph_la-cs_schol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_schol.lo `test -f 'cs/cs_schol.c' || echo '$(srcdir)/'`cs/cs_schol.c
+
+libigraph_la-cs_dmperm.lo: cs/cs_dmperm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_dmperm.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_dmperm.Tpo -c -o libigraph_la-cs_dmperm.lo `test -f 'cs/cs_dmperm.c' || echo '$(srcdir)/'`cs/cs_dmperm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_dmperm.Tpo $(DEPDIR)/libigraph_la-cs_dmperm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_dmperm.c' object='libigraph_la-cs_dmperm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_dmperm.lo `test -f 'cs/cs_dmperm.c' || echo '$(srcdir)/'`cs/cs_dmperm.c
+
+libigraph_la-cs_lusol.lo: cs/cs_lusol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_lusol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_lusol.Tpo -c -o libigraph_la-cs_lusol.lo `test -f 'cs/cs_lusol.c' || echo '$(srcdir)/'`cs/cs_lusol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_lusol.Tpo $(DEPDIR)/libigraph_la-cs_lusol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_lusol.c' object='libigraph_la-cs_lusol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_lusol.lo `test -f 'cs/cs_lusol.c' || echo '$(srcdir)/'`cs/cs_lusol.c
+
+libigraph_la-cs_spsolve.lo: cs/cs_spsolve.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_spsolve.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_spsolve.Tpo -c -o libigraph_la-cs_spsolve.lo `test -f 'cs/cs_spsolve.c' || echo '$(srcdir)/'`cs/cs_spsolve.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_spsolve.Tpo $(DEPDIR)/libigraph_la-cs_spsolve.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_spsolve.c' object='libigraph_la-cs_spsolve.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_spsolve.lo `test -f 'cs/cs_spsolve.c' || echo '$(srcdir)/'`cs/cs_spsolve.c
+
+libigraph_la-cs_droptol.lo: cs/cs_droptol.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_droptol.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_droptol.Tpo -c -o libigraph_la-cs_droptol.lo `test -f 'cs/cs_droptol.c' || echo '$(srcdir)/'`cs/cs_droptol.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_droptol.Tpo $(DEPDIR)/libigraph_la-cs_droptol.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_droptol.c' object='libigraph_la-cs_droptol.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_droptol.lo `test -f 'cs/cs_droptol.c' || echo '$(srcdir)/'`cs/cs_droptol.c
+
+libigraph_la-cs_malloc.lo: cs/cs_malloc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_malloc.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_malloc.Tpo -c -o libigraph_la-cs_malloc.lo `test -f 'cs/cs_malloc.c' || echo '$(srcdir)/'`cs/cs_malloc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_malloc.Tpo $(DEPDIR)/libigraph_la-cs_malloc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_malloc.c' object='libigraph_la-cs_malloc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_malloc.lo `test -f 'cs/cs_malloc.c' || echo '$(srcdir)/'`cs/cs_malloc.c
+
+libigraph_la-cs_sqr.lo: cs/cs_sqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_sqr.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_sqr.Tpo -c -o libigraph_la-cs_sqr.lo `test -f 'cs/cs_sqr.c' || echo '$(srcdir)/'`cs/cs_sqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_sqr.Tpo $(DEPDIR)/libigraph_la-cs_sqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_sqr.c' object='libigraph_la-cs_sqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_sqr.lo `test -f 'cs/cs_sqr.c' || echo '$(srcdir)/'`cs/cs_sqr.c
+
+libigraph_la-cs_dropzeros.lo: cs/cs_dropzeros.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_dropzeros.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_dropzeros.Tpo -c -o libigraph_la-cs_dropzeros.lo `test -f 'cs/cs_dropzeros.c' || echo '$(srcdir)/'`cs/cs_dropzeros.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_dropzeros.Tpo $(DEPDIR)/libigraph_la-cs_dropzeros.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_dropzeros.c' object='libigraph_la-cs_dropzeros.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_dropzeros.lo `test -f 'cs/cs_dropzeros.c' || echo '$(srcdir)/'`cs/cs_dropzeros.c
+
+libigraph_la-cs_maxtrans.lo: cs/cs_maxtrans.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_maxtrans.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_maxtrans.Tpo -c -o libigraph_la-cs_maxtrans.lo `test -f 'cs/cs_maxtrans.c' || echo '$(srcdir)/'`cs/cs_maxtrans.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_maxtrans.Tpo $(DEPDIR)/libigraph_la-cs_maxtrans.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_maxtrans.c' object='libigraph_la-cs_maxtrans.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_maxtrans.lo `test -f 'cs/cs_maxtrans.c' || echo '$(srcdir)/'`cs/cs_maxtrans.c
+
+libigraph_la-cs_symperm.lo: cs/cs_symperm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_symperm.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_symperm.Tpo -c -o libigraph_la-cs_symperm.lo `test -f 'cs/cs_symperm.c' || echo '$(srcdir)/'`cs/cs_symperm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_symperm.Tpo $(DEPDIR)/libigraph_la-cs_symperm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_symperm.c' object='libigraph_la-cs_symperm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_symperm.lo `test -f 'cs/cs_symperm.c' || echo '$(srcdir)/'`cs/cs_symperm.c
+
+libigraph_la-cs_dupl.lo: cs/cs_dupl.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_dupl.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_dupl.Tpo -c -o libigraph_la-cs_dupl.lo `test -f 'cs/cs_dupl.c' || echo '$(srcdir)/'`cs/cs_dupl.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_dupl.Tpo $(DEPDIR)/libigraph_la-cs_dupl.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_dupl.c' object='libigraph_la-cs_dupl.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_dupl.lo `test -f 'cs/cs_dupl.c' || echo '$(srcdir)/'`cs/cs_dupl.c
+
+libigraph_la-cs_multiply.lo: cs/cs_multiply.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_multiply.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_multiply.Tpo -c -o libigraph_la-cs_multiply.lo `test -f 'cs/cs_multiply.c' || echo '$(srcdir)/'`cs/cs_multiply.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_multiply.Tpo $(DEPDIR)/libigraph_la-cs_multiply.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_multiply.c' object='libigraph_la-cs_multiply.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_multiply.lo `test -f 'cs/cs_multiply.c' || echo '$(srcdir)/'`cs/cs_multiply.c
+
+libigraph_la-cs_tdfs.lo: cs/cs_tdfs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_tdfs.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_tdfs.Tpo -c -o libigraph_la-cs_tdfs.lo `test -f 'cs/cs_tdfs.c' || echo '$(srcdir)/'`cs/cs_tdfs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_tdfs.Tpo $(DEPDIR)/libigraph_la-cs_tdfs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_tdfs.c' object='libigraph_la-cs_tdfs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_tdfs.lo `test -f 'cs/cs_tdfs.c' || echo '$(srcdir)/'`cs/cs_tdfs.c
+
+libigraph_la-cs_entry.lo: cs/cs_entry.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_entry.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_entry.Tpo -c -o libigraph_la-cs_entry.lo `test -f 'cs/cs_entry.c' || echo '$(srcdir)/'`cs/cs_entry.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_entry.Tpo $(DEPDIR)/libigraph_la-cs_entry.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_entry.c' object='libigraph_la-cs_entry.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_entry.lo `test -f 'cs/cs_entry.c' || echo '$(srcdir)/'`cs/cs_entry.c
+
+libigraph_la-cs_norm.lo: cs/cs_norm.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_norm.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_norm.Tpo -c -o libigraph_la-cs_norm.lo `test -f 'cs/cs_norm.c' || echo '$(srcdir)/'`cs/cs_norm.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_norm.Tpo $(DEPDIR)/libigraph_la-cs_norm.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_norm.c' object='libigraph_la-cs_norm.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_norm.lo `test -f 'cs/cs_norm.c' || echo '$(srcdir)/'`cs/cs_norm.c
+
+libigraph_la-cs_transpose.lo: cs/cs_transpose.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_transpose.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_transpose.Tpo -c -o libigraph_la-cs_transpose.lo `test -f 'cs/cs_transpose.c' || echo '$(srcdir)/'`cs/cs_transpose.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_transpose.Tpo $(DEPDIR)/libigraph_la-cs_transpose.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_transpose.c' object='libigraph_la-cs_transpose.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_transpose.lo `test -f 'cs/cs_transpose.c' || echo '$(srcdir)/'`cs/cs_transpose.c
+
+libigraph_la-cs_ereach.lo: cs/cs_ereach.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_ereach.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_ereach.Tpo -c -o libigraph_la-cs_ereach.lo `test -f 'cs/cs_ereach.c' || echo '$(srcdir)/'`cs/cs_ereach.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_ereach.Tpo $(DEPDIR)/libigraph_la-cs_ereach.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_ereach.c' object='libigraph_la-cs_ereach.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_ereach.lo `test -f 'cs/cs_ereach.c' || echo '$(srcdir)/'`cs/cs_ereach.c
+
+libigraph_la-cs_permute.lo: cs/cs_permute.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_permute.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_permute.Tpo -c -o libigraph_la-cs_permute.lo `test -f 'cs/cs_permute.c' || echo '$(srcdir)/'`cs/cs_permute.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_permute.Tpo $(DEPDIR)/libigraph_la-cs_permute.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_permute.c' object='libigraph_la-cs_permute.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_permute.lo `test -f 'cs/cs_permute.c' || echo '$(srcdir)/'`cs/cs_permute.c
+
+libigraph_la-cs_updown.lo: cs/cs_updown.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_updown.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_updown.Tpo -c -o libigraph_la-cs_updown.lo `test -f 'cs/cs_updown.c' || echo '$(srcdir)/'`cs/cs_updown.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_updown.Tpo $(DEPDIR)/libigraph_la-cs_updown.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_updown.c' object='libigraph_la-cs_updown.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_updown.lo `test -f 'cs/cs_updown.c' || echo '$(srcdir)/'`cs/cs_updown.c
+
+libigraph_la-cs_etree.lo: cs/cs_etree.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_etree.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_etree.Tpo -c -o libigraph_la-cs_etree.lo `test -f 'cs/cs_etree.c' || echo '$(srcdir)/'`cs/cs_etree.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_etree.Tpo $(DEPDIR)/libigraph_la-cs_etree.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_etree.c' object='libigraph_la-cs_etree.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_etree.lo `test -f 'cs/cs_etree.c' || echo '$(srcdir)/'`cs/cs_etree.c
+
+libigraph_la-cs_pinv.lo: cs/cs_pinv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_pinv.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_pinv.Tpo -c -o libigraph_la-cs_pinv.lo `test -f 'cs/cs_pinv.c' || echo '$(srcdir)/'`cs/cs_pinv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_pinv.Tpo $(DEPDIR)/libigraph_la-cs_pinv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_pinv.c' object='libigraph_la-cs_pinv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_pinv.lo `test -f 'cs/cs_pinv.c' || echo '$(srcdir)/'`cs/cs_pinv.c
+
+libigraph_la-cs_usolve.lo: cs/cs_usolve.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_usolve.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_usolve.Tpo -c -o libigraph_la-cs_usolve.lo `test -f 'cs/cs_usolve.c' || echo '$(srcdir)/'`cs/cs_usolve.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_usolve.Tpo $(DEPDIR)/libigraph_la-cs_usolve.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_usolve.c' object='libigraph_la-cs_usolve.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_usolve.lo `test -f 'cs/cs_usolve.c' || echo '$(srcdir)/'`cs/cs_usolve.c
+
+libigraph_la-cs_fkeep.lo: cs/cs_fkeep.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_fkeep.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_fkeep.Tpo -c -o libigraph_la-cs_fkeep.lo `test -f 'cs/cs_fkeep.c' || echo '$(srcdir)/'`cs/cs_fkeep.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_fkeep.Tpo $(DEPDIR)/libigraph_la-cs_fkeep.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_fkeep.c' object='libigraph_la-cs_fkeep.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_fkeep.lo `test -f 'cs/cs_fkeep.c' || echo '$(srcdir)/'`cs/cs_fkeep.c
+
+libigraph_la-cs_post.lo: cs/cs_post.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_post.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_post.Tpo -c -o libigraph_la-cs_post.lo `test -f 'cs/cs_post.c' || echo '$(srcdir)/'`cs/cs_post.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_post.Tpo $(DEPDIR)/libigraph_la-cs_post.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_post.c' object='libigraph_la-cs_post.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_post.lo `test -f 'cs/cs_post.c' || echo '$(srcdir)/'`cs/cs_post.c
+
+libigraph_la-cs_util.lo: cs/cs_util.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_util.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_util.Tpo -c -o libigraph_la-cs_util.lo `test -f 'cs/cs_util.c' || echo '$(srcdir)/'`cs/cs_util.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_util.Tpo $(DEPDIR)/libigraph_la-cs_util.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_util.c' object='libigraph_la-cs_util.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_util.lo `test -f 'cs/cs_util.c' || echo '$(srcdir)/'`cs/cs_util.c
+
+libigraph_la-cs_gaxpy.lo: cs/cs_gaxpy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_gaxpy.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_gaxpy.Tpo -c -o libigraph_la-cs_gaxpy.lo `test -f 'cs/cs_gaxpy.c' || echo '$(srcdir)/'`cs/cs_gaxpy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_gaxpy.Tpo $(DEPDIR)/libigraph_la-cs_gaxpy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_gaxpy.c' object='libigraph_la-cs_gaxpy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_gaxpy.lo `test -f 'cs/cs_gaxpy.c' || echo '$(srcdir)/'`cs/cs_gaxpy.c
+
+libigraph_la-cs_print.lo: cs/cs_print.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_print.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_print.Tpo -c -o libigraph_la-cs_print.lo `test -f 'cs/cs_print.c' || echo '$(srcdir)/'`cs/cs_print.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_print.Tpo $(DEPDIR)/libigraph_la-cs_print.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_print.c' object='libigraph_la-cs_print.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_print.lo `test -f 'cs/cs_print.c' || echo '$(srcdir)/'`cs/cs_print.c
+
+libigraph_la-cs_utsolve.lo: cs/cs_utsolve.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cs_utsolve.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cs_utsolve.Tpo -c -o libigraph_la-cs_utsolve.lo `test -f 'cs/cs_utsolve.c' || echo '$(srcdir)/'`cs/cs_utsolve.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cs_utsolve.Tpo $(DEPDIR)/libigraph_la-cs_utsolve.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cs/cs_utsolve.c' object='libigraph_la-cs_utsolve.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cs_utsolve.lo `test -f 'cs/cs_utsolve.c' || echo '$(srcdir)/'`cs/cs_utsolve.c
+
+libigraph_la-sparsemat.lo: sparsemat.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-sparsemat.lo -MD -MP -MF $(DEPDIR)/libigraph_la-sparsemat.Tpo -c -o libigraph_la-sparsemat.lo `test -f 'sparsemat.c' || echo '$(srcdir)/'`sparsemat.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-sparsemat.Tpo $(DEPDIR)/libigraph_la-sparsemat.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='sparsemat.c' object='libigraph_la-sparsemat.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-sparsemat.lo `test -f 'sparsemat.c' || echo '$(srcdir)/'`sparsemat.c
+
+libigraph_la-mixing.lo: mixing.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-mixing.lo -MD -MP -MF $(DEPDIR)/libigraph_la-mixing.Tpo -c -o libigraph_la-mixing.lo `test -f 'mixing.c' || echo '$(srcdir)/'`mixing.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-mixing.Tpo $(DEPDIR)/libigraph_la-mixing.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='mixing.c' object='libigraph_la-mixing.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-mixing.lo `test -f 'mixing.c' || echo '$(srcdir)/'`mixing.c
+
+libigraph_la-bigint.lo: bigint.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-bigint.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bigint.Tpo -c -o libigraph_la-bigint.lo `test -f 'bigint.c' || echo '$(srcdir)/'`bigint.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bigint.Tpo $(DEPDIR)/libigraph_la-bigint.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='bigint.c' object='libigraph_la-bigint.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-bigint.lo `test -f 'bigint.c' || echo '$(srcdir)/'`bigint.c
+
+libigraph_la-bignum.lo: bignum.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-bignum.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bignum.Tpo -c -o libigraph_la-bignum.lo `test -f 'bignum.c' || echo '$(srcdir)/'`bignum.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bignum.Tpo $(DEPDIR)/libigraph_la-bignum.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='bignum.c' object='libigraph_la-bignum.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-bignum.lo `test -f 'bignum.c' || echo '$(srcdir)/'`bignum.c
+
+libigraph_la-version.lo: version.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-version.lo -MD -MP -MF $(DEPDIR)/libigraph_la-version.Tpo -c -o libigraph_la-version.lo `test -f 'version.c' || echo '$(srcdir)/'`version.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-version.Tpo $(DEPDIR)/libigraph_la-version.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='version.c' object='libigraph_la-version.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-version.lo `test -f 'version.c' || echo '$(srcdir)/'`version.c
+
+libigraph_la-optimal_modularity.lo: optimal_modularity.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-optimal_modularity.lo -MD -MP -MF $(DEPDIR)/libigraph_la-optimal_modularity.Tpo -c -o libigraph_la-optimal_modularity.lo `test -f 'optimal_modularity.c' || echo '$(srcdir)/'`optimal_modularity.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-optimal_modularity.Tpo $(DEPDIR)/libigraph_la-optimal_modularity.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='optimal_modularity.c' object='libigraph_la-optimal_modularity.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-optimal_modularity.lo `test -f 'optimal_modularity.c' || echo '$(srcdir)/'`optimal_modularity.c
+
+libigraph_la-igraph_fixed_vectorlist.lo: igraph_fixed_vectorlist.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_fixed_vectorlist.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_fixed_vectorlist.Tpo -c -o libigraph_la-igraph_fixed_vectorlist.lo `test -f 'igraph_fixed_vectorlist.c' || echo '$(srcdir)/'`igraph_fixed_vectorlist.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_fixed_vectorlist.Tpo $(DEPDIR)/libigraph_la-igraph_fixed_vectorlist.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_fixed_vectorlist.c' object='libigraph_la-igraph_fixed_vectorlist.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_fixed_vectorlist.lo `test -f 'igraph_fixed_vectorlist.c' || echo '$(srcdir)/'`igraph_fixed_vectorlist.c
+
+libigraph_la-separators.lo: separators.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-separators.lo -MD -MP -MF $(DEPDIR)/libigraph_la-separators.Tpo -c -o libigraph_la-separators.lo `test -f 'separators.c' || echo '$(srcdir)/'`separators.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-separators.Tpo $(DEPDIR)/libigraph_la-separators.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='separators.c' object='libigraph_la-separators.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-separators.lo `test -f 'separators.c' || echo '$(srcdir)/'`separators.c
+
+libigraph_la-igraph_marked_queue.lo: igraph_marked_queue.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_marked_queue.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_marked_queue.Tpo -c -o libigraph_la-igraph_marked_queue.lo `test -f 'igraph_marked_queue.c' || echo '$(srcdir)/'`igraph_marked_queue.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_marked_queue.Tpo $(DEPDIR)/libigraph_la-igraph_marked_queue.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_marked_queue.c' object='libigraph_la-igraph_marked_queue.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_marked_queue.lo `test -f 'igraph_marked_queue.c' || echo '$(srcdir)/'`igraph_marked_queue.c
+
+libigraph_la-igraph_estack.lo: igraph_estack.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-igraph_estack.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_estack.Tpo -c -o libigraph_la-igraph_estack.lo `test -f 'igraph_estack.c' || echo '$(srcdir)/'`igraph_estack.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_estack.Tpo $(DEPDIR)/libigraph_la-igraph_estack.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='igraph_estack.c' object='libigraph_la-igraph_estack.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-igraph_estack.lo `test -f 'igraph_estack.c' || echo '$(srcdir)/'`igraph_estack.c
+
+libigraph_la-st-cuts.lo: st-cuts.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-st-cuts.lo -MD -MP -MF $(DEPDIR)/libigraph_la-st-cuts.Tpo -c -o libigraph_la-st-cuts.lo `test -f 'st-cuts.c' || echo '$(srcdir)/'`st-cuts.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-st-cuts.Tpo $(DEPDIR)/libigraph_la-st-cuts.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='st-cuts.c' object='libigraph_la-st-cuts.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-st-cuts.lo `test -f 'st-cuts.c' || echo '$(srcdir)/'`st-cuts.c
+
+libigraph_la-cohesive_blocks.lo: cohesive_blocks.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-cohesive_blocks.lo -MD -MP -MF $(DEPDIR)/libigraph_la-cohesive_blocks.Tpo -c -o libigraph_la-cohesive_blocks.lo `test -f 'cohesive_blocks.c' || echo '$(srcdir)/'`cohesive_blocks.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-cohesive_blocks.Tpo $(DEPDIR)/libigraph_la-cohesive_blocks.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='cohesive_blocks.c' object='libigraph_la-cohesive_blocks.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-cohesive_blocks.lo `test -f 'cohesive_blocks.c' || echo '$(srcdir)/'`cohesive_blocks.c
+
+libigraph_la-statusbar.lo: statusbar.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-statusbar.lo -MD -MP -MF $(DEPDIR)/libigraph_la-statusbar.Tpo -c -o libigraph_la-statusbar.lo `test -f 'statusbar.c' || echo '$(srcdir)/'`statusbar.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-statusbar.Tpo $(DEPDIR)/libigraph_la-statusbar.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='statusbar.c' object='libigraph_la-statusbar.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-statusbar.lo `test -f 'statusbar.c' || echo '$(srcdir)/'`statusbar.c
+
+libigraph_la-lapack.lo: lapack.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-lapack.lo -MD -MP -MF $(DEPDIR)/libigraph_la-lapack.Tpo -c -o libigraph_la-lapack.lo `test -f 'lapack.c' || echo '$(srcdir)/'`lapack.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-lapack.Tpo $(DEPDIR)/libigraph_la-lapack.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack.c' object='libigraph_la-lapack.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-lapack.lo `test -f 'lapack.c' || echo '$(srcdir)/'`lapack.c
+
+libigraph_la-complex.lo: complex.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-complex.lo -MD -MP -MF $(DEPDIR)/libigraph_la-complex.Tpo -c -o libigraph_la-complex.lo `test -f 'complex.c' || echo '$(srcdir)/'`complex.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-complex.Tpo $(DEPDIR)/libigraph_la-complex.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='complex.c' object='libigraph_la-complex.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-complex.lo `test -f 'complex.c' || echo '$(srcdir)/'`complex.c
+
+libigraph_la-eigen.lo: eigen.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-eigen.lo -MD -MP -MF $(DEPDIR)/libigraph_la-eigen.Tpo -c -o libigraph_la-eigen.lo `test -f 'eigen.c' || echo '$(srcdir)/'`eigen.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-eigen.Tpo $(DEPDIR)/libigraph_la-eigen.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='eigen.c' object='libigraph_la-eigen.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-eigen.lo `test -f 'eigen.c' || echo '$(srcdir)/'`eigen.c
+
+libigraph_la-feedback_arc_set.lo: feedback_arc_set.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-feedback_arc_set.lo -MD -MP -MF $(DEPDIR)/libigraph_la-feedback_arc_set.Tpo -c -o libigraph_la-feedback_arc_set.lo `test -f 'feedback_arc_set.c' || echo '$(srcdir)/'`feedback_arc_set.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-feedback_arc_set.Tpo $(DEPDIR)/libigraph_la-feedback_arc_set.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='feedback_arc_set.c' object='libigraph_la-feedback_arc_set.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-feedback_arc_set.lo `test -f 'feedback_arc_set.c' || echo '$(srcdir)/'`feedback_arc_set.c
+
+libigraph_la-sugiyama.lo: sugiyama.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-sugiyama.lo -MD -MP -MF $(DEPDIR)/libigraph_la-sugiyama.Tpo -c -o libigraph_la-sugiyama.lo `test -f 'sugiyama.c' || echo '$(srcdir)/'`sugiyama.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-sugiyama.Tpo $(DEPDIR)/libigraph_la-sugiyama.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='sugiyama.c' object='libigraph_la-sugiyama.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-sugiyama.lo `test -f 'sugiyama.c' || echo '$(srcdir)/'`sugiyama.c
+
+libigraph_la-glpk_support.lo: glpk_support.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-glpk_support.lo -MD -MP -MF $(DEPDIR)/libigraph_la-glpk_support.Tpo -c -o libigraph_la-glpk_support.lo `test -f 'glpk_support.c' || echo '$(srcdir)/'`glpk_support.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-glpk_support.Tpo $(DEPDIR)/libigraph_la-glpk_support.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='glpk_support.c' object='libigraph_la-glpk_support.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-glpk_support.lo `test -f 'glpk_support.c' || echo '$(srcdir)/'`glpk_support.c
+
+libigraph_la-distances.lo: distances.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-distances.lo -MD -MP -MF $(DEPDIR)/libigraph_la-distances.Tpo -c -o libigraph_la-distances.lo `test -f 'distances.c' || echo '$(srcdir)/'`distances.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-distances.Tpo $(DEPDIR)/libigraph_la-distances.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='distances.c' object='libigraph_la-distances.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-distances.lo `test -f 'distances.c' || echo '$(srcdir)/'`distances.c
+
+libigraph_la-fortran_intrinsics.lo: fortran_intrinsics.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-fortran_intrinsics.lo -MD -MP -MF $(DEPDIR)/libigraph_la-fortran_intrinsics.Tpo -c -o libigraph_la-fortran_intrinsics.lo `test -f 'fortran_intrinsics.c' || echo '$(srcdir)/'`fortran_intrinsics.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-fortran_intrinsics.Tpo $(DEPDIR)/libigraph_la-fortran_intrinsics.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='fortran_intrinsics.c' object='libigraph_la-fortran_intrinsics.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-fortran_intrinsics.lo `test -f 'fortran_intrinsics.c' || echo '$(srcdir)/'`fortran_intrinsics.c
+
+libigraph_la-matching.lo: matching.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-matching.lo -MD -MP -MF $(DEPDIR)/libigraph_la-matching.Tpo -c -o libigraph_la-matching.lo `test -f 'matching.c' || echo '$(srcdir)/'`matching.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-matching.Tpo $(DEPDIR)/libigraph_la-matching.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='matching.c' object='libigraph_la-matching.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-matching.lo `test -f 'matching.c' || echo '$(srcdir)/'`matching.c
+
+libigraph_la-scg.lo: scg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg.Tpo -c -o libigraph_la-scg.lo `test -f 'scg.c' || echo '$(srcdir)/'`scg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg.Tpo $(DEPDIR)/libigraph_la-scg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg.c' object='libigraph_la-scg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg.lo `test -f 'scg.c' || echo '$(srcdir)/'`scg.c
+
+libigraph_la-scg_approximate_methods.lo: scg_approximate_methods.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg_approximate_methods.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg_approximate_methods.Tpo -c -o libigraph_la-scg_approximate_methods.lo `test -f 'scg_approximate_methods.c' || echo '$(srcdir)/'`scg_approximate_methods.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg_approximate_methods.Tpo $(DEPDIR)/libigraph_la-scg_approximate_methods.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg_approximate_methods.c' object='libigraph_la-scg_approximate_methods.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg_approximate_methods.lo `test -f 'scg_approximate_methods.c' || echo '$(srcdir)/'`scg_approximate_methods.c
+
+libigraph_la-scg_exact_scg.lo: scg_exact_scg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg_exact_scg.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg_exact_scg.Tpo -c -o libigraph_la-scg_exact_scg.lo `test -f 'scg_exact_scg.c' || echo '$(srcdir)/'`scg_exact_scg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg_exact_scg.Tpo $(DEPDIR)/libigraph_la-scg_exact_scg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg_exact_scg.c' object='libigraph_la-scg_exact_scg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg_exact_scg.lo `test -f 'scg_exact_scg.c' || echo '$(srcdir)/'`scg_exact_scg.c
+
+libigraph_la-scg_kmeans.lo: scg_kmeans.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg_kmeans.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg_kmeans.Tpo -c -o libigraph_la-scg_kmeans.lo `test -f 'scg_kmeans.c' || echo '$(srcdir)/'`scg_kmeans.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg_kmeans.Tpo $(DEPDIR)/libigraph_la-scg_kmeans.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg_kmeans.c' object='libigraph_la-scg_kmeans.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg_kmeans.lo `test -f 'scg_kmeans.c' || echo '$(srcdir)/'`scg_kmeans.c
+
+libigraph_la-scg_utils.lo: scg_utils.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg_utils.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg_utils.Tpo -c -o libigraph_la-scg_utils.lo `test -f 'scg_utils.c' || echo '$(srcdir)/'`scg_utils.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg_utils.Tpo $(DEPDIR)/libigraph_la-scg_utils.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg_utils.c' object='libigraph_la-scg_utils.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg_utils.lo `test -f 'scg_utils.c' || echo '$(srcdir)/'`scg_utils.c
+
+libigraph_la-scg_optimal_method.lo: scg_optimal_method.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-scg_optimal_method.lo -MD -MP -MF $(DEPDIR)/libigraph_la-scg_optimal_method.Tpo -c -o libigraph_la-scg_optimal_method.lo `test -f 'scg_optimal_method.c' || echo '$(srcdir)/'`scg_optimal_method.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-scg_optimal_method.Tpo $(DEPDIR)/libigraph_la-scg_optimal_method.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='scg_optimal_method.c' object='libigraph_la-scg_optimal_method.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-scg_optimal_method.lo `test -f 'scg_optimal_method.c' || echo '$(srcdir)/'`scg_optimal_method.c
+
+libigraph_la-qsort.lo: qsort.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-qsort.lo -MD -MP -MF $(DEPDIR)/libigraph_la-qsort.Tpo -c -o libigraph_la-qsort.lo `test -f 'qsort.c' || echo '$(srcdir)/'`qsort.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-qsort.Tpo $(DEPDIR)/libigraph_la-qsort.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='qsort.c' object='libigraph_la-qsort.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-qsort.lo `test -f 'qsort.c' || echo '$(srcdir)/'`qsort.c
+
+libigraph_la-qsort_r.lo: qsort_r.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-qsort_r.lo -MD -MP -MF $(DEPDIR)/libigraph_la-qsort_r.Tpo -c -o libigraph_la-qsort_r.lo `test -f 'qsort_r.c' || echo '$(srcdir)/'`qsort_r.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-qsort_r.Tpo $(DEPDIR)/libigraph_la-qsort_r.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='qsort_r.c' object='libigraph_la-qsort_r.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-qsort_r.lo `test -f 'qsort_r.c' || echo '$(srcdir)/'`qsort_r.c
+
+libigraph_la-types.lo: types.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-types.lo -MD -MP -MF $(DEPDIR)/libigraph_la-types.Tpo -c -o libigraph_la-types.lo `test -f 'types.c' || echo '$(srcdir)/'`types.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-types.Tpo $(DEPDIR)/libigraph_la-types.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='types.c' object='libigraph_la-types.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-types.lo `test -f 'types.c' || echo '$(srcdir)/'`types.c
+
+libigraph_la-hacks.lo: hacks.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -MT libigraph_la-hacks.lo -MD -MP -MF $(DEPDIR)/libigraph_la-hacks.Tpo -c -o libigraph_la-hacks.lo `test -f 'hacks.c' || echo '$(srcdir)/'`hacks.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-hacks.Tpo $(DEPDIR)/libigraph_la-hacks.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='hacks.c' object='libigraph_la-hacks.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CFLAGS) $(CFLAGS) -c -o libigraph_la-hacks.lo `test -f 'hacks.c' || echo '$(srcdir)/'`hacks.c
+
+liblapack_la-dgeev.lo: lapack/dgeev.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgeev.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgeev.Tpo -c -o liblapack_la-dgeev.lo `test -f 'lapack/dgeev.c' || echo '$(srcdir)/'`lapack/dgeev.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgeev.Tpo $(DEPDIR)/liblapack_la-dgeev.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgeev.c' object='liblapack_la-dgeev.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgeev.lo `test -f 'lapack/dgeev.c' || echo '$(srcdir)/'`lapack/dgeev.c
+
+liblapack_la-dgebak.lo: lapack/dgebak.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgebak.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgebak.Tpo -c -o liblapack_la-dgebak.lo `test -f 'lapack/dgebak.c' || echo '$(srcdir)/'`lapack/dgebak.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgebak.Tpo $(DEPDIR)/liblapack_la-dgebak.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgebak.c' object='liblapack_la-dgebak.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgebak.lo `test -f 'lapack/dgebak.c' || echo '$(srcdir)/'`lapack/dgebak.c
+
+liblapack_la-xerbla.lo: lapack/xerbla.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-xerbla.lo -MD -MP -MF $(DEPDIR)/liblapack_la-xerbla.Tpo -c -o liblapack_la-xerbla.lo `test -f 'lapack/xerbla.c' || echo '$(srcdir)/'`lapack/xerbla.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-xerbla.Tpo $(DEPDIR)/liblapack_la-xerbla.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/xerbla.c' object='liblapack_la-xerbla.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-xerbla.lo `test -f 'lapack/xerbla.c' || echo '$(srcdir)/'`lapack/xerbla.c
+
+liblapack_la-dgebal.lo: lapack/dgebal.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgebal.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgebal.Tpo -c -o liblapack_la-dgebal.lo `test -f 'lapack/dgebal.c' || echo '$(srcdir)/'`lapack/dgebal.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgebal.Tpo $(DEPDIR)/liblapack_la-dgebal.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgebal.c' object='liblapack_la-dgebal.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgebal.lo `test -f 'lapack/dgebal.c' || echo '$(srcdir)/'`lapack/dgebal.c
+
+liblapack_la-disnan.lo: lapack/disnan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-disnan.lo -MD -MP -MF $(DEPDIR)/liblapack_la-disnan.Tpo -c -o liblapack_la-disnan.lo `test -f 'lapack/disnan.c' || echo '$(srcdir)/'`lapack/disnan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-disnan.Tpo $(DEPDIR)/liblapack_la-disnan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/disnan.c' object='liblapack_la-disnan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-disnan.lo `test -f 'lapack/disnan.c' || echo '$(srcdir)/'`lapack/disnan.c
+
+liblapack_la-dlaisnan.lo: lapack/dlaisnan.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaisnan.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaisnan.Tpo -c -o liblapack_la-dlaisnan.lo `test -f 'lapack/dlaisnan.c' || echo '$(srcdir)/'`lapack/dlaisnan.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaisnan.Tpo $(DEPDIR)/liblapack_la-dlaisnan.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaisnan.c' object='liblapack_la-dlaisnan.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaisnan.lo `test -f 'lapack/dlaisnan.c' || echo '$(srcdir)/'`lapack/dlaisnan.c
+
+liblapack_la-dgehrd.lo: lapack/dgehrd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgehrd.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgehrd.Tpo -c -o liblapack_la-dgehrd.lo `test -f 'lapack/dgehrd.c' || echo '$(srcdir)/'`lapack/dgehrd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgehrd.Tpo $(DEPDIR)/liblapack_la-dgehrd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgehrd.c' object='liblapack_la-dgehrd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgehrd.lo `test -f 'lapack/dgehrd.c' || echo '$(srcdir)/'`lapack/dgehrd.c
+
+liblapack_la-dgehd2.lo: lapack/dgehd2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgehd2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgehd2.Tpo -c -o liblapack_la-dgehd2.lo `test -f 'lapack/dgehd2.c' || echo '$(srcdir)/'`lapack/dgehd2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgehd2.Tpo $(DEPDIR)/liblapack_la-dgehd2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgehd2.c' object='liblapack_la-dgehd2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgehd2.lo `test -f 'lapack/dgehd2.c' || echo '$(srcdir)/'`lapack/dgehd2.c
+
+liblapack_la-dlarf.lo: lapack/dlarf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarf.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarf.Tpo -c -o liblapack_la-dlarf.lo `test -f 'lapack/dlarf.c' || echo '$(srcdir)/'`lapack/dlarf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarf.Tpo $(DEPDIR)/liblapack_la-dlarf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarf.c' object='liblapack_la-dlarf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarf.lo `test -f 'lapack/dlarf.c' || echo '$(srcdir)/'`lapack/dlarf.c
+
+liblapack_la-iladlc.lo: lapack/iladlc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-iladlc.lo -MD -MP -MF $(DEPDIR)/liblapack_la-iladlc.Tpo -c -o liblapack_la-iladlc.lo `test -f 'lapack/iladlc.c' || echo '$(srcdir)/'`lapack/iladlc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-iladlc.Tpo $(DEPDIR)/liblapack_la-iladlc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/iladlc.c' object='liblapack_la-iladlc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-iladlc.lo `test -f 'lapack/iladlc.c' || echo '$(srcdir)/'`lapack/iladlc.c
+
+liblapack_la-iladlr.lo: lapack/iladlr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-iladlr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-iladlr.Tpo -c -o liblapack_la-iladlr.lo `test -f 'lapack/iladlr.c' || echo '$(srcdir)/'`lapack/iladlr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-iladlr.Tpo $(DEPDIR)/liblapack_la-iladlr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/iladlr.c' object='liblapack_la-iladlr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-iladlr.lo `test -f 'lapack/iladlr.c' || echo '$(srcdir)/'`lapack/iladlr.c
+
+liblapack_la-dlarfg.lo: lapack/dlarfg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarfg.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarfg.Tpo -c -o liblapack_la-dlarfg.lo `test -f 'lapack/dlarfg.c' || echo '$(srcdir)/'`lapack/dlarfg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarfg.Tpo $(DEPDIR)/liblapack_la-dlarfg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarfg.c' object='liblapack_la-dlarfg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarfg.lo `test -f 'lapack/dlarfg.c' || echo '$(srcdir)/'`lapack/dlarfg.c
+
+liblapack_la-dlapy2.lo: lapack/dlapy2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlapy2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlapy2.Tpo -c -o liblapack_la-dlapy2.lo `test -f 'lapack/dlapy2.c' || echo '$(srcdir)/'`lapack/dlapy2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlapy2.Tpo $(DEPDIR)/liblapack_la-dlapy2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlapy2.c' object='liblapack_la-dlapy2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlapy2.lo `test -f 'lapack/dlapy2.c' || echo '$(srcdir)/'`lapack/dlapy2.c
+
+liblapack_la-dlahr2.lo: lapack/dlahr2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlahr2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlahr2.Tpo -c -o liblapack_la-dlahr2.lo `test -f 'lapack/dlahr2.c' || echo '$(srcdir)/'`lapack/dlahr2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlahr2.Tpo $(DEPDIR)/liblapack_la-dlahr2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlahr2.c' object='liblapack_la-dlahr2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlahr2.lo `test -f 'lapack/dlahr2.c' || echo '$(srcdir)/'`lapack/dlahr2.c
+
+liblapack_la-dlacpy.lo: lapack/dlacpy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlacpy.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlacpy.Tpo -c -o liblapack_la-dlacpy.lo `test -f 'lapack/dlacpy.c' || echo '$(srcdir)/'`lapack/dlacpy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlacpy.Tpo $(DEPDIR)/liblapack_la-dlacpy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlacpy.c' object='liblapack_la-dlacpy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlacpy.lo `test -f 'lapack/dlacpy.c' || echo '$(srcdir)/'`lapack/dlacpy.c
+
+liblapack_la-dlarfb.lo: lapack/dlarfb.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarfb.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarfb.Tpo -c -o liblapack_la-dlarfb.lo `test -f 'lapack/dlarfb.c' || echo '$(srcdir)/'`lapack/dlarfb.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarfb.Tpo $(DEPDIR)/liblapack_la-dlarfb.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarfb.c' object='liblapack_la-dlarfb.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarfb.lo `test -f 'lapack/dlarfb.c' || echo '$(srcdir)/'`lapack/dlarfb.c
+
+liblapack_la-ilaenv.lo: lapack/ilaenv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-ilaenv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-ilaenv.Tpo -c -o liblapack_la-ilaenv.lo `test -f 'lapack/ilaenv.c' || echo '$(srcdir)/'`lapack/ilaenv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-ilaenv.Tpo $(DEPDIR)/liblapack_la-ilaenv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/ilaenv.c' object='liblapack_la-ilaenv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-ilaenv.lo `test -f 'lapack/ilaenv.c' || echo '$(srcdir)/'`lapack/ilaenv.c
+
+liblapack_la-ieeeck.lo: lapack/ieeeck.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-ieeeck.lo -MD -MP -MF $(DEPDIR)/liblapack_la-ieeeck.Tpo -c -o liblapack_la-ieeeck.lo `test -f 'lapack/ieeeck.c' || echo '$(srcdir)/'`lapack/ieeeck.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-ieeeck.Tpo $(DEPDIR)/liblapack_la-ieeeck.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/ieeeck.c' object='liblapack_la-ieeeck.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-ieeeck.lo `test -f 'lapack/ieeeck.c' || echo '$(srcdir)/'`lapack/ieeeck.c
+
+liblapack_la-iparmq.lo: lapack/iparmq.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-iparmq.lo -MD -MP -MF $(DEPDIR)/liblapack_la-iparmq.Tpo -c -o liblapack_la-iparmq.lo `test -f 'lapack/iparmq.c' || echo '$(srcdir)/'`lapack/iparmq.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-iparmq.Tpo $(DEPDIR)/liblapack_la-iparmq.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/iparmq.c' object='liblapack_la-iparmq.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-iparmq.lo `test -f 'lapack/iparmq.c' || echo '$(srcdir)/'`lapack/iparmq.c
+
+liblapack_la-dhseqr.lo: lapack/dhseqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dhseqr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dhseqr.Tpo -c -o liblapack_la-dhseqr.lo `test -f 'lapack/dhseqr.c' || echo '$(srcdir)/'`lapack/dhseqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dhseqr.Tpo $(DEPDIR)/liblapack_la-dhseqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dhseqr.c' object='liblapack_la-dhseqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dhseqr.lo `test -f 'lapack/dhseqr.c' || echo '$(srcdir)/'`lapack/dhseqr.c
+
+liblapack_la-dlahqr.lo: lapack/dlahqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlahqr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlahqr.Tpo -c -o liblapack_la-dlahqr.lo `test -f 'lapack/dlahqr.c' || echo '$(srcdir)/'`lapack/dlahqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlahqr.Tpo $(DEPDIR)/liblapack_la-dlahqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlahqr.c' object='liblapack_la-dlahqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlahqr.lo `test -f 'lapack/dlahqr.c' || echo '$(srcdir)/'`lapack/dlahqr.c
+
+liblapack_la-dlabad.lo: lapack/dlabad.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlabad.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlabad.Tpo -c -o liblapack_la-dlabad.lo `test -f 'lapack/dlabad.c' || echo '$(srcdir)/'`lapack/dlabad.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlabad.Tpo $(DEPDIR)/liblapack_la-dlabad.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlabad.c' object='liblapack_la-dlabad.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlabad.lo `test -f 'lapack/dlabad.c' || echo '$(srcdir)/'`lapack/dlabad.c
+
+liblapack_la-dlanv2.lo: lapack/dlanv2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlanv2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlanv2.Tpo -c -o liblapack_la-dlanv2.lo `test -f 'lapack/dlanv2.c' || echo '$(srcdir)/'`lapack/dlanv2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlanv2.Tpo $(DEPDIR)/liblapack_la-dlanv2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlanv2.c' object='liblapack_la-dlanv2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlanv2.lo `test -f 'lapack/dlanv2.c' || echo '$(srcdir)/'`lapack/dlanv2.c
+
+liblapack_la-dlaqr0.lo: lapack/dlaqr0.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr0.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr0.Tpo -c -o liblapack_la-dlaqr0.lo `test -f 'lapack/dlaqr0.c' || echo '$(srcdir)/'`lapack/dlaqr0.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr0.Tpo $(DEPDIR)/liblapack_la-dlaqr0.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr0.c' object='liblapack_la-dlaqr0.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr0.lo `test -f 'lapack/dlaqr0.c' || echo '$(srcdir)/'`lapack/dlaqr0.c
+
+liblapack_la-dlaqr3.lo: lapack/dlaqr3.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr3.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr3.Tpo -c -o liblapack_la-dlaqr3.lo `test -f 'lapack/dlaqr3.c' || echo '$(srcdir)/'`lapack/dlaqr3.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr3.Tpo $(DEPDIR)/liblapack_la-dlaqr3.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr3.c' object='liblapack_la-dlaqr3.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr3.lo `test -f 'lapack/dlaqr3.c' || echo '$(srcdir)/'`lapack/dlaqr3.c
+
+liblapack_la-dlaqr4.lo: lapack/dlaqr4.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr4.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr4.Tpo -c -o liblapack_la-dlaqr4.lo `test -f 'lapack/dlaqr4.c' || echo '$(srcdir)/'`lapack/dlaqr4.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr4.Tpo $(DEPDIR)/liblapack_la-dlaqr4.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr4.c' object='liblapack_la-dlaqr4.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr4.lo `test -f 'lapack/dlaqr4.c' || echo '$(srcdir)/'`lapack/dlaqr4.c
+
+liblapack_la-dlaqr2.lo: lapack/dlaqr2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr2.Tpo -c -o liblapack_la-dlaqr2.lo `test -f 'lapack/dlaqr2.c' || echo '$(srcdir)/'`lapack/dlaqr2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr2.Tpo $(DEPDIR)/liblapack_la-dlaqr2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr2.c' object='liblapack_la-dlaqr2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr2.lo `test -f 'lapack/dlaqr2.c' || echo '$(srcdir)/'`lapack/dlaqr2.c
+
+liblapack_la-dlaset.lo: lapack/dlaset.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaset.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaset.Tpo -c -o liblapack_la-dlaset.lo `test -f 'lapack/dlaset.c' || echo '$(srcdir)/'`lapack/dlaset.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaset.Tpo $(DEPDIR)/liblapack_la-dlaset.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaset.c' object='liblapack_la-dlaset.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaset.lo `test -f 'lapack/dlaset.c' || echo '$(srcdir)/'`lapack/dlaset.c
+
+liblapack_la-dormhr.lo: lapack/dormhr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dormhr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dormhr.Tpo -c -o liblapack_la-dormhr.lo `test -f 'lapack/dormhr.c' || echo '$(srcdir)/'`lapack/dormhr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dormhr.Tpo $(DEPDIR)/liblapack_la-dormhr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dormhr.c' object='liblapack_la-dormhr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dormhr.lo `test -f 'lapack/dormhr.c' || echo '$(srcdir)/'`lapack/dormhr.c
+
+liblapack_la-dormqr.lo: lapack/dormqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dormqr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dormqr.Tpo -c -o liblapack_la-dormqr.lo `test -f 'lapack/dormqr.c' || echo '$(srcdir)/'`lapack/dormqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dormqr.Tpo $(DEPDIR)/liblapack_la-dormqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dormqr.c' object='liblapack_la-dormqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dormqr.lo `test -f 'lapack/dormqr.c' || echo '$(srcdir)/'`lapack/dormqr.c
+
+liblapack_la-dlarft.lo: lapack/dlarft.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarft.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarft.Tpo -c -o liblapack_la-dlarft.lo `test -f 'lapack/dlarft.c' || echo '$(srcdir)/'`lapack/dlarft.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarft.Tpo $(DEPDIR)/liblapack_la-dlarft.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarft.c' object='liblapack_la-dlarft.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarft.lo `test -f 'lapack/dlarft.c' || echo '$(srcdir)/'`lapack/dlarft.c
+
+liblapack_la-dorm2r.lo: lapack/dorm2r.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dorm2r.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dorm2r.Tpo -c -o liblapack_la-dorm2r.lo `test -f 'lapack/dorm2r.c' || echo '$(srcdir)/'`lapack/dorm2r.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dorm2r.Tpo $(DEPDIR)/liblapack_la-dorm2r.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dorm2r.c' object='liblapack_la-dorm2r.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dorm2r.lo `test -f 'lapack/dorm2r.c' || echo '$(srcdir)/'`lapack/dorm2r.c
+
+liblapack_la-dtrexc.lo: lapack/dtrexc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dtrexc.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dtrexc.Tpo -c -o liblapack_la-dtrexc.lo `test -f 'lapack/dtrexc.c' || echo '$(srcdir)/'`lapack/dtrexc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dtrexc.Tpo $(DEPDIR)/liblapack_la-dtrexc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrexc.c' object='liblapack_la-dtrexc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dtrexc.lo `test -f 'lapack/dtrexc.c' || echo '$(srcdir)/'`lapack/dtrexc.c
+
+liblapack_la-dlaexc.lo: lapack/dlaexc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaexc.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaexc.Tpo -c -o liblapack_la-dlaexc.lo `test -f 'lapack/dlaexc.c' || echo '$(srcdir)/'`lapack/dlaexc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaexc.Tpo $(DEPDIR)/liblapack_la-dlaexc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaexc.c' object='liblapack_la-dlaexc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaexc.lo `test -f 'lapack/dlaexc.c' || echo '$(srcdir)/'`lapack/dlaexc.c
+
+liblapack_la-dlange.lo: lapack/dlange.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlange.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlange.Tpo -c -o liblapack_la-dlange.lo `test -f 'lapack/dlange.c' || echo '$(srcdir)/'`lapack/dlange.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlange.Tpo $(DEPDIR)/liblapack_la-dlange.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlange.c' object='liblapack_la-dlange.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlange.lo `test -f 'lapack/dlange.c' || echo '$(srcdir)/'`lapack/dlange.c
+
+liblapack_la-dlassq.lo: lapack/dlassq.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlassq.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlassq.Tpo -c -o liblapack_la-dlassq.lo `test -f 'lapack/dlassq.c' || echo '$(srcdir)/'`lapack/dlassq.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlassq.Tpo $(DEPDIR)/liblapack_la-dlassq.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlassq.c' object='liblapack_la-dlassq.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlassq.lo `test -f 'lapack/dlassq.c' || echo '$(srcdir)/'`lapack/dlassq.c
+
+liblapack_la-dlarfx.lo: lapack/dlarfx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarfx.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarfx.Tpo -c -o liblapack_la-dlarfx.lo `test -f 'lapack/dlarfx.c' || echo '$(srcdir)/'`lapack/dlarfx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarfx.Tpo $(DEPDIR)/liblapack_la-dlarfx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarfx.c' object='liblapack_la-dlarfx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarfx.lo `test -f 'lapack/dlarfx.c' || echo '$(srcdir)/'`lapack/dlarfx.c
+
+liblapack_la-dlartg.lo: lapack/dlartg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlartg.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlartg.Tpo -c -o liblapack_la-dlartg.lo `test -f 'lapack/dlartg.c' || echo '$(srcdir)/'`lapack/dlartg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlartg.Tpo $(DEPDIR)/liblapack_la-dlartg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlartg.c' object='liblapack_la-dlartg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlartg.lo `test -f 'lapack/dlartg.c' || echo '$(srcdir)/'`lapack/dlartg.c
+
+liblapack_la-dlasy2.lo: lapack/dlasy2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasy2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasy2.Tpo -c -o liblapack_la-dlasy2.lo `test -f 'lapack/dlasy2.c' || echo '$(srcdir)/'`lapack/dlasy2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasy2.Tpo $(DEPDIR)/liblapack_la-dlasy2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasy2.c' object='liblapack_la-dlasy2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasy2.lo `test -f 'lapack/dlasy2.c' || echo '$(srcdir)/'`lapack/dlasy2.c
+
+liblapack_la-dlaqr5.lo: lapack/dlaqr5.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr5.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr5.Tpo -c -o liblapack_la-dlaqr5.lo `test -f 'lapack/dlaqr5.c' || echo '$(srcdir)/'`lapack/dlaqr5.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr5.Tpo $(DEPDIR)/liblapack_la-dlaqr5.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr5.c' object='liblapack_la-dlaqr5.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr5.lo `test -f 'lapack/dlaqr5.c' || echo '$(srcdir)/'`lapack/dlaqr5.c
+
+liblapack_la-dlaqr1.lo: lapack/dlaqr1.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqr1.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqr1.Tpo -c -o liblapack_la-dlaqr1.lo `test -f 'lapack/dlaqr1.c' || echo '$(srcdir)/'`lapack/dlaqr1.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqr1.Tpo $(DEPDIR)/liblapack_la-dlaqr1.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqr1.c' object='liblapack_la-dlaqr1.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqr1.lo `test -f 'lapack/dlaqr1.c' || echo '$(srcdir)/'`lapack/dlaqr1.c
+
+liblapack_la-dlascl.lo: lapack/dlascl.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlascl.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlascl.Tpo -c -o liblapack_la-dlascl.lo `test -f 'lapack/dlascl.c' || echo '$(srcdir)/'`lapack/dlascl.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlascl.Tpo $(DEPDIR)/liblapack_la-dlascl.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlascl.c' object='liblapack_la-dlascl.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlascl.lo `test -f 'lapack/dlascl.c' || echo '$(srcdir)/'`lapack/dlascl.c
+
+liblapack_la-dorghr.lo: lapack/dorghr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dorghr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dorghr.Tpo -c -o liblapack_la-dorghr.lo `test -f 'lapack/dorghr.c' || echo '$(srcdir)/'`lapack/dorghr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dorghr.Tpo $(DEPDIR)/liblapack_la-dorghr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dorghr.c' object='liblapack_la-dorghr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dorghr.lo `test -f 'lapack/dorghr.c' || echo '$(srcdir)/'`lapack/dorghr.c
+
+liblapack_la-dorgqr.lo: lapack/dorgqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dorgqr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dorgqr.Tpo -c -o liblapack_la-dorgqr.lo `test -f 'lapack/dorgqr.c' || echo '$(srcdir)/'`lapack/dorgqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dorgqr.Tpo $(DEPDIR)/liblapack_la-dorgqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dorgqr.c' object='liblapack_la-dorgqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dorgqr.lo `test -f 'lapack/dorgqr.c' || echo '$(srcdir)/'`lapack/dorgqr.c
+
+liblapack_la-dorg2r.lo: lapack/dorg2r.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dorg2r.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dorg2r.Tpo -c -o liblapack_la-dorg2r.lo `test -f 'lapack/dorg2r.c' || echo '$(srcdir)/'`lapack/dorg2r.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dorg2r.Tpo $(DEPDIR)/liblapack_la-dorg2r.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dorg2r.c' object='liblapack_la-dorg2r.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dorg2r.lo `test -f 'lapack/dorg2r.c' || echo '$(srcdir)/'`lapack/dorg2r.c
+
+liblapack_la-dtrevc.lo: lapack/dtrevc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dtrevc.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dtrevc.Tpo -c -o liblapack_la-dtrevc.lo `test -f 'lapack/dtrevc.c' || echo '$(srcdir)/'`lapack/dtrevc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dtrevc.Tpo $(DEPDIR)/liblapack_la-dtrevc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrevc.c' object='liblapack_la-dtrevc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dtrevc.lo `test -f 'lapack/dtrevc.c' || echo '$(srcdir)/'`lapack/dtrevc.c
+
+liblapack_la-dlaln2.lo: lapack/dlaln2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaln2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaln2.Tpo -c -o liblapack_la-dlaln2.lo `test -f 'lapack/dlaln2.c' || echo '$(srcdir)/'`lapack/dlaln2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaln2.Tpo $(DEPDIR)/liblapack_la-dlaln2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaln2.c' object='liblapack_la-dlaln2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaln2.lo `test -f 'lapack/dlaln2.c' || echo '$(srcdir)/'`lapack/dlaln2.c
+
+liblapack_la-dladiv.lo: lapack/dladiv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dladiv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dladiv.Tpo -c -o liblapack_la-dladiv.lo `test -f 'lapack/dladiv.c' || echo '$(srcdir)/'`lapack/dladiv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dladiv.Tpo $(DEPDIR)/liblapack_la-dladiv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dladiv.c' object='liblapack_la-dladiv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dladiv.lo `test -f 'lapack/dladiv.c' || echo '$(srcdir)/'`lapack/dladiv.c
+
+liblapack_la-dsyevr.lo: lapack/dsyevr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dsyevr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dsyevr.Tpo -c -o liblapack_la-dsyevr.lo `test -f 'lapack/dsyevr.c' || echo '$(srcdir)/'`lapack/dsyevr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dsyevr.Tpo $(DEPDIR)/liblapack_la-dsyevr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsyevr.c' object='liblapack_la-dsyevr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dsyevr.lo `test -f 'lapack/dsyevr.c' || echo '$(srcdir)/'`lapack/dsyevr.c
+
+liblapack_la-dlansy.lo: lapack/dlansy.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlansy.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlansy.Tpo -c -o liblapack_la-dlansy.lo `test -f 'lapack/dlansy.c' || echo '$(srcdir)/'`lapack/dlansy.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlansy.Tpo $(DEPDIR)/liblapack_la-dlansy.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlansy.c' object='liblapack_la-dlansy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlansy.lo `test -f 'lapack/dlansy.c' || echo '$(srcdir)/'`lapack/dlansy.c
+
+liblapack_la-dormtr.lo: lapack/dormtr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dormtr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dormtr.Tpo -c -o liblapack_la-dormtr.lo `test -f 'lapack/dormtr.c' || echo '$(srcdir)/'`lapack/dormtr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dormtr.Tpo $(DEPDIR)/liblapack_la-dormtr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dormtr.c' object='liblapack_la-dormtr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dormtr.lo `test -f 'lapack/dormtr.c' || echo '$(srcdir)/'`lapack/dormtr.c
+
+liblapack_la-dormql.lo: lapack/dormql.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dormql.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dormql.Tpo -c -o liblapack_la-dormql.lo `test -f 'lapack/dormql.c' || echo '$(srcdir)/'`lapack/dormql.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dormql.Tpo $(DEPDIR)/liblapack_la-dormql.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dormql.c' object='liblapack_la-dormql.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dormql.lo `test -f 'lapack/dormql.c' || echo '$(srcdir)/'`lapack/dormql.c
+
+liblapack_la-dorm2l.lo: lapack/dorm2l.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dorm2l.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dorm2l.Tpo -c -o liblapack_la-dorm2l.lo `test -f 'lapack/dorm2l.c' || echo '$(srcdir)/'`lapack/dorm2l.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dorm2l.Tpo $(DEPDIR)/liblapack_la-dorm2l.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dorm2l.c' object='liblapack_la-dorm2l.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dorm2l.lo `test -f 'lapack/dorm2l.c' || echo '$(srcdir)/'`lapack/dorm2l.c
+
+liblapack_la-dstebz.lo: lapack/dstebz.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dstebz.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dstebz.Tpo -c -o liblapack_la-dstebz.lo `test -f 'lapack/dstebz.c' || echo '$(srcdir)/'`lapack/dstebz.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dstebz.Tpo $(DEPDIR)/liblapack_la-dstebz.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstebz.c' object='liblapack_la-dstebz.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dstebz.lo `test -f 'lapack/dstebz.c' || echo '$(srcdir)/'`lapack/dstebz.c
+
+liblapack_la-dlaebz.lo: lapack/dlaebz.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaebz.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaebz.Tpo -c -o liblapack_la-dlaebz.lo `test -f 'lapack/dlaebz.c' || echo '$(srcdir)/'`lapack/dlaebz.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaebz.Tpo $(DEPDIR)/liblapack_la-dlaebz.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaebz.c' object='liblapack_la-dlaebz.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaebz.lo `test -f 'lapack/dlaebz.c' || echo '$(srcdir)/'`lapack/dlaebz.c
+
+liblapack_la-dstein.lo: lapack/dstein.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dstein.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dstein.Tpo -c -o liblapack_la-dstein.lo `test -f 'lapack/dstein.c' || echo '$(srcdir)/'`lapack/dstein.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dstein.Tpo $(DEPDIR)/liblapack_la-dstein.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstein.c' object='liblapack_la-dstein.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dstein.lo `test -f 'lapack/dstein.c' || echo '$(srcdir)/'`lapack/dstein.c
+
+liblapack_la-dlagtf.lo: lapack/dlagtf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlagtf.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlagtf.Tpo -c -o liblapack_la-dlagtf.lo `test -f 'lapack/dlagtf.c' || echo '$(srcdir)/'`lapack/dlagtf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlagtf.Tpo $(DEPDIR)/liblapack_la-dlagtf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlagtf.c' object='liblapack_la-dlagtf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlagtf.lo `test -f 'lapack/dlagtf.c' || echo '$(srcdir)/'`lapack/dlagtf.c
+
+liblapack_la-dlagts.lo: lapack/dlagts.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlagts.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlagts.Tpo -c -o liblapack_la-dlagts.lo `test -f 'lapack/dlagts.c' || echo '$(srcdir)/'`lapack/dlagts.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlagts.Tpo $(DEPDIR)/liblapack_la-dlagts.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlagts.c' object='liblapack_la-dlagts.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlagts.lo `test -f 'lapack/dlagts.c' || echo '$(srcdir)/'`lapack/dlagts.c
+
+liblapack_la-dlarnv.lo: lapack/dlarnv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarnv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarnv.Tpo -c -o liblapack_la-dlarnv.lo `test -f 'lapack/dlarnv.c' || echo '$(srcdir)/'`lapack/dlarnv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarnv.Tpo $(DEPDIR)/liblapack_la-dlarnv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarnv.c' object='liblapack_la-dlarnv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarnv.lo `test -f 'lapack/dlarnv.c' || echo '$(srcdir)/'`lapack/dlarnv.c
+
+liblapack_la-dlaruv.lo: lapack/dlaruv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaruv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaruv.Tpo -c -o liblapack_la-dlaruv.lo `test -f 'lapack/dlaruv.c' || echo '$(srcdir)/'`lapack/dlaruv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaruv.Tpo $(DEPDIR)/liblapack_la-dlaruv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaruv.c' object='liblapack_la-dlaruv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaruv.lo `test -f 'lapack/dlaruv.c' || echo '$(srcdir)/'`lapack/dlaruv.c
+
+liblapack_la-dstemr.lo: lapack/dstemr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dstemr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dstemr.Tpo -c -o liblapack_la-dstemr.lo `test -f 'lapack/dstemr.c' || echo '$(srcdir)/'`lapack/dstemr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dstemr.Tpo $(DEPDIR)/liblapack_la-dstemr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dstemr.c' object='liblapack_la-dstemr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dstemr.lo `test -f 'lapack/dstemr.c' || echo '$(srcdir)/'`lapack/dstemr.c
+
+liblapack_la-dlae2.lo: lapack/dlae2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlae2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlae2.Tpo -c -o liblapack_la-dlae2.lo `test -f 'lapack/dlae2.c' || echo '$(srcdir)/'`lapack/dlae2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlae2.Tpo $(DEPDIR)/liblapack_la-dlae2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlae2.c' object='liblapack_la-dlae2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlae2.lo `test -f 'lapack/dlae2.c' || echo '$(srcdir)/'`lapack/dlae2.c
+
+liblapack_la-dlaev2.lo: lapack/dlaev2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaev2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaev2.Tpo -c -o liblapack_la-dlaev2.lo `test -f 'lapack/dlaev2.c' || echo '$(srcdir)/'`lapack/dlaev2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaev2.Tpo $(DEPDIR)/liblapack_la-dlaev2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaev2.c' object='liblapack_la-dlaev2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaev2.lo `test -f 'lapack/dlaev2.c' || echo '$(srcdir)/'`lapack/dlaev2.c
+
+liblapack_la-dlanst.lo: lapack/dlanst.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlanst.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlanst.Tpo -c -o liblapack_la-dlanst.lo `test -f 'lapack/dlanst.c' || echo '$(srcdir)/'`lapack/dlanst.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlanst.Tpo $(DEPDIR)/liblapack_la-dlanst.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlanst.c' object='liblapack_la-dlanst.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlanst.lo `test -f 'lapack/dlanst.c' || echo '$(srcdir)/'`lapack/dlanst.c
+
+liblapack_la-dlarrc.lo: lapack/dlarrc.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrc.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrc.Tpo -c -o liblapack_la-dlarrc.lo `test -f 'lapack/dlarrc.c' || echo '$(srcdir)/'`lapack/dlarrc.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrc.Tpo $(DEPDIR)/liblapack_la-dlarrc.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrc.c' object='liblapack_la-dlarrc.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrc.lo `test -f 'lapack/dlarrc.c' || echo '$(srcdir)/'`lapack/dlarrc.c
+
+liblapack_la-dlarre.lo: lapack/dlarre.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarre.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarre.Tpo -c -o liblapack_la-dlarre.lo `test -f 'lapack/dlarre.c' || echo '$(srcdir)/'`lapack/dlarre.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarre.Tpo $(DEPDIR)/liblapack_la-dlarre.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarre.c' object='liblapack_la-dlarre.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarre.lo `test -f 'lapack/dlarre.c' || echo '$(srcdir)/'`lapack/dlarre.c
+
+liblapack_la-dlarra.lo: lapack/dlarra.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarra.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarra.Tpo -c -o liblapack_la-dlarra.lo `test -f 'lapack/dlarra.c' || echo '$(srcdir)/'`lapack/dlarra.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarra.Tpo $(DEPDIR)/liblapack_la-dlarra.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarra.c' object='liblapack_la-dlarra.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarra.lo `test -f 'lapack/dlarra.c' || echo '$(srcdir)/'`lapack/dlarra.c
+
+liblapack_la-dlarrb.lo: lapack/dlarrb.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrb.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrb.Tpo -c -o liblapack_la-dlarrb.lo `test -f 'lapack/dlarrb.c' || echo '$(srcdir)/'`lapack/dlarrb.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrb.Tpo $(DEPDIR)/liblapack_la-dlarrb.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrb.c' object='liblapack_la-dlarrb.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrb.lo `test -f 'lapack/dlarrb.c' || echo '$(srcdir)/'`lapack/dlarrb.c
+
+liblapack_la-dlaneg.lo: lapack/dlaneg.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaneg.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaneg.Tpo -c -o liblapack_la-dlaneg.lo `test -f 'lapack/dlaneg.c' || echo '$(srcdir)/'`lapack/dlaneg.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaneg.Tpo $(DEPDIR)/liblapack_la-dlaneg.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaneg.c' object='liblapack_la-dlaneg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaneg.lo `test -f 'lapack/dlaneg.c' || echo '$(srcdir)/'`lapack/dlaneg.c
+
+liblapack_la-dlarrd.lo: lapack/dlarrd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrd.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrd.Tpo -c -o liblapack_la-dlarrd.lo `test -f 'lapack/dlarrd.c' || echo '$(srcdir)/'`lapack/dlarrd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrd.Tpo $(DEPDIR)/liblapack_la-dlarrd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrd.c' object='liblapack_la-dlarrd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrd.lo `test -f 'lapack/dlarrd.c' || echo '$(srcdir)/'`lapack/dlarrd.c
+
+liblapack_la-dlarrk.lo: lapack/dlarrk.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrk.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrk.Tpo -c -o liblapack_la-dlarrk.lo `test -f 'lapack/dlarrk.c' || echo '$(srcdir)/'`lapack/dlarrk.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrk.Tpo $(DEPDIR)/liblapack_la-dlarrk.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrk.c' object='liblapack_la-dlarrk.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrk.lo `test -f 'lapack/dlarrk.c' || echo '$(srcdir)/'`lapack/dlarrk.c
+
+liblapack_la-dlasq2.lo: lapack/dlasq2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasq2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasq2.Tpo -c -o liblapack_la-dlasq2.lo `test -f 'lapack/dlasq2.c' || echo '$(srcdir)/'`lapack/dlasq2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasq2.Tpo $(DEPDIR)/liblapack_la-dlasq2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasq2.c' object='liblapack_la-dlasq2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasq2.lo `test -f 'lapack/dlasq2.c' || echo '$(srcdir)/'`lapack/dlasq2.c
+
+liblapack_la-dlasq3.lo: lapack/dlasq3.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasq3.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasq3.Tpo -c -o liblapack_la-dlasq3.lo `test -f 'lapack/dlasq3.c' || echo '$(srcdir)/'`lapack/dlasq3.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasq3.Tpo $(DEPDIR)/liblapack_la-dlasq3.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasq3.c' object='liblapack_la-dlasq3.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasq3.lo `test -f 'lapack/dlasq3.c' || echo '$(srcdir)/'`lapack/dlasq3.c
+
+liblapack_la-dlasq4.lo: lapack/dlasq4.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasq4.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasq4.Tpo -c -o liblapack_la-dlasq4.lo `test -f 'lapack/dlasq4.c' || echo '$(srcdir)/'`lapack/dlasq4.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasq4.Tpo $(DEPDIR)/liblapack_la-dlasq4.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasq4.c' object='liblapack_la-dlasq4.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasq4.lo `test -f 'lapack/dlasq4.c' || echo '$(srcdir)/'`lapack/dlasq4.c
+
+liblapack_la-dlasq5.lo: lapack/dlasq5.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasq5.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasq5.Tpo -c -o liblapack_la-dlasq5.lo `test -f 'lapack/dlasq5.c' || echo '$(srcdir)/'`lapack/dlasq5.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasq5.Tpo $(DEPDIR)/liblapack_la-dlasq5.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasq5.c' object='liblapack_la-dlasq5.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasq5.lo `test -f 'lapack/dlasq5.c' || echo '$(srcdir)/'`lapack/dlasq5.c
+
+liblapack_la-dlasq6.lo: lapack/dlasq6.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasq6.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasq6.Tpo -c -o liblapack_la-dlasq6.lo `test -f 'lapack/dlasq6.c' || echo '$(srcdir)/'`lapack/dlasq6.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasq6.Tpo $(DEPDIR)/liblapack_la-dlasq6.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasq6.c' object='liblapack_la-dlasq6.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasq6.lo `test -f 'lapack/dlasq6.c' || echo '$(srcdir)/'`lapack/dlasq6.c
+
+liblapack_la-dlasrt.lo: lapack/dlasrt.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasrt.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasrt.Tpo -c -o liblapack_la-dlasrt.lo `test -f 'lapack/dlasrt.c' || echo '$(srcdir)/'`lapack/dlasrt.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasrt.Tpo $(DEPDIR)/liblapack_la-dlasrt.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasrt.c' object='liblapack_la-dlasrt.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasrt.lo `test -f 'lapack/dlasrt.c' || echo '$(srcdir)/'`lapack/dlasrt.c
+
+liblapack_la-dlarrj.lo: lapack/dlarrj.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrj.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrj.Tpo -c -o liblapack_la-dlarrj.lo `test -f 'lapack/dlarrj.c' || echo '$(srcdir)/'`lapack/dlarrj.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrj.Tpo $(DEPDIR)/liblapack_la-dlarrj.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrj.c' object='liblapack_la-dlarrj.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrj.lo `test -f 'lapack/dlarrj.c' || echo '$(srcdir)/'`lapack/dlarrj.c
+
+liblapack_la-dlarrr.lo: lapack/dlarrr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrr.Tpo -c -o liblapack_la-dlarrr.lo `test -f 'lapack/dlarrr.c' || echo '$(srcdir)/'`lapack/dlarrr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrr.Tpo $(DEPDIR)/liblapack_la-dlarrr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrr.c' object='liblapack_la-dlarrr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrr.lo `test -f 'lapack/dlarrr.c' || echo '$(srcdir)/'`lapack/dlarrr.c
+
+liblapack_la-dlarrv.lo: lapack/dlarrv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrv.Tpo -c -o liblapack_la-dlarrv.lo `test -f 'lapack/dlarrv.c' || echo '$(srcdir)/'`lapack/dlarrv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrv.Tpo $(DEPDIR)/liblapack_la-dlarrv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrv.c' object='liblapack_la-dlarrv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrv.lo `test -f 'lapack/dlarrv.c' || echo '$(srcdir)/'`lapack/dlarrv.c
+
+liblapack_la-dlar1v.lo: lapack/dlar1v.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlar1v.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlar1v.Tpo -c -o liblapack_la-dlar1v.lo `test -f 'lapack/dlar1v.c' || echo '$(srcdir)/'`lapack/dlar1v.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlar1v.Tpo $(DEPDIR)/liblapack_la-dlar1v.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlar1v.c' object='liblapack_la-dlar1v.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlar1v.lo `test -f 'lapack/dlar1v.c' || echo '$(srcdir)/'`lapack/dlar1v.c
+
+liblapack_la-dlarrf.lo: lapack/dlarrf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlarrf.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlarrf.Tpo -c -o liblapack_la-dlarrf.lo `test -f 'lapack/dlarrf.c' || echo '$(srcdir)/'`lapack/dlarrf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlarrf.Tpo $(DEPDIR)/liblapack_la-dlarrf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlarrf.c' object='liblapack_la-dlarrf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlarrf.lo `test -f 'lapack/dlarrf.c' || echo '$(srcdir)/'`lapack/dlarrf.c
+
+liblapack_la-dsterf.lo: lapack/dsterf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dsterf.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dsterf.Tpo -c -o liblapack_la-dsterf.lo `test -f 'lapack/dsterf.c' || echo '$(srcdir)/'`lapack/dsterf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dsterf.Tpo $(DEPDIR)/liblapack_la-dsterf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsterf.c' object='liblapack_la-dsterf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dsterf.lo `test -f 'lapack/dsterf.c' || echo '$(srcdir)/'`lapack/dsterf.c
+
+liblapack_la-dsytrd.lo: lapack/dsytrd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dsytrd.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dsytrd.Tpo -c -o liblapack_la-dsytrd.lo `test -f 'lapack/dsytrd.c' || echo '$(srcdir)/'`lapack/dsytrd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dsytrd.Tpo $(DEPDIR)/liblapack_la-dsytrd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsytrd.c' object='liblapack_la-dsytrd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dsytrd.lo `test -f 'lapack/dsytrd.c' || echo '$(srcdir)/'`lapack/dsytrd.c
+
+liblapack_la-dlatrd.lo: lapack/dlatrd.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlatrd.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlatrd.Tpo -c -o liblapack_la-dlatrd.lo `test -f 'lapack/dlatrd.c' || echo '$(srcdir)/'`lapack/dlatrd.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlatrd.Tpo $(DEPDIR)/liblapack_la-dlatrd.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlatrd.c' object='liblapack_la-dlatrd.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlatrd.lo `test -f 'lapack/dlatrd.c' || echo '$(srcdir)/'`lapack/dlatrd.c
+
+liblapack_la-dsytd2.lo: lapack/dsytd2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dsytd2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dsytd2.Tpo -c -o liblapack_la-dsytd2.lo `test -f 'lapack/dsytd2.c' || echo '$(srcdir)/'`lapack/dsytd2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dsytd2.Tpo $(DEPDIR)/liblapack_la-dsytd2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsytd2.c' object='liblapack_la-dsytd2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dsytd2.lo `test -f 'lapack/dsytd2.c' || echo '$(srcdir)/'`lapack/dsytd2.c
+
+liblapack_la-dlanhs.lo: lapack/dlanhs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlanhs.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlanhs.Tpo -c -o liblapack_la-dlanhs.lo `test -f 'lapack/dlanhs.c' || echo '$(srcdir)/'`lapack/dlanhs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlanhs.Tpo $(DEPDIR)/liblapack_la-dlanhs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlanhs.c' object='liblapack_la-dlanhs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlanhs.lo `test -f 'lapack/dlanhs.c' || echo '$(srcdir)/'`lapack/dlanhs.c
+
+liblapack_la-dgeqr2.lo: lapack/dgeqr2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgeqr2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgeqr2.Tpo -c -o liblapack_la-dgeqr2.lo `test -f 'lapack/dgeqr2.c' || echo '$(srcdir)/'`lapack/dgeqr2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgeqr2.Tpo $(DEPDIR)/liblapack_la-dgeqr2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgeqr2.c' object='liblapack_la-dgeqr2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgeqr2.lo `test -f 'lapack/dgeqr2.c' || echo '$(srcdir)/'`lapack/dgeqr2.c
+
+liblapack_la-dtrsen.lo: lapack/dtrsen.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dtrsen.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dtrsen.Tpo -c -o liblapack_la-dtrsen.lo `test -f 'lapack/dtrsen.c' || echo '$(srcdir)/'`lapack/dtrsen.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dtrsen.Tpo $(DEPDIR)/liblapack_la-dtrsen.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrsen.c' object='liblapack_la-dtrsen.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dtrsen.lo `test -f 'lapack/dtrsen.c' || echo '$(srcdir)/'`lapack/dtrsen.c
+
+liblapack_la-dlacn2.lo: lapack/dlacn2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlacn2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlacn2.Tpo -c -o liblapack_la-dlacn2.lo `test -f 'lapack/dlacn2.c' || echo '$(srcdir)/'`lapack/dlacn2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlacn2.Tpo $(DEPDIR)/liblapack_la-dlacn2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlacn2.c' object='liblapack_la-dlacn2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlacn2.lo `test -f 'lapack/dlacn2.c' || echo '$(srcdir)/'`lapack/dlacn2.c
+
+liblapack_la-dtrsyl.lo: lapack/dtrsyl.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dtrsyl.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dtrsyl.Tpo -c -o liblapack_la-dtrsyl.lo `test -f 'lapack/dtrsyl.c' || echo '$(srcdir)/'`lapack/dtrsyl.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dtrsyl.Tpo $(DEPDIR)/liblapack_la-dtrsyl.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrsyl.c' object='liblapack_la-dtrsyl.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dtrsyl.lo `test -f 'lapack/dtrsyl.c' || echo '$(srcdir)/'`lapack/dtrsyl.c
+
+liblapack_la-dlasr.lo: lapack/dlasr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlasr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlasr.Tpo -c -o liblapack_la-dlasr.lo `test -f 'lapack/dlasr.c' || echo '$(srcdir)/'`lapack/dlasr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlasr.Tpo $(DEPDIR)/liblapack_la-dlasr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlasr.c' object='liblapack_la-dlasr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlasr.lo `test -f 'lapack/dlasr.c' || echo '$(srcdir)/'`lapack/dlasr.c
+
+liblapack_la-dsteqr.lo: lapack/dsteqr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dsteqr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dsteqr.Tpo -c -o liblapack_la-dsteqr.lo `test -f 'lapack/dsteqr.c' || echo '$(srcdir)/'`lapack/dsteqr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dsteqr.Tpo $(DEPDIR)/liblapack_la-dsteqr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dsteqr.c' object='liblapack_la-dsteqr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dsteqr.lo `test -f 'lapack/dsteqr.c' || echo '$(srcdir)/'`lapack/dsteqr.c
+
+liblapack_la-dgeevx.lo: lapack/dgeevx.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgeevx.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgeevx.Tpo -c -o liblapack_la-dgeevx.lo `test -f 'lapack/dgeevx.c' || echo '$(srcdir)/'`lapack/dgeevx.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgeevx.Tpo $(DEPDIR)/liblapack_la-dgeevx.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgeevx.c' object='liblapack_la-dgeevx.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgeevx.lo `test -f 'lapack/dgeevx.c' || echo '$(srcdir)/'`lapack/dgeevx.c
+
+liblapack_la-dtrsna.lo: lapack/dtrsna.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dtrsna.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dtrsna.Tpo -c -o liblapack_la-dtrsna.lo `test -f 'lapack/dtrsna.c' || echo '$(srcdir)/'`lapack/dtrsna.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dtrsna.Tpo $(DEPDIR)/liblapack_la-dtrsna.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dtrsna.c' object='liblapack_la-dtrsna.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dtrsna.lo `test -f 'lapack/dtrsna.c' || echo '$(srcdir)/'`lapack/dtrsna.c
+
+liblapack_la-dlaqtr.lo: lapack/dlaqtr.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaqtr.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaqtr.Tpo -c -o liblapack_la-dlaqtr.lo `test -f 'lapack/dlaqtr.c' || echo '$(srcdir)/'`lapack/dlaqtr.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaqtr.Tpo $(DEPDIR)/liblapack_la-dlaqtr.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaqtr.c' object='liblapack_la-dlaqtr.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaqtr.lo `test -f 'lapack/dlaqtr.c' || echo '$(srcdir)/'`lapack/dlaqtr.c
+
+liblapack_la-dgetrf.lo: lapack/dgetrf.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgetrf.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgetrf.Tpo -c -o liblapack_la-dgetrf.lo `test -f 'lapack/dgetrf.c' || echo '$(srcdir)/'`lapack/dgetrf.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgetrf.Tpo $(DEPDIR)/liblapack_la-dgetrf.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgetrf.c' object='liblapack_la-dgetrf.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgetrf.lo `test -f 'lapack/dgetrf.c' || echo '$(srcdir)/'`lapack/dgetrf.c
+
+liblapack_la-dgetf2.lo: lapack/dgetf2.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgetf2.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgetf2.Tpo -c -o liblapack_la-dgetf2.lo `test -f 'lapack/dgetf2.c' || echo '$(srcdir)/'`lapack/dgetf2.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgetf2.Tpo $(DEPDIR)/liblapack_la-dgetf2.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgetf2.c' object='liblapack_la-dgetf2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgetf2.lo `test -f 'lapack/dgetf2.c' || echo '$(srcdir)/'`lapack/dgetf2.c
+
+liblapack_la-dlaswp.lo: lapack/dlaswp.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dlaswp.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dlaswp.Tpo -c -o liblapack_la-dlaswp.lo `test -f 'lapack/dlaswp.c' || echo '$(srcdir)/'`lapack/dlaswp.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dlaswp.Tpo $(DEPDIR)/liblapack_la-dlaswp.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dlaswp.c' object='liblapack_la-dlaswp.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dlaswp.lo `test -f 'lapack/dlaswp.c' || echo '$(srcdir)/'`lapack/dlaswp.c
+
+liblapack_la-dgetrs.lo: lapack/dgetrs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgetrs.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgetrs.Tpo -c -o liblapack_la-dgetrs.lo `test -f 'lapack/dgetrs.c' || echo '$(srcdir)/'`lapack/dgetrs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgetrs.Tpo $(DEPDIR)/liblapack_la-dgetrs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgetrs.c' object='liblapack_la-dgetrs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgetrs.lo `test -f 'lapack/dgetrs.c' || echo '$(srcdir)/'`lapack/dgetrs.c
+
+liblapack_la-dgesv.lo: lapack/dgesv.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-dgesv.lo -MD -MP -MF $(DEPDIR)/liblapack_la-dgesv.Tpo -c -o liblapack_la-dgesv.lo `test -f 'lapack/dgesv.c' || echo '$(srcdir)/'`lapack/dgesv.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-dgesv.Tpo $(DEPDIR)/liblapack_la-dgesv.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/dgesv.c' object='liblapack_la-dgesv.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-dgesv.lo `test -f 'lapack/dgesv.c' || echo '$(srcdir)/'`lapack/dgesv.c
+
+liblapack_la-len_trim.lo: lapack/len_trim.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -MT liblapack_la-len_trim.lo -MD -MP -MF $(DEPDIR)/liblapack_la-len_trim.Tpo -c -o liblapack_la-len_trim.lo `test -f 'lapack/len_trim.c' || echo '$(srcdir)/'`lapack/len_trim.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/liblapack_la-len_trim.Tpo $(DEPDIR)/liblapack_la-len_trim.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='lapack/len_trim.c' object='liblapack_la-len_trim.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(liblapack_la_CFLAGS) $(CFLAGS) -c -o liblapack_la-len_trim.lo `test -f 'lapack/len_trim.c' || echo '$(srcdir)/'`lapack/len_trim.c
+
+error.lo: plfit/error.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT error.lo -MD -MP -MF $(DEPDIR)/error.Tpo -c -o error.lo `test -f 'plfit/error.c' || echo '$(srcdir)/'`plfit/error.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/error.Tpo $(DEPDIR)/error.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/error.c' object='error.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o error.lo `test -f 'plfit/error.c' || echo '$(srcdir)/'`plfit/error.c
+
+gss.lo: plfit/gss.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT gss.lo -MD -MP -MF $(DEPDIR)/gss.Tpo -c -o gss.lo `test -f 'plfit/gss.c' || echo '$(srcdir)/'`plfit/gss.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/gss.Tpo $(DEPDIR)/gss.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/gss.c' object='gss.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o gss.lo `test -f 'plfit/gss.c' || echo '$(srcdir)/'`plfit/gss.c
+
+kolmogorov.lo: plfit/kolmogorov.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT kolmogorov.lo -MD -MP -MF $(DEPDIR)/kolmogorov.Tpo -c -o kolmogorov.lo `test -f 'plfit/kolmogorov.c' || echo '$(srcdir)/'`plfit/kolmogorov.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/kolmogorov.Tpo $(DEPDIR)/kolmogorov.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/kolmogorov.c' object='kolmogorov.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o kolmogorov.lo `test -f 'plfit/kolmogorov.c' || echo '$(srcdir)/'`plfit/kolmogorov.c
+
+lbfgs.lo: plfit/lbfgs.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT lbfgs.lo -MD -MP -MF $(DEPDIR)/lbfgs.Tpo -c -o lbfgs.lo `test -f 'plfit/lbfgs.c' || echo '$(srcdir)/'`plfit/lbfgs.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/lbfgs.Tpo $(DEPDIR)/lbfgs.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/lbfgs.c' object='lbfgs.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o lbfgs.lo `test -f 'plfit/lbfgs.c' || echo '$(srcdir)/'`plfit/lbfgs.c
+
+options.lo: plfit/options.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT options.lo -MD -MP -MF $(DEPDIR)/options.Tpo -c -o options.lo `test -f 'plfit/options.c' || echo '$(srcdir)/'`plfit/options.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/options.Tpo $(DEPDIR)/options.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/options.c' object='options.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o options.lo `test -f 'plfit/options.c' || echo '$(srcdir)/'`plfit/options.c
+
+plfit.lo: plfit/plfit.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT plfit.lo -MD -MP -MF $(DEPDIR)/plfit.Tpo -c -o plfit.lo `test -f 'plfit/plfit.c' || echo '$(srcdir)/'`plfit/plfit.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/plfit.Tpo $(DEPDIR)/plfit.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/plfit.c' object='plfit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o plfit.lo `test -f 'plfit/plfit.c' || echo '$(srcdir)/'`plfit/plfit.c
+
+zeta.lo: plfit/zeta.c
+@am__fastdepCC_TRUE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT zeta.lo -MD -MP -MF $(DEPDIR)/zeta.Tpo -c -o zeta.lo `test -f 'plfit/zeta.c' || echo '$(srcdir)/'`plfit/zeta.c
+@am__fastdepCC_TRUE@	$(am__mv) $(DEPDIR)/zeta.Tpo $(DEPDIR)/zeta.Plo
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	source='plfit/zeta.c' object='zeta.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@	DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@	$(LIBTOOL)  --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o zeta.lo `test -f 'plfit/zeta.c' || echo '$(srcdir)/'`plfit/zeta.c
+
+.cc.o:
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ $<
+
+.cc.obj:
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
+
+.cc.lo:
+@am__fastdepCXX_TRUE@	$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LTCXXCOMPILE) -c -o $@ $<
+
+libigraph_la-NetDataTypes.lo: NetDataTypes.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-NetDataTypes.lo -MD -MP -MF $(DEPDIR)/libigraph_la-NetDataTypes.Tpo -c -o libigraph_la-NetDataTypes.lo `test -f 'NetDataTypes.cpp' || echo '$(srcdir)/'`NetDataTypes.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-NetDataTypes.Tpo $(DEPDIR)/libigraph_la-NetDataTypes.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='NetDataTypes.cpp' object='libigraph_la-NetDataTypes.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-NetDataTypes.lo `test -f 'NetDataTypes.cpp' || echo '$(srcdir)/'`NetDataTypes.cpp
+
+libigraph_la-NetRoutines.lo: NetRoutines.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-NetRoutines.lo -MD -MP -MF $(DEPDIR)/libigraph_la-NetRoutines.Tpo -c -o libigraph_la-NetRoutines.lo `test -f 'NetRoutines.cpp' || echo '$(srcdir)/'`NetRoutines.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-NetRoutines.Tpo $(DEPDIR)/libigraph_la-NetRoutines.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='NetRoutines.cpp' object='libigraph_la-NetRoutines.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-NetRoutines.lo `test -f 'NetRoutines.cpp' || echo '$(srcdir)/'`NetRoutines.cpp
+
+libigraph_la-clustertool.lo: clustertool.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-clustertool.lo -MD -MP -MF $(DEPDIR)/libigraph_la-clustertool.Tpo -c -o libigraph_la-clustertool.lo `test -f 'clustertool.cpp' || echo '$(srcdir)/'`clustertool.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-clustertool.Tpo $(DEPDIR)/libigraph_la-clustertool.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='clustertool.cpp' object='libigraph_la-clustertool.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-clustertool.lo `test -f 'clustertool.cpp' || echo '$(srcdir)/'`clustertool.cpp
+
+libigraph_la-pottsmodel_2.lo: pottsmodel_2.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-pottsmodel_2.lo -MD -MP -MF $(DEPDIR)/libigraph_la-pottsmodel_2.Tpo -c -o libigraph_la-pottsmodel_2.lo `test -f 'pottsmodel_2.cpp' || echo '$(srcdir)/'`pottsmodel_2.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-pottsmodel_2.Tpo $(DEPDIR)/libigraph_la-pottsmodel_2.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='pottsmodel_2.cpp' object='libigraph_la-pottsmodel_2.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-pottsmodel_2.lo `test -f 'pottsmodel_2.cpp' || echo '$(srcdir)/'`pottsmodel_2.cpp
+
+libigraph_la-walktrap.lo: walktrap.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-walktrap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-walktrap.Tpo -c -o libigraph_la-walktrap.lo `test -f 'walktrap.cpp' || echo '$(srcdir)/'`walktrap.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-walktrap.Tpo $(DEPDIR)/libigraph_la-walktrap.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='walktrap.cpp' object='libigraph_la-walktrap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-walktrap.lo `test -f 'walktrap.cpp' || echo '$(srcdir)/'`walktrap.cpp
+
+libigraph_la-walktrap_heap.lo: walktrap_heap.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-walktrap_heap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-walktrap_heap.Tpo -c -o libigraph_la-walktrap_heap.lo `test -f 'walktrap_heap.cpp' || echo '$(srcdir)/'`walktrap_heap.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-walktrap_heap.Tpo $(DEPDIR)/libigraph_la-walktrap_heap.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='walktrap_heap.cpp' object='libigraph_la-walktrap_heap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-walktrap_heap.lo `test -f 'walktrap_heap.cpp' || echo '$(srcdir)/'`walktrap_heap.cpp
+
+libigraph_la-walktrap_graph.lo: walktrap_graph.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-walktrap_graph.lo -MD -MP -MF $(DEPDIR)/libigraph_la-walktrap_graph.Tpo -c -o libigraph_la-walktrap_graph.lo `test -f 'walktrap_graph.cpp' || echo '$(srcdir)/'`walktrap_graph.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-walktrap_graph.Tpo $(DEPDIR)/libigraph_la-walktrap_graph.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='walktrap_graph.cpp' object='libigraph_la-walktrap_graph.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-walktrap_graph.lo `test -f 'walktrap_graph.cpp' || echo '$(srcdir)/'`walktrap_graph.cpp
+
+libigraph_la-walktrap_communities.lo: walktrap_communities.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-walktrap_communities.lo -MD -MP -MF $(DEPDIR)/libigraph_la-walktrap_communities.Tpo -c -o libigraph_la-walktrap_communities.lo `test -f 'walktrap_communities.cpp' || echo '$(srcdir)/'`walktrap_communities.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-walktrap_communities.Tpo $(DEPDIR)/libigraph_la-walktrap_communities.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='walktrap_communities.cpp' object='libigraph_la-walktrap_communities.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-walktrap_communities.lo `test -f 'walktrap_communities.cpp' || echo '$(srcdir)/'`walktrap_communities.cpp
+
+libigraph_la-infomap.lo: infomap.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-infomap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-infomap.Tpo -c -o libigraph_la-infomap.lo `test -f 'infomap.cc' || echo '$(srcdir)/'`infomap.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-infomap.Tpo $(DEPDIR)/libigraph_la-infomap.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='infomap.cc' object='libigraph_la-infomap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-infomap.lo `test -f 'infomap.cc' || echo '$(srcdir)/'`infomap.cc
+
+libigraph_la-infomap_Greedy.lo: infomap_Greedy.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-infomap_Greedy.lo -MD -MP -MF $(DEPDIR)/libigraph_la-infomap_Greedy.Tpo -c -o libigraph_la-infomap_Greedy.lo `test -f 'infomap_Greedy.cc' || echo '$(srcdir)/'`infomap_Greedy.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-infomap_Greedy.Tpo $(DEPDIR)/libigraph_la-infomap_Greedy.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='infomap_Greedy.cc' object='libigraph_la-infomap_Greedy.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-infomap_Greedy.lo `test -f 'infomap_Greedy.cc' || echo '$(srcdir)/'`infomap_Greedy.cc
+
+libigraph_la-infomap_Node.lo: infomap_Node.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-infomap_Node.lo -MD -MP -MF $(DEPDIR)/libigraph_la-infomap_Node.Tpo -c -o libigraph_la-infomap_Node.lo `test -f 'infomap_Node.cc' || echo '$(srcdir)/'`infomap_Node.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-infomap_Node.Tpo $(DEPDIR)/libigraph_la-infomap_Node.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='infomap_Node.cc' object='libigraph_la-infomap_Node.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-infomap_Node.lo `test -f 'infomap_Node.cc' || echo '$(srcdir)/'`infomap_Node.cc
+
+libigraph_la-infomap_FlowGraph.lo: infomap_FlowGraph.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-infomap_FlowGraph.lo -MD -MP -MF $(DEPDIR)/libigraph_la-infomap_FlowGraph.Tpo -c -o libigraph_la-infomap_FlowGraph.lo `test -f 'infomap_FlowGraph.cc' || echo '$(srcdir)/'`infomap_FlowGraph.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-infomap_FlowGraph.Tpo $(DEPDIR)/libigraph_la-infomap_FlowGraph.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='infomap_FlowGraph.cc' object='libigraph_la-infomap_FlowGraph.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-infomap_FlowGraph.lo `test -f 'infomap_FlowGraph.cc' || echo '$(srcdir)/'`infomap_FlowGraph.cc
+
+libigraph_la-bliss_orbit.lo: bliss_orbit.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_orbit.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_orbit.Tpo -c -o libigraph_la-bliss_orbit.lo `test -f 'bliss_orbit.cc' || echo '$(srcdir)/'`bliss_orbit.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_orbit.Tpo $(DEPDIR)/libigraph_la-bliss_orbit.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_orbit.cc' object='libigraph_la-bliss_orbit.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_orbit.lo `test -f 'bliss_orbit.cc' || echo '$(srcdir)/'`bliss_orbit.cc
+
+libigraph_la-bliss_eqrefhash.lo: bliss_eqrefhash.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_eqrefhash.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_eqrefhash.Tpo -c -o libigraph_la-bliss_eqrefhash.lo `test -f 'bliss_eqrefhash.cc' || echo '$(srcdir)/'`bliss_eqrefhash.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_eqrefhash.Tpo $(DEPDIR)/libigraph_la-bliss_eqrefhash.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_eqrefhash.cc' object='libigraph_la-bliss_eqrefhash.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_eqrefhash.lo `test -f 'bliss_eqrefhash.cc' || echo '$(srcdir)/'`bliss_eqrefhash.cc
+
+libigraph_la-bliss_partition.lo: bliss_partition.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_partition.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_partition.Tpo -c -o libigraph_la-bliss_partition.lo `test -f 'bliss_partition.cc' || echo '$(srcdir)/'`bliss_partition.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_partition.Tpo $(DEPDIR)/libigraph_la-bliss_partition.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_partition.cc' object='libigraph_la-bliss_partition.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_partition.lo `test -f 'bliss_partition.cc' || echo '$(srcdir)/'`bliss_partition.cc
+
+libigraph_la-bliss_graph.lo: bliss_graph.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_graph.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_graph.Tpo -c -o libigraph_la-bliss_graph.lo `test -f 'bliss_graph.cc' || echo '$(srcdir)/'`bliss_graph.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_graph.Tpo $(DEPDIR)/libigraph_la-bliss_graph.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_graph.cc' object='libigraph_la-bliss_graph.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_graph.lo `test -f 'bliss_graph.cc' || echo '$(srcdir)/'`bliss_graph.cc
+
+libigraph_la-bliss_timer.lo: bliss_timer.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_timer.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_timer.Tpo -c -o libigraph_la-bliss_timer.lo `test -f 'bliss_timer.cc' || echo '$(srcdir)/'`bliss_timer.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_timer.Tpo $(DEPDIR)/libigraph_la-bliss_timer.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_timer.cc' object='libigraph_la-bliss_timer.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_timer.lo `test -f 'bliss_timer.cc' || echo '$(srcdir)/'`bliss_timer.cc
+
+libigraph_la-bliss_heap.lo: bliss_heap.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_heap.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_heap.Tpo -c -o libigraph_la-bliss_heap.lo `test -f 'bliss_heap.cc' || echo '$(srcdir)/'`bliss_heap.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_heap.Tpo $(DEPDIR)/libigraph_la-bliss_heap.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_heap.cc' object='libigraph_la-bliss_heap.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_heap.lo `test -f 'bliss_heap.cc' || echo '$(srcdir)/'`bliss_heap.cc
+
+libigraph_la-bliss_utils.lo: bliss_utils.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss_utils.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss_utils.Tpo -c -o libigraph_la-bliss_utils.lo `test -f 'bliss_utils.cc' || echo '$(srcdir)/'`bliss_utils.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss_utils.Tpo $(DEPDIR)/libigraph_la-bliss_utils.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss_utils.cc' object='libigraph_la-bliss_utils.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss_utils.lo `test -f 'bliss_utils.cc' || echo '$(srcdir)/'`bliss_utils.cc
+
+libigraph_la-bliss.lo: bliss.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-bliss.lo -MD -MP -MF $(DEPDIR)/libigraph_la-bliss.Tpo -c -o libigraph_la-bliss.lo `test -f 'bliss.cc' || echo '$(srcdir)/'`bliss.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-bliss.Tpo $(DEPDIR)/libigraph_la-bliss.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='bliss.cc' object='libigraph_la-bliss.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-bliss.lo `test -f 'bliss.cc' || echo '$(srcdir)/'`bliss.cc
+
+libigraph_la-drl_layout.lo: drl_layout.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-drl_layout.lo -MD -MP -MF $(DEPDIR)/libigraph_la-drl_layout.Tpo -c -o libigraph_la-drl_layout.lo `test -f 'drl_layout.cpp' || echo '$(srcdir)/'`drl_layout.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-drl_layout.Tpo $(DEPDIR)/libigraph_la-drl_layout.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='drl_layout.cpp' object='libigraph_la-drl_layout.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-drl_layout.lo `test -f 'drl_layout.cpp' || echo '$(srcdir)/'`drl_layout.cpp
+
+libigraph_la-drl_parse.lo: drl_parse.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-drl_parse.lo -MD -MP -MF $(DEPDIR)/libigraph_la-drl_parse.Tpo -c -o libigraph_la-drl_parse.lo `test -f 'drl_parse.cpp' || echo '$(srcdir)/'`drl_parse.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-drl_parse.Tpo $(DEPDIR)/libigraph_la-drl_parse.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='drl_parse.cpp' object='libigraph_la-drl_parse.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-drl_parse.lo `test -f 'drl_parse.cpp' || echo '$(srcdir)/'`drl_parse.cpp
+
+libigraph_la-drl_graph.lo: drl_graph.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-drl_graph.lo -MD -MP -MF $(DEPDIR)/libigraph_la-drl_graph.Tpo -c -o libigraph_la-drl_graph.lo `test -f 'drl_graph.cpp' || echo '$(srcdir)/'`drl_graph.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-drl_graph.Tpo $(DEPDIR)/libigraph_la-drl_graph.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='drl_graph.cpp' object='libigraph_la-drl_graph.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-drl_graph.lo `test -f 'drl_graph.cpp' || echo '$(srcdir)/'`drl_graph.cpp
+
+libigraph_la-DensityGrid.lo: DensityGrid.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-DensityGrid.lo -MD -MP -MF $(DEPDIR)/libigraph_la-DensityGrid.Tpo -c -o libigraph_la-DensityGrid.lo `test -f 'DensityGrid.cpp' || echo '$(srcdir)/'`DensityGrid.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-DensityGrid.Tpo $(DEPDIR)/libigraph_la-DensityGrid.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='DensityGrid.cpp' object='libigraph_la-DensityGrid.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-DensityGrid.lo `test -f 'DensityGrid.cpp' || echo '$(srcdir)/'`DensityGrid.cpp
+
+libigraph_la-gengraph_box_list.lo: gengraph_box_list.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_box_list.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_box_list.Tpo -c -o libigraph_la-gengraph_box_list.lo `test -f 'gengraph_box_list.cpp' || echo '$(srcdir)/'`gengraph_box_list.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_box_list.Tpo $(DEPDIR)/libigraph_la-gengraph_box_list.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_box_list.cpp' object='libigraph_la-gengraph_box_list.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_box_list.lo `test -f 'gengraph_box_list.cpp' || echo '$(srcdir)/'`gengraph_box_list.cpp
+
+libigraph_la-gengraph_degree_sequence.lo: gengraph_degree_sequence.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_degree_sequence.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_degree_sequence.Tpo -c -o libigraph_la-gengraph_degree_sequence.lo `test -f 'gengraph_degree_sequence.cpp' || echo '$(srcdir)/'`gengraph_degree_sequence.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_degree_sequence.Tpo $(DEPDIR)/libigraph_la-gengraph_degree_sequence.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_degree_sequence.cpp' object='libigraph_la-gengraph_degree_sequence.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_degree_sequence.lo `test -f 'gengraph_degree_sequence.cpp' || echo '$(srcdir)/'`gengraph_degree_sequence.cpp
+
+libigraph_la-gengraph_graph_molloy_hash.lo: gengraph_graph_molloy_hash.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_graph_molloy_hash.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_graph_molloy_hash.Tpo -c -o libigraph_la-gengraph_graph_molloy_hash.lo `test -f 'gengraph_graph_molloy_hash.cpp' || echo '$(srcdir)/'`gengraph_graph_molloy_hash.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_graph_molloy_hash.Tpo $(DEPDIR)/libigraph_la-gengraph_graph_molloy_hash.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_graph_molloy_hash.cpp' object='libigraph_la-gengraph_graph_molloy_hash.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_graph_molloy_hash.lo `test -f 'gengraph_graph_molloy_hash.cpp' || echo '$(srcdir)/'`gengraph_graph_molloy_hash.cpp
+
+libigraph_la-gengraph_graph_molloy_optimized.lo: gengraph_graph_molloy_optimized.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_graph_molloy_optimized.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_graph_molloy_optimized.Tpo -c -o libigraph_la-gengraph_graph_molloy_optimized.lo `test -f 'gengraph_graph_molloy_optimized.cpp' || echo '$(srcdir)/'`gengraph_graph_molloy_optimized.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_graph_molloy_optimized.Tpo $(DEPDIR)/libigraph_la-gengraph_graph_molloy_optimized.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_graph_molloy_optimized.cpp' object='libigraph_la-gengraph_graph_molloy_optimized.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_graph_molloy_optimized.lo `test -f 'gengraph_graph_molloy_optimized.cpp' || echo '$(srcdir)/'`gengraph_graph_molloy_optimized.cpp
+
+libigraph_la-gengraph_mr-connected.lo: gengraph_mr-connected.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_mr-connected.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_mr-connected.Tpo -c -o libigraph_la-gengraph_mr-connected.lo `test -f 'gengraph_mr-connected.cpp' || echo '$(srcdir)/'`gengraph_mr-connected.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_mr-connected.Tpo $(DEPDIR)/libigraph_la-gengraph_mr-connected.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_mr-connected.cpp' object='libigraph_la-gengraph_mr-connected.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_mr-connected.lo `test -f 'gengraph_mr-connected.cpp' || echo '$(srcdir)/'`gengraph_mr-connected.cpp
+
+libigraph_la-gengraph_powerlaw.lo: gengraph_powerlaw.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_powerlaw.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_powerlaw.Tpo -c -o libigraph_la-gengraph_powerlaw.lo `test -f 'gengraph_powerlaw.cpp' || echo '$(srcdir)/'`gengraph_powerlaw.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_powerlaw.Tpo $(DEPDIR)/libigraph_la-gengraph_powerlaw.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_powerlaw.cpp' object='libigraph_la-gengraph_powerlaw.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_powerlaw.lo `test -f 'gengraph_powerlaw.cpp' || echo '$(srcdir)/'`gengraph_powerlaw.cpp
+
+libigraph_la-gengraph_random.lo: gengraph_random.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-gengraph_random.lo -MD -MP -MF $(DEPDIR)/libigraph_la-gengraph_random.Tpo -c -o libigraph_la-gengraph_random.lo `test -f 'gengraph_random.cpp' || echo '$(srcdir)/'`gengraph_random.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-gengraph_random.Tpo $(DEPDIR)/libigraph_la-gengraph_random.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='gengraph_random.cpp' object='libigraph_la-gengraph_random.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-gengraph_random.lo `test -f 'gengraph_random.cpp' || echo '$(srcdir)/'`gengraph_random.cpp
+
+libigraph_la-drl_layout_3d.lo: drl_layout_3d.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-drl_layout_3d.lo -MD -MP -MF $(DEPDIR)/libigraph_la-drl_layout_3d.Tpo -c -o libigraph_la-drl_layout_3d.lo `test -f 'drl_layout_3d.cpp' || echo '$(srcdir)/'`drl_layout_3d.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-drl_layout_3d.Tpo $(DEPDIR)/libigraph_la-drl_layout_3d.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='drl_layout_3d.cpp' object='libigraph_la-drl_layout_3d.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-drl_layout_3d.lo `test -f 'drl_layout_3d.cpp' || echo '$(srcdir)/'`drl_layout_3d.cpp
+
+libigraph_la-drl_graph_3d.lo: drl_graph_3d.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-drl_graph_3d.lo -MD -MP -MF $(DEPDIR)/libigraph_la-drl_graph_3d.Tpo -c -o libigraph_la-drl_graph_3d.lo `test -f 'drl_graph_3d.cpp' || echo '$(srcdir)/'`drl_graph_3d.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-drl_graph_3d.Tpo $(DEPDIR)/libigraph_la-drl_graph_3d.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='drl_graph_3d.cpp' object='libigraph_la-drl_graph_3d.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-drl_graph_3d.lo `test -f 'drl_graph_3d.cpp' || echo '$(srcdir)/'`drl_graph_3d.cpp
+
+libigraph_la-DensityGrid_3d.lo: DensityGrid_3d.cpp
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-DensityGrid_3d.lo -MD -MP -MF $(DEPDIR)/libigraph_la-DensityGrid_3d.Tpo -c -o libigraph_la-DensityGrid_3d.lo `test -f 'DensityGrid_3d.cpp' || echo '$(srcdir)/'`DensityGrid_3d.cpp
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-DensityGrid_3d.Tpo $(DEPDIR)/libigraph_la-DensityGrid_3d.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='DensityGrid_3d.cpp' object='libigraph_la-DensityGrid_3d.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-DensityGrid_3d.lo `test -f 'DensityGrid_3d.cpp' || echo '$(srcdir)/'`DensityGrid_3d.cpp
+
+libigraph_la-igraph_hrg_types.lo: igraph_hrg_types.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-igraph_hrg_types.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_hrg_types.Tpo -c -o libigraph_la-igraph_hrg_types.lo `test -f 'igraph_hrg_types.cc' || echo '$(srcdir)/'`igraph_hrg_types.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_hrg_types.Tpo $(DEPDIR)/libigraph_la-igraph_hrg_types.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='igraph_hrg_types.cc' object='libigraph_la-igraph_hrg_types.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-igraph_hrg_types.lo `test -f 'igraph_hrg_types.cc' || echo '$(srcdir)/'`igraph_hrg_types.cc
+
+libigraph_la-igraph_hrg.lo: igraph_hrg.cc
+@am__fastdepCXX_TRUE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -MT libigraph_la-igraph_hrg.lo -MD -MP -MF $(DEPDIR)/libigraph_la-igraph_hrg.Tpo -c -o libigraph_la-igraph_hrg.lo `test -f 'igraph_hrg.cc' || echo '$(srcdir)/'`igraph_hrg.cc
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/libigraph_la-igraph_hrg.Tpo $(DEPDIR)/libigraph_la-igraph_hrg.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='igraph_hrg.cc' object='libigraph_la-igraph_hrg.lo' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LIBTOOL)  --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(libigraph_la_CXXFLAGS) $(CXXFLAGS) -c -o libigraph_la-igraph_hrg.lo `test -f 'igraph_hrg.cc' || echo '$(srcdir)/'`igraph_hrg.cc
+
+.cpp.o:
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ $<
+
+.cpp.obj:
+@am__fastdepCXX_TRUE@	$(CXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
+
+.cpp.lo:
+@am__fastdepCXX_TRUE@	$(LTCXXCOMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
+@am__fastdepCXX_TRUE@	$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Plo
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCXX_FALSE@	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCXX_FALSE@	$(LTCXXCOMPILE) -c -o $@ $<
+
+.l.c:
+	$(am__skiplex) $(SHELL) $(YLWRAP) $< $(LEX_OUTPUT_ROOT).c $@ -- $(LEXCOMPILE)
+
+.y.c:
+	$(am__skipyacc) $(SHELL) $(YLWRAP) $< y.tab.c $@ y.tab.h $*.h y.output $*.output -- $(YACCCOMPILE)
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+install-includeHEADERS: $(include_HEADERS)
+	@$(NORMAL_INSTALL)
+	test -z "$(includedir)" || $(MKDIR_P) "$(DESTDIR)$(includedir)"
+	@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(includedir)'"; \
+	  $(INSTALL_HEADER) $$files "$(DESTDIR)$(includedir)" || exit $$?; \
+	done
+
+uninstall-includeHEADERS:
+	@$(NORMAL_UNINSTALL)
+	@list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir)
+
+ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
+	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	mkid -fID $$unique
+tags: TAGS
+
+TAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	set x; \
+	here=`pwd`; \
+	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	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
+CTAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '{ files[$$0] = 1; nonempty = 1; } \
+	      END { if (nonempty) { for (i in files) print i; }; }'`; \
+	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"
+
+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: $(BUILT_SOURCES)
+	$(MAKE) $(AM_MAKEFLAGS) check-am
+all-am: Makefile $(LTLIBRARIES) $(HEADERS)
+installdirs:
+	for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: $(BUILT_SOURCES)
+	$(MAKE) $(AM_MAKEFLAGS) 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)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+	-rm -f foreign-dl-lexer.c
+	-rm -f foreign-dl-parser.c
+	-rm -f foreign-dl-parser.h
+	-rm -f foreign-gml-lexer.c
+	-rm -f foreign-gml-parser.c
+	-rm -f foreign-gml-parser.h
+	-rm -f foreign-lgl-lexer.c
+	-rm -f foreign-lgl-parser.c
+	-rm -f foreign-lgl-parser.h
+	-rm -f foreign-ncol-lexer.c
+	-rm -f foreign-ncol-parser.c
+	-rm -f foreign-ncol-parser.h
+	-rm -f foreign-pajek-lexer.c
+	-rm -f foreign-pajek-parser.c
+	-rm -f foreign-pajek-parser.h
+	-test -z "$(BUILT_SOURCES)" || rm -f $(BUILT_SOURCES)
+	-test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES)
+clean: clean-am
+
+clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \
+	clean-noinstLTLIBRARIES mostlyclean-am
+
+distclean: distclean-am
+	-rm -rf ./$(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-includeHEADERS
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am: install-libLTLIBRARIES
+
+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 ./$(DEPDIR)
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-compile mostlyclean-generic \
+	mostlyclean-libtool
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-includeHEADERS uninstall-libLTLIBRARIES
+
+.MAKE: all check install install-am install-strip
+
+.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
+	clean-libLTLIBRARIES clean-libtool clean-noinstLTLIBRARIES \
+	ctags distclean distclean-compile distclean-generic \
+	distclean-libtool distclean-tags distdir dvi dvi-am html \
+	html-am info info-am install install-am install-data \
+	install-data-am install-dvi install-dvi-am install-exec \
+	install-exec-am install-html install-html-am \
+	install-includeHEADERS install-info install-info-am \
+	install-libLTLIBRARIES 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 mostlyclean-libtool pdf pdf-am ps ps-am \
+	tags uninstall uninstall-am uninstall-includeHEADERS \
+	uninstall-libLTLIBRARIES
+
+@INTERNAL_F2C_TRUE@  f2c/arith.h: f2c/arithchk.c
+@INTERNAL_F2C_TRUE@	$(CC) $(CFLAGS) -DNO_FPINIT f2c/arithchk.c -lm -o f2c/arith || \
+@INTERNAL_F2C_TRUE@	$(CC) -DNO_LONG_LONG $(CFLAGS) -DNO_FPINIT f2c/arithchk.c \
+@INTERNAL_F2C_TRUE@		$(WARNING_CFLAGS) -lm -o f2c/arith
+@INTERNAL_F2C_TRUE@	f2c/arith > f2c/arith.h
+@INTERNAL_F2C_TRUE@  f2c/sysdep1.h: f2c/sysdep1.h0
+@INTERNAL_F2C_TRUE@	cp f2c/sysdep1.h0 f2c/sysdep1.h
+@INTERNAL_F2C_TRUE@  f2c/signal1.h: f2c/signal1.h0
+@INTERNAL_F2C_TRUE@	cp f2c/signal1.h0 f2c/signal1.h
+
+echosources:
+	$(info $(SOURCES) $(LAPACK) $(ARPACK) $(BLAS) $(libf2c_la_SOURCES) \
+	$(libdlamch_la_SOURCES) $(libplfit_la_SOURCES))
+
+echoheaders:
+	$(info $(HEADERS_PUBLIC))
+
+echoheadersprivate:
+	$(info $(HEADERS_PRIVATE))
+
+.PHONY: sources
+
+# 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 -Nru igraph-0.6.5~quantal1/src/f2c/Notice igraph-0.6.5/src/f2c/Notice
--- igraph-0.6.5~quantal1/src/f2c/Notice	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/Notice	1970-01-01 00:00:00.000000000 +0000
@@ -1,23 +0,0 @@
-/****************************************************************
-Copyright 1990 - 1997 by AT&T, Lucent Technologies and Bellcore.
-
-Permission to use, copy, modify, and distribute this software
-and its documentation for any purpose and without fee is hereby
-granted, provided that the above copyright notice appear in all
-copies and that both that the copyright notice and this
-permission notice and warranty disclaimer appear in supporting
-documentation, and that the names of AT&T, Bell Laboratories,
-Lucent or Bellcore or any of their entities not be used in
-advertising or publicity pertaining to distribution of the
-software without specific, written prior permission.
-
-AT&T, Lucent and Bellcore disclaim all warranties with regard to
-this software, including all implied warranties of
-merchantability and fitness.  In no event shall AT&T, Lucent or
-Bellcore be liable for any special, indirect or consequential
-damages or any damages whatsoever resulting from loss of use,
-data or profits, whether in an action of contract, negligence or
-other tortious action, arising out of or in connection with the
-use or performance of this software.
-****************************************************************/
-
diff -Nru igraph-0.6.5~quantal1/src/f2c/README igraph-0.6.5/src/f2c/README
--- igraph-0.6.5~quantal1/src/f2c/README	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/README	1970-01-01 00:00:00.000000000 +0000
@@ -1,374 +0,0 @@
-As shipped, "makefile" is a copy of "makefile.u", a Unix makefile.
-Variants for other systems have names of the form makefile.* and
-have initial comments saying how to invoke them.  You may wish to
-copy one of the other makefile.* files to makefile.
-
-If you use a C++ compiler, first say
-
-	make hadd
-
-to create a suitable f2c.h from f2c.h0 and f2ch.add.  Otherwise,
-
-	make f2c.h
-
-will just copy f2c.h0 to f2c.h .
-
-If your compiler does not recognize ANSI C headers,
-compile with KR_headers defined:  either add -DKR_headers
-to the definition of CFLAGS in the makefile, or insert
-
-#define KR_headers
-
-at the top of f2c.h .
-
-If your system lacks onexit() and you are not using an ANSI C
-compiler, then you should compile main.c with NO_ONEXIT defined.
-See the comments about onexit in makefile.u.
-
-If your system has a double drem() function such that drem(a,b)
-is the IEEE remainder function (with double a, b), then you may
-wish to compile r_mod.c and d_mod.c with IEEE_drem defined.
-
-To check for transmission errors, issue the command
-	make check
-or
-	make -f makefile.u check
-
-This assumes you have the xsum program whose source, xsum.c,
-is distributed as part of "all from f2c/src", and that it
-is installed somewhere in your search path.  If you do not
-have xsum, you can obtain xsum.c by sending the following E-mail
-message to netlib@netlib.bell-labs.com
-	send xsum.c from f2c/src
-
-For convenience, the f2c.h0 in this directory is a copy of netlib's
-"f2c.h from f2c".  It is best to install f2c.h in a standard place,
-so "include f2c.h" will work in any directory without further ado.
-Beware that the makefiles do not cause recompilation when f2c.h is
-changed.
-
-On machines, such as those using a DEC Alpha processor, on which
-sizeof(short) == 2, sizeof(int) == sizeof(float) == 4, and
-sizeof(long) == sizeof(double) == 8, it suffices to modify f2c.h by
-removing the first occurrence of "long " on each line containing
-"long ".  On Unix systems, you can do this by issuing the commands
-	mv f2c.h f2c.h0
-	sed 's/long int /int /' f2c.h0 >f2c.h
-On such machines, one can enable INTEGER*8 by uncommenting the typedefs
-of longint and ulongint in f2c.h and adjusting them, so they read
-	typedef long longint;
-	typedef unsigned long ulongint;
-and by compiling libf2c with -DAllow_TYQUAD, as discussed below.
-
-
-Most of the routines in libf2c are support routines for Fortran
-intrinsic functions or for operations that f2c chooses not
-to do "in line".  There are a few exceptions, summarized below --
-functions and subroutines that appear to your program as ordinary
-external Fortran routines.
-
-If you use the REAL valued functions listed below (ERF, ERFC,
-DTIME, and ETIME) with "f2c -R", then you need to compile the
-corresponding source files with -DREAL=float.  To do this, it is
-perhaps simplest to add "-DREAL=float" to CFLAGS in the makefile.
-
-1.	CALL ABORT prints a message and causes a core dump.
-
-2.	ERF(r) and DERF(d) and the REAL and DOUBLE PRECISION
-	error functions (with x REAL and d DOUBLE PRECISION);
-	DERF must be declared DOUBLE PRECISION in your program.
-	Both ERF and DERF assume your C library provides the
-	underlying erf() function (which not all systems do).
-
-3.	ERFC(r) and DERFC(d) are the complementary error functions:
-	ERFC(r) = 1 - ERF(r) and DERFC(d) = 1.d0 - DERFC(d)
-	(except that their results may be more accurate than
-	explicitly evaluating the above formulae would give).
-	Again, ERFC and r are REAL, and DERFC and d are DOUBLE
-	PRECISION (and must be declared as such in your program),
-	and ERFC and DERFC rely on your system's erfc().
-
-4.	CALL GETARG(n,s), where n is an INTEGER and s is a CHARACTER
-	variable, sets s to the n-th command-line argument (or to
-	all blanks if there are fewer than n command-line arguments);
-	CALL GETARG(0,s) sets s to the name of the program (on systems
-	that support this feature).  See IARGC below.
-
-5.	CALL GETENV(name, value), where name and value are of type
-	CHARACTER, sets value to the environment value, $name, of
-	name (or to blanks if $name has not been set).
-
-6.	NARGS = IARGC() sets NARGS to the number of command-line
-	arguments (an INTEGER value).
-
-7.	CALL SIGNAL(n,func), where n is an INTEGER and func is an
-	EXTERNAL procedure, arranges for func to be invoked when n
-	occurs (on systems where this makes sense).
-	
-If your compiler complains about the signal calls in main.c, s_paus.c,
-and signal_.c, you may need to adjust signal1.h suitably.  See the
-comments in signal1.h.
-
-8.	ETIME(ARR) and DTIME(ARR) are REAL functions that return
-	execution times.  ARR is declared REAL ARR(2).  The elapsed
-	user and system CPU times are stored in ARR(1) and ARR(2),
-	respectively.  ETIME returns the total elapsed CPU time,
-	i.e., ARR(1) + ARR(2).  DTIME returns total elapsed CPU
-	time since the previous call on DTIME.
-
-9.	CALL SYSTEM(cmd), where cmd is of type CHARACTER, passes
-	cmd to the system's command processor (on systems where
-	this can be done).
-
-10.	CALL FLUSH flushes all buffers.
-
-11.	FTELL(i) is an INTEGER function that returns the current
-	offset of Fortran unit i (or -1 if unit i is not open).
-
-12.	CALL FSEEK(i, offset, whence, *errlab) attemps to move
-	Fortran unit i to the specified offset: absolute offset
-	if whence = 0; relative to the current offset if whence = 1;
-	relative to the end of the file if whence = 2.  It branches
-	to label errlab if unit i is not open or if the call
-	otherwise fails.
-
-The routines whose objects are makefile.u's $(I77) are for I/O.
-The following comments apply to them.
-
-If your system lacks /usr/include/local.h ,
-then you should create an appropriate local.h in
-this directory.  An appropriate local.h may simply
-be empty, or it may #define VAX or #define CRAY
-(or whatever else you must do to make fp.h work right).
-Alternatively, edit fp.h to suite your machine.
-
-If your system lacks /usr/include/fcntl.h , then you
-should simply create an empty fcntl.h in this directory.
-If your compiler then complains about creat and open not
-having a prototype, compile with OPEN_DECL defined.
-On many systems, open and creat are declared in fcntl.h .
-
-If your system's sprintf does not work the way ANSI C
-specifies -- specifically, if it does not return the
-number of characters transmitted -- then insert the line
-
-#define USE_STRLEN
-
-at the end of fmt.h .  This is necessary with
-at least some versions of Sun software.
-In particular, if you get a warning about an improper
-pointer/integer combination in compiling wref.c, then
-you need to compile with -DUSE_STRLEN .
-
-If your system's fopen does not like the ANSI binary
-reading and writing modes "rb" and "wb", then you should
-compile open.c with NON_ANSI_RW_MODES #defined.
-
-If you get error messages about references to cf->_ptr
-and cf->_base when compiling wrtfmt.c and wsfe.c or to
-stderr->_flag when compiling err.c, then insert the line
-
-#define NON_UNIX_STDIO
-
-at the beginning of fio.h, and recompile everything (or
-at least those modules that contain NON_UNIX_STDIO).
-
-Unformatted sequential records consist of a length of record
-contents, the record contents themselves, and the length of
-record contents again (for backspace).  Prior to 17 Oct. 1991,
-the length was of type int; now it is of type long, but you
-can change it back to int by inserting
-
-#define UIOLEN_int
-
-at the beginning of fio.h.  This affects only sue.c and uio.c .
-
-If you have a really ancient K&R C compiler that does not understand
-void, add -Dvoid=int to the definition of CFLAGS in the makefile.
-
-On VAX, Cray, or Research Tenth-Edition Unix systems, you may
-need to add -DVAX, -DCRAY, or -DV10 (respectively) to CFLAGS
-to make fp.h work correctly.  Alternatively, you may need to
-edit fp.h to suit your machine.
-
-If your compiler complains about the signal calls in main.c, s_paus.c,
-and signal_.c, you may need to adjust signal1.h suitably.  See the
-comments in signal1.h.
-
-You may need to supply the following non-ANSI routines:
-
-  fstat(int fileds, struct stat *buf) is similar
-to stat(char *name, struct stat *buf), except that
-the first argument, fileds, is the file descriptor
-returned by open rather than the name of the file.
-fstat is used in the system-dependent routine
-canseek (in the libf2c source file err.c), which
-is supposed to return 1 if it's possible to issue
-seeks on the file in question, 0 if it's not; you may
-need to suitably modify err.c .  On non-UNIX systems,
-you can avoid references to fstat and stat by compiling
-with NON_UNIX_STDIO defined; in that case, you may need
-to supply access(char *Name,0), which is supposed to
-return 0 if file Name exists, nonzero otherwise.
-
-  char * mktemp(char *buf) is supposed to replace the
-6 trailing X's in buf with a unique number and then
-return buf.  The idea is to get a unique name for
-a temporary file.
-
-On non-UNIX systems, you may need to change a few other,
-e.g.: the form of name computed by mktemp() in endfile.c and
-open.c; the use of the open(), close(), and creat() system
-calls in endfile.c, err.c, open.c; and the modes in calls on
-fopen() and fdopen() (and perhaps the use of fdopen() itself
--- it's supposed to return a FILE* corresponding to a given
-an integer file descriptor) in err.c and open.c (component ufmt
-of struct unit is 1 for formatted I/O -- text mode on some systems
--- and 0 for unformatted I/O -- binary mode on some systems).
-Compiling with -DNON_UNIX_STDIO omits all references to creat()
-and almost all references to open() and close(), the exception
-being in the function f__isdev() (in open.c).
-
-If you wish to use translated Fortran that has funny notions
-of record length for direct unformatted I/O (i.e., that assumes
-RECL= values in OPEN statements are not bytes but rather counts
-of some other units -- e.g., 4-character words for VMS), then you
-should insert an appropriate #define for url_Adjust at the
-beginning of open.c .  For VMS Fortran, for example,
-#define url_Adjust(x) x *= 4
-would suffice.
-
-By default, Fortran I/O units 5, 6, and 0 are pre-connected to
-stdin, stdout, and stderr, respectively.  You can change this
-behavior by changing f_init() in err.c to suit your needs.
-Note that f2c assumes READ(*... means READ(5... and WRITE(*...
-means WRITE(6... .  Moreover, an OPEN(n,... statement that does
-not specify a file name (and does not specify STATUS='SCRATCH')
-assumes FILE='fort.n' .  You can change this by editing open.c
-and endfile.c suitably.
-
-Unless you adjust the "#define MXUNIT" line in fio.h, Fortran units
-0, 1, ..., 99 are available, i.e., the highest allowed unit number
-is MXUNIT - 1.
-
-Lines protected from compilation by #ifdef Allow_TYQUAD
-are for a possible extension to 64-bit integers in which
-integer = int = 32 bits and longint = long = 64 bits.
-
-The makefile does not attempt to compile pow_qq.c, qbitbits.c,
-and qbitshft.c, which are meant for use with INTEGER*8.  To use
-INTEGER*8, you must modify f2c.h to declare longint and ulongint
-appropriately; then add $(QINT) to the end of the makefile's
-dependency list for libf2c.a (if makefile is a copy of makefile.u;
-for the PC makefiles, add pow_qq.obj qbitbits.obj qbitshft.obj
-to the library's dependency list and adjust libf2c.lbc or libf2c.sy
-accordingly).  Also add -DAllow_TYQUAD to the makefile's CFLAGS
-assignment.  To make longint and ulongint available, it may suffice
-to add -DINTEGER_STAR_8 to the CFLAGS assignment.
-
-Following Fortran 90, s_cat.c and s_copy.c allow the target of a
-(character string) assignment to be appear on its right-hand, at
-the cost of some extra overhead for all run-time concatenations.
-If you prefer the  extra efficiency that comes with the Fortran 77
-requirement that the left-hand side of a character assignment not
-be involved in the right-hand side, compile s_cat.c and s_copy.c
-with -DNO_OVERWRITE .
-
-Extensions (Feb. 1993) to NAMELIST processing:
- 1. Reading a ? instead of &name (the start of a namelist) causes
-the namelist being sought to be written to stdout (unit 6);
-to omit this feature, compile rsne.c with -DNo_Namelist_Questions.
- 2. Reading the wrong namelist name now leads to an error message
-and an attempt to skip input until the right namelist name is found;
-to omit this feature, compile rsne.c with -DNo_Bad_Namelist_Skip.
- 3. Namelist writes now insert newlines before each variable; to omit
-this feature, compile xwsne.c with -DNo_Extra_Namelist_Newlines.
- 4. (Sept. 1995) When looking for the &name that starts namelist
-input, lines whose first non-blank character is something other
-than &, $, or ? are treated as comment lines and ignored, unless
-rsne.c is compiled with -DNo_Namelist_Comments.
-
-Nonstandard extension (Feb. 1993) to open: for sequential files,
-ACCESS='APPEND' (or access='anything else starting with "A" or "a"')
-causes the file to be positioned at end-of-file, so a write will
-append to the file.
-
-Some buggy Fortran programs use unformatted direct I/O to write
-an incomplete record and later read more from that record than
-they have written.  For records other than the last, the unwritten
-portion of the record reads as binary zeros.  The last record is
-a special case: attempting to read more from it than was written
-gives end-of-file -- which may help one find a bug.  Some other
-Fortran I/O libraries treat the last record no differently than
-others and thus give no help in finding the bug of reading more
-than was written.  If you wish to have this behavior, compile
-uio.c with -DPad_UDread .
-
-If you want to be able to catch write failures (e.g., due to a
-disk being full) with an ERR= specifier, compile dfe.c, due.c,
-sfe.c, sue.c, and wsle.c with -DALWAYS_FLUSH.  This will lead to
-slower execution and more I/O, but should make ERR= work as
-expected, provided fflush returns an error return when its
-physical write fails.
-
-Carriage controls are meant to be interpreted by the UNIX col
-program (or a similar program).  Sometimes it's convenient to use
-only ' ' as the carriage control character (normal single spacing).
-If you compile lwrite.c and wsfe.c with -DOMIT_BLANK_CC, formatted
-external output lines will have an initial ' ' quietly omitted,
-making use of the col program unnecessary with output that only
-has ' ' for carriage control.
-
-The Fortran 77 Standard leaves it up to the implementation whether
-formatted writes of floating-point numbers of absolute value < 1 have
-a zero before the decimal point.  By default, libI77 omits such
-superfluous zeros, but you can cause them to appear by compiling
-lwrite.c, wref.c, and wrtfmt.c with -DWANT_LEAD_0 .
-
-If your (Unix) system lacks a ranlib command, you don't need it.
-Either comment out the makefile's ranlib invocation, or install
-a harmless "ranlib" command somewhere in your PATH, such as the
-one-line shell script
-
-	exit 0
-
-or (on some systems)
-
-	exec /usr/bin/ar lts $1 >/dev/null
-
-By default, the routines that implement complex and double complex
-division, c_div.c and z_div.c, call sig_die to print an error message
-and exit if they see a divisor of 0, as this is sometimes helpful for
-debugging.  On systems with IEEE arithmetic, compiling c_div.c and
-z_div.c with -DIEEE_COMPLEX_DIVIDE causes them instead to set both
-the real and imaginary parts of the result to +INFINITY if the
-numerator is nonzero, or to NaN if it vanishes.
-
-Nowadays most Unix and Linux systems have function
-	int ftruncate(int fildes, off_t len);
-defined in system header file unistd.h that adjusts the length of file
-descriptor fildes to length len.  Unless endfile.c is compiled with
--DNO_TRUNCATE, endfile.c #includes "unistd.h" and calls ftruncate() if
-necessary to shorten files.  If your system lacks ftruncate(), compile
-endfile.c with -DNO_TRUNCATE to make endfile.c use the older and more
-portable scheme of shortening a file by copying to a temporary file
-and back again.
-
-The initializations for "f2c -trapuv" are done by _uninit_f2c(),
-whose source is uninit.c, introduced June 2001.  On IEEE-arithmetic
-systems, _uninit_f2c should initialize floating-point variables to
-signaling NaNs and, at its first invocation, should enable the
-invalid operation exception.  Alas, the rules for distinguishing
-signaling from quiet NaNs were not specified in the IEEE P754 standard,
-nor were the precise means of enabling and disabling IEEE-arithmetic
-exceptions, and these details are thus system dependent.  There are
-#ifdef's in uninit.c that specify them for some popular systems.  If
-yours is not one of these systems, it may take some detective work to
-discover the appropriate details for your system.  Sometimes it helps
-to look in the standard include directories for header files with
-relevant-sounding names, such as ieeefp.h, nan.h, or trap.h, and
-it may be simplest to run experiments to see what distinguishes a
-signaling from a quiet NaN.  (If x is initialized to a signaling
-NaN and the invalid operation exception is masked off, as it should
-be by default on IEEE-arithmetic systems, then computing, say,
-y = x + 1 will yield a quiet NaN.)
diff -Nru igraph-0.6.5~quantal1/src/f2c/arith.h igraph-0.6.5/src/f2c/arith.h
--- igraph-0.6.5~quantal1/src/f2c/arith.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/arith.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,9 +0,0 @@
-#define IEEE_8087
-#define Arith_Kind_ASL 1
-#define Long int
-#define Intcast (int)(long)
-#define Double_Align
-#define X64_bit_pointers
-#define NANCHECK
-#define QNaN0 0x0
-#define QNaN1 0xfff80000
diff -Nru igraph-0.6.5~quantal1/src/f2c/changes igraph-0.6.5/src/f2c/changes
--- igraph-0.6.5~quantal1/src/f2c/changes	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/changes	1970-01-01 00:00:00.000000000 +0000
@@ -1,3468 +0,0 @@
-31 Aug. 1989:
-   1. A(min(i,j)) now is translated correctly (where A is an array).
-   2. 7 and 8 character variable names are allowed (but elicit a
-      complaint under -ext).
-   3. LOGICAL*1 is treated as LOGICAL, with just one error message
-      per LOGICAL*1 statement (rather than one per variable declared
-      in that statement).  [Note that LOGICAL*1 is not in Fortran 77.]
-      Like f77, f2c now allows the format in a read or write statement
-      to be an integer array.
-
-5 Sept. 1989:
-   Fixed botch in argument passing of substrings of equivalenced
-variables.
-
-15 Sept. 1989:
-   Warn about incorrect code generated when a character-valued
-function is not declared external and is passed as a parameter
-(in violation of the Fortran 77 standard) before it is invoked.
-Example:
-
-	subroutine foo(a,b)
-	character*10 a,b
-	call goo(a,b)
-	b = a(3)
-	end
-
-18 Sept. 1989:
-   Complain about overlapping initializations.
-
-20 Sept. 1989:
-   Warn about names declared EXTERNAL but never referenced;
-include such names as externs in the generated C (even
-though most C compilers will discard them).
-
-24 Sept. 1989:
-   New option -w8 to suppress complaint when COMMON or EQUIVALENCE
-forces word alignment of a double.
-   Under -A (for ANSI C), ensure that floating constants (terminated
-by 'f') contain either a decimal point or an exponent field.
-   Repair bugs sometimes encountered with CHAR and ICHAR intrinsic
-functions.
-   Restore f77's optimizations for copying and comparing character
-strings of length 1.
-   Always assume floating-point valued routines in libF77 return
-doubles, even under -R.
-   Repair occasional omission of arguments in routines having multiple
-entry points.
-   Repair bugs in computing offsets of character strings involved
-in EQUIVALENCE.
-   Don't omit structure qualification when COMMON variables are used
-as FORMATs or internal files.
-
-2 Oct. 1989:
-   Warn about variables that appear only in data stmts; don't emit them.
-   Fix bugs in character DATA for noncharacter variables
-involved in EQUIVALENCE.
-   Treat noncharacter variables initialized (at least partly) with
-character data as though they were equivalenced -- put out a struct
-and #define the variables.  This eliminates the hideous and nonportable
-numeric values that were used to initialize such variables.
-   Treat IMPLICIT NONE as IMPLICIT UNDEFINED(A-Z) .
-   Quit when given invalid options.
-
-8 Oct. 1989:
-  Modified naming scheme for generated intermediate variables;
-more are recycled, fewer distinct ones used.
-  New option -W nn specifies nn characters/word for Hollerith
-data initializing non-character variables.
-  Bug fix: x(i:min(i+10,j)) used to elicit "Can't handle opcode 31 yet".
-  Integer expressions of the form (i+const1) - (i+const2), where
-i is a scalar integer variable, are now simplified to (const1-const2);
-this leads to simpler translation of some substring expressions.
-  Initialize uninitialized portions of character string arrays to 0
-rather than to blanks.
-
-9 Oct. 1989:
-  New option -c to insert comments showing original Fortran source.
-  New option -g to insert line numbers of original Fortran source.
-
-10 Oct. 1989:
-  ! recognized as in-line comment delimiter (a la Fortran 88).
-
-24 Oct. 1989:
-  New options to ease coping with systems that want the structs
-that result from COMMON blocks to be defined just once:
-  -E causes uninitialized COMMON blocks to be declared Extern;
-if Extern is undefined, f2c.h #defines it to be extern.
-  -ec causes a separate .c file to be emitted for each
-uninitialized COMMON block: COMMON /ABC/ yields abc_com.c;
-thus one can compile *_com.c into a library to ensure
-precisely one definition.
-  -e1c is similar to -ec, except that everything goes into
-one file, along with comments that give a sed script for
-splitting the file into the pieces that -ec would give.
-This is for use with netlib's "execute f2c" service (for which
--ec is coerced into -e1c, and the sed script will put everything
-but the COMMON definitions into f2c_out.c ).
-
-28 Oct. 1989:
-  Convert "i = i op ..." into "i op= ...;" even when i is a
-dummy argument.
-
-13 Nov. 1989:
-  Name integer constants (passed as arguments) c__... rather
-than c_... so
-	common /c/stuff
-	call foo(1)
-	...
-is translated correctly.
-
-19 Nov. 1989:
-  Floating-point constants are now kept as strings unless they
-are involved in constant expressions that get simplified.  The
-floating-point constants kept as strings can have arbitrarily
-many significant figures and a very large exponent field (as
-large as long int allows on the machine on which f2c runs).
-Thus, for example, the body of
-
-	subroutine zot(x)
-	double precision x(6), pi
-	parameter (pi=3.1415926535897932384626433832795028841972)
-	x(1) = pi
-	x(2) = pi+1
-	x(3) = 9287349823749272.7429874923740978492734D-298374
-	x(4) = .89
-	x(5) = 4.0005
-	x(6) = 10D7
-	end
-
-now gets translated into
-
-    x[1] = 3.1415926535897932384626433832795028841972;
-    x[2] = 4.1415926535897931;
-    x[3] = 9.2873498237492727429874923740978492734e-298359;
-    x[4] = (float).89;
-    x[5] = (float)4.0005;
-    x[6] = 1e8;
-
-rather than the former
-
-    x[1] = 3.1415926535897931;
-    x[2] = 4.1415926535897931;
-    x[3] = 0.;
-    x[4] = (float)0.89000000000000003;
-    x[5] = (float)4.0004999999999997;
-    x[6] = 100000000.;
-
-  Recognition of f77 machine-constant intrinsics deleted, i.e.,
-epbase, epprec, epemin, epemax, eptiny, ephuge, epmrsp.
-
-22 Nov. 1989:
-  Workarounds for glitches on some Sun systems...
-  libf77: libF77/makefile modified to point out possible need
-to compile libF77/main.c with -Donexit=on_exit .
-  libi77: libI77/wref.c (and libI77/README) modified so non-ANSI
-systems can compile with USE_STRLEN defined, which will cause
-	sprintf(b = buf, "%#.*f", d, x);
-	n = strlen(b) + d1;
-rather than
-	n = sprintf(b = buf, "%#.*f", d, x) + d1;
-to be compiled.
-
-26 Nov. 1989:
-  Longer names are now accepted (up to 50 characters); names may
-contain underscores (in which case they will have two underscores
-appended, to avoid clashes with library names).
-
-28 Nov. 1989:
-  libi77 updated:
-	1. Allow 3 (or, on Crays, 4) digit exponents under format Ew.d .
-	2. Try to get things right on machines where ints have 16 bits.
-
-29 Nov. 1989:
-  Supplied missing semicolon in parameterless subroutines that
-have multiple entry points (all of them parameterless).
-
-30 Nov. 1989:
-  libf77 and libi77 revised to use types from f2c.h.
-  f2c now types floating-point valued C library routines as "double"
-rather than "doublereal" (for use with nonstandard C compilers for
-which "double" is IEEE double extended).
-
-1 Dec. 1989:
-  f2c.h updated to eliminate #defines rendered unnecessary (and,
-indeed, dangerous) by change of 26 Nov. to long names possibly
-containing underscores.
-  libi77 further revised: yesterday's change omitted two tweaks to fmt.h
-(tweaks which only matter if float and real or double and doublereal are
-different types).
-
-2 Dec. 1989:
-  Better error message (than "bad tag") for NAMELIST, which no longer
-inhibits C output.
-
-4 Dec. 1989:
-  Allow capital letters in hex constants (f77 extension; e.g.,
-x'a012BCd', X'A012BCD' and x'a012bcd' are all treated as the integer
-167848909).
-  libi77 further revised: lio.c lio.h lread.c wref.c wrtfmt.c tweaked
-again to allow float and real or double and doublereal to be different.
-
-6 Dec. 1989:
-  Revised f2c.h -- required for the following...
-  Simpler looking translations for abs, min, max, using #defines in
-revised f2c.h .
-  libi77: more corrections to types; additions for NAMELIST.
-  Corrected casts in some I/O calls.
-  Translation of NAMELIST; libi77 must still be revised.  Currently
-libi77 gives you a run-time error message if you attempt NAMELIST I/O.
-
-7 Dec. 1989:
-  Fixed bug that prevented local integer variables that appear in DATA
-stmts from being ASSIGNed statement labels.
-  Fillers (for DATA statements initializing EQUIVALENCEd variables and
-variables in COMMON) typed integer rather than doublereal (for slightly
-more portability, e.g. to Crays).
-  libi77: missing return values supplied in a few places; some tests
-reordered for better working on the Cray.
-  libf77: better accuracy for complex divide, complex square root,
-real mod function (casts to double; double temporaries).
-
-9 Dec. 1989:
-  Fixed bug that caused needless (albeit harmless) empty lines to be
-inserted in the C output when a comment line contained trailing blanks.
-  Further tweak to type of fillers: allow doublereal fillers if the
-struct has doublereal data.
-
-11 Dec. 1989:
-  Alteration of rule for producing external (C) names from names that
-contain underscores.  Now the external name is always obtained by
-appending a pair of underscores.
-
-12 Dec. 1989:
-  C production inhibited after most errors.
-
-15 Dec. 1989:
-  Fixed bug in headers for subroutines having two or more character
-strings arguments:  the length arguments were reversed.
-
-19 Dec. 1989:
-  f2c.h libf77 libi77: adjusted so #undefs in f2c.h should not foil
-compilation of libF77 and libI77.
-  libf77: getenv_ adjusted to work with unsorted environments.
-  libi77: the iostat= specifier should now work right with internal I/O.
-
-20 Dec. 1989:
-  f2c bugs fixed: In the absence of an err= specifier, the iostat=
-specifier was generally set wrong.  Character strings containing
-explicit nulls (\0) were truncated at the first null.
-  Unlabeled DO loops recognized; must be terminated by ENDDO.
-(Don't ask for CYCLE, EXIT, named DO loops, or DO WHILE.)
-
-29 Dec. 1989:
-  Nested unlabeled DO loops now handled properly; new warning for
-extraneous text at end of FORMAT.
-
-30 Dec. 1989:
-  Fixed bug in translating dble(real(...)), dble(sngl(...)), and
-dble(float(...)), where ... is either of type double complex or
-is an expression requiring assignment to intermediate variables (e.g.,
-dble(real(foo(x+1))), where foo is a function and x is a variable).
-Regard nonblank label fields on continuation lines as an error.
-
-3 Jan. 1990:
-  New option -C++ yields output that should be understood
-by C++ compilers.
-
-6 Jan. 1989:
-  -a now excludes variables that appear in a namelist from those
-that it makes automatic.  (As before, it also excludes variables
-that appear in a common, data, equivalence, or save statement.)
-  The syntactically correct Fortran
-	read(*,i) x
-	end
-now yields syntactically correct C (even though both the Fortran
-and C are buggy -- no FORMAT has not been ASSIGNed to i).
-
-7 Jan. 1990:
-  libi77: routines supporting NAMELIST added.  Surrounding quotes
-made optional when no ambiguity arises in a list or namelist READ
-of a character-string value.
-
-9 Jan. 1990:
-  f2c.src made available.
-
-16 Jan. 1990:
-  New options -P to produce ANSI C or C++ prototypes for procedures
-defined.  Change to -A and -C++: f2c tries to infer prototypes for
-invoked procedures unless the new -!P option is given.  New warning
-messages for inconsistent calling sequences among procedures within
-a single file.  Most of f2c/src is affected.
-  f2c.h: typedefs for procedure arguments added; netlib's f2c service
-will insert appropriate typedefs for use with older versions of f2c.h.
-
-17 Jan. 1990:
-  f2c/src: defs.h exec.c format.c proc.c putpcc.c version.c xsum0.out
-updated.  Castargs and protofile made extern in defs.h; exec.c
-modified so superfluous else clauses are diagnosed; unused variables
-omitted from declarations in format.c proc.c putpcc.c .
-
-21 Jan. 1990:
-  No C emitted for procedures declared external but not referenced.
-  f2c.h: more new types added for use with -P.
-  New feature: f2c accepts as arguments files ending in .p or .P;
-such files are assumed to be prototype files, such as produced by
-the -P option.  All prototype files are read before any Fortran files
-and apply globally to all Fortran files.  Suitable prototypes help f2c
-warn about calling-sequence errors and can tell f2c how to type
-procedures declared external but not explicitly typed; the latter is
-mainly of interest for users of the -A and -C++ options.  (Prototype
-arguments are not available to netlib's "execute f2c" service.)
-  New option -it tells f2c to try to infer types of untyped external
-arguments from their use as parameters to prototyped or previously
-defined procedures.
-  f2c/src: many minor cleanups; most modules changed.  Individual
-files in f2c/src are now in "bundle" format.  The former f2c.1 is
-now f2c.1t; "f2c.1t from f2c" and "f2c.1t from f2c/src" are now the
-same, as are "f2c.1 from f2c" and "f2c.1 from f2c/src".  People who
-do not obtain a new copy of "all from f2c/src" should at least add
-	fclose(sortfp);
-after the call on do_init_data(outfile, sortfp) in format_data.c .
-
-22 Jan. 1990:
-  Cleaner man page wording (thanks to Doug McIlroy).
-  -it now also applies to all untyped EXTERNAL procedures, not just
-arguments.
-
-23 Jan. 01:34:00 EST 1990:
-  Bug fixes: under -A and -C++, incorrect C was generated for
-subroutines having multiple entries but no arguments.
-  Under -A -P, subroutines of no arguments were given prototype
-calling sequence () rather than (void).
-  Character-valued functions elicited erroneous warning messages
-about inconsistent calling sequences when referenced by another
-procedure in the same file.
-  f2c.1t: omit first appearance of libF77.a in FILES section;
-load order of libraries is -lF77 -lI77, not vice versa (bug
-introduced in yesterday's edits); define .F macro for those whose
--man lacks it.  (For a while after yesterday's fixes were posted,
-f2c.1t was out of date.  Sorry!)
-
-23 Jan. 9:53:24 EST 1990:
-  Character substring expressions involving function calls having
-character arguments (including the intrinsic len function) yielded
-incorrect C.
-  Procedures defined after invocation (in the same file) with
-conflicting argument types also got an erroneous message about
-the wrong number of arguments.
-
-24 Jan. 11:44:00 EST 1990:
-  Bug fixes: -p omitted #undefs; COMMON block names containing
-underscores had their C names incorrectly computed; a COMMON block
-having the name of a previously defined procedure wreaked havoc;
-if all arguments were .P files, f2c tried reading the second as a
-Fortran file.
-  New feature: -P emits comments showing COMMON block lengths, so one
-can get warnings of incompatible COMMON block lengths by having f2c
-read .P (or .p) files.  Now by running f2c twice, first with -P -!c
-(or -P!c),  then with *.P among the arguments, you can be warned of
-inconsistent COMMON usage, and COMMON blocks having inconsistent
-lengths will be given the maximum length.  (The latter always did
-happen within each input file; now -P lets you extend this behavior
-across files.)
-
-26 Jan. 16:44:00 EST 1990:
-  Option -it made less aggressive: untyped external procedures that
-are invoked are now typed by the rules of Fortran, rather than by
-previous use of procedures to which they are passed as arguments
-before being invoked.
-  Option -P now includes information about references, i.e., called
-procedures, in the prototype files (in the form of special comments).
-This allows iterative invocations of f2c to infer more about untyped
-external names, particularly when multiple Fortran files are involved.
-  As usual, there are some obscure bug fixes:
-1.  Repair of erroneous warning messages about inconsistent number of
-arguments that arose when a character dummy parameter was discovered
-to be a function or when multiple entry points involved character
-variables appearing in a previous entry point.
-2.  Repair of memory fault after error msg about "adjustable character
-function".
-3.  Under -U, allow MAIN_ as a subroutine name (in the same file as a
-main program).
-4.  Change for consistency: a known function invoked as a subroutine,
-then as a function elicits a warning rather than an error.
-
-26 Jan. 22:32:00 EST 1990:
-  Fixed two bugs that resulted in incorrect C for substrings, within
-the body of a character-valued function, of the function's name, when
-those substrings were arguments to another function (even implicitly,
-as in character-string assignment).
-
-28 Jan. 18:32:00 EST 1990:
-  libf77, libi77: checksum files added; "make check" looks for
-transmission errors.  NAMELIST read modified to allow $ rather than &
-to precede a namelist name, to allow $ rather than / to terminate
-input where the name of another variable would otherwise be expected,
-and to regard all nonprinting ASCII characters <= ' ' as spaces.
-
-29 Jan. 02:11:00 EST 1990:
-  "fc from f2c" added.
-  -it option made the default; -!it turns it off.  Type information is
-now updated in a previously missed case.
-  -P option tweaked again; message about when rerunning f2c may change
-prototypes or declarations made more accurate.
-  New option -Ps implies -P and returns exit status 4 if rerunning
-f2c -P with prototype inputs might change prototypes or declarations.
-Now you can execute a crude script like
-
-	cat *.f >zap.F
-	rm -f zap.P
-	while :; do
-		f2c -Ps -!c zap.[FP]
-		case $? in 4) ;; *) break;; esac
-		done
-
-to get a file zap.P of the best prototypes f2c can determine for *.f .
-
-Jan. 29 07:30:21 EST 1990:
-  Forgot to check for error status when setting return code 4 under -Ps;
-error status (1, 2, 3, or, for caught signal, 126) now takes precedence.
-
-Jan 29 14:17:00 EST 1990:
-  Incorrect handling of
-	open(n,'filename')
-repaired -- now treated as
-	open(n,file='filename')
-(and, under -ext, given an error message).
-  New optional source file memset.c for people whose systems don't
-provide memset, memcmp, and memcpy; #include <string.h> in mem.c
-changed to #include "string.h" so BSD people can create a local
-string.h that simply says #include <strings.h> .
-
-Jan 30 10:34:00 EST 1990:
-  Fix erroneous warning at end of definition of a procedure with
-character arguments when the procedure had previously been called with
-a numeric argument instead of a character argument.  (There were two
-warnings, the second one incorrectly complaining of a wrong number of
-arguments.)
-
-Jan 30 16:29:41 EST 1990:
-  Fix case where -P and -Ps erroneously reported another iteration
-necessary.  (Only harm is the extra iteration.)
-
-Feb 3 01:40:00 EST 1990:
-  Supply semicolon occasionally omitted under -c .
-  Try to force correct alignment when numeric variables are initialized
-with character data (a non-standard and non-portable practice).  You
-must use the -W option if your code has such data statements and is
-meant to run on a machine with other than 4 characters/word; e.g., for
-code meant to run on a Cray, you would specify -W8 .
-  Allow parentheses around expressions in output lists (in write and
-print statements).
-  Rename source files so their names are <= 12 characters long
-(so there's room to append .Z and still have <= 14 characters);
-renamed files:  formatdata.c niceprintf.c niceprintf.h safstrncpy.c .
-  f2c material made available by anonymous ftp from research.att.com
-(look in dist/f2c ).
-
-Feb 3 03:49:00 EST 1990:
-  Repair memory fault that arose from use (in an assignment or
-call) of a non-argument variable declared CHARACTER*(*).
-
-Feb 9 01:35:43 EST 1990:
-  Fix erroneous error msg about bad types in
-	subroutine foo(a,adim)
-	dimension a(adim)
-	integer adim
-  Fix improper passing of character args (and possible memory fault)
-in the expression part of a computed goto.
-  Fix botched calling sequences in array references involving
-functions having character args.
-  Fix memory fault caused by invocation of character-valued functions
-of no arguments.
-  Fix botched calling sequence of a character*1-valued function
-assigned to a character*1 variable.
-  Fix bug in error msg for inconsistent number of args in prototypes.
-  Allow generation of C output despite inconsistencies in prototypes,
-but give exit code 8.
-  Simplify include logic (by removing some bogus logic); never
-prepend "/usr/include/" to file names.
-  Minor cleanups (that should produce no visible change in f2c's
-behavior) in intr.c parse.h main.c defs.h formatdata.c p1output.c .
-
-Feb 10 00:19:38 EST 1990:
-  Insert (integer) casts when floating-point expressions are used
-as subscripts.
-  Make SAVE stmt (with no variable list) override -a .
-  Minor cleanups: change field to Field in struct Addrblock (for the
-benefit of buggy C compilers); omit system("/bin/cp ...") in misc.c .
-
-Feb 13 00:39:00 EST 1990:
-  Error msg fix in gram.dcl: change "cannot make %s parameter"
-to "cannot make into parameter".
-
-Feb 14 14:02:00 EST 1990:
-  Various cleanups (invisible on systems with 4-byte ints), thanks
-to Dave Regan: vaxx.c eliminated; %d changed to %ld various places;
-external names adjusted for the benefit of stupid systems (that ignore
-case and recognize only 6 significant characters in external names);
-buffer shortened in xsum.c (e.g. for MS-DOS); fopen modes distinguish
-text and binary files; several unused functions eliminated; missing
-arg supplied to an unlikely fatalstr invocation.
-
-Thu Feb 15 19:15:53 EST 1990:
-  More cleanups (invisible on systems with 4 byte ints); casts inserted
-so most complaints from cyntax(1) and lint(1) go away; a few (int)
-versus (long) casts corrected.
-
-Fri Feb 16 19:55:00 EST 1990:
-  Recognize and translate unnamed Fortran 8x do while statements.
-  Fix bug that occasionally caused improper breaking of character
-strings.
-  New error message for attempts to provide DATA in a type-declaration
-statement.
-
-Sat Feb 17 11:43:00 EST 1990:
-  Fix infinite loop clf -> Fatal -> done -> clf after I/O error.
-  Change "if (addrp->vclass = CLPROC)" to "if (addrp->vclass == CLPROC)"
-in p1_addr (in p1output.c); this was probably harmless.
-  Move a misplaced } in lex.c (which slowed initkey()).
-  Thanks to Gary Word for pointing these things out.
-
-Sun Feb 18 18:07:00 EST 1990:
-  Detect overlapping initializations of arrays and scalar variables
-in previously missed cases.
-  Treat logical*2 as logical (after issuing a warning).
-  Don't pass string literals to p1_comment().
-  Correct a cast (introduced 16 Feb.) in gram.expr; this matters e.g.
-on a Cray.
-  Attempt to isolate UNIX-specific things in sysdep.c (a new source
-file).  Unless sysdep.c is compiled with SYSTEM_SORT defined, the
-intermediate files created for DATA statements are now sorted in-core
-without invoking system().
-
-Tue Feb 20 16:10:35 EST 1990:
-  Move definition of binread and binwrite from init.c to sysdep.c .
-  Recognize Fortran 8x tokens < <= == >= > <> as synonyms for
-.LT. .LE. .EQ. .GE. .GT. .NE.
-  Minor cleanup in putpcc.c:  fully remove simoffset().
-  More discussion of system dependencies added to libI77/README.
-
-Tue Feb 20 21:44:07 EST 1990:
-  Minor cleanups for the benefit of EBCDIC machines -- try to remove
-the assumption that 'a' through 'z' are contiguous.  (Thanks again to
-Gary Word.)  Also, change log2 to log_2 (shouldn't be necessary).
-
-Wed Feb 21 06:24:56 EST 1990:
-  Fix botch in init.c introduced in previous change; only matters
-to non-ASCII machines.
-
-Thu Feb 22 17:29:12 EST 1990:
-  Allow several entry points to mention the same array.  Protect
-parameter adjustments with if's (for the case that an array is not
-an argument to all entrypoints).
-  Under -u, allow
-	subroutine foo(x,n)
-	real x(n)
-	integer n
-  Compute intermediate variables used to evaluate dimension expressions
-at the right time.  Example previously mistranslated:
-	subroutine foo(x,k,m,n)
-	real x(min(k,m,n))
-	...
-	write(*,*) x
-  Detect duplicate arguments.  (The error msg points to the first
-executable stmt -- not wonderful, but not worth fixing.)
-  Minor cleanup of min/max computation (sometimes slightly simpler).
-
-Sun Feb 25 09:39:01 EST 1990:
-  Minor tweak to multiple entry points: protect parameter adjustments
-with if's only for (array) args that do not appear in all entry points.
-  Minor tweaks to format.c and io.c (invisible unless your compiler
-complained at the duplicate #defines of IOSUNIT and IOSFMT or at
-comparisons of p1gets(...) with NULL).
-
-Sun Feb 25 18:40:10 EST 1990:
-  Fix bug introduced Feb. 22: if a subprogram contained DATA and the
-first executable statement was labeled, then the label got lost.
-(Just change INEXEC to INDATA in p1output.c; it occurs just once.)
-
-Mon Feb 26 17:45:10 EST 1990:
-  Fix bug in handling of " and ' in comments.
-
-Wed Mar 28 01:43:06 EST 1990:
-libI77:
- 1. Repair nasty I/O bug: opening two files and closing the first
-(after possibly reading or writing it), then writing the second caused
-the last buffer of the second to be lost.
- 2. Formatted reads of logical values treated all letters other than
-t or T as f (false).
- libI77 files changed: err.c rdfmt.c Version.c
- (Request "libi77 from f2c" -- you can't get these files individually.)
-
-f2c itself:
-  Repair nasty bug in translation of
-	ELSE IF (condition involving complicated abs, min, or max)
--- auxiliary statements were emitted at the wrong place.
-  Supply semicolon previously omitted from the translation of a label
-(of a CONTINUE) immediately preceding an ELSE IF or an ELSE.  This
-bug made f2c produce invalid C.
-  Correct a memory fault that occurred (on some machines) when the
-error message "adjustable dimension on non-argument" should be given.
-  Minor tweaks to remove some harmless warnings by overly chatty C
-compilers.
-  Argument arays having constant dimensions but a variable lower bound
-(e.g., x(n+1:n+3)) had a * omitted from scalar arguments involved in
-the array offset computation.
-
-Wed Mar 28 18:47:59 EST 1990:
-libf77: add exit(0) to end of main [return(0) encounters a Cray bug]
-
-Sun Apr  1 16:20:58 EDT 1990:
-  Avoid dereferencing null when processing equivalences after an error.
-
-Fri Apr  6 08:29:49 EDT 1990:
-  Calls involving alternate return specifiers omitted processing
-needed for things like min, max, abs, and // (concatenation).
-  INTEGER*2 PARAMETERs were treated as INTEGER*4.
-  Convert some O(n^2) parsing to O(n).
-
-Tue Apr 10 20:07:02 EDT 1990:
-  When inconsistent calling sequences involve differing numbers of
-arguments, report the first differing argument rather than the numbers
-of arguments.
-  Fix bug under -a: formatted I/O in which either the unit or the
-format was a local character variable sometimes resulted in invalid C
-(a static struct initialized with an automatic component).
-  Improve error message for invalid flag after elided -.
-  Complain when literal table overflows, rather than infinitely
-looping.  (The complaint mentions the new and otherwise undocumented
--NL option for specifying a larger literal table.)
-  New option -h for forcing strings to word (or, with -hd, double-word)
-boundaries where possible.
-  Repair a bug that could cause improper splitting of strings.
-  Fix bug (cast of c to doublereal) in
-	subroutine foo(c,r)
-	double complex c
-	double precision r
-	c = cmplx(r,real(c))
-	end
-  New include file "sysdep.h" has some things from defs.h (and
-elsewhere) that one may need to modify on some systems.
-  Some large arrays that were previously statically allocated are now
-dynamically allocated when f2c starts running.
-  f2c/src files changed:
-	README cds.c defs.h f2c.1 f2c.1t format.c formatdata.c init.c
-	io.c lex.c main.c makefile mem.c misc.c names.c niceprintf.c
-	output.c parse_args.c pread.c put.c putpcc.c sysdep.h
-	version.c xsum0.out
-
-Wed Apr 11 18:27:12 EDT 1990:
-  Fix bug in argument consistency checking of character, complex, and
-double complex valued functions.  If the same source file contained a
-definition of such a function with arguments not explicitly typed,
-then subsequent references to the function might get erroneous
-warnings of inconsistent calling sequences.
-  Tweaks to sysdep.h for partially ANSI systems.
-  New options -kr and -krd cause f2c to use temporary variables to
-enforce Fortran evaluation-order rules with pernicious, old-style C
-compilers that apply the associative law to floating-point operations.
-
-Sat Apr 14 15:50:15 EDT 1990:
-  libi77: libI77 adjusted to allow list-directed and namelist I/O
-of internal files; bug in namelist I/O of logical and character arrays
-fixed; list input of complex numbers adjusted to permit d or D to
-denote the start of the exponent field of a component.
-  f2c itself: fix bug in handling complicated lower-bound
-expressions for character substrings; e.g., min and max did not work
-right, nor did function invocations involving character arguments.
-  Switch to octal notation, rather than hexadecimal, for nonprinting
-characters in character and string constants.
-  Fix bug (when neither -A nor -C++ was specified) in typing of
-external arguments of type complex, double complex, or character:
-	subroutine foo(c)
-	external c
-	complex c
-now results in
-	/* Complex */ int (*c) ();
-(as, indeed, it once did) rather than
-	complex (*c) ();
-
-Sat Apr 14 22:50:39 EDT 1990:
-  libI77/makefile: updated "make check" to omit lio.c
-  lib[FI]77/makefile: trivial change: define CC = cc, reference $(CC).
-  (Request, e.g., "libi77 from f2c" -- you can't ask for individual
-files from lib[FI]77.)
-
-Wed Apr 18 00:56:37 EDT 1990:
-  Move declaration of atof() from defs.h to sysdep.h, where it is
-now not declared if stdlib.h is included.  (NeXT's stdlib.h has a
-#define atof that otherwise wreaks havoc.)
-  Under -u, provide a more intelligible error message (than "bad tag")
-for an attempt to define a function without specifying its type.
-
-Wed Apr 18 17:26:27 EDT 1990:
-  Recognize \v (vertical tab) in Hollerith as well as quoted strings;
-add recognition of \r (carriage return).
-  New option -!bs turns off recognition of escapes in character strings
-(\0, \\, \b, \f, \n, \r, \t, \v).
-  Move to sysdep.c initialization of some arrays whose initialization
-assumed ASCII; #define Table_size in sysdep.h rather than using
-hard-coded 256 in allocating arrays of size 1 << (bits/byte).
-
-Thu Apr 19 08:13:21 EDT 1990:
-  Warn when escapes would make Hollerith extend beyond statement end.
-  Omit max() definition from misc.c (should be invisible except on
-systems that erroneously #define max in stdlib.h).
-
-Mon Apr 23 22:24:51 EDT 1990:
-  When producing default-style C (no -A or -C++), cast switch
-expressions to (int).
-  Move "-lF77 -lI77 -lm -lc" to link_msg, defined in sysdep.c .
-  Add #define scrub(x) to sysdep.h, with invocations in format.c and
-formatdata.c, so that people who have systems like VMS that would
-otherwise create multiple versions of intermediate files can
-#define scrub(x) unlink(x)
-
-Tue Apr 24 18:28:36 EDT 1990:
-  Pass string lengths once rather than twice to a function of character
-arguments involved in comparison of character strings of length 1.
-
-Fri Apr 27 13:11:52 EDT 1990:
-  Fix bug that made f2c gag on concatenations involving char(...) on
-some systems.
-
-Sat Apr 28 23:20:16 EDT 1990:
-  Fix control-stack bug in
-	if(...) then
-	else if (complicated condition)
-	else
-	endif
-(where the complicated condition causes assignment to an auxiliary
-variable, e.g., max(a*b,c)).
-
-Mon Apr 30 13:30:10 EDT 1990:
-  Change fillers for DATA with holes from substructures to arrays
-(in an attempt to make things work right with C compilers that have
-funny padding rules for substructures, e.g., Sun C compilers).
-  Minor cleanup of exec.c (should not affect generated C).
-
-Mon Apr 30 23:13:51 EDT 1990:
-  Fix bug in handling return values of functions having multiple
-entry points of differing return types.
-
-Sat May  5 01:45:18 EDT 1990:
-  Fix type inference bug in
-	subroutine foo(x)
-	call goo(x)
-	end
-	subroutine goo(i)
-	i = 3
-	end
-Instead of warning of inconsistent calling sequences for goo,
-f2c was simply making i a real variable; now i is correctly
-typed as an integer variable, and f2c issues an error message.
-  Adjust error messages issued at end of declarations so they
-don't blame the first executable statement.
-
-Sun May  6 01:29:07 EDT 1990:
-  Fix bug in -P and -Ps: warn when the definition of a subprogram adds
-information that would change prototypes or previous declarations.
-
-Thu May 10 18:09:15 EDT 1990:
-  Fix further obscure bug with (default) -it: inconsistent calling
-sequences and I/O statements could interact to cause a memory fault.
-Example:
-      SUBROUTINE FOO
-      CALL GOO(' Something') ! Forgot integer first arg
-      END
-      SUBROUTINE GOO(IUNIT,MSG)
-      CHARACTER*(*)MSG
-      WRITE(IUNIT,'(1X,A)') MSG
-      END
-
-Fri May 11 16:49:11 EDT 1990:
-  Under -!c, do not delete any .c files (when there are errors).
-  Avoid dereferencing 0 when a fatal error occurs while reading
-Fortran on stdin.
-
-Wed May 16 18:24:42 EDT 1990:
-  f2c.ps made available.
-
-Mon Jun  4 12:53:08 EDT 1990:
-  Diagnose I/O units of invalid type.
-  Add specific error msg about dummy arguments in common.
-
-Wed Jun 13 12:43:17 EDT 1990:
-  Under -A, supply a missing "[1]" for CHARACTER*1 variables that appear
-both in a DATA statement and in either COMMON or EQUIVALENCE.
-
-Mon Jun 18 16:58:31 EDT 1990:
-  Trivial updates to f2c.ps .  ("Fortran 8x" --> "Fortran 90"; omit
-"(draft)" from "(draft) ANSI C".)
-
-Tue Jun 19 07:36:32 EDT 1990:
-  Fix incorrect code generated for ELSE IF(expression involving
-function call passing non-constant substring).
-  Under -h, preserve the property that strings are null-terminated
-where possible.
-  Remove spaces between # and define in lex.c output.c parse.h .
-
-Mon Jun 25 07:22:59 EDT 1990:
-  Minor tweak to makefile to reduce unnecessary recompilations.
-
-Tue Jun 26 11:49:53 EDT 1990:
-  Fix unintended truncation of some integer constants on machines
-where casting a long to (int) may change the value.  E.g., when f2c
-ran on machines with 16-bit ints, "i = 99999" was being translated
-to "i = -31073;".
-
-Wed Jun 27 11:05:32 EDT 1990:
-  Arrange for CHARACTER-valued PARAMETERs to honor their length
-specifications.  Allow CHAR(nn) in expressions defining such PARAMETERs.
-
-Fri Jul 20 09:17:30 EDT 1990:
-  Avoid dereferencing 0 when a FORMAT statement has no label.
-
-Thu Jul 26 11:09:39 EDT 1990:
-  Remarks about VOID and binread,binwrite added to README.
-  Tweaks to parse_args: should be invisible unless your compiler
-complained at (short)*store.
-
-Thu Aug  2 02:07:58 EDT 1990:
-  f2c.ps: change the first line of page 5 from
-	include stuff
-to
-	include 'stuff'
-
-Tue Aug 14 13:21:24 EDT 1990:
-  libi77: libI77 adjusted to treat tabs as spaces in list input.
-
-Fri Aug 17 07:24:53 EDT 1990:
-  libi77: libI77 adjusted so a blank='ZERO' clause (upper case Z)
-in an open of a currently open file works right.
-
-Tue Aug 28 01:56:44 EDT 1990:
-  Fix bug in warnings of inconsistent calling sequences: if an
-argument to a subprogram was never referenced, then a previous
-invocation of the subprogram (in the same source file) that
-passed something of the wrong type for that argument did not
-elicit a warning message.
-
-Thu Aug 30 09:46:12 EDT 1990:
-  libi77: prevent embedded blanks in list output of complex values;
-omit exponent field in list output of values of magnitude between
-10 and 1e8; prevent writing stdin and reading stdout or stderr;
-don't close stdin, stdout, or stderr when reopening units 5, 6, 0.
-
-Tue Sep  4 12:30:57 EDT 1990:
-  Fix bug in C emitted under -I2 or -i2 for INTEGER*4 FUNCTION.
-  Warn of missing final END even if there are previous errors.
-
-Fri Sep  7 13:55:34 EDT 1990:
-  Remark about "make xsum.out" and "make f2c" added to README.
-
-Tue Sep 18 23:50:01 EDT 1990:
-  Fix null dereference (and, on some systems, writing of bogus *_com.c
-files) under -ec or -e1c when a prototype file (*.p or *.P) describes
-COMMON blocks that do not appear in the Fortran source.
-  libi77:
-    Add some #ifdef lines (#ifdef MSDOS, #ifndef MSDOS) to avoid
-references to stat and fstat on non-UNIX systems.
-    On UNIX systems, add component udev to unit; decide that old
-and new files are the same iff both the uinode and udev components
-of unit agree.
-    When an open stmt specifies STATUS='OLD', use stat rather than
-access (on UNIX systems) to check the existence of the file (in case
-directories leading to the file have funny permissions and this is
-a setuid or setgid program).
-
-Thu Sep 27 16:04:09 EDT 1990:
-  Supply missing entry for Impldoblock in blksize array of cpexpr
-(in expr.c).  No examples are known where this omission caused trouble.
-
-Tue Oct  2 22:58:09 EDT 1990:
-  libf77: test signal(...) == SIG_IGN rather than & 01 in main().
-  libi77: adjust rewind.c so two successive rewinds after a write
-don't clobber the file.
-
-Thu Oct 11 18:00:14 EDT 1990:
-  libi77: minor cleanups: add #include "fcntl.h" to endfile.c, err.c,
-open.c; adjust g_char in util.c for segmented memories; in f_inqu
-(inquire.c), define x appropriately when MSDOS is defined.
-
-Mon Oct 15 20:02:11 EDT 1990:
-  Add #ifdef MSDOS pointer adjustments to mem.c; treat NAME= as a
-synonym for FILE= in OPEN statements.
-
-Wed Oct 17 16:40:37 EDT 1990:
-  libf77, libi77: minor cleanups: _cleanup() and abort() invocations
-replaced by invocations of sig_die in main.c; some error messages
-previously lost in buffers will now appear.
-
-Mon Oct 22 16:11:27 EDT 1990:
-  libf77: separate sig_die from main (for folks who don't want to use
-the main in libF77).
-  libi77: minor tweak to comments in README.
-
-Fri Nov  2 13:49:35 EST 1990:
-  Use two underscores rather than one in generated temporary variable
-names to avoid conflict with COMMON names.  f2c.ps updated to reflect
-this change and the NAME= extension introduced 15 Oct.
-  Repair a rare memory fault in io.c .
-
-Mon Nov  5 16:43:55 EST 1990:
-  libi77: changes to open.c (and err.c): complain if an open stmt
-specifies new= and the file already exists (as specified by Fortrans 77
-and 90); allow file= to be omitted in open stmts and allow
-status='replace' (Fortran 90 extensions).
-
-Fri Nov 30 10:10:14 EST 1990:
-  Adjust malloc.c for unusual systems whose sbrk() can return values
-not properly aligned for doubles.
-  Arrange for slightly more helpful and less repetitive warnings for
-non-character variables initialized with character data; these warnings
-are (still) suppressed by -w66.
-
-Fri Nov 30 15:57:59 EST 1990:
-  Minor tweak to README (about changing VOID in f2c.h).
-
-Mon Dec  3 07:36:20 EST 1990:
-  Fix spelling of "character" in f2c.1t.
-
-Tue Dec  4 09:48:56 EST 1990:
-  Remark about link_msg and libf2c added to f2c/README.
-
-Thu Dec  6 08:33:24 EST 1990:
-  Under -U, render label nnn as L_nnn rather than Lnnn.
-
-Fri Dec  7 18:05:00 EST 1990:
-  Add more names from f2c.h (e.g. integer, real) to the c_keywords
-list of names to which an underscore is appended to avoid confusion.
-
-Mon Dec 10 19:11:15 EST 1990:
-  Minor tweaks to makefile (./xsum) and README (binread/binwrite).
-  libi77: a few modifications for POSIX systems; meant to be invisible
-elsewhere.
-
-Sun Dec 16 23:03:16 EST 1990:
-  Fix null dereference caused by unusual erroneous input, e.g.
-	call foo('abc')
-	end
-	subroutine foo(msg)
-	data n/3/
-	character*(*) msg
-	end
-(Subroutine foo is illegal because the character statement comes after a
-data statement.)
-  Use decimal rather than hex constants in xsum.c (to prevent
-erroneous warning messages about constant overflow).
-
-Mon Dec 17 12:26:40 EST 1990:
-  Fix rare extra underscore in character length parameters passed
-for multiple entry points.
-
-Wed Dec 19 17:19:26 EST 1990:
-  Allow generation of C despite error messages about bad alignment
-forced by equivalence.
-  Allow variable-length concatenations in I/O statements, such as
-	open(3, file=bletch(1:n) // '.xyz')
-
-Fri Dec 28 17:08:30 EST 1990:
-  Fix bug under -p with formats and internal I/O "units" in COMMON,
-as in
-      COMMON /FIGLEA/F
-      CHARACTER*20 F
-      F = '(A)'
-      WRITE (*,FMT=F) 'Hello, world!'
-      END
-
-Tue Jan 15 12:00:24 EST 1991:
-  Fix bug when two equivalence groups are merged, the second with
-nonzero offset, and the result is then merged into a common block.
-Example:
-      INTEGER W(3), X(3), Y(3), Z(3)
-      COMMON /ZOT/ Z
-      EQUIVALENCE (W(1),X(1)), (X(2),Y(1)), (Z(3),X(1))
-***** W WAS GIVEN THE WRONG OFFSET
-  Recognize Fortran 90's optional NML= in NAMELIST READs and WRITEs.
-(Currently NML= and FMT= are treated as synonyms -- there's no
-error message if, e.g., NML= specifies a format.)
-  libi77: minor adjustment to allow internal READs from character
-string constants in read-only memory.
-
-Fri Jan 18 22:56:15 EST 1991:
-  Add comment to README about needing to comment out the typedef of
-size_t in sysdep.h on some systems, e.g. Sun 4.1.
-  Fix misspelling of "statement" in an error message in lex.c
-
-Wed Jan 23 00:38:48 EST 1991:
-  Allow hex, octal, and binary constants to have the qualifying letter
-(z, x, o, or b) either before or after the quoted string containing the
-digits.  For now this change will not be reflected in f2c.ps .
-
-Tue Jan 29 16:23:45 EST 1991:
-  Arrange for character-valued statement functions to give results of
-the right length (that of the statement function's name).
-
-Wed Jan 30 07:05:32 EST 1991:
-  More tweaks for character-valued statement functions: an error
-check and an adjustment so a right-hand side of nonconstant length
-(e.g., a substring) is handled right.
-
-Wed Jan 30 09:49:36 EST 1991:
-  Fix p1_head to avoid printing (char *)0 with %s.
-
-Thu Jan 31 13:53:44 EST 1991:
-  Add a test after the cleanup call generated for I/O statements with
-ERR= or END= clauses to catch the unlikely event that the cleanup
-routine encounters an error.
-
-Mon Feb  4 08:00:58 EST 1991:
-  Minor cleanup: omit unneeded jumps and labels from code generated for
-some NAMELIST READs and WRITEs with IOSTAT=, ERR=, and/or END=.
-
-Tue Feb  5 01:39:36 EST 1991:
-  Change Mktemp to mktmp (for the benefit of systems so brain-damaged
-that they do not distinguish case in external names -- and that for
-some reason want to load mktemp).  Try to get xsum0.out right this
-time (it somehow didn't get updated on 4 Feb. 1991).
-  Add note to libi77/README about adjusting the interpretation of
-RECL= specifiers in OPENs for direct unformatted I/O.
-
-Thu Feb  7 17:24:42 EST 1991:
-  New option -r casts values of REAL functions, including intrinsics,
-to REAL.  This only matters for unportable code like
-	real r
-	r = asin(1.)
-	if (r .eq. asin(1.)) ...
-[The behavior of such code varies with the Fortran compiler used --
-and sometimes is affected by compiler options.]  For now, the man page
-at the end of f2c.ps is the only part of f2c.ps that reflects this new
-option.
-
-Fri Feb  8 18:12:51 EST 1991:
-  Cast pointer differences passed as arguments to the appropriate type.
-This matters, e.g., with MSDOS compilers that yield a long pointer
-difference but have int == short.
-  Disallow nonpositive dimensions.
-
-Fri Feb 15 12:24:15 EST 1991:
-  Change %d to %ld in sprintf call in putpower in putpcc.c.
-  Free more memory (e.g. allowing translation of larger Fortran
-files under MS-DOS).
-  Recognize READ (character expression) and WRITE (character expression)
-as formatted I/O with the format given by the character expression.
-  Update year in Notice.
-
-Sat Feb 16 00:42:32 EST 1991:
-  Recant recognizing WRITE(character expression) as formatted output
--- Fortran 77 is not symmetric in its syntax for READ and WRITE.
-
-Mon Mar  4 15:19:42 EST 1991:
-  Fix bug in passing the real part of a complex argument to an intrinsic
-function.  Omit unneeded parentheses in nested calls to intrinsics.
-Example:
-	subroutine foo(x, y)
-	complex y
-	x = exp(sin(real(y))) + exp(imag(y))
-	end
-
-Fri Mar  8 15:05:42 EST 1991:
-  Fix a comment in expr.c; omit safstrncpy.c (which had bugs in
-cases not used by f2c).
-
-Wed Mar 13 02:27:23 EST 1991:
-  Initialize firstmemblock->next in mem_init in mem.c .  [On most
-systems it was fortuituously 0, but with System V, -lmalloc could
-trip on this missed initialization.]
-
-Wed Mar 13 11:47:42 EST 1991:
-  Fix a reference to freed memory.
-
-Wed Mar 27 00:42:19 EST 1991:
-  Fix a memory fault caused by such illegal Fortran as
-       function foo
-       x = 3
-       logical foo	! declaration among executables
-       foo=.false.	! used to suffer memory fault
-       end
-
-Fri Apr  5 08:30:31 EST 1991:
-  Fix loss of % in some format expressions, e.g.
-	write(*,'(1h%)')
-  Fix botch introduced 27 March 1991 that caused subroutines with
-multiple entry points to have extraneous declarations of ret_val.
-
-Fri Apr  5 12:44:02 EST 1991
-  Try again to omit extraneous ret_val declarations -- this morning's
-fix was sometimes wrong.
-
-Mon Apr  8 13:47:06 EDT 1991:
-  Arrange for s_rnge to have the right prototype under -A -C .
-
-Wed Apr 17 13:36:03 EDT 1991:
-  New fatal error message for apparent invocation of a recursive
-statement function.
-
-Thu Apr 25 15:13:37 EDT 1991:
-  F2c and libi77 adjusted so NAMELIST works with -i2.  (I forgot
-about -i2 when adding NAMELIST.)  This required a change to f2c.h
-(that only affects NAMELIST I/O under -i2.)  Man-page description of
--i2 adjusted to reflect that -i2 stores array lengths in short ints.
-
-Fri Apr 26 02:54:41 EDT 1991:
-  Libi77: fix some bugs in NAMELIST reading of multi-dimensional arrays
-(file rsne.c).
-
-Thu May  9 02:13:51 EDT 1991:
-  Omit a trailing space in expr.c (could cause a false xsum value if
-a mailer drops the trailing blank).
-
-Thu May 16 13:14:59 EDT 1991:
-  Libi77: increase LEFBL in lio.h to overcome a NeXT bug.
-  Tweak for compilers that recognize "nested" comments: inside comments,
-turn /* into /+ (as well as */ into +/).
-
-Sat May 25 11:44:25 EDT 1991:
-  libf77: s_rnge: declare line long int rather than int.
-
-Fri May 31 07:51:50 EDT 1991:
-  libf77: system_: officially return status.
-
-Mon Jun 17 16:52:53 EDT 1991:
-  Minor tweaks: omit unnecessary declaration of strcmp (that caused
-trouble on a system where strcmp was a macro) from misc.c; add
-SHELL = /bin/sh to makefiles.
-  Fix a dereference of null when a CHARACTER*(*) declaration appears
-(illegally) after DATA.  Complain only once per subroutine about
-declarations appearing after DATA.
-
-Mon Jul  1 00:28:13 EDT 1991:
-  Add test and error message for illegal use of subroutine names, e.g.
-      SUBROUTINE ZAP(A)
-      ZAP = A
-      END
-
-Mon Jul  8 21:49:20 EDT 1991:
-  Issue a warning about things like
-	integer i
-	i = 'abc'
-(which is treated as i = ichar('a')).  [It might be nice to treat 'abc'
-as an integer initialized (in a DATA statement) with 'abc', but
-other matters have higher priority.]
-  Render
-	i = ichar('A')
-as
-	i = 'A';
-rather than
-	i = 65;
-(which assumes ASCII).
-
-Fri Jul 12 07:41:30 EDT 1991:
-  Note added to README about erroneous definitions of __STDC__ .
-
-Sat Jul 13 13:38:54 EDT 1991:
-  Fix bugs in double type convesions of complex values, e.g.
-sngl(real(...)) or dble(real(...)) (where ... is complex).
-
-Mon Jul 15 13:21:42 EDT 1991:
-  Fix bug introduced 8 July 1991 that caused erroneous warnings
-"ichar([first char. of] char. string) assumed for conversion to numeric"
-when a subroutine had an array of character strings as an argument.
-
-Wed Aug 28 01:12:17 EDT 1991:
-  Omit an unused function in format.c, an unused variable in proc.c .
-  Under -r8, promote complex to double complex (as the man page claims).
-
-Fri Aug 30 17:19:17 EDT 1991:
-  f2c.ps updated: slightly expand description of intrinsics and,or,xor,
-not; add mention of intrinsics lshift, rshift; add note about f2c
-accepting Fortran 90 inline comments (starting with !); update Cobalt
-Blue address.
-
-Tue Sep 17 07:17:33 EDT 1991:
-  libI77: err.c and open.c modified to use modes "rb" and "wb"
-when (f)opening unformatted files; README updated to point out
-that it may be necessary to change these modes to "r" and "w"
-on some non-ANSI systems.
-
-Tue Oct 15 10:25:49 EDT 1991:
-  Minor tweaks that make some PC compilers happier: insert some
-casts, add args to signal functions.
-  Change -g to emit uncommented #line lines -- and to emit more of them;
-update fc, f2c.1, f2c.1t, f2c.ps to reflect this.
-  Change uchar to Uchar in xsum.c .
-  Bring gram.c up to date.
-
-Thu Oct 17 09:22:05 EDT 1991:
-  libi77: README, fio.h, sue.c, uio.c changed so the length field
-in unformatted sequential records has type long rather than int
-(unless UIOLEN_int is #defined).  This is for systems where sizeof(int)
-can vary, depending on the compiler or compiler options.
-
-Thu Oct 17 13:42:59 EDT 1991:
-  libi77: inquire.c: when MSDOS is defined, don't strcmp units[i].ufnm
-when it is NULL.
-
-Fri Oct 18 15:16:00 EDT 1991:
-  Correct xsum0.out in "all from f2c/src" (somehow botched on 15 Oct.).
-
-Tue Oct 22 18:12:56 EDT 1991:
-  Fix memory fault when a character*(*) argument is used (illegally)
-as a dummy variable in the definition of a statement function.  (The
-memory fault occurred when the statement function was invoked.)
-  Complain about implicit character*(*).
-
-Thu Nov 14 08:50:42 EST 1991:
-  libi77: change uint to Uint in fmt.h, rdfmt.c, wrtfmt.c; this change
-should be invisible unless you're running a brain-damaged system.
-
-Mon Nov 25 19:04:40 EST 1991:
-  libi77: correct botches introduced 17 Oct. 1991 and 14 Nov. 1991
-(change uint to Uint in lwrite.c; other changes that only matter if
-sizeof(int) != sizeof(long)).
-  Add a more meaningful error message when bailing out due to an attempt
-to invoke a COMMON variable as a function.
-
-Sun Dec  1 19:29:24 EST 1991:
-  libi77: uio.c: add test for read failure (seq. unformatted reads);
-adjust an error return from EOF to off end of record.
-
-Tue Dec 10 17:42:28 EST 1991:
-  Add tests to prevent memory faults with bad uses of character*(*).
-
-Thu Dec 12 11:24:41 EST 1991:
-  libi77: fix bug with internal list input that caused the last
-character of each record to be ignored; adjust error message in
-internal formatted input from "end-of-file" to "off end of record"
-if the format specifies more characters than the record contains.
-
-Wed Dec 18 17:48:11 EST 1991:
-  Fix bug in translating nonsensical ichar invocations involving
-concatenations.
-  Fix bug in passing intrinsics lle, llt, lge, lgt as arguments;
-hl_le was being passed rather than l_le, etc.
-  libf77: adjust length parameters from long to ftnlen, for
-compiling with f2c_i2 defined.
-
-Sat Dec 21 15:30:57 EST 1991:
-  Allow DO nnn ... to end with an END DO statement labelled nnn.
-
-Tue Dec 31 13:53:47 EST 1991:
-  Fix bug in handling dimension a(n**3,2) -- pow_ii was called
-incorrectly.
-  Fix bug in translating
-	subroutine x(abc,n)
-	character abc(n)
-	write(abc,'(i10)') 123
-	end
-(omitted declaration and initialiation of abc_dim1).
-  Complain about dimension expressions of such invalid types
-as complex and logical.
-
-Fri Jan 17 11:54:20 EST 1992:
-  Diagnose some illegal uses of main program name (rather than
-memory faulting).
-  libi77:  (1) In list and namelist input, treat "r* ," and "r*,"
-alike (where r is a positive integer constant), and fix a bug in
-handling null values following items with repeat counts (e.g.,
-2*1,,3).  (2) For namelist reading of a numeric array, allow a new
-name-value subsequence to terminate the current one (as though the
-current one ended with the right number of null values).
-(3) [lio.h, lwrite.c]:  omit insignificant zeros in list and namelist
-output.  (Compile with -DOld_list_output to get the old behavior.)
-
-Sat Jan 18 15:58:01 EST 1992:
-  libi77:  make list output consistent with F format by printing .1
-rather than 0.1 (introduced yesterday).
-
-Wed Jan 22 08:32:43 EST 1992:
-  libi77:  add comment to README pointing out preconnection of
-Fortran units 5, 6, 0 to stdin, stdout, stderr (respectively).
-
-Mon Feb  3 11:57:53 EST 1992:
-  libi77:  fix namelist read bug that caused the character following
-a comma to be ignored.
-
-Fri Feb 28 01:04:26 EST 1992:
-  libf77:  fix buggy z_sqrt.c (double precision square root), which
-misbehaved for arguments in the southwest quadrant.
-
-Thu Mar 19 15:05:18 EST 1992:
-  Fix bug (introduced 17 Jan 1992) in handling multiple entry points
-of differing types (with implicitly typed entries appearing after
-the first executable statement).
-  Fix memory fault in the following illegal Fortran:
-        double precision foo(i)
-*	illegal: above should be "double precision function foo(i)"
-        foo = i * 3.2
-        entry moo(i)
-        end
-  Note about ANSI_Libraries (relevant, e.g., to IRIX 4.0.1 and AIX)
-added to README.
-  Abort zero divides during constant simplification.
-
-Sat Mar 21 01:27:09 EST 1992:
-  Tweak ckalloc (misc.c) for systems where malloc(0) = 0; this matters
-for subroutines with multiple entry points but no arguments.
-  Add "struct memblock;" to init.c (irrelevant to most compilers).
-
-Wed Mar 25 13:31:05 EST 1992:
-  Fix bug with IMPLICIT INTEGER*4(...): under -i2 or -I2, the *4 was
-ignored.
-
-Tue May  5 09:53:55 EDT 1992:
-  Tweaks to README; e.g., ANSI_LIbraries changed to ANSI_Libraries .
-
-Wed May  6 23:49:07 EDT 1992
-  Under -A and -C++, have subroutines return 0 (even if they have
-no * arguments).
-  Adjust libi77 (rsne.c and lread.c) for systems where ungetc is
-a macro.  Tweak lib[FI]77/makefile to use unique intermediate file
-names (for parallel makes).
-
-Tue May 19 09:03:05 EDT 1992:
-  Adjust libI77 to make err= work with internal list and formatted I/O.
-
-Sat May 23 18:17:42 EDT 1992:
-  Under -A and -C++, supply "return 0;" after the code generated for
-a STOP statement -- the C compiler doesn't know that s_stop won't
-return.
-  New (mutually exclusive) options:
-	-f	treats all input lines as free-format lines,
-		honoring text that appears after column 72
-		and not padding lines shorter than 72 characters
-		with blanks (which matters if a character string
-		is continued across 2 or more lines).
-	-72	treats text appearing after column 72 as an error.
-
-Sun May 24 09:45:37 EDT 1992:
-  Tweak description of -f in f2c.1 and f2c.1t; update f2c.ps .
-
-Fri May 29 01:17:15 EDT 1992:
-  Complain about externals used as variables.  Example
-	subroutine foo(a,b)
-	external b
-	a = a*b		! illegal use of b; perhaps should be b()
-	end
-
-Mon Jun 15 11:15:27 EDT 1992:
-  Fix bug in handling namelists with names that have underscores.
-
-Sat Jun 27 17:30:59 EDT 1992:
-  Under -A and -C++, end Main program aliases with "return 0;".
-  Under -A and -C++, use .P files and usage in previous subprograms
-in the current file to give prototypes for functions declared EXTERNAL
-but not invoked.
-  Fix memory fault under -d1 -P .
-  Under -A and -C++, cast arguments to the right types in calling
-a function that has been defined in the current file or in a .P file.
-  Fix bug in handling multi-dimensional arrays with array references
-in their leading dimensions.
-  Fix bug in the intrinsic cmplx function when the first argument
-involves an expression for which f2c generates temporary variables,
-e.g. cmplx(abs(real(a)),1.) .
-
-Sat Jul 18 07:36:58 EDT 1992:
-  Fix buglet with -e1c (invisible on most systems) temporary file
-f2c_functions was unlinked before being closed.
-  libf77: fix bugs in evaluating m**n for integer n < 0 and m an
-integer different from 1 or a real or double precision 0.
-Catch SIGTRAP (to print "Trace trap" before aborting).  Programs
-that previously erroneously computed 1 for 0**-1 may now fault.
-Relevant routines: main.c pow_di.c pow_hh.c pow_ii.c pow_ri.c .
-
-Sat Jul 18 08:40:10 EDT 1992:
-  libi77: allow namelist input to end with & (e.g. &end).
-
-Thu Jul 23 00:14:43 EDT 1992
-  Append two underscores rather than one to C keywords used as
-local variables to avoid conflicts with similarly named COMMON blocks.
-
-Thu Jul 23 11:20:55 EDT 1992:
-  libf77, libi77 updated to assume ANSI prototypes unless KR_headers
-is #defined.
-  libi77 now recognizes a Z format item as in Fortran 90;
-the implementation assumes 8-bit bytes and botches character strings
-on little-endian machines (by printing their bytes from right to
-left): expect this bug to persist; fixing it would require a
-change to the I/O calling sequences.
-
-Tue Jul 28 15:18:33 EDT 1992:
-  libi77: insert missed "#ifdef KR_headers" lines around getnum
-header in rsne.c.  Version not updated.
-
-NOTE: "index from f2c" now ends with current timestamps of files in
-"all from f2c/src", sorted by time.  To bring your source up to date,
-obtain source files with a timestamp later than the time shown in your
-version.c.
-
-Fri Aug 14 08:07:09 EDT 1992:
-  libi77: tweak wrt_E in wref.c to avoid signing NaNs.
-
-Sun Aug 23 19:05:22 EDT 1992:
-  fc: supply : after O in getopt invocation (for -O1 -O2 -O3).
-
-Mon Aug 24 18:37:59 EDT 1992:
-  Recant above tweak to fc: getopt is dumber than I thought;
-it's necessary to say -O 1 (etc.).
-  libF77/README: add comments about ABORT, ERF, DERF, ERFC, DERFC,
-GETARG, GETENV, IARGC, SIGNAL, and SYSTEM.
-
-Tue Oct 27 01:57:42 EST 1992:
-  libf77, libi77:
-    1.  Fix botched indirection in signal_.c.
-    2.  Supply missing l_eof = 0 assignment to s_rsne() in rsne.c (so
-end-of-file on other files won't confuse namelist reads of external
-files).
-    3.  Prepend f__ to external names that are only of internal
-interest to lib[FI]77.
-
-Thu Oct 29 12:37:18 EST 1992:
-  libf77: Fix botch in signal_.c when KR_headers is #defined;
-add CFLAGS to makefile.
-  libi77: trivial change to makefile for consistency with
-libF77/makefile.
-
-Wed Feb  3 02:05:16 EST 1993:
-  Recognize types INTEGER*1, LOGICAL*1, LOGICAL*2, INTEGER*8.
-INTEGER*8 is not well tested and will only work reasonably on
-systems where int = 4 bytes, long = 8 bytes; on such systems,
-you'll have to modify f2c.h appropriately, changing integer
-from long to int and adding typedef long longint.  You'll also
-have to compile libI77 with Allow_TYQUAD #defined and adjust
-libF77/makefile to compile pow_qq.c.  In the f2c source, changes
-for INTEGER*8 are delimited by #ifdef TYQUAD ... #endif.  You
-can omit the INTEGER*8 changes by compiling with NO_TYQUAD
-#defined.  Otherwise, the new command-line option -!i8
-disables recognition of INTEGER*8.
-  libf77: add pow_qq.c
-  libi77: add #ifdef Allow_TYQUAD stuff.  Changes for INTEGER*1,
-LOGICAL*1, and LOGICAL*2 came last 23 July 1992.  Fix bug in
-backspace (that only bit when the last character of the second
-or subsequent buffer read was the previous newline).  Guard
-against L_tmpnam being too small in endfile.c.  For MSDOS,
-close and reopen files when copying to truncate.  Lengthen
-LINTW (buffer size in lwrite.c).
-  Add \ to the end of #define lines that get broken.
-  Fix bug in handling NAMELIST of items in EQUIVALENCE.
-  Under -h (or -hd), convert Hollerith to integer in general expressions
-(e.g., assignments), not just when they're passed as arguments, and
-blank-pad rather than 0-pad the Hollerith to a multiple of
-sizeof(integer) or sizeof(doublereal).
-  Add command-line option -s, which instructs f2c preserve multi-
-dimensional subscripts (by emitting and using appropriate #defines).
-  Fix glitch (with default type inferences) in examples like
-	call foo('abc')
-	end
-	subroutine foo(goo)
-	end
-This gave two warning messages:
-	Warning on line 4 of y.f: inconsistent calling sequences for foo:
-	        here 1, previously 2 args and string lengths.
-	Warning on line 4 of y.f: inconsistent calling sequences for foo:
-	        here 2, previously 1 args and string lengths.
-Now the second Warning is suppressed.
-  Complain about all inconsistent arguments, not just the first.
-  Switch to automatic creation of "all from f2c/src".  For folks
-getting f2c source via ftp, this means f2c/src/all.Z is now an
-empty file rather than a bundle.
-  Separate -P and -A: -P no longer implies -A.
-
-Thu Feb  4 00:32:20 EST 1993:
-  Fix some glitches (introduced yesterday) with -h .
-
-Fri Feb  5 01:40:38 EST 1993:
-  Fix bug in types conveyed for namelists (introduced 3 Feb. 1993).
-
-Fri Feb  5 21:26:43 EST 1993:
-  libi77: tweaks to NAMELIST and open (after comments by Harold
-Youngren):
- 1. Reading a ? instead of &name (the start of a namelist) causes
-    the namelist being sought to be written to stdout (unit 6);
-    to omit this feature, compile rsne.c with -DNo_Namelist_Questions.
- 2. Reading the wrong namelist name now leads to an error message
-    and an attempt to skip input until the right namelist name is found;
-    to omit this feature, compile rsne.c with -DNo_Bad_Namelist_Skip.
- 3. Namelist writes now insert newlines before each variable; to omit
-    this feature, compile xwsne.c with -DNo_Extra_Namelist_Newlines.
- 4. For OPEN of sequential files, ACCESS='APPEND' (or
-    access='anything else starting with "A" or "a"') causes the file to
-    be positioned at end-of-file, so a write will append to the file.
-    (This is nonstandard, but does not require modifying data
-    structures.)
-
-Mon Feb  8 14:40:37 EST 1993:
-  Increase number of continuation lines allowed from 19 to 99,
-and allow changing this limit with -NC (e.g. -NC200 for 200 lines).
-  Treat control-Z (at the beginning of a line) as end-of-file: see
-the new penultimate paragraph of README.
-  Fix a rarely seen glitch that could make an error messages to say
-"line 0".
-
-Tue Feb  9 02:05:40 EST 1993
-  libi77: change some #ifdef MSDOS lines to #ifdef NON_UNIX_STDIO,
-and, in err.c under NON_UNIX_STDIO, avoid close(creat(name,0666))
-when the unit has another file descriptor for name.
-
-Tue Feb  9 17:12:49 EST 1993
-  libi77: more tweaks for NON_UNIX_STDIO: use stdio routines
-rather than open, close, creat, seek, fdopen (except for f__isdev).
-
-Fri Feb 12 15:49:33 EST 1993
-  Update src/gram.c (which was forgotten in the recent updates).
-Most folks regenerate it anyway (wity yacc or bison).
-
-Thu Mar  4 17:07:38 EST 1993
-  Increase default max labels in computed gotos and alternate returns
-to 257, and allow -Nl1234 to specify this number.
-  Tweak put.c to check p->tag == TADDR in realpart() and imagpart().
-  Adjust fc script to allow .r (RATFOR) files and -C (check subscripts).
-  Avoid declaring strchr in niceprintf.c under -DANSI_Libraries .
-  gram.c updated again.
-  libi77: err.c, open.c: take declaration of fdopen from rawio.h.
-
-Sat Mar  6 07:09:11 EST 1993
-  libi77: uio.c: adjust off-end-of-record test for sequential
-unformatted reads to respond to err= rather than end= .
-
-Sat Mar  6 16:12:47 EST 1993
-  Treat scalar arguments of the form (v) and v+0, where v is a variable,
-as expressions: assign to a temporary variable, and pass the latter.
-  gram.c updated.
-
-Mon Mar  8 09:35:38 EST 1993
-  "f2c.h from f2c" updated to add types logical1 and integer1 for
-LOGICAL*1 and INTEGER*1.  ("f2c.h from f2c" is supposed to be the
-same as "f2c.h from f2c/src", which was updated 3 Feb. 1993.)
-
-Mon Mar  8 17:57:55 EST 1993
-  Fix rarely seen bug that could cause strange casts in function
-invocations (revealed by an example with msdos/f2c.exe).
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only).
-
-Fri Mar 12 12:37:01 EST 1993
-  Fix bug with -s in handling subscripts involving min, max, and
-complicated expressions requiring temporaries.
-  Fix bug in handling COMMONs that need padding by a char array.
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only).
-
-Fri Mar 12 17:16:16 EST 1993
-  libf77, libi77: updated for compiling under C++.
-
-Mon Mar 15 16:21:37 EST 1993
-  libi77: more minor tweaks (for -DKR_headers); Version.c not changed.
-
-Thu Mar 18 12:37:30 EST 1993
-  Flag -r (for discarding carriage-returns on systems that end lines
-with carriage-return/newline pairs, e.g. PCs) added to xsum, and
-xsum.c converted to ANSI/ISO syntax (with K&R syntax available with
--DKR_headers).  [When time permits, the f2c source will undergo a
-similar conversion.]
-  libi77: tweaks to #includes in endfile.c, err.c, open.c, rawio.h;
-Version.c not changed.
-  f2c.ps updated (to pick up revision of 2 Feb. 1993 to f2c.1).
-
-Fri Mar 19 09:19:26 EST 1993
-  libi77: add (char *) casts to malloc and realloc invocations
-in err.c, open.c; Version.c not changed.
-
-Tue Mar 30 07:17:15 EST 1993
-  Fix bug introduced 6 March 1993: possible memory corruption when
-loops in data statements involve constant subscripts, as in
-	 DATA (GUNIT(1,I),I=0,14)/15*-1/
-
-Tue Mar 30 16:17:42 EST 1993
-  Fix bug with -s: (floating-point array item)*(complex item)
-generates an _subscr() reference for the floating-point array,
-but a #define for the _subscr() was omitted.
-
-Tue Apr  6 12:11:22 EDT 1993
-  libi77: adjust error returns for formatted inputs to flush the current
-input line when err= is specified.  To restore the old behavior (input
-left mid-line), either adjust the #definition of errfl in fio.h or omit
-the invocation of f__doend in err__fl (in err.c).
-
-Tue Apr  6 13:30:04 EDT 1993
-  Fix bug revealed in
-	subroutine foo(i)
-	call goo(int(i))
-	end
-which now passes a copy of i, rather than i itself.
-
-Sat Apr 17 11:41:02 EDT 1993
-  Adjust appending of underscores to conform with f2c.ps ("A Fortran
-to C Converter"): names that conflict with C keywords or f2c type
-names now have just one underscore appended (rather than two); add
-"integer1", "logical1", "longint" to the keyword list.
-  Append underscores to names that appear in EQUIVALENCE and are
-component names in a structure declared in f2c.h, thus avoiding a
-problem caused by the #defines emitted for equivalences.  Example:
-	complex a
-	equivalence (i,j)
-	a = 1	! a.i went awry because of #define i
-	j = 2
-	write(*,*) a, i
-	end
-  Adjust line-breaking logic to avoid splitting very long constants
-(and names).  Example:
-	! The next line starts with tab and thus is a free-format line.
-	a=.012345689012345689012345689012345689012345689012345689012345689012345689
-	end
-  Omit extraneous "return 0;" from entry stubs emitted for multiple
-entry points of type character, complex, or double complex.
-
-Sat Apr 17 14:35:05 EDT 1993
-  Fix bug (introduced 4 Feb.) in separating -P from -A that kept f2c
-from re-reading a .P file written without -A or -C++ describing a
-routine with an external argument.  [See the just-added note about
-separating -P from -A in the changes above for 3 Feb. 1993.]
-  Fix bug (type UNKNOWN for V in the example below) revealed by
-	subroutine a()
-	external c
-	call b(c)
-	end
-	subroutine b(v)
-	end
-
-Sun Apr 18 19:55:26 EDT 1993
-  Fix wrong calling sequence for mem() in yesterday's addition to
-equiv.c .
-
-Wed Apr 21 17:39:46 EDT 1993
-  Fix bug revealed in
-
-      ASSIGN 10 TO L1
-      GO TO 20
- 10   ASSIGN 30 TO L2
-      STOP 10
-
- 20   ASSIGN 10 TO L2	! Bug here because 10 had been assigned
-			! to another label, then defined.
-      GO TO L2
- 30   END
-
-Fri Apr 23 18:38:50 EDT 1993
-  Fix bug with -h revealed in
-	CHARACTER*9 FOO
-	WRITE(FOO,'(I6)') 1
-	WRITE(FOO,'(I6)') 2	! struct icilist io___3 botched
-	END
-
-Tue Apr 27 16:08:28 EDT 1993
-  Tweak to makefile: remove "size f2c".
-
-Tue May  4 23:48:20 EDT 1993
-  libf77: tweak signal_ line of f2ch.add .
-
-Tue Jun  1 13:47:13 EDT 1993
-  Fix bug introduced 3 Feb. 1993 in handling multiple entry
-points with differing return types -- the postfix array in proc.c
-needed a new entry for integer*8 (which resulted in wrong
-Multitype suffixes for non-integral types).
-  For (default) K&R C, generate VOID rather than int functions for
-functions of Fortran type character, complex, and double complex.
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only).
-
-Tue Jun  1 23:11:15 EDT 1993
-  f2c.h: add Multitype component g and commented type longint.
-  proc.c: omit "return 0;" from stubs for complex and double complex
-entries (when entries have multiple types); add test to avoid memory
-fault with illegal combinations of entry types.
-
-Mon Jun  7 12:00:47 EDT 1993
-  Fix memory fault in
-	common /c/ m
-	integer m(1)
-	data m(1)/1/, m(2)/2/	! one too many initializers
-	end
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only).
-
-Fri Jun 18 13:55:51 EDT 1993
-  libi77: change type of signal_ in f2ch.add; change type of il in
-union Uint from long to integer (for machines like the DEC Alpha,
-where integer should be the same as int).  Version.c not changed.
-  Tweak gram.dcl and gram.head: add semicolons after some rules that
-lacked them, and remove an extraneous semicolon.  These changes are
-completely transparent to our local yacc programs, but apparently
-matter on some VMS systems.
-
-Wed Jun 23 01:02:56 EDT 1993
-  Update "fc" shell script, and bring f2c.1 and f2c.1t up to date:
-they're meant to be linked with (i.e., the same as) src/f2c.1 and
-src/f2c.1t .  [In the last update of f2c.1* (2 Feb. 1993), only
-src/f2c.1 and src/f2c.1t got changed -- a mistake.]
-
-Wed Jun 23 09:04:31 EDT 1993
-  libi77: fix bug in format reversions for internal writes.
-Example:
-	character*60 lines(2)
-	write(lines,"('n =',i3,2(' more text',i3))") 3, 4, 5, 6
-	write(*,*) 'lines(1) = ', lines(1)
-	write(*,*) 'lines(2) = ', lines(2)
-	end
-gave an error message that began "iio: off end of record", rather
-than giving the correct output:
-
- lines(1) = n =  3 more text  4 more text  5
- lines(2) =  more text  6 more text
-
-Thu Aug  5 11:31:14 EDT 1993
-  libi77: lread.c: fix bug in handling repetition counts for logical
-data (during list or namelist input).  Change struct f__syl to
-struct syl (for buggy compilers).
-
-Sat Aug  7 16:05:30 EDT 1993
-  libi77: lread.c (again): fix bug in namelist reading of incomplete
-logical arrays.
-  Fix minor calling-sequence errors in format.c, output.c, putpcc.c:
-should be invisible.
-
-Mon Aug  9 09:12:38 EDT 1993
-  Fix erroneous cast under -A in translating
-	character*(*) function getc()
-	getc(2:3)=' '		!wrong cast in first arg to s_copy
-	end
-  libi77: lread.c: fix bug in namelist reading of an incomplete array
-of numeric data followed by another namelist item whose name starts
-with 'd', 'D', 'e', or 'E'.
-
-Fri Aug 20 13:22:10 EDT 1993
-  Fix bug in do while revealed by
-	subroutine skdig (line, i)
-	character line*(*), ch*1
-	integer i
-	logical isdigit
-	isdigit(ch) = ch.ge.'0' .and. ch.le.'9'
-	do while (isdigit(line(i:i)))	! ch__1[0] was set before
-					! "while(...) {...}"
-		i = i + 1
-		enddo
-	end
-
-Fri Aug 27 08:22:54 EDT 1993
-  Add #ifdefs to avoid declaring atol when it is a macro; version.c
-not updated.
-
-Wed Sep  8 12:24:26 EDT 1993
-  libi77: open.c: protect #include "sys/..." with
-#ifndef NON_UNIX_STDIO; Version date not changed.
-
-Thu Sep  9 08:51:21 EDT 1993
-  Adjust "include" to interpret file names relative to the directory
-of the file that contains the "include".
-
-Fri Sep 24 00:56:12 EDT 1993
-  Fix offset error resulting from repeating the same equivalence
-statement twice.  Example:
-	real a(2), b(2)
-	equivalence (a(2), b(2))
-	equivalence (a(2), b(2))
-	end
-  Increase MAXTOKENLEN (to roughly the largest allowed by ANSI C).
-
-Mon Sep 27 08:55:09 EDT 1993
-  libi77: endfile.c: protect #include "sys/types.h" with
-#ifndef NON_UNIX_STDIO; Version.c not changed.
-
-Fri Oct 15 15:37:26 EDT 1993
-  Fix rarely seen parsing bug illustrated by
-	subroutine foo(xabcdefghij)
-	character*(*) xabcdefghij
-               IF (xabcdefghij.NE.'##') GOTO 40
- 40	end
-in which the spacing in the IF line is crucial.
-
-Thu Oct 21 13:55:11 EDT 1993
-  Give more meaningful error message (then "unexpected character in
-cds") when constant simplification leads to Infinity or NaN.
-
-Wed Nov 10 15:01:05 EST 1993
-  libi77: backspace.c: adjust, under -DMSDOS, to cope with MSDOS
-text files, as handled by some popular PC C compilers.  Beware:
-the (defective) libraries associated with these compilers assume lines
-end with \r\n (conventional MS-DOS text files) -- and ftell (and
-hence the current implementation of backspace) screws up if lines with
-just \n.
-
-Thu Nov 18 09:37:47 EST 1993
-  Give a better error (than "control stack empty") for an extraneous
-ENDDO.  Example:
-	enddo
-	end
-  Update comments about ftp in "readme from f2c".
-
-Sun Nov 28 17:26:50 EST 1993
-  Change format of time stamp in version.c to yyyymmdd.
-  Sort parameter adjustments (or complain of impossible dependencies)
-so that dummy arguments are referenced only after being adjusted.
-Example:
-	subroutine foo(a,b)
-	integer a(2)		! a must be adjusted before b
-	double precision b(a(1),a(2))
-	call goo(b(3,4))
-	end
-  Adjust structs for initialized common blocks and equivalence classes
-to omit the trailing struct component added to force alignment when
-padding already forces the desired alignment.  Example:
-	PROGRAM TEST
-	COMMON /Z/ A, CC
-	CHARACTER*4 CC
-	DATA cc /'a'/
-	END
-now gives
-	struct {
-	    integer fill_1[1];
-	    char e_2[4];
-	    } z_ = { {0}, {'a', ' ', ' ', ' '} };
-rather than
-struct {
-    integer fill_1[1];
-    char e_2[4];
-    real e_3;
-    } z_ = { {0}, {'a', ' ', ' ', ' '}, (float)0. };
-
-Wed Dec  8 16:24:43 EST 1993
-  Adjust lex.c to recognize # nnn "filename" lines emitted by cpp;
-this affects the file names and line numbers in error messages and
-the #line lines emitted under -g.
-  Under -g, arrange for a file that starts with an executable
-statement to have the first #line line indicate line 1, rather
-than the line number of the END statement ending the main program.
-  Adjust fc script to run files ending in .F through /lib/cpp.
-  Fix bug ("Impossible tag 2") in
-	if (t .eq. (0,2)) write(*,*) 'Bug!'
-	end
-  libi77: iio.c: adjust internal formatted reads to treat short records
-as though padded with blanks (rather than causing an "off end of record"
-error).
-
-Wed Dec 15 15:19:15 EST 1993
-  fc: adjusted for .F files to pass -D and -I options to cpp.
-
-Fri Dec 17 20:03:38 EST 1993
-  Fix botch introduced 28 Nov. 1993 in vax.c; change "version of"
-to "version".
-
-Tue Jan  4 15:39:52 EST 1994
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only).
-
-Wed Jan 19 08:55:19 EST 1994
-  Arrange to accept
-	integer	Nx, Ny, Nz
-	parameter	(Nx = 10, Ny = 20)
-	parameter	(Nz = max(Nx, Ny))
-	integer	c(Nz)
-	call foo(c)
-	end
-rather than complaining "Declaration error for c: adjustable dimension
-on non-argument".  The necessary changes cause some hitherto unfolded
-constant expressions to be folded.
-  Accept BYTE as a synonym for INTEGER*1.
-
-Thu Jan 27 08:57:40 EST 1994
-  Fix botch in changes of 19 Jan. 1994 that broke entry points with
-multi-dimensional array arguments that did not appear in the subprogram
-argument list and whose leading dimensions depend on arguments.
-
-Mon Feb  7 09:24:30 EST 1994
-  Remove artifact in "fc" script that caused -O to be ignored:
-	87c87
-	<		# lcc ignores -O...
-	---
-	>		CFLAGS="$CFLAGS $O"
-
-Sun Feb 20 17:04:58 EST 1994
-  Fix bugs reading .P files for routines with arguments of type
-INTEGER*1, INTEGER*8, LOGICAL*2.
-  Fix glitch in reporting inconsistent arguments for routines involving
-character arguments:  "arg n" had n too large by the number of
-character arguments.
-
-Tue Feb 22 20:50:08 EST 1994
-  Trivial changes to data.c format.c main.c niceprintf.c output.h and
-sysdep.h (consistency improvements).
-  libI77: lread.c: check for NULL return from realloc.
-
-Fri Feb 25 23:56:08 EST 1994
-  output.c, sysdep.h: arrange for -DUSE_DTOA to use dtoa.c and g_fmt.c
-for correctly rounded decimal values on IEEE-arithmetic machines
-(plus machines with VAX and IBM-mainframe arithmetic).  These
-routines are available from netlib's fp directory.
-  msdos/f2cx.exe.Z and msdos/f2c.exe.Z updated (ftp access only); the
-former uses -DUSE_DTOA to keep 12 from printing as 12.000000000000001.
-  vax.c: fix wrong arguments to badtag and frchain introduced
-28 Nov. 1993.
-  Source for f2c converted to ANSI/ISO format, with the K&R format
-available by compilation with -DKR_headers .
-  Arrange for (double precision expression) relop (single precision
-constant) to retain the single-precision nature of the constant.
-Example:
-	double precision t
-	if (t .eq. 0.3) ...
-
-Mon Feb 28 11:40:24 EST 1994
-  README updated to reflect a modification just made to netlib's
-"dtoa.c from fp":
-96a97,105
-> Also add the rule
->
-> 	dtoa.o: dtoa.c
-> 		$(CC) -c $(CFLAGS) -DMALLOC=ckalloc -DIEEE... dtoa.c
->
-> (without the initial tab) to the makefile, where IEEE... is one of
-> IEEE_MC68k, IEEE_8087, VAX, or IBM, depending on your machine's
-> arithmetic.  See the comments near the start of dtoa.c.
->
-
-Sat Mar  5 09:41:52 EST 1994
-  Complain about functions with the name of a previously declared
-common block (which is illegal).
-  New option -d specifies the directory for output .c and .P files;
-f2c.1 and f2c.1t updated.  The former undocumented debug option -dnnn
-is now -Dnnn.
-
-Thu Mar 10 10:21:44 EST 1994
-  libf77: add #undef min and #undef max lines to s_paus.c s_stop.c
-and system_.c; Version.c not changed.
-  libi77: add -DPad_UDread lines to uio.c and explanation to README:
-    Some buggy Fortran programs use unformatted direct I/O to write
-    an incomplete record and later read more from that record than
-    they have written.  For records other than the last, the unwritten
-    portion of the record reads as binary zeros.  The last record is
-    a special case: attempting to read more from it than was written
-    gives end-of-file -- which may help one find a bug.  Some other
-    Fortran I/O libraries treat the last record no differently than
-    others and thus give no help in finding the bug of reading more
-    than was written.  If you wish to have this behavior, compile
-    uio.c with -DPad_UDread .
-Version.c not changed.
-
-Tue Mar 29 17:27:54 EST 1994
-  Adjust make_param so dimensions involving min, max, and other
-complicated constant expressions do not provoke error messages
-about adjustable dimensions on non-arguments.
-  Fix botch introduced 19 Jan 1994: "adjustable dimension on non-
-argument" messages could cause some things to be freed twice.
-
-Tue May 10 07:55:12 EDT 1994
-  Trivial changes to exec.c, p1output.c, parse_args.c, proc.c,
-and putpcc.c: change arguments from
-	type foo[]
-to
-	type *foo
-for consistency with defs.h.  For most compilers, this makes no
-difference.
-
-Thu Jun  2 12:18:18 EDT 1994
-  Fix bug in handling FORMAT statements that have adjacent character
-(or Hollerith) strings: an extraneous \002 appeared between the
-strings.
-  libf77: under -DNO_ONEXIT, arrange for f_exit to be called just
-once; previously, upon abnormal termination (including stop statements),
-it was called twice.
-
-Mon Jun  6 15:52:57 EDT 1994
-  libf77: Avoid references to SIGABRT and SIGIOT if neither is defined;
-Version.c not changed.
-  libi77: Add cast to definition of errfl() in fio.h; this only matters
-on systems with sizeof(int) < sizeof(long).  Under -DNON_UNIX_STDIO,
-use binary mode for direct formatted files (to avoid any confusion
-connected with \n characters).
-
-Fri Jun 10 16:47:31 EDT 1994
-  Fix bug under -A in handling unreferenced (and undeclared)
-external arguments in subroutines with multiple entry points.  Example:
-	subroutine m(fcn,futil)
-	external fcn,futil
-	call fcn
-	entry mintio(i1) ! (D_fp)0 rather than (U_fp)0 for futil
-	end
-
-Wed Jun 15 10:38:14 EDT 1994
-  Allow char(constant expression) function in parameter declarations.
-(This was probably broken in the changes of 29 March 1994.)
-
-Fri Jul  1 23:54:00 EDT 1994
-  Minor adjustments to makefile (rule for f2c.1 commented out) and
-sysdep.h (#undef KR_headers if __STDC__ is #defined, and base test
-for ANSI_Libraries and ANSI_Prototypes on KR_headers rather than
-__STDC__); version.c touched but not changed.
-  libi77: adjust fp.h so local.h is only needed under -DV10;
-Version.c not changed.
-
-Tue Jul  5 03:05:46 EDT 1994
-  Fix segmentation fault in
-	subroutine foo(a,b,k)
-	data i/1/
-	double precision a(k,1)	! sequence error: must precede data
-	b = a(i,1)
-	end
-  libi77: Fix bug (introduced 6 June 1994?) in reopening files under
-NON_UNIX_STDIO.
-  Fix some error messages caused by illegal Fortran.  Examples:
-* 1.
-	x(i) = 0  !Missing declaration for array x
-	call f(x) !Said Impossible storage class 8 in routine mkaddr
-	end	  !Now says invalid use of statement function x
-* 2.
-	f = g	!No declaration for g; by default it's a real variable
-	call g	!Said invalid class code 2 for function g
-	end	!Now says g cannot be called
-* 3.
-	intrinsic foo	!Invalid intrinsic name
-	a = foo(b)	!Said intrcall: bad intrgroup 0
-	end		!Now just complains about line 1
-
-Tue Jul  5 11:14:26 EDT 1994
-  Fix glitch in handling erroneous statement function declarations.
-Example:
-	a(j(i) - i) = a(j(i) - i) + 1	! bad statement function
-	call foo(a(3))	! Said Impossible type 0 in routine mktmpn
-	end		! Now warns that i and j are not used
-
-Wed Jul  6 17:31:25 EDT 1994
-  Tweak test for statement functions that (illegally) call themselves;
-f2c will now proceed to check for other errors, rather than bailing
-out at the first recursive statement function reference.
-  Warn about but retain divisions by 0 (instead of calling them
-"compiler errors" and quiting).  On IEEE machines, this permits
-	double precision nan, ninf, pinf
-	nan = 0.d0/0.d0
-	pinf = 1.d0/0.d0
-	ninf = -1.d0/0.d0
-	write(*,*) 'nan, pinf, ninf = ', nan, pinf, ninf
-	end
-to print
-	nan, pinf, ninf =   NaN  Infinity -Infinity
-  libi77: wref.c: protect with #ifdef GOOD_SPRINTF_EXPONENT an
-optimization that requires exponents to have 2 digits when 2 digits
-suffice.  lwrite.c wsfe.c (list and formatted external output):
-omit ' ' carriage-control when compiled with -DOMIT_BLANK_CC .
-Off-by-one bug fixed in character count for list output of character
-strings.  Omit '.' in list-directed printing of Nan, Infinity.
-
-Mon Jul 11 13:05:33 EDT 1994
-  src/gram.c updated.
-
-Tue Jul 12 10:24:42 EDT 1994
-  libi77: wrtfmt.c: under G11.4, write 0. as "  .0000    " rather
-than "  .0000E+00".
-
-Thu Jul 14 17:55:46 EDT 1994
-  Fix glitch in changes of 6 July 1994 that could cause erroneous
-"division by zero" warnings (or worse).  Example:
-	subroutine foo(a,b)
-	y = b
-	a = a / y	! erroneous warning of division by zero
-	end
-
-Mon Aug  1 16:45:17 EDT 1994
-  libi77: lread.c rsne.c: for benefit of systems with a buggy stdio.h,
-declare ungetc when neither KR_headers nor ungetc is #defined.
-Version.c not changed.
-
-Wed Aug  3 01:53:00 EDT 1994
-  libi77: lwrite.c (list output): do not insert a newline when
-appending an oversize item to an empty line.
-
-Mon Aug  8 00:51:01 EDT 1994
-  Fix bug (introduced 3 Feb. 1993) that, under -i2, kept LOGICAL*2
-variables from appearing in INQUIRE statements.  Under -I2, allow
-LOGICAL*4 variables to appear in INQUIRE.  Fix intrinsic function
-LEN so it returns a short value under -i2, a long value otherwise.
-  exec.c: fix obscure memory fault possible with bizarre (and highly
-erroneous) DO-loop syntax.
-
-Fri Aug 12 10:45:57 EDT 1994
-  libi77: fix glitch that kept ERR= (in list- or format-directed input)
-from working after a NAMELIST READ.
-
-Thu Aug 25 13:58:26 EDT 1994
-  Suppress -s when -C is specified.
-  Give full pathname (netlib@research.att.com) for netlib in readme and
-src/README.
-
-Wed Sep  7 22:13:20 EDT 1994
-  libi77: typesize.c: adjust to allow types LOGICAL*1, LOGICAL*2,
-INTEGER*1, and (under -DAllow_TYQUAD) INTEGER*8 in NAMELISTs.
-
-Fri Sep 16 17:50:18 EDT 1994
-  Change name adjustment for reserved words: instead of just appending
-"_" (a single underscore), append "_a_" to local variable names to avoid
-trouble when a common block is named a reserved word and the same
-reserved word is also a local variable name.  Example:
-	common /const/ a,b,c
-	real const(3)
-	equivalence (const(1),a)
-	a = 1.234
-	end
-  Arrange for ichar() to treat characters as unsigned.
-  libf77: s_cmp.c: treat characters as unsigned in comparisons.
-These changes for unsignedness only matter for strings that contain
-non-ASCII characters.  Now ichar() should always be >= 0.
-
-Sat Sep 17 11:19:32 EDT 1994
-  fc: set rc=$? before exit (to get exit code right in trap code).
-
-Mon Sep 19 17:49:43 EDT 1994
-  libf77: s_paus.c: flush stderr after PAUSE; add #ifdef MSDOS stuff.
-  libi77: README: point out general need for -DMSDOS under MS-DOS.
-
-Tue Sep 20 11:42:30 EDT 1994
-  Fix bug in comparing identically named common blocks, in which
-all components have the same names and types, but at least one is
-dimensioned (1) and the other is not dimensioned.  Example:
-	subroutine foo
-	common /ab/ a
-	a=1.	!!! translated correctly to ab_1.a = (float)1.;
-	end
-	subroutine goo
-	common /ab/ a(1)
-	a(1)=2.	!!! translated erroneously to ab_1.a[0] = (float)2.
-	end
-
-Tue Sep 27 23:47:34 EDT 1994
-  Fix bug introduced 16 Sept. 1994: don't add _a_ to C keywords
-used as external names.  In fact, return to earlier behavior of
-appending __ to C keywords unless they are used as external names,
-in which case they get just one underscore appended.
-  Adjust constant handling so integer and logical PARAMETERs retain
-type information, particularly under -I2.  Example:
-	SUBROUTINE FOO
-	INTEGER I
-	INTEGER*1 I1
-	INTEGER*2 I2
-	INTEGER*4 I4
-	LOGICAL L
-	LOGICAL*1 L1
-	LOGICAL*2 L2
-	LOGICAL*4 L4
-	PARAMETER (L=.FALSE., L1=.FALSE., L2=.FALSE., L4=.FALSE.)
-	PARAMETER (I=0,I1=0,I2=0,I4=0)
-	CALL DUMMY(I, I1, I2, I4, L, L1, L2, L4)
-	END
-  f2c.1t: Change f\^2c to f2c (omit half-narrow space) in line following
-".SH NAME" for benefit of systems that cannot cope with troff commands
-in this context.
-
-Wed Sep 28 12:45:19 EDT 1994
-  libf77: s_cmp.c fix glitch in -DKR_headers version introduced
-12 days ago.
-
-Thu Oct  6 09:46:53 EDT 1994
-  libi77: util.c: omit f__mvgbt (which is never used).
-  f2c.h: change "long" to "long int" to facilitate the adjustments
-by means of sed described above.  Comment out unused typedef of Long.
-
-Fri Oct 21 18:02:24 EDT 1994
-  libf77: add s_catow.c and adjust README to point out that changing
-"s_cat.o" to "s_catow.o" in the makefile will permit the target of a
-concatenation to appear on its right-hand side (contrary to the
-Fortran 77 Standard and at the cost of some run-time efficiency).
-
-Wed Nov  2 00:03:58 EST 1994
-  Adjust -g output to contain only one #line line per statement,
-inserting \ before the \n ending lines broken because of their
-length [this insertion was recanted 10 Dec. 1994].  This change
-accommodates an idiocy in the ANSI/ISO C standard, which leaves
-undefined the behavior of #line lines that occur within the arguments
-to a macro call.
-
-Wed Nov  2 14:44:27 EST 1994
-  libi77: under compilation with -DALWAYS_FLUSH, flush buffers at
-the end of each write statement, and test (via the return from
-fflush) for write failures, which can be caught with an ERR=
-specifier in the write statement.  This extra flushing slows
-execution, but can abort execution or alter the flow of control
-when a disk fills up.
-  f2c/src/io.c: Add ERR= test to e_wsle invocation (end of
-list-directed external output) to catch write failures when libI77
-is compiled with -DALWAYS_FLUSH.
-
-Thu Nov  3 10:59:13 EST 1994
-  Fix bug in handling dimensions involving certain intrinsic
-functions of constant expressions: the expressions, rather than
-pointers to them, were passed.  Example:
-      subroutine subtest(n,x)
-      real x(2**n,n) ! pow_ii(2,n) was called; now it's pow_ii(&c__2,n)
-      x(2,2)=3.
-      end
-
-Tue Nov  8 23:56:30 EST 1994
-  malloc.c: remove assumption that only malloc calls sbrk.  This
-appears to make malloc.c useful on RS6000 systems.
-
-Sun Nov 13 13:09:38 EST 1994
-  Turn off constant folding of integers used in floating-point
-expressions, so the assignment in
-	subroutine foo(x)
-	double precision x
-	x = x*1000000*500000
-	end
-is rendered as
-	*x = *x * 1000000 * 500000;
-rather than as
-	*x *= 1783793664;
-
-Sat Dec 10 16:31:40 EST 1994
-  Supply a better error message (than "Impossible type 14") for
-	subroutine foo
-	foo = 3
-	end
-  Under -g, convey name of included files to #line lines.
-  Recant insertion of \ introduced (under -g) 2 Nov. 1994.
-
-Thu Dec 15 14:33:55 EST 1994
-  New command-line option -Idir specifies directories in which to
-look for non-absolute include files (after looking in the directory
-of the current input file).  There can be several -Idir options, each
-specifying one directory.  All -Idir options are considered, from
-left to right, until a suitably named file is found.  The -I2 and -I4
-command-line options have precedence, so directories named 2 or 4
-must be spelled by some circumlocation, such as -I./2 .
-  f2c.ps updated to mention the new -Idir option, correct a typo,
-and bring the man page at the end up to date.
-  lex.c: fix bug in reading line numbers in #line lines.
-  fc updated to pass -Idir options to f2c.
-
-Thu Dec 29 09:48:03 EST 1994
-  Fix bug (e.g., addressing fault) in diagnosing inconsistency in
-the type of function eta in the following example:
-	function foo(c1,c2)
-	double complex foo,c1,c2
-	double precision eta
-	foo = eta(c1,c2)
-	end
-	function eta(c1,c2)
-	double complex eta,c1,c2
-	eta = c1*c2
-	end
-
-Mon Jan  2 13:27:26 EST 1995
-  Retain casts for SNGL (or FLOAT) that were erroneously optimized
-away.  Example:
-	subroutine foo(a,b)
-	double precision a,b
-	a = float(b)	! now rendered as *a = (real) (*b);
-	end
-  Use float (rather than double) temporaries in certain expressions
-of type complex.  Example: the temporary for sngl(b) in
-	complex a
-	double precision b
-	a = sngl(b) - (3.,4.)
-is now of type float.
-
-Fri Jan  6 00:00:27 EST 1995
-  Adjust intrinsic function cmplx to act as dcmplx (returning
-double complex rather than complex) if either of its args is of
-type double precision.  The double temporaries used prior to 2 Jan.
-1995 previously gave it this same behavior.
-
-Thu Jan 12 12:31:35 EST 1995
-  Adjust -krd to use double temporaries in some calculations of
-type complex.
-  libf77: pow_[dhiqrz][hiq].c: adjust x**i to work on machines
-that sign-extend right shifts when i is the most negative integer.
-
-Wed Jan 25 00:14:42 EST 1995
-  Fix memory fault in handling overlapping initializations in
-	block data
-	common /zot/ d
-	double precision d(3)
-	character*6 v(4)
-	real r(2)
-	equivalence (d(3),r(1)), (d(1),v(1))
-	data v/'abcdef', 'ghijkl', 'mnopqr', 'stuvwx'/
-	data r/4.,5./
-	end
-  names.c: add "far", "huge", "near" to c_keywords (causing them
-to have __ appended when used as local variables).
-  libf77: add s_copyow.c, an alternative to s_copy.c for handling
-(illegal) character assignments where the right- and left-hand
-sides overlap, as in a(2:4) = a(1:3).
-
-Thu Jan 26 14:21:19 EST 1995
-  libf77: roll s_catow.c and s_copyow.c into s_cat.c and s_copy.c,
-respectively, allowing the left-hand side of a character assignment
-to appear on its right-hand side unless s_cat.c and s_copy.c are
-compiled with -DNO_OVERWRITE (which is a bit more efficient).
-Fortran 77 forbids the left-hand side from participating in the
-right-hand side (of a character assignment), but Fortran 90 allows it.
-  libi77: wref.c: fix glitch in printing the exponent of 0 when
-GOOD_SPRINTF_EXPONENT is not #defined.
-
-Fri Jan 27 12:25:41 EST 1995
-  Under -C++ -ec (or -C++ -e1c), surround struct declarations with
-	#ifdef __cplusplus
-	extern "C" {
-	#endif
-and
-	#ifdef __cplusplus
-	}
-	#endif
-(This isn't needed with cfront, but apparently is necessary with
-some other C++ compilers.)
-  libf77: minor tweak to s_copy.c: copy forward whenever possible
-(for better cache behavior).
-
-Wed Feb  1 10:26:12 EST 1995
-  Complain about parameter statements that assign values to dummy
-arguments, as in
-	subroutine foo(x)
-	parameter(x = 3.4)
-	end
-
-Sat Feb  4 20:22:02 EST 1995
-  fc: omit "lib=/lib/num/lib.lo".
-
-Wed Feb  8 08:41:14 EST 1995
-  Minor changes to exec.c, putpcc.c to avoid "bad tag" or "error
-in frexpr" with certain invalid Fortran.
-
-Sat Feb 11 08:57:39 EST 1995
-  Complain about integer overflows, both in simplifying integer
-expressions, and in converting integers from decimal to binary.
-  Fix a memory fault in putcx1() associated with invalid input.
-
-Thu Feb 23 11:20:59 EST 1995
-  Omit MAXTOKENLEN; realloc token if necessary (to handle very long
-strings).
-
-Fri Feb 24 11:02:00 EST 1995
-  libi77: iio.c: z_getc: insert (unsigned char *) to allow internal
-reading of characters with high-bit set (on machines that sign-extend
-characters).
-
-Tue Mar 14 18:22:42 EST 1995
-  Fix glitch (in io.c) in handling 0-length strings in format
-statements, as in
-	write(*,10)
- 10	format(' ab','','cd')
-  libi77: lread.c and rsfe.c: adjust s_rsle and s_rsfe to check for
-end-of-file (to prevent infinite loops with empty read statements).
-
-Wed Mar 22 10:01:46 EST 1995
-  f2c.ps: adjust discussion of -P on p. 7 to reflect a change made
-3 Feb. 1993: -P no longer implies -A.
-
-Fri Apr 21 18:35:00 EDT 1995
-  fc script: remove absolute paths (since PATH specifies only standard
-places).  On most systems, it's still necessary to adjust the PATH
-assignment at the start of fc to fit the local conventions.
-
-Fri May 26 10:03:17 EDT 1995
-  fc script: add recognition of -P and .P files.
-  libi77: iio.c: z_wnew: fix bug in handling T format items in internal
-writes whose last item is written to an earlier position than some
-previous item.
-
-Wed May 31 11:39:48 EDT 1995
-  libf77: added subroutine exit(rc) (with integer return code rc),
-which works like a stop statement but supplies rc as the program's
-return code.
-
-Fri Jun  2 11:56:50 EDT 1995
-  Fix memory fault in
-	parameter (x=2.)
-	data x /2./
-	end
-This now elicits two error messages; the second ("too many
-initializers"), though not desirable, seems hard to eliminate
-without considerable hassle.
-
-Mon Jul 17 23:24:20 EDT 1995
-  Fix botch in simplifying constants in certain complex
-expressions.  Example:
-	subroutine foo(s,z)
-	double complex z
-	double precision s, M, P
-	parameter ( M = 100.d0, P = 2.d0 )
-	z = M * M  / s  * dcmplx (1.d0, P/M)
-*** The imaginary part of z was miscomputed ***
-	end
-  Under -ext, complain about nonintegral dimensions.
-
-Fri Jul 21 11:18:36 EDT 1995
-  Fix glitch on line 159 of init.c: change
-	"(shortlogical *)0)",
-to
-	"(shortlogical *)0",
-This affects multiple entry points when some but not all have
-arguments of type logical*2.
-  libi77: adjust lwrite.c, wref.c, wrtfmt.c so compiling with
--DWANT_LEAD_0 causes formatted writes of floating-point numbers of
-magnitude < 1 to have an explicit 0 before the decimal point (if the
-field-width permits it).  Note that the Fortran 77 Standard leaves it
-up to the implementation whether to supply these superfluous zeros.
-
-Tue Aug  1 09:25:56 EDT 1995
-  Permit real (or double precision) parameters in dimension expressions.
-
-Mon Aug  7 08:04:00 EDT 1995
-  Append "_eqv" rather than just "_" to names that that appear in
-EQUIVALENCE statements as well as structs in f2c.h (to avoid a
-conflict when these names also name common blocks).
-
-Tue Aug  8 12:49:02 EDT 1995
-  Modify yesterday's change: merge st_fields with c_keywords, to
-cope with equivalences introduced to permit initializing numeric
-variables with character data.  DATA statements causing these
-equivalences can appear after executable statements, so the only
-safe course is to rename all local variable with names in the
-former st_fields list.  This has the unfortunate side effect that
-the common local variable "i" will henceforth be renamed "i__".
-
-Wed Aug 30 00:19:32 EDT 1995
-  libf77: add F77_aloc, now used in s_cat and system_ (to allocate
-memory and check for failure in so doing).
-  libi77: improve MSDOS logic in backspace.c.
-
-Wed Sep  6 09:06:19 EDT 1995
-  libf77: Fix return type of system_ (integer) under -DKR_headers.
-  libi77: Move some f_init calls around for people who do not use
-libF77's main(); now open and namelist read statements that are the
-first I/O statements executed should work right in that context.
-Adjust namelist input to treat a subscripted name whose subscripts do
-not involve colons similarly to the name without a subscript:  accept
-several values, stored in successive elements starting at the
-indicated subscript.  Adjust namelist output to quote character
-strings (avoiding confusion with arrays of character strings).
-
-Thu Sep  7 00:36:04 EDT 1995
-  Fix glitch in integer*8 exponentiation function: it's pow_qq, not
-pow_qi.
-  libi77: fix some bugs with -DAllow_TYQUAD (for integer*8); when
-looking for the &name that starts NAMELIST input, treat lines whose
-first nonblank character is something other than &, $, or ? as
-comment lines (i.e., ignore them), unless rsne.c is compiled with
--DNo_Namelist_Comments.
-
-Thu Sep  7 09:05:40 EDT 1995
-  libi77: rdfmt.c:  one more tweak for -DAllow_TYQUAD.
-
-Tue Sep 19 00:03:02 EDT 1995
-  Adjust handling of floating-point subscript bounds (a questionable
-f2c extension) so subscripts in the generated C are of integral type.
-  Move #define of roundup to proc.c (where its use is commented out);
-version.c left at 19950918.
-
-Wed Sep 20 17:24:19 EDT 1995
-  Fix bug in handling ichar() under -h.
-
-Thu Oct  5 07:52:56 EDT 1995
-  libi77: wrtfmt.c: fix bug with t editing (f__cursor was not always
-zeroed in mv_cur).
-
-Tue Oct 10 10:47:54 EDT 1995
-  Under -ext, warn about X**-Y and X**+Y.  Following the original f77,
-f2c treats these as X**(-Y) and X**(+Y), respectively.  (They are not
-allowed by the official Fortran 77 Standard.)  Some Fortran compilers
-give a bizarre interpretation to larger contexts, making multiplication
-noncommutative: they treat X**-Y*Z as X**(-Y*Z) rather than X**(-Y)*Z,
-which, following the rules of Fortran 77, is the same as (X**(-Y))*Z.
-
-Wed Oct 11 13:27:05 EDT 1995
-  libi77: move defs of f__hiwater, f__svic, f__icptr from wrtfmt.c
-to err.c.  This should work around a problem with buggy loaders and
-sometimes leads to smaller executable programs.
-
-Sat Oct 21 23:54:22 EDT 1995
-  Under -h, fix bug in the treatment of ichar('0') in arithmetic
-expressions.
-  Demote to -dneg (a new command-line option not mentioned in the
-man page) imitation of the original f77's treatment of unary minus
-applied to a REAL operand (yielding a DOUBLE PRECISION result).
-Previously this imitation (which was present for debugging) occurred
-under (the default) -!R.  It is still suppressed by -R.
-
-Tue Nov  7 23:52:57 EST 1995
-  Adjust assigned GOTOs to honor SAVE declarations.
-  Add comments about ranlib to lib[FI]77/README and makefile.
-
-Tue Dec 19 22:54:06 EST 1995
-  libf77: s_cat.c: fix bug when 2nd or later arg overlaps lhs.
-
-Tue Jan  2 17:54:00 EST 1996
-  libi77: rdfmt.c: move #include "ctype.h" up before "stdlib.h"; no
-change to Version.c.
-
-Sun Feb 25 22:20:20 EST 1996
-  Adjust expr.c to permit raising the integer constants 1 and -1 to
-negative constant integral powers.
-  Avoid faulting when -T and -d are not followed by a directory name
-(immediately, without intervening spaces).
-
-Wed Feb 28 12:49:01 EST 1996
-  Fix a glitch in handling complex parameters assigned a "wrong" type.
-Example:
-	complex d, z
-	parameter(z = (0d0,0d0))
-	data d/z/	! elicited "non-constant initializer"
-	call foo(d)
-	end
-
-Thu Feb 29 00:53:12 EST 1996
-  Fix bug in handling character parameters assigned a char() value.
-Example:
-	character*2 b,c
-	character*1 esc
-	parameter(esc = char(27))
-	integer i
-	data (b(i:i),i=1,2)/esc,'a'/
-	data (c(i:i),i=1,2)/esc,'b'/	! memory fault
-	call foo(b,c)
-	end
-
-Fri Mar  1 23:44:51 EST 1996
-  Fix glitch in evaluating .EQ. and .NE. when both operands are
-logical constants (.TRUE. or .FALSE.).
-
-Fri Mar 15 17:29:54 EST 1996
-  libi77: lread.c, rsfe.c: honor END= in READ stmts with empty iolist.
-
-Tue Mar 19 23:08:32 EST 1996
-  lex.c: arrange for a "statement" consisting of a single short bogus
-keyword to elicit an error message showing the whole keyword.  The
-error message formerly omitted the last letter of the bad keyword.
-  libf77: s_cat.c: supply missing break after overlap detection.
-
-Mon May 13 23:35:26 EDT 1996
-  Recognize Fortran 90's /= as a synonym for .NE..  (<> remains a
-synonym for .NE..)
-  Emit an empty int function of no arguments to supply an external
-name to named block data subprograms (so they can be called somewhere
-to force them to be loaded from a library).
-  Fix bug (memory fault) in handling the following illegal Fortran:
-	parameter(i=1)
-	equivalence(i,j)
-	end
-  Treat cdabs, cdcos, cdexp, cdlog, cdsin, and cdsqrt as synonyms for
-the double complex intrinsics zabs, zcos, zexp, zlog, zsin, and zsqrt,
-respectively, unless -cd is specified.
-  Recognize the Fortran 90 bit-manipulation intrinsics btest, iand,
-ibclr, ibits, ibset, ieor, ior, ishft, and ishftc, unless -i90 is
-specified.  Note that iand, ieor, and ior are thus now synonyms for
-"and", "xor", and "or", respectively.
-  Add three macros (bit_test, bit_clear, bit_set) to f2c.h for use
-with btest, ibclr, and ibset, respectively.  Add new functions
-[lq]bit_bits, [lq]bit_shift, and [lq]_bit_cshift to libF77 for
-use with ibits, ishft, and ishftc, respectively.
-  Add integer function ftell(unit) (returning -1 on error) and
-subroutine fseek(unit, offset, whence, *) to libI77 (with branch to
-label * on error).
-
-Tue May 14 23:21:12 EDT 1996
-  Fix glitch (possible memory fault, or worse) in handling multiple
-entry points with names over 28 characters long.
-
-Mon Jun 10 01:20:16 EDT 1996
-  Update netlib E-mail and ftp addresses in f2c/readme and
-f2c/src/readme (which are different files) -- to reflect the upcoming
-breakup of AT&T.
-  libf77: trivial tweaks to F77_aloc.c and system_.c; Version.c not
-changed.
-  libi77: Adjust rsli.c and lread.c so internal list input with too
-few items in the input string will honor end= .
-
-Mon Jun 10 22:59:57 EDT 1996
-  Add Bits_per_Byte to sysdep.h and adjust definition of Table_size
-to depend on Bits_per_Byte (forcing Table_size to be a power of 2); in
-lex.c, change "comstart[c & 0xfff]" to "comstart[c & (Table_size-1)]"
-to avoid an out-of-range subscript on end-of-file.
-
-Wed Jun 12 00:24:28 EDT 1996
-  Fix bug in output.c (dereferencing a freed pointer) revealed in
-	print *		!np in out_call in output.c clobbered by free
-	end		!during out_expr.
-
-Wed Jun 19 08:12:47 EDT 1996
-  f2c.h: add types uinteger, ulongint (for libF77); add qbit_clear
-and qbit_set macros (in a commented-out section) for integer*8.
-  For integer*8, use qbit_clear and qbit_set for ibclr and ibset.
-  libf77: add casts to unsigned in [lq]bitshft.c.
-
-Thu Jun 20 13:30:43 EDT 1996
-  Complain at character*(*) in common (rather than faulting).
-  Fix bug in recognizing hex constants that start with "16#" (e.g.,
-16#1234abcd, which is a synonym for z'1234abcd').
-  Fix bugs in constant folding of expressions involving btest, ibclr,
-and ibset.
-  Fix bug in constant folding of rshift(16#80000000, -31) (on a 32-bit
-machine; more generally, the bug was in constant folding of
-rshift(ibset(0,NBITS-1), 1-NBITS) when f2c runs on a machine with
-long ints having NBITS bits.
-
-Mon Jun 24 07:58:53 EDT 1996
-  Adjust struct Literal and newlabel() function to accommodate huge
-source files (with more than 32767 newlabel() invocations).
-  Omit .c file when the .f file has a missing final end statement.
-
-Wed Jun 26 14:00:02 EDT 1996
-  libi77: Add discussion of MXUNIT (highest allowed Fortran unit number)
-to libI77/README.
-
-Fri Jun 28 14:16:11 EDT 1996
-  Fix glitch with -onetrip: the temporary variable used for nonconstant
-initial loop variable values was recycled too soon.  Example:
-	do i = j+1, k
-		call foo(i+1)	! temp for j+1 was reused here
-		enddo
-	end
-
-Tue Jul  2 16:11:27 EDT 1996
-  formatdata.c: add a 0 to the end of the basetype array (for TYBLANK)
-(an omission that was harmless on most machines).
-  expr.c: fix a dereference of NULL that was only possible with buggy
-input, such as
-	subroutine $sub(s)	! the '$' is erroneous
-	character s*(*)
-	s(1:) = ' '
-	end
-
-Sat Jul  6 00:44:56 EDT 1996
-  Fix glitch in the intrinsic "real" function when applied to a
-complex (or double complex) variable and passed as an argument to
-some intrinsic functions.  Example:
-	complex a
-	b = sqrt(a)
-	end
-  Fix glitch (only visible if you do not use f2c's malloc and the
-malloc you do use is defective in the sense that malloc(0) returns 0)
-in handling include files that end with another include (perhaps
-followed by comments).
-  Fix glitch with character*(*) arguments named "h" and "i" when
-the body of the subroutine invokes the intrinsic LEN function.
-  Arrange that after a previous "f2c -P foo.f" has produced foo.P,
-running "f2c foo.P foo.f" will produce valid C when foo.f contains
-	call sub('1234')
-	end
-	subroutine sub(msg)
-	end
-Specifically, the length argument in "call sub" is now suppressed.
-With or without foo.P, it is also now suppressed when the order of
-subprograms in file foo.f is reversed:
-	subroutine sub(msg)
-	end
-	call sub('1234')
-	end
-  Adjust copyright notices to reflect AT&T breakup.
-
-Wed Jul 10 09:25:49 EDT 1996
-  Fix bug (possible memory fault) in handling erroneously placed
-and inconsistent declarations.  Example that faulted:
-	character*1 w(8)
-	call foo(w)
-	end
-	subroutine foo(m)
-	data h /0.5/
-	integer m(2)	! should be before data
-	end
-  Fix bug (possible fault) in handling illegal "if" constructions.
-Example (that faulted):
-	subroutine foo(i,j)
-	if (i) then		! bug: i is integer, not logical
-	else if (j) then	! bug: j is integer, not logical
-	endif
-	end
-  Fix glitch with character*(*) argument named "ret_len" to a
-character*(*) function.
-
-Wed Jul 10 23:04:16 EDT 1996
-  Fix more glitches in the intrinsic "real" function when applied to a
-complex (or double complex) variable and passed as an argument to
-some intrinsic functions.  Example:
-	complex a, b
-	r = sqrt(real(conjg(a))) + sqrt(real(a*b))
-	end
-
-Thu Jul 11 17:27:16 EDT 1996
-  Fix a memory fault associated with complicated, illegal input.
-Example:
-	subroutine goo
-	character a
-	call foo(a)	! inconsistent with subsequent def and call
-	end
-	subroutine foo(a)
-	end
-	call foo(a)
-	end
-
-Wed Jul 17 19:18:28 EDT 1996
-  Fix yet another case of intrinsic "real" applied to a complex
-argument.  Example:
-	complex a(3)
-	x = sqrt(real(a(2)))	! gave error message about bad tag
-	end
-
-Mon Aug 26 11:28:57 EDT 1996
-  Tweak sysdep.c for non-Unix systems in which process ID's can be
-over 5 digits long.
-
-Tue Aug 27 08:31:32 EDT 1996
-  Adjust the ishft intrinsic to use unsigned right shifts.  (Previously,
-a negative constant second operand resulted in a possibly signed shift.)
-
-Thu Sep 12 14:04:07 EDT 1996
-  equiv.c: fix glitch with -DKR_headers.
-  libi77: fmtlib.c: fix bug in printing the most negative integer.
-
-Fri Sep 13 08:54:40 EDT 1996
-  Diagnose some illegal appearances of substring notation.
-
-Tue Sep 17 17:48:09 EDT 1996
-  Fix fault in handling some complex parameters.  Example:
-	subroutine foo(a)
-	double complex a, b
-	parameter(b = (0,1))
-	a = b	! f2c faulted here
-	end
-
-Thu Sep 26 07:47:10 EDT 1996
-  libi77:  fmt.h:  for formatted writes of negative integer*1 values,
-make ic signed on ANSI systems.  If formatted writes of integer*1
-values trouble you when using a K&R C compiler, switch to an ANSI
-compiler or use a compiler flag that makes characters signed.
-
-Tue Oct  1 14:41:36 EDT 1996
-  Give a better error message when dummy arguments appear in data
-statements.
-
-Thu Oct 17 13:37:22 EDT 1996
-  Fix bug in typechecking arguments to character and complex (or
-double complex) functions; the bug could cause length arguments
-for character arguments to be omitted on invocations appearing
-textually after the first invocation.  For example, in
-	subroutine foo
-	character c
-	complex zot
-	call goo(zot(c), zot(c))
-	end
-the length was omitted from the second invocation of zot, and
-there was an erroneous error message about inconsistent calling
-sequences.
-
-Wed Dec  4 13:59:14 EST 1996
-  Fix bug revealed by
-	subroutine test(cdum,rdum)
-	complex cdum
-	rdum=cos(real(cdum))	! "Unexpected tag 3 in opconv_fudge"
-	end
-  Fix glitch in parsing "DO 10 D0 = 1, 10".
-  Fix glitch in parsing
-	real*8 x
-	real*8 x	! erroneous "incompatible type" message
-	call foo(x)
-	end
-
-Mon Dec  9 23:15:02 EST 1996
-  Fix glitch in parameter adjustments for arrays whose lower
-bound depends on a scalar argument.  Example:
-	subroutine bug(p,z,m,n)
-	integer z(*),m,n
-	double precision p(z(m):z(m) + n)	! p_offset botched
-	call foo(p(0), p(n))
-	end
-  libi77: complain about non-positive rec= in direct read and write
-statements.
-  libf77: trivial adjustments; Version.c not changed.
-
-Wed Feb 12 00:18:03 EST 1997
-  output.c: fix (seldom problematic) glitch in out_call: put parens
-around the ... in a test of the form "if (q->tag == TADDR && ...)".
-  vax.c: fix bug revealed in the "psi_offset =" assignment in the
-following example:
-	subroutine foo(psi,m)
-	integer z(100),m
-	common /a/ z
-	double precision psi(z(m):z(m) + 10)
-	call foo(m+1, psi(0),psi(10))
-	end
-
-Mon Feb 24 23:44:54 EST 1997
-  For consistency with f2c's current treatment of adjacent character
-strings in FORMAT statements, recognize a Hollerith string following
-a string (and merge adjacent strings in FORMAT statements).
-
-Wed Feb 26 13:41:11 EST 1997
-  New libf2c.zip, a combination of the libf77 and libi77 bundles (and
-available only by ftp).
-  libf77: adjust functions with a complex output argument to permit
-aliasing it with input arguments.  (For now, at least, this is just
-for possible benefit of g77.)
-  libi77: tweak to ftell_.c for systems with strange definitions of
-SEEK_SET, etc.
-
-Tue Apr  8 20:57:08 EDT 1997
-  libf77: [cz]_div.c: tweaks invisible on most systems (that may
-improve things slightly with optimized compilation on systems that use
-gratuitous extra precision).
-  libi77: fmt.c: adjust to complain at missing numbers in formats
-(but still treat missing ".nnn" as ".0").
-
-Fri Apr 11 14:05:57 EDT 1997
-  libi77: err.c: attempt to make stderr line buffered rather than
-fully buffered.  (Buffering is needed for format items T and TR.)
-
-Thu Apr 17 22:42:43 EDT 1997
- libf77: add F77_aloc.o to makefile (and makefile.u in libf2c.zip).
-
-Fri Apr 25 19:32:09 EDT 1997
- libf77: add [de]time_.c (which may give trouble on some systems).
-
-Tue May 27 09:18:52 EDT 1997
- libi77: ftell_.c: fix typo that caused the third argument to be
-treated as 2 on some systems.
-
-Mon Jun  9 00:04:37 EDT 1997
- libi77 (and libf2c.zip): adjust include order in err.c lread.c wref.c
-rdfmt.c to include fmt.h (etc.) after system includes.  Version.c not
-changed.
-
-Mon Jul 21 16:04:54 EDT 1997
-  proc.c: fix glitch in logic for "nonpositive dimension" message.
-  libi77: inquire.c: always include string.h (for possible use with
--DNON_UNIX_STDIO); Version.c not changed.
-
-Thu Jul 24 17:11:23 EDT 1997
-  Tweak "Notice" to reflect the AT&T breakup -- we missed it when
-updating the copyright notices in the source files last summer.
-  Adjust src/makefile so malloc.o is not used by default, but can
-be specified with "make MALLOC=malloc.o".
-  Add comments to src/README about the "CRAY" T3E.
-
-Tue Aug  5 14:53:25 EDT 1997
-  Add definition of calloc to malloc.c; this makes f2c's malloc
-work on some systems where trouble hitherto arose because references
-to calloc brought in the system's malloc.  (On sensible systems,
-calloc is defined separately from malloc.  To avoid confusion on
-other systems, f2c/malloc.c now defines calloc.)
-  libi77: lread.c: adjust to accord with a change to the Fortran 8X
-draft (in 1990 or 1991) that rescinded permission to elide quote marks
-in namelist input of character data; to get the old behavior, compile
-with F8X_NML_ELIDE_QUOTES #defined.  wrtfmt.o: wrt_G: tweak to print
-the right number of 0's for zero under G format.
-
-Sat Aug 16 05:45:32 EDT 1997
-  libi77: iio.c: fix bug in internal writes to an array of character
-strings that sometimes caused one more array element than required by
-the format to be blank-filled.  Example: format(1x).
-
-Wed Sep 17 00:39:29 EDT 1997
-  libi77: fmt.[ch] rdfmt.c wrtfmt.c: tweak struct syl for machines
-with 64-bit pointers and 32-bit ints that did not 64-bit align
-struct syl (e.g., Linux on the DEC Alpha).  This change should be
-invisible on other machines.
-
-Sun Sep 21 22:05:19 EDT 1997
-  libf77: [de]time_.c (Unix systems only): change return type to double.
-
-Thu Dec  4 22:10:09 EST 1997
-  Fix bug with handling large blocks of comments (over 4k); parts of the
-second and subsequent blocks were likely to be lost (not copied into
-comments in the resulting C).  Allow comment lines to be longer before
-breaking them.
-
-Mon Jan 19 17:19:27 EST 1998
-  makefile: change the rule for making gram.c to one for making gram1.c;
-henceforth, asking netlib to "send all from f2c/src" will bring you a
-working gram.c.  Nowadays there are simply too many broken versions of
-yacc floating around.
-  libi77: backspace.c: for b->ufmt==0, change sizeof(int) to
-sizeof(uiolen).  On machines where this would make a difference, it is
-best for portability to compile libI77 with -DUIOLEN_int, which will
-render the change invisible.
-
-Tue Feb 24 08:35:33 EST 1998
-  makefile: remove gram.c from the "make clean" rule.
-
-Wed Feb 25 08:29:39 EST 1998
-  makefile: change CFLAGS assignment to -O; add "veryclean" rule.
-
-Wed Mar  4 13:13:21 EST 1998
-  libi77: open.c: fix glitch in comparing file names under
--DNON_UNIX_STDIO.
-
-Mon Mar  9 23:56:56 EST 1998
-  putpcc.c: omit an unnecessary temporary variable in computing
-(expr)**3.
-  libf77, libi77: minor tweaks to make some C++ compilers happy;
-Version.c not changed.
-
-Wed Mar 18 18:08:47 EST 1998
-  libf77: minor tweaks to [ed]time_.c; Version.c not changed.
-  libi77: endfile.c, open.c: acquire temporary files from tmpfile(),
-unless compiled with -DNON_ANSI_STDIO, which uses mktemp().
-New buffering scheme independent of NON_UNIX_STDIO for handling T
-format items.  Now -DNON_UNIX_STDIO is no longer be necessary for
-Linux, and libf2c no longer causes stderr to be buffered -- the former
-setbuf or setvbuf call for stderr was to make T format items work.
-open.c: use the Posix access() function to check existence or
-nonexistence of files, except under -DNON_POSIX_STDIO, where trial
-fopen calls are used.  In open.c, fix botch in changes of 19980304.
-  libf2c.zip: the PC makefiles are now set for NT/W95, with comments
-about changes for DOS.
-
-Fri Apr  3 17:22:12 EST 1998
-  Adjust fix of 19960913 to again permit substring notation on
-character variables in data statements.
-
-Sun Apr  5 19:26:50 EDT 1998
-  libi77: wsfe.c: make $ format item work: this was lost in the changes
-of 17 March 1998.
-
-Sat May 16 19:08:51 EDT 1998
-  Adjust output of ftnlen constants: rather than appending L,
-prepend (ftnlen).  This should make the resulting C more portable,
-e.g., to systems (such as DEC Alpha Unix systems) on which long
-may be longer than ftnlen.
-  Adjust -r so it also casts REAL expressions passed to intrinsic
-functions to REAL.
-
-Wed May 27 16:02:35 EDT 1998
-  libf2c.zip: tweak description of compiling libf2c for INTEGER*8
-to accord with makefile.u rather than libF77/makefile.
-
-Thu May 28 22:45:59 EDT 1998
-  libi77: backspace.c dfe.c due.c iio.c lread.c rsfe.c sue.c wsfe.c:
-set f__curunit sooner so various error messages will correctly
-identify the I/O unit involved.
-  libf2c.zip: above, plus tweaks to PC makefiles: for some purposes,
-it's still best to compile with -DMSDOS (even for use with NT).
-
-Thu Jun 18 01:22:52 EDT 1998
-  libi77: lread.c: modified so floating-point numbers (containing
-either a decimal point or an exponent field) are treated as errors
-when they appear as list input for integer data.  Compile lread.c with
--DALLOW_FLOAT_IN_INTEGER_LIST_INPUT to restore the old behavior.
-
-Mon Aug 31 10:38:54 EDT 1998
-  formatdata.c: if possible, and assuming doubles must be aligned on
-double boundaries, use existing holes in DATA for common blocks to
-force alignment of the block.  For example,
-	block data
-	common /abc/ a, b
-	double precision a
-	integer b(2)
-	data b(2)/1/
-	end
-used to generate
-	struct {
-	    integer fill_1[3];
-	    integer e_2;
-	    doublereal e_3;
-	    } abc_ = { {0}, 1, 0. };
-and now generates
-	struct {
-	    doublereal fill_1[1];
-	    integer fill_2[1];
-	    integer e_3;
-	    } abc_ = { {0}, {0}, 1 };
-In the old generated C, e_3 was added to force alignment; in the new C,
-fill_1 does this job.
-
-Mon Sep  7 19:48:51 EDT 1998
-  libi77: move e_wdfe from sfe.c to dfe.c, where it was originally.
-Why did it ever move to sfe.c?
-
-Tue Sep  8 10:22:50 EDT 1998
-  Treat dreal as a synonym for dble unless -cd is specified on the
-command line.
-
-Sun Sep 13 22:23:41 EDT 1998
-  format.c: fix bug in writing prototypes under f2c -A ... *.P:
-under some circumstances involving external functions with no known
-type, a null pointer was passed to printf.
-
-Tue Oct 20 23:25:54 EDT 1998
-  Comments added to libf2c/README and libF77/README, pointing out
-the need to modify signal1.h on some systems.
-
-Wed Feb 10 22:59:52 EST 1999
-  defs.h lex.c: permit long names (up to at least roughly
-MAX_SHARPLINE_LEN = 1000 characters long) in #line lines (which only
-matters under -g).
-  fc: add -U option; recognize .so files.
-
-Sat Feb 13 10:18:27 EST 1999
- libf2c: endfile.c, lread.c, signal1.h0: minor tweaks to make some
-(C++) compilers happier; f77_aloc.c: make exit_() visible to C++
-compilers.  Version strings not changed.
-
-Thu Mar 11 23:14:02 EST 1999
-  Modify f2c (exec.c, expr.c) to diagnose incorrect mixing of types
-when (f2c extended) intrinsic functions are involved, as in
-(not(17) .and. 4).  Catching this in the first executable statement
-is a bit tricky, as some checking must be postponed until all statement
-function declarations have been parsed.  Thus there is a chance of
-today's changes introducing bugs under (let us hope) unusual conditions.
-
-Sun Mar 28 13:17:44 EST 1999
-  lex.c: tweak to get the file name right in error messages caused
-by statements just after a # nnn "filename" line emitted by the C
-preprocessor.  (The trouble is that the line following the # nnn line
-must be read to see if it is a continuation of the stuff that preceded
-the # nnn line.)  When # nnn "filename" lines appear among the lines
-for a Fortran statement, the filename reported in an error message for
-the statement should now be the file that was current when the first
-line of the statement was read.
-
-Sun May  2 22:38:25 EDT 1999
-  libf77, libi77, libf2c.zip: make getenv_() more portable (call
-getenv() rather than knowing about char **environ); adjust some
-complex intrinsics to work with overlapping arguments (caused by
-inappropriate use of equivalence); open.c: get "external" versus
-"internal" right in the error message if a file cannot be opened;
-err.c: cast a pointer difference to (int) for %d; rdfmt.c: omit
-fixed-length buffer that could be overwritten by formats Inn or Lnn
-with nn > 83.
-
-Mon May  3 13:14:07 EDT 1999
-  "Invisible" changes to omit a few compiler warnings in f2c and
-libf2c; two new casts in libf2c/open.c that matter with 64-bit longs,
-and one more tweak (libf2c/c_log.c) for pathological equivalences.
-  Minor update to "fc" script: new -L flag and comment correction.
-
-Fri Jun 18 02:33:08 EDT 1999
-  libf2c.zip: rename backspace.c backspac.c, and fix a glitch in it
--- b->ufd may change in t_runc().  (For now, it's still backspace.c
-in the libi77 bundle.)
-
-Sun Jun 27 22:05:47 EDT 1999
-  libf2c.zip, libi77: rsne.c: fix bug in namelist input: a misplaced
-increment could cause wrong array elements to be assigned; e.g.,
-"&input k(5)=10*1 &end" assigned k(5) and k(15 .. 23).
-
-Tue Sep  7 14:10:24 EDT 1999
-  f2c.h, libf2c/f2c.h0, libf2c/README: minor tweaks so a simple
-sed command converts f2c.h == libf2c/f2c.h0 to a form suitable for
-machines with 8-byte longs and doubles, 4-byte int's and floats,
-while working with a forthcoming (ill-advised) update to the C
-standard that outlaws plain "unsigned".
-  f2c.h, libf2c/f2c.h0: change "if 0" to "#ifdef INTEGER_STAR_8".
-  libf77, libf2c.zip: [cz]_div.c and README: arrange for compilation
-under -DIEEE_COMPLEX_DIVIDE to make these routines avoid calling sig_die
-when the denominator of a complex or double complex division vanishes;
-instead, they return pairs of NaNs or Infinities, depending whether the
-numerator also vanishes or not.
-
-Tue Oct  5 23:50:14 EDT 1999
-  formatdata.c, io.c, output.c, sysdep.c: adjust to make format
-strings legal when they contain 8-bit characters with the high bit on.
-(For many C compilers, this is not necessary, but it the ANSI/ISO C
-standard does not require this to work.)
-  libf2c.zip: tweak README and correct xsum0.out.
-
-Mon Oct 25 17:30:54 EDT 1999
-  io.c: fix glitch introduced in the previous change (19991005) that
-caused format(' %') to print "%%" rather than "%".
-
-Mon Nov 15 12:10:35 EST 1999
-  libf2c.zip: fix bug with the sequence backspace(n); endfile(n);
-rewind(n); read(n).  Supply missing (long) casts in a couple of places
-where they matter when size(ftnint) == sizeof(int) < sizeof(long).
-
-Tue Jan 18 19:22:24 EST 2000
-  Arrange for parameter statements involving min(...) and max(...)
-functions of three or more arguments to work.
-  Warn about text after "end" (rather than reporting a syntax error
-with a surprising line number).
-  Accept preprocessor line numbers of the form "# 1234" (possibly
-with trailing blanks).
-  Accept a comma after write(...) and before a list of things to write.
-
-Fri Jan 21 17:26:27 EST 2000
-  Minor updates to make compiling Win32 console binaries easier.  A
-side effect is that the MSDOS restriction of only one Fortran file
-per invocation is lifted (and "f2c *.f") works.
-
-Tue Feb  1 18:38:32 EST 2000
-  f2c/src/tokdefs.h added (to help people on non-Unix systems -- the
-makefile has always had a rule for generating tokdefs.h).
-
-Fri Mar 10 18:48:17 EST 2000
-  libf77, libf2c.zip: z_log.c: the real part of the double complex log
-of numbers near, e.g., (+-1,eps) with |eps| small is now more accurate.
-For example if z = (1,1d-7), then "write(*,*) z" now writes
-"(5.E-15,1.E-07" rather than the previous "(4.88498131E-15,1.E-07)".
-
-Thu Apr 20 13:02:54 EDT 2000
-  libf77, libi77, libf2c.zip: s_cat.c, rsne.c, xwsne.c: fix type
-errors that only matter if sizeof(ftnint) != sizeof(ftnlen).
-
-Tue May 30 23:36:18 EDT 2000
-  expr.c: adjust subcheck() to use a temporary variable of type TYLONG
-rather than TYSHORT under -C -I2.
-
-Wed May 31 08:48:03 EDT 2000
-  Simplify yesterday's adjustment; today's change should be invisible.
-
-Tue Jul  4 22:52:21 EDT 2000
-  misc.c, function "addressable": fix fault with "f2c -I2 foo.f" when
-foo.f consists of the 4 lines
-	subroutine foo(c)
-	character*(*) c
-	i = min(len(c),23)
-	end
-  Sundry files: tweaks for portability, e.g., for compilation by overly
-fastidious C++ compilers; "false" and "true" now treated as C keywords
-(so they get two underscores appended).
-  libf77, libi77, libf2c.zip: "invisible" adjustments to permit
-compilation by C++ compilers; version numbers not changed.
-
-Thu Jul  6 23:46:07 EDT 2000
-  Various files: tweaks to banish more compiler warnings.
-  lib?77, libf2c.zip/makefile.u: add "|| true" to ranlib invocations.
-  Thanks to Nelson H. F. Beebe for messages leading to these changes
-(and to many of the ones two days ago).
-  xsum.c: tweak include order.
-
-Fri Jul  7 18:01:25 EDT 2000
-  fc: accept -m xxx or -mxxx, pass them to the compiler as -mxxx
-(suggestion of Nelson Beebe).  Note that fc simply appends to CFLAGS,
-so system-specific stuff can be supplied in the environment variable
-CFLAGS.  With some shells, invocations of the form
-	CFLAGS='system-specific stuff' fc ...
-are one way to do this.
-
-Thu Aug 17 21:38:36 EDT 2000
-  Fix obscure glitch: in "Error on line nnn of ...: Bad # line:...",
-get nnn right.
-
-Sat Sep 30 00:28:30 EDT 2000
-  libf77, libf2c.zip: dtime_.c, etime_.c: use floating-point divide;
-dtime_.d, erf_.c, erfc_.c, etime.c: for use with "f2c -R", compile with
--DREAL=float.
-
-Tue Dec  5 22:55:56 EST 2000
-  lread.c: under namelist input, when reading a logical array, treat
-Tstuff= and Fstuff= as new assignments rather than as logical constants.
-
-Fri Feb 23 00:43:56 EST 2001
-  libf2c: endfile.c: adjust to use truncate() unless compiled with
--DNO_TRUNCATE (or with -DMSDOS).  Add libf2c/mkfile.plan9.
-
-Sat Feb 24 21:14:24 EST 2001
-  Prevent malloc(0) when a subroutine of no arguments has an entry
-with no arguments, as in
-	subroutine foo
-	entry goo
-	end
-  Fix a fault that was possible when MAIN (illegally) had entry points.
-  Fix a buffer overflow connected with the error message for names more
-than MAXNAMELEN (i.e., 50) bytes long.
-  Fix a bug in command-line argument passing that caused the invocation
-"f2c -!czork foo.f" to complain about two invalid flags ('-ork' and
-'-oo.f') instead of just one ('-ork').
-  fc: add -s option (strip executable); portability tweaks.
-  Adjustments to handing of integer*8 to permit processing 8-byte hex,
-binary, octal, and decimal constants.  The adjustments are only
-available when type long long (for >= 64 bit integers) is available to
-f2c; they are assumed available unless f2c is compiled with either
--DNO_TYQUAD or -DNO_LONGLONG.  As has long been the case, compilation
-of f2c itself with -DNO_TYQUAD eliminates recognition of integer*8
-altogether.  Compilation with just -DNO_LONGLONG permits the previous
-handling of integer*8, which could only handle 32-bit constants
-associated with integer*8 variables.
-  New command-line argument -i8const (available only when f2c itself
-is compiled with neither -DNO_TYQUAD nor -DNO_LONGLONG) suppresses
-the new automatic promotion of integer constants too long to express
-as 32-bit values to type integer*8.  There are corresponding updates
-to f2c.1 and f2c.1t.
-
-Wed Feb 28 00:50:04 EST 2001
-  Adjust misc.c for (older) systems that recognize long long but do not
-have LLONG_MAX or LONGLONG_MAX in limits.h.
-  main.c: filter out bad files before dofork loop to avoid trouble
-in Win32 "f2c.exe" binaries.
-
-Thu Mar  1 16:25:19 EST 2001
-  Cosmetic change for consistency with some other netlib directories:
-change NO_LONGLONG to NO_LONG_LONG.  (This includes adjusting the above
-entry for Feb 23 2001.)  No change (other than timestamp) to version.c.
-  libf2c:  endfile.c:  switch to ftruncate (absent -DNO_TRUNCATE),
-thus permitting truncation of scratch files on true Unix systems,
-where scratch files have no name.  Add an fflush() (surprisingly)
-needed on some Linux systems.
-
-Tue Mar 20 22:03:23 EST 2001
-  expr.c:  complain ("impossible conversion") about attempts to assign
-character expressions ... to integer variables, rather than implicitly
-assigning ichar(...).
-
-Sat Jun 23 23:08:22 EDT 2001
-  New command-line option -trapuv adds calls on _uninit_f2c() to prologs
-to dynamically initialize local variables, except those appearing in
-SAVE or DATA statements, with values that may help find references to
-uninitialized variables.  For example, with IEEE arithmetic, floating-
-point variables are initialized to signaling NaNs.
-  expr.c: new warning for out-of-bounds constant substring expressions.
-Under -C, such expressions now inhibit C output.
-  libf2c/mkfile.plan9: fix glitch with rule for "check" (or xsum.out).
-  libf2c.zip: add uninit.c (for _uninit_f2c()) in support of -trapuv.
-  fc, f2c.1, f2c.1t: adjust for -trapuv.
-
-Thu Jul  5 22:00:51 EDT 2001
-  libf2c.zip: modify uninit.c for __mc68k__ under Linux.
-
-Wed Aug 22 08:01:37 EDT 2001
-  cds.c, expr.c: in constants, preserve the sign of 0.
-  expr.c: fix some glitches in folding constants to integer*8
-(when NO_LONG_LONG is not #defined).
-  intr.c: fold constant min(...) and max(...) expressions.
-
-Fri Nov 16 02:00:03 EST 2001
-  libf2c.zip:  tweak to permit handling files over 2GB long where
-possible, with suitable -D options, provided for some systems in
-new header file sysdep1.h (copied from sysdep1.h0 by default).
-Add an fseek to endfile.c to fix a glitch on some systems.
-
-Wed Nov 28 17:58:12 EST 2001
-  libf2c.zip:  on IEEE systems, print -0 as -0 when the relevant
-libf2c/makefile.* is suitably adjusted:  see comments about
--DSIGNED_ZEROS in libf2c/makefile.*.
-
-Fri Jan 18 16:17:44 EST 2002
-  libf2c.zip:   fix bugs (reported by Holger Helmke) in qbit_bits():
-wrong return type, missing ~ on y in return value.  This affects
-the intrinsic ibits function for first argument of type integer*8.
-
-Thu Feb  7 17:14:43 EST 2002
-  Fix bug handling leading array dimensions in common:  invalid C
-resulted.  Example (after one provided by Dmitry G. Baksheyev):
-
-	subroutine foo(a)
-	common/c/m
-	integer m, n
-	equivalence(m,n)
-	integer a(n,2)
-	a(1,2) = 3
-	end
-
-  Fix a bug, apparently introduced sometime after 19980913, in
-handling certain substring expressions that involve temporary
-assignments and the first invocation of an implicitly typed function.
-When the expressions appeared in "else if (...)"  and "do while(...)",
-the temporary assignments appeared too soon.  Examples are hard to
-find, but here is one (after an example provided by Nat Bachman):
-
-	subroutine foo(n)
-	character*8 s
-	do while (moo(s(n+1:n+2)) .ge. 2)
-		n = n + 1
-		enddo
-	end
-
-It is hard for f2c to get this sort of example correct when the
-"untyped" function is a generic intrinsic.  When incorrect code would
-otherwise result, f2c now issues an error message and declines to
-produce C.  For example,
-
-	subroutine foo(n)
-	character*8 s
-	double precision goo
-	do while (sin(goo(s(n+1:n+2))) .ge. 2)
-		n = n + 1
-		enddo
-	end
-
-gives the new error message, but both
-
-	subroutine foo(n)
-	character*8 s
-	double precision goo
-	do while (dsin(goo(s(n+1:n+2))) .ge. 2)
-		n = n + 1
-		enddo
-	end
-and
-	subroutine foo(n)
-	character*8 s
-	double precision goo
-	do while (sin(goo(min(n, (n-3)**2))) .ge. 2)
-		n = n + 1
-		enddo
-	end
-
-give correct C.
-
-Fri Feb  8 08:43:40 EST 2002
-  Make a cleaner fix of the bug fixed yesterday in handling certain
-"do while(...)" and "else if (...)" constructs involving auxiliary
-assignments.  (Yesterday's changes to expr.c are recanted; expr.c
-is now restored to that of 20010820.)  Now
-
-	subroutine foo(n)
-	character*8 s
-	double precision goo
-	do while (sin(goo(s(n+1:n+2))) .ge. 0.2)
-		n = n + 1
-		enddo
-	end
-
-is correctly translated.
-
-Thu Mar 14 12:53:08 EST 2002
-  lex.c:  adjust to avoid an error message under -72 when source files
-are in CRLF form ("text mode" on Microsoft systems), a source line is
-exactly 72 characters long, and f2c is run on a system (such as a Unix
-or Linux system) that does not distinguish text and binary modes.
-Example (in CRLF form):
-      write(*,*)"Hello world, with a source line that is 72 chars long."
-      end
-  libf2c/z_log.c:  add code to cope with buggy compilers (e.g., some
-versions of gcc under -O2 or -O3) that do floating-point comparisons
-against values computed into extended-precision registers on some
-systems (such as Intel IA32 systems).  Compile with
--DNO_DOUBLE_EXTENDED to omit the kludge that circumvents this bug.
-
-Thu May  2 19:09:01 EDT 2002
-  src/misc.c, src/sysdep.h, src/gram.c: tweaks for KR_headers (a rare
-concern today); version.c touched but left unchanged.
-  libf2c: fix glitch in makefile.vc; KR_header tweaks in s_stop.c
-and uninit.c (which also had a misplaced #endif).
-
-Wed Jun  5 16:13:34 EDT 2002
-  libf2c: uninit.c: for Linux on an ARM processor, add some
-#ifndef _FPU... tests; f77vers.c not changed.
-
-Tue Jun 25 15:13:32 EDT 2002
-  New command-line option -K requests old-style ("K&R") C.  The
-default is changed to -A (ANSI/ISO style).
-  Under -K, cast string-length arguments to (ftnlen).  This should
-matter only in the unusual case that "readme" instructs obtaining
-f2c.h by
-	sed 's/long int /long long /' f2c.h0 >f2c.h
-  Increase defaults for some table sizes:  make -Nn802 -Nq300 -Nx400
-the default.
-
-Fri Sep  6 18:39:24 EDT 2002
-  libf2c.zip: rsne.c: fix bug with multiple repeat counts in reading
-namelists, e.g., &nl a(2) = 3*1.0, 2*2.0, 3*3.0 /
-(Bug found by Jim McDonald, reported by Toon Moene.)
-
-Fri Oct  4 10:23:51 EDT 2002
-  libf2c.zip: uninit.c: on IRIX systems, omit references to shell
-variables (a dreg).  This only matters with f2c -trapuv .
-
-Thu Dec 12 22:16:00 EST 2002
-  proc.c: tweak to omit "* 1" from "a_offset = 1 + a_dim1 * 1;".
-  libf2c.zip: uninit.c: adjust to work with HP-UX B.11.11 as well as
-HP-UX B.10.20; f77vers.c not changed.
-
-Tue Feb 11 08:19:54 EST 2003
-  Fix a fault with f2c -s on the following example of invalid Fortran
-(reported by Nickolay A. Khokhlov); "function" should appear before
-"cat" on the first line:
-	character*(*) cat(a, b)
-	character*(*) a, b
-	cat = a // b
-	end
-  Issue warnings about inappropriate uses of arrays a, b, c and pass
-a temporary for d in
-	real a(2), b(2), c(2), d
-	call foo((a), 1*b, +c, +d)
-	end
-(correcting bugs reported by Arnaud Desitter).
-
-Thu Mar  6 22:48:08 EST 2003
-  output.c: fix a bug leading to "Unexpected tag 4 in opconv_fudge"
-when f2c -s processes the real part of a complex array reference.
-Example (simplified from netlib/linpack/zchdc.f):
-
-	subroutine foo(a,work,n,k)
-	integer k, n
-	complex*16 a(n,n), work(n)
-	work(k) = dcmplx(dsqrt(dreal(a(k,k))),0.0d0)
-	end
-
-(Thanks to Nickolay A. Khokhlov for the bug report.)
-
-Thu Mar 20 13:50:12 EST 2003
-  format.c:  code around a bug (reported by Nelson H. F. Beebe) in
-some versions of FreeBSD.  Compiling with __FreeBSD__ but not
-NO_FSCANF_LL_BUG #defined or with FSCANF_LL_BUG #defined causes
-special logic to replace  fscanf(infile, "%llx", result)  with
-custom logic.  Here's an example (from Beebe) where the bug bit:
-	integer*8 m, n
-	m = 9223372036854775807
-	end
-
-Fri Mar 21 13:14:05 EST 2003
-  libf2c.zip: err.c: before writing to a file after reading from it,
-do an f_seek(file, 0, SEEK_CUR) to make writing legal in ANSI C.
-
-Fri Jun  6 14:56:44 EDT 2003
-libf2c.zip:  add comments about libf2c.so (and a rule that works under
-Linux, after an adjustment to the CFLAGS = line) to libf2c/makefile.u.
-
-Sat Oct 25 07:57:53 MDT 2003
-README, main.c, sysdep.c:  adjust comments about libf2c and expand the
-comments thereon in the C that f2c writes (since too few people read
-the README files).  Change makefile to makefile.u (with the
-expectation that people will "cp makefile.u makefile" and edit
-makefile if necessary) and add makefile.vc (for Microsoft Visual C++).
-
-Thu Oct  7 23:25:28 MDT 2004
-names.c: for convenience of MSVC++ users, map "cdecl" to "cdecl__".
-
-Fri Mar  4 18:40:48 MST 2005
-sysdep.c, makefile.u, new file sysdeptest.c:  changes in response to a
-message forwarded by Eric Grosse from Thierry Carrez <koon@gentoo.org>
-(who is apparently unaware of f2c's -T option) about an unlikely
-security issue:  that a local attacker could plant symbolic links in
-/tmp corresponding to temporary file names that f2c generates and thus
-cause overwriting of arbitrary files.  Today's change is that if
-neither -T nor the unusual debugging flag -Dn is specified and the
-system is not an MS-Windows system (which cannot have symbolic links,
-as far as I know), then f2c's temporary files will be written in a
-temporary directory that is readable and writable only by the user and
-that is removed at the end of f2c's execution.  To disable today's
-change, compile sysdep.c with -DNO_TEMPDIR (i.e., with NO_TEMPDIR
-#defined).
-
-Sun Mar 27 20:06:49 MST 2005
-sysdep.c: in set_tmp_names(), fix botched placement of
-"if (debugflag == 1) return;":  move it below declarations.
-
-Sun May  1 21:45:46 MDT 2005
-sysdep.c:  fix a possible fault under -DMSDOS and improper handling
-of a tmpnam failure under the unusual combination of both -DNO_MKDTEMP
-and -DNO_MKSTEMP (without -DNO_TEMPDIR).
-
-Tue Oct  4 23:38:54 MDT 2005
-libf2c.zip:  uninit.c:  on IA32 Linux systems, leave the rounding
-precision alone rather than forcing it to 53 bits; compile with
--DUNINIT_F2C_PRECISION_53 to get the former behavior.  This only
-affects Fortran files translated by f2c -trapuv .
-
-Sun May  7 00:38:59 MDT 2006
-  main.c, version.c:  add options -? (or --help) that print out
-pointers to usage documentation and -v (or --version) that print
-the current version.
-  fc script:  fix botch with -O[123]; recognize --version (or -v)
-and --help (or -?).
-  Add f2c.pdf == PDF version of f2c.ps.
-
-Sun Oct  8 02:45:04 MDT 2006
-  putpcc.c: fix glitch in subscripting complex variables:  subscripts
-of type integer*8 were converted to integer*4, which causes trouble
-when 32-bit addressing does not suffice.
-
-Tue Sep 11 23:54:05 MDT 2007
-  xsum.c:  insert explicit "int" before main.
-
-Mon Dec  3 20:53:24 MST 2007
-  libf2c/main.c: insert explicit "int" before main.
-
-Sat Apr  5 21:39:57 MDT 2008
-  libf2c.zip: tweaks for political C++ and const correctness, and
-to fix ctype trouble in some recent Linux versions.  No behavior
-should change.
-
-Sun Apr  6 22:38:56 MDT 2008
-  libf2c.zip: adjust alternate makefiles to reflect yesterday's change.
-
-Wed Nov 26 23:23:27 MST 2008
-  libf2c.zip: add brief discussion of MacOSX to comments in makefile.u.
-
-Fri Jan  2 23:13:25 MST 2009
-  libf2c.zip: add  -DNO_ISATTY to CFLAGS assignment in makefile.vc.
-
-Sat Apr 11 18:06:00 MDT 2009
-  src/sysdep.c src/sysdeptest.c: tweak for MacOSX (include <unistd.h>).
-
-NOTE:  the old libf77 and libi77 bundles are no longer being updated.
-Use libf2c.zip instead.
diff -Nru igraph-0.6.5~quantal1/src/f2c/comptry.bat igraph-0.6.5/src/f2c/comptry.bat
--- igraph-0.6.5~quantal1/src/f2c/comptry.bat	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/comptry.bat	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-%1 %2 %3 %4 %5 %6 %7 %8 %9
-if errorlevel 1 goto nolonglong
-exit 0
-:nolonglong
-%1 -DNO_LONG_LONG %2 %3 %4 %5 %6 %7 %8 %9
diff -Nru igraph-0.6.5~quantal1/src/f2c/ctype.h igraph-0.6.5/src/f2c/ctype.h
--- igraph-0.6.5~quantal1/src/f2c/ctype.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/ctype.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,47 +0,0 @@
-/*  Custom ctype.h to overcome trouble with recent versions of Linux libc.a */
-
-#ifdef NO_My_ctype
-#include <ctype.h>
-#else /*{*/
-#ifndef My_ctype_DEF
-extern char My_ctype[];
-#else /*{*/
-char My_ctype[264] = {
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 2, 2, 2, 2, 2, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	2, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	1, 1, 1, 1, 1, 1, 1, 1,
-	1, 1, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0};
-#endif /*}*/
-
-#define isdigit(x) (My_ctype[(x)+8] & 1)
-#define isspace(x) (My_ctype[(x)+8] & 2)
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/f2c.h0 igraph-0.6.5/src/f2c/f2c.h0
--- igraph-0.6.5~quantal1/src/f2c/f2c.h0	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/f2c.h0	1970-01-01 00:00:00.000000000 +0000
@@ -1,243 +0,0 @@
-/* f2c.h  --  Standard Fortran to C header file */
-
-/**  barf  [ba:rf]  2.  "He suggested using FORTRAN, and everybody barfed."
-
-	- From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) */
-
-#ifndef F2C_INCLUDE
-#define F2C_INCLUDE
-
-#if defined(__alpha__) || defined(__sparc64__) || defined(__x86_64__) || defined(__ia64__)
-typedef int integer;
-typedef unsigned int uinteger;
-#else
-typedef long int integer;
-typedef unsigned long int uinteger;
-#endif
-typedef char *address;
-typedef short int shortint;
-typedef float real;
-typedef double doublereal;
-typedef struct { real r, i; } f2c_complex;
-typedef struct { doublereal r, i; } doublecomplex;
-#if defined(__alpha__) || defined(__sparc64__) || defined(__x86_64__) || defined(__ia64__)
-typedef int logical;
-#else
-typedef long int logical;
-#endif
-typedef short int shortlogical;
-typedef char logical1;
-typedef char integer1;
-#ifdef INTEGER_STAR_8	/* Adjust for integer*8. */
-#if defined(__alpha__) || defined(__sparc64__) || defined(__x86_64__) || defined(__ia64__)
-typedef long longint;		/* system-dependent */
-typedef unsigned long ulongint;	/* system-dependent */
-#else
-typedef long long longint;              /* system-dependent - oh yeah*/
-typedef unsigned long long ulongint;    /* system-dependent - oh yeah*/
-#endif
-#define qbit_clear(a,b)	((a) & ~((ulongint)1 << (b)))
-#define qbit_set(a,b)	((a) |  ((ulongint)1 << (b)))
-#endif
-
-#define TRUE_ (1)
-#define FALSE_ (0)
-
-/* Extern is for use with -E */
-#ifndef Extern
-#define Extern extern
-#endif
-
-/* I/O stuff */
-
-#ifdef f2c_i2
-/* for -i2 */
-typedef short flag;
-typedef short ftnlen;
-typedef short ftnint;
-#else
-#if defined(__alpha__) || defined(__sparc64__) || defined(__x86_64__) || defined(__ia64__)
-typedef int flag;
-typedef int ftnlen;
-typedef int ftnint;
-#else
-typedef long int flag;
-typedef long int ftnlen;
-typedef long int ftnint;
-#endif
-#endif
-
-/*external read, write*/
-typedef struct
-{	flag cierr;
-	ftnint ciunit;
-	flag ciend;
-	char *cifmt;
-	ftnint cirec;
-} cilist;
-
-/*internal read, write*/
-typedef struct
-{	flag icierr;
-	char *iciunit;
-	flag iciend;
-	char *icifmt;
-	ftnint icirlen;
-	ftnint icirnum;
-} icilist;
-
-/*open*/
-typedef struct
-{	flag oerr;
-	ftnint ounit;
-	char *ofnm;
-	ftnlen ofnmlen;
-	char *osta;
-	char *oacc;
-	char *ofm;
-	ftnint orl;
-	char *oblnk;
-} olist;
-
-/*close*/
-typedef struct
-{	flag cerr;
-	ftnint cunit;
-	char *csta;
-} cllist;
-
-/*rewind, backspace, endfile*/
-typedef struct
-{	flag aerr;
-	ftnint aunit;
-} alist;
-
-/* inquire */
-typedef struct
-{	flag inerr;
-	ftnint inunit;
-	char *infile;
-	ftnlen infilen;
-	ftnint	*inex;	/*parameters in standard's order*/
-	ftnint	*inopen;
-	ftnint	*innum;
-	ftnint	*innamed;
-	char	*inname;
-	ftnlen	innamlen;
-	char	*inacc;
-	ftnlen	inacclen;
-	char	*inseq;
-	ftnlen	inseqlen;
-	char 	*indir;
-	ftnlen	indirlen;
-	char	*infmt;
-	ftnlen	infmtlen;
-	char	*inform;
-	ftnint	informlen;
-	char	*inunf;
-	ftnlen	inunflen;
-	ftnint	*inrecl;
-	ftnint	*innrec;
-	char	*inblank;
-	ftnlen	inblanklen;
-} inlist;
-
-#define VOID void
-
-union Multitype {	/* for multiple entry points */
-	integer1 g;
-	shortint h;
-	integer i;
-	/* longint j; */
-	real r;
-	doublereal d;
-	complex c;
-	doublecomplex z;
-	};
-
-typedef union Multitype Multitype;
-
-/*typedef long int Long;*/	/* No longer used; formerly in Namelist */
-
-struct Vardesc {	/* for Namelist */
-	char *name;
-	char *addr;
-	ftnlen *dims;
-	int  type;
-	};
-typedef struct Vardesc Vardesc;
-
-struct Namelist {
-	char *name;
-	Vardesc **vars;
-	int nvars;
-	};
-typedef struct Namelist Namelist;
-
-#define abs(x) ((x) >= 0 ? (x) : -(x))
-#define dabs(x) (doublereal)abs(x)
-#define min(a,b) ((a) <= (b) ? (a) : (b))
-#define max(a,b) ((a) >= (b) ? (a) : (b))
-#define dmin(a,b) (doublereal)min(a,b)
-#define dmax(a,b) (doublereal)max(a,b)
-#define bit_test(a,b)	((a) >> (b) & 1)
-#define bit_clear(a,b)	((a) & ~((uinteger)1 << (b)))
-#define bit_set(a,b)	((a) |  ((uinteger)1 << (b)))
-
-/* procedure parameter types for -A and -C++ */
-
-#define F2C_proc_par_types 1
-#ifdef __cplusplus
-typedef int /* Unknown procedure type */ (*U_fp)(...);
-typedef shortint (*J_fp)(...);
-typedef integer (*I_fp)(...);
-typedef real (*R_fp)(...);
-typedef doublereal (*D_fp)(...), (*E_fp)(...);
-typedef /* Complex */ VOID (*C_fp)(...);
-typedef /* Double Complex */ VOID (*Z_fp)(...);
-typedef logical (*L_fp)(...);
-typedef shortlogical (*K_fp)(...);
-typedef /* Character */ VOID (*H_fp)(...);
-typedef /* Subroutine */ int (*S_fp)(...);
-#else
-typedef int /* Unknown procedure type */ (*U_fp)();
-typedef shortint (*J_fp)();
-typedef integer (*I_fp)();
-typedef real (*R_fp)();
-typedef doublereal (*D_fp)(), (*E_fp)();
-typedef /* Complex */ VOID (*C_fp)();
-typedef /* Double Complex */ VOID (*Z_fp)();
-typedef logical (*L_fp)();
-typedef shortlogical (*K_fp)();
-typedef /* Character */ VOID (*H_fp)();
-typedef /* Subroutine */ int (*S_fp)();
-#endif
-/* E_fp is for real functions when -R is not specified */
-typedef VOID C_f;	/* complex function */
-typedef VOID H_f;	/* character function */
-typedef VOID Z_f;	/* double complex function */
-typedef doublereal E_f;	/* real function with -R not specified */
-
-/* undef any lower-case symbols that your C compiler predefines, e.g.: */
-
-#ifndef Skip_f2c_Undefs
-#undef cray
-#undef gcos
-#undef mc68010
-#undef mc68020
-#undef mips
-#undef pdp11
-#undef sgi
-#undef sparc
-#undef sun
-#undef sun2
-#undef sun3
-#undef sun4
-#undef u370
-#undef u3b
-#undef u3b2
-#undef u3b5
-#undef unix
-#undef vax
-#endif
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/f2ch.add igraph-0.6.5/src/f2c/f2ch.add
--- igraph-0.6.5~quantal1/src/f2c/f2ch.add	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/f2ch.add	1970-01-01 00:00:00.000000000 +0000
@@ -1,162 +0,0 @@
-/* If you are using a C++ compiler, append the following to f2c.h
-   for compiling libF77 and libI77. */
-
-#ifdef __cplusplus
-extern "C" {
-extern int abort_(void);
-extern double c_abs(complex *);
-extern void c_cos(complex *, complex *);
-extern void c_div(complex *, complex *, complex *);
-extern void c_exp(complex *, complex *);
-extern void c_log(complex *, complex *);
-extern void c_sin(complex *, complex *);
-extern void c_sqrt(complex *, complex *);
-extern double d_abs(double *);
-extern double d_acos(double *);
-extern double d_asin(double *);
-extern double d_atan(double *);
-extern double d_atn2(double *, double *);
-extern void d_cnjg(doublecomplex *, doublecomplex *);
-extern double d_cos(double *);
-extern double d_cosh(double *);
-extern double d_dim(double *, double *);
-extern double d_exp(double *);
-extern double d_imag(doublecomplex *);
-extern double d_int(double *);
-extern double d_lg10(double *);
-extern double d_log(double *);
-extern double d_mod(double *, double *);
-extern double d_nint(double *);
-extern double d_prod(float *, float *);
-extern double d_sign(double *, double *);
-extern double d_sin(double *);
-extern double d_sinh(double *);
-extern double d_sqrt(double *);
-extern double d_tan(double *);
-extern double d_tanh(double *);
-extern double derf_(double *);
-extern double derfc_(double *);
-extern integer do_fio(ftnint *, char *, ftnlen);
-extern integer do_lio(ftnint *, ftnint *, char *, ftnlen);
-extern integer do_uio(ftnint *, char *, ftnlen);
-extern integer e_rdfe(void);
-extern integer e_rdue(void);
-extern integer e_rsfe(void);
-extern integer e_rsfi(void);
-extern integer e_rsle(void);
-extern integer e_rsli(void);
-extern integer e_rsue(void);
-extern integer e_wdfe(void);
-extern integer e_wdue(void);
-extern integer e_wsfe(void);
-extern integer e_wsfi(void);
-extern integer e_wsle(void);
-extern integer e_wsli(void);
-extern integer e_wsue(void);
-extern int ef1asc_(ftnint *, ftnlen *, ftnint *, ftnlen *);
-extern integer ef1cmc_(ftnint *, ftnlen *, ftnint *, ftnlen *);
-extern double erf(double);
-extern double erf_(float *);
-extern double erfc(double);
-extern double erfc_(float *);
-extern integer f_back(alist *);
-extern integer f_clos(cllist *);
-extern integer f_end(alist *);
-extern void f_exit(void);
-extern integer f_inqu(inlist *);
-extern integer f_open(olist *);
-extern integer f_rew(alist *);
-extern int flush_(void);
-extern void getarg_(integer *, char *, ftnlen);
-extern void getenv_(char *, char *, ftnlen, ftnlen);
-extern short h_abs(short *);
-extern short h_dim(short *, short *);
-extern short h_dnnt(double *);
-extern short h_indx(char *, char *, ftnlen, ftnlen);
-extern short h_len(char *, ftnlen);
-extern short h_mod(short *, short *);
-extern short h_nint(float *);
-extern short h_sign(short *, short *);
-extern short hl_ge(char *, char *, ftnlen, ftnlen);
-extern short hl_gt(char *, char *, ftnlen, ftnlen);
-extern short hl_le(char *, char *, ftnlen, ftnlen);
-extern short hl_lt(char *, char *, ftnlen, ftnlen);
-extern integer i_abs(integer *);
-extern integer i_dim(integer *, integer *);
-extern integer i_dnnt(double *);
-extern integer i_indx(char *, char *, ftnlen, ftnlen);
-extern integer i_len(char *, ftnlen);
-extern integer i_mod(integer *, integer *);
-extern integer i_nint(float *);
-extern integer i_sign(integer *, integer *);
-extern integer iargc_(void);
-extern ftnlen l_ge(char *, char *, ftnlen, ftnlen);
-extern ftnlen l_gt(char *, char *, ftnlen, ftnlen);
-extern ftnlen l_le(char *, char *, ftnlen, ftnlen);
-extern ftnlen l_lt(char *, char *, ftnlen, ftnlen);
-extern void pow_ci(complex *, complex *, integer *);
-extern double pow_dd(double *, double *);
-extern double pow_di(double *, integer *);
-extern short pow_hh(short *, shortint *);
-extern integer pow_ii(integer *, integer *);
-extern double pow_ri(float *, integer *);
-extern void pow_zi(doublecomplex *, doublecomplex *, integer *);
-extern void pow_zz(doublecomplex *, doublecomplex *, doublecomplex *);
-extern double r_abs(float *);
-extern double r_acos(float *);
-extern double r_asin(float *);
-extern double r_atan(float *);
-extern double r_atn2(float *, float *);
-extern void r_cnjg(complex *, complex *);
-extern double r_cos(float *);
-extern double r_cosh(float *);
-extern double r_dim(float *, float *);
-extern double r_exp(float *);
-extern double r_imag(complex *);
-extern double r_int(float *);
-extern double r_lg10(float *);
-extern double r_log(float *);
-extern double r_mod(float *, float *);
-extern double r_nint(float *);
-extern double r_sign(float *, float *);
-extern double r_sin(float *);
-extern double r_sinh(float *);
-extern double r_sqrt(float *);
-extern double r_tan(float *);
-extern double r_tanh(float *);
-extern void s_cat(char *, char **, integer *, integer *, ftnlen);
-extern integer s_cmp(char *, char *, ftnlen, ftnlen);
-extern void s_copy(char *, char *, ftnlen, ftnlen);
-extern int s_paus(char *, ftnlen);
-extern integer s_rdfe(cilist *);
-extern integer s_rdue(cilist *);
-extern integer s_rnge(char *, integer, char *, integer);
-extern integer s_rsfe(cilist *);
-extern integer s_rsfi(icilist *);
-extern integer s_rsle(cilist *);
-extern integer s_rsli(icilist *);
-extern integer s_rsne(cilist *);
-extern integer s_rsni(icilist *);
-extern integer s_rsue(cilist *);
-extern int s_stop(char *, ftnlen);
-extern integer s_wdfe(cilist *);
-extern integer s_wdue(cilist *);
-extern integer s_wsfe(cilist *);
-extern integer s_wsfi(icilist *);
-extern integer s_wsle(cilist *);
-extern integer s_wsli(icilist *);
-extern integer s_wsne(cilist *);
-extern integer s_wsni(icilist *);
-extern integer s_wsue(cilist *);
-extern void sig_die(char *, int);
-extern integer signal_(integer *, void (*)(int));
-extern integer system_(char *, ftnlen);
-extern double z_abs(doublecomplex *);
-extern void z_cos(doublecomplex *, doublecomplex *);
-extern void z_div(doublecomplex *, doublecomplex *, doublecomplex *);
-extern void z_exp(doublecomplex *, doublecomplex *);
-extern void z_log(doublecomplex *, doublecomplex *);
-extern void z_sin(doublecomplex *, doublecomplex *);
-extern void z_sqrt(doublecomplex *, doublecomplex *);
-	}
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/getarg_.c igraph-0.6.5/src/f2c/getarg_.c
--- igraph-0.6.5~quantal1/src/f2c/getarg_.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/getarg_.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,36 +0,0 @@
-#include "f2c.h"
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/*
- * subroutine getarg(k, c)
- * returns the kth unix command argument in fortran character
- * variable argument c
-*/
-
-#ifdef KR_headers
-VOID getarg_(n, s, ls) ftnint *n; char *s; ftnlen ls;
-#define Const /*nothing*/
-#else
-#define Const const
-void getarg_(ftnint *n, char *s, ftnlen ls)
-#endif
-{
-	extern int xargc;
-	extern char **xargv;
-	Const char *t;
-	int i;
-	
-	if(*n>=0 && *n<xargc)
-		t = xargv[*n];
-	else
-		t = "";
-	for(i = 0; i<ls && *t!='\0' ; ++i)
-		*s++ = *t++;
-	for( ; i<ls ; ++i)
-		*s++ = ' ';
-	}
-#ifdef __cplusplus
-}
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/iargc_.c igraph-0.6.5/src/f2c/iargc_.c
--- igraph-0.6.5~quantal1/src/f2c/iargc_.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/iargc_.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-#include "f2c.h"
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#ifdef KR_headers
-ftnint iargc_()
-#else
-ftnint iargc_(void)
-#endif
-{
-extern int xargc;
-return ( xargc - 1 );
-}
-#ifdef __cplusplus
-}
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/libf2c.lbc igraph-0.6.5/src/f2c/libf2c.lbc
--- igraph-0.6.5~quantal1/src/f2c/libf2c.lbc	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/libf2c.lbc	1970-01-01 00:00:00.000000000 +0000
@@ -1,153 +0,0 @@
-abort_.obj
-backspac.obj
-c_abs.obj
-c_cos.obj
-c_div.obj
-c_exp.obj
-c_log.obj
-c_sin.obj
-c_sqrt.obj
-cabs.obj
-close.obj
-d_abs.obj
-d_acos.obj
-d_asin.obj
-d_atan.obj
-d_atn2.obj
-d_cnjg.obj
-d_cos.obj
-d_cosh.obj
-d_dim.obj
-d_exp.obj
-d_imag.obj
-d_int.obj
-d_lg10.obj
-d_log.obj
-d_mod.obj
-d_nint.obj
-d_prod.obj
-d_sign.obj
-d_sin.obj
-d_sinh.obj
-d_sqrt.obj
-d_tan.obj
-d_tanh.obj
-derf_.obj
-derfc_.obj
-dfe.obj
-dolio.obj
-dtime_.obj
-due.obj
-ef1asc_.obj
-ef1cmc_.obj
-endfile.obj
-erf_.obj
-erfc_.obj
-err.obj
-etime_.obj
-exit_.obj
-f77_aloc.obj
-f77vers.obj
-fmt.obj
-fmtlib.obj
-ftell_.obj
-getarg_.obj
-getenv_.obj
-h_abs.obj
-h_dim.obj
-h_dnnt.obj
-h_indx.obj
-h_len.obj
-h_mod.obj
-h_nint.obj
-h_sign.obj
-hl_ge.obj
-hl_gt.obj
-hl_le.obj
-hl_lt.obj
-i77vers.obj
-i_abs.obj
-i_dim.obj
-i_dnnt.obj
-i_indx.obj
-i_len.obj
-i_mod.obj
-i_nint.obj
-i_sign.obj
-iargc_.obj
-iio.obj
-ilnw.obj
-inquire.obj
-l_ge.obj
-l_gt.obj
-l_le.obj
-l_lt.obj
-lbitbits.obj
-lbitshft.obj
-lread.obj
-lwrite.obj
-main.obj
-open.obj
-pow_ci.obj
-pow_dd.obj
-pow_di.obj
-pow_hh.obj
-pow_ii.obj
-pow_ri.obj
-pow_zi.obj
-pow_zz.obj
-r_abs.obj
-r_acos.obj
-r_asin.obj
-r_atan.obj
-r_atn2.obj
-r_cnjg.obj
-r_cos.obj
-r_cosh.obj
-r_dim.obj
-r_exp.obj
-r_imag.obj
-r_int.obj
-r_lg10.obj
-r_log.obj
-r_mod.obj
-r_nint.obj
-r_sign.obj
-r_sin.obj
-r_sinh.obj
-r_sqrt.obj
-r_tan.obj
-r_tanh.obj
-rdfmt.obj
-rewind.obj
-rsfe.obj
-rsli.obj
-rsne.obj
-s_cat.obj
-s_cmp.obj
-s_copy.obj
-s_paus.obj
-s_rnge.obj
-s_stop.obj
-sfe.obj
-sig_die.obj
-signal_.obj
-sue.obj
-system_.obj
-typesize.obj
-uio.obj
-uninit.obj
-util.obj
-wref.obj
-wrtfmt.obj
-wsfe.obj
-wsle.obj
-wsne.obj
-xwsne.obj
-z_abs.obj
-z_cos.obj
-z_div.obj
-z_exp.obj
-z_log.obj
-z_sin.obj
-z_sqrt.obj
diff -Nru igraph-0.6.5~quantal1/src/f2c/libf2c.sy igraph-0.6.5/src/f2c/libf2c.sy
--- igraph-0.6.5~quantal1/src/f2c/libf2c.sy	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/libf2c.sy	1970-01-01 00:00:00.000000000 +0000
@@ -1,153 +0,0 @@
-+abort_.obj &
-+backspac.obj &
-+c_abs.obj &
-+c_cos.obj &
-+c_div.obj &
-+c_exp.obj &
-+c_log.obj &
-+c_sin.obj &
-+c_sqrt.obj &
-+cabs.obj &
-+close.obj &
-+d_abs.obj &
-+d_acos.obj &
-+d_asin.obj &
-+d_atan.obj &
-+d_atn2.obj &
-+d_cnjg.obj &
-+d_cos.obj &
-+d_cosh.obj &
-+d_dim.obj &
-+d_exp.obj &
-+d_imag.obj &
-+d_int.obj &
-+d_lg10.obj &
-+d_log.obj &
-+d_mod.obj &
-+d_nint.obj &
-+d_prod.obj &
-+d_sign.obj &
-+d_sin.obj &
-+d_sinh.obj &
-+d_sqrt.obj &
-+d_tan.obj &
-+d_tanh.obj &
-+derf_.obj &
-+derfc_.obj &
-+dfe.obj &
-+dolio.obj &
-+dtime_.obj &
-+due.obj &
-+ef1asc_.obj &
-+ef1cmc_.obj &
-+endfile.obj &
-+erf_.obj &
-+erfc_.obj &
-+err.obj &
-+etime_.obj &
-+exit_.obj &
-+f77_aloc.obj &
-+f77vers.obj &
-+fmt.obj &
-+fmtlib.obj &
-+ftell_.obj &
-+getarg_.obj &
-+getenv_.obj &
-+h_abs.obj &
-+h_dim.obj &
-+h_dnnt.obj &
-+h_indx.obj &
-+h_len.obj &
-+h_mod.obj &
-+h_nint.obj &
-+h_sign.obj &
-+hl_ge.obj &
-+hl_gt.obj &
-+hl_le.obj &
-+hl_lt.obj &
-+i77vers.obj &
-+i_abs.obj &
-+i_dim.obj &
-+i_dnnt.obj &
-+i_indx.obj &
-+i_len.obj &
-+i_mod.obj &
-+i_nint.obj &
-+i_sign.obj &
-+iargc_.obj &
-+iio.obj &
-+ilnw.obj &
-+inquire.obj &
-+l_ge.obj &
-+l_gt.obj &
-+l_le.obj &
-+l_lt.obj &
-+lbitbits.obj &
-+lbitshft.obj &
-+lread.obj &
-+lwrite.obj &
-+main.obj &
-+open.obj &
-+pow_ci.obj &
-+pow_dd.obj &
-+pow_di.obj &
-+pow_hh.obj &
-+pow_ii.obj &
-+pow_ri.obj &
-+pow_zi.obj &
-+pow_zz.obj &
-+r_abs.obj &
-+r_acos.obj &
-+r_asin.obj &
-+r_atan.obj &
-+r_atn2.obj &
-+r_cnjg.obj &
-+r_cos.obj &
-+r_cosh.obj &
-+r_dim.obj &
-+r_exp.obj &
-+r_imag.obj &
-+r_int.obj &
-+r_lg10.obj &
-+r_log.obj &
-+r_mod.obj &
-+r_nint.obj &
-+r_sign.obj &
-+r_sin.obj &
-+r_sinh.obj &
-+r_sqrt.obj &
-+r_tan.obj &
-+r_tanh.obj &
-+rdfmt.obj &
-+rewind.obj &
-+rsfe.obj &
-+rsli.obj &
-+rsne.obj &
-+s_cat.obj &
-+s_cmp.obj &
-+s_copy.obj &
-+s_paus.obj &
-+s_rnge.obj &
-+s_stop.obj &
-+sfe.obj &
-+sig_die.obj &
-+signal_.obj &
-+sue.obj &
-+system_.obj &
-+typesize.obj &
-+uio.obj &
-+uninit.obj &
-+util.obj &
-+wref.obj &
-+wrtfmt.obj &
-+wsfe.obj &
-+wsle.obj &
-+wsne.obj &
-+xwsne.obj &
-+z_abs.obj &
-+z_cos.obj &
-+z_div.obj &
-+z_exp.obj &
-+z_log.obj &
-+z_sin.obj &
-+z_sqrt.obj
diff -Nru igraph-0.6.5~quantal1/src/f2c/main.c igraph-0.6.5/src/f2c/main.c
--- igraph-0.6.5~quantal1/src/f2c/main.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/main.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,148 +0,0 @@
-/* STARTUP PROCEDURE FOR UNIX FORTRAN PROGRAMS */
-
-#include "stdio.h"
-#include "signal1.h"
-
-#ifndef SIGIOT
-#ifdef SIGABRT
-#define SIGIOT SIGABRT
-#endif
-#endif
-
-#ifndef KR_headers
-#undef VOID
-#include "stdlib.h"
-#ifdef __cplusplus
-extern "C" {
-#endif
-#endif
-
-#ifndef VOID
-#define VOID void
-#endif
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#ifdef NO__STDC
-#define ONEXIT onexit
-extern VOID f_exit();
-#else
-#ifndef KR_headers
-extern void f_exit(void);
-#ifndef NO_ONEXIT
-#define ONEXIT atexit
-extern int atexit(void (*)(void));
-#endif
-#else
-#ifndef NO_ONEXIT
-#define ONEXIT onexit
-extern VOID f_exit();
-#endif
-#endif
-#endif
-
-#ifdef KR_headers
-extern VOID f_init(), sig_die();
-extern int MAIN__();
-#define Int /* int */
-#else
-extern void f_init(void), sig_die(const char*, int);
-extern int MAIN__(void);
-#define Int int
-#endif
-
-static VOID sigfdie(Sigarg)
-{
-Use_Sigarg;
-sig_die("Floating Exception", 1);
-}
-
-
-static VOID sigidie(Sigarg)
-{
-Use_Sigarg;
-sig_die("IOT Trap", 1);
-}
-
-#ifdef SIGQUIT
-static VOID sigqdie(Sigarg)
-{
-Use_Sigarg;
-sig_die("Quit signal", 1);
-}
-#endif
-
-
-static VOID sigindie(Sigarg)
-{
-Use_Sigarg;
-sig_die("Interrupt", 0);
-}
-
-static VOID sigtdie(Sigarg)
-{
-Use_Sigarg;
-sig_die("Killed", 0);
-}
-
-#ifdef SIGTRAP
-static VOID sigtrdie(Sigarg)
-{
-Use_Sigarg;
-sig_die("Trace trap", 1);
-}
-#endif
-
-
-int xargc;
-char **xargv;
-
-#ifdef __cplusplus
-	}
-#endif
-
- int
-#ifdef KR_headers
-main(argc, argv) int argc; char **argv;
-#else
-main(int argc, char **argv)
-#endif
-{
-xargc = argc;
-xargv = argv;
-signal1(SIGFPE, sigfdie);	/* ignore underflow, enable overflow */
-#ifdef SIGIOT
-signal1(SIGIOT, sigidie);
-#endif
-#ifdef SIGTRAP
-signal1(SIGTRAP, sigtrdie);
-#endif
-#ifdef SIGQUIT
-if(signal1(SIGQUIT,sigqdie) == SIG_IGN)
-	signal1(SIGQUIT, SIG_IGN);
-#endif
-if(signal1(SIGINT, sigindie) == SIG_IGN)
-	signal1(SIGINT, SIG_IGN);
-signal1(SIGTERM,sigtdie);
-
-#ifdef pdp11
-	ldfps(01200); /* detect overflow as an exception */
-#endif
-
-f_init();
-#ifndef NO_ONEXIT
-ONEXIT(f_exit);
-#endif
-MAIN__();
-#ifdef NO_ONEXIT
-f_exit();
-#endif
-exit(0);	/* exit(0) rather than return(0) to bypass Cray bug */
-return 0;	/* For compilers that complain of missing return values; */
-		/* others will complain that this is unreachable code. */
-}
-#ifdef __cplusplus
-}
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/makefile.sy igraph-0.6.5/src/f2c/makefile.sy
--- igraph-0.6.5~quantal1/src/f2c/makefile.sy	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/makefile.sy	1970-01-01 00:00:00.000000000 +0000
@@ -1,190 +0,0 @@
-# For making f2c.lib (here called syf2c.lib) with Symantec C++ .
-# Invoke with "make -f makefile.sy" .
-# In the CFLAGS line below, "-mn" is for NT and W9x.
-# For 32-bit addressing with MSDOS, change "-mn" to "-mx".
-# With Symantec, it is necessary to explicitly load main.obj .
-
-# To get signed zeros in write statements on IEEE-arithmetic systems,
-# add -DSIGNED_ZEROS to the CFLAGS assignment below and add signbit.obj
-# to the objects in the "w =" list below.
-
-CC = sc
-CFLAGS = -DMSDOS -D_POSIX_SOURCE -DNO_ONEXIT -s -mn -DUSE_CLOCK -DNO_My_ctype
-
-.c.obj:
-	$(CC) -c $(CFLAGS) $*.c
-
-w = \
-	abort_.obj \
-	backspac.obj \
-	c_abs.obj \
-	c_cos.obj \
-	c_div.obj \
-	c_exp.obj \
-	c_log.obj \
-	c_sin.obj \
-	c_sqrt.obj \
-	cabs.obj \
-	close.obj \
-	d_abs.obj \
-	d_acos.obj \
-	d_asin.obj \
-	d_atan.obj \
-	d_atn2.obj \
-	d_cnjg.obj \
-	d_cos.obj \
-	d_cosh.obj \
-	d_dim.obj \
-	d_exp.obj \
-	d_imag.obj \
-	d_int.obj \
-	d_lg10.obj \
-	d_log.obj \
-	d_mod.obj \
-	d_nint.obj \
-	d_prod.obj \
-	d_sign.obj \
-	d_sin.obj \
-	d_sinh.obj \
-	d_sqrt.obj \
-	d_tan.obj \
-	d_tanh.obj \
-	derf_.obj \
-	derfc_.obj \
-	dfe.obj \
-	dolio.obj \
-	dtime_.obj \
-	due.obj \
-	ef1asc_.obj \
-	ef1cmc_.obj \
-	endfile.obj \
-	erf_.obj \
-	erfc_.obj \
-	err.obj \
-	etime_.obj \
-	exit_.obj \
-	f77_aloc.obj \
-	f77vers.obj \
-	fmt.obj \
-	fmtlib.obj \
-	ftell_.obj \
-	getarg_.obj \
-	getenv_.obj \
-	h_abs.obj \
-	h_dim.obj \
-	h_dnnt.obj \
-	h_indx.obj \
-	h_len.obj \
-	h_mod.obj \
-	h_nint.obj \
-	h_sign.obj \
-	hl_ge.obj \
-	hl_gt.obj \
-	hl_le.obj \
-	hl_lt.obj \
-	i77vers.obj \
-	i_abs.obj \
-	i_dim.obj \
-	i_dnnt.obj \
-	i_indx.obj \
-	i_len.obj \
-	i_mod.obj \
-	i_nint.obj \
-	i_sign.obj \
-	iargc_.obj \
-	iio.obj \
-	ilnw.obj \
-	inquire.obj \
-	l_ge.obj \
-	l_gt.obj \
-	l_le.obj \
-	l_lt.obj \
-	lbitbits.obj \
-	lbitshft.obj \
-	lread.obj \
-	lwrite.obj \
-	main.obj \
-	open.obj \
-	pow_ci.obj \
-	pow_dd.obj \
-	pow_di.obj \
-	pow_hh.obj \
-	pow_ii.obj \
-	pow_ri.obj \
-	pow_zi.obj \
-	pow_zz.obj \
-	r_abs.obj \
-	r_acos.obj \
-	r_asin.obj \
-	r_atan.obj \
-	r_atn2.obj \
-	r_cnjg.obj \
-	r_cos.obj \
-	r_cosh.obj \
-	r_dim.obj \
-	r_exp.obj \
-	r_imag.obj \
-	r_int.obj \
-	r_lg10.obj \
-	r_log.obj \
-	r_mod.obj \
-	r_nint.obj \
-	r_sign.obj \
-	r_sin.obj \
-	r_sinh.obj \
-	r_sqrt.obj \
-	r_tan.obj \
-	r_tanh.obj \
-	rdfmt.obj \
-	rewind.obj \
-	rsfe.obj \
-	rsli.obj \
-	rsne.obj \
-	s_cat.obj \
-	s_cmp.obj \
-	s_copy.obj \
-	s_paus.obj \
-	s_rnge.obj \
-	s_stop.obj \
-	sfe.obj \
-	sig_die.obj \
-	signal_.obj \
-	sue.obj \
-	system_.obj \
-	typesize.obj \
-	uio.obj \
-	util.obj \
-	uninit.obj \
-	wref.obj \
-	wrtfmt.obj \
-	wsfe.obj \
-	wsle.obj \
-	wsne.obj \
-	xwsne.obj \
-	z_abs.obj \
-	z_cos.obj \
-	z_div.obj \
-	z_exp.obj \
-	z_log.obj \
-	z_sin.obj \
-	z_sqrt.obj
-
-syf2c.lib: f2c.h signal1.h sysdep1.h $w
-	lib /B /C syf2c.lib @libf2c.sy
-
-f2c.h: f2c.h0
-	copy f2c.h0 f2c.h
-
-signal1.h: signal1.h0
-	copy signal1.h0 signal1.h
-
-sysdep1.h: sysdep1.h0
-	copy sysdep1.h0 sysdep1.h
-
-signbit.obj uninit.obj: arith.h
-
-arith.h: arithchk.c
-	scomptry.bat $(CC) $(CFLAGS) arithchk.c
-	arithchk
-	del arithchk.exe
-	del arithchk.obj
diff -Nru igraph-0.6.5~quantal1/src/f2c/makefile.u igraph-0.6.5/src/f2c/makefile.u
--- igraph-0.6.5~quantal1/src/f2c/makefile.u	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/makefile.u	1970-01-01 00:00:00.000000000 +0000
@@ -1,219 +0,0 @@
-# Unix makefile: see README.
-# For C++, first "make hadd".
-# If your compiler does not recognize ANSI C, add
-#	-DKR_headers
-# to the CFLAGS = line below.
-# On Sun and other BSD systems that do not provide an ANSI sprintf, add
-#	-DUSE_STRLEN
-# to the CFLAGS = line below.
-# On Linux systems, add
-#	-DNON_UNIX_STDIO
-# to the CFLAGS = line below.  For libf2c.so under Linux, also add
-#	-fPIC
-# to the CFLAGS = line below.
-
-.SUFFIXES: .c .o
-CC = cc
-SHELL = /bin/sh
-CFLAGS = -O
-
-# compile, then strip unnecessary symbols
-.c.o:
-	$(CC) -c -DSkip_f2c_Undefs $(CFLAGS) $*.c
-	ld -r -x -o $*.xxx $*.o
-	mv $*.xxx $*.o
-## Under Solaris (and other systems that do not understand ld -x),
-## omit -x in the ld line above.
-## If your system does not have the ld command, comment out
-## or remove both the ld and mv lines above.
-
-MISC =	f77vers.o i77vers.o main.o s_rnge.o abort_.o exit_.o getarg_.o iargc_.o\
-	getenv_.o signal_.o s_stop.o s_paus.o system_.o cabs.o ctype.o\
-	derf_.o derfc_.o erf_.o erfc_.o sig_die.o uninit.o
-POW =	pow_ci.o pow_dd.o pow_di.o pow_hh.o pow_ii.o pow_ri.o pow_zi.o pow_zz.o
-CX =	c_abs.o c_cos.o c_div.o c_exp.o c_log.o c_sin.o c_sqrt.o
-DCX =	z_abs.o z_cos.o z_div.o z_exp.o z_log.o z_sin.o z_sqrt.o
-REAL =	r_abs.o r_acos.o r_asin.o r_atan.o r_atn2.o r_cnjg.o r_cos.o\
-	r_cosh.o r_dim.o r_exp.o r_imag.o r_int.o\
-	r_lg10.o r_log.o r_mod.o r_nint.o r_sign.o\
-	r_sin.o r_sinh.o r_sqrt.o r_tan.o r_tanh.o
-DBL =	d_abs.o d_acos.o d_asin.o d_atan.o d_atn2.o\
-	d_cnjg.o d_cos.o d_cosh.o d_dim.o d_exp.o\
-	d_imag.o d_int.o d_lg10.o d_log.o d_mod.o\
-	d_nint.o d_prod.o d_sign.o d_sin.o d_sinh.o\
-	d_sqrt.o d_tan.o d_tanh.o
-INT =	i_abs.o i_dim.o i_dnnt.o i_indx.o i_len.o i_mod.o i_nint.o i_sign.o\
-	lbitbits.o lbitshft.o
-HALF =	h_abs.o h_dim.o h_dnnt.o h_indx.o h_len.o h_mod.o h_nint.o h_sign.o
-CMP =	l_ge.o l_gt.o l_le.o l_lt.o hl_ge.o hl_gt.o hl_le.o hl_lt.o
-EFL =	ef1asc_.o ef1cmc_.o
-CHAR =	f77_aloc.o s_cat.o s_cmp.o s_copy.o
-I77 =	backspac.o close.o dfe.o dolio.o due.o endfile.o err.o\
-	fmt.o fmtlib.o ftell_.o iio.o ilnw.o inquire.o lread.o lwrite.o\
-	open.o rdfmt.o rewind.o rsfe.o rsli.o rsne.o sfe.o sue.o\
-	typesize.o uio.o util.o wref.o wrtfmt.o wsfe.o wsle.o wsne.o xwsne.o
-QINT =	pow_qq.o qbitbits.o qbitshft.o ftell64_.o
-TIME =	dtime_.o etime_.o
-
-# If you get an error compiling dtime_.c or etime_.c, try adding
-# -DUSE_CLOCK to the CFLAGS assignment above; if that does not work,
-# omit $(TIME) from OFILES = assignment below.
-
-# To get signed zeros in write statements on IEEE-arithmetic systems,
-# add -DSIGNED_ZEROS to the CFLAGS assignment below and add signbit.o
-# to the end of the OFILES = assignment below.
-
-# For INTEGER*8 support (which requires system-dependent adjustments to
-# f2c.h), add $(QINT) to the OFILES = assignment below...
-
-OFILES = $(MISC) $(POW) $(CX) $(DCX) $(REAL) $(DBL) $(INT) \
-	$(HALF) $(CMP) $(EFL) $(CHAR) $(I77) $(TIME)
-
-all: f2c.h signal1.h sysdep1.h $(OFILES)
-
-libf2c.a: $(OFILES)
-	ar r libf2c.a $?
-	-ranlib libf2c.a
-
-## Shared-library variant: the following rule works on Linux
-## systems.  Details are system-dependent.  Under Linux, -fPIC
-## must appear in the CFLAGS assignment when making libf2c.so.
-## Under Solaris, use -Kpic in CFLAGS and use "ld -G" instead
-## of "$(CC) -shared".
-## For MacOSX 10.4 and 10.5 (and perhaps other versions >= 10.3), use
-## "MACOSX_DEPLOYMENT_TARGET=10.3 libtool -dynamic -undefined dynamic_lookup -single_module"
-## instead of "$(CC) -shared", and when running programs linked against libf2c.so,
-## arrange for $DYLD_LIBRARY_PATH to include the directory containing libf2c.so.
-
-libf2c.so: $(OFILES)
-	$(CC) -shared -o libf2c.so $(OFILES)
-
-### If your system lacks ranlib, you don't need it; see README.
-
-f77vers.o: f77vers.c
-	$(CC) -c f77vers.c
-
-i77vers.o: i77vers.c
-	$(CC) -c i77vers.c
-
-# To get an "f2c.h" for use with "f2c -C++", first "make hadd"
-hadd: f2c.h0 f2ch.add
-	cat f2c.h0 f2ch.add >f2c.h
-
-# For use with "f2c" and "f2c -A":
-f2c.h: f2c.h0
-	cp f2c.h0 f2c.h
-
-# You may need to adjust signal1.h and sysdep1.h suitably for your system...
-signal1.h: signal1.h0
-	cp signal1.h0 signal1.h
-
-sysdep1.h: sysdep1.h0
-	cp sysdep1.h0 sysdep1.h
-
-# If your system lacks onexit() and you are not using an
-# ANSI C compiler, then you should uncomment the following
-# two lines (for compiling main.o):
-#main.o: main.c
-#	$(CC) -c -DNO_ONEXIT -DSkip_f2c_Undefs main.c
-# On at least some Sun systems, it is more appropriate to
-# uncomment the following two lines:
-#main.o: main.c
-#	$(CC) -c -Donexit=on_exit -DSkip_f2c_Undefs main.c
-
-install: libf2c.a
-	cp libf2c.a $(LIBDIR)
-	-ranlib $(LIBDIR)/libf2c.a
-
-clean:
-	rm -f *.o arith.h signal1.h sysdep1.h
-
-backspac.o:	fio.h
-close.o:	fio.h
-dfe.o:		fio.h
-dfe.o:		fmt.h
-due.o:		fio.h
-endfile.o:	fio.h rawio.h
-err.o:		fio.h rawio.h
-fmt.o:		fio.h
-fmt.o:		fmt.h
-iio.o:		fio.h
-iio.o:		fmt.h
-ilnw.o:		fio.h
-ilnw.o:		lio.h
-inquire.o:	fio.h
-lread.o:	fio.h
-lread.o:	fmt.h
-lread.o:	lio.h
-lread.o:	fp.h
-lwrite.o:	fio.h
-lwrite.o:	fmt.h
-lwrite.o:	lio.h
-open.o:		fio.h rawio.h
-rdfmt.o:	fio.h
-rdfmt.o:	fmt.h
-rdfmt.o:	fp.h
-rewind.o:	fio.h
-rsfe.o:		fio.h
-rsfe.o:		fmt.h
-rsli.o:		fio.h
-rsli.o:		lio.h
-rsne.o:		fio.h
-rsne.o:		lio.h
-sfe.o:		fio.h
-signbit.o:	arith.h
-sue.o:		fio.h
-uio.o:		fio.h
-uninit.o:	arith.h
-util.o:		fio.h
-wref.o:		fio.h
-wref.o:		fmt.h
-wref.o:		fp.h
-wrtfmt.o:	fio.h
-wrtfmt.o:	fmt.h
-wsfe.o:		fio.h
-wsfe.o:		fmt.h
-wsle.o:		fio.h
-wsle.o:		fmt.h
-wsle.o:		lio.h
-wsne.o:		fio.h
-wsne.o:		lio.h
-xwsne.o:	fio.h
-xwsne.o:	lio.h
-xwsne.o:	fmt.h
-
-arith.h: arithchk.c
-	$(CC) $(CFLAGS) -DNO_FPINIT arithchk.c -lm ||\
-	 $(CC) -DNO_LONG_LONG $(CFLAGS) -DNO_FPINIT arithchk.c -lm
-	./a.out >arith.h
-	rm -f a.out arithchk.o
-
-check:
-	xsum Notice README abort_.c arithchk.c backspac.c c_abs.c c_cos.c \
-	c_div.c c_exp.c c_log.c c_sin.c c_sqrt.c cabs.c close.c comptry.bat \
-	ctype.c ctype.h \
-	d_abs.c d_acos.c d_asin.c d_atan.c d_atn2.c d_cnjg.c d_cos.c d_cosh.c \
-	d_dim.c d_exp.c d_imag.c d_int.c d_lg10.c d_log.c d_mod.c \
-	d_nint.c d_prod.c d_sign.c d_sin.c d_sinh.c d_sqrt.c d_tan.c \
-	d_tanh.c derf_.c derfc_.c dfe.c dolio.c dtime_.c due.c ef1asc_.c \
-	ef1cmc_.c endfile.c erf_.c erfc_.c err.c etime_.c exit_.c f2c.h0 \
-	f2ch.add f77_aloc.c f77vers.c fio.h fmt.c fmt.h fmtlib.c \
-	fp.h ftell_.c ftell64_.c \
-	getarg_.c getenv_.c h_abs.c h_dim.c h_dnnt.c h_indx.c h_len.c \
-	h_mod.c h_nint.c h_sign.c hl_ge.c hl_gt.c hl_le.c hl_lt.c \
-	i77vers.c i_abs.c i_dim.c i_dnnt.c i_indx.c i_len.c i_mod.c \
-	i_nint.c i_sign.c iargc_.c iio.c ilnw.c inquire.c l_ge.c l_gt.c \
-	l_le.c l_lt.c lbitbits.c lbitshft.c libf2c.lbc libf2c.sy lio.h \
-	lread.c lwrite.c main.c makefile.sy makefile.u makefile.vc \
-	makefile.wat math.hvc mkfile.plan9 open.c pow_ci.c pow_dd.c \
-	pow_di.c pow_hh.c pow_ii.c pow_qq.c pow_ri.c pow_zi.c pow_zz.c \
-	qbitbits.c qbitshft.c r_abs.c r_acos.c r_asin.c r_atan.c r_atn2.c \
-	r_cnjg.c r_cos.c r_cosh.c r_dim.c r_exp.c r_imag.c r_int.c r_lg10.c \
-	r_log.c r_mod.c r_nint.c r_sign.c r_sin.c r_sinh.c r_sqrt.c \
-	r_tan.c r_tanh.c rawio.h rdfmt.c rewind.c rsfe.c rsli.c rsne.c \
-	s_cat.c s_cmp.c s_copy.c s_paus.c s_rnge.c s_stop.c scomptry.bat sfe.c \
-	sig_die.c signal1.h0 signal_.c signbit.c sue.c sysdep1.h0 system_.c \
-	typesize.c \
-	uio.c uninit.c util.c wref.c wrtfmt.c wsfe.c wsle.c wsne.c xwsne.c \
-	z_abs.c z_cos.c z_div.c z_exp.c z_log.c z_sin.c z_sqrt.c >xsum1.out
-	cmp xsum0.out xsum1.out && mv xsum1.out xsum.out || diff xsum[01].out
diff -Nru igraph-0.6.5~quantal1/src/f2c/makefile.vc igraph-0.6.5/src/f2c/makefile.vc
--- igraph-0.6.5~quantal1/src/f2c/makefile.vc	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/makefile.vc	1970-01-01 00:00:00.000000000 +0000
@@ -1,195 +0,0 @@
-# For making f2c.lib (here called vcf2c.lib) with Microsoft Visual C++ .
-# Invoke with "nmake -f makefile.vc" .
-
-# To get signed zeros in write statements on IEEE-arithmetic systems,
-# add -DSIGNED_ZEROS to the CFLAGS assignment below and add signbit.obj
-# to the objects in the "w =" list below.
-
-CC = cl
-CFLAGS = -DUSE_CLOCK -DMSDOS -DNO_ONEXIT -Ot1 -DNO_My_ctype -DNO_ISATTY
-
-.c.obj:
-	$(CC) -c $(CFLAGS) $*.c
-
-w = \
-	abort_.obj \
-	backspac.obj \
-	c_abs.obj \
-	c_cos.obj \
-	c_div.obj \
-	c_exp.obj \
-	c_log.obj \
-	c_sin.obj \
-	c_sqrt.obj \
-	cabs.obj \
-	close.obj \
-	d_abs.obj \
-	d_acos.obj \
-	d_asin.obj \
-	d_atan.obj \
-	d_atn2.obj \
-	d_cnjg.obj \
-	d_cos.obj \
-	d_cosh.obj \
-	d_dim.obj \
-	d_exp.obj \
-	d_imag.obj \
-	d_int.obj \
-	d_lg10.obj \
-	d_log.obj \
-	d_mod.obj \
-	d_nint.obj \
-	d_prod.obj \
-	d_sign.obj \
-	d_sin.obj \
-	d_sinh.obj \
-	d_sqrt.obj \
-	d_tan.obj \
-	d_tanh.obj \
-	derf_.obj \
-	derfc_.obj \
-	dfe.obj \
-	dolio.obj \
-	dtime_.obj \
-	due.obj \
-	ef1asc_.obj \
-	ef1cmc_.obj \
-	endfile.obj \
-	erf_.obj \
-	erfc_.obj \
-	err.obj \
-	etime_.obj \
-	exit_.obj \
-	f77_aloc.obj \
-	f77vers.obj \
-	fmt.obj \
-	fmtlib.obj \
-	ftell_.obj \
-	getarg_.obj \
-	getenv_.obj \
-	h_abs.obj \
-	h_dim.obj \
-	h_dnnt.obj \
-	h_indx.obj \
-	h_len.obj \
-	h_mod.obj \
-	h_nint.obj \
-	h_sign.obj \
-	hl_ge.obj \
-	hl_gt.obj \
-	hl_le.obj \
-	hl_lt.obj \
-	i77vers.obj \
-	i_abs.obj \
-	i_dim.obj \
-	i_dnnt.obj \
-	i_indx.obj \
-	i_len.obj \
-	i_mod.obj \
-	i_nint.obj \
-	i_sign.obj \
-	iargc_.obj \
-	iio.obj \
-	ilnw.obj \
-	inquire.obj \
-	l_ge.obj \
-	l_gt.obj \
-	l_le.obj \
-	l_lt.obj \
-	lbitbits.obj \
-	lbitshft.obj \
-	lread.obj \
-	lwrite.obj \
-	main.obj \
-	open.obj \
-	pow_ci.obj \
-	pow_dd.obj \
-	pow_di.obj \
-	pow_hh.obj \
-	pow_ii.obj \
-	pow_ri.obj \
-	pow_zi.obj \
-	pow_zz.obj \
-	r_abs.obj \
-	r_acos.obj \
-	r_asin.obj \
-	r_atan.obj \
-	r_atn2.obj \
-	r_cnjg.obj \
-	r_cos.obj \
-	r_cosh.obj \
-	r_dim.obj \
-	r_exp.obj \
-	r_imag.obj \
-	r_int.obj \
-	r_lg10.obj \
-	r_log.obj \
-	r_mod.obj \
-	r_nint.obj \
-	r_sign.obj \
-	r_sin.obj \
-	r_sinh.obj \
-	r_sqrt.obj \
-	r_tan.obj \
-	r_tanh.obj \
-	rdfmt.obj \
-	rewind.obj \
-	rsfe.obj \
-	rsli.obj \
-	rsne.obj \
-	s_cat.obj \
-	s_cmp.obj \
-	s_copy.obj \
-	s_paus.obj \
-	s_rnge.obj \
-	s_stop.obj \
-	sfe.obj \
-	sig_die.obj \
-	signal_.obj \
-	sue.obj \
-	system_.obj \
-	typesize.obj \
-	uio.obj \
-	uninit.obj \
-	util.obj \
-	wref.obj \
-	wrtfmt.obj \
-	wsfe.obj \
-	wsle.obj \
-	wsne.obj \
-	xwsne.obj \
-	z_abs.obj \
-	z_cos.obj \
-	z_div.obj \
-	z_exp.obj \
-	z_log.obj \
-	z_sin.obj \
-	z_sqrt.obj
-
-all: f2c.h math.h signal1.h sysdep1.h vcf2c.lib
-
-f2c.h: f2c.h0
-	copy f2c.h0 f2c.h
-
-math.h: math.hvc
-	copy math.hvc math.h
-
-signal1.h: signal1.h0
-	copy signal1.h0 signal1.h
-
-sysdep1.h: sysdep1.h0
-	copy sysdep1.h0 sysdep1.h
-
-vcf2c.lib: $w
-	lib -out:vcf2c.lib @libf2c.lbc
-
-open.obj: open.c
-	$(CC) -c $(CFLAGS) -DMSDOS open.c
-
-signbit.obj uninit.obj: arith.h
-
-arith.h: arithchk.c
-	comptry.bat $(CC) $(CFLAGS) -DNO_FPINIT arithchk.c
-	arithchk >arith.h
-	del arithchk.exe
-	del arithchk.obj
diff -Nru igraph-0.6.5~quantal1/src/f2c/makefile.wat igraph-0.6.5/src/f2c/makefile.wat
--- igraph-0.6.5~quantal1/src/f2c/makefile.wat	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/makefile.wat	1970-01-01 00:00:00.000000000 +0000
@@ -1,189 +0,0 @@
-# For making f2c.lib (here called watf2c.lib) with WATCOM C/C++ .
-# Invoke with "wmake -u -f makefile.wat" .
-# In the CFLAGS line below, "-bt=nt" is for NT and W9x.
-# With WATCOM, it is necessary to explicitly load main.obj .
-
-# To get signed zeros in write statements on IEEE-arithmetic systems,
-# add -DSIGNED_ZEROS to the CFLAGS assignment below and add signbit.obj
-# to the objects in the "w =" list below.
-
-CC = wcc386
-CFLAGS = -fpd -DMSDOS -DUSE_CLOCK -DNO_ONEXIT -bt=nt -DNO_My_ctype
-
-.c.obj:
-	$(CC) $(CFLAGS) $*.c
-
-w = \
-	abort_.obj \
-	backspac.obj \
-	c_abs.obj \
-	c_cos.obj \
-	c_div.obj \
-	c_exp.obj \
-	c_log.obj \
-	c_sin.obj \
-	c_sqrt.obj \
-	cabs.obj \
-	close.obj \
-	d_abs.obj \
-	d_acos.obj \
-	d_asin.obj \
-	d_atan.obj \
-	d_atn2.obj \
-	d_cnjg.obj \
-	d_cos.obj \
-	d_cosh.obj \
-	d_dim.obj \
-	d_exp.obj \
-	d_imag.obj \
-	d_int.obj \
-	d_lg10.obj \
-	d_log.obj \
-	d_mod.obj \
-	d_nint.obj \
-	d_prod.obj \
-	d_sign.obj \
-	d_sin.obj \
-	d_sinh.obj \
-	d_sqrt.obj \
-	d_tan.obj \
-	d_tanh.obj \
-	derf_.obj \
-	derfc_.obj \
-	dfe.obj \
-	dolio.obj \
-	dtime_.obj \
-	due.obj \
-	ef1asc_.obj \
-	ef1cmc_.obj \
-	endfile.obj \
-	erf_.obj \
-	erfc_.obj \
-	err.obj \
-	etime_.obj \
-	exit_.obj \
-	f77_aloc.obj \
-	f77vers.obj \
-	fmt.obj \
-	fmtlib.obj \
-	ftell_.obj \
-	getarg_.obj \
-	getenv_.obj \
-	h_abs.obj \
-	h_dim.obj \
-	h_dnnt.obj \
-	h_indx.obj \
-	h_len.obj \
-	h_mod.obj \
-	h_nint.obj \
-	h_sign.obj \
-	hl_ge.obj \
-	hl_gt.obj \
-	hl_le.obj \
-	hl_lt.obj \
-	i77vers.obj \
-	i_abs.obj \
-	i_dim.obj \
-	i_dnnt.obj \
-	i_indx.obj \
-	i_len.obj \
-	i_mod.obj \
-	i_nint.obj \
-	i_sign.obj \
-	iargc_.obj \
-	iio.obj \
-	ilnw.obj \
-	inquire.obj \
-	l_ge.obj \
-	l_gt.obj \
-	l_le.obj \
-	l_lt.obj \
-	lbitbits.obj \
-	lbitshft.obj \
-	lread.obj \
-	lwrite.obj \
-	main.obj \
-	open.obj \
-	pow_ci.obj \
-	pow_dd.obj \
-	pow_di.obj \
-	pow_hh.obj \
-	pow_ii.obj \
-	pow_ri.obj \
-	pow_zi.obj \
-	pow_zz.obj \
-	r_abs.obj \
-	r_acos.obj \
-	r_asin.obj \
-	r_atan.obj \
-	r_atn2.obj \
-	r_cnjg.obj \
-	r_cos.obj \
-	r_cosh.obj \
-	r_dim.obj \
-	r_exp.obj \
-	r_imag.obj \
-	r_int.obj \
-	r_lg10.obj \
-	r_log.obj \
-	r_mod.obj \
-	r_nint.obj \
-	r_sign.obj \
-	r_sin.obj \
-	r_sinh.obj \
-	r_sqrt.obj \
-	r_tan.obj \
-	r_tanh.obj \
-	rdfmt.obj \
-	rewind.obj \
-	rsfe.obj \
-	rsli.obj \
-	rsne.obj \
-	s_cat.obj \
-	s_cmp.obj \
-	s_copy.obj \
-	s_paus.obj \
-	s_rnge.obj \
-	s_stop.obj \
-	sfe.obj \
-	sig_die.obj \
-	signal_.obj \
-	sue.obj \
-	system_.obj \
-	typesize.obj \
-	uio.obj \
-	uninit.obj \
-	util.obj \
-	wref.obj \
-	wrtfmt.obj \
-	wsfe.obj \
-	wsle.obj \
-	wsne.obj \
-	xwsne.obj \
-	z_abs.obj \
-	z_cos.obj \
-	z_div.obj \
-	z_exp.obj \
-	z_log.obj \
-	z_sin.obj \
-	z_sqrt.obj
-
-watf2c.lib: f2c.h signal1.h sysdep1.h $w
-	wlib -c watf2c.lib @libf2c
-
-f2c.h: f2c.h0
-	copy f2c.h0 f2c.h
-
-signal1.h: signal1.h0
-	copy signal1.h0 signal1.h
-
-sysdep1.h: sysdep1.h0
-	copy sysdep1.h0 sysdep1.h
-
-signbit.obj uninit.obj: arith.h
-
-arith.h: arithchk.c
-	comptry.bat wcl386 -DNO_FPINIT arithchk.c
-	arithchk >arith.h
-	del arithchk.exe
-	del arithchk.obj
diff -Nru igraph-0.6.5~quantal1/src/f2c/math.hvc igraph-0.6.5/src/f2c/math.hvc
--- igraph-0.6.5~quantal1/src/f2c/math.hvc	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/math.hvc	1970-01-01 00:00:00.000000000 +0000
@@ -1,3 +0,0 @@
-/* for VC 4.2 */
-#include <math.h>
-#undef complex
diff -Nru igraph-0.6.5~quantal1/src/f2c/mkfile.plan9 igraph-0.6.5/src/f2c/mkfile.plan9
--- igraph-0.6.5~quantal1/src/f2c/mkfile.plan9	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/mkfile.plan9	1970-01-01 00:00:00.000000000 +0000
@@ -1,162 +0,0 @@
-#	Plan 9 mkfile for libf2c.a$O
-
-</$objtype/mkfile
-
-CC = pcc
-CFLAGS = -D_POSIX_SOURCE -DNON_UNIX_STDIO -DNO_TRUNCATE
-
-%.$O: %.c
-        $CC -c $CFLAGS $stem.c
-
-MISC =	f77vers.$O i77vers.$O main.$O s_rnge.$O abort_.$O exit_.$O\
-	getarg_.$O iargc_.$O\
-	getenv_.$O signal_.$O s_stop.$O s_paus.$O system_.$O cabs.$O\
-	derf_.$O derfc_.$O erf_.$O erfc_.$O sig_die.$O uninit.$O
-POW =	pow_ci.$O pow_dd.$O pow_di.$O pow_hh.$O pow_ii.$O pow_ri.$O\
-	pow_zi.$O pow_zz.$O
-CX =	c_abs.$O c_cos.$O c_div.$O c_exp.$O c_log.$O c_sin.$O c_sqrt.$O
-DCX =	z_abs.$O z_cos.$O z_div.$O z_exp.$O z_log.$O z_sin.$O z_sqrt.$O
-REAL =	r_abs.$O r_acos.$O r_asin.$O r_atan.$O r_atn2.$O r_cnjg.$O r_cos.$O\
-	r_cosh.$O r_dim.$O r_exp.$O r_imag.$O r_int.$O\
-	r_lg10.$O r_log.$O r_mod.$O r_nint.$O r_sign.$O\
-	r_sin.$O r_sinh.$O r_sqrt.$O r_tan.$O r_tanh.$O
-DBL =	d_abs.$O d_acos.$O d_asin.$O d_atan.$O d_atn2.$O\
-	d_cnjg.$O d_cos.$O d_cosh.$O d_dim.$O d_exp.$O\
-	d_imag.$O d_int.$O d_lg10.$O d_log.$O d_mod.$O\
-	d_nint.$O d_prod.$O d_sign.$O d_sin.$O d_sinh.$O\
-	d_sqrt.$O d_tan.$O d_tanh.$O
-INT =	i_abs.$O i_dim.$O i_dnnt.$O i_indx.$O i_len.$O i_mod.$O\
-	i_nint.$O i_sign.$O lbitbits.$O lbitshft.$O
-HALF =	h_abs.$O h_dim.$O h_dnnt.$O h_indx.$O h_len.$O h_mod.$O\
-	h_nint.$O h_sign.$O
-CMP =	l_ge.$O l_gt.$O l_le.$O l_lt.$O hl_ge.$O hl_gt.$O hl_le.$O hl_lt.$O
-EFL =	ef1asc_.$O ef1cmc_.$O
-CHAR =	f77_aloc.$O s_cat.$O s_cmp.$O s_copy.$O
-I77 =	backspac.$O close.$O dfe.$O dolio.$O due.$O endfile.$O err.$O\
-	fmt.$O fmtlib.$O ftell_.$O iio.$O ilnw.$O inquire.$O lread.$O\
-	lwrite.$O open.$O rdfmt.$O rewind.$O rsfe.$O rsli.$O rsne.$O\
-	sfe.$O sue.$O typesize.$O uio.$O util.$O wref.$O wrtfmt.$O\
-	wsfe.$O wsle.$O wsne.$O xwsne.$O
-QINT =	pow_qq.$O qbitbits.$O qbitshft.$O
-TIME =	dtime_.$O etime_.$O
-
-# pcc does not currently (20010222) understand unsigned long long
-# so we omit $QINT from the dependency list for libf2c.a$O.
-
-all:N: f2c.h signal1.h libf2c.a$O
-
-libf2c.a$O: $MISC $POW $CX $DCX $REAL $DBL $INT \
-	$HALF $CMP $EFL $CHAR $I77 $TIME
-	ar r $target $newprereq
-	rm $newprereq
-
-### If your system lacks ranlib, you don't need it; see README.; set -e
-
-f77vers.$O: f77vers.c
-	$CC -c f77vers.c
-
-i77vers.$O: i77vers.c
-	$CC -c i77vers.c
-
-# To get an "f2c.h" for use with "f2c -C++", first "make hadd"
-hadd: f2c.h0 f2ch.add
-	cat f2c.h0 f2ch.add >f2c.h
-
-# For use with "f2c" and "f2c -A":
-f2c.h: f2c.h0
-	cp f2c.h0 f2c.h
-
-# You may need to adjust signal1.h suitably for your system...
-signal1.h: signal1.h0
-	cp signal1.h0 signal1.h
-
-clean:
-	rm -f libf2c.a$O *.$O arith.h
-
-backspac.$O:	fio.h
-close.$O:	fio.h
-dfe.$O:		fio.h
-dfe.$O:		fmt.h
-due.$O:		fio.h
-endfile.$O:	fio.h rawio.h
-err.$O:		fio.h rawio.h
-fmt.$O:		fio.h
-fmt.$O:		fmt.h
-iio.$O:		fio.h
-iio.$O:		fmt.h
-ilnw.$O:		fio.h
-ilnw.$O:		lio.h
-inquire.$O:	fio.h
-lread.$O:	fio.h
-lread.$O:	fmt.h
-lread.$O:	lio.h
-lread.$O:	fp.h
-lwrite.$O:	fio.h
-lwrite.$O:	fmt.h
-lwrite.$O:	lio.h
-open.$O:		fio.h rawio.h
-rdfmt.$O:	fio.h
-rdfmt.$O:	fmt.h
-rdfmt.$O:	fp.h
-rewind.$O:	fio.h
-rsfe.$O:		fio.h
-rsfe.$O:		fmt.h
-rsli.$O:		fio.h
-rsli.$O:		lio.h
-rsne.$O:		fio.h
-rsne.$O:		lio.h
-sfe.$O:		fio.h
-sue.$O:		fio.h
-uio.$O:		fio.h
-uninit.$O:	arith.h
-util.$O:		fio.h
-wref.$O:		fio.h
-wref.$O:		fmt.h
-wref.$O:		fp.h
-wrtfmt.$O:	fio.h
-wrtfmt.$O:	fmt.h
-wsfe.$O:		fio.h
-wsfe.$O:		fmt.h
-wsle.$O:		fio.h
-wsle.$O:		fmt.h
-wsle.$O:		lio.h
-wsne.$O:		fio.h
-wsne.$O:		lio.h
-xwsne.$O:	fio.h
-xwsne.$O:	lio.h
-xwsne.$O:	fmt.h
-
-arith.h: arithchk.c
-	pcc -DNO_FPINIT -o arithchk arithchk.c
-	arithchk >$target
-	rm arithchk
-
-xsum.out:V: check
-
-check:
-	xsum Notice README abort_.c arithchk.c backspac.c c_abs.c c_cos.c \
-	c_div.c c_exp.c c_log.c c_sin.c c_sqrt.c cabs.c close.c comptry.bat \
-	d_abs.c d_acos.c d_asin.c d_atan.c d_atn2.c d_cnjg.c d_cos.c d_cosh.c \
-	d_dim.c d_exp.c d_imag.c d_int.c d_lg10.c d_log.c d_mod.c \
-	d_nint.c d_prod.c d_sign.c d_sin.c d_sinh.c d_sqrt.c d_tan.c \
-	d_tanh.c derf_.c derfc_.c dfe.c dolio.c dtime_.c due.c ef1asc_.c \
-	ef1cmc_.c endfile.c erf_.c erfc_.c err.c etime_.c exit_.c f2c.h0 \
-	f2ch.add f77_aloc.c f77vers.c fio.h fmt.c fmt.h fmtlib.c \
-	fp.h ftell_.c \
-	getarg_.c getenv_.c h_abs.c h_dim.c h_dnnt.c h_indx.c h_len.c \
-	h_mod.c h_nint.c h_sign.c hl_ge.c hl_gt.c hl_le.c hl_lt.c \
-	i77vers.c i_abs.c i_dim.c i_dnnt.c i_indx.c i_len.c i_mod.c \
-	i_nint.c i_sign.c iargc_.c iio.c ilnw.c inquire.c l_ge.c l_gt.c \
-	l_le.c l_lt.c lbitbits.c lbitshft.c libf2c.lbc libf2c.sy lio.h \
-	lread.c lwrite.c main.c makefile.sy makefile.u makefile.vc \
-	makefile.wat math.hvc mkfile.plan9 open.c pow_ci.c pow_dd.c \
-	pow_di.c pow_hh.c pow_ii.c pow_qq.c pow_ri.c pow_zi.c pow_zz.c \
-	qbitbits.c qbitshft.c r_abs.c r_acos.c r_asin.c r_atan.c r_atn2.c \
-	r_cnjg.c r_cos.c r_cosh.c r_dim.c r_exp.c r_imag.c r_int.c r_lg10.c \
-	r_log.c r_mod.c r_nint.c r_sign.c r_sin.c r_sinh.c r_sqrt.c \
-	r_tan.c r_tanh.c rawio.h rdfmt.c rewind.c rsfe.c rsli.c rsne.c \
-	s_cat.c s_cmp.c s_copy.c s_paus.c s_rnge.c s_stop.c sfe.c \
-	sig_die.c signal1.h0 signal_.c sue.c system_.c typesize.c uio.c \
-	uninit.c util.c wref.c wrtfmt.c wsfe.c wsle.c wsne.c xwsne.c \
-	z_abs.c z_cos.c z_div.c z_exp.c z_log.c z_sin.c z_sqrt.c >xsum1.out
-	cmp xsum0.out xsum1.out && mv xsum1.out xsum.out || diff xsum[01].out
diff -Nru igraph-0.6.5~quantal1/src/f2c/rawio.h igraph-0.6.5/src/f2c/rawio.h
--- igraph-0.6.5~quantal1/src/f2c/rawio.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/rawio.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,41 +0,0 @@
-#ifndef KR_headers
-#ifdef MSDOS
-#include "io.h"
-#ifndef WATCOM
-#define close _close
-#define creat _creat
-#define open _open
-#define read _read
-#define write _write
-#endif /*WATCOM*/
-#endif /*MSDOS*/
-#ifdef __cplusplus
-extern "C" {
-#endif
-#ifndef MSDOS
-#ifdef OPEN_DECL
-extern int creat(const char*,int), open(const char*,int);
-#endif
-extern int close(int);
-extern int read(int,void*,size_t), write(int,void*,size_t);
-extern int unlink(const char*);
-#ifndef _POSIX_SOURCE
-#ifndef NON_UNIX_STDIO
-extern FILE *fdopen(int, const char*);
-#endif
-#endif
-#endif /*KR_HEADERS*/
-
-extern char *mktemp(char*);
-
-#ifdef __cplusplus
-	}
-#endif
-#endif
-
-#include "fcntl.h"
-
-#ifndef O_WRONLY
-#define O_RDONLY 0
-#define O_WRONLY 1
-#endif
diff -Nru igraph-0.6.5~quantal1/src/f2c/scomptry.bat igraph-0.6.5/src/f2c/scomptry.bat
--- igraph-0.6.5~quantal1/src/f2c/scomptry.bat	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/scomptry.bat	1970-01-01 00:00:00.000000000 +0000
@@ -1,5 +0,0 @@
-%1 -DWRITE_ARITH_H -DNO_FPINIT %2 %3 %4 %5 %6 %7 %8 %9
-if errorlevel 1 goto nolonglong
-exit 0
-:nolonglong
-%1 -DNO_LONG_LONG -DWRITE_ARITH_H -DNO_FPINIT %2 %3 %4 %5 %6 %7 %8 %9
diff -Nru igraph-0.6.5~quantal1/src/f2c/xsum0.out igraph-0.6.5/src/f2c/xsum0.out
--- igraph-0.6.5~quantal1/src/f2c/xsum0.out	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c/xsum0.out	1970-01-01 00:00:00.000000000 +0000
@@ -1,182 +0,0 @@
-Notice	76f23b4	1212
-README	16a3882f	16876
-abort_.c	f51c808	304
-arithchk.c	fae7c666	5171
-backspac.c	10ebf554	1328
-c_abs.c	fec22c59	272
-c_cos.c	18fc0ea3	354
-c_div.c	1797c106	936
-c_exp.c	1b85b1fc	349
-c_log.c	28cdfed	384
-c_sin.c	1ccaedc8	350
-c_sqrt.c	f1ee88d5	605
-cabs.c	f3d3b5f2	494
-close.c	173f01de	1393
-comptry.bat	f8a8a0d5	125
-ctype.c	f553a125	40
-ctype.h	1e54977d	1139
-d_abs.c	e58094ef	218
-d_acos.c	e5ecf93d	245
-d_asin.c	e12ceeff	245
-d_atan.c	53034db	245
-d_atn2.c	ff8a1a78	271
-d_cnjg.c	1c27c728	255
-d_cos.c	c0eb625	241
-d_cosh.c	11dc4adb	245
-d_dim.c	e1ccb774	232
-d_exp.c	1879c41c	241
-d_imag.c	fe9c703e	201
-d_int.c	f5de3566	269
-d_lg10.c	1a1d7b77	291
-d_log.c	1b368adf	241
-d_mod.c	f540cf24	688
-d_nint.c	ff913b40	281
-d_prod.c	ad4856b	207
-d_sign.c	9562fc5	266
-d_sin.c	6e3f542	241
-d_sinh.c	18b22950	245
-d_sqrt.c	17e1db09	245
-d_tan.c	ec93ebdb	241
-d_tanh.c	1c55d15b	245
-derf_.c	f85e74a3	239
-derfc_.c	e96b7667	253
-dfe.c	1d658105	2624
-dolio.c	19c9fbd9	471
-dtime_.c	c982be4	972
-due.c	ee219f6d	1624
-ef1asc_.c	e0576e63	521
-ef1cmc_.c	ea5ad9e8	427
-endfile.c	6f7201d	2838
-erf_.c	e82f7790	270
-erfc_.c	ba65441	275
-err.c	e59d1707	6442
-etime_.c	19d1fdad	839
-exit_.c	ff4baa3a	543
-f2c.h0	e770b7d8	4688
-f2ch.add	ef66bf17	6060
-f77_aloc.c	f8daf96e	684
-f77vers.c	ed1c96fa	4933
-fio.h	e41d245e	2939
-fmt.c	f9a1bb94	8566
-fmt.h	ec84ce17	2006
-fmtlib.c	eefc6a27	865
-fp.h	100fb355	665
-ftell_.c	78218d	900
-ftell64_.c	e2c4b21e	917
-getarg_.c	fd514f59	592
-getenv_.c	f4b06e2	1223
-h_abs.c	e4443109	218
-h_dim.c	c6e48bc	230
-h_dnnt.c	f6bb90e	294
-h_indx.c	ef8461eb	442
-h_len.c	e8c3633	205
-h_mod.c	7355bd0	207
-h_nint.c	f0da3396	281
-h_sign.c	f1370ffd	266
-hl_ge.c	ed792501	346
-hl_gt.c	feeacbd9	345
-hl_le.c	f6fb5d6e	346
-hl_lt.c	18501419	345
-i77vers.c	f57b8ef2	18128
-i_abs.c	12ab51ab	214
-i_dim.c	f2a56785	225
-i_dnnt.c	11748482	291
-i_indx.c	fb59026f	430
-i_len.c	17d17252	203
-i_mod.c	bef73ae	211
-i_nint.c	e494b804	278
-i_sign.c	fa015b08	260
-iargc_.c	49abda3	196
-iio.c	f958b627	2639
-ilnw.c	fe0ab14b	1125
-inquire.c	1883d542	2732
-l_ge.c	f4710e74	334
-l_gt.c	e8db94a7	333
-l_le.c	c9c0a99	334
-l_lt.c	767e79f	333
-lbitbits.c	33fe981	1097
-lbitshft.c	e81981d2	258
-libf2c.lbc	10af591e	1594
-libf2c.sy	fd5f568f	2051
-lio.h	805735d	1564
-lread.c	f1e54a1f	14739
-lwrite.c	f80da63f	4616
-main.c	371f60f	2230
-makefile.sy	174ccb83	2990
-makefile.u	fce2cb5f	7302
-makefile.vc	179d7b1c	2942
-makefile.wat	18b044ac	2936
-math.hvc	19bb2d07	50
-mkfile.plan9	e67e471e	5174
-open.c	e7bcc295	5701
-pow_ci.c	fa934cec	412
-pow_dd.c	f004559b	276
-pow_di.c	a4db539	448
-pow_hh.c	d1a45a9	489
-pow_ii.c	1fcf2742	488
-pow_qq.c	e6a32de6	516
-pow_ri.c	e7d9fc2a	436
-pow_zi.c	1b894af7	851
-pow_zz.c	f81a06b5	549
-qbitbits.c	fdb9910e	1151
-qbitshft.c	873054d	258
-r_abs.c	f471383c	206
-r_acos.c	1a6aca63	233
-r_asin.c	e8555587	233
-r_atan.c	eac25444	233
-r_atn2.c	f611bea	253
-r_cnjg.c	a8d7805	235
-r_cos.c	fdef1ece	229
-r_cosh.c	f05d1ae	233
-r_dim.c	ee23e1a8	214
-r_exp.c	1da16cd7	229
-r_imag.c	166ad0f3	189
-r_int.c	fc80b9a8	257
-r_lg10.c	e876cfab	279
-r_log.c	2062254	229
-r_mod.c	187363fc	678
-r_nint.c	6edcbb2	269
-r_sign.c	1ae32441	248
-r_sin.c	c3d968	229
-r_sinh.c	1090c850	233
-r_sqrt.c	ffbb0625	233
-r_tan.c	fe85179d	229
-r_tanh.c	10ffcc5b	233
-rawio.h	1ab49f7c	718
-rdfmt.c	7222fee	8925
-rewind.c	e4c6236f	475
-rsfe.c	eb9e882c	1492
-rsli.c	11f59b61	1785
-rsne.c	fea7e5be	11585
-s_cat.c	164a6ff1	1458
-s_cmp.c	e69e8b60	722
-s_copy.c	1e258852	1024
-s_paus.c	e37cfe6	1617
-s_rnge.c	e8cf83a3	759
-s_stop.c	ffa80b24	762
-scomptry.bat	ed740ad8	181
-sfe.c	1e10bda3	828
-sig_die.c	12eb0eac	689
-signal1.h0	1d43ee57	842
-signal_.c	f3ef9cfc	299
-signbit.c	e37eac06	330
-sue.c	9705ecf	1865
-sysdep1.h0	1812022d	1202
-system_.c	ff72e46c	652
-typesize.c	eee307ae	386
-uio.c	e354a770	1619
-uninit.c	fe760fb0	7584
-util.c	172fa76e	972
-wref.c	17bbfb7b	4747
-wrtfmt.c	113fc4f9	7506
-wsfe.c	f2d1fe4d	1280
-wsle.c	fe50b4c9	697
-wsne.c	428bfda	479
-xwsne.c	185c4bdc	1174
-z_abs.c	1fa0640d	268
-z_cos.c	facccd9b	363
-z_div.c	e6f03676	913
-z_exp.c	1a8506e8	357
-z_log.c	6bf3b22	2729
-z_sin.c	1aa35b59	359
-z_sqrt.c	1864d867	581
diff -Nru igraph-0.6.5~quantal1/src/f2c_dummy.c igraph-0.6.5/src/f2c_dummy.c
--- igraph-0.6.5~quantal1/src/f2c_dummy.c	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/f2c_dummy.c	1970-01-01 00:00:00.000000000 +0000
@@ -1,25 +0,0 @@
-/* -*- mode: C -*-  */
-/* 
-   IGraph library.
-   Copyright (C) 2010-2012  Gabor Csardi <csardi.gabor@gmail.com>
-   334 Harvard street, Cambridge, MA 02139 USA
-   
-   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 2 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, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 
-   02110-1301 USA
-
-*/
-
-int MAIN__(void) { return 0; }
-
diff -Nru igraph-0.6.5~quantal1/src/foreign-dl-lexer.c igraph-0.6.5/src/foreign-dl-lexer.c
--- igraph-0.6.5~quantal1/src/foreign-dl-lexer.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-dl-lexer.c	2013-03-03 01:31:29.000000000 +0000
@@ -0,0 +1,2240 @@
+#line 2 "foreign-dl-lexer.c"
+
+#line 4 "foreign-dl-lexer.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else	/* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif	/* defined (__STDC__) */
+#endif	/* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE igraph_dl_yyrestart(yyin ,yyscanner )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+    #define YY_LESS_LINENO(n)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	yy_size_t yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+    
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via igraph_dl_yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void igraph_dl_yyrestart (FILE *input_file ,yyscan_t yyscanner );
+void igraph_dl_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_dl_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner );
+void igraph_dl_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_dl_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_dl_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+void igraph_dl_yypop_buffer_state (yyscan_t yyscanner );
+
+static void igraph_dl_yyensure_buffer_stack (yyscan_t yyscanner );
+static void igraph_dl_yy_load_buffer_state (yyscan_t yyscanner );
+static void igraph_dl_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
+
+#define YY_FLUSH_BUFFER igraph_dl_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
+
+YY_BUFFER_STATE igraph_dl_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_dl_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_dl_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner );
+
+void *igraph_dl_yyalloc (yy_size_t ,yyscan_t yyscanner );
+void *igraph_dl_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner );
+void igraph_dl_yyfree (void * ,yyscan_t yyscanner );
+
+#define yy_new_buffer igraph_dl_yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        igraph_dl_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_dl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        igraph_dl_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_dl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+#define igraph_dl_yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state  ,yyscan_t yyscanner);
+static int yy_get_next_buffer (yyscan_t yyscanner );
+static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (size_t) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 24
+#define YY_END_OF_BUFFER 25
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static yyconst flex_int16_t yy_accept[129] =
+    {   0,
+        0,    0,    0,    0,    0,    0,   18,   18,   21,   21,
+       25,   23,   22,    1,    1,    4,   23,   23,   23,   23,
+       12,   11,   12,   12,   14,   15,   13,   17,   18,   17,
+       16,   20,   21,   19,   22,    1,    4,    0,    0,    0,
+        0,    0,    3,   12,   12,   12,   12,   14,   13,   17,
+       18,   16,   17,   17,   20,   21,   19,    0,    2,    0,
+        0,    3,   12,   12,   16,   17,   16,    0,    0,    0,
+       12,   12,    5,    0,    0,    5,   12,    0,    0,   12,
+        0,    0,    0,    6,   12,    0,    0,    0,    0,    0,
+        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+
+        0,    0,    0,    0,    0,    0,    0,    0,    0,    0,
+        0,    0,    0,    0,    0,    0,    0,    7,    9,    0,
+       10,    7,    7,    9,    8,   10,    8,    0
+    } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        2,    2,    4,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    5,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    6,    7,    8,    9,    1,   10,   11,   10,
+       10,   10,   10,   10,   10,   10,   10,   12,    1,    1,
+       13,    1,    1,    1,   14,   15,    1,   16,   17,   18,
+       19,    1,   20,    1,    1,   21,   22,   23,   24,    1,
+        1,   25,   26,   27,   28,    1,    1,   29,    1,    1,
+        1,    1,    1,    1,    1,    1,   14,   15,    1,   16,
+
+       17,   18,   19,    1,   20,    1,    1,   21,   22,   23,
+       24,    1,    1,   25,   26,   27,   28,    1,    1,   29,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int32_t yy_meta[30] =
+    {   0,
+        1,    2,    3,    3,    2,    1,    3,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int16_t yy_base[138] =
+    {   0,
+        0,   22,   44,   64,   84,   94,  104,  114,  124,  134,
+      287,  288,    4,  282,  282,    2,    1,  260,  269,   15,
+       29,  288,   39,   50,    0,  288,   34,    0,   52,   19,
+       64,    0,   54,   51,   74,  288,   67,  255,   88,  256,
+      265,  138,   98,  108,  118,  128,  144,    0,  145,    0,
+      151,  151,   72,  159,    0,  152,  153,  265,  169,  256,
+      260,  170,  171,  175,  171,  168,  173,  264,  261,  253,
+      184,  185,  288,  246,  246,  189,  193,  195,  197,  199,
+      205,  218,  209,  288,  210,    0,  255,  242,  245,  246,
+      248,  245,  249,  231,  228,  217,  211,  200,  184,  181,
+
+      172,  150,  138,  138,  128,  126,  106,   75,   66,   67,
+       45,   45,   36,   42,   39,   22,   26,  219,  211,    6,
+      220,  227,  228,  232,  237,  238,  242,  288,  247,  250,
+      253,  256,  259,  262,    7,    6,    0
+    } ;
+
+static yyconst flex_int16_t yy_def[138] =
+    {   0,
+      129,  129,  130,  130,  131,  131,  132,  132,  133,  133,
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+      134,  128,  134,  134,  135,  128,  135,  136,  128,  136,
+      136,  137,  128,  137,  128,  128,  128,  128,  128,  128,
+      128,  128,  128,  134,  128,  134,  134,  135,  128,  136,
+      128,  136,  136,  136,  137,  128,  137,  128,  128,  128,
+      128,  128,  134,  134,  136,  136,  136,  128,  128,  128,
+      134,  134,  128,  128,  128,  134,  134,  128,  128,  134,
+      128,  128,  128,  128,  128,   82,  128,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128,    0,  128,  128,
+      128,  128,  128,  128,  128,  128,  128
+    } ;
+
+static yyconst flex_int16_t yy_nxt[318] =
+    {   0,
+       55,   13,   14,   15,   13,   35,   50,   48,   35,   16,
+       16,   37,   37,  128,   38,   17,   42,   18,  128,   42,
+       19,   39,   20,   13,   14,   15,   13,   43,   52,   52,
+       45,   16,   16,   45,  125,   49,  121,   17,   49,   18,
+       45,  120,   19,   45,   20,   12,   14,   15,   22,  119,
+       22,   45,   46,   51,   45,   56,   51,  118,   56,   23,
+       57,   57,  117,   47,   24,   12,   14,   15,   22,  116,
+       22,  115,   53,   52,   52,   35,   37,   37,   35,   23,
+       54,   65,   65,  114,   24,   26,   14,   15,   26,   59,
+       12,  113,   59,   27,   27,   26,   14,   15,   26,   62,
+
+       12,  112,   62,   27,   27,   29,   14,   15,   29,   45,
+       12,   30,   45,   31,   31,   29,   14,   15,   29,   45,
+       12,   30,   45,   31,   31,   33,   14,   15,   33,   45,
+       12,  111,   45,   34,   34,   33,   14,   15,   33,   42,
+       12,  110,   42,   34,   34,   45,   49,  109,   45,   49,
+       43,  108,   51,   56,   63,   51,   56,  107,   64,   53,
+       52,   52,   57,   57,   66,  106,   66,   54,   67,   67,
+       59,   62,   45,   59,   62,   45,   45,   67,   67,   45,
+       65,   65,   67,   67,   71,   45,   45,   54,   45,   45,
+       45,   72,  105,   45,   45,   76,   81,   45,   83,   81,
+
+       85,   83,  104,   85,  103,   77,   81,   82,   84,   81,
+       83,   85,  124,   83,   85,  124,  102,   82,   80,   86,
+      122,  126,   86,  122,  126,   90,   90,  101,  122,  122,
+      123,  122,  122,  124,   87,   88,  124,  100,  127,  126,
+       89,  127,  126,  127,   99,   98,  127,   12,   12,   12,
+       21,   21,   21,   25,   25,   25,   28,   28,   28,   32,
+       32,   32,   44,   44,   97,   96,   95,   94,   93,   92,
+       91,   79,   78,   75,   74,   73,   70,   69,   68,   61,
+       60,   58,   41,   40,   36,   36,  128,   11,  128,  128,
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128
+    } ;
+
+static yyconst flex_int16_t yy_chk[318] =
+    {   0,
+      137,    1,    1,    1,    1,   13,  136,  135,   13,    1,
+        1,   16,   16,    0,   17,    1,   20,    1,    0,   20,
+        1,   17,    1,    2,    2,    2,    2,   20,   30,   30,
+       21,    2,    2,   21,  120,   27,  117,    2,   27,    2,
+       23,  116,    2,   23,    2,    3,    3,    3,    3,  115,
+        3,   24,   23,   29,   24,   33,   29,  114,   33,    3,
+       34,   34,  113,   24,    3,    4,    4,    4,    4,  112,
+        4,  111,   31,   31,   31,   35,   37,   37,   35,    4,
+       31,   53,   53,  110,    4,    5,    5,    5,    5,   39,
+        5,  109,   39,    5,    5,    6,    6,    6,    6,   43,
+
+        6,  108,   43,    6,    6,    7,    7,    7,    7,   44,
+        7,    7,   44,    7,    7,    8,    8,    8,    8,   45,
+        8,    8,   45,    8,    8,    9,    9,    9,    9,   46,
+        9,  107,   46,    9,    9,   10,   10,   10,   10,   42,
+       10,  106,   42,   10,   10,   47,   49,  105,   47,   49,
+       42,  104,   51,   56,   46,   51,   56,  103,   47,   52,
+       52,   52,   57,   57,   54,  102,   54,   52,   54,   54,
+       59,   62,   63,   59,   62,   63,   64,   66,   66,   64,
+       65,   65,   67,   67,   63,   71,   72,   65,   71,   72,
+       76,   64,  101,   76,   77,   71,   78,   77,   79,   78,
+
+       80,   79,  100,   80,   99,   72,   81,   78,   79,   81,
+       83,   85,  119,   83,   85,  119,   98,   81,   77,   82,
+      118,  121,   82,  118,  121,   83,   85,   97,  122,  123,
+      118,  122,  123,  124,   82,   82,  124,   96,  125,  126,
+       82,  125,  126,  127,   95,   94,  127,  129,  129,  129,
+      130,  130,  130,  131,  131,  131,  132,  132,  132,  133,
+      133,  133,  134,  134,   93,   92,   91,   90,   89,   88,
+       87,   75,   74,   70,   69,   68,   61,   60,   58,   41,
+       40,   38,   19,   18,   15,   14,   11,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+
+      128,  128,  128,  128,  128,  128,  128,  128,  128,  128,
+      128,  128,  128,  128,  128,  128,  128
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "foreign-dl-lexer.l"
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#line 24 "foreign-dl-lexer.l"
+
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include <stdlib.h>
+#include <stdarg.h>
+#include "foreign-dl-header.h"
+#include "foreign-dl-parser.h"
+#define YY_EXTRA_TYPE igraph_i_dl_parsedata_t*
+#define YY_USER_ACTION yylloc->first_line = yylineno;
+/* We assume that 'file' is 'stderr' here. */
+#define fprintf(file, msg, ...) \
+  igraph_warningf(msg, __FILE__, __LINE__, 0, __VA_ARGS__)
+#ifdef stdout 
+#  undef stdout
+#endif
+#define stdout 0
+#define exit(code) igraph_error("Fatal error in DL parser", __FILE__, \
+				__LINE__, IGRAPH_PARSEERROR);
+#define YY_NO_INPUT 1
+
+#line 613 "foreign-dl-lexer.c"
+
+#define INITIAL 0
+#define LABELM 1
+#define FULLMATRIX 2
+#define EDGELIST 3
+#define NODELIST 4
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    YYSTYPE * yylval_r;
+
+    YYLTYPE * yylloc_r;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals (yyscan_t yyscanner );
+
+    /* This must go here because YYSTYPE and YYLTYPE are included
+     * from bison output in section 1.*/
+    #    define yylval yyg->yylval_r
+    
+    #    define yylloc yyg->yylloc_r
+    
+int igraph_dl_yylex_init (yyscan_t* scanner);
+
+int igraph_dl_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int igraph_dl_yylex_destroy (yyscan_t yyscanner );
+
+int igraph_dl_yyget_debug (yyscan_t yyscanner );
+
+void igraph_dl_yyset_debug (int debug_flag ,yyscan_t yyscanner );
+
+YY_EXTRA_TYPE igraph_dl_yyget_extra (yyscan_t yyscanner );
+
+void igraph_dl_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
+
+FILE *igraph_dl_yyget_in (yyscan_t yyscanner );
+
+void igraph_dl_yyset_in  (FILE * in_str ,yyscan_t yyscanner );
+
+FILE *igraph_dl_yyget_out (yyscan_t yyscanner );
+
+void igraph_dl_yyset_out  (FILE * out_str ,yyscan_t yyscanner );
+
+int igraph_dl_yyget_leng (yyscan_t yyscanner );
+
+char *igraph_dl_yyget_text (yyscan_t yyscanner );
+
+int igraph_dl_yyget_lineno (yyscan_t yyscanner );
+
+void igraph_dl_yyset_lineno (int line_number ,yyscan_t yyscanner );
+
+YYSTYPE * igraph_dl_yyget_lval (yyscan_t yyscanner );
+
+void igraph_dl_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner );
+
+       YYLTYPE *igraph_dl_yyget_lloc (yyscan_t yyscanner );
+    
+        void igraph_dl_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner );
+    
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int igraph_dl_yywrap (yyscan_t yyscanner );
+#else
+extern int igraph_dl_yywrap (yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (yyscan_t yyscanner );
+#else
+static int input (yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		size_t n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int igraph_dl_yylex \
+               (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner);
+
+#define YY_DECL int igraph_dl_yylex \
+               (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp, *yy_bp;
+	register int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+#line 79 "foreign-dl-lexer.l"
+
+
+#line 864 "foreign-dl-lexer.c"
+
+    yylval = yylval_param;
+
+    yylloc = yylloc_param;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			igraph_dl_yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				igraph_dl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+		}
+
+		igraph_dl_yy_load_buffer_state(yyscanner );
+		}
+
+	while ( 1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 129 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 288 );
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+		if ( yy_act == 0 )
+			{ /* have to back up */
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			yy_act = yy_accept[yy_current_state];
+			}
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+/* rule 1 can match eol */
+YY_RULE_SETUP
+#line 81 "foreign-dl-lexer.l"
+{ return NEWLINE; }
+	YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 83 "foreign-dl-lexer.l"
+{ return DL; }
+	YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 84 "foreign-dl-lexer.l"
+{
+  return NEQ; }
+	YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 86 "foreign-dl-lexer.l"
+{ return NUM; }
+	YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 88 "foreign-dl-lexer.l"
+{ 
+  switch (yyextra->mode) { 
+  case 0: BEGIN(FULLMATRIX); 
+    break;
+  case 1: BEGIN(EDGELIST);
+    break;
+  case 2: BEGIN(NODELIST);
+    break;
+  } 
+  return DATA; }
+	YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 99 "foreign-dl-lexer.l"
+{ BEGIN(LABELM); return LABELS; }
+	YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 100 "foreign-dl-lexer.l"
+{
+  return LABELSEMBEDDED; }
+	YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 102 "foreign-dl-lexer.l"
+{
+  yyextra->mode=0; return FORMATFULLMATRIX; }
+	YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 104 "foreign-dl-lexer.l"
+{
+  yyextra->mode=1; return FORMATEDGELIST1; }
+	YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 106 "foreign-dl-lexer.l"
+{
+  yyextra->mode=2; return FORMATNODELIST1; }
+	YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 109 "foreign-dl-lexer.l"
+{ /* eaten up */ }
+	YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 110 "foreign-dl-lexer.l"
+{ return LABEL; }
+	YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 112 "foreign-dl-lexer.l"
+{ return DIGIT; }
+	YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 113 "foreign-dl-lexer.l"
+{ return LABEL; }
+	YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 114 "foreign-dl-lexer.l"
+{ }
+	YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 116 "foreign-dl-lexer.l"
+{ return NUM; }
+	YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 117 "foreign-dl-lexer.l"
+{ return LABEL; }
+	YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 118 "foreign-dl-lexer.l"
+{ }
+	YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 120 "foreign-dl-lexer.l"
+{ return NUM; }
+	YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 121 "foreign-dl-lexer.l"
+{ return LABEL; }
+	YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 122 "foreign-dl-lexer.l"
+{ }
+	YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 124 "foreign-dl-lexer.l"
+{ /* eaten up */ }
+	YY_BREAK
+case YY_STATE_EOF(INITIAL):
+case YY_STATE_EOF(LABELM):
+case YY_STATE_EOF(FULLMATRIX):
+case YY_STATE_EOF(EDGELIST):
+case YY_STATE_EOF(NODELIST):
+#line 126 "foreign-dl-lexer.l"
+{ 
+                          if (yyextra->eof) {
+			    yyterminate();
+			  } else {
+			    yyextra->eof=1;
+			    BEGIN(INITIAL);
+			    return EOFF;
+			  }			  
+                        }
+	YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 136 "foreign-dl-lexer.l"
+{ return 0; }
+	YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 138 "foreign-dl-lexer.l"
+ECHO;
+	YY_BREAK
+#line 1102 "foreign-dl-lexer.c"
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * igraph_dl_yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_c_buf_p;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( igraph_dl_yywrap(yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+} /* end of igraph_dl_yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	register char *source = yyg->yytext_ptr;
+	register int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1;
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					igraph_dl_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = 0;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, (size_t) num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			igraph_dl_yyrestart(yyin  ,yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) igraph_dl_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 129 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	register int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	register char *yy_cp = yyg->yy_c_buf_p;
+
+	register YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 129 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	yy_is_jam = (yy_current_state == 128);
+
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					igraph_dl_yyrestart(yyin ,yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( igraph_dl_yywrap(yyscanner ) )
+						return EOF;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void igraph_dl_yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        igraph_dl_yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            igraph_dl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+	}
+
+	igraph_dl_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
+	igraph_dl_yy_load_buffer_state(yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_dl_yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		igraph_dl_yypop_buffer_state();
+	 *		igraph_dl_yypush_buffer_state(new_buffer);
+     */
+	igraph_dl_yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	igraph_dl_yy_load_buffer_state(yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (igraph_dl_yywrap()) processing, but the only time this flag
+	 * is looked at is after igraph_dl_yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void igraph_dl_yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE igraph_dl_yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) igraph_dl_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) igraph_dl_yyalloc(b->yy_buf_size + 2 ,yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	igraph_dl_yy_init_buffer(b,file ,yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with igraph_dl_yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void igraph_dl_yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		igraph_dl_yyfree((void *) b->yy_ch_buf ,yyscanner );
+
+	igraph_dl_yyfree((void *) b ,yyscanner );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+    
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a igraph_dl_yyrestart() or at EOF.
+ */
+    static void igraph_dl_yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	igraph_dl_yy_flush_buffer(b ,yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then igraph_dl_yy_init_buffer was _probably_
+     * called from igraph_dl_yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_dl_yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		igraph_dl_yy_load_buffer_state(yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_dl_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	igraph_dl_yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from igraph_dl_yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from igraph_dl_yy_switch_to_buffer. */
+	igraph_dl_yy_load_buffer_state(yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_dl_yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	igraph_dl_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		igraph_dl_yy_load_buffer_state(yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void igraph_dl_yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	int num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+		num_to_alloc = 1;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_dl_yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yyensure_buffer_stack()" );
+								  
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+				
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		int grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_dl_yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object. 
+ */
+YY_BUFFER_STATE igraph_dl_yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return 0;
+
+	b = (YY_BUFFER_STATE) igraph_dl_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yy_scan_buffer()" );
+
+	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = 0;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	igraph_dl_yy_switch_to_buffer(b ,yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to igraph_dl_yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       igraph_dl_yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE igraph_dl_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner)
+{
+    
+	return igraph_dl_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to igraph_dl_yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE igraph_dl_yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = _yybytes_len + 2;
+	buf = (char *) igraph_dl_yyalloc(n ,yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_dl_yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = igraph_dl_yy_scan_buffer(buf,n ,yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in igraph_dl_yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner)
+{
+    	(void) fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE igraph_dl_yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_dl_yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_dl_yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_dl_yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_dl_yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int igraph_dl_yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *igraph_dl_yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void igraph_dl_yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_dl_yyset_lineno (int  line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_dl_yyset_lineno called with no buffer" , yyscanner); 
+    
+    yylineno = line_number;
+}
+
+/** Set the current column.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_dl_yyset_column (int  column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_dl_yyset_column called with no buffer" , yyscanner); 
+    
+    yycolumn = column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see igraph_dl_yy_switch_to_buffer
+ */
+void igraph_dl_yyset_in (FILE *  in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = in_str ;
+}
+
+void igraph_dl_yyset_out (FILE *  out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = out_str ;
+}
+
+int igraph_dl_yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void igraph_dl_yyset_debug (int  bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+YYSTYPE * igraph_dl_yyget_lval  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylval;
+}
+
+void igraph_dl_yyset_lval (YYSTYPE *  yylval_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylval = yylval_param;
+}
+
+YYLTYPE *igraph_dl_yyget_lloc  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylloc;
+}
+    
+void igraph_dl_yyset_lloc (YYLTYPE *  yylloc_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylloc = yylloc_param;
+}
+    
+/* User-visible API */
+
+/* igraph_dl_yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+
+int igraph_dl_yylex_init(yyscan_t* ptr_yy_globals)
+
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) igraph_dl_yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* igraph_dl_yylex_init_extra has the same functionality as igraph_dl_yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to igraph_dl_yyalloc in
+ * the yyextra field.
+ */
+
+int igraph_dl_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
+
+{
+    struct yyguts_t dummy_yyguts;
+
+    igraph_dl_yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+	
+    *ptr_yy_globals = (yyscan_t) igraph_dl_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+	
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+    
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+    
+    igraph_dl_yyset_extra (yy_user_defined, *ptr_yy_globals);
+    
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from igraph_dl_yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = 0;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = (char *) 0;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = (FILE *) 0;
+    yyout = (FILE *) 0;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * igraph_dl_yylex_init()
+     */
+    return 0;
+}
+
+/* igraph_dl_yylex_destroy is for both reentrant and non-reentrant scanners. */
+int igraph_dl_yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		igraph_dl_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		igraph_dl_yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	igraph_dl_yyfree(yyg->yy_buffer_stack ,yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        igraph_dl_yyfree(yyg->yy_start_stack ,yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * igraph_dl_yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    igraph_dl_yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
+{
+	register int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner)
+{
+	register int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *igraph_dl_yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	return (void *) malloc( size );
+}
+
+void *igraph_dl_yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return (void *) realloc( (char *) ptr, size );
+}
+
+void igraph_dl_yyfree (void * ptr , yyscan_t yyscanner)
+{
+	free( (char *) ptr );	/* see igraph_dl_yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 138 "foreign-dl-lexer.l"
diff -Nru igraph-0.6.5~quantal1/src/foreign-dl-parser.c igraph-0.6.5/src/foreign-dl-parser.c
--- igraph-0.6.5~quantal1/src/foreign-dl-parser.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-dl-parser.c	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,2336 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison implementation for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "2.5"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 1
+
+/* Substitute the variable and function names.  */
+#define yyparse         igraph_dl_yyparse
+#define yylex           igraph_dl_yylex
+#define yyerror         igraph_dl_yyerror
+#define yylval          igraph_dl_yylval
+#define yychar          igraph_dl_yychar
+#define yydebug         igraph_dl_yydebug
+#define yynerrs         igraph_dl_yynerrs
+#define yylloc          igraph_dl_yylloc
+
+/* Copy the first part of user declarations.  */
+
+/* Line 268 of yacc.c  */
+#line 23 "foreign-dl-parser.y"
+
+
+/* 
+   IGraph library.
+   Copyright (C) 2009-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include "igraph_hacks_internal.h"
+#include "igraph_math.h"
+#include "igraph_types_internal.h"
+#include "foreign-dl-header.h"
+#include "foreign-dl-parser.h"
+#include <stdio.h>
+
+#define yyscan_t void*
+
+int igraph_dl_yylex(YYSTYPE* lvalp, YYLTYPE* llocp, void* scanner);
+int igraph_dl_yyerror(YYLTYPE* locp, igraph_i_dl_parsedata_t* context, 
+		      const char *s);
+char *igraph_dl_yyget_text (yyscan_t yyscanner );
+int igraph_dl_yyget_leng (yyscan_t yyscanner );
+
+int igraph_i_dl_add_str(char *newstr, int length, 
+			igraph_i_dl_parsedata_t *context);
+int igraph_i_dl_add_edge(long int from, long int to,
+			 igraph_i_dl_parsedata_t *context);
+int igraph_i_dl_add_edge_w(long int from, long int to, 
+			   igraph_real_t weight,
+			   igraph_i_dl_parsedata_t *context);
+
+extern igraph_real_t igraph_pajek_get_number(const char *str, long int len);
+
+#define scanner context->scanner
+ 
+
+
+/* Line 268 of yacc.c  */
+#line 134 "foreign-dl-parser.c"
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 1
+#endif
+
+/* Enabling the token table.  */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     NUM = 258,
+     NEWLINE = 259,
+     DL = 260,
+     NEQ = 261,
+     DATA = 262,
+     LABELS = 263,
+     LABELSEMBEDDED = 264,
+     FORMATFULLMATRIX = 265,
+     FORMATEDGELIST1 = 266,
+     FORMATNODELIST1 = 267,
+     DIGIT = 268,
+     LABEL = 269,
+     EOFF = 270
+   };
+#endif
+/* Tokens.  */
+#define NUM 258
+#define NEWLINE 259
+#define DL 260
+#define NEQ 261
+#define DATA 262
+#define LABELS 263
+#define LABELSEMBEDDED 264
+#define FORMATFULLMATRIX 265
+#define FORMATEDGELIST1 266
+#define FORMATNODELIST1 267
+#define DIGIT 268
+#define LABEL 269
+#define EOFF 270
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 293 of yacc.c  */
+#line 86 "foreign-dl-parser.y"
+
+  long int integer;
+  igraph_real_t real;
+
+
+
+/* Line 293 of yacc.c  */
+#line 207 "foreign-dl-parser.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+/* Copy the second part of user declarations.  */
+
+
+/* Line 343 of yacc.c  */
+#line 232 "foreign-dl-parser.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(msgid) dgettext ("bison-runtime", msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions.  */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+    int yyi;
+#endif
+{
+  return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+	     && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+	 || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
+	     && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+  YYLTYPE yyls_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+      + 2 * YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)				\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack_alloc, Stack, yysize);			\
+	Stack = &yyptr->Stack_alloc;					\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (YYID (0))
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  YYSIZE_T yyi;				\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (YYID (0))
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  4
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   118
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  16
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  37
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  66
+/* YYNRULES -- Number of states.  */
+#define YYNSTATES  137
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   270
+
+#define YYTRANSLATE(YYX)						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,
+      15
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const yytype_uint8 yyprhs[] =
+{
+       0,     0,     3,    11,    12,    15,    16,    18,    20,    22,
+      24,    28,    30,    31,    33,    37,    45,    51,    52,    56,
+      57,    61,    62,    65,    67,    69,    73,    74,    78,    80,
+      82,    85,    89,    93,    96,   104,   110,   120,   130,   131,
+     134,   139,   143,   145,   146,   149,   154,   158,   160,   162,
+     166,   169,   177,   183,   193,   203,   204,   207,   211,   213,
+     214,   217,   218,   221,   225,   227,   228
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS.  */
+static const yytype_int8 yyrhs[] =
+{
+      17,     0,    -1,     5,     6,    38,     4,    20,    18,    19,
+      -1,    -1,    18,    22,    -1,    -1,    15,    -1,    21,    -1,
+      34,    -1,    43,    -1,    10,    22,    23,    -1,    23,    -1,
+      -1,     4,    -1,     7,    22,    25,    -1,     8,    22,    24,
+      22,     7,    22,    25,    -1,     9,    22,     7,    22,    28,
+      -1,    -1,    24,    22,    14,    -1,    -1,    25,    26,     4,
+      -1,    -1,    26,    27,    -1,    13,    -1,    29,    -1,    30,
+       4,    32,    -1,    -1,    30,    22,    31,    -1,    14,    -1,
+      33,    -1,    32,    33,    -1,    14,    26,     4,    -1,    11,
+      22,    35,    -1,     7,    36,    -1,     8,    22,    24,    22,
+       7,    22,    36,    -1,     9,    22,     7,    22,    39,    -1,
+       8,    22,    24,    22,     9,    22,     7,    22,    39,    -1,
+       9,    22,     8,    22,    24,    22,     7,    22,    39,    -1,
+      -1,    36,    37,    -1,    38,    38,    41,     4,    -1,    38,
+      38,     4,    -1,     3,    -1,    -1,    39,    40,    -1,    42,
+      42,    41,     4,    -1,    42,    42,     4,    -1,     3,    -1,
+      14,    -1,    12,    22,    44,    -1,     7,    45,    -1,     8,
+      22,    24,    22,     7,    22,    45,    -1,     9,    22,     7,
+      22,    49,    -1,     8,    22,    24,    22,     9,    22,     7,
+      22,    49,    -1,     9,    22,     8,    22,    24,    22,     7,
+      22,    49,    -1,    -1,    45,    46,    -1,    47,    48,     4,
+      -1,     3,    -1,    -1,    48,    38,    -1,    -1,    49,    50,
+      -1,    51,    52,     4,    -1,    42,    -1,    -1,    52,    42,
+      -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const yytype_uint16 yyrline[] =
+{
+       0,   110,   110,   112,   112,   114,   114,   116,   117,   118,
+     121,   121,   123,   123,   125,   126,   127,   130,   131,   137,
+     137,   142,   142,   144,   154,   156,   158,   158,   160,   164,
+     168,   173,   177,   179,   180,   181,   182,   183,   186,   187,
+     190,   192,   196,   199,   200,   203,   205,   209,   212,   228,
+     230,   231,   232,   233,   234,   237,   238,   241,   243,   246,
+     246,   252,   253,   256,   258,   262,   262
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "NUM", "NEWLINE", "DL", "NEQ", "DATA",
+  "LABELS", "LABELSEMBEDDED", "FORMATFULLMATRIX", "FORMATEDGELIST1",
+  "FORMATNODELIST1", "DIGIT", "LABEL", "EOFF", "$accept", "input", "trail",
+  "eof", "rest", "formfullmatrix", "newline", "fullmatrix", "labels",
+  "fullmatrixdata", "zerooneseq", "zeroone", "labeledfullmatrixdata",
+  "reallabeledfullmatrixdata", "labelseq", "label", "labeledmatrixlines",
+  "labeledmatrixline", "edgelist1", "edgelist1rest", "edgelist1data",
+  "edgelist1dataline", "integer", "labelededgelist1data",
+  "labelededgelist1dataline", "weight", "elabel", "nodelist1",
+  "nodelist1rest", "nodelist1data", "nodelist1dataline", "from", "tolist",
+  "labelednodelist1data", "labelednodelist1dataline", "fromelabel",
+  "labeltolist", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
+     265,   266,   267,   268,   269,   270
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,    16,    17,    18,    18,    19,    19,    20,    20,    20,
+      21,    21,    22,    22,    23,    23,    23,    24,    24,    25,
+      25,    26,    26,    27,    28,    29,    30,    30,    31,    32,
+      32,    33,    34,    35,    35,    35,    35,    35,    36,    36,
+      37,    37,    38,    39,    39,    40,    40,    41,    42,    43,
+      44,    44,    44,    44,    44,    45,    45,    46,    47,    48,
+      48,    49,    49,    50,    51,    52,    52
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     7,     0,     2,     0,     1,     1,     1,     1,
+       3,     1,     0,     1,     3,     7,     5,     0,     3,     0,
+       3,     0,     2,     1,     1,     3,     0,     3,     1,     1,
+       2,     3,     3,     2,     7,     5,     9,     9,     0,     2,
+       4,     3,     1,     0,     2,     4,     3,     1,     1,     3,
+       2,     7,     5,     9,     9,     0,     2,     3,     1,     0,
+       2,     0,     2,     3,     1,     0,     2
+};
+
+/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
+   Performed when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       0,     0,     0,     0,     1,    42,     0,     0,    12,    12,
+      12,    12,    12,    12,     3,     7,    11,     8,     9,    13,
+      19,    17,     0,     0,     0,     0,     5,    14,    12,    12,
+      10,    38,    12,    12,    32,    55,    12,    12,    49,     6,
+       2,     4,     0,     0,    26,    33,    17,     0,    50,    17,
+       0,    20,    23,    22,    12,    18,    16,    24,    12,    39,
+       0,    12,    12,    12,    58,    56,    59,    12,    12,    12,
+      19,     0,     0,     0,     0,    43,    17,     0,     0,    61,
+      17,    15,    21,    25,    29,    28,    27,    47,    41,     0,
+      12,    12,    35,    12,    57,    60,    12,    12,    52,    12,
+       0,    30,    40,    38,     0,    48,    44,     0,     0,    55,
+       0,    64,    62,    65,     0,    31,    34,    12,     0,    12,
+      51,    12,     0,    12,    43,    46,     0,    43,    61,    63,
+      66,    61,    36,    45,    37,    53,    54
+};
+
+/* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int8 yydefgoto[] =
+{
+      -1,     2,    26,    40,    14,    15,    20,    16,    28,    27,
+      42,    53,    56,    57,    58,    86,    83,    84,    17,    34,
+      45,    59,    60,    92,   106,    89,   107,    18,    38,    48,
+      65,    66,    77,    98,   112,   113,   122
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -93
+static const yytype_int8 yypact[] =
+{
+      41,     3,    38,    47,   -93,   -93,    57,    56,    76,    76,
+      76,    76,    76,    76,   -93,   -93,   -93,   -93,   -93,   -93,
+     -93,   -93,    89,    48,    66,    69,     7,    70,    76,    76,
+     -93,   -93,    76,    76,   -93,   -93,    76,    76,   -93,   -93,
+     -93,   -93,     8,    19,   -93,    47,   -93,     6,    86,   -93,
+      63,   -93,   -93,   -93,    76,   -93,   -93,   -93,    91,   -93,
+      47,    76,    76,    76,   -93,   -93,   -93,    76,    76,    76,
+     -93,    83,    84,    82,    22,   -93,   -93,    88,    25,   -93,
+     -93,    70,   -93,    83,   -93,   -93,   -93,   -93,   -93,    95,
+      76,    76,    87,    76,   -93,   -93,    76,    76,    87,    76,
+      12,   -93,   -93,   -93,    93,   -93,   -93,    87,    28,   -93,
+      96,   -93,   -93,   -93,    33,   -93,    47,    76,    90,    76,
+      86,    76,     4,    76,   -93,   -93,    98,   -93,   -93,   -93,
+     -93,   -93,    87,   -93,    87,    87,    87
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yytype_int8 yypgoto[] =
+{
+     -93,   -93,   -93,   -93,   -93,   -93,    -9,    81,   -39,    35,
+      24,   -93,   -93,   -93,   -93,   -93,   -93,    26,   -93,   -93,
+      10,   -93,     2,   -76,   -93,   -11,   -92,   -93,   -93,     9,
+     -93,   -93,   -93,   -59,   -93,   -93,   -93
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -22
+static const yytype_int16 yytable[] =
+{
+      21,    22,    23,    24,    25,     6,   111,    61,   129,     3,
+      67,    19,    51,    62,    63,   118,   115,    41,   105,    43,
+      44,    52,    39,    46,    47,    52,    54,    49,    50,    90,
+     130,    91,    96,    55,    97,   119,    55,    93,     4,    55,
+     123,    99,    55,   111,   111,    70,     1,    55,   132,    72,
+       5,   134,    74,    75,    76,     8,     9,    10,    78,    79,
+      80,     7,    73,     8,     9,    10,    11,    12,    13,   135,
+      68,    69,   136,    31,    32,    33,    35,    36,    37,    95,
+      19,   103,   104,   -21,   108,    87,    88,   109,   110,    64,
+     114,     5,    94,    87,   125,    71,    29,    82,    85,   102,
+     117,   105,   133,   121,    30,    81,   100,   126,   124,   101,
+     127,     0,   128,   116,   131,     0,     0,     0,   120
+};
+
+#define yypact_value_is_default(yystate) \
+  ((yystate) == (-93))
+
+#define yytable_value_is_error(yytable_value) \
+  YYID (0)
+
+static const yytype_int16 yycheck[] =
+{
+       9,    10,    11,    12,    13,     3,    98,    46,     4,     6,
+      49,     4,     4,     7,     8,   107,     4,    26,    14,    28,
+      29,    13,    15,    32,    33,    13,     7,    36,    37,     7,
+     122,     9,     7,    14,     9,     7,    14,    76,     0,    14,
+       7,    80,    14,   135,   136,    54,     5,    14,   124,    58,
+       3,   127,    61,    62,    63,     7,     8,     9,    67,    68,
+      69,     4,    60,     7,     8,     9,    10,    11,    12,   128,
+       7,     8,   131,     7,     8,     9,     7,     8,     9,    77,
+       4,    90,    91,    13,    93,     3,     4,    96,    97,     3,
+      99,     3,     4,     3,     4,     4,     7,    14,    14,     4,
+       7,    14,     4,     7,    23,    70,    82,   118,   117,    83,
+     119,    -1,   121,   103,   123,    -1,    -1,    -1,   109
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,     5,    17,     6,     0,     3,    38,     4,     7,     8,
+       9,    10,    11,    12,    20,    21,    23,    34,    43,     4,
+      22,    22,    22,    22,    22,    22,    18,    25,    24,     7,
+      23,     7,     8,     9,    35,     7,     8,     9,    44,    15,
+      19,    22,    26,    22,    22,    36,    22,    22,    45,    22,
+      22,     4,    13,    27,     7,    14,    28,    29,    30,    37,
+      38,    24,     7,     8,     3,    46,    47,    24,     7,     8,
+      22,     4,    22,    38,    22,    22,    22,    48,    22,    22,
+      22,    25,    14,    32,    33,    14,    31,     3,     4,    41,
+       7,     9,    39,    24,     4,    38,     7,     9,    49,    24,
+      26,    33,     4,    22,    22,    14,    40,    42,    22,    22,
+      22,    42,    50,    51,    22,     4,    36,     7,    42,     7,
+      45,     7,    52,     7,    22,     4,    41,    22,    22,     4,
+      42,    22,    39,     4,    39,    49,    49
+};
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  However,
+   YYFAIL appears to be in use.  Nevertheless, it is formally deprecated
+   in Bison 2.4.2's NEWS entry, where a plan to phase it out is
+   discussed.  */
+
+#define YYFAIL		goto yyerrlab
+#if defined YYFAIL
+  /* This is here to suppress warnings from the GCC cpp's
+     -Wunused-macros.  Normally we don't worry about that warning, but
+     some users do, and we want to make it easy for users to remove
+     YYFAIL uses, which will produce warnings from Bison 2.5.  */
+#endif
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      YYPOPSTACK (1);						\
+      goto yybackup;						\
+    }								\
+  else								\
+    {								\
+      yyerror (&yylloc, context, YY_("syntax error: cannot back up")); \
+      YYERROR;							\
+    }								\
+while (YYID (0))
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (YYID (N))                                                    \
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+	      (Loc).first_line, (Loc).first_column,	\
+	      (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, &yylloc, scanner)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)			  \
+do {									  \
+  if (yydebug)								  \
+    {									  \
+      YYFPRINTF (stderr, "%s ", Title);					  \
+      yy_symbol_print (stderr,						  \
+		  Type, Value, Location, context); \
+      YYFPRINTF (stderr, "\n");						  \
+    }									  \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_dl_parsedata_t* context)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_dl_parsedata_t* context;
+#endif
+{
+  if (!yyvaluep)
+    return;
+  YYUSE (yylocationp);
+  YYUSE (context);
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+  YYUSE (yyoutput);
+# endif
+  switch (yytype)
+    {
+      default:
+	break;
+    }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_dl_parsedata_t* context)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_dl_parsedata_t* context;
+#endif
+{
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+  YY_LOCATION_PRINT (yyoutput, *yylocationp);
+  YYFPRINTF (yyoutput, ": ");
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+    yytype_int16 *yybottom;
+    yytype_int16 *yytop;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, igraph_i_dl_parsedata_t* context)
+#else
+static void
+yy_reduce_print (yyvsp, yylsp, yyrule, context)
+    YYSTYPE *yyvsp;
+    YYLTYPE *yylsp;
+    int yyrule;
+    igraph_i_dl_parsedata_t* context;
+#endif
+{
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  unsigned long int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+	     yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+		       &(yyvsp[(yyi + 1) - (yynrhs)])
+		       , &(yylsp[(yyi + 1) - (yynrhs)])		       , context);
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (yyvsp, yylsp, Rule, context); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+    const char *yystr;
+#endif
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+    char *yydest;
+    const char *yysrc;
+#endif
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+	switch (*++yyp)
+	  {
+	  case '\'':
+	  case ',':
+	    goto do_not_strip_quotes;
+
+	  case '\\':
+	    if (*++yyp != '\\')
+	      goto do_not_strip_quotes;
+	    /* Fall through.  */
+	  default:
+	    if (yyres)
+	      yyres[yyn] = *yyp;
+	    yyn++;
+	    break;
+
+	  case '"':
+	    if (yyres)
+	      yyres[yyn] = '\0';
+	    return yyn;
+	  }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  YYSIZE_T yysize1;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = 0;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - Assume YYFAIL is not used.  It's too flawed to consider.  See
+       <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
+       for details.  YYERROR is fine as it does not invoke this
+       function.
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+                if (! (yysize <= yysize1
+                       && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                  return 2;
+                yysize = yysize1;
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  yysize1 = yysize + yystrlen (yyformat);
+  if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+    return 2;
+  yysize = yysize1;
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, igraph_i_dl_parsedata_t* context)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep, yylocationp, context)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+    YYLTYPE *yylocationp;
+    igraph_i_dl_parsedata_t* context;
+#endif
+{
+  YYUSE (yyvaluep);
+  YYUSE (yylocationp);
+  YYUSE (context);
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+
+      default:
+	break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (igraph_i_dl_parsedata_t* context);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+    void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (igraph_i_dl_parsedata_t* context)
+#else
+int
+yyparse (context)
+    igraph_i_dl_parsedata_t* context;
+#endif
+#endif
+{
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+
+/* Location data for the lookahead symbol.  */
+YYLTYPE yylloc;
+
+    /* Number of syntax errors so far.  */
+    int yynerrs;
+
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       `yyss': related to states.
+       `yyvs': related to semantic values.
+       `yyls': related to locations.
+
+       Refer to the stacks thru separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    /* The location stack.  */
+    YYLTYPE yylsa[YYINITDEPTH];
+    YYLTYPE *yyls;
+    YYLTYPE *yylsp;
+
+    /* The locations where the error started and ended.  */
+    YYLTYPE yyerror_range[3];
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+  YYLTYPE yyloc;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yytoken = 0;
+  yyss = yyssa;
+  yyvs = yyvsa;
+  yyls = yylsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+  yyssp = yyss;
+  yyvsp = yyvs;
+  yylsp = yyls;
+
+#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+  /* Initialize the default location before parsing starts.  */
+  yylloc.first_line   = yylloc.last_line   = 1;
+  yylloc.first_column = yylloc.last_column = 1;
+#endif
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack.  Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	yytype_int16 *yyss1 = yyss;
+	YYLTYPE *yyls1 = yyls;
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow (YY_("memory exhausted"),
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+		    &yyls1, yysize * sizeof (*yylsp),
+		    &yystacksize);
+
+	yyls = yyls1;
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	yytype_int16 *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyexhaustedlab;
+	YYSTACK_RELOCATE (yyss_alloc, yyss);
+	YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+	YYSTACK_RELOCATE (yyls_alloc, yyls);
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+      yylsp = yyls + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  *++yyvsp = yylval;
+  *++yylsp = yylloc;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+  /* Default location.  */
+  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 2:
+
+/* Line 1806 of yacc.c  */
+#line 110 "foreign-dl-parser.y"
+    { context->n=(yyvsp[(3) - (7)].integer); }
+    break;
+
+  case 7:
+
+/* Line 1806 of yacc.c  */
+#line 116 "foreign-dl-parser.y"
+    { context->type=IGRAPH_DL_MATRIX; }
+    break;
+
+  case 8:
+
+/* Line 1806 of yacc.c  */
+#line 117 "foreign-dl-parser.y"
+    { context->type=IGRAPH_DL_EDGELIST1; }
+    break;
+
+  case 9:
+
+/* Line 1806 of yacc.c  */
+#line 118 "foreign-dl-parser.y"
+    { context->type=IGRAPH_DL_NODELIST1; }
+    break;
+
+  case 10:
+
+/* Line 1806 of yacc.c  */
+#line 121 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 11:
+
+/* Line 1806 of yacc.c  */
+#line 121 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 14:
+
+/* Line 1806 of yacc.c  */
+#line 125 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 15:
+
+/* Line 1806 of yacc.c  */
+#line 126 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 16:
+
+/* Line 1806 of yacc.c  */
+#line 127 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 17:
+
+/* Line 1806 of yacc.c  */
+#line 130 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 18:
+
+/* Line 1806 of yacc.c  */
+#line 131 "foreign-dl-parser.y"
+    { 
+	      igraph_i_dl_add_str(igraph_dl_yyget_text(scanner), 
+                                  igraph_dl_yyget_leng(scanner), 
+				  context); }
+    break;
+
+  case 19:
+
+/* Line 1806 of yacc.c  */
+#line 137 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 20:
+
+/* Line 1806 of yacc.c  */
+#line 137 "foreign-dl-parser.y"
+    {
+  context->from += 1;
+  context->to = 0;
+ }
+    break;
+
+  case 22:
+
+/* Line 1806 of yacc.c  */
+#line 142 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 23:
+
+/* Line 1806 of yacc.c  */
+#line 144 "foreign-dl-parser.y"
+    {
+  if (igraph_dl_yyget_text(scanner)[0]=='1') {
+    IGRAPH_CHECK(igraph_vector_push_back(&context->edges, 
+					 context->from));
+    IGRAPH_CHECK(igraph_vector_push_back(&context->edges, 
+					 context->to));
+  }
+  context->to += 1;
+}
+    break;
+
+  case 24:
+
+/* Line 1806 of yacc.c  */
+#line 154 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 25:
+
+/* Line 1806 of yacc.c  */
+#line 156 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 28:
+
+/* Line 1806 of yacc.c  */
+#line 160 "foreign-dl-parser.y"
+    { igraph_i_dl_add_str(igraph_dl_yyget_text(scanner), 
+                                   igraph_dl_yyget_leng(scanner), 
+				   context); }
+    break;
+
+  case 29:
+
+/* Line 1806 of yacc.c  */
+#line 164 "foreign-dl-parser.y"
+    {
+	         context->from += 1; 
+		 context->to = 0;
+               }
+    break;
+
+  case 30:
+
+/* Line 1806 of yacc.c  */
+#line 168 "foreign-dl-parser.y"
+    { 
+	         context->from += 1; 
+		 context->to = 0;
+               }
+    break;
+
+  case 31:
+
+/* Line 1806 of yacc.c  */
+#line 173 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 32:
+
+/* Line 1806 of yacc.c  */
+#line 177 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 33:
+
+/* Line 1806 of yacc.c  */
+#line 179 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 34:
+
+/* Line 1806 of yacc.c  */
+#line 180 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 35:
+
+/* Line 1806 of yacc.c  */
+#line 181 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 36:
+
+/* Line 1806 of yacc.c  */
+#line 182 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 37:
+
+/* Line 1806 of yacc.c  */
+#line 183 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 38:
+
+/* Line 1806 of yacc.c  */
+#line 186 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 39:
+
+/* Line 1806 of yacc.c  */
+#line 187 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 40:
+
+/* Line 1806 of yacc.c  */
+#line 190 "foreign-dl-parser.y"
+    {
+                   igraph_i_dl_add_edge_w((yyvsp[(1) - (4)].integer)-1, (yyvsp[(2) - (4)].integer)-1, (yyvsp[(3) - (4)].real), context); }
+    break;
+
+  case 41:
+
+/* Line 1806 of yacc.c  */
+#line 192 "foreign-dl-parser.y"
+    {
+		   igraph_i_dl_add_edge((yyvsp[(1) - (3)].integer)-1, (yyvsp[(2) - (3)].integer)-1, context);
+}
+    break;
+
+  case 42:
+
+/* Line 1806 of yacc.c  */
+#line 196 "foreign-dl-parser.y"
+    { (yyval.integer)=igraph_pajek_get_number(igraph_dl_yyget_text(scanner), 
+					  igraph_dl_yyget_leng(scanner)); }
+    break;
+
+  case 43:
+
+/* Line 1806 of yacc.c  */
+#line 199 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 44:
+
+/* Line 1806 of yacc.c  */
+#line 200 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 45:
+
+/* Line 1806 of yacc.c  */
+#line 203 "foreign-dl-parser.y"
+    {
+                          igraph_i_dl_add_edge_w((yyvsp[(1) - (4)].integer), (yyvsp[(2) - (4)].integer), (yyvsp[(3) - (4)].real), context); }
+    break;
+
+  case 46:
+
+/* Line 1806 of yacc.c  */
+#line 205 "foreign-dl-parser.y"
+    {
+			  igraph_i_dl_add_edge((yyvsp[(1) - (3)].integer), (yyvsp[(2) - (3)].integer), context);
+ }
+    break;
+
+  case 47:
+
+/* Line 1806 of yacc.c  */
+#line 209 "foreign-dl-parser.y"
+    { (yyval.real)=igraph_pajek_get_number(igraph_dl_yyget_text(scanner), 
+					 igraph_dl_yyget_leng(scanner)); }
+    break;
+
+  case 48:
+
+/* Line 1806 of yacc.c  */
+#line 212 "foreign-dl-parser.y"
+    {
+  /* Copy label list to trie, if needed */
+  if (igraph_strvector_size(&context->labels) != 0) {
+    long int i, id, n=igraph_strvector_size(&context->labels);
+    for (i=0; i<n; i++) {
+      igraph_trie_get(&context->trie,
+		      STR(context->labels, i), &id);
+    }
+    igraph_strvector_clear(&context->labels);
+  }
+  igraph_trie_get2(&context->trie, igraph_dl_yyget_text(scanner), 
+		   igraph_dl_yyget_leng(scanner), &(yyval.integer));
+ }
+    break;
+
+  case 49:
+
+/* Line 1806 of yacc.c  */
+#line 228 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 50:
+
+/* Line 1806 of yacc.c  */
+#line 230 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 51:
+
+/* Line 1806 of yacc.c  */
+#line 231 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 52:
+
+/* Line 1806 of yacc.c  */
+#line 232 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 53:
+
+/* Line 1806 of yacc.c  */
+#line 233 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 54:
+
+/* Line 1806 of yacc.c  */
+#line 234 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 55:
+
+/* Line 1806 of yacc.c  */
+#line 237 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 56:
+
+/* Line 1806 of yacc.c  */
+#line 238 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 57:
+
+/* Line 1806 of yacc.c  */
+#line 241 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 58:
+
+/* Line 1806 of yacc.c  */
+#line 243 "foreign-dl-parser.y"
+    { context->from=igraph_pajek_get_number(igraph_dl_yyget_text(scanner),
+							  igraph_dl_yyget_leng(scanner)); }
+    break;
+
+  case 59:
+
+/* Line 1806 of yacc.c  */
+#line 246 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 60:
+
+/* Line 1806 of yacc.c  */
+#line 246 "foreign-dl-parser.y"
+    { 
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, 
+				       context->from-1)); 
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, (yyvsp[(2) - (2)].integer)-1));
+ }
+    break;
+
+  case 61:
+
+/* Line 1806 of yacc.c  */
+#line 252 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 62:
+
+/* Line 1806 of yacc.c  */
+#line 253 "foreign-dl-parser.y"
+    {}
+    break;
+
+  case 63:
+
+/* Line 1806 of yacc.c  */
+#line 256 "foreign-dl-parser.y"
+    { }
+    break;
+
+  case 64:
+
+/* Line 1806 of yacc.c  */
+#line 258 "foreign-dl-parser.y"
+    {
+  context->from=(yyvsp[(1) - (1)].integer);
+ }
+    break;
+
+  case 66:
+
+/* Line 1806 of yacc.c  */
+#line 262 "foreign-dl-parser.y"
+    {
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, 
+				       context->from));
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, (yyvsp[(2) - (2)].integer)));
+ }
+    break;
+
+
+
+/* Line 1806 of yacc.c  */
+#line 2057 "foreign-dl-parser.c"
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+  *++yylsp = yyloc;
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (&yylloc, context, YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (&yylloc, context, yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+  yyerror_range[1] = yylloc;
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+	{
+	  /* Return failure if at end of input.  */
+	  if (yychar == YYEOF)
+	    YYABORT;
+	}
+      else
+	{
+	  yydestruct ("Error: discarding",
+		      yytoken, &yylval, &yylloc, context);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  yyerror_range[1] = yylsp[1-yylen];
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+      yyerror_range[1] = *yylsp;
+      yydestruct ("Error: popping",
+		  yystos[yystate], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  *++yyvsp = yylval;
+
+  yyerror_range[2] = yylloc;
+  /* Using YYLLOC is tempting, but would change the location of
+     the lookahead.  YYLOC is available though.  */
+  YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
+  *++yylsp = yyloc;
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (&yylloc, context, YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval, &yylloc, context);
+    }
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+		  yystos[*yyssp], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  /* Make sure YYID is used.  */
+  return YYID (yyresult);
+}
+
+
+
+/* Line 2067 of yacc.c  */
+#line 268 "foreign-dl-parser.y"
+
+
+int igraph_dl_yyerror(YYLTYPE* locp, igraph_i_dl_parsedata_t* context, 
+		      const char *s) {
+  snprintf(context->errmsg, 
+	   sizeof(context->errmsg)/sizeof(char)-1, 
+	   "%s in line %i", s, locp->first_line);
+  return 0;
+}
+
+int igraph_i_dl_add_str(char *newstr, int length, 
+			igraph_i_dl_parsedata_t *context) {
+  int tmp=newstr[length];
+  newstr[length]='\0';
+  IGRAPH_CHECK(igraph_strvector_add(&context->labels, newstr));
+  newstr[length]=tmp;
+  return 0;
+}
+
+int igraph_i_dl_add_edge(long int from, long int to, 
+			 igraph_i_dl_parsedata_t *context) {
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, from));
+  IGRAPH_CHECK(igraph_vector_push_back(&context->edges, to));
+  return 0;
+}
+
+int igraph_i_dl_add_edge_w(long int from, long int to, 
+			   igraph_real_t weight,
+			   igraph_i_dl_parsedata_t *context) {
+  long int n=igraph_vector_size(&context->weights);
+  long int n2=igraph_vector_size(&context->edges)/2;
+  if (n != n2) {
+    igraph_vector_resize(&context->weights, n2);
+    for (; n<n2; n++) {
+      VECTOR(context->weights)[n]=IGRAPH_NAN;
+    }
+  }
+  IGRAPH_CHECK(igraph_i_dl_add_edge(from, to, context));
+  IGRAPH_CHECK(igraph_vector_push_back(&context->weights, weight));
+  return 0;
+}
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-dl-parser.h igraph-0.6.5/src/foreign-dl-parser.h
--- igraph-0.6.5~quantal1/src/foreign-dl-parser.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-dl-parser.h	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,109 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison interface for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     NUM = 258,
+     NEWLINE = 259,
+     DL = 260,
+     NEQ = 261,
+     DATA = 262,
+     LABELS = 263,
+     LABELSEMBEDDED = 264,
+     FORMATFULLMATRIX = 265,
+     FORMATEDGELIST1 = 266,
+     FORMATNODELIST1 = 267,
+     DIGIT = 268,
+     LABEL = 269,
+     EOFF = 270
+   };
+#endif
+/* Tokens.  */
+#define NUM 258
+#define NEWLINE 259
+#define DL 260
+#define NEQ 261
+#define DATA 262
+#define LABELS 263
+#define LABELSEMBEDDED 264
+#define FORMATFULLMATRIX 265
+#define FORMATEDGELIST1 266
+#define FORMATNODELIST1 267
+#define DIGIT 268
+#define LABEL 269
+#define EOFF 270
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 2068 of yacc.c  */
+#line 86 "foreign-dl-parser.y"
+
+  long int integer;
+  igraph_real_t real;
+
+
+
+/* Line 2068 of yacc.c  */
+#line 87 "foreign-dl-parser.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-gml-lexer.c igraph-0.6.5/src/foreign-gml-lexer.c
--- igraph-0.6.5~quantal1/src/foreign-gml-lexer.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-gml-lexer.c	2013-03-03 01:30:30.000000000 +0000
@@ -0,0 +1,2063 @@
+#line 2 "foreign-gml-lexer.c"
+
+#line 4 "foreign-gml-lexer.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else	/* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif	/* defined (__STDC__) */
+#endif	/* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE igraph_gml_yyrestart(yyin ,yyscanner )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+    #define YY_LESS_LINENO(n)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	yy_size_t yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+    
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via igraph_gml_yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void igraph_gml_yyrestart (FILE *input_file ,yyscan_t yyscanner );
+void igraph_gml_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_gml_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner );
+void igraph_gml_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_gml_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_gml_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+void igraph_gml_yypop_buffer_state (yyscan_t yyscanner );
+
+static void igraph_gml_yyensure_buffer_stack (yyscan_t yyscanner );
+static void igraph_gml_yy_load_buffer_state (yyscan_t yyscanner );
+static void igraph_gml_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
+
+#define YY_FLUSH_BUFFER igraph_gml_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
+
+YY_BUFFER_STATE igraph_gml_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_gml_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_gml_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner );
+
+void *igraph_gml_yyalloc (yy_size_t ,yyscan_t yyscanner );
+void *igraph_gml_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner );
+void igraph_gml_yyfree (void * ,yyscan_t yyscanner );
+
+#define yy_new_buffer igraph_gml_yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        igraph_gml_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_gml_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        igraph_gml_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_gml_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define igraph_gml_yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state  ,yyscan_t yyscanner);
+static int yy_get_next_buffer (yyscan_t yyscanner );
+static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (size_t) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 9
+#define YY_END_OF_BUFFER 10
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static yyconst flex_int16_t yy_accept[29] =
+    {   0,
+        0,    0,   10,    9,    8,    7,    7,    9,    9,    3,
+        4,    5,    6,    1,    9,    7,    0,    2,    3,    0,
+        0,    4,    0,    1,    3,    0,    3,    0
+    } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        1,    1,    4,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    2,    1,    5,    6,    1,    1,    1,    1,    1,
+        1,    1,    7,    1,    8,    9,    1,   10,   10,   10,
+       10,   10,   10,   10,   10,   10,   10,    1,    1,    1,
+        1,    1,    1,    1,   11,   11,   11,   11,   12,   11,
+       11,   11,   11,   11,   11,   11,   11,   11,   11,   11,
+       11,   11,   11,   11,   11,   11,   11,   11,   11,   11,
+       13,    1,   14,    1,   11,    1,   11,   11,   11,   11,
+
+       12,   11,   11,   11,   11,   11,   11,   11,   11,   11,
+       11,   11,   11,   11,   11,   11,   11,   11,   11,   11,
+       11,   11,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int32_t yy_meta[15] =
+    {   0,
+        1,    1,    1,    2,    1,    1,    1,    1,    1,    3,
+        3,    3,    1,    1
+    } ;
+
+static yyconst flex_int16_t yy_base[32] =
+    {   0,
+        0,   11,   42,   43,   43,   37,   37,   34,   28,    9,
+        0,   43,   43,   34,   33,   43,   30,   43,    0,   24,
+       15,    0,   30,   43,   14,   21,   10,   43,   26,   13,
+       29
+    } ;
+
+static yyconst flex_int16_t yy_def[32] =
+    {   0,
+       28,    1,   28,   28,   28,   28,   28,   29,   28,   28,
+       30,   28,   28,   28,   31,   28,   29,   28,   10,   28,
+       28,   30,   31,   28,   28,   28,   28,    0,   28,   28,
+       28
+    } ;
+
+static yyconst flex_int16_t yy_nxt[58] =
+    {   0,
+        4,    5,    6,    7,    8,    4,    4,    9,    4,   10,
+       11,   11,   12,   13,   14,   22,   15,   20,   19,   27,
+       21,   26,   26,   25,   27,   21,   17,   17,   17,   23,
+       27,   23,   24,   25,   18,   24,   16,   19,   18,   16,
+       16,   28,    3,   28,   28,   28,   28,   28,   28,   28,
+       28,   28,   28,   28,   28,   28,   28
+    } ;
+
+static yyconst flex_int16_t yy_chk[58] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    2,   30,    2,   10,   10,   27,
+       10,   21,   21,   25,   21,   25,   29,   29,   29,   31,
+       26,   31,   23,   20,   17,   15,   14,    9,    8,    7,
+        6,    3,   28,   28,   28,   28,   28,   28,   28,   28,
+       28,   28,   28,   28,   28,   28,   28
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "foreign-gml-lexer.l"
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#line 24 "foreign-gml-lexer.l"
+
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include <stdlib.h>
+#include "foreign-gml-header.h"
+#include "foreign-gml-parser.h"
+#define YY_EXTRA_TYPE igraph_i_gml_parsedata_t*
+#define YY_USER_ACTION yylloc->first_line = yylineno;
+/* We assume that 'file' is 'stderr' here. */
+#define fprintf(file, msg, ...) \
+  igraph_warningf(msg, __FILE__, __LINE__, 0, __VA_ARGS__)
+#ifdef stdout 
+#  undef stdout
+#endif
+#define stdout 0
+#define exit(code) igraph_error("Fatal error in DL parser", __FILE__, \
+				__LINE__, IGRAPH_PARSEERROR);
+#define YY_NO_INPUT 1
+#line 521 "foreign-gml-lexer.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    YYSTYPE * yylval_r;
+
+    YYLTYPE * yylloc_r;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals (yyscan_t yyscanner );
+
+    /* This must go here because YYSTYPE and YYLTYPE are included
+     * from bison output in section 1.*/
+    #    define yylval yyg->yylval_r
+    
+    #    define yylloc yyg->yylloc_r
+    
+int igraph_gml_yylex_init (yyscan_t* scanner);
+
+int igraph_gml_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int igraph_gml_yylex_destroy (yyscan_t yyscanner );
+
+int igraph_gml_yyget_debug (yyscan_t yyscanner );
+
+void igraph_gml_yyset_debug (int debug_flag ,yyscan_t yyscanner );
+
+YY_EXTRA_TYPE igraph_gml_yyget_extra (yyscan_t yyscanner );
+
+void igraph_gml_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
+
+FILE *igraph_gml_yyget_in (yyscan_t yyscanner );
+
+void igraph_gml_yyset_in  (FILE * in_str ,yyscan_t yyscanner );
+
+FILE *igraph_gml_yyget_out (yyscan_t yyscanner );
+
+void igraph_gml_yyset_out  (FILE * out_str ,yyscan_t yyscanner );
+
+int igraph_gml_yyget_leng (yyscan_t yyscanner );
+
+char *igraph_gml_yyget_text (yyscan_t yyscanner );
+
+int igraph_gml_yyget_lineno (yyscan_t yyscanner );
+
+void igraph_gml_yyset_lineno (int line_number ,yyscan_t yyscanner );
+
+YYSTYPE * igraph_gml_yyget_lval (yyscan_t yyscanner );
+
+void igraph_gml_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner );
+
+       YYLTYPE *igraph_gml_yyget_lloc (yyscan_t yyscanner );
+    
+        void igraph_gml_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner );
+    
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int igraph_gml_yywrap (yyscan_t yyscanner );
+#else
+extern int igraph_gml_yywrap (yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (yyscan_t yyscanner );
+#else
+static int input (yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		size_t n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int igraph_gml_yylex \
+               (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner);
+
+#define YY_DECL int igraph_gml_yylex \
+               (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	if ( yyleng > 0 ) \
+		YY_CURRENT_BUFFER_LVALUE->yy_at_bol = \
+				(yytext[yyleng - 1] == '\n'); \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp, *yy_bp;
+	register int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+#line 76 "foreign-gml-lexer.l"
+
+
+#line 771 "foreign-gml-lexer.c"
+
+    yylval = yylval_param;
+
+    yylloc = yylloc_param;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			igraph_gml_yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				igraph_gml_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+		}
+
+		igraph_gml_yy_load_buffer_state(yyscanner );
+		}
+
+	while ( 1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+		yy_current_state += YY_AT_BOL();
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 29 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 43 );
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+		if ( yy_act == 0 )
+			{ /* have to back up */
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			yy_act = yy_accept[yy_current_state];
+			}
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+/* rule 1 can match eol */
+YY_RULE_SETUP
+#line 78 "foreign-gml-lexer.l"
+{ /* comments ignored */ }
+	YY_BREAK
+case 2:
+/* rule 2 can match eol */
+YY_RULE_SETUP
+#line 80 "foreign-gml-lexer.l"
+{ return STRING; }
+	YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 81 "foreign-gml-lexer.l"
+{ return NUM; }
+	YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 82 "foreign-gml-lexer.l"
+{ return KEYWORD; }
+	YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 83 "foreign-gml-lexer.l"
+{ return LISTOPEN; }
+	YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 84 "foreign-gml-lexer.l"
+{ return LISTCLOSE; }
+	YY_BREAK
+case 7:
+/* rule 7 can match eol */
+YY_RULE_SETUP
+#line 85 "foreign-gml-lexer.l"
+{ }
+	YY_BREAK
+case 8:
+/* rule 8 can match eol */
+YY_RULE_SETUP
+#line 86 "foreign-gml-lexer.l"
+{ /* other whitespace ignored */ }
+	YY_BREAK
+case YY_STATE_EOF(INITIAL):
+#line 88 "foreign-gml-lexer.l"
+{ 
+                          if (yyextra->eof) {
+			    yyterminate();
+			  } else {
+			    yyextra->eof=1;
+			    return EOFF;
+			  }			  
+                        }
+	YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 97 "foreign-gml-lexer.l"
+ECHO;
+	YY_BREAK
+#line 919 "foreign-gml-lexer.c"
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * igraph_gml_yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_c_buf_p;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( igraph_gml_yywrap(yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+} /* end of igraph_gml_yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	register char *source = yyg->yytext_ptr;
+	register int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1;
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					igraph_gml_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = 0;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, (size_t) num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			igraph_gml_yyrestart(yyin  ,yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) igraph_gml_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+	yy_current_state += YY_AT_BOL();
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 29 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	register int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	register char *yy_cp = yyg->yy_c_buf_p;
+
+	register YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 29 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	yy_is_jam = (yy_current_state == 28);
+
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					igraph_gml_yyrestart(yyin ,yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( igraph_gml_yywrap(yyscanner ) )
+						return EOF;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = (c == '\n');
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void igraph_gml_yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        igraph_gml_yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            igraph_gml_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+	}
+
+	igraph_gml_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
+	igraph_gml_yy_load_buffer_state(yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_gml_yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		igraph_gml_yypop_buffer_state();
+	 *		igraph_gml_yypush_buffer_state(new_buffer);
+     */
+	igraph_gml_yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	igraph_gml_yy_load_buffer_state(yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (igraph_gml_yywrap()) processing, but the only time this flag
+	 * is looked at is after igraph_gml_yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void igraph_gml_yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE igraph_gml_yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) igraph_gml_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) igraph_gml_yyalloc(b->yy_buf_size + 2 ,yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	igraph_gml_yy_init_buffer(b,file ,yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with igraph_gml_yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void igraph_gml_yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		igraph_gml_yyfree((void *) b->yy_ch_buf ,yyscanner );
+
+	igraph_gml_yyfree((void *) b ,yyscanner );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+    
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a igraph_gml_yyrestart() or at EOF.
+ */
+    static void igraph_gml_yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	igraph_gml_yy_flush_buffer(b ,yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then igraph_gml_yy_init_buffer was _probably_
+     * called from igraph_gml_yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_gml_yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		igraph_gml_yy_load_buffer_state(yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_gml_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	igraph_gml_yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from igraph_gml_yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from igraph_gml_yy_switch_to_buffer. */
+	igraph_gml_yy_load_buffer_state(yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_gml_yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	igraph_gml_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		igraph_gml_yy_load_buffer_state(yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void igraph_gml_yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	int num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+		num_to_alloc = 1;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_gml_yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yyensure_buffer_stack()" );
+								  
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+				
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		int grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_gml_yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object. 
+ */
+YY_BUFFER_STATE igraph_gml_yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return 0;
+
+	b = (YY_BUFFER_STATE) igraph_gml_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yy_scan_buffer()" );
+
+	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = 0;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	igraph_gml_yy_switch_to_buffer(b ,yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to igraph_gml_yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       igraph_gml_yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE igraph_gml_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner)
+{
+    
+	return igraph_gml_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to igraph_gml_yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE igraph_gml_yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = _yybytes_len + 2;
+	buf = (char *) igraph_gml_yyalloc(n ,yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_gml_yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = igraph_gml_yy_scan_buffer(buf,n ,yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in igraph_gml_yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner)
+{
+    	(void) fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE igraph_gml_yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_gml_yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_gml_yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_gml_yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_gml_yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int igraph_gml_yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *igraph_gml_yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void igraph_gml_yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_gml_yyset_lineno (int  line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_gml_yyset_lineno called with no buffer" , yyscanner); 
+    
+    yylineno = line_number;
+}
+
+/** Set the current column.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_gml_yyset_column (int  column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_gml_yyset_column called with no buffer" , yyscanner); 
+    
+    yycolumn = column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see igraph_gml_yy_switch_to_buffer
+ */
+void igraph_gml_yyset_in (FILE *  in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = in_str ;
+}
+
+void igraph_gml_yyset_out (FILE *  out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = out_str ;
+}
+
+int igraph_gml_yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void igraph_gml_yyset_debug (int  bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+YYSTYPE * igraph_gml_yyget_lval  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylval;
+}
+
+void igraph_gml_yyset_lval (YYSTYPE *  yylval_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylval = yylval_param;
+}
+
+YYLTYPE *igraph_gml_yyget_lloc  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylloc;
+}
+    
+void igraph_gml_yyset_lloc (YYLTYPE *  yylloc_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylloc = yylloc_param;
+}
+    
+/* User-visible API */
+
+/* igraph_gml_yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+
+int igraph_gml_yylex_init(yyscan_t* ptr_yy_globals)
+
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) igraph_gml_yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* igraph_gml_yylex_init_extra has the same functionality as igraph_gml_yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to igraph_gml_yyalloc in
+ * the yyextra field.
+ */
+
+int igraph_gml_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
+
+{
+    struct yyguts_t dummy_yyguts;
+
+    igraph_gml_yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+	
+    *ptr_yy_globals = (yyscan_t) igraph_gml_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+	
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+    
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+    
+    igraph_gml_yyset_extra (yy_user_defined, *ptr_yy_globals);
+    
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from igraph_gml_yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = 0;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = (char *) 0;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = (FILE *) 0;
+    yyout = (FILE *) 0;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * igraph_gml_yylex_init()
+     */
+    return 0;
+}
+
+/* igraph_gml_yylex_destroy is for both reentrant and non-reentrant scanners. */
+int igraph_gml_yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		igraph_gml_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		igraph_gml_yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	igraph_gml_yyfree(yyg->yy_buffer_stack ,yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        igraph_gml_yyfree(yyg->yy_start_stack ,yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * igraph_gml_yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    igraph_gml_yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
+{
+	register int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner)
+{
+	register int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *igraph_gml_yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	return (void *) malloc( size );
+}
+
+void *igraph_gml_yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return (void *) realloc( (char *) ptr, size );
+}
+
+void igraph_gml_yyfree (void * ptr , yyscan_t yyscanner)
+{
+	free( (char *) ptr );	/* see igraph_gml_yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 97 "foreign-gml-lexer.l"
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-gml-parser.c igraph-0.6.5/src/foreign-gml-parser.c
--- igraph-0.6.5~quantal1/src/foreign-gml-parser.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-gml-parser.c	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,1979 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison implementation for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "2.5"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 1
+
+/* Substitute the variable and function names.  */
+#define yyparse         igraph_gml_yyparse
+#define yylex           igraph_gml_yylex
+#define yyerror         igraph_gml_yyerror
+#define yylval          igraph_gml_yylval
+#define yychar          igraph_gml_yychar
+#define yydebug         igraph_gml_yydebug
+#define yynerrs         igraph_gml_yynerrs
+#define yylloc          igraph_gml_yylloc
+
+/* Copy the first part of user declarations.  */
+
+/* Line 268 of yacc.c  */
+#line 23 "foreign-gml-parser.y"
+
+
+/* 
+   IGraph library.
+   Copyright (C) 2009-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include <stdio.h>
+#include <math.h>
+#include <string.h>
+
+#include "igraph_error.h"
+#include "igraph_memory.h"
+#include "config.h"
+#include "igraph_hacks_internal.h"
+#include "igraph_math.h"
+#include "igraph_gml_tree.h"
+#include "foreign-gml-header.h"
+#include "foreign-gml-parser.h"
+
+#define yyscan_t void*
+
+int igraph_gml_yylex(YYSTYPE* lvalp, YYLTYPE* llocp, void *scanner);
+int igraph_gml_yyerror(YYLTYPE* locp, igraph_i_gml_parsedata_t *context, 
+		       char *s);
+char *igraph_gml_yyget_text (yyscan_t yyscanner );
+int igraph_gml_yyget_leng (yyscan_t yyscanner );
+void igraph_i_gml_get_keyword(char *s, int len, void *res);
+void igraph_i_gml_get_string(char *s, int len, void *res);
+double igraph_i_gml_get_real(char *s, int len);
+igraph_gml_tree_t *igraph_i_gml_make_numeric(char* s, int len, double value);
+igraph_gml_tree_t *igraph_i_gml_make_numeric2(char* s, int len, 
+					      char *v, int vlen);
+igraph_gml_tree_t *igraph_i_gml_make_string(char* s, int len, 
+					    char *value, int valuelen);
+igraph_gml_tree_t *igraph_i_gml_make_list(char* s, int len, 
+					  igraph_gml_tree_t *list);
+igraph_gml_tree_t *igraph_i_gml_merge(igraph_gml_tree_t *t1, igraph_gml_tree_t* t2);
+
+#define scanner context->scanner
+#define USE(x) /*(x)*/
+
+
+
+/* Line 268 of yacc.c  */
+#line 141 "foreign-gml-parser.c"
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 1
+#endif
+
+/* Enabling the token table.  */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     STRING = 258,
+     NUM = 259,
+     KEYWORD = 260,
+     LISTOPEN = 261,
+     LISTCLOSE = 262,
+     EOFF = 263
+   };
+#endif
+/* Tokens.  */
+#define STRING 258
+#define NUM 259
+#define KEYWORD 260
+#define LISTOPEN 261
+#define LISTCLOSE 262
+#define EOFF 263
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 293 of yacc.c  */
+#line 93 "foreign-gml-parser.y"
+
+   struct {
+      char *s;
+      int len;
+   } str;
+   void *tree;
+   double real;
+
+
+
+/* Line 293 of yacc.c  */
+#line 204 "foreign-gml-parser.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+/* Copy the second part of user declarations.  */
+
+
+/* Line 343 of yacc.c  */
+#line 229 "foreign-gml-parser.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(msgid) dgettext ("bison-runtime", msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions.  */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+    int yyi;
+#endif
+{
+  return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+	     && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+	 || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
+	     && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+  YYLTYPE yyls_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+      + 2 * YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)				\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack_alloc, Stack, yysize);			\
+	Stack = &yyptr->Stack_alloc;					\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (YYID (0))
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  YYSIZE_T yyi;				\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (YYID (0))
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  6
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   14
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  9
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  7
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  12
+/* YYNRULES -- Number of states.  */
+#define YYNSTATES  17
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   263
+
+#define YYTRANSLATE(YYX)						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5,     6,     7,     8
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const yytype_uint8 yyprhs[] =
+{
+       0,     0,     3,     5,     8,    10,    13,    16,    19,    24,
+      27,    29,    31
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS.  */
+static const yytype_int8 yyrhs[] =
+{
+      10,     0,    -1,    11,    -1,    11,     8,    -1,    12,    -1,
+      11,    12,    -1,    13,    14,    -1,    13,    15,    -1,    13,
+       6,    11,     7,    -1,    13,    13,    -1,     5,    -1,     4,
+      -1,     3,    -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const yytype_uint8 yyrline[] =
+{
+       0,   120,   120,   121,   124,   125,   127,   129,   131,   133,
+     137,   140,   143
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "STRING", "NUM", "KEYWORD", "LISTOPEN",
+  "LISTCLOSE", "EOFF", "$accept", "input", "list", "keyvalue", "key",
+  "num", "string", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260,   261,   262,   263
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,     9,    10,    10,    11,    11,    12,    12,    12,    12,
+      13,    14,    15
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     1,     2,     1,     2,     2,     2,     4,     2,
+       1,     1,     1
+};
+
+/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
+   Performed when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       0,    10,     0,     2,     4,     0,     1,     3,     5,    12,
+      11,     0,     9,     6,     7,     0,     8
+};
+
+/* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int8 yydefgoto[] =
+{
+      -1,     2,     3,     4,     5,    13,    14
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -4
+static const yytype_int8 yypact[] =
+{
+       1,    -4,    10,     0,    -4,    -2,    -4,    -4,    -4,    -4,
+      -4,     1,    -4,    -4,    -4,     2,    -4
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yytype_int8 yypgoto[] =
+{
+      -4,    -4,     3,    -3,     6,    -4,    -4
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -1
+static const yytype_uint8 yytable[] =
+{
+       8,     9,    10,     1,    11,     1,     1,     1,     7,    16,
+       6,    12,     8,     0,    15
+};
+
+#define yypact_value_is_default(yystate) \
+  ((yystate) == (-4))
+
+#define yytable_value_is_error(yytable_value) \
+  YYID (0)
+
+static const yytype_int8 yycheck[] =
+{
+       3,     3,     4,     5,     6,     5,     5,     5,     8,     7,
+       0,     5,    15,    -1,    11
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,     5,    10,    11,    12,    13,     0,     8,    12,     3,
+       4,     6,    13,    14,    15,    11,     7
+};
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  However,
+   YYFAIL appears to be in use.  Nevertheless, it is formally deprecated
+   in Bison 2.4.2's NEWS entry, where a plan to phase it out is
+   discussed.  */
+
+#define YYFAIL		goto yyerrlab
+#if defined YYFAIL
+  /* This is here to suppress warnings from the GCC cpp's
+     -Wunused-macros.  Normally we don't worry about that warning, but
+     some users do, and we want to make it easy for users to remove
+     YYFAIL uses, which will produce warnings from Bison 2.5.  */
+#endif
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      YYPOPSTACK (1);						\
+      goto yybackup;						\
+    }								\
+  else								\
+    {								\
+      yyerror (&yylloc, context, YY_("syntax error: cannot back up")); \
+      YYERROR;							\
+    }								\
+while (YYID (0))
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (YYID (N))                                                    \
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+	      (Loc).first_line, (Loc).first_column,	\
+	      (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, &yylloc, scanner)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)			  \
+do {									  \
+  if (yydebug)								  \
+    {									  \
+      YYFPRINTF (stderr, "%s ", Title);					  \
+      yy_symbol_print (stderr,						  \
+		  Type, Value, Location, context); \
+      YYFPRINTF (stderr, "\n");						  \
+    }									  \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_gml_parsedata_t* context)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_gml_parsedata_t* context;
+#endif
+{
+  if (!yyvaluep)
+    return;
+  YYUSE (yylocationp);
+  YYUSE (context);
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+  YYUSE (yyoutput);
+# endif
+  switch (yytype)
+    {
+      default:
+	break;
+    }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_gml_parsedata_t* context)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_gml_parsedata_t* context;
+#endif
+{
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+  YY_LOCATION_PRINT (yyoutput, *yylocationp);
+  YYFPRINTF (yyoutput, ": ");
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+    yytype_int16 *yybottom;
+    yytype_int16 *yytop;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, igraph_i_gml_parsedata_t* context)
+#else
+static void
+yy_reduce_print (yyvsp, yylsp, yyrule, context)
+    YYSTYPE *yyvsp;
+    YYLTYPE *yylsp;
+    int yyrule;
+    igraph_i_gml_parsedata_t* context;
+#endif
+{
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  unsigned long int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+	     yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+		       &(yyvsp[(yyi + 1) - (yynrhs)])
+		       , &(yylsp[(yyi + 1) - (yynrhs)])		       , context);
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (yyvsp, yylsp, Rule, context); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+    const char *yystr;
+#endif
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+    char *yydest;
+    const char *yysrc;
+#endif
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+	switch (*++yyp)
+	  {
+	  case '\'':
+	  case ',':
+	    goto do_not_strip_quotes;
+
+	  case '\\':
+	    if (*++yyp != '\\')
+	      goto do_not_strip_quotes;
+	    /* Fall through.  */
+	  default:
+	    if (yyres)
+	      yyres[yyn] = *yyp;
+	    yyn++;
+	    break;
+
+	  case '"':
+	    if (yyres)
+	      yyres[yyn] = '\0';
+	    return yyn;
+	  }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  YYSIZE_T yysize1;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = 0;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - Assume YYFAIL is not used.  It's too flawed to consider.  See
+       <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
+       for details.  YYERROR is fine as it does not invoke this
+       function.
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+                if (! (yysize <= yysize1
+                       && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                  return 2;
+                yysize = yysize1;
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  yysize1 = yysize + yystrlen (yyformat);
+  if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+    return 2;
+  yysize = yysize1;
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, igraph_i_gml_parsedata_t* context)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep, yylocationp, context)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+    YYLTYPE *yylocationp;
+    igraph_i_gml_parsedata_t* context;
+#endif
+{
+  YYUSE (yyvaluep);
+  YYUSE (yylocationp);
+  YYUSE (context);
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+      case 5: /* "KEYWORD" */
+
+/* Line 1391 of yacc.c  */
+#line 115 "foreign-gml-parser.y"
+	{ igraph_Free((yyvaluep->str).s); };
+
+/* Line 1391 of yacc.c  */
+#line 1183 "foreign-gml-parser.c"
+	break;
+      case 11: /* "list" */
+
+/* Line 1391 of yacc.c  */
+#line 116 "foreign-gml-parser.y"
+	{ igraph_gml_tree_destroy((yyvaluep->tree)); };
+
+/* Line 1391 of yacc.c  */
+#line 1192 "foreign-gml-parser.c"
+	break;
+      case 12: /* "keyvalue" */
+
+/* Line 1391 of yacc.c  */
+#line 116 "foreign-gml-parser.y"
+	{ igraph_gml_tree_destroy((yyvaluep->tree)); };
+
+/* Line 1391 of yacc.c  */
+#line 1201 "foreign-gml-parser.c"
+	break;
+      case 13: /* "key" */
+
+/* Line 1391 of yacc.c  */
+#line 115 "foreign-gml-parser.y"
+	{ igraph_Free((yyvaluep->str).s); };
+
+/* Line 1391 of yacc.c  */
+#line 1210 "foreign-gml-parser.c"
+	break;
+      case 15: /* "string" */
+
+/* Line 1391 of yacc.c  */
+#line 115 "foreign-gml-parser.y"
+	{ igraph_Free((yyvaluep->str).s); };
+
+/* Line 1391 of yacc.c  */
+#line 1219 "foreign-gml-parser.c"
+	break;
+
+      default:
+	break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (igraph_i_gml_parsedata_t* context);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+    void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (igraph_i_gml_parsedata_t* context)
+#else
+int
+yyparse (context)
+    igraph_i_gml_parsedata_t* context;
+#endif
+#endif
+{
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+
+/* Location data for the lookahead symbol.  */
+YYLTYPE yylloc;
+
+    /* Number of syntax errors so far.  */
+    int yynerrs;
+
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       `yyss': related to states.
+       `yyvs': related to semantic values.
+       `yyls': related to locations.
+
+       Refer to the stacks thru separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    /* The location stack.  */
+    YYLTYPE yylsa[YYINITDEPTH];
+    YYLTYPE *yyls;
+    YYLTYPE *yylsp;
+
+    /* The locations where the error started and ended.  */
+    YYLTYPE yyerror_range[3];
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+  YYLTYPE yyloc;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yytoken = 0;
+  yyss = yyssa;
+  yyvs = yyvsa;
+  yyls = yylsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+  yyssp = yyss;
+  yyvsp = yyvs;
+  yylsp = yyls;
+
+#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+  /* Initialize the default location before parsing starts.  */
+  yylloc.first_line   = yylloc.last_line   = 1;
+  yylloc.first_column = yylloc.last_column = 1;
+#endif
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack.  Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	yytype_int16 *yyss1 = yyss;
+	YYLTYPE *yyls1 = yyls;
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow (YY_("memory exhausted"),
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+		    &yyls1, yysize * sizeof (*yylsp),
+		    &yystacksize);
+
+	yyls = yyls1;
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	yytype_int16 *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyexhaustedlab;
+	YYSTACK_RELOCATE (yyss_alloc, yyss);
+	YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+	YYSTACK_RELOCATE (yyls_alloc, yyls);
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+      yylsp = yyls + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  *++yyvsp = yylval;
+  *++yylsp = yylloc;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+  /* Default location.  */
+  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 2:
+
+/* Line 1806 of yacc.c  */
+#line 120 "foreign-gml-parser.y"
+    { context->tree=(yyvsp[(1) - (1)].tree); }
+    break;
+
+  case 3:
+
+/* Line 1806 of yacc.c  */
+#line 121 "foreign-gml-parser.y"
+    { context->tree=(yyvsp[(1) - (2)].tree); }
+    break;
+
+  case 4:
+
+/* Line 1806 of yacc.c  */
+#line 124 "foreign-gml-parser.y"
+    { (yyval.tree)=(yyvsp[(1) - (1)].tree); }
+    break;
+
+  case 5:
+
+/* Line 1806 of yacc.c  */
+#line 125 "foreign-gml-parser.y"
+    { (yyval.tree)=igraph_i_gml_merge((yyvsp[(1) - (2)].tree), (yyvsp[(2) - (2)].tree)); }
+    break;
+
+  case 6:
+
+/* Line 1806 of yacc.c  */
+#line 128 "foreign-gml-parser.y"
+    { (yyval.tree)=igraph_i_gml_make_numeric((yyvsp[(1) - (2)].str).s, (yyvsp[(1) - (2)].str).len, (yyvsp[(2) - (2)].real)); }
+    break;
+
+  case 7:
+
+/* Line 1806 of yacc.c  */
+#line 130 "foreign-gml-parser.y"
+    { (yyval.tree)=igraph_i_gml_make_string((yyvsp[(1) - (2)].str).s, (yyvsp[(1) - (2)].str).len, (yyvsp[(2) - (2)].str).s, (yyvsp[(2) - (2)].str).len); }
+    break;
+
+  case 8:
+
+/* Line 1806 of yacc.c  */
+#line 132 "foreign-gml-parser.y"
+    { (yyval.tree)=igraph_i_gml_make_list((yyvsp[(1) - (4)].str).s, (yyvsp[(1) - (4)].str).len, (yyvsp[(3) - (4)].tree)); }
+    break;
+
+  case 9:
+
+/* Line 1806 of yacc.c  */
+#line 134 "foreign-gml-parser.y"
+    { (yyval.tree)=igraph_i_gml_make_numeric2((yyvsp[(1) - (2)].str).s, (yyvsp[(1) - (2)].str).len, (yyvsp[(2) - (2)].str).s, (yyvsp[(2) - (2)].str).len); }
+    break;
+
+  case 10:
+
+/* Line 1806 of yacc.c  */
+#line 137 "foreign-gml-parser.y"
+    { igraph_i_gml_get_keyword(igraph_gml_yyget_text(scanner), 
+					igraph_gml_yyget_leng(scanner), 
+					&(yyval.str)); USE((yyvsp[(1) - (1)].str)) }
+    break;
+
+  case 11:
+
+/* Line 1806 of yacc.c  */
+#line 140 "foreign-gml-parser.y"
+    { (yyval.real)=igraph_i_gml_get_real(igraph_gml_yyget_text(scanner), 
+				     igraph_gml_yyget_leng(scanner)); }
+    break;
+
+  case 12:
+
+/* Line 1806 of yacc.c  */
+#line 143 "foreign-gml-parser.y"
+    { igraph_i_gml_get_string(igraph_gml_yyget_text(scanner), 
+					 igraph_gml_yyget_leng(scanner), 
+					 &(yyval.str)); }
+    break;
+
+
+
+/* Line 1806 of yacc.c  */
+#line 1630 "foreign-gml-parser.c"
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+  *++yylsp = yyloc;
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (&yylloc, context, YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (&yylloc, context, yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+  yyerror_range[1] = yylloc;
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+	{
+	  /* Return failure if at end of input.  */
+	  if (yychar == YYEOF)
+	    YYABORT;
+	}
+      else
+	{
+	  yydestruct ("Error: discarding",
+		      yytoken, &yylval, &yylloc, context);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  yyerror_range[1] = yylsp[1-yylen];
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+      yyerror_range[1] = *yylsp;
+      yydestruct ("Error: popping",
+		  yystos[yystate], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  *++yyvsp = yylval;
+
+  yyerror_range[2] = yylloc;
+  /* Using YYLLOC is tempting, but would change the location of
+     the lookahead.  YYLOC is available though.  */
+  YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
+  *++yylsp = yyloc;
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (&yylloc, context, YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval, &yylloc, context);
+    }
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+		  yystos[*yyssp], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  /* Make sure YYID is used.  */
+  return YYID (yyresult);
+}
+
+
+
+/* Line 2067 of yacc.c  */
+#line 147 "foreign-gml-parser.y"
+
+
+int igraph_gml_yyerror(YYLTYPE* locp, igraph_i_gml_parsedata_t *context, 
+		       char *s) {
+  snprintf(context->errmsg, sizeof(context->errmsg)/sizeof(char)-1, 
+	   "Parse error in GML file, line %i (%s)", 
+	   locp->first_line, s);
+  return 0;
+}
+
+void igraph_i_gml_get_keyword(char *s, int len, void *res) {
+  struct { char *s; int len; } *p=res;
+  p->s=igraph_Calloc(len+1, char);
+  if (!p->s) { 
+    igraph_error("Cannot read GML file", __FILE__, __LINE__, IGRAPH_PARSEERROR);
+  }
+  memcpy(p->s, s, sizeof(char)*len);
+  p->s[len]='\0';
+  p->len=len;
+}
+
+void igraph_i_gml_get_string(char *s, int len, void *res) {
+  struct { char *s; int len; } *p=res;
+  p->s=igraph_Calloc(len-1, char);
+  if (!p->s) { 
+    igraph_error("Cannot read GML file", __FILE__, __LINE__, IGRAPH_PARSEERROR);
+  }
+  memcpy(p->s, s+1, sizeof(char)*(len-2));
+  p->s[len-2]='\0';
+  p->len=len-2;
+}
+
+double igraph_i_gml_get_real(char *s, int len) {
+  igraph_real_t num;
+  char tmp=s[len];
+  s[len]='\0';
+  sscanf(s, "%lf", &num);
+  s[len]=tmp;
+  return num;
+} 
+
+igraph_gml_tree_t *igraph_i_gml_make_numeric(char* s, int len, double value) {
+  igraph_gml_tree_t *t=igraph_Calloc(1, igraph_gml_tree_t);
+  if (!t) { 
+    igraph_error("Cannot build GML tree", __FILE__, __LINE__, IGRAPH_ENOMEM);
+    return 0;
+  }
+  if (floor(value)==value) {
+    igraph_gml_tree_init_integer(t, s, len, value);
+  } else {
+    igraph_gml_tree_init_real(t, s, len, value);
+  }
+  
+  return t;
+}
+
+igraph_gml_tree_t *igraph_i_gml_make_numeric2(char* s, int len, 
+					      char *v, int vlen) {
+  igraph_gml_tree_t *t=igraph_Calloc(1, igraph_gml_tree_t);
+  char tmp=v[vlen];
+  igraph_real_t value=0;
+  if (!t) { 
+    igraph_error("Cannot build GML tree", __FILE__, __LINE__, IGRAPH_ENOMEM);
+    return 0;
+  }
+  v[vlen]='\0';
+  if (strcasecmp(v, "inf")) {
+    value=IGRAPH_INFINITY;
+  } else if (strcasecmp(v, "nan")) {
+    value=IGRAPH_NAN;
+  } else {
+    igraph_error("Parse error", __FILE__, __LINE__, IGRAPH_PARSEERROR);
+  }
+  v[vlen]=tmp;
+  igraph_gml_tree_init_real(t, s, len, value);  
+
+  return t;
+}
+
+igraph_gml_tree_t *igraph_i_gml_make_string(char* s, int len, 
+					    char *value, int valuelen) {
+  igraph_gml_tree_t *t=igraph_Calloc(1, igraph_gml_tree_t);
+  if (!t) { 
+    igraph_error("Cannot build GML tree", __FILE__, __LINE__, IGRAPH_ENOMEM);
+    return 0;
+  }
+  igraph_gml_tree_init_string(t, s, len, value, valuelen);
+
+  return t;
+}
+
+igraph_gml_tree_t *igraph_i_gml_make_list(char* s, int len, 
+					  igraph_gml_tree_t *list) {
+  
+  igraph_gml_tree_t *t=igraph_Calloc(1, igraph_gml_tree_t);
+  if (!t) { 
+    igraph_error("Cannot build GML tree", __FILE__, __LINE__, IGRAPH_ENOMEM);
+    return 0;
+  }
+  igraph_gml_tree_init_tree(t, s, len, list);
+
+  return t;
+}
+
+igraph_gml_tree_t *igraph_i_gml_merge(igraph_gml_tree_t *t1, igraph_gml_tree_t* t2) {
+
+  igraph_gml_tree_mergedest(t1, t2);
+  igraph_Free(t2);
+
+  return t1;
+}
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-gml-parser.h igraph-0.6.5/src/foreign-gml-parser.h
--- igraph-0.6.5~quantal1/src/foreign-gml-parser.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-gml-parser.h	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,99 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison interface for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     STRING = 258,
+     NUM = 259,
+     KEYWORD = 260,
+     LISTOPEN = 261,
+     LISTCLOSE = 262,
+     EOFF = 263
+   };
+#endif
+/* Tokens.  */
+#define STRING 258
+#define NUM 259
+#define KEYWORD 260
+#define LISTOPEN 261
+#define LISTCLOSE 262
+#define EOFF 263
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 2068 of yacc.c  */
+#line 93 "foreign-gml-parser.y"
+
+   struct {
+      char *s;
+      int len;
+   } str;
+   void *tree;
+   double real;
+
+
+
+/* Line 2068 of yacc.c  */
+#line 77 "foreign-gml-parser.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-lgl-lexer.c igraph-0.6.5/src/foreign-lgl-lexer.c
--- igraph-0.6.5~quantal1/src/foreign-lgl-lexer.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-lgl-lexer.c	2013-03-03 01:30:28.000000000 +0000
@@ -0,0 +1,2022 @@
+#line 2 "foreign-lgl-lexer.c"
+
+#line 4 "foreign-lgl-lexer.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else	/* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif	/* defined (__STDC__) */
+#endif	/* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE igraph_lgl_yyrestart(yyin ,yyscanner )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+    #define YY_LESS_LINENO(n)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	yy_size_t yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+    
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via igraph_lgl_yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void igraph_lgl_yyrestart (FILE *input_file ,yyscan_t yyscanner );
+void igraph_lgl_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_lgl_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner );
+void igraph_lgl_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_lgl_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_lgl_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+void igraph_lgl_yypop_buffer_state (yyscan_t yyscanner );
+
+static void igraph_lgl_yyensure_buffer_stack (yyscan_t yyscanner );
+static void igraph_lgl_yy_load_buffer_state (yyscan_t yyscanner );
+static void igraph_lgl_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
+
+#define YY_FLUSH_BUFFER igraph_lgl_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
+
+YY_BUFFER_STATE igraph_lgl_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_lgl_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_lgl_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner );
+
+void *igraph_lgl_yyalloc (yy_size_t ,yyscan_t yyscanner );
+void *igraph_lgl_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner );
+void igraph_lgl_yyfree (void * ,yyscan_t yyscanner );
+
+#define yy_new_buffer igraph_lgl_yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        igraph_lgl_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_lgl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        igraph_lgl_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_lgl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define igraph_lgl_yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state  ,yyscan_t yyscanner);
+static int yy_get_next_buffer (yyscan_t yyscanner );
+static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (size_t) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 5
+#define YY_END_OF_BUFFER 6
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static yyconst flex_int16_t yy_accept[13] =
+    {   0,
+        2,    2,    6,    4,    2,    3,    3,    1,    4,    2,
+        3,    0
+    } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        1,    1,    4,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    2,    1,    1,    5,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int32_t yy_meta[6] =
+    {   0,
+        1,    2,    3,    4,    5
+    } ;
+
+static yyconst flex_int16_t yy_base[17] =
+    {   0,
+        0,    0,   10,    0,    0,    0,    0,   11,    0,    0,
+       11,   11,    8,    6,    3,    3
+    } ;
+
+static yyconst flex_int16_t yy_def[17] =
+    {   0,
+       12,    1,   12,   13,   14,   15,   16,   12,   13,   14,
+       12,    0,   12,   12,   12,   12
+    } ;
+
+static yyconst flex_int16_t yy_nxt[17] =
+    {   0,
+        4,    5,    6,    7,    8,   11,   11,   10,    9,   12,
+        3,   12,   12,   12,   12,   12
+    } ;
+
+static yyconst flex_int16_t yy_chk[17] =
+    {   0,
+        1,    1,    1,    1,    1,   16,   15,   14,   13,    3,
+       12,   12,   12,   12,   12,   12
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "foreign-lgl-lexer.l"
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#line 24 "foreign-lgl-lexer.l"
+
+/* 
+   IGraph library.
+   Copyright (C) 2007-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include <stdlib.h>
+#include "foreign-lgl-parser.h"
+#include "foreign-lgl-header.h"
+#define YY_EXTRA_TYPE igraph_i_lgl_parsedata_t*
+#define YY_USER_ACTION yylloc->first_line = yylineno;
+/* We assume that 'file' is 'stderr' here. */
+#define fprintf(file, msg, ...) \
+  igraph_warningf(msg, __FILE__, __LINE__, 0, __VA_ARGS__)
+#ifdef stdout 
+#  undef stdout
+#endif
+#define stdout 0
+#define exit(code) igraph_error("Fatal error in DL parser", __FILE__, \
+				__LINE__, IGRAPH_PARSEERROR);
+#define YY_NO_INPUT 1
+#line 507 "foreign-lgl-lexer.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    YYSTYPE * yylval_r;
+
+    YYLTYPE * yylloc_r;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals (yyscan_t yyscanner );
+
+    /* This must go here because YYSTYPE and YYLTYPE are included
+     * from bison output in section 1.*/
+    #    define yylval yyg->yylval_r
+    
+    #    define yylloc yyg->yylloc_r
+    
+int igraph_lgl_yylex_init (yyscan_t* scanner);
+
+int igraph_lgl_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int igraph_lgl_yylex_destroy (yyscan_t yyscanner );
+
+int igraph_lgl_yyget_debug (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_debug (int debug_flag ,yyscan_t yyscanner );
+
+YY_EXTRA_TYPE igraph_lgl_yyget_extra (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
+
+FILE *igraph_lgl_yyget_in (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_in  (FILE * in_str ,yyscan_t yyscanner );
+
+FILE *igraph_lgl_yyget_out (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_out  (FILE * out_str ,yyscan_t yyscanner );
+
+int igraph_lgl_yyget_leng (yyscan_t yyscanner );
+
+char *igraph_lgl_yyget_text (yyscan_t yyscanner );
+
+int igraph_lgl_yyget_lineno (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_lineno (int line_number ,yyscan_t yyscanner );
+
+YYSTYPE * igraph_lgl_yyget_lval (yyscan_t yyscanner );
+
+void igraph_lgl_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner );
+
+       YYLTYPE *igraph_lgl_yyget_lloc (yyscan_t yyscanner );
+    
+        void igraph_lgl_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner );
+    
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int igraph_lgl_yywrap (yyscan_t yyscanner );
+#else
+extern int igraph_lgl_yywrap (yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (yyscan_t yyscanner );
+#else
+static int input (yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		size_t n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int igraph_lgl_yylex \
+               (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner);
+
+#define YY_DECL int igraph_lgl_yylex \
+               (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp, *yy_bp;
+	register int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+#line 75 "foreign-lgl-lexer.l"
+
+
+ /* --------------------------------------------------hashmark------*/
+#line 755 "foreign-lgl-lexer.c"
+
+    yylval = yylval_param;
+
+    yylloc = yylloc_param;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			igraph_lgl_yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				igraph_lgl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+		}
+
+		igraph_lgl_yy_load_buffer_state(yyscanner );
+		}
+
+	while ( 1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 13 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 11 );
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+		if ( yy_act == 0 )
+			{ /* have to back up */
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			yy_act = yy_accept[yy_current_state];
+			}
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 78 "foreign-lgl-lexer.l"
+{ return HASH; }
+	YY_BREAK
+/* ------------------------------------------------whitespace------*/
+case 2:
+YY_RULE_SETUP
+#line 81 "foreign-lgl-lexer.l"
+{ }
+	YY_BREAK
+/* ---------------------------------------------------newline------*/
+case 3:
+/* rule 3 can match eol */
+YY_RULE_SETUP
+#line 84 "foreign-lgl-lexer.l"
+{ return NEWLINE; }
+	YY_BREAK
+/* ----------------------------------------------alphanumeric------*/
+case 4:
+YY_RULE_SETUP
+#line 87 "foreign-lgl-lexer.l"
+{ return ALNUM; }
+	YY_BREAK
+case YY_STATE_EOF(INITIAL):
+#line 89 "foreign-lgl-lexer.l"
+{ if (yyextra->eof) {
+                       yyterminate();
+                    } else {
+                       yyextra->eof=1;
+                       return NEWLINE; 
+                    }
+                  }
+	YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 97 "foreign-lgl-lexer.l"
+ECHO;
+	YY_BREAK
+#line 881 "foreign-lgl-lexer.c"
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * igraph_lgl_yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_c_buf_p;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( igraph_lgl_yywrap(yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+} /* end of igraph_lgl_yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	register char *source = yyg->yytext_ptr;
+	register int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1;
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					igraph_lgl_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = 0;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, (size_t) num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			igraph_lgl_yyrestart(yyin  ,yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) igraph_lgl_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 13 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	register int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	register char *yy_cp = yyg->yy_c_buf_p;
+
+	register YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 13 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	yy_is_jam = (yy_current_state == 12);
+
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					igraph_lgl_yyrestart(yyin ,yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( igraph_lgl_yywrap(yyscanner ) )
+						return EOF;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void igraph_lgl_yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        igraph_lgl_yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            igraph_lgl_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+	}
+
+	igraph_lgl_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
+	igraph_lgl_yy_load_buffer_state(yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_lgl_yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		igraph_lgl_yypop_buffer_state();
+	 *		igraph_lgl_yypush_buffer_state(new_buffer);
+     */
+	igraph_lgl_yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	igraph_lgl_yy_load_buffer_state(yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (igraph_lgl_yywrap()) processing, but the only time this flag
+	 * is looked at is after igraph_lgl_yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void igraph_lgl_yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE igraph_lgl_yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) igraph_lgl_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) igraph_lgl_yyalloc(b->yy_buf_size + 2 ,yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	igraph_lgl_yy_init_buffer(b,file ,yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with igraph_lgl_yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void igraph_lgl_yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		igraph_lgl_yyfree((void *) b->yy_ch_buf ,yyscanner );
+
+	igraph_lgl_yyfree((void *) b ,yyscanner );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+    
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a igraph_lgl_yyrestart() or at EOF.
+ */
+    static void igraph_lgl_yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	igraph_lgl_yy_flush_buffer(b ,yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then igraph_lgl_yy_init_buffer was _probably_
+     * called from igraph_lgl_yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_lgl_yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		igraph_lgl_yy_load_buffer_state(yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_lgl_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	igraph_lgl_yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from igraph_lgl_yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from igraph_lgl_yy_switch_to_buffer. */
+	igraph_lgl_yy_load_buffer_state(yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_lgl_yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	igraph_lgl_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		igraph_lgl_yy_load_buffer_state(yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void igraph_lgl_yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	int num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+		num_to_alloc = 1;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_lgl_yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yyensure_buffer_stack()" );
+								  
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+				
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		int grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_lgl_yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object. 
+ */
+YY_BUFFER_STATE igraph_lgl_yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return 0;
+
+	b = (YY_BUFFER_STATE) igraph_lgl_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yy_scan_buffer()" );
+
+	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = 0;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	igraph_lgl_yy_switch_to_buffer(b ,yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to igraph_lgl_yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       igraph_lgl_yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE igraph_lgl_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner)
+{
+    
+	return igraph_lgl_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to igraph_lgl_yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE igraph_lgl_yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = _yybytes_len + 2;
+	buf = (char *) igraph_lgl_yyalloc(n ,yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_lgl_yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = igraph_lgl_yy_scan_buffer(buf,n ,yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in igraph_lgl_yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner)
+{
+    	(void) fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE igraph_lgl_yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_lgl_yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_lgl_yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_lgl_yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_lgl_yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int igraph_lgl_yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *igraph_lgl_yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void igraph_lgl_yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_lgl_yyset_lineno (int  line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_lgl_yyset_lineno called with no buffer" , yyscanner); 
+    
+    yylineno = line_number;
+}
+
+/** Set the current column.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_lgl_yyset_column (int  column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_lgl_yyset_column called with no buffer" , yyscanner); 
+    
+    yycolumn = column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see igraph_lgl_yy_switch_to_buffer
+ */
+void igraph_lgl_yyset_in (FILE *  in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = in_str ;
+}
+
+void igraph_lgl_yyset_out (FILE *  out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = out_str ;
+}
+
+int igraph_lgl_yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void igraph_lgl_yyset_debug (int  bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+YYSTYPE * igraph_lgl_yyget_lval  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylval;
+}
+
+void igraph_lgl_yyset_lval (YYSTYPE *  yylval_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylval = yylval_param;
+}
+
+YYLTYPE *igraph_lgl_yyget_lloc  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylloc;
+}
+    
+void igraph_lgl_yyset_lloc (YYLTYPE *  yylloc_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylloc = yylloc_param;
+}
+    
+/* User-visible API */
+
+/* igraph_lgl_yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+
+int igraph_lgl_yylex_init(yyscan_t* ptr_yy_globals)
+
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) igraph_lgl_yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* igraph_lgl_yylex_init_extra has the same functionality as igraph_lgl_yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to igraph_lgl_yyalloc in
+ * the yyextra field.
+ */
+
+int igraph_lgl_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
+
+{
+    struct yyguts_t dummy_yyguts;
+
+    igraph_lgl_yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+	
+    *ptr_yy_globals = (yyscan_t) igraph_lgl_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+	
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+    
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+    
+    igraph_lgl_yyset_extra (yy_user_defined, *ptr_yy_globals);
+    
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from igraph_lgl_yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = 0;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = (char *) 0;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = (FILE *) 0;
+    yyout = (FILE *) 0;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * igraph_lgl_yylex_init()
+     */
+    return 0;
+}
+
+/* igraph_lgl_yylex_destroy is for both reentrant and non-reentrant scanners. */
+int igraph_lgl_yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		igraph_lgl_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		igraph_lgl_yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	igraph_lgl_yyfree(yyg->yy_buffer_stack ,yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        igraph_lgl_yyfree(yyg->yy_start_stack ,yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * igraph_lgl_yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    igraph_lgl_yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
+{
+	register int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner)
+{
+	register int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *igraph_lgl_yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	return (void *) malloc( size );
+}
+
+void *igraph_lgl_yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return (void *) realloc( (char *) ptr, size );
+}
+
+void igraph_lgl_yyfree (void * ptr , yyscan_t yyscanner)
+{
+	free( (char *) ptr );	/* see igraph_lgl_yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 97 "foreign-lgl-lexer.l"
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-lgl-parser.c igraph-0.6.5/src/foreign-lgl-parser.c
--- igraph-0.6.5~quantal1/src/foreign-lgl-parser.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-lgl-parser.c	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,1785 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison implementation for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "2.5"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 1
+
+/* Substitute the variable and function names.  */
+#define yyparse         igraph_lgl_yyparse
+#define yylex           igraph_lgl_yylex
+#define yyerror         igraph_lgl_yyerror
+#define yylval          igraph_lgl_yylval
+#define yychar          igraph_lgl_yychar
+#define yydebug         igraph_lgl_yydebug
+#define yynerrs         igraph_lgl_yynerrs
+#define yylloc          igraph_lgl_yylloc
+
+/* Copy the first part of user declarations.  */
+
+/* Line 268 of yacc.c  */
+#line 23 "foreign-lgl-parser.y"
+
+
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#include <stdio.h>
+#include <string.h>
+#include "igraph_hacks_internal.h"
+#include "igraph_types.h" 
+#include "igraph_types_internal.h"
+#include "igraph_math.h"
+#include "igraph_memory.h"
+#include "igraph_error.h"
+#include "config.h"
+#include "foreign-lgl-header.h"
+#include "foreign-lgl-parser.h"
+
+#define yyscan_t void*
+
+int igraph_lgl_yylex(YYSTYPE* lvalp, YYLTYPE* llocp, 
+		     void* scanner);
+int igraph_lgl_yyerror(YYLTYPE* locp, igraph_i_lgl_parsedata_t *context, 
+		       char *s);
+char *igraph_lgl_yyget_text (yyscan_t yyscanner );
+int igraph_lgl_yyget_leng (yyscan_t yyscanner );
+igraph_real_t igraph_lgl_get_number(const char *str, long int len);
+
+#define scanner context->scanner
+
+
+/* Line 268 of yacc.c  */
+#line 128 "foreign-lgl-parser.c"
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 1
+#endif
+
+/* Enabling the token table.  */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     ALNUM = 258,
+     NEWLINE = 259,
+     HASH = 260
+   };
+#endif
+/* Tokens.  */
+#define ALNUM 258
+#define NEWLINE 259
+#define HASH 260
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 293 of yacc.c  */
+#line 80 "foreign-lgl-parser.y"
+
+  long int edgenum;
+  double weightnum;
+
+
+
+/* Line 293 of yacc.c  */
+#line 181 "foreign-lgl-parser.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+/* Copy the second part of user declarations.  */
+
+
+/* Line 343 of yacc.c  */
+#line 206 "foreign-lgl-parser.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(msgid) dgettext ("bison-runtime", msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions.  */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+    int yyi;
+#endif
+{
+  return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+	     && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+	 || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
+	     && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+  YYLTYPE yyls_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+      + 2 * YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)				\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack_alloc, Stack, yysize);			\
+	Stack = &yyptr->Stack_alloc;					\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (YYID (0))
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  YYSIZE_T yyi;				\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (YYID (0))
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  2
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   10
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  6
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  8
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  12
+/* YYNRULES -- Number of states.  */
+#define YYNSTATES  17
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   260
+
+#define YYTRANSLATE(YYX)						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const yytype_uint8 yyprhs[] =
+{
+       0,     0,     3,     4,     7,    10,    13,    17,    18,    21,
+      24,    28,    30
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS.  */
+static const yytype_int8 yyrhs[] =
+{
+       7,     0,    -1,    -1,     7,     4,    -1,     7,     8,    -1,
+       9,    10,    -1,     5,    12,     4,    -1,    -1,    10,    11,
+      -1,    12,     4,    -1,    12,    13,     4,    -1,     3,    -1,
+       3,    -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const yytype_uint8 yyrline[] =
+{
+       0,    94,    94,    95,    96,    99,   101,   103,   103,   105,
+     110,   119,   124
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "ALNUM", "NEWLINE", "HASH", "$accept",
+  "input", "vertex", "vertexdef", "edges", "edge", "edgeid", "weight", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,     6,     7,     7,     7,     8,     9,    10,    10,    11,
+      11,    12,    13
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     0,     2,     2,     2,     3,     0,     2,     2,
+       3,     1,     1
+};
+
+/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
+   Performed when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       2,     0,     1,     3,     0,     4,     7,    11,     0,     5,
+       6,     8,     0,    12,     9,     0,    10
+};
+
+/* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int8 yydefgoto[] =
+{
+      -1,     1,     5,     6,     9,    11,     8,    15
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -3
+static const yytype_int8 yypact[] =
+{
+      -3,     0,    -3,    -3,     3,    -3,    -3,    -3,    -1,     3,
+      -3,    -3,    -2,    -3,    -3,     4,    -3
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yytype_int8 yypgoto[] =
+{
+      -3,    -3,    -3,    -3,    -3,    -3,     1,    -3
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -1
+static const yytype_uint8 yytable[] =
+{
+       2,    13,    14,    10,     3,     4,     7,     0,    16,     0,
+      12
+};
+
+#define yypact_value_is_default(yystate) \
+  ((yystate) == (-3))
+
+#define yytable_value_is_error(yytable_value) \
+  YYID (0)
+
+static const yytype_int8 yycheck[] =
+{
+       0,     3,     4,     4,     4,     5,     3,    -1,     4,    -1,
+       9
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,     7,     0,     4,     5,     8,     9,     3,    12,    10,
+       4,    11,    12,     3,     4,    13,     4
+};
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  However,
+   YYFAIL appears to be in use.  Nevertheless, it is formally deprecated
+   in Bison 2.4.2's NEWS entry, where a plan to phase it out is
+   discussed.  */
+
+#define YYFAIL		goto yyerrlab
+#if defined YYFAIL
+  /* This is here to suppress warnings from the GCC cpp's
+     -Wunused-macros.  Normally we don't worry about that warning, but
+     some users do, and we want to make it easy for users to remove
+     YYFAIL uses, which will produce warnings from Bison 2.5.  */
+#endif
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      YYPOPSTACK (1);						\
+      goto yybackup;						\
+    }								\
+  else								\
+    {								\
+      yyerror (&yylloc, context, YY_("syntax error: cannot back up")); \
+      YYERROR;							\
+    }								\
+while (YYID (0))
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (YYID (N))                                                    \
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+	      (Loc).first_line, (Loc).first_column,	\
+	      (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, &yylloc, scanner)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)			  \
+do {									  \
+  if (yydebug)								  \
+    {									  \
+      YYFPRINTF (stderr, "%s ", Title);					  \
+      yy_symbol_print (stderr,						  \
+		  Type, Value, Location, context); \
+      YYFPRINTF (stderr, "\n");						  \
+    }									  \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_lgl_parsedata_t* context)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_lgl_parsedata_t* context;
+#endif
+{
+  if (!yyvaluep)
+    return;
+  YYUSE (yylocationp);
+  YYUSE (context);
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+  YYUSE (yyoutput);
+# endif
+  switch (yytype)
+    {
+      default:
+	break;
+    }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_lgl_parsedata_t* context)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_lgl_parsedata_t* context;
+#endif
+{
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+  YY_LOCATION_PRINT (yyoutput, *yylocationp);
+  YYFPRINTF (yyoutput, ": ");
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+    yytype_int16 *yybottom;
+    yytype_int16 *yytop;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, igraph_i_lgl_parsedata_t* context)
+#else
+static void
+yy_reduce_print (yyvsp, yylsp, yyrule, context)
+    YYSTYPE *yyvsp;
+    YYLTYPE *yylsp;
+    int yyrule;
+    igraph_i_lgl_parsedata_t* context;
+#endif
+{
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  unsigned long int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+	     yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+		       &(yyvsp[(yyi + 1) - (yynrhs)])
+		       , &(yylsp[(yyi + 1) - (yynrhs)])		       , context);
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (yyvsp, yylsp, Rule, context); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+    const char *yystr;
+#endif
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+    char *yydest;
+    const char *yysrc;
+#endif
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+	switch (*++yyp)
+	  {
+	  case '\'':
+	  case ',':
+	    goto do_not_strip_quotes;
+
+	  case '\\':
+	    if (*++yyp != '\\')
+	      goto do_not_strip_quotes;
+	    /* Fall through.  */
+	  default:
+	    if (yyres)
+	      yyres[yyn] = *yyp;
+	    yyn++;
+	    break;
+
+	  case '"':
+	    if (yyres)
+	      yyres[yyn] = '\0';
+	    return yyn;
+	  }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  YYSIZE_T yysize1;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = 0;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - Assume YYFAIL is not used.  It's too flawed to consider.  See
+       <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
+       for details.  YYERROR is fine as it does not invoke this
+       function.
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+                if (! (yysize <= yysize1
+                       && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                  return 2;
+                yysize = yysize1;
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  yysize1 = yysize + yystrlen (yyformat);
+  if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+    return 2;
+  yysize = yysize1;
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, igraph_i_lgl_parsedata_t* context)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep, yylocationp, context)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+    YYLTYPE *yylocationp;
+    igraph_i_lgl_parsedata_t* context;
+#endif
+{
+  YYUSE (yyvaluep);
+  YYUSE (yylocationp);
+  YYUSE (context);
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+
+      default:
+	break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (igraph_i_lgl_parsedata_t* context);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+    void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (igraph_i_lgl_parsedata_t* context)
+#else
+int
+yyparse (context)
+    igraph_i_lgl_parsedata_t* context;
+#endif
+#endif
+{
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+
+/* Location data for the lookahead symbol.  */
+YYLTYPE yylloc;
+
+    /* Number of syntax errors so far.  */
+    int yynerrs;
+
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       `yyss': related to states.
+       `yyvs': related to semantic values.
+       `yyls': related to locations.
+
+       Refer to the stacks thru separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    /* The location stack.  */
+    YYLTYPE yylsa[YYINITDEPTH];
+    YYLTYPE *yyls;
+    YYLTYPE *yylsp;
+
+    /* The locations where the error started and ended.  */
+    YYLTYPE yyerror_range[3];
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+  YYLTYPE yyloc;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yytoken = 0;
+  yyss = yyssa;
+  yyvs = yyvsa;
+  yyls = yylsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+  yyssp = yyss;
+  yyvsp = yyvs;
+  yylsp = yyls;
+
+#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+  /* Initialize the default location before parsing starts.  */
+  yylloc.first_line   = yylloc.last_line   = 1;
+  yylloc.first_column = yylloc.last_column = 1;
+#endif
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack.  Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	yytype_int16 *yyss1 = yyss;
+	YYLTYPE *yyls1 = yyls;
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow (YY_("memory exhausted"),
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+		    &yyls1, yysize * sizeof (*yylsp),
+		    &yystacksize);
+
+	yyls = yyls1;
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	yytype_int16 *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyexhaustedlab;
+	YYSTACK_RELOCATE (yyss_alloc, yyss);
+	YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+	YYSTACK_RELOCATE (yyls_alloc, yyls);
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+      yylsp = yyls + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  *++yyvsp = yylval;
+  *++yylsp = yylloc;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+  /* Default location.  */
+  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 6:
+
+/* Line 1806 of yacc.c  */
+#line 101 "foreign-lgl-parser.y"
+    { context->actvertex=(yyvsp[(2) - (3)].edgenum); }
+    break;
+
+  case 9:
+
+/* Line 1806 of yacc.c  */
+#line 105 "foreign-lgl-parser.y"
+    { 
+             igraph_vector_push_back(context->vector, context->actvertex);
+             igraph_vector_push_back(context->vector, (yyvsp[(1) - (2)].edgenum));
+             igraph_vector_push_back(context->weights, 0);
+           }
+    break;
+
+  case 10:
+
+/* Line 1806 of yacc.c  */
+#line 110 "foreign-lgl-parser.y"
+    { 
+	     igraph_vector_push_back(context->vector, context->actvertex);
+             igraph_vector_push_back(context->vector, (yyvsp[(1) - (3)].edgenum));
+             igraph_vector_push_back(context->weights, (yyvsp[(2) - (3)].weightnum));
+	     context->has_weights = 1;
+           }
+    break;
+
+  case 11:
+
+/* Line 1806 of yacc.c  */
+#line 119 "foreign-lgl-parser.y"
+    { igraph_trie_get2(context->trie, 
+				   igraph_lgl_yyget_text(scanner), 
+				   igraph_lgl_yyget_leng(scanner), 
+				   &(yyval.edgenum)); }
+    break;
+
+  case 12:
+
+/* Line 1806 of yacc.c  */
+#line 124 "foreign-lgl-parser.y"
+    { (yyval.weightnum)=igraph_lgl_get_number(igraph_lgl_yyget_text(scanner), 
+					   igraph_lgl_yyget_leng(scanner)); }
+    break;
+
+
+
+/* Line 1806 of yacc.c  */
+#line 1527 "foreign-lgl-parser.c"
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+  *++yylsp = yyloc;
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (&yylloc, context, YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (&yylloc, context, yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+  yyerror_range[1] = yylloc;
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+	{
+	  /* Return failure if at end of input.  */
+	  if (yychar == YYEOF)
+	    YYABORT;
+	}
+      else
+	{
+	  yydestruct ("Error: discarding",
+		      yytoken, &yylval, &yylloc, context);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  yyerror_range[1] = yylsp[1-yylen];
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+      yyerror_range[1] = *yylsp;
+      yydestruct ("Error: popping",
+		  yystos[yystate], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  *++yyvsp = yylval;
+
+  yyerror_range[2] = yylloc;
+  /* Using YYLLOC is tempting, but would change the location of
+     the lookahead.  YYLOC is available though.  */
+  YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
+  *++yylsp = yyloc;
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (&yylloc, context, YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval, &yylloc, context);
+    }
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+		  yystos[*yyssp], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  /* Make sure YYID is used.  */
+  return YYID (yyresult);
+}
+
+
+
+/* Line 2067 of yacc.c  */
+#line 127 "foreign-lgl-parser.y"
+
+
+int igraph_lgl_yyerror(YYLTYPE* locp, igraph_i_lgl_parsedata_t *context, 
+		       char *s) {
+  snprintf(context->errmsg, sizeof(context->errmsg)/sizeof(char), 
+	   "Parse error in LGL file, line %i (%s)", 
+	   locp->first_line, s);
+  return 0;
+}
+
+igraph_real_t igraph_lgl_get_number(const char *str, long int length) {
+  igraph_real_t num;
+  char *tmp=igraph_Calloc(length+1, char);
+  
+  strncpy(tmp, str, length);
+  tmp[length]='\0';
+  sscanf(tmp, "%lf", &num);
+  igraph_Free(tmp);
+  return num;
+} 
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-lgl-parser.h igraph-0.6.5/src/foreign-lgl-parser.h
--- igraph-0.6.5~quantal1/src/foreign-lgl-parser.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-lgl-parser.h	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,89 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison interface for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     ALNUM = 258,
+     NEWLINE = 259,
+     HASH = 260
+   };
+#endif
+/* Tokens.  */
+#define ALNUM 258
+#define NEWLINE 259
+#define HASH 260
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 2068 of yacc.c  */
+#line 80 "foreign-lgl-parser.y"
+
+  long int edgenum;
+  double weightnum;
+
+
+
+/* Line 2068 of yacc.c  */
+#line 67 "foreign-lgl-parser.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-ncol-lexer.c igraph-0.6.5/src/foreign-ncol-lexer.c
--- igraph-0.6.5~quantal1/src/foreign-ncol-lexer.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-ncol-lexer.c	2013-03-03 01:30:27.000000000 +0000
@@ -0,0 +1,2017 @@
+#line 2 "foreign-ncol-lexer.c"
+
+#line 4 "foreign-ncol-lexer.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else	/* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif	/* defined (__STDC__) */
+#endif	/* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE igraph_ncol_yyrestart(yyin ,yyscanner )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+    #define YY_LESS_LINENO(n)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	yy_size_t yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+    
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via igraph_ncol_yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void igraph_ncol_yyrestart (FILE *input_file ,yyscan_t yyscanner );
+void igraph_ncol_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_ncol_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner );
+void igraph_ncol_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_ncol_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_ncol_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+void igraph_ncol_yypop_buffer_state (yyscan_t yyscanner );
+
+static void igraph_ncol_yyensure_buffer_stack (yyscan_t yyscanner );
+static void igraph_ncol_yy_load_buffer_state (yyscan_t yyscanner );
+static void igraph_ncol_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
+
+#define YY_FLUSH_BUFFER igraph_ncol_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
+
+YY_BUFFER_STATE igraph_ncol_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_ncol_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_ncol_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner );
+
+void *igraph_ncol_yyalloc (yy_size_t ,yyscan_t yyscanner );
+void *igraph_ncol_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner );
+void igraph_ncol_yyfree (void * ,yyscan_t yyscanner );
+
+#define yy_new_buffer igraph_ncol_yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        igraph_ncol_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_ncol_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        igraph_ncol_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_ncol_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define igraph_ncol_yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state  ,yyscan_t yyscanner);
+static int yy_get_next_buffer (yyscan_t yyscanner );
+static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (size_t) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 4
+#define YY_END_OF_BUFFER 5
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static yyconst flex_int16_t yy_accept[12] =
+    {   0,
+        1,    1,    5,    3,    1,    2,    2,    3,    1,    2,
+        0
+    } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        1,    1,    4,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    2,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int32_t yy_meta[5] =
+    {   0,
+        1,    2,    3,    4
+    } ;
+
+static yyconst flex_int16_t yy_base[16] =
+    {   0,
+        0,    0,    9,    0,    0,    0,    0,    0,    0,   10,
+       10,    7,    5,    2,    2
+    } ;
+
+static yyconst flex_int16_t yy_def[16] =
+    {   0,
+       11,    1,   11,   12,   13,   14,   15,   12,   13,   11,
+        0,   11,   11,   11,   11
+    } ;
+
+static yyconst flex_int16_t yy_nxt[15] =
+    {   0,
+        4,    5,    6,    7,   10,   10,    9,    8,   11,    3,
+       11,   11,   11,   11
+    } ;
+
+static yyconst flex_int16_t yy_chk[15] =
+    {   0,
+        1,    1,    1,    1,   15,   14,   13,   12,    3,   11,
+       11,   11,   11,   11
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "foreign-ncol-lexer.l"
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#line 24 "foreign-ncol-lexer.l"
+
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include <stdlib.h>
+#include "foreign-ncol-parser.h"
+#include "foreign-ncol-header.h"
+#define YY_EXTRA_TYPE igraph_i_ncol_parsedata_t*
+#define YY_USER_ACTION yylloc->first_line = yylineno;
+/* We assume that 'file' is 'stderr' here. */
+#define fprintf(file, msg, ...) \
+  igraph_warningf(msg, __FILE__, __LINE__, 0, __VA_ARGS__)
+#ifdef stdout 
+#  undef stdout
+#endif
+#define stdout 0
+#define exit(code) igraph_error("Fatal error in DL parser", __FILE__, \
+				__LINE__, IGRAPH_PARSEERROR);
+#define YY_NO_INPUT 1
+#line 507 "foreign-ncol-lexer.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    YYSTYPE * yylval_r;
+
+    YYLTYPE * yylloc_r;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals (yyscan_t yyscanner );
+
+    /* This must go here because YYSTYPE and YYLTYPE are included
+     * from bison output in section 1.*/
+    #    define yylval yyg->yylval_r
+    
+    #    define yylloc yyg->yylloc_r
+    
+int igraph_ncol_yylex_init (yyscan_t* scanner);
+
+int igraph_ncol_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int igraph_ncol_yylex_destroy (yyscan_t yyscanner );
+
+int igraph_ncol_yyget_debug (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_debug (int debug_flag ,yyscan_t yyscanner );
+
+YY_EXTRA_TYPE igraph_ncol_yyget_extra (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
+
+FILE *igraph_ncol_yyget_in (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_in  (FILE * in_str ,yyscan_t yyscanner );
+
+FILE *igraph_ncol_yyget_out (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_out  (FILE * out_str ,yyscan_t yyscanner );
+
+int igraph_ncol_yyget_leng (yyscan_t yyscanner );
+
+char *igraph_ncol_yyget_text (yyscan_t yyscanner );
+
+int igraph_ncol_yyget_lineno (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_lineno (int line_number ,yyscan_t yyscanner );
+
+YYSTYPE * igraph_ncol_yyget_lval (yyscan_t yyscanner );
+
+void igraph_ncol_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner );
+
+       YYLTYPE *igraph_ncol_yyget_lloc (yyscan_t yyscanner );
+    
+        void igraph_ncol_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner );
+    
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int igraph_ncol_yywrap (yyscan_t yyscanner );
+#else
+extern int igraph_ncol_yywrap (yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (yyscan_t yyscanner );
+#else
+static int input (yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		size_t n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int igraph_ncol_yylex \
+               (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner);
+
+#define YY_DECL int igraph_ncol_yylex \
+               (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp, *yy_bp;
+	register int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+#line 75 "foreign-ncol-lexer.l"
+
+
+ /* ------------------------------------------------whitespace------*/
+#line 755 "foreign-ncol-lexer.c"
+
+    yylval = yylval_param;
+
+    yylloc = yylloc_param;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			igraph_ncol_yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				igraph_ncol_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+		}
+
+		igraph_ncol_yy_load_buffer_state(yyscanner );
+		}
+
+	while ( 1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 12 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 10 );
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+		if ( yy_act == 0 )
+			{ /* have to back up */
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			yy_act = yy_accept[yy_current_state];
+			}
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 78 "foreign-ncol-lexer.l"
+{ }
+	YY_BREAK
+/* ---------------------------------------------------newline------*/
+case 2:
+/* rule 2 can match eol */
+YY_RULE_SETUP
+#line 81 "foreign-ncol-lexer.l"
+{ return NEWLINE; }
+	YY_BREAK
+/* ----------------------------------------------alphanumeric------*/
+case 3:
+YY_RULE_SETUP
+#line 84 "foreign-ncol-lexer.l"
+{ return ALNUM; }
+	YY_BREAK
+case YY_STATE_EOF(INITIAL):
+#line 86 "foreign-ncol-lexer.l"
+{ if (yyextra->eof) {
+                       yyterminate();
+                    } else {
+                       yyextra->eof=1;
+                       return NEWLINE; 
+                    }
+                  }
+	YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 94 "foreign-ncol-lexer.l"
+ECHO;
+	YY_BREAK
+#line 875 "foreign-ncol-lexer.c"
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * igraph_ncol_yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_c_buf_p;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( igraph_ncol_yywrap(yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+} /* end of igraph_ncol_yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	register char *source = yyg->yytext_ptr;
+	register int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1;
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					igraph_ncol_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = 0;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, (size_t) num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			igraph_ncol_yyrestart(yyin  ,yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) igraph_ncol_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 12 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	register int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	register char *yy_cp = yyg->yy_c_buf_p;
+
+	register YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 12 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	yy_is_jam = (yy_current_state == 11);
+
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					igraph_ncol_yyrestart(yyin ,yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( igraph_ncol_yywrap(yyscanner ) )
+						return EOF;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void igraph_ncol_yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        igraph_ncol_yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            igraph_ncol_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+	}
+
+	igraph_ncol_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
+	igraph_ncol_yy_load_buffer_state(yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_ncol_yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		igraph_ncol_yypop_buffer_state();
+	 *		igraph_ncol_yypush_buffer_state(new_buffer);
+     */
+	igraph_ncol_yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	igraph_ncol_yy_load_buffer_state(yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (igraph_ncol_yywrap()) processing, but the only time this flag
+	 * is looked at is after igraph_ncol_yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void igraph_ncol_yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE igraph_ncol_yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) igraph_ncol_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) igraph_ncol_yyalloc(b->yy_buf_size + 2 ,yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	igraph_ncol_yy_init_buffer(b,file ,yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with igraph_ncol_yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void igraph_ncol_yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		igraph_ncol_yyfree((void *) b->yy_ch_buf ,yyscanner );
+
+	igraph_ncol_yyfree((void *) b ,yyscanner );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+    
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a igraph_ncol_yyrestart() or at EOF.
+ */
+    static void igraph_ncol_yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	igraph_ncol_yy_flush_buffer(b ,yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then igraph_ncol_yy_init_buffer was _probably_
+     * called from igraph_ncol_yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_ncol_yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		igraph_ncol_yy_load_buffer_state(yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_ncol_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	igraph_ncol_yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from igraph_ncol_yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from igraph_ncol_yy_switch_to_buffer. */
+	igraph_ncol_yy_load_buffer_state(yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_ncol_yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	igraph_ncol_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		igraph_ncol_yy_load_buffer_state(yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void igraph_ncol_yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	int num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+		num_to_alloc = 1;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_ncol_yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yyensure_buffer_stack()" );
+								  
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+				
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		int grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_ncol_yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object. 
+ */
+YY_BUFFER_STATE igraph_ncol_yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return 0;
+
+	b = (YY_BUFFER_STATE) igraph_ncol_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yy_scan_buffer()" );
+
+	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = 0;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	igraph_ncol_yy_switch_to_buffer(b ,yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to igraph_ncol_yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       igraph_ncol_yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE igraph_ncol_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner)
+{
+    
+	return igraph_ncol_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to igraph_ncol_yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE igraph_ncol_yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = _yybytes_len + 2;
+	buf = (char *) igraph_ncol_yyalloc(n ,yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_ncol_yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = igraph_ncol_yy_scan_buffer(buf,n ,yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in igraph_ncol_yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner)
+{
+    	(void) fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE igraph_ncol_yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_ncol_yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_ncol_yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_ncol_yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_ncol_yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int igraph_ncol_yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *igraph_ncol_yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void igraph_ncol_yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_ncol_yyset_lineno (int  line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_ncol_yyset_lineno called with no buffer" , yyscanner); 
+    
+    yylineno = line_number;
+}
+
+/** Set the current column.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_ncol_yyset_column (int  column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_ncol_yyset_column called with no buffer" , yyscanner); 
+    
+    yycolumn = column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see igraph_ncol_yy_switch_to_buffer
+ */
+void igraph_ncol_yyset_in (FILE *  in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = in_str ;
+}
+
+void igraph_ncol_yyset_out (FILE *  out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = out_str ;
+}
+
+int igraph_ncol_yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void igraph_ncol_yyset_debug (int  bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+YYSTYPE * igraph_ncol_yyget_lval  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylval;
+}
+
+void igraph_ncol_yyset_lval (YYSTYPE *  yylval_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylval = yylval_param;
+}
+
+YYLTYPE *igraph_ncol_yyget_lloc  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylloc;
+}
+    
+void igraph_ncol_yyset_lloc (YYLTYPE *  yylloc_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylloc = yylloc_param;
+}
+    
+/* User-visible API */
+
+/* igraph_ncol_yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+
+int igraph_ncol_yylex_init(yyscan_t* ptr_yy_globals)
+
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) igraph_ncol_yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* igraph_ncol_yylex_init_extra has the same functionality as igraph_ncol_yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to igraph_ncol_yyalloc in
+ * the yyextra field.
+ */
+
+int igraph_ncol_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
+
+{
+    struct yyguts_t dummy_yyguts;
+
+    igraph_ncol_yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+	
+    *ptr_yy_globals = (yyscan_t) igraph_ncol_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+	
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+    
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+    
+    igraph_ncol_yyset_extra (yy_user_defined, *ptr_yy_globals);
+    
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from igraph_ncol_yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = 0;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = (char *) 0;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = (FILE *) 0;
+    yyout = (FILE *) 0;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * igraph_ncol_yylex_init()
+     */
+    return 0;
+}
+
+/* igraph_ncol_yylex_destroy is for both reentrant and non-reentrant scanners. */
+int igraph_ncol_yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		igraph_ncol_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		igraph_ncol_yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	igraph_ncol_yyfree(yyg->yy_buffer_stack ,yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        igraph_ncol_yyfree(yyg->yy_start_stack ,yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * igraph_ncol_yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    igraph_ncol_yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
+{
+	register int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner)
+{
+	register int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *igraph_ncol_yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	return (void *) malloc( size );
+}
+
+void *igraph_ncol_yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return (void *) realloc( (char *) ptr, size );
+}
+
+void igraph_ncol_yyfree (void * ptr , yyscan_t yyscanner)
+{
+	free( (char *) ptr );	/* see igraph_ncol_yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 94 "foreign-ncol-lexer.l"
+
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-ncol-parser.c igraph-0.6.5/src/foreign-ncol-parser.c
--- igraph-0.6.5~quantal1/src/foreign-ncol-parser.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-ncol-parser.c	2013-03-03 01:30:10.000000000 +0000
@@ -0,0 +1,1773 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison implementation for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "2.5"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 1
+
+/* Substitute the variable and function names.  */
+#define yyparse         igraph_ncol_yyparse
+#define yylex           igraph_ncol_yylex
+#define yyerror         igraph_ncol_yyerror
+#define yylval          igraph_ncol_yylval
+#define yychar          igraph_ncol_yychar
+#define yydebug         igraph_ncol_yydebug
+#define yynerrs         igraph_ncol_yynerrs
+#define yylloc          igraph_ncol_yylloc
+
+/* Copy the first part of user declarations.  */
+
+/* Line 268 of yacc.c  */
+#line 23 "foreign-ncol-parser.y"
+
+
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include <stdio.h>
+#include <string.h>
+#include "igraph_hacks_internal.h"
+#include "igraph_types.h" 
+#include "igraph_types_internal.h"
+#include "igraph_math.h"
+#include "igraph_memory.h"
+#include "igraph_error.h"
+#include "config.h"
+#include "foreign-ncol-header.h"
+#include "foreign-ncol-parser.h"
+
+#define yyscan_t void*
+
+int igraph_ncol_yylex(YYSTYPE* lvalp, YYLTYPE* llocp, 
+		      void* scanner);
+int igraph_ncol_yyerror(YYLTYPE* locp, 
+			igraph_i_ncol_parsedata_t *context, 
+			char *s);
+char *igraph_ncol_yyget_text (yyscan_t yyscanner );
+int igraph_ncol_yyget_leng (yyscan_t yyscanner );
+igraph_real_t igraph_ncol_get_number(const char *str, long int len);
+
+#define scanner context->scanner
+
+
+/* Line 268 of yacc.c  */
+#line 130 "foreign-ncol-parser.c"
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 1
+#endif
+
+/* Enabling the token table.  */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     ALNUM = 258,
+     NEWLINE = 259
+   };
+#endif
+/* Tokens.  */
+#define ALNUM 258
+#define NEWLINE 259
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 293 of yacc.c  */
+#line 82 "foreign-ncol-parser.y"
+
+  long int edgenum;
+  double weightnum;
+
+
+
+/* Line 293 of yacc.c  */
+#line 181 "foreign-ncol-parser.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+/* Copy the second part of user declarations.  */
+
+
+/* Line 343 of yacc.c  */
+#line 206 "foreign-ncol-parser.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(msgid) dgettext ("bison-runtime", msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions.  */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+    int yyi;
+#endif
+{
+  return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+	     && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+	 || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
+	     && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+  YYLTYPE yyls_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+      + 2 * YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)				\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack_alloc, Stack, yysize);			\
+	Stack = &yyptr->Stack_alloc;					\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (YYID (0))
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  YYSIZE_T yyi;				\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (YYID (0))
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  2
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   10
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  5
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  5
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  8
+/* YYNRULES -- Number of states.  */
+#define YYNSTATES  12
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   259
+
+#define YYTRANSLATE(YYX)						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const yytype_uint8 yyprhs[] =
+{
+       0,     0,     3,     4,     7,    10,    14,    19,    21
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS.  */
+static const yytype_int8 yyrhs[] =
+{
+       6,     0,    -1,    -1,     6,     4,    -1,     6,     7,    -1,
+       8,     8,     4,    -1,     8,     8,     9,     4,    -1,     3,
+      -1,     3,    -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const yytype_uint8 yyrline[] =
+{
+       0,    95,    95,    96,    97,   100,   105,   113,   118
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "ALNUM", "NEWLINE", "$accept", "input",
+  "edge", "edgeid", "weight", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,     5,     6,     6,     6,     7,     7,     8,     9
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     0,     2,     2,     3,     4,     1,     1
+};
+
+/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
+   Performed when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       2,     0,     1,     7,     3,     4,     0,     0,     8,     5,
+       0,     6
+};
+
+/* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int8 yydefgoto[] =
+{
+      -1,     1,     5,     6,    10
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -3
+static const yytype_int8 yypact[] =
+{
+      -3,     0,    -3,    -3,    -3,    -3,     2,    -2,    -3,    -3,
+       3,    -3
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yytype_int8 yypgoto[] =
+{
+      -3,    -3,    -3,     4,    -3
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -1
+static const yytype_uint8 yytable[] =
+{
+       2,     8,     9,     3,     4,     3,     0,    11,     0,     0,
+       7
+};
+
+#define yypact_value_is_default(yystate) \
+  ((yystate) == (-3))
+
+#define yytable_value_is_error(yytable_value) \
+  YYID (0)
+
+static const yytype_int8 yycheck[] =
+{
+       0,     3,     4,     3,     4,     3,    -1,     4,    -1,    -1,
+       6
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,     6,     0,     3,     4,     7,     8,     8,     3,     4,
+       9,     4
+};
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  However,
+   YYFAIL appears to be in use.  Nevertheless, it is formally deprecated
+   in Bison 2.4.2's NEWS entry, where a plan to phase it out is
+   discussed.  */
+
+#define YYFAIL		goto yyerrlab
+#if defined YYFAIL
+  /* This is here to suppress warnings from the GCC cpp's
+     -Wunused-macros.  Normally we don't worry about that warning, but
+     some users do, and we want to make it easy for users to remove
+     YYFAIL uses, which will produce warnings from Bison 2.5.  */
+#endif
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      YYPOPSTACK (1);						\
+      goto yybackup;						\
+    }								\
+  else								\
+    {								\
+      yyerror (&yylloc, context, YY_("syntax error: cannot back up")); \
+      YYERROR;							\
+    }								\
+while (YYID (0))
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (YYID (N))                                                    \
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+	      (Loc).first_line, (Loc).first_column,	\
+	      (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, &yylloc, scanner)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)			  \
+do {									  \
+  if (yydebug)								  \
+    {									  \
+      YYFPRINTF (stderr, "%s ", Title);					  \
+      yy_symbol_print (stderr,						  \
+		  Type, Value, Location, context); \
+      YYFPRINTF (stderr, "\n");						  \
+    }									  \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_ncol_parsedata_t* context)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_ncol_parsedata_t* context;
+#endif
+{
+  if (!yyvaluep)
+    return;
+  YYUSE (yylocationp);
+  YYUSE (context);
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+  YYUSE (yyoutput);
+# endif
+  switch (yytype)
+    {
+      default:
+	break;
+    }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_ncol_parsedata_t* context)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_ncol_parsedata_t* context;
+#endif
+{
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+  YY_LOCATION_PRINT (yyoutput, *yylocationp);
+  YYFPRINTF (yyoutput, ": ");
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+    yytype_int16 *yybottom;
+    yytype_int16 *yytop;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, igraph_i_ncol_parsedata_t* context)
+#else
+static void
+yy_reduce_print (yyvsp, yylsp, yyrule, context)
+    YYSTYPE *yyvsp;
+    YYLTYPE *yylsp;
+    int yyrule;
+    igraph_i_ncol_parsedata_t* context;
+#endif
+{
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  unsigned long int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+	     yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+		       &(yyvsp[(yyi + 1) - (yynrhs)])
+		       , &(yylsp[(yyi + 1) - (yynrhs)])		       , context);
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (yyvsp, yylsp, Rule, context); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+    const char *yystr;
+#endif
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+    char *yydest;
+    const char *yysrc;
+#endif
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+	switch (*++yyp)
+	  {
+	  case '\'':
+	  case ',':
+	    goto do_not_strip_quotes;
+
+	  case '\\':
+	    if (*++yyp != '\\')
+	      goto do_not_strip_quotes;
+	    /* Fall through.  */
+	  default:
+	    if (yyres)
+	      yyres[yyn] = *yyp;
+	    yyn++;
+	    break;
+
+	  case '"':
+	    if (yyres)
+	      yyres[yyn] = '\0';
+	    return yyn;
+	  }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  YYSIZE_T yysize1;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = 0;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - Assume YYFAIL is not used.  It's too flawed to consider.  See
+       <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
+       for details.  YYERROR is fine as it does not invoke this
+       function.
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+                if (! (yysize <= yysize1
+                       && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                  return 2;
+                yysize = yysize1;
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  yysize1 = yysize + yystrlen (yyformat);
+  if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+    return 2;
+  yysize = yysize1;
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, igraph_i_ncol_parsedata_t* context)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep, yylocationp, context)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+    YYLTYPE *yylocationp;
+    igraph_i_ncol_parsedata_t* context;
+#endif
+{
+  YYUSE (yyvaluep);
+  YYUSE (yylocationp);
+  YYUSE (context);
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+
+      default:
+	break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (igraph_i_ncol_parsedata_t* context);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+    void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (igraph_i_ncol_parsedata_t* context)
+#else
+int
+yyparse (context)
+    igraph_i_ncol_parsedata_t* context;
+#endif
+#endif
+{
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+
+/* Location data for the lookahead symbol.  */
+YYLTYPE yylloc;
+
+    /* Number of syntax errors so far.  */
+    int yynerrs;
+
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       `yyss': related to states.
+       `yyvs': related to semantic values.
+       `yyls': related to locations.
+
+       Refer to the stacks thru separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    /* The location stack.  */
+    YYLTYPE yylsa[YYINITDEPTH];
+    YYLTYPE *yyls;
+    YYLTYPE *yylsp;
+
+    /* The locations where the error started and ended.  */
+    YYLTYPE yyerror_range[3];
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+  YYLTYPE yyloc;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yytoken = 0;
+  yyss = yyssa;
+  yyvs = yyvsa;
+  yyls = yylsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+  yyssp = yyss;
+  yyvsp = yyvs;
+  yylsp = yyls;
+
+#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+  /* Initialize the default location before parsing starts.  */
+  yylloc.first_line   = yylloc.last_line   = 1;
+  yylloc.first_column = yylloc.last_column = 1;
+#endif
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack.  Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	yytype_int16 *yyss1 = yyss;
+	YYLTYPE *yyls1 = yyls;
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow (YY_("memory exhausted"),
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+		    &yyls1, yysize * sizeof (*yylsp),
+		    &yystacksize);
+
+	yyls = yyls1;
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	yytype_int16 *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyexhaustedlab;
+	YYSTACK_RELOCATE (yyss_alloc, yyss);
+	YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+	YYSTACK_RELOCATE (yyls_alloc, yyls);
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+      yylsp = yyls + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  *++yyvsp = yylval;
+  *++yylsp = yylloc;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+  /* Default location.  */
+  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 5:
+
+/* Line 1806 of yacc.c  */
+#line 100 "foreign-ncol-parser.y"
+    { 
+           igraph_vector_push_back(context->vector, (yyvsp[(1) - (3)].edgenum));
+           igraph_vector_push_back(context->vector, (yyvsp[(2) - (3)].edgenum));
+           igraph_vector_push_back(context->weights, 0);
+       }
+    break;
+
+  case 6:
+
+/* Line 1806 of yacc.c  */
+#line 105 "foreign-ncol-parser.y"
+    { 
+           igraph_vector_push_back(context->vector, (yyvsp[(1) - (4)].edgenum));
+           igraph_vector_push_back(context->vector, (yyvsp[(2) - (4)].edgenum));
+           igraph_vector_push_back(context->weights, (yyvsp[(3) - (4)].weightnum));
+	   context->has_weights = 1;
+       }
+    break;
+
+  case 7:
+
+/* Line 1806 of yacc.c  */
+#line 113 "foreign-ncol-parser.y"
+    { igraph_trie_get2(context->trie, 
+				   igraph_ncol_yyget_text(scanner),
+				   igraph_ncol_yyget_leng(scanner), 
+				   &(yyval.edgenum)); }
+    break;
+
+  case 8:
+
+/* Line 1806 of yacc.c  */
+#line 118 "foreign-ncol-parser.y"
+    { (yyval.weightnum)=igraph_ncol_get_number(igraph_ncol_yyget_text(scanner), 
+					    igraph_ncol_yyget_leng(scanner)); }
+    break;
+
+
+
+/* Line 1806 of yacc.c  */
+#line 1514 "foreign-ncol-parser.c"
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+  *++yylsp = yyloc;
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (&yylloc, context, YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (&yylloc, context, yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+  yyerror_range[1] = yylloc;
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+	{
+	  /* Return failure if at end of input.  */
+	  if (yychar == YYEOF)
+	    YYABORT;
+	}
+      else
+	{
+	  yydestruct ("Error: discarding",
+		      yytoken, &yylval, &yylloc, context);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  yyerror_range[1] = yylsp[1-yylen];
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+      yyerror_range[1] = *yylsp;
+      yydestruct ("Error: popping",
+		  yystos[yystate], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  *++yyvsp = yylval;
+
+  yyerror_range[2] = yylloc;
+  /* Using YYLLOC is tempting, but would change the location of
+     the lookahead.  YYLOC is available though.  */
+  YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
+  *++yylsp = yyloc;
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (&yylloc, context, YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval, &yylloc, context);
+    }
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+		  yystos[*yyssp], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  /* Make sure YYID is used.  */
+  return YYID (yyresult);
+}
+
+
+
+/* Line 2067 of yacc.c  */
+#line 121 "foreign-ncol-parser.y"
+
+
+int igraph_ncol_yyerror(YYLTYPE* locp, 
+			igraph_i_ncol_parsedata_t *context, 
+			char *s) {
+  snprintf(context->errmsg, sizeof(context->errmsg)/sizeof(char)-1, 
+	   "Parse error in NCOL file, line %i (%s)", 
+	   locp->first_line, s);
+  return 0;
+}
+
+igraph_real_t igraph_ncol_get_number(const char *str, long int length) {
+  igraph_real_t num;
+  char *tmp=igraph_Calloc(length+1, char);
+  
+  strncpy(tmp, str, length);
+  tmp[length]='\0';
+  sscanf(tmp, "%lf", &num);
+  igraph_Free(tmp);
+  return num;
+} 
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-ncol-parser.h igraph-0.6.5/src/foreign-ncol-parser.h
--- igraph-0.6.5~quantal1/src/foreign-ncol-parser.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-ncol-parser.h	2013-03-03 01:30:10.000000000 +0000
@@ -0,0 +1,87 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison interface for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     ALNUM = 258,
+     NEWLINE = 259
+   };
+#endif
+/* Tokens.  */
+#define ALNUM 258
+#define NEWLINE 259
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 2068 of yacc.c  */
+#line 82 "foreign-ncol-parser.y"
+
+  long int edgenum;
+  double weightnum;
+
+
+
+/* Line 2068 of yacc.c  */
+#line 65 "foreign-ncol-parser.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-pajek-lexer.c igraph-0.6.5/src/foreign-pajek-lexer.c
--- igraph-0.6.5~quantal1/src/foreign-pajek-lexer.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-pajek-lexer.c	2013-03-03 01:30:29.000000000 +0000
@@ -0,0 +1,2473 @@
+#line 2 "foreign-pajek-lexer.c"
+
+#line 4 "foreign-pajek-lexer.c"
+
+#define  YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with  platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types. 
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t; 
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN               (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN              (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN              (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX               (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX              (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX              (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX              (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX             (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX             (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else	/* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif	/* defined (__STDC__) */
+#endif	/* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* An opaque pointer. */
+#ifndef YY_TYPEDEF_YY_SCANNER_T
+#define YY_TYPEDEF_YY_SCANNER_T
+typedef void* yyscan_t;
+#endif
+
+/* For convenience, these vars (plus the bison vars far below)
+   are macros in the reentrant scanner. */
+#define yyin yyg->yyin_r
+#define yyout yyg->yyout_r
+#define yyextra yyg->yyextra_r
+#define yyleng yyg->yyleng_r
+#define yytext yyg->yytext_r
+#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno)
+#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column)
+#define yy_flex_debug yyg->yy_flex_debug_r
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yyg->yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yyg->yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE igraph_pajek_yyrestart(yyin ,yyscanner )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE   ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+    #define YY_LESS_LINENO(n)
+    
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		*yy_cp = yyg->yy_hold_char; \
+		YY_RESTORE_YY_MORE_OFFSET \
+		yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+		YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+		} \
+	while ( 0 )
+
+#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+	{
+	FILE *yy_input_file;
+
+	char *yy_ch_buf;		/* input buffer */
+	char *yy_buf_pos;		/* current position in input buffer */
+
+	/* Size of input buffer in bytes, not including room for EOB
+	 * characters.
+	 */
+	yy_size_t yy_buf_size;
+
+	/* Number of characters read into yy_ch_buf, not including EOB
+	 * characters.
+	 */
+	int yy_n_chars;
+
+	/* Whether we "own" the buffer - i.e., we know we created it,
+	 * and can realloc() it to grow it, and should free() it to
+	 * delete it.
+	 */
+	int yy_is_our_buffer;
+
+	/* Whether this is an "interactive" input source; if so, and
+	 * if we're using stdio for input, then we want to use getc()
+	 * instead of fread(), to make sure we stop fetching input after
+	 * each newline.
+	 */
+	int yy_is_interactive;
+
+	/* Whether we're considered to be at the beginning of a line.
+	 * If so, '^' rules will be active on the next match, otherwise
+	 * not.
+	 */
+	int yy_at_bol;
+
+    int yy_bs_lineno; /**< The line count. */
+    int yy_bs_column; /**< The column count. */
+    
+	/* Whether to try to fill the input buffer when we reach the
+	 * end of it.
+	 */
+	int yy_fill_buffer;
+
+	int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+	/* When an EOF's been seen but there's still some text to process
+	 * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+	 * shouldn't try reading from the input source any more.  We might
+	 * still have a bunch of tokens to match, though, because of
+	 * possible backing-up.
+	 *
+	 * When we actually see the EOF, we change the status to "new"
+	 * (via igraph_pajek_yyrestart()), so that the user can continue scanning by
+	 * just pointing yyin at a new input file.
+	 */
+#define YY_BUFFER_EOF_PENDING 2
+
+	};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \
+                          ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \
+                          : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top]
+
+void igraph_pajek_yyrestart (FILE *input_file ,yyscan_t yyscanner );
+void igraph_pajek_yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_pajek_yy_create_buffer (FILE *file,int size ,yyscan_t yyscanner );
+void igraph_pajek_yy_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_pajek_yy_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner );
+void igraph_pajek_yypush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner );
+void igraph_pajek_yypop_buffer_state (yyscan_t yyscanner );
+
+static void igraph_pajek_yyensure_buffer_stack (yyscan_t yyscanner );
+static void igraph_pajek_yy_load_buffer_state (yyscan_t yyscanner );
+static void igraph_pajek_yy_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner );
+
+#define YY_FLUSH_BUFFER igraph_pajek_yy_flush_buffer(YY_CURRENT_BUFFER ,yyscanner)
+
+YY_BUFFER_STATE igraph_pajek_yy_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_pajek_yy_scan_string (yyconst char *yy_str ,yyscan_t yyscanner );
+YY_BUFFER_STATE igraph_pajek_yy_scan_bytes (yyconst char *bytes,int len ,yyscan_t yyscanner );
+
+void *igraph_pajek_yyalloc (yy_size_t ,yyscan_t yyscanner );
+void *igraph_pajek_yyrealloc (void *,yy_size_t ,yyscan_t yyscanner );
+void igraph_pajek_yyfree (void * ,yyscan_t yyscanner );
+
+#define yy_new_buffer igraph_pajek_yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){ \
+        igraph_pajek_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_pajek_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+	}
+
+#define yy_set_bol(at_bol) \
+	{ \
+	if ( ! YY_CURRENT_BUFFER ){\
+        igraph_pajek_yyensure_buffer_stack (yyscanner); \
+		YY_CURRENT_BUFFER_LVALUE =    \
+            igraph_pajek_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \
+	} \
+	YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+	}
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define igraph_pajek_yywrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+typedef int yy_state_type;
+
+#define yytext_ptr yytext_r
+
+static yy_state_type yy_get_previous_state (yyscan_t yyscanner );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state  ,yyscan_t yyscanner);
+static int yy_get_next_buffer (yyscan_t yyscanner );
+static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+	yyg->yytext_ptr = yy_bp; \
+	yyleng = (size_t) (yy_cp - yy_bp); \
+	yyg->yy_hold_char = *yy_cp; \
+	*yy_cp = '\0'; \
+	yyg->yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 46
+#define YY_END_OF_BUFFER 47
+/* This struct is not used in this scanner,
+   but its presence is necessary. */
+struct yy_trans_info
+	{
+	flex_int32_t yy_verify;
+	flex_int32_t yy_nxt;
+	};
+static yyconst flex_int16_t yy_accept[160] =
+    {   0,
+        1,    1,   47,   45,    1,   11,   11,   45,   45,   45,
+       45,   45,   14,   45,   45,   45,   45,   45,   45,   45,
+       45,   45,   45,   45,   45,   45,   45,   45,   45,   45,
+        1,   11,   45,    0,   12,   45,    0,    2,    3,   45,
+        0,   13,   45,   45,   45,   45,   45,   14,   45,   45,
+       28,   45,   45,   45,   45,   45,   25,   45,   45,   45,
+       45,   45,   45,   37,   45,   45,   45,   45,   26,   45,
+       22,   21,   27,   45,   45,   29,   45,   45,   12,    2,
+        2,   13,   45,   45,   45,   45,   45,   14,   45,   14,
+       32,   33,   36,   18,   19,   45,   45,   30,   31,   17,
+
+       34,   35,   42,   40,   38,   45,   41,   45,   45,   45,
+       45,   45,    3,   45,   45,   45,   45,   45,   45,   44,
+       45,   20,   45,   24,   45,   45,    6,   45,   45,   45,
+       45,   23,   39,   43,   45,   45,   45,    7,   45,   45,
+       45,   45,   45,   45,   45,   10,   45,   45,   15,   16,
+       45,   45,    4,   45,    8,   45,    5,    9,    0
+    } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        1,    1,    4,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    2,    1,    5,    1,    1,    6,    1,    1,    7,
+        8,    9,   10,    1,   11,   12,    1,   13,   14,   15,
+       13,   13,   13,   13,   13,   13,   13,    1,    1,    1,
+        1,    1,    1,    1,   16,   17,   18,   19,   20,   21,
+       22,   23,   24,    1,   25,   26,   27,   28,   29,   30,
+       31,   32,   33,   34,   35,   36,   37,   38,   39,   40,
+        1,    1,    1,    1,   41,    1,   16,   17,   18,   19,
+
+       20,   21,   22,   23,   24,    1,   25,   26,   27,   28,
+       29,   30,   31,   32,   33,   34,   35,   36,   37,   38,
+       39,   40,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst flex_int32_t yy_meta[42] =
+    {   0,
+        1,    2,    2,    2,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1
+    } ;
+
+static yyconst flex_int16_t yy_base[167] =
+    {   0,
+        0,    0,  288,    0,  285,  282,  282,   40,   44,   47,
+       36,   44,   53,   67,   42,   72,  255,   39,  265,   47,
+       96,   81,   84,   87,   91,  250,   99,  240,  239,    0,
+      277,  289,  103,  273,    0,  107,   74,  273,  113,  116,
+      268,    0,  243,  255,  257,  252,  251,  117,  108,  125,
+      289,  139,  142,  145,  148,  151,  289,  128,  155,  160,
+      163,  166,  169,  289,  172,  175,  178,  181,  289,  246,
+      289,  289,  289,  229,  242,  289,  246,  245,  289,  261,
+      130,  289,  246,  241,  228,  227,  228,  173,  176,  181,
+      289,  289,  289,  289,  289,  225,  195,  289,  289,  289,
+
+      289,  289,  289,  289,  289,  234,  289,  200,  237,  203,
+      240,  239,  251,  220,  232,  219,  213,  215,  206,  289,
+      209,  289,  212,  289,  230,  229,  220,  212,  220,  214,
+      218,  289,  289,  289,  207,  206,  215,  212,  199,  204,
+      217,  215,  218,  167,  168,    0,  135,  107,  289,  289,
+       91,   80,    0,   63,    0,   58,    0,    0,  289,   79,
+      222,  224,  226,  228,  230,  232
+    } ;
+
+static yyconst flex_int16_t yy_def[167] =
+    {   0,
+      159,    1,  159,  160,  159,  159,  159,  161,  162,  163,
+      160,  160,  160,  160,  160,  160,  160,  160,  160,  160,
+      160,  160,  160,  160,  160,  160,  160,  160,  160,  160,
+      159,  159,  161,  164,  160,  162,  165,  159,  165,  163,
+      166,  160,  160,  160,  160,  160,  160,  160,  160,  160,
+      159,  160,  160,  160,  160,  160,  159,  160,  160,  160,
+      160,  160,  160,  159,  160,  160,  160,  160,  159,  160,
+      159,  159,  159,  160,  160,  159,  160,  160,  159,  159,
+      159,  159,  160,  160,  160,  160,  160,  160,  160,  160,
+      159,  159,  159,  159,  159,  160,  160,  159,  159,  159,
+
+      159,  159,  159,  159,  159,  160,  159,  160,  160,  160,
+      160,  160,  159,  160,  160,  160,  160,  160,  160,  159,
+      160,  159,  160,  159,  160,  160,  160,  160,  160,  160,
+      160,  159,  159,  159,  160,  160,  160,  160,  160,  160,
+      160,  160,  160,  160,  160,  160,  160,  160,  159,  159,
+      160,  160,  160,  160,  160,  160,  160,  160,    0,  159,
+      159,  159,  159,  159,  159,  159
+    } ;
+
+static yyconst flex_int16_t yy_nxt[331] =
+    {   0,
+        4,    5,    6,    7,    8,    9,   10,    4,   11,    4,
+       12,    4,   13,   13,   13,   14,   15,   16,    4,    4,
+       17,    4,   18,   19,   20,   21,    4,    4,    4,   22,
+       23,   24,   25,    4,   26,    4,   27,   28,   29,    4,
+        4,   34,   34,   34,   35,   37,   38,   39,   41,   41,
+       41,   43,   59,   60,   42,   44,   48,   48,   48,   55,
+       62,   63,   45,   46,   49,   48,   48,   48,   51,   51,
+       51,   47,   50,   57,   57,   57,   38,   39,   56,   30,
+       52,   53,   69,   69,   69,   71,   71,   71,   72,   72,
+       72,  158,   73,   73,   73,  157,   54,   64,   64,   64,
+
+       76,   76,   76,   70,   34,   34,   34,   35,   37,   38,
+       39,   65,  156,   66,   74,   81,   39,   41,   41,   41,
+       88,   88,   88,   42,  155,   67,  154,   68,   49,   48,
+       48,   48,  113,   80,   89,   89,   50,   90,   90,   90,
+       91,   91,   91,   92,   92,   92,   93,   93,   93,   94,
+       94,   94,   95,   95,   95,   96,   98,   98,   98,  153,
+       97,   99,   99,   99,  100,  100,  100,  101,  101,  101,
+      102,  102,  102,  103,  103,  103,  104,  104,  104,  105,
+      105,  105,  107,  107,  107,   88,   88,   88,   90,   90,
+       90,  152,   50,   90,   90,   90,  120,  120,  120,  151,
+
+      106,  122,  122,  122,  124,  124,  124,  132,  132,  132,
+      133,  133,  133,  134,  134,  134,  149,  149,  149,  150,
+      150,  150,   33,   33,   36,   36,   40,   40,   34,   34,
+       37,   37,   41,   41,  148,  147,  146,  145,  144,  143,
+      142,  141,  140,  139,  138,  137,  136,  135,  131,  130,
+      129,  128,  127,  113,  126,  125,  123,  121,  119,  118,
+      117,  116,  115,  114,   80,  112,  111,  110,  109,  108,
+       87,   86,   85,   84,   83,   82,   80,   79,   31,   78,
+       77,   75,   61,   58,   32,   32,   31,  159,    3,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159
+    } ;
+
+static yyconst flex_int16_t yy_chk[331] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    8,    8,    8,    8,    9,    9,    9,   10,   10,
+       10,   11,   18,   18,   10,   11,   12,   12,   12,   15,
+       20,   20,   11,   11,   13,   13,   13,   13,   14,   14,
+       14,   11,   13,   16,   16,   16,   37,   37,   15,  160,
+       14,   14,   22,   22,   22,   23,   23,   23,   24,   24,
+       24,  156,   25,   25,   25,  154,   14,   21,   21,   21,
+
+       27,   27,   27,   22,   33,   33,   33,   33,   36,   36,
+       36,   21,  152,   21,   25,   39,   39,   40,   40,   40,
+       49,   49,   49,   40,  151,   21,  148,   21,   48,   48,
+       48,   48,   81,   81,   50,   50,   48,   50,   50,   50,
+       52,   52,   52,   53,   53,   53,   54,   54,   54,   55,
+       55,   55,   56,   56,   56,   58,   59,   59,   59,  147,
+       58,   60,   60,   60,   61,   61,   61,   62,   62,   62,
+       63,   63,   63,   65,   65,   65,   66,   66,   66,   67,
+       67,   67,   68,   68,   68,   88,   88,   88,   89,   89,
+       89,  145,   88,   90,   90,   90,   97,   97,   97,  144,
+
+       67,  108,  108,  108,  110,  110,  110,  119,  119,  119,
+      121,  121,  121,  123,  123,  123,  142,  142,  142,  143,
+      143,  143,  161,  161,  162,  162,  163,  163,  164,  164,
+      165,  165,  166,  166,  141,  140,  139,  138,  137,  136,
+      135,  131,  130,  129,  128,  127,  126,  125,  118,  117,
+      116,  115,  114,  113,  112,  111,  109,  106,   96,   87,
+       86,   85,   84,   83,   80,   78,   77,   75,   74,   70,
+       47,   46,   45,   44,   43,   41,   38,   34,   31,   29,
+       28,   26,   19,   17,    7,    6,    5,    3,  159,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159,
+      159,  159,  159,  159,  159,  159,  159,  159,  159,  159
+    } ;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+#line 1 "foreign-pajek-lexer.l"
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+#line 24 "foreign-pajek-lexer.l"
+
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include "config.h"
+#include <stdlib.h>
+#include "foreign-pajek-parser.h"
+#include "foreign-pajek-header.h"
+#define YY_EXTRA_TYPE igraph_i_pajek_parsedata_t*
+#define YY_USER_ACTION yylloc->first_line = yylineno;
+/* We assume that 'file' is 'stderr' here. */
+#define fprintf(file, msg, ...) \
+  igraph_warningf(msg, __FILE__, __LINE__, 0, __VA_ARGS__)
+#ifdef stdout 
+#  undef stdout
+#endif
+#define stdout 0
+#define exit(code) igraph_error("Fatal error in DL parser", __FILE__, \
+				__LINE__, IGRAPH_PARSEERROR);
+#define YY_NO_INPUT 1
+#line 626 "foreign-pajek-lexer.c"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+/* Holds the entire state of the reentrant scanner. */
+struct yyguts_t
+    {
+
+    /* User-defined. Not touched by flex. */
+    YY_EXTRA_TYPE yyextra_r;
+
+    /* The rest are the same as the globals declared in the non-reentrant scanner. */
+    FILE *yyin_r, *yyout_r;
+    size_t yy_buffer_stack_top; /**< index of top of stack. */
+    size_t yy_buffer_stack_max; /**< capacity of stack. */
+    YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */
+    char yy_hold_char;
+    int yy_n_chars;
+    int yyleng_r;
+    char *yy_c_buf_p;
+    int yy_init;
+    int yy_start;
+    int yy_did_buffer_switch_on_eof;
+    int yy_start_stack_ptr;
+    int yy_start_stack_depth;
+    int *yy_start_stack;
+    yy_state_type yy_last_accepting_state;
+    char* yy_last_accepting_cpos;
+
+    int yylineno_r;
+    int yy_flex_debug_r;
+
+    char *yytext_r;
+    int yy_more_flag;
+    int yy_more_len;
+
+    YYSTYPE * yylval_r;
+
+    YYLTYPE * yylloc_r;
+
+    }; /* end struct yyguts_t */
+
+static int yy_init_globals (yyscan_t yyscanner );
+
+    /* This must go here because YYSTYPE and YYLTYPE are included
+     * from bison output in section 1.*/
+    #    define yylval yyg->yylval_r
+    
+    #    define yylloc yyg->yylloc_r
+    
+int igraph_pajek_yylex_init (yyscan_t* scanner);
+
+int igraph_pajek_yylex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner);
+
+/* Accessor methods to globals.
+   These are made visible to non-reentrant scanners for convenience. */
+
+int igraph_pajek_yylex_destroy (yyscan_t yyscanner );
+
+int igraph_pajek_yyget_debug (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_debug (int debug_flag ,yyscan_t yyscanner );
+
+YY_EXTRA_TYPE igraph_pajek_yyget_extra (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner );
+
+FILE *igraph_pajek_yyget_in (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_in  (FILE * in_str ,yyscan_t yyscanner );
+
+FILE *igraph_pajek_yyget_out (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_out  (FILE * out_str ,yyscan_t yyscanner );
+
+int igraph_pajek_yyget_leng (yyscan_t yyscanner );
+
+char *igraph_pajek_yyget_text (yyscan_t yyscanner );
+
+int igraph_pajek_yyget_lineno (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_lineno (int line_number ,yyscan_t yyscanner );
+
+YYSTYPE * igraph_pajek_yyget_lval (yyscan_t yyscanner );
+
+void igraph_pajek_yyset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner );
+
+       YYLTYPE *igraph_pajek_yyget_lloc (yyscan_t yyscanner );
+    
+        void igraph_pajek_yyset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner );
+    
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int igraph_pajek_yywrap (yyscan_t yyscanner );
+#else
+extern int igraph_pajek_yywrap (yyscan_t yyscanner );
+#endif
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner);
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner);
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (yyscan_t yyscanner );
+#else
+static int input (yyscan_t yyscanner );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+		{ \
+		int c = '*'; \
+		size_t n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else \
+		{ \
+		errno=0; \
+		while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+			{ \
+			if( errno != EINTR) \
+				{ \
+				YY_FATAL_ERROR( "input in flex scanner failed" ); \
+				break; \
+				} \
+			errno=0; \
+			clearerr(yyin); \
+			} \
+		}\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner)
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int igraph_pajek_yylex \
+               (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner);
+
+#define YY_DECL int igraph_pajek_yylex \
+               (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp, *yy_bp;
+	register int yy_act;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+#line 76 "foreign-pajek-lexer.l"
+
+
+#line 873 "foreign-pajek-lexer.c"
+
+    yylval = yylval_param;
+
+    yylloc = yylloc_param;
+
+	if ( !yyg->yy_init )
+		{
+		yyg->yy_init = 1;
+
+#ifdef YY_USER_INIT
+		YY_USER_INIT;
+#endif
+
+		if ( ! yyg->yy_start )
+			yyg->yy_start = 1;	/* first start state */
+
+		if ( ! yyin )
+			yyin = stdin;
+
+		if ( ! yyout )
+			yyout = stdout;
+
+		if ( ! YY_CURRENT_BUFFER ) {
+			igraph_pajek_yyensure_buffer_stack (yyscanner);
+			YY_CURRENT_BUFFER_LVALUE =
+				igraph_pajek_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+		}
+
+		igraph_pajek_yy_load_buffer_state(yyscanner );
+		}
+
+	while ( 1 )		/* loops until end-of-file is reached */
+		{
+		yy_cp = yyg->yy_c_buf_p;
+
+		/* Support of yytext. */
+		*yy_cp = yyg->yy_hold_char;
+
+		/* yy_bp points to the position in yy_ch_buf of the start of
+		 * the current run.
+		 */
+		yy_bp = yy_cp;
+
+		yy_current_state = yyg->yy_start;
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			if ( yy_accept[yy_current_state] )
+				{
+				yyg->yy_last_accepting_state = yy_current_state;
+				yyg->yy_last_accepting_cpos = yy_cp;
+				}
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 160 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 289 );
+
+yy_find_action:
+		yy_act = yy_accept[yy_current_state];
+		if ( yy_act == 0 )
+			{ /* have to back up */
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			yy_act = yy_accept[yy_current_state];
+			}
+
+		YY_DO_BEFORE_ACTION;
+
+do_action:	/* This label is used only to access EOF actions. */
+
+		switch ( yy_act )
+	{ /* beginning of action switch */
+			case 0: /* must back up */
+			/* undo the effects of YY_DO_BEFORE_ACTION */
+			*yy_cp = yyg->yy_hold_char;
+			yy_cp = yyg->yy_last_accepting_cpos;
+			yy_current_state = yyg->yy_last_accepting_state;
+			goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 78 "foreign-pajek-lexer.l"
+{ }
+	YY_BREAK
+case 2:
+/* rule 2 can match eol */
+YY_RULE_SETUP
+#line 79 "foreign-pajek-lexer.l"
+{ }
+	YY_BREAK
+case 3:
+/* rule 3 can match eol */
+YY_RULE_SETUP
+#line 80 "foreign-pajek-lexer.l"
+{ }
+	YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 81 "foreign-pajek-lexer.l"
+{ return NETWORKLINE; }
+	YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 82 "foreign-pajek-lexer.l"
+{ return VERTICESLINE; }
+	YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 83 "foreign-pajek-lexer.l"
+{ return ARCSLINE; }
+	YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 84 "foreign-pajek-lexer.l"
+{ return EDGESLINE; }
+	YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 85 "foreign-pajek-lexer.l"
+{ return ARCSLISTLINE; }
+	YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 86 "foreign-pajek-lexer.l"
+{ return EDGESLISTLINE; }
+	YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 87 "foreign-pajek-lexer.l"
+{ return MATRIXLINE; }
+	YY_BREAK
+case 11:
+/* rule 11 can match eol */
+YY_RULE_SETUP
+#line 88 "foreign-pajek-lexer.l"
+{ yyextra->mode=0; return NEWLINE; }
+	YY_BREAK
+case 12:
+/* rule 12 can match eol */
+YY_RULE_SETUP
+#line 89 "foreign-pajek-lexer.l"
+{ return QSTR; }
+	YY_BREAK
+case 13:
+/* rule 13 can match eol */
+YY_RULE_SETUP
+#line 90 "foreign-pajek-lexer.l"
+{ return PSTR; }
+	YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 91 "foreign-pajek-lexer.l"
+{ 
+                    return NUM; }
+	YY_BREAK
+case 15:
+/* rule 15 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 6;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 94 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_X_FACT; } else { return ALNUM; } }
+	YY_BREAK
+case 16:
+/* rule 16 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 6;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 95 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_Y_FACT; } else { return ALNUM; } }
+	YY_BREAK
+case 17:
+/* rule 17 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 96 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_IC; } else { return ALNUM; } }
+	YY_BREAK
+case 18:
+/* rule 18 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 97 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_BC; } else { return ALNUM; } }
+	YY_BREAK
+case 19:
+/* rule 19 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 98 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_BW; } else { return ALNUM; } }
+	YY_BREAK
+case 20:
+/* rule 20 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 3;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 99 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_PHI; } else { return ALNUM; } }
+	YY_BREAK
+case 21:
+/* rule 21 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 100 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_R; } else { return ALNUM; } }
+	YY_BREAK
+case 22:
+/* rule 22 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 101 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_Q; } else { return ALNUM; } }
+	YY_BREAK
+case 23:
+/* rule 23 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 4;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 102 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_FONT; } else { return ALNUM; } }
+	YY_BREAK
+case 24:
+/* rule 24 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 3;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 103 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_URL; } else { return ALNUM; } }
+	YY_BREAK
+case 25:
+/* rule 25 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 105 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_C; } else { return ALNUM; } }
+	YY_BREAK
+case 26:
+/* rule 26 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 106 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_P; } else { return ALNUM; } }
+	YY_BREAK
+case 27:
+/* rule 27 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 107 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_S; } else { return ALNUM; } }
+	YY_BREAK
+case 28:
+/* rule 28 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 108 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_A; } else { return ALNUM; } }
+	YY_BREAK
+case 29:
+/* rule 29 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 109 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_W; } else { return ALNUM; } }
+	YY_BREAK
+case 30:
+/* rule 30 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 110 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_H1; } else { return ALNUM; } }
+	YY_BREAK
+case 31:
+/* rule 31 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 111 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_H2; } else { return ALNUM; } }
+	YY_BREAK
+case 32:
+/* rule 32 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 112 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_A1; } else { return ALNUM; } }
+	YY_BREAK
+case 33:
+/* rule 33 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 113 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_A2; } else { return ALNUM; } }
+	YY_BREAK
+case 34:
+/* rule 34 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 114 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_K1; } else { return ALNUM; } }
+	YY_BREAK
+case 35:
+/* rule 35 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 115 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_K2; } else { return ALNUM; } }
+	YY_BREAK
+case 36:
+/* rule 36 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 116 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_AP; } else { return ALNUM; } }
+	YY_BREAK
+case 37:
+/* rule 37 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 1;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 117 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_L; } else { return ALNUM; } }
+	YY_BREAK
+case 38:
+/* rule 38 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 118 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==2) { return EP_LP; } else { return ALNUM; } }
+	YY_BREAK
+case 39:
+/* rule 39 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 4;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 120 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_LPHI; } else
+                             if (yyextra->mode==2) { return EP_LPHI; } else { return ALNUM; } }
+	YY_BREAK
+case 40:
+/* rule 40 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 122 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_LC; } else
+                             if (yyextra->mode==2) { return EP_LC; } else { return ALNUM; } }
+	YY_BREAK
+case 41:
+/* rule 41 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 124 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_LR; } else
+                             if (yyextra->mode==2) { return EP_LR; } else { return ALNUM; } }
+	YY_BREAK
+case 42:
+/* rule 42 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 2;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 126 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_LA; } else
+                             if (yyextra->mode==2) { return EP_LA; } else { return ALNUM; } }
+	YY_BREAK
+case 43:
+/* rule 43 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 4;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 128 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_SIZE; } else 
+                             if (yyextra->mode==2) { return EP_SIZE; } else { return ALNUM; } }
+	YY_BREAK
+case 44:
+/* rule 44 can match eol */
+*yy_cp = yyg->yy_hold_char; /* undo effects of setting up yytext */
+yyg->yy_c_buf_p = yy_cp = yy_bp + 3;
+YY_DO_BEFORE_ACTION; /* set up yytext again */
+YY_RULE_SETUP
+#line 130 "foreign-pajek-lexer.l"
+{ if (yyextra->mode==1) { return VP_FOS; } else 
+                             if (yyextra->mode==2) { return EP_FOS; } else { return ALNUM; } }
+	YY_BREAK
+case 45:
+YY_RULE_SETUP
+#line 133 "foreign-pajek-lexer.l"
+{ return ALNUM; }
+	YY_BREAK
+case YY_STATE_EOF(INITIAL):
+#line 135 "foreign-pajek-lexer.l"
+{ if (yyextra->eof) {
+                       yyterminate();
+                    } else {
+                       yyextra->eof=1;
+                       return NEWLINE; 
+                    }
+                  }
+	YY_BREAK
+case 46:
+YY_RULE_SETUP
+#line 142 "foreign-pajek-lexer.l"
+ECHO;
+	YY_BREAK
+#line 1332 "foreign-pajek-lexer.c"
+
+	case YY_END_OF_BUFFER:
+		{
+		/* Amount of text matched not including the EOB char. */
+		int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1;
+
+		/* Undo the effects of YY_DO_BEFORE_ACTION. */
+		*yy_cp = yyg->yy_hold_char;
+		YY_RESTORE_YY_MORE_OFFSET
+
+		if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+			{
+			/* We're scanning a new file or input source.  It's
+			 * possible that this happened because the user
+			 * just pointed yyin at a new source and called
+			 * igraph_pajek_yylex().  If so, then we have to assure
+			 * consistency between YY_CURRENT_BUFFER and our
+			 * globals.  Here is the right place to do so, because
+			 * this is the first action (other than possibly a
+			 * back-up) that will match for the new input source.
+			 */
+			yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+			YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+			}
+
+		/* Note that here we test for yy_c_buf_p "<=" to the position
+		 * of the first EOB in the buffer, since yy_c_buf_p will
+		 * already have been incremented past the NUL character
+		 * (since all states make transitions on EOB to the
+		 * end-of-buffer state).  Contrast this with the test
+		 * in input().
+		 */
+		if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			{ /* This was really a NUL. */
+			yy_state_type yy_next_state;
+
+			yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text;
+
+			yy_current_state = yy_get_previous_state( yyscanner );
+
+			/* Okay, we're now positioned to make the NUL
+			 * transition.  We couldn't have
+			 * yy_get_previous_state() go ahead and do it
+			 * for us because it doesn't know how to deal
+			 * with the possibility of jamming (and we don't
+			 * want to build jamming into it because then it
+			 * will run more slowly).
+			 */
+
+			yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner);
+
+			yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+
+			if ( yy_next_state )
+				{
+				/* Consume the NUL. */
+				yy_cp = ++yyg->yy_c_buf_p;
+				yy_current_state = yy_next_state;
+				goto yy_match;
+				}
+
+			else
+				{
+				yy_cp = yyg->yy_c_buf_p;
+				goto yy_find_action;
+				}
+			}
+
+		else switch ( yy_get_next_buffer( yyscanner ) )
+			{
+			case EOB_ACT_END_OF_FILE:
+				{
+				yyg->yy_did_buffer_switch_on_eof = 0;
+
+				if ( igraph_pajek_yywrap(yyscanner ) )
+					{
+					/* Note: because we've taken care in
+					 * yy_get_next_buffer() to have set up
+					 * yytext, we can now set up
+					 * yy_c_buf_p so that if some total
+					 * hoser (like flex itself) wants to
+					 * call the scanner after we return the
+					 * YY_NULL, it'll still work - another
+					 * YY_NULL will get returned.
+					 */
+					yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ;
+
+					yy_act = YY_STATE_EOF(YY_START);
+					goto do_action;
+					}
+
+				else
+					{
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+					}
+				break;
+				}
+
+			case EOB_ACT_CONTINUE_SCAN:
+				yyg->yy_c_buf_p =
+					yyg->yytext_ptr + yy_amount_of_matched_text;
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_match;
+
+			case EOB_ACT_LAST_MATCH:
+				yyg->yy_c_buf_p =
+				&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars];
+
+				yy_current_state = yy_get_previous_state( yyscanner );
+
+				yy_cp = yyg->yy_c_buf_p;
+				yy_bp = yyg->yytext_ptr + YY_MORE_ADJ;
+				goto yy_find_action;
+			}
+		break;
+		}
+
+	default:
+		YY_FATAL_ERROR(
+			"fatal flex scanner internal error--no action found" );
+	} /* end of action switch */
+		} /* end of scanning one token */
+} /* end of igraph_pajek_yylex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ *	EOB_ACT_LAST_MATCH -
+ *	EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ *	EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+	register char *source = yyg->yytext_ptr;
+	register int number_to_move, i;
+	int ret_val;
+
+	if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] )
+		YY_FATAL_ERROR(
+		"fatal flex scanner internal error--end of buffer missed" );
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+		{ /* Don't try to fill the buffer, so this is an EOF. */
+		if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 )
+			{
+			/* We matched a single character, the EOB, so
+			 * treat this as a final EOF.
+			 */
+			return EOB_ACT_END_OF_FILE;
+			}
+
+		else
+			{
+			/* We matched some text prior to the EOB, first
+			 * process it.
+			 */
+			return EOB_ACT_LAST_MATCH;
+			}
+		}
+
+	/* Try to read more data. */
+
+	/* First move last chars to start of buffer. */
+	number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1;
+
+	for ( i = 0; i < number_to_move; ++i )
+		*(dest++) = *(source++);
+
+	if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+		/* don't do the read, it's not guaranteed to return an EOF,
+		 * just force an EOF
+		 */
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0;
+
+	else
+		{
+			int num_to_read =
+			YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+		while ( num_to_read <= 0 )
+			{ /* Not enough room in the buffer - grow it. */
+
+			/* just a shorter name for the current buffer */
+			YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+			int yy_c_buf_p_offset =
+				(int) (yyg->yy_c_buf_p - b->yy_ch_buf);
+
+			if ( b->yy_is_our_buffer )
+				{
+				int new_size = b->yy_buf_size * 2;
+
+				if ( new_size <= 0 )
+					b->yy_buf_size += b->yy_buf_size / 8;
+				else
+					b->yy_buf_size *= 2;
+
+				b->yy_ch_buf = (char *)
+					/* Include room in for 2 EOB chars. */
+					igraph_pajek_yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner );
+				}
+			else
+				/* Can't grow it, we don't own it. */
+				b->yy_ch_buf = 0;
+
+			if ( ! b->yy_ch_buf )
+				YY_FATAL_ERROR(
+				"fatal error - scanner input buffer overflow" );
+
+			yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+			num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+						number_to_move - 1;
+
+			}
+
+		if ( num_to_read > YY_READ_BUF_SIZE )
+			num_to_read = YY_READ_BUF_SIZE;
+
+		/* Read in more data. */
+		YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+			yyg->yy_n_chars, (size_t) num_to_read );
+
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	if ( yyg->yy_n_chars == 0 )
+		{
+		if ( number_to_move == YY_MORE_ADJ )
+			{
+			ret_val = EOB_ACT_END_OF_FILE;
+			igraph_pajek_yyrestart(yyin  ,yyscanner);
+			}
+
+		else
+			{
+			ret_val = EOB_ACT_LAST_MATCH;
+			YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+				YY_BUFFER_EOF_PENDING;
+			}
+		}
+
+	else
+		ret_val = EOB_ACT_CONTINUE_SCAN;
+
+	if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+		/* Extend the array by 50%, plus the number we really need. */
+		yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1);
+		YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) igraph_pajek_yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner );
+		if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+			YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+	}
+
+	yyg->yy_n_chars += number_to_move;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+	YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+	yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+	return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+    static yy_state_type yy_get_previous_state (yyscan_t yyscanner)
+{
+	register yy_state_type yy_current_state;
+	register char *yy_cp;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	yy_current_state = yyg->yy_start;
+
+	for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp )
+		{
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		if ( yy_accept[yy_current_state] )
+			{
+			yyg->yy_last_accepting_state = yy_current_state;
+			yyg->yy_last_accepting_cpos = yy_cp;
+			}
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 160 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		}
+
+	return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ *	next_state = yy_try_NUL_trans( current_state );
+ */
+    static yy_state_type yy_try_NUL_trans  (yy_state_type yy_current_state , yyscan_t yyscanner)
+{
+	register int yy_is_jam;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */
+	register char *yy_cp = yyg->yy_c_buf_p;
+
+	register YY_CHAR yy_c = 1;
+	if ( yy_accept[yy_current_state] )
+		{
+		yyg->yy_last_accepting_state = yy_current_state;
+		yyg->yy_last_accepting_cpos = yy_cp;
+		}
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 160 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	yy_is_jam = (yy_current_state == 159);
+
+	return yy_is_jam ? 0 : yy_current_state;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+    static int yyinput (yyscan_t yyscanner)
+#else
+    static int input  (yyscan_t yyscanner)
+#endif
+
+{
+	int c;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	*yyg->yy_c_buf_p = yyg->yy_hold_char;
+
+	if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+		{
+		/* yy_c_buf_p now points to the character we want to return.
+		 * If this occurs *before* the EOB characters, then it's a
+		 * valid NUL; if not, then we've hit the end of the buffer.
+		 */
+		if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] )
+			/* This was really a NUL. */
+			*yyg->yy_c_buf_p = '\0';
+
+		else
+			{ /* need more input */
+			int offset = yyg->yy_c_buf_p - yyg->yytext_ptr;
+			++yyg->yy_c_buf_p;
+
+			switch ( yy_get_next_buffer( yyscanner ) )
+				{
+				case EOB_ACT_LAST_MATCH:
+					/* This happens because yy_g_n_b()
+					 * sees that we've accumulated a
+					 * token and flags that we need to
+					 * try matching the token before
+					 * proceeding.  But for input(),
+					 * there's no matching to consider.
+					 * So convert the EOB_ACT_LAST_MATCH
+					 * to EOB_ACT_END_OF_FILE.
+					 */
+
+					/* Reset buffer status. */
+					igraph_pajek_yyrestart(yyin ,yyscanner);
+
+					/*FALLTHROUGH*/
+
+				case EOB_ACT_END_OF_FILE:
+					{
+					if ( igraph_pajek_yywrap(yyscanner ) )
+						return EOF;
+
+					if ( ! yyg->yy_did_buffer_switch_on_eof )
+						YY_NEW_FILE;
+#ifdef __cplusplus
+					return yyinput(yyscanner);
+#else
+					return input(yyscanner);
+#endif
+					}
+
+				case EOB_ACT_CONTINUE_SCAN:
+					yyg->yy_c_buf_p = yyg->yytext_ptr + offset;
+					break;
+				}
+			}
+		}
+
+	c = *(unsigned char *) yyg->yy_c_buf_p;	/* cast for 8-bit char's */
+	*yyg->yy_c_buf_p = '\0';	/* preserve yytext */
+	yyg->yy_hold_char = *++yyg->yy_c_buf_p;
+
+	return c;
+}
+#endif	/* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ * @param yyscanner The scanner object.
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+    void igraph_pajek_yyrestart  (FILE * input_file , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! YY_CURRENT_BUFFER ){
+        igraph_pajek_yyensure_buffer_stack (yyscanner);
+		YY_CURRENT_BUFFER_LVALUE =
+            igraph_pajek_yy_create_buffer(yyin,YY_BUF_SIZE ,yyscanner);
+	}
+
+	igraph_pajek_yy_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner);
+	igraph_pajek_yy_load_buffer_state(yyscanner );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_pajek_yy_switch_to_buffer  (YY_BUFFER_STATE  new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	/* TODO. We should be able to replace this entire function body
+	 * with
+	 *		igraph_pajek_yypop_buffer_state();
+	 *		igraph_pajek_yypush_buffer_state(new_buffer);
+     */
+	igraph_pajek_yyensure_buffer_stack (yyscanner);
+	if ( YY_CURRENT_BUFFER == new_buffer )
+		return;
+
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+	igraph_pajek_yy_load_buffer_state(yyscanner );
+
+	/* We don't actually know whether we did this switch during
+	 * EOF (igraph_pajek_yywrap()) processing, but the only time this flag
+	 * is looked at is after igraph_pajek_yywrap() is called, so it's safe
+	 * to go ahead and always set it.
+	 */
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+static void igraph_pajek_yy_load_buffer_state  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+	yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+	yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+	yyg->yy_hold_char = *yyg->yy_c_buf_p;
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ * @param yyscanner The scanner object.
+ * @return the allocated buffer state.
+ */
+    YY_BUFFER_STATE igraph_pajek_yy_create_buffer  (FILE * file, int  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	b = (YY_BUFFER_STATE) igraph_pajek_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yy_create_buffer()" );
+
+	b->yy_buf_size = size;
+
+	/* yy_ch_buf has to be 2 characters longer than the size given because
+	 * we need to put in 2 end-of-buffer characters.
+	 */
+	b->yy_ch_buf = (char *) igraph_pajek_yyalloc(b->yy_buf_size + 2 ,yyscanner );
+	if ( ! b->yy_ch_buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yy_create_buffer()" );
+
+	b->yy_is_our_buffer = 1;
+
+	igraph_pajek_yy_init_buffer(b,file ,yyscanner);
+
+	return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with igraph_pajek_yy_create_buffer()
+ * @param yyscanner The scanner object.
+ */
+    void igraph_pajek_yy_delete_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if ( ! b )
+		return;
+
+	if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+		YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+	if ( b->yy_is_our_buffer )
+		igraph_pajek_yyfree((void *) b->yy_ch_buf ,yyscanner );
+
+	igraph_pajek_yyfree((void *) b ,yyscanner );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+    
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a igraph_pajek_yyrestart() or at EOF.
+ */
+    static void igraph_pajek_yy_init_buffer  (YY_BUFFER_STATE  b, FILE * file , yyscan_t yyscanner)
+
+{
+	int oerrno = errno;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	igraph_pajek_yy_flush_buffer(b ,yyscanner);
+
+	b->yy_input_file = file;
+	b->yy_fill_buffer = 1;
+
+    /* If b is the current buffer, then igraph_pajek_yy_init_buffer was _probably_
+     * called from igraph_pajek_yyrestart() or through yy_get_next_buffer.
+     * In that case, we don't want to reset the lineno or column.
+     */
+    if (b != YY_CURRENT_BUFFER){
+        b->yy_bs_lineno = 1;
+        b->yy_bs_column = 0;
+    }
+
+        b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+    
+	errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ * @param yyscanner The scanner object.
+ */
+    void igraph_pajek_yy_flush_buffer (YY_BUFFER_STATE  b , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if ( ! b )
+		return;
+
+	b->yy_n_chars = 0;
+
+	/* We always need two end-of-buffer characters.  The first causes
+	 * a transition to the end-of-buffer state.  The second causes
+	 * a jam in that state.
+	 */
+	b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+	b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+	b->yy_buf_pos = &b->yy_ch_buf[0];
+
+	b->yy_at_bol = 1;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	if ( b == YY_CURRENT_BUFFER )
+		igraph_pajek_yy_load_buffer_state(yyscanner );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ *  the current state. This function will allocate the stack
+ *  if necessary.
+ *  @param new_buffer The new state.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_pajek_yypush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (new_buffer == NULL)
+		return;
+
+	igraph_pajek_yyensure_buffer_stack(yyscanner);
+
+	/* This block is copied from igraph_pajek_yy_switch_to_buffer. */
+	if ( YY_CURRENT_BUFFER )
+		{
+		/* Flush out information for old buffer. */
+		*yyg->yy_c_buf_p = yyg->yy_hold_char;
+		YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p;
+		YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars;
+		}
+
+	/* Only push if top exists. Otherwise, replace top. */
+	if (YY_CURRENT_BUFFER)
+		yyg->yy_buffer_stack_top++;
+	YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+	/* copied from igraph_pajek_yy_switch_to_buffer. */
+	igraph_pajek_yy_load_buffer_state(yyscanner );
+	yyg->yy_did_buffer_switch_on_eof = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ *  The next element becomes the new top.
+ *  @param yyscanner The scanner object.
+ */
+void igraph_pajek_yypop_buffer_state (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+	if (!YY_CURRENT_BUFFER)
+		return;
+
+	igraph_pajek_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner);
+	YY_CURRENT_BUFFER_LVALUE = NULL;
+	if (yyg->yy_buffer_stack_top > 0)
+		--yyg->yy_buffer_stack_top;
+
+	if (YY_CURRENT_BUFFER) {
+		igraph_pajek_yy_load_buffer_state(yyscanner );
+		yyg->yy_did_buffer_switch_on_eof = 1;
+	}
+}
+
+/* Allocates the stack if it does not exist.
+ *  Guarantees space for at least one push.
+ */
+static void igraph_pajek_yyensure_buffer_stack (yyscan_t yyscanner)
+{
+	int num_to_alloc;
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+	if (!yyg->yy_buffer_stack) {
+
+		/* First allocation is just for 2 elements, since we don't know if this
+		 * scanner will even need a stack. We use 2 instead of 1 to avoid an
+		 * immediate realloc on the next call.
+         */
+		num_to_alloc = 1;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_pajek_yyalloc
+								(num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yyensure_buffer_stack()" );
+								  
+		memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+				
+		yyg->yy_buffer_stack_max = num_to_alloc;
+		yyg->yy_buffer_stack_top = 0;
+		return;
+	}
+
+	if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){
+
+		/* Increase the buffer to prepare for a possible push. */
+		int grow_size = 8 /* arbitrary grow size */;
+
+		num_to_alloc = yyg->yy_buffer_stack_max + grow_size;
+		yyg->yy_buffer_stack = (struct yy_buffer_state**)igraph_pajek_yyrealloc
+								(yyg->yy_buffer_stack,
+								num_to_alloc * sizeof(struct yy_buffer_state*)
+								, yyscanner);
+		if ( ! yyg->yy_buffer_stack )
+			YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yyensure_buffer_stack()" );
+
+		/* zero only the new slots.*/
+		memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*));
+		yyg->yy_buffer_stack_max = num_to_alloc;
+	}
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object. 
+ */
+YY_BUFFER_STATE igraph_pajek_yy_scan_buffer  (char * base, yy_size_t  size , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+    
+	if ( size < 2 ||
+	     base[size-2] != YY_END_OF_BUFFER_CHAR ||
+	     base[size-1] != YY_END_OF_BUFFER_CHAR )
+		/* They forgot to leave room for the EOB's. */
+		return 0;
+
+	b = (YY_BUFFER_STATE) igraph_pajek_yyalloc(sizeof( struct yy_buffer_state ) ,yyscanner );
+	if ( ! b )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yy_scan_buffer()" );
+
+	b->yy_buf_size = size - 2;	/* "- 2" to take care of EOB's */
+	b->yy_buf_pos = b->yy_ch_buf = base;
+	b->yy_is_our_buffer = 0;
+	b->yy_input_file = 0;
+	b->yy_n_chars = b->yy_buf_size;
+	b->yy_is_interactive = 0;
+	b->yy_at_bol = 1;
+	b->yy_fill_buffer = 0;
+	b->yy_buffer_status = YY_BUFFER_NEW;
+
+	igraph_pajek_yy_switch_to_buffer(b ,yyscanner );
+
+	return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to igraph_pajek_yylex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ *       igraph_pajek_yy_scan_bytes() instead.
+ */
+YY_BUFFER_STATE igraph_pajek_yy_scan_string (yyconst char * yystr , yyscan_t yyscanner)
+{
+    
+	return igraph_pajek_yy_scan_bytes(yystr,strlen(yystr) ,yyscanner);
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to igraph_pajek_yylex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ * @param yyscanner The scanner object.
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE igraph_pajek_yy_scan_bytes  (yyconst char * yybytes, int  _yybytes_len , yyscan_t yyscanner)
+{
+	YY_BUFFER_STATE b;
+	char *buf;
+	yy_size_t n;
+	int i;
+    
+	/* Get memory for full buffer, including space for trailing EOB's. */
+	n = _yybytes_len + 2;
+	buf = (char *) igraph_pajek_yyalloc(n ,yyscanner );
+	if ( ! buf )
+		YY_FATAL_ERROR( "out of dynamic memory in igraph_pajek_yy_scan_bytes()" );
+
+	for ( i = 0; i < _yybytes_len; ++i )
+		buf[i] = yybytes[i];
+
+	buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+	b = igraph_pajek_yy_scan_buffer(buf,n ,yyscanner);
+	if ( ! b )
+		YY_FATAL_ERROR( "bad buffer in igraph_pajek_yy_scan_bytes()" );
+
+	/* It's okay to grow etc. this buffer, and we should throw it
+	 * away when we're done.
+	 */
+	b->yy_is_our_buffer = 1;
+
+	return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner)
+{
+    	(void) fprintf( stderr, "%s\n", msg );
+	exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+	do \
+		{ \
+		/* Undo effects of setting up yytext. */ \
+        int yyless_macro_arg = (n); \
+        YY_LESS_LINENO(yyless_macro_arg);\
+		yytext[yyleng] = yyg->yy_hold_char; \
+		yyg->yy_c_buf_p = yytext + yyless_macro_arg; \
+		yyg->yy_hold_char = *yyg->yy_c_buf_p; \
+		*yyg->yy_c_buf_p = '\0'; \
+		yyleng = yyless_macro_arg; \
+		} \
+	while ( 0 )
+
+/* Accessor  methods (get/set functions) to struct members. */
+
+/** Get the user-defined data for this scanner.
+ * @param yyscanner The scanner object.
+ */
+YY_EXTRA_TYPE igraph_pajek_yyget_extra  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyextra;
+}
+
+/** Get the current line number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_pajek_yyget_lineno  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yylineno;
+}
+
+/** Get the current column number.
+ * @param yyscanner The scanner object.
+ */
+int igraph_pajek_yyget_column  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    
+        if (! YY_CURRENT_BUFFER)
+            return 0;
+    
+    return yycolumn;
+}
+
+/** Get the input stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_pajek_yyget_in  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyin;
+}
+
+/** Get the output stream.
+ * @param yyscanner The scanner object.
+ */
+FILE *igraph_pajek_yyget_out  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyout;
+}
+
+/** Get the length of the current token.
+ * @param yyscanner The scanner object.
+ */
+int igraph_pajek_yyget_leng  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yyleng;
+}
+
+/** Get the current token.
+ * @param yyscanner The scanner object.
+ */
+
+char *igraph_pajek_yyget_text  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yytext;
+}
+
+/** Set the user-defined data. This data is never touched by the scanner.
+ * @param user_defined The data to be associated with this scanner.
+ * @param yyscanner The scanner object.
+ */
+void igraph_pajek_yyset_extra (YY_EXTRA_TYPE  user_defined , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyextra = user_defined ;
+}
+
+/** Set the current line number.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_pajek_yyset_lineno (int  line_number , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* lineno is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_pajek_yyset_lineno called with no buffer" , yyscanner); 
+    
+    yylineno = line_number;
+}
+
+/** Set the current column.
+ * @param line_number
+ * @param yyscanner The scanner object.
+ */
+void igraph_pajek_yyset_column (int  column_no , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+        /* column is only valid if an input buffer exists. */
+        if (! YY_CURRENT_BUFFER )
+           yy_fatal_error( "igraph_pajek_yyset_column called with no buffer" , yyscanner); 
+    
+    yycolumn = column_no;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ * @param yyscanner The scanner object.
+ * @see igraph_pajek_yy_switch_to_buffer
+ */
+void igraph_pajek_yyset_in (FILE *  in_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyin = in_str ;
+}
+
+void igraph_pajek_yyset_out (FILE *  out_str , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yyout = out_str ;
+}
+
+int igraph_pajek_yyget_debug  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yy_flex_debug;
+}
+
+void igraph_pajek_yyset_debug (int  bdebug , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yy_flex_debug = bdebug ;
+}
+
+/* Accessor methods for yylval and yylloc */
+
+YYSTYPE * igraph_pajek_yyget_lval  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylval;
+}
+
+void igraph_pajek_yyset_lval (YYSTYPE *  yylval_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylval = yylval_param;
+}
+
+YYLTYPE *igraph_pajek_yyget_lloc  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    return yylloc;
+}
+    
+void igraph_pajek_yyset_lloc (YYLTYPE *  yylloc_param , yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    yylloc = yylloc_param;
+}
+    
+/* User-visible API */
+
+/* igraph_pajek_yylex_init is special because it creates the scanner itself, so it is
+ * the ONLY reentrant function that doesn't take the scanner as the last argument.
+ * That's why we explicitly handle the declaration, instead of using our macros.
+ */
+
+int igraph_pajek_yylex_init(yyscan_t* ptr_yy_globals)
+
+{
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+
+    *ptr_yy_globals = (yyscan_t) igraph_pajek_yyalloc ( sizeof( struct yyguts_t ), NULL );
+
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+
+    /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+/* igraph_pajek_yylex_init_extra has the same functionality as igraph_pajek_yylex_init, but follows the
+ * convention of taking the scanner as the last argument. Note however, that
+ * this is a *pointer* to a scanner, as it will be allocated by this call (and
+ * is the reason, too, why this function also must handle its own declaration).
+ * The user defined value in the first argument will be available to igraph_pajek_yyalloc in
+ * the yyextra field.
+ */
+
+int igraph_pajek_yylex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals )
+
+{
+    struct yyguts_t dummy_yyguts;
+
+    igraph_pajek_yyset_extra (yy_user_defined, &dummy_yyguts);
+
+    if (ptr_yy_globals == NULL){
+        errno = EINVAL;
+        return 1;
+    }
+	
+    *ptr_yy_globals = (yyscan_t) igraph_pajek_yyalloc ( sizeof( struct yyguts_t ), &dummy_yyguts );
+	
+    if (*ptr_yy_globals == NULL){
+        errno = ENOMEM;
+        return 1;
+    }
+    
+    /* By setting to 0xAA, we expose bugs in
+    yy_init_globals. Leave at 0x00 for releases. */
+    memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t));
+    
+    igraph_pajek_yyset_extra (yy_user_defined, *ptr_yy_globals);
+    
+    return yy_init_globals ( *ptr_yy_globals );
+}
+
+static int yy_init_globals (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+    /* Initialization is the same as for the non-reentrant scanner.
+     * This function is called from igraph_pajek_yylex_destroy(), so don't allocate here.
+     */
+
+    yyg->yy_buffer_stack = 0;
+    yyg->yy_buffer_stack_top = 0;
+    yyg->yy_buffer_stack_max = 0;
+    yyg->yy_c_buf_p = (char *) 0;
+    yyg->yy_init = 0;
+    yyg->yy_start = 0;
+
+    yyg->yy_start_stack_ptr = 0;
+    yyg->yy_start_stack_depth = 0;
+    yyg->yy_start_stack =  NULL;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+    yyin = stdin;
+    yyout = stdout;
+#else
+    yyin = (FILE *) 0;
+    yyout = (FILE *) 0;
+#endif
+
+    /* For future reference: Set errno on error, since we are called by
+     * igraph_pajek_yylex_init()
+     */
+    return 0;
+}
+
+/* igraph_pajek_yylex_destroy is for both reentrant and non-reentrant scanners. */
+int igraph_pajek_yylex_destroy  (yyscan_t yyscanner)
+{
+    struct yyguts_t * yyg = (struct yyguts_t*)yyscanner;
+
+    /* Pop the buffer stack, destroying each element. */
+	while(YY_CURRENT_BUFFER){
+		igraph_pajek_yy_delete_buffer(YY_CURRENT_BUFFER ,yyscanner );
+		YY_CURRENT_BUFFER_LVALUE = NULL;
+		igraph_pajek_yypop_buffer_state(yyscanner);
+	}
+
+	/* Destroy the stack itself. */
+	igraph_pajek_yyfree(yyg->yy_buffer_stack ,yyscanner);
+	yyg->yy_buffer_stack = NULL;
+
+    /* Destroy the start condition stack. */
+        igraph_pajek_yyfree(yyg->yy_start_stack ,yyscanner );
+        yyg->yy_start_stack = NULL;
+
+    /* Reset the globals. This is important in a non-reentrant scanner so the next time
+     * igraph_pajek_yylex() is called, initialization will occur. */
+    yy_init_globals( yyscanner);
+
+    /* Destroy the main struct (reentrant only). */
+    igraph_pajek_yyfree ( yyscanner , yyscanner );
+    yyscanner = NULL;
+    return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner)
+{
+	register int i;
+	for ( i = 0; i < n; ++i )
+		s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner)
+{
+	register int n;
+	for ( n = 0; s[n]; ++n )
+		;
+
+	return n;
+}
+#endif
+
+void *igraph_pajek_yyalloc (yy_size_t  size , yyscan_t yyscanner)
+{
+	return (void *) malloc( size );
+}
+
+void *igraph_pajek_yyrealloc  (void * ptr, yy_size_t  size , yyscan_t yyscanner)
+{
+	/* The cast to (char *) in the following accommodates both
+	 * implementations that use char* generic pointers, and those
+	 * that use void* generic pointers.  It works with the latter
+	 * because both ANSI C and C++ allow castless assignment from
+	 * any pointer type to void*, and deal with argument conversions
+	 * as though doing an assignment.
+	 */
+	return (void *) realloc( (char *) ptr, size );
+}
+
+void igraph_pajek_yyfree (void * ptr , yyscan_t yyscanner)
+{
+	free( (char *) ptr );	/* see igraph_pajek_yyrealloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 142 "foreign-pajek-lexer.l"
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-pajek-parser.c igraph-0.6.5/src/foreign-pajek-parser.c
--- igraph-0.6.5~quantal1/src/foreign-pajek-parser.c	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-pajek-parser.c	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,3052 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison implementation for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+   simplifying the original so-called "semantic" parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Bison version.  */
+#define YYBISON_VERSION "2.5"
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Push parsers.  */
+#define YYPUSH 0
+
+/* Pull parsers.  */
+#define YYPULL 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 1
+
+/* Substitute the variable and function names.  */
+#define yyparse         igraph_pajek_yyparse
+#define yylex           igraph_pajek_yylex
+#define yyerror         igraph_pajek_yyerror
+#define yylval          igraph_pajek_yylval
+#define yychar          igraph_pajek_yychar
+#define yydebug         igraph_pajek_yydebug
+#define yynerrs         igraph_pajek_yynerrs
+#define yylloc          igraph_pajek_yylloc
+
+/* Copy the first part of user declarations.  */
+
+/* Line 268 of yacc.c  */
+#line 23 "foreign-pajek-parser.y"
+
+
+/* 
+   IGraph library.
+   Copyright (C) 2006-2012  Gabor Csardi <csardi.gabor@gmail.com>
+   334 Harvard st, Cambridge, MA, 02138 USA
+   
+   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 2 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, write to the Free Software
+   Foundation, Inc.,  51 Franklin Street, Fifth Floor, Boston, MA 
+   02110-1301 USA
+
+*/
+
+#include <stdio.h>
+#include <string.h>
+#include "igraph_hacks_internal.h"
+#include "igraph_types.h"
+#include "igraph_types_internal.h"
+#include "igraph_memory.h"
+#include "igraph_error.h"
+#include "igraph_attributes.h"
+#include "config.h"
+#include "igraph_math.h"
+#include <math.h>
+#include "foreign-pajek-header.h"
+#include "foreign-pajek-parser.h"
+
+#define yyscan_t void*
+
+int igraph_pajek_yylex(YYSTYPE* lvalp, YYLTYPE* llocp, 
+		       void* scanner);
+int igraph_pajek_yyerror(YYLTYPE* locp, 
+			 igraph_i_pajek_parsedata_t *context, 
+			 char *s);
+char *igraph_pajek_yyget_text (yyscan_t yyscanner );
+int igraph_pajek_yyget_leng (yyscan_t yyscanner );
+
+int igraph_i_pajek_add_string_vertex_attribute(const char *name, 
+					       const char *value,
+					       int len, 
+					       igraph_i_pajek_parsedata_t *context);
+int igraph_i_pajek_add_string_edge_attribute(const char *name, 
+					     const char *value,
+					     int len,
+					     igraph_i_pajek_parsedata_t *context);
+int igraph_i_pajek_add_numeric_vertex_attribute(const char *name, 
+						igraph_real_t value,
+						igraph_i_pajek_parsedata_t *context);
+int igraph_i_pajek_add_numeric_edge_attribute(const char *name, 
+					      igraph_real_t value, 
+					      igraph_i_pajek_parsedata_t *context);
+int igraph_i_pajek_add_numeric_attribute(igraph_trie_t *names,
+					 igraph_vector_ptr_t *attrs,
+					 long int count,
+					 const char *attrname,
+					 igraph_integer_t vid,
+					 igraph_real_t number);
+int igraph_i_pajek_add_string_attribute(igraph_trie_t *names,
+					igraph_vector_ptr_t *attrs,
+					long int count,
+					const char *attrname,
+					igraph_integer_t vid,
+					const char *str);
+
+int igraph_i_pajek_add_bipartite_type(igraph_i_pajek_parsedata_t *context);
+int igraph_i_pajek_check_bipartite(igraph_i_pajek_parsedata_t *context);
+
+extern igraph_real_t igraph_pajek_get_number(const char *str, long int len);
+extern long int igraph_i_pajek_actvertex;
+extern long int igraph_i_pajek_actedge;
+
+#define scanner context->scanner
+
+
+
+/* Line 268 of yacc.c  */
+#line 166 "foreign-pajek-parser.c"
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 1
+#endif
+
+/* Enabling the token table.  */
+#ifndef YYTOKEN_TABLE
+# define YYTOKEN_TABLE 0
+#endif
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     NEWLINE = 258,
+     NUM = 259,
+     ALNUM = 260,
+     QSTR = 261,
+     PSTR = 262,
+     NETWORKLINE = 263,
+     VERTICESLINE = 264,
+     ARCSLINE = 265,
+     EDGESLINE = 266,
+     ARCSLISTLINE = 267,
+     EDGESLISTLINE = 268,
+     MATRIXLINE = 269,
+     VP_X_FACT = 270,
+     VP_Y_FACT = 271,
+     VP_IC = 272,
+     VP_BC = 273,
+     VP_LC = 274,
+     VP_LR = 275,
+     VP_LPHI = 276,
+     VP_BW = 277,
+     VP_FOS = 278,
+     VP_PHI = 279,
+     VP_R = 280,
+     VP_Q = 281,
+     VP_LA = 282,
+     VP_FONT = 283,
+     VP_URL = 284,
+     VP_SIZE = 285,
+     EP_C = 286,
+     EP_S = 287,
+     EP_A = 288,
+     EP_W = 289,
+     EP_H1 = 290,
+     EP_H2 = 291,
+     EP_A1 = 292,
+     EP_A2 = 293,
+     EP_K1 = 294,
+     EP_K2 = 295,
+     EP_AP = 296,
+     EP_P = 297,
+     EP_L = 298,
+     EP_LP = 299,
+     EP_LR = 300,
+     EP_LPHI = 301,
+     EP_LC = 302,
+     EP_LA = 303,
+     EP_SIZE = 304,
+     EP_FOS = 305
+   };
+#endif
+/* Tokens.  */
+#define NEWLINE 258
+#define NUM 259
+#define ALNUM 260
+#define QSTR 261
+#define PSTR 262
+#define NETWORKLINE 263
+#define VERTICESLINE 264
+#define ARCSLINE 265
+#define EDGESLINE 266
+#define ARCSLISTLINE 267
+#define EDGESLISTLINE 268
+#define MATRIXLINE 269
+#define VP_X_FACT 270
+#define VP_Y_FACT 271
+#define VP_IC 272
+#define VP_BC 273
+#define VP_LC 274
+#define VP_LR 275
+#define VP_LPHI 276
+#define VP_BW 277
+#define VP_FOS 278
+#define VP_PHI 279
+#define VP_R 280
+#define VP_Q 281
+#define VP_LA 282
+#define VP_FONT 283
+#define VP_URL 284
+#define VP_SIZE 285
+#define EP_C 286
+#define EP_S 287
+#define EP_A 288
+#define EP_W 289
+#define EP_H1 290
+#define EP_H2 291
+#define EP_A1 292
+#define EP_A2 293
+#define EP_K1 294
+#define EP_K2 295
+#define EP_AP 296
+#define EP_P 297
+#define EP_L 298
+#define EP_LP 299
+#define EP_LR 300
+#define EP_LPHI 301
+#define EP_LC 302
+#define EP_LA 303
+#define EP_SIZE 304
+#define EP_FOS 305
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 293 of yacc.c  */
+#line 118 "foreign-pajek-parser.y"
+
+  long int intnum;
+  double   realnum;  
+  struct {
+    char *str;
+    int len;
+  } string;  
+
+
+
+/* Line 293 of yacc.c  */
+#line 313 "foreign-pajek-parser.c"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+/* Copy the second part of user declarations.  */
+
+
+/* Line 343 of yacc.c  */
+#line 338 "foreign-pajek-parser.c"
+
+#ifdef short
+# undef short
+#endif
+
+#ifdef YYTYPE_UINT8
+typedef YYTYPE_UINT8 yytype_uint8;
+#else
+typedef unsigned char yytype_uint8;
+#endif
+
+#ifdef YYTYPE_INT8
+typedef YYTYPE_INT8 yytype_int8;
+#elif (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+typedef signed char yytype_int8;
+#else
+typedef short int yytype_int8;
+#endif
+
+#ifdef YYTYPE_UINT16
+typedef YYTYPE_UINT16 yytype_uint16;
+#else
+typedef unsigned short int yytype_uint16;
+#endif
+
+#ifdef YYTYPE_INT16
+typedef YYTYPE_INT16 yytype_int16;
+#else
+typedef short int yytype_int16;
+#endif
+
+#ifndef YYSIZE_T
+# ifdef __SIZE_TYPE__
+#  define YYSIZE_T __SIZE_TYPE__
+# elif defined size_t
+#  define YYSIZE_T size_t
+# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# else
+#  define YYSIZE_T unsigned int
+# endif
+#endif
+
+#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
+
+#ifndef YY_
+# if defined YYENABLE_NLS && YYENABLE_NLS
+#  if ENABLE_NLS
+#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
+#   define YY_(msgid) dgettext ("bison-runtime", msgid)
+#  endif
+# endif
+# ifndef YY_
+#  define YY_(msgid) msgid
+# endif
+#endif
+
+/* Suppress unused-variable warnings by "using" E.  */
+#if ! defined lint || defined __GNUC__
+# define YYUSE(e) ((void) (e))
+#else
+# define YYUSE(e) /* empty */
+#endif
+
+/* Identity function, used to suppress warnings about constant conditions.  */
+#ifndef lint
+# define YYID(n) (n)
+#else
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static int
+YYID (int yyi)
+#else
+static int
+YYID (yyi)
+    int yyi;
+#endif
+{
+  return yyi;
+}
+#endif
+
+#if ! defined yyoverflow || YYERROR_VERBOSE
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   elif defined __BUILTIN_VA_ARG_INCR
+#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
+#   elif defined _AIX
+#    define YYSTACK_ALLOC __alloca
+#   elif defined _MSC_VER
+#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
+#    define alloca _alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#     ifndef EXIT_SUCCESS
+#      define EXIT_SUCCESS 0
+#     endif
+#    endif
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning.  */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0))
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+    /* The OS might guarantee only one guard page at the bottom of the stack,
+       and a page size can be as small as 4096 bytes.  So we cannot safely
+       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
+       to allow for a few compiler-allocated temporary stack slots.  */
+#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
+#  endif
+# else
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+#  ifndef YYSTACK_ALLOC_MAXIMUM
+#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
+#  endif
+#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
+       && ! ((defined YYMALLOC || defined malloc) \
+	     && (defined YYFREE || defined free)))
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   ifndef EXIT_SUCCESS
+#    define EXIT_SUCCESS 0
+#   endif
+#  endif
+#  ifndef YYMALLOC
+#   define YYMALLOC malloc
+#   if ! defined malloc && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+#  ifndef YYFREE
+#   define YYFREE free
+#   if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+void free (void *); /* INFRINGES ON USER NAME SPACE */
+#   endif
+#  endif
+# endif
+#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
+
+
+#if (! defined yyoverflow \
+     && (! defined __cplusplus \
+	 || (defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \
+	     && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  yytype_int16 yyss_alloc;
+  YYSTYPE yyvs_alloc;
+  YYLTYPE yyls_alloc;
+};
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+      + 2 * YYSTACK_GAP_MAXIMUM)
+
+# define YYCOPY_NEEDED 1
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack_alloc, Stack)				\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack_alloc, Stack, yysize);			\
+	Stack = &yyptr->Stack_alloc;					\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (YYID (0))
+
+#endif
+
+#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined __GNUC__ && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  YYSIZE_T yyi;				\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (YYID (0))
+#  endif
+# endif
+#endif /* !YYCOPY_NEEDED */
+
+/* YYFINAL -- State number of the termination state.  */
+#define YYFINAL  5
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   250
+
+/* YYNTOKENS -- Number of terminals.  */
+#define YYNTOKENS  51
+/* YYNNTS -- Number of nonterminals.  */
+#define YYNNTS  66
+/* YYNRULES -- Number of rules.  */
+#define YYNRULES  137
+/* YYNRULES -- Number of states.  */
+#define YYNSTATES  207
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   305
+
+#define YYTRANSLATE(YYX)						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const yytype_uint8 yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,
+      15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
+      25,    26,    27,    28,    29,    30,    31,    32,    33,    34,
+      35,    36,    37,    38,    39,    40,    41,    42,    43,    44,
+      45,    46,    47,    48,    49,    50
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const yytype_uint16 yyprhs[] =
+{
+       0,     0,     3,     7,     8,    12,    16,    19,    23,    24,
+      27,    29,    32,    33,    41,    43,    45,    46,    49,    53,
+      54,    56,    57,    60,    62,    65,    68,    73,    78,    83,
+      86,    89,    92,    95,    98,   101,   104,   107,   110,   111,
+     115,   116,   120,   121,   125,   126,   130,   131,   135,   137,
+     138,   141,   144,   147,   150,   153,   157,   162,   163,   166,
+     168,   169,   176,   178,   180,   184,   189,   190,   193,   195,
+     196,   203,   205,   207,   208,   210,   211,   214,   216,   221,
+     224,   227,   230,   233,   236,   239,   242,   245,   248,   251,
+     254,   257,   260,   263,   266,   267,   271,   272,   276,   277,
+     281,   282,   286,   287,   291,   293,   297,   298,   301,   303,
+     307,   308,   311,   313,   315,   319,   320,   323,   325,   329,
+     330,   333,   335,   337,   341,   343,   344,   347,   350,   351,
+     354,   356,   358,   360,   361,   364,   366,   368
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS.  */
+static const yytype_int8 yyrhs[] =
+{
+      52,     0,    -1,    53,    54,    72,    -1,    -1,     8,   115,
+       3,    -1,    55,     3,    56,    -1,     9,   113,    -1,     9,
+     113,   113,    -1,    -1,    56,    57,    -1,     3,    -1,    59,
+       3,    -1,    -1,    59,    58,    60,    61,    62,    63,     3,
+      -1,   113,    -1,   116,    -1,    -1,   114,   114,    -1,   114,
+     114,   114,    -1,    -1,   116,    -1,    -1,    63,    64,    -1,
+      65,    -1,    15,   114,    -1,    16,   114,    -1,    17,   114,
+     114,   114,    -1,    18,   114,   114,   114,    -1,    19,   114,
+     114,   114,    -1,    20,   114,    -1,    21,   114,    -1,    22,
+     114,    -1,    23,   114,    -1,    24,   114,    -1,    25,   114,
+      -1,    26,   114,    -1,    27,   114,    -1,    30,   114,    -1,
+      -1,    28,    66,    71,    -1,    -1,    29,    67,    71,    -1,
+      -1,    17,    68,    71,    -1,    -1,    18,    69,    71,    -1,
+      -1,    19,    70,    71,    -1,   116,    -1,    -1,    72,    73,
+      -1,    72,    79,    -1,    72,    95,    -1,    72,   101,    -1,
+      72,   107,    -1,    10,     3,    74,    -1,    10,   114,     3,
+      74,    -1,    -1,    74,    75,    -1,     3,    -1,    -1,    77,
+      78,    76,    85,    86,     3,    -1,   113,    -1,   113,    -1,
+      11,     3,    80,    -1,    11,   114,     3,    80,    -1,    -1,
+      80,    81,    -1,     3,    -1,    -1,    83,    84,    82,    85,
+      86,     3,    -1,   113,    -1,   113,    -1,    -1,   114,    -1,
+      -1,    86,    87,    -1,    88,    -1,    31,   114,   114,   114,
+      -1,    32,   114,    -1,    34,   114,    -1,    35,   114,    -1,
+      36,   114,    -1,    37,   114,    -1,    38,   114,    -1,    39,
+     114,    -1,    40,   114,    -1,    41,   114,    -1,    44,   114,
+      -1,    45,   114,    -1,    46,   114,    -1,    48,   114,    -1,
+      49,   114,    -1,    50,   114,    -1,    -1,    33,    89,    94,
+      -1,    -1,    42,    90,    94,    -1,    -1,    43,    91,    94,
+      -1,    -1,    47,    92,    94,    -1,    -1,    31,    93,    94,
+      -1,   116,    -1,    12,     3,    96,    -1,    -1,    96,    97,
+      -1,     3,    -1,    99,    98,     3,    -1,    -1,    98,   100,
+      -1,   113,    -1,   113,    -1,    13,     3,   102,    -1,    -1,
+     102,   103,    -1,     3,    -1,   105,   104,     3,    -1,    -1,
+     104,   106,    -1,   113,    -1,   113,    -1,   108,     3,   109,
+      -1,    14,    -1,    -1,   109,   110,    -1,   111,     3,    -1,
+      -1,   112,   111,    -1,   113,    -1,     4,    -1,     4,    -1,
+      -1,   115,   116,    -1,     5,    -1,     4,    -1,     6,    -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const yytype_uint16 yyrline[] =
+{
+       0,   191,   191,   195,   195,   197,   199,   203,   209,   209,
+     211,   212,   213,   213,   216,   218,   222,   223,   227,   233,
+     233,   237,   237,   240,   241,   244,   247,   252,   257,   262,
+     265,   268,   271,   274,   277,   280,   283,   286,   291,   291,
+     295,   295,   299,   299,   303,   303,   308,   308,   315,   317,
+     317,   317,   317,   317,   317,   319,   320,   322,   322,   324,
+     325,   325,   331,   333,   335,   336,   338,   338,   340,   341,
+     341,   347,   349,   351,   351,   355,   355,   358,   359,   364,
+     367,   370,   373,   376,   379,   382,   385,   388,   391,   394,
+     397,   400,   403,   406,   411,   411,   415,   415,   419,   419,
+     423,   423,   427,   427,   433,   435,   437,   437,   439,   439,
+     441,   441,   443,   445,   450,   452,   452,   454,   454,   456,
+     456,   458,   460,   467,   469,   471,   471,   473,   475,   475,
+     477,   487,   490,   493,   493,   495,   497,   499
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE
+/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "NEWLINE", "NUM", "ALNUM", "QSTR",
+  "PSTR", "NETWORKLINE", "VERTICESLINE", "ARCSLINE", "EDGESLINE",
+  "ARCSLISTLINE", "EDGESLISTLINE", "MATRIXLINE", "VP_X_FACT", "VP_Y_FACT",
+  "VP_IC", "VP_BC", "VP_LC", "VP_LR", "VP_LPHI", "VP_BW", "VP_FOS",
+  "VP_PHI", "VP_R", "VP_Q", "VP_LA", "VP_FONT", "VP_URL", "VP_SIZE",
+  "EP_C", "EP_S", "EP_A", "EP_W", "EP_H1", "EP_H2", "EP_A1", "EP_A2",
+  "EP_K1", "EP_K2", "EP_AP", "EP_P", "EP_L", "EP_LP", "EP_LR", "EP_LPHI",
+  "EP_LC", "EP_LA", "EP_SIZE", "EP_FOS", "$accept", "input", "nethead",
+  "vertices", "verticeshead", "vertdefs", "vertexline", "$@1", "vertex",
+  "vertexid", "vertexcoords", "shape", "params", "param", "vpword", "$@2",
+  "$@3", "$@4", "$@5", "$@6", "vpwordpar", "edgeblock", "arcs", "arcsdefs",
+  "arcsline", "$@7", "arcfrom", "arcto", "edges", "edgesdefs", "edgesline",
+  "$@8", "edgefrom", "edgeto", "weight", "edgeparams", "edgeparam",
+  "epword", "$@9", "$@10", "$@11", "$@12", "$@13", "epwordpar", "arcslist",
+  "arcslistlines", "arclistline", "arctolist", "arclistfrom", "arclistto",
+  "edgeslist", "edgelistlines", "edgelistline", "edgetolist",
+  "edgelistfrom", "edgelistto", "adjmatrix", "matrixline",
+  "adjmatrixlines", "adjmatrixline", "adjmatrixnumbers", "adjmatrixentry",
+  "longint", "number", "words", "word", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const yytype_uint16 yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
+     265,   266,   267,   268,   269,   270,   271,   272,   273,   274,
+     275,   276,   277,   278,   279,   280,   281,   282,   283,   284,
+     285,   286,   287,   288,   289,   290,   291,   292,   293,   294,
+     295,   296,   297,   298,   299,   300,   301,   302,   303,   304,
+     305
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const yytype_uint8 yyr1[] =
+{
+       0,    51,    52,    53,    53,    54,    55,    55,    56,    56,
+      57,    57,    58,    57,    59,    60,    61,    61,    61,    62,
+      62,    63,    63,    64,    64,    64,    64,    64,    64,    64,
+      64,    64,    64,    64,    64,    64,    64,    64,    66,    65,
+      67,    65,    68,    65,    69,    65,    70,    65,    71,    72,
+      72,    72,    72,    72,    72,    73,    73,    74,    74,    75,
+      76,    75,    77,    78,    79,    79,    80,    80,    81,    82,
+      81,    83,    84,    85,    85,    86,    86,    87,    87,    87,
+      87,    87,    87,    87,    87,    87,    87,    87,    87,    87,
+      87,    87,    87,    87,    89,    88,    90,    88,    91,    88,
+      92,    88,    93,    88,    94,    95,    96,    96,    97,    97,
+      98,    98,    99,   100,   101,   102,   102,   103,   103,   104,
+     104,   105,   106,   107,   108,   109,   109,   110,   111,   111,
+     112,   113,   114,   115,   115,   116,   116,   116
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const yytype_uint8 yyr2[] =
+{
+       0,     2,     3,     0,     3,     3,     2,     3,     0,     2,
+       1,     2,     0,     7,     1,     1,     0,     2,     3,     0,
+       1,     0,     2,     1,     2,     2,     4,     4,     4,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     0,     3,
+       0,     3,     0,     3,     0,     3,     0,     3,     1,     0,
+       2,     2,     2,     2,     2,     3,     4,     0,     2,     1,
+       0,     6,     1,     1,     3,     4,     0,     2,     1,     0,
+       6,     1,     1,     0,     1,     0,     2,     1,     4,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     0,     3,     0,     3,     0,     3,
+       0,     3,     0,     3,     1,     3,     0,     2,     1,     3,
+       0,     2,     1,     1,     3,     0,     2,     1,     3,     0,
+       2,     1,     1,     3,     1,     0,     2,     2,     0,     2,
+       1,     1,     1,     0,     2,     1,     1,     1
+};
+
+/* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM.
+   Performed when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const yytype_uint8 yydefact[] =
+{
+       3,   133,     0,     0,     0,     1,     0,    49,     0,     4,
+     136,   135,   137,   134,   131,     6,     2,     8,     7,     0,
+       0,     0,     0,   124,    50,    51,    52,    53,    54,     0,
+       5,    57,   132,     0,    66,     0,   106,   115,   125,    10,
+       9,    12,    14,    55,    57,    64,    66,   105,   114,   123,
+      11,     0,    59,    58,     0,    62,    56,    68,    67,     0,
+      71,    65,   108,   107,   110,   112,   117,   116,   119,   121,
+     126,     0,   128,   130,    16,    15,    60,    63,    69,    72,
+       0,     0,   127,   129,    19,     0,    73,    73,   109,   111,
+     113,   118,   120,   122,    21,    20,    17,    75,    74,    75,
+       0,    18,     0,     0,    13,     0,     0,    42,    44,    46,
+       0,     0,     0,     0,     0,     0,     0,     0,    38,    40,
+       0,    22,    23,    61,   102,     0,    94,     0,     0,     0,
+       0,     0,     0,     0,     0,    96,    98,     0,     0,     0,
+     100,     0,     0,     0,    76,    77,    70,    24,    25,     0,
+       0,     0,     0,     0,     0,    29,    30,    31,    32,    33,
+      34,    35,    36,     0,     0,    37,     0,     0,    79,     0,
+      80,    81,    82,    83,    84,    85,    86,    87,     0,     0,
+      88,    89,    90,     0,    91,    92,    93,    43,    48,     0,
+      45,     0,    47,     0,    39,    41,   103,   104,     0,    95,
+      97,    99,   101,    26,    27,    28,    78
+};
+
+/* YYDEFGOTO[NTERM-NUM].  */
+static const yytype_int16 yydefgoto[] =
+{
+      -1,     2,     3,     7,     8,    30,    40,    51,    41,    74,
+      84,    94,   100,   121,   122,   163,   164,   149,   151,   153,
+     187,    16,    24,    43,    53,    86,    54,    76,    25,    45,
+      58,    87,    59,    78,    97,   102,   144,   145,   169,   178,
+     179,   183,   166,   196,    26,    47,    63,    80,    64,    89,
+      27,    48,    67,    81,    68,    92,    28,    29,    49,    70,
+      71,    72,    55,    98,     4,   188
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -167
+static const yytype_int16 yypact[] =
+{
+      -4,  -167,     7,    36,    22,  -167,    48,  -167,    51,  -167,
+    -167,  -167,  -167,  -167,  -167,    48,    10,  -167,  -167,    12,
+      27,    56,    58,  -167,  -167,  -167,  -167,  -167,  -167,    59,
+      29,  -167,  -167,    60,  -167,    61,  -167,  -167,  -167,  -167,
+    -167,    62,  -167,    31,  -167,    33,  -167,    35,    37,    39,
+    -167,     5,  -167,  -167,    48,  -167,    31,  -167,  -167,    48,
+    -167,    33,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,
+    -167,    64,    48,  -167,    65,  -167,  -167,  -167,  -167,  -167,
+      47,    53,  -167,  -167,     5,    65,    65,    65,  -167,  -167,
+    -167,  -167,  -167,  -167,  -167,  -167,    65,  -167,  -167,  -167,
+     220,  -167,   151,   172,  -167,    65,    65,    65,    65,    65,
+      65,    65,    65,    65,    65,    65,    65,    65,  -167,  -167,
+      65,  -167,  -167,  -167,    65,    65,  -167,    65,    65,    65,
+      65,    65,    65,    65,    65,  -167,  -167,    65,    65,    65,
+    -167,    65,    65,    65,  -167,  -167,  -167,  -167,  -167,     5,
+      65,     5,    65,     5,    65,  -167,  -167,  -167,  -167,  -167,
+    -167,  -167,  -167,     5,     5,  -167,     5,    65,  -167,     5,
+    -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,     5,     5,
+    -167,  -167,  -167,     5,  -167,  -167,  -167,  -167,  -167,    65,
+    -167,    65,  -167,    65,  -167,  -167,  -167,  -167,    65,  -167,
+    -167,  -167,  -167,  -167,  -167,  -167,  -167
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yytype_int16 yypgoto[] =
+{
+    -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,
+    -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,
+    -145,  -167,  -167,    24,  -167,  -167,  -167,  -167,  -167,    26,
+    -167,  -167,  -167,  -167,   -17,   -26,  -167,  -167,  -167,  -167,
+    -167,  -167,  -167,  -166,  -167,  -167,  -167,  -167,  -167,  -167,
+    -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,  -167,
+       2,  -167,    -1,   -19,  -167,    -2
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -129
+static const yytype_int16 yytable[] =
+{
+      33,    35,    13,   199,     1,    15,   190,     5,   192,    10,
+      11,    12,   200,   201,    18,    31,    32,   202,   194,   195,
+      19,    20,    21,    22,    23,     9,    10,    11,    12,    42,
+      34,    32,    39,    14,    52,    14,    57,    14,    62,    14,
+      66,    14,  -128,    14,    60,     6,    65,    69,    73,    75,
+      88,    14,    14,    77,    17,    85,    91,    14,    79,    36,
+      60,    37,    38,    44,    46,    50,    96,    82,    56,    32,
+      99,    73,    61,   103,    83,     0,     0,   101,     0,    90,
+      93,     0,    95,     0,     0,     0,   147,   148,   150,   152,
+     154,   155,   156,   157,   158,   159,   160,   161,   162,     0,
+       0,   165,     0,     0,     0,   167,   168,     0,   170,   171,
+     172,   173,   174,   175,   176,   177,     0,     0,   180,   181,
+     182,     0,   184,   185,   186,     0,     0,     0,     0,     0,
+       0,   189,     0,   191,     0,   193,     0,     0,     0,     0,
+       0,     0,     0,     0,     0,     0,     0,     0,   198,     0,
+       0,     0,     0,     0,   123,     0,     0,     0,     0,     0,
+       0,     0,     0,     0,   197,     0,     0,   197,     0,     0,
+     203,     0,   204,     0,   205,   146,   197,   197,     0,   206,
+       0,   197,   124,   125,   126,   127,   128,   129,   130,   131,
+     132,   133,   134,   135,   136,   137,   138,   139,   140,   141,
+     142,   143,     0,   124,   125,   126,   127,   128,   129,   130,
+     131,   132,   133,   134,   135,   136,   137,   138,   139,   140,
+     141,   142,   143,   104,     0,     0,     0,     0,     0,     0,
+       0,     0,     0,     0,     0,   105,   106,   107,   108,   109,
+     110,   111,   112,   113,   114,   115,   116,   117,   118,   119,
+     120
+};
+
+#define yypact_value_is_default(yystate) \
+  ((yystate) == (-167))
+
+#define yytable_value_is_error(yytable_value) \
+  YYID (0)
+
+static const yytype_int16 yycheck[] =
+{
+      19,    20,     4,   169,     8,     6,   151,     0,   153,     4,
+       5,     6,   178,   179,    15,     3,     4,   183,   163,   164,
+      10,    11,    12,    13,    14,     3,     4,     5,     6,    30,
+       3,     4,     3,     4,     3,     4,     3,     4,     3,     4,
+       3,     4,     3,     4,    45,     9,    47,    48,    49,    51,
+       3,     4,     4,    54,     3,    74,     3,     4,    59,     3,
+      61,     3,     3,     3,     3,     3,    85,     3,    44,     4,
+      87,    72,    46,    99,    72,    -1,    -1,    96,    -1,    80,
+      81,    -1,    84,    -1,    -1,    -1,   105,   106,   107,   108,
+     109,   110,   111,   112,   113,   114,   115,   116,   117,    -1,
+      -1,   120,    -1,    -1,    -1,   124,   125,    -1,   127,   128,
+     129,   130,   131,   132,   133,   134,    -1,    -1,   137,   138,
+     139,    -1,   141,   142,   143,    -1,    -1,    -1,    -1,    -1,
+      -1,   150,    -1,   152,    -1,   154,    -1,    -1,    -1,    -1,
+      -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,   167,    -1,
+      -1,    -1,    -1,    -1,     3,    -1,    -1,    -1,    -1,    -1,
+      -1,    -1,    -1,    -1,   166,    -1,    -1,   169,    -1,    -1,
+     189,    -1,   191,    -1,   193,     3,   178,   179,    -1,   198,
+      -1,   183,    31,    32,    33,    34,    35,    36,    37,    38,
+      39,    40,    41,    42,    43,    44,    45,    46,    47,    48,
+      49,    50,    -1,    31,    32,    33,    34,    35,    36,    37,
+      38,    39,    40,    41,    42,    43,    44,    45,    46,    47,
+      48,    49,    50,     3,    -1,    -1,    -1,    -1,    -1,    -1,
+      -1,    -1,    -1,    -1,    -1,    15,    16,    17,    18,    19,
+      20,    21,    22,    23,    24,    25,    26,    27,    28,    29,
+      30
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const yytype_uint8 yystos[] =
+{
+       0,     8,    52,    53,   115,     0,     9,    54,    55,     3,
+       4,     5,     6,   116,     4,   113,    72,     3,   113,    10,
+      11,    12,    13,    14,    73,    79,    95,   101,   107,   108,
+      56,     3,     4,   114,     3,   114,     3,     3,     3,     3,
+      57,    59,   113,    74,     3,    80,     3,    96,   102,   109,
+       3,    58,     3,    75,    77,   113,    74,     3,    81,    83,
+     113,    80,     3,    97,    99,   113,     3,   103,   105,   113,
+     110,   111,   112,   113,    60,   116,    78,   113,    84,   113,
+      98,   104,     3,   111,    61,   114,    76,    82,     3,   100,
+     113,     3,   106,   113,    62,   116,   114,    85,   114,    85,
+      63,   114,    86,    86,     3,    15,    16,    17,    18,    19,
+      20,    21,    22,    23,    24,    25,    26,    27,    28,    29,
+      30,    64,    65,     3,    31,    32,    33,    34,    35,    36,
+      37,    38,    39,    40,    41,    42,    43,    44,    45,    46,
+      47,    48,    49,    50,    87,    88,     3,   114,   114,    68,
+     114,    69,   114,    70,   114,   114,   114,   114,   114,   114,
+     114,   114,   114,    66,    67,   114,    93,   114,   114,    89,
+     114,   114,   114,   114,   114,   114,   114,   114,    90,    91,
+     114,   114,   114,    92,   114,   114,   114,    71,   116,   114,
+      71,   114,    71,   114,    71,    71,    94,   116,   114,    94,
+      94,    94,    94,   114,   114,   114,   114
+};
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  However,
+   YYFAIL appears to be in use.  Nevertheless, it is formally deprecated
+   in Bison 2.4.2's NEWS entry, where a plan to phase it out is
+   discussed.  */
+
+#define YYFAIL		goto yyerrlab
+#if defined YYFAIL
+  /* This is here to suppress warnings from the GCC cpp's
+     -Wunused-macros.  Normally we don't worry about that warning, but
+     some users do, and we want to make it easy for users to remove
+     YYFAIL uses, which will produce warnings from Bison 2.5.  */
+#endif
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      YYPOPSTACK (1);						\
+      goto yybackup;						\
+    }								\
+  else								\
+    {								\
+      yyerror (&yylloc, context, YY_("syntax error: cannot back up")); \
+      YYERROR;							\
+    }								\
+while (YYID (0))
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (YYID (N))                                                    \
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (YYID (0))
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+	      (Loc).first_line, (Loc).first_column,	\
+	      (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, &yylloc, scanner)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (YYID (0))
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)			  \
+do {									  \
+  if (yydebug)								  \
+    {									  \
+      YYFPRINTF (stderr, "%s ", Title);					  \
+      yy_symbol_print (stderr,						  \
+		  Type, Value, Location, context); \
+      YYFPRINTF (stderr, "\n");						  \
+    }									  \
+} while (YYID (0))
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_pajek_parsedata_t* context)
+#else
+static void
+yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_pajek_parsedata_t* context;
+#endif
+{
+  if (!yyvaluep)
+    return;
+  YYUSE (yylocationp);
+  YYUSE (context);
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# else
+  YYUSE (yyoutput);
+# endif
+  switch (yytype)
+    {
+      default:
+	break;
+    }
+}
+
+
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep, YYLTYPE const * const yylocationp, igraph_i_pajek_parsedata_t* context)
+#else
+static void
+yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, context)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE const * const yyvaluep;
+    YYLTYPE const * const yylocationp;
+    igraph_i_pajek_parsedata_t* context;
+#endif
+{
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+  YY_LOCATION_PRINT (yyoutput, *yylocationp);
+  YYFPRINTF (yyoutput, ": ");
+  yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, context);
+  YYFPRINTF (yyoutput, ")");
+}
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
+#else
+static void
+yy_stack_print (yybottom, yytop)
+    yytype_int16 *yybottom;
+    yytype_int16 *yytop;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (; yybottom <= yytop; yybottom++)
+    {
+      int yybot = *yybottom;
+      YYFPRINTF (stderr, " %d", yybot);
+    }
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (YYID (0))
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yy_reduce_print (YYSTYPE *yyvsp, YYLTYPE *yylsp, int yyrule, igraph_i_pajek_parsedata_t* context)
+#else
+static void
+yy_reduce_print (yyvsp, yylsp, yyrule, context)
+    YYSTYPE *yyvsp;
+    YYLTYPE *yylsp;
+    int yyrule;
+    igraph_i_pajek_parsedata_t* context;
+#endif
+{
+  int yynrhs = yyr2[yyrule];
+  int yyi;
+  unsigned long int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
+	     yyrule - 1, yylno);
+  /* The symbols being reduced.  */
+  for (yyi = 0; yyi < yynrhs; yyi++)
+    {
+      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
+      yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi],
+		       &(yyvsp[(yyi + 1) - (yynrhs)])
+		       , &(yylsp[(yyi + 1) - (yynrhs)])		       , context);
+      YYFPRINTF (stderr, "\n");
+    }
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (yyvsp, yylsp, Rule, context); \
+} while (YYID (0))
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined __GLIBC__ && defined _STRING_H
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static YYSIZE_T
+yystrlen (const char *yystr)
+#else
+static YYSIZE_T
+yystrlen (yystr)
+    const char *yystr;
+#endif
+{
+  YYSIZE_T yylen;
+  for (yylen = 0; yystr[yylen]; yylen++)
+    continue;
+  return yylen;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static char *
+yystpcpy (char *yydest, const char *yysrc)
+#else
+static char *
+yystpcpy (yydest, yysrc)
+    char *yydest;
+    const char *yysrc;
+#endif
+{
+  char *yyd = yydest;
+  const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+# ifndef yytnamerr
+/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
+   quotes and backslashes, so that it's suitable for yyerror.  The
+   heuristic is that double-quoting is unnecessary unless the string
+   contains an apostrophe, a comma, or backslash (other than
+   backslash-backslash).  YYSTR is taken from yytname.  If YYRES is
+   null, do not copy; instead, return the length of what the result
+   would have been.  */
+static YYSIZE_T
+yytnamerr (char *yyres, const char *yystr)
+{
+  if (*yystr == '"')
+    {
+      YYSIZE_T yyn = 0;
+      char const *yyp = yystr;
+
+      for (;;)
+	switch (*++yyp)
+	  {
+	  case '\'':
+	  case ',':
+	    goto do_not_strip_quotes;
+
+	  case '\\':
+	    if (*++yyp != '\\')
+	      goto do_not_strip_quotes;
+	    /* Fall through.  */
+	  default:
+	    if (yyres)
+	      yyres[yyn] = *yyp;
+	    yyn++;
+	    break;
+
+	  case '"':
+	    if (yyres)
+	      yyres[yyn] = '\0';
+	    return yyn;
+	  }
+    do_not_strip_quotes: ;
+    }
+
+  if (! yyres)
+    return yystrlen (yystr);
+
+  return yystpcpy (yyres, yystr) - yyres;
+}
+# endif
+
+/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
+   about the unexpected token YYTOKEN for the state stack whose top is
+   YYSSP.
+
+   Return 0 if *YYMSG was successfully written.  Return 1 if *YYMSG is
+   not large enough to hold the message.  In that case, also set
+   *YYMSG_ALLOC to the required number of bytes.  Return 2 if the
+   required number of bytes is too large to store.  */
+static int
+yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
+                yytype_int16 *yyssp, int yytoken)
+{
+  YYSIZE_T yysize0 = yytnamerr (0, yytname[yytoken]);
+  YYSIZE_T yysize = yysize0;
+  YYSIZE_T yysize1;
+  enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
+  /* Internationalized format string. */
+  const char *yyformat = 0;
+  /* Arguments of yyformat. */
+  char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
+  /* Number of reported tokens (one for the "unexpected", one per
+     "expected"). */
+  int yycount = 0;
+
+  /* There are many possibilities here to consider:
+     - Assume YYFAIL is not used.  It's too flawed to consider.  See
+       <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html>
+       for details.  YYERROR is fine as it does not invoke this
+       function.
+     - If this state is a consistent state with a default action, then
+       the only way this function was invoked is if the default action
+       is an error action.  In that case, don't check for expected
+       tokens because there are none.
+     - The only way there can be no lookahead present (in yychar) is if
+       this state is a consistent state with a default action.  Thus,
+       detecting the absence of a lookahead is sufficient to determine
+       that there is no unexpected or expected token to report.  In that
+       case, just report a simple "syntax error".
+     - Don't assume there isn't a lookahead just because this state is a
+       consistent state with a default action.  There might have been a
+       previous inconsistent state, consistent state with a non-default
+       action, or user semantic action that manipulated yychar.
+     - Of course, the expected token list depends on states to have
+       correct lookahead information, and it depends on the parser not
+       to perform extra reductions after fetching a lookahead from the
+       scanner and before detecting a syntax error.  Thus, state merging
+       (from LALR or IELR) and default reductions corrupt the expected
+       token list.  However, the list is correct for canonical LR with
+       one exception: it will still contain any token that will not be
+       accepted due to an error action in a later state.
+  */
+  if (yytoken != YYEMPTY)
+    {
+      int yyn = yypact[*yyssp];
+      yyarg[yycount++] = yytname[yytoken];
+      if (!yypact_value_is_default (yyn))
+        {
+          /* Start YYX at -YYN if negative to avoid negative indexes in
+             YYCHECK.  In other words, skip the first -YYN actions for
+             this state because they are default actions.  */
+          int yyxbegin = yyn < 0 ? -yyn : 0;
+          /* Stay within bounds of both yycheck and yytname.  */
+          int yychecklim = YYLAST - yyn + 1;
+          int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+          int yyx;
+
+          for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+            if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
+                && !yytable_value_is_error (yytable[yyx + yyn]))
+              {
+                if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
+                  {
+                    yycount = 1;
+                    yysize = yysize0;
+                    break;
+                  }
+                yyarg[yycount++] = yytname[yyx];
+                yysize1 = yysize + yytnamerr (0, yytname[yyx]);
+                if (! (yysize <= yysize1
+                       && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+                  return 2;
+                yysize = yysize1;
+              }
+        }
+    }
+
+  switch (yycount)
+    {
+# define YYCASE_(N, S)                      \
+      case N:                               \
+        yyformat = S;                       \
+      break
+      YYCASE_(0, YY_("syntax error"));
+      YYCASE_(1, YY_("syntax error, unexpected %s"));
+      YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
+      YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
+      YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
+      YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
+# undef YYCASE_
+    }
+
+  yysize1 = yysize + yystrlen (yyformat);
+  if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
+    return 2;
+  yysize = yysize1;
+
+  if (*yymsg_alloc < yysize)
+    {
+      *yymsg_alloc = 2 * yysize;
+      if (! (yysize <= *yymsg_alloc
+             && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
+        *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
+      return 1;
+    }
+
+  /* Avoid sprintf, as that infringes on the user's name space.
+     Don't have undefined behavior even if the translation
+     produced a string with the wrong number of "%s"s.  */
+  {
+    char *yyp = *yymsg;
+    int yyi = 0;
+    while ((*yyp = *yyformat) != '\0')
+      if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
+        {
+          yyp += yytnamerr (yyp, yyarg[yyi++]);
+          yyformat += 2;
+        }
+      else
+        {
+          yyp++;
+          yyformat++;
+        }
+  }
+  return 0;
+}
+#endif /* YYERROR_VERBOSE */
+
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+/*ARGSUSED*/
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep, YYLTYPE *yylocationp, igraph_i_pajek_parsedata_t* context)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep, yylocationp, context)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+    YYLTYPE *yylocationp;
+    igraph_i_pajek_parsedata_t* context;
+#endif
+{
+  YYUSE (yyvaluep);
+  YYUSE (yylocationp);
+  YYUSE (context);
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+
+      default:
+	break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+#ifdef YYPARSE_PARAM
+#if defined __STDC__ || defined __cplusplus
+int yyparse (void *YYPARSE_PARAM);
+#else
+int yyparse ();
+#endif
+#else /* ! YYPARSE_PARAM */
+#if defined __STDC__ || defined __cplusplus
+int yyparse (igraph_i_pajek_parsedata_t* context);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (void *YYPARSE_PARAM)
+#else
+int
+yyparse (YYPARSE_PARAM)
+    void *YYPARSE_PARAM;
+#endif
+#else /* ! YYPARSE_PARAM */
+#if (defined __STDC__ || defined __C99__FUNC__ \
+     || defined __cplusplus || defined _MSC_VER)
+int
+yyparse (igraph_i_pajek_parsedata_t* context)
+#else
+int
+yyparse (context)
+    igraph_i_pajek_parsedata_t* context;
+#endif
+#endif
+{
+/* The lookahead symbol.  */
+int yychar;
+
+/* The semantic value of the lookahead symbol.  */
+YYSTYPE yylval;
+
+/* Location data for the lookahead symbol.  */
+YYLTYPE yylloc;
+
+    /* Number of syntax errors so far.  */
+    int yynerrs;
+
+    int yystate;
+    /* Number of tokens to shift before error messages enabled.  */
+    int yyerrstatus;
+
+    /* The stacks and their tools:
+       `yyss': related to states.
+       `yyvs': related to semantic values.
+       `yyls': related to locations.
+
+       Refer to the stacks thru separate pointers, to allow yyoverflow
+       to reallocate them elsewhere.  */
+
+    /* The state stack.  */
+    yytype_int16 yyssa[YYINITDEPTH];
+    yytype_int16 *yyss;
+    yytype_int16 *yyssp;
+
+    /* The semantic value stack.  */
+    YYSTYPE yyvsa[YYINITDEPTH];
+    YYSTYPE *yyvs;
+    YYSTYPE *yyvsp;
+
+    /* The location stack.  */
+    YYLTYPE yylsa[YYINITDEPTH];
+    YYLTYPE *yyls;
+    YYLTYPE *yylsp;
+
+    /* The locations where the error started and ended.  */
+    YYLTYPE yyerror_range[3];
+
+    YYSIZE_T yystacksize;
+
+  int yyn;
+  int yyresult;
+  /* Lookahead token as an internal (translated) token number.  */
+  int yytoken;
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+  YYLTYPE yyloc;
+
+#if YYERROR_VERBOSE
+  /* Buffer for error messages, and its allocated size.  */
+  char yymsgbuf[128];
+  char *yymsg = yymsgbuf;
+  YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
+#endif
+
+#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N), yylsp -= (N))
+
+  /* The number of symbols on the RHS of the reduced rule.
+     Keep to zero when no symbol should be popped.  */
+  int yylen = 0;
+
+  yytoken = 0;
+  yyss = yyssa;
+  yyvs = yyvsa;
+  yyls = yylsa;
+  yystacksize = YYINITDEPTH;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY; /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+  yyssp = yyss;
+  yyvsp = yyvs;
+  yylsp = yyls;
+
+#if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL
+  /* Initialize the default location before parsing starts.  */
+  yylloc.first_line   = yylloc.last_line   = 1;
+  yylloc.first_column = yylloc.last_column = 1;
+#endif
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed.  So pushing a state here evens the stacks.  */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack.  Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	yytype_int16 *yyss1 = yyss;
+	YYLTYPE *yyls1 = yyls;
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow (YY_("memory exhausted"),
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+		    &yyls1, yysize * sizeof (*yylsp),
+		    &yystacksize);
+
+	yyls = yyls1;
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyexhaustedlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyexhaustedlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	yytype_int16 *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyexhaustedlab;
+	YYSTACK_RELOCATE (yyss_alloc, yyss);
+	YYSTACK_RELOCATE (yyvs_alloc, yyvs);
+	YYSTACK_RELOCATE (yyls_alloc, yyls);
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+      yylsp = yyls + yysize - 1;
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  if (yystate == YYFINAL)
+    YYACCEPT;
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+  /* Do appropriate processing given the current state.  Read a
+     lookahead token if we need one and don't already have one.  */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+  yyn = yypact[yystate];
+  if (yypact_value_is_default (yyn))
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yytable_value_is_error (yyn))
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  /* Shift the lookahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the shifted token.  */
+  yychar = YYEMPTY;
+
+  yystate = yyn;
+  *++yyvsp = yylval;
+  *++yylsp = yylloc;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+  /* Default location.  */
+  YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 2:
+
+/* Line 1806 of yacc.c  */
+#line 191 "foreign-pajek-parser.y"
+    {
+  if (context->vcount2 > 0) { igraph_i_pajek_check_bipartite(context); }
+ }
+    break;
+
+  case 6:
+
+/* Line 1806 of yacc.c  */
+#line 199 "foreign-pajek-parser.y"
+    { 
+  context->vcount=(yyvsp[(2) - (2)].intnum); 
+  context->vcount2=0;
+            }
+    break;
+
+  case 7:
+
+/* Line 1806 of yacc.c  */
+#line 203 "foreign-pajek-parser.y"
+    { 
+  context->vcount=(yyvsp[(2) - (3)].intnum);
+  context->vcount2=(yyvsp[(3) - (3)].intnum);
+  igraph_i_pajek_add_bipartite_type(context);
+}
+    break;
+
+  case 12:
+
+/* Line 1806 of yacc.c  */
+#line 213 "foreign-pajek-parser.y"
+    { context->actvertex=(yyvsp[(1) - (1)].intnum); }
+    break;
+
+  case 13:
+
+/* Line 1806 of yacc.c  */
+#line 213 "foreign-pajek-parser.y"
+    { }
+    break;
+
+  case 14:
+
+/* Line 1806 of yacc.c  */
+#line 216 "foreign-pajek-parser.y"
+    { (yyval.intnum)=(yyvsp[(1) - (1)].intnum); context->mode=1; }
+    break;
+
+  case 15:
+
+/* Line 1806 of yacc.c  */
+#line 218 "foreign-pajek-parser.y"
+    {
+  igraph_i_pajek_add_string_vertex_attribute("id", (yyvsp[(1) - (1)].string).str, (yyvsp[(1) - (1)].string).len, context);
+}
+    break;
+
+  case 17:
+
+/* Line 1806 of yacc.c  */
+#line 223 "foreign-pajek-parser.y"
+    { 
+  igraph_i_pajek_add_numeric_vertex_attribute("x", (yyvsp[(1) - (2)].realnum), context);
+  igraph_i_pajek_add_numeric_vertex_attribute("y", (yyvsp[(2) - (2)].realnum), context);
+	    }
+    break;
+
+  case 18:
+
+/* Line 1806 of yacc.c  */
+#line 227 "foreign-pajek-parser.y"
+    { 
+  igraph_i_pajek_add_numeric_vertex_attribute("x", (yyvsp[(1) - (3)].realnum), context);
+  igraph_i_pajek_add_numeric_vertex_attribute("y", (yyvsp[(2) - (3)].realnum), context);
+  igraph_i_pajek_add_numeric_vertex_attribute("z", (yyvsp[(3) - (3)].realnum), context);
+	    }
+    break;
+
+  case 20:
+
+/* Line 1806 of yacc.c  */
+#line 233 "foreign-pajek-parser.y"
+    { 
+  igraph_i_pajek_add_string_vertex_attribute("shape", (yyvsp[(1) - (1)].string).str, (yyvsp[(1) - (1)].string).len, context);
+}
+    break;
+
+  case 24:
+
+/* Line 1806 of yacc.c  */
+#line 241 "foreign-pajek-parser.y"
+    {
+	 igraph_i_pajek_add_numeric_vertex_attribute("xfact", (yyvsp[(2) - (2)].realnum), context);
+       }
+    break;
+
+  case 25:
+
+/* Line 1806 of yacc.c  */
+#line 244 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("yfact", (yyvsp[(2) - (2)].realnum), context);
+       }
+    break;
+
+  case 26:
+
+/* Line 1806 of yacc.c  */
+#line 247 "foreign-pajek-parser.y"
+    { /* RGB color */
+         igraph_i_pajek_add_numeric_vertex_attribute("color-red", (yyvsp[(2) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("color-green", (yyvsp[(3) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("color-blue", (yyvsp[(4) - (4)].realnum), context);
+       }
+    break;
+
+  case 27:
+
+/* Line 1806 of yacc.c  */
+#line 252 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("framecolor-red", (yyvsp[(2) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("framecolor-green", (yyvsp[(3) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("framecolor-blue", (yyvsp[(4) - (4)].realnum), context);
+       }
+    break;
+
+  case 28:
+
+/* Line 1806 of yacc.c  */
+#line 257 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("labelcolor-red", (yyvsp[(2) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("labelcolor-green", (yyvsp[(3) - (4)].realnum), context);
+	 igraph_i_pajek_add_numeric_vertex_attribute("labelcolor-blue", (yyvsp[(4) - (4)].realnum), context);
+       }
+    break;
+
+  case 29:
+
+/* Line 1806 of yacc.c  */
+#line 262 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("labeldist", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 30:
+
+/* Line 1806 of yacc.c  */
+#line 265 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("labeldegree2", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 31:
+
+/* Line 1806 of yacc.c  */
+#line 268 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("framewidth", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 32:
+
+/* Line 1806 of yacc.c  */
+#line 271 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("fontsize", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 33:
+
+/* Line 1806 of yacc.c  */
+#line 274 "foreign-pajek-parser.y"
+    {       
+         igraph_i_pajek_add_numeric_vertex_attribute("rotation", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 34:
+
+/* Line 1806 of yacc.c  */
+#line 277 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("radius", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 35:
+
+/* Line 1806 of yacc.c  */
+#line 280 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("diamondratio", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 36:
+
+/* Line 1806 of yacc.c  */
+#line 283 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("labeldegree", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 37:
+
+/* Line 1806 of yacc.c  */
+#line 286 "foreign-pajek-parser.y"
+    {
+         igraph_i_pajek_add_numeric_vertex_attribute("vertexsize", (yyvsp[(2) - (2)].realnum), context);
+     }
+    break;
+
+  case 38:
+
+/* Line 1806 of yacc.c  */
+#line 291 "foreign-pajek-parser.y"
+    { context->mode=3; }
+    break;
+
+  case 39:
+
+/* Line 1806 of yacc.c  */
+#line 291 "foreign-pajek-parser.y"
+    { 
+         context->mode=1;
+	 igraph_i_pajek_add_string_vertex_attribute("font", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+     }
+    break;
+
+  case 40:
+
+/* Line 1806 of yacc.c  */
+#line 295 "foreign-pajek-parser.y"
+    { context->mode=3; }
+    break;
+
+  case 41:
+
+/* Line 1806 of yacc.c  */
+#line 295 "foreign-pajek-parser.y"
+    {
+         context->mode=1;
+	 igraph_i_pajek_add_string_vertex_attribute("url", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+     }
+    break;
+
+  case 42:
+
+/* Line 1806 of yacc.c  */
+#line 299 "foreign-pajek-parser.y"
+    { context->mode=3; }
+    break;
+
+  case 43:
+
+/* Line 1806 of yacc.c  */
+#line 299 "foreign-pajek-parser.y"
+    {
+         context->mode=1;
+	 igraph_i_pajek_add_string_vertex_attribute("color", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+     }
+    break;
+
+  case 44:
+
+/* Line 1806 of yacc.c  */
+#line 303 "foreign-pajek-parser.y"
+    { context->mode=3; }
+    break;
+
+  case 45:
+
+/* Line 1806 of yacc.c  */
+#line 303 "foreign-pajek-parser.y"
+    {
+         context->mode=1;
+	 igraph_i_pajek_add_string_vertex_attribute("framecolor", 
+						    (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+     }
+    break;
+
+  case 46:
+
+/* Line 1806 of yacc.c  */
+#line 308 "foreign-pajek-parser.y"
+    { context->mode=3; }
+    break;
+
+  case 47:
+
+/* Line 1806 of yacc.c  */
+#line 308 "foreign-pajek-parser.y"
+    {
+         context->mode=1;
+	 igraph_i_pajek_add_string_vertex_attribute("labelcolor", 
+						    (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+     }
+    break;
+
+  case 48:
+
+/* Line 1806 of yacc.c  */
+#line 315 "foreign-pajek-parser.y"
+    { (yyval.string)=(yyvsp[(1) - (1)].string); }
+    break;
+
+  case 55:
+
+/* Line 1806 of yacc.c  */
+#line 319 "foreign-pajek-parser.y"
+    { context->directed=1; }
+    break;
+
+  case 56:
+
+/* Line 1806 of yacc.c  */
+#line 320 "foreign-pajek-parser.y"
+    { context->directed=1; }
+    break;
+
+  case 60:
+
+/* Line 1806 of yacc.c  */
+#line 325 "foreign-pajek-parser.y"
+    { context->actedge++;
+	                  context->mode=2; }
+    break;
+
+  case 61:
+
+/* Line 1806 of yacc.c  */
+#line 326 "foreign-pajek-parser.y"
+    { 
+  igraph_vector_push_back(context->vector, (yyvsp[(1) - (6)].intnum)-1);
+  igraph_vector_push_back(context->vector, (yyvsp[(2) - (6)].intnum)-1); }
+    break;
+
+  case 64:
+
+/* Line 1806 of yacc.c  */
+#line 335 "foreign-pajek-parser.y"
+    { context->directed=0; }
+    break;
+
+  case 65:
+
+/* Line 1806 of yacc.c  */
+#line 336 "foreign-pajek-parser.y"
+    { context->directed=0; }
+    break;
+
+  case 69:
+
+/* Line 1806 of yacc.c  */
+#line 341 "foreign-pajek-parser.y"
+    { context->actedge++; 
+	                    context->mode=2; }
+    break;
+
+  case 70:
+
+/* Line 1806 of yacc.c  */
+#line 342 "foreign-pajek-parser.y"
+    { 
+  igraph_vector_push_back(context->vector, (yyvsp[(1) - (6)].intnum)-1);
+  igraph_vector_push_back(context->vector, (yyvsp[(2) - (6)].intnum)-1); }
+    break;
+
+  case 74:
+
+/* Line 1806 of yacc.c  */
+#line 351 "foreign-pajek-parser.y"
+    {
+  igraph_i_pajek_add_numeric_edge_attribute("weight", (yyvsp[(1) - (1)].realnum), context);
+}
+    break;
+
+  case 78:
+
+/* Line 1806 of yacc.c  */
+#line 359 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("color-red", (yyvsp[(2) - (4)].realnum), context);
+       igraph_i_pajek_add_numeric_edge_attribute("color-green", (yyvsp[(3) - (4)].realnum), context);
+       igraph_i_pajek_add_numeric_edge_attribute("color-blue", (yyvsp[(4) - (4)].realnum), context);
+   }
+    break;
+
+  case 79:
+
+/* Line 1806 of yacc.c  */
+#line 364 "foreign-pajek-parser.y"
+    { 
+       igraph_i_pajek_add_numeric_edge_attribute("arrowsize", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 80:
+
+/* Line 1806 of yacc.c  */
+#line 367 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("edgewidth", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 81:
+
+/* Line 1806 of yacc.c  */
+#line 370 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("hook1", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 82:
+
+/* Line 1806 of yacc.c  */
+#line 373 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("hook2", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 83:
+
+/* Line 1806 of yacc.c  */
+#line 376 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("angle1", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 84:
+
+/* Line 1806 of yacc.c  */
+#line 379 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("angle2", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 85:
+
+/* Line 1806 of yacc.c  */
+#line 382 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("velocity1", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 86:
+
+/* Line 1806 of yacc.c  */
+#line 385 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("velocity2", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 87:
+
+/* Line 1806 of yacc.c  */
+#line 388 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("arrowpos", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 88:
+
+/* Line 1806 of yacc.c  */
+#line 391 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("labelpos", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 89:
+
+/* Line 1806 of yacc.c  */
+#line 394 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("labelangle", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 90:
+
+/* Line 1806 of yacc.c  */
+#line 397 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("labelangle2", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 91:
+
+/* Line 1806 of yacc.c  */
+#line 400 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("labeldegree", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 92:
+
+/* Line 1806 of yacc.c  */
+#line 403 "foreign-pajek-parser.y"
+    {		/* what is this??? */
+       igraph_i_pajek_add_numeric_edge_attribute("arrowsize", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 93:
+
+/* Line 1806 of yacc.c  */
+#line 406 "foreign-pajek-parser.y"
+    {
+       igraph_i_pajek_add_numeric_edge_attribute("fontsize", (yyvsp[(2) - (2)].realnum), context);
+   }
+    break;
+
+  case 94:
+
+/* Line 1806 of yacc.c  */
+#line 411 "foreign-pajek-parser.y"
+    { context->mode=4; }
+    break;
+
+  case 95:
+
+/* Line 1806 of yacc.c  */
+#line 411 "foreign-pajek-parser.y"
+    {
+      context->mode=2;
+      igraph_i_pajek_add_string_edge_attribute("arrowtype", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+    }
+    break;
+
+  case 96:
+
+/* Line 1806 of yacc.c  */
+#line 415 "foreign-pajek-parser.y"
+    { context->mode=4; }
+    break;
+
+  case 97:
+
+/* Line 1806 of yacc.c  */
+#line 415 "foreign-pajek-parser.y"
+    {
+      context->mode=2;
+      igraph_i_pajek_add_string_edge_attribute("linepattern", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+    }
+    break;
+
+  case 98:
+
+/* Line 1806 of yacc.c  */
+#line 419 "foreign-pajek-parser.y"
+    { context->mode=4; }
+    break;
+
+  case 99:
+
+/* Line 1806 of yacc.c  */
+#line 419 "foreign-pajek-parser.y"
+    {
+      context->mode=2;
+      igraph_i_pajek_add_string_edge_attribute("label", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+    }
+    break;
+
+  case 100:
+
+/* Line 1806 of yacc.c  */
+#line 423 "foreign-pajek-parser.y"
+    { context->mode=4; }
+    break;
+
+  case 101:
+
+/* Line 1806 of yacc.c  */
+#line 423 "foreign-pajek-parser.y"
+    {
+      context->mode=2;
+      igraph_i_pajek_add_string_edge_attribute("labelcolor", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+    }
+    break;
+
+  case 102:
+
+/* Line 1806 of yacc.c  */
+#line 427 "foreign-pajek-parser.y"
+    { context->mode=4; }
+    break;
+
+  case 103:
+
+/* Line 1806 of yacc.c  */
+#line 427 "foreign-pajek-parser.y"
+    {
+      context->mode=2;
+      igraph_i_pajek_add_string_edge_attribute("color", (yyvsp[(3) - (3)].string).str, (yyvsp[(3) - (3)].string).len, context);
+    }
+    break;
+
+  case 104:
+
+/* Line 1806 of yacc.c  */
+#line 433 "foreign-pajek-parser.y"
+    { context->mode=2; (yyval.string)=(yyvsp[(1) - (1)].string); }
+    break;
+
+  case 105:
+
+/* Line 1806 of yacc.c  */
+#line 435 "foreign-pajek-parser.y"
+    { context->directed=1; }
+    break;
+
+  case 112:
+
+/* Line 1806 of yacc.c  */
+#line 443 "foreign-pajek-parser.y"
+    { context->mode=0; context->actfrom=fabs((yyvsp[(1) - (1)].intnum))-1; }
+    break;
+
+  case 113:
+
+/* Line 1806 of yacc.c  */
+#line 445 "foreign-pajek-parser.y"
+    { 
+  igraph_vector_push_back(context->vector, context->actfrom); 
+  igraph_vector_push_back(context->vector, fabs((yyvsp[(1) - (1)].intnum))-1); 
+}
+    break;
+
+  case 114:
+
+/* Line 1806 of yacc.c  */
+#line 450 "foreign-pajek-parser.y"
+    { context->directed=0; }
+    break;
+
+  case 121:
+
+/* Line 1806 of yacc.c  */
+#line 458 "foreign-pajek-parser.y"
+    { context->mode=0; context->actfrom=fabs((yyvsp[(1) - (1)].intnum))-1; }
+    break;
+
+  case 122:
+
+/* Line 1806 of yacc.c  */
+#line 460 "foreign-pajek-parser.y"
+    { 
+  igraph_vector_push_back(context->vector, context->actfrom); 
+  igraph_vector_push_back(context->vector, fabs((yyvsp[(1) - (1)].intnum))-1); 
+}
+    break;
+
+  case 124:
+
+/* Line 1806 of yacc.c  */
+#line 469 "foreign-pajek-parser.y"
+    { context->actfrom=0; context->actto=0; }
+    break;
+
+  case 127:
+
+/* Line 1806 of yacc.c  */
+#line 473 "foreign-pajek-parser.y"
+    { context->actfrom++; context->actto=0; }
+    break;
+
+  case 130:
+
+/* Line 1806 of yacc.c  */
+#line 477 "foreign-pajek-parser.y"
+    {
+  if ((yyvsp[(1) - (1)].intnum)>0) { 
+    igraph_vector_push_back(context->vector, context->actfrom);
+    igraph_vector_push_back(context->vector, context->actto);
+  }
+  context->actto++;
+}
+    break;
+
+  case 131:
+
+/* Line 1806 of yacc.c  */
+#line 487 "foreign-pajek-parser.y"
+    { (yyval.intnum)=igraph_pajek_get_number(igraph_pajek_yyget_text(scanner),
+					  igraph_pajek_yyget_leng(scanner)); }
+    break;
+
+  case 132:
+
+/* Line 1806 of yacc.c  */
+#line 490 "foreign-pajek-parser.y"
+    { (yyval.realnum)=igraph_pajek_get_number(igraph_pajek_yyget_text(scanner),
+					  igraph_pajek_yyget_leng(scanner)); }
+    break;
+
+  case 135:
+
+/* Line 1806 of yacc.c  */
+#line 495 "foreign-pajek-parser.y"
+    { (yyval.string).str=igraph_pajek_yyget_text(scanner); 
+              (yyval.string).len=igraph_pajek_yyget_leng(scanner); }
+    break;
+
+  case 136:
+
+/* Line 1806 of yacc.c  */
+#line 497 "foreign-pajek-parser.y"
+    { (yyval.string).str=igraph_pajek_yyget_text(scanner); 
+              (yyval.string).len=igraph_pajek_yyget_leng(scanner); }
+    break;
+
+  case 137:
+
+/* Line 1806 of yacc.c  */
+#line 499 "foreign-pajek-parser.y"
+    { (yyval.string).str=igraph_pajek_yyget_text(scanner)+1; 
+               (yyval.string).len=igraph_pajek_yyget_leng(scanner)-2; }
+    break;
+
+
+
+/* Line 1806 of yacc.c  */
+#line 2575 "foreign-pajek-parser.c"
+      default: break;
+    }
+  /* User semantic actions sometimes alter yychar, and that requires
+     that yytoken be updated with the new translation.  We take the
+     approach of translating immediately before every use of yytoken.
+     One alternative is translating here after every semantic action,
+     but that translation would be missed if the semantic action invokes
+     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
+     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
+     incorrect destructor might then be invoked immediately.  In the
+     case of YYERROR or YYBACKUP, subsequent parser actions might lead
+     to an incorrect destructor call or verbose syntax error message
+     before the lookahead is translated.  */
+  YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
+
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+  *++yylsp = yyloc;
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* Make sure we have latest lookahead translation.  See comments at
+     user semantic actions for why this is necessary.  */
+  yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
+
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if ! YYERROR_VERBOSE
+      yyerror (&yylloc, context, YY_("syntax error"));
+#else
+# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
+                                        yyssp, yytoken)
+      {
+        char const *yymsgp = YY_("syntax error");
+        int yysyntax_error_status;
+        yysyntax_error_status = YYSYNTAX_ERROR;
+        if (yysyntax_error_status == 0)
+          yymsgp = yymsg;
+        else if (yysyntax_error_status == 1)
+          {
+            if (yymsg != yymsgbuf)
+              YYSTACK_FREE (yymsg);
+            yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
+            if (!yymsg)
+              {
+                yymsg = yymsgbuf;
+                yymsg_alloc = sizeof yymsgbuf;
+                yysyntax_error_status = 2;
+              }
+            else
+              {
+                yysyntax_error_status = YYSYNTAX_ERROR;
+                yymsgp = yymsg;
+              }
+          }
+        yyerror (&yylloc, context, yymsgp);
+        if (yysyntax_error_status == 2)
+          goto yyexhaustedlab;
+      }
+# undef YYSYNTAX_ERROR
+#endif
+    }
+
+  yyerror_range[1] = yylloc;
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse lookahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+	{
+	  /* Return failure if at end of input.  */
+	  if (yychar == YYEOF)
+	    YYABORT;
+	}
+      else
+	{
+	  yydestruct ("Error: discarding",
+		      yytoken, &yylval, &yylloc, context);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse lookahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+  /* Pacify compilers like GCC when the user code never invokes
+     YYERROR and the label yyerrorlab therefore never appears in user
+     code.  */
+  if (/*CONSTCOND*/ 0)
+     goto yyerrorlab;
+
+  yyerror_range[1] = yylsp[1-yylen];
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYERROR.  */
+  YYPOPSTACK (yylen);
+  yylen = 0;
+  YY_STACK_PRINT (yyss, yyssp);
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (!yypact_value_is_default (yyn))
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+      yyerror_range[1] = *yylsp;
+      yydestruct ("Error: popping",
+		  yystos[yystate], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  *++yyvsp = yylval;
+
+  yyerror_range[2] = yylloc;
+  /* Using YYLLOC is tempting, but would change the location of
+     the lookahead.  YYLOC is available though.  */
+  YYLLOC_DEFAULT (yyloc, yyerror_range, 2);
+  *++yylsp = yyloc;
+
+  /* Shift the error token.  */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yyresult = 1;
+  goto yyreturn;
+
+#if !defined(yyoverflow) || YYERROR_VERBOSE
+/*-------------------------------------------------.
+| yyexhaustedlab -- memory exhaustion comes here.  |
+`-------------------------------------------------*/
+yyexhaustedlab:
+  yyerror (&yylloc, context, YY_("memory exhausted"));
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+  if (yychar != YYEMPTY)
+    {
+      /* Make sure we have latest lookahead translation.  See comments at
+         user semantic actions for why this is necessary.  */
+      yytoken = YYTRANSLATE (yychar);
+      yydestruct ("Cleanup: discarding lookahead",
+                  yytoken, &yylval, &yylloc, context);
+    }
+  /* Do not reclaim the symbols of the rule which action triggered
+     this YYABORT or YYACCEPT.  */
+  YYPOPSTACK (yylen);
+  YY_STACK_PRINT (yyss, yyssp);
+  while (yyssp != yyss)
+    {
+      yydestruct ("Cleanup: popping",
+		  yystos[*yyssp], yyvsp, yylsp, context);
+      YYPOPSTACK (1);
+    }
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+#if YYERROR_VERBOSE
+  if (yymsg != yymsgbuf)
+    YYSTACK_FREE (yymsg);
+#endif
+  /* Make sure YYID is used.  */
+  return YYID (yyresult);
+}
+
+
+
+/* Line 2067 of yacc.c  */
+#line 502 "foreign-pajek-parser.y"
+
+
+int igraph_pajek_yyerror(YYLTYPE* locp, 
+			 igraph_i_pajek_parsedata_t *context, 
+			 char *s) {
+  snprintf(context->errmsg, sizeof(context->errmsg)/sizeof(char)-1, 
+	   "Parse error in Pajek file, line %i (%s)", 
+	   locp->first_line, s);
+  return 0;
+}
+
+igraph_real_t igraph_pajek_get_number(const char *str, long int length) {
+  igraph_real_t num;
+  char *tmp=igraph_Calloc(length+1, char);
+  
+  strncpy(tmp, str, length);
+  tmp[length]='\0';
+  sscanf(tmp, "%lf", &num);
+  igraph_Free(tmp);
+  return num;
+} 
+
+/* TODO: NA's */
+
+int igraph_i_pajek_add_numeric_attribute(igraph_trie_t *names,
+					 igraph_vector_ptr_t *attrs,
+					 long int count,
+					 const char *attrname,
+					 igraph_integer_t vid,
+					 igraph_real_t number) {
+  long int attrsize=igraph_trie_size(names);
+  long int id;
+  igraph_vector_t *na;
+  igraph_attribute_record_t *rec;
+
+  igraph_trie_get(names, attrname, &id);
+  if (id == attrsize) {
+    /* add a new attribute */
+    rec=igraph_Calloc(1, igraph_attribute_record_t);
+    na=igraph_Calloc(1, igraph_vector_t);
+    igraph_vector_init(na, count);
+    rec->name=strdup(attrname);
+    rec->type=IGRAPH_ATTRIBUTE_NUMERIC;
+    rec->value=na;
+    igraph_vector_ptr_push_back(attrs, rec);
+  }
+  rec=VECTOR(*attrs)[id];
+  na=(igraph_vector_t*)rec->value;
+  if (igraph_vector_size(na) == vid) {
+    IGRAPH_CHECK(igraph_vector_push_back(na, number));
+  } else if (igraph_vector_size(na) < vid) {
+    long int origsize=igraph_vector_size(na);
+    IGRAPH_CHECK(igraph_vector_resize(na, (long int)vid+1));
+    for (;origsize<count; origsize++) {
+      VECTOR(*na)[origsize] = IGRAPH_NAN;
+    }
+    VECTOR(*na)[(long int) vid] = number;
+  } else { 
+    VECTOR(*na)[(long int) vid] = number;
+  }    
+
+  return 0;
+}
+
+/* TODO: NA's */
+
+int igraph_i_pajek_add_string_attribute(igraph_trie_t *names,
+					igraph_vector_ptr_t *attrs,
+					long int count,
+					const char *attrname,
+					igraph_integer_t vid,
+					const char *str) {
+  long int attrsize=igraph_trie_size(names);
+  long int id;
+  igraph_strvector_t *na;
+  igraph_attribute_record_t *rec;
+  long int i;
+
+  igraph_trie_get(names, attrname, &id);
+  if (id == attrsize) {
+    /* add a new attribute */
+    rec=igraph_Calloc(1, igraph_attribute_record_t);
+    na=igraph_Calloc(1, igraph_strvector_t);
+    igraph_strvector_init(na, count);
+    for (i=0; i<count; i++) {
+      igraph_strvector_set(na, i, "");
+    }
+    rec->name=strdup(attrname);
+    rec->type=IGRAPH_ATTRIBUTE_STRING;
+    rec->value=na;
+    igraph_vector_ptr_push_back(attrs, rec);
+  }
+  rec=VECTOR(*attrs)[id];
+  na=(igraph_strvector_t*)rec->value;
+  if (igraph_strvector_size(na) <= vid) { 
+    long int origsize=igraph_strvector_size(na);
+    IGRAPH_CHECK(igraph_strvector_resize(na, vid+1));
+    for (;origsize<count; origsize++) {
+      igraph_strvector_set(na, origsize, "");
+    }
+  }
+  igraph_strvector_set(na, vid, str);
+
+  return 0;
+}
+
+int igraph_i_pajek_add_string_vertex_attribute(const char *name, 
+					       const char *value,
+					       int len,
+					       igraph_i_pajek_parsedata_t *context) {
+  char *tmp;
+  int ret;
+
+  tmp=igraph_Calloc(len+1, char);
+  if (tmp==0) {
+    IGRAPH_ERROR("cannot add element to hash table", IGRAPH_ENOMEM);
+  }
+  IGRAPH_FINALLY(free, tmp);
+  strncpy(tmp, value, len);
+  tmp[len]='\0';
+
+  ret=igraph_i_pajek_add_string_attribute(context->vertex_attribute_names,
+					  context->vertex_attributes,
+					  context->vcount,
+					  name, context->actvertex-1,
+					  tmp);
+  
+  igraph_Free(tmp);
+  IGRAPH_FINALLY_CLEAN(1);
+  
+  return ret;
+}
+
+int igraph_i_pajek_add_string_edge_attribute(const char *name, 
+					     const char *value,
+					     int len, 
+					     igraph_i_pajek_parsedata_t *context) {
+  char *tmp;
+  int ret;
+
+  tmp=igraph_Calloc(len+1, char);
+  if (tmp==0) {
+    IGRAPH_ERROR("cannot add element to hash table", IGRAPH_ENOMEM);
+  }
+  IGRAPH_FINALLY(free, tmp);
+  strncpy(tmp, value, len);
+  tmp[len]='\0';
+  
+  ret=igraph_i_pajek_add_string_attribute(context->edge_attribute_names,
+					  context->edge_attributes,
+					  context->actedge,
+					  name, context->actedge-1,
+					  tmp);
+
+  igraph_Free(tmp);
+  IGRAPH_FINALLY_CLEAN(1);
+  
+  return ret;
+}
+
+int igraph_i_pajek_add_numeric_vertex_attribute(const char *name, 
+						igraph_real_t value, 
+						igraph_i_pajek_parsedata_t *context) {
+  
+  return
+    igraph_i_pajek_add_numeric_attribute(context->vertex_attribute_names,
+					 context->vertex_attributes,
+					 context->vcount,
+					 name, context->actvertex-1,
+					 value);
+}
+
+int igraph_i_pajek_add_numeric_edge_attribute(const char *name, 
+					      igraph_real_t value, 
+					      igraph_i_pajek_parsedata_t *context) {
+
+  return
+    igraph_i_pajek_add_numeric_attribute(context->edge_attribute_names,
+					 context->edge_attributes,
+					 context->actedge,
+					 name, context->actedge-1,
+					 value);
+}
+
+int igraph_i_pajek_add_bipartite_type(igraph_i_pajek_parsedata_t *context) {
+  
+  const char *attrname="type";
+  igraph_trie_t *names=context->vertex_attribute_names;
+  igraph_vector_ptr_t *attrs=context->vertex_attributes;
+  int i, n=context->vcount, n1=context->vcount2;
+  long int attrid, attrsize=igraph_trie_size(names);
+  igraph_attribute_record_t *rec;  
+  igraph_vector_t *na;
+
+  if (n1 > n) { 
+    IGRAPH_ERROR("Invalid number of vertices in bipartite Pajek file", 
+		 IGRAPH_PARSEERROR);
+  }
+
+  igraph_trie_get(names, attrname, &attrid);
+  if (attrid != attrsize) { 
+    IGRAPH_ERROR("Duplicate 'type' attribute in Pajek file, "
+		 "this should not happen", IGRAPH_EINTERNAL);
+  }
+  
+  /* add a new attribute */
+  rec=igraph_Calloc(1, igraph_attribute_record_t);
+  na=igraph_Calloc(1, igraph_vector_t);
+  igraph_vector_init(na, n);
+  rec->name=strdup(attrname);
+  rec->type=IGRAPH_ATTRIBUTE_NUMERIC;
+  rec->value=na;
+  igraph_vector_ptr_push_back(attrs, rec);
+
+  for (i=0; i<n1; i++) { 
+    VECTOR(*na)[i] = 0;
+  }
+  for (i=n1; i<n; i++) { 
+    VECTOR(*na)[i] = 1;
+  }
+
+  return 0;
+}
+
+int igraph_i_pajek_check_bipartite(igraph_i_pajek_parsedata_t *context) {
+  const igraph_vector_t *edges=context->vector;
+  int i, n1=context->vcount2;
+  int ne=igraph_vector_size(edges);
+  
+  for (i=0; i<ne; i+=2) {
+    int v1=VECTOR(*edges)[i];
+    int v2=VECTOR(*edges)[i+1];
+    if ( (v1 < n1 && v2 < n1) || (v1 > n1 && v2 > n1) ) {
+      IGRAPH_WARNING("Invalid edge in bipartite graph");
+    }
+  }
+  
+  return 0;
+}
+
diff -Nru igraph-0.6.5~quantal1/src/foreign-pajek-parser.h igraph-0.6.5/src/foreign-pajek-parser.h
--- igraph-0.6.5~quantal1/src/foreign-pajek-parser.h	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/src/foreign-pajek-parser.h	2013-03-03 01:30:11.000000000 +0000
@@ -0,0 +1,183 @@
+/* A Bison parser, made by GNU Bison 2.5.  */
+
+/* Bison interface for Yacc-like parsers in C
+   
+      Copyright (C) 1984, 1989-1990, 2000-2011 Free Software Foundation, Inc.
+   
+   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/>.  */
+
+/* As a special exception, you may create a larger work that contains
+   part or all of the Bison parser skeleton and distribute that work
+   under terms of your choice, so long as that work isn't itself a
+   parser generator using the skeleton or a modified version thereof
+   as a parser skeleton.  Alternatively, if you modify or redistribute
+   the parser skeleton itself, you may (at your option) remove this
+   special exception, which will cause the skeleton and the resulting
+   Bison output files to be licensed under the GNU General Public
+   License without this special exception.
+   
+   This special exception was added by the Free Software Foundation in
+   version 2.2 of Bison.  */
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     NEWLINE = 258,
+     NUM = 259,
+     ALNUM = 260,
+     QSTR = 261,
+     PSTR = 262,
+     NETWORKLINE = 263,
+     VERTICESLINE = 264,
+     ARCSLINE = 265,
+     EDGESLINE = 266,
+     ARCSLISTLINE = 267,
+     EDGESLISTLINE = 268,
+     MATRIXLINE = 269,
+     VP_X_FACT = 270,
+     VP_Y_FACT = 271,
+     VP_IC = 272,
+     VP_BC = 273,
+     VP_LC = 274,
+     VP_LR = 275,
+     VP_LPHI = 276,
+     VP_BW = 277,
+     VP_FOS = 278,
+     VP_PHI = 279,
+     VP_R = 280,
+     VP_Q = 281,
+     VP_LA = 282,
+     VP_FONT = 283,
+     VP_URL = 284,
+     VP_SIZE = 285,
+     EP_C = 286,
+     EP_S = 287,
+     EP_A = 288,
+     EP_W = 289,
+     EP_H1 = 290,
+     EP_H2 = 291,
+     EP_A1 = 292,
+     EP_A2 = 293,
+     EP_K1 = 294,
+     EP_K2 = 295,
+     EP_AP = 296,
+     EP_P = 297,
+     EP_L = 298,
+     EP_LP = 299,
+     EP_LR = 300,
+     EP_LPHI = 301,
+     EP_LC = 302,
+     EP_LA = 303,
+     EP_SIZE = 304,
+     EP_FOS = 305
+   };
+#endif
+/* Tokens.  */
+#define NEWLINE 258
+#define NUM 259
+#define ALNUM 260
+#define QSTR 261
+#define PSTR 262
+#define NETWORKLINE 263
+#define VERTICESLINE 264
+#define ARCSLINE 265
+#define EDGESLINE 266
+#define ARCSLISTLINE 267
+#define EDGESLISTLINE 268
+#define MATRIXLINE 269
+#define VP_X_FACT 270
+#define VP_Y_FACT 271
+#define VP_IC 272
+#define VP_BC 273
+#define VP_LC 274
+#define VP_LR 275
+#define VP_LPHI 276
+#define VP_BW 277
+#define VP_FOS 278
+#define VP_PHI 279
+#define VP_R 280
+#define VP_Q 281
+#define VP_LA 282
+#define VP_FONT 283
+#define VP_URL 284
+#define VP_SIZE 285
+#define EP_C 286
+#define EP_S 287
+#define EP_A 288
+#define EP_W 289
+#define EP_H1 290
+#define EP_H2 291
+#define EP_A1 292
+#define EP_A2 293
+#define EP_K1 294
+#define EP_K2 295
+#define EP_AP 296
+#define EP_P 297
+#define EP_L 298
+#define EP_LP 299
+#define EP_LR 300
+#define EP_LPHI 301
+#define EP_LC 302
+#define EP_LA 303
+#define EP_SIZE 304
+#define EP_FOS 305
+
+
+
+
+#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
+typedef union YYSTYPE
+{
+
+/* Line 2068 of yacc.c  */
+#line 118 "foreign-pajek-parser.y"
+
+  long int intnum;
+  double   realnum;  
+  struct {
+    char *str;
+    int len;
+  } string;  
+
+
+
+/* Line 2068 of yacc.c  */
+#line 161 "foreign-pajek-parser.h"
+} YYSTYPE;
+# define YYSTYPE_IS_TRIVIAL 1
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+#endif
+
+
+
+#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED
+typedef struct YYLTYPE
+{
+  int first_line;
+  int first_column;
+  int last_line;
+  int last_column;
+} YYLTYPE;
+# define yyltype YYLTYPE /* obsolescent; will be withdrawn */
+# define YYLTYPE_IS_DECLARED 1
+# define YYLTYPE_IS_TRIVIAL 1
+#endif
+
+
+
diff -Nru igraph-0.6.5~quantal1/src/igraph_f2c.h igraph-0.6.5/src/igraph_f2c.h
--- igraph-0.6.5~quantal1/src/igraph_f2c.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/igraph_f2c.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,223 +0,0 @@
-/* f2c.h  --  Standard Fortran to C header file */
-
-/**  barf  [ba:rf]  2.  "He suggested using FORTRAN, and everybody barfed."
-
-	- From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) */
-
-#ifndef F2C_INCLUDE
-#define F2C_INCLUDE
-
-typedef long int integer;
-typedef unsigned long int uinteger;
-typedef char *address;
-typedef short int shortint;
-typedef float real;
-typedef double doublereal;
-typedef struct { real r, i; } complex;
-typedef struct { doublereal r, i; } doublecomplex;
-typedef long int logical;
-typedef short int shortlogical;
-typedef char logical1;
-typedef char integer1;
-#ifdef INTEGER_STAR_8	/* Adjust for integer*8. */
-typedef long long longint;		/* system-dependent */
-typedef unsigned long long ulongint;	/* system-dependent */
-#define qbit_clear(a,b)	((a) & ~((ulongint)1 << (b)))
-#define qbit_set(a,b)	((a) |  ((ulongint)1 << (b)))
-#endif
-
-#define TRUE_ (1)
-#define FALSE_ (0)
-
-/* Extern is for use with -E */
-#ifndef Extern
-#define Extern extern
-#endif
-
-/* I/O stuff */
-
-#ifdef f2c_i2
-/* for -i2 */
-typedef short flag;
-typedef short ftnlen;
-typedef short ftnint;
-#else
-typedef long int flag;
-typedef long int ftnlen;
-typedef long int ftnint;
-#endif
-
-/*external read, write*/
-typedef struct
-{	flag cierr;
-	ftnint ciunit;
-	flag ciend;
-	char *cifmt;
-	ftnint cirec;
-} cilist;
-
-/*internal read, write*/
-typedef struct
-{	flag icierr;
-	char *iciunit;
-	flag iciend;
-	char *icifmt;
-	ftnint icirlen;
-	ftnint icirnum;
-} icilist;
-
-/*open*/
-typedef struct
-{	flag oerr;
-	ftnint ounit;
-	char *ofnm;
-	ftnlen ofnmlen;
-	char *osta;
-	char *oacc;
-	char *ofm;
-	ftnint orl;
-	char *oblnk;
-} olist;
-
-/*close*/
-typedef struct
-{	flag cerr;
-	ftnint cunit;
-	char *csta;
-} cllist;
-
-/*rewind, backspace, endfile*/
-typedef struct
-{	flag aerr;
-	ftnint aunit;
-} alist;
-
-/* inquire */
-typedef struct
-{	flag inerr;
-	ftnint inunit;
-	char *infile;
-	ftnlen infilen;
-	ftnint	*inex;	/*parameters in standard's order*/
-	ftnint	*inopen;
-	ftnint	*innum;
-	ftnint	*innamed;
-	char	*inname;
-	ftnlen	innamlen;
-	char	*inacc;
-	ftnlen	inacclen;
-	char	*inseq;
-	ftnlen	inseqlen;
-	char 	*indir;
-	ftnlen	indirlen;
-	char	*infmt;
-	ftnlen	infmtlen;
-	char	*inform;
-	ftnint	informlen;
-	char	*inunf;
-	ftnlen	inunflen;
-	ftnint	*inrecl;
-	ftnint	*innrec;
-	char	*inblank;
-	ftnlen	inblanklen;
-} inlist;
-
-#define VOID void
-
-union Multitype {	/* for multiple entry points */
-	integer1 g;
-	shortint h;
-	integer i;
-	/* longint j; */
-	real r;
-	doublereal d;
-	complex c;
-	doublecomplex z;
-	};
-
-typedef union Multitype Multitype;
-
-/*typedef long int Long;*/	/* No longer used; formerly in Namelist */
-
-struct Vardesc {	/* for Namelist */
-	char *name;
-	char *addr;
-	ftnlen *dims;
-	int  type;
-	};
-typedef struct Vardesc Vardesc;
-
-struct Namelist {
-	char *name;
-	Vardesc **vars;
-	int nvars;
-	};
-typedef struct Namelist Namelist;
-
-#define abs(x) ((x) >= 0 ? (x) : -(x))
-#define dabs(x) (doublereal)abs(x)
-#define min(a,b) ((a) <= (b) ? (a) : (b))
-#define max(a,b) ((a) >= (b) ? (a) : (b))
-#define dmin(a,b) (doublereal)min(a,b)
-#define dmax(a,b) (doublereal)max(a,b)
-#define bit_test(a,b)	((a) >> (b) & 1)
-#define bit_clear(a,b)	((a) & ~((uinteger)1 << (b)))
-#define bit_set(a,b)	((a) |  ((uinteger)1 << (b)))
-
-/* procedure parameter types for -A and -C++ */
-
-#define F2C_proc_par_types 1
-#ifdef __cplusplus
-typedef int /* Unknown procedure type */ (*U_fp)(...);
-typedef shortint (*J_fp)(...);
-typedef integer (*I_fp)(...);
-typedef real (*R_fp)(...);
-typedef doublereal (*D_fp)(...), (*E_fp)(...);
-typedef /* Complex */ VOID (*C_fp)(...);
-typedef /* Double Complex */ VOID (*Z_fp)(...);
-typedef logical (*L_fp)(...);
-typedef shortlogical (*K_fp)(...);
-typedef /* Character */ VOID (*H_fp)(...);
-typedef /* Subroutine */ int (*S_fp)(...);
-#else
-typedef int /* Unknown procedure type */ (*U_fp)();
-typedef shortint (*J_fp)();
-typedef integer (*I_fp)();
-typedef real (*R_fp)();
-typedef doublereal (*D_fp)(), (*E_fp)();
-typedef /* Complex */ VOID (*C_fp)();
-typedef /* Double Complex */ VOID (*Z_fp)();
-typedef logical (*L_fp)();
-typedef shortlogical (*K_fp)();
-typedef /* Character */ VOID (*H_fp)();
-typedef /* Subroutine */ int (*S_fp)();
-#endif
-/* E_fp is for real functions when -R is not specified */
-typedef VOID C_f;	/* complex function */
-typedef VOID H_f;	/* character function */
-typedef VOID Z_f;	/* double complex function */
-typedef doublereal E_f;	/* real function with -R not specified */
-
-/* undef any lower-case symbols that your C compiler predefines, e.g.: */
-
-#ifndef Skip_f2c_Undefs
-#undef cray
-#undef gcos
-#undef mc68010
-#undef mc68020
-#undef mips
-#undef pdp11
-#undef sgi
-#undef sparc
-#undef sun
-#undef sun2
-#undef sun3
-#undef sun4
-#undef u370
-#undef u3b
-#undef u3b2
-#undef u3b5
-#undef unix
-#undef vax
-#endif
-#endif
diff -Nru igraph-0.6.5~quantal1/src/pstdint.h igraph-0.6.5/src/pstdint.h
--- igraph-0.6.5~quantal1/src/pstdint.h	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/src/pstdint.h	1970-01-01 00:00:00.000000000 +0000
@@ -1,799 +0,0 @@
-/*  A portable stdint.h
- ****************************************************************************
- *  BSD License:
- ****************************************************************************
- *
- *  Copyright (c) 2005-2007 Paul Hsieh
- *  All rights reserved.
- *  
- *  Redistribution and use in source and binary forms, with or without
- *  modification, are permitted provided that the following conditions
- *  are met:
- *  
- *  1. Redistributions of source code must retain the above copyright
- *     notice, this list of conditions and the following disclaimer.
- *  2. Redistributions in binary form must reproduce the above copyright
- *     notice, this list of conditions and the following disclaimer in the
- *     documentation and/or other materials provided with the distribution.
- *  3. The name of the author may not be used to endorse or promote products
- *     derived from this software without specific prior written permission.
- *  
- *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- *  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- *  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- *  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- *  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- *  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- *  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- ****************************************************************************
- *
- *  Version 0.1.11
- *
- *  The ANSI C standard committee, for the C99 standard, specified the
- *  inclusion of a new standard include file called stdint.h.  This is
- *  a very useful and long desired include file which contains several
- *  very precise definitions for integer scalar types that is
- *  critically important for making portable several classes of
- *  applications including cryptography, hashing, variable length
- *  integer libraries and so on.  But for most developers its likely
- *  useful just for programming sanity.
- *
- *  The problem is that most compiler vendors have decided not to
- *  implement the C99 standard, and the next C++ language standard
- *  (which has a lot more mindshare these days) will be a long time in
- *  coming and its unknown whether or not it will include stdint.h or
- *  how much adoption it will have.  Either way, it will be a long time
- *  before all compilers come with a stdint.h and it also does nothing
- *  for the extremely large number of compilers available today which
- *  do not include this file, or anything comparable to it.
- *
- *  So that's what this file is all about.  Its an attempt to build a
- *  single universal include file that works on as many platforms as
- *  possible to deliver what stdint.h is supposed to.  A few things
- *  that should be noted about this file:
- *
- *    1) It is not guaranteed to be portable and/or present an identical
- *       interface on all platforms.  The extreme variability of the
- *       ANSI C standard makes this an impossibility right from the
- *       very get go. Its really only meant to be useful for the vast
- *       majority of platforms that possess the capability of
- *       implementing usefully and precisely defined, standard sized
- *       integer scalars.  Systems which are not intrinsically 2s
- *       complement may produce invalid constants.
- *
- *    2) There is an unavoidable use of non-reserved symbols.
- *
- *    3) Other standard include files are invoked.
- *
- *    4) This file may come in conflict with future platforms that do
- *       include stdint.h.  The hope is that one or the other can be
- *       used with no real difference.
- *
- *    5) In the current verison, if your platform can't represent
- *       int32_t, int16_t and int8_t, it just dumps out with a compiler
- *       error.
- *
- *    6) 64 bit integers may or may not be defined.  Test for their
- *       presence with the test: #ifdef INT64_MAX or #ifdef UINT64_MAX.
- *       Note that this is different from the C99 specification which
- *       requires the existence of 64 bit support in the compiler.  If
- *       this is not defined for your platform, yet it is capable of
- *       dealing with 64 bits then it is because this file has not yet
- *       been extended to cover all of your system's capabilities.
- *
- *    7) (u)intptr_t may or may not be defined.  Test for its presence
- *       with the test: #ifdef PTRDIFF_MAX.  If this is not defined
- *       for your platform, then it is because this file has not yet
- *       been extended to cover all of your system's capabilities, not
- *       because its optional.
- *
- *    8) The following might not been defined even if your platform is
- *       capable of defining it:
- *
- *       WCHAR_MIN
- *       WCHAR_MAX
- *       (u)int64_t
- *       PTRDIFF_MIN
- *       PTRDIFF_MAX
- *       (u)intptr_t
- *
- *    9) The following have not been defined:
- *
- *       WINT_MIN
- *       WINT_MAX
- *
- *   10) The criteria for defining (u)int_least(*)_t isn't clear,
- *       except for systems which don't have a type that precisely
- *       defined 8, 16, or 32 bit types (which this include file does
- *       not support anyways). Default definitions have been given.
- *
- *   11) The criteria for defining (u)int_fast(*)_t isn't something I
- *       would trust to any particular compiler vendor or the ANSI C
- *       committee.  It is well known that "compatible systems" are
- *       commonly created that have very different performance
- *       characteristics from the systems they are compatible with,
- *       especially those whose vendors make both the compiler and the
- *       system.  Default definitions have been given, but its strongly
- *       recommended that users never use these definitions for any
- *       reason (they do *NOT* deliver any serious guarantee of
- *       improved performance -- not in this file, nor any vendor's
- *       stdint.h).
- *
- *   12) The following macros:
- *
- *       PRINTF_INTMAX_MODIFIER
- *       PRINTF_INT64_MODIFIER
- *       PRINTF_INT32_MODIFIER
- *       PRINTF_INT16_MODIFIER
- *       PRINTF_LEAST64_MODIFIER
- *       PRINTF_LEAST32_MODIFIER
- *       PRINTF_LEAST16_MODIFIER
- *       PRINTF_INTPTR_MODIFIER
- *
- *       are strings which have been defined as the modifiers required
- *       for the "d", "u" and "x" printf formats to correctly output
- *       (u)intmax_t, (u)int64_t, (u)int32_t, (u)int16_t, (u)least64_t,
- *       (u)least32_t, (u)least16_t and (u)intptr_t types respectively.
- *       PRINTF_INTPTR_MODIFIER is not defined for some systems which
- *       provide their own stdint.h.  PRINTF_INT64_MODIFIER is not
- *       defined if INT64_MAX is not defined.  These are an extension
- *       beyond what C99 specifies must be in stdint.h.
- *
- *       In addition, the following macros are defined:
- *
- *       PRINTF_INTMAX_HEX_WIDTH
- *       PRINTF_INT64_HEX_WIDTH
- *       PRINTF_INT32_HEX_WIDTH
- *       PRINTF_INT16_HEX_WIDTH
- *       PRINTF_INT8_HEX_WIDTH
- *       PRINTF_INTMAX_DEC_WIDTH
- *       PRINTF_INT64_DEC_WIDTH
- *       PRINTF_INT32_DEC_WIDTH
- *       PRINTF_INT16_DEC_WIDTH
- *       PRINTF_INT8_DEC_WIDTH
- *
- *       Which specifies the maximum number of characters required to
- *       print the number of that type in either hexadecimal or decimal.
- *       These are an extension beyond what C99 specifies must be in
- *       stdint.h.
- *
- *  Compilers tested (all with 0 warnings at their highest respective
- *  settings): Borland Turbo C 2.0, WATCOM C/C++ 11.0 (16 bits and 32
- *  bits), Microsoft Visual C++ 6.0 (32 bit), Microsoft Visual Studio
- *  .net (VC7), Intel C++ 4.0, GNU gcc v3.3.3
- *
- *  This file should be considered a work in progress.  Suggestions for
- *  improvements, especially those which increase coverage are strongly
- *  encouraged.
- *
- *  Acknowledgements
- *
- *  The following people have made significant contributions to the
- *  development and testing of this file:
- *
- *  Chris Howie
- *  John Steele Scott
- *  Dave Thorup
- *
- */
-
-#include <stddef.h>
-#include <limits.h>
-#include <signal.h>
-
-/*
- *  For gcc with _STDINT_H, fill in the PRINTF_INT*_MODIFIER macros, and
- *  do nothing else.  On the Mac OS X version of gcc this is _STDINT_H_.
- */
-
-#if ((defined(__STDC__) && __STDC__ && __STDC_VERSION__ >= 199901L) || (defined (__WATCOMC__) && (defined (_STDINT_H_INCLUDED) || __WATCOMC__ >= 1250)) || (defined(__GNUC__) && (defined(_STDINT_H) || defined(_STDINT_H_)) )) && !defined (_PSTDINT_H_INCLUDED)
-#include <stdint.h>
-#define _PSTDINT_H_INCLUDED
-# ifndef PRINTF_INT64_MODIFIER
-#  define PRINTF_INT64_MODIFIER "ll"
-# endif
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER "l"
-# endif
-# ifndef PRINTF_INT16_MODIFIER
-#  define PRINTF_INT16_MODIFIER "h"
-# endif
-# ifndef PRINTF_INTMAX_MODIFIER
-#  define PRINTF_INTMAX_MODIFIER PRINTF_INT64_MODIFIER
-# endif
-# ifndef PRINTF_INT64_HEX_WIDTH
-#  define PRINTF_INT64_HEX_WIDTH "16"
-# endif
-# ifndef PRINTF_INT32_HEX_WIDTH
-#  define PRINTF_INT32_HEX_WIDTH "8"
-# endif
-# ifndef PRINTF_INT16_HEX_WIDTH
-#  define PRINTF_INT16_HEX_WIDTH "4"
-# endif
-# ifndef PRINTF_INT8_HEX_WIDTH
-#  define PRINTF_INT8_HEX_WIDTH "2"
-# endif
-# ifndef PRINTF_INT64_DEC_WIDTH
-#  define PRINTF_INT64_DEC_WIDTH "20"
-# endif
-# ifndef PRINTF_INT32_DEC_WIDTH
-#  define PRINTF_INT32_DEC_WIDTH "10"
-# endif
-# ifndef PRINTF_INT16_DEC_WIDTH
-#  define PRINTF_INT16_DEC_WIDTH "5"
-# endif
-# ifndef PRINTF_INT8_DEC_WIDTH
-#  define PRINTF_INT8_DEC_WIDTH "3"
-# endif
-# ifndef PRINTF_INTMAX_HEX_WIDTH
-#  define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT64_HEX_WIDTH
-# endif
-# ifndef PRINTF_INTMAX_DEC_WIDTH
-#  define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT64_DEC_WIDTH
-# endif
-
-/*
- *  Something really weird is going on with Open Watcom.  Just pull some of
- *  these duplicated definitions from Open Watcom's stdint.h file for now.
- */
-
-# if defined (__WATCOMC__) && __WATCOMC__ >= 1250
-#  if !defined (INT64_C)
-#   define INT64_C(x)   (x + (INT64_MAX - INT64_MAX))
-#  endif
-#  if !defined (UINT64_C)
-#   define UINT64_C(x)  (x + (UINT64_MAX - UINT64_MAX))
-#  endif
-#  if !defined (INT32_C)
-#   define INT32_C(x)   (x + (INT32_MAX - INT32_MAX))
-#  endif
-#  if !defined (UINT32_C)
-#   define UINT32_C(x)  (x + (UINT32_MAX - UINT32_MAX))
-#  endif
-#  if !defined (INT16_C)
-#   define INT16_C(x)   (x)
-#  endif
-#  if !defined (UINT16_C)
-#   define UINT16_C(x)  (x)
-#  endif
-#  if !defined (INT8_C)
-#   define INT8_C(x)   (x)
-#  endif
-#  if !defined (UINT8_C)
-#   define UINT8_C(x)  (x)
-#  endif
-#  if !defined (UINT64_MAX)
-#   define UINT64_MAX  18446744073709551615ULL
-#  endif
-#  if !defined (INT64_MAX)
-#   define INT64_MAX  9223372036854775807LL
-#  endif
-#  if !defined (UINT32_MAX)
-#   define UINT32_MAX  4294967295UL
-#  endif
-#  if !defined (INT32_MAX)
-#   define INT32_MAX  2147483647L
-#  endif
-#  if !defined (INTMAX_MAX)
-#   define INTMAX_MAX INT64_MAX
-#  endif
-#  if !defined (INTMAX_MIN)
-#   define INTMAX_MIN INT64_MIN
-#  endif
-# endif
-#endif
-
-#ifndef _PSTDINT_H_INCLUDED
-#define _PSTDINT_H_INCLUDED
-
-#ifndef SIZE_MAX
-# define SIZE_MAX (~(size_t)0)
-#endif
-
-/*
- *  Deduce the type assignments from limits.h under the assumption that
- *  integer sizes in bits are powers of 2, and follow the ANSI
- *  definitions.
- */
-
-#ifndef UINT8_MAX
-# define UINT8_MAX 0xff
-#endif
-#ifndef uint8_t
-# if (UCHAR_MAX == UINT8_MAX) || defined (S_SPLINT_S)
-    typedef unsigned char uint8_t;
-#   define UINT8_C(v) ((uint8_t) v)
-# else
-#   error "Platform not supported"
-# endif
-#endif
-
-#ifndef INT8_MAX
-# define INT8_MAX 0x7f
-#endif
-#ifndef INT8_MIN
-# define INT8_MIN INT8_C(0x80)
-#endif
-#ifndef int8_t
-# if (SCHAR_MAX == INT8_MAX) || defined (S_SPLINT_S)
-    typedef signed char int8_t;
-#   define INT8_C(v) ((int8_t) v)
-# else
-#   error "Platform not supported"
-# endif
-#endif
-
-#ifndef UINT16_MAX
-# define UINT16_MAX 0xffff
-#endif
-#ifndef uint16_t
-#if (UINT_MAX == UINT16_MAX) || defined (S_SPLINT_S)
-  typedef unsigned int uint16_t;
-# ifndef PRINTF_INT16_MODIFIER
-#  define PRINTF_INT16_MODIFIER ""
-# endif
-# define UINT16_C(v) ((uint16_t) (v))
-#elif (USHRT_MAX == UINT16_MAX)
-  typedef unsigned short uint16_t;
-# define UINT16_C(v) ((uint16_t) (v))
-# ifndef PRINTF_INT16_MODIFIER
-#  define PRINTF_INT16_MODIFIER "h"
-# endif
-#else
-#error "Platform not supported"
-#endif
-#endif
-
-#ifndef INT16_MAX
-# define INT16_MAX 0x7fff
-#endif
-#ifndef INT16_MIN
-# define INT16_MIN INT16_C(0x8000)
-#endif
-#ifndef int16_t
-#if (INT_MAX == INT16_MAX) || defined (S_SPLINT_S)
-  typedef signed int int16_t;
-# define INT16_C(v) ((int16_t) (v))
-# ifndef PRINTF_INT16_MODIFIER
-#  define PRINTF_INT16_MODIFIER ""
-# endif
-#elif (SHRT_MAX == INT16_MAX)
-  typedef signed short int16_t;
-# define INT16_C(v) ((int16_t) (v))
-# ifndef PRINTF_INT16_MODIFIER
-#  define PRINTF_INT16_MODIFIER "h"
-# endif
-#else
-#error "Platform not supported"
-#endif
-#endif
-
-#ifndef UINT32_MAX
-# define UINT32_MAX (0xffffffffUL)
-#endif
-#ifndef uint32_t
-#if (ULONG_MAX == UINT32_MAX) || defined (S_SPLINT_S)
-  typedef unsigned long uint32_t;
-# define UINT32_C(v) v ## UL
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER "l"
-# endif
-#elif (UINT_MAX == UINT32_MAX)
-  typedef unsigned int uint32_t;
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER ""
-# endif
-# define UINT32_C(v) v ## U
-#elif (USHRT_MAX == UINT32_MAX)
-  typedef unsigned short uint32_t;
-# define UINT32_C(v) ((unsigned short) (v))
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER ""
-# endif
-#else
-#error "Platform not supported"
-#endif
-#endif
-
-#ifndef INT32_MAX
-# define INT32_MAX (0x7fffffffL)
-#endif
-#ifndef INT32_MIN
-# define INT32_MIN INT32_C(0x80000000)
-#endif
-#ifndef int32_t
-#if (LONG_MAX == INT32_MAX) || defined (S_SPLINT_S)
-  typedef signed long int32_t;
-# define INT32_C(v) v ## L
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER "l"
-# endif
-#elif (INT_MAX == INT32_MAX)
-  typedef signed int int32_t;
-# define INT32_C(v) v
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER ""
-# endif
-#elif (SHRT_MAX == INT32_MAX)
-  typedef signed short int32_t;
-# define INT32_C(v) ((short) (v))
-# ifndef PRINTF_INT32_MODIFIER
-#  define PRINTF_INT32_MODIFIER ""
-# endif
-#else
-#error "Platform not supported"
-#endif
-#endif
-
-/*
- *  The macro stdint_int64_defined is temporarily used to record
- *  whether or not 64 integer support is available.  It must be
- *  defined for any 64 integer extensions for new platforms that are
- *  added.
- */
-
-#undef stdint_int64_defined
-#if (defined(__STDC__) && defined(__STDC_VERSION__)) || defined (S_SPLINT_S)
-# if (__STDC__ && __STDC_VERSION >= 199901L) || defined (S_SPLINT_S)
-#  define stdint_int64_defined
-   typedef long long int64_t;
-   typedef unsigned long long uint64_t;
-#  define UINT64_C(v) v ## ULL
-#  define  INT64_C(v) v ## LL
-#  ifndef PRINTF_INT64_MODIFIER
-#   define PRINTF_INT64_MODIFIER "ll"
-#  endif
-# endif
-#endif
-
-#if !defined (stdint_int64_defined)
-# if defined(__GNUC__)
-#  define stdint_int64_defined
-   __extension__ typedef long long int64_t;
-   __extension__ typedef unsigned long long uint64_t;
-#  define UINT64_C(v) v ## ULL
-#  define  INT64_C(v) v ## LL
-#  ifndef PRINTF_INT64_MODIFIER
-#   define PRINTF_INT64_MODIFIER "ll"
-#  endif
-# elif defined(__MWERKS__) || defined (__SUNPRO_C) || defined (__SUNPRO_CC) || defined (__APPLE_CC__) || defined (_LONG_LONG) || defined (_CRAYC) || defined (S_SPLINT_S)
-#  define stdint_int64_defined
-   typedef long long int64_t;
-   typedef unsigned long long uint64_t;
-#  define UINT64_C(v) v ## ULL
-#  define  INT64_C(v) v ## LL
-#  ifndef PRINTF_INT64_MODIFIER
-#   define PRINTF_INT64_MODIFIER "ll"
-#  endif
-# elif (defined(__WATCOMC__) && defined(__WATCOM_INT64__)) || (defined(_MSC_VER) && _INTEGRAL_MAX_BITS >= 64) || (defined (__BORLANDC__) && __BORLANDC__ > 0x460) || defined (__alpha) || defined (__DECC)
-#  define stdint_int64_defined
-   typedef __int64 int64_t;
-   typedef unsigned __int64 uint64_t;
-#  define UINT64_C(v) v ## UI64
-#  define  INT64_C(v) v ## I64
-#  ifndef PRINTF_INT64_MODIFIER
-#   define PRINTF_INT64_MODIFIER "I64"
-#  endif
-# endif
-#endif
-
-#if !defined (LONG_LONG_MAX) && defined (INT64_C)
-# define LONG_LONG_MAX INT64_C (9223372036854775807)
-#endif
-#ifndef ULONG_LONG_MAX
-# define ULONG_LONG_MAX UINT64_C (18446744073709551615)
-#endif
-
-#if !defined (INT64_MAX) && defined (INT64_C)
-# define INT64_MAX INT64_C (9223372036854775807)
-#endif
-#if !defined (INT64_MIN) && defined (INT64_C)
-# define INT64_MIN INT64_C (-9223372036854775808)
-#endif
-#if !defined (UINT64_MAX) && defined (INT64_C)
-# define UINT64_MAX UINT64_C (18446744073709551615)
-#endif
-
-/*
- *  Width of hexadecimal for number field.
- */
-
-#ifndef PRINTF_INT64_HEX_WIDTH
-# define PRINTF_INT64_HEX_WIDTH "16"
-#endif
-#ifndef PRINTF_INT32_HEX_WIDTH
-# define PRINTF_INT32_HEX_WIDTH "8"
-#endif
-#ifndef PRINTF_INT16_HEX_WIDTH
-# define PRINTF_INT16_HEX_WIDTH "4"
-#endif
-#ifndef PRINTF_INT8_HEX_WIDTH
-# define PRINTF_INT8_HEX_WIDTH "2"
-#endif
-
-#ifndef PRINTF_INT64_DEC_WIDTH
-# define PRINTF_INT64_DEC_WIDTH "20"
-#endif
-#ifndef PRINTF_INT32_DEC_WIDTH
-# define PRINTF_INT32_DEC_WIDTH "10"
-#endif
-#ifndef PRINTF_INT16_DEC_WIDTH
-# define PRINTF_INT16_DEC_WIDTH "5"
-#endif
-#ifndef PRINTF_INT8_DEC_WIDTH
-# define PRINTF_INT8_DEC_WIDTH "3"
-#endif
-
-/*
- *  Ok, lets not worry about 128 bit integers for now.  Moore's law says
- *  we don't need to worry about that until about 2040 at which point
- *  we'll have bigger things to worry about.
- */
-
-#ifdef stdint_int64_defined
-  typedef int64_t intmax_t;
-  typedef uint64_t uintmax_t;
-# define  INTMAX_MAX   INT64_MAX
-# define  INTMAX_MIN   INT64_MIN
-# define UINTMAX_MAX  UINT64_MAX
-# define UINTMAX_C(v) UINT64_C(v)
-# define  INTMAX_C(v)  INT64_C(v)
-# ifndef PRINTF_INTMAX_MODIFIER
-#   define PRINTF_INTMAX_MODIFIER PRINTF_INT64_MODIFIER
-# endif
-# ifndef PRINTF_INTMAX_HEX_WIDTH
-#  define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT64_HEX_WIDTH
-# endif
-# ifndef PRINTF_INTMAX_DEC_WIDTH
-#  define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT64_DEC_WIDTH
-# endif
-#else
-  typedef int32_t intmax_t;
-  typedef uint32_t uintmax_t;
-# define  INTMAX_MAX   INT32_MAX
-# define UINTMAX_MAX  UINT32_MAX
-# define UINTMAX_C(v) UINT32_C(v)
-# define  INTMAX_C(v)  INT32_C(v)
-# ifndef PRINTF_INTMAX_MODIFIER
-#   define PRINTF_INTMAX_MODIFIER PRINTF_INT32_MODIFIER
-# endif
-# ifndef PRINTF_INTMAX_HEX_WIDTH
-#  define PRINTF_INTMAX_HEX_WIDTH PRINTF_INT32_HEX_WIDTH
-# endif
-# ifndef PRINTF_INTMAX_DEC_WIDTH
-#  define PRINTF_INTMAX_DEC_WIDTH PRINTF_INT32_DEC_WIDTH
-# endif
-#endif
-
-/*
- *  Because this file currently only supports platforms which have
- *  precise powers of 2 as bit sizes for the default integers, the
- *  least definitions are all trivial.  Its possible that a future
- *  version of this file could have different definitions.
- */
-
-#ifndef stdint_least_defined
-  typedef   int8_t   int_least8_t;
-  typedef  uint8_t  uint_least8_t;
-  typedef  int16_t  int_least16_t;
-  typedef uint16_t uint_least16_t;
-  typedef  int32_t  int_least32_t;
-  typedef uint32_t uint_least32_t;
-# define PRINTF_LEAST32_MODIFIER PRINTF_INT32_MODIFIER
-# define PRINTF_LEAST16_MODIFIER PRINTF_INT16_MODIFIER
-# define  UINT_LEAST8_MAX  UINT8_MAX
-# define   INT_LEAST8_MAX   INT8_MAX
-# define UINT_LEAST16_MAX UINT16_MAX
-# define  INT_LEAST16_MAX  INT16_MAX
-# define UINT_LEAST32_MAX UINT32_MAX
-# define  INT_LEAST32_MAX  INT32_MAX
-# define   INT_LEAST8_MIN   INT8_MIN
-# define  INT_LEAST16_MIN  INT16_MIN
-# define  INT_LEAST32_MIN  INT32_MIN
-# ifdef stdint_int64_defined
-    typedef  int64_t  int_least64_t;
-    typedef uint64_t uint_least64_t;
-#   define PRINTF_LEAST64_MODIFIER PRINTF_INT64_MODIFIER
-#   define UINT_LEAST64_MAX UINT64_MAX
-#   define  INT_LEAST64_MAX  INT64_MAX
-#   define  INT_LEAST64_MIN  INT64_MIN
-# endif
-#endif
-#undef stdint_least_defined
-
-/*
- *  The ANSI C committee pretending to know or specify anything about
- *  performance is the epitome of misguided arrogance.  The mandate of
- *  this file is to *ONLY* ever support that absolute minimum
- *  definition of the fast integer types, for compatibility purposes.
- *  No extensions, and no attempt to suggest what may or may not be a
- *  faster integer type will ever be made in this file.  Developers are
- *  warned to stay away from these types when using this or any other
- *  stdint.h.
- */
-
-typedef   int_least8_t   int_fast8_t;
-typedef  uint_least8_t  uint_fast8_t;
-typedef  int_least16_t  int_fast16_t;
-typedef uint_least16_t uint_fast16_t;
-typedef  int_least32_t  int_fast32_t;
-typedef uint_least32_t uint_fast32_t;
-#define  UINT_FAST8_MAX  UINT_LEAST8_MAX
-#define   INT_FAST8_MAX   INT_LEAST8_MAX
-#define UINT_FAST16_MAX UINT_LEAST16_MAX
-#define  INT_FAST16_MAX  INT_LEAST16_MAX
-#define UINT_FAST32_MAX UINT_LEAST32_MAX
-#define  INT_FAST32_MAX  INT_LEAST32_MAX
-#define   INT_FAST8_MIN   INT_LEAST8_MIN
-#define  INT_FAST16_MIN  INT_LEAST16_MIN
-#define  INT_FAST32_MIN  INT_LEAST32_MIN
-#ifdef stdint_int64_defined
-  typedef  int_least64_t  int_fast64_t;
-  typedef uint_least64_t uint_fast64_t;
-# define UINT_FAST64_MAX UINT_LEAST64_MAX
-# define  INT_FAST64_MAX  INT_LEAST64_MAX
-# define  INT_FAST64_MIN  INT_LEAST64_MIN
-#endif
-
-#undef stdint_int64_defined
-
-/*
- *  Whatever piecemeal, per compiler thing we can do about the wchar_t
- *  type limits.
- */
-
-#if defined(__WATCOMC__) || defined(_MSC_VER) || defined (__GNUC__)
-# include <wchar.h>
-# ifndef WCHAR_MIN
-#  define WCHAR_MIN 0
-# endif
-# ifndef WCHAR_MAX
-#  define WCHAR_MAX ((wchar_t)-1)
-# endif
-#endif
-
-/*
- *  Whatever piecemeal, per compiler/platform thing we can do about the
- *  (u)intptr_t types and limits.
- */
-
-#if defined (_MSC_VER) && defined (_UINTPTR_T_DEFINED)
-# define STDINT_H_UINTPTR_T_DEFINED
-#endif
-
-#ifndef STDINT_H_UINTPTR_T_DEFINED
-# if defined (__alpha__) || defined (__ia64__) || defined (__x86_64__) || defined (_WIN64)
-#  define stdint_intptr_bits 64
-# elif defined (__WATCOMC__) || defined (__TURBOC__)
-#  if defined(__TINY__) || defined(__SMALL__) || defined(__MEDIUM__)
-#    define stdint_intptr_bits 16
-#  else
-#    define stdint_intptr_bits 32
-#  endif
-# elif defined (__i386__) || defined (_WIN32) || defined (WIN32)
-#  define stdint_intptr_bits 32
-# elif defined (__INTEL_COMPILER)
-/* TODO -- what will Intel do about x86-64? */
-# endif
-
-# ifdef stdint_intptr_bits
-#  define stdint_intptr_glue3_i(a,b,c)  a##b##c
-#  define stdint_intptr_glue3(a,b,c)    stdint_intptr_glue3_i(a,b,c)
-#  ifndef PRINTF_INTPTR_MODIFIER
-#    define PRINTF_INTPTR_MODIFIER      stdint_intptr_glue3(PRINTF_INT,stdint_intptr_bits,_MODIFIER)
-#  endif
-#  ifndef PTRDIFF_MAX
-#    define PTRDIFF_MAX                 stdint_intptr_glue3(INT,stdint_intptr_bits,_MAX)
-#  endif
-#  ifndef PTRDIFF_MIN
-#    define PTRDIFF_MIN                 stdint_intptr_glue3(INT,stdint_intptr_bits,_MIN)
-#  endif
-#  ifndef UINTPTR_MAX
-#    define UINTPTR_MAX                 stdint_intptr_glue3(UINT,stdint_intptr_bits,_MAX)
-#  endif
-#  ifndef INTPTR_MAX
-#    define INTPTR_MAX                  stdint_intptr_glue3(INT,stdint_intptr_bits,_MAX)
-#  endif
-#  ifndef INTPTR_MIN
-#    define INTPTR_MIN                  stdint_intptr_glue3(INT,stdint_intptr_bits,_MIN)
-#  endif
-#  ifndef INTPTR_C
-#    define INTPTR_C(x)                 stdint_intptr_glue3(INT,stdint_intptr_bits,_C)(x)
-#  endif
-#  ifndef UINTPTR_C
-#    define UINTPTR_C(x)                stdint_intptr_glue3(UINT,stdint_intptr_bits,_C)(x)
-#  endif
-  typedef stdint_intptr_glue3(uint,stdint_intptr_bits,_t) uintptr_t;
-  typedef stdint_intptr_glue3( int,stdint_intptr_bits,_t)  intptr_t;
-# else
-/* TODO -- This following is likely wrong for some platforms, and does
-   nothing for the definition of uintptr_t. */
-  typedef ptrdiff_t intptr_t;
-# endif
-# define STDINT_H_UINTPTR_T_DEFINED
-#endif
-
-/*
- *  Assumes sig_atomic_t is signed and we have a 2s complement machine.
- */
-
-#ifndef SIG_ATOMIC_MAX
-# define SIG_ATOMIC_MAX ((((sig_atomic_t) 1) << (sizeof (sig_atomic_t)*CHAR_BIT-1)) - 1)
-#endif
-
-#endif
-
-#if defined (__TEST_PSTDINT_FOR_CORRECTNESS)
-
-/* 
- *  Please compile with the maximum warning settings to make sure macros are not
- *  defined more than once.
- */
- 
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
- 
-#define glue3_aux(x,y,z) x ## y ## z
-#define glue3(x,y,z) glue3_aux(x,y,z)
-
-#define DECLU(bits) glue3(uint,bits,_t) glue3(u,bits,=) glue3(UINT,bits,_C) (0);
-#define DECLI(bits) glue3(int,bits,_t) glue3(i,bits,=) glue3(INT,bits,_C) (0);
-
-#define DECL(us,bits) glue3(DECL,us,) (bits)
-
-#define TESTUMAX(bits) glue3(u,bits,=) glue3(~,u,bits); if (glue3(UINT,bits,_MAX) glue3(!=,u,bits)) printf ("Something wrong with UINT%d_MAX\n", bits)
- 
-int main () {
-	DECL(I,8)
-	DECL(U,8)
-	DECL(I,16)
-	DECL(U,16)
-	DECL(I,32)
-	DECL(U,32)
-#ifdef INT64_MAX
-	DECL(I,64)
-	DECL(U,64)
-#endif
-	intmax_t imax = INTMAX_C(0);
-	uintmax_t umax = UINTMAX_C(0);
-	char str0[256], str1[256];
-
-	sprintf (str0, "%d %x\n", 0, ~0);
-	
-	sprintf (str1, "%d %x\n",  i8, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with i8 : %s\n", str1);
-	sprintf (str1, "%u %x\n",  u8, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with u8 : %s\n", str1);
-	sprintf (str1, "%d %x\n",  i16, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with i16 : %s\n", str1);
-	sprintf (str1, "%u %x\n",  u16, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with u16 : %s\n", str1);	
-	sprintf (str1, "%" PRINTF_INT32_MODIFIER "d %x\n",  i32, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with i32 : %s\n", str1);
-	sprintf (str1, "%" PRINTF_INT32_MODIFIER "u %x\n",  u32, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with u32 : %s\n", str1);
-#ifdef INT64_MAX	
-	sprintf (str1, "%" PRINTF_INT64_MODIFIER "d %x\n",  i64, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with i64 : %s\n", str1);
-#endif
-	sprintf (str1, "%" PRINTF_INTMAX_MODIFIER "d %x\n",  imax, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with imax : %s\n", str1);
-	sprintf (str1, "%" PRINTF_INTMAX_MODIFIER "u %x\n",  umax, ~0);
-	if (0 != strcmp (str0, str1)) printf ("Something wrong with umax : %s\n", str1);	
-	
-	TESTUMAX(8);
-	TESTUMAX(16);
-	TESTUMAX(32);
-#ifdef INT64_MAX
-	TESTUMAX(64);
-#endif
-
-	return EXIT_SUCCESS;
-}
-
-#endif
diff -Nru igraph-0.6.5~quantal1/tests/Makefile.in igraph-0.6.5/tests/Makefile.in
--- igraph-0.6.5~quantal1/tests/Makefile.in	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/tests/Makefile.in	2013-03-03 01:30:06.000000000 +0000
@@ -0,0 +1,419 @@
+# Makefile.in generated by automake 1.11.3 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 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@
+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 = :
+build_triplet = @build@
+host_triplet = @host@
+subdir = tests
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+	$(srcdir)/atlocal.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/tools/autoconf/ax_tls.m4 \
+	$(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES = atlocal
+CONFIG_CLEAN_VPATH_FILES =
+SOURCES =
+DIST_SOURCES =
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AR = @AR@
+AS = @AS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOM4TE = @AUTOM4TE@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXCPP = @CXXCPP@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DLLTOOL = @DLLTOOL@
+DSYMUTIL = @DSYMUTIL@
+DUMPBIN = @DUMPBIN@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+FGREP = @FGREP@
+FLOATSTORE = @FLOATSTORE@
+GREP = @GREP@
+HAVE_TLS = @HAVE_TLS@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LD = @LD@
+LDFLAGS = @LDFLAGS@
+LEX = @LEX@
+LEXLIB = @LEXLIB@
+LEX_OUTPUT_ROOT = @LEX_OUTPUT_ROOT@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LIBTOOL = @LIBTOOL@
+LIPO = @LIPO@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MANIFEST_TOOL = @MANIFEST_TOOL@
+MKDIR_P = @MKDIR_P@
+NM = @NM@
+NMEDIT = @NMEDIT@
+OBJDUMP = @OBJDUMP@
+OBJEXT = @OBJEXT@
+OTOOL = @OTOOL@
+OTOOL64 = @OTOOL64@
+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@
+RANLIB = @RANLIB@
+SED = @SED@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+WARNING_CFLAGS = @WARNING_CFLAGS@
+WERROR_CFLAGS = @WERROR_CFLAGS@
+XML2CONFIG = @XML2CONFIG@
+XML2_CFLAGS = @XML2_CFLAGS@
+XML2_LIBS = @XML2_LIBS@
+YACC = @YACC@
+YFLAGS = @YFLAGS@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_AR = @ac_ct_AR@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_DUMPBIN = @ac_ct_DUMPBIN@
+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 = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+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@
+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@
+EXTRA_DIST = $(TESTSUITE_AT) $(top_builddir)/tests/testsuite \
+	package.m4
+MAINTAINERCLEANFILES = Makefile.in $(TESTSUITE) package.m4 atconfig
+TESTSUITE_AT = \
+	testsuite.at \
+	types.at basic.at structure_generators.at \
+	structural_properties.at iterators.at components.at \
+	visitors.at layout.at motifs.at topology.at foreign.at operators.at \
+	other.at foreign.at conversion.at flow.at community.at eigen.at \
+	cliques.at attributes.at arpack.at bipartite.at centralization.at \
+	version.at separators.at hrg.at microscopic.at mt.at random.at scg.at \
+	matching.at qsort.at
+
+TESTSUITE = testsuite
+AUTOTEST = $(AUTOM4TE) --language=autotest
+all: all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(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) --gnu tests/Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu tests/Makefile
+.PRECIOUS: 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;
+
+$(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):
+atlocal: $(top_builddir)/config.status $(srcdir)/atlocal.in
+	cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+tags: TAGS
+TAGS:
+
+ctags: CTAGS
+CTAGS:
+
+
+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
+	$(MAKE) $(AM_MAKEFLAGS) check-local
+check: check-am
+all-am: Makefile
+installdirs:
+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)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+	-test -z "$(MAINTAINERCLEANFILES)" || rm -f $(MAINTAINERCLEANFILES)
+clean: clean-am
+
+clean-am: clean-generic clean-libtool clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+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-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: installcheck-local
+
+maintainer-clean: maintainer-clean-am
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic mostlyclean-libtool
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am:
+
+.MAKE: check-am install-am install-strip
+
+.PHONY: all all-am check check-am check-local clean clean-generic \
+	clean-libtool clean-local distclean distclean-generic \
+	distclean-libtool distdir dvi dvi-am html html-am info info-am \
+	install install-am 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 installcheck-local \
+	installdirs maintainer-clean maintainer-clean-generic \
+	mostlyclean mostlyclean-generic mostlyclean-libtool pdf pdf-am \
+	ps ps-am uninstall uninstall-am
+
+
+$(srcdir)/package.m4: $(top_srcdir)/configure.ac
+	{					\
+	  echo '# Signature of the current package.'; \
+	  echo 'm4_define([AT_PACKAGE_NAME],      [@PACKAGE_NAME@])'; \
+	  echo 'm4_define([AT_PACKAGE_TARNAME],   [@PACKAGE_TARNAME@])'; \
+	  echo 'm4_define([AT_PACKAGE_VERSION],   [@PACKAGE_VERSION@])'; \
+	  echo 'm4_define([AT_PACKAGE_STRING],    [@PACKAGE_STRING@])'; \
+	  echo 'm4_define([AT_PACKAGE_BUGREPORT], [@PACKAGE_BUGREPORT@])'; \
+	} >$(srcdir)/package.m4
+$(TESTSUITE): $(srcdir)/package.m4 $(TESTSUITE_AT)
+	$(AUTOTEST) -I $(top_srcdir)/tests $(top_srcdir)/tests/testsuite.at -o $@.tmp
+	mv $@.tmp $@
+
+clean-local: $(TESTSUITE)
+	$(SHELL) $(TESTSUITE) --clean
+
+check-local: atconfig atlocal $(TESTSUITE)
+	if [ ! -f $(TESTSUITE) ]; then cp $(top_srcdir)/tests/testsuite .; fi
+	$(SHELL) $(TESTSUITE)
+
+# Run the test suite on the *installed* tree.
+installcheck-local:
+	$(SHELL) $(TESTSUITE) AUTOTEST_PATH=$(exec_prefix)/bin
+
+# 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 -Nru igraph-0.6.5~quantal1/tests/package.m4 igraph-0.6.5/tests/package.m4
--- igraph-0.6.5~quantal1/tests/package.m4	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/tests/package.m4	2013-03-03 03:18:41.000000000 +0000
@@ -0,0 +1,6 @@
+# Signature of the current package.
+m4_define([AT_PACKAGE_NAME],      [igraph])
+m4_define([AT_PACKAGE_TARNAME],   [igraph])
+m4_define([AT_PACKAGE_VERSION],   [0.6.5])
+m4_define([AT_PACKAGE_STRING],    [igraph 0.6.5])
+m4_define([AT_PACKAGE_BUGREPORT], [csardi.gabor@gmail.com])
diff -Nru igraph-0.6.5~quantal1/tests/testsuite igraph-0.6.5/tests/testsuite
--- igraph-0.6.5~quantal1/tests/testsuite	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/tests/testsuite	2013-03-03 03:18:43.000000000 +0000
@@ -0,0 +1,17107 @@
+#! /bin/sh
+# Generated from ../tests/testsuite.at by GNU Autoconf 2.68.
+#
+# Copyright (C) 2009, 2010 Free Software Foundation, Inc.
+#
+# This test suite is free software; the Free Software Foundation gives
+# unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1
+test \$(( 1 + 1 )) = 2 || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in #(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  # We cannot yet assume a decent shell, so we have to provide a
+	# neutralization value for shells without unset; and this also
+	# works around shells that cannot unset nonexistent variables.
+	# Preserve -v and -x to the replacement shell.
+	BASH_ENV=/dev/null
+	ENV=/dev/null
+	(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+	export CONFIG_SHELL
+	case $- in # ((((
+	  *v*x* | *x*v* ) as_opts=-vx ;;
+	  *v* ) as_opts=-v ;;
+	  *x* ) as_opts=-x ;;
+	  * ) as_opts= ;;
+	esac
+	exec "$CONFIG_SHELL" $as_opts "$as_myself" ${1+"$@"}
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org about your system,
+$0: including any error possibly output before this
+$0: message. Then install a modern shell, or manually run
+$0: the script under such a shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -p'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -p'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -p'
+  fi
+else
+  as_ln_s='cp -p'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+if test -x / >/dev/null 2>&1; then
+  as_test_x='test -x'
+else
+  if ls -dL / >/dev/null 2>&1; then
+    as_ls_L_option=L
+  else
+    as_ls_L_option=
+  fi
+  as_test_x='
+    eval sh -c '\''
+      if test -d "$1"; then
+	test -d "$1/.";
+      else
+	case $1 in #(
+	-*)set "./$1";;
+	esac;
+	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
+	???[sx]*):;;*)false;;esac;fi
+    '\'' sh
+  '
+fi
+as_executable_p=$as_test_x
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+
+
+
+SHELL=${CONFIG_SHELL-/bin/sh}
+
+# How were we run?
+at_cli_args="$@"
+
+
+# Not all shells have the 'times' builtin; the subshell is needed to make
+# sure we discard the 'times: not found' message from the shell.
+at_times_p=false
+(times) >/dev/null 2>&1 && at_times_p=:
+
+# CLI Arguments to pass to the debugging scripts.
+at_debug_args=
+# -e sets to true
+at_errexit_p=false
+# Shall we be verbose?  ':' means no, empty means yes.
+at_verbose=:
+at_quiet=
+# Running several jobs in parallel, 0 means as many as test groups.
+at_jobs=1
+at_traceon=:
+at_trace_echo=:
+at_check_filter_trace=:
+
+# Shall we keep the debug scripts?  Must be `:' when the suite is
+# run by a debug script, so that the script doesn't remove itself.
+at_debug_p=false
+# Display help message?
+at_help_p=false
+# Display the version message?
+at_version_p=false
+# List test groups?
+at_list_p=false
+# --clean
+at_clean=false
+# Test groups to run
+at_groups=
+# Whether to rerun failed tests.
+at_recheck=
+# Whether a write failure occurred
+at_write_fail=0
+
+# The directory we run the suite in.  Default to . if no -C option.
+at_dir=`pwd`
+# An absolute reference to this testsuite script.
+case $as_myself in
+  [\\/]* | ?:[\\/]* ) at_myself=$as_myself ;;
+  * ) at_myself=$at_dir/$as_myself ;;
+esac
+# Whether -C is in effect.
+at_change_dir=false
+
+# Whether to enable colored test results.
+at_color=no
+# List of the tested programs.
+at_tested=''
+# As many question marks as there are digits in the last test group number.
+# Used to normalize the test group numbers so that `ls' lists them in
+# numerical order.
+at_format='???'
+# Description of all the test groups.
+at_help_all="1;version.at:26;Simple version query (igraph_version): ;version igraph_version;
+2;types.at:24;Vector (vector_t): ;vector vector_t;
+3;types.at:29;Vector (more) (vector_t): ;vector vector_t;
+4;types.at:34;Vector (even more) (vector_t): ;vector vector_t;
+5;types.at:39;Matrix (matrix_t): ;matrix matrix_t;
+6;types.at:44;Matrix (more) (matrix_t): ;matrix matrix_t;
+7;types.at:49;Matrix (even more) (matrix_t): ;matrix matrix_t;
+8;types.at:54;Double ended queue (dqueue_t): ;dqueue double queue dqueue_t;
+9;types.at:59;Vector of pointers (vector_ptr_t): ;vector pointers vector_ptr_t;
+10;types.at:64;Stack (stack_t): ;stack stack_t;
+11;types.at:69;Heap (heap_t): ;heap heap_t;
+12;types.at:74;Indexed heap (indheap_t): ;indexed heap indheap_t;
+13;types.at:79;Doubly indexed heap (d_indheap_t): ;doubly indexed heap d_indheap_t;
+14;types.at:84;String vector (igraph_strvector_t): ;string vector igraph_strvector_t;
+15;types.at:89;Trie (igraph_trie_t): ;trie igraph_trie_t;
+16;types.at:95;Partial Sum-Tree (igraph_psumtree_t): ;partial sumtree igraph_psumtree_t;
+17;types.at:100;Three dimensional array (igraph_array3_t): ;array array3 three dimensional;
+18;types.at:105;Hash table (string->string) (igraph_hashtable_t): ;igraph_hashtable_t hash table;
+19;types.at:111;Special heap for minimum cuts (igraph_i_cutheap_t): ;heap minimum cut;
+20;types.at:117;Set (igraph_set_t): ;set igraph_set_t;
+21;types.at:123;2-way heap (igraph_2wheap_t): ;heap two-way 2-way igraph_2wheap_t;
+22;types.at:128;Sparse matrix (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+23;types.at:133;Sparse matrix, multiplications (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+24;types.at:139;Sparse matrix, indexing (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+25;types.at:145;Sparse matrix, solvers (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+26;types.at:151;Sparse matrix, ARPACK eigensolver (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t arpack;
+27;types.at:156;Sparse matrix, conversion to dense (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+28;types.at:161;Sparse matrix, min & max (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+29;types.at:166;Sparse matrix, other operations (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t;
+30;types.at:171;Sparse matrix, multiplications with dense (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t sparse-dense dense-sparse;
+31;types.at:176;Sparse matrix, is symmetric? (igraph_sparsemat_t): ;sparse matrix igraph_sparsemat_t symmetric is_symmetric;
+32;types.at:181;Another sparse matrix (igraph_spmatrix_t): ;sparse matrix igraph_spmatrix_t;
+33;types.at:186;Arbitrarily big integers (igraph_biguint_t): ;bignum bigint big integer arbitrarily;
+34;types.at:191;Marked double ended queue (igraph_marked_queue_t): ;dqueue queue igraph_marked_queue_t;
+35;types.at:196;Complex numbers (igraph_complex_t): ;complex;
+36;basic.at:26;Creating an empty graph (igraph_empty): ;igraph_empty;
+37;basic.at:31;Copying a graph (igraph_copy): ;igraph_copy igraph_create;
+38;basic.at:36;Adding edges to a graph (igraph_add_edges): ;igraph_add_edges;
+39;basic.at:42;Adding vertices (igraph_add_vertices): ;igraph_add_vertices;
+40;basic.at:47;Deleting edges (igraph_delete_edges): ;igraph_delete_vertices;
+41;basic.at:52;Deleting vertices (igraph_delete_vertices): ;igraph_delete_vertices;
+42;basic.at:57;Neighbors (igraph_neighbors): ;igraph_neighbors;
+43;basic.at:62;Is the graph directed? (igraph_is_directed): ;igraph_is_directed;
+44;basic.at:67;Degree of the vertices (igraph_degree): ;igraph_degree;
+45;basic.at:72;Query edge ids (igraph_get_eid): ;igraph_get_eid edge id;
+46;basic.at:77;Query many edge ids (igraph_get_eids): ;igraph_get_eids edge id;
+47;iterators.at:24;Vertices in a vector (igraph_vs_vector): ;iterator vector igraph_vs_vector igraph_vs_vectorview;
+48;iterators.at:29;Non-adjacent vertices (igraph_vs_nonadj): ;iterator igraph_vs_nonadj;
+49;iterators.at:34;Sequence (igraph_vs_seq): ;iterator igraph_vs_seq seq sequence;
+50;iterators.at:49;Edges given by end points (igraph_es_pairs): ;iterator igraph_es_pairs;
+51;iterators.at:54;Edges in a path (igraph_es_path): ;iterator, igraph_es_path;
+52;structure_generators.at:24;Simple graph creation (igraph_create): ;igraph_create;
+53;structure_generators.at:29;Barabasi-Albert model (igraph_barabasi_game):;barabasi barabasi-albert igraph_barabasi_game;
+54;structure_generators.at:34;More Barabasi-Albert model (igraph_barabasi_game):;barabasi barabasi-albert igraph_barabasi_game;
+55;structure_generators.at:39;Erdos-Renyi model (igraph_erdos_renyi_game):;erdos renyi erdos-renyi igraph_erdos_renyi_game;
+56;structure_generators.at:44;Degree sequence (igraph_degree_sequence_game):;degree sequence igraph_degree_sequence_game;
+57;structure_generators.at:49;k-regular graphs (igraph_k_regular_game):;regular k-regular igraph_k_regular_game;
+58;structure_generators.at:54;Growing random (igraph_growing_random_game):;growing random game igraph_growing_random_game;
+59;structure_generators.at:59;Preference model (igraph_preference_game):;preference game igraph_preference_game igraph_asymmetric_preference_game;
+60;structure_generators.at:64;From adjacency matrix (igraph_adjacency):;adjacency matrix igraph_adjacency;
+61;structure_generators.at:69;From weighted adjacency matrix (igraph_weighted_adjacency):;weighted adjacency matrix igraph_weighted_adjacency;
+62;structure_generators.at:74;Star graph (igraph_star):;star igraph_star;
+63;structure_generators.at:79;Lattice graph (igraph_lattice):;lattice igraph_lattice;
+64;structure_generators.at:84;Ring graph (igraph_ring):;ring igraph_ring;
+65;structure_generators.at:89;Tree graph (igraph_tree):;tree igraph_tree;
+66;structure_generators.at:94;Full graph (igraph_full):;full igraph_full;
+67;structure_generators.at:99;Graph atlas (igraph_atlas):;atlas igraph_atlas;
+68;structure_generators.at:104;Small graph (igraph_small):;graph constructor small igraph_small;
+69;structure_generators.at:109;Geomeric random graphs (igraph_grg_game):;graph grg geometric random igraph_grg_game;
+70;structure_generators.at:114;Graphs in LCF notation (igraph_lcf{,_vector}):;lcf graph constructor;
+71;structure_generators.at:119;Watts-Strogatz graphs (igraph_watts_strogatz_game):;small world small-world watts strogratz;
+72;structural_properties.at:24;Two vertices connected by an edge:;igraph_are_connected;
+73;structural_properties.at:29;Diameter of a graph (igraph_diameter):;igraph_diameter;
+74;structural_properties.at:34;Average geodesic length (igraph_average_path_length): ;igraph_average_path_length;
+75;structural_properties.at:39;Google PageRank (igraph_pagerank): ;igraph_pagerank;
+76;structural_properties.at:44;Random rewiring (igraph_rewire): ;igraph_rewire;
+77;structural_properties.at:49;Get the shortest paths (igraph_get_shortest_paths): ;igraph_get_shortest_paths shortest paths geodesic;
+78;structural_properties.at:55;Weighted shortest paths (Dijkstra): ;igraph_shortest_paths_dijkstra dijkstra shortest paths geodesic;
+79;structural_properties.at:60;Weighted shortest paths (Bellman-Ford): ;igraph_shortest_paths_bellman_ford bellman-ford shortest paths geodesic;
+80;structural_properties.at:65;Get the weighted shortest paths (Dijkstra): ;igraph_get_shortest_paths_dijkstra dijkstra shortest paths geodesic;
+81;structural_properties.at:71;Get all weighted shortest paths (Dijkstra): ;igraph_get_all_shortest_paths_dijkstra dijkstra shortest paths geodesic;
+82;structural_properties.at:77;Shortest path wrappers for single target node: ;igraph_get_shortest_path igraph_get_shortest_path_dijkstra;
+83;structural_properties.at:83;Betweenness (igraph_betweenness): ;igraph_betweenness betweenness;
+84;structural_properties.at:88;Betweenness, big integers (igraph_betweenness): ;igraph_betweenness betweenness arbitrarily large integers biguint bigint;
+85;structural_properties.at:93;Edge betweenness (igraph_edge_betweenness): ;igraph_edge_betweenness betwenness;
+86;structural_properties.at:99;Transitivity (igraph_transitivity): ;igraph_transitivity transitivity igraph_transitivity_undirected;
+87;structural_properties.at:104;Local transitivity (igraph_local_transitivity): ;transitivity igraph_transitivity_local_undirected;
+88;structural_properties.at:109;Reciprocity (igraph_reciprocity): ;igraph_reciprocity reciprocity;
+89;structural_properties.at:114;Minimum spanning tree (igraph_minimum_spanning_tree_*): ;igraph_minimum_spanning_tree_prim prim minimum spanning tree;
+90;structural_properties.at:120;Cocitation and bibcoupling (igraph_cocitation,igraph_bibcoupling):;cocitation bibliographic coupling;
+91;structural_properties.at:125;Similarity coefficients (igraph_similarity_*):;similarity jaccard dice;
+92;structural_properties.at:130;Simplification of non-simple graphs (igraph_simplify): ;simplify multiple edge loop edges non-simple graphs simple;
+93;structural_properties.at:135;Topological sorting (igraph_topological_sorting, igraph_is_dag): ;topological sorting directed acyclic graphs;
+94;structural_properties.at:140;Feedback arc sets, Eades heuristics (igraph_feedback_arc_set): ;feedback arc set directed graphs;
+95;structural_properties.at:145;Feedback arc sets, integer programming (igraph_feedback_arc_set): ;feedback arc set directed graphs;
+96;structural_properties.at:150;Loop edges test (igraph_is_loop): ;loop edge igraph_is_loop;
+97;structural_properties.at:155;Multiple edges test (igraph_is_multiple): ;multiple edge parallel igraph_is_multiple;
+98;structural_properties.at:160;Multiple edges test (igraph_has_multiple): ;multiple edge parallel igraph_has_multiple;
+99;structural_properties.at:165;Girth (igraph_girth): ;girth igraph_girth;
+100;structural_properties.at:170;Convergence degree (igraph_convergence_degree): ;edge convergence degree igraph_convergence_degree;
+101;structural_properties.at:175;Assortativity coefficient (igraph_assortativity): ;assortativity mixing igraph_assortativity;
+102;structural_properties.at:181;Average nearest neighbor degree (igraph_avg_nearest_neighbor_degree): ;nearest neighbor degree correlations;
+103;structural_properties.at:186;Transitive closure of a DAG (igraph_transitive_closure_dag): ;transitive closure dag;
+104;structural_properties.at:192;Eccentricity (igraph_eccentricity): ;eccentricity;
+105;structural_properties.at:198;Radius (igraph_radius): ;radius eccentricity;
+106;components.at:24;Decompose a graph (igraph_decompose):;igraph_decompose decompose component;
+107;components.at:29;Biconnected components (igraph_biconnected_components):;igraph_biconnected_components biconnected component;
+108;layout.at:24;Grid layout (igraph_layout_grid, igraph_layout_grid_3d):;igraph_layout_grid igraph_layout_grid_3d grid layout;
+109;layout.at:29;Large Graph Layout (igraph_layout_lgl):;igraph_layout_lgl lgl;
+110;layout.at:34;Reingold-Tilford tree layout (igraph_layout_reingold_tilford):;reingold tilford tree layout igraph_layout_reingold_tilford;
+111;layout.at:40;Sugiyama layout (igraph_layout_sugiyama):;sugiyama layout igraph_layout_sugiyama;
+112;layout.at:45;Multidimensional scaling (igraph_layout_mds):;multidimensional scaling layout igraph_layout_mds;
+113;layout.at:50;Covering circle and sphere (igraph_i_layout_sphere_{2,3}d):;covering circle sphere layout;
+114;layout.at:55;Merging layouts (igraph_i_layout_merge):;layout merge dla;
+115;layout.at:60;Merging layouts 2 (igraph_i_layout_merge):;layout merge dla;
+116;layout.at:66;Merging layouts 3 (igraph_i_layout_merge):;layout merge dla;
+117;visitors.at:24;Internal breadth-first search (igraph_i_bfs):;igraph_i_bfs bfs breadth-first visitor;
+118;visitors.at:29;Breadth-first search (igraph_bfs):;igraph_bfs bfs breadth-first visitor;
+119;topology.at:24;The isomorphism class of a subgraph (igraph_isolass_subgraph);isomorph isomorphism class motif;
+120;topology.at:29;The VF2 isomorphism algorithm;isomorph isomorphic vf2;
+121;topology.at:34;VF algorithm with compatibility functions;isomorph isomorphic vf2 compatibility;
+122;topology.at:39;Graphical degree sequences;degree sequence graphical;
+123;motifs.at:24;RAND-ESU algorithm (igraph_motifs_randesu);motif rand-esu;
+124;foreign.at:24;Reading Pajek (igraph_read_graph_pajek):;igraph_read_graph_pajek foreign pajek;
+125;foreign.at:29;GraphML (igraph_{read,write}_graph_graphml):;igraph_read_graph_graphml igraph_write_graph_graphml foreign graphml;
+126;foreign.at:35;Writing Pajek (igraph_write_graph_pajek):;igraph_write_graph_pajek foreign pajek;
+127;foreign.at:41;Pajek with number of edges present (igraph_read_graph_pajek):;igraph_read_graph_pajek pajek foreign;
+128;foreign.at:46;Pajek, bipartite (igraph_read_graph_pajek):;igraph_read_graph_pajek pajek foreign bipartite;
+129;foreign.at:52;Reading an LGL file (igraph_read_graph_lgl):;igraph_read_graph_lgl lgl foreign;
+130;foreign.at:59;Writing LGL (igraph_write_graph_lgl):;igraph_write_graph_lgl foreign lgl;
+131;foreign.at:64;Reading a graph from the graph database (igraph_read_graph_graphdb):;igraph_read_graph_graphdb foreign graphdb database isomorphism;
+132;foreign.at:71;Reading a GML file (igraph_read_graph_gml):;igraph_read_graph_gml foreign gml;
+133;foreign.at:76;Writing a DOT file (igraph_write_graph_dot):;igraph_write_graph_dot foreign dot graphviz;
+134;foreign.at:81;Different line endings:;igraph_read_graph_pajek igraph_write_graph_pajek foreign line ending lineending;
+135;foreign.at:88;UNICET DL format:;igraph_read_graph_dl dl ucinet;
+136;foreign.at:94;LEDA format:;igraph_write_graph_leda leda;
+137;other.at:24;Convex hull calculation (igraph_convex_hull):;igraph_convex_hull other;
+138;other.at:29;Fitting power-law distributions (igraph_power_law_fit):;igraph_power_law_fit other power law fitting;
+139;operators.at:24;Disjoint union (igraph_disjoint_union, igraph_dosjoint_union_many):;igraph_disjoint_union, igraph_disjoint_union_many, disjoint_union, union;
+140;operators.at:31;Union (igraph_union, igraph_union_many):;igraph_union, igraph_union_many, union;
+141;operators.at:37;Intersection (igraph_intersection, igraph_intersection_many):;igraph_intersection, igraph_intersection_many, intersection;
+142;operators.at:43;Difference (igraph_difference):;igraph_difference, difference;
+143;operators.at:49;Complementer (igraph_complementer):;igraph_complementer, complementer;
+144;operators.at:55;Composition (igraph_compose):;igraph_composition, composition, compose;
+145;conversion.at:24;Directed to undirected (igraph_to_undirected):;igraph_to_undirected directedness undirected directed;
+146;conversion.at:30;Graphs from adjacency list (igraph_adjlist):;igraph_adjlist adjacency list adjlist;
+147;conversion.at:35;Graph to Laplacian matrix (igraph_laplacian):;igraph_laplacian laplacian matrix;
+148;flow.at:24;Maximum flow value (igraph_maxflow_value): ;maximum flow maxflow minimum cut;
+149;flow.at:29;Maximum flow (igraph_maxflow): ;maximum flow maxflow minimum cut;
+150;flow.at:34;Minimum cut (igraph_mincut): ;minimum cut stoer-wagner;
+151;flow.at:39;Even-Tarjan reduction (igraph_even_tarjan_reduction): ;even tarjan reduction vertex cut separator;
+152;flow.at:44;Dominator tree of a flow graph (igraph_dominator_tree): ;dominator tree;
+153;flow.at:50;All s-t cuts of a graph (igraph_all_st_cuts): ;s-t cut;
+154;flow.at:56;All minimal s-t cuts of a graph (igraph_all_st_mincuts): ;minimal s-t cut;
+155;community.at:24;Spinglass clustering (igraph_spinglass_community): ;spin glass spinglass community clustering;
+156;community.at:29;Walktrap community structure (igraph_walktrap_community): ;random walk community structure clustering walktrap;
+157;community.at:34;Edge betweenness community structure (igraph_community_edge_betweenness): ;community structure edge betweenness newman girvan;
+158;community.at:40;Modularity optimization (igraph_community_fastgreedy): ;community structure clauset newman moore modularity greedy;
+159;community.at:46;Leading eigenvector community structure (igraph_community_leading_eigenvector) :;community structure leading eigenvector newman;
+160;community.at:52;Leading eigenvector bug #1002140 test (igraph_community_leading_eigenvector) :;community structure leading eigenvector newman;
+161;community.at:58;Label propagation algorithm (igraph_community_label_propagation) :;community structure label propagation raghavan albert kumara;
+162;community.at:64;Multilevel community detection (igraph_community_multilevel) :;community structure multilevel blondel guillaume lambiotte lefebvre;
+163;community.at:70;Modularity optimization, integer programming (igraph_community_optimal_modularity) :;community structure optimal modularity integer programming;
+164;community.at:75;Infomap community structure (igraph_community_infomap) :;community structure infomap rosvall bergstrom;
+165;cliques.at:26;Calculating cliques (igraph_cliques): ;igraph_cliques, igraph_maximal_cliques, igraph_clique_number;
+166;cliques.at:31;Additional test for maximal cliques (igraph_maximal_cliques):;igraph_maximal_cliques cliques maximal;
+167;cliques.at:37;Calculating independent vertex sets (igraph_independent_vertex_sets): ;igraph_independent_vertex_sets, igraph_maximal_independent_vertex_sets, igraph_independence_number;
+168;eigen.at:24;Symmetric matrix, LAPACK (igraph_eigen_matrix_symmetric):;eigenvalue lapack;
+169;eigen.at:30;Symmetric matrix, ARPACK (igraph_eigen_matrix_symmetric):;eigenvalue lapack;
+170;eigen.at:36;General matrix, LAPACK, LM, SM (igraph_eigen_matrix):;eigenvalue lapack;
+171;eigen.at:42;General matrix, LAPACK, LR, SR (igraph_eigen_matrix):;eigenvalue lapack;
+172;eigen.at:48;General matrix, LAPACK, LI, SI (igraph_eigen_matrix):;eigenvalue lapack;
+173;eigen.at:54;General matrix, LAPACK, SELECT (igraph_eigen_matrix):;eigenvalue lapack;
+174;attributes.at:24;Reading a Pajek file with attributes:;pajek attributes;
+175;attributes.at:30;Writing an attributed graph in GML and GraphML:;gml graphml attributes;
+176;attributes.at:35;Combining numeric attributes:;attributes combination combining;
+177;attributes.at:40;Combining string attributes:;attributes combination combining;
+178;arpack.at:24;Basic BLAS functions (igraph_blas_*):;blas matrix vector dgemv igraph_blas_dgemv;
+179;arpack.at:30;Dense symmetric eigenvalues and eigenvectors (igraph_lapack_dsyevr):;lapack dsyevr eigenvalue eigenvector dense;
+180;arpack.at:35;Dense non-symmetric eigenvalues and eigenvectors (igraph_lapack_dgeev):;lapack dgeev eigenvalue eigenvector dense;
+181;arpack.at:40;Dense non-symmetric eigenvalues and eigenvectors (igraph_lapack_dgeevx):;lapack dgeevx eigenvalue eigenvector dense;
+182;arpack.at:45;Solving linear systems with LU factorization (igraph_lapack_dgesv):;lapack dgesv solve lu factorization;
+183;arpack.at:51;Upper Hessenberg transformation (igraph_lapack_dgehrd):;lapack dgehrd hessenberg;
+184;arpack.at:57;Eigenvector centrality (igraph_eigenvector_centrality):;eigenvector centrality arpack;
+185;arpack.at:63;Non-symmetric ARPACK solver (igraph_arpack_rnsolve):;arpack eigenvalue eigenvector eigen eigenproblem non-symmetric;
+186;bipartite.at:24;Create bipartite graphs (igraph_create_bipartite):;bipartite two mode igraph_create_bipartite;
+187;bipartite.at:30;Projection of bipartite graphs (igraph_bipartite_projection):;bipartite two mode projection igraph_bipartite_projection;
+188;centralization.at:24;Centralization (igraph_centralization_*):;centralization;
+189;separators.at:24;Decision problem (igraph_is_separator): ;vertex separator;
+190;separators.at:29;Decision problem, minimal separator (igraph_is_minimal separator): ;minimal vertex separator;
+191;separators.at:34;Minimal separators (igraph_all_minimal_ab_separators): ;minimal separator;
+192;separators.at:39;Minimal separators, bug 1033045 (igraph_all_minimal_st_separators): ;minimal separator;
+193;separators.at:44;Minimum size separators (igraph_minimum_size_separators): ;minimum size separators;
+194;separators.at:50;Cohesive blocking (igraph_cohesive_blocks): ;structurally cohesive blocks;
+195;hrg.at:24;Fitting a hierarchical model (igraph_hrg_fit) :;hierarchical random graph;
+196;hrg.at:29;Consensus tree (igraph_hrg_consensus) :;hierarchical random graph consensus tree;
+197;hrg.at:34;Missing edge prediction (igraph_hrg_predict) :;hierarchical random graph missing edge prediction;
+198;microscopic.at:23;Deterministic optimal imitation:;deterministic imitation strategy;
+199;microscopic.at:28;Stochastic imitation via uniform selection:;stochastic imitation strategy uniform selection;
+200;microscopic.at:33;Stochastic imitation via roulette selection:;stochastic imitation strategy roulette wheel;
+201;microscopic.at:38;Moran process:;moran process haploid reproduction;
+202;mt.at:24;Simple error handling test :;thread-safe;
+203;mt.at:29;Thread-safe ARPACK:;thread-safe arpack;
+204;scg.at:24;Solving the SCG problem (igraph_scg_grouping) :;scg spectral coarse graining grouping;
+205;scg.at:30;Solving the SCG problem, adjacency matrix (igraph_scg_grouping) :;scg spectral coarse graining grouping adjacency;
+206;scg.at:36;Solving the SCG problem, stochastic matrix (igraph_scg_grouping) :;scg spectral coarse graining grouping stochastic;
+207;scg.at:42;Solving the SCG problem, laplacian matrix (igraph_scg_grouping) :;scg spectral coarse graining grouping laplacian;
+208;scg.at:48;SCG semi-projectors, symmetric (igraph_scg_semiprojectors) :;scg spectral coarse graining semi-projectors adjancency;
+209;scg.at:54;SCG semi-projectors, stochastic (igraph_scg_semiprojectors) :;scg spectral coarse graining semi-projectors stochastic;
+210;scg.at:60;SCG semi-projectors, laplacian (igraph_scg_semiprojectors) :;scg spectral coarse graining semi-projectors laplacian;
+211;scg.at:66;SCG of a graph, adjacency matrix (igraph_scg) :;scg spectral coarse graining;
+212;scg.at:71;SCG of a graph, stochastic matrix (igraph_scg) :;scg spectral coarse graining;
+213;scg.at:76;SCG of a graph, laplacian matrix (igraph_scg) :;scg spectral coarse graining;
+214;random.at:24;Random seed:;rng seed random;
+215;random.at:29;MT19937 RNG on 64 bit machines:;rng mt19937;
+216;random.at:34;Exponentially distributed random numbers:;exponential random numbers;
+217;random.at:40;Random sampling from consecutive sequence:;random sampling;
+218;random.at:45;Fisher-Yates shuffle:;fisher-yates shuffle random permutation;
+219;qsort.at:24;Regular qsort (igraph_qsort):;qsort quick sort igraph_qsort;
+220;qsort.at:29;qsort with extra argument (igraph_qsort_r):;qsort quick sort igraph_qsort_r;
+221;matching.at:23;Maximum bipartite matching (igraph_maximum_bipartite_matching): ;bipartite matching;
+"
+# List of the all the test groups.
+at_groups_all=`$as_echo "$at_help_all" | sed 's/;.*//'`
+
+# at_fn_validate_ranges NAME...
+# -----------------------------
+# Validate and normalize the test group number contained in each variable
+# NAME. Leading zeroes are treated as decimal.
+at_fn_validate_ranges ()
+{
+  for at_grp
+  do
+    eval at_value=\$$at_grp
+    if test $at_value -lt 1 || test $at_value -gt 221; then
+      $as_echo "invalid test group: $at_value" >&2
+      exit 1
+    fi
+    case $at_value in
+      0*) # We want to treat leading 0 as decimal, like expr and test, but
+	  # AS_VAR_ARITH treats it as octal if it uses $(( )).
+	  # With XSI shells, ${at_value#${at_value%%[1-9]*}} avoids the
+	  # expr fork, but it is not worth the effort to determine if the
+	  # shell supports XSI when the user can just avoid leading 0.
+	  eval $at_grp='`expr $at_value + 0`' ;;
+    esac
+  done
+}
+
+at_prev=
+for at_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$at_prev"; then
+    at_option=$at_prev=$at_option
+    at_prev=
+  fi
+
+  case $at_option in
+  *=?*) at_optarg=`expr "X$at_option" : '[^=]*=\(.*\)'` ;;
+  *)    at_optarg= ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $at_option in
+    --help | -h )
+	at_help_p=:
+	;;
+
+    --list | -l )
+	at_list_p=:
+	;;
+
+    --version | -V )
+	at_version_p=:
+	;;
+
+    --clean | -c )
+	at_clean=:
+	;;
+
+    --color )
+	at_color=always
+	;;
+    --color=* )
+	case $at_optarg in
+	no | never | none) at_color=never ;;
+	auto | tty | if-tty) at_color=auto ;;
+	always | yes | force) at_color=always ;;
+	*) at_optname=`echo " $at_option" | sed 's/^ //; s/=.*//'`
+	   as_fn_error $? "unrecognized argument to $at_optname: $at_optarg" ;;
+	esac
+	;;
+
+    --debug | -d )
+	at_debug_p=:
+	;;
+
+    --errexit | -e )
+	at_debug_p=:
+	at_errexit_p=:
+	;;
+
+    --verbose | -v )
+	at_verbose=; at_quiet=:
+	;;
+
+    --trace | -x )
+	at_traceon='set -x'
+	at_trace_echo=echo
+	at_check_filter_trace=at_fn_filter_trace
+	;;
+
+    [0-9] | [0-9][0-9] | [0-9][0-9][0-9] | [0-9][0-9][0-9][0-9])
+	at_fn_validate_ranges at_option
+	as_fn_append at_groups "$at_option$as_nl"
+	;;
+
+    # Ranges
+    [0-9]- | [0-9][0-9]- | [0-9][0-9][0-9]- | [0-9][0-9][0-9][0-9]-)
+	at_range_start=`echo $at_option |tr -d X-`
+	at_fn_validate_ranges at_range_start
+	at_range=`$as_echo "$at_groups_all" | \
+	  sed -ne '/^'$at_range_start'$/,$p'`
+	as_fn_append at_groups "$at_range$as_nl"
+	;;
+
+    -[0-9] | -[0-9][0-9] | -[0-9][0-9][0-9] | -[0-9][0-9][0-9][0-9])
+	at_range_end=`echo $at_option |tr -d X-`
+	at_fn_validate_ranges at_range_end
+	at_range=`$as_echo "$at_groups_all" | \
+	  sed -ne '1,/^'$at_range_end'$/p'`
+	as_fn_append at_groups "$at_range$as_nl"
+	;;
+
+    [0-9]-[0-9] | [0-9]-[0-9][0-9] | [0-9]-[0-9][0-9][0-9] | \
+    [0-9]-[0-9][0-9][0-9][0-9] | [0-9][0-9]-[0-9][0-9] | \
+    [0-9][0-9]-[0-9][0-9][0-9] | [0-9][0-9]-[0-9][0-9][0-9][0-9] | \
+    [0-9][0-9][0-9]-[0-9][0-9][0-9] | \
+    [0-9][0-9][0-9]-[0-9][0-9][0-9][0-9] | \
+    [0-9][0-9][0-9][0-9]-[0-9][0-9][0-9][0-9] )
+	at_range_start=`expr $at_option : '\(.*\)-'`
+	at_range_end=`expr $at_option : '.*-\(.*\)'`
+	if test $at_range_start -gt $at_range_end; then
+	  at_tmp=$at_range_end
+	  at_range_end=$at_range_start
+	  at_range_start=$at_tmp
+	fi
+	at_fn_validate_ranges at_range_start at_range_end
+	at_range=`$as_echo "$at_groups_all" | \
+	  sed -ne '/^'$at_range_start'$/,/^'$at_range_end'$/p'`
+	as_fn_append at_groups "$at_range$as_nl"
+	;;
+
+    # Directory selection.
+    --directory | -C )
+	at_prev=--directory
+	;;
+    --directory=* )
+	at_change_dir=:
+	at_dir=$at_optarg
+	if test x- = "x$at_dir" ; then
+	  at_dir=./-
+	fi
+	;;
+
+    # Parallel execution.
+    --jobs | -j )
+	at_jobs=0
+	;;
+    --jobs=* | -j[0-9]* )
+	if test -n "$at_optarg"; then
+	  at_jobs=$at_optarg
+	else
+	  at_jobs=`expr X$at_option : 'X-j\(.*\)'`
+	fi
+	case $at_jobs in *[!0-9]*)
+	  at_optname=`echo " $at_option" | sed 's/^ //; s/[0-9=].*//'`
+	  as_fn_error $? "non-numeric argument to $at_optname: $at_jobs" ;;
+	esac
+	;;
+
+    # Keywords.
+    --keywords | -k )
+	at_prev=--keywords
+	;;
+    --keywords=* )
+	at_groups_selected=$at_help_all
+	at_save_IFS=$IFS
+	IFS=,
+	set X $at_optarg
+	shift
+	IFS=$at_save_IFS
+	for at_keyword
+	do
+	  at_invert=
+	  case $at_keyword in
+	  '!'*)
+	    at_invert="-v"
+	    at_keyword=`expr "X$at_keyword" : 'X!\(.*\)'`
+	    ;;
+	  esac
+	  # It is on purpose that we match the test group titles too.
+	  at_groups_selected=`$as_echo "$at_groups_selected" |
+	      grep -i $at_invert "^[1-9][^;]*;.*[; ]$at_keyword[ ;]"`
+	done
+	# Smash the keywords.
+	at_groups_selected=`$as_echo "$at_groups_selected" | sed 's/;.*//'`
+	as_fn_append at_groups "$at_groups_selected$as_nl"
+	;;
+    --recheck)
+	at_recheck=:
+	;;
+
+    *=*)
+	at_envvar=`expr "x$at_option" : 'x\([^=]*\)='`
+	# Reject names that are not valid shell variable names.
+	case $at_envvar in
+	  '' | [0-9]* | *[!_$as_cr_alnum]* )
+	    as_fn_error $? "invalid variable name: \`$at_envvar'" ;;
+	esac
+	at_value=`$as_echo "$at_optarg" | sed "s/'/'\\\\\\\\''/g"`
+	# Export now, but save eval for later and for debug scripts.
+	export $at_envvar
+	as_fn_append at_debug_args " $at_envvar='$at_value'"
+	;;
+
+     *) $as_echo "$as_me: invalid option: $at_option" >&2
+	$as_echo "Try \`$0 --help' for more information." >&2
+	exit 1
+	;;
+  esac
+done
+
+# Verify our last option didn't require an argument
+if test -n "$at_prev"; then :
+  as_fn_error $? "\`$at_prev' requires an argument"
+fi
+
+# The file containing the suite.
+at_suite_log=$at_dir/$as_me.log
+
+# Selected test groups.
+if test -z "$at_groups$at_recheck"; then
+  at_groups=$at_groups_all
+else
+  if test -n "$at_recheck" && test -r "$at_suite_log"; then
+    at_oldfails=`sed -n '
+      /^Failed tests:$/,/^Skipped tests:$/{
+	s/^[ ]*\([1-9][0-9]*\):.*/\1/p
+      }
+      /^Unexpected passes:$/,/^## Detailed failed tests/{
+	s/^[ ]*\([1-9][0-9]*\):.*/\1/p
+      }
+      /^## Detailed failed tests/q
+      ' "$at_suite_log"`
+    as_fn_append at_groups "$at_oldfails$as_nl"
+  fi
+  # Sort the tests, removing duplicates.
+  at_groups=`$as_echo "$at_groups" | sort -nu | sed '/^$/d'`
+fi
+
+if test x"$at_color" = xalways \
+   || { test x"$at_color" = xauto && test -t 1; }; then
+  at_red=`printf '\033[0;31m'`
+  at_grn=`printf '\033[0;32m'`
+  at_lgn=`printf '\033[1;32m'`
+  at_blu=`printf '\033[1;34m'`
+  at_std=`printf '\033[m'`
+else
+  at_red= at_grn= at_lgn= at_blu= at_std=
+fi
+
+# Help message.
+if $at_help_p; then
+  cat <<_ATEOF || at_write_fail=1
+Usage: $0 [OPTION]... [VARIABLE=VALUE]... [TESTS]
+
+Run all the tests, or the selected TESTS, given by numeric ranges, and
+save a detailed log file.  Upon failure, create debugging scripts.
+
+Do not change environment variables directly.  Instead, set them via
+command line arguments.  Set \`AUTOTEST_PATH' to select the executables
+to exercise.  Each relative directory is expanded as build and source
+directories relative to the top level of this distribution.
+E.g., from within the build directory /tmp/foo-1.0, invoking this:
+
+  $ $0 AUTOTEST_PATH=bin
+
+is equivalent to the following, assuming the source directory is /src/foo-1.0:
+
+  PATH=/tmp/foo-1.0/bin:/src/foo-1.0/bin:\$PATH $0
+_ATEOF
+cat <<_ATEOF || at_write_fail=1
+
+Operation modes:
+  -h, --help     print the help message, then exit
+  -V, --version  print version number, then exit
+  -c, --clean    remove all the files this test suite might create and exit
+  -l, --list     describes all the tests, or the selected TESTS
+_ATEOF
+cat <<_ATEOF || at_write_fail=1
+
+Execution tuning:
+  -C, --directory=DIR
+                 change to directory DIR before starting
+      --color[=never|auto|always]
+                 enable colored test results on terminal, or always
+  -j, --jobs[=N]
+                 Allow N jobs at once; infinite jobs with no arg (default 1)
+  -k, --keywords=KEYWORDS
+                 select the tests matching all the comma-separated KEYWORDS
+                 multiple \`-k' accumulate; prefixed \`!' negates a KEYWORD
+      --recheck  select all tests that failed or passed unexpectedly last time
+  -e, --errexit  abort as soon as a test fails; implies --debug
+  -v, --verbose  force more detailed output
+                 default for debugging scripts
+  -d, --debug    inhibit clean up and top-level logging
+                 default for debugging scripts
+  -x, --trace    enable tests shell tracing
+_ATEOF
+cat <<_ATEOF || at_write_fail=1
+
+Report bugs to <csardi.gabor@gmail.com>.
+_ATEOF
+  exit $at_write_fail
+fi
+
+# List of tests.
+if $at_list_p; then
+  cat <<_ATEOF || at_write_fail=1
+igraph 0.6.5 test suite: igraph test groups:
+
+ NUM: FILE-NAME:LINE     TEST-GROUP-NAME
+      KEYWORDS
+
+_ATEOF
+  # Pass an empty line as separator between selected groups and help.
+  $as_echo "$at_groups$as_nl$as_nl$at_help_all" |
+    awk 'NF == 1 && FS != ";" {
+	   selected[$ 1] = 1
+	   next
+	 }
+	 /^$/ { FS = ";" }
+	 NF > 0 {
+	   if (selected[$ 1]) {
+	     printf " %3d: %-18s %s\n", $ 1, $ 2, $ 3
+	     if ($ 4) {
+	       lmax = 79
+	       indent = "     "
+	       line = indent
+	       len = length (line)
+	       n = split ($ 4, a, " ")
+	       for (i = 1; i <= n; i++) {
+		 l = length (a[i]) + 1
+		 if (i > 1 && len + l > lmax) {
+		   print line
+		   line = indent " " a[i]
+		   len = length (line)
+		 } else {
+		   line = line " " a[i]
+		   len += l
+		 }
+	       }
+	       if (n)
+		 print line
+	     }
+	   }
+	 }' || at_write_fail=1
+  exit $at_write_fail
+fi
+if $at_version_p; then
+  $as_echo "$as_me (igraph 0.6.5)" &&
+  cat <<\_ATEOF || at_write_fail=1
+
+Copyright (C) 2010 Free Software Foundation, Inc.
+This test suite is free software; the Free Software Foundation gives
+unlimited permission to copy, distribute and modify it.
+_ATEOF
+  exit $at_write_fail
+fi
+
+# Should we print banners?  Yes if more than one test is run.
+case $at_groups in #(
+  *$as_nl* )
+      at_print_banners=: ;; #(
+  * ) at_print_banners=false ;;
+esac
+# Text for banner N, set to a single space once printed.
+# Banner 1. version.at:24
+# Category starts at test group 1.
+at_banner_text_1="igraph version number."
+# Banner 2. types.at:22
+# Category starts at test group 2.
+at_banner_text_2="Utility types (vector_t, etc.)"
+# Banner 3. basic.at:24
+# Category starts at test group 36.
+at_banner_text_3="Basic (interface) functions."
+# Banner 4. iterators.at:22
+# Category starts at test group 47.
+at_banner_text_4="Iterators aka vertex and edge sequences"
+# Banner 5. structure_generators.at:22
+# Category starts at test group 52.
+at_banner_text_5="Structure generators"
+# Banner 6. structural_properties.at:22
+# Category starts at test group 72.
+at_banner_text_6="Structural properties"
+# Banner 7. components.at:22
+# Category starts at test group 106.
+at_banner_text_7="Components"
+# Banner 8. layout.at:22
+# Category starts at test group 108.
+at_banner_text_8="Layouts"
+# Banner 9. visitors.at:22
+# Category starts at test group 117.
+at_banner_text_9="Visitors"
+# Banner 10. topology.at:22
+# Category starts at test group 119.
+at_banner_text_10="Graph topology"
+# Banner 11. motifs.at:22
+# Category starts at test group 123.
+at_banner_text_11="Motifs"
+# Banner 12. foreign.at:22
+# Category starts at test group 124.
+at_banner_text_12="Foreign formats"
+# Banner 13. other.at:22
+# Category starts at test group 137.
+at_banner_text_13="Miscellaneous functions"
+# Banner 14. operators.at:22
+# Category starts at test group 139.
+at_banner_text_14="Graphs operators"
+# Banner 15. conversion.at:22
+# Category starts at test group 145.
+at_banner_text_15="Conversion functions"
+# Banner 16. flow.at:22
+# Category starts at test group 148.
+at_banner_text_16="Maximum flows and such"
+# Banner 17. community.at:22
+# Category starts at test group 155.
+at_banner_text_17="Community structure"
+# Banner 18. cliques.at:24
+# Category starts at test group 165.
+at_banner_text_18="Cliques and independent vertex sets."
+# Banner 19. eigen.at:22
+# Category starts at test group 168.
+at_banner_text_19="Eigenvalues, eigenvectors"
+# Banner 20. attributes.at:22
+# Category starts at test group 174.
+at_banner_text_20="Attributes from C"
+# Banner 21. arpack.at:22
+# Category starts at test group 178.
+at_banner_text_21="BLAS, LAPACK and ARPACK based functions"
+# Banner 22. bipartite.at:22
+# Category starts at test group 186.
+at_banner_text_22="Bipartite graphs"
+# Banner 23. centralization.at:22
+# Category starts at test group 188.
+at_banner_text_23="Centralization"
+# Banner 24. separators.at:22
+# Category starts at test group 189.
+at_banner_text_24="Minimal separators"
+# Banner 25. hrg.at:22
+# Category starts at test group 195.
+at_banner_text_25="Hierarchical random graphs"
+# Banner 26. microscopic.at:21
+# Category starts at test group 198.
+at_banner_text_26="Microscopic updates"
+# Banner 27. mt.at:22
+# Category starts at test group 202.
+at_banner_text_27="Thread-safety tests"
+# Banner 28. scg.at:22
+# Category starts at test group 204.
+at_banner_text_28="Spectral coarse graining"
+# Banner 29. random.at:22
+# Category starts at test group 214.
+at_banner_text_29="Random number generators"
+# Banner 30. qsort.at:22
+# Category starts at test group 219.
+at_banner_text_30="Quick sort"
+# Banner 31. matching.at:21
+# Category starts at test group 221.
+at_banner_text_31="Maximum matchings"
+
+# Take any -C into account.
+if $at_change_dir ; then
+  test x != "x$at_dir" && cd "$at_dir" \
+    || as_fn_error $? "unable to change directory"
+  at_dir=`pwd`
+fi
+
+# Load the config files for any default variable assignments.
+for at_file in atconfig atlocal
+do
+  test -r $at_file || continue
+  . ./$at_file || as_fn_error $? "invalid content: $at_file"
+done
+
+# Autoconf <=2.59b set at_top_builddir instead of at_top_build_prefix:
+: "${at_top_build_prefix=$at_top_builddir}"
+
+# Perform any assignments requested during argument parsing.
+eval "$at_debug_args"
+
+# atconfig delivers names relative to the directory the test suite is
+# in, but the groups themselves are run in testsuite-dir/group-dir.
+if test -n "$at_top_srcdir"; then
+  builddir=../..
+  for at_dir_var in srcdir top_srcdir top_build_prefix
+  do
+    eval at_val=\$at_$at_dir_var
+    case $at_val in
+      [\\/$]* | ?:[\\/]* ) at_prefix= ;;
+      *) at_prefix=../../ ;;
+    esac
+    eval "$at_dir_var=\$at_prefix\$at_val"
+  done
+fi
+
+## -------------------- ##
+## Directory structure. ##
+## -------------------- ##
+
+# This is the set of directories and files used by this script
+# (non-literals are capitalized):
+#
+# TESTSUITE         - the testsuite
+# TESTSUITE.log     - summarizes the complete testsuite run
+# TESTSUITE.dir/    - created during a run, remains after -d or failed test
+# + at-groups/      - during a run: status of all groups in run
+# | + NNN/          - during a run: meta-data about test group NNN
+# | | + check-line  - location (source file and line) of current AT_CHECK
+# | | + status      - exit status of current AT_CHECK
+# | | + stdout      - stdout of current AT_CHECK
+# | | + stder1      - stderr, including trace
+# | | + stderr      - stderr, with trace filtered out
+# | | + test-source - portion of testsuite that defines group
+# | | + times       - timestamps for computing duration
+# | | + pass        - created if group passed
+# | | + xpass       - created if group xpassed
+# | | + fail        - created if group failed
+# | | + xfail       - created if group xfailed
+# | | + skip        - created if group skipped
+# + at-stop         - during a run: end the run if this file exists
+# + at-source-lines - during a run: cache of TESTSUITE line numbers for extraction
+# + 0..NNN/         - created for each group NNN, remains after -d or failed test
+# | + TESTSUITE.log - summarizes the group results
+# | + ...           - files created during the group
+
+# The directory the whole suite works in.
+# Should be absolute to let the user `cd' at will.
+at_suite_dir=$at_dir/$as_me.dir
+# The file containing the suite ($at_dir might have changed since earlier).
+at_suite_log=$at_dir/$as_me.log
+# The directory containing helper files per test group.
+at_helper_dir=$at_suite_dir/at-groups
+# Stop file: if it exists, do not start new jobs.
+at_stop_file=$at_suite_dir/at-stop
+# The fifo used for the job dispatcher.
+at_job_fifo=$at_suite_dir/at-job-fifo
+
+if $at_clean; then
+  test -d "$at_suite_dir" &&
+    find "$at_suite_dir" -type d ! -perm -700 -exec chmod u+rwx \{\} \;
+  rm -f -r "$at_suite_dir" "$at_suite_log"
+  exit $?
+fi
+
+# Don't take risks: use only absolute directories in PATH.
+#
+# For stand-alone test suites (ie. atconfig was not found),
+# AUTOTEST_PATH is relative to `.'.
+#
+# For embedded test suites, AUTOTEST_PATH is relative to the top level
+# of the package.  Then expand it into build/src parts, since users
+# may create executables in both places.
+AUTOTEST_PATH=`$as_echo "$AUTOTEST_PATH" | sed "s|:|$PATH_SEPARATOR|g"`
+at_path=
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $AUTOTEST_PATH $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -n "$at_path" && as_fn_append at_path $PATH_SEPARATOR
+case $as_dir in
+  [\\/]* | ?:[\\/]* )
+    as_fn_append at_path "$as_dir"
+    ;;
+  * )
+    if test -z "$at_top_build_prefix"; then
+      # Stand-alone test suite.
+      as_fn_append at_path "$as_dir"
+    else
+      # Embedded test suite.
+      as_fn_append at_path "$at_top_build_prefix$as_dir$PATH_SEPARATOR"
+      as_fn_append at_path "$at_top_srcdir/$as_dir"
+    fi
+    ;;
+esac
+  done
+IFS=$as_save_IFS
+
+
+# Now build and simplify PATH.
+#
+# There might be directories that don't exist, but don't redirect
+# builtins' (eg., cd) stderr directly: Ultrix's sh hates that.
+at_new_path=
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $at_path
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -d "$as_dir" || continue
+case $as_dir in
+  [\\/]* | ?:[\\/]* ) ;;
+  * ) as_dir=`(cd "$as_dir" && pwd) 2>/dev/null` ;;
+esac
+case $PATH_SEPARATOR$at_new_path$PATH_SEPARATOR in
+  *$PATH_SEPARATOR$as_dir$PATH_SEPARATOR*) ;;
+  $PATH_SEPARATOR$PATH_SEPARATOR) at_new_path=$as_dir ;;
+  *) as_fn_append at_new_path "$PATH_SEPARATOR$as_dir" ;;
+esac
+  done
+IFS=$as_save_IFS
+
+PATH=$at_new_path
+export PATH
+
+# Setting up the FDs.
+
+
+
+# 5 is the log file.  Not to be overwritten if `-d'.
+if $at_debug_p; then
+  at_suite_log=/dev/null
+else
+  : >"$at_suite_log"
+fi
+exec 5>>"$at_suite_log"
+
+# Banners and logs.
+$as_echo "## -------------------------------- ##
+## igraph 0.6.5 test suite: igraph. ##
+## -------------------------------- ##"
+{
+  $as_echo "## -------------------------------- ##
+## igraph 0.6.5 test suite: igraph. ##
+## -------------------------------- ##"
+  echo
+
+  $as_echo "$as_me: command line was:"
+  $as_echo "  \$ $0 $at_cli_args"
+  echo
+
+  # If ChangeLog exists, list a few lines in case it might help determining
+  # the exact version.
+  if test -n "$at_top_srcdir" && test -f "$at_top_srcdir/ChangeLog"; then
+    $as_echo "## ---------- ##
+## ChangeLog. ##
+## ---------- ##"
+    echo
+    sed 's/^/| /;10q' "$at_top_srcdir/ChangeLog"
+    echo
+  fi
+
+  {
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+}
+  echo
+
+  # Contents of the config files.
+  for at_file in atconfig atlocal
+  do
+    test -r $at_file || continue
+    $as_echo "$as_me: $at_file:"
+    sed 's/^/| /' $at_file
+    echo
+  done
+} >&5
+
+
+## ------------------------- ##
+## Autotest shell functions. ##
+## ------------------------- ##
+
+# at_fn_banner NUMBER
+# -------------------
+# Output banner NUMBER, provided the testsuite is running multiple groups and
+# this particular banner has not yet been printed.
+at_fn_banner ()
+{
+  $at_print_banners || return 0
+  eval at_banner_text=\$at_banner_text_$1
+  test "x$at_banner_text" = "x " && return 0
+  eval "at_banner_text_$1=\" \""
+  if test -z "$at_banner_text"; then
+    $at_first || echo
+  else
+    $as_echo "$as_nl$at_banner_text$as_nl"
+  fi
+} # at_fn_banner
+
+# at_fn_check_prepare_notrace REASON LINE
+# ---------------------------------------
+# Perform AT_CHECK preparations for the command at LINE for an untraceable
+# command; REASON is the reason for disabling tracing.
+at_fn_check_prepare_notrace ()
+{
+  $at_trace_echo "Not enabling shell tracing (command contains $1)"
+  $as_echo "$2" >"$at_check_line_file"
+  at_check_trace=: at_check_filter=:
+  : >"$at_stdout"; : >"$at_stderr"
+}
+
+# at_fn_check_prepare_trace LINE
+# ------------------------------
+# Perform AT_CHECK preparations for the command at LINE for a traceable
+# command.
+at_fn_check_prepare_trace ()
+{
+  $as_echo "$1" >"$at_check_line_file"
+  at_check_trace=$at_traceon at_check_filter=$at_check_filter_trace
+  : >"$at_stdout"; : >"$at_stderr"
+}
+
+# at_fn_check_prepare_dynamic COMMAND LINE
+# ----------------------------------------
+# Decide if COMMAND at LINE is traceable at runtime, and call the appropriate
+# preparation function.
+at_fn_check_prepare_dynamic ()
+{
+  case $1 in
+    *$as_nl*)
+      at_fn_check_prepare_notrace 'an embedded newline' "$2" ;;
+    *)
+      at_fn_check_prepare_trace "$2" ;;
+  esac
+}
+
+# at_fn_filter_trace
+# ------------------
+# Remove the lines in the file "$at_stderr" generated by "set -x" and print
+# them to stderr.
+at_fn_filter_trace ()
+{
+  mv "$at_stderr" "$at_stder1"
+  grep '^ *+' "$at_stder1" >&2
+  grep -v '^ *+' "$at_stder1" >"$at_stderr"
+}
+
+# at_fn_log_failure FILE-LIST
+# ---------------------------
+# Copy the files in the list on stdout with a "> " prefix, and exit the shell
+# with a failure exit code.
+at_fn_log_failure ()
+{
+  for file
+    do $as_echo "$file:"; sed 's/^/> /' "$file"; done
+  echo 1 > "$at_status_file"
+  exit 1
+}
+
+# at_fn_check_skip EXIT-CODE LINE
+# -------------------------------
+# Check whether EXIT-CODE is a special exit code (77 or 99), and if so exit
+# the test group subshell with that same exit code. Use LINE in any report
+# about test failure.
+at_fn_check_skip ()
+{
+  case $1 in
+    99) echo 99 > "$at_status_file"; at_failed=:
+	$as_echo "$2: hard failure"; exit 99;;
+    77) echo 77 > "$at_status_file"; exit 77;;
+  esac
+}
+
+# at_fn_check_status EXPECTED EXIT-CODE LINE
+# ------------------------------------------
+# Check whether EXIT-CODE is the EXPECTED exit code, and if so do nothing.
+# Otherwise, if it is 77 or 99, exit the test group subshell with that same
+# exit code; if it is anything else print an error message referring to LINE,
+# and fail the test.
+at_fn_check_status ()
+{
+  case $2 in
+    $1 ) ;;
+    77) echo 77 > "$at_status_file"; exit 77;;
+    99) echo 99 > "$at_status_file"; at_failed=:
+	$as_echo "$3: hard failure"; exit 99;;
+    *) $as_echo "$3: exit code was $2, expected $1"
+      at_failed=:;;
+  esac
+}
+
+# at_fn_diff_devnull FILE
+# -----------------------
+# Emit a diff between /dev/null and FILE. Uses "test -s" to avoid useless diff
+# invocations.
+at_fn_diff_devnull ()
+{
+  test -s "$1" || return 0
+  $at_diff "$at_devnull" "$1"
+}
+
+# at_fn_test NUMBER
+# -----------------
+# Parse out test NUMBER from the tail of this file.
+at_fn_test ()
+{
+  eval at_sed=\$at_sed$1
+  sed "$at_sed" "$at_myself" > "$at_test_source"
+}
+
+# at_fn_create_debugging_script
+# -----------------------------
+# Create the debugging script $at_group_dir/run which will reproduce the
+# current test group.
+at_fn_create_debugging_script ()
+{
+  {
+    echo "#! /bin/sh" &&
+    echo 'test "${ZSH_VERSION+set}" = set && alias -g '\''${1+"$@"}'\''='\''"$@"'\''' &&
+    $as_echo "cd '$at_dir'" &&
+    $as_echo "exec \${CONFIG_SHELL-$SHELL} \"$at_myself\" -v -d $at_debug_args $at_group \${1+\"\$@\"}" &&
+    echo 'exit 1'
+  } >"$at_group_dir/run" &&
+  chmod +x "$at_group_dir/run"
+}
+
+## -------------------------------- ##
+## End of autotest shell functions. ##
+## -------------------------------- ##
+{
+  $as_echo "## ---------------- ##
+## Tested programs. ##
+## ---------------- ##"
+  echo
+} >&5
+
+# Report what programs are being tested.
+for at_program in : $at_tested
+do
+  test "$at_program" = : && continue
+  case $at_program in
+    [\\/]* | ?:[\\/]* ) $at_program_=$at_program ;;
+    * )
+    as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -f "$as_dir/$at_program" && break
+  done
+IFS=$as_save_IFS
+
+    at_program_=$as_dir/$at_program ;;
+  esac
+  if test -f "$at_program_"; then
+    {
+      $as_echo "$at_srcdir/testsuite.at:22: $at_program_ --version"
+      "$at_program_" --version </dev/null
+      echo
+    } >&5 2>&1
+  else
+    as_fn_error $? "cannot find $at_program" "$LINENO" 5
+  fi
+done
+
+{
+  $as_echo "## ------------------ ##
+## Running the tests. ##
+## ------------------ ##"
+} >&5
+
+at_start_date=`date`
+at_start_time=`date +%s 2>/dev/null`
+$as_echo "$as_me: starting at: $at_start_date" >&5
+
+# Create the master directory if it doesn't already exist.
+as_dir="$at_suite_dir"; as_fn_mkdir_p ||
+  as_fn_error $? "cannot create \`$at_suite_dir'" "$LINENO" 5
+
+# Can we diff with `/dev/null'?  DU 5.0 refuses.
+if diff /dev/null /dev/null >/dev/null 2>&1; then
+  at_devnull=/dev/null
+else
+  at_devnull=$at_suite_dir/devnull
+  >"$at_devnull"
+fi
+
+# Use `diff -u' when possible.
+if at_diff=`diff -u "$at_devnull" "$at_devnull" 2>&1` && test -z "$at_diff"
+then
+  at_diff='diff -u'
+else
+  at_diff=diff
+fi
+
+# Get the last needed group.
+for at_group in : $at_groups; do :; done
+
+# Extract the start and end lines of each test group at the tail
+# of this file
+awk '
+BEGIN { FS="" }
+/^#AT_START_/ {
+  start = NR
+}
+/^#AT_STOP_/ {
+  test = substr ($ 0, 10)
+  print "at_sed" test "=\"1," start "d;" (NR-1) "q\""
+  if (test == "'"$at_group"'") exit
+}' "$at_myself" > "$at_suite_dir/at-source-lines" &&
+. "$at_suite_dir/at-source-lines" ||
+  as_fn_error $? "cannot create test line number cache" "$LINENO" 5
+rm -f "$at_suite_dir/at-source-lines"
+
+# Set number of jobs for `-j'; avoid more jobs than test groups.
+set X $at_groups; shift; at_max_jobs=$#
+if test $at_max_jobs -eq 0; then
+  at_jobs=1
+fi
+if test $at_jobs -ne 1 &&
+   { test $at_jobs -eq 0 || test $at_jobs -gt $at_max_jobs; }; then
+  at_jobs=$at_max_jobs
+fi
+
+# If parallel mode, don't output banners, don't split summary lines.
+if test $at_jobs -ne 1; then
+  at_print_banners=false
+  at_quiet=:
+fi
+
+# Set up helper dirs.
+rm -rf "$at_helper_dir" &&
+mkdir "$at_helper_dir" &&
+cd "$at_helper_dir" &&
+{ test -z "$at_groups" || mkdir $at_groups; } ||
+as_fn_error $? "testsuite directory setup failed" "$LINENO" 5
+
+# Functions for running a test group.  We leave the actual
+# test group execution outside of a shell function in order
+# to avoid hitting zsh 4.x exit status bugs.
+
+# at_fn_group_prepare
+# -------------------
+# Prepare for running a test group.
+at_fn_group_prepare ()
+{
+  # The directory for additional per-group helper files.
+  at_job_dir=$at_helper_dir/$at_group
+  # The file containing the location of the last AT_CHECK.
+  at_check_line_file=$at_job_dir/check-line
+  # The file containing the exit status of the last command.
+  at_status_file=$at_job_dir/status
+  # The files containing the output of the tested commands.
+  at_stdout=$at_job_dir/stdout
+  at_stder1=$at_job_dir/stder1
+  at_stderr=$at_job_dir/stderr
+  # The file containing the code for a test group.
+  at_test_source=$at_job_dir/test-source
+  # The file containing dates.
+  at_times_file=$at_job_dir/times
+
+  # Be sure to come back to the top test directory.
+  cd "$at_suite_dir"
+
+  # Clearly separate the test groups when verbose.
+  $at_first || $at_verbose echo
+
+  at_group_normalized=$at_group
+
+  eval 'while :; do
+    case $at_group_normalized in #(
+    '"$at_format"'*) break;;
+    esac
+    at_group_normalized=0$at_group_normalized
+  done'
+
+
+  # Create a fresh directory for the next test group, and enter.
+  # If one already exists, the user may have invoked ./run from
+  # within that directory; we remove the contents, but not the
+  # directory itself, so that we aren't pulling the rug out from
+  # under the shell's notion of the current directory.
+  at_group_dir=$at_suite_dir/$at_group_normalized
+  at_group_log=$at_group_dir/$as_me.log
+  if test -d "$at_group_dir"; then
+  find "$at_group_dir" -type d ! -perm -700 -exec chmod u+rwx {} \;
+  rm -fr "$at_group_dir"/* "$at_group_dir"/.[!.] "$at_group_dir"/.??*
+fi ||
+    { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: test directory for $at_group_normalized could not be cleaned" >&5
+$as_echo "$as_me: WARNING: test directory for $at_group_normalized could not be cleaned" >&2;}
+  # Be tolerant if the above `rm' was not able to remove the directory.
+  as_dir="$at_group_dir"; as_fn_mkdir_p
+
+  echo 0 > "$at_status_file"
+
+  # In verbose mode, append to the log file *and* show on
+  # the standard output; in quiet mode only write to the log.
+  if test -z "$at_verbose"; then
+    at_tee_pipe='tee -a "$at_group_log"'
+  else
+    at_tee_pipe='cat >> "$at_group_log"'
+  fi
+}
+
+# at_fn_group_banner ORDINAL LINE DESC PAD [BANNER]
+# -------------------------------------------------
+# Declare the test group ORDINAL, located at LINE with group description DESC,
+# and residing under BANNER. Use PAD to align the status column.
+at_fn_group_banner ()
+{
+  at_setup_line="$2"
+  test -n "$5" && at_fn_banner $5
+  at_desc="$3"
+  case $1 in
+    [0-9])      at_desc_line="  $1: ";;
+    [0-9][0-9]) at_desc_line=" $1: " ;;
+    *)          at_desc_line="$1: "  ;;
+  esac
+  as_fn_append at_desc_line "$3$4"
+  $at_quiet $as_echo_n "$at_desc_line"
+  echo "#                             -*- compilation -*-" >> "$at_group_log"
+}
+
+# at_fn_group_postprocess
+# -----------------------
+# Perform cleanup after running a test group.
+at_fn_group_postprocess ()
+{
+  # Be sure to come back to the suite directory, in particular
+  # since below we might `rm' the group directory we are in currently.
+  cd "$at_suite_dir"
+
+  if test ! -f "$at_check_line_file"; then
+    sed "s/^ */$as_me: WARNING: /" <<_ATEOF
+      A failure happened in a test group before any test could be
+      run. This means that test suite is improperly designed.  Please
+      report this failure to <csardi.gabor@gmail.com>.
+_ATEOF
+    $as_echo "$at_setup_line" >"$at_check_line_file"
+    at_status=99
+  fi
+  $at_verbose $as_echo_n "$at_group. $at_setup_line: "
+  $as_echo_n "$at_group. $at_setup_line: " >> "$at_group_log"
+  case $at_xfail:$at_status in
+    yes:0)
+	at_msg="UNEXPECTED PASS"
+	at_res=xpass
+	at_errexit=$at_errexit_p
+	at_color=$at_red
+	;;
+    no:0)
+	at_msg="ok"
+	at_res=pass
+	at_errexit=false
+	at_color=$at_grn
+	;;
+    *:77)
+	at_msg='skipped ('`cat "$at_check_line_file"`')'
+	at_res=skip
+	at_errexit=false
+	at_color=$at_blu
+	;;
+    no:* | *:99)
+	at_msg='FAILED ('`cat "$at_check_line_file"`')'
+	at_res=fail
+	at_errexit=$at_errexit_p
+	at_color=$at_red
+	;;
+    yes:*)
+	at_msg='expected failure ('`cat "$at_check_line_file"`')'
+	at_res=xfail
+	at_errexit=false
+	at_color=$at_lgn
+	;;
+  esac
+  echo "$at_res" > "$at_job_dir/$at_res"
+  # In parallel mode, output the summary line only afterwards.
+  if test $at_jobs -ne 1 && test -n "$at_verbose"; then
+    $as_echo "$at_desc_line $at_color$at_msg$at_std"
+  else
+    # Make sure there is a separator even with long titles.
+    $as_echo " $at_color$at_msg$at_std"
+  fi
+  at_log_msg="$at_group. $at_desc ($at_setup_line): $at_msg"
+  case $at_status in
+    0|77)
+      # $at_times_file is only available if the group succeeded.
+      # We're not including the group log, so the success message
+      # is written in the global log separately.  But we also
+      # write to the group log in case they're using -d.
+      if test -f "$at_times_file"; then
+	at_log_msg="$at_log_msg     ("`sed 1d "$at_times_file"`')'
+	rm -f "$at_times_file"
+      fi
+      $as_echo "$at_log_msg" >> "$at_group_log"
+      $as_echo "$at_log_msg" >&5
+
+      # Cleanup the group directory, unless the user wants the files
+      # or the success was unexpected.
+      if $at_debug_p || test $at_res = xpass; then
+	at_fn_create_debugging_script
+	if test $at_res = xpass && $at_errexit; then
+	  echo stop > "$at_stop_file"
+	fi
+      else
+	if test -d "$at_group_dir"; then
+	  find "$at_group_dir" -type d ! -perm -700 -exec chmod u+rwx \{\} \;
+	  rm -fr "$at_group_dir"
+	fi
+	rm -f "$at_test_source"
+      fi
+      ;;
+    *)
+      # Upon failure, include the log into the testsuite's global
+      # log.  The failure message is written in the group log.  It
+      # is later included in the global log.
+      $as_echo "$at_log_msg" >> "$at_group_log"
+
+      # Upon failure, keep the group directory for autopsy, and create
+      # the debugging script.  With -e, do not start any further tests.
+      at_fn_create_debugging_script
+      if $at_errexit; then
+	echo stop > "$at_stop_file"
+      fi
+      ;;
+  esac
+}
+
+
+## ------------ ##
+## Driver loop. ##
+## ------------ ##
+
+
+if (set -m && set +m && set +b) >/dev/null 2>&1; then
+  set +b
+  at_job_control_on='set -m' at_job_control_off='set +m' at_job_group=-
+else
+  at_job_control_on=: at_job_control_off=: at_job_group=
+fi
+
+for at_signal in 1 2 15; do
+  trap 'set +x; set +e
+	$at_job_control_off
+	at_signal='"$at_signal"'
+	echo stop > "$at_stop_file"
+	trap "" $at_signal
+	at_pgids=
+	for at_pgid in `jobs -p 2>/dev/null`; do
+	  at_pgids="$at_pgids $at_job_group$at_pgid"
+	done
+	test -z "$at_pgids" || kill -$at_signal $at_pgids 2>/dev/null
+	wait
+	if test "$at_jobs" -eq 1 || test -z "$at_verbose"; then
+	  echo >&2
+	fi
+	at_signame=`kill -l $at_signal 2>&1 || echo $at_signal`
+	set x $at_signame
+	test 1 -gt 2 && at_signame=$at_signal
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: caught signal $at_signame, bailing out" >&5
+$as_echo "$as_me: WARNING: caught signal $at_signame, bailing out" >&2;}
+	as_fn_arith 128 + $at_signal && exit_status=$as_val
+	as_fn_exit $exit_status' $at_signal
+done
+
+rm -f "$at_stop_file"
+at_first=:
+
+if test $at_jobs -ne 1 &&
+     rm -f "$at_job_fifo" &&
+     test -n "$at_job_group" &&
+     ( mkfifo "$at_job_fifo" && trap 'exit 1' PIPE STOP TSTP ) 2>/dev/null
+then
+  # FIFO job dispatcher.
+
+  trap 'at_pids=
+	for at_pid in `jobs -p`; do
+	  at_pids="$at_pids $at_job_group$at_pid"
+	done
+	if test -n "$at_pids"; then
+	  at_sig=TSTP
+	  test "${TMOUT+set}" = set && at_sig=STOP
+	  kill -$at_sig $at_pids 2>/dev/null
+	fi
+	kill -STOP $$
+	test -z "$at_pids" || kill -CONT $at_pids 2>/dev/null' TSTP
+
+  echo
+  # Turn jobs into a list of numbers, starting from 1.
+  at_joblist=`$as_echo "$at_groups" | sed -n 1,${at_jobs}p`
+
+  set X $at_joblist
+  shift
+  for at_group in $at_groups; do
+    $at_job_control_on 2>/dev/null
+    (
+      # Start one test group.
+      $at_job_control_off
+      if $at_first; then
+	exec 7>"$at_job_fifo"
+      else
+	exec 6<&-
+      fi
+      trap 'set +x; set +e
+	    trap "" PIPE
+	    echo stop > "$at_stop_file"
+	    echo >&7
+	    as_fn_exit 141' PIPE
+      at_fn_group_prepare
+      if cd "$at_group_dir" &&
+	 at_fn_test $at_group &&
+	 . "$at_test_source"
+      then :; else
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unable to parse test group: $at_group" >&5
+$as_echo "$as_me: WARNING: unable to parse test group: $at_group" >&2;}
+	at_failed=:
+      fi
+      at_fn_group_postprocess
+      echo >&7
+    ) &
+    $at_job_control_off
+    if $at_first; then
+      at_first=false
+      exec 6<"$at_job_fifo" 7>"$at_job_fifo"
+    fi
+    shift # Consume one token.
+    if test $# -gt 0; then :; else
+      read at_token <&6 || break
+      set x $*
+    fi
+    test -f "$at_stop_file" && break
+  done
+  exec 7>&-
+  # Read back the remaining ($at_jobs - 1) tokens.
+  set X $at_joblist
+  shift
+  if test $# -gt 0; then
+    shift
+    for at_job
+    do
+      read at_token
+    done <&6
+  fi
+  exec 6<&-
+  wait
+else
+  # Run serially, avoid forks and other potential surprises.
+  for at_group in $at_groups; do
+    at_fn_group_prepare
+    if cd "$at_group_dir" &&
+       at_fn_test $at_group &&
+       . "$at_test_source"; then :; else
+      { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unable to parse test group: $at_group" >&5
+$as_echo "$as_me: WARNING: unable to parse test group: $at_group" >&2;}
+      at_failed=:
+    fi
+    at_fn_group_postprocess
+    test -f "$at_stop_file" && break
+    at_first=false
+  done
+fi
+
+# Wrap up the test suite with summary statistics.
+cd "$at_helper_dir"
+
+# Use ?..???? when the list must remain sorted, the faster * otherwise.
+at_pass_list=`for f in */pass; do echo $f; done | sed '/\*/d; s,/pass,,'`
+at_skip_list=`for f in */skip; do echo $f; done | sed '/\*/d; s,/skip,,'`
+at_xfail_list=`for f in */xfail; do echo $f; done | sed '/\*/d; s,/xfail,,'`
+at_xpass_list=`for f in ?/xpass ??/xpass ???/xpass ????/xpass; do
+		 echo $f; done | sed '/?/d; s,/xpass,,'`
+at_fail_list=`for f in ?/fail ??/fail ???/fail ????/fail; do
+		echo $f; done | sed '/?/d; s,/fail,,'`
+
+set X $at_pass_list $at_xpass_list $at_xfail_list $at_fail_list $at_skip_list
+shift; at_group_count=$#
+set X $at_xpass_list; shift; at_xpass_count=$#; at_xpass_list=$*
+set X $at_xfail_list; shift; at_xfail_count=$#
+set X $at_fail_list; shift; at_fail_count=$#; at_fail_list=$*
+set X $at_skip_list; shift; at_skip_count=$#
+
+as_fn_arith $at_group_count - $at_skip_count && at_run_count=$as_val
+as_fn_arith $at_xpass_count + $at_fail_count && at_unexpected_count=$as_val
+as_fn_arith $at_xfail_count + $at_fail_count && at_total_fail_count=$as_val
+
+# Back to the top directory.
+cd "$at_dir"
+rm -rf "$at_helper_dir"
+
+# Compute the duration of the suite.
+at_stop_date=`date`
+at_stop_time=`date +%s 2>/dev/null`
+$as_echo "$as_me: ending at: $at_stop_date" >&5
+case $at_start_time,$at_stop_time in
+  [0-9]*,[0-9]*)
+    as_fn_arith $at_stop_time - $at_start_time && at_duration_s=$as_val
+    as_fn_arith $at_duration_s / 60 && at_duration_m=$as_val
+    as_fn_arith $at_duration_m / 60 && at_duration_h=$as_val
+    as_fn_arith $at_duration_s % 60 && at_duration_s=$as_val
+    as_fn_arith $at_duration_m % 60 && at_duration_m=$as_val
+    at_duration="${at_duration_h}h ${at_duration_m}m ${at_duration_s}s"
+    $as_echo "$as_me: test suite duration: $at_duration" >&5
+    ;;
+esac
+
+echo
+$as_echo "## ------------- ##
+## Test results. ##
+## ------------- ##"
+echo
+{
+  echo
+  $as_echo "## ------------- ##
+## Test results. ##
+## ------------- ##"
+  echo
+} >&5
+
+if test $at_run_count = 1; then
+  at_result="1 test"
+  at_were=was
+else
+  at_result="$at_run_count tests"
+  at_were=were
+fi
+if $at_errexit_p && test $at_unexpected_count != 0; then
+  if test $at_xpass_count = 1; then
+    at_result="$at_result $at_were run, one passed"
+  else
+    at_result="$at_result $at_were run, one failed"
+  fi
+  at_result="$at_result unexpectedly and inhibited subsequent tests."
+  at_color=$at_red
+else
+  # Don't you just love exponential explosion of the number of cases?
+  at_color=$at_red
+  case $at_xpass_count:$at_fail_count:$at_xfail_count in
+    # So far, so good.
+    0:0:0) at_result="$at_result $at_were successful." at_color=$at_grn ;;
+    0:0:*) at_result="$at_result behaved as expected." at_color=$at_lgn ;;
+
+    # Some unexpected failures
+    0:*:0) at_result="$at_result $at_were run,
+$at_fail_count failed unexpectedly." ;;
+
+    # Some failures, both expected and unexpected
+    0:*:1) at_result="$at_result $at_were run,
+$at_total_fail_count failed ($at_xfail_count expected failure)." ;;
+    0:*:*) at_result="$at_result $at_were run,
+$at_total_fail_count failed ($at_xfail_count expected failures)." ;;
+
+    # No unexpected failures, but some xpasses
+    *:0:*) at_result="$at_result $at_were run,
+$at_xpass_count passed unexpectedly." ;;
+
+    # No expected failures, but failures and xpasses
+    *:1:0) at_result="$at_result $at_were run,
+$at_unexpected_count did not behave as expected ($at_fail_count unexpected failure)." ;;
+    *:*:0) at_result="$at_result $at_were run,
+$at_unexpected_count did not behave as expected ($at_fail_count unexpected failures)." ;;
+
+    # All of them.
+    *:*:1) at_result="$at_result $at_were run,
+$at_xpass_count passed unexpectedly,
+$at_total_fail_count failed ($at_xfail_count expected failure)." ;;
+    *:*:*) at_result="$at_result $at_were run,
+$at_xpass_count passed unexpectedly,
+$at_total_fail_count failed ($at_xfail_count expected failures)." ;;
+  esac
+
+  if test $at_skip_count = 0 && test $at_run_count -gt 1; then
+    at_result="All $at_result"
+  fi
+fi
+
+# Now put skips in the mix.
+case $at_skip_count in
+  0) ;;
+  1) at_result="$at_result
+1 test was skipped." ;;
+  *) at_result="$at_result
+$at_skip_count tests were skipped." ;;
+esac
+
+if test $at_unexpected_count = 0; then
+  echo "$at_color$at_result$at_std"
+  echo "$at_result" >&5
+else
+  echo "${at_color}ERROR: $at_result$at_std" >&2
+  echo "ERROR: $at_result" >&5
+  {
+    echo
+    $as_echo "## ------------------------ ##
+## Summary of the failures. ##
+## ------------------------ ##"
+
+    # Summary of failed and skipped tests.
+    if test $at_fail_count != 0; then
+      echo "Failed tests:"
+      $SHELL "$at_myself" $at_fail_list --list
+      echo
+    fi
+    if test $at_skip_count != 0; then
+      echo "Skipped tests:"
+      $SHELL "$at_myself" $at_skip_list --list
+      echo
+    fi
+    if test $at_xpass_count != 0; then
+      echo "Unexpected passes:"
+      $SHELL "$at_myself" $at_xpass_list --list
+      echo
+    fi
+    if test $at_fail_count != 0; then
+      $as_echo "## ---------------------- ##
+## Detailed failed tests. ##
+## ---------------------- ##"
+      echo
+      for at_group in $at_fail_list
+      do
+	at_group_normalized=$at_group
+
+  eval 'while :; do
+    case $at_group_normalized in #(
+    '"$at_format"'*) break;;
+    esac
+    at_group_normalized=0$at_group_normalized
+  done'
+
+	cat "$at_suite_dir/$at_group_normalized/$as_me.log"
+	echo
+      done
+      echo
+    fi
+    if test -n "$at_top_srcdir"; then
+      sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## ${at_top_build_prefix}config.log ##
+_ASBOX
+      sed 's/^/| /' ${at_top_build_prefix}config.log
+      echo
+    fi
+  } >&5
+
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## $as_me.log was created. ##
+_ASBOX
+
+  echo
+  if $at_debug_p; then
+    at_msg='per-test log files'
+  else
+    at_msg="\`${at_testdir+${at_testdir}/}$as_me.log'"
+  fi
+  $as_echo "Please send $at_msg and all information you think might help:
+
+   To: <csardi.gabor@gmail.com>
+   Subject: [igraph 0.6.5] $as_me: $at_fail_list${at_fail_list:+ failed${at_xpass_list:+, }}$at_xpass_list${at_xpass_list:+ passed unexpectedly}
+
+You may investigate any problem if you feel able to do so, in which
+case the test suite provides a good starting point.  Its output may
+be found below \`${at_testdir+${at_testdir}/}$as_me.dir'.
+"
+  exit 1
+fi
+
+exit 0
+
+## ------------- ##
+## Actual tests. ##
+## ------------- ##
+#AT_START_1
+at_fn_group_banner 1 'version.at:26' \
+  "Simple version query (igraph_version): " "        " 1
+at_xfail=no
+(
+  $as_echo "1. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/version.at:28: \$CC \${abs_top_srcdir}/examples/simple/igraph_version.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "version.at:28"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_version.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/version.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/version.at:28: >expout"
+at_fn_check_prepare_trace "version.at:28"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/version.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/version.at:28: "
+at_fn_check_prepare_trace "version.at:28"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/version.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/version.at:28: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "version.at:28"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/version.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_1
+#AT_START_2
+at_fn_group_banner 2 'types.at:24' \
+  "Vector (vector_t): " "                            " 2
+at_xfail=no
+(
+  $as_echo "2. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:26: \$CC \${abs_top_srcdir}/examples/simple/vector.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/vector.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:26: cp \${abs_top_srcdir}/examples/'simple/vector.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/vector.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:26: "
+at_fn_check_prepare_trace "types.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_2
+#AT_START_3
+at_fn_group_banner 3 'types.at:29' \
+  "Vector (more) (vector_t): " "                     " 2
+at_xfail=no
+(
+  $as_echo "3. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:31: \$CC \${abs_top_srcdir}/examples/simple/vector2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/vector2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:31: cp \${abs_top_srcdir}/examples/'simple/vector2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/vector2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:31: "
+at_fn_check_prepare_trace "types.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_3
+#AT_START_4
+at_fn_group_banner 4 'types.at:34' \
+  "Vector (even more) (vector_t): " "                " 2
+at_xfail=no
+(
+  $as_echo "4. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:36: \$CC \${abs_top_srcdir}/examples/simple/vector3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/vector3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:36: >expout"
+at_fn_check_prepare_trace "types.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:36: "
+at_fn_check_prepare_trace "types.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_4
+#AT_START_5
+at_fn_group_banner 5 'types.at:39' \
+  "Matrix (matrix_t): " "                            " 2
+at_xfail=no
+(
+  $as_echo "5. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:41: \$CC \${abs_top_srcdir}/examples/simple/matrix.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/matrix.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:41: cp \${abs_top_srcdir}/examples/'simple/matrix.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:41"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/matrix.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:41: "
+at_fn_check_prepare_trace "types.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_5
+#AT_START_6
+at_fn_group_banner 6 'types.at:44' \
+  "Matrix (more) (matrix_t): " "                     " 2
+at_xfail=no
+(
+  $as_echo "6. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:46: \$CC \${abs_top_srcdir}/examples/simple/matrix2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:46"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/matrix2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:46: cp \${abs_top_srcdir}/examples/'simple/matrix2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:46"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/matrix2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:46: "
+at_fn_check_prepare_trace "types.at:46"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:46: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:46"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_6
+#AT_START_7
+at_fn_group_banner 7 'types.at:49' \
+  "Matrix (even more) (matrix_t): " "                " 2
+at_xfail=no
+(
+  $as_echo "7. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:51: \$CC \${abs_top_srcdir}/examples/simple/matrix3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:51"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/matrix3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:51: >expout"
+at_fn_check_prepare_trace "types.at:51"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:51: "
+at_fn_check_prepare_trace "types.at:51"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:51: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:51"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_7
+#AT_START_8
+at_fn_group_banner 8 'types.at:54' \
+  "Double ended queue (dqueue_t): " "                " 2
+at_xfail=no
+(
+  $as_echo "8. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:56: \$CC \${abs_top_srcdir}/examples/simple/dqueue.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:56"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/dqueue.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:56: cp \${abs_top_srcdir}/examples/'simple/dqueue.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:56"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/dqueue.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:56: "
+at_fn_check_prepare_trace "types.at:56"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:56: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:56"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_8
+#AT_START_9
+at_fn_group_banner 9 'types.at:59' \
+  "Vector of pointers (vector_ptr_t): " "            " 2
+at_xfail=no
+(
+  $as_echo "9. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:61: \$CC \${abs_top_srcdir}/examples/simple/vector_ptr.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:61"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/vector_ptr.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:61: >expout"
+at_fn_check_prepare_trace "types.at:61"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:61: "
+at_fn_check_prepare_trace "types.at:61"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:61: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:61"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_9
+#AT_START_10
+at_fn_group_banner 10 'types.at:64' \
+  "Stack (stack_t): " "                              " 2
+at_xfail=no
+(
+  $as_echo "10. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:66: \$CC \${abs_top_srcdir}/examples/simple/stack.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:66"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/stack.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:66: >expout"
+at_fn_check_prepare_trace "types.at:66"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:66: "
+at_fn_check_prepare_trace "types.at:66"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:66: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:66"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_10
+#AT_START_11
+at_fn_group_banner 11 'types.at:69' \
+  "Heap (heap_t): " "                                " 2
+at_xfail=no
+(
+  $as_echo "11. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:71: \$CC \${abs_top_srcdir}/examples/simple/heap.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:71"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/heap.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:71: >expout"
+at_fn_check_prepare_trace "types.at:71"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:71: "
+at_fn_check_prepare_trace "types.at:71"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:71: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:71"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_11
+#AT_START_12
+at_fn_group_banner 12 'types.at:74' \
+  "Indexed heap (indheap_t): " "                     " 2
+at_xfail=no
+(
+  $as_echo "12. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:76: \$CC \${abs_top_srcdir}/examples/simple/indheap.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:76"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/indheap.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:76: >expout"
+at_fn_check_prepare_trace "types.at:76"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:76: "
+at_fn_check_prepare_trace "types.at:76"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:76: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:76"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_12
+#AT_START_13
+at_fn_group_banner 13 'types.at:79' \
+  "Doubly indexed heap (d_indheap_t): " "            " 2
+at_xfail=no
+(
+  $as_echo "13. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:81: \$CC \${abs_top_srcdir}/examples/simple/d_indheap.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:81"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/d_indheap.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:81: cp \${abs_top_srcdir}/examples/'simple/d_indheap.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:81"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/d_indheap.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:81: "
+at_fn_check_prepare_trace "types.at:81"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:81: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:81"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_13
+#AT_START_14
+at_fn_group_banner 14 'types.at:84' \
+  "String vector (igraph_strvector_t): " "           " 2
+at_xfail=no
+(
+  $as_echo "14. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:86: \$CC \${abs_top_srcdir}/examples/simple/igraph_strvector.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:86"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_strvector.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:86: cp \${abs_top_srcdir}/examples/'simple/igraph_strvector.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:86"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_strvector.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:86: "
+at_fn_check_prepare_trace "types.at:86"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:86: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:86"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_14
+#AT_START_15
+at_fn_group_banner 15 'types.at:89' \
+  "Trie (igraph_trie_t): " "                         " 2
+at_xfail=no
+(
+  $as_echo "15. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:91: \$CC \${abs_top_srcdir}/examples/simple/igraph_trie.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:91"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_trie.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:91: cp \${abs_top_srcdir}/examples/'simple/igraph_trie.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:91"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_trie.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:91: "
+at_fn_check_prepare_trace "types.at:91"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:91: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:91"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_15
+#AT_START_16
+at_fn_group_banner 16 'types.at:95' \
+  "Partial Sum-Tree (igraph_psumtree_t): " "         " 2
+at_xfail=no
+(
+  $as_echo "16. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:97: \$CC \${abs_top_srcdir}/examples/simple/igraph_psumtree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:97"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_psumtree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:97"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:97: >expout"
+at_fn_check_prepare_trace "types.at:97"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:97"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:97: "
+at_fn_check_prepare_trace "types.at:97"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:97"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:97: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:97"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:97"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_16
+#AT_START_17
+at_fn_group_banner 17 'types.at:100' \
+  "Three dimensional array (igraph_array3_t): " "    " 2
+at_xfail=no
+(
+  $as_echo "17. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:102: \$CC \${abs_top_srcdir}/examples/simple/igraph_array.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:102"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_array.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:102"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:102: cp \${abs_top_srcdir}/examples/'simple/igraph_array.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:102"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_array.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:102"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:102: "
+at_fn_check_prepare_trace "types.at:102"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:102"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:102: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:102"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:102"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_17
+#AT_START_18
+at_fn_group_banner 18 'types.at:105' \
+  "Hash table (string->string) (igraph_hashtable_t): " "" 2
+at_xfail=no
+(
+  $as_echo "18. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:107: \$CC \${abs_top_srcdir}/examples/simple/igraph_hashtable.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:107"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_hashtable.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:107"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:107: cp \${abs_top_srcdir}/examples/'simple/igraph_hashtable.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:107"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_hashtable.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:107"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:107: "
+at_fn_check_prepare_trace "types.at:107"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:107"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:107: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:107"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:107"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_18
+#AT_START_19
+at_fn_group_banner 19 'types.at:111' \
+  "Special heap for minimum cuts (igraph_i_cutheap_t): " "" 2
+at_xfail=no
+(
+  $as_echo "19. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:113: \$CC \${abs_top_srcdir}/examples/simple/igraph_i_cutheap.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:113"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_i_cutheap.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:113"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:113: cp \${abs_top_srcdir}/examples/'simple/igraph_i_cutheap.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:113"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_i_cutheap.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:113"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:113: "
+at_fn_check_prepare_trace "types.at:113"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:113"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:113: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:113"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:113"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_19
+#AT_START_20
+at_fn_group_banner 20 'types.at:117' \
+  "Set (igraph_set_t): " "                           " 2
+at_xfail=no
+(
+  $as_echo "20. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:119: \$CC \${abs_top_srcdir}/examples/simple/igraph_set.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:119"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_set.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:119"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:119: cp \${abs_top_srcdir}/examples/'simple/igraph_set.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:119"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_set.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:119"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:119: "
+at_fn_check_prepare_trace "types.at:119"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:119"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:119: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:119"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:119"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_20
+#AT_START_21
+at_fn_group_banner 21 'types.at:123' \
+  "2-way heap (igraph_2wheap_t): " "                 " 2
+at_xfail=no
+(
+  $as_echo "21. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:125: \$CC \${abs_top_srcdir}/examples/simple/2wheap.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:125"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/2wheap.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:125"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:125: >expout"
+at_fn_check_prepare_trace "types.at:125"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:125"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:125: "
+at_fn_check_prepare_trace "types.at:125"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:125"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:125: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:125"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:125"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_21
+#AT_START_22
+at_fn_group_banner 22 'types.at:128' \
+  "Sparse matrix (igraph_sparsemat_t): " "           " 2
+at_xfail=no
+(
+  $as_echo "22. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:130: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:130"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:130"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:130: cp \${abs_top_srcdir}/examples/'simple/igraph_sparsemat.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:130"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_sparsemat.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:130"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:130: "
+at_fn_check_prepare_trace "types.at:130"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:130"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:130: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:130"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:130"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_22
+#AT_START_23
+at_fn_group_banner 23 'types.at:133' \
+  "Sparse matrix, multiplications (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "23. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:135: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat2.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm -lblas -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:135"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat2.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm -lblas -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:135"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:135: cp \${abs_top_srcdir}/examples/'simple/igraph_sparsemat2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:135"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_sparsemat2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:135"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:135: "
+at_fn_check_prepare_trace "types.at:135"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:135"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:135: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:135"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:135"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_23
+#AT_START_24
+at_fn_group_banner 24 'types.at:139' \
+  "Sparse matrix, indexing (igraph_sparsemat_t): " " " 2
+at_xfail=no
+(
+  $as_echo "24. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:141: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat3.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:141"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat3.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:141"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:141: cp \${abs_top_srcdir}/examples/'simple/igraph_sparsemat3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:141"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_sparsemat3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:141"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:141: "
+at_fn_check_prepare_trace "types.at:141"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:141"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:141: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:141"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:141"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_24
+#AT_START_25
+at_fn_group_banner 25 'types.at:145' \
+  "Sparse matrix, solvers (igraph_sparsemat_t): " "  " 2
+at_xfail=no
+(
+  $as_echo "25. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:147: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat4.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:147"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat4.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:147: cp \${abs_top_srcdir}/examples/'simple/igraph_sparsemat4.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:147"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_sparsemat4.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:147: "
+at_fn_check_prepare_trace "types.at:147"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:147: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:147"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_25
+#AT_START_26
+at_fn_group_banner 26 'types.at:151' \
+  "Sparse matrix, ARPACK eigensolver (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "26. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:153: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat5.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:153"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat5.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:153"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:153: cp \${abs_top_srcdir}/examples/'simple/igraph_sparsemat5.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:153"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_sparsemat5.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:153"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:153: "
+at_fn_check_prepare_trace "types.at:153"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:153"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:153: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:153"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:153"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_26
+#AT_START_27
+at_fn_group_banner 27 'types.at:156' \
+  "Sparse matrix, conversion to dense (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "27. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:158: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat6.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:158"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat6.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:158"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:158: >expout"
+at_fn_check_prepare_trace "types.at:158"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:158"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:158: "
+at_fn_check_prepare_trace "types.at:158"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:158"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:158: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:158"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:158"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_27
+#AT_START_28
+at_fn_group_banner 28 'types.at:161' \
+  "Sparse matrix, min & max (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "28. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:163: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat7.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:163"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat7.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:163"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:163: >expout"
+at_fn_check_prepare_trace "types.at:163"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:163"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:163: "
+at_fn_check_prepare_trace "types.at:163"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:163"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:163: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:163"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:163"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_28
+#AT_START_29
+at_fn_group_banner 29 'types.at:166' \
+  "Sparse matrix, other operations (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "29. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:168: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat8.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:168"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat8.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:168"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:168: >expout"
+at_fn_check_prepare_trace "types.at:168"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:168"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:168: "
+at_fn_check_prepare_trace "types.at:168"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:168"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:168: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:168"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:168"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_29
+#AT_START_30
+at_fn_group_banner 30 'types.at:171' \
+  "Sparse matrix, multiplications with dense (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "30. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:173: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat9.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:173"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat9.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:173"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:173: >expout"
+at_fn_check_prepare_trace "types.at:173"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:173"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:173: "
+at_fn_check_prepare_trace "types.at:173"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:173"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:173: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:173"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:173"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_30
+#AT_START_31
+at_fn_group_banner 31 'types.at:176' \
+  "Sparse matrix, is symmetric? (igraph_sparsemat_t): " "" 2
+at_xfail=no
+(
+  $as_echo "31. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:178: \$CC \${abs_top_srcdir}/examples/simple/igraph_sparsemat_is_symmetric.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:178"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_sparsemat_is_symmetric.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:178"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:178: >expout"
+at_fn_check_prepare_trace "types.at:178"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:178"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:178: "
+at_fn_check_prepare_trace "types.at:178"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:178"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:178: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:178"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:178"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_31
+#AT_START_32
+at_fn_group_banner 32 'types.at:181' \
+  "Another sparse matrix (igraph_spmatrix_t): " "    " 2
+at_xfail=no
+(
+  $as_echo "32. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:183: \$CC \${abs_top_srcdir}/examples/simple/spmatrix.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:183"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/spmatrix.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:183: cp \${abs_top_srcdir}/examples/'simple/spmatrix.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:183"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/spmatrix.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:183: "
+at_fn_check_prepare_trace "types.at:183"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:183: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:183"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_32
+#AT_START_33
+at_fn_group_banner 33 'types.at:186' \
+  "Arbitrarily big integers (igraph_biguint_t): " "  " 2
+at_xfail=no
+(
+  $as_echo "33. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:188: \$CC \${abs_top_srcdir}/examples/simple/biguint.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:188"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/biguint.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:188: cp \${abs_top_srcdir}/examples/'simple/biguint.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:188"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/biguint.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:188: "
+at_fn_check_prepare_trace "types.at:188"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:188: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:188"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_33
+#AT_START_34
+at_fn_group_banner 34 'types.at:191' \
+  "Marked double ended queue (igraph_marked_queue_t): " "" 2
+at_xfail=no
+(
+  $as_echo "34. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:193: \$CC \${abs_top_srcdir}/examples/simple/igraph_marked_queue.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:193"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_marked_queue.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:193"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:193: >expout"
+at_fn_check_prepare_trace "types.at:193"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:193"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:193: "
+at_fn_check_prepare_trace "types.at:193"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:193"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:193: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:193"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:193"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_34
+#AT_START_35
+at_fn_group_banner 35 'types.at:196' \
+  "Complex numbers (igraph_complex_t): " "           " 2
+at_xfail=no
+(
+  $as_echo "35. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/types.at:198: \$CC \${abs_top_srcdir}/examples/simple/igraph_complex.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:198"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_complex.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:198"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:198: >expout"
+at_fn_check_prepare_trace "types.at:198"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:198"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:198: "
+at_fn_check_prepare_trace "types.at:198"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:198"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/types.at:198: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "types.at:198"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/types.at:198"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_35
+#AT_START_36
+at_fn_group_banner 36 'basic.at:26' \
+  "Creating an empty graph (igraph_empty): " "       " 3
+at_xfail=no
+(
+  $as_echo "36. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:28: \$CC \${abs_top_srcdir}/examples/simple/igraph_empty.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:28"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_empty.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:28: >expout"
+at_fn_check_prepare_trace "basic.at:28"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:28: "
+at_fn_check_prepare_trace "basic.at:28"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:28: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:28"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_36
+#AT_START_37
+at_fn_group_banner 37 'basic.at:31' \
+  "Copying a graph (igraph_copy): " "                " 3
+at_xfail=no
+(
+  $as_echo "37. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:33: \$CC \${abs_top_srcdir}/examples/simple/igraph_copy.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:33"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_copy.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:33: >expout"
+at_fn_check_prepare_trace "basic.at:33"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:33: "
+at_fn_check_prepare_trace "basic.at:33"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:33: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:33"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_37
+#AT_START_38
+at_fn_group_banner 38 'basic.at:36' \
+  "Adding edges to a graph (igraph_add_edges): " "   " 3
+at_xfail=no
+(
+  $as_echo "38. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:38: \$CC \${abs_top_srcdir}/examples/simple/igraph_add_edges.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:38"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_add_edges.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:38: cp \${abs_top_srcdir}/examples/'simple/igraph_add_edges.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:38"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_add_edges.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:38: "
+at_fn_check_prepare_trace "basic.at:38"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:38: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:38"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_38
+#AT_START_39
+at_fn_group_banner 39 'basic.at:42' \
+  "Adding vertices (igraph_add_vertices): " "        " 3
+at_xfail=no
+(
+  $as_echo "39. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:44: \$CC \${abs_top_srcdir}/examples/simple/igraph_add_vertices.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:44"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_add_vertices.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:44: >expout"
+at_fn_check_prepare_trace "basic.at:44"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:44: "
+at_fn_check_prepare_trace "basic.at:44"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:44: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:44"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_39
+#AT_START_40
+at_fn_group_banner 40 'basic.at:47' \
+  "Deleting edges (igraph_delete_edges): " "         " 3
+at_xfail=no
+(
+  $as_echo "40. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:49: \$CC \${abs_top_srcdir}/examples/simple/igraph_delete_edges.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:49"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_delete_edges.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:49"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:49: >expout"
+at_fn_check_prepare_trace "basic.at:49"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:49"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:49: "
+at_fn_check_prepare_trace "basic.at:49"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:49"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:49: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:49"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:49"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_40
+#AT_START_41
+at_fn_group_banner 41 'basic.at:52' \
+  "Deleting vertices (igraph_delete_vertices): " "   " 3
+at_xfail=no
+(
+  $as_echo "41. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:54: \$CC \${abs_top_srcdir}/examples/simple/igraph_delete_vertices.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:54"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_delete_vertices.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:54: >expout"
+at_fn_check_prepare_trace "basic.at:54"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:54: "
+at_fn_check_prepare_trace "basic.at:54"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:54: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:54"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_41
+#AT_START_42
+at_fn_group_banner 42 'basic.at:57' \
+  "Neighbors (igraph_neighbors): " "                 " 3
+at_xfail=no
+(
+  $as_echo "42. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:59: \$CC \${abs_top_srcdir}/examples/simple/igraph_neighbors.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:59"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_neighbors.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:59: cp \${abs_top_srcdir}/examples/'simple/igraph_neighbors.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:59"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_neighbors.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:59: "
+at_fn_check_prepare_trace "basic.at:59"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:59: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:59"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_42
+#AT_START_43
+at_fn_group_banner 43 'basic.at:62' \
+  "Is the graph directed? (igraph_is_directed): " "  " 3
+at_xfail=no
+(
+  $as_echo "43. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:64: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_directed.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:64"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_directed.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:64"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:64: >expout"
+at_fn_check_prepare_trace "basic.at:64"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:64"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:64: "
+at_fn_check_prepare_trace "basic.at:64"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:64"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:64: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:64"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:64"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_43
+#AT_START_44
+at_fn_group_banner 44 'basic.at:67' \
+  "Degree of the vertices (igraph_degree): " "       " 3
+at_xfail=no
+(
+  $as_echo "44. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:69: \$CC \${abs_top_srcdir}/examples/simple/igraph_degree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:69"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_degree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:69"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:69: cp \${abs_top_srcdir}/examples/'simple/igraph_degree.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:69"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_degree.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:69"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:69: "
+at_fn_check_prepare_trace "basic.at:69"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:69"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:69: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:69"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:69"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_44
+#AT_START_45
+at_fn_group_banner 45 'basic.at:72' \
+  "Query edge ids (igraph_get_eid): " "              " 3
+at_xfail=no
+(
+  $as_echo "45. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:74: \$CC \${abs_top_srcdir}/examples/simple/igraph_get_eid.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:74"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_get_eid.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:74"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:74: cp \${abs_top_srcdir}/examples/'simple/igraph_get_eid.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:74"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_get_eid.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:74"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:74: "
+at_fn_check_prepare_trace "basic.at:74"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:74"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:74: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:74"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:74"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_45
+#AT_START_46
+at_fn_group_banner 46 'basic.at:77' \
+  "Query many edge ids (igraph_get_eids): " "        " 3
+at_xfail=no
+(
+  $as_echo "46. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:79: \$CC \${abs_top_srcdir}/examples/simple/igraph_get_eids.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:79"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_get_eids.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:79: cp \${abs_top_srcdir}/examples/'simple/igraph_get_eids.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:79"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_get_eids.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:79: "
+at_fn_check_prepare_trace "basic.at:79"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/basic.at:79: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "basic.at:79"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/basic.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_46
+#AT_START_47
+at_fn_group_banner 47 'iterators.at:24' \
+  "Vertices in a vector (igraph_vs_vector): " "      " 4
+at_xfail=no
+(
+  $as_echo "47. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_vs_vector.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_vs_vector.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_vs_vector.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_vs_vector.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:26: "
+at_fn_check_prepare_trace "iterators.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_47
+#AT_START_48
+at_fn_group_banner 48 'iterators.at:29' \
+  "Non-adjacent vertices (igraph_vs_nonadj): " "     " 4
+at_xfail=no
+(
+  $as_echo "48. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_vs_nonadj.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_vs_nonadj.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_vs_nonadj.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_vs_nonadj.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:31: "
+at_fn_check_prepare_trace "iterators.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_48
+#AT_START_49
+at_fn_group_banner 49 'iterators.at:34' \
+  "Sequence (igraph_vs_seq): " "                     " 4
+at_xfail=no
+(
+  $as_echo "49. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_vs_seq.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_vs_seq.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:36: cp \${abs_top_srcdir}/examples/'simple/igraph_vs_seq.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_vs_seq.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:36: "
+at_fn_check_prepare_trace "iterators.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_49
+#AT_START_50
+at_fn_group_banner 50 'iterators.at:49' \
+  "Edges given by end points (igraph_es_pairs): " "  " 4
+at_xfail=no
+(
+  $as_echo "50. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:51: \$CC \${abs_top_srcdir}/examples/simple/igraph_es_pairs.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:51"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_es_pairs.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:51: >expout"
+at_fn_check_prepare_trace "iterators.at:51"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:51: "
+at_fn_check_prepare_trace "iterators.at:51"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:51: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:51"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_50
+#AT_START_51
+at_fn_group_banner 51 'iterators.at:54' \
+  "Edges in a path (igraph_es_path): " "             " 4
+at_xfail=no
+(
+  $as_echo "51. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:56: \$CC \${abs_top_srcdir}/examples/simple/igraph_es_path.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:56"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_es_path.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:56: >expout"
+at_fn_check_prepare_trace "iterators.at:56"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:56: "
+at_fn_check_prepare_trace "iterators.at:56"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/iterators.at:56: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "iterators.at:56"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/iterators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_51
+#AT_START_52
+at_fn_group_banner 52 'structure_generators.at:24' \
+  "Simple graph creation (igraph_create): " "        " 5
+at_xfail=no
+(
+  $as_echo "52. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_create.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_create.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:26: >expout"
+at_fn_check_prepare_trace "structure_generators.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:26: "
+at_fn_check_prepare_trace "structure_generators.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_52
+#AT_START_53
+at_fn_group_banner 53 'structure_generators.at:29' \
+  "Barabasi-Albert model (igraph_barabasi_game):" "  " 5
+at_xfail=no
+(
+  $as_echo "53. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_barabasi_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_barabasi_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:31: >expout"
+at_fn_check_prepare_trace "structure_generators.at:31"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:31: "
+at_fn_check_prepare_trace "structure_generators.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_53
+#AT_START_54
+at_fn_group_banner 54 'structure_generators.at:34' \
+  "More Barabasi-Albert model (igraph_barabasi_game):" "" 5
+at_xfail=no
+(
+  $as_echo "54. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_barabasi_game2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_barabasi_game2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:36: >expout"
+at_fn_check_prepare_trace "structure_generators.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:36: "
+at_fn_check_prepare_trace "structure_generators.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_54
+#AT_START_55
+at_fn_group_banner 55 'structure_generators.at:39' \
+  "Erdos-Renyi model (igraph_erdos_renyi_game):" "   " 5
+at_xfail=no
+(
+  $as_echo "55. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:41: \$CC \${abs_top_srcdir}/examples/simple/igraph_erdos_renyi_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_erdos_renyi_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:41: >expout"
+at_fn_check_prepare_trace "structure_generators.at:41"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:41: "
+at_fn_check_prepare_trace "structure_generators.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_55
+#AT_START_56
+at_fn_group_banner 56 'structure_generators.at:44' \
+  "Degree sequence (igraph_degree_sequence_game):" " " 5
+at_xfail=no
+(
+  $as_echo "56. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:46: \$CC \${abs_top_srcdir}/examples/simple/igraph_degree_sequence_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:46"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_degree_sequence_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:46: cp \${abs_top_srcdir}/examples/'simple/igraph_degree_sequence_game.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:46"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_degree_sequence_game.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:46: "
+at_fn_check_prepare_trace "structure_generators.at:46"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:46: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:46"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_56
+#AT_START_57
+at_fn_group_banner 57 'structure_generators.at:49' \
+  "k-regular graphs (igraph_k_regular_game):" "      " 5
+at_xfail=no
+(
+  $as_echo "57. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:51: \$CC \${abs_top_srcdir}/examples/simple/igraph_k_regular_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:51"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_k_regular_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:51: cp \${abs_top_srcdir}/examples/'simple/igraph_k_regular_game.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:51"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_k_regular_game.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:51: "
+at_fn_check_prepare_trace "structure_generators.at:51"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:51: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:51"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_57
+#AT_START_58
+at_fn_group_banner 58 'structure_generators.at:54' \
+  "Growing random (igraph_growing_random_game):" "   " 5
+at_xfail=no
+(
+  $as_echo "58. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:56: \$CC \${abs_top_srcdir}/examples/simple/igraph_growing_random_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:56"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_growing_random_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:56: >expout"
+at_fn_check_prepare_trace "structure_generators.at:56"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:56: "
+at_fn_check_prepare_trace "structure_generators.at:56"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:56: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:56"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_58
+#AT_START_59
+at_fn_group_banner 59 'structure_generators.at:59' \
+  "Preference model (igraph_preference_game):" "     " 5
+at_xfail=no
+(
+  $as_echo "59. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:61: \$CC \${abs_top_srcdir}/examples/simple/igraph_preference_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:61"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_preference_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:61: >expout"
+at_fn_check_prepare_trace "structure_generators.at:61"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:61: "
+at_fn_check_prepare_trace "structure_generators.at:61"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:61: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:61"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_59
+#AT_START_60
+at_fn_group_banner 60 'structure_generators.at:64' \
+  "From adjacency matrix (igraph_adjacency):" "      " 5
+at_xfail=no
+(
+  $as_echo "60. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:66: \$CC \${abs_top_srcdir}/examples/simple/igraph_adjacency.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:66"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_adjacency.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:66: >expout"
+at_fn_check_prepare_trace "structure_generators.at:66"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:66: "
+at_fn_check_prepare_trace "structure_generators.at:66"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:66: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:66"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_60
+#AT_START_61
+at_fn_group_banner 61 'structure_generators.at:69' \
+  "From weighted adjacency matrix (igraph_weighted_adjacency):" "" 5
+at_xfail=no
+(
+  $as_echo "61. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:71: \$CC \${abs_top_srcdir}/examples/simple/igraph_weighted_adjacency.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:71"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_weighted_adjacency.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:71: cp \${abs_top_srcdir}/examples/'simple/igraph_weighted_adjacency.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:71"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_weighted_adjacency.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:71: "
+at_fn_check_prepare_trace "structure_generators.at:71"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:71: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:71"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:71"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_61
+#AT_START_62
+at_fn_group_banner 62 'structure_generators.at:74' \
+  "Star graph (igraph_star):" "                      " 5
+at_xfail=no
+(
+  $as_echo "62. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:76: \$CC \${abs_top_srcdir}/examples/simple/igraph_star.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:76"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_star.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:76: >expout"
+at_fn_check_prepare_trace "structure_generators.at:76"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:76: "
+at_fn_check_prepare_trace "structure_generators.at:76"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:76: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:76"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:76"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_62
+#AT_START_63
+at_fn_group_banner 63 'structure_generators.at:79' \
+  "Lattice graph (igraph_lattice):" "                " 5
+at_xfail=no
+(
+  $as_echo "63. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:81: \$CC \${abs_top_srcdir}/examples/simple/igraph_lattice.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:81"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lattice.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:81: >expout"
+at_fn_check_prepare_trace "structure_generators.at:81"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:81: "
+at_fn_check_prepare_trace "structure_generators.at:81"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:81: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:81"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:81"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_63
+#AT_START_64
+at_fn_group_banner 64 'structure_generators.at:84' \
+  "Ring graph (igraph_ring):" "                      " 5
+at_xfail=no
+(
+  $as_echo "64. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:86: \$CC \${abs_top_srcdir}/examples/simple/igraph_ring.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:86"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_ring.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:86: >expout"
+at_fn_check_prepare_trace "structure_generators.at:86"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:86: "
+at_fn_check_prepare_trace "structure_generators.at:86"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:86: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:86"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:86"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_64
+#AT_START_65
+at_fn_group_banner 65 'structure_generators.at:89' \
+  "Tree graph (igraph_tree):" "                      " 5
+at_xfail=no
+(
+  $as_echo "65. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:91: \$CC \${abs_top_srcdir}/examples/simple/igraph_tree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:91"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_tree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:91: >expout"
+at_fn_check_prepare_trace "structure_generators.at:91"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:91: "
+at_fn_check_prepare_trace "structure_generators.at:91"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:91: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:91"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:91"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_65
+#AT_START_66
+at_fn_group_banner 66 'structure_generators.at:94' \
+  "Full graph (igraph_full):" "                      " 5
+at_xfail=no
+(
+  $as_echo "66. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:96: \$CC \${abs_top_srcdir}/examples/simple/igraph_full.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:96"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_full.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:96: >expout"
+at_fn_check_prepare_trace "structure_generators.at:96"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:96: "
+at_fn_check_prepare_trace "structure_generators.at:96"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:96: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:96"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_66
+#AT_START_67
+at_fn_group_banner 67 'structure_generators.at:99' \
+  "Graph atlas (igraph_atlas):" "                    " 5
+at_xfail=no
+(
+  $as_echo "67. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:101: \$CC \${abs_top_srcdir}/examples/simple/igraph_atlas.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:101"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_atlas.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:101: cp \${abs_top_srcdir}/examples/'simple/igraph_atlas.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:101"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_atlas.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:101: "
+at_fn_check_prepare_trace "structure_generators.at:101"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:101: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:101"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_67
+#AT_START_68
+at_fn_group_banner 68 'structure_generators.at:104' \
+  "Small graph (igraph_small):" "                    " 5
+at_xfail=no
+(
+  $as_echo "68. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:106: \$CC \${abs_top_srcdir}/examples/simple/igraph_small.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:106"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_small.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:106: cp \${abs_top_srcdir}/examples/'simple/igraph_small.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:106"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_small.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:106: "
+at_fn_check_prepare_trace "structure_generators.at:106"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:106: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:106"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_68
+#AT_START_69
+at_fn_group_banner 69 'structure_generators.at:109' \
+  "Geomeric random graphs (igraph_grg_game):" "      " 5
+at_xfail=no
+(
+  $as_echo "69. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:111: \$CC \${abs_top_srcdir}/examples/simple/igraph_grg_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:111"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_grg_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:111: >expout"
+at_fn_check_prepare_trace "structure_generators.at:111"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:111: "
+at_fn_check_prepare_trace "structure_generators.at:111"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:111: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:111"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_69
+#AT_START_70
+at_fn_group_banner 70 'structure_generators.at:114' \
+  "Graphs in LCF notation (igraph_lcf{,_vector}):" " " 5
+at_xfail=no
+(
+  $as_echo "70. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:116: \$CC \${abs_top_srcdir}/examples/simple/igraph_lcf.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:116"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lcf.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:116: >expout"
+at_fn_check_prepare_trace "structure_generators.at:116"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:116: "
+at_fn_check_prepare_trace "structure_generators.at:116"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:116: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:116"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_70
+#AT_START_71
+at_fn_group_banner 71 'structure_generators.at:119' \
+  "Watts-Strogatz graphs (igraph_watts_strogatz_game):" "" 5
+at_xfail=no
+(
+  $as_echo "71. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:121: \$CC \${abs_top_srcdir}/examples/simple/watts_strogatz_game.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:121"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/watts_strogatz_game.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:121"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:121: >expout"
+at_fn_check_prepare_trace "structure_generators.at:121"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:121"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:121: "
+at_fn_check_prepare_trace "structure_generators.at:121"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:121"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structure_generators.at:121: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structure_generators.at:121"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structure_generators.at:121"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_71
+#AT_START_72
+at_fn_group_banner 72 'structural_properties.at:24' \
+  "Two vertices connected by an edge:" "             " 6
+at_xfail=no
+(
+  $as_echo "72. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_are_connected.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_are_connected.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:26: >expout"
+at_fn_check_prepare_trace "structural_properties.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:26: "
+at_fn_check_prepare_trace "structural_properties.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_72
+#AT_START_73
+at_fn_group_banner 73 'structural_properties.at:29' \
+  "Diameter of a graph (igraph_diameter):" "         " 6
+at_xfail=no
+(
+  $as_echo "73. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_diameter.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_diameter.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_diameter.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_diameter.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:31: "
+at_fn_check_prepare_trace "structural_properties.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_73
+#AT_START_74
+at_fn_group_banner 74 'structural_properties.at:34' \
+  "Average geodesic length (igraph_average_path_length): " "" 6
+at_xfail=no
+(
+  $as_echo "74. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_average_path_length.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_average_path_length.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:36: >expout"
+at_fn_check_prepare_trace "structural_properties.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:36: "
+at_fn_check_prepare_trace "structural_properties.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_74
+#AT_START_75
+at_fn_group_banner 75 'structural_properties.at:39' \
+  "Google PageRank (igraph_pagerank): " "            " 6
+at_xfail=no
+(
+  $as_echo "75. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:41: \$CC \${abs_top_srcdir}/examples/simple/igraph_pagerank.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_pagerank.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:41: cp \${abs_top_srcdir}/examples/'simple/igraph_pagerank.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:41"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_pagerank.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:41: "
+at_fn_check_prepare_trace "structural_properties.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_75
+#AT_START_76
+at_fn_group_banner 76 'structural_properties.at:44' \
+  "Random rewiring (igraph_rewire): " "              " 6
+at_xfail=no
+(
+  $as_echo "76. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:46: \$CC \${abs_top_srcdir}/examples/simple/igraph_rewire.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:46"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_rewire.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:46: cp \${abs_top_srcdir}/examples/'simple/igraph_rewire.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:46"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_rewire.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:46: "
+at_fn_check_prepare_trace "structural_properties.at:46"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:46: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:46"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_76
+#AT_START_77
+at_fn_group_banner 77 'structural_properties.at:49' \
+  "Get the shortest paths (igraph_get_shortest_paths): " "" 6
+at_xfail=no
+(
+  $as_echo "77. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:51: \$CC \${abs_top_srcdir}/examples/simple/igraph_get_shortest_paths.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:51"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_get_shortest_paths.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:51: cp \${abs_top_srcdir}/examples/'simple/igraph_get_shortest_paths.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:51"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_get_shortest_paths.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:51: "
+at_fn_check_prepare_trace "structural_properties.at:51"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:51: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:51"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_77
+#AT_START_78
+at_fn_group_banner 78 'structural_properties.at:55' \
+  "Weighted shortest paths (Dijkstra): " "           " 6
+at_xfail=no
+(
+  $as_echo "78. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:57: \$CC \${abs_top_srcdir}/examples/simple/dijkstra.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:57"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/dijkstra.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:57: cp \${abs_top_srcdir}/examples/'simple/dijkstra.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:57"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/dijkstra.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:57: "
+at_fn_check_prepare_trace "structural_properties.at:57"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:57: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:57"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_78
+#AT_START_79
+at_fn_group_banner 79 'structural_properties.at:60' \
+  "Weighted shortest paths (Bellman-Ford): " "       " 6
+at_xfail=no
+(
+  $as_echo "79. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:62: \$CC \${abs_top_srcdir}/examples/simple/bellman_ford.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:62"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/bellman_ford.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:62: cp \${abs_top_srcdir}/examples/'simple/bellman_ford.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:62"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/bellman_ford.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:62: "
+at_fn_check_prepare_trace "structural_properties.at:62"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:62: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:62"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_79
+#AT_START_80
+at_fn_group_banner 80 'structural_properties.at:65' \
+  "Get the weighted shortest paths (Dijkstra): " "   " 6
+at_xfail=no
+(
+  $as_echo "80. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:67: \$CC \${abs_top_srcdir}/examples/simple/igraph_get_shortest_paths_dijkstra.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:67"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_get_shortest_paths_dijkstra.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:67"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:67: cp \${abs_top_srcdir}/examples/'simple/igraph_get_shortest_paths_dijkstra.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:67"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_get_shortest_paths_dijkstra.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:67"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:67: "
+at_fn_check_prepare_trace "structural_properties.at:67"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:67"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:67: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:67"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:67"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_80
+#AT_START_81
+at_fn_group_banner 81 'structural_properties.at:71' \
+  "Get all weighted shortest paths (Dijkstra): " "   " 6
+at_xfail=no
+(
+  $as_echo "81. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:73: \$CC \${abs_top_srcdir}/examples/simple/igraph_get_all_shortest_paths_dijkstra.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:73"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_get_all_shortest_paths_dijkstra.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:73: cp \${abs_top_srcdir}/examples/'simple/igraph_get_all_shortest_paths_dijkstra.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:73"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_get_all_shortest_paths_dijkstra.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:73: "
+at_fn_check_prepare_trace "structural_properties.at:73"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:73: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:73"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_81
+#AT_START_82
+at_fn_group_banner 82 'structural_properties.at:77' \
+  "Shortest path wrappers for single target node: " "" 6
+at_xfail=no
+(
+  $as_echo "82. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:79: \$CC \${abs_top_srcdir}/examples/simple/single_target_shortest_path.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:79"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/single_target_shortest_path.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:79: cp \${abs_top_srcdir}/examples/'simple/single_target_shortest_path.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:79"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/single_target_shortest_path.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:79: "
+at_fn_check_prepare_trace "structural_properties.at:79"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:79: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:79"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:79"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_82
+#AT_START_83
+at_fn_group_banner 83 'structural_properties.at:83' \
+  "Betweenness (igraph_betweenness): " "             " 6
+at_xfail=no
+(
+  $as_echo "83. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:85: \$CC \${abs_top_srcdir}/examples/simple/igraph_betweenness.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:85"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_betweenness.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:85"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:85: >expout"
+at_fn_check_prepare_trace "structural_properties.at:85"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:85"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:85: "
+at_fn_check_prepare_trace "structural_properties.at:85"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:85"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:85: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:85"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:85"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_83
+#AT_START_84
+at_fn_group_banner 84 'structural_properties.at:88' \
+  "Betweenness, big integers (igraph_betweenness): " "" 6
+at_xfail=no
+(
+  $as_echo "84. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:90: \$CC \${abs_top_srcdir}/examples/simple/biguint_betweenness.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:90"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/biguint_betweenness.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:90: >expout"
+at_fn_check_prepare_trace "structural_properties.at:90"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:90: "
+at_fn_check_prepare_trace "structural_properties.at:90"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:90: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:90"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_84
+#AT_START_85
+at_fn_group_banner 85 'structural_properties.at:93' \
+  "Edge betweenness (igraph_edge_betweenness): " "   " 6
+at_xfail=no
+(
+  $as_echo "85. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:95: \$CC \${abs_top_srcdir}/examples/simple/igraph_edge_betweenness.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:95"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_edge_betweenness.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:95"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:95: cp \${abs_top_srcdir}/examples/'simple/igraph_edge_betweenness.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:95"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_edge_betweenness.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:95"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:95: "
+at_fn_check_prepare_trace "structural_properties.at:95"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:95"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:95: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:95"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:95"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_85
+#AT_START_86
+at_fn_group_banner 86 'structural_properties.at:99' \
+  "Transitivity (igraph_transitivity): " "           " 6
+at_xfail=no
+(
+  $as_echo "86. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:101: \$CC \${abs_top_srcdir}/examples/simple/igraph_transitivity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:101"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_transitivity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:101: >expout"
+at_fn_check_prepare_trace "structural_properties.at:101"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:101: "
+at_fn_check_prepare_trace "structural_properties.at:101"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:101: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:101"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:101"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_86
+#AT_START_87
+at_fn_group_banner 87 'structural_properties.at:104' \
+  "Local transitivity (igraph_local_transitivity): " "" 6
+at_xfail=no
+(
+  $as_echo "87. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:106: \$CC \${abs_top_srcdir}/examples/simple/igraph_local_transitivity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:106"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_local_transitivity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:106: >expout"
+at_fn_check_prepare_trace "structural_properties.at:106"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:106: "
+at_fn_check_prepare_trace "structural_properties.at:106"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:106: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:106"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:106"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_87
+#AT_START_88
+at_fn_group_banner 88 'structural_properties.at:109' \
+  "Reciprocity (igraph_reciprocity): " "             " 6
+at_xfail=no
+(
+  $as_echo "88. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:111: \$CC \${abs_top_srcdir}/examples/simple/igraph_reciprocity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:111"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_reciprocity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:111: >expout"
+at_fn_check_prepare_trace "structural_properties.at:111"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:111: "
+at_fn_check_prepare_trace "structural_properties.at:111"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:111: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:111"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:111"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_88
+#AT_START_89
+at_fn_group_banner 89 'structural_properties.at:114' \
+  "Minimum spanning tree (igraph_minimum_spanning_tree_*): " "" 6
+at_xfail=no
+(
+  $as_echo "89. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:116: \$CC \${abs_top_srcdir}/examples/simple/igraph_minimum_spanning_tree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:116"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_minimum_spanning_tree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:116: cp \${abs_top_srcdir}/examples/'simple/igraph_minimum_spanning_tree.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:116"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_minimum_spanning_tree.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:116: "
+at_fn_check_prepare_trace "structural_properties.at:116"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:116: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:116"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:116"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_89
+#AT_START_90
+at_fn_group_banner 90 'structural_properties.at:120' \
+  "Cocitation and bibcoupling (igraph_cocitation,igraph_bibcoupling):" "" 6
+at_xfail=no
+(
+  $as_echo "90. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:122: \$CC \${abs_top_srcdir}/examples/simple/igraph_cocitation.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:122"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_cocitation.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:122"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:122: cp \${abs_top_srcdir}/examples/'simple/igraph_cocitation.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:122"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_cocitation.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:122"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:122: "
+at_fn_check_prepare_trace "structural_properties.at:122"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:122"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:122: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:122"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:122"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_90
+#AT_START_91
+at_fn_group_banner 91 'structural_properties.at:125' \
+  "Similarity coefficients (igraph_similarity_*):" " " 6
+at_xfail=no
+(
+  $as_echo "91. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:127: \$CC \${abs_top_srcdir}/examples/simple/igraph_similarity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:127"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_similarity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:127"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:127: cp \${abs_top_srcdir}/examples/'simple/igraph_similarity.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:127"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_similarity.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:127"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:127: "
+at_fn_check_prepare_trace "structural_properties.at:127"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:127"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:127: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:127"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:127"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_91
+#AT_START_92
+at_fn_group_banner 92 'structural_properties.at:130' \
+  "Simplification of non-simple graphs (igraph_simplify): " "" 6
+at_xfail=no
+(
+  $as_echo "92. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:132: \$CC \${abs_top_srcdir}/examples/simple/igraph_simplify.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:132"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_simplify.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:132"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:132: cp \${abs_top_srcdir}/examples/'simple/igraph_simplify.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:132"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_simplify.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:132"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:132: "
+at_fn_check_prepare_trace "structural_properties.at:132"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:132"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:132: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:132"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:132"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_92
+#AT_START_93
+at_fn_group_banner 93 'structural_properties.at:135' \
+  "Topological sorting (igraph_topological_sorting, igraph_is_dag): " "" 6
+at_xfail=no
+(
+  $as_echo "93. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:137: \$CC \${abs_top_srcdir}/examples/simple/igraph_topological_sorting.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:137"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_topological_sorting.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:137"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:137: cp \${abs_top_srcdir}/examples/'simple/igraph_topological_sorting.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:137"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_topological_sorting.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:137"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:137: "
+at_fn_check_prepare_trace "structural_properties.at:137"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:137"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:137: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:137"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:137"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_93
+#AT_START_94
+at_fn_group_banner 94 'structural_properties.at:140' \
+  "Feedback arc sets, Eades heuristics (igraph_feedback_arc_set): " "" 6
+at_xfail=no
+(
+  $as_echo "94. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:142: \$CC \${abs_top_srcdir}/examples/simple/igraph_feedback_arc_set.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:142"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_feedback_arc_set.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:142"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:142: cp \${abs_top_srcdir}/examples/'simple/igraph_feedback_arc_set.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:142"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_feedback_arc_set.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:142"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:142: "
+at_fn_check_prepare_trace "structural_properties.at:142"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:142"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:142: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:142"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:142"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_94
+#AT_START_95
+at_fn_group_banner 95 'structural_properties.at:145' \
+  "Feedback arc sets, integer programming (igraph_feedback_arc_set): " "" 6
+at_xfail=no
+(
+  $as_echo "95. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:147: \$CC \${abs_top_srcdir}/examples/simple/igraph_feedback_arc_set_ip.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:147"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_feedback_arc_set_ip.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:147: cp \${abs_top_srcdir}/examples/'simple/igraph_feedback_arc_set_ip.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:147"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_feedback_arc_set_ip.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:147: "
+at_fn_check_prepare_trace "structural_properties.at:147"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:147: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:147"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:147"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_95
+#AT_START_96
+at_fn_group_banner 96 'structural_properties.at:150' \
+  "Loop edges test (igraph_is_loop): " "             " 6
+at_xfail=no
+(
+  $as_echo "96. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:152: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_loop.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:152"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_loop.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:152"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:152: cp \${abs_top_srcdir}/examples/'simple/igraph_is_loop.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:152"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_is_loop.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:152"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:152: "
+at_fn_check_prepare_trace "structural_properties.at:152"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:152"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:152: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:152"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:152"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_96
+#AT_START_97
+at_fn_group_banner 97 'structural_properties.at:155' \
+  "Multiple edges test (igraph_is_multiple): " "     " 6
+at_xfail=no
+(
+  $as_echo "97. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:157: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_multiple.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:157"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_multiple.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:157"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:157: cp \${abs_top_srcdir}/examples/'simple/igraph_is_multiple.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:157"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_is_multiple.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:157"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:157: "
+at_fn_check_prepare_trace "structural_properties.at:157"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:157"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:157: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:157"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:157"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_97
+#AT_START_98
+at_fn_group_banner 98 'structural_properties.at:160' \
+  "Multiple edges test (igraph_has_multiple): " "    " 6
+at_xfail=no
+(
+  $as_echo "98. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:162: \$CC \${abs_top_srcdir}/examples/simple/igraph_has_multiple.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:162"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_has_multiple.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:162"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:162: >expout"
+at_fn_check_prepare_trace "structural_properties.at:162"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:162"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:162: "
+at_fn_check_prepare_trace "structural_properties.at:162"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:162"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:162: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:162"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:162"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_98
+#AT_START_99
+at_fn_group_banner 99 'structural_properties.at:165' \
+  "Girth (igraph_girth): " "                         " 6
+at_xfail=no
+(
+  $as_echo "99. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:167: \$CC \${abs_top_srcdir}/examples/simple/igraph_girth.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:167"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_girth.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:167"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:167: >expout"
+at_fn_check_prepare_trace "structural_properties.at:167"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:167"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:167: "
+at_fn_check_prepare_trace "structural_properties.at:167"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:167"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:167: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:167"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:167"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_99
+#AT_START_100
+at_fn_group_banner 100 'structural_properties.at:170' \
+  "Convergence degree (igraph_convergence_degree): " "" 6
+at_xfail=no
+(
+  $as_echo "100. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:172: \$CC \${abs_top_srcdir}/examples/simple/igraph_convergence_degree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:172"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_convergence_degree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:172"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:172: cp \${abs_top_srcdir}/examples/'simple/igraph_convergence_degree.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:172"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_convergence_degree.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:172"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:172: "
+at_fn_check_prepare_trace "structural_properties.at:172"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:172"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:172: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:172"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:172"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_100
+#AT_START_101
+at_fn_group_banner 101 'structural_properties.at:175' \
+  "Assortativity coefficient (igraph_assortativity): " "" 6
+at_xfail=no
+(
+  $as_echo "101. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:177: \$CC \${abs_top_srcdir}/examples/simple/assortativity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:177"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/assortativity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:177"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:177: cp \${abs_top_srcdir}/examples/'simple/assortativity.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:177"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/assortativity.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:177"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:177: cp \${abs_top_srcdir}/examples/simple/{karate,celegansneural}.gml ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:177"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/{karate,celegansneural}.gml .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:177"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:177: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:177"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:177"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_101
+#AT_START_102
+at_fn_group_banner 102 'structural_properties.at:181' \
+  "Average nearest neighbor degree (igraph_avg_nearest_neighbor_degree): " "" 6
+at_xfail=no
+(
+  $as_echo "102. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:183: \$CC \${abs_top_srcdir}/examples/simple/igraph_knn.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:183"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_knn.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:183: >expout"
+at_fn_check_prepare_trace "structural_properties.at:183"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:183: "
+at_fn_check_prepare_trace "structural_properties.at:183"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:183: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:183"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:183"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_102
+#AT_START_103
+at_fn_group_banner 103 'structural_properties.at:186' \
+  "Transitive closure of a DAG (igraph_transitive_closure_dag): " "" 6
+at_xfail=no
+(
+  $as_echo "103. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:188: \$CC \${abs_top_srcdir}/examples/simple/igraph_transitive_closure_dag.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:188"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_transitive_closure_dag.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:188: cp \${abs_top_srcdir}/examples/'simple/igraph_transitive_closure_dag.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:188"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_transitive_closure_dag.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:188: "
+at_fn_check_prepare_trace "structural_properties.at:188"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:188: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:188"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:188"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_103
+#AT_START_104
+at_fn_group_banner 104 'structural_properties.at:192' \
+  "Eccentricity (igraph_eccentricity): " "           " 6
+at_xfail=no
+(
+  $as_echo "104. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:194: \$CC \${abs_top_srcdir}/examples/simple/igraph_eccentricity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:194"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eccentricity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:194"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:194: cp \${abs_top_srcdir}/examples/'simple/igraph_eccentricity.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:194"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eccentricity.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:194"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:194: "
+at_fn_check_prepare_trace "structural_properties.at:194"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:194"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:194: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:194"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:194"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_104
+#AT_START_105
+at_fn_group_banner 105 'structural_properties.at:198' \
+  "Radius (igraph_radius): " "                       " 6
+at_xfail=no
+(
+  $as_echo "105. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:200: \$CC \${abs_top_srcdir}/examples/simple/igraph_radius.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:200"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_radius.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:200"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:200: >expout"
+at_fn_check_prepare_trace "structural_properties.at:200"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:200"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:200: "
+at_fn_check_prepare_trace "structural_properties.at:200"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:200"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/structural_properties.at:200: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "structural_properties.at:200"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/structural_properties.at:200"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_105
+#AT_START_106
+at_fn_group_banner 106 'components.at:24' \
+  "Decompose a graph (igraph_decompose):" "          " 7
+at_xfail=no
+(
+  $as_echo "106. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/components.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_decompose.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_decompose.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_decompose.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_decompose.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:26: "
+at_fn_check_prepare_trace "components.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_106
+#AT_START_107
+at_fn_group_banner 107 'components.at:29' \
+  "Biconnected components (igraph_biconnected_components):" "" 7
+at_xfail=no
+(
+  $as_echo "107. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/components.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_biconnected_components.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_biconnected_components.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_biconnected_components.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_biconnected_components.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:31: "
+at_fn_check_prepare_trace "components.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/components.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "components.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/components.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_107
+#AT_START_108
+at_fn_group_banner 108 'layout.at:24' \
+  "Grid layout (igraph_layout_grid, igraph_layout_grid_3d):" "" 8
+at_xfail=no
+(
+  $as_echo "108. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_grid.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_grid.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_layout_grid.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_layout_grid.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:26: "
+at_fn_check_prepare_trace "layout.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_108
+#AT_START_109
+at_fn_group_banner 109 'layout.at:29' \
+  "Large Graph Layout (igraph_layout_lgl):" "        " 8
+at_xfail=no
+(
+  $as_echo "109. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_lgl.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_lgl.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:31: >expout"
+at_fn_check_prepare_trace "layout.at:31"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:31: "
+at_fn_check_prepare_trace "layout.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_109
+#AT_START_110
+at_fn_group_banner 110 'layout.at:34' \
+  "Reingold-Tilford tree layout (igraph_layout_reingold_tilford):" "" 8
+at_xfail=no
+(
+  $as_echo "110. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_reingold_tilford.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_reingold_tilford.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:36: >expout"
+at_fn_check_prepare_trace "layout.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:36: cp \${abs_top_srcdir}/examples/simple/igraph_layout_reingold_tilford.in ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/igraph_layout_reingold_tilford.in .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_110
+#AT_START_111
+at_fn_group_banner 111 'layout.at:40' \
+  "Sugiyama layout (igraph_layout_sugiyama):" "      " 8
+at_xfail=no
+(
+  $as_echo "111. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:42: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_sugiyama.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:42"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_sugiyama.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:42: cp \${abs_top_srcdir}/examples/'simple/igraph_layout_sugiyama.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:42"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_layout_sugiyama.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:42: "
+at_fn_check_prepare_trace "layout.at:42"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:42: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:42"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_111
+#AT_START_112
+at_fn_group_banner 112 'layout.at:45' \
+  "Multidimensional scaling (igraph_layout_mds):" "  " 8
+at_xfail=no
+(
+  $as_echo "112. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:47: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_mds.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:47"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_mds.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:47: cp \${abs_top_srcdir}/examples/'simple/igraph_layout_mds.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:47"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_layout_mds.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:47: "
+at_fn_check_prepare_trace "layout.at:47"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:47: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:47"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_112
+#AT_START_113
+at_fn_group_banner 113 'layout.at:50' \
+  "Covering circle and sphere (igraph_i_layout_sphere_{2,3}d):" "" 8
+at_xfail=no
+(
+  $as_echo "113. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:52: \$CC \${abs_top_srcdir}/examples/simple/igraph_i_layout_sphere.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:52"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_i_layout_sphere.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:52: >expout"
+at_fn_check_prepare_trace "layout.at:52"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:52: "
+at_fn_check_prepare_trace "layout.at:52"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:52: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:52"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_113
+#AT_START_114
+at_fn_group_banner 114 'layout.at:55' \
+  "Merging layouts (igraph_i_layout_merge):" "       " 8
+at_xfail=no
+(
+  $as_echo "114. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:57: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_merge.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:57"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_merge.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:57: >expout"
+at_fn_check_prepare_trace "layout.at:57"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:57: "
+at_fn_check_prepare_trace "layout.at:57"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:57: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:57"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_114
+#AT_START_115
+at_fn_group_banner 115 'layout.at:60' \
+  "Merging layouts 2 (igraph_i_layout_merge):" "     " 8
+at_xfail=no
+(
+  $as_echo "115. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:62: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_merge2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:62"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_merge2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:62: cp \${abs_top_srcdir}/examples/'simple/igraph_layout_merge2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:62"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_layout_merge2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:62: "
+at_fn_check_prepare_trace "layout.at:62"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:62: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:62"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_115
+#AT_START_116
+at_fn_group_banner 116 'layout.at:66' \
+  "Merging layouts 3 (igraph_i_layout_merge):" "     " 8
+at_xfail=no
+(
+  $as_echo "116. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:68: \$CC \${abs_top_srcdir}/examples/simple/igraph_layout_merge3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:68"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_layout_merge3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:68: >expout"
+at_fn_check_prepare_trace "layout.at:68"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:68: "
+at_fn_check_prepare_trace "layout.at:68"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/layout.at:68: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "layout.at:68"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/layout.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_116
+#AT_START_117
+at_fn_group_banner 117 'visitors.at:24' \
+  "Internal breadth-first search (igraph_i_bfs):" "  " 9
+at_xfail=no
+(
+  $as_echo "117. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_bfs.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_bfs.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_bfs.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_bfs.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:26: "
+at_fn_check_prepare_trace "visitors.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_117
+#AT_START_118
+at_fn_group_banner 118 'visitors.at:29' \
+  "Breadth-first search (igraph_bfs):" "             " 9
+at_xfail=no
+(
+  $as_echo "118. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_bfs2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_bfs2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_bfs2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_bfs2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:31: "
+at_fn_check_prepare_trace "visitors.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/visitors.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "visitors.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/visitors.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_118
+#AT_START_119
+at_fn_group_banner 119 'topology.at:24' \
+  "The isomorphism class of a subgraph (igraph_isolass_subgraph)" "" 10
+at_xfail=no
+(
+  $as_echo "119. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:26: \$CC \${abs_top_srcdir}/examples/simple/topology.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/topology.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:26: cp \${abs_top_srcdir}/examples/'simple/topology.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/topology.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:26: "
+at_fn_check_prepare_trace "topology.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_119
+#AT_START_120
+at_fn_group_banner 120 'topology.at:29' \
+  "The VF2 isomorphism algorithm" "                  " 10
+at_xfail=no
+(
+  $as_echo "120. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_isomorphic_vf2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_isomorphic_vf2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:31: >expout"
+at_fn_check_prepare_trace "topology.at:31"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:31: "
+at_fn_check_prepare_trace "topology.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_120
+#AT_START_121
+at_fn_group_banner 121 'topology.at:34' \
+  "VF algorithm with compatibility functions" "      " 10
+at_xfail=no
+(
+  $as_echo "121. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:36: \$CC \${abs_top_srcdir}/examples/simple/VF2-compat.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/VF2-compat.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:36: >expout"
+at_fn_check_prepare_trace "topology.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:36: "
+at_fn_check_prepare_trace "topology.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_121
+#AT_START_122
+at_fn_group_banner 122 'topology.at:39' \
+  "Graphical degree sequences" "                     " 10
+at_xfail=no
+(
+  $as_echo "122. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:41: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_degree_sequence.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_degree_sequence.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:41: >expout"
+at_fn_check_prepare_trace "topology.at:41"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:41: "
+at_fn_check_prepare_trace "topology.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/topology.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "topology.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/topology.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_122
+#AT_START_123
+at_fn_group_banner 123 'motifs.at:24' \
+  "RAND-ESU algorithm (igraph_motifs_randesu)" "     " 11
+at_xfail=no
+(
+  $as_echo "123. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/motifs.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_motifs_randesu.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "motifs.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_motifs_randesu.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/motifs.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/motifs.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_motifs_randesu.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "motifs.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_motifs_randesu.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/motifs.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/motifs.at:26: "
+at_fn_check_prepare_trace "motifs.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/motifs.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/motifs.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "motifs.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/motifs.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_123
+#AT_START_124
+at_fn_group_banner 124 'foreign.at:24' \
+  "Reading Pajek (igraph_read_graph_pajek):" "       " 12
+at_xfail=no
+(
+  $as_echo "124. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:26: \$CC \${abs_top_srcdir}/examples/simple/foreign.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/foreign.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:26: cp \${abs_top_srcdir}/examples/'simple/foreign.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/foreign.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:26: cp \${abs_top_srcdir}/examples/simple/LINKS.NET ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/LINKS.NET .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_124
+#AT_START_125
+at_fn_group_banner 125 'foreign.at:29' \
+  "GraphML (igraph_{read,write}_graph_graphml):" "   " 12
+at_xfail=no
+(
+  $as_echo "125. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:31: \$CC \${abs_top_srcdir}/examples/simple/graphml.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/graphml.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:31: cp \${abs_top_srcdir}/examples/'simple/graphml.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/graphml.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:31: cp \${abs_top_srcdir}/examples/simple/{test.gxl,graphml-hsa05010.xml} ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/{test.gxl,graphml-hsa05010.xml} .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_125
+#AT_START_126
+at_fn_group_banner 126 'foreign.at:35' \
+  "Writing Pajek (igraph_write_graph_pajek):" "      " 12
+at_xfail=no
+(
+  $as_echo "126. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:37: \$CC \${abs_top_srcdir}/examples/simple/igraph_write_graph_pajek.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:37"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_write_graph_pajek.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:37: cp \${abs_top_srcdir}/examples/'simple/igraph_write_graph_pajek.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:37"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_write_graph_pajek.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:37: "
+at_fn_check_prepare_trace "foreign.at:37"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:37: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:37"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_126
+#AT_START_127
+at_fn_group_banner 127 'foreign.at:41' \
+  "Pajek with number of edges present (igraph_read_graph_pajek):" "" 12
+at_xfail=no
+(
+  $as_echo "127. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:43: \$CC \${abs_top_srcdir}/examples/simple/pajek.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:43"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/pajek.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:43"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:43: >expout"
+at_fn_check_prepare_trace "foreign.at:43"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:43"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:43: cp \${abs_top_srcdir}/examples/simple/pajek{5,6}.net ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:43"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/pajek{5,6}.net .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:43"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:43: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:43"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:43"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_127
+#AT_START_128
+at_fn_group_banner 128 'foreign.at:46' \
+  "Pajek, bipartite (igraph_read_graph_pajek):" "    " 12
+at_xfail=no
+(
+  $as_echo "128. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:48: \$CC \${abs_top_srcdir}/examples/simple/pajek2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:48"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/pajek2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:48: cp \${abs_top_srcdir}/examples/'simple/pajek2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:48"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/pajek2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:48: cp \${abs_top_srcdir}/examples/simple/bipartite.net ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:48"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/bipartite.net .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:48: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:48"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_128
+#AT_START_129
+at_fn_group_banner 129 'foreign.at:52' \
+  "Reading an LGL file (igraph_read_graph_lgl):" "   " 12
+at_xfail=no
+(
+  $as_echo "129. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:54: \$CC \${abs_top_srcdir}/examples/simple/igraph_read_graph_lgl.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:54"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_read_graph_lgl.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:54: cp \${abs_top_srcdir}/examples/'simple/igraph_read_graph_lgl.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:54"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_read_graph_lgl.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:54: cp \${abs_top_srcdir}/examples/{simple/igraph_read_graph_lgl-1.lgl,simple/igraph_read_graph_lgl-2.lgl,simple/igraph_read_graph_lgl-3.lgl} ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:54"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/{simple/igraph_read_graph_lgl-1.lgl,simple/igraph_read_graph_lgl-2.lgl,simple/igraph_read_graph_lgl-3.lgl} .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:54: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:54"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_129
+#AT_START_130
+at_fn_group_banner 130 'foreign.at:59' \
+  "Writing LGL (igraph_write_graph_lgl):" "          " 12
+at_xfail=no
+(
+  $as_echo "130. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:61: \$CC \${abs_top_srcdir}/examples/simple/igraph_write_graph_lgl.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:61"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_write_graph_lgl.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:61: >expout"
+at_fn_check_prepare_trace "foreign.at:61"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:61: "
+at_fn_check_prepare_trace "foreign.at:61"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:61: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:61"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:61"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_130
+#AT_START_131
+at_fn_group_banner 131 'foreign.at:64' \
+  "Reading a graph from the graph database (igraph_read_graph_graphdb):" "" 12
+at_xfail=no
+(
+  $as_echo "131. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:66: \$CC \${abs_top_srcdir}/examples/simple/igraph_read_graph_graphdb.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:66"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_read_graph_graphdb.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:66: cp \${abs_top_srcdir}/examples/'simple/igraph_read_graph_graphdb.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:66"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_read_graph_graphdb.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:66: cp \${abs_top_srcdir}/examples/simple/iso_b03_m1000.A00 ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:66"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/iso_b03_m1000.A00 .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:66: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:66"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_131
+#AT_START_132
+at_fn_group_banner 132 'foreign.at:71' \
+  "Reading a GML file (igraph_read_graph_gml):" "    " 12
+at_xfail=no
+(
+  $as_echo "132. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:73: \$CC \${abs_top_srcdir}/examples/simple/gml.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:73"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/gml.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:73: cp \${abs_top_srcdir}/examples/'simple/gml.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:73"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/gml.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:73: cp \${abs_top_srcdir}/examples/simple/karate.gml ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:73"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/karate.gml .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:73: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:73"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_132
+#AT_START_133
+at_fn_group_banner 133 'foreign.at:76' \
+  "Writing a DOT file (igraph_write_graph_dot):" "   " 12
+at_xfail=no
+(
+  $as_echo "133. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:78: \$CC \${abs_top_srcdir}/examples/simple/dot.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:78"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/dot.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:78: cp \${abs_top_srcdir}/examples/'simple/dot.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:78"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/dot.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:78: cp \${abs_top_srcdir}/examples/simple/karate.gml ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:78"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/karate.gml .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:78: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:78"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_133
+#AT_START_134
+at_fn_group_banner 134 'foreign.at:81' \
+  "Different line endings:" "                        " 12
+at_xfail=no
+(
+  $as_echo "134. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:84: \$CC \${abs_top_srcdir}/examples/simple/lineendings.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:84"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/lineendings.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:84"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:84: cp \${abs_top_srcdir}/examples/'simple/lineendings.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:84"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/lineendings.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:84"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:84: cp \${abs_top_srcdir}/examples/{simple/pajek1.net,simple/pajek2.net,simple/pajek3.net,simple/pajek4.net} ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:84"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/{simple/pajek1.net,simple/pajek2.net,simple/pajek3.net,simple/pajek4.net} .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:84"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:84: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:84"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:84"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_134
+#AT_START_135
+at_fn_group_banner 135 'foreign.at:88' \
+  "UNICET DL format:" "                              " 12
+at_xfail=no
+(
+  $as_echo "135. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:90: \$CC \${abs_top_srcdir}/examples/simple/igraph_read_graph_dl.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:90"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_read_graph_dl.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:90: cp \${abs_top_srcdir}/examples/'simple/igraph_read_graph_dl.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:90"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_read_graph_dl.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:90: cp \${abs_top_srcdir}/examples/simple/{edgelist1,edgelist2,edgelist3,edgelist4,edgelist5,edgelist6,fullmatrix1,fullmatrix2,fullmatrix3,fullmatrix4,nodelist1,nodelist2}.dl ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:90"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/{edgelist1,edgelist2,edgelist3,edgelist4,edgelist5,edgelist6,fullmatrix1,fullmatrix2,fullmatrix3,fullmatrix4,nodelist1,nodelist2}.dl .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:90: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:90"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:90"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_135
+#AT_START_136
+at_fn_group_banner 136 'foreign.at:94' \
+  "LEDA format:" "                                   " 12
+at_xfail=no
+(
+  $as_echo "136. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:96: \$CC \${abs_top_srcdir}/examples/simple/igraph_write_graph_leda.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:96"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_write_graph_leda.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:96: cp \${abs_top_srcdir}/examples/'simple/igraph_write_graph_leda.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:96"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_write_graph_leda.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:96: "
+at_fn_check_prepare_trace "foreign.at:96"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/foreign.at:96: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "foreign.at:96"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/foreign.at:96"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_136
+#AT_START_137
+at_fn_group_banner 137 'other.at:24' \
+  "Convex hull calculation (igraph_convex_hull):" "  " 13
+at_xfail=no
+(
+  $as_echo "137. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/other.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_convex_hull.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_convex_hull.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_convex_hull.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_convex_hull.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:26: "
+at_fn_check_prepare_trace "other.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_137
+#AT_START_138
+at_fn_group_banner 138 'other.at:29' \
+  "Fitting power-law distributions (igraph_power_law_fit):" "" 13
+at_xfail=no
+(
+  $as_echo "138. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/other.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_power_law_fit.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_power_law_fit.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_power_law_fit.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_power_law_fit.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:31: "
+at_fn_check_prepare_trace "other.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/other.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "other.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/other.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_138
+#AT_START_139
+at_fn_group_banner 139 'operators.at:24' \
+  "Disjoint union (igraph_disjoint_union, igraph_dosjoint_union_many):" "" 14
+at_xfail=no
+(
+  $as_echo "139. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:27: \$CC \${abs_top_srcdir}/examples/simple/igraph_disjoint_union.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:27"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_disjoint_union.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:27"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:27: cp \${abs_top_srcdir}/examples/'simple/igraph_disjoint_union.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:27"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_disjoint_union.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:27"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:27: "
+at_fn_check_prepare_trace "operators.at:27"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:27"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:27: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:27"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:27"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_139
+#AT_START_140
+at_fn_group_banner 140 'operators.at:31' \
+  "Union (igraph_union, igraph_union_many):" "       " 14
+at_xfail=no
+(
+  $as_echo "140. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:33: \$CC \${abs_top_srcdir}/examples/simple/igraph_union.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:33"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_union.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:33: cp \${abs_top_srcdir}/examples/'simple/igraph_union.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:33"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_union.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:33: "
+at_fn_check_prepare_trace "operators.at:33"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:33: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:33"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_140
+#AT_START_141
+at_fn_group_banner 141 'operators.at:37' \
+  "Intersection (igraph_intersection, igraph_intersection_many):" "" 14
+at_xfail=no
+(
+  $as_echo "141. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:39: \$CC \${abs_top_srcdir}/examples/simple/igraph_intersection.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:39"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_intersection.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:39"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:39: cp \${abs_top_srcdir}/examples/'simple/igraph_intersection.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:39"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_intersection.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:39"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:39: "
+at_fn_check_prepare_trace "operators.at:39"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:39"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:39: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:39"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:39"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_141
+#AT_START_142
+at_fn_group_banner 142 'operators.at:43' \
+  "Difference (igraph_difference):" "                " 14
+at_xfail=no
+(
+  $as_echo "142. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:45: \$CC \${abs_top_srcdir}/examples/simple/igraph_difference.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:45"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_difference.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:45"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:45: cp \${abs_top_srcdir}/examples/'simple/igraph_difference.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:45"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_difference.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:45"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:45: "
+at_fn_check_prepare_trace "operators.at:45"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:45"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:45: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:45"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:45"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_142
+#AT_START_143
+at_fn_group_banner 143 'operators.at:49' \
+  "Complementer (igraph_complementer):" "            " 14
+at_xfail=no
+(
+  $as_echo "143. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:51: \$CC \${abs_top_srcdir}/examples/simple/igraph_complementer.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:51"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_complementer.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:51: cp \${abs_top_srcdir}/examples/'simple/igraph_complementer.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:51"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_complementer.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:51: "
+at_fn_check_prepare_trace "operators.at:51"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:51: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:51"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:51"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_143
+#AT_START_144
+at_fn_group_banner 144 'operators.at:55' \
+  "Composition (igraph_compose):" "                  " 14
+at_xfail=no
+(
+  $as_echo "144. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:57: \$CC \${abs_top_srcdir}/examples/simple/igraph_compose.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:57"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_compose.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:57: cp \${abs_top_srcdir}/examples/'simple/igraph_compose.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:57"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_compose.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:57: "
+at_fn_check_prepare_trace "operators.at:57"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/operators.at:57: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "operators.at:57"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/operators.at:57"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_144
+#AT_START_145
+at_fn_group_banner 145 'conversion.at:24' \
+  "Directed to undirected (igraph_to_undirected):" " " 15
+at_xfail=no
+(
+  $as_echo "145. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_to_undirected.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_to_undirected.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_to_undirected.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_to_undirected.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:26: "
+at_fn_check_prepare_trace "conversion.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_145
+#AT_START_146
+at_fn_group_banner 146 'conversion.at:30' \
+  "Graphs from adjacency list (igraph_adjlist):" "   " 15
+at_xfail=no
+(
+  $as_echo "146. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:32: \$CC \${abs_top_srcdir}/examples/simple/adjlist.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/adjlist.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:32: >expout"
+at_fn_check_prepare_trace "conversion.at:32"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:32: "
+at_fn_check_prepare_trace "conversion.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_146
+#AT_START_147
+at_fn_group_banner 147 'conversion.at:35' \
+  "Graph to Laplacian matrix (igraph_laplacian):" "  " 15
+at_xfail=no
+(
+  $as_echo "147. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:37: \$CC \${abs_top_srcdir}/examples/simple/igraph_laplacian.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:37"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_laplacian.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:37: cp \${abs_top_srcdir}/examples/'simple/igraph_laplacian.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:37"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_laplacian.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:37: "
+at_fn_check_prepare_trace "conversion.at:37"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/conversion.at:37: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "conversion.at:37"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/conversion.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_147
+#AT_START_148
+at_fn_group_banner 148 'flow.at:24' \
+  "Maximum flow value (igraph_maxflow_value): " "    " 16
+at_xfail=no
+(
+  $as_echo "148. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:26: \$CC \${abs_top_srcdir}/examples/simple/flow.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/flow.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:26: >expout"
+at_fn_check_prepare_trace "flow.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:26: cp \${abs_top_srcdir}/examples/simple/ak-4102.max ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/ak-4102.max .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_148
+#AT_START_149
+at_fn_group_banner 149 'flow.at:29' \
+  "Maximum flow (igraph_maxflow): " "                " 16
+at_xfail=no
+(
+  $as_echo "149. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:31: \$CC \${abs_top_srcdir}/examples/simple/flow2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/flow2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:31: cp \${abs_top_srcdir}/examples/'simple/flow2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/flow2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:31: cp \${abs_top_srcdir}/examples/simple/ak-4102.max ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/ak-4102.max .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_149
+#AT_START_150
+at_fn_group_banner 150 'flow.at:34' \
+  "Minimum cut (igraph_mincut): " "                  " 16
+at_xfail=no
+(
+  $as_echo "150. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_mincut.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_mincut.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:36: cp \${abs_top_srcdir}/examples/'simple/igraph_mincut.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_mincut.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:36: "
+at_fn_check_prepare_trace "flow.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_150
+#AT_START_151
+at_fn_group_banner 151 'flow.at:39' \
+  "Even-Tarjan reduction (igraph_even_tarjan_reduction): " "" 16
+at_xfail=no
+(
+  $as_echo "151. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:41: \$CC \${abs_top_srcdir}/examples/simple/even_tarjan.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/even_tarjan.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:41: >expout"
+at_fn_check_prepare_trace "flow.at:41"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:41: "
+at_fn_check_prepare_trace "flow.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_151
+#AT_START_152
+at_fn_group_banner 152 'flow.at:44' \
+  "Dominator tree of a flow graph (igraph_dominator_tree): " "" 16
+at_xfail=no
+(
+  $as_echo "152. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:46: \$CC \${abs_top_srcdir}/examples/simple/dominator_tree.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:46"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/dominator_tree.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:46: cp \${abs_top_srcdir}/examples/'simple/dominator_tree.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:46"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/dominator_tree.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:46: "
+at_fn_check_prepare_trace "flow.at:46"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:46: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:46"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_152
+#AT_START_153
+at_fn_group_banner 153 'flow.at:50' \
+  "All s-t cuts of a graph (igraph_all_st_cuts): " " " 16
+at_xfail=no
+(
+  $as_echo "153. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:52: \$CC \${abs_top_srcdir}/examples/simple/igraph_all_st_cuts.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:52"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_all_st_cuts.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:52: cp \${abs_top_srcdir}/examples/'simple/igraph_all_st_cuts.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:52"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_all_st_cuts.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:52: "
+at_fn_check_prepare_trace "flow.at:52"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:52: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:52"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_153
+#AT_START_154
+at_fn_group_banner 154 'flow.at:56' \
+  "All minimal s-t cuts of a graph (igraph_all_st_mincuts): " "" 16
+at_xfail=no
+(
+  $as_echo "154. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:58: \$CC \${abs_top_srcdir}/examples/simple/igraph_all_st_mincuts.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:58"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_all_st_mincuts.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:58"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:58: cp \${abs_top_srcdir}/examples/'simple/igraph_all_st_mincuts.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:58"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_all_st_mincuts.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:58"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:58: "
+at_fn_check_prepare_trace "flow.at:58"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:58"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/flow.at:58: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "flow.at:58"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/flow.at:58"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_154
+#AT_START_155
+at_fn_group_banner 155 'community.at:24' \
+  "Spinglass clustering (igraph_spinglass_community): " "" 17
+at_xfail=no
+(
+  $as_echo "155. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:26: \$CC \${abs_top_srcdir}/examples/simple/spinglass.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/spinglass.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:26: >expout"
+at_fn_check_prepare_trace "community.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:26: "
+at_fn_check_prepare_trace "community.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_155
+#AT_START_156
+at_fn_group_banner 156 'community.at:29' \
+  "Walktrap community structure (igraph_walktrap_community): " "" 17
+at_xfail=no
+(
+  $as_echo "156. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:31: \$CC \${abs_top_srcdir}/examples/simple/walktrap.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/walktrap.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:31: cp \${abs_top_srcdir}/examples/'simple/walktrap.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/walktrap.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:31: "
+at_fn_check_prepare_trace "community.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_156
+#AT_START_157
+at_fn_group_banner 157 'community.at:34' \
+  "Edge betweenness community structure (igraph_community_edge_betweenness): " "" 17
+at_xfail=no
+(
+  $as_echo "157. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_edge_betweenness.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_edge_betweenness.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:36: cp \${abs_top_srcdir}/examples/'simple/igraph_community_edge_betweenness.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_edge_betweenness.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:36: "
+at_fn_check_prepare_trace "community.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_157
+#AT_START_158
+at_fn_group_banner 158 'community.at:40' \
+  "Modularity optimization (igraph_community_fastgreedy): " "" 17
+at_xfail=no
+(
+  $as_echo "158. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:42: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_fastgreedy.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:42"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_fastgreedy.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:42: cp \${abs_top_srcdir}/examples/'simple/igraph_community_fastgreedy.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:42"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_fastgreedy.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:42: "
+at_fn_check_prepare_trace "community.at:42"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:42: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:42"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_158
+#AT_START_159
+at_fn_group_banner 159 'community.at:46' \
+  "Leading eigenvector community structure (igraph_community_leading_eigenvector) :" "" 17
+at_xfail=no
+(
+  $as_echo "159. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:48: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_leading_eigenvector.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:48"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_leading_eigenvector.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:48: cp \${abs_top_srcdir}/examples/'simple/igraph_community_leading_eigenvector.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:48"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_leading_eigenvector.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:48: "
+at_fn_check_prepare_trace "community.at:48"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:48: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:48"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:48"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_159
+#AT_START_160
+at_fn_group_banner 160 'community.at:52' \
+  "Leading eigenvector bug #1002140 test (igraph_community_leading_eigenvector) :" "" 17
+at_xfail=no
+(
+  $as_echo "160. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:54: \$CC \${abs_top_srcdir}/examples/simple/levc-stress.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:54"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/levc-stress.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:54: >expout"
+at_fn_check_prepare_trace "community.at:54"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:54: cp \${abs_top_srcdir}/examples/simple/input.dl ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:54"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/input.dl .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:54: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:54"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:54"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_160
+#AT_START_161
+at_fn_group_banner 161 'community.at:58' \
+  "Label propagation algorithm (igraph_community_label_propagation) :" "" 17
+at_xfail=no
+(
+  $as_echo "161. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:60: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_label_propagation.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:60"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_label_propagation.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:60"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:60: cp \${abs_top_srcdir}/examples/'simple/igraph_community_label_propagation.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:60"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_label_propagation.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:60"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:60: "
+at_fn_check_prepare_trace "community.at:60"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:60"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:60: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:60"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:60"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_161
+#AT_START_162
+at_fn_group_banner 162 'community.at:64' \
+  "Multilevel community detection (igraph_community_multilevel) :" "" 17
+at_xfail=no
+(
+  $as_echo "162. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:66: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_multilevel.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:66"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_multilevel.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:66: cp \${abs_top_srcdir}/examples/'simple/igraph_community_multilevel.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:66"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_multilevel.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:66: "
+at_fn_check_prepare_trace "community.at:66"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:66: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:66"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_162
+#AT_START_163
+at_fn_group_banner 163 'community.at:70' \
+  "Modularity optimization, integer programming (igraph_community_optimal_modularity) :" "" 17
+at_xfail=no
+(
+  $as_echo "163. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:72: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_optimal_modularity.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:72"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_optimal_modularity.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:72"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:72: >expout"
+at_fn_check_prepare_trace "community.at:72"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:72"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:72: "
+at_fn_check_prepare_trace "community.at:72"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:72"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:72: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:72"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:72"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_163
+#AT_START_164
+at_fn_group_banner 164 'community.at:75' \
+  "Infomap community structure (igraph_community_infomap) :" "" 17
+at_xfail=no
+(
+  $as_echo "164. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/community.at:77: \$CC \${abs_top_srcdir}/examples/simple/igraph_community_infomap.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:77"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_community_infomap.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:77"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:77: cp \${abs_top_srcdir}/examples/'simple/igraph_community_infomap.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:77"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_community_infomap.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:77"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:77: cp \${abs_top_srcdir}/examples/simple/wikti_en_V_syn.elist ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:77"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/wikti_en_V_syn.elist .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:77"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/community.at:77: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "community.at:77"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/community.at:77"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_164
+#AT_START_165
+at_fn_group_banner 165 'cliques.at:26' \
+  "Calculating cliques (igraph_cliques): " "         " 18
+at_xfail=no
+(
+  $as_echo "165. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:28: \$CC \${abs_top_srcdir}/examples/simple/igraph_cliques.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:28"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_cliques.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:28: cp \${abs_top_srcdir}/examples/'simple/igraph_cliques.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:28"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_cliques.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:28: "
+at_fn_check_prepare_trace "cliques.at:28"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:28: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:28"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:28"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_165
+#AT_START_166
+at_fn_group_banner 166 'cliques.at:31' \
+  "Additional test for maximal cliques (igraph_maximal_cliques):" "" 18
+at_xfail=no
+(
+  $as_echo "166. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:33: \$CC \${abs_top_srcdir}/examples/simple/igraph_maximal_cliques.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:33"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_maximal_cliques.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:33: cp \${abs_top_srcdir}/examples/'simple/igraph_maximal_cliques.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:33"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_maximal_cliques.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:33: "
+at_fn_check_prepare_trace "cliques.at:33"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:33: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:33"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:33"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_166
+#AT_START_167
+at_fn_group_banner 167 'cliques.at:37' \
+  "Calculating independent vertex sets (igraph_independent_vertex_sets): " "" 18
+at_xfail=no
+(
+  $as_echo "167. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:41: \$CC \${abs_top_srcdir}/examples/simple/igraph_independent_sets.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_independent_sets.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:41: cp \${abs_top_srcdir}/examples/'simple/igraph_independent_sets.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:41"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_independent_sets.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:41: "
+at_fn_check_prepare_trace "cliques.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/cliques.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "cliques.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/cliques.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_167
+#AT_START_168
+at_fn_group_banner 168 'eigen.at:24' \
+  "Symmetric matrix, LAPACK (igraph_eigen_matrix_symmetric):" "" 19
+at_xfail=no
+(
+  $as_echo "168. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix_symmetric.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix_symmetric.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix_symmetric.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix_symmetric.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:26: "
+at_fn_check_prepare_trace "eigen.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_168
+#AT_START_169
+at_fn_group_banner 169 'eigen.at:30' \
+  "Symmetric matrix, ARPACK (igraph_eigen_matrix_symmetric):" "" 19
+at_xfail=no
+(
+  $as_echo "169. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:32: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix_symmetric_arpack.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix_symmetric_arpack.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:32: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix_symmetric_arpack.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:32"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix_symmetric_arpack.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:32: "
+at_fn_check_prepare_trace "eigen.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_169
+#AT_START_170
+at_fn_group_banner 170 'eigen.at:36' \
+  "General matrix, LAPACK, LM, SM (igraph_eigen_matrix):" "" 19
+at_xfail=no
+(
+  $as_echo "170. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:38: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:38"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:38: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:38"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:38: "
+at_fn_check_prepare_trace "eigen.at:38"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:38: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:38"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_170
+#AT_START_171
+at_fn_group_banner 171 'eigen.at:42' \
+  "General matrix, LAPACK, LR, SR (igraph_eigen_matrix):" "" 19
+at_xfail=no
+(
+  $as_echo "171. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:44: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:44"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:44: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:44"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:44: "
+at_fn_check_prepare_trace "eigen.at:44"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:44: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:44"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_171
+#AT_START_172
+at_fn_group_banner 172 'eigen.at:48' \
+  "General matrix, LAPACK, LI, SI (igraph_eigen_matrix):" "" 19
+at_xfail=no
+(
+  $as_echo "172. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:50: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix4.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:50"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix4.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:50: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix4.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:50"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix4.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:50: "
+at_fn_check_prepare_trace "eigen.at:50"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:50: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:50"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_172
+#AT_START_173
+at_fn_group_banner 173 'eigen.at:54' \
+  "General matrix, LAPACK, SELECT (igraph_eigen_matrix):" "" 19
+at_xfail=no
+(
+  $as_echo "173. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:56: \$CC \${abs_top_srcdir}/examples/simple/igraph_eigen_matrix3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:56"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_eigen_matrix3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:56: cp \${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:56"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_eigen_matrix3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:56: "
+at_fn_check_prepare_trace "eigen.at:56"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/eigen.at:56: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "eigen.at:56"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/eigen.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_173
+#AT_START_174
+at_fn_group_banner 174 'attributes.at:24' \
+  "Reading a Pajek file with attributes:" "          " 20
+at_xfail=no
+(
+  $as_echo "174. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:26: \$CC \${abs_top_srcdir}/examples/simple/cattributes.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/cattributes.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:26: cp \${abs_top_srcdir}/examples/'simple/cattributes.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/cattributes.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:26: cp \${abs_top_srcdir}/examples/simple/LINKS.NET ."
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/simple/LINKS.NET .
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_174
+#AT_START_175
+at_fn_group_banner 175 'attributes.at:30' \
+  "Writing an attributed graph in GML and GraphML:" "" 20
+at_xfail=no
+(
+  $as_echo "175. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:32: \$CC \${abs_top_srcdir}/examples/simple/cattributes2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/cattributes2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:32: cp \${abs_top_srcdir}/examples/'simple/cattributes2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:32"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/cattributes2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:32: "
+at_fn_check_prepare_trace "attributes.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_175
+#AT_START_176
+at_fn_group_banner 176 'attributes.at:35' \
+  "Combining numeric attributes:" "                  " 20
+at_xfail=no
+(
+  $as_echo "176. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:37: \$CC \${abs_top_srcdir}/examples/simple/cattributes3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:37"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/cattributes3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:37: cp \${abs_top_srcdir}/examples/'simple/cattributes3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:37"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/cattributes3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:37: "
+at_fn_check_prepare_trace "attributes.at:37"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:37: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:37"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_176
+#AT_START_177
+at_fn_group_banner 177 'attributes.at:40' \
+  "Combining string attributes:" "                   " 20
+at_xfail=no
+(
+  $as_echo "177. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:42: \$CC \${abs_top_srcdir}/examples/simple/cattributes4.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:42"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/cattributes4.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:42: cp \${abs_top_srcdir}/examples/'simple/cattributes4.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:42"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/cattributes4.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:42: "
+at_fn_check_prepare_trace "attributes.at:42"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/attributes.at:42: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "attributes.at:42"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/attributes.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_177
+#AT_START_178
+at_fn_group_banner 178 'arpack.at:24' \
+  "Basic BLAS functions (igraph_blas_*):" "          " 21
+at_xfail=no
+(
+  $as_echo "178. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:26: \$CC \${abs_top_srcdir}/examples/simple/blas.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/blas.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:26: cp \${abs_top_srcdir}/examples/'simple/blas.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/blas.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:26: "
+at_fn_check_prepare_trace "arpack.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_178
+#AT_START_179
+at_fn_group_banner 179 'arpack.at:30' \
+  "Dense symmetric eigenvalues and eigenvectors (igraph_lapack_dsyevr):" "" 21
+at_xfail=no
+(
+  $as_echo "179. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:32: \$CC \${abs_top_srcdir}/examples/simple/igraph_lapack_dsyevr.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lapack_dsyevr.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:32: >expout"
+at_fn_check_prepare_trace "arpack.at:32"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:32: "
+at_fn_check_prepare_trace "arpack.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_179
+#AT_START_180
+at_fn_group_banner 180 'arpack.at:35' \
+  "Dense non-symmetric eigenvalues and eigenvectors (igraph_lapack_dgeev):" "" 21
+at_xfail=no
+(
+  $as_echo "180. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:37: \$CC \${abs_top_srcdir}/examples/simple/igraph_lapack_dgeev.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:37"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lapack_dgeev.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:37: >expout"
+at_fn_check_prepare_trace "arpack.at:37"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:37: "
+at_fn_check_prepare_trace "arpack.at:37"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:37: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:37"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:37"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_180
+#AT_START_181
+at_fn_group_banner 181 'arpack.at:40' \
+  "Dense non-symmetric eigenvalues and eigenvectors (igraph_lapack_dgeevx):" "" 21
+at_xfail=no
+(
+  $as_echo "181. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:42: \$CC \${abs_top_srcdir}/examples/simple/igraph_lapack_dgeevx.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:42"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lapack_dgeevx.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:42: >expout"
+at_fn_check_prepare_trace "arpack.at:42"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:42: "
+at_fn_check_prepare_trace "arpack.at:42"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:42: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:42"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_181
+#AT_START_182
+at_fn_group_banner 182 'arpack.at:45' \
+  "Solving linear systems with LU factorization (igraph_lapack_dgesv):" "" 21
+at_xfail=no
+(
+  $as_echo "182. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:47: \$CC \${abs_top_srcdir}/examples/simple/igraph_lapack_dgesv.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:47"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lapack_dgesv.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:47: cp \${abs_top_srcdir}/examples/'simple/igraph_lapack_dgesv.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:47"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_lapack_dgesv.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:47: "
+at_fn_check_prepare_trace "arpack.at:47"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:47: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:47"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_182
+#AT_START_183
+at_fn_group_banner 183 'arpack.at:51' \
+  "Upper Hessenberg transformation (igraph_lapack_dgehrd):" "" 21
+at_xfail=no
+(
+  $as_echo "183. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:53: \$CC \${abs_top_srcdir}/examples/simple/igraph_lapack_dgehrd.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:53"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_lapack_dgehrd.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:53"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:53: cp \${abs_top_srcdir}/examples/'simple/igraph_lapack_dgehrd.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:53"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_lapack_dgehrd.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:53"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:53: "
+at_fn_check_prepare_trace "arpack.at:53"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:53"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:53: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:53"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:53"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_183
+#AT_START_184
+at_fn_group_banner 184 'arpack.at:57' \
+  "Eigenvector centrality (igraph_eigenvector_centrality):" "" 21
+at_xfail=no
+(
+  $as_echo "184. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:59: \$CC \${abs_top_srcdir}/examples/simple/eigenvector_centrality.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:59"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/eigenvector_centrality.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:59: cp \${abs_top_srcdir}/examples/'simple/eigenvector_centrality.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:59"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/eigenvector_centrality.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:59: "
+at_fn_check_prepare_trace "arpack.at:59"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:59: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:59"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:59"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_184
+#AT_START_185
+at_fn_group_banner 185 'arpack.at:63' \
+  "Non-symmetric ARPACK solver (igraph_arpack_rnsolve):" "" 21
+at_xfail=no
+(
+  $as_echo "185. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:66: \$CC \${abs_top_srcdir}/examples/simple/igraph_arpack_rnsolve.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:66"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_arpack_rnsolve.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:66: cp \${abs_top_srcdir}/examples/'simple/igraph_arpack_rnsolve.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:66"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_arpack_rnsolve.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:66: "
+at_fn_check_prepare_trace "arpack.at:66"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/arpack.at:66: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "arpack.at:66"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/arpack.at:66"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_185
+#AT_START_186
+at_fn_group_banner 186 'bipartite.at:24' \
+  "Create bipartite graphs (igraph_create_bipartite):" "" 22
+at_xfail=no
+(
+  $as_echo "186. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_bipartite_create.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "bipartite.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_bipartite_create.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_bipartite_create.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "bipartite.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_bipartite_create.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:26: "
+at_fn_check_prepare_trace "bipartite.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "bipartite.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_186
+#AT_START_187
+at_fn_group_banner 187 'bipartite.at:30' \
+  "Projection of bipartite graphs (igraph_bipartite_projection):" "" 22
+at_xfail=no
+(
+  $as_echo "187. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:32: \$CC \${abs_top_srcdir}/examples/simple/igraph_bipartite_projection.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "bipartite.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_bipartite_projection.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:32: >expout"
+at_fn_check_prepare_trace "bipartite.at:32"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:32: "
+at_fn_check_prepare_trace "bipartite.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/bipartite.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "bipartite.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/bipartite.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_187
+#AT_START_188
+at_fn_group_banner 188 'centralization.at:24' \
+  "Centralization (igraph_centralization_*):" "      " 23
+at_xfail=no
+(
+  $as_echo "188. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/centralization.at:26: \$CC \${abs_top_srcdir}/examples/simple/centralization.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "centralization.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/centralization.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/centralization.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/centralization.at:26: >expout"
+at_fn_check_prepare_trace "centralization.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/centralization.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/centralization.at:26: "
+at_fn_check_prepare_trace "centralization.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/centralization.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/centralization.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "centralization.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/centralization.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_188
+#AT_START_189
+at_fn_group_banner 189 'separators.at:24' \
+  "Decision problem (igraph_is_separator): " "       " 24
+at_xfail=no
+(
+  $as_echo "189. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_separator.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_separator.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:26: >expout"
+at_fn_check_prepare_trace "separators.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:26: "
+at_fn_check_prepare_trace "separators.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_189
+#AT_START_190
+at_fn_group_banner 190 'separators.at:29' \
+  "Decision problem, minimal separator (igraph_is_minimal separator): " "" 24
+at_xfail=no
+(
+  $as_echo "190. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_is_minimal_separator.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_is_minimal_separator.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:31: >expout"
+at_fn_check_prepare_trace "separators.at:31"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:31: "
+at_fn_check_prepare_trace "separators.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_190
+#AT_START_191
+at_fn_group_banner 191 'separators.at:34' \
+  "Minimal separators (igraph_all_minimal_ab_separators): " "" 24
+at_xfail=no
+(
+  $as_echo "191. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_minimal_separators.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_minimal_separators.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:36: >expout"
+at_fn_check_prepare_trace "separators.at:36"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:36: "
+at_fn_check_prepare_trace "separators.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_191
+#AT_START_192
+at_fn_group_banner 192 'separators.at:39' \
+  "Minimal separators, bug 1033045 (igraph_all_minimal_st_separators): " "" 24
+at_xfail=no
+(
+  $as_echo "192. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:41: \$CC \${abs_top_srcdir}/examples/simple/bug-1033045.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:41"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/bug-1033045.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:41: cp \${abs_top_srcdir}/examples/'simple/bug-1033045.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:41"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/bug-1033045.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:41: "
+at_fn_check_prepare_trace "separators.at:41"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:41: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:41"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:41"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_192
+#AT_START_193
+at_fn_group_banner 193 'separators.at:44' \
+  "Minimum size separators (igraph_minimum_size_separators): " "" 24
+at_xfail=no
+(
+  $as_echo "193. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:46: \$CC \${abs_top_srcdir}/examples/simple/igraph_minimum_size_separators.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:46"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_minimum_size_separators.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:46: cp \${abs_top_srcdir}/examples/'simple/igraph_minimum_size_separators.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:46"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_minimum_size_separators.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:46: "
+at_fn_check_prepare_trace "separators.at:46"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:46: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:46"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:46"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_193
+#AT_START_194
+at_fn_group_banner 194 'separators.at:50' \
+  "Cohesive blocking (igraph_cohesive_blocks): " "   " 24
+at_xfail=no
+(
+  $as_echo "194. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:52: \$CC \${abs_top_srcdir}/examples/simple/cohesive_blocks.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:52"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/cohesive_blocks.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:52: cp \${abs_top_srcdir}/examples/'simple/cohesive_blocks.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:52"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/cohesive_blocks.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:52: "
+at_fn_check_prepare_trace "separators.at:52"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/separators.at:52: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "separators.at:52"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/separators.at:52"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_194
+#AT_START_195
+at_fn_group_banner 195 'hrg.at:24' \
+  "Fitting a hierarchical model (igraph_hrg_fit) :" "" 25
+at_xfail=no
+(
+  $as_echo "195. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_hrg.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_hrg.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:26: >expout"
+at_fn_check_prepare_trace "hrg.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:26: "
+at_fn_check_prepare_trace "hrg.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_195
+#AT_START_196
+at_fn_group_banner 196 'hrg.at:29' \
+  "Consensus tree (igraph_hrg_consensus) :" "        " 25
+at_xfail=no
+(
+  $as_echo "196. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_hrg2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_hrg2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_hrg2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_hrg2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:31: "
+at_fn_check_prepare_trace "hrg.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_196
+#AT_START_197
+at_fn_group_banner 197 'hrg.at:34' \
+  "Missing edge prediction (igraph_hrg_predict) :" " " 25
+at_xfail=no
+(
+  $as_echo "197. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_hrg3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_hrg3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:36: cp \${abs_top_srcdir}/examples/'simple/igraph_hrg3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_hrg3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:36: "
+at_fn_check_prepare_trace "hrg.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/hrg.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "hrg.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/hrg.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_197
+#AT_START_198
+at_fn_group_banner 198 'microscopic.at:23' \
+  "Deterministic optimal imitation:" "               " 26
+at_xfail=no
+(
+  $as_echo "198. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:25: \$CC \${abs_top_srcdir}/examples/simple/igraph_deterministic_optimal_imitation.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:25"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_deterministic_optimal_imitation.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:25: >expout"
+at_fn_check_prepare_trace "microscopic.at:25"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:25: "
+at_fn_check_prepare_trace "microscopic.at:25"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:25: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:25"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_198
+#AT_START_199
+at_fn_group_banner 199 'microscopic.at:28' \
+  "Stochastic imitation via uniform selection:" "    " 26
+at_xfail=no
+(
+  $as_echo "199. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:30: \$CC \${abs_top_srcdir}/examples/simple/igraph_stochastic_imitation.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:30"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_stochastic_imitation.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:30"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:30: >expout"
+at_fn_check_prepare_trace "microscopic.at:30"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:30"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:30: "
+at_fn_check_prepare_trace "microscopic.at:30"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:30"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:30: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:30"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:30"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_199
+#AT_START_200
+at_fn_group_banner 200 'microscopic.at:33' \
+  "Stochastic imitation via roulette selection:" "   " 26
+at_xfail=no
+(
+  $as_echo "200. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:35: \$CC \${abs_top_srcdir}/examples/simple/igraph_roulette_wheel_imitation.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:35"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_roulette_wheel_imitation.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:35"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:35: >expout"
+at_fn_check_prepare_trace "microscopic.at:35"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:35"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:35: "
+at_fn_check_prepare_trace "microscopic.at:35"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:35"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:35: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:35"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:35"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_200
+#AT_START_201
+at_fn_group_banner 201 'microscopic.at:38' \
+  "Moran process:" "                                 " 26
+at_xfail=no
+(
+  $as_echo "201. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:40: \$CC \${abs_top_srcdir}/examples/simple/igraph_moran_process.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:40"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_moran_process.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:40"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:40: >expout"
+at_fn_check_prepare_trace "microscopic.at:40"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:40"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:40: "
+at_fn_check_prepare_trace "microscopic.at:40"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:40"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/microscopic.at:40: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "microscopic.at:40"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/microscopic.at:40"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_201
+#AT_START_202
+at_fn_group_banner 202 'mt.at:24' \
+  "Simple error handling test :" "                   " 27
+at_xfail=no
+(
+  $as_echo "202. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:26: \$CC \${abs_top_srcdir}/examples/simple/tls1.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm -lpthread -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "mt.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/tls1.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm -lpthread -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:26: >expout"
+at_fn_check_prepare_trace "mt.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:26: "
+at_fn_check_prepare_trace "mt.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "mt.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_202
+#AT_START_203
+at_fn_group_banner 203 'mt.at:29' \
+  "Thread-safe ARPACK:" "                            " 27
+at_xfail=no
+(
+  $as_echo "203. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:31: \$CC \${abs_top_srcdir}/examples/simple/tls2.c -I\${abs_top_srcdir}/include -I\${abs_top_srcdir}/src -I\${abs_top_builddir}/include -I\${abs_top_builddir} -L\${abs_top_builddir}/src/.libs -ligraph -lm -lpthread -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "mt.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/tls2.c -I${abs_top_srcdir}/include -I${abs_top_srcdir}/src -I${abs_top_builddir}/include -I${abs_top_builddir} -L${abs_top_builddir}/src/.libs -ligraph -lm -lpthread -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:31: cp \${abs_top_srcdir}/examples/'simple/tls2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "mt.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/tls2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:31: "
+at_fn_check_prepare_trace "mt.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/mt.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "mt.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/mt.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_203
+#AT_START_204
+at_fn_group_banner 204 'scg.at:24' \
+  "Solving the SCG problem (igraph_scg_grouping) :" "" 28
+at_xfail=no
+(
+  $as_echo "204. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_grouping.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_grouping.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_grouping.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_grouping.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:26: "
+at_fn_check_prepare_trace "scg.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_204
+#AT_START_205
+at_fn_group_banner 205 'scg.at:30' \
+  "Solving the SCG problem, adjacency matrix (igraph_scg_grouping) :" "" 28
+at_xfail=no
+(
+  $as_echo "205. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:32: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_grouping2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:32"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_grouping2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:32: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_grouping2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:32"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_grouping2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:32: "
+at_fn_check_prepare_trace "scg.at:32"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:32: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:32"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:32"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_205
+#AT_START_206
+at_fn_group_banner 206 'scg.at:36' \
+  "Solving the SCG problem, stochastic matrix (igraph_scg_grouping) :" "" 28
+at_xfail=no
+(
+  $as_echo "206. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:38: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_grouping3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:38"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_grouping3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:38: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_grouping3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:38"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_grouping3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:38: "
+at_fn_check_prepare_trace "scg.at:38"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:38: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:38"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:38"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_206
+#AT_START_207
+at_fn_group_banner 207 'scg.at:42' \
+  "Solving the SCG problem, laplacian matrix (igraph_scg_grouping) :" "" 28
+at_xfail=no
+(
+  $as_echo "207. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:44: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_grouping4.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:44"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_grouping4.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:44: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_grouping4.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:44"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_grouping4.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:44: "
+at_fn_check_prepare_trace "scg.at:44"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:44: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:44"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:44"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_207
+#AT_START_208
+at_fn_group_banner 208 'scg.at:48' \
+  "SCG semi-projectors, symmetric (igraph_scg_semiprojectors) :" "" 28
+at_xfail=no
+(
+  $as_echo "208. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:50: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:50"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:50: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:50"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:50: "
+at_fn_check_prepare_trace "scg.at:50"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:50: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:50"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:50"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_208
+#AT_START_209
+at_fn_group_banner 209 'scg.at:54' \
+  "SCG semi-projectors, stochastic (igraph_scg_semiprojectors) :" "" 28
+at_xfail=no
+(
+  $as_echo "209. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:56: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:56"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:56: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:56"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:56: "
+at_fn_check_prepare_trace "scg.at:56"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:56: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:56"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:56"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_209
+#AT_START_210
+at_fn_group_banner 210 'scg.at:60' \
+  "SCG semi-projectors, laplacian (igraph_scg_semiprojectors) :" "" 28
+at_xfail=no
+(
+  $as_echo "210. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:62: \$CC \${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:62"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_scg_semiprojectors3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:62: cp \${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:62"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_scg_semiprojectors3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:62: "
+at_fn_check_prepare_trace "scg.at:62"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:62: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:62"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:62"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_210
+#AT_START_211
+at_fn_group_banner 211 'scg.at:66' \
+  "SCG of a graph, adjacency matrix (igraph_scg) :" "" 28
+at_xfail=no
+(
+  $as_echo "211. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:68: \$CC \${abs_top_srcdir}/examples/simple/scg.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:68"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/scg.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:68: cp \${abs_top_srcdir}/examples/'simple/scg.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:68"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/scg.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:68: "
+at_fn_check_prepare_trace "scg.at:68"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:68: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:68"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:68"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_211
+#AT_START_212
+at_fn_group_banner 212 'scg.at:71' \
+  "SCG of a graph, stochastic matrix (igraph_scg) :" "" 28
+at_xfail=no
+(
+  $as_echo "212. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:73: \$CC \${abs_top_srcdir}/examples/simple/scg2.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:73"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/scg2.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:73: cp \${abs_top_srcdir}/examples/'simple/scg2.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:73"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/scg2.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:73: "
+at_fn_check_prepare_trace "scg.at:73"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:73: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:73"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:73"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_212
+#AT_START_213
+at_fn_group_banner 213 'scg.at:76' \
+  "SCG of a graph, laplacian matrix (igraph_scg) :" "" 28
+at_xfail=no
+(
+  $as_echo "213. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:78: \$CC \${abs_top_srcdir}/examples/simple/scg3.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:78"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/scg3.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:78: cp \${abs_top_srcdir}/examples/'simple/scg3.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:78"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/scg3.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:78: "
+at_fn_check_prepare_trace "scg.at:78"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/scg.at:78: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "scg.at:78"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/scg.at:78"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_213
+#AT_START_214
+at_fn_group_banner 214 'random.at:24' \
+  "Random seed:" "                                   " 29
+at_xfail=no
+(
+  $as_echo "214. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/random.at:26: \$CC \${abs_top_srcdir}/examples/simple/random_seed.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/random_seed.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:26: >expout"
+at_fn_check_prepare_trace "random.at:26"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:26: "
+at_fn_check_prepare_trace "random.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_214
+#AT_START_215
+at_fn_group_banner 215 'random.at:29' \
+  "MT19937 RNG on 64 bit machines:" "                " 29
+at_xfail=no
+(
+  $as_echo "215. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/random.at:31: \$CC \${abs_top_srcdir}/examples/simple/mt.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/mt.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:31: >expout"
+at_fn_check_prepare_trace "random.at:31"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:31: "
+at_fn_check_prepare_trace "random.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_215
+#AT_START_216
+at_fn_group_banner 216 'random.at:34' \
+  "Exponentially distributed random numbers:" "      " 29
+at_xfail=no
+(
+  $as_echo "216. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/random.at:36: \$CC \${abs_top_srcdir}/examples/simple/igraph_rng_get_exp.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:36"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_rng_get_exp.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:36: cp \${abs_top_srcdir}/examples/'simple/igraph_rng_get_exp.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:36"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_rng_get_exp.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:36: "
+at_fn_check_prepare_trace "random.at:36"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:36: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:36"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:36"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_216
+#AT_START_217
+at_fn_group_banner 217 'random.at:40' \
+  "Random sampling from consecutive sequence:" "     " 29
+at_xfail=no
+(
+  $as_echo "217. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/random.at:42: \$CC \${abs_top_srcdir}/examples/simple/igraph_random_sample.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:42"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_random_sample.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:42: >expout"
+at_fn_check_prepare_trace "random.at:42"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:42: "
+at_fn_check_prepare_trace "random.at:42"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:42: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:42"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:42"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_217
+#AT_START_218
+at_fn_group_banner 218 'random.at:45' \
+  "Fisher-Yates shuffle:" "                          " 29
+at_xfail=no
+(
+  $as_echo "218. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/random.at:47: \$CC \${abs_top_srcdir}/examples/simple/igraph_fisher_yates_shuffle.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:47"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_fisher_yates_shuffle.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:47: >expout"
+at_fn_check_prepare_trace "random.at:47"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:47: "
+at_fn_check_prepare_trace "random.at:47"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/random.at:47: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "random.at:47"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/random.at:47"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_218
+#AT_START_219
+at_fn_group_banner 219 'qsort.at:24' \
+  "Regular qsort (igraph_qsort):" "                  " 30
+at_xfail=no
+(
+  $as_echo "219. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:26: \$CC \${abs_top_srcdir}/examples/simple/igraph_qsort.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:26"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_qsort.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:26: cp \${abs_top_srcdir}/examples/'simple/igraph_qsort.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:26"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_qsort.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:26: "
+at_fn_check_prepare_trace "qsort.at:26"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:26: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:26"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:26"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_219
+#AT_START_220
+at_fn_group_banner 220 'qsort.at:29' \
+  "qsort with extra argument (igraph_qsort_r):" "    " 30
+at_xfail=no
+(
+  $as_echo "220. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:31: \$CC \${abs_top_srcdir}/examples/simple/igraph_qsort_r.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:31"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_qsort_r.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:31: cp \${abs_top_srcdir}/examples/'simple/igraph_qsort_r.out' expout"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:31"
+( $at_check_trace; cp ${abs_top_srcdir}/examples/'simple/igraph_qsort_r.out' expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:31: "
+at_fn_check_prepare_trace "qsort.at:31"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/qsort.at:31: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "qsort.at:31"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/qsort.at:31"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_220
+#AT_START_221
+at_fn_group_banner 221 'matching.at:23' \
+  "Maximum bipartite matching (igraph_maximum_bipartite_matching): " "" 31
+at_xfail=no
+(
+  $as_echo "221. $at_setup_line: testing $at_desc ..."
+  $at_traceon
+
+
+
+{ set +x
+$as_echo "$at_srcdir/matching.at:25: \$CC \${abs_top_srcdir}/examples/simple/igraph_maximum_bipartite_matching.c -I\${abs_top_srcdir}/include -I\${abs_top_builddir}/include -L\${abs_top_builddir}/src/.libs -ligraph -lm  -o itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "matching.at:25"
+( $at_check_trace; $CC ${abs_top_srcdir}/examples/simple/igraph_maximum_bipartite_matching.c -I${abs_top_srcdir}/include -I${abs_top_builddir}/include -L${abs_top_builddir}/src/.libs -ligraph -lm  -o itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/matching.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/matching.at:25: >expout"
+at_fn_check_prepare_trace "matching.at:25"
+( $at_check_trace; >expout
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/matching.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/matching.at:25: "
+at_fn_check_prepare_trace "matching.at:25"
+( $at_check_trace;
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+at_fn_diff_devnull "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/matching.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+{ set +x
+$as_echo "$at_srcdir/matching.at:25: DYLD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${DYLD_LIBRARY_PATH+:\$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=\${abs_top_builddir}/src/.libs\${LD_LIBRARY_PATH+:\$LD_LIBRARY_PATH} ./itest"
+at_fn_check_prepare_notrace 'a ${...} parameter expansion' "matching.at:25"
+( $at_check_trace; DYLD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${DYLD_LIBRARY_PATH+:$DYLD_LIBRARY_PATH} LD_LIBRARY_PATH=${abs_top_builddir}/src/.libs${LD_LIBRARY_PATH+:$LD_LIBRARY_PATH} ./itest
+) >>"$at_stdout" 2>>"$at_stderr"
+at_status=$? at_failed=false
+$at_check_filter
+at_fn_diff_devnull "$at_stderr" || at_failed=:
+$at_diff expout "$at_stdout" || at_failed=:
+at_fn_check_status 0 $at_status "$at_srcdir/matching.at:25"
+$at_failed && at_fn_log_failure
+$at_traceon; }
+
+  set +x
+  $at_times_p && times >"$at_times_file"
+) 5>&1 2>&1 7>&- | eval $at_tee_pipe
+read at_status <"$at_status_file"
+#AT_STOP_221
diff -Nru igraph-0.6.5~quantal1/tools/arpack-sed.txt igraph-0.6.5/tools/arpack-sed.txt
--- igraph-0.6.5~quantal1/tools/arpack-sed.txt	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/arpack-sed.txt	1970-01-01 00:00:00.000000000 +0000
@@ -1,93 +0,0 @@
-s/dsaupd_/igraphdsaupd_/g
-s/dseupd_/igraphdseupd_/g
-s/dsaup2_/igraphdsaup2_/g
-s/dstats_/igraphdstats_/g
-s/dsesrt_/igraphdsesrt_/g
-s/dsortr_/igraphdsortr_/g
-s/dgetv0_/igraphdgetv0_/g
-s/dsaitr_/igraphdsaitr_/g
-s/dsapps_/igraphdsapps_/g
-s/dsconv_/igraphdsconv_/g
-s/dseigt_/igraphdseigt_/g
-s/dsgets_/igraphdsgets_/g
-s/dstqrb_/igraphdstqrb_/g
-s/dmout_/igraphdmout_/g
-s/ivout_/igraphivout_/g
-s/second_/igraphsecond_/g
-s/dvout_/igraphdvout_/g
-
-s/dlarnv_/igraphdlarnv_/g
-s/dlascl_/igraphdlascl_/g
-s/dlartg_/igraphdlartg_/g
-s/dlaset_/igraphdlaset_/g
-s/dlaev2_/igraphdlaev2_/g
-s/dlasr_/igraphdlasr_/g
-s/dlasrt_/igraphdlasrt_/g
-s/dgeqr2_/igraphdgeqr2_/g
-s/dlacpy_/igraphdlacpy_/g
-s/dorm2r_/igraphdorm2r_/g
-s/dsteqr_/igraphdsteqr_/g
-s/dlanst_/igraphdlanst_/g
-s/dlapy2_/igraphdlapy2_/g
-s/dlamch_/igraphdlamch_/g
-s/dlaruv_/igraphdlaruv_/g
-s/dlarfg_/igraphdlarfg_/g
-s/dlarf_/igraphdlarf_/g
-s/dlae2_/igraphdlae2_/g
-s/dlassq_/igraphdlassq_/g
-s/dlamc1_/igraphdlamc1_/g
-s/dlamc2_/igraphdlamc2_/g
-s/dlamc3_/igraphdlamc3_/g
-s/dlamc4_/igraphdlamc4_/g
-s/dlamc5_/igraphdlamc5_/g
-s/xerbla_/igraphxerbla_/g
-
-s/daxpy_/igraphdaxpy_/g
-s/dger_/igraphdger_/g
-s/dcopy_/igraphdcopy_/g
-s/dscal_/igraphdscal_/g
-s/dswap_/igraphdswap_/g
-s/dgemv_/igraphdgemv_/g
-s/ddot_/igraphddot_/g
-s/dnrm2_/igraphdnrm2_/g
-s/lsame_/igraphlsame_/g
-
-s/d_sign/igraphd_sign/g
-s/etime_/igraphetime_/g
-s/pow_dd/igraphpow_dd/g
-s/pow_di/igraphpow_di/g
-s/s_cmp/igraphs_cmp/g
-s/s_copy/igraphs_copy/g
-
-s/dnaitr/igraphdnaitr/g
-s/dnapps/igraphdnapps/g
-s/dnaup2/igraphdnaup2/g
-s/dnaupd/igraphdnaupd/g
-s/dnconv/igraphdnconv/g
-s/dlabad/igraphdlabad/g
-s/dlanhs/igraphdlanhs/g
-s/dsortc/igraphdsortc/g
-s/dneigh/igraphdneigh/g
-s/dngets/igraphdngets/g
-s/dstatn/igraphdstatn/g
-s/dtrevc/igraphdtrevc/g
-s/dlaqrb/igraphdlaqrb/g
-s/d_lg10/igraphd_lg10/g
-s/dlanv2/igraphdlanv2/g
-s/drot/igraphdrot/g
-s/idamax/igraphidamax/g
-s/dlaln2/igraphdlaln2/g
-s/dladiv/igraphdladiv/g
-s/dneupd/igraphdneupd/g
-s/dtrmm/igraphdtrmm/g
-s/dtrsen/igraphdtrsen/g
-s/dlahqr/igraphdlahqr/g
-s/dlacon/igraphdlacon/g
-s/dtrsyl/igraphdtrsyl/g
-s/dtrexc/igraphdtrexc/g
-s/dlange/igraphdlange/g
-s/dlaexc/igraphdlaexc/g
-s/dlasy2/igraphdlasy2/g
-s/dasum/igraphdasum/g
-s/i_dnnt/igraphi_dnnt/g
-s/dlarfx/igraphdlarfx/g
diff -Nru igraph-0.6.5~quantal1/tools/arpack_check.R igraph-0.6.5/tools/arpack_check.R
--- igraph-0.6.5~quantal1/tools/arpack_check.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/arpack_check.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,149 +0,0 @@
-
-# R
-
-library(igraph)
-
-callback <- function(x, extra) {
-  y <- extra %*% x
-}
-
-residual <- function(A, v, lambda) {
-  sum(abs( A %*% v - lambda * v )^2)
-}
-
-arp <- function(M, sym=TRUE, which="LM", nev=1, ncv=2*nev+2,
-                maxiter=300, ...) {
-  res <- arpack(callback, extra=M, sym=sym,
-                options=list(n=nrow(M), nev=nev, ncv=ncv,
-                  which=which, maxiter=maxiter, ...))
-  res$vectors <- cbind(res$vectors)
-  res
-}  
-
-is.principal <- function(M, lambda, eps=1e-6) {
-  e1 <- eigen(M)$values
-  max(abs(e1)) - abs(lambda) < eps && min(abs(e1-lambda)) < eps
-}
-  
-## Symmetric solver, dense matrix
-
-for (i in 1:10000) {
-  M <- matrix(sample(1:10, 100, replace=TRUE), 10)
-  M <- M+t(M)
-  res <- arp(M)
-  if (residual(M, res$vectors, res$values) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values))     { print("Gebasz2!"); break; }
-}
-
-## Symmetric solver, sparse matrix
-
-for (i in 1:10000) {
-  M <- matrix(sample(0:1, 100, replace=TRUE, prob=c(8,2)), 10)
-  M <- M+t(M)
-  res <- arp(M, nev=1, ncv=3, maxiter=10000)
-  w <- 1
-  if (residual(M, res$vectors[,w], res$values[w]) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values[w])) { print("Gebasz2!"); break; }
-}
-
-## Symmetric solver, even sparser matrix
-
-for (i in 1:10000) {
-  M <- matrix(sample(0:1, 100, replace=TRUE, prob=c(14,1)), 10)
-  M <- M+t(M)
-  res <- arp(M, nev=1, maxiter=1e7)
-  w <- 1
-  if (residual(M, res$vectors[,w], res$values[w]) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values[w])) { print("Gebasz2!"); break; }
-}
-
-## Hard one:
-
-M <- get.adjacency(graph.formula(a-b-c, d-e-f, g-h-i))
-res <- arp(M, nev=2, ncv=5)
-w <- which.max(abs(res$values))
-residual(M, res$vectors[,w], res$values[w])
-is.principal(M, res$values[w])
-
-## Solution: nev=2, ncv=5, and always check which eigenvalue is
-## larger.
-
-#################################################################
-
-## Non-symmetric case, dense
-
-for (i in 1:10000) {
-  M <- matrix(sample(1:10, 100, replace=TRUE), 10)
-  res <- arp(M, sym=FALSE)
-  if (residual(M, res$vectors, res$values) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values))     { print("Gebasz2!"); break; }
-}
-
-## Non-symmetric, sparse
-
-for (i in 1:10000) {
-  M <- matrix(sample(0:1, 100, replace=TRUE, prob=c(8,2)), 10)
-  res <- arp(M, nev=3, ncv=7, sym=FALSE)
-  w <- which.max(abs(res$values))
-  if (residual(M, res$vectors[,w], res$values[w]) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values[w])) { print("Gebasz2!"); break; }
-}
-
-## Non-symmetric solver, even sparser matrix
-
-for (i in 1:10000) {
-  cat(".")
-  M <- matrix(sample(0:1, 100, replace=TRUE, prob=c(9,1)), 10)
-  res <- arp(M, nev=3, ncv=7, sym=FALSE, maxiter=10000)
-  w <- which.max(abs(res$values))
-  if (residual(M, res$vectors[,w], res$values[w]) > 1e-12) {
-    print("Gebasz!" ); break;
-  }
-  if (!is.principal(M, res$values[w])) { print("Gebasz2!"); break; }
-}
-
-############################
-
-M <- matrix(byrow=TRUE, nc=9,
-            c(0,0,0,0,0,0,0,0,0,
-              0,0,0,0,0,0,0,0,1,
-              0,0,0,0,0,0,0,0,1,
-              0,0,0,0,0,0,0,0,0,
-              0,1,0,1,0,0,0,0,0,
-              0,1,0,0,0,0,0,0,0,
-              0,0,0,1,0,0,0,0,0,
-              1,0,0,0,0,0,0,0,1,
-              0,0,0,0,0,0,1,0,0))
-
-arp(M, nev=3, ncv=7, sym=FALSE)$values
-
-
-#########################
-## Components
-
-cc <- function(x) {
-  g1 <- erdos.renyi.game(10, 2/10, directed=TRUE)
-  g2 <- erdos.renyi.game(10, 2/10, directed=TRUE)
-  g <- g1 %du% g2
-  
-  e1 <- eigen(get.adjacency(g1))$values
-  e2 <- eigen(get.adjacency(g2))$values
-  ee <- eigen(get.adjacency(g))$values
-
-  max(abs(sort(Re(c(e1,e2))) - sort(Re(ee))),
-      abs(sort(Im(c(e1,e2))) - sort(Im(ee))))
-}
-
-ccdiff <- sapply(1:1000, cc)
-
-
diff -Nru igraph-0.6.5~quantal1/tools/arpack_check2.R igraph-0.6.5/tools/arpack_check2.R
--- igraph-0.6.5~quantal1/tools/arpack_check2.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/arpack_check2.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,49 +0,0 @@
-
-# R
-
-library(igraph)
-
-callback <- function(x, extra) {
-  y <- extra %*% x
-}
-
-residual <- function(A, v, lambda) {
-  sum(abs( A %*% v - lambda * v )^2)
-}
-
-arp <- function(M, sym=TRUE, which="LM", nev=1, maxiter=300, ...) {
-  res <- arpack(callback, extra=M, sym=sym,
-                options=list(n=nrow(M), nev=nev, ncv=2*nev+2,
-                  which=which, maxiter=maxiter, ...))
-  res$vectors <- cbind(res$vectors)
-  res
-}  
-
-is.principal <- function(M, lambda, eps=1e-4) {
-  e1 <- eigen(M)$values
-  abs(max(abs(e1)) - abs(lambda)) < eps
-}
-
-for (i in 1:10000) {
-  cat(".")
-  g <- erdos.renyi.game(30, 1/30, directed=TRUE)
-  M <- get.adjacency(g)
-  clu <- clusters(g, mode="strong")$membership
-  ae <- numeric()
-  for (x in seq_along(unique(clu))) {
-    v <- which(clu==x)
-    if (length(v)==1) {
-      ae <- c(ae, 0)
-    } else if (length(v)<=13) {
-      ae <- c(ae, eigen(M[v,v])$values)
-    } else {
-      M2 <- M[v,v]
-      ae <- c(ae, arp(M2, nev=6, ncv=min(13,length(v)), sym=FALSE)$values)
-    }
-  }
-  pae <- ae[ which.max(abs(ae)) ]
-  if (!is.principal(M, pae)) { print("Gebasz2!"); break; }  
-}
-cat("\n")
-
-
diff -Nru igraph-0.6.5~quantal1/tools/arpack_check3.R igraph-0.6.5/tools/arpack_check3.R
--- igraph-0.6.5~quantal1/tools/arpack_check3.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/arpack_check3.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,56 +0,0 @@
-
-# R
-
-library(igraph)
-
-arpack2 <- function (func, extra = NULL, sym = FALSE,
-                    options = igraph.arpack.default, 
-                    env = parent.frame(), complex = !sym) {
-  options.tmp <- igraph.arpack.default
-  options.tmp[names(options)] <- options
-  options <- options.tmp
-  if (sym && complex) {
-    complex <- FALSE
-    warning("Symmetric matrix, setting `complex' to FALSE")
-    }
-  on.exit(.Call("R_igraph_finalizer", PACKAGE = "igraph"))
-  .Call("R_igraph_arpack", func, extra, options, env, 
-        sym, PACKAGE = "igraph")
-}
-
-
-callback <- function(x, extra) {
-  y <- extra %*% x
-}
-
-residual <- function(A, v, lambda) {
-  sum(abs( A %*% v - lambda * v )^2)
-}
-
-arp <- function(M, sym=TRUE, which="LM", nev=1, maxiter=300, ...) {
-  res <- arpack(callback, extra=M, sym=sym,
-                options=list(n=nrow(M), nev=nev, ncv=2*nev+2,
-                  which=which, maxiter=maxiter, ...))
-  res$vectors <- cbind(res$vectors)
-  res
-}  
-
-arp2 <- function(M, sym=TRUE, which="LM", nev=1, maxiter=300, ...) {
-  res <- arpack2(callback, extra=M, sym=sym,
-                 options=list(n=nrow(M), nev=nev, ncv=2*nev+2,
-                   which=which, maxiter=maxiter, ...))
-  res$vectors <- cbind(res$vectors)
-  res
-}  
-
-is.principal <- function(M, lambda, eps=1e-6) {
-  e1 <- eigen(M)$values
-  max(abs(e1)) - abs(lambda) < eps && min(abs(e1-lambda)) < eps
-}
-  
-M <- matrix(sample(0:1, 100, replace=TRUE, prob=c(8,2)), 10)
-res <- arp(M, nev=3, ncv=7, sym=FALSE, maxiter=10000)
-res2 <- arp2(M, nev=3, ncv=7, sym=FALSE, maxiter=10000)
-
-gc()
-
diff -Nru igraph-0.6.5~quantal1/tools/bump_version.sh igraph-0.6.5/tools/bump_version.sh
--- igraph-0.6.5~quantal1/tools/bump_version.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/bump_version.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,74 +0,0 @@
-#!/bin/sh
-#
-# Script that should be run whenever we bump the version number of
-# igraph.
-#
-# This script adjusts the version numbers in the following files:
-#
-#   - configure.in
-#   - interfaces/java/build.xml
-#   - interfaces/R/configure.in
-#   - examples/simple/gml.out
-#   - examples/simple/cattributes2.out
-#   - msvc/igraphtest/igraphtest.vcproj
-#   - tools/launchpad_nightly.recipe
-#   - debian/changelog
-
-set -e
-set -u
-
-if [ $# -lt 1 ]; then
-	echo "Usage: $0 version"
-	exit 1
-fi
-
-VERSION="$1"
-
-# Step to the root of the source tree
-cd `dirname $0`/..
-
-# Adjust configure.in
-sed -e "s/AC_INIT(igraph, [^,]*,/AC_INIT(igraph, ${VERSION},/" \
-	-e "s/AM_INIT_AUTOMAKE(igraph, [^)]*)/AM_INIT_AUTOMAKE(igraph, ${VERSION})/" \
-	-i configure.in
-
-# Adjust interfaces/java/build.xml
-sed -e "s/property name=\"package\.version\" value=\"[^\"]*\"/property name=\"package.version\" value=\"${VERSION}\"/" \
-	-i interfaces/java/build.xml
-
-# Adjust interfaces/R/configure.in
-sed -e "s/AC_INIT(igraph, [^,]*,/AC_INIT(igraph, ${VERSION},/" \
-	-i configure.in
-
-# Adjust examples/simple/gml.out
-sed -e "s/igraph version [^ ]*/igraph version ${VERSION}/" \
-	-i examples/simple/gml.out
-
-# Adjust examples/simple/cattributes2.out
-sed -e "s/igraph version [^ ]*/igraph version ${VERSION}/" \
-	-i examples/simple/cattributes2.out
-
-# Adjust msvc/igraphtest/igraphtest.vcproj
-sed -e "s/igraph-[^-]*-msvc/igraph-${VERSION}-msvc/g" \
-	-i msvc/igraphtest/igraphtest.vcproj
-
-# Adjust tools/launchpad_nightly.recipe
-sed -e "s/deb-version [^~]*/deb-version ${VERSION}/" \
-	-e "s|lp:igraph/[^-]*-main|lp:igraph/${VERSION}-main|" \
-	-i tools/launchpad_nightly.recipe
-
-# Adjust debian/changelog
-DATE="`date -R`"
-cat >debian/changelog.new <<EOF
-igraph (${VERSION}) unstable; urgency=low
-
-  * Bumped version number to ${VERSION}.
-
- -- Tamas Nepusz <ntamas@gmail.com>  ${DATE}
-
-EOF
-cat debian/changelog >>debian/changelog.new
-mv debian/changelog.new debian/changelog
-
-# Done.
-echo "Successfully bumped version number to ${VERSION}."
diff -Nru igraph-0.6.5~quantal1/tools/connectivity_check.R igraph-0.6.5/tools/connectivity_check.R
--- igraph-0.6.5~quantal1/tools/connectivity_check.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/connectivity_check.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,58 +0,0 @@
-
-R
-
-library(igraph)
-
-# Create the graph
-
-g <- simplify(barabasi.game(10, m=5, directed=F))
-g <- simplify(erdos.renyi.game(20, p=6/20, directed=F))
-g <- simplify(graph.union(graph.star(20, mode="undirected"),
-                          erdos.renyi.game(20, p=1/20)))
-g <- graph( c(0,1, 0,1, 0,2, 0,2, 1,2, 1,2, 2,3, 2,3, 2,4, 2,4, 3,4),
-           direc=FALSE)
-el <- get.edgelist(g)+1
-write(t(el), "edgelist.txt", ncol=2)
-
-math.command <- ' <<DiscreteMath`Combinatorica`;
-edges = ReadList["edgelist.txt", {Number, Number}];
-g = FromOrderedPairs[edges, Type -> Undirected];
-VertexConnectivity[g]
-EdgeConnectivity[g]'
-
-command <- paste("echo ", "'", math.command, "'", "|MathKernel")
-output <- system(command, int=T)
-output <- output[ grep("^Out", output) ]
-output <- sub("^.* ", "", output)
-output <- as.numeric(output)
-
-igraph.output <- c(vertex.connectivity(g), edge.connectivity(g))
-
-print(output)
-print(igraph.output)
-
-#######################################
-
-g <- erdos.renyi.game(50, p=15/50)
-date()
-vertex.connectivity(g)
-edge.connectivity(g)
-date()
-
-el <- get.edgelist(g)+1
-write(t(el), "edgelist.txt", ncol=2)
-
-math.command <- ' <<DiscreteMath`Combinatorica`;
-edges = ReadList["edgelist.txt", {Number, Number}];
-g = FromOrderedPairs[edges, Type -> Undirected];
-VertexConnectivity[g]
-EdgeConnectivity[g]'
-
-command <- paste("echo ", "'", math.command, "'", "|MathKernel")
-date()
-output <- system(command, int=T)
-date()
-output <- output[ grep("^Out", output) ]
-output <- sub("^.* ", "", output)
-output <- as.numeric(output)
-
diff -Nru igraph-0.6.5~quantal1/tools/create-debian-packages.sh igraph-0.6.5/tools/create-debian-packages.sh
--- igraph-0.6.5~quantal1/tools/create-debian-packages.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/create-debian-packages.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,158 +0,0 @@
-#!/bin/bash
-
-DEST_DIR_ROOT=$HOME/packages
-CURR_DIR=`pwd`
-BZR_IGRAPH_ROOT=$HOME/bzr/igraph
-
-SIGN=yes
-SIGNING_GPG_KEY=D6360653
-
-#####################################################################
-
-
-if [ $# -ne 3 ]; then
-    echo "Usage: $0 igraph_version debian_revision series"
-	echo "where igraph_version is the version number of igraph,"
-	echo "debian_revision is the Debian package revision number"
-	echo "and series is the distribution series (e.g., unstable,"
-	echo "karmic, jaunty etc)."
-	echo ""
-	echo "For the Launchpad PPA, you have to prepare a package"
-	echo "for the two most recent Ubuntu series"
-	exit 1
-fi
-
-IGRAPH_VERSION=$1
-DEBIAN_REVISION=$2
-SERIES=$3
-
-DEST_DIR=${DEST_DIR_ROOT}/${SERIES}
-
-if [ x$SIGN == xyes ]; then
-  SIGN_OPTIONS="-k0x${SIGNING_GPG_KEY}"
-else
-  SIGN_OPTIONS="-us -uc"
-fi
-
-BAZAAR_BRANCH=`echo $IGRAPH_VERSION | awk 'BEGIN { FS="."; OFS="." } ; { printf "%s.%s-main", $1, $2 }'`
-
-function prechecks {
-  if [ ! -d ${BZR_IGRAPH_ROOT} ]; then
-    echo ${BZR_IGRAPH_ROOT} does not exist or is not a directory!
-    exit 1
-  fi
-
-  if [ x$SIGN == xyes ]; then
-    which gpg >/dev/null || ( echo "gpg not installed, exiting"; exit 1 )
-    gpg --list-secret-keys ${SIGNING_GPG_KEY} >/dev/null || ( echo "Secret key not found: ${SIGNING_GPG_KEY}, exiting"; exit 1 )
-  fi
-}
-
-function install_build_dependencies {
-  apt-get update
-  apt-get -y --no-install-recommends install \
-          cdbs debhelper devscripts fakeroot automake autoconf gcc g++ \
-          pkg-config flex bison build-essential libxml2-dev libglpk-dev \
-          libarpack2-dev libgmp3-dev libxml2-dev libblas-dev liblapack-dev \
-          python-all-dev python-central python-epydoc texlive-latex-base \
-		  texlive-latex-extra libtool source-highlight docbook2x
-}
-
-function make_destdir {
-  mkdir -p ${DEST_DIR}
-}
-
-function bazaar_update {
-  pushd ${BZR_IGRAPH_ROOT}/${BAZAAR_BRANCH}
-  bzr update
-  popd
-}
-
-function create_igraph_debian_pkg {
-  if [ -f ${CURR_DIR}/igraph_$1.orig.tar.gz ]; then
-    cp ${CURR_DIR}/igraph_$1.orig.tar.gz .
-  else
-    wget -O igraph_$1.orig.tar.gz http://switch.dl.sourceforge.net/sourceforge/igraph/igraph-$1.tar.gz
-  fi
-  tar -xvvzf igraph_$1.orig.tar.gz
-  cd igraph-$1
-  cp -r ${BZR_IGRAPH_ROOT}/${BAZAAR_BRANCH}/debian .
-  if [ x$2 != x0 ]; then
-    cat debian/changelog.in | sed -e "s/@VERSION@/@VERSION@-$2/g" >debian/changelog.in.new
-    mv debian/changelog.in.new debian/changelog.in
-  fi
-  # debian/prepare
-  cat debian/changelog | sed -e "s/unstable/${SERIES}/g" >debian/changelog.new
-  mv debian/changelog.new debian/changelog
-  debuild -b ${SIGN_OPTIONS}
-  debuild -S -sa ${SIGN_OPTIONS}
-  cd ..
-}
-
-function install_igraph_debian_pkg {
-  if [ x$2 != x0 ]; then
-    FULLVERSION=$1-$2
-  else
-    FULLVERSION=$1
-  fi
-  ${SUDO} dpkg -i libigraph0_${FULLVERSION}_*.deb libigraph-dev_${FULLVERSION}_*.deb || exit 3
-}
-
-function remove_igraph_debian_pkg {
-  dpkg -r libigraph0 libigraph-dev
-}
-
-function compile_python_interface {
-  if [ -f ${CURR_DIR}/python-igraph_$1.orig.tar.gz ]; then
-    cp ${CURR_DIR}/python-igraph_$1.orig.tar.gz .
-  else
-    wget -O python-igraph_$1.orig.tar.gz http://pypi.python.org/packages/source/p/python-igraph/python-igraph-$1.tar.gz
-  fi
-  tar -xvvzf python-igraph_$1.orig.tar.gz
-  cd python-igraph-$1
-  if [ x$2 != x0 ]; then
-    cat debian/changelog.in | sed -e "s/@VERSION@/@VERSION@-$2/g" >debian/changelog.in.new
-  fi
-  mv debian/changelog.in.new debian/changelog.in
-  debian/prepare
-  cat debian/changelog | sed -e "s/unstable/${SERIES}/g" >debian/changelog.new
-  mv debian/changelog.new debian/changelog
-  debuild -b ${SIGN_OPTIONS}
-  debuild -S -sa ${SIGN_OPTIONS}
-  cd ..
-}
-
-function move_packages {
-  mv igraph_* libigraph* python-igraph_* python-igraph-doc_* ${DEST_DIR}
-}
-
-function remove_build_dir {
-  cd /
-  rm -rf ${BUILD_DIR}
-}
-
-prechecks || exit 1
-
-BUILD_DIR=`mktemp -d`
-cd ${BUILD_DIR}
-trap "{ cd /; rm -rf \"${BUILD_DIR}\"; exit 255; }" INT EXIT TERM
-
-if [ `id -u` != 0 ]; then
-  echo "Not running as root, skipping installation of build-deps."
-  SUDO=sudo
-else
-  install_build_dependencies
-  SUDO=
-fi
-make_destdir
-bazaar_update
-create_igraph_debian_pkg ${IGRAPH_VERSION} ${DEBIAN_REVISION}
-install_igraph_debian_pkg ${IGRAPH_VERSION} ${DEBIAN_REVISION}
-compile_python_interface ${IGRAPH_VERSION} ${DEBIAN_REVISION}
-remove_igraph_debian_pkg
-move_packages
-remove_build_dir
-
-echo ""
-echo "Commands to upload packages to the Launchpad PPA:"
-echo "dput ppa:igraph/ppa <source.changes>"
diff -Nru igraph-0.6.5~quantal1/tools/create-msvc-projectfile.py igraph-0.6.5/tools/create-msvc-projectfile.py
--- igraph-0.6.5~quantal1/tools/create-msvc-projectfile.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/create-msvc-projectfile.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,66 +0,0 @@
-#! /usr/bin/env python
-
-import sys
-import subprocess
-import os.path
-
-# Some notes:
-# - we have some sources with .cc extensions, these are marked as type 0
-# - we have some non-standard header files, e.g. .hh, .pmt, these are type 2
-
-srctext = """                       <File
-                               RelativePath=".\src\%s"
-                               FileType="0">
-                       </File>"""
-
-headtext = """                       <File
-                               RelativePath=".\include\%s"
-                               FileType="2">
-                       </File>"""
-headptext = """                       <File
-                               RelativePath=".\src\%s"
-                               FileType="2">
-                       </File>"""
-
-def runmake(makefile, target):
-    out = subprocess.check_output("make -q -C " + os.path.dirname(makefile) + 
-                                  " -f " + os.path.basename(makefile) + 
-                                  " " + target, shell=True)
-    return out.replace("/", "\\")
-
-def rreplace(s, old, new, occurrence):
-    li = s.rsplit(old, occurrence)
-    return new.join(li)
-
-def main():
-    if len(sys.argv) != 4:
-        print "Error: need three arguments"
-        sys.exit(1)
-    package = sys.argv[1]
-    projectfile = sys.argv[2]
-    makefile = sys.argv[3]
-
-    proj = open(projectfile).read()
-    sources = runmake(makefile, "echosources").split()
-    headers = runmake(makefile, "echoheaders").split()
-    headersprivate = runmake(makefile, "echoheadersprivate").split()
-
-    # lex and bison stuff
-    headers2 = [ rreplace(s, ".y", ".h",1) for s in sources if s[-2:]==".y" ]
-    sources = [ rreplace(s, ".l", ".c", 1) for s in sources ]
-    sources = [ rreplace(s, ".y", ".c", 1) for s in sources ]
-
-    stext = "\n".join([ srctext % s for s in sources ])
-    htext = "\n".join([ headtext % s for s in headers ])
-    hptext = "\n".join([ headptext % s for s in headersprivate + headers2 ])
-
-    proj = str.replace(proj, "<!-- SOURCE-FILES -->", stext)
-    proj = str.replace(proj, "<!-- HEADER-FILES -->", htext + "\n" + hptext)
-
-    out_file = open(package + "/igraph.vcproj", "w")
-    out_file.write(proj)
-    out_file.close()
-    
-if __name__ == "__main__":
-    main()
-
diff -Nru igraph-0.6.5~quantal1/tools/fatbuild.sh igraph-0.6.5/tools/fatbuild.sh
--- igraph-0.6.5~quantal1/tools/fatbuild.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/fatbuild.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,338 +0,0 @@
-#!/bin/sh
-#
-# Build a fat binary on Mac OS X
-#
-# This script is based on fatbuild.sh from libsdl
-
-# Number of CPUs (for make -j)
-NCPU=`sysctl -n hw.ncpu`
-if test x$NJOB = x; then
-    NJOB=$NCPU
-fi
-
-# GCC Version to use goes here.
-GCC_VERSION="4.2"
-GCC_VERSION_PATCHLEVEL="4.2.1"
-
-# Whether to build PPC binaries as well
-BUILD_PPC=0
-
-# Mac OS X SDK versions for 32-bit and 64-bit builds go here
-SDK_VERSION_32="10.7"
-SDK_VERSION_64="10.7"
-
-# Generic configure flags you always want go here.
-CONFIG_GENERIC="--disable-gmp"
-
-# Generic, cross-platform CFLAGS you always want go here.
-CFLAGS="-O3"
-
-# PowerPC 32-bit configure flags (10.4 runtime compatibility)
-CONFIG_PPC="--build=`uname -p`-apple-darwin --host=powerpc-apple-darwin"
-
-# Path leading to /Developer
-DEV_PATH="/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform"
-if [ ! -d "${DEV_PATH}" ]; then
-	# SDKs for older version of XCode were placed in /Developer only
-	DEV_PATH=""
-fi
-
-# Determine gcc and g++ path
-GCC_PATH=`which gcc-${GCC_VERSION}`
-if [ "x${GCC_PATH}" = x ]; then
-	GCC_PATH=`which gcc`
-fi
-GCXX_PATH=`which g++-${GCC_VERSION}`
-if [ "x${GCXX_PATH}" = x ]; then
-	GCXX_PATH=`which g++`
-fi
-
-# PowerPC 32-bit compiler flags
-CC_PPC="${GCC_PATH} -arch ppc"
-CXX_PPC="${GCXX_PATH} -arch ppc"
-CFLAGS_PPC="-mmacosx-version-min=10.4"
-CPPFLAGS_PPC="-DMAC_OS_X_VERSION_MIN_REQUIRED=1040 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/System/Library/Frameworks \
--I${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/usr/lib/gcc/powerpc-apple-darwin11/${GCC_VERSION_PATCHLEVEL}/include \
--isystem /Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/usr/include"
-
-# PowerPC 32-bit linker flags
-LFLAGS_PPC="-arch ppc -Wl,-headerpad_max_install_names -mmacosx-version-min=10.4 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/System/Library/Frameworks \
--L${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/usr/lib/gcc/powerpc-apple-darwin11/${GCC_VERSION_PATCHLEVEL} \
--Wl,-syslibroot,${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk"
-
-# PowerPC 64-bit configure flags (${SDK_VERSION_64} runtime compatibility)
-CONFIG_PPC64="--build=`uname -p`-apple-darwin --host=powerpc-apple-darwin"
-
-# PowerPC 64-bit compiler flags
-CC_PPC64="${GCC_PATH} -arch ppc64"
-CXX_PPC64="${GCXX_PATH} -arch ppc64"
-CFLAGS_PPC64="-mmacosx-version-min=${SDK_VERSION_64}"
-CPPFLAGS_PPC64="-DMAC_OS_X_VERSION_MIN_REQUIRED=1050 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/System/Library/Frameworks \
--I${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/lib/gcc/powerpc-apple-darwin11/${GCC_VERSION_PATCHLEVEL}/include \
--isystem ${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/include"
-
-# PowerPC 64-bit linker flags
-LFLAGS_PPC64="-arch ppc64 -Wl,-headerpad_max_install_names -mmacosx-version-min=${SDK_VERSION_64} \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/System/Library/Frameworks \
--L${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/lib/gcc/powerpc-apple-darwin11/${GCC_VERSION_PATCHLEVEL}/ppc64 \
--Wl,-syslibroot,${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk"
-
-# Intel 32-bit configure flags (${SDK_VERSION_64} runtime compatibility)
-CONFIG_X86="--build=`uname -p`-apple-darwin --host=i386-apple-darwin"
-
-# They changed this to "darwin11" in Xcode 3.2 (Snow Leopard).
-GCCUSRPATH_X86="${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/lib/gcc/i686-apple-darwin11/${GCC_VERSION_PATCHLEVEL}"
-if [ ! -d "$GCCUSRPATH_X86" ]; then
-    echo "Couldn't find any GCC usr path for x86"
-	echo "Tried: $GCCUSRPATH_X86"
-    exit 1
-fi
-
-# Intel 32-bit compiler flags
-CC_X86="${GCC_PATH} -arch i386"
-CXX_X86="${GCXX_PATH} -arch i386"
-CFLAGS_X86="-mmacosx-version-min=10.4"
-CPPFLAGS_X86="-DMAC_OS_X_VERSION_MIN_REQUIRED=1040 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/System/Library/Frameworks \
--I$GCCUSRPATH_X86/include \
--isystem ${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/usr/include"
-
-# Intel 32-bit linker flags
-LFLAGS_X86="-arch i386 -Wl,-headerpad_max_install_names -mmacosx-version-min=10.4 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk/System/Library/Frameworks \
--L$GCCUSRPATH_X86 \
--Wl,-syslibroot,${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_32}.sdk"
-
-# Intel 64-bit configure flags (${SDK_VERSION_64} runtime compatibility)
-CONFIG_X64="--build=`uname -p`-apple-darwin --host=i386-apple-darwin"
-
-# Intel 64-bit compiler flags
-CC_X64="${GCC_PATH} -arch x86_64"
-CXX_X64="${GCXX_PATH} -arch x86_64"
-CFLAGS_X64="-mmacosx-version-min=${SDK_VERSION_64}"
-CPPFLAGS_X64="-DMAC_OS_X_VERSION_MIN_REQUIRED=1050 \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/System/Library/Frameworks \
--I${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/lib/gcc/i686-apple-darwin11/${GCC_VERSION_PATCHLEVEL}/include \
--isystem ${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/include"
-
-# Intel 64-bit linker flags
-LFLAGS_X64="-arch x86_64 -Wl,-headerpad_max_install_names -mmacosx-version-min=${SDK_VERSION_64} \
--F${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/System/Library/Frameworks \
--L${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk/usr/lib/gcc/i686-apple-darwin11/${GCC_VERSION_PATCHLEVEL}/x86_64 \
--Wl,-syslibroot,${DEV_PATH}/Developer/SDKs/MacOSX${SDK_VERSION_64}.sdk"
-
-#
-# Find the configure script
-#
-srcdir=`dirname $0`/..
-auxdir=$srcdir/tools
-cd $srcdir
-
-#
-# Figure out which phase to build:
-# all,
-# configure, configure-ppc, configure-ppc64, configure-x86, configure-x64
-# make, make-ppc, make-ppc64, make-x86, make-x64, merge
-# install
-# clean
-if test x"$1" = x; then
-    phase=all
-else
-    phase="$1"
-fi
-case $phase in
-    all)
-		if [ $BUILD_PPC = 1 ]; then
-			configure_ppc="yes"
-			configure_ppc64="yes"
-			make_ppc="yes"
-			make_ppc64="yes"
-		fi
-		configure_x86="yes"
-		configure_x64="yes"
-        make_x86="yes"
-        make_x64="yes"
-        merge="yes"
-        ;;
-    configure)
-		if [ $BUILD_PPC = 1 ]; then
-			configure_ppc="yes"
-			configure_ppc64="yes"
-		fi
-        configure_x86="yes"
-        configure_x64="yes"
-        ;;
-    configure-ppc)
-        configure_ppc="yes"
-        ;;
-    configure-ppc64)
-        configure_ppc64="yes"
-        ;;
-    configure-x86)
-        configure_x86="yes"
-        ;;
-    configure-x64)
-        configure_x64="yes"
-        ;;
-    make)
-		if [ $BUILD_PPC = 1 ]; then
-			make_ppc="yes"
-			make_ppc64="yes"
-		fi
-        make_x86="yes"
-        make_x64="yes"
-        merge="yes"
-        ;;
-    make-ppc)
-        make_ppc="yes"
-        ;;
-    make-ppc64)
-        make_ppc64="yes"
-        ;;
-    make-x86)
-        make_x86="yes"
-        ;;
-    make-x64)
-        make_x64="yes"
-        ;;
-    merge)
-        merge="yes"
-        ;;
-    clean)
-        clean_ppc="yes"
-        clean_ppc64="yes"
-        clean_x86="yes"
-        clean_x64="yes"
-        ;;
-    clean-ppc)
-        clean_ppc="yes"
-        ;;
-    clean-ppc64)
-        clean_ppc64="yes"
-        ;;
-    clean-x86)
-        clean_x86="yes"
-        ;;
-    clean-x64)
-        clean_x64="yes"
-        ;;
-    *)
-        echo "Usage: $0 [all|configure[-ppc|-ppc64|-x86|-x64]|make[-ppc|-ppc64|-x86|-x64]|merge|clean[-ppc|-ppc64|-x86|-x64]]"
-        exit 1
-        ;;
-esac
-case `uname -p` in
-    powerpc)
-        native_path=ppc
-        ;;
-    powerpc64)
-        native_path=ppc64
-        ;;
-    *86)
-        native_path=x86
-        ;;
-    x86_64)
-        native_path=x64
-        ;;
-    *)
-        echo "Couldn't figure out native architecture path"
-        exit 1
-        ;;
-esac
-
-#
-# Create the build directories
-#
-for dir in fatbuild fatbuild/ppc fatbuild/ppc64 fatbuild/x86 fatbuild/x64; do
-    if test -d $dir; then
-        :
-    else
-        mkdir $dir || exit 1
-    fi
-done
-
-#
-# Build the PowerPC 32-bit binary
-#
-if test x$configure_ppc = xyes; then
-    (cd fatbuild/ppc && \
-     sh ../../configure $CONFIG_GENERIC $CONFIG_PPC CC="$CC_PPC" CXX="$CXX_PPC" CFLAGS="$CFLAGS $CFLAGS_PPC" CPPFLAGS="$CPPFLAGS_PPC" LDFLAGS="$LFLAGS_PPC") || exit 2
-fi
-if test x$make_ppc = xyes; then
-    (cd fatbuild/ppc && ls src && make -j$NJOB) || exit 3
-fi
-
-#
-# Build the PowerPC 64-bit binary
-#
-if test x$configure_ppc64 = xyes; then
-    (cd fatbuild/ppc64 && \
-     sh ../../configure $CONFIG_GENERIC $CONFIG_PPC64 CC="$CC_PPC64" CXX="$CXX_PPC64" CFLAGS="$CFLAGS $CFLAGS_PPC64" CPPFLAGS="$CPPFLAGS_PPC64" LDFLAGS="$LFLAGS_PPC64") || exit 2
-fi
-if test x$make_ppc64 = xyes; then
-    (cd fatbuild/ppc64 && ls src && make -j$NJOB) || exit 3
-fi
-
-#
-# Build the Intel 32-bit binary
-#
-if test x$configure_x86 = xyes; then
-    (cd fatbuild/x86 && \
-     sh ../../configure $CONFIG_GENERIC $CONFIG_X86 CC="$CC_X86" CXX="$CXX_X86" CFLAGS="$CFLAGS $CFLAGS_X86" CPPFLAGS="$CPPFLAGS_X86" LDFLAGS="$LFLAGS_X86") || exit 2
-fi
-if test x$make_x86 = xyes; then
-    (cd fatbuild/x86 && make -j$NJOB) || exit 3
-fi
-
-#
-# Build the Intel 32-bit binary
-#
-if test x$configure_x64 = xyes; then
-    (cd fatbuild/x64 && \
-     sh ../../configure $CONFIG_GENERIC $CONFIG_X64 CC="$CC_X64" CXX="$CXX_X64" CFLAGS="$CFLAGS $CFLAGS_X64" CPPFLAGS="$CPPFLAGS_X64" LDFLAGS="$LFLAGS_X64") || exit 2
-fi
-if test x$make_x64 = xyes; then
-    (cd fatbuild/x64 && make -j$NJOB) || exit 3
-fi
-
-#
-# Combine into fat binary
-#
-if test x$merge = xyes; then
-    cd fatbuild
-    output=.
-    target=`find . -mindepth 4 -maxdepth 4 -type f -name '*.dylib' | head -1 | sed 's|.*/||'`
-    (lipo -create -o $output/$target `find . -mindepth 4 -maxdepth 4 -type f -name "*.dylib"` &&
-     ln -sf $target $output/libigraph.dylib &&
-	 lipo -create -o $output/libigraph.a `find . -mindepth 4 -maxdepth 4 -type f -name "libigraph.a"` &&
-     cp $native_path/src/.libs/libigraph.la $output &&
-     cp $native_path/src/.libs/libigraph.lai $output) || exit 4
-     echo "Build complete!"
-     echo "Files can be found in the fatbuild directory."
-    cd ..
-fi
-
-#
-# Clean up
-#
-do_clean()
-{
-    echo $*
-    $* || exit 6
-}
-if test x$clean_x86 = xyes; then
-    do_clean rm -r build/x86
-fi
-if test x$clean_x64 = xyes; then
-    do_clean rm -r build/x64
-fi
-if test x$clean_ppc = xyes; then
-    do_clean rm -r build/ppc
-fi
-if test x$clean_ppc64 = xyes; then
-    do_clean rm -r build/ppc64
-fi
-
diff -Nru igraph-0.6.5~quantal1/tools/getglpk.sh igraph-0.6.5/tools/getglpk.sh
--- igraph-0.6.5~quantal1/tools/getglpk.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/getglpk.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,281 +0,0 @@
-#! /bin/sh
-
-if [ -d ../optional/glpk ]; then 
-    echo "GLPK directory '../optional/glpk' already exists, remove it first"
-#    exit 1
-fi
-
-THIS=`pwd`
-IDIR=${THIS}/../optional/glpk/
-mkdir $IDIR
-
-GLPK="http://ftp.gnu.org/gnu/glpk/glpk-4.45.tar.gz"
-TARGZ=`echo $GLPK | sed 's/^.*\///'`
-DIR=`echo $TARGZ | sed 's/\.tar\.gz$//'`
-
-cd /tmp
-if [ ! -f $TARGZ ]; then curl -O $GLPK; fi
-tar xzf $TARGZ
-
-#cp -R $DIR/include/*.h $DIR/src/*.{c,h} $DIR/src/amd $DIR/src/colamd \
-#    $DIR/{README,COPYING} $IDIR
-
-cd $THIS
-
-SRC=`ls ../optional/glpk/*.h ../optional/glpk/*.c`
-SRC2=`ls ../optional/glpk/amd/*.h ../optional/glpk/amd/*.c`
-SRC3=`ls ../optional/glpk/colamd/*.h ../optional/glpk/colamd/*.c`
-
-INC=$IDIR/glpk.inc
-
-/bin/echo -n "GLPK = " > $INC
-for i in $SRC; do /bin/echo -n "$i " >>$INC; done
-for i in $SRC2; do /bin/echo -n "$i " >>$INC; done
-for i in $SRC3; do /bin/echo -n "$i " >>$INC; done
-
-# Need a patch to get rid of an abort() call. We call igraph_error()
-# instead.
-
-patch -p1 -d ../optional/glpk <<-EOF
-diff -ru glpk.old/glpenv01.c glpk/glpenv01.c
---- glpk.old/glpenv01.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpenv01.c	2012-03-30 12:03:54.000000000 -0400
-@@ -23,6 +23,7 @@
- ***********************************************************************/
- 
- #include "glpapi.h"
-+#include "igraph_error.h"
- 
- /***********************************************************************
- *  NAME
-@@ -126,19 +127,15 @@
-       {  /* not initialized yet; perform initialization */
-          if (glp_init_env() != 0)
-          {  /* initialization failed; display an error message */
--            fprintf(stderr, "GLPK initialization failed\n");
--            fflush(stderr);
--            /* and abnormally terminate the program */
--            abort();
-+	   IGRAPH_ERROR("GLPK initialization failed", IGRAPH_EGLP);
-          }
-          /* initialization successful; retrieve the pointer */
-          env = tls_get_ptr();
-       }
-       /* check if the environment block is valid */
-       if (env->magic != ENV_MAGIC)
--      {  fprintf(stderr, "Invalid GLPK environment\n");
--         fflush(stderr);
--         abort();
-+      {  
-+	IGRAPH_ERROR("Invalid GLPK environment", IGRAPH_EGLP);
-       }
-       return env;
- }
-@@ -200,9 +197,8 @@
-       if (env == NULL) return 1;
-       /* check if the environment block is valid */
-       if (env->magic != ENV_MAGIC)
--      {  fprintf(stderr, "Invalid GLPK environment\n");
--         fflush(stderr);
--         abort();
-+      {  
-+	 IGRAPH_ERROR("Invalid GLPK environment", IGRAPH_EGLP);
-       }
-       /* close handles to shared libraries */
-       if (env->h_odbc != NULL)
-diff -ru glpk.old/glpenv03.c glpk/glpenv03.c
---- glpk.old/glpenv03.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpenv03.c	2012-04-02 11:18:42.000000000 -0400
-@@ -40,9 +40,9 @@
- 
- void glp_printf(const char *fmt, ...)
- {     va_list arg;
--      va_start(arg, fmt);
--      xvprintf(fmt, arg);
--      va_end(arg);
-+      /* va_start(arg, fmt); */
-+      /* xvprintf(fmt, arg); */
-+      /* va_end(arg); */
-       return;
- }
- 
-@@ -64,22 +64,22 @@
- void glp_vprintf(const char *fmt, va_list arg)
- {     ENV *env = get_env_ptr();
-       /* if terminal output is disabled, do nothing */
--      if (!env->term_out) goto skip;
--      /* format the output */
--      vsprintf(env->term_buf, fmt, arg);
--      /* pass the output to the user-defined routine */
--      if (env->term_hook != NULL)
--      {  if (env->term_hook(env->term_info, env->term_buf) != 0)
--            goto skip;
--      }
--      /* send the output to the terminal */
--      fputs(env->term_buf, stdout);
--      fflush(stdout);
--      /* copy the output to the text file */
--      if (env->tee_file != NULL)
--      {  fputs(env->term_buf, env->tee_file);
--         fflush(env->tee_file);
--      }
-+      /* if (!env->term_out) goto skip; */
-+      /* /\* format the output *\/ */
-+      /* vsprintf(env->term_buf, fmt, arg); */
-+      /* /\* pass the output to the user-defined routine *\/ */
-+      /* if (env->term_hook != NULL) */
-+      /* {  if (env->term_hook(env->term_info, env->term_buf) != 0) */
-+      /*       goto skip; */
-+      /* } */
-+      /* /\* send the output to the terminal *\/ */
-+      /* fputs(env->term_buf, stdout); */
-+      /* fflush(stdout); */
-+      /* /\* copy the output to the text file *\/ */
-+      /* if (env->tee_file != NULL) */
-+      /* {  fputs(env->term_buf, env->tee_file); */
-+      /*    fflush(env->tee_file); */
-+      /* } */
- skip: return;
- }
- 
-diff -ru glpk.old/glpenv04.c glpk/glpenv04.c
---- glpk.old/glpenv04.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpenv04.c	2012-03-30 11:56:41.000000000 -0400
-@@ -23,6 +23,7 @@
- ***********************************************************************/
- 
- #include "glpapi.h"
-+#include "igraph_error.h"
- 
- /***********************************************************************
- *  NAME
-@@ -44,14 +45,7 @@
-       va_list arg;
-       env->term_out = GLP_ON;
-       va_start(arg, fmt);
--      xvprintf(fmt, arg);
--      va_end(arg);
--      xprintf("Error detected in file %s at line %d\n", env->err_file,
--         env->err_line);
--      if (env->err_hook != NULL)
--         env->err_hook(env->err_info);
--      abort();
--      exit(EXIT_FAILURE);
-+      igraph_errorvf(fmt, env->err_file, env->err_line, IGRAPH_EGLP, arg);
-       /* no return */
- }
- 
-diff -ru glpk.old/glpenv07.c glpk/glpenv07.c
---- glpk.old/glpenv07.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpenv07.c	2012-03-31 13:21:03.000000000 -0400
-@@ -413,13 +413,13 @@
- 
- static void *c_fopen(const char *fname, const char *mode)
- {     FILE *fh;
--      if (strcmp(fname, "/dev/stdin") == 0)
--         fh = stdin;
--      else if (strcmp(fname, "/dev/stdout") == 0)
--         fh = stdout;
--      else if (strcmp(fname, "/dev/stderr") == 0)
--         fh = stderr;
--      else
-+      /* if (strcmp(fname, "/dev/stdin") == 0) */
-+      /*    fh = stdin; */
-+      /* else if (strcmp(fname, "/dev/stdout") == 0) */
-+      /*    fh = stdout; */
-+      /* else if (strcmp(fname, "/dev/stderr") == 0) */
-+      /*    fh = stderr; */
-+      /* else */
-          fh = fopen(fname, mode);
-       if (fh == NULL)
-          lib_err_msg(strerror(errno));
-@@ -484,11 +484,11 @@
- static int c_fclose(void *_fh)
- {     FILE *fh = _fh;
-       int ret;
--      if (fh == stdin)
--         ret = 0;
--      else if (fh == stdout || fh == stderr)
--         fflush(fh), ret = 0;
--      else
-+      /* if (fh == stdin) */
-+      /*    ret = 0; */
-+      /* else if (fh == stdout || fh == stderr) */
-+      /*    fflush(fh), ret = 0; */
-+      /* else */
-          ret = fclose(fh);
-       if (ret != 0)
-       {  lib_err_msg(strerror(errno));
-diff -ru glpk.old/glpgmp.c glpk/glpgmp.c
---- glpk.old/glpgmp.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpgmp.c	2012-04-01 00:05:13.000000000 -0400
-@@ -860,7 +860,7 @@
-          d[j] = (unsigned char)r->val;
-       }
-       /* output the integer to the stream */
--      if (fp == NULL) fp = stdout;
-+      /* if (fp == NULL) fp = stdout; */
-       if (mpz_sgn(x) < 0)
-          fputc('-', fp), nwr++;
-       for (j = n-1; j >= 0; j--)
-@@ -1091,7 +1091,7 @@
-       int nwr;
-       if (!(2 <= base && base <= 36))
-          xfault("mpq_out_str: base = %d; invalid base\n", base);
--      if (fp == NULL) fp = stdout;
-+      /* if (fp == NULL) fp = stdout; */
-       nwr = mpz_out_str(fp, base, &x->p);
-       if (x->q.val == 1 && x->q.ptr == NULL)
-          ;
-diff -ru glpk.old/glpmpl04.c glpk/glpmpl04.c
---- glpk.old/glpmpl04.c	2012-03-30 11:30:58.000000000 -0400
-+++ glpk/glpmpl04.c	2012-04-01 00:07:09.000000000 -0400
-@@ -341,11 +341,11 @@
- 
- void open_output(MPL *mpl, char *file)
- {     xassert(mpl->out_fp == NULL);
--      if (file == NULL)
--      {  file = "<stdout>";
--         mpl->out_fp = (void *)stdout;
--      }
--      else
-+      /* if (file == NULL) */
-+      /* {  file = "<stdout>"; */
-+      /*    mpl->out_fp = (void *)stdout; */
-+      /* } */
-+      /* else */
-       {  mpl->out_fp = xfopen(file, "w");
-          if (mpl->out_fp == NULL)
-             error(mpl, "unable to create %s - %s", file, xerrmsg());
-@@ -362,9 +362,9 @@
- 
- void write_char(MPL *mpl, int c)
- {     xassert(mpl->out_fp != NULL);
--      if (mpl->out_fp == (void *)stdout)
--         xprintf("%c", c);
--      else
-+      /* if (mpl->out_fp == (void *)stdout) */
-+      /*    xprintf("%c", c); */
-+      /* else */
-          xfprintf(mpl->out_fp, "%c", c);
-       return;
- }
-@@ -393,7 +393,7 @@
- 
- void flush_output(MPL *mpl)
- {     xassert(mpl->out_fp != NULL);
--      if (mpl->out_fp != (void *)stdout)
-+      /* if (mpl->out_fp != (void *)stdout) */
-       {  xfflush(mpl->out_fp);
-          if (xferror(mpl->out_fp))
-             error(mpl, "write error on %s - %s", mpl->out_file,
-@@ -1410,7 +1410,7 @@
-       if (mpl->row != NULL) xfree(mpl->row);
-       if (mpl->col != NULL) xfree(mpl->col);
-       if (mpl->in_fp != NULL) xfclose(mpl->in_fp);
--      if (mpl->out_fp != NULL && mpl->out_fp != (void *)stdout)
-+      if (mpl->out_fp != NULL /* && mpl->out_fp != (void *)stdout */)
-          xfclose(mpl->out_fp);
-       if (mpl->out_file != NULL) xfree(mpl->out_file);
-       if (mpl->prt_fp != NULL) xfclose(mpl->prt_fp);
-EOF
diff -Nru igraph-0.6.5~quantal1/tools/iso.R igraph-0.6.5/tools/iso.R
--- igraph-0.6.5~quantal1/tools/iso.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/iso.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,220 +0,0 @@
-
-#####################################
-
-R
-library(igraph)
-library(combinat)
-
-n <- 4
-ng <- 2 ^ (n*(n-1))
-
-perms <- permn( 1:n )
-
-to.number <- function(el) {
-
-  g <- graph( t(el), n=n )
-  A <- get.adjacency(g)
-  diag(A) <- -1
-  A <- as.numeric(A)
-  A <- A [ A != -1 ]
-  sum(A * 2 ^ (0:(length(A)-1)))
-  
-}
-
-to.edgelist <- function(num, nodes=n) {
-
-  A <- matrix(0, nr=n, nc=n)
-  diag(A) <- -1
-  v <- numeric()
-  
-  po <- ng/2
-  while (po >= 1) {
-    if (num>=po) {
-      num <- num - po
-      v <- c(v, 1)
-    } else {
-      v <- c(v, 0)
-    }
-    po <- po/2
-  }
-  
-  A [ A != -1 ] <- rev(v)
-  g <- graph.adjacency(A)
-  get.edgelist(g)
-}
-  
-
-res <- rep(-1, ng)
-canon <- numeric()
-
-for (num in 0:(length(res)-1)) {
-
-  print(num)
-  el <- to.edgelist(num)
-  
-  for (p in perms) {
-    el2 <- matrix(p[el+1]-1, nc=2)
-    num2 <- to.number(el2)
-    w <- which(num2 == canon)
-    if (length(w) != 0) {
-      res[num+1] <- canon[w]
-      break
-    }
-  }
-  if (res[num+1]==-1) {
-    res[num+1] <- num
-    canon <- c(canon, num)
-res <- rep(-1, ng)
-canon <- numeric()
-
-for (num in 0:(length(res)-1)) {
-
-  print(num)
-  el <- to.edgelist(num)
-  
-  for (p in perms) {
-    el2 <- matrix(p[el+1]-1, nc=2)
-    num2 <- to.number(el2)
-    w <- which(num2 == canon)
-    if (length(w) != 0) {
-      res[num+1] <- canon[w]
-      break
-    }
-  }
-  if (res[num+1]==-1) {
-    res[num+1] <- num
-    canon <- c(canon, num)
-  }
-}
-
-  }
-}
-
-################################
-
-R
-library(igraph)
-
-n <- 3
-ng <- 2 ^ (n*(n-1))
-
-to.edgelist <- function(num, nodes=n) {
-
-  A <- matrix(0, nr=n, nc=n)
-  diag(A) <- -1
-  v <- numeric()
-  
-  po <- ng/2
-  while (po >= 1) {
-    if (num>=po) {
-      num <- num - po
-      v <- c(v, 1)
-    } else {
-      v <- c(v, 0)
-    }
-    po <- po/2
-  }
-  
-  A [ A != -1 ] <- rev(v)
-  g <- graph.adjacency(A)
-  get.edgelist(g)
-}
-
-coo <- matrix( c( 0,1, 1,.5, 0,0 ), nc=2, byrow=TRUE)
-layout( matrix(1:64, nr=8, nc=8, byrow=TRUE) )
-layout.show(64)
-
-for (i in 0:63) {
-  
-  g <- graph( t(to.edgelist(i)), n=3 )
-  par(mar=c(0,0,0,0), mai=c(1,1,1,1)/5)
-  class <- graph.isoclass(g)
-  col=if (FALSE) "red" else "lightblue"
-  plot(g, layout=coo, vertex.size=20, vertex.color=col, labels=NA)
-  text(-.9,0,substitute(i %<=>% j, list(i=i, j=class)),
-       adj=c(0,.5), cex=2)
-}
-
-######################################
-
-coo <- matrix( c(0,1, 1,1, 1,0, 0,0), nc=2, byrow=TRUE)
-layout( matrix(1:221, nr=13, nc=17, byrow=TRUE) )
-layout.show(221)
-
-for (i in canon) {
-  
-  g <- graph( t(to.edgelist(i)), n=4 )
-  par(mar=c(0,0,0,0), mai=c(1,1,1,1)/5)
-  plot(g, layout=coo, vertex.size=40, vertex.color="red", labels=NA,
-       edge.color="lightgrey")
-  text(0,0,substitute(i, list(i=i)), adj=c(.5,.5), cex=2, col="brown", font=2)
-}
-
-##########################################
-# UNDIRECTED
-
-R
-library(igraph)
-library(combinat)
-
-n <- 3
-ng <- 2 ^ (n*(n-1)/2)
-
-perms <- permn( 1:n )
-
-to.number <- function(el) {
-
-  g <- graph( t(el), n=n, directed=FALSE )
-  A <- get.adjacency(g,type="upper")
-  A [ lower.tri(A, diag=TRUE) ] <- -1
-  A <- as.numeric(A)
-  A <- A [ A != -1 ]
-  sum(A * 2 ^ (0:(length(A)-1)))
-  
-}
-
-to.edgelist <- function(num, nodes=n) {
-
-  A <- matrix(0, nr=n, nc=n)
-  A [ lower.tri(A, diag=TRUE) ] <- -1
-  v <- numeric()
-  
-  po <- ng/2
-  while (po >= 1) {
-    if (num>=po) {
-      num <- num - po
-      v <- c(v, 1)
-    } else {
-      v <- c(v, 0)
-    }
-    po <- po/2
-  }
-  
-  A [ A != -1 ] <- rev(v)
-  g <- graph.adjacency(A, mode="upper")
-  get.edgelist(g)
-}
-  
-
-res <- rep(-1, ng)
-canon <- numeric()
-
-for (num in 0:(length(res)-1)) {
-
-  print(num)
-  el <- to.edgelist(num)
-  
-  for (p in perms) {
-    el2 <- matrix(p[el+1]-1, nc=2)
-    num2 <- to.number(el2)
-    w <- which(num2 == canon)
-    if (length(w) != 0) {
-      res[num+1] <- canon[w]
-      break
-    }
-  }
-  if (res[num+1]==-1) {
-    res[num+1] <- num
-    canon <- c(canon, num)
-  }
-}
diff -Nru igraph-0.6.5~quantal1/tools/iso2.R igraph-0.6.5/tools/iso2.R
--- igraph-0.6.5~quantal1/tools/iso2.R	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/iso2.R	1970-01-01 00:00:00.000000000 +0000
@@ -1,369 +0,0 @@
-
-# 3, directed
-
-a <- c(
-0,1,1,3,1,5,6,7,
-1,6,10,11,3,7,11,15,
-1,6,5,7,10,21,21,23,
-6,25,21,27,11,27,30,31,
-1,10,6,11,6,21,25,27,
-5,21,21,30,7,23,27,31,
-3,11,7,15,11,30,27,31,
-7,27,23,31,15,31,31,63
-)
-
-a2 <- unique(a)
-for (i in 0:(length(a2)-1)) {
-  a[ a==a2[i+1] ] <- i
-}
-
-
-#############################
-
-# 4, undirected
-
-b <- c(
-0,1,1,3,1,3,3,7,1,3,3,11,12,13,13,15,1,3,12,13,3,11,13,15,3,7,
-13,15,13,15,30,31,1,12,3,13,3,13,11,15,3,13,7,15,13,30,15,31,3,13,13,30,
-7,15,15,31,11,15,15,31,15,31,31,63
-)
-
-b2 <- unique(b)
-for (i in 0:(length(b2)-1)) {
-  b[ b==b2[i+1] ] <- i
-}
-
-############################
-
-# 4, directed
-
-c <- c(
-0,1,1,3,1,3,3,7,1,9,10,11,10,
-11,14,15,1,10,18,19,20,21,22,23,3,11,
-19,27,21,29,30,31,1,10,20,21,18,19,22,
-23,3,11,21,29,19,27,30,31,3,14,22,30,
-22,30,54,55,7,15,23,31,23,31,55,63,1,
-10,9,11,10,14,11,15,18,73,73,75,76,77,
-77,79,10,81,73,83,84,85,86,87,19,83,90,
-91,92,93,94,95,20,84,98,99,100,101,102,103,
-22,86,106,107,108,109,110,111,21,85,106,115,116,
-117,118,119,23,87,122,123,124,125,126,127,1,18,
-10,19,20,22,21,23,10,73,81,83,84,86,85,
-87,9,73,73,90,98,106,106,122,11,75,83,91,
-99,107,115,123,10,76,84,92,100,108,116,124,14,
-77,85,93,101,109,117,125,11,77,86,94,102,110,
-118,126,15,79,87,95,103,111,119,127,3,19,11,
-27,21,30,29,31,19,90,83,91,92,94,93,95,
-11,83,75,91,99,115,107,123,27,91,91,219,220,
-221,221,223,21,92,99,220,228,229,230,231,30,94,
-115,221,229,237,238,239,29,93,107,221,230,238,246,
-247,31,95,123,223,231,239,247,255,1,20,10,21,
-18,22,19,23,20,98,84,99,100,102,101,103,10,
-84,76,92,100,116,108,124,21,99,92,220,228,230,
-229,231,18,100,100,228,292,293,293,295,22,102,116,
-230,293,301,302,303,19,101,108,229,293,302,310,311,
-23,103,124,231,295,303,311,319,3,21,11,29,19,
-30,27,31,22,106,86,107,108,110,109,111,14,85,
-77,93,101,117,109,125,30,115,94,221,229,238,237,
-239,22,116,102,230,293,302,301,303,54,118,118,246,
-310,365,365,367,30,117,110,238,302,373,365,375,55,
-119,126,247,311,375,382,383,3,22,14,30,22,54,
-30,55,21,106,85,115,116,118,117,119,11,86,77,
-94,102,118,110,126,29,107,93,221,230,246,238,247,
-19,108,101,229,293,310,302,311,30,110,117,238,302,
-365,373,375,27,109,109,237,301,365,365,382,31,111,
-125,239,303,367,375,383,7,23,15,31,23,55,31,
-63,23,122,87,123,124,126,125,127,15,87,79,95,
-103,119,111,127,31,123,95,223,231,247,239,255,23,
-124,103,231,295,311,303,319,55,126,119,247,311,382,
-375,383,31,125,111,239,303,375,367,383,63,127,127,
-255,319,383,383,511,1,10,10,14,9,11,11,15,
-18,73,76,77,73,75,77,79,20,84,100,101,98,
-99,102,103,22,86,108,109,106,107,110,111,10,81,
-84,85,73,83,86,87,19,83,92,93,90,91,94,
-95,21,85,116,117,106,115,118,119,23,87,124,125,
-122,123,126,127,18,76,73,77,73,77,75,79,292,
-585,585,587,585,587,587,591,100,593,594,595,596,597,
-598,599,293,601,602,603,604,605,606,607,100,593,596,
-597,594,595,598,599,293,601,604,605,602,603,606,607,
-228,625,626,627,626,627,630,631,295,633,634,635,634,
-635,638,639,20,100,84,101,98,102,99,103,100,594,
-593,595,596,598,597,599,98,596,596,659,660,661,661,
-663,102,598,666,667,661,669,670,671,84,593,674,675,
-596,666,678,679,101,595,675,683,659,667,686,687,99,
-597,678,686,661,670,694,695,103,599,679,687,663,671,
-695,703,22,108,86,109,106,110,107,111,293,602,601,
-603,604,606,605,607,102,666,598,667,661,670,669,671,
-301,729,729,731,732,733,733,735,116,737,678,739,626,
-741,742,743,302,745,746,747,748,749,750,751,230,753,
-742,755,756,757,758,759,303,761,762,763,764,765,766,
-767,10,84,81,85,73,86,83,87,100,596,593,597,
-594,598,595,599,84,674,593,675,596,678,666,679,116,
-678,737,739,626,742,741,743,76,593,593,625,585,601,
-601,633,108,666,737,753,602,729,745,761,92,675,737,
-819,604,746,822,823,124,679,826,827,634,762,830,831,
-19,92,83,93,90,94,91,95,293,604,601,605,602,
-606,603,607,101,675,595,683,659,686,667,687,302,746,
-745,747,748,750,749,751,108,737,666,753,602,745,729,
-761,310,822,822,875,876,877,877,879,229,819,741,883,
-748,885,886,887,311,823,830,891,892,893,894,895,21,
-116,85,117,106,118,115,119,228,626,625,627,626,630,
-627,631,99,678,597,686,661,694,670,695,230,742,753,
-755,756,758,757,759,92,737,675,819,604,822,746,823,
-229,741,819,883,748,886,885,887,220,739,739,947,732,
-949,949,951,231,743,827,955,764,957,958,959,23,124,
-87,125,122,126,123,127,295,634,633,635,634,638,635,
-639,103,679,599,687,663,695,671,703,303,762,761,763,
-764,766,765,767,124,826,679,827,634,830,762,831,311,
-830,823,891,892,894,893,895,231,827,743,955,764,958,
-957,959,319,831,831,1019,1020,1021,1021,1023,1,18,20,
-22,10,19,21,23,10,73,84,86,81,83,85,87,
-10,76,100,108,84,92,116,124,14,77,101,109,85,
-93,117,125,9,73,98,106,73,90,106,122,11,75,
-99,107,83,91,115,123,11,77,102,110,86,94,118,
-126,15,79,103,111,87,95,119,127,20,100,98,102,
-84,101,99,103,100,594,596,598,593,595,597,599,84,
-593,596,666,674,675,678,679,101,595,659,667,675,683,
-686,687,98,596,660,661,596,659,661,663,102,598,661,
-669,666,667,670,671,99,597,661,670,678,686,694,695,
-103,599,663,671,679,687,695,703,18,292,100,293,100,
-293,228,295,76,585,593,601,593,601,625,633,73,585,
-594,602,596,604,626,634,77,587,595,603,597,605,627,
-635,73,585,596,604,594,602,626,634,77,587,597,605,
-595,603,627,635,75,587,598,606,598,606,630,638,79,
-591,599,607,599,607,631,639,22,293,102,301,116,302,
-230,303,108,602,666,729,737,745,753,761,86,601,598,
-729,678,746,742,762,109,603,667,731,739,747,755,763,
-106,604,661,732,626,748,756,764,110,606,670,733,741,
-749,757,765,107,605,669,733,742,750,758,766,111,607,
-671,735,743,751,759,767,10,100,84,116,76,108,92,
-124,84,596,674,678,593,666,675,679,81,593,593,737,
-593,737,737,826,85,597,675,739,625,753,819,827,73,
-594,596,626,585,602,604,634,86,598,678,742,601,729,
-746,762,83,595,666,741,601,745,822,830,87,599,679,
-743,633,761,823,831,21,228,99,230,92,229,220,231,
-116,626,678,742,737,741,739,743,85,625,597,753,675,
-819,739,827,117,627,686,755,819,883,947,955,106,626,
-661,756,604,748,732,764,118,630,694,758,822,886,949,
-957,115,627,670,757,746,885,949,958,119,631,695,759,
-823,887,951,959,19,293,101,302,108,310,229,311,92,
-604,675,746,737,822,819,823,83,601,595,745,666,822,
-741,830,93,605,683,747,753,875,883,891,90,602,659,
-748,602,876,748,892,94,606,686,750,745,877,885,893,
-91,603,667,749,729,877,886,894,95,607,687,751,761,
-879,887,895,23,295,103,303,124,311,231,319,124,634,
-679,762,826,830,827,831,87,633,599,761,679,823,743,
-831,125,635,687,763,827,891,955,1019,122,634,663,764,
-634,892,764,1020,126,638,695,766,830,894,958,1021,123,
-635,671,765,762,893,957,1021,127,639,703,767,831,895,
-959,1023,3,19,21,30,11,27,29,31,19,90,92,
-94,83,91,93,95,21,92,228,229,99,220,230,231,
-30,94,229,237,115,221,238,239,11,83,99,115,75,
-91,107,123,27,91,220,221,91,219,221,223,29,93,
-230,238,107,221,246,247,31,95,231,239,123,223,247,
-255,22,108,106,110,86,109,107,111,293,602,604,606,
-601,603,605,607,116,737,626,741,678,739,742,743,302,
-745,748,749,746,747,750,751,102,666,661,670,598,667,
-669,671,301,729,732,733,729,731,733,735,230,753,756,
-757,742,755,758,759,303,761,764,765,762,763,766,767,
-22,293,116,302,102,301,230,303,108,602,737,745,666,
-729,753,761,106,604,626,748,661,732,756,764,110,606,
-741,749,670,733,757,765,86,601,678,746,598,729,742,
-762,109,603,739,747,667,731,755,763,107,605,742,750,
-669,733,758,766,111,607,743,751,671,735,759,767,54,
-310,118,365,118,365,246,367,310,876,822,877,822,877,
-875,879,118,822,630,886,694,949,758,957,365,877,886,
-1755,949,1757,1758,1759,118,822,694,949,630,886,758,957,
-365,877,949,1757,886,1755,1758,1759,246,875,758,1758,758,
-1758,1782,1783,367,879,957,1759,957,1759,1783,1791,14,101,
-85,117,77,109,93,125,101,659,675,686,595,667,683,
-687,85,675,625,819,597,739,753,827,117,686,819,947,
-627,755,883,955,77,595,597,627,587,603,605,635,109,
-667,739,755,603,731,747,763,93,683,753,883,605,747,
-875,891,125,687,827,955,635,763,891,1019,30,229,115,
-238,94,237,221,239,302,748,746,750,745,749,747,751,
-117,819,627,883,686,947,755,955,373,885,885,1883,885,
-1883,1883,1887,110,741,670,757,606,749,733,765,365,886,
-949,1758,877,1755,1757,1759,238,883,757,1907,750,1883,1758,
-1911,375,887,958,1911,893,1917,1918,1919,30,302,117,373,
-110,365,238,375,229,748,819,885,741,886,883,887,115,
-746,627,885,670,949,757,958,238,750,883,1883,757,1758,
-1907,1911,94,745,686,885,606,877,750,893,237,749,947,
-1883,749,1755,1883,1917,221,747,755,1883,733,1757,1758,1918,
-239,751,955,1887,765,1759,1911,1919,55,311,119,375,126,
-382,247,383,311,892,823,893,830,894,891,895,119,823,
-631,887,695,951,759,959,375,893,887,1917,958,1918,1911,
-1919,126,830,695,958,638,894,766,1021,382,894,951,1918,
-894,2029,1918,2031,247,891,759,1911,766,1918,1783,2039,383,
-895,959,1919,1021,2031,2039,2047,1,20,18,22,10,21,
-19,23,20,98,100,102,84,99,101,103,18,100,292,
-293,100,228,293,295,22,102,293,301,116,230,302,303,
-10,84,100,116,76,92,108,124,21,99,228,230,92,
-220,229,231,19,101,293,302,108,229,310,311,23,103,
-295,303,124,231,311,319,10,84,73,86,81,85,83,
-87,100,596,594,598,593,597,595,599,76,593,585,601,
-593,625,601,633,108,666,602,729,737,753,745,761,84,
-674,596,678,593,675,666,679,116,678,626,742,737,739,
-741,743,92,675,604,746,737,819,822,823,124,679,634,
-762,826,827,830,831,10,100,76,108,84,116,92,124,
-84,596,593,666,674,678,675,679,73,594,585,602,596,
-626,604,634,86,598,601,729,678,742,746,762,81,593,
-593,737,593,737,737,826,85,597,625,753,675,739,819,
-827,83,595,601,745,666,741,822,830,87,599,633,761,
-679,743,823,831,14,101,77,109,85,117,93,125,101,
-659,595,667,675,686,683,687,77,595,587,603,597,627,
-605,635,109,667,603,731,739,755,747,763,85,675,597,
-739,625,819,753,827,117,686,627,755,819,947,883,955,
-93,683,605,747,753,883,875,891,125,687,635,763,827,
-955,891,1019,9,98,73,106,73,106,90,122,98,660,
-596,661,596,661,659,663,73,596,585,604,594,626,602,
-634,106,661,604,732,626,756,748,764,73,596,594,626,
-585,604,602,634,106,661,626,756,604,732,748,764,90,
-659,602,748,602,748,876,892,122,663,634,764,634,764,
-892,1020,11,99,75,107,83,115,91,123,102,661,598,
-669,666,670,667,671,77,597,587,605,595,627,603,635,
-110,670,606,733,741,757,749,765,86,678,598,742,601,
-746,729,762,118,694,630,758,822,949,886,957,94,686,
-606,750,745,885,877,893,126,695,638,766,830,958,894,
-1021,11,102,77,110,86,118,94,126,99,661,597,670,
-678,694,686,695,75,598,587,606,598,630,606,638,107,
-669,605,733,742,758,750,766,83,666,595,741,601,822,
-745,830,115,670,627,757,746,949,885,958,91,667,603,
-749,729,886,877,894,123,671,635,765,762,957,893,1021,
-15,103,79,111,87,119,95,127,103,663,599,671,679,
-695,687,703,79,599,591,607,599,631,607,639,111,671,
-607,735,743,759,751,767,87,679,599,743,633,823,761,
-831,119,695,631,759,823,951,887,959,95,687,607,751,
-761,887,879,895,127,703,639,767,831,959,895,1023,3,
-21,19,30,11,29,27,31,22,106,108,110,86,107,
-109,111,22,116,293,302,102,230,301,303,54,118,310,
-365,118,246,365,367,14,85,101,117,77,93,109,125,
-30,115,229,238,94,221,237,239,30,117,302,373,110,
-238,365,375,55,119,311,375,126,247,382,383,19,92,
-90,94,83,93,91,95,293,604,602,606,601,605,603,
-607,108,737,602,745,666,753,729,761,310,822,876,877,
-822,875,877,879,101,675,659,686,595,683,667,687,302,
-746,748,750,745,747,749,751,229,819,748,885,741,883,
-886,887,311,823,892,893,830,891,894,895,21,228,92,
-229,99,230,220,231,116,626,737,741,678,742,739,743,
-106,626,604,748,661,756,732,764,118,630,822,886,694,
-758,949,957,85,625,675,819,597,753,739,827,117,627,
-819,883,686,755,947,955,115,627,746,885,670,757,949,
-958,119,631,823,887,695,759,951,959,30,229,94,237,
-115,238,221,239,302,748,745,749,746,750,747,751,110,
-741,606,749,670,757,733,765,365,886,877,1755,949,1758,
-1757,1759,117,819,686,947,627,883,755,955,373,885,885,
-1883,885,1883,1883,1887,238,883,750,1883,757,1907,1758,1911,
-375,887,893,1917,958,1911,1918,1919,11,99,83,115,75,
-107,91,123,102,661,666,670,598,669,667,671,86,678,
-601,746,598,742,729,762,118,694,822,949,630,758,886,
-957,77,597,595,627,587,605,603,635,110,670,741,757,
-606,733,749,765,94,686,745,885,606,750,877,893,126,
-695,830,958,638,766,894,1021,27,220,91,221,91,221,
-219,223,301,732,729,733,729,733,731,735,109,739,603,
-747,667,755,731,763,365,949,877,1757,886,1758,1755,1759,
-109,739,667,755,603,747,731,763,365,949,886,1758,877,
-1757,1755,1759,237,947,749,1883,749,1883,1755,1917,382,951,
-894,1918,894,1918,2029,2031,29,230,93,238,107,246,221,
-247,230,756,753,757,742,758,755,759,107,742,605,750,
-669,758,733,766,246,758,875,1758,758,1782,1758,1783,93,
-753,683,883,605,875,747,891,238,757,883,1907,750,1758,
-1883,1911,221,755,747,1883,733,1758,1757,1918,247,759,891,
-1911,766,1783,1918,2039,31,231,95,239,123,247,223,255,
-303,764,761,765,762,766,763,767,111,743,607,751,671,
-759,735,767,367,957,879,1759,957,1783,1759,1791,125,827,
-687,955,635,891,763,1019,375,958,887,1911,893,1918,1917,
-1919,239,955,751,1887,765,1911,1759,1919,383,959,895,1919,
-1021,2039,2031,2047,3,22,22,54,14,30,30,55,21,
-106,116,118,85,115,117,119,19,108,293,310,101,229,
-302,311,30,110,302,365,117,238,373,375,11,86,102,
-118,77,94,110,126,29,107,230,246,93,221,238,247,
-27,109,301,365,109,237,365,382,31,111,303,367,125,
-239,375,383,21,116,106,118,85,117,115,119,228,626,
-626,630,625,627,627,631,92,737,604,822,675,819,746,
-823,229,741,748,886,819,883,885,887,99,678,661,694,
-597,686,670,695,230,742,756,758,753,755,757,759,220,
-739,732,949,739,947,949,951,231,743,764,957,827,955,
-958,959,19,293,108,310,101,302,229,311,92,604,737,
-822,675,746,819,823,90,602,602,876,659,748,748,892,
-94,606,745,877,686,750,885,893,83,601,666,822,595,
-745,741,830,93,605,753,875,683,747,883,891,91,603,
-729,877,667,749,886,894,95,607,761,879,687,751,887,
-895,30,302,110,365,117,373,238,375,229,748,741,886,
-819,885,883,887,94,745,606,877,686,885,750,893,237,
-749,749,1755,947,1883,1883,1917,115,746,670,949,627,885,
-757,958,238,750,757,1758,883,1883,1907,1911,221,747,733,
-1757,755,1883,1758,1918,239,751,765,1759,955,1887,1911,1919,
-11,102,86,118,77,110,94,126,99,661,678,694,597,
-670,686,695,83,666,601,822,595,741,745,830,115,670,
-746,949,627,757,885,958,75,598,598,630,587,606,606,
-638,107,669,742,758,605,733,750,766,91,667,729,886,
-603,749,877,894,123,671,762,957,635,765,893,1021,29,
-230,107,246,93,238,221,247,230,756,742,758,753,757,
-755,759,93,753,605,875,683,883,747,891,238,757,750,
-1758,883,1907,1883,1911,107,742,669,758,605,750,733,766,
-246,758,758,1782,875,1758,1758,1783,221,755,733,1758,747,
-1883,1757,1918,247,759,766,1783,891,1911,1918,2039,27,301,
-109,365,109,365,237,382,220,732,739,949,739,949,947,
-951,91,729,603,877,667,886,749,894,221,733,747,1757,
-755,1758,1883,1918,91,729,667,886,603,877,749,894,221,
-733,755,1758,747,1757,1883,1918,219,731,731,1755,731,1755,
-1755,2029,223,735,763,1759,763,1759,1917,2031,31,303,111,
-367,125,375,239,383,231,764,743,957,827,958,955,959,
-95,761,607,879,687,887,751,895,239,765,751,1759,955,
-1911,1887,1919,123,762,671,957,635,893,765,1021,247,766,
-759,1783,891,1918,1911,2039,223,763,735,1759,763,1917,1759,
-2031,255,767,767,1791,1019,1919,1919,2047,7,23,23,55,
-15,31,31,63,23,122,124,126,87,123,125,127,23,
-124,295,311,103,231,303,319,55,126,311,382,119,247,
-375,383,15,87,103,119,79,95,111,127,31,123,231,
-247,95,223,239,255,31,125,303,375,111,239,367,383,
-63,127,319,383,127,255,383,511,23,124,122,126,87,
-125,123,127,295,634,634,638,633,635,635,639,124,826,
-634,830,679,827,762,831,311,830,892,894,823,891,893,
-895,103,679,663,695,599,687,671,703,303,762,764,766,
-761,763,765,767,231,827,764,958,743,955,957,959,319,
-831,1020,1021,831,1019,1021,1023,23,295,124,311,103,303,
-231,319,124,634,826,830,679,762,827,831,122,634,634,
-892,663,764,764,1020,126,638,830,894,695,766,958,1021,
-87,633,679,823,599,761,743,831,125,635,827,891,687,
-763,955,1019,123,635,762,893,671,765,957,1021,127,639,
-831,895,703,767,959,1023,55,311,126,382,119,375,247,
-383,311,892,830,894,823,893,891,895,126,830,638,894,
-695,958,766,1021,382,894,894,2029,951,1918,1918,2031,119,
-823,695,951,631,887,759,959,375,893,958,1918,887,1917,
-1911,1919,247,891,766,1918,759,1911,1783,2039,383,895,1021,
-2031,959,1919,2039,2047,15,103,87,119,79,111,95,127,
-103,663,679,695,599,671,687,703,87,679,633,823,599,
-743,761,831,119,695,823,951,631,759,887,959,79,599,
-599,631,591,607,607,639,111,671,743,759,607,735,751,
-767,95,687,761,887,607,751,879,895,127,703,831,959,
-639,767,895,1023,31,231,123,247,95,239,223,255,303,
-764,762,766,761,765,763,767,125,827,635,891,687,955,
-763,1019,375,958,893,1918,887,1911,1917,1919,111,743,671,
-759,607,751,735,767,367,957,957,1783,879,1759,1759,1791,
-239,955,765,1911,751,1887,1759,1919,383,959,1021,2039,895,
-1919,2031,2047,31,303,125,375,111,367,239,383,231,764,
-827,958,743,957,955,959,123,762,635,893,671,957,765,
-1021,247,766,891,1918,759,1783,1911,2039,95,761,687,887,
-607,879,751,895,239,765,955,1911,751,1759,1887,1919,223,
-763,763,1917,735,1759,1759,2031,255,767,1019,1919,767,1791,
-1919,2047,63,319,127,383,127,383,255,511,319,1020,831,
-1021,831,1021,1019,1023,127,831,639,895,703,959,767,1023,
-383,1021,895,2031,959,2039,1919,2047,127,831,703,959,639,
-895,767,1023,383,1021,959,2039,895,2031,1919,2047,255,1019,
-767,1919,767,1919,1791,2047,511,1023,1023,2047,1023,2047,2047,
-4095
-)
-
-c2 <- unique(c)
-for (i in 0:(length(c2)-1)) {
-  c[ c==c2[i+1] ] <- i
-}
-
-
-cat(file="/tmp/a", format(a), fill=TRUE, sep=",")
-cat(file="/tmp/b", format(b), fill=TRUE, sep=",")
-cat(file="/tmp/c", format(c), fill=TRUE, sep=",")
-
-
diff -Nru igraph-0.6.5~quantal1/tools/lapack/CompletePolish igraph-0.6.5/tools/lapack/CompletePolish
--- igraph-0.6.5~quantal1/tools/lapack/CompletePolish	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/CompletePolish	1970-01-01 00:00:00.000000000 +0000
@@ -1,32 +0,0 @@
-#!/bin/sh -
-# call this Unix script "MagicScript"
-# To use: MagicScript *.f 
-#	  that translates *.f to *.c and polish the resulting C code from f2c. 
-#
-# Note: define trans_dir as the directory that contains this file.
-#
-# trans_dir=/home/barad-dur/jwd/users/mercedes-tmp/LAPACK_v2.0/LAPACK_Final_Release2.0/NEW_CLAPACK/CLAPACK/Translate
-
-rm -f -r temp
-mkdir temp
-for file do	
-       base=`echo $file | sed -e 's/\.f//g'`
-   # run_stripper
-       f2c -a < ${base}.f | ${trans_dir}/lenscrub > ${base}.c
-   # run_macro (better vector and array indexing; from NAG)
-#   	${trans_dir}/substitute_locals.exe < ${base}.c > ${base}.u
-#  	${trans_dir}/test_tool.exe ${base}.u > ${base}.c
-#   	rm -f ${base}.u
-   # run_comment
-       sed -f ${trans_dir}/delete.sed ${base}.c > ${base}.t
-       mv -f ${base}.t ${base}.c
-       ${trans_dir}/comment < ${base}.c > ${base}.t
-       mv -f ${base}.t ${base}.c
-   # run_splitter
-#       sed -n -f ${trans_dir}/split.sed ${base}.c
-#       mv -f ${base}.c ${base}.t
-#       cat temp/header1 temp/header3 temp/comment temp/header2 temp/prologue \
-#       		temp/code > ${base}.c
-#       rm -f ${base}.t
-done
-rm -f -r temp
diff -Nru igraph-0.6.5~quantal1/tools/lapack/Makefile igraph-0.6.5/tools/lapack/Makefile
--- igraph-0.6.5~quantal1/tools/lapack/Makefile	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/Makefile	1970-01-01 00:00:00.000000000 +0000
@@ -1,15 +0,0 @@
-LOADLIBS = -ly -lfl -lm  
-LIBS = -lfl -lm  
-CFLAGS	= -O
-
-all: lenscrub comment
-
-lenscrub: lenscrub.l
-	lex lenscrub.l
-	mv -f lex.yy.c lex_for_lenscrub.c
-	cc -o lenscrub -O lex_for_lenscrub.c -lfl
-
-comment: comment.l
-	lex comment.l
-	mv -f lex.yy.c lex_for_comment.c
-	cc -o comment -O lex_for_comment.c -lfl
diff -Nru igraph-0.6.5~quantal1/tools/lapack/comment.l igraph-0.6.5/tools/lapack/comment.l
--- igraph-0.6.5~quantal1/tools/lapack/comment.l	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/comment.l	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-%{
-#include <stdio.h>
-
-/* extern FILE *commentFile, *localVarFile, *codeFile; */
-
-%}
-
-whitespace [\n\t ]*
-any	   .*
-
-%%
-"*/"{whitespace}"/*"         {yytext[0]=yytext[1]=yytext[yyleng-1]=yytext[yyleng-2]=' ';printf("%s",yytext);}
-"\n"                         {printf("%s", yytext);}
-.                            {printf("%s", yytext);}
diff -Nru igraph-0.6.5~quantal1/tools/lapack/delete.sed igraph-0.6.5/tools/lapack/delete.sed
--- igraph-0.6.5~quantal1/tools/lapack/delete.sed	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/delete.sed	1970-01-01 00:00:00.000000000 +0000
@@ -1,4 +0,0 @@
-# delete the line of the form .. Scalar arguments .. 
-/\/\*  *\.\. .*\*\//{
-d
-}
diff -Nru igraph-0.6.5~quantal1/tools/lapack/extra/len_trim.f igraph-0.6.5/tools/lapack/extra/len_trim.f
--- igraph-0.6.5~quantal1/tools/lapack/extra/len_trim.f	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/extra/len_trim.f	1970-01-01 00:00:00.000000000 +0000
@@ -1,14 +0,0 @@
-*
-*  -- LEN_TRIM is Fortran 95, so we use a replacement here
-*
-      FUNCTION LEN_TRIM(S)
-*
-      CHARACTER*(*)  S
-      INTEGER LEN_TRIM
-*
-      INTRINSIC LEN
-*
-      DO LEN_TRIM = LEN(S), 1, -1
-         IF (s(LEN_TRIM:LEN_TRIM) .NE. ' ') RETURN
-      END DO
-      END
diff -Nru igraph-0.6.5~quantal1/tools/lapack/getlapack.sh igraph-0.6.5/tools/lapack/getlapack.sh
--- igraph-0.6.5~quantal1/tools/lapack/getlapack.sh	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/getlapack.sh	1970-01-01 00:00:00.000000000 +0000
@@ -1,191 +0,0 @@
-#! /bin/sh
-# 
-# ./getlapack.sh dgeev dsyevr dnaupd dneupd dsaupd dseupd dgemv dgeevx \
-#                dgetrf dgetrs dgesv dlapy2
-#
-
-make
-
-origdir=`pwd`
-destdir=lapack-new
-
-cd /tmp
-rm -rf $destdir
-mkdir $destdir
-
-## Download and unpack BLAS
-
-if test ! -f blas.tgz; then
-    curl -O http://www.netlib.org/blas/blas.tgz
-fi
-blasdir=`tar tzf blas.tgz | head -1 | cut -f1 -d"/"`
-rm -rf ${blasdir}
-tar xzf blas.tgz
-
-## Download, unpack and patch LAPACK
-
-if test ! -f lapack.tgz; then 
-    curl -O http://www.netlib.org/lapack/lapack.tgz
-fi
-lapackdir=`tar tzf lapack.tgz | head -1 | cut -f1 -d"/"`
-rm -rf ${lapackdir}
-tar xzf lapack.tgz 
-
-cd /tmp/${lapackdir}
-patch -p 1 <${origdir}/lapack.patch
-cd /tmp
-
-## Download and unpack ARPACK
-
-if test ! -f arpack96.tar.gz; then
-    curl -O http://www.caam.rice.edu/software/ARPACK/SRC/arpack96.tar.gz
-fi
-arpackdir=`tar tzf arpack96.tar.gz | head -1 | cut -f1 -d"/"`
-rm -rf ${arpackdir}
-tar xzf arpack96.tar.gz
-
-alreadydone=()
-lapack=()
-arpack=()
-blas=()
-
-known() {
-    needle=$1
-    res=0
-    for i in ${alreadydone[@]}; do 
-	    if [[ $i == ${needle} ]]; then 
-		return 0
-	    fi
-    done
-    return 1
-}
-
-getdeps() {
-    name=$1;
-    f2c -a ${name}.f >/dev/null 2>/dev/null && 
-    gcc -c ${name}.c >/dev/null &&
-    nm ${name}.o | grep " U " | awk ' { print $2 }' | 
-    sed 's/_$//g' | sed 's/^_//g'
-}
-
-dofunction() {    
-    name=$1;
-
-    if known $name; then return 0; fi
-
-    if test -f /tmp/${arpackdir}/SRC/${name}.f; then
-	cd /tmp/${arpackdir}/SRC
-	arpack[$[${#arpack[@]}+1]]=$name
-    elif test -f /tmp/${lapackdir}/SRC/${name}.f; then
-	cd /tmp/${lapackdir}/SRC
-	lapack[$[${#lapack[@]}+1]]=$name
-    elif test -f /tmp/${blasdir}/${name}.f; then
-	cd /tmp/${blasdir}
-	blas[$[${#blas[@]}+1]]=$name
-    elif test -f /tmp/${arpackdir}/UTIL/${name}.f; then
-	cd /tmp/${arpackdir}/UTIL
-	arpack[$[${#arpack[@]}+1]]=$name
-    elif test -f /tmp/${lapackdir}/INSTALL/${name}.f; then
-	cd /tmp/${lapackdir}/INSTALL
-	lapack[$[${#lapack[@]}+1]]=$name	
-    elif test -f ${origdir}/extra/${name}.f; then
-	cd ${origdir}/extra
-	lapack[$[${#lapack[@]}+1]]=$name	
-    else
-	return
-    fi
-
-    cp ${name}.f /tmp/${destdir}
-
-    alreadydone[$[${#alreadydone[@]}+1]]=$name
-
-    deps=`getdeps $name`
-    for i in $deps; do
-	dofunction $i
-    done
-}
-
-if test "$#" -eq "0"; then 
-    exit 0
-fi
-
-## Collect and copy the needed files
-
-for i in "$@"; do
-    dofunction $i
-done
-
-## Some more required files
-
-dofunction second
-dofunction dvout
-dofunction ivout
-dofunction dmout
-dofunction dlamch
-dofunction len_trim
-
-## Polish them
-
-cd /tmp/${destdir}
-touch debug.h
-touch stat.h
-trans_dir=${origdir} ${origdir}/CompletePolish *.f
-
-## Remove the .f files.
-
-cd /tmp/${destdir}
-rm -f *.f
-
-## Prefix the function calls with 'igraph', this is needed 
-## if the user wants to link igraph including internal BLAS/LAPACK/ARPACK 
-## and BLAS/LAPACK/ARPACK for some reason
-
-extrafunctions=(dlamc1 dlamc2 dlamc3 dlamc4 dlamc5)
-
-for name in ${alreadydone[@]} ${extrafunctions[@]}; do
-    echo "s/${name}_/igraph${name}_/g"
-done > /tmp/lapack-sed.txt
-
-for name in ${alreadydone[@]}; do
-    sed -f /tmp/lapack-sed.txt < ${name}.c >/tmp/arpackfun.c
-    cp /tmp/arpackfun.c ${name}.c
-done
-
-## Update the file that is included into the main Makefile,
-## this contains the ARPACK/LAPACK/BLAS source files
-
-blasinc=/tmp/${destdir}/blas.inc
-/bin/echo -n "BLAS = " > ${blasinc}
-for name in ${blas[@]}; do
-    /bin/echo -n "lapack/${name}.c "
-done >> ${blasinc}
-/bin/echo >> ${blasinc}
-
-lapackinc=/tmp/${destdir}/lapack.inc
-/bin/echo -n "LAPACK = " > ${lapackinc}
-for name in ${lapack[@]}; do
-    /bin/echo -n "lapack/${name}.c "
-done | sed 's/lapack\/dlamch\.c//' >> ${lapackinc}
-/bin/echo >> ${lapackinc}
-
-arpackinc=/tmp/${destdir}/arpack.inc
-/bin/echo -n "ARPACK = " > ${arpackinc}
-for name in ${arpack[@]}; do
-    /bin/echo -n "lapack/${name}.c "
-done >> ${arpackinc}
-/bin/echo >> ${arpackinc}
-
-## This is a patch to make ARPACK thread-safe
-
-cd /tmp/${destdir}
-patch -p2 < ${origdir}/mt.patch
-
-## We are done
-
-echo "Sources are ready, to update your tree please run:
-
-  bzr rm ${origdir}/../../src/lapack
-  mv /tmp/${destdir} ${origdir}/../../src/lapack
-  bzr add ${origdir}/../../src/lapack
-
-"
diff -Nru igraph-0.6.5~quantal1/tools/lapack/lapack.patch igraph-0.6.5/tools/lapack/lapack.patch
--- igraph-0.6.5~quantal1/tools/lapack/lapack.patch	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/lapack.patch	1970-01-01 00:00:00.000000000 +0000
@@ -1,156 +0,0 @@
-diff -ru lapack-3.2.2/SRC/dlarft.f lapack-3.2.2-new/SRC/dlarft.f
---- lapack-3.2.2/SRC/dlarft.f	2009-04-16 20:10:16.000000000 +0200
-+++ lapack-3.2.2-new/SRC/dlarft.f	2010-10-06 21:47:53.000000000 +0200
-@@ -145,9 +145,15 @@
-                V( I, I ) = ONE
-                IF( LSAME( STOREV, 'C' ) ) THEN
- !                 Skip any trailing zeros.
--                  DO LASTV = N, I+1, -1
--                     IF( V( LASTV, I ).NE.ZERO ) EXIT
--                  END DO
-+                  LASTV = N
-+ 14               IF (V(LASTV, I ) .NE. ZERO) GOTO 15
-+                  IF (LASTV .EQ. I+1) GOTO 15
-+                  LASTV = LASTV - 1
-+                  GOTO 14
-+ 15               CONTINUE
-+*                 DO LASTV = N, I+1, -1
-+*                    IF( V( LASTV, I ).NE.ZERO ) EXIT
-+*                 END DO
-                   J = MIN( LASTV, PREVLASTV )
- *
- *                 T(1:i-1,i) := - tau(i) * V(i:j,1:i-1)' * V(i:j,i)
-@@ -157,9 +163,16 @@
-      $                        T( 1, I ), 1 )
-                ELSE
- !                 Skip any trailing zeros.
--                  DO LASTV = N, I+1, -1
--                     IF( V( I, LASTV ).NE.ZERO ) EXIT
--                  END DO
-+                  LASTV = N
-+ 16               IF (V(I, LASTV) .NE. ZERO) GOTO 17
-+                  IF (LASTV .EQ. I+1) GOTO 17
-+                  LASTV = LASTV - 1 
-+                  GOTO 16
-+ 17               CONTINUE
-+*                 DO LASTV = N, I+1, -1
-+*                    IF( V( I, LASTV ).NE.ZERO ) EXIT
-+*                 END DO
-+
-                   J = MIN( LASTV, PREVLASTV )
- *
- *                 T(1:i-1,i) := - tau(i) * V(1:i-1,i:j) * V(i,i:j)'
-@@ -201,9 +214,16 @@
-                      VII = V( N-K+I, I )
-                      V( N-K+I, I ) = ONE
- !                    Skip any leading zeros.
--                     DO LASTV = 1, I-1
--                        IF( V( LASTV, I ).NE.ZERO ) EXIT
--                     END DO
-+                     LASTV = 1
-+ 34                  IF (V(LASTV, I) .NE. ZERO) GOTO 35
-+                     IF (LASTV .EQ. I-1) GOTO 35
-+                     LASTV = LASTV + 1
-+                     GOTO 34
-+ 35                  CONTINUE
-+*                    DO LASTV = 1, I-1
-+*                       IF( V( LASTV, I ).NE.ZERO ) EXIT
-+*                    END DO
-+
-                      J = MAX( LASTV, PREVLASTV )
- *
- *                    T(i+1:k,i) :=
-@@ -217,9 +237,14 @@
-                      VII = V( I, N-K+I )
-                      V( I, N-K+I ) = ONE
- !                    Skip any leading zeros.
--                     DO LASTV = 1, I-1
--                        IF( V( I, LASTV ).NE.ZERO ) EXIT
--                     END DO
-+                     LASTV = 1
-+ 36                  IF (V(I, LASTV) .NE. ZERO) GOTO 37
-+                     IF (LASTV .EQ. I-1) GOTO 37
-+                     LASTV = LASTV + 1
-+ 37                  CONTINUE
-+*                    DO LASTV = 1, I-1
-+*                       IF( V( I, LASTV ).NE.ZERO ) EXIT
-+*                    END DO
-                      J = MAX( LASTV, PREVLASTV )
- *
- *                    T(i+1:k,i) :=
-diff -ru lapack-3.2.2/SRC/xerbla.f lapack-3.2.2-new/SRC/xerbla.f
---- lapack-3.2.2/SRC/xerbla.f	2009-04-16 20:10:16.000000000 +0200
-+++ lapack-3.2.2-new/SRC/xerbla.f	2010-10-08 17:53:21.000000000 +0200
-@@ -33,7 +33,7 @@
- * =====================================================================
- *
- *     .. Intrinsic Functions ..
--      INTRINSIC          LEN_TRIM
-+      EXTERNAL          LEN_TRIM
- *     ..
- *     .. Executable Statements ..
- *
-diff -ru lapack-3.3.1/INSTALL/dlamch.f lapack-3.3.1-new/INSTALL/dlamch.f
---- lapack-3.3.1/INSTALL/dlamch.f	2011-04-26 12:41:18.000000000 -0400
-+++ lapack-3.3.1-new/INSTALL/dlamch.f	2011-04-26 12:41:22.000000000 -0400
-@@ -60,8 +60,8 @@
-       EXTERNAL           LSAME
- *     ..
- *     .. Intrinsic Functions ..
--      INTRINSIC          DIGITS, EPSILON, HUGE, MAXEXPONENT,
--     $                   MINEXPONENT, RADIX, TINY
-+      EXTERNAL           DIGITSDBL, EPSILONDBL, HUGEDBL, MAXEXPONENTDBL,
-+     $                   MINEXPONENTDBL, RADIXDBL, TINYDBL
- *     ..
- *     .. Executable Statements ..
- *
-@@ -71,16 +71,16 @@
-       RND = ONE
- *
-       IF( ONE.EQ.RND ) THEN
--         EPS = EPSILON(ZERO) * 0.5
-+         EPS = EPSILONDBL(ZERO) * 0.5
-       ELSE
--         EPS = EPSILON(ZERO)
-+         EPS = EPSILONDBL(ZERO)
-       END IF
- *
-       IF( LSAME( CMACH, 'E' ) ) THEN
-          RMACH = EPS
-       ELSE IF( LSAME( CMACH, 'S' ) ) THEN
--         SFMIN = TINY(ZERO)
--         SMALL = ONE / HUGE(ZERO)
-+         SFMIN = TINYDBL(ZERO)
-+         SMALL = ONE / HUGEDBL(ZERO)
-          IF( SMALL.GE.SFMIN ) THEN
- *
- *           Use SMALL plus a bit, to avoid the possibility of rounding
-@@ -90,21 +90,21 @@
-          END IF
-          RMACH = SFMIN
-       ELSE IF( LSAME( CMACH, 'B' ) ) THEN
--         RMACH = RADIX(ZERO)
-+         RMACH = RADIXDBL(ZERO)
-       ELSE IF( LSAME( CMACH, 'P' ) ) THEN
--         RMACH = EPS * RADIX(ZERO)
-+         RMACH = EPS * RADIXDBL(ZERO)
-       ELSE IF( LSAME( CMACH, 'N' ) ) THEN
--         RMACH = DIGITS(ZERO)
-+         RMACH = DIGITSDBL(ZERO)
-       ELSE IF( LSAME( CMACH, 'R' ) ) THEN
-          RMACH = RND
-       ELSE IF( LSAME( CMACH, 'M' ) ) THEN
--         RMACH = MINEXPONENT(ZERO)
-+         RMACH = MINEXPONENTDBL(ZERO)
-       ELSE IF( LSAME( CMACH, 'U' ) ) THEN
--         RMACH = tiny(zero)
-+         RMACH = TINYDBL(zero)
-       ELSE IF( LSAME( CMACH, 'L' ) ) THEN
--         RMACH = MAXEXPONENT(ZERO)
-+         RMACH = MAXEXPONENTDBL(ZERO)
-       ELSE IF( LSAME( CMACH, 'O' ) ) THEN
--         RMACH = HUGE(ZERO)
-+         RMACH = HUGEDBL(ZERO)
-       ELSE
-          RMACH = ZERO
-       END IF
diff -Nru igraph-0.6.5~quantal1/tools/lapack/lenscrub.l igraph-0.6.5/tools/lapack/lenscrub.l
--- igraph-0.6.5~quantal1/tools/lapack/lenscrub.l	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/lenscrub.l	1970-01-01 00:00:00.000000000 +0000
@@ -1,42 +0,0 @@
-/* {definitions} */
-iofun	"("[^;\{]*[;\{]
-decl	"("[^)]*")"[,;]
-any	[.]*
-S	[ \t\n]*
-cS	","{S}
-len	[a-z][a-z0-9]*_len
-
-%%
-"s_stop"{decl}          |
-"do_fio"{decl}          |
-"s_cat"{iofun}          |
-"s_copy"{iofun}         |
-"s_stop"{iofun}         |
-"s_cmp"{iofun}          |
-"i_len"{iofun}          |
-"len_trim__"{iofun}     |
-"do_fio"{iofun}         |
-"do_lio"{iofun}         { printf("%s", yytext); /* unchanged */ }
-{any}"ilaenv_("         |
-"dvout_("               |
-"dmout_("               |
-"ivout_("               |
-"xerbla_("              |
-[a-z]"tim"[a-z0-9]*"_(" |
-[a-z]"prtb"[a-z0-9]"_(" { 
-                          register int c, paran_count = 1;
-                          printf("%s", yytext); /* unchanged */ 	
-			  /* Loop until the correct closing paranthesis */
-                          while (paran_count != 0) {
-                              c = input();
-                              if (c == '(') ++paran_count;
-                              else if (c == ')') --paran_count;
-                              putchar(c);
-                          } 
-                        }
-{cS}"("{S}ftnlen{S}")"{S}[1-9][0-9]* { ; /* omit -- f2c -A */ }
-{cS}[1-9]([0-9])*L	{ ; /* omit */ }
-{cS}ftnlen({S}{len})?	{ ; /* omit -- f2c -A */ }
-^ftnlen" "{len}";\n"	{ ; /* omit -- f2c without -A or -C++ */ }
-{cS}{len}		{ ; }
-.			{ printf("%s", yytext); /* unchanged */ }
diff -Nru igraph-0.6.5~quantal1/tools/lapack/mt.patch igraph-0.6.5/tools/lapack/mt.patch
--- igraph-0.6.5~quantal1/tools/lapack/mt.patch	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/mt.patch	1970-01-01 00:00:00.000000000 +0000
@@ -1,498 +0,0 @@
-=== modified file 'src/lapack/dgetv0.c'
---- src/lapack/dgetv0.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dgetv0.c	2011-11-03 13:12:52 +0000
-@@ -144,7 +144,7 @@
- {
-     /* Initialized data */
- 
--    static logical inits = TRUE_;
-+    IGRAPH_F77_SAVE logical inits = TRUE_;
- 
-     /* System generated locals */
-     integer v_dim1, v_offset, i__1;
-@@ -157,29 +157,29 @@
-     integer jj, nbx;
-     extern doublereal igraphddot_(integer *, doublereal *, integer *, doublereal *, 
- 	    integer *);
--    static integer iter;
--    static logical orth;
-+    IGRAPH_F77_SAVE integer iter;
-+    IGRAPH_F77_SAVE logical orth;
-     integer nopx;
-     extern doublereal igraphdnrm2_(integer *, doublereal *, integer *);
--    static integer iseed[4];
-+    IGRAPH_F77_SAVE integer iseed[4];
-     extern /* Subroutine */ int igraphdgemv_(char *, integer *, integer *, 
- 	    doublereal *, doublereal *, integer *, doublereal *, integer *, 
- 	    doublereal *, doublereal *, integer *);
-     integer idist;
-     extern /* Subroutine */ int igraphdcopy_(integer *, doublereal *, integer *, 
- 	    doublereal *, integer *);
--    static logical first;
-+    IGRAPH_F77_SAVE logical first;
-     real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen);
-     integer mgetv0=0;
-     real tgetv0;
--    static doublereal rnorm0;
-+    IGRAPH_F77_SAVE doublereal rnorm0;
-     extern /* Subroutine */ int igraphsecond_(real *);
-     integer logfil=0, ndigit;
-     extern /* Subroutine */ int igraphdlarnv_(integer *, integer *, integer *, 
- 	    doublereal *);
--    static integer msglvl;
-+    IGRAPH_F77_SAVE integer msglvl;
-     real tmvopx;
- 
- 
-
-=== modified file 'src/lapack/dlaln2.c'
---- src/lapack/dlaln2.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dlaln2.c	2011-11-03 13:47:19 +0000
-@@ -28,7 +28,7 @@
-     /* System generated locals */
-     integer a_dim1, a_offset, b_dim1, b_offset, x_dim1, x_offset;
-     doublereal d__1, d__2, d__3, d__4, d__5, d__6;
--    static doublereal equiv_0[4], equiv_1[4];
-+    IGRAPH_F77_SAVE doublereal equiv_0[4], equiv_1[4];
- 
-     /* Local variables */
-     integer j;
-
-=== modified file 'src/lapack/dnaitr.c'
---- src/lapack/dnaitr.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dnaitr.c	2011-11-03 13:12:52 +0000
-@@ -236,7 +236,7 @@
- {
-     /* Initialized data */
- 
--    static logical first = TRUE_;
-+    IGRAPH_F77_SAVE logical first = TRUE_;
- 
-     /* System generated locals */
-     integer h_dim1, h_offset, v_dim1, v_offset, i__1, i__2;
-@@ -247,24 +247,24 @@
- 
-     /* Local variables */
-     integer i__;
--    static integer j;
-+    IGRAPH_F77_SAVE integer j;
-     real t0, t1, t2, t3, t4, t5;
-     integer jj;
--    static integer ipj, irj;
-+    IGRAPH_F77_SAVE integer ipj, irj;
-     integer nbx;
--    static integer ivj;
--    static doublereal ulp;
-+    IGRAPH_F77_SAVE integer ivj;
-+    IGRAPH_F77_SAVE doublereal ulp;
-     doublereal tst1;
-     extern doublereal igraphddot_(integer *, doublereal *, integer *, doublereal *, 
- 	    integer *);
--    static integer ierr, iter;
--    static doublereal unfl, ovfl;
-+    IGRAPH_F77_SAVE integer ierr, iter;
-+    IGRAPH_F77_SAVE doublereal unfl, ovfl;
-     integer nopx;
--    static integer itry;
-+    IGRAPH_F77_SAVE integer itry;
-     extern doublereal igraphdnrm2_(integer *, doublereal *, integer *);
-     doublereal temp1;
--    static logical orth1, orth2, step3, step4;
--    static doublereal betaj;
-+    IGRAPH_F77_SAVE logical orth1, orth2, step3, step4;
-+    IGRAPH_F77_SAVE doublereal betaj;
-     extern /* Subroutine */ int igraphdscal_(integer *, doublereal *, doublereal *, 
- 	    integer *), igraphdgemv_(char *, integer *, integer *, doublereal *, 
- 	    doublereal *, integer *, doublereal *, integer *, doublereal *, 
-@@ -279,12 +279,12 @@
-     real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen);
--    static doublereal wnorm;
-+    IGRAPH_F77_SAVE doublereal wnorm;
-     extern /* Subroutine */ int igraphivout_(integer *, integer *, integer *, 
- 	    integer *, char *, ftnlen), igraphdgetv0_(integer *, char *, integer *, 
- 	    logical *, integer *, integer *, doublereal *, integer *, 
- 	    doublereal *, doublereal *, integer *, doublereal *, integer *), igraphdlabad_(doublereal *, doublereal *);
--    static doublereal rnorm1;
-+    IGRAPH_F77_SAVE doublereal rnorm1;
-     extern doublereal igraphdlamch_(char *);
-     extern /* Subroutine */ int igraphdlascl_(char *, integer *, integer *, 
- 	    doublereal *, doublereal *, integer *, integer *, doublereal *, 
-@@ -294,10 +294,10 @@
-     extern /* Subroutine */ int igraphsecond_(real *);
-     integer logfil=0, ndigit, nitref, mnaitr=0;
-     real titref, tnaitr;
--    static integer msglvl;
--    static doublereal smlnum;
-+    IGRAPH_F77_SAVE integer msglvl;
-+    IGRAPH_F77_SAVE doublereal smlnum;
-     integer nrorth;
--    static logical rstart;
-+    IGRAPH_F77_SAVE logical rstart;
-     integer nrstrt;
-     real tmvopx;
- 
-
-=== modified file 'src/lapack/dnapps.c'
---- src/lapack/dnapps.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dnapps.c	2011-11-03 13:12:52 +0000
-@@ -168,7 +168,7 @@
- {
-     /* Initialized data */
- 
--    static logical first = TRUE_;
-+    IGRAPH_F77_SAVE logical first = TRUE_;
- 
-     /* System generated locals */
-     integer h_dim1, h_offset, v_dim1, v_offset, q_dim1, q_offset, i__1, i__2, 
-@@ -183,10 +183,10 @@
-     doublereal h11, h12, h21, h22, h32;
-     integer jj, ir, nr;
-     doublereal tau;
--    static doublereal ulp;
-+    IGRAPH_F77_SAVE doublereal ulp;
-     doublereal tst1;
-     integer iend;
--    static doublereal unfl, ovfl;
-+    IGRAPH_F77_SAVE doublereal unfl, ovfl;
-     extern /* Subroutine */ int igraphdscal_(integer *, doublereal *, doublereal *, 
- 	    integer *), igraphdlarf_(char *, integer *, integer *, doublereal *, 
- 	    integer *, doublereal *, doublereal *, integer *, doublereal *);
-@@ -218,7 +218,7 @@
-     integer mnapps=0, msglvl;
-     real tnapps;
-     integer istart;
--    static doublereal smlnum;
-+    IGRAPH_F77_SAVE doublereal smlnum;
-     integer kplusp;
- 
- 
-
-=== modified file 'src/lapack/dnaup2.c'
---- src/lapack/dnaup2.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dnaup2.c	2011-11-03 13:12:52 +0000
-@@ -213,44 +213,44 @@
-     double sqrt(doublereal);
- 
-     /* Local variables */
--    static integer j;
--    static real t0, t1, t2, t3;
--    static integer kp[4], np0, nbx, nev0;
-+    IGRAPH_F77_SAVE integer j;
-+    IGRAPH_F77_SAVE real t0, t1, t2, t3;
-+    IGRAPH_F77_SAVE integer kp[4], np0, nbx, nev0;
-     extern doublereal igraphddot_(integer *, doublereal *, integer *, doublereal *, 
- 	    integer *);
--    static doublereal eps23;
--    static integer ierr, iter;
--    static doublereal temp;
-+    IGRAPH_F77_SAVE doublereal eps23;
-+    IGRAPH_F77_SAVE integer ierr, iter;
-+    IGRAPH_F77_SAVE doublereal temp;
-     extern doublereal igraphdnrm2_(integer *, doublereal *, integer *);
--    static logical getv0, cnorm;
-+    IGRAPH_F77_SAVE logical getv0, cnorm;
-     extern /* Subroutine */ int igraphdcopy_(integer *, doublereal *, integer *, 
- 	    doublereal *, integer *);
--    static integer nconv;
-+    IGRAPH_F77_SAVE integer nconv;
-     extern /* Subroutine */ int igraphdmout_(integer *, integer *, integer *, 
- 	    doublereal *, integer *, integer *, char *, ftnlen);
--    static logical initv;
--    static doublereal rnorm;
--    static real tmvbx;
-+    IGRAPH_F77_SAVE logical initv;
-+    IGRAPH_F77_SAVE doublereal rnorm;
-+    IGRAPH_F77_SAVE real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen), igraphivout_(integer *, integer *, integer *
- 	    , integer *, char *, ftnlen), igraphdgetv0_(integer *, char *, integer *
- 	    , logical *, integer *, integer *, doublereal *, integer *, 
- 	    doublereal *, doublereal *, integer *, doublereal *, integer *);
-     extern doublereal igraphdlapy2_(doublereal *, doublereal *);
--    static integer mnaup2=0;
--    static real tnaup2;
-+    IGRAPH_F77_SAVE integer mnaup2=0;
-+    IGRAPH_F77_SAVE real tnaup2;
-     extern doublereal igraphdlamch_(char *);
-     extern /* Subroutine */ int igraphdneigh_(doublereal *, integer *, doublereal *,
- 	     integer *, doublereal *, doublereal *, doublereal *, doublereal *
- 	    , integer *, doublereal *, integer *);
--    static integer nevbef;
-+    IGRAPH_F77_SAVE integer nevbef;
-     extern /* Subroutine */ int igraphsecond_(real *);
--    static integer logfil=0, ndigit;
-+    IGRAPH_F77_SAVE integer logfil=0, ndigit;
-     extern /* Subroutine */ int igraphdnaitr_(integer *, char *, integer *, integer 
- 	    *, integer *, integer *, doublereal *, doublereal *, doublereal *,
- 	     integer *, doublereal *, integer *, integer *, doublereal *, 
- 	    integer *);
--    static logical update;
-+    IGRAPH_F77_SAVE logical update;
-     extern /* Subroutine */ int igraphdngets_(integer *, char *, integer *, integer 
- 	    *, doublereal *, doublereal *, doublereal *, doublereal *, 
- 	    doublereal *), igraphdnapps_(integer *, integer *, integer *, 
-@@ -259,9 +259,9 @@
- 	    doublereal *), igraphdnconv_(integer *, doublereal *, doublereal *, 
- 	    doublereal *, doublereal *, integer *), igraphdsortc_(char *, logical *,
- 	     integer *, doublereal *, doublereal *, doublereal *);
--    static logical ushift;
--    static char wprime[2];
--    static integer msglvl, nptemp, numcnv, kplusp;
-+    IGRAPH_F77_SAVE logical ushift;
-+    IGRAPH_F77_SAVE char wprime[2];
-+    IGRAPH_F77_SAVE integer msglvl, nptemp, numcnv, kplusp;
- 
- 
- /*     %----------------------------------------------------%   
-
-=== modified file 'src/lapack/dnaupd.c'
---- src/lapack/dnaupd.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dnaupd.c	2011-11-03 13:12:52 +0000
-@@ -464,19 +464,19 @@
-     /* Local variables */
-     integer j;
-     real t0, t1;
--    static integer nb, ih, iq, np, iw, ldh, ldq;
-+    IGRAPH_F77_SAVE integer nb, ih, iq, np, iw, ldh, ldq;
-     integer nbx;
--    static integer nev0, mode;
-+    IGRAPH_F77_SAVE integer nev0, mode;
-     integer ierr;
--    static integer iupd, next;
-+    IGRAPH_F77_SAVE integer iupd, next;
-     integer nopx;
--    static integer levec;
-+    IGRAPH_F77_SAVE integer levec;
-     real trvec, tmvbx;
--    static integer ritzi;
-+    IGRAPH_F77_SAVE integer ritzi;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen), igraphivout_(integer *, integer *, integer *
- 	    , integer *, char *, ftnlen);
--    static integer ritzr;
-+    IGRAPH_F77_SAVE integer ritzr;
-     extern /* Subroutine */ int igraphdnaup2_(integer *, char *, integer *, char *, 
- 	    integer *, integer *, doublereal *, doublereal *, integer *, 
- 	    integer *, integer *, integer *, doublereal *, integer *, 
-@@ -489,15 +489,15 @@
-     integer logfil=0, ndigit;
-     real tneigh;
-     integer mnaupd=0;
--    static integer ishift;
-+    IGRAPH_F77_SAVE integer ishift;
-     integer nitref;
--    static integer bounds;
-+    IGRAPH_F77_SAVE integer bounds;
-     real tnaupd;
-     extern /* Subroutine */ int igraphdstatn_(void);
-     real titref, tnaitr;
--    static integer msglvl;
-+    IGRAPH_F77_SAVE integer msglvl;
-     real tngets, tnapps, tnconv;
--    static integer mxiter;
-+    IGRAPH_F77_SAVE integer mxiter;
-     integer nrorth, nrstrt;
-     real tmvopx;
- 
-
-=== modified file 'src/lapack/dsaitr.c'
---- src/lapack/dsaitr.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dsaitr.c	2011-11-03 13:12:53 +0000
-@@ -231,7 +231,7 @@
- {
-     /* Initialized data */
- 
--    static logical first = TRUE_;
-+    IGRAPH_F77_SAVE logical first = TRUE_;
- 
-     /* System generated locals */
-     integer h_dim1, h_offset, v_dim1, v_offset, i__1;
-@@ -241,20 +241,20 @@
- 
-     /* Local variables */
-     integer i__;
--    static integer j;
-+    IGRAPH_F77_SAVE integer j;
-     real t0, t1, t2, t3, t4, t5;
-     integer jj;
--    static integer ipj, irj;
-+    IGRAPH_F77_SAVE integer ipj, irj;
-     integer nbx;
--    static integer ivj;
-+    IGRAPH_F77_SAVE integer ivj;
-     extern doublereal igraphddot_(integer *, doublereal *, integer *, doublereal *, 
- 	    integer *);
--    static integer ierr, iter;
-+    IGRAPH_F77_SAVE integer ierr, iter;
-     integer nopx;
--    static integer itry;
-+    IGRAPH_F77_SAVE integer itry;
-     extern doublereal igraphdnrm2_(integer *, doublereal *, integer *);
-     doublereal temp1;
--    static logical orth1, orth2, step3, step4;
-+    IGRAPH_F77_SAVE logical orth1, orth2, step3, step4;
-     extern /* Subroutine */ int igraphdscal_(integer *, doublereal *, doublereal *, 
- 	    integer *), igraphdgemv_(char *, integer *, integer *, doublereal *, 
- 	    doublereal *, integer *, doublereal *, integer *, doublereal *, 
-@@ -266,25 +266,25 @@
-     real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen);
--    static doublereal wnorm;
-+    IGRAPH_F77_SAVE doublereal wnorm;
-     extern /* Subroutine */ int igraphivout_(integer *, integer *, integer *, 
- 	    integer *, char *, ftnlen), igraphdgetv0_(integer *, char *, integer *, 
- 	    logical *, integer *, integer *, doublereal *, integer *, 
- 	    doublereal *, doublereal *, integer *, doublereal *, integer *);
--    static doublereal rnorm1;
-+    IGRAPH_F77_SAVE doublereal rnorm1;
-     extern doublereal igraphdlamch_(char *);
-     extern /* Subroutine */ int igraphdlascl_(char *, integer *, integer *, 
- 	    doublereal *, doublereal *, integer *, integer *, doublereal *, 
- 	    integer *, integer *), igraphsecond_(real *);
-     integer logfil=0;
--    static doublereal safmin;
-+    IGRAPH_F77_SAVE doublereal safmin;
-     integer ndigit, nitref;
-     real titref;
-     integer msaitr=0;
--    static integer msglvl;
-+    IGRAPH_F77_SAVE integer msglvl;
-     real tsaitr;
-     integer nrorth;
--    static logical rstart;
-+    IGRAPH_F77_SAVE logical rstart;
-     integer nrstrt;
-     real tmvopx;
- 
-
-=== modified file 'src/lapack/dsapps.c'
---- src/lapack/dsapps.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dsapps.c	2011-11-03 13:12:53 +0000
-@@ -156,7 +156,7 @@
- {
-     /* Initialized data */
- 
--    static logical first = TRUE_;
-+    IGRAPH_F77_SAVE logical first = TRUE_;
- 
-     /* System generated locals */
-     integer h_dim1, h_offset, q_dim1, q_offset, v_dim1, v_offset, i__1, i__2, 
-@@ -185,7 +185,7 @@
- 	    integer *, doublereal *, integer *, doublereal *, integer *), igraphdlartg_(doublereal *, doublereal *, doublereal *, 
- 	    doublereal *, doublereal *), igraphdlaset_(char *, integer *, integer *,
- 	     doublereal *, doublereal *, doublereal *, integer *);
--    static doublereal epsmch;
-+    IGRAPH_F77_SAVE doublereal epsmch;
-     integer logfil=0, ndigit, msapps=0, msglvl, istart;
-     real tsapps;
-     integer kplusp;
-
-=== modified file 'src/lapack/dsaup2.c'
---- src/lapack/dsaup2.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dsaup2.c	2011-11-03 13:12:53 +0000
-@@ -221,26 +221,26 @@
-     integer j;
-     real t0, t1, t2, t3;
-     integer kp[3];
--    static integer np0;
-+    IGRAPH_F77_SAVE integer np0;
-     integer nbx;
--    static integer nev0;
-+    IGRAPH_F77_SAVE integer nev0;
-     extern doublereal igraphddot_(integer *, doublereal *, integer *, doublereal *, 
- 	    integer *);
--    static doublereal eps23;
-+    IGRAPH_F77_SAVE doublereal eps23;
-     integer ierr;
--    static integer iter;
-+    IGRAPH_F77_SAVE integer iter;
-     doublereal temp;
-     integer nevd2;
-     extern doublereal igraphdnrm2_(integer *, doublereal *, integer *);
--    static logical getv0;
-+    IGRAPH_F77_SAVE logical getv0;
-     integer nevm2;
--    static logical cnorm;
-+    IGRAPH_F77_SAVE logical cnorm;
-     extern /* Subroutine */ int igraphdcopy_(integer *, doublereal *, integer *, 
- 	    doublereal *, integer *), igraphdswap_(integer *, doublereal *, integer 
- 	    *, doublereal *, integer *);
--    static integer nconv;
--    static logical initv;
--    static doublereal rnorm;
-+    IGRAPH_F77_SAVE integer nconv;
-+    IGRAPH_F77_SAVE logical initv;
-+    IGRAPH_F77_SAVE doublereal rnorm;
-     real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen), igraphivout_(integer *, integer *, integer *
-@@ -255,7 +255,7 @@
-     integer logfil=0, ndigit;
-     extern /* Subroutine */ int igraphdseigt_(doublereal *, integer *, doublereal *,
- 	     integer *, doublereal *, doublereal *, doublereal *, integer *);
--    static logical update;
-+    IGRAPH_F77_SAVE logical update;
-     extern /* Subroutine */ int igraphdsaitr_(integer *, char *, integer *, integer 
- 	    *, integer *, integer *, doublereal *, doublereal *, doublereal *,
- 	     integer *, doublereal *, integer *, integer *, doublereal *, 
-@@ -265,13 +265,13 @@
- 	    integer *, doublereal *, integer *, doublereal *, doublereal *, 
- 	    integer *, doublereal *), igraphdsconv_(integer *, doublereal *, 
- 	    doublereal *, doublereal *, integer *);
--    static logical ushift;
-+    IGRAPH_F77_SAVE logical ushift;
-     char wprime[2];
--    static integer msglvl;
-+    IGRAPH_F77_SAVE integer msglvl;
-     integer nptemp;
-     extern /* Subroutine */ int igraphdsortr_(char *, logical *, integer *, 
- 	    doublereal *, doublereal *);
--    static integer kplusp;
-+    IGRAPH_F77_SAVE integer kplusp;
- 
- 
- /*     %----------------------------------------------------%   
-
-=== modified file 'src/lapack/dsaupd.c'
---- src/lapack/dsaupd.c	2011-11-02 20:55:12 +0000
-+++ src/lapack/dsaupd.c	2011-11-03 13:12:53 +0000
-@@ -465,11 +465,11 @@
-     /* Local variables */
-     integer j;
-     real t0, t1;
--    static integer nb, ih, iq, np, iw, ldh, ldq;
-+    IGRAPH_F77_SAVE integer nb, ih, iq, np, iw, ldh, ldq;
-     integer nbx;
--    static integer nev0, mode, ierr, iupd, next;
-+    IGRAPH_F77_SAVE integer nev0, mode, ierr, iupd, next;
-     integer nopx;
--    static integer ritz;
-+    IGRAPH_F77_SAVE integer ritz;
-     real tmvbx;
-     extern /* Subroutine */ int igraphdvout_(integer *, integer *, doublereal *, 
- 	    integer *, char *, ftnlen), igraphivout_(integer *, integer *, integer *
-@@ -483,14 +483,14 @@
-     extern doublereal igraphdlamch_(char *);
-     extern /* Subroutine */ int igraphsecond_(real *);
-     integer logfil=0, ndigit;
--    static integer ishift;
-+    IGRAPH_F77_SAVE integer ishift;
-     integer nitref, msaupd=0;
--    static integer bounds;
-+    IGRAPH_F77_SAVE integer bounds;
-     real titref, tseigt, tsaupd;
-     extern /* Subroutine */ int igraphdstats_(void);
--    static integer msglvl;
-+    IGRAPH_F77_SAVE integer msglvl;
-     real tsaitr;
--    static integer mxiter;
-+    IGRAPH_F77_SAVE integer mxiter;
-     real tsgets, tsapps;
-     integer nrorth;
-     real tsconv;
-
diff -Nru igraph-0.6.5~quantal1/tools/lapack/split.sed igraph-0.6.5/tools/lapack/split.sed
--- igraph-0.6.5~quantal1/tools/lapack/split.sed	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/lapack/split.sed	1970-01-01 00:00:00.000000000 +0000
@@ -1,55 +0,0 @@
-# delete the header produced by f2c
-/\/\*  -- trans.*/,/\*\//{
-d
-}
-
-# extract the first line of including f2c.h
-/#include/,/^$/{
-w temp/header1
-d
-}
-
-# possible local constants produced by f2c
-/\/\* Table of constant values \*\//{
-s/^/    /
-w temp/header2
-d
-}
-/^static.*=.*/,/^$/{
-s/^/    /
-w temp/header2
-d
-}
-
-# matches /* Subroutine */..._(  or /* Complex */..._(
-/^\/\* .*_(/,/^\{/{
-w temp/header3
-/^\{/!{
-d
-}
-}
-# matches any function declaration line
-/^[a-zA-Z].*_(/,/^\{/{
-w temp/header3
-/^\{/!{
-d
-}
-}
-
-/^\{/,/\/\*.*LAPACK/{
-/\/\*.*LAPACK/!{
-/^$/d
-/^\{/d
-w temp/prologue
-d
-}
-}
-
-/\/\*.*LAPACK/,/\*\//{
-w temp/comment
-d
-}
-
-
-w temp/code
-
diff -Nru igraph-0.6.5~quantal1/tools/launchpad_nightly.recipe igraph-0.6.5/tools/launchpad_nightly.recipe
--- igraph-0.6.5~quantal1/tools/launchpad_nightly.recipe	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/launchpad_nightly.recipe	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-# bzr-builder format 0.3 deb-version 0.6~bzr{revno}
-lp:igraph/0.6-main
\ No newline at end of file
diff -Nru igraph-0.6.5~quantal1/tools/leakcheck igraph-0.6.5/tools/leakcheck
--- igraph-0.6.5~quantal1/tools/leakcheck	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/leakcheck	1970-01-01 00:00:00.000000000 +0000
@@ -1,132 +0,0 @@
-#!/bin/bash
-#
-# Valgrind leak check for the given subdirectory.
-# The given subdirectory must be an igraph root subdir
-function usage {
-  echo Usage: $0 [directory]
-  echo directory must be the root of an igraph tree.
-  echo If omitted, assumes that the script itself is in the igraph tree
-}
-
-VALGRIND=`which valgrind`
-
-if [ x$VALGRIND == x ]; then
-  echo Error: Valgrind is not installed
-  exit 3
-fi
-
-if [ x$1 == -h -o x$1 == --help ]; then
-  usage
-  exit 1
-fi
-
-ORIGDIR=`pwd`
-DIR=$1
-if [ x$DIR == x ]; then
-  # No directory was given, start backtracking from the current
-  OK=0
-  PREVDIR="/"
-  DIR=`pwd`
-  while [ $OK -eq 0 -a ${PREVDIR} != ${DIR} ]; do
-    if [ -f include/igraph.h ]; then
-      OK=1
-    else
-      cd ..
-      DIR=`pwd`
-    fi
-  done
-  cd ${ORIGDIR}
-  if [ $OK -eq 0 ]; then
-    echo Error: no igraph tree was given and not in an igraph tree
-    usage
-    exit 4
-  fi
-fi
-
-if [ ! -d $DIR -o ! -f $DIR/include/igraph.h ]; then
-  echo $DIR is not an igraph root subdirectory
-  exit 2
-fi
-
-TESTBED="valgrind-testbed"
-FULLDIR=`cd $DIR && pwd && cd ..`
-TESTBEDDIR=${FULLDIR}/${TESTBED}
-
-if [ ! -f $DIR/configure ]; then
-  cd $DIR
-  ./bootstrap.sh
-  cd $ORIGDIR
-fi
-
-if [ ! -d $TESTBED ]; then
-  mkdir $TESTBED
-fi
-
-# run make distclean on the original tree if necessary
-if [ -f ${FULLDIR}/Makefile ]; then
-  cd ${FULLDIR} && make distclean && cd ${ORIGDIR}
-fi
-
-cd $TESTBED || exit 3
-${FULLDIR}/configure --enable-debug || ( cd $ORIGDIR; exit 4 )
-make || (cd $ORIGDIR; exit 5 )
-rm -f a.out
-
-if [ `grep -c "HAVE_TLS 1" config.h` -gt 0 ]; then
-	PTHREADS_LIBS=-lpthread
-else
-	PTHREADS_LIBS=
-fi
-
-mkdir -p examples/simple
-rm -rf examples/simple/*
-cp ${FULLDIR}/examples/simple/* examples/simple
-
-mkdir -p valgrind-logs
-rm -rf valgrind-logs/*
-
-cd examples/simple
-
-SKIPS="igraph_layout_merge.c igraph_es_adj.c igraph_es_fromto.c"
-for i in *.c; do
-  current=$i
-  OK=1
-  for skip in $SKIPS; do
-    if [ $skip == $current ]; then OK=0; fi
-  done
-  echo -n "${current}... "
-  if [ $OK -eq 0 ]; then
-    echo "skipped."
-  else
-    gcc -g -o a.out $i -I${ORIGDIR}/include -I${TESTBEDDIR}/include -I${ORIGDIR}/src -I${TESTBEDDIR} -L../../src/.libs -ligraph ${PTHREADS_LIBS}
-    if [ -x a.out ]; then
-      echo -n "compiled... "
-      LOG=../../valgrind-logs/`basename ${current} .c`.log
-      LD_LIBRARY_PATH=../../src/.libs valgrind --tool=memcheck --error-exitcode=63 --leak-check=yes --show-reachable=yes --log-file=${LOG} --suppressions=${ORIGDIR}/tools/leakcheck.supp ./a.out >/dev/null
-      ERRCODE=$?
-      if [ $ERRCODE -eq 63 ]; then
-        echo "executed, memory access problems found!"
-      elif [ $ERRCODE -eq 77 ]; then
-        echo "skipped, OK"
-      elif [ $ERRCODE -ne 0 ]; then
-        echo "test case failed, error code: $ERRCODE!"
-      elif [ `cat $LOG | grep -c 'no leaks are possible'` -ne 1 ]; then
-        if [ `cat $LOG | grep -c 'lost: 0 bytes'` -lt 2 ]; then
-	  echo "executed, leaks found!"
-        else
-	  echo "executed, OK"
-	  rm ${LOG}
-	fi
-      else
-        echo "executed, OK"
-	rm ${LOG}
-      fi
-    else
-      echo "compilation FAILED!"
-    fi
-    rm -f a.out
-  fi
-done
-cd ../..
-
-cd $ORIGDIR
diff -Nru igraph-0.6.5~quantal1/tools/leakcheck.supp igraph-0.6.5/tools/leakcheck.supp
--- igraph-0.6.5~quantal1/tools/leakcheck.supp	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/leakcheck.supp	1970-01-01 00:00:00.000000000 +0000
@@ -1,6 +0,0 @@
-{
-	malloc/glp_init_env
-	Memcheck:Leak
-	fun:malloc
-	fun:glp_init_env
-}
diff -Nru igraph-0.6.5~quantal1/tools/nightly igraph-0.6.5/tools/nightly
--- igraph-0.6.5~quantal1/tools/nightly	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/nightly	1970-01-01 00:00:00.000000000 +0000
@@ -1,219 +0,0 @@
-#! /bin/bash
-#
-# Nightly build script for igraph branches.
-# 
-# Requirements:
-# - a valid Google Code account with password and upload access to the
-#   igraph project
-# - googlecode_upload.py
-# - passwordless access to igraph's Bazaar repository at Launchpad
-#
-# TODO:
-# - collect output and put it online as well
-
-## Some functions
-usage() {
-    echo >&2 "Usage: `basename $0` [-f] [-t] [-i interfaces] working-directory"
-	echo >&2 ""
-	echo >&2 "Options:"
-	echo >&2 "  -f: force upload (even if nothing has changed)"
-	echo >&2 "  -t: test only, don't upload"
-	echo >&2 "  -i: compile and upload only the specified interfaces."
-	echo >&2 "      Must be a comma-separated list of the following:"
-	echo >&2 "      c, r, python."
-}
-
-## default options
-force=no
-upload=yes
-interfaces="c,r"
- 
-## handle options
-while getopts fi:t o
-do
-    case "$o" in
-	f)    force=yes;;
-	i)    interfaces=$OPTARG;;
-	t)    upload=no;;
-	[?])  usage
-	      exit 1;;
-    esac
-done
-shift $(($OPTIND-1))
-	    
-
-## do we have the argument?
-if [ $# -eq 0 ]; then
-    usage
-    exit 1
-fi
-
-## in testing mode, there is no need for GC_USERNAME or GC_PASSWORD
-if [ x$upload = xno ]; then
-	GC_USERNAME=dummy
-	GC_PASSWORD=dummy
-fi
-
-## check required environment variables
-if [ x$GC_USERNAME = x ]; then
-    echo "Please set the GC_USERNAME environment variable to your Google Code username"
-	exit 1
-fi
-if [ x$GC_PASSWORD = x ]; then
-	echo -n "Password: "
-	stty -echo
-	read GC_PASSWORD
-	stty echo
-	echo ""
-	if [ x$GC_PASSWORD = x ]; then exit 1; fi
-fi
-
-## check what to build
-build_c=0
-build_python=0
-build_r=0
-for interface in `echo $interfaces | tr ',' ' '`; do
-	case "$interface" in
-	c) build_c=1;;
-	python) build_python=1;;
-	r) build_r=1;;
-	esac
-done
-
-## working directory
-dir="$1"
-cd $dir
-
-## Bazaar tree
-tree=`basename $dir`
-
-## update from Launchpad
-revisionbefore=`bzr revno`
-bzr pull || exit 2
-revision=`bzr revno`
-
-if [ x"$force" != "xyes" ]; then
-    if [ x"$revisionbefore" = x"$revision" ]; then
-	exit 0
-    fi
-fi
-
-## current version
-version=`head -1 configure.in | cut -f2 -d, | tr -d ' '`
-
-## mount savannah download area
-#mount | grep -q "^dl.sv.gnu.org:/releases/igraph" ||
-#sshfs dl.sv.gnu.org:/releases/igraph /home/csardi/savannah || exit 2
-#mkdir -p ~/savannah/nightly-builds/$version/R-package
-#mkdir -p ~/savannah/nightly-builds/$version/C-library
-
-## autotools
-./bootstrap.sh || exit 3
-./configure || exit 6
-
-## compile
-make || exit 7
-
-## check
-make check
-
-if [ $build_c = 1 ]; then
-	## create documentation
-	cd doc
-	make
-	# make html
-	make info
-	# make pdf
-	cd ..
-
-	## create tar.gz file
-	make dist || exit 20
-	CPACKAGE="igraph-nightly-$version-$revision-`date +'%Y%m%d'`.tar.gz"
-	rm -f $CPACKAGE
-	mv igraph-$version.tar.gz $CPACKAGE || exit 21
-
-	## sign and upload C package
-	#rm -rf $CPACKAGE.sig
-	#gpg -b --use-agent $CPACKAGE
-	#cp $CPACKAGE $CPACKAGE.sig ~/savannah/nightly-builds/$version/C-library/
-
-	## upload to google code
-	if [ x$upload = xyes ]; then
-		googlecode_upload.py -s \
-		   "Nightly build, C library, $tree tree, revision $revision" \
-		   -p igraph -u $GC_USERNAME -l Type-Source,OpSys-All,Nightly \
-		   -w $GC_PASSWORD $CPACKAGE || exit 22
-	fi
-fi
-
-if [ $build_r = 1 ]; then
-	## Make sure that interfaces/R/configure.in exists
-	./config.status interfaces/R/configure.in
-
-	## R package
-	cd interfaces/R
-
-	## Make sure that interfaces/R/configure also exists
-	autoconf && autoheader
-
-	## Extract the version number of the R interface
-	RVERSION=`cat DESCRIPTION | grep "Version: " | cut -d ' ' -f 2-`
-
-	## Start compilation
-	make
-	
-	## check that package can be installed
-	R CMD check --no-codoc --no-examples --no-tests --no-manual \
-	    igraph_$RVERSION.tar.gz | grep -q "ERROR$"
-	error=$?
-	
-	if [ $error = 0 ]; then
-
-  	    # R_LIBS=~/.R/library R CMD check igraph_$version.tar.gz
-	    RPACKAGE="igraph_nightly_$version-$revision-`date +'%Y%m%d'`.tar.gz"
-	    rm -f $RPACKAGE
-	    mv igraph_$RVERSION.tar.gz $RPACKAGE
-	    
-	    ## sign and upload R package
-	    #rm -rf $RPACKAGE.sig
-	    #gpg -b --use-agent $RPACKAGE
-	    #cp $RPACKAGE $RPACKAGE.sig ~/savannah/nightly-builds/$version/R-package/
-
-
-	    ## upload to google code
-	    if [ x$upload = xyes ]; then
-		googlecode_upload.py -s \
-		    "Nightly build, GNU R source package, $tree tree, revision $revision" \
-		    -p igraph -u $GC_USERNAME -l Type-Rsource,OpSys-All,Nightly \
-		    -w $GC_PASSWORD $RPACKAGE || exit 22
-	    fi
-	    
-	    ## step back to the root
-	    cd ../..
-	fi
-fi
-
-if [ $build_python = 1 ]; then
-	## Python package
-	cd interfaces/python
-	LD_LIBRARY_PATH=../../src/.libs python setup.py build test
-	python setup.py sdist
-	PYPACKAGE=python-igraph_nightly_$version-$revision-`date +'%Y%m%d'`.tar.gz
-	mv dist/python-igraph-$version.tar.gz $PYPACKAGE
-	## upload to google code
-	if [ x$upload = xyes ]; then
-		googlecode_upload.py -s \
-		   "Nightly build, Python source package, $tree tree, revision $revision" \
-		   -p igraph -u $GC_USERNAME -l Type-Pysource,OpSys-All,Nightly \
-		   -w $GC_PASSWORD $PYPACKAGE || exit 22
-	fi
-	## remove nightly build
-	rm -f $PYPACKAGE
-	## step back to the root
-	cd ../..
-fi
-
-## remove build artifacts
-make distclean
-rm -rf interfaces/python/build
-
diff -Nru igraph-0.6.5~quantal1/tools/nxc.py igraph-0.6.5/tools/nxc.py
--- igraph-0.6.5~quantal1/tools/nxc.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/nxc.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,17 +0,0 @@
-#! /usr/bin/env python
-
-cmdfile=open("atlas.py", "r")
-cmd=cmdfile.read()
-cmdfile.close()
-
-exec(cmd.strip())
-
-for g in descr_list:
-    f=open("atlas-"+g[1]+".txt", "w")
-    f.write(str(g[2]))
-    f.write("\n")
-    for edge in g[3]:
-        f.write(str(edge[0]-1))
-        f.write(" ")
-        f.write(str(edge[1]-1))
-        f.write("\n")
diff -Nru igraph-0.6.5~quantal1/tools/nxc2.py igraph-0.6.5/tools/nxc2.py
--- igraph-0.6.5~quantal1/tools/nxc2.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/nxc2.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-#! /usr/bin/env python
-
-cmdfile=open("atlas.py", "r")
-cmd=cmdfile.read()
-cmdfile.close()
-
-exec(cmd.strip())
-
-p=0
-plist=[]
-f=open("atlas-edges.h", "w")
-f.write("real_t igraph_i_atlas_edges[]={\n")
-for g in descr_list:
-    f.write("\t"+str(g[2])+","+str(len(g[3])))
-    plist.append(p)
-    p+=2
-    for edge in g[3]:
-        f.write(",")
-        f.write(str(edge[0]-1))
-        f.write(",")
-        f.write(str(edge[1]-1))
-        p+=2
-    f.write(",\n")
-
-f.write("};\n\nlong int igraph_i_atlas_edges_pos[]={")
-f.write(", ".join(map(str,plist)))
-f.write("};\n\n")
-
diff -Nru igraph-0.6.5~quantal1/tools/removeexamples.py igraph-0.6.5/tools/removeexamples.py
--- igraph-0.6.5~quantal1/tools/removeexamples.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/removeexamples.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,28 +0,0 @@
-#! /usr/bin/env python
-
-import sys
-from xml.etree.ElementTree import ElementTree
-
-def usage():
-    print sys.argv[0], "<infile> <outfile>"
-
-def main():
-    if len(sys.argv) != 3:
-        usage()
-        sys.exit(2)
-    
-    # Read in
-    tree=ElementTree()
-    tree.parse(sys.argv[1])
-    
-    # Remove examples
-    examples=tree.findall(".//example")
-    for ex in examples:
-        prog=ex.find("programlisting")
-        ex.remove(prog)
-
-    # Write result
-    tree.write(sys.argv[2])    
-
-if __name__ == "__main__":
-    main()
diff -Nru igraph-0.6.5~quantal1/tools/seqdict/__init__.py igraph-0.6.5/tools/seqdict/__init__.py
--- igraph-0.6.5~quantal1/tools/seqdict/__init__.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/seqdict/__init__.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,2 +0,0 @@
-from ndict import seqdict
-from mdict import mseqdict
diff -Nru igraph-0.6.5~quantal1/tools/seqdict/mdict.py igraph-0.6.5/tools/seqdict/mdict.py
--- igraph-0.6.5~quantal1/tools/seqdict/mdict.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/seqdict/mdict.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,195 +0,0 @@
-################################################################################
-#  Sequential Dictionary Class                                                 #
-#                                                                              #
-#  by Wolfgang Grafen                                                          #
-#                                                                              #
-#  Version 0.2    11. February 2004
-#                                                                              #
-#  email to: WolfgangGrafen@gmx.de                                             #
-#                                                                              #
-################################################################################
-
-from ndict import seqdict   #Sequential Single Value Dictionary
-from UserList import UserList
-
-class MyUserList(UserList):
-    from UserList import UserList
-    def __init__(self,parent,liste=None):
-      UserList.__init__(self,liste)
-      self.parent = parent  #remember parent for call-back
-    def __delitem__(self, i):
-      del self.data[i]
-      if self.data==[]:     #call-back, deletes item of parent
-        index = self.parent.values().index([])
-        del self.parent[index:index+1]
-        
-class mseqdict(seqdict):    #Sequential Multiple Value Dictionary
-  def __init__(self,List=[],Dict={}):
-    self.list = []
-    self.dict = {}
-    if not List:
-      pass     
-    elif type(List)==type({}):
-      for key,value in List.items():
-        self.__setitem__(key,value)
-    elif List and not Dict: #dict.items()
-      for key,value in List:
-        if isinstance(value,MyUserList):
-          for v in value:
-            self.__setitem__(key,v)
-        else:
-          self.__setitem__(key,value)     
-    elif type(List)==type(Dict)==type([]):
-      for key,value in map(None,List,Dict):
-        self.__setitem__(key,value)
-    else:
-      if isinstance(Dict.values()[0],MyUserList):
-        self.dict = Dict
-        self.list = List
-      else:
-        for key in List:
-          value = Dict[key]
-          if type(value)==type([]):
-            for v in value:
-              self.__setitem__(key,v)
-          else:
-            self.__setitem__(key,value)     
-
-    self_list = self.list
-    self_dict = self.dict
-    for k in self_list:
-        assert self_dict.has_key(k),"key %r not in self.dict" % k
-
-    for k in self_dict.keys():
-        if k not in self_list:
-            self_list.append(k)
-
-  def __setitem__(self,key,value):
-    if not self.dict.has_key(key):
-      self.list.append(key)
-      if isinstance(value,MyUserList):
-        self.dict[key] = value
-      else:
-        self.dict[key]=MyUserList(self,[value])
-    else:
-      values = self.dict[key]
-      if isinstance(value,MyUserList):
-        for v in value:
-          if not v in values:
-            values.extend(MyUserList(self,[v]))
-      else:
-        #if not value in values:
-        for v in values:
-            if v is value:
-                break
-            values.extend(MyUserList(self,[value]))
-  def __delitem__(self, key):
-    del self.dict[key]
-    self.list.remove(key)      
-
-  def append(self,key,value):
-    self.__setitem__(key,value)                 
-  def __setslice__(self,start,stop,newdict):
-    start = max(start,0); stop = max(stop,0)
-    delindexes = []
-    for key in newdict.keys():
-      if self.dict.has_key(key):
-        index = self.list.index(key)
-        delindexes.append(index)
-        if index < start:
-          start = start - 1
-          stop  = stop  - 1
-        elif index >= stop:
-          pass
-        else:
-          stop  = stop - 1
-      else:
-        self.dict[key]=UserList(self)
-    delindexes.sort()
-    delindexes.reverse()
-    for index in delindexes:
-      key = self.list[index]
-      #del   self.dict[key]
-      del  self.list[index]
-    self.list[start:stop] = newdict.list[:]
-    self.dict.update(newdict.dict)  
-  def copy(self):
-    values = map(lambda x:x[:],self.values())
-    return self.__class__(self.list,values)
-  def count(self,value):
-    vallist = self.dict.values()
-    return map(lambda x,y=value:x.count(y),vallist).count(1)
-  def filter(self,function,filtervalues=0):
-    if   filtervalues == 1: #consider key and all keyvalues at once
-      dict = self.__class__()
-      for key,values in self.items():
-        if function(key,values):
-          dict[key]=values
-      return dict
-    elif filtervalues == 2: #consider key and every keyvalue for itself
-      dict = self.__class__()
-      for key,values in self.items():
-        for value in values:
-          if function(key,value):
-            dict[key]=value
-      return dict
-    else:                   #consider key only
-      liste=filter(function,self.list)
-      dict = {}
-      for i in liste:
-        dict[i]=self.dict[i]
-      return self.__class__(liste,dict)
-  def map(self,function,mapvalues=2):
-    if   mapvalues == 1:    #consider key and all keyvalues at once
-      dict = self.__class__()
-      for key,values in self.items():
-        k,v = function(key,values)
-        dict[k]=v
-      return dict
-    else: #if mapvalues!=1: #consider key and every keyvalue for itself
-      dict = self.__class__()
-      for key,values in self.items():
-        for value in values:
-          k,v = function(key,value)
-          dict[k]=v
-      return dict
-  def pop(self,key='...None',value='...None'):
-    if value=='...None':
-      if key=='...None':
-        pos = -1
-        key = self.list[pos]
-      else:
-        pos = self.list.index(key)
-      tmp = self.dict[key]
-      del self.dict[key]
-      return {self.list.pop(pos):tmp}
-    else:
-      val = self.dict[key]
-      index = val.index(value)
-      tmp = val[index]
-      del val[index]
-      return {key:tmp}
-  def remove(self,key,value='...None'):
-    if value=='...None':
-      del self[key]
-    else:
-      index = self[key].index(value) 
-      del self[key][index]
-  def sort(self,func1=None,func2=None):
-    if not func1:
-      self.list.sort()
-    else:
-      apply(self.list.sort,[func1])
-    if func2:
-      for value in self.values():
-        apply(value.sort,[func2])
-      
-  def swap(self):
-    tmp = self.__class__()
-    for key,values in self.items():
-      for value in values:
-        tmp[value]=key
-    self.list,self.dict = tmp.list,tmp.dict
-    del tmp
-  
-  def __repr__(self):return 'mseqdict(\n%s,\n%s)'%(self.list,self.dict)
diff -Nru igraph-0.6.5~quantal1/tools/seqdict/ndict.py igraph-0.6.5/tools/seqdict/ndict.py
--- igraph-0.6.5~quantal1/tools/seqdict/ndict.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/seqdict/ndict.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,233 +0,0 @@
-################################################################################
-#  Sequential Dictionary Class                                                 #
-#                                                                              #
-#  by Wolfgang Grafen                                                          #
-#                                                                              #
-#  Version 0.2    11. February 2004
-#                                                                              #
-#  email to: WolfgangGrafen@gmx.de                                             #
-#                                                                              #
-################################################################################
-# History
-# Version 0.2    11. February 2004                                             #
-# - Fixed slicing problem:
-# 
-#>>> s = seqdict.seqdict(['b'], {'b': 'b'})
-#>>> s[0:0] = seqdict.seqdict(['a'], {'a': 'a'})
-# >>> s
-#seqdict(
-#['a', 'b'],  #was ['a', 'b', 'a'],
-#{'a': 'a', 'b': 'b'})
-#
-# - Initialisation is now correct for:
-# a) Not all keys of dict given in list:
-#>>> seqdict(["a","b","c","d","b","a",],{"a":1,"b":2,"d":4,"c":3,"h":66,"j":77})
-#seqdict(
-#['c', 'd', 'b', 'a', 'h', 'j'],
-#{'a': 1, 'c': 3, 'b': 2, 'd': 4, 'h': 66, 'j': 77})
-#
-# b) exceeding key "p" in list:
-#>>> seqdict(["a","b","c","d","b","a","p"],{"a":1,"b":2,"d":4,"c":3})
-#Traceback (most recent call last):
-#  File "<stdin>", line 1, in ?
-#  File "seqdict/hide/ndict.py", line 53, in __init__
-#    assert self.dict.has_key(k),"key %r not in self.dict" % k
-#AssertionError: key 'p' not in self.dict
-#
-# Version 0.1    24. Oct  2002
-# - Bugfix seqdict(["a","b","c"],[1,2,3]) evaluated into 
-#   seqdict( ['a', 'b', 'd', 'c', 'd'], {'d': 4, 'b': 2, 'c': 3, 'a': 1})
-#
-# Version 0.0    29. June 1999
-
-def is_dict(whatever):
-  try:
-    whatever.keys()
-    return 1
-  except:
-    return 0
-
-class seqdict:
-  def __init__(self,List=[],Dict={}):
-    if is_dict(List):
-      self.list = List.keys()
-      self.dict = List.copy()
-    elif List and not Dict:
-      self.list=[]
-      self.dict={}
-      for i,j in List:
-        self.list.append(i)
-        self.dict[i]=j
-    elif type(List)==type(Dict)==type([]):
-      self.list = List
-      self.dict = {}
-      for key,value in map(None,List,Dict):
-        self.dict[key] = value
-    else:
-      lcopy = List[:]
-      lcopy.reverse()
-      lnew = []
-      for l in lcopy:
-          if not l in lnew:
-              lnew.append(l)
-
-      lnew.reverse()
-      self.list,self.dict = lnew,Dict.copy()
-
-    self_list = self.list
-    self_dict = self.dict
-    for k in self_list:
-        assert self_dict.has_key(k),"key %r not in self.dict" % k
-
-    for k in self_dict.keys():
-        if k not in self_list:
-            self_list.append(k)
-      
-  def append(self,key,value):
-    if self.dict.has_key(key):
-      self.list.remove(key)
-    self.list.append(key)
-    self.dict[key]=value
-  def check(self):
-    if len(self.dict)==len(self.list):
-      l1=self.list[:];l1.sort()
-      l2=self.dict.keys();l2.sort()
-      return l1==l2
-    return -1
-  def clear(self):
-    self.list=[];self.dict={}
-  def copy(self):
-    if self.__class__ is seqdict:
-      return self.__class__(self.list,self.dict)
-    import copy
-    return copy.copy(self)
-  def __cmp__(self,other):
-    return cmp(self.dict,other.dict) or cmp(self.list,other.list)
-  def __getitem__(self,key):
-    if type(key)==type([]):
-      newdict={}
-      for i in key:
-        newdict[i]=self.dict[i]
-      return self.__class__(key,newdict)
-    return self.dict[key]
-  def __setitem__(self,key,value):
-    if not self.dict.has_key(key):
-      self.list.append(key)
-    self.dict[key]=value
-  def __delitem__(self, key):
-    del self.dict[key]
-    self.list.remove(key)      
-  def __getslice__(self,start,stop):
-    start = max(start,0); stop = max(stop,0)
-    newdict = self.__class__()
-    for key in self.list[start:stop]:
-      newdict.dict[key]=self.dict[key]
-    newdict.list[:]=self.list[start:stop]
-    return newdict
-  def __setslice__(self,start,stop,newdict):
-    start = max(start,0); stop = max(stop,0)
-    delindexes = []
-    for key in newdict.keys():
-      if self.dict.has_key(key):
-        index = self.list.index(key)
-        delindexes.append(index)
-        if index < start:
-          start = start - 1
-          stop  = stop  - 1
-        elif index >= stop:
-          pass
-        else:
-          stop  = stop - 1
-    delindexes.sort()
-    delindexes.reverse()
-    for index in delindexes:
-      key = self.list[index]
-      del   self.dict[key]
-      del  self.list[index]
-    for key in self.list[start:stop]:
-      del self.dict[key]
-    self.list[start:stop] = newdict.list[:]
-    self.dict.update(newdict.dict)
-  def __delslice__(self, start, stop):
-      start = max(start, 0); stop = max(stop, 0)
-      for key in self.list[start:stop]:
-        del self.dict[key]
-      del self.list[start:stop]
-  def __add__(self,other):
-    newdict = self.__class__()
-    for key,value in self.items()+other.items():
-      newdict.append(key,value)
-    return newdict    
-  def __radd__(self,other):
-    newdict = self.__class__()
-    for key,value in other.items()+self.items():
-      newdict.append(key,value)
-    return newdict   
-  def count(self,value):
-    vallist = self.dict.values()
-    return vallist.count(value)
-  def extend(self,other):
-    self.update(other)
-  def filter(self,function):
-    liste=filter(function,self.list)
-    dict = {}
-    for i in liste:
-      dict[i]=self.dict[i]
-    return self.__class__(liste,dict)
-  def get(self, key, failobj=None):
-        return self.dict.get(key, failobj)
-  def index(self,key):return self.list.index(key)
-  def insert(self,i,x):self.__setslice__(i,i,x)
-  def items(self):return map(None,self.list,self.values())
-  def has_key(self,key):return self.dict.has_key(key)
-  def keys(self):return self.list
-  def map(self,function):
-    return self.__class__(map(function,self.items()))
-  def values(self):
-    nlist = []
-    for key in self.list:
-      nlist.append(self.dict[key])
-    return nlist
-  def __len__(self):return len(self.list)
-  def pop(self,key=None):
-    if key==None:
-      pos = -1
-      key = self.list[pos]
-    else:
-      pos = self.list.index(key)
-    tmp = self.dict[key]
-    del self.dict[key]
-    return {self.list.pop(pos):tmp}
-  def push(self,key,value):
-    self.append(key,value)
-  def reduce(self,function,start=None):
-    return reduce(function,self.items(),start)
-  def remove(self,key):
-    del self.dict[key]
-    self.list.remove(key)
-  def reverse(self):self.list.reverse()
-  def sort(self,*args):apply(self.list.sort,args)
-  def split(self,function,Ignore=None):
-    splitdict = seqdict() #self.__class__()
-    for key in self.list:
-      skey = function(key)
-      if skey != Ignore:
-        if not splitdict.has_key(skey):
-          splitdict[skey] = self.__class__()
-        splitdict[skey][key] = self.dict[key]
-    return splitdict
-  def swap(self):
-    tmp = self.__class__(map(lambda (x,y):(y,x),self.items()))
-    self.list,self.dict = tmp.list,tmp.dict
-  def update(self,newdict):
-    for key,value in newdict.items():
-      self.__setitem__(key,value)
-  def slice(self,From,To=None,Step=1):
-    From       = self.list.index(From)
-    if To:To   = self.list.index(To)
-    else :
-      To = From + 1
-    List = range(From,To,Step)
-    def getitem(pos,self=self):return self.list[pos]
-    return self.__getitem__(map(getitem,List))
-  def __repr__(self):return 'seqdict(\n%s,\n%s)'%(self.list,self.dict)
diff -Nru igraph-0.6.5~quantal1/tools/stimulus.py igraph-0.6.5/tools/stimulus.py
--- igraph-0.6.5~quantal1/tools/stimulus.py	2013-02-28 10:02:41.000000000 +0000
+++ igraph-0.6.5/tools/stimulus.py	1970-01-01 00:00:00.000000000 +0000
@@ -1,1467 +0,0 @@
-#! /usr/bin/env python
-
-import re
-import seqdict
-import sys
-import getopt
-import os
-
-version="0.1"
-date="Jul 29 2007"
-
-def usage():
-    print "Stimulus version", version, date
-    print sys.argv[0], "-f <function-file> -t <type-file> -l language "
-    print ' ' * len(sys.argv[0]), "-i <input-file> -o <output-file>"
-    print ' ' * len(sys.argv[0]), "-h --help -v"
-
-################################################################################
-class StimulusError(Exception):
-    def __init__(self, message):
-        self.msg = message
-    def __str__(self):
-        return str(self.msg)
-
-################################################################################
-class PLexer:
-    def __init__(self, stream):
-        self.stream=stream
-        self.ws_stack=[0]
-        self.tokens=[]
-        self.lineno=0
-
-    def lineno(self):
-        return self.lineno
-
-    def token(self):
-        keys=[]
-
-        if (len(self.tokens)>0):
-            return self.tokens.pop(0)
-
-        # Read a line, skip empty lines and comments
-        while True:
-            line=self.stream.readline(); self.lineno = self.lineno+1
-            if line=="":
-                for k in keys:
-                    self.tokens.append( ("key", k) )
-                    keys=[]
-                while len(self.ws_stack)>0:
-                    self.tokens.append( ("dedent", "") )
-                    self.ws_stack.pop()
-                self.tokens.append( ("eof", "") )
-                return self.tokens.pop(0)
-            if re.match("^[ \t]*$", line): continue
-            if re.match("^[ \t]*#", line): continue
-            break
-
-        if line[-1]=="\n": line=line[:(len(line)-1)]
-        ws=re.match(r"^[ \t]*", line).span()[1]
-        line=line.strip()
-        if ws > self.ws_stack[-1]:
-            self.tokens.append( ("indent", "") )
-            self.ws_stack.append(ws)
-        else:
-            for k in keys:
-                self.tokens.append( ("key", k) )
-                keys=[]
-            while ws < self.ws_stack[-1]:
-                self.ws_stack.pop()
-                self.tokens.append( ("dedent", "") )
-            if ws != self.ws_stack[-1]:
-                print "Bad indentation in line", self.lineno
-                exit
-
-        # Ok, we're done with the white space, now let's see
-        # whether this line is continued
-        while line[-1]=="\\":
-            line=line[:(len(line)-1)]
-            line=line+"\n  " + self.stream.readline().strip() ; self.lineno=self.lineno+1
-
-        # We have the line now, check whether there is a ':' in it
-        line=line.split(":", 1)
-        if len(line)>1:
-            line[0]=line[0].strip()
-            line[1]=line[1].strip()
-            if line[0]=="":
-                print "Missing keyword in line", self.lineno
-                exit
-            keys=line[0].split(",")
-            keys=[ k.strip() for k in keys ]
-            if line[1] == "":
-                self.tokens.append( ("key", keys.pop(0)) )
-            else:
-                for k in keys:
-                    self.tokens.append( ("key", k))
-                    self.tokens.append( ("indent", "") )
-                    self.tokens.append( ("text", line[1]) )
-                    self.tokens.append( ("dedent", "") )
-        else:
-            self.tokens.append( ("text", line[0].strip()) )
-            for k in keys:
-                self.tokens.append( ("dedent", "") )
-                self.tokens.append( ("key", k) )
-                self.tokens.append( ("indent", "") )
-            keys=[]
-                
-        if self.tokens:
-            return self.tokens.pop(0)
-
-################################################################################
-class PParser:
-    def parse(self, stream):
-        lex=PLexer(stream)
-        val=seqdict.seqdict()
-        val_stack=[val, None]
-        nam_stack=[None, None]
-        
-        tok=lex.token()
-        while not tok[0]=="eof":
-            if tok[0]=="indent":
-                val_stack.append(None)
-                nam_stack.append(None)
-            elif tok[0]=="dedent":
-                v=val_stack.pop()
-                n=nam_stack.pop()
-                if n is None:                    
-                    val_stack[-1]=v
-                else:
-                    val_stack[-1][n]=v
-            elif tok[0]=="key":
-                if not nam_stack[-1] is None:
-                    val_stack[-2][nam_stack[-1]]=val_stack[-1]
-                if tok[1][-5:]=="-list":
-                    val_stack[-1]=seqdict.seqdict()
-                    nam_stack[-1]=tok[1][:-5]
-                else:
-                    val_stack[-1]={}
-                    nam_stack[-1]=tok[1]
-            elif tok[0]=="text":
-                val_stack[-1]=tok[1]
-            tok=lex.token()
-
-        return val
-
-################################################################################
-
-def main():
-    # Command line arguments
-    try:
-        optlist, args = getopt.getopt(sys.argv[1:], 't:f:l:i:o:hv', ['help'])
-    except getopt.GetoptError:
-        usage()
-        sys.exit(2)
-
-    types=[]; functions=[]; inputs=[]; languages=[]; outputs=[]; verbose=False
-
-    for o,a in optlist:
-        if o in ("-h", "--help"):
-            usage()
-            sys.exit()
-        elif o == "-o":
-            outputs.append(a)
-        elif o == "-t":
-            types.append(a)
-        elif o == "-f":
-            functions.append(a)        
-        elif o == "-l":
-            languages.append(a)
-        elif o == "-i":
-            inputs.append(a)
-        elif o =="-v":
-            verbose=True
-
-    # Parameter checks
-    # Note: the lists might be empty, but languages and outputs must
-    # have the same length.
-    if len(languages) != len(outputs):
-        print "Error: number of languages and output files must match"
-        sys.exit(4)
-    for l in languages:
-        if not l+"CodeGenerator" in globals():
-            print "Error: unknown language:", l
-            sys.exit(6)
-    for f in types:
-        if not os.access(f, os.R_OK):
-            print "Error: cannot open type file:", f
-            sys.exit(5)
-    for f in functions:
-        if not os.access(f, os.R_OK):
-            print "Error: cannot open function file:", f
-            sys.exit(5)
-    for f in inputs:
-        if not os.access(f, os.R_OK):
-            print "Error: cannot open input file:", f
-            sys.exit(5)
-    # TODO: output files are not checked now
-
-    # OK, do the trick:
-    for l in range(len(languages)):
-        cl=globals()[languages[l]+"CodeGenerator"]
-        cg=cl(functions, types)
-        cg.generate(inputs, outputs[l])
-
-################################################################################
-class CodeGenerator:
-    def __init__(self, func, types):
-        # Set name
-        self.name=str(self.__class__).split(".")[-1]
-        self.name=self.name[0:len(self.name)-len("CodeGenerator")]
-
-        # Parse function and type files
-        parser=PParser()
-        self.func=seqdict.seqdict()
-        for f in func:
-            ff=open(f)
-            newfunc=parser.parse(ff)
-            self.func.extend(newfunc)
-            ff.close()
-
-        self.types=seqdict.seqdict()
-        for t in types:
-            ff=open(t)
-            newtypes=parser.parse(ff)
-            self.types.extend(newtypes)
-            ff.close()
-
-        # The default return type is 'ERROR'
-        for f in self.func.keys():
-            if 'RETURN' not in self.func[f]:
-                self.func[f]['RETURN']='ERROR'
-
-    def generate(self, inputs, output):
-        out=open(output, "w")
-        self.append_inputs(inputs, out)
-        for f in self.func.keys():
-            if 'FLAGS' in self.func[f]:
-                flags=self.func[f]['FLAGS']
-                flags=flags.split(",")
-                flags=[ flag.strip() for flag in flags ]
-            else:
-                self.func[f]['FLAGS']=[]
-            self.generate_function(f, out)
-        out.close()
-
-    def generate_function(self, f, out):
-        print "Error: invalid code generator, this method should be overridden"
-        sys.exit(1)
-
-    def parse_params(self, function):
-        if "PARAMS" not in self.func[function]:
-            return seqdict.seqdict()
-        
-        params=self.func[function]["PARAMS"]
-        params=params.split(",")
-        params=[ p.strip() for p in params ]
-        params=[ p.split(" ", 1) for p in params ]
-        for p in range(len(params)):
-            if params[p][0] in ['OUT', 'IN', 'INOUT']:
-                params[p]=[params[p][0]] + params[p][1].split(" ", 1)
-            else:
-                params[p]=['IN', params[p][0]]+ params[p][1].split(" ", 1)
-            if '=' in params[p][2]:
-                params[p]=params[p][:2] + params[p][2].split("=", 1)
-        params=[ [ p.strip() for p in pp ] for pp in params ]
-        res=seqdict.seqdict()
-        for p in params:
-            if len(p)==3:
-                res[ p[2] ] = { 'mode': p[0], 'type': p[1] }
-            else:
-                res[ p[2] ] = { 'mode': p[0], 'type': p[1], 'default': p[3] }
-        return res
-
-    def parse_deps(self, function):
-        if 'DEPS' not in self.func[function]:
-            return seqdict.seqdict()
-
-        deps=self.func[function]["DEPS"]
-        deps=deps.split(",")
-        deps=[ d.strip() for d in deps ]
-        deps=[ d.split("ON", 1) for d in deps ]
-        deps=[ [ dd.strip() for dd in d ] for d in deps ]
-        deps=[ [d[0]] + d[1].split(" ",1) for d in deps ]
-        deps=[ [ dd.strip() for dd in d ] for d in deps ]
-        res=seqdict.seqdict()
-        for d in deps:
-            res[ d[0] ] = d[1:]
-        return res
-
-    def append_inputs(self, inputs, output):
-        for i in inputs:
-            ii=open(i)
-            str=ii.read()
-            while str != "":
-                output.write(str)
-                str=ii.read()
-            ii.close()
-        pass    
-
-    def ignore(self, function):
-        if 'IGNORE' in self.func[function]:
-            ign=self.func[function]['IGNORE']
-            ign=ign.split(",")
-            ign=[i.strip() for i in ign]
-            if self.name in ign: return True
-        return False
-
-################################################################################
-# GNU R, see http://www.r-project.org
-# TODO: free memory when CTRL+C pressed, even on windows
-################################################################################
-
-class RNamespaceCodeGenerator(CodeGenerator):
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def generate(self, inputs, output):
-        """This is very simple, we include an 'export' line for every
-        function which it not to be ignored by the RNamespace language.
-        Function names are taken from NAME-R if present, otherwise
-        underscores are converted to dots and the leading 'i' (from
-        'igraph') is stripped to create the function name,
-        ie. igraph_clusters is mapped to graph.clusters."""
-        out=open(output, "w")
-        self.append_inputs(inputs, out)
-        for f in self.func.keys():
-            if (self.ignore(f)):
-                continue
-            name=self.func[f].get("NAME-R", f[1:].replace("_", "."))
-            out.write("export(" + name + ")\n")
-        out.close()
-        
-
-class RRCodeGenerator(CodeGenerator):
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def generate_function(self, function, out):
-        
-        # Ignore?
-        if self.ignore(function):
-            return
-
-        name=self.func[function].get("NAME-R", function[1:].replace("_", "."))
-        params=self.parse_params(function)
-        self.deps=self.parse_deps(function)
-
-        # Check types
-        for p in params.keys():
-            tname=params[p]['type']
-            if not tname in self.types.keys():
-                print "Error: Unknown type encountered:", tname
-                sys.exit(7)
-            params[p].setdefault('mode', 'IN')
-
-        ## Header
-        ## do_par handles the translation of a single argument in the
-        ## header. Pretty simple, the only difficulty is that we
-        ## might need to add default values. Default values are taken
-        ## from a language specific dictionary, this is compiled from
-        ## the type file(s).
-        
-        ## So we take all arguments with mode 'IN' or 'INOUT' and
-        ## check whether they have a default value. If yes then we 
-        ## check if the default value is given in the type file. If
-        ## yes then we use the value given there, otherwise the
-        ## default value is ignored silently. (Not very nice.)
-        
-        out.write(name)
-        out.write(" <- function(")
-        def do_par(pname):
-            tname=params[pname]['type']
-            t=self.types[tname]
-            default=""
-            header=pname.replace("_", ".")
-            if 'HEADER' in t:
-                header=t['HEADER']
-            if header:
-                header=header.replace("%I%", pname.replace("_", "."))
-            else:
-                header=""
-            if 'default' in params[pname]:
-                if 'DEFAULT' in t and params[pname]['default'] in t['DEFAULT']:
-                    default="=" + t['DEFAULT'][ params[pname]['default'] ]
-                else:
-                    default="=" + params[pname]['default']
-            header = header + default
-
-            if pname in self.deps.keys():
-                deps = self.deps[pname]
-                for i in range(len(deps)):
-                    header=header.replace("%I"+str(i+1)+"%", deps[i])
-            
-            return header
-            
-        head=[ do_par(n) for n,p in params.items()
-               if p['mode'] in ['IN','INOUT'] ]
-        head=[ h for h in head if h != "" ]
-        out.write(", ".join(head))
-        out.write(") {\n")
-
-        ## Argument checks, INCONV
-        ## We take 'IN' and 'INOUT' mode arguments and if they have an
-        ## INCONV field then we use that. This is typically for
-        ## argument checks, like we check here that the argument
-        ## supplied for a graph is indeed an igraph graph object. We
-        ## also covert numeric vectors to 'double' here.
-
-        ## The INCONV fields are simply concatenated by newline
-        ## characters.
-        out.write("  # Argument checks\n")
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            m=params[pname]['mode']
-            if m in ['IN', 'INOUT'] and 'INCONV' in t:
-                if m in t['INCONV']:
-                    res= "  " + t['INCONV'][m]
-                else:
-                    res="  " + t['INCONV']
-            else:
-                res=""
-            res=res.replace("%I%", pname.replace("_", "."))
-
-            if pname in self.deps.keys():
-                deps = self.deps[pname]
-                for i in range(len(deps)):
-                    res=res.replace("%I"+str(i+1)+"%", deps[i])
-            return res
-
-        inconv=[ do_par(n) for n in params.keys() ]
-        inconv=[ i for i in inconv if i != "" ]
-        out.write("\n".join(inconv)+"\n\n")
-
-        ## Function call
-        ## This is a bit more difficult than INCONV. Here we supply
-        ## each argument to the .Call function, if the argument has a
-        ## 'CALL' field then it is used, otherwise we simply use its
-        ## name. 
-        ## argument. Note that arguments with empty CALL fields are
-        ## completely ignored, so giving an empty CALL field is
-        ## different than not giving it at all.
-
-        ## Function call
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            call=pname.replace("_", ".")
-            if 'CALL' in t:
-                call=t['CALL']
-                if call:
-                    call=call.replace('%I%', pname.replace("_", "."))
-                else:
-                    call=""
-            return call
-              
-        out.write("  on.exit( .Call(\"R_igraph_finalizer\", PACKAGE=\"igraph\") )\n")
-        out.write("  # Function call\n")
-        out.write("  res <- .Call(\"R_" + function + "\", ")
-        call=[ do_par(n) for n,p in params.items() if p['mode'] in ['IN', 'INOUT'] ]
-        call=[ c for c in call if c != "" ]
-        out.write(", ".join(call))
-        out.write(",\n        PACKAGE=\"igraph\")\n")
-
-        ## Output conversions
-        def do_opar(pname, realname=None, iprefix=""):
-            if realname is None: realname=pname
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'OUTCONV' in t and mode in t['OUTCONV']:
-                outconv="  " + t['OUTCONV'][mode]
-            else:
-                outconv=""
-            outconv=outconv.replace("%I%", iprefix+realname)
-
-            if pname in self.deps.keys():
-                deps = self.deps[pname]
-                for i in range(len(deps)):
-                    outconv=outconv.replace("%I"+str(i+1)+"%", deps[i])
-            return re.sub("%I[0-9]+%", "", outconv)
-
-        retpars=[ n for n,p in params.items() if p['mode'] in 
-                  ['OUT', 'INOUT'] ]
-
-        if len(retpars) <= 1:
-            outconv=[ do_opar(n, "res") for n in params.keys() ]
-        else:
-            outconv=[ do_opar(n, iprefix="res$") for n in params.keys() ]
-
-        outconv=[ o for o in outconv if o != "" ]
-
-        if len(retpars)==0:
-            # returning the return value of the function
-            rt=self.types[self.func[function]['RETURN']]
-            if 'OUTCONV' in rt:
-                retconv="  " + rt['OUTCONV']['OUT']
-            else:
-                retconv=""
-            retconv=retconv.replace("%I%", "res")
-            # TODO: %I1% etc, is not handled here!
-            ret="\n".join(outconv) + "\n" + retconv + "\n"
-        elif len(retpars)==1:
-            # returning a single output value
-            ret="\n".join(outconv) + "\n"
-        else:
-            # returning a list of output values
-            None
-            ret="\n".join(outconv) + "\n"
-        out.write(ret)
-
-        ## Some graph attributes to add
-        if 'GATTR-R' in self.func[function].keys():
-            gattrs=self.func[function]['GATTR-R'].split(',')
-            gattrs=[ ga.split(' IS ', 1) for ga in gattrs ]
-            sstr="  res <- set.graph.attribute(res, '%s', '%s')\n"
-            for ga in gattrs:
-                aname=ga[0].strip()
-                aval=ga[1].strip().replace("'", "\\'")
-                out.write(sstr % (aname, aval))
-
-        ## Add some parameters as graph attributes
-        if 'GATTR-PARAM-R' in self.func[function].keys():
-            pars=self.func[function]['GATTR-PARAM-R'].split(',')
-            pars=[ p.strip().replace("_", ".") for p in pars ]
-            sstr="  res <- set.graph.attribute(res, '%s', %s)\n"
-            for p in pars:
-                out.write(sstr % (p, p))
-
-        ## Set the class if requested
-        if 'CLASS-R' in self.func[function].keys():
-            myclass=self.func[function]['CLASS-R']
-            out.write("  class(res) <- \"" + myclass + "\"\n")
-        out.write("  res\n}\n\n")
-
-class RCCodeGenerator(CodeGenerator):
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def generate_function(self, function, out):
-
-        # Ignore?
-        if self.ignore(function):
-            return
-
-        params=self.parse_params(function)
-        self.deps = self.parse_deps(function)
-
-        # Check types
-        for p in params.keys():
-            tname=params[p]['type']
-            if not tname in self.types.keys():
-                print "Error: Unknown type encountered:", tname
-                sys.exit(7)
-            params[p].setdefault('mode', 'IN')
-
-        ## Compile the output
-        ## This code generator is quite difficult, so we use different
-        ## functions to generate the approprite chunks and then
-        ## compile them together using a simple template.
-        ## See the documentation of each chunk below.
-        res={}
-        res['func']=function
-        res['header']=self.chunk_header(function, params)
-        res['decl']=self.chunk_declaration(function, params)
-        res['inconv']=self.chunk_inconv(function, params)
-        res['call']=self.chunk_call(function, params)
-        res['outconv']=self.chunk_outconv(function, params)
-
-        # Replace into the template
-        text="""
-/*-------------------------------------------/
-/ %(func)-42s /
-/-------------------------------------------*/
-%(header)s {
-                                        /* Declarations */
-%(decl)s
-                                        /* Convert input */
-%(inconv)s
-                                        /* Call igraph */
-%(call)s
-                                        /* Convert output */
-%(outconv)s
-
-  UNPROTECT(1);
-  return(result);
-}\n""" % res
-
-        out.write(text)
-        
-    def chunk_header(self, function, params):
-        """The header. All functions return with a 'SEXP', so this is
-        easy. We just take the 'IN' and 'INOUT' arguments, all will
-        have type SEXP, and concatenate them by commas. The function name
-        is created by prefixing the original name with 'R_'."""
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            if 'HEADER' in t:
-                if t['HEADER']:
-                    return t['HEADER'].replace("%I%", pname)
-                else:
-                    return ""
-            else:
-                return pname
-            
-        inout=[ do_par(n) for n,p in params.items()
-                if p['mode'] in ['IN','INOUT'] ]
-        inout=[ "SEXP " + n for n in inout if n != "" ]
-        return "SEXP R_" + function + "(" + ", ".join(inout) + ")"
-        
-    def chunk_declaration(self, function, params):
-        """There are a couple of things to declare. First a C type is
-        needed for every argument, these will be supplied in the C
-        igraph call. Then, all 'OUT' arguments need a SEXP variable as
-        well, the result will be stored here. The return type
-        of the C function also needs to be declared, that comes
-        next. The result and names SEXP variables will contain the
-        final result, these are last. ('names' is not always used, but
-        it is easier to always declare it.)
-        """
-        def do_par(pname):
-            cname="c_"+pname
-            t=self.types[params[pname]['type']]
-            if 'DECL' in t:
-                decl="  " + t['DECL']
-            elif 'CTYPE' in t:
-                ctype = t['CTYPE']
-                if type(ctype)==dict:
-                    mode=params[pname]['mode']
-                    decl="  " + ctype[mode] + " " + cname + ";"
-                else:
-                    decl="  " + ctype + " " + cname + ";"
-            else:
-                decl=""            
-            return decl.replace("%C%", cname).replace("%I%", pname)
-
-        inout=[ do_par(n) for n in params.keys() ]
-        out=[ "  SEXP "+n+";" for n,p in params.items()
-              if p['mode']=='OUT' ]
-
-        retpars=[ n for n,p in params.items() if p['mode'] in 
-                  ['OUT', 'INOUT'] ]
-
-        rt=self.types[self.func[function]['RETURN']]    
-        if 'DECL' in rt:
-            retdecl="  " + rt['DECL']
-        elif 'CTYPE' in rt and len(retpars)==0:
-            ctype=rt['CTYPE']
-            if type(ctype)==dict:
-                mode=params[pname]['mode']
-                retdecl="  " + ctype[mode] + " " + "c_result;"
-            else:
-                retdecl="  " + rt['CTYPE'] + " c_result;"
-        else:
-            retdecl=""
-
-        if len(retpars)<=1:
-            res = "\n".join(inout + out + [retdecl] + ["  SEXP result;"])
-        else:
-            res = "\n".join(inout + out + [retdecl] + 
-                            ["  SEXP result, names;"])
-        return res
-
-    def chunk_inconv(self, function, params):
-        """Input conversions. Not only for types with mode 'IN' and
-        'INOUT', eg. for 'OUT' vector types we need to allocate the
-        required memory here, do all the initializations, etc. Types
-        without INCONV fields are ignored. The usual %C%, %I% is
-        performed at the end.
-        """
-        def do_par(pname):
-            cname="c_"+pname
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'INCONV' in t and mode in t['INCONV']:
-                inconv="  " + t['INCONV'][mode]
-            else:
-                inconv=""
-
-            if pname in self.deps.keys():
-                deps = self.deps[pname]
-                for i in range(len(deps)):
-                    inconv=inconv.replace("%C"+str(i+1)+"%", "c_"+deps[i])
-                
-            return inconv.replace("%C%", cname).replace("%I%", pname)
-
-        inconv=[ do_par(n) for n in params.keys() ]
-        inconv=[ i for i in inconv if i != "" ]
-
-        return "\n".join(inconv)
-
-    def chunk_call(self, function, params):
-        """Every single argument is included, independently of their
-        mode. If a type has a 'CALL' field then that is used after the
-        usual %C% and %I% substitutions, otherwise the standard 'c_'
-        prefixed C argument name is used.
-        """
-        def docall(t, n):
-            if type(t)==dict:
-                mode=params[n]['mode']
-                return t[mode]
-            else:
-                return t
-        
-        types=[ self.types[params[n]['type']] for n in params.keys() ]
-        call=map( lambda t, n: docall(t.get('CALL', "c_"+n), n), types, 
-                  params.keys() )
-        call=map( lambda c, n: c.replace("%C%", "c_"+n).replace("%I%", n),
-                  call, params.keys() )
-        retpars=[ n for n,p in params.items() if p['mode'] in 
-                  ['OUT', 'INOUT'] ]
-        res="  " + function + "(" + ", ".join(call) + ");\n"
-        if len(retpars)==0:
-            res="  c_result=" + res
-        return res
-
-    def chunk_outconv(self, function, params):
-        """The output conversions, this is quite difficult. A function
-        may report its results in two ways: by returning it directly
-        or by setting a variable to which a pointer was passed. igraph
-        usually uses the latter and returns error codes, except for
-        some simple functions like 'igraph_vcount()' which cannot
-        fail.
-
-        First we add the output conversion for all types. This is
-        easy. Note that even 'IN' arguments may have output
-        conversion, eg. this is the place to free memory allocated to
-        them in the 'INCONV' part.
-
-        Then we check how many 'OUT' or 'INOUT' arguments we
-        have. There are three cases. If there is a single such
-        argument then that is already converted and we need to return
-        that. If there is no such argument then the output of the
-        function was returned, so we perform the output conversion for
-        the returned type and this will be the result. If there are
-        more than one 'OUT' and 'INOUT' arguments then they are
-        collected in a named list. The names come from the argument
-        names.
-        """
-        def do_par(pname):
-            cname="c_"+pname
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'OUTCONV' in t and mode in t['OUTCONV']:
-                outconv="  " + t['OUTCONV'][mode]
-            else:
-                outconv=""
-            return outconv.replace("%C%", cname).replace("%I%", pname)
-
-        outconv=[ do_par(n) for n in params.keys() ]
-        outconv=[ o for o in outconv if o != "" ]
-
-        retpars=[ n for n,p in params.items() if p['mode'] in ['OUT', 'INOUT'] ]
-        if len(retpars)==0:
-            # return the return value of the function
-            rt=self.types[self.func[function]['RETURN']]
-            if 'OUTCONV' in rt:
-                retconv="  " + rt['OUTCONV']['OUT']
-            else:
-                retconv=""
-            retconv=retconv.replace("%C%", "c_result").replace("%I%", "result")
-            ret="\n".join(outconv) + "\n" + retconv
-        elif len(retpars)==1:
-            # return the single output value
-            retconv="  result=" + retpars[0] + ";"
-            ret="\n".join(outconv) + "\n" + retconv
-        else:
-            # create a list of output values
-            sets=map ( lambda c, n: "  SET_VECTOR_ELT(result, "+str(c)+", "+n+");",
-                       range(len(retpars)), retpars )
-            names=map ( lambda c, n: "  SET_STRING_ELT(names, "+str(c)+
-                        ", CREATE_STRING_VECTOR(\""+n+"\"));",
-                        range(len(retpars)), retpars )
-            ret="\n".join(["  PROTECT(result=NEW_LIST(" + str(len(retpars)) + "));",
-                           "  PROTECT(names=NEW_CHARACTER(" + str(len(retpars)) + "));"]+
-                          outconv + sets + names +
-                          ["  SET_NAMES(result, names);" ] + 
-                          ["  UNPROTECT("+str(len(sets)+1)+");" ])
-            
-        return ret
-
-################################################################################
-# Java interface, experimental version using JNI (Java Native Interface)
-# TODO: - everything :) This is just a PoC implementation.
-################################################################################
-
-class JavaCodeGenerator(CodeGenerator):
-    """Class containing the common parts of JavaJavaCodeGenerator and
-    JavaCCodeGenerator"""
-    package = "net.sf.igraph"
-
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def camelcase(s):
-        """Returns a camelCase version of the given string (as used in Java
-        libraries"""
-        parts = s.split("_")
-        result = [parts.pop(0)]
-        for part in parts: result.append(part.capitalize())
-        return "".join(result)
-    camelcase=staticmethod(camelcase)
-
-    def get_function_metadata(self, f, type_param="JAVATYPE"):
-        """Returns metadata for the given function based on the parameters.
-        f is the name of the function. The result is a dict with the following
-        keys:
-
-        - java_modifiers: Java modifiers to be used in the .java file
-        - return_type: return type of the function
-        - name: name of the function
-        - argument_types: list of argument types
-        - self_name: name of the "self" argument
-        - is_static: whether the function is static
-        - is_constructor: whether the function is a constructor
-        """
-        params = self.parse_params(f)
-        is_static, is_constructor = False, False
-
-        # We will collect data related to the current function in a dict
-        data = {}
-        data["name"]=self.func[f].get("NAME-JAVA", \
-          JavaCodeGenerator.camelcase(f[7:]))
-        data["java_modifiers"]=["public"]
-
-        # Check parameter types to determine Java calling semantics
-        types = {"IN": [], "OUT": [], "INOUT": []}
-        for p in params.keys():
-            types[params[p]["mode"]].append(params[p])
-
-        if len(types["OUT"])+len(types["INOUT"]) == 1:
-            # If a single one is OUT or INOUT and all others are
-            # INs, then this is our lucky day - the method fits the Java
-            # semantics
-            if len(types["OUT"]) > 0:
-                return_type_name = types["OUT"][0]["type"]
-            else:
-                return_type_name = types["INOUT"][0]["type"]
-        elif len(types["OUT"])+len(types["INOUT"]) == 0 and \
-            self.func[f].has_key("RETURN"):
-            # There are only input parameters and the return type is specified,
-            # this also fits the Java semantics
-            return_type_name = self.func[f]["RETURN"]
-        else:
-            raise StimulusError, "%s: calling convention unsupported yet" % \
-              data["name"]
-
-        # Loop through the input parameters
-        method_arguments = []
-        found_self = False
-        for p in params.keys():
-            if params[p]["mode"] != "IN": continue
-            type_name = params[p]["type"]
-            if not found_self and type_name == "GRAPH":
-                # this will be the 'self' argument
-                found_self = True
-                data["self_name"] = p
-                continue
-            tdesc = self.types.get(type_name, {})
-            if not tdesc.has_key(type_param):
-                raise StimulusError, "%s: unknown input type %s (needs %s), skipping" % \
-                  (data["name"], type_name, type_param)
-            method_arguments.append(" ".join([tdesc[type_param], p]))
-        data["argument_types"] = method_arguments
-
-        if not found_self:
-            # Loop through INOUT arguments if we found no "self" yet
-            for p in params.keys():
-                if params[p]["mode"] == "INOUT" and params[p]["type"] == "GRAPH":
-                    found_self = True
-                    data["self_name"] = p
-                    break
-
-        tdesc = self.types.get(return_type_name, {})
-        if not tdesc.has_key(type_param):
-            raise StimulusError, "%s: unknown return type %s, skipping" % \
-                (data["name"], return_type_name)
-        data["return_type"] = tdesc[type_param]
-
-        if not found_self:
-            data["java_modifiers"].append("static")
-            data["name"] = data["name"][0].upper()+data["name"][1:]
-
-        data["java_modifiers"] = " ".join(data["java_modifiers"])
-        data["is_static"] = not found_self
-        data["is_constructor"] = is_constructor
-
-        return data
-
-
-class JavaJavaCodeGenerator(JavaCodeGenerator):
-    def __init__(self, func, types):
-        JavaCodeGenerator.__init__(self, func, types)
-
-    def generate(self, inputs, output):
-        out=open(output, "w")
-
-        if len(inputs)>1:
-            raise StimulusError, "Java code generator supports only a single input"
-
-        input = open(inputs[0])
-        for line in input:
-            if "%STIMULUS%" not in line:
-                out.write(line)
-                continue
-
-            for f in self.func.keys():
-                if (self.ignore(f)): continue
-                try:
-                    func_metadata = self.get_function_metadata(f)
-                    func_metadata["arguments"] = ", ".join(func_metadata["argument_types"])
-                    out.write("    %(java_modifiers)s native %(return_type)s %(name)s(%(arguments)s);\n" % func_metadata)
-                except StimulusError, e:
-                    out.write("    // %s\n" % str(e))
-
-        out.close()
-      
-
-class JavaCCodeGenerator(JavaCodeGenerator):
-    def __init__(self, func, types):
-        JavaCodeGenerator.__init__(self, func, types)
-
-    def generate_function(self, function, out):
-        # Ignore?
-        if self.ignore(function): return
-
-        try:
-            self.metadata=self.get_function_metadata(function, "CTYPE")
-        except StimulusError, e:
-            out.write("/* %s */\n" % str(e))
-            return
-
-        params=self.parse_params(function)
-        self.deps = self.parse_deps(function)
-
-        # Check types
-        for p in params.keys():
-            tname=params[p]['type']
-            if not tname in self.types.keys():
-                print "W: Unknown type encountered:", tname
-                return
-            params[p].setdefault('mode', 'IN')
-
-        ## Compile the output
-        ## This code generator is quite difficult, so we use different
-        ## functions to generate the approprite chunks and then
-        ## compile them together using a simple template.
-        ## See the documentation of each chunk below.
-        try:
-            res={}
-            res['func']=function
-            res['header']=self.chunk_header(function, params)
-            res['decl']=self.chunk_declaration(function, params)
-            res['before']=self.chunk_before(function, params)
-            res['inconv']=self.chunk_inconv(function, params)
-            res['call']=self.chunk_call(function, params)
-            res['outconv']=self.chunk_outconv(function, params)
-            res['after']=self.chunk_after(function, params)
-        except StimulusError, e:
-            out.write("/* %s */\n" % str(e))
-            return
-
-        # Replace into the template
-        text="""
-/*-------------------------------------------/
-/ %(func)-42s /
-/-------------------------------------------*/
-%(header)s {
-                                        /* Declarations */
-%(decl)s
-
-%(before)s
-                                        /* Convert input */
-%(inconv)s
-                                        /* Call igraph */
-%(call)s
-                                        /* Convert output */
-%(outconv)s
-
-%(after)s
-
-  return result;
-}\n""" % res
-
-        out.write(text)
-        
-    def chunk_header(self, function, params):
-        """The header.
-        
-        The name of the function is the igraph function name minus the
-        igraph_ prefix, camelcased and prefixed with the underscored
-        Java classname: net_sf_igraph_Graph_. The arguments
-        are mapped from the JAVATYPE key of the type dict. Static
-        methods also need a 'jclass cls' argument, ordinary methods
-        need 'jobject jobj'. Besides that, the Java environment pointer
-        is also passed.
-        """
-        data = self.get_function_metadata(function, "JAVATYPE")
-        types = []
-
-        data["funcname"] = "Java_%s_Graph_%s" % \
-          (self.package.replace(".", "_"), data["name"])
-
-        if data["is_static"]:
-            data["argument_types"].insert(0, "jclass cls")
-        else:
-            data["argument_types"].insert(0, "jobject "+data["self_name"])
-        data["argument_types"].insert(0, "JNIEnv *env")
-
-        data["types"] = ", ".join(data["argument_types"])
-
-        res="JNIEXPORT %(return_type)s JNICALL %(funcname)s(%(types)s)" % data
-        return res
-
-    def chunk_declaration(self, function, params):
-        """The declaration part of the function body
-        
-        There are a couple of things to declare. First a C type is
-        needed for every argument, these will be supplied in the C
-        igraph call. Then, all 'OUT' arguments need an appropriate variable as
-        well, the result will be stored here. The return type
-        of the C function also needs to be declared, that comes
-        next. The result variable will contain the final result. Finally,
-        if the method is not static but we are returning a new Graph object
-        (e.g. in the case of igraph_linegraph), we need a jclass variable
-        to store the Java class object."""
-        def do_cpar(pname):
-            cname="c_"+pname
-            t=self.types[params[pname]['type']]
-            if 'CDECL' in t:
-                decl="  " + t['CDECL']
-            elif 'CTYPE' in t:
-                decl="  " + t['CTYPE'] + " " + cname + ";"
-            else:
-                decl=""            
-            return decl.replace("%C%", cname).replace("%I%", pname)
-        def do_jpar(pname):
-            jname="j_"+pname
-            t=self.types[params[pname]['type']]
-            if 'JAVADECL' in t:
-                decl="  " + t['JAVADECL']
-            elif 'JAVATYPE' in t:
-                decl="  " + t['JAVATYPE'] + " " + jname + ";"
-            else:
-                decl=""            
-            return decl.replace("%J%", jname).replace("%I%", pname)
-
-        inout=[ do_cpar(n) for n in params.keys() ]
-        out=[ do_jpar(n) for n,p in params.items() if p['mode']=='OUT']
-
-        rt=self.types[self.func[function]['RETURN']]    
-        if 'CDECL' in rt:
-            retdecl="  " + rt['CDECL']
-        elif 'CTYPE' in rt:
-            retdecl="  " + rt['CTYPE'] + " c__result;"
-        else:
-            retdecl=""
-
-        rnames = [n for n,p in params.items() if p['mode'] in ['OUT','INOUT']]
-        jretdecl = ""
-        if len(rnames)>0:
-            n = rnames[0]
-            rtname = params[n]['type']
-        else:
-            rtname = self.func[function]["RETURN"]
-        rt = self.types[rtname]
-        if 'JAVADECL' in rt:
-            jretdecl="  " + rt['JAVADECL']
-        elif 'JAVATYPE' in rt:
-            jretdecl="  " + rt['JAVATYPE'] + " result;"
-
-        decls = inout + out + [retdecl, jretdecl]
-        if not self.metadata["is_static"] and rtname == "GRAPH":
-            self.metadata["need_class_decl"] = True
-            decls.append("  jclass cls = (*env)->GetObjectClass(env, %s);" % self.metadata["self_name"])
-        else:
-            self.metadata["need_class_decl"] = False
-        return "\n".join([i for i in decls if i!=""])
-
-    def chunk_before(self, function, params):
-        """We simply call Java_igraph_before"""
-        return '  Java_igraph_before();'        
-
-    def chunk_inconv(self, function, params):
-        """Input conversions. Not only for types with mode 'IN' and
-        'INOUT', eg. for 'OUT' vector types we need to allocate the
-        required memory here, do all the initializations, etc. Types
-        without INCONV fields are ignored. The usual %C%, %I% is
-        performed at the end.
-        """
-        def do_par(pname):
-            cname="c_"+pname
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'INCONV' in t and mode in t['INCONV']:
-                inconv="  " + t['INCONV'][mode]
-            else:
-                inconv=""
-
-            if pname in self.deps.keys():
-                deps = self.deps[pname]
-                for i in range(len(deps)):
-                    inconv=inconv.replace("%C"+str(i+1)+"%", "c_"+deps[i])
-                
-            return inconv.replace("%C%", cname).replace("%I%", pname)
-
-        inconv=[ do_par(n) for n in params.keys() ]
-        inconv=[ i for i in inconv if i != "" ]
-
-        return "\n".join(inconv)
-
-    def chunk_call(self, function, params):
-        """Every single argument is included, independently of their
-        mode. If a type has a 'CALL' field then that is used after the
-        usual %C% and %I% substitutions, otherwise the standard 'c_'
-        prefixed C argument name is used.
-        """
-        types=[ self.types[params[n]['type']] for n in params.keys() ]
-        call=map( lambda t, n: t.get('CALL', "c_"+n), types, params.keys() )
-        call=map( lambda c, n: c.replace("%C%", "c_"+n).replace("%I%", n),
-                  call, params.keys() )
-        lines = ["  if ((*env)->ExceptionCheck(env)) {", \
-                 "    c__result = IGRAPH_EINVAL;", \
-                 "  } else {", \
-                 "    c__result = " + function + "(" + ", ".join(call) + ");", \
-                 "  }"]
-        return "\n".join(lines)
-
-    def chunk_outconv(self, function, params):
-        """The output conversions, this is quite difficult. A function
-        may report its results in two ways: by returning it directly
-        or by setting a variable to which a pointer was passed. igraph
-        usually uses the latter and returns error codes, except for
-        some simple functions like 'igraph_vcount()' which cannot
-        fail.
-
-        First we add the output conversion for all types. This is
-        easy. Note that even 'IN' arguments may have output
-        conversion, eg. this is the place to free memory allocated to
-        them in the 'INCONV' part.
-
-        Then we check how many 'OUT' or 'INOUT' arguments we
-        have. There are three cases. If there is a single such
-        argument then that is already converted and we need to return
-        that. If there is no such argument then the output of the
-        function was returned, so we perform the output conversion for
-        the returned type and this will be the result. The case of
-        more than one 'OUT' and 'INOUT' arguments is not yet supported by
-        the Java interface.
-        """
-        def do_par(pname):
-            cname="c_"+pname
-            jname="j_"+pname
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'OUTCONV' in t and mode in t['OUTCONV']:
-                outconv="  " + t['OUTCONV'][mode]
-            else:
-                outconv=""
-            return outconv.replace("%C%", cname).replace("%I%", jname)
-
-        outconv=[ do_par(n) for n in params.keys() ]
-        outconv=[ o for o in outconv if o != "" ]
-
-        retpars=[ (n,p) for n,p in params.items() if p['mode'] in ['OUT', 'INOUT'] ]
-        if len(retpars)==0:
-            # return the return value of the function
-            rt=self.types[self.func[function]['RETURN']]
-            if 'OUTCONV' in rt:
-                retconv="  " + rt['OUTCONV']['OUT']
-            else:
-                retconv=""
-            retconv=retconv.replace("%C%", "c__result").replace("%I%", "result")
-            if len(retconv)>0: outconv.append(retconv)
-            ret="\n".join(outconv)
-        elif len(retpars)==1:
-            # return the single output value
-            if retpars[0][1]['mode'] == "OUT":
-                # OUT parameter
-                retconv="  result = j_" + retpars[0][0] + ";"
-            else:
-                # INOUT parameter
-                retconv="  result = " + retpars[0][0] + ";"
-            outconv.append(retconv)
-
-            outconv.insert(0, "if (c__result == 0) {")
-            outconv.extend(["} else {", "  result = 0;", "}"])
-            outconv = ["  %s" % line for line in outconv]
-            ret="\n".join(outconv)
-        else:
-            raise StimulusError, "%s: the case of multiple outputs not supported yet" % function
-        
-        return ret
-
-    def chunk_after(self, function, params):
-        """We simply call Java_igraph_after"""
-        return '  Java_igraph_after();'        
-
-
-
-################################################################################
-# Shell interface, igraph functions directly from the command line
-# TODO: - read/write default input/output from/to stdin/stdout
-#       - short options
-#       - prefixed output (?)
-#       - default values depending on other parameters
-#       - other input/output graph formats, to be controlled by
-#         environment variables (?): IGRAPH_INGRAPH, IGRAPH_OUTGRAPH
-################################################################################
-
-class ShellLnCodeGenerator(CodeGenerator):
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def generate(self, inputs, output):
-        out=open(output, "w")
-        self.append_inputs(inputs, out)
-        for f in self.func.keys():
-            if (self.ignore(f)):
-                continue
-            out.write(f+"\n")
-        out.close()
-
-class ShellCodeGenerator(CodeGenerator):
-    def __init__(self, func, types):
-        CodeGenerator.__init__(self, func, types)
-
-    def generate(self, inputs, output):
-        out=open(output, "w")
-        self.append_inputs(inputs, out)
-        out.write("\n/* Function prototypes first */\n\n")
-        
-        for f in self.func.keys():
-            if self.ignore(f): continue
-            if 'FLAGS' in self.func[f]:
-                flags=self.func[f]['FLAGS']
-                flags=flags.split(",")
-                flags=[ flag.strip() for flag in flags ]
-            else:
-                self.func[f]['FLAGS']=[]
-            self.generate_prototype(f, out)
-
-        out.write("\n/* The main function */\n\n")
-        out.write("int main(int argc, char **argv) {\n\n")
-        out.write("  const char *base=basename(argv[0]);\n\n  ")
-        for f in self.func.keys():
-            if self.ignore(f): continue
-            out.write("if (!strcasecmp(base, \""+f+
-                      "\")) {\n    return shell_"+f+"(argc, argv);\n  } else ")
-        out.write("{\n    printf(\"Unknown function, exiting\\n\");\n")
-        out.write("  }\n\n  shell_igraph_usage(argc, argv);\n  return 0;\n\n}\n");
-
-        out.write("\n/* The functions themselves at last */\n")
-        for f in self.func.keys():
-            if self.ignore(f): continue
-            self.generate_function(f, out)
-        
-        out.close()
-
-    def generate_prototype(self, function, out):
-        out.write("int shell_"+function+"(int argc, char **argv);\n")
-
-    def generate_function(self, function, out):
-        params=self.parse_params(function)
-
-        # Check types, also enumerate them
-        args=seqdict.seqdict()
-        for p in params.keys():
-            tname=params[p]['type']
-            if not tname in self.types.keys():
-                print "Error: Unknown type encountered:", tname
-                sys.exit(7)
-            params[p].setdefault('mode', 'IN')
-            t=self.types[tname]
-            mode=params[p]['mode']
-            if 'INCONV' in t or 'OUTCONV' in t:
-                args[p]=params[p].copy()
-                args[p]['shell_no']=len(args)-1
-                if mode=="INOUT":
-                    args[p]['mode']='IN'
-                    args[p+'-out']=params[p].copy()
-                    args[p+'-out']['mode']='OUT'
-                    args[p+'-out']['shell_no']=len(args)-1
-                    if 'INCONV' not in t or 'IN' not in t['INCONV']:
-                        print "Warning: no INCONV for type", tname, ", mode IN"
-                    if 'OUTCONV' not in t or 'OUT' not in t['OUTCONV']:
-                        print "Warning: no OUTCONV for type", tname, ", mode OUT"
-            if mode =='IN' and ('INCONV' not in t or mode not in t['INCONV']):
-                print "Warning: no INCONV for type", tname, ", mode", mode
-            if mode == 'OUT' and ('OUTCONV' not in t or mode not in t['OUTCONV']):
-                print "Warning: no OUTCONV for type", tname, ", mode", mode
-
-        res={'nargs': len(args)}
-        res['func']=function
-        res['args']=self.chunk_args(function, args)
-        res['decl']=self.chunk_decl(function, params)
-        res['inconv']=self.chunk_inconv(function, args)
-        res['call']=self.chunk_call(function, params)
-        res['outconv']=self.chunk_outconv(function, args)
-        res['default']=self.chunk_default(function, args)
-        res['usage']=self.chunk_usage(function, args)
-        text="""
-/*-------------------------------------------/
-/ %(func)-42s /
-/-------------------------------------------*/
-void shell_%(func)s_usage(char **argv) {
-%(usage)s
-  exit(1);
-}
-
-int shell_%(func)s(int argc, char **argv) {
-
-%(decl)s
-
-  int shell_seen[%(nargs)s];
-  int shell_index=-1;
-  struct option shell_options[]= { %(args)s
-                                   { "help",no_argument,0,%(nargs)s },
-                                   { 0,0,0,0 }
-                                 };
-
-  /* 0 - not seen, 1 - seen as argument, 2 - seen as default */
-  memset(shell_seen, 0, %(nargs)s*sizeof(int));
-%(default)s
-  
-  /* Parse arguments and read input */
-  while (getopt_long(argc, argv, "", shell_options, &shell_index) != -1) {
-
-    if (shell_index==-1) {
-      exit(1);
-    }
-
-    if (shell_seen[shell_index]==1) {
-      fprintf(stderr, "Error, `--%%s' argument given twice.\\n",
-              shell_options[shell_index].name);
-      exit(1);
-    }
-    shell_seen[shell_index]=1;  
-%(inconv)s
-    shell_index=-1;
-  }
-
-  /* Check that we have all arguments */
-  for (shell_index=0; shell_index<%(nargs)s; shell_index++) {
-    if (!shell_seen[shell_index]) {
-      fprintf(stderr, "Error, argument missing: `--%%s'.\\n",
-              shell_options[shell_index].name);
-      exit(1);
-    }
-  }
-
-  /* Do the operation */
-%(call)s
-
-  /* Write the result */
-%(outconv)s
-
-  return 0;
-}\n""" % res
-        out.write(text)
-
-    def chunk_args(self, function, params):
-        res=[ ['"'+n+'"',"required_argument","0", str(p['shell_no']) ]
-              for n,p in params.items() ]
-        res=[ "{ "+",".join(e)+" }," for e in res ]
-        return "\n                                   ".join(res)
-
-    def chunk_decl(self, function, params):
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            if 'DECL' in t:
-                decl="  " + t['DECL'].replace("%C%", pname)
-            elif 'CTYPE' in t:
-                decl="  " + t['CTYPE'] + " " + pname
-            else:
-                decl=""
-            if 'default' in params[pname]:
-                if 'DEFAULT' in t and params[pname]['default'] in t['DEFAULT']:
-                    default="="+t['DEFAULT'][params[pname]['default']]
-                else:
-                    default="="+params[pname]['default']
-            else:
-                default=""
-            if decl: return decl+default+";"
-            else: return ""
-
-        decl=[ do_par(n) for n in params.keys() ]
-        inout=[ "  char* shell_arg_"+n+"=0;" for n,p in params.items()
-                if p['mode'] in ['INOUT','OUT'] ]
-        rt=self.types[self.func[function]['RETURN']]
-        if 'DECL' in rt:
-            retdecl="  " + rt['DECL']
-        elif 'CTYPE' in rt:
-            retdecl="  " + rt['CTYPE'] + " shell_result;"
-        else:
-            retdecl=""
-
-        if self.func[function]['RETURN'] != 'ERROR':
-            retchar="  char *shell_arg_shell_result=\"-\";"
-        else:
-            retchar=""
-        return "\n".join(decl+inout+[retdecl, retchar])
-
-    def chunk_default(self, function, params):
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            if 'default' in params[pname]:
-                res="  shell_seen["+str(params[pname]['shell_no'])+"]=2;"
-            else:
-                res=""
-            return res
-
-        res= [ do_par(n) for n in params.keys() ]
-        res= [ n for n in res if n != "" ]
-        return "\n".join(res)
-
-    def chunk_inconv(self, function, params):
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'INCONV' in t and mode in t['INCONV']:
-                inconv="" + t['INCONV'][mode]
-            else:
-                inconv=""
-            if pname.endswith('-out'): pname=pname[0:-4]
-            return inconv.replace("%C%", pname)
-
-        inconv=[ "    case "+str(p['shell_no'])+": /* "+n+" */\n      "+ do_par(n)
-                 for n,p in params.items() ]
-        inconv=[ n+"\n      break;" for n in inconv ]
-        inconv=[ "".join(n) for n in inconv ]
-        text="\n    switch (shell_index) {\n"+"\n".join(inconv)+ \
-             "\n    case "+str(len(inconv))+":\n      shell_"+function+"_usage(argv);\n      break;"+ \
-             "\n    default:\n      break;\n    }\n"
-        return text
-
-    def chunk_call(self, function, params):
-        types=[ self.types[params[n]['type']] for n in params.keys() ]
-        call=map( lambda t,n: t.get('CALL', n), types, params.keys() )
-        call=map( lambda c,n: c.replace("%C%", n), call, params.keys() )        
-        return "  shell_result=" + function + "(" + ", ".join(call) + ");"
-
-    def chunk_outconv(self, function, params):
-        def do_par(pname):
-            t=self.types[params[pname]['type']]
-            mode=params[pname]['mode']
-            if 'OUTCONV' in t and mode in t['OUTCONV']:
-                outconv="  " + t['OUTCONV'][mode]
-            else:
-                outconv=""
-            if pname.endswith('-out'): pname=pname[0:-4]
-            return outconv.replace("%C%", pname)
-
-        outconv=[ do_par(n) for n in params.keys() ]
-        rt=self.types[self.func[function]['RETURN']]
-        if 'OUTCONV' in rt and 'OUT' in rt['OUTCONV']:
-            rtout="  " + rt['OUTCONV']['OUT']
-        else:
-            rtout=""
-        outconv.append(rtout.replace("%C%", "shell_result"))
-        outconv=[ o for o in outconv if o != "" ]
-        return "\n".join(outconv)
-
-    def chunk_usage(self, function, params):
-        res=[ "--"+n+"=<"+n+">" for n in params.keys() ]
-        return "  printf(\"%s "+" ".join(res)+"\\n\", basename(argv[0]));"
-    
-################################################################################
-if __name__ == "__main__":
-    main()
-
diff -Nru igraph-0.6.5~quantal1/ylwrap igraph-0.6.5/ylwrap
--- igraph-0.6.5~quantal1/ylwrap	1970-01-01 00:00:00.000000000 +0000
+++ igraph-0.6.5/ylwrap	2013-03-03 01:29:39.000000000 +0000
@@ -0,0 +1,226 @@
+#! /bin/sh
+# ylwrap - wrapper for lex/yacc invocations.
+
+scriptversion=2011-08-25.18; # UTC
+
+# Copyright (C) 1996, 1997, 1998, 1999, 2001, 2002, 2003, 2004, 2005,
+# 2007, 2009, 2010, 2011 Free Software Foundation, Inc.
+#
+# Written by Tom Tromey <tromey@cygnus.com>.
+#
+# 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 2, 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/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# This file is maintained in Automake, please report
+# bugs to <bug-automake@gnu.org> or send patches to
+# <automake-patches@gnu.org>.
+
+case "$1" in
+  '')
+    echo "$0: No files given.  Try \`$0 --help' for more information." 1>&2
+    exit 1
+    ;;
+  --basedir)
+    basedir=$2
+    shift 2
+    ;;
+  -h|--h*)
+    cat <<\EOF
+Usage: ylwrap [--help|--version] INPUT [OUTPUT DESIRED]... -- PROGRAM [ARGS]...
+
+Wrapper for lex/yacc invocations, renaming files as desired.
+
+  INPUT is the input file
+  OUTPUT is one file PROG generates
+  DESIRED is the file we actually want instead of OUTPUT
+  PROGRAM is program to run
+  ARGS are passed to PROG
+
+Any number of OUTPUT,DESIRED pairs may be used.
+
+Report bugs to <bug-automake@gnu.org>.
+EOF
+    exit $?
+    ;;
+  -v|--v*)
+    echo "ylwrap $scriptversion"
+    exit $?
+    ;;
+esac
+
+
+# The input.
+input="$1"
+shift
+case "$input" in
+  [\\/]* | ?:[\\/]*)
+    # Absolute path; do nothing.
+    ;;
+  *)
+    # Relative path.  Make it absolute.
+    input="`pwd`/$input"
+    ;;
+esac
+
+pairlist=
+while test "$#" -ne 0; do
+  if test "$1" = "--"; then
+    shift
+    break
+  fi
+  pairlist="$pairlist $1"
+  shift
+done
+
+# The program to run.
+prog="$1"
+shift
+# Make any relative path in $prog absolute.
+case "$prog" in
+  [\\/]* | ?:[\\/]*) ;;
+  *[\\/]*) prog="`pwd`/$prog" ;;
+esac
+
+# FIXME: add hostname here for parallel makes that run commands on
+# other machines.  But that might take us over the 14-char limit.
+dirname=ylwrap$$
+do_exit="cd '`pwd`' && rm -rf $dirname > /dev/null 2>&1;"' (exit $ret); exit $ret'
+trap "ret=129; $do_exit" 1
+trap "ret=130; $do_exit" 2
+trap "ret=141; $do_exit" 13
+trap "ret=143; $do_exit" 15
+mkdir $dirname || exit 1
+
+cd $dirname
+
+case $# in
+  0) "$prog" "$input" ;;
+  *) "$prog" "$@" "$input" ;;
+esac
+ret=$?
+
+if test $ret -eq 0; then
+  set X $pairlist
+  shift
+  first=yes
+  # Since DOS filename conventions don't allow two dots,
+  # the DOS version of Bison writes out y_tab.c instead of y.tab.c
+  # and y_tab.h instead of y.tab.h. Test to see if this is the case.
+  y_tab_nodot="no"
+  if test -f y_tab.c || test -f y_tab.h; then
+    y_tab_nodot="yes"
+  fi
+
+  # The directory holding the input.
+  input_dir=`echo "$input" | sed -e 's,\([\\/]\)[^\\/]*$,\1,'`
+  # Quote $INPUT_DIR so we can use it in a regexp.
+  # FIXME: really we should care about more than `.' and `\'.
+  input_rx=`echo "$input_dir" | sed 's,\\\\,\\\\\\\\,g;s,\\.,\\\\.,g'`
+
+  while test "$#" -ne 0; do
+    from="$1"
+    # Handle y_tab.c and y_tab.h output by DOS
+    if test $y_tab_nodot = "yes"; then
+      if test $from = "y.tab.c"; then
+        from="y_tab.c"
+      else
+        if test $from = "y.tab.h"; then
+          from="y_tab.h"
+        fi
+      fi
+    fi
+    if test -f "$from"; then
+      # If $2 is an absolute path name, then just use that,
+      # otherwise prepend `../'.
+      case "$2" in
+        [\\/]* | ?:[\\/]*) target="$2";;
+        *) target="../$2";;
+      esac
+
+      # We do not want to overwrite a header file if it hasn't
+      # changed.  This avoid useless recompilations.  However the
+      # parser itself (the first file) should always be updated,
+      # because it is the destination of the .y.c rule in the
+      # Makefile.  Divert the output of all other files to a temporary
+      # file so we can compare them to existing versions.
+      if test $first = no; then
+        realtarget="$target"
+        target="tmp-`echo $target | sed s/.*[\\/]//g`"
+      fi
+      # Edit out `#line' or `#' directives.
+      #
+      # We don't want the resulting debug information to point at
+      # an absolute srcdir; it is better for it to just mention the
+      # .y file with no path.
+      #
+      # We want to use the real output file name, not yy.lex.c for
+      # instance.
+      #
+      # We want the include guards to be adjusted too.
+      FROM=`echo "$from" | sed \
+            -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'\
+            -e 's/[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]/_/g'`
+      TARGET=`echo "$2" | sed \
+            -e 'y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'\
+            -e 's/[^ABCDEFGHIJKLMNOPQRSTUVWXYZ]/_/g'`
+
+      sed -e "/^#/!b" -e "s,$input_rx,," -e "s,$from,$2," \
+          -e "s,$FROM,$TARGET," "$from" >"$target" || ret=$?
+
+      # Check whether header files must be updated.
+      if test $first = no; then
+        if test -f "$realtarget" && cmp -s "$realtarget" "$target"; then
+          echo "$2" is unchanged
+          rm -f "$target"
+        else
+          echo updating "$2"
+          mv -f "$target" "$realtarget"
+        fi
+      fi
+    else
+      # A missing file is only an error for the first file.  This
+      # is a blatant hack to let us support using "yacc -d".  If -d
+      # is not specified, we don't want an error when the header
+      # file is "missing".
+      if test $first = yes; then
+        ret=1
+      fi
+    fi
+    shift
+    shift
+    first=no
+  done
+else
+  ret=$?
+fi
+
+# Remove the directory.
+cd ..
+rm -rf $dirname
+
+exit $ret
+
+# Local Variables:
+# mode: shell-script
+# sh-indentation: 2
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End: